diff --git a/.circleci/config.yml b/.circleci/config.yml
new file mode 100644
index 0000000..44d8173
--- /dev/null
+++ b/.circleci/config.yml
@@ -0,0 +1,7 @@
+version: 2.1
+orbs:
+    hello: circleci/hello-build@0.0.5
+workflows:
+    "Hello Workflow":
+        jobs:
+          - hello/hello-build
diff --git a/.dockerignore b/.dockerignore
new file mode 100644
index 0000000..5874b8c
--- /dev/null
+++ b/.dockerignore
@@ -0,0 +1,2 @@
+.git
+target
diff --git a/.github/ISSUE_TEMPLATE.md b/.github/ISSUE_TEMPLATE.md
new file mode 100644
index 0000000..cb67232
--- /dev/null
+++ b/.github/ISSUE_TEMPLATE.md
@@ -0,0 +1,7 @@
+**Do you want to request a *feature* or report a *bug*?**
+
+**What is the current behavior?**
+
+**If the current behavior is a bug, please provide the steps to reproduce and if possible a minimal demo of the problem.**
+
+**What is the expected behavior?**
diff --git a/.github/PULL_REQUEST_TEMPLATE.md b/.github/PULL_REQUEST_TEMPLATE.md
new file mode 100644
index 0000000..e69de29
diff --git a/.github/dependabot.yml b/.github/dependabot.yml
new file mode 100644
index 0000000..44043c3
--- /dev/null
+++ b/.github/dependabot.yml
@@ -0,0 +1,114 @@
+version: 2
+updates:
+- package-ecosystem: cargo
+  directory: "/"
+  schedule:
+    interval: weekly
+  open-pull-requests-limit: 10
+  ignore:
+  - dependency-name: hyper
+    versions:
+    - ">= 0.14.a, < 0.15"
+  - dependency-name: jsonrpc-core
+    versions:
+    - ">= 12.a, < 13"
+  - dependency-name: postgres
+    versions:
+    - ">= 0.17.a, < 0.18"
+  - dependency-name: rand
+    versions:
+    - ">= 0.7.a, < 0.8"
+  - dependency-name: reqwest
+    versions:
+    - ">= 0.11.a, < 0.12"
+  - dependency-name: futures
+    versions:
+    - 0.3.14
+  - dependency-name: wasmparser
+    versions:
+    - 0.77.0
+  - dependency-name: serde
+    versions:
+    - 1.0.123
+    - 1.0.124
+    - 1.0.125
+  - dependency-name: priority-queue
+    versions:
+    - 1.0.5
+    - 1.1.1
+  - dependency-name: rand
+    versions:
+    - 0.8.3
+  - dependency-name: wasmtime
+    versions:
+    - 0.24.0
+    - 0.25.0
+  - dependency-name: syn
+    versions:
+    - 1.0.48
+    - 1.0.62
+  - dependency-name: num-bigint
+    versions:
+    - 0.4.0
+  - dependency-name: postgres
+    versions:
+    - 0.19.0
+  - dependency-name: ipfs-api
+    versions:
+    - 0.10.0
+    - 0.11.0
+  - dependency-name: backtrace
+    versions:
+    - 0.3.56
+  - dependency-name: lru_time_cache
+    versions:
+    - 0.11.6
+    - 0.11.7
+    - 0.11.8
+  - dependency-name: mockall
+    versions:
+    - 0.9.1
+  - dependency-name: serde_json
+    versions:
+    - 1.0.62
+    - 1.0.64
+  - dependency-name: shellexpand
+    versions:
+    - 2.1.0
+  - dependency-name: async-trait
+    versions:
+    - 0.1.42
+  - dependency-name: toml
+    versions:
+    - 0.5.8
+  - dependency-name: regex
+    versions:
+    - 1.4.3
+  - dependency-name: uuid
+    versions:
+    - 0.8.2
+  - dependency-name: thiserror
+    versions:
+    - 1.0.23
+    - 1.0.24
+  - dependency-name: http
+    versions:
+    - 0.2.3
+  - dependency-name: env_logger
+    versions:
+    - 0.8.3
+  - dependency-name: slog-term
+    versions:
+    - 2.8.0
+  - dependency-name: jsonrpc-http-server
+    versions:
+    - 17.0.0
+  - dependency-name: bytes
+    versions:
+    - 1.0.1
+  - dependency-name: slog-async
+    versions:
+    - 2.6.0
+  - dependency-name: jsonrpc-core
+    versions:
+    - 17.0.0
diff --git a/.github/workflows/audit.yml b/.github/workflows/audit.yml
new file mode 100644
index 0000000..f4fdaad
--- /dev/null
+++ b/.github/workflows/audit.yml
@@ -0,0 +1,17 @@
+# See https://github.com/actions-rs/audit-check
+name: Security audit
+on:
+  # push:
+  #  paths:
+  #    - '**/Cargo.toml'
+  #    - '**/Cargo.lock'
+  schedule:
+    - cron: '0 0 */7 * *'
+jobs:
+  security_audit:
+    runs-on: ubuntu-latest
+    steps:
+      - uses: actions/checkout@v2
+      - uses: actions-rs/audit-check@v1
+        with:
+          token: ${{ secrets.GITHUB_TOKEN }}
diff --git a/.github/workflows/ci.yml b/.github/workflows/ci.yml
new file mode 100644
index 0000000..984ca99
--- /dev/null
+++ b/.github/workflows/ci.yml
@@ -0,0 +1,301 @@
+name: Continuous Integration
+
+on:
+  push:
+    branches: [master]
+  pull_request:
+    types: [opened, synchronize, reopened]
+
+env:
+  CARGO_TERM_COLOR: always
+  RUST_BACKTRACE: full
+  THEGRAPH_STORE_POSTGRES_DIESEL_URL: "postgresql://postgres:postgres@localhost:5432/graph_node_test"
+
+jobs:
+  unit-tests:
+    name: Run unit tests
+    strategy:
+      fail-fast: false
+      matrix:
+        rust: ["stable"]
+    runs-on: ubuntu-latest
+    services:
+      ipfs:
+        image: ipfs/go-ipfs:v0.10.0
+        ports:
+          - 5001:5001
+      postgres:
+        image: postgres
+        env:
+          POSTGRES_PASSWORD: postgres
+          POSTGRES_DB: graph_node_test
+        options: >-
+          --health-cmd pg_isready
+          --health-interval 10s
+          --health-timeout 5s
+          --health-retries 5
+        ports:
+          - 5432:5432
+    steps:
+      - name: Checkout sources
+        uses: actions/checkout@v2
+
+      - name: Cache cargo registry
+        uses: actions/cache@v2
+        with:
+          path: |
+            ~/.cargo/registry
+            ~/.cargo/git
+          key: test-cargo-${{ hashFiles('**/Cargo.toml') }}
+
+      - name: Install rust toolchain
+        uses: actions-rs/toolchain@v1
+        with:
+          profile: minimal
+          toolchain: ${{ matrix.rust }}
+          override: true
+
+      - name: Install lld
+        run: sudo apt-get install -y lld
+
+      - name: Run unit tests
+        uses: actions-rs/cargo@v1
+        env:
+          RUSTFLAGS: "-C link-arg=-fuse-ld=lld -D warnings"
+        with:
+          command: test
+          args: --verbose --workspace --exclude graph-tests -- --nocapture
+
+  runner-tests:
+    name: Subgraph Runner integration tests
+    strategy:
+      fail-fast: false
+      matrix:
+        rust: ["stable"]
+    runs-on: ubuntu-latest
+    services:
+      ipfs:
+        image: ipfs/go-ipfs:v0.10.0
+        ports:
+          - 5001:5001
+      postgres:
+        image: postgres
+        env:
+          POSTGRES_PASSWORD: postgres
+          POSTGRES_DB: graph_node_test
+        options: >-
+          --health-cmd pg_isready
+          --health-interval 10s
+          --health-timeout 5s
+          --health-retries 5
+        ports:
+          - 5432:5432
+    steps:
+      - name: Checkout sources
+        uses: actions/checkout@v2
+
+      - name: Cache cargo registry
+        uses: actions/cache@v2
+        with:
+          path: |
+            ~/.cargo/registry
+            ~/.cargo/git
+          key: test-cargo-${{ hashFiles('**/Cargo.toml') }}
+
+      - name: Install rust toolchain
+        uses: actions-rs/toolchain@v1
+        with:
+          profile: minimal
+          toolchain: ${{ matrix.rust }}
+          override: true
+
+      - name: Install lld
+        run: sudo apt-get install -y lld
+
+      - name: Run runner tests
+        id: runner-tests-1
+        uses: actions-rs/cargo@v1
+        env:
+          RUSTFLAGS: "-C link-arg=-fuse-ld=lld -D warnings"
+          TESTS_GANACHE_HARD_WAIT_SECONDS: "30"
+        with:
+          command: test
+          args: --verbose --package graph-tests -- --skip parallel_integration_tests
+
+  integration-tests:
+    name: Run integration tests
+    strategy:
+      fail-fast: false
+      matrix:
+        rust: ["stable"]
+    runs-on: ubuntu-latest
+
+    steps:
+      - name: Checkout sources
+        uses: actions/checkout@v2
+
+      - name: Cache cargo registry
+        uses: actions/cache@v2
+        with:
+          path: |
+            ~/.cargo/registry
+            ~/.cargo/git
+          key: test-cargo-${{ hashFiles('**/Cargo.toml') }}
+
+      - name: Install Node 14
+        uses: actions/setup-node@v2
+        with:
+          node-version: "14"
+
+      - name: Install rust toolchain
+        uses: actions-rs/toolchain@v1
+        with:
+          profile: minimal
+          toolchain: ${{ matrix.rust }}
+          override: true
+
+      - name: Install lld and jq
+        run: sudo apt-get install -y lld jq
+
+      - name: Build graph-node
+        env:
+          RUSTFLAGS: "-C link-arg=-fuse-ld=lld -D warnings"
+        uses: actions-rs/cargo@v1
+        with:
+          command: build
+
+      # Integration tests are a bit flaky, running them twice increases the
+      # chances of one run succeeding
+      - name: Run integration tests (round 1)
+        id: integration-tests-1
+        uses: actions-rs/cargo@v1
+        env:
+          RUSTFLAGS: "-C link-arg=-fuse-ld=lld -D warnings"
+          N_CONCURRENT_TESTS: "1"
+          TESTS_GANACHE_HARD_WAIT_SECONDS: "30"
+        with:
+          command: test
+          args: --verbose --package graph-tests parallel_integration_tests -- --nocapture
+        continue-on-error: true
+      - name: Run integration tests (round 2)
+        id: integration-tests-2
+        uses: actions-rs/cargo@v1
+        if: ${{ steps.integration-tests-1.outcome == 'failure' }}
+        env:
+          RUSTFLAGS: "-C link-arg=-fuse-ld=lld -D warnings"
+          N_CONCURRENT_TESTS: "1"
+          TESTS_GANACHE_HARD_WAIT_SECONDS: "30"
+        with:
+          command: test
+          args: --verbose --package graph-tests parallel_integration_tests -- --nocapture
+
+  rustfmt:
+    name: Check rustfmt style
+    strategy:
+      matrix:
+        rust: ["stable"]
+    runs-on: ubuntu-latest
+    steps:
+      - uses: actions/checkout@v2
+      - uses: actions-rs/toolchain@v1
+        with:
+          profile: minimal
+          toolchain: ${{ matrix.rust }}
+          components: rustfmt
+          override: true
+
+      - name: Check formatting
+        uses: actions-rs/cargo@v1
+        env:
+          RUSTFLAGS: "-D warnings"
+        with:
+          command: fmt
+          args: --all -- --check
+
+  clippy:
+    name: Report Clippy warnings
+    strategy:
+      matrix:
+        rust: ["stable"]
+    runs-on: ubuntu-latest
+    steps:
+      - uses: actions/checkout@v2
+      - uses: actions-rs/toolchain@v1
+        with:
+          profile: minimal
+          toolchain: ${{ matrix.rust }}
+          components: clippy
+          override: true
+      # Unlike rustfmt, Clippy actually compiles stuff so it benefits from
+      # caching.
+      - name: Cache cargo registry
+        uses: actions/cache@v2
+        with:
+          path: |
+            ~/.cargo/registry
+            ~/.cargo/git
+          key: check-cargo-${{ hashFiles('**/Cargo.toml') }}
+
+      - name: Run Clippy
+        uses: actions-rs/cargo@v1
+        # We do *not* block builds if Clippy complains. It's just here to let us
+        # keep an eye out on the warnings it produces.
+        continue-on-error: true
+        with:
+          command: clippy
+
+  release-check:
+    name: Build in release mode
+    strategy:
+      matrix:
+        rust: ["stable"]
+    runs-on: ubuntu-latest
+    steps:
+      - uses: actions/checkout@v2
+      - uses: actions-rs/toolchain@v1
+        with:
+          profile: minimal
+          toolchain: ${{ matrix.rust }}
+          override: true
+      - name: Cache cargo registry
+        uses: actions/cache@v2
+        with:
+          path: |
+            ~/.cargo/registry
+            ~/.cargo/git
+          key: check-cargo-${{ hashFiles('**/Cargo.toml') }}
+
+      - name: Install dependencies
+        run: |
+          sudo apt-get update
+          sudo apt-get -y install libpq-dev
+
+      - name: Cargo check (debug)
+        uses: actions-rs/cargo@v1
+        env:
+          RUSTFLAGS: "-D warnings"
+        with:
+          command: check
+          args: --tests
+
+      - name: Cargo check (release)
+        env:
+          RUSTFLAGS: "-D warnings"
+        uses: actions-rs/cargo@v1
+        with:
+          command: check
+          args: --release
+
+  version-check:
+    name: Check that all graph-node crates have the same version
+    runs-on: ubuntu-latest
+    steps:
+      - uses: actions/checkout@v2
+      - name: Checks through all Cargo.toml files, making sure their version is unique
+        run: |
+          source 'scripts/toml-utils.sh'
+
+          ALL_TOML_FILE_NAMES=$(get_all_toml_files)
+          ALL_TOML_VERSIONS=$(get_all_toml_versions $ALL_TOML_FILE_NAMES)
+
+          ./scripts/lines-unique.sh $ALL_TOML_VERSIONS
diff --git a/.gitignore b/.gitignore
new file mode 100644
index 0000000..874a814
--- /dev/null
+++ b/.gitignore
@@ -0,0 +1,26 @@
+# Generated by Cargo
+# will have compiled files and executables
+/target/
+
+# These are backup files generated by rustfmt
+**/*.rs.bk
+**/*.idea
+**/*.DS_STORE
+
+# IDE files
+.vscode/
+
+# Ignore data files created by running the Docker Compose setup locally
+/docker/data/
+/docker/parity/chains/
+/docker/parity/network/
+
+/tests/integration-tests/**/build
+/tests/integration-tests/**/generated
+/tests/integration-tests/**/node_modules
+/tests/integration-tests/**/yarn.lock
+/tests/integration-tests/**/yarn-error.log
+
+# Built solidity contracts.
+/tests/integration-tests/**/bin
+/tests/integration-tests/**/truffle_output
diff --git a/.ignore b/.ignore
new file mode 100644
index 0000000..c3517de
--- /dev/null
+++ b/.ignore
@@ -0,0 +1,4 @@
+# Make `cargo watch` ignore changes in integration tests
+tests/integration-tests/**/build
+tests/integration-tests/**/generated
+tests/integration-tests/**/node_modules
diff --git a/.travis.yml b/.travis.yml
new file mode 100644
index 0000000..dcaabb1
--- /dev/null
+++ b/.travis.yml
@@ -0,0 +1,87 @@
+dist: bionic
+language: rust
+# This line would cache cargo-audit once installed,
+# but instead will fail from the 10 minute timeout after
+# printing the line "creating directory /home/travis/.cache/sccache"
+#cache: cargo
+rust:
+  - stable
+  - beta
+
+# Select pre-installed services
+addons:
+  postgresql: "10"
+  apt:
+    packages:
+      - postgresql-10
+      - postgresql-client-10
+services:
+  - postgresql
+  - docker
+
+before_install:
+  # Install Node.js 11.x
+  - nvm install 11 && nvm use 11
+  # Install IPFS
+  - wget "https://dist.ipfs.io/go-ipfs/v0.10.0/go-ipfs_v0.10.0_linux-amd64.tar.gz" -O /tmp/ipfs.tar.gz
+  - pushd . && cd $HOME/bin && tar -xzvf /tmp/ipfs.tar.gz && popd
+  - export PATH="$HOME/bin/go-ipfs:$PATH"
+  - ipfs init
+
+matrix:
+  fast_finish: true
+  include:
+    # Some env var is always necessary to differentiate included builds
+    # Check coding style
+    - env: CHECK_FORMATTING=true
+      rust: stable
+      script:
+        - rustup component add rustfmt
+        - cargo fmt --all -- --check
+
+    # Make sure release builds compile
+    - env: CHECK_RELEASE=true
+      rust: stable
+      script:
+        - cargo check --release
+
+    # Check for warnings
+    - env: RUSTFLAGS="-D warnings"
+      rust: stable
+      script:
+        - cargo check --tests
+
+    # Build tagged commits in release mode
+    - env: RELEASE=true
+      if: tag IS present
+      script:
+        - cargo build -p graph-node --release
+        - mv target/release/graph-node target/release/graph-node-$TRAVIS_OS_NAME
+
+env:
+  global:
+    - PGPORT=5432
+    - THEGRAPH_STORE_POSTGRES_DIESEL_URL=postgresql://travis:travis@localhost:5432/graph_node_test
+    # Added because https://nodejs.org/dist/ had issues
+    - NVM_NODEJS_ORG_MIRROR=https://cnpmjs.org/mirrors/node/
+
+# Test pipeline
+before_script:
+  - psql -c "ALTER USER travis WITH PASSWORD 'travis';"
+  - psql -c 'create database graph_node_test;' -U travis
+
+script:
+  # Run tests
+  - ipfs daemon &> /dev/null &
+  - RUST_BACKTRACE=1 cargo test --verbose --all -- --nocapture
+  - killall ipfs
+
+deploy:
+  provider: releases
+  api_key:
+    secure: ygpZedRG+/Qg/lPhifyNQ+4rExjZ4nGyJjB4DYT1fuePMyKXfiCPGicaWRGR3ZnZGNRjdKaIkF97vBsZ0aHwW+AykwOxlXrkAFvCKA0Tb82vaYqCLrBs/Y5AEhuCWLFDz5cXDPMkptf+uLX/s3JCF0Mxo5EBN2JfBQ8vS6ScKEwqn2TiLLBQKTQ4658TFM4H5KiXktpyVVdlRvpoS3pRIPMqNU/QpGPQigaiKyYD5+azCrAXeaKT9bBS1njVbxI69Go4nraWZn7wIhZCrwJ+MxGNTOxwasypsWm/u1umhRVLM1rL2i7RRqkIvzwn22YMaU7FZKCx8huXcj0cB8NtHZSw7GhJDDDv3e7puZxl3m/c/7ks76UF95syLzoM/9FWEFew8Ti+5MApzKQj5YWHOCIEzBWPeqAcA8Y+Az7w2h1ZgNbjDgSvjGAFSpE8m+SM0A2TOOZ1g/t/yfbEl8CWO6Y8v2x1EONkp7X0CqJgASMp+h8kzKCbuYyRnghlToY+5wYuh4M9Qg9UeJCt9dOblRBVJwW5CFr62kgE/gso8F9tXXHkRTv3hfk5madZR1Vn5A7KadEO8epfV4IQNsd+VHfoxoJSprx5f77Q2bLMBD1GT/qMqECgSznoTkU5ajkKJRqUw4AwLTohrYir76j61eQfxOhXExY/EM8xvlxpd1w=
+  file: target/release/graph-node-$TRAVIS_OS_NAME
+  repo: graphprotocol/graph-node
+  on:
+    tags: true
+  skip_cleanup: true
diff --git a/CODE_OF_CONDUCT.md b/CODE_OF_CONDUCT.md
new file mode 100644
index 0000000..1fe0dd2
--- /dev/null
+++ b/CODE_OF_CONDUCT.md
@@ -0,0 +1,46 @@
+# Contributor Covenant Code of Conduct
+
+## Our Pledge
+
+In the interest of fostering an open and welcoming environment, we as contributors and maintainers pledge to making participation in our project and our community a harassment-free experience for everyone, regardless of age, body size, disability, ethnicity, gender identity and expression, level of experience, nationality, personal appearance, race, religion, or sexual identity and orientation.
+
+## Our Standards
+
+Examples of behavior that contributes to creating a positive environment include:
+
+* Using welcoming and inclusive language
+* Being respectful of differing viewpoints and experiences
+* Gracefully accepting constructive criticism
+* Focusing on what is best for the community
+* Showing empathy towards other community members
+
+Examples of unacceptable behavior by participants include:
+
+* The use of sexualized language or imagery and unwelcome sexual attention or advances
+* Trolling, insulting/derogatory comments, and personal or political attacks
+* Public or private harassment
+* Publishing others' private information, such as a physical or electronic address, without explicit permission
+* Other conduct which could reasonably be considered inappropriate in a professional setting
+
+## Our Responsibilities
+
+Project maintainers are responsible for clarifying the standards of acceptable behavior and are expected to take appropriate and fair corrective action in response to any instances of unacceptable behavior.
+
+Project maintainers have the right and responsibility to remove, edit, or reject comments, commits, code, wiki edits, issues, and other contributions that are not aligned to this Code of Conduct, or to ban temporarily or permanently any contributor for other behaviors that they deem inappropriate, threatening, offensive, or harmful.
+
+## Scope
+
+This Code of Conduct applies both within project spaces and in public spaces when an individual is representing the project or its community. Examples of representing a project or community include using an official project e-mail address, posting via an official social media account, or acting as an appointed representative at an online or offline event. Representation of a project may be further defined and clarified by project maintainers.
+
+## Enforcement
+
+Instances of abusive, harassing, or otherwise unacceptable behavior may be reported by contacting the project team at info@thegraph.com. The project team will review and investigate all complaints, and will respond in a way that it deems appropriate to the circumstances. The project team is obligated to maintain confidentiality with regard to the reporter of an incident. Further details of specific enforcement policies may be posted separately.
+
+Project maintainers who do not follow or enforce the Code of Conduct in good faith may face temporary or permanent repercussions as determined by other members of the project's leadership.
+
+## Attribution
+
+This Code of Conduct is adapted from the [Contributor Covenant][homepage], version 1.4, available at [http://contributor-covenant.org/version/1/4][version]
+
+[homepage]: http://contributor-covenant.org
+[version]: http://contributor-covenant.org/version/1/4/
diff --git a/CONTRIBUTING.md b/CONTRIBUTING.md
new file mode 100644
index 0000000..aa67ac5
--- /dev/null
+++ b/CONTRIBUTING.md
@@ -0,0 +1,96 @@
+
+# Contributing to graph-node
+
+Welcome to the Graph Protocol! Thanks a ton for your interest in contributing.
+
+If you run into any problems feel free to create an issue. PRs are much appreciated for simple things. Here's [a list of good first issues](https://github.com/graphprotocol/graph-node/labels/good%20first%20issue). If it's something more complex we'd appreciate having a quick chat in GitHub Issues or Discord.
+
+Join the conversation on our [Discord](https://discord.gg/9a5VCua).
+
+Please follow the [Code of Conduct](https://github.com/graphprotocol/graph-node/blob/master/CODE_OF_CONDUCT.md) for all the communications and at events. Thank you!
+
+## Development flow
+
+Install development helpers:
+
+```sh
+cargo install cargo-watch
+rustup component add rustfmt-preview
+```
+
+Set environment variables:
+
+```sh
+# Only required when testing the Diesel/Postgres store
+export THEGRAPH_STORE_POSTGRES_DIESEL_URL=<Postgres database URL>
+```
+
+- **Note** You can follow Docker Compose instructions in [store/test-store/README.md](./store/test-store/README.md#docker-compose) to easily run a Postgres instance and use `postgresql://graph:graph@127.0.0.1:5432/graph-test` as the Postgres database URL value.
+
+While developing, a useful command to run in the background is this:
+
+```sh
+cargo watch                       \
+    -x "fmt --all"                 \
+    -x check                      \
+    -x "test -- --test-threads=1" \
+    -x "doc --no-deps"
+```
+
+This will watch your source directory and continuously do the following on changes:
+
+1.  Build all packages in the workspace `target/`.
+2.  Generate docs for all packages in the workspace in `target/doc/`.
+3.  Automatically format all your source files.
+
+### Integrations Tests
+
+The tests can (and should) be run against a sharded store. See [store/test-store/README.md](./store/test-store/README.md) for
+detailed instructions about how to run the sharded integrations tests.
+
+## Commit messages and pull requests
+
+We use the following format for commit messages:
+`{crate-name}: {Brief description of changes}`, for example: `store: Support 'Or' filters`.
+
+If multiple crates are being changed list them all like this: `core,
+graphql: Add event source to store` If all (or most) crates are affected
+by the commit, start the message with `all: `.
+
+The body of the message can be terse, with just enough information to
+explain what the commit does overall. In a lot of cases, more extensive
+explanations of _how_ the commit achieves its goal are better as comments
+in the code.
+
+Commits in a pull request should be structured in such a way that each
+commit consists of a small logical step towards the overall goal of the
+pull request. Your pull request should make it as easy as possible for the
+reviewer to follow each change you are making. For example, it is a good
+idea to separate simple mechanical changes like renaming a method that
+touches many files from logic changes. Your pull request should not be
+structured into commits according to how you implemented your feature,
+often indicated by commit messages like 'Fix problem' or 'Cleanup'. Flex a
+bit, and make the world think that you implemented your feature perfectly,
+in small logical steps, in one sitting without ever having to touch up
+something you did earlier in the pull request. (In reality, that means
+you'll use `git rebase -i` a lot)
+
+Please do not merge master into your branch as you develop your pull
+request; instead, rebase your branch on top of the latest master if your
+pull request branch is long-lived.
+
+We try to keep the hostory of the `master` branch linear, and avoid merge
+commits. Once your pull request is approved, merge it following these
+steps:
+```
+git checkout master
+git pull master
+git rebase master my/branch
+git push -f
+git checkout master
+git merge my/branch
+git push
+```
+
+Allegedly, clicking on the `Rebase and merge` button in the Github UI has
+the same effect.
diff --git a/Cargo.lock b/Cargo.lock
new file mode 100644
index 0000000..3a10677
--- /dev/null
+++ b/Cargo.lock
@@ -0,0 +1,5353 @@
+# This file is automatically @generated by Cargo.
+# It is not intended for manual editing.
+version = 3
+
+[[package]]
+name = "Inflector"
+version = "0.11.4"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "fe438c63458706e03479442743baae6c88256498e6431708f6dfc520a26515d3"
+dependencies = [
+ "lazy_static",
+ "regex",
+]
+
+[[package]]
+name = "addr2line"
+version = "0.15.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "e7a2e47a1fbe209ee101dd6d61285226744c6c8d3c21c8dc878ba6cb9f467f3a"
+dependencies = [
+ "gimli 0.24.0",
+]
+
+[[package]]
+name = "addr2line"
+version = "0.16.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "3e61f2b7f93d2c7d2b08263acaa4a363b3e276806c68af6134c44f523bf1aacd"
+dependencies = [
+ "gimli 0.25.0",
+]
+
+[[package]]
+name = "adler"
+version = "1.0.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "f26201604c87b1e01bd3d98f8d5d9a8fcbb815e8cedb41ffccbeb4bf593a35fe"
+
+[[package]]
+name = "aho-corasick"
+version = "0.7.18"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "1e37cfd5e7657ada45f742d6e99ca5788580b5c529dc78faf11ece6dc702656f"
+dependencies = [
+ "memchr",
+]
+
+[[package]]
+name = "android_system_properties"
+version = "0.1.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "819e7219dbd41043ac279b19830f2efc897156490d7fd6ea916720117ee66311"
+dependencies = [
+ "libc",
+]
+
+[[package]]
+name = "anyhow"
+version = "1.0.65"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "98161a4e3e2184da77bb14f02184cdd111e83bbbcc9979dfee3c44b9a85f5602"
+
+[[package]]
+name = "arc-swap"
+version = "1.3.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "e906254e445520903e7fc9da4f709886c84ae4bc4ddaf0e093188d66df4dc820"
+
+[[package]]
+name = "arrayref"
+version = "0.3.6"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "a4c527152e37cf757a3f78aae5a06fbeefdb07ccc535c980a3208ee3060dd544"
+
+[[package]]
+name = "arrayvec"
+version = "0.5.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "23b62fc65de8e4e7f52534fb52b0f3ed04746ae267519eef2a83941e8085068b"
+
+[[package]]
+name = "arrayvec"
+version = "0.7.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "8da52d66c7071e2e3fa2a1e5c6d088fec47b593032b254f5e980de8ea54454d6"
+
+[[package]]
+name = "ascii"
+version = "0.9.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "eab1c04a571841102f5345a8fc0f6bb3d31c315dec879b5c6e42e40ce7ffa34e"
+
+[[package]]
+name = "async-recursion"
+version = "1.0.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "2cda8f4bcc10624c4e85bc66b3f452cca98cfa5ca002dc83a16aad2367641bea"
+dependencies = [
+ "proc-macro2",
+ "quote",
+ "syn",
+]
+
+[[package]]
+name = "async-stream"
+version = "0.3.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "dad5c83079eae9969be7fadefe640a1c566901f05ff91ab221de4b6f68d9507e"
+dependencies = [
+ "async-stream-impl",
+ "futures-core",
+]
+
+[[package]]
+name = "async-stream-impl"
+version = "0.3.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "10f203db73a71dfa2fb6dd22763990fa26f3d2625a6da2da900d23b87d26be27"
+dependencies = [
+ "proc-macro2",
+ "quote",
+ "syn",
+]
+
+[[package]]
+name = "async-trait"
+version = "0.1.51"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "44318e776df68115a881de9a8fd1b9e53368d7a4a5ce4cc48517da3393233a5e"
+dependencies = [
+ "proc-macro2",
+ "quote",
+ "syn",
+]
+
+[[package]]
+name = "atomic_refcell"
+version = "0.1.8"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "73b5e5f48b927f04e952dedc932f31995a65a0bf65ec971c74436e51bf6e970d"
+
+[[package]]
+name = "atty"
+version = "0.2.14"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d9b39be18770d11421cdb1b9947a45dd3f37e93092cbf377614828a319d5fee8"
+dependencies = [
+ "hermit-abi",
+ "libc",
+ "winapi",
+]
+
+[[package]]
+name = "autocfg"
+version = "1.0.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "cdb031dd78e28731d87d56cc8ffef4a8f36ca26c38fe2de700543e627f8a464a"
+
+[[package]]
+name = "axum"
+version = "0.5.4"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "f4af7447fc1214c1f3a1ace861d0216a6c8bb13965b64bbad9650f375b67689a"
+dependencies = [
+ "async-trait",
+ "axum-core",
+ "bitflags",
+ "bytes",
+ "futures-util",
+ "http",
+ "http-body",
+ "hyper",
+ "itoa 1.0.1",
+ "matchit",
+ "memchr",
+ "mime",
+ "percent-encoding",
+ "pin-project-lite",
+ "serde",
+ "sync_wrapper",
+ "tokio",
+ "tower 0.4.12 (registry+https://github.com/rust-lang/crates.io-index)",
+ "tower-http",
+ "tower-layer 0.3.1 (registry+https://github.com/rust-lang/crates.io-index)",
+ "tower-service 0.3.1 (registry+https://github.com/rust-lang/crates.io-index)",
+]
+
+[[package]]
+name = "axum-core"
+version = "0.2.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "3bdc19781b16e32f8a7200368a336fa4509d4b72ef15dd4e41df5290855ee1e6"
+dependencies = [
+ "async-trait",
+ "bytes",
+ "futures-util",
+ "http",
+ "http-body",
+ "mime",
+]
+
+[[package]]
+name = "backtrace"
+version = "0.3.61"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "e7a905d892734eea339e896738c14b9afce22b5318f64b951e70bf3844419b01"
+dependencies = [
+ "addr2line 0.16.0",
+ "cc",
+ "cfg-if 1.0.0",
+ "libc",
+ "miniz_oxide 0.4.4",
+ "object 0.26.0",
+ "rustc-demangle",
+]
+
+[[package]]
+name = "base-x"
+version = "0.2.11"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "4cbbc9d0964165b47557570cce6c952866c2678457aca742aafc9fb771d30270"
+
+[[package]]
+name = "base64"
+version = "0.13.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "904dfeac50f3cdaba28fc6f57fdcddb75f49ed61346676a78c4ffe55877802fd"
+
+[[package]]
+name = "base64-url"
+version = "1.4.13"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "67a99c239d0c7e77c85dddfa9cebce48704b3c49550fcd3b84dd637e4484899f"
+dependencies = [
+ "base64",
+]
+
+[[package]]
+name = "beef"
+version = "0.5.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "3a8241f3ebb85c056b509d4327ad0358fbbba6ffb340bf388f26350aeda225b1"
+dependencies = [
+ "serde",
+]
+
+[[package]]
+name = "bigdecimal"
+version = "0.1.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "1374191e2dd25f9ae02e3aa95041ed5d747fc77b3c102b49fe2dd9a8117a6244"
+dependencies = [
+ "num-bigint",
+ "num-integer",
+ "num-traits",
+ "serde",
+]
+
+[[package]]
+name = "bincode"
+version = "1.3.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "b1f45e9417d87227c7a56d22e471c6206462cba514c7590c09aff4cf6d1ddcad"
+dependencies = [
+ "serde",
+]
+
+[[package]]
+name = "bitflags"
+version = "1.3.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "2da1976d75adbe5fbc88130ecd119529cf1cc6a93ae1546d8696ee66f0d21af1"
+
+[[package]]
+name = "bitvec"
+version = "1.0.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "1489fcb93a5bb47da0462ca93ad252ad6af2145cce58d10d46a83931ba9f016b"
+dependencies = [
+ "funty",
+ "radium",
+ "tap",
+ "wyz",
+]
+
+[[package]]
+name = "blake2b_simd"
+version = "1.0.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "72936ee4afc7f8f736d1c38383b56480b5497b4617b4a77bdbf1d2ababc76127"
+dependencies = [
+ "arrayref",
+ "arrayvec 0.7.2",
+ "constant_time_eq",
+]
+
+[[package]]
+name = "blake2s_simd"
+version = "1.0.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "db539cc2b5f6003621f1cd9ef92d7ded8ea5232c7de0f9faa2de251cd98730d4"
+dependencies = [
+ "arrayref",
+ "arrayvec 0.7.2",
+ "constant_time_eq",
+]
+
+[[package]]
+name = "blake3"
+version = "0.3.8"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "b64485778c4f16a6a5a9d335e80d449ac6c70cdd6a06d2af18a6f6f775a125b3"
+dependencies = [
+ "arrayref",
+ "arrayvec 0.5.2",
+ "cc",
+ "cfg-if 0.1.10",
+ "constant_time_eq",
+ "crypto-mac 0.8.0",
+ "digest 0.9.0",
+]
+
+[[package]]
+name = "blake3"
+version = "1.3.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "a08e53fc5a564bb15bfe6fae56bd71522205f1f91893f9c0116edad6496c183f"
+dependencies = [
+ "arrayref",
+ "arrayvec 0.7.2",
+ "cc",
+ "cfg-if 1.0.0",
+ "constant_time_eq",
+ "digest 0.10.3",
+]
+
+[[package]]
+name = "block-buffer"
+version = "0.9.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "4152116fd6e9dadb291ae18fc1ec3575ed6d84c29642d97890f4b4a3417297e4"
+dependencies = [
+ "generic-array",
+]
+
+[[package]]
+name = "block-buffer"
+version = "0.10.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "0bf7fe51849ea569fd452f37822f606a5cabb684dc918707a0193fd4664ff324"
+dependencies = [
+ "generic-array",
+]
+
+[[package]]
+name = "bollard"
+version = "0.10.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "699194c00f3a2effd3358d47f880646818e3d483190b17ebcdf598c654fb77e9"
+dependencies = [
+ "base64",
+ "bollard-stubs",
+ "bytes",
+ "chrono",
+ "ct-logs",
+ "dirs-next",
+ "futures-core",
+ "futures-util",
+ "hex",
+ "http",
+ "hyper",
+ "hyper-unix-connector",
+ "log",
+ "pin-project",
+ "serde",
+ "serde_derive",
+ "serde_json",
+ "serde_urlencoded",
+ "thiserror",
+ "tokio",
+ "tokio-util 0.6.7",
+ "url",
+ "winapi",
+]
+
+[[package]]
+name = "bollard-stubs"
+version = "1.41.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "ed2f2e73fffe9455141e170fb9c1feb0ac521ec7e7dcd47a7cab72a658490fb8"
+dependencies = [
+ "chrono",
+ "serde",
+ "serde_with",
+]
+
+[[package]]
+name = "bs58"
+version = "0.4.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "771fe0050b883fcc3ea2359b1a96bcfbc090b7116eae7c3c512c7a083fdf23d3"
+
+[[package]]
+name = "bstr"
+version = "0.2.16"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "90682c8d613ad3373e66de8c6411e0ae2ab2571e879d2efbf73558cc66f21279"
+dependencies = [
+ "memchr",
+]
+
+[[package]]
+name = "bumpalo"
+version = "3.7.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "9c59e7af012c713f529e7a3ee57ce9b31ddd858d4b512923602f74608b009631"
+
+[[package]]
+name = "byte-slice-cast"
+version = "1.2.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "1d30c751592b77c499e7bce34d99d67c2c11bdc0574e9a488ddade14150a4698"
+
+[[package]]
+name = "byteorder"
+version = "1.4.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "14c189c53d098945499cdfa7ecc63567cf3886b3332b312a5b4585d8d3a6a610"
+
+[[package]]
+name = "bytes"
+version = "1.0.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "b700ce4376041dcd0a327fd0097c41095743c4c8af8887265942faf1100bd040"
+
+[[package]]
+name = "cc"
+version = "1.0.69"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "e70cc2f62c6ce1868963827bd677764c62d07c3d9a3e1fb1177ee1a9ab199eb2"
+dependencies = [
+ "jobserver",
+]
+
+[[package]]
+name = "cfg-if"
+version = "0.1.10"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "4785bdd1c96b2a846b2bd7cc02e86b6b3dbf14e7e53446c4f54c92a361040822"
+
+[[package]]
+name = "cfg-if"
+version = "1.0.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "baf1de4339761588bc0619e3cbc0120ee582ebb74b53b4efbf79117bd2da40fd"
+
+[[package]]
+name = "chrono"
+version = "0.4.22"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "bfd4d1b31faaa3a89d7934dbded3111da0d2ef28e3ebccdb4f0179f5929d1ef1"
+dependencies = [
+ "iana-time-zone",
+ "js-sys",
+ "num-integer",
+ "num-traits",
+ "serde",
+ "time",
+ "wasm-bindgen",
+ "winapi",
+]
+
+[[package]]
+name = "cid"
+version = "0.8.6"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "f6ed9c8b2d17acb8110c46f1da5bf4a696d745e1474a16db0cd2b49cd0249bf2"
+dependencies = [
+ "core2",
+ "multibase",
+ "multihash",
+ "serde",
+ "unsigned-varint",
+]
+
+[[package]]
+name = "clap"
+version = "3.2.22"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "86447ad904c7fb335a790c9d7fe3d0d971dc523b8ccd1561a520de9a85302750"
+dependencies = [
+ "atty",
+ "bitflags",
+ "clap_derive",
+ "clap_lex",
+ "indexmap",
+ "once_cell",
+ "strsim",
+ "termcolor",
+ "textwrap",
+]
+
+[[package]]
+name = "clap_derive"
+version = "3.2.18"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "ea0c8bce528c4be4da13ea6fead8965e95b6073585a2f05204bd8f4119f82a65"
+dependencies = [
+ "heck 0.4.0",
+ "proc-macro-error",
+ "proc-macro2",
+ "quote",
+ "syn",
+]
+
+[[package]]
+name = "clap_lex"
+version = "0.2.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "5538cd660450ebeb4234cfecf8f2284b844ffc4c50531e66d584ad5b91293613"
+dependencies = [
+ "os_str_bytes",
+]
+
+[[package]]
+name = "cmake"
+version = "0.1.46"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "b7b858541263efe664aead4a5209a4ae5c5d2811167d4ed4ee0944503f8d2089"
+dependencies = [
+ "cc",
+]
+
+[[package]]
+name = "combine"
+version = "3.8.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "da3da6baa321ec19e1cc41d31bf599f00c783d0517095cdaf0332e3fe8d20680"
+dependencies = [
+ "ascii",
+ "byteorder",
+ "either",
+ "memchr",
+ "unreachable",
+]
+
+[[package]]
+name = "console"
+version = "0.13.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "a50aab2529019abfabfa93f1e6c41ef392f91fbf179b347a7e96abb524884a08"
+dependencies = [
+ "encode_unicode",
+ "lazy_static",
+ "libc",
+ "regex",
+ "terminal_size",
+ "unicode-width",
+ "winapi",
+ "winapi-util",
+]
+
+[[package]]
+name = "const_fn_assert"
+version = "0.1.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "27d614f23f34f7b5165a77dc1591f497e2518f9cec4b4f4b92bfc4dc6cf7a190"
+
+[[package]]
+name = "constant_time_eq"
+version = "0.1.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "245097e9a4535ee1e3e3931fcfcd55a796a44c643e8596ff6566d68f09b87bbc"
+
+[[package]]
+name = "convert_case"
+version = "0.4.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "6245d59a3e82a7fc217c5828a6692dbc6dfb63a0c8c90495621f7b9d79704a0e"
+
+[[package]]
+name = "core-foundation"
+version = "0.9.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "0a89e2ae426ea83155dccf10c0fa6b1463ef6d5fcb44cee0b224a408fa640a62"
+dependencies = [
+ "core-foundation-sys",
+ "libc",
+]
+
+[[package]]
+name = "core-foundation-sys"
+version = "0.8.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "5827cebf4670468b8772dd191856768aedcb1b0278a04f989f7766351917b9dc"
+
+[[package]]
+name = "core2"
+version = "0.4.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "b49ba7ef1ad6107f8824dbe97de947cbaac53c44e7f9756a1fba0d37c1eec505"
+dependencies = [
+ "memchr",
+]
+
+[[package]]
+name = "cpp_demangle"
+version = "0.3.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "8ea47428dc9d2237f3c6bc134472edfd63ebba0af932e783506dcfd66f10d18a"
+dependencies = [
+ "cfg-if 1.0.0",
+]
+
+[[package]]
+name = "cpufeatures"
+version = "0.1.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "66c99696f6c9dd7f35d486b9d04d7e6e202aa3e8c40d553f2fdf5e7e0c6a71ef"
+dependencies = [
+ "libc",
+]
+
+[[package]]
+name = "cpufeatures"
+version = "0.2.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "59a6001667ab124aebae2a495118e11d30984c3a653e99d86d58971708cf5e4b"
+dependencies = [
+ "libc",
+]
+
+[[package]]
+name = "cranelift-bforest"
+version = "0.74.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "c8ca3560686e7c9c7ed7e0fe77469f2410ba5d7781b1acaa9adc8d8deea28e3e"
+dependencies = [
+ "cranelift-entity",
+]
+
+[[package]]
+name = "cranelift-codegen"
+version = "0.74.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "baf9bf1ffffb6ce3d2e5ebc83549bd2436426c99b31cc550d521364cbe35d276"
+dependencies = [
+ "cranelift-bforest",
+ "cranelift-codegen-meta",
+ "cranelift-codegen-shared",
+ "cranelift-entity",
+ "gimli 0.24.0",
+ "log",
+ "regalloc",
+ "serde",
+ "smallvec",
+ "target-lexicon",
+]
+
+[[package]]
+name = "cranelift-codegen-meta"
+version = "0.74.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "4cc21936a5a6d07e23849ffe83e5c1f6f50305c074f4b2970ca50c13bf55b821"
+dependencies = [
+ "cranelift-codegen-shared",
+ "cranelift-entity",
+]
+
+[[package]]
+name = "cranelift-codegen-shared"
+version = "0.74.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "ca5b6ffaa87560bebe69a5446449da18090b126037920b0c1c6d5945f72faf6b"
+dependencies = [
+ "serde",
+]
+
+[[package]]
+name = "cranelift-entity"
+version = "0.74.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "7d6b4a8bef04f82e4296782646f733c641d09497df2fabf791323fefaa44c64c"
+dependencies = [
+ "serde",
+]
+
+[[package]]
+name = "cranelift-frontend"
+version = "0.74.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "c31b783b351f966fce33e3c03498cb116d16d97a8f9978164a60920bd0d3a99c"
+dependencies = [
+ "cranelift-codegen",
+ "log",
+ "smallvec",
+ "target-lexicon",
+]
+
+[[package]]
+name = "cranelift-native"
+version = "0.74.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "a77c88d3dd48021ff1e37e978a00098524abd3513444ae252c08d37b310b3d2a"
+dependencies = [
+ "cranelift-codegen",
+ "target-lexicon",
+]
+
+[[package]]
+name = "cranelift-wasm"
+version = "0.74.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "edb6d408e2da77cdbbd65466298d44c86ae71c1785d2ab0d8657753cdb4d9d89"
+dependencies = [
+ "cranelift-codegen",
+ "cranelift-entity",
+ "cranelift-frontend",
+ "itertools",
+ "log",
+ "serde",
+ "smallvec",
+ "thiserror",
+ "wasmparser",
+]
+
+[[package]]
+name = "crc32fast"
+version = "1.2.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "81156fece84ab6a9f2afdb109ce3ae577e42b1228441eded99bd77f627953b1a"
+dependencies = [
+ "cfg-if 1.0.0",
+]
+
+[[package]]
+name = "crossbeam"
+version = "0.8.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "2801af0d36612ae591caa9568261fddce32ce6e08a7275ea334a06a4ad021a2c"
+dependencies = [
+ "cfg-if 1.0.0",
+ "crossbeam-channel",
+ "crossbeam-deque",
+ "crossbeam-epoch",
+ "crossbeam-queue",
+ "crossbeam-utils",
+]
+
+[[package]]
+name = "crossbeam-channel"
+version = "0.5.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "4c02a4d71819009c192cf4872265391563fd6a84c81ff2c0f2a7026ca4c1d85c"
+dependencies = [
+ "cfg-if 1.0.0",
+ "crossbeam-utils",
+]
+
+[[package]]
+name = "crossbeam-deque"
+version = "0.8.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "6455c0ca19f0d2fbf751b908d5c55c1f5cbc65e03c4225427254b46890bdde1e"
+dependencies = [
+ "cfg-if 1.0.0",
+ "crossbeam-epoch",
+ "crossbeam-utils",
+]
+
+[[package]]
+name = "crossbeam-epoch"
+version = "0.9.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "4ec02e091aa634e2c3ada4a392989e7c3116673ef0ac5b72232439094d73b7fd"
+dependencies = [
+ "cfg-if 1.0.0",
+ "crossbeam-utils",
+ "lazy_static",
+ "memoffset",
+ "scopeguard",
+]
+
+[[package]]
+name = "crossbeam-queue"
+version = "0.3.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "9b10ddc024425c88c2ad148c1b0fd53f4c6d38db9697c9f1588381212fa657c9"
+dependencies = [
+ "cfg-if 1.0.0",
+ "crossbeam-utils",
+]
+
+[[package]]
+name = "crossbeam-utils"
+version = "0.8.8"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "0bf124c720b7686e3c2663cf54062ab0f68a88af2fb6a030e87e30bf721fcb38"
+dependencies = [
+ "cfg-if 1.0.0",
+ "lazy_static",
+]
+
+[[package]]
+name = "crunchy"
+version = "0.2.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "7a81dae078cea95a014a339291cec439d2f232ebe854a9d672b796c6afafa9b7"
+
+[[package]]
+name = "crypto-common"
+version = "0.1.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "57952ca27b5e3606ff4dd79b0020231aaf9d6aa76dc05fd30137538c50bd3ce8"
+dependencies = [
+ "generic-array",
+ "typenum",
+]
+
+[[package]]
+name = "crypto-mac"
+version = "0.8.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "b584a330336237c1eecd3e94266efb216c56ed91225d634cb2991c5f3fd1aeab"
+dependencies = [
+ "generic-array",
+ "subtle",
+]
+
+[[package]]
+name = "crypto-mac"
+version = "0.10.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "bff07008ec701e8028e2ceb8f83f0e4274ee62bd2dbdc4fefff2e9a91824081a"
+dependencies = [
+ "generic-array",
+ "subtle",
+]
+
+[[package]]
+name = "ct-logs"
+version = "0.8.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "c1a816186fa68d9e426e3cb4ae4dff1fcd8e4a2c34b781bf7a822574a0d0aac8"
+dependencies = [
+ "sct 0.6.1",
+]
+
+[[package]]
+name = "ctor"
+version = "0.1.20"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "5e98e2ad1a782e33928b96fc3948e7c355e5af34ba4de7670fe8bac2a3b2006d"
+dependencies = [
+ "quote",
+ "syn",
+]
+
+[[package]]
+name = "darling"
+version = "0.13.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "757c0ded2af11d8e739c4daea1ac623dd1624b06c844cf3f5a39f1bdbd99bb12"
+dependencies = [
+ "darling_core",
+ "darling_macro",
+]
+
+[[package]]
+name = "darling_core"
+version = "0.13.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "2c34d8efb62d0c2d7f60ece80f75e5c63c1588ba68032740494b0b9a996466e3"
+dependencies = [
+ "fnv",
+ "ident_case",
+ "proc-macro2",
+ "quote",
+ "strsim",
+ "syn",
+]
+
+[[package]]
+name = "darling_macro"
+version = "0.13.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "ade7bff147130fe5e6d39f089c6bd49ec0250f35d70b2eebf72afdfc919f15cc"
+dependencies = [
+ "darling_core",
+ "quote",
+ "syn",
+]
+
+[[package]]
+name = "data-encoding"
+version = "2.3.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "3ee2393c4a91429dffb4bedf19f4d6abf27d8a732c8ce4980305d782e5426d57"
+
+[[package]]
+name = "data-encoding-macro"
+version = "0.1.12"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "86927b7cd2fe88fa698b87404b287ab98d1a0063a34071d92e575b72d3029aca"
+dependencies = [
+ "data-encoding",
+ "data-encoding-macro-internal",
+]
+
+[[package]]
+name = "data-encoding-macro-internal"
+version = "0.1.10"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "a5bbed42daaa95e780b60a50546aa345b8413a1e46f9a40a12907d3598f038db"
+dependencies = [
+ "data-encoding",
+ "syn",
+]
+
+[[package]]
+name = "defer"
+version = "0.1.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "647605a6345d5e89c3950a36a638c56478af9b414c55c6f2477c73b115f9acde"
+
+[[package]]
+name = "derive_more"
+version = "0.99.17"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "4fb810d30a7c1953f91334de7244731fc3f3c10d7fe163338a35b9f640960321"
+dependencies = [
+ "convert_case",
+ "proc-macro2",
+ "quote",
+ "rustc_version",
+ "syn",
+]
+
+[[package]]
+name = "diesel"
+version = "1.4.8"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "b28135ecf6b7d446b43e27e225622a038cc4e2930a1022f51cdb97ada19b8e4d"
+dependencies = [
+ "bigdecimal",
+ "bitflags",
+ "byteorder",
+ "chrono",
+ "diesel_derives",
+ "num-bigint",
+ "num-integer",
+ "num-traits",
+ "pq-sys",
+ "r2d2",
+ "serde_json",
+]
+
+[[package]]
+name = "diesel-derive-enum"
+version = "1.1.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "6c8910921b014e2af16298f006de12aa08af894b71f0f49a486ab6d74b17bbed"
+dependencies = [
+ "heck 0.4.0",
+ "proc-macro2",
+ "quote",
+ "syn",
+]
+
+[[package]]
+name = "diesel-dynamic-schema"
+version = "1.0.0"
+source = "git+https://github.com/diesel-rs/diesel-dynamic-schema?rev=a8ec4fb1#a8ec4fb11de6242488ba3698d74406f4b5073dc4"
+dependencies = [
+ "diesel",
+]
+
+[[package]]
+name = "diesel_derives"
+version = "1.4.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "45f5098f628d02a7a0f68ddba586fb61e80edec3bdc1be3b921f4ceec60858d3"
+dependencies = [
+ "proc-macro2",
+ "quote",
+ "syn",
+]
+
+[[package]]
+name = "diesel_migrations"
+version = "1.4.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "bf3cde8413353dc7f5d72fa8ce0b99a560a359d2c5ef1e5817ca731cd9008f4c"
+dependencies = [
+ "migrations_internals",
+ "migrations_macros",
+]
+
+[[package]]
+name = "diff"
+version = "0.1.12"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "0e25ea47919b1560c4e3b7fe0aaab9becf5b84a10325ddf7db0f0ba5e1026499"
+
+[[package]]
+name = "difflib"
+version = "0.4.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "6184e33543162437515c2e2b48714794e37845ec9851711914eec9d308f6ebe8"
+
+[[package]]
+name = "digest"
+version = "0.9.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d3dd60d1080a57a05ab032377049e0591415d2b31afd7028356dbf3cc6dcb066"
+dependencies = [
+ "generic-array",
+]
+
+[[package]]
+name = "digest"
+version = "0.10.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "f2fb860ca6fafa5552fb6d0e816a69c8e49f0908bf524e30a90d97c85892d506"
+dependencies = [
+ "block-buffer 0.10.2",
+ "crypto-common",
+ "subtle",
+]
+
+[[package]]
+name = "directories-next"
+version = "2.0.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "339ee130d97a610ea5a5872d2bbb130fdf68884ff09d3028b81bec8a1ac23bbc"
+dependencies = [
+ "cfg-if 1.0.0",
+ "dirs-sys-next",
+]
+
+[[package]]
+name = "dirs-next"
+version = "2.0.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "b98cf8ebf19c3d1b223e151f99a4f9f0690dca41414773390fc824184ac833e1"
+dependencies = [
+ "cfg-if 1.0.0",
+ "dirs-sys-next",
+]
+
+[[package]]
+name = "dirs-sys-next"
+version = "0.1.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "4ebda144c4fe02d1f7ea1a7d9641b6fc6b580adcfa024ae48797ecdeb6825b4d"
+dependencies = [
+ "libc",
+ "redox_users",
+ "winapi",
+]
+
+[[package]]
+name = "either"
+version = "1.8.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "90e5c1c8368803113bf0c9584fc495a58b86dc8a29edbf8fe877d21d9507e797"
+
+[[package]]
+name = "encode_unicode"
+version = "0.3.6"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "a357d28ed41a50f9c765dbfe56cbc04a64e53e5fc58ba79fbc34c10ef3df831f"
+
+[[package]]
+name = "encoding_rs"
+version = "0.8.28"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "80df024fbc5ac80f87dfef0d9f5209a252f2a497f7f42944cff24d8253cac065"
+dependencies = [
+ "cfg-if 1.0.0",
+]
+
+[[package]]
+name = "env_logger"
+version = "0.7.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "44533bbbb3bb3c1fa17d9f2e4e38bbbaf8396ba82193c4cb1b6445d711445d36"
+dependencies = [
+ "atty",
+ "humantime 1.3.0",
+ "log",
+ "regex",
+ "termcolor",
+]
+
+[[package]]
+name = "env_logger"
+version = "0.9.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "0b2cf0344971ee6c64c31be0d530793fba457d322dfec2810c453d0ef228f9c3"
+dependencies = [
+ "atty",
+ "humantime 2.1.0",
+ "log",
+ "regex",
+ "termcolor",
+]
+
+[[package]]
+name = "envconfig"
+version = "0.10.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "ea81cc7e21f55a9d9b1efb6816904978d0bfbe31a50347cb24b2e75564bcac9b"
+dependencies = [
+ "envconfig_derive",
+]
+
+[[package]]
+name = "envconfig_derive"
+version = "0.10.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "7dfca278e5f84b45519acaaff758ebfa01f18e96998bc24b8f1b722dd804b9bf"
+dependencies = [
+ "proc-macro2",
+ "quote",
+ "syn",
+]
+
+[[package]]
+name = "errno"
+version = "0.2.7"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "fa68f2fb9cae9d37c9b2b3584aba698a2e97f72d7aef7b9f7aa71d8b54ce46fe"
+dependencies = [
+ "errno-dragonfly",
+ "libc",
+ "winapi",
+]
+
+[[package]]
+name = "errno-dragonfly"
+version = "0.1.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "14ca354e36190500e1e1fb267c647932382b54053c50b14970856c0b00a35067"
+dependencies = [
+ "gcc",
+ "libc",
+]
+
+[[package]]
+name = "ethabi"
+version = "17.2.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "e4966fba78396ff92db3b817ee71143eccd98acf0f876b8d600e585a670c5d1b"
+dependencies = [
+ "ethereum-types",
+ "hex",
+ "once_cell",
+ "regex",
+ "serde",
+ "serde_json",
+ "sha3",
+ "thiserror",
+ "uint",
+]
+
+[[package]]
+name = "ethbloom"
+version = "0.12.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "11da94e443c60508eb62cf256243a64da87304c2802ac2528847f79d750007ef"
+dependencies = [
+ "crunchy",
+ "fixed-hash",
+ "impl-rlp",
+ "impl-serde",
+ "tiny-keccak 2.0.2",
+]
+
+[[package]]
+name = "ethereum-types"
+version = "0.13.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "b2827b94c556145446fcce834ca86b7abf0c39a805883fe20e72c5bfdb5a0dc6"
+dependencies = [
+ "ethbloom",
+ "fixed-hash",
+ "impl-rlp",
+ "impl-serde",
+ "primitive-types",
+ "uint",
+]
+
+[[package]]
+name = "fallible-iterator"
+version = "0.2.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "4443176a9f2c162692bd3d352d745ef9413eec5782a80d8fd6f8a1ac692a07f7"
+
+[[package]]
+name = "file-per-thread-logger"
+version = "0.1.4"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "4fdbe0d94371f9ce939b555dd342d0686cc4c0cadbcd4b61d70af5ff97eb4126"
+dependencies = [
+ "env_logger 0.7.1",
+ "log",
+]
+
+[[package]]
+name = "firestorm"
+version = "0.4.6"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "31586bda1b136406162e381a3185a506cdfc1631708dd40cba2f6628d8634499"
+
+[[package]]
+name = "firestorm"
+version = "0.5.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "4d3d6188b8804df28032815ea256b6955c9625c24da7525f387a7af02fbb8f01"
+
+[[package]]
+name = "fixed-hash"
+version = "0.7.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "cfcf0ed7fe52a17a03854ec54a9f76d6d84508d1c0e66bc1793301c73fc8493c"
+dependencies = [
+ "byteorder",
+ "rand",
+ "rustc-hex",
+ "static_assertions",
+]
+
+[[package]]
+name = "fixedbitset"
+version = "0.4.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "398ea4fabe40b9b0d885340a2a991a44c8a645624075ad966d21f88688e2b69e"
+
+[[package]]
+name = "flate2"
+version = "1.0.24"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "f82b0f4c27ad9f8bfd1f3208d882da2b09c301bc1c828fd3a00d0216d2fbbff6"
+dependencies = [
+ "crc32fast",
+ "miniz_oxide 0.5.3",
+]
+
+[[package]]
+name = "fnv"
+version = "1.0.7"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "3f9eec918d3f24069decb9af1554cad7c880e2da24a9afd88aca000531ab82c1"
+
+[[package]]
+name = "foreign-types"
+version = "0.3.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "f6f339eb8adc052cd2ca78910fda869aefa38d22d5cb648e6485e4d3fc06f3b1"
+dependencies = [
+ "foreign-types-shared",
+]
+
+[[package]]
+name = "foreign-types-shared"
+version = "0.1.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "00b0228411908ca8685dba7fc2cdd70ec9990a6e753e89b6ac91a84c40fbaf4b"
+
+[[package]]
+name = "form_urlencoded"
+version = "1.0.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "5fc25a87fa4fd2094bffb06925852034d90a17f0d1e05197d4956d3555752191"
+dependencies = [
+ "matches",
+ "percent-encoding",
+]
+
+[[package]]
+name = "funty"
+version = "2.0.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "e6d5a32815ae3f33302d95fdcb2ce17862f8c65363dcfd29360480ba1001fc9c"
+
+[[package]]
+name = "futures"
+version = "0.1.31"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "3a471a38ef8ed83cd6e40aa59c1ffe17db6855c18e3604d9c4ed8c08ebc28678"
+
+[[package]]
+name = "futures"
+version = "0.3.16"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "1adc00f486adfc9ce99f77d717836f0c5aa84965eb0b4f051f4e83f7cab53f8b"
+dependencies = [
+ "futures-channel",
+ "futures-core",
+ "futures-executor",
+ "futures-io",
+ "futures-sink",
+ "futures-task",
+ "futures-util",
+]
+
+[[package]]
+name = "futures-channel"
+version = "0.3.16"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "74ed2411805f6e4e3d9bc904c95d5d423b89b3b25dc0250aa74729de20629ff9"
+dependencies = [
+ "futures-core",
+ "futures-sink",
+]
+
+[[package]]
+name = "futures-core"
+version = "0.3.16"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "af51b1b4a7fdff033703db39de8802c673eb91855f2e0d47dcf3bf2c0ef01f99"
+
+[[package]]
+name = "futures-executor"
+version = "0.3.16"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "4d0d535a57b87e1ae31437b892713aee90cd2d7b0ee48727cd11fc72ef54761c"
+dependencies = [
+ "futures-core",
+ "futures-task",
+ "futures-util",
+]
+
+[[package]]
+name = "futures-io"
+version = "0.3.16"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "0b0e06c393068f3a6ef246c75cdca793d6a46347e75286933e5e75fd2fd11582"
+
+[[package]]
+name = "futures-macro"
+version = "0.3.16"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "c54913bae956fb8df7f4dc6fc90362aa72e69148e3f39041fbe8742d21e0ac57"
+dependencies = [
+ "autocfg",
+ "proc-macro-hack",
+ "proc-macro2",
+ "quote",
+ "syn",
+]
+
+[[package]]
+name = "futures-sink"
+version = "0.3.16"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "c0f30aaa67363d119812743aa5f33c201a7a66329f97d1a887022971feea4b53"
+
+[[package]]
+name = "futures-task"
+version = "0.3.16"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "bbe54a98670017f3be909561f6ad13e810d9a51f3f061b902062ca3da80799f2"
+
+[[package]]
+name = "futures-timer"
+version = "3.0.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "e64b03909df88034c26dc1547e8970b91f98bdb65165d6a4e9110d94263dbb2c"
+
+[[package]]
+name = "futures-util"
+version = "0.3.16"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "67eb846bfd58e44a8481a00049e82c43e0ccb5d61f8dc071057cb19249dd4d78"
+dependencies = [
+ "autocfg",
+ "futures 0.1.31",
+ "futures-channel",
+ "futures-core",
+ "futures-io",
+ "futures-macro",
+ "futures-sink",
+ "futures-task",
+ "memchr",
+ "pin-project-lite",
+ "pin-utils",
+ "proc-macro-hack",
+ "proc-macro-nested",
+ "slab",
+]
+
+[[package]]
+name = "gcc"
+version = "0.3.55"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "8f5f3913fa0bfe7ee1fd8248b6b9f42a5af4b9d65ec2dd2c3c26132b950ecfc2"
+
+[[package]]
+name = "generic-array"
+version = "0.14.4"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "501466ecc8a30d1d3b7fc9229b122b2ce8ed6e9d9223f1138d4babb253e51817"
+dependencies = [
+ "typenum",
+ "version_check",
+]
+
+[[package]]
+name = "getrandom"
+version = "0.2.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "7fcd999463524c52659517fe2cea98493cfe485d10565e7b0fb07dbba7ad2753"
+dependencies = [
+ "cfg-if 1.0.0",
+ "libc",
+ "wasi",
+]
+
+[[package]]
+name = "gimli"
+version = "0.24.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "0e4075386626662786ddb0ec9081e7c7eeb1ba31951f447ca780ef9f5d568189"
+dependencies = [
+ "fallible-iterator",
+ "indexmap",
+ "stable_deref_trait",
+]
+
+[[package]]
+name = "gimli"
+version = "0.25.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "f0a01e0497841a3b2db4f8afa483cce65f7e96a3498bd6c541734792aeac8fe7"
+
+[[package]]
+name = "git-testament"
+version = "0.2.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "096cb9c8aa6f1924d079bf417f1d1685286958ff362fa58ae4d65a53ffec6c02"
+dependencies = [
+ "git-testament-derive",
+ "no-std-compat",
+]
+
+[[package]]
+name = "git-testament-derive"
+version = "0.1.12"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "45ceded7b01141664c3fc4a50199c408a6ed247e6c8415dc005e895f1d233374"
+dependencies = [
+ "chrono",
+ "log",
+ "proc-macro2",
+ "quote",
+ "syn",
+]
+
+[[package]]
+name = "globset"
+version = "0.4.8"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "10463d9ff00a2a068db14231982f5132edebad0d7660cd956a1c30292dbcbfbd"
+dependencies = [
+ "aho-corasick",
+ "bstr",
+ "fnv",
+ "log",
+ "regex",
+]
+
+[[package]]
+name = "graph"
+version = "0.27.0"
+dependencies = [
+ "Inflector",
+ "anyhow",
+ "async-stream",
+ "async-trait",
+ "atomic_refcell",
+ "bigdecimal",
+ "bytes",
+ "chrono",
+ "cid",
+ "clap",
+ "diesel",
+ "diesel_derives",
+ "envconfig",
+ "ethabi",
+ "futures 0.1.31",
+ "futures 0.3.16",
+ "graphql-parser",
+ "hex",
+ "http",
+ "isatty",
+ "itertools",
+ "lazy_static",
+ "maplit",
+ "num-bigint",
+ "num-traits",
+ "num_cpus",
+ "parking_lot 0.12.1",
+ "petgraph",
+ "priority-queue",
+ "prometheus",
+ "prost",
+ "prost-types",
+ "rand",
+ "reqwest",
+ "semver",
+ "serde",
+ "serde_derive",
+ "serde_json",
+ "serde_plain",
+ "serde_yaml",
+ "slog",
+ "slog-async",
+ "slog-envlogger",
+ "slog-term",
+ "stable-hash 0.3.3",
+ "stable-hash 0.4.2",
+ "strum",
+ "strum_macros",
+ "test-store",
+ "thiserror",
+ "tiny-keccak 1.5.0",
+ "tokio",
+ "tokio-retry",
+ "tokio-stream",
+ "tonic",
+ "tonic-build",
+ "url",
+ "wasmparser",
+ "web3",
+]
+
+[[package]]
+name = "graph-chain-arweave"
+version = "0.27.0"
+dependencies = [
+ "base64-url",
+ "diesel",
+ "graph",
+ "graph-runtime-derive",
+ "graph-runtime-wasm",
+ "prost",
+ "prost-types",
+ "serde",
+ "sha2 0.10.5",
+ "tonic-build",
+]
+
+[[package]]
+name = "graph-chain-common"
+version = "0.27.0"
+dependencies = [
+ "anyhow",
+ "heck 0.4.0",
+ "protobuf 3.1.0",
+ "protobuf-parse",
+]
+
+[[package]]
+name = "graph-chain-cosmos"
+version = "0.27.0"
+dependencies = [
+ "anyhow",
+ "graph",
+ "graph-chain-common",
+ "graph-runtime-derive",
+ "graph-runtime-wasm",
+ "prost",
+ "prost-types",
+ "semver",
+ "serde",
+ "tonic-build",
+]
+
+[[package]]
+name = "graph-chain-ethereum"
+version = "0.27.0"
+dependencies = [
+ "anyhow",
+ "base64",
+ "dirs-next",
+ "envconfig",
+ "futures 0.1.31",
+ "graph",
+ "graph-runtime-derive",
+ "graph-runtime-wasm",
+ "hex",
+ "http",
+ "itertools",
+ "jsonrpc-core",
+ "lazy_static",
+ "prost",
+ "prost-types",
+ "semver",
+ "serde",
+ "test-store",
+ "tiny-keccak 1.5.0",
+ "tonic-build",
+]
+
+[[package]]
+name = "graph-chain-near"
+version = "0.27.0"
+dependencies = [
+ "base64",
+ "diesel",
+ "graph",
+ "graph-runtime-derive",
+ "graph-runtime-wasm",
+ "prost",
+ "prost-types",
+ "serde",
+ "tonic-build",
+]
+
+[[package]]
+name = "graph-chain-substreams"
+version = "0.27.0"
+dependencies = [
+ "anyhow",
+ "async-stream",
+ "dirs-next",
+ "envconfig",
+ "futures 0.1.31",
+ "graph",
+ "graph-core",
+ "graph-runtime-wasm",
+ "hex",
+ "http",
+ "itertools",
+ "jsonrpc-core",
+ "lazy_static",
+ "prost",
+ "prost-types",
+ "semver",
+ "serde",
+ "tiny-keccak 1.5.0",
+ "tokio",
+ "tonic-build",
+]
+
+[[package]]
+name = "graph-core"
+version = "0.27.0"
+dependencies = [
+ "anyhow",
+ "async-stream",
+ "async-trait",
+ "atomic_refcell",
+ "bytes",
+ "cid",
+ "futures 0.1.31",
+ "futures 0.3.16",
+ "graph",
+ "graph-chain-arweave",
+ "graph-chain-cosmos",
+ "graph-chain-ethereum",
+ "graph-chain-near",
+ "graph-chain-substreams",
+ "graph-mock",
+ "graph-runtime-wasm",
+ "graphql-parser",
+ "hex",
+ "lazy_static",
+ "lru_time_cache",
+ "pretty_assertions",
+ "semver",
+ "serde",
+ "serde_json",
+ "serde_yaml",
+ "test-store",
+ "tower 0.4.12 (git+https://github.com/tower-rs/tower.git)",
+ "tower-test",
+]
+
+[[package]]
+name = "graph-graphql"
+version = "0.27.0"
+dependencies = [
+ "Inflector",
+ "anyhow",
+ "async-recursion",
+ "crossbeam",
+ "defer",
+ "graph",
+ "graph-chain-ethereum",
+ "graphql-parser",
+ "graphql-tools",
+ "indexmap",
+ "lazy_static",
+ "parking_lot 0.12.1",
+ "pretty_assertions",
+ "stable-hash 0.3.3",
+ "stable-hash 0.4.2",
+ "test-store",
+]
+
+[[package]]
+name = "graph-mock"
+version = "0.27.0"
+dependencies = [
+ "graph",
+]
+
+[[package]]
+name = "graph-node"
+version = "0.27.0"
+dependencies = [
+ "clap",
+ "crossbeam-channel",
+ "diesel",
+ "env_logger 0.9.0",
+ "futures 0.3.16",
+ "git-testament",
+ "graph",
+ "graph-chain-arweave",
+ "graph-chain-cosmos",
+ "graph-chain-ethereum",
+ "graph-chain-near",
+ "graph-chain-substreams",
+ "graph-core",
+ "graph-graphql",
+ "graph-runtime-wasm",
+ "graph-server-http",
+ "graph-server-index-node",
+ "graph-server-json-rpc",
+ "graph-server-metrics",
+ "graph-server-websocket",
+ "graph-store-postgres",
+ "graphql-parser",
+ "http",
+ "json-structural-diff",
+ "lazy_static",
+ "prometheus",
+ "regex",
+ "serde",
+ "serde_regex",
+ "shellexpand",
+ "toml",
+ "url",
+]
+
+[[package]]
+name = "graph-runtime-derive"
+version = "0.27.0"
+dependencies = [
+ "heck 0.4.0",
+ "proc-macro2",
+ "quote",
+ "syn",
+]
+
+[[package]]
+name = "graph-runtime-test"
+version = "0.27.0"
+dependencies = [
+ "graph",
+ "graph-chain-ethereum",
+ "graph-core",
+ "graph-mock",
+ "graph-runtime-derive",
+ "graph-runtime-wasm",
+ "rand",
+ "semver",
+ "test-store",
+ "wasmtime",
+]
+
+[[package]]
+name = "graph-runtime-wasm"
+version = "0.27.0"
+dependencies = [
+ "anyhow",
+ "async-trait",
+ "atomic_refcell",
+ "bs58",
+ "bytes",
+ "defer",
+ "ethabi",
+ "futures 0.1.31",
+ "graph",
+ "graph-runtime-derive",
+ "hex",
+ "lazy_static",
+ "never",
+ "parity-wasm",
+ "semver",
+ "strum",
+ "strum_macros",
+ "uuid 1.1.2",
+ "wasm-instrument",
+ "wasmtime",
+]
+
+[[package]]
+name = "graph-server-http"
+version = "0.27.0"
+dependencies = [
+ "futures 0.1.31",
+ "graph",
+ "graph-graphql",
+ "graph-mock",
+ "graphql-parser",
+ "http",
+ "hyper",
+ "serde",
+]
+
+[[package]]
+name = "graph-server-index-node"
+version = "0.27.0"
+dependencies = [
+ "blake3 1.3.1",
+ "either",
+ "futures 0.3.16",
+ "graph",
+ "graph-chain-arweave",
+ "graph-chain-cosmos",
+ "graph-chain-ethereum",
+ "graph-chain-near",
+ "graph-graphql",
+ "graphql-parser",
+ "http",
+ "hyper",
+ "lazy_static",
+ "serde",
+]
+
+[[package]]
+name = "graph-server-json-rpc"
+version = "0.27.0"
+dependencies = [
+ "graph",
+ "jsonrpsee",
+ "serde",
+]
+
+[[package]]
+name = "graph-server-metrics"
+version = "0.27.0"
+dependencies = [
+ "graph",
+ "http",
+ "hyper",
+ "lazy_static",
+ "serde",
+]
+
+[[package]]
+name = "graph-server-websocket"
+version = "0.27.0"
+dependencies = [
+ "anyhow",
+ "futures 0.1.31",
+ "graph",
+ "graphql-parser",
+ "http",
+ "lazy_static",
+ "serde",
+ "serde_derive",
+ "tokio-tungstenite",
+ "uuid 0.8.2",
+]
+
+[[package]]
+name = "graph-store-postgres"
+version = "0.27.0"
+dependencies = [
+ "Inflector",
+ "anyhow",
+ "async-trait",
+ "blake3 1.3.1",
+ "clap",
+ "derive_more",
+ "diesel",
+ "diesel-derive-enum",
+ "diesel-dynamic-schema",
+ "diesel_derives",
+ "diesel_migrations",
+ "fallible-iterator",
+ "futures 0.3.16",
+ "git-testament",
+ "graph",
+ "graph-chain-ethereum",
+ "graph-graphql",
+ "graph-mock",
+ "graphql-parser",
+ "hex",
+ "hex-literal",
+ "itertools",
+ "lazy_static",
+ "lru_time_cache",
+ "maybe-owned",
+ "openssl",
+ "pin-utils",
+ "postgres",
+ "postgres-openssl",
+ "rand",
+ "serde",
+ "stable-hash 0.3.3",
+ "test-store",
+ "uuid 1.1.2",
+]
+
+[[package]]
+name = "graph-tests"
+version = "0.27.0"
+dependencies = [
+ "anyhow",
+ "async-stream",
+ "bollard",
+ "cid",
+ "futures 0.3.16",
+ "graph",
+ "graph-chain-ethereum",
+ "graph-chain-near",
+ "graph-core",
+ "graph-graphql",
+ "graph-mock",
+ "graph-node",
+ "graph-store-postgres",
+ "graphql-parser",
+ "hex",
+ "lazy_static",
+ "port_check",
+ "serde_yaml",
+ "slog",
+ "tokio",
+ "tokio-stream",
+]
+
+[[package]]
+name = "graphql-parser"
+version = "0.4.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d2ebc8013b4426d5b81a4364c419a95ed0b404af2b82e2457de52d9348f0e474"
+dependencies = [
+ "combine",
+ "thiserror",
+]
+
+[[package]]
+name = "graphql-tools"
+version = "0.2.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "1a71c3ac880d8383537914ea7b45d99c6946e15976faa33a42b6c339ef4a2fb8"
+dependencies = [
+ "graphql-parser",
+ "lazy_static",
+ "serde",
+ "serde_json",
+]
+
+[[package]]
+name = "h2"
+version = "0.3.13"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "37a82c6d637fc9515a4694bbf1cb2457b79d81ce52b3108bdeea58b07dd34a57"
+dependencies = [
+ "bytes",
+ "fnv",
+ "futures-core",
+ "futures-sink",
+ "futures-util",
+ "http",
+ "indexmap",
+ "slab",
+ "tokio",
+ "tokio-util 0.7.1",
+ "tracing",
+]
+
+[[package]]
+name = "hashbrown"
+version = "0.12.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "db0d4cf898abf0081f964436dc980e96670a0f36863e4b83aaacdb65c9d7ccc3"
+
+[[package]]
+name = "headers"
+version = "0.3.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "a4c4eb0471fcb85846d8b0690695ef354f9afb11cb03cac2e1d7c9253351afb0"
+dependencies = [
+ "base64",
+ "bitflags",
+ "bytes",
+ "headers-core",
+ "http",
+ "httpdate",
+ "mime",
+ "sha-1",
+]
+
+[[package]]
+name = "headers-core"
+version = "0.2.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "e7f66481bfee273957b1f20485a4ff3362987f85b2c236580d81b4eb7a326429"
+dependencies = [
+ "http",
+]
+
+[[package]]
+name = "heck"
+version = "0.3.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "6d621efb26863f0e9924c6ac577e8275e5e6b77455db64ffa6c65c904e9e132c"
+dependencies = [
+ "unicode-segmentation",
+]
+
+[[package]]
+name = "heck"
+version = "0.4.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "2540771e65fc8cb83cd6e8a237f70c319bd5c29f78ed1084ba5d50eeac86f7f9"
+
+[[package]]
+name = "hermit-abi"
+version = "0.1.19"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "62b467343b94ba476dcb2500d242dadbb39557df889310ac77c5d99100aaac33"
+dependencies = [
+ "libc",
+]
+
+[[package]]
+name = "hex"
+version = "0.4.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "7f24254aa9a54b5c858eaee2f5bccdb46aaf0e486a595ed5fd8f86ba55232a70"
+
+[[package]]
+name = "hex-literal"
+version = "0.3.4"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "7ebdb29d2ea9ed0083cd8cece49bbd968021bd99b0849edb4a9a7ee0fdf6a4e0"
+
+[[package]]
+name = "hmac"
+version = "0.10.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "c1441c6b1e930e2817404b5046f1f989899143a12bf92de603b69f4e0aee1e15"
+dependencies = [
+ "crypto-mac 0.10.1",
+ "digest 0.9.0",
+]
+
+[[package]]
+name = "http"
+version = "0.2.8"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "75f43d41e26995c17e71ee126451dd3941010b0514a81a9d11f3b341debc2399"
+dependencies = [
+ "bytes",
+ "fnv",
+ "itoa 1.0.1",
+]
+
+[[package]]
+name = "http-body"
+version = "0.4.4"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "1ff4f84919677303da5f147645dbea6b1881f368d03ac84e1dc09031ebd7b2c6"
+dependencies = [
+ "bytes",
+ "http",
+ "pin-project-lite",
+]
+
+[[package]]
+name = "http-range-header"
+version = "0.3.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "0bfe8eed0a9285ef776bb792479ea3834e8b94e13d615c2f66d03dd50a435a29"
+
+[[package]]
+name = "httparse"
+version = "1.7.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "496ce29bb5a52785b44e0f7ca2847ae0bb839c9bd28f69acac9b99d461c0c04c"
+
+[[package]]
+name = "httpdate"
+version = "1.0.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "6456b8a6c8f33fee7d958fcd1b60d55b11940a79e63ae87013e6d22e26034440"
+
+[[package]]
+name = "humantime"
+version = "1.3.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "df004cfca50ef23c36850aaaa59ad52cc70d0e90243c3c7737a4dd32dc7a3c4f"
+dependencies = [
+ "quick-error",
+]
+
+[[package]]
+name = "humantime"
+version = "2.1.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "9a3a5bfb195931eeb336b2a7b4d761daec841b97f947d34394601737a7bba5e4"
+
+[[package]]
+name = "hyper"
+version = "0.14.18"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "b26ae0a80afebe130861d90abf98e3814a4f28a4c6ffeb5ab8ebb2be311e0ef2"
+dependencies = [
+ "bytes",
+ "futures-channel",
+ "futures-core",
+ "futures-util",
+ "h2",
+ "http",
+ "http-body",
+ "httparse",
+ "httpdate",
+ "itoa 1.0.1",
+ "pin-project-lite",
+ "socket2",
+ "tokio",
+ "tower-service 0.3.1 (registry+https://github.com/rust-lang/crates.io-index)",
+ "tracing",
+ "want",
+]
+
+[[package]]
+name = "hyper-timeout"
+version = "0.4.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "bbb958482e8c7be4bc3cf272a766a2b0bf1a6755e7a6ae777f017a31d11b13b1"
+dependencies = [
+ "hyper",
+ "pin-project-lite",
+ "tokio",
+ "tokio-io-timeout",
+]
+
+[[package]]
+name = "hyper-tls"
+version = "0.5.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d6183ddfa99b85da61a140bea0efc93fdf56ceaa041b37d553518030827f9905"
+dependencies = [
+ "bytes",
+ "hyper",
+ "native-tls",
+ "tokio",
+ "tokio-native-tls",
+]
+
+[[package]]
+name = "hyper-unix-connector"
+version = "0.2.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "24ef1fd95d34b4ff007d3f0590727b5cf33572cace09b42032fc817dc8b16557"
+dependencies = [
+ "anyhow",
+ "hex",
+ "hyper",
+ "pin-project",
+ "tokio",
+]
+
+[[package]]
+name = "iana-time-zone"
+version = "0.1.47"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "4c495f162af0bf17656d0014a0eded5f3cd2f365fdd204548c2869db89359dc7"
+dependencies = [
+ "android_system_properties",
+ "core-foundation-sys",
+ "js-sys",
+ "once_cell",
+ "wasm-bindgen",
+ "winapi",
+]
+
+[[package]]
+name = "ibig"
+version = "0.3.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "61c5022ee7f7a2feb0bd2fdc4b8ec882cd14903cebf33e7c1847e3f3a282f8b7"
+dependencies = [
+ "cfg-if 1.0.0",
+ "const_fn_assert",
+ "num-traits",
+ "rand",
+ "static_assertions",
+]
+
+[[package]]
+name = "ident_case"
+version = "1.0.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "b9e0384b61958566e926dc50660321d12159025e767c18e043daf26b70104c39"
+
+[[package]]
+name = "idna"
+version = "0.2.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "418a0a6fab821475f634efe3ccc45c013f742efe03d853e8d3355d5cb850ecf8"
+dependencies = [
+ "matches",
+ "unicode-bidi",
+ "unicode-normalization",
+]
+
+[[package]]
+name = "impl-codec"
+version = "0.6.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "ba6a270039626615617f3f36d15fc827041df3b78c439da2cadfa47455a77f2f"
+dependencies = [
+ "parity-scale-codec",
+]
+
+[[package]]
+name = "impl-rlp"
+version = "0.3.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "f28220f89297a075ddc7245cd538076ee98b01f2a9c23a53a4f1105d5a322808"
+dependencies = [
+ "rlp",
+]
+
+[[package]]
+name = "impl-serde"
+version = "0.3.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "4551f042f3438e64dbd6226b20527fc84a6e1fe65688b58746a2f53623f25f5c"
+dependencies = [
+ "serde",
+]
+
+[[package]]
+name = "impl-trait-for-tuples"
+version = "0.2.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d5dacb10c5b3bb92d46ba347505a9041e676bb20ad220101326bffb0c93031ee"
+dependencies = [
+ "proc-macro2",
+ "quote",
+ "syn",
+]
+
+[[package]]
+name = "indexmap"
+version = "1.9.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "10a35a97730320ffe8e2d410b5d3b69279b98d2c14bdb8b70ea89ecf7888d41e"
+dependencies = [
+ "autocfg",
+ "hashbrown",
+ "serde",
+]
+
+[[package]]
+name = "input_buffer"
+version = "0.4.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "f97967975f448f1a7ddb12b0bc41069d09ed6a1c161a92687e057325db35d413"
+dependencies = [
+ "bytes",
+]
+
+[[package]]
+name = "instant"
+version = "0.1.10"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "bee0328b1209d157ef001c94dd85b4f8f64139adb0eac2659f4b08382b2f474d"
+dependencies = [
+ "cfg-if 1.0.0",
+]
+
+[[package]]
+name = "ipnet"
+version = "2.3.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "68f2d64f2edebec4ce84ad108148e67e1064789bee435edc5b60ad398714a3a9"
+
+[[package]]
+name = "isatty"
+version = "0.1.9"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "e31a8281fc93ec9693494da65fbf28c0c2aa60a2eaec25dc58e2f31952e95edc"
+dependencies = [
+ "cfg-if 0.1.10",
+ "libc",
+ "redox_syscall 0.1.57",
+ "winapi",
+]
+
+[[package]]
+name = "itertools"
+version = "0.10.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "a9a9d19fa1e79b6215ff29b9d6880b706147f16e9b1dbb1e4e5947b5b02bc5e3"
+dependencies = [
+ "either",
+]
+
+[[package]]
+name = "itoa"
+version = "0.4.7"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "dd25036021b0de88a0aff6b850051563c6516d0bf53f8638938edbb9de732736"
+
+[[package]]
+name = "itoa"
+version = "1.0.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "1aab8fc367588b89dcee83ab0fd66b72b50b72fa1904d7095045ace2b0c81c35"
+
+[[package]]
+name = "jobserver"
+version = "0.1.23"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "f5ca711fd837261e14ec9e674f092cbb931d3fa1482b017ae59328ddc6f3212b"
+dependencies = [
+ "libc",
+]
+
+[[package]]
+name = "js-sys"
+version = "0.3.59"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "258451ab10b34f8af53416d1fdab72c22e805f0c92a1136d59470ec0b11138b2"
+dependencies = [
+ "wasm-bindgen",
+]
+
+[[package]]
+name = "json-structural-diff"
+version = "0.1.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "25c7940d3c84d2079306c176c7b2b37622b6bc5e43fbd1541b1e4a4e1fd02045"
+dependencies = [
+ "console",
+ "difflib",
+ "regex",
+ "serde_json",
+]
+
+[[package]]
+name = "jsonrpc-core"
+version = "18.0.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "14f7f76aef2d054868398427f6c54943cf3d1caa9a7ec7d0c38d69df97a965eb"
+dependencies = [
+ "futures 0.3.16",
+ "futures-executor",
+ "futures-util",
+ "log",
+ "serde",
+ "serde_derive",
+ "serde_json",
+]
+
+[[package]]
+name = "jsonrpsee"
+version = "0.15.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "8bd0d559d5e679b1ab2f869b486a11182923863b1b3ee8b421763cdd707b783a"
+dependencies = [
+ "jsonrpsee-core",
+ "jsonrpsee-http-server",
+ "jsonrpsee-types",
+]
+
+[[package]]
+name = "jsonrpsee-core"
+version = "0.15.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "f3dc3e9cf2ba50b7b1d7d76a667619f82846caa39e8e8daa8a4962d74acaddca"
+dependencies = [
+ "anyhow",
+ "arrayvec 0.7.2",
+ "async-trait",
+ "beef",
+ "futures-channel",
+ "futures-util",
+ "globset",
+ "http",
+ "hyper",
+ "jsonrpsee-types",
+ "lazy_static",
+ "parking_lot 0.12.1",
+ "rand",
+ "rustc-hash",
+ "serde",
+ "serde_json",
+ "thiserror",
+ "tokio",
+ "tracing",
+ "unicase",
+]
+
+[[package]]
+name = "jsonrpsee-http-server"
+version = "0.15.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "03802f0373a38c2420c70b5144742d800b509e2937edc4afb116434f07120117"
+dependencies = [
+ "futures-channel",
+ "futures-util",
+ "hyper",
+ "jsonrpsee-core",
+ "jsonrpsee-types",
+ "serde",
+ "serde_json",
+ "tokio",
+ "tracing",
+ "tracing-futures",
+]
+
+[[package]]
+name = "jsonrpsee-types"
+version = "0.15.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "e290bba767401b646812f608c099b922d8142603c9e73a50fb192d3ac86f4a0d"
+dependencies = [
+ "anyhow",
+ "beef",
+ "serde",
+ "serde_json",
+ "thiserror",
+ "tracing",
+]
+
+[[package]]
+name = "keccak"
+version = "0.1.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "67c21572b4949434e4fc1e1978b99c5f77064153c59d998bf13ecd96fb5ecba7"
+
+[[package]]
+name = "lazy_static"
+version = "1.4.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "e2abad23fbc42b3700f2f279844dc832adb2b2eb069b2df918f455c4e18cc646"
+
+[[package]]
+name = "leb128"
+version = "0.2.4"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "3576a87f2ba00f6f106fdfcd16db1d698d648a26ad8e0573cad8537c3c362d2a"
+
+[[package]]
+name = "libc"
+version = "0.2.131"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "04c3b4822ccebfa39c02fc03d1534441b22ead323fa0f48bb7ddd8e6ba076a40"
+
+[[package]]
+name = "linked-hash-map"
+version = "0.5.4"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "7fb9b38af92608140b86b693604b9ffcc5824240a484d1ecd4795bacb2fe88f3"
+
+[[package]]
+name = "lock_api"
+version = "0.4.6"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "88943dd7ef4a2e5a4bfa2753aaab3013e34ce2533d1996fb18ef591e315e2b3b"
+dependencies = [
+ "scopeguard",
+]
+
+[[package]]
+name = "log"
+version = "0.4.17"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "abb12e687cfb44aa40f41fc3978ef76448f9b6038cad6aef4259d3c095a2382e"
+dependencies = [
+ "cfg-if 1.0.0",
+]
+
+[[package]]
+name = "lru_time_cache"
+version = "0.11.11"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "9106e1d747ffd48e6be5bb2d97fa706ed25b144fbee4d5c02eae110cd8d6badd"
+
+[[package]]
+name = "mach"
+version = "0.3.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "b823e83b2affd8f40a9ee8c29dbc56404c1e34cd2710921f2801e2cf29527afa"
+dependencies = [
+ "libc",
+]
+
+[[package]]
+name = "maplit"
+version = "1.0.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "3e2e65a1a2e43cfcb47a895c4c8b10d1f4a61097f9f254f183aee60cad9c651d"
+
+[[package]]
+name = "matches"
+version = "0.1.8"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "7ffc5c5338469d4d3ea17d269fa8ea3512ad247247c30bd2df69e68309ed0a08"
+
+[[package]]
+name = "matchit"
+version = "0.5.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "73cbba799671b762df5a175adf59ce145165747bb891505c43d09aefbbf38beb"
+
+[[package]]
+name = "maybe-owned"
+version = "0.3.4"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "4facc753ae494aeb6e3c22f839b158aebd4f9270f55cd3c79906c45476c47ab4"
+
+[[package]]
+name = "md-5"
+version = "0.9.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "7b5a279bb9607f9f53c22d496eade00d138d1bdcccd07d74650387cf94942a15"
+dependencies = [
+ "block-buffer 0.9.0",
+ "digest 0.9.0",
+ "opaque-debug",
+]
+
+[[package]]
+name = "memchr"
+version = "2.5.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "2dffe52ecf27772e601905b7522cb4ef790d2cc203488bbd0e2fe85fcb74566d"
+
+[[package]]
+name = "memoffset"
+version = "0.6.4"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "59accc507f1338036a0477ef61afdae33cde60840f4dfe481319ce3ad116ddf9"
+dependencies = [
+ "autocfg",
+]
+
+[[package]]
+name = "migrations_internals"
+version = "1.4.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "2b4fc84e4af020b837029e017966f86a1c2d5e83e64b589963d5047525995860"
+dependencies = [
+ "diesel",
+]
+
+[[package]]
+name = "migrations_macros"
+version = "1.4.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "9753f12909fd8d923f75ae5c3258cae1ed3c8ec052e1b38c93c21a6d157f789c"
+dependencies = [
+ "migrations_internals",
+ "proc-macro2",
+ "quote",
+ "syn",
+]
+
+[[package]]
+name = "mime"
+version = "0.3.16"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "2a60c7ce501c71e03a9c9c0d35b861413ae925bd979cc7a4e30d060069aaac8d"
+
+[[package]]
+name = "mime_guess"
+version = "2.0.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "2684d4c2e97d99848d30b324b00c8fcc7e5c897b7cbb5819b09e7c90e8baf212"
+dependencies = [
+ "mime",
+ "unicase",
+]
+
+[[package]]
+name = "miniz_oxide"
+version = "0.4.4"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "a92518e98c078586bc6c934028adcca4c92a53d6a958196de835170a01d84e4b"
+dependencies = [
+ "adler",
+ "autocfg",
+]
+
+[[package]]
+name = "miniz_oxide"
+version = "0.5.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "6f5c75688da582b8ffc1f1799e9db273f32133c49e048f614d22ec3256773ccc"
+dependencies = [
+ "adler",
+]
+
+[[package]]
+name = "mio"
+version = "0.7.13"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "8c2bdb6314ec10835cd3293dd268473a835c02b7b352e788be788b3c6ca6bb16"
+dependencies = [
+ "libc",
+ "log",
+ "miow",
+ "ntapi",
+ "winapi",
+]
+
+[[package]]
+name = "miow"
+version = "0.3.7"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "b9f1c5b025cda876f66ef43a113f91ebc9f4ccef34843000e0adf6ebbab84e21"
+dependencies = [
+ "winapi",
+]
+
+[[package]]
+name = "more-asserts"
+version = "0.2.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "0debeb9fcf88823ea64d64e4a815ab1643f33127d995978e099942ce38f25238"
+
+[[package]]
+name = "multibase"
+version = "0.9.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "9b3539ec3c1f04ac9748a260728e855f261b4977f5c3406612c884564f329404"
+dependencies = [
+ "base-x",
+ "data-encoding",
+ "data-encoding-macro",
+]
+
+[[package]]
+name = "multihash"
+version = "0.16.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "e3db354f401db558759dfc1e568d010a5d4146f4d3f637be1275ec4a3cf09689"
+dependencies = [
+ "blake2b_simd",
+ "blake2s_simd",
+ "blake3 1.3.1",
+ "core2",
+ "digest 0.10.3",
+ "multihash-derive",
+ "sha2 0.10.5",
+ "sha3",
+ "unsigned-varint",
+]
+
+[[package]]
+name = "multihash-derive"
+version = "0.8.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "fc076939022111618a5026d3be019fd8b366e76314538ff9a1b59ffbcbf98bcd"
+dependencies = [
+ "proc-macro-crate",
+ "proc-macro-error",
+ "proc-macro2",
+ "quote",
+ "syn",
+ "synstructure",
+]
+
+[[package]]
+name = "multimap"
+version = "0.8.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "e5ce46fe64a9d73be07dcbe690a38ce1b293be448fd8ce1e6c1b8062c9f72c6a"
+
+[[package]]
+name = "native-tls"
+version = "0.2.8"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "48ba9f7719b5a0f42f338907614285fb5fd70e53858141f69898a1fb7203b24d"
+dependencies = [
+ "lazy_static",
+ "libc",
+ "log",
+ "openssl",
+ "openssl-probe",
+ "openssl-sys",
+ "schannel",
+ "security-framework",
+ "security-framework-sys",
+ "tempfile",
+]
+
+[[package]]
+name = "never"
+version = "0.1.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "c96aba5aa877601bb3f6dd6a63a969e1f82e60646e81e71b14496995e9853c91"
+
+[[package]]
+name = "no-std-compat"
+version = "0.4.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "b93853da6d84c2e3c7d730d6473e8817692dd89be387eb01b94d7f108ecb5b8c"
+
+[[package]]
+name = "ntapi"
+version = "0.3.6"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "3f6bb902e437b6d86e03cce10a7e2af662292c5dfef23b65899ea3ac9354ad44"
+dependencies = [
+ "winapi",
+]
+
+[[package]]
+name = "num-bigint"
+version = "0.2.6"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "090c7f9998ee0ff65aa5b723e4009f7b217707f1fb5ea551329cc4d6231fb304"
+dependencies = [
+ "autocfg",
+ "num-integer",
+ "num-traits",
+ "serde",
+]
+
+[[package]]
+name = "num-integer"
+version = "0.1.44"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d2cc698a63b549a70bc047073d2949cce27cd1c7b0a4a862d08a8031bc2801db"
+dependencies = [
+ "autocfg",
+ "num-traits",
+]
+
+[[package]]
+name = "num-traits"
+version = "0.2.15"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "578ede34cf02f8924ab9447f50c28075b4d3e5b269972345e7e0372b38c6cdcd"
+dependencies = [
+ "autocfg",
+]
+
+[[package]]
+name = "num_cpus"
+version = "1.13.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "19e64526ebdee182341572e50e9ad03965aa510cd94427a4549448f285e957a1"
+dependencies = [
+ "hermit-abi",
+ "libc",
+]
+
+[[package]]
+name = "object"
+version = "0.24.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "1a5b3dd1c072ee7963717671d1ca129f1048fda25edea6b752bfc71ac8854170"
+dependencies = [
+ "crc32fast",
+ "indexmap",
+]
+
+[[package]]
+name = "object"
+version = "0.26.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "c55827317fb4c08822499848a14237d2874d6f139828893017237e7ab93eb386"
+dependencies = [
+ "memchr",
+]
+
+[[package]]
+name = "once_cell"
+version = "1.13.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "074864da206b4973b84eb91683020dbefd6a8c3f0f38e054d93954e891935e4e"
+
+[[package]]
+name = "opaque-debug"
+version = "0.3.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "624a8340c38c1b80fd549087862da4ba43e08858af025b236e509b6649fc13d5"
+
+[[package]]
+name = "openssl"
+version = "0.10.41"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "618febf65336490dfcf20b73f885f5651a0c89c64c2d4a8c3662585a70bf5bd0"
+dependencies = [
+ "bitflags",
+ "cfg-if 1.0.0",
+ "foreign-types",
+ "libc",
+ "once_cell",
+ "openssl-macros",
+ "openssl-sys",
+]
+
+[[package]]
+name = "openssl-macros"
+version = "0.1.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "b501e44f11665960c7e7fcf062c7d96a14ade4aa98116c004b2e37b5be7d736c"
+dependencies = [
+ "proc-macro2",
+ "quote",
+ "syn",
+]
+
+[[package]]
+name = "openssl-probe"
+version = "0.1.4"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "28988d872ab76095a6e6ac88d99b54fd267702734fd7ffe610ca27f533ddb95a"
+
+[[package]]
+name = "openssl-sys"
+version = "0.9.75"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "e5f9bd0c2710541a3cda73d6f9ac4f1b240de4ae261065d309dbe73d9dceb42f"
+dependencies = [
+ "autocfg",
+ "cc",
+ "libc",
+ "pkg-config",
+ "vcpkg",
+]
+
+[[package]]
+name = "os_str_bytes"
+version = "6.0.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "8e22443d1643a904602595ba1cd8f7d896afe56d26712531c5ff73a15b2fbf64"
+
+[[package]]
+name = "output_vt100"
+version = "0.1.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "53cdc5b785b7a58c5aad8216b3dfa114df64b0b06ae6e1501cef91df2fbdf8f9"
+dependencies = [
+ "winapi",
+]
+
+[[package]]
+name = "parity-scale-codec"
+version = "3.0.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "2a7f3fcf5e45fc28b84dcdab6b983e77f197ec01f325a33f404ba6855afd1070"
+dependencies = [
+ "arrayvec 0.7.2",
+ "bitvec",
+ "byte-slice-cast",
+ "impl-trait-for-tuples",
+ "parity-scale-codec-derive",
+ "serde",
+]
+
+[[package]]
+name = "parity-scale-codec-derive"
+version = "3.0.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "2c6e626dc84025ff56bf1476ed0e30d10c84d7f89a475ef46ebabee1095a8fba"
+dependencies = [
+ "proc-macro-crate",
+ "proc-macro2",
+ "quote",
+ "syn",
+]
+
+[[package]]
+name = "parity-wasm"
+version = "0.45.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "e1ad0aff30c1da14b1254fcb2af73e1fa9a28670e584a626f53a369d0e157304"
+
+[[package]]
+name = "parking_lot"
+version = "0.11.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "7d17b78036a60663b797adeaee46f5c9dfebb86948d1255007a1d6be0271ff99"
+dependencies = [
+ "instant",
+ "lock_api",
+ "parking_lot_core 0.8.5",
+]
+
+[[package]]
+name = "parking_lot"
+version = "0.12.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "3742b2c103b9f06bc9fff0a37ff4912935851bee6d36f3c02bcc755bcfec228f"
+dependencies = [
+ "lock_api",
+ "parking_lot_core 0.9.1",
+]
+
+[[package]]
+name = "parking_lot_core"
+version = "0.8.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d76e8e1493bcac0d2766c42737f34458f1c8c50c0d23bcb24ea953affb273216"
+dependencies = [
+ "cfg-if 1.0.0",
+ "instant",
+ "libc",
+ "redox_syscall 0.2.10",
+ "smallvec",
+ "winapi",
+]
+
+[[package]]
+name = "parking_lot_core"
+version = "0.9.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "28141e0cc4143da2443301914478dc976a61ffdb3f043058310c70df2fed8954"
+dependencies = [
+ "cfg-if 1.0.0",
+ "libc",
+ "redox_syscall 0.2.10",
+ "smallvec",
+ "windows-sys",
+]
+
+[[package]]
+name = "paste"
+version = "1.0.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "acbf547ad0c65e31259204bd90935776d1c693cec2f4ff7abb7a1bbbd40dfe58"
+
+[[package]]
+name = "percent-encoding"
+version = "2.1.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d4fd5641d01c8f18a23da7b6fe29298ff4b55afcccdf78973b24cf3175fee32e"
+
+[[package]]
+name = "petgraph"
+version = "0.6.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "e6d5014253a1331579ce62aa67443b4a658c5e7dd03d4bc6d302b94474888143"
+dependencies = [
+ "fixedbitset",
+ "indexmap",
+]
+
+[[package]]
+name = "phf"
+version = "0.8.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "3dfb61232e34fcb633f43d12c58f83c1df82962dcdfa565a4e866ffc17dafe12"
+dependencies = [
+ "phf_shared",
+]
+
+[[package]]
+name = "phf_shared"
+version = "0.8.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "c00cf8b9eafe68dde5e9eaa2cef8ee84a9336a47d566ec55ca16589633b65af7"
+dependencies = [
+ "siphasher",
+]
+
+[[package]]
+name = "pin-project"
+version = "1.0.8"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "576bc800220cc65dac09e99e97b08b358cfab6e17078de8dc5fee223bd2d0c08"
+dependencies = [
+ "pin-project-internal",
+]
+
+[[package]]
+name = "pin-project-internal"
+version = "1.0.8"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "6e8fe8163d14ce7f0cdac2e040116f22eac817edabff0be91e8aff7e9accf389"
+dependencies = [
+ "proc-macro2",
+ "quote",
+ "syn",
+]
+
+[[package]]
+name = "pin-project-lite"
+version = "0.2.9"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "e0a7ae3ac2f1173085d398531c705756c94a4c56843785df85a60c1a0afac116"
+
+[[package]]
+name = "pin-utils"
+version = "0.1.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "8b870d8c151b6f2fb93e84a13146138f05d02ed11c7e7c54f8826aaaf7c9f184"
+
+[[package]]
+name = "pkg-config"
+version = "0.3.19"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "3831453b3449ceb48b6d9c7ad7c96d5ea673e9b470a1dc578c2ce6521230884c"
+
+[[package]]
+name = "port_check"
+version = "0.1.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "f6519412c9e0d4be579b9f0618364d19cb434b324fc6ddb1b27b1e682c7105ed"
+
+[[package]]
+name = "postgres"
+version = "0.19.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "c7871ee579860d8183f542e387b176a25f2656b9fb5211e045397f745a68d1c2"
+dependencies = [
+ "bytes",
+ "fallible-iterator",
+ "futures 0.3.16",
+ "log",
+ "tokio",
+ "tokio-postgres",
+]
+
+[[package]]
+name = "postgres-openssl"
+version = "0.5.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "1de0ea6504e07ca78355a6fb88ad0f36cafe9e696cbc6717f16a207f3a60be72"
+dependencies = [
+ "futures 0.3.16",
+ "openssl",
+ "tokio",
+ "tokio-openssl",
+ "tokio-postgres",
+]
+
+[[package]]
+name = "postgres-protocol"
+version = "0.6.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "ff3e0f70d32e20923cabf2df02913be7c1842d4c772db8065c00fcfdd1d1bff3"
+dependencies = [
+ "base64",
+ "byteorder",
+ "bytes",
+ "fallible-iterator",
+ "hmac",
+ "md-5",
+ "memchr",
+ "rand",
+ "sha2 0.9.5",
+ "stringprep",
+]
+
+[[package]]
+name = "postgres-types"
+version = "0.2.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "430f4131e1b7657b0cd9a2b0c3408d77c9a43a042d300b8c77f981dffcc43a2f"
+dependencies = [
+ "bytes",
+ "fallible-iterator",
+ "postgres-protocol",
+]
+
+[[package]]
+name = "ppv-lite86"
+version = "0.2.10"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "ac74c624d6b2d21f425f752262f42188365d7b8ff1aff74c82e45136510a4857"
+
+[[package]]
+name = "pq-sys"
+version = "0.4.6"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "6ac25eee5a0582f45a67e837e350d784e7003bd29a5f460796772061ca49ffda"
+dependencies = [
+ "vcpkg",
+]
+
+[[package]]
+name = "pretty_assertions"
+version = "1.3.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "a25e9bcb20aa780fd0bb16b72403a9064d6b3f22f026946029acb941a50af755"
+dependencies = [
+ "ctor",
+ "diff",
+ "output_vt100",
+ "yansi",
+]
+
+[[package]]
+name = "prettyplease"
+version = "0.1.10"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d9e07e3a46d0771a8a06b5f4441527802830b43e679ba12f44960f48dd4c6803"
+dependencies = [
+ "proc-macro2",
+ "syn",
+]
+
+[[package]]
+name = "primitive-types"
+version = "0.11.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "e28720988bff275df1f51b171e1b2a18c30d194c4d2b61defdacecd625a5d94a"
+dependencies = [
+ "fixed-hash",
+ "impl-codec",
+ "impl-rlp",
+ "impl-serde",
+ "uint",
+]
+
+[[package]]
+name = "priority-queue"
+version = "0.7.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "5a03dfae8e64d4aa651415e2a4321f9f09f2e388a2f8bec36bed03bc22c0b687"
+dependencies = [
+ "indexmap",
+ "take_mut",
+]
+
+[[package]]
+name = "proc-macro-crate"
+version = "1.1.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "1ebace6889caf889b4d3f76becee12e90353f2b8c7d875534a71e5742f8f6f83"
+dependencies = [
+ "thiserror",
+ "toml",
+]
+
+[[package]]
+name = "proc-macro-error"
+version = "1.0.4"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "da25490ff9892aab3fcf7c36f08cfb902dd3e71ca0f9f9517bea02a73a5ce38c"
+dependencies = [
+ "proc-macro-error-attr",
+ "proc-macro2",
+ "quote",
+ "syn",
+ "version_check",
+]
+
+[[package]]
+name = "proc-macro-error-attr"
+version = "1.0.4"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "a1be40180e52ecc98ad80b184934baf3d0d29f979574e439af5a55274b35f869"
+dependencies = [
+ "proc-macro2",
+ "quote",
+ "version_check",
+]
+
+[[package]]
+name = "proc-macro-hack"
+version = "0.5.19"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "dbf0c48bc1d91375ae5c3cd81e3722dff1abcf81a30960240640d223f59fe0e5"
+
+[[package]]
+name = "proc-macro-nested"
+version = "0.1.7"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "bc881b2c22681370c6a780e47af9840ef841837bc98118431d4e1868bd0c1086"
+
+[[package]]
+name = "proc-macro2"
+version = "1.0.43"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "0a2ca2c61bc9f3d74d2886294ab7b9853abd9c1ad903a3ac7815c58989bb7bab"
+dependencies = [
+ "unicode-ident",
+]
+
+[[package]]
+name = "prometheus"
+version = "0.13.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "45c8babc29389186697fe5a2a4859d697825496b83db5d0b65271cdc0488e88c"
+dependencies = [
+ "cfg-if 1.0.0",
+ "fnv",
+ "lazy_static",
+ "libc",
+ "memchr",
+ "parking_lot 0.12.1",
+ "protobuf 2.25.0",
+ "reqwest",
+ "thiserror",
+]
+
+[[package]]
+name = "prost"
+version = "0.10.4"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "71adf41db68aa0daaefc69bb30bcd68ded9b9abaad5d1fbb6304c4fb390e083e"
+dependencies = [
+ "bytes",
+ "prost-derive",
+]
+
+[[package]]
+name = "prost-build"
+version = "0.10.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "120fbe7988713f39d780a58cf1a7ef0d7ef66c6d87e5aa3438940c05357929f4"
+dependencies = [
+ "bytes",
+ "cfg-if 1.0.0",
+ "cmake",
+ "heck 0.4.0",
+ "itertools",
+ "lazy_static",
+ "log",
+ "multimap",
+ "petgraph",
+ "prost",
+ "prost-types",
+ "regex",
+ "tempfile",
+ "which",
+]
+
+[[package]]
+name = "prost-derive"
+version = "0.10.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "7b670f45da57fb8542ebdbb6105a925fe571b67f9e7ed9f47a06a84e72b4e7cc"
+dependencies = [
+ "anyhow",
+ "itertools",
+ "proc-macro2",
+ "quote",
+ "syn",
+]
+
+[[package]]
+name = "prost-types"
+version = "0.10.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "2d0a014229361011dc8e69c8a1ec6c2e8d0f2af7c91e3ea3f5b2170298461e68"
+dependencies = [
+ "bytes",
+ "prost",
+]
+
+[[package]]
+name = "protobuf"
+version = "2.25.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "020f86b07722c5c4291f7c723eac4676b3892d47d9a7708dc2779696407f039b"
+
+[[package]]
+name = "protobuf"
+version = "3.1.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "4ee4a7d8b91800c8f167a6268d1a1026607368e1adc84e98fe044aeb905302f7"
+dependencies = [
+ "once_cell",
+ "protobuf-support",
+ "thiserror",
+]
+
+[[package]]
+name = "protobuf-parse"
+version = "3.1.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "9b1447dd751c434cc1b415579837ebd0411ed7d67d465f38010da5d7cd33af4d"
+dependencies = [
+ "anyhow",
+ "indexmap",
+ "log",
+ "protobuf 3.1.0",
+ "protobuf-support",
+ "tempfile",
+ "thiserror",
+ "which",
+]
+
+[[package]]
+name = "protobuf-support"
+version = "3.1.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "8ca157fe12fc7ee2e315f2f735e27df41b3d97cdd70ea112824dac1ffb08ee1c"
+dependencies = [
+ "thiserror",
+]
+
+[[package]]
+name = "psm"
+version = "0.1.14"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "14ce37fa8c0428a37307d163292add09b3aedc003472e6b3622486878404191d"
+dependencies = [
+ "cc",
+]
+
+[[package]]
+name = "quick-error"
+version = "1.2.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "a1d01941d82fa2ab50be1e79e6714289dd7cde78eba4c074bc5a4374f650dfe0"
+
+[[package]]
+name = "quote"
+version = "1.0.20"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "3bcdf212e9776fbcb2d23ab029360416bb1706b1aea2d1a5ba002727cbcab804"
+dependencies = [
+ "proc-macro2",
+]
+
+[[package]]
+name = "r2d2"
+version = "0.8.9"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "545c5bc2b880973c9c10e4067418407a0ccaa3091781d1671d46eb35107cb26f"
+dependencies = [
+ "log",
+ "parking_lot 0.11.2",
+ "scheduled-thread-pool",
+]
+
+[[package]]
+name = "radium"
+version = "0.7.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "dc33ff2d4973d518d823d61aa239014831e521c75da58e3df4840d3f47749d09"
+
+[[package]]
+name = "rand"
+version = "0.8.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "34af8d1a0e25924bc5b7c43c079c942339d8f0a8b57c39049bef581b46327404"
+dependencies = [
+ "libc",
+ "rand_chacha",
+ "rand_core",
+]
+
+[[package]]
+name = "rand_chacha"
+version = "0.3.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "e6c10a63a0fa32252be49d21e7709d4d4baf8d231c2dbce1eaa8141b9b127d88"
+dependencies = [
+ "ppv-lite86",
+ "rand_core",
+]
+
+[[package]]
+name = "rand_core"
+version = "0.6.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d34f1408f55294453790c48b2f1ebbb1c5b4b7563eb1f418bcfcfdbb06ebb4e7"
+dependencies = [
+ "getrandom",
+]
+
+[[package]]
+name = "rayon"
+version = "1.5.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "c06aca804d41dbc8ba42dfd964f0d01334eceb64314b9ecf7c5fad5188a06d90"
+dependencies = [
+ "autocfg",
+ "crossbeam-deque",
+ "either",
+ "rayon-core",
+]
+
+[[package]]
+name = "rayon-core"
+version = "1.9.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d78120e2c850279833f1dd3582f730c4ab53ed95aeaaaa862a2a5c71b1656d8e"
+dependencies = [
+ "crossbeam-channel",
+ "crossbeam-deque",
+ "crossbeam-utils",
+ "lazy_static",
+ "num_cpus",
+]
+
+[[package]]
+name = "redox_syscall"
+version = "0.1.57"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "41cc0f7e4d5d4544e8861606a285bb08d3e70712ccc7d2b84d7c0ccfaf4b05ce"
+
+[[package]]
+name = "redox_syscall"
+version = "0.2.10"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "8383f39639269cde97d255a32bdb68c047337295414940c68bdd30c2e13203ff"
+dependencies = [
+ "bitflags",
+]
+
+[[package]]
+name = "redox_users"
+version = "0.4.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "528532f3d801c87aec9def2add9ca802fe569e44a544afe633765267840abe64"
+dependencies = [
+ "getrandom",
+ "redox_syscall 0.2.10",
+]
+
+[[package]]
+name = "regalloc"
+version = "0.0.31"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "571f7f397d61c4755285cd37853fe8e03271c243424a907415909379659381c5"
+dependencies = [
+ "log",
+ "rustc-hash",
+ "serde",
+ "smallvec",
+]
+
+[[package]]
+name = "regex"
+version = "1.5.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "1a11647b6b25ff05a515cb92c365cec08801e83423a235b51e231e1808747286"
+dependencies = [
+ "aho-corasick",
+ "memchr",
+ "regex-syntax",
+]
+
+[[package]]
+name = "regex-syntax"
+version = "0.6.25"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "f497285884f3fcff424ffc933e56d7cbca511def0c9831a7f9b5f6153e3cc89b"
+
+[[package]]
+name = "region"
+version = "2.2.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "877e54ea2adcd70d80e9179344c97f93ef0dffd6b03e1f4529e6e83ab2fa9ae0"
+dependencies = [
+ "bitflags",
+ "libc",
+ "mach",
+ "winapi",
+]
+
+[[package]]
+name = "remove_dir_all"
+version = "0.5.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "3acd125665422973a33ac9d3dd2df85edad0f4ae9b00dafb1a05e43a9f5ef8e7"
+dependencies = [
+ "winapi",
+]
+
+[[package]]
+name = "reqwest"
+version = "0.11.4"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "246e9f61b9bb77df069a947682be06e31ac43ea37862e244a69f177694ea6d22"
+dependencies = [
+ "base64",
+ "bytes",
+ "encoding_rs",
+ "futures-core",
+ "futures-util",
+ "http",
+ "http-body",
+ "hyper",
+ "hyper-tls",
+ "ipnet",
+ "js-sys",
+ "lazy_static",
+ "log",
+ "mime",
+ "mime_guess",
+ "native-tls",
+ "percent-encoding",
+ "pin-project-lite",
+ "serde",
+ "serde_json",
+ "serde_urlencoded",
+ "tokio",
+ "tokio-native-tls",
+ "url",
+ "wasm-bindgen",
+ "wasm-bindgen-futures",
+ "web-sys",
+ "winreg",
+]
+
+[[package]]
+name = "ring"
+version = "0.16.20"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "3053cf52e236a3ed746dfc745aa9cacf1b791d846bdaf412f60a8d7d6e17c8fc"
+dependencies = [
+ "cc",
+ "libc",
+ "once_cell",
+ "spin",
+ "untrusted",
+ "web-sys",
+ "winapi",
+]
+
+[[package]]
+name = "rlp"
+version = "0.5.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "999508abb0ae792aabed2460c45b89106d97fe4adac593bdaef433c2605847b5"
+dependencies = [
+ "bytes",
+ "rustc-hex",
+]
+
+[[package]]
+name = "rustc-demangle"
+version = "0.1.20"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "dead70b0b5e03e9c814bcb6b01e03e68f7c57a80aa48c72ec92152ab3e818d49"
+
+[[package]]
+name = "rustc-hash"
+version = "1.1.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "08d43f7aa6b08d49f382cde6a7982047c3426db949b1424bc4b7ec9ae12c6ce2"
+
+[[package]]
+name = "rustc-hex"
+version = "2.1.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "3e75f6a532d0fd9f7f13144f392b6ad56a32696bfcd9c78f797f16bbb6f072d6"
+
+[[package]]
+name = "rustc_version"
+version = "0.4.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "bfa0f585226d2e68097d4f95d113b15b83a82e819ab25717ec0590d9584ef366"
+dependencies = [
+ "semver",
+]
+
+[[package]]
+name = "rustls"
+version = "0.20.4"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "4fbfeb8d0ddb84706bc597a5574ab8912817c52a397f819e5b614e2265206921"
+dependencies = [
+ "log",
+ "ring",
+ "sct 0.7.0",
+ "webpki",
+]
+
+[[package]]
+name = "rustls-native-certs"
+version = "0.6.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "0167bac7a9f490495f3c33013e7722b53cb087ecbe082fb0c6387c96f634ea50"
+dependencies = [
+ "openssl-probe",
+ "rustls-pemfile 1.0.0",
+ "schannel",
+ "security-framework",
+]
+
+[[package]]
+name = "rustls-pemfile"
+version = "0.3.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "1ee86d63972a7c661d1536fefe8c3c8407321c3df668891286de28abcd087360"
+dependencies = [
+ "base64",
+]
+
+[[package]]
+name = "rustls-pemfile"
+version = "1.0.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "e7522c9de787ff061458fe9a829dc790a3f5b22dc571694fc5883f448b94d9a9"
+dependencies = [
+ "base64",
+]
+
+[[package]]
+name = "rustversion"
+version = "1.0.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "61b3909d758bb75c79f23d4736fac9433868679d3ad2ea7a61e3c25cfda9a088"
+
+[[package]]
+name = "ryu"
+version = "1.0.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "71d301d4193d031abdd79ff7e3dd721168a9572ef3fe51a1517aba235bd8f86e"
+
+[[package]]
+name = "schannel"
+version = "0.1.19"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "8f05ba609c234e60bee0d547fe94a4c7e9da733d1c962cf6e59efa4cd9c8bc75"
+dependencies = [
+ "lazy_static",
+ "winapi",
+]
+
+[[package]]
+name = "scheduled-thread-pool"
+version = "0.2.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "dc6f74fd1204073fa02d5d5d68bec8021be4c38690b61264b2fdb48083d0e7d7"
+dependencies = [
+ "parking_lot 0.11.2",
+]
+
+[[package]]
+name = "scopeguard"
+version = "1.1.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d29ab0c6d3fc0ee92fe66e2d99f700eab17a8d57d1c1d3b748380fb20baa78cd"
+
+[[package]]
+name = "scroll"
+version = "0.10.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "fda28d4b4830b807a8b43f7b0e6b5df875311b3e7621d84577188c175b6ec1ec"
+dependencies = [
+ "scroll_derive",
+]
+
+[[package]]
+name = "scroll_derive"
+version = "0.10.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "aaaae8f38bb311444cfb7f1979af0bc9240d95795f75f9ceddf6a59b79ceffa0"
+dependencies = [
+ "proc-macro2",
+ "quote",
+ "syn",
+]
+
+[[package]]
+name = "sct"
+version = "0.6.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "b362b83898e0e69f38515b82ee15aa80636befe47c3b6d3d89a911e78fc228ce"
+dependencies = [
+ "ring",
+ "untrusted",
+]
+
+[[package]]
+name = "sct"
+version = "0.7.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d53dcdb7c9f8158937a7981b48accfd39a43af418591a5d008c7b22b5e1b7ca4"
+dependencies = [
+ "ring",
+ "untrusted",
+]
+
+[[package]]
+name = "secp256k1"
+version = "0.21.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "9c42e6f1735c5f00f51e43e28d6634141f2bcad10931b2609ddd74a86d751260"
+dependencies = [
+ "secp256k1-sys",
+]
+
+[[package]]
+name = "secp256k1-sys"
+version = "0.4.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "957da2573cde917463ece3570eab4a0b3f19de6f1646cde62e6fd3868f566036"
+dependencies = [
+ "cc",
+]
+
+[[package]]
+name = "security-framework"
+version = "2.3.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "23a2ac85147a3a11d77ecf1bc7166ec0b92febfa4461c37944e180f319ece467"
+dependencies = [
+ "bitflags",
+ "core-foundation",
+ "core-foundation-sys",
+ "libc",
+ "security-framework-sys",
+]
+
+[[package]]
+name = "security-framework-sys"
+version = "2.3.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "7e4effb91b4b8b6fb7732e670b6cee160278ff8e6bf485c7805d9e319d76e284"
+dependencies = [
+ "core-foundation-sys",
+ "libc",
+]
+
+[[package]]
+name = "semver"
+version = "1.0.12"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "a2333e6df6d6598f2b1974829f853c2b4c5f4a6e503c10af918081aa6f8564e1"
+dependencies = [
+ "serde",
+]
+
+[[package]]
+name = "serde"
+version = "1.0.127"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "f03b9878abf6d14e6779d3f24f07b2cfa90352cfec4acc5aab8f1ac7f146fae8"
+dependencies = [
+ "serde_derive",
+]
+
+[[package]]
+name = "serde_derive"
+version = "1.0.127"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "a024926d3432516606328597e0f224a51355a493b49fdd67e9209187cbe55ecc"
+dependencies = [
+ "proc-macro2",
+ "quote",
+ "syn",
+]
+
+[[package]]
+name = "serde_json"
+version = "1.0.66"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "336b10da19a12ad094b59d870ebde26a45402e5b470add4b5fd03c5048a32127"
+dependencies = [
+ "itoa 0.4.7",
+ "ryu",
+ "serde",
+]
+
+[[package]]
+name = "serde_plain"
+version = "1.0.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "95455e7e29fada2052e72170af226fbe368a4ca33dee847875325d9fdb133858"
+dependencies = [
+ "serde",
+]
+
+[[package]]
+name = "serde_regex"
+version = "1.1.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "a8136f1a4ea815d7eac4101cfd0b16dc0cb5e1fe1b8609dfd728058656b7badf"
+dependencies = [
+ "regex",
+ "serde",
+]
+
+[[package]]
+name = "serde_urlencoded"
+version = "0.7.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "edfa57a7f8d9c1d260a549e7224100f6c43d43f9103e06dd8b4095a9b2b43ce9"
+dependencies = [
+ "form_urlencoded",
+ "itoa 0.4.7",
+ "ryu",
+ "serde",
+]
+
+[[package]]
+name = "serde_with"
+version = "1.9.4"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "1ad9fdbb69badc8916db738c25efd04f0a65297d26c2f8de4b62e57b8c12bc72"
+dependencies = [
+ "rustversion",
+ "serde",
+ "serde_with_macros",
+]
+
+[[package]]
+name = "serde_with_macros"
+version = "1.4.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "e1569374bd54623ec8bd592cf22ba6e03c0f177ff55fbc8c29a49e296e7adecf"
+dependencies = [
+ "darling",
+ "proc-macro2",
+ "quote",
+ "syn",
+]
+
+[[package]]
+name = "serde_yaml"
+version = "0.8.26"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "578a7433b776b56a35785ed5ce9a7e777ac0598aac5a6dd1b4b18a307c7fc71b"
+dependencies = [
+ "indexmap",
+ "ryu",
+ "serde",
+ "yaml-rust",
+]
+
+[[package]]
+name = "sha-1"
+version = "0.9.7"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "1a0c8611594e2ab4ebbf06ec7cbbf0a99450b8570e96cbf5188b5d5f6ef18d81"
+dependencies = [
+ "block-buffer 0.9.0",
+ "cfg-if 1.0.0",
+ "cpufeatures 0.1.5",
+ "digest 0.9.0",
+ "opaque-debug",
+]
+
+[[package]]
+name = "sha2"
+version = "0.9.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "b362ae5752fd2137731f9fa25fd4d9058af34666ca1966fb969119cc35719f12"
+dependencies = [
+ "block-buffer 0.9.0",
+ "cfg-if 1.0.0",
+ "cpufeatures 0.1.5",
+ "digest 0.9.0",
+ "opaque-debug",
+]
+
+[[package]]
+name = "sha2"
+version = "0.10.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "cf9db03534dff993187064c4e0c05a5708d2a9728ace9a8959b77bedf415dac5"
+dependencies = [
+ "cfg-if 1.0.0",
+ "cpufeatures 0.2.2",
+ "digest 0.10.3",
+]
+
+[[package]]
+name = "sha3"
+version = "0.10.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "881bf8156c87b6301fc5ca6b27f11eeb2761224c7081e69b409d5a1951a70c86"
+dependencies = [
+ "digest 0.10.3",
+ "keccak",
+]
+
+[[package]]
+name = "shellexpand"
+version = "2.1.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "83bdb7831b2d85ddf4a7b148aa19d0587eddbe8671a436b7bd1182eaad0f2829"
+dependencies = [
+ "dirs-next",
+]
+
+[[package]]
+name = "signal-hook-registry"
+version = "1.4.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "e51e73328dc4ac0c7ccbda3a494dfa03df1de2f46018127f60c693f2648455b0"
+dependencies = [
+ "libc",
+]
+
+[[package]]
+name = "siphasher"
+version = "0.3.6"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "729a25c17d72b06c68cb47955d44fda88ad2d3e7d77e025663fdd69b93dd71a1"
+
+[[package]]
+name = "slab"
+version = "0.4.4"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "c307a32c1c5c437f38c7fd45d753050587732ba8628319fbdf12a7e289ccc590"
+
+[[package]]
+name = "slog"
+version = "2.7.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "8347046d4ebd943127157b94d63abb990fcf729dc4e9978927fdf4ac3c998d06"
+
+[[package]]
+name = "slog-async"
+version = "2.7.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "766c59b252e62a34651412870ff55d8c4e6d04df19b43eecb2703e417b097ffe"
+dependencies = [
+ "crossbeam-channel",
+ "slog",
+ "take_mut",
+ "thread_local",
+]
+
+[[package]]
+name = "slog-envlogger"
+version = "2.2.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "906a1a0bc43fed692df4b82a5e2fbfc3733db8dad8bb514ab27a4f23ad04f5c0"
+dependencies = [
+ "log",
+ "regex",
+ "slog",
+ "slog-async",
+ "slog-scope",
+ "slog-stdlog",
+ "slog-term",
+]
+
+[[package]]
+name = "slog-scope"
+version = "4.4.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "2f95a4b4c3274cd2869549da82b57ccc930859bdbf5bcea0424bc5f140b3c786"
+dependencies = [
+ "arc-swap",
+ "lazy_static",
+ "slog",
+]
+
+[[package]]
+name = "slog-stdlog"
+version = "4.1.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "6706b2ace5bbae7291d3f8d2473e2bfab073ccd7d03670946197aec98471fa3e"
+dependencies = [
+ "log",
+ "slog",
+ "slog-scope",
+]
+
+[[package]]
+name = "slog-term"
+version = "2.8.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "95c1e7e5aab61ced6006149ea772770b84a0d16ce0f7885def313e4829946d76"
+dependencies = [
+ "atty",
+ "chrono",
+ "slog",
+ "term",
+ "thread_local",
+]
+
+[[package]]
+name = "smallvec"
+version = "1.6.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "fe0f37c9e8f3c5a4a66ad655a93c74daac4ad00c441533bf5c6e7990bb42604e"
+
+[[package]]
+name = "socket2"
+version = "0.4.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "765f090f0e423d2b55843402a07915add955e7d60657db13707a159727326cad"
+dependencies = [
+ "libc",
+ "winapi",
+]
+
+[[package]]
+name = "soketto"
+version = "0.7.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "41d1c5305e39e09653383c2c7244f2f78b3bcae37cf50c64cb4789c9f5096ec2"
+dependencies = [
+ "base64",
+ "bytes",
+ "futures 0.3.16",
+ "httparse",
+ "log",
+ "rand",
+ "sha-1",
+]
+
+[[package]]
+name = "spin"
+version = "0.5.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "6e63cff320ae2c57904679ba7cb63280a3dc4613885beafb148ee7bf9aa9042d"
+
+[[package]]
+name = "stable-hash"
+version = "0.3.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "10196e68950ed99c0d2db7a30ffaf4dfe0bbf2f9af2ae0457ee8ad396e0a2dd7"
+dependencies = [
+ "blake3 0.3.8",
+ "firestorm 0.4.6",
+ "ibig",
+ "lazy_static",
+ "leb128",
+ "num-traits",
+]
+
+[[package]]
+name = "stable-hash"
+version = "0.4.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "af75bd21beb162eab69de76abbb803d4111735ead00d5086dcc6f4ddb3b53cc9"
+dependencies = [
+ "blake3 0.3.8",
+ "firestorm 0.5.0",
+ "ibig",
+ "lazy_static",
+ "leb128",
+ "num-traits",
+ "xxhash-rust",
+]
+
+[[package]]
+name = "stable_deref_trait"
+version = "1.2.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "a8f112729512f8e442d81f95a8a7ddf2b7c6b8a1a6f509a95864142b30cab2d3"
+
+[[package]]
+name = "static_assertions"
+version = "1.1.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "a2eb9349b6444b326872e140eb1cf5e7c522154d69e7a0ffb0fb81c06b37543f"
+
+[[package]]
+name = "stringprep"
+version = "0.1.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "8ee348cb74b87454fff4b551cbf727025810a004f88aeacae7f85b87f4e9a1c1"
+dependencies = [
+ "unicode-bidi",
+ "unicode-normalization",
+]
+
+[[package]]
+name = "strsim"
+version = "0.10.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "73473c0e59e6d5812c5dfe2a064a6444949f089e20eec9a2e5506596494e4623"
+
+[[package]]
+name = "strum"
+version = "0.21.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "aaf86bbcfd1fa9670b7a129f64fc0c9fcbbfe4f1bc4210e9e98fe71ffc12cde2"
+
+[[package]]
+name = "strum_macros"
+version = "0.21.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d06aaeeee809dbc59eb4556183dd927df67db1540de5be8d3ec0b6636358a5ec"
+dependencies = [
+ "heck 0.3.3",
+ "proc-macro2",
+ "quote",
+ "syn",
+]
+
+[[package]]
+name = "subtle"
+version = "2.4.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "6bdef32e8150c2a081110b42772ffe7d7c9032b606bc226c8260fd97e0976601"
+
+[[package]]
+name = "syn"
+version = "1.0.98"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "c50aef8a904de4c23c788f104b7dddc7d6f79c647c7c8ce4cc8f73eb0ca773dd"
+dependencies = [
+ "proc-macro2",
+ "quote",
+ "unicode-ident",
+]
+
+[[package]]
+name = "sync_wrapper"
+version = "0.1.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "20518fe4a4c9acf048008599e464deb21beeae3d3578418951a189c235a7a9a8"
+
+[[package]]
+name = "synstructure"
+version = "0.12.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "474aaa926faa1603c40b7885a9eaea29b444d1cb2850cb7c0e37bb1a4182f4fa"
+dependencies = [
+ "proc-macro2",
+ "quote",
+ "syn",
+ "unicode-xid",
+]
+
+[[package]]
+name = "take_mut"
+version = "0.2.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "f764005d11ee5f36500a149ace24e00e3da98b0158b3e2d53a7495660d3f4d60"
+
+[[package]]
+name = "tap"
+version = "1.0.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "55937e1799185b12863d447f42597ed69d9928686b8d88a1df17376a097d8369"
+
+[[package]]
+name = "target-lexicon"
+version = "0.12.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "b0652da4c4121005e9ed22b79f6c5f2d9e2752906b53a33e9490489ba421a6fb"
+
+[[package]]
+name = "tempfile"
+version = "3.2.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "dac1c663cfc93810f88aed9b8941d48cabf856a1b111c29a40439018d870eb22"
+dependencies = [
+ "cfg-if 1.0.0",
+ "libc",
+ "rand",
+ "redox_syscall 0.2.10",
+ "remove_dir_all",
+ "winapi",
+]
+
+[[package]]
+name = "term"
+version = "0.7.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "c59df8ac95d96ff9bede18eb7300b0fda5e5d8d90960e76f8e14ae765eedbf1f"
+dependencies = [
+ "dirs-next",
+ "rustversion",
+ "winapi",
+]
+
+[[package]]
+name = "termcolor"
+version = "1.1.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "2dfed899f0eb03f32ee8c6a0aabdb8a7949659e3466561fc0adf54e26d88c5f4"
+dependencies = [
+ "winapi-util",
+]
+
+[[package]]
+name = "terminal_size"
+version = "0.1.17"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "633c1a546cee861a1a6d0dc69ebeca693bf4296661ba7852b9d21d159e0506df"
+dependencies = [
+ "libc",
+ "winapi",
+]
+
+[[package]]
+name = "test-store"
+version = "0.27.0"
+dependencies = [
+ "diesel",
+ "graph",
+ "graph-graphql",
+ "graph-mock",
+ "graph-node",
+ "graph-store-postgres",
+ "graphql-parser",
+ "hex-literal",
+ "lazy_static",
+ "serde",
+]
+
+[[package]]
+name = "textwrap"
+version = "0.15.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "949517c0cf1bf4ee812e2e07e08ab448e3ae0d23472aee8a06c985f0c8815b16"
+
+[[package]]
+name = "thiserror"
+version = "1.0.31"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "bd829fe32373d27f76265620b5309d0340cb8550f523c1dda251d6298069069a"
+dependencies = [
+ "thiserror-impl",
+]
+
+[[package]]
+name = "thiserror-impl"
+version = "1.0.31"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "0396bc89e626244658bef819e22d0cc459e795a5ebe878e6ec336d1674a8d79a"
+dependencies = [
+ "proc-macro2",
+ "quote",
+ "syn",
+]
+
+[[package]]
+name = "thread_local"
+version = "1.1.4"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "5516c27b78311c50bf42c071425c560ac799b11c30b31f87e3081965fe5e0180"
+dependencies = [
+ "once_cell",
+]
+
+[[package]]
+name = "time"
+version = "0.1.44"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "6db9e6914ab8b1ae1c260a4ae7a49b6c5611b40328a735b21862567685e73255"
+dependencies = [
+ "libc",
+ "wasi",
+ "winapi",
+]
+
+[[package]]
+name = "tiny-keccak"
+version = "1.5.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "1d8a021c69bb74a44ccedb824a046447e2c84a01df9e5c20779750acb38e11b2"
+dependencies = [
+ "crunchy",
+]
+
+[[package]]
+name = "tiny-keccak"
+version = "2.0.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "2c9d3793400a45f954c52e73d068316d76b6f4e36977e3fcebb13a2721e80237"
+dependencies = [
+ "crunchy",
+]
+
+[[package]]
+name = "tinyvec"
+version = "1.3.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "848a1e1181b9f6753b5e96a092749e29b11d19ede67dfbbd6c7dc7e0f49b5338"
+dependencies = [
+ "tinyvec_macros",
+]
+
+[[package]]
+name = "tinyvec_macros"
+version = "0.1.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "cda74da7e1a664f795bb1f8a87ec406fb89a02522cf6e50620d016add6dbbf5c"
+
+[[package]]
+name = "tokio"
+version = "1.16.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "0c27a64b625de6d309e8c57716ba93021dccf1b3b5c97edd6d3dd2d2135afc0a"
+dependencies = [
+ "bytes",
+ "libc",
+ "memchr",
+ "mio",
+ "num_cpus",
+ "once_cell",
+ "parking_lot 0.11.2",
+ "pin-project-lite",
+ "signal-hook-registry",
+ "tokio-macros",
+ "winapi",
+]
+
+[[package]]
+name = "tokio-io-timeout"
+version = "1.1.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "90c49f106be240de154571dd31fbe48acb10ba6c6dd6f6517ad603abffa42de9"
+dependencies = [
+ "pin-project-lite",
+ "tokio",
+]
+
+[[package]]
+name = "tokio-macros"
+version = "1.7.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "b557f72f448c511a979e2564e55d74e6c4432fc96ff4f6241bc6bded342643b7"
+dependencies = [
+ "proc-macro2",
+ "quote",
+ "syn",
+]
+
+[[package]]
+name = "tokio-native-tls"
+version = "0.3.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "f7d995660bd2b7f8c1568414c1126076c13fbb725c40112dc0120b78eb9b717b"
+dependencies = [
+ "native-tls",
+ "tokio",
+]
+
+[[package]]
+name = "tokio-openssl"
+version = "0.6.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "c08f9ffb7809f1b20c1b398d92acf4cc719874b3b2b2d9ea2f09b4a80350878a"
+dependencies = [
+ "futures-util",
+ "openssl",
+ "openssl-sys",
+ "tokio",
+]
+
+[[package]]
+name = "tokio-postgres"
+version = "0.7.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "2d2b1383c7e4fb9a09e292c7c6afb7da54418d53b045f1c1fac7a911411a2b8b"
+dependencies = [
+ "async-trait",
+ "byteorder",
+ "bytes",
+ "fallible-iterator",
+ "futures 0.3.16",
+ "log",
+ "parking_lot 0.11.2",
+ "percent-encoding",
+ "phf",
+ "pin-project-lite",
+ "postgres-protocol",
+ "postgres-types",
+ "socket2",
+ "tokio",
+ "tokio-util 0.6.7",
+]
+
+[[package]]
+name = "tokio-retry"
+version = "0.3.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "7f57eb36ecbe0fc510036adff84824dd3c24bb781e21bfa67b69d556aa85214f"
+dependencies = [
+ "pin-project",
+ "rand",
+ "tokio",
+]
+
+[[package]]
+name = "tokio-rustls"
+version = "0.23.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "4151fda0cf2798550ad0b34bcfc9b9dcc2a9d2471c895c68f3a8818e54f2389e"
+dependencies = [
+ "rustls",
+ "tokio",
+ "webpki",
+]
+
+[[package]]
+name = "tokio-stream"
+version = "0.1.9"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "df54d54117d6fdc4e4fea40fe1e4e566b3505700e148a6827e59b34b0d2600d9"
+dependencies = [
+ "futures-core",
+ "pin-project-lite",
+ "tokio",
+ "tokio-util 0.7.1",
+]
+
+[[package]]
+name = "tokio-test"
+version = "0.4.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "53474327ae5e166530d17f2d956afcb4f8a004de581b3cae10f12006bc8163e3"
+dependencies = [
+ "async-stream",
+ "bytes",
+ "futures-core",
+ "tokio",
+ "tokio-stream",
+]
+
+[[package]]
+name = "tokio-tungstenite"
+version = "0.14.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "1e96bb520beab540ab664bd5a9cfeaa1fcd846fa68c830b42e2c8963071251d2"
+dependencies = [
+ "futures-util",
+ "log",
+ "pin-project",
+ "tokio",
+ "tungstenite",
+]
+
+[[package]]
+name = "tokio-util"
+version = "0.6.7"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "1caa0b0c8d94a049db56b5acf8cba99dc0623aab1b26d5b5f5e2d945846b3592"
+dependencies = [
+ "bytes",
+ "futures-core",
+ "futures-io",
+ "futures-sink",
+ "log",
+ "pin-project-lite",
+ "tokio",
+]
+
+[[package]]
+name = "tokio-util"
+version = "0.7.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "0edfdeb067411dba2044da6d1cb2df793dd35add7888d73c16e3381ded401764"
+dependencies = [
+ "bytes",
+ "futures-core",
+ "futures-sink",
+ "pin-project-lite",
+ "tokio",
+ "tracing",
+]
+
+[[package]]
+name = "toml"
+version = "0.5.8"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "a31142970826733df8241ef35dc040ef98c679ab14d7c3e54d827099b3acecaa"
+dependencies = [
+ "serde",
+]
+
+[[package]]
+name = "tonic"
+version = "0.7.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "30fb54bf1e446f44d870d260d99957e7d11fb9d0a0f5bd1a662ad1411cc103f9"
+dependencies = [
+ "async-stream",
+ "async-trait",
+ "axum",
+ "base64",
+ "bytes",
+ "flate2",
+ "futures-core",
+ "futures-util",
+ "h2",
+ "http",
+ "http-body",
+ "hyper",
+ "hyper-timeout",
+ "percent-encoding",
+ "pin-project",
+ "prost",
+ "prost-derive",
+ "rustls-native-certs",
+ "rustls-pemfile 0.3.0",
+ "tokio",
+ "tokio-rustls",
+ "tokio-stream",
+ "tokio-util 0.7.1",
+ "tower 0.4.12 (registry+https://github.com/rust-lang/crates.io-index)",
+ "tower-layer 0.3.1 (registry+https://github.com/rust-lang/crates.io-index)",
+ "tower-service 0.3.1 (registry+https://github.com/rust-lang/crates.io-index)",
+ "tracing",
+ "tracing-futures",
+]
+
+[[package]]
+name = "tonic-build"
+version = "0.7.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d9263bf4c9bfaae7317c1c2faf7f18491d2fe476f70c414b73bf5d445b00ffa1"
+dependencies = [
+ "prettyplease",
+ "proc-macro2",
+ "prost-build",
+ "quote",
+ "syn",
+]
+
+[[package]]
+name = "tower"
+version = "0.4.12"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "9a89fd63ad6adf737582df5db40d286574513c69a11dac5214dc3b5603d6713e"
+dependencies = [
+ "futures-core",
+ "futures-util",
+ "indexmap",
+ "pin-project",
+ "pin-project-lite",
+ "rand",
+ "slab",
+ "tokio",
+ "tokio-util 0.7.1",
+ "tower-layer 0.3.1 (registry+https://github.com/rust-lang/crates.io-index)",
+ "tower-service 0.3.1 (registry+https://github.com/rust-lang/crates.io-index)",
+ "tracing",
+]
+
+[[package]]
+name = "tower"
+version = "0.4.12"
+source = "git+https://github.com/tower-rs/tower.git#ee826286fd1f994eabf14229e1e579ae29237386"
+dependencies = [
+ "futures-core",
+ "futures-util",
+ "pin-project-lite",
+ "tokio",
+ "tokio-util 0.7.1",
+ "tower-layer 0.3.1 (git+https://github.com/tower-rs/tower.git)",
+ "tower-service 0.3.1 (git+https://github.com/tower-rs/tower.git)",
+ "tracing",
+]
+
+[[package]]
+name = "tower-http"
+version = "0.3.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "e980386f06883cf4d0578d6c9178c81f68b45d77d00f2c2c1bc034b3439c2c56"
+dependencies = [
+ "bitflags",
+ "bytes",
+ "futures-core",
+ "futures-util",
+ "http",
+ "http-body",
+ "http-range-header",
+ "pin-project-lite",
+ "tower 0.4.12 (registry+https://github.com/rust-lang/crates.io-index)",
+ "tower-layer 0.3.1 (registry+https://github.com/rust-lang/crates.io-index)",
+ "tower-service 0.3.1 (registry+https://github.com/rust-lang/crates.io-index)",
+]
+
+[[package]]
+name = "tower-layer"
+version = "0.3.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "343bc9466d3fe6b0f960ef45960509f84480bf4fd96f92901afe7ff3df9d3a62"
+
+[[package]]
+name = "tower-layer"
+version = "0.3.1"
+source = "git+https://github.com/tower-rs/tower.git#ee826286fd1f994eabf14229e1e579ae29237386"
+
+[[package]]
+name = "tower-service"
+version = "0.3.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "360dfd1d6d30e05fda32ace2c8c70e9c0a9da713275777f5a4dbb8a1893930c6"
+
+[[package]]
+name = "tower-service"
+version = "0.3.1"
+source = "git+https://github.com/tower-rs/tower.git#ee826286fd1f994eabf14229e1e579ae29237386"
+
+[[package]]
+name = "tower-test"
+version = "0.4.0"
+source = "git+https://github.com/tower-rs/tower.git#ee826286fd1f994eabf14229e1e579ae29237386"
+dependencies = [
+ "futures-util",
+ "pin-project-lite",
+ "tokio",
+ "tokio-test",
+ "tower-layer 0.3.1 (git+https://github.com/tower-rs/tower.git)",
+ "tower-service 0.3.1 (git+https://github.com/tower-rs/tower.git)",
+]
+
+[[package]]
+name = "tracing"
+version = "0.1.36"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "2fce9567bd60a67d08a16488756721ba392f24f29006402881e43b19aac64307"
+dependencies = [
+ "cfg-if 1.0.0",
+ "log",
+ "pin-project-lite",
+ "tracing-attributes",
+ "tracing-core",
+]
+
+[[package]]
+name = "tracing-attributes"
+version = "0.1.22"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "11c75893af559bc8e10716548bdef5cb2b983f8e637db9d0e15126b61b484ee2"
+dependencies = [
+ "proc-macro2",
+ "quote",
+ "syn",
+]
+
+[[package]]
+name = "tracing-core"
+version = "0.1.29"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "5aeea4303076558a00714b823f9ad67d58a3bbda1df83d8827d21193156e22f7"
+dependencies = [
+ "once_cell",
+]
+
+[[package]]
+name = "tracing-futures"
+version = "0.2.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "97d095ae15e245a057c8e8451bab9b3ee1e1f68e9ba2b4fbc18d0ac5237835f2"
+dependencies = [
+ "pin-project",
+ "tracing",
+]
+
+[[package]]
+name = "try-lock"
+version = "0.2.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "59547bce71d9c38b83d9c0e92b6066c4253371f15005def0c30d9657f50c7642"
+
+[[package]]
+name = "tungstenite"
+version = "0.13.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "5fe8dada8c1a3aeca77d6b51a4f1314e0f4b8e438b7b1b71e3ddaca8080e4093"
+dependencies = [
+ "base64",
+ "byteorder",
+ "bytes",
+ "http",
+ "httparse",
+ "input_buffer",
+ "log",
+ "rand",
+ "sha-1",
+ "thiserror",
+ "url",
+ "utf-8",
+]
+
+[[package]]
+name = "typenum"
+version = "1.15.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "dcf81ac59edc17cc8697ff311e8f5ef2d99fcbd9817b34cec66f90b6c3dfd987"
+
+[[package]]
+name = "uint"
+version = "0.9.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "6470ab50f482bde894a037a57064480a246dbfdd5960bd65a44824693f08da5f"
+dependencies = [
+ "byteorder",
+ "crunchy",
+ "hex",
+ "static_assertions",
+]
+
+[[package]]
+name = "unicase"
+version = "2.6.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "50f37be617794602aabbeee0be4f259dc1778fabe05e2d67ee8f79326d5cb4f6"
+dependencies = [
+ "version_check",
+]
+
+[[package]]
+name = "unicode-bidi"
+version = "0.3.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "eeb8be209bb1c96b7c177c7420d26e04eccacb0eeae6b980e35fcb74678107e0"
+dependencies = [
+ "matches",
+]
+
+[[package]]
+name = "unicode-ident"
+version = "1.0.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "5bd2fe26506023ed7b5e1e315add59d6f584c621d037f9368fea9cfb988f368c"
+
+[[package]]
+name = "unicode-normalization"
+version = "0.1.19"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d54590932941a9e9266f0832deed84ebe1bf2e4c9e4a3554d393d18f5e854bf9"
+dependencies = [
+ "tinyvec",
+]
+
+[[package]]
+name = "unicode-segmentation"
+version = "1.8.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "8895849a949e7845e06bd6dc1aa51731a103c42707010a5b591c0038fb73385b"
+
+[[package]]
+name = "unicode-width"
+version = "0.1.8"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "9337591893a19b88d8d87f2cec1e73fad5cdfd10e5a6f349f498ad6ea2ffb1e3"
+
+[[package]]
+name = "unicode-xid"
+version = "0.2.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "8ccb82d61f80a663efe1f787a51b16b5a51e3314d6ac365b08639f52387b33f3"
+
+[[package]]
+name = "unreachable"
+version = "1.0.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "382810877fe448991dfc7f0dd6e3ae5d58088fd0ea5e35189655f84e6814fa56"
+dependencies = [
+ "void",
+]
+
+[[package]]
+name = "unsigned-varint"
+version = "0.7.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d86a8dc7f45e4c1b0d30e43038c38f274e77af056aa5f74b93c2cf9eb3c1c836"
+
+[[package]]
+name = "untrusted"
+version = "0.7.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "a156c684c91ea7d62626509bce3cb4e1d9ed5c4d978f7b4352658f96a4c26b4a"
+
+[[package]]
+name = "url"
+version = "2.2.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "a507c383b2d33b5fc35d1861e77e6b383d158b2da5e14fe51b83dfedf6fd578c"
+dependencies = [
+ "form_urlencoded",
+ "idna",
+ "matches",
+ "percent-encoding",
+]
+
+[[package]]
+name = "utf-8"
+version = "0.7.6"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "09cc8ee72d2a9becf2f2febe0205bbed8fc6615b7cb429ad062dc7b7ddd036a9"
+
+[[package]]
+name = "uuid"
+version = "0.8.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "bc5cf98d8186244414c848017f0e2676b3fcb46807f6668a97dfe67359a3c4b7"
+dependencies = [
+ "getrandom",
+]
+
+[[package]]
+name = "uuid"
+version = "1.1.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "dd6469f4314d5f1ffec476e05f17cc9a78bc7a27a6a857842170bdf8d6f98d2f"
+dependencies = [
+ "getrandom",
+]
+
+[[package]]
+name = "vcpkg"
+version = "0.2.15"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "accd4ea62f7bb7a82fe23066fb0957d48ef677f6eeb8215f372f52e48bb32426"
+
+[[package]]
+name = "version_check"
+version = "0.9.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "5fecdca9a5291cc2b8dcf7dc02453fee791a280f3743cb0905f8822ae463b3fe"
+
+[[package]]
+name = "void"
+version = "1.0.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "6a02e4885ed3bc0f2de90ea6dd45ebcbb66dacffe03547fadbb0eeae2770887d"
+
+[[package]]
+name = "want"
+version = "0.3.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "1ce8a968cb1cd110d136ff8b819a556d6fb6d919363c61534f6860c7eb172ba0"
+dependencies = [
+ "log",
+ "try-lock",
+]
+
+[[package]]
+name = "wasi"
+version = "0.10.0+wasi-snapshot-preview1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "1a143597ca7c7793eff794def352d41792a93c481eb1042423ff7ff72ba2c31f"
+
+[[package]]
+name = "wasm-bindgen"
+version = "0.2.82"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "fc7652e3f6c4706c8d9cd54832c4a4ccb9b5336e2c3bd154d5cccfbf1c1f5f7d"
+dependencies = [
+ "cfg-if 1.0.0",
+ "serde",
+ "serde_json",
+ "wasm-bindgen-macro",
+]
+
+[[package]]
+name = "wasm-bindgen-backend"
+version = "0.2.82"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "662cd44805586bd52971b9586b1df85cdbbd9112e4ef4d8f41559c334dc6ac3f"
+dependencies = [
+ "bumpalo",
+ "log",
+ "once_cell",
+ "proc-macro2",
+ "quote",
+ "syn",
+ "wasm-bindgen-shared",
+]
+
+[[package]]
+name = "wasm-bindgen-futures"
+version = "0.4.25"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "16646b21c3add8e13fdb8f20172f8a28c3dbf62f45406bcff0233188226cfe0c"
+dependencies = [
+ "cfg-if 1.0.0",
+ "js-sys",
+ "wasm-bindgen",
+ "web-sys",
+]
+
+[[package]]
+name = "wasm-bindgen-macro"
+version = "0.2.82"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "b260f13d3012071dfb1512849c033b1925038373aea48ced3012c09df952c602"
+dependencies = [
+ "quote",
+ "wasm-bindgen-macro-support",
+]
+
+[[package]]
+name = "wasm-bindgen-macro-support"
+version = "0.2.82"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "5be8e654bdd9b79216c2929ab90721aa82faf65c48cdf08bdc4e7f51357b80da"
+dependencies = [
+ "proc-macro2",
+ "quote",
+ "syn",
+ "wasm-bindgen-backend",
+ "wasm-bindgen-shared",
+]
+
+[[package]]
+name = "wasm-bindgen-shared"
+version = "0.2.82"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "6598dd0bd3c7d51095ff6531a5b23e02acdc81804e30d8f07afb77b7215a140a"
+
+[[package]]
+name = "wasm-instrument"
+version = "0.2.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "8bca81f5279342b38b17d9acbf007a46ddeb73144e2bd5f0a21bfa9fc5d4ab3e"
+dependencies = [
+ "parity-wasm",
+]
+
+[[package]]
+name = "wasmparser"
+version = "0.78.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "52144d4c78e5cf8b055ceab8e5fa22814ce4315d6002ad32cfd914f37c12fd65"
+
+[[package]]
+name = "wasmtime"
+version = "0.27.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "b310b9d20fcf59385761d1ade7a3ef06aecc380e3d3172035b919eaf7465d9f7"
+dependencies = [
+ "anyhow",
+ "backtrace",
+ "bincode",
+ "cfg-if 1.0.0",
+ "cpp_demangle",
+ "indexmap",
+ "lazy_static",
+ "libc",
+ "log",
+ "paste",
+ "psm",
+ "region",
+ "rustc-demangle",
+ "serde",
+ "smallvec",
+ "target-lexicon",
+ "wasmparser",
+ "wasmtime-cache",
+ "wasmtime-environ",
+ "wasmtime-fiber",
+ "wasmtime-jit",
+ "wasmtime-profiling",
+ "wasmtime-runtime",
+ "wat",
+ "winapi",
+]
+
+[[package]]
+name = "wasmtime-cache"
+version = "0.27.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d14d500d5c3dc5f5c097158feee123d64b3097f0d836a2a27dff9c761c73c843"
+dependencies = [
+ "anyhow",
+ "base64",
+ "bincode",
+ "directories-next",
+ "errno",
+ "file-per-thread-logger",
+ "libc",
+ "log",
+ "serde",
+ "sha2 0.9.5",
+ "toml",
+ "winapi",
+ "zstd",
+]
+
+[[package]]
+name = "wasmtime-cranelift"
+version = "0.27.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "c525b39f062eada7db3c1298287b96dcb6e472b9f6b22501300b28d9fa7582f6"
+dependencies = [
+ "cranelift-codegen",
+ "cranelift-entity",
+ "cranelift-frontend",
+ "cranelift-wasm",
+ "target-lexicon",
+ "wasmparser",
+ "wasmtime-environ",
+]
+
+[[package]]
+name = "wasmtime-debug"
+version = "0.27.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "c5d2a763e7a6fc734218e0e463196762a4f409c483063d81e0e85f96343b2e0a"
+dependencies = [
+ "anyhow",
+ "gimli 0.24.0",
+ "more-asserts",
+ "object 0.24.0",
+ "target-lexicon",
+ "thiserror",
+ "wasmparser",
+ "wasmtime-environ",
+]
+
+[[package]]
+name = "wasmtime-environ"
+version = "0.27.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "f64d0c2d881c31b0d65c1f2695e022d71eb60b9fbdd336aacca28208b58eac90"
+dependencies = [
+ "cfg-if 1.0.0",
+ "cranelift-codegen",
+ "cranelift-entity",
+ "cranelift-wasm",
+ "gimli 0.24.0",
+ "indexmap",
+ "log",
+ "more-asserts",
+ "serde",
+ "thiserror",
+ "wasmparser",
+]
+
+[[package]]
+name = "wasmtime-fiber"
+version = "0.27.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "a089d44cd7e2465d41a53b840a5b4fca1bf6d1ecfebc970eac9592b34ea5f0b3"
+dependencies = [
+ "cc",
+ "libc",
+ "winapi",
+]
+
+[[package]]
+name = "wasmtime-jit"
+version = "0.27.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "4d4539ea734422b7c868107e2187d7746d8affbcaa71916d72639f53757ad707"
+dependencies = [
+ "addr2line 0.15.2",
+ "anyhow",
+ "cfg-if 1.0.0",
+ "cranelift-codegen",
+ "cranelift-entity",
+ "cranelift-frontend",
+ "cranelift-native",
+ "cranelift-wasm",
+ "gimli 0.24.0",
+ "log",
+ "more-asserts",
+ "object 0.24.0",
+ "rayon",
+ "region",
+ "serde",
+ "target-lexicon",
+ "thiserror",
+ "wasmparser",
+ "wasmtime-cranelift",
+ "wasmtime-debug",
+ "wasmtime-environ",
+ "wasmtime-obj",
+ "wasmtime-profiling",
+ "wasmtime-runtime",
+ "winapi",
+]
+
+[[package]]
+name = "wasmtime-obj"
+version = "0.27.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "8e1a8ff85246d091828e2225af521a6208ed28c997bb5c39eb697366dc2e2f2b"
+dependencies = [
+ "anyhow",
+ "more-asserts",
+ "object 0.24.0",
+ "target-lexicon",
+ "wasmtime-debug",
+ "wasmtime-environ",
+]
+
+[[package]]
+name = "wasmtime-profiling"
+version = "0.27.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "e24364d522dcd67c897c8fffc42e5bdfc57207bbb6d7eeade0da9d4a7d70105b"
+dependencies = [
+ "anyhow",
+ "cfg-if 1.0.0",
+ "gimli 0.24.0",
+ "lazy_static",
+ "libc",
+ "object 0.24.0",
+ "scroll",
+ "serde",
+ "target-lexicon",
+ "wasmtime-environ",
+ "wasmtime-runtime",
+]
+
+[[package]]
+name = "wasmtime-runtime"
+version = "0.27.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "c51e57976e8a19a18a18e002c6eb12e5769554204238e47ff155fda1809ef0f7"
+dependencies = [
+ "anyhow",
+ "backtrace",
+ "cc",
+ "cfg-if 1.0.0",
+ "indexmap",
+ "lazy_static",
+ "libc",
+ "log",
+ "mach",
+ "memoffset",
+ "more-asserts",
+ "rand",
+ "region",
+ "thiserror",
+ "wasmtime-environ",
+ "wasmtime-fiber",
+ "winapi",
+]
+
+[[package]]
+name = "wast"
+version = "37.0.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "9bc7b9a76845047ded00e031754ff410afee0d50fbdf62b55bdeecd245063d68"
+dependencies = [
+ "leb128",
+]
+
+[[package]]
+name = "wat"
+version = "1.0.39"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "2ab2cc8d9a69d1ab28a41d9149bb06bb927aba8fc9d56625f8b597a564c83f50"
+dependencies = [
+ "wast",
+]
+
+[[package]]
+name = "web-sys"
+version = "0.3.52"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "01c70a82d842c9979078c772d4a1344685045f1a5628f677c2b2eab4dd7d2696"
+dependencies = [
+ "js-sys",
+ "wasm-bindgen",
+]
+
+[[package]]
+name = "web3"
+version = "0.19.0-graph"
+source = "git+https://github.com/graphprotocol/rust-web3?branch=graph-patches-onto-0.18#7f8eb6dfcc13a4186f9b42f91de950646bc4a833"
+dependencies = [
+ "arrayvec 0.7.2",
+ "base64",
+ "bytes",
+ "derive_more",
+ "ethabi",
+ "ethereum-types",
+ "futures 0.3.16",
+ "futures-timer",
+ "headers",
+ "hex",
+ "idna",
+ "jsonrpc-core",
+ "log",
+ "once_cell",
+ "parking_lot 0.12.1",
+ "pin-project",
+ "reqwest",
+ "rlp",
+ "secp256k1",
+ "serde",
+ "serde_json",
+ "soketto",
+ "tiny-keccak 2.0.2",
+ "tokio",
+ "tokio-stream",
+ "tokio-util 0.6.7",
+ "url",
+ "web3-async-native-tls",
+]
+
+[[package]]
+name = "web3-async-native-tls"
+version = "0.4.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "1f6d8d1636b2627fe63518d5a9b38a569405d9c9bc665c43c9c341de57227ebb"
+dependencies = [
+ "native-tls",
+ "thiserror",
+ "tokio",
+ "url",
+]
+
+[[package]]
+name = "webpki"
+version = "0.22.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "f095d78192e208183081cc07bc5515ef55216397af48b873e5edcd72637fa1bd"
+dependencies = [
+ "ring",
+ "untrusted",
+]
+
+[[package]]
+name = "which"
+version = "4.2.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "ea187a8ef279bc014ec368c27a920da2024d2a711109bfbe3440585d5cf27ad9"
+dependencies = [
+ "either",
+ "lazy_static",
+ "libc",
+]
+
+[[package]]
+name = "winapi"
+version = "0.3.9"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "5c839a674fcd7a98952e593242ea400abe93992746761e38641405d28b00f419"
+dependencies = [
+ "winapi-i686-pc-windows-gnu",
+ "winapi-x86_64-pc-windows-gnu",
+]
+
+[[package]]
+name = "winapi-i686-pc-windows-gnu"
+version = "0.4.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "ac3b87c63620426dd9b991e5ce0329eff545bccbbb34f3be09ff6fb6ab51b7b6"
+
+[[package]]
+name = "winapi-util"
+version = "0.1.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "70ec6ce85bb158151cae5e5c87f95a8e97d2c0c4b001223f33a334e3ce5de178"
+dependencies = [
+ "winapi",
+]
+
+[[package]]
+name = "winapi-x86_64-pc-windows-gnu"
+version = "0.4.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "712e227841d057c1ee1cd2fb22fa7e5a5461ae8e48fa2ca79ec42cfc1931183f"
+
+[[package]]
+name = "windows-sys"
+version = "0.32.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "3df6e476185f92a12c072be4a189a0210dcdcf512a1891d6dff9edb874deadc6"
+dependencies = [
+ "windows_aarch64_msvc",
+ "windows_i686_gnu",
+ "windows_i686_msvc",
+ "windows_x86_64_gnu",
+ "windows_x86_64_msvc",
+]
+
+[[package]]
+name = "windows_aarch64_msvc"
+version = "0.32.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d8e92753b1c443191654ec532f14c199742964a061be25d77d7a96f09db20bf5"
+
+[[package]]
+name = "windows_i686_gnu"
+version = "0.32.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "6a711c68811799e017b6038e0922cb27a5e2f43a2ddb609fe0b6f3eeda9de615"
+
+[[package]]
+name = "windows_i686_msvc"
+version = "0.32.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "146c11bb1a02615db74680b32a68e2d61f553cc24c4eb5b4ca10311740e44172"
+
+[[package]]
+name = "windows_x86_64_gnu"
+version = "0.32.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "c912b12f7454c6620635bbff3450962753834be2a594819bd5e945af18ec64bc"
+
+[[package]]
+name = "windows_x86_64_msvc"
+version = "0.32.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "504a2476202769977a040c6364301a3f65d0cc9e3fb08600b2bda150a0488316"
+
+[[package]]
+name = "winreg"
+version = "0.7.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "0120db82e8a1e0b9fb3345a539c478767c0048d842860994d96113d5b667bd69"
+dependencies = [
+ "winapi",
+]
+
+[[package]]
+name = "wyz"
+version = "0.5.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "30b31594f29d27036c383b53b59ed3476874d518f0efb151b27a4c275141390e"
+dependencies = [
+ "tap",
+]
+
+[[package]]
+name = "xxhash-rust"
+version = "0.8.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "074914ea4eec286eb8d1fd745768504f420a1f7b7919185682a4a267bed7d2e7"
+
+[[package]]
+name = "yaml-rust"
+version = "0.4.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "56c1936c4cc7a1c9ab21a1ebb602eb942ba868cbd44a99cb7cdc5892335e1c85"
+dependencies = [
+ "linked-hash-map",
+]
+
+[[package]]
+name = "yansi"
+version = "0.5.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "09041cd90cf85f7f8b2df60c646f853b7f535ce68f85244eb6731cf89fa498ec"
+
+[[package]]
+name = "zstd"
+version = "0.6.1+zstd.1.4.9"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "5de55e77f798f205d8561b8fe2ef57abfb6e0ff2abe7fd3c089e119cdb5631a3"
+dependencies = [
+ "zstd-safe",
+]
+
+[[package]]
+name = "zstd-safe"
+version = "3.0.1+zstd.1.4.9"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "1387cabcd938127b30ce78c4bf00b30387dddf704e3f0881dbc4ff62b5566f8c"
+dependencies = [
+ "libc",
+ "zstd-sys",
+]
+
+[[package]]
+name = "zstd-sys"
+version = "1.4.20+zstd.1.4.9"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "ebd5b733d7cf2d9447e2c3e76a5589b4f5e5ae065c22a2bc0b023cbc331b6c8e"
+dependencies = [
+ "cc",
+ "libc",
+]
diff --git a/Cargo.toml b/Cargo.toml
new file mode 100644
index 0000000..3bb9c26
--- /dev/null
+++ b/Cargo.toml
@@ -0,0 +1,26 @@
+[workspace]
+members = [
+    "core",
+    "chain/*",
+    "graphql",
+    "mock",
+    "node",
+    "runtime/wasm",
+    "runtime/derive",
+    "runtime/test",
+    "server/http",
+    "server/json-rpc",
+    "server/index-node",
+    "server/metrics",
+    "store/postgres",
+    "store/test-store",
+    "graph",
+    "tests",
+]
+
+# Incremental compilation on Rust 1.58 causes an ICE on build. As soon as graph node builds again, these can be removed.
+[profile.test]
+incremental = false
+
+[profile.dev]
+incremental = false
diff --git a/LICENSE-APACHE b/LICENSE-APACHE
new file mode 100644
index 0000000..63d51c2
--- /dev/null
+++ b/LICENSE-APACHE
@@ -0,0 +1,190 @@
+                              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
+
+Copyright (c) 2018 Graph Protocol, Inc. and contributors.
+
+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.
\ No newline at end of file
diff --git a/LICENSE-MIT b/LICENSE-MIT
new file mode 100644
index 0000000..6ef9ca9
--- /dev/null
+++ b/LICENSE-MIT
@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2018 Graph Protocol, Inc. and contributors.
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.
\ No newline at end of file
diff --git a/NEWS.md b/NEWS.md
new file mode 100644
index 0000000..497c56d
--- /dev/null
+++ b/NEWS.md
@@ -0,0 +1,871 @@
+# NEWS
+
+## Unreleased
+
+### New DB table for dynamic data sources
+
+For new subgraph deployments, dynamic data sources will be recorded under the `sgd*.data_sources$`
+table, rather than `subgraphs.dynamic_ethereum_contract_data_source`. As a consequence
+new deployments will not work correctly on earlier graph node versions, so
+_downgrading to an earlier graph node version is not supported_.
+See issue #3405 for other details.
+
+## 0.27.0
+
+- Store writes are now carried out in parallel to the rest of the subgraph process, improving indexing performance for subgraphs with significant store interaction. Metrics & monitoring was updated for this new pipelined process;
+- This adds support for apiVersion 0.0.7, which makes receipts accessible in Ethereum event handlers. [Documentation link](https://thegraph.com/docs/en/developing/creating-a-subgraph/#transaction-receipts-in-event-handlers);
+- This introduces some improvements to the subgraph GraphQL API, which now supports filtering on the basis of, and filtering for entities which changed from a certain block;
+- Support was added for Arweave indexing. Tendermint was renamed to Cosmos in Graph Node. These integrations are still in "beta";
+- Callhandler block filtering for contract calls now works as intended (this was a longstanding bug);
+- Gas costing for mappings is still set at a very high default, as we continue to benchmark and refine this metric;
+- A new `graphman fix block` command was added to easily refresh a block in the block cache, or clear the cache for a given network;
+- IPFS file fetching now uses `files/stat`, as `object` was deprecated;
+- Subgraphs indexing via a Firehose can now take advantage of Firehose-side filtering;
+- NEAR subgraphs can now match accounts for receipt filtering via prefixes or suffixes.
+
+## Upgrade notes
+
+- In the case of you having custom SQL, there's a [new SQL migration](https://github.com/graphprotocol/graph-node/blob/master/store/postgres/migrations/2022-04-26-125552_alter_deployment_schemas_version/up.sql);
+- On the pipelining of the store writes, there's now a new environment variable `GRAPH_STORE_WRITE_QUEUE` (default value is `5`), that if set to `0`, the old synchronous behaviour will come in instead. The value stands for the amount of write/revert parallel operations [#3177](https://github.com/graphprotocol/graph-node/pull/3177);
+- There's now support for TLS connections in the PostgreSQL `notification_listener` [#3503](https://github.com/graphprotocol/graph-node/pull/3503);
+- GraphQL HTTP and WebSocket ports can now be set via environment variables [#2832](https://github.com/graphprotocol/graph-node/pull/2832);
+- The genesis block can be set via the `GRAPH_ETHEREUM_GENESIS_BLOCK_NUMBER` env var [#3650](https://github.com/graphprotocol/graph-node/pull/3650);
+- There's a new experimental feature to limit the number of subgraphs for a specific web3 provider. [Link for documentation](https://github.com/graphprotocol/graph-node/blob/master/docs/config.md#controlling-the-number-of-subgraphs-using-a-provider);
+- Two new GraphQL validation environment variables were included: `ENABLE_GRAPHQL_VALIDATIONS` and `SILENT_GRAPHQL_VALIDATIONS`, which are documented [here](https://github.com/graphprotocol/graph-node/blob/master/docs/environment-variables.md#graphql);
+- A bug fix for `graphman index` was landed, which fixed the behavior where if one deployment was used by multiple names would result in the command not working [#3416](https://github.com/graphprotocol/graph-node/pull/3416);
+- Another fix landed for `graphman`, the bug would allow the `unassign`/`reassign` commands to make two or more nodes index the same subgraph by mistake [#3478](https://github.com/graphprotocol/graph-node/pull/3478);
+- Error messages of eth RPC providers should be clearer during `graph-node` start up [#3422](https://github.com/graphprotocol/graph-node/pull/3422);
+- Env var `GRAPH_STORE_CONNECTION_MIN_IDLE` will no longer panic, instead it will log a warning if it exceeds the `pool_size` [#3489](https://github.com/graphprotocol/graph-node/pull/3489);
+- Failed GraphQL queries now have proper timing information in the service metrics [#3508](https://github.com/graphprotocol/graph-node/pull/3508);
+- Non-primary shards now can be disabled through setting the `pool_size` to `0` [#3513](https://github.com/graphprotocol/graph-node/pull/3513);
+- Queries with large results now have a `query_id` [#3514](https://github.com/graphprotocol/graph-node/pull/3514);
+- It's now possible to disable the LFU Cache by setting `GRAPH_QUERY_LFU_CACHE_SHARDS` to `0` [#3522](https://github.com/graphprotocol/graph-node/pull/3522);
+- `GRAPH_ACCOUNT_TABLES` env var is not supported anymore [#3525](https://github.com/graphprotocol/graph-node/pull/3525);
+- [New documentation](https://github.com/graphprotocol/graph-node/blob/master/docs/implementation/metadata.md) landed on the metadata tables;
+- `GRAPH_GRAPHQL_MAX_OPERATIONS_PER_CONNECTION` for GraphQL subscriptions now has a default of `1000` [#3735](https://github.com/graphprotocol/graph-node/pull/3735)
+
+## 0.26.0
+
+### Features
+
+- Gas metering #2414
+- Adds support for Solidity Custom Errors #2577
+- Debug fork tool #2995 #3292
+- Automatically remove unused deployments #3023
+- Fix fulltextsearch space handling #3048
+- Allow placing new deployments onto one of several shards #3049
+- Make NEAR subgraphs update their sync status #3108
+- GraphQL validations #3164
+- Add special treatment for immutable entities #3201
+- Tendermint integration #3212
+- Skip block updates when triggers are empty #3223 #3268
+- Use new GraphiQL version #3252
+- GraphQL prefetching #3256
+- Allow using Bytes as well as String/ID for the id of entities #3271
+- GraphQL route for dumping entity changes in subgraph and block #3275
+- Firehose filters #3323
+- NEAR filters #3372
+
+### Robustness
+
+- Improve our `CacheWeight` estimates #2935
+- Refactor GraphQL execution #3005
+- Setup databases in parallel #3019
+- Block ingestor now fetches receipts in parallel #3030
+- Prevent subscriptions from back-pressuring the notification queue #3053
+- Avoid parsing X triggers if the filter is empty #3083
+- Pipeline `BlockStream` #3085
+- More robust `proofOfIndexing` GraphQL route #3348
+
+### `graphman`
+
+- Add `run` command, for running a subgraph up to a block #3079
+- Add `analyze` command, for analyzing a PostgreSQL table, which can improve performance #3170
+- Add `index create` command, for adding an index to certain attributes #3175
+- Add `index list` command, for listing indexes #3198
+- Add `index drop` command, for dropping indexes #3198
+
+### Dependency Updates
+
+These are the main ones:
+
+- Updated protobuf to latest version for NEAR #2947
+- Update `web3` crate #2916 #3120 #3338
+- Update `graphql-parser` to `v0.4.0` #3020
+- Bump `itertools` from `0.10.1` to `0.10.3` #3037
+- Bump `clap` from `2.33.3` to `2.34.0` #3039
+- Bump `serde_yaml` from `0.8.21` to `0.8.23` #3065
+- Bump `tokio` from `1.14.0` to `1.15.0` #3092
+- Bump `indexmap` from `1.7.0` to `1.8.0` #3143
+- Update `ethabi` to its latest version #3144
+- Bump `structopt` from `0.3.25` to `0.3.26` #3180
+- Bump `anyhow` from `1.0.45` to `1.0.53` #3182
+- Bump `quote` from `1.0.9` to `1.0.16` #3112 #3183 #3384
+- Bump `tokio` from `1.15.0` to `1.16.1` #3208
+- Bump `semver` from `1.0.4` to `1.0.5` #3229
+- Bump `async-stream` from `0.3.2` to `0.3.3` #3361
+- Update `jsonrpc-server` #3313
+
+### Misc
+
+- More context when logging RPC calls #3128
+- Increase default reorg threshold to 250 for Ethereum #3308
+- Improve traces error logs #3353
+- Add warning and continue on parse input failures for Ethereum #3326
+
+### Upgrade Notes
+
+When upgrading to this version, we recommend taking a brief look into these changes:
+
+- Gas metering #2414
+  - Now there's a gas limit for subgraph mappings, if the limit is reached the subgraph will fail with a non-deterministic error, you can make them recover via the environment variable `GRAPH_MAX_GAS_PER_HANDLER`
+- Improve our `CacheWeight` estimates #2935
+  - This is relevant because a couple of releases back we've added a limit for the memory size of a query result. That limit is based of the `CacheWeight`.
+
+These are some of the features that will probably be helpful for indexers 😊
+
+- Allow placing new deployments onto one of several shards #3049
+- GraphQL route for dumping entity changes in subgraph and block #3275
+- Unused deployments are automatically removed now #3023
+  - The interval can be set via `GRAPH_REMOVE_UNUSED_INTERVAL`
+- Setup databases in parallel #3019
+- Block ingestor now fetches receipts in parallel #3030
+  - `GRAPH_ETHEREUM_FETCH_TXN_RECEIPTS_IN_BATCHES` can be set to `true` for the old fetching behavior
+- More robust `proofOfIndexing` GraphQL route #3348
+  - A token can be set via `GRAPH_POI_ACCESS_TOKEN` to limit access to the POI route
+- The new `graphman` commands 🙂
+
+
+### Api Version 0.0.7 and Spec Version 0.0.5
+This release brings API Version 0.0.7 in mappings, which allows Ethereum event handlers to require transaction receipts to be present in the `Event` object.
+Refer to [PR #3373](https://github.com/graphprotocol/graph-node/pull/3373) for instructions on how to enable that.
+
+
+## 0.25.2
+
+This release includes two changes:
+
+- Bug fix of blocks being skipped from processing when: a deterministic error happens **and** the `index-node` gets restarted. Issue [#3236](https://github.com/graphprotocol/graph-node/issues/3236), Pull Request: [#3316](https://github.com/graphprotocol/graph-node/pull/3316).
+- Automatic retries for non-deterministic errors. Issue [#2945](https://github.com/graphprotocol/graph-node/issues/2945), Pull Request: [#2988](https://github.com/graphprotocol/graph-node/pull/2988).
+
+This is the last patch on the `0.25` minor version, soon `0.26.0` will be released. While that we recommend updating to this version to avoid determinism issues that could be caused on `graph-node` restarts.
+
+## 0.25.1
+
+This release only adds two fixes:
+
+- The first is to address an issue with decoding the input of some calls [#3194](https://github.com/graphprotocol/graph-node/issues/3194) where subgraphs that would try to index contracts related to those would fail. Now they can advance normally.
+- The second one is to fix a non-determinism issue with the retry mechanism for errors. Whenever a non-deterministic error happened, we would keep retrying to process the block, however we should've clear the `EntityCache` on each run so that the error entity changes don't get transacted/saved in the database in the next run. This could make the POI generation non-deterministic for subgraphs that failed and retried for non-deterministic reasons, adding a new entry to the database for the POI.
+
+We strongly recommend updating to this version as quickly as possible.
+
+## 0.25.0
+
+### Api Version 0.0.6
+This release ships support for API version 0.0.6 in mappings:
+- Added `nonce` field for `Transaction` objects.
+- Added `baseFeePerGas` field for `Block` objects ([EIP-1559](https://eips.ethereum.org/EIPS/eip-1559)).
+
+#### Block Cache Invalidation and Reset
+
+All cached block data must be refetched to account for the new `Block` and `Trasaction`
+struct versions, so this release includes a `graph-node` startup check that will:
+1. Truncate all block cache tables.
+2. Bump the `db_version` value from `2` to `3`.
+
+_(Table truncation is a fast operation and no downtime will occur because of that.)_
+
+
+### Ethereum
+
+- 'Out of gas' errors on contract calls are now considered deterministic errors,
+  so they can be handled by `try_` calls. The gas limit is 50 million.
+
+### Environment Variables
+
+- The `GRAPH_ETH_CALL_GAS` environment is removed to prevent misuse, its value
+  is now hardcoded to 50 million.
+
+### Multiblockchain
+- Initial support for NEAR subgraphs.
+- Added `FirehoseBlockStream` implementation of `BlockStream` (#2716)
+
+### Misc
+- Rust docker image is now based on Debian Buster.
+- Optimizations to the PostgreSQL notification queue.
+- Improve PostgreSQL robustness in multi-sharded setups. (#2815)
+- Added 'networks' to the 'subgraphFeatures' endpoint. (#2826)
+- Check and limit the size of GraphQL query results. (#2845)
+- Allow `_in` and `_not_in` GraphQL filters. (#2841)
+- Add PoI for failed subgraphs. (#2748)
+- Make `graphman rewind` safer to use. (#2879)
+- Add `subgraphErrors` for all GraphQL schemas. (#2894)
+- Add `Graph-Attestable` response header. (#2946)
+- Add support for minimum block constraint in GraphQL queries (`number_gte`) (#2868).
+- Handle revert cases from Hardhat and Ganache (#2984)
+- Fix bug on experimental prefetching optimization feature (#2899)
+
+
+## 0.24.2
+
+This release only adds a fix for an issue where certain GraphQL queries
+could lead to `graph-node` running out of memory even on very large
+systems. This release adds code that checks the size of GraphQL responses
+as they are assembled, and can warn about large responses in the logs
+resp. abort query execution based on the values of the two new environment
+variables `GRAPH_GRAPHQL_WARN_RESULT_SIZE` and
+`GRAPH_GRAPHQL_ERROR_RESULT_SIZE`. It also adds Prometheus metrics
+`query_result_size` and `query_result_max` to track the memory consumption
+of successful GraphQL queries. The unit for the two environment variables
+is bytes, based on an estimate of the memory used by the result; it is best
+to set them after observing the Prometheus metrics for a while to establish
+what constitutes a reasonable limit for them.
+
+We strongly recommend updating to this version as quickly as possible.
+
+## 0.24.1
+
+### Feature Management
+
+This release supports the upcoming Spec Version 0.0.4 that enables subgraph features to be declared in the manifest and
+validated during subgraph deployment
+[#2682](https://github.com/graphprotocol/graph-node/pull/2682)
+[#2746](https://github.com/graphprotocol/graph-node/pull/2746).
+
+> Subgraphs using previous versions are still supported and won't be affected by this change.
+
+#### New Indexer GraphQL query: `subgraphFetaures`
+
+It is now possible to query for the features a subgraph uses given its Qm-hash ID.
+
+For instance, the following query...
+
+```graphql
+{
+  subgraphFeatures(subgraphId: "QmW9ajg2oTyPfdWKyUkxc7cTJejwdyCbRrSivfryTfFe5D") {
+    features
+    errors
+  }
+}
+```
+
+... would produce this result:
+
+```json
+{
+  "data": {
+    "subgraphFeatures": {
+      "errors": [],
+      "features": [
+        "nonFatalErrors",
+        "ipfsOnEthereumContracts"
+      ]
+    }
+  }
+}
+```
+
+Subraphs with any Spec Version can be queried that way.
+
+### Api Version 0.0.5
+
+- Added better error message for null pointers in the runtime [#2780](https://github.com/graphprotocol/graph-node/pull/2780).
+
+### Environment Variables
+
+- When `GETH_ETH_CALL_ERRORS_ENV` is unset, it doesn't make `eth_call` errors to be considered determinsistic anymore [#2784](https://github.com/graphprotocol/graph-node/pull/2784)
+
+### Robustness
+
+- Tolerate a non-primary shard being down during startup [#2727](https://github.com/graphprotocol/graph-node/pull/2727).
+- Check that at least one replica for each shard has a non-zero weight [#2749](https://github.com/graphprotocol/graph-node/pull/2749).
+- Reduce locking for the chain head listener [#2763](https://github.com/graphprotocol/graph-node/pull/2763).
+
+### Logs
+
+- Improve block ingestor error reporting for missing receipts [#2743](https://github.com/graphprotocol/graph-node/pull/2743).
+
+## 0.24.0
+
+### Api Version 0.0.5
+
+This release ships support for API version 0.0.5 in mappings. hIt contains a fix for call handlers
+and the long awaited AssemblyScript version upgrade!
+
+- AssemblyScript upgrade: The mapping runtime is updated to support up-to-date versions of the
+  AssemblyScript compiler. The graph-cli/-ts releases to support this are in alpha, soon they will
+  be released along with a migration guide for subgraphs.
+- Call handlers fix: Call handlers will never be triggered on transactions with a failed status,
+  resolving issue [#2409](https://github.com/graphprotocol/graph-node/issues/2409). Done in [#2511](https://github.com/graphprotocol/graph-node/pull/2511).
+
+### Logs
+- The log `"Skipping handler because the event parameters do not match the event signature."` was downgraded from info to trace level.
+- Some block ingestor error logs were upgrded from debug to info level [#2666](https://github.com/graphprotocol/graph-node/pull/2666).
+
+### Metrics
+- `query_semaphore_wait_ms` is now by shard, and has the `pool` and `shard` labels.
+- `deployment_failed` metric added, it is `1` if the subgraph has failed and `0` otherwise.
+
+### Other
+- Upgrade to tokio 1.0 and futures 0.3 [#2679](https://github.com/graphprotocol/graph-node/pull/2679), the first major contribution by StreamingFast!
+- Support Celo block reward events [#2670](https://github.com/graphprotocol/graph-node/pull/2670).
+- Reduce the maximum WASM stack size and make it configurable [#2719](https://github.com/graphprotocol/graph-node/pull/2719).
+- For robustness, ensure periodic updates to the chain head listener [#2725](https://github.com/graphprotocol/graph-node/pull/2725).
+
+## 0.23.1
+
+- Fix ipfs timeout detection [#2584](https://github.com/graphprotocol/graph-node/pull/2584).
+- Fix discrepancy between a database table and its Diesel model [#2586](https://github.com/graphprotocol/graph-node/pull/2586).
+
+## 0.23.0
+
+The Graph Node internals are being heavily refactored to prepare it for the multichain future.
+In the meantime, here are the changes for this release:
+
+- The `GRAPH_ETH_CALL_BY_NUMBER` environment variable has been removed. Graph Node requires an
+  Ethereum client that supports EIP-1898, which all major clients support.
+- Added support for IPFS versions larger than 0.4. Several changes to make
+  `graph-node` more tolerant of slow/flaky IPFS nodes.
+- Added Ethereum ABI encoding and decoding functionality [#2348](https://github.com/graphprotocol/graph-node/pull/2348).
+- Experimental support for configuration files, see the documentation [here](https://github.com/graphprotocol/graph-node/blob/master/docs/config.md).
+- Better PoI performance [#2329](https://github.com/graphprotocol/graph-node/pull/2329).
+- Improve grafting performance and robustness by copying in batches [#2293](https://github.com/graphprotocol/graph-node/pull/2293).
+- Subgraph metadata storage has been simplified and reorganized. External
+  tools (e.g., Grafana dashboards) that access the database directly will need to be updated.
+- Ordering in GraphQL queries is now truly reversible
+  [#2214](https://github.com/graphprotocol/graph-node/pull/2214/commits/bc559b8df09a7c24f0d718b76fa670313911a6b1)
+- The `GRAPH_SQL_STATEMENT_TIMEOUT` environment variable can be used to
+  enforce a timeout for individual SQL queries that are run in the course of
+  processing a GraphQL query
+  [#2285](https://github.com/graphprotocol/graph-node/pull/2285)
+- Using `ethereum.call` in mappings in globals is deprecated
+
+### Graphman
+Graphman is a CLI tool to manage your subgraphs. It is now included in the Docker container
+[#2289](https://github.com/graphprotocol/graph-node/pull/2289). And new commands have been added:
+- `graphman copy` can copy subgraphs across DB shards [#2313](https://github.com/graphprotocol/graph-node/pull/2313).
+- `graphman rewind` to rewind a deployment to a given block [#2373](https://github.com/graphprotocol/graph-node/pull/2373).
+- `graphman query` to log info about a GraphQL query [#2206](https://github.com/graphprotocol/graph-node/pull/2206).
+- `graphman create` to create a subgraph name [#2419](https://github.com/graphprotocol/graph-node/pull/2419).
+
+### Metrics
+- The `deployment_blocks_behind` metric has been removed, and a
+  `deployment_head` metric has been added. To see how far a deployment is
+  behind, use the difference between `ethereum_chain_head_number` and
+  `deployment_head`.
+- The `trigger_type` label was removed from the metric `deployment_trigger_processing_duration`.
+
+## 0.22.0
+
+### Feature: Block store sharding
+This release makes it possible to [shard the block and call cache](./docs/config.md) for chain
+data across multiple independent Postgres databases. **This feature is considered experimental. We
+encourage users to try this out in a test environment, but do not recommend it yet for production
+use.** In particular, the details of how sharding is configured may change in backwards-incompatible
+ways in the future.
+
+### Feature: Non-fatal errors update
+Non-fatal errors (see release 0.20 for details) is documented and can now be enabled on graph-cli.
+Various related bug fixes have been made #2121 #2136 #2149 #2160.
+
+### Improvements
+- Add bitwise operations and string constructor to BigInt #2151.
+- docker: Allow custom ethereum poll interval #2139.
+- Deterministic error work in preparation for gas #2112
+
+### Bug fixes
+- Fix not contains filter #2146.
+- Resolve __typename in _meta field #2118
+- Add CORS for all HTTP responses #2196
+
+## 0.21.1
+
+- Fix subgraphs failing with a `fatalError` when deployed while already running
+  (#2104).
+- Fix missing `scalar Int` declaration in index node GraphQL API, causing
+  indexer-service queries to fail (#2104).
+
+## 0.21.0
+
+### Feature: Database sharding
+
+This release makes it possible to [shard subgraph
+storage](./docs/config.md) and spread subgraph deployments, and the load
+coming from indexing and querying them across multiple independent Postgres
+databases.
+
+**This feature is considered experimenatal. We encourage users to try this
+out in a test environment, but do not recommend it yet for production use**
+In particular, the details of how sharding is configured may change in
+backwards-incompatible ways in the future.
+
+### Breaking change: Require a block number in `proofOfIndexing` queries
+
+This changes the `proofOfIndexing` GraphQL API from
+
+```graphql
+type Query {
+  proofOfIndexing(subgraph: String!, blockHash: Bytes!, indexer: Bytes): Bytes
+}
+```
+
+to
+
+```graphql
+type Query {
+  proofOfIndexing(
+    subgraph: String!
+    blockNumber: Int!
+    blockHash: Bytes!
+    indexer: Bytes
+  ): Bytes
+}
+```
+
+This allows the indexer agent to provide a block number and hash to be able
+to obtain a POI even if this block is not cached in the Ethereum blocks
+cache. Prior to this, the POI would be `null` if this wasn't the case, even
+if the subgraph deployment in question was up to date, leading to the indexer
+missing out on indexing rewards.
+
+### Misc
+
+- Fix non-determinism caused by not (always) correctly reverting dynamic
+  sources when handling reorgs.
+- Integrate the query cache into subscriptions to improve their performance.
+- Add `graphman` crate for managing Graph Node infrastructure.
+- Improve query cache logging.
+- Expose indexing status port (`8030`) from Docker image.
+- Remove support for unnecessary data sources `templates` inside subgraph
+  data sources. They are only supported at the top level.
+- Avoid sending empty store events through the database.
+- Fix database connection deadlocks.
+- Rework the codebase to use `anyhow` instead of `failure`.
+- Log stack trace in case of database connection timeouts, to help with root-causing.
+- Fix stack overflows in GraphQL parsing.
+- Disable fulltext search by default (it is nondeterministic and therefore
+  not currently supported in the network).
+
+## 0.20.0
+
+**NOTE: JSONB storage is no longer supported. Do not upgrade to this
+release if you still have subgraphs that were deployed with a version
+before 0.16. They need to be redeployed before updating to this version.**
+
+You can check if you have JSONB subgraphs by running the query `select count(*) from deployment_schemas where version='split'` in `psql`. If that
+query returns `0`, you do not have JSONB subgraphs and it is safe to upgrde
+to this version.
+
+### Feature: `_meta` field
+
+Subgraphs sometimes fall behind, be it due to failing or the Graph Node may be having issues. The
+`_meta` field can now be added to any query so that it is possible to determine against which block
+the query was effectively executed. Applications can use this to warn users if the data becomes
+stale. It is as simple as adding this to your query:
+
+```graphql
+_meta {
+  block {
+    number
+    hash
+  }
+}
+```
+
+### Feature: Non-fatal errors
+
+Indexing errors on already synced subgraphs no longer need to cause the entire subgraph to grind to
+a halt. Subgraphs can now be configured to continue syncing in the presence of errors, by simply
+skipping the problematic handler. This gives subgraph authors time to correct their subgraphs while the nodes can continue to serve up-to-date the data. This requires setting a flag on the subgraph manifest:
+
+```yaml
+features:
+  - nonFatalErrors
+```
+
+And the query must also opt-in to querying data with potential inconsistencies:
+
+```graphql
+foos(first: 100, subgraphError: allow) {
+  id
+}
+```
+
+If the subgraph encounters and error the query will return both the data and a graphql error with
+the message `indexing_error`.
+
+Note that some errors are still fatal, to be non-fatal the error must be known to be deterministic. The `_meta` field can be used to check if the subgraph has skipped over errors:
+
+```graphql
+_meta {
+  hasIndexingErrors
+}
+```
+
+The `features` section of the manifest requires depending on the graph-cli master branch until the next version (after `0.19.0`) is released.
+
+### Ethereum
+
+- Support for `tuple[]` (#1973).
+- Support multiple Ethereum endpoints per network with different capabilities (#1810).
+
+### Performance
+
+- Avoid cloning results assembled from partial results (#1907).
+
+### Security
+
+- Add `cargo-audit` to the build process, update dependencies (#1998).
+
+## 0.19.2
+
+- Add `GRAPH_ETH_CALL_BY_NUMBER` environment variable for disabling
+  EIP-1898 (#1957).
+- Disable `ipfs.cat` by default, as it is non-deterministic (#1958).
+
+## 0.19.1
+
+- Detect reorgs during query execution (#1801).
+- Annotate SQL queries with the GraphQL query ID that caused them (#1946).
+- Fix potential deadlock caused by reentering the load manager semaphore (#1948).
+- Fix fulltext query issue with optional and unset fields (#1937 via #1938).
+- Fix build warnings with --release (#1949 via #1953).
+- Dependency updates: async-trait, chrono, wasmparser.
+
+## 0.19.0
+
+- Skip `trace_filter` on empty blocks (#1923).
+- Ensure runtime hosts are unique to avoid double-counting, improve logging
+  (#1904).
+- Add administrative Postgres views (#1889).
+- Limit the GraphQL `skip` argument in the same way as we limit `first` (#1912).
+- Fix GraphQL fragment bugs (#1825).
+- Don't crash node and show better error when multiple graph nodes are indexing
+  the same subgraph (#1903).
+- Add a query semaphore to allow to control the number of concurrent queries and
+  subscription queries being executed (#1802).
+- Call Ethereum contracts by block hash (#1905).
+- Fix fetching the correct function ABI from the contract ABI (#1886).
+- Add LFU cache for historical queries (#1878, #1879, #1891).
+- Log GraphQL queries only once (#1873).
+- Gracefully fail on a null block hash and encoding failures in the Ethereum
+  adapter (#1872).
+- Improve metrics by using labels more (#1868, ...)
+- Log when decoding a contract call result fails to decode (#1842).
+- Fix Ethereum node requirements parsing based on the manifest (#1834).
+- Speed up queries that involve checking for inclusion in an array (#1820).
+- Add better error message when blocking a query due to load management (#1822).
+- Support multiple Ethereum nodes/endpoints per network, with different
+  capabilities (#1810).
+- Change how we index foreign keys (#1811).
+- Add an experimental Ethereum node config file (#1819).
+- Allow using GraphQL variables in block constraints (#1803).
+- Add Solidity struct array / Ethereum tuple array support (#1815).
+- Resolve subgraph names in a blocking task (#1797).
+- Add environmen variable options for sensitive arguments (#1784).
+- USe blocking task for store events (#1789).
+- Refactor servers, log GraphQL panics (#1783).
+- Remove excessive logging in the store (#1772).
+- Add dynamic load management for GraphQL queries (#1762, #1773, #1774).
+- Add ability to block certain queries (#1749, #1771).
+- Log the complexity of each query executed (#1752).
+- Add support for running against read-only Postgres replicas (#1746, #1748,
+  #1753, #1750, #1754, #1860).
+- Catch invalid opcode reverts on Geth (#1744).
+- Optimize queries for single-object lookups (#1734).
+- Increase the maximum number of blocking threads (#1742).
+- Increase default JSON-RPC timeout (#1732).
+- Ignore flaky network indexers tests (#1724).
+- Change default max block range size to 1000 (#1727).
+- Fixed aliased scalar fields (#1726).
+- Fix issue inserting fulltext fields when all included field values are null (#1710).
+- Remove frequent "GraphQL query served" log message (#1719).
+- Fix `bigDecimal.devidedBy` (#1715).
+- Optimize GraphQL execution, remove non-prefetch code (#1712, #1730, #1733,
+  #1743, #1775).
+- Add a query cache (#1708, #1709, #1747, #1751, #1777).
+- Support the new Geth revert format (#1713).
+- Switch WASM runtime from wasmi to wasmtime and cranelift (#1700).
+- Avoid adding `order by` clauses for single-object lookups (#1703).
+- Refactor chain head and store event listeners (#1693).
+- Properly escape single quotes in strings for SQL queries (#1695).
+- Revamp how Graph Node Docker image is built (#1644).
+- Add BRIN indexes to speed up revert handling (#1683).
+- Don't store chain head block in `SubgraphDeployment` entity (#1673).
+- Allow varying block constraints across different GraphQL query fields (#1685).
+- Handle database tables that have `text` columns where they should have enums (#1681).
+- Make contract call cache collision-free (#1680).
+- Fix a SQL query in `cleanup_cached_blocks` (#1672).
+- Exit process when panicking in the notification listener (#1671).
+- Rebase ethabi and web3 forks on top of upstream (#1662).
+- Remove parity-wasm dependency (#1663).
+- Normalize `BigDecimal` values, limit `BigDecimal` exponent (#1640).
+- Strip nulls from strings (#1656).
+- Fetch genesis block by number `0` instead of `"earliest"` (#1658).
+- Speed up GraphQL query execution (#1648).
+- Fetch event logs in parallel (#1646).
+- Cheaper block polling (#1646).
+- Improve indexing status API (#1609, #1655, #1659, #1718).
+- Log Postgres contention again (#1643).
+- Allow `User-Agent` in CORS headers (#1635).
+- Docker: Increase startup wait timeouts (Postgres, IPFS) to 120s (#1634).
+- Allow using `Bytes` for `id` fields (#1607).
+- Increase Postgres connection pool size (#1620).
+- Fix entities updated after being removed in the same block (#1632).
+- Pass `log_index` to mappings in place of `transaction_log_index` (required for
+  Geth).
+- Don't return `__typename` to mappings (#1629).
+- Log warnings after 10 successive failed `eth_call` requests. This makes
+  it more visible when graph-node is not operating against an Ethereum
+  archive node (#1606).
+- Improve use of async/await across the codebase.
+- Add Proof Of Indexing (POI).
+- Add first implementation of subgraph grafting.
+- Add integration test for handling Ganache reverts (#1590).
+- Log all GraphQL and SQL queries performed by a node, controlled through
+  the `GRAPH_LOG_QUERY_TIMING` [environment
+  variable](docs/environment-variables.md) (#1595).
+- Fix loading more than 200 dynamic data sources (#1596).
+- Fix fulltext schema validation (`includes` fields).
+- Dependency updates: anyhow, async-trait, bs58, blake3, bytes, chrono, clap,
+  crossbeam-channel derive_more, diesel-derive-enum, duct, ethabi,
+  git-testament, hex-literal, hyper, indexmap, jsonrpc-core, mockall, once_cell,
+  petgraph, reqwest, semver, serde, serde_json, slog-term, tokio, wasmparser.
+
+## 0.18.0
+
+**NOTE: JSONB storage is deprecated and will be removed in the next release.
+This only affects subgraphs that were deployed with a graph-node version
+before 0.16. Starting with this version, graph-node will print a warning for
+any subgraph that uses JSONB storage when that subgraph starts syncing. Please
+check your logs for this warning. You can remove the warning by redeploying
+the subgraph.**
+
+### Feature: Fulltext Search (#1521)
+
+A frequently requested feature has been support for more advanced text-based
+search, e.g. to power search fields in dApps. This release introduces a
+`@fulltext` directive on a new, reserved `_Schema_` type to define fulltext
+search APIs that can then be used in queries. The example below shows how
+such an API can be defined in the subgraph schema:
+
+```graphql
+type _Schema_
+  @fulltext(
+    name: "artistSearch"
+    language: en
+    algorithm: rank
+    include: [
+      {
+        entity: "Artist"
+        fields: [
+          { name: "name" }
+          { name: "bio" }
+          { name: "genre" }
+          { name: "promoCopy" }
+        ]
+      }
+    ]
+  )
+```
+
+This will add a special database column for `Artist` entities that can be
+used for fulltext search queries across all included entity fields, based on
+the `tsvector` and `tsquery` features provided by Postgres.
+
+The `@fulltext` directive will also add an `artistSearch` field on the root
+query object to the generated subgraph GraphQL API, which can be used as
+follows:
+
+```graphql
+{
+  artistSearch(text: "breaks & electro & detroit") {
+    id
+    name
+    bio
+  }
+}
+```
+
+For more information about the supported operators (like the `&` in the above
+query), please refer to the [Postgres
+documentation](https://www.postgresql.org/docs/10/textsearch.html).
+
+### Feature: 3Box Profiles (#1574)
+
+[3Box](https://3box.io) has become a popular solution for integrating user
+profiles into dApps. Starting with this release, it is possible to fetch profile
+data for Ethereum addresses and DIDs. Example usage:
+
+```ts
+import { box } from '@graphprotocol/graph-ts'
+
+let profile = box.profile("0xc8d807011058fcc0FB717dcd549b9ced09b53404")
+if (profile !== null) {
+  let name = profile.get("name")
+  ...
+}
+
+let profileFromDid = box.profile(
+  "id:3:bafyreia7db37k7epoc4qaifound6hk7swpwfkhudvdug4bgccjw6dh77ue"
+)
+...
+```
+
+### Feature: Arweave Transaction Data (#1574)
+
+This release enables accessing [Arweave](https://arweave.org) transaction data
+using Arweave transaction IDs:
+
+```ts
+import { arweave, json } from '@graphprotocol/graph-ts'
+
+let data = arweave.transactionData(
+  "W2czhcswOAe4TgL4Q8kHHqoZ1jbFBntUCrtamYX_rOU"
+)
+
+if (data !== null) {
+  let data = json.fromBytes(data)
+  ...
+}
+
+```
+
+### Feature: Data Source Context (#1404 via #1537)
+
+Data source contexts allow passing extra configuration when creating a data
+source from a template. As an example, let's say a subgraph tracks exchanges
+that are associated with a particular trading pair, which is included in the
+`NewExchange` event. That information can be passed into the dynamically
+created data source, like so:
+
+```ts
+import { DataSourceContext } from "@graphprotocol/graph-ts";
+import { Exchange } from "../generated/templates";
+
+export function handleNewExchange(event: NewExchange): void {
+  let context = new DataSourceContext();
+  context.setString("tradingPair", event.params.tradingPair);
+  Exchange.createWithContext(event.params.exchange, context);
+}
+```
+
+Inside a mapping of the Exchange template, the context can then be accessed
+as follows:
+
+```ts
+import { dataSource } from '@graphprotocol/graph-ts'
+
+...
+
+let context = dataSource.context()
+let tradingPair = context.getString('tradingPair')
+```
+
+There are setters and getters like `setString` and `getString` for all value
+types to make working with data source contexts convenient.
+
+### Feature: Error Handling for JSON Parsing (#1588 via #1578)
+
+With contracts anchoring JSON data on IPFS on chain, there is no guarantee
+that this data is actually valid JSON. Until now, failure to parse JSON in
+subgraph mappings would fail the subgraph. This release adds a new
+`json.try_fromBytes` host export that allows subgraph to gracefully handle
+JSON parsing errors.
+
+```ts
+import { json } from '@graphprotocol/graph-ts'
+
+export function handleSomeEvent(event: SomeEvent): void {
+  // JSON data as bytes, e.g. retrieved from IPFS
+  let data = ...
+
+  // This returns a `Result<JSONValue, boolean>`, meaning that the error type is
+  // just a boolean (true if there was an error, false if parsing succeeded).
+  // The actual error message is logged automatically.
+  let result = json.try_fromBytes(data)
+
+  if (result.isOk) { // or !result.isError
+    // Do something with the JSON value
+    let value = result.value
+    ...
+  } else {
+    // Handle the error
+    let error = result.error
+    ...
+  }
+}
+```
+
+### Ethereum
+
+- Add support for calling overloaded contract functions (#48 via #1440).
+- Add integration test for calling overloaded contract functions (#1441).
+- Avoid `eth_getLogs` requests with block ranges too large for Ethereum nodes
+  to handle (#1536).
+- Simplify `eth_getLogs` fetching logic to reduce the risk of being rate
+  limited by Ethereum nodes and the risk of overloading them (#1540).
+- Retry JSON-RPC responses with a `-32000` error (Alchemy uses this for
+  timeouts) (#1539).
+- Reduce block range size for `trace_filter` requests to prevent request
+  timeouts out (#1547).
+- Fix loading dynamically created data sources with `topic0` event handlers
+  from the database (#1580).
+- Fix handling contract call reverts in newer versions of Ganache (#1591).
+
+### IPFS
+
+- Add support for checking multiple IPFS nodes when fetching files (#1498).
+
+### GraphQL
+
+- Use correct network when resolving block numbers in time travel queries
+  (#1508).
+- Fix enum field validation in subgraph schemas (#1495).
+- Prevent WebSocket connections from hogging the blocking thread pool and
+  freezing the node (#1522).
+
+### Database
+
+- Switch subgraph metadata from JSONB to relational storage (#1394 via #1454,
+  #1457, #1459).
+- Clean up large notifications less frequently (#1505).
+- Add metric for Postgres connection errors (#1484).
+- Log SQL queries executed as part of the GraphQL API (#1465, #1466, #1468).
+- Log entities returned by SQL queries (#1503).
+- Fix several GraphQL prefetch / SQL query execution issues (#1523, #1524,
+  #1526).
+- Print deprecation warnings for JSONB subgraphs (#1527).
+- Make sure reorg handling does not affect metadata of other subgraphs (#1538).
+
+### Performance
+
+- Maintain an in-memory entity cache across blocks to speed up `store.get`
+  (#1381 via #1416).
+- Speed up revert handling by making use of cached blocks (#1449).
+- Speed up simple queries by delaying building JSON objects for results (#1476).
+- Resolve block numbers to hashes using cached blocks when possible (#1477).
+- Improve GraphQL prefetching performance by using lateral joins (#1450 via
+  #1483).
+- Vastly reduce memory consumption when indexing data sources created from
+  templates (#1494).
+
+### Misc
+
+- Default to IPFS 0.4.23 in the Docker Compose setup (#1592).
+- Support Elasticsearch endpoints without HTTP basic auth (#1576).
+- Fix `--version` not reporting the current version (#967 via #1567).
+- Convert more code to async/await and simplify async logic (#1558, #1560,
+  #1571).
+- Use lossy, more tolerant UTF-8 conversion when converting strings to bytes
+  (#1541).
+- Detect when a node is unresponsive and kill it (#1507).
+- Dump core when exiting because of a fatal error (#1512).
+- Update to futures 0.3 and tokio 0.2, enabling `async`/`await` (#1448).
+- Log block and full transaction hash when handlers fail (#1496).
+- Speed up network indexer tests (#1453).
+- Fix Travis to always install Node.js 11.x. (#1588).
+- Dependency updates: bytes, chrono, crossbeam-channel, ethabi, failure,
+  futures, hex, hyper, indexmap, jsonrpc-http-server, num-bigint,
+  priority-queue, reqwest, rust-web3, serde, serde_json, slog-async, slog-term,
+  tokio, tokio-tungstenite, walkdir, url.
diff --git a/README.md b/README.md
new file mode 100644
index 0000000..76cb9f6
--- /dev/null
+++ b/README.md
@@ -0,0 +1,199 @@
+# Graph Node
+
+[![Build Status](https://github.com/graphprotocol/graph-node/actions/workflows/ci.yml/badge.svg)](https://github.com/graphprotocol/graph-node/actions/workflows/ci.yml?query=branch%3Amaster)
+[![Getting Started Docs](https://img.shields.io/badge/docs-getting--started-brightgreen.svg)](docs/getting-started.md)
+
+[The Graph](https://thegraph.com/) is a protocol for building decentralized applications (dApps) quickly on Ethereum and IPFS using GraphQL.
+
+Graph Node is an open source Rust implementation that event sources the Ethereum blockchain to deterministically update a data store that can be queried via the GraphQL endpoint.
+
+For detailed instructions and more context, check out the [Getting Started Guide](docs/getting-started.md).
+
+## Quick Start
+
+### Prerequisites
+
+To build and run this project you need to have the following installed on your system:
+
+- Rust (latest stable) – [How to install Rust](https://www.rust-lang.org/en-US/install.html)
+  - Note that `rustfmt`, which is part of the default Rust installation, is a build-time requirement.
+- PostgreSQL – [PostgreSQL Downloads](https://www.postgresql.org/download/)
+- IPFS – [Installing IPFS](https://docs.ipfs.io/install/)
+
+For Ethereum network data, you can either run your own Ethereum node or use an Ethereum node provider of your choice.
+
+**Minimum Hardware Requirements:**
+
+- To build graph-node with `cargo`, 8GB RAM are required.
+
+### Running a Local Graph Node
+
+This is a quick example to show a working Graph Node. It is a [subgraph for Gravatars](https://github.com/graphprotocol/example-subgraph).
+
+1. Install IPFS and run `ipfs init` followed by `ipfs daemon`.
+2. Install PostgreSQL and run `initdb -D .postgres` followed by `pg_ctl -D .postgres -l logfile start` and `createdb graph-node`.
+3. If using Ubuntu, you may need to install additional packages:
+   - `sudo apt-get install -y clang libpq-dev libssl-dev pkg-config`
+4. In the terminal, clone https://github.com/graphprotocol/example-subgraph, and install dependencies and generate types for contract ABIs:
+
+```
+yarn
+yarn codegen
+```
+
+5. In the terminal, clone https://github.com/graphprotocol/graph-node, and run `cargo build`.
+
+Once you have all the dependencies set up, you can run the following:
+
+```
+cargo run -p graph-node --release -- \
+  --postgres-url postgresql://USERNAME[:PASSWORD]@localhost:5432/graph-node \
+  --ethereum-rpc NETWORK_NAME:[CAPABILITIES]:URL \
+  --ipfs 127.0.0.1:5001
+```
+
+Try your OS username as `USERNAME` and `PASSWORD`. For details on setting
+the connection string, check the [Postgres
+documentation](https://www.postgresql.org/docs/current/libpq-connect.html#LIBPQ-CONNSTRING).
+`graph-node` uses a few Postgres extensions. If the Postgres user with which
+you run `graph-node` is a superuser, `graph-node` will enable these
+extensions when it initalizes the database. If the Postgres user is not a
+superuser, you will need to create the extensions manually since only
+superusers are allowed to do that. To create them you need to connect as a
+superuser, which in many installations is the `postgres` user:
+
+```bash
+    psql -q -X -U <SUPERUSER> graph-node <<EOF
+create extension pg_trgm;
+create extension pg_stat_statements;
+create extension btree_gist;
+create extension postgres_fdw;
+grant usage on foreign data wrapper postgres_fdw to <USERNAME>;
+EOF
+
+```
+
+This will also spin up a GraphiQL interface at `http://127.0.0.1:8000/`.
+
+6.  With this Gravatar example, to get the subgraph working locally run:
+
+```
+yarn create-local
+```
+
+Then you can deploy the subgraph:
+
+```
+yarn deploy-local
+```
+
+This will build and deploy the subgraph to the Graph Node. It should start indexing the subgraph immediately.
+
+### Command-Line Interface
+
+```
+USAGE:
+    graph-node [FLAGS] [OPTIONS] --ethereum-ipc <NETWORK_NAME:FILE> --ethereum-rpc <NETWORK_NAME:URL> --ethereum-ws <NETWORK_NAME:URL> --ipfs <HOST:PORT> --postgres-url <URL>
+
+FLAGS:
+        --debug      Enable debug logging
+    -h, --help       Prints help information
+    -V, --version    Prints version information
+
+OPTIONS:
+        --admin-port <PORT>                           Port for the JSON-RPC admin server [default: 8020]
+        --elasticsearch-password <PASSWORD>
+            Password to use for Elasticsearch logging [env: ELASTICSEARCH_PASSWORD]
+
+        --elasticsearch-url <URL>
+            Elasticsearch service to write subgraph logs to [env: ELASTICSEARCH_URL=]
+
+        --elasticsearch-user <USER>                   User to use for Elasticsearch logging [env: ELASTICSEARCH_USER=]
+        --ethereum-ipc <NETWORK_NAME:[CAPABILITIES]:FILE>
+            Ethereum network name (e.g. 'mainnet'), optional comma-seperated capabilities (eg full,archive), and an Ethereum IPC pipe, separated by a ':'
+
+        --ethereum-polling-interval <MILLISECONDS>
+            How often to poll the Ethereum node for new blocks [env: ETHEREUM_POLLING_INTERVAL=]  [default: 500]
+
+        --ethereum-rpc <NETWORK_NAME:[CAPABILITIES]:URL>
+            Ethereum network name (e.g. 'mainnet'), optional comma-seperated capabilities (eg 'full,archive'), and an Ethereum RPC URL, separated by a ':'
+
+        --ethereum-ws <NETWORK_NAME:[CAPABILITIES]:URL>
+            Ethereum network name (e.g. 'mainnet'), optional comma-seperated capabilities (eg `full,archive), and an Ethereum WebSocket URL, separated by a ':'
+
+        --node-id <NODE_ID>
+            A unique identifier for this node instance. Should have the same value between consecutive node restarts [default: default]
+
+        --http-port <PORT>                            Port for the GraphQL HTTP server [default: 8000]
+        --ipfs <HOST:PORT>                            HTTP address of an IPFS node
+        --postgres-url <URL>                          Location of the Postgres database used for storing entities
+        --subgraph <[NAME:]IPFS_HASH>                 Name and IPFS hash of the subgraph manifest
+        --ws-port <PORT>                              Port for the GraphQL WebSocket server [default: 8001]
+```
+
+### Advanced Configuration
+
+The command line arguments generally are all that is needed to run a
+`graph-node` instance. For advanced uses, various aspects of `graph-node`
+can further be configured through [environment
+variables](https://github.com/graphprotocol/graph-node/blob/master/docs/environment-variables.md). Very
+large `graph-node` instances can also split the work of querying and
+indexing across [multiple databases](./docs/config.md).
+
+## Project Layout
+
+- `node` — A local Graph Node.
+- `graph` — A library providing traits for system components and types for
+  common data.
+- `core` — A library providing implementations for core components, used by all
+  nodes.
+- `chain/ethereum` — A library with components for obtaining data from
+  Ethereum.
+- `graphql` — A GraphQL implementation with API schema generation,
+  introspection, and more.
+- `mock` — A library providing mock implementations for all system components.
+- `runtime/wasm` — A library for running WASM data-extraction scripts.
+- `server/http` — A library providing a GraphQL server over HTTP.
+- `store/postgres` — A Postgres store with a GraphQL-friendly interface
+  and audit logs.
+
+## Roadmap
+
+🔨 = In Progress
+
+🛠 = Feature complete. Additional testing required.
+
+✅ = Feature complete
+
+
+| Feature |  Status |
+| ------- |  :------: |
+| **Ethereum** |    |
+| Indexing smart contract events | ✅ |
+| Handle chain reorganizations | ✅ |
+| **Mappings** |    |
+| WASM-based mappings| ✅ |
+| TypeScript-to-WASM toolchain | ✅ |
+| Autogenerated TypeScript types | ✅ |
+| **GraphQL** |     |
+| Query entities by ID | ✅ |
+| Query entity collections | ✅ |
+| Pagination | ✅ |
+| Filtering | ✅ |
+| Block-based Filtering | ✅ |
+| Entity relationships | ✅ |
+| Subscriptions | ✅ |
+
+
+## Contributing
+
+Please check [CONTRIBUTING.md](CONTRIBUTING.md) for development flow and conventions we use.
+Here's [a list of good first issues](https://github.com/graphprotocol/graph-node/labels/good%20first%20issue).
+
+## License
+
+Copyright &copy; 2018-2019 Graph Protocol, Inc. and contributors.
+
+The Graph is dual-licensed under the [MIT license](LICENSE-MIT) and the [Apache License, Version 2.0](LICENSE-APACHE).
+
+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 expressed or implied. See the License for the specific language governing permissions and limitations under the License.
diff --git a/chain/arweave/.gitignore b/chain/arweave/.gitignore
new file mode 100644
index 0000000..97442b5
--- /dev/null
+++ b/chain/arweave/.gitignore
@@ -0,0 +1 @@
+google.protobuf.rs
\ No newline at end of file
diff --git a/chain/arweave/Cargo.toml b/chain/arweave/Cargo.toml
new file mode 100644
index 0000000..5d94dd9
--- /dev/null
+++ b/chain/arweave/Cargo.toml
@@ -0,0 +1,21 @@
+[package]
+name = "graph-chain-arweave"
+version = "0.27.0"
+edition = "2021"
+
+[build-dependencies]
+tonic-build = { version = "0.7.1", features = ["prost"]}
+
+[dependencies]
+base64-url = "1.4.13"
+graph = { path = "../../graph" }
+prost = "0.10.1"
+prost-types = "0.10.1"
+serde = "1.0"
+sha2 = "0.10.5"
+
+graph-runtime-wasm = { path = "../../runtime/wasm" }
+graph-runtime-derive = { path = "../../runtime/derive" }
+
+[dev-dependencies]
+diesel = { version = "1.4.7", features = ["postgres", "serde_json", "numeric", "r2d2"] }
diff --git a/chain/arweave/build.rs b/chain/arweave/build.rs
new file mode 100644
index 0000000..e2ede2a
--- /dev/null
+++ b/chain/arweave/build.rs
@@ -0,0 +1,7 @@
+fn main() {
+    println!("cargo:rerun-if-changed=proto");
+    tonic_build::configure()
+        .out_dir("src/protobuf")
+        .compile(&["proto/type.proto"], &["proto"])
+        .expect("Failed to compile Firehose Arweave proto(s)");
+}
diff --git a/chain/arweave/proto/type.proto b/chain/arweave/proto/type.proto
new file mode 100644
index 0000000..b3a41a4
--- /dev/null
+++ b/chain/arweave/proto/type.proto
@@ -0,0 +1,108 @@
+syntax = "proto3";
+
+package sf.arweave.type.v1;
+
+option go_package = "github.com/ChainSafe/firehose-arweave/pb/sf/arweave/type/v1;pbcodec";
+
+message BigInt {
+  bytes bytes = 1;
+}
+
+message Block {
+  // Firehose block version (unrelated to Arweave block version)
+  uint32 ver = 1;
+  // The block identifier
+  bytes indep_hash = 2;
+  // The nonce chosen to solve the mining problem
+  bytes nonce = 3;
+  // `indep_hash` of the previous block in the weave
+  bytes previous_block = 4;
+  // POSIX time of block discovery
+  uint64 timestamp = 5;
+  // POSIX time of the last difficulty retarget
+  uint64 last_retarget = 6;
+  // Mining difficulty; the number `hash` must be greater than.
+  BigInt diff = 7;
+  // How many blocks have passed since the genesis block
+  uint64 height = 8;
+  // Mining solution hash of the block; must satisfy the mining difficulty
+  bytes hash = 9;
+  // Merkle root of the tree of Merkle roots of block's transactions' data.
+  bytes tx_root = 10;
+  // Transactions contained within this block
+  repeated Transaction txs = 11;
+  // The root hash of the Merkle Patricia Tree containing
+  // all wallet (account) balances and the identifiers
+  // of the last transactions posted by them; if any.
+  bytes wallet_list = 12;
+  // (string or) Address of the account to receive the block rewards. Can also be unclaimed which is encoded as a null byte
+  bytes reward_addr = 13;
+  // Tags that a block producer can add to a block
+  repeated Tag tags = 14;
+  // Size of reward pool
+  BigInt reward_pool = 15;
+  // Size of the weave in bytes
+  BigInt weave_size = 16;
+  // Size of this block in bytes
+  BigInt block_size = 17;
+  // Required after the version 1.8 fork. Zero otherwise.
+  // The sum of the average number of hashes computed
+  // by the network to produce the past blocks including this one.
+  BigInt cumulative_diff = 18;
+  // Required after the version 1.8 fork. Null byte otherwise.
+  // The Merkle root of the block index - the list of {`indep_hash`; `weave_size`; `tx_root`} triplets
+  bytes hash_list_merkle = 20;
+  // The proof of access; Used after v2.4 only; set as defaults otherwise
+  ProofOfAccess poa = 21;
+}
+
+// A succinct proof of access to a recall byte found in a TX
+message ProofOfAccess {
+  // The recall byte option chosen; global offset of index byte
+  string option = 1;
+  // The path through the Merkle tree of transactions' `data_root`s;
+  // from the `data_root` being proven to the corresponding `tx_root`
+  bytes tx_path = 2;
+  // The path through the Merkle tree of identifiers of chunks of the
+  // corresponding transaction; from the chunk being proven to the
+  // corresponding `data_root`.
+  bytes data_path = 3;
+  // The data chunk.
+  bytes chunk = 4;
+}
+
+message Transaction {
+  // 1 or 2 for v1 or v2 transactions. More allowable in the future
+  uint32 format = 1;
+  // The transaction identifier.
+  bytes id = 2; 	 
+  // Either the identifier of the previous transaction from the same
+  // wallet or the identifier of one of the last ?MAX_TX_ANCHOR_DEPTH blocks.
+  bytes last_tx = 3;   
+  // The public key the transaction is signed with.
+  bytes owner = 4;   
+  // A list of arbitrary key-value pairs
+  repeated Tag tags = 5; 	 
+  // The address of the recipient; if any. The SHA2-256 hash of the public key.
+  bytes target = 6;    
+  // The amount of Winstons to send to the recipient; if any.
+  BigInt quantity = 7;   
+  // The data to upload; if any. For v2 transactions; the field is optional
+  // - a fee is charged based on the `data_size` field;
+  //   data may be uploaded any time later in chunks.
+  bytes data = 8;       	 
+  // Size in bytes of the transaction data.
+  BigInt data_size = 9;
+  // The Merkle root of the Merkle tree of data chunks.
+  bytes data_root = 10;
+  // The signature.
+  bytes signature = 11;
+  // The fee in Winstons.
+  BigInt reward = 12;
+}
+
+
+message Tag {
+  bytes name = 1;
+  bytes value = 2;
+}
diff --git a/chain/arweave/src/adapter.rs b/chain/arweave/src/adapter.rs
new file mode 100644
index 0000000..70e5084
--- /dev/null
+++ b/chain/arweave/src/adapter.rs
@@ -0,0 +1,261 @@
+use crate::capabilities::NodeCapabilities;
+use crate::{data_source::DataSource, Chain};
+use graph::blockchain as bc;
+use graph::prelude::*;
+use sha2::{Digest, Sha256};
+use std::collections::HashSet;
+
+const MATCH_ALL_WILDCARD: &str = "";
+// Size of sha256(pubkey)
+const SHA256_LEN: usize = 32;
+
+#[derive(Clone, Debug, Default)]
+pub struct TriggerFilter {
+    pub(crate) block_filter: ArweaveBlockFilter,
+    pub(crate) transaction_filter: ArweaveTransactionFilter,
+}
+
+impl bc::TriggerFilter<Chain> for TriggerFilter {
+    fn extend<'a>(&mut self, data_sources: impl Iterator<Item = &'a DataSource> + Clone) {
+        let TriggerFilter {
+            block_filter,
+            transaction_filter,
+        } = self;
+
+        block_filter.extend(ArweaveBlockFilter::from_data_sources(data_sources.clone()));
+        transaction_filter.extend(ArweaveTransactionFilter::from_data_sources(data_sources));
+    }
+
+    fn node_capabilities(&self) -> NodeCapabilities {
+        NodeCapabilities {}
+    }
+
+    fn extend_with_template(
+        &mut self,
+        _data_source: impl Iterator<Item = <Chain as bc::Blockchain>::DataSourceTemplate>,
+    ) {
+    }
+
+    fn to_firehose_filter(self) -> Vec<prost_types::Any> {
+        vec![]
+    }
+}
+
+/// ArweaveBlockFilter will match every block regardless of source being set.
+/// see docs: https://thegraph.com/docs/en/supported-networks/arweave/
+#[derive(Clone, Debug, Default)]
+pub(crate) struct ArweaveTransactionFilter {
+    owners_pubkey: HashSet<Vec<u8>>,
+    owners_sha: HashSet<Vec<u8>>,
+    match_all: bool,
+}
+
+impl ArweaveTransactionFilter {
+    pub fn matches(&self, owner: &[u8]) -> bool {
+        if self.match_all {
+            return true;
+        }
+
+        if owner.len() == SHA256_LEN {
+            return self.owners_sha.contains(owner);
+        }
+
+        self.owners_pubkey.contains(owner) || self.owners_sha.contains(&sha256(owner))
+    }
+
+    pub fn from_data_sources<'a>(iter: impl IntoIterator<Item = &'a DataSource>) -> Self {
+        let owners: Vec<Vec<u8>> = iter
+            .into_iter()
+            .filter(|data_source| {
+                data_source.source.owner.is_some()
+                    && !data_source.mapping.transaction_handlers.is_empty()
+            })
+            .map(|ds| match &ds.source.owner {
+                Some(str) if MATCH_ALL_WILDCARD.eq(str) => MATCH_ALL_WILDCARD.as_bytes().to_owned(),
+                owner @ _ => {
+                    base64_url::decode(&owner.clone().unwrap_or_default()).unwrap_or_default()
+                }
+            })
+            .collect();
+
+        let (owners_sha, long) = owners
+            .into_iter()
+            .partition::<Vec<Vec<u8>>, _>(|owner| owner.len() == SHA256_LEN);
+
+        let (owners_pubkey, wildcard) = long
+            .into_iter()
+            .partition::<Vec<Vec<u8>>, _>(|long| long.len() != MATCH_ALL_WILDCARD.len());
+
+        let match_all = wildcard.len() != 0;
+
+        let owners_sha: Vec<Vec<u8>> = owners_sha
+            .into_iter()
+            .chain::<Vec<Vec<u8>>>(owners_pubkey.iter().map(|long| sha256(&long)).collect())
+            .collect();
+
+        Self {
+            match_all,
+            owners_pubkey: HashSet::from_iter(owners_pubkey),
+            owners_sha: HashSet::from_iter(owners_sha),
+        }
+    }
+
+    pub fn extend(&mut self, other: ArweaveTransactionFilter) {
+        let ArweaveTransactionFilter {
+            owners_pubkey,
+            owners_sha,
+            match_all,
+        } = self;
+
+        owners_pubkey.extend(other.owners_pubkey);
+        owners_sha.extend(other.owners_sha);
+        *match_all = *match_all || other.match_all;
+    }
+}
+
+/// ArweaveBlockFilter will match every block regardless of source being set.
+/// see docs: https://thegraph.com/docs/en/supported-networks/arweave/
+#[derive(Clone, Debug, Default)]
+pub(crate) struct ArweaveBlockFilter {
+    pub trigger_every_block: bool,
+}
+
+impl ArweaveBlockFilter {
+    pub fn from_data_sources<'a>(iter: impl IntoIterator<Item = &'a DataSource>) -> Self {
+        Self {
+            trigger_every_block: iter
+                .into_iter()
+                .any(|data_source| !data_source.mapping.block_handlers.is_empty()),
+        }
+    }
+
+    pub fn extend(&mut self, other: ArweaveBlockFilter) {
+        self.trigger_every_block = self.trigger_every_block || other.trigger_every_block;
+    }
+}
+
+fn sha256(bs: &[u8]) -> Vec<u8> {
+    let mut hasher = Sha256::new();
+    hasher.update(bs);
+    let res = hasher.finalize();
+    res.to_vec()
+}
+
+#[cfg(test)]
+mod test {
+    use std::sync::Arc;
+
+    use graph::{prelude::Link, semver::Version};
+
+    use crate::data_source::{DataSource, Mapping, Source, TransactionHandler};
+
+    use super::{ArweaveTransactionFilter, MATCH_ALL_WILDCARD};
+
+    const ARWEAVE_PUBKEY_EXAMPLE: &str = "x-62w7g2yKACOgP_d04bhG8IX-AWgPrxHl2JgZBDdNLfAsidiiAaoIZPeM8K5gGvl7-8QVk79YV4OC878Ey0gXi7Atj5BouRyXnFMjJcPVXVyBoYCBuG7rJDDmh4_Ilon6vVOuHVIZ47Vb0tcgsxgxdvVFC2mn9N_SBl23pbeICNJZYOH57kf36gicuV_IwYSdqlQ0HQ_psjmg8EFqO7xzvAMP5HKW3rqTrYZxbCew2FkM734ysWckT39TpDBPx3HrFOl6obUdQWkHNOeKyzcsKFDywNgVWZOb89CYU7JFYlwX20io39ZZv0UJUOEFNjtVHkT_s0_A2O9PltsrZLLlQXZUuYASdbAPD2g_qXfhmPBZ0SXPWCDY-UVwVN1ncwYmk1F_i35IA8kAKsajaltD2wWDQn9g5mgJAWWn2xhLqkbwGbdwQMRD0-0eeuy1uzCooJQCC_bPJksoqkYwB9SGOjkayf4r4oZ2QDY4FicCsswz4Od_gud30ZWyHjWgqGzSFYFzawDBS1Gr_nu_q5otFrv20ZGTxYqGsLHWq4VHs6KjsQvzgBjfyb0etqHQEPJJmbQmY3LSogR4bxdReUHhj2EK9xIB-RKzDvDdL7fT5K0V9MjbnC2uktA0VjLlvwJ64_RhbQhxdp_zR39r-zyCXT-brPEYW1-V7Ey9K3XUE";
+    const ARWEAVE_SHA_EXAMPLE: &str = "ahLxjCMCHr1ZE72VDDoaK4IKiLUUpeuo8t-M6y23DXw";
+
+    #[test]
+    fn transaction_filter_wildcard_matches_all() {
+        let dss = vec![
+            new_datasource(None, 10),
+            new_datasource(Some(base64_url::encode(MATCH_ALL_WILDCARD.into())), 10),
+            new_datasource(Some(base64_url::encode("owner").into()), 10),
+            new_datasource(Some(ARWEAVE_PUBKEY_EXAMPLE.into()), 10),
+        ];
+
+        let dss: Vec<&DataSource> = dss.iter().collect();
+
+        let filter = ArweaveTransactionFilter::from_data_sources(dss);
+        assert_eq!(true, filter.matches("asdas".as_bytes()))
+    }
+
+    #[test]
+    fn transaction_filter_match() {
+        let dss = vec![
+            new_datasource(None, 10),
+            new_datasource(Some(ARWEAVE_PUBKEY_EXAMPLE.into()), 10),
+        ];
+
+        let dss: Vec<&DataSource> = dss.iter().collect();
+
+        let filter = ArweaveTransactionFilter::from_data_sources(dss);
+        assert_eq!(false, filter.matches("asdas".as_bytes()));
+        assert_eq!(
+            true,
+            filter.matches(
+                &base64_url::decode(ARWEAVE_SHA_EXAMPLE).expect("failed to parse sha example")
+            )
+        );
+        assert_eq!(
+            true,
+            filter.matches(
+                &base64_url::decode(ARWEAVE_PUBKEY_EXAMPLE).expect("failed to parse PK example")
+            )
+        )
+    }
+
+    #[test]
+    fn transaction_filter_extend_match() {
+        let dss = vec![
+            new_datasource(None, 10),
+            new_datasource(Some(ARWEAVE_SHA_EXAMPLE.into()), 10),
+        ];
+
+        let dss: Vec<&DataSource> = dss.iter().collect();
+
+        let filter = ArweaveTransactionFilter::from_data_sources(dss);
+        assert_eq!(false, filter.matches("asdas".as_bytes()));
+        assert_eq!(
+            true,
+            filter.matches(
+                &base64_url::decode(ARWEAVE_SHA_EXAMPLE).expect("failed to parse sha example")
+            )
+        );
+        assert_eq!(
+            true,
+            filter.matches(
+                &base64_url::decode(ARWEAVE_PUBKEY_EXAMPLE).expect("failed to parse PK example")
+            )
+        )
+    }
+
+    #[test]
+    fn transaction_filter_extend_wildcard_matches_all() {
+        let dss = vec![
+            new_datasource(None, 10),
+            new_datasource(Some(MATCH_ALL_WILDCARD.into()), 10),
+            new_datasource(Some("owner".into()), 10),
+        ];
+
+        let dss: Vec<&DataSource> = dss.iter().collect();
+
+        let mut filter = ArweaveTransactionFilter::default();
+
+        filter.extend(ArweaveTransactionFilter::from_data_sources(dss));
+        assert_eq!(true, filter.matches("asdas".as_bytes()));
+        assert_eq!(true, filter.matches(ARWEAVE_PUBKEY_EXAMPLE.as_bytes()));
+        assert_eq!(true, filter.matches(ARWEAVE_SHA_EXAMPLE.as_bytes()))
+    }
+
+    fn new_datasource(owner: Option<String>, start_block: i32) -> DataSource {
+        DataSource {
+            kind: "".into(),
+            network: None,
+            name: "".into(),
+            source: Source { owner, start_block },
+            mapping: Mapping {
+                api_version: Version::new(1, 2, 3),
+                language: "".into(),
+                entities: vec![],
+                block_handlers: vec![],
+                transaction_handlers: vec![TransactionHandler {
+                    handler: "my_handler".into(),
+                }],
+                runtime: Arc::new(vec![]),
+                link: Link { link: "".into() },
+            },
+            context: Arc::new(None),
+            creation_block: None,
+        }
+    }
+}
diff --git a/chain/arweave/src/capabilities.rs b/chain/arweave/src/capabilities.rs
new file mode 100644
index 0000000..27c7622
--- /dev/null
+++ b/chain/arweave/src/capabilities.rs
@@ -0,0 +1,37 @@
+use graph::{anyhow::Error, impl_slog_value};
+use std::cmp::{Ordering, PartialOrd};
+use std::fmt;
+use std::str::FromStr;
+
+use crate::data_source::DataSource;
+
+#[derive(Clone, Copy, Debug, PartialEq, Eq)]
+pub struct NodeCapabilities {}
+
+impl PartialOrd for NodeCapabilities {
+    fn partial_cmp(&self, _other: &Self) -> Option<Ordering> {
+        None
+    }
+}
+
+impl FromStr for NodeCapabilities {
+    type Err = Error;
+
+    fn from_str(_s: &str) -> Result<Self, Self::Err> {
+        Ok(NodeCapabilities {})
+    }
+}
+
+impl fmt::Display for NodeCapabilities {
+    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
+        f.write_str("arweave")
+    }
+}
+
+impl_slog_value!(NodeCapabilities, "{}");
+
+impl graph::blockchain::NodeCapabilities<crate::Chain> for NodeCapabilities {
+    fn from_data_sources(_data_sources: &[DataSource]) -> Self {
+        NodeCapabilities {}
+    }
+}
diff --git a/chain/arweave/src/chain.rs b/chain/arweave/src/chain.rs
new file mode 100644
index 0000000..14e52c1
--- /dev/null
+++ b/chain/arweave/src/chain.rs
@@ -0,0 +1,334 @@
+use graph::blockchain::{Block, BlockchainKind};
+use graph::cheap_clone::CheapClone;
+use graph::data::subgraph::UnifiedMappingApiVersion;
+use graph::firehose::{FirehoseEndpoint, FirehoseEndpoints};
+use graph::prelude::{MetricsRegistry, TryFutureExt};
+use graph::{
+    anyhow,
+    blockchain::{
+        block_stream::{
+            BlockStreamEvent, BlockWithTriggers, FirehoseError,
+            FirehoseMapper as FirehoseMapperTrait, TriggersAdapter as TriggersAdapterTrait,
+        },
+        firehose_block_stream::FirehoseBlockStream,
+        BlockHash, BlockPtr, Blockchain, IngestorError, RuntimeAdapter as RuntimeAdapterTrait,
+    },
+    components::store::DeploymentLocator,
+    firehose::{self as firehose, ForkStep},
+    prelude::{async_trait, o, BlockNumber, ChainStore, Error, Logger, LoggerFactory},
+};
+use prost::Message;
+use std::sync::Arc;
+
+use crate::adapter::TriggerFilter;
+use crate::capabilities::NodeCapabilities;
+use crate::data_source::{DataSourceTemplate, UnresolvedDataSourceTemplate};
+use crate::runtime::RuntimeAdapter;
+use crate::trigger::{self, ArweaveTrigger};
+use crate::{
+    codec,
+    data_source::{DataSource, UnresolvedDataSource},
+};
+use graph::blockchain::block_stream::{BlockStream, FirehoseCursor};
+
+pub struct Chain {
+    logger_factory: LoggerFactory,
+    name: String,
+    firehose_endpoints: Arc<FirehoseEndpoints>,
+    chain_store: Arc<dyn ChainStore>,
+    metrics_registry: Arc<dyn MetricsRegistry>,
+}
+
+impl std::fmt::Debug for Chain {
+    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
+        write!(f, "chain: arweave")
+    }
+}
+
+impl Chain {
+    pub fn new(
+        logger_factory: LoggerFactory,
+        name: String,
+        chain_store: Arc<dyn ChainStore>,
+        firehose_endpoints: FirehoseEndpoints,
+        metrics_registry: Arc<dyn MetricsRegistry>,
+    ) -> Self {
+        Chain {
+            logger_factory,
+            name,
+            firehose_endpoints: Arc::new(firehose_endpoints),
+            chain_store,
+            metrics_registry,
+        }
+    }
+}
+
+#[async_trait]
+impl Blockchain for Chain {
+    const KIND: BlockchainKind = BlockchainKind::Arweave;
+
+    type Block = codec::Block;
+
+    type DataSource = DataSource;
+
+    type UnresolvedDataSource = UnresolvedDataSource;
+
+    type DataSourceTemplate = DataSourceTemplate;
+
+    type UnresolvedDataSourceTemplate = UnresolvedDataSourceTemplate;
+
+    type TriggerData = crate::trigger::ArweaveTrigger;
+
+    type MappingTrigger = crate::trigger::ArweaveTrigger;
+
+    type TriggerFilter = crate::adapter::TriggerFilter;
+
+    type NodeCapabilities = crate::capabilities::NodeCapabilities;
+
+    fn triggers_adapter(
+        &self,
+        _loc: &DeploymentLocator,
+        _capabilities: &Self::NodeCapabilities,
+        _unified_api_version: UnifiedMappingApiVersion,
+    ) -> Result<Arc<dyn TriggersAdapterTrait<Self>>, Error> {
+        let adapter = TriggersAdapter {};
+        Ok(Arc::new(adapter))
+    }
+
+    async fn new_firehose_block_stream(
+        &self,
+        deployment: DeploymentLocator,
+        block_cursor: FirehoseCursor,
+        start_blocks: Vec<BlockNumber>,
+        subgraph_current_block: Option<BlockPtr>,
+        filter: Arc<Self::TriggerFilter>,
+        unified_api_version: UnifiedMappingApiVersion,
+    ) -> Result<Box<dyn BlockStream<Self>>, Error> {
+        let adapter = self
+            .triggers_adapter(&deployment, &NodeCapabilities {}, unified_api_version)
+            .expect(&format!("no adapter for network {}", self.name,));
+
+        let firehose_endpoint = match self.firehose_endpoints.random() {
+            Some(e) => e.clone(),
+            None => return Err(anyhow::format_err!("no firehose endpoint available")),
+        };
+
+        let logger = self
+            .logger_factory
+            .subgraph_logger(&deployment)
+            .new(o!("component" => "FirehoseBlockStream"));
+
+        let firehose_mapper = Arc::new(FirehoseMapper {
+            endpoint: firehose_endpoint.cheap_clone(),
+        });
+
+        Ok(Box::new(FirehoseBlockStream::new(
+            deployment.hash,
+            firehose_endpoint,
+            subgraph_current_block,
+            block_cursor,
+            firehose_mapper,
+            adapter,
+            filter,
+            start_blocks,
+            logger,
+            self.metrics_registry.clone(),
+        )))
+    }
+
+    async fn new_polling_block_stream(
+        &self,
+        _deployment: DeploymentLocator,
+        _start_blocks: Vec<BlockNumber>,
+        _subgraph_current_block: Option<BlockPtr>,
+        _filter: Arc<Self::TriggerFilter>,
+        _unified_api_version: UnifiedMappingApiVersion,
+    ) -> Result<Box<dyn BlockStream<Self>>, Error> {
+        panic!("Arweave does not support polling block stream")
+    }
+
+    fn chain_store(&self) -> Arc<dyn ChainStore> {
+        self.chain_store.clone()
+    }
+
+    async fn block_pointer_from_number(
+        &self,
+        logger: &Logger,
+        number: BlockNumber,
+    ) -> Result<BlockPtr, IngestorError> {
+        let firehose_endpoint = match self.firehose_endpoints.random() {
+            Some(e) => e.clone(),
+            None => return Err(anyhow::format_err!("no firehose endpoint available").into()),
+        };
+
+        firehose_endpoint
+            .block_ptr_for_number::<codec::Block>(logger, number)
+            .map_err(Into::into)
+            .await
+    }
+
+    fn runtime_adapter(&self) -> Arc<dyn RuntimeAdapterTrait<Self>> {
+        Arc::new(RuntimeAdapter {})
+    }
+
+    fn is_firehose_supported(&self) -> bool {
+        true
+    }
+}
+
+pub struct TriggersAdapter {}
+
+#[async_trait]
+impl TriggersAdapterTrait<Chain> for TriggersAdapter {
+    async fn scan_triggers(
+        &self,
+        _from: BlockNumber,
+        _to: BlockNumber,
+        _filter: &TriggerFilter,
+    ) -> Result<Vec<BlockWithTriggers<Chain>>, Error> {
+        panic!("Should never be called since not used by FirehoseBlockStream")
+    }
+
+    async fn triggers_in_block(
+        &self,
+        _logger: &Logger,
+        block: codec::Block,
+        filter: &TriggerFilter,
+    ) -> Result<BlockWithTriggers<Chain>, Error> {
+        // TODO: Find the best place to introduce an `Arc` and avoid this clone.
+        let shared_block = Arc::new(block.clone());
+
+        let TriggerFilter {
+            block_filter,
+            transaction_filter,
+        } = filter;
+
+        let txs = block
+            .clone()
+            .txs
+            .into_iter()
+            .filter(|tx| transaction_filter.matches(&tx.owner))
+            .map(|tx| trigger::TransactionWithBlockPtr {
+                tx: Arc::new(tx.clone()),
+                block: shared_block.clone(),
+            })
+            .collect::<Vec<_>>();
+
+        let mut trigger_data: Vec<_> = txs
+            .into_iter()
+            .map(|tx| ArweaveTrigger::Transaction(Arc::new(tx)))
+            .collect();
+
+        if block_filter.trigger_every_block {
+            trigger_data.push(ArweaveTrigger::Block(shared_block.cheap_clone()));
+        }
+
+        Ok(BlockWithTriggers::new(block, trigger_data))
+    }
+
+    async fn is_on_main_chain(&self, _ptr: BlockPtr) -> Result<bool, Error> {
+        panic!("Should never be called since not used by FirehoseBlockStream")
+    }
+
+    async fn ancestor_block(
+        &self,
+        _ptr: BlockPtr,
+        _offset: BlockNumber,
+    ) -> Result<Option<codec::Block>, Error> {
+        panic!("Should never be called since FirehoseBlockStream cannot resolve it")
+    }
+
+    /// Panics if `block` is genesis.
+    /// But that's ok since this is only called when reverting `block`.
+    async fn parent_ptr(&self, block: &BlockPtr) -> Result<Option<BlockPtr>, Error> {
+        // FIXME (Arweave):  Might not be necessary for Arweave support for now
+        Ok(Some(BlockPtr {
+            hash: BlockHash::from(vec![0xff; 48]),
+            number: block.number.saturating_sub(1),
+        }))
+    }
+}
+
+pub struct FirehoseMapper {
+    endpoint: Arc<FirehoseEndpoint>,
+}
+
+#[async_trait]
+impl FirehoseMapperTrait<Chain> for FirehoseMapper {
+    async fn to_block_stream_event(
+        &self,
+        logger: &Logger,
+        response: &firehose::Response,
+        adapter: &Arc<dyn TriggersAdapterTrait<Chain>>,
+        filter: &TriggerFilter,
+    ) -> Result<BlockStreamEvent<Chain>, FirehoseError> {
+        let step = ForkStep::from_i32(response.step).unwrap_or_else(|| {
+            panic!(
+                "unknown step i32 value {}, maybe you forgot update & re-regenerate the protobuf definitions?",
+                response.step
+            )
+        });
+
+        let any_block = response
+            .block
+            .as_ref()
+            .expect("block payload information should always be present");
+
+        // Right now, this is done in all cases but in reality, with how the BlockStreamEvent::Revert
+        // is defined right now, only block hash and block number is necessary. However, this information
+        // is not part of the actual bstream::BlockResponseV2 payload. As such, we need to decode the full
+        // block which is useless.
+        //
+        // Check about adding basic information about the block in the bstream::BlockResponseV2 or maybe
+        // define a slimmed down stuct that would decode only a few fields and ignore all the rest.
+        let block = codec::Block::decode(any_block.value.as_ref())?;
+
+        use ForkStep::*;
+        match step {
+            StepNew => Ok(BlockStreamEvent::ProcessBlock(
+                adapter.triggers_in_block(logger, block, filter).await?,
+                FirehoseCursor::from(response.cursor.clone()),
+            )),
+
+            StepUndo => {
+                let parent_ptr = block
+                    .parent_ptr()
+                    .expect("Genesis block should never be reverted");
+
+                Ok(BlockStreamEvent::Revert(
+                    parent_ptr,
+                    FirehoseCursor::from(response.cursor.clone()),
+                ))
+            }
+
+            StepIrreversible => {
+                panic!("irreversible step is not handled and should not be requested in the Firehose request")
+            }
+
+            StepUnknown => {
+                panic!("unknown step should not happen in the Firehose response")
+            }
+        }
+    }
+
+    async fn block_ptr_for_number(
+        &self,
+        logger: &Logger,
+        number: BlockNumber,
+    ) -> Result<BlockPtr, Error> {
+        self.endpoint
+            .block_ptr_for_number::<codec::Block>(logger, number)
+            .await
+    }
+
+    // # FIXME
+    //
+    // the final block of arweave is itself in the current implementation
+    async fn final_block_ptr_for(
+        &self,
+        _logger: &Logger,
+        block: &codec::Block,
+    ) -> Result<BlockPtr, Error> {
+        Ok(block.ptr())
+    }
+}
diff --git a/chain/arweave/src/codec.rs b/chain/arweave/src/codec.rs
new file mode 100644
index 0000000..09da7fe
--- /dev/null
+++ b/chain/arweave/src/codec.rs
@@ -0,0 +1,37 @@
+#[rustfmt::skip]
+#[path = "protobuf/sf.arweave.r#type.v1.rs"]
+mod pbcodec;
+
+use graph::{blockchain::Block as BlockchainBlock, blockchain::BlockPtr, prelude::BlockNumber};
+
+pub use pbcodec::*;
+
+impl BlockchainBlock for Block {
+    fn number(&self) -> i32 {
+        BlockNumber::try_from(self.height).unwrap()
+    }
+
+    fn ptr(&self) -> BlockPtr {
+        BlockPtr {
+            hash: self.indep_hash.clone().into(),
+            number: self.number(),
+        }
+    }
+
+    fn parent_ptr(&self) -> Option<BlockPtr> {
+        if self.height == 0 {
+            return None;
+        }
+
+        Some(BlockPtr {
+            hash: self.previous_block.clone().into(),
+            number: self.number().saturating_sub(1),
+        })
+    }
+}
+
+impl AsRef<[u8]> for BigInt {
+    fn as_ref(&self) -> &[u8] {
+        self.bytes.as_ref()
+    }
+}
diff --git a/chain/arweave/src/data_source.rs b/chain/arweave/src/data_source.rs
new file mode 100644
index 0000000..d378174
--- /dev/null
+++ b/chain/arweave/src/data_source.rs
@@ -0,0 +1,376 @@
+use graph::blockchain::{Block, TriggerWithHandler};
+use graph::components::store::StoredDynamicDataSource;
+use graph::data::subgraph::DataSourceContext;
+use graph::prelude::SubgraphManifestValidationError;
+use graph::{
+    anyhow::{anyhow, Error},
+    blockchain::{self, Blockchain},
+    prelude::{
+        async_trait, info, BlockNumber, CheapClone, DataSourceTemplateInfo, Deserialize, Link,
+        LinkResolver, Logger,
+    },
+    semver,
+};
+use std::{convert::TryFrom, sync::Arc};
+
+use crate::chain::Chain;
+use crate::trigger::ArweaveTrigger;
+
+pub const ARWEAVE_KIND: &str = "arweave";
+
+/// Runtime representation of a data source.
+#[derive(Clone, Debug)]
+pub struct DataSource {
+    pub kind: String,
+    pub network: Option<String>,
+    pub name: String,
+    pub(crate) source: Source,
+    pub mapping: Mapping,
+    pub context: Arc<Option<DataSourceContext>>,
+    pub creation_block: Option<BlockNumber>,
+}
+
+impl blockchain::DataSource<Chain> for DataSource {
+    // FIXME
+    //
+    // need to decode the base64url encoding?
+    fn address(&self) -> Option<&[u8]> {
+        self.source.owner.as_ref().map(String::as_bytes)
+    }
+
+    fn start_block(&self) -> BlockNumber {
+        self.source.start_block
+    }
+
+    fn match_and_decode(
+        &self,
+        trigger: &<Chain as Blockchain>::TriggerData,
+        block: &Arc<<Chain as Blockchain>::Block>,
+        _logger: &Logger,
+    ) -> Result<Option<TriggerWithHandler<Chain>>, Error> {
+        if self.source.start_block > block.number() {
+            return Ok(None);
+        }
+
+        let handler = match trigger {
+            // A block trigger matches if a block handler is present.
+            ArweaveTrigger::Block(_) => match self.handler_for_block() {
+                Some(handler) => &handler.handler,
+                None => return Ok(None),
+            },
+            // A transaction trigger matches if a transaction handler is present.
+            ArweaveTrigger::Transaction(_) => match self.handler_for_transaction() {
+                Some(handler) => &handler.handler,
+                None => return Ok(None),
+            },
+        };
+
+        Ok(Some(TriggerWithHandler::<Chain>::new(
+            trigger.cheap_clone(),
+            handler.to_owned(),
+            block.ptr(),
+        )))
+    }
+
+    fn name(&self) -> &str {
+        &self.name
+    }
+
+    fn kind(&self) -> &str {
+        &self.kind
+    }
+
+    fn network(&self) -> Option<&str> {
+        self.network.as_ref().map(|s| s.as_str())
+    }
+
+    fn context(&self) -> Arc<Option<DataSourceContext>> {
+        self.context.cheap_clone()
+    }
+
+    fn creation_block(&self) -> Option<BlockNumber> {
+        self.creation_block
+    }
+
+    fn is_duplicate_of(&self, other: &Self) -> bool {
+        let DataSource {
+            kind,
+            network,
+            name,
+            source,
+            mapping,
+            context,
+
+            // The creation block is ignored for detection duplicate data sources.
+            // Contract ABI equality is implicit in `source` and `mapping.abis` equality.
+            creation_block: _,
+        } = self;
+
+        // mapping_request_sender, host_metrics, and (most of) host_exports are operational structs
+        // used at runtime but not needed to define uniqueness; each runtime host should be for a
+        // unique data source.
+        kind == &other.kind
+            && network == &other.network
+            && name == &other.name
+            && source == &other.source
+            && mapping.block_handlers == other.mapping.block_handlers
+            && context == &other.context
+    }
+
+    fn as_stored_dynamic_data_source(&self) -> StoredDynamicDataSource {
+        // FIXME (Arweave): Implement me!
+        todo!()
+    }
+
+    fn from_stored_dynamic_data_source(
+        _template: &DataSourceTemplate,
+        _stored: StoredDynamicDataSource,
+    ) -> Result<Self, Error> {
+        // FIXME (Arweave): Implement me correctly
+        todo!()
+    }
+
+    fn validate(&self) -> Vec<Error> {
+        let mut errors = Vec::new();
+
+        if self.kind != ARWEAVE_KIND {
+            errors.push(anyhow!(
+                "data source has invalid `kind`, expected {} but found {}",
+                ARWEAVE_KIND,
+                self.kind
+            ))
+        }
+
+        // Validate that there is a `source` address if there are transaction handlers
+        let no_source_address = self.address().is_none();
+        let has_transaction_handlers = !self.mapping.transaction_handlers.is_empty();
+        if no_source_address && has_transaction_handlers {
+            errors.push(SubgraphManifestValidationError::SourceAddressRequired.into());
+        };
+
+        // Validate that there are no more than one of both block handlers and transaction handlers
+        if self.mapping.block_handlers.len() > 1 {
+            errors.push(anyhow!("data source has duplicated block handlers"));
+        }
+        if self.mapping.transaction_handlers.len() > 1 {
+            errors.push(anyhow!("data source has duplicated transaction handlers"));
+        }
+
+        errors
+    }
+
+    fn api_version(&self) -> semver::Version {
+        self.mapping.api_version.clone()
+    }
+
+    fn runtime(&self) -> Option<Arc<Vec<u8>>> {
+        Some(self.mapping.runtime.cheap_clone())
+    }
+}
+
+impl DataSource {
+    fn from_manifest(
+        kind: String,
+        network: Option<String>,
+        name: String,
+        source: Source,
+        mapping: Mapping,
+        context: Option<DataSourceContext>,
+    ) -> Result<Self, Error> {
+        // Data sources in the manifest are created "before genesis" so they have no creation block.
+        let creation_block = None;
+
+        Ok(DataSource {
+            kind,
+            network,
+            name,
+            source,
+            mapping,
+            context: Arc::new(context),
+            creation_block,
+        })
+    }
+
+    fn handler_for_block(&self) -> Option<&MappingBlockHandler> {
+        self.mapping.block_handlers.first()
+    }
+
+    fn handler_for_transaction(&self) -> Option<&TransactionHandler> {
+        self.mapping.transaction_handlers.first()
+    }
+}
+
+#[derive(Clone, Debug, Eq, PartialEq, Deserialize)]
+pub struct UnresolvedDataSource {
+    pub kind: String,
+    pub network: Option<String>,
+    pub name: String,
+    pub(crate) source: Source,
+    pub mapping: UnresolvedMapping,
+    pub context: Option<DataSourceContext>,
+}
+
+#[async_trait]
+impl blockchain::UnresolvedDataSource<Chain> for UnresolvedDataSource {
+    async fn resolve(
+        self,
+        resolver: &Arc<dyn LinkResolver>,
+        logger: &Logger,
+        _manifest_idx: u32,
+    ) -> Result<DataSource, Error> {
+        let UnresolvedDataSource {
+            kind,
+            network,
+            name,
+            source,
+            mapping,
+            context,
+        } = self;
+
+        info!(logger, "Resolve data source"; "name" => &name, "source_address" => format_args!("{:?}", base64_url::encode(&source.owner.clone().unwrap_or_default())), "source_start_block" => source.start_block);
+
+        let mapping = mapping.resolve(resolver, logger).await?;
+
+        DataSource::from_manifest(kind, network, name, source, mapping, context)
+    }
+}
+
+/// # TODO
+///
+/// add templates for arweave subgraphs
+impl TryFrom<DataSourceTemplateInfo<Chain>> for DataSource {
+    type Error = Error;
+
+    fn try_from(_info: DataSourceTemplateInfo<Chain>) -> Result<Self, Error> {
+        Err(anyhow!("Arweave subgraphs do not support templates"))
+    }
+}
+
+#[derive(Clone, Debug, Default, Hash, Eq, PartialEq, Deserialize)]
+pub struct BaseDataSourceTemplate<M> {
+    pub kind: String,
+    pub network: Option<String>,
+    pub name: String,
+    pub mapping: M,
+}
+
+pub type UnresolvedDataSourceTemplate = BaseDataSourceTemplate<UnresolvedMapping>;
+pub type DataSourceTemplate = BaseDataSourceTemplate<Mapping>;
+
+#[async_trait]
+impl blockchain::UnresolvedDataSourceTemplate<Chain> for UnresolvedDataSourceTemplate {
+    async fn resolve(
+        self,
+        resolver: &Arc<dyn LinkResolver>,
+        logger: &Logger,
+        _manifest_idx: u32,
+    ) -> Result<DataSourceTemplate, Error> {
+        let UnresolvedDataSourceTemplate {
+            kind,
+            network,
+            name,
+            mapping,
+        } = self;
+
+        info!(logger, "Resolve data source template"; "name" => &name);
+
+        Ok(DataSourceTemplate {
+            kind,
+            network,
+            name,
+            mapping: mapping.resolve(resolver, logger).await?,
+        })
+    }
+}
+
+impl blockchain::DataSourceTemplate<Chain> for DataSourceTemplate {
+    fn name(&self) -> &str {
+        &self.name
+    }
+
+    fn api_version(&self) -> semver::Version {
+        self.mapping.api_version.clone()
+    }
+
+    fn runtime(&self) -> Option<Arc<Vec<u8>>> {
+        Some(self.mapping.runtime.cheap_clone())
+    }
+
+    fn manifest_idx(&self) -> u32 {
+        unreachable!("arweave does not support dynamic data sources")
+    }
+}
+
+#[derive(Clone, Debug, Default, Hash, Eq, PartialEq, Deserialize)]
+#[serde(rename_all = "camelCase")]
+pub struct UnresolvedMapping {
+    pub api_version: String,
+    pub language: String,
+    pub entities: Vec<String>,
+    #[serde(default)]
+    pub block_handlers: Vec<MappingBlockHandler>,
+    #[serde(default)]
+    pub transaction_handlers: Vec<TransactionHandler>,
+    pub file: Link,
+}
+
+impl UnresolvedMapping {
+    pub async fn resolve(
+        self,
+        resolver: &Arc<dyn LinkResolver>,
+        logger: &Logger,
+    ) -> Result<Mapping, Error> {
+        let UnresolvedMapping {
+            api_version,
+            language,
+            entities,
+            block_handlers,
+            transaction_handlers,
+            file: link,
+        } = self;
+
+        let api_version = semver::Version::parse(&api_version)?;
+
+        info!(logger, "Resolve mapping"; "link" => &link.link);
+        let module_bytes = resolver.cat(logger, &link).await?;
+
+        Ok(Mapping {
+            api_version,
+            language,
+            entities,
+            block_handlers,
+            transaction_handlers,
+            runtime: Arc::new(module_bytes),
+            link,
+        })
+    }
+}
+
+#[derive(Clone, Debug)]
+pub struct Mapping {
+    pub api_version: semver::Version,
+    pub language: String,
+    pub entities: Vec<String>,
+    pub block_handlers: Vec<MappingBlockHandler>,
+    pub transaction_handlers: Vec<TransactionHandler>,
+    pub runtime: Arc<Vec<u8>>,
+    pub link: Link,
+}
+
+#[derive(Clone, Debug, Hash, Eq, PartialEq, Deserialize)]
+pub struct MappingBlockHandler {
+    pub handler: String,
+}
+
+#[derive(Clone, Debug, Hash, Eq, PartialEq, Deserialize)]
+pub struct TransactionHandler {
+    pub handler: String,
+}
+
+#[derive(Clone, Debug, Hash, Eq, PartialEq, Deserialize)]
+pub(crate) struct Source {
+    // A data source that does not have an owner can only have block handlers.
+    pub(crate) owner: Option<String>,
+    #[serde(rename = "startBlock", default)]
+    pub(crate) start_block: BlockNumber,
+}
diff --git a/chain/arweave/src/lib.rs b/chain/arweave/src/lib.rs
new file mode 100644
index 0000000..a497e77
--- /dev/null
+++ b/chain/arweave/src/lib.rs
@@ -0,0 +1,10 @@
+mod adapter;
+mod capabilities;
+mod chain;
+mod codec;
+mod data_source;
+mod runtime;
+mod trigger;
+
+pub use crate::chain::Chain;
+pub use codec::Block;
diff --git a/chain/arweave/src/protobuf/sf.arweave.r#type.v1.rs b/chain/arweave/src/protobuf/sf.arweave.r#type.v1.rs
new file mode 100644
index 0000000..98a1359
--- /dev/null
+++ b/chain/arweave/src/protobuf/sf.arweave.r#type.v1.rs
@@ -0,0 +1,141 @@
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct BigInt {
+    #[prost(bytes="vec", tag="1")]
+    pub bytes: ::prost::alloc::vec::Vec<u8>,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct Block {
+    /// Firehose block version (unrelated to Arweave block version)
+    #[prost(uint32, tag="1")]
+    pub ver: u32,
+    /// The block identifier
+    #[prost(bytes="vec", tag="2")]
+    pub indep_hash: ::prost::alloc::vec::Vec<u8>,
+    /// The nonce chosen to solve the mining problem
+    #[prost(bytes="vec", tag="3")]
+    pub nonce: ::prost::alloc::vec::Vec<u8>,
+    /// `indep_hash` of the previous block in the weave
+    #[prost(bytes="vec", tag="4")]
+    pub previous_block: ::prost::alloc::vec::Vec<u8>,
+    /// POSIX time of block discovery
+    #[prost(uint64, tag="5")]
+    pub timestamp: u64,
+    /// POSIX time of the last difficulty retarget
+    #[prost(uint64, tag="6")]
+    pub last_retarget: u64,
+    /// Mining difficulty; the number `hash` must be greater than.
+    #[prost(message, optional, tag="7")]
+    pub diff: ::core::option::Option<BigInt>,
+    /// How many blocks have passed since the genesis block
+    #[prost(uint64, tag="8")]
+    pub height: u64,
+    /// Mining solution hash of the block; must satisfy the mining difficulty
+    #[prost(bytes="vec", tag="9")]
+    pub hash: ::prost::alloc::vec::Vec<u8>,
+    /// Merkle root of the tree of Merkle roots of block's transactions' data.
+    #[prost(bytes="vec", tag="10")]
+    pub tx_root: ::prost::alloc::vec::Vec<u8>,
+    /// Transactions contained within this block
+    #[prost(message, repeated, tag="11")]
+    pub txs: ::prost::alloc::vec::Vec<Transaction>,
+    /// The root hash of the Merkle Patricia Tree containing
+    /// all wallet (account) balances and the identifiers
+    /// of the last transactions posted by them; if any.
+    #[prost(bytes="vec", tag="12")]
+    pub wallet_list: ::prost::alloc::vec::Vec<u8>,
+    /// (string or) Address of the account to receive the block rewards. Can also be unclaimed which is encoded as a null byte
+    #[prost(bytes="vec", tag="13")]
+    pub reward_addr: ::prost::alloc::vec::Vec<u8>,
+    /// Tags that a block producer can add to a block
+    #[prost(message, repeated, tag="14")]
+    pub tags: ::prost::alloc::vec::Vec<Tag>,
+    /// Size of reward pool
+    #[prost(message, optional, tag="15")]
+    pub reward_pool: ::core::option::Option<BigInt>,
+    /// Size of the weave in bytes
+    #[prost(message, optional, tag="16")]
+    pub weave_size: ::core::option::Option<BigInt>,
+    /// Size of this block in bytes
+    #[prost(message, optional, tag="17")]
+    pub block_size: ::core::option::Option<BigInt>,
+    /// Required after the version 1.8 fork. Zero otherwise.
+    /// The sum of the average number of hashes computed
+    /// by the network to produce the past blocks including this one.
+    #[prost(message, optional, tag="18")]
+    pub cumulative_diff: ::core::option::Option<BigInt>,
+    /// Required after the version 1.8 fork. Null byte otherwise.
+    /// The Merkle root of the block index - the list of {`indep_hash`; `weave_size`; `tx_root`} triplets
+    #[prost(bytes="vec", tag="20")]
+    pub hash_list_merkle: ::prost::alloc::vec::Vec<u8>,
+    /// The proof of access; Used after v2.4 only; set as defaults otherwise
+    #[prost(message, optional, tag="21")]
+    pub poa: ::core::option::Option<ProofOfAccess>,
+}
+/// A succinct proof of access to a recall byte found in a TX
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct ProofOfAccess {
+    /// The recall byte option chosen; global offset of index byte
+    #[prost(string, tag="1")]
+    pub option: ::prost::alloc::string::String,
+    /// The path through the Merkle tree of transactions' `data_root`s;
+    /// from the `data_root` being proven to the corresponding `tx_root`
+    #[prost(bytes="vec", tag="2")]
+    pub tx_path: ::prost::alloc::vec::Vec<u8>,
+    /// The path through the Merkle tree of identifiers of chunks of the
+    /// corresponding transaction; from the chunk being proven to the
+    /// corresponding `data_root`.
+    #[prost(bytes="vec", tag="3")]
+    pub data_path: ::prost::alloc::vec::Vec<u8>,
+    /// The data chunk.
+    #[prost(bytes="vec", tag="4")]
+    pub chunk: ::prost::alloc::vec::Vec<u8>,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct Transaction {
+    /// 1 or 2 for v1 or v2 transactions. More allowable in the future
+    #[prost(uint32, tag="1")]
+    pub format: u32,
+    /// The transaction identifier.
+    #[prost(bytes="vec", tag="2")]
+    pub id: ::prost::alloc::vec::Vec<u8>,
+    /// Either the identifier of the previous transaction from the same
+    /// wallet or the identifier of one of the last ?MAX_TX_ANCHOR_DEPTH blocks.
+    #[prost(bytes="vec", tag="3")]
+    pub last_tx: ::prost::alloc::vec::Vec<u8>,
+    /// The public key the transaction is signed with.
+    #[prost(bytes="vec", tag="4")]
+    pub owner: ::prost::alloc::vec::Vec<u8>,
+    /// A list of arbitrary key-value pairs
+    #[prost(message, repeated, tag="5")]
+    pub tags: ::prost::alloc::vec::Vec<Tag>,
+    /// The address of the recipient; if any. The SHA2-256 hash of the public key.
+    #[prost(bytes="vec", tag="6")]
+    pub target: ::prost::alloc::vec::Vec<u8>,
+    /// The amount of Winstons to send to the recipient; if any.
+    #[prost(message, optional, tag="7")]
+    pub quantity: ::core::option::Option<BigInt>,
+    /// The data to upload; if any. For v2 transactions; the field is optional
+    /// - a fee is charged based on the `data_size` field;
+    ///   data may be uploaded any time later in chunks.
+    #[prost(bytes="vec", tag="8")]
+    pub data: ::prost::alloc::vec::Vec<u8>,
+    /// Size in bytes of the transaction data.
+    #[prost(message, optional, tag="9")]
+    pub data_size: ::core::option::Option<BigInt>,
+    /// The Merkle root of the Merkle tree of data chunks.
+    #[prost(bytes="vec", tag="10")]
+    pub data_root: ::prost::alloc::vec::Vec<u8>,
+    /// The signature.
+    #[prost(bytes="vec", tag="11")]
+    pub signature: ::prost::alloc::vec::Vec<u8>,
+    /// The fee in Winstons.
+    #[prost(message, optional, tag="12")]
+    pub reward: ::core::option::Option<BigInt>,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct Tag {
+    #[prost(bytes="vec", tag="1")]
+    pub name: ::prost::alloc::vec::Vec<u8>,
+    #[prost(bytes="vec", tag="2")]
+    pub value: ::prost::alloc::vec::Vec<u8>,
+}
diff --git a/chain/arweave/src/runtime/abi.rs b/chain/arweave/src/runtime/abi.rs
new file mode 100644
index 0000000..4f3d400
--- /dev/null
+++ b/chain/arweave/src/runtime/abi.rs
@@ -0,0 +1,191 @@
+use crate::codec;
+use crate::trigger::TransactionWithBlockPtr;
+use graph::runtime::gas::GasCounter;
+use graph::runtime::{asc_new, AscHeap, AscPtr, DeterministicHostError, ToAscObj};
+use graph_runtime_wasm::asc_abi::class::{Array, Uint8Array};
+
+pub(crate) use super::generated::*;
+
+impl ToAscObj<AscTag> for codec::Tag {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscTag, DeterministicHostError> {
+        Ok(AscTag {
+            name: asc_new(heap, self.name.as_slice(), gas)?,
+            value: asc_new(heap, self.value.as_slice(), gas)?,
+        })
+    }
+}
+
+impl ToAscObj<AscTransactionArray> for Vec<Vec<u8>> {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscTransactionArray, DeterministicHostError> {
+        let content = self
+            .into_iter()
+            .map(|x| asc_new(heap, x.as_slice(), gas))
+            .collect::<Result<Vec<AscPtr<Uint8Array>>, _>>()?;
+        Ok(AscTransactionArray(Array::new(&*content, heap, gas)?))
+    }
+}
+
+impl ToAscObj<AscTagArray> for Vec<codec::Tag> {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscTagArray, DeterministicHostError> {
+        let content = self
+            .iter()
+            .map(|x| asc_new(heap, x, gas))
+            .collect::<Result<Vec<_>, _>>()?;
+        Ok(AscTagArray(Array::new(&*content, heap, gas)?))
+    }
+}
+
+impl ToAscObj<AscProofOfAccess> for codec::ProofOfAccess {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscProofOfAccess, DeterministicHostError> {
+        Ok(AscProofOfAccess {
+            option: asc_new(heap, &self.option, gas)?,
+            tx_path: asc_new(heap, self.tx_path.as_slice(), gas)?,
+            data_path: asc_new(heap, self.data_path.as_slice(), gas)?,
+            chunk: asc_new(heap, self.chunk.as_slice(), gas)?,
+        })
+    }
+}
+
+impl ToAscObj<AscTransaction> for codec::Transaction {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscTransaction, DeterministicHostError> {
+        Ok(AscTransaction {
+            format: self.format,
+            id: asc_new(heap, self.id.as_slice(), gas)?,
+            last_tx: asc_new(heap, self.last_tx.as_slice(), gas)?,
+            owner: asc_new(heap, self.owner.as_slice(), gas)?,
+            tags: asc_new(heap, &self.tags, gas)?,
+            target: asc_new(heap, self.target.as_slice(), gas)?,
+            quantity: asc_new(
+                heap,
+                self.quantity
+                    .as_ref()
+                    .map(|b| b.as_ref())
+                    .unwrap_or_default(),
+                gas,
+            )?,
+            data: asc_new(heap, self.data.as_slice(), gas)?,
+            data_size: asc_new(
+                heap,
+                self.data_size
+                    .as_ref()
+                    .map(|b| b.as_ref())
+                    .unwrap_or_default(),
+                gas,
+            )?,
+            data_root: asc_new(heap, self.data_root.as_slice(), gas)?,
+            signature: asc_new(heap, self.signature.as_slice(), gas)?,
+            reward: asc_new(
+                heap,
+                self.reward.as_ref().map(|b| b.as_ref()).unwrap_or_default(),
+                gas,
+            )?,
+        })
+    }
+}
+
+impl ToAscObj<AscBlock> for codec::Block {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscBlock, DeterministicHostError> {
+        Ok(AscBlock {
+            indep_hash: asc_new(heap, self.indep_hash.as_slice(), gas)?,
+            nonce: asc_new(heap, self.nonce.as_slice(), gas)?,
+            previous_block: asc_new(heap, self.previous_block.as_slice(), gas)?,
+            timestamp: self.timestamp,
+            last_retarget: self.last_retarget,
+            diff: asc_new(
+                heap,
+                self.diff.as_ref().map(|b| b.as_ref()).unwrap_or_default(),
+                gas,
+            )?,
+            height: self.height,
+            hash: asc_new(heap, self.hash.as_slice(), gas)?,
+            tx_root: asc_new(heap, self.tx_root.as_slice(), gas)?,
+            txs: asc_new(
+                heap,
+                &self
+                    .txs
+                    .iter()
+                    .map(|tx| tx.id.clone().into())
+                    .collect::<Vec<Vec<u8>>>(),
+                gas,
+            )?,
+            wallet_list: asc_new(heap, self.wallet_list.as_slice(), gas)?,
+            reward_addr: asc_new(heap, self.reward_addr.as_slice(), gas)?,
+            tags: asc_new(heap, &self.tags, gas)?,
+            reward_pool: asc_new(
+                heap,
+                self.reward_pool
+                    .as_ref()
+                    .map(|b| b.as_ref())
+                    .unwrap_or_default(),
+                gas,
+            )?,
+            weave_size: asc_new(
+                heap,
+                self.weave_size
+                    .as_ref()
+                    .map(|b| b.as_ref())
+                    .unwrap_or_default(),
+                gas,
+            )?,
+            block_size: asc_new(
+                heap,
+                self.block_size
+                    .as_ref()
+                    .map(|b| b.as_ref())
+                    .unwrap_or_default(),
+                gas,
+            )?,
+            cumulative_diff: asc_new(
+                heap,
+                self.cumulative_diff
+                    .as_ref()
+                    .map(|b| b.as_ref())
+                    .unwrap_or_default(),
+                gas,
+            )?,
+            hash_list_merkle: asc_new(heap, self.hash_list_merkle.as_slice(), gas)?,
+            poa: self
+                .poa
+                .as_ref()
+                .map(|poa| asc_new(heap, poa, gas))
+                .unwrap_or(Ok(AscPtr::null()))?,
+        })
+    }
+}
+
+impl ToAscObj<AscTransactionWithBlockPtr> for TransactionWithBlockPtr {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscTransactionWithBlockPtr, DeterministicHostError> {
+        Ok(AscTransactionWithBlockPtr {
+            tx: asc_new(heap, &self.tx.as_ref(), gas)?,
+            block: asc_new(heap, self.block.as_ref(), gas)?,
+        })
+    }
+}
diff --git a/chain/arweave/src/runtime/generated.rs b/chain/arweave/src/runtime/generated.rs
new file mode 100644
index 0000000..e8a10fd
--- /dev/null
+++ b/chain/arweave/src/runtime/generated.rs
@@ -0,0 +1,128 @@
+use graph::runtime::{AscIndexId, AscPtr, AscType, DeterministicHostError, IndexForAscTypeId};
+use graph::semver::Version;
+use graph_runtime_derive::AscType;
+use graph_runtime_wasm::asc_abi::class::{Array, AscString, Uint8Array};
+
+#[repr(C)]
+#[derive(AscType, Default)]
+pub struct AscBlock {
+    pub timestamp: u64,
+    pub last_retarget: u64,
+    pub height: u64,
+    pub indep_hash: AscPtr<Uint8Array>,
+    pub nonce: AscPtr<Uint8Array>,
+    pub previous_block: AscPtr<Uint8Array>,
+    pub diff: AscPtr<Uint8Array>,
+    pub hash: AscPtr<Uint8Array>,
+    pub tx_root: AscPtr<Uint8Array>,
+    pub txs: AscPtr<AscTransactionArray>,
+    pub wallet_list: AscPtr<Uint8Array>,
+    pub reward_addr: AscPtr<Uint8Array>,
+    pub tags: AscPtr<AscTagArray>,
+    pub reward_pool: AscPtr<Uint8Array>,
+    pub weave_size: AscPtr<Uint8Array>,
+    pub block_size: AscPtr<Uint8Array>,
+    pub cumulative_diff: AscPtr<Uint8Array>,
+    pub hash_list_merkle: AscPtr<Uint8Array>,
+    pub poa: AscPtr<AscProofOfAccess>,
+}
+
+impl AscIndexId for AscBlock {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::ArweaveBlock;
+}
+
+#[repr(C)]
+#[derive(AscType)]
+pub struct AscProofOfAccess {
+    pub option: AscPtr<AscString>,
+    pub tx_path: AscPtr<Uint8Array>,
+    pub data_path: AscPtr<Uint8Array>,
+    pub chunk: AscPtr<Uint8Array>,
+}
+
+impl AscIndexId for AscProofOfAccess {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::ArweaveProofOfAccess;
+}
+
+#[repr(C)]
+#[derive(AscType)]
+pub struct AscTransaction {
+    pub format: u32,
+    pub id: AscPtr<Uint8Array>,
+    pub last_tx: AscPtr<Uint8Array>,
+    pub owner: AscPtr<Uint8Array>,
+    pub tags: AscPtr<AscTagArray>,
+    pub target: AscPtr<Uint8Array>,
+    pub quantity: AscPtr<Uint8Array>,
+    pub data: AscPtr<Uint8Array>,
+    pub data_size: AscPtr<Uint8Array>,
+    pub data_root: AscPtr<Uint8Array>,
+    pub signature: AscPtr<Uint8Array>,
+    pub reward: AscPtr<Uint8Array>,
+}
+
+impl AscIndexId for AscTransaction {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::ArweaveTransaction;
+}
+
+#[repr(C)]
+#[derive(AscType)]
+pub struct AscTag {
+    pub name: AscPtr<Uint8Array>,
+    pub value: AscPtr<Uint8Array>,
+}
+
+impl AscIndexId for AscTag {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::ArweaveTag;
+}
+
+#[repr(C)]
+pub struct AscTransactionArray(pub(crate) Array<AscPtr<Uint8Array>>);
+
+impl AscType for AscTransactionArray {
+    fn to_asc_bytes(&self) -> Result<Vec<u8>, DeterministicHostError> {
+        self.0.to_asc_bytes()
+    }
+
+    fn from_asc_bytes(
+        asc_obj: &[u8],
+        api_version: &Version,
+    ) -> Result<Self, DeterministicHostError> {
+        Ok(Self(Array::from_asc_bytes(asc_obj, api_version)?))
+    }
+}
+
+impl AscIndexId for AscTransactionArray {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::ArweaveTransactionArray;
+}
+
+#[repr(C)]
+pub struct AscTagArray(pub(crate) Array<AscPtr<AscTag>>);
+
+impl AscType for AscTagArray {
+    fn to_asc_bytes(&self) -> Result<Vec<u8>, DeterministicHostError> {
+        self.0.to_asc_bytes()
+    }
+
+    fn from_asc_bytes(
+        asc_obj: &[u8],
+        api_version: &Version,
+    ) -> Result<Self, DeterministicHostError> {
+        Ok(Self(Array::from_asc_bytes(asc_obj, api_version)?))
+    }
+}
+
+impl AscIndexId for AscTagArray {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::ArweaveTagArray;
+}
+
+#[repr(C)]
+#[derive(AscType)]
+pub struct AscTransactionWithBlockPtr {
+    pub tx: AscPtr<AscTransaction>,
+    pub block: AscPtr<AscBlock>,
+}
+
+impl AscIndexId for AscTransactionWithBlockPtr {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::ArweaveTransactionWithBlockPtr;
+}
diff --git a/chain/arweave/src/runtime/mod.rs b/chain/arweave/src/runtime/mod.rs
new file mode 100644
index 0000000..f44391c
--- /dev/null
+++ b/chain/arweave/src/runtime/mod.rs
@@ -0,0 +1,6 @@
+pub use runtime_adapter::RuntimeAdapter;
+
+pub mod abi;
+pub mod runtime_adapter;
+
+mod generated;
diff --git a/chain/arweave/src/runtime/runtime_adapter.rs b/chain/arweave/src/runtime/runtime_adapter.rs
new file mode 100644
index 0000000..c5fa9e1
--- /dev/null
+++ b/chain/arweave/src/runtime/runtime_adapter.rs
@@ -0,0 +1,11 @@
+use crate::{data_source::DataSource, Chain};
+use blockchain::HostFn;
+use graph::{anyhow::Error, blockchain};
+
+pub struct RuntimeAdapter {}
+
+impl blockchain::RuntimeAdapter<Chain> for RuntimeAdapter {
+    fn host_fns(&self, _ds: &DataSource) -> Result<Vec<HostFn>, Error> {
+        Ok(vec![])
+    }
+}
diff --git a/chain/arweave/src/trigger.rs b/chain/arweave/src/trigger.rs
new file mode 100644
index 0000000..9d2f7ad
--- /dev/null
+++ b/chain/arweave/src/trigger.rs
@@ -0,0 +1,137 @@
+use graph::blockchain::Block;
+use graph::blockchain::TriggerData;
+use graph::cheap_clone::CheapClone;
+use graph::prelude::web3::types::H256;
+use graph::prelude::BlockNumber;
+use graph::runtime::asc_new;
+use graph::runtime::gas::GasCounter;
+use graph::runtime::AscHeap;
+use graph::runtime::AscPtr;
+use graph::runtime::DeterministicHostError;
+use graph_runtime_wasm::module::ToAscPtr;
+use std::{cmp::Ordering, sync::Arc};
+
+use crate::codec;
+
+// Logging the block is too verbose, so this strips the block from the trigger for Debug.
+impl std::fmt::Debug for ArweaveTrigger {
+    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
+        #[derive(Debug)]
+        pub enum MappingTriggerWithoutBlock {
+            Block,
+            Transaction(Arc<codec::Transaction>),
+        }
+
+        let trigger_without_block = match self {
+            ArweaveTrigger::Block(_) => MappingTriggerWithoutBlock::Block,
+            ArweaveTrigger::Transaction(tx) => {
+                MappingTriggerWithoutBlock::Transaction(tx.tx.clone())
+            }
+        };
+
+        write!(f, "{:?}", trigger_without_block)
+    }
+}
+
+impl ToAscPtr for ArweaveTrigger {
+    fn to_asc_ptr<H: AscHeap>(
+        self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscPtr<()>, DeterministicHostError> {
+        Ok(match self {
+            ArweaveTrigger::Block(block) => asc_new(heap, block.as_ref(), gas)?.erase(),
+            ArweaveTrigger::Transaction(tx) => asc_new(heap, tx.as_ref(), gas)?.erase(),
+        })
+    }
+}
+
+#[derive(Clone)]
+pub enum ArweaveTrigger {
+    Block(Arc<codec::Block>),
+    Transaction(Arc<TransactionWithBlockPtr>),
+}
+
+impl CheapClone for ArweaveTrigger {
+    fn cheap_clone(&self) -> ArweaveTrigger {
+        match self {
+            ArweaveTrigger::Block(block) => ArweaveTrigger::Block(block.cheap_clone()),
+            ArweaveTrigger::Transaction(tx) => ArweaveTrigger::Transaction(tx.cheap_clone()),
+        }
+    }
+}
+
+impl PartialEq for ArweaveTrigger {
+    fn eq(&self, other: &Self) -> bool {
+        match (self, other) {
+            (Self::Block(a_ptr), Self::Block(b_ptr)) => a_ptr == b_ptr,
+            (Self::Transaction(a_tx), Self::Transaction(b_tx)) => a_tx.tx.id == b_tx.tx.id,
+            _ => false,
+        }
+    }
+}
+
+impl Eq for ArweaveTrigger {}
+
+impl ArweaveTrigger {
+    pub fn block_number(&self) -> BlockNumber {
+        match self {
+            ArweaveTrigger::Block(block) => block.number(),
+            ArweaveTrigger::Transaction(tx) => tx.block.number(),
+        }
+    }
+
+    pub fn block_hash(&self) -> H256 {
+        match self {
+            ArweaveTrigger::Block(block) => block.ptr().hash_as_h256(),
+            ArweaveTrigger::Transaction(tx) => tx.block.ptr().hash_as_h256(),
+        }
+    }
+}
+
+impl Ord for ArweaveTrigger {
+    fn cmp(&self, other: &Self) -> Ordering {
+        match (self, other) {
+            // Keep the order when comparing two block triggers
+            (Self::Block(..), Self::Block(..)) => Ordering::Equal,
+
+            // Block triggers always come last
+            (Self::Block(..), _) => Ordering::Greater,
+            (_, Self::Block(..)) => Ordering::Less,
+
+            // Execution outcomes have no intrinsic ordering information so we keep the order in
+            // which they are included in the `txs` field of `Block`.
+            (Self::Transaction(..), Self::Transaction(..)) => Ordering::Equal,
+        }
+    }
+}
+
+impl PartialOrd for ArweaveTrigger {
+    fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
+        Some(self.cmp(other))
+    }
+}
+
+impl TriggerData for ArweaveTrigger {
+    fn error_context(&self) -> std::string::String {
+        match self {
+            ArweaveTrigger::Block(..) => {
+                format!("Block #{} ({})", self.block_number(), self.block_hash())
+            }
+            ArweaveTrigger::Transaction(tx) => {
+                format!(
+                    "Tx #{}, block #{}({})",
+                    base64_url::encode(&tx.tx.id),
+                    self.block_number(),
+                    self.block_hash()
+                )
+            }
+        }
+    }
+}
+
+pub struct TransactionWithBlockPtr {
+    // REVIEW: Do we want to actually also have those two below behind an `Arc` wrapper?
+    pub tx: Arc<codec::Transaction>,
+    pub block: Arc<codec::Block>,
+}
diff --git a/chain/common/Cargo.toml b/chain/common/Cargo.toml
new file mode 100644
index 0000000..364e8e3
--- /dev/null
+++ b/chain/common/Cargo.toml
@@ -0,0 +1,12 @@
+[package]
+name = "graph-chain-common"
+version = "0.27.0"
+edition = "2021"
+
+# See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html
+
+[dependencies]
+protobuf = "3.0.2"
+protobuf-parse = "3.0.2"
+anyhow = "1"
+heck = "0.4"
diff --git a/chain/common/src/lib.rs b/chain/common/src/lib.rs
new file mode 100644
index 0000000..f1e5aeb
--- /dev/null
+++ b/chain/common/src/lib.rs
@@ -0,0 +1,218 @@
+use std::collections::HashMap;
+use std::fmt::Debug;
+
+use anyhow::Error;
+use protobuf::descriptor::field_descriptor_proto::Label;
+use protobuf::descriptor::field_descriptor_proto::Type;
+use protobuf::descriptor::DescriptorProto;
+use protobuf::descriptor::FieldDescriptorProto;
+use protobuf::descriptor::OneofDescriptorProto;
+use protobuf::Message;
+use protobuf::UnknownValueRef;
+use std::convert::From;
+use std::path::Path;
+
+const REQUIRED_ID: u32 = 66001;
+
+#[derive(Debug, Clone)]
+pub struct Field {
+    pub name: String,
+    pub type_name: String,
+    pub required: bool,
+    pub is_enum: bool,
+    pub is_array: bool,
+    pub fields: Vec<Field>,
+}
+
+#[derive(Debug, Clone)]
+pub struct PType {
+    pub name: String,
+    pub fields: Vec<Field>,
+    pub descriptor: DescriptorProto,
+}
+
+impl PType {
+    pub fn fields(&self) -> Option<String> {
+        let mut v = Vec::new();
+        if let Some(vv) = self.req_fields_as_string() {
+            v.push(vv);
+        }
+        if let Some(vv) = self.enum_fields_as_string() {
+            v.push(vv);
+        }
+
+        if v.len() < 1 {
+            None
+        } else {
+            Some(v.join(","))
+        }
+    }
+
+    pub fn has_req_fields(&self) -> bool {
+        self.fields.iter().any(|f| f.required)
+    }
+
+    pub fn req_fields_as_string(&self) -> Option<String> {
+        if self.has_req_fields() {
+            Some(format!(
+                "__required__{{{}}}",
+                self.fields
+                    .iter()
+                    .filter(|f| f.required)
+                    .map(|f| format!("{}: {}", f.name, f.type_name))
+                    .collect::<Vec<String>>()
+                    .join(",")
+            ))
+        } else {
+            None
+        }
+    }
+
+    pub fn has_enum(&self) -> bool {
+        self.fields.iter().any(|f| f.is_enum)
+    }
+
+    pub fn enum_fields_as_string(&self) -> Option<String> {
+        if !self.has_enum() {
+            return None;
+        }
+
+        Some(
+            self.fields
+                .iter()
+                .filter(|f| f.is_enum)
+                .map(|f| {
+                    let pairs = f
+                        .fields
+                        .iter()
+                        .map(|f| format!("{}: {}", f.name, f.type_name))
+                        .collect::<Vec<String>>()
+                        .join(",");
+
+                    format!("{}{{{}}}", f.name, pairs)
+                })
+                .collect::<Vec<String>>()
+                .join(","),
+        )
+    }
+}
+
+impl From<&FieldDescriptorProto> for Field {
+    fn from(fd: &FieldDescriptorProto) -> Self {
+        let options = fd.options.unknown_fields();
+
+        let type_name = if let Some(type_name) = fd.type_name.as_ref() {
+            type_name.to_owned()
+        } else {
+            if let Type::TYPE_BYTES = fd.type_() {
+                "Vec<u8>".to_owned()
+            } else {
+                use heck::ToUpperCamelCase;
+                fd.name().to_string().to_upper_camel_case()
+            }
+        };
+
+        Field {
+            name: fd.name().to_owned(),
+            type_name: type_name.rsplit(".").next().unwrap().to_owned(),
+            required: options
+                .iter()
+                //(firehose.required) = true,  UnknownValueRef::Varint(0) => false, UnknownValueRef::Varint(1) => true
+                .find(|f| f.0 == REQUIRED_ID && UnknownValueRef::Varint(1) == f.1)
+                .is_some(),
+            is_enum: false,
+            is_array: Label::LABEL_REPEATED == fd.label(),
+            fields: vec![],
+        }
+    }
+}
+
+impl From<&OneofDescriptorProto> for Field {
+    fn from(fd: &OneofDescriptorProto) -> Self {
+        Field {
+            name: fd.name().to_owned(),
+            type_name: "".to_owned(),
+            required: false,
+            is_enum: true,
+            is_array: false,
+            fields: vec![],
+        }
+    }
+}
+
+impl From<&DescriptorProto> for PType {
+    fn from(dp: &DescriptorProto) -> Self {
+        let mut fields = dp
+            .oneof_decl
+            .iter()
+            .enumerate()
+            .map(|(index, fd)| {
+                let mut fld = Field::from(fd);
+
+                fld.fields = dp
+                    .field
+                    .iter()
+                    .filter(|fd| fd.oneof_index.is_some())
+                    .filter(|fd| *fd.oneof_index.as_ref().unwrap() as usize == index)
+                    .map(|fd| Field::from(fd))
+                    .collect::<Vec<Field>>();
+
+                fld
+            })
+            .collect::<Vec<Field>>();
+
+        fields.extend(
+            dp.field
+                .iter()
+                .filter(|fd| fd.oneof_index.is_none())
+                .map(|fd| Field::from(fd))
+                .collect::<Vec<Field>>(),
+        );
+
+        PType {
+            name: dp.name().to_owned(),
+            fields,
+            descriptor: dp.clone(),
+        }
+    }
+}
+
+pub fn parse_proto_file<'a, P>(file_path: P) -> Result<HashMap<String, PType>, Error>
+where
+    P: 'a + AsRef<Path> + Debug,
+{
+    let dir = if let Some(p) = file_path.as_ref().parent() {
+        p
+    } else {
+        return Err(anyhow::anyhow!(
+            "Unable to derive parent path for {:?}",
+            file_path
+        ));
+    };
+
+    let fd = protobuf_parse::Parser::new()
+        .include(dir)
+        .input(&file_path)
+        .file_descriptor_set()?;
+
+    assert!(fd.file.len() == 1);
+    assert!(fd.file[0].has_name());
+
+    let file_name = file_path
+        .as_ref()
+        .clone()
+        .file_name()
+        .unwrap()
+        .to_str()
+        .unwrap();
+    assert!(fd.file[0].name() == file_name);
+
+    let ret_val = fd
+        .file
+        .iter() //should be just 1 file
+        .flat_map(|f| f.message_type.iter())
+        .map(|dp| (dp.name().to_owned(), PType::from(dp)))
+        .collect::<HashMap<String, PType>>();
+
+    Ok(ret_val)
+}
diff --git a/chain/common/tests/resources/acme.proto b/chain/common/tests/resources/acme.proto
new file mode 100644
index 0000000..16a0bef
--- /dev/null
+++ b/chain/common/tests/resources/acme.proto
@@ -0,0 +1,56 @@
+syntax = "proto3";
+
+package sf.acme.type.v1;
+
+option go_package = "github.com/streamingfast/firehose-acme/pb/sf/acme/type/v1;pbacme";
+
+import "firehose/annotations.proto";
+
+message Block {
+  uint64 height = 1;
+  string hash = 2;
+  string prevHash = 3;
+  uint64 timestamp = 4;
+  repeated Transaction transactions = 5;
+}
+
+message Transaction {
+  string type = 1 [(firehose.required) = true];
+  string hash = 2;
+  string sender = 3;
+  string receiver = 4;
+  BigInt amount = 5;
+  BigInt fee = 6;
+  bool success = 7;
+  repeated Event events = 8;
+}
+
+message Event {
+  string type = 1;
+  repeated Attribute attributes = 2;
+}
+
+message Attribute {
+  string key = 1;
+  string value = 2;
+}
+
+message BigInt {
+  bytes bytes = 1;
+}
+
+message EnumTest {
+  oneof sum {
+    Attribute attribute = 1;
+    BigInt big_int = 2;
+  }
+}
+
+message MixedEnumTest {
+  string key = 1;
+
+  oneof sum {
+    Attribute attribute = 2;
+    BigInt big_int = 3;
+  }
+}
diff --git a/chain/common/tests/resources/firehose/annotations.proto b/chain/common/tests/resources/firehose/annotations.proto
new file mode 100644
index 0000000..2541e7f
--- /dev/null
+++ b/chain/common/tests/resources/firehose/annotations.proto
@@ -0,0 +1,9 @@
+package firehose;
+
+import "google/protobuf/descriptor.proto";
+
+// 66K range is arbitrary picked number, might be conflict
+
+extend google.protobuf.FieldOptions {
+  optional bool required = 66001;
+}
diff --git a/chain/common/tests/test-acme.rs b/chain/common/tests/test-acme.rs
new file mode 100644
index 0000000..554e4ec
--- /dev/null
+++ b/chain/common/tests/test-acme.rs
@@ -0,0 +1,89 @@
+const PROTO_FILE: &str = "tests/resources/acme.proto";
+
+use graph_chain_common::*;
+
+#[test]
+fn check_repeated_type_ok() {
+    let types = parse_proto_file(PROTO_FILE).expect("Unable to read proto file!");
+
+    let array_types = types
+        .iter()
+        .flat_map(|(_, t)| t.fields.iter())
+        .filter(|t| t.is_array)
+        .map(|t| t.type_name.clone())
+        .collect::<std::collections::HashSet<_>>();
+
+    let mut array_types = array_types.into_iter().collect::<Vec<String>>();
+    array_types.sort();
+
+    assert_eq!(3, array_types.len());
+    assert_eq!(array_types, vec!["Attribute", "Event", "Transaction"]);
+}
+
+#[test]
+fn check_type_count_ok() {
+    let types = parse_proto_file(PROTO_FILE).expect("Unable to read proto file!");
+    assert_eq!(7, types.len());
+}
+
+#[test]
+fn required_ok() {
+    let types = parse_proto_file(PROTO_FILE).expect("Unable to read proto file!");
+    let msg = types.get("Transaction");
+    assert!(msg.is_some(), "\"Transaction\" type is not available!");
+
+    let ptype = msg.unwrap();
+    assert_eq!(8, ptype.fields.len());
+
+    ptype.fields.iter().for_each(|f| {
+        match f.name.as_ref() {
+            "type" => assert!(f.required, "Transaction.type field should be required!"),
+            "hash" => assert!(
+                !f.required,
+                "Transaction.hash field should NOT be required!"
+            ),
+            "sender" => assert!(
+                !f.required,
+                "Transaction.sender field should NOT be required!"
+            ),
+            "receiver" => assert!(
+                !f.required,
+                "Transaction.receiver field should NOT be required!"
+            ),
+            "amount" => assert!(
+                !f.required,
+                "Transaction.amount field should NOT be required!"
+            ),
+            "fee" => assert!(!f.required, "Transaction.fee field should NOT be required!"),
+            "success" => assert!(
+                !f.required,
+                "Transaction.success field should NOT be required!"
+            ),
+            "events" => assert!(
+                !f.required,
+                "Transaction.events field should NOT be required!"
+            ),
+            _ => assert!(false, "Unexpected message field [{}]!", f.name),
+        };
+    });
+}
+
+#[test]
+fn enum_ok() {
+    let types = parse_proto_file(PROTO_FILE).expect("Unable to read proto file!");
+    let msg = types.get("EnumTest");
+    assert!(msg.is_some(), "\"EnumTest\" type is not available!");
+
+    let ptype = msg.unwrap();
+    assert_eq!(1, ptype.fields.len());
+}
+
+#[test]
+fn enum_mixed_ok() {
+    let types = parse_proto_file(PROTO_FILE).expect("Unable to read proto file!");
+    let msg = types.get("MixedEnumTest");
+    assert!(msg.is_some(), "\"MixedEnumTest\" type is not available!");
+
+    let ptype = msg.unwrap();
+    assert_eq!(2, ptype.fields.len());
+}
diff --git a/chain/cosmos/Cargo.toml b/chain/cosmos/Cargo.toml
new file mode 100644
index 0000000..de085f5
--- /dev/null
+++ b/chain/cosmos/Cargo.toml
@@ -0,0 +1,19 @@
+[package]
+name = "graph-chain-cosmos"
+version = "0.27.0"
+edition = "2018"
+
+[build-dependencies]
+tonic-build = { version = "0.7.1", features = ["prost"] }
+graph-chain-common = { path = "../common" }
+
+[dependencies]
+graph = { path = "../../graph" }
+prost = "0.10.1"
+prost-types = "0.10.1"
+serde = "1.0"
+anyhow = "1.0"
+semver = "1.0.3"
+
+graph-runtime-wasm = { path = "../../runtime/wasm" }
+graph-runtime-derive = { path = "../../runtime/derive" }
diff --git a/chain/cosmos/build.rs b/chain/cosmos/build.rs
new file mode 100644
index 0000000..fc07b49
--- /dev/null
+++ b/chain/cosmos/build.rs
@@ -0,0 +1,54 @@
+const PROTO_FILE: &str = "proto/type.proto";
+
+fn main() {
+    println!("cargo:rerun-if-changed=proto");
+
+    let types =
+        graph_chain_common::parse_proto_file(PROTO_FILE).expect("Unable to parse proto file!");
+
+    let array_types = types
+        .iter()
+        .flat_map(|(_, t)| t.fields.iter())
+        .filter(|t| t.is_array)
+        .map(|t| t.type_name.clone())
+        .collect::<std::collections::HashSet<_>>();
+
+    let mut builder = tonic_build::configure().out_dir("src/protobuf");
+
+    for (name, ptype) in types {
+        //generate Asc<Type>
+        builder = builder.type_attribute(
+            name.clone(),
+            format!(
+                "#[graph_runtime_derive::generate_asc_type({})]",
+                ptype.fields().unwrap_or_default()
+            ),
+        );
+
+        //generate data index id
+        builder = builder.type_attribute(
+            name.clone(),
+            "#[graph_runtime_derive::generate_network_type_id(Cosmos)]",
+        );
+
+        //generate conversion from rust type to asc
+        builder = builder.type_attribute(
+            name.clone(),
+            format!(
+                "#[graph_runtime_derive::generate_from_rust_type({})]",
+                ptype.fields().unwrap_or_default()
+            ),
+        );
+
+        if array_types.contains(&ptype.name) {
+            builder = builder.type_attribute(
+                name.clone(),
+                "#[graph_runtime_derive::generate_array_type(Cosmos)]",
+            );
+        }
+    }
+
+    builder
+        .compile(&["proto/type.proto"], &["proto"])
+        .expect("Failed to compile Firehose Cosmos proto(s)");
+}
diff --git a/chain/cosmos/proto/cosmos_proto/cosmos.proto b/chain/cosmos/proto/cosmos_proto/cosmos.proto
new file mode 100644
index 0000000..5c63b86
--- /dev/null
+++ b/chain/cosmos/proto/cosmos_proto/cosmos.proto
@@ -0,0 +1,97 @@
+syntax = "proto3";
+package cosmos_proto;
+
+import "google/protobuf/descriptor.proto";
+
+option go_package = "github.com/cosmos/cosmos-proto;cosmos_proto";
+
+extend google.protobuf.MessageOptions {
+
+    // implements_interface is used to indicate the type name of the interface
+    // that a message implements so that it can be used in google.protobuf.Any
+    // fields that accept that interface. A message can implement multiple
+    // interfaces. Interfaces should be declared using a declare_interface
+    // file option.
+    repeated string implements_interface = 93001;
+}
+
+extend google.protobuf.FieldOptions {
+
+    // accepts_interface is used to annotate that a google.protobuf.Any
+    // field accepts messages that implement the specified interface.
+    // Interfaces should be declared using a declare_interface file option.
+    string accepts_interface = 93001;
+
+    // scalar is used to indicate that this field follows the formatting defined
+    // by the named scalar which should be declared with declare_scalar. Code
+    // generators may choose to use this information to map this field to a
+    // language-specific type representing the scalar.
+    string scalar = 93002;
+}
+
+extend google.protobuf.FileOptions {
+
+    // declare_interface declares an interface type to be used with
+    // accepts_interface and implements_interface. Interface names are
+    // expected to follow the following convention such that their declaration
+    // can be discovered by tools: for a given interface type a.b.C, it is
+    // expected that the declaration will be found in a protobuf file named
+    // a/b/interfaces.proto in the file descriptor set.
+    repeated InterfaceDescriptor declare_interface = 793021;
+
+    // declare_scalar declares a scalar type to be used with
+    // the scalar field option. Scalar names are
+    // expected to follow the following convention such that their declaration
+    // can be discovered by tools: for a given scalar type a.b.C, it is
+    // expected that the declaration will be found in a protobuf file named
+    // a/b/scalars.proto in the file descriptor set.
+    repeated ScalarDescriptor declare_scalar = 793022;
+}
+
+// InterfaceDescriptor describes an interface type to be used with
+// accepts_interface and implements_interface and declared by declare_interface.
+message InterfaceDescriptor {
+
+    // name is the name of the interface. It should be a short-name (without
+    // a period) such that the fully qualified name of the interface will be
+    // package.name, ex. for the package a.b and interface named C, the
+    // fully-qualified name will be a.b.C.
+    string name = 1;
+
+    // description is a human-readable description of the interface and its
+    // purpose.
+    string description = 2;
+}
+
+// ScalarDescriptor describes an scalar type to be used with
+// the scalar field option and declared by declare_scalar.
+// Scalars extend simple protobuf built-in types with additional
+// syntax and semantics, for instance to represent big integers.
+// Scalars should ideally define an encoding such that there is only one
+// valid syntactical representation for a given semantic meaning,
+// i.e. the encoding should be deterministic.
+message ScalarDescriptor {
+
+    // name is the name of the scalar. It should be a short-name (without
+    // a period) such that the fully qualified name of the scalar will be
+    // package.name, ex. for the package a.b and scalar named C, the
+    // fully-qualified name will be a.b.C.
+    string name = 1;
+
+    // description is a human-readable description of the scalar and its
+    // encoding format. For instance a big integer or decimal scalar should
+    // specify precisely the expected encoding format.
+    string description = 2;
+
+    // field_type is the type of field with which this scalar can be used.
+    // Scalars can be used with one and only one type of field so that
+    // encoding standards and simple and clear. Currently only string and
+    // bytes fields are supported for scalars.
+    repeated ScalarType field_type = 3;
+}
+
+enum ScalarType {
+    SCALAR_TYPE_UNSPECIFIED = 0;
+    SCALAR_TYPE_STRING = 1;
+    SCALAR_TYPE_BYTES = 2;
+}
diff --git a/chain/cosmos/proto/firehose/annotations.proto b/chain/cosmos/proto/firehose/annotations.proto
new file mode 100644
index 0000000..2541e7f
--- /dev/null
+++ b/chain/cosmos/proto/firehose/annotations.proto
@@ -0,0 +1,9 @@
+package firehose;
+
+import "google/protobuf/descriptor.proto";
+
+// 66K range is arbitrary picked number, might be conflict
+
+extend google.protobuf.FieldOptions {
+  optional bool required = 66001;
+}
diff --git a/chain/cosmos/proto/gogoproto/gogo.proto b/chain/cosmos/proto/gogoproto/gogo.proto
new file mode 100644
index 0000000..49e78f9
--- /dev/null
+++ b/chain/cosmos/proto/gogoproto/gogo.proto
@@ -0,0 +1,145 @@
+// Protocol Buffers for Go with Gadgets
+//
+// Copyright (c) 2013, The GoGo Authors. All rights reserved.
+// http://github.com/gogo/protobuf
+//
+// Redistribution and use in source and binary forms, with or without
+// modification, are permitted provided that the following conditions are
+// met:
+//
+//     * Redistributions of source code must retain the above copyright
+// notice, this list of conditions and the following disclaimer.
+//     * Redistributions in binary form must reproduce the above
+// copyright notice, this list of conditions and the following disclaimer
+// in the documentation and/or other materials provided with the
+// distribution.
+//
+// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+syntax = "proto2";
+package gogoproto;
+
+import "google/protobuf/descriptor.proto";
+
+option java_package = "com.google.protobuf";
+option java_outer_classname = "GoGoProtos";
+option go_package = "github.com/gogo/protobuf/gogoproto";
+
+extend google.protobuf.EnumOptions {
+	optional bool goproto_enum_prefix = 62001;
+	optional bool goproto_enum_stringer = 62021;
+	optional bool enum_stringer = 62022;
+	optional string enum_customname = 62023;
+	optional bool enumdecl = 62024;
+}
+
+extend google.protobuf.EnumValueOptions {
+	optional string enumvalue_customname = 66001;
+}
+
+extend google.protobuf.FileOptions {
+	optional bool goproto_getters_all = 63001;
+	optional bool goproto_enum_prefix_all = 63002;
+	optional bool goproto_stringer_all = 63003;
+	optional bool verbose_equal_all = 63004;
+	optional bool face_all = 63005;
+	optional bool gostring_all = 63006;
+	optional bool populate_all = 63007;
+	optional bool stringer_all = 63008;
+	optional bool onlyone_all = 63009;
+
+	optional bool equal_all = 63013;
+	optional bool description_all = 63014;
+	optional bool testgen_all = 63015;
+	optional bool benchgen_all = 63016;
+	optional bool marshaler_all = 63017;
+	optional bool unmarshaler_all = 63018;
+	optional bool stable_marshaler_all = 63019;
+
+	optional bool sizer_all = 63020;
+
+	optional bool goproto_enum_stringer_all = 63021;
+	optional bool enum_stringer_all = 63022;
+
+	optional bool unsafe_marshaler_all = 63023;
+	optional bool unsafe_unmarshaler_all = 63024;
+
+	optional bool goproto_extensions_map_all = 63025;
+	optional bool goproto_unrecognized_all = 63026;
+	optional bool gogoproto_import = 63027;
+	optional bool protosizer_all = 63028;
+	optional bool compare_all = 63029;
+    optional bool typedecl_all = 63030;
+    optional bool enumdecl_all = 63031;
+
+	optional bool goproto_registration = 63032;
+	optional bool messagename_all = 63033;
+
+	optional bool goproto_sizecache_all = 63034;
+	optional bool goproto_unkeyed_all = 63035;
+}
+
+extend google.protobuf.MessageOptions {
+	optional bool goproto_getters = 64001;
+	optional bool goproto_stringer = 64003;
+	optional bool verbose_equal = 64004;
+	optional bool face = 64005;
+	optional bool gostring = 64006;
+	optional bool populate = 64007;
+	optional bool stringer = 67008;
+	optional bool onlyone = 64009;
+
+	optional bool equal = 64013;
+	optional bool description = 64014;
+	optional bool testgen = 64015;
+	optional bool benchgen = 64016;
+	optional bool marshaler = 64017;
+	optional bool unmarshaler = 64018;
+	optional bool stable_marshaler = 64019;
+
+	optional bool sizer = 64020;
+
+	optional bool unsafe_marshaler = 64023;
+	optional bool unsafe_unmarshaler = 64024;
+
+	optional bool goproto_extensions_map = 64025;
+	optional bool goproto_unrecognized = 64026;
+
+	optional bool protosizer = 64028;
+	optional bool compare = 64029;
+
+	optional bool typedecl = 64030;
+
+	optional bool messagename = 64033;
+
+	optional bool goproto_sizecache = 64034;
+	optional bool goproto_unkeyed = 64035;
+}
+
+extend google.protobuf.FieldOptions {
+	optional bool nullable = 65001;
+	optional bool embed = 65002;
+	optional string customtype = 65003;
+	optional string customname = 65004;
+	optional string jsontag = 65005;
+	optional string moretags = 65006;
+	optional string casttype = 65007;
+	optional string castkey = 65008;
+	optional string castvalue = 65009;
+
+	optional bool stdtime = 65010;
+	optional bool stdduration = 65011;
+	optional bool wktpointer = 65012;
+
+	optional string castrepeated = 65013;
+}
diff --git a/chain/cosmos/proto/type.proto b/chain/cosmos/proto/type.proto
new file mode 100644
index 0000000..19db384
--- /dev/null
+++ b/chain/cosmos/proto/type.proto
@@ -0,0 +1,353 @@
+syntax = "proto3";
+
+package sf.cosmos.type.v1;
+
+option go_package = "github.com/figment-networks/proto-cosmos/pb/sf/cosmos/type/v1;pbcosmos";
+
+import "google/protobuf/descriptor.proto";
+import "google/protobuf/any.proto";
+import "gogoproto/gogo.proto";
+import "cosmos_proto/cosmos.proto";
+import "firehose/annotations.proto";
+
+message Block {
+  Header header = 1 [(firehose.required) = true, (gogoproto.nullable) = false];
+  EvidenceList evidence = 2 [(gogoproto.nullable) = false];
+  Commit last_commit = 3;
+  ResponseBeginBlock result_begin_block = 4 [(firehose.required) = true];
+  ResponseEndBlock result_end_block = 5 [(firehose.required) = true];
+  repeated TxResult transactions = 7;
+  repeated Validator validator_updates = 8;
+}
+
+// HeaderOnlyBlock is a standard [Block] structure where all other fields are
+// removed so that hydrating that object from a [Block] bytes payload will
+// drastically reduce allocated memory required to hold the full block.
+//
+// This can be used to unpack a [Block] when only the [Header] information
+// is required and greatly reduce required memory.
+message HeaderOnlyBlock {
+  Header header = 1 [(firehose.required) = true, (gogoproto.nullable) = false];
+}
+
+message EventData {
+  Event event = 1 [(firehose.required) = true];
+  HeaderOnlyBlock block = 2 [(firehose.required) = true];
+}
+
+message TransactionData {
+  TxResult tx = 1 [(firehose.required) = true];
+  HeaderOnlyBlock block = 2 [(firehose.required) = true];
+}
+
+message Header {
+  Consensus version = 1 [(gogoproto.nullable) = false];
+  string chain_id = 2 [(gogoproto.customname) = "ChainID"];
+  uint64 height = 3;
+  Timestamp time = 4 [(gogoproto.nullable) = false, (gogoproto.stdtime) = true];
+  BlockID last_block_id = 5 [(firehose.required) = true, (gogoproto.nullable) = false];
+  bytes last_commit_hash = 6;
+  bytes data_hash = 7;
+  bytes validators_hash = 8;
+  bytes next_validators_hash = 9;
+  bytes consensus_hash = 10;
+  bytes app_hash = 11;
+  bytes last_results_hash = 12;
+  bytes evidence_hash = 13;
+  bytes proposer_address = 14;
+  bytes hash = 15;
+}
+
+message Consensus {
+  option (gogoproto.equal) = true;
+
+  uint64 block = 1;
+  uint64 app = 2;
+}
+
+message Timestamp {
+  int64 seconds = 1;
+  int32 nanos = 2;
+}
+
+message BlockID {
+  bytes hash = 1;
+  PartSetHeader part_set_header = 2 [(gogoproto.nullable) = false];
+}
+
+message PartSetHeader {
+  uint32 total = 1;
+  bytes hash = 2;
+}
+
+message EvidenceList {
+  repeated Evidence evidence = 1 [(gogoproto.nullable) = false];
+}
+
+message Evidence {
+  oneof sum {
+    DuplicateVoteEvidence duplicate_vote_evidence = 1;
+    LightClientAttackEvidence light_client_attack_evidence = 2;
+  }
+}
+
+message DuplicateVoteEvidence {
+  EventVote vote_a = 1;
+  EventVote vote_b = 2;
+  int64 total_voting_power = 3;
+  int64 validator_power = 4;
+  Timestamp timestamp = 5 [(gogoproto.nullable) = false, (gogoproto.stdtime) = true];
+}
+
+message EventVote {
+  SignedMsgType event_vote_type = 1 [json_name = "type"];
+  uint64 height = 2;
+  int32 round = 3;
+  BlockID block_id = 4 [(gogoproto.nullable) = false, (gogoproto.customname) = "BlockID"];
+  Timestamp timestamp = 5 [(gogoproto.nullable) = false, (gogoproto.stdtime) = true];
+  bytes validator_address = 6;
+  int32 validator_index = 7;
+  bytes signature = 8;
+}
+
+enum SignedMsgType {
+  option (gogoproto.goproto_enum_stringer) = true;
+  option (gogoproto.goproto_enum_prefix) = false;
+
+  SIGNED_MSG_TYPE_UNKNOWN = 0 [(gogoproto.enumvalue_customname) = "UnknownType"];
+  SIGNED_MSG_TYPE_PREVOTE = 1 [(gogoproto.enumvalue_customname) = "PrevoteType"];
+  SIGNED_MSG_TYPE_PRECOMMIT = 2 [(gogoproto.enumvalue_customname) = "PrecommitType"];
+  SIGNED_MSG_TYPE_PROPOSAL = 32 [(gogoproto.enumvalue_customname) = "ProposalType"];
+}
+
+message LightClientAttackEvidence {
+  LightBlock conflicting_block = 1;
+  int64 common_height = 2;
+  repeated Validator byzantine_validators = 3;
+  int64 total_voting_power = 4;
+  Timestamp timestamp = 5 [(gogoproto.nullable) = false, (gogoproto.stdtime) = true];
+}
+
+message LightBlock {
+  SignedHeader signed_header = 1;
+  ValidatorSet validator_set = 2;
+}
+
+message SignedHeader {
+  Header header = 1;
+  Commit commit = 2;
+}
+
+message Commit {
+  int64 height = 1;
+  int32 round = 2;
+  BlockID block_id = 3 [(gogoproto.nullable) = false, (gogoproto.customname) = "BlockID"];
+  repeated CommitSig signatures = 4 [(gogoproto.nullable) = false];
+}
+
+message CommitSig {
+  BlockIDFlag block_id_flag = 1;
+  bytes validator_address = 2;
+  Timestamp timestamp = 3 [(gogoproto.nullable) = false, (gogoproto.stdtime) = true];
+  bytes signature = 4;
+}
+
+enum BlockIDFlag {
+  option (gogoproto.goproto_enum_stringer) = true;
+  option (gogoproto.goproto_enum_prefix) = false;
+
+  BLOCK_ID_FLAG_UNKNOWN = 0 [(gogoproto.enumvalue_customname) = "BlockIDFlagUnknown"];
+  BLOCK_ID_FLAG_ABSENT = 1 [(gogoproto.enumvalue_customname) = "BlockIDFlagAbsent"];
+  BLOCK_ID_FLAG_COMMIT = 2 [(gogoproto.enumvalue_customname) = "BlockIDFlagCommit"];
+  BLOCK_ID_FLAG_NIL = 3 [(gogoproto.enumvalue_customname) = "BlockIDFlagNil"];
+}
+
+message ValidatorSet {
+  repeated Validator validators = 1;
+  Validator proposer = 2;
+  int64 total_voting_power = 3;
+}
+
+message Validator {
+  bytes address = 1;
+  PublicKey pub_key = 2 [(gogoproto.nullable) = false];
+  int64 voting_power = 3;
+  int64 proposer_priority = 4;
+}
+
+message PublicKey {
+  option (gogoproto.compare) = true;
+  option (gogoproto.equal) = true;
+
+  oneof sum {
+    bytes ed25519 = 1;
+    bytes secp256k1 = 2;
+  }
+}
+
+message ResponseBeginBlock {
+  repeated Event events = 1 [(gogoproto.nullable) = false, (gogoproto.jsontag) = "events,omitempty"];
+}
+
+message Event {
+  string event_type = 1 [json_name = "type"];
+  repeated EventAttribute attributes = 2 [(gogoproto.nullable) = false, (gogoproto.jsontag) = "attributes,omitempty"];
+}
+
+message EventAttribute {
+  string key = 1;
+  string value = 2;
+  bool index = 3;
+}
+
+message ResponseEndBlock {
+  repeated ValidatorUpdate validator_updates = 1;
+  ConsensusParams consensus_param_updates = 2;
+  repeated Event events = 3;
+}
+
+message ValidatorUpdate {
+  bytes address = 1;
+  PublicKey pub_key = 2 [(gogoproto.nullable) = false];
+  int64 power = 3;
+}
+
+message ConsensusParams {
+  BlockParams block = 1 [(gogoproto.nullable) = false];
+  EvidenceParams evidence = 2 [(gogoproto.nullable) = false];
+  ValidatorParams validator = 3 [(gogoproto.nullable) = false];
+  VersionParams version = 4 [(gogoproto.nullable) = false];
+}
+
+message BlockParams {
+  int64 max_bytes = 1;
+  int64 max_gas = 2;
+}
+
+message EvidenceParams {
+  int64 max_age_num_blocks = 1;
+  Duration max_age_duration = 2 [(gogoproto.nullable) = false, (gogoproto.stdduration) = true];
+  int64 max_bytes = 3;
+}
+
+message Duration {
+  int64 seconds = 1;
+  int32 nanos = 2;
+}
+
+message ValidatorParams {
+  option (gogoproto.populate) = true;
+  option (gogoproto.equal) = true;
+
+  repeated string pub_key_types = 1;
+}
+
+message VersionParams {
+  option (gogoproto.populate) = true;
+  option (gogoproto.equal) = true;
+
+  uint64 app_version = 1;
+}
+
+message TxResult {
+  uint64 height = 1;
+  uint32 index = 2;
+  Tx tx = 3 [(firehose.required) = true];
+  ResponseDeliverTx result = 4 [(firehose.required) = true];
+  bytes hash = 5;
+}
+
+message Tx {
+  TxBody body = 1 [(firehose.required) = true];
+  AuthInfo auth_info = 2;
+  repeated bytes signatures = 3;
+}
+
+message TxBody {
+  repeated google.protobuf.Any messages = 1;
+  string memo = 2;
+  uint64 timeout_height = 3;
+  repeated google.protobuf.Any extension_options = 1023;
+  repeated google.protobuf.Any non_critical_extension_options = 2047;
+}
+
+message Any {
+  string type_url = 1;
+  bytes value = 2;
+}
+
+message AuthInfo {
+  repeated SignerInfo signer_infos = 1;
+  Fee fee = 2;
+  Tip tip = 3;
+}
+
+message SignerInfo {
+  google.protobuf.Any public_key = 1;
+  ModeInfo mode_info = 2;
+  uint64 sequence = 3;
+}
+
+message ModeInfo {
+  oneof sum {
+    ModeInfoSingle single = 1;
+    ModeInfoMulti multi = 2;
+  }
+}
+
+message ModeInfoSingle {
+  SignMode mode = 1;
+}
+
+enum SignMode {
+  SIGN_MODE_UNSPECIFIED = 0;
+  SIGN_MODE_DIRECT = 1;
+  SIGN_MODE_TEXTUAL = 2;
+  SIGN_MODE_LEGACY_AMINO_JSON = 127;
+}
+
+message ModeInfoMulti {
+  CompactBitArray bitarray = 1;
+  repeated ModeInfo mode_infos = 2;
+}
+
+message CompactBitArray {
+  option (gogoproto.goproto_stringer) = false;
+
+  uint32 extra_bits_stored = 1;
+  bytes elems = 2;
+}
+
+message Fee {
+  repeated Coin amount = 1 [(gogoproto.nullable) = false, (gogoproto.castrepeated) = "github.com/cosmos/cosmos-sdk/types.Coins"];
+  uint64 gas_limit = 2;
+  string payer = 3 [(cosmos_proto.scalar) = "cosmos.AddressString"];
+  string granter = 4 [(cosmos_proto.scalar) = "cosmos.AddressString"];
+}
+
+message Coin {
+  option (gogoproto.equal) = true;
+
+  string denom = 1;
+  string amount = 2 [(gogoproto.customtype) = "Int", (gogoproto.nullable) = false];
+}
+
+message Tip {
+  repeated Coin amount = 1 [(gogoproto.nullable) = false, (gogoproto.castrepeated) = "github.com/cosmos/cosmos-sdk/types.Coins"];
+  string tipper = 2 [(cosmos_proto.scalar) = "cosmos.AddressString"];
+}
+
+message ResponseDeliverTx {
+  uint32 code = 1;
+  bytes data = 2;
+  string log = 3;
+  string info = 4;
+  int64 gas_wanted = 5;
+  int64 gas_used = 6;
+  repeated Event events = 7 [(gogoproto.nullable) = false, (gogoproto.jsontag) = "events,omitempty"];
+  string codespace = 8;
+}
+
+message ValidatorSetUpdates {
+  repeated Validator validator_updates = 1;
+}
diff --git a/chain/cosmos/src/adapter.rs b/chain/cosmos/src/adapter.rs
new file mode 100644
index 0000000..d73b8b0
--- /dev/null
+++ b/chain/cosmos/src/adapter.rs
@@ -0,0 +1,160 @@
+use std::collections::HashSet;
+
+use prost::Message;
+use prost_types::Any;
+
+use crate::capabilities::NodeCapabilities;
+use crate::{data_source::DataSource, Chain};
+use graph::blockchain as bc;
+use graph::firehose::EventTypeFilter;
+use graph::prelude::*;
+
+const EVENT_TYPE_FILTER_TYPE_URL: &str =
+    "type.googleapis.com/sf.cosmos.transform.v1.EventTypeFilter";
+
+#[derive(Clone, Debug, Default)]
+pub struct TriggerFilter {
+    pub(crate) event_type_filter: CosmosEventTypeFilter,
+    pub(crate) block_filter: CosmosBlockFilter,
+}
+
+impl bc::TriggerFilter<Chain> for TriggerFilter {
+    fn extend<'a>(&mut self, data_sources: impl Iterator<Item = &'a DataSource> + Clone) {
+        self.event_type_filter
+            .extend_from_data_sources(data_sources.clone());
+        self.block_filter.extend_from_data_sources(data_sources);
+    }
+
+    fn node_capabilities(&self) -> NodeCapabilities {
+        NodeCapabilities {}
+    }
+
+    fn extend_with_template(
+        &mut self,
+        _data_source: impl Iterator<Item = <Chain as bc::Blockchain>::DataSourceTemplate>,
+    ) {
+    }
+
+    fn to_firehose_filter(self) -> Vec<prost_types::Any> {
+        if self.block_filter.trigger_every_block {
+            return vec![];
+        }
+
+        if self.event_type_filter.event_types.is_empty() {
+            return vec![];
+        }
+
+        let filter = EventTypeFilter {
+            event_types: Vec::from_iter(self.event_type_filter.event_types),
+        };
+
+        vec![Any {
+            type_url: EVENT_TYPE_FILTER_TYPE_URL.to_string(),
+            value: filter.encode_to_vec(),
+        }]
+    }
+}
+
+pub type EventType = String;
+
+#[derive(Clone, Debug, Default)]
+pub(crate) struct CosmosEventTypeFilter {
+    pub event_types: HashSet<EventType>,
+}
+
+impl CosmosEventTypeFilter {
+    pub(crate) fn matches(&self, event_type: &EventType) -> bool {
+        self.event_types.contains(event_type)
+    }
+
+    fn extend_from_data_sources<'a>(&mut self, data_sources: impl Iterator<Item = &'a DataSource>) {
+        self.event_types.extend(
+            data_sources.flat_map(|data_source| data_source.events().map(ToString::to_string)),
+        );
+    }
+}
+
+#[derive(Clone, Debug, Default)]
+pub(crate) struct CosmosBlockFilter {
+    pub trigger_every_block: bool,
+}
+
+impl CosmosBlockFilter {
+    fn extend_from_data_sources<'a>(
+        &mut self,
+        mut data_sources: impl Iterator<Item = &'a DataSource>,
+    ) {
+        if !self.trigger_every_block {
+            self.trigger_every_block = data_sources.any(DataSource::has_block_handler);
+        }
+    }
+}
+
+#[cfg(test)]
+mod test {
+    use graph::blockchain::TriggerFilter as _;
+
+    use super::*;
+
+    #[test]
+    fn test_trigger_filters() {
+        let cases = [
+            (TriggerFilter::test_new(false, &[]), None),
+            (TriggerFilter::test_new(true, &[]), None),
+            (TriggerFilter::test_new(true, &["event_1", "event_2"]), None),
+            (
+                TriggerFilter::test_new(false, &["event_1", "event_2", "event_3"]),
+                Some(event_type_filter_with(&["event_1", "event_2", "event_3"])),
+            ),
+        ];
+
+        for (trigger_filter, expected_filter) in cases {
+            let firehose_filter = trigger_filter.to_firehose_filter();
+            let decoded_filter = decode_filter(firehose_filter);
+
+            assert_eq!(decoded_filter.is_some(), expected_filter.is_some());
+
+            if let (Some(mut expected_filter), Some(mut decoded_filter)) =
+                (expected_filter, decoded_filter)
+            {
+                // event types may be in different order
+                expected_filter.event_types.sort();
+                decoded_filter.event_types.sort();
+
+                assert_eq!(decoded_filter, expected_filter);
+            }
+        }
+    }
+
+    impl TriggerFilter {
+        pub(crate) fn test_new(trigger_every_block: bool, event_types: &[&str]) -> TriggerFilter {
+            TriggerFilter {
+                event_type_filter: CosmosEventTypeFilter {
+                    event_types: event_types.iter().map(ToString::to_string).collect(),
+                },
+                block_filter: CosmosBlockFilter {
+                    trigger_every_block,
+                },
+            }
+        }
+    }
+
+    fn event_type_filter_with(event_types: &[&str]) -> EventTypeFilter {
+        EventTypeFilter {
+            event_types: event_types.iter().map(ToString::to_string).collect(),
+        }
+    }
+
+    fn decode_filter(proto_filters: Vec<Any>) -> Option<EventTypeFilter> {
+        assert!(proto_filters.len() <= 1);
+
+        let proto_filter = proto_filters.get(0)?;
+
+        assert_eq!(proto_filter.type_url, EVENT_TYPE_FILTER_TYPE_URL);
+
+        let firehose_filter = EventTypeFilter::decode(&*proto_filter.value)
+            .expect("Could not decode EventTypeFilter from protobuf Any");
+
+        Some(firehose_filter)
+    }
+}
diff --git a/chain/cosmos/src/capabilities.rs b/chain/cosmos/src/capabilities.rs
new file mode 100644
index 0000000..8905812
--- /dev/null
+++ b/chain/cosmos/src/capabilities.rs
@@ -0,0 +1,33 @@
+use std::cmp::PartialOrd;
+use std::fmt;
+use std::str::FromStr;
+
+use anyhow::Error;
+use graph::impl_slog_value;
+
+use crate::DataSource;
+
+#[derive(Clone, Copy, Debug, PartialEq, Eq, PartialOrd)]
+pub struct NodeCapabilities {}
+
+impl FromStr for NodeCapabilities {
+    type Err = Error;
+
+    fn from_str(_s: &str) -> Result<Self, Self::Err> {
+        Ok(NodeCapabilities {})
+    }
+}
+
+impl fmt::Display for NodeCapabilities {
+    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
+        f.write_str("cosmos")
+    }
+}
+
+impl_slog_value!(NodeCapabilities, "{}");
+
+impl graph::blockchain::NodeCapabilities<crate::Chain> for NodeCapabilities {
+    fn from_data_sources(_data_sources: &[DataSource]) -> Self {
+        NodeCapabilities {}
+    }
+}
diff --git a/chain/cosmos/src/chain.rs b/chain/cosmos/src/chain.rs
new file mode 100644
index 0000000..9e62546
--- /dev/null
+++ b/chain/cosmos/src/chain.rs
@@ -0,0 +1,581 @@
+use std::sync::Arc;
+
+use graph::blockchain::block_stream::FirehoseCursor;
+use graph::cheap_clone::CheapClone;
+use graph::data::subgraph::UnifiedMappingApiVersion;
+use graph::prelude::MetricsRegistry;
+use graph::{
+    anyhow::anyhow,
+    blockchain::{
+        block_stream::{
+            BlockStream, BlockStreamEvent, BlockWithTriggers, FirehoseError,
+            FirehoseMapper as FirehoseMapperTrait, TriggersAdapter as TriggersAdapterTrait,
+        },
+        firehose_block_stream::FirehoseBlockStream,
+        Block as _, BlockHash, BlockPtr, Blockchain, BlockchainKind, IngestorError,
+        RuntimeAdapter as RuntimeAdapterTrait,
+    },
+    components::store::DeploymentLocator,
+    firehose::{self, FirehoseEndpoint, FirehoseEndpoints, ForkStep},
+    prelude::{async_trait, o, BlockNumber, ChainStore, Error, Logger, LoggerFactory},
+};
+use prost::Message;
+
+use crate::capabilities::NodeCapabilities;
+use crate::data_source::{
+    DataSource, DataSourceTemplate, EventOrigin, UnresolvedDataSource, UnresolvedDataSourceTemplate,
+};
+use crate::trigger::CosmosTrigger;
+use crate::RuntimeAdapter;
+use crate::{codec, TriggerFilter};
+
+pub struct Chain {
+    logger_factory: LoggerFactory,
+    name: String,
+    firehose_endpoints: Arc<FirehoseEndpoints>,
+    chain_store: Arc<dyn ChainStore>,
+    metrics_registry: Arc<dyn MetricsRegistry>,
+}
+
+impl std::fmt::Debug for Chain {
+    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
+        write!(f, "chain: cosmos")
+    }
+}
+
+impl Chain {
+    pub fn new(
+        logger_factory: LoggerFactory,
+        name: String,
+        chain_store: Arc<dyn ChainStore>,
+        firehose_endpoints: FirehoseEndpoints,
+        metrics_registry: Arc<dyn MetricsRegistry>,
+    ) -> Self {
+        Chain {
+            logger_factory,
+            name,
+            firehose_endpoints: Arc::new(firehose_endpoints),
+            chain_store,
+            metrics_registry,
+        }
+    }
+}
+
+#[async_trait]
+impl Blockchain for Chain {
+    const KIND: BlockchainKind = BlockchainKind::Cosmos;
+
+    type Block = codec::Block;
+
+    type DataSource = DataSource;
+
+    type UnresolvedDataSource = UnresolvedDataSource;
+
+    type DataSourceTemplate = DataSourceTemplate;
+
+    type UnresolvedDataSourceTemplate = UnresolvedDataSourceTemplate;
+
+    type TriggerData = CosmosTrigger;
+
+    type MappingTrigger = CosmosTrigger;
+
+    type TriggerFilter = TriggerFilter;
+
+    type NodeCapabilities = NodeCapabilities;
+
+    fn triggers_adapter(
+        &self,
+        _loc: &DeploymentLocator,
+        _capabilities: &Self::NodeCapabilities,
+        _unified_api_version: UnifiedMappingApiVersion,
+    ) -> Result<Arc<dyn TriggersAdapterTrait<Self>>, Error> {
+        let adapter = TriggersAdapter {};
+        Ok(Arc::new(adapter))
+    }
+
+    async fn new_firehose_block_stream(
+        &self,
+        deployment: DeploymentLocator,
+        block_cursor: FirehoseCursor,
+        start_blocks: Vec<BlockNumber>,
+        subgraph_current_block: Option<BlockPtr>,
+        filter: Arc<Self::TriggerFilter>,
+        unified_api_version: UnifiedMappingApiVersion,
+    ) -> Result<Box<dyn BlockStream<Self>>, Error> {
+        let adapter = self
+            .triggers_adapter(&deployment, &NodeCapabilities {}, unified_api_version)
+            .unwrap_or_else(|_| panic!("no adapter for network {}", self.name));
+
+        let firehose_endpoint = match self.firehose_endpoints.random() {
+            Some(e) => e.clone(),
+            None => return Err(anyhow!("no firehose endpoint available",)),
+        };
+
+        let logger = self
+            .logger_factory
+            .subgraph_logger(&deployment)
+            .new(o!("component" => "FirehoseBlockStream"));
+
+        let firehose_mapper = Arc::new(FirehoseMapper {
+            endpoint: firehose_endpoint.cheap_clone(),
+        });
+
+        Ok(Box::new(FirehoseBlockStream::new(
+            deployment.hash,
+            firehose_endpoint,
+            subgraph_current_block,
+            block_cursor,
+            firehose_mapper,
+            adapter,
+            filter,
+            start_blocks,
+            logger,
+            self.metrics_registry.clone(),
+        )))
+    }
+
+    async fn new_polling_block_stream(
+        &self,
+        _deployment: DeploymentLocator,
+        _start_blocks: Vec<BlockNumber>,
+        _subgraph_start_block: Option<BlockPtr>,
+        _filter: Arc<Self::TriggerFilter>,
+        _unified_api_version: UnifiedMappingApiVersion,
+    ) -> Result<Box<dyn BlockStream<Self>>, Error> {
+        panic!("Cosmos does not support polling block stream")
+    }
+
+    fn chain_store(&self) -> Arc<dyn ChainStore> {
+        self.chain_store.cheap_clone()
+    }
+
+    async fn block_pointer_from_number(
+        &self,
+        logger: &Logger,
+        number: BlockNumber,
+    ) -> Result<BlockPtr, IngestorError> {
+        let firehose_endpoint = match self.firehose_endpoints.random() {
+            Some(e) => e.clone(),
+            None => return Err(anyhow!("no firehose endpoint available").into()),
+        };
+
+        firehose_endpoint
+            .block_ptr_for_number::<codec::HeaderOnlyBlock>(logger, number)
+            .await
+            .map_err(Into::into)
+    }
+
+    fn runtime_adapter(&self) -> Arc<dyn RuntimeAdapterTrait<Self>> {
+        Arc::new(RuntimeAdapter {})
+    }
+
+    fn is_firehose_supported(&self) -> bool {
+        true
+    }
+}
+
+pub struct TriggersAdapter {}
+
+#[async_trait]
+impl TriggersAdapterTrait<Chain> for TriggersAdapter {
+    async fn scan_triggers(
+        &self,
+        _from: BlockNumber,
+        _to: BlockNumber,
+        _filter: &TriggerFilter,
+    ) -> Result<Vec<BlockWithTriggers<Chain>>, Error> {
+        panic!("Should never be called since not used by FirehoseBlockStream")
+    }
+
+    async fn triggers_in_block(
+        &self,
+        _logger: &Logger,
+        block: codec::Block,
+        filter: &TriggerFilter,
+    ) -> Result<BlockWithTriggers<Chain>, Error> {
+        let shared_block = Arc::new(block.clone());
+
+        let header_only_block = codec::HeaderOnlyBlock::from(&block);
+
+        let mut triggers: Vec<_> = shared_block
+            .begin_block_events()?
+            .cloned()
+            // FIXME (Cosmos): Optimize. Should use an Arc instead of cloning the
+            // block. This is not currently possible because EventData is automatically
+            // generated.
+            .filter_map(|event| {
+                filter_event_trigger(filter, event, &header_only_block, EventOrigin::BeginBlock)
+            })
+            .chain(shared_block.tx_events()?.cloned().filter_map(|event| {
+                filter_event_trigger(filter, event, &header_only_block, EventOrigin::DeliverTx)
+            }))
+            .chain(
+                shared_block
+                    .end_block_events()?
+                    .cloned()
+                    .filter_map(|event| {
+                        filter_event_trigger(
+                            filter,
+                            event,
+                            &header_only_block,
+                            EventOrigin::EndBlock,
+                        )
+                    }),
+            )
+            .collect();
+
+        triggers.extend(
+            shared_block
+                .transactions()
+                .cloned()
+                .map(|tx| CosmosTrigger::with_transaction(tx, header_only_block.clone())),
+        );
+
+        if filter.block_filter.trigger_every_block {
+            triggers.push(CosmosTrigger::Block(shared_block.cheap_clone()));
+        }
+
+        Ok(BlockWithTriggers::new(block, triggers))
+    }
+
+    async fn is_on_main_chain(&self, _ptr: BlockPtr) -> Result<bool, Error> {
+        panic!("Should never be called since not used by FirehoseBlockStream")
+    }
+
+    async fn ancestor_block(
+        &self,
+        _ptr: BlockPtr,
+        _offset: BlockNumber,
+    ) -> Result<Option<codec::Block>, Error> {
+        panic!("Should never be called since not used by FirehoseBlockStream")
+    }
+
+    /// Panics if `block` is genesis.
+    /// But that's ok since this is only called when reverting `block`.
+    async fn parent_ptr(&self, block: &BlockPtr) -> Result<Option<BlockPtr>, Error> {
+        Ok(Some(BlockPtr {
+            hash: BlockHash::from(vec![0xff; 32]),
+            number: block.number.saturating_sub(1),
+        }))
+    }
+}
+
+/// Returns a new event trigger only if the given event matches the event filter.
+fn filter_event_trigger(
+    filter: &TriggerFilter,
+    event: codec::Event,
+    block: &codec::HeaderOnlyBlock,
+    origin: EventOrigin,
+) -> Option<CosmosTrigger> {
+    if filter.event_type_filter.matches(&event.event_type) {
+        Some(CosmosTrigger::with_event(event, block.clone(), origin))
+    } else {
+        None
+    }
+}
+
+pub struct FirehoseMapper {
+    endpoint: Arc<FirehoseEndpoint>,
+}
+
+#[async_trait]
+impl FirehoseMapperTrait<Chain> for FirehoseMapper {
+    async fn to_block_stream_event(
+        &self,
+        logger: &Logger,
+        response: &firehose::Response,
+        adapter: &Arc<dyn TriggersAdapterTrait<Chain>>,
+        filter: &TriggerFilter,
+    ) -> Result<BlockStreamEvent<Chain>, FirehoseError> {
+        let step = ForkStep::from_i32(response.step).unwrap_or_else(|| {
+            panic!(
+                "unknown step i32 value {}, maybe you forgot update & re-regenerate the protobuf definitions?",
+                response.step
+            )
+        });
+
+        let any_block = response
+            .block
+            .as_ref()
+            .expect("block payload information should always be present");
+
+        // Right now, this is done in all cases but in reality, with how the BlockStreamEvent::Revert
+        // is defined right now, only block hash and block number is necessary. However, this information
+        // is not part of the actual bstream::BlockResponseV2 payload. As such, we need to decode the full
+        // block which is useless.
+        //
+        // Check about adding basic information about the block in the bstream::BlockResponseV2 or maybe
+        // define a slimmed down struct that would decode only a few fields and ignore all the rest.
+        let sp = codec::Block::decode(any_block.value.as_ref())?;
+
+        match step {
+            ForkStep::StepNew => Ok(BlockStreamEvent::ProcessBlock(
+                adapter.triggers_in_block(logger, sp, filter).await?,
+                FirehoseCursor::from(response.cursor.clone()),
+            )),
+
+            ForkStep::StepUndo => {
+                let parent_ptr = sp
+                    .parent_ptr()
+                    .map_err(FirehoseError::from)?
+                    .expect("Genesis block should never be reverted");
+
+                Ok(BlockStreamEvent::Revert(
+                    parent_ptr,
+                    FirehoseCursor::from(response.cursor.clone()),
+                ))
+            }
+
+            ForkStep::StepIrreversible => {
+                panic!("irreversible step is not handled and should not be requested in the Firehose request")
+            }
+
+            ForkStep::StepUnknown => {
+                panic!("unknown step should not happen in the Firehose response")
+            }
+        }
+    }
+
+    async fn block_ptr_for_number(
+        &self,
+        logger: &Logger,
+        number: BlockNumber,
+    ) -> Result<BlockPtr, Error> {
+        self.endpoint
+            .block_ptr_for_number::<codec::HeaderOnlyBlock>(logger, number)
+            .await
+    }
+
+    async fn final_block_ptr_for(
+        &self,
+        logger: &Logger,
+        block: &codec::Block,
+    ) -> Result<BlockPtr, Error> {
+        // Cosmos provides instant block finality.
+        self.endpoint
+            .block_ptr_for_number::<codec::HeaderOnlyBlock>(logger, block.number())
+            .await
+    }
+}
+
+#[cfg(test)]
+mod test {
+    use graph::prelude::{
+        slog::{o, Discard, Logger},
+        tokio,
+    };
+
+    use super::*;
+
+    use codec::{
+        Block, Event, Header, HeaderOnlyBlock, ResponseBeginBlock, ResponseDeliverTx,
+        ResponseEndBlock, TxResult,
+    };
+
+    #[tokio::test]
+    async fn test_trigger_filters() {
+        let adapter = TriggersAdapter {};
+        let logger = Logger::root(Discard, o!());
+
+        let block_with_events = Block::test_with_event_types(
+            vec!["begin_event_1", "begin_event_2", "begin_event_3"],
+            vec!["tx_event_1", "tx_event_2", "tx_event_3"],
+            vec!["end_event_1", "end_event_2", "end_event_3"],
+        );
+
+        let header_only_block = HeaderOnlyBlock::from(&block_with_events);
+
+        let cases = [
+            (
+                Block::test_new(),
+                TriggerFilter::test_new(false, &[]),
+                vec![],
+            ),
+            (
+                Block::test_new(),
+                TriggerFilter::test_new(true, &[]),
+                vec![CosmosTrigger::Block(Arc::new(Block::test_new()))],
+            ),
+            (
+                Block::test_new(),
+                TriggerFilter::test_new(false, &["event_1", "event_2", "event_3"]),
+                vec![],
+            ),
+            (
+                block_with_events.clone(),
+                TriggerFilter::test_new(false, &["begin_event_3", "tx_event_3", "end_event_3"]),
+                vec![
+                    CosmosTrigger::with_event(
+                        Event::test_with_type("begin_event_3"),
+                        header_only_block.clone(),
+                        EventOrigin::BeginBlock,
+                    ),
+                    CosmosTrigger::with_event(
+                        Event::test_with_type("tx_event_3"),
+                        header_only_block.clone(),
+                        EventOrigin::DeliverTx,
+                    ),
+                    CosmosTrigger::with_event(
+                        Event::test_with_type("end_event_3"),
+                        header_only_block.clone(),
+                        EventOrigin::EndBlock,
+                    ),
+                    CosmosTrigger::with_transaction(
+                        TxResult::test_with_event_type("tx_event_1"),
+                        header_only_block.clone(),
+                    ),
+                    CosmosTrigger::with_transaction(
+                        TxResult::test_with_event_type("tx_event_2"),
+                        header_only_block.clone(),
+                    ),
+                    CosmosTrigger::with_transaction(
+                        TxResult::test_with_event_type("tx_event_3"),
+                        header_only_block.clone(),
+                    ),
+                ],
+            ),
+            (
+                block_with_events.clone(),
+                TriggerFilter::test_new(true, &["begin_event_3", "tx_event_2", "end_event_1"]),
+                vec![
+                    CosmosTrigger::Block(Arc::new(block_with_events.clone())),
+                    CosmosTrigger::with_event(
+                        Event::test_with_type("begin_event_3"),
+                        header_only_block.clone(),
+                        EventOrigin::BeginBlock,
+                    ),
+                    CosmosTrigger::with_event(
+                        Event::test_with_type("tx_event_2"),
+                        header_only_block.clone(),
+                        EventOrigin::DeliverTx,
+                    ),
+                    CosmosTrigger::with_event(
+                        Event::test_with_type("end_event_1"),
+                        header_only_block.clone(),
+                        EventOrigin::EndBlock,
+                    ),
+                    CosmosTrigger::with_transaction(
+                        TxResult::test_with_event_type("tx_event_1"),
+                        header_only_block.clone(),
+                    ),
+                    CosmosTrigger::with_transaction(
+                        TxResult::test_with_event_type("tx_event_2"),
+                        header_only_block.clone(),
+                    ),
+                    CosmosTrigger::with_transaction(
+                        TxResult::test_with_event_type("tx_event_3"),
+                        header_only_block.clone(),
+                    ),
+                ],
+            ),
+        ];
+
+        for (block, trigger_filter, expected_triggers) in cases {
+            let triggers = adapter
+                .triggers_in_block(&logger, block, &trigger_filter)
+                .await
+                .expect("failed to get triggers in block");
+
+            assert_eq!(
+                triggers.trigger_data.len(),
+                expected_triggers.len(),
+                "Expected trigger list to contain exactly {:?}, but it didn't: {:?}",
+                expected_triggers,
+                triggers.trigger_data
+            );
+
+            // they may not be in the same order
+            for trigger in expected_triggers {
+                assert!(
+                    triggers.trigger_data.contains(&trigger),
+                    "Expected trigger list to contain {:?}, but it only contains: {:?}",
+                    trigger,
+                    triggers.trigger_data
+                );
+            }
+        }
+    }
+
+    impl Block {
+        fn test_new() -> Block {
+            Block::test_with_event_types(vec![], vec![], vec![])
+        }
+
+        fn test_with_event_types(
+            begin_event_types: Vec<&str>,
+            tx_event_types: Vec<&str>,
+            end_event_types: Vec<&str>,
+        ) -> Block {
+            Block {
+                header: Some(Header {
+                    version: None,
+                    chain_id: "test".to_string(),
+                    height: 1,
+                    time: None,
+                    last_block_id: None,
+                    last_commit_hash: vec![],
+                    data_hash: vec![],
+                    validators_hash: vec![],
+                    next_validators_hash: vec![],
+                    consensus_hash: vec![],
+                    app_hash: vec![],
+                    last_results_hash: vec![],
+                    evidence_hash: vec![],
+                    proposer_address: vec![],
+                    hash: vec![],
+                }),
+                evidence: None,
+                last_commit: None,
+                result_begin_block: Some(ResponseBeginBlock {
+                    events: begin_event_types
+                        .into_iter()
+                        .map(Event::test_with_type)
+                        .collect(),
+                }),
+                result_end_block: Some(ResponseEndBlock {
+                    validator_updates: vec![],
+                    consensus_param_updates: None,
+                    events: end_event_types
+                        .into_iter()
+                        .map(Event::test_with_type)
+                        .collect(),
+                }),
+                transactions: tx_event_types
+                    .into_iter()
+                    .map(TxResult::test_with_event_type)
+                    .collect(),
+                validator_updates: vec![],
+            }
+        }
+    }
+
+    impl Event {
+        fn test_with_type(event_type: &str) -> Event {
+            Event {
+                event_type: event_type.to_string(),
+                attributes: vec![],
+            }
+        }
+    }
+
+    impl TxResult {
+        fn test_with_event_type(event_type: &str) -> TxResult {
+            TxResult {
+                height: 1,
+                index: 1,
+                tx: None,
+                result: Some(ResponseDeliverTx {
+                    code: 1,
+                    data: vec![],
+                    log: "".to_string(),
+                    info: "".to_string(),
+                    gas_wanted: 1,
+                    gas_used: 1,
+                    codespace: "".to_string(),
+                    events: vec![Event::test_with_type(event_type)],
+                }),
+                hash: vec![],
+            }
+        }
+    }
+}
diff --git a/chain/cosmos/src/codec.rs b/chain/cosmos/src/codec.rs
new file mode 100644
index 0000000..7b2a299
--- /dev/null
+++ b/chain/cosmos/src/codec.rs
@@ -0,0 +1,199 @@
+pub(crate) use crate::protobuf::pbcodec::*;
+
+use graph::blockchain::Block as BlockchainBlock;
+use graph::{
+    blockchain::BlockPtr,
+    prelude::{anyhow::anyhow, BlockNumber, Error},
+};
+
+use std::convert::TryFrom;
+
+impl Block {
+    pub fn header(&self) -> Result<&Header, Error> {
+        self.header
+            .as_ref()
+            .ok_or_else(|| anyhow!("block data missing header field"))
+    }
+
+    pub fn events(&self) -> Result<impl Iterator<Item = &Event>, Error> {
+        let events = self
+            .begin_block_events()?
+            .chain(self.tx_events()?)
+            .chain(self.end_block_events()?);
+
+        Ok(events)
+    }
+
+    pub fn begin_block_events(&self) -> Result<impl Iterator<Item = &Event>, Error> {
+        let events = self
+            .result_begin_block
+            .as_ref()
+            .ok_or_else(|| anyhow!("block data missing result_begin_block field"))?
+            .events
+            .iter();
+
+        Ok(events)
+    }
+
+    pub fn tx_events(&self) -> Result<impl Iterator<Item = &Event>, Error> {
+        if self.transactions.iter().any(|tx| tx.result.is_none()) {
+            return Err(anyhow!("block data transaction missing result field"));
+        }
+
+        let events = self.transactions.iter().flat_map(|tx| {
+            tx.result
+                .as_ref()
+                .map(|b| b.events.iter())
+                .into_iter()
+                .flatten()
+        });
+
+        Ok(events)
+    }
+
+    pub fn end_block_events(&self) -> Result<impl Iterator<Item = &Event>, Error> {
+        let events = self
+            .result_end_block
+            .as_ref()
+            .ok_or_else(|| anyhow!("block data missing result_end_block field"))?
+            .events
+            .iter();
+
+        Ok(events)
+    }
+
+    pub fn transactions(&self) -> impl Iterator<Item = &TxResult> {
+        self.transactions.iter()
+    }
+
+    pub fn parent_ptr(&self) -> Result<Option<BlockPtr>, Error> {
+        let header = self.header()?;
+
+        Ok(header
+            .last_block_id
+            .as_ref()
+            .map(|last_block_id| BlockPtr::from((last_block_id.hash.clone(), header.height - 1))))
+    }
+}
+
+impl TryFrom<Block> for BlockPtr {
+    type Error = Error;
+
+    fn try_from(b: Block) -> Result<BlockPtr, Error> {
+        BlockPtr::try_from(&b)
+    }
+}
+
+impl<'a> TryFrom<&'a Block> for BlockPtr {
+    type Error = Error;
+
+    fn try_from(b: &'a Block) -> Result<BlockPtr, Error> {
+        let header = b.header()?;
+        Ok(BlockPtr::from((header.hash.clone(), header.height)))
+    }
+}
+
+impl BlockchainBlock for Block {
+    fn number(&self) -> i32 {
+        BlockNumber::try_from(self.header().unwrap().height).unwrap()
+    }
+
+    fn ptr(&self) -> BlockPtr {
+        BlockPtr::try_from(self).unwrap()
+    }
+
+    fn parent_ptr(&self) -> Option<BlockPtr> {
+        self.parent_ptr().unwrap()
+    }
+}
+
+impl HeaderOnlyBlock {
+    pub fn header(&self) -> Result<&Header, Error> {
+        self.header
+            .as_ref()
+            .ok_or_else(|| anyhow!("block data missing header field"))
+    }
+
+    pub fn parent_ptr(&self) -> Result<Option<BlockPtr>, Error> {
+        let header = self.header()?;
+
+        Ok(header
+            .last_block_id
+            .as_ref()
+            .map(|last_block_id| BlockPtr::from((last_block_id.hash.clone(), header.height - 1))))
+    }
+}
+
+impl From<&Block> for HeaderOnlyBlock {
+    fn from(b: &Block) -> HeaderOnlyBlock {
+        HeaderOnlyBlock {
+            header: b.header.clone(),
+        }
+    }
+}
+
+impl TryFrom<HeaderOnlyBlock> for BlockPtr {
+    type Error = Error;
+
+    fn try_from(b: HeaderOnlyBlock) -> Result<BlockPtr, Error> {
+        BlockPtr::try_from(&b)
+    }
+}
+
+impl<'a> TryFrom<&'a HeaderOnlyBlock> for BlockPtr {
+    type Error = Error;
+
+    fn try_from(b: &'a HeaderOnlyBlock) -> Result<BlockPtr, Error> {
+        let header = b.header()?;
+
+        Ok(BlockPtr::from((header.hash.clone(), header.height)))
+    }
+}
+
+impl BlockchainBlock for HeaderOnlyBlock {
+    fn number(&self) -> i32 {
+        BlockNumber::try_from(self.header().unwrap().height).unwrap()
+    }
+
+    fn ptr(&self) -> BlockPtr {
+        BlockPtr::try_from(self).unwrap()
+    }
+
+    fn parent_ptr(&self) -> Option<BlockPtr> {
+        self.parent_ptr().unwrap()
+    }
+}
+
+impl EventData {
+    pub fn event(&self) -> Result<&Event, Error> {
+        self.event
+            .as_ref()
+            .ok_or_else(|| anyhow!("event data missing event field"))
+    }
+    pub fn block(&self) -> Result<&HeaderOnlyBlock, Error> {
+        self.block
+            .as_ref()
+            .ok_or_else(|| anyhow!("event data missing block field"))
+    }
+}
+
+impl TransactionData {
+    pub fn tx_result(&self) -> Result<&TxResult, Error> {
+        self.tx
+            .as_ref()
+            .ok_or_else(|| anyhow!("transaction data missing tx field"))
+    }
+
+    pub fn response_deliver_tx(&self) -> Result<&ResponseDeliverTx, Error> {
+        self.tx_result()?
+            .result
+            .as_ref()
+            .ok_or_else(|| anyhow!("transaction data missing result field"))
+    }
+
+    pub fn block(&self) -> Result<&HeaderOnlyBlock, Error> {
+        self.block
+            .as_ref()
+            .ok_or_else(|| anyhow!("transaction data missing block field"))
+    }
+}
diff --git a/chain/cosmos/src/data_source.rs b/chain/cosmos/src/data_source.rs
new file mode 100644
index 0000000..7535a50
--- /dev/null
+++ b/chain/cosmos/src/data_source.rs
@@ -0,0 +1,559 @@
+use std::collections::{HashMap, HashSet};
+use std::{convert::TryFrom, sync::Arc};
+
+use anyhow::{Error, Result};
+
+use graph::{
+    blockchain::{self, Block, Blockchain, TriggerWithHandler},
+    components::store::StoredDynamicDataSource,
+    data::subgraph::DataSourceContext,
+    prelude::{
+        anyhow, async_trait, info, BlockNumber, CheapClone, DataSourceTemplateInfo, Deserialize,
+        Link, LinkResolver, Logger,
+    },
+};
+
+use crate::chain::Chain;
+use crate::codec;
+use crate::trigger::CosmosTrigger;
+
+pub const COSMOS_KIND: &str = "cosmos";
+
+const DYNAMIC_DATA_SOURCE_ERROR: &str = "Cosmos subgraphs do not support dynamic data sources";
+const TEMPLATE_ERROR: &str = "Cosmos subgraphs do not support templates";
+
+/// Runtime representation of a data source.
+// Note: Not great for memory usage that this needs to be `Clone`, considering how there may be tens
+// of thousands of data sources in memory at once.
+#[derive(Clone, Debug)]
+pub struct DataSource {
+    pub kind: String,
+    pub network: Option<String>,
+    pub name: String,
+    pub source: Source,
+    pub mapping: Mapping,
+    pub context: Arc<Option<DataSourceContext>>,
+    pub creation_block: Option<BlockNumber>,
+}
+
+impl blockchain::DataSource<Chain> for DataSource {
+    fn address(&self) -> Option<&[u8]> {
+        None
+    }
+
+    fn start_block(&self) -> BlockNumber {
+        self.source.start_block
+    }
+
+    fn match_and_decode(
+        &self,
+        trigger: &<Chain as Blockchain>::TriggerData,
+        block: &Arc<<Chain as Blockchain>::Block>,
+        _logger: &Logger,
+    ) -> Result<Option<TriggerWithHandler<Chain>>> {
+        if self.source.start_block > block.number() {
+            return Ok(None);
+        }
+
+        let handler = match trigger {
+            CosmosTrigger::Block(_) => match self.handler_for_block() {
+                Some(handler) => handler.handler,
+                None => return Ok(None),
+            },
+
+            CosmosTrigger::Event { event_data, origin } => {
+                match self.handler_for_event(event_data.event()?, *origin) {
+                    Some(handler) => handler.handler,
+                    None => return Ok(None),
+                }
+            }
+
+            CosmosTrigger::Transaction(_) => match self.handler_for_transaction() {
+                Some(handler) => handler.handler,
+                None => return Ok(None),
+            },
+        };
+
+        Ok(Some(TriggerWithHandler::<Chain>::new(
+            trigger.cheap_clone(),
+            handler,
+            block.ptr(),
+        )))
+    }
+
+    fn name(&self) -> &str {
+        &self.name
+    }
+
+    fn kind(&self) -> &str {
+        &self.kind
+    }
+
+    fn network(&self) -> Option<&str> {
+        self.network.as_deref()
+    }
+
+    fn context(&self) -> Arc<Option<DataSourceContext>> {
+        self.context.cheap_clone()
+    }
+
+    fn creation_block(&self) -> Option<BlockNumber> {
+        self.creation_block
+    }
+
+    fn is_duplicate_of(&self, other: &Self) -> bool {
+        let DataSource {
+            kind,
+            network,
+            name,
+            source,
+            mapping,
+            context,
+
+            // The creation block is ignored for detection duplicate data sources.
+            // Contract ABI equality is implicit in `source` and `mapping.abis` equality.
+            creation_block: _,
+        } = self;
+
+        // mapping_request_sender, host_metrics, and (most of) host_exports are operational structs
+        // used at runtime but not needed to define uniqueness; each runtime host should be for a
+        // unique data source.
+        kind == &other.kind
+            && network == &other.network
+            && name == &other.name
+            && source == &other.source
+            && mapping.block_handlers == other.mapping.block_handlers
+            && mapping.event_handlers == other.mapping.event_handlers
+            && mapping.transaction_handlers == other.mapping.transaction_handlers
+            && context == &other.context
+    }
+
+    fn as_stored_dynamic_data_source(&self) -> StoredDynamicDataSource {
+        unimplemented!("{}", DYNAMIC_DATA_SOURCE_ERROR);
+    }
+
+    fn from_stored_dynamic_data_source(
+        _template: &DataSourceTemplate,
+        _stored: StoredDynamicDataSource,
+    ) -> Result<Self> {
+        Err(anyhow!(DYNAMIC_DATA_SOURCE_ERROR))
+    }
+
+    fn validate(&self) -> Vec<Error> {
+        let mut errors = Vec::new();
+
+        if self.kind != COSMOS_KIND {
+            errors.push(anyhow!(
+                "data source has invalid `kind`, expected {} but found {}",
+                COSMOS_KIND,
+                self.kind
+            ))
+        }
+
+        // Ensure there is only one block handler
+        if self.mapping.block_handlers.len() > 1 {
+            errors.push(anyhow!("data source has duplicated block handlers"));
+        }
+
+        // Ensure there is only one transaction handler
+        if self.mapping.transaction_handlers.len() > 1 {
+            errors.push(anyhow!("data source has duplicated transaction handlers"));
+        }
+
+        // Ensure that each event type + origin filter combination has only one handler
+
+        // group handler origin filters by event type
+        let mut event_types = HashMap::with_capacity(self.mapping.event_handlers.len());
+        for event_handler in self.mapping.event_handlers.iter() {
+            let origins = event_types
+                .entry(&event_handler.event)
+                // 3 is the maximum number of valid handlers for an event type (1 for each origin)
+                .or_insert(HashSet::with_capacity(3));
+
+            // insert returns false if value was already in the set
+            if !origins.insert(event_handler.origin) {
+                errors.push(multiple_origin_err(
+                    &event_handler.event,
+                    event_handler.origin,
+                ))
+            }
+        }
+
+        // Ensure each event type either has:
+        // 1 handler with no origin filter
+        // OR
+        // 1 or more handlers with origin filter
+        for (event_type, origins) in event_types.iter() {
+            if origins.len() > 1 {
+                if !origins.iter().all(Option::is_some) {
+                    errors.push(combined_origins_err(event_type))
+                }
+            }
+        }
+
+        errors
+    }
+
+    fn api_version(&self) -> semver::Version {
+        self.mapping.api_version.clone()
+    }
+
+    fn runtime(&self) -> Option<Arc<Vec<u8>>> {
+        Some(self.mapping.runtime.cheap_clone())
+    }
+}
+
+impl DataSource {
+    fn from_manifest(
+        kind: String,
+        network: Option<String>,
+        name: String,
+        source: Source,
+        mapping: Mapping,
+        context: Option<DataSourceContext>,
+    ) -> Result<Self> {
+        // Data sources in the manifest are created "before genesis" so they have no creation block.
+        let creation_block = None;
+
+        Ok(DataSource {
+            kind,
+            network,
+            name,
+            source,
+            mapping,
+            context: Arc::new(context),
+            creation_block,
+        })
+    }
+
+    fn handler_for_block(&self) -> Option<MappingBlockHandler> {
+        self.mapping.block_handlers.first().cloned()
+    }
+
+    fn handler_for_transaction(&self) -> Option<MappingTransactionHandler> {
+        self.mapping.transaction_handlers.first().cloned()
+    }
+
+    fn handler_for_event(
+        &self,
+        event: &codec::Event,
+        event_origin: EventOrigin,
+    ) -> Option<MappingEventHandler> {
+        self.mapping
+            .event_handlers
+            .iter()
+            .find(|handler| {
+                let event_type_matches = event.event_type == handler.event;
+
+                if let Some(handler_origin) = handler.origin {
+                    event_type_matches && event_origin == handler_origin
+                } else {
+                    event_type_matches
+                }
+            })
+            .cloned()
+    }
+
+    pub(crate) fn has_block_handler(&self) -> bool {
+        !self.mapping.block_handlers.is_empty()
+    }
+
+    /// Return an iterator over all event types from event handlers.
+    pub(crate) fn events(&self) -> impl Iterator<Item = &str> {
+        self.mapping
+            .event_handlers
+            .iter()
+            .map(|handler| handler.event.as_str())
+    }
+}
+
+#[derive(Clone, Debug, Eq, PartialEq, Deserialize)]
+pub struct UnresolvedDataSource {
+    pub kind: String,
+    pub network: Option<String>,
+    pub name: String,
+    pub source: Source,
+    pub mapping: UnresolvedMapping,
+    pub context: Option<DataSourceContext>,
+}
+
+#[async_trait]
+impl blockchain::UnresolvedDataSource<Chain> for UnresolvedDataSource {
+    async fn resolve(
+        self,
+        resolver: &Arc<dyn LinkResolver>,
+        logger: &Logger,
+        _manifest_idx: u32,
+    ) -> Result<DataSource> {
+        let UnresolvedDataSource {
+            kind,
+            network,
+            name,
+            source,
+            mapping,
+            context,
+        } = self;
+
+        info!(logger, "Resolve data source"; "name" => &name, "source" => &source.start_block);
+
+        let mapping = mapping.resolve(resolver, logger).await?;
+
+        DataSource::from_manifest(kind, network, name, source, mapping, context)
+    }
+}
+
+impl TryFrom<DataSourceTemplateInfo<Chain>> for DataSource {
+    type Error = Error;
+
+    fn try_from(_info: DataSourceTemplateInfo<Chain>) -> Result<Self> {
+        Err(anyhow!(TEMPLATE_ERROR))
+    }
+}
+
+#[derive(Clone, Debug, Default, Hash, Eq, PartialEq, Deserialize)]
+pub struct BaseDataSourceTemplate<M> {
+    pub kind: String,
+    pub network: Option<String>,
+    pub name: String,
+    pub mapping: M,
+}
+
+pub type UnresolvedDataSourceTemplate = BaseDataSourceTemplate<UnresolvedMapping>;
+pub type DataSourceTemplate = BaseDataSourceTemplate<Mapping>;
+
+#[async_trait]
+impl blockchain::UnresolvedDataSourceTemplate<Chain> for UnresolvedDataSourceTemplate {
+    async fn resolve(
+        self,
+        _resolver: &Arc<dyn LinkResolver>,
+        _logger: &Logger,
+        _manifest_idx: u32,
+    ) -> Result<DataSourceTemplate> {
+        Err(anyhow!(TEMPLATE_ERROR))
+    }
+}
+
+impl blockchain::DataSourceTemplate<Chain> for DataSourceTemplate {
+    fn name(&self) -> &str {
+        unimplemented!("{}", TEMPLATE_ERROR);
+    }
+
+    fn api_version(&self) -> semver::Version {
+        unimplemented!("{}", TEMPLATE_ERROR);
+    }
+
+    fn runtime(&self) -> Option<Arc<Vec<u8>>> {
+        unimplemented!("{}", TEMPLATE_ERROR);
+    }
+
+    fn manifest_idx(&self) -> u32 {
+        unimplemented!("{}", TEMPLATE_ERROR);
+    }
+}
+
+#[derive(Clone, Debug, Default, Hash, Eq, PartialEq, Deserialize)]
+#[serde(rename_all = "camelCase")]
+pub struct UnresolvedMapping {
+    pub api_version: String,
+    pub language: String,
+    pub entities: Vec<String>,
+    #[serde(default)]
+    pub block_handlers: Vec<MappingBlockHandler>,
+    #[serde(default)]
+    pub event_handlers: Vec<MappingEventHandler>,
+    #[serde(default)]
+    pub transaction_handlers: Vec<MappingTransactionHandler>,
+    pub file: Link,
+}
+
+impl UnresolvedMapping {
+    pub async fn resolve(
+        self,
+        resolver: &Arc<dyn LinkResolver>,
+        logger: &Logger,
+    ) -> Result<Mapping> {
+        let UnresolvedMapping {
+            api_version,
+            language,
+            entities,
+            block_handlers,
+            event_handlers,
+            transaction_handlers,
+            file: link,
+        } = self;
+
+        let api_version = semver::Version::parse(&api_version)?;
+
+        info!(logger, "Resolve mapping"; "link" => &link.link);
+        let module_bytes = resolver.cat(logger, &link).await?;
+
+        Ok(Mapping {
+            api_version,
+            language,
+            entities,
+            block_handlers: block_handlers.clone(),
+            event_handlers: event_handlers.clone(),
+            transaction_handlers: transaction_handlers.clone(),
+            runtime: Arc::new(module_bytes),
+            link,
+        })
+    }
+}
+
+#[derive(Clone, Debug)]
+pub struct Mapping {
+    pub api_version: semver::Version,
+    pub language: String,
+    pub entities: Vec<String>,
+    pub block_handlers: Vec<MappingBlockHandler>,
+    pub event_handlers: Vec<MappingEventHandler>,
+    pub transaction_handlers: Vec<MappingTransactionHandler>,
+    pub runtime: Arc<Vec<u8>>,
+    pub link: Link,
+}
+
+#[derive(Clone, Debug, Hash, Eq, PartialEq, Deserialize)]
+pub struct MappingBlockHandler {
+    pub handler: String,
+}
+
+#[derive(Clone, Debug, Hash, Eq, PartialEq, Deserialize)]
+pub struct MappingEventHandler {
+    pub event: String,
+    pub origin: Option<EventOrigin>,
+    pub handler: String,
+}
+
+#[derive(Clone, Debug, Hash, Eq, PartialEq, Deserialize)]
+pub struct MappingTransactionHandler {
+    pub handler: String,
+}
+
+#[derive(Clone, Debug, Hash, Eq, PartialEq, Deserialize)]
+pub struct Source {
+    #[serde(rename = "startBlock", default)]
+    pub start_block: BlockNumber,
+}
+
+#[derive(Clone, Copy, Debug, Hash, Eq, PartialEq, Deserialize)]
+pub enum EventOrigin {
+    BeginBlock,
+    DeliverTx,
+    EndBlock,
+}
+
+fn multiple_origin_err(event_type: &str, origin: Option<EventOrigin>) -> Error {
+    let origin_err_name = match origin {
+        Some(origin) => format!("{:?}", origin),
+        None => "no".to_string(),
+    };
+
+    anyhow!(
+        "data source has multiple {} event handlers with {} origin",
+        event_type,
+        origin_err_name,
+    )
+}
+
+fn combined_origins_err(event_type: &str) -> Error {
+    anyhow!(
+        "data source has combined origin and no-origin {} event handlers",
+        event_type
+    )
+}
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    use graph::blockchain::DataSource as _;
+
+    #[test]
+    fn test_event_handlers_origin_validation() {
+        let cases = [
+            (
+                DataSource::with_event_handlers(vec![
+                    MappingEventHandler::with_origin("event_1", None),
+                    MappingEventHandler::with_origin("event_2", None),
+                    MappingEventHandler::with_origin("event_3", None),
+                ]),
+                vec![],
+            ),
+            (
+                DataSource::with_event_handlers(vec![
+                    MappingEventHandler::with_origin("event_1", Some(EventOrigin::BeginBlock)),
+                    MappingEventHandler::with_origin("event_2", Some(EventOrigin::BeginBlock)),
+                    MappingEventHandler::with_origin("event_1", Some(EventOrigin::DeliverTx)),
+                    MappingEventHandler::with_origin("event_1", Some(EventOrigin::EndBlock)),
+                    MappingEventHandler::with_origin("event_2", Some(EventOrigin::DeliverTx)),
+                    MappingEventHandler::with_origin("event_2", Some(EventOrigin::EndBlock)),
+                ]),
+                vec![],
+            ),
+            (
+                DataSource::with_event_handlers(vec![
+                    MappingEventHandler::with_origin("event_1", None),
+                    MappingEventHandler::with_origin("event_1", None),
+                    MappingEventHandler::with_origin("event_2", None),
+                    MappingEventHandler::with_origin("event_2", Some(EventOrigin::BeginBlock)),
+                    MappingEventHandler::with_origin("event_3", Some(EventOrigin::EndBlock)),
+                    MappingEventHandler::with_origin("event_3", Some(EventOrigin::EndBlock)),
+                ]),
+                vec![
+                    multiple_origin_err("event_1", None),
+                    combined_origins_err("event_2"),
+                    multiple_origin_err("event_3", Some(EventOrigin::EndBlock)),
+                ],
+            ),
+        ];
+
+        for (data_source, errors) in &cases {
+            let validation_errors = data_source.validate();
+
+            assert_eq!(errors.len(), validation_errors.len());
+
+            for error in errors.iter() {
+                assert!(
+                    validation_errors
+                        .iter()
+                        .any(|validation_error| validation_error.to_string() == error.to_string()),
+                    r#"expected "{}" to be in validation errors, but it wasn't"#,
+                    error
+                );
+            }
+        }
+    }
+
+    impl DataSource {
+        fn with_event_handlers(event_handlers: Vec<MappingEventHandler>) -> DataSource {
+            DataSource {
+                kind: "cosmos".to_string(),
+                network: None,
+                name: "Test".to_string(),
+                source: Source { start_block: 1 },
+                mapping: Mapping {
+                    api_version: semver::Version::new(0, 0, 0),
+                    language: "".to_string(),
+                    entities: vec![],
+                    block_handlers: vec![],
+                    event_handlers,
+                    transaction_handlers: vec![],
+                    runtime: Arc::new(vec![]),
+                    link: "test".to_string().into(),
+                },
+                context: Arc::new(None),
+                creation_block: None,
+            }
+        }
+    }
+
+    impl MappingEventHandler {
+        fn with_origin(event_type: &str, origin: Option<EventOrigin>) -> MappingEventHandler {
+            MappingEventHandler {
+                event: event_type.to_string(),
+                origin,
+                handler: "handler".to_string(),
+            }
+        }
+    }
+}
diff --git a/chain/cosmos/src/lib.rs b/chain/cosmos/src/lib.rs
new file mode 100644
index 0000000..634cbe0
--- /dev/null
+++ b/chain/cosmos/src/lib.rs
@@ -0,0 +1,19 @@
+mod adapter;
+mod capabilities;
+pub mod chain;
+pub mod codec;
+mod data_source;
+mod protobuf;
+pub mod runtime;
+mod trigger;
+
+pub use self::runtime::RuntimeAdapter;
+
+// ETHDEP: These concrete types should probably not be exposed.
+pub use data_source::{DataSource, DataSourceTemplate};
+
+pub use crate::adapter::TriggerFilter;
+pub use crate::chain::Chain;
+
+pub use protobuf::pbcodec;
+pub use protobuf::pbcodec::Block;
diff --git a/chain/cosmos/src/protobuf/.gitignore b/chain/cosmos/src/protobuf/.gitignore
new file mode 100644
index 0000000..9678694
--- /dev/null
+++ b/chain/cosmos/src/protobuf/.gitignore
@@ -0,0 +1,4 @@
+/google.protobuf.rs
+/gogoproto.rs
+/cosmos_proto.rs
+/firehose.rs
diff --git a/chain/cosmos/src/protobuf/mod.rs b/chain/cosmos/src/protobuf/mod.rs
new file mode 100644
index 0000000..c3292e6
--- /dev/null
+++ b/chain/cosmos/src/protobuf/mod.rs
@@ -0,0 +1,8 @@
+#[rustfmt::skip]
+#[path = "sf.cosmos.r#type.v1.rs"]
+pub mod pbcodec;
+
+pub use graph_runtime_wasm::asc_abi::class::{Array, AscEnum, AscString, Uint8Array};
+
+pub use crate::runtime::abi::*;
+pub use pbcodec::*;
diff --git a/chain/cosmos/src/protobuf/sf.cosmos.r#type.v1.rs b/chain/cosmos/src/protobuf/sf.cosmos.r#type.v1.rs
new file mode 100644
index 0000000..d720b39
--- /dev/null
+++ b/chain/cosmos/src/protobuf/sf.cosmos.r#type.v1.rs
@@ -0,0 +1,641 @@
+#[graph_runtime_derive::generate_asc_type(__required__{header: Header,result_begin_block: ResponseBeginBlock,result_end_block: ResponseEndBlock})]
+#[graph_runtime_derive::generate_network_type_id(Cosmos)]
+#[graph_runtime_derive::generate_from_rust_type(__required__{header: Header,result_begin_block: ResponseBeginBlock,result_end_block: ResponseEndBlock})]
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct Block {
+    #[prost(message, optional, tag="1")]
+    pub header: ::core::option::Option<Header>,
+    #[prost(message, optional, tag="2")]
+    pub evidence: ::core::option::Option<EvidenceList>,
+    #[prost(message, optional, tag="3")]
+    pub last_commit: ::core::option::Option<Commit>,
+    #[prost(message, optional, tag="4")]
+    pub result_begin_block: ::core::option::Option<ResponseBeginBlock>,
+    #[prost(message, optional, tag="5")]
+    pub result_end_block: ::core::option::Option<ResponseEndBlock>,
+    #[prost(message, repeated, tag="7")]
+    pub transactions: ::prost::alloc::vec::Vec<TxResult>,
+    #[prost(message, repeated, tag="8")]
+    pub validator_updates: ::prost::alloc::vec::Vec<Validator>,
+}
+/// HeaderOnlyBlock is a standard \[Block\] structure where all other fields are
+/// removed so that hydrating that object from a \[Block\] bytes payload will
+/// drastically reduce allocated memory required to hold the full block.
+///
+/// This can be used to unpack a \[Block\] when only the \[Header\] information
+/// is required and greatly reduce required memory.
+#[graph_runtime_derive::generate_asc_type(__required__{header: Header})]
+#[graph_runtime_derive::generate_network_type_id(Cosmos)]
+#[graph_runtime_derive::generate_from_rust_type(__required__{header: Header})]
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct HeaderOnlyBlock {
+    #[prost(message, optional, tag="1")]
+    pub header: ::core::option::Option<Header>,
+}
+#[graph_runtime_derive::generate_asc_type(__required__{event: Event,block: HeaderOnlyBlock})]
+#[graph_runtime_derive::generate_network_type_id(Cosmos)]
+#[graph_runtime_derive::generate_from_rust_type(__required__{event: Event,block: HeaderOnlyBlock})]
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct EventData {
+    #[prost(message, optional, tag="1")]
+    pub event: ::core::option::Option<Event>,
+    #[prost(message, optional, tag="2")]
+    pub block: ::core::option::Option<HeaderOnlyBlock>,
+}
+#[graph_runtime_derive::generate_asc_type(__required__{tx: TxResult,block: HeaderOnlyBlock})]
+#[graph_runtime_derive::generate_network_type_id(Cosmos)]
+#[graph_runtime_derive::generate_from_rust_type(__required__{tx: TxResult,block: HeaderOnlyBlock})]
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct TransactionData {
+    #[prost(message, optional, tag="1")]
+    pub tx: ::core::option::Option<TxResult>,
+    #[prost(message, optional, tag="2")]
+    pub block: ::core::option::Option<HeaderOnlyBlock>,
+}
+#[graph_runtime_derive::generate_asc_type(__required__{last_block_id: BlockID})]
+#[graph_runtime_derive::generate_network_type_id(Cosmos)]
+#[graph_runtime_derive::generate_from_rust_type(__required__{last_block_id: BlockID})]
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct Header {
+    #[prost(message, optional, tag="1")]
+    pub version: ::core::option::Option<Consensus>,
+    #[prost(string, tag="2")]
+    pub chain_id: ::prost::alloc::string::String,
+    #[prost(uint64, tag="3")]
+    pub height: u64,
+    #[prost(message, optional, tag="4")]
+    pub time: ::core::option::Option<Timestamp>,
+    #[prost(message, optional, tag="5")]
+    pub last_block_id: ::core::option::Option<BlockId>,
+    #[prost(bytes="vec", tag="6")]
+    pub last_commit_hash: ::prost::alloc::vec::Vec<u8>,
+    #[prost(bytes="vec", tag="7")]
+    pub data_hash: ::prost::alloc::vec::Vec<u8>,
+    #[prost(bytes="vec", tag="8")]
+    pub validators_hash: ::prost::alloc::vec::Vec<u8>,
+    #[prost(bytes="vec", tag="9")]
+    pub next_validators_hash: ::prost::alloc::vec::Vec<u8>,
+    #[prost(bytes="vec", tag="10")]
+    pub consensus_hash: ::prost::alloc::vec::Vec<u8>,
+    #[prost(bytes="vec", tag="11")]
+    pub app_hash: ::prost::alloc::vec::Vec<u8>,
+    #[prost(bytes="vec", tag="12")]
+    pub last_results_hash: ::prost::alloc::vec::Vec<u8>,
+    #[prost(bytes="vec", tag="13")]
+    pub evidence_hash: ::prost::alloc::vec::Vec<u8>,
+    #[prost(bytes="vec", tag="14")]
+    pub proposer_address: ::prost::alloc::vec::Vec<u8>,
+    #[prost(bytes="vec", tag="15")]
+    pub hash: ::prost::alloc::vec::Vec<u8>,
+}
+#[graph_runtime_derive::generate_asc_type()]
+#[graph_runtime_derive::generate_network_type_id(Cosmos)]
+#[graph_runtime_derive::generate_from_rust_type()]
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct Consensus {
+    #[prost(uint64, tag="1")]
+    pub block: u64,
+    #[prost(uint64, tag="2")]
+    pub app: u64,
+}
+#[graph_runtime_derive::generate_asc_type()]
+#[graph_runtime_derive::generate_network_type_id(Cosmos)]
+#[graph_runtime_derive::generate_from_rust_type()]
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct Timestamp {
+    #[prost(int64, tag="1")]
+    pub seconds: i64,
+    #[prost(int32, tag="2")]
+    pub nanos: i32,
+}
+#[graph_runtime_derive::generate_asc_type()]
+#[graph_runtime_derive::generate_network_type_id(Cosmos)]
+#[graph_runtime_derive::generate_from_rust_type()]
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct BlockId {
+    #[prost(bytes="vec", tag="1")]
+    pub hash: ::prost::alloc::vec::Vec<u8>,
+    #[prost(message, optional, tag="2")]
+    pub part_set_header: ::core::option::Option<PartSetHeader>,
+}
+#[graph_runtime_derive::generate_asc_type()]
+#[graph_runtime_derive::generate_network_type_id(Cosmos)]
+#[graph_runtime_derive::generate_from_rust_type()]
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct PartSetHeader {
+    #[prost(uint32, tag="1")]
+    pub total: u32,
+    #[prost(bytes="vec", tag="2")]
+    pub hash: ::prost::alloc::vec::Vec<u8>,
+}
+#[graph_runtime_derive::generate_asc_type()]
+#[graph_runtime_derive::generate_network_type_id(Cosmos)]
+#[graph_runtime_derive::generate_from_rust_type()]
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct EvidenceList {
+    #[prost(message, repeated, tag="1")]
+    pub evidence: ::prost::alloc::vec::Vec<Evidence>,
+}
+#[graph_runtime_derive::generate_asc_type(sum{duplicate_vote_evidence: DuplicateVoteEvidence,light_client_attack_evidence: LightClientAttackEvidence})]
+#[graph_runtime_derive::generate_network_type_id(Cosmos)]
+#[graph_runtime_derive::generate_from_rust_type(sum{duplicate_vote_evidence: DuplicateVoteEvidence,light_client_attack_evidence: LightClientAttackEvidence})]
+#[graph_runtime_derive::generate_array_type(Cosmos)]
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct Evidence {
+    #[prost(oneof="evidence::Sum", tags="1, 2")]
+    pub sum: ::core::option::Option<evidence::Sum>,
+}
+/// Nested message and enum types in `Evidence`.
+pub mod evidence {
+    #[derive(Clone, PartialEq, ::prost::Oneof)]
+    pub enum Sum {
+        #[prost(message, tag="1")]
+        DuplicateVoteEvidence(super::DuplicateVoteEvidence),
+        #[prost(message, tag="2")]
+        LightClientAttackEvidence(super::LightClientAttackEvidence),
+    }
+}
+#[graph_runtime_derive::generate_asc_type()]
+#[graph_runtime_derive::generate_network_type_id(Cosmos)]
+#[graph_runtime_derive::generate_from_rust_type()]
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct DuplicateVoteEvidence {
+    #[prost(message, optional, tag="1")]
+    pub vote_a: ::core::option::Option<EventVote>,
+    #[prost(message, optional, tag="2")]
+    pub vote_b: ::core::option::Option<EventVote>,
+    #[prost(int64, tag="3")]
+    pub total_voting_power: i64,
+    #[prost(int64, tag="4")]
+    pub validator_power: i64,
+    #[prost(message, optional, tag="5")]
+    pub timestamp: ::core::option::Option<Timestamp>,
+}
+#[graph_runtime_derive::generate_asc_type()]
+#[graph_runtime_derive::generate_network_type_id(Cosmos)]
+#[graph_runtime_derive::generate_from_rust_type()]
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct EventVote {
+    #[prost(enumeration="SignedMsgType", tag="1")]
+    pub event_vote_type: i32,
+    #[prost(uint64, tag="2")]
+    pub height: u64,
+    #[prost(int32, tag="3")]
+    pub round: i32,
+    #[prost(message, optional, tag="4")]
+    pub block_id: ::core::option::Option<BlockId>,
+    #[prost(message, optional, tag="5")]
+    pub timestamp: ::core::option::Option<Timestamp>,
+    #[prost(bytes="vec", tag="6")]
+    pub validator_address: ::prost::alloc::vec::Vec<u8>,
+    #[prost(int32, tag="7")]
+    pub validator_index: i32,
+    #[prost(bytes="vec", tag="8")]
+    pub signature: ::prost::alloc::vec::Vec<u8>,
+}
+#[graph_runtime_derive::generate_asc_type()]
+#[graph_runtime_derive::generate_network_type_id(Cosmos)]
+#[graph_runtime_derive::generate_from_rust_type()]
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct LightClientAttackEvidence {
+    #[prost(message, optional, tag="1")]
+    pub conflicting_block: ::core::option::Option<LightBlock>,
+    #[prost(int64, tag="2")]
+    pub common_height: i64,
+    #[prost(message, repeated, tag="3")]
+    pub byzantine_validators: ::prost::alloc::vec::Vec<Validator>,
+    #[prost(int64, tag="4")]
+    pub total_voting_power: i64,
+    #[prost(message, optional, tag="5")]
+    pub timestamp: ::core::option::Option<Timestamp>,
+}
+#[graph_runtime_derive::generate_asc_type()]
+#[graph_runtime_derive::generate_network_type_id(Cosmos)]
+#[graph_runtime_derive::generate_from_rust_type()]
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct LightBlock {
+    #[prost(message, optional, tag="1")]
+    pub signed_header: ::core::option::Option<SignedHeader>,
+    #[prost(message, optional, tag="2")]
+    pub validator_set: ::core::option::Option<ValidatorSet>,
+}
+#[graph_runtime_derive::generate_asc_type()]
+#[graph_runtime_derive::generate_network_type_id(Cosmos)]
+#[graph_runtime_derive::generate_from_rust_type()]
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct SignedHeader {
+    #[prost(message, optional, tag="1")]
+    pub header: ::core::option::Option<Header>,
+    #[prost(message, optional, tag="2")]
+    pub commit: ::core::option::Option<Commit>,
+}
+#[graph_runtime_derive::generate_asc_type()]
+#[graph_runtime_derive::generate_network_type_id(Cosmos)]
+#[graph_runtime_derive::generate_from_rust_type()]
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct Commit {
+    #[prost(int64, tag="1")]
+    pub height: i64,
+    #[prost(int32, tag="2")]
+    pub round: i32,
+    #[prost(message, optional, tag="3")]
+    pub block_id: ::core::option::Option<BlockId>,
+    #[prost(message, repeated, tag="4")]
+    pub signatures: ::prost::alloc::vec::Vec<CommitSig>,
+}
+#[graph_runtime_derive::generate_asc_type()]
+#[graph_runtime_derive::generate_network_type_id(Cosmos)]
+#[graph_runtime_derive::generate_from_rust_type()]
+#[graph_runtime_derive::generate_array_type(Cosmos)]
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct CommitSig {
+    #[prost(enumeration="BlockIdFlag", tag="1")]
+    pub block_id_flag: i32,
+    #[prost(bytes="vec", tag="2")]
+    pub validator_address: ::prost::alloc::vec::Vec<u8>,
+    #[prost(message, optional, tag="3")]
+    pub timestamp: ::core::option::Option<Timestamp>,
+    #[prost(bytes="vec", tag="4")]
+    pub signature: ::prost::alloc::vec::Vec<u8>,
+}
+#[graph_runtime_derive::generate_asc_type()]
+#[graph_runtime_derive::generate_network_type_id(Cosmos)]
+#[graph_runtime_derive::generate_from_rust_type()]
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct ValidatorSet {
+    #[prost(message, repeated, tag="1")]
+    pub validators: ::prost::alloc::vec::Vec<Validator>,
+    #[prost(message, optional, tag="2")]
+    pub proposer: ::core::option::Option<Validator>,
+    #[prost(int64, tag="3")]
+    pub total_voting_power: i64,
+}
+#[graph_runtime_derive::generate_asc_type()]
+#[graph_runtime_derive::generate_network_type_id(Cosmos)]
+#[graph_runtime_derive::generate_from_rust_type()]
+#[graph_runtime_derive::generate_array_type(Cosmos)]
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct Validator {
+    #[prost(bytes="vec", tag="1")]
+    pub address: ::prost::alloc::vec::Vec<u8>,
+    #[prost(message, optional, tag="2")]
+    pub pub_key: ::core::option::Option<PublicKey>,
+    #[prost(int64, tag="3")]
+    pub voting_power: i64,
+    #[prost(int64, tag="4")]
+    pub proposer_priority: i64,
+}
+#[graph_runtime_derive::generate_asc_type(sum{ed25519: Vec<u8>,secp256k1: Vec<u8>})]
+#[graph_runtime_derive::generate_network_type_id(Cosmos)]
+#[graph_runtime_derive::generate_from_rust_type(sum{ed25519: Vec<u8>,secp256k1: Vec<u8>})]
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct PublicKey {
+    #[prost(oneof="public_key::Sum", tags="1, 2")]
+    pub sum: ::core::option::Option<public_key::Sum>,
+}
+/// Nested message and enum types in `PublicKey`.
+pub mod public_key {
+    #[derive(Clone, PartialEq, ::prost::Oneof)]
+    pub enum Sum {
+        #[prost(bytes, tag="1")]
+        Ed25519(::prost::alloc::vec::Vec<u8>),
+        #[prost(bytes, tag="2")]
+        Secp256k1(::prost::alloc::vec::Vec<u8>),
+    }
+}
+#[graph_runtime_derive::generate_asc_type()]
+#[graph_runtime_derive::generate_network_type_id(Cosmos)]
+#[graph_runtime_derive::generate_from_rust_type()]
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct ResponseBeginBlock {
+    #[prost(message, repeated, tag="1")]
+    pub events: ::prost::alloc::vec::Vec<Event>,
+}
+#[graph_runtime_derive::generate_asc_type()]
+#[graph_runtime_derive::generate_network_type_id(Cosmos)]
+#[graph_runtime_derive::generate_from_rust_type()]
+#[graph_runtime_derive::generate_array_type(Cosmos)]
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct Event {
+    #[prost(string, tag="1")]
+    pub event_type: ::prost::alloc::string::String,
+    #[prost(message, repeated, tag="2")]
+    pub attributes: ::prost::alloc::vec::Vec<EventAttribute>,
+}
+#[graph_runtime_derive::generate_asc_type()]
+#[graph_runtime_derive::generate_network_type_id(Cosmos)]
+#[graph_runtime_derive::generate_from_rust_type()]
+#[graph_runtime_derive::generate_array_type(Cosmos)]
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct EventAttribute {
+    #[prost(string, tag="1")]
+    pub key: ::prost::alloc::string::String,
+    #[prost(string, tag="2")]
+    pub value: ::prost::alloc::string::String,
+    #[prost(bool, tag="3")]
+    pub index: bool,
+}
+#[graph_runtime_derive::generate_asc_type()]
+#[graph_runtime_derive::generate_network_type_id(Cosmos)]
+#[graph_runtime_derive::generate_from_rust_type()]
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct ResponseEndBlock {
+    #[prost(message, repeated, tag="1")]
+    pub validator_updates: ::prost::alloc::vec::Vec<ValidatorUpdate>,
+    #[prost(message, optional, tag="2")]
+    pub consensus_param_updates: ::core::option::Option<ConsensusParams>,
+    #[prost(message, repeated, tag="3")]
+    pub events: ::prost::alloc::vec::Vec<Event>,
+}
+#[graph_runtime_derive::generate_asc_type()]
+#[graph_runtime_derive::generate_network_type_id(Cosmos)]
+#[graph_runtime_derive::generate_from_rust_type()]
+#[graph_runtime_derive::generate_array_type(Cosmos)]
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct ValidatorUpdate {
+    #[prost(bytes="vec", tag="1")]
+    pub address: ::prost::alloc::vec::Vec<u8>,
+    #[prost(message, optional, tag="2")]
+    pub pub_key: ::core::option::Option<PublicKey>,
+    #[prost(int64, tag="3")]
+    pub power: i64,
+}
+#[graph_runtime_derive::generate_asc_type()]
+#[graph_runtime_derive::generate_network_type_id(Cosmos)]
+#[graph_runtime_derive::generate_from_rust_type()]
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct ConsensusParams {
+    #[prost(message, optional, tag="1")]
+    pub block: ::core::option::Option<BlockParams>,
+    #[prost(message, optional, tag="2")]
+    pub evidence: ::core::option::Option<EvidenceParams>,
+    #[prost(message, optional, tag="3")]
+    pub validator: ::core::option::Option<ValidatorParams>,
+    #[prost(message, optional, tag="4")]
+    pub version: ::core::option::Option<VersionParams>,
+}
+#[graph_runtime_derive::generate_asc_type()]
+#[graph_runtime_derive::generate_network_type_id(Cosmos)]
+#[graph_runtime_derive::generate_from_rust_type()]
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct BlockParams {
+    #[prost(int64, tag="1")]
+    pub max_bytes: i64,
+    #[prost(int64, tag="2")]
+    pub max_gas: i64,
+}
+#[graph_runtime_derive::generate_asc_type()]
+#[graph_runtime_derive::generate_network_type_id(Cosmos)]
+#[graph_runtime_derive::generate_from_rust_type()]
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct EvidenceParams {
+    #[prost(int64, tag="1")]
+    pub max_age_num_blocks: i64,
+    #[prost(message, optional, tag="2")]
+    pub max_age_duration: ::core::option::Option<Duration>,
+    #[prost(int64, tag="3")]
+    pub max_bytes: i64,
+}
+#[graph_runtime_derive::generate_asc_type()]
+#[graph_runtime_derive::generate_network_type_id(Cosmos)]
+#[graph_runtime_derive::generate_from_rust_type()]
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct Duration {
+    #[prost(int64, tag="1")]
+    pub seconds: i64,
+    #[prost(int32, tag="2")]
+    pub nanos: i32,
+}
+#[graph_runtime_derive::generate_asc_type()]
+#[graph_runtime_derive::generate_network_type_id(Cosmos)]
+#[graph_runtime_derive::generate_from_rust_type()]
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct ValidatorParams {
+    #[prost(string, repeated, tag="1")]
+    pub pub_key_types: ::prost::alloc::vec::Vec<::prost::alloc::string::String>,
+}
+#[graph_runtime_derive::generate_asc_type()]
+#[graph_runtime_derive::generate_network_type_id(Cosmos)]
+#[graph_runtime_derive::generate_from_rust_type()]
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct VersionParams {
+    #[prost(uint64, tag="1")]
+    pub app_version: u64,
+}
+#[graph_runtime_derive::generate_asc_type(__required__{tx: Tx,result: ResponseDeliverTx})]
+#[graph_runtime_derive::generate_network_type_id(Cosmos)]
+#[graph_runtime_derive::generate_from_rust_type(__required__{tx: Tx,result: ResponseDeliverTx})]
+#[graph_runtime_derive::generate_array_type(Cosmos)]
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct TxResult {
+    #[prost(uint64, tag="1")]
+    pub height: u64,
+    #[prost(uint32, tag="2")]
+    pub index: u32,
+    #[prost(message, optional, tag="3")]
+    pub tx: ::core::option::Option<Tx>,
+    #[prost(message, optional, tag="4")]
+    pub result: ::core::option::Option<ResponseDeliverTx>,
+    #[prost(bytes="vec", tag="5")]
+    pub hash: ::prost::alloc::vec::Vec<u8>,
+}
+#[graph_runtime_derive::generate_asc_type(__required__{body: TxBody})]
+#[graph_runtime_derive::generate_network_type_id(Cosmos)]
+#[graph_runtime_derive::generate_from_rust_type(__required__{body: TxBody})]
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct Tx {
+    #[prost(message, optional, tag="1")]
+    pub body: ::core::option::Option<TxBody>,
+    #[prost(message, optional, tag="2")]
+    pub auth_info: ::core::option::Option<AuthInfo>,
+    #[prost(bytes="vec", repeated, tag="3")]
+    pub signatures: ::prost::alloc::vec::Vec<::prost::alloc::vec::Vec<u8>>,
+}
+#[graph_runtime_derive::generate_asc_type()]
+#[graph_runtime_derive::generate_network_type_id(Cosmos)]
+#[graph_runtime_derive::generate_from_rust_type()]
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct TxBody {
+    #[prost(message, repeated, tag="1")]
+    pub messages: ::prost::alloc::vec::Vec<::prost_types::Any>,
+    #[prost(string, tag="2")]
+    pub memo: ::prost::alloc::string::String,
+    #[prost(uint64, tag="3")]
+    pub timeout_height: u64,
+    #[prost(message, repeated, tag="1023")]
+    pub extension_options: ::prost::alloc::vec::Vec<::prost_types::Any>,
+    #[prost(message, repeated, tag="2047")]
+    pub non_critical_extension_options: ::prost::alloc::vec::Vec<::prost_types::Any>,
+}
+#[graph_runtime_derive::generate_asc_type()]
+#[graph_runtime_derive::generate_network_type_id(Cosmos)]
+#[graph_runtime_derive::generate_from_rust_type()]
+#[graph_runtime_derive::generate_array_type(Cosmos)]
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct Any {
+    #[prost(string, tag="1")]
+    pub type_url: ::prost::alloc::string::String,
+    #[prost(bytes="vec", tag="2")]
+    pub value: ::prost::alloc::vec::Vec<u8>,
+}
+#[graph_runtime_derive::generate_asc_type()]
+#[graph_runtime_derive::generate_network_type_id(Cosmos)]
+#[graph_runtime_derive::generate_from_rust_type()]
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct AuthInfo {
+    #[prost(message, repeated, tag="1")]
+    pub signer_infos: ::prost::alloc::vec::Vec<SignerInfo>,
+    #[prost(message, optional, tag="2")]
+    pub fee: ::core::option::Option<Fee>,
+    #[prost(message, optional, tag="3")]
+    pub tip: ::core::option::Option<Tip>,
+}
+#[graph_runtime_derive::generate_asc_type()]
+#[graph_runtime_derive::generate_network_type_id(Cosmos)]
+#[graph_runtime_derive::generate_from_rust_type()]
+#[graph_runtime_derive::generate_array_type(Cosmos)]
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct SignerInfo {
+    #[prost(message, optional, tag="1")]
+    pub public_key: ::core::option::Option<::prost_types::Any>,
+    #[prost(message, optional, tag="2")]
+    pub mode_info: ::core::option::Option<ModeInfo>,
+    #[prost(uint64, tag="3")]
+    pub sequence: u64,
+}
+#[graph_runtime_derive::generate_asc_type(sum{single: ModeInfoSingle,multi: ModeInfoMulti})]
+#[graph_runtime_derive::generate_network_type_id(Cosmos)]
+#[graph_runtime_derive::generate_from_rust_type(sum{single: ModeInfoSingle,multi: ModeInfoMulti})]
+#[graph_runtime_derive::generate_array_type(Cosmos)]
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct ModeInfo {
+    #[prost(oneof="mode_info::Sum", tags="1, 2")]
+    pub sum: ::core::option::Option<mode_info::Sum>,
+}
+/// Nested message and enum types in `ModeInfo`.
+pub mod mode_info {
+    #[derive(Clone, PartialEq, ::prost::Oneof)]
+    pub enum Sum {
+        #[prost(message, tag="1")]
+        Single(super::ModeInfoSingle),
+        #[prost(message, tag="2")]
+        Multi(super::ModeInfoMulti),
+    }
+}
+#[graph_runtime_derive::generate_asc_type()]
+#[graph_runtime_derive::generate_network_type_id(Cosmos)]
+#[graph_runtime_derive::generate_from_rust_type()]
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct ModeInfoSingle {
+    #[prost(enumeration="SignMode", tag="1")]
+    pub mode: i32,
+}
+#[graph_runtime_derive::generate_asc_type()]
+#[graph_runtime_derive::generate_network_type_id(Cosmos)]
+#[graph_runtime_derive::generate_from_rust_type()]
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct ModeInfoMulti {
+    #[prost(message, optional, tag="1")]
+    pub bitarray: ::core::option::Option<CompactBitArray>,
+    #[prost(message, repeated, tag="2")]
+    pub mode_infos: ::prost::alloc::vec::Vec<ModeInfo>,
+}
+#[graph_runtime_derive::generate_asc_type()]
+#[graph_runtime_derive::generate_network_type_id(Cosmos)]
+#[graph_runtime_derive::generate_from_rust_type()]
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct CompactBitArray {
+    #[prost(uint32, tag="1")]
+    pub extra_bits_stored: u32,
+    #[prost(bytes="vec", tag="2")]
+    pub elems: ::prost::alloc::vec::Vec<u8>,
+}
+#[graph_runtime_derive::generate_asc_type()]
+#[graph_runtime_derive::generate_network_type_id(Cosmos)]
+#[graph_runtime_derive::generate_from_rust_type()]
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct Fee {
+    #[prost(message, repeated, tag="1")]
+    pub amount: ::prost::alloc::vec::Vec<Coin>,
+    #[prost(uint64, tag="2")]
+    pub gas_limit: u64,
+    #[prost(string, tag="3")]
+    pub payer: ::prost::alloc::string::String,
+    #[prost(string, tag="4")]
+    pub granter: ::prost::alloc::string::String,
+}
+#[graph_runtime_derive::generate_asc_type()]
+#[graph_runtime_derive::generate_network_type_id(Cosmos)]
+#[graph_runtime_derive::generate_from_rust_type()]
+#[graph_runtime_derive::generate_array_type(Cosmos)]
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct Coin {
+    #[prost(string, tag="1")]
+    pub denom: ::prost::alloc::string::String,
+    #[prost(string, tag="2")]
+    pub amount: ::prost::alloc::string::String,
+}
+#[graph_runtime_derive::generate_asc_type()]
+#[graph_runtime_derive::generate_network_type_id(Cosmos)]
+#[graph_runtime_derive::generate_from_rust_type()]
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct Tip {
+    #[prost(message, repeated, tag="1")]
+    pub amount: ::prost::alloc::vec::Vec<Coin>,
+    #[prost(string, tag="2")]
+    pub tipper: ::prost::alloc::string::String,
+}
+#[graph_runtime_derive::generate_asc_type()]
+#[graph_runtime_derive::generate_network_type_id(Cosmos)]
+#[graph_runtime_derive::generate_from_rust_type()]
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct ResponseDeliverTx {
+    #[prost(uint32, tag="1")]
+    pub code: u32,
+    #[prost(bytes="vec", tag="2")]
+    pub data: ::prost::alloc::vec::Vec<u8>,
+    #[prost(string, tag="3")]
+    pub log: ::prost::alloc::string::String,
+    #[prost(string, tag="4")]
+    pub info: ::prost::alloc::string::String,
+    #[prost(int64, tag="5")]
+    pub gas_wanted: i64,
+    #[prost(int64, tag="6")]
+    pub gas_used: i64,
+    #[prost(message, repeated, tag="7")]
+    pub events: ::prost::alloc::vec::Vec<Event>,
+    #[prost(string, tag="8")]
+    pub codespace: ::prost::alloc::string::String,
+}
+#[graph_runtime_derive::generate_asc_type()]
+#[graph_runtime_derive::generate_network_type_id(Cosmos)]
+#[graph_runtime_derive::generate_from_rust_type()]
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct ValidatorSetUpdates {
+    #[prost(message, repeated, tag="1")]
+    pub validator_updates: ::prost::alloc::vec::Vec<Validator>,
+}
+#[derive(Clone, Copy, Debug, PartialEq, Eq, Hash, PartialOrd, Ord, ::prost::Enumeration)]
+#[repr(i32)]
+pub enum SignedMsgType {
+    Unknown = 0,
+    Prevote = 1,
+    Precommit = 2,
+    Proposal = 32,
+}
+#[derive(Clone, Copy, Debug, PartialEq, Eq, Hash, PartialOrd, Ord, ::prost::Enumeration)]
+#[repr(i32)]
+pub enum BlockIdFlag {
+    Unknown = 0,
+    Absent = 1,
+    Commit = 2,
+    Nil = 3,
+}
+#[derive(Clone, Copy, Debug, PartialEq, Eq, Hash, PartialOrd, Ord, ::prost::Enumeration)]
+#[repr(i32)]
+pub enum SignMode {
+    Unspecified = 0,
+    Direct = 1,
+    Textual = 2,
+    LegacyAminoJson = 127,
+}
diff --git a/chain/cosmos/src/runtime/abi.rs b/chain/cosmos/src/runtime/abi.rs
new file mode 100644
index 0000000..3c5f0dd
--- /dev/null
+++ b/chain/cosmos/src/runtime/abi.rs
@@ -0,0 +1,79 @@
+use crate::protobuf::*;
+pub use graph::semver::Version;
+
+pub use graph::runtime::{
+    asc_new, gas::GasCounter, AscHeap, AscIndexId, AscPtr, AscType, AscValue,
+    DeterministicHostError, IndexForAscTypeId, ToAscObj,
+};
+/*
+TODO: AscBytesArray seem to be generic to all chains, but AscIndexId pins it to Cosmos
+****************** this can be moved to runtime graph/runtime/src/asc_heap.rs, but  IndexForAscTypeId::CosmosBytesArray ******
+*/
+pub struct AscBytesArray(pub Array<AscPtr<Uint8Array>>);
+
+impl ToAscObj<AscBytesArray> for Vec<Vec<u8>> {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscBytesArray, DeterministicHostError> {
+        let content: Result<Vec<_>, _> = self
+            .iter()
+            .map(|x| asc_new(heap, &graph_runtime_wasm::asc_abi::class::Bytes(x), gas))
+            .collect();
+
+        Ok(AscBytesArray(Array::new(&content?, heap, gas)?))
+    }
+}
+
+//this can be moved to runtime
+impl AscType for AscBytesArray {
+    fn to_asc_bytes(&self) -> Result<Vec<u8>, DeterministicHostError> {
+        self.0.to_asc_bytes()
+    }
+
+    fn from_asc_bytes(
+        asc_obj: &[u8],
+        api_version: &Version,
+    ) -> Result<Self, DeterministicHostError> {
+        Ok(Self(Array::from_asc_bytes(asc_obj, api_version)?))
+    }
+}
+
+//we will have to keep this chain specific (Inner/Outer)
+impl AscIndexId for AscBytesArray {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::CosmosBytesArray;
+}
+
+/************************************************************************** */
+// this can be moved to runtime - prost_types::Any
+impl ToAscObj<AscAny> for prost_types::Any {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscAny, DeterministicHostError> {
+        Ok(AscAny {
+            type_url: asc_new(heap, &self.type_url, gas)?,
+            value: asc_new(
+                heap,
+                &graph_runtime_wasm::asc_abi::class::Bytes(&self.value),
+                gas,
+            )?,
+            ..Default::default()
+        })
+    }
+}
+
+//this can be moved to runtime - prost_types::Any
+impl ToAscObj<AscAnyArray> for Vec<prost_types::Any> {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscAnyArray, DeterministicHostError> {
+        let content: Result<Vec<_>, _> = self.iter().map(|x| asc_new(heap, x, gas)).collect();
+
+        Ok(AscAnyArray(Array::new(&content?, heap, gas)?))
+    }
+}
diff --git a/chain/cosmos/src/runtime/mod.rs b/chain/cosmos/src/runtime/mod.rs
new file mode 100644
index 0000000..17a8ec8
--- /dev/null
+++ b/chain/cosmos/src/runtime/mod.rs
@@ -0,0 +1,336 @@
+pub use runtime_adapter::RuntimeAdapter;
+
+pub mod abi;
+pub mod runtime_adapter;
+
+#[cfg(test)]
+mod test {
+    use crate::protobuf::*;
+
+    use graph::semver::Version;
+
+    /// A macro that takes an ASC struct value definition and calls AscBytes methods to check that
+    /// memory layout is padded properly.
+    macro_rules! assert_asc_bytes {
+        ($struct_name:ident {
+            $($field:ident : $field_value:expr),+
+            $(,)? // trailing
+        }) => {
+            let value = $struct_name {
+                $($field: $field_value),+
+            };
+
+            // just call the function. it will panic on misalignments
+            let asc_bytes = value.to_asc_bytes().unwrap();
+
+            let value_004 = $struct_name::from_asc_bytes(&asc_bytes, &Version::new(0, 0, 4)).unwrap();
+            let value_005 = $struct_name::from_asc_bytes(&asc_bytes, &Version::new(0, 0, 5)).unwrap();
+
+            // turn the values into bytes again to verify that they are the same as the original
+            // because these types usually don't implement PartialEq
+            assert_eq!(
+                asc_bytes,
+                value_004.to_asc_bytes().unwrap(),
+                "Expected {} v0.0.4 asc bytes to be the same",
+                stringify!($struct_name)
+            );
+            assert_eq!(
+                asc_bytes,
+                value_005.to_asc_bytes().unwrap(),
+                "Expected {} v0.0.5 asc bytes to be the same",
+                stringify!($struct_name)
+            );
+        };
+    }
+
+    #[test]
+    fn test_asc_type_alignment() {
+        // TODO: automatically generate these tests for each struct in derive(AscType) macro
+
+        assert_asc_bytes!(AscBlock {
+            header: new_asc_ptr(),
+            evidence: new_asc_ptr(),
+            last_commit: new_asc_ptr(),
+            result_begin_block: new_asc_ptr(),
+            result_end_block: new_asc_ptr(),
+            transactions: new_asc_ptr(),
+            validator_updates: new_asc_ptr(),
+        });
+
+        assert_asc_bytes!(AscHeaderOnlyBlock {
+            header: new_asc_ptr(),
+        });
+
+        assert_asc_bytes!(AscEventData {
+            event: new_asc_ptr(),
+            block: new_asc_ptr(),
+        });
+
+        assert_asc_bytes!(AscTransactionData {
+            tx: new_asc_ptr(),
+            block: new_asc_ptr(),
+        });
+
+        assert_asc_bytes!(AscHeader {
+            version: new_asc_ptr(),
+            chain_id: new_asc_ptr(),
+            height: 20,
+            time: new_asc_ptr(),
+            last_block_id: new_asc_ptr(),
+            last_commit_hash: new_asc_ptr(),
+            data_hash: new_asc_ptr(),
+            validators_hash: new_asc_ptr(),
+            next_validators_hash: new_asc_ptr(),
+            consensus_hash: new_asc_ptr(),
+            app_hash: new_asc_ptr(),
+            last_results_hash: new_asc_ptr(),
+            evidence_hash: new_asc_ptr(),
+            proposer_address: new_asc_ptr(),
+            hash: new_asc_ptr(),
+        });
+
+        assert_asc_bytes!(AscConsensus { block: 0, app: 0 });
+
+        assert_asc_bytes!(AscTimestamp {
+            seconds: 20,
+            nanos: 20,
+        });
+
+        assert_asc_bytes!(AscBlockId {
+            hash: new_asc_ptr(),
+            part_set_header: new_asc_ptr(),
+        });
+
+        assert_asc_bytes!(AscPartSetHeader {
+            total: 20,
+            hash: new_asc_ptr(),
+        });
+
+        assert_asc_bytes!(AscEvidenceList {
+            evidence: new_asc_ptr(),
+        });
+
+        assert_asc_bytes!(AscEvidence {
+            duplicate_vote_evidence: new_asc_ptr(),
+            light_client_attack_evidence: new_asc_ptr(),
+        });
+
+        assert_asc_bytes!(AscDuplicateVoteEvidence {
+            vote_a: new_asc_ptr(),
+            vote_b: new_asc_ptr(),
+            total_voting_power: 20,
+            validator_power: 20,
+            timestamp: new_asc_ptr(),
+        });
+
+        assert_asc_bytes!(AscEventVote {
+            event_vote_type: 20,
+            height: 20,
+            round: 20,
+            block_id: new_asc_ptr(),
+            timestamp: new_asc_ptr(),
+            validator_address: new_asc_ptr(),
+            validator_index: 20,
+            signature: new_asc_ptr(),
+        });
+
+        assert_asc_bytes!(AscLightClientAttackEvidence {
+            conflicting_block: new_asc_ptr(),
+            common_height: 20,
+            total_voting_power: 20,
+            byzantine_validators: new_asc_ptr(),
+            timestamp: new_asc_ptr(),
+        });
+
+        assert_asc_bytes!(AscLightBlock {
+            signed_header: new_asc_ptr(),
+            validator_set: new_asc_ptr(),
+        });
+
+        assert_asc_bytes!(AscSignedHeader {
+            header: new_asc_ptr(),
+            commit: new_asc_ptr(),
+        });
+
+        assert_asc_bytes!(AscCommit {
+            height: 20,
+            round: 20,
+            block_id: new_asc_ptr(),
+            signatures: new_asc_ptr(),
+        });
+
+        assert_asc_bytes!(AscCommitSig {
+            block_id_flag: 20,
+            validator_address: new_asc_ptr(),
+            timestamp: new_asc_ptr(),
+            signature: new_asc_ptr(),
+        });
+
+        assert_asc_bytes!(AscValidatorSet {
+            validators: new_asc_ptr(),
+            proposer: new_asc_ptr(),
+            total_voting_power: 20,
+        });
+
+        assert_asc_bytes!(AscValidator {
+            address: new_asc_ptr(),
+            pub_key: new_asc_ptr(),
+            voting_power: 20,
+            proposer_priority: 20,
+        });
+
+        assert_asc_bytes!(AscPublicKey {
+            ed25519: new_asc_ptr(),
+            secp256k1: new_asc_ptr(),
+        });
+
+        assert_asc_bytes!(AscResponseBeginBlock {
+            events: new_asc_ptr(),
+        });
+
+        assert_asc_bytes!(AscEvent {
+            event_type: new_asc_ptr(),
+            attributes: new_asc_ptr(),
+        });
+
+        assert_asc_bytes!(AscEventAttribute {
+            key: new_asc_ptr(),
+            value: new_asc_ptr(),
+            index: true,
+        });
+
+        assert_asc_bytes!(AscResponseEndBlock {
+            validator_updates: new_asc_ptr(),
+            consensus_param_updates: new_asc_ptr(),
+            events: new_asc_ptr(),
+        });
+
+        assert_asc_bytes!(AscValidatorUpdate {
+            address: new_asc_ptr(),
+            pub_key: new_asc_ptr(),
+            power: 20,
+        });
+
+        assert_asc_bytes!(AscConsensusParams {
+            block: new_asc_ptr(),
+            evidence: new_asc_ptr(),
+            validator: new_asc_ptr(),
+            version: new_asc_ptr(),
+        });
+
+        assert_asc_bytes!(AscBlockParams {
+            max_bytes: 20,
+            max_gas: 20,
+        });
+
+        assert_asc_bytes!(AscEvidenceParams {
+            max_age_num_blocks: 20,
+            max_age_duration: new_asc_ptr(),
+            max_bytes: 20,
+        });
+
+        assert_asc_bytes!(AscDuration {
+            seconds: 20,
+            nanos: 20,
+        });
+
+        assert_asc_bytes!(AscValidatorParams {
+            pub_key_types: new_asc_ptr(),
+        });
+
+        assert_asc_bytes!(AscVersionParams { app_version: 20 });
+
+        assert_asc_bytes!(AscTxResult {
+            height: 20,
+            index: 20,
+            tx: new_asc_ptr(),
+            result: new_asc_ptr(),
+            hash: new_asc_ptr(),
+        });
+
+        assert_asc_bytes!(AscTx {
+            body: new_asc_ptr(),
+            auth_info: new_asc_ptr(),
+            signatures: new_asc_ptr(),
+        });
+
+        assert_asc_bytes!(AscTxBody {
+            messages: new_asc_ptr(),
+            memo: new_asc_ptr(),
+            timeout_height: 20,
+            extension_options: new_asc_ptr(),
+            non_critical_extension_options: new_asc_ptr(),
+        });
+
+        assert_asc_bytes!(AscAny {
+            type_url: new_asc_ptr(),
+            value: new_asc_ptr(),
+        });
+
+        assert_asc_bytes!(AscAuthInfo {
+            signer_infos: new_asc_ptr(),
+            fee: new_asc_ptr(),
+            tip: new_asc_ptr(),
+        });
+
+        assert_asc_bytes!(AscSignerInfo {
+            public_key: new_asc_ptr(),
+            mode_info: new_asc_ptr(),
+            sequence: 20,
+        });
+
+        assert_asc_bytes!(AscModeInfo {
+            single: new_asc_ptr(),
+            multi: new_asc_ptr(),
+        });
+
+        assert_asc_bytes!(AscModeInfoSingle { mode: 20 });
+
+        assert_asc_bytes!(AscModeInfoMulti {
+            bitarray: new_asc_ptr(),
+            mode_infos: new_asc_ptr(),
+        });
+
+        assert_asc_bytes!(AscCompactBitArray {
+            extra_bits_stored: 20,
+            elems: new_asc_ptr(),
+        });
+
+        assert_asc_bytes!(AscFee {
+            amount: new_asc_ptr(),
+            gas_limit: 20,
+            payer: new_asc_ptr(),
+            granter: new_asc_ptr(),
+        });
+
+        assert_asc_bytes!(AscCoin {
+            denom: new_asc_ptr(),
+            amount: new_asc_ptr(),
+        });
+
+        assert_asc_bytes!(AscTip {
+            amount: new_asc_ptr(),
+            tipper: new_asc_ptr(),
+        });
+
+        assert_asc_bytes!(AscResponseDeliverTx {
+            code: 20,
+            data: new_asc_ptr(),
+            log: new_asc_ptr(),
+            info: new_asc_ptr(),
+            gas_wanted: 20,
+            gas_used: 20,
+            events: new_asc_ptr(),
+            codespace: new_asc_ptr(),
+        });
+
+        assert_asc_bytes!(AscValidatorSetUpdates {
+            validator_updates: new_asc_ptr(),
+        });
+    }
+
+    // non-null AscPtr
+    fn new_asc_ptr<T>() -> AscPtr<T> {
+        AscPtr::new(12)
+    }
+}
diff --git a/chain/cosmos/src/runtime/runtime_adapter.rs b/chain/cosmos/src/runtime/runtime_adapter.rs
new file mode 100644
index 0000000..4bced40
--- /dev/null
+++ b/chain/cosmos/src/runtime/runtime_adapter.rs
@@ -0,0 +1,12 @@
+use crate::{Chain, DataSource};
+use anyhow::Result;
+use blockchain::HostFn;
+use graph::blockchain;
+
+pub struct RuntimeAdapter {}
+
+impl blockchain::RuntimeAdapter<Chain> for RuntimeAdapter {
+    fn host_fns(&self, _ds: &DataSource) -> Result<Vec<HostFn>> {
+        Ok(vec![])
+    }
+}
diff --git a/chain/cosmos/src/trigger.rs b/chain/cosmos/src/trigger.rs
new file mode 100644
index 0000000..35880c5
--- /dev/null
+++ b/chain/cosmos/src/trigger.rs
@@ -0,0 +1,230 @@
+use std::{cmp::Ordering, sync::Arc};
+
+use graph::blockchain::{Block, BlockHash, TriggerData};
+use graph::cheap_clone::CheapClone;
+use graph::prelude::{BlockNumber, Error};
+use graph::runtime::{asc_new, gas::GasCounter, AscHeap, AscPtr, DeterministicHostError};
+use graph_runtime_wasm::module::ToAscPtr;
+
+use crate::codec;
+use crate::data_source::EventOrigin;
+
+// Logging the block is too verbose, so this strips the block from the trigger for Debug.
+impl std::fmt::Debug for CosmosTrigger {
+    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
+        #[derive(Debug)]
+        pub enum MappingTriggerWithoutBlock<'e> {
+            Block,
+            Event {
+                event_type: &'e str,
+                origin: EventOrigin,
+            },
+            Transaction,
+        }
+
+        let trigger_without_block = match self {
+            CosmosTrigger::Block(_) => MappingTriggerWithoutBlock::Block,
+            CosmosTrigger::Event { event_data, origin } => MappingTriggerWithoutBlock::Event {
+                event_type: &event_data.event().map_err(|_| std::fmt::Error)?.event_type,
+                origin: *origin,
+            },
+            CosmosTrigger::Transaction(_) => MappingTriggerWithoutBlock::Transaction,
+        };
+
+        write!(f, "{:?}", trigger_without_block)
+    }
+}
+
+impl ToAscPtr for CosmosTrigger {
+    fn to_asc_ptr<H: AscHeap>(
+        self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscPtr<()>, DeterministicHostError> {
+        Ok(match self {
+            CosmosTrigger::Block(block) => asc_new(heap, block.as_ref(), gas)?.erase(),
+            CosmosTrigger::Event { event_data, .. } => {
+                asc_new(heap, event_data.as_ref(), gas)?.erase()
+            }
+            CosmosTrigger::Transaction(transaction_data) => {
+                asc_new(heap, transaction_data.as_ref(), gas)?.erase()
+            }
+        })
+    }
+}
+
+#[derive(Clone)]
+pub enum CosmosTrigger {
+    Block(Arc<codec::Block>),
+    Event {
+        event_data: Arc<codec::EventData>,
+        origin: EventOrigin,
+    },
+    Transaction(Arc<codec::TransactionData>),
+}
+
+impl CheapClone for CosmosTrigger {
+    fn cheap_clone(&self) -> CosmosTrigger {
+        match self {
+            CosmosTrigger::Block(block) => CosmosTrigger::Block(block.cheap_clone()),
+            CosmosTrigger::Event { event_data, origin } => CosmosTrigger::Event {
+                event_data: event_data.cheap_clone(),
+                origin: *origin,
+            },
+            CosmosTrigger::Transaction(transaction_data) => {
+                CosmosTrigger::Transaction(transaction_data.cheap_clone())
+            }
+        }
+    }
+}
+
+impl PartialEq for CosmosTrigger {
+    fn eq(&self, other: &Self) -> bool {
+        match (self, other) {
+            (Self::Block(a_ptr), Self::Block(b_ptr)) => a_ptr == b_ptr,
+            (
+                Self::Event {
+                    event_data: a_event_data,
+                    origin: a_origin,
+                },
+                Self::Event {
+                    event_data: b_event_data,
+                    origin: b_origin,
+                },
+            ) => {
+                if let (Ok(a_event), Ok(b_event)) = (a_event_data.event(), b_event_data.event()) {
+                    a_event.event_type == b_event.event_type && a_origin == b_origin
+                } else {
+                    false
+                }
+            }
+            (Self::Transaction(a_ptr), Self::Transaction(b_ptr)) => a_ptr == b_ptr,
+            _ => false,
+        }
+    }
+}
+
+impl Eq for CosmosTrigger {}
+
+impl CosmosTrigger {
+    pub(crate) fn with_event(
+        event: codec::Event,
+        block: codec::HeaderOnlyBlock,
+        origin: EventOrigin,
+    ) -> CosmosTrigger {
+        CosmosTrigger::Event {
+            event_data: Arc::new(codec::EventData {
+                event: Some(event),
+                block: Some(block),
+            }),
+            origin,
+        }
+    }
+
+    pub(crate) fn with_transaction(
+        tx_result: codec::TxResult,
+        block: codec::HeaderOnlyBlock,
+    ) -> CosmosTrigger {
+        CosmosTrigger::Transaction(Arc::new(codec::TransactionData {
+            tx: Some(tx_result),
+            block: Some(block),
+        }))
+    }
+
+    pub fn block_number(&self) -> Result<BlockNumber, Error> {
+        match self {
+            CosmosTrigger::Block(block) => Ok(block.number()),
+            CosmosTrigger::Event { event_data, .. } => event_data.block().map(|b| b.number()),
+            CosmosTrigger::Transaction(transaction_data) => {
+                transaction_data.block().map(|b| b.number())
+            }
+        }
+    }
+
+    pub fn block_hash(&self) -> Result<BlockHash, Error> {
+        match self {
+            CosmosTrigger::Block(block) => Ok(block.hash()),
+            CosmosTrigger::Event { event_data, .. } => event_data.block().map(|b| b.hash()),
+            CosmosTrigger::Transaction(transaction_data) => {
+                transaction_data.block().map(|b| b.hash())
+            }
+        }
+    }
+}
+
+impl Ord for CosmosTrigger {
+    fn cmp(&self, other: &Self) -> Ordering {
+        match (self, other) {
+            // Keep the order when comparing two block triggers
+            (Self::Block(..), Self::Block(..)) => Ordering::Equal,
+
+            // Block triggers always come last
+            (Self::Block(..), _) => Ordering::Greater,
+            (_, Self::Block(..)) => Ordering::Less,
+
+            // Events have no intrinsic ordering information, so we keep the order in
+            // which they are included in the `events` field
+            (Self::Event { .. }, Self::Event { .. }) => Ordering::Equal,
+
+            // Transactions are ordered by their index inside the block
+            (Self::Transaction(a), Self::Transaction(b)) => {
+                if let (Ok(a_tx_result), Ok(b_tx_result)) = (a.tx_result(), b.tx_result()) {
+                    a_tx_result.index.cmp(&b_tx_result.index)
+                } else {
+                    Ordering::Equal
+                }
+            }
+
+            // When comparing events and transactions, transactions go first
+            (Self::Transaction(..), Self::Event { .. }) => Ordering::Less,
+            (Self::Event { .. }, Self::Transaction(..)) => Ordering::Greater,
+        }
+    }
+}
+
+impl PartialOrd for CosmosTrigger {
+    fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
+        Some(self.cmp(other))
+    }
+}
+
+impl TriggerData for CosmosTrigger {
+    fn error_context(&self) -> std::string::String {
+        match self {
+            CosmosTrigger::Block(..) => {
+                if let (Ok(block_number), Ok(block_hash)) = (self.block_number(), self.block_hash())
+                {
+                    format!("block #{block_number}, hash {block_hash}")
+                } else {
+                    "block".to_string()
+                }
+            }
+            CosmosTrigger::Event { event_data, origin } => {
+                if let (Ok(event), Ok(block_number), Ok(block_hash)) =
+                    (event_data.event(), self.block_number(), self.block_hash())
+                {
+                    format!(
+                        "event type {}, origin: {:?}, block #{block_number}, hash {block_hash}",
+                        event.event_type, origin,
+                    )
+                } else {
+                    "event in block".to_string()
+                }
+            }
+            CosmosTrigger::Transaction(transaction_data) => {
+                if let (Ok(block_number), Ok(block_hash), Ok(response_deliver_tx)) = (
+                    self.block_number(),
+                    self.block_hash(),
+                    transaction_data.response_deliver_tx(),
+                ) {
+                    format!(
+                        "block #{block_number}, hash {block_hash}, transaction log: {}",
+                        response_deliver_tx.log
+                    )
+                } else {
+                    "transaction block".to_string()
+                }
+            }
+        }
+    }
+}
diff --git a/chain/ethereum/Cargo.toml b/chain/ethereum/Cargo.toml
new file mode 100644
index 0000000..b3143cd
--- /dev/null
+++ b/chain/ethereum/Cargo.toml
@@ -0,0 +1,32 @@
+[package]
+name = "graph-chain-ethereum"
+version = "0.27.0"
+edition = "2021"
+
+[dependencies]
+envconfig = "0.10.0"
+futures = "0.1.21"
+http = "0.2.4"
+jsonrpc-core = "18.0.0"
+graph = { path = "../../graph" }
+lazy_static = "1.2.0"
+serde = "1.0"
+prost = "0.10.4"
+prost-types = "0.10.1"
+dirs-next = "2.0"
+anyhow = "1.0"
+tiny-keccak = "1.5.0"
+hex = "0.4.3"
+semver = "1.0.12"
+
+itertools = "0.10.3"
+
+graph-runtime-wasm = { path = "../../runtime/wasm" }
+graph-runtime-derive = { path = "../../runtime/derive" }
+
+[dev-dependencies]
+test-store = { path = "../../store/test-store" }
+base64 = "0.13.0"
+
+[build-dependencies]
+tonic-build = { version = "0.7.2", features = ["prost"] }
diff --git a/chain/ethereum/build.rs b/chain/ethereum/build.rs
new file mode 100644
index 0000000..0efb360
--- /dev/null
+++ b/chain/ethereum/build.rs
@@ -0,0 +1,8 @@
+fn main() {
+    println!("cargo:rerun-if-changed=proto");
+
+    tonic_build::configure()
+        .out_dir("src/protobuf")
+        .compile(&["proto/codec.proto"], &["proto"])
+        .expect("Failed to compile Firehose Ethereum proto(s)");
+}
diff --git a/chain/ethereum/examples/firehose.rs b/chain/ethereum/examples/firehose.rs
new file mode 100644
index 0000000..d2088b2
--- /dev/null
+++ b/chain/ethereum/examples/firehose.rs
@@ -0,0 +1,102 @@
+use anyhow::Error;
+use graph::{
+    env::env_var,
+    prelude::{prost, tokio, tonic},
+    {firehose, firehose::FirehoseEndpoint, firehose::ForkStep},
+};
+use graph_chain_ethereum::codec;
+use hex::ToHex;
+use prost::Message;
+use std::sync::Arc;
+use tonic::Streaming;
+
+#[tokio::main]
+async fn main() -> Result<(), Error> {
+    let mut cursor: Option<String> = None;
+    let token_env = env_var("SF_API_TOKEN", "".to_string());
+    let mut token: Option<String> = None;
+    if token_env.len() > 0 {
+        token = Some(token_env);
+    }
+
+    let firehose = Arc::new(FirehoseEndpoint::new(
+        "firehose",
+        "https://api.streamingfast.io:443",
+        token,
+        false,
+        false,
+        1,
+    ));
+
+    loop {
+        println!("Connecting to the stream!");
+        let mut stream: Streaming<firehose::Response> = match firehose
+            .clone()
+            .stream_blocks(firehose::Request {
+                start_block_num: 12369739,
+                stop_block_num: 12369739,
+                start_cursor: match &cursor {
+                    Some(c) => c.clone(),
+                    None => String::from(""),
+                },
+                fork_steps: vec![ForkStep::StepNew as i32, ForkStep::StepUndo as i32],
+                ..Default::default()
+            })
+            .await
+        {
+            Ok(s) => s,
+            Err(e) => {
+                println!("Could not connect to stream! {}", e);
+                continue;
+            }
+        };
+
+        loop {
+            let resp = match stream.message().await {
+                Ok(Some(t)) => t,
+                Ok(None) => {
+                    println!("Stream completed");
+                    return Ok(());
+                }
+                Err(e) => {
+                    println!("Error getting message {}", e);
+                    break;
+                }
+            };
+
+            let b = codec::Block::decode(resp.block.unwrap().value.as_ref());
+            match b {
+                Ok(b) => {
+                    println!(
+                        "Block #{} ({}) ({})",
+                        b.number,
+                        hex::encode(b.hash),
+                        resp.step
+                    );
+                    b.transaction_traces.iter().for_each(|trx| {
+                        let mut logs: Vec<String> = vec![];
+                        trx.calls.iter().for_each(|call| {
+                            call.logs.iter().for_each(|log| {
+                                logs.push(format!(
+                                    "Log {} Topics, Address {}, Trx Index {}, Block Index {}",
+                                    log.topics.len(),
+                                    log.address.encode_hex::<String>(),
+                                    log.index,
+                                    log.block_index
+                                ));
+                            })
+                        });
+
+                        if logs.len() > 0 {
+                            println!("Transaction {}", trx.hash.encode_hex::<String>());
+                            logs.iter().for_each(|log| println!("{}", log));
+                        }
+                    });
+
+                    cursor = Some(resp.cursor)
+                }
+                Err(e) => panic!("Unable to decode {:?}", e),
+            }
+        }
+    }
+}
diff --git a/chain/ethereum/proto/codec.proto b/chain/ethereum/proto/codec.proto
new file mode 100644
index 0000000..3c9f737
--- /dev/null
+++ b/chain/ethereum/proto/codec.proto
@@ -0,0 +1,508 @@
+syntax = "proto3";
+
+package sf.ethereum.type.v2;
+
+option go_package = "github.com/streamingfast/sf-ethereum/types/pb/sf/ethereum/type/v2;pbeth";
+
+import "google/protobuf/timestamp.proto";
+
+message Block {
+  int32 ver = 1;
+  bytes hash = 2;
+  uint64 number = 3;
+  uint64 size = 4;
+  BlockHeader header = 5;
+
+  // Uncles represents block produced with a valid solution but were not actually choosen
+  // as the canonical block for the given height so they are mostly "forked" blocks.
+  //
+  // If the Block has been produced using the Proof of Stake consensus algorithm, this
+  // field will actually be always empty.
+  repeated BlockHeader uncles = 6;
+
+  repeated TransactionTrace transaction_traces = 10;
+  repeated BalanceChange balance_changes = 11;
+  repeated CodeChange code_changes = 20;
+
+  reserved 40; // bool filtering_applied = 40 [deprecated = true];
+  reserved 41; // string filtering_include_filter_expr = 41 [deprecated = true];
+  reserved 42; // string filtering_exclude_filter_expr = 42 [deprecated = true];
+}
+
+// HeaderOnlyBlock is used to optimally unpack the [Block] structure (note the
+// corresponding message number for the `header` field) while consuming less
+// memory, when only the `header` is desired.
+//
+// WARN: this is a client-side optimization pattern and should be moved in the
+// consuming code.
+message HeaderOnlyBlock {
+  BlockHeader header = 5;
+}
+
+// BlockWithRefs is a lightweight block, with traces and transactions
+// purged from the `block` within, and only.  It is used in transports
+// to pass block data around.
+message BlockWithRefs {
+  string id = 1;
+  Block block = 2;
+  TransactionRefs transaction_trace_refs = 3;
+  bool irreversible = 4;
+}
+
+message TransactionRefs {
+  repeated bytes hashes = 1;
+}
+
+message UnclesHeaders {
+  repeated BlockHeader uncles = 1;
+}
+
+message BlockRef {
+  bytes hash = 1;
+  uint64 number = 2;
+}
+
+message BlockHeader {
+  bytes parent_hash = 1;
+
+  // Uncle hash of the block, some reference it as `sha3Uncles`, but `sha3`` is badly worded, so we prefer `uncle_hash`, also
+  // referred as `ommers` in EIP specification.
+  //
+  // If the Block containing this `BlockHeader` has been produced using the Proof of Stake
+  // consensus algorithm, this field will actually be constant and set to `0x1dcc4de8dec75d7aab85b567b6ccd41ad312451b948a7413f0a142fd40d49347`.
+  bytes uncle_hash = 2;
+
+  bytes coinbase = 3;
+  bytes state_root = 4;
+  bytes transactions_root = 5;
+  bytes receipt_root = 6;
+  bytes logs_bloom = 7;
+
+  // Difficulty is the difficulty of the Proof of Work algorithm that was required to compute a solution.
+  //
+  // If the Block containing this `BlockHeader` has been produced using the Proof of Stake
+  // consensus algorithm, this field will actually be constant and set to `0x00`.
+  BigInt difficulty = 8;
+
+  // TotalDifficulty is the sum of all previous blocks difficulty including this block difficulty.
+  //
+  // If the Block containing this `BlockHeader` has been produced using the Proof of Stake
+  // consensus algorithm, this field will actually be constant and set to the terminal total difficulty
+  // that was required to transition to Proof of Stake algorithm, which varies per network. It is set to
+  // 58 750 000 000 000 000 000 000 on Ethereum Mainnet and to 10 790 000 on Ethereum Testnet Goerli.
+  BigInt total_difficulty = 17;
+
+  uint64 number = 9;
+  uint64 gas_limit = 10;
+  uint64 gas_used = 11;
+  google.protobuf.Timestamp timestamp = 12;
+
+  // ExtraData is free-form bytes included in the block by the "miner". While on Yellow paper of
+  // Ethereum this value is maxed to 32 bytes, other consensus algorithm like Clique and some other
+  // forks are using bigger values to carry special consensus data.
+  //
+  // If the Block containing this `BlockHeader` has been produced using the Proof of Stake
+  // consensus algorithm, this field is strictly enforced to be <= 32 bytes.
+  bytes extra_data = 13;
+
+  // MixHash is used to prove, when combined with the `nonce` that sufficient amount of computation has been
+  // achieved and that the solution found is valid.
+  bytes mix_hash = 14;
+
+  // Nonce is used to prove, when combined with the `mix_hash` that sufficient amount of computation has been
+  // achieved and that the solution found is valid.
+  //
+  // If the Block containing this `BlockHeader` has been produced using the Proof of Stake
+  // consensus algorithm, this field will actually be constant and set to `0`.
+  uint64 nonce = 15;
+
+  // Hash is the hash of the block which is actually the computation:
+  //
+  //  Keccak256(rlp([
+  //    parent_hash,
+  //    uncle_hash,
+  //    coinbase,
+  //    state_root,
+  //    transactions_root,
+  //    receipt_root,
+  //    logs_bloom,
+  //    difficulty,
+  //    number,
+  //    gas_limit,
+  //    gas_used,
+  //    timestamp,
+  //    extra_data,
+  //    mix_hash,
+  //    nonce,
+  //    base_fee_per_gas
+  //  ]))
+  //
+  bytes hash = 16;
+
+  // Base fee per gas according to EIP-1559 (e.g. London Fork) rules, only set if London is present/active on the chain.
+  BigInt base_fee_per_gas = 18;
+}
+
+message BigInt {
+  bytes bytes = 1;
+}
+
+message TransactionTrace {
+  // consensus
+  bytes to = 1;
+  uint64 nonce = 2;
+  // GasPrice represents the effective price that has been paid for each gas unit of this transaction. Over time, the
+  // Ethereum rules changes regarding GasPrice field here. Before London fork, the GasPrice was always set to the
+  // fixed gas price. After London fork, this value has different meaning depending on the transaction type (see `Type` field).
+  //
+  // In cases where `TransactionTrace.Type == TRX_TYPE_LEGACY || TRX_TYPE_ACCESS_LIST`, then GasPrice has the same meaning
+  // as before the London fork.
+  //
+  // In cases where `TransactionTrace.Type == TRX_TYPE_DYNAMIC_FEE`, then GasPrice is the effective gas price paid
+  // for the transaction which is equals to `BlockHeader.BaseFeePerGas + TransactionTrace.`
+  BigInt gas_price = 3;
+
+  // GasLimit is the maximum of gas unit the sender of the transaction is willing to consume when perform the EVM
+  // execution of the whole transaction
+  uint64 gas_limit = 4;
+
+  // Value is the amount of Ether transferred as part of this transaction.
+  BigInt value = 5;
+
+  // Input data the transaction will receive for execution of EVM.
+  bytes input = 6;
+
+  // V is the recovery ID value for the signature Y point.
+  bytes v = 7;
+
+  // R is the signature's X point on the elliptic curve (32 bytes).
+  bytes r = 8;
+
+  // S is the signature's Y point on the elliptic curve (32 bytes).
+  bytes s = 9;
+
+  // GasUsed is the total amount of gas unit used for the whole execution of the transaction.
+  uint64 gas_used = 10;
+
+  // Type represents the Ethereum transaction type, available only since EIP-2718 & EIP-2930 activation which happened on Berlin fork.
+  // The value is always set even for transaction before Berlin fork because those before the fork are still legacy transactions.
+  Type type = 12;
+
+  enum Type {
+    // All transactions that ever existed prior Berlin fork before EIP-2718 was implemented.
+    TRX_TYPE_LEGACY = 0;
+
+    // Field that specifies an access list of contract/storage_keys that is going to be used
+    // in this transaction.
+    //
+    // Added in Berlin fork (EIP-2930).
+    TRX_TYPE_ACCESS_LIST = 1;
+
+    // Transaction that specifies an access list just like TRX_TYPE_ACCESS_LIST but in addition defines the
+    // max base gas gee and max priority gas fee to pay for this transaction. Transaction's of those type are
+    // executed against EIP-1559 rules which dictates a dynamic gas cost based on the congestion of the network.
+    TRX_TYPE_DYNAMIC_FEE = 2;
+  }
+
+  // AcccessList represents the storage access this transaction has agreed to do in which case those storage
+  // access cost less gas unit per access.
+  //
+  // This will is populated only if `TransactionTrace.Type == TRX_TYPE_ACCESS_LIST || TRX_TYPE_DYNAMIC_FEE` which
+  // is possible only if Berlin (TRX_TYPE_ACCESS_LIST) nor London (TRX_TYPE_DYNAMIC_FEE) fork are active on the chain.
+  repeated AccessTuple access_list = 14;
+
+  // MaxFeePerGas is the maximum fee per gas the user is willing to pay for the transaction gas used.
+  //
+  // This will is populated only if `TransactionTrace.Type == TRX_TYPE_DYNAMIC_FEE` which is possible only
+  // if London fork is active on the chain.
+  BigInt max_fee_per_gas = 11;
+
+  // MaxPriorityFeePerGas is priority fee per gas the user to pay in extra to the miner on top of the block's
+  // base fee.
+  //
+  // This will is populated only if `TransactionTrace.Type == TRX_TYPE_DYNAMIC_FEE` which is possible only
+  // if London fork is active on the chain.
+  BigInt max_priority_fee_per_gas = 13;
+
+  // meta
+  uint32 index = 20;
+  bytes hash = 21;
+  bytes from = 22;
+  bytes return_data = 23;
+  bytes public_key = 24;
+  uint64 begin_ordinal = 25;
+  uint64 end_ordinal = 26;
+
+  TransactionTraceStatus status = 30;
+  TransactionReceipt receipt = 31;
+  repeated Call calls = 32;
+}
+
+
+// AccessTuple represents a list of storage keys for a given contract's address and is used
+// for AccessList construction.
+message AccessTuple {
+  bytes address = 1;
+  repeated bytes storage_keys = 2;
+}
+
+// TransactionTraceWithBlockRef
+message TransactionTraceWithBlockRef {
+  TransactionTrace trace = 1;
+  BlockRef block_ref = 2;
+}
+
+enum TransactionTraceStatus {
+  UNKNOWN = 0;
+  SUCCEEDED = 1;
+  FAILED = 2;
+  REVERTED = 3;
+}
+
+message TransactionReceipt {
+  // State root is an intermediate state_root hash, computed in-between transactions to make
+  // **sure** you could build a proof and point to state in the middle of a block. Geth client
+  // uses `PostState + root + PostStateOrStatus`` while Parity used `status_code, root...`` this piles
+  // hardforks, see (read the EIPs first):
+  // - https://github.com/eoscanada/go-ethereum-private/blob/deep-mind/core/types/receipt.go#L147
+  // - https://github.com/eoscanada/go-ethereum-private/blob/deep-mind/core/types/receipt.go#L50-L86
+  // - https://github.com/ethereum/EIPs/blob/master/EIPS/eip-658.md
+  //
+  // Moreover, the notion of `Outcome`` in parity, which segregates the two concepts, which are
+  // stored in the same field `status_code`` can be computed based on such a hack of the `state_root`
+  // field, following `EIP-658`.
+  //
+  // Before Byzantinium hard fork, this field is always empty.
+  bytes state_root = 1;
+  uint64 cumulative_gas_used = 2;
+  bytes logs_bloom = 3;
+  repeated Log logs = 4;
+}
+
+message Log {
+  bytes address = 1;
+  repeated bytes topics = 2;
+  bytes data = 3;
+
+  // Index is the index of the log relative to the transaction. This index
+  // is always populated regardless of the state revertion of the the call
+  // that emitted this log.
+  uint32 index = 4;
+
+  // BlockIndex represents the index of the log relative to the Block.
+  //
+  // An **important** notice is that this field will be 0 when the call
+  // that emitted the log has been reverted by the chain.
+  //
+  // Currently, there is two locations where a Log can be obtained:
+  // - block.transaction_traces[].receipt.logs[]
+  // - block.transaction_traces[].calls[].logs[]
+  //
+  // In the `receipt` case, the logs will be populated only when the call
+  // that emitted them has not been reverted by the chain and when in this
+  // position, the `blockIndex` is always populated correctly.
+  //
+  // In the case of `calls` case, for `call` where `stateReverted == true`,
+  // the `blockIndex` value will always be 0.
+  uint32 blockIndex = 6;
+
+  uint64 ordinal = 7;
+}
+
+message Call {
+  uint32 index = 1;
+  uint32 parent_index = 2;
+  uint32 depth = 3;
+  CallType call_type = 4;
+  bytes caller = 5;
+  bytes address = 6;
+  BigInt value = 7;
+  uint64 gas_limit = 8;
+  uint64 gas_consumed = 9;
+  bytes return_data = 13;
+  bytes input = 14;
+  bool executed_code = 15;
+  bool suicide = 16;
+
+  /* hex representation of the hash -> preimage */
+  map<string, string> keccak_preimages = 20;
+  repeated StorageChange storage_changes = 21;
+  repeated BalanceChange balance_changes = 22;
+  repeated NonceChange nonce_changes = 24;
+  repeated Log logs = 25;
+  repeated CodeChange code_changes = 26;
+
+  // Deprecated: repeated bytes created_accounts
+  reserved 27;
+
+  repeated GasChange gas_changes = 28;
+
+  // Deprecated: repeated GasEvent gas_events
+  reserved 29;
+
+  // In Ethereum, a call can be either:
+  // - Successfull, execution passes without any problem encountered
+  // - Failed, execution failed, and remaining gas should be consumed
+  // - Reverted, execution failed, but only gas consumed so far is billed, remaining gas is refunded
+  //
+  // When a call is either `failed` or `reverted`, the `status_failed` field
+  // below is set to `true`. If the status is `reverted`, then both `status_failed`
+  // and `status_reverted` are going to be set to `true`.
+  bool status_failed = 10;
+  bool status_reverted = 12;
+
+  // Populated when a call either failed or reverted, so when `status_failed == true`,
+  // see above for details about those flags.
+  string failure_reason = 11;
+
+  // This field represents wheter or not the state changes performed
+  // by this call were correctly recorded by the blockchain.
+  //
+  // On Ethereum, a transaction can record state changes even if some
+  // of its inner nested calls failed. This is problematic however since
+  // a call will invalidate all its state changes as well as all state
+  // changes performed by its child call. This means that even if a call
+  // has a status of `SUCCESS`, the chain might have reverted all the state
+  // changes it performed.
+  //
+  // ```text
+  //   Trx 1
+  //    Call #1 <Failed>
+  //      Call #2 <Execution Success>
+  //      Call #3 <Execution Success>
+  //      |--- Failure here
+  //    Call #4
+  // ```
+  //
+  // In the transaction above, while Call #2 and Call #3 would have the
+  // status `EXECUTED`
+  bool state_reverted = 30;
+
+  uint64 begin_ordinal = 31;
+  uint64 end_ordinal = 32;
+
+  repeated AccountCreation account_creations = 33;
+
+  reserved 50; // repeated ERC20BalanceChange erc20_balance_changes = 50 [deprecated = true];
+  reserved 51; // repeated ERC20TransferEvent erc20_transfer_events = 51 [deprecated = true];
+  reserved 60; // bool filtering_matched = 60 [deprecated = true];
+}
+
+enum CallType {
+  UNSPECIFIED = 0;
+  CALL = 1; // direct? what's the name for `Call` alone?
+  CALLCODE = 2;
+  DELEGATE = 3;
+  STATIC = 4;
+  CREATE = 5; // create2 ? any other form of calls?
+}
+
+message StorageChange {
+  bytes address = 1;
+  bytes key = 2;
+  bytes old_value = 3;
+  bytes new_value = 4;
+
+  uint64 ordinal = 5;
+}
+
+message BalanceChange {
+  bytes address = 1;
+  BigInt old_value = 2;
+  BigInt new_value = 3;
+  Reason reason = 4;
+
+  // Obtain all balanche change reasons under deep mind repository:
+  //
+  // ```shell
+  // ack -ho 'BalanceChangeReason\(".*"\)' | grep -Eo '".*"' | sort | uniq
+  // ```
+  enum Reason {
+    REASON_UNKNOWN = 0;
+    REASON_REWARD_MINE_UNCLE = 1;
+    REASON_REWARD_MINE_BLOCK = 2;
+    REASON_DAO_REFUND_CONTRACT = 3;
+    REASON_DAO_ADJUST_BALANCE = 4;
+    REASON_TRANSFER = 5;
+    REASON_GENESIS_BALANCE = 6;
+    REASON_GAS_BUY = 7;
+    REASON_REWARD_TRANSACTION_FEE = 8;
+    REASON_REWARD_FEE_RESET = 14;
+    REASON_GAS_REFUND = 9;
+    REASON_TOUCH_ACCOUNT = 10;
+    REASON_SUICIDE_REFUND = 11;
+    REASON_SUICIDE_WITHDRAW = 13;
+    REASON_CALL_BALANCE_OVERRIDE = 12;
+    // Used on chain(s) where some Ether burning happens
+    REASON_BURN = 15;
+  }
+
+  uint64 ordinal = 5;
+}
+
+message NonceChange {
+  bytes address = 1;
+  uint64 old_value = 2;
+  uint64 new_value = 3;
+  uint64 ordinal = 4;
+}
+
+message AccountCreation {
+  bytes account = 1;
+  uint64 ordinal = 2;
+}
+
+message CodeChange {
+  bytes address = 1;
+  bytes old_hash = 2;
+  bytes old_code = 3;
+  bytes new_hash = 4;
+  bytes new_code = 5;
+
+  uint64 ordinal = 6;
+}
+
+// The gas change model represents the reason why some gas cost has occurred.
+// The gas is computed per actual op codes. Doing them completely might prove
+// overwhelming in most cases.
+//
+// Hence, we only index some of them, those that are costy like all the calls
+// one, log events, return data, etc.
+message GasChange {
+  uint64 old_value = 1;
+  uint64 new_value = 2;
+  Reason reason = 3;
+
+  // Obtain all gas change reasons under deep mind repository:
+  //
+  // ```shell
+  // ack -ho 'GasChangeReason\(".*"\)' | grep -Eo '".*"' | sort | uniq
+  // ```
+  enum Reason {
+    REASON_UNKNOWN = 0;
+    REASON_CALL = 1;
+    REASON_CALL_CODE = 2;
+    REASON_CALL_DATA_COPY = 3;
+    REASON_CODE_COPY = 4;
+    REASON_CODE_STORAGE = 5;
+    REASON_CONTRACT_CREATION = 6;
+    REASON_CONTRACT_CREATION2 = 7;
+    REASON_DELEGATE_CALL = 8;
+    REASON_EVENT_LOG = 9;
+    REASON_EXT_CODE_COPY = 10;
+    REASON_FAILED_EXECUTION = 11;
+    REASON_INTRINSIC_GAS = 12;
+    REASON_PRECOMPILED_CONTRACT = 13;
+    REASON_REFUND_AFTER_EXECUTION = 14;
+    REASON_RETURN = 15;
+    REASON_RETURN_DATA_COPY = 16;
+    REASON_REVERT = 17;
+    REASON_SELF_DESTRUCT = 18;
+    REASON_STATIC_CALL = 19;
+
+    // Added in Berlin fork (Geth 1.10+)
+    REASON_STATE_COLD_ACCESS = 20;
+  }
+
+  uint64 ordinal = 4;
+}
\ No newline at end of file
diff --git a/chain/ethereum/src/adapter.rs b/chain/ethereum/src/adapter.rs
new file mode 100644
index 0000000..18d5854
--- /dev/null
+++ b/chain/ethereum/src/adapter.rs
@@ -0,0 +1,1639 @@
+use anyhow::Error;
+use ethabi::{Error as ABIError, Function, ParamType, Token};
+use futures::Future;
+use graph::blockchain::ChainIdentifier;
+use graph::firehose::CallToFilter;
+use graph::firehose::CombinedFilter;
+use graph::firehose::LogFilter;
+use itertools::Itertools;
+use prost::Message;
+use prost_types::Any;
+use std::cmp;
+use std::collections::{HashMap, HashSet};
+use std::fmt;
+use std::marker::Unpin;
+use thiserror::Error;
+use tiny_keccak::keccak256;
+use web3::types::{Address, Log, H256};
+
+use graph::prelude::*;
+use graph::{
+    blockchain as bc,
+    components::metrics::{CounterVec, GaugeVec, HistogramVec},
+    petgraph::{self, graphmap::GraphMap},
+};
+
+const COMBINED_FILTER_TYPE_URL: &str =
+    "type.googleapis.com/sf.ethereum.transform.v1.CombinedFilter";
+
+use crate::capabilities::NodeCapabilities;
+use crate::data_source::{BlockHandlerFilter, DataSource};
+use crate::{Chain, Mapping, ENV_VARS};
+
+pub type EventSignature = H256;
+pub type FunctionSelector = [u8; 4];
+
+#[derive(Clone, Debug)]
+pub struct EthereumContractCall {
+    pub address: Address,
+    pub block_ptr: BlockPtr,
+    pub function: Function,
+    pub args: Vec<Token>,
+}
+
+#[derive(Error, Debug)]
+pub enum EthereumContractCallError {
+    #[error("ABI error: {0}")]
+    ABIError(#[from] ABIError),
+    /// `Token` is not of expected `ParamType`
+    #[error("type mismatch, token {0:?} is not of kind {1:?}")]
+    TypeError(Token, ParamType),
+    #[error("error encoding input call data: {0}")]
+    EncodingError(ethabi::Error),
+    #[error("call error: {0}")]
+    Web3Error(web3::Error),
+    #[error("call reverted: {0}")]
+    Revert(String),
+    #[error("ethereum node took too long to perform call")]
+    Timeout,
+}
+
+#[derive(Copy, Clone, Debug, PartialEq, Eq, Ord, PartialOrd, Hash)]
+enum LogFilterNode {
+    Contract(Address),
+    Event(EventSignature),
+}
+
+/// Corresponds to an `eth_getLogs` call.
+#[derive(Clone, Debug)]
+pub struct EthGetLogsFilter {
+    pub contracts: Vec<Address>,
+    pub event_signatures: Vec<EventSignature>,
+}
+
+impl EthGetLogsFilter {
+    fn from_contract(address: Address) -> Self {
+        EthGetLogsFilter {
+            contracts: vec![address],
+            event_signatures: vec![],
+        }
+    }
+
+    fn from_event(event: EventSignature) -> Self {
+        EthGetLogsFilter {
+            contracts: vec![],
+            event_signatures: vec![event],
+        }
+    }
+}
+
+impl fmt::Display for EthGetLogsFilter {
+    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
+        if self.contracts.len() == 1 {
+            write!(
+                f,
+                "contract {:?}, {} events",
+                self.contracts[0],
+                self.event_signatures.len()
+            )
+        } else if self.event_signatures.len() == 1 {
+            write!(
+                f,
+                "event {:?}, {} contracts",
+                self.event_signatures[0],
+                self.contracts.len()
+            )
+        } else {
+            write!(f, "unreachable")
+        }
+    }
+}
+
+#[derive(Clone, Debug, Default)]
+pub struct TriggerFilter {
+    pub(crate) log: EthereumLogFilter,
+    pub(crate) call: EthereumCallFilter,
+    pub(crate) block: EthereumBlockFilter,
+}
+
+impl TriggerFilter {
+    pub(crate) fn requires_traces(&self) -> bool {
+        !self.call.is_empty() || self.block.requires_traces()
+    }
+}
+
+impl bc::TriggerFilter<Chain> for TriggerFilter {
+    fn extend<'a>(&mut self, data_sources: impl Iterator<Item = &'a DataSource> + Clone) {
+        self.log
+            .extend(EthereumLogFilter::from_data_sources(data_sources.clone()));
+        self.call
+            .extend(EthereumCallFilter::from_data_sources(data_sources.clone()));
+        self.block
+            .extend(EthereumBlockFilter::from_data_sources(data_sources));
+    }
+
+    fn node_capabilities(&self) -> NodeCapabilities {
+        NodeCapabilities {
+            archive: false,
+            traces: self.requires_traces(),
+        }
+    }
+
+    fn extend_with_template(
+        &mut self,
+        data_sources: impl Iterator<Item = <Chain as bc::Blockchain>::DataSourceTemplate>,
+    ) {
+        for data_source in data_sources.into_iter() {
+            self.log
+                .extend(EthereumLogFilter::from_mapping(&data_source.mapping));
+
+            self.call
+                .extend(EthereumCallFilter::from_mapping(&data_source.mapping));
+
+            self.block
+                .extend(EthereumBlockFilter::from_mapping(&data_source.mapping));
+        }
+    }
+
+    fn to_firehose_filter(self) -> Vec<prost_types::Any> {
+        let EthereumBlockFilter {
+            contract_addresses: _contract_addresses,
+            trigger_every_block,
+        } = self.block.clone();
+
+        let log_filters: Vec<LogFilter> = self.log.into();
+        let mut call_filters: Vec<CallToFilter> = self.call.into();
+        call_filters.extend(Into::<Vec<CallToFilter>>::into(self.block));
+
+        if call_filters.is_empty() && log_filters.is_empty() && !trigger_every_block {
+            return Vec::new();
+        }
+
+        let combined_filter = CombinedFilter {
+            log_filters,
+            call_filters,
+            send_all_block_headers: trigger_every_block,
+        };
+
+        vec![Any {
+            type_url: COMBINED_FILTER_TYPE_URL.into(),
+            value: combined_filter.encode_to_vec(),
+        }]
+    }
+}
+
+#[derive(Clone, Debug, Default)]
+pub(crate) struct EthereumLogFilter {
+    /// Log filters can be represented as a bipartite graph between contracts and events. An edge
+    /// exists between a contract and an event if a data source for the contract has a trigger for
+    /// the event.
+    /// Edges are of `bool` type and indicates when a trigger requires a transaction receipt.
+    contracts_and_events_graph: GraphMap<LogFilterNode, bool, petgraph::Undirected>,
+
+    /// Event sigs with no associated address, matching on all addresses.
+    /// Maps to a boolean representing if a trigger requires a transaction receipt.
+    wildcard_events: HashMap<EventSignature, bool>,
+}
+
+impl Into<Vec<LogFilter>> for EthereumLogFilter {
+    fn into(self) -> Vec<LogFilter> {
+        self.eth_get_logs_filters()
+            .map(
+                |EthGetLogsFilter {
+                     contracts,
+                     event_signatures,
+                 }| LogFilter {
+                    addresses: contracts
+                        .iter()
+                        .map(|addr| addr.to_fixed_bytes().to_vec())
+                        .collect_vec(),
+                    event_signatures: event_signatures
+                        .iter()
+                        .map(|sig| sig.to_fixed_bytes().to_vec())
+                        .collect_vec(),
+                },
+            )
+            .collect_vec()
+    }
+}
+
+impl EthereumLogFilter {
+    /// Check if this filter matches the specified `Log`.
+    pub fn matches(&self, log: &Log) -> bool {
+        // First topic should be event sig
+        match log.topics.first() {
+            None => false,
+
+            Some(sig) => {
+                // The `Log` matches the filter either if the filter contains
+                // a (contract address, event signature) pair that matches the
+                // `Log`, or if the filter contains wildcard event that matches.
+                let contract = LogFilterNode::Contract(log.address);
+                let event = LogFilterNode::Event(*sig);
+                self.contracts_and_events_graph
+                    .all_edges()
+                    .any(|(s, t, _)| (s == contract && t == event) || (t == contract && s == event))
+                    || self.wildcard_events.contains_key(sig)
+            }
+        }
+    }
+
+    /// Similar to [`matches`], checks if a transaction receipt is required for this log filter.
+    pub fn requires_transaction_receipt(
+        &self,
+        event_signature: &H256,
+        contract_address: Option<&Address>,
+    ) -> bool {
+        if let Some(true) = self.wildcard_events.get(event_signature) {
+            true
+        } else if let Some(address) = contract_address {
+            let contract = LogFilterNode::Contract(*address);
+            let event = LogFilterNode::Event(*event_signature);
+            self.contracts_and_events_graph
+                .all_edges()
+                .any(|(s, t, r)| {
+                    *r && (s == contract && t == event) || (t == contract && s == event)
+                })
+        } else {
+            false
+        }
+    }
+
+    pub fn from_data_sources<'a>(iter: impl IntoIterator<Item = &'a DataSource>) -> Self {
+        let mut this = EthereumLogFilter::default();
+        for ds in iter {
+            for event_handler in ds.mapping.event_handlers.iter() {
+                let event_sig = event_handler.topic0();
+                match ds.address {
+                    Some(contract) => {
+                        this.contracts_and_events_graph.add_edge(
+                            LogFilterNode::Contract(contract),
+                            LogFilterNode::Event(event_sig),
+                            event_handler.receipt,
+                        );
+                    }
+                    None => {
+                        this.wildcard_events
+                            .insert(event_sig, event_handler.receipt);
+                    }
+                }
+            }
+        }
+        this
+    }
+
+    pub fn from_mapping(mapping: &Mapping) -> Self {
+        let mut this = EthereumLogFilter::default();
+        for event_handler in &mapping.event_handlers {
+            let signature = event_handler.topic0();
+            this.wildcard_events
+                .insert(signature, event_handler.receipt);
+        }
+        this
+    }
+
+    /// Extends this log filter with another one.
+    pub fn extend(&mut self, other: EthereumLogFilter) {
+        if other.is_empty() {
+            return;
+        };
+
+        // Destructure to make sure we're checking all fields.
+        let EthereumLogFilter {
+            contracts_and_events_graph,
+            wildcard_events,
+        } = other;
+        for (s, t, e) in contracts_and_events_graph.all_edges() {
+            self.contracts_and_events_graph.add_edge(s, t, *e);
+        }
+        self.wildcard_events.extend(wildcard_events);
+    }
+
+    /// An empty filter is one that never matches.
+    pub fn is_empty(&self) -> bool {
+        // Destructure to make sure we're checking all fields.
+        let EthereumLogFilter {
+            contracts_and_events_graph,
+            wildcard_events,
+        } = self;
+        contracts_and_events_graph.edge_count() == 0 && wildcard_events.is_empty()
+    }
+
+    /// Filters for `eth_getLogs` calls. The filters will not return false positives. This attempts
+    /// to balance between having granular filters but too many calls and having few calls but too
+    /// broad filters causing the Ethereum endpoint to timeout.
+    pub fn eth_get_logs_filters(self) -> impl Iterator<Item = EthGetLogsFilter> {
+        // Start with the wildcard event filters.
+        let mut filters = self
+            .wildcard_events
+            .into_iter()
+            .map(|(event, _)| EthGetLogsFilter::from_event(event))
+            .collect_vec();
+
+        // The current algorithm is to repeatedly find the maximum cardinality vertex and turn all
+        // of its edges into a filter. This is nice because it is neutral between filtering by
+        // contract or by events, if there are many events that appear on only one data source
+        // we'll filter by many events on a single contract, but if there is an event that appears
+        // on a lot of data sources we'll filter by many contracts with a single event.
+        //
+        // From a theoretical standpoint we're finding a vertex cover, and this is not the optimal
+        // algorithm to find a minimum vertex cover, but should be fine as an approximation.
+        //
+        // One optimization we're not doing is to merge nodes that have the same neighbors into a
+        // single node. For example if a subgraph has two data sources, each with the same two
+        // events, we could cover that with a single filter and no false positives. However that
+        // might cause the filter to become too broad, so at the moment it seems excessive.
+        let mut g = self.contracts_and_events_graph;
+        while g.edge_count() > 0 {
+            let mut push_filter = |filter: EthGetLogsFilter| {
+                // Sanity checks:
+                // - The filter is not a wildcard because all nodes have neighbors.
+                // - The graph is bipartite.
+                assert!(filter.contracts.len() > 0 && filter.event_signatures.len() > 0);
+                assert!(filter.contracts.len() == 1 || filter.event_signatures.len() == 1);
+                filters.push(filter);
+            };
+
+            // If there are edges, there are vertexes.
+            let max_vertex = g.nodes().max_by_key(|&n| g.neighbors(n).count()).unwrap();
+            let mut filter = match max_vertex {
+                LogFilterNode::Contract(address) => EthGetLogsFilter::from_contract(address),
+                LogFilterNode::Event(event_sig) => EthGetLogsFilter::from_event(event_sig),
+            };
+            for neighbor in g.neighbors(max_vertex) {
+                match neighbor {
+                    LogFilterNode::Contract(address) => {
+                        if filter.contracts.len() == ENV_VARS.get_logs_max_contracts {
+                            // The batch size was reached, register the filter and start a new one.
+                            let event = filter.event_signatures[0];
+                            push_filter(filter);
+                            filter = EthGetLogsFilter::from_event(event);
+                        }
+                        filter.contracts.push(address);
+                    }
+                    LogFilterNode::Event(event_sig) => filter.event_signatures.push(event_sig),
+                }
+            }
+
+            push_filter(filter);
+            g.remove_node(max_vertex);
+        }
+        filters.into_iter()
+    }
+}
+
+#[derive(Clone, Debug, Default)]
+pub(crate) struct EthereumCallFilter {
+    // Each call filter has a map of filters keyed by address, each containing a tuple with
+    // start_block and the set of function signatures
+    pub contract_addresses_function_signatures:
+        HashMap<Address, (BlockNumber, HashSet<FunctionSelector>)>,
+
+    pub wildcard_signatures: HashSet<FunctionSelector>,
+}
+
+impl Into<Vec<CallToFilter>> for EthereumCallFilter {
+    fn into(self) -> Vec<CallToFilter> {
+        if self.is_empty() {
+            return Vec::new();
+        }
+
+        let EthereumCallFilter {
+            contract_addresses_function_signatures,
+            wildcard_signatures,
+        } = self;
+
+        let mut filters: Vec<CallToFilter> = contract_addresses_function_signatures
+            .into_iter()
+            .map(|(addr, (_, sigs))| CallToFilter {
+                addresses: vec![addr.to_fixed_bytes().to_vec()],
+                signatures: sigs.into_iter().map(|x| x.to_vec()).collect_vec(),
+            })
+            .collect();
+
+        if !wildcard_signatures.is_empty() {
+            filters.push(CallToFilter {
+                addresses: vec![],
+                signatures: wildcard_signatures
+                    .into_iter()
+                    .map(|x| x.to_vec())
+                    .collect_vec(),
+            });
+        }
+
+        filters
+    }
+}
+
+impl EthereumCallFilter {
+    pub fn matches(&self, call: &EthereumCall) -> bool {
+        // Calls returned by Firehose actually contains pure transfers and smart
+        // contract calls. If the input is less than 4 bytes, we assume it's a pure transfer
+        // and discards those.
+        if call.input.0.len() < 4 {
+            return false;
+        }
+
+        // The `call.input.len()` is validated in the
+        // DataSource::match_and_decode function.
+        // Those calls are logged as warning and skipped.
+        //
+        // See 280b0108-a96e-4738-bb37-60ce11eeb5bf
+        let call_signature = &call.input.0[..4];
+
+        // Ensure the call is to a contract the filter expressed an interest in
+        match self.contract_addresses_function_signatures.get(&call.to) {
+            // If the call is to a contract with no specified functions, keep the call
+            //
+            // Allows the ability to genericly match on all calls to a contract.
+            // Caveat is this catch all clause limits you from matching with a specific call
+            // on the same address
+            Some(v) if v.1.is_empty() => true,
+            // There are some relevant signatures to test
+            // this avoids having to call extend for every match call, checks the contract specific funtions, then falls
+            // back on wildcards
+            Some(v) => {
+                let sig = &v.1;
+                sig.contains(call_signature) || self.wildcard_signatures.contains(call_signature)
+            }
+            // no contract specific functions, check wildcards
+            None => self.wildcard_signatures.contains(call_signature),
+        }
+    }
+
+    pub fn from_mapping(mapping: &Mapping) -> Self {
+        let functions = mapping
+            .call_handlers
+            .iter()
+            .map(move |call_handler| {
+                let sig = keccak256(call_handler.function.as_bytes());
+                [sig[0], sig[1], sig[2], sig[3]]
+            })
+            .collect();
+
+        Self {
+            wildcard_signatures: functions,
+            contract_addresses_function_signatures: HashMap::new(),
+        }
+    }
+
+    pub fn from_data_sources<'a>(iter: impl IntoIterator<Item = &'a DataSource>) -> Self {
+        iter.into_iter()
+            .filter_map(|data_source| data_source.address.map(|addr| (addr, data_source)))
+            .map(|(contract_addr, data_source)| {
+                let start_block = data_source.start_block;
+                data_source
+                    .mapping
+                    .call_handlers
+                    .iter()
+                    .map(move |call_handler| {
+                        let sig = keccak256(call_handler.function.as_bytes());
+                        (start_block, contract_addr, [sig[0], sig[1], sig[2], sig[3]])
+                    })
+            })
+            .flatten()
+            .collect()
+    }
+
+    /// Extends this call filter with another one.
+    pub fn extend(&mut self, other: EthereumCallFilter) {
+        if other.is_empty() {
+            return;
+        };
+
+        let EthereumCallFilter {
+            contract_addresses_function_signatures,
+            wildcard_signatures,
+        } = other;
+
+        // Extend existing address / function signature key pairs
+        // Add new address / function signature key pairs from the provided EthereumCallFilter
+        for (address, (proposed_start_block, new_sigs)) in
+            contract_addresses_function_signatures.into_iter()
+        {
+            match self
+                .contract_addresses_function_signatures
+                .get_mut(&address)
+            {
+                Some((existing_start_block, existing_sigs)) => {
+                    *existing_start_block = cmp::min(proposed_start_block, *existing_start_block);
+                    existing_sigs.extend(new_sigs);
+                }
+                None => {
+                    self.contract_addresses_function_signatures
+                        .insert(address, (proposed_start_block, new_sigs));
+                }
+            }
+        }
+
+        self.wildcard_signatures.extend(wildcard_signatures);
+    }
+
+    /// An empty filter is one that never matches.
+    pub fn is_empty(&self) -> bool {
+        // Destructure to make sure we're checking all fields.
+        let EthereumCallFilter {
+            contract_addresses_function_signatures,
+            wildcard_signatures: wildcard_matches,
+        } = self;
+        contract_addresses_function_signatures.is_empty() && wildcard_matches.is_empty()
+    }
+}
+
+impl FromIterator<(BlockNumber, Address, FunctionSelector)> for EthereumCallFilter {
+    fn from_iter<I>(iter: I) -> Self
+    where
+        I: IntoIterator<Item = (BlockNumber, Address, FunctionSelector)>,
+    {
+        let mut lookup: HashMap<Address, (BlockNumber, HashSet<FunctionSelector>)> = HashMap::new();
+        iter.into_iter()
+            .for_each(|(start_block, address, function_signature)| {
+                if !lookup.contains_key(&address) {
+                    lookup.insert(address, (start_block, HashSet::default()));
+                }
+                lookup.get_mut(&address).map(|set| {
+                    if set.0 > start_block {
+                        set.0 = start_block
+                    }
+                    set.1.insert(function_signature);
+                    set
+                });
+            });
+        EthereumCallFilter {
+            contract_addresses_function_signatures: lookup,
+            wildcard_signatures: HashSet::new(),
+        }
+    }
+}
+
+impl From<&EthereumBlockFilter> for EthereumCallFilter {
+    fn from(ethereum_block_filter: &EthereumBlockFilter) -> Self {
+        Self {
+            contract_addresses_function_signatures: ethereum_block_filter
+                .contract_addresses
+                .iter()
+                .map(|(start_block_opt, address)| {
+                    (address.clone(), (*start_block_opt, HashSet::default()))
+                })
+                .collect::<HashMap<Address, (BlockNumber, HashSet<FunctionSelector>)>>(),
+            wildcard_signatures: HashSet::new(),
+        }
+    }
+}
+
+#[derive(Clone, Debug, Default)]
+pub(crate) struct EthereumBlockFilter {
+    pub contract_addresses: HashSet<(BlockNumber, Address)>,
+    pub trigger_every_block: bool,
+}
+
+impl Into<Vec<CallToFilter>> for EthereumBlockFilter {
+    fn into(self) -> Vec<CallToFilter> {
+        self.contract_addresses
+            .into_iter()
+            .map(|(_, addr)| addr)
+            .sorted()
+            .dedup_by(|x, y| x == y)
+            .map(|addr| CallToFilter {
+                addresses: vec![addr.to_fixed_bytes().to_vec()],
+                signatures: vec![],
+            })
+            .collect_vec()
+    }
+}
+
+impl EthereumBlockFilter {
+    /// from_mapping ignores contract addresses in this use case because templates can't provide Address or BlockNumber
+    /// ahead of time. This means the filters applied to the block_stream need to be broad, in this case,
+    /// specifically, will match all blocks. The blocks are then further filtered by the subgraph instance manager
+    /// which keeps track of deployed contracts and relevant addresses.
+    pub fn from_mapping(mapping: &Mapping) -> Self {
+        Self {
+            contract_addresses: HashSet::new(),
+            trigger_every_block: mapping.block_handlers.len() != 0,
+        }
+    }
+
+    pub fn from_data_sources<'a>(iter: impl IntoIterator<Item = &'a DataSource>) -> Self {
+        iter.into_iter()
+            .filter(|data_source| data_source.address.is_some())
+            .fold(Self::default(), |mut filter_opt, data_source| {
+                let has_block_handler_with_call_filter = data_source
+                    .mapping
+                    .block_handlers
+                    .clone()
+                    .into_iter()
+                    .any(|block_handler| match block_handler.filter {
+                        Some(ref filter) if *filter == BlockHandlerFilter::Call => true,
+                        _ => false,
+                    });
+
+                let has_block_handler_without_filter = data_source
+                    .mapping
+                    .block_handlers
+                    .clone()
+                    .into_iter()
+                    .any(|block_handler| block_handler.filter.is_none());
+
+                filter_opt.extend(Self {
+                    trigger_every_block: has_block_handler_without_filter,
+                    contract_addresses: if has_block_handler_with_call_filter {
+                        vec![(
+                            data_source.start_block,
+                            data_source.address.unwrap().to_owned(),
+                        )]
+                        .into_iter()
+                        .collect()
+                    } else {
+                        HashSet::default()
+                    },
+                });
+                filter_opt
+            })
+    }
+
+    pub fn extend(&mut self, other: EthereumBlockFilter) {
+        if other.is_empty() {
+            return;
+        };
+
+        let EthereumBlockFilter {
+            contract_addresses,
+            trigger_every_block,
+        } = other;
+
+        self.trigger_every_block = self.trigger_every_block || trigger_every_block;
+
+        for other in contract_addresses {
+            let (other_start_block, other_address) = other;
+
+            match self.find_contract_address(&other.1) {
+                Some((current_start_block, current_address)) => {
+                    if other_start_block < current_start_block {
+                        self.contract_addresses
+                            .remove(&(current_start_block, current_address));
+                        self.contract_addresses
+                            .insert((other_start_block, other_address));
+                    }
+                }
+                None => {
+                    self.contract_addresses
+                        .insert((other_start_block, other_address));
+                }
+            }
+        }
+    }
+
+    fn requires_traces(&self) -> bool {
+        !self.contract_addresses.is_empty()
+    }
+
+    /// An empty filter is one that never matches.
+    pub fn is_empty(&self) -> bool {
+        // If we are triggering every block, we are of course not empty
+        if self.trigger_every_block {
+            return false;
+        }
+
+        self.contract_addresses.is_empty()
+    }
+
+    fn find_contract_address(&self, candidate: &Address) -> Option<(i32, Address)> {
+        self.contract_addresses
+            .iter()
+            .find(|(_, current_address)| candidate == current_address)
+            .cloned()
+    }
+}
+
+pub enum ProviderStatus {
+    Working,
+    VersionFail,
+    GenesisFail,
+    VersionTimeout,
+    GenesisTimeout,
+}
+
+impl From<ProviderStatus> for f64 {
+    fn from(state: ProviderStatus) -> Self {
+        match state {
+            ProviderStatus::Working => 0.0,
+            ProviderStatus::VersionFail => 1.0,
+            ProviderStatus::GenesisFail => 2.0,
+            ProviderStatus::VersionTimeout => 3.0,
+            ProviderStatus::GenesisTimeout => 4.0,
+        }
+    }
+}
+
+const STATUS_HELP: &str = "0 = ok, 1 = net_version failed, 2 = get genesis failed, 3 = net_version timeout, 4 = get genesis timeout";
+#[derive(Clone)]
+pub struct ProviderEthRpcMetrics {
+    request_duration: Box<HistogramVec>,
+    errors: Box<CounterVec>,
+    status: Box<GaugeVec>,
+}
+
+impl ProviderEthRpcMetrics {
+    pub fn new(registry: Arc<dyn MetricsRegistry>) -> Self {
+        let request_duration = registry
+            .new_histogram_vec(
+                "eth_rpc_request_duration",
+                "Measures eth rpc request duration",
+                vec![String::from("method"), String::from("provider")],
+                vec![0.05, 0.1, 0.2, 0.4, 0.8, 1.6, 3.2, 6.4, 12.8, 25.6],
+            )
+            .unwrap();
+        let errors = registry
+            .new_counter_vec(
+                "eth_rpc_errors",
+                "Counts eth rpc request errors",
+                vec![String::from("method"), String::from("provider")],
+            )
+            .unwrap();
+        let status_help = format!("Whether the provider has failed ({STATUS_HELP})");
+        let status = registry
+            .new_gauge_vec(
+                "eth_rpc_status",
+                &status_help,
+                vec![String::from("provider")],
+            )
+            .unwrap();
+        Self {
+            request_duration,
+            errors,
+            status,
+        }
+    }
+
+    pub fn observe_request(&self, duration: f64, method: &str, provider: &str) {
+        self.request_duration
+            .with_label_values(&[method, provider])
+            .observe(duration);
+    }
+
+    pub fn add_error(&self, method: &str, provider: &str) {
+        self.errors.with_label_values(&[method, provider]).inc();
+    }
+
+    pub fn set_status(&self, status: ProviderStatus, provider: &str) {
+        self.status
+            .with_label_values(&[provider])
+            .set(status.into());
+    }
+}
+
+#[derive(Clone)]
+pub struct SubgraphEthRpcMetrics {
+    request_duration: GaugeVec,
+    errors: CounterVec,
+    deployment: String,
+}
+
+impl SubgraphEthRpcMetrics {
+    pub fn new(registry: Arc<dyn MetricsRegistry>, subgraph_hash: &str) -> Self {
+        let request_duration = registry
+            .global_gauge_vec(
+                "deployment_eth_rpc_request_duration",
+                "Measures eth rpc request duration for a subgraph deployment",
+                vec!["deployment", "method", "provider"].as_slice(),
+            )
+            .unwrap();
+        let errors = registry
+            .global_counter_vec(
+                "deployment_eth_rpc_errors",
+                "Counts eth rpc request errors for a subgraph deployment",
+                vec!["deployment", "method", "provider"].as_slice(),
+            )
+            .unwrap();
+        Self {
+            request_duration,
+            errors,
+            deployment: subgraph_hash.into(),
+        }
+    }
+
+    pub fn observe_request(&self, duration: f64, method: &str, provider: &str) {
+        self.request_duration
+            .with_label_values(&[&self.deployment, method, provider])
+            .set(duration);
+    }
+
+    pub fn add_error(&self, method: &str, provider: &str) {
+        self.errors
+            .with_label_values(&[&self.deployment, method, provider])
+            .inc();
+    }
+}
+
+/// Common trait for components that watch and manage access to Ethereum.
+///
+/// Implementations may be implemented against an in-process Ethereum node
+/// or a remote node over RPC.
+#[async_trait]
+pub trait EthereumAdapter: Send + Sync + 'static {
+    fn url_hostname(&self) -> &str;
+
+    /// The `provider.label` from the adapter's configuration
+    fn provider(&self) -> &str;
+
+    /// Ask the Ethereum node for some identifying information about the Ethereum network it is
+    /// connected to.
+    async fn net_identifiers(&self) -> Result<ChainIdentifier, Error>;
+
+    /// Get the latest block, including full transactions.
+    fn latest_block(
+        &self,
+        logger: &Logger,
+    ) -> Box<dyn Future<Item = LightEthereumBlock, Error = bc::IngestorError> + Send + Unpin>;
+
+    /// Get the latest block, with only the header and transaction hashes.
+    fn latest_block_header(
+        &self,
+        logger: &Logger,
+    ) -> Box<dyn Future<Item = web3::types::Block<H256>, Error = bc::IngestorError> + Send>;
+
+    fn load_block(
+        &self,
+        logger: &Logger,
+        block_hash: H256,
+    ) -> Box<dyn Future<Item = LightEthereumBlock, Error = Error> + Send>;
+
+    /// Load Ethereum blocks in bulk, returning results as they come back as a Stream.
+    /// May use the `chain_store` as a cache.
+    fn load_blocks(
+        &self,
+        logger: Logger,
+        chain_store: Arc<dyn ChainStore>,
+        block_hashes: HashSet<H256>,
+    ) -> Box<dyn Stream<Item = Arc<LightEthereumBlock>, Error = Error> + Send>;
+
+    /// Find a block by its hash.
+    fn block_by_hash(
+        &self,
+        logger: &Logger,
+        block_hash: H256,
+    ) -> Box<dyn Future<Item = Option<LightEthereumBlock>, Error = Error> + Send>;
+
+    fn block_by_number(
+        &self,
+        logger: &Logger,
+        block_number: BlockNumber,
+    ) -> Box<dyn Future<Item = Option<LightEthereumBlock>, Error = Error> + Send>;
+
+    /// Load full information for the specified `block` (in particular, transaction receipts).
+    fn load_full_block(
+        &self,
+        logger: &Logger,
+        block: LightEthereumBlock,
+    ) -> Pin<Box<dyn std::future::Future<Output = Result<EthereumBlock, bc::IngestorError>> + Send>>;
+
+    /// Load block pointer for the specified `block number`.
+    fn block_pointer_from_number(
+        &self,
+        logger: &Logger,
+        block_number: BlockNumber,
+    ) -> Box<dyn Future<Item = BlockPtr, Error = bc::IngestorError> + Send>;
+
+    /// Find a block by its number, according to the Ethereum node.
+    ///
+    /// Careful: don't use this function without considering race conditions.
+    /// Chain reorgs could happen at any time, and could affect the answer received.
+    /// Generally, it is only safe to use this function with blocks that have received enough
+    /// confirmations to guarantee no further reorgs, **and** where the Ethereum node is aware of
+    /// those confirmations.
+    /// If the Ethereum node is far behind in processing blocks, even old blocks can be subject to
+    /// reorgs.
+    fn block_hash_by_block_number(
+        &self,
+        logger: &Logger,
+        block_number: BlockNumber,
+    ) -> Box<dyn Future<Item = Option<H256>, Error = Error> + Send>;
+
+    /// Call the function of a smart contract.
+    fn contract_call(
+        &self,
+        logger: &Logger,
+        call: EthereumContractCall,
+        cache: Arc<dyn EthereumCallCache>,
+    ) -> Box<dyn Future<Item = Vec<Token>, Error = EthereumContractCallError> + Send>;
+}
+
+#[cfg(test)]
+mod tests {
+    use crate::adapter::{FunctionSelector, COMBINED_FILTER_TYPE_URL};
+
+    use super::{EthereumBlockFilter, LogFilterNode};
+    use super::{EthereumCallFilter, EthereumLogFilter, TriggerFilter};
+
+    use graph::blockchain::TriggerFilter as _;
+    use graph::firehose::{CallToFilter, CombinedFilter, LogFilter, MultiLogFilter};
+    use graph::petgraph::graphmap::GraphMap;
+    use graph::prelude::ethabi::ethereum_types::H256;
+    use graph::prelude::web3::types::Address;
+    use graph::prelude::web3::types::Bytes;
+    use graph::prelude::EthereumCall;
+    use hex::ToHex;
+    use itertools::Itertools;
+    use prost::Message;
+    use prost_types::Any;
+
+    use std::collections::{HashMap, HashSet};
+    use std::iter::FromIterator;
+    use std::str::FromStr;
+
+    #[test]
+    fn ethereum_log_filter_codec() {
+        let hex_addr = "0x4c7b8591c50f4ad308d07d6294f2945e074420f5";
+        let address = Address::from_str(hex_addr).expect("unable to parse addr");
+        assert_eq!(hex_addr, format!("0x{}", address.encode_hex::<String>()));
+
+        let event_sigs = vec![
+            "0xafb42f194014ece77df0f9e4bc3ced9757555dc1fe7dc803161a2de3b7c4839a",
+            "0xddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef",
+        ];
+
+        let hex_sigs = event_sigs
+            .iter()
+            .map(|addr| {
+                format!(
+                    "0x{}",
+                    H256::from_str(addr)
+                        .expect("unable to parse addr")
+                        .encode_hex::<String>()
+                )
+            })
+            .collect_vec();
+
+        assert_eq!(event_sigs, hex_sigs);
+
+        let sigs = event_sigs
+            .iter()
+            .map(|addr| {
+                H256::from_str(addr)
+                    .expect("unable to parse addr")
+                    .to_fixed_bytes()
+                    .to_vec()
+            })
+            .collect_vec();
+
+        let filter = LogFilter {
+            addresses: vec![address.to_fixed_bytes().to_vec()],
+            event_signatures: sigs,
+        };
+        // This base64 was provided by Streamingfast as a binding example of the expected encoded for the
+        // addresses and signatures above.
+        let expected_base64 = "CloKFEx7hZHFD0rTCNB9YpTylF4HRCD1EiCvtC8ZQBTs533w+eS8PO2XV1Vdwf59yAMWGi3jt8SDmhIg3fJSrRviyJtpwrBo/DeNqpUrp/FjxKEWKPVaTfUjs+8=";
+
+        let filter = MultiLogFilter {
+            log_filters: vec![filter],
+        };
+
+        let output = base64::encode(filter.encode_to_vec());
+        assert_eq!(expected_base64, output);
+    }
+
+    #[test]
+    fn ethereum_call_filter_codec() {
+        let hex_addr = "0xeed2b7756e295a9300e53dd049aeb0751899bae3";
+        let sig = "a9059cbb";
+        let mut fs: FunctionSelector = [0u8; 4];
+        let hex_sig = hex::decode(sig).expect("failed to parse sig");
+        fs.copy_from_slice(&hex_sig[..]);
+
+        let actual_sig = hex::encode(fs);
+        assert_eq!(sig, actual_sig);
+
+        let filter = LogFilter {
+            addresses: vec![Address::from_str(hex_addr)
+                .expect("failed to parse address")
+                .to_fixed_bytes()
+                .to_vec()],
+            event_signatures: vec![fs.to_vec()],
+        };
+
+        // This base64 was provided by Streamingfast as a binding example of the expected encoded for the
+        // addresses and signatures above.
+        let expected_base64 = "ChTu0rd1bilakwDlPdBJrrB1GJm64xIEqQWcuw==";
+
+        let output = base64::encode(filter.encode_to_vec());
+        assert_eq!(expected_base64, output);
+    }
+
+    #[test]
+    fn ethereum_trigger_filter_to_firehose() {
+        let address = Address::from_low_u64_be;
+        let sig = H256::from_low_u64_le;
+        let mut filter = TriggerFilter {
+            log: EthereumLogFilter {
+                contracts_and_events_graph: GraphMap::new(),
+                wildcard_events: HashMap::new(),
+            },
+            call: EthereumCallFilter {
+                contract_addresses_function_signatures: HashMap::from_iter(vec![
+                    (address(0), (0, HashSet::from_iter(vec![[0u8; 4]]))),
+                    (address(1), (1, HashSet::from_iter(vec![[1u8; 4]]))),
+                    (address(2), (2, HashSet::new())),
+                ]),
+                wildcard_signatures: HashSet::new(),
+            },
+            block: EthereumBlockFilter {
+                contract_addresses: HashSet::from_iter([
+                    (100, address(1000)),
+                    (200, address(2000)),
+                    (300, address(3000)),
+                    (400, address(1000)),
+                    (500, address(1000)),
+                ]),
+                trigger_every_block: false,
+            },
+        };
+
+        let expected_call_filters = vec![
+            CallToFilter {
+                addresses: vec![address(0).to_fixed_bytes().to_vec()],
+                signatures: vec![[0u8; 4].to_vec()],
+            },
+            CallToFilter {
+                addresses: vec![address(1).to_fixed_bytes().to_vec()],
+                signatures: vec![[1u8; 4].to_vec()],
+            },
+            CallToFilter {
+                addresses: vec![address(2).to_fixed_bytes().to_vec()],
+                signatures: vec![],
+            },
+            CallToFilter {
+                addresses: vec![address(1000).to_fixed_bytes().to_vec()],
+                signatures: vec![],
+            },
+            CallToFilter {
+                addresses: vec![address(2000).to_fixed_bytes().to_vec()],
+                signatures: vec![],
+            },
+            CallToFilter {
+                addresses: vec![address(3000).to_fixed_bytes().to_vec()],
+                signatures: vec![],
+            },
+        ];
+
+        filter.log.contracts_and_events_graph.add_edge(
+            LogFilterNode::Contract(address(10)),
+            LogFilterNode::Event(sig(100)),
+            false,
+        );
+        filter.log.contracts_and_events_graph.add_edge(
+            LogFilterNode::Contract(address(10)),
+            LogFilterNode::Event(sig(101)),
+            false,
+        );
+        filter.log.contracts_and_events_graph.add_edge(
+            LogFilterNode::Contract(address(20)),
+            LogFilterNode::Event(sig(100)),
+            false,
+        );
+
+        let expected_log_filters = vec![
+            LogFilter {
+                addresses: vec![address(10).to_fixed_bytes().to_vec()],
+                event_signatures: vec![sig(101).to_fixed_bytes().to_vec()],
+            },
+            LogFilter {
+                addresses: vec![
+                    address(10).to_fixed_bytes().to_vec(),
+                    address(20).to_fixed_bytes().to_vec(),
+                ],
+                event_signatures: vec![sig(100).to_fixed_bytes().to_vec()],
+            },
+        ];
+
+        let firehose_filter = filter.clone().to_firehose_filter();
+        assert_eq!(1, firehose_filter.len());
+
+        let firehose_filter: HashMap<_, _> = HashMap::from_iter::<Vec<(String, Any)>>(
+            firehose_filter
+                .into_iter()
+                .map(|any| (any.type_url.clone(), any))
+                .collect_vec(),
+        );
+
+        let mut combined_filter = &firehose_filter
+            .get(COMBINED_FILTER_TYPE_URL.into())
+            .expect("a CombinedFilter")
+            .value[..];
+
+        let combined_filter =
+            CombinedFilter::decode(&mut combined_filter).expect("combined filter to decode");
+
+        let CombinedFilter {
+            log_filters: mut actual_log_filters,
+            call_filters: mut actual_call_filters,
+            send_all_block_headers: actual_send_all_block_headers,
+        } = combined_filter;
+
+        actual_call_filters.sort_by(|a, b| a.addresses.cmp(&b.addresses));
+        for filter in actual_call_filters.iter_mut() {
+            filter.signatures.sort();
+        }
+        assert_eq!(expected_call_filters, actual_call_filters);
+
+        actual_log_filters.sort_by(|a, b| a.addresses.cmp(&b.addresses));
+        for filter in actual_log_filters.iter_mut() {
+            filter.event_signatures.sort();
+        }
+        assert_eq!(expected_log_filters, actual_log_filters);
+        assert_eq!(false, actual_send_all_block_headers);
+    }
+
+    #[test]
+    fn ethereum_trigger_filter_to_firehose_every_block_plus_logfilter() {
+        let address = Address::from_low_u64_be;
+        let sig = H256::from_low_u64_le;
+        let mut filter = TriggerFilter {
+            log: EthereumLogFilter {
+                contracts_and_events_graph: GraphMap::new(),
+                wildcard_events: HashMap::new(),
+            },
+            call: EthereumCallFilter {
+                contract_addresses_function_signatures: HashMap::new(),
+                wildcard_signatures: HashSet::new(),
+            },
+            block: EthereumBlockFilter {
+                contract_addresses: HashSet::new(),
+                trigger_every_block: true,
+            },
+        };
+
+        filter.log.contracts_and_events_graph.add_edge(
+            LogFilterNode::Contract(address(10)),
+            LogFilterNode::Event(sig(101)),
+            false,
+        );
+
+        let expected_log_filters = vec![LogFilter {
+            addresses: vec![address(10).to_fixed_bytes().to_vec()],
+            event_signatures: vec![sig(101).to_fixed_bytes().to_vec()],
+        }];
+
+        let firehose_filter = filter.clone().to_firehose_filter();
+        assert_eq!(1, firehose_filter.len());
+
+        let firehose_filter: HashMap<_, _> = HashMap::from_iter::<Vec<(String, Any)>>(
+            firehose_filter
+                .into_iter()
+                .map(|any| (any.type_url.clone(), any))
+                .collect_vec(),
+        );
+
+        let mut combined_filter = &firehose_filter
+            .get(COMBINED_FILTER_TYPE_URL.into())
+            .expect("a CombinedFilter")
+            .value[..];
+
+        let combined_filter =
+            CombinedFilter::decode(&mut combined_filter).expect("combined filter to decode");
+
+        let CombinedFilter {
+            log_filters: mut actual_log_filters,
+            call_filters: actual_call_filters,
+            send_all_block_headers: actual_send_all_block_headers,
+        } = combined_filter;
+
+        assert_eq!(0, actual_call_filters.len());
+
+        actual_log_filters.sort_by(|a, b| a.addresses.cmp(&b.addresses));
+        for filter in actual_log_filters.iter_mut() {
+            filter.event_signatures.sort();
+        }
+        assert_eq!(expected_log_filters, actual_log_filters);
+
+        assert_eq!(true, actual_send_all_block_headers);
+    }
+
+    #[test]
+    fn matching_ethereum_call_filter() {
+        let call = |to: Address, input: Vec<u8>| EthereumCall {
+            to,
+            input: bytes(input),
+            ..Default::default()
+        };
+
+        let mut filter = EthereumCallFilter {
+            contract_addresses_function_signatures: HashMap::from_iter(vec![
+                (address(0), (0, HashSet::from_iter(vec![[0u8; 4]]))),
+                (address(1), (1, HashSet::from_iter(vec![[1u8; 4]]))),
+                (address(2), (2, HashSet::new())),
+            ]),
+            wildcard_signatures: HashSet::new(),
+        };
+        let filter2 = EthereumCallFilter {
+            contract_addresses_function_signatures: HashMap::from_iter(vec![(
+                address(0),
+                (0, HashSet::from_iter(vec![[10u8; 4]])),
+            )]),
+            wildcard_signatures: HashSet::from_iter(vec![[11u8; 4]]),
+        };
+
+        assert_eq!(
+            false,
+            filter.matches(&call(address(2), vec![])),
+            "call with empty bytes are always ignore, whatever the condition"
+        );
+
+        assert_eq!(
+            false,
+            filter.matches(&call(address(4), vec![1; 36])),
+            "call with incorrect address should be ignored"
+        );
+
+        assert_eq!(
+            true,
+            filter.matches(&call(address(1), vec![1; 36])),
+            "call with correct address & signature should match"
+        );
+
+        assert_eq!(
+            true,
+            filter.matches(&call(address(1), vec![1; 32])),
+            "call with correct address & signature, but with incorrect input size should match"
+        );
+
+        assert_eq!(
+            false,
+            filter.matches(&call(address(1), vec![4u8; 36])),
+            "call with correct address but incorrect signature for a specific contract filter (i.e. matches some signatures) should be ignored"
+        );
+
+        assert_eq!(
+            false,
+            filter.matches(&call(address(0), vec![11u8; 36])),
+            "this signature should not match filter1, this avoid false passes if someone changes the code"
+        );
+        assert_eq!(
+            false,
+            filter2.matches(&call(address(1), vec![10u8; 36])),
+            "this signature should not match filter2 because the address is not the expected one"
+        );
+        assert_eq!(
+            true,
+            filter2.matches(&call(address(0), vec![10u8; 36])),
+            "this signature should match filter2 on the non wildcard clause"
+        );
+        assert_eq!(
+            true,
+            filter2.matches(&call(address(0), vec![11u8; 36])),
+            "this signature should match filter2 on the wildcard clause"
+        );
+
+        // extend filter1 and test the filter 2 stuff again
+        filter.extend(filter2);
+        assert_eq!(
+            true,
+            filter.matches(&call(address(0), vec![11u8; 36])),
+            "this signature should not match filter1, this avoid false passes if someone changes the code"
+        );
+        assert_eq!(
+            false,
+            filter.matches(&call(address(1), vec![10u8; 36])),
+            "this signature should not match filter2 because the address is not the expected one"
+        );
+        assert_eq!(
+            true,
+            filter.matches(&call(address(0), vec![10u8; 36])),
+            "this signature should match filter2 on the non wildcard clause"
+        );
+        assert_eq!(
+            true,
+            filter.matches(&call(address(0), vec![11u8; 36])),
+            "this signature should match filter2 on the wildcard clause"
+        );
+    }
+
+    #[test]
+    fn extending_ethereum_block_filter_no_found() {
+        let mut base = EthereumBlockFilter {
+            contract_addresses: HashSet::new(),
+            trigger_every_block: false,
+        };
+
+        let extension = EthereumBlockFilter {
+            contract_addresses: HashSet::from_iter(vec![(10, address(1))]),
+            trigger_every_block: false,
+        };
+
+        base.extend(extension);
+
+        assert_eq!(
+            HashSet::from_iter(vec![(10, address(1))]),
+            base.contract_addresses,
+        );
+    }
+
+    #[test]
+    fn extending_ethereum_block_filter_conflict_picks_lowest_block_from_ext() {
+        let mut base = EthereumBlockFilter {
+            contract_addresses: HashSet::from_iter(vec![(10, address(1))]),
+            trigger_every_block: false,
+        };
+
+        let extension = EthereumBlockFilter {
+            contract_addresses: HashSet::from_iter(vec![(2, address(1))]),
+            trigger_every_block: false,
+        };
+
+        base.extend(extension);
+
+        assert_eq!(
+            HashSet::from_iter(vec![(2, address(1))]),
+            base.contract_addresses,
+        );
+    }
+
+    #[test]
+    fn extending_ethereum_block_filter_conflict_picks_lowest_block_from_base() {
+        let mut base = EthereumBlockFilter {
+            contract_addresses: HashSet::from_iter(vec![(2, address(1))]),
+            trigger_every_block: false,
+        };
+
+        let extension = EthereumBlockFilter {
+            contract_addresses: HashSet::from_iter(vec![(10, address(1))]),
+            trigger_every_block: false,
+        };
+
+        base.extend(extension);
+
+        assert_eq!(
+            HashSet::from_iter(vec![(2, address(1))]),
+            base.contract_addresses,
+        );
+    }
+
+    #[test]
+    fn extending_ethereum_block_filter_every_block_in_ext() {
+        let mut base = EthereumBlockFilter {
+            contract_addresses: HashSet::default(),
+            trigger_every_block: false,
+        };
+
+        let extension = EthereumBlockFilter {
+            contract_addresses: HashSet::default(),
+            trigger_every_block: true,
+        };
+
+        base.extend(extension);
+
+        assert_eq!(true, base.trigger_every_block);
+    }
+
+    #[test]
+    fn extending_ethereum_block_filter_every_block_in_base_and_merge_contract_addresses() {
+        let mut base = EthereumBlockFilter {
+            contract_addresses: HashSet::from_iter(vec![(10, address(2))]),
+            trigger_every_block: true,
+        };
+
+        let extension = EthereumBlockFilter {
+            contract_addresses: HashSet::from_iter(vec![]),
+            trigger_every_block: false,
+        };
+
+        base.extend(extension);
+
+        assert_eq!(true, base.trigger_every_block);
+        assert_eq!(
+            HashSet::from_iter(vec![(10, address(2))]),
+            base.contract_addresses,
+        );
+    }
+
+    #[test]
+    fn extending_ethereum_block_filter_every_block_in_ext_and_merge_contract_addresses() {
+        let mut base = EthereumBlockFilter {
+            contract_addresses: HashSet::from_iter(vec![(10, address(2))]),
+            trigger_every_block: false,
+        };
+
+        let extension = EthereumBlockFilter {
+            contract_addresses: HashSet::from_iter(vec![(10, address(1))]),
+            trigger_every_block: true,
+        };
+
+        base.extend(extension);
+
+        assert_eq!(true, base.trigger_every_block);
+        assert_eq!(
+            HashSet::from_iter(vec![(10, address(2)), (10, address(1))]),
+            base.contract_addresses,
+        );
+    }
+
+    #[test]
+    fn extending_ethereum_call_filter() {
+        let mut base = EthereumCallFilter {
+            contract_addresses_function_signatures: HashMap::from_iter(vec![
+                (
+                    Address::from_low_u64_be(0),
+                    (0, HashSet::from_iter(vec![[0u8; 4]])),
+                ),
+                (
+                    Address::from_low_u64_be(1),
+                    (1, HashSet::from_iter(vec![[1u8; 4]])),
+                ),
+            ]),
+            wildcard_signatures: HashSet::new(),
+        };
+        let extension = EthereumCallFilter {
+            contract_addresses_function_signatures: HashMap::from_iter(vec![
+                (
+                    Address::from_low_u64_be(0),
+                    (2, HashSet::from_iter(vec![[2u8; 4]])),
+                ),
+                (
+                    Address::from_low_u64_be(3),
+                    (3, HashSet::from_iter(vec![[3u8; 4]])),
+                ),
+            ]),
+            wildcard_signatures: HashSet::new(),
+        };
+        base.extend(extension);
+
+        assert_eq!(
+            base.contract_addresses_function_signatures
+                .get(&Address::from_low_u64_be(0)),
+            Some(&(0, HashSet::from_iter(vec![[0u8; 4], [2u8; 4]])))
+        );
+        assert_eq!(
+            base.contract_addresses_function_signatures
+                .get(&Address::from_low_u64_be(3)),
+            Some(&(3, HashSet::from_iter(vec![[3u8; 4]])))
+        );
+        assert_eq!(
+            base.contract_addresses_function_signatures
+                .get(&Address::from_low_u64_be(1)),
+            Some(&(1, HashSet::from_iter(vec![[1u8; 4]])))
+        );
+    }
+
+    fn address(id: u64) -> Address {
+        Address::from_low_u64_be(id)
+    }
+
+    fn bytes(value: Vec<u8>) -> Bytes {
+        Bytes::from(value)
+    }
+}
+
+// Tests `eth_get_logs_filters` in instances where all events are filtered on by all contracts.
+// This represents, for example, the relationship between dynamic data sources and their events.
+#[test]
+fn complete_log_filter() {
+    use std::collections::BTreeSet;
+
+    // Test a few combinations of complete graphs.
+    for i in [1, 2] {
+        let events: BTreeSet<_> = (0..i).map(H256::from_low_u64_le).collect();
+
+        for j in [1, 1000, 2000, 3000] {
+            let contracts: BTreeSet<_> = (0..j).map(Address::from_low_u64_le).collect();
+
+            // Construct the complete bipartite graph with i events and j contracts.
+            let mut contracts_and_events_graph = GraphMap::new();
+            for &contract in &contracts {
+                for &event in &events {
+                    contracts_and_events_graph.add_edge(
+                        LogFilterNode::Contract(contract),
+                        LogFilterNode::Event(event),
+                        false,
+                    );
+                }
+            }
+
+            // Run `eth_get_logs_filters`, which is what we want to test.
+            let logs_filters: Vec<_> = EthereumLogFilter {
+                contracts_and_events_graph,
+                wildcard_events: HashMap::new(),
+            }
+            .eth_get_logs_filters()
+            .collect();
+
+            // Assert that a contract or event is filtered on iff it was present in the graph.
+            assert_eq!(
+                logs_filters
+                    .iter()
+                    .map(|l| l.contracts.iter())
+                    .flatten()
+                    .copied()
+                    .collect::<BTreeSet<_>>(),
+                contracts
+            );
+            assert_eq!(
+                logs_filters
+                    .iter()
+                    .map(|l| l.event_signatures.iter())
+                    .flatten()
+                    .copied()
+                    .collect::<BTreeSet<_>>(),
+                events
+            );
+
+            // Assert that chunking works.
+            for filter in logs_filters {
+                assert!(filter.contracts.len() <= ENV_VARS.get_logs_max_contracts);
+            }
+        }
+    }
+}
+
+#[test]
+fn log_filter_require_transacion_receipt_method() {
+    // test data
+    let event_signature_a = H256::zero();
+    let event_signature_b = H256::from_low_u64_be(1);
+    let event_signature_c = H256::from_low_u64_be(2);
+    let contract_a = Address::from_low_u64_be(3);
+    let contract_b = Address::from_low_u64_be(4);
+    let contract_c = Address::from_low_u64_be(5);
+
+    let wildcard_event_with_receipt = H256::from_low_u64_be(6);
+    let wildcard_event_without_receipt = H256::from_low_u64_be(7);
+    let wildcard_events = [
+        (wildcard_event_with_receipt, true),
+        (wildcard_event_without_receipt, false),
+    ]
+    .into_iter()
+    .collect();
+
+    let alien_event_signature = H256::from_low_u64_be(8); // those will not be inserted in the graph
+    let alien_contract_address = Address::from_low_u64_be(9);
+
+    // test graph nodes
+    let event_a_node = LogFilterNode::Event(event_signature_a);
+    let event_b_node = LogFilterNode::Event(event_signature_b);
+    let event_c_node = LogFilterNode::Event(event_signature_c);
+    let contract_a_node = LogFilterNode::Contract(contract_a);
+    let contract_b_node = LogFilterNode::Contract(contract_b);
+    let contract_c_node = LogFilterNode::Contract(contract_c);
+
+    // build test graph with the following layout:
+    //
+    // ```dot
+    // graph bipartite {
+    //
+    //     // conected and require a receipt
+    //     event_a -- contract_a [ receipt=true  ]
+    //     event_b -- contract_b [ receipt=true  ]
+    //     event_c -- contract_c [ receipt=true  ]
+    //
+    //     // connected but don't require a receipt
+    //     event_a -- contract_b [ receipt=false ]
+    //     event_b -- contract_a [ receipt=false ]
+    // }
+    // ```
+    let mut contracts_and_events_graph = GraphMap::new();
+
+    let event_a_id = contracts_and_events_graph.add_node(event_a_node);
+    let event_b_id = contracts_and_events_graph.add_node(event_b_node);
+    let event_c_id = contracts_and_events_graph.add_node(event_c_node);
+    let contract_a_id = contracts_and_events_graph.add_node(contract_a_node);
+    let contract_b_id = contracts_and_events_graph.add_node(contract_b_node);
+    let contract_c_id = contracts_and_events_graph.add_node(contract_c_node);
+    contracts_and_events_graph.add_edge(event_a_id, contract_a_id, true);
+    contracts_and_events_graph.add_edge(event_b_id, contract_b_id, true);
+    contracts_and_events_graph.add_edge(event_a_id, contract_b_id, false);
+    contracts_and_events_graph.add_edge(event_b_id, contract_a_id, false);
+    contracts_and_events_graph.add_edge(event_c_id, contract_c_id, true);
+
+    let filter = EthereumLogFilter {
+        contracts_and_events_graph,
+        wildcard_events,
+    };
+
+    // connected contracts and events graph
+    assert!(filter.requires_transaction_receipt(&event_signature_a, Some(&contract_a)));
+    assert!(filter.requires_transaction_receipt(&event_signature_b, Some(&contract_b)));
+    assert!(filter.requires_transaction_receipt(&event_signature_c, Some(&contract_c)));
+    assert!(!filter.requires_transaction_receipt(&event_signature_a, Some(&contract_b)));
+    assert!(!filter.requires_transaction_receipt(&event_signature_b, Some(&contract_a)));
+
+    // Event C and Contract C are not connected to the other events and contracts
+    assert!(!filter.requires_transaction_receipt(&event_signature_a, Some(&contract_c)));
+    assert!(!filter.requires_transaction_receipt(&event_signature_b, Some(&contract_c)));
+    assert!(!filter.requires_transaction_receipt(&event_signature_c, Some(&contract_a)));
+    assert!(!filter.requires_transaction_receipt(&event_signature_c, Some(&contract_b)));
+
+    // Wildcard events
+    assert!(filter.requires_transaction_receipt(&wildcard_event_with_receipt, None));
+    assert!(!filter.requires_transaction_receipt(&wildcard_event_without_receipt, None));
+
+    // Alien events and contracts always return false
+    assert!(
+        !filter.requires_transaction_receipt(&alien_event_signature, Some(&alien_contract_address))
+    );
+    assert!(!filter.requires_transaction_receipt(&alien_event_signature, None));
+    assert!(!filter.requires_transaction_receipt(&alien_event_signature, Some(&contract_a)));
+    assert!(!filter.requires_transaction_receipt(&alien_event_signature, Some(&contract_b)));
+    assert!(!filter.requires_transaction_receipt(&alien_event_signature, Some(&contract_c)));
+    assert!(!filter.requires_transaction_receipt(&event_signature_a, Some(&alien_contract_address)));
+    assert!(!filter.requires_transaction_receipt(&event_signature_b, Some(&alien_contract_address)));
+    assert!(!filter.requires_transaction_receipt(&event_signature_c, Some(&alien_contract_address)));
+}
diff --git a/chain/ethereum/src/capabilities.rs b/chain/ethereum/src/capabilities.rs
new file mode 100644
index 0000000..15ce850
--- /dev/null
+++ b/chain/ethereum/src/capabilities.rs
@@ -0,0 +1,86 @@
+use anyhow::Error;
+use graph::impl_slog_value;
+use std::fmt;
+use std::str::FromStr;
+use std::{
+    cmp::{Ord, Ordering, PartialOrd},
+    collections::BTreeSet,
+};
+
+use crate::DataSource;
+
+#[derive(Clone, Copy, Debug, PartialEq, Eq)]
+pub struct NodeCapabilities {
+    pub archive: bool,
+    pub traces: bool,
+}
+
+// Take all NodeCapabilities fields into account when ordering
+// A NodeCapabilities instance is considered equal or greater than another
+// if all of its fields are equal or greater than the other
+impl Ord for NodeCapabilities {
+    fn cmp(&self, other: &Self) -> Ordering {
+        match (
+            self.archive.cmp(&other.archive),
+            self.traces.cmp(&other.traces),
+        ) {
+            (Ordering::Greater, Ordering::Greater) => Ordering::Greater,
+            (Ordering::Greater, Ordering::Equal) => Ordering::Greater,
+            (Ordering::Equal, Ordering::Greater) => Ordering::Greater,
+            (Ordering::Equal, Ordering::Equal) => Ordering::Equal,
+            (Ordering::Less, _) => Ordering::Less,
+            (_, Ordering::Less) => Ordering::Less,
+        }
+    }
+}
+
+impl PartialOrd for NodeCapabilities {
+    fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
+        Some(self.cmp(other))
+    }
+}
+
+impl FromStr for NodeCapabilities {
+    type Err = Error;
+
+    fn from_str(s: &str) -> Result<Self, Self::Err> {
+        let capabilities: BTreeSet<&str> = s.split(',').collect();
+        Ok(NodeCapabilities {
+            archive: capabilities.contains("archive"),
+            traces: capabilities.contains("traces"),
+        })
+    }
+}
+
+impl fmt::Display for NodeCapabilities {
+    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
+        let NodeCapabilities { archive, traces } = self;
+
+        let mut capabilities = vec![];
+        if *archive {
+            capabilities.push("archive");
+        }
+        if *traces {
+            capabilities.push("traces");
+        }
+
+        f.write_str(&capabilities.join(", "))
+    }
+}
+
+impl_slog_value!(NodeCapabilities, "{}");
+
+impl graph::blockchain::NodeCapabilities<crate::Chain> for NodeCapabilities {
+    fn from_data_sources(data_sources: &[DataSource]) -> Self {
+        NodeCapabilities {
+            archive: data_sources.iter().any(|ds| {
+                ds.mapping
+                    .requires_archive()
+                    .expect("failed to parse mappings")
+            }),
+            traces: data_sources.into_iter().any(|ds| {
+                ds.mapping.has_call_handler() || ds.mapping.has_block_handler_with_call_filter()
+            }),
+        }
+    }
+}
diff --git a/chain/ethereum/src/chain.rs b/chain/ethereum/src/chain.rs
new file mode 100644
index 0000000..c793cd4
--- /dev/null
+++ b/chain/ethereum/src/chain.rs
@@ -0,0 +1,687 @@
+use anyhow::Result;
+use anyhow::{Context, Error};
+use graph::blockchain::{BlockchainKind, TriggersAdapterSelector};
+use graph::data::subgraph::UnifiedMappingApiVersion;
+use graph::firehose::{FirehoseEndpoint, FirehoseEndpoints, ForkStep};
+use graph::prelude::{EthereumBlock, EthereumCallCache, LightEthereumBlock, LightEthereumBlockExt};
+use graph::slog::debug;
+use graph::{
+    blockchain::{
+        block_stream::{
+            BlockStreamEvent, BlockWithTriggers, FirehoseError,
+            FirehoseMapper as FirehoseMapperTrait, TriggersAdapter as TriggersAdapterTrait,
+        },
+        firehose_block_stream::FirehoseBlockStream,
+        polling_block_stream::PollingBlockStream,
+        Block, BlockPtr, Blockchain, ChainHeadUpdateListener, IngestorError,
+        RuntimeAdapter as RuntimeAdapterTrait, TriggerFilter as _,
+    },
+    cheap_clone::CheapClone,
+    components::store::DeploymentLocator,
+    firehose,
+    prelude::{
+        async_trait, o, serde_json as json, BlockNumber, ChainStore, EthereumBlockWithCalls,
+        Future01CompatExt, Logger, LoggerFactory, MetricsRegistry, NodeId,
+    },
+};
+use prost::Message;
+use std::collections::HashSet;
+use std::iter::FromIterator;
+use std::sync::Arc;
+
+use crate::data_source::DataSourceTemplate;
+use crate::data_source::UnresolvedDataSourceTemplate;
+use crate::{
+    adapter::EthereumAdapter as _,
+    codec,
+    data_source::{DataSource, UnresolvedDataSource},
+    ethereum_adapter::{
+        blocks_with_triggers, get_calls, parse_block_triggers, parse_call_triggers,
+        parse_log_triggers,
+    },
+    SubgraphEthRpcMetrics, TriggerFilter, ENV_VARS,
+};
+use crate::{network::EthereumNetworkAdapters, EthereumAdapter};
+use graph::blockchain::block_stream::{BlockStream, BlockStreamBuilder, FirehoseCursor};
+
+/// Celo Mainnet: 42220, Testnet Alfajores: 44787, Testnet Baklava: 62320
+const CELO_CHAIN_IDS: [u64; 3] = [42220, 44787, 62320];
+
+pub struct EthereumStreamBuilder {}
+
+#[async_trait]
+impl BlockStreamBuilder<Chain> for EthereumStreamBuilder {
+    async fn build_firehose(
+        &self,
+        chain: &Chain,
+        deployment: DeploymentLocator,
+        block_cursor: FirehoseCursor,
+        start_blocks: Vec<BlockNumber>,
+        subgraph_current_block: Option<BlockPtr>,
+        filter: Arc<<Chain as Blockchain>::TriggerFilter>,
+        unified_api_version: UnifiedMappingApiVersion,
+    ) -> Result<Box<dyn BlockStream<Chain>>> {
+        let requirements = filter.node_capabilities();
+        let adapter = chain
+            .triggers_adapter(&deployment, &requirements, unified_api_version)
+            .expect(&format!(
+                "no adapter for network {} with capabilities {}",
+                chain.name, requirements
+            ));
+
+        let firehose_endpoint = match chain.firehose_endpoints.random() {
+            Some(e) => e.clone(),
+            None => return Err(anyhow::format_err!("no firehose endpoint available",)),
+        };
+
+        let logger = chain
+            .logger_factory
+            .subgraph_logger(&deployment)
+            .new(o!("component" => "FirehoseBlockStream"));
+
+        let firehose_mapper = Arc::new(FirehoseMapper {
+            endpoint: firehose_endpoint.cheap_clone(),
+        });
+
+        Ok(Box::new(FirehoseBlockStream::new(
+            deployment.hash,
+            firehose_endpoint,
+            subgraph_current_block,
+            block_cursor,
+            firehose_mapper,
+            adapter,
+            filter,
+            start_blocks,
+            logger,
+            chain.registry.clone(),
+        )))
+    }
+
+    async fn build_polling(
+        &self,
+        _chain: Arc<Chain>,
+        _deployment: DeploymentLocator,
+        _start_blocks: Vec<BlockNumber>,
+        _subgraph_current_block: Option<BlockPtr>,
+        _filter: Arc<<Chain as Blockchain>::TriggerFilter>,
+        _unified_api_version: UnifiedMappingApiVersion,
+    ) -> Result<Box<dyn BlockStream<Chain>>> {
+        todo!()
+    }
+}
+
+pub struct EthereumAdapterSelector {
+    logger_factory: LoggerFactory,
+    adapters: Arc<EthereumNetworkAdapters>,
+    firehose_endpoints: Arc<FirehoseEndpoints>,
+    registry: Arc<dyn MetricsRegistry>,
+    chain_store: Arc<dyn ChainStore>,
+}
+
+impl EthereumAdapterSelector {
+    pub fn new(
+        logger_factory: LoggerFactory,
+        adapters: Arc<EthereumNetworkAdapters>,
+        firehose_endpoints: Arc<FirehoseEndpoints>,
+        registry: Arc<dyn MetricsRegistry>,
+        chain_store: Arc<dyn ChainStore>,
+    ) -> Self {
+        Self {
+            logger_factory,
+            adapters,
+            firehose_endpoints,
+            registry,
+            chain_store,
+        }
+    }
+}
+
+impl TriggersAdapterSelector<Chain> for EthereumAdapterSelector {
+    fn triggers_adapter(
+        &self,
+        loc: &DeploymentLocator,
+        capabilities: &<Chain as Blockchain>::NodeCapabilities,
+        unified_api_version: UnifiedMappingApiVersion,
+    ) -> Result<Arc<dyn TriggersAdapterTrait<Chain>>, Error> {
+        let logger = self
+            .logger_factory
+            .subgraph_logger(&loc)
+            .new(o!("component" => "BlockStream"));
+
+        let eth_adapter = if capabilities.traces && self.firehose_endpoints.len() > 0 {
+            debug!(logger, "Removing 'traces' capability requirement for adapter as FirehoseBlockStream will provide the traces");
+            let adjusted_capabilities = crate::capabilities::NodeCapabilities {
+                archive: capabilities.archive,
+                traces: false,
+            };
+
+            self.adapters.cheapest_with(&adjusted_capabilities)?.clone()
+        } else {
+            self.adapters.cheapest_with(capabilities)?.clone()
+        };
+
+        let ethrpc_metrics = Arc::new(SubgraphEthRpcMetrics::new(self.registry.clone(), &loc.hash));
+
+        let adapter = TriggersAdapter {
+            logger: logger.clone(),
+            ethrpc_metrics,
+            eth_adapter,
+            chain_store: self.chain_store.cheap_clone(),
+            unified_api_version,
+        };
+        Ok(Arc::new(adapter))
+    }
+}
+
+pub struct Chain {
+    logger_factory: LoggerFactory,
+    name: String,
+    node_id: NodeId,
+    registry: Arc<dyn MetricsRegistry>,
+    firehose_endpoints: Arc<FirehoseEndpoints>,
+    eth_adapters: Arc<EthereumNetworkAdapters>,
+    chain_store: Arc<dyn ChainStore>,
+    call_cache: Arc<dyn EthereumCallCache>,
+    chain_head_update_listener: Arc<dyn ChainHeadUpdateListener>,
+    reorg_threshold: BlockNumber,
+    pub is_ingestible: bool,
+    block_stream_builder: Arc<dyn BlockStreamBuilder<Self>>,
+    adapter_selector: Arc<dyn TriggersAdapterSelector<Self>>,
+    runtime_adapter: Arc<dyn RuntimeAdapterTrait<Self>>,
+}
+
+impl std::fmt::Debug for Chain {
+    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
+        write!(f, "chain: ethereum")
+    }
+}
+
+impl Chain {
+    /// Creates a new Ethereum [`Chain`].
+    pub fn new(
+        logger_factory: LoggerFactory,
+        name: String,
+        node_id: NodeId,
+        registry: Arc<dyn MetricsRegistry>,
+        chain_store: Arc<dyn ChainStore>,
+        call_cache: Arc<dyn EthereumCallCache>,
+        firehose_endpoints: FirehoseEndpoints,
+        eth_adapters: EthereumNetworkAdapters,
+        chain_head_update_listener: Arc<dyn ChainHeadUpdateListener>,
+        block_stream_builder: Arc<dyn BlockStreamBuilder<Self>>,
+        adapter_selector: Arc<dyn TriggersAdapterSelector<Self>>,
+        runtime_adapter: Arc<dyn RuntimeAdapterTrait<Self>>,
+        reorg_threshold: BlockNumber,
+        is_ingestible: bool,
+    ) -> Self {
+        Chain {
+            logger_factory,
+            name,
+            node_id,
+            registry,
+            firehose_endpoints: Arc::new(firehose_endpoints),
+            eth_adapters: Arc::new(eth_adapters),
+            chain_store,
+            call_cache,
+            chain_head_update_listener,
+            block_stream_builder,
+            adapter_selector,
+            runtime_adapter,
+            reorg_threshold,
+            is_ingestible,
+        }
+    }
+
+    /// Returns a handler to this chain's [`EthereumCallCache`].
+    pub fn call_cache(&self) -> Arc<dyn EthereumCallCache> {
+        self.call_cache.clone()
+    }
+
+    pub fn cheapest_adapter(&self) -> Arc<EthereumAdapter> {
+        self.eth_adapters.cheapest().unwrap().clone()
+    }
+}
+
+#[async_trait]
+impl Blockchain for Chain {
+    const KIND: BlockchainKind = BlockchainKind::Ethereum;
+    const ALIASES: &'static [&'static str] = &["ethereum/contract"];
+
+    type Block = BlockFinality;
+
+    type DataSource = DataSource;
+
+    type UnresolvedDataSource = UnresolvedDataSource;
+
+    type DataSourceTemplate = DataSourceTemplate;
+
+    type UnresolvedDataSourceTemplate = UnresolvedDataSourceTemplate;
+
+    type TriggerData = crate::trigger::EthereumTrigger;
+
+    type MappingTrigger = crate::trigger::MappingTrigger;
+
+    type TriggerFilter = crate::adapter::TriggerFilter;
+
+    type NodeCapabilities = crate::capabilities::NodeCapabilities;
+
+    fn triggers_adapter(
+        &self,
+        loc: &DeploymentLocator,
+        capabilities: &Self::NodeCapabilities,
+        unified_api_version: UnifiedMappingApiVersion,
+    ) -> Result<Arc<dyn TriggersAdapterTrait<Self>>, Error> {
+        self.adapter_selector
+            .triggers_adapter(loc, capabilities, unified_api_version)
+    }
+
+    async fn new_firehose_block_stream(
+        &self,
+        deployment: DeploymentLocator,
+        block_cursor: FirehoseCursor,
+        start_blocks: Vec<BlockNumber>,
+        subgraph_current_block: Option<BlockPtr>,
+        filter: Arc<Self::TriggerFilter>,
+        unified_api_version: UnifiedMappingApiVersion,
+    ) -> Result<Box<dyn BlockStream<Self>>, Error> {
+        self.block_stream_builder
+            .build_firehose(
+                self,
+                deployment,
+                block_cursor,
+                start_blocks,
+                subgraph_current_block,
+                filter,
+                unified_api_version,
+            )
+            .await
+    }
+
+    async fn new_polling_block_stream(
+        &self,
+        deployment: DeploymentLocator,
+        start_blocks: Vec<BlockNumber>,
+        subgraph_current_block: Option<BlockPtr>,
+        filter: Arc<Self::TriggerFilter>,
+        unified_api_version: UnifiedMappingApiVersion,
+    ) -> Result<Box<dyn BlockStream<Self>>, Error> {
+        let requirements = filter.node_capabilities();
+        let adapter = self
+            .triggers_adapter(&deployment, &requirements, unified_api_version.clone())
+            .expect(&format!(
+                "no adapter for network {} with capabilities {}",
+                self.name, requirements
+            ));
+
+        let logger = self
+            .logger_factory
+            .subgraph_logger(&deployment)
+            .new(o!("component" => "BlockStream"));
+        let chain_store = self.chain_store().clone();
+        let chain_head_update_stream = self
+            .chain_head_update_listener
+            .subscribe(self.name.clone(), logger.clone());
+
+        // Special case: Detect Celo and set the threshold to 0, so that eth_getLogs is always used.
+        // This is ok because Celo blocks are always final. And we _need_ to do this because
+        // some events appear only in eth_getLogs but not in transaction receipts.
+        // See also ca0edc58-0ec5-4c89-a7dd-2241797f5e50.
+        let chain_id = self.eth_adapters.cheapest().unwrap().chain_id().await?;
+        let reorg_threshold = match CELO_CHAIN_IDS.contains(&chain_id) {
+            false => self.reorg_threshold,
+            true => 0,
+        };
+
+        Ok(Box::new(PollingBlockStream::new(
+            chain_store,
+            chain_head_update_stream,
+            adapter,
+            self.node_id.clone(),
+            deployment.hash,
+            filter,
+            start_blocks,
+            reorg_threshold,
+            logger,
+            ENV_VARS.max_block_range_size,
+            ENV_VARS.target_triggers_per_block_range,
+            unified_api_version,
+            subgraph_current_block,
+        )))
+    }
+
+    fn chain_store(&self) -> Arc<dyn ChainStore> {
+        self.chain_store.clone()
+    }
+
+    async fn block_pointer_from_number(
+        &self,
+        logger: &Logger,
+        number: BlockNumber,
+    ) -> Result<BlockPtr, IngestorError> {
+        let eth_adapter = self
+            .eth_adapters
+            .cheapest()
+            .with_context(|| format!("no adapter for chain {}", self.name))?
+            .clone();
+        eth_adapter
+            .block_pointer_from_number(logger, number)
+            .compat()
+            .await
+    }
+
+    fn runtime_adapter(&self) -> Arc<dyn RuntimeAdapterTrait<Self>> {
+        self.runtime_adapter.clone()
+    }
+
+    fn is_firehose_supported(&self) -> bool {
+        ENV_VARS.is_firehose_preferred && self.firehose_endpoints.len() > 0
+    }
+}
+
+/// This is used in `EthereumAdapter::triggers_in_block`, called when re-processing a block for
+/// newly created data sources. This allows the re-processing to be reorg safe without having to
+/// always fetch the full block data.
+#[derive(Clone, Debug)]
+pub enum BlockFinality {
+    /// If a block is final, we only need the header and the triggers.
+    Final(Arc<LightEthereumBlock>),
+
+    // If a block may still be reorged, we need to work with more local data.
+    NonFinal(EthereumBlockWithCalls),
+}
+
+impl Default for BlockFinality {
+    fn default() -> Self {
+        Self::Final(Arc::default())
+    }
+}
+
+impl BlockFinality {
+    pub(crate) fn light_block(&self) -> &Arc<LightEthereumBlock> {
+        match self {
+            BlockFinality::Final(block) => block,
+            BlockFinality::NonFinal(block) => &block.ethereum_block.block,
+        }
+    }
+}
+
+impl<'a> From<&'a BlockFinality> for BlockPtr {
+    fn from(block: &'a BlockFinality) -> BlockPtr {
+        match block {
+            BlockFinality::Final(b) => BlockPtr::from(&**b),
+            BlockFinality::NonFinal(b) => BlockPtr::from(&b.ethereum_block),
+        }
+    }
+}
+
+impl Block for BlockFinality {
+    fn ptr(&self) -> BlockPtr {
+        match self {
+            BlockFinality::Final(block) => block.block_ptr(),
+            BlockFinality::NonFinal(block) => block.ethereum_block.block.block_ptr(),
+        }
+    }
+
+    fn parent_ptr(&self) -> Option<BlockPtr> {
+        match self {
+            BlockFinality::Final(block) => block.parent_ptr(),
+            BlockFinality::NonFinal(block) => block.ethereum_block.block.parent_ptr(),
+        }
+    }
+
+    fn data(&self) -> Result<json::Value, json::Error> {
+        // The serialization here very delicately depends on how the
+        // `ChainStore`'s `blocks` and `ancestor_block` return the data we
+        // store here. This should be fixed in a better way to ensure we
+        // serialize/deserialize appropriately.
+        //
+        // Commit #d62e9846 inadvertently introduced a variation in how
+        // chain stores store ethereum blocks in that they now sometimes
+        // store an `EthereumBlock` that has a `block` field with a
+        // `LightEthereumBlock`, and sometimes they just store the
+        // `LightEthereumBlock` directly. That causes issues because the
+        // code reading from the chain store always expects the JSON data to
+        // have the form of an `EthereumBlock`.
+        //
+        // Even though this bug is fixed now and we always use the
+        // serialization of an `EthereumBlock`, there are still chain stores
+        // in existence that used the old serialization form, and we need to
+        // deal with that when deserializing
+        //
+        // see also 7736e440-4c6b-11ec-8c4d-b42e99f52061
+        match self {
+            BlockFinality::Final(block) => {
+                let eth_block = EthereumBlock {
+                    block: block.clone(),
+                    transaction_receipts: vec![],
+                };
+                json::to_value(eth_block)
+            }
+            BlockFinality::NonFinal(block) => json::to_value(&block.ethereum_block),
+        }
+    }
+}
+
+pub struct DummyDataSourceTemplate;
+
+pub struct TriggersAdapter {
+    logger: Logger,
+    ethrpc_metrics: Arc<SubgraphEthRpcMetrics>,
+    chain_store: Arc<dyn ChainStore>,
+    eth_adapter: Arc<EthereumAdapter>,
+    unified_api_version: UnifiedMappingApiVersion,
+}
+
+#[async_trait]
+impl TriggersAdapterTrait<Chain> for TriggersAdapter {
+    async fn scan_triggers(
+        &self,
+        from: BlockNumber,
+        to: BlockNumber,
+        filter: &TriggerFilter,
+    ) -> Result<Vec<BlockWithTriggers<Chain>>, Error> {
+        blocks_with_triggers(
+            self.eth_adapter.clone(),
+            self.logger.clone(),
+            self.chain_store.clone(),
+            self.ethrpc_metrics.clone(),
+            from,
+            to,
+            filter,
+            self.unified_api_version.clone(),
+        )
+        .await
+    }
+
+    async fn triggers_in_block(
+        &self,
+        logger: &Logger,
+        block: BlockFinality,
+        filter: &TriggerFilter,
+    ) -> Result<BlockWithTriggers<Chain>, Error> {
+        let block = get_calls(
+            self.eth_adapter.as_ref(),
+            logger.clone(),
+            self.ethrpc_metrics.clone(),
+            filter.requires_traces(),
+            block,
+        )
+        .await?;
+
+        match &block {
+            BlockFinality::Final(_) => {
+                let block_number = block.number() as BlockNumber;
+                let blocks = blocks_with_triggers(
+                    self.eth_adapter.clone(),
+                    logger.clone(),
+                    self.chain_store.clone(),
+                    self.ethrpc_metrics.clone(),
+                    block_number,
+                    block_number,
+                    filter,
+                    self.unified_api_version.clone(),
+                )
+                .await?;
+                assert!(blocks.len() == 1);
+                Ok(blocks.into_iter().next().unwrap())
+            }
+            BlockFinality::NonFinal(full_block) => {
+                let mut triggers = Vec::new();
+                triggers.append(&mut parse_log_triggers(
+                    &filter.log,
+                    &full_block.ethereum_block,
+                ));
+                triggers.append(&mut parse_call_triggers(&filter.call, &full_block)?);
+                triggers.append(&mut parse_block_triggers(&filter.block, &full_block));
+                Ok(BlockWithTriggers::new(block, triggers))
+            }
+        }
+    }
+
+    async fn is_on_main_chain(&self, ptr: BlockPtr) -> Result<bool, Error> {
+        self.eth_adapter
+            .is_on_main_chain(&self.logger, ptr.clone())
+            .await
+    }
+
+    async fn ancestor_block(
+        &self,
+        ptr: BlockPtr,
+        offset: BlockNumber,
+    ) -> Result<Option<BlockFinality>, Error> {
+        let block: Option<EthereumBlock> = self
+            .chain_store
+            .cheap_clone()
+            .ancestor_block(ptr, offset)
+            .await?
+            .map(json::from_value)
+            .transpose()?;
+        Ok(block.map(|block| {
+            BlockFinality::NonFinal(EthereumBlockWithCalls {
+                ethereum_block: block,
+                calls: None,
+            })
+        }))
+    }
+
+    async fn parent_ptr(&self, block: &BlockPtr) -> Result<Option<BlockPtr>, Error> {
+        use futures::stream::Stream;
+        use graph::prelude::LightEthereumBlockExt;
+
+        let blocks = self
+            .eth_adapter
+            .load_blocks(
+                self.logger.cheap_clone(),
+                self.chain_store.cheap_clone(),
+                HashSet::from_iter(Some(block.hash_as_h256())),
+            )
+            .collect()
+            .compat()
+            .await?;
+        assert_eq!(blocks.len(), 1);
+
+        Ok(blocks[0].parent_ptr())
+    }
+}
+
+pub struct FirehoseMapper {
+    endpoint: Arc<FirehoseEndpoint>,
+}
+
+#[async_trait]
+impl FirehoseMapperTrait<Chain> for FirehoseMapper {
+    async fn to_block_stream_event(
+        &self,
+        logger: &Logger,
+        response: &firehose::Response,
+        adapter: &Arc<dyn TriggersAdapterTrait<Chain>>,
+        filter: &TriggerFilter,
+    ) -> Result<BlockStreamEvent<Chain>, FirehoseError> {
+        let step = ForkStep::from_i32(response.step).unwrap_or_else(|| {
+            panic!(
+                "unknown step i32 value {}, maybe you forgot update & re-regenerate the protobuf definitions?",
+                response.step
+            )
+        });
+        let any_block = response
+            .block
+            .as_ref()
+            .expect("block payload information should always be present");
+
+        // Right now, this is done in all cases but in reality, with how the BlockStreamEvent::Revert
+        // is defined right now, only block hash and block number is necessary. However, this information
+        // is not part of the actual firehose::Response payload. As such, we need to decode the full
+        // block which is useless.
+        //
+        // Check about adding basic information about the block in the firehose::Response or maybe
+        // define a slimmed down stuct that would decode only a few fields and ignore all the rest.
+        let block = codec::Block::decode(any_block.value.as_ref())?;
+
+        use firehose::ForkStep::*;
+        match step {
+            StepNew => {
+                // See comment(437a9f17-67cc-478f-80a3-804fe554b227) ethereum_block.calls is always Some even if calls
+                // is empty
+                let ethereum_block: EthereumBlockWithCalls = (&block).try_into()?;
+
+                // triggers in block never actually calls the ethereum traces api.
+                // TODO: Split the trigger parsing from call retrieving.
+                let block_with_triggers = adapter
+                    .triggers_in_block(logger, BlockFinality::NonFinal(ethereum_block), filter)
+                    .await?;
+
+                Ok(BlockStreamEvent::ProcessBlock(
+                    block_with_triggers,
+                    FirehoseCursor::from(response.cursor.clone()),
+                ))
+            }
+
+            StepUndo => {
+                let parent_ptr = block
+                    .parent_ptr()
+                    .expect("Genesis block should never be reverted");
+
+                Ok(BlockStreamEvent::Revert(
+                    parent_ptr,
+                    FirehoseCursor::from(response.cursor.clone()),
+                ))
+            }
+
+            StepIrreversible => {
+                unreachable!("irreversible step is not handled and should not be requested in the Firehose request")
+            }
+
+            StepUnknown => {
+                unreachable!("unknown step should not happen in the Firehose response")
+            }
+        }
+    }
+
+    async fn block_ptr_for_number(
+        &self,
+        logger: &Logger,
+        number: BlockNumber,
+    ) -> Result<BlockPtr, Error> {
+        self.endpoint
+            .block_ptr_for_number::<codec::HeaderOnlyBlock>(logger, number)
+            .await
+    }
+
+    async fn final_block_ptr_for(
+        &self,
+        logger: &Logger,
+        block: &BlockFinality,
+    ) -> Result<BlockPtr, Error> {
+        // Firehose for Ethereum has an hard-coded confirmations for finality sets to 200 block
+        // behind the current block. The magic value 200 here comes from this hard-coded Firehose
+        // value.
+        let final_block_number = match block.number() {
+            x if x >= 200 => x - 200,
+            _ => 0,
+        };
+
+        self.endpoint
+            .block_ptr_for_number::<codec::HeaderOnlyBlock>(logger, final_block_number)
+            .await
+    }
+}
diff --git a/chain/ethereum/src/codec.rs b/chain/ethereum/src/codec.rs
new file mode 100644
index 0000000..b1ab800
--- /dev/null
+++ b/chain/ethereum/src/codec.rs
@@ -0,0 +1,455 @@
+#[rustfmt::skip]
+#[path = "protobuf/sf.ethereum.r#type.v2.rs"]
+mod pbcodec;
+
+use anyhow::format_err;
+use graph::{
+    blockchain::{Block as BlockchainBlock, BlockPtr},
+    prelude::{
+        web3,
+        web3::types::{Bytes, H160, H2048, H256, H64, U256, U64},
+        BlockNumber, Error, EthereumBlock, EthereumBlockWithCalls, EthereumCall,
+        LightEthereumBlock,
+    },
+};
+use std::sync::Arc;
+use std::{convert::TryFrom, fmt::Debug};
+
+use crate::chain::BlockFinality;
+
+pub use pbcodec::*;
+
+trait TryDecodeProto<U, V>: Sized
+where
+    U: TryFrom<Self>,
+    <U as TryFrom<Self>>::Error: Debug,
+    V: From<U>,
+{
+    fn try_decode_proto(self, label: &'static str) -> Result<V, Error> {
+        let u = U::try_from(self).map_err(|e| format_err!("invalid {}: {:?}", label, e))?;
+        let v = V::from(u);
+        Ok(v)
+    }
+}
+
+impl TryDecodeProto<[u8; 256], H2048> for &[u8] {}
+impl TryDecodeProto<[u8; 32], H256> for &[u8] {}
+impl TryDecodeProto<[u8; 20], H160> for &[u8] {}
+
+impl Into<web3::types::U256> for &BigInt {
+    fn into(self) -> web3::types::U256 {
+        web3::types::U256::from_big_endian(&self.bytes)
+    }
+}
+
+pub struct CallAt<'a> {
+    call: &'a Call,
+    block: &'a Block,
+    trace: &'a TransactionTrace,
+}
+
+impl<'a> CallAt<'a> {
+    pub fn new(call: &'a Call, block: &'a Block, trace: &'a TransactionTrace) -> Self {
+        Self { call, block, trace }
+    }
+}
+
+impl<'a> TryInto<EthereumCall> for CallAt<'a> {
+    type Error = Error;
+
+    fn try_into(self) -> Result<EthereumCall, Self::Error> {
+        Ok(EthereumCall {
+            from: self.call.caller.try_decode_proto("call from address")?,
+            to: self.call.address.try_decode_proto("call to address")?,
+            value: self
+                .call
+                .value
+                .as_ref()
+                .map_or_else(|| U256::from(0), |v| v.into()),
+            gas_used: U256::from(self.call.gas_consumed),
+            input: Bytes(self.call.input.clone()),
+            output: Bytes(self.call.return_data.clone()),
+            block_hash: self.block.hash.try_decode_proto("call block hash")?,
+            block_number: self.block.number as i32,
+            transaction_hash: Some(self.trace.hash.try_decode_proto("call transaction hash")?),
+            transaction_index: self.trace.index as u64,
+        })
+    }
+}
+
+impl TryInto<web3::types::Call> for Call {
+    type Error = Error;
+
+    fn try_into(self) -> Result<web3::types::Call, Self::Error> {
+        Ok(web3::types::Call {
+            from: self.caller.try_decode_proto("call from address")?,
+            to: self.address.try_decode_proto("call to address")?,
+            value: self
+                .value
+                .as_ref()
+                .map_or_else(|| U256::from(0), |v| v.into()),
+            gas: U256::from(self.gas_limit),
+            input: Bytes::from(self.input.clone()),
+            call_type: CallType::from_i32(self.call_type)
+                .ok_or_else(|| format_err!("invalid call type: {}", self.call_type,))?
+                .into(),
+        })
+    }
+}
+
+impl Into<web3::types::CallType> for CallType {
+    fn into(self) -> web3::types::CallType {
+        match self {
+            CallType::Unspecified => web3::types::CallType::None,
+            CallType::Call => web3::types::CallType::Call,
+            CallType::Callcode => web3::types::CallType::CallCode,
+            CallType::Delegate => web3::types::CallType::DelegateCall,
+            CallType::Static => web3::types::CallType::StaticCall,
+
+            // FIXME (SF): Really not sure what this should map to, we are using None for now, need to revisit
+            CallType::Create => web3::types::CallType::None,
+        }
+    }
+}
+
+pub struct LogAt<'a> {
+    log: &'a Log,
+    block: &'a Block,
+    trace: &'a TransactionTrace,
+}
+
+impl<'a> LogAt<'a> {
+    pub fn new(log: &'a Log, block: &'a Block, trace: &'a TransactionTrace) -> Self {
+        Self { log, block, trace }
+    }
+}
+
+impl<'a> TryInto<web3::types::Log> for LogAt<'a> {
+    type Error = Error;
+
+    fn try_into(self) -> Result<web3::types::Log, Self::Error> {
+        Ok(web3::types::Log {
+            address: self.log.address.try_decode_proto("log address")?,
+            topics: self
+                .log
+                .topics
+                .iter()
+                .map(|t| t.try_decode_proto("topic"))
+                .collect::<Result<Vec<H256>, Error>>()?,
+            data: Bytes::from(self.log.data.clone()),
+            block_hash: Some(self.block.hash.try_decode_proto("log block hash")?),
+            block_number: Some(U64::from(self.block.number)),
+            transaction_hash: Some(self.trace.hash.try_decode_proto("log transaction hash")?),
+            transaction_index: Some(U64::from(self.trace.index as u64)),
+            log_index: Some(U256::from(self.log.block_index)),
+            transaction_log_index: Some(U256::from(self.log.index)),
+            log_type: None,
+            removed: None,
+        })
+    }
+}
+
+impl Into<web3::types::U64> for TransactionTraceStatus {
+    fn into(self) -> web3::types::U64 {
+        let status: Option<web3::types::U64> = self.into();
+        status.unwrap_or_else(|| web3::types::U64::from(0))
+    }
+}
+
+impl Into<Option<web3::types::U64>> for TransactionTraceStatus {
+    fn into(self) -> Option<web3::types::U64> {
+        match self {
+            Self::Unknown => {
+                panic!("Got a transaction trace with status UNKNOWN, datasource is broken")
+            }
+            Self::Succeeded => Some(web3::types::U64::from(1)),
+            Self::Failed => Some(web3::types::U64::from(0)),
+            Self::Reverted => Some(web3::types::U64::from(0)),
+        }
+    }
+}
+
+pub struct TransactionTraceAt<'a> {
+    trace: &'a TransactionTrace,
+    block: &'a Block,
+}
+
+impl<'a> TransactionTraceAt<'a> {
+    pub fn new(trace: &'a TransactionTrace, block: &'a Block) -> Self {
+        Self { trace, block }
+    }
+}
+
+impl<'a> TryInto<web3::types::Transaction> for TransactionTraceAt<'a> {
+    type Error = Error;
+
+    fn try_into(self) -> Result<web3::types::Transaction, Self::Error> {
+        Ok(web3::types::Transaction {
+            hash: self.trace.hash.try_decode_proto("transaction hash")?,
+            nonce: U256::from(self.trace.nonce),
+            block_hash: Some(self.block.hash.try_decode_proto("transaction block hash")?),
+            block_number: Some(U64::from(self.block.number)),
+            transaction_index: Some(U64::from(self.trace.index as u64)),
+            from: Some(
+                self.trace
+                    .from
+                    .try_decode_proto("transaction from address")?,
+            ),
+            to: Some(self.trace.to.try_decode_proto("transaction to address")?),
+            value: self.trace.value.as_ref().map_or(U256::zero(), |x| x.into()),
+            gas_price: self.trace.gas_price.as_ref().map(|x| x.into()),
+            gas: U256::from(self.trace.gas_limit),
+            input: Bytes::from(self.trace.input.clone()),
+            v: None,
+            r: None,
+            s: None,
+            raw: None,
+            access_list: None,
+            max_fee_per_gas: None,
+            max_priority_fee_per_gas: None,
+            transaction_type: None,
+        })
+    }
+}
+
+impl TryInto<BlockFinality> for &Block {
+    type Error = Error;
+
+    fn try_into(self) -> Result<BlockFinality, Self::Error> {
+        Ok(BlockFinality::NonFinal(self.try_into()?))
+    }
+}
+
+impl TryInto<EthereumBlockWithCalls> for &Block {
+    type Error = Error;
+
+    fn try_into(self) -> Result<EthereumBlockWithCalls, Self::Error> {
+        let header = self
+            .header
+            .as_ref()
+            .expect("block header should always be present from gRPC Firehose");
+
+        let block = EthereumBlockWithCalls {
+            ethereum_block: EthereumBlock {
+                block: Arc::new(LightEthereumBlock {
+                    hash: Some(self.hash.try_decode_proto("block hash")?),
+                    number: Some(U64::from(self.number)),
+                    author: header.coinbase.try_decode_proto("author / coinbase")?,
+                    parent_hash: header.parent_hash.try_decode_proto("parent hash")?,
+                    uncles_hash: header.uncle_hash.try_decode_proto("uncle hash")?,
+                    state_root: header.state_root.try_decode_proto("state root")?,
+                    transactions_root: header
+                        .transactions_root
+                        .try_decode_proto("transactions root")?,
+                    receipts_root: header.receipt_root.try_decode_proto("receipt root")?,
+                    gas_used: U256::from(header.gas_used),
+                    gas_limit: U256::from(header.gas_limit),
+                    base_fee_per_gas: None,
+                    extra_data: Bytes::from(header.extra_data.clone()),
+                    logs_bloom: match &header.logs_bloom.len() {
+                        0 => None,
+                        _ => Some(header.logs_bloom.try_decode_proto("logs bloom")?),
+                    },
+                    timestamp: U256::from(
+                        header
+                            .timestamp
+                            .as_ref()
+                            .map_or_else(|| U256::default(), |v| U256::from(v.seconds)),
+                    ),
+                    difficulty: header
+                        .difficulty
+                        .as_ref()
+                        .map_or_else(|| U256::default(), |v| v.into()),
+                    total_difficulty: Some(
+                        header
+                            .total_difficulty
+                            .as_ref()
+                            .map_or_else(|| U256::default(), |v| v.into()),
+                    ),
+                    // FIXME (SF): Firehose does not have seal fields, are they really used? Might be required for POA chains only also, I've seen that stuff on xDai (is this important?)
+                    seal_fields: vec![],
+                    uncles: self
+                        .uncles
+                        .iter()
+                        .map(|u| u.hash.try_decode_proto("uncle hash"))
+                        .collect::<Result<Vec<H256>, _>>()?,
+                    transactions: self
+                        .transaction_traces
+                        .iter()
+                        .map(|t| TransactionTraceAt::new(t, &self).try_into())
+                        .collect::<Result<Vec<web3::types::Transaction>, Error>>()?,
+                    size: Some(U256::from(self.size)),
+                    mix_hash: Some(header.mix_hash.try_decode_proto("mix hash")?),
+                    nonce: Some(H64::from_low_u64_be(header.nonce)),
+                }),
+                transaction_receipts: self
+                    .transaction_traces
+                    .iter()
+                    .filter_map(|t| {
+                        t.receipt.as_ref().map(|r| {
+                            Ok(web3::types::TransactionReceipt {
+                                transaction_hash: t.hash.try_decode_proto("transaction hash")?,
+                                transaction_index: U64::from(t.index),
+                                block_hash: Some(
+                                    self.hash.try_decode_proto("transaction block hash")?,
+                                ),
+                                block_number: Some(U64::from(self.number)),
+                                cumulative_gas_used: U256::from(r.cumulative_gas_used),
+                                // FIXME (SF): What is the rule here about gas_used being None, when it's 0?
+                                gas_used: Some(U256::from(t.gas_used)),
+                                contract_address: {
+                                    match t.calls.len() {
+                                        0 => None,
+                                        _ => {
+                                            match CallType::from_i32(t.calls[0].call_type)
+                                                .ok_or_else(|| {
+                                                    format_err!(
+                                                        "invalid call type: {}",
+                                                        t.calls[0].call_type,
+                                                    )
+                                                })? {
+                                                CallType::Create => {
+                                                    Some(t.calls[0].address.try_decode_proto(
+                                                        "transaction contract address",
+                                                    )?)
+                                                }
+                                                _ => None,
+                                            }
+                                        }
+                                    }
+                                },
+                                logs: r
+                                    .logs
+                                    .iter()
+                                    .map(|l| LogAt::new(l, &self, t).try_into())
+                                    .collect::<Result<Vec<_>, Error>>()?,
+                                status: TransactionTraceStatus::from_i32(t.status)
+                                    .ok_or_else(|| {
+                                        format_err!(
+                                            "invalid transaction trace status: {}",
+                                            t.status
+                                        )
+                                    })?
+                                    .into(),
+                                root: match r.state_root.len() {
+                                    0 => None, // FIXME (SF): should this instead map to [0;32]?
+                                    // FIXME (SF): if len < 32, what do we do?
+                                    _ => Some(
+                                        r.state_root.try_decode_proto("transaction state root")?,
+                                    ),
+                                },
+                                logs_bloom: r
+                                    .logs_bloom
+                                    .try_decode_proto("transaction logs bloom")?,
+                                from: t.from.try_decode_proto("transaction from")?,
+                                to: Some(t.to.try_decode_proto("transaction to")?),
+                                transaction_type: None,
+                                effective_gas_price: None,
+                            })
+                        })
+                    })
+                    .collect::<Result<Vec<_>, Error>>()?
+                    .into_iter()
+                    // Transaction receipts will be shared along the code, so we put them into an
+                    // Arc here to avoid excessive cloning.
+                    .map(Arc::new)
+                    .collect(),
+            },
+            // Comment (437a9f17-67cc-478f-80a3-804fe554b227): This Some() will avoid calls in the triggers_in_block
+            // TODO: Refactor in a way that this is no longer needed.
+            calls: Some(
+                self.transaction_traces
+                    .iter()
+                    .flat_map(|trace| {
+                        trace
+                            .calls
+                            .iter()
+                            .filter(|call| !call.status_reverted && !call.status_failed)
+                            .map(|call| CallAt::new(call, self, trace).try_into())
+                            .collect::<Vec<Result<EthereumCall, Error>>>()
+                    })
+                    .collect::<Result<_, _>>()?,
+            ),
+        };
+
+        Ok(block)
+    }
+}
+
+impl BlockHeader {
+    pub fn parent_ptr(&self) -> Option<BlockPtr> {
+        match self.parent_hash.len() {
+            0 => None,
+            _ => Some(BlockPtr::from((
+                H256::from_slice(self.parent_hash.as_ref()),
+                self.number - 1,
+            ))),
+        }
+    }
+}
+
+impl<'a> From<&'a BlockHeader> for BlockPtr {
+    fn from(b: &'a BlockHeader) -> BlockPtr {
+        BlockPtr::from((H256::from_slice(b.hash.as_ref()), b.number))
+    }
+}
+
+impl<'a> From<&'a Block> for BlockPtr {
+    fn from(b: &'a Block) -> BlockPtr {
+        BlockPtr::from((H256::from_slice(b.hash.as_ref()), b.number))
+    }
+}
+
+impl Block {
+    pub fn header(&self) -> &BlockHeader {
+        self.header.as_ref().unwrap()
+    }
+
+    pub fn ptr(&self) -> BlockPtr {
+        BlockPtr::from(self.header())
+    }
+
+    pub fn parent_ptr(&self) -> Option<BlockPtr> {
+        self.header().parent_ptr()
+    }
+}
+
+impl BlockchainBlock for Block {
+    fn number(&self) -> i32 {
+        BlockNumber::try_from(self.header().number).unwrap()
+    }
+
+    fn ptr(&self) -> BlockPtr {
+        self.into()
+    }
+
+    fn parent_ptr(&self) -> Option<BlockPtr> {
+        self.parent_ptr()
+    }
+}
+
+impl HeaderOnlyBlock {
+    pub fn header(&self) -> &BlockHeader {
+        self.header.as_ref().unwrap()
+    }
+}
+
+impl<'a> From<&'a HeaderOnlyBlock> for BlockPtr {
+    fn from(b: &'a HeaderOnlyBlock) -> BlockPtr {
+        BlockPtr::from(b.header())
+    }
+}
+
+impl BlockchainBlock for HeaderOnlyBlock {
+    fn number(&self) -> i32 {
+        BlockNumber::try_from(self.header().number).unwrap()
+    }
+
+    fn ptr(&self) -> BlockPtr {
+        self.into()
+    }
+
+    fn parent_ptr(&self) -> Option<BlockPtr> {
+        self.header().parent_ptr()
+    }
+}
diff --git a/chain/ethereum/src/data_source.rs b/chain/ethereum/src/data_source.rs
new file mode 100644
index 0000000..9bf8949
--- /dev/null
+++ b/chain/ethereum/src/data_source.rs
@@ -0,0 +1,1075 @@
+use anyhow::{anyhow, Error};
+use anyhow::{ensure, Context};
+use graph::blockchain::TriggerWithHandler;
+use graph::components::store::StoredDynamicDataSource;
+use graph::prelude::ethabi::ethereum_types::H160;
+use graph::prelude::ethabi::StateMutability;
+use graph::prelude::futures03::future::try_join;
+use graph::prelude::futures03::stream::FuturesOrdered;
+use graph::prelude::{Link, SubgraphManifestValidationError};
+use graph::slog::{o, trace};
+use std::str::FromStr;
+use std::{convert::TryFrom, sync::Arc};
+use tiny_keccak::{keccak256, Keccak};
+
+use graph::{
+    blockchain::{self, Blockchain},
+    prelude::{
+        async_trait,
+        ethabi::{Address, Contract, Event, Function, LogParam, ParamType, RawLog},
+        info, serde_json, warn,
+        web3::types::{Log, Transaction, H256},
+        BlockNumber, CheapClone, DataSourceTemplateInfo, Deserialize, EthereumCall,
+        LightEthereumBlock, LightEthereumBlockExt, LinkResolver, Logger, TryStreamExt,
+    },
+};
+
+use graph::data::subgraph::{calls_host_fn, DataSourceContext, Source};
+
+use crate::chain::Chain;
+use crate::trigger::{EthereumBlockTriggerType, EthereumTrigger, MappingTrigger};
+
+// The recommended kind is `ethereum`, `ethereum/contract` is accepted for backwards compatibility.
+const ETHEREUM_KINDS: &[&str] = &["ethereum/contract", "ethereum"];
+
+/// Runtime representation of a data source.
+// Note: Not great for memory usage that this needs to be `Clone`, considering how there may be tens
+// of thousands of data sources in memory at once.
+#[derive(Clone, Debug)]
+pub struct DataSource {
+    pub kind: String,
+    pub network: Option<String>,
+    pub name: String,
+    pub manifest_idx: u32,
+    pub address: Option<Address>,
+    pub start_block: BlockNumber,
+    pub mapping: Mapping,
+    pub context: Arc<Option<DataSourceContext>>,
+    pub creation_block: Option<BlockNumber>,
+    pub contract_abi: Arc<MappingABI>,
+}
+
+impl blockchain::DataSource<Chain> for DataSource {
+    fn address(&self) -> Option<&[u8]> {
+        self.address.as_ref().map(|x| x.as_bytes())
+    }
+
+    fn start_block(&self) -> BlockNumber {
+        self.start_block
+    }
+
+    fn match_and_decode(
+        &self,
+        trigger: &<Chain as Blockchain>::TriggerData,
+        block: &Arc<<Chain as Blockchain>::Block>,
+        logger: &Logger,
+    ) -> Result<Option<TriggerWithHandler<Chain>>, Error> {
+        let block = block.light_block();
+        self.match_and_decode(trigger, block, logger)
+    }
+
+    fn name(&self) -> &str {
+        &self.name
+    }
+
+    fn kind(&self) -> &str {
+        &self.kind
+    }
+
+    fn network(&self) -> Option<&str> {
+        self.network.as_ref().map(|s| s.as_str())
+    }
+
+    fn context(&self) -> Arc<Option<DataSourceContext>> {
+        self.context.cheap_clone()
+    }
+
+    fn creation_block(&self) -> Option<BlockNumber> {
+        self.creation_block
+    }
+
+    fn is_duplicate_of(&self, other: &Self) -> bool {
+        let DataSource {
+            kind,
+            network,
+            name,
+            manifest_idx,
+            address,
+            mapping,
+            context,
+
+            // The creation block is ignored for detection duplicate data sources.
+            // Contract ABI equality is implicit in `mapping.abis` equality.
+            creation_block: _,
+            contract_abi: _,
+            start_block: _,
+        } = self;
+
+        // mapping_request_sender, host_metrics, and (most of) host_exports are operational structs
+        // used at runtime but not needed to define uniqueness; each runtime host should be for a
+        // unique data source.
+        kind == &other.kind
+            && network == &other.network
+            && name == &other.name
+            && manifest_idx == &other.manifest_idx
+            && address == &other.address
+            && mapping.abis == other.mapping.abis
+            && mapping.event_handlers == other.mapping.event_handlers
+            && mapping.call_handlers == other.mapping.call_handlers
+            && mapping.block_handlers == other.mapping.block_handlers
+            && context == &other.context
+    }
+
+    fn as_stored_dynamic_data_source(&self) -> StoredDynamicDataSource {
+        let param = self.address.map(|addr| addr.0.into());
+        StoredDynamicDataSource {
+            manifest_idx: self.manifest_idx,
+            param,
+            context: self
+                .context
+                .as_ref()
+                .as_ref()
+                .map(|ctx| serde_json::to_value(&ctx).unwrap()),
+            creation_block: self.creation_block,
+            is_offchain: false,
+        }
+    }
+
+    fn from_stored_dynamic_data_source(
+        template: &DataSourceTemplate,
+        stored: StoredDynamicDataSource,
+    ) -> Result<Self, Error> {
+        let StoredDynamicDataSource {
+            manifest_idx,
+            param,
+            context,
+            creation_block,
+            is_offchain,
+        } = stored;
+
+        ensure!(
+            !is_offchain,
+            "attempted to convert offchain data source to ethereum data source"
+        );
+
+        let context = context.map(serde_json::from_value).transpose()?;
+
+        let contract_abi = template.mapping.find_abi(&template.source.abi)?;
+
+        let address = param.map(|x| H160::from_slice(&x));
+        Ok(DataSource {
+            kind: template.kind.to_string(),
+            network: template.network.as_ref().map(|s| s.to_string()),
+            name: template.name.clone(),
+            manifest_idx,
+            address,
+            start_block: 0,
+            mapping: template.mapping.clone(),
+            context: Arc::new(context),
+            creation_block,
+            contract_abi,
+        })
+    }
+
+    fn validate(&self) -> Vec<Error> {
+        let mut errors = vec![];
+
+        if !ETHEREUM_KINDS.contains(&self.kind.as_str()) {
+            errors.push(anyhow!(
+                "data source has invalid `kind`, expected `ethereum` but found {}",
+                self.kind
+            ))
+        }
+
+        // Validate that there is a `source` address if there are call or block handlers
+        let no_source_address = self.address().is_none();
+        let has_call_handlers = !self.mapping.call_handlers.is_empty();
+        let has_block_handlers = !self.mapping.block_handlers.is_empty();
+        if no_source_address && (has_call_handlers || has_block_handlers) {
+            errors.push(SubgraphManifestValidationError::SourceAddressRequired.into());
+        };
+
+        // Validate that there are no more than one of each type of block_handler
+        let has_too_many_block_handlers = {
+            let mut non_filtered_block_handler_count = 0;
+            let mut call_filtered_block_handler_count = 0;
+            self.mapping
+                .block_handlers
+                .iter()
+                .for_each(|block_handler| {
+                    if block_handler.filter.is_none() {
+                        non_filtered_block_handler_count += 1
+                    } else {
+                        call_filtered_block_handler_count += 1
+                    }
+                });
+            non_filtered_block_handler_count > 1 || call_filtered_block_handler_count > 1
+        };
+        if has_too_many_block_handlers {
+            errors.push(anyhow!("data source has duplicated block handlers"));
+        }
+
+        // Validate that event handlers don't require receipts for API versions lower than 0.0.7
+        let api_version = self.api_version();
+        if api_version < semver::Version::new(0, 0, 7) {
+            for event_handler in &self.mapping.event_handlers {
+                if event_handler.receipt {
+                    errors.push(anyhow!(
+                        "data source has event handlers that require transaction receipts, but this \
+                         is only supported for apiVersion >= 0.0.7"
+                    ));
+                    break;
+                }
+            }
+        }
+
+        errors
+    }
+
+    fn api_version(&self) -> semver::Version {
+        self.mapping.api_version.clone()
+    }
+
+    fn runtime(&self) -> Option<Arc<Vec<u8>>> {
+        Some(self.mapping.runtime.cheap_clone())
+    }
+}
+
+impl DataSource {
+    fn from_manifest(
+        kind: String,
+        network: Option<String>,
+        name: String,
+        source: Source,
+        mapping: Mapping,
+        context: Option<DataSourceContext>,
+        manifest_idx: u32,
+    ) -> Result<Self, Error> {
+        // Data sources in the manifest are created "before genesis" so they have no creation block.
+        let creation_block = None;
+        let contract_abi = mapping
+            .find_abi(&source.abi)
+            .with_context(|| format!("data source `{}`", name))?;
+
+        Ok(DataSource {
+            kind,
+            network,
+            name,
+            manifest_idx,
+            address: source.address,
+            start_block: source.start_block,
+            mapping,
+            context: Arc::new(context),
+            creation_block,
+            contract_abi,
+        })
+    }
+
+    fn handlers_for_log(&self, log: &Log) -> Result<Vec<MappingEventHandler>, Error> {
+        // Get signature from the log
+        let topic0 = log.topics.get(0).context("Ethereum event has no topics")?;
+
+        let handlers = self
+            .mapping
+            .event_handlers
+            .iter()
+            .filter(|handler| *topic0 == handler.topic0())
+            .cloned()
+            .collect::<Vec<_>>();
+
+        Ok(handlers)
+    }
+
+    fn handler_for_call(&self, call: &EthereumCall) -> Result<Option<MappingCallHandler>, Error> {
+        // First four bytes of the input for the call are the first four
+        // bytes of hash of the function signature
+        ensure!(
+            call.input.0.len() >= 4,
+            "Ethereum call has input with less than 4 bytes"
+        );
+
+        let target_method_id = &call.input.0[..4];
+
+        Ok(self
+            .mapping
+            .call_handlers
+            .iter()
+            .find(move |handler| {
+                let fhash = keccak256(handler.function.as_bytes());
+                let actual_method_id = [fhash[0], fhash[1], fhash[2], fhash[3]];
+                target_method_id == actual_method_id
+            })
+            .cloned())
+    }
+
+    fn handler_for_block(
+        &self,
+        trigger_type: &EthereumBlockTriggerType,
+    ) -> Option<MappingBlockHandler> {
+        match trigger_type {
+            EthereumBlockTriggerType::Every => self
+                .mapping
+                .block_handlers
+                .iter()
+                .find(move |handler| handler.filter == None)
+                .cloned(),
+            EthereumBlockTriggerType::WithCallTo(_address) => self
+                .mapping
+                .block_handlers
+                .iter()
+                .find(move |handler| handler.filter == Some(BlockHandlerFilter::Call))
+                .cloned(),
+        }
+    }
+
+    /// Returns the contract event with the given signature, if it exists. A an event from the ABI
+    /// will be matched if:
+    /// 1. An event signature is equal to `signature`.
+    /// 2. There are no equal matches, but there is exactly one event that equals `signature` if all
+    ///    `indexed` modifiers are removed from the parameters.
+    fn contract_event_with_signature(&self, signature: &str) -> Option<&Event> {
+        // Returns an `Event(uint256,address)` signature for an event, without `indexed` hints.
+        fn ambiguous_event_signature(event: &Event) -> String {
+            format!(
+                "{}({})",
+                event.name,
+                event
+                    .inputs
+                    .iter()
+                    .map(|input| format!("{}", event_param_type_signature(&input.kind)))
+                    .collect::<Vec<_>>()
+                    .join(",")
+            )
+        }
+
+        // Returns an `Event(indexed uint256,address)` type signature for an event.
+        fn event_signature(event: &Event) -> String {
+            format!(
+                "{}({})",
+                event.name,
+                event
+                    .inputs
+                    .iter()
+                    .map(|input| format!(
+                        "{}{}",
+                        if input.indexed { "indexed " } else { "" },
+                        event_param_type_signature(&input.kind)
+                    ))
+                    .collect::<Vec<_>>()
+                    .join(",")
+            )
+        }
+
+        // Returns the signature of an event parameter type (e.g. `uint256`).
+        fn event_param_type_signature(kind: &ParamType) -> String {
+            use ParamType::*;
+
+            match kind {
+                Address => "address".into(),
+                Bytes => "bytes".into(),
+                Int(size) => format!("int{}", size),
+                Uint(size) => format!("uint{}", size),
+                Bool => "bool".into(),
+                String => "string".into(),
+                Array(inner) => format!("{}[]", event_param_type_signature(&*inner)),
+                FixedBytes(size) => format!("bytes{}", size),
+                FixedArray(inner, size) => {
+                    format!("{}[{}]", event_param_type_signature(&*inner), size)
+                }
+                Tuple(components) => format!(
+                    "({})",
+                    components
+                        .iter()
+                        .map(|component| event_param_type_signature(&component))
+                        .collect::<Vec<_>>()
+                        .join(",")
+                ),
+            }
+        }
+
+        self.contract_abi
+            .contract
+            .events()
+            .find(|event| event_signature(event) == signature)
+            .or_else(|| {
+                // Fallback for subgraphs that don't use `indexed` in event signatures yet:
+                //
+                // If there is only one event variant with this name and if its signature
+                // without `indexed` matches the event signature from the manifest, we
+                // can safely assume that the event is a match, we don't need to force
+                // the subgraph to add `indexed`.
+
+                // Extract the event name; if there is no '(' in the signature,
+                // `event_name` will be empty and not match any events, so that's ok
+                let parens = signature.find('(').unwrap_or(0);
+                let event_name = &signature[0..parens];
+
+                let matching_events = self
+                    .contract_abi
+                    .contract
+                    .events()
+                    .filter(|event| event.name == event_name)
+                    .collect::<Vec<_>>();
+
+                // Only match the event signature without `indexed` if there is
+                // only a single event variant
+                if matching_events.len() == 1
+                    && ambiguous_event_signature(matching_events[0]) == signature
+                {
+                    Some(matching_events[0])
+                } else {
+                    // More than one event variant or the signature
+                    // still doesn't match, even if we ignore `indexed` hints
+                    None
+                }
+            })
+    }
+
+    fn contract_function_with_signature(&self, target_signature: &str) -> Option<&Function> {
+        self.contract_abi
+            .contract
+            .functions()
+            .filter(|function| match function.state_mutability {
+                StateMutability::Payable | StateMutability::NonPayable => true,
+                StateMutability::Pure | StateMutability::View => false,
+            })
+            .find(|function| {
+                // Construct the argument function signature:
+                // `address,uint256,bool`
+                let mut arguments = function
+                    .inputs
+                    .iter()
+                    .map(|input| format!("{}", input.kind))
+                    .collect::<Vec<String>>()
+                    .join(",");
+                // `address,uint256,bool)
+                arguments.push_str(")");
+                // `operation(address,uint256,bool)`
+                let actual_signature = vec![function.name.clone(), arguments].join("(");
+                target_signature == actual_signature
+            })
+    }
+
+    fn matches_trigger_address(&self, trigger: &EthereumTrigger) -> bool {
+        let ds_address = match self.address {
+            Some(addr) => addr,
+
+            // 'wildcard' data sources match any trigger address.
+            None => return true,
+        };
+
+        let trigger_address = match trigger {
+            EthereumTrigger::Block(_, EthereumBlockTriggerType::WithCallTo(address)) => address,
+            EthereumTrigger::Call(call) => &call.to,
+            EthereumTrigger::Log(log, _) => &log.address,
+
+            // Unfiltered block triggers match any data source address.
+            EthereumTrigger::Block(_, EthereumBlockTriggerType::Every) => return true,
+        };
+
+        ds_address == *trigger_address
+    }
+
+    /// Checks if `trigger` matches this data source, and if so decodes it into a `MappingTrigger`.
+    /// A return of `Ok(None)` mean the trigger does not match.
+    fn match_and_decode(
+        &self,
+        trigger: &EthereumTrigger,
+        block: &Arc<LightEthereumBlock>,
+        logger: &Logger,
+    ) -> Result<Option<TriggerWithHandler<Chain>>, Error> {
+        if !self.matches_trigger_address(&trigger) {
+            return Ok(None);
+        }
+
+        if self.start_block > block.number() {
+            return Ok(None);
+        }
+
+        match trigger {
+            EthereumTrigger::Block(_, trigger_type) => {
+                let handler = match self.handler_for_block(trigger_type) {
+                    Some(handler) => handler,
+                    None => return Ok(None),
+                };
+                Ok(Some(TriggerWithHandler::<Chain>::new(
+                    MappingTrigger::Block {
+                        block: block.cheap_clone(),
+                    },
+                    handler.handler,
+                    block.block_ptr(),
+                )))
+            }
+            EthereumTrigger::Log(log, receipt) => {
+                let potential_handlers = self.handlers_for_log(log)?;
+
+                // Map event handlers to (event handler, event ABI) pairs; fail if there are
+                // handlers that don't exist in the contract ABI
+                let valid_handlers = potential_handlers
+                    .into_iter()
+                    .map(|event_handler| {
+                        // Identify the event ABI in the contract
+                        let event_abi = self
+                            .contract_event_with_signature(event_handler.event.as_str())
+                            .with_context(|| {
+                                anyhow!(
+                                    "Event with the signature \"{}\" not found in \
+                                            contract \"{}\" of data source \"{}\"",
+                                    event_handler.event,
+                                    self.contract_abi.name,
+                                    self.name,
+                                )
+                            })?;
+                        Ok((event_handler, event_abi))
+                    })
+                    .collect::<Result<Vec<_>, anyhow::Error>>()?;
+
+                // Filter out handlers whose corresponding event ABIs cannot decode the
+                // params (this is common for overloaded events that have the same topic0
+                // but have indexed vs. non-indexed params that are encoded differently).
+                //
+                // Map (handler, event ABI) pairs to (handler, decoded params) pairs.
+                let mut matching_handlers = valid_handlers
+                    .into_iter()
+                    .filter_map(|(event_handler, event_abi)| {
+                        event_abi
+                            .parse_log(RawLog {
+                                topics: log.topics.clone(),
+                                data: log.data.clone().0,
+                            })
+                            .map(|log| log.params)
+                            .map_err(|e| {
+                                trace!(
+                                    logger,
+                                    "Skipping handler because the event parameters do not \
+                                    match the event signature. This is typically the case \
+                                    when parameters are indexed in the event but not in the \
+                                    signature or the other way around";
+                                    "handler" => &event_handler.handler,
+                                    "event" => &event_handler.event,
+                                    "error" => format!("{}", e),
+                                );
+                            })
+                            .ok()
+                            .map(|params| (event_handler, params))
+                    })
+                    .collect::<Vec<_>>();
+
+                if matching_handlers.is_empty() {
+                    return Ok(None);
+                }
+
+                // Process the event with the matching handler
+                let (event_handler, params) = matching_handlers.pop().unwrap();
+
+                ensure!(
+                    matching_handlers.is_empty(),
+                    format!(
+                        "Multiple handlers defined for event `{}`, only one is supported",
+                        &event_handler.event
+                    )
+                );
+
+                // Special case: In Celo, there are Epoch Rewards events, which do not have an
+                // associated transaction and instead have `transaction_hash == block.hash`,
+                // in which case we pass a dummy transaction to the mappings.
+                // See also ca0edc58-0ec5-4c89-a7dd-2241797f5e50.
+                let transaction = if log.transaction_hash != block.hash {
+                    block
+                        .transaction_for_log(&log)
+                        .context("Found no transaction for event")?
+                } else {
+                    // Infer some fields from the log and fill the rest with zeros.
+                    Transaction {
+                        hash: log.transaction_hash.unwrap(),
+                        block_hash: block.hash,
+                        block_number: block.number,
+                        transaction_index: log.transaction_index,
+                        from: Some(H160::zero()),
+                        ..Transaction::default()
+                    }
+                };
+
+                let logging_extras = Arc::new(o! {
+                    "signature" => event_handler.event.to_string(),
+                    "address" => format!("{}", &log.address),
+                    "transaction" => format!("{}", &transaction.hash),
+                });
+                Ok(Some(TriggerWithHandler::<Chain>::new_with_logging_extras(
+                    MappingTrigger::Log {
+                        block: block.cheap_clone(),
+                        transaction: Arc::new(transaction),
+                        log: log.cheap_clone(),
+                        params,
+                        receipt: receipt.clone(),
+                    },
+                    event_handler.handler,
+                    block.block_ptr(),
+                    logging_extras,
+                )))
+            }
+            EthereumTrigger::Call(call) => {
+                // Identify the call handler for this call
+                let handler = match self.handler_for_call(&call)? {
+                    Some(handler) => handler,
+                    None => return Ok(None),
+                };
+
+                // Identify the function ABI in the contract
+                let function_abi = self
+                    .contract_function_with_signature(handler.function.as_str())
+                    .with_context(|| {
+                        anyhow!(
+                            "Function with the signature \"{}\" not found in \
+                    contract \"{}\" of data source \"{}\"",
+                            handler.function,
+                            self.contract_abi.name,
+                            self.name
+                        )
+                    })?;
+
+                // Parse the inputs
+                //
+                // Take the input for the call, chop off the first 4 bytes, then call
+                // `function.decode_input` to get a vector of `Token`s. Match the `Token`s
+                // with the `Param`s in `function.inputs` to create a `Vec<LogParam>`.
+                let tokens = match function_abi.decode_input(&call.input.0[4..]).with_context(
+                    || {
+                        format!(
+                            "Generating function inputs for the call {:?} failed, raw input: {}",
+                            &function_abi,
+                            hex::encode(&call.input.0)
+                        )
+                    },
+                ) {
+                    Ok(val) => val,
+                    // See also 280b0108-a96e-4738-bb37-60ce11eeb5bf
+                    Err(err) => {
+                        warn!(logger, "Failed parsing inputs, skipping"; "error" => &err.to_string());
+                        return Ok(None);
+                    }
+                };
+
+                ensure!(
+                    tokens.len() == function_abi.inputs.len(),
+                    "Number of arguments in call does not match \
+                    number of inputs in function signature."
+                );
+
+                let inputs = tokens
+                    .into_iter()
+                    .enumerate()
+                    .map(|(i, token)| LogParam {
+                        name: function_abi.inputs[i].name.clone(),
+                        value: token,
+                    })
+                    .collect::<Vec<_>>();
+
+                // Parse the outputs
+                //
+                // Take the output for the call, then call `function.decode_output` to
+                // get a vector of `Token`s. Match the `Token`s with the `Param`s in
+                // `function.outputs` to create a `Vec<LogParam>`.
+                let tokens = function_abi
+                    .decode_output(&call.output.0)
+                    .with_context(|| {
+                        format!(
+                            "Decoding function outputs for the call {:?} failed, raw output: {}",
+                            &function_abi,
+                            hex::encode(&call.output.0)
+                        )
+                    })?;
+
+                ensure!(
+                    tokens.len() == function_abi.outputs.len(),
+                    "Number of parameters in the call output does not match \
+                        number of outputs in the function signature."
+                );
+
+                let outputs = tokens
+                    .into_iter()
+                    .enumerate()
+                    .map(|(i, token)| LogParam {
+                        name: function_abi.outputs[i].name.clone(),
+                        value: token,
+                    })
+                    .collect::<Vec<_>>();
+
+                let transaction = Arc::new(
+                    block
+                        .transaction_for_call(&call)
+                        .context("Found no transaction for call")?,
+                );
+                let logging_extras = Arc::new(o! {
+                    "function" => handler.function.to_string(),
+                    "to" => format!("{}", &call.to),
+                    "transaction" => format!("{}", &transaction.hash),
+                });
+                Ok(Some(TriggerWithHandler::<Chain>::new_with_logging_extras(
+                    MappingTrigger::Call {
+                        block: block.cheap_clone(),
+                        transaction,
+                        call: call.cheap_clone(),
+                        inputs,
+                        outputs,
+                    },
+                    handler.handler,
+                    block.block_ptr(),
+                    logging_extras,
+                )))
+            }
+        }
+    }
+}
+
+#[derive(Clone, Debug, Eq, PartialEq, Deserialize)]
+pub struct UnresolvedDataSource {
+    pub kind: String,
+    pub network: Option<String>,
+    pub name: String,
+    pub source: Source,
+    pub mapping: UnresolvedMapping,
+    pub context: Option<DataSourceContext>,
+}
+
+#[async_trait]
+impl blockchain::UnresolvedDataSource<Chain> for UnresolvedDataSource {
+    async fn resolve(
+        self,
+        resolver: &Arc<dyn LinkResolver>,
+        logger: &Logger,
+        manifest_idx: u32,
+    ) -> Result<DataSource, anyhow::Error> {
+        let UnresolvedDataSource {
+            kind,
+            network,
+            name,
+            source,
+            mapping,
+            context,
+        } = self;
+
+        info!(logger, "Resolve data source"; "name" => &name, "source_address" => format_args!("{:?}", source.address), "source_start_block" => source.start_block);
+
+        let mapping = mapping.resolve(&*resolver, logger).await?;
+
+        DataSource::from_manifest(kind, network, name, source, mapping, context, manifest_idx)
+    }
+}
+
+impl TryFrom<DataSourceTemplateInfo<Chain>> for DataSource {
+    type Error = anyhow::Error;
+
+    fn try_from(info: DataSourceTemplateInfo<Chain>) -> Result<Self, anyhow::Error> {
+        let DataSourceTemplateInfo {
+            template,
+            params,
+            context,
+            creation_block,
+        } = info;
+        let template = template.into_onchain().ok_or(anyhow!(
+            "Cannot create onchain data source from offchain template"
+        ))?;
+
+        // Obtain the address from the parameters
+        let string = params
+            .get(0)
+            .with_context(|| {
+                format!(
+                    "Failed to create data source from template `{}`: address parameter is missing",
+                    template.name
+                )
+            })?
+            .trim_start_matches("0x");
+
+        let address = Address::from_str(string).with_context(|| {
+            format!(
+                "Failed to create data source from template `{}`, invalid address provided",
+                template.name
+            )
+        })?;
+
+        let contract_abi = template
+            .mapping
+            .find_abi(&template.source.abi)
+            .with_context(|| format!("template `{}`", template.name))?;
+
+        Ok(DataSource {
+            kind: template.kind,
+            network: template.network,
+            name: template.name,
+            manifest_idx: template.manifest_idx,
+            address: Some(address),
+            start_block: 0,
+            mapping: template.mapping,
+            context: Arc::new(context),
+            creation_block: Some(creation_block),
+            contract_abi,
+        })
+    }
+}
+
+#[derive(Clone, Debug, Default, Hash, Eq, PartialEq, Deserialize)]
+pub struct UnresolvedDataSourceTemplate {
+    pub kind: String,
+    pub network: Option<String>,
+    pub name: String,
+    pub source: TemplateSource,
+    pub mapping: UnresolvedMapping,
+}
+
+#[derive(Clone, Debug)]
+pub struct DataSourceTemplate {
+    pub kind: String,
+    pub network: Option<String>,
+    pub name: String,
+    pub manifest_idx: u32,
+    pub source: TemplateSource,
+    pub mapping: Mapping,
+}
+
+#[async_trait]
+impl blockchain::UnresolvedDataSourceTemplate<Chain> for UnresolvedDataSourceTemplate {
+    async fn resolve(
+        self,
+        resolver: &Arc<dyn LinkResolver>,
+        logger: &Logger,
+        manifest_idx: u32,
+    ) -> Result<DataSourceTemplate, anyhow::Error> {
+        let UnresolvedDataSourceTemplate {
+            kind,
+            network,
+            name,
+            source,
+            mapping,
+        } = self;
+
+        info!(logger, "Resolve data source template"; "name" => &name);
+
+        Ok(DataSourceTemplate {
+            kind,
+            network,
+            name,
+            manifest_idx,
+            source,
+            mapping: mapping.resolve(resolver, logger).await?,
+        })
+    }
+}
+
+impl blockchain::DataSourceTemplate<Chain> for DataSourceTemplate {
+    fn name(&self) -> &str {
+        &self.name
+    }
+
+    fn api_version(&self) -> semver::Version {
+        self.mapping.api_version.clone()
+    }
+
+    fn runtime(&self) -> Option<Arc<Vec<u8>>> {
+        Some(self.mapping.runtime.cheap_clone())
+    }
+
+    fn manifest_idx(&self) -> u32 {
+        self.manifest_idx
+    }
+}
+
+#[derive(Clone, Debug, Default, Hash, Eq, PartialEq, Deserialize)]
+#[serde(rename_all = "camelCase")]
+pub struct UnresolvedMapping {
+    pub kind: String,
+    pub api_version: String,
+    pub language: String,
+    pub entities: Vec<String>,
+    pub abis: Vec<UnresolvedMappingABI>,
+    #[serde(default)]
+    pub block_handlers: Vec<MappingBlockHandler>,
+    #[serde(default)]
+    pub call_handlers: Vec<MappingCallHandler>,
+    #[serde(default)]
+    pub event_handlers: Vec<MappingEventHandler>,
+    pub file: Link,
+}
+
+#[derive(Clone, Debug)]
+pub struct Mapping {
+    pub kind: String,
+    pub api_version: semver::Version,
+    pub language: String,
+    pub entities: Vec<String>,
+    pub abis: Vec<Arc<MappingABI>>,
+    pub block_handlers: Vec<MappingBlockHandler>,
+    pub call_handlers: Vec<MappingCallHandler>,
+    pub event_handlers: Vec<MappingEventHandler>,
+    pub runtime: Arc<Vec<u8>>,
+    pub link: Link,
+}
+
+impl Mapping {
+    pub fn requires_archive(&self) -> anyhow::Result<bool> {
+        calls_host_fn(&self.runtime, "ethereum.call")
+    }
+
+    pub fn has_call_handler(&self) -> bool {
+        !self.call_handlers.is_empty()
+    }
+
+    pub fn has_block_handler_with_call_filter(&self) -> bool {
+        self.block_handlers
+            .iter()
+            .any(|handler| matches!(handler.filter, Some(BlockHandlerFilter::Call)))
+    }
+
+    pub fn find_abi(&self, abi_name: &str) -> Result<Arc<MappingABI>, Error> {
+        Ok(self
+            .abis
+            .iter()
+            .find(|abi| abi.name == abi_name)
+            .ok_or_else(|| anyhow!("No ABI entry with name `{}` found", abi_name))?
+            .cheap_clone())
+    }
+}
+
+impl UnresolvedMapping {
+    pub async fn resolve(
+        self,
+        resolver: &Arc<dyn LinkResolver>,
+        logger: &Logger,
+    ) -> Result<Mapping, anyhow::Error> {
+        let UnresolvedMapping {
+            kind,
+            api_version,
+            language,
+            entities,
+            abis,
+            block_handlers,
+            call_handlers,
+            event_handlers,
+            file: link,
+        } = self;
+
+        info!(logger, "Resolve mapping"; "link" => &link.link);
+
+        let api_version = semver::Version::parse(&api_version)?;
+
+        let (abis, runtime) = try_join(
+            // resolve each abi
+            abis.into_iter()
+                .map(|unresolved_abi| async {
+                    Result::<_, Error>::Ok(Arc::new(
+                        unresolved_abi.resolve(resolver, logger).await?,
+                    ))
+                })
+                .collect::<FuturesOrdered<_>>()
+                .try_collect::<Vec<_>>(),
+            async {
+                let module_bytes = resolver.cat(logger, &link).await?;
+                Ok(Arc::new(module_bytes))
+            },
+        )
+        .await?;
+
+        Ok(Mapping {
+            kind,
+            api_version,
+            language,
+            entities,
+            abis,
+            block_handlers: block_handlers.clone(),
+            call_handlers: call_handlers.clone(),
+            event_handlers: event_handlers.clone(),
+            runtime,
+            link,
+        })
+    }
+}
+
+#[derive(Clone, Debug, Hash, Eq, PartialEq, Deserialize)]
+pub struct UnresolvedMappingABI {
+    pub name: String,
+    pub file: Link,
+}
+
+#[derive(Clone, Debug, PartialEq)]
+pub struct MappingABI {
+    pub name: String,
+    pub contract: Contract,
+}
+
+impl UnresolvedMappingABI {
+    pub async fn resolve(
+        self,
+        resolver: &Arc<dyn LinkResolver>,
+        logger: &Logger,
+    ) -> Result<MappingABI, anyhow::Error> {
+        info!(
+            logger,
+            "Resolve ABI";
+            "name" => &self.name,
+            "link" => &self.file.link
+        );
+
+        let contract_bytes = resolver.cat(&logger, &self.file).await?;
+        let contract = Contract::load(&*contract_bytes)?;
+        Ok(MappingABI {
+            name: self.name,
+            contract,
+        })
+    }
+}
+
+#[derive(Clone, Debug, Hash, Eq, PartialEq, Deserialize)]
+pub struct MappingBlockHandler {
+    pub handler: String,
+    pub filter: Option<BlockHandlerFilter>,
+}
+
+#[derive(Clone, Debug, Hash, Eq, PartialEq, Deserialize)]
+#[serde(tag = "kind", rename_all = "lowercase")]
+pub enum BlockHandlerFilter {
+    // Call filter will trigger on all blocks where the data source contract
+    // address has been called
+    Call,
+}
+
+#[derive(Clone, Debug, Hash, Eq, PartialEq, Deserialize)]
+pub struct MappingCallHandler {
+    pub function: String,
+    pub handler: String,
+}
+
+#[derive(Clone, Debug, Hash, Eq, PartialEq, Deserialize)]
+pub struct MappingEventHandler {
+    pub event: String,
+    pub topic0: Option<H256>,
+    pub handler: String,
+    #[serde(default)]
+    pub receipt: bool,
+}
+
+impl MappingEventHandler {
+    pub fn topic0(&self) -> H256 {
+        self.topic0
+            .unwrap_or_else(|| string_to_h256(&self.event.replace("indexed ", "")))
+    }
+}
+
+/// Hashes a string to a H256 hash.
+fn string_to_h256(s: &str) -> H256 {
+    let mut result = [0u8; 32];
+    let data = s.replace(" ", "").into_bytes();
+    let mut sponge = Keccak::new_keccak256();
+    sponge.update(&data);
+    sponge.finalize(&mut result);
+
+    // This was deprecated but the replacement seems to not be available in the
+    // version web3 uses.
+    #[allow(deprecated)]
+    H256::from_slice(&result)
+}
+
+#[derive(Clone, Debug, Default, Hash, Eq, PartialEq, Deserialize)]
+pub struct TemplateSource {
+    pub abi: String,
+}
diff --git a/chain/ethereum/src/env.rs b/chain/ethereum/src/env.rs
new file mode 100644
index 0000000..b6c111b
--- /dev/null
+++ b/chain/ethereum/src/env.rs
@@ -0,0 +1,184 @@
+use envconfig::Envconfig;
+use graph::env::EnvVarBoolean;
+use graph::prelude::{envconfig, lazy_static, BlockNumber};
+use std::fmt;
+use std::time::Duration;
+
+lazy_static! {
+    pub static ref ENV_VARS: EnvVars = EnvVars::from_env().unwrap();
+}
+
+#[derive(Clone)]
+#[non_exhaustive]
+pub struct EnvVars {
+    /// Controls if firehose should be preferred over RPC if Firehose endpoints
+    /// are present, if not set, the default behavior is is kept which is to
+    /// automatically favor Firehose.
+    ///
+    /// Set by the flag `GRAPH_ETHEREUM_IS_FIREHOSE_PREFERRED`. On by default.
+    pub is_firehose_preferred: bool,
+    /// Additional deterministic errors that have not yet been hardcoded.
+    ///
+    /// Set by the environment variable `GRAPH_GETH_ETH_CALL_ERRORS`, separated
+    /// by `;`.
+    pub geth_eth_call_errors: Vec<String>,
+    /// Set by the environment variable `GRAPH_ETH_GET_LOGS_MAX_CONTRACTS`. The
+    /// default value is 2000.
+    pub get_logs_max_contracts: usize,
+
+    /// Set by the environment variable `ETHEREUM_REORG_THRESHOLD`. The default
+    /// value is 250 blocks.
+    pub reorg_threshold: BlockNumber,
+    /// Set by the environment variable `ETHEREUM_TRACE_STREAM_STEP_SIZE`. The
+    /// default value is 50 blocks.
+    pub trace_stream_step_size: BlockNumber,
+    /// Maximum range size for `eth.getLogs` requests that don't filter on
+    /// contract address, only event signature, and are therefore expensive.
+    ///
+    /// Set by the environment variable `GRAPH_ETHEREUM_MAX_EVENT_ONLY_RANGE`. The
+    /// default value is 500 blocks, which is reasonable according to Ethereum
+    /// node operators.
+    pub max_event_only_range: BlockNumber,
+    /// Set by the environment variable `ETHEREUM_BLOCK_BATCH_SIZE`. The
+    /// default value is 10 blocks.
+    pub block_batch_size: usize,
+    /// Maximum number of blocks to request in each chunk.
+    ///
+    /// Set by the environment variable `GRAPH_ETHEREUM_MAX_BLOCK_RANGE_SIZE`.
+    /// The default value is 2000 blocks.
+    pub max_block_range_size: BlockNumber,
+    /// This should not be too large that it causes requests to timeout without
+    /// us catching it, nor too small that it causes us to timeout requests that
+    /// would've succeeded. We've seen successful `eth_getLogs` requests take
+    /// over 120 seconds.
+    ///
+    /// Set by the environment variable `GRAPH_ETHEREUM_JSON_RPC_TIMEOUT`
+    /// (expressed in seconds). The default value is 180s.
+    pub json_rpc_timeout: Duration,
+    /// This is used for requests that will not fail the subgraph if the limit
+    /// is reached, but will simply restart the syncing step, so it can be low.
+    /// This limit guards against scenarios such as requesting a block hash that
+    /// has been reorged.
+    ///
+    /// Set by the environment variable `GRAPH_ETHEREUM_REQUEST_RETRIES`. The
+    /// default value is 10.
+    pub request_retries: usize,
+    /// Set by the environment variable
+    /// `GRAPH_ETHEREUM_BLOCK_INGESTOR_MAX_CONCURRENT_JSON_RPC_CALLS_FOR_TXN_RECEIPTS`.
+    /// The default value is 1000.
+    pub block_ingestor_max_concurrent_json_rpc_calls: usize,
+    /// Set by the flag `GRAPH_ETHEREUM_FETCH_TXN_RECEIPTS_IN_BATCHES`. Enabled
+    /// by default on macOS (to avoid DNS issues) and disabled by default on all
+    /// other systems.
+    pub fetch_receipts_in_batches: bool,
+    /// `graph_node::config` disallows setting this in a store with multiple
+    /// shards. See 8b6ad0c64e244023ac20ced7897fe666 for the reason.
+    ///
+    /// Set by the flag `GRAPH_ETHEREUM_CLEANUP_BLOCKS`. Off by default.
+    pub cleanup_blocks: bool,
+    /// Ideal number of triggers in a range. The range size will adapt to try to
+    /// meet this.
+    ///
+    /// Set by the environment variable
+    /// `GRAPH_ETHEREUM_TARGET_TRIGGERS_PER_BLOCK_RANGE`. The default value is
+    /// 100.
+    pub target_triggers_per_block_range: u64,
+    /// These are some chains, the genesis block is start from 1 not 0. If this
+    /// flag is not set, the default value will be 0.
+    ///
+    /// Set by the flag `GRAPH_ETHEREUM_GENESIS_BLOCK_NUMBER`. The default value
+    /// is 0.
+    pub genesis_block_number: u64,
+}
+
+// This does not print any values avoid accidentally leaking any sensitive env vars
+impl fmt::Debug for EnvVars {
+    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
+        write!(f, "env vars")
+    }
+}
+
+impl EnvVars {
+    pub fn from_env() -> Result<Self, envconfig::Error> {
+        Ok(Inner::init_from_env()?.into())
+    }
+}
+
+impl From<Inner> for EnvVars {
+    fn from(x: Inner) -> Self {
+        Self {
+            is_firehose_preferred: x.is_firehose_preferred.0,
+            get_logs_max_contracts: x.get_logs_max_contracts,
+            geth_eth_call_errors: x
+                .geth_eth_call_errors
+                .split(';')
+                .filter(|s| !s.is_empty())
+                .map(str::to_string)
+                .collect(),
+            reorg_threshold: x.reorg_threshold,
+            trace_stream_step_size: x.trace_stream_step_size,
+            max_event_only_range: x.max_event_only_range,
+            block_batch_size: x.block_batch_size,
+            max_block_range_size: x.max_block_range_size,
+            json_rpc_timeout: Duration::from_secs(x.json_rpc_timeout_in_secs),
+            request_retries: x.request_retries,
+            block_ingestor_max_concurrent_json_rpc_calls: x
+                .block_ingestor_max_concurrent_json_rpc_calls,
+            fetch_receipts_in_batches: x
+                .fetch_receipts_in_batches
+                .map(|b| b.0)
+                .unwrap_or(cfg!(target_os = "macos")),
+            cleanup_blocks: x.cleanup_blocks.0,
+            target_triggers_per_block_range: x.target_triggers_per_block_range,
+            genesis_block_number: x.genesis_block_number,
+        }
+    }
+}
+
+impl Default for EnvVars {
+    fn default() -> Self {
+        ENV_VARS.clone()
+    }
+}
+
+#[derive(Clone, Debug, Envconfig)]
+struct Inner {
+    #[envconfig(from = "GRAPH_ETHEREUM_IS_FIREHOSE_PREFERRED", default = "true")]
+    is_firehose_preferred: EnvVarBoolean,
+    #[envconfig(from = "GRAPH_GETH_ETH_CALL_ERRORS", default = "")]
+    geth_eth_call_errors: String,
+    #[envconfig(from = "GRAPH_ETH_GET_LOGS_MAX_CONTRACTS", default = "2000")]
+    get_logs_max_contracts: usize,
+
+    // JSON-RPC specific.
+    #[envconfig(from = "ETHEREUM_REORG_THRESHOLD", default = "250")]
+    reorg_threshold: BlockNumber,
+    #[envconfig(from = "ETHEREUM_TRACE_STREAM_STEP_SIZE", default = "50")]
+    trace_stream_step_size: BlockNumber,
+    #[envconfig(from = "GRAPH_ETHEREUM_MAX_EVENT_ONLY_RANGE", default = "500")]
+    max_event_only_range: BlockNumber,
+    #[envconfig(from = "ETHEREUM_BLOCK_BATCH_SIZE", default = "10")]
+    block_batch_size: usize,
+    #[envconfig(from = "GRAPH_ETHEREUM_MAX_BLOCK_RANGE_SIZE", default = "2000")]
+    max_block_range_size: BlockNumber,
+    #[envconfig(from = "GRAPH_ETHEREUM_JSON_RPC_TIMEOUT", default = "180")]
+    json_rpc_timeout_in_secs: u64,
+    #[envconfig(from = "GRAPH_ETHEREUM_REQUEST_RETRIES", default = "10")]
+    request_retries: usize,
+    #[envconfig(
+        from = "GRAPH_ETHEREUM_BLOCK_INGESTOR_MAX_CONCURRENT_JSON_RPC_CALLS_FOR_TXN_RECEIPTS",
+        default = "1000"
+    )]
+    block_ingestor_max_concurrent_json_rpc_calls: usize,
+    #[envconfig(from = "GRAPH_ETHEREUM_FETCH_TXN_RECEIPTS_IN_BATCHES")]
+    fetch_receipts_in_batches: Option<EnvVarBoolean>,
+    #[envconfig(from = "GRAPH_ETHEREUM_CLEANUP_BLOCKS", default = "false")]
+    cleanup_blocks: EnvVarBoolean,
+    #[envconfig(
+        from = "GRAPH_ETHEREUM_TARGET_TRIGGERS_PER_BLOCK_RANGE",
+        default = "100"
+    )]
+    target_triggers_per_block_range: u64,
+    #[envconfig(from = "GRAPH_ETHEREUM_GENESIS_BLOCK_NUMBER", default = "0")]
+    genesis_block_number: u64,
+}
diff --git a/chain/ethereum/src/ethereum_adapter.rs b/chain/ethereum/src/ethereum_adapter.rs
new file mode 100644
index 0000000..e31d2b6
--- /dev/null
+++ b/chain/ethereum/src/ethereum_adapter.rs
@@ -0,0 +1,2162 @@
+use futures::future;
+use futures::prelude::*;
+use futures03::{future::BoxFuture, stream::FuturesUnordered};
+use graph::blockchain::BlockHash;
+use graph::blockchain::ChainIdentifier;
+use graph::components::transaction_receipt::LightTransactionReceipt;
+use graph::data::subgraph::UnifiedMappingApiVersion;
+use graph::data::subgraph::API_VERSION_0_0_5;
+use graph::data::subgraph::API_VERSION_0_0_7;
+use graph::prelude::ethabi::ParamType;
+use graph::prelude::ethabi::Token;
+use graph::prelude::tokio::try_join;
+use graph::{
+    blockchain::{block_stream::BlockWithTriggers, BlockPtr, IngestorError},
+    prelude::{
+        anyhow::{self, anyhow, bail, ensure, Context},
+        async_trait, debug, error, ethabi,
+        futures03::{self, compat::Future01CompatExt, FutureExt, StreamExt, TryStreamExt},
+        hex, info, retry, serde_json as json, stream, tiny_keccak, trace, warn,
+        web3::{
+            self,
+            types::{
+                Address, BlockId, BlockNumber as Web3BlockNumber, Bytes, CallRequest, Filter,
+                FilterBuilder, Log, Transaction, TransactionReceipt, H256,
+            },
+        },
+        BlockNumber, ChainStore, CheapClone, DynTryFuture, Error, EthereumCallCache, Logger,
+        TimeoutError, TryFutureExt,
+    },
+};
+use graph::{
+    components::ethereum::*,
+    prelude::web3::api::Web3,
+    prelude::web3::transports::Batch,
+    prelude::web3::types::{Trace, TraceFilter, TraceFilterBuilder, H160},
+};
+use itertools::Itertools;
+use std::collections::{BTreeMap, BTreeSet, HashMap, HashSet};
+use std::convert::TryFrom;
+use std::iter::FromIterator;
+use std::pin::Pin;
+use std::sync::Arc;
+use std::time::Instant;
+
+use crate::adapter::ProviderStatus;
+use crate::chain::BlockFinality;
+use crate::{
+    adapter::{
+        EthGetLogsFilter, EthereumAdapter as EthereumAdapterTrait, EthereumBlockFilter,
+        EthereumCallFilter, EthereumContractCall, EthereumContractCallError, EthereumLogFilter,
+        ProviderEthRpcMetrics, SubgraphEthRpcMetrics,
+    },
+    transport::Transport,
+    trigger::{EthereumBlockTriggerType, EthereumTrigger},
+    TriggerFilter, ENV_VARS,
+};
+
+#[derive(Clone)]
+pub struct EthereumAdapter {
+    logger: Logger,
+    url_hostname: Arc<String>,
+    /// The label for the provider from the configuration
+    provider: String,
+    web3: Arc<Web3<Transport>>,
+    metrics: Arc<ProviderEthRpcMetrics>,
+    supports_eip_1898: bool,
+}
+
+/// Gas limit for `eth_call`. The value of 50_000_000 is a protocol-wide parameter so this
+/// should be changed only for debugging purposes and never on an indexer in the network. This
+/// value was chosen because it is the Geth default
+/// https://github.com/ethereum/go-ethereum/blob/e4b687cf462870538743b3218906940ae590e7fd/eth/ethconfig/config.go#L91.
+/// It is not safe to set something higher because Geth will silently override the gas limit
+/// with the default. This means that we do not support indexing against a Geth node with
+/// `RPCGasCap` set below 50 million.
+// See also f0af4ab0-6b7c-4b68-9141-5b79346a5f61.
+const ETH_CALL_GAS: u32 = 50_000_000;
+
+impl CheapClone for EthereumAdapter {
+    fn cheap_clone(&self) -> Self {
+        Self {
+            logger: self.logger.clone(),
+            provider: self.provider.clone(),
+            url_hostname: self.url_hostname.cheap_clone(),
+            web3: self.web3.cheap_clone(),
+            metrics: self.metrics.cheap_clone(),
+            supports_eip_1898: self.supports_eip_1898,
+        }
+    }
+}
+
+impl EthereumAdapter {
+    pub async fn new(
+        logger: Logger,
+        provider: String,
+        url: &str,
+        transport: Transport,
+        provider_metrics: Arc<ProviderEthRpcMetrics>,
+        supports_eip_1898: bool,
+    ) -> Self {
+        // Unwrap: The transport was constructed with this url, so it is valid and has a host.
+        let hostname = graph::url::Url::parse(url)
+            .unwrap()
+            .host_str()
+            .unwrap()
+            .to_string();
+
+        let web3 = Arc::new(Web3::new(transport));
+
+        // Use the client version to check if it is ganache. For compatibility with unit tests, be
+        // are lenient with errors, defaulting to false.
+        let is_ganache = web3
+            .web3()
+            .client_version()
+            .await
+            .map(|s| s.contains("TestRPC"))
+            .unwrap_or(false);
+
+        EthereumAdapter {
+            logger,
+            provider,
+            url_hostname: Arc::new(hostname),
+            web3,
+            metrics: provider_metrics,
+            supports_eip_1898: supports_eip_1898 && !is_ganache,
+        }
+    }
+
+    async fn traces(
+        self,
+        logger: Logger,
+        subgraph_metrics: Arc<SubgraphEthRpcMetrics>,
+        from: BlockNumber,
+        to: BlockNumber,
+        addresses: Vec<H160>,
+    ) -> Result<Vec<Trace>, Error> {
+        let eth = self.clone();
+        let retry_log_message =
+            format!("trace_filter RPC call for block range: [{}..{}]", from, to);
+        retry(retry_log_message, &logger)
+            .limit(ENV_VARS.request_retries)
+            .timeout_secs(ENV_VARS.json_rpc_timeout.as_secs())
+            .run(move || {
+                let trace_filter: TraceFilter = match addresses.len() {
+                    0 => TraceFilterBuilder::default()
+                        .from_block(from.into())
+                        .to_block(to.into())
+                        .build(),
+                    _ => TraceFilterBuilder::default()
+                        .from_block(from.into())
+                        .to_block(to.into())
+                        .to_address(addresses.clone())
+                        .build(),
+                };
+
+                let eth = eth.cheap_clone();
+                let logger_for_triggers = logger.clone();
+                let logger_for_error = logger.clone();
+                let start = Instant::now();
+                let subgraph_metrics = subgraph_metrics.clone();
+                let provider_metrics = eth.metrics.clone();
+                let provider = self.provider.clone();
+
+                async move {
+                    let result = eth
+                        .web3
+                        .trace()
+                        .filter(trace_filter)
+                        .await
+                        .map(move |traces| {
+                            if traces.len() > 0 {
+                                if to == from {
+                                    debug!(
+                                        logger_for_triggers,
+                                        "Received {} traces for block {}",
+                                        traces.len(),
+                                        to
+                                    );
+                                } else {
+                                    debug!(
+                                        logger_for_triggers,
+                                        "Received {} traces for blocks [{}, {}]",
+                                        traces.len(),
+                                        from,
+                                        to
+                                    );
+                                }
+                            }
+                            traces
+                        })
+                        .map_err(Error::from);
+
+                    let elapsed = start.elapsed().as_secs_f64();
+                    provider_metrics.observe_request(elapsed, "trace_filter", &provider);
+                    subgraph_metrics.observe_request(elapsed, "trace_filter", &provider);
+                    if let Err(e) = &result {
+                        provider_metrics.add_error("trace_filter", &provider);
+                        subgraph_metrics.add_error("trace_filter", &provider);
+                        debug!(
+                            logger_for_error,
+                            "Error querying traces error = {:#} from = {} to = {}", e, from, to
+                        );
+                    }
+                    result
+                }
+            })
+            .map_err(move |e| {
+                e.into_inner().unwrap_or_else(move || {
+                    anyhow::anyhow!(
+                        "Ethereum node took too long to respond to trace_filter \
+                         (from block {}, to block {})",
+                        from,
+                        to
+                    )
+                })
+            })
+            .await
+    }
+
+    async fn logs_with_sigs(
+        &self,
+        logger: Logger,
+        subgraph_metrics: Arc<SubgraphEthRpcMetrics>,
+        from: BlockNumber,
+        to: BlockNumber,
+        filter: Arc<EthGetLogsFilter>,
+        too_many_logs_fingerprints: &'static [&'static str],
+    ) -> Result<Vec<Log>, TimeoutError<web3::error::Error>> {
+        let eth_adapter = self.clone();
+        let retry_log_message = format!("eth_getLogs RPC call for block range: [{}..{}]", from, to);
+        retry(retry_log_message, &logger)
+            .when(move |res: &Result<_, web3::error::Error>| match res {
+                Ok(_) => false,
+                Err(e) => !too_many_logs_fingerprints
+                    .iter()
+                    .any(|f| e.to_string().contains(f)),
+            })
+            .limit(ENV_VARS.request_retries)
+            .timeout_secs(ENV_VARS.json_rpc_timeout.as_secs())
+            .run(move || {
+                let eth_adapter = eth_adapter.cheap_clone();
+                let subgraph_metrics = subgraph_metrics.clone();
+                let provider_metrics = eth_adapter.metrics.clone();
+                let filter = filter.clone();
+                let provider = eth_adapter.provider.clone();
+
+                async move {
+                    let start = Instant::now();
+
+                    // Create a log filter
+                    let log_filter: Filter = FilterBuilder::default()
+                        .from_block(from.into())
+                        .to_block(to.into())
+                        .address(filter.contracts.clone())
+                        .topics(Some(filter.event_signatures.clone()), None, None, None)
+                        .build();
+
+                    // Request logs from client
+                    let result = eth_adapter.web3.eth().logs(log_filter).boxed().await;
+                    let elapsed = start.elapsed().as_secs_f64();
+                    provider_metrics.observe_request(elapsed, "eth_getLogs", &provider);
+                    subgraph_metrics.observe_request(elapsed, "eth_getLogs", &provider);
+                    if result.is_err() {
+                        provider_metrics.add_error("eth_getLogs", &provider);
+                        subgraph_metrics.add_error("eth_getLogs", &provider);
+                    }
+                    result
+                }
+            })
+            .await
+    }
+
+    fn trace_stream(
+        self,
+        logger: &Logger,
+        subgraph_metrics: Arc<SubgraphEthRpcMetrics>,
+        from: BlockNumber,
+        to: BlockNumber,
+        addresses: Vec<H160>,
+    ) -> impl Stream<Item = Trace, Error = Error> + Send {
+        if from > to {
+            panic!(
+                "Can not produce a call stream on a backwards block range: from = {}, to = {}",
+                from, to,
+            );
+        }
+
+        // Go one block at a time if requesting all traces, to not overload the RPC.
+        let step_size = match addresses.is_empty() {
+            false => ENV_VARS.trace_stream_step_size,
+            true => 1,
+        };
+
+        let eth = self.clone();
+        let logger = logger.to_owned();
+        stream::unfold(from, move |start| {
+            if start > to {
+                return None;
+            }
+            let end = (start + step_size - 1).min(to);
+            let new_start = end + 1;
+            if start == end {
+                debug!(logger, "Requesting traces for block {}", start);
+            } else {
+                debug!(logger, "Requesting traces for blocks [{}, {}]", start, end);
+            }
+            Some(futures::future::ok((
+                eth.clone()
+                    .traces(
+                        logger.cheap_clone(),
+                        subgraph_metrics.clone(),
+                        start,
+                        end,
+                        addresses.clone(),
+                    )
+                    .boxed()
+                    .compat(),
+                new_start,
+            )))
+        })
+        .buffered(ENV_VARS.block_batch_size)
+        .map(stream::iter_ok)
+        .flatten()
+    }
+
+    fn log_stream(
+        &self,
+        logger: Logger,
+        subgraph_metrics: Arc<SubgraphEthRpcMetrics>,
+        from: BlockNumber,
+        to: BlockNumber,
+        filter: EthGetLogsFilter,
+    ) -> DynTryFuture<'static, Vec<Log>, Error> {
+        // Codes returned by Ethereum node providers if an eth_getLogs request is too heavy.
+        // The first one is for Infura when it hits the log limit, the rest for Alchemy timeouts.
+        const TOO_MANY_LOGS_FINGERPRINTS: &[&str] = &[
+            "ServerError(-32005)",
+            "503 Service Unavailable",
+            "ServerError(-32000)",
+        ];
+
+        if from > to {
+            panic!(
+                "cannot produce a log stream on a backwards block range (from={}, to={})",
+                from, to
+            );
+        }
+
+        // Collect all event sigs
+        let eth = self.cheap_clone();
+        let filter = Arc::new(filter);
+
+        let step = match filter.contracts.is_empty() {
+            // `to - from + 1`  blocks will be scanned.
+            false => to - from,
+            true => (to - from).min(ENV_VARS.max_event_only_range - 1),
+        };
+
+        // Typically this will loop only once and fetch the entire range in one request. But if the
+        // node returns an error that signifies the request is to heavy to process, the range will
+        // be broken down to smaller steps.
+        futures03::stream::try_unfold((from, step), move |(start, step)| {
+            let logger = logger.cheap_clone();
+            let filter = filter.cheap_clone();
+            let eth = eth.cheap_clone();
+            let subgraph_metrics = subgraph_metrics.cheap_clone();
+
+            async move {
+                if start > to {
+                    return Ok(None);
+                }
+
+                let end = (start + step).min(to);
+                debug!(
+                    logger,
+                    "Requesting logs for blocks [{}, {}], {}", start, end, filter
+                );
+                let res = eth
+                    .logs_with_sigs(
+                        logger.cheap_clone(),
+                        subgraph_metrics.cheap_clone(),
+                        start,
+                        end,
+                        filter.cheap_clone(),
+                        TOO_MANY_LOGS_FINGERPRINTS,
+                    )
+                    .await;
+
+                match res {
+                    Err(e) => {
+                        let string_err = e.to_string();
+
+                        // If the step is already 0, the request is too heavy even for a single
+                        // block. We hope this never happens, but if it does, make sure to error.
+                        if TOO_MANY_LOGS_FINGERPRINTS
+                            .iter()
+                            .any(|f| string_err.contains(f))
+                            && step > 0
+                        {
+                            // The range size for a request is `step + 1`. So it's ok if the step
+                            // goes down to 0, in that case we'll request one block at a time.
+                            let new_step = step / 10;
+                            debug!(logger, "Reducing block range size to scan for events";
+                                               "new_size" => new_step + 1);
+                            Ok(Some((vec![], (start, new_step))))
+                        } else {
+                            warn!(logger, "Unexpected RPC error"; "error" => &string_err);
+                            Err(anyhow!("{}", string_err))
+                        }
+                    }
+                    Ok(logs) => Ok(Some((logs, (end + 1, step)))),
+                }
+            }
+        })
+        .try_concat()
+        .boxed()
+    }
+
+    fn call(
+        &self,
+        logger: Logger,
+        contract_address: Address,
+        call_data: Bytes,
+        block_ptr: BlockPtr,
+    ) -> impl Future<Item = Bytes, Error = EthereumContractCallError> + Send {
+        let web3 = self.web3.clone();
+
+        // Ganache does not support calls by block hash.
+        // See https://github.com/trufflesuite/ganache-cli/issues/973
+        let block_id = if !self.supports_eip_1898 {
+            BlockId::Number(block_ptr.number.into())
+        } else {
+            BlockId::Hash(block_ptr.hash_as_h256())
+        };
+        let retry_log_message = format!("eth_call RPC call for block {}", block_ptr);
+        retry(retry_log_message, &logger)
+            .when(|result| match result {
+                Ok(_) | Err(EthereumContractCallError::Revert(_)) => false,
+                Err(_) => true,
+            })
+            .limit(ENV_VARS.request_retries)
+            .timeout_secs(ENV_VARS.json_rpc_timeout.as_secs())
+            .run(move || {
+                let call_data = call_data.clone();
+                let web3 = web3.cheap_clone();
+
+                async move {
+                    let req = CallRequest {
+                        to: Some(contract_address),
+                        gas: Some(web3::types::U256::from(ETH_CALL_GAS)),
+                        data: Some(call_data.clone()),
+                        from: None,
+                        gas_price: None,
+                        value: None,
+                        access_list: None,
+                        max_fee_per_gas: None,
+                        max_priority_fee_per_gas: None,
+                        transaction_type: None,
+                    };
+                    let result = web3.eth().call(req, Some(block_id)).boxed().await;
+
+                    // Try to check if the call was reverted. The JSON-RPC response for reverts is
+                    // not standardized, so we have ad-hoc checks for each Ethereum client.
+
+                    // 0xfe is the "designated bad instruction" of the EVM, and Solidity uses it for
+                    // asserts.
+                    const PARITY_BAD_INSTRUCTION_FE: &str = "Bad instruction fe";
+
+                    // 0xfd is REVERT, but on some contracts, and only on older blocks,
+                    // this happens. Makes sense to consider it a revert as well.
+                    const PARITY_BAD_INSTRUCTION_FD: &str = "Bad instruction fd";
+
+                    const PARITY_BAD_JUMP_PREFIX: &str = "Bad jump";
+                    const PARITY_STACK_LIMIT_PREFIX: &str = "Out of stack";
+
+                    // See f0af4ab0-6b7c-4b68-9141-5b79346a5f61.
+                    const PARITY_OUT_OF_GAS: &str = "Out of gas";
+
+                    const PARITY_VM_EXECUTION_ERROR: i64 = -32015;
+                    const PARITY_REVERT_PREFIX: &str = "Reverted 0x";
+                    const XDAI_REVERT: &str = "revert";
+
+                    // Deterministic Geth execution errors. We might need to expand this as
+                    // subgraphs come across other errors. See
+                    // https://github.com/ethereum/go-ethereum/blob/cd57d5cd38ef692de8fbedaa56598b4e9fbfbabc/core/vm/errors.go
+                    const GETH_EXECUTION_ERRORS: &[&str] = &[
+                        // The "revert" substring covers a few known error messages, including:
+                        // Hardhat: "error: transaction reverted",
+                        // Ganache and Moonbeam: "vm exception while processing transaction: revert",
+                        // Geth: "execution reverted"
+                        // And others.
+                        "revert",
+                        "invalid jump destination",
+                        "invalid opcode",
+                        // Ethereum says 1024 is the stack sizes limit, so this is deterministic.
+                        "stack limit reached 1024",
+                        // See f0af4ab0-6b7c-4b68-9141-5b79346a5f61 for why the gas limit is considered deterministic.
+                        "out of gas",
+                    ];
+
+                    let env_geth_call_errors = ENV_VARS.geth_eth_call_errors.iter();
+                    let mut geth_execution_errors = GETH_EXECUTION_ERRORS
+                        .iter()
+                        .map(|s| *s)
+                        .chain(env_geth_call_errors.map(|s| s.as_str()));
+
+                    let as_solidity_revert_with_reason = |bytes: &[u8]| {
+                        let solidity_revert_function_selector =
+                            &tiny_keccak::keccak256(b"Error(string)")[..4];
+
+                        match bytes.len() >= 4 && &bytes[..4] == solidity_revert_function_selector {
+                            false => None,
+                            true => ethabi::decode(&[ParamType::String], &bytes[4..])
+                                .ok()
+                                .and_then(|tokens| tokens[0].clone().into_string()),
+                        }
+                    };
+
+                    match result {
+                        // A successful response.
+                        Ok(bytes) => Ok(bytes),
+
+                        // Check for Geth revert.
+                        Err(web3::Error::Rpc(rpc_error))
+                            if geth_execution_errors
+                                .any(|e| rpc_error.message.to_lowercase().contains(e)) =>
+                        {
+                            Err(EthereumContractCallError::Revert(rpc_error.message))
+                        }
+
+                        // Check for Parity revert.
+                        Err(web3::Error::Rpc(ref rpc_error))
+                            if rpc_error.code.code() == PARITY_VM_EXECUTION_ERROR =>
+                        {
+                            match rpc_error.data.as_ref().and_then(|d| d.as_str()) {
+                                Some(data)
+                                    if data.starts_with(PARITY_REVERT_PREFIX)
+                                        || data.starts_with(PARITY_BAD_JUMP_PREFIX)
+                                        || data.starts_with(PARITY_STACK_LIMIT_PREFIX)
+                                        || data == PARITY_BAD_INSTRUCTION_FE
+                                        || data == PARITY_BAD_INSTRUCTION_FD
+                                        || data == PARITY_OUT_OF_GAS
+                                        || data == XDAI_REVERT =>
+                                {
+                                    let reason = if data == PARITY_BAD_INSTRUCTION_FE {
+                                        PARITY_BAD_INSTRUCTION_FE.to_owned()
+                                    } else {
+                                        let payload = data.trim_start_matches(PARITY_REVERT_PREFIX);
+                                        hex::decode(payload)
+                                            .ok()
+                                            .and_then(|payload| {
+                                                as_solidity_revert_with_reason(&payload)
+                                            })
+                                            .unwrap_or("no reason".to_owned())
+                                    };
+                                    Err(EthereumContractCallError::Revert(reason))
+                                }
+
+                                // The VM execution error was not identified as a revert.
+                                _ => Err(EthereumContractCallError::Web3Error(web3::Error::Rpc(
+                                    rpc_error.clone(),
+                                ))),
+                            }
+                        }
+
+                        // The error was not identified as a revert.
+                        Err(err) => Err(EthereumContractCallError::Web3Error(err)),
+                    }
+                }
+            })
+            .map_err(|e| e.into_inner().unwrap_or(EthereumContractCallError::Timeout))
+            .boxed()
+            .compat()
+    }
+
+    /// Request blocks by hash through JSON-RPC.
+    fn load_blocks_rpc(
+        &self,
+        logger: Logger,
+        ids: Vec<H256>,
+    ) -> impl Stream<Item = Arc<LightEthereumBlock>, Error = Error> + Send {
+        let web3 = self.web3.clone();
+
+        stream::iter_ok::<_, Error>(ids.into_iter().map(move |hash| {
+            let web3 = web3.clone();
+            retry(format!("load block {}", hash), &logger)
+                .limit(ENV_VARS.request_retries)
+                .timeout_secs(ENV_VARS.json_rpc_timeout.as_secs())
+                .run(move || {
+                    Box::pin(web3.eth().block_with_txs(BlockId::Hash(hash)))
+                        .compat()
+                        .from_err::<Error>()
+                        .and_then(move |block| {
+                            block.map(|block| Arc::new(block)).ok_or_else(|| {
+                                anyhow::anyhow!("Ethereum node did not find block {:?}", hash)
+                            })
+                        })
+                        .compat()
+                })
+                .boxed()
+                .compat()
+                .from_err()
+        }))
+        .buffered(ENV_VARS.block_batch_size)
+    }
+
+    /// Request blocks ptrs for numbers through JSON-RPC.
+    ///
+    /// Reorg safety: If ids are numbers, they must be a final blocks.
+    fn load_block_ptrs_rpc(
+        &self,
+        logger: Logger,
+        block_nums: Vec<BlockNumber>,
+    ) -> impl Stream<Item = BlockPtr, Error = Error> + Send {
+        let web3 = self.web3.clone();
+
+        stream::iter_ok::<_, Error>(block_nums.into_iter().map(move |block_num| {
+            let web3 = web3.clone();
+            retry(format!("load block ptr {}", block_num), &logger)
+                .no_limit()
+                .timeout_secs(ENV_VARS.json_rpc_timeout.as_secs())
+                .run(move || {
+                    let web3 = web3.clone();
+                    async move {
+                        let block = web3
+                            .eth()
+                            .block(BlockId::Number(Web3BlockNumber::Number(block_num.into())))
+                            .boxed()
+                            .await?;
+
+                        block.ok_or_else(|| {
+                            anyhow!("Ethereum node did not find block {:?}", block_num)
+                        })
+                    }
+                })
+                .boxed()
+                .compat()
+                .from_err()
+        }))
+        .buffered(ENV_VARS.block_batch_size)
+        .map(|b| b.into())
+    }
+
+    /// Check if `block_ptr` refers to a block that is on the main chain, according to the Ethereum
+    /// node.
+    ///
+    /// Careful: don't use this function without considering race conditions.
+    /// Chain reorgs could happen at any time, and could affect the answer received.
+    /// Generally, it is only safe to use this function with blocks that have received enough
+    /// confirmations to guarantee no further reorgs, **and** where the Ethereum node is aware of
+    /// those confirmations.
+    /// If the Ethereum node is far behind in processing blocks, even old blocks can be subject to
+    /// reorgs.
+    pub(crate) async fn is_on_main_chain(
+        &self,
+        logger: &Logger,
+        block_ptr: BlockPtr,
+    ) -> Result<bool, Error> {
+        let block_hash = self
+            .block_hash_by_block_number(&logger, block_ptr.number)
+            .compat()
+            .await?;
+        block_hash
+            .ok_or_else(|| anyhow!("Ethereum node is missing block #{}", block_ptr.number))
+            .map(|block_hash| block_hash == block_ptr.hash_as_h256())
+    }
+
+    pub(crate) fn logs_in_block_range(
+        &self,
+        logger: &Logger,
+        subgraph_metrics: Arc<SubgraphEthRpcMetrics>,
+        from: BlockNumber,
+        to: BlockNumber,
+        log_filter: EthereumLogFilter,
+    ) -> DynTryFuture<'static, Vec<Log>, Error> {
+        let eth: Self = self.cheap_clone();
+        let logger = logger.clone();
+
+        futures03::stream::iter(log_filter.eth_get_logs_filters().map(move |filter| {
+            eth.cheap_clone().log_stream(
+                logger.cheap_clone(),
+                subgraph_metrics.cheap_clone(),
+                from,
+                to,
+                filter,
+            )
+        }))
+        // Real limits on the number of parallel requests are imposed within the adapter.
+        .buffered(ENV_VARS.block_ingestor_max_concurrent_json_rpc_calls)
+        .try_concat()
+        .boxed()
+    }
+
+    pub(crate) fn calls_in_block_range<'a>(
+        &self,
+        logger: &Logger,
+        subgraph_metrics: Arc<SubgraphEthRpcMetrics>,
+        from: BlockNumber,
+        to: BlockNumber,
+        call_filter: &'a EthereumCallFilter,
+    ) -> Box<dyn Stream<Item = EthereumCall, Error = Error> + Send + 'a> {
+        let eth = self.clone();
+
+        let mut addresses: Vec<H160> = call_filter
+            .contract_addresses_function_signatures
+            .iter()
+            .filter(|(_addr, (start_block, _fsigs))| start_block <= &to)
+            .map(|(addr, (_start_block, _fsigs))| *addr)
+            .collect::<HashSet<H160>>()
+            .into_iter()
+            .collect::<Vec<H160>>();
+
+        if addresses.is_empty() {
+            // The filter has no started data sources in the requested range, nothing to do.
+            // This prevents an expensive call to `trace_filter` with empty `addresses`.
+            return Box::new(stream::empty());
+        }
+
+        if addresses.len() > 100 {
+            // If the address list is large, request all traces, this avoids generating huge
+            // requests and potentially getting 413 errors.
+            addresses = vec![];
+        }
+
+        Box::new(
+            eth.trace_stream(&logger, subgraph_metrics, from, to, addresses)
+                .filter_map(|trace| EthereumCall::try_from_trace(&trace))
+                .filter(move |call| {
+                    // `trace_filter` can only filter by calls `to` an address and
+                    // a block range. Since subgraphs are subscribing to calls
+                    // for a specific contract function an additional filter needs
+                    // to be applied
+                    call_filter.matches(&call)
+                }),
+        )
+    }
+
+    pub(crate) async fn calls_in_block(
+        &self,
+        logger: &Logger,
+        subgraph_metrics: Arc<SubgraphEthRpcMetrics>,
+        block_number: BlockNumber,
+        block_hash: H256,
+    ) -> Result<Vec<EthereumCall>, Error> {
+        let eth = self.clone();
+        let addresses = Vec::new();
+        let traces = eth
+            .trace_stream(
+                &logger,
+                subgraph_metrics.clone(),
+                block_number,
+                block_number,
+                addresses,
+            )
+            .collect()
+            .compat()
+            .await?;
+
+        // `trace_stream` returns all of the traces for the block, and this
+        // includes a trace for the block reward which every block should have.
+        // If there are no traces something has gone wrong.
+        if traces.is_empty() {
+            return Err(anyhow!(
+                "Trace stream returned no traces for block: number = `{}`, hash = `{}`",
+                block_number,
+                block_hash,
+            ));
+        }
+
+        // Since we can only pull traces by block number and we have
+        // all the traces for the block, we need to ensure that the
+        // block hash for the traces is equal to the desired block hash.
+        // Assume all traces are for the same block.
+        if traces.iter().nth(0).unwrap().block_hash != block_hash {
+            return Err(anyhow!(
+                "Trace stream returned traces for an unexpected block: \
+                         number = `{}`, hash = `{}`",
+                block_number,
+                block_hash,
+            ));
+        }
+
+        Ok(traces
+            .iter()
+            .filter_map(EthereumCall::try_from_trace)
+            .collect())
+    }
+
+    /// Reorg safety: `to` must be a final block.
+    pub(crate) fn block_range_to_ptrs(
+        &self,
+        logger: Logger,
+        from: BlockNumber,
+        to: BlockNumber,
+    ) -> Box<dyn Future<Item = Vec<BlockPtr>, Error = Error> + Send> {
+        // Currently we can't go to the DB for this because there might be duplicate entries for
+        // the same block number.
+        debug!(&logger, "Requesting hashes for blocks [{}, {}]", from, to);
+        Box::new(
+            self.load_block_ptrs_rpc(logger, (from..=to).collect())
+                .collect(),
+        )
+    }
+
+    pub async fn chain_id(&self) -> Result<u64, Error> {
+        let logger = self.logger.clone();
+        let web3 = self.web3.clone();
+        u64::try_from(
+            retry("chain_id RPC call", &logger)
+                .no_limit()
+                .timeout_secs(ENV_VARS.json_rpc_timeout.as_secs())
+                .run(move || {
+                    let web3 = web3.cheap_clone();
+                    async move { web3.eth().chain_id().await }
+                })
+                .await?,
+        )
+        .map_err(Error::msg)
+    }
+}
+
+#[async_trait]
+impl EthereumAdapterTrait for EthereumAdapter {
+    fn url_hostname(&self) -> &str {
+        &self.url_hostname
+    }
+
+    fn provider(&self) -> &str {
+        &self.provider
+    }
+
+    async fn net_identifiers(&self) -> Result<ChainIdentifier, Error> {
+        let logger = self.logger.clone();
+
+        let web3 = self.web3.clone();
+        let metrics = self.metrics.clone();
+        let provider = self.provider().to_string();
+        let net_version_future = retry("net_version RPC call", &logger)
+            .no_limit()
+            .timeout_secs(20)
+            .run(move || {
+                let web3 = web3.cheap_clone();
+                let metrics = metrics.cheap_clone();
+                let provider = provider.clone();
+                async move {
+                    web3.net().version().await.map_err(|e| {
+                        metrics.set_status(ProviderStatus::VersionFail, &provider);
+                        e.into()
+                    })
+                }
+            })
+            .map_err(|e| {
+                self.metrics
+                    .set_status(ProviderStatus::VersionTimeout, self.provider());
+                e
+            })
+            .boxed();
+
+        let web3 = self.web3.clone();
+        let metrics = self.metrics.clone();
+        let provider = self.provider().to_string();
+        let retry_log_message = format!(
+            "eth_getBlockByNumber({}, false) RPC call",
+            ENV_VARS.genesis_block_number
+        );
+        let gen_block_hash_future = retry(retry_log_message, &logger)
+            .no_limit()
+            .timeout_secs(30)
+            .run(move || {
+                let web3 = web3.cheap_clone();
+                let metrics = metrics.cheap_clone();
+                let provider = provider.clone();
+                async move {
+                    web3.eth()
+                        .block(BlockId::Number(Web3BlockNumber::Number(
+                            ENV_VARS.genesis_block_number.into(),
+                        )))
+                        .await
+                        .map_err(|e| {
+                            metrics.set_status(ProviderStatus::GenesisFail, &provider);
+                            e
+                        })?
+                        .map(|gen_block| gen_block.hash.map(BlockHash::from))
+                        .flatten()
+                        .ok_or_else(|| anyhow!("Ethereum node could not find genesis block"))
+                }
+            })
+            .map_err(|e| {
+                self.metrics
+                    .set_status(ProviderStatus::GenesisTimeout, self.provider());
+                e
+            });
+
+        let (net_version, genesis_block_hash) =
+            try_join!(net_version_future, gen_block_hash_future).map_err(|e| {
+                anyhow!(
+                    "Ethereum node took too long to read network identifiers: {}",
+                    e
+                )
+            })?;
+
+        let ident = ChainIdentifier {
+            net_version,
+            genesis_block_hash,
+        };
+
+        self.metrics
+            .set_status(ProviderStatus::Working, self.provider());
+        Ok(ident)
+    }
+
+    fn latest_block_header(
+        &self,
+        logger: &Logger,
+    ) -> Box<dyn Future<Item = web3::types::Block<H256>, Error = IngestorError> + Send> {
+        let web3 = self.web3.clone();
+        Box::new(
+            retry("eth_getBlockByNumber(latest) no txs RPC call", logger)
+                .no_limit()
+                .timeout_secs(ENV_VARS.json_rpc_timeout.as_secs())
+                .run(move || {
+                    let web3 = web3.cheap_clone();
+                    async move {
+                        let block_opt = web3
+                            .eth()
+                            .block(Web3BlockNumber::Latest.into())
+                            .await
+                            .map_err(|e| {
+                                anyhow!("could not get latest block from Ethereum: {}", e)
+                            })?;
+
+                        block_opt
+                            .ok_or_else(|| anyhow!("no latest block returned from Ethereum").into())
+                    }
+                })
+                .map_err(move |e| {
+                    e.into_inner().unwrap_or_else(move || {
+                        anyhow!("Ethereum node took too long to return latest block").into()
+                    })
+                })
+                .boxed()
+                .compat(),
+        )
+    }
+
+    fn latest_block(
+        &self,
+        logger: &Logger,
+    ) -> Box<dyn Future<Item = LightEthereumBlock, Error = IngestorError> + Send + Unpin> {
+        let web3 = self.web3.clone();
+        Box::new(
+            retry("eth_getBlockByNumber(latest) with txs RPC call", logger)
+                .no_limit()
+                .timeout_secs(ENV_VARS.json_rpc_timeout.as_secs())
+                .run(move || {
+                    let web3 = web3.cheap_clone();
+                    async move {
+                        let block_opt = web3
+                            .eth()
+                            .block_with_txs(Web3BlockNumber::Latest.into())
+                            .await
+                            .map_err(|e| {
+                                anyhow!("could not get latest block from Ethereum: {}", e)
+                            })?;
+                        block_opt
+                            .ok_or_else(|| anyhow!("no latest block returned from Ethereum").into())
+                    }
+                })
+                .map_err(move |e| {
+                    e.into_inner().unwrap_or_else(move || {
+                        anyhow!("Ethereum node took too long to return latest block").into()
+                    })
+                })
+                .boxed()
+                .compat(),
+        )
+    }
+
+    fn load_block(
+        &self,
+        logger: &Logger,
+        block_hash: H256,
+    ) -> Box<dyn Future<Item = LightEthereumBlock, Error = Error> + Send> {
+        Box::new(
+            self.block_by_hash(&logger, block_hash)
+                .and_then(move |block_opt| {
+                    block_opt.ok_or_else(move || {
+                        anyhow!(
+                            "Ethereum node could not find block with hash {}",
+                            block_hash
+                        )
+                    })
+                }),
+        )
+    }
+
+    fn block_by_hash(
+        &self,
+        logger: &Logger,
+        block_hash: H256,
+    ) -> Box<dyn Future<Item = Option<LightEthereumBlock>, Error = Error> + Send> {
+        let web3 = self.web3.clone();
+        let logger = logger.clone();
+        let retry_log_message = format!(
+            "eth_getBlockByHash RPC call for block hash {:?}",
+            block_hash
+        );
+        Box::new(
+            retry(retry_log_message, &logger)
+                .limit(ENV_VARS.request_retries)
+                .timeout_secs(ENV_VARS.json_rpc_timeout.as_secs())
+                .run(move || {
+                    Box::pin(web3.eth().block_with_txs(BlockId::Hash(block_hash)))
+                        .compat()
+                        .from_err()
+                        .compat()
+                })
+                .map_err(move |e| {
+                    e.into_inner().unwrap_or_else(move || {
+                        anyhow!("Ethereum node took too long to return block {}", block_hash)
+                    })
+                })
+                .boxed()
+                .compat(),
+        )
+    }
+
+    fn block_by_number(
+        &self,
+        logger: &Logger,
+        block_number: BlockNumber,
+    ) -> Box<dyn Future<Item = Option<LightEthereumBlock>, Error = Error> + Send> {
+        let web3 = self.web3.clone();
+        let logger = logger.clone();
+        let retry_log_message = format!(
+            "eth_getBlockByNumber RPC call for block number {}",
+            block_number
+        );
+        Box::new(
+            retry(retry_log_message, &logger)
+                .no_limit()
+                .timeout_secs(ENV_VARS.json_rpc_timeout.as_secs())
+                .run(move || {
+                    let web3 = web3.cheap_clone();
+                    async move {
+                        web3.eth()
+                            .block_with_txs(BlockId::Number(block_number.into()))
+                            .await
+                            .map_err(Error::from)
+                    }
+                })
+                .map_err(move |e| {
+                    e.into_inner().unwrap_or_else(move || {
+                        anyhow!(
+                            "Ethereum node took too long to return block {}",
+                            block_number
+                        )
+                    })
+                })
+                .boxed()
+                .compat(),
+        )
+    }
+
+    fn load_full_block(
+        &self,
+        logger: &Logger,
+        block: LightEthereumBlock,
+    ) -> Pin<Box<dyn std::future::Future<Output = Result<EthereumBlock, IngestorError>> + Send>>
+    {
+        let web3 = Arc::clone(&self.web3);
+        let logger = logger.clone();
+        let block_hash = block.hash.expect("block is missing block hash");
+
+        // The early return is necessary for correctness, otherwise we'll
+        // request an empty batch which is not valid in JSON-RPC.
+        if block.transactions.is_empty() {
+            trace!(logger, "Block {} contains no transactions", block_hash);
+            return Box::pin(std::future::ready(Ok(EthereumBlock {
+                block: Arc::new(block),
+                transaction_receipts: Vec::new(),
+            })));
+        }
+        let hashes: Vec<_> = block.transactions.iter().map(|txn| txn.hash).collect();
+        let receipts_future = if ENV_VARS.fetch_receipts_in_batches {
+            // Deprecated batching retrieval of transaction receipts.
+            fetch_transaction_receipts_in_batch_with_retry(web3, hashes, block_hash, logger).boxed()
+        } else {
+            let hash_stream = graph::tokio_stream::iter(hashes);
+            let receipt_stream = graph::tokio_stream::StreamExt::map(hash_stream, move |tx_hash| {
+                fetch_transaction_receipt_with_retry(
+                    web3.cheap_clone(),
+                    tx_hash,
+                    block_hash,
+                    logger.cheap_clone(),
+                )
+            })
+            .buffered(ENV_VARS.block_ingestor_max_concurrent_json_rpc_calls);
+            graph::tokio_stream::StreamExt::collect::<
+                Result<Vec<Arc<TransactionReceipt>>, IngestorError>,
+            >(receipt_stream)
+            .boxed()
+        };
+
+        let block_future =
+            futures03::TryFutureExt::map_ok(receipts_future, move |transaction_receipts| {
+                EthereumBlock {
+                    block: Arc::new(block),
+                    transaction_receipts,
+                }
+            });
+
+        Box::pin(block_future)
+    }
+
+    fn block_pointer_from_number(
+        &self,
+        logger: &Logger,
+        block_number: BlockNumber,
+    ) -> Box<dyn Future<Item = BlockPtr, Error = IngestorError> + Send> {
+        Box::new(
+            self.block_hash_by_block_number(logger, block_number)
+                .and_then(move |block_hash_opt| {
+                    block_hash_opt.ok_or_else(|| {
+                        anyhow!(
+                            "Ethereum node could not find start block hash by block number {}",
+                            &block_number
+                        )
+                    })
+                })
+                .from_err()
+                .map(move |block_hash| BlockPtr::from((block_hash, block_number))),
+        )
+    }
+
+    fn block_hash_by_block_number(
+        &self,
+        logger: &Logger,
+        block_number: BlockNumber,
+    ) -> Box<dyn Future<Item = Option<H256>, Error = Error> + Send> {
+        let web3 = self.web3.clone();
+        let retry_log_message = format!(
+            "eth_getBlockByNumber RPC call for block number {}",
+            block_number
+        );
+        Box::new(
+            retry(retry_log_message, &logger)
+                .no_limit()
+                .timeout_secs(ENV_VARS.json_rpc_timeout.as_secs())
+                .run(move || {
+                    let web3 = web3.cheap_clone();
+                    async move {
+                        web3.eth()
+                            .block(BlockId::Number(block_number.into()))
+                            .await
+                            .map(|block_opt| block_opt.map(|block| block.hash).flatten())
+                            .map_err(Error::from)
+                    }
+                })
+                .boxed()
+                .compat()
+                .map_err(move |e| {
+                    e.into_inner().unwrap_or_else(move || {
+                        anyhow!(
+                            "Ethereum node took too long to return data for block #{}",
+                            block_number
+                        )
+                    })
+                }),
+        )
+    }
+
+    fn contract_call(
+        &self,
+        logger: &Logger,
+        call: EthereumContractCall,
+        cache: Arc<dyn EthereumCallCache>,
+    ) -> Box<dyn Future<Item = Vec<Token>, Error = EthereumContractCallError> + Send> {
+        // Emit custom error for type mismatches.
+        for (token, kind) in call
+            .args
+            .iter()
+            .zip(call.function.inputs.iter().map(|p| &p.kind))
+        {
+            if !token.type_check(kind) {
+                return Box::new(future::err(EthereumContractCallError::TypeError(
+                    token.clone(),
+                    kind.clone(),
+                )));
+            }
+        }
+
+        // Encode the call parameters according to the ABI
+        let call_data = match call.function.encode_input(&call.args) {
+            Ok(data) => data,
+            Err(e) => return Box::new(future::err(EthereumContractCallError::EncodingError(e))),
+        };
+
+        debug!(logger, "eth_call";
+            "address" => hex::encode(&call.address),
+            "data" => hex::encode(&call_data)
+        );
+
+        // Check if we have it cached, if not do the call and cache.
+        Box::new(
+            match cache
+                .get_call(call.address, &call_data, call.block_ptr.clone())
+                .map_err(|e| error!(logger, "call cache get error"; "error" => e.to_string()))
+                .ok()
+                .flatten()
+            {
+                Some(result) => {
+                    Box::new(future::ok(result)) as Box<dyn Future<Item = _, Error = _> + Send>
+                }
+                None => {
+                    let cache = cache.clone();
+                    let call = call.clone();
+                    let logger = logger.clone();
+                    Box::new(
+                        self.call(
+                            logger.clone(),
+                            call.address,
+                            Bytes(call_data.clone()),
+                            call.block_ptr.clone(),
+                        )
+                        .map(move |result| {
+                            // Don't block handler execution on writing to the cache.
+                            let for_cache = result.0.clone();
+                            let _ = graph::spawn_blocking_allow_panic(move || {
+                                cache
+                                    .set_call(call.address, &call_data, call.block_ptr, &for_cache)
+                                    .map_err(|e| {
+                                        error!(logger, "call cache set error";
+                                                   "error" => e.to_string())
+                                    })
+                            });
+                            result.0
+                        }),
+                    )
+                }
+            }
+            // Decode the return values according to the ABI
+            .and_then(move |output| {
+                if output.is_empty() {
+                    // We got a `0x` response. For old Geth, this can mean a revert. It can also be
+                    // that the contract actually returned an empty response. A view call is meant
+                    // to return something, so we treat empty responses the same as reverts.
+                    Err(EthereumContractCallError::Revert("empty response".into()))
+                } else {
+                    // Decode failures are reverts. The reasoning is that if Solidity fails to
+                    // decode an argument, that's a revert, so the same goes for the output.
+                    call.function.decode_output(&output).map_err(|e| {
+                        EthereumContractCallError::Revert(format!("failed to decode output: {}", e))
+                    })
+                }
+            }),
+        )
+    }
+
+    /// Load Ethereum blocks in bulk, returning results as they come back as a Stream.
+    fn load_blocks(
+        &self,
+        logger: Logger,
+        chain_store: Arc<dyn ChainStore>,
+        block_hashes: HashSet<H256>,
+    ) -> Box<dyn Stream<Item = Arc<LightEthereumBlock>, Error = Error> + Send> {
+        let block_hashes: Vec<_> = block_hashes.iter().cloned().collect();
+        // Search for the block in the store first then use json-rpc as a backup.
+        let mut blocks: Vec<Arc<LightEthereumBlock>> = chain_store
+            .blocks(&block_hashes.iter().map(|&b| b.into()).collect::<Vec<_>>())
+            .map_err(|e| error!(&logger, "Error accessing block cache {}", e))
+            .unwrap_or_default()
+            .into_iter()
+            .filter_map(|value| json::from_value(value).ok())
+            .map(Arc::new)
+            .collect();
+
+        let missing_blocks = Vec::from_iter(
+            block_hashes
+                .into_iter()
+                .filter(|hash| !blocks.iter().any(|b| b.hash == Some(*hash))),
+        );
+
+        // Return a stream that lazily loads batches of blocks.
+        debug!(logger, "Requesting {} block(s)", missing_blocks.len());
+        Box::new(
+            self.load_blocks_rpc(logger.clone(), missing_blocks)
+                .collect()
+                .map(move |new_blocks| {
+                    let upsert_blocks: Vec<_> = new_blocks
+                        .iter()
+                        .map(|block| BlockFinality::Final(block.clone()))
+                        .collect();
+                    let block_refs: Vec<_> = upsert_blocks
+                        .iter()
+                        .map(|block| block as &dyn graph::blockchain::Block)
+                        .collect();
+                    if let Err(e) = chain_store.upsert_light_blocks(block_refs.as_slice()) {
+                        error!(logger, "Error writing to block cache {}", e);
+                    }
+                    blocks.extend(new_blocks);
+                    blocks.sort_by_key(|block| block.number);
+                    stream::iter_ok(blocks)
+                })
+                .flatten_stream(),
+        )
+    }
+}
+
+/// Returns blocks with triggers, corresponding to the specified range and filters.
+/// If a block contains no triggers, there may be no corresponding item in the stream.
+/// However the `to` block will always be present, even if triggers are empty.
+///
+/// Careful: don't use this function without considering race conditions.
+/// Chain reorgs could happen at any time, and could affect the answer received.
+/// Generally, it is only safe to use this function with blocks that have received enough
+/// confirmations to guarantee no further reorgs, **and** where the Ethereum node is aware of
+/// those confirmations.
+/// If the Ethereum node is far behind in processing blocks, even old blocks can be subject to
+/// reorgs.
+/// It is recommended that `to` be far behind the block number of latest block the Ethereum
+/// node is aware of.
+pub(crate) async fn blocks_with_triggers(
+    adapter: Arc<EthereumAdapter>,
+    logger: Logger,
+    chain_store: Arc<dyn ChainStore>,
+    subgraph_metrics: Arc<SubgraphEthRpcMetrics>,
+    from: BlockNumber,
+    to: BlockNumber,
+    filter: &TriggerFilter,
+    unified_api_version: UnifiedMappingApiVersion,
+) -> Result<Vec<BlockWithTriggers<crate::Chain>>, Error> {
+    // Each trigger filter needs to be queried for the same block range
+    // and the blocks yielded need to be deduped. If any error occurs
+    // while searching for a trigger type, the entire operation fails.
+    let eth = adapter.clone();
+    let call_filter = EthereumCallFilter::from(&filter.block);
+
+    // Scan the block range to find relevant triggers
+    let trigger_futs: FuturesUnordered<BoxFuture<Result<Vec<EthereumTrigger>, anyhow::Error>>> =
+        FuturesUnordered::new();
+
+    // Scan for Logs
+    if !filter.log.is_empty() {
+        let logs_future = get_logs_and_transactions(
+            eth.clone(),
+            &logger,
+            subgraph_metrics.clone(),
+            from,
+            to,
+            filter.log.clone(),
+            &unified_api_version,
+        )
+        .boxed();
+        trigger_futs.push(logs_future)
+    }
+    // Scan for Calls
+    if !filter.call.is_empty() {
+        let calls_future = eth
+            .calls_in_block_range(&logger, subgraph_metrics.clone(), from, to, &filter.call)
+            .map(Arc::new)
+            .map(EthereumTrigger::Call)
+            .collect()
+            .compat()
+            .boxed();
+        trigger_futs.push(calls_future)
+    }
+
+    // Scan for Blocks
+    if filter.block.trigger_every_block {
+        let block_future = adapter
+            .block_range_to_ptrs(logger.clone(), from, to)
+            .map(move |ptrs| {
+                ptrs.into_iter()
+                    .map(|ptr| EthereumTrigger::Block(ptr, EthereumBlockTriggerType::Every))
+                    .collect()
+            })
+            .compat()
+            .boxed();
+        trigger_futs.push(block_future)
+    } else if !filter.block.contract_addresses.is_empty() {
+        // To determine which blocks include a call to addresses
+        // in the block filter, transform the `block_filter` into
+        // a `call_filter` and run `blocks_with_calls`
+        let block_future = eth
+            .calls_in_block_range(&logger, subgraph_metrics.clone(), from, to, &call_filter)
+            .map(|call| {
+                EthereumTrigger::Block(
+                    BlockPtr::from(&call),
+                    EthereumBlockTriggerType::WithCallTo(call.to),
+                )
+            })
+            .collect()
+            .compat()
+            .boxed();
+        trigger_futs.push(block_future)
+    }
+
+    // Get hash for "to" block
+    let to_hash_fut = adapter
+        .block_hash_by_block_number(&logger, to)
+        .and_then(|hash| match hash {
+            Some(hash) => Ok(hash),
+            None => {
+                warn!(logger,
+                      "Ethereum endpoint is behind";
+                      "url" => eth.url_hostname()
+                );
+                bail!("Block {} not found in the chain", to)
+            }
+        })
+        .compat();
+
+    // Join on triggers and block hash resolution
+    let (triggers, to_hash) = futures03::join!(trigger_futs.try_concat(), to_hash_fut);
+
+    // Unpack and handle possible errors in the previously joined futures
+    let triggers =
+        triggers.with_context(|| format!("Failed to obtain triggers for block {}", to))?;
+    let to_hash = to_hash.with_context(|| format!("Failed to infer hash for block {}", to))?;
+
+    let mut block_hashes: HashSet<H256> =
+        triggers.iter().map(EthereumTrigger::block_hash).collect();
+    let mut triggers_by_block: HashMap<BlockNumber, Vec<EthereumTrigger>> =
+        triggers.into_iter().fold(HashMap::new(), |mut map, t| {
+            map.entry(t.block_number()).or_default().push(t);
+            map
+        });
+
+    debug!(logger, "Found {} relevant block(s)", block_hashes.len());
+
+    // Make sure `to` is included, even if empty.
+    block_hashes.insert(to_hash);
+    triggers_by_block.entry(to).or_insert(Vec::new());
+
+    let blocks = adapter
+        .load_blocks(logger.cheap_clone(), chain_store.clone(), block_hashes)
+        .and_then(
+            move |block| match triggers_by_block.remove(&(block.number() as BlockNumber)) {
+                Some(triggers) => Ok(BlockWithTriggers::new(
+                    BlockFinality::Final(block),
+                    triggers,
+                )),
+                None => Err(anyhow!(
+                    "block {} not found in `triggers_by_block`",
+                    block.block_ptr()
+                )),
+            },
+        )
+        .collect()
+        .compat()
+        .await?;
+
+    // Filter out call triggers that come from unsuccessful transactions
+    let mut blocks = if unified_api_version.equal_or_greater_than(&API_VERSION_0_0_5) {
+        let futures = blocks.into_iter().map(|block| {
+            filter_call_triggers_from_unsuccessful_transactions(block, &eth, &chain_store, &logger)
+        });
+        futures03::future::try_join_all(futures).await?
+    } else {
+        blocks
+    };
+
+    blocks.sort_by_key(|block| block.ptr().number);
+
+    // Sanity check that the returned blocks are in the correct range.
+    // Unwrap: `blocks` always includes at least `to`.
+    let first = blocks.first().unwrap().ptr().number;
+    let last = blocks.last().unwrap().ptr().number;
+    if first < from {
+        return Err(anyhow!(
+            "block {} returned by the Ethereum node is before {}, the first block of the requested range",
+            first,
+            from,
+        ));
+    }
+    if last > to {
+        return Err(anyhow!(
+            "block {} returned by the Ethereum node is after {}, the last block of the requested range",
+            last,
+            to,
+        ));
+    }
+
+    Ok(blocks)
+}
+
+pub(crate) async fn get_calls(
+    adapter: &EthereumAdapter,
+    logger: Logger,
+    subgraph_metrics: Arc<SubgraphEthRpcMetrics>,
+    requires_traces: bool,
+    block: BlockFinality,
+) -> Result<BlockFinality, Error> {
+    // For final blocks, or nonfinal blocks where we already checked
+    // (`calls.is_some()`), do nothing; if we haven't checked for calls, do
+    // that now
+    match block {
+        BlockFinality::Final(_)
+        | BlockFinality::NonFinal(EthereumBlockWithCalls {
+            ethereum_block: _,
+            calls: Some(_),
+        }) => Ok(block),
+        BlockFinality::NonFinal(EthereumBlockWithCalls {
+            ethereum_block,
+            calls: None,
+        }) => {
+            let calls = if !requires_traces || ethereum_block.transaction_receipts.is_empty() {
+                vec![]
+            } else {
+                adapter
+                    .calls_in_block(
+                        &logger,
+                        subgraph_metrics.clone(),
+                        BlockNumber::try_from(ethereum_block.block.number.unwrap().as_u64())
+                            .unwrap(),
+                        ethereum_block.block.hash.unwrap(),
+                    )
+                    .await?
+            };
+            Ok(BlockFinality::NonFinal(EthereumBlockWithCalls {
+                ethereum_block,
+                calls: Some(calls),
+            }))
+        }
+    }
+}
+
+pub(crate) fn parse_log_triggers(
+    log_filter: &EthereumLogFilter,
+    block: &EthereumBlock,
+) -> Vec<EthereumTrigger> {
+    if log_filter.is_empty() {
+        return vec![];
+    }
+
+    block
+        .transaction_receipts
+        .iter()
+        .flat_map(move |receipt| {
+            receipt
+                .logs
+                .iter()
+                .filter(move |log| log_filter.matches(log))
+                .map(move |log| {
+                    EthereumTrigger::Log(Arc::new(log.clone()), Some(receipt.cheap_clone()))
+                })
+        })
+        .collect()
+}
+
+pub(crate) fn parse_call_triggers(
+    call_filter: &EthereumCallFilter,
+    block: &EthereumBlockWithCalls,
+) -> anyhow::Result<Vec<EthereumTrigger>> {
+    if call_filter.is_empty() {
+        return Ok(vec![]);
+    }
+
+    match &block.calls {
+        Some(calls) => calls
+            .iter()
+            .filter(move |call| call_filter.matches(call))
+            .map(
+                move |call| match block.transaction_for_call_succeeded(call) {
+                    Ok(true) => Ok(Some(EthereumTrigger::Call(Arc::new(call.clone())))),
+                    Ok(false) => Ok(None),
+                    Err(e) => Err(e),
+                },
+            )
+            .filter_map_ok(|some_trigger| some_trigger)
+            .collect(),
+        None => Ok(vec![]),
+    }
+}
+
+pub(crate) fn parse_block_triggers(
+    block_filter: &EthereumBlockFilter,
+    block: &EthereumBlockWithCalls,
+) -> Vec<EthereumTrigger> {
+    if block_filter.is_empty() {
+        return vec![];
+    }
+
+    let block_ptr = BlockPtr::from(&block.ethereum_block);
+    let trigger_every_block = block_filter.trigger_every_block;
+    let call_filter = EthereumCallFilter::from(block_filter);
+    let block_ptr2 = block_ptr.cheap_clone();
+    let mut triggers = match &block.calls {
+        Some(calls) => calls
+            .iter()
+            .filter(move |call| call_filter.matches(call))
+            .map(move |call| {
+                EthereumTrigger::Block(
+                    block_ptr2.clone(),
+                    EthereumBlockTriggerType::WithCallTo(call.to),
+                )
+            })
+            .collect::<Vec<EthereumTrigger>>(),
+        None => vec![],
+    };
+    if trigger_every_block {
+        triggers.push(EthereumTrigger::Block(
+            block_ptr,
+            EthereumBlockTriggerType::Every,
+        ));
+    }
+    triggers
+}
+
+async fn fetch_receipt_from_ethereum_client(
+    eth: &EthereumAdapter,
+    transaction_hash: &H256,
+) -> anyhow::Result<TransactionReceipt> {
+    match eth.web3.eth().transaction_receipt(*transaction_hash).await {
+        Ok(Some(receipt)) => Ok(receipt),
+        Ok(None) => bail!("Could not find transaction receipt"),
+        Err(error) => bail!("Failed to fetch transaction receipt: {}", error),
+    }
+}
+
+async fn filter_call_triggers_from_unsuccessful_transactions(
+    mut block: BlockWithTriggers<crate::Chain>,
+    eth: &EthereumAdapter,
+    chain_store: &Arc<dyn ChainStore>,
+    logger: &Logger,
+) -> anyhow::Result<BlockWithTriggers<crate::Chain>> {
+    // Return early if there is no trigger data
+    if block.trigger_data.is_empty() {
+        return Ok(block);
+    }
+
+    let initial_number_of_triggers = block.trigger_data.len();
+
+    // Get the transaction hash from each call trigger
+    let transaction_hashes: BTreeSet<H256> = block
+        .trigger_data
+        .iter()
+        .filter_map(|trigger| match trigger {
+            EthereumTrigger::Call(call_trigger) => Some(call_trigger.transaction_hash),
+            _ => None,
+        })
+        .collect::<Option<BTreeSet<H256>>>()
+        .ok_or(anyhow!(
+            "failed to obtain transaction hash from call triggers"
+        ))?;
+
+    // Return early if there are no transaction hashes
+    if transaction_hashes.is_empty() {
+        return Ok(block);
+    }
+
+    // And obtain all Transaction values for the calls in this block.
+    let transactions: Vec<&Transaction> = {
+        match &block.block {
+            BlockFinality::Final(ref block) => block
+                .transactions
+                .iter()
+                .filter(|transaction| transaction_hashes.contains(&transaction.hash))
+                .collect(),
+            BlockFinality::NonFinal(_block_with_calls) => {
+                unreachable!(
+                    "this function should not be called when dealing with non-final blocks"
+                )
+            }
+        }
+    };
+
+    // Confidence check: Did we collect all transactions for the current call triggers?
+    if transactions.len() != transaction_hashes.len() {
+        bail!("failed to find transactions in block for the given call triggers")
+    }
+
+    // We'll also need the receipts for those transactions. In this step we collect all receipts
+    // we have in store for the current block.
+    let mut receipts = chain_store
+        .transaction_receipts_in_block(&block.ptr().hash_as_h256())
+        .await?
+        .into_iter()
+        .map(|receipt| (receipt.transaction_hash, receipt))
+        .collect::<BTreeMap<H256, LightTransactionReceipt>>();
+
+    // Do we have a receipt for each transaction under analysis?
+    let mut receipts_and_transactions: Vec<(&Transaction, LightTransactionReceipt)> = Vec::new();
+    let mut transactions_without_receipt: Vec<&Transaction> = Vec::new();
+    for transaction in transactions.iter() {
+        if let Some(receipt) = receipts.remove(&transaction.hash) {
+            receipts_and_transactions.push((transaction, receipt));
+        } else {
+            transactions_without_receipt.push(transaction);
+        }
+    }
+
+    // When some receipts are missing, we then try to fetch them from our client.
+    let futures = transactions_without_receipt
+        .iter()
+        .map(|transaction| async move {
+            fetch_receipt_from_ethereum_client(&eth, &transaction.hash)
+                .await
+                .map(|receipt| (transaction, receipt))
+        });
+    futures03::future::try_join_all(futures)
+        .await?
+        .into_iter()
+        .for_each(|(transaction, receipt)| {
+            receipts_and_transactions.push((transaction, receipt.into()))
+        });
+
+    // TODO: We should persist those fresh transaction receipts into the store, so we don't incur
+    // additional Ethereum API calls for future scans on this block.
+
+    // With all transactions and receipts in hand, we can evaluate the success of each transaction
+    let mut transaction_success: BTreeMap<&H256, bool> = BTreeMap::new();
+    for (transaction, receipt) in receipts_and_transactions.into_iter() {
+        transaction_success.insert(
+            &transaction.hash,
+            evaluate_transaction_status(receipt.status),
+        );
+    }
+
+    // Confidence check: Did we inspect the status of all transactions?
+    if !transaction_hashes
+        .iter()
+        .all(|tx| transaction_success.contains_key(tx))
+    {
+        bail!("Not all transactions status were inspected")
+    }
+
+    // Filter call triggers from unsuccessful transactions
+    block.trigger_data.retain(|trigger| {
+        if let EthereumTrigger::Call(call_trigger) = trigger {
+            // Unwrap: We already checked that those values exist
+            transaction_success[&call_trigger.transaction_hash.unwrap()]
+        } else {
+            // We are not filtering other types of triggers
+            true
+        }
+    });
+
+    // Log if any call trigger was filtered out
+    let final_number_of_triggers = block.trigger_data.len();
+    let number_of_filtered_triggers = initial_number_of_triggers - final_number_of_triggers;
+    if number_of_filtered_triggers != 0 {
+        let noun = {
+            if number_of_filtered_triggers == 1 {
+                "call trigger"
+            } else {
+                "call triggers"
+            }
+        };
+        info!(&logger,
+              "Filtered {} {} from failed transactions", number_of_filtered_triggers, noun ;
+              "block_number" => block.ptr().block_number());
+    }
+    Ok(block)
+}
+
+/// Deprecated. Wraps the [`fetch_transaction_receipts_in_batch`] in a retry loop.
+async fn fetch_transaction_receipts_in_batch_with_retry(
+    web3: Arc<Web3<Transport>>,
+    hashes: Vec<H256>,
+    block_hash: H256,
+    logger: Logger,
+) -> Result<Vec<Arc<TransactionReceipt>>, IngestorError> {
+    let retry_log_message = format!(
+        "batch eth_getTransactionReceipt RPC call for block {:?}",
+        block_hash
+    );
+    retry(retry_log_message, &logger)
+        .limit(ENV_VARS.request_retries)
+        .no_logging()
+        .timeout_secs(ENV_VARS.json_rpc_timeout.as_secs())
+        .run(move || {
+            let web3 = web3.cheap_clone();
+            let hashes = hashes.clone();
+            let logger = logger.cheap_clone();
+            fetch_transaction_receipts_in_batch(web3, hashes, block_hash, logger).boxed()
+        })
+        .await
+        .map_err(|_timeout| anyhow!(block_hash).into())
+}
+
+/// Deprecated. Attempts to fetch multiple transaction receipts in a batching contex.
+async fn fetch_transaction_receipts_in_batch(
+    web3: Arc<Web3<Transport>>,
+    hashes: Vec<H256>,
+    block_hash: H256,
+    logger: Logger,
+) -> Result<Vec<Arc<TransactionReceipt>>, IngestorError> {
+    let batching_web3 = Web3::new(Batch::new(web3.transport().clone()));
+    let eth = batching_web3.eth();
+    let receipt_futures = hashes
+        .into_iter()
+        .map(move |hash| {
+            let logger = logger.cheap_clone();
+            eth.transaction_receipt(hash)
+                .map_err(|web3_error| IngestorError::from(web3_error))
+                .and_then(move |some_receipt| async move {
+                    resolve_transaction_receipt(some_receipt, hash, block_hash, logger)
+                })
+        })
+        .collect::<Vec<_>>();
+
+    batching_web3.transport().submit_batch().await?;
+
+    let mut collected = vec![];
+    for receipt in receipt_futures.into_iter() {
+        collected.push(Arc::new(receipt.await?))
+    }
+    Ok(collected)
+}
+
+/// Retries fetching a single transaction receipt.
+async fn fetch_transaction_receipt_with_retry(
+    web3: Arc<Web3<Transport>>,
+    transaction_hash: H256,
+    block_hash: H256,
+    logger: Logger,
+) -> Result<Arc<TransactionReceipt>, IngestorError> {
+    let logger = logger.cheap_clone();
+    let retry_log_message = format!(
+        "eth_getTransactionReceipt RPC call for transaction {:?}",
+        transaction_hash
+    );
+    retry(retry_log_message, &logger)
+        .limit(ENV_VARS.request_retries)
+        .timeout_secs(ENV_VARS.json_rpc_timeout.as_secs())
+        .run(move || web3.eth().transaction_receipt(transaction_hash).boxed())
+        .await
+        .map_err(|_timeout| anyhow!(block_hash).into())
+        .and_then(move |some_receipt| {
+            resolve_transaction_receipt(some_receipt, transaction_hash, block_hash, logger)
+        })
+        .map(Arc::new)
+}
+
+fn resolve_transaction_receipt(
+    transaction_receipt: Option<TransactionReceipt>,
+    transaction_hash: H256,
+    block_hash: H256,
+    logger: Logger,
+) -> Result<TransactionReceipt, IngestorError> {
+    match transaction_receipt {
+        // A receipt might be missing because the block was uncled, and the transaction never
+        // made it back into the main chain.
+        Some(receipt) => {
+            // Check if the receipt has a block hash and is for the right block. Parity nodes seem
+            // to return receipts with no block hash when a transaction is no longer in the main
+            // chain, so treat that case the same as a receipt being absent entirely.
+            if receipt.block_hash != Some(block_hash) {
+                info!(
+                    logger, "receipt block mismatch";
+                    "receipt_block_hash" =>
+                    receipt.block_hash.unwrap_or_default().to_string(),
+                    "block_hash" =>
+                        block_hash.to_string(),
+                    "tx_hash" => transaction_hash.to_string(),
+                );
+
+                // If the receipt came from a different block, then the Ethereum node no longer
+                // considers this block to be in the main chain. Nothing we can do from here except
+                // give up trying to ingest this block. There is no way to get the transaction
+                // receipt from this block.
+                Err(IngestorError::BlockUnavailable(block_hash.clone()))
+            } else {
+                Ok(receipt)
+            }
+        }
+        None => {
+            // No receipt was returned.
+            //
+            // This can be because the Ethereum node no longer considers this block to be part of
+            // the main chain, and so the transaction is no longer in the main chain. Nothing we can
+            // do from here except give up trying to ingest this block.
+            //
+            // This could also be because the receipt is simply not available yet. For that case, we
+            // should retry until it becomes available.
+            Err(IngestorError::ReceiptUnavailable(
+                block_hash,
+                transaction_hash,
+            ))
+        }
+    }
+}
+
+/// Retrieves logs and the associated transaction receipts, if required by the [`EthereumLogFilter`].
+async fn get_logs_and_transactions(
+    adapter: Arc<EthereumAdapter>,
+    logger: &Logger,
+    subgraph_metrics: Arc<SubgraphEthRpcMetrics>,
+    from: BlockNumber,
+    to: BlockNumber,
+    log_filter: EthereumLogFilter,
+    unified_api_version: &UnifiedMappingApiVersion,
+) -> Result<Vec<EthereumTrigger>, anyhow::Error> {
+    // Obtain logs externally
+    let logs = adapter
+        .logs_in_block_range(
+            logger,
+            subgraph_metrics.cheap_clone(),
+            from,
+            to,
+            log_filter.clone(),
+        )
+        .await?;
+
+    // Not all logs have associated transaction hashes, nor do all triggers require them.
+    // We also restrict receipts retrieval for some api versions.
+    let transaction_hashes_by_block: HashMap<H256, HashSet<H256>> = logs
+        .iter()
+        .filter(|_| unified_api_version.equal_or_greater_than(&API_VERSION_0_0_7))
+        .filter(|log| {
+            if let Some(signature) = log.topics.first() {
+                log_filter.requires_transaction_receipt(signature, Some(&log.address))
+            } else {
+                false
+            }
+        })
+        .filter_map(|log| {
+            if let (Some(block), Some(txn)) = (log.block_hash, log.transaction_hash) {
+                Some((block, txn))
+            } else {
+                // Absent block and transaction data might happen for pending transactions, which we
+                // don't handle.
+                None
+            }
+        })
+        .fold(
+            HashMap::<H256, HashSet<H256>>::new(),
+            |mut acc, (block_hash, txn_hash)| {
+                acc.entry(block_hash).or_default().insert(txn_hash);
+                acc
+            },
+        );
+
+    // Obtain receipts externally
+    let transaction_receipts_by_hash = get_transaction_receipts_for_transaction_hashes(
+        &adapter,
+        &transaction_hashes_by_block,
+        subgraph_metrics,
+        logger.cheap_clone(),
+    )
+    .await?;
+
+    // Associate each log with its receipt, when possible
+    let mut log_triggers = Vec::new();
+    for log in logs.into_iter() {
+        let optional_receipt = log
+            .transaction_hash
+            .and_then(|txn| transaction_receipts_by_hash.get(&txn).cloned());
+        let value = EthereumTrigger::Log(Arc::new(log), optional_receipt);
+        log_triggers.push(value);
+    }
+
+    Ok(log_triggers)
+}
+
+/// Tries to retrive all transaction receipts for a set of transaction hashes.
+async fn get_transaction_receipts_for_transaction_hashes(
+    adapter: &EthereumAdapter,
+    transaction_hashes_by_block: &HashMap<H256, HashSet<H256>>,
+    subgraph_metrics: Arc<SubgraphEthRpcMetrics>,
+    logger: Logger,
+) -> Result<HashMap<H256, Arc<TransactionReceipt>>, anyhow::Error> {
+    use std::collections::hash_map::Entry::Vacant;
+
+    let mut receipts_by_hash: HashMap<H256, Arc<TransactionReceipt>> = HashMap::new();
+
+    // Return early if input set is empty
+    if transaction_hashes_by_block.is_empty() {
+        return Ok(receipts_by_hash);
+    }
+
+    // Keep a record of all unique transaction hashes for which we'll request receipts. We will
+    // later use this to check if we have collected the receipts from all required transactions.
+    let mut unique_transaction_hashes: HashSet<&H256> = HashSet::new();
+
+    // Request transaction receipts concurrently
+    let receipt_futures = FuturesUnordered::new();
+
+    let web3 = Arc::clone(&adapter.web3);
+    for (block_hash, transaction_hashes) in transaction_hashes_by_block {
+        for transaction_hash in transaction_hashes {
+            unique_transaction_hashes.insert(transaction_hash);
+            let receipt_future = fetch_transaction_receipt_with_retry(
+                web3.cheap_clone(),
+                *transaction_hash,
+                *block_hash,
+                logger.cheap_clone(),
+            );
+            receipt_futures.push(receipt_future)
+        }
+    }
+
+    // Execute futures while monitoring elapsed time
+    let start = Instant::now();
+    let receipts: Vec<_> = match receipt_futures.try_collect().await {
+        Ok(receipts) => {
+            let elapsed = start.elapsed().as_secs_f64();
+            subgraph_metrics.observe_request(
+                elapsed,
+                "eth_getTransactionReceipt",
+                &adapter.provider,
+            );
+            receipts
+        }
+        Err(ingestor_error) => {
+            subgraph_metrics.add_error("eth_getTransactionReceipt", &adapter.provider);
+            debug!(
+                logger,
+                "Error querying transaction receipts: {}", ingestor_error
+            );
+            return Err(ingestor_error.into());
+        }
+    };
+
+    // Build a map between transaction hashes and their receipts
+    for receipt in receipts.into_iter() {
+        if !unique_transaction_hashes.remove(&receipt.transaction_hash) {
+            bail!("Received a receipt for a different transaction hash")
+        }
+        if let Vacant(entry) = receipts_by_hash.entry(receipt.transaction_hash.clone()) {
+            entry.insert(receipt);
+        } else {
+            bail!("Received a duplicate transaction receipt")
+        }
+    }
+
+    // Confidence check: all unique hashes should have been used
+    ensure!(
+        unique_transaction_hashes.is_empty(),
+        "Didn't receive all necessary transaction receipts"
+    );
+
+    Ok(receipts_by_hash)
+}
+
+#[cfg(test)]
+mod tests {
+
+    use crate::trigger::{EthereumBlockTriggerType, EthereumTrigger};
+
+    use super::{parse_block_triggers, EthereumBlock, EthereumBlockFilter, EthereumBlockWithCalls};
+    use graph::blockchain::BlockPtr;
+    use graph::prelude::ethabi::ethereum_types::U64;
+    use graph::prelude::web3::types::{Address, Block, Bytes, H256};
+    use graph::prelude::EthereumCall;
+    use std::collections::HashSet;
+    use std::iter::FromIterator;
+    use std::sync::Arc;
+
+    #[test]
+    fn parse_block_triggers_every_block() {
+        let block = EthereumBlockWithCalls {
+            ethereum_block: EthereumBlock {
+                block: Arc::new(Block {
+                    hash: Some(hash(2)),
+                    number: Some(U64::from(2)),
+                    ..Default::default()
+                }),
+                ..Default::default()
+            },
+            calls: Some(vec![EthereumCall {
+                to: address(4),
+                input: bytes(vec![1; 36]),
+                ..Default::default()
+            }]),
+        };
+
+        assert_eq!(
+            vec![EthereumTrigger::Block(
+                BlockPtr::from((hash(2), 2)),
+                EthereumBlockTriggerType::Every
+            )],
+            parse_block_triggers(
+                &EthereumBlockFilter {
+                    contract_addresses: HashSet::from_iter(vec![(10, address(1))]),
+                    trigger_every_block: true,
+                },
+                &block
+            ),
+            "every block should generate a trigger even when address don't match"
+        );
+    }
+
+    #[test]
+    fn parse_block_triggers_specific_call_not_found() {
+        let block = EthereumBlockWithCalls {
+            ethereum_block: EthereumBlock {
+                block: Arc::new(Block {
+                    hash: Some(hash(2)),
+                    number: Some(U64::from(2)),
+                    ..Default::default()
+                }),
+                ..Default::default()
+            },
+            calls: Some(vec![EthereumCall {
+                to: address(4),
+                input: bytes(vec![1; 36]),
+                ..Default::default()
+            }]),
+        };
+
+        assert_eq!(
+            Vec::<EthereumTrigger>::new(),
+            parse_block_triggers(
+                &EthereumBlockFilter {
+                    contract_addresses: HashSet::from_iter(vec![(1, address(1))]),
+                    trigger_every_block: false,
+                },
+                &block
+            ),
+            "block filter specifies address 1 but block does not contain any call to it"
+        );
+    }
+
+    #[test]
+    fn parse_block_triggers_specific_call_found() {
+        let block = EthereumBlockWithCalls {
+            ethereum_block: EthereumBlock {
+                block: Arc::new(Block {
+                    hash: Some(hash(2)),
+                    number: Some(U64::from(2)),
+                    ..Default::default()
+                }),
+                ..Default::default()
+            },
+            calls: Some(vec![EthereumCall {
+                to: address(4),
+                input: bytes(vec![1; 36]),
+                ..Default::default()
+            }]),
+        };
+
+        assert_eq!(
+            vec![EthereumTrigger::Block(
+                BlockPtr::from((hash(2), 2)),
+                EthereumBlockTriggerType::WithCallTo(address(4))
+            )],
+            parse_block_triggers(
+                &EthereumBlockFilter {
+                    contract_addresses: HashSet::from_iter(vec![(1, address(4))]),
+                    trigger_every_block: false,
+                },
+                &block
+            ),
+            "block filter specifies address 4 and block has call to it"
+        );
+    }
+
+    fn address(id: u64) -> Address {
+        Address::from_low_u64_be(id)
+    }
+
+    fn hash(id: u8) -> H256 {
+        H256::from([id; 32])
+    }
+
+    fn bytes(value: Vec<u8>) -> Bytes {
+        Bytes::from(value)
+    }
+}
diff --git a/chain/ethereum/src/ingestor.rs b/chain/ethereum/src/ingestor.rs
new file mode 100644
index 0000000..ac4f906
--- /dev/null
+++ b/chain/ethereum/src/ingestor.rs
@@ -0,0 +1,219 @@
+use crate::{chain::BlockFinality, EthereumAdapter, EthereumAdapterTrait, ENV_VARS};
+use graph::{
+    blockchain::{BlockHash, BlockPtr, IngestorError},
+    cheap_clone::CheapClone,
+    prelude::{
+        error, ethabi::ethereum_types::H256, info, tokio, trace, warn, ChainStore, Error,
+        EthereumBlockWithCalls, Future01CompatExt, LogCode, Logger,
+    },
+};
+use std::{sync::Arc, time::Duration};
+
+pub struct BlockIngestor {
+    logger: Logger,
+    ancestor_count: i32,
+    eth_adapter: Arc<EthereumAdapter>,
+    chain_store: Arc<dyn ChainStore>,
+    polling_interval: Duration,
+}
+
+impl BlockIngestor {
+    pub fn new(
+        logger: Logger,
+        ancestor_count: i32,
+        eth_adapter: Arc<EthereumAdapter>,
+        chain_store: Arc<dyn ChainStore>,
+        polling_interval: Duration,
+    ) -> Result<BlockIngestor, Error> {
+        Ok(BlockIngestor {
+            logger,
+            ancestor_count,
+            eth_adapter,
+            chain_store,
+            polling_interval,
+        })
+    }
+
+    pub async fn into_polling_stream(self) {
+        loop {
+            match self.do_poll().await {
+                // Some polls will fail due to transient issues
+                Err(err @ IngestorError::BlockUnavailable(_)) => {
+                    info!(
+                        self.logger,
+                        "Trying again after block polling failed: {}", err
+                    );
+                }
+                Err(err @ IngestorError::ReceiptUnavailable(_, _)) => {
+                    info!(
+                        self.logger,
+                        "Trying again after block polling failed: {}", err
+                    );
+                }
+                Err(IngestorError::Unknown(inner_err)) => {
+                    warn!(
+                        self.logger,
+                        "Trying again after block polling failed: {}", inner_err
+                    );
+                }
+                Ok(()) => (),
+            }
+
+            if ENV_VARS.cleanup_blocks {
+                self.cleanup_cached_blocks()
+            }
+
+            tokio::time::sleep(self.polling_interval).await;
+        }
+    }
+
+    fn cleanup_cached_blocks(&self) {
+        match self.chain_store.cleanup_cached_blocks(self.ancestor_count) {
+            Ok(Some((min_block, count))) => {
+                if count > 0 {
+                    info!(
+                        self.logger,
+                        "Cleaned {} blocks from the block cache. \
+                                 Only blocks with number greater than {} remain",
+                        count,
+                        min_block
+                    );
+                }
+            }
+            Ok(None) => { /* nothing was cleaned, ignore */ }
+            Err(e) => warn!(
+                self.logger,
+                "Failed to clean blocks from block cache: {}", e
+            ),
+        }
+    }
+
+    async fn do_poll(&self) -> Result<(), IngestorError> {
+        trace!(self.logger, "BlockIngestor::do_poll");
+
+        // Get chain head ptr from store
+        let head_block_ptr_opt = self.chain_store.cheap_clone().chain_head_ptr().await?;
+
+        // To check if there is a new block or not, fetch only the block header since that's cheaper
+        // than the full block. This is worthwhile because most of the time there won't be a new
+        // block, as we expect the poll interval to be much shorter than the block time.
+        let latest_block = self.latest_block().await?;
+
+        // If latest block matches head block in store, nothing needs to be done
+        if Some(&latest_block) == head_block_ptr_opt.as_ref() {
+            return Ok(());
+        }
+
+        // Compare latest block with head ptr, alert user if far behind
+        match head_block_ptr_opt {
+            None => {
+                info!(
+                    self.logger,
+                    "Downloading latest blocks from Ethereum, this may take a few minutes..."
+                );
+            }
+            Some(head_block_ptr) => {
+                let latest_number = latest_block.number;
+                let head_number = head_block_ptr.number;
+                let distance = latest_number - head_number;
+                let blocks_needed = (distance).min(self.ancestor_count);
+                let code = if distance >= 15 {
+                    LogCode::BlockIngestionLagging
+                } else {
+                    LogCode::BlockIngestionStatus
+                };
+                if distance > 0 {
+                    info!(
+                        self.logger,
+                        "Syncing {} blocks from Ethereum",
+                        blocks_needed;
+                        "current_block_head" => head_number,
+                        "latest_block_head" => latest_number,
+                        "blocks_behind" => distance,
+                        "blocks_needed" => blocks_needed,
+                        "code" => code,
+                    );
+                }
+            }
+        }
+
+        // Store latest block in block store.
+        // Might be a no-op if latest block is one that we have seen.
+        // ingest_blocks will return a (potentially incomplete) list of blocks that are
+        // missing.
+        let mut missing_block_hash = self.ingest_block(&latest_block.hash).await?;
+
+        // Repeatedly fetch missing parent blocks, and ingest them.
+        // ingest_blocks will continue to tell us about more missing parent
+        // blocks until we have filled in all missing pieces of the
+        // blockchain in the block number range we care about.
+        //
+        // Loop will terminate because:
+        // - The number of blocks in the ChainStore in the block number
+        //   range [latest - ancestor_count, latest] is finite.
+        // - The missing parents in the first iteration have at most block
+        //   number latest-1.
+        // - Each iteration loads parents of all blocks in the range whose
+        //   parent blocks are not already in the ChainStore, so blocks
+        //   with missing parents in one iteration will not have missing
+        //   parents in the next.
+        // - Therefore, if the missing parents in one iteration have at
+        //   most block number N, then the missing parents in the next
+        //   iteration will have at most block number N-1.
+        // - Therefore, the loop will iterate at most ancestor_count times.
+        while let Some(hash) = missing_block_hash {
+            missing_block_hash = self.ingest_block(&hash).await?;
+        }
+        Ok(())
+    }
+
+    async fn ingest_block(
+        &self,
+        block_hash: &BlockHash,
+    ) -> Result<Option<BlockHash>, IngestorError> {
+        // TODO: H256::from_slice can panic
+        let block_hash = H256::from_slice(block_hash.as_slice());
+
+        // Get the fully populated block
+        let block = self
+            .eth_adapter
+            .block_by_hash(&self.logger, block_hash)
+            .compat()
+            .await?
+            .ok_or_else(|| IngestorError::BlockUnavailable(block_hash))?;
+        let ethereum_block = self
+            .eth_adapter
+            .load_full_block(&self.logger, block)
+            .await?;
+
+        // We need something that implements `Block` to store the block; the
+        // store does not care whether the block is final or not
+        let ethereum_block = BlockFinality::NonFinal(EthereumBlockWithCalls {
+            ethereum_block,
+            calls: None,
+        });
+
+        // Store it in the database and try to advance the chain head pointer
+        self.chain_store
+            .upsert_block(Arc::new(ethereum_block))
+            .await?;
+
+        self.chain_store
+            .cheap_clone()
+            .attempt_chain_head_update(self.ancestor_count)
+            .await
+            .map(|missing| missing.map(|h256| h256.into()))
+            .map_err(|e| {
+                error!(self.logger, "failed to update chain head");
+                IngestorError::Unknown(e)
+            })
+    }
+
+    async fn latest_block(&self) -> Result<BlockPtr, IngestorError> {
+        self.eth_adapter
+            .latest_block_header(&self.logger)
+            .compat()
+            .await
+            .map(|block| block.into())
+    }
+}
diff --git a/chain/ethereum/src/lib.rs b/chain/ethereum/src/lib.rs
new file mode 100644
index 0000000..eeb207b
--- /dev/null
+++ b/chain/ethereum/src/lib.rs
@@ -0,0 +1,34 @@
+mod adapter;
+mod capabilities;
+pub mod codec;
+mod data_source;
+mod env;
+mod ethereum_adapter;
+mod ingestor;
+pub mod runtime;
+mod transport;
+
+pub use self::capabilities::NodeCapabilities;
+pub use self::ethereum_adapter::EthereumAdapter;
+pub use self::runtime::RuntimeAdapter;
+pub use self::transport::Transport;
+pub use env::ENV_VARS;
+
+// ETHDEP: These concrete types should probably not be exposed.
+pub use data_source::{DataSource, DataSourceTemplate, Mapping, MappingABI, TemplateSource};
+
+pub mod chain;
+
+pub mod network;
+pub mod trigger;
+
+pub use crate::adapter::{
+    EthereumAdapter as EthereumAdapterTrait, EthereumContractCall, EthereumContractCallError,
+    ProviderEthRpcMetrics, SubgraphEthRpcMetrics, TriggerFilter,
+};
+pub use crate::chain::Chain;
+pub use crate::network::EthereumNetworks;
+pub use ingestor::BlockIngestor;
+
+#[cfg(test)]
+mod tests;
diff --git a/chain/ethereum/src/network.rs b/chain/ethereum/src/network.rs
new file mode 100644
index 0000000..0981f59
--- /dev/null
+++ b/chain/ethereum/src/network.rs
@@ -0,0 +1,214 @@
+use anyhow::{anyhow, Context};
+use graph::cheap_clone::CheapClone;
+use graph::prelude::rand::{self, seq::IteratorRandom};
+use std::collections::HashMap;
+use std::sync::Arc;
+
+pub use graph::impl_slog_value;
+use graph::prelude::Error;
+
+use crate::adapter::EthereumAdapter as _;
+use crate::capabilities::NodeCapabilities;
+use crate::EthereumAdapter;
+
+#[derive(Clone)]
+pub struct EthereumNetworkAdapter {
+    pub capabilities: NodeCapabilities,
+    adapter: Arc<EthereumAdapter>,
+    /// The maximum number of times this adapter can be used. We use the
+    /// strong_count on `adapter` to determine whether the adapter is above
+    /// that limit. That's a somewhat imprecise but convenient way to
+    /// determine the number of connections
+    limit: usize,
+}
+
+#[derive(Clone)]
+pub struct EthereumNetworkAdapters {
+    pub adapters: Vec<EthereumNetworkAdapter>,
+}
+
+impl EthereumNetworkAdapters {
+    pub fn all_cheapest_with(
+        &self,
+        required_capabilities: &NodeCapabilities,
+    ) -> impl Iterator<Item = Arc<EthereumAdapter>> + '_ {
+        let cheapest_sufficient_capability = self
+            .adapters
+            .iter()
+            .find(|adapter| &adapter.capabilities >= required_capabilities)
+            .map(|adapter| &adapter.capabilities);
+
+        self.adapters
+            .iter()
+            .filter(move |adapter| Some(&adapter.capabilities) == cheapest_sufficient_capability)
+            .filter(|adapter| Arc::strong_count(&adapter.adapter) < adapter.limit)
+            .map(|adapter| adapter.adapter.cheap_clone())
+    }
+
+    pub fn cheapest_with(
+        &self,
+        required_capabilities: &NodeCapabilities,
+    ) -> Result<Arc<EthereumAdapter>, Error> {
+        // Select randomly from the cheapest adapters that have sufficent capabilities.
+        self.all_cheapest_with(required_capabilities)
+            .choose(&mut rand::thread_rng())
+            .with_context(|| {
+                anyhow!(
+                    "A matching Ethereum network with {:?} was not found.",
+                    required_capabilities
+                )
+            })
+    }
+
+    pub fn cheapest(&self) -> Option<Arc<EthereumAdapter>> {
+        // EthereumAdapters are sorted by their NodeCapabilities when the EthereumNetworks
+        // struct is instantiated so they do not need to be sorted here
+        self.adapters
+            .iter()
+            .next()
+            .map(|ethereum_network_adapter| ethereum_network_adapter.adapter.clone())
+    }
+
+    pub fn remove(&mut self, provider: &str) {
+        self.adapters
+            .retain(|adapter| adapter.adapter.provider() != provider);
+    }
+}
+
+#[derive(Clone)]
+pub struct EthereumNetworks {
+    pub networks: HashMap<String, EthereumNetworkAdapters>,
+}
+
+impl EthereumNetworks {
+    pub fn new() -> EthereumNetworks {
+        EthereumNetworks {
+            networks: HashMap::new(),
+        }
+    }
+
+    pub fn insert(
+        &mut self,
+        name: String,
+        capabilities: NodeCapabilities,
+        adapter: Arc<EthereumAdapter>,
+        limit: usize,
+    ) {
+        let network_adapters = self
+            .networks
+            .entry(name)
+            .or_insert(EthereumNetworkAdapters { adapters: vec![] });
+        network_adapters.adapters.push(EthereumNetworkAdapter {
+            capabilities,
+            adapter: adapter.clone(),
+            limit,
+        });
+    }
+
+    pub fn remove(&mut self, name: &str, provider: &str) {
+        if let Some(adapters) = self.networks.get_mut(name) {
+            adapters.remove(provider);
+        }
+    }
+
+    pub fn extend(&mut self, other_networks: EthereumNetworks) {
+        self.networks.extend(other_networks.networks);
+    }
+
+    pub fn flatten(&self) -> Vec<(String, NodeCapabilities, Arc<EthereumAdapter>)> {
+        self.networks
+            .iter()
+            .flat_map(|(network_name, network_adapters)| {
+                network_adapters
+                    .adapters
+                    .iter()
+                    .map(move |network_adapter| {
+                        (
+                            network_name.clone(),
+                            network_adapter.capabilities,
+                            network_adapter.adapter.clone(),
+                        )
+                    })
+            })
+            .collect()
+    }
+
+    pub fn sort(&mut self) {
+        for adapters in self.networks.values_mut() {
+            adapters
+                .adapters
+                .sort_by_key(|adapter| adapter.capabilities)
+        }
+    }
+
+    pub fn adapter_with_capabilities(
+        &self,
+        network_name: String,
+        requirements: &NodeCapabilities,
+    ) -> Result<Arc<EthereumAdapter>, Error> {
+        self.networks
+            .get(&network_name)
+            .ok_or(anyhow!("network not supported: {}", &network_name))
+            .and_then(|adapters| adapters.cheapest_with(requirements))
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    use super::NodeCapabilities;
+
+    #[test]
+    fn ethereum_capabilities_comparison() {
+        let archive = NodeCapabilities {
+            archive: true,
+            traces: false,
+        };
+        let traces = NodeCapabilities {
+            archive: false,
+            traces: true,
+        };
+        let archive_traces = NodeCapabilities {
+            archive: true,
+            traces: true,
+        };
+        let full = NodeCapabilities {
+            archive: false,
+            traces: false,
+        };
+        let full_traces = NodeCapabilities {
+            archive: false,
+            traces: true,
+        };
+
+        // Test all real combinations of capability comparisons
+        assert_eq!(false, &full >= &archive);
+        assert_eq!(false, &full >= &traces);
+        assert_eq!(false, &full >= &archive_traces);
+        assert_eq!(true, &full >= &full);
+        assert_eq!(false, &full >= &full_traces);
+
+        assert_eq!(true, &archive >= &archive);
+        assert_eq!(false, &archive >= &traces);
+        assert_eq!(false, &archive >= &archive_traces);
+        assert_eq!(true, &archive >= &full);
+        assert_eq!(false, &archive >= &full_traces);
+
+        assert_eq!(false, &traces >= &archive);
+        assert_eq!(true, &traces >= &traces);
+        assert_eq!(false, &traces >= &archive_traces);
+        assert_eq!(true, &traces >= &full);
+        assert_eq!(true, &traces >= &full_traces);
+
+        assert_eq!(true, &archive_traces >= &archive);
+        assert_eq!(true, &archive_traces >= &traces);
+        assert_eq!(true, &archive_traces >= &archive_traces);
+        assert_eq!(true, &archive_traces >= &full);
+        assert_eq!(true, &archive_traces >= &full_traces);
+
+        assert_eq!(false, &full_traces >= &archive);
+        assert_eq!(true, &full_traces >= &traces);
+        assert_eq!(false, &full_traces >= &archive_traces);
+        assert_eq!(true, &full_traces >= &full);
+        assert_eq!(true, &full_traces >= &full_traces);
+    }
+}
diff --git a/chain/ethereum/src/protobuf/.gitignore b/chain/ethereum/src/protobuf/.gitignore
new file mode 100644
index 0000000..0a1cbe2
--- /dev/null
+++ b/chain/ethereum/src/protobuf/.gitignore
@@ -0,0 +1,3 @@
+# For an unknown reason, the build script generates this file but it should not.
+# See https://github.com/hyperium/tonic/issues/757
+google.protobuf.rs
\ No newline at end of file
diff --git a/chain/ethereum/src/protobuf/sf.ethereum.r#type.v2.rs b/chain/ethereum/src/protobuf/sf.ethereum.r#type.v2.rs
new file mode 100644
index 0000000..a4daf1e
--- /dev/null
+++ b/chain/ethereum/src/protobuf/sf.ethereum.r#type.v2.rs
@@ -0,0 +1,588 @@
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct Block {
+    #[prost(int32, tag="1")]
+    pub ver: i32,
+    #[prost(bytes="vec", tag="2")]
+    pub hash: ::prost::alloc::vec::Vec<u8>,
+    #[prost(uint64, tag="3")]
+    pub number: u64,
+    #[prost(uint64, tag="4")]
+    pub size: u64,
+    #[prost(message, optional, tag="5")]
+    pub header: ::core::option::Option<BlockHeader>,
+    /// Uncles represents block produced with a valid solution but were not actually choosen
+    /// as the canonical block for the given height so they are mostly "forked" blocks.
+    ///
+    /// If the Block has been produced using the Proof of Stake consensus algorithm, this
+    /// field will actually be always empty.
+    #[prost(message, repeated, tag="6")]
+    pub uncles: ::prost::alloc::vec::Vec<BlockHeader>,
+    #[prost(message, repeated, tag="10")]
+    pub transaction_traces: ::prost::alloc::vec::Vec<TransactionTrace>,
+    #[prost(message, repeated, tag="11")]
+    pub balance_changes: ::prost::alloc::vec::Vec<BalanceChange>,
+    #[prost(message, repeated, tag="20")]
+    pub code_changes: ::prost::alloc::vec::Vec<CodeChange>,
+}
+/// HeaderOnlyBlock is used to optimally unpack the \[Block\] structure (note the
+/// corresponding message number for the `header` field) while consuming less
+/// memory, when only the `header` is desired.
+///
+/// WARN: this is a client-side optimization pattern and should be moved in the
+/// consuming code.
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct HeaderOnlyBlock {
+    #[prost(message, optional, tag="5")]
+    pub header: ::core::option::Option<BlockHeader>,
+}
+/// BlockWithRefs is a lightweight block, with traces and transactions
+/// purged from the `block` within, and only.  It is used in transports
+/// to pass block data around.
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct BlockWithRefs {
+    #[prost(string, tag="1")]
+    pub id: ::prost::alloc::string::String,
+    #[prost(message, optional, tag="2")]
+    pub block: ::core::option::Option<Block>,
+    #[prost(message, optional, tag="3")]
+    pub transaction_trace_refs: ::core::option::Option<TransactionRefs>,
+    #[prost(bool, tag="4")]
+    pub irreversible: bool,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct TransactionRefs {
+    #[prost(bytes="vec", repeated, tag="1")]
+    pub hashes: ::prost::alloc::vec::Vec<::prost::alloc::vec::Vec<u8>>,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct UnclesHeaders {
+    #[prost(message, repeated, tag="1")]
+    pub uncles: ::prost::alloc::vec::Vec<BlockHeader>,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct BlockRef {
+    #[prost(bytes="vec", tag="1")]
+    pub hash: ::prost::alloc::vec::Vec<u8>,
+    #[prost(uint64, tag="2")]
+    pub number: u64,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct BlockHeader {
+    #[prost(bytes="vec", tag="1")]
+    pub parent_hash: ::prost::alloc::vec::Vec<u8>,
+    /// Uncle hash of the block, some reference it as `sha3Uncles`, but `sha3`` is badly worded, so we prefer `uncle_hash`, also
+    /// referred as `ommers` in EIP specification.
+    ///
+    /// If the Block containing this `BlockHeader` has been produced using the Proof of Stake
+    /// consensus algorithm, this field will actually be constant and set to `0x1dcc4de8dec75d7aab85b567b6ccd41ad312451b948a7413f0a142fd40d49347`.
+    #[prost(bytes="vec", tag="2")]
+    pub uncle_hash: ::prost::alloc::vec::Vec<u8>,
+    #[prost(bytes="vec", tag="3")]
+    pub coinbase: ::prost::alloc::vec::Vec<u8>,
+    #[prost(bytes="vec", tag="4")]
+    pub state_root: ::prost::alloc::vec::Vec<u8>,
+    #[prost(bytes="vec", tag="5")]
+    pub transactions_root: ::prost::alloc::vec::Vec<u8>,
+    #[prost(bytes="vec", tag="6")]
+    pub receipt_root: ::prost::alloc::vec::Vec<u8>,
+    #[prost(bytes="vec", tag="7")]
+    pub logs_bloom: ::prost::alloc::vec::Vec<u8>,
+    /// Difficulty is the difficulty of the Proof of Work algorithm that was required to compute a solution.
+    ///
+    /// If the Block containing this `BlockHeader` has been produced using the Proof of Stake
+    /// consensus algorithm, this field will actually be constant and set to `0x00`.
+    #[prost(message, optional, tag="8")]
+    pub difficulty: ::core::option::Option<BigInt>,
+    /// TotalDifficulty is the sum of all previous blocks difficulty including this block difficulty.
+    ///
+    /// If the Block containing this `BlockHeader` has been produced using the Proof of Stake
+    /// consensus algorithm, this field will actually be constant and set to the terminal total difficulty
+    /// that was required to transition to Proof of Stake algorithm, which varies per network. It is set to
+    /// 58 750 000 000 000 000 000 000 on Ethereum Mainnet and to 10 790 000 on Ethereum Testnet Goerli.
+    #[prost(message, optional, tag="17")]
+    pub total_difficulty: ::core::option::Option<BigInt>,
+    #[prost(uint64, tag="9")]
+    pub number: u64,
+    #[prost(uint64, tag="10")]
+    pub gas_limit: u64,
+    #[prost(uint64, tag="11")]
+    pub gas_used: u64,
+    #[prost(message, optional, tag="12")]
+    pub timestamp: ::core::option::Option<::prost_types::Timestamp>,
+    /// ExtraData is free-form bytes included in the block by the "miner". While on Yellow paper of
+    /// Ethereum this value is maxed to 32 bytes, other consensus algorithm like Clique and some other
+    /// forks are using bigger values to carry special consensus data.
+    ///
+    /// If the Block containing this `BlockHeader` has been produced using the Proof of Stake
+    /// consensus algorithm, this field is strictly enforced to be <= 32 bytes.
+    #[prost(bytes="vec", tag="13")]
+    pub extra_data: ::prost::alloc::vec::Vec<u8>,
+    /// MixHash is used to prove, when combined with the `nonce` that sufficient amount of computation has been
+    /// achieved and that the solution found is valid.
+    #[prost(bytes="vec", tag="14")]
+    pub mix_hash: ::prost::alloc::vec::Vec<u8>,
+    /// Nonce is used to prove, when combined with the `mix_hash` that sufficient amount of computation has been
+    /// achieved and that the solution found is valid.
+    ///
+    /// If the Block containing this `BlockHeader` has been produced using the Proof of Stake
+    /// consensus algorithm, this field will actually be constant and set to `0`.
+    #[prost(uint64, tag="15")]
+    pub nonce: u64,
+    /// Hash is the hash of the block which is actually the computation:
+    ///
+    ///  Keccak256(rlp([
+    ///    parent_hash,
+    ///    uncle_hash,
+    ///    coinbase,
+    ///    state_root,
+    ///    transactions_root,
+    ///    receipt_root,
+    ///    logs_bloom,
+    ///    difficulty,
+    ///    number,
+    ///    gas_limit,
+    ///    gas_used,
+    ///    timestamp,
+    ///    extra_data,
+    ///    mix_hash,
+    ///    nonce,
+    ///    base_fee_per_gas
+    ///  ]))
+    ///
+    #[prost(bytes="vec", tag="16")]
+    pub hash: ::prost::alloc::vec::Vec<u8>,
+    /// Base fee per gas according to EIP-1559 (e.g. London Fork) rules, only set if London is present/active on the chain.
+    #[prost(message, optional, tag="18")]
+    pub base_fee_per_gas: ::core::option::Option<BigInt>,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct BigInt {
+    #[prost(bytes="vec", tag="1")]
+    pub bytes: ::prost::alloc::vec::Vec<u8>,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct TransactionTrace {
+    /// consensus
+    #[prost(bytes="vec", tag="1")]
+    pub to: ::prost::alloc::vec::Vec<u8>,
+    #[prost(uint64, tag="2")]
+    pub nonce: u64,
+    /// GasPrice represents the effective price that has been paid for each gas unit of this transaction. Over time, the
+    /// Ethereum rules changes regarding GasPrice field here. Before London fork, the GasPrice was always set to the
+    /// fixed gas price. After London fork, this value has different meaning depending on the transaction type (see `Type` field).
+    ///
+    /// In cases where `TransactionTrace.Type == TRX_TYPE_LEGACY || TRX_TYPE_ACCESS_LIST`, then GasPrice has the same meaning
+    /// as before the London fork.
+    ///
+    /// In cases where `TransactionTrace.Type == TRX_TYPE_DYNAMIC_FEE`, then GasPrice is the effective gas price paid
+    /// for the transaction which is equals to `BlockHeader.BaseFeePerGas + TransactionTrace.`
+    #[prost(message, optional, tag="3")]
+    pub gas_price: ::core::option::Option<BigInt>,
+    /// GasLimit is the maximum of gas unit the sender of the transaction is willing to consume when perform the EVM
+    /// execution of the whole transaction
+    #[prost(uint64, tag="4")]
+    pub gas_limit: u64,
+    /// Value is the amount of Ether transferred as part of this transaction.
+    #[prost(message, optional, tag="5")]
+    pub value: ::core::option::Option<BigInt>,
+    /// Input data the transaction will receive for execution of EVM.
+    #[prost(bytes="vec", tag="6")]
+    pub input: ::prost::alloc::vec::Vec<u8>,
+    /// V is the recovery ID value for the signature Y point.
+    #[prost(bytes="vec", tag="7")]
+    pub v: ::prost::alloc::vec::Vec<u8>,
+    /// R is the signature's X point on the elliptic curve (32 bytes).
+    #[prost(bytes="vec", tag="8")]
+    pub r: ::prost::alloc::vec::Vec<u8>,
+    /// S is the signature's Y point on the elliptic curve (32 bytes).
+    #[prost(bytes="vec", tag="9")]
+    pub s: ::prost::alloc::vec::Vec<u8>,
+    /// GasUsed is the total amount of gas unit used for the whole execution of the transaction.
+    #[prost(uint64, tag="10")]
+    pub gas_used: u64,
+    /// Type represents the Ethereum transaction type, available only since EIP-2718 & EIP-2930 activation which happened on Berlin fork.
+    /// The value is always set even for transaction before Berlin fork because those before the fork are still legacy transactions.
+    #[prost(enumeration="transaction_trace::Type", tag="12")]
+    pub r#type: i32,
+    /// AcccessList represents the storage access this transaction has agreed to do in which case those storage
+    /// access cost less gas unit per access.
+    ///
+    /// This will is populated only if `TransactionTrace.Type == TRX_TYPE_ACCESS_LIST || TRX_TYPE_DYNAMIC_FEE` which
+    /// is possible only if Berlin (TRX_TYPE_ACCESS_LIST) nor London (TRX_TYPE_DYNAMIC_FEE) fork are active on the chain.
+    #[prost(message, repeated, tag="14")]
+    pub access_list: ::prost::alloc::vec::Vec<AccessTuple>,
+    /// MaxFeePerGas is the maximum fee per gas the user is willing to pay for the transaction gas used.
+    ///
+    /// This will is populated only if `TransactionTrace.Type == TRX_TYPE_DYNAMIC_FEE` which is possible only
+    /// if London fork is active on the chain.
+    #[prost(message, optional, tag="11")]
+    pub max_fee_per_gas: ::core::option::Option<BigInt>,
+    /// MaxPriorityFeePerGas is priority fee per gas the user to pay in extra to the miner on top of the block's
+    /// base fee.
+    ///
+    /// This will is populated only if `TransactionTrace.Type == TRX_TYPE_DYNAMIC_FEE` which is possible only
+    /// if London fork is active on the chain.
+    #[prost(message, optional, tag="13")]
+    pub max_priority_fee_per_gas: ::core::option::Option<BigInt>,
+    /// meta
+    #[prost(uint32, tag="20")]
+    pub index: u32,
+    #[prost(bytes="vec", tag="21")]
+    pub hash: ::prost::alloc::vec::Vec<u8>,
+    #[prost(bytes="vec", tag="22")]
+    pub from: ::prost::alloc::vec::Vec<u8>,
+    #[prost(bytes="vec", tag="23")]
+    pub return_data: ::prost::alloc::vec::Vec<u8>,
+    #[prost(bytes="vec", tag="24")]
+    pub public_key: ::prost::alloc::vec::Vec<u8>,
+    #[prost(uint64, tag="25")]
+    pub begin_ordinal: u64,
+    #[prost(uint64, tag="26")]
+    pub end_ordinal: u64,
+    #[prost(enumeration="TransactionTraceStatus", tag="30")]
+    pub status: i32,
+    #[prost(message, optional, tag="31")]
+    pub receipt: ::core::option::Option<TransactionReceipt>,
+    #[prost(message, repeated, tag="32")]
+    pub calls: ::prost::alloc::vec::Vec<Call>,
+}
+/// Nested message and enum types in `TransactionTrace`.
+pub mod transaction_trace {
+    #[derive(Clone, Copy, Debug, PartialEq, Eq, Hash, PartialOrd, Ord, ::prost::Enumeration)]
+    #[repr(i32)]
+    pub enum Type {
+        /// All transactions that ever existed prior Berlin fork before EIP-2718 was implemented.
+        TrxTypeLegacy = 0,
+        /// Field that specifies an access list of contract/storage_keys that is going to be used
+        /// in this transaction.
+        ///
+        /// Added in Berlin fork (EIP-2930).
+        TrxTypeAccessList = 1,
+        /// Transaction that specifies an access list just like TRX_TYPE_ACCESS_LIST but in addition defines the
+        /// max base gas gee and max priority gas fee to pay for this transaction. Transaction's of those type are
+        /// executed against EIP-1559 rules which dictates a dynamic gas cost based on the congestion of the network.
+        TrxTypeDynamicFee = 2,
+    }
+}
+/// AccessTuple represents a list of storage keys for a given contract's address and is used
+/// for AccessList construction.
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct AccessTuple {
+    #[prost(bytes="vec", tag="1")]
+    pub address: ::prost::alloc::vec::Vec<u8>,
+    #[prost(bytes="vec", repeated, tag="2")]
+    pub storage_keys: ::prost::alloc::vec::Vec<::prost::alloc::vec::Vec<u8>>,
+}
+/// TransactionTraceWithBlockRef
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct TransactionTraceWithBlockRef {
+    #[prost(message, optional, tag="1")]
+    pub trace: ::core::option::Option<TransactionTrace>,
+    #[prost(message, optional, tag="2")]
+    pub block_ref: ::core::option::Option<BlockRef>,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct TransactionReceipt {
+    /// State root is an intermediate state_root hash, computed in-between transactions to make
+    /// **sure** you could build a proof and point to state in the middle of a block. Geth client
+    /// uses `PostState + root + PostStateOrStatus`` while Parity used `status_code, root...`` this piles
+    /// hardforks, see (read the EIPs first):
+    /// - <https://github.com/eoscanada/go-ethereum-private/blob/deep-mind/core/types/receipt.go#L147>
+    /// - <https://github.com/eoscanada/go-ethereum-private/blob/deep-mind/core/types/receipt.go#L50-L86>
+    /// - <https://github.com/ethereum/EIPs/blob/master/EIPS/eip-658.md>
+    ///
+    /// Moreover, the notion of `Outcome`` in parity, which segregates the two concepts, which are
+    /// stored in the same field `status_code`` can be computed based on such a hack of the `state_root`
+    /// field, following `EIP-658`.
+    ///
+    /// Before Byzantinium hard fork, this field is always empty.
+    #[prost(bytes="vec", tag="1")]
+    pub state_root: ::prost::alloc::vec::Vec<u8>,
+    #[prost(uint64, tag="2")]
+    pub cumulative_gas_used: u64,
+    #[prost(bytes="vec", tag="3")]
+    pub logs_bloom: ::prost::alloc::vec::Vec<u8>,
+    #[prost(message, repeated, tag="4")]
+    pub logs: ::prost::alloc::vec::Vec<Log>,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct Log {
+    #[prost(bytes="vec", tag="1")]
+    pub address: ::prost::alloc::vec::Vec<u8>,
+    #[prost(bytes="vec", repeated, tag="2")]
+    pub topics: ::prost::alloc::vec::Vec<::prost::alloc::vec::Vec<u8>>,
+    #[prost(bytes="vec", tag="3")]
+    pub data: ::prost::alloc::vec::Vec<u8>,
+    /// Index is the index of the log relative to the transaction. This index
+    /// is always populated regardless of the state revertion of the the call
+    /// that emitted this log.
+    #[prost(uint32, tag="4")]
+    pub index: u32,
+    /// BlockIndex represents the index of the log relative to the Block.
+    ///
+    /// An **important** notice is that this field will be 0 when the call
+    /// that emitted the log has been reverted by the chain.
+    ///
+    /// Currently, there is two locations where a Log can be obtained:
+    /// - block.transaction_traces\[].receipt.logs[\]
+    /// - block.transaction_traces\[].calls[].logs[\]
+    ///
+    /// In the `receipt` case, the logs will be populated only when the call
+    /// that emitted them has not been reverted by the chain and when in this
+    /// position, the `blockIndex` is always populated correctly.
+    ///
+    /// In the case of `calls` case, for `call` where `stateReverted == true`,
+    /// the `blockIndex` value will always be 0.
+    #[prost(uint32, tag="6")]
+    pub block_index: u32,
+    #[prost(uint64, tag="7")]
+    pub ordinal: u64,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct Call {
+    #[prost(uint32, tag="1")]
+    pub index: u32,
+    #[prost(uint32, tag="2")]
+    pub parent_index: u32,
+    #[prost(uint32, tag="3")]
+    pub depth: u32,
+    #[prost(enumeration="CallType", tag="4")]
+    pub call_type: i32,
+    #[prost(bytes="vec", tag="5")]
+    pub caller: ::prost::alloc::vec::Vec<u8>,
+    #[prost(bytes="vec", tag="6")]
+    pub address: ::prost::alloc::vec::Vec<u8>,
+    #[prost(message, optional, tag="7")]
+    pub value: ::core::option::Option<BigInt>,
+    #[prost(uint64, tag="8")]
+    pub gas_limit: u64,
+    #[prost(uint64, tag="9")]
+    pub gas_consumed: u64,
+    #[prost(bytes="vec", tag="13")]
+    pub return_data: ::prost::alloc::vec::Vec<u8>,
+    #[prost(bytes="vec", tag="14")]
+    pub input: ::prost::alloc::vec::Vec<u8>,
+    #[prost(bool, tag="15")]
+    pub executed_code: bool,
+    #[prost(bool, tag="16")]
+    pub suicide: bool,
+    /// hex representation of the hash -> preimage 
+    #[prost(map="string, string", tag="20")]
+    pub keccak_preimages: ::std::collections::HashMap<::prost::alloc::string::String, ::prost::alloc::string::String>,
+    #[prost(message, repeated, tag="21")]
+    pub storage_changes: ::prost::alloc::vec::Vec<StorageChange>,
+    #[prost(message, repeated, tag="22")]
+    pub balance_changes: ::prost::alloc::vec::Vec<BalanceChange>,
+    #[prost(message, repeated, tag="24")]
+    pub nonce_changes: ::prost::alloc::vec::Vec<NonceChange>,
+    #[prost(message, repeated, tag="25")]
+    pub logs: ::prost::alloc::vec::Vec<Log>,
+    #[prost(message, repeated, tag="26")]
+    pub code_changes: ::prost::alloc::vec::Vec<CodeChange>,
+    #[prost(message, repeated, tag="28")]
+    pub gas_changes: ::prost::alloc::vec::Vec<GasChange>,
+    /// In Ethereum, a call can be either:
+    /// - Successfull, execution passes without any problem encountered
+    /// - Failed, execution failed, and remaining gas should be consumed
+    /// - Reverted, execution failed, but only gas consumed so far is billed, remaining gas is refunded
+    ///
+    /// When a call is either `failed` or `reverted`, the `status_failed` field
+    /// below is set to `true`. If the status is `reverted`, then both `status_failed`
+    /// and `status_reverted` are going to be set to `true`.
+    #[prost(bool, tag="10")]
+    pub status_failed: bool,
+    #[prost(bool, tag="12")]
+    pub status_reverted: bool,
+    /// Populated when a call either failed or reverted, so when `status_failed == true`,
+    /// see above for details about those flags.
+    #[prost(string, tag="11")]
+    pub failure_reason: ::prost::alloc::string::String,
+    /// This field represents wheter or not the state changes performed
+    /// by this call were correctly recorded by the blockchain.
+    ///
+    /// On Ethereum, a transaction can record state changes even if some
+    /// of its inner nested calls failed. This is problematic however since
+    /// a call will invalidate all its state changes as well as all state
+    /// changes performed by its child call. This means that even if a call
+    /// has a status of `SUCCESS`, the chain might have reverted all the state
+    /// changes it performed.
+    ///
+    /// ```text
+    ///   Trx 1
+    ///    Call #1 <Failed>
+    ///      Call #2 <Execution Success>
+    ///      Call #3 <Execution Success>
+    ///      |--- Failure here
+    ///    Call #4
+    /// ```
+    ///
+    /// In the transaction above, while Call #2 and Call #3 would have the
+    /// status `EXECUTED`
+    #[prost(bool, tag="30")]
+    pub state_reverted: bool,
+    #[prost(uint64, tag="31")]
+    pub begin_ordinal: u64,
+    #[prost(uint64, tag="32")]
+    pub end_ordinal: u64,
+    #[prost(message, repeated, tag="33")]
+    pub account_creations: ::prost::alloc::vec::Vec<AccountCreation>,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct StorageChange {
+    #[prost(bytes="vec", tag="1")]
+    pub address: ::prost::alloc::vec::Vec<u8>,
+    #[prost(bytes="vec", tag="2")]
+    pub key: ::prost::alloc::vec::Vec<u8>,
+    #[prost(bytes="vec", tag="3")]
+    pub old_value: ::prost::alloc::vec::Vec<u8>,
+    #[prost(bytes="vec", tag="4")]
+    pub new_value: ::prost::alloc::vec::Vec<u8>,
+    #[prost(uint64, tag="5")]
+    pub ordinal: u64,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct BalanceChange {
+    #[prost(bytes="vec", tag="1")]
+    pub address: ::prost::alloc::vec::Vec<u8>,
+    #[prost(message, optional, tag="2")]
+    pub old_value: ::core::option::Option<BigInt>,
+    #[prost(message, optional, tag="3")]
+    pub new_value: ::core::option::Option<BigInt>,
+    #[prost(enumeration="balance_change::Reason", tag="4")]
+    pub reason: i32,
+    #[prost(uint64, tag="5")]
+    pub ordinal: u64,
+}
+/// Nested message and enum types in `BalanceChange`.
+pub mod balance_change {
+    /// Obtain all balanche change reasons under deep mind repository:
+    ///
+    /// ```shell
+    /// ack -ho 'BalanceChangeReason\(".*"\)' | grep -Eo '".*"' | sort | uniq
+    /// ```
+    #[derive(Clone, Copy, Debug, PartialEq, Eq, Hash, PartialOrd, Ord, ::prost::Enumeration)]
+    #[repr(i32)]
+    pub enum Reason {
+        Unknown = 0,
+        RewardMineUncle = 1,
+        RewardMineBlock = 2,
+        DaoRefundContract = 3,
+        DaoAdjustBalance = 4,
+        Transfer = 5,
+        GenesisBalance = 6,
+        GasBuy = 7,
+        RewardTransactionFee = 8,
+        RewardFeeReset = 14,
+        GasRefund = 9,
+        TouchAccount = 10,
+        SuicideRefund = 11,
+        SuicideWithdraw = 13,
+        CallBalanceOverride = 12,
+        /// Used on chain(s) where some Ether burning happens
+        Burn = 15,
+    }
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct NonceChange {
+    #[prost(bytes="vec", tag="1")]
+    pub address: ::prost::alloc::vec::Vec<u8>,
+    #[prost(uint64, tag="2")]
+    pub old_value: u64,
+    #[prost(uint64, tag="3")]
+    pub new_value: u64,
+    #[prost(uint64, tag="4")]
+    pub ordinal: u64,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct AccountCreation {
+    #[prost(bytes="vec", tag="1")]
+    pub account: ::prost::alloc::vec::Vec<u8>,
+    #[prost(uint64, tag="2")]
+    pub ordinal: u64,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct CodeChange {
+    #[prost(bytes="vec", tag="1")]
+    pub address: ::prost::alloc::vec::Vec<u8>,
+    #[prost(bytes="vec", tag="2")]
+    pub old_hash: ::prost::alloc::vec::Vec<u8>,
+    #[prost(bytes="vec", tag="3")]
+    pub old_code: ::prost::alloc::vec::Vec<u8>,
+    #[prost(bytes="vec", tag="4")]
+    pub new_hash: ::prost::alloc::vec::Vec<u8>,
+    #[prost(bytes="vec", tag="5")]
+    pub new_code: ::prost::alloc::vec::Vec<u8>,
+    #[prost(uint64, tag="6")]
+    pub ordinal: u64,
+}
+/// The gas change model represents the reason why some gas cost has occurred.
+/// The gas is computed per actual op codes. Doing them completely might prove
+/// overwhelming in most cases.
+///
+/// Hence, we only index some of them, those that are costy like all the calls
+/// one, log events, return data, etc.
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct GasChange {
+    #[prost(uint64, tag="1")]
+    pub old_value: u64,
+    #[prost(uint64, tag="2")]
+    pub new_value: u64,
+    #[prost(enumeration="gas_change::Reason", tag="3")]
+    pub reason: i32,
+    #[prost(uint64, tag="4")]
+    pub ordinal: u64,
+}
+/// Nested message and enum types in `GasChange`.
+pub mod gas_change {
+    /// Obtain all gas change reasons under deep mind repository:
+    ///
+    /// ```shell
+    /// ack -ho 'GasChangeReason\(".*"\)' | grep -Eo '".*"' | sort | uniq
+    /// ```
+    #[derive(Clone, Copy, Debug, PartialEq, Eq, Hash, PartialOrd, Ord, ::prost::Enumeration)]
+    #[repr(i32)]
+    pub enum Reason {
+        Unknown = 0,
+        Call = 1,
+        CallCode = 2,
+        CallDataCopy = 3,
+        CodeCopy = 4,
+        CodeStorage = 5,
+        ContractCreation = 6,
+        ContractCreation2 = 7,
+        DelegateCall = 8,
+        EventLog = 9,
+        ExtCodeCopy = 10,
+        FailedExecution = 11,
+        IntrinsicGas = 12,
+        PrecompiledContract = 13,
+        RefundAfterExecution = 14,
+        Return = 15,
+        ReturnDataCopy = 16,
+        Revert = 17,
+        SelfDestruct = 18,
+        StaticCall = 19,
+        /// Added in Berlin fork (Geth 1.10+)
+        StateColdAccess = 20,
+    }
+}
+#[derive(Clone, Copy, Debug, PartialEq, Eq, Hash, PartialOrd, Ord, ::prost::Enumeration)]
+#[repr(i32)]
+pub enum TransactionTraceStatus {
+    Unknown = 0,
+    Succeeded = 1,
+    Failed = 2,
+    Reverted = 3,
+}
+#[derive(Clone, Copy, Debug, PartialEq, Eq, Hash, PartialOrd, Ord, ::prost::Enumeration)]
+#[repr(i32)]
+pub enum CallType {
+    Unspecified = 0,
+    /// direct? what's the name for `Call` alone?
+    Call = 1,
+    Callcode = 2,
+    Delegate = 3,
+    Static = 4,
+    /// create2 ? any other form of calls?
+    Create = 5,
+}
diff --git a/chain/ethereum/src/runtime/abi.rs b/chain/ethereum/src/runtime/abi.rs
new file mode 100644
index 0000000..572dfb7
--- /dev/null
+++ b/chain/ethereum/src/runtime/abi.rs
@@ -0,0 +1,783 @@
+use super::runtime_adapter::UnresolvedContractCall;
+use crate::trigger::{
+    EthereumBlockData, EthereumCallData, EthereumEventData, EthereumTransactionData,
+};
+use graph::{
+    prelude::{
+        ethabi,
+        web3::types::{Log, TransactionReceipt, H256},
+        BigInt,
+    },
+    runtime::{
+        asc_get, asc_new, gas::GasCounter, AscHeap, AscIndexId, AscPtr, AscType,
+        DeterministicHostError, FromAscObj, IndexForAscTypeId, ToAscObj,
+    },
+};
+use graph_runtime_derive::AscType;
+use graph_runtime_wasm::asc_abi::class::{
+    Array, AscAddress, AscBigInt, AscEnum, AscH160, AscString, AscWrapped, EthereumValueKind,
+    Uint8Array,
+};
+use semver::Version;
+
+type AscH256 = Uint8Array;
+type AscH2048 = Uint8Array;
+
+pub struct AscLogParamArray(Array<AscPtr<AscLogParam>>);
+
+impl AscType for AscLogParamArray {
+    fn to_asc_bytes(&self) -> Result<Vec<u8>, DeterministicHostError> {
+        self.0.to_asc_bytes()
+    }
+    fn from_asc_bytes(
+        asc_obj: &[u8],
+        api_version: &Version,
+    ) -> Result<Self, DeterministicHostError> {
+        Ok(Self(Array::from_asc_bytes(asc_obj, api_version)?))
+    }
+}
+
+impl ToAscObj<AscLogParamArray> for Vec<ethabi::LogParam> {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscLogParamArray, DeterministicHostError> {
+        let content: Result<Vec<_>, _> = self.iter().map(|x| asc_new(heap, x, gas)).collect();
+        let content = content?;
+        Ok(AscLogParamArray(Array::new(&*content, heap, gas)?))
+    }
+}
+
+impl AscIndexId for AscLogParamArray {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::ArrayEventParam;
+}
+
+pub struct AscTopicArray(Array<AscPtr<AscH256>>);
+
+impl AscType for AscTopicArray {
+    fn to_asc_bytes(&self) -> Result<Vec<u8>, DeterministicHostError> {
+        self.0.to_asc_bytes()
+    }
+
+    fn from_asc_bytes(
+        asc_obj: &[u8],
+        api_version: &Version,
+    ) -> Result<Self, DeterministicHostError> {
+        Ok(Self(Array::from_asc_bytes(asc_obj, api_version)?))
+    }
+}
+
+impl ToAscObj<AscTopicArray> for Vec<H256> {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscTopicArray, DeterministicHostError> {
+        let topics = self
+            .iter()
+            .map(|topic| asc_new(heap, topic, gas))
+            .collect::<Result<Vec<_>, _>>()?;
+        Ok(AscTopicArray(Array::new(&topics, heap, gas)?))
+    }
+}
+
+impl AscIndexId for AscTopicArray {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::ArrayH256;
+}
+
+pub struct AscLogArray(Array<AscPtr<AscEthereumLog>>);
+
+impl AscType for AscLogArray {
+    fn to_asc_bytes(&self) -> Result<Vec<u8>, DeterministicHostError> {
+        self.0.to_asc_bytes()
+    }
+
+    fn from_asc_bytes(
+        asc_obj: &[u8],
+        api_version: &Version,
+    ) -> Result<Self, DeterministicHostError> {
+        Ok(Self(Array::from_asc_bytes(asc_obj, api_version)?))
+    }
+}
+
+impl ToAscObj<AscLogArray> for Vec<Log> {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscLogArray, DeterministicHostError> {
+        let logs = self
+            .iter()
+            .map(|log| asc_new(heap, &log, gas))
+            .collect::<Result<Vec<_>, _>>()?;
+        Ok(AscLogArray(Array::new(&logs, heap, gas)?))
+    }
+}
+
+impl AscIndexId for AscLogArray {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::ArrayLog;
+}
+
+#[repr(C)]
+#[derive(AscType)]
+pub struct AscUnresolvedContractCall_0_0_4 {
+    pub contract_name: AscPtr<AscString>,
+    pub contract_address: AscPtr<AscAddress>,
+    pub function_name: AscPtr<AscString>,
+    pub function_signature: AscPtr<AscString>,
+    pub function_args: AscPtr<Array<AscPtr<AscEnum<EthereumValueKind>>>>,
+}
+
+impl AscIndexId for AscUnresolvedContractCall_0_0_4 {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::SmartContractCall;
+}
+
+impl FromAscObj<AscUnresolvedContractCall_0_0_4> for UnresolvedContractCall {
+    fn from_asc_obj<H: AscHeap + ?Sized>(
+        asc_call: AscUnresolvedContractCall_0_0_4,
+        heap: &H,
+        gas: &GasCounter,
+    ) -> Result<Self, DeterministicHostError> {
+        Ok(UnresolvedContractCall {
+            contract_name: asc_get(heap, asc_call.contract_name, gas)?,
+            contract_address: asc_get(heap, asc_call.contract_address, gas)?,
+            function_name: asc_get(heap, asc_call.function_name, gas)?,
+            function_signature: Some(asc_get(heap, asc_call.function_signature, gas)?),
+            function_args: asc_get(heap, asc_call.function_args, gas)?,
+        })
+    }
+}
+
+#[repr(C)]
+#[derive(AscType)]
+pub struct AscUnresolvedContractCall {
+    pub contract_name: AscPtr<AscString>,
+    pub contract_address: AscPtr<AscAddress>,
+    pub function_name: AscPtr<AscString>,
+    pub function_args: AscPtr<Array<AscPtr<AscEnum<EthereumValueKind>>>>,
+}
+
+impl FromAscObj<AscUnresolvedContractCall> for UnresolvedContractCall {
+    fn from_asc_obj<H: AscHeap + ?Sized>(
+        asc_call: AscUnresolvedContractCall,
+        heap: &H,
+        gas: &GasCounter,
+    ) -> Result<Self, DeterministicHostError> {
+        Ok(UnresolvedContractCall {
+            contract_name: asc_get(heap, asc_call.contract_name, gas)?,
+            contract_address: asc_get(heap, asc_call.contract_address, gas)?,
+            function_name: asc_get(heap, asc_call.function_name, gas)?,
+            function_signature: None,
+            function_args: asc_get(heap, asc_call.function_args, gas)?,
+        })
+    }
+}
+
+#[repr(C)]
+#[derive(AscType)]
+pub(crate) struct AscEthereumBlock {
+    pub hash: AscPtr<AscH256>,
+    pub parent_hash: AscPtr<AscH256>,
+    pub uncles_hash: AscPtr<AscH256>,
+    pub author: AscPtr<AscH160>,
+    pub state_root: AscPtr<AscH256>,
+    pub transactions_root: AscPtr<AscH256>,
+    pub receipts_root: AscPtr<AscH256>,
+    pub number: AscPtr<AscBigInt>,
+    pub gas_used: AscPtr<AscBigInt>,
+    pub gas_limit: AscPtr<AscBigInt>,
+    pub timestamp: AscPtr<AscBigInt>,
+    pub difficulty: AscPtr<AscBigInt>,
+    pub total_difficulty: AscPtr<AscBigInt>,
+    pub size: AscPtr<AscBigInt>,
+}
+
+impl AscIndexId for AscEthereumBlock {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::EthereumBlock;
+}
+
+#[repr(C)]
+#[derive(AscType)]
+pub(crate) struct AscEthereumBlock_0_0_6 {
+    pub hash: AscPtr<AscH256>,
+    pub parent_hash: AscPtr<AscH256>,
+    pub uncles_hash: AscPtr<AscH256>,
+    pub author: AscPtr<AscH160>,
+    pub state_root: AscPtr<AscH256>,
+    pub transactions_root: AscPtr<AscH256>,
+    pub receipts_root: AscPtr<AscH256>,
+    pub number: AscPtr<AscBigInt>,
+    pub gas_used: AscPtr<AscBigInt>,
+    pub gas_limit: AscPtr<AscBigInt>,
+    pub timestamp: AscPtr<AscBigInt>,
+    pub difficulty: AscPtr<AscBigInt>,
+    pub total_difficulty: AscPtr<AscBigInt>,
+    pub size: AscPtr<AscBigInt>,
+    pub base_fee_per_block: AscPtr<AscBigInt>,
+}
+
+impl AscIndexId for AscEthereumBlock_0_0_6 {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::EthereumBlock;
+}
+
+#[repr(C)]
+#[derive(AscType)]
+pub(crate) struct AscEthereumTransaction_0_0_1 {
+    pub hash: AscPtr<AscH256>,
+    pub index: AscPtr<AscBigInt>,
+    pub from: AscPtr<AscH160>,
+    pub to: AscPtr<AscH160>,
+    pub value: AscPtr<AscBigInt>,
+    pub gas_limit: AscPtr<AscBigInt>,
+    pub gas_price: AscPtr<AscBigInt>,
+}
+
+impl AscIndexId for AscEthereumTransaction_0_0_1 {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::EthereumTransaction;
+}
+
+#[repr(C)]
+#[derive(AscType)]
+pub(crate) struct AscEthereumTransaction_0_0_2 {
+    pub hash: AscPtr<AscH256>,
+    pub index: AscPtr<AscBigInt>,
+    pub from: AscPtr<AscH160>,
+    pub to: AscPtr<AscH160>,
+    pub value: AscPtr<AscBigInt>,
+    pub gas_limit: AscPtr<AscBigInt>,
+    pub gas_price: AscPtr<AscBigInt>,
+    pub input: AscPtr<Uint8Array>,
+}
+
+impl AscIndexId for AscEthereumTransaction_0_0_2 {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::EthereumTransaction;
+}
+
+#[repr(C)]
+#[derive(AscType)]
+pub(crate) struct AscEthereumTransaction_0_0_6 {
+    pub hash: AscPtr<AscH256>,
+    pub index: AscPtr<AscBigInt>,
+    pub from: AscPtr<AscH160>,
+    pub to: AscPtr<AscH160>,
+    pub value: AscPtr<AscBigInt>,
+    pub gas_limit: AscPtr<AscBigInt>,
+    pub gas_price: AscPtr<AscBigInt>,
+    pub input: AscPtr<Uint8Array>,
+    pub nonce: AscPtr<AscBigInt>,
+}
+
+impl AscIndexId for AscEthereumTransaction_0_0_6 {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::EthereumTransaction;
+}
+
+#[repr(C)]
+#[derive(AscType)]
+pub(crate) struct AscEthereumEvent<T, B>
+where
+    T: AscType,
+    B: AscType,
+{
+    pub address: AscPtr<AscAddress>,
+    pub log_index: AscPtr<AscBigInt>,
+    pub transaction_log_index: AscPtr<AscBigInt>,
+    pub log_type: AscPtr<AscString>,
+    pub block: AscPtr<B>,
+    pub transaction: AscPtr<T>,
+    pub params: AscPtr<AscLogParamArray>,
+}
+
+impl AscIndexId for AscEthereumEvent<AscEthereumTransaction_0_0_1, AscEthereumBlock> {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::EthereumEvent;
+}
+
+impl AscIndexId for AscEthereumEvent<AscEthereumTransaction_0_0_2, AscEthereumBlock> {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::EthereumEvent;
+}
+
+impl AscIndexId for AscEthereumEvent<AscEthereumTransaction_0_0_6, AscEthereumBlock_0_0_6> {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::EthereumEvent;
+}
+
+#[repr(C)]
+#[derive(AscType)]
+pub(crate) struct AscEthereumLog {
+    pub address: AscPtr<AscAddress>,
+    pub topics: AscPtr<AscTopicArray>,
+    pub data: AscPtr<Uint8Array>,
+    pub block_hash: AscPtr<AscH256>,
+    pub block_number: AscPtr<AscH256>,
+    pub transaction_hash: AscPtr<AscH256>,
+    pub transaction_index: AscPtr<AscBigInt>,
+    pub log_index: AscPtr<AscBigInt>,
+    pub transaction_log_index: AscPtr<AscBigInt>,
+    pub log_type: AscPtr<AscString>,
+    pub removed: AscPtr<AscWrapped<bool>>,
+}
+
+impl AscIndexId for AscEthereumLog {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::Log;
+}
+
+#[repr(C)]
+#[derive(AscType)]
+pub(crate) struct AscEthereumTransactionReceipt {
+    pub transaction_hash: AscPtr<AscH256>,
+    pub transaction_index: AscPtr<AscBigInt>,
+    pub block_hash: AscPtr<AscH256>,
+    pub block_number: AscPtr<AscBigInt>,
+    pub cumulative_gas_used: AscPtr<AscBigInt>,
+    pub gas_used: AscPtr<AscBigInt>,
+    pub contract_address: AscPtr<AscAddress>,
+    pub logs: AscPtr<AscLogArray>,
+    pub status: AscPtr<AscBigInt>,
+    pub root: AscPtr<AscH256>,
+    pub logs_bloom: AscPtr<AscH2048>,
+}
+
+impl AscIndexId for AscEthereumTransactionReceipt {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::TransactionReceipt;
+}
+
+/// Introduced in API Version 0.0.7, this is the same as [`AscEthereumEvent`] with an added
+/// `receipt` field.
+#[repr(C)]
+#[derive(AscType)]
+pub(crate) struct AscEthereumEvent_0_0_7<T, B>
+where
+    T: AscType,
+    B: AscType,
+{
+    pub address: AscPtr<AscAddress>,
+    pub log_index: AscPtr<AscBigInt>,
+    pub transaction_log_index: AscPtr<AscBigInt>,
+    pub log_type: AscPtr<AscString>,
+    pub block: AscPtr<B>,
+    pub transaction: AscPtr<T>,
+    pub params: AscPtr<AscLogParamArray>,
+    pub receipt: AscPtr<AscEthereumTransactionReceipt>,
+}
+
+impl AscIndexId for AscEthereumEvent_0_0_7<AscEthereumTransaction_0_0_6, AscEthereumBlock_0_0_6> {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::EthereumEvent;
+}
+
+#[repr(C)]
+#[derive(AscType)]
+pub(crate) struct AscLogParam {
+    pub name: AscPtr<AscString>,
+    pub value: AscPtr<AscEnum<EthereumValueKind>>,
+}
+
+impl AscIndexId for AscLogParam {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::EventParam;
+}
+
+#[repr(C)]
+#[derive(AscType)]
+pub(crate) struct AscEthereumCall {
+    pub address: AscPtr<AscAddress>,
+    pub block: AscPtr<AscEthereumBlock>,
+    pub transaction: AscPtr<AscEthereumTransaction_0_0_1>,
+    pub inputs: AscPtr<AscLogParamArray>,
+    pub outputs: AscPtr<AscLogParamArray>,
+}
+
+impl AscIndexId for AscEthereumCall {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::EthereumCall;
+}
+
+#[repr(C)]
+#[derive(AscType)]
+pub(crate) struct AscEthereumCall_0_0_3<T, B>
+where
+    T: AscType,
+    B: AscType,
+{
+    pub to: AscPtr<AscAddress>,
+    pub from: AscPtr<AscAddress>,
+    pub block: AscPtr<B>,
+    pub transaction: AscPtr<T>,
+    pub inputs: AscPtr<AscLogParamArray>,
+    pub outputs: AscPtr<AscLogParamArray>,
+}
+
+impl<T, B> AscIndexId for AscEthereumCall_0_0_3<T, B>
+where
+    T: AscType,
+    B: AscType,
+{
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::EthereumCall;
+}
+
+impl ToAscObj<AscEthereumBlock> for EthereumBlockData {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscEthereumBlock, DeterministicHostError> {
+        Ok(AscEthereumBlock {
+            hash: asc_new(heap, &self.hash, gas)?,
+            parent_hash: asc_new(heap, &self.parent_hash, gas)?,
+            uncles_hash: asc_new(heap, &self.uncles_hash, gas)?,
+            author: asc_new(heap, &self.author, gas)?,
+            state_root: asc_new(heap, &self.state_root, gas)?,
+            transactions_root: asc_new(heap, &self.transactions_root, gas)?,
+            receipts_root: asc_new(heap, &self.receipts_root, gas)?,
+            number: asc_new(heap, &BigInt::from(self.number), gas)?,
+            gas_used: asc_new(heap, &BigInt::from_unsigned_u256(&self.gas_used), gas)?,
+            gas_limit: asc_new(heap, &BigInt::from_unsigned_u256(&self.gas_limit), gas)?,
+            timestamp: asc_new(heap, &BigInt::from_unsigned_u256(&self.timestamp), gas)?,
+            difficulty: asc_new(heap, &BigInt::from_unsigned_u256(&self.difficulty), gas)?,
+            total_difficulty: asc_new(
+                heap,
+                &BigInt::from_unsigned_u256(&self.total_difficulty),
+                gas,
+            )?,
+            size: self
+                .size
+                .map(|size| asc_new(heap, &BigInt::from_unsigned_u256(&size), gas))
+                .unwrap_or(Ok(AscPtr::null()))?,
+        })
+    }
+}
+
+impl ToAscObj<AscEthereumBlock_0_0_6> for EthereumBlockData {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscEthereumBlock_0_0_6, DeterministicHostError> {
+        Ok(AscEthereumBlock_0_0_6 {
+            hash: asc_new(heap, &self.hash, gas)?,
+            parent_hash: asc_new(heap, &self.parent_hash, gas)?,
+            uncles_hash: asc_new(heap, &self.uncles_hash, gas)?,
+            author: asc_new(heap, &self.author, gas)?,
+            state_root: asc_new(heap, &self.state_root, gas)?,
+            transactions_root: asc_new(heap, &self.transactions_root, gas)?,
+            receipts_root: asc_new(heap, &self.receipts_root, gas)?,
+            number: asc_new(heap, &BigInt::from(self.number), gas)?,
+            gas_used: asc_new(heap, &BigInt::from_unsigned_u256(&self.gas_used), gas)?,
+            gas_limit: asc_new(heap, &BigInt::from_unsigned_u256(&self.gas_limit), gas)?,
+            timestamp: asc_new(heap, &BigInt::from_unsigned_u256(&self.timestamp), gas)?,
+            difficulty: asc_new(heap, &BigInt::from_unsigned_u256(&self.difficulty), gas)?,
+            total_difficulty: asc_new(
+                heap,
+                &BigInt::from_unsigned_u256(&self.total_difficulty),
+                gas,
+            )?,
+            size: self
+                .size
+                .map(|size| asc_new(heap, &BigInt::from_unsigned_u256(&size), gas))
+                .unwrap_or(Ok(AscPtr::null()))?,
+            base_fee_per_block: self
+                .base_fee_per_gas
+                .map(|base_fee| asc_new(heap, &BigInt::from_unsigned_u256(&base_fee), gas))
+                .unwrap_or(Ok(AscPtr::null()))?,
+        })
+    }
+}
+
+impl ToAscObj<AscEthereumTransaction_0_0_1> for EthereumTransactionData {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscEthereumTransaction_0_0_1, DeterministicHostError> {
+        Ok(AscEthereumTransaction_0_0_1 {
+            hash: asc_new(heap, &self.hash, gas)?,
+            index: asc_new(heap, &BigInt::from(self.index), gas)?,
+            from: asc_new(heap, &self.from, gas)?,
+            to: self
+                .to
+                .map(|to| asc_new(heap, &to, gas))
+                .unwrap_or(Ok(AscPtr::null()))?,
+            value: asc_new(heap, &BigInt::from_unsigned_u256(&self.value), gas)?,
+            gas_limit: asc_new(heap, &BigInt::from_unsigned_u256(&self.gas_limit), gas)?,
+            gas_price: asc_new(heap, &BigInt::from_unsigned_u256(&self.gas_price), gas)?,
+        })
+    }
+}
+
+impl ToAscObj<AscEthereumTransaction_0_0_2> for EthereumTransactionData {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscEthereumTransaction_0_0_2, DeterministicHostError> {
+        Ok(AscEthereumTransaction_0_0_2 {
+            hash: asc_new(heap, &self.hash, gas)?,
+            index: asc_new(heap, &BigInt::from(self.index), gas)?,
+            from: asc_new(heap, &self.from, gas)?,
+            to: self
+                .to
+                .map(|to| asc_new(heap, &to, gas))
+                .unwrap_or(Ok(AscPtr::null()))?,
+            value: asc_new(heap, &BigInt::from_unsigned_u256(&self.value), gas)?,
+            gas_limit: asc_new(heap, &BigInt::from_unsigned_u256(&self.gas_limit), gas)?,
+            gas_price: asc_new(heap, &BigInt::from_unsigned_u256(&self.gas_price), gas)?,
+            input: asc_new(heap, &*self.input, gas)?,
+        })
+    }
+}
+
+impl ToAscObj<AscEthereumTransaction_0_0_6> for EthereumTransactionData {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscEthereumTransaction_0_0_6, DeterministicHostError> {
+        Ok(AscEthereumTransaction_0_0_6 {
+            hash: asc_new(heap, &self.hash, gas)?,
+            index: asc_new(heap, &BigInt::from(self.index), gas)?,
+            from: asc_new(heap, &self.from, gas)?,
+            to: self
+                .to
+                .map(|to| asc_new(heap, &to, gas))
+                .unwrap_or(Ok(AscPtr::null()))?,
+            value: asc_new(heap, &BigInt::from_unsigned_u256(&self.value), gas)?,
+            gas_limit: asc_new(heap, &BigInt::from_unsigned_u256(&self.gas_limit), gas)?,
+            gas_price: asc_new(heap, &BigInt::from_unsigned_u256(&self.gas_price), gas)?,
+            input: asc_new(heap, &*self.input, gas)?,
+            nonce: asc_new(heap, &BigInt::from_unsigned_u256(&self.nonce), gas)?,
+        })
+    }
+}
+
+impl<T, B> ToAscObj<AscEthereumEvent<T, B>> for EthereumEventData
+where
+    T: AscType + AscIndexId,
+    B: AscType + AscIndexId,
+    EthereumTransactionData: ToAscObj<T>,
+    EthereumBlockData: ToAscObj<B>,
+{
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscEthereumEvent<T, B>, DeterministicHostError> {
+        Ok(AscEthereumEvent {
+            address: asc_new(heap, &self.address, gas)?,
+            log_index: asc_new(heap, &BigInt::from_unsigned_u256(&self.log_index), gas)?,
+            transaction_log_index: asc_new(
+                heap,
+                &BigInt::from_unsigned_u256(&self.transaction_log_index),
+                gas,
+            )?,
+            log_type: self
+                .log_type
+                .clone()
+                .map(|log_type| asc_new(heap, &log_type, gas))
+                .unwrap_or(Ok(AscPtr::null()))?,
+            block: asc_new::<B, EthereumBlockData, _>(heap, &self.block, gas)?,
+            transaction: asc_new::<T, EthereumTransactionData, _>(heap, &self.transaction, gas)?,
+            params: asc_new(heap, &self.params, gas)?,
+        })
+    }
+}
+
+impl<T, B> ToAscObj<AscEthereumEvent_0_0_7<T, B>>
+    for (EthereumEventData, Option<&TransactionReceipt>)
+where
+    T: AscType + AscIndexId,
+    B: AscType + AscIndexId,
+    EthereumTransactionData: ToAscObj<T>,
+    EthereumBlockData: ToAscObj<B>,
+{
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscEthereumEvent_0_0_7<T, B>, DeterministicHostError> {
+        let (event_data, optional_receipt) = self;
+        let AscEthereumEvent {
+            address,
+            log_index,
+            transaction_log_index,
+            log_type,
+            block,
+            transaction,
+            params,
+        } = event_data.to_asc_obj(heap, gas)?;
+        let receipt = if let Some(receipt_data) = optional_receipt {
+            asc_new(heap, receipt_data, gas)?
+        } else {
+            AscPtr::null()
+        };
+        Ok(AscEthereumEvent_0_0_7 {
+            address,
+            log_index,
+            transaction_log_index,
+            log_type,
+            block,
+            transaction,
+            params,
+            receipt,
+        })
+    }
+}
+
+impl ToAscObj<AscEthereumLog> for Log {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscEthereumLog, DeterministicHostError> {
+        Ok(AscEthereumLog {
+            address: asc_new(heap, &self.address, gas)?,
+            topics: asc_new(heap, &self.topics, gas)?,
+            data: asc_new(heap, self.data.0.as_slice(), gas)?,
+            block_hash: self
+                .block_hash
+                .map(|block_hash| asc_new(heap, &block_hash, gas))
+                .unwrap_or(Ok(AscPtr::null()))?,
+            block_number: self
+                .block_number
+                .map(|block_number| asc_new(heap, &BigInt::from(block_number), gas))
+                .unwrap_or(Ok(AscPtr::null()))?,
+            transaction_hash: self
+                .transaction_hash
+                .map(|txn_hash| asc_new(heap, &txn_hash, gas))
+                .unwrap_or(Ok(AscPtr::null()))?,
+            transaction_index: self
+                .transaction_index
+                .map(|txn_index| asc_new(heap, &BigInt::from(txn_index), gas))
+                .unwrap_or(Ok(AscPtr::null()))?,
+            log_index: self
+                .log_index
+                .map(|log_index| asc_new(heap, &BigInt::from_unsigned_u256(&log_index), gas))
+                .unwrap_or(Ok(AscPtr::null()))?,
+            transaction_log_index: self
+                .transaction_log_index
+                .map(|index| asc_new(heap, &BigInt::from_unsigned_u256(&index), gas))
+                .unwrap_or(Ok(AscPtr::null()))?,
+            log_type: self
+                .log_type
+                .as_ref()
+                .map(|log_type| asc_new(heap, &log_type, gas))
+                .unwrap_or(Ok(AscPtr::null()))?,
+            removed: self
+                .removed
+                .map(|removed| asc_new(heap, &AscWrapped { inner: removed }, gas))
+                .unwrap_or(Ok(AscPtr::null()))?,
+        })
+    }
+}
+
+impl ToAscObj<AscEthereumTransactionReceipt> for &TransactionReceipt {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscEthereumTransactionReceipt, DeterministicHostError> {
+        Ok(AscEthereumTransactionReceipt {
+            transaction_hash: asc_new(heap, &self.transaction_hash, gas)?,
+            transaction_index: asc_new(heap, &BigInt::from(self.transaction_index), gas)?,
+            block_hash: self
+                .block_hash
+                .map(|block_hash| asc_new(heap, &block_hash, gas))
+                .unwrap_or(Ok(AscPtr::null()))?,
+            block_number: self
+                .block_number
+                .map(|block_number| asc_new(heap, &BigInt::from(block_number), gas))
+                .unwrap_or(Ok(AscPtr::null()))?,
+            cumulative_gas_used: asc_new(
+                heap,
+                &BigInt::from_unsigned_u256(&self.cumulative_gas_used),
+                gas,
+            )?,
+            gas_used: self
+                .gas_used
+                .map(|gas_used| asc_new(heap, &BigInt::from_unsigned_u256(&gas_used), gas))
+                .unwrap_or(Ok(AscPtr::null()))?,
+            contract_address: self
+                .contract_address
+                .map(|contract_address| asc_new(heap, &contract_address, gas))
+                .unwrap_or(Ok(AscPtr::null()))?,
+            logs: asc_new(heap, &self.logs, gas)?,
+            status: self
+                .status
+                .map(|status| asc_new(heap, &BigInt::from(status), gas))
+                .unwrap_or(Ok(AscPtr::null()))?,
+            root: self
+                .root
+                .map(|root| asc_new(heap, &root, gas))
+                .unwrap_or(Ok(AscPtr::null()))?,
+            logs_bloom: asc_new(heap, self.logs_bloom.as_bytes(), gas)?,
+        })
+    }
+}
+
+impl ToAscObj<AscEthereumCall> for EthereumCallData {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscEthereumCall, DeterministicHostError> {
+        Ok(AscEthereumCall {
+            address: asc_new(heap, &self.to, gas)?,
+            block: asc_new(heap, &self.block, gas)?,
+            transaction: asc_new(heap, &self.transaction, gas)?,
+            inputs: asc_new(heap, &self.inputs, gas)?,
+            outputs: asc_new(heap, &self.outputs, gas)?,
+        })
+    }
+}
+
+impl ToAscObj<AscEthereumCall_0_0_3<AscEthereumTransaction_0_0_2, AscEthereumBlock>>
+    for EthereumCallData
+{
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<
+        AscEthereumCall_0_0_3<AscEthereumTransaction_0_0_2, AscEthereumBlock>,
+        DeterministicHostError,
+    > {
+        Ok(AscEthereumCall_0_0_3 {
+            to: asc_new(heap, &self.to, gas)?,
+            from: asc_new(heap, &self.from, gas)?,
+            block: asc_new(heap, &self.block, gas)?,
+            transaction: asc_new(heap, &self.transaction, gas)?,
+            inputs: asc_new(heap, &self.inputs, gas)?,
+            outputs: asc_new(heap, &self.outputs, gas)?,
+        })
+    }
+}
+
+impl ToAscObj<AscEthereumCall_0_0_3<AscEthereumTransaction_0_0_6, AscEthereumBlock_0_0_6>>
+    for EthereumCallData
+{
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<
+        AscEthereumCall_0_0_3<AscEthereumTransaction_0_0_6, AscEthereumBlock_0_0_6>,
+        DeterministicHostError,
+    > {
+        Ok(AscEthereumCall_0_0_3 {
+            to: asc_new(heap, &self.to, gas)?,
+            from: asc_new(heap, &self.from, gas)?,
+            block: asc_new(heap, &self.block, gas)?,
+            transaction: asc_new(heap, &self.transaction, gas)?,
+            inputs: asc_new(heap, &self.inputs, gas)?,
+            outputs: asc_new(heap, &self.outputs, gas)?,
+        })
+    }
+}
+
+impl ToAscObj<AscLogParam> for ethabi::LogParam {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscLogParam, DeterministicHostError> {
+        Ok(AscLogParam {
+            name: asc_new(heap, self.name.as_str(), gas)?,
+            value: asc_new(heap, &self.value, gas)?,
+        })
+    }
+}
diff --git a/chain/ethereum/src/runtime/mod.rs b/chain/ethereum/src/runtime/mod.rs
new file mode 100644
index 0000000..42f0a9d
--- /dev/null
+++ b/chain/ethereum/src/runtime/mod.rs
@@ -0,0 +1,4 @@
+pub use runtime_adapter::RuntimeAdapter;
+
+pub mod abi;
+pub mod runtime_adapter;
diff --git a/chain/ethereum/src/runtime/runtime_adapter.rs b/chain/ethereum/src/runtime/runtime_adapter.rs
new file mode 100644
index 0000000..e3f4a17
--- /dev/null
+++ b/chain/ethereum/src/runtime/runtime_adapter.rs
@@ -0,0 +1,226 @@
+use std::{sync::Arc, time::Instant};
+
+use crate::data_source::MappingABI;
+use crate::{
+    capabilities::NodeCapabilities, network::EthereumNetworkAdapters, Chain, DataSource,
+    EthereumAdapter, EthereumAdapterTrait, EthereumContractCall, EthereumContractCallError,
+};
+use anyhow::{Context, Error};
+use blockchain::HostFn;
+use graph::runtime::gas::Gas;
+use graph::runtime::{AscIndexId, IndexForAscTypeId};
+use graph::{
+    blockchain::{self, BlockPtr, HostFnCtx},
+    cheap_clone::CheapClone,
+    prelude::{
+        ethabi::{self, Address, Token},
+        EthereumCallCache, Future01CompatExt,
+    },
+    runtime::{asc_get, asc_new, AscPtr, HostExportError},
+    semver::Version,
+    slog::{info, trace, Logger},
+};
+use graph_runtime_wasm::asc_abi::class::{AscEnumArray, EthereumValueKind};
+
+use super::abi::{AscUnresolvedContractCall, AscUnresolvedContractCall_0_0_4};
+
+// When making an ethereum call, the maximum ethereum gas is ETH_CALL_GAS which is 50 million. One
+// unit of Ethereum gas is at least 100ns according to these benchmarks [1], so 1000 of our gas. In
+// the worst case an Ethereum call could therefore consume 50 billion of our gas. However the
+// averarge call a subgraph makes is much cheaper or even cached in the call cache. So this cost is
+// set to 5 billion gas as a compromise. This allows for 2000 calls per handler with the current
+// limits.
+//
+// [1] - https://www.sciencedirect.com/science/article/abs/pii/S0166531620300900
+pub const ETHEREUM_CALL: Gas = Gas::new(5_000_000_000);
+
+pub struct RuntimeAdapter {
+    pub eth_adapters: Arc<EthereumNetworkAdapters>,
+    pub call_cache: Arc<dyn EthereumCallCache>,
+}
+
+impl blockchain::RuntimeAdapter<Chain> for RuntimeAdapter {
+    fn host_fns(&self, ds: &DataSource) -> Result<Vec<HostFn>, Error> {
+        let abis = ds.mapping.abis.clone();
+        let call_cache = self.call_cache.cheap_clone();
+        let eth_adapter = self
+            .eth_adapters
+            .cheapest_with(&NodeCapabilities {
+                archive: ds.mapping.requires_archive()?,
+                traces: false,
+            })?
+            .cheap_clone();
+
+        let ethereum_call = HostFn {
+            name: "ethereum.call",
+            func: Arc::new(move |ctx, wasm_ptr| {
+                ethereum_call(&eth_adapter, call_cache.cheap_clone(), ctx, wasm_ptr, &abis)
+                    .map(|ptr| ptr.wasm_ptr())
+            }),
+        };
+
+        Ok(vec![ethereum_call])
+    }
+}
+
+/// function ethereum.call(call: SmartContractCall): Array<Token> | null
+fn ethereum_call(
+    eth_adapter: &EthereumAdapter,
+    call_cache: Arc<dyn EthereumCallCache>,
+    ctx: HostFnCtx<'_>,
+    wasm_ptr: u32,
+    abis: &[Arc<MappingABI>],
+) -> Result<AscEnumArray<EthereumValueKind>, HostExportError> {
+    ctx.gas.consume_host_fn(ETHEREUM_CALL)?;
+
+    // For apiVersion >= 0.0.4 the call passed from the mapping includes the
+    // function signature; subgraphs using an apiVersion < 0.0.4 don't pass
+    // the signature along with the call.
+    let call: UnresolvedContractCall = if ctx.heap.api_version() >= Version::new(0, 0, 4) {
+        asc_get::<_, AscUnresolvedContractCall_0_0_4, _>(ctx.heap, wasm_ptr.into(), &ctx.gas)?
+    } else {
+        asc_get::<_, AscUnresolvedContractCall, _>(ctx.heap, wasm_ptr.into(), &ctx.gas)?
+    };
+
+    let result = eth_call(
+        eth_adapter,
+        call_cache,
+        &ctx.logger,
+        &ctx.block_ptr,
+        call,
+        abis,
+    )?;
+    match result {
+        Some(tokens) => Ok(asc_new(ctx.heap, tokens.as_slice(), &ctx.gas)?),
+        None => Ok(AscPtr::null()),
+    }
+}
+
+/// Returns `Ok(None)` if the call was reverted.
+fn eth_call(
+    eth_adapter: &EthereumAdapter,
+    call_cache: Arc<dyn EthereumCallCache>,
+    logger: &Logger,
+    block_ptr: &BlockPtr,
+    unresolved_call: UnresolvedContractCall,
+    abis: &[Arc<MappingABI>],
+) -> Result<Option<Vec<Token>>, HostExportError> {
+    let start_time = Instant::now();
+
+    // Obtain the path to the contract ABI
+    let contract = abis
+        .iter()
+        .find(|abi| abi.name == unresolved_call.contract_name)
+        .with_context(|| {
+            format!(
+                "Could not find ABI for contract \"{}\", try adding it to the 'abis' section \
+                     of the subgraph manifest",
+                unresolved_call.contract_name
+            )
+        })?
+        .contract
+        .clone();
+
+    let function = match unresolved_call.function_signature {
+        // Behavior for apiVersion < 0.0.4: look up function by name; for overloaded
+        // functions this always picks the same overloaded variant, which is incorrect
+        // and may lead to encoding/decoding errors
+        None => contract
+            .function(unresolved_call.function_name.as_str())
+            .with_context(|| {
+                format!(
+                    "Unknown function \"{}::{}\" called from WASM runtime",
+                    unresolved_call.contract_name, unresolved_call.function_name
+                )
+            })?,
+
+        // Behavior for apiVersion >= 0.0.04: look up function by signature of
+        // the form `functionName(uint256,string) returns (bytes32,string)`; this
+        // correctly picks the correct variant of an overloaded function
+        Some(ref function_signature) => contract
+            .functions_by_name(unresolved_call.function_name.as_str())
+            .with_context(|| {
+                format!(
+                    "Unknown function \"{}::{}\" called from WASM runtime",
+                    unresolved_call.contract_name, unresolved_call.function_name
+                )
+            })?
+            .iter()
+            .find(|f| function_signature == &f.signature())
+            .with_context(|| {
+                format!(
+                    "Unknown function \"{}::{}\" with signature `{}` \
+                         called from WASM runtime",
+                    unresolved_call.contract_name,
+                    unresolved_call.function_name,
+                    function_signature,
+                )
+            })?,
+    };
+
+    let call = EthereumContractCall {
+        address: unresolved_call.contract_address,
+        block_ptr: block_ptr.cheap_clone(),
+        function: function.clone(),
+        args: unresolved_call.function_args.clone(),
+    };
+
+    // Run Ethereum call in tokio runtime
+    let logger1 = logger.clone();
+    let call_cache = call_cache.clone();
+    let result = match graph::block_on(
+            eth_adapter.contract_call(&logger1, call, call_cache).compat()
+        ) {
+            Ok(tokens) => Ok(Some(tokens)),
+            Err(EthereumContractCallError::Revert(reason)) => {
+                info!(logger, "Contract call reverted"; "reason" => reason);
+                Ok(None)
+            }
+
+            // Any error reported by the Ethereum node could be due to the block no longer being on
+            // the main chain. This is very unespecific but we don't want to risk failing a
+            // subgraph due to a transient error such as a reorg.
+            Err(EthereumContractCallError::Web3Error(e)) => Err(HostExportError::PossibleReorg(anyhow::anyhow!(
+                "Ethereum node returned an error when calling function \"{}\" of contract \"{}\": {}",
+                unresolved_call.function_name,
+                unresolved_call.contract_name,
+                e
+            ))),
+
+            // Also retry on timeouts.
+            Err(EthereumContractCallError::Timeout) => Err(HostExportError::PossibleReorg(anyhow::anyhow!(
+                "Ethereum node did not respond when calling function \"{}\" of contract \"{}\"",
+                unresolved_call.function_name,
+                unresolved_call.contract_name,
+            ))),
+
+            Err(e) => Err(HostExportError::Unknown(anyhow::anyhow!(
+                "Failed to call function \"{}\" of contract \"{}\": {}",
+                unresolved_call.function_name,
+                unresolved_call.contract_name,
+                e
+            ))),
+        };
+
+    trace!(logger, "Contract call finished";
+              "address" => &unresolved_call.contract_address.to_string(),
+              "contract" => &unresolved_call.contract_name,
+              "function" => &unresolved_call.function_name,
+              "function_signature" => &unresolved_call.function_signature,
+              "time" => format!("{}ms", start_time.elapsed().as_millis()));
+
+    result
+}
+
+#[derive(Clone, Debug)]
+pub struct UnresolvedContractCall {
+    pub contract_name: String,
+    pub contract_address: Address,
+    pub function_name: String,
+    pub function_signature: Option<String>,
+    pub function_args: Vec<ethabi::Token>,
+}
+
+impl AscIndexId for AscUnresolvedContractCall {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::SmartContractCall;
+}
diff --git a/chain/ethereum/src/tests.rs b/chain/ethereum/src/tests.rs
new file mode 100644
index 0000000..eee594f
--- /dev/null
+++ b/chain/ethereum/src/tests.rs
@@ -0,0 +1,97 @@
+use std::sync::Arc;
+
+use graph::{
+    blockchain::{block_stream::BlockWithTriggers, BlockPtr},
+    prelude::{
+        web3::types::{Address, Bytes, Log, H160, H256, U64},
+        EthereumCall,
+    },
+};
+
+use crate::{
+    chain::BlockFinality,
+    trigger::{EthereumBlockTriggerType, EthereumTrigger},
+};
+
+#[test]
+fn test_trigger_ordering() {
+    let block1 = EthereumTrigger::Block(
+        BlockPtr::from((H256::random(), 1u64)),
+        EthereumBlockTriggerType::Every,
+    );
+
+    let block2 = EthereumTrigger::Block(
+        BlockPtr::from((H256::random(), 0u64)),
+        EthereumBlockTriggerType::WithCallTo(Address::random()),
+    );
+
+    let mut call1 = EthereumCall::default();
+    call1.transaction_index = 1;
+    let call1 = EthereumTrigger::Call(Arc::new(call1));
+
+    let mut call2 = EthereumCall::default();
+    call2.transaction_index = 2;
+    let call2 = EthereumTrigger::Call(Arc::new(call2));
+
+    let mut call3 = EthereumCall::default();
+    call3.transaction_index = 3;
+    let call3 = EthereumTrigger::Call(Arc::new(call3));
+
+    // Call with the same tx index as call2
+    let mut call4 = EthereumCall::default();
+    call4.transaction_index = 2;
+    let call4 = EthereumTrigger::Call(Arc::new(call4));
+
+    fn create_log(tx_index: u64, log_index: u64) -> Arc<Log> {
+        Arc::new(Log {
+            address: H160::default(),
+            topics: vec![],
+            data: Bytes::default(),
+            block_hash: Some(H256::zero()),
+            block_number: Some(U64::zero()),
+            transaction_hash: Some(H256::zero()),
+            transaction_index: Some(tx_index.into()),
+            log_index: Some(log_index.into()),
+            transaction_log_index: Some(log_index.into()),
+            log_type: Some("".into()),
+            removed: Some(false),
+        })
+    }
+
+    // Event with transaction_index 1 and log_index 0;
+    // should be the first element after sorting
+    let log1 = EthereumTrigger::Log(create_log(1, 0), None);
+
+    // Event with transaction_index 1 and log_index 1;
+    // should be the second element after sorting
+    let log2 = EthereumTrigger::Log(create_log(1, 1), None);
+
+    // Event with transaction_index 2 and log_index 5;
+    // should come after call1 and before call2 after sorting
+    let log3 = EthereumTrigger::Log(create_log(2, 5), None);
+
+    let triggers = vec![
+        // Call triggers; these should be in the order 1, 2, 4, 3 after sorting
+        call3.clone(),
+        call1.clone(),
+        call2.clone(),
+        call4.clone(),
+        // Block triggers; these should appear at the end after sorting
+        // but with their order unchanged
+        block2.clone(),
+        block1.clone(),
+        // Event triggers
+        log3.clone(),
+        log2.clone(),
+        log1.clone(),
+    ];
+
+    // Test that `BlockWithTriggers` sorts the triggers.
+    let block_with_triggers =
+        BlockWithTriggers::<crate::Chain>::new(BlockFinality::Final(Default::default()), triggers);
+
+    assert_eq!(
+        block_with_triggers.trigger_data,
+        vec![log1, log2, call1, log3, call2, call4, call3, block2, block1]
+    );
+}
diff --git a/chain/ethereum/src/transport.rs b/chain/ethereum/src/transport.rs
new file mode 100644
index 0000000..2d4302c
--- /dev/null
+++ b/chain/ethereum/src/transport.rs
@@ -0,0 +1,88 @@
+use jsonrpc_core::types::Call;
+use jsonrpc_core::Value;
+
+use web3::transports::{http, ipc, ws};
+use web3::RequestId;
+
+use graph::prelude::*;
+use graph::url::Url;
+use std::future::Future;
+
+/// Abstraction over the different web3 transports.
+#[derive(Clone, Debug)]
+pub enum Transport {
+    RPC(http::Http),
+    IPC(ipc::Ipc),
+    WS(ws::WebSocket),
+}
+
+impl Transport {
+    /// Creates an IPC transport.
+    #[cfg(unix)]
+    pub async fn new_ipc(ipc: &str) -> Self {
+        ipc::Ipc::new(ipc)
+            .await
+            .map(|transport| Transport::IPC(transport))
+            .expect("Failed to connect to Ethereum IPC")
+    }
+
+    /// Creates a WebSocket transport.
+    pub async fn new_ws(ws: &str) -> Self {
+        ws::WebSocket::new(ws)
+            .await
+            .map(|transport| Transport::WS(transport))
+            .expect("Failed to connect to Ethereum WS")
+    }
+
+    /// Creates a JSON-RPC over HTTP transport.
+    ///
+    /// Note: JSON-RPC over HTTP doesn't always support subscribing to new
+    /// blocks (one such example is Infura's HTTP endpoint).
+    pub fn new_rpc(rpc: Url, headers: ::http::HeaderMap) -> Self {
+        // Unwrap: This only fails if something is wrong with the system's TLS config.
+        let client = reqwest::Client::builder()
+            .default_headers(headers)
+            .build()
+            .unwrap();
+        Transport::RPC(http::Http::with_client(client, rpc))
+    }
+}
+
+impl web3::Transport for Transport {
+    type Out = Box<dyn Future<Output = Result<Value, web3::error::Error>> + Send + Unpin>;
+
+    fn prepare(&self, method: &str, params: Vec<Value>) -> (RequestId, Call) {
+        match self {
+            Transport::RPC(http) => http.prepare(method, params),
+            Transport::IPC(ipc) => ipc.prepare(method, params),
+            Transport::WS(ws) => ws.prepare(method, params),
+        }
+    }
+
+    fn send(&self, id: RequestId, request: Call) -> Self::Out {
+        match self {
+            Transport::RPC(http) => Box::new(http.send(id, request)),
+            Transport::IPC(ipc) => Box::new(ipc.send(id, request)),
+            Transport::WS(ws) => Box::new(ws.send(id, request)),
+        }
+    }
+}
+
+impl web3::BatchTransport for Transport {
+    type Batch = Box<
+        dyn Future<Output = Result<Vec<Result<Value, web3::error::Error>>, web3::error::Error>>
+            + Send
+            + Unpin,
+    >;
+
+    fn send_batch<T>(&self, requests: T) -> Self::Batch
+    where
+        T: IntoIterator<Item = (RequestId, Call)>,
+    {
+        match self {
+            Transport::RPC(http) => Box::new(http.send_batch(requests)),
+            Transport::IPC(ipc) => Box::new(ipc.send_batch(requests)),
+            Transport::WS(ws) => Box::new(ws.send_batch(requests)),
+        }
+    }
+}
diff --git a/chain/ethereum/src/trigger.rs b/chain/ethereum/src/trigger.rs
new file mode 100644
index 0000000..9d3a4a8
--- /dev/null
+++ b/chain/ethereum/src/trigger.rs
@@ -0,0 +1,433 @@
+use graph::blockchain::TriggerData;
+use graph::data::subgraph::API_VERSION_0_0_2;
+use graph::data::subgraph::API_VERSION_0_0_6;
+use graph::data::subgraph::API_VERSION_0_0_7;
+use graph::prelude::ethabi::ethereum_types::H160;
+use graph::prelude::ethabi::ethereum_types::H256;
+use graph::prelude::ethabi::ethereum_types::U128;
+use graph::prelude::ethabi::ethereum_types::U256;
+use graph::prelude::ethabi::ethereum_types::U64;
+use graph::prelude::ethabi::Address;
+use graph::prelude::ethabi::Bytes;
+use graph::prelude::ethabi::LogParam;
+use graph::prelude::web3::types::Block;
+use graph::prelude::web3::types::Log;
+use graph::prelude::web3::types::Transaction;
+use graph::prelude::web3::types::TransactionReceipt;
+use graph::prelude::BlockNumber;
+use graph::prelude::BlockPtr;
+use graph::prelude::{CheapClone, EthereumCall};
+use graph::runtime::asc_new;
+use graph::runtime::gas::GasCounter;
+use graph::runtime::AscHeap;
+use graph::runtime::AscPtr;
+use graph::runtime::DeterministicHostError;
+use graph::semver::Version;
+use graph_runtime_wasm::module::ToAscPtr;
+use std::convert::TryFrom;
+use std::ops::Deref;
+use std::{cmp::Ordering, sync::Arc};
+
+use crate::runtime::abi::AscEthereumBlock;
+use crate::runtime::abi::AscEthereumBlock_0_0_6;
+use crate::runtime::abi::AscEthereumCall;
+use crate::runtime::abi::AscEthereumCall_0_0_3;
+use crate::runtime::abi::AscEthereumEvent;
+use crate::runtime::abi::AscEthereumEvent_0_0_7;
+use crate::runtime::abi::AscEthereumTransaction_0_0_1;
+use crate::runtime::abi::AscEthereumTransaction_0_0_2;
+use crate::runtime::abi::AscEthereumTransaction_0_0_6;
+
+// ETHDEP: This should be defined in only one place.
+type LightEthereumBlock = Block<Transaction>;
+
+pub enum MappingTrigger {
+    Log {
+        block: Arc<LightEthereumBlock>,
+        transaction: Arc<Transaction>,
+        log: Arc<Log>,
+        params: Vec<LogParam>,
+        receipt: Option<Arc<TransactionReceipt>>,
+    },
+    Call {
+        block: Arc<LightEthereumBlock>,
+        transaction: Arc<Transaction>,
+        call: Arc<EthereumCall>,
+        inputs: Vec<LogParam>,
+        outputs: Vec<LogParam>,
+    },
+    Block {
+        block: Arc<LightEthereumBlock>,
+    },
+}
+
+// Logging the block is too verbose, so this strips the block from the trigger for Debug.
+impl std::fmt::Debug for MappingTrigger {
+    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
+        #[derive(Debug)]
+        enum MappingTriggerWithoutBlock {
+            Log {
+                _transaction: Arc<Transaction>,
+                _log: Arc<Log>,
+                _params: Vec<LogParam>,
+            },
+            Call {
+                _transaction: Arc<Transaction>,
+                _call: Arc<EthereumCall>,
+                _inputs: Vec<LogParam>,
+                _outputs: Vec<LogParam>,
+            },
+            Block,
+        }
+
+        let trigger_without_block = match self {
+            MappingTrigger::Log {
+                block: _,
+                transaction,
+                log,
+                params,
+                receipt: _,
+            } => MappingTriggerWithoutBlock::Log {
+                _transaction: transaction.cheap_clone(),
+                _log: log.cheap_clone(),
+                _params: params.clone(),
+            },
+            MappingTrigger::Call {
+                block: _,
+                transaction,
+                call,
+                inputs,
+                outputs,
+            } => MappingTriggerWithoutBlock::Call {
+                _transaction: transaction.cheap_clone(),
+                _call: call.cheap_clone(),
+                _inputs: inputs.clone(),
+                _outputs: outputs.clone(),
+            },
+            MappingTrigger::Block { block: _ } => MappingTriggerWithoutBlock::Block,
+        };
+
+        write!(f, "{:?}", trigger_without_block)
+    }
+}
+
+impl ToAscPtr for MappingTrigger {
+    fn to_asc_ptr<H: AscHeap>(
+        self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscPtr<()>, DeterministicHostError> {
+        Ok(match self {
+            MappingTrigger::Log {
+                block,
+                transaction,
+                log,
+                params,
+                receipt,
+            } => {
+                let api_version = heap.api_version();
+                let ethereum_event_data = EthereumEventData {
+                    block: EthereumBlockData::from(block.as_ref()),
+                    transaction: EthereumTransactionData::from(transaction.deref()),
+                    address: log.address,
+                    log_index: log.log_index.unwrap_or(U256::zero()),
+                    transaction_log_index: log.log_index.unwrap_or(U256::zero()),
+                    log_type: log.log_type.clone(),
+                    params,
+                };
+                if api_version >= API_VERSION_0_0_7 {
+                    asc_new::<
+                        AscEthereumEvent_0_0_7<
+                            AscEthereumTransaction_0_0_6,
+                            AscEthereumBlock_0_0_6,
+                        >,
+                        _,
+                        _,
+                    >(heap, &(ethereum_event_data, receipt.as_deref()), gas)?
+                    .erase()
+                } else if api_version >= API_VERSION_0_0_6 {
+                    asc_new::<
+                        AscEthereumEvent<AscEthereumTransaction_0_0_6, AscEthereumBlock_0_0_6>,
+                        _,
+                        _,
+                    >(heap, &ethereum_event_data, gas)?
+                    .erase()
+                } else if api_version >= API_VERSION_0_0_2 {
+                    asc_new::<
+                            AscEthereumEvent<AscEthereumTransaction_0_0_2, AscEthereumBlock>,
+                            _,
+                            _,
+                        >(heap, &ethereum_event_data, gas)?
+                        .erase()
+                } else {
+                    asc_new::<
+                        AscEthereumEvent<AscEthereumTransaction_0_0_1, AscEthereumBlock>,
+                        _,
+                        _,
+                    >(heap, &ethereum_event_data, gas)?
+                    .erase()
+                }
+            }
+            MappingTrigger::Call {
+                block,
+                transaction,
+                call,
+                inputs,
+                outputs,
+            } => {
+                let call = EthereumCallData {
+                    to: call.to,
+                    from: call.from,
+                    block: EthereumBlockData::from(block.as_ref()),
+                    transaction: EthereumTransactionData::from(transaction.deref()),
+                    inputs,
+                    outputs,
+                };
+                if heap.api_version() >= Version::new(0, 0, 6) {
+                    asc_new::<
+                        AscEthereumCall_0_0_3<AscEthereumTransaction_0_0_6, AscEthereumBlock_0_0_6>,
+                        _,
+                        _,
+                    >(heap, &call, gas)?
+                    .erase()
+                } else if heap.api_version() >= Version::new(0, 0, 3) {
+                    asc_new::<
+                        AscEthereumCall_0_0_3<AscEthereumTransaction_0_0_2, AscEthereumBlock>,
+                        _,
+                        _,
+                    >(heap, &call, gas)?
+                    .erase()
+                } else {
+                    asc_new::<AscEthereumCall, _, _>(heap, &call, gas)?.erase()
+                }
+            }
+            MappingTrigger::Block { block } => {
+                let block = EthereumBlockData::from(block.as_ref());
+                if heap.api_version() >= Version::new(0, 0, 6) {
+                    asc_new::<AscEthereumBlock_0_0_6, _, _>(heap, &block, gas)?.erase()
+                } else {
+                    asc_new::<AscEthereumBlock, _, _>(heap, &block, gas)?.erase()
+                }
+            }
+        })
+    }
+}
+
+#[derive(Clone, Debug)]
+pub enum EthereumTrigger {
+    Block(BlockPtr, EthereumBlockTriggerType),
+    Call(Arc<EthereumCall>),
+    Log(Arc<Log>, Option<Arc<TransactionReceipt>>),
+}
+
+impl PartialEq for EthereumTrigger {
+    fn eq(&self, other: &Self) -> bool {
+        match (self, other) {
+            (Self::Block(a_ptr, a_kind), Self::Block(b_ptr, b_kind)) => {
+                a_ptr == b_ptr && a_kind == b_kind
+            }
+
+            (Self::Call(a), Self::Call(b)) => a == b,
+
+            (Self::Log(a, a_receipt), Self::Log(b, b_receipt)) => {
+                a.transaction_hash == b.transaction_hash
+                    && a.log_index == b.log_index
+                    && a_receipt == b_receipt
+            }
+
+            _ => false,
+        }
+    }
+}
+
+impl Eq for EthereumTrigger {}
+
+#[derive(Clone, Debug, PartialEq, Eq)]
+pub enum EthereumBlockTriggerType {
+    Every,
+    WithCallTo(Address),
+}
+
+impl EthereumTrigger {
+    pub fn block_number(&self) -> BlockNumber {
+        match self {
+            EthereumTrigger::Block(block_ptr, _) => block_ptr.number,
+            EthereumTrigger::Call(call) => call.block_number,
+            EthereumTrigger::Log(log, _) => {
+                i32::try_from(log.block_number.unwrap().as_u64()).unwrap()
+            }
+        }
+    }
+
+    pub fn block_hash(&self) -> H256 {
+        match self {
+            EthereumTrigger::Block(block_ptr, _) => block_ptr.hash_as_h256(),
+            EthereumTrigger::Call(call) => call.block_hash,
+            EthereumTrigger::Log(log, _) => log.block_hash.unwrap(),
+        }
+    }
+}
+
+impl Ord for EthereumTrigger {
+    fn cmp(&self, other: &Self) -> Ordering {
+        match (self, other) {
+            // Keep the order when comparing two block triggers
+            (Self::Block(..), Self::Block(..)) => Ordering::Equal,
+
+            // Block triggers always come last
+            (Self::Block(..), _) => Ordering::Greater,
+            (_, Self::Block(..)) => Ordering::Less,
+
+            // Calls are ordered by their tx indexes
+            (Self::Call(a), Self::Call(b)) => a.transaction_index.cmp(&b.transaction_index),
+
+            // Events are ordered by their log index
+            (Self::Log(a, _), Self::Log(b, _)) => a.log_index.cmp(&b.log_index),
+
+            // Calls vs. events are logged by their tx index;
+            // if they are from the same transaction, events come first
+            (Self::Call(a), Self::Log(b, _))
+                if a.transaction_index == b.transaction_index.unwrap().as_u64() =>
+            {
+                Ordering::Greater
+            }
+            (Self::Log(a, _), Self::Call(b))
+                if a.transaction_index.unwrap().as_u64() == b.transaction_index =>
+            {
+                Ordering::Less
+            }
+            (Self::Call(a), Self::Log(b, _)) => a
+                .transaction_index
+                .cmp(&b.transaction_index.unwrap().as_u64()),
+            (Self::Log(a, _), Self::Call(b)) => a
+                .transaction_index
+                .unwrap()
+                .as_u64()
+                .cmp(&b.transaction_index),
+        }
+    }
+}
+
+impl PartialOrd for EthereumTrigger {
+    fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
+        Some(self.cmp(other))
+    }
+}
+
+impl TriggerData for EthereumTrigger {
+    fn error_context(&self) -> std::string::String {
+        let transaction_id = match self {
+            EthereumTrigger::Log(log, _) => log.transaction_hash,
+            EthereumTrigger::Call(call) => call.transaction_hash,
+            EthereumTrigger::Block(..) => None,
+        };
+
+        match transaction_id {
+            Some(tx_hash) => format!(
+                "block #{} ({}), transaction {:x}",
+                self.block_number(),
+                self.block_hash(),
+                tx_hash
+            ),
+            None => String::new(),
+        }
+    }
+}
+
+/// Ethereum block data.
+#[derive(Clone, Debug, Default)]
+pub struct EthereumBlockData {
+    pub hash: H256,
+    pub parent_hash: H256,
+    pub uncles_hash: H256,
+    pub author: H160,
+    pub state_root: H256,
+    pub transactions_root: H256,
+    pub receipts_root: H256,
+    pub number: U64,
+    pub gas_used: U256,
+    pub gas_limit: U256,
+    pub timestamp: U256,
+    pub difficulty: U256,
+    pub total_difficulty: U256,
+    pub size: Option<U256>,
+    pub base_fee_per_gas: Option<U256>,
+}
+
+impl<'a, T> From<&'a Block<T>> for EthereumBlockData {
+    fn from(block: &'a Block<T>) -> EthereumBlockData {
+        EthereumBlockData {
+            hash: block.hash.unwrap(),
+            parent_hash: block.parent_hash,
+            uncles_hash: block.uncles_hash,
+            author: block.author,
+            state_root: block.state_root,
+            transactions_root: block.transactions_root,
+            receipts_root: block.receipts_root,
+            number: block.number.unwrap(),
+            gas_used: block.gas_used,
+            gas_limit: block.gas_limit,
+            timestamp: block.timestamp,
+            difficulty: block.difficulty,
+            total_difficulty: block.total_difficulty.unwrap_or_default(),
+            size: block.size,
+            base_fee_per_gas: block.base_fee_per_gas,
+        }
+    }
+}
+
+/// Ethereum transaction data.
+#[derive(Clone, Debug)]
+pub struct EthereumTransactionData {
+    pub hash: H256,
+    pub index: U128,
+    pub from: H160,
+    pub to: Option<H160>,
+    pub value: U256,
+    pub gas_limit: U256,
+    pub gas_price: U256,
+    pub input: Bytes,
+    pub nonce: U256,
+}
+
+impl From<&'_ Transaction> for EthereumTransactionData {
+    fn from(tx: &Transaction) -> EthereumTransactionData {
+        // unwrap: this is always `Some` for txns that have been mined
+        //         (see https://github.com/tomusdrw/rust-web3/pull/407)
+        let from = tx.from.unwrap();
+        EthereumTransactionData {
+            hash: tx.hash,
+            index: tx.transaction_index.unwrap().as_u64().into(),
+            from,
+            to: tx.to,
+            value: tx.value,
+            gas_limit: tx.gas,
+            gas_price: tx.gas_price.unwrap_or(U256::zero()), // EIP-1559 made this optional.
+            input: tx.input.0.clone(),
+            nonce: tx.nonce.clone(),
+        }
+    }
+}
+
+/// An Ethereum event logged from a specific contract address and block.
+#[derive(Debug, Clone)]
+pub struct EthereumEventData {
+    pub address: Address,
+    pub log_index: U256,
+    pub transaction_log_index: U256,
+    pub log_type: Option<String>,
+    pub block: EthereumBlockData,
+    pub transaction: EthereumTransactionData,
+    pub params: Vec<LogParam>,
+}
+
+/// An Ethereum call executed within a transaction within a block to a contract address.
+#[derive(Debug, Clone)]
+pub struct EthereumCallData {
+    pub from: Address,
+    pub to: Address,
+    pub block: EthereumBlockData,
+    pub transaction: EthereumTransactionData,
+    pub inputs: Vec<LogParam>,
+    pub outputs: Vec<LogParam>,
+}
diff --git a/chain/ethereum/tests/full-text.graphql b/chain/ethereum/tests/full-text.graphql
new file mode 100644
index 0000000..8fd9451
--- /dev/null
+++ b/chain/ethereum/tests/full-text.graphql
@@ -0,0 +1,25 @@
+# Schema used for unit tests.
+
+type _Schema_
+  @fulltext(
+    name: "bandSearch"
+    language: en
+    algorithm: rank
+    include: [
+      {
+        entity: "Band"
+        fields: [{ name: "name" }, { name: "description" }, { name: "bio" }]
+      }
+    ]
+  )
+
+type Band @entity {
+  id: ID!
+  name: String!
+  description: String!
+  bio: String
+  wallet: Address
+  labels: [Label!]!
+  discography: [Album!]!
+  members: [Musician!]!
+}
diff --git a/chain/ethereum/tests/ipfs-on-ethereum-contracts.ts b/chain/ethereum/tests/ipfs-on-ethereum-contracts.ts
new file mode 100644
index 0000000..ac5f70a
--- /dev/null
+++ b/chain/ethereum/tests/ipfs-on-ethereum-contracts.ts
@@ -0,0 +1,27 @@
+export enum ValueKind {
+  STRING = 0,
+  INT = 1,
+  BIGDECIMAL = 2,
+  BOOL = 3,
+  ARRAY = 4,
+  NULL = 5,
+  BYTES = 6,
+  BIGINT = 7,
+}
+
+export type ValuePayload = u64;
+
+export class Value {
+  constructor(public kind: ValueKind, public data: ValuePayload) {}
+}
+
+declare namespace ipfs {
+  function cat(hash: String): void
+  function map(hash: String, callback: String, userData: Value, flags: String[]): void
+}
+
+export function foo(): void {
+    let value = new Value(0, 0)
+    ipfs.cat("")
+    ipfs.map("", "", value, [])
+}
diff --git a/chain/ethereum/tests/ipfs-on-ethereum-contracts.wasm b/chain/ethereum/tests/ipfs-on-ethereum-contracts.wasm
new file mode 100644
index 0000000..21f37cc
Binary files /dev/null and b/chain/ethereum/tests/ipfs-on-ethereum-contracts.wasm differ
diff --git a/chain/ethereum/tests/manifest.rs b/chain/ethereum/tests/manifest.rs
new file mode 100644
index 0000000..2c82f1f
--- /dev/null
+++ b/chain/ethereum/tests/manifest.rs
@@ -0,0 +1,797 @@
+use std::collections::HashMap;
+use std::sync::Arc;
+use std::time::Duration;
+
+use graph::data::subgraph::schema::SubgraphError;
+use graph::data::subgraph::{SPEC_VERSION_0_0_4, SPEC_VERSION_0_0_7};
+use graph::data_source::DataSourceTemplate;
+use graph::prelude::{
+    anyhow, async_trait, serde_yaml, tokio, DeploymentHash, Entity, Link, Logger, SubgraphManifest,
+    SubgraphManifestValidationError, UnvalidatedSubgraphManifest,
+};
+use graph::{
+    blockchain::NodeCapabilities as _,
+    components::{
+        link_resolver::{JsonValueStream, LinkResolver as LinkResolverTrait},
+        store::EntityType,
+    },
+    data::subgraph::SubgraphFeature,
+};
+
+use graph_chain_ethereum::{Chain, NodeCapabilities};
+use semver::Version;
+use test_store::LOGGER;
+
+const GQL_SCHEMA: &str = "type Thing @entity { id: ID! }";
+const GQL_SCHEMA_FULLTEXT: &str = include_str!("full-text.graphql");
+const MAPPING_WITH_IPFS_FUNC_WASM: &[u8] = include_bytes!("ipfs-on-ethereum-contracts.wasm");
+const ABI: &str = "[{\"type\":\"function\", \"inputs\": [{\"name\": \"i\",\"type\": \"uint256\"}],\"name\":\"get\",\"outputs\": [{\"type\": \"address\",\"name\": \"o\"}]}]";
+const FILE: &str = "{}";
+const FILE_CID: &str = "bafkreigkhuldxkyfkoaye4rgcqcwr45667vkygd45plwq6hawy7j4rbdky";
+
+#[derive(Default, Debug, Clone)]
+struct TextResolver {
+    texts: HashMap<String, Vec<u8>>,
+}
+
+impl TextResolver {
+    fn add(&mut self, link: &str, text: &impl AsRef<[u8]>) {
+        self.texts.insert(
+            link.to_owned(),
+            text.as_ref().into_iter().cloned().collect(),
+        );
+    }
+}
+
+#[async_trait]
+impl LinkResolverTrait for TextResolver {
+    fn with_timeout(&self, _timeout: Duration) -> Box<dyn LinkResolverTrait> {
+        Box::new(self.clone())
+    }
+
+    fn with_retries(&self) -> Box<dyn LinkResolverTrait> {
+        Box::new(self.clone())
+    }
+
+    async fn cat(&self, _logger: &Logger, link: &Link) -> Result<Vec<u8>, anyhow::Error> {
+        self.texts
+            .get(&link.link)
+            .ok_or(anyhow!("No text for {}", &link.link))
+            .map(Clone::clone)
+    }
+
+    async fn get_block(&self, _logger: &Logger, _link: &Link) -> Result<Vec<u8>, anyhow::Error> {
+        unimplemented!()
+    }
+
+    async fn json_stream(
+        &self,
+        _logger: &Logger,
+        _link: &Link,
+    ) -> Result<JsonValueStream, anyhow::Error> {
+        unimplemented!()
+    }
+}
+
+async fn resolve_manifest(
+    text: &str,
+    max_spec_version: Version,
+) -> SubgraphManifest<graph_chain_ethereum::Chain> {
+    let mut resolver = TextResolver::default();
+    let id = DeploymentHash::new("Qmmanifest").unwrap();
+
+    resolver.add(id.as_str(), &text);
+    resolver.add("/ipfs/Qmschema", &GQL_SCHEMA);
+    resolver.add("/ipfs/Qmabi", &ABI);
+    resolver.add("/ipfs/Qmmapping", &MAPPING_WITH_IPFS_FUNC_WASM);
+    resolver.add(FILE_CID, &FILE);
+
+    let resolver: Arc<dyn LinkResolverTrait> = Arc::new(resolver);
+
+    let raw = serde_yaml::from_str(text).unwrap();
+    SubgraphManifest::resolve_from_raw(id, raw, &resolver, &LOGGER, max_spec_version)
+        .await
+        .expect("Parsing simple manifest works")
+}
+
+async fn resolve_unvalidated(text: &str) -> UnvalidatedSubgraphManifest<Chain> {
+    let mut resolver = TextResolver::default();
+    let id = DeploymentHash::new("Qmmanifest").unwrap();
+
+    resolver.add(id.as_str(), &text);
+    resolver.add("/ipfs/Qmschema", &GQL_SCHEMA);
+
+    let resolver: Arc<dyn LinkResolverTrait> = Arc::new(resolver);
+
+    let raw = serde_yaml::from_str(text).unwrap();
+    UnvalidatedSubgraphManifest::resolve(id, raw, &resolver, &LOGGER, SPEC_VERSION_0_0_4.clone())
+        .await
+        .expect("Parsing simple manifest works")
+}
+
+// Some of these manifest tests should be made chain-independent, but for
+// now we just run them for the ethereum `Chain`
+
+#[tokio::test]
+async fn simple_manifest() {
+    const YAML: &str = "
+dataSources: []
+schema:
+  file:
+    /: /ipfs/Qmschema
+specVersion: 0.0.2
+";
+
+    let manifest = resolve_manifest(YAML, SPEC_VERSION_0_0_4).await;
+
+    assert_eq!("Qmmanifest", manifest.id.as_str());
+    assert!(manifest.graft.is_none());
+}
+
+#[tokio::test]
+async fn ipfs_manifest() {
+    let yaml = "
+schema:
+  file:
+    /: /ipfs/Qmschema
+dataSources: []
+templates:
+  - name: IpfsSource
+    kind: file/ipfs
+    mapping:
+      apiVersion: 0.0.6
+      language: wasm/assemblyscript
+      entities:
+        - TestEntity
+      file:
+        /: /ipfs/Qmmapping
+      handler: handleFile
+specVersion: 0.0.7
+";
+
+    let manifest = resolve_manifest(&yaml, SPEC_VERSION_0_0_7).await;
+
+    assert_eq!("Qmmanifest", manifest.id.as_str());
+    assert_eq!(manifest.data_sources.len(), 0);
+    let data_source = match &manifest.templates[0] {
+        DataSourceTemplate::Offchain(ds) => ds,
+        DataSourceTemplate::Onchain(_) => unreachable!(),
+    };
+    assert_eq!(data_source.kind, "file/ipfs");
+}
+
+#[tokio::test]
+async fn graft_manifest() {
+    const YAML: &str = "
+dataSources: []
+schema:
+  file:
+    /: /ipfs/Qmschema
+graft:
+  base: Qmbase
+  block: 12345
+specVersion: 0.0.2
+";
+
+    let manifest = resolve_manifest(YAML, SPEC_VERSION_0_0_4).await;
+
+    assert_eq!("Qmmanifest", manifest.id.as_str());
+    let graft = manifest.graft.expect("The manifest has a graft base");
+    assert_eq!("Qmbase", graft.base.as_str());
+    assert_eq!(12345, graft.block);
+}
+
+#[test]
+fn graft_failed_subgraph() {
+    const YAML: &str = "
+dataSources: []
+schema:
+  file:
+    /: /ipfs/Qmschema
+graft:
+  base: Qmbase
+  block: 0
+specVersion: 0.0.2
+";
+
+    test_store::run_test_sequentially(|store| async move {
+        let subgraph_store = store.subgraph_store();
+
+        let unvalidated = resolve_unvalidated(YAML).await;
+        let subgraph = DeploymentHash::new("Qmbase").unwrap();
+
+        // Creates base subgraph at block 0 (genesis).
+        let deployment = test_store::create_test_subgraph(&subgraph, GQL_SCHEMA).await;
+
+        // Adds an example entity.
+        let mut thing = Entity::new();
+        thing.set("id", "datthing");
+        test_store::insert_entities(&deployment, vec![(EntityType::from("Thing"), thing)])
+            .await
+            .unwrap();
+
+        let error = SubgraphError {
+            subgraph_id: deployment.hash.clone(),
+            message: "deterministic error".to_string(),
+            block_ptr: Some(test_store::BLOCKS[1].clone()),
+            handler: None,
+            deterministic: true,
+        };
+
+        // Fails the base subgraph at block 1 (and advances the pointer).
+        test_store::transact_errors(
+            &store,
+            &deployment,
+            test_store::BLOCKS[1].clone(),
+            vec![error],
+        )
+        .await
+        .unwrap();
+
+        // Make sure there are no GraftBaseInvalid errors.
+        //
+        // This is allowed because:
+        // - base:  failed at block 1
+        // - graft: starts at block 0
+        //
+        // Meaning that the graft will fail just like it's parent
+        // but it started at a valid previous block.
+        assert!(
+            unvalidated
+                .validate(subgraph_store.clone(), true)
+                .await
+                .expect_err("Validation must fail")
+                .into_iter()
+                .find(|e| matches!(e, SubgraphManifestValidationError::GraftBaseInvalid(_)))
+                .is_none(),
+            "There shouldn't be a GraftBaseInvalid error"
+        );
+
+        // Resolve the graft normally.
+        let manifest = resolve_manifest(YAML, SPEC_VERSION_0_0_4).await;
+
+        assert_eq!("Qmmanifest", manifest.id.as_str());
+        let graft = manifest.graft.expect("The manifest has a graft base");
+        assert_eq!("Qmbase", graft.base.as_str());
+        assert_eq!(0, graft.block);
+    })
+}
+
+#[test]
+fn graft_invalid_manifest() {
+    const YAML: &str = "
+dataSources: []
+schema:
+  file:
+    /: /ipfs/Qmschema
+graft:
+  base: Qmbase
+  block: 1
+specVersion: 0.0.2
+";
+
+    test_store::run_test_sequentially(|store| async move {
+        let subgraph_store = store.subgraph_store();
+
+        let unvalidated = resolve_unvalidated(YAML).await;
+        let subgraph = DeploymentHash::new("Qmbase").unwrap();
+
+        //
+        // Validation against subgraph that hasn't synced anything fails
+        //
+        let deployment = test_store::create_test_subgraph(&subgraph, GQL_SCHEMA).await;
+        // This check is awkward since the test manifest has other problems
+        // that the validation complains about as setting up a valid manifest
+        // would be a bit more work; we just want to make sure that
+        // graft-related checks work
+        let msg = unvalidated
+            .validate(subgraph_store.clone(), true)
+            .await
+            .expect_err("Validation must fail")
+            .into_iter()
+            .find(|e| matches!(e, SubgraphManifestValidationError::GraftBaseInvalid(_)))
+            .expect("There must be a GraftBaseInvalid error")
+            .to_string();
+        assert_eq!(
+            "the graft base is invalid: failed to graft onto `Qmbase` since \
+            it has not processed any blocks",
+            msg
+        );
+
+        let mut thing = Entity::new();
+        thing.set("id", "datthing");
+        test_store::insert_entities(&deployment, vec![(EntityType::from("Thing"), thing)])
+            .await
+            .unwrap();
+
+        // Validation against subgraph that has not reached the graft point fails
+        let unvalidated = resolve_unvalidated(YAML).await;
+        let msg = unvalidated
+            .validate(subgraph_store.clone(), true)
+            .await
+            .expect_err("Validation must fail")
+            .into_iter()
+            .find(|e| matches!(e, SubgraphManifestValidationError::GraftBaseInvalid(_)))
+            .expect("There must be a GraftBaseInvalid error")
+            .to_string();
+        assert_eq!(
+            "the graft base is invalid: failed to graft onto `Qmbase` \
+            at block 1 since it has only processed block 0",
+            msg
+        );
+
+        let error = SubgraphError {
+            subgraph_id: deployment.hash.clone(),
+            message: "deterministic error".to_string(),
+            block_ptr: Some(test_store::BLOCKS[1].clone()),
+            handler: None,
+            deterministic: true,
+        };
+
+        test_store::transact_errors(
+            &store,
+            &deployment,
+            test_store::BLOCKS[1].clone(),
+            vec![error],
+        )
+        .await
+        .unwrap();
+
+        // This check is bit awkward, but we just want to be sure there is a
+        // GraftBaseInvalid error.
+        //
+        // The validation error happens because:
+        // - base:  failed at block 1
+        // - graft: starts at block 1
+        //
+        // Since we start grafts at N + 1, we can't allow a graft to be created
+        // at the failed block. They (developers) should choose a previous valid
+        // block.
+        let unvalidated = resolve_unvalidated(YAML).await;
+        let msg = unvalidated
+            .validate(subgraph_store, true)
+            .await
+            .expect_err("Validation must fail")
+            .into_iter()
+            .find(|e| matches!(e, SubgraphManifestValidationError::GraftBaseInvalid(_)))
+            .expect("There must be a GraftBaseInvalid error")
+            .to_string();
+        assert_eq!(
+            "the graft base is invalid: failed to graft onto `Qmbase` \
+            at block 1 since it's not healthy. You can graft it starting at block 0 backwards",
+            msg
+        );
+    })
+}
+
+#[tokio::test]
+async fn parse_call_handlers() {
+    const YAML: &str = "
+dataSources:
+  - kind: ethereum/contract
+    name: Factory
+    network: mainnet
+    source:
+      abi: Factory
+      startBlock: 9562480
+    mapping:
+      kind: ethereum/events
+      apiVersion: 0.0.4
+      language: wasm/assemblyscript
+      entities:
+        - TestEntity
+      file:
+        /: /ipfs/Qmmapping
+      abis:
+        - name: Factory
+          file:
+            /: /ipfs/Qmabi
+      callHandlers:
+        - function: get(address)
+          handler: handleget
+schema:
+  file:
+    /: /ipfs/Qmschema
+specVersion: 0.0.2
+";
+
+    let manifest = resolve_manifest(YAML, SPEC_VERSION_0_0_4).await;
+    let onchain_data_sources = manifest
+        .data_sources
+        .iter()
+        .filter_map(|ds| ds.as_onchain().cloned())
+        .collect::<Vec<_>>();
+    let required_capabilities = NodeCapabilities::from_data_sources(&onchain_data_sources);
+
+    assert_eq!("Qmmanifest", manifest.id.as_str());
+    assert_eq!(true, required_capabilities.traces);
+}
+
+#[test]
+fn undeclared_grafting_feature_causes_feature_validation_error() {
+    const YAML: &str = "
+specVersion: 0.0.4
+dataSources: []
+schema:
+  file:
+    /: /ipfs/Qmschema
+graft:
+  base: Qmbase
+  block: 1
+";
+    test_store::run_test_sequentially(|store| async move {
+        let store = store.subgraph_store();
+        let unvalidated = resolve_unvalidated(YAML).await;
+        let error_msg = unvalidated
+            .validate(store.clone(), true)
+            .await
+            .expect_err("Validation must fail")
+            .into_iter()
+            .find(|e| {
+                matches!(
+                    e,
+                    SubgraphManifestValidationError::FeatureValidationError(_)
+                )
+            })
+            .expect("There must be a FeatureValidation error")
+            .to_string();
+        assert_eq!(
+            "The feature `grafting` is used by the subgraph but it is not declared in the manifest.",
+            error_msg
+        )
+    })
+}
+
+#[test]
+fn declared_grafting_feature_causes_no_feature_validation_errors() {
+    const YAML: &str = "
+specVersion: 0.0.4
+features:
+  - grafting
+dataSources: []
+schema:
+  file:
+    /: /ipfs/Qmschema
+graft:
+  base: Qmbase
+  block: 1
+";
+    test_store::run_test_sequentially(|store| async move {
+        let store = store.subgraph_store();
+        let unvalidated = resolve_unvalidated(YAML).await;
+        assert!(unvalidated
+            .validate(store.clone(), true)
+            .await
+            .expect_err("Validation must fail")
+            .into_iter()
+            .find(|e| {
+                matches!(
+                    e,
+                    SubgraphManifestValidationError::FeatureValidationError(_)
+                )
+            })
+            .is_none());
+        let manifest = resolve_manifest(YAML, SPEC_VERSION_0_0_4).await;
+        assert!(manifest.features.contains(&SubgraphFeature::Grafting))
+    })
+}
+
+#[test]
+fn declared_non_fatal_errors_feature_causes_no_feature_validation_errors() {
+    const YAML: &str = "
+specVersion: 0.0.4
+features:
+  - nonFatalErrors
+dataSources: []
+schema:
+  file:
+    /: /ipfs/Qmschema
+";
+    test_store::run_test_sequentially(|store| async move {
+        let store = store.subgraph_store();
+        let unvalidated = resolve_unvalidated(YAML).await;
+        assert!(unvalidated
+            .validate(store.clone(), true)
+            .await
+            .expect_err("Validation must fail")
+            .into_iter()
+            .find(|e| {
+                matches!(
+                    e,
+                    SubgraphManifestValidationError::FeatureValidationError(_)
+                )
+            })
+            .is_none());
+
+        let manifest = resolve_manifest(YAML, SPEC_VERSION_0_0_4).await;
+        assert!(manifest.features.contains(&SubgraphFeature::NonFatalErrors))
+    });
+}
+
+#[test]
+fn declared_full_text_search_feature_causes_no_feature_validation_errors() {
+    const YAML: &str = "
+specVersion: 0.0.4
+features:
+  - fullTextSearch
+dataSources: []
+schema:
+  file:
+    /: /ipfs/Qmschema
+";
+
+    test_store::run_test_sequentially(|store| async move {
+        let store = store.subgraph_store();
+        let unvalidated: UnvalidatedSubgraphManifest<Chain> = {
+            let mut resolver = TextResolver::default();
+            let id = DeploymentHash::new("Qmmanifest").unwrap();
+            resolver.add(id.as_str(), &YAML);
+            resolver.add("/ipfs/Qmabi", &ABI);
+            resolver.add("/ipfs/Qmschema", &GQL_SCHEMA_FULLTEXT);
+
+            let resolver: Arc<dyn LinkResolverTrait> = Arc::new(resolver);
+
+            let raw = serde_yaml::from_str(YAML).unwrap();
+            UnvalidatedSubgraphManifest::resolve(
+                id,
+                raw,
+                &resolver,
+                &LOGGER,
+                SPEC_VERSION_0_0_4.clone(),
+            )
+            .await
+            .expect("Parsing simple manifest works")
+        };
+
+        assert!(unvalidated
+            .validate(store.clone(), true)
+            .await
+            .expect_err("Validation must fail")
+            .into_iter()
+            .find(|e| {
+                matches!(
+                    e,
+                    SubgraphManifestValidationError::FeatureValidationError(_)
+                )
+            })
+            .is_none());
+
+        let manifest = resolve_manifest(YAML, SPEC_VERSION_0_0_4).await;
+        assert!(manifest.features.contains(&SubgraphFeature::FullTextSearch))
+    });
+}
+
+#[test]
+fn undeclared_full_text_search_feature_causes_no_feature_validation_errors() {
+    const YAML: &str = "
+specVersion: 0.0.4
+
+dataSources: []
+schema:
+  file:
+    /: /ipfs/Qmschema
+";
+
+    test_store::run_test_sequentially(|store| async move {
+        let store = store.subgraph_store();
+        let unvalidated: UnvalidatedSubgraphManifest<Chain> = {
+            let mut resolver = TextResolver::default();
+            let id = DeploymentHash::new("Qmmanifest").unwrap();
+            resolver.add(id.as_str(), &YAML);
+            resolver.add("/ipfs/Qmabi", &ABI);
+            resolver.add("/ipfs/Qmschema", &GQL_SCHEMA_FULLTEXT);
+
+            let resolver: Arc<dyn LinkResolverTrait> = Arc::new(resolver);
+
+            let raw = serde_yaml::from_str(YAML).unwrap();
+            UnvalidatedSubgraphManifest::resolve(
+                id,
+                raw,
+                &resolver,
+                &LOGGER,
+                SPEC_VERSION_0_0_4.clone(),
+            )
+            .await
+            .expect("Parsing simple manifest works")
+        };
+
+        let error_msg = unvalidated
+            .validate(store.clone(), true)
+            .await
+            .expect_err("Validation must fail")
+            .into_iter()
+            .find(|e| {
+                matches!(
+                    e,
+                    SubgraphManifestValidationError::FeatureValidationError(_)
+                )
+            })
+            .expect("There must be a FeatureValidationError")
+            .to_string();
+
+        assert_eq!(
+            "The feature `fullTextSearch` is used by the subgraph but it is not declared in the manifest.",
+            error_msg
+        );
+    });
+}
+
+#[test]
+fn undeclared_ipfs_on_ethereum_contracts_feature_causes_feature_validation_error() {
+    const YAML: &str = "
+specVersion: 0.0.4
+schema:
+  file:
+    /: /ipfs/Qmschema
+dataSources:
+  - kind: ethereum/contract
+    name: Factory
+    network: mainnet
+    source:
+      abi: Factory
+      startBlock: 9562480
+    mapping:
+      kind: ethereum/events
+      apiVersion: 0.0.4
+      language: wasm/assemblyscript
+      entities:
+        - TestEntity
+      file:
+        /: /ipfs/Qmmapping
+      abis:
+        - name: Factory
+          file:
+            /: /ipfs/Qmabi
+      callHandlers:
+        - function: get(address)
+          handler: handleget
+";
+
+    test_store::run_test_sequentially(|store| async move {
+        let store = store.subgraph_store();
+        let unvalidated: UnvalidatedSubgraphManifest<Chain> = {
+            let mut resolver = TextResolver::default();
+            let id = DeploymentHash::new("Qmmanifest").unwrap();
+            resolver.add(id.as_str(), &YAML);
+            resolver.add("/ipfs/Qmabi", &ABI);
+            resolver.add("/ipfs/Qmschema", &GQL_SCHEMA);
+            resolver.add("/ipfs/Qmmapping", &MAPPING_WITH_IPFS_FUNC_WASM);
+
+            let resolver: Arc<dyn LinkResolverTrait> = Arc::new(resolver);
+
+            let raw = serde_yaml::from_str(YAML).unwrap();
+            UnvalidatedSubgraphManifest::resolve(
+                id,
+                raw,
+                &resolver,
+                &LOGGER,
+                SPEC_VERSION_0_0_4.clone(),
+            )
+            .await
+            .expect("Parsing simple manifest works")
+        };
+
+        let error_msg = unvalidated
+            .validate(store.clone(), true)
+            .await
+            .expect_err("Validation must fail")
+            .into_iter()
+            .find(|e| {
+                matches!(
+                    e,
+                    SubgraphManifestValidationError::FeatureValidationError(_)
+                )
+            })
+            .expect("There must be a FeatureValidationError")
+            .to_string();
+
+        assert_eq!(
+            "The feature `ipfsOnEthereumContracts` is used by the subgraph but it is not declared in the manifest.",
+            error_msg
+        );
+    });
+}
+
+#[test]
+fn declared_ipfs_on_ethereum_contracts_feature_causes_no_errors() {
+    const YAML: &str = "
+specVersion: 0.0.4
+schema:
+  file:
+    /: /ipfs/Qmschema
+features:
+  - ipfsOnEthereumContracts
+dataSources:
+  - kind: ethereum/contract
+    name: Factory
+    network: mainnet
+    source:
+      abi: Factory
+      startBlock: 9562480
+    mapping:
+      kind: ethereum/events
+      apiVersion: 0.0.4
+      language: wasm/assemblyscript
+      entities:
+        - TestEntity
+      file:
+        /: /ipfs/Qmmapping
+      abis:
+        - name: Factory
+          file:
+            /: /ipfs/Qmabi
+      callHandlers:
+        - function: get(address)
+          handler: handleget
+";
+
+    test_store::run_test_sequentially(|store| async move {
+        let store = store.subgraph_store();
+        let unvalidated: UnvalidatedSubgraphManifest<Chain> = {
+            let mut resolver = TextResolver::default();
+            let id = DeploymentHash::new("Qmmanifest").unwrap();
+            resolver.add(id.as_str(), &YAML);
+            resolver.add("/ipfs/Qmabi", &ABI);
+            resolver.add("/ipfs/Qmschema", &GQL_SCHEMA);
+            resolver.add("/ipfs/Qmmapping", &MAPPING_WITH_IPFS_FUNC_WASM);
+
+            let resolver: Arc<dyn LinkResolverTrait> = Arc::new(resolver);
+
+            let raw = serde_yaml::from_str(YAML).unwrap();
+            UnvalidatedSubgraphManifest::resolve(
+                id,
+                raw,
+                &resolver,
+                &LOGGER,
+                SPEC_VERSION_0_0_4.clone(),
+            )
+            .await
+            .expect("Parsing simple manifest works")
+        };
+
+        assert!(unvalidated
+            .validate(store.clone(), true)
+            .await
+            .expect_err("Validation must fail")
+            .into_iter()
+            .find(|e| {
+                matches!(
+                    e,
+                    SubgraphManifestValidationError::FeatureValidationError(_)
+                )
+            })
+            .is_none());
+    });
+}
+
+#[test]
+fn can_detect_features_in_subgraphs_with_spec_version_lesser_than_0_0_4() {
+    const YAML: &str = "
+specVersion: 0.0.2
+features:
+  - nonFatalErrors
+dataSources: []
+schema:
+  file:
+    /: /ipfs/Qmschema
+";
+    test_store::run_test_sequentially(|store| async move {
+        let store = store.subgraph_store();
+        let unvalidated = resolve_unvalidated(YAML).await;
+        assert!(unvalidated
+            .validate(store.clone(), true)
+            .await
+            .expect_err("Validation must fail")
+            .into_iter()
+            .find(|e| {
+                matches!(
+                    e,
+                    SubgraphManifestValidationError::FeatureValidationError(_)
+                )
+            })
+            .is_none());
+
+        let manifest = resolve_manifest(YAML, SPEC_VERSION_0_0_4).await;
+        assert!(manifest.features.contains(&SubgraphFeature::NonFatalErrors))
+    });
+}
diff --git a/chain/near/Cargo.toml b/chain/near/Cargo.toml
new file mode 100644
index 0000000..e61b560
--- /dev/null
+++ b/chain/near/Cargo.toml
@@ -0,0 +1,20 @@
+[package]
+name = "graph-chain-near"
+version = "0.27.0"
+edition = "2021"
+
+[build-dependencies]
+tonic-build = { version = "0.7.1", features = ["prost"] }
+
+[dependencies]
+base64 = "0.13"
+graph = { path = "../../graph" }
+prost = "0.10.1"
+prost-types = "0.10.1"
+serde = "1.0"
+
+graph-runtime-wasm = { path = "../../runtime/wasm" }
+graph-runtime-derive = { path = "../../runtime/derive" }
+
+[dev-dependencies]
+diesel = { version = "1.4.7", features = ["postgres", "serde_json", "numeric", "r2d2"] }
diff --git a/chain/near/build.rs b/chain/near/build.rs
new file mode 100644
index 0000000..73c33ef
--- /dev/null
+++ b/chain/near/build.rs
@@ -0,0 +1,7 @@
+fn main() {
+    println!("cargo:rerun-if-changed=proto");
+    tonic_build::configure()
+        .out_dir("src/protobuf")
+        .compile(&["proto/codec.proto"], &["proto"])
+        .expect("Failed to compile Firehose NEAR proto(s)");
+}
diff --git a/chain/near/proto/codec.proto b/chain/near/proto/codec.proto
new file mode 100644
index 0000000..22a0267
--- /dev/null
+++ b/chain/near/proto/codec.proto
@@ -0,0 +1,521 @@
+syntax = "proto3";
+
+package sf.near.codec.v1;
+
+option go_package = "github.com/streamingfast/sf-near/pb/sf/near/codec/v1;pbcodec";
+
+message Block {
+  string author = 1;
+  BlockHeader header = 2;
+  repeated ChunkHeader chunk_headers = 3;
+  repeated IndexerShard shards = 4;
+  repeated StateChangeWithCause state_changes = 5;
+}
+
+// HeaderOnlyBlock is a standard [Block] structure where all other fields are
+// removed so that hydrating that object from a [Block] bytes payload will
+// drastically reduced allocated memory required to hold the full block.
+//
+// This can be used to unpack a [Block] when only the [BlockHeader] information
+// is required and greatly reduced required memory.
+message HeaderOnlyBlock {
+  BlockHeader header = 2;
+}
+
+message StateChangeWithCause {
+  StateChangeValue value = 1;
+  StateChangeCause cause = 2;
+}
+
+message StateChangeCause {
+  oneof cause {
+    NotWritableToDisk not_writable_to_disk = 1;
+    InitialState initial_state = 2;
+    TransactionProcessing  transaction_processing = 3;
+    ActionReceiptProcessingStarted action_receipt_processing_started = 4;
+    ActionReceiptGasReward action_receipt_gas_reward = 5;
+    ReceiptProcessing receipt_processing = 6;
+    PostponedReceipt postponed_receipt = 7;
+    UpdatedDelayedReceipts updated_delayed_receipts = 8;
+    ValidatorAccountsUpdate validator_accounts_update = 9;
+    Migration migration = 10;
+  }
+
+  message NotWritableToDisk {}
+  message InitialState {}
+  message TransactionProcessing {CryptoHash tx_hash = 1;}
+  message ActionReceiptProcessingStarted {CryptoHash receipt_hash = 1;}
+  message ActionReceiptGasReward {CryptoHash tx_hash = 1;}
+  message ReceiptProcessing {CryptoHash tx_hash = 1;}
+  message PostponedReceipt {CryptoHash tx_hash = 1;}
+  message UpdatedDelayedReceipts {}
+  message ValidatorAccountsUpdate {}
+  message Migration {}
+}
+
+message StateChangeValue {
+  oneof value {
+    AccountUpdate account_update = 1;
+    AccountDeletion account_deletion = 2;
+    AccessKeyUpdate access_key_update = 3;
+    AccessKeyDeletion access_key_deletion = 4;
+    DataUpdate data_update = 5;
+    DataDeletion data_deletion = 6;
+    ContractCodeUpdate contract_code_update = 7;
+    ContractCodeDeletion contract_deletion = 8;
+  }
+
+  message AccountUpdate {string account_id = 1; Account account = 2;}
+  message AccountDeletion {string account_id = 1;}
+  message AccessKeyUpdate {
+    string account_id = 1;
+    PublicKey public_key = 2;
+    AccessKey access_key = 3;
+  }
+  message AccessKeyDeletion {
+    string account_id = 1;
+    PublicKey public_key = 2;
+  }
+  message DataUpdate {
+    string account_id = 1;
+    bytes key = 2;
+    bytes value = 3;
+  }
+  message DataDeletion {
+    string account_id = 1;
+    bytes key = 2;
+  }
+  message ContractCodeUpdate {
+    string account_id = 1;
+    bytes code = 2;
+  }
+  message ContractCodeDeletion {
+    string account_id = 1;
+  }
+}
+
+message Account {
+  BigInt amount = 1;
+  BigInt locked = 2;
+  CryptoHash code_hash = 3;
+  uint64 storage_usage = 4;
+}
+
+message BlockHeader {
+  uint64 height = 1;
+  uint64 prev_height = 2;
+  CryptoHash epoch_id = 3;
+  CryptoHash next_epoch_id = 4;
+  CryptoHash hash = 5;
+  CryptoHash prev_hash = 6;
+  CryptoHash prev_state_root = 7;
+  CryptoHash chunk_receipts_root = 8;
+  CryptoHash chunk_headers_root = 9;
+  CryptoHash chunk_tx_root = 10;
+  CryptoHash outcome_root = 11;
+  uint64 chunks_included = 12;
+  CryptoHash challenges_root = 13;
+  uint64 timestamp = 14;
+  uint64 timestamp_nanosec = 15;
+  CryptoHash random_value = 16;
+  repeated ValidatorStake validator_proposals = 17;
+  repeated bool chunk_mask = 18;
+  BigInt gas_price = 19;
+  uint64 block_ordinal = 20;
+  BigInt total_supply = 21;
+  repeated SlashedValidator challenges_result = 22;
+  uint64 last_final_block_height = 23;
+  CryptoHash last_final_block = 24;
+  uint64 last_ds_final_block_height = 25;
+  CryptoHash last_ds_final_block = 26;
+  CryptoHash next_bp_hash = 27;
+  CryptoHash block_merkle_root = 28;
+  bytes epoch_sync_data_hash = 29;
+  repeated Signature approvals = 30;
+  Signature signature = 31;
+  uint32 latest_protocol_version = 32;
+}
+
+message BigInt {
+  bytes bytes = 1;
+}
+message CryptoHash {
+  bytes bytes = 1;
+}
+
+enum CurveKind {
+  ED25519 = 0;
+  SECP256K1 = 1;
+}
+
+message Signature {
+  CurveKind type = 1;
+  bytes bytes = 2;
+}
+
+message PublicKey {
+  CurveKind type = 1;
+  bytes bytes = 2;
+}
+
+message ValidatorStake {
+  string account_id = 1;
+  PublicKey public_key = 2;
+  BigInt stake = 3;
+}
+
+message SlashedValidator {
+  string account_id = 1;
+  bool is_double_sign = 2;
+}
+
+message ChunkHeader {
+  bytes chunk_hash = 1;
+  bytes prev_block_hash = 2;
+  bytes outcome_root = 3;
+  bytes prev_state_root = 4;
+  bytes encoded_merkle_root = 5;
+  uint64 encoded_length = 6;
+  uint64 height_created = 7;
+  uint64 height_included = 8;
+  uint64 shard_id = 9;
+  uint64 gas_used = 10;
+  uint64 gas_limit = 11;
+  BigInt validator_reward = 12;
+  BigInt balance_burnt = 13;
+  bytes outgoing_receipts_root = 14;
+  bytes tx_root = 15;
+  repeated ValidatorStake validator_proposals = 16;
+  Signature signature = 17;
+}
+
+message IndexerShard {
+  uint64 shard_id = 1;
+  IndexerChunk chunk = 2;
+  repeated IndexerExecutionOutcomeWithReceipt receipt_execution_outcomes = 3;
+}
+
+message IndexerExecutionOutcomeWithReceipt {
+  ExecutionOutcomeWithId execution_outcome = 1;
+  Receipt receipt = 2;
+}
+
+message IndexerChunk {
+  string author = 1;
+  ChunkHeader header = 2;
+  repeated IndexerTransactionWithOutcome transactions = 3;
+  repeated Receipt receipts = 4;
+}
+
+message IndexerTransactionWithOutcome {
+  SignedTransaction transaction = 1;
+  IndexerExecutionOutcomeWithOptionalReceipt outcome = 2;
+}
+
+message SignedTransaction {
+  string signer_id = 1;
+  PublicKey public_key = 2;
+  uint64 nonce = 3;
+  string receiver_id = 4;
+  repeated Action actions = 5;
+  Signature signature = 6;
+  CryptoHash hash = 7;
+}
+
+message IndexerExecutionOutcomeWithOptionalReceipt {
+  ExecutionOutcomeWithId execution_outcome = 1;
+  Receipt receipt = 2;
+}
+
+message Receipt {
+  string predecessor_id = 1;
+  string receiver_id = 2;
+  CryptoHash receipt_id = 3;
+
+  oneof receipt {
+    ReceiptAction action = 10;
+    ReceiptData data = 11;
+  }
+}
+
+message ReceiptData {
+  CryptoHash data_id = 1;
+  bytes data = 2;
+}
+
+message ReceiptAction {
+  string signer_id = 1;
+  PublicKey signer_public_key = 2;
+  BigInt gas_price = 3;
+  repeated DataReceiver output_data_receivers = 4;
+  repeated CryptoHash input_data_ids = 5;
+  repeated Action actions = 6;
+}
+
+message DataReceiver {
+  CryptoHash data_id = 1;
+  string receiver_id = 2;
+}
+
+message ExecutionOutcomeWithId {
+  MerklePath proof = 1;
+  CryptoHash block_hash = 2;
+  CryptoHash id = 3;
+  ExecutionOutcome outcome = 4;
+}
+
+message ExecutionOutcome {
+  repeated string logs = 1;
+  repeated CryptoHash receipt_ids = 2;
+  uint64 gas_burnt = 3;
+  BigInt tokens_burnt = 4;
+  string executor_id = 5;
+  oneof status {
+    UnknownExecutionStatus unknown = 20;
+    FailureExecutionStatus failure = 21;
+    SuccessValueExecutionStatus success_value = 22;
+    SuccessReceiptIdExecutionStatus success_receipt_id = 23;
+  }
+  ExecutionMetadata metadata = 6;
+}
+
+enum ExecutionMetadata {
+  ExecutionMetadataV1 = 0;
+}
+
+message SuccessValueExecutionStatus {
+  bytes value = 1;
+}
+
+message SuccessReceiptIdExecutionStatus {
+  CryptoHash id = 1;
+}
+
+message UnknownExecutionStatus {}
+message FailureExecutionStatus {
+  oneof failure {
+    ActionError action_error = 1;
+    InvalidTxError invalid_tx_error = 2;
+  }
+}
+
+message ActionError {
+  uint64 index = 1;
+  oneof kind {
+    AccountAlreadyExistsErrorKind account_already_exist = 21;
+    AccountDoesNotExistErrorKind account_does_not_exist = 22;
+    CreateAccountOnlyByRegistrarErrorKind create_account_only_by_registrar = 23;
+    CreateAccountNotAllowedErrorKind create_account_not_allowed = 24;
+    ActorNoPermissionErrorKind actor_no_permission =25;
+    DeleteKeyDoesNotExistErrorKind  delete_key_does_not_exist = 26;
+    AddKeyAlreadyExistsErrorKind  add_key_already_exists = 27;
+    DeleteAccountStakingErrorKind delete_account_staking = 28;
+    LackBalanceForStateErrorKind lack_balance_for_state = 29;
+    TriesToUnstakeErrorKind tries_to_unstake = 30;
+    TriesToStakeErrorKind tries_to_stake = 31;
+    InsufficientStakeErrorKind insufficient_stake = 32;
+    FunctionCallErrorKind function_call = 33;
+    NewReceiptValidationErrorKind new_receipt_validation = 34;
+    OnlyImplicitAccountCreationAllowedErrorKind only_implicit_account_creation_allowed = 35;
+    DeleteAccountWithLargeStateErrorKind delete_account_with_large_state = 36;
+  }
+}
+
+message AccountAlreadyExistsErrorKind {
+  string account_id = 1;
+}
+
+message AccountDoesNotExistErrorKind {
+  string account_id = 1;
+}
+
+/// A top-level account ID can only be created by registrar.
+message CreateAccountOnlyByRegistrarErrorKind{
+  string account_id = 1;
+  string  registrar_account_id = 2;
+  string predecessor_id = 3;
+}
+
+message CreateAccountNotAllowedErrorKind{
+  string account_id = 1;
+  string  predecessor_id = 2;
+}
+
+message ActorNoPermissionErrorKind{
+  string account_id = 1;
+  string actor_id = 2;
+}
+
+message DeleteKeyDoesNotExistErrorKind{
+  string account_id = 1;
+  PublicKey public_key = 2;
+}
+
+message AddKeyAlreadyExistsErrorKind{
+  string account_id = 1;
+  PublicKey public_key = 2;
+}
+
+message DeleteAccountStakingErrorKind{
+  string account_id = 1;
+}
+
+message LackBalanceForStateErrorKind{
+  string account_id = 1;
+  BigInt balance = 2;
+}
+
+message TriesToUnstakeErrorKind{
+  string account_id = 1;
+}
+
+message TriesToStakeErrorKind{
+  string account_id = 1;
+  BigInt stake = 2;
+  BigInt locked = 3;
+  BigInt balance = 4;
+}
+
+message InsufficientStakeErrorKind{
+  string account_id = 1;
+  BigInt stake = 2;
+  BigInt minimum_stake = 3;
+}
+
+message FunctionCallErrorKind {
+  FunctionCallErrorSer error = 1;
+}
+
+enum FunctionCallErrorSer { //todo: add more detail?
+  CompilationError = 0;
+  LinkError = 1;
+  MethodResolveError = 2;
+  WasmTrap = 3;
+  WasmUnknownError = 4;
+  HostError = 5;
+  _EVMError = 6;
+  ExecutionError = 7;
+}
+
+message NewReceiptValidationErrorKind {
+  ReceiptValidationError error = 1;
+}
+
+enum ReceiptValidationError { //todo: add more detail?
+  InvalidPredecessorId = 0;
+  InvalidReceiverAccountId = 1;
+  InvalidSignerAccountId = 2;
+  InvalidDataReceiverId = 3;
+  ReturnedValueLengthExceeded = 4;
+  NumberInputDataDependenciesExceeded = 5;
+  ActionsValidationError = 6;
+}
+
+message OnlyImplicitAccountCreationAllowedErrorKind{
+  string account_id = 1;
+}
+
+message DeleteAccountWithLargeStateErrorKind{
+  string account_id = 1;
+}
+
+enum InvalidTxError { //todo: add more detail?
+  InvalidAccessKeyError = 0;
+  InvalidSignerId = 1;
+  SignerDoesNotExist = 2;
+  InvalidNonce = 3;
+  NonceTooLarge = 4;
+  InvalidReceiverId = 5;
+  InvalidSignature = 6;
+  NotEnoughBalance = 7;
+  LackBalanceForState = 8;
+  CostOverflow = 9;
+  InvalidChain = 10;
+  Expired = 11;
+  ActionsValidation = 12;
+  TransactionSizeExceeded = 13;
+}
+
+message MerklePath {
+  repeated MerklePathItem path = 1;
+}
+
+message MerklePathItem {
+  CryptoHash hash = 1;
+  Direction direction = 2;
+}
+
+enum Direction {
+  left = 0;
+  right = 1;
+}
+
+message Action {
+  oneof action {
+    CreateAccountAction create_account = 1;
+    DeployContractAction deploy_contract = 2;
+    FunctionCallAction function_call = 3;
+    TransferAction transfer = 4;
+    StakeAction stake = 5;
+    AddKeyAction add_key = 6;
+    DeleteKeyAction delete_key = 7;
+    DeleteAccountAction delete_account = 8;
+  }
+}
+
+message CreateAccountAction {
+}
+
+message DeployContractAction {
+  bytes code = 1;
+}
+
+message FunctionCallAction {
+  string method_name = 1;
+  bytes args = 2;
+  uint64 gas = 3;
+  BigInt deposit = 4;
+}
+
+message TransferAction {
+  BigInt deposit = 1;
+}
+
+message StakeAction {
+  BigInt stake = 1;
+  PublicKey public_key = 2;
+}
+
+message AddKeyAction {
+  PublicKey public_key = 1;
+  AccessKey access_key = 2;
+}
+
+message DeleteKeyAction {
+  PublicKey public_key = 1;
+}
+
+message DeleteAccountAction {
+  string beneficiary_id = 1;
+}
+
+message AccessKey {
+  uint64 nonce = 1;
+  AccessKeyPermission permission = 2;
+}
+
+message AccessKeyPermission {
+  oneof permission {
+    FunctionCallPermission function_call = 1;
+    FullAccessPermission full_access = 2;
+  }
+}
+
+message FunctionCallPermission {
+  BigInt allowance = 1;
+  string receiver_id = 2;
+  repeated  string method_names = 3;
+}
+
+message FullAccessPermission {
+}
diff --git a/chain/near/src/adapter.rs b/chain/near/src/adapter.rs
new file mode 100644
index 0000000..1b39692
--- /dev/null
+++ b/chain/near/src/adapter.rs
@@ -0,0 +1,355 @@
+use std::collections::HashSet;
+
+use crate::capabilities::NodeCapabilities;
+use crate::data_source::PartialAccounts;
+use crate::{data_source::DataSource, Chain};
+use graph::blockchain as bc;
+use graph::firehose::{BasicReceiptFilter, PrefixSuffixPair};
+use graph::prelude::*;
+use prost::Message;
+use prost_types::Any;
+
+const BASIC_RECEIPT_FILTER_TYPE_URL: &str =
+    "type.googleapis.com/sf.near.transform.v1.BasicReceiptFilter";
+
+#[derive(Clone, Debug, Default)]
+pub struct TriggerFilter {
+    pub(crate) block_filter: NearBlockFilter,
+    pub(crate) receipt_filter: NearReceiptFilter,
+}
+
+impl bc::TriggerFilter<Chain> for TriggerFilter {
+    fn extend<'a>(&mut self, data_sources: impl Iterator<Item = &'a DataSource> + Clone) {
+        let TriggerFilter {
+            block_filter,
+            receipt_filter,
+        } = self;
+
+        block_filter.extend(NearBlockFilter::from_data_sources(data_sources.clone()));
+        receipt_filter.extend(NearReceiptFilter::from_data_sources(data_sources));
+    }
+
+    fn node_capabilities(&self) -> NodeCapabilities {
+        NodeCapabilities {}
+    }
+
+    fn extend_with_template(
+        &mut self,
+        _data_source: impl Iterator<Item = <Chain as bc::Blockchain>::DataSourceTemplate>,
+    ) {
+    }
+
+    fn to_firehose_filter(self) -> Vec<prost_types::Any> {
+        let TriggerFilter {
+            block_filter: block,
+            receipt_filter: receipt,
+        } = self;
+
+        if block.trigger_every_block {
+            return vec![];
+        }
+
+        if receipt.is_empty() {
+            return vec![];
+        }
+
+        let filter = BasicReceiptFilter {
+            accounts: receipt.accounts.into_iter().collect(),
+            prefix_and_suffix_pairs: receipt
+                .partial_accounts
+                .iter()
+                .map(|(prefix, suffix)| PrefixSuffixPair {
+                    prefix: prefix.clone().unwrap_or("".to_string()),
+                    suffix: suffix.clone().unwrap_or("".to_string()),
+                })
+                .collect(),
+        };
+
+        vec![Any {
+            type_url: BASIC_RECEIPT_FILTER_TYPE_URL.into(),
+            value: filter.encode_to_vec(),
+        }]
+    }
+}
+
+pub(crate) type Account = String;
+
+/// NearReceiptFilter requires the account to be set, it will match every receipt where `source.account` is the recipient.
+/// see docs: https://thegraph.com/docs/en/supported-networks/near/
+#[derive(Clone, Debug, Default)]
+pub(crate) struct NearReceiptFilter {
+    pub accounts: HashSet<Account>,
+    pub partial_accounts: HashSet<(Option<String>, Option<String>)>,
+}
+
+impl NearReceiptFilter {
+    pub fn matches(&self, account: &String) -> bool {
+        let NearReceiptFilter {
+            accounts,
+            partial_accounts,
+        } = self;
+
+        if accounts.contains(account) {
+            return true;
+        }
+
+        partial_accounts.iter().any(|partial| match partial {
+            (Some(prefix), Some(suffix)) => {
+                account.starts_with(prefix) && account.ends_with(suffix)
+            }
+            (Some(prefix), None) => account.starts_with(prefix),
+            (None, Some(suffix)) => account.ends_with(suffix),
+            (None, None) => unreachable!(),
+        })
+    }
+
+    pub fn is_empty(&self) -> bool {
+        let NearReceiptFilter {
+            accounts,
+            partial_accounts,
+        } = self;
+
+        accounts.is_empty() && partial_accounts.is_empty()
+    }
+
+    pub fn from_data_sources<'a>(iter: impl IntoIterator<Item = &'a DataSource>) -> Self {
+        struct Source {
+            account: Option<String>,
+            partial_accounts: Option<PartialAccounts>,
+        }
+
+        // Select any ds with either partial or exact accounts.
+        let sources: Vec<Source> = iter
+            .into_iter()
+            .filter(|data_source| {
+                (data_source.source.account.is_some() || data_source.source.accounts.is_some())
+                    && !data_source.mapping.receipt_handlers.is_empty()
+            })
+            .map(|ds| Source {
+                account: ds.source.account.clone(),
+                partial_accounts: ds.source.accounts.clone(),
+            })
+            .collect();
+
+        // Handle exact matches
+        let accounts: Vec<String> = sources
+            .iter()
+            .filter(|s| s.account.is_some())
+            .map(|s| s.account.as_ref().cloned().unwrap())
+            .collect();
+
+        // Parse all the partial accounts, produces all possible combinations of the values
+        // eg:
+        // prefix [a,b] and suffix [d] would produce [a,d], [b,d]
+        // prefix [a] and suffix [c,d] would produce [a,c], [a,d]
+        // prefix [] and suffix [c, d] would produce [None, c], [None, d]
+        // prefix [a,b] and suffix [] would produce [a, None], [b, None]
+        let partial_accounts: Vec<(Option<String>, Option<String>)> = sources
+            .iter()
+            .filter(|s| s.partial_accounts.is_some())
+            .map(|s| {
+                let partials = s.partial_accounts.as_ref().unwrap();
+
+                let mut pairs: Vec<(Option<String>, Option<String>)> = vec![];
+                let prefixes: Vec<Option<String>> = if partials.prefixes.is_empty() {
+                    vec![None]
+                } else {
+                    partials
+                        .prefixes
+                        .iter()
+                        .filter(|s| !s.is_empty())
+                        .map(|s| Some(s.clone()))
+                        .collect()
+                };
+
+                let suffixes: Vec<Option<String>> = if partials.suffixes.is_empty() {
+                    vec![None]
+                } else {
+                    partials
+                        .suffixes
+                        .iter()
+                        .filter(|s| !s.is_empty())
+                        .map(|s| Some(s.clone()))
+                        .collect()
+                };
+
+                for prefix in prefixes.into_iter() {
+                    for suffix in suffixes.iter() {
+                        pairs.push((prefix.clone(), suffix.clone()))
+                    }
+                }
+
+                pairs
+            })
+            .flatten()
+            .collect();
+
+        Self {
+            accounts: HashSet::from_iter(accounts),
+            partial_accounts: HashSet::from_iter(partial_accounts),
+        }
+    }
+
+    pub fn extend(&mut self, other: NearReceiptFilter) {
+        let NearReceiptFilter {
+            accounts,
+            partial_accounts,
+        } = self;
+
+        accounts.extend(other.accounts);
+        partial_accounts.extend(other.partial_accounts);
+    }
+}
+
+/// NearBlockFilter will match every block regardless of source being set.
+/// see docs: https://thegraph.com/docs/en/supported-networks/near/
+#[derive(Clone, Debug, Default)]
+pub(crate) struct NearBlockFilter {
+    pub trigger_every_block: bool,
+}
+
+impl NearBlockFilter {
+    pub fn from_data_sources<'a>(iter: impl IntoIterator<Item = &'a DataSource>) -> Self {
+        Self {
+            trigger_every_block: iter
+                .into_iter()
+                .any(|data_source| !data_source.mapping.block_handlers.is_empty()),
+        }
+    }
+
+    pub fn extend(&mut self, other: NearBlockFilter) {
+        self.trigger_every_block = self.trigger_every_block || other.trigger_every_block;
+    }
+}
+
+#[cfg(test)]
+mod test {
+    use std::collections::HashSet;
+
+    use super::NearBlockFilter;
+    use crate::adapter::{TriggerFilter, BASIC_RECEIPT_FILTER_TYPE_URL};
+    use graph::{
+        blockchain::TriggerFilter as _,
+        firehose::{BasicReceiptFilter, PrefixSuffixPair},
+    };
+    use prost::Message;
+    use prost_types::Any;
+
+    #[test]
+    fn near_trigger_empty_filter() {
+        let filter = TriggerFilter {
+            block_filter: NearBlockFilter {
+                trigger_every_block: false,
+            },
+            receipt_filter: super::NearReceiptFilter {
+                accounts: HashSet::new(),
+                partial_accounts: HashSet::new(),
+            },
+        };
+        assert_eq!(filter.to_firehose_filter(), vec![]);
+    }
+
+    #[test]
+    fn near_trigger_filter_match_all_block() {
+        let filter = TriggerFilter {
+            block_filter: NearBlockFilter {
+                trigger_every_block: true,
+            },
+            receipt_filter: super::NearReceiptFilter {
+                accounts: HashSet::from_iter(vec!["acc1".into(), "acc2".into(), "acc3".into()]),
+                partial_accounts: HashSet::new(),
+            },
+        };
+
+        let filter = filter.to_firehose_filter();
+        assert_eq!(filter.len(), 0);
+    }
+
+    #[test]
+    fn near_trigger_filter() {
+        let filter = TriggerFilter {
+            block_filter: NearBlockFilter {
+                trigger_every_block: false,
+            },
+            receipt_filter: super::NearReceiptFilter {
+                accounts: HashSet::from_iter(vec!["acc1".into(), "acc2".into(), "acc3".into()]),
+                partial_accounts: HashSet::new(),
+            },
+        };
+
+        let filter = filter.to_firehose_filter();
+        assert_eq!(filter.len(), 1);
+
+        let firehose_filter = decode_filter(filter);
+
+        assert_eq!(
+            firehose_filter.accounts,
+            vec![
+                String::from("acc1"),
+                String::from("acc2"),
+                String::from("acc3")
+            ],
+        );
+    }
+
+    #[test]
+    fn near_trigger_partial_filter() {
+        let filter = TriggerFilter {
+            block_filter: NearBlockFilter {
+                trigger_every_block: false,
+            },
+            receipt_filter: super::NearReceiptFilter {
+                accounts: HashSet::from_iter(vec!["acc1".into()]),
+                partial_accounts: HashSet::from_iter(vec![
+                    (Some("acc1".into()), None),
+                    (None, Some("acc2".into())),
+                    (Some("acc3".into()), Some("acc4".into())),
+                ]),
+            },
+        };
+
+        let filter = filter.to_firehose_filter();
+        assert_eq!(filter.len(), 1);
+
+        let firehose_filter = decode_filter(filter);
+        assert_eq!(firehose_filter.accounts, vec![String::from("acc1"),],);
+
+        let expected_pairs = vec![
+            PrefixSuffixPair {
+                prefix: "acc3".to_string(),
+                suffix: "acc4".to_string(),
+            },
+            PrefixSuffixPair {
+                prefix: "".to_string(),
+                suffix: "acc2".to_string(),
+            },
+            PrefixSuffixPair {
+                prefix: "acc1".to_string(),
+                suffix: "".to_string(),
+            },
+        ];
+
+        let pairs = firehose_filter.prefix_and_suffix_pairs;
+        assert_eq!(pairs.len(), 3);
+        assert_eq!(
+            true,
+            expected_pairs.iter().all(|x| pairs.contains(x)),
+            "{:?}",
+            pairs
+        );
+    }
+
+    fn decode_filter(firehose_filter: Vec<Any>) -> BasicReceiptFilter {
+        let firehose_filter = firehose_filter[0].clone();
+        assert_eq!(
+            firehose_filter.type_url,
+            String::from(BASIC_RECEIPT_FILTER_TYPE_URL),
+        );
+        let mut bytes = &firehose_filter.value[..];
+        let mut firehose_filter =
+            BasicReceiptFilter::decode(&mut bytes).expect("unable to parse basic receipt filter");
+        firehose_filter.accounts.sort();
+
+        firehose_filter
+    }
+}
diff --git a/chain/near/src/capabilities.rs b/chain/near/src/capabilities.rs
new file mode 100644
index 0000000..0d84c9c
--- /dev/null
+++ b/chain/near/src/capabilities.rs
@@ -0,0 +1,37 @@
+use graph::{anyhow::Error, impl_slog_value};
+use std::cmp::{Ordering, PartialOrd};
+use std::fmt;
+use std::str::FromStr;
+
+use crate::data_source::DataSource;
+
+#[derive(Clone, Copy, Debug, PartialEq, Eq)]
+pub struct NodeCapabilities {}
+
+impl PartialOrd for NodeCapabilities {
+    fn partial_cmp(&self, _other: &Self) -> Option<Ordering> {
+        None
+    }
+}
+
+impl FromStr for NodeCapabilities {
+    type Err = Error;
+
+    fn from_str(_s: &str) -> Result<Self, Self::Err> {
+        Ok(NodeCapabilities {})
+    }
+}
+
+impl fmt::Display for NodeCapabilities {
+    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
+        f.write_str("near")
+    }
+}
+
+impl_slog_value!(NodeCapabilities, "{}");
+
+impl graph::blockchain::NodeCapabilities<crate::Chain> for NodeCapabilities {
+    fn from_data_sources(_data_sources: &[DataSource]) -> Self {
+        NodeCapabilities {}
+    }
+}
diff --git a/chain/near/src/chain.rs b/chain/near/src/chain.rs
new file mode 100644
index 0000000..226a915
--- /dev/null
+++ b/chain/near/src/chain.rs
@@ -0,0 +1,912 @@
+use graph::blockchain::BlockchainKind;
+use graph::cheap_clone::CheapClone;
+use graph::data::subgraph::UnifiedMappingApiVersion;
+use graph::firehose::{FirehoseEndpoint, FirehoseEndpoints};
+use graph::prelude::{MetricsRegistry, TryFutureExt};
+use graph::{
+    anyhow,
+    anyhow::Result,
+    blockchain::{
+        block_stream::{
+            BlockStreamEvent, BlockWithTriggers, FirehoseError,
+            FirehoseMapper as FirehoseMapperTrait, TriggersAdapter as TriggersAdapterTrait,
+        },
+        firehose_block_stream::FirehoseBlockStream,
+        BlockHash, BlockPtr, Blockchain, IngestorError, RuntimeAdapter as RuntimeAdapterTrait,
+    },
+    components::store::DeploymentLocator,
+    firehose::{self as firehose, ForkStep},
+    prelude::{async_trait, o, BlockNumber, ChainStore, Error, Logger, LoggerFactory},
+};
+use prost::Message;
+use std::sync::Arc;
+
+use crate::adapter::TriggerFilter;
+use crate::capabilities::NodeCapabilities;
+use crate::data_source::{DataSourceTemplate, UnresolvedDataSourceTemplate};
+use crate::runtime::RuntimeAdapter;
+use crate::trigger::{self, NearTrigger};
+use crate::{
+    codec,
+    data_source::{DataSource, UnresolvedDataSource},
+};
+use graph::blockchain::block_stream::{BlockStream, BlockStreamBuilder, FirehoseCursor};
+
+pub struct NearStreamBuilder {}
+
+#[async_trait]
+impl BlockStreamBuilder<Chain> for NearStreamBuilder {
+    async fn build_firehose(
+        &self,
+        chain: &Chain,
+        deployment: DeploymentLocator,
+        block_cursor: FirehoseCursor,
+        start_blocks: Vec<BlockNumber>,
+        subgraph_current_block: Option<BlockPtr>,
+        filter: Arc<<Chain as Blockchain>::TriggerFilter>,
+        unified_api_version: UnifiedMappingApiVersion,
+    ) -> Result<Box<dyn BlockStream<Chain>>> {
+        let adapter = chain
+            .triggers_adapter(&deployment, &NodeCapabilities {}, unified_api_version)
+            .expect(&format!("no adapter for network {}", chain.name,));
+
+        let firehose_endpoint = match chain.firehose_endpoints.random() {
+            Some(e) => e.clone(),
+            None => return Err(anyhow::format_err!("no firehose endpoint available")),
+        };
+
+        let logger = chain
+            .logger_factory
+            .subgraph_logger(&deployment)
+            .new(o!("component" => "FirehoseBlockStream"));
+
+        let firehose_mapper = Arc::new(FirehoseMapper {
+            endpoint: firehose_endpoint.cheap_clone(),
+        });
+
+        Ok(Box::new(FirehoseBlockStream::new(
+            deployment.hash,
+            firehose_endpoint,
+            subgraph_current_block,
+            block_cursor,
+            firehose_mapper,
+            adapter,
+            filter,
+            start_blocks,
+            logger,
+            chain.metrics_registry.clone(),
+        )))
+    }
+
+    async fn build_polling(
+        &self,
+        _chain: Arc<Chain>,
+        _deployment: DeploymentLocator,
+        _start_blocks: Vec<BlockNumber>,
+        _subgraph_current_block: Option<BlockPtr>,
+        _filter: Arc<<Chain as Blockchain>::TriggerFilter>,
+        _unified_api_version: UnifiedMappingApiVersion,
+    ) -> Result<Box<dyn BlockStream<Chain>>> {
+        todo!()
+    }
+}
+
+pub struct Chain {
+    logger_factory: LoggerFactory,
+    name: String,
+    firehose_endpoints: Arc<FirehoseEndpoints>,
+    chain_store: Arc<dyn ChainStore>,
+    metrics_registry: Arc<dyn MetricsRegistry>,
+    block_stream_builder: Arc<dyn BlockStreamBuilder<Self>>,
+}
+
+impl std::fmt::Debug for Chain {
+    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
+        write!(f, "chain: near")
+    }
+}
+
+impl Chain {
+    pub fn new(
+        logger_factory: LoggerFactory,
+        name: String,
+        chain_store: Arc<dyn ChainStore>,
+        firehose_endpoints: FirehoseEndpoints,
+        metrics_registry: Arc<dyn MetricsRegistry>,
+        block_stream_builder: Arc<dyn BlockStreamBuilder<Self>>,
+    ) -> Self {
+        Chain {
+            logger_factory,
+            name,
+            firehose_endpoints: Arc::new(firehose_endpoints),
+            chain_store,
+            metrics_registry,
+            block_stream_builder,
+        }
+    }
+}
+
+#[async_trait]
+impl Blockchain for Chain {
+    const KIND: BlockchainKind = BlockchainKind::Near;
+
+    type Block = codec::Block;
+
+    type DataSource = DataSource;
+
+    type UnresolvedDataSource = UnresolvedDataSource;
+
+    type DataSourceTemplate = DataSourceTemplate;
+
+    type UnresolvedDataSourceTemplate = UnresolvedDataSourceTemplate;
+
+    type TriggerData = crate::trigger::NearTrigger;
+
+    type MappingTrigger = crate::trigger::NearTrigger;
+
+    type TriggerFilter = crate::adapter::TriggerFilter;
+
+    type NodeCapabilities = crate::capabilities::NodeCapabilities;
+
+    fn triggers_adapter(
+        &self,
+        _loc: &DeploymentLocator,
+        _capabilities: &Self::NodeCapabilities,
+        _unified_api_version: UnifiedMappingApiVersion,
+    ) -> Result<Arc<dyn TriggersAdapterTrait<Self>>, Error> {
+        let adapter = TriggersAdapter {};
+        Ok(Arc::new(adapter))
+    }
+
+    async fn new_firehose_block_stream(
+        &self,
+        deployment: DeploymentLocator,
+        block_cursor: FirehoseCursor,
+        start_blocks: Vec<BlockNumber>,
+        subgraph_current_block: Option<BlockPtr>,
+        filter: Arc<Self::TriggerFilter>,
+        unified_api_version: UnifiedMappingApiVersion,
+    ) -> Result<Box<dyn BlockStream<Self>>, Error> {
+        self.block_stream_builder
+            .build_firehose(
+                self,
+                deployment,
+                block_cursor,
+                start_blocks,
+                subgraph_current_block,
+                filter,
+                unified_api_version,
+            )
+            .await
+    }
+
+    async fn new_polling_block_stream(
+        &self,
+        _deployment: DeploymentLocator,
+        _start_blocks: Vec<BlockNumber>,
+        _subgraph_current_block: Option<BlockPtr>,
+        _filter: Arc<Self::TriggerFilter>,
+        _unified_api_version: UnifiedMappingApiVersion,
+    ) -> Result<Box<dyn BlockStream<Self>>, Error> {
+        panic!("NEAR does not support polling block stream")
+    }
+
+    fn chain_store(&self) -> Arc<dyn ChainStore> {
+        self.chain_store.clone()
+    }
+
+    async fn block_pointer_from_number(
+        &self,
+        logger: &Logger,
+        number: BlockNumber,
+    ) -> Result<BlockPtr, IngestorError> {
+        let firehose_endpoint = match self.firehose_endpoints.random() {
+            Some(e) => e.clone(),
+            None => return Err(anyhow::format_err!("no firehose endpoint available").into()),
+        };
+
+        firehose_endpoint
+            .block_ptr_for_number::<codec::HeaderOnlyBlock>(logger, number)
+            .map_err(Into::into)
+            .await
+    }
+
+    fn runtime_adapter(&self) -> Arc<dyn RuntimeAdapterTrait<Self>> {
+        Arc::new(RuntimeAdapter {})
+    }
+
+    fn is_firehose_supported(&self) -> bool {
+        true
+    }
+}
+
+pub struct TriggersAdapter {}
+
+#[async_trait]
+impl TriggersAdapterTrait<Chain> for TriggersAdapter {
+    async fn scan_triggers(
+        &self,
+        _from: BlockNumber,
+        _to: BlockNumber,
+        _filter: &TriggerFilter,
+    ) -> Result<Vec<BlockWithTriggers<Chain>>, Error> {
+        panic!("Should never be called since not used by FirehoseBlockStream")
+    }
+
+    async fn triggers_in_block(
+        &self,
+        _logger: &Logger,
+        block: codec::Block,
+        filter: &TriggerFilter,
+    ) -> Result<BlockWithTriggers<Chain>, Error> {
+        // TODO: Find the best place to introduce an `Arc` and avoid this clone.
+        let shared_block = Arc::new(block.clone());
+
+        let TriggerFilter {
+            block_filter,
+            receipt_filter,
+        } = filter;
+
+        // Filter non-successful or non-action receipts.
+        let receipts = block.shards.iter().flat_map(|shard| {
+            shard
+                .receipt_execution_outcomes
+                .iter()
+                .filter_map(|outcome| {
+                    if !outcome
+                        .execution_outcome
+                        .as_ref()?
+                        .outcome
+                        .as_ref()?
+                        .status
+                        .as_ref()?
+                        .is_success()
+                    {
+                        return None;
+                    }
+                    if !matches!(
+                        outcome.receipt.as_ref()?.receipt,
+                        Some(codec::receipt::Receipt::Action(_))
+                    ) {
+                        return None;
+                    }
+
+                    let receipt = outcome.receipt.as_ref()?.clone();
+                    if !receipt_filter.matches(&receipt.receiver_id) {
+                        return None;
+                    }
+
+                    Some(trigger::ReceiptWithOutcome {
+                        outcome: outcome.execution_outcome.as_ref()?.clone(),
+                        receipt,
+                        block: shared_block.cheap_clone(),
+                    })
+                })
+        });
+
+        let mut trigger_data: Vec<_> = receipts
+            .map(|r| NearTrigger::Receipt(Arc::new(r)))
+            .collect();
+
+        if block_filter.trigger_every_block {
+            trigger_data.push(NearTrigger::Block(shared_block.cheap_clone()));
+        }
+
+        Ok(BlockWithTriggers::new(block, trigger_data))
+    }
+
+    async fn is_on_main_chain(&self, _ptr: BlockPtr) -> Result<bool, Error> {
+        panic!("Should never be called since not used by FirehoseBlockStream")
+    }
+
+    async fn ancestor_block(
+        &self,
+        _ptr: BlockPtr,
+        _offset: BlockNumber,
+    ) -> Result<Option<codec::Block>, Error> {
+        panic!("Should never be called since FirehoseBlockStream cannot resolve it")
+    }
+
+    /// Panics if `block` is genesis.
+    /// But that's ok since this is only called when reverting `block`.
+    async fn parent_ptr(&self, block: &BlockPtr) -> Result<Option<BlockPtr>, Error> {
+        // FIXME (NEAR):  Might not be necessary for NEAR support for now
+        Ok(Some(BlockPtr {
+            hash: BlockHash::from(vec![0xff; 32]),
+            number: block.number.saturating_sub(1),
+        }))
+    }
+}
+
+pub struct FirehoseMapper {
+    endpoint: Arc<FirehoseEndpoint>,
+}
+
+#[async_trait]
+impl FirehoseMapperTrait<Chain> for FirehoseMapper {
+    async fn to_block_stream_event(
+        &self,
+        logger: &Logger,
+        response: &firehose::Response,
+        adapter: &Arc<dyn TriggersAdapterTrait<Chain>>,
+        filter: &TriggerFilter,
+    ) -> Result<BlockStreamEvent<Chain>, FirehoseError> {
+        let step = ForkStep::from_i32(response.step).unwrap_or_else(|| {
+            panic!(
+                "unknown step i32 value {}, maybe you forgot update & re-regenerate the protobuf definitions?",
+                response.step
+            )
+        });
+
+        let any_block = response
+            .block
+            .as_ref()
+            .expect("block payload information should always be present");
+
+        // Right now, this is done in all cases but in reality, with how the BlockStreamEvent::Revert
+        // is defined right now, only block hash and block number is necessary. However, this information
+        // is not part of the actual bstream::BlockResponseV2 payload. As such, we need to decode the full
+        // block which is useless.
+        //
+        // Check about adding basic information about the block in the bstream::BlockResponseV2 or maybe
+        // define a slimmed down stuct that would decode only a few fields and ignore all the rest.
+        let block = codec::Block::decode(any_block.value.as_ref())?;
+
+        use ForkStep::*;
+        match step {
+            StepNew => Ok(BlockStreamEvent::ProcessBlock(
+                adapter.triggers_in_block(logger, block, filter).await?,
+                FirehoseCursor::from(response.cursor.clone()),
+            )),
+
+            StepUndo => {
+                let parent_ptr = block
+                    .header()
+                    .parent_ptr()
+                    .expect("Genesis block should never be reverted");
+
+                Ok(BlockStreamEvent::Revert(
+                    parent_ptr,
+                    FirehoseCursor::from(response.cursor.clone()),
+                ))
+            }
+
+            StepIrreversible => {
+                panic!("irreversible step is not handled and should not be requested in the Firehose request")
+            }
+
+            StepUnknown => {
+                panic!("unknown step should not happen in the Firehose response")
+            }
+        }
+    }
+
+    async fn block_ptr_for_number(
+        &self,
+        logger: &Logger,
+        number: BlockNumber,
+    ) -> Result<BlockPtr, Error> {
+        self.endpoint
+            .block_ptr_for_number::<codec::HeaderOnlyBlock>(logger, number)
+            .await
+    }
+
+    async fn final_block_ptr_for(
+        &self,
+        logger: &Logger,
+        block: &codec::Block,
+    ) -> Result<BlockPtr, Error> {
+        let final_block_number = block.header().last_final_block_height as BlockNumber;
+
+        self.endpoint
+            .block_ptr_for_number::<codec::HeaderOnlyBlock>(logger, final_block_number)
+            .await
+    }
+}
+
+#[cfg(test)]
+mod test {
+    use std::{collections::HashSet, sync::Arc, vec};
+
+    use graph::{
+        blockchain::{block_stream::BlockWithTriggers, DataSource as _, TriggersAdapter as _},
+        prelude::{tokio, Link},
+        semver::Version,
+        slog::{self, o, Logger},
+    };
+
+    use crate::{
+        adapter::{NearReceiptFilter, TriggerFilter},
+        codec::{
+            self, execution_outcome, receipt, Block, BlockHeader, DataReceiver, ExecutionOutcome,
+            ExecutionOutcomeWithId, IndexerExecutionOutcomeWithReceipt, IndexerShard,
+            ReceiptAction, SuccessValueExecutionStatus,
+        },
+        data_source::{DataSource, Mapping, PartialAccounts, ReceiptHandler, NEAR_KIND},
+        trigger::{NearTrigger, ReceiptWithOutcome},
+        Chain,
+    };
+
+    use super::TriggersAdapter;
+
+    #[test]
+    fn validate_empty() {
+        let ds = new_data_source(None, None);
+        let errs = ds.validate();
+        assert_eq!(errs.len(), 1, "{:?}", ds);
+        assert_eq!(errs[0].to_string(), "subgraph source address is required");
+    }
+
+    #[test]
+    fn validate_empty_account_none_partial() {
+        let ds = new_data_source(None, Some(PartialAccounts::default()));
+        let errs = ds.validate();
+        assert_eq!(errs.len(), 1, "{:?}", ds);
+        assert_eq!(errs[0].to_string(), "subgraph source address is required");
+    }
+
+    #[test]
+    fn validate_empty_account() {
+        let ds = new_data_source(
+            None,
+            Some(PartialAccounts {
+                prefixes: vec![],
+                suffixes: vec!["x.near".to_string()],
+            }),
+        );
+        let errs = ds.validate();
+        assert_eq!(errs.len(), 0, "{:?}", ds);
+    }
+
+    #[test]
+    fn validate_empty_prefix_and_suffix_values() {
+        let ds = new_data_source(
+            None,
+            Some(PartialAccounts {
+                prefixes: vec!["".to_string()],
+                suffixes: vec!["".to_string()],
+            }),
+        );
+        let errs: Vec<String> = ds
+            .validate()
+            .into_iter()
+            .map(|err| err.to_string())
+            .collect();
+        assert_eq!(errs.len(), 2, "{:?}", ds);
+
+        let expected_errors = vec![
+            "partial account prefixes can't have empty values".to_string(),
+            "partial account suffixes can't have empty values".to_string(),
+        ];
+        assert_eq!(
+            true,
+            expected_errors.iter().all(|err| errs.contains(err)),
+            "{:?}",
+            errs
+        );
+    }
+
+    #[test]
+    fn validate_empty_partials() {
+        let ds = new_data_source(Some("x.near".to_string()), None);
+        let errs = ds.validate();
+        assert_eq!(errs.len(), 0, "{:?}", ds);
+    }
+
+    #[test]
+    fn receipt_filter_from_ds() {
+        struct Case {
+            name: String,
+            account: Option<String>,
+            partial_accounts: Option<PartialAccounts>,
+            expected: HashSet<(Option<String>, Option<String>)>,
+        }
+
+        let cases = vec![
+            Case {
+                name: "2 prefix && 1 suffix".into(),
+                account: None,
+                partial_accounts: Some(PartialAccounts {
+                    prefixes: vec!["a".to_string(), "b".to_string()],
+                    suffixes: vec!["d".to_string()],
+                }),
+                expected: HashSet::from_iter(vec![
+                    (Some("a".to_string()), Some("d".to_string())),
+                    (Some("b".to_string()), Some("d".to_string())),
+                ]),
+            },
+            Case {
+                name: "1 prefix && 2 suffix".into(),
+                account: None,
+                partial_accounts: Some(PartialAccounts {
+                    prefixes: vec!["a".to_string()],
+                    suffixes: vec!["c".to_string(), "d".to_string()],
+                }),
+                expected: HashSet::from_iter(vec![
+                    (Some("a".to_string()), Some("c".to_string())),
+                    (Some("a".to_string()), Some("d".to_string())),
+                ]),
+            },
+            Case {
+                name: "no prefix".into(),
+                account: None,
+                partial_accounts: Some(PartialAccounts {
+                    prefixes: vec![],
+                    suffixes: vec!["c".to_string(), "d".to_string()],
+                }),
+                expected: HashSet::from_iter(vec![
+                    (None, Some("c".to_string())),
+                    (None, Some("d".to_string())),
+                ]),
+            },
+            Case {
+                name: "no suffix".into(),
+                account: None,
+                partial_accounts: Some(PartialAccounts {
+                    prefixes: vec!["a".to_string(), "b".to_string()],
+                    suffixes: vec![],
+                }),
+                expected: HashSet::from_iter(vec![
+                    (Some("a".to_string()), None),
+                    (Some("b".to_string()), None),
+                ]),
+            },
+        ];
+
+        for case in cases.into_iter() {
+            let ds1 = new_data_source(case.account, None);
+            let ds2 = new_data_source(None, case.partial_accounts);
+
+            let receipt = NearReceiptFilter::from_data_sources(vec![&ds1, &ds2]);
+            assert_eq!(
+                receipt.partial_accounts.len(),
+                case.expected.len(),
+                "name: {}\npartial_accounts: {:?}",
+                case.name,
+                receipt.partial_accounts,
+            );
+            assert_eq!(
+                true,
+                case.expected
+                    .iter()
+                    .all(|x| receipt.partial_accounts.contains(&x)),
+                "name: {}\npartial_accounts: {:?}",
+                case.name,
+                receipt.partial_accounts,
+            );
+        }
+    }
+
+    #[test]
+    fn data_source_match_and_decode() {
+        struct Request {
+            account: String,
+            matches: bool,
+        }
+        struct Case {
+            name: String,
+            account: Option<String>,
+            partial_accounts: Option<PartialAccounts>,
+            expected: Vec<Request>,
+        }
+
+        let cases = vec![
+            Case {
+                name: "2 prefix && 1 suffix".into(),
+                account: None,
+                partial_accounts: Some(PartialAccounts {
+                    prefixes: vec!["a".to_string(), "b".to_string()],
+                    suffixes: vec!["d".to_string()],
+                }),
+                expected: vec![
+                    Request {
+                        account: "ssssssd".to_string(),
+                        matches: false,
+                    },
+                    Request {
+                        account: "asasdasdas".to_string(),
+                        matches: false,
+                    },
+                    Request {
+                        account: "asd".to_string(),
+                        matches: true,
+                    },
+                    Request {
+                        account: "bsd".to_string(),
+                        matches: true,
+                    },
+                ],
+            },
+            Case {
+                name: "1 prefix && 2 suffix".into(),
+                account: None,
+                partial_accounts: Some(PartialAccounts {
+                    prefixes: vec!["a".to_string()],
+                    suffixes: vec!["c".to_string(), "d".to_string()],
+                }),
+                expected: vec![
+                    Request {
+                        account: "ssssssd".to_string(),
+                        matches: false,
+                    },
+                    Request {
+                        account: "asasdasdas".to_string(),
+                        matches: false,
+                    },
+                    Request {
+                        account: "asdc".to_string(),
+                        matches: true,
+                    },
+                    Request {
+                        account: "absd".to_string(),
+                        matches: true,
+                    },
+                ],
+            },
+            Case {
+                name: "no prefix with exact match".into(),
+                account: Some("bsda".to_string()),
+                partial_accounts: Some(PartialAccounts {
+                    prefixes: vec![],
+                    suffixes: vec!["c".to_string(), "d".to_string()],
+                }),
+                expected: vec![
+                    Request {
+                        account: "ssssss".to_string(),
+                        matches: false,
+                    },
+                    Request {
+                        account: "asasdasdas".to_string(),
+                        matches: false,
+                    },
+                    Request {
+                        account: "asdasdasdasdc".to_string(),
+                        matches: true,
+                    },
+                    Request {
+                        account: "bsd".to_string(),
+                        matches: true,
+                    },
+                    Request {
+                        account: "bsda".to_string(),
+                        matches: true,
+                    },
+                ],
+            },
+            Case {
+                name: "no suffix with exact match".into(),
+                account: Some("zbsd".to_string()),
+                partial_accounts: Some(PartialAccounts {
+                    prefixes: vec!["a".to_string(), "b".to_string()],
+                    suffixes: vec![],
+                }),
+                expected: vec![
+                    Request {
+                        account: "ssssssd".to_string(),
+                        matches: false,
+                    },
+                    Request {
+                        account: "zasdasdas".to_string(),
+                        matches: false,
+                    },
+                    Request {
+                        account: "asa".to_string(),
+                        matches: true,
+                    },
+                    Request {
+                        account: "bsb".to_string(),
+                        matches: true,
+                    },
+                    Request {
+                        account: "zbsd".to_string(),
+                        matches: true,
+                    },
+                ],
+            },
+        ];
+
+        let logger = Logger::root(slog::Discard, o!());
+        for case in cases.into_iter() {
+            let ds = new_data_source(case.account, case.partial_accounts);
+            let filter = NearReceiptFilter::from_data_sources(vec![&ds]);
+
+            for req in case.expected {
+                let res = filter.matches(&req.account);
+                assert_eq!(
+                    res, req.matches,
+                    "name: {} request:{} failed",
+                    case.name, req.account
+                );
+
+                let block = Arc::new(new_success_block(11, &req.account));
+                let receipt = Arc::new(new_receipt_with_outcome(&req.account, block.clone()));
+                let res = ds
+                    .match_and_decode(&NearTrigger::Receipt(receipt.clone()), &block, &logger)
+                    .expect("unable to process block");
+                assert_eq!(
+                    req.matches,
+                    res.is_some(),
+                    "case name: {} req: {}",
+                    case.name,
+                    req.account
+                );
+            }
+        }
+    }
+
+    #[tokio::test]
+    async fn test_trigger_filter_empty() {
+        let account1: String = "account1".into();
+
+        let adapter = TriggersAdapter {};
+
+        let logger = Logger::root(slog::Discard, o!());
+        let block1 = new_success_block(1, &account1);
+
+        let filter = TriggerFilter::default();
+
+        let block_with_triggers: BlockWithTriggers<Chain> = adapter
+            .triggers_in_block(&logger, block1, &filter)
+            .await
+            .expect("failed to execute triggers_in_block");
+        assert_eq!(block_with_triggers.trigger_count(), 0);
+    }
+
+    #[tokio::test]
+    async fn test_trigger_filter_every_block() {
+        let account1: String = "account1".into();
+
+        let adapter = TriggersAdapter {};
+
+        let logger = Logger::root(slog::Discard, o!());
+        let block1 = new_success_block(1, &account1);
+
+        let filter = TriggerFilter {
+            block_filter: crate::adapter::NearBlockFilter {
+                trigger_every_block: true,
+            },
+            ..Default::default()
+        };
+
+        let block_with_triggers: BlockWithTriggers<Chain> = adapter
+            .triggers_in_block(&logger, block1, &filter)
+            .await
+            .expect("failed to execute triggers_in_block");
+        assert_eq!(block_with_triggers.trigger_count(), 1);
+
+        let height: Vec<u64> = heights_from_triggers(&block_with_triggers);
+        assert_eq!(height, vec![1]);
+    }
+
+    #[tokio::test]
+    async fn test_trigger_filter_every_receipt() {
+        let account1: String = "account1".into();
+
+        let adapter = TriggersAdapter {};
+
+        let logger = Logger::root(slog::Discard, o!());
+        let block1 = new_success_block(1, &account1);
+
+        let filter = TriggerFilter {
+            receipt_filter: NearReceiptFilter {
+                accounts: HashSet::from_iter(vec![account1]),
+                partial_accounts: HashSet::new(),
+            },
+            ..Default::default()
+        };
+
+        let block_with_triggers: BlockWithTriggers<Chain> = adapter
+            .triggers_in_block(&logger, block1, &filter)
+            .await
+            .expect("failed to execute triggers_in_block");
+        assert_eq!(block_with_triggers.trigger_count(), 1);
+
+        let height: Vec<u64> = heights_from_triggers(&block_with_triggers);
+        assert_eq!(height.len(), 0);
+    }
+
+    fn heights_from_triggers(block: &BlockWithTriggers<Chain>) -> Vec<u64> {
+        block
+            .trigger_data
+            .clone()
+            .into_iter()
+            .filter_map(|x| match x {
+                crate::trigger::NearTrigger::Block(b) => b.header.clone().map(|x| x.height),
+                _ => None,
+            })
+            .collect()
+    }
+
+    fn new_success_block(height: u64, receiver_id: &String) -> codec::Block {
+        codec::Block {
+            header: Some(BlockHeader {
+                height,
+                hash: Some(codec::CryptoHash { bytes: vec![0; 32] }),
+                ..Default::default()
+            }),
+            shards: vec![IndexerShard {
+                receipt_execution_outcomes: vec![IndexerExecutionOutcomeWithReceipt {
+                    receipt: Some(crate::codec::Receipt {
+                        receipt: Some(receipt::Receipt::Action(ReceiptAction {
+                            output_data_receivers: vec![DataReceiver {
+                                receiver_id: receiver_id.clone(),
+                                ..Default::default()
+                            }],
+                            ..Default::default()
+                        })),
+                        receiver_id: receiver_id.clone(),
+                        ..Default::default()
+                    }),
+                    execution_outcome: Some(ExecutionOutcomeWithId {
+                        outcome: Some(ExecutionOutcome {
+                            status: Some(execution_outcome::Status::SuccessValue(
+                                SuccessValueExecutionStatus::default(),
+                            )),
+
+                            ..Default::default()
+                        }),
+                        ..Default::default()
+                    }),
+                }],
+                ..Default::default()
+            }],
+            ..Default::default()
+        }
+    }
+
+    fn new_data_source(
+        account: Option<String>,
+        partial_accounts: Option<PartialAccounts>,
+    ) -> DataSource {
+        DataSource {
+            kind: NEAR_KIND.to_string(),
+            network: None,
+            name: "asd".to_string(),
+            source: crate::data_source::Source {
+                account,
+                start_block: 10,
+                accounts: partial_accounts,
+            },
+            mapping: Mapping {
+                api_version: Version::parse("1.0.0").expect("unable to parse version"),
+                language: "".to_string(),
+                entities: vec![],
+                block_handlers: vec![],
+                receipt_handlers: vec![ReceiptHandler {
+                    handler: "asdsa".to_string(),
+                }],
+                runtime: Arc::new(vec![]),
+                link: Link::default(),
+            },
+            context: Arc::new(None),
+            creation_block: None,
+        }
+    }
+
+    fn new_receipt_with_outcome(receiver_id: &String, block: Arc<Block>) -> ReceiptWithOutcome {
+        ReceiptWithOutcome {
+            outcome: ExecutionOutcomeWithId {
+                outcome: Some(ExecutionOutcome {
+                    status: Some(execution_outcome::Status::SuccessValue(
+                        SuccessValueExecutionStatus::default(),
+                    )),
+
+                    ..Default::default()
+                }),
+                ..Default::default()
+            },
+            receipt: codec::Receipt {
+                receipt: Some(receipt::Receipt::Action(ReceiptAction {
+                    output_data_receivers: vec![DataReceiver {
+                        receiver_id: receiver_id.clone(),
+                        ..Default::default()
+                    }],
+                    ..Default::default()
+                })),
+                receiver_id: receiver_id.clone(),
+                ..Default::default()
+            },
+            block,
+        }
+    }
+}
diff --git a/chain/near/src/codec.rs b/chain/near/src/codec.rs
new file mode 100644
index 0000000..854e9dc
--- /dev/null
+++ b/chain/near/src/codec.rs
@@ -0,0 +1,110 @@
+#[rustfmt::skip]
+#[path = "protobuf/sf.near.codec.v1.rs"]
+pub mod pbcodec;
+
+use graph::{
+    blockchain::Block as BlockchainBlock,
+    blockchain::BlockPtr,
+    prelude::{hex, web3::types::H256, BlockNumber},
+};
+use std::convert::TryFrom;
+use std::fmt::LowerHex;
+
+pub use pbcodec::*;
+
+impl From<&CryptoHash> for H256 {
+    fn from(input: &CryptoHash) -> Self {
+        H256::from_slice(&input.bytes)
+    }
+}
+
+impl LowerHex for &CryptoHash {
+    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
+        f.write_str(&hex::encode(&self.bytes))
+    }
+}
+
+impl BlockHeader {
+    pub fn parent_ptr(&self) -> Option<BlockPtr> {
+        match (self.prev_hash.as_ref(), self.prev_height) {
+            (Some(hash), number) => Some(BlockPtr::from((H256::from(hash), number))),
+            _ => None,
+        }
+    }
+}
+
+impl<'a> From<&'a BlockHeader> for BlockPtr {
+    fn from(b: &'a BlockHeader) -> BlockPtr {
+        BlockPtr::from((H256::from(b.hash.as_ref().unwrap()), b.height))
+    }
+}
+
+impl Block {
+    pub fn header(&self) -> &BlockHeader {
+        self.header.as_ref().unwrap()
+    }
+
+    pub fn ptr(&self) -> BlockPtr {
+        BlockPtr::from(self.header())
+    }
+
+    pub fn parent_ptr(&self) -> Option<BlockPtr> {
+        self.header().parent_ptr()
+    }
+}
+
+impl<'a> From<&'a Block> for BlockPtr {
+    fn from(b: &'a Block) -> BlockPtr {
+        BlockPtr::from(b.header())
+    }
+}
+
+impl BlockchainBlock for Block {
+    fn number(&self) -> i32 {
+        BlockNumber::try_from(self.header().height).unwrap()
+    }
+
+    fn ptr(&self) -> BlockPtr {
+        self.into()
+    }
+
+    fn parent_ptr(&self) -> Option<BlockPtr> {
+        self.parent_ptr()
+    }
+}
+
+impl HeaderOnlyBlock {
+    pub fn header(&self) -> &BlockHeader {
+        self.header.as_ref().unwrap()
+    }
+}
+
+impl<'a> From<&'a HeaderOnlyBlock> for BlockPtr {
+    fn from(b: &'a HeaderOnlyBlock) -> BlockPtr {
+        BlockPtr::from(b.header())
+    }
+}
+
+impl BlockchainBlock for HeaderOnlyBlock {
+    fn number(&self) -> i32 {
+        BlockNumber::try_from(self.header().height).unwrap()
+    }
+
+    fn ptr(&self) -> BlockPtr {
+        self.into()
+    }
+
+    fn parent_ptr(&self) -> Option<BlockPtr> {
+        self.header().parent_ptr()
+    }
+}
+
+impl execution_outcome::Status {
+    pub fn is_success(&self) -> bool {
+        use execution_outcome::Status::*;
+        match self {
+            Unknown(_) | Failure(_) => false,
+            SuccessValue(_) | SuccessReceiptId(_) => true,
+        }
+    }
+}
diff --git a/chain/near/src/data_source.rs b/chain/near/src/data_source.rs
new file mode 100644
index 0000000..c0fa5c6
--- /dev/null
+++ b/chain/near/src/data_source.rs
@@ -0,0 +1,476 @@
+use graph::blockchain::{Block, TriggerWithHandler};
+use graph::components::store::StoredDynamicDataSource;
+use graph::data::subgraph::DataSourceContext;
+use graph::prelude::SubgraphManifestValidationError;
+use graph::{
+    anyhow::{anyhow, Error},
+    blockchain::{self, Blockchain},
+    prelude::{
+        async_trait, info, BlockNumber, CheapClone, DataSourceTemplateInfo, Deserialize, Link,
+        LinkResolver, Logger,
+    },
+    semver,
+};
+use std::{convert::TryFrom, sync::Arc};
+
+use crate::chain::Chain;
+use crate::trigger::{NearTrigger, ReceiptWithOutcome};
+
+pub const NEAR_KIND: &str = "near";
+
+/// Runtime representation of a data source.
+#[derive(Clone, Debug)]
+pub struct DataSource {
+    pub kind: String,
+    pub network: Option<String>,
+    pub name: String,
+    pub(crate) source: Source,
+    pub mapping: Mapping,
+    pub context: Arc<Option<DataSourceContext>>,
+    pub creation_block: Option<BlockNumber>,
+}
+
+impl blockchain::DataSource<Chain> for DataSource {
+    fn address(&self) -> Option<&[u8]> {
+        self.source.account.as_ref().map(String::as_bytes)
+    }
+
+    fn start_block(&self) -> BlockNumber {
+        self.source.start_block
+    }
+
+    fn match_and_decode(
+        &self,
+        trigger: &<Chain as Blockchain>::TriggerData,
+        block: &Arc<<Chain as Blockchain>::Block>,
+        _logger: &Logger,
+    ) -> Result<Option<TriggerWithHandler<Chain>>, Error> {
+        if self.source.start_block > block.number() {
+            return Ok(None);
+        }
+
+        fn account_matches(ds: &DataSource, receipt: &Arc<ReceiptWithOutcome>) -> bool {
+            if Some(&receipt.receipt.receiver_id) == ds.source.account.as_ref() {
+                return true;
+            }
+
+            if let Some(partial_accounts) = &ds.source.accounts {
+                let matches_prefix = if partial_accounts.prefixes.is_empty() {
+                    true
+                } else {
+                    partial_accounts
+                        .prefixes
+                        .iter()
+                        .any(|prefix| receipt.receipt.receiver_id.starts_with(prefix))
+                };
+
+                let matches_suffix = if partial_accounts.suffixes.is_empty() {
+                    true
+                } else {
+                    partial_accounts
+                        .suffixes
+                        .iter()
+                        .any(|suffix| receipt.receipt.receiver_id.ends_with(suffix))
+                };
+
+                if matches_prefix && matches_suffix {
+                    return true;
+                }
+            }
+
+            false
+        }
+
+        let handler = match trigger {
+            // A block trigger matches if a block handler is present.
+            NearTrigger::Block(_) => match self.handler_for_block() {
+                Some(handler) => &handler.handler,
+                None => return Ok(None),
+            },
+
+            // A receipt trigger matches if the receiver matches `source.account` and a receipt
+            // handler is present.
+            NearTrigger::Receipt(receipt) => {
+                if !account_matches(self, receipt) {
+                    return Ok(None);
+                }
+
+                match self.handler_for_receipt() {
+                    Some(handler) => &handler.handler,
+                    None => return Ok(None),
+                }
+            }
+        };
+
+        Ok(Some(TriggerWithHandler::<Chain>::new(
+            trigger.cheap_clone(),
+            handler.to_owned(),
+            block.ptr(),
+        )))
+    }
+
+    fn name(&self) -> &str {
+        &self.name
+    }
+
+    fn kind(&self) -> &str {
+        &self.kind
+    }
+
+    fn network(&self) -> Option<&str> {
+        self.network.as_ref().map(|s| s.as_str())
+    }
+
+    fn context(&self) -> Arc<Option<DataSourceContext>> {
+        self.context.cheap_clone()
+    }
+
+    fn creation_block(&self) -> Option<BlockNumber> {
+        self.creation_block
+    }
+
+    fn is_duplicate_of(&self, other: &Self) -> bool {
+        let DataSource {
+            kind,
+            network,
+            name,
+            source,
+            mapping,
+            context,
+
+            // The creation block is ignored for detection duplicate data sources.
+            // Contract ABI equality is implicit in `source` and `mapping.abis` equality.
+            creation_block: _,
+        } = self;
+
+        // mapping_request_sender, host_metrics, and (most of) host_exports are operational structs
+        // used at runtime but not needed to define uniqueness; each runtime host should be for a
+        // unique data source.
+        kind == &other.kind
+            && network == &other.network
+            && name == &other.name
+            && source == &other.source
+            && mapping.block_handlers == other.mapping.block_handlers
+            && context == &other.context
+    }
+
+    fn as_stored_dynamic_data_source(&self) -> StoredDynamicDataSource {
+        // FIXME (NEAR): Implement me!
+        todo!()
+    }
+
+    fn from_stored_dynamic_data_source(
+        _template: &DataSourceTemplate,
+        _stored: StoredDynamicDataSource,
+    ) -> Result<Self, Error> {
+        // FIXME (NEAR): Implement me correctly
+        todo!()
+    }
+
+    fn validate(&self) -> Vec<Error> {
+        let mut errors = Vec::new();
+
+        if self.kind != NEAR_KIND {
+            errors.push(anyhow!(
+                "data source has invalid `kind`, expected {} but found {}",
+                NEAR_KIND,
+                self.kind
+            ))
+        }
+
+        // Validate that there is a `source` address if there are receipt handlers
+        let no_source_address = self.address().is_none();
+
+        // Validate that there are no empty PartialAccount.
+        let no_partial_addresses = match &self.source.accounts {
+            None => true,
+            Some(addrs) => addrs.is_empty(),
+        };
+
+        let has_receipt_handlers = !self.mapping.receipt_handlers.is_empty();
+
+        // Validate not both address and partial addresses are empty.
+        if (no_source_address && no_partial_addresses) && has_receipt_handlers {
+            errors.push(SubgraphManifestValidationError::SourceAddressRequired.into());
+        };
+
+        // Validate empty lines not allowed in suffix or prefix
+        if let Some(partial_accounts) = self.source.accounts.as_ref() {
+            if partial_accounts.prefixes.iter().any(|x| x.is_empty()) {
+                errors.push(anyhow!("partial account prefixes can't have empty values"))
+            }
+
+            if partial_accounts.suffixes.iter().any(|x| x.is_empty()) {
+                errors.push(anyhow!("partial account suffixes can't have empty values"))
+            }
+        }
+
+        // Validate that there are no more than one of both block handlers and receipt handlers
+        if self.mapping.block_handlers.len() > 1 {
+            errors.push(anyhow!("data source has duplicated block handlers"));
+        }
+        if self.mapping.receipt_handlers.len() > 1 {
+            errors.push(anyhow!("data source has duplicated receipt handlers"));
+        }
+
+        errors
+    }
+
+    fn api_version(&self) -> semver::Version {
+        self.mapping.api_version.clone()
+    }
+
+    fn runtime(&self) -> Option<Arc<Vec<u8>>> {
+        Some(self.mapping.runtime.cheap_clone())
+    }
+}
+
+impl DataSource {
+    fn from_manifest(
+        kind: String,
+        network: Option<String>,
+        name: String,
+        source: Source,
+        mapping: Mapping,
+        context: Option<DataSourceContext>,
+    ) -> Result<Self, Error> {
+        // Data sources in the manifest are created "before genesis" so they have no creation block.
+        let creation_block = None;
+
+        Ok(DataSource {
+            kind,
+            network,
+            name,
+            source,
+            mapping,
+            context: Arc::new(context),
+            creation_block,
+        })
+    }
+
+    fn handler_for_block(&self) -> Option<&MappingBlockHandler> {
+        self.mapping.block_handlers.first()
+    }
+
+    fn handler_for_receipt(&self) -> Option<&ReceiptHandler> {
+        self.mapping.receipt_handlers.first()
+    }
+}
+
+#[derive(Clone, Debug, Eq, PartialEq, Deserialize)]
+pub struct UnresolvedDataSource {
+    pub kind: String,
+    pub network: Option<String>,
+    pub name: String,
+    pub(crate) source: Source,
+    pub mapping: UnresolvedMapping,
+    pub context: Option<DataSourceContext>,
+}
+
+#[async_trait]
+impl blockchain::UnresolvedDataSource<Chain> for UnresolvedDataSource {
+    async fn resolve(
+        self,
+        resolver: &Arc<dyn LinkResolver>,
+        logger: &Logger,
+        _manifest_idx: u32,
+    ) -> Result<DataSource, Error> {
+        let UnresolvedDataSource {
+            kind,
+            network,
+            name,
+            source,
+            mapping,
+            context,
+        } = self;
+
+        info!(logger, "Resolve data source"; "name" => &name, "source_account" => format_args!("{:?}", source.account), "source_start_block" => source.start_block);
+
+        let mapping = mapping.resolve(resolver, logger).await?;
+
+        DataSource::from_manifest(kind, network, name, source, mapping, context)
+    }
+}
+
+impl TryFrom<DataSourceTemplateInfo<Chain>> for DataSource {
+    type Error = Error;
+
+    fn try_from(_info: DataSourceTemplateInfo<Chain>) -> Result<Self, Error> {
+        Err(anyhow!("Near subgraphs do not support templates"))
+
+        // How this might be implemented if/when Near gets support for templates:
+        // let DataSourceTemplateInfo {
+        //     template,
+        //     params,
+        //     context,
+        //     creation_block,
+        // } = info;
+
+        // let account = params
+        //     .get(0)
+        //     .with_context(|| {
+        //         format!(
+        //             "Failed to create data source from template `{}`: account parameter is missing",
+        //             template.name
+        //         )
+        //     })?
+        //     .clone();
+
+        // Ok(DataSource {
+        //     kind: template.kind,
+        //     network: template.network,
+        //     name: template.name,
+        //     source: Source {
+        //         account,
+        //         start_block: 0,
+        //     },
+        //     mapping: template.mapping,
+        //     context: Arc::new(context),
+        //     creation_block: Some(creation_block),
+        // })
+    }
+}
+
+#[derive(Clone, Debug, Default, Hash, Eq, PartialEq, Deserialize)]
+pub struct BaseDataSourceTemplate<M> {
+    pub kind: String,
+    pub network: Option<String>,
+    pub name: String,
+    pub mapping: M,
+}
+
+pub type UnresolvedDataSourceTemplate = BaseDataSourceTemplate<UnresolvedMapping>;
+pub type DataSourceTemplate = BaseDataSourceTemplate<Mapping>;
+
+#[async_trait]
+impl blockchain::UnresolvedDataSourceTemplate<Chain> for UnresolvedDataSourceTemplate {
+    async fn resolve(
+        self,
+        resolver: &Arc<dyn LinkResolver>,
+        logger: &Logger,
+        _manifest_idx: u32,
+    ) -> Result<DataSourceTemplate, Error> {
+        let UnresolvedDataSourceTemplate {
+            kind,
+            network,
+            name,
+            mapping,
+        } = self;
+
+        info!(logger, "Resolve data source template"; "name" => &name);
+
+        Ok(DataSourceTemplate {
+            kind,
+            network,
+            name,
+            mapping: mapping.resolve(resolver, logger).await?,
+        })
+    }
+}
+
+impl blockchain::DataSourceTemplate<Chain> for DataSourceTemplate {
+    fn name(&self) -> &str {
+        &self.name
+    }
+
+    fn api_version(&self) -> semver::Version {
+        self.mapping.api_version.clone()
+    }
+
+    fn runtime(&self) -> Option<Arc<Vec<u8>>> {
+        Some(self.mapping.runtime.cheap_clone())
+    }
+
+    fn manifest_idx(&self) -> u32 {
+        unreachable!("near does not support dynamic data sources")
+    }
+}
+
+#[derive(Clone, Debug, Default, Hash, Eq, PartialEq, Deserialize)]
+#[serde(rename_all = "camelCase")]
+pub struct UnresolvedMapping {
+    pub api_version: String,
+    pub language: String,
+    pub entities: Vec<String>,
+    #[serde(default)]
+    pub block_handlers: Vec<MappingBlockHandler>,
+    #[serde(default)]
+    pub receipt_handlers: Vec<ReceiptHandler>,
+    pub file: Link,
+}
+
+impl UnresolvedMapping {
+    pub async fn resolve(
+        self,
+        resolver: &Arc<dyn LinkResolver>,
+        logger: &Logger,
+    ) -> Result<Mapping, Error> {
+        let UnresolvedMapping {
+            api_version,
+            language,
+            entities,
+            block_handlers,
+            receipt_handlers,
+            file: link,
+        } = self;
+
+        let api_version = semver::Version::parse(&api_version)?;
+
+        info!(logger, "Resolve mapping"; "link" => &link.link);
+        let module_bytes = resolver.cat(logger, &link).await?;
+
+        Ok(Mapping {
+            api_version,
+            language,
+            entities,
+            block_handlers,
+            receipt_handlers,
+            runtime: Arc::new(module_bytes),
+            link,
+        })
+    }
+}
+
+#[derive(Clone, Debug)]
+pub struct Mapping {
+    pub api_version: semver::Version,
+    pub language: String,
+    pub entities: Vec<String>,
+    pub block_handlers: Vec<MappingBlockHandler>,
+    pub receipt_handlers: Vec<ReceiptHandler>,
+    pub runtime: Arc<Vec<u8>>,
+    pub link: Link,
+}
+
+#[derive(Clone, Debug, Hash, Eq, PartialEq, Deserialize)]
+pub struct MappingBlockHandler {
+    pub handler: String,
+}
+
+#[derive(Clone, Debug, Hash, Eq, PartialEq, Deserialize)]
+pub struct ReceiptHandler {
+    pub(crate) handler: String,
+}
+
+#[derive(Clone, Debug, Hash, Eq, PartialEq, Deserialize, Default)]
+pub(crate) struct PartialAccounts {
+    #[serde(default)]
+    pub(crate) prefixes: Vec<String>,
+    #[serde(default)]
+    pub(crate) suffixes: Vec<String>,
+}
+
+impl PartialAccounts {
+    pub fn is_empty(&self) -> bool {
+        self.prefixes.is_empty() && self.suffixes.is_empty()
+    }
+}
+
+#[derive(Clone, Debug, Hash, Eq, PartialEq, Deserialize)]
+pub(crate) struct Source {
+    // A data source that does not have an account or accounts can only have block handlers.
+    pub(crate) account: Option<String>,
+    #[serde(rename = "startBlock", default)]
+    pub(crate) start_block: BlockNumber,
+    pub(crate) accounts: Option<PartialAccounts>,
+}
diff --git a/chain/near/src/lib.rs b/chain/near/src/lib.rs
new file mode 100644
index 0000000..2ab7dd8
--- /dev/null
+++ b/chain/near/src/lib.rs
@@ -0,0 +1,11 @@
+mod adapter;
+mod capabilities;
+mod chain;
+pub mod codec;
+mod data_source;
+mod runtime;
+mod trigger;
+
+pub use crate::chain::Chain;
+pub use crate::chain::NearStreamBuilder;
+pub use codec::HeaderOnlyBlock;
diff --git a/chain/near/src/protobuf/sf.near.codec.v1.rs b/chain/near/src/protobuf/sf.near.codec.v1.rs
new file mode 100644
index 0000000..4a58d01
--- /dev/null
+++ b/chain/near/src/protobuf/sf.near.codec.v1.rs
@@ -0,0 +1,850 @@
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct Block {
+    #[prost(string, tag="1")]
+    pub author: ::prost::alloc::string::String,
+    #[prost(message, optional, tag="2")]
+    pub header: ::core::option::Option<BlockHeader>,
+    #[prost(message, repeated, tag="3")]
+    pub chunk_headers: ::prost::alloc::vec::Vec<ChunkHeader>,
+    #[prost(message, repeated, tag="4")]
+    pub shards: ::prost::alloc::vec::Vec<IndexerShard>,
+    #[prost(message, repeated, tag="5")]
+    pub state_changes: ::prost::alloc::vec::Vec<StateChangeWithCause>,
+}
+/// HeaderOnlyBlock is a standard \[Block\] structure where all other fields are
+/// removed so that hydrating that object from a \[Block\] bytes payload will
+/// drastically reduced allocated memory required to hold the full block.
+///
+/// This can be used to unpack a \[Block\] when only the \[BlockHeader\] information
+/// is required and greatly reduced required memory.
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct HeaderOnlyBlock {
+    #[prost(message, optional, tag="2")]
+    pub header: ::core::option::Option<BlockHeader>,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct StateChangeWithCause {
+    #[prost(message, optional, tag="1")]
+    pub value: ::core::option::Option<StateChangeValue>,
+    #[prost(message, optional, tag="2")]
+    pub cause: ::core::option::Option<StateChangeCause>,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct StateChangeCause {
+    #[prost(oneof="state_change_cause::Cause", tags="1, 2, 3, 4, 5, 6, 7, 8, 9, 10")]
+    pub cause: ::core::option::Option<state_change_cause::Cause>,
+}
+/// Nested message and enum types in `StateChangeCause`.
+pub mod state_change_cause {
+    #[derive(Clone, PartialEq, ::prost::Message)]
+    pub struct NotWritableToDisk {
+    }
+    #[derive(Clone, PartialEq, ::prost::Message)]
+    pub struct InitialState {
+    }
+    #[derive(Clone, PartialEq, ::prost::Message)]
+    pub struct TransactionProcessing {
+        #[prost(message, optional, tag="1")]
+        pub tx_hash: ::core::option::Option<super::CryptoHash>,
+    }
+    #[derive(Clone, PartialEq, ::prost::Message)]
+    pub struct ActionReceiptProcessingStarted {
+        #[prost(message, optional, tag="1")]
+        pub receipt_hash: ::core::option::Option<super::CryptoHash>,
+    }
+    #[derive(Clone, PartialEq, ::prost::Message)]
+    pub struct ActionReceiptGasReward {
+        #[prost(message, optional, tag="1")]
+        pub tx_hash: ::core::option::Option<super::CryptoHash>,
+    }
+    #[derive(Clone, PartialEq, ::prost::Message)]
+    pub struct ReceiptProcessing {
+        #[prost(message, optional, tag="1")]
+        pub tx_hash: ::core::option::Option<super::CryptoHash>,
+    }
+    #[derive(Clone, PartialEq, ::prost::Message)]
+    pub struct PostponedReceipt {
+        #[prost(message, optional, tag="1")]
+        pub tx_hash: ::core::option::Option<super::CryptoHash>,
+    }
+    #[derive(Clone, PartialEq, ::prost::Message)]
+    pub struct UpdatedDelayedReceipts {
+    }
+    #[derive(Clone, PartialEq, ::prost::Message)]
+    pub struct ValidatorAccountsUpdate {
+    }
+    #[derive(Clone, PartialEq, ::prost::Message)]
+    pub struct Migration {
+    }
+    #[derive(Clone, PartialEq, ::prost::Oneof)]
+    pub enum Cause {
+        #[prost(message, tag="1")]
+        NotWritableToDisk(NotWritableToDisk),
+        #[prost(message, tag="2")]
+        InitialState(InitialState),
+        #[prost(message, tag="3")]
+        TransactionProcessing(TransactionProcessing),
+        #[prost(message, tag="4")]
+        ActionReceiptProcessingStarted(ActionReceiptProcessingStarted),
+        #[prost(message, tag="5")]
+        ActionReceiptGasReward(ActionReceiptGasReward),
+        #[prost(message, tag="6")]
+        ReceiptProcessing(ReceiptProcessing),
+        #[prost(message, tag="7")]
+        PostponedReceipt(PostponedReceipt),
+        #[prost(message, tag="8")]
+        UpdatedDelayedReceipts(UpdatedDelayedReceipts),
+        #[prost(message, tag="9")]
+        ValidatorAccountsUpdate(ValidatorAccountsUpdate),
+        #[prost(message, tag="10")]
+        Migration(Migration),
+    }
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct StateChangeValue {
+    #[prost(oneof="state_change_value::Value", tags="1, 2, 3, 4, 5, 6, 7, 8")]
+    pub value: ::core::option::Option<state_change_value::Value>,
+}
+/// Nested message and enum types in `StateChangeValue`.
+pub mod state_change_value {
+    #[derive(Clone, PartialEq, ::prost::Message)]
+    pub struct AccountUpdate {
+        #[prost(string, tag="1")]
+        pub account_id: ::prost::alloc::string::String,
+        #[prost(message, optional, tag="2")]
+        pub account: ::core::option::Option<super::Account>,
+    }
+    #[derive(Clone, PartialEq, ::prost::Message)]
+    pub struct AccountDeletion {
+        #[prost(string, tag="1")]
+        pub account_id: ::prost::alloc::string::String,
+    }
+    #[derive(Clone, PartialEq, ::prost::Message)]
+    pub struct AccessKeyUpdate {
+        #[prost(string, tag="1")]
+        pub account_id: ::prost::alloc::string::String,
+        #[prost(message, optional, tag="2")]
+        pub public_key: ::core::option::Option<super::PublicKey>,
+        #[prost(message, optional, tag="3")]
+        pub access_key: ::core::option::Option<super::AccessKey>,
+    }
+    #[derive(Clone, PartialEq, ::prost::Message)]
+    pub struct AccessKeyDeletion {
+        #[prost(string, tag="1")]
+        pub account_id: ::prost::alloc::string::String,
+        #[prost(message, optional, tag="2")]
+        pub public_key: ::core::option::Option<super::PublicKey>,
+    }
+    #[derive(Clone, PartialEq, ::prost::Message)]
+    pub struct DataUpdate {
+        #[prost(string, tag="1")]
+        pub account_id: ::prost::alloc::string::String,
+        #[prost(bytes="vec", tag="2")]
+        pub key: ::prost::alloc::vec::Vec<u8>,
+        #[prost(bytes="vec", tag="3")]
+        pub value: ::prost::alloc::vec::Vec<u8>,
+    }
+    #[derive(Clone, PartialEq, ::prost::Message)]
+    pub struct DataDeletion {
+        #[prost(string, tag="1")]
+        pub account_id: ::prost::alloc::string::String,
+        #[prost(bytes="vec", tag="2")]
+        pub key: ::prost::alloc::vec::Vec<u8>,
+    }
+    #[derive(Clone, PartialEq, ::prost::Message)]
+    pub struct ContractCodeUpdate {
+        #[prost(string, tag="1")]
+        pub account_id: ::prost::alloc::string::String,
+        #[prost(bytes="vec", tag="2")]
+        pub code: ::prost::alloc::vec::Vec<u8>,
+    }
+    #[derive(Clone, PartialEq, ::prost::Message)]
+    pub struct ContractCodeDeletion {
+        #[prost(string, tag="1")]
+        pub account_id: ::prost::alloc::string::String,
+    }
+    #[derive(Clone, PartialEq, ::prost::Oneof)]
+    pub enum Value {
+        #[prost(message, tag="1")]
+        AccountUpdate(AccountUpdate),
+        #[prost(message, tag="2")]
+        AccountDeletion(AccountDeletion),
+        #[prost(message, tag="3")]
+        AccessKeyUpdate(AccessKeyUpdate),
+        #[prost(message, tag="4")]
+        AccessKeyDeletion(AccessKeyDeletion),
+        #[prost(message, tag="5")]
+        DataUpdate(DataUpdate),
+        #[prost(message, tag="6")]
+        DataDeletion(DataDeletion),
+        #[prost(message, tag="7")]
+        ContractCodeUpdate(ContractCodeUpdate),
+        #[prost(message, tag="8")]
+        ContractDeletion(ContractCodeDeletion),
+    }
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct Account {
+    #[prost(message, optional, tag="1")]
+    pub amount: ::core::option::Option<BigInt>,
+    #[prost(message, optional, tag="2")]
+    pub locked: ::core::option::Option<BigInt>,
+    #[prost(message, optional, tag="3")]
+    pub code_hash: ::core::option::Option<CryptoHash>,
+    #[prost(uint64, tag="4")]
+    pub storage_usage: u64,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct BlockHeader {
+    #[prost(uint64, tag="1")]
+    pub height: u64,
+    #[prost(uint64, tag="2")]
+    pub prev_height: u64,
+    #[prost(message, optional, tag="3")]
+    pub epoch_id: ::core::option::Option<CryptoHash>,
+    #[prost(message, optional, tag="4")]
+    pub next_epoch_id: ::core::option::Option<CryptoHash>,
+    #[prost(message, optional, tag="5")]
+    pub hash: ::core::option::Option<CryptoHash>,
+    #[prost(message, optional, tag="6")]
+    pub prev_hash: ::core::option::Option<CryptoHash>,
+    #[prost(message, optional, tag="7")]
+    pub prev_state_root: ::core::option::Option<CryptoHash>,
+    #[prost(message, optional, tag="8")]
+    pub chunk_receipts_root: ::core::option::Option<CryptoHash>,
+    #[prost(message, optional, tag="9")]
+    pub chunk_headers_root: ::core::option::Option<CryptoHash>,
+    #[prost(message, optional, tag="10")]
+    pub chunk_tx_root: ::core::option::Option<CryptoHash>,
+    #[prost(message, optional, tag="11")]
+    pub outcome_root: ::core::option::Option<CryptoHash>,
+    #[prost(uint64, tag="12")]
+    pub chunks_included: u64,
+    #[prost(message, optional, tag="13")]
+    pub challenges_root: ::core::option::Option<CryptoHash>,
+    #[prost(uint64, tag="14")]
+    pub timestamp: u64,
+    #[prost(uint64, tag="15")]
+    pub timestamp_nanosec: u64,
+    #[prost(message, optional, tag="16")]
+    pub random_value: ::core::option::Option<CryptoHash>,
+    #[prost(message, repeated, tag="17")]
+    pub validator_proposals: ::prost::alloc::vec::Vec<ValidatorStake>,
+    #[prost(bool, repeated, tag="18")]
+    pub chunk_mask: ::prost::alloc::vec::Vec<bool>,
+    #[prost(message, optional, tag="19")]
+    pub gas_price: ::core::option::Option<BigInt>,
+    #[prost(uint64, tag="20")]
+    pub block_ordinal: u64,
+    #[prost(message, optional, tag="21")]
+    pub total_supply: ::core::option::Option<BigInt>,
+    #[prost(message, repeated, tag="22")]
+    pub challenges_result: ::prost::alloc::vec::Vec<SlashedValidator>,
+    #[prost(uint64, tag="23")]
+    pub last_final_block_height: u64,
+    #[prost(message, optional, tag="24")]
+    pub last_final_block: ::core::option::Option<CryptoHash>,
+    #[prost(uint64, tag="25")]
+    pub last_ds_final_block_height: u64,
+    #[prost(message, optional, tag="26")]
+    pub last_ds_final_block: ::core::option::Option<CryptoHash>,
+    #[prost(message, optional, tag="27")]
+    pub next_bp_hash: ::core::option::Option<CryptoHash>,
+    #[prost(message, optional, tag="28")]
+    pub block_merkle_root: ::core::option::Option<CryptoHash>,
+    #[prost(bytes="vec", tag="29")]
+    pub epoch_sync_data_hash: ::prost::alloc::vec::Vec<u8>,
+    #[prost(message, repeated, tag="30")]
+    pub approvals: ::prost::alloc::vec::Vec<Signature>,
+    #[prost(message, optional, tag="31")]
+    pub signature: ::core::option::Option<Signature>,
+    #[prost(uint32, tag="32")]
+    pub latest_protocol_version: u32,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct BigInt {
+    #[prost(bytes="vec", tag="1")]
+    pub bytes: ::prost::alloc::vec::Vec<u8>,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct CryptoHash {
+    #[prost(bytes="vec", tag="1")]
+    pub bytes: ::prost::alloc::vec::Vec<u8>,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct Signature {
+    #[prost(enumeration="CurveKind", tag="1")]
+    pub r#type: i32,
+    #[prost(bytes="vec", tag="2")]
+    pub bytes: ::prost::alloc::vec::Vec<u8>,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct PublicKey {
+    #[prost(enumeration="CurveKind", tag="1")]
+    pub r#type: i32,
+    #[prost(bytes="vec", tag="2")]
+    pub bytes: ::prost::alloc::vec::Vec<u8>,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct ValidatorStake {
+    #[prost(string, tag="1")]
+    pub account_id: ::prost::alloc::string::String,
+    #[prost(message, optional, tag="2")]
+    pub public_key: ::core::option::Option<PublicKey>,
+    #[prost(message, optional, tag="3")]
+    pub stake: ::core::option::Option<BigInt>,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct SlashedValidator {
+    #[prost(string, tag="1")]
+    pub account_id: ::prost::alloc::string::String,
+    #[prost(bool, tag="2")]
+    pub is_double_sign: bool,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct ChunkHeader {
+    #[prost(bytes="vec", tag="1")]
+    pub chunk_hash: ::prost::alloc::vec::Vec<u8>,
+    #[prost(bytes="vec", tag="2")]
+    pub prev_block_hash: ::prost::alloc::vec::Vec<u8>,
+    #[prost(bytes="vec", tag="3")]
+    pub outcome_root: ::prost::alloc::vec::Vec<u8>,
+    #[prost(bytes="vec", tag="4")]
+    pub prev_state_root: ::prost::alloc::vec::Vec<u8>,
+    #[prost(bytes="vec", tag="5")]
+    pub encoded_merkle_root: ::prost::alloc::vec::Vec<u8>,
+    #[prost(uint64, tag="6")]
+    pub encoded_length: u64,
+    #[prost(uint64, tag="7")]
+    pub height_created: u64,
+    #[prost(uint64, tag="8")]
+    pub height_included: u64,
+    #[prost(uint64, tag="9")]
+    pub shard_id: u64,
+    #[prost(uint64, tag="10")]
+    pub gas_used: u64,
+    #[prost(uint64, tag="11")]
+    pub gas_limit: u64,
+    #[prost(message, optional, tag="12")]
+    pub validator_reward: ::core::option::Option<BigInt>,
+    #[prost(message, optional, tag="13")]
+    pub balance_burnt: ::core::option::Option<BigInt>,
+    #[prost(bytes="vec", tag="14")]
+    pub outgoing_receipts_root: ::prost::alloc::vec::Vec<u8>,
+    #[prost(bytes="vec", tag="15")]
+    pub tx_root: ::prost::alloc::vec::Vec<u8>,
+    #[prost(message, repeated, tag="16")]
+    pub validator_proposals: ::prost::alloc::vec::Vec<ValidatorStake>,
+    #[prost(message, optional, tag="17")]
+    pub signature: ::core::option::Option<Signature>,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct IndexerShard {
+    #[prost(uint64, tag="1")]
+    pub shard_id: u64,
+    #[prost(message, optional, tag="2")]
+    pub chunk: ::core::option::Option<IndexerChunk>,
+    #[prost(message, repeated, tag="3")]
+    pub receipt_execution_outcomes: ::prost::alloc::vec::Vec<IndexerExecutionOutcomeWithReceipt>,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct IndexerExecutionOutcomeWithReceipt {
+    #[prost(message, optional, tag="1")]
+    pub execution_outcome: ::core::option::Option<ExecutionOutcomeWithId>,
+    #[prost(message, optional, tag="2")]
+    pub receipt: ::core::option::Option<Receipt>,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct IndexerChunk {
+    #[prost(string, tag="1")]
+    pub author: ::prost::alloc::string::String,
+    #[prost(message, optional, tag="2")]
+    pub header: ::core::option::Option<ChunkHeader>,
+    #[prost(message, repeated, tag="3")]
+    pub transactions: ::prost::alloc::vec::Vec<IndexerTransactionWithOutcome>,
+    #[prost(message, repeated, tag="4")]
+    pub receipts: ::prost::alloc::vec::Vec<Receipt>,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct IndexerTransactionWithOutcome {
+    #[prost(message, optional, tag="1")]
+    pub transaction: ::core::option::Option<SignedTransaction>,
+    #[prost(message, optional, tag="2")]
+    pub outcome: ::core::option::Option<IndexerExecutionOutcomeWithOptionalReceipt>,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct SignedTransaction {
+    #[prost(string, tag="1")]
+    pub signer_id: ::prost::alloc::string::String,
+    #[prost(message, optional, tag="2")]
+    pub public_key: ::core::option::Option<PublicKey>,
+    #[prost(uint64, tag="3")]
+    pub nonce: u64,
+    #[prost(string, tag="4")]
+    pub receiver_id: ::prost::alloc::string::String,
+    #[prost(message, repeated, tag="5")]
+    pub actions: ::prost::alloc::vec::Vec<Action>,
+    #[prost(message, optional, tag="6")]
+    pub signature: ::core::option::Option<Signature>,
+    #[prost(message, optional, tag="7")]
+    pub hash: ::core::option::Option<CryptoHash>,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct IndexerExecutionOutcomeWithOptionalReceipt {
+    #[prost(message, optional, tag="1")]
+    pub execution_outcome: ::core::option::Option<ExecutionOutcomeWithId>,
+    #[prost(message, optional, tag="2")]
+    pub receipt: ::core::option::Option<Receipt>,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct Receipt {
+    #[prost(string, tag="1")]
+    pub predecessor_id: ::prost::alloc::string::String,
+    #[prost(string, tag="2")]
+    pub receiver_id: ::prost::alloc::string::String,
+    #[prost(message, optional, tag="3")]
+    pub receipt_id: ::core::option::Option<CryptoHash>,
+    #[prost(oneof="receipt::Receipt", tags="10, 11")]
+    pub receipt: ::core::option::Option<receipt::Receipt>,
+}
+/// Nested message and enum types in `Receipt`.
+pub mod receipt {
+    #[derive(Clone, PartialEq, ::prost::Oneof)]
+    pub enum Receipt {
+        #[prost(message, tag="10")]
+        Action(super::ReceiptAction),
+        #[prost(message, tag="11")]
+        Data(super::ReceiptData),
+    }
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct ReceiptData {
+    #[prost(message, optional, tag="1")]
+    pub data_id: ::core::option::Option<CryptoHash>,
+    #[prost(bytes="vec", tag="2")]
+    pub data: ::prost::alloc::vec::Vec<u8>,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct ReceiptAction {
+    #[prost(string, tag="1")]
+    pub signer_id: ::prost::alloc::string::String,
+    #[prost(message, optional, tag="2")]
+    pub signer_public_key: ::core::option::Option<PublicKey>,
+    #[prost(message, optional, tag="3")]
+    pub gas_price: ::core::option::Option<BigInt>,
+    #[prost(message, repeated, tag="4")]
+    pub output_data_receivers: ::prost::alloc::vec::Vec<DataReceiver>,
+    #[prost(message, repeated, tag="5")]
+    pub input_data_ids: ::prost::alloc::vec::Vec<CryptoHash>,
+    #[prost(message, repeated, tag="6")]
+    pub actions: ::prost::alloc::vec::Vec<Action>,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct DataReceiver {
+    #[prost(message, optional, tag="1")]
+    pub data_id: ::core::option::Option<CryptoHash>,
+    #[prost(string, tag="2")]
+    pub receiver_id: ::prost::alloc::string::String,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct ExecutionOutcomeWithId {
+    #[prost(message, optional, tag="1")]
+    pub proof: ::core::option::Option<MerklePath>,
+    #[prost(message, optional, tag="2")]
+    pub block_hash: ::core::option::Option<CryptoHash>,
+    #[prost(message, optional, tag="3")]
+    pub id: ::core::option::Option<CryptoHash>,
+    #[prost(message, optional, tag="4")]
+    pub outcome: ::core::option::Option<ExecutionOutcome>,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct ExecutionOutcome {
+    #[prost(string, repeated, tag="1")]
+    pub logs: ::prost::alloc::vec::Vec<::prost::alloc::string::String>,
+    #[prost(message, repeated, tag="2")]
+    pub receipt_ids: ::prost::alloc::vec::Vec<CryptoHash>,
+    #[prost(uint64, tag="3")]
+    pub gas_burnt: u64,
+    #[prost(message, optional, tag="4")]
+    pub tokens_burnt: ::core::option::Option<BigInt>,
+    #[prost(string, tag="5")]
+    pub executor_id: ::prost::alloc::string::String,
+    #[prost(enumeration="ExecutionMetadata", tag="6")]
+    pub metadata: i32,
+    #[prost(oneof="execution_outcome::Status", tags="20, 21, 22, 23")]
+    pub status: ::core::option::Option<execution_outcome::Status>,
+}
+/// Nested message and enum types in `ExecutionOutcome`.
+pub mod execution_outcome {
+    #[derive(Clone, PartialEq, ::prost::Oneof)]
+    pub enum Status {
+        #[prost(message, tag="20")]
+        Unknown(super::UnknownExecutionStatus),
+        #[prost(message, tag="21")]
+        Failure(super::FailureExecutionStatus),
+        #[prost(message, tag="22")]
+        SuccessValue(super::SuccessValueExecutionStatus),
+        #[prost(message, tag="23")]
+        SuccessReceiptId(super::SuccessReceiptIdExecutionStatus),
+    }
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct SuccessValueExecutionStatus {
+    #[prost(bytes="vec", tag="1")]
+    pub value: ::prost::alloc::vec::Vec<u8>,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct SuccessReceiptIdExecutionStatus {
+    #[prost(message, optional, tag="1")]
+    pub id: ::core::option::Option<CryptoHash>,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct UnknownExecutionStatus {
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct FailureExecutionStatus {
+    #[prost(oneof="failure_execution_status::Failure", tags="1, 2")]
+    pub failure: ::core::option::Option<failure_execution_status::Failure>,
+}
+/// Nested message and enum types in `FailureExecutionStatus`.
+pub mod failure_execution_status {
+    #[derive(Clone, PartialEq, ::prost::Oneof)]
+    pub enum Failure {
+        #[prost(message, tag="1")]
+        ActionError(super::ActionError),
+        #[prost(enumeration="super::InvalidTxError", tag="2")]
+        InvalidTxError(i32),
+    }
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct ActionError {
+    #[prost(uint64, tag="1")]
+    pub index: u64,
+    #[prost(oneof="action_error::Kind", tags="21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36")]
+    pub kind: ::core::option::Option<action_error::Kind>,
+}
+/// Nested message and enum types in `ActionError`.
+pub mod action_error {
+    #[derive(Clone, PartialEq, ::prost::Oneof)]
+    pub enum Kind {
+        #[prost(message, tag="21")]
+        AccountAlreadyExist(super::AccountAlreadyExistsErrorKind),
+        #[prost(message, tag="22")]
+        AccountDoesNotExist(super::AccountDoesNotExistErrorKind),
+        #[prost(message, tag="23")]
+        CreateAccountOnlyByRegistrar(super::CreateAccountOnlyByRegistrarErrorKind),
+        #[prost(message, tag="24")]
+        CreateAccountNotAllowed(super::CreateAccountNotAllowedErrorKind),
+        #[prost(message, tag="25")]
+        ActorNoPermission(super::ActorNoPermissionErrorKind),
+        #[prost(message, tag="26")]
+        DeleteKeyDoesNotExist(super::DeleteKeyDoesNotExistErrorKind),
+        #[prost(message, tag="27")]
+        AddKeyAlreadyExists(super::AddKeyAlreadyExistsErrorKind),
+        #[prost(message, tag="28")]
+        DeleteAccountStaking(super::DeleteAccountStakingErrorKind),
+        #[prost(message, tag="29")]
+        LackBalanceForState(super::LackBalanceForStateErrorKind),
+        #[prost(message, tag="30")]
+        TriesToUnstake(super::TriesToUnstakeErrorKind),
+        #[prost(message, tag="31")]
+        TriesToStake(super::TriesToStakeErrorKind),
+        #[prost(message, tag="32")]
+        InsufficientStake(super::InsufficientStakeErrorKind),
+        #[prost(message, tag="33")]
+        FunctionCall(super::FunctionCallErrorKind),
+        #[prost(message, tag="34")]
+        NewReceiptValidation(super::NewReceiptValidationErrorKind),
+        #[prost(message, tag="35")]
+        OnlyImplicitAccountCreationAllowed(super::OnlyImplicitAccountCreationAllowedErrorKind),
+        #[prost(message, tag="36")]
+        DeleteAccountWithLargeState(super::DeleteAccountWithLargeStateErrorKind),
+    }
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct AccountAlreadyExistsErrorKind {
+    #[prost(string, tag="1")]
+    pub account_id: ::prost::alloc::string::String,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct AccountDoesNotExistErrorKind {
+    #[prost(string, tag="1")]
+    pub account_id: ::prost::alloc::string::String,
+}
+//// A top-level account ID can only be created by registrar.
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct CreateAccountOnlyByRegistrarErrorKind {
+    #[prost(string, tag="1")]
+    pub account_id: ::prost::alloc::string::String,
+    #[prost(string, tag="2")]
+    pub registrar_account_id: ::prost::alloc::string::String,
+    #[prost(string, tag="3")]
+    pub predecessor_id: ::prost::alloc::string::String,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct CreateAccountNotAllowedErrorKind {
+    #[prost(string, tag="1")]
+    pub account_id: ::prost::alloc::string::String,
+    #[prost(string, tag="2")]
+    pub predecessor_id: ::prost::alloc::string::String,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct ActorNoPermissionErrorKind {
+    #[prost(string, tag="1")]
+    pub account_id: ::prost::alloc::string::String,
+    #[prost(string, tag="2")]
+    pub actor_id: ::prost::alloc::string::String,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct DeleteKeyDoesNotExistErrorKind {
+    #[prost(string, tag="1")]
+    pub account_id: ::prost::alloc::string::String,
+    #[prost(message, optional, tag="2")]
+    pub public_key: ::core::option::Option<PublicKey>,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct AddKeyAlreadyExistsErrorKind {
+    #[prost(string, tag="1")]
+    pub account_id: ::prost::alloc::string::String,
+    #[prost(message, optional, tag="2")]
+    pub public_key: ::core::option::Option<PublicKey>,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct DeleteAccountStakingErrorKind {
+    #[prost(string, tag="1")]
+    pub account_id: ::prost::alloc::string::String,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct LackBalanceForStateErrorKind {
+    #[prost(string, tag="1")]
+    pub account_id: ::prost::alloc::string::String,
+    #[prost(message, optional, tag="2")]
+    pub balance: ::core::option::Option<BigInt>,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct TriesToUnstakeErrorKind {
+    #[prost(string, tag="1")]
+    pub account_id: ::prost::alloc::string::String,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct TriesToStakeErrorKind {
+    #[prost(string, tag="1")]
+    pub account_id: ::prost::alloc::string::String,
+    #[prost(message, optional, tag="2")]
+    pub stake: ::core::option::Option<BigInt>,
+    #[prost(message, optional, tag="3")]
+    pub locked: ::core::option::Option<BigInt>,
+    #[prost(message, optional, tag="4")]
+    pub balance: ::core::option::Option<BigInt>,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct InsufficientStakeErrorKind {
+    #[prost(string, tag="1")]
+    pub account_id: ::prost::alloc::string::String,
+    #[prost(message, optional, tag="2")]
+    pub stake: ::core::option::Option<BigInt>,
+    #[prost(message, optional, tag="3")]
+    pub minimum_stake: ::core::option::Option<BigInt>,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct FunctionCallErrorKind {
+    #[prost(enumeration="FunctionCallErrorSer", tag="1")]
+    pub error: i32,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct NewReceiptValidationErrorKind {
+    #[prost(enumeration="ReceiptValidationError", tag="1")]
+    pub error: i32,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct OnlyImplicitAccountCreationAllowedErrorKind {
+    #[prost(string, tag="1")]
+    pub account_id: ::prost::alloc::string::String,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct DeleteAccountWithLargeStateErrorKind {
+    #[prost(string, tag="1")]
+    pub account_id: ::prost::alloc::string::String,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct MerklePath {
+    #[prost(message, repeated, tag="1")]
+    pub path: ::prost::alloc::vec::Vec<MerklePathItem>,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct MerklePathItem {
+    #[prost(message, optional, tag="1")]
+    pub hash: ::core::option::Option<CryptoHash>,
+    #[prost(enumeration="Direction", tag="2")]
+    pub direction: i32,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct Action {
+    #[prost(oneof="action::Action", tags="1, 2, 3, 4, 5, 6, 7, 8")]
+    pub action: ::core::option::Option<action::Action>,
+}
+/// Nested message and enum types in `Action`.
+pub mod action {
+    #[derive(Clone, PartialEq, ::prost::Oneof)]
+    pub enum Action {
+        #[prost(message, tag="1")]
+        CreateAccount(super::CreateAccountAction),
+        #[prost(message, tag="2")]
+        DeployContract(super::DeployContractAction),
+        #[prost(message, tag="3")]
+        FunctionCall(super::FunctionCallAction),
+        #[prost(message, tag="4")]
+        Transfer(super::TransferAction),
+        #[prost(message, tag="5")]
+        Stake(super::StakeAction),
+        #[prost(message, tag="6")]
+        AddKey(super::AddKeyAction),
+        #[prost(message, tag="7")]
+        DeleteKey(super::DeleteKeyAction),
+        #[prost(message, tag="8")]
+        DeleteAccount(super::DeleteAccountAction),
+    }
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct CreateAccountAction {
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct DeployContractAction {
+    #[prost(bytes="vec", tag="1")]
+    pub code: ::prost::alloc::vec::Vec<u8>,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct FunctionCallAction {
+    #[prost(string, tag="1")]
+    pub method_name: ::prost::alloc::string::String,
+    #[prost(bytes="vec", tag="2")]
+    pub args: ::prost::alloc::vec::Vec<u8>,
+    #[prost(uint64, tag="3")]
+    pub gas: u64,
+    #[prost(message, optional, tag="4")]
+    pub deposit: ::core::option::Option<BigInt>,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct TransferAction {
+    #[prost(message, optional, tag="1")]
+    pub deposit: ::core::option::Option<BigInt>,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct StakeAction {
+    #[prost(message, optional, tag="1")]
+    pub stake: ::core::option::Option<BigInt>,
+    #[prost(message, optional, tag="2")]
+    pub public_key: ::core::option::Option<PublicKey>,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct AddKeyAction {
+    #[prost(message, optional, tag="1")]
+    pub public_key: ::core::option::Option<PublicKey>,
+    #[prost(message, optional, tag="2")]
+    pub access_key: ::core::option::Option<AccessKey>,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct DeleteKeyAction {
+    #[prost(message, optional, tag="1")]
+    pub public_key: ::core::option::Option<PublicKey>,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct DeleteAccountAction {
+    #[prost(string, tag="1")]
+    pub beneficiary_id: ::prost::alloc::string::String,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct AccessKey {
+    #[prost(uint64, tag="1")]
+    pub nonce: u64,
+    #[prost(message, optional, tag="2")]
+    pub permission: ::core::option::Option<AccessKeyPermission>,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct AccessKeyPermission {
+    #[prost(oneof="access_key_permission::Permission", tags="1, 2")]
+    pub permission: ::core::option::Option<access_key_permission::Permission>,
+}
+/// Nested message and enum types in `AccessKeyPermission`.
+pub mod access_key_permission {
+    #[derive(Clone, PartialEq, ::prost::Oneof)]
+    pub enum Permission {
+        #[prost(message, tag="1")]
+        FunctionCall(super::FunctionCallPermission),
+        #[prost(message, tag="2")]
+        FullAccess(super::FullAccessPermission),
+    }
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct FunctionCallPermission {
+    #[prost(message, optional, tag="1")]
+    pub allowance: ::core::option::Option<BigInt>,
+    #[prost(string, tag="2")]
+    pub receiver_id: ::prost::alloc::string::String,
+    #[prost(string, repeated, tag="3")]
+    pub method_names: ::prost::alloc::vec::Vec<::prost::alloc::string::String>,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct FullAccessPermission {
+}
+#[derive(Clone, Copy, Debug, PartialEq, Eq, Hash, PartialOrd, Ord, ::prost::Enumeration)]
+#[repr(i32)]
+pub enum CurveKind {
+    Ed25519 = 0,
+    Secp256k1 = 1,
+}
+#[derive(Clone, Copy, Debug, PartialEq, Eq, Hash, PartialOrd, Ord, ::prost::Enumeration)]
+#[repr(i32)]
+pub enum ExecutionMetadata {
+    V1 = 0,
+}
+///todo: add more detail?
+#[derive(Clone, Copy, Debug, PartialEq, Eq, Hash, PartialOrd, Ord, ::prost::Enumeration)]
+#[repr(i32)]
+pub enum FunctionCallErrorSer {
+    CompilationError = 0,
+    LinkError = 1,
+    MethodResolveError = 2,
+    WasmTrap = 3,
+    WasmUnknownError = 4,
+    HostError = 5,
+    EvmError = 6,
+    ExecutionError = 7,
+}
+///todo: add more detail?
+#[derive(Clone, Copy, Debug, PartialEq, Eq, Hash, PartialOrd, Ord, ::prost::Enumeration)]
+#[repr(i32)]
+pub enum ReceiptValidationError {
+    InvalidPredecessorId = 0,
+    InvalidReceiverAccountId = 1,
+    InvalidSignerAccountId = 2,
+    InvalidDataReceiverId = 3,
+    ReturnedValueLengthExceeded = 4,
+    NumberInputDataDependenciesExceeded = 5,
+    ActionsValidationError = 6,
+}
+///todo: add more detail?
+#[derive(Clone, Copy, Debug, PartialEq, Eq, Hash, PartialOrd, Ord, ::prost::Enumeration)]
+#[repr(i32)]
+pub enum InvalidTxError {
+    InvalidAccessKeyError = 0,
+    InvalidSignerId = 1,
+    SignerDoesNotExist = 2,
+    InvalidNonce = 3,
+    NonceTooLarge = 4,
+    InvalidReceiverId = 5,
+    InvalidSignature = 6,
+    NotEnoughBalance = 7,
+    LackBalanceForState = 8,
+    CostOverflow = 9,
+    InvalidChain = 10,
+    Expired = 11,
+    ActionsValidation = 12,
+    TransactionSizeExceeded = 13,
+}
+#[derive(Clone, Copy, Debug, PartialEq, Eq, Hash, PartialOrd, Ord, ::prost::Enumeration)]
+#[repr(i32)]
+pub enum Direction {
+    Left = 0,
+    Right = 1,
+}
diff --git a/chain/near/src/runtime/abi.rs b/chain/near/src/runtime/abi.rs
new file mode 100644
index 0000000..fdd3be1
--- /dev/null
+++ b/chain/near/src/runtime/abi.rs
@@ -0,0 +1,637 @@
+use crate::codec;
+use crate::trigger::ReceiptWithOutcome;
+use graph::anyhow::anyhow;
+use graph::runtime::gas::GasCounter;
+use graph::runtime::{asc_new, AscHeap, AscPtr, DeterministicHostError, ToAscObj};
+use graph_runtime_wasm::asc_abi::class::{Array, AscEnum, EnumPayload, Uint8Array};
+
+pub(crate) use super::generated::*;
+
+impl ToAscObj<AscBlock> for codec::Block {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscBlock, DeterministicHostError> {
+        Ok(AscBlock {
+            author: asc_new(heap, &self.author, gas)?,
+            header: asc_new(heap, self.header(), gas)?,
+            chunks: asc_new(heap, &self.chunk_headers, gas)?,
+        })
+    }
+}
+
+impl ToAscObj<AscBlockHeader> for codec::BlockHeader {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscBlockHeader, DeterministicHostError> {
+        let chunk_mask = Array::new(self.chunk_mask.as_ref(), heap, gas)?;
+
+        Ok(AscBlockHeader {
+            height: self.height,
+            prev_height: self.prev_height,
+            epoch_id: asc_new(heap, self.epoch_id.as_ref().unwrap(), gas)?,
+            next_epoch_id: asc_new(heap, self.next_epoch_id.as_ref().unwrap(), gas)?,
+            hash: asc_new(heap, self.hash.as_ref().unwrap(), gas)?,
+            prev_hash: asc_new(heap, self.prev_hash.as_ref().unwrap(), gas)?,
+            prev_state_root: asc_new(heap, self.prev_state_root.as_ref().unwrap(), gas)?,
+            chunk_receipts_root: asc_new(heap, self.chunk_receipts_root.as_ref().unwrap(), gas)?,
+            chunk_headers_root: asc_new(heap, self.chunk_headers_root.as_ref().unwrap(), gas)?,
+            chunk_tx_root: asc_new(heap, self.chunk_tx_root.as_ref().unwrap(), gas)?,
+            outcome_root: asc_new(heap, self.outcome_root.as_ref().unwrap(), gas)?,
+            chunks_included: self.chunks_included,
+            challenges_root: asc_new(heap, self.challenges_root.as_ref().unwrap(), gas)?,
+            timestamp_nanosec: self.timestamp_nanosec,
+            random_value: asc_new(heap, self.random_value.as_ref().unwrap(), gas)?,
+            validator_proposals: asc_new(heap, &self.validator_proposals, gas)?,
+            chunk_mask: AscPtr::alloc_obj(chunk_mask, heap, gas)?,
+            gas_price: asc_new(heap, self.gas_price.as_ref().unwrap(), gas)?,
+            block_ordinal: self.block_ordinal,
+            total_supply: asc_new(heap, self.total_supply.as_ref().unwrap(), gas)?,
+            challenges_result: asc_new(heap, &self.challenges_result, gas)?,
+            last_final_block: asc_new(heap, self.last_final_block.as_ref().unwrap(), gas)?,
+            last_ds_final_block: asc_new(heap, self.last_ds_final_block.as_ref().unwrap(), gas)?,
+            next_bp_hash: asc_new(heap, self.next_bp_hash.as_ref().unwrap(), gas)?,
+            block_merkle_root: asc_new(heap, self.block_merkle_root.as_ref().unwrap(), gas)?,
+            epoch_sync_data_hash: asc_new(heap, self.epoch_sync_data_hash.as_slice(), gas)?,
+            approvals: asc_new(heap, &self.approvals, gas)?,
+            signature: asc_new(heap, &self.signature.as_ref().unwrap(), gas)?,
+            latest_protocol_version: self.latest_protocol_version,
+        })
+    }
+}
+
+impl ToAscObj<AscChunkHeader> for codec::ChunkHeader {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscChunkHeader, DeterministicHostError> {
+        Ok(AscChunkHeader {
+            chunk_hash: asc_new(heap, self.chunk_hash.as_slice(), gas)?,
+            signature: asc_new(heap, &self.signature.as_ref().unwrap(), gas)?,
+            prev_block_hash: asc_new(heap, self.prev_block_hash.as_slice(), gas)?,
+            prev_state_root: asc_new(heap, self.prev_state_root.as_slice(), gas)?,
+            encoded_merkle_root: asc_new(heap, self.encoded_merkle_root.as_slice(), gas)?,
+            encoded_length: self.encoded_length,
+            height_created: self.height_created,
+            height_included: self.height_included,
+            shard_id: self.shard_id,
+            gas_used: self.gas_used,
+            gas_limit: self.gas_limit,
+            balance_burnt: asc_new(heap, self.balance_burnt.as_ref().unwrap(), gas)?,
+            outgoing_receipts_root: asc_new(heap, self.outgoing_receipts_root.as_slice(), gas)?,
+            tx_root: asc_new(heap, self.tx_root.as_slice(), gas)?,
+            validator_proposals: asc_new(heap, &self.validator_proposals, gas)?,
+
+            _padding: 0,
+        })
+    }
+}
+
+impl ToAscObj<AscChunkHeaderArray> for Vec<codec::ChunkHeader> {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscChunkHeaderArray, DeterministicHostError> {
+        let content: Result<Vec<_>, _> = self.iter().map(|x| asc_new(heap, x, gas)).collect();
+        let content = content?;
+        Ok(AscChunkHeaderArray(Array::new(&*content, heap, gas)?))
+    }
+}
+
+impl ToAscObj<AscReceiptWithOutcome> for ReceiptWithOutcome {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscReceiptWithOutcome, DeterministicHostError> {
+        Ok(AscReceiptWithOutcome {
+            outcome: asc_new(heap, &self.outcome, gas)?,
+            receipt: asc_new(heap, &self.receipt, gas)?,
+            block: asc_new(heap, self.block.as_ref(), gas)?,
+        })
+    }
+}
+
+impl ToAscObj<AscActionReceipt> for codec::Receipt {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscActionReceipt, DeterministicHostError> {
+        let action = match self.receipt.as_ref().unwrap() {
+            codec::receipt::Receipt::Action(action) => action,
+            codec::receipt::Receipt::Data(_) => {
+                return Err(DeterministicHostError::from(anyhow!(
+                    "Data receipt are now allowed"
+                )));
+            }
+        };
+
+        Ok(AscActionReceipt {
+            id: asc_new(heap, &self.receipt_id.as_ref().unwrap(), gas)?,
+            predecessor_id: asc_new(heap, &self.predecessor_id, gas)?,
+            receiver_id: asc_new(heap, &self.receiver_id, gas)?,
+            signer_id: asc_new(heap, &action.signer_id, gas)?,
+            signer_public_key: asc_new(heap, action.signer_public_key.as_ref().unwrap(), gas)?,
+            gas_price: asc_new(heap, action.gas_price.as_ref().unwrap(), gas)?,
+            output_data_receivers: asc_new(heap, &action.output_data_receivers, gas)?,
+            input_data_ids: asc_new(heap, &action.input_data_ids, gas)?,
+            actions: asc_new(heap, &action.actions, gas)?,
+        })
+    }
+}
+
+impl ToAscObj<AscActionEnum> for codec::Action {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscActionEnum, DeterministicHostError> {
+        let (kind, payload) = match self.action.as_ref().unwrap() {
+            codec::action::Action::CreateAccount(action) => (
+                AscActionKind::CreateAccount,
+                asc_new(heap, action, gas)?.to_payload(),
+            ),
+            codec::action::Action::DeployContract(action) => (
+                AscActionKind::DeployContract,
+                asc_new(heap, action, gas)?.to_payload(),
+            ),
+            codec::action::Action::FunctionCall(action) => (
+                AscActionKind::FunctionCall,
+                asc_new(heap, action, gas)?.to_payload(),
+            ),
+            codec::action::Action::Transfer(action) => (
+                AscActionKind::Transfer,
+                asc_new(heap, action, gas)?.to_payload(),
+            ),
+            codec::action::Action::Stake(action) => (
+                AscActionKind::Stake,
+                asc_new(heap, action, gas)?.to_payload(),
+            ),
+            codec::action::Action::AddKey(action) => (
+                AscActionKind::AddKey,
+                asc_new(heap, action, gas)?.to_payload(),
+            ),
+            codec::action::Action::DeleteKey(action) => (
+                AscActionKind::DeleteKey,
+                asc_new(heap, action, gas)?.to_payload(),
+            ),
+            codec::action::Action::DeleteAccount(action) => (
+                AscActionKind::DeleteAccount,
+                asc_new(heap, action, gas)?.to_payload(),
+            ),
+        };
+
+        Ok(AscActionEnum(AscEnum {
+            kind,
+            _padding: 0,
+            payload: EnumPayload(payload),
+        }))
+    }
+}
+
+impl ToAscObj<AscActionEnumArray> for Vec<codec::Action> {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscActionEnumArray, DeterministicHostError> {
+        let content: Result<Vec<_>, _> = self.iter().map(|x| asc_new(heap, x, gas)).collect();
+        let content = content?;
+        Ok(AscActionEnumArray(Array::new(&*content, heap, gas)?))
+    }
+}
+
+impl ToAscObj<AscCreateAccountAction> for codec::CreateAccountAction {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        _heap: &mut H,
+        _gas: &GasCounter,
+    ) -> Result<AscCreateAccountAction, DeterministicHostError> {
+        Ok(AscCreateAccountAction {})
+    }
+}
+
+impl ToAscObj<AscDeployContractAction> for codec::DeployContractAction {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscDeployContractAction, DeterministicHostError> {
+        Ok(AscDeployContractAction {
+            code: asc_new(heap, self.code.as_slice(), gas)?,
+        })
+    }
+}
+
+impl ToAscObj<AscFunctionCallAction> for codec::FunctionCallAction {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscFunctionCallAction, DeterministicHostError> {
+        Ok(AscFunctionCallAction {
+            method_name: asc_new(heap, &self.method_name, gas)?,
+            args: asc_new(heap, self.args.as_slice(), gas)?,
+            gas: self.gas,
+            deposit: asc_new(heap, self.deposit.as_ref().unwrap(), gas)?,
+            _padding: 0,
+        })
+    }
+}
+
+impl ToAscObj<AscTransferAction> for codec::TransferAction {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscTransferAction, DeterministicHostError> {
+        Ok(AscTransferAction {
+            deposit: asc_new(heap, self.deposit.as_ref().unwrap(), gas)?,
+        })
+    }
+}
+
+impl ToAscObj<AscStakeAction> for codec::StakeAction {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscStakeAction, DeterministicHostError> {
+        Ok(AscStakeAction {
+            stake: asc_new(heap, self.stake.as_ref().unwrap(), gas)?,
+            public_key: asc_new(heap, self.public_key.as_ref().unwrap(), gas)?,
+        })
+    }
+}
+
+impl ToAscObj<AscAddKeyAction> for codec::AddKeyAction {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscAddKeyAction, DeterministicHostError> {
+        Ok(AscAddKeyAction {
+            public_key: asc_new(heap, self.public_key.as_ref().unwrap(), gas)?,
+            access_key: asc_new(heap, self.access_key.as_ref().unwrap(), gas)?,
+        })
+    }
+}
+
+impl ToAscObj<AscAccessKey> for codec::AccessKey {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscAccessKey, DeterministicHostError> {
+        Ok(AscAccessKey {
+            nonce: self.nonce,
+            permission: asc_new(heap, self.permission.as_ref().unwrap(), gas)?,
+            _padding: 0,
+        })
+    }
+}
+
+impl ToAscObj<AscAccessKeyPermissionEnum> for codec::AccessKeyPermission {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscAccessKeyPermissionEnum, DeterministicHostError> {
+        let (kind, payload) = match self.permission.as_ref().unwrap() {
+            codec::access_key_permission::Permission::FunctionCall(permission) => (
+                AscAccessKeyPermissionKind::FunctionCall,
+                asc_new(heap, permission, gas)?.to_payload(),
+            ),
+            codec::access_key_permission::Permission::FullAccess(permission) => (
+                AscAccessKeyPermissionKind::FullAccess,
+                asc_new(heap, permission, gas)?.to_payload(),
+            ),
+        };
+
+        Ok(AscAccessKeyPermissionEnum(AscEnum {
+            _padding: 0,
+            kind,
+            payload: EnumPayload(payload),
+        }))
+    }
+}
+
+impl ToAscObj<AscFunctionCallPermission> for codec::FunctionCallPermission {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscFunctionCallPermission, DeterministicHostError> {
+        Ok(AscFunctionCallPermission {
+            // The `allowance` field is one of the few fields that can actually be None for real
+            allowance: match self.allowance.as_ref() {
+                Some(allowance) => asc_new(heap, allowance, gas)?,
+                None => AscPtr::null(),
+            },
+            receiver_id: asc_new(heap, &self.receiver_id, gas)?,
+            method_names: asc_new(heap, &self.method_names, gas)?,
+        })
+    }
+}
+
+impl ToAscObj<AscFullAccessPermission> for codec::FullAccessPermission {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        _heap: &mut H,
+        _gas: &GasCounter,
+    ) -> Result<AscFullAccessPermission, DeterministicHostError> {
+        Ok(AscFullAccessPermission {})
+    }
+}
+
+impl ToAscObj<AscDeleteKeyAction> for codec::DeleteKeyAction {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscDeleteKeyAction, DeterministicHostError> {
+        Ok(AscDeleteKeyAction {
+            public_key: asc_new(heap, self.public_key.as_ref().unwrap(), gas)?,
+        })
+    }
+}
+
+impl ToAscObj<AscDeleteAccountAction> for codec::DeleteAccountAction {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscDeleteAccountAction, DeterministicHostError> {
+        Ok(AscDeleteAccountAction {
+            beneficiary_id: asc_new(heap, &self.beneficiary_id, gas)?,
+        })
+    }
+}
+
+impl ToAscObj<AscDataReceiver> for codec::DataReceiver {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscDataReceiver, DeterministicHostError> {
+        Ok(AscDataReceiver {
+            data_id: asc_new(heap, self.data_id.as_ref().unwrap(), gas)?,
+            receiver_id: asc_new(heap, &self.receiver_id, gas)?,
+        })
+    }
+}
+
+impl ToAscObj<AscDataReceiverArray> for Vec<codec::DataReceiver> {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscDataReceiverArray, DeterministicHostError> {
+        let content: Result<Vec<_>, _> = self.iter().map(|x| asc_new(heap, x, gas)).collect();
+        let content = content?;
+        Ok(AscDataReceiverArray(Array::new(&*content, heap, gas)?))
+    }
+}
+
+impl ToAscObj<AscExecutionOutcome> for codec::ExecutionOutcomeWithId {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscExecutionOutcome, DeterministicHostError> {
+        let outcome = self.outcome.as_ref().unwrap();
+
+        Ok(AscExecutionOutcome {
+            proof: asc_new(heap, &self.proof.as_ref().unwrap().path, gas)?,
+            block_hash: asc_new(heap, self.block_hash.as_ref().unwrap(), gas)?,
+            id: asc_new(heap, self.id.as_ref().unwrap(), gas)?,
+            logs: asc_new(heap, &outcome.logs, gas)?,
+            receipt_ids: asc_new(heap, &outcome.receipt_ids, gas)?,
+            gas_burnt: outcome.gas_burnt,
+            tokens_burnt: asc_new(heap, outcome.tokens_burnt.as_ref().unwrap(), gas)?,
+            executor_id: asc_new(heap, &outcome.executor_id, gas)?,
+            status: asc_new(heap, outcome.status.as_ref().unwrap(), gas)?,
+        })
+    }
+}
+
+impl ToAscObj<AscSuccessStatusEnum> for codec::execution_outcome::Status {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscSuccessStatusEnum, DeterministicHostError> {
+        let (kind, payload) = match self {
+            codec::execution_outcome::Status::SuccessValue(value) => {
+                let bytes = &value.value;
+
+                (
+                    AscSuccessStatusKind::Value,
+                    asc_new(heap, bytes.as_slice(), gas)?.to_payload(),
+                )
+            }
+            codec::execution_outcome::Status::SuccessReceiptId(receipt_id) => (
+                AscSuccessStatusKind::ReceiptId,
+                asc_new(heap, receipt_id.id.as_ref().unwrap(), gas)?.to_payload(),
+            ),
+            codec::execution_outcome::Status::Failure(_) => {
+                return Err(DeterministicHostError::from(anyhow!(
+                    "Failure execution status are not allowed"
+                )));
+            }
+            codec::execution_outcome::Status::Unknown(_) => {
+                return Err(DeterministicHostError::from(anyhow!(
+                    "Unknown execution status are not allowed"
+                )));
+            }
+        };
+
+        Ok(AscSuccessStatusEnum(AscEnum {
+            _padding: 0,
+            kind,
+            payload: EnumPayload(payload),
+        }))
+    }
+}
+
+impl ToAscObj<AscMerklePathItem> for codec::MerklePathItem {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscMerklePathItem, DeterministicHostError> {
+        Ok(AscMerklePathItem {
+            hash: asc_new(heap, self.hash.as_ref().unwrap(), gas)?,
+            direction: match self.direction {
+                0 => AscDirection::Left,
+                1 => AscDirection::Right,
+                x => {
+                    return Err(DeterministicHostError::from(anyhow!(
+                        "Invalid direction value {}",
+                        x
+                    )))
+                }
+            },
+        })
+    }
+}
+
+impl ToAscObj<AscMerklePathItemArray> for Vec<codec::MerklePathItem> {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscMerklePathItemArray, DeterministicHostError> {
+        let content: Result<Vec<_>, _> = self.iter().map(|x| asc_new(heap, x, gas)).collect();
+        let content = content?;
+        Ok(AscMerklePathItemArray(Array::new(&*content, heap, gas)?))
+    }
+}
+
+impl ToAscObj<AscSignature> for codec::Signature {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscSignature, DeterministicHostError> {
+        Ok(AscSignature {
+            kind: match self.r#type {
+                0 => 0,
+                1 => 1,
+                value => {
+                    return Err(DeterministicHostError::from(anyhow!(
+                        "Invalid signature type {}",
+                        value,
+                    )))
+                }
+            },
+            bytes: asc_new(heap, self.bytes.as_slice(), gas)?,
+        })
+    }
+}
+
+impl ToAscObj<AscSignatureArray> for Vec<codec::Signature> {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscSignatureArray, DeterministicHostError> {
+        let content: Result<Vec<_>, _> = self.iter().map(|x| asc_new(heap, x, gas)).collect();
+        let content = content?;
+        Ok(AscSignatureArray(Array::new(&*content, heap, gas)?))
+    }
+}
+
+impl ToAscObj<AscPublicKey> for codec::PublicKey {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscPublicKey, DeterministicHostError> {
+        Ok(AscPublicKey {
+            kind: match self.r#type {
+                0 => 0,
+                1 => 1,
+                value => {
+                    return Err(DeterministicHostError::from(anyhow!(
+                        "Invalid public key type {}",
+                        value,
+                    )))
+                }
+            },
+            bytes: asc_new(heap, self.bytes.as_slice(), gas)?,
+        })
+    }
+}
+
+impl ToAscObj<AscValidatorStake> for codec::ValidatorStake {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscValidatorStake, DeterministicHostError> {
+        Ok(AscValidatorStake {
+            account_id: asc_new(heap, &self.account_id, gas)?,
+            public_key: asc_new(heap, self.public_key.as_ref().unwrap(), gas)?,
+            stake: asc_new(heap, self.stake.as_ref().unwrap(), gas)?,
+        })
+    }
+}
+
+impl ToAscObj<AscValidatorStakeArray> for Vec<codec::ValidatorStake> {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscValidatorStakeArray, DeterministicHostError> {
+        let content: Result<Vec<_>, _> = self.iter().map(|x| asc_new(heap, x, gas)).collect();
+        let content = content?;
+        Ok(AscValidatorStakeArray(Array::new(&*content, heap, gas)?))
+    }
+}
+
+impl ToAscObj<AscSlashedValidator> for codec::SlashedValidator {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscSlashedValidator, DeterministicHostError> {
+        Ok(AscSlashedValidator {
+            account_id: asc_new(heap, &self.account_id, gas)?,
+            is_double_sign: self.is_double_sign,
+        })
+    }
+}
+
+impl ToAscObj<AscSlashedValidatorArray> for Vec<codec::SlashedValidator> {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscSlashedValidatorArray, DeterministicHostError> {
+        let content: Result<Vec<_>, _> = self.iter().map(|x| asc_new(heap, x, gas)).collect();
+        let content = content?;
+        Ok(AscSlashedValidatorArray(Array::new(&*content, heap, gas)?))
+    }
+}
+
+impl ToAscObj<Uint8Array> for codec::CryptoHash {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscCryptoHash, DeterministicHostError> {
+        self.bytes.to_asc_obj(heap, gas)
+    }
+}
+
+impl ToAscObj<AscCryptoHashArray> for Vec<codec::CryptoHash> {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscCryptoHashArray, DeterministicHostError> {
+        let content: Result<Vec<_>, _> = self.iter().map(|x| asc_new(heap, x, gas)).collect();
+        let content = content?;
+        Ok(AscCryptoHashArray(Array::new(&*content, heap, gas)?))
+    }
+}
+
+impl ToAscObj<Uint8Array> for codec::BigInt {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<Uint8Array, DeterministicHostError> {
+        // Bytes are reversed to align with BigInt bytes endianess
+        let reversed: Vec<u8> = self.bytes.iter().rev().map(|x| *x).collect();
+
+        reversed.to_asc_obj(heap, gas)
+    }
+}
diff --git a/chain/near/src/runtime/generated.rs b/chain/near/src/runtime/generated.rs
new file mode 100644
index 0000000..153eb8b
--- /dev/null
+++ b/chain/near/src/runtime/generated.rs
@@ -0,0 +1,620 @@
+use graph::runtime::{
+    AscIndexId, AscPtr, AscType, AscValue, DeterministicHostError, IndexForAscTypeId,
+};
+use graph::semver::Version;
+use graph_runtime_derive::AscType;
+use graph_runtime_wasm::asc_abi::class::{Array, AscBigInt, AscEnum, AscString, Uint8Array};
+
+pub(crate) type AscCryptoHash = Uint8Array;
+pub(crate) type AscAccountId = AscString;
+pub(crate) type AscBlockHeight = u64;
+pub(crate) type AscBalance = AscBigInt;
+pub(crate) type AscGas = u64;
+pub(crate) type AscShardId = u64;
+pub(crate) type AscNumBlocks = u64;
+pub(crate) type AscProtocolVersion = u32;
+
+pub struct AscDataReceiverArray(pub(crate) Array<AscPtr<AscDataReceiver>>);
+
+impl AscType for AscDataReceiverArray {
+    fn to_asc_bytes(&self) -> Result<Vec<u8>, DeterministicHostError> {
+        self.0.to_asc_bytes()
+    }
+
+    fn from_asc_bytes(
+        asc_obj: &[u8],
+        api_version: &Version,
+    ) -> Result<Self, DeterministicHostError> {
+        Ok(Self(Array::from_asc_bytes(asc_obj, api_version)?))
+    }
+}
+
+impl AscIndexId for AscDataReceiverArray {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::NearArrayDataReceiver;
+}
+
+pub struct AscCryptoHashArray(pub(crate) Array<AscPtr<AscCryptoHash>>);
+
+impl AscType for AscCryptoHashArray {
+    fn to_asc_bytes(&self) -> Result<Vec<u8>, DeterministicHostError> {
+        self.0.to_asc_bytes()
+    }
+
+    fn from_asc_bytes(
+        asc_obj: &[u8],
+        api_version: &Version,
+    ) -> Result<Self, DeterministicHostError> {
+        Ok(Self(Array::from_asc_bytes(asc_obj, api_version)?))
+    }
+}
+
+impl AscIndexId for AscCryptoHashArray {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::NearArrayCryptoHash;
+}
+
+pub struct AscActionEnumArray(pub(crate) Array<AscPtr<AscActionEnum>>);
+
+impl AscType for AscActionEnumArray {
+    fn to_asc_bytes(&self) -> Result<Vec<u8>, DeterministicHostError> {
+        self.0.to_asc_bytes()
+    }
+
+    fn from_asc_bytes(
+        asc_obj: &[u8],
+        api_version: &Version,
+    ) -> Result<Self, DeterministicHostError> {
+        Ok(Self(Array::from_asc_bytes(asc_obj, api_version)?))
+    }
+}
+
+impl AscIndexId for AscActionEnumArray {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::NearArrayActionEnum;
+}
+
+pub struct AscMerklePathItemArray(pub(crate) Array<AscPtr<AscMerklePathItem>>);
+
+impl AscType for AscMerklePathItemArray {
+    fn to_asc_bytes(&self) -> Result<Vec<u8>, DeterministicHostError> {
+        self.0.to_asc_bytes()
+    }
+
+    fn from_asc_bytes(
+        asc_obj: &[u8],
+        api_version: &Version,
+    ) -> Result<Self, DeterministicHostError> {
+        Ok(Self(Array::from_asc_bytes(asc_obj, api_version)?))
+    }
+}
+
+impl AscIndexId for AscMerklePathItemArray {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::NearArrayMerklePathItem;
+}
+
+pub struct AscValidatorStakeArray(pub(crate) Array<AscPtr<AscValidatorStake>>);
+
+impl AscType for AscValidatorStakeArray {
+    fn to_asc_bytes(&self) -> Result<Vec<u8>, DeterministicHostError> {
+        self.0.to_asc_bytes()
+    }
+
+    fn from_asc_bytes(
+        asc_obj: &[u8],
+        api_version: &Version,
+    ) -> Result<Self, DeterministicHostError> {
+        Ok(Self(Array::from_asc_bytes(asc_obj, api_version)?))
+    }
+}
+
+impl AscIndexId for AscValidatorStakeArray {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::NearArrayValidatorStake;
+}
+
+pub struct AscSlashedValidatorArray(pub(crate) Array<AscPtr<AscSlashedValidator>>);
+
+impl AscType for AscSlashedValidatorArray {
+    fn to_asc_bytes(&self) -> Result<Vec<u8>, DeterministicHostError> {
+        self.0.to_asc_bytes()
+    }
+
+    fn from_asc_bytes(
+        asc_obj: &[u8],
+        api_version: &Version,
+    ) -> Result<Self, DeterministicHostError> {
+        Ok(Self(Array::from_asc_bytes(asc_obj, api_version)?))
+    }
+}
+
+impl AscIndexId for AscSlashedValidatorArray {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::NearArraySlashedValidator;
+}
+
+pub struct AscSignatureArray(pub(crate) Array<AscPtr<AscSignature>>);
+
+impl AscType for AscSignatureArray {
+    fn to_asc_bytes(&self) -> Result<Vec<u8>, DeterministicHostError> {
+        self.0.to_asc_bytes()
+    }
+
+    fn from_asc_bytes(
+        asc_obj: &[u8],
+        api_version: &Version,
+    ) -> Result<Self, DeterministicHostError> {
+        Ok(Self(Array::from_asc_bytes(asc_obj, api_version)?))
+    }
+}
+
+impl AscIndexId for AscSignatureArray {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::NearArraySignature;
+}
+
+pub struct AscChunkHeaderArray(pub(crate) Array<AscPtr<AscChunkHeader>>);
+
+impl AscType for AscChunkHeaderArray {
+    fn to_asc_bytes(&self) -> Result<Vec<u8>, DeterministicHostError> {
+        self.0.to_asc_bytes()
+    }
+
+    fn from_asc_bytes(
+        asc_obj: &[u8],
+        api_version: &Version,
+    ) -> Result<Self, DeterministicHostError> {
+        Ok(Self(Array::from_asc_bytes(asc_obj, api_version)?))
+    }
+}
+
+impl AscIndexId for AscChunkHeaderArray {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::NearArrayChunkHeader;
+}
+
+pub struct AscAccessKeyPermissionEnum(pub(crate) AscEnum<AscAccessKeyPermissionKind>);
+
+impl AscType for AscAccessKeyPermissionEnum {
+    fn to_asc_bytes(&self) -> Result<Vec<u8>, DeterministicHostError> {
+        self.0.to_asc_bytes()
+    }
+
+    fn from_asc_bytes(
+        asc_obj: &[u8],
+        api_version: &Version,
+    ) -> Result<Self, DeterministicHostError> {
+        Ok(Self(AscEnum::from_asc_bytes(asc_obj, api_version)?))
+    }
+}
+
+impl AscIndexId for AscAccessKeyPermissionEnum {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::NearAccessKeyPermissionEnum;
+}
+
+pub struct AscActionEnum(pub(crate) AscEnum<AscActionKind>);
+
+impl AscType for AscActionEnum {
+    fn to_asc_bytes(&self) -> Result<Vec<u8>, DeterministicHostError> {
+        self.0.to_asc_bytes()
+    }
+
+    fn from_asc_bytes(
+        asc_obj: &[u8],
+        api_version: &Version,
+    ) -> Result<Self, DeterministicHostError> {
+        Ok(Self(AscEnum::from_asc_bytes(asc_obj, api_version)?))
+    }
+}
+
+impl AscIndexId for AscActionEnum {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::NearActionEnum;
+}
+
+#[repr(C)]
+#[derive(AscType)]
+pub(crate) struct AscPublicKey {
+    pub kind: i32,
+    pub bytes: AscPtr<Uint8Array>,
+}
+
+impl AscIndexId for AscPublicKey {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::NearPublicKey;
+}
+
+#[repr(C)]
+#[derive(AscType)]
+pub(crate) struct AscSignature {
+    pub kind: i32,
+    pub bytes: AscPtr<Uint8Array>,
+}
+
+impl AscIndexId for AscSignature {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::NearSignature;
+}
+
+#[repr(u32)]
+#[derive(AscType, Copy, Clone)]
+pub(crate) enum AscAccessKeyPermissionKind {
+    FunctionCall,
+    FullAccess,
+}
+
+impl AscValue for AscAccessKeyPermissionKind {}
+
+impl Default for AscAccessKeyPermissionKind {
+    fn default() -> Self {
+        Self::FunctionCall
+    }
+}
+
+#[repr(C)]
+#[derive(AscType)]
+pub(crate) struct AscFunctionCallPermission {
+    pub allowance: AscPtr<AscBigInt>,
+    pub receiver_id: AscPtr<AscString>,
+    pub method_names: AscPtr<Array<AscPtr<AscString>>>,
+}
+
+impl AscIndexId for AscFunctionCallPermission {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::NearFunctionCallPermission;
+}
+
+#[repr(C)]
+#[derive(AscType)]
+pub(crate) struct AscFullAccessPermission {}
+
+impl AscIndexId for AscFullAccessPermission {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::NearFullAccessPermission;
+}
+
+#[repr(C)]
+#[derive(AscType)]
+pub(crate) struct AscAccessKey {
+    pub nonce: u64,
+    pub permission: AscPtr<AscAccessKeyPermissionEnum>,
+
+    // It seems that is impossible to correctly order fields in this struct
+    // so that Rust packs it tighly without padding. So we add 4 bytes of padding
+    // ourself.
+    //
+    // This is a bit problematic because AssemblyScript actually is ok with 12 bytes
+    // and is fully packed. Seems like a differences between alignment for `repr(C)` and
+    // AssemblyScript.
+    pub(crate) _padding: u32,
+}
+
+impl AscIndexId for AscAccessKey {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::NearAccessKey;
+}
+
+#[repr(C)]
+#[derive(AscType)]
+pub(crate) struct AscDataReceiver {
+    pub data_id: AscPtr<AscCryptoHash>,
+    pub receiver_id: AscPtr<AscString>,
+}
+
+impl AscIndexId for AscDataReceiver {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::NearDataReceiver;
+}
+
+#[repr(u32)]
+#[derive(AscType, Copy, Clone)]
+pub(crate) enum AscActionKind {
+    CreateAccount,
+    DeployContract,
+    FunctionCall,
+    Transfer,
+    Stake,
+    AddKey,
+    DeleteKey,
+    DeleteAccount,
+}
+
+impl AscValue for AscActionKind {}
+
+impl Default for AscActionKind {
+    fn default() -> Self {
+        Self::CreateAccount
+    }
+}
+
+#[repr(C)]
+#[derive(AscType)]
+pub(crate) struct AscCreateAccountAction {}
+
+impl AscIndexId for AscCreateAccountAction {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::NearCreateAccountAction;
+}
+
+#[repr(C)]
+#[derive(AscType)]
+pub(crate) struct AscDeployContractAction {
+    pub code: AscPtr<Uint8Array>,
+}
+
+impl AscIndexId for AscDeployContractAction {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::NearDeployContractAction;
+}
+
+#[repr(C)]
+#[derive(AscType)]
+pub(crate) struct AscFunctionCallAction {
+    pub method_name: AscPtr<AscString>,
+    pub args: AscPtr<Uint8Array>,
+    pub gas: u64,
+    pub deposit: AscPtr<AscBigInt>,
+
+    // It seems that is impossible to correctly order fields in this struct
+    // so that Rust packs it tighly without padding. So we add 4 bytes of padding
+    // ourself.
+    //
+    // This is a bit problematic because AssemblyScript actually is ok with 20 bytes
+    // and is fully packed. Seems like a differences between alignment for `repr(C)` and
+    // AssemblyScript.
+    pub(crate) _padding: u32,
+}
+
+impl AscIndexId for AscFunctionCallAction {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::NearFunctionCallAction;
+}
+
+#[repr(C)]
+#[derive(AscType)]
+pub(crate) struct AscTransferAction {
+    pub deposit: AscPtr<AscBigInt>,
+}
+
+impl AscIndexId for AscTransferAction {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::NearTransferAction;
+}
+
+#[repr(C)]
+#[derive(AscType)]
+pub(crate) struct AscStakeAction {
+    pub stake: AscPtr<AscBalance>,
+    pub public_key: AscPtr<AscPublicKey>,
+}
+
+impl AscIndexId for AscStakeAction {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::NearStakeAction;
+}
+
+#[repr(C)]
+#[derive(AscType)]
+pub(crate) struct AscAddKeyAction {
+    pub public_key: AscPtr<AscPublicKey>,
+    pub access_key: AscPtr<AscAccessKey>,
+}
+
+impl AscIndexId for AscAddKeyAction {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::NearAddKeyAction;
+}
+
+#[repr(C)]
+#[derive(AscType)]
+pub(crate) struct AscDeleteKeyAction {
+    pub public_key: AscPtr<AscPublicKey>,
+}
+
+impl AscIndexId for AscDeleteKeyAction {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::NearDeleteKeyAction;
+}
+
+#[repr(C)]
+#[derive(AscType)]
+pub(crate) struct AscDeleteAccountAction {
+    pub beneficiary_id: AscPtr<AscAccountId>,
+}
+
+impl AscIndexId for AscDeleteAccountAction {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::NearDeleteAccountAction;
+}
+
+#[repr(C)]
+#[derive(AscType)]
+pub(crate) struct AscActionReceipt {
+    pub predecessor_id: AscPtr<AscString>,
+    pub receiver_id: AscPtr<AscString>,
+    pub id: AscPtr<AscCryptoHash>,
+    pub signer_id: AscPtr<AscString>,
+    pub signer_public_key: AscPtr<AscPublicKey>,
+    pub gas_price: AscPtr<AscBigInt>,
+    pub output_data_receivers: AscPtr<AscDataReceiverArray>,
+    pub input_data_ids: AscPtr<AscCryptoHashArray>,
+    pub actions: AscPtr<AscActionEnumArray>,
+}
+
+impl AscIndexId for AscActionReceipt {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::NearActionReceipt;
+}
+
+#[repr(u32)]
+#[derive(AscType, Copy, Clone)]
+pub(crate) enum AscSuccessStatusKind {
+    Value,
+    ReceiptId,
+}
+
+impl AscValue for AscSuccessStatusKind {}
+
+impl Default for AscSuccessStatusKind {
+    fn default() -> Self {
+        Self::Value
+    }
+}
+
+pub struct AscSuccessStatusEnum(pub(crate) AscEnum<AscSuccessStatusKind>);
+
+impl AscType for AscSuccessStatusEnum {
+    fn to_asc_bytes(&self) -> Result<Vec<u8>, DeterministicHostError> {
+        self.0.to_asc_bytes()
+    }
+
+    fn from_asc_bytes(
+        asc_obj: &[u8],
+        api_version: &Version,
+    ) -> Result<Self, DeterministicHostError> {
+        Ok(Self(AscEnum::from_asc_bytes(asc_obj, api_version)?))
+    }
+}
+
+impl AscIndexId for AscSuccessStatusEnum {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::NearSuccessStatusEnum;
+}
+
+#[repr(u32)]
+#[derive(AscType, Copy, Clone)]
+pub(crate) enum AscDirection {
+    Left,
+    Right,
+}
+
+impl AscValue for AscDirection {}
+
+impl Default for AscDirection {
+    fn default() -> Self {
+        Self::Left
+    }
+}
+
+#[repr(C)]
+#[derive(AscType)]
+pub(crate) struct AscMerklePathItem {
+    pub hash: AscPtr<AscCryptoHash>,
+    pub direction: AscDirection,
+}
+
+impl AscIndexId for AscMerklePathItem {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::NearMerklePathItem;
+}
+
+#[repr(C)]
+#[derive(AscType)]
+pub(crate) struct AscExecutionOutcome {
+    pub gas_burnt: u64,
+    pub proof: AscPtr<AscMerklePathItemArray>,
+    pub block_hash: AscPtr<AscCryptoHash>,
+    pub id: AscPtr<AscCryptoHash>,
+    pub logs: AscPtr<Array<AscPtr<AscString>>>,
+    pub receipt_ids: AscPtr<AscCryptoHashArray>,
+    pub tokens_burnt: AscPtr<AscBigInt>,
+    pub executor_id: AscPtr<AscString>,
+    pub status: AscPtr<AscSuccessStatusEnum>,
+}
+
+impl AscIndexId for AscExecutionOutcome {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::NearExecutionOutcome;
+}
+
+#[repr(C)]
+#[derive(AscType)]
+pub(crate) struct AscSlashedValidator {
+    pub account_id: AscPtr<AscAccountId>,
+    pub is_double_sign: bool,
+}
+
+impl AscIndexId for AscSlashedValidator {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::NearSlashedValidator;
+}
+
+#[repr(C)]
+#[derive(AscType)]
+pub(crate) struct AscBlockHeader {
+    pub height: AscBlockHeight,
+    pub prev_height: AscBlockHeight,
+    pub block_ordinal: AscNumBlocks,
+    pub epoch_id: AscPtr<AscCryptoHash>,
+    pub next_epoch_id: AscPtr<AscCryptoHash>,
+    pub chunks_included: u64,
+    pub hash: AscPtr<AscCryptoHash>,
+    pub prev_hash: AscPtr<AscCryptoHash>,
+    pub timestamp_nanosec: u64,
+    pub prev_state_root: AscPtr<AscCryptoHash>,
+    pub chunk_receipts_root: AscPtr<AscCryptoHash>,
+    pub chunk_headers_root: AscPtr<AscCryptoHash>,
+    pub chunk_tx_root: AscPtr<AscCryptoHash>,
+    pub outcome_root: AscPtr<AscCryptoHash>,
+    pub challenges_root: AscPtr<AscCryptoHash>,
+    pub random_value: AscPtr<AscCryptoHash>,
+    pub validator_proposals: AscPtr<AscValidatorStakeArray>,
+    pub chunk_mask: AscPtr<Array<bool>>,
+    pub gas_price: AscPtr<AscBalance>,
+    pub total_supply: AscPtr<AscBalance>,
+    pub challenges_result: AscPtr<AscSlashedValidatorArray>,
+    pub last_final_block: AscPtr<AscCryptoHash>,
+    pub last_ds_final_block: AscPtr<AscCryptoHash>,
+    pub next_bp_hash: AscPtr<AscCryptoHash>,
+    pub block_merkle_root: AscPtr<AscCryptoHash>,
+    pub epoch_sync_data_hash: AscPtr<AscCryptoHash>,
+    pub approvals: AscPtr<AscSignatureArray>,
+    pub signature: AscPtr<AscSignature>,
+    pub latest_protocol_version: AscProtocolVersion,
+}
+
+impl AscIndexId for AscBlockHeader {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::NearBlockHeader;
+}
+
+#[repr(C)]
+#[derive(AscType)]
+pub(crate) struct AscValidatorStake {
+    pub account_id: AscPtr<AscAccountId>,
+    pub public_key: AscPtr<AscPublicKey>,
+    pub stake: AscPtr<AscBalance>,
+}
+
+impl AscIndexId for AscValidatorStake {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::NearValidatorStake;
+}
+
+#[repr(C)]
+#[derive(AscType)]
+pub(crate) struct AscChunkHeader {
+    pub encoded_length: u64,
+    pub gas_used: AscGas,
+    pub gas_limit: AscGas,
+    pub shard_id: AscShardId,
+    pub height_created: AscBlockHeight,
+    pub height_included: AscBlockHeight,
+    pub chunk_hash: AscPtr<AscCryptoHash>,
+    pub signature: AscPtr<AscSignature>,
+    pub prev_block_hash: AscPtr<AscCryptoHash>,
+    pub prev_state_root: AscPtr<AscCryptoHash>,
+    pub encoded_merkle_root: AscPtr<AscCryptoHash>,
+    pub balance_burnt: AscPtr<AscBalance>,
+    pub outgoing_receipts_root: AscPtr<AscCryptoHash>,
+    pub tx_root: AscPtr<AscCryptoHash>,
+    pub validator_proposals: AscPtr<AscValidatorStakeArray>,
+
+    // It seems that is impossible to correctly order fields in this struct
+    // so that Rust packs it tighly without padding. So we add 4 bytes of padding
+    // ourself.
+    //
+    // This is a bit problematic because AssemblyScript actually is ok with 84 bytes
+    // and is fully packed. Seems like a differences between alignment for `repr(C)` and
+    // AssemblyScript.
+    pub(crate) _padding: u32,
+}
+
+impl AscIndexId for AscChunkHeader {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::NearChunkHeader;
+}
+
+#[repr(C)]
+#[derive(AscType)]
+pub(crate) struct AscBlock {
+    pub author: AscPtr<AscAccountId>,
+    pub header: AscPtr<AscBlockHeader>,
+    pub chunks: AscPtr<AscChunkHeaderArray>,
+}
+
+impl AscIndexId for AscBlock {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::NearBlock;
+}
+
+#[repr(C)]
+#[derive(AscType)]
+pub(crate) struct AscReceiptWithOutcome {
+    pub outcome: AscPtr<AscExecutionOutcome>,
+    pub receipt: AscPtr<AscActionReceipt>,
+    pub block: AscPtr<AscBlock>,
+}
+
+impl AscIndexId for AscReceiptWithOutcome {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::NearReceiptWithOutcome;
+}
diff --git a/chain/near/src/runtime/mod.rs b/chain/near/src/runtime/mod.rs
new file mode 100644
index 0000000..f44391c
--- /dev/null
+++ b/chain/near/src/runtime/mod.rs
@@ -0,0 +1,6 @@
+pub use runtime_adapter::RuntimeAdapter;
+
+pub mod abi;
+pub mod runtime_adapter;
+
+mod generated;
diff --git a/chain/near/src/runtime/runtime_adapter.rs b/chain/near/src/runtime/runtime_adapter.rs
new file mode 100644
index 0000000..c5fa9e1
--- /dev/null
+++ b/chain/near/src/runtime/runtime_adapter.rs
@@ -0,0 +1,11 @@
+use crate::{data_source::DataSource, Chain};
+use blockchain::HostFn;
+use graph::{anyhow::Error, blockchain};
+
+pub struct RuntimeAdapter {}
+
+impl blockchain::RuntimeAdapter<Chain> for RuntimeAdapter {
+    fn host_fns(&self, _ds: &DataSource) -> Result<Vec<HostFn>, Error> {
+        Ok(vec![])
+    }
+}
diff --git a/chain/near/src/trigger.rs b/chain/near/src/trigger.rs
new file mode 100644
index 0000000..049cce5
--- /dev/null
+++ b/chain/near/src/trigger.rs
@@ -0,0 +1,501 @@
+use graph::blockchain::Block;
+use graph::blockchain::TriggerData;
+use graph::cheap_clone::CheapClone;
+use graph::prelude::hex;
+use graph::prelude::web3::types::H256;
+use graph::prelude::BlockNumber;
+use graph::runtime::{asc_new, gas::GasCounter, AscHeap, AscPtr, DeterministicHostError};
+use graph_runtime_wasm::module::ToAscPtr;
+use std::{cmp::Ordering, sync::Arc};
+
+use crate::codec;
+
+// Logging the block is too verbose, so this strips the block from the trigger for Debug.
+impl std::fmt::Debug for NearTrigger {
+    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
+        #[derive(Debug)]
+        pub enum MappingTriggerWithoutBlock<'a> {
+            Block,
+
+            Receipt {
+                outcome: &'a codec::ExecutionOutcomeWithId,
+                receipt: &'a codec::Receipt,
+            },
+        }
+
+        let trigger_without_block = match self {
+            NearTrigger::Block(_) => MappingTriggerWithoutBlock::Block,
+            NearTrigger::Receipt(receipt) => MappingTriggerWithoutBlock::Receipt {
+                outcome: &receipt.outcome,
+                receipt: &receipt.receipt,
+            },
+        };
+
+        write!(f, "{:?}", trigger_without_block)
+    }
+}
+
+impl ToAscPtr for NearTrigger {
+    fn to_asc_ptr<H: AscHeap>(
+        self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscPtr<()>, DeterministicHostError> {
+        Ok(match self {
+            NearTrigger::Block(block) => asc_new(heap, block.as_ref(), gas)?.erase(),
+            NearTrigger::Receipt(receipt) => asc_new(heap, receipt.as_ref(), gas)?.erase(),
+        })
+    }
+}
+
+#[derive(Clone)]
+pub enum NearTrigger {
+    Block(Arc<codec::Block>),
+    Receipt(Arc<ReceiptWithOutcome>),
+}
+
+impl CheapClone for NearTrigger {
+    fn cheap_clone(&self) -> NearTrigger {
+        match self {
+            NearTrigger::Block(block) => NearTrigger::Block(block.cheap_clone()),
+            NearTrigger::Receipt(receipt) => NearTrigger::Receipt(receipt.cheap_clone()),
+        }
+    }
+}
+
+impl PartialEq for NearTrigger {
+    fn eq(&self, other: &Self) -> bool {
+        match (self, other) {
+            (Self::Block(a_ptr), Self::Block(b_ptr)) => a_ptr == b_ptr,
+            (Self::Receipt(a), Self::Receipt(b)) => a.receipt.receipt_id == b.receipt.receipt_id,
+
+            (Self::Block(_), Self::Receipt(_)) | (Self::Receipt(_), Self::Block(_)) => false,
+        }
+    }
+}
+
+impl Eq for NearTrigger {}
+
+impl NearTrigger {
+    pub fn block_number(&self) -> BlockNumber {
+        match self {
+            NearTrigger::Block(block) => block.number(),
+            NearTrigger::Receipt(receipt) => receipt.block.number(),
+        }
+    }
+
+    pub fn block_hash(&self) -> H256 {
+        match self {
+            NearTrigger::Block(block) => block.ptr().hash_as_h256(),
+            NearTrigger::Receipt(receipt) => receipt.block.ptr().hash_as_h256(),
+        }
+    }
+}
+
+impl Ord for NearTrigger {
+    fn cmp(&self, other: &Self) -> Ordering {
+        match (self, other) {
+            // Keep the order when comparing two block triggers
+            (Self::Block(..), Self::Block(..)) => Ordering::Equal,
+
+            // Block triggers always come last
+            (Self::Block(..), _) => Ordering::Greater,
+            (_, Self::Block(..)) => Ordering::Less,
+
+            // Execution outcomes have no intrinsic ordering information, so we keep the order in
+            // which they are included in the `receipt_execution_outcomes` field of `IndexerShard`.
+            (Self::Receipt(..), Self::Receipt(..)) => Ordering::Equal,
+        }
+    }
+}
+
+impl PartialOrd for NearTrigger {
+    fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
+        Some(self.cmp(other))
+    }
+}
+
+impl TriggerData for NearTrigger {
+    fn error_context(&self) -> std::string::String {
+        match self {
+            NearTrigger::Block(..) => {
+                format!("Block #{} ({})", self.block_number(), self.block_hash())
+            }
+            NearTrigger::Receipt(receipt) => {
+                format!(
+                    "receipt id {}, block #{} ({})",
+                    hex::encode(&receipt.receipt.receipt_id.as_ref().unwrap().bytes),
+                    self.block_number(),
+                    self.block_hash()
+                )
+            }
+        }
+    }
+}
+
+pub struct ReceiptWithOutcome {
+    // REVIEW: Do we want to actually also have those two below behind an `Arc` wrapper?
+    pub outcome: codec::ExecutionOutcomeWithId,
+    pub receipt: codec::Receipt,
+    pub block: Arc<codec::Block>,
+}
+
+#[cfg(test)]
+mod tests {
+    use std::convert::TryFrom;
+
+    use super::*;
+
+    use graph::{
+        anyhow::anyhow,
+        data::subgraph::API_VERSION_0_0_5,
+        prelude::{hex, BigInt},
+        runtime::gas::GasCounter,
+        util::mem::init_slice,
+    };
+
+    #[test]
+    fn block_trigger_to_asc_ptr() {
+        let mut heap = BytesHeap::new(API_VERSION_0_0_5);
+        let trigger = NearTrigger::Block(Arc::new(block()));
+
+        let result = trigger.to_asc_ptr(&mut heap, &GasCounter::default());
+        assert!(result.is_ok());
+    }
+
+    #[test]
+    fn receipt_trigger_to_asc_ptr() {
+        let mut heap = BytesHeap::new(API_VERSION_0_0_5);
+        let trigger = NearTrigger::Receipt(Arc::new(ReceiptWithOutcome {
+            block: Arc::new(block()),
+            outcome: execution_outcome_with_id().unwrap(),
+            receipt: receipt().unwrap(),
+        }));
+
+        let result = trigger.to_asc_ptr(&mut heap, &GasCounter::default());
+        assert!(result.is_ok());
+    }
+
+    fn block() -> codec::Block {
+        codec::Block {
+            author: "test".to_string(),
+            header: Some(codec::BlockHeader {
+                height: 2,
+                prev_height: 1,
+                epoch_id: hash("01"),
+                next_epoch_id: hash("02"),
+                hash: hash("01"),
+                prev_hash: hash("00"),
+                prev_state_root: hash("bb00010203"),
+                chunk_receipts_root: hash("bb00010203"),
+                chunk_headers_root: hash("bb00010203"),
+                chunk_tx_root: hash("bb00010203"),
+                outcome_root: hash("cc00010203"),
+                chunks_included: 1,
+                challenges_root: hash("aa"),
+                timestamp: 100,
+                timestamp_nanosec: 0,
+                random_value: hash("010203"),
+                validator_proposals: vec![],
+                chunk_mask: vec![],
+                gas_price: big_int(10),
+                block_ordinal: 0,
+                total_supply: big_int(1_000),
+                challenges_result: vec![],
+                last_final_block: hash("00"),
+                last_final_block_height: 0,
+                last_ds_final_block: hash("00"),
+                last_ds_final_block_height: 0,
+                next_bp_hash: hash("bb"),
+                block_merkle_root: hash("aa"),
+                epoch_sync_data_hash: vec![0x00, 0x01],
+                approvals: vec![],
+                signature: signature("00"),
+                latest_protocol_version: 0,
+            }),
+            chunk_headers: vec![chunk_header().unwrap()],
+            shards: vec![codec::IndexerShard {
+                shard_id: 0,
+                chunk: Some(codec::IndexerChunk {
+                    author: "near".to_string(),
+                    header: chunk_header(),
+                    transactions: vec![codec::IndexerTransactionWithOutcome {
+                        transaction: Some(codec::SignedTransaction {
+                            signer_id: "signer".to_string(),
+                            public_key: public_key("aabb"),
+                            nonce: 1,
+                            receiver_id: "receiver".to_string(),
+                            actions: vec![],
+                            signature: signature("ff"),
+                            hash: hash("bb"),
+                        }),
+                        outcome: Some(codec::IndexerExecutionOutcomeWithOptionalReceipt {
+                            execution_outcome: execution_outcome_with_id(),
+                            receipt: receipt(),
+                        }),
+                    }],
+                    receipts: vec![receipt().unwrap()],
+                }),
+                receipt_execution_outcomes: vec![codec::IndexerExecutionOutcomeWithReceipt {
+                    execution_outcome: execution_outcome_with_id(),
+                    receipt: receipt(),
+                }],
+            }],
+            state_changes: vec![],
+        }
+    }
+
+    fn receipt() -> Option<codec::Receipt> {
+        Some(codec::Receipt {
+            predecessor_id: "genesis.near".to_string(),
+            receiver_id: "near".to_string(),
+            receipt_id: hash("dead"),
+            receipt: Some(codec::receipt::Receipt::Action(codec::ReceiptAction {
+                signer_id: "near".to_string(),
+                signer_public_key: public_key("aa"),
+                gas_price: big_int(2),
+                output_data_receivers: vec![],
+                input_data_ids: vec![],
+                actions: vec![
+                    codec::Action {
+                        action: Some(codec::action::Action::CreateAccount(
+                            codec::CreateAccountAction {},
+                        )),
+                    },
+                    codec::Action {
+                        action: Some(codec::action::Action::DeployContract(
+                            codec::DeployContractAction {
+                                code: vec![0x01, 0x02],
+                            },
+                        )),
+                    },
+                    codec::Action {
+                        action: Some(codec::action::Action::FunctionCall(
+                            codec::FunctionCallAction {
+                                method_name: "func".to_string(),
+                                args: vec![0x01, 0x02],
+                                gas: 1000,
+                                deposit: big_int(100),
+                            },
+                        )),
+                    },
+                    codec::Action {
+                        action: Some(codec::action::Action::Transfer(codec::TransferAction {
+                            deposit: big_int(100),
+                        })),
+                    },
+                    codec::Action {
+                        action: Some(codec::action::Action::Stake(codec::StakeAction {
+                            stake: big_int(100),
+                            public_key: public_key("aa"),
+                        })),
+                    },
+                    codec::Action {
+                        action: Some(codec::action::Action::AddKey(codec::AddKeyAction {
+                            public_key: public_key("aa"),
+                            access_key: Some(codec::AccessKey {
+                                nonce: 1,
+                                permission: Some(codec::AccessKeyPermission {
+                                    permission: Some(
+                                        codec::access_key_permission::Permission::FunctionCall(
+                                            codec::FunctionCallPermission {
+                                                // allowance can be None, so let's test this out here
+                                                allowance: None,
+                                                receiver_id: "receiver".to_string(),
+                                                method_names: vec!["sayGm".to_string()],
+                                            },
+                                        ),
+                                    ),
+                                }),
+                            }),
+                        })),
+                    },
+                    codec::Action {
+                        action: Some(codec::action::Action::AddKey(codec::AddKeyAction {
+                            public_key: public_key("aa"),
+                            access_key: Some(codec::AccessKey {
+                                nonce: 1,
+                                permission: Some(codec::AccessKeyPermission {
+                                    permission: Some(
+                                        codec::access_key_permission::Permission::FullAccess(
+                                            codec::FullAccessPermission {},
+                                        ),
+                                    ),
+                                }),
+                            }),
+                        })),
+                    },
+                    codec::Action {
+                        action: Some(codec::action::Action::DeleteKey(codec::DeleteKeyAction {
+                            public_key: public_key("aa"),
+                        })),
+                    },
+                    codec::Action {
+                        action: Some(codec::action::Action::DeleteAccount(
+                            codec::DeleteAccountAction {
+                                beneficiary_id: "suicided.near".to_string(),
+                            },
+                        )),
+                    },
+                ],
+            })),
+        })
+    }
+
+    fn chunk_header() -> Option<codec::ChunkHeader> {
+        Some(codec::ChunkHeader {
+            chunk_hash: vec![0x00],
+            prev_block_hash: vec![0x01],
+            outcome_root: vec![0x02],
+            prev_state_root: vec![0x03],
+            encoded_merkle_root: vec![0x04],
+            encoded_length: 1,
+            height_created: 2,
+            height_included: 3,
+            shard_id: 4,
+            gas_used: 5,
+            gas_limit: 6,
+            validator_reward: big_int(7),
+            balance_burnt: big_int(7),
+            outgoing_receipts_root: vec![0x07],
+            tx_root: vec![0x08],
+            validator_proposals: vec![codec::ValidatorStake {
+                account_id: "account".to_string(),
+                public_key: public_key("aa"),
+                stake: big_int(10),
+            }],
+            signature: signature("ff"),
+        })
+    }
+
+    fn execution_outcome_with_id() -> Option<codec::ExecutionOutcomeWithId> {
+        Some(codec::ExecutionOutcomeWithId {
+            proof: Some(codec::MerklePath { path: vec![] }),
+            block_hash: hash("aa"),
+            id: hash("beef"),
+            outcome: execution_outcome(),
+        })
+    }
+
+    fn execution_outcome() -> Option<codec::ExecutionOutcome> {
+        Some(codec::ExecutionOutcome {
+            logs: vec!["string".to_string()],
+            receipt_ids: vec![],
+            gas_burnt: 1,
+            tokens_burnt: big_int(2),
+            executor_id: "near".to_string(),
+            metadata: 0,
+            status: Some(codec::execution_outcome::Status::SuccessValue(
+                codec::SuccessValueExecutionStatus { value: vec![0x00] },
+            )),
+        })
+    }
+
+    fn big_int(input: u64) -> Option<codec::BigInt> {
+        let value =
+            BigInt::try_from(input).expect(format!("Invalid BigInt value {}", input).as_ref());
+        let bytes = value.to_signed_bytes_le();
+
+        Some(codec::BigInt { bytes })
+    }
+
+    fn hash(input: &str) -> Option<codec::CryptoHash> {
+        Some(codec::CryptoHash {
+            bytes: hex::decode(input).expect(format!("Invalid hash value {}", input).as_ref()),
+        })
+    }
+
+    fn public_key(input: &str) -> Option<codec::PublicKey> {
+        Some(codec::PublicKey {
+            r#type: 0,
+            bytes: hex::decode(input).expect(format!("Invalid PublicKey value {}", input).as_ref()),
+        })
+    }
+
+    fn signature(input: &str) -> Option<codec::Signature> {
+        Some(codec::Signature {
+            r#type: 0,
+            bytes: hex::decode(input).expect(format!("Invalid Signature value {}", input).as_ref()),
+        })
+    }
+
+    struct BytesHeap {
+        api_version: graph::semver::Version,
+        memory: Vec<u8>,
+    }
+
+    impl BytesHeap {
+        fn new(api_version: graph::semver::Version) -> Self {
+            Self {
+                api_version,
+                memory: vec![],
+            }
+        }
+    }
+
+    impl AscHeap for BytesHeap {
+        fn raw_new(
+            &mut self,
+            bytes: &[u8],
+            _gas: &GasCounter,
+        ) -> Result<u32, DeterministicHostError> {
+            self.memory.extend_from_slice(bytes);
+            Ok((self.memory.len() - bytes.len()) as u32)
+        }
+
+        fn read_u32(&self, offset: u32, gas: &GasCounter) -> Result<u32, DeterministicHostError> {
+            let mut data = [std::mem::MaybeUninit::<u8>::uninit(); 4];
+            let init = self.read(offset, &mut data, gas)?;
+            Ok(u32::from_le_bytes(init.try_into().unwrap()))
+        }
+
+        fn read<'a>(
+            &self,
+            offset: u32,
+            buffer: &'a mut [std::mem::MaybeUninit<u8>],
+            _gas: &GasCounter,
+        ) -> Result<&'a mut [u8], DeterministicHostError> {
+            let memory_byte_count = self.memory.len();
+            if memory_byte_count == 0 {
+                return Err(DeterministicHostError::from(anyhow!(
+                    "No memory is allocated"
+                )));
+            }
+
+            let start_offset = offset as usize;
+            let end_offset_exclusive = start_offset + buffer.len();
+
+            if start_offset >= memory_byte_count {
+                return Err(DeterministicHostError::from(anyhow!(
+                    "Start offset {} is outside of allocated memory, max offset is {}",
+                    start_offset,
+                    memory_byte_count - 1
+                )));
+            }
+
+            if end_offset_exclusive > memory_byte_count {
+                return Err(DeterministicHostError::from(anyhow!(
+                    "End of offset {} is outside of allocated memory, max offset is {}",
+                    end_offset_exclusive,
+                    memory_byte_count - 1
+                )));
+            }
+
+            let src = &self.memory[start_offset..end_offset_exclusive];
+
+            Ok(init_slice(src, buffer))
+        }
+
+        fn api_version(&self) -> graph::semver::Version {
+            self.api_version.clone()
+        }
+
+        fn asc_type_id(
+            &mut self,
+            type_id_index: graph::runtime::IndexForAscTypeId,
+        ) -> Result<u32, DeterministicHostError> {
+            // Not totally clear what is the purpose of this method, why not a default implementation here?
+            Ok(type_id_index as u32)
+        }
+    }
+}
diff --git a/chain/substreams/Cargo.toml b/chain/substreams/Cargo.toml
new file mode 100644
index 0000000..bc9bdbc
--- /dev/null
+++ b/chain/substreams/Cargo.toml
@@ -0,0 +1,31 @@
+[package]
+name = "graph-chain-substreams"
+version = "0.27.0"
+edition = "2021"
+
+[build-dependencies]
+tonic-build = { version = "0.7.2", features = ["prost"] }
+
+[dependencies]
+async-stream = "0.3"
+envconfig = "0.10.0"
+futures = "0.1.21"
+http = "0.2.4"
+jsonrpc-core = "18.0.0"
+graph = { path = "../../graph" }
+graph-runtime-wasm = { path = "../../runtime/wasm" }
+lazy_static = "1.2.0"
+serde = "1.0"
+prost = "0.10.4"
+prost-types = "0.10.1"
+dirs-next = "2.0"
+anyhow = "1.0"
+tiny-keccak = "1.5.0"
+hex = "0.4.3"
+semver = "1.0.12"
+
+itertools = "0.10.3"
+
+[dev-dependencies]
+graph-core = { path = "../../core" }
+tokio = { version = "1", features = ["full"]}
diff --git a/chain/substreams/build.rs b/chain/substreams/build.rs
new file mode 100644
index 0000000..8998174
--- /dev/null
+++ b/chain/substreams/build.rs
@@ -0,0 +1,7 @@
+fn main() {
+    println!("cargo:rerun-if-changed=proto");
+    tonic_build::configure()
+        .out_dir("src/protobuf")
+        .compile(&["codec.proto"], &["proto"])
+        .expect("Failed to compile Substreams entity proto(s)");
+}
diff --git a/chain/substreams/examples/README.md b/chain/substreams/examples/README.md
new file mode 100644
index 0000000..afd1882
--- /dev/null
+++ b/chain/substreams/examples/README.md
@@ -0,0 +1,13 @@
+## Substreams example
+
+1. Set environmental variables
+```bash
+$> export SUBSTREAMS_API_TOKEN=your_sf_token
+$> export SUBSTREAMS_ENDPOINT=your_sf_endpoint # you can also not define this one and use the default specified endpoint
+$> export SUBSTREAMS_PACKAGE=path_to_your_spkg
+```
+
+2. Run `substreams` example
+```bash
+cargo run -p graph-chain-substreams --example substreams [module_name] # for graph entities run `graph_out`
+```
diff --git a/chain/substreams/examples/substreams.rs b/chain/substreams/examples/substreams.rs
new file mode 100644
index 0000000..bc7af4a
--- /dev/null
+++ b/chain/substreams/examples/substreams.rs
@@ -0,0 +1,107 @@
+use anyhow::{format_err, Context, Error};
+use graph::blockchain::block_stream::BlockStreamEvent;
+use graph::blockchain::substreams_block_stream::SubstreamsBlockStream;
+use graph::prelude::{info, tokio, DeploymentHash, Registry};
+use graph::tokio_stream::StreamExt;
+use graph::{
+    env::env_var,
+    firehose::FirehoseEndpoint,
+    log::logger,
+    substreams::{self},
+};
+use graph_chain_substreams::mapper::Mapper;
+use graph_core::MetricsRegistry;
+use prost::Message;
+use std::env;
+use std::sync::Arc;
+
+#[tokio::main]
+async fn main() -> Result<(), Error> {
+    let module_name = env::args().nth(1).unwrap();
+
+    let token_env = env_var("SUBSTREAMS_API_TOKEN", "".to_string());
+    let mut token: Option<String> = None;
+    if token_env.len() > 0 {
+        token = Some(token_env);
+    }
+
+    let endpoint = env_var(
+        "SUBSTREAMS_ENDPOINT",
+        "https://api-dev.streamingfast.io".to_string(),
+    );
+
+    let package_file = env_var("SUBSTREAMS_PACKAGE", "".to_string());
+    if package_file == "" {
+        panic!("Environment variable SUBSTREAMS_PACKAGE must be set");
+    }
+
+    let package = read_package(&package_file)?;
+
+    let logger = logger(true);
+    // Set up Prometheus registry
+    let prometheus_registry = Arc::new(Registry::new());
+    let metrics_registry = Arc::new(MetricsRegistry::new(
+        logger.clone(),
+        prometheus_registry.clone(),
+    ));
+
+    let firehose = Arc::new(FirehoseEndpoint::new(
+        "substreams",
+        &endpoint,
+        token,
+        false,
+        false,
+        1,
+    ));
+
+    let mut stream: SubstreamsBlockStream<graph_chain_substreams::Chain> =
+        SubstreamsBlockStream::new(
+            DeploymentHash::new("substreams".to_string()).unwrap(),
+            firehose.clone(),
+            None,
+            None,
+            Arc::new(Mapper {}),
+            package.modules.clone(),
+            module_name.to_string(),
+            vec![12369621],
+            vec![],
+            logger.clone(),
+            metrics_registry,
+        );
+
+    loop {
+        match stream.next().await {
+            None => {
+                break;
+            }
+            Some(event) => match event {
+                Err(_) => {}
+                Ok(block_stream_event) => match block_stream_event {
+                    BlockStreamEvent::Revert(_, _) => {}
+                    BlockStreamEvent::ProcessBlock(block_with_trigger, _) => {
+                        let changes = block_with_trigger.block;
+                        for change in changes.entity_changes {
+                            info!(&logger, "----- Entity -----");
+                            info!(
+                                &logger,
+                                "name: {} operation: {}", change.entity, change.operation
+                            );
+                            for field in change.fields {
+                                info!(&logger, "field: {}, type: {}", field.name, field.value_type);
+                                info!(&logger, "new value: {}", hex::encode(field.new_value));
+                                info!(&logger, "old value: {}", hex::encode(field.old_value));
+                            }
+                        }
+                    }
+                },
+            },
+        }
+    }
+
+    Ok(())
+}
+
+fn read_package(file: &str) -> Result<substreams::Package, anyhow::Error> {
+    let content = std::fs::read(file).context(format_err!("read package {}", file))?;
+    substreams::Package::decode(content.as_ref()).context("decode command")
+}
diff --git a/chain/substreams/proto/codec.proto b/chain/substreams/proto/codec.proto
new file mode 100644
index 0000000..4320cb7
--- /dev/null
+++ b/chain/substreams/proto/codec.proto
@@ -0,0 +1,42 @@
+syntax = "proto3";
+
+package substreams.entity.v1;
+
+message EntitiesChanges {
+  bytes block_id = 1;
+  uint64 block_number = 2;
+  bytes prev_block_id = 3;
+  uint64 prev_block_number = 4;
+  repeated EntityChange entityChanges = 5;
+}
+
+message EntityChange {
+  string entity = 1;
+  bytes id = 2;
+  uint64 ordinal = 3;
+  enum Operation {
+    UNSET = 0; // Protobuf default should not be used, this is used so that the consume can ensure that the value was actually specified
+    CREATE = 1;
+    UPDATE = 2;
+    DELETE = 3;
+  }
+  Operation operation = 4;
+  repeated Field fields = 5;
+}
+
+message Field {
+  string name = 1;
+  enum Type {
+    UNSET = 0; // Protobuf default should not be used, this is used so that the consume can ensure that the value was actually specified
+    BIGDECIMAL = 1;
+    BIGINT = 2;
+    INT = 3; // int32
+    BYTES = 4;
+    STRING = 5;
+  }
+  Type value_type = 2;
+  bytes new_value = 3;
+  bool new_value_null = 4;
+  bytes old_value = 5;
+  bool old_value_null = 6;
+}
diff --git a/chain/substreams/src/block_stream.rs b/chain/substreams/src/block_stream.rs
new file mode 100644
index 0000000..ef8409a
--- /dev/null
+++ b/chain/substreams/src/block_stream.rs
@@ -0,0 +1,80 @@
+use anyhow::Result;
+use std::sync::Arc;
+
+use graph::{
+    blockchain::{
+        block_stream::{
+            BlockStream, BlockStreamBuilder as BlockStreamBuilderTrait, FirehoseCursor,
+        },
+        substreams_block_stream::SubstreamsBlockStream,
+    },
+    components::store::DeploymentLocator,
+    data::subgraph::UnifiedMappingApiVersion,
+    prelude::{async_trait, BlockNumber, BlockPtr},
+    slog::o,
+};
+
+use crate::{mapper::Mapper, Chain, TriggerFilter};
+
+pub struct BlockStreamBuilder {}
+
+impl BlockStreamBuilder {
+    pub fn new() -> Self {
+        Self {}
+    }
+}
+
+#[async_trait]
+/// Substreams doesn't actually use Firehose, the configuration for firehose and the grpc substream
+/// is very similar, so we can re-use the configuration and the builder for it.
+/// This is probably something to improve but for now it works.
+impl BlockStreamBuilderTrait<Chain> for BlockStreamBuilder {
+    async fn build_firehose(
+        &self,
+        chain: &Chain,
+        deployment: DeploymentLocator,
+        block_cursor: FirehoseCursor,
+        _start_blocks: Vec<BlockNumber>,
+        _subgraph_current_block: Option<BlockPtr>,
+        filter: Arc<TriggerFilter>,
+        _unified_api_version: UnifiedMappingApiVersion,
+    ) -> Result<Box<dyn BlockStream<Chain>>> {
+        let firehose_endpoint = match chain.endpoints.random() {
+            Some(e) => e.clone(),
+            None => return Err(anyhow::format_err!("no firehose endpoint available")),
+        };
+
+        let mapper = Arc::new(Mapper {});
+
+        let logger = chain
+            .logger_factory
+            .subgraph_logger(&deployment)
+            .new(o!("component" => "SubstreamsBlockStream"));
+
+        Ok(Box::new(SubstreamsBlockStream::new(
+            deployment.hash,
+            firehose_endpoint,
+            None,
+            block_cursor.as_ref().clone(),
+            mapper,
+            filter.modules.clone(),
+            filter.module_name.clone(),
+            filter.start_block.map(|x| vec![x]).unwrap_or(vec![]),
+            vec![],
+            logger,
+            chain.metrics_registry.clone(),
+        )))
+    }
+
+    async fn build_polling(
+        &self,
+        _chain: Arc<Chain>,
+        _deployment: DeploymentLocator,
+        _start_blocks: Vec<BlockNumber>,
+        _subgraph_current_block: Option<BlockPtr>,
+        _filter: Arc<TriggerFilter>,
+        _unified_api_version: UnifiedMappingApiVersion,
+    ) -> Result<Box<dyn BlockStream<Chain>>> {
+        unimplemented!("polling block stream is not support for substreams")
+    }
+}
diff --git a/chain/substreams/src/chain.rs b/chain/substreams/src/chain.rs
new file mode 100644
index 0000000..68a7389
--- /dev/null
+++ b/chain/substreams/src/chain.rs
@@ -0,0 +1,194 @@
+use crate::{data_source::*, Block, TriggerData, TriggerFilter, TriggersAdapter};
+use anyhow::Error;
+use core::fmt;
+use graph::firehose::FirehoseEndpoints;
+use graph::prelude::{BlockHash, LoggerFactory, MetricsRegistry};
+use graph::{
+    blockchain::{
+        self,
+        block_stream::{BlockStream, BlockStreamBuilder, FirehoseCursor},
+        BlockPtr, Blockchain, BlockchainKind, IngestorError, RuntimeAdapter as RuntimeAdapterTrait,
+    },
+    components::store::DeploymentLocator,
+    data::subgraph::UnifiedMappingApiVersion,
+    impl_slog_value,
+    prelude::{async_trait, BlockNumber, ChainStore},
+    slog::Logger,
+};
+use std::{str::FromStr, sync::Arc};
+
+impl blockchain::Block for Block {
+    fn ptr(&self) -> BlockPtr {
+        return BlockPtr {
+            hash: BlockHash(Box::from(self.block_id.clone())),
+            number: self.block_number as i32,
+        };
+    }
+
+    fn parent_ptr(&self) -> Option<BlockPtr> {
+        Some(BlockPtr {
+            hash: BlockHash(Box::from(self.prev_block_id.clone())),
+            number: self.prev_block_number as i32,
+        })
+    }
+}
+
+pub struct Chain {
+    chain_store: Arc<dyn ChainStore>,
+    block_stream_builder: Arc<dyn BlockStreamBuilder<Self>>,
+
+    pub(crate) logger_factory: LoggerFactory,
+    pub(crate) endpoints: FirehoseEndpoints,
+    pub(crate) metrics_registry: Arc<dyn MetricsRegistry>,
+}
+
+impl Chain {
+    pub fn new(
+        logger_factory: LoggerFactory,
+        endpoints: FirehoseEndpoints,
+        metrics_registry: Arc<dyn MetricsRegistry>,
+        chain_store: Arc<dyn ChainStore>,
+        block_stream_builder: Arc<dyn BlockStreamBuilder<Self>>,
+    ) -> Self {
+        Self {
+            logger_factory,
+            endpoints,
+            metrics_registry,
+            chain_store,
+            block_stream_builder,
+        }
+    }
+}
+
+impl std::fmt::Debug for Chain {
+    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
+        write!(f, "chain: substreams")
+    }
+}
+
+#[derive(Clone, Copy, Debug, PartialEq, PartialOrd, Ord, Eq)]
+pub struct NodeCapabilities {}
+
+impl FromStr for NodeCapabilities {
+    type Err = Error;
+
+    fn from_str(_s: &str) -> Result<Self, Self::Err> {
+        Ok(NodeCapabilities {})
+    }
+}
+
+impl fmt::Display for NodeCapabilities {
+    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
+        f.write_str("substream")
+    }
+}
+
+impl_slog_value!(NodeCapabilities, "{}");
+
+impl graph::blockchain::NodeCapabilities<Chain> for NodeCapabilities {
+    fn from_data_sources(_data_sources: &[DataSource]) -> Self {
+        NodeCapabilities {}
+    }
+}
+
+#[async_trait]
+impl Blockchain for Chain {
+    const KIND: BlockchainKind = BlockchainKind::Substreams;
+
+    type Block = Block;
+    type DataSource = DataSource;
+    type UnresolvedDataSource = UnresolvedDataSource;
+
+    type DataSourceTemplate = NoopDataSourceTemplate;
+    type UnresolvedDataSourceTemplate = NoopDataSourceTemplate;
+
+    /// Trigger data as parsed from the triggers adapter.
+    type TriggerData = TriggerData;
+
+    /// Decoded trigger ready to be processed by the mapping.
+    /// New implementations should have this be the same as `TriggerData`.
+    type MappingTrigger = TriggerData;
+
+    /// Trigger filter used as input to the triggers adapter.
+    type TriggerFilter = TriggerFilter;
+
+    type NodeCapabilities = NodeCapabilities;
+
+    fn triggers_adapter(
+        &self,
+        _log: &DeploymentLocator,
+        _capabilities: &Self::NodeCapabilities,
+        _unified_api_version: UnifiedMappingApiVersion,
+    ) -> Result<Arc<dyn blockchain::TriggersAdapter<Self>>, Error> {
+        Ok(Arc::new(TriggersAdapter {}))
+    }
+
+    async fn new_firehose_block_stream(
+        &self,
+        deployment: DeploymentLocator,
+        block_cursor: FirehoseCursor,
+        start_blocks: Vec<BlockNumber>,
+        subgraph_current_block: Option<BlockPtr>,
+        filter: Arc<Self::TriggerFilter>,
+        unified_api_version: UnifiedMappingApiVersion,
+    ) -> Result<Box<dyn BlockStream<Self>>, Error> {
+        self.block_stream_builder
+            .build_firehose(
+                self,
+                deployment,
+                block_cursor,
+                start_blocks,
+                subgraph_current_block,
+                filter,
+                unified_api_version,
+            )
+            .await
+    }
+
+    async fn new_polling_block_stream(
+        &self,
+        _deployment: DeploymentLocator,
+        _start_blocks: Vec<BlockNumber>,
+        _subgraph_current_block: Option<BlockPtr>,
+        _filter: Arc<Self::TriggerFilter>,
+        _unified_api_version: UnifiedMappingApiVersion,
+    ) -> Result<Box<dyn BlockStream<Self>>, Error> {
+        unimplemented!("this should never be called for substreams")
+    }
+
+    fn chain_store(&self) -> Arc<dyn ChainStore> {
+        self.chain_store.clone()
+    }
+
+    async fn block_pointer_from_number(
+        &self,
+        _logger: &Logger,
+        number: BlockNumber,
+    ) -> Result<BlockPtr, IngestorError> {
+        // This is the same thing TriggersAdapter does, not sure if it's going to work but
+        // we also don't yet have a good way of getting this value until we sort out the
+        // chain store.
+        // TODO(filipe): Fix this once the chain_store is correctly setup for substreams.
+        Ok(BlockPtr {
+            hash: BlockHash::from(vec![0xff; 32]),
+            number,
+        })
+    }
+    fn runtime_adapter(&self) -> Arc<dyn RuntimeAdapterTrait<Self>> {
+        Arc::new(RuntimeAdapter {})
+    }
+
+    fn is_firehose_supported(&self) -> bool {
+        true
+    }
+}
+
+pub struct RuntimeAdapter {}
+impl RuntimeAdapterTrait<crate::Chain> for RuntimeAdapter {
+    fn host_fns(
+        &self,
+        _ds: &<crate::Chain as Blockchain>::DataSource,
+    ) -> Result<Vec<blockchain::HostFn>, Error> {
+        todo!()
+    }
+}
diff --git a/chain/substreams/src/codec.rs b/chain/substreams/src/codec.rs
new file mode 100644
index 0000000..31781ba
--- /dev/null
+++ b/chain/substreams/src/codec.rs
@@ -0,0 +1,5 @@
+#[rustfmt::skip]
+#[path = "protobuf/substreams.entity.v1.rs"]
+mod pbsubstreamsentity;
+
+pub use pbsubstreamsentity::*;
diff --git a/chain/substreams/src/data_source.rs b/chain/substreams/src/data_source.rs
new file mode 100644
index 0000000..d4b7370
--- /dev/null
+++ b/chain/substreams/src/data_source.rs
@@ -0,0 +1,409 @@
+use std::sync::Arc;
+
+use anyhow::{anyhow, Error};
+use graph::{
+    blockchain,
+    cheap_clone::CheapClone,
+    components::link_resolver::LinkResolver,
+    prelude::{async_trait, BlockNumber, DataSourceTemplateInfo, Link},
+    slog::Logger,
+};
+
+use prost::Message;
+use serde::Deserialize;
+
+use crate::{chain::Chain, Block, TriggerData};
+
+pub const SUBSTREAMS_KIND: &str = "substreams";
+
+const DYNAMIC_DATA_SOURCE_ERROR: &str = "Substreams do not support dynamic data sources";
+const TEMPLATE_ERROR: &str = "Substreams do not support templates";
+
+const ALLOWED_MAPPING_KIND: [&'static str; 1] = ["substreams/graph-entities"];
+
+#[derive(Clone, Debug, PartialEq)]
+/// Represents the DataSource portion of the manifest once it has been parsed
+/// and the substream spkg has been downloaded + parsed.
+pub struct DataSource {
+    pub kind: String,
+    pub network: Option<String>,
+    pub name: String,
+    pub(crate) source: Source,
+    pub mapping: Mapping,
+    pub context: Arc<Option<graph::prelude::DataSourceContext>>,
+    pub initial_block: Option<BlockNumber>,
+}
+
+impl TryFrom<DataSourceTemplateInfo<Chain>> for DataSource {
+    type Error = anyhow::Error;
+
+    fn try_from(_value: DataSourceTemplateInfo<Chain>) -> Result<Self, Self::Error> {
+        Err(anyhow!("Substreams does not support templates"))
+    }
+}
+
+impl blockchain::DataSource<Chain> for DataSource {
+    fn address(&self) -> Option<&[u8]> {
+        None
+    }
+
+    fn start_block(&self) -> BlockNumber {
+        self.initial_block.unwrap_or(0)
+    }
+
+    fn name(&self) -> &str {
+        &self.name
+    }
+
+    fn kind(&self) -> &str {
+        &self.kind
+    }
+
+    fn network(&self) -> Option<&str> {
+        self.network.as_ref().map(|s| s.as_str())
+    }
+
+    fn context(&self) -> Arc<Option<graph::prelude::DataSourceContext>> {
+        self.context.cheap_clone()
+    }
+
+    fn creation_block(&self) -> Option<BlockNumber> {
+        None
+    }
+
+    fn api_version(&self) -> semver::Version {
+        self.mapping.api_version.clone()
+    }
+
+    // runtime is not needed for substreams, it will cause the host creation to be skipped.
+    fn runtime(&self) -> Option<Arc<Vec<u8>>> {
+        None
+    }
+
+    // match_and_decode only seems to be used on the default trigger processor which substreams
+    // bypasses so it should be fine to leave it unimplemented.
+    fn match_and_decode(
+        &self,
+        _trigger: &TriggerData,
+        _block: &Arc<Block>,
+        _logger: &Logger,
+    ) -> Result<Option<blockchain::TriggerWithHandler<Chain>>, Error> {
+        unimplemented!()
+    }
+
+    fn is_duplicate_of(&self, _other: &Self) -> bool {
+        todo!()
+    }
+
+    fn as_stored_dynamic_data_source(&self) -> graph::components::store::StoredDynamicDataSource {
+        unimplemented!("{}", DYNAMIC_DATA_SOURCE_ERROR)
+    }
+
+    fn validate(&self) -> Vec<Error> {
+        let mut errs = vec![];
+
+        if &self.kind != SUBSTREAMS_KIND {
+            errs.push(anyhow!(
+                "data source has invalid `kind`, expected {} but found {}",
+                SUBSTREAMS_KIND,
+                self.kind
+            ))
+        }
+
+        if self.name.is_empty() {
+            errs.push(anyhow!("name cannot be empty"));
+        }
+
+        if !ALLOWED_MAPPING_KIND.contains(&self.mapping.kind.as_str()) {
+            errs.push(anyhow!(
+                "mapping kind has to be one of {:?}, found {}",
+                ALLOWED_MAPPING_KIND,
+                self.mapping.kind
+            ))
+        }
+
+        errs
+    }
+
+    fn from_stored_dynamic_data_source(
+        _template: &<Chain as blockchain::Blockchain>::DataSourceTemplate,
+        _stored: graph::components::store::StoredDynamicDataSource,
+    ) -> Result<Self, Error> {
+        Err(anyhow!(DYNAMIC_DATA_SOURCE_ERROR))
+    }
+}
+
+#[derive(Clone, Debug, Default, PartialEq)]
+/// Module name comes from the manifest, package is the parsed spkg file.
+pub struct Source {
+    pub module_name: String,
+    pub package: graph::substreams::Package,
+}
+
+#[derive(Clone, Debug, PartialEq, Eq)]
+pub struct Mapping {
+    pub api_version: semver::Version,
+    pub kind: String,
+}
+
+#[derive(Clone, Debug, Deserialize, PartialEq, Eq)]
+/// Raw representation of the data source for deserialization purposes.
+pub struct UnresolvedDataSource {
+    pub kind: String,
+    pub network: Option<String>,
+    pub name: String,
+    pub(crate) source: UnresolvedSource,
+    pub mapping: UnresolvedMapping,
+}
+
+#[derive(Clone, Debug, Default, Hash, Eq, PartialEq, Deserialize)]
+#[serde(rename_all = "camelCase")]
+/// Text api_version, before parsing and validation.
+pub struct UnresolvedMapping {
+    pub api_version: String,
+    pub kind: String,
+}
+
+#[async_trait]
+impl blockchain::UnresolvedDataSource<Chain> for UnresolvedDataSource {
+    async fn resolve(
+        self,
+        resolver: &Arc<dyn LinkResolver>,
+        logger: &Logger,
+        _manifest_idx: u32,
+    ) -> Result<DataSource, Error> {
+        let content = resolver.cat(logger, &self.source.package.file).await?;
+
+        let package = graph::substreams::Package::decode(content.as_ref())?;
+
+        let initial_block: Option<u64> = match package.modules {
+            Some(ref modules) => modules.modules.iter().map(|x| x.initial_block).min(),
+            None => None,
+        };
+
+        let initial_block: Option<i32> = initial_block
+            .map_or(Ok(None), |x: u64| TryInto::<i32>::try_into(x).map(Some))
+            .map_err(anyhow::Error::from)?;
+
+        Ok(DataSource {
+            kind: SUBSTREAMS_KIND.into(),
+            network: self.network,
+            name: self.name,
+            source: Source {
+                module_name: self.source.package.module_name,
+                package,
+            },
+            mapping: Mapping {
+                api_version: semver::Version::parse(&self.mapping.api_version)?,
+                kind: self.mapping.kind,
+            },
+            context: Arc::new(None),
+            initial_block,
+        })
+    }
+}
+
+#[derive(Clone, Debug, Default, Hash, Eq, PartialEq, Deserialize)]
+#[serde(rename_all = "camelCase")]
+/// Source is a part of the manifest and this is needed for parsing.
+pub struct UnresolvedSource {
+    package: UnresolvedPackage,
+}
+
+#[derive(Clone, Debug, Default, Hash, Eq, PartialEq, Deserialize)]
+#[serde(rename_all = "camelCase")]
+/// The unresolved Package section of the manifest.
+pub struct UnresolvedPackage {
+    pub module_name: String,
+    pub file: Link,
+}
+
+#[derive(Debug, Clone, Default, Deserialize)]
+/// This is necessary for the Blockchain trait associated types, substreams do not support
+/// data source templates so this is a noop and is not expected to be called.
+pub struct NoopDataSourceTemplate {}
+
+impl blockchain::DataSourceTemplate<Chain> for NoopDataSourceTemplate {
+    fn name(&self) -> &str {
+        unimplemented!("{}", TEMPLATE_ERROR);
+    }
+
+    fn api_version(&self) -> semver::Version {
+        unimplemented!("{}", TEMPLATE_ERROR);
+    }
+
+    fn runtime(&self) -> Option<Arc<Vec<u8>>> {
+        unimplemented!("{}", TEMPLATE_ERROR);
+    }
+
+    fn manifest_idx(&self) -> u32 {
+        todo!()
+    }
+}
+
+#[async_trait]
+impl blockchain::UnresolvedDataSourceTemplate<Chain> for NoopDataSourceTemplate {
+    async fn resolve(
+        self,
+        _resolver: &Arc<dyn LinkResolver>,
+        _logger: &Logger,
+        _manifest_idx: u32,
+    ) -> Result<NoopDataSourceTemplate, anyhow::Error> {
+        unimplemented!("{}", TEMPLATE_ERROR)
+    }
+}
+
+#[cfg(test)]
+mod test {
+    use std::{str::FromStr, sync::Arc};
+
+    use anyhow::Error;
+    use graph::{
+        blockchain::{DataSource as _, UnresolvedDataSource as _},
+        components::link_resolver::LinkResolver,
+        prelude::{async_trait, serde_yaml, JsonValueStream, Link},
+        slog::{o, Discard, Logger},
+    };
+
+    use crate::{DataSource, Mapping, UnresolvedDataSource, UnresolvedMapping, SUBSTREAMS_KIND};
+
+    const EMPTY_PACKAGE: graph::substreams::Package = graph::substreams::Package {
+        proto_files: vec![],
+        version: 0,
+        modules: None,
+        module_meta: vec![],
+        package_meta: vec![],
+    };
+
+    #[test]
+    fn parse_data_source() {
+        let ds: UnresolvedDataSource = serde_yaml::from_str(TEMPLATE_DATA_SOURCE).unwrap();
+        let expected = UnresolvedDataSource {
+            kind: SUBSTREAMS_KIND.into(),
+            network: Some("mainnet".into()),
+            name: "Uniswap".into(),
+            source: crate::UnresolvedSource {
+                package: crate::UnresolvedPackage {
+                    module_name: "output".into(),
+                    file: Link {
+                        link: "/ipfs/QmbHnhUFZa6qqqRyubUYhXntox1TCBxqryaBM1iNGqVJzT".into(),
+                    },
+                },
+            },
+            mapping: UnresolvedMapping {
+                api_version: "0.0.7".into(),
+                kind: "substreams/graph-entities".into(),
+            },
+        };
+        assert_eq!(ds, expected);
+    }
+
+    #[tokio::test]
+    async fn data_source_conversion() {
+        let ds: UnresolvedDataSource = serde_yaml::from_str(TEMPLATE_DATA_SOURCE).unwrap();
+        let link_resolver: Arc<dyn LinkResolver> = Arc::new(NoopLinkResolver {});
+        let logger = Logger::root(Discard, o!());
+        let ds: DataSource = ds.resolve(&link_resolver, &logger, 0).await.unwrap();
+        let expected = DataSource {
+            kind: SUBSTREAMS_KIND.into(),
+            network: Some("mainnet".into()),
+            name: "Uniswap".into(),
+            source: crate::Source {
+                module_name: "output".into(),
+                package: EMPTY_PACKAGE,
+            },
+            mapping: Mapping {
+                api_version: semver::Version::from_str("0.0.7").unwrap(),
+                kind: "substreams/graph-entities".into(),
+            },
+            context: Arc::new(None),
+            initial_block: None,
+        };
+        assert_eq!(ds, expected);
+    }
+
+    #[test]
+    fn data_source_validation() {
+        let mut ds = gen_data_source();
+        assert_eq!(true, ds.validate().is_empty());
+
+        ds.network = None;
+        assert_eq!(true, ds.validate().is_empty());
+
+        ds.kind = "asdasd".into();
+        ds.name = "".into();
+        ds.mapping.kind = "asdasd".into();
+        let errs: Vec<String> = ds.validate().into_iter().map(|e| e.to_string()).collect();
+        assert_eq!(
+            errs,
+            vec![
+                "data source has invalid `kind`, expected substreams but found asdasd",
+                "name cannot be empty",
+                "mapping kind has to be one of [\"substreams/graph-entities\"], found asdasd"
+            ]
+        );
+    }
+
+    fn gen_data_source() -> DataSource {
+        DataSource {
+            kind: SUBSTREAMS_KIND.into(),
+            network: Some("mainnet".into()),
+            name: "Uniswap".into(),
+            source: crate::Source {
+                module_name: "".to_string(),
+                package: EMPTY_PACKAGE,
+            },
+            mapping: Mapping {
+                api_version: semver::Version::from_str("0.0.7").unwrap(),
+                kind: "substreams/graph-entities".into(),
+            },
+            context: Arc::new(None),
+            initial_block: None,
+        }
+    }
+
+    const TEMPLATE_DATA_SOURCE: &str = r#"
+        kind: substreams
+        name: Uniswap
+        network: mainnet
+        source:
+          package:
+            moduleName: output
+            file:
+              /: /ipfs/QmbHnhUFZa6qqqRyubUYhXntox1TCBxqryaBM1iNGqVJzT
+              # This IPFs path would be generated from a local path at deploy time
+        mapping:
+          kind: substreams/graph-entities
+          apiVersion: 0.0.7
+    "#;
+
+    #[derive(Debug)]
+    struct NoopLinkResolver {}
+
+    #[async_trait]
+    impl LinkResolver for NoopLinkResolver {
+        fn with_timeout(&self, _timeout: std::time::Duration) -> Box<dyn LinkResolver> {
+            unimplemented!()
+        }
+
+        fn with_retries(&self) -> Box<dyn LinkResolver> {
+            unimplemented!()
+        }
+
+        async fn cat(&self, _logger: &Logger, _link: &Link) -> Result<Vec<u8>, Error> {
+            Ok(vec![])
+        }
+
+        async fn get_block(&self, _logger: &Logger, _link: &Link) -> Result<Vec<u8>, Error> {
+            unimplemented!()
+        }
+
+        async fn json_stream(
+            &self,
+            _logger: &Logger,
+            _link: &Link,
+        ) -> Result<JsonValueStream, Error> {
+            unimplemented!()
+        }
+    }
+}
diff --git a/chain/substreams/src/lib.rs b/chain/substreams/src/lib.rs
new file mode 100644
index 0000000..68fa97c
--- /dev/null
+++ b/chain/substreams/src/lib.rs
@@ -0,0 +1,16 @@
+mod block_stream;
+mod chain;
+mod codec;
+mod data_source;
+mod trigger;
+
+pub mod mapper;
+
+pub use block_stream::BlockStreamBuilder;
+pub use chain::*;
+pub use codec::EntitiesChanges as Block;
+pub use data_source::*;
+pub use trigger::*;
+
+pub use codec::field::Type as FieldType;
+pub use codec::Field;
diff --git a/chain/substreams/src/mapper.rs b/chain/substreams/src/mapper.rs
new file mode 100644
index 0000000..48c61a8
--- /dev/null
+++ b/chain/substreams/src/mapper.rs
@@ -0,0 +1,77 @@
+use crate::{Block, Chain, TriggerData};
+use graph::blockchain::block_stream::SubstreamsError::{
+    MultipleModuleOutputError, UnexpectedStoreDeltaOutput,
+};
+use graph::blockchain::block_stream::{
+    BlockStreamEvent, BlockWithTriggers, FirehoseCursor, SubstreamsError, SubstreamsMapper,
+};
+use graph::prelude::{async_trait, BlockNumber, BlockPtr, Logger};
+use graph::substreams::module_output::Data;
+use graph::substreams::{BlockScopedData, ForkStep};
+use prost::Message;
+
+pub struct Mapper {}
+
+#[async_trait]
+impl SubstreamsMapper<Chain> for Mapper {
+    async fn to_block_stream_event(
+        &self,
+        _logger: &Logger,
+        block_scoped_data: &BlockScopedData,
+    ) -> Result<Option<BlockStreamEvent<Chain>>, SubstreamsError> {
+        let step = ForkStep::from_i32(block_scoped_data.step).unwrap_or_else(|| {
+            panic!(
+                "unknown step i32 value {}, maybe you forgot update & re-regenerate the protobuf definitions?",
+                block_scoped_data.step
+            )
+        });
+
+        if block_scoped_data.outputs.len() == 0 {
+            return Ok(None);
+        }
+
+        if block_scoped_data.outputs.len() > 1 {
+            return Err(MultipleModuleOutputError());
+        }
+
+        //todo: handle step
+        let module_output = &block_scoped_data.outputs[0];
+        let cursor = &block_scoped_data.cursor;
+
+        match module_output.data.as_ref().unwrap() {
+            Data::MapOutput(msg) => {
+                let changes: Block = Message::decode(msg.value.as_slice()).unwrap();
+
+                use ForkStep::*;
+                match step {
+                    StepIrreversible | StepNew => Ok(Some(BlockStreamEvent::ProcessBlock(
+                        // Even though the trigger processor for substreams doesn't care about TriggerData
+                        // there are a bunch of places in the runner that check if trigger data
+                        // empty and skip processing if so. This will prolly breakdown
+                        // close to head so we will need to improve things.
+
+                        // TODO(filipe): Fix once either trigger data can be empty
+                        // or we move the changes into trigger data.
+                        BlockWithTriggers::new(changes, vec![TriggerData {}]),
+                        FirehoseCursor::from(cursor.clone()),
+                    ))),
+                    StepUndo => {
+                        let parent_ptr = BlockPtr {
+                            hash: changes.prev_block_id.clone().into(),
+                            number: changes.prev_block_number as BlockNumber,
+                        };
+
+                        Ok(Some(BlockStreamEvent::Revert(
+                            parent_ptr,
+                            FirehoseCursor::from(cursor.clone()),
+                        )))
+                    }
+                    StepUnknown => {
+                        panic!("unknown step should not happen in the Firehose response")
+                    }
+                }
+            }
+            Data::StoreDeltas(_) => Err(UnexpectedStoreDeltaOutput()),
+        }
+    }
+}
diff --git a/chain/substreams/src/protobuf/substreams.entity.v1.rs b/chain/substreams/src/protobuf/substreams.entity.v1.rs
new file mode 100644
index 0000000..94354c7
--- /dev/null
+++ b/chain/substreams/src/protobuf/substreams.entity.v1.rs
@@ -0,0 +1,68 @@
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct EntitiesChanges {
+    #[prost(bytes="vec", tag="1")]
+    pub block_id: ::prost::alloc::vec::Vec<u8>,
+    #[prost(uint64, tag="2")]
+    pub block_number: u64,
+    #[prost(bytes="vec", tag="3")]
+    pub prev_block_id: ::prost::alloc::vec::Vec<u8>,
+    #[prost(uint64, tag="4")]
+    pub prev_block_number: u64,
+    #[prost(message, repeated, tag="5")]
+    pub entity_changes: ::prost::alloc::vec::Vec<EntityChange>,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct EntityChange {
+    #[prost(string, tag="1")]
+    pub entity: ::prost::alloc::string::String,
+    #[prost(bytes="vec", tag="2")]
+    pub id: ::prost::alloc::vec::Vec<u8>,
+    #[prost(uint64, tag="3")]
+    pub ordinal: u64,
+    #[prost(enumeration="entity_change::Operation", tag="4")]
+    pub operation: i32,
+    #[prost(message, repeated, tag="5")]
+    pub fields: ::prost::alloc::vec::Vec<Field>,
+}
+/// Nested message and enum types in `EntityChange`.
+pub mod entity_change {
+    #[derive(Clone, Copy, Debug, PartialEq, Eq, Hash, PartialOrd, Ord, ::prost::Enumeration)]
+    #[repr(i32)]
+    pub enum Operation {
+        /// Protobuf default should not be used, this is used so that the consume can ensure that the value was actually specified
+        Unset = 0,
+        Create = 1,
+        Update = 2,
+        Delete = 3,
+    }
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct Field {
+    #[prost(string, tag="1")]
+    pub name: ::prost::alloc::string::String,
+    #[prost(enumeration="field::Type", tag="2")]
+    pub value_type: i32,
+    #[prost(bytes="vec", tag="3")]
+    pub new_value: ::prost::alloc::vec::Vec<u8>,
+    #[prost(bool, tag="4")]
+    pub new_value_null: bool,
+    #[prost(bytes="vec", tag="5")]
+    pub old_value: ::prost::alloc::vec::Vec<u8>,
+    #[prost(bool, tag="6")]
+    pub old_value_null: bool,
+}
+/// Nested message and enum types in `Field`.
+pub mod field {
+    #[derive(Clone, Copy, Debug, PartialEq, Eq, Hash, PartialOrd, Ord, ::prost::Enumeration)]
+    #[repr(i32)]
+    pub enum Type {
+        /// Protobuf default should not be used, this is used so that the consume can ensure that the value was actually specified
+        Unset = 0,
+        Bigdecimal = 1,
+        Bigint = 2,
+        /// int32
+        Int = 3,
+        Bytes = 4,
+        String = 5,
+    }
+}
diff --git a/chain/substreams/src/trigger.rs b/chain/substreams/src/trigger.rs
new file mode 100644
index 0000000..22e0ace
--- /dev/null
+++ b/chain/substreams/src/trigger.rs
@@ -0,0 +1,449 @@
+use std::{collections::HashMap, sync::Arc};
+
+use anyhow::Error;
+use graph::{
+    blockchain::{self, block_stream::BlockWithTriggers, BlockPtr},
+    components::{
+        store::{DeploymentLocator, EntityKey, SubgraphFork},
+        subgraph::{MappingError, ProofOfIndexingEvent, SharedProofOfIndexing},
+    },
+    data::store::scalar::Bytes,
+    data_source,
+    prelude::{
+        anyhow, async_trait, BigDecimal, BigInt, BlockHash, BlockNumber, BlockState, Entity,
+        RuntimeHostBuilder, Value,
+    },
+    slog::Logger,
+    substreams::Modules,
+};
+use graph_runtime_wasm::module::ToAscPtr;
+use lazy_static::__Deref;
+
+use crate::codec::Field;
+use crate::{
+    codec::{entity_change::Operation, field::Type},
+    Block, Chain, NodeCapabilities, NoopDataSourceTemplate,
+};
+
+#[derive(Eq, PartialEq, PartialOrd, Ord, Debug)]
+pub struct TriggerData {}
+
+impl blockchain::TriggerData for TriggerData {
+    // TODO(filipe): Can this be improved with some data from the block?
+    fn error_context(&self) -> String {
+        "Failed to process substreams block".to_string()
+    }
+}
+
+impl ToAscPtr for TriggerData {
+    // substreams doesn't rely on wasm on the graph-node so this is not needed.
+    fn to_asc_ptr<H: graph::runtime::AscHeap>(
+        self,
+        _heap: &mut H,
+        _gas: &graph::runtime::gas::GasCounter,
+    ) -> Result<graph::runtime::AscPtr<()>, graph::runtime::DeterministicHostError> {
+        unimplemented!()
+    }
+}
+
+#[derive(Debug, Clone, Default)]
+pub struct TriggerFilter {
+    pub(crate) modules: Option<Modules>,
+    pub(crate) module_name: String,
+    pub(crate) start_block: Option<BlockNumber>,
+    pub(crate) data_sources_len: u8,
+}
+
+// TriggerFilter should bypass all triggers and just rely on block since all the data received
+// should already have been processed.
+impl blockchain::TriggerFilter<Chain> for TriggerFilter {
+    fn extend_with_template(&mut self, _data_source: impl Iterator<Item = NoopDataSourceTemplate>) {
+    }
+
+    /// this function is not safe to call multiple times, only one DataSource is supported for
+    ///
+    fn extend<'a>(
+        &mut self,
+        mut data_sources: impl Iterator<Item = &'a crate::DataSource> + Clone,
+    ) {
+        let Self {
+            modules,
+            module_name,
+            start_block,
+            data_sources_len,
+        } = self;
+
+        if *data_sources_len >= 1 {
+            return;
+        }
+
+        if let Some(ref ds) = data_sources.next() {
+            *data_sources_len = 1;
+            *modules = ds.source.package.modules.clone();
+            *module_name = ds.source.module_name.clone();
+            *start_block = ds.initial_block;
+        }
+    }
+
+    fn node_capabilities(&self) -> NodeCapabilities {
+        NodeCapabilities {}
+    }
+
+    fn to_firehose_filter(self) -> Vec<prost_types::Any> {
+        unimplemented!("this should never be called for this type")
+    }
+}
+
+pub struct TriggersAdapter {}
+
+#[async_trait]
+impl blockchain::TriggersAdapter<Chain> for TriggersAdapter {
+    async fn ancestor_block(
+        &self,
+        _ptr: BlockPtr,
+        _offset: BlockNumber,
+    ) -> Result<Option<Block>, Error> {
+        unimplemented!()
+    }
+
+    async fn scan_triggers(
+        &self,
+        _from: BlockNumber,
+        _to: BlockNumber,
+        _filter: &TriggerFilter,
+    ) -> Result<Vec<BlockWithTriggers<Chain>>, Error> {
+        unimplemented!()
+    }
+
+    async fn triggers_in_block(
+        &self,
+        _logger: &Logger,
+        _block: Block,
+        _filter: &TriggerFilter,
+    ) -> Result<BlockWithTriggers<Chain>, Error> {
+        unimplemented!()
+    }
+
+    async fn is_on_main_chain(&self, _ptr: BlockPtr) -> Result<bool, Error> {
+        unimplemented!()
+    }
+
+    async fn parent_ptr(&self, block: &BlockPtr) -> Result<Option<BlockPtr>, Error> {
+        // This seems to work for a lot of the firehose chains.
+        Ok(Some(BlockPtr {
+            hash: BlockHash::from(vec![0xff; 32]),
+            number: block.number.saturating_sub(1),
+        }))
+    }
+}
+
+fn write_poi_event(
+    proof_of_indexing: &SharedProofOfIndexing,
+    poi_event: &ProofOfIndexingEvent,
+    causality_region: &str,
+    logger: &Logger,
+) {
+    if let Some(proof_of_indexing) = proof_of_indexing {
+        let mut proof_of_indexing = proof_of_indexing.deref().borrow_mut();
+        proof_of_indexing.write(logger, causality_region, poi_event);
+    }
+}
+
+pub struct TriggerProcessor {
+    pub locator: DeploymentLocator,
+}
+
+impl TriggerProcessor {
+    pub fn new(locator: DeploymentLocator) -> Self {
+        Self { locator }
+    }
+}
+
+#[async_trait]
+impl<T> graph::prelude::TriggerProcessor<Chain, T> for TriggerProcessor
+where
+    T: RuntimeHostBuilder<Chain>,
+{
+    async fn process_trigger(
+        &self,
+        logger: &Logger,
+        _hosts: &[Arc<T::Host>],
+        block: &Arc<Block>,
+        _trigger: &data_source::TriggerData<Chain>,
+        mut state: BlockState<Chain>,
+        proof_of_indexing: &SharedProofOfIndexing,
+        causality_region: &str,
+        _debug_fork: &Option<Arc<dyn SubgraphFork>>,
+        _subgraph_metrics: &Arc<graph::prelude::SubgraphInstanceMetrics>,
+    ) -> Result<BlockState<Chain>, MappingError> {
+        for entity_change in block.entity_changes.iter() {
+            match entity_change.operation() {
+                Operation::Unset => {
+                    // Potentially an issue with the server side or
+                    // we are running an outdated version. In either case we should abort.
+                    return Err(MappingError::Unknown(anyhow!("Detected UNSET entity operation, either a server error or there's a new type of operation and we're running an outdated protobuf")));
+                }
+                Operation::Create | Operation::Update => {
+                    // TODO(filipe): Remove this once the substreams GRPC has been fixed.
+                    let entity_type: &str = {
+                        let letter: String = entity_change.entity[0..1].to_uppercase();
+                        &(letter + &entity_change.entity[1..])
+                    };
+                    let entity_id: String = String::from_utf8(entity_change.id.clone())
+                        .map_err(|e| MappingError::Unknown(anyhow::Error::from(e)))?;
+                    let key = EntityKey::data(entity_type.to_string(), entity_id.clone());
+                    let mut data: HashMap<String, Value> = HashMap::from_iter(vec![]);
+                    for field in entity_change.fields.iter() {
+                        let value: Value = decode_entity_change(&field, &entity_change.entity)?;
+                        *data
+                            .entry(field.name.as_str().to_owned())
+                            .or_insert(Value::Null) = value;
+                    }
+
+                    write_poi_event(
+                        proof_of_indexing,
+                        &ProofOfIndexingEvent::SetEntity {
+                            entity_type: &entity_type,
+                            id: &entity_id,
+                            data: &data,
+                        },
+                        causality_region,
+                        logger,
+                    );
+
+                    state.entity_cache.set(key, Entity::from(data))?;
+                }
+                Operation::Delete => {
+                    let entity_type: &str = &entity_change.entity;
+                    let entity_id: String = String::from_utf8(entity_change.id.clone())
+                        .map_err(|e| MappingError::Unknown(anyhow::Error::from(e)))?;
+                    let key = EntityKey::data(entity_type.to_string(), entity_id.clone());
+
+                    state.entity_cache.remove(key);
+
+                    write_poi_event(
+                        proof_of_indexing,
+                        &ProofOfIndexingEvent::RemoveEntity {
+                            entity_type,
+                            id: &entity_id,
+                        },
+                        causality_region,
+                        logger,
+                    )
+                }
+            }
+        }
+
+        Ok(state)
+    }
+}
+
+fn decode_entity_change(field: &Field, entity: &String) -> Result<Value, MappingError> {
+    match field.value_type() {
+        Type::Unset => {
+            return Err(MappingError::Unknown(anyhow!(
+                "Invalid field type, the protobuf probably needs updating"
+            )))
+        }
+        Type::Bigdecimal => match BigDecimal::parse_bytes(field.new_value.as_ref()) {
+            Some(bd) => Ok(Value::BigDecimal(bd)),
+            None => {
+                return Err(MappingError::Unknown(anyhow!(
+                    "Unable to parse BigDecimal for entity {}",
+                    entity
+                )))
+            }
+        },
+        Type::Bigint => Ok(Value::BigInt(BigInt::from_signed_bytes_be(
+            field.new_value.as_ref(),
+        ))),
+        Type::Int => {
+            let mut bytes: [u8; 8] = [0; 8];
+            bytes.copy_from_slice(field.new_value.as_ref());
+            Ok(Value::Int(i64::from_be_bytes(bytes) as i32))
+        }
+        Type::Bytes => Ok(Value::Bytes(Bytes::from(field.new_value.as_ref()))),
+        Type::String => Ok(Value::String(
+            String::from_utf8(field.new_value.clone())
+                .map_err(|e| MappingError::Unknown(anyhow::Error::from(e)))?,
+        )),
+    }
+}
+
+#[cfg(test)]
+mod test {
+    use std::str::FromStr;
+
+    use crate::codec::field::Type as FieldType;
+    use crate::codec::Field;
+    use crate::trigger::decode_entity_change;
+    use graph::{
+        data::store::scalar::Bytes,
+        prelude::{BigDecimal, BigInt, Value},
+    };
+
+    #[test]
+    fn validate_substreams_field_types() {
+        struct Case {
+            field: Field,
+            entity: String,
+            expected_new_value: Value,
+        }
+
+        let cases = vec![
+            Case {
+                field: Field {
+                    name: "setting string value".to_string(),
+                    value_type: FieldType::String as i32,
+                    new_value: Vec::from(
+                        "d4325ee72c39999e778a9908f5fb0803f78e30c441a5f2ce5c65eee0e0eba59d",
+                    ),
+                    new_value_null: false,
+                    old_value: Vec::from("".to_string()),
+                    old_value_null: true,
+                },
+                entity: "Block".to_string(),
+                expected_new_value: Value::String(
+                    "d4325ee72c39999e778a9908f5fb0803f78e30c441a5f2ce5c65eee0e0eba59d".to_string(),
+                ),
+            },
+            Case {
+                field: Field {
+                    name: "settings bytes value".to_string(),
+                    value_type: FieldType::Bytes as i32,
+                    new_value: hex::decode(
+                        "445247fe150195bd866516594e087e1728294aa831613f4d48b8ec618908519f",
+                    )
+                    .unwrap(),
+                    new_value_null: false,
+                    old_value: Vec::from("".to_string()),
+                    old_value_null: true,
+                },
+                entity: "Block".to_string(),
+                expected_new_value: Value::Bytes(
+                    Bytes::from_str(
+                        "0x445247fe150195bd866516594e087e1728294aa831613f4d48b8ec618908519f",
+                    )
+                    .unwrap(),
+                ),
+            },
+            Case {
+                field: Field {
+                    name: "setting int value for block 12369760".to_string(),
+                    value_type: FieldType::Int as i32,
+                    new_value: hex::decode("0000000000bcbf60").unwrap(),
+                    new_value_null: false,
+                    old_value: vec![],
+                    old_value_null: true,
+                },
+                entity: "Block".to_string(),
+                expected_new_value: Value::Int(12369760),
+            },
+            Case {
+                field: Field {
+                    name: "setting int value for block 12369622".to_string(),
+                    value_type: FieldType::Int as i32,
+                    new_value: hex::decode("0000000000bcbed6").unwrap(),
+                    new_value_null: false,
+                    old_value: vec![],
+                    old_value_null: true,
+                },
+                entity: "Block".to_string(),
+                expected_new_value: Value::Int(12369622),
+            },
+            Case {
+                field: Field {
+                    name: "setting int value for block 12369623".to_string(),
+                    value_type: FieldType::Int as i32,
+                    new_value: hex::decode("0000000000bcbed7").unwrap(),
+                    new_value_null: false,
+                    old_value: vec![],
+                    old_value_null: true,
+                },
+                entity: "Block".to_string(),
+                expected_new_value: Value::Int(12369623),
+            },
+            Case {
+                field: Field {
+                    name: "setting big int transactions count of 123".to_string(),
+                    value_type: FieldType::Bigint as i32,
+                    new_value: hex::decode("7b").unwrap(),
+                    new_value_null: false,
+                    old_value: vec![],
+                    old_value_null: true,
+                },
+                entity: "Block".to_string(),
+                expected_new_value: Value::BigInt(BigInt::from(123u64)),
+            },
+            Case {
+                field: Field {
+                    name: "setting big int transactions count of 302".to_string(),
+                    value_type: FieldType::Bigint as i32,
+                    new_value: hex::decode("012e").unwrap(),
+                    new_value_null: false,
+                    old_value: vec![],
+                    old_value_null: true,
+                },
+                entity: "Block".to_string(),
+                expected_new_value: Value::BigInt(BigInt::from(302u64)),
+            },
+            Case {
+                field: Field {
+                    name: "setting big int transactions count of 209".to_string(),
+                    value_type: FieldType::Bigint as i32,
+                    new_value: hex::decode("00d1").unwrap(),
+                    new_value_null: false,
+                    old_value: vec![],
+                    old_value_null: true,
+                },
+                entity: "Block".to_string(),
+                expected_new_value: Value::BigInt(BigInt::from(209u64)),
+            },
+            Case {
+                field: Field {
+                    name: "setting big decimal value".to_string(),
+                    value_type: FieldType::Bigdecimal as i32,
+                    new_value: hex::decode("3133363633312e35").unwrap(),
+                    new_value_null: false,
+                    old_value: vec![],
+                    old_value_null: true,
+                },
+                entity: "Block".to_string(),
+                expected_new_value: Value::BigDecimal(BigDecimal::from(136631.5)),
+            },
+            Case {
+                field: Field {
+                    name: "setting big decimal value 2".to_string(),
+                    value_type: FieldType::Bigdecimal as i32,
+                    new_value: hex::decode("3133303730392e30").unwrap(),
+                    new_value_null: false,
+                    old_value: vec![],
+                    old_value_null: true,
+                },
+                entity: "Block".to_string(),
+                expected_new_value: Value::BigDecimal(BigDecimal::from(130709.0)),
+            },
+            Case {
+                field: Field {
+                    name: "setting big decimal value 3".to_string(),
+                    value_type: FieldType::Bigdecimal as i32,
+                    new_value: hex::decode("39373839322e36").unwrap(),
+                    new_value_null: false,
+                    old_value: vec![],
+                    old_value_null: true,
+                },
+                entity: "Block".to_string(),
+                expected_new_value: Value::BigDecimal(BigDecimal::new(BigInt::from(978926u64), -1)),
+            },
+        ];
+
+        for case in cases.into_iter() {
+            let value: Value = decode_entity_change(&case.field, &case.entity).unwrap();
+            assert_eq!(
+                case.expected_new_value, value,
+                "failed case: {}",
+                case.field.name
+            )
+        }
+    }
+}
diff --git a/core/Cargo.toml b/core/Cargo.toml
new file mode 100644
index 0000000..94f1681
--- /dev/null
+++ b/core/Cargo.toml
@@ -0,0 +1,40 @@
+[package]
+name = "graph-core"
+version = "0.27.0"
+edition = "2021"
+
+[dependencies]
+async-trait = "0.1.50"
+atomic_refcell = "0.1.8"
+async-stream = "0.3"
+bytes = "1.0"
+futures01 = { package="futures", version="0.1.31" }
+futures = { version="0.3.4", features=["compat"] }
+graph = { path = "../graph" }
+# This dependency is temporary. The multiblockchain refactoring is not
+# finished as long as this dependency exists
+graph-chain-arweave = { path = "../chain/arweave" }
+graph-chain-ethereum = { path = "../chain/ethereum" }
+graph-chain-near = { path = "../chain/near" }
+graph-chain-cosmos = { path = "../chain/cosmos" }
+graph-chain-substreams = { path = "../chain/substreams" }
+lazy_static = "1.2.0"
+lru_time_cache = "0.11"
+semver = "1.0.12"
+serde = "1.0"
+serde_json = "1.0"
+serde_yaml = "0.8"
+# Switch to crates.io once tower 0.5 is released
+tower = { git = "https://github.com/tower-rs/tower.git", features = ["util", "limit"] }
+graph-runtime-wasm = { path = "../runtime/wasm" }
+cid = "0.8.6"
+anyhow = "1.0"
+
+[dev-dependencies]
+tower-test = { git = "https://github.com/tower-rs/tower.git" }
+graph-mock = { path = "../mock" }
+test-store = { path = "../store/test-store" }
+hex = "0.4.3"
+graphql-parser = "0.4.0"
+pretty_assertions = "1.3.0"
+anyhow = "1.0"
diff --git a/core/src/lib.rs b/core/src/lib.rs
new file mode 100644
index 0000000..08ac3fc
--- /dev/null
+++ b/core/src/lib.rs
@@ -0,0 +1,9 @@
+pub mod polling_monitor;
+
+mod link_resolver;
+mod metrics;
+mod subgraph;
+
+pub use crate::link_resolver::LinkResolver;
+pub use crate::metrics::MetricsRegistry;
+pub use crate::subgraph::{SubgraphAssignmentProvider, SubgraphInstanceManager, SubgraphRegistrar};
diff --git a/core/src/link_resolver.rs b/core/src/link_resolver.rs
new file mode 100644
index 0000000..9b2be6f
--- /dev/null
+++ b/core/src/link_resolver.rs
@@ -0,0 +1,406 @@
+use std::sync::{Arc, Mutex};
+use std::time::Duration;
+
+use anyhow::anyhow;
+use async_trait::async_trait;
+use bytes::BytesMut;
+use futures01::{stream::poll_fn, try_ready};
+use futures03::stream::FuturesUnordered;
+use graph::env::EnvVars;
+use graph::util::futures::RetryConfigNoTimeout;
+use lru_time_cache::LruCache;
+use serde_json::Value;
+
+use graph::{
+    ipfs_client::{IpfsClient, StatApi},
+    prelude::{LinkResolver as LinkResolverTrait, *},
+};
+
+fn retry_policy<I: Send + Sync>(
+    always_retry: bool,
+    op: &'static str,
+    logger: &Logger,
+) -> RetryConfigNoTimeout<I, graph::prelude::reqwest::Error> {
+    // Even if retries were not requested, networking errors are still retried until we either get
+    // a valid HTTP response or a timeout.
+    if always_retry {
+        retry(op, logger).no_limit()
+    } else {
+        retry(op, logger)
+            .no_limit()
+            .when(|res: &Result<_, reqwest::Error>| match res {
+                Ok(_) => false,
+                Err(e) => !(e.is_status() || e.is_timeout()),
+            })
+    }
+    .no_timeout() // The timeout should be set in the internal future.
+}
+
+/// The IPFS APIs don't have a quick "do you have the file" function. Instead, we
+/// just rely on whether an API times out. That makes sense for IPFS, but not for
+/// our application. We want to be able to quickly select from a potential list
+/// of clients where hopefully one already has the file, and just get the file
+/// from that.
+///
+/// The strategy here then is to use a stat API as a proxy for "do you have the
+/// file". Whichever client has or gets the file first wins. This API is a good
+/// choice, because it doesn't involve us actually starting to download the file
+/// from each client, which would be wasteful of bandwidth and memory in the
+/// case multiple clients respond in a timely manner. In addition, we may make
+/// good use of the stat returned.
+async fn select_fastest_client_with_stat(
+    clients: Arc<Vec<Arc<IpfsClient>>>,
+    logger: Logger,
+    api: StatApi,
+    path: String,
+    timeout: Duration,
+    do_retry: bool,
+) -> Result<(u64, Arc<IpfsClient>), Error> {
+    let mut err: Option<Error> = None;
+
+    let mut stats: FuturesUnordered<_> = clients
+        .iter()
+        .enumerate()
+        .map(|(i, c)| {
+            let c = c.cheap_clone();
+            let path = path.clone();
+            retry_policy(do_retry, "IPFS stat", &logger).run(move || {
+                let path = path.clone();
+                let c = c.cheap_clone();
+                async move {
+                    c.stat_size(api, path, timeout)
+                        .map_ok(move |s| (s, i))
+                        .await
+                }
+            })
+        })
+        .collect();
+
+    while let Some(result) = stats.next().await {
+        match result {
+            Ok((stat, index)) => {
+                return Ok((stat, clients[index].cheap_clone()));
+            }
+            Err(e) => err = Some(e.into()),
+        }
+    }
+
+    Err(err.unwrap_or_else(|| {
+        anyhow!(
+            "No IPFS clients were supplied to handle the call to object.stat. File: {}",
+            path
+        )
+    }))
+}
+
+// Returns an error if the stat is bigger than `max_file_bytes`
+fn restrict_file_size(path: &str, size: u64, max_file_bytes: usize) -> Result<(), Error> {
+    if size > max_file_bytes as u64 {
+        return Err(anyhow!(
+            "IPFS file {} is too large. It can be at most {} bytes but is {} bytes",
+            path,
+            max_file_bytes,
+            size
+        ));
+    }
+    Ok(())
+}
+
+#[derive(Clone)]
+pub struct LinkResolver {
+    clients: Arc<Vec<Arc<IpfsClient>>>,
+    cache: Arc<Mutex<LruCache<String, Vec<u8>>>>,
+    timeout: Duration,
+    retry: bool,
+    env_vars: Arc<EnvVars>,
+}
+
+impl LinkResolver {
+    pub fn new(clients: Vec<IpfsClient>, env_vars: Arc<EnvVars>) -> Self {
+        Self {
+            clients: Arc::new(clients.into_iter().map(Arc::new).collect()),
+            cache: Arc::new(Mutex::new(LruCache::with_capacity(
+                env_vars.mappings.max_ipfs_cache_size as usize,
+            ))),
+            timeout: env_vars.mappings.ipfs_timeout,
+            retry: false,
+            env_vars,
+        }
+    }
+}
+
+impl Debug for LinkResolver {
+    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
+        f.debug_struct("LinkResolver")
+            .field("timeout", &self.timeout)
+            .field("retry", &self.retry)
+            .field("env_vars", &self.env_vars)
+            .finish()
+    }
+}
+
+impl CheapClone for LinkResolver {
+    fn cheap_clone(&self) -> Self {
+        self.clone()
+    }
+}
+
+#[async_trait]
+impl LinkResolverTrait for LinkResolver {
+    fn with_timeout(&self, timeout: Duration) -> Box<dyn LinkResolverTrait> {
+        let mut s = self.cheap_clone();
+        s.timeout = timeout;
+        Box::new(s)
+    }
+
+    fn with_retries(&self) -> Box<dyn LinkResolverTrait> {
+        let mut s = self.cheap_clone();
+        s.retry = true;
+        Box::new(s)
+    }
+
+    /// Supports links of the form `/ipfs/ipfs_hash` or just `ipfs_hash`.
+    async fn cat(&self, logger: &Logger, link: &Link) -> Result<Vec<u8>, Error> {
+        // Discard the `/ipfs/` prefix (if present) to get the hash.
+        let path = link.link.trim_start_matches("/ipfs/").to_owned();
+
+        if let Some(data) = self.cache.lock().unwrap().get(&path) {
+            trace!(logger, "IPFS cache hit"; "hash" => &path);
+            return Ok(data.clone());
+        }
+        trace!(logger, "IPFS cache miss"; "hash" => &path);
+
+        let (size, client) = select_fastest_client_with_stat(
+            self.clients.cheap_clone(),
+            logger.cheap_clone(),
+            StatApi::Files,
+            path.clone(),
+            self.timeout,
+            self.retry,
+        )
+        .await?;
+
+        let max_cache_file_size = self.env_vars.mappings.max_ipfs_cache_file_size;
+        let max_file_size = self.env_vars.mappings.max_ipfs_file_bytes;
+        restrict_file_size(&path, size, max_file_size)?;
+
+        let req_path = path.clone();
+        let timeout = self.timeout;
+        let data = retry_policy(self.retry, "ipfs.cat", &logger)
+            .run(move || {
+                let path = req_path.clone();
+                let client = client.clone();
+                async move { Ok(client.cat_all(&path, timeout).await?.to_vec()) }
+            })
+            .await?;
+
+        // The size reported by `files/stat` is not guaranteed to be exact, so check the limit again.
+        restrict_file_size(&path, data.len() as u64, max_file_size)?;
+
+        // Only cache files if they are not too large
+        if data.len() <= max_cache_file_size {
+            let mut cache = self.cache.lock().unwrap();
+            if !cache.contains_key(&path) {
+                cache.insert(path.to_owned(), data.clone());
+            }
+        } else {
+            debug!(logger, "File too large for cache";
+                        "path" => path,
+                        "size" => data.len()
+            );
+        }
+
+        Ok(data)
+    }
+
+    async fn get_block(&self, logger: &Logger, link: &Link) -> Result<Vec<u8>, Error> {
+        trace!(logger, "IPFS block get"; "hash" => &link.link);
+        let (size, client) = select_fastest_client_with_stat(
+            self.clients.cheap_clone(),
+            logger.cheap_clone(),
+            StatApi::Block,
+            link.link.clone(),
+            self.timeout,
+            self.retry,
+        )
+        .await?;
+
+        let max_file_size = self.env_vars.mappings.max_ipfs_file_bytes;
+        restrict_file_size(&link.link, size, max_file_size)?;
+
+        let link = link.link.clone();
+        let data = retry_policy(self.retry, "ipfs.getBlock", &logger)
+            .run(move || {
+                let link = link.clone();
+                let client = client.clone();
+                async move {
+                    let data = client.get_block(link.clone()).await?.to_vec();
+                    Result::<Vec<u8>, reqwest::Error>::Ok(data)
+                }
+            })
+            .await?;
+
+        Ok(data)
+    }
+
+    async fn json_stream(&self, logger: &Logger, link: &Link) -> Result<JsonValueStream, Error> {
+        // Discard the `/ipfs/` prefix (if present) to get the hash.
+        let path = link.link.trim_start_matches("/ipfs/");
+
+        let (size, client) = select_fastest_client_with_stat(
+            self.clients.cheap_clone(),
+            logger.cheap_clone(),
+            StatApi::Files,
+            path.to_string(),
+            self.timeout,
+            self.retry,
+        )
+        .await?;
+
+        let max_file_size = self.env_vars.mappings.max_ipfs_map_file_size;
+        restrict_file_size(path, size, max_file_size)?;
+
+        let mut stream = client.cat(path, None).await?.fuse().boxed().compat();
+
+        let mut buf = BytesMut::with_capacity(1024);
+
+        // Count the number of lines we've already successfully deserialized.
+        // We need that to adjust the line number in error messages from serde_json
+        // to translate from line numbers in the snippet we are deserializing
+        // to the line number in the overall file
+        let mut count = 0;
+
+        let stream: JsonValueStream = Box::pin(
+            poll_fn(move || -> Poll<Option<JsonStreamValue>, Error> {
+                loop {
+                    if let Some(offset) = buf.iter().position(|b| *b == b'\n') {
+                        let line_bytes = buf.split_to(offset + 1);
+                        count += 1;
+                        if line_bytes.len() > 1 {
+                            let line = std::str::from_utf8(&line_bytes)?;
+                            let res = match serde_json::from_str::<Value>(line) {
+                                Ok(v) => Ok(Async::Ready(Some(JsonStreamValue {
+                                    value: v,
+                                    line: count,
+                                }))),
+                                Err(e) => {
+                                    // Adjust the line number in the serde error. This
+                                    // is fun because we can only get at the full error
+                                    // message, and not the error message without line number
+                                    let msg = e.to_string();
+                                    let msg = msg.split(" at line ").next().unwrap();
+                                    Err(anyhow!(
+                                        "{} at line {} column {}: '{}'",
+                                        msg,
+                                        e.line() + count - 1,
+                                        e.column(),
+                                        line
+                                    ))
+                                }
+                            };
+                            return res;
+                        }
+                    } else {
+                        // We only get here if there is no complete line in buf, and
+                        // it is therefore ok to immediately pass an Async::NotReady
+                        // from stream through.
+                        // If we get a None from poll, but still have something in buf,
+                        // that means the input was not terminated with a newline. We
+                        // add that so that the last line gets picked up in the next
+                        // run through the loop.
+                        match try_ready!(stream.poll().map_err(|e| anyhow::anyhow!("{}", e))) {
+                            Some(b) => buf.extend_from_slice(&b),
+                            None if buf.len() > 0 => buf.extend_from_slice(&[b'\n']),
+                            None => return Ok(Async::Ready(None)),
+                        }
+                    }
+                }
+            })
+            .compat(),
+        );
+
+        Ok(stream)
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+    use graph::env::EnvVars;
+    use serde_json::json;
+
+    #[tokio::test]
+    async fn max_file_size() {
+        let mut env_vars = EnvVars::default();
+        env_vars.mappings.max_ipfs_file_bytes = 200;
+
+        let file: &[u8] = &[0u8; 201];
+        let client = IpfsClient::localhost();
+        let resolver = super::LinkResolver::new(vec![client.clone()], Arc::new(env_vars));
+
+        let logger = Logger::root(slog::Discard, o!());
+
+        let link = client.add(file.into()).await.unwrap().hash;
+        let err = LinkResolver::cat(&resolver, &logger, &Link { link: link.clone() })
+            .await
+            .unwrap_err();
+        assert_eq!(
+            err.to_string(),
+            format!(
+                "IPFS file {} is too large. It can be at most 200 bytes but is 212 bytes",
+                link
+            )
+        );
+    }
+
+    async fn json_round_trip(text: &'static str, env_vars: EnvVars) -> Result<Vec<Value>, Error> {
+        let client = IpfsClient::localhost();
+        let resolver = super::LinkResolver::new(vec![client.clone()], Arc::new(env_vars));
+
+        let logger = Logger::root(slog::Discard, o!());
+        let link = client.add(text.as_bytes().into()).await.unwrap().hash;
+
+        let stream = LinkResolver::json_stream(&resolver, &logger, &Link { link }).await?;
+        stream.map_ok(|sv| sv.value).try_collect().await
+    }
+
+    #[tokio::test]
+    async fn read_json_stream() {
+        let values = json_round_trip("\"with newline\"\n", EnvVars::default()).await;
+        assert_eq!(vec![json!("with newline")], values.unwrap());
+
+        let values = json_round_trip("\"without newline\"", EnvVars::default()).await;
+        assert_eq!(vec![json!("without newline")], values.unwrap());
+
+        let values = json_round_trip("\"two\" \n \"things\"", EnvVars::default()).await;
+        assert_eq!(vec![json!("two"), json!("things")], values.unwrap());
+
+        let values = json_round_trip(
+            "\"one\"\n  \"two\" \n [\"bad\" \n \"split\"]",
+            EnvVars::default(),
+        )
+        .await;
+        assert_eq!(
+            "EOF while parsing a list at line 4 column 0: ' [\"bad\" \n'",
+            values.unwrap_err().to_string()
+        );
+    }
+
+    #[tokio::test]
+    async fn ipfs_map_file_size() {
+        let file = "\"small test string that trips the size restriction\"";
+        let mut env_vars = EnvVars::default();
+        env_vars.mappings.max_ipfs_map_file_size = file.len() - 1;
+
+        let err = json_round_trip(file, env_vars).await.unwrap_err();
+
+        assert!(err.to_string().contains(" is too large"));
+
+        env_vars = EnvVars::default();
+        let values = json_round_trip(file, env_vars).await;
+        assert_eq!(
+            vec!["small test string that trips the size restriction"],
+            values.unwrap()
+        );
+    }
+}
diff --git a/core/src/metrics/mod.rs b/core/src/metrics/mod.rs
new file mode 100644
index 0000000..047d6b2
--- /dev/null
+++ b/core/src/metrics/mod.rs
@@ -0,0 +1,3 @@
+mod registry;
+
+pub use registry::MetricsRegistry;
diff --git a/core/src/metrics/registry.rs b/core/src/metrics/registry.rs
new file mode 100644
index 0000000..12f77ce
--- /dev/null
+++ b/core/src/metrics/registry.rs
@@ -0,0 +1,331 @@
+use std::collections::HashMap;
+use std::sync::{Arc, RwLock};
+
+use graph::components::metrics::{counter_with_labels, gauge_with_labels};
+use graph::prelude::{MetricsRegistry as MetricsRegistryTrait, *};
+
+#[derive(Clone)]
+pub struct MetricsRegistry {
+    logger: Logger,
+    registry: Arc<Registry>,
+    register_errors: Box<Counter>,
+    unregister_errors: Box<Counter>,
+    registered_metrics: Box<Gauge>,
+
+    /// Global metrics are lazily initialized and identified by
+    /// the `Desc.id` that hashes the name and const label values
+    global_counters: Arc<RwLock<HashMap<u64, Counter>>>,
+    global_counter_vecs: Arc<RwLock<HashMap<u64, CounterVec>>>,
+    global_gauges: Arc<RwLock<HashMap<u64, Gauge>>>,
+    global_gauge_vecs: Arc<RwLock<HashMap<u64, GaugeVec>>>,
+    global_histogram_vecs: Arc<RwLock<HashMap<u64, HistogramVec>>>,
+}
+
+impl MetricsRegistry {
+    pub fn new(logger: Logger, registry: Arc<Registry>) -> Self {
+        // Generate internal metrics
+        let register_errors = Self::gen_register_errors_counter(registry.clone());
+        let unregister_errors = Self::gen_unregister_errors_counter(registry.clone());
+        let registered_metrics = Self::gen_registered_metrics_gauge(registry.clone());
+
+        MetricsRegistry {
+            logger: logger.new(o!("component" => String::from("MetricsRegistry"))),
+            registry,
+            register_errors,
+            unregister_errors,
+            registered_metrics,
+            global_counters: Arc::new(RwLock::new(HashMap::new())),
+            global_counter_vecs: Arc::new(RwLock::new(HashMap::new())),
+            global_gauges: Arc::new(RwLock::new(HashMap::new())),
+            global_gauge_vecs: Arc::new(RwLock::new(HashMap::new())),
+            global_histogram_vecs: Arc::new(RwLock::new(HashMap::new())),
+        }
+    }
+
+    fn gen_register_errors_counter(registry: Arc<Registry>) -> Box<Counter> {
+        let opts = Opts::new(
+            String::from("metrics_register_errors"),
+            String::from("Counts Prometheus metrics register errors"),
+        );
+        let counter = Box::new(
+            Counter::with_opts(opts).expect("failed to create `metrics_register_errors` counter"),
+        );
+        registry
+            .register(counter.clone())
+            .expect("failed to register `metrics_register_errors` counter");
+        counter
+    }
+
+    fn gen_unregister_errors_counter(registry: Arc<Registry>) -> Box<Counter> {
+        let opts = Opts::new(
+            String::from("metrics_unregister_errors"),
+            String::from("Counts Prometheus metrics unregister errors"),
+        );
+        let counter = Box::new(
+            Counter::with_opts(opts).expect("failed to create `metrics_unregister_errors` counter"),
+        );
+        registry
+            .register(counter.clone())
+            .expect("failed to register `metrics_unregister_errors` counter");
+        counter
+    }
+
+    fn gen_registered_metrics_gauge(registry: Arc<Registry>) -> Box<Gauge> {
+        let opts = Opts::new(
+            String::from("registered_metrics"),
+            String::from("Tracks the number of registered metrics on the node"),
+        );
+        let gauge =
+            Box::new(Gauge::with_opts(opts).expect("failed to create `registered_metrics` gauge"));
+        registry
+            .register(gauge.clone())
+            .expect("failed to register `registered_metrics` gauge");
+        gauge
+    }
+
+    fn global_counter_vec_internal(
+        &self,
+        name: &str,
+        help: &str,
+        deployment: Option<&str>,
+        variable_labels: &[&str],
+    ) -> Result<CounterVec, PrometheusError> {
+        let opts = Opts::new(name, help);
+        let opts = match deployment {
+            None => opts,
+            Some(deployment) => opts.const_label("deployment", deployment),
+        };
+        let counters = CounterVec::new(opts, variable_labels)?;
+        let id = counters.desc().first().unwrap().id;
+        let maybe_counter = self.global_counter_vecs.read().unwrap().get(&id).cloned();
+        if let Some(counters) = maybe_counter {
+            Ok(counters)
+        } else {
+            self.register(name, Box::new(counters.clone()));
+            self.global_counter_vecs
+                .write()
+                .unwrap()
+                .insert(id, counters.clone());
+            Ok(counters)
+        }
+    }
+}
+
+impl MetricsRegistryTrait for MetricsRegistry {
+    fn register(&self, name: &str, c: Box<dyn Collector>) {
+        let err = match self.registry.register(c).err() {
+            None => {
+                self.registered_metrics.inc();
+                return;
+            }
+            Some(err) => {
+                self.register_errors.inc();
+                err
+            }
+        };
+        match err {
+            PrometheusError::AlreadyReg => {
+                error!(
+                    self.logger,
+                    "registering metric [{}] failed because it was already registered", name,
+                );
+            }
+            PrometheusError::InconsistentCardinality { expect, got } => {
+                error!(
+                    self.logger,
+                    "registering metric [{}] failed due to inconsistent caridinality, expected = {} got = {}",
+                    name,
+                    expect,
+                    got,
+                );
+            }
+            PrometheusError::Msg(msg) => {
+                error!(
+                    self.logger,
+                    "registering metric [{}] failed because: {}", name, msg,
+                );
+            }
+            PrometheusError::Io(err) => {
+                error!(
+                    self.logger,
+                    "registering metric [{}] failed due to io error: {}", name, err,
+                );
+            }
+            PrometheusError::Protobuf(err) => {
+                error!(
+                    self.logger,
+                    "registering metric [{}] failed due to protobuf error: {}", name, err
+                );
+            }
+        };
+    }
+
+    fn global_counter(
+        &self,
+        name: &str,
+        help: &str,
+        const_labels: HashMap<String, String>,
+    ) -> Result<Counter, PrometheusError> {
+        let counter = counter_with_labels(name, help, const_labels)?;
+        let id = counter.desc().first().unwrap().id;
+        let maybe_counter = self.global_counters.read().unwrap().get(&id).cloned();
+        if let Some(counter) = maybe_counter {
+            Ok(counter)
+        } else {
+            self.register(name, Box::new(counter.clone()));
+            self.global_counters
+                .write()
+                .unwrap()
+                .insert(id, counter.clone());
+            Ok(counter)
+        }
+    }
+
+    fn global_counter_vec(
+        &self,
+        name: &str,
+        help: &str,
+        variable_labels: &[&str],
+    ) -> Result<CounterVec, PrometheusError> {
+        self.global_counter_vec_internal(name, help, None, variable_labels)
+    }
+
+    fn global_deployment_counter_vec(
+        &self,
+        name: &str,
+        help: &str,
+        subgraph: &str,
+        variable_labels: &[&str],
+    ) -> Result<CounterVec, PrometheusError> {
+        self.global_counter_vec_internal(name, help, Some(subgraph), variable_labels)
+    }
+
+    fn global_gauge(
+        &self,
+        name: &str,
+        help: &str,
+        const_labels: HashMap<String, String>,
+    ) -> Result<Gauge, PrometheusError> {
+        let gauge = gauge_with_labels(name, help, const_labels)?;
+        let id = gauge.desc().first().unwrap().id;
+        let maybe_gauge = self.global_gauges.read().unwrap().get(&id).cloned();
+        if let Some(gauge) = maybe_gauge {
+            Ok(gauge.clone())
+        } else {
+            self.register(name, Box::new(gauge.clone()));
+            self.global_gauges
+                .write()
+                .unwrap()
+                .insert(id, gauge.clone());
+            Ok(gauge)
+        }
+    }
+
+    fn global_gauge_vec(
+        &self,
+        name: &str,
+        help: &str,
+        variable_labels: &[&str],
+    ) -> Result<GaugeVec, PrometheusError> {
+        let opts = Opts::new(name, help);
+        let gauges = GaugeVec::new(opts, variable_labels)?;
+        let id = gauges.desc().first().unwrap().id;
+        let maybe_gauge = self.global_gauge_vecs.read().unwrap().get(&id).cloned();
+        if let Some(gauges) = maybe_gauge {
+            Ok(gauges)
+        } else {
+            self.register(name, Box::new(gauges.clone()));
+            self.global_gauge_vecs
+                .write()
+                .unwrap()
+                .insert(id, gauges.clone());
+            Ok(gauges)
+        }
+    }
+
+    fn global_histogram_vec(
+        &self,
+        name: &str,
+        help: &str,
+        variable_labels: &[&str],
+    ) -> Result<HistogramVec, PrometheusError> {
+        let opts = HistogramOpts::new(name, help);
+        let histograms = HistogramVec::new(opts, variable_labels)?;
+        let id = histograms.desc().first().unwrap().id;
+        let maybe_histogram = self.global_histogram_vecs.read().unwrap().get(&id).cloned();
+        if let Some(histograms) = maybe_histogram {
+            Ok(histograms)
+        } else {
+            self.register(name, Box::new(histograms.clone()));
+            self.global_histogram_vecs
+                .write()
+                .unwrap()
+                .insert(id, histograms.clone());
+            Ok(histograms)
+        }
+    }
+
+    fn unregister(&self, metric: Box<dyn Collector>) {
+        match self.registry.unregister(metric) {
+            Ok(_) => {
+                self.registered_metrics.dec();
+            }
+            Err(e) => {
+                self.unregister_errors.inc();
+                error!(self.logger, "Unregistering metric failed = {:?}", e,);
+            }
+        };
+    }
+}
+
+#[test]
+fn global_counters_are_shared() {
+    use graph::log;
+
+    let logger = log::logger(false);
+    let prom_reg = Arc::new(Registry::new());
+    let registry = MetricsRegistry::new(logger, prom_reg.clone());
+
+    fn check_counters(
+        registry: &MetricsRegistry,
+        name: &str,
+        const_labels: HashMap<String, String>,
+    ) {
+        let c1 = registry
+            .global_counter(name, "help me", const_labels.clone())
+            .expect("first test counter");
+        let c2 = registry
+            .global_counter(name, "help me", const_labels)
+            .expect("second test counter");
+        let desc1 = c1.desc();
+        let desc2 = c2.desc();
+        let d1 = desc1.first().unwrap();
+        let d2 = desc2.first().unwrap();
+
+        // Registering the same metric with the same name and
+        // const labels twice works and returns the same metric (logically)
+        assert_eq!(d1.id, d2.id, "counters: {}", name);
+
+        // They share the reported values
+        c1.inc_by(7.0);
+        c2.inc_by(2.0);
+        assert_eq!(9.0, c1.get(), "counters: {}", name);
+        assert_eq!(9.0, c2.get(), "counters: {}", name);
+    }
+
+    check_counters(&registry, "nolabels", HashMap::new());
+
+    let const_labels = {
+        let mut map = HashMap::new();
+        map.insert("pool".to_owned(), "main".to_owned());
+        map
+    };
+    check_counters(&registry, "pool", const_labels);
+
+    let const_labels = {
+        let mut map = HashMap::new();
+        map.insert("pool".to_owned(), "replica0".to_owned());
+        map
+    };
+    check_counters(&registry, "pool", const_labels);
+}
diff --git a/core/src/polling_monitor/ipfs_service.rs b/core/src/polling_monitor/ipfs_service.rs
new file mode 100644
index 0000000..05d904f
--- /dev/null
+++ b/core/src/polling_monitor/ipfs_service.rs
@@ -0,0 +1,131 @@
+use anyhow::{anyhow, Error};
+use bytes::Bytes;
+use cid::Cid;
+use futures::{Future, FutureExt};
+use graph::{
+    cheap_clone::CheapClone,
+    ipfs_client::{IpfsClient, StatApi},
+    tokio::sync::Semaphore,
+};
+use std::{pin::Pin, sync::Arc, task::Poll, time::Duration};
+use tower::Service;
+
+const CLOUDFLARE_TIMEOUT: u16 = 524;
+const GATEWAY_TIMEOUT: u16 = 504;
+
+/// Reference type, clones will refer to the same service.
+#[derive(Clone)]
+pub struct IpfsService {
+    client: IpfsClient,
+    max_file_size: u64,
+    timeout: Duration,
+    concurrency_limiter: Arc<Semaphore>,
+}
+
+impl CheapClone for IpfsService {
+    fn cheap_clone(&self) -> Self {
+        Self {
+            client: self.client.cheap_clone(),
+            max_file_size: self.max_file_size,
+            timeout: self.timeout,
+            concurrency_limiter: self.concurrency_limiter.cheap_clone(),
+        }
+    }
+}
+
+impl IpfsService {
+    pub fn new(
+        client: IpfsClient,
+        max_file_size: u64,
+        timeout: Duration,
+        concurrency_limit: u16,
+    ) -> Self {
+        Self {
+            client,
+            max_file_size,
+            timeout,
+            concurrency_limiter: Arc::new(Semaphore::new(concurrency_limit as usize)),
+        }
+    }
+
+    async fn call(&self, cid: Cid) -> Result<Option<Bytes>, Error> {
+        let multihash = cid.hash().code();
+        if !SAFE_MULTIHASHES.contains(&multihash) {
+            return Err(anyhow!("CID multihash {} is not allowed", multihash));
+        }
+
+        let cid_str = cid.to_string();
+        let size = match self
+            .client
+            .stat_size(StatApi::Files, cid_str, self.timeout)
+            .await
+        {
+            Ok(size) => size,
+            Err(e) => match e.status().map(|e| e.as_u16()) {
+                Some(GATEWAY_TIMEOUT) | Some(CLOUDFLARE_TIMEOUT) => return Ok(None),
+                _ if e.is_timeout() => return Ok(None),
+                _ => return Err(e.into()),
+            },
+        };
+
+        if size > self.max_file_size {
+            return Err(anyhow!(
+                "IPFS file {} is too large. It can be at most {} bytes but is {} bytes",
+                cid.to_string(),
+                self.max_file_size,
+                size
+            ));
+        }
+
+        Ok(self
+            .client
+            .cat_all(&cid.to_string(), self.timeout)
+            .await
+            .map(Some)?)
+    }
+}
+
+impl Service<Cid> for IpfsService {
+    type Response = (Cid, Option<Bytes>);
+    type Error = (Cid, Error);
+    type Future = Pin<Box<dyn Future<Output = Result<Self::Response, Self::Error>> + Send>>;
+
+    fn poll_ready(&mut self, cx: &mut std::task::Context<'_>) -> Poll<Result<(), Self::Error>> {
+        // The permit is acquired and immediately dropped, as tower does not yet allow returning it.
+        // So this is only indicative of capacity being available.
+        Pin::new(&mut self.concurrency_limiter.acquire().boxed())
+            .poll(cx)
+            .map_ok(|_| ())
+            .map_err(|_| unreachable!("semaphore is never closed"))
+    }
+
+    fn call(&mut self, cid: Cid) -> Self::Future {
+        let this = self.cheap_clone();
+        async move {
+            let _permit = this.concurrency_limiter.acquire().await;
+            this.call(cid).await.map(|x| (cid, x)).map_err(|e| (cid, e))
+        }
+        .boxed()
+    }
+}
+
+// Multihashes that are collision resistant. This is not complete but covers the commonly used ones.
+// Code table: https://github.com/multiformats/multicodec/blob/master/table.csv
+// rust-multihash code enum: https://github.com/multiformats/rust-multihash/blob/master/src/multihash_impl.rs
+const SAFE_MULTIHASHES: [u64; 15] = [
+    0x0,    // Identity
+    0x12,   // SHA2-256 (32-byte hash size)
+    0x13,   // SHA2-512 (64-byte hash size)
+    0x17,   // SHA3-224 (28-byte hash size)
+    0x16,   // SHA3-256 (32-byte hash size)
+    0x15,   // SHA3-384 (48-byte hash size)
+    0x14,   // SHA3-512 (64-byte hash size)
+    0x1a,   // Keccak-224 (28-byte hash size)
+    0x1b,   // Keccak-256 (32-byte hash size)
+    0x1c,   // Keccak-384 (48-byte hash size)
+    0x1d,   // Keccak-512 (64-byte hash size)
+    0xb220, // BLAKE2b-256 (32-byte hash size)
+    0xb240, // BLAKE2b-512 (64-byte hash size)
+    0xb260, // BLAKE2s-256 (32-byte hash size)
+    0x1e,   // BLAKE3-256 (32-byte hash size)
+];
diff --git a/core/src/polling_monitor/metrics.rs b/core/src/polling_monitor/metrics.rs
new file mode 100644
index 0000000..c7cfa89
--- /dev/null
+++ b/core/src/polling_monitor/metrics.rs
@@ -0,0 +1,62 @@
+use std::sync::Arc;
+
+use graph::{
+    prelude::{DeploymentHash, MetricsRegistry},
+    prometheus::{Counter, Gauge},
+};
+
+pub struct PollingMonitorMetrics {
+    pub requests: Counter,
+    pub errors: Counter,
+    pub not_found: Counter,
+    pub queue_depth: Gauge,
+}
+
+impl PollingMonitorMetrics {
+    pub fn new(registry: Arc<dyn MetricsRegistry>, subgraph_hash: &DeploymentHash) -> Self {
+        let requests = registry
+            .new_deployment_counter(
+                "polling_monitor_requests",
+                "counts the total requests made to the service being polled",
+                subgraph_hash.as_str(),
+            )
+            .unwrap();
+        let not_found = registry
+            .new_deployment_counter(
+                "polling_monitor_not_found",
+                "counts 'not found' responses returned from the service being polled",
+                subgraph_hash.as_str(),
+            )
+            .unwrap();
+        let errors = registry
+            .new_deployment_counter(
+                "polling_monitor_errors",
+                "counts errors returned from the service being polled",
+                subgraph_hash.as_str(),
+            )
+            .unwrap();
+        let queue_depth = registry
+            .new_deployment_gauge(
+                "polling_monitor_queue_depth",
+                "size of the queue of polling requests",
+                subgraph_hash.as_str(),
+            )
+            .unwrap();
+        Self {
+            requests,
+            errors,
+            not_found,
+            queue_depth: queue_depth.into(),
+        }
+    }
+
+    #[cfg(test)]
+    pub(crate) fn mock() -> Self {
+        Self {
+            requests: Counter::new("x", " ").unwrap(),
+            errors: Counter::new("y", " ").unwrap(),
+            not_found: Counter::new("z", " ").unwrap(),
+            queue_depth: Gauge::new("w", " ").unwrap(),
+        }
+    }
+}
diff --git a/core/src/polling_monitor/mod.rs b/core/src/polling_monitor/mod.rs
new file mode 100644
index 0000000..cb8dbf4
--- /dev/null
+++ b/core/src/polling_monitor/mod.rs
@@ -0,0 +1,263 @@
+pub mod ipfs_service;
+mod metrics;
+
+use std::fmt::Display;
+use std::sync::Arc;
+
+use futures::stream;
+use futures::stream::StreamExt;
+use graph::cheap_clone::CheapClone;
+use graph::parking_lot::Mutex;
+use graph::prelude::tokio;
+use graph::slog::{debug, Logger};
+use graph::util::monitored::MonitoredVecDeque as VecDeque;
+use tokio::sync::{mpsc, watch};
+use tower::{Service, ServiceExt};
+
+pub use self::metrics::PollingMonitorMetrics;
+
+/// Spawn a monitor that actively polls a service. Whenever the service has capacity, the monitor
+/// pulls object ids from the queue and polls the service. If the object is not present or in case
+/// of error, the object id is pushed to the back of the queue to be polled again.
+///
+/// The service returns the request ID along with errors or responses. The response is an
+/// `Option`, to represent the object not being found.
+pub fn spawn_monitor<ID, S, E, Response: Send + 'static>(
+    service: S,
+    response_sender: mpsc::Sender<(ID, Response)>,
+    logger: Logger,
+    metrics: PollingMonitorMetrics,
+) -> PollingMonitor<ID>
+where
+    ID: Display + Send + 'static,
+    S: Service<ID, Response = (ID, Option<Response>), Error = (ID, E)> + Send + 'static,
+    E: Display + Send + 'static,
+    S::Future: Send,
+{
+    let queue = Arc::new(Mutex::new(VecDeque::new(
+        metrics.queue_depth.clone(),
+        metrics.requests.clone(),
+    )));
+    let (wake_up_queue, queue_woken) = watch::channel(());
+
+    let queue_to_stream = {
+        let queue = queue.cheap_clone();
+        stream::unfold((), move |()| {
+            let queue = queue.cheap_clone();
+            let mut queue_woken = queue_woken.clone();
+            async move {
+                loop {
+                    let id = queue.lock().pop_front();
+                    match id {
+                        Some(id) => break Some((id, ())),
+                        None => match queue_woken.changed().await {
+                            // Queue woken, check it.
+                            Ok(()) => {}
+
+                            // The `PollingMonitor` has been dropped, cancel this task.
+                            Err(_) => break None,
+                        },
+                    };
+                }
+            }
+        })
+    };
+
+    {
+        let queue = queue.cheap_clone();
+        graph::spawn(async move {
+            let mut responses = service.call_all(queue_to_stream).unordered().boxed();
+            while let Some(response) = responses.next().await {
+                match response {
+                    Ok((id, Some(response))) => {
+                        let send_result = response_sender.send((id, response)).await;
+                        if send_result.is_err() {
+                            // The receiver has been dropped, cancel this task.
+                            break;
+                        }
+                    }
+
+                    // Object not found, push the id to the back of the queue.
+                    Ok((id, None)) => {
+                        metrics.not_found.inc();
+                        queue.lock().push_back(id);
+                    }
+
+                    // Error polling, log it and push the id to the back of the queue.
+                    Err((id, e)) => {
+                        debug!(logger, "error polling";
+                                    "error" => format!("{:#}", e),
+                                    "object_id" => id.to_string());
+                        metrics.errors.inc();
+                        queue.lock().push_back(id);
+                    }
+                }
+            }
+        });
+    }
+
+    PollingMonitor {
+        queue,
+        wake_up_queue,
+    }
+}
+
+/// Handle for adding objects to be monitored.
+pub struct PollingMonitor<ID> {
+    queue: Arc<Mutex<VecDeque<ID>>>,
+
+    // This serves two purposes, to wake up the monitor when an item arrives on an empty queue, and
+    // to stop the montior task when this handle is dropped.
+    wake_up_queue: watch::Sender<()>,
+}
+
+impl<ID> PollingMonitor<ID> {
+    /// Add an object id to the polling queue. New requests have priority and are pushed to the
+    /// front of the queue.
+    pub fn monitor(&self, id: ID) {
+        let mut queue = self.queue.lock();
+        if queue.is_empty() {
+            // If the send fails, the response receiver has been dropped, so this handle is useless.
+            let _ = self.wake_up_queue.send(());
+        }
+        queue.push_front(id);
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    use anyhow::anyhow;
+    use futures::{Future, FutureExt, TryFutureExt};
+    use graph::log;
+    use std::{pin::Pin, task::Poll};
+    use tower_test::mock;
+
+    use super::*;
+
+    struct MockService(mock::Mock<&'static str, Option<&'static str>>);
+
+    impl Service<&'static str> for MockService {
+        type Response = (&'static str, Option<&'static str>);
+
+        type Error = (&'static str, anyhow::Error);
+
+        type Future = Pin<Box<dyn Future<Output = Result<Self::Response, Self::Error>> + Send>>;
+
+        fn poll_ready(&mut self, cx: &mut std::task::Context<'_>) -> Poll<Result<(), Self::Error>> {
+            self.0.poll_ready(cx).map_err(|_| unreachable!())
+        }
+
+        fn call(&mut self, req: &'static str) -> Self::Future {
+            self.0
+                .call(req)
+                .map_ok(move |x| (req, x))
+                .map_err(move |e| (req, anyhow!(e.to_string())))
+                .boxed()
+        }
+    }
+
+    async fn send_response<T, U>(handle: &mut mock::Handle<T, U>, res: U) {
+        handle.next_request().await.unwrap().1.send_response(res)
+    }
+
+    #[tokio::test]
+    async fn polling_monitor_simple() {
+        let (svc, mut handle) = mock::pair();
+        let (tx, mut rx) = mpsc::channel(10);
+        let monitor = spawn_monitor(
+            MockService(svc),
+            tx,
+            log::discard(),
+            PollingMonitorMetrics::mock(),
+        );
+
+        // Basic test, single file is immediately available.
+        monitor.monitor("req-0");
+        send_response(&mut handle, Some("res-0")).await;
+        assert_eq!(rx.recv().await, Some(("req-0", "res-0")));
+    }
+
+    #[tokio::test]
+    async fn polling_monitor_unordered() {
+        let (svc, mut handle) = mock::pair();
+        let (tx, mut rx) = mpsc::channel(10);
+        let monitor = spawn_monitor(
+            MockService(svc),
+            tx,
+            log::discard(),
+            PollingMonitorMetrics::mock(),
+        );
+
+        // Test unorderedness of the response stream, and the LIFO semantics of `monitor`.
+        //
+        // `req-1` has priority since it is the last request, but `req-0` is responded first.
+        monitor.monitor("req-0");
+        monitor.monitor("req-1");
+        let req_1 = handle.next_request().await.unwrap().1;
+        let req_0 = handle.next_request().await.unwrap().1;
+        req_0.send_response(Some("res-0"));
+        assert_eq!(rx.recv().await, Some(("req-0", "res-0")));
+        req_1.send_response(Some("res-1"));
+        assert_eq!(rx.recv().await, Some(("req-1", "res-1")));
+    }
+
+    #[tokio::test]
+    async fn polling_monitor_failed_push_to_back() {
+        let (svc, mut handle) = mock::pair();
+        let (tx, mut rx) = mpsc::channel(10);
+
+        // Limit service to one request at a time.
+        let svc = tower::limit::ConcurrencyLimit::new(MockService(svc), 1);
+        let monitor = spawn_monitor(svc, tx, log::discard(), PollingMonitorMetrics::mock());
+
+        // Test that objects not found go on the back of the queue.
+        monitor.monitor("req-0");
+        monitor.monitor("req-1");
+        send_response(&mut handle, None).await;
+        send_response(&mut handle, Some("res-0")).await;
+        assert_eq!(rx.recv().await, Some(("req-0", "res-0")));
+        send_response(&mut handle, Some("res-1")).await;
+        assert_eq!(rx.recv().await, Some(("req-1", "res-1")));
+
+        // Test that failed requests go on the back of the queue.
+        monitor.monitor("req-0");
+        monitor.monitor("req-1");
+        let req = handle.next_request().await.unwrap().1;
+        req.send_error(anyhow!("e"));
+        send_response(&mut handle, Some("res-0")).await;
+        assert_eq!(rx.recv().await, Some(("req-0", "res-0")));
+        send_response(&mut handle, Some("res-1")).await;
+        assert_eq!(rx.recv().await, Some(("req-1", "res-1")));
+    }
+
+    #[tokio::test]
+    async fn polling_monitor_cancelation() {
+        let (svc, _handle) = mock::pair();
+        let (tx, mut rx) = mpsc::channel(10);
+        let monitor = spawn_monitor(
+            MockService(svc),
+            tx,
+            log::discard(),
+            PollingMonitorMetrics::mock(),
+        );
+
+        // Cancelation on monitor drop.
+        drop(monitor);
+        assert_eq!(rx.recv().await, None);
+
+        let (svc, mut handle) = mock::pair();
+        let (tx, rx) = mpsc::channel(10);
+        let monitor = spawn_monitor(
+            MockService(svc),
+            tx,
+            log::discard(),
+            PollingMonitorMetrics::mock(),
+        );
+
+        // Cancelation on receiver drop.
+        monitor.monitor("req-0");
+        drop(rx);
+        send_response(&mut handle, Some("res-0")).await;
+        assert!(handle.next_request().await.is_none());
+    }
+}
diff --git a/core/src/subgraph/context.rs b/core/src/subgraph/context.rs
new file mode 100644
index 0000000..653d6c8
--- /dev/null
+++ b/core/src/subgraph/context.rs
@@ -0,0 +1,195 @@
+pub mod instance;
+
+use crate::polling_monitor::{
+    ipfs_service::IpfsService, spawn_monitor, PollingMonitor, PollingMonitorMetrics,
+};
+use anyhow::{self, Error};
+use bytes::Bytes;
+use cid::Cid;
+use graph::{
+    blockchain::Blockchain,
+    components::{
+        store::{DeploymentId, SubgraphFork},
+        subgraph::{MappingError, SharedProofOfIndexing},
+    },
+    data_source::{offchain, DataSource, TriggerData},
+    prelude::{
+        BlockNumber, BlockState, CancelGuard, DeploymentHash, MetricsRegistry, RuntimeHostBuilder,
+        SubgraphInstanceMetrics, TriggerProcessor,
+    },
+    slog::Logger,
+    tokio::sync::mpsc,
+};
+use std::collections::HashMap;
+use std::sync::{Arc, RwLock};
+
+use self::instance::SubgraphInstance;
+
+pub type SharedInstanceKeepAliveMap = Arc<RwLock<HashMap<DeploymentId, CancelGuard>>>;
+
+// The context keeps track of mutable in-memory state that is retained across blocks.
+//
+// Currently most of the changes are applied in `runner.rs`, but ideally more of that would be
+// refactored into the context so it wouldn't need `pub` fields. The entity cache should probaby
+// also be moved here.
+pub(crate) struct IndexingContext<C, T>
+where
+    T: RuntimeHostBuilder<C>,
+    C: Blockchain,
+{
+    instance: SubgraphInstance<C, T>,
+    pub instances: SharedInstanceKeepAliveMap,
+    pub filter: C::TriggerFilter,
+    pub offchain_monitor: OffchainMonitor,
+    trigger_processor: Box<dyn TriggerProcessor<C, T>>,
+}
+
+impl<C: Blockchain, T: RuntimeHostBuilder<C>> IndexingContext<C, T> {
+    pub fn new(
+        instance: SubgraphInstance<C, T>,
+        instances: SharedInstanceKeepAliveMap,
+        filter: C::TriggerFilter,
+        offchain_monitor: OffchainMonitor,
+        trigger_processor: Box<dyn TriggerProcessor<C, T>>,
+    ) -> Self {
+        Self {
+            instance,
+            instances,
+            filter,
+            offchain_monitor,
+            trigger_processor,
+        }
+    }
+
+    pub async fn process_trigger(
+        &self,
+        logger: &Logger,
+        block: &Arc<C::Block>,
+        trigger: &TriggerData<C>,
+        state: BlockState<C>,
+        proof_of_indexing: &SharedProofOfIndexing,
+        causality_region: &str,
+        debug_fork: &Option<Arc<dyn SubgraphFork>>,
+        subgraph_metrics: &Arc<SubgraphInstanceMetrics>,
+    ) -> Result<BlockState<C>, MappingError> {
+        self.process_trigger_in_hosts(
+            logger,
+            &self.instance.hosts(),
+            block,
+            trigger,
+            state,
+            proof_of_indexing,
+            causality_region,
+            debug_fork,
+            subgraph_metrics,
+        )
+        .await
+    }
+
+    pub async fn process_trigger_in_hosts(
+        &self,
+        logger: &Logger,
+        hosts: &[Arc<T::Host>],
+        block: &Arc<C::Block>,
+        trigger: &TriggerData<C>,
+        state: BlockState<C>,
+        proof_of_indexing: &SharedProofOfIndexing,
+        causality_region: &str,
+        debug_fork: &Option<Arc<dyn SubgraphFork>>,
+        subgraph_metrics: &Arc<SubgraphInstanceMetrics>,
+    ) -> Result<BlockState<C>, MappingError> {
+        self.trigger_processor
+            .process_trigger(
+                logger,
+                hosts,
+                block,
+                trigger,
+                state,
+                proof_of_indexing,
+                causality_region,
+                debug_fork,
+                subgraph_metrics,
+            )
+            .await
+    }
+
+    // Removes data sources hosts with a creation block greater or equal to `reverted_block`, so
+    // that they are no longer candidates for `process_trigger`.
+    //
+    // This does not currently affect the `offchain_monitor` or the `filter`, so they will continue
+    // to include data sources that have been reverted. This is not ideal for performance, but it
+    // does not affect correctness since triggers that have no matching host will be ignored by
+    // `process_trigger`.
+    pub fn revert_data_sources(&mut self, reverted_block: BlockNumber) {
+        self.instance.revert_data_sources(reverted_block)
+    }
+
+    pub fn add_dynamic_data_source(
+        &mut self,
+        logger: &Logger,
+        data_source: DataSource<C>,
+    ) -> Result<Option<Arc<T::Host>>, Error> {
+        let source = data_source.as_offchain().map(|ds| ds.source.clone());
+        let host = self.instance.add_dynamic_data_source(logger, data_source)?;
+
+        if host.is_some() {
+            if let Some(source) = source {
+                self.offchain_monitor.add_source(&source)?;
+            }
+        }
+
+        Ok(host)
+    }
+}
+
+pub(crate) struct OffchainMonitor {
+    ipfs_monitor: PollingMonitor<Cid>,
+    ipfs_monitor_rx: mpsc::Receiver<(Cid, Bytes)>,
+}
+
+impl OffchainMonitor {
+    pub fn new(
+        logger: Logger,
+        registry: Arc<dyn MetricsRegistry>,
+        subgraph_hash: &DeploymentHash,
+        ipfs_service: IpfsService,
+    ) -> Self {
+        let (ipfs_monitor_tx, ipfs_monitor_rx) = mpsc::channel(10);
+        let ipfs_monitor = spawn_monitor(
+            ipfs_service,
+            ipfs_monitor_tx,
+            logger,
+            PollingMonitorMetrics::new(registry, subgraph_hash),
+        );
+        Self {
+            ipfs_monitor,
+            ipfs_monitor_rx,
+        }
+    }
+
+    fn add_source(&mut self, source: &offchain::Source) -> Result<(), Error> {
+        match source {
+            offchain::Source::Ipfs(cid) => self.ipfs_monitor.monitor(cid.clone()),
+        };
+        Ok(())
+    }
+
+    pub fn ready_offchain_events(&mut self) -> Result<Vec<offchain::TriggerData>, Error> {
+        use graph::tokio::sync::mpsc::error::TryRecvError;
+
+        let mut triggers = vec![];
+        loop {
+            match self.ipfs_monitor_rx.try_recv() {
+                Ok((cid, data)) => triggers.push(offchain::TriggerData {
+                    source: offchain::Source::Ipfs(cid),
+                    data: Arc::new(data),
+                }),
+                Err(TryRecvError::Disconnected) => {
+                    anyhow::bail!("ipfs monitor unexpectedly terminated")
+                }
+                Err(TryRecvError::Empty) => break,
+            }
+        }
+        Ok(triggers)
+    }
+}
diff --git a/core/src/subgraph/context/instance.rs b/core/src/subgraph/context/instance.rs
new file mode 100644
index 0000000..a9e3ade
--- /dev/null
+++ b/core/src/subgraph/context/instance.rs
@@ -0,0 +1,166 @@
+use futures01::sync::mpsc::Sender;
+use graph::{
+    blockchain::Blockchain,
+    data_source::{DataSource, DataSourceTemplate},
+    prelude::*,
+};
+use std::collections::HashMap;
+
+use super::OffchainMonitor;
+
+pub(crate) struct SubgraphInstance<C: Blockchain, T: RuntimeHostBuilder<C>> {
+    subgraph_id: DeploymentHash,
+    network: String,
+    host_builder: T,
+    templates: Arc<Vec<DataSourceTemplate<C>>>,
+    host_metrics: Arc<HostMetrics>,
+
+    /// Runtime hosts, one for each data source mapping.
+    ///
+    /// The runtime hosts are created and added in the same order the
+    /// data sources appear in the subgraph manifest. Incoming block
+    /// stream events are processed by the mappings in this same order.
+    hosts: Vec<Arc<T::Host>>,
+
+    /// Maps the hash of a module to a channel to the thread in which the module is instantiated.
+    module_cache: HashMap<[u8; 32], Sender<T::Req>>,
+}
+
+impl<T, C> SubgraphInstance<C, T>
+where
+    C: Blockchain,
+    T: RuntimeHostBuilder<C>,
+{
+    pub fn from_manifest(
+        logger: &Logger,
+        manifest: SubgraphManifest<C>,
+        host_builder: T,
+        host_metrics: Arc<HostMetrics>,
+        offchain_monitor: &mut OffchainMonitor,
+    ) -> Result<Self, Error> {
+        let subgraph_id = manifest.id.clone();
+        let network = manifest.network_name();
+        let templates = Arc::new(manifest.templates);
+
+        let mut this = SubgraphInstance {
+            host_builder,
+            subgraph_id,
+            network,
+            hosts: Vec::new(),
+            module_cache: HashMap::new(),
+            templates,
+            host_metrics,
+        };
+
+        // Create a new runtime host for each data source in the subgraph manifest;
+        // we use the same order here as in the subgraph manifest to make the
+        // event processing behavior predictable
+        for ds in manifest.data_sources {
+            // TODO: This is duplicating code from `IndexingContext::add_dynamic_data_source` and
+            // `SubgraphInstance::add_dynamic_data_source`. Ideally this should be refactored into
+            // `IndexingContext`.
+
+            let runtime = ds.runtime();
+            let module_bytes = match runtime {
+                None => continue,
+                Some(ref module_bytes) => module_bytes,
+            };
+
+            if let DataSource::Offchain(ds) = &ds {
+                offchain_monitor.add_source(&ds.source)?;
+            }
+
+            let host = this.new_host(logger.cheap_clone(), ds, module_bytes)?;
+            this.hosts.push(Arc::new(host));
+        }
+
+        Ok(this)
+    }
+
+    // module_bytes is the same as data_source.runtime().unwrap(), this is to ensure that this
+    // function is only called for data_sources for which data_source.runtime().is_some() is true.
+    fn new_host(
+        &mut self,
+        logger: Logger,
+        data_source: DataSource<C>,
+        module_bytes: &Arc<Vec<u8>>,
+    ) -> Result<T::Host, Error> {
+        let mapping_request_sender = {
+            let module_hash = tiny_keccak::keccak256(module_bytes.as_ref());
+            if let Some(sender) = self.module_cache.get(&module_hash) {
+                sender.clone()
+            } else {
+                let sender = T::spawn_mapping(
+                    module_bytes.as_ref(),
+                    logger,
+                    self.subgraph_id.clone(),
+                    self.host_metrics.cheap_clone(),
+                )?;
+                self.module_cache.insert(module_hash, sender.clone());
+                sender
+            }
+        };
+        self.host_builder.build(
+            self.network.clone(),
+            self.subgraph_id.clone(),
+            data_source,
+            self.templates.cheap_clone(),
+            mapping_request_sender,
+            self.host_metrics.cheap_clone(),
+        )
+    }
+
+    pub(super) fn add_dynamic_data_source(
+        &mut self,
+        logger: &Logger,
+        data_source: DataSource<C>,
+    ) -> Result<Option<Arc<T::Host>>, Error> {
+        // Protect against creating more than the allowed maximum number of data sources
+        if let Some(max_data_sources) = ENV_VARS.subgraph_max_data_sources {
+            if self.hosts.len() >= max_data_sources {
+                anyhow::bail!(
+                    "Limit of {} data sources per subgraph exceeded",
+                    max_data_sources,
+                );
+            }
+        }
+
+        // `hosts` will remain ordered by the creation block.
+        // See also 8f1bca33-d3b7-4035-affc-fd6161a12448.
+        assert!(
+            self.hosts.last().and_then(|h| h.creation_block_number())
+                <= data_source.creation_block()
+        );
+
+        let module_bytes = match &data_source.runtime() {
+            None => return Ok(None),
+            Some(ref module_bytes) => module_bytes.cheap_clone(),
+        };
+
+        let host = Arc::new(self.new_host(logger.clone(), data_source, &module_bytes)?);
+
+        Ok(if self.hosts.contains(&host) {
+            None
+        } else {
+            self.hosts.push(host.clone());
+            Some(host)
+        })
+    }
+
+    pub(super) fn revert_data_sources(&mut self, reverted_block: BlockNumber) {
+        // `hosts` is ordered by the creation block.
+        // See also 8f1bca33-d3b7-4035-affc-fd6161a12448.
+        while self
+            .hosts
+            .last()
+            .filter(|h| h.creation_block_number() >= Some(reverted_block))
+            .is_some()
+        {
+            self.hosts.pop();
+        }
+    }
+
+    pub(super) fn hosts(&self) -> &[Arc<T::Host>] {
+        &self.hosts
+    }
+}
diff --git a/core/src/subgraph/error.rs b/core/src/subgraph/error.rs
new file mode 100644
index 0000000..b313125
--- /dev/null
+++ b/core/src/subgraph/error.rs
@@ -0,0 +1,28 @@
+use graph::data::subgraph::schema::SubgraphError;
+use graph::prelude::{thiserror, Error, StoreError};
+
+#[derive(thiserror::Error, Debug)]
+pub enum BlockProcessingError {
+    #[error("{0:#}")]
+    Unknown(#[from] Error),
+
+    // The error had a deterministic cause but, for a possibly non-deterministic reason, we chose to
+    // halt processing due to the error.
+    #[error("{0}")]
+    Deterministic(SubgraphError),
+
+    #[error("subgraph stopped while processing triggers")]
+    Canceled,
+}
+
+impl BlockProcessingError {
+    pub fn is_deterministic(&self) -> bool {
+        matches!(self, BlockProcessingError::Deterministic(_))
+    }
+}
+
+impl From<StoreError> for BlockProcessingError {
+    fn from(e: StoreError) -> Self {
+        BlockProcessingError::Unknown(e.into())
+    }
+}
diff --git a/core/src/subgraph/inputs.rs b/core/src/subgraph/inputs.rs
new file mode 100644
index 0000000..191dc69
--- /dev/null
+++ b/core/src/subgraph/inputs.rs
@@ -0,0 +1,31 @@
+use graph::{
+    blockchain::{Blockchain, TriggersAdapter},
+    components::{
+        store::{DeploymentLocator, SubgraphFork, WritableStore},
+        subgraph::ProofOfIndexingVersion,
+    },
+    data::subgraph::{SubgraphFeature, UnifiedMappingApiVersion},
+    data_source::DataSourceTemplate,
+    prelude::BlockNumber,
+};
+use std::collections::BTreeSet;
+use std::sync::Arc;
+
+pub struct IndexingInputs<C: Blockchain> {
+    pub deployment: DeploymentLocator,
+    pub features: BTreeSet<SubgraphFeature>,
+    pub start_blocks: Vec<BlockNumber>,
+    pub stop_block: Option<BlockNumber>,
+    pub store: Arc<dyn WritableStore>,
+    pub debug_fork: Option<Arc<dyn SubgraphFork>>,
+    pub triggers_adapter: Arc<dyn TriggersAdapter<C>>,
+    pub chain: Arc<C>,
+    pub templates: Arc<Vec<DataSourceTemplate<C>>>,
+    pub unified_api_version: UnifiedMappingApiVersion,
+    pub static_filters: bool,
+    pub poi_version: ProofOfIndexingVersion,
+    pub network: String,
+
+    // Correspondence between data source or template position in the manifest and name.
+    pub manifest_idx_and_name: Vec<(u32, String)>,
+}
diff --git a/core/src/subgraph/instance_manager.rs b/core/src/subgraph/instance_manager.rs
new file mode 100644
index 0000000..785f848
--- /dev/null
+++ b/core/src/subgraph/instance_manager.rs
@@ -0,0 +1,397 @@
+use crate::polling_monitor::ipfs_service::IpfsService;
+use crate::subgraph::context::{IndexingContext, SharedInstanceKeepAliveMap};
+use crate::subgraph::inputs::IndexingInputs;
+use crate::subgraph::loader::load_dynamic_data_sources;
+use crate::subgraph::runner::SubgraphRunner;
+use graph::blockchain::block_stream::BlockStreamMetrics;
+use graph::blockchain::Blockchain;
+use graph::blockchain::NodeCapabilities;
+use graph::blockchain::{BlockchainKind, TriggerFilter};
+use graph::components::subgraph::ProofOfIndexingVersion;
+use graph::data::subgraph::SPEC_VERSION_0_0_6;
+use graph::prelude::{SubgraphInstanceManager as SubgraphInstanceManagerTrait, *};
+use graph::{blockchain::BlockchainMap, components::store::DeploymentLocator};
+use graph_runtime_wasm::module::ToAscPtr;
+use graph_runtime_wasm::RuntimeHostBuilder;
+use tokio::task;
+
+use super::context::OffchainMonitor;
+use super::SubgraphTriggerProcessor;
+
+pub struct SubgraphInstanceManager<S: SubgraphStore> {
+    logger_factory: LoggerFactory,
+    subgraph_store: Arc<S>,
+    chains: Arc<BlockchainMap>,
+    metrics_registry: Arc<dyn MetricsRegistry>,
+    manager_metrics: SubgraphInstanceManagerMetrics,
+    instances: SharedInstanceKeepAliveMap,
+    link_resolver: Arc<dyn LinkResolver>,
+    ipfs_service: IpfsService,
+    static_filters: bool,
+}
+
+#[async_trait]
+impl<S: SubgraphStore> SubgraphInstanceManagerTrait for SubgraphInstanceManager<S> {
+    async fn start_subgraph(
+        self: Arc<Self>,
+        loc: DeploymentLocator,
+        manifest: serde_yaml::Mapping,
+        stop_block: Option<BlockNumber>,
+    ) {
+        let logger = self.logger_factory.subgraph_logger(&loc);
+        let err_logger = logger.clone();
+        let instance_manager = self.cheap_clone();
+
+        let subgraph_start_future = async move {
+            match BlockchainKind::from_manifest(&manifest)? {
+                BlockchainKind::Arweave => {
+                    instance_manager
+                        .start_subgraph_inner::<graph_chain_arweave::Chain>(
+                            logger,
+                            loc,
+                            manifest,
+                            stop_block,
+                            Box::new(SubgraphTriggerProcessor {}),
+                        )
+                        .await
+                }
+                BlockchainKind::Ethereum => {
+                    instance_manager
+                        .start_subgraph_inner::<graph_chain_ethereum::Chain>(
+                            logger,
+                            loc,
+                            manifest,
+                            stop_block,
+                            Box::new(SubgraphTriggerProcessor {}),
+                        )
+                        .await
+                }
+                BlockchainKind::Near => {
+                    instance_manager
+                        .start_subgraph_inner::<graph_chain_near::Chain>(
+                            logger,
+                            loc,
+                            manifest,
+                            stop_block,
+                            Box::new(SubgraphTriggerProcessor {}),
+                        )
+                        .await
+                }
+                BlockchainKind::Cosmos => {
+                    instance_manager
+                        .start_subgraph_inner::<graph_chain_cosmos::Chain>(
+                            logger,
+                            loc,
+                            manifest,
+                            stop_block,
+                            Box::new(SubgraphTriggerProcessor {}),
+                        )
+                        .await
+                }
+                BlockchainKind::Substreams => {
+                    instance_manager
+                        .start_subgraph_inner::<graph_chain_substreams::Chain>(
+                            logger,
+                            loc.cheap_clone(),
+                            manifest,
+                            stop_block,
+                            Box::new(graph_chain_substreams::TriggerProcessor::new(loc)),
+                        )
+                        .await
+                }
+            }
+        };
+        // Perform the actual work of starting the subgraph in a separate
+        // task. If the subgraph is a graft or a copy, starting it will
+        // perform the actual work of grafting/copying, which can take
+        // hours. Running it in the background makes sure the instance
+        // manager does not hang because of that work.
+        graph::spawn(async move {
+            match subgraph_start_future.await {
+                Ok(()) => self.manager_metrics.subgraph_count.inc(),
+                Err(err) => error!(
+                    err_logger,
+                    "Failed to start subgraph";
+                    "error" => format!("{:#}", err),
+                    "code" => LogCode::SubgraphStartFailure
+                ),
+            }
+        });
+    }
+
+    fn stop_subgraph(&self, loc: DeploymentLocator) {
+        let logger = self.logger_factory.subgraph_logger(&loc);
+        info!(logger, "Stop subgraph");
+
+        // Drop the cancel guard to shut down the subgraph now
+        let mut instances = self.instances.write().unwrap();
+        instances.remove(&loc.id);
+
+        self.manager_metrics.subgraph_count.dec();
+    }
+}
+
+impl<S: SubgraphStore> SubgraphInstanceManager<S> {
+    pub fn new(
+        logger_factory: &LoggerFactory,
+        subgraph_store: Arc<S>,
+        chains: Arc<BlockchainMap>,
+        metrics_registry: Arc<dyn MetricsRegistry>,
+        link_resolver: Arc<dyn LinkResolver>,
+        ipfs_service: IpfsService,
+        static_filters: bool,
+    ) -> Self {
+        let logger = logger_factory.component_logger("SubgraphInstanceManager", None);
+        let logger_factory = logger_factory.with_parent(logger.clone());
+
+        SubgraphInstanceManager {
+            logger_factory,
+            subgraph_store,
+            chains,
+            manager_metrics: SubgraphInstanceManagerMetrics::new(metrics_registry.cheap_clone()),
+            metrics_registry,
+            instances: SharedInstanceKeepAliveMap::default(),
+            link_resolver,
+            ipfs_service,
+            static_filters,
+        }
+    }
+
+    async fn start_subgraph_inner<C: Blockchain>(
+        self: Arc<Self>,
+        logger: Logger,
+        deployment: DeploymentLocator,
+        manifest: serde_yaml::Mapping,
+        stop_block: Option<BlockNumber>,
+        tp: Box<dyn TriggerProcessor<C, RuntimeHostBuilder<C>>>,
+    ) -> Result<(), Error>
+    where
+        <C as Blockchain>::MappingTrigger: ToAscPtr,
+    {
+        let subgraph_store = self.subgraph_store.cheap_clone();
+        let registry = self.metrics_registry.cheap_clone();
+        let store = self
+            .subgraph_store
+            .cheap_clone()
+            .writable(logger.clone(), deployment.id)
+            .await?;
+
+        // Start the subgraph deployment before reading dynamic data
+        // sources; if the subgraph is a graft or a copy, starting it will
+        // do the copying and dynamic data sources won't show up until after
+        // that is done
+        store.start_subgraph_deployment(&logger).await?;
+
+        let (manifest, manifest_idx_and_name) = {
+            info!(logger, "Resolve subgraph files using IPFS");
+
+            let mut manifest = SubgraphManifest::resolve_from_raw(
+                deployment.hash.cheap_clone(),
+                manifest,
+                // Allow for infinite retries for subgraph definition files.
+                &Arc::from(self.link_resolver.with_retries()),
+                &logger,
+                ENV_VARS.max_spec_version.clone(),
+            )
+            .await
+            .context("Failed to resolve subgraph from IPFS")?;
+
+            // We cannot include static data sources in the map because a static data source and a
+            // template may have the same name in the manifest.
+            let ds_len = manifest.data_sources.len() as u32;
+            let manifest_idx_and_name: Vec<(u32, String)> = manifest
+                .templates
+                .iter()
+                .map(|t| t.name().to_owned())
+                .enumerate()
+                .map(|(idx, name)| (ds_len + idx as u32, name))
+                .collect();
+
+            let data_sources = load_dynamic_data_sources(
+                store.clone(),
+                logger.clone(),
+                &manifest,
+                manifest_idx_and_name.clone(),
+            )
+            .await
+            .context("Failed to load dynamic data sources")?;
+
+            info!(logger, "Successfully resolved subgraph files using IPFS");
+
+            // Add dynamic data sources to the subgraph
+            manifest.data_sources.extend(data_sources);
+
+            info!(
+                logger,
+                "Data source count at start: {}",
+                manifest.data_sources.len()
+            );
+
+            (manifest, manifest_idx_and_name)
+        };
+
+        let onchain_data_sources = manifest
+            .data_sources
+            .iter()
+            .filter_map(|d| d.as_onchain().cloned())
+            .collect::<Vec<_>>();
+        let required_capabilities = C::NodeCapabilities::from_data_sources(&onchain_data_sources);
+        let network = manifest.network_name();
+
+        let chain = self
+            .chains
+            .get::<C>(network.clone())
+            .with_context(|| format!("no chain configured for network {}", network))?
+            .clone();
+
+        // Obtain filters from the manifest
+        let mut filter = C::TriggerFilter::from_data_sources(onchain_data_sources.iter());
+
+        if self.static_filters {
+            filter.extend_with_template(
+                manifest
+                    .templates
+                    .iter()
+                    .filter_map(|ds| ds.as_onchain())
+                    .cloned(),
+            );
+        }
+
+        let start_blocks = manifest.start_blocks();
+
+        let templates = Arc::new(manifest.templates.clone());
+
+        // Obtain the debug fork from the subgraph store
+        let debug_fork = self
+            .subgraph_store
+            .debug_fork(&deployment.hash, logger.clone())?;
+
+        // Create a subgraph instance from the manifest; this moves
+        // ownership of the manifest and host builder into the new instance
+        let stopwatch_metrics = StopwatchMetrics::new(
+            logger.clone(),
+            deployment.hash.clone(),
+            "process",
+            self.metrics_registry.clone(),
+        );
+
+        let unified_mapping_api_version = manifest.unified_mapping_api_version()?;
+        let triggers_adapter = chain.triggers_adapter(&deployment, &required_capabilities, unified_mapping_api_version).map_err(|e|
+                anyhow!(
+                "expected triggers adapter that matches deployment {} with required capabilities: {}: {}",
+                &deployment,
+                &required_capabilities, e))?.clone();
+
+        let subgraph_metrics = Arc::new(SubgraphInstanceMetrics::new(
+            registry.cheap_clone(),
+            deployment.hash.as_str(),
+            stopwatch_metrics.clone(),
+        ));
+        let subgraph_metrics_unregister = subgraph_metrics.clone();
+        let host_metrics = Arc::new(HostMetrics::new(
+            registry.cheap_clone(),
+            deployment.hash.as_str(),
+            stopwatch_metrics.clone(),
+        ));
+        let block_stream_metrics = Arc::new(BlockStreamMetrics::new(
+            registry.cheap_clone(),
+            &deployment.hash,
+            manifest.network_name(),
+            store.shard().to_string(),
+            stopwatch_metrics,
+        ));
+
+        let mut offchain_monitor = OffchainMonitor::new(
+            logger.cheap_clone(),
+            registry.cheap_clone(),
+            &manifest.id,
+            self.ipfs_service.cheap_clone(),
+        );
+
+        // Initialize deployment_head with current deployment head. Any sort of trouble in
+        // getting the deployment head ptr leads to initializing with 0
+        let deployment_head = store.block_ptr().map(|ptr| ptr.number).unwrap_or(0) as f64;
+        block_stream_metrics.deployment_head.set(deployment_head);
+
+        let host_builder = graph_runtime_wasm::RuntimeHostBuilder::new(
+            chain.runtime_adapter(),
+            self.link_resolver.cheap_clone(),
+            subgraph_store.ens_lookup(),
+        );
+
+        let features = manifest.features.clone();
+        let unified_api_version = manifest.unified_mapping_api_version()?;
+        let poi_version = if manifest.spec_version.ge(&SPEC_VERSION_0_0_6) {
+            ProofOfIndexingVersion::Fast
+        } else {
+            ProofOfIndexingVersion::Legacy
+        };
+
+        let instance = super::context::instance::SubgraphInstance::from_manifest(
+            &logger,
+            manifest,
+            host_builder,
+            host_metrics.clone(),
+            &mut offchain_monitor,
+        )?;
+
+        let inputs = IndexingInputs {
+            deployment: deployment.clone(),
+            features,
+            start_blocks,
+            stop_block,
+            store,
+            debug_fork,
+            triggers_adapter,
+            chain,
+            templates,
+            unified_api_version,
+            static_filters: self.static_filters,
+            manifest_idx_and_name,
+            poi_version,
+            network,
+        };
+
+        // The subgraph state tracks the state of the subgraph instance over time
+        let ctx = IndexingContext::new(
+            instance,
+            self.instances.cheap_clone(),
+            filter,
+            offchain_monitor,
+            tp,
+        );
+
+        let metrics = RunnerMetrics {
+            subgraph: subgraph_metrics,
+            host: host_metrics,
+            stream: block_stream_metrics,
+        };
+
+        // Keep restarting the subgraph until it terminates. The subgraph
+        // will usually only run once, but is restarted whenever a block
+        // creates dynamic data sources. This allows us to recreate the
+        // block stream and include events for the new data sources going
+        // forward; this is easier than updating the existing block stream.
+        //
+        // This is a long-running and unfortunately a blocking future (see #905), so it is run in
+        // its own thread. It is also run with `task::unconstrained` because we have seen deadlocks
+        // occur without it, possibly caused by our use of legacy futures and tokio versions in the
+        // codebase and dependencies, which may not play well with the tokio 1.0 cooperative
+        // scheduling. It is also logical in terms of performance to run this with `unconstrained`,
+        // it has a dedicated OS thread so the OS will handle the preemption. See
+        // https://github.com/tokio-rs/tokio/issues/3493.
+        graph::spawn_thread(deployment.to_string(), move || {
+            let runner = SubgraphRunner::new(inputs, ctx, logger.cheap_clone(), metrics);
+            if let Err(e) = graph::block_on(task::unconstrained(runner.run())) {
+                error!(
+                    &logger,
+                    "Subgraph instance failed to run: {}",
+                    format!("{:#}", e)
+                );
+            }
+            subgraph_metrics_unregister.unregister(registry);
+        });
+
+        Ok(())
+    }
+}
diff --git a/core/src/subgraph/loader.rs b/core/src/subgraph/loader.rs
new file mode 100644
index 0000000..3e59319
--- /dev/null
+++ b/core/src/subgraph/loader.rs
@@ -0,0 +1,47 @@
+use std::time::Instant;
+
+use graph::blockchain::Blockchain;
+use graph::components::store::WritableStore;
+use graph::data_source::DataSource;
+use graph::prelude::*;
+
+pub async fn load_dynamic_data_sources<C: Blockchain>(
+    store: Arc<dyn WritableStore>,
+    logger: Logger,
+    manifest: &SubgraphManifest<C>,
+    manifest_idx_and_name: Vec<(u32, String)>,
+) -> Result<Vec<DataSource<C>>, Error> {
+    let start_time = Instant::now();
+
+    let mut data_sources: Vec<DataSource<C>> = vec![];
+
+    for stored in store
+        .load_dynamic_data_sources(manifest_idx_and_name)
+        .await?
+    {
+        let template = manifest
+            .templates
+            .iter()
+            .find(|template| template.manifest_idx() == stored.manifest_idx)
+            .ok_or_else(|| anyhow!("no template with idx `{}` was found", stored.manifest_idx))?;
+
+        let ds = DataSource::from_stored_dynamic_data_source(&template, stored)?;
+
+        // The data sources are ordered by the creation block.
+        // See also 8f1bca33-d3b7-4035-affc-fd6161a12448.
+        anyhow::ensure!(
+            data_sources.last().and_then(|d| d.creation_block()) <= ds.creation_block(),
+            "Assertion failure: new data source has lower creation block than existing ones"
+        );
+
+        data_sources.push(ds);
+    }
+
+    trace!(
+        logger,
+        "Loaded dynamic data sources";
+        "ms" => start_time.elapsed().as_millis()
+    );
+
+    Ok(data_sources)
+}
diff --git a/core/src/subgraph/mod.rs b/core/src/subgraph/mod.rs
new file mode 100644
index 0000000..490c45f
--- /dev/null
+++ b/core/src/subgraph/mod.rs
@@ -0,0 +1,16 @@
+mod context;
+mod error;
+mod inputs;
+mod instance_manager;
+mod loader;
+mod provider;
+mod registrar;
+mod runner;
+mod state;
+mod stream;
+mod trigger_processor;
+
+pub use self::instance_manager::SubgraphInstanceManager;
+pub use self::provider::SubgraphAssignmentProvider;
+pub use self::registrar::SubgraphRegistrar;
+pub use self::trigger_processor::*;
diff --git a/core/src/subgraph/provider.rs b/core/src/subgraph/provider.rs
new file mode 100644
index 0000000..c513cb3
--- /dev/null
+++ b/core/src/subgraph/provider.rs
@@ -0,0 +1,90 @@
+use std::collections::HashSet;
+use std::sync::Mutex;
+
+use async_trait::async_trait;
+
+use graph::{
+    components::store::{DeploymentId, DeploymentLocator},
+    prelude::{SubgraphAssignmentProvider as SubgraphAssignmentProviderTrait, *},
+};
+
+pub struct SubgraphAssignmentProvider<I> {
+    logger_factory: LoggerFactory,
+    subgraphs_running: Arc<Mutex<HashSet<DeploymentId>>>,
+    link_resolver: Arc<dyn LinkResolver>,
+    instance_manager: Arc<I>,
+}
+
+impl<I: SubgraphInstanceManager> SubgraphAssignmentProvider<I> {
+    pub fn new(
+        logger_factory: &LoggerFactory,
+        link_resolver: Arc<dyn LinkResolver>,
+        instance_manager: I,
+    ) -> Self {
+        let logger = logger_factory.component_logger("SubgraphAssignmentProvider", None);
+        let logger_factory = logger_factory.with_parent(logger.clone());
+
+        // Create the subgraph provider
+        SubgraphAssignmentProvider {
+            logger_factory,
+            subgraphs_running: Arc::new(Mutex::new(HashSet::new())),
+            link_resolver: link_resolver.with_retries().into(),
+            instance_manager: Arc::new(instance_manager),
+        }
+    }
+}
+
+#[async_trait]
+impl<I: SubgraphInstanceManager> SubgraphAssignmentProviderTrait for SubgraphAssignmentProvider<I> {
+    async fn start(
+        &self,
+        loc: DeploymentLocator,
+        stop_block: Option<BlockNumber>,
+    ) -> Result<(), SubgraphAssignmentProviderError> {
+        let logger = self.logger_factory.subgraph_logger(&loc);
+
+        // If subgraph ID already in set
+        if !self.subgraphs_running.lock().unwrap().insert(loc.id) {
+            info!(logger, "Subgraph deployment is already running");
+
+            return Err(SubgraphAssignmentProviderError::AlreadyRunning(
+                loc.hash.clone(),
+            ));
+        }
+
+        let file_bytes = self
+            .link_resolver
+            .cat(&logger, &loc.hash.to_ipfs_link())
+            .await
+            .map_err(SubgraphAssignmentProviderError::ResolveError)?;
+
+        let raw: serde_yaml::Mapping = serde_yaml::from_slice(&file_bytes)
+            .map_err(|e| SubgraphAssignmentProviderError::ResolveError(e.into()))?;
+
+        self.instance_manager
+            .cheap_clone()
+            .start_subgraph(loc, raw, stop_block)
+            .await;
+
+        Ok(())
+    }
+
+    async fn stop(
+        &self,
+        deployment: DeploymentLocator,
+    ) -> Result<(), SubgraphAssignmentProviderError> {
+        // If subgraph ID was in set
+        if self
+            .subgraphs_running
+            .lock()
+            .unwrap()
+            .remove(&deployment.id)
+        {
+            // Shut down subgraph processing
+            self.instance_manager.stop_subgraph(deployment);
+            Ok(())
+        } else {
+            Err(SubgraphAssignmentProviderError::NotRunning(deployment))
+        }
+    }
+}
diff --git a/core/src/subgraph/registrar.rs b/core/src/subgraph/registrar.rs
new file mode 100644
index 0000000..8c4a215
--- /dev/null
+++ b/core/src/subgraph/registrar.rs
@@ -0,0 +1,634 @@
+use std::collections::HashSet;
+use std::time::Instant;
+
+use async_trait::async_trait;
+use graph::blockchain::Blockchain;
+use graph::blockchain::BlockchainKind;
+use graph::blockchain::BlockchainMap;
+use graph::components::store::{DeploymentId, DeploymentLocator, SubscriptionManager};
+use graph::data::subgraph::schema::DeploymentCreate;
+use graph::data::subgraph::Graft;
+use graph::prelude::{
+    CreateSubgraphResult, SubgraphAssignmentProvider as SubgraphAssignmentProviderTrait,
+    SubgraphRegistrar as SubgraphRegistrarTrait, *,
+};
+
+pub struct SubgraphRegistrar<P, S, SM> {
+    logger: Logger,
+    logger_factory: LoggerFactory,
+    resolver: Arc<dyn LinkResolver>,
+    provider: Arc<P>,
+    store: Arc<S>,
+    subscription_manager: Arc<SM>,
+    chains: Arc<BlockchainMap>,
+    node_id: NodeId,
+    version_switching_mode: SubgraphVersionSwitchingMode,
+    assignment_event_stream_cancel_guard: CancelGuard, // cancels on drop
+}
+
+impl<P, S, SM> SubgraphRegistrar<P, S, SM>
+where
+    P: SubgraphAssignmentProviderTrait,
+    S: SubgraphStore,
+    SM: SubscriptionManager,
+{
+    pub fn new(
+        logger_factory: &LoggerFactory,
+        resolver: Arc<dyn LinkResolver>,
+        provider: Arc<P>,
+        store: Arc<S>,
+        subscription_manager: Arc<SM>,
+        chains: Arc<BlockchainMap>,
+        node_id: NodeId,
+        version_switching_mode: SubgraphVersionSwitchingMode,
+    ) -> Self {
+        let logger = logger_factory.component_logger("SubgraphRegistrar", None);
+        let logger_factory = logger_factory.with_parent(logger.clone());
+
+        let resolver = resolver.with_retries();
+
+        SubgraphRegistrar {
+            logger,
+            logger_factory,
+            resolver: resolver.into(),
+            provider,
+            store,
+            subscription_manager,
+            chains,
+            node_id,
+            version_switching_mode,
+            assignment_event_stream_cancel_guard: CancelGuard::new(),
+        }
+    }
+
+    pub fn start(&self) -> impl Future<Item = (), Error = Error> {
+        let logger_clone1 = self.logger.clone();
+        let logger_clone2 = self.logger.clone();
+        let provider = self.provider.clone();
+        let node_id = self.node_id.clone();
+        let assignment_event_stream_cancel_handle =
+            self.assignment_event_stream_cancel_guard.handle();
+
+        // The order of the following three steps is important:
+        // - Start assignment event stream
+        // - Read assignments table and start assigned subgraphs
+        // - Start processing assignment event stream
+        //
+        // Starting the event stream before reading the assignments table ensures that no
+        // assignments are missed in the period of time between the table read and starting event
+        // processing.
+        // Delaying the start of event processing until after the table has been read and processed
+        // ensures that Remove events happen after the assigned subgraphs have been started, not
+        // before (otherwise a subgraph could be left running due to a race condition).
+        //
+        // The discrepancy between the start time of the event stream and the table read can result
+        // in some extraneous events on start up. Examples:
+        // - The event stream sees an Add event for subgraph A, but the table query finds that
+        //   subgraph A is already in the table.
+        // - The event stream sees a Remove event for subgraph B, but the table query finds that
+        //   subgraph B has already been removed.
+        // The `handle_assignment_events` function handles these cases by ignoring AlreadyRunning
+        // (on subgraph start) or NotRunning (on subgraph stop) error types, which makes the
+        // operations idempotent.
+
+        // Start event stream
+        let assignment_event_stream = self.assignment_events();
+
+        // Deploy named subgraphs found in store
+        self.start_assigned_subgraphs().and_then(move |()| {
+            // Spawn a task to handle assignment events.
+            // Blocking due to store interactions. Won't be blocking after #905.
+            graph::spawn_blocking(
+                assignment_event_stream
+                    .compat()
+                    .map_err(SubgraphAssignmentProviderError::Unknown)
+                    .map_err(CancelableError::Error)
+                    .cancelable(&assignment_event_stream_cancel_handle, || {
+                        Err(CancelableError::Cancel)
+                    })
+                    .compat()
+                    .for_each(move |assignment_event| {
+                        assert_eq!(assignment_event.node_id(), &node_id);
+                        handle_assignment_event(
+                            assignment_event,
+                            provider.clone(),
+                            logger_clone1.clone(),
+                        )
+                        .boxed()
+                        .compat()
+                    })
+                    .map_err(move |e| match e {
+                        CancelableError::Cancel => panic!("assignment event stream canceled"),
+                        CancelableError::Error(e) => {
+                            error!(logger_clone2, "Assignment event stream failed: {}", e);
+                            panic!("assignment event stream failed: {}", e);
+                        }
+                    })
+                    .compat(),
+            );
+
+            Ok(())
+        })
+    }
+
+    pub fn assignment_events(&self) -> impl Stream<Item = AssignmentEvent, Error = Error> + Send {
+        let store = self.store.clone();
+        let node_id = self.node_id.clone();
+        let logger = self.logger.clone();
+
+        self.subscription_manager
+            .subscribe(FromIterator::from_iter([SubscriptionFilter::Assignment]))
+            .map_err(|()| anyhow!("Entity change stream failed"))
+            .map(|event| {
+                // We're only interested in the SubgraphDeploymentAssignment change; we
+                // know that there is at least one, as that is what we subscribed to
+                let filter = SubscriptionFilter::Assignment;
+                let assignments = event
+                    .changes
+                    .iter()
+                    .filter(|change| filter.matches(change))
+                    .map(|change| match change {
+                        EntityChange::Data { .. } => unreachable!(),
+                        EntityChange::Assignment {
+                            deployment,
+                            operation,
+                        } => (deployment.clone(), operation.clone()),
+                    })
+                    .collect::<Vec<_>>();
+                stream::iter_ok(assignments)
+            })
+            .flatten()
+            .and_then(
+                move |(deployment, operation)| -> Result<Box<dyn Stream<Item = _, Error = _> + Send>, _> {
+                    trace!(logger, "Received assignment change";
+                                   "deployment" => %deployment,
+                                   "operation" => format!("{:?}", operation),
+                                );
+
+                    match operation {
+                        EntityChangeOperation::Set => {
+                            store
+                                .assigned_node(&deployment)
+                                .map_err(|e| {
+                                    anyhow!("Failed to get subgraph assignment entity: {}", e)
+                                })
+                                .map(|assigned| -> Box<dyn Stream<Item = _, Error = _> + Send> {
+                                    if let Some(assigned) = assigned {
+                                        if assigned == node_id {
+                                            // Start subgraph on this node
+                                            debug!(logger, "Deployment assignee is this node, broadcasting add event"; "assigned_to" => assigned, "node_id" => &node_id);
+                                            Box::new(stream::once(Ok(AssignmentEvent::Add {
+                                                deployment,
+                                                node_id: node_id.clone(),
+                                            })))
+                                        } else {
+                                            // Ensure it is removed from this node
+                                            debug!(logger, "Deployment assignee is not this node, broadcasting remove event"; "assigned_to" => assigned, "node_id" => &node_id);
+                                            Box::new(stream::once(Ok(AssignmentEvent::Remove {
+                                                deployment,
+                                                node_id: node_id.clone(),
+                                            })))
+                                        }
+                                    } else {
+                                        // Was added/updated, but is now gone.
+                                        debug!(logger, "Deployment has not assignee, we will get a separate remove event later"; "node_id" => &node_id);
+                                        Box::new(stream::empty())
+                                    }
+                                })
+                        }
+                        EntityChangeOperation::Removed => {
+                            // Send remove event without checking node ID.
+                            // If node ID does not match, then this is a no-op when handled in
+                            // assignment provider.
+                            Ok(Box::new(stream::once(Ok(AssignmentEvent::Remove {
+                                deployment,
+                                node_id: node_id.clone(),
+                            }))))
+                        }
+                    }
+                },
+            )
+            .flatten()
+    }
+
+    fn start_assigned_subgraphs(&self) -> impl Future<Item = (), Error = Error> {
+        let provider = self.provider.clone();
+        let logger = self.logger.clone();
+        let node_id = self.node_id.clone();
+
+        future::result(self.store.assignments(&self.node_id))
+            .map_err(|e| anyhow!("Error querying subgraph assignments: {}", e))
+            .and_then(move |deployments| {
+                // This operation should finish only after all subgraphs are
+                // started. We wait for the spawned tasks to complete by giving
+                // each a `sender` and waiting for all of them to be dropped, so
+                // the receiver terminates without receiving anything.
+                let deployments = HashSet::<DeploymentLocator>::from_iter(deployments);
+                let deployments_len = deployments.len();
+                let (sender, receiver) = futures01::sync::mpsc::channel::<()>(1);
+                for id in deployments {
+                    let sender = sender.clone();
+                    let logger = logger.clone();
+
+                    graph::spawn(
+                        start_subgraph(id, provider.clone(), logger).map(move |()| drop(sender)),
+                    );
+                }
+                drop(sender);
+                receiver.collect().then(move |_| {
+                    info!(logger, "Started all assigned subgraphs";
+                                  "count" => deployments_len, "node_id" => &node_id);
+                    future::ok(())
+                })
+            })
+    }
+}
+
+#[async_trait]
+impl<P, S, SM> SubgraphRegistrarTrait for SubgraphRegistrar<P, S, SM>
+where
+    P: SubgraphAssignmentProviderTrait,
+    S: SubgraphStore,
+    SM: SubscriptionManager,
+{
+    async fn create_subgraph(
+        &self,
+        name: SubgraphName,
+    ) -> Result<CreateSubgraphResult, SubgraphRegistrarError> {
+        let id = self.store.create_subgraph(name.clone())?;
+
+        debug!(self.logger, "Created subgraph"; "subgraph_name" => name.to_string());
+
+        Ok(CreateSubgraphResult { id })
+    }
+
+    async fn create_subgraph_version(
+        &self,
+        name: SubgraphName,
+        hash: DeploymentHash,
+        node_id: NodeId,
+        debug_fork: Option<DeploymentHash>,
+        start_block_override: Option<BlockPtr>,
+        graft_block_override: Option<BlockPtr>,
+    ) -> Result<DeploymentLocator, SubgraphRegistrarError> {
+        // We don't have a location for the subgraph yet; that will be
+        // assigned when we deploy for real. For logging purposes, make up a
+        // fake locator
+        let logger = self
+            .logger_factory
+            .subgraph_logger(&DeploymentLocator::new(DeploymentId(0), hash.clone()));
+
+        let raw: serde_yaml::Mapping = {
+            let file_bytes = self
+                .resolver
+                .cat(&logger, &hash.to_ipfs_link())
+                .await
+                .map_err(|e| {
+                    SubgraphRegistrarError::ResolveError(
+                        SubgraphManifestResolveError::ResolveError(e),
+                    )
+                })?;
+
+            serde_yaml::from_slice(&file_bytes)
+                .map_err(|e| SubgraphRegistrarError::ResolveError(e.into()))?
+        };
+
+        let kind = BlockchainKind::from_manifest(&raw).map_err(|e| {
+            SubgraphRegistrarError::ResolveError(SubgraphManifestResolveError::ResolveError(e))
+        })?;
+
+        let deployment_locator = match kind {
+            BlockchainKind::Arweave => {
+                create_subgraph_version::<graph_chain_arweave::Chain, _>(
+                    &logger,
+                    self.store.clone(),
+                    self.chains.cheap_clone(),
+                    name.clone(),
+                    hash.cheap_clone(),
+                    start_block_override,
+                    graft_block_override,
+                    raw,
+                    node_id,
+                    debug_fork,
+                    self.version_switching_mode,
+                    &self.resolver,
+                )
+                .await?
+            }
+            BlockchainKind::Ethereum => {
+                create_subgraph_version::<graph_chain_ethereum::Chain, _>(
+                    &logger,
+                    self.store.clone(),
+                    self.chains.cheap_clone(),
+                    name.clone(),
+                    hash.cheap_clone(),
+                    start_block_override,
+                    graft_block_override,
+                    raw,
+                    node_id,
+                    debug_fork,
+                    self.version_switching_mode,
+                    &self.resolver,
+                )
+                .await?
+            }
+            BlockchainKind::Near => {
+                create_subgraph_version::<graph_chain_near::Chain, _>(
+                    &logger,
+                    self.store.clone(),
+                    self.chains.cheap_clone(),
+                    name.clone(),
+                    hash.cheap_clone(),
+                    start_block_override,
+                    graft_block_override,
+                    raw,
+                    node_id,
+                    debug_fork,
+                    self.version_switching_mode,
+                    &self.resolver,
+                )
+                .await?
+            }
+            BlockchainKind::Cosmos => {
+                create_subgraph_version::<graph_chain_cosmos::Chain, _>(
+                    &logger,
+                    self.store.clone(),
+                    self.chains.cheap_clone(),
+                    name.clone(),
+                    hash.cheap_clone(),
+                    start_block_override,
+                    graft_block_override,
+                    raw,
+                    node_id,
+                    debug_fork,
+                    self.version_switching_mode,
+                    &self.resolver,
+                )
+                .await?
+            }
+            BlockchainKind::Substreams => {
+                create_subgraph_version::<graph_chain_substreams::Chain, _>(
+                    &logger,
+                    self.store.clone(),
+                    self.chains.cheap_clone(),
+                    name.clone(),
+                    hash.cheap_clone(),
+                    start_block_override,
+                    graft_block_override,
+                    raw,
+                    node_id,
+                    debug_fork,
+                    self.version_switching_mode,
+                    &self.resolver,
+                )
+                .await?
+            }
+        };
+
+        debug!(
+            &logger,
+            "Wrote new subgraph version to store";
+            "subgraph_name" => name.to_string(),
+            "subgraph_hash" => hash.to_string(),
+        );
+
+        Ok(deployment_locator)
+    }
+
+    async fn remove_subgraph(&self, name: SubgraphName) -> Result<(), SubgraphRegistrarError> {
+        self.store.clone().remove_subgraph(name.clone())?;
+
+        debug!(self.logger, "Removed subgraph"; "subgraph_name" => name.to_string());
+
+        Ok(())
+    }
+
+    /// Reassign a subgraph deployment to a different node.
+    ///
+    /// Reassigning to a nodeId that does not match any reachable graph-nodes will effectively pause the
+    /// subgraph syncing process.
+    async fn reassign_subgraph(
+        &self,
+        hash: &DeploymentHash,
+        node_id: &NodeId,
+    ) -> Result<(), SubgraphRegistrarError> {
+        let locations = self.store.locators(hash)?;
+        let deployment = match locations.len() {
+            0 => return Err(SubgraphRegistrarError::DeploymentNotFound(hash.to_string())),
+            1 => locations[0].clone(),
+            _ => {
+                return Err(SubgraphRegistrarError::StoreError(
+                    anyhow!(
+                        "there are {} different deployments with id {}",
+                        locations.len(),
+                        hash.as_str()
+                    )
+                    .into(),
+                ))
+            }
+        };
+        self.store.reassign_subgraph(&deployment, node_id)?;
+
+        Ok(())
+    }
+}
+
+async fn handle_assignment_event(
+    event: AssignmentEvent,
+    provider: Arc<impl SubgraphAssignmentProviderTrait>,
+    logger: Logger,
+) -> Result<(), CancelableError<SubgraphAssignmentProviderError>> {
+    let logger = logger.to_owned();
+
+    debug!(logger, "Received assignment event: {:?}", event);
+
+    match event {
+        AssignmentEvent::Add {
+            deployment,
+            node_id: _,
+        } => Ok(start_subgraph(deployment, provider.clone(), logger).await),
+        AssignmentEvent::Remove {
+            deployment,
+            node_id: _,
+        } => match provider.stop(deployment).await {
+            Ok(()) => Ok(()),
+            Err(SubgraphAssignmentProviderError::NotRunning(_)) => Ok(()),
+            Err(e) => Err(CancelableError::Error(e)),
+        },
+    }
+}
+
+async fn start_subgraph(
+    deployment: DeploymentLocator,
+    provider: Arc<impl SubgraphAssignmentProviderTrait>,
+    logger: Logger,
+) {
+    let logger = logger
+        .new(o!("subgraph_id" => deployment.hash.to_string(), "sgd" => deployment.id.to_string()));
+
+    trace!(logger, "Start subgraph");
+
+    let start_time = Instant::now();
+    let result = provider.start(deployment.clone(), None).await;
+
+    debug!(
+        logger,
+        "Subgraph started";
+        "start_ms" => start_time.elapsed().as_millis()
+    );
+
+    match result {
+        Ok(()) => (),
+        Err(SubgraphAssignmentProviderError::AlreadyRunning(_)) => (),
+        Err(e) => {
+            // Errors here are likely an issue with the subgraph.
+            error!(
+                logger,
+                "Subgraph instance failed to start";
+                "error" => e.to_string()
+            );
+        }
+    }
+}
+
+/// Resolves the subgraph's earliest block
+async fn resolve_start_block(
+    manifest: &SubgraphManifest<impl Blockchain>,
+    chain: &impl Blockchain,
+    logger: &Logger,
+) -> Result<Option<BlockPtr>, SubgraphRegistrarError> {
+    // If the minimum start block is 0 (i.e. the genesis block),
+    // return `None` to start indexing from the genesis block. Otherwise
+    // return a block pointer for the block with number `min_start_block - 1`.
+    match manifest
+        .start_blocks()
+        .into_iter()
+        .min()
+        .expect("cannot identify minimum start block because there are no data sources")
+    {
+        0 => Ok(None),
+        min_start_block => chain
+            .block_pointer_from_number(logger, min_start_block - 1)
+            .await
+            .map(Some)
+            .map_err(move |_| {
+                SubgraphRegistrarError::ManifestValidationError(vec![
+                    SubgraphManifestValidationError::BlockNotFound(min_start_block.to_string()),
+                ])
+            }),
+    }
+}
+
+/// Resolves the manifest's graft base block
+async fn resolve_graft_block(
+    base: &Graft,
+    chain: &impl Blockchain,
+    logger: &Logger,
+) -> Result<BlockPtr, SubgraphRegistrarError> {
+    chain
+        .block_pointer_from_number(logger, base.block)
+        .await
+        .map_err(|_| {
+            SubgraphRegistrarError::ManifestValidationError(vec![
+                SubgraphManifestValidationError::BlockNotFound(format!(
+                    "graft base block {} not found",
+                    base.block
+                )),
+            ])
+        })
+}
+
+async fn create_subgraph_version<C: Blockchain, S: SubgraphStore>(
+    logger: &Logger,
+    store: Arc<S>,
+    chains: Arc<BlockchainMap>,
+    name: SubgraphName,
+    deployment: DeploymentHash,
+    start_block_override: Option<BlockPtr>,
+    graft_block_override: Option<BlockPtr>,
+    raw: serde_yaml::Mapping,
+    node_id: NodeId,
+    debug_fork: Option<DeploymentHash>,
+    version_switching_mode: SubgraphVersionSwitchingMode,
+    resolver: &Arc<dyn LinkResolver>,
+) -> Result<DeploymentLocator, SubgraphRegistrarError> {
+    let unvalidated = UnvalidatedSubgraphManifest::<C>::resolve(
+        deployment,
+        raw,
+        &resolver,
+        &logger,
+        ENV_VARS.max_spec_version.clone(),
+    )
+    .map_err(SubgraphRegistrarError::ResolveError)
+    .await?;
+
+    let manifest = unvalidated
+        .validate(store.cheap_clone(), true)
+        .await
+        .map_err(SubgraphRegistrarError::ManifestValidationError)?;
+
+    let network_name = manifest.network_name();
+
+    let chain = chains
+        .get::<C>(network_name.clone())
+        .map_err(SubgraphRegistrarError::NetworkNotSupported)?
+        .cheap_clone();
+
+    let logger = logger.clone();
+    let store = store.clone();
+    let deployment_store = store.clone();
+
+    if !store.subgraph_exists(&name)? {
+        debug!(
+            logger,
+            "Subgraph not found, could not create_subgraph_version";
+            "subgraph_name" => name.to_string()
+        );
+        return Err(SubgraphRegistrarError::NameNotFound(name.to_string()));
+    }
+
+    let start_block = match start_block_override {
+        Some(block) => Some(block),
+        None => resolve_start_block(&manifest, &*chain, &logger).await?,
+    };
+
+    let base_block = match &manifest.graft {
+        None => None,
+        Some(graft) => Some((
+            graft.base.clone(),
+            match graft_block_override {
+                Some(block) => block,
+                None => resolve_graft_block(&graft, &*chain, &logger).await?,
+            },
+        )),
+    };
+
+    info!(
+        logger,
+        "Set subgraph start block";
+        "block" => format!("{:?}", start_block),
+    );
+
+    info!(
+        logger,
+        "Graft base";
+        "base" => format!("{:?}", base_block.as_ref().map(|(subgraph,_)| subgraph.to_string())),
+        "block" => format!("{:?}", base_block.as_ref().map(|(_,ptr)| ptr.number))
+    );
+
+    // Apply the subgraph versioning and deployment operations,
+    // creating a new subgraph deployment if one doesn't exist.
+    let deployment = DeploymentCreate::new(&manifest, start_block)
+        .graft(base_block)
+        .debug(debug_fork);
+    deployment_store
+        .create_subgraph_deployment(
+            name,
+            &manifest.schema,
+            deployment,
+            node_id,
+            network_name,
+            version_switching_mode,
+        )
+        .map_err(|e| SubgraphRegistrarError::SubgraphDeploymentError(e))
+}
diff --git a/core/src/subgraph/runner.rs b/core/src/subgraph/runner.rs
new file mode 100644
index 0000000..9ae886c
--- /dev/null
+++ b/core/src/subgraph/runner.rs
@@ -0,0 +1,1001 @@
+use crate::subgraph::context::IndexingContext;
+use crate::subgraph::error::BlockProcessingError;
+use crate::subgraph::inputs::IndexingInputs;
+use crate::subgraph::state::IndexingState;
+use crate::subgraph::stream::new_block_stream;
+use atomic_refcell::AtomicRefCell;
+use graph::blockchain::block_stream::{BlockStreamEvent, BlockWithTriggers, FirehoseCursor};
+use graph::blockchain::{Block, Blockchain, TriggerFilter as _};
+use graph::components::store::{EmptyStore, EntityKey, StoredDynamicDataSource};
+use graph::components::{
+    store::ModificationsAndCache,
+    subgraph::{CausalityRegion, MappingError, ProofOfIndexing, SharedProofOfIndexing},
+};
+use graph::data::store::scalar::Bytes;
+use graph::data::subgraph::{
+    schema::{SubgraphError, SubgraphHealth, POI_OBJECT},
+    SubgraphFeature,
+};
+use graph::data_source::{offchain, DataSource, TriggerData};
+use graph::prelude::*;
+use graph::util::{backoff::ExponentialBackoff, lfu_cache::LfuCache};
+use std::convert::TryFrom;
+use std::sync::Arc;
+use std::time::{Duration, Instant};
+
+const MINUTE: Duration = Duration::from_secs(60);
+
+const SKIP_PTR_UPDATES_THRESHOLD: Duration = Duration::from_secs(60 * 5);
+
+pub(crate) struct SubgraphRunner<C, T>
+where
+    C: Blockchain,
+    T: RuntimeHostBuilder<C>,
+{
+    ctx: IndexingContext<C, T>,
+    state: IndexingState,
+    inputs: Arc<IndexingInputs<C>>,
+    logger: Logger,
+    metrics: RunnerMetrics,
+}
+
+impl<C, T> SubgraphRunner<C, T>
+where
+    C: Blockchain,
+    T: RuntimeHostBuilder<C>,
+{
+    pub fn new(
+        inputs: IndexingInputs<C>,
+        ctx: IndexingContext<C, T>,
+        logger: Logger,
+        metrics: RunnerMetrics,
+    ) -> Self {
+        Self {
+            inputs: Arc::new(inputs),
+            ctx,
+            state: IndexingState {
+                should_try_unfail_non_deterministic: true,
+                synced: false,
+                skip_ptr_updates_timer: Instant::now(),
+                backoff: ExponentialBackoff::new(MINUTE * 2, ENV_VARS.subgraph_error_retry_ceil),
+                entity_lfu_cache: LfuCache::new(),
+            },
+            logger,
+            metrics,
+        }
+    }
+
+    pub async fn run(mut self) -> Result<(), Error> {
+        // If a subgraph failed for deterministic reasons, before start indexing, we first
+        // revert the deployment head. It should lead to the same result since the error was
+        // deterministic.
+        if let Some(current_ptr) = self.inputs.store.block_ptr() {
+            if let Some(parent_ptr) = self
+                .inputs
+                .triggers_adapter
+                .parent_ptr(&current_ptr)
+                .await?
+            {
+                // This reverts the deployment head to the parent_ptr if
+                // deterministic errors happened.
+                //
+                // There's no point in calling it if we have no current or parent block
+                // pointers, because there would be: no block to revert to or to search
+                // errors from (first execution).
+                let _outcome = self
+                    .inputs
+                    .store
+                    .unfail_deterministic_error(&current_ptr, &parent_ptr)
+                    .await?;
+            }
+        }
+
+        loop {
+            debug!(self.logger, "Starting or restarting subgraph");
+
+            let block_stream_canceler = CancelGuard::new();
+            let block_stream_cancel_handle = block_stream_canceler.handle();
+
+            let mut block_stream = new_block_stream(&self.inputs, &self.ctx.filter)
+                .await?
+                .map_err(CancelableError::Error)
+                .cancelable(&block_stream_canceler, || Err(CancelableError::Cancel));
+
+            // Keep the stream's cancel guard around to be able to shut it down when the subgraph
+            // deployment is unassigned
+            self.ctx
+                .instances
+                .write()
+                .unwrap()
+                .insert(self.inputs.deployment.id, block_stream_canceler);
+
+            debug!(self.logger, "Starting block stream");
+
+            // Process events from the stream as long as no restart is needed
+            loop {
+                let event = {
+                    let _section = self.metrics.stream.stopwatch.start_section("scan_blocks");
+
+                    block_stream.next().await
+                };
+
+                // TODO: move cancel handle to the Context
+                // This will require some code refactor in how the BlockStream is created
+                match self
+                    .handle_stream_event(event, &block_stream_cancel_handle)
+                    .await?
+                {
+                    Action::Continue => continue,
+                    Action::Stop => {
+                        info!(self.logger, "Stopping subgraph");
+                        self.inputs.store.flush().await?;
+                        return Ok(());
+                    }
+                    Action::Restart => break,
+                };
+            }
+        }
+    }
+
+    /// Processes a block and returns the updated context and a boolean flag indicating
+    /// whether new dynamic data sources have been added to the subgraph.
+    async fn process_block(
+        &mut self,
+        block_stream_cancel_handle: &CancelHandle,
+        block: BlockWithTriggers<C>,
+        firehose_cursor: FirehoseCursor,
+    ) -> Result<Action, BlockProcessingError> {
+        let triggers = block.trigger_data;
+        let block = Arc::new(block.block);
+        let block_ptr = block.ptr();
+
+        let logger = self.logger.new(o!(
+                "block_number" => format!("{:?}", block_ptr.number),
+                "block_hash" => format!("{}", block_ptr.hash)
+        ));
+
+        if triggers.len() == 1 {
+            debug!(&logger, "1 candidate trigger in this block");
+        } else {
+            debug!(
+                &logger,
+                "{} candidate triggers in this block",
+                triggers.len()
+            );
+        }
+
+        let proof_of_indexing = if self.inputs.store.supports_proof_of_indexing().await? {
+            Some(Arc::new(AtomicRefCell::new(ProofOfIndexing::new(
+                block_ptr.number,
+                self.inputs.poi_version,
+            ))))
+        } else {
+            None
+        };
+
+        // Causality region for onchain triggers.
+        let causality_region = CausalityRegion::from_network(&self.inputs.network);
+
+        // Process events one after the other, passing in entity operations
+        // collected previously to every new event being processed
+        let mut block_state = match self
+            .process_triggers(
+                &proof_of_indexing,
+                &block,
+                triggers.into_iter().map(TriggerData::Onchain),
+                &causality_region,
+            )
+            .await
+        {
+            // Triggers processed with no errors or with only deterministic errors.
+            Ok(block_state) => block_state,
+
+            // Some form of unknown or non-deterministic error ocurred.
+            Err(MappingError::Unknown(e)) => return Err(BlockProcessingError::Unknown(e)),
+            Err(MappingError::PossibleReorg(e)) => {
+                info!(logger,
+                    "Possible reorg detected, retrying";
+                    "error" => format!("{:#}", e),
+                );
+
+                // In case of a possible reorg, we want this function to do nothing and restart the
+                // block stream so it has a chance to detect the reorg.
+                //
+                // The state is unchanged at this point, except for having cleared the entity cache.
+                // Losing the cache is a bit annoying but not an issue for correctness.
+                //
+                // See also b21fa73b-6453-4340-99fb-1a78ec62efb1.
+                return Ok(Action::Restart);
+            }
+        };
+
+        // If new data sources have been created, and static filters are not in use, it is necessary
+        // to restart the block stream with the new filters.
+        let needs_restart = block_state.has_created_data_sources() && !self.inputs.static_filters;
+
+        // This loop will:
+        // 1. Instantiate created data sources.
+        // 2. Process those data sources for the current block.
+        // Until no data sources are created or MAX_DATA_SOURCES is hit.
+
+        // Note that this algorithm processes data sources spawned on the same block _breadth
+        // first_ on the tree implied by the parent-child relationship between data sources. Only a
+        // very contrived subgraph would be able to observe this.
+        while block_state.has_created_data_sources() {
+            // Instantiate dynamic data sources, removing them from the block state.
+            let (data_sources, runtime_hosts) =
+                self.create_dynamic_data_sources(block_state.drain_created_data_sources())?;
+
+            let filter = C::TriggerFilter::from_data_sources(
+                data_sources.iter().filter_map(DataSource::as_onchain),
+            );
+
+            // Reprocess the triggers from this block that match the new data sources
+            let block_with_triggers = self
+                .inputs
+                .triggers_adapter
+                .triggers_in_block(&logger, block.as_ref().clone(), &filter)
+                .await?;
+
+            let triggers = block_with_triggers.trigger_data;
+
+            if triggers.len() == 1 {
+                info!(
+                    &logger,
+                    "1 trigger found in this block for the new data sources"
+                );
+            } else if triggers.len() > 1 {
+                info!(
+                    &logger,
+                    "{} triggers found in this block for the new data sources",
+                    triggers.len()
+                );
+            }
+
+            // Add entity operations for the new data sources to the block state
+            // and add runtimes for the data sources to the subgraph instance.
+            self.persist_dynamic_data_sources(&mut block_state.entity_cache, data_sources);
+
+            // Process the triggers in each host in the same order the
+            // corresponding data sources have been created.
+            for trigger in triggers {
+                block_state = self
+                    .ctx
+                    .process_trigger_in_hosts(
+                        &logger,
+                        &runtime_hosts,
+                        &block,
+                        &TriggerData::Onchain(trigger),
+                        block_state,
+                        &proof_of_indexing,
+                        &causality_region,
+                        &self.inputs.debug_fork,
+                        &self.metrics.subgraph,
+                    )
+                    .await
+                    .map_err(|e| {
+                        // This treats a `PossibleReorg` as an ordinary error which will fail the subgraph.
+                        // This can cause an unnecessary subgraph failure, to fix it we need to figure out a
+                        // way to revert the effect of `create_dynamic_data_sources` so we may return a
+                        // clean context as in b21fa73b-6453-4340-99fb-1a78ec62efb1.
+                        match e {
+                            MappingError::PossibleReorg(e) | MappingError::Unknown(e) => {
+                                BlockProcessingError::Unknown(e)
+                            }
+                        }
+                    })?;
+            }
+        }
+
+        let has_errors = block_state.has_errors();
+        let is_non_fatal_errors_active = self
+            .inputs
+            .features
+            .contains(&SubgraphFeature::NonFatalErrors);
+
+        // Apply entity operations and advance the stream
+
+        // Avoid writing to store if block stream has been canceled
+        if block_stream_cancel_handle.is_canceled() {
+            return Err(BlockProcessingError::Canceled);
+        }
+
+        if let Some(proof_of_indexing) = proof_of_indexing {
+            let proof_of_indexing = Arc::try_unwrap(proof_of_indexing).unwrap().into_inner();
+            update_proof_of_indexing(
+                proof_of_indexing,
+                &self.metrics.host.stopwatch,
+                &mut block_state.entity_cache,
+            )
+            .await?;
+        }
+
+        let section = self
+            .metrics
+            .host
+            .stopwatch
+            .start_section("as_modifications");
+        let ModificationsAndCache {
+            modifications: mut mods,
+            data_sources,
+            entity_lfu_cache: cache,
+        } = block_state
+            .entity_cache
+            .as_modifications()
+            .map_err(|e| BlockProcessingError::Unknown(e.into()))?;
+        section.end();
+
+        // Check for offchain events and process them, including their entity modifications in the
+        // set to be transacted.
+        let offchain_events = self.ctx.offchain_monitor.ready_offchain_events()?;
+        let (offchain_mods, offchain_to_remove) =
+            self.handle_offchain_triggers(offchain_events).await?;
+        mods.extend(offchain_mods);
+
+        // Put the cache back in the state, asserting that the placeholder cache was not used.
+        assert!(self.state.entity_lfu_cache.is_empty());
+        self.state.entity_lfu_cache = cache;
+
+        if !mods.is_empty() {
+            info!(&logger, "Applying {} entity operation(s)", mods.len());
+        }
+
+        let err_count = block_state.deterministic_errors.len();
+        for (i, e) in block_state.deterministic_errors.iter().enumerate() {
+            let message = format!("{:#}", e).replace("\n", "\t");
+            error!(&logger, "Subgraph error {}/{}", i + 1, err_count;
+                "error" => message,
+                "code" => LogCode::SubgraphSyncingFailure
+            );
+        }
+
+        // Transact entity operations into the store and update the
+        // subgraph's block stream pointer
+        let _section = self.metrics.host.stopwatch.start_section("transact_block");
+        let start = Instant::now();
+
+        let store = &self.inputs.store;
+
+        // If a deterministic error has happened, make the PoI to be the only entity that'll be stored.
+        if has_errors && !is_non_fatal_errors_active {
+            let is_poi_entity =
+                |entity_mod: &EntityModification| entity_mod.entity_ref().entity_type.is_poi();
+            mods.retain(is_poi_entity);
+            // Confidence check
+            assert!(
+                mods.len() == 1,
+                "There should be only one PoI EntityModification"
+            );
+        }
+
+        let BlockState {
+            deterministic_errors,
+            ..
+        } = block_state;
+
+        let first_error = deterministic_errors.first().cloned();
+
+        store
+            .transact_block_operations(
+                block_ptr,
+                firehose_cursor,
+                mods,
+                &self.metrics.host.stopwatch,
+                data_sources,
+                deterministic_errors,
+                self.inputs.manifest_idx_and_name.clone(),
+                offchain_to_remove,
+            )
+            .await
+            .context("Failed to transact block operations")?;
+
+        // For subgraphs with `nonFatalErrors` feature disabled, we consider
+        // any error as fatal.
+        //
+        // So we do an early return to make the subgraph stop processing blocks.
+        //
+        // In this scenario the only entity that is stored/transacted is the PoI,
+        // all of the others are discarded.
+        if has_errors && !is_non_fatal_errors_active {
+            // Only the first error is reported.
+            return Err(BlockProcessingError::Deterministic(first_error.unwrap()));
+        }
+
+        let elapsed = start.elapsed().as_secs_f64();
+        self.metrics
+            .subgraph
+            .block_ops_transaction_duration
+            .observe(elapsed);
+
+        // To prevent a buggy pending version from replacing a current version, if errors are
+        // present the subgraph will be unassigned.
+        if has_errors && !ENV_VARS.disable_fail_fast && !store.is_deployment_synced().await? {
+            store
+                .unassign_subgraph()
+                .map_err(|e| BlockProcessingError::Unknown(e.into()))?;
+
+            // Use `Canceled` to avoiding setting the subgraph health to failed, an error was
+            // just transacted so it will be already be set to unhealthy.
+            return Err(BlockProcessingError::Canceled);
+        }
+
+        match needs_restart {
+            true => Ok(Action::Restart),
+            false => Ok(Action::Continue),
+        }
+    }
+
+    async fn process_triggers(
+        &mut self,
+        proof_of_indexing: &SharedProofOfIndexing,
+        block: &Arc<C::Block>,
+        triggers: impl Iterator<Item = TriggerData<C>>,
+        causality_region: &str,
+    ) -> Result<BlockState<C>, MappingError> {
+        let mut block_state = BlockState::new(
+            self.inputs.store.clone(),
+            std::mem::take(&mut self.state.entity_lfu_cache),
+        );
+
+        for trigger in triggers {
+            block_state = self
+                .ctx
+                .process_trigger(
+                    &self.logger,
+                    block,
+                    &trigger,
+                    block_state,
+                    proof_of_indexing,
+                    causality_region,
+                    &self.inputs.debug_fork,
+                    &self.metrics.subgraph,
+                )
+                .await
+                .map_err(move |mut e| {
+                    let error_context = trigger.error_context();
+                    if !error_context.is_empty() {
+                        e = e.context(error_context);
+                    }
+                    e.context("failed to process trigger".to_string())
+                })?;
+        }
+        Ok(block_state)
+    }
+
+    fn create_dynamic_data_sources(
+        &mut self,
+        created_data_sources: Vec<DataSourceTemplateInfo<C>>,
+    ) -> Result<(Vec<DataSource<C>>, Vec<Arc<T::Host>>), Error> {
+        let mut data_sources = vec![];
+        let mut runtime_hosts = vec![];
+
+        for info in created_data_sources {
+            // Try to instantiate a data source from the template
+            let data_source = DataSource::try_from(info)?;
+
+            // Try to create a runtime host for the data source
+            let host = self
+                .ctx
+                .add_dynamic_data_source(&self.logger, data_source.clone())?;
+
+            match host {
+                Some(host) => {
+                    data_sources.push(data_source);
+                    runtime_hosts.push(host);
+                }
+                None => {
+                    warn!(
+                        self.logger,
+                        "no runtime hosted created, there is already a runtime host instantiated for \
+                        this data source";
+                        "name" => &data_source.name(),
+                        "address" => &data_source.address()
+                        .map(|address| hex::encode(address))
+                        .unwrap_or("none".to_string()),
+                    )
+                }
+            }
+        }
+
+        Ok((data_sources, runtime_hosts))
+    }
+
+    fn persist_dynamic_data_sources(
+        &mut self,
+        entity_cache: &mut EntityCache,
+        data_sources: Vec<DataSource<C>>,
+    ) {
+        if !data_sources.is_empty() {
+            debug!(
+                self.logger,
+                "Creating {} dynamic data source(s)",
+                data_sources.len()
+            );
+        }
+
+        // Add entity operations to the block state in order to persist
+        // the dynamic data sources
+        for data_source in data_sources.iter() {
+            debug!(
+                self.logger,
+                "Persisting data_source";
+                "name" => &data_source.name(),
+                "address" => &data_source.address().map(|address| hex::encode(address)).unwrap_or("none".to_string()),
+            );
+            entity_cache.add_data_source(data_source);
+        }
+
+        // Merge filters from data sources into the block stream builder
+        self.ctx
+            .filter
+            .extend(data_sources.iter().filter_map(|ds| ds.as_onchain()));
+    }
+}
+
+impl<C, T> SubgraphRunner<C, T>
+where
+    C: Blockchain,
+    T: RuntimeHostBuilder<C>,
+{
+    async fn handle_stream_event(
+        &mut self,
+        event: Option<Result<BlockStreamEvent<C>, CancelableError<Error>>>,
+        cancel_handle: &CancelHandle,
+    ) -> Result<Action, Error> {
+        let action = match event {
+            Some(Ok(BlockStreamEvent::ProcessBlock(block, cursor))) => {
+                self.handle_process_block(block, cursor, cancel_handle)
+                    .await?
+            }
+            Some(Ok(BlockStreamEvent::Revert(revert_to_ptr, cursor))) => {
+                self.handle_revert(revert_to_ptr, cursor).await?
+            }
+            // Log and drop the errors from the block_stream
+            // The block stream will continue attempting to produce blocks
+            Some(Err(e)) => self.handle_err(e, cancel_handle).await?,
+            // If the block stream ends, that means that there is no more indexing to do.
+            // Typically block streams produce indefinitely, but tests are an example of finite block streams.
+            None => Action::Stop,
+        };
+
+        Ok(action)
+    }
+
+    async fn handle_offchain_triggers(
+        &mut self,
+        triggers: Vec<offchain::TriggerData>,
+    ) -> Result<(Vec<EntityModification>, Vec<StoredDynamicDataSource>), Error> {
+        let mut mods = vec![];
+        let mut offchain_to_remove = vec![];
+
+        for trigger in triggers {
+            // Using an `EmptyStore` and clearing the cache for each trigger is a makeshift way to
+            // get causality region isolation.
+            let schema = self.inputs.store.input_schema();
+            let mut block_state = BlockState::<C>::new(EmptyStore::new(schema), LfuCache::new());
+
+            // PoI ignores offchain events.
+            let proof_of_indexing = None;
+            let causality_region = "";
+
+            // We'll eventually need to do better here, but using an empty block works for now.
+            let block = Arc::default();
+            block_state = self
+                .ctx
+                .process_trigger(
+                    &self.logger,
+                    &block,
+                    &TriggerData::Offchain(trigger),
+                    block_state,
+                    &proof_of_indexing,
+                    &causality_region,
+                    &self.inputs.debug_fork,
+                    &self.metrics.subgraph,
+                )
+                .await
+                .map_err(move |err| {
+                    let err = match err {
+                        // Ignoring `PossibleReorg` isn't so bad since the subgraph will retry
+                        // non-deterministic errors.
+                        MappingError::PossibleReorg(e) | MappingError::Unknown(e) => e,
+                    };
+                    err.context("failed to process trigger".to_string())
+                })?;
+
+            anyhow::ensure!(
+                !block_state.has_created_data_sources(),
+                "Attempted to create data source in offchain data source handler. This is not yet supported.",
+            );
+
+            mods.extend(block_state.entity_cache.as_modifications()?.modifications);
+            offchain_to_remove.extend(block_state.offchain_to_remove);
+        }
+
+        Ok((mods, offchain_to_remove))
+    }
+}
+
+#[derive(Debug)]
+enum Action {
+    Continue,
+    Stop,
+    Restart,
+}
+
+#[async_trait]
+trait StreamEventHandler<C: Blockchain> {
+    async fn handle_process_block(
+        &mut self,
+        block: BlockWithTriggers<C>,
+        cursor: FirehoseCursor,
+        cancel_handle: &CancelHandle,
+    ) -> Result<Action, Error>;
+    async fn handle_revert(
+        &mut self,
+        revert_to_ptr: BlockPtr,
+        cursor: FirehoseCursor,
+    ) -> Result<Action, Error>;
+    async fn handle_err(
+        &mut self,
+        err: CancelableError<Error>,
+        cancel_handle: &CancelHandle,
+    ) -> Result<Action, Error>;
+}
+
+#[async_trait]
+impl<C, T> StreamEventHandler<C> for SubgraphRunner<C, T>
+where
+    C: Blockchain,
+    T: RuntimeHostBuilder<C>,
+{
+    async fn handle_process_block(
+        &mut self,
+        block: BlockWithTriggers<C>,
+        cursor: FirehoseCursor,
+        cancel_handle: &CancelHandle,
+    ) -> Result<Action, Error> {
+        let block_ptr = block.ptr();
+        self.metrics
+            .stream
+            .deployment_head
+            .set(block_ptr.number as f64);
+
+        if block.trigger_count() > 0 {
+            self.metrics
+                .subgraph
+                .block_trigger_count
+                .observe(block.trigger_count() as f64);
+        }
+
+        if block.trigger_count() == 0
+            && self.state.skip_ptr_updates_timer.elapsed() <= SKIP_PTR_UPDATES_THRESHOLD
+            && !self.state.synced
+            && !close_to_chain_head(
+                &block_ptr,
+                self.inputs.chain.chain_store().cached_head_ptr().await?,
+                // The "skip ptr updates timer" is ignored when a subgraph is at most 1000 blocks
+                // behind the chain head.
+                1000,
+            )
+        {
+            return Ok(Action::Continue);
+        } else {
+            self.state.skip_ptr_updates_timer = Instant::now();
+        }
+
+        let start = Instant::now();
+
+        let res = self.process_block(&cancel_handle, block, cursor).await;
+
+        let elapsed = start.elapsed().as_secs_f64();
+        self.metrics
+            .subgraph
+            .block_processing_duration
+            .observe(elapsed);
+
+        match res {
+            Ok(action) => {
+                // Once synced, no need to try to update the status again.
+                if !self.state.synced
+                    && close_to_chain_head(
+                        &block_ptr,
+                        self.inputs.chain.chain_store().cached_head_ptr().await?,
+                        // We consider a subgraph synced when it's at most 1 block behind the
+                        // chain head.
+                        1,
+                    )
+                {
+                    // Updating the sync status is an one way operation.
+                    // This state change exists: not synced -> synced
+                    // This state change does NOT: synced -> not synced
+                    self.inputs.store.deployment_synced()?;
+
+                    // Stop trying to update the sync status.
+                    self.state.synced = true;
+
+                    // Stop recording time-to-sync metrics.
+                    self.metrics.stream.stopwatch.disable();
+                }
+
+                // Keep trying to unfail subgraph for everytime it advances block(s) until it's
+                // health is not Failed anymore.
+                if self.state.should_try_unfail_non_deterministic {
+                    // If the deployment head advanced, we can unfail
+                    // the non-deterministic error (if there's any).
+                    let outcome = self
+                        .inputs
+                        .store
+                        .unfail_non_deterministic_error(&block_ptr)?;
+
+                    if let UnfailOutcome::Unfailed = outcome {
+                        // Stop trying to unfail.
+                        self.state.should_try_unfail_non_deterministic = false;
+                        self.metrics.stream.deployment_failed.set(0.0);
+                        self.state.backoff.reset();
+                    }
+                }
+
+                if let Some(stop_block) = &self.inputs.stop_block {
+                    if block_ptr.number >= *stop_block {
+                        info!(self.logger, "stop block reached for subgraph");
+                        return Ok(Action::Stop);
+                    }
+                }
+
+                if matches!(action, Action::Restart) {
+                    // Cancel the stream for real
+                    self.ctx
+                        .instances
+                        .write()
+                        .unwrap()
+                        .remove(&self.inputs.deployment.id);
+
+                    // And restart the subgraph
+                    return Ok(Action::Restart);
+                }
+
+                return Ok(Action::Continue);
+            }
+            Err(BlockProcessingError::Canceled) => {
+                debug!(self.logger, "Subgraph block stream shut down cleanly");
+                return Ok(Action::Stop);
+            }
+
+            // Handle unexpected stream errors by marking the subgraph as failed.
+            Err(e) => {
+                // Clear entity cache when a subgraph fails.
+                //
+                // This is done to be safe and sure that there's no state that's
+                // out of sync from the database.
+                //
+                // Without it, POI changes on failure would be kept in the entity cache
+                // and be transacted incorrectly in the next run.
+                self.state.entity_lfu_cache = LfuCache::new();
+
+                self.metrics.stream.deployment_failed.set(1.0);
+
+                let message = format!("{:#}", e).replace("\n", "\t");
+                let err = anyhow!("{}, code: {}", message, LogCode::SubgraphSyncingFailure);
+                let deterministic = e.is_deterministic();
+
+                let error = SubgraphError {
+                    subgraph_id: self.inputs.deployment.hash.clone(),
+                    message,
+                    block_ptr: Some(block_ptr),
+                    handler: None,
+                    deterministic,
+                };
+
+                match deterministic {
+                    true => {
+                        // Fail subgraph:
+                        // - Change status/health.
+                        // - Save the error to the database.
+                        self.inputs
+                            .store
+                            .fail_subgraph(error)
+                            .await
+                            .context("Failed to set subgraph status to `failed`")?;
+
+                        return Err(err);
+                    }
+                    false => {
+                        // Shouldn't fail subgraph if it's already failed for non-deterministic
+                        // reasons.
+                        //
+                        // If we don't do this check we would keep adding the same error to the
+                        // database.
+                        let should_fail_subgraph =
+                            self.inputs.store.health().await? != SubgraphHealth::Failed;
+
+                        if should_fail_subgraph {
+                            // Fail subgraph:
+                            // - Change status/health.
+                            // - Save the error to the database.
+                            self.inputs
+                                .store
+                                .fail_subgraph(error)
+                                .await
+                                .context("Failed to set subgraph status to `failed`")?;
+                        }
+
+                        // Retry logic below:
+
+                        // Cancel the stream for real.
+                        self.ctx
+                            .instances
+                            .write()
+                            .unwrap()
+                            .remove(&self.inputs.deployment.id);
+
+                        let message = format!("{:#}", e).replace("\n", "\t");
+                        error!(self.logger, "Subgraph failed with non-deterministic error: {}", message;
+                            "attempt" => self.state.backoff.attempt,
+                            "retry_delay_s" => self.state.backoff.delay().as_secs());
+
+                        // Sleep before restarting.
+                        self.state.backoff.sleep_async().await;
+
+                        self.state.should_try_unfail_non_deterministic = true;
+
+                        // And restart the subgraph.
+                        return Ok(Action::Restart);
+                    }
+                }
+            }
+        }
+    }
+
+    async fn handle_revert(
+        &mut self,
+        revert_to_ptr: BlockPtr,
+        cursor: FirehoseCursor,
+    ) -> Result<Action, Error> {
+        // Current deployment head in the database / WritableAgent Mutex cache.
+        //
+        // Safe unwrap because in a Revert event we're sure the subgraph has
+        // advanced at least once.
+        let subgraph_ptr = self.inputs.store.block_ptr().unwrap();
+        if revert_to_ptr.number >= subgraph_ptr.number {
+            info!(&self.logger, "Block to revert is higher than subgraph pointer, nothing to do"; "subgraph_ptr" => &subgraph_ptr, "revert_to_ptr" => &revert_to_ptr);
+            return Ok(Action::Continue);
+        }
+
+        info!(&self.logger, "Reverting block to get back to main chain"; "subgraph_ptr" => &subgraph_ptr, "revert_to_ptr" => &revert_to_ptr);
+
+        if let Err(e) = self
+            .inputs
+            .store
+            .revert_block_operations(revert_to_ptr, cursor)
+            .await
+        {
+            error!(&self.logger, "Could not revert block. Retrying"; "error" => %e);
+
+            // Exit inner block stream consumption loop and go up to loop that restarts subgraph
+            return Ok(Action::Restart);
+        }
+
+        self.metrics
+            .stream
+            .reverted_blocks
+            .set(subgraph_ptr.number as f64);
+        self.metrics
+            .stream
+            .deployment_head
+            .set(subgraph_ptr.number as f64);
+
+        // Revert the in-memory state:
+        // - Revert any dynamic data sources.
+        // - Clear the entity cache.
+        self.ctx.revert_data_sources(subgraph_ptr.number);
+        self.state.entity_lfu_cache = LfuCache::new();
+
+        Ok(Action::Continue)
+    }
+
+    async fn handle_err(
+        &mut self,
+        err: CancelableError<Error>,
+        cancel_handle: &CancelHandle,
+    ) -> Result<Action, Error> {
+        if cancel_handle.is_canceled() {
+            debug!(&self.logger, "Subgraph block stream shut down cleanly");
+            return Ok(Action::Stop);
+        }
+
+        debug!(
+            &self.logger,
+            "Block stream produced a non-fatal error";
+            "error" => format!("{}", err),
+        );
+
+        Ok(Action::Continue)
+    }
+}
+
+/// Transform the proof of indexing changes into entity updates that will be
+/// inserted when as_modifications is called.
+async fn update_proof_of_indexing(
+    proof_of_indexing: ProofOfIndexing,
+    stopwatch: &StopwatchMetrics,
+    entity_cache: &mut EntityCache,
+) -> Result<(), Error> {
+    let _section_guard = stopwatch.start_section("update_proof_of_indexing");
+
+    let mut proof_of_indexing = proof_of_indexing.take();
+
+    for (causality_region, stream) in proof_of_indexing.drain() {
+        // Create the special POI entity key specific to this causality_region
+        let entity_key = EntityKey {
+            entity_type: POI_OBJECT.to_owned(),
+            entity_id: causality_region.into(),
+        };
+
+        // Grab the current digest attribute on this entity
+        let prev_poi =
+            entity_cache
+                .get(&entity_key)
+                .map_err(Error::from)?
+                .map(|entity| match entity.get("digest") {
+                    Some(Value::Bytes(b)) => b.clone(),
+                    _ => panic!("Expected POI entity to have a digest and for it to be bytes"),
+                });
+
+        // Finish the POI stream, getting the new POI value.
+        let updated_proof_of_indexing = stream.pause(prev_poi.as_deref());
+        let updated_proof_of_indexing: Bytes = (&updated_proof_of_indexing[..]).into();
+
+        // Put this onto an entity with the same digest attribute
+        // that was expected before when reading.
+        let new_poi_entity = entity! {
+            id: entity_key.entity_id.to_string(),
+            digest: updated_proof_of_indexing,
+        };
+
+        entity_cache.set(entity_key, new_poi_entity)?;
+    }
+
+    Ok(())
+}
+
+/// Checks if the Deployment BlockPtr is at least X blocks behind to the chain head.
+fn close_to_chain_head(
+    deployment_head_ptr: &BlockPtr,
+    chain_head_ptr: Option<BlockPtr>,
+    n: BlockNumber,
+) -> bool {
+    matches!((deployment_head_ptr, &chain_head_ptr), (b1, Some(b2)) if b1.number >= (b2.number - n))
+}
+
+#[test]
+fn test_close_to_chain_head() {
+    let offset = 1;
+
+    let block_0 = BlockPtr::try_from((
+        "bd34884280958002c51d3f7b5f853e6febeba33de0f40d15b0363006533c924f",
+        0,
+    ))
+    .unwrap();
+    let block_1 = BlockPtr::try_from((
+        "8511fa04b64657581e3f00e14543c1d522d5d7e771b54aa3060b662ade47da13",
+        1,
+    ))
+    .unwrap();
+    let block_2 = BlockPtr::try_from((
+        "b98fb783b49de5652097a989414c767824dff7e7fd765a63b493772511db81c1",
+        2,
+    ))
+    .unwrap();
+
+    assert!(!close_to_chain_head(&block_0, None, offset));
+    assert!(!close_to_chain_head(&block_2, None, offset));
+
+    assert!(!close_to_chain_head(
+        &block_0,
+        Some(block_2.clone()),
+        offset
+    ));
+
+    assert!(close_to_chain_head(&block_1, Some(block_2.clone()), offset));
+    assert!(close_to_chain_head(&block_2, Some(block_2.clone()), offset));
+}
diff --git a/core/src/subgraph/state.rs b/core/src/subgraph/state.rs
new file mode 100644
index 0000000..0d5edd8
--- /dev/null
+++ b/core/src/subgraph/state.rs
@@ -0,0 +1,22 @@
+use graph::{
+    components::store::EntityKey,
+    prelude::Entity,
+    util::{backoff::ExponentialBackoff, lfu_cache::LfuCache},
+};
+use std::time::Instant;
+
+pub struct IndexingState {
+    /// `true` -> `false` on the first run
+    pub should_try_unfail_non_deterministic: bool,
+    /// `false` -> `true` once it reaches chain head
+    pub synced: bool,
+    /// Backoff used for the retry mechanism on non-deterministic errors
+    pub backoff: ExponentialBackoff,
+    /// Related to field above `backoff`
+    ///
+    /// Resets to `Instant::now` every time:
+    /// - The time THRESHOLD is passed
+    /// - Or the subgraph has triggers for the block
+    pub skip_ptr_updates_timer: Instant,
+    pub entity_lfu_cache: LfuCache<EntityKey, Option<Entity>>,
+}
diff --git a/core/src/subgraph/stream.rs b/core/src/subgraph/stream.rs
new file mode 100644
index 0000000..9733f0d
--- /dev/null
+++ b/core/src/subgraph/stream.rs
@@ -0,0 +1,46 @@
+use crate::subgraph::inputs::IndexingInputs;
+use graph::blockchain::block_stream::{BlockStream, BufferedBlockStream};
+use graph::blockchain::Blockchain;
+use graph::prelude::Error;
+use std::sync::Arc;
+
+const BUFFERED_BLOCK_STREAM_SIZE: usize = 100;
+const BUFFERED_FIREHOSE_STREAM_SIZE: usize = 1;
+
+pub async fn new_block_stream<C: Blockchain>(
+    inputs: &IndexingInputs<C>,
+    filter: &C::TriggerFilter,
+) -> Result<Box<dyn BlockStream<C>>, Error> {
+    let is_firehose = inputs.chain.is_firehose_supported();
+
+    let buffer_size = match is_firehose {
+        true => BUFFERED_FIREHOSE_STREAM_SIZE,
+        false => BUFFERED_BLOCK_STREAM_SIZE,
+    };
+
+    let current_ptr = inputs.store.block_ptr();
+
+    let block_stream = match is_firehose {
+        true => inputs.chain.new_firehose_block_stream(
+            inputs.deployment.clone(),
+            inputs.store.block_cursor(),
+            inputs.start_blocks.clone(),
+            current_ptr,
+            Arc::new(filter.clone()),
+            inputs.unified_api_version.clone(),
+        ),
+        false => inputs.chain.new_polling_block_stream(
+            inputs.deployment.clone(),
+            inputs.start_blocks.clone(),
+            current_ptr,
+            Arc::new(filter.clone()),
+            inputs.unified_api_version.clone(),
+        ),
+    }
+    .await?;
+
+    Ok(BufferedBlockStream::spawn_from_stream(
+        block_stream,
+        buffer_size,
+    ))
+}
diff --git a/core/src/subgraph/trigger_processor.rs b/core/src/subgraph/trigger_processor.rs
new file mode 100644
index 0000000..6122faa
--- /dev/null
+++ b/core/src/subgraph/trigger_processor.rs
@@ -0,0 +1,101 @@
+use async_trait::async_trait;
+use graph::blockchain::Blockchain;
+use graph::cheap_clone::CheapClone;
+use graph::components::store::SubgraphFork;
+use graph::components::subgraph::{MappingError, SharedProofOfIndexing};
+use graph::data_source::{MappingTrigger, TriggerData, TriggerWithHandler};
+use graph::prelude::tokio::time::Instant;
+use graph::prelude::{
+    BlockState, RuntimeHost, RuntimeHostBuilder, SubgraphInstanceMetrics, TriggerProcessor,
+};
+use graph::slog::Logger;
+use std::sync::Arc;
+
+pub struct SubgraphTriggerProcessor {}
+
+#[async_trait]
+impl<C, T> TriggerProcessor<C, T> for SubgraphTriggerProcessor
+where
+    C: Blockchain,
+    T: RuntimeHostBuilder<C>,
+{
+    async fn process_trigger(
+        &self,
+        logger: &Logger,
+        hosts: &[Arc<T::Host>],
+        block: &Arc<C::Block>,
+        trigger: &TriggerData<C>,
+        mut state: BlockState<C>,
+        proof_of_indexing: &SharedProofOfIndexing,
+        causality_region: &str,
+        debug_fork: &Option<Arc<dyn SubgraphFork>>,
+        subgraph_metrics: &Arc<SubgraphInstanceMetrics>,
+    ) -> Result<BlockState<C>, MappingError> {
+        let error_count = state.deterministic_errors.len();
+
+        let mut host_mapping: Vec<(&T::Host, TriggerWithHandler<MappingTrigger<C>>)> = vec![];
+
+        {
+            let _section = subgraph_metrics.stopwatch.start_section("match_and_decode");
+
+            for host in hosts {
+                let mapping_trigger = match host.match_and_decode(trigger, block, logger)? {
+                    // Trigger matches and was decoded as a mapping trigger.
+                    Some(mapping_trigger) => mapping_trigger,
+
+                    // Trigger does not match, do not process it.
+                    None => continue,
+                };
+
+                host_mapping.push((&host, mapping_trigger));
+            }
+        }
+
+        if host_mapping.is_empty() {
+            return Ok(state);
+        }
+
+        if let Some(proof_of_indexing) = proof_of_indexing {
+            proof_of_indexing
+                .borrow_mut()
+                .start_handler(causality_region);
+        }
+
+        for (host, mapping_trigger) in host_mapping {
+            let start = Instant::now();
+            state = host
+                .process_mapping_trigger(
+                    logger,
+                    mapping_trigger.block_ptr(),
+                    mapping_trigger,
+                    state,
+                    proof_of_indexing.cheap_clone(),
+                    debug_fork,
+                )
+                .await?;
+            let elapsed = start.elapsed().as_secs_f64();
+            subgraph_metrics.observe_trigger_processing_duration(elapsed);
+
+            if host.data_source().as_offchain().is_some() {
+                // Remove this offchain data source since it has just been processed.
+                state
+                    .offchain_to_remove
+                    .push(host.data_source().as_stored_dynamic_data_source());
+            }
+        }
+
+        if let Some(proof_of_indexing) = proof_of_indexing {
+            if state.deterministic_errors.len() != error_count {
+                assert!(state.deterministic_errors.len() == error_count + 1);
+
+                // If a deterministic error has happened, write a new
+                // ProofOfIndexingEvent::DeterministicError to the SharedProofOfIndexing.
+                proof_of_indexing
+                    .borrow_mut()
+                    .write_deterministic_error(&logger, causality_region);
+            }
+        }
+
+        Ok(state)
+    }
+}
diff --git a/core/tests/interfaces.rs b/core/tests/interfaces.rs
new file mode 100644
index 0000000..45f8109
--- /dev/null
+++ b/core/tests/interfaces.rs
@@ -0,0 +1,1514 @@
+// Tests for graphql interfaces.
+
+use pretty_assertions::assert_eq;
+
+use graph::{components::store::EntityType, data::graphql::object};
+use graph::{data::query::QueryTarget, prelude::*};
+use test_store::*;
+
+// `entities` is `(entity, type)`.
+async fn insert_and_query(
+    subgraph_id: &str,
+    schema: &str,
+    entities: Vec<(&str, Entity)>,
+    query: &str,
+) -> Result<QueryResult, StoreError> {
+    let subgraph_id = DeploymentHash::new(subgraph_id).unwrap();
+    let deployment = create_test_subgraph(&subgraph_id, schema).await;
+
+    let entities = entities
+        .into_iter()
+        .map(|(entity_type, data)| (EntityType::new(entity_type.to_owned()), data))
+        .collect();
+
+    insert_entities(&deployment, entities).await?;
+
+    let document = graphql_parser::parse_query(query).unwrap().into_static();
+    let target = QueryTarget::Deployment(subgraph_id, Default::default());
+    let query = Query::new(document, None);
+    Ok(execute_subgraph_query(query, target)
+        .await
+        .first()
+        .unwrap()
+        .duplicate())
+}
+
+/// Extract the data from a `QueryResult`, and panic if it has errors
+macro_rules! extract_data {
+    ($result: expr) => {
+        match $result.to_result() {
+            Err(errors) => panic!("Unexpected errors return for query: {:#?}", errors),
+            Ok(data) => data,
+        }
+    };
+}
+
+#[tokio::test]
+async fn one_interface_zero_entities() {
+    let subgraph_id = "oneInterfaceZeroEntities";
+    let schema = "interface Legged { legs: Int }
+                  type Animal implements Legged @entity { id: ID!, legs: Int }";
+
+    let query = "query { leggeds(first: 100) { legs } }";
+
+    let res = insert_and_query(subgraph_id, schema, vec![], query)
+        .await
+        .unwrap();
+
+    let data = extract_data!(res).unwrap();
+    let exp = object! { leggeds: Vec::<r::Value>::new() };
+    assert_eq!(data, exp);
+}
+
+#[tokio::test]
+async fn one_interface_one_entity() {
+    let subgraph_id = "oneInterfaceOneEntity";
+    let schema = "interface Legged { legs: Int }
+                  type Animal implements Legged @entity { id: ID!, legs: Int }";
+
+    let entity = (
+        "Animal",
+        Entity::from(vec![("id", Value::from("1")), ("legs", Value::from(3))]),
+    );
+
+    // Collection query.
+    let query = "query { leggeds(first: 100) { legs } }";
+    let res = insert_and_query(subgraph_id, schema, vec![entity], query)
+        .await
+        .unwrap();
+    let data = extract_data!(res).unwrap();
+    let exp = object! { leggeds: vec![ object!{ legs: 3 }]};
+    assert_eq!(data, exp);
+
+    // Query by ID.
+    let query = "query { legged(id: \"1\") { legs } }";
+    let res = insert_and_query(subgraph_id, schema, vec![], query)
+        .await
+        .unwrap();
+    let data = extract_data!(res).unwrap();
+    let exp = object! { legged: object! { legs: 3 }};
+    assert_eq!(data, exp);
+}
+
+#[tokio::test]
+async fn one_interface_one_entity_typename() {
+    let subgraph_id = "oneInterfaceOneEntityTypename";
+    let schema = "interface Legged { legs: Int }
+                  type Animal implements Legged @entity { id: ID!, legs: Int }";
+
+    let entity = (
+        "Animal",
+        Entity::from(vec![("id", Value::from("1")), ("legs", Value::from(3))]),
+    );
+
+    let query = "query { leggeds(first: 100) { __typename } }";
+
+    let res = insert_and_query(subgraph_id, schema, vec![entity], query)
+        .await
+        .unwrap();
+    let data = extract_data!(res).unwrap();
+    let exp = object! { leggeds: vec![ object!{ __typename: "Animal" } ]};
+    assert_eq!(data, exp);
+}
+
+#[tokio::test]
+async fn one_interface_multiple_entities() {
+    let subgraph_id = "oneInterfaceMultipleEntities";
+    let schema = "interface Legged { legs: Int }
+                  type Animal implements Legged @entity { id: ID!, legs: Int }
+                  type Furniture implements Legged @entity { id: ID!, legs: Int }
+                  ";
+
+    let animal = (
+        "Animal",
+        Entity::from(vec![("id", Value::from("1")), ("legs", Value::from(3))]),
+    );
+    let furniture = (
+        "Furniture",
+        Entity::from(vec![("id", Value::from("2")), ("legs", Value::from(4))]),
+    );
+
+    let query = "query { leggeds(first: 100, orderBy: legs) { legs } }";
+
+    let res = insert_and_query(subgraph_id, schema, vec![animal, furniture], query)
+        .await
+        .unwrap();
+    let data = extract_data!(res).unwrap();
+    let exp = object! { leggeds: vec![ object! { legs: 3 }, object! { legs: 4 }]};
+    assert_eq!(data, exp);
+
+    // Test for support issue #32.
+    let query = "query { legged(id: \"2\") { legs } }";
+    let res = insert_and_query(subgraph_id, schema, vec![], query)
+        .await
+        .unwrap();
+    let data = extract_data!(res).unwrap();
+    let exp = object! { legged: object! { legs: 4 }};
+    assert_eq!(data, exp);
+}
+
+#[tokio::test]
+async fn reference_interface() {
+    let subgraph_id = "ReferenceInterface";
+    let schema = "type Leg @entity { id: ID! }
+                  interface Legged { leg: Leg }
+                  type Animal implements Legged @entity { id: ID!, leg: Leg }";
+
+    let query = "query { leggeds(first: 100) { leg { id } } }";
+
+    let leg = ("Leg", Entity::from(vec![("id", Value::from("1"))]));
+    let animal = (
+        "Animal",
+        Entity::from(vec![("id", Value::from("1")), ("leg", Value::from("1"))]),
+    );
+
+    let res = insert_and_query(subgraph_id, schema, vec![leg, animal], query)
+        .await
+        .unwrap();
+
+    let data = extract_data!(res).unwrap();
+    let exp = object! { leggeds: vec![ object!{ leg: object! { id: "1" } }] };
+    assert_eq!(data, exp);
+}
+
+#[tokio::test]
+async fn reference_interface_derived() {
+    // Test the different ways in which interface implementations
+    // can reference another entity
+    let subgraph_id = "ReferenceInterfaceDerived";
+    let schema = "
+    type Transaction @entity {
+        id: ID!,
+        buyEvent: BuyEvent!,
+        sellEvents: [SellEvent!]!,
+        giftEvent: [GiftEvent!]! @derivedFrom(field: \"transaction\"),
+    }
+
+    interface Event {
+        id: ID!,
+        transaction: Transaction!
+    }
+
+    type BuyEvent implements Event @entity {
+        id: ID!,
+        # Derived, but only one buyEvent per Transaction
+        transaction: Transaction! @derivedFrom(field: \"buyEvent\")
+    }
+
+    type SellEvent implements Event @entity {
+        id: ID!
+        # Derived, many sellEvents per Transaction
+        transaction: Transaction! @derivedFrom(field: \"sellEvents\")
+    }
+
+    type GiftEvent implements Event @entity {
+        id: ID!,
+        # Store the transaction directly
+        transaction: Transaction!
+    }";
+
+    let query = "query { events { id transaction { id } } }";
+
+    let buy = ("BuyEvent", Entity::from(vec![("id", "buy".into())]));
+    let sell1 = ("SellEvent", Entity::from(vec![("id", "sell1".into())]));
+    let sell2 = ("SellEvent", Entity::from(vec![("id", "sell2".into())]));
+    let gift = (
+        "GiftEvent",
+        Entity::from(vec![("id", "gift".into()), ("transaction", "txn".into())]),
+    );
+    let txn = (
+        "Transaction",
+        Entity::from(vec![
+            ("id", "txn".into()),
+            ("buyEvent", "buy".into()),
+            ("sellEvents", vec!["sell1", "sell2"].into()),
+        ]),
+    );
+
+    let entities = vec![buy, sell1, sell2, gift, txn];
+    let res = insert_and_query(subgraph_id, schema, entities.clone(), query)
+        .await
+        .unwrap();
+
+    let data = extract_data!(res).unwrap();
+    let exp = object! {
+        events: vec![
+            object! { id: "buy", transaction: object! { id: "txn" } },
+            object! { id: "gift", transaction: object! { id: "txn" } },
+            object! { id: "sell1", transaction: object! { id: "txn" } },
+            object! { id: "sell2", transaction: object! { id: "txn" } }
+        ]
+    };
+    assert_eq!(data, exp);
+}
+
+#[tokio::test]
+async fn follow_interface_reference_invalid() {
+    let subgraph_id = "FollowInterfaceReferenceInvalid";
+    let schema = "interface Legged { legs: Int! }
+                  type Animal implements Legged @entity {
+                    id: ID!
+                    legs: Int!
+                    parent: Legged
+                  }";
+
+    let query = "query { legged(id: \"child\") { parent { id } } }";
+
+    let res = insert_and_query(subgraph_id, schema, vec![], query)
+        .await
+        .unwrap();
+
+    // Depending on whether `ENABLE_GRAPHQL_VALIDATIONS` is set or not, we
+    // get different errors
+    match &res.to_result().unwrap_err()[0] {
+        QueryError::ExecutionError(QueryExecutionError::ValidationError(_, error_message)) => {
+            assert_eq!(
+                error_message,
+                "Cannot query field \"parent\" on type \"Legged\"."
+            );
+        }
+        QueryError::ExecutionError(QueryExecutionError::UnknownField(_, type_name, field_name)) => {
+            assert_eq!(type_name, "Legged");
+            assert_eq!(field_name, "parent");
+        }
+        e => panic!("error `{}` is not the expected one", e),
+    }
+}
+
+#[tokio::test]
+async fn follow_interface_reference() {
+    let subgraph_id = "FollowInterfaceReference";
+    let schema = "interface Legged { id: ID!, legs: Int! }
+                  type Animal implements Legged @entity {
+                    id: ID!
+                    legs: Int!
+                    parent: Legged
+                  }";
+
+    let query = "query { legged(id: \"child\") { ... on Animal { parent { id } } } }";
+
+    let parent = (
+        "Animal",
+        Entity::from(vec![
+            ("id", Value::from("parent")),
+            ("legs", Value::from(4)),
+            ("parent", Value::Null),
+        ]),
+    );
+    let child = (
+        "Animal",
+        Entity::from(vec![
+            ("id", Value::from("child")),
+            ("legs", Value::from(3)),
+            ("parent", Value::String("parent".into())),
+        ]),
+    );
+
+    let res = insert_and_query(subgraph_id, schema, vec![parent, child], query)
+        .await
+        .unwrap();
+
+    let data = extract_data!(res).unwrap();
+    let exp = object! {
+        legged: object! { parent: object! { id: "parent" } }
+    };
+    assert_eq!(data, exp)
+}
+
+#[tokio::test]
+async fn conflicting_implementors_id() {
+    let subgraph_id = "ConflictingImplementorsId";
+    let schema = "interface Legged { legs: Int }
+                  type Animal implements Legged @entity { id: ID!, legs: Int }
+                  type Furniture implements Legged @entity { id: ID!, legs: Int }
+                  ";
+
+    let animal = (
+        "Animal",
+        Entity::from(vec![("id", Value::from("1")), ("legs", Value::from(3))]),
+    );
+    let furniture = (
+        "Furniture",
+        Entity::from(vec![("id", Value::from("1")), ("legs", Value::from(3))]),
+    );
+
+    let query = "query { leggeds(first: 100) { legs } }";
+
+    let res = insert_and_query(subgraph_id, schema, vec![animal, furniture], query).await;
+
+    let msg = res.unwrap_err().to_string();
+    // We don't know in which order the two entities get inserted; the two
+    // error messages only differ in who gets inserted first
+    const EXPECTED1: &str =
+        "tried to set entity of type `Furniture` with ID \"1\" but an entity of type `Animal`, \
+         which has an interface in common with `Furniture`, exists with the same ID";
+    const EXPECTED2: &str =
+        "tried to set entity of type `Animal` with ID \"1\" but an entity of type `Furniture`, \
+         which has an interface in common with `Animal`, exists with the same ID";
+
+    assert!(msg == EXPECTED1 || msg == EXPECTED2);
+}
+
+#[tokio::test]
+async fn derived_interface_relationship() {
+    let subgraph_id = "DerivedInterfaceRelationship";
+    let schema = "interface ForestDweller { id: ID!, forest: Forest }
+                  type Animal implements ForestDweller @entity { id: ID!, forest: Forest }
+                  type Forest @entity { id: ID!, dwellers: [ForestDweller]! @derivedFrom(field: \"forest\") }
+                  ";
+
+    let forest = ("Forest", Entity::from(vec![("id", Value::from("1"))]));
+    let animal = (
+        "Animal",
+        Entity::from(vec![("id", Value::from("1")), ("forest", Value::from("1"))]),
+    );
+
+    let query = "query { forests(first: 100) { dwellers(first: 100) { id } } }";
+
+    let res = insert_and_query(subgraph_id, schema, vec![forest, animal], query)
+        .await
+        .unwrap();
+    let data = extract_data!(res);
+    assert_eq!(
+        data.unwrap().to_string(),
+        "{forests: [{dwellers: [{id: \"1\"}]}]}"
+    );
+}
+
+#[tokio::test]
+async fn two_interfaces() {
+    let subgraph_id = "TwoInterfaces";
+    let schema = "interface IFoo { foo: String! }
+                  interface IBar { bar: Int! }
+
+                  type A implements IFoo @entity { id: ID!, foo: String! }
+                  type B implements IBar @entity { id: ID!, bar: Int! }
+
+                  type AB implements IFoo & IBar @entity { id: ID!, foo: String!, bar: Int! }
+                  ";
+
+    let a = (
+        "A",
+        Entity::from(vec![("id", Value::from("1")), ("foo", Value::from("bla"))]),
+    );
+    let b = (
+        "B",
+        Entity::from(vec![("id", Value::from("1")), ("bar", Value::from(100))]),
+    );
+    let ab = (
+        "AB",
+        Entity::from(vec![
+            ("id", Value::from("2")),
+            ("foo", Value::from("ble")),
+            ("bar", Value::from(200)),
+        ]),
+    );
+
+    let query = "query {
+                    ibars(first: 100, orderBy: bar) { bar }
+                    ifoos(first: 100, orderBy: foo) { foo }
+                }";
+    let res = insert_and_query(subgraph_id, schema, vec![a, b, ab], query)
+        .await
+        .unwrap();
+    let data = extract_data!(res).unwrap();
+    let exp = object! {
+        ibars: vec![ object! { bar: 100 }, object! { bar: 200 }],
+        ifoos: vec![ object! { foo: "bla" }, object! { foo: "ble" } ]
+    };
+    assert_eq!(data, exp);
+}
+
+#[tokio::test]
+async fn interface_non_inline_fragment() {
+    let subgraph_id = "interfaceNonInlineFragment";
+    let schema = "interface Legged { legs: Int }
+                  type Animal implements Legged @entity { id: ID!, name: String, legs: Int }";
+
+    let entity = (
+        "Animal",
+        Entity::from(vec![
+            ("id", Value::from("1")),
+            ("name", Value::from("cow")),
+            ("legs", Value::from(3)),
+        ]),
+    );
+
+    // Query only the fragment.
+    let query = "query { leggeds { ...frag } } fragment frag on Animal { name }";
+    let res = insert_and_query(subgraph_id, schema, vec![entity], query)
+        .await
+        .unwrap();
+    let data = extract_data!(res).unwrap();
+    let exp = object! { leggeds: vec![ object! { name: "cow" } ]};
+    assert_eq!(data, exp);
+
+    // Query the fragment and something else.
+    let query = "query { leggeds { legs, ...frag } } fragment frag on Animal { name }";
+    let res = insert_and_query(subgraph_id, schema, vec![], query)
+        .await
+        .unwrap();
+    let data = extract_data!(res).unwrap();
+    let exp = object! { leggeds: vec![ object!{ legs: 3, name: "cow" } ]};
+    assert_eq!(data, exp);
+}
+
+#[tokio::test]
+async fn interface_inline_fragment() {
+    let subgraph_id = "interfaceInlineFragment";
+    let schema = "interface Legged { legs: Int }
+                  type Animal implements Legged @entity { id: ID!, name: String, legs: Int }
+                  type Bird implements Legged @entity { id: ID!, airspeed: Int, legs: Int }";
+
+    let animal = (
+        "Animal",
+        Entity::from(vec![
+            ("id", Value::from("1")),
+            ("name", Value::from("cow")),
+            ("legs", Value::from(4)),
+        ]),
+    );
+    let bird = (
+        "Bird",
+        Entity::from(vec![
+            ("id", Value::from("2")),
+            ("airspeed", Value::from(24)),
+            ("legs", Value::from(2)),
+        ]),
+    );
+
+    let query =
+        "query { leggeds(orderBy: legs) { ... on Animal { name } ...on Bird { airspeed } } }";
+    let res = insert_and_query(subgraph_id, schema, vec![animal, bird], query)
+        .await
+        .unwrap();
+    let data = extract_data!(res).unwrap();
+    let exp = object! { leggeds: vec![ object!{ airspeed: 24 }, object! { name: "cow" }]};
+    assert_eq!(data, exp);
+}
+
+#[tokio::test]
+async fn interface_inline_fragment_with_subquery() {
+    let subgraph_id = "InterfaceInlineFragmentWithSubquery";
+    let schema = "
+        interface Legged { legs: Int }
+        type Parent @entity {
+          id: ID!
+        }
+        type Animal implements Legged @entity {
+          id: ID!
+          name: String
+          legs: Int
+          parent: Parent
+        }
+        type Bird implements Legged @entity {
+          id: ID!
+          airspeed: Int
+          legs: Int
+          parent: Parent
+        }
+    ";
+
+    let mama_cow = (
+        "Parent",
+        Entity::from(vec![("id", Value::from("mama_cow"))]),
+    );
+    let cow = (
+        "Animal",
+        Entity::from(vec![
+            ("id", Value::from("1")),
+            ("name", Value::from("cow")),
+            ("legs", Value::from(4)),
+            ("parent", Value::from("mama_cow")),
+        ]),
+    );
+
+    let mama_bird = (
+        "Parent",
+        Entity::from(vec![("id", Value::from("mama_bird"))]),
+    );
+    let bird = (
+        "Bird",
+        Entity::from(vec![
+            ("id", Value::from("2")),
+            ("airspeed", Value::from(5)),
+            ("legs", Value::from(2)),
+            ("parent", Value::from("mama_bird")),
+        ]),
+    );
+
+    let query = "query { leggeds(orderBy: legs) { legs ... on Bird { airspeed parent { id } } } }";
+    let res = insert_and_query(
+        subgraph_id,
+        schema,
+        vec![cow, mama_cow, bird, mama_bird],
+        query,
+    )
+    .await
+    .unwrap();
+    let data = extract_data!(res).unwrap();
+    let exp = object! {
+        leggeds: vec![ object!{ legs: 2, airspeed: 5, parent: object! { id: "mama_bird" } },
+                       object!{ legs: 4 }]
+    };
+    assert_eq!(data, exp);
+}
+
+#[tokio::test]
+async fn invalid_fragment() {
+    let subgraph_id = "InvalidFragment";
+    let schema = "interface Legged { legs: Int! }
+                  type Animal implements Legged @entity {
+                    id: ID!
+                    name: String!
+                    legs: Int!
+                    parent: Legged
+                  }";
+
+    let query = "query { legged(id: \"child\") { ...{ name } } }";
+
+    let res = insert_and_query(subgraph_id, schema, vec![], query)
+        .await
+        .unwrap();
+
+    match &res.to_result().unwrap_err()[0] {
+        QueryError::ExecutionError(QueryExecutionError::ValidationError(_, error_message)) => {
+            assert_eq!(
+                error_message,
+                "Cannot query field \"name\" on type \"Legged\"."
+            );
+        }
+        QueryError::ExecutionError(QueryExecutionError::UnknownField(_, type_name, field_name)) => {
+            assert_eq!(type_name, "Legged");
+            assert_eq!(field_name, "name");
+        }
+        e => panic!("error {} is not the expected one", e),
+    }
+}
+
+#[tokio::test]
+async fn alias() {
+    let subgraph_id = "Alias";
+    let schema = "interface Legged { id: ID!, legs: Int! }
+                  type Animal implements Legged @entity {
+                    id: ID!
+                    legs: Int!
+                    parent: Legged
+                  }";
+
+    let query = "query {
+                    l: legged(id: \"child\") {
+                        ... on Animal {
+                            p: parent {
+                                i: id,
+                                t: __typename,
+                                __typename
+                            }
+                        }
+                    }
+            }";
+
+    let parent = (
+        "Animal",
+        Entity::from(vec![
+            ("id", Value::from("parent")),
+            ("legs", Value::from(4)),
+            ("parent", Value::Null),
+        ]),
+    );
+    let child = (
+        "Animal",
+        Entity::from(vec![
+            ("id", Value::from("child")),
+            ("legs", Value::from(3)),
+            ("parent", Value::String("parent".into())),
+        ]),
+    );
+
+    let res = insert_and_query(subgraph_id, schema, vec![parent, child], query)
+        .await
+        .unwrap();
+    let data = extract_data!(res).unwrap();
+    assert_eq!(
+        data,
+        object! {
+            l: object! {
+                p: object! {
+                    i: "parent",
+                    t: "Animal",
+                    __typename: "Animal"
+                }
+            }
+        }
+    )
+}
+
+#[tokio::test]
+async fn fragments_dont_panic() {
+    let subgraph_id = "FragmentsDontPanic";
+    let schema = "
+      type Parent @entity {
+        id: ID!
+        child: Child
+      }
+
+      type Child @entity {
+        id: ID!
+      }
+    ";
+
+    let query = "
+        query {
+            parents {
+                ...on Parent {
+                    child {
+                        id
+                    }
+                }
+                ...Frag
+                child {
+                    id
+                }
+            }
+        }
+
+        fragment Frag on Parent {
+            child {
+                id
+            }
+        }
+    ";
+
+    // The panic manifests if two parents exist.
+    let parent = (
+        "Parent",
+        entity!(
+            id: "p",
+            child: "c",
+        ),
+    );
+    let parent2 = (
+        "Parent",
+        entity!(
+            id: "p2",
+            child: Value::Null,
+        ),
+    );
+    let child = (
+        "Child",
+        entity!(
+            id:"c"
+        ),
+    );
+
+    let res = insert_and_query(subgraph_id, schema, vec![parent, parent2, child], query)
+        .await
+        .unwrap();
+
+    let data = extract_data!(res).unwrap();
+    assert_eq!(
+        data,
+        object! {
+            parents: vec![
+                object! {
+                    child: object! {
+                        id: "c",
+                    }
+                },
+                object! {
+                    child: r::Value::Null
+                }
+            ]
+        }
+    )
+}
+
+// See issue #1816
+#[tokio::test]
+async fn fragments_dont_duplicate_data() {
+    let subgraph_id = "FragmentsDupe";
+    let schema = "
+      type Parent @entity {
+        id: ID!
+        children: [Child!]!
+      }
+
+      type Child @entity {
+        id: ID!
+      }
+    ";
+
+    let query = "
+        query {
+            parents {
+                ...Frag
+                children {
+                    id
+                }
+            }
+        }
+
+        fragment Frag on Parent {
+            children {
+                id
+            }
+        }
+    ";
+
+    // This bug manifests if two parents exist.
+    let parent = (
+        "Parent",
+        entity!(
+            id: "p",
+            children: vec!["c"]
+        ),
+    );
+    let parent2 = (
+        "Parent",
+        entity!(
+            id: "b",
+            children: Vec::<String>::new()
+        ),
+    );
+    let child = (
+        "Child",
+        entity!(
+            id:"c"
+        ),
+    );
+
+    let res = insert_and_query(subgraph_id, schema, vec![parent, parent2, child], query)
+        .await
+        .unwrap();
+
+    let data = extract_data!(res).unwrap();
+    assert_eq!(
+        data,
+        object! {
+            parents: vec![
+                object! {
+                    children: Vec::<r::Value>::new()
+                },
+                object! {
+                    children: vec![
+                        object! {
+                            id: "c",
+                        }
+                    ]
+                }
+            ]
+        }
+    )
+}
+
+// See also: e0d6da3e-60cf-41a5-b83c-b60a7a766d4a
+#[tokio::test]
+async fn redundant_fields() {
+    let subgraph_id = "RedundantFields";
+    let schema = "interface Legged { id: ID!, parent: Legged }
+                  type Animal implements Legged @entity {
+                    id: ID!
+                    parent: Legged
+                  }";
+
+    let query = "query {
+                    leggeds {
+                        parent { id }
+                        ...on Animal {
+                            parent { id }
+                        }
+                    }
+            }";
+
+    let parent = (
+        "Animal",
+        entity!(
+            id: "parent",
+            parent: Value::Null,
+        ),
+    );
+    let child = (
+        "Animal",
+        entity!(
+            id: "child",
+            parent: "parent",
+        ),
+    );
+
+    let res = insert_and_query(subgraph_id, schema, vec![parent, child], query)
+        .await
+        .unwrap();
+
+    let data = extract_data!(res).unwrap();
+    assert_eq!(
+        data,
+        object! {
+            leggeds: vec![
+                object! {
+                    parent: object! {
+                        id: "parent",
+                    },
+                },
+                object! {
+                    parent: r::Value::Null
+                }
+            ]
+        }
+    )
+}
+
+#[tokio::test]
+async fn fragments_merge_selections() {
+    let subgraph_id = "FragmentsMergeSelections";
+    let schema = "
+      type Parent @entity {
+        id: ID!
+        children: [Child!]!
+      }
+
+      type Child @entity {
+        id: ID!
+        foo: Int!
+      }
+    ";
+
+    let query = "
+        query {
+            parents {
+                ...Frag
+                children {
+                    id
+                }
+            }
+        }
+
+        fragment Frag on Parent {
+            children {
+                foo
+            }
+        }
+    ";
+
+    let parent = (
+        "Parent",
+        entity!(
+            id: "p",
+            children: vec!["c"]
+        ),
+    );
+    let child = (
+        "Child",
+        entity!(
+            id: "c",
+            foo: 1,
+        ),
+    );
+
+    let res = insert_and_query(subgraph_id, schema, vec![parent, child], query)
+        .await
+        .unwrap();
+
+    let data = extract_data!(res).unwrap();
+    assert_eq!(
+        data,
+        object! {
+            parents: vec![
+                object! {
+                    children: vec![
+                        object! {
+                            foo: 1,
+                            id: "c",
+                        }
+                    ]
+                }
+            ]
+        }
+    )
+}
+
+#[tokio::test]
+async fn merge_fields_not_in_interface() {
+    let subgraph_id = "MergeFieldsNotInInterface";
+    let schema = "interface Iface { id: ID! }
+                  type Animal implements Iface @entity {
+                    id: ID!
+                    human: Iface!
+                  }
+                  type Human implements Iface @entity {
+                    id: ID!
+                    animal: Iface!
+                  }
+                  ";
+
+    let query = "query {
+                    ifaces {
+                        ...on Animal {
+                            id
+                            friend: human {
+                              id
+                            }
+                        }
+                        ...on Human {
+                            id
+                            friend: animal {
+                              id
+                            }
+                        }
+                    }
+            }";
+
+    let animal = (
+        "Animal",
+        entity!(
+            id: "cow",
+            human: "fred",
+        ),
+    );
+    let human = (
+        "Human",
+        entity!(
+            id: "fred",
+            animal: "cow",
+        ),
+    );
+
+    let res = insert_and_query(subgraph_id, schema, vec![animal, human], query)
+        .await
+        .unwrap();
+
+    let data = extract_data!(res).unwrap();
+    assert_eq!(
+        data,
+        object! {
+            ifaces: vec![
+                object! {
+                    id: "cow",
+                    friend: object! {
+                        id: "fred",
+                    },
+                },
+                object! {
+                    id: "fred",
+                    friend: object! {
+                        id: "cow",
+                    },
+                },
+            ]
+        }
+    )
+}
+
+#[tokio::test]
+async fn nested_interface_fragments() {
+    let subgraph_id = "NestedInterfaceFragments";
+    let schema = "interface I1face { id: ID!, foo1: Foo! }
+                  interface I2face { id: ID!, foo2: Foo! }
+                  interface I3face { id: ID!, foo3: Foo! }
+                  type Foo @entity {
+                      id: ID!
+                  }
+                  type One implements I1face @entity {
+                    id: ID!
+                    foo1: Foo!
+                  }
+                  type Two implements I1face & I2face @entity {
+                    id: ID!
+                    foo1: Foo!
+                    foo2: Foo!
+                  }
+                  type Three implements I1face & I2face & I3face @entity {
+                    id: ID!
+                    foo1: Foo!
+                    foo2: Foo!
+                    foo3: Foo!
+                  }";
+
+    let query = "query {
+                    i1Faces {
+                        __typename
+                        foo1 {
+                            id
+                        }
+                        ...on I2face {
+                            foo2 {
+                                id
+                            }
+                        }
+                        ...on I3face {
+                            foo3 {
+                                id
+                            }
+                        }
+                    }
+            }";
+
+    let foo = (
+        "Foo",
+        entity!(
+            id: "foo",
+        ),
+    );
+    let one = (
+        "One",
+        entity!(
+            id: "1",
+            foo1: "foo",
+        ),
+    );
+    let two = (
+        "Two",
+        entity!(
+            id: "2",
+            foo1: "foo",
+            foo2: "foo",
+        ),
+    );
+    let three = (
+        "Three",
+        entity!(
+            id: "3",
+            foo1: "foo",
+            foo2: "foo",
+            foo3: "foo"
+        ),
+    );
+
+    let res = insert_and_query(subgraph_id, schema, vec![foo, one, two, three], query)
+        .await
+        .unwrap();
+
+    let data = extract_data!(res).unwrap();
+    assert_eq!(
+        data,
+        object! {
+            i1Faces: vec![
+                object! {
+                    __typename: "One",
+                    foo1: object! {
+                        id: "foo",
+                    },
+                },
+                object! {
+                    __typename: "Two",
+                    foo1: object! {
+                        id: "foo",
+                    },
+                    foo2: object! {
+                        id: "foo",
+                    },
+                },
+                object! {
+                    __typename: "Three",
+                    foo1: object! {
+                        id: "foo",
+                    },
+                    foo2: object! {
+                        id: "foo",
+                    },
+                    foo3: object! {
+                        id: "foo",
+                    },
+                },
+            ]
+        }
+    )
+}
+
+#[tokio::test]
+async fn nested_interface_fragments_overlapping() {
+    let subgraph_id = "NestedInterfaceFragmentsOverlapping";
+    let schema = "interface I1face { id: ID!, foo1: Foo! }
+                  interface I2face { id: ID!, foo1: Foo! }
+                  type Foo @entity {
+                      id: ID!
+                  }
+                  type One implements I1face @entity {
+                    id: ID!
+                    foo1: Foo!
+                  }
+                  type Two implements I1face & I2face @entity {
+                    id: ID!
+                    foo1: Foo!
+                  }";
+
+    let query = "query {
+                    i1Faces {
+                        __typename
+                        ...on I2face {
+                            foo1 {
+                                id
+                            }
+                        }
+                    }
+            }";
+
+    let foo = (
+        "Foo",
+        entity!(
+            id: "foo",
+        ),
+    );
+    let one = (
+        "One",
+        entity!(
+            id: "1",
+            foo1: "foo",
+        ),
+    );
+    let two = (
+        "Two",
+        entity!(
+            id: "2",
+            foo1: "foo",
+        ),
+    );
+    let res = insert_and_query(subgraph_id, schema, vec![foo, one, two], query)
+        .await
+        .unwrap();
+
+    let data = extract_data!(res).unwrap();
+    assert_eq!(
+        data,
+        object! {
+            i1Faces: vec![
+                object! {
+                    __typename: "One"
+                },
+                object! {
+                    __typename: "Two",
+                    foo1: object! {
+                        id: "foo",
+                    },
+                },
+            ]
+        }
+    );
+
+    let query = "query {
+        i1Faces {
+            __typename
+            foo1 {
+                id
+            }
+            ...on I2face {
+                foo1 {
+                    id
+                }
+            }
+        }
+    }";
+
+    let res = insert_and_query(subgraph_id, schema, vec![], query)
+        .await
+        .unwrap();
+    let data = extract_data!(res).unwrap();
+    assert_eq!(
+        data,
+        object! {
+            i1Faces: vec![
+                object! {
+                    __typename: "One",
+                    foo1: object! {
+                        id: "foo"
+                    }
+                },
+                object! {
+                    __typename: "Two",
+                    foo1: object! {
+                        id: "foo",
+                    },
+                },
+            ]
+        }
+    );
+}
+
+#[tokio::test]
+async fn enums() {
+    use r::Value::Enum;
+    let subgraph_id = "enums";
+    let schema = r#"
+       enum Direction {
+         NORTH
+         EAST
+         SOUTH
+         WEST
+       }
+
+       type Trajectory @entity {
+         id: ID!
+         direction: Direction!
+         meters: Int!
+       }"#;
+
+    let entities = vec![
+        (
+            "Trajectory",
+            Entity::from(vec![
+                ("id", Value::from("1")),
+                ("direction", Value::from("EAST")),
+                ("meters", Value::from(10)),
+            ]),
+        ),
+        (
+            "Trajectory",
+            Entity::from(vec![
+                ("id", Value::from("2")),
+                ("direction", Value::from("NORTH")),
+                ("meters", Value::from(15)),
+            ]),
+        ),
+    ];
+    let query = "query { trajectories { id, direction, meters } }";
+
+    let res = insert_and_query(subgraph_id, schema, entities, query)
+        .await
+        .unwrap();
+    let data = extract_data!(res).unwrap();
+    assert_eq!(
+        data,
+        object! {
+        trajectories: vec![
+            object!{
+        id: "1",
+        direction: Enum("EAST".to_string()),
+        meters: 10,
+        },
+            object!{
+                id: "2",
+        direction: Enum("NORTH".to_string()),
+        meters: 15,
+            },
+        ]}
+    );
+}
+
+#[tokio::test]
+async fn enum_list_filters() {
+    use r::Value::Enum;
+    let subgraph_id = "enum_list_filters";
+    let schema = r#"
+       enum Direction {
+         NORTH
+         EAST
+         SOUTH
+         WEST
+       }
+
+       type Trajectory @entity {
+         id: ID!
+         direction: Direction!
+         meters: Int!
+       }"#;
+
+    let entities = vec![
+        (
+            "Trajectory",
+            Entity::from(vec![
+                ("id", Value::from("1")),
+                ("direction", Value::from("EAST")),
+                ("meters", Value::from(10)),
+            ]),
+        ),
+        (
+            "Trajectory",
+            Entity::from(vec![
+                ("id", Value::from("2")),
+                ("direction", Value::from("NORTH")),
+                ("meters", Value::from(15)),
+            ]),
+        ),
+        (
+            "Trajectory",
+            Entity::from(vec![
+                ("id", Value::from("3")),
+                ("direction", Value::from("WEST")),
+                ("meters", Value::from(20)),
+            ]),
+        ),
+    ];
+
+    let query = "query { trajectories(where: { direction_in: [NORTH, EAST] }) { id, direction } }";
+    let res = insert_and_query(subgraph_id, schema, entities, query)
+        .await
+        .unwrap();
+    let data = extract_data!(res).unwrap();
+    assert_eq!(
+        data,
+        object! {
+        trajectories: vec![
+            object!{
+                id: "1",
+                direction: Enum("EAST".to_string()),
+            },
+            object!{
+                id: "2",
+                direction: Enum("NORTH".to_string()),
+            },
+        ]}
+    );
+
+    let query = "query { trajectories(where: { direction_not_in: [EAST] }) { id, direction } }";
+    let res = insert_and_query(subgraph_id, schema, vec![], query)
+        .await
+        .unwrap();
+    let data = extract_data!(res).unwrap();
+    assert_eq!(
+        data,
+        object! {
+        trajectories: vec![
+            object!{
+                id: "2",
+                direction: Enum("NORTH".to_string()),
+            },
+            object!{
+                id: "3",
+                direction: Enum("WEST".to_string()),
+            },
+        ]}
+    );
+}
+
+#[tokio::test]
+async fn recursive_fragment() {
+    // Depending on whether `ENABLE_GRAPHQL_VALIDATIONS` is set or not, we
+    // get different error messages
+    const FOO_ERRORS: [&str; 2] = [
+        "Cannot spread fragment \"FooFrag\" within itself.",
+        "query has fragment cycle including `FooFrag`",
+    ];
+    const FOO_BAR_ERRORS: [&str; 2] = [
+        "Cannot spread fragment \"BarFrag\" within itself via \"FooFrag\".",
+        "query has fragment cycle including `BarFrag`",
+    ];
+    let subgraph_id = "RecursiveFragment";
+    let schema = "
+        type Foo @entity {
+            id: ID!
+            foo: Foo!
+            bar: Bar!
+        }
+
+        type Bar @entity {
+            id: ID!
+            foo: Foo!
+        }
+    ";
+
+    let self_recursive = "
+        query {
+            foos {
+              ...FooFrag
+            }
+        }
+
+        fragment FooFrag on Foo {
+          id
+          foo {
+            ...FooFrag
+          }
+        }
+    ";
+    let res = insert_and_query(subgraph_id, schema, vec![], self_recursive)
+        .await
+        .unwrap();
+    let data = res.to_result().unwrap_err()[0].to_string();
+    assert!(FOO_ERRORS.contains(&data.as_str()));
+
+    let co_recursive = "
+        query {
+          foos {
+            ...BarFrag
+          }
+        }
+
+        fragment BarFrag on Bar {
+          id
+          foo {
+             ...FooFrag
+          }
+        }
+
+        fragment FooFrag on Foo {
+          id
+          bar {
+            ...BarFrag
+          }
+        }
+    ";
+    let res = insert_and_query(subgraph_id, schema, vec![], co_recursive)
+        .await
+        .unwrap();
+    let data = res.to_result().unwrap_err()[0].to_string();
+    assert!(FOO_BAR_ERRORS.contains(&data.as_str()));
+}
+
+#[tokio::test]
+async fn mixed_mutability() {
+    let subgraph_id = "MixedMutability";
+    let schema = "interface Event { id: String! }
+                  type Mutable implements Event @entity { id: String!, name: String! }
+                  type Immutable implements Event @entity(immutable: true) { id: String!, name: String! }";
+
+    let query = "query { events { id } }";
+
+    let entities = vec![
+        ("Mutable", entity! { id: "mut0", name: "mut0" }),
+        ("Immutable", entity! { id: "immo0", name: "immo0" }),
+    ];
+
+    {
+        // We need to remove the subgraph since it contains immutable
+        // entities, and the trick the other tests use does not work for
+        // this. They rely on the EntityCache filtering out entity changes
+        // that are already in the store
+        let id = DeploymentHash::new(subgraph_id).unwrap();
+        remove_subgraph(&id);
+    }
+    let res = insert_and_query(subgraph_id, schema, entities, query)
+        .await
+        .unwrap();
+
+    let data = extract_data!(res).unwrap();
+    let exp = object! { events: vec![ object!{ id: "immo0" }, object! { id: "mut0" } ] };
+    assert_eq!(data, exp);
+}
+
+#[tokio::test]
+async fn derived_interface_bytes() {
+    let subgraph_id = "DerivedInterfaceBytes";
+    let schema = r#" type Pool {
+        id: Bytes!,
+        trades: [Trade!]! @derivedFrom(field: "pool")
+      }
+      
+      interface Trade {
+       id: Bytes!
+       pool: Pool!
+      }
+      
+      type Sell implements Trade @entity {
+          id: Bytes!
+          pool: Pool!
+      }
+      type Buy implements Trade @entity {
+       id: Bytes!
+       pool: Pool!
+      }"#;
+
+    let query = "query { pools { trades { id } } }";
+
+    let entities = vec![
+        ("Pool", entity! { id: "0xf001" }),
+        ("Sell", entity! { id: "0xc0", pool: "0xf001"}),
+        ("Buy", entity! { id: "0xb0", pool: "0xf001"}),
+    ];
+
+    let res = insert_and_query(subgraph_id, schema, entities, query)
+        .await
+        .unwrap();
+
+    let data = extract_data!(res).unwrap();
+    let exp = object! { pools: vec![ object!{ trades: vec![ object! { id: "0xb0" }, object! { id: "0xc0" }] } ] };
+    assert_eq!(data, exp);
+}
diff --git a/docker/Dockerfile b/docker/Dockerfile
new file mode 100644
index 0000000..d15c8f4
--- /dev/null
+++ b/docker/Dockerfile
@@ -0,0 +1,101 @@
+# Full build with debuginfo for graph-node
+#
+# The expectation if that the docker build uses the parent directory as PWD
+# by running something like the following
+#   docker build --target STAGE -f docker/Dockerfile .
+
+FROM golang:buster as envsubst
+
+# v1.2.0
+ARG ENVSUBST_COMMIT_SHA=16035fe3571ad42c7796bf554f978bb2df64231b
+
+RUN go install github.com/a8m/envsubst/cmd/envsubst@$ENVSUBST_COMMIT_SHA \
+    && strip -g /go/bin/envsubst
+
+FROM rust:buster as graph-node-build
+
+ARG COMMIT_SHA=unknown
+ARG REPO_NAME=unknown
+ARG BRANCH_NAME=unknown
+ARG TAG_NAME=unknown
+
+ADD . /graph-node
+
+RUN cd /graph-node \
+    && apt-get update && apt-get install -y cmake \
+    && rustup component add rustfmt \
+    && RUSTFLAGS="-g" cargo install --locked --path node \
+    && cargo clean \
+    && objcopy --only-keep-debug /usr/local/cargo/bin/graph-node /usr/local/cargo/bin/graph-node.debug \
+    && strip -g /usr/local/cargo/bin/graph-node \
+    && strip -g /usr/local/cargo/bin/graphman \
+    && cd /usr/local/cargo/bin \
+    && objcopy --add-gnu-debuglink=graph-node.debug graph-node \
+    && echo "REPO_NAME='$REPO_NAME'" > /etc/image-info \
+    && echo "TAG_NAME='$TAG_NAME'" >> /etc/image-info \
+    && echo "BRANCH_NAME='$BRANCH_NAME'" >> /etc/image-info \
+    && echo "COMMIT_SHA='$COMMIT_SHA'" >> /etc/image-info \
+    && echo "CARGO_VERSION='$(cargo --version)'" >> /etc/image-info \
+    && echo "RUST_VERSION='$(rustc --version)'" >> /etc/image-info
+
+# Debug image to access core dumps
+FROM graph-node-build as graph-node-debug
+RUN apt-get update \
+    && apt-get install -y curl gdb postgresql-client
+
+COPY docker/Dockerfile /Dockerfile
+COPY docker/bin/* /usr/local/bin/
+
+# The graph-node runtime image with only the executable
+FROM debian:buster-slim as graph-node
+ENV RUST_LOG ""
+ENV GRAPH_LOG ""
+ENV EARLY_LOG_CHUNK_SIZE ""
+ENV ETHEREUM_RPC_PARALLEL_REQUESTS ""
+ENV ETHEREUM_BLOCK_CHUNK_SIZE ""
+
+ENV postgres_host ""
+ENV postgres_user ""
+ENV postgres_pass ""
+ENV postgres_db ""
+# The full URL to the IPFS node
+ENV ipfs ""
+# The etherum network(s) to connect to. Set this to a space-separated
+# list of the networks where each entry has the form NAME:URL
+ENV ethereum ""
+# The role the node should have, one of index-node, query-node, or
+# combined-node
+ENV node_role "combined-node"
+# The name of this node
+ENV node_id "default"
+# The ethereum network polling interval  (in milliseconds)
+ENV ethereum_polling_interval ""
+
+# The location of an optional configuration file for graph-node, as
+# described in ../docs/config.md
+# Using a configuration file is experimental, and the file format may
+# change in backwards-incompatible ways
+ENV GRAPH_NODE_CONFIG ""
+
+# Disable core dumps; this is useful for query nodes with large caches. Set
+# this to anything to disable coredumps (via 'ulimit -c 0')
+ENV disable_core_dumps ""
+
+# HTTP port
+EXPOSE 8000
+# WebSocket port
+EXPOSE 8001
+# JSON-RPC port
+EXPOSE 8020
+# Indexing status port
+EXPOSE 8030
+
+RUN apt-get update \
+    && apt-get install -y libpq-dev ca-certificates netcat
+
+ADD docker/wait_for docker/start /usr/local/bin/
+COPY --from=graph-node-build /usr/local/cargo/bin/graph-node /usr/local/cargo/bin/graphman /usr/local/bin/
+COPY --from=graph-node-build /etc/image-info /etc/image-info
+COPY --from=envsubst /go/bin/envsubst /usr/local/bin/
+COPY docker/Dockerfile /Dockerfile
+CMD start
diff --git a/docker/README.md b/docker/README.md
new file mode 100644
index 0000000..743a612
--- /dev/null
+++ b/docker/README.md
@@ -0,0 +1,96 @@
+# Graph Node Docker Image
+
+Preconfigured Docker image for running a Graph Node.
+
+## Usage
+
+```sh
+docker run -it \
+  -e postgres_host=<HOST> \
+  -e postgres_port=<PORT> \
+  -e postgres_user=<USER> \
+  -e postgres_pass=<PASSWORD> \
+  -e postgres_db=<DBNAME> \
+  -e ipfs=<HOST>:<PORT> \
+  -e ethereum=<NETWORK_NAME>:<ETHEREUM_RPC_URL> \
+  graphprotocol/graph-node:latest
+```
+
+### Example usage
+
+```sh
+docker run -it \
+  -e postgres_host=host.docker.internal \
+  -e postgres_port=5432 \
+  -e postgres_user=graph-node \
+  -e postgres_pass=oh-hello \
+  -e postgres_db=graph-node \
+  -e ipfs=host.docker.internal:5001 \
+  -e ethereum=mainnet:http://localhost:8545/ \
+  graphprotocol/graph-node:latest
+```
+
+## Docker Compose
+
+The Docker Compose setup requires an Ethereum network name and node
+to connect to. By default, it will use `mainnet:http://host.docker.internal:8545`
+in order to connect to an Ethereum node running on your host machine.
+You can replace this with anything else in `docker-compose.yaml`.
+
+> **Note for Linux users:** On Linux, `host.docker.internal` is not
+> currently supported. Instead, you will have to replace it with the
+> IP address of your Docker host (from the perspective of the Graph
+> Node container).
+> To do this, run:
+>
+> ```
+> CONTAINER_ID=$(docker container ls | grep graph-node | cut -d' ' -f1)
+> docker exec $CONTAINER_ID /bin/bash -c 'apt install -y iproute2 && ip route' | awk '/^default via /{print $3}'
+> ```
+>
+> This will print the host's IP address. Then, put it into `docker-compose.yml`:
+>
+> ```
+> sed -i -e 's/host.docker.internal/<IP ADDRESS>/g' docker-compose.yml
+> ```
+
+After you have set up an Ethereum node—e.g. Ganache or Parity—simply
+clone this repository and run
+
+```sh
+docker-compose up
+```
+
+This will start IPFS, Postgres and Graph Node in Docker and create persistent
+data directories for IPFS and Postgres in `./data/ipfs` and `./data/postgres`. You
+can access these via:
+
+- Graph Node:
+  - GraphiQL: `http://localhost:8000/`
+  - HTTP: `http://localhost:8000/subgraphs/name/<subgraph-name>`
+  - WebSockets: `ws://localhost:8001/subgraphs/name/<subgraph-name>`
+  - Admin: `http://localhost:8020/`
+- IPFS:
+  - `127.0.0.1:5001` or `/ip4/127.0.0.1/tcp/5001`
+- Postgres:
+  - `postgresql://graph-node:let-me-in@localhost:5432/graph-node`
+
+Once this is up and running, you can use
+[`graph-cli`](https://github.com/graphprotocol/graph-cli) to create and
+deploy your subgraph to the running Graph Node.
+  
+### Running Graph Node on an Macbook M1
+  
+We do not currently build native images for Macbook M1, which can lead to processes being killed due to out-of-memory errors (code 137). Based on the example `docker-compose.yml` is possible to rebuild the image for your M1 by running the following, then running `docker-compose up` as normal:
+ 
+> **Important** Increase memory limits for the docker engine running on your machine. Otherwise docker build command will fail due to out of memory error. To do that, open docker-desktop and go to Resources/advanced/memory.
+```
+# Remove the original image
+docker rmi graphprotocol/graph-node:latest
+
+# Build the image
+./docker/build.sh
+
+# Tag the newly created image
+docker tag graph-node graphprotocol/graph-node:latest
+```
diff --git a/docker/bin/create b/docker/bin/create
new file mode 100755
index 0000000..9d9a4eb
--- /dev/null
+++ b/docker/bin/create
@@ -0,0 +1,11 @@
+#! /bin/bash
+
+if [ $# != 1 ]; then
+    echo "usage: create <name>"
+    exit 1
+fi
+
+api="http://index-node.default/"
+
+data=$(printf '{"jsonrpc": "2.0", "method": "subgraph_create", "params": {"name":"%s"}, "id":"1"}' "$1")
+curl -s -H "content-type: application/json" --data "$data" "$api"
diff --git a/docker/bin/debug b/docker/bin/debug
new file mode 100755
index 0000000..87649f1
--- /dev/null
+++ b/docker/bin/debug
@@ -0,0 +1,9 @@
+#! /bin/bash
+
+if [ -f "$1" ]
+then
+    exec rust-gdb -c "$1" /usr/local/cargo/bin/graph-node
+else
+    echo "usage: debug <core-file>"
+    exit 1
+fi
diff --git a/docker/bin/deploy b/docker/bin/deploy
new file mode 100755
index 0000000..f0c9833
--- /dev/null
+++ b/docker/bin/deploy
@@ -0,0 +1,12 @@
+#! /bin/bash
+
+if [ $# != 3 ]; then
+    echo "usage: deploy <name> <ipfs_hash> <node>"
+    exit 1
+fi
+
+api="http://index-node.default/"
+
+echo "Deploying $1 (deployment $2)"
+data=$(printf '{"jsonrpc": "2.0", "method": "subgraph_deploy", "params": {"name":"%s", "ipfs_hash":"%s", "node_id":"%s"}, "id":"1"}' "$1" "$2" "$3")
+curl -s -H "content-type: application/json" --data "$data" "$api"
diff --git a/docker/bin/reassign b/docker/bin/reassign
new file mode 100755
index 0000000..a8eb703
--- /dev/null
+++ b/docker/bin/reassign
@@ -0,0 +1,12 @@
+#! /bin/bash
+
+if [ $# -lt 3 ]; then
+    echo "usage: reassign <name> <ipfs_hash> <node>"
+    exit 1
+fi
+
+api="http://index-node.default/"
+
+echo Assigning to "$3"
+data=$(printf '{"jsonrpc": "2.0", "method": "subgraph_reassign", "params": {"name":"%s", "ipfs_hash":"%s", "node_id":"%s"}, "id":"1"}' "$1" "$2" "$3")
+curl -s -H "content-type: application/json" --data "$data" "$api"
diff --git a/docker/bin/remove b/docker/bin/remove
new file mode 100755
index 0000000..872fc33
--- /dev/null
+++ b/docker/bin/remove
@@ -0,0 +1,11 @@
+#! /bin/bash
+
+if [ $# != 1 ]; then
+    echo "usage: remove <name>"
+    exit 1
+fi
+
+api="http://index-node.default/"
+
+data=$(printf '{"jsonrpc": "2.0", "method": "subgraph_remove", "params": {"name":"%s"}, "id":"1"}' "$1")
+curl -s -H "content-type: application/json" --data "$data" "$api"
diff --git a/docker/build.sh b/docker/build.sh
new file mode 100755
index 0000000..5dd67ea
--- /dev/null
+++ b/docker/build.sh
@@ -0,0 +1,26 @@
+#! /bin/bash
+
+# This file is only here to ease testing/development. Official images are
+# built using the 'cloudbuild.yaml' file
+
+type -p podman > /dev/null && docker=podman || docker=docker
+
+cd $(dirname $0)/..
+
+if [ -d .git ]
+then
+    COMMIT_SHA=$(git rev-parse HEAD)
+    TAG_NAME=$(git tag --points-at HEAD)
+    REPO_NAME="Checkout of $(git remote get-url origin) at $(git describe --dirty)"
+    BRANCH_NAME=$(git rev-parse --abbrev-ref HEAD)
+fi
+for stage in graph-node-build graph-node graph-node-debug
+do
+    $docker build --target $stage \
+            --build-arg "COMMIT_SHA=$COMMIT_SHA" \
+            --build-arg "REPO_NAME=$REPO_NAME" \
+            --build-arg "BRANCH_NAME=$BRANCH_NAME" \
+            --build-arg "TAG_NAME=$TAG_NAME" \
+            -t $stage \
+            -f docker/Dockerfile .
+done
diff --git a/docker/cloudbuild.yaml b/docker/cloudbuild.yaml
new file mode 100644
index 0000000..39cf285
--- /dev/null
+++ b/docker/cloudbuild.yaml
@@ -0,0 +1,53 @@
+options:
+  machineType: "N1_HIGHCPU_32"
+timeout: 1800s
+steps:
+- name: 'gcr.io/cloud-builders/docker'
+  args: ['build', '--target', 'graph-node-build',
+         '--build-arg', 'COMMIT_SHA=$COMMIT_SHA',
+         '--build-arg', 'REPO_NAME=$REPO_NAME',
+         '--build-arg', 'BRANCH_NAME=$BRANCH_NAME',
+         '--build-arg', 'TAG_NAME=$TAG_NAME',
+         '-t', 'gcr.io/$PROJECT_ID/graph-node-build:$SHORT_SHA',
+         '-f', 'docker/Dockerfile', '.']
+- name: 'gcr.io/cloud-builders/docker'
+  args: ['build', '--target', 'graph-node',
+         '--build-arg', 'COMMIT_SHA=$COMMIT_SHA',
+         '--build-arg', 'REPO_NAME=$REPO_NAME',
+         '--build-arg', 'BRANCH_NAME=$BRANCH_NAME',
+         '--build-arg', 'TAG_NAME=$TAG_NAME',
+         '-t', 'gcr.io/$PROJECT_ID/graph-node:$SHORT_SHA',
+         '-f', 'docker/Dockerfile', '.']
+- name: 'gcr.io/cloud-builders/docker'
+  args: ['build', '--target', 'graph-node-debug',
+         '--build-arg', 'COMMIT_SHA=$COMMIT_SHA',
+         '--build-arg', 'REPO_NAME=$REPO_NAME',
+         '--build-arg', 'BRANCH_NAME=$BRANCH_NAME',
+         '--build-arg', 'TAG_NAME=$TAG_NAME',
+         '-t', 'gcr.io/$PROJECT_ID/graph-node-debug:$SHORT_SHA',
+         '-f', 'docker/Dockerfile', '.']
+- name: 'gcr.io/cloud-builders/docker'
+  args: ['tag',
+         'gcr.io/$PROJECT_ID/graph-node:$SHORT_SHA',
+         'lutter/graph-node:$SHORT_SHA']
+- name: 'gcr.io/cloud-builders/docker'
+  entrypoint: 'bash'
+  args: ['docker/tag.sh']
+  secretEnv: ['PASSWORD']
+  env:
+    - 'SHORT_SHA=$SHORT_SHA'
+    - 'TAG_NAME=$TAG_NAME'
+    - 'PROJECT_ID=$PROJECT_ID'
+    - 'DOCKER_HUB_USER=$_DOCKER_HUB_USER'
+    - 'BRANCH_NAME=$BRANCH_NAME'
+images:
+  - 'gcr.io/$PROJECT_ID/graph-node-build:$SHORT_SHA'
+  - 'gcr.io/$PROJECT_ID/graph-node:$SHORT_SHA'
+  - 'gcr.io/$PROJECT_ID/graph-node-debug:$SHORT_SHA'
+substitutions:
+  # The owner of the access token whose encrypted value is in PASSWORD
+  _DOCKER_HUB_USER: "lutter"
+secrets:
+ - kmsKeyName: projects/the-graph-staging/locations/global/keyRings/docker/cryptoKeys/docker-hub-push
+   secretEnv:
+     PASSWORD: 'CiQAdfFldbmUiHgGP1lPq6bAOfd+VQ/dFwyohB1IQwiwQg03ZE8STQDvWKpv6eJHVUN1YoFC5FcooJrH+Stvx9oMD7jBjgxEH5ngIiAysWP3E4Pgxt/73xnaanbM1EQ94eVFKCiY0GaEKFNu0BJx22vCYmU4'
diff --git a/docker/docker-compose.yml b/docker/docker-compose.yml
new file mode 100644
index 0000000..60c188b
--- /dev/null
+++ b/docker/docker-compose.yml
@@ -0,0 +1,45 @@
+version: '3'
+services:
+  graph-node:
+    image: graphprotocol/graph-node
+    ports:
+      - '8000:8000'
+      - '8001:8001'
+      - '8020:8020'
+      - '8030:8030'
+      - '8040:8040'
+    depends_on:
+      - ipfs
+      - postgres
+    extra_hosts:
+      - host.docker.internal:host-gateway
+    environment:
+      postgres_host: postgres
+      postgres_user: graph-node
+      postgres_pass: let-me-in
+      postgres_db: graph-node
+      ipfs: 'ipfs:5001'
+      ethereum: 'mainnet:http://host.docker.internal:8545'
+      GRAPH_LOG: info
+  ipfs:
+    image: ipfs/go-ipfs:v0.10.0
+    ports:
+      - '5001:5001'
+    volumes:
+      - ./data/ipfs:/data/ipfs
+  postgres:
+    image: postgres
+    ports:
+      - '5432:5432'
+    command:
+      [
+        "postgres",
+        "-cshared_preload_libraries=pg_stat_statements"
+      ]
+    environment:
+      POSTGRES_USER: graph-node
+      POSTGRES_PASSWORD: let-me-in
+      POSTGRES_DB: graph-node
+      PGDATA: "/data/postgres"
+    volumes:
+      - ./data/postgres:/var/lib/postgresql/data
diff --git a/docker/hooks/post_checkout b/docker/hooks/post_checkout
new file mode 100755
index 0000000..f1b6f18
--- /dev/null
+++ b/docker/hooks/post_checkout
@@ -0,0 +1,8 @@
+#!/bin/bash
+
+set -e
+set -x
+
+echo "Setting SOURCE_BRANCH to ${SOURCE_BRANCH}"
+
+sed -i "s@^ENV SOURCE_BRANCH \"master\"@ENV SOURCE_BRANCH \"${SOURCE_BRANCH}\"@g" Dockerfile
diff --git a/docker/setup.sh b/docker/setup.sh
new file mode 100755
index 0000000..5823ad0
--- /dev/null
+++ b/docker/setup.sh
@@ -0,0 +1,42 @@
+#!/usr/bin/env bash
+
+set -e
+
+if ! which docker 2>&1 > /dev/null; then
+    echo "Please install 'docker' first"
+    exit 1
+fi
+
+if ! which docker-compose 2>&1 > /dev/null; then
+    echo "Please install 'docker-compose' first"
+    exit 1
+fi
+
+if ! which jq 2>&1 > /dev/null; then
+    echo "Please install 'jq' first"
+    exit 1
+fi
+
+# Create the graph-node container
+docker-compose up --no-start graph-node
+
+# Start graph-node so we can inspect it
+docker-compose start graph-node
+
+# Identify the container ID
+CONTAINER_ID=$(docker container ls | grep graph-node | cut -d' ' -f1)
+
+# Inspect the container to identify the host IP address
+HOST_IP=$(docker inspect "$CONTAINER_ID" | jq -r .[0].NetworkSettings.Networks[].Gateway)
+
+echo "Host IP: $HOST_IP"
+
+# Inject the host IP into docker-compose.yml
+sed -i -e "s/host.docker.internal/$HOST_IP/g" docker-compose.yml
+
+function stop_graph_node {
+    # Ensure graph-node is stopped
+    docker-compose stop graph-node
+}
+
+trap stop_graph_node EXIT
diff --git a/docker/start b/docker/start
new file mode 100755
index 0000000..435fbe5
--- /dev/null
+++ b/docker/start
@@ -0,0 +1,140 @@
+#!/bin/bash
+
+save_coredumps() {
+    graph_dir=/var/lib/graph
+    datestamp=$(date +"%Y-%m-%dT%H:%M:%S")
+    ls /core.* >& /dev/null && have_cores=yes || have_cores=no
+    if [ -d "$graph_dir" -a "$have_cores" = yes ]
+    then
+        core_dir=$graph_dir/cores
+        mkdir -p $core_dir
+        exec >> "$core_dir"/messages 2>&1
+        echo "${HOSTNAME##*-} Saving core dump on ${HOSTNAME} at ${datestamp}"
+
+        dst="$core_dir/$datestamp-${HOSTNAME}"
+        mkdir "$dst"
+        cp /usr/local/bin/graph-node "$dst"
+        cp /proc/loadavg "$dst"
+        [ -f /Dockerfile ] && cp /Dockerfile "$dst"
+        tar czf "$dst/etc.tgz" /etc/
+        dmesg -e > "$dst/dmesg"
+        # Capture environment variables, but filter out passwords
+        env | sort | sed -r -e 's/^(postgres_pass|ELASTICSEARCH_PASSWORD)=.*$/\1=REDACTED/' > "$dst/env"
+
+        for f in /core.*
+        do
+            echo "${HOSTNAME##*-} Found core dump $f"
+            mv "$f" "$dst"
+        done
+        echo "${HOSTNAME##*-} Saving done"
+    fi
+}
+
+wait_for_ipfs() {
+    # Take the IPFS URL in $1 apart and extract host and port. If no explicit
+    # host is given, use 443 for https, and 80 otherwise
+    if [[ "$1" =~ ^((https?)://)?([^:/]+)(:([0-9]+))? ]]
+    then
+        proto=${BASH_REMATCH[2]:-http}
+        host=${BASH_REMATCH[3]}
+        port=${BASH_REMATCH[5]}
+        if [ -z "$port" ]
+        then
+            [ "$proto" = "https" ] && port=443 || port=80
+        fi
+        wait_for "$host:$port" -t 120
+    else
+        echo "invalid IPFS URL: $1"
+        exit 1
+    fi
+}
+
+run_graph_node() {
+    if [ -n "$GRAPH_NODE_CONFIG" ]
+    then
+        # Start with a configuration file; we don't do a check whether
+        # postgres is up in this case, though we probably should
+        wait_for_ipfs "$ipfs"
+        sleep 5
+        exec graph-node \
+            --node-id "$node_id" \
+            --config "$GRAPH_NODE_CONFIG" \
+            --ipfs "$ipfs" \
+            ${fork_base:+ --fork-base "$fork_base"}
+    else
+        unset GRAPH_NODE_CONFIG
+        postgres_port=${postgres_port:-5432}
+        postgres_url="postgresql://$postgres_user:$postgres_pass@$postgres_host:$postgres_port/$postgres_db?sslmode=prefer"
+
+        wait_for_ipfs "$ipfs"
+        wait_for "$postgres_host:$postgres_port" -t 120
+        sleep 5
+
+        exec graph-node \
+            --node-id "$node_id" \
+            --postgres-url "$postgres_url" \
+            --ethereum-rpc $ethereum \
+            --ipfs "$ipfs" \
+            ${fork_base:+ --fork-base "$fork_base"}
+    fi
+}
+
+start_query_node() {
+    # Query nodes are never the block ingestor
+    export DISABLE_BLOCK_INGESTOR=true
+    run_graph_node
+}
+
+start_index_node() {
+    run_graph_node
+}
+
+start_combined_node() {
+    run_graph_node
+}
+
+# Only the index node with the name set in BLOCK_INGESTOR should ingest
+# blocks. For historical reasons, that name is set to the unmangled version
+# of `node_id` and we need to check whether we are the block ingestor
+# before possibly mangling the node_id.
+if [[ ${node_id} != "${BLOCK_INGESTOR}" ]]; then
+    export DISABLE_BLOCK_INGESTOR=true
+fi
+
+# Allow operators to opt out of legacy character
+# restrictions on the node ID by setting enablement
+# variable to a non-zero length string:
+if [ -z "$GRAPH_NODE_ID_USE_LITERAL_VALUE" ]
+then
+	node_id="${node_id//-/_}"
+fi
+
+if [ -n "$disable_core_dumps" ]
+then
+    ulimit -c 0
+fi
+
+trap save_coredumps EXIT
+
+export PGAPPNAME="${node_id:-$HOSTNAME}"
+
+# Set custom poll interval
+if [ -n "$ethereum_polling_interval" ]; then
+    export ETHEREUM_POLLING_INTERVAL=$ethereum_polling_interval
+fi
+
+case "${node_role:-combined-node}" in
+    query-node)
+        start_query_node
+        ;;
+    index-node)
+        start_index_node
+        ;;
+    combined-node)
+        start_combined_node
+        ;;
+    *)
+        echo "Unknown mode for start-node: $1"
+        echo "usage: start (combined-node|query-node|index-node)"
+        exit 1
+esac
diff --git a/docker/tag.sh b/docker/tag.sh
new file mode 100644
index 0000000..032ab54
--- /dev/null
+++ b/docker/tag.sh
@@ -0,0 +1,28 @@
+#! /bin/bash
+
+# This script is used by cloud build to push Docker images into Docker hub
+
+tag_and_push() {
+    tag=$1
+    docker tag gcr.io/$PROJECT_ID/graph-node:$SHORT_SHA \
+           graphprotocol/graph-node:$tag
+    docker push graphprotocol/graph-node:$tag
+
+    docker tag gcr.io/$PROJECT_ID/graph-node-debug:$SHORT_SHA \
+           graphprotocol/graph-node-debug:$tag
+    docker push graphprotocol/graph-node-debug:$tag
+}
+
+echo "Logging into Docker Hub"
+echo $PASSWORD | docker login --username="$DOCKER_HUB_USER" --password-stdin
+
+set -ex
+
+tag_and_push "$SHORT_SHA"
+
+# Builds of tags set the tag in Docker Hub, too
+[ -n "$TAG_NAME" ] && tag_and_push "$TAG_NAME"
+# Builds for tags vN.N.N become the 'latest'
+[[ "$TAG_NAME" =~ ^v[0-9]+\.[0-9]+\.[0-9]+$ ]] && tag_and_push latest
+
+exit 0
diff --git a/docker/wait_for b/docker/wait_for
new file mode 100755
index 0000000..eb0865d
--- /dev/null
+++ b/docker/wait_for
@@ -0,0 +1,83 @@
+#!/bin/sh
+
+# POSIX compatible clone of wait-for-it.sh
+# This copy is from https://github.com/eficode/wait-for/commits/master
+# at commit 8d9b4446
+
+TIMEOUT=15
+QUIET=0
+
+echoerr() {
+  if [ "$QUIET" -ne 1 ]; then printf "%s\n" "$*" 1>&2; fi
+}
+
+usage() {
+  exitcode="$1"
+  cat << USAGE >&2
+Usage:
+  $cmdname host:port [-t timeout] [-- command args]
+  -q | --quiet                        Do not output any status messages
+  -t TIMEOUT | --timeout=timeout      Timeout in seconds, zero for no timeout
+  -- COMMAND ARGS                     Execute command with args after the test finishes
+USAGE
+  exit "$exitcode"
+}
+
+wait_for() {
+  for i in `seq $TIMEOUT` ; do
+    nc -z "$HOST" "$PORT" > /dev/null 2>&1
+
+    result=$?
+    if [ $result -eq 0 ] ; then
+      if [ $# -gt 0 ] ; then
+        exec "$@"
+      fi
+      exit 0
+    fi
+    sleep 1
+  done
+  echo "Operation timed out" >&2
+  exit 1
+}
+
+while [ $# -gt 0 ]
+do
+  case "$1" in
+    *:* )
+    HOST=$(printf "%s\n" "$1"| cut -d : -f 1)
+    PORT=$(printf "%s\n" "$1"| cut -d : -f 2)
+    shift 1
+    ;;
+    -q | --quiet)
+    QUIET=1
+    shift 1
+    ;;
+    -t)
+    TIMEOUT="$2"
+    if [ "$TIMEOUT" = "" ]; then break; fi
+    shift 2
+    ;;
+    --timeout=*)
+    TIMEOUT="${1#*=}"
+    shift 1
+    ;;
+    --)
+    shift
+    break
+    ;;
+    --help)
+    usage 0
+    ;;
+    *)
+    echoerr "Unknown argument: $1"
+    usage 1
+    ;;
+  esac
+done
+
+if [ "$HOST" = "" -o "$PORT" = "" ]; then
+  echoerr "Error: you need to provide a host and port to test."
+  usage 2
+fi
+
+wait_for "$@"
diff --git a/docs/adding-a-new-api-version.md b/docs/adding-a-new-api-version.md
new file mode 100644
index 0000000..1a7b495
--- /dev/null
+++ b/docs/adding-a-new-api-version.md
@@ -0,0 +1,37 @@
+# Adding a new `apiVersion`
+
+This document explains how to coordinate an `apiVersion` upgrade
+across all impacted projects:
+
+1.  [`graph-node`](https:github.com/graphprotocol/graph-node)
+2.  [`graph-ts`](https:github.com/graphprotocol/graph-ts)
+3.  [`graph-cli`](https:github.com/graphprotocol/graph-cli)
+4.  `graph-docs`
+
+## Steps
+
+Those steps should be taken after all relevant `graph-node` changes
+have been rolled out to production (hosted-service):
+
+1. Update the default value of the `GRAPH_MAX_API_VERSION` environment
+   variable, currently located at this file: `graph/src/data/subgraph/mod.rs`.
+   If you're setting it up somewhere manually, you should change there
+   as well, or just remove it.
+
+2.  Update `graph-node` minor version and create a new release.
+
+3.  Update `graph-ts` version and create a new release.
+
+4.  For `graph-cli`:
+
+    1.  Write migrations for the new `apiVersion`.
+    2.  Update the version restriction on the `build` and `deploy`
+        commands to match the new `graph-ts` and `apiVersion` versions.
+    3.  Update the `graph-cli` version in `package.json`.
+    4.  Update `graph-ts` and `graph-cli` version numbers on scaffolded code and examples.
+    5.  Recompile all the examples by running `=$ npm install` inside
+        each example directory.
+    6.  Update `graph-cli`\'s version and create a new release.
+    7.  Release in NPM
+
+5.  Update `graph-docs` with the new `apiVersion` content.
diff --git a/docs/config.md b/docs/config.md
new file mode 100644
index 0000000..8020334
--- /dev/null
+++ b/docs/config.md
@@ -0,0 +1,279 @@
+# Advanced Graph Node configuration
+
+A TOML configuration file can be used to set more complex configurations than those exposed in the
+CLI. The location of the file is passed with the `--config` command line switch. When using a
+configuration file, it is not possible to use the options `--postgres-url`,
+`--postgres-secondary-hosts`, and `--postgres-host-weights`.
+
+The TOML file consists of four sections:
+* `[chains]` sets the endpoints to blockchain clients.
+* `[store]` describes the available databases.
+* `[ingestor]` sets the name of the node responsible for block ingestion.
+* `[deployment]` describes how to place newly deployed subgraphs.
+
+Some of these sections support environment variable expansion out of the box,
+most notably Postgres connection strings. The official `graph-node` Docker image
+includes [`envsubst`](https://github.com/a8m/envsubst) for more complex use
+cases.
+
+## Configuring Multiple Databases
+
+For most use cases, a single Postgres database is sufficient to support a
+`graph-node` instance. When a `graph-node` instance outgrows a single
+Postgres database, it is possible to split the storage of `graph-node`'s
+data across multiple Postgres databases. All databases together form the
+store of the `graph-node` instance. Each individual database is called a
+_shard_.
+
+The `[store]` section must always have a primary shard configured, which
+must be called `primary`. Each shard can have additional read replicas that
+are used for responding to queries. Only queries are processed by read
+replicas. Indexing and block ingestion will always use the main database.
+
+Any number of additional shards, with their own read replicas, can also be
+configured. When read replicas are used, query traffic is split between the
+main database and the replicas according to their weights. In the example
+below, for the primary shard, no queries will be sent to the main database,
+and the replicas will receive 50% of the traffic each. In the `vip` shard,
+50% of the traffic goes to the main database, and 50% to the replica.
+
+```toml
+[store]
+[store.primary]
+connection = "postgresql://graph:${PGPASSWORD}@primary/graph"
+weight = 0
+pool_size = 10
+[store.primary.replicas.repl1]
+connection = "postgresql://graph:${PGPASSWORD}@primary-repl1/graph"
+weight = 1
+[store.primary.replicas.repl2]
+connection = "postgresql://graph:${PGPASSWORD}@primary-repl2/graph"
+weight = 1
+
+[store.vip]
+connection = "postgresql://graph:${PGPASSWORD}@${VIP_MAIN}/graph"
+weight = 1
+pool_size = 10
+[store.vip.replicas.repl1]
+connection = "postgresql://graph:${PGPASSWORD}@${VIP_REPL1}/graph"
+weight = 1
+```
+
+The `connection` string must be a valid [libpq connection
+string](https://www.postgresql.org/docs/current/libpq-connect.html#LIBPQ-CONNSTRING). Before
+passing the connection string to Postgres, environment variables embedded
+in the string are expanded.
+
+### Setting the `pool_size`
+
+Each shard must indicate how many database connections each `graph-node`
+instance should keep in its connection pool for that database. For
+replicas, the pool size defaults to the pool size of the main database, but
+can also be set explicitly. Such a setting replaces the setting from the
+main database.
+
+The `pool_size` can either be a number like in the example above, in which
+case any `graph-node` instance will use a connection pool of that size, or a set
+of rules that uses different sizes for different `graph-node` instances,
+keyed off the `node_id` set on the command line. When using rules, the
+`pool_size` is set like this:
+
+```toml
+pool_size = [
+  { node = "index_node_general_.*", size = 20 },
+  { node = "index_node_special_.*", size = 30 },
+  { node = "query_node_.*", size = 80 }
+]
+```
+
+Each rule consists of a regular expression `node` and the size that should
+be used if the current instance's `node_id` matches that regular
+expression. You can use the command `graphman config pools` to check how
+many connections each `graph-node` instance will use, and how many database
+connections will be opened by all `graph-node` instance. The rules are
+checked in the order in which they are written, and the first one that
+matches is used. It is an error if no rule matches.
+
+It is highly recommended to run `graphman config pools $all_nodes` every
+time the configuration is changed to make sure that the connection pools
+are what is expected. Here, `$all_nodes` should be a list of all the node
+names that will use this configuration file.
+
+## Configuring Ethereum Providers
+
+The `[chains]` section controls the ethereum providers that `graph-node`
+connects to, and where blocks and other metadata for each chain are
+stored. The section consists of the name of the node doing block ingestion
+(currently not used), and a list of chains. The configuration for a chain
+`name` is specified in the section `[chains.<name>]`, and consists of the
+`shard` where chain data is stored and a list of providers for that
+chain. For each provider, the following information must be given:
+
+* `label`: a label that is used when logging information about that
+  provider (not implemented yet)
+* `transport`: one of `rpc`, `ws`, and `ipc`. Defaults to `rpc`.
+* `url`: the URL for the provider
+* `features`: an array of features that the provider supports, either empty
+  or any combination of `traces` and `archive`
+* `headers`: HTTP headers to be added on every request. Defaults to none.
+* `limit`: the maximum number of subgraphs that can use this provider.
+  Defaults to unlimited. At least one provider should be unlimited,
+  otherwise `graph-node` might not be able to handle all subgraphs. The
+  tracking for this is approximate, and a small amount of deviation from
+  this value should be expected. The deviation will be less than 10.
+
+The following example configures two chains, `mainnet` and `kovan`, where
+blocks for `mainnet` are stored in the `vip` shard and blocks for `kovan`
+are stored in the primary shard. The `mainnet` chain can use two different
+providers, whereas `kovan` only has one provider.
+
+```toml
+[chains]
+ingestor = "block_ingestor_node"
+[chains.mainnet]
+shard = "vip"
+provider = [
+  { label = "mainnet1", url = "http://..", features = [], headers = { Authorization = "Bearer foo" } },
+  { label = "mainnet2", url = "http://..", features = [ "archive", "traces" ] }
+]
+[chains.kovan]
+shard = "primary"
+provider = [ { label = "kovan", url = "http://..", features = [] } ]
+```
+
+### Controlling the number of subgraphs using a provider
+
+**This feature is experimental and might be removed in a future release**
+
+Each provider can set a limit for the number of subgraphs that can use this
+provider. The measurement of the number of subgraphs using a provider is
+approximate and can differ from the true number by a small amount
+(generally less than 10)
+
+The limit is set through rules that match on the node name. If a node's
+name does not match any rule, the corresponding provider can be used for an
+unlimited number of subgraphs. It is recommended that at least one provider
+is generally unlimited. The limit is set in the following way:
+
+```toml
+[chains.mainnet]
+shard = "vip"
+provider = [
+  { label = "mainnet-0", url = "http://..", features = [] },
+  { label = "mainnet-1", url = "http://..", features = [],
+    match = [
+      { name = "some_node_.*", limit = 10 },
+      { name = "other_node_.*", limit = 0 } ] } ]
+```
+
+Nodes named `some_node_.*` will use `mainnet-1` for at most 10 subgraphs,
+and `mainnet-0` for everything else, nodes named `other_node_.*` will never
+use `mainnet-1` and always `mainnet-0`. Any node whose name does not match
+one of these patterns will use `mainnet-0` and `mainnet-1` for an unlimited
+number of subgraphs.
+
+## Controlling Deployment
+
+When `graph-node` receives a request to deploy a new subgraph deployment,
+it needs to decide in which shard to store the data for the deployment, and
+which of any number of nodes connected to the store should index the
+deployment. That decision is based on a number of rules defined in the
+`[deployment]` section. Deployment rules can match on the subgraph name and
+the network that the deployment is indexing.
+
+Rules are evaluated in order, and the first rule that matches determines
+where the deployment is placed. The `match` element of a rule can have a
+`name`, a [regular expression](https://docs.rs/regex/1.4.2/regex/#syntax)
+that is matched against the subgraph name for the deployment, and a
+`network` name that is compared to the network that the new deployment
+indexes. The `network` name can either be a string, or a list of strings.
+
+The last rule must not have a `match` statement to make sure that there is
+always some shard and some indexer that will work on a deployment.
+
+The rule indicates the name of the `shard` where the data for the
+deployment should be stored, which defaults to `primary`, and a list of
+`indexers`. For the matching rule, one indexer is chosen from the
+`indexers` list so that deployments are spread evenly across all the nodes
+mentioned in `indexers`. The names for the indexers must be the same names
+that are passed with `--node-id` when those index nodes are started.
+
+Instead of a fixed `shard`, it is also possible to use a list of `shards`;
+in that case, the system uses the shard from the given list with the fewest
+active deployments in it.
+
+```toml
+[deployment]
+[[deployment.rule]]
+match = { name = "(vip|important)/.*" }
+shard = "vip"
+indexers = [ "index_node_vip_0", "index_node_vip_1" ]
+[[deployment.rule]]
+match = { network = "kovan" }
+# No shard, so we use the default shard called 'primary'
+indexers = [ "index_node_kovan_0" ]
+[[deployment.rule]]
+match = { network = [ "xdai", "poa-core" ] }
+indexers = [ "index_node_other_0" ]
+[[deployment.rule]]
+# There's no 'match', so any subgraph matches
+shards = [ "sharda", "shardb" ]
+indexers = [
+    "index_node_community_0",
+    "index_node_community_1",
+    "index_node_community_2",
+    "index_node_community_3",
+    "index_node_community_4",
+    "index_node_community_5"
+  ]
+
+```
+
+## Query nodes
+
+Nodes can be configured to explicitly be query nodes by including the
+following in the configuration file:
+```toml
+[general]
+query = "<regular expression>"
+```
+
+Any node whose `--node-id` matches the regular expression will be set up to
+only respond to queries. For now, that only means that the node will not
+try to connect to any of the configured Ethereum providers.
+
+## Basic Setup
+
+The following file is equivalent to using the `--postgres-url` command line
+option:
+```toml
+[store]
+[store.primary]
+connection="<.. postgres-url argument ..>"
+[deployment]
+[[deployment.rule]]
+indexers = [ "<.. list of all indexing nodes ..>" ]
+```
+
+## Validating configuration files
+
+A configuration file can be checked for validity by passing the `--check-config`
+flag to `graph-node`. The command
+```shell
+graph-node --config $CONFIG_FILE --check-config
+```
+will read the configuration file and print information about syntax errors or, for
+valid files, a JSON representation of the configuration.
+
+## Simulating deployment placement
+
+Given a configuration file, placement of newly deployed subgraphs can be
+simulated with
+```shell
+graphman --config $CONFIG_FILE config place some/subgraph mainnet
+```
+The command will not make any changes, but simply print where that subgraph
+would be placed. The output will indicate the database shard that will hold
+the subgraph's data, and a list of indexing nodes that could be used for
+indexing that subgraph. During deployment, `graph-node` chooses the indexing
+nodes with the fewest subgraphs currently assigned from that list.
diff --git a/docs/environment-variables.md b/docs/environment-variables.md
new file mode 100644
index 0000000..e52e529
--- /dev/null
+++ b/docs/environment-variables.md
@@ -0,0 +1,201 @@
+# Environment Variables
+
+**Warning**: the names of some of these environment variables will be changed at
+some point in the near future.
+
+This page lists the environment variables used by `graph-node` and what effect
+they have. Some environment variables can be used instead of command line flags.
+Those are not listed here, please consult `graph-node --help` for details on
+those.
+
+## JSON-RPC configuration for EVM chains
+
+- `ETHEREUM_REORG_THRESHOLD`: Maximum expected reorg size, if a larger reorg
+  happens, subgraphs might process inconsistent data. Defaults to 250.
+- `ETHEREUM_POLLING_INTERVAL`: how often to poll Ethereum for new blocks (in ms,
+  defaults to 500ms)
+- `GRAPH_ETHEREUM_TARGET_TRIGGERS_PER_BLOCK_RANGE`: The ideal amount of triggers
+  to be processed in a batch. If this is too small it may cause too many requests
+  to the ethereum node, if it is too large it may cause unreasonably expensive
+  calls to the ethereum node and excessive memory usage (defaults to 100).
+- `ETHEREUM_TRACE_STREAM_STEP_SIZE`: `graph-node` queries traces for a given
+  block range when a subgraph defines call handlers or block handlers with a
+  call filter. The value of this variable controls the number of blocks to scan
+  in a single RPC request for traces from the Ethereum node. Defaults to 50.
+- `DISABLE_BLOCK_INGESTOR`: set to `true` to disable block ingestion. Leave
+  unset or set to `false` to leave block ingestion enabled.
+- `ETHEREUM_BLOCK_BATCH_SIZE`: number of Ethereum blocks to request in parallel.
+  Also limits other parallel requests such such as trace_filter. Defaults to 10.
+- `GRAPH_ETHEREUM_MAX_BLOCK_RANGE_SIZE`: Maximum number of blocks to scan for
+  triggers in each request (defaults to 1000).
+- `GRAPH_ETHEREUM_MAX_EVENT_ONLY_RANGE`: Maximum range size for `eth.getLogs`
+  requests that dont filter on contract address, only event signature (defaults to 500).
+- `GRAPH_ETHEREUM_JSON_RPC_TIMEOUT`: Timeout for Ethereum JSON-RPC requests.
+- `GRAPH_ETHEREUM_REQUEST_RETRIES`: Number of times to retry JSON-RPC requests
+  made against Ethereum. This is used for requests that will not fail the
+  subgraph if the limit is reached, but will simply restart the syncing step,
+  so it can be low. This limit guards against scenarios such as requesting a
+  block hash that has been reorged. Defaults to 10.
+- `GRAPH_ETHEREUM_BLOCK_INGESTOR_MAX_CONCURRENT_JSON_RPC_CALLS_FOR_TXN_RECEIPTS`:
+  The maximum number of concurrent requests made against Ethereum for
+  requesting transaction receipts during block ingestion.
+  Defaults to 1,000.
+- `GRAPH_ETHEREUM_FETCH_TXN_RECEIPTS_IN_BATCHES`: Set to `true` to
+  disable fetching receipts from the Ethereum node concurrently during
+  block ingestion. This will use fewer, batched requests. This is always set to `true`
+  on MacOS to avoid DNS issues.
+- `GRAPH_ETHEREUM_CLEANUP_BLOCKS` : Set to `true` to clean up unneeded
+  blocks from the cache in the database. When this is `false` or unset (the
+  default), blocks will never be removed from the block cache. This setting
+  should only be used during development to reduce the size of the
+  database. In production environments, it will cause multiple downloads of
+  the same blocks and therefore slow the system down. This setting can not
+  be used if the store uses more than one shard.
+- `GRAPH_ETHEREUM_GENESIS_BLOCK_NUMBER`: Specify genesis block number. If the flag
+  is not set, the default value will be `0`.
+
+## Running mapping handlers
+
+- `GRAPH_MAPPING_HANDLER_TIMEOUT`: amount of time a mapping handler is allowed to
+  take (in seconds, default is unlimited)
+- `GRAPH_ENTITY_CACHE_SIZE`: Size of the entity cache, in kilobytes. Defaults to 10000 which is 10MB.
+- `GRAPH_MAX_API_VERSION`: Maximum `apiVersion` supported, if a developer tries to create a subgraph
+  with a higher `apiVersion` than this in their mappings, they'll receive an error. Defaults to `0.0.7`.
+- `GRAPH_MAX_SPEC_VERSION`: Maximum `specVersion` supported. if a developer tries to create a subgraph
+  with a higher `apiVersion` than this, they'll receive an error. Defaults to `0.0.5`.
+- `GRAPH_RUNTIME_MAX_STACK_SIZE`: Maximum stack size for the WASM runtime, if exceeded the execution
+  stops and an error is thrown. Defaults to 512KiB.
+
+## IPFS
+
+- `GRAPH_IPFS_TIMEOUT`: timeout for IPFS, which includes requests for manifest files
+  and from mappings (in seconds, default is 30).
+- `GRAPH_MAX_IPFS_FILE_BYTES`: maximum size for a file that can be retrieved (in bytes, default is 256 MiB).
+- `GRAPH_MAX_IPFS_MAP_FILE_SIZE`: maximum size of files that can be processed
+  with `ipfs.map`. When a file is processed through `ipfs.map`, the entities
+  generated from that are kept in memory until the entire file is done
+  processing. This setting therefore limits how much memory a call to `ipfs.map`
+  may use (in bytes, defaults to 256MB).
+- `GRAPH_MAX_IPFS_CACHE_SIZE`: maximum number of files cached (defaults to 50).
+- `GRAPH_MAX_IPFS_CACHE_FILE_SIZE`: maximum size of each cached file (in bytes, defaults to 1MiB).
+- `GRAPH_MAX_IPFS_CONCURRENT_REQUESTS`: maximum concurrent requests to IPFS from file data sources (defaults to 100).
+
+## GraphQL
+
+- `GRAPH_GRAPHQL_QUERY_TIMEOUT`: maximum execution time for a graphql query, in
+  seconds. Default is unlimited.
+- `SUBSCRIPTION_THROTTLE_INTERVAL`: while a subgraph is syncing, subscriptions
+  to that subgraph get updated at most this often, in ms. Default is 1000ms.
+- `GRAPH_GRAPHQL_MAX_COMPLEXITY`: maximum complexity for a graphql query. See
+  [here](https://developer.github.com/v4/guides/resource-limitations) for what
+  that means. Default is unlimited. Typical introspection queries have a
+  complexity of just over 1 million, so setting a value below that may interfere
+  with introspection done by graphql clients.
+- `GRAPH_GRAPHQL_MAX_DEPTH`: maximum depth of a graphql query. Default (and
+  maximum) is 255.
+- `GRAPH_GRAPHQL_MAX_FIRST`: maximum value that can be used for the `first`
+  argument in GraphQL queries. If not provided, `first` defaults to 100. The
+  default value for `GRAPH_GRAPHQL_MAX_FIRST` is 1000.
+- `GRAPH_GRAPHQL_MAX_SKIP`: maximum value that can be used for the `skip`
+  argument in GraphQL queries. The default value for
+  `GRAPH_GRAPHQL_MAX_SKIP` is unlimited.
+- `GRAPH_GRAPHQL_WARN_RESULT_SIZE` and `GRAPH_GRAPHQL_ERROR_RESULT_SIZE`:
+  if a GraphQL result is larger than these sizes in bytes, log a warning
+  respectively abort query execution and return an error. The size of the
+  result is checked while the response is being constructed, so that
+  execution does not take more memory than what is configured. The default
+  value for both is unlimited.
+- `GRAPH_GRAPHQL_MAX_OPERATIONS_PER_CONNECTION`: maximum number of GraphQL
+  operations per WebSocket connection. Any operation created after the limit
+  will return an error to the client. Default: 1000.
+- `GRAPH_GRAPHQL_HTTP_PORT` : Port for the GraphQL HTTP server
+- `GRAPH_GRAPHQL_WS_PORT` : Port for the GraphQL WebSocket server
+- `GRAPH_SQL_STATEMENT_TIMEOUT`: the maximum number of seconds an
+  individual SQL query is allowed to take during GraphQL
+  execution. Default: unlimited
+- `GRAPH_DISABLE_SUBSCRIPTION_NOTIFICATIONS`: disables the internal
+  mechanism that is used to trigger updates on GraphQL subscriptions. When
+  this variable is set to any value, `graph-node` will still accept GraphQL
+  subscriptions, but they won't receive any updates.
+- `ENABLE_GRAPHQL_VALIDATIONS`: enables GraphQL validations, based on the GraphQL specification.
+  This will validate and ensure every query executes follows the execution rules.
+- `SILENT_GRAPHQL_VALIDATIONS`: If `ENABLE_GRAPHQL_VALIDATIONS` is enabled, you are also able to just
+  silently print the GraphQL validation errors, without failing the actual query. Note: queries
+  might still fail as part of the later stage validations running, during GraphQL engine execution.
+
+### GraphQL caching
+
+- `GRAPH_CACHED_SUBGRAPH_IDS`: when set to `*`, cache all subgraphs (default behavior). Otherwise, a comma-separated list of subgraphs for which to cache queries.
+- `GRAPH_QUERY_CACHE_BLOCKS`: How many recent blocks per network should be kept in the query cache. This should be kept small since the lookup time and the cache memory usage are proportional to this value. Set to 0 to disable the cache. Defaults to 1.
+- `GRAPH_QUERY_CACHE_MAX_MEM`: Maximum total memory to be used by the query cache, in MB. The total amount of memory used for caching will be twice this value - once for recent blocks, divided evenly among the `GRAPH_QUERY_CACHE_BLOCKS`, and once for frequent queries against older blocks. The default is plenty for most loads, particularly if `GRAPH_QUERY_CACHE_BLOCKS` is kept small. Defaults to 1000, which corresponds to 1GB.
+- `GRAPH_QUERY_CACHE_STALE_PERIOD`: Number of queries after which a cache entry can be considered stale. Defaults to 100.
+
+## Miscellaneous
+
+- `GRAPH_NODE_ID`: sets the node ID, allowing to run multiple Graph Nodes
+  in parallel and deploy to specific nodes; each ID must be unique among the set
+  of nodes. A single node should have the same value between consecutive restarts.
+  Subgraphs get assigned to node IDs and are not reassigned to other nodes automatically.
+- `GRAPH_NODE_ID_USE_LITERAL_VALUE`: (Docker only) Use the literal `node_id`
+  provided to the docker start script instead of replacing hyphens (-) in names
+  with underscores (\_). Changing this for an existing `graph-node`
+  installation requires also changing the assigned node IDs in the
+  `subgraphs.subgraph_deployment_assignment` table in the database. This can be
+  done with GraphMan or via the PostgreSQL command line.
+- `GRAPH_LOG`: control log levels, the same way that `RUST_LOG` is described
+  [here](https://docs.rs/env_logger/0.6.0/env_logger/)
+- `THEGRAPH_STORE_POSTGRES_DIESEL_URL`: postgres instance used when running
+  tests. Set to `postgresql://<DBUSER>:<DBPASSWORD>@<DBHOST>:<DBPORT>/<DBNAME>`
+- `GRAPH_KILL_IF_UNRESPONSIVE`: If set, the process will be killed if unresponsive.
+- `GRAPH_LOG_QUERY_TIMING`: Control whether the process logs details of
+  processing GraphQL and SQL queries. The value is a comma separated list
+  of `sql`,`gql`, and `cache`. If `gql` is present in the list, each
+  GraphQL query made against the node is logged at level `info`. The log
+  message contains the subgraph that was queried, the query, its variables,
+  the amount of time the query took, and a unique `query_id`. If `sql` is
+  present, the SQL queries that a GraphQL query causes are logged. The log
+  message contains the subgraph, the query, its bind variables, the amount
+  of time it took to execute the query, the number of entities found by the
+  query, and the `query_id` of the GraphQL query that caused the SQL
+  query. These SQL queries are marked with `component: GraphQlRunner` There
+  are additional SQL queries that get logged when `sql` is given. These are
+  queries caused by mappings when processing blocks for a subgraph, and
+  queries caused by subscriptions. If `cache` is present in addition to
+  `gql`, also logs information for each toplevel GraphQL query field
+  whether that could be retrieved from cache or not. Defaults to no
+  logging.
+- `GRAPH_LOG_TIME_FORMAT`: Custom log time format.Default value is `%b %d %H:%M:%S%.3f`. More information [here](https://docs.rs/chrono/latest/chrono/#formatting-and-parsing).
+- `STORE_CONNECTION_POOL_SIZE`: How many simultaneous connections to allow to the store.
+  Due to implementation details, this value may not be strictly adhered to. Defaults to 10.
+- `GRAPH_LOG_POI_EVENTS`: Logs Proof of Indexing events deterministically.
+  This may be useful for debugging.
+- `GRAPH_LOAD_WINDOW_SIZE`, `GRAPH_LOAD_BIN_SIZE`: Load can be
+  automatically throttled if load measurements over a time period of
+  `GRAPH_LOAD_WINDOW_SIZE` seconds exceed a threshold. Measurements within
+  each window are binned into bins of `GRAPH_LOAD_BIN_SIZE` seconds. The
+  variables default to 300s and 1s
+- `GRAPH_LOAD_THRESHOLD`: If wait times for getting database connections go
+  above this threshold, throttle queries until the wait times fall below
+  the threshold. Value is in milliseconds, and defaults to 0 which
+  turns throttling and any associated statistics collection off.
+- `GRAPH_LOAD_JAIL_THRESHOLD`: When the system is overloaded, any query
+  that causes more than this fraction of the effort will be rejected for as
+  long as the process is running (i.e., even after the overload situation
+  is resolved) If this variable is not set, no queries will ever be jailed,
+  but they will still be subject to normal load management when the system
+  is overloaded.
+- `GRAPH_LOAD_SIMULATE`: Perform all the steps that the load manager would
+  given the other load management configuration settings, but never
+  actually decline to run a query, instead log about load management
+  decisions. Set to `true` to turn simulation on, defaults to `false`
+- `GRAPH_STORE_CONNECTION_TIMEOUT`: How long to wait to connect to a
+  database before assuming the database is down in ms. Defaults to 5000ms.
+- `EXPERIMENTAL_SUBGRAPH_VERSION_SWITCHING_MODE`: default is `instant`, set
+  to `synced` to only switch a named subgraph to a new deployment once it
+  has synced, making the new deployment the "Pending" version.
+- `GRAPH_REMOVE_UNUSED_INTERVAL`: How long to wait before removing an
+  unused deployment. The system periodically checks and marks deployments
+  that are not used by any subgraphs any longer. Once a deployment has been
+  identified as unused, `graph-node` will wait at least this long before
+  actually deleting the data (value is in minutes, defaults to 360, i.e. 6
+  hours)
diff --git a/docs/getting-started.md b/docs/getting-started.md
new file mode 100644
index 0000000..213a540
--- /dev/null
+++ b/docs/getting-started.md
@@ -0,0 +1,486 @@
+# Getting Started
+> **Note:**  This project is heavily a WIP, and until it reaches v1.0, the API is subject to change in breaking ways without notice.
+
+## 0 Introduction
+
+This page explains everything you need to know to run a local Graph Node, including links to other reference pages. First, we describe what The Graph is and then explain how to get started.
+
+### 0.1 What Is The Graph?
+
+The Graph is a decentralized protocol for indexing and querying data from blockchains, which makes it possible to query for data that is difficult or impossible to do directly. Currently, we only work with Ethereum.
+
+For example, with the popular Cryptokitties decentralized application (dApp) that implements the [ERC-721 Non-Fungible Token (NFT)](https://github.com/ethereum/eips/issues/721) standard, it is relatively straightforward to ask the following questions:
+> *How many cryptokitties does a specific Ethereum account own?*
+> *When was a particular cryptokitty born?*
+
+These read patterns are directly supported by the methods exposed by the [contract](https://github.com/dapperlabs/cryptokitties-bounty/blob/master/contracts/KittyCore.sol): the [`balanceOf`](https://github.com/dapperlabs/cryptokitties-bounty/blob/master/contracts/KittyOwnership.sol#L64) and [`getKitty`](https://github.com/dapperlabs/cryptokitties-bounty/blob/master/contracts/KittyCore.sol#L91) methods for these two examples.
+
+However, other questions are more difficult to answer:
+> *Who are the owners of the cryptokitties born between January and February of 2018?*
+
+To answer this question, you need to process all [`Birth` events](https://github.com/dapperlabs/cryptokitties-bounty/blob/master/contracts/KittyBase.sol#L15) and then call the [`ownerOf` method](https://github.com/dapperlabs/cryptokitties-bounty/blob/master/contracts/KittyOwnership.sol#L144) for each cryptokitty born. An alternate approach could involve processing all (`Transfer` events) and filtering based on the most recent transfer for each cryptokitty.
+
+Even for this relatively simple question, it would take hours or even days for a dApp running in a browser to find an answer. Indexing and caching data off blockchains is hard. There are also edge cases around finality, chain reorganizations, uncled blocks, etc., which make it even more difficult to display deterministic data to the end user.
+
+The Graph solves this issue by providing an open source node implementation, [Graph Node](../README.md), which handles indexing and caching of blockchain data. The entire community can contribute to and utilize this tool. In the current implementation, it exposes functionality through a GraphQL API for end users.
+
+### 0.2 How Does It Work?
+
+The Graph must be run alongside a running IPFS node, Ethereum node, and a store (Postgres, in this initial implementation).
+
+![Data Flow Diagram](images/TheGraph_DataFlowDiagram.png)
+
+The high-level dataflow for a dApp using The Graph is as follows:
+1. The dApp creates/modifies data on Ethereum through a transaction to a smart contract.
+2. The smart contract emits one or more events (logs) while processing this transaction.
+3. The Graph Node listens for specific events and triggers handlers in a user-defined mapping.
+4. The mapping is a WASM module that runs in a WASM runtime. It creates one or more store transactions in response to Ethereum events.
+5. The store is updated along with the indexes.
+6. The dApp queries the Graph Node for data indexed from the blockchain using the node's [GraphQL endpoint](https://graphql.org/learn/). The Graph Node, in turn, translates the GraphQL queries into queries for its underlying store to fetch this data. This makes use of the store's indexing capabilities.
+7. The dApp displays this data in a user-friendly format, which an end-user leverages when making new transactions against the Ethereum blockchain.
+8. And, this cycle repeats.
+
+### 0.3 What's Needed to Build a Graph Node?
+Three repositories are relevant to building on The Graph:
+1. [Graph Node](../README.md) – A server implementation for indexing, caching, and serving queries against data from Ethereum.
+2. [Graph CLI](https://github.com/graphprotocol/graph-cli) – A CLI for building and compiling projects that are deployed to the Graph Node.
+3. [Graph TypeScript Library](https://github.com/graphprotocol/graph-ts) – TypeScript/AssemblyScript library for writing subgraph mappings to be deployed to The Graph.
+
+### 0.4 Getting Started Overview
+Below, we outline the required steps to build a subgraph from scratch, which will serve queries from a GraphQL endpoint. The three major steps are:
+
+1. [Define the subgraph](#1-define-the-subgraph)
+    1. [Define the data sources and create a manifest](#11-define-the-data-sources-and-create-a-manifest)
+
+    2. [Create the GraphQL schema](#12-create-the-graphql-schema-for-the-data-source)
+
+    3. [Create a subgraph project and generate types](#13-create-a-subgraph-project-and-generate-types)
+
+    4. [Write the mappings](#14-writing-mappings)
+2. Deploy the subgraph
+    1. [Start up an IPFS node](#21-start-up-ipfs)
+
+    2. [Create the Postgres database](#22-create-the-postgres-db)
+
+    3. [Start the Graph Node and Connect to an Etheruem node](#23-starting-the-graph-node-and-connecting-to-an-etheruem-node)
+
+    4. [Deploy the subgraph](#24-deploying-the-subgraph)
+3. Query the subgraph
+    1. [Query the newly deployed GraphQL API](#3-query-the-local-graph-node)
+
+Now, let's dig in!
+
+## 1 Define the Subgraph
+When we refer to a subgraph, we reference the entire project that is indexing a chosen set of data.
+
+To start, create a repository for this project.
+
+### 1.1 Define the Data Sources and Create a Manifest
+
+When building a subgraph, you must first decide what blockchain data you want the Graph Node to index. These are known as `dataSources`, which are datasets derived from a blockchain, i.e., an Ethereum smart contract.
+
+The subgraph is defined by a YAML file known as the **subgraph manifest**. This file should always be named `subgraph.yaml`. View the full specification for the subgraph manifest [here](subgraph-manifest.md). It contains a schema, data sources, and mappings that are used to deploy the GraphQL endpoint.
+
+Let's go through an example to display what a subgraph manifest looks like. In this case, we use the common ERC721 contract and look at the `Transfer` event because it is familiar to many developers. Below, we define a subgraph manifest with one contract under `dataSources`, which is a smart contract implementing the ERC721 interface:
+```yaml
+specVersion: 0.0.1
+description: ERC-721 Example
+repository: https://github.com/<YOUR_GITHUB_NAME>/erc721-example
+schema:
+  file: ./schema.graphql
+dataSources:
+- kind: ethereum/contract
+  name: MyERC721Contract
+  network: mainnet
+  source:
+    address: "0x06012c8cf97BEaD5deAe237070F9587f8E7A266d"
+    abi: ERC721
+  mapping:
+    kind: ethereum/events
+    apiVersion: 0.0.1
+    language: wasm/assemblyscript
+    entities:
+    - Token
+    abis:
+    - name: ERC721
+      file: ./abis/ERC721ABI.json
+    eventHandlers:
+    - event: Transfer(address,address,uint256)
+      handler: handleTransfer
+    file: ./mapping.ts
+```
+We point out a few important facts from this example to supplement the [subgraph manifest spec](subgraph-manifest.md):
+
+* The name `ERC721` under `source > abi` must match the name displayed underneath `abis > name`.
+* The event `Transfer(address,address,uint256)` under `eventHandlers` must match what is in the ABI. The name `handleTransfer` under `eventHandlers > handler` must match the name of the mapping function, which we explain in section 1.4.
+* Ensure that you have the correct contract address under `source > address`. This is also the case when indexing testnet contracts as well because you might switch back and forth.
+* You can define multiple data sources under dataSources. Within a datasource, you can also have multiple `entities` and `events`. See [this subgraph](https://github.com/graphprotocol/decentraland-subgraph/blob/master/subgraph.yaml) for an example.
+* If at any point the Graph CLI outputs 'Failed to copy subgraph files', it probably means you have a typo in the manifest.
+
+#### 1.1.1 Obtain the Contract ABIs  
+The ABI JSON file must contain the correct ABI to source all the events or any contract state you wish to ingest into the Graph Node. There are a few ways to obtain an ABI for the contract:
+* If you are building your own project, you likely have access to your most current ABIs of your smart contracts.
+* If you are building a subgraph for a public project, you can download that project to your computer and generate the ABI by using [`truffle compile`](https://truffleframework.com/docs/truffle/overview) or `solc` to compile. This creates the ABI files that you can then transfer to your subgraph `/abi` folder.
+* Sometimes, you can also find the ABI on [Etherscan](https://etherscan.io), but this is not always reliable because the uploaded ABI may be out of date. Make sure you have the correct ABI. Otherwise, you will not be able to start a Graph Node.
+
+If you run into trouble here, double-check the ABI and ensure that the event signatures exist *exactly* as you expect them by examining the smart contract code you are sourcing. Also, note with the ABI, you only need the array for the ABI. Compiling the contracts locally results in a `.json` file that contains the complete ABI nested within the `.json` file under the key `abi`.
+
+An example `abi` for the `Transfer` event is shown below and would be stored in the `/abi` folder with the name `ERC721ABI.json`:
+
+```json
+  [{
+    "anonymous": false,
+    "inputs": [
+      {
+        "indexed": true,
+        "name": "_from",
+        "type": "address"
+      },
+      {
+        "indexed": true,
+        "name": "_to",
+        "type": "address"
+      },
+      {
+        "indexed": true,
+        "name": "_tokenId",
+        "type": "uint256"
+      }
+    ],
+    "name": "Transfer",
+    "type": "event"
+  }]
+  ```
+
+Once you create this `subgraph.yaml` file, move to the next section.
+
+### 1.2 Create the GraphQL Schema for the Data Source
+GraphQL schemas are defined using the GraphQL interface definition language (IDL). If you have never written a GraphQL schema, we recommend checking out a [quick primer](https://graphql.org/learn/schema/#type-language) on the GraphQL type system.
+
+With The Graph, rather than defining the top-level `Query` type, you simply define entity types. Then, the Graph Node will generate top-level fields for querying single instances and collections of that entity type. Each entity type is required to be annotated with an `@entity` directive.
+
+As you see in the example `subgraph.yaml` manifest above, it contains one entity named `Token`. Let's define what that would look like for the GraphQL schema:
+
+Define a Token entity type:
+```graphql
+type Token @entity {
+  id: ID!
+  currentOwner: Address!
+}
+```
+
+This `entity` tracks a single ERC721 token on Ethereum by its ID and the current owner. The **`ID` field is required** and stores values of the ID type, which are strings. The `ID` must be a unique value so that it can be placed into the store. For an ERC721 token, the unique ID could be the token ID because that value is unique to that coin.
+
+The exclamation mark represents the fact that that field must be set when the entity is stored in the database, i.e., it cannot be `null`. See the [Schema API](graphql-api.md#3-schema) for a complete reference on defining the schema for The Graph.
+
+When you complete the schema, add its path to the top-level `schema` key in the subgraph manifest. See the code below for an example:
+
+```yaml
+specVersion: 0.0.1
+schema:
+  file: ./schema.graphql
+```
+
+### 1.3 Create a Subgraph Project and Generate Types
+Once you have the `subgraph.yaml` manifest and the `./schema.graphql` file, you are ready to use the Graph CLI to set up the subgraph directory. The Graph CLI is a command-line tool that contains helpful commands for deploying the subgraphs. Before continuing with this guide, please go to the [Graph CLI README](https://github.com/graphprotocol/graph-cli/) and follow the instructions up to Step 7 for setting up the subgraph directory.
+
+Once you run `yarn codegen` as outlined in the [Graph CLI README](https://github.com/graphprotocol/graph-cli/), you are ready to create the mappings.
+
+`yarn codegen` looks at the contract ABIs defined in the subgraph manifest and generates TypeScript classes for the smart contracts the mappings script will interface with, which includes the types of public methods and events. In reality, the classes are AssemblyScript but more on that later.
+
+Classes are also generated based on the types defined in the GraphQL schema. These generated classes are incredibly useful for writing correct mappings. This allows you to autocomplete Ethererum events as well as improve developer productivity using the TypeScript language support in your favorite editor or IDE.
+
+### 1.4 Write the Mappings
+
+The mappings that you write will perform transformations on the Ethereum data you are sourcing, and it will dictate how this data is loaded into the Graph Node. Mappings can be very simple but can become complex. It depends on how much abstraction you want between the data and the underlying Ethereum contract.
+
+Mappings are written in a subset of TypeScript called AssemblyScript, which can be compiled down to WASM. AssemblyScript is stricter than normal TypeScript but follows the same backbone. A few TypeScript/JavaScript features that are not supported in AssemblyScript include plain old Javascript objects (POJOs), untyped arrays, untyped maps, union types, the `any` type, and variadic functions. In addition, `switch` statements also work differently. See the [AssemblyScript wiki](https://github.com/AssemblyScript/assemblyscript/wiki) for a full reference on AssemblyScript features.
+
+In the mapping file, create export functions named after the event handlers in the subgraph manifest. Each handler should accept a single parameter called `event` with a type corresponding to the name of the event that is being handled. This type was generated for you in the previous step, 1.3.
+
+```typescript
+export function handleTransfer(event: Transfer): void {
+  // Event handler logic goes here
+}
+```
+
+As mentioned, AssemblyScript does not have untyped maps or POJOs, so classes are generated to represent the types defined in the GraphQL schema. The generated type classes handle property type conversions for you, so AssemblyScript's requirement of strictly typed functions is satisfied without the extra work of converting each property explicitly.
+
+Let's look at an example. Continuing with our previous token example, let's write a mapping that tracks the owner of a particular ERC721 token.
+
+```typescript
+
+// This is an example event type generated by `graph-cli`
+// from an Ethereum smart contract ABI
+import { Transfer } from './types/abis/SomeContract'
+
+// This is an example of an entity type generated from a
+// subgraph's GraphQL schema
+import { Token } from './types/schema'
+
+export function handleTransfer(event: Transfer): void {
+    let tokenID = event.params.tokenID.toHex()
+    let token = new Token(tokenID)
+    token.currentOwner = event.params.to
+
+    token.save()
+}
+```
+A few things to note from this code:
+* We create a new entity named `token`, which is stored in the Graph Node database.
+* We create an ID for that token, which must be unique, and then create an entity with `new Token(tokenID)`. We get the token ID from the event emitted by Ethereum, which was turned into an AssemblyScript type by the [Graph TypeScript Library](https://github.com/graphprotocol/graph-ts). We access it at `event.params.tokenId`. Note that you must set `ID` as a string and call `toHex()` on the `tokenID` to turn it into a hex string.
+* This entity is updated by the `Transfer` event emitted by the ERC721 contract.
+* The current owner is gathered from the event with `event.params.to`. It is set as an Address by the Token class.
+* Event handlers functions always return `void`.
+* `token.save()` is used to set the Token entity. `.save()` comes from `graph-ts` just like the entity type (`Token` in this example). It is used for setting the value(s) of a particular entity's attribute(s) in the store. There is also a `.load()` function, which will be explained in 1.4.1.
+
+#### 1.4.1 Use the `save`, `load`, and `remove` entity functions
+
+The only way that entities may be added to The Graph is by calling `<entity>.save()`, which may be called multiple times in an event handler. `<entity>.save()` will only set the entity attributes that have explicitly been set on the `entity`. Attributes that are not explicitly set or are unset by calling `Entity.unset(<attribute>)` will not be overwritten. This means you can safely update one field of an entity and not worry about overwriting other fields not referenced in the mapping.
+
+The definition for `<entity>.save()` is:
+
+```typescript
+entity.save() // Entity is representative of the entity type being updated. In our example above, it is Token.
+```
+
+ `<entity>.load()` expects the entity type and ID of the entity. Use `<entity>.load()` to retrieve information previously added with `<entity>.save()`.
+
+The definition for `<entity>.load()` is:
+
+ ```typescript
+entity.load() // Entity is representative of the entity type being updated. In our example above, it is Token.
+```
+
+Once again, all these functions come from the [Graph TypeScript Library](https://github.com/graphprotocol/graph-ts).
+
+Let's look at the ERC721 token as an example for using `token.load()`. Above, we showed how to use `token.save()`. Now, let's consider that you have another event handler that needs to retrieve the currentOwner of an ERC721 token. To do this within an event handler, you would write the following:
+
+```typescript
+  let token = token.load(tokenID.toHex())
+  if (token !== null) {
+    let owner = token.currentOwner
+  }
+```
+
+You now have the `owner` data, and you can use that in the mapping to set the owner value to a new entity.
+
+There is also `<entity>.remove()`, which allows you to erase an entry that exists in the store. You simply pass the entity and ID:
+
+```typescript
+entity.remove(ID)
+```
+
+#### 1.4.2 Call into the Contract Storage to Get Data
+
+You can also obtain data that is stored in one of the included ABI contracts. Any state variable that is marked `public` or any `view` function can be accessed. Below shows how you obtain the token
+symbol of an ERC721 token, which is a state variable of the smart contract. You would add this inside of the event handler function.  
+
+```typescript
+  let tokenContract = ERC721.bind(event.address);
+  let tokenSymbol = tokenContract.symbol();
+```
+
+Note, we are using an ERC721 class generated from the ABI, which we call bind on. This is gathered from the subgraph manifest here:
+```yaml
+  source:
+    address: "0x06012c8cf97BEaD5deAe237070F9587f8E7A266d"
+    abi: ERC721
+```
+
+The class is imported from the ABI's TypeScript file generated via `yarn codegen`.
+
+## 2 Deploy the Subgraph
+
+### 2.1 Start Up an IPFS Node
+To deploy the subgraph to the Graph Node, the subgraph will first need to be built and stored on IPFS, along with all linked files.
+
+To run an IPFS daemon locally, execute the following:
+1. Download and install IPFS.
+2. Run `ipfs init`.
+3. Run `ipfs daemon`.
+
+If you encounter problems, follow the instructions from the [IPFS website](https://ipfs.io/docs/getting-started/).
+
+To confirm the subgraph is stored on IPFS, pass that subgraph ID into `ipfs cat` to view the subgraph manifest with file paths replaced by IPLD links.
+
+### 2.2 Create the Postgres database
+
+Ensure that you have Postgres installed. Navigate to a location where you want to save the `.postgres` folder. The desktop is fine since this folder can be used for many different subgraphs. Then, run the following commands:
+
+```
+initdb -D .postgres
+pg_ctl -D .postgres -l logfile start
+createdb <POSTGRES_DB_NAME>
+```
+Name the database something relevant to the project so that you always know how to access it.
+
+### 2.3 Start the Graph Node and Connect to an Ethereum Node
+
+When you start the Graph Node, you need to specify which Ethereum network it should connect to. There are three common ways to do this:
+ * Infura
+ * A local Ethereum node
+ * Ganache
+
+The Ethereum Network (Mainnet, Ropsten, Rinkeby, etc.) must be passed as a flag in the command that starts the Graph Node as laid out in the following subsections.
+
+#### 2.3.1 Infura
+
+[Infura](https://infura.io/) is supported and is the simplest way to connect to an Ethereum node because you do not have to set up your own geth or parity node. However, it does sync slower than being connected to your own node. The following flags are passed to start the Graph Node and indicate you want to use Infura:
+
+```sh
+cargo run -p graph-node --release -- \
+  --postgres-url postgresql://<USERNAME><:PASSWORD>@localhost:5432/<POSTGRES_DB_NAME> \
+  --ethereum-rpc <ETHEREUM_NETWORK_NAME>:https://mainnet.infura.io \
+  --ipfs 127.0.0.1:5001 \
+  --debug
+```
+
+Also, note that the Postgres database may not have a password at all. If that is the case, the Postgres connection URL can be passed as follows:
+
+`  --postgres-url postgresql://<USERNAME>@localhost:5432/<POSTGRES_DB_NAME> \ `
+
+#### 2.3.2 Local Geth or Parity Node
+
+This is the speediest way to get mainnet or testnet data. The problem is that if you do not already have a synced [geth](https://geth.ethereum.org/docs/getting-started) or [parity](https://github.com/paritytech/parity-ethereum) node, you will have to sync one, which takes a very long time and takes up a lot of space. Additionally, note that geth `fast sync` works. So, if you are starting from scratch, this is the fastest way to get caught up, but expect at least 12 hours of syncing on a modern laptop with a good internet connection to sync geth. Normal mode geth or parity will take much longer. Use the following geth command to start syncing:
+
+`geth --syncmode "fast" --rpc --ws --wsorigins="*" --rpcvhosts="*" --cache 1024`
+
+Once you have the local node fully synced, run the following command:
+
+```sh
+cargo run -p graph-node --release -- \
+  --postgres-url postgresql://<USERNAME><:PASSWORD>@localhost:5432/<POSTGRES_DB_NAME> \
+  --ethereum-rpc <ETHEREUM_NETWORK_NAME>:127.0.0.1:8545 \
+  --ipfs 127.0.0.1:5001 \
+  --debug
+```
+
+This assumes the local node is on the default `8545` port. If you are on a different port, change it.
+
+Switching back and forth between sourcing data from Infura and your own local nodes is fine. The Graph Node picks up where it left off.
+
+#### 2.3.3 Ganache
+
+**IMPORTANT: Ganache fixed the [issue](https://github.com/trufflesuite/ganache/issues/907) that prevented things from working properly. However, it did not release the new version. Follow the steps in this [issue](https://github.com/graphprotocol/graph-node/issues/375) to run the fixed version locally.**
+
+[Ganache](https://github.com/trufflesuite/ganache-cli) can be used as well and is preferable for quick testing. This might be an option if you are simply testing out the contracts for quick iterations. Of course, if you close Ganache, then the Graph Node will no longer have any data to source. Ganache is best for short-term projects such as hackathons. Also, it is useful for testing to see that the schema and mappings are working properly before working on the mainnet.
+
+You can connect the Graph Node to Ganache the same way you connected to a local geth or parity node in the previous section, 2.3.2. Note, however, that Ganache normally runs on port `9545` instead of `8545`.
+
+#### 2.3.4 Local Parity Testnet
+
+To set up a local testnet that will allow you to rapidly test the project, download the parity software if you do not already have it.
+
+This command will work for a one-line install:
+
+`bash <(curl https://get.parity.io -L)`
+
+Next, you want to make an account that you can unlock and make transactions on for the parity dev chain. Run the following command:
+
+`parity account new --chain dev`
+
+Create a password that you will remember. Take note of the account that gets output. Now, you also have to make that password a text file and pass it into the next command. The desktop is a good location for it. If the password is `123`, only put the numbers in the text file. Do not include any quotes.
+
+Then, run this command:
+
+`parity --config dev --unsafe-expose --jsonrpc-cors="all" --unlock <ACCOUNT_ADDRESS> --password ~/Desktop/password.txt`
+
+The chain should start and will be accessible by default on `localhost:8545`. It is a chain with 0 block time and instant transactions, making testing very fast. Passing `unsafe-expose` and `--jsonrpc-cors="all"` as flags allows MetaMask to connect. The `unlock` flag gives parity the ability to send transactions with that account. You can also import the account to MetaMask, which allows you to interact with the test chain directly in your browser. With MetaMask, you need to import the account with the private testnet Ether. The base account that the normal configuration of parity gives you is
+`0x00a329c0648769A73afAc7F9381E08FB43dBEA72`.
+
+The private key is:
+```
+4d5db4107d237df6a3d58ee5f70ae63d73d7658d4026f2eefd2f204c81682cb7 (note this is the private key given along with the parity dev chain, so it is okay to share)
+```
+Use MetaMask ---> import account ---> private key.
+
+All the extra information for customization of a parity dev chain is located [here](https://wiki.parity.io/Private-development-chain#customizing-the-development-chain).
+
+You now have an Ethereum account with a ton of Ether and should be able to set up the migrations on this network and use Truffle. Now, send some Ether to the previous account that was created and unlocked. This way, you can run `truffle migrate` with this account.
+
+#### 2.3.5 Syncing with a Public Testnet
+
+If you want to sync using a public testnet such as Kovan, Rinkeby, or Ropsten, just make sure the local node is a testnet node or that you are hitting the correct Infura testnet endpoint.
+
+### 2.4 Deploy the Subgraph
+
+When you deploy the subgraph to the Graph Node, it will start ingesting all the subgraph events from the blockchain, transforming that data with the subgraph mappings and storing it in the Graph Node. Note that a running subgraph can safely be stopped and restarted, picking up where it left off.
+
+Now that the infrastructure is set up, you can run `yarn create-subgraph` and then `yarn deploy` in the subgraph directory. These commands should have been added to `package.json` in section 1.3 when we took a moment to go through the set up for [Graph CLI documentation](https://github.com/graphprotocol/graph-cli). This builds the subgraph and creates the WASM files in the `dist/` folder. Next, it uploads the `dist/
+` files to IPFS and deploys it to the Graph Node. The subgraph is now fully running.
+
+The `watch` flag allows the subgraph to continually restart every time you save an update to the `manifest`, `schema`, or `mappings`. If you are making many edits or have a subgraph that has been syncing for a few hours, leave this flag off.
+
+Depending on how many events have been emitted by your smart contracts, it could take less than a minute to get fully caught up. If it is a large contract, it could take hours. For example, ENS takes about 12 to 14 hours to register every single ENS domain.
+
+## 3 Query the Local Graph Node
+With the subgraph deployed to the locally running Graph Node, visit http://127.0.0.1:8000/ to open up a [GraphiQL](https://github.com/graphql/graphiql) interface where you can explore the deployed GraphQL API for the subgraph by issuing queries and viewing the schema.
+
+We provide a few simple examples below, but please see the [Query API](graphql-api.md#1-queries) for a complete reference on how to query the subgraph's entities.
+
+Query the `Token` entities:
+```graphql
+{
+  tokens(first: 100) {
+    id
+    currentOwner
+  }
+}
+```
+Notice that `tokens` is plural and that it will return at most 100 entities.
+
+Later, when you have deployed the subgraph with this entity, you can query for a specific value, such as the token ID:
+
+```graphql
+{
+  token(first: 100, id: "c2dac230ed4ced84ad0ca5dfb3ff8592d59cef7ff2983450113d74a47a12") {
+    currentOwner
+  }
+}
+```
+
+You can also sort, filter, or paginate query results. The query below would organize all tokens by their ID and return the current owner of each token.
+
+```graphql
+{
+  tokens(first: 100, orderBy: id) {
+    currentOwner
+  }
+}
+```
+
+GraphQL provides a ton of functionality. Once again, check out the [Query API](graphql-api.md#1-queries) to find out how to use all supported query features.
+
+## 4 Changing the Schema, Mappings, and Manifest, and Launching a New Subgraph
+
+When you first start building the subgraph, it is likely that you will make a few changes to the manifest, mappings, or schema. If you update any of them, rerun `yarn codegen` and `yarn deploy`. This will post the new files on IPFS and deploy the new subgraph. Note that the Graph Node can track multiple subgraphs, so you can do this as many times as you like.
+
+## 5 Common Patterns for Building Subgraphs
+
+### 5.1 Removing Elements of an Array in a Subgraph
+
+Using the AssemblyScript built-in functions for arrays is the way to go. Find the source code [here](https://github.com/AssemblyScript/assemblyscript/blob/18826798074c9fb02243dff76b1a938570a8eda7/std/assembly/array.ts). Using `.indexOf()` to find the element and then using `.splice()` is one way to do so. See this [file](https://github.com/graphprotocol/aragon-subgraph/blob/master/individual-dao-subgraph/mappings/ACL.ts) from the Aragon subgraph for a working implementation.
+
+### 5.2 Getting Data from Multiple Versions of Your Contracts
+
+If you have launched multiple versions of your smart contracts onto Ethereum, it is very easy to source data from all of them. This simply requires you to add all versions of the contracts to the `subgraph.yaml` file and handle the events from each contract. Design your schema to consider both versions, and handle any changes to the event signatures that are emitted from each version. See the [0x Subgraph](https://github.com/graphprotocol/0x-subgraph/tree/master/src/mappings) for an implementation of multiple versions of smart contracts being ingested by a subgraph.
+
+## 5 Example Subgraphs
+
+Here is a list of current subgraphs that we have open sourced:
+* https://github.com/graphprotocol/ens-subgraph
+* https://github.com/graphprotocol/decentraland-subgraph
+* https://github.com/graphprotocol/adchain-subgraph
+* https://github.com/graphprotocol/0x-subgraph
+* https://github.com/graphprotocol/aragon-subgraph
+* https://github.com/graphprotocol/dharma-subgraph
+* https://github.com/daostack/subgraph
+* https://github.com/graphprotocol/dydx-subgraph
+* https://github.com/livepeer/livepeerjs/tree/master/packages/subgraph
+* https://github.com/graphprotocol/augur-subgraph
+
+## Contributions
+
+All feedback and contributions in the form of issues and pull requests are welcome!
+
diff --git a/docs/images/TheGraph_DataFlowDiagram.png b/docs/images/TheGraph_DataFlowDiagram.png
new file mode 100644
index 0000000..2891b34
Binary files /dev/null and b/docs/images/TheGraph_DataFlowDiagram.png differ
diff --git a/docs/implementation/README.md b/docs/implementation/README.md
new file mode 100644
index 0000000..441c5f2
--- /dev/null
+++ b/docs/implementation/README.md
@@ -0,0 +1,11 @@
+# Implementation Notes
+
+The files in this directory explain some higher-level concepts about the
+implementation of `graph-node`. Explanations that are tied more closely to
+the code should go into comments.
+
+* [Metadata storage](./metadata.md)
+* [Schema Generation](./schema-generation.md)
+* [Time-travel Queries](./time-travel.md)
+* [SQL Query Generation](./sql-query-generation.md)
+* [Adding support for a new chain](./add-chain.md)
diff --git a/docs/implementation/add-chain.md b/docs/implementation/add-chain.md
new file mode 100644
index 0000000..eea6168
--- /dev/null
+++ b/docs/implementation/add-chain.md
@@ -0,0 +1,279 @@
+# Adding support for a new chain
+
+## Context
+
+`graph-node` started as a project that could only index EVM compatible chains, eg: `ethereum`, `xdai`, etc.
+
+It was known from the start that with growth we would like `graph-node` to be able to index other chains like `NEAR`, `Solana`, `Cosmos`, list goes on...
+
+However to do it, several refactors were necessary, because the code had a great amount of assumptions based of how Ethereum works.
+
+At first there was a [RFC](https://github.com/graphprotocol/rfcs/blob/10aaae30fdf82f0dd2ccdf4bbecf7ec6bbfb703b/rfcs/0005-multi-blockchain-support.md) for a design overview, then actual PRs such as:
+
+- https://github.com/graphprotocol/graph-node/pull/2272
+- https://github.com/graphprotocol/graph-node/pull/2292
+- https://github.com/graphprotocol/graph-node/pull/2399
+- https://github.com/graphprotocol/graph-node/pull/2411
+- https://github.com/graphprotocol/graph-node/pull/2453
+- https://github.com/graphprotocol/graph-node/pull/2463
+- https://github.com/graphprotocol/graph-node/pull/2755
+
+All new chains, besides the EVM compatible ones, are integrated using [StreamingFast](https://www.streamingfast.io/)'s [Firehose](https://firehose.streamingfast.io/). The integration consists of chain specific `protobuf` files with the type definitions.
+
+## How to do it?
+
+The `graph-node` repository contains multiple Rust crates in it, this section will be divided in each of them that needs to be modified/created.
+
+> It's important to remember that this document is static and may not be up to date with the current implementation. Be aware too that it won't contain all that's needed, it's mostly listing the main areas that need change.
+
+### chain
+
+You'll need to create a new crate in the [chain folder](https://github.com/graphprotocol/graph-node/tree/1cd7936f9143f317feb51be1fc199122761fcbb1/chain) with an appropriate name and the same `version` as the rest of the other ones.
+
+> Note: you'll probably have to add something like `graph-chain-{{CHAIN_NAME}} = { path = "../chain/{{CHAIN_NAME}}" }` to the `[dependencies]` section of a few other `Cargo.toml` files
+
+It's here that you add the `protobuf` definitions with the specific types for the chain you're integrating with. Examples:
+
+- [Ethereum](https://github.com/graphprotocol/graph-node/blob/1cd7936f9143f317feb51be1fc199122761fcbb1/chain/ethereum/proto/codec.proto)
+- [NEAR](https://github.com/graphprotocol/graph-node/blob/1cd7936f9143f317feb51be1fc199122761fcbb1/chain/near/proto/codec.proto)
+- [Cosmos](https://github.com/graphprotocol/graph-node/blob/caa54c1039d3c282ac31bb0e96cb277dbf82f793/chain/cosmos/proto/type.proto)
+
+To compile those we use a crate called `tonic`, it will require a [`build.rs` file](https://doc.rust-lang.org/cargo/reference/build-scripts.html) like the one in the other folders/chains, eg:
+
+```rust
+fn main() {
+    println!("cargo:rerun-if-changed=proto");
+    tonic_build::configure()
+        .out_dir("src/protobuf")
+        .compile(&["proto/codec.proto"], &["proto"])
+        .expect("Failed to compile Firehose CoolChain proto(s)");
+}
+```
+
+You'll also need a `src/codec.rs` to extract the data from the generated Rust code, much like [this one](https://github.com/graphprotocol/graph-node/blob/caa54c1039d3c282ac31bb0e96cb277dbf82f793/chain/cosmos/src/codec.rs).
+
+Besides this source file, there should also be a `TriggerFilter`, `NodeCapabilities` and `RuntimeAdapter`, here are a few empty examples:
+
+`src/adapter.rs`
+```rust
+use crate::capabilities::NodeCapabilities;
+use crate::{data_source::DataSource, Chain};
+use graph::blockchain as bc;
+use graph::prelude::*;
+
+#[derive(Clone, Debug, Default)]
+pub struct TriggerFilter {}
+
+impl bc::TriggerFilter<Chain> for TriggerFilter {
+    fn extend<'a>(&mut self, _data_sources: impl Iterator<Item = &'a DataSource> + Clone) {}
+
+    fn node_capabilities(&self) -> NodeCapabilities {
+        NodeCapabilities {}
+    }
+
+    fn extend_with_template(
+        &mut self,
+        _data_source: impl Iterator<Item = <Chain as bc::Blockchain>::DataSourceTemplate>,
+    ) {
+    }
+
+    fn to_firehose_filter(self) -> Vec<prost_types::Any> {
+        vec![]
+    }
+}
+```
+
+`src/capabilities.rs`
+```rust
+use std::cmp::PartialOrd;
+use std::fmt;
+use std::str::FromStr;
+
+use anyhow::Error;
+use graph::impl_slog_value;
+
+use crate::DataSource;
+
+#[derive(Clone, Copy, Debug, PartialEq, Eq, PartialOrd)]
+pub struct NodeCapabilities {}
+
+impl FromStr for NodeCapabilities {
+    type Err = Error;
+
+    fn from_str(_s: &str) -> Result<Self, Self::Err> {
+        Ok(NodeCapabilities {})
+    }
+}
+
+impl fmt::Display for NodeCapabilities {
+    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
+        f.write_str("{{CHAIN_NAME}}")
+    }
+}
+
+impl_slog_value!(NodeCapabilities, "{}");
+
+impl graph::blockchain::NodeCapabilities<crate::Chain> for NodeCapabilities {
+    fn from_data_sources(_data_sources: &[DataSource]) -> Self {
+        NodeCapabilities {}
+    }
+}
+```
+
+`src/runtime/runtime_adapter.rs`
+```rust
+use crate::{Chain, DataSource};
+use anyhow::Result;
+use blockchain::HostFn;
+use graph::blockchain;
+
+pub struct RuntimeAdapter {}
+
+impl blockchain::RuntimeAdapter<Chain> for RuntimeAdapter {
+    fn host_fns(&self, _ds: &DataSource) -> Result<Vec<HostFn>> {
+        Ok(vec![])
+    }
+}
+```
+
+The chain specific type definitions should also be available for the `runtime`. Since it comes mostly from the `protobuf` files, there's a [generation tool](https://github.com/streamingfast/graph-as-to-rust) made by StreamingFast that you can use to create the `src/runtime/generated.rs`.
+
+You'll also have to implement `ToAscObj` for those types, that usually is made in a `src/runtime/abi.rs` file.
+
+Another thing that will be needed is the `DataSource` types for the [subgraph manifest](https://thegraph.com/docs/en/developer/create-subgraph-hosted/#the-subgraph-manifest).
+
+`src/data_source.rs`
+```rust
+#[derive(Clone, Debug)]
+pub struct DataSource {
+    // example fields:
+    pub kind: String,
+    pub network: Option<String>,
+    pub name: String,
+    pub source: Source,
+    pub mapping: Mapping,
+    pub context: Arc<Option<DataSourceContext>>,
+    pub creation_block: Option<BlockNumber>,
+    /*...*/
+}
+
+impl blockchain::DataSource<Chain> for DataSource { /*...*/ }
+
+#[derive(Clone, Debug, Eq, PartialEq, Deserialize)]
+pub struct UnresolvedDataSource {
+    pub kind: String,
+    pub network: Option<String>,
+    pub name: String,
+    pub source: Source,
+    pub mapping: UnresolvedMapping,
+    pub context: Option<DataSourceContext>,
+}
+
+#[async_trait]
+impl blockchain::UnresolvedDataSource<Chain> for UnresolvedDataSource { /*...*/ }
+
+#[derive(Clone, Debug, Default, Hash, Eq, PartialEq, Deserialize)]
+pub struct BaseDataSourceTemplate<M> {
+    pub kind: String,
+    pub network: Option<String>,
+    pub name: String,
+    pub mapping: M,
+}
+
+pub type UnresolvedDataSourceTemplate = BaseDataSourceTemplate<UnresolvedMapping>;
+pub type DataSourceTemplate = BaseDataSourceTemplate<Mapping>;
+
+#[async_trait]
+impl blockchain::UnresolvedDataSourceTemplate<Chain> for UnresolvedDataSourceTemplate { /*...*/ }
+
+impl blockchain::DataSourceTemplate<Chain> for DataSourceTemplate { /*...*/ }
+```
+
+And at last, the type that will glue them all, the `Chain` itself.
+
+`src/chain.rs`
+```rust
+pub struct Chain { /*...*/ }
+
+#[async_trait]
+impl Blockchain for Chain {
+    const KIND: BlockchainKind = BlockchainKind::CoolChain;
+
+    type Block = codec::...;
+
+    type DataSource = DataSource;
+
+    // ...
+
+    type TriggerFilter = TriggerFilter;
+
+    type NodeCapabilities = NodeCapabilities;
+
+    type RuntimeAdapter = RuntimeAdapter;
+}
+
+pub struct TriggersAdapter { /*...*/ }
+
+#[async_trait]
+impl TriggersAdapterTrait<Chain> for TriggersAdapter { /*...*/ }
+
+pub struct FirehoseMapper {
+    endpoint: Arc<FirehoseEndpoint>,
+}
+
+#[async_trait]
+impl FirehoseMapperTrait<Chain> for FirehoseMapper { /*...*/ }
+```
+
+### node
+
+The `src/main.rs` file should be able to handle the connection to the new chain via Firehose for the startup, similar to [this](https://github.com/graphprotocol/graph-node/blob/1cd7936f9143f317feb51be1fc199122761fcbb1/node/src/main.rs#L255).
+
+### graph
+
+Two changes are required here:
+
+1. [BlockchainKind](https://github.com/graphprotocol/graph-node/blob/1cd7936f9143f317feb51be1fc199122761fcbb1/graph/src/blockchain/mod.rs#L309) needs to have a new variant for the chain you're integrating with.
+2. And the [IndexForAscTypeId](https://github.com/graphprotocol/graph-node/blob/1cd7936f9143f317feb51be1fc199122761fcbb1/graph/src/runtime/mod.rs#L147) should have the new variants for the chain specific types of the `runtime`.
+
+### server
+
+You'll just have to handle the new `BlockchainKind` in the [index-node/src/resolver.rs](https://github.com/graphprotocol/graph-node/blob/1cd7936f9143f317feb51be1fc199122761fcbb1/server/index-node/src/resolver.rs#L361).
+
+### core
+
+Just like in the `server` crate, you'll just have to handle the new `BlockchainKind` in the [SubgraphInstanceManager](https://github.com/graphprotocol/graph-node/blob/1cd7936f9143f317feb51be1fc199122761fcbb1/core/src/subgraph/instance_manager.rs#L41).
+
+## Example Integrations (PRs)
+
+- NEAR by StreamingFast
+  - https://github.com/graphprotocol/graph-node/pull/2820
+- Cosmos by Figment
+  - https://github.com/graphprotocol/graph-node/pull/3212
+  - https://github.com/graphprotocol/graph-node/pull/3543
+- Solana by StreamingFast
+  - https://github.com/graphprotocol/graph-node/pull/3210
+
+## What else?
+
+Besides making `graph-node` support the new chain, [graph-cli](https://github.com/graphprotocol/graph-cli) and [graph-ts](https://github.com/graphprotocol/graph-ts) should also include the new types and enable the new functionality so that subgraph developers can use it.
+
+For now this document doesn't include how to do that integration, here are a few PRs that might help you with that:
+
+- NEAR
+  - `graph-cli`
+    - https://github.com/graphprotocol/graph-cli/pull/760
+    - https://github.com/graphprotocol/graph-cli/pull/783
+  - `graph-ts`
+    - https://github.com/graphprotocol/graph-ts/pull/210
+    - https://github.com/graphprotocol/graph-ts/pull/217
+- Cosmos
+  - `graph-cli`
+    - https://github.com/graphprotocol/graph-cli/pull/827
+    - https://github.com/graphprotocol/graph-cli/pull/851
+    - https://github.com/graphprotocol/graph-cli/pull/888
+  - `graph-ts`
+    - https://github.com/graphprotocol/graph-ts/pull/250
+    - https://github.com/graphprotocol/graph-ts/pull/273
+
+Also this document doesn't include the multi-blockchain part required for The Graph Network, which at this current moment is in progress, for now the network only supports Ethereum `mainnet`.
diff --git a/docs/implementation/metadata.md b/docs/implementation/metadata.md
new file mode 100644
index 0000000..3183b51
--- /dev/null
+++ b/docs/implementation/metadata.md
@@ -0,0 +1,142 @@
+# Metadata and how it is stored
+
+## Mapping subgraph names to deployments
+
+### `subgraphs.subgraph`
+
+List of all known subgraph names. Maintained in the primary, but there is a background job that periodically copies the table from the primary to all other shards. Those copies are used for queries when the primary is down.
+
+| Column            | Type         | Use                                       |
+|-------------------|--------------|-------------------------------------------|
+| `id`              | `text!`      | primary key, UUID                         |
+| `name`            | `text!`      | user-chosen name                          |
+| `current_version` | `text`       | `subgraph_version.id` for current version |
+| `pending_version` | `text`       | `subgraph_version.id` for pending version |
+| `created_at`      | `numeric!`   | UNIX timestamp                            |
+| `vid`             | `int8!`      | unused                                    |
+| `block_range`     | `int4range!` | unused                                    |
+
+The `id` is used by the hosted explorer to reference the subgraph.
+
+
+### `subgraphs.subgraph_version`
+
+Mapping of subgraph names from `subgraph` to IPFS hashes. Maintained in the primary, but there is a background job that periodically copies the table from the primary to all other shards. Those copies are used for queries when the primary is down.
+
+| Column        | Type         | Use                     |
+|---------------|--------------|-------------------------|
+| `id`          | `text!`      | primary key, UUID       |
+| `subgraph`    | `text!`      | `subgraph.id`           |
+| `deployment`  | `text!`      | IPFS hash of deployment |
+| `created_at`  | `numeric`    | UNIX timestamp          |
+| `vid`         | `int8!`      | unused                  |
+| `block_range` | `int4range!` | unused                  |
+
+
+## Managing a deployment
+
+Directory of all deployments. Maintained in the primary, but there is a background job that periodically copies the table from the primary to all other shards. Those copies are used for queries when the primary is down.
+
+### `deployment_schemas`
+
+| Column       | Type           | Use                                          |
+|--------------|----------------|----------------------------------------------|
+| `id`         | `int4!`        | primary key                                  |
+| `subgraph`   | `text!`        | IPFS hash of deployment                      |
+| `name`       | `text!`        | name of `sgdNNN` schema                      |
+| `version`    | `int4!`        | version of data layout in `sgdNNN`           |
+| `shard`      | `text!`        | database shard holding data                  |
+| `network`    | `text!`        | network/chain used                           |
+| `active`     | `boolean!`     | whether to query this copy of the deployment |
+| `created_at` | `timestamptz!` |                                              |
+
+There can be multiple copies of the same deployment, but at most one per shard. The `active` flag indicates which of these copies will be used for queries; `graph-node` makes sure that there is always exactly one for each IPFS hash.
+
+### `subgraph_deployment`
+
+Details about a deployment to track sync progress etc. Maintained in the
+shard alongside the deployment's data in `sgdNNN`. The table should only
+contain frequently changing data, but for historical reasons contains also
+static data.
+
+| Column                               | Type       | Use                                          |
+|--------------------------------------|------------|----------------------------------------------|
+| `id`                                 | `integer!` | primary key, same as `deployment_schemas.id` |
+| `deployment`                         | `text!`    | IPFS hash                                    |
+| `failed`                             | `boolean!` |                                              |
+| `synced`                             | `boolean!` |                                              |
+| `earliest_ethereum_block_hash`       | `bytea`    | start block from manifest (to be removed)    |
+| `earliest_ethereum_block_number`     | `numeric`  |                                              |
+| `latest_ethereum_block_hash`         | `bytea`    | current subgraph head                        |
+| `latest_ethereum_block_number`       | `numeric`  |                                              |
+| `entity_count`                       | `numeric!` | total number of entities                     |
+| `graft_base`                         | `text`     | IPFS hash of graft base                      |
+| `graft_block_hash`                   | `bytea`    | graft block                                  |
+| `graft_block_number`                 | `numeric`  |                                              |
+| `reorg_count`                        | `integer!` |                                              |
+| `current_reorg_depth`                | `integer!` |                                              |
+| `max_reorg_depth`                    | `integer!` |                                              |
+| `fatal_error`                        | `text`     |                                              |
+| `non_fatal_errors`                   | `text[]`   |                                              |
+| `health`                             | `health!`  |                                              |
+| `last_healthy_ethereum_block_hash`   | `bytea`    |                                              |
+| `last_healthy_ethereum_block_number` | `numeric`  |                                              |
+| `firehose_cursor`                    | `text`     |                                              |
+| `debug_fork`                         | `text`     |                                              |
+
+The columns `reorg_count`, `current_reorg_depth`, and `max_reorg_depth` are
+set during indexing. They are used to determine whether a reorg happened
+while a query was running, and whether that reorg could have affected the
+query.
+
+### `subgraph_manifest`
+
+Details about a deployment that rarely change. Maintained in the
+shard alongside the deployment's data in `sgdNNN`.
+
+| Column                  | Type       | Use                                                  |
+|-------------------------|------------|------------------------------------------------------|
+| `id`                    | `integer!` | primary key, same as `deployment_schemas.id`         |
+| `spec_version`          | `text!`    |                                                      |
+| `description`           | `text`     |                                                      |
+| `repository`            | `text`     |                                                      |
+| `schema`                | `text!`    | GraphQL schema                                       |
+| `features`              | `text[]!`  |                                                      |
+| `graph_node_version_id` | `integer`  |                                                      |
+| `use_bytea_prefix`      | `boolean!` |                                                      |
+| `start_block_hash`      | `bytea`    | Parent of the smallest start block from the manifest |
+| `start_block_number`    | `int4`     |                                                      |
+
+### `subgraph_deployment_assignment`
+
+Tracks which index node is indexing a deployment. Maintained in the primary,
+but there is a background job that periodically copies the table from the
+primary to all other shards.
+
+| Column  | Type  | Use                                         |
+|---------|-------|---------------------------------------------|
+| id      | int4! | primary key, ref to `deployment_schemas.id` |
+| node_id | text! | name of index node                          |
+
+This table could simply be a column on `deployment_schemas`.
+
+### `dynamic_ethereum_contract_data_source`
+
+Stores the dynamic data sources for all subgraphs (will be turned into a
+table that lives in each subgraph's namespace `sgdNNN` soon)
+
+### `subgraph_error`
+
+Stores details about errors that subgraphs encounter during indexing.
+
+### Copying of deployments
+
+The tables `active_copies` in the primary, and `subgraphs.copy_state` and
+`subgraphs.copy_table_state` are used to track which deployments need to be
+copied and how far copying has progressed to make sure that copying works
+correctly across index node restarts.
+
+### Influencing query generation
+
+The table `subgraphs.table_stats` stores which tables for a deployment
+should have the 'account-like' optimization turned on.
diff --git a/docs/implementation/schema-generation.md b/docs/implementation/schema-generation.md
new file mode 100644
index 0000000..c8bba83
--- /dev/null
+++ b/docs/implementation/schema-generation.md
@@ -0,0 +1,125 @@
+# Schema Generation
+
+This document describes how we go from a GraphQL schema to a relational
+table definition in Postgres.
+
+Schema generation follows a few simple rules:
+
+* the data for a subgraph is entirely stored in a Postgres namespace whose
+  name is `sgdNNNN`. The mapping between namespace name and deployment id is
+  kept in `deployment_schemas`
+* the data for each entity type is stored in a table whose structure follows
+  the declaration of the type in the GraphQL schema
+* enums in the GraphQL schema are stored as enum types in Postgres
+* interfaces are not stored in the database, only the concrete types that
+  implement the interface are stored
+
+Any table for an entity type has the following structure:
+
+```sql
+    create table sgd42.account(
+        vid int8    serial primary key,
+        id          text not null, -- or bytea
+        .. attributes ..
+        block_range int4range not null
+    )
+```
+
+The `vid` is used in some situations to uniquely identify the specific
+version of an entity. The `block_range` is used to enable [time-travel
+queries](./time-travel.md).
+
+The attributes of the GraphQL type correspond directly to columns in the
+generated table. The types of these columns are
+
+* the `id` column can have type `ID`, `String`, and `Bytes`, where `ID` is
+  an alias for `String` for historical reasons.
+* if the attribute has a primitive type, the column has the SQL type that
+  most closely mirrors the GraphQL type. `BigDecimal` and `BigInt` are
+  stored as `numeric`, `Bytes` is stored as `bytea`, etc.
+* if the attribute references another entity, the column has the type of the
+  `id` type of the referenced entity type. We do not use foreign key
+  constraints to allow storing an entity that references an entity that will
+  only be created later. Foreign key constraint violations will therefore
+  only be detected when a query is issued, or simply lead to the reference
+  missing from the query result.
+* if the attribute has an enum type, we generate a SQL enum type and use
+  that as the type of the column.
+* if the attribute has a list type, like `[String]`, the corresponding
+  column uses an array type. We do not allow nested arrays like `[[String]]`
+  in GraphQL, so arrays will only ever contain entries of a primitive type.
+
+### Immutable entities
+
+Entity types declared with a plain `@entity` in the GraphQL schema are
+mutable, and the above table design enables selecting one of many versions
+of the same entity, depending on the block height at which the query is
+run. In a lot of cases, the subgraph author knows that entities will never
+be mutated, e.g., because they are just a direct copy of immutable chain data,
+like a transfer. In those cases, we know that the upper end of the block
+range will always be infinite and don't need to store that explicitly.
+
+When an entity type is declared with `@entity(immutable: true)` in the
+GraphQL schema, we do not generate a `block_range` column in the
+corresponding table. Instead, we generate a column `block$ int not null`,
+so that the check whether a row is visible at block `B` simplifies to
+`block$ <= B`.
+
+Furthermore, since each entity can only have one version, we also add a
+constraint `unique(id)` to such tables, and can avoid expensive GiST
+indexes in favor of simple BTree indexes since the `block$` column is an
+integer.
+
+## Indexing
+
+We do not know ahead of time which queries will be issued and therefore
+build indexes extensively. This leads to serious overindexing, but both
+reducing the overindexing and making it possible to generate custom indexes
+are open issues at this time.
+
+We generate the following indexes for each table:
+
+* for mutable entity types
+  * an exclusion index over `(id, block_range)` that ensures that the
+    versions for the same entity `id` have disjoint block ranges
+  * a BRIN index on `(lower(block_range), COALESCE(upper(block_range),
+    2147483647), vid)` that helps speed up some operations, especially
+    reversion, in tables that have good data locality, for example, tables
+    where entities are never updated or deleted
+* for immutable entity types
+  * a unique index on `id`
+  * a BRIN index on `(block$, vid)`
+* for each attribute, an index called `attr_N_M_..` where `N` is the number
+  of the entity type in the GraphQL schema, and `M` is the number of the
+  attribute within that type. For attributes of a primitive type, the index
+  is a BTree index. For attributes that reference other entities, the index
+  is a GiST index on `(attribute, block_range)`
+
+### Indexes on String Attributes
+
+In some cases, `String` attributes are used to store large pieces of text,
+text that is longer than the limit that Postgres imposes on individual index
+entries. For such attributes, we therefore index `left(attribute,
+STRING_PREFIX_SIZE)`. When we generate queries, query generation makes sure
+that this index is usable by adding additional clauses to the query that use
+`left(attribute, STRING_PREFIX_SIZE)` in the query. For example, if a query
+was looking for entities where the `name` equals `"Hamming"`, the query
+would contain a clause `left(name, STRING_PREFIX_SIZE) = 'Hamming'`.
+
+## Known Issues
+
+- Storing arrays as array attributes in Postgres can have catastrophically
+  bad performance if the size of the array is not bounded by a relatively
+  small number.
+- Overindexing leads to large amounts of storage used for indexes, and, of
+  course, slows down writes.
+- At the same time, indexes are not always usable. For example, a BTree
+  index on `name` is not usable for sorting entities, since we always add
+  `id` to the `order by` clause, i.e., when a user asks for entities ordered
+  by `name`, we actually include `order by name, id` in the SQL query to
+  guarantee an unambiguous ordering. Incremental sorting in Postgres 13
+  might help with that.
+- Lack of support for custom indexes makes it hard to transfer manually
+  created indexes between different versions of the same subgraph. By
+  convention, manually created indexes should have a name that starts with
+  `manual_`.
diff --git a/docs/implementation/sql-query-generation.md b/docs/implementation/sql-query-generation.md
new file mode 100644
index 0000000..e88602a
--- /dev/null
+++ b/docs/implementation/sql-query-generation.md
@@ -0,0 +1,499 @@
+## SQL Query Generation
+
+### Goal
+
+For a GraphQL query of the form
+
+```graphql
+query {
+  parents(filter) {
+    id
+    children(filter) {
+      id
+    }
+  }
+}
+```
+
+we want to generate only two SQL queries: one to get the parents, and one to
+get the children for all those parents. The fact that `children` is nested
+under `parents` requires that we add a filter to the `children` query that
+restricts children to those that are related to the parents we fetched in
+the first query to get the parents. How exactly we filter the `children`
+query depends on how the relationship between parents and children is
+modeled in the GraphQL schema, and on whether one (or both) of the types
+involved are interfaces.
+
+The rest of this writeup is concerned with how to generate the query for
+`children`, assuming we already retrieved the list of all parents.
+
+The bulk of the implementation of this feature can be found in
+`graphql/src/store/prefetch.rs`, `store/postgres/src/relational.rs`, and
+`store/postgres/src/relational_queries.rs`
+
+
+### Handling first/skip
+
+We never get all the `children` for a parent; instead we always have a
+`first` and `skip` argument in the children filter. Those arguments need to
+be applied to each parent individually by ranking the children for each
+parent according to the order defined by the `children` query. If the same
+child matches multiple parents, we need to make sure that it is considered
+separately for each parent as it might appear at different ranks for
+different parents. In SQL, we use a lateral join,  essentially a for loop.
+For children that store the id of their parent in `parent_id`, we'd run the
+following query:
+
+```sql
+select c.*, p.id
+  from unnest({parent_ids}) as p(id)
+        cross join lateral
+         (select *
+            from children c
+           where c.parent_id = p.id
+             and .. other conditions on c ..
+           order by c.{sort_key}, c.id
+           limit {first}
+          offset {skip}) c
+ order by p.id, c.{sort_key}, c.id
+```
+
+Note that we order children by the sort key the user specified, followed by
+the `id` to guarantee an unambiguous order even if the sort key is a
+non-unique column. Unfortunately, we do not know which attributes of an
+entity are unique and which ones aren't.
+
+### Handling parent/child relationships
+
+How we get the children for a set of parents depends on how the relationship
+between the two is modeled. The interesting parameters there are whether
+parents store a list or a single child, and whether that field is derived,
+together with the same for children.
+
+There are a total of 16 combinations of these four boolean variables; four
+of them, when both parent and child derive their fields, are not
+permissible. It also doesn't matter whether the child derives its parent
+field: when the parent field is not derived, we need to use that since that
+is the only place that contains the parent -> child relationship. When the
+parent field is derived, the child field can not be a derived field.
+
+That leaves us with eight combinations of whether the parent and child store
+a list or a scalar value, and whether the parent is derived. For details on
+the GraphQL schema for each row in this table, see the section at the end.
+The `Join cond` indicates how we can find the children for a given parent.
+The table refers to the four different kinds of join condition we might need
+as types A, B, C, and D.
+
+| Case | Parent list? | Parent derived? | Child list? | Join cond                  | Type |
+|------|--------------|-----------------|-------------|----------------------------|------|
+|    1 | TRUE         | TRUE            | TRUE        | child.parents ∋ parent.id  | A    |
+|    2 | FALSE        | TRUE            | TRUE        | child.parents ∋ parent.id  | A    |
+|    3 | TRUE         | TRUE            | FALSE       | child.parent = parent.id   | B    |
+|    4 | FALSE        | TRUE            | FALSE       | child.parent = parent.id   | B    |
+|    5 | TRUE         | FALSE           | TRUE        | child.id ∈ parent.children | C    |
+|    6 | TRUE         | FALSE           | FALSE       | child.id ∈ parent.children | C    |
+|    7 | FALSE        | FALSE           | TRUE        | child.id = parent.child    | D    |
+|    8 | FALSE        | FALSE           | FALSE       | child.id = parent.child    | D    |
+
+In addition to how the data about the parent/child relationship is stored,
+the multiplicity of the parent/child relationship also influences query
+generation: if each parent can have at most a single child, queries can be
+much simpler than if we have to account for multiple children per parent,
+which requires paginating them. We also need to detect cases where the
+mappings created multiple children per parent. We do this by adding a clause
+`limit {parent_ids.len} + 1` to the query, so that if there is one parent
+with multiple children, we will select it, but still protect ourselves
+against mappings that produce catastrophically bad data with huge numbers of
+children per parent. The GraphQL execution logic will detect that there is a
+parent with multiple children, and generate an error.
+
+When we query children, we already have a list of all parents from running a
+previous query. To find the children, we need to have the id of the parent
+that child is related to, and, when the parent stores the ids of its
+children directly (types C and D) the child ids for each parent id.
+
+The following queries all produce a relation that has the same columns as
+the table holding children, plus a column holding the id of the parent that
+the child belongs to.
+
+#### Type A
+
+Use when child stores a list of parents
+
+Data needed to generate:
+
+-   children: name of child table
+-   parent_ids: list of parent ids
+-   parent_field: name of parents field (array) in child table
+-   single: boolean to indicate whether a parent has at most one child or
+    not
+
+The implementation uses an `EntityLink::Direct` for joins of this type.
+
+##### Multiple children per parent
+```sql
+select c.*, p.id as parent_id
+  from unnest({parent_ids}) as p(id)
+       cross join lateral
+       (select *
+          from children c
+         where p.id = any(c.{parent_field})
+           and .. other conditions on c ..
+         order by c.{sort_key}
+         limit {first} offset {skip}) c
+ order by c.{sort_key}
+```
+
+##### Single child per parent
+```sql
+select c.*, p.id as parent_id
+  from unnest({parent_ids}) as p(id),
+       children c
+ where c.{parent_field} @> array[p.id]
+   and .. other conditions on c ..
+ limit {parent_ids.len} + 1
+```
+
+#### Type B
+
+Use when child stores a single parent
+
+Data needed to generate:
+
+-   children: name of child table
+-   parent_ids: list of parent ids
+-   parent_field: name of parent field (scalar) in child table
+-   single: boolean to indicate whether a parent has at most one child or
+    not
+
+The implementation uses an `EntityLink::Direct` for joins of this type.
+
+##### Multiple children per parent
+```sql
+select c.*, p.id as parent_id
+  from unnest({parent_ids}) as p(id)
+       cross join lateral
+       (select *
+          from children c
+         where p.id = c.{parent_field}
+           and .. other conditions on c ..
+         order by c.{sort_key}
+         limit {first} offset {skip}) c
+ order by c.{sort_key}
+```
+
+##### Single child per parent
+
+```sql
+select c.*, c.{parent_field} as parent_id
+  from children c
+ where c.{parent_field} = any({parent_ids})
+   and .. other conditions on c ..
+ limit {parent_ids.len} + 1
+```
+
+Alternatively, this is worth a try, too:
+```sql
+select c.*, c.{parent_field} as parent_id
+  from unnest({parent_ids}) as p(id), children c
+ where c.{parent_field} = p.id
+   and .. other conditions on c ..
+ limit {parent_ids.len} + 1
+```
+
+#### Type C
+
+Use when the parent stores a list of its children.
+
+Data needed to generate:
+
+-   children: name of child table
+-   parent_ids: list of parent ids
+-   child\_id_matrix: array of arrays where `child_id_matrix[i]` is an array
+    containing the ids of the children for `parent_id[i]`
+
+The implementation uses a `EntityLink::Parent` for joins of this type.
+
+##### Multiple children per parent
+
+```sql
+select c.*, p.id as parent_id
+  from rows from (unnest({parent_ids}), reduce_dim({child_id_matrix}))
+              as p(id, child_ids)
+       cross join lateral
+       (select *
+          from children c
+         where c.id = any(p.child_ids)
+           and .. other conditions on c ..
+         order by c.{sort_key}
+         limit {first} offset {skip}) c
+ order by c.{sort_key}
+```
+
+Note that `reduce_dim` is a custom function that is not part of [ANSI
+SQL:2016](https://en.wikipedia.org/wiki/SQL:2016) but is needed as there is
+no standard way to decompose a matrix into a table where each row contains
+one row of the matrix. The `ROWS FROM` construct is also not part of ANSI
+SQL.
+
+##### Single child per parent
+
+Not possible with relations of this type
+
+#### Type D
+
+Use when parent is not a list and not derived
+
+Data needed to generate:
+
+-   children: name of child table
+-   parent_ids: list of parent ids
+-   child_ids: list of the id of the child for each parent such that
+    `child_ids[i]` is the id of the child for `parent_id[i]`
+
+The implementation uses a `EntityLink::Parent` for joins of this type.
+
+##### Multiple children per parent
+
+Not possible with relations of this type
+
+##### Single child per parent
+
+```sql
+select c.*, p.id as parent_id
+  from rows from (unnest({parent_ids}), unnest({child_ids})) as p(id, child_id),
+       children c
+ where c.id = p.child_id
+   and .. other conditions on c ..
+```
+
+If the list of unique `child_ids` is small enough, we also add a where
+clause `c.id = any({ unique child_ids })`. The list is small enough if it
+contains fewer than `TYPED_CHILDREN_SET_SIZE` (default: 150) unique child
+ids.
+
+
+The `ROWS FROM` construct is not part of ANSI SQL.
+
+### Handling interfaces
+
+If the GraphQL type of the children is an interface, we need to take
+special care to form correct queries. Whether the parents are
+implementations of an interface or not does not matter, as we will have a
+full list of parents already loaded into memory when we build the query for
+the children. Whether the GraphQL type of the parents is an interface may
+influence from which parent attribute we get child ids for queries of type
+C and D.
+
+When the GraphQL type of the children is an interface, we resolve the
+interface type into the concrete types implementing it, produce a query for
+each concrete child type and combine those queries via `union all`.
+
+Since implementations of the same interface will generally differ in the
+schema they use, we can not form a `union all` of all the data in the
+tables for these concrete types, but have to first query only attributes
+that we know will be common to all entities implementing the interface,
+most notably the `vid` (a unique identifier that identifies the precise
+version of an entity), and then later fill in the details of each entity by
+converting it directly to JSON. A second reason to pass entities as JSON
+from the database is that it is impossible with Diesel to execute queries
+where the number and types of the columns of the result are not known at
+compile time.
+
+We need to to be careful though to not convert to JSONB too early, as that
+is slow when done for large numbers of rows. Deferring conversion is
+responsible for some of the complexity in these queries.
+
+That means that when we deal with children that are an interface, we will
+first select only the following columns from each concrete child type
+(where exactly they come from depends on how the parent/child relationship
+is modeled)
+
+```sql
+select '{__typename}' as entity, c.vid, c.id, c.{sort_key}, p.id as parent_id
+```
+
+and then use that data to fill in the complete details of each concrete
+entity. The query `type_query(children)` is the query from the previous
+section according to the concrete type of `children`, but without the
+`select`, `limit`, `offset` or `order by` clauses. The overall structure of
+this query then is
+
+```sql
+with matches as (
+    select '{children.object}' as entity, c.vid, c.id,
+           c.{sort_key}, p.id as parent_id
+      from .. type_query(children) ..
+     union all
+       .. range over all child types ..
+     order by {sort_key}
+     limit {first} offset {skip})
+select m.*, to_jsonb(c.*) as data
+  from matches m, {children.table} c
+ where c.vid = m.vid and m.entity = '{children.object}'
+ union all
+       .. range over all child tables ..
+ order by {sort_key}
+```
+
+The list `all_parent_ids` must contain the ids of all the parents for which
+we want to find children.
+
+We have one `children` object for each concrete GraphQL type that we need
+to query, where `children.table` is the name of the database table in which
+these entities are stored, and `children.object` is the GraphQL typename
+for these children.
+
+The code uses an `EntityCollection::Window` containing multiple
+`EntityWindow` instances to represent the most general form of querying for
+the children of a set of parents, the query given above.
+
+When there is only one window, we can simplify the above query. The
+simplification basically inlines the `matches` CTE. That is important as
+CTE's in Postgres before Postgres 12 are optimization fences, even when
+they are only used once. We therefore reduce the two queries that Postgres
+executes above to one for the fairly common case that the children are not
+an interface. For each type of parent/child relationship, the resulting
+query is essentially the same as the one given in the section
+`Handling parent/child relationships`, except that the `select` clause is
+changed to `select '{window.child_type}' as entity, to_jsonb(c.*) as data`:
+
+```sql
+select '..' as entity, to_jsonb(e.*) as data, p.id as parent_id
+  from {expand_parents}
+       cross join lateral
+       (select *
+          from children c
+         where {linked_children}
+           and .. other conditions on c ..
+         order by c.{sort_key}
+         limit {first} offset {skip}) c
+ order by c.{sort_key}
+```
+
+Toplevel queries, i.e., queries where we have no parents, and therefore do
+not restrict the children we return by parent ids are represented in the
+code by an `EntityCollection::All`. If the GraphQL type of the children is
+an interface with multiple implementers, we can simplify the query by
+avoiding ranking and just using an ordinary `order by` clause:
+
+```sql
+with matches as (
+  -- Get uniform info for all matching children
+  select '{entity_type}' as entity, id, vid, {sort_key}
+    from {entity_table} c
+   where {query_filter}
+   union all
+     ... range over all entity types
+   order by {sort_key} offset {query.skip} limit {query.first})
+-- Get the full entity for each match
+select m.entity, to_jsonb(c.*) as data, c.id, c.{sort_key}
+  from matches m, {entity_table} c
+ where c.vid = m.vid and m.entity = '{entity_type}'
+ union all
+       ... range over all entity types
+ -- Make sure we return the children for each parent in the correct order
+     order by c.{sort_key}, c.id
+```
+
+And finally, for the very common case of a toplevel GraphQL query for a
+concrete type, not an interface, we can further simplify this, again by
+essentially inlining the `matches` CTE to:
+
+```sql
+select '{entity_type}' as entity, to_jsonb(c.*) as data
+  from {entity_table} c
+ where query.filter()
+ order by {query.order} offset {query.skip} limit {query.first}
+```
+
+## Boring list of possible GraphQL models
+
+These are the eight ways in which a parent/child relationship can be
+modeled. For brevity, the `id` attribute on each parent and child type has
+been left out.
+
+This list assumes that parent and child types are concrete types, i.e., that
+any interfaces involved in this query have already been resolved into their
+implementations and we are dealing with one pair of concrete parent/child
+types.
+
+```graphql
+# Case 1
+type Parent {
+  children: [Child] @derived
+}
+
+type Child {
+  parents: [Parent]
+}
+
+# Case 2
+type Parent {
+  child: Child @derived
+}
+
+type Child {
+  parents: [Parent]
+}
+
+# Case 3
+type Parent {
+  children: [Child] @derived
+}
+
+type Child {
+  parent: Parent
+}
+
+# Case 4
+type Parent {
+  child: Child @derived
+}
+
+type Child {
+  parent: Parent
+}
+
+# Case 5
+type Parent {
+  children: [Child]
+}
+
+type Child {
+  # doesn't matter
+}
+
+# Case 6
+type Parent {
+  children: [Child]
+}
+
+type Child {
+  # doesn't matter
+}
+
+# Case 7
+type Parent {
+  child: Child
+}
+
+type Child {
+  # doesn't matter
+}
+
+# Case 8
+type Parent {
+  child: Child
+}
+
+type Child {
+  # doesn't matter
+}
+```
+
+## Resources
+
+* [PostgreSQL Manual](https://www.postgresql.org/docs/12/index.html)
+* [Browsable SQL Grammar](https://jakewheat.github.io/sql-overview/sql-2016-foundation-grammar.html)
+* [Wikipedia entry on ANSI SQL:2016](https://en.wikipedia.org/wiki/SQL:2016) The actual standard is not freely available
diff --git a/docs/implementation/time-travel.md b/docs/implementation/time-travel.md
new file mode 100644
index 0000000..15433e3
--- /dev/null
+++ b/docs/implementation/time-travel.md
@@ -0,0 +1,133 @@
+# Time-travel queries
+
+Time-travel queries make it possible to query the state of a subgraph at
+a given block. Assume that a subgraph has an `Account` entity defined
+as
+
+```graphql
+type Account @entity {
+    id ID!
+    balance BigInt
+}
+```
+
+The corresponding database table for that will have the form
+```sql
+create table account(
+    vid     int8 primary key,
+    id      text not null,
+    balance numeric,
+    block_range int4range not null,
+    exclude using gist(id with =, block_range with &&)
+);
+```
+
+The `account` table will contain one entry for each version of each account;
+that means that for the account with `id = "1"`, there will be multiple rows
+in the database, but with different block ranges. The exclusion constraint
+makes sure that the block ranges for any given entity do not overlap.
+
+The block range indicates from which block (inclusive) to which block
+(exclusive) an entity version is valid. The most recent version of an entity
+has a block range with an unlimited upper bound. The block range `[7, 15)`
+means that this version of the entity should be used for queries that want
+to know the state of the account if the query asks for block heights between
+7 and 14.
+
+A nice benefit of this approach is that we do not modify the data for
+existing entities. The only attribute of an entity that can ever be modified
+is the range of blocks for which a specific entity version is valid. This
+will become particularly significant once zHeap is fully integrated into
+Postgres (anticipated for Postgres 14)
+
+For background on ranges in Postgres, see the
+[rangetypes](https://www.postgresql.org/docs/9.6/rangetypes.html) and
+[range operators](https://www.postgresql.org/docs/9.6/functions-range.html)
+chapters in the documentation.
+
+### Immutable entities
+
+For entity types declared with `@entity(immutable: true)`, the table has a
+`block$ int not null` column instead of a `block_range` column, where the
+`block$` column stores the value that would be stored in
+`lower(block_range)`. Since the upper bound of the block range for an
+immutable entity is always infinite, a test like `block_range @> $B`, which
+is equivalent to `lower(block_range) <= $B and upper(block_range) > $B`,
+can be simplified to `block$ <= $B`.
+
+The operations in the next section are adjusted accordingly for immutable
+entities.
+
+## Operations
+
+For all operations, we assume that we perform them for block number `B`;
+for most of them we only focus on how the `block_range` is used and
+manipulated. The values for omitted columns should be clear from context.
+
+For deletion and update, we only modify the current version,
+
+### Querying for a point-in-time
+
+Any query that selects entities will have a condition added to it that
+requires that the `block_range` for the entity must include `B`:
+
+```sql
+    select .. from account
+     where ..
+       and block_range @> $B
+```
+
+### Create entity
+
+Creating an entity consist of writing an entry with a block range marking
+it valid from `B` to infinity:
+
+```sql
+    insert into account(id, block_range, ...)
+    values ($ID, '[$B,]', ...);
+```
+
+### Delete entity
+
+Only the current version of an entity can be deleted. For that version,
+deleting it consists of clamping the block range at `B`:
+
+```sql
+    update account
+       set block_range = int4range(lower(block_range), $B)
+     where id = $ID and block_range @> $INTMAX;
+```
+
+Note that this operation is not allowed for immutable entities.
+
+### Update entity
+
+Only the current version of an entity can be updated. An update is performed
+as a deletion followed by an insertion.
+
+Note that this operation is not allowed for immutable entities.
+
+### Rolling back
+
+When we need to revert entity changes that happened for blocks with numbers
+higher than `B`, we delete all entities which would only be valid 'in the
+future', and then open the range of the one entity entry for which the
+range contains `B`, thereby marking it as the current version:
+
+```sql
+    delete from account lower(block_range) >= $B;
+
+    update account
+       set block_range = int4range(lower(block_range), NULL)
+     where block_range @> $B;
+```
+
+## Notes
+
+- It is important to note that the block number does not uniquely identify a
+  block, only the block hash does. But within our database, at any given
+  moment in time, we can identify the block for a given block number and
+  subgraph by following the chain starting at the subgraph's block pointer
+  back. In practice, the query to do that is expensive for blocks far away
+  from the subgraph's head block, but so far we have not had a need for
+  that.
diff --git a/docs/maintenance.md b/docs/maintenance.md
new file mode 100644
index 0000000..350b415
--- /dev/null
+++ b/docs/maintenance.md
@@ -0,0 +1,51 @@
+# Common maintenance tasks
+
+This document explains how to perform common maintenance tasks using
+`graphman`. The `graphman` command is included in the official containers,
+and you can `docker exec` into your `graph-node` container to run it. It
+requires a [configuration
+file](https://github.com/graphprotocol/graph-node/blob/master/docs/config.md). If
+you are not using one already, [these
+instructions](https://github.com/graphprotocol/graph-node/blob/master/docs/config.md#basic-setup)
+show how to create a minimal configuration file that works for `graphman`.
+
+The command pays attention to the `GRAPH_LOG` environment variable, and
+will print normal `graph-node` logs on stdout. You can turn them off by
+doing `unset GRAPH_LOG` before running `graphman`.
+
+A simple way to check that `graphman` is set up correctly is to run
+`graphman info some/subgraph`. If that subgraph exists, the command will
+print basic information about it, like the namespace in Postgres that
+contains the data for the underlying deployment.
+
+## Removing unused deployments
+
+When a new version of a subgraph is deployed, the new deployment displaces
+the old one when it finishes syncing. At that point, the system will not
+use the old deployment anymore, but its data is still in the database.
+
+These unused deployments can be removed by running `graphman unused record`
+which compiles a list of unused deployments. That list can then be
+inspected with `graphman unused list -e`. The data for these unused
+deployments can then be removed with `graphman unused remove` which will
+only remove the deployments that have previously marked for removal with
+`record`.
+
+## Removing a subgraph
+
+The command `graphman remove some/subgraph` will remove the mapping from
+the given name to the underlying deployment. If no other subgraph name uses
+that deployment, it becomes eligible for removal, and the steps for
+removing unused deployments will delete its data.
+
+## Modifying assignments
+
+Each deployment is assigned to a specific `graph-node` instance for
+indexing. It is possible to change the `graph-node` instance that indexes a
+given subgraph with `graphman reassign`. To permanently stop indexing it,
+use `graphman unassign`. Unfortunately, `graphman` does not currently allow
+creating an assignment for an unassigned deployment; it is possible to
+assign a deployment to a node that does not exist, which will also stop
+indexing it, for example by assigning it to a node `paused_<real node
+name>`. Indexing can then be resumed by reassigning the deployment to an
+existing node.
diff --git a/docs/metrics.md b/docs/metrics.md
new file mode 100644
index 0000000..7a545b1
--- /dev/null
+++ b/docs/metrics.md
@@ -0,0 +1,69 @@
+graph-node provides the following metrics via Prometheus endpoint on 8040 port by default:
+- `deployment_block_processing_duration`
+Measures **duration of block processing** for a subgraph deployment
+- `deployment_block_trigger_count`
+Measures the **number of triggers in each** block for a subgraph deployment
+- `deployment_count` 
+Counts the number of deployments currently being indexed by the graph-node.
+- `deployment_eth_rpc_errors`
+Counts **eth** **rpc request errors** for a subgraph deployment
+- `deployment_eth_rpc_request_duration`
+Measures **eth** **rpc request duration** for a subgraph deployment
+- `deployment_failed`
+Boolean gauge to indicate **whether the deployment has failed** (1 == failed)
+- `deployment_handler_execution_time`
+Measures the **execution time for handlers**
+- `deployment_head`
+Track the **head block number** for a deployment. Example:
+
+```protobuf
+deployment_head{deployment="QmaeWFYbPwmXEk7UuACmkqgPq2Pba5t2RYdJtEyvAUmrxg",network="mumbai",shard="primary"} 19509077
+```
+
+- `deployment_host_fn_execution_time`
+Measures the **execution time for host functions**
+- `deployment_reverted_blocks`
+Track the **last reverted block** for a subgraph deployment
+- `deployment_sync_secs`
+total **time spent syncing**
+- `deployment_transact_block_operations_duration`
+Measures **duration of commiting all the entity operations** in a block and **updating the subgraph pointer**
+- `deployment_trigger_processing_duration`
+Measures **duration of trigger processing** for a subgraph deployment
+- `eth_rpc_errors`
+Counts **eth rpc request errors**
+- `eth_rpc_request_duration`
+Measures **eth rpc request duration**
+- `ethereum_chain_head_number`
+Block **number of the most recent block synced from Ethereum**. Example:
+
+```protobuf
+ethereum_chain_head_number{network="mumbai"} 20045294
+```
+
+- `metrics_register_errors`
+Counts **Prometheus metrics register errors**
+- `metrics_unregister_errors`
+Counts **Prometheus metrics unregister errors**
+- `query_cache_status_count`
+Count **toplevel GraphQL fields executed** and their cache status
+- `query_effort_ms`
+Moving **average of time spent running queries**
+- `query_execution_time`
+**Execution time for successful GraphQL queries**
+- `query_result_max`
+the **maximum size of a query result** (in CacheWeight)
+- `query_result_size` 
+the **size of the result of successful GraphQL queries** (in CacheWeight)
+- `query_semaphore_wait_ms`
+Moving **average of time spent on waiting for postgres query semaphore**
+- `query_kill_rate`
+The rate at which the load manager kills queries
+- `registered_metrics`
+Tracks the **number of registered metrics** on the node
+- `store_connection_checkout_count`
+The **number of Postgres connections** currently **checked out**
+- `store_connection_error_count`
+The **number of Postgres connections errors**
+- `store_connection_wait_time_ms`
+**Average connection wait time**
diff --git a/docs/subgraph-manifest.md b/docs/subgraph-manifest.md
new file mode 100644
index 0000000..d1ba64d
--- /dev/null
+++ b/docs/subgraph-manifest.md
@@ -0,0 +1,158 @@
+# Subgraph Manifest
+##### v.0.0.4
+
+## 1.1 Overview
+The subgraph manifest specifies all the information required to index and query a specific subgraph. This is the entry point to your subgraph.
+
+The subgraph manifest, and all the files linked from it, is what is deployed to IPFS and hashed to produce a subgraph ID that can be referenced and used to retrieve your subgraph in The Graph.
+
+## 1.2 Format
+Any data format that has a well-defined 1:1 mapping with the [IPLD Canonical Format](https://github.com/ipld/specs/) may be used to define a subgraph manifest. This includes YAML and JSON. Examples in this document are in YAML.
+
+## 1.3 Top-Level API
+
+| Field  | Type | Description   |
+| --- | --- | --- |
+| **specVersion** | *String*   | A Semver version indicating which version of this API is being used.|
+| **schema**   | [*Schema*](#14-schema) | The GraphQL schema of this subgraph.|
+| **description**   | *String* | An optional description of the subgraph's purpose. |
+| **repository**   | *String* | An optional link to where the subgraph lives. |
+| **graft** | optional [*Graft Base*](#18-graft-base) | An optional base to graft onto. |
+| **dataSources**| [*Data Source Spec*](#15-data-source)| Each data source spec defines the data that will be ingested as well as the transformation logic to derive the state of the subgraph's entities based on the source data.|
+| **templates** | [*Data Source Templates Spec*](#17-data-source-templates) | Each data source template defines a data source that can be created dynamically from the mappings. |
+| **features** | optional [*[String]*](#19-features) | A list of feature names used by the subgraph. |
+
+## 1.4 Schema
+
+| Field | Type | Description |
+| --- | --- | --- |
+| **file**| [*Path*](#16-path) | The path of the GraphQL IDL file, either local or on IPFS. |
+
+## 1.5 Data Source
+
+| Field | Type | Description |
+| --- | --- | --- |
+| **kind** | *String | The type of data source. Possible values: *ethereum/contract*.|
+| **name** | *String* | The name of the source data. Will be used to generate APIs in the mapping and also for self-documentation purposes. |
+| **network** | *String* | For blockchains, this describes which network the subgraph targets. For Ethereum, this can be any of "mainnet", "rinkeby", "kovan", "ropsten", "goerli", "poa-core", "poa-sokol", "xdai", "matic", "mumbai", "fantom", "bsc" or "clover". Developers could look for an up to date list in the graph-cli [*code*](https://github.com/graphprotocol/graph-cli/blob/master/src/commands/init.js#L43-L57).|
+| **source** | [*EthereumContractSource*](#151-ethereumcontractsource) | The source data on a blockchain such as Ethereum. |
+| **mapping** | [*Mapping*](#152-mapping) | The transformation logic applied to the data prior to being indexed. |
+
+### 1.5.1 EthereumContractSource
+
+| Field | Type | Description |
+| --- | --- | --- |
+| **address** | *String* | The address of the source data in its respective blockchain. |
+| **abi** | *String* | The name of the ABI for this Ethereum contract. See `abis` in the `mapping` manifest. |
+| **startBlock** | optional *BigInt* | The block to start indexing this data source from. |
+
+
+### 1.5.2 Mapping
+The `mapping` field may be one of the following supported mapping manifests:
+ - [Ethereum Mapping](#1521-ethereum-mapping)
+
+#### 1.5.2.1 Ethereum Mapping
+
+| Field | Type | Description |
+| --- | --- | --- |
+| **kind** | *String* | Must be "ethereum/events" for Ethereum Events Mapping. |
+| **apiVersion** | *String* | Semver string of the version of the Mappings API that will be used by the mapping script. |
+| **language** | *String* | The language of the runtime for the Mapping API. Possible values: *wasm/assemblyscript*. |
+| **entities** | *[String]* | A list of entities that will be ingested as part of this mapping. Must correspond to names of entities in the GraphQL IDL. |
+| **abis** | *ABI* | ABIs for the contract classes that should be generated in the Mapping ABI. Name is also used to reference the ABI elsewhere in the manifest. |
+| **eventHandlers** | optional *EventHandler* | Handlers for specific events, which will be defined in the mapping script. |
+| **callHandlers** | optional *CallHandler* | A list of functions that will trigger a  handler and the name of the corresponding handlers in the mapping. |
+| **blockHandlers** | optional *BlockHandler* | Defines block filters and handlers to process matching blocks. |
+| **file** | [*Path*](#16-path) | The path of the mapping script. |
+
+> **Note:** Each mapping is required to supply one or more handler type, available types: `EventHandler`, `CallHandler`, or `BlockHandler`.
+
+#### 1.5.2.2 EventHandler
+
+| Field | Type | Description |
+| --- | --- | --- |
+| **event** | *String* | An identifier for an event that will be handled in the mapping script. For Ethereum contracts, this must be the full event signature to distinguish from events that may share the same name. No alias types can be used. For example, uint will not work, uint256 must be used.|
+| **handler** | *String* | The name of an exported function in the mapping script that should handle the specified event. |
+| **topic0** | optional *String* | A `0x` prefixed hex string. If provided, events whose topic0 is equal to this value will be processed by the given handler. When topic0 is provided, _only_ the topic0 value will be matched, and not the hash of the event signature. This is useful for processing anonymous events in Solidity, which can have their topic0 set to anything.  By default, topic0 is equal to the hash of the event signature. |
+
+#### 1.5.2.3 CallHandler
+
+| Field | Type | Description |
+| --- | --- | --- |
+| **function** | *String* | An identifier for a function that will be handled in the mapping script. For Ethereum contracts, this is the normalized function signature to filter calls by. |
+| **handler** | *String* | The name of an exported function in the mapping script that should handle the specified event. |
+
+#### 1.5.2.4 BlockHandler
+
+| Field | Type | Description |
+| --- | --- | --- |
+| **handler** | *String* | The name of an exported function in the mapping script that should handle the specified event. |
+| **filter** | optional *BlockHandlerFilter* | Definition of the filter to apply. If none is supplied, the handler will be called on every block. |
+
+#### 1.5.2.4.1 BlockHandlerFilter
+
+| Field | Type | Description |
+| --- | --- | --- |
+| **kind** | *String* | The selected block handler filter. Only option for now: `call`: This will only run the handler if the block contains at least one call to the data source contract. |
+
+## 1.6 Path
+A path has one field `path`, which either refers to a path of a file on the local dev machine or an [IPLD link](https://github.com/ipld/specs/).
+
+When using the Graph-CLI, local paths may be used during development, and then, the tool will take care of deploying linked files to IPFS and replacing the local paths with IPLD links at deploy time.
+
+| Field | Type | Description |
+| --- | --- | --- |
+| **path** | *String or [IPLD Link](https://github.com/ipld/specs/)* | A path to a local file or IPLD link. |
+
+## 1.7 Data Source Templates
+A data source template has all of the fields of a normal data source, except it does not include a contract address under `source`. The address is a parameter that can later be provided when creating a dynamic data source from the template.
+```yml
+# ...
+templates:
+  - name: Exchange
+    kind: ethereum/contract
+    network: mainnet
+    source:
+      abi: Exchange
+    mapping:
+      kind: ethereum/events
+      apiVersion: 0.0.1
+      language: wasm/assemblyscript
+      file: ./src/mappings/exchange.ts
+      entities:
+        - Exchange
+      abis:
+        - name: Exchange
+          file: ./abis/exchange.json
+      eventHandlers:
+        - event: TokenPurchase(address,uint256,uint256)
+          handler: handleTokenPurchase
+```
+
+## 1.8 Graft Base
+A subgraph can be _grafted_ on top of another subgraph, meaning that, rather than starting to index the subgraph from the genesis block, the subgraph is initialized with a copy of the given base subgraph, and indexing resumes from the given block.
+
+| Field | Type | Description |
+| --- | --- | --- |
+| **base** | *String* | The subgraph ID of the base subgraph |
+| **block** | *BigInt* | The block number up to which to use data from the base subgraph |
+
+## 1.9 Features
+
+Starting from `specVersion` `0.0.4`, a subgraph must declare all _feature_ names it uses to be
+considered valid.
+
+A Graph Node instance will **reject** a subgraph deployment if:
+- the `specVersion` is equal to or higher than `0.0.4` **AND**
+- it hasn't explicitly declared a feature it uses.
+
+No validation errors will happen if a feature is declared but not used.
+
+These are the currently available features and their names:
+
+| Feature                    | Name                      |
+| ---                        | ---                       |
+| Non-fatal errors           | `nonFatalErrors`          |
+| Full-text Search           | `fullTextSearch`          |
+| Grafting                   | `grafting`                |
+| IPFS on Ethereum Contracts | `ipfsOnEthereumContracts` |
diff --git a/graph/Cargo.toml b/graph/Cargo.toml
new file mode 100644
index 0000000..6062689
--- /dev/null
+++ b/graph/Cargo.toml
@@ -0,0 +1,73 @@
+[package]
+name = "graph"
+version = "0.27.0"
+edition = "2021"
+
+[dependencies]
+anyhow = "1.0"
+async-trait = "0.1.50"
+async-stream = "0.3"
+atomic_refcell = "0.1.8"
+bigdecimal = { version = "0.1.0", features = ["serde"] }
+bytes = "1.0.1"
+cid = "0.8.3"
+diesel = { version = "1.4.8", features = ["postgres", "serde_json", "numeric", "r2d2", "chrono"] }
+diesel_derives = "1.4"
+chrono = "0.4.22"
+envconfig = "0.10.0"
+Inflector = "0.11.3"
+isatty = "0.1.9"
+reqwest = { version = "0.11.2", features = ["json", "stream", "multipart"] }
+ethabi = "17.2"
+hex = "0.4.3"
+http = "0.2.3"
+futures = "0.1.21"
+graphql-parser = "0.4.0"
+lazy_static = "1.4.0"
+num-bigint = { version = "^0.2.6", features = ["serde"] }
+num_cpus = "1.13.1"
+num-traits = "0.2.15"
+rand = "0.8.4"
+semver = { version = "1.0.12", features = ["serde"] }
+serde = { version = "1.0.126", features = ["rc"] }
+serde_derive = "1.0.125"
+serde_json = { version = "1.0", features = ["arbitrary_precision"] }
+serde_yaml = "0.8"
+slog = { version = "2.7.0", features = ["release_max_level_trace", "max_level_trace"] }
+stable-hash_legacy = { version = "0.3.3", package = "stable-hash" }
+stable-hash = { version = "0.4.2"}
+strum = "0.21.0"
+strum_macros = "0.21.1"
+slog-async = "2.5.0"
+slog-envlogger = "2.1.0"
+slog-term = "2.7.0"
+petgraph = "0.6.2"
+tiny-keccak = "1.5.0"
+tokio = { version = "1.16.1", features = ["time", "sync", "macros", "test-util", "rt-multi-thread", "parking_lot"] }
+tokio-stream = { version = "0.1.9", features = ["sync"] }
+tokio-retry = "0.3.0"
+url = "2.2.1"
+prometheus = "0.13.2"
+priority-queue = "0.7.0"
+tonic = { version = "0.7.1", features = ["tls-roots","compression"] }
+prost = "0.10.4"
+prost-types = "0.10.1"
+
+futures03 = { version = "0.3.1", package = "futures", features = ["compat"] }
+wasmparser = "0.78.2"
+thiserror = "1.0.25"
+parking_lot = "0.12.1"
+itertools = "0.10.3"
+
+# Our fork contains patches to make some fields optional for Celo and Fantom compatibility.
+# Without the "arbitrary_precision" feature, we get the error `data did not match any variant of untagged enum Response`.
+web3 = { git = "https://github.com/graphprotocol/rust-web3", branch = "graph-patches-onto-0.18", features = ["arbitrary_precision"] }
+serde_plain = "1.0.0"
+
+[dev-dependencies]
+test-store = { path = "../store/test-store" }
+clap = { version = "3.2.22", features = ["derive", "env"] }
+maplit = "1.0.2"
+
+[build-dependencies]
+tonic-build = { version = "0.7.2", features = ["prost","compression"] }
diff --git a/graph/build.rs b/graph/build.rs
new file mode 100644
index 0000000..67e9920
--- /dev/null
+++ b/graph/build.rs
@@ -0,0 +1,20 @@
+fn main() {
+    println!("cargo:rerun-if-changed=proto");
+    tonic_build::configure()
+        .out_dir("src/firehose")
+        .compile(
+            &[
+                "proto/firehose.proto",
+                "proto/ethereum/transforms.proto",
+                "proto/near/transforms.proto",
+                "proto/cosmos/transforms.proto",
+            ],
+            &["proto"],
+        )
+        .expect("Failed to compile Firehose proto(s)");
+
+    tonic_build::configure()
+        .out_dir("src/substreams")
+        .compile(&["proto/substreams.proto"], &["proto"])
+        .expect("Failed to compile Substreams proto(s)");
+}
diff --git a/graph/examples/stress.rs b/graph/examples/stress.rs
new file mode 100644
index 0000000..0475437
--- /dev/null
+++ b/graph/examples/stress.rs
@@ -0,0 +1,695 @@
+use std::alloc::{GlobalAlloc, Layout, System};
+use std::collections::{BTreeMap, HashMap};
+use std::iter::FromIterator;
+use std::sync::atomic::{AtomicUsize, Ordering::SeqCst};
+use std::sync::Arc;
+use std::time::{Duration, Instant};
+
+use clap::Parser;
+use graph::data::value::{Object, Word};
+use graph::object;
+use graph::prelude::{lazy_static, q, r, BigDecimal, BigInt, QueryResult};
+use rand::SeedableRng;
+use rand::{rngs::SmallRng, Rng};
+
+use graph::util::cache_weight::CacheWeight;
+use graph::util::lfu_cache::LfuCache;
+
+// Use a custom allocator that tracks how much memory the program
+// has allocated overall
+
+struct Counter;
+
+static ALLOCATED: AtomicUsize = AtomicUsize::new(0);
+
+lazy_static! {
+    // Set 'MAP_MEASURE' to something to use the `CacheWeight` defined here
+    // in the `btree` module for `BTreeMap`. If this is not set, use the
+    // estimate from `graph::util::cache_weight`
+    static ref MAP_MEASURE: bool = std::env::var("MAP_MEASURE").ok().is_some();
+
+    // When running the `valuemap` test for BTreeMap, put maps into the
+    // values of the generated maps
+    static ref NESTED_MAP: bool =  std::env::var("NESTED_MAP").ok().is_some();
+}
+// Yes, a global variable. It gets set at the beginning of `main`
+static mut PRINT_SAMPLES: bool = false;
+
+/// Helpers to estimate the size of a `BTreeMap`. Everything in this module,
+/// except for `node_size()` is copied from `std::collections::btree`.
+///
+/// It is not possible to know how many nodes a BTree has, as
+/// `BTreeMap` does not expose its depth or any other detail about
+/// the true size of the BTree. We estimate that size, assuming the
+/// average case, i.e., a BTree where every node has the average
+/// between the minimum and maximum number of entries per node, i.e.,
+/// the average of (B-1) and (2*B-1) entries, which we call
+/// `NODE_FILL`. The number of leaf nodes in the tree is then the
+/// number of entries divided by `NODE_FILL`, and the number of
+/// interior nodes can be determined by dividing the number of nodes
+/// at the child level by `NODE_FILL`
+
+/// The other difficulty is that the structs with which `BTreeMap`
+/// represents internal and leaf nodes are not public, so we can't
+/// get their size with `std::mem::size_of`; instead, we base our
+/// estimates of their size on the current `std` code, assuming that
+/// these structs will not change
+
+mod btree {
+    use std::mem;
+    use std::{mem::MaybeUninit, ptr::NonNull};
+
+    const B: usize = 6;
+    const CAPACITY: usize = 2 * B - 1;
+
+    /// Assume BTree nodes are this full (average of minimum and maximum fill)
+    const NODE_FILL: usize = ((B - 1) + (2 * B - 1)) / 2;
+
+    type BoxedNode<K, V> = NonNull<LeafNode<K, V>>;
+
+    struct InternalNode<K, V> {
+        _data: LeafNode<K, V>,
+
+        /// The pointers to the children of this node. `len + 1` of these are considered
+        /// initialized and valid, except that near the end, while the tree is held
+        /// through borrow type `Dying`, some of these pointers are dangling.
+        _edges: [MaybeUninit<BoxedNode<K, V>>; 2 * B],
+    }
+
+    struct LeafNode<K, V> {
+        /// We want to be covariant in `K` and `V`.
+        _parent: Option<NonNull<InternalNode<K, V>>>,
+
+        /// This node's index into the parent node's `edges` array.
+        /// `*node.parent.edges[node.parent_idx]` should be the same thing as `node`.
+        /// This is only guaranteed to be initialized when `parent` is non-null.
+        _parent_idx: MaybeUninit<u16>,
+
+        /// The number of keys and values this node stores.
+        _len: u16,
+
+        /// The arrays storing the actual data of the node. Only the first `len` elements of each
+        /// array are initialized and valid.
+        _keys: [MaybeUninit<K>; CAPACITY],
+        _vals: [MaybeUninit<V>; CAPACITY],
+    }
+
+    pub fn node_size<K, V>(map: &std::collections::BTreeMap<K, V>) -> usize {
+        // Measure the size of internal and leaf nodes directly - that's why
+        // we copied all this code from `std`
+        let ln_sz = mem::size_of::<LeafNode<K, V>>();
+        let in_sz = mem::size_of::<InternalNode<K, V>>();
+
+        // Estimate the number of internal and leaf nodes based on the only
+        // thing we can measure about a BTreeMap, the number of entries in
+        // it, and use our `NODE_FILL` assumption to estimate how the tree
+        // is structured. We try to be very good for small maps, since
+        // that's what we use most often in our code. This estimate is only
+        // for the indirect weight of the `BTreeMap`
+        let (leaves, int_nodes) = if map.is_empty() {
+            // An empty tree has no indirect weight
+            (0, 0)
+        } else if map.len() <= CAPACITY {
+            // We only have the root node
+            (1, 0)
+        } else {
+            // Estimate based on our `NODE_FILL` assumption
+            let leaves = map.len() / NODE_FILL + 1;
+            let mut prev_level = leaves / NODE_FILL + 1;
+            let mut int_nodes = prev_level;
+            while prev_level > 1 {
+                int_nodes += prev_level;
+                prev_level = prev_level / NODE_FILL + 1;
+            }
+            (leaves, int_nodes)
+        };
+
+        let sz = leaves * ln_sz + int_nodes * in_sz;
+
+        if unsafe { super::PRINT_SAMPLES } {
+            println!(
+                " btree: leaves={} internal={} sz={} ln_sz={} in_sz={} len={}",
+                leaves,
+                int_nodes,
+                sz,
+                ln_sz,
+                in_sz,
+                map.len()
+            );
+        }
+        sz
+    }
+}
+
+struct MapMeasure<K, V>(BTreeMap<K, V>);
+
+impl<K, V> Default for MapMeasure<K, V> {
+    fn default() -> MapMeasure<K, V> {
+        MapMeasure(BTreeMap::new())
+    }
+}
+
+impl<K: CacheWeight, V: CacheWeight> CacheWeight for MapMeasure<K, V> {
+    fn indirect_weight(&self) -> usize {
+        if *MAP_MEASURE {
+            let kv_sz = self
+                .0
+                .iter()
+                .map(|(key, value)| key.indirect_weight() + value.indirect_weight())
+                .sum::<usize>();
+            let node_sz = btree::node_size(&self.0);
+            kv_sz + node_sz
+        } else {
+            self.0.indirect_weight()
+        }
+    }
+}
+
+unsafe impl GlobalAlloc for Counter {
+    unsafe fn alloc(&self, layout: Layout) -> *mut u8 {
+        let ret = System.alloc(layout);
+        if !ret.is_null() {
+            ALLOCATED.fetch_add(layout.size(), SeqCst);
+        }
+        ret
+    }
+
+    unsafe fn dealloc(&self, ptr: *mut u8, layout: Layout) {
+        System.dealloc(ptr, layout);
+        ALLOCATED.fetch_sub(layout.size(), SeqCst);
+    }
+}
+
+#[global_allocator]
+static A: Counter = Counter;
+
+// Setup to make checking different data types and how they interact
+// with cache size easier
+
+/// The template of an object we want to cache
+trait Template: CacheWeight {
+    // Create a new test object
+    fn create(size: usize, rng: Option<&mut SmallRng>) -> Self;
+
+    // Return a sample of this test object of the given `size`. There's no
+    // fixed definition of 'size', other than that smaller sizes will
+    // take less memory than larger ones
+    fn sample(&self, size: usize, rng: Option<&mut SmallRng>) -> Box<Self>;
+}
+
+/// Template for testing caching of `String`
+impl Template for String {
+    fn create(size: usize, _rng: Option<&mut SmallRng>) -> Self {
+        let mut s = String::with_capacity(size);
+        for _ in 0..size {
+            s.push('x');
+        }
+        s
+    }
+    fn sample(&self, size: usize, _rng: Option<&mut SmallRng>) -> Box<Self> {
+        Box::new(self[0..size].into())
+    }
+}
+
+/// Template for testing caching of `String`
+impl Template for Word {
+    fn create(size: usize, _rng: Option<&mut SmallRng>) -> Self {
+        let mut s = String::with_capacity(size);
+        for _ in 0..size {
+            s.push('x');
+        }
+        Word::from(s)
+    }
+
+    fn sample(&self, size: usize, _rng: Option<&mut SmallRng>) -> Box<Self> {
+        Box::new(self[0..size].into())
+    }
+}
+
+/// Template for testing caching of `Vec<usize>`
+impl Template for Vec<usize> {
+    fn create(size: usize, _rng: Option<&mut SmallRng>) -> Self {
+        Vec::from_iter(0..size)
+    }
+    fn sample(&self, size: usize, _rng: Option<&mut SmallRng>) -> Box<Self> {
+        Box::new(self[0..size].into())
+    }
+}
+
+impl Template for BigInt {
+    fn create(size: usize, rng: Option<&mut SmallRng>) -> Self {
+        let f = match rng {
+            Some(rng) => {
+                let mag = rng.gen_range(1..100);
+                if rng.gen_bool(0.5) {
+                    mag
+                } else {
+                    -mag
+                }
+            }
+            None => 1,
+        };
+        BigInt::from(3u64).pow(size as u8) * BigInt::from(f)
+    }
+
+    fn sample(&self, size: usize, rng: Option<&mut SmallRng>) -> Box<Self> {
+        Box::new(Self::create(size, rng))
+    }
+}
+
+impl Template for BigDecimal {
+    fn create(size: usize, mut rng: Option<&mut SmallRng>) -> Self {
+        let f = match rng.as_deref_mut() {
+            Some(rng) => {
+                let mag = rng.gen_range(1i32..100);
+                if rng.gen_bool(0.5) {
+                    mag
+                } else {
+                    -mag
+                }
+            }
+            None => 1,
+        };
+        let exp = match rng {
+            Some(rng) => rng.gen_range(-100..=100),
+            None => 1,
+        };
+        let bi = BigInt::from(3u64).pow(size as u8) * BigInt::from(f);
+        BigDecimal::new(bi, exp)
+    }
+
+    fn sample(&self, size: usize, rng: Option<&mut SmallRng>) -> Box<Self> {
+        Box::new(Self::create(size, rng))
+    }
+}
+
+/// Template for testing caching of `HashMap<String, String>`
+impl Template for HashMap<String, String> {
+    fn create(size: usize, _rng: Option<&mut SmallRng>) -> Self {
+        let mut map = HashMap::new();
+        for i in 0..size {
+            map.insert(format!("key{}", i), format!("value{}", i));
+        }
+        map
+    }
+
+    fn sample(&self, size: usize, _rng: Option<&mut SmallRng>) -> Box<Self> {
+        Box::new(HashMap::from_iter(
+            self.iter()
+                .take(size)
+                .map(|(k, v)| (k.to_owned(), v.to_owned())),
+        ))
+    }
+}
+
+fn make_object(size: usize, mut rng: Option<&mut SmallRng>) -> Object {
+    let mut obj = Vec::new();
+    let modulus = if *NESTED_MAP { 8 } else { 7 };
+
+    for i in 0..size {
+        let kind = rng
+            .as_deref_mut()
+            .map(|rng| rng.gen_range(0..modulus))
+            .unwrap_or(i % modulus);
+
+        let value = match kind {
+            0 => r::Value::Boolean(i % 11 > 5),
+            1 => r::Value::Int((i as i32).into()),
+            2 => r::Value::Null,
+            3 => r::Value::Float(i as f64 / 17.0),
+            4 => r::Value::Enum(format!("enum{}", i)),
+            5 => r::Value::String(format!("0x0000000000000000000000000000000000000000{}", i)),
+            6 => {
+                let vals = (0..(i % 51)).map(|i| r::Value::String(format!("list{}", i)));
+                r::Value::List(Vec::from_iter(vals))
+            }
+            7 => {
+                let mut obj = Vec::new();
+                for j in 0..(i % 51) {
+                    obj.push((format!("key{}", j), r::Value::String(format!("value{}", j))));
+                }
+                r::Value::Object(Object::from_iter(obj))
+            }
+            _ => unreachable!(),
+        };
+
+        let key = rng.as_deref_mut().map(|rng| rng.gen()).unwrap_or(i) % modulus;
+        obj.push((format!("val{}", key), value));
+    }
+    Object::from_iter(obj)
+}
+
+fn make_domains(size: usize, _rng: Option<&mut SmallRng>) -> Object {
+    let owner = object! {
+        owner: object! {
+            id: "0xe8d391ef649a6652b9047735f6c0d48b6ae751df",
+            name: "36190.eth"
+        }
+    };
+
+    let domains: Vec<_> = (0..size).map(|_| owner.clone()).collect();
+    Object::from_iter([("domains".to_string(), r::Value::List(domains))])
+}
+
+/// Template for testing caching of `Object`
+impl Template for Object {
+    fn create(size: usize, rng: Option<&mut SmallRng>) -> Self {
+        make_object(size, rng)
+    }
+
+    fn sample(&self, size: usize, rng: Option<&mut SmallRng>) -> Box<Self> {
+        // If the user specified '--fixed', don't build a new map every call
+        // since that can be slow
+        if rng.is_none() {
+            Box::new(Object::from_iter(
+                self.iter()
+                    .take(size)
+                    .map(|(k, v)| (k.to_owned(), v.to_owned())),
+            ))
+        } else {
+            Box::new(make_object(size, rng))
+        }
+    }
+}
+
+/// Template for testing caching of `QueryResult`
+impl Template for QueryResult {
+    fn create(size: usize, rng: Option<&mut SmallRng>) -> Self {
+        QueryResult::new(make_domains(size, rng))
+    }
+
+    fn sample(&self, size: usize, rng: Option<&mut SmallRng>) -> Box<Self> {
+        // If the user specified '--fixed', don't build a new map every call
+        // since that can be slow
+        if rng.is_none() {
+            Box::new(QueryResult::new(Object::from_iter(
+                self.data()
+                    .unwrap()
+                    .iter()
+                    .take(size)
+                    .map(|(k, v)| (k.to_owned(), v.to_owned())),
+            )))
+        } else {
+            Box::new(QueryResult::new(make_domains(size, rng)))
+        }
+    }
+}
+
+type ValueMap = MapMeasure<String, q::Value>;
+
+impl ValueMap {
+    fn make_map(size: usize, mut rng: Option<&mut SmallRng>) -> Self {
+        let mut map = BTreeMap::new();
+        let modulus = if *NESTED_MAP { 9 } else { 8 };
+
+        for i in 0..size {
+            let kind = rng
+                .as_deref_mut()
+                .map(|rng| rng.gen_range(0..modulus))
+                .unwrap_or(i % modulus);
+
+            let value = match kind {
+                0 => q::Value::Boolean(i % 11 > 5),
+                1 => q::Value::Int((i as i32).into()),
+                2 => q::Value::Null,
+                3 => q::Value::Float(i as f64 / 17.0),
+                4 => q::Value::Enum(format!("enum{}", i)),
+                5 => q::Value::String(format!("string{}", i)),
+                6 => q::Value::Variable(format!("var{}", i)),
+                7 => {
+                    let vals = (0..(i % 51)).map(|i| q::Value::String(format!("list{}", i)));
+                    q::Value::List(Vec::from_iter(vals))
+                }
+                8 => {
+                    let mut map = BTreeMap::new();
+                    for j in 0..(i % 51) {
+                        map.insert(format!("key{}", j), q::Value::String(format!("value{}", j)));
+                    }
+                    q::Value::Object(map)
+                }
+                _ => unreachable!(),
+            };
+
+            let key = rng.as_deref_mut().map(|rng| rng.gen()).unwrap_or(i) % modulus;
+            map.insert(format!("val{}", key), value);
+        }
+        MapMeasure(map)
+    }
+}
+
+/// Template for testing roughly a GraphQL response, i.e., a `BTreeMap<String, Value>`
+impl Template for ValueMap {
+    fn create(size: usize, rng: Option<&mut SmallRng>) -> Self {
+        Self::make_map(size, rng)
+    }
+
+    fn sample(&self, size: usize, rng: Option<&mut SmallRng>) -> Box<Self> {
+        // If the user specified '--fixed', don't build a new map every call
+        // since that can be slow
+        if rng.is_none() {
+            Box::new(MapMeasure(BTreeMap::from_iter(
+                self.0
+                    .iter()
+                    .take(size)
+                    .map(|(k, v)| (k.to_owned(), v.to_owned())),
+            )))
+        } else {
+            Box::new(Self::make_map(size, rng))
+        }
+    }
+}
+
+type UsizeMap = MapMeasure<usize, usize>;
+
+impl UsizeMap {
+    fn make_map(size: usize, mut rng: Option<&mut SmallRng>) -> Self {
+        let mut map = BTreeMap::new();
+        for i in 0..size {
+            let key = rng.as_deref_mut().map(|rng| rng.gen()).unwrap_or(2 * i);
+            map.insert(key, i * 3);
+        }
+        MapMeasure(map)
+    }
+}
+
+/// Template for testing roughly a GraphQL response, i.e., a `BTreeMap<String, Value>`
+impl Template for UsizeMap {
+    fn create(size: usize, rng: Option<&mut SmallRng>) -> Self {
+        Self::make_map(size, rng)
+    }
+
+    fn sample(&self, size: usize, rng: Option<&mut SmallRng>) -> Box<Self> {
+        // If the user specified '--fixed', don't build a new map every call
+        // since that can be slow
+        if rng.is_none() {
+            Box::new(MapMeasure(BTreeMap::from_iter(
+                self.0
+                    .iter()
+                    .take(size)
+                    .map(|(k, v)| (k.to_owned(), v.to_owned())),
+            )))
+        } else {
+            Box::new(Self::make_map(size, rng))
+        }
+    }
+}
+
+/// Wrapper around our template objects; we always put them behind an `Arc`
+/// so that dropping the template object frees the entire object rather than
+/// leaving part of it in the cache. That's also how the production code
+/// uses this cache: objects always wrapped in an `Arc`
+struct Entry<T>(Arc<T>);
+
+impl<T: Template> Default for Entry<T> {
+    fn default() -> Self {
+        Self(Arc::new(T::create(0, None)))
+    }
+}
+
+impl<T: Template> CacheWeight for Entry<T> {
+    fn indirect_weight(&self) -> usize {
+        // Account for the two pointers the Arc uses for keeping reference
+        // counts. Including that in the weight is only correct in this
+        // test, since we know we never have more than one reference throug
+        // the `Arc`
+        self.0.weight() + 2 * std::mem::size_of::<usize>()
+    }
+}
+
+impl<T: Template> From<T> for Entry<T> {
+    fn from(templ: T) -> Self {
+        Self(Arc::new(templ))
+    }
+}
+
+// Command line arguments
+#[derive(Parser)]
+#[clap(name = "stress", about = "Stress test for the LFU Cache")]
+struct Opt {
+    /// Number of cache evictions and insertions
+    #[clap(short, long, default_value = "1000")]
+    niter: usize,
+    /// Print this many intermediate messages
+    #[clap(short, long, default_value = "10")]
+    print_count: usize,
+    /// Use objects of size 0 up to this size, chosen unifromly randomly
+    /// unless `--fixed` is given
+    #[clap(short, long, default_value = "1024")]
+    obj_size: usize,
+    #[clap(short, long, default_value = "1000000")]
+    cache_size: usize,
+    #[clap(short, long, default_value = "vec")]
+    template: String,
+    #[clap(short, long)]
+    samples: bool,
+    /// Always use objects of size `--obj-size`
+    #[clap(short, long)]
+    fixed: bool,
+    /// The seed of the random number generator. A seed of 0 means that all
+    /// samples are taken from the same template object, and only differ in
+    /// size
+    #[clap(long)]
+    seed: Option<u64>,
+}
+
+fn maybe_rng<'a>(opt: &'a Opt, rng: &'a mut SmallRng) -> Option<&'a mut SmallRng> {
+    if opt.seed == Some(0) {
+        None
+    } else {
+        Some(rng)
+    }
+}
+
+fn stress<T: Template>(opt: &Opt) {
+    let mut rng = match opt.seed {
+        None => SmallRng::from_entropy(),
+        Some(seed) => SmallRng::seed_from_u64(seed),
+    };
+
+    let mut cache: LfuCache<usize, Entry<T>> = LfuCache::new();
+    let template = T::create(opt.obj_size, maybe_rng(opt, &mut rng));
+
+    println!("type: {}", std::any::type_name::<T>());
+    println!(
+        "obj weight: {} iterations: {} cache_size: {}\n",
+        template.weight(),
+        opt.niter,
+        opt.cache_size
+    );
+
+    let base_mem = ALLOCATED.load(SeqCst);
+    let print_mod = opt.niter / opt.print_count + 1;
+    let mut should_print = true;
+    let mut print_header = true;
+    let mut sample_weight: usize = 0;
+    let mut sample_alloc: usize = 0;
+    let mut evict_count: usize = 0;
+    let mut evict_duration = Duration::from_secs(0);
+
+    let start = Instant::now();
+    for key in 0..opt.niter {
+        should_print = should_print || key % print_mod == 0;
+        let before_mem = ALLOCATED.load(SeqCst);
+        let start_evict = Instant::now();
+        if let Some(stats) = cache.evict(opt.cache_size) {
+            evict_duration += start_evict.elapsed();
+            let after_mem = ALLOCATED.load(SeqCst);
+            evict_count += 1;
+            if should_print {
+                if print_header {
+                    println!("evict:        weight that was removed from cache");
+                    println!("drop:         allocated memory that was freed");
+                    println!("slip:         evicted - dropped");
+                    println!("room:         configured cache size - cache weight");
+                    println!("heap:         allocated heap_size / configured cache_size");
+                    println!("mem:          memory allocated for cache + all entries\n");
+                    print_header = false;
+                }
+
+                let dropped = before_mem - after_mem;
+                let evicted_count = stats.evicted_count;
+                let evicted = stats.evicted_weight;
+                let slip = evicted as i64 - dropped as i64;
+                let room = opt.cache_size as i64 - stats.new_weight as i64;
+                let heap = (after_mem - base_mem) as f64 / opt.cache_size as f64;
+                let mem = after_mem - base_mem;
+                println!(
+                    "evict: [{evicted_count:3}]{evicted:6}  drop: {dropped:6} slip: {slip:4} \
+                    room: {room:6} heap: {heap:0.2}  mem: {mem:8}"
+                );
+                should_print = false;
+            }
+        }
+        let size = if opt.fixed || opt.obj_size == 0 {
+            opt.obj_size
+        } else {
+            rng.gen_range(0..opt.obj_size)
+        };
+        let before = ALLOCATED.load(SeqCst);
+        let sample = template.sample(size, maybe_rng(opt, &mut rng));
+        let weight = sample.weight();
+        let alloc = ALLOCATED.load(SeqCst) - before;
+        sample_weight += weight;
+        sample_alloc += alloc;
+        if opt.samples {
+            println!("sample: weight {:6} alloc {:6}", weight, alloc,);
+        }
+        cache.insert(key, Entry::from(*sample));
+        // Do a few random reads from the cache
+        for _attempt in 0..5 {
+            let read = rng.gen_range(0..=key);
+            let _v = cache.get(&read);
+        }
+    }
+
+    println!(
+        "\ncache: entries: {} evictions: {} took {}ms out of {}ms",
+        cache.len(),
+        evict_count,
+        evict_duration.as_millis(),
+        start.elapsed().as_millis()
+    );
+    if sample_alloc == sample_weight {
+        println!(
+            "samples: weight {} alloc {} weight/alloc precise",
+            sample_weight, sample_alloc
+        );
+    } else {
+        let heap_factor = sample_alloc as f64 / sample_weight as f64;
+        println!(
+            "samples: weight {} alloc {} weight/alloc {:0.2}",
+            sample_weight, sample_alloc, heap_factor
+        );
+    }
+}
+
+/// This program constructs a template object of size `obj_size` and then
+/// inserts a sample of size up to `obj_size` into the cache `niter` times.
+/// The cache is limited to `cache_size` total weight, and we call `evict`
+/// before each insertion into the cache.
+///
+/// After each `evict`, we check how much heap we have currently allocated
+/// and print that roughly `print_count` times over the run of the program.
+/// The most important measure is the `heap_factor`, which is the ratio of
+/// memory used on the heap since we started inserting into the cache to
+/// the target `cache_size`
+pub fn main() {
+    let opt = Opt::from_args();
+    unsafe { PRINT_SAMPLES = opt.samples }
+
+    // Use different Cacheables to see how the cache manages memory with
+    // different types of cache entries.
+    match opt.template.as_str() {
+        "bigdecimal" => stress::<BigDecimal>(&opt),
+        "bigint" => stress::<BigInt>(&opt),
+        "hashmap" => stress::<HashMap<String, String>>(&opt),
+        "object" => stress::<Object>(&opt),
+        "result" => stress::<QueryResult>(&opt),
+        "string" => stress::<String>(&opt),
+        "usizemap" => stress::<UsizeMap>(&opt),
+        "valuemap" => stress::<ValueMap>(&opt),
+        "vec" => stress::<Vec<usize>>(&opt),
+        "word" => stress::<Word>(&opt),
+        _ => println!("unknown value `{}` for --template", opt.template),
+    }
+}
diff --git a/graph/proto/cosmos/transforms.proto b/graph/proto/cosmos/transforms.proto
new file mode 100644
index 0000000..e37edd3
--- /dev/null
+++ b/graph/proto/cosmos/transforms.proto
@@ -0,0 +1,9 @@
+syntax = "proto3";
+
+package sf.cosmos.transform.v1;
+
+option go_package = "github.com/figment-networks/proto-cosmos/pb/sf/cosmos/transform/v1;pbtransform";
+
+message EventTypeFilter {
+  repeated string event_types = 1;
+}
diff --git a/graph/proto/ethereum/transforms.proto b/graph/proto/ethereum/transforms.proto
new file mode 100644
index 0000000..3d24fc9
--- /dev/null
+++ b/graph/proto/ethereum/transforms.proto
@@ -0,0 +1,64 @@
+syntax = "proto3";
+
+package sf.ethereum.transform.v1;
+option go_package = "github.com/streamingfast/firehose-ethereum/types/pb/sf/ethereum/transform/v1;pbtransform";
+
+// CombinedFilter is a combination of "LogFilters" and "CallToFilters"
+//
+// It transforms the requested stream in two ways: 
+//   1. STRIPPING
+//      The block data is stripped from all transactions that don't
+//      match any of the filters.  
+//
+//   2. SKIPPING
+//      If an "block index" covers a range containing a
+//      block that does NOT match any of the filters, the block will be
+//      skipped altogether, UNLESS send_all_block_headers is enabled
+//      In that case, the block would still be sent, but without any
+//      transactionTrace
+//
+// The SKIPPING feature only applies to historical blocks, because
+// the "block index" is always produced after the merged-blocks files
+// are produced. Therefore, the "live" blocks are never filtered out.
+//
+message CombinedFilter {
+  repeated LogFilter log_filters = 1;
+  repeated CallToFilter call_filters = 2;
+
+  // Always send all blocks. if they don't match any log_filters or call_filters, 
+  // all the transactions will be filtered out, sending only the header.
+  bool send_all_block_headers = 3;
+}
+
+// MultiLogFilter concatenates the results of each LogFilter (inclusive OR)
+message MultiLogFilter {
+  repeated LogFilter log_filters = 1;
+}
+
+// LogFilter will match calls where *BOTH*
+// * the contract address that emits the log is one in the provided addresses -- OR addresses list is empty --
+// * the event signature (topic.0) is one of the provided event_signatures -- OR event_signatures is empty --
+//
+// a LogFilter with both empty addresses and event_signatures lists is invalid and will fail.
+message LogFilter {
+  repeated bytes addresses = 1;
+  repeated bytes event_signatures = 2; // corresponds to the keccak of the event signature which is stores in topic.0
+}
+
+// MultiCallToFilter concatenates the results of each CallToFilter (inclusive OR)
+message MultiCallToFilter {
+  repeated CallToFilter call_filters = 1;
+}
+
+// CallToFilter will match calls where *BOTH*
+// * the contract address (TO) is one in the provided addresses -- OR addresses list is empty --
+// * the method signature (in 4-bytes format) is one of the provided signatures -- OR signatures is empty --
+//
+// a CallToFilter with both empty addresses and signatures lists is invalid and will fail.
+message CallToFilter {
+  repeated bytes addresses = 1;
+  repeated bytes signatures = 2;
+}
+
+message LightBlock {
+}
diff --git a/graph/proto/firehose.proto b/graph/proto/firehose.proto
new file mode 100644
index 0000000..b806028
--- /dev/null
+++ b/graph/proto/firehose.proto
@@ -0,0 +1,110 @@
+syntax = "proto3";
+
+package sf.firehose.v1;
+
+import "google/protobuf/any.proto";
+
+option go_package = "github.com/streamingfast/pbgo/sf/firehose/v1;pbfirehose";
+
+service Stream {
+  rpc Blocks(Request) returns (stream Response);
+}
+
+// For historical segments, forks are not passed
+message Request {
+  // Controls where the stream of blocks will start.
+  //
+  // The stream will start **inclusively** at the requested block num.
+  //
+  // When not provided, starts at first streamable block of the chain. Not all
+  // chain starts at the same block number, so you might get an higher block than
+  // requested when using default value of 0.
+  //
+  // Can be negative, will be resolved relative to the chain head block, assuming
+  // a chain at head block #100, then using `-50` as the value will start at block
+  // #50. If it resolves before first streamable block of chain, we assume start
+  // of chain.
+  //
+  // If `start_cursor` is passed, this value is ignored and the stream instead starts
+  // immediately after the Block pointed by the opaque `start_cursor` value.
+  int64 start_block_num = 1;
+
+  // Controls where the stream of blocks will start which will be immediately after
+  // the Block pointed by this opaque cursor.
+  //
+  // Obtain this value from a previously received from `Response.cursor`.
+  //
+  // This value takes precedence over `start_block_num`.
+  string start_cursor = 13;
+
+  // When non-zero, controls where the stream of blocks will stop.
+  //
+  // The stream will close **after** that block has passed so the boundary is
+  // **inclusive**.
+  uint64 stop_block_num = 5;
+
+  // Filter the steps you want to see. If not specified, defaults to all steps.
+  //
+  // Most common steps will be [STEP_IRREVERSIBLE], or [STEP_NEW, STEP_UNDO, STEP_IRREVERSIBLE].
+  repeated ForkStep fork_steps = 8;
+
+  // The CEL filter expression used to include transactions, specific to the target protocol,
+  // works in combination with `exclude_filter_expr` value.
+  string include_filter_expr = 10;
+
+  // The CEL filter expression used to exclude transactions, specific to the target protocol, works
+  // in combination with `include_filter_expr` value.
+  string exclude_filter_expr = 11;
+
+  // **Warning** Experimental API, controls how blocks are trimmed for extraneous information before
+  // being sent back. The actual trimming is chain dependent.
+  //BlockDetails details = 15;
+  reserved 15;
+
+  // controls how many confirmations will consider a given block as final (STEP_IRREVERSIBLE). Warning, if any reorg goes beyond that number of confirmations, the request will stall forever
+  //uint64 confirmations = 16;
+  reserved 16;
+
+
+  //- EOS "handoffs:3"
+  //- EOS "lib"
+  //- EOS "confirms:3"
+  //- ETH "confirms:200"
+  //- ETH "confirms:7"
+  //- SOL "commmitement:finalized"
+  //- SOL "confirms:200"
+  string irreversibility_condition = 17;
+
+  repeated google.protobuf.Any transforms = 18;
+}
+
+message Response {
+  // Chain specific block payload, one of:
+  // - sf.eosio.codec.v1.Block
+  // - sf.ethereum.codec.v1.Block
+  // - sf.near.codec.v1.Block
+  // - sf.solana.codec.v1.Block
+  google.protobuf.Any block = 1;
+  ForkStep step = 6;
+  string cursor = 10;
+}
+
+enum ForkStep {
+  STEP_UNKNOWN = 0;
+  // Block is new head block of the chain, that is linear with the previous block
+  STEP_NEW = 1;
+  // Block is now forked and should be undone, it's not the head block of the chain anymore
+  STEP_UNDO = 2;
+  // Removed, was STEP_REDO
+  reserved 3;
+  // Block is now irreversible and can be committed to (finality is chain specific, see chain documentation for more details)
+  STEP_IRREVERSIBLE = 4;
+  // Removed, was STEP_STALLED
+  reserved 5 ;
+}
+
+// TODO: move to ethereum specific transforms
+enum BlockDetails {
+  BLOCK_DETAILS_FULL = 0;
+  BLOCK_DETAILS_LIGHT = 1;
+}
\ No newline at end of file
diff --git a/graph/proto/near/transforms.proto b/graph/proto/near/transforms.proto
new file mode 100644
index 0000000..6dfe138
--- /dev/null
+++ b/graph/proto/near/transforms.proto
@@ -0,0 +1,21 @@
+syntax = "proto3";
+
+package sf.near.transform.v1;
+option go_package = "github.com/streamingfast/sf-near/pb/sf/near/transform/v1;pbtransform";
+
+message BasicReceiptFilter {
+  repeated string accounts = 1;
+  repeated PrefixSuffixPair prefix_and_suffix_pairs = 2;
+}
+
+// PrefixSuffixPair applies a logical AND to prefix and suffix when both fields are non-empty.
+// * {prefix="hello",suffix="world"} will match "hello.world" but not "hello.friend"
+// * {prefix="hello",suffix=""}      will match both "hello.world" and "hello.friend"
+// * {prefix="",suffix="world"}      will match both "hello.world" and "good.day.world"
+// * {prefix="",suffix=""}           is invalid
+//
+// Note that the suffix will usually have a TLD, ex: "mydomain.near" or "mydomain.testnet"
+message PrefixSuffixPair {
+  string prefix = 1;
+  string suffix = 2;
+}
diff --git a/graph/proto/substreams.proto b/graph/proto/substreams.proto
new file mode 100644
index 0000000..564d0cb
--- /dev/null
+++ b/graph/proto/substreams.proto
@@ -0,0 +1,267 @@
+syntax = "proto3";
+
+package sf.substreams.v1;
+
+option go_package = "github.com/streamingfast/substreams/pb/sf/substreams/v1;pbsubstreams";
+
+import "google/protobuf/any.proto";
+import "google/protobuf/descriptor.proto";
+import "google/protobuf/timestamp.proto";
+
+// FIXME: I copied over and inlined most of the substreams files, this is bad and we need a better way to
+// generate that, outside of doing this copying over. We should check maybe `buf` or a pre-populated
+// package.
+
+service Stream {
+  rpc Blocks(Request) returns (stream Response);
+}
+
+message Request {
+  int64 start_block_num = 1;
+  string start_cursor = 2;
+  uint64 stop_block_num = 3;
+  repeated ForkStep fork_steps = 4;
+  string irreversibility_condition = 5;
+
+  Modules modules = 6;
+  repeated string output_modules = 7;
+  repeated string initial_store_snapshot_for_modules = 8;
+}
+
+message Response {
+  oneof message {
+    ModulesProgress progress = 1; // Progress of data preparation, before sending in the stream of `data` events.
+    InitialSnapshotData snapshot_data = 2;
+    InitialSnapshotComplete snapshot_complete = 3;
+    BlockScopedData data = 4;
+  }
+}
+
+enum ForkStep {
+  STEP_UNKNOWN = 0;
+  // Block is new head block of the chain, that is linear with the previous block
+  STEP_NEW = 1;
+  // Block is now forked and should be undone, it's not the head block of the chain anymore
+  STEP_UNDO = 2;
+  // Removed, was STEP_REDO
+  reserved 3;
+  // Block is now irreversible and can be committed to (finality is chain specific, see chain documentation for more details)
+  STEP_IRREVERSIBLE = 4;
+  // Removed, was STEP_STALLED
+  reserved 5;
+}
+
+message InitialSnapshotComplete {
+  string cursor = 1;
+}
+
+message InitialSnapshotData {
+  string module_name = 1;
+  StoreDeltas deltas = 2;
+  uint64 sent_keys = 4;
+  uint64 total_keys = 3;
+}
+
+message BlockScopedData {
+  repeated ModuleOutput outputs = 1;
+  Clock clock = 3;
+  ForkStep step = 6;
+  string cursor = 10;
+}
+
+message ModuleOutput {
+  string name = 1;
+  oneof data {
+    google.protobuf.Any map_output = 2;
+    StoreDeltas store_deltas = 3;
+  }
+  repeated string logs = 4;
+
+  // LogsTruncated is a flag that tells you if you received all the logs or if they
+  // were truncated because you logged too much (fixed limit currently is set to 128 KiB).
+  bool logs_truncated = 5;
+}
+
+message ModulesProgress {
+  repeated ModuleProgress modules = 1;
+}
+
+message ModuleProgress {
+  string name = 1;
+
+  oneof type {
+    ProcessedRange processed_ranges = 2;
+    InitialState initial_state = 3;
+    ProcessedBytes processed_bytes = 4;
+    Failed failed = 5;
+  }
+
+  message ProcessedRange {
+    repeated BlockRange processed_ranges = 1;
+  }
+  message InitialState {
+    uint64 available_up_to_block = 2;
+  }
+  message ProcessedBytes {
+    uint64 total_bytes_read = 1;
+    uint64 total_bytes_written = 2;
+  }
+  message Failed {
+    string reason = 1;
+    repeated string logs = 2;
+    // FailureLogsTruncated is a flag that tells you if you received all the logs or if they
+    // were truncated because you logged too much (fixed limit currently is set to 128 KiB).
+    bool logs_truncated = 3;
+  }
+}
+
+message BlockRange {
+  uint64 start_block = 1;
+  uint64 end_block = 2;
+}
+
+message StoreDeltas {
+  repeated StoreDelta deltas = 1;
+}
+
+message StoreDelta {
+  enum Operation {
+    UNSET = 0;
+    CREATE = 1;
+    UPDATE = 2;
+    DELETE = 3;
+  }
+  Operation operation = 1;
+  uint64 ordinal = 2;
+  string key = 3;
+  bytes old_value = 4;
+  bytes new_value = 5;
+}
+
+message Output {
+  uint64 block_num = 1;
+  string block_id = 2;
+  google.protobuf.Timestamp timestamp = 4;
+  google.protobuf.Any value = 10;
+}
+
+message Modules {
+  repeated Module modules = 1;
+  repeated Binary binaries = 2;
+}
+
+// Binary represents some code compiled to its binary form.
+message Binary {
+  string type = 1;
+  bytes content = 2;
+}
+
+message Module {
+  string name = 1;
+  oneof kind {
+    KindMap kind_map = 2;
+    KindStore kind_store = 3;
+  };
+
+  uint32 binary_index = 4;
+  string binary_entrypoint = 5;
+
+  repeated Input inputs = 6;
+  Output output = 7;
+
+  uint64 initial_block = 8;
+
+  message KindMap {
+    string output_type = 1;
+  }
+
+  message KindStore {
+    // The `update_policy` determines the functions available to mutate the store
+    // (like `set()`, `set_if_not_exists()` or `sum()`, etc..) in
+    // order to ensure that parallel operations are possible and deterministic
+    //
+    // Say a store cumulates keys from block 0 to 1M, and a second store
+    // cumulates keys from block 1M to 2M. When we want to use this
+    // store as a dependency for a downstream module, we will merge the
+    // two stores according to this policy.
+    UpdatePolicy update_policy = 1;
+    string value_type = 2;
+
+    enum UpdatePolicy {
+      UPDATE_POLICY_UNSET = 0;
+      // Provides a store where you can `set()` keys, and the latest key wins
+      UPDATE_POLICY_SET = 1;
+      // Provides a store where you can `set_if_not_exists()` keys, and the first key wins
+      UPDATE_POLICY_SET_IF_NOT_EXISTS = 2;
+      // Provides a store where you can `add_*()` keys, where two stores merge by summing its values.
+      UPDATE_POLICY_ADD = 3;
+      // Provides a store where you can `min_*()` keys, where two stores merge by leaving the minimum value.
+      UPDATE_POLICY_MIN = 4;
+      // Provides a store where you can `max_*()` keys, where two stores merge by leaving the maximum value.
+      UPDATE_POLICY_MAX = 5;
+    }
+
+  }
+
+  message Input {
+    oneof input {
+      Source source = 1;
+      Map map = 2;
+      Store store = 3;
+    }
+
+    message Source {
+      string type = 1; // ex: "sf.ethereum.type.v1.Block"
+    }
+    message Map {
+      string module_name = 1; // ex: "block_to_pairs"
+    }
+    message Store {
+      string module_name = 1;
+      Mode mode = 2;
+
+      enum Mode {
+	UNSET = 0;
+	GET = 1;
+	DELTAS = 2;
+      }
+    }
+  }
+
+  message Output {
+    string type = 1;
+  }
+}
+
+message Clock {
+  string id = 1;
+  uint64 number = 2;
+  google.protobuf.Timestamp timestamp = 3;
+}
+
+message Package {
+  // Needs to be one so this file can be used _directly_ as a
+  // buf `Image` andor a ProtoSet for grpcurl and other tools
+  repeated google.protobuf.FileDescriptorProto proto_files = 1;
+  reserved 2; // In case protosets add a field some day.
+  reserved 3; // In case protosets add a field some day.
+  reserved 4; // In case protosets add a field some day.
+
+  uint64 version = 5;
+  sf.substreams.v1.Modules modules = 6;
+  repeated ModuleMetadata module_meta = 7;
+  repeated PackageMetadata package_meta = 8;
+}
+
+message PackageMetadata {
+  string version = 1;
+  string url = 2;
+  string name = 3;
+  string doc = 4;
+}
+
+message ModuleMetadata {
+  // Corresponds to the index in `Package.metadata.package_meta`
+  uint64 package_index = 1;
+  string doc = 2;
+}
diff --git a/graph/src/blockchain/block_stream.rs b/graph/src/blockchain/block_stream.rs
new file mode 100644
index 0000000..801ba99
--- /dev/null
+++ b/graph/src/blockchain/block_stream.rs
@@ -0,0 +1,485 @@
+use anyhow::Error;
+use async_stream::stream;
+use futures03::Stream;
+use std::fmt;
+use std::sync::Arc;
+use thiserror::Error;
+use tokio::sync::mpsc::{self, Receiver, Sender};
+
+use super::{Block, BlockPtr, Blockchain};
+use crate::anyhow::Result;
+use crate::components::store::{BlockNumber, DeploymentLocator};
+use crate::data::subgraph::UnifiedMappingApiVersion;
+use crate::firehose;
+use crate::substreams::BlockScopedData;
+use crate::{prelude::*, prometheus::labels};
+
+pub struct BufferedBlockStream<C: Blockchain> {
+    inner: Pin<Box<dyn Stream<Item = Result<BlockStreamEvent<C>, Error>> + Send>>,
+}
+
+impl<C: Blockchain + 'static> BufferedBlockStream<C> {
+    pub fn spawn_from_stream(
+        stream: Box<dyn BlockStream<C>>,
+        size_hint: usize,
+    ) -> Box<dyn BlockStream<C>> {
+        let (sender, receiver) = mpsc::channel::<Result<BlockStreamEvent<C>, Error>>(size_hint);
+        crate::spawn(async move { BufferedBlockStream::stream_blocks(stream, sender).await });
+
+        Box::new(BufferedBlockStream::new(receiver))
+    }
+
+    pub fn new(mut receiver: Receiver<Result<BlockStreamEvent<C>, Error>>) -> Self {
+        let inner = stream! {
+            loop {
+                let event = match receiver.recv().await {
+                    Some(evt) => evt,
+                    None => return,
+                };
+
+                yield event
+            }
+        };
+
+        Self {
+            inner: Box::pin(inner),
+        }
+    }
+
+    pub async fn stream_blocks(
+        mut stream: Box<dyn BlockStream<C>>,
+        sender: Sender<Result<BlockStreamEvent<C>, Error>>,
+    ) -> Result<(), Error> {
+        while let Some(event) = stream.next().await {
+            match sender.send(event).await {
+                Ok(_) => continue,
+                Err(err) => {
+                    return Err(anyhow!(
+                        "buffered blockstream channel is closed, stopping. Err: {}",
+                        err
+                    ))
+                }
+            }
+        }
+
+        Ok(())
+    }
+}
+
+impl<C: Blockchain> BlockStream<C> for BufferedBlockStream<C> {}
+
+impl<C: Blockchain> Stream for BufferedBlockStream<C> {
+    type Item = Result<BlockStreamEvent<C>, Error>;
+
+    fn poll_next(
+        mut self: Pin<&mut Self>,
+        cx: &mut std::task::Context<'_>,
+    ) -> std::task::Poll<Option<Self::Item>> {
+        self.inner.poll_next_unpin(cx)
+    }
+}
+
+pub trait BlockStream<C: Blockchain>:
+    Stream<Item = Result<BlockStreamEvent<C>, Error>> + Unpin + Send
+{
+}
+
+/// BlockStreamBuilder is an abstraction that would separate the logic for building streams from the blockchain trait
+#[async_trait]
+pub trait BlockStreamBuilder<C: Blockchain>: Send + Sync {
+    async fn build_firehose(
+        &self,
+        chain: &C,
+        deployment: DeploymentLocator,
+        block_cursor: FirehoseCursor,
+        start_blocks: Vec<BlockNumber>,
+        subgraph_current_block: Option<BlockPtr>,
+        filter: Arc<C::TriggerFilter>,
+        unified_api_version: UnifiedMappingApiVersion,
+    ) -> Result<Box<dyn BlockStream<C>>>;
+
+    async fn build_polling(
+        &self,
+        chain: Arc<C>,
+        deployment: DeploymentLocator,
+        start_blocks: Vec<BlockNumber>,
+        subgraph_current_block: Option<BlockPtr>,
+        filter: Arc<C::TriggerFilter>,
+        unified_api_version: UnifiedMappingApiVersion,
+    ) -> Result<Box<dyn BlockStream<C>>>;
+}
+
+#[derive(Debug, Clone)]
+pub struct FirehoseCursor(Option<String>);
+
+impl FirehoseCursor {
+    #[allow(non_upper_case_globals)]
+    pub const None: Self = FirehoseCursor(None);
+
+    pub fn is_none(&self) -> bool {
+        self.0.is_none()
+    }
+}
+
+impl fmt::Display for FirehoseCursor {
+    fn fmt(&self, f: &mut fmt::Formatter) -> Result<(), fmt::Error> {
+        f.write_str(&self.0.as_deref().unwrap_or(""))
+    }
+}
+
+impl From<String> for FirehoseCursor {
+    fn from(cursor: String) -> Self {
+        // Treat a cursor of "" as None, not absolutely necessary for correctness since the firehose
+        // treats both as the same, but makes it a little clearer.
+        if cursor == "" {
+            FirehoseCursor::None
+        } else {
+            FirehoseCursor(Some(cursor))
+        }
+    }
+}
+
+impl From<Option<String>> for FirehoseCursor {
+    fn from(cursor: Option<String>) -> Self {
+        match cursor {
+            None => FirehoseCursor::None,
+            Some(s) => FirehoseCursor::from(s),
+        }
+    }
+}
+
+impl AsRef<Option<String>> for FirehoseCursor {
+    fn as_ref(&self) -> &Option<String> {
+        &self.0
+    }
+}
+
+#[derive(Debug)]
+pub struct BlockWithTriggers<C: Blockchain> {
+    pub block: C::Block,
+    pub trigger_data: Vec<C::TriggerData>,
+}
+
+impl<C: Blockchain> Clone for BlockWithTriggers<C>
+where
+    C::TriggerData: Clone,
+{
+    fn clone(&self) -> Self {
+        Self {
+            block: self.block.clone(),
+            trigger_data: self.trigger_data.clone(),
+        }
+    }
+}
+
+impl<C: Blockchain> BlockWithTriggers<C> {
+    pub fn new(block: C::Block, mut trigger_data: Vec<C::TriggerData>) -> Self {
+        // This is where triggers get sorted.
+        trigger_data.sort();
+        Self {
+            block,
+            trigger_data,
+        }
+    }
+
+    pub fn trigger_count(&self) -> usize {
+        self.trigger_data.len()
+    }
+
+    pub fn ptr(&self) -> BlockPtr {
+        self.block.ptr()
+    }
+
+    pub fn parent_ptr(&self) -> Option<BlockPtr> {
+        self.block.parent_ptr()
+    }
+}
+
+#[async_trait]
+pub trait TriggersAdapter<C: Blockchain>: Send + Sync {
+    // Return the block that is `offset` blocks before the block pointed to
+    // by `ptr` from the local cache. An offset of 0 means the block itself,
+    // an offset of 1 means the block's parent etc. If the block is not in
+    // the local cache, return `None`
+    async fn ancestor_block(
+        &self,
+        ptr: BlockPtr,
+        offset: BlockNumber,
+    ) -> Result<Option<C::Block>, Error>;
+
+    // Returns a sequence of blocks in increasing order of block number.
+    // Each block will include all of its triggers that match the given `filter`.
+    // The sequence may omit blocks that contain no triggers,
+    // but all returned blocks must part of a same chain starting at `chain_base`.
+    // At least one block will be returned, even if it contains no triggers.
+    // `step_size` is the suggested number blocks to be scanned.
+    async fn scan_triggers(
+        &self,
+        from: BlockNumber,
+        to: BlockNumber,
+        filter: &C::TriggerFilter,
+    ) -> Result<Vec<BlockWithTriggers<C>>, Error>;
+
+    // Used for reprocessing blocks when creating a data source.
+    async fn triggers_in_block(
+        &self,
+        logger: &Logger,
+        block: C::Block,
+        filter: &C::TriggerFilter,
+    ) -> Result<BlockWithTriggers<C>, Error>;
+
+    /// Return `true` if the block with the given hash and number is on the
+    /// main chain, i.e., the chain going back from the current chain head.
+    async fn is_on_main_chain(&self, ptr: BlockPtr) -> Result<bool, Error>;
+
+    /// Get pointer to parent of `block`. This is called when reverting `block`.
+    async fn parent_ptr(&self, block: &BlockPtr) -> Result<Option<BlockPtr>, Error>;
+}
+
+#[async_trait]
+pub trait FirehoseMapper<C: Blockchain>: Send + Sync {
+    async fn to_block_stream_event(
+        &self,
+        logger: &Logger,
+        response: &firehose::Response,
+        adapter: &Arc<dyn TriggersAdapter<C>>,
+        filter: &C::TriggerFilter,
+    ) -> Result<BlockStreamEvent<C>, FirehoseError>;
+
+    /// Returns the [BlockPtr] value for this given block number. This is the block pointer
+    /// of the longuest according to Firehose view of the blockchain state.
+    ///
+    /// This is a thin wrapper around [FirehoseEndpoint#block_ptr_for_number] to make
+    /// it chain agnostic and callable from chain agnostic [FirehoseBlockStream].
+    async fn block_ptr_for_number(
+        &self,
+        logger: &Logger,
+        number: BlockNumber,
+    ) -> Result<BlockPtr, Error>;
+
+    /// Returns the closest final block ptr to the block ptr received.
+    /// On probablitics chain like Ethereum, final is determined by
+    /// the confirmations threshold configured for the Firehose stack (currently
+    /// hard-coded to 200).
+    ///
+    /// On some other chain like NEAR, the actual final block number is determined
+    /// from the block itself since it contains information about which block number
+    /// is final against the current block.
+    ///
+    /// To take an example, assuming we are on Ethereum, the final block pointer
+    /// for block #10212 would be the determined final block #10012 (10212 - 200 = 10012).
+    async fn final_block_ptr_for(
+        &self,
+        logger: &Logger,
+        block: &C::Block,
+    ) -> Result<BlockPtr, Error>;
+}
+
+#[async_trait]
+pub trait SubstreamsMapper<C: Blockchain>: Send + Sync {
+    async fn to_block_stream_event(
+        &self,
+        logger: &Logger,
+        response: &BlockScopedData,
+        // adapter: &Arc<dyn TriggersAdapter<C>>,
+        // filter: &C::TriggerFilter,
+    ) -> Result<Option<BlockStreamEvent<C>>, SubstreamsError>;
+}
+
+#[derive(Error, Debug)]
+pub enum FirehoseError {
+    /// We were unable to decode the received block payload into the chain specific Block struct (e.g. chain_ethereum::pb::Block)
+    #[error("received gRPC block payload cannot be decoded: {0}")]
+    DecodingError(#[from] prost::DecodeError),
+
+    /// Some unknown error occurred
+    #[error("unknown error")]
+    UnknownError(#[from] anyhow::Error),
+}
+
+#[derive(Error, Debug)]
+pub enum SubstreamsError {
+    /// We were unable to decode the received block payload into the chain specific Block struct (e.g. chain_ethereum::pb::Block)
+    #[error("received gRPC block payload cannot be decoded: {0}")]
+    DecodingError(#[from] prost::DecodeError),
+
+    /// Some unknown error occurred
+    #[error("unknown error")]
+    UnknownError(#[from] anyhow::Error),
+
+    #[error("multiple module output error")]
+    MultipleModuleOutputError(),
+
+    #[error("unexpected store delta output")]
+    UnexpectedStoreDeltaOutput(),
+}
+
+#[derive(Debug)]
+pub enum BlockStreamEvent<C: Blockchain> {
+    // The payload is the block the subgraph should revert to, so it becomes the new subgraph head.
+    Revert(BlockPtr, FirehoseCursor),
+
+    ProcessBlock(BlockWithTriggers<C>, FirehoseCursor),
+}
+
+impl<C: Blockchain> Clone for BlockStreamEvent<C>
+where
+    C::TriggerData: Clone,
+{
+    fn clone(&self) -> Self {
+        match self {
+            Self::Revert(arg0, arg1) => Self::Revert(arg0.clone(), arg1.clone()),
+            Self::ProcessBlock(arg0, arg1) => Self::ProcessBlock(arg0.clone(), arg1.clone()),
+        }
+    }
+}
+
+#[derive(Clone)]
+pub struct BlockStreamMetrics {
+    pub deployment_head: Box<Gauge>,
+    pub deployment_failed: Box<Gauge>,
+    pub reverted_blocks: Gauge,
+    pub stopwatch: StopwatchMetrics,
+}
+
+impl BlockStreamMetrics {
+    pub fn new(
+        registry: Arc<dyn MetricsRegistry>,
+        deployment_id: &DeploymentHash,
+        network: String,
+        shard: String,
+        stopwatch: StopwatchMetrics,
+    ) -> Self {
+        let reverted_blocks = registry
+            .new_deployment_gauge(
+                "deployment_reverted_blocks",
+                "Track the last reverted block for a subgraph deployment",
+                deployment_id.as_str(),
+            )
+            .expect("Failed to create `deployment_reverted_blocks` gauge");
+        let labels = labels! {
+            String::from("deployment") => deployment_id.to_string(),
+            String::from("network") => network,
+            String::from("shard") => shard
+        };
+        let deployment_head = registry
+            .new_gauge(
+                "deployment_head",
+                "Track the head block number for a deployment",
+                labels.clone(),
+            )
+            .expect("failed to create `deployment_head` gauge");
+        let deployment_failed = registry
+            .new_gauge(
+                "deployment_failed",
+                "Boolean gauge to indicate whether the deployment has failed (1 == failed)",
+                labels,
+            )
+            .expect("failed to create `deployment_failed` gauge");
+        Self {
+            deployment_head,
+            deployment_failed,
+            reverted_blocks,
+            stopwatch,
+        }
+    }
+}
+
+/// Notifications about the chain head advancing. The block ingestor sends
+/// an update on this stream whenever the head of the underlying chain
+/// changes. The updates have no payload, receivers should call
+/// `Store::chain_head_ptr` to check what the latest block is.
+pub type ChainHeadUpdateStream = Box<dyn Stream<Item = ()> + Send + Unpin>;
+
+pub trait ChainHeadUpdateListener: Send + Sync + 'static {
+    /// Subscribe to chain head updates for the given network.
+    fn subscribe(&self, network: String, logger: Logger) -> ChainHeadUpdateStream;
+}
+
+#[cfg(test)]
+mod test {
+    use std::{collections::HashSet, task::Poll};
+
+    use anyhow::Error;
+    use futures03::{Stream, StreamExt, TryStreamExt};
+
+    use crate::{
+        blockchain::mock::{MockBlock, MockBlockchain},
+        ext::futures::{CancelableError, SharedCancelGuard, StreamExtension},
+    };
+
+    use super::{
+        BlockStream, BlockStreamEvent, BlockWithTriggers, BufferedBlockStream, FirehoseCursor,
+    };
+
+    #[derive(Debug)]
+    struct TestStream {
+        number: u64,
+    }
+
+    impl BlockStream<MockBlockchain> for TestStream {}
+
+    impl Stream for TestStream {
+        type Item = Result<BlockStreamEvent<MockBlockchain>, Error>;
+
+        fn poll_next(
+            mut self: std::pin::Pin<&mut Self>,
+            _cx: &mut std::task::Context<'_>,
+        ) -> std::task::Poll<Option<Self::Item>> {
+            self.number += 1;
+            Poll::Ready(Some(Ok(BlockStreamEvent::ProcessBlock(
+                BlockWithTriggers::<MockBlockchain> {
+                    block: MockBlock {
+                        number: self.number - 1,
+                    },
+                    trigger_data: vec![],
+                },
+                FirehoseCursor::None,
+            ))))
+        }
+    }
+
+    #[tokio::test]
+    async fn consume_stream() {
+        let initial_block = 100;
+        let buffer_size = 5;
+
+        let stream = Box::new(TestStream {
+            number: initial_block,
+        });
+        let guard = SharedCancelGuard::new();
+
+        let mut stream = BufferedBlockStream::spawn_from_stream(stream, buffer_size)
+            .map_err(CancelableError::Error)
+            .cancelable(&guard, || Err(CancelableError::Cancel));
+
+        let mut blocks = HashSet::<MockBlock>::new();
+        let mut count = 0;
+        loop {
+            match stream.next().await {
+                None if blocks.len() == 0 => panic!("None before blocks"),
+                Some(Err(CancelableError::Cancel)) => {
+                    assert!(guard.is_canceled(), "Guard shouldn't be called yet");
+
+                    break;
+                }
+                Some(Ok(BlockStreamEvent::ProcessBlock(block_triggers, _))) => {
+                    let block = block_triggers.block;
+                    blocks.insert(block.clone());
+                    count += 1;
+
+                    if block.number > initial_block + buffer_size as u64 {
+                        guard.cancel();
+                    }
+                }
+                _ => panic!("Should not happen"),
+            };
+        }
+        assert!(
+            blocks.len() > buffer_size,
+            "should consume at least a full buffer, consumed {}",
+            count
+        );
+        assert_eq!(count, blocks.len(), "should not have duplicated blocks");
+    }
+}
diff --git a/graph/src/blockchain/firehose_block_ingestor.rs b/graph/src/blockchain/firehose_block_ingestor.rs
new file mode 100644
index 0000000..965272c
--- /dev/null
+++ b/graph/src/blockchain/firehose_block_ingestor.rs
@@ -0,0 +1,168 @@
+use std::{marker::PhantomData, sync::Arc, time::Duration};
+
+use crate::{
+    blockchain::Block as BlockchainBlock,
+    components::store::ChainStore,
+    firehose::{self, decode_firehose_block, FirehoseEndpoint},
+    prelude::{error, info, Logger},
+    util::backoff::ExponentialBackoff,
+};
+use anyhow::{Context, Error};
+use futures03::StreamExt;
+use slog::trace;
+use tonic::Streaming;
+
+pub struct FirehoseBlockIngestor<M>
+where
+    M: prost::Message + BlockchainBlock + Default + 'static,
+{
+    chain_store: Arc<dyn ChainStore>,
+    endpoint: Arc<FirehoseEndpoint>,
+    logger: Logger,
+
+    phantom: PhantomData<M>,
+}
+
+impl<M> FirehoseBlockIngestor<M>
+where
+    M: prost::Message + BlockchainBlock + Default + 'static,
+{
+    pub fn new(
+        chain_store: Arc<dyn ChainStore>,
+        endpoint: Arc<FirehoseEndpoint>,
+        logger: Logger,
+    ) -> FirehoseBlockIngestor<M> {
+        FirehoseBlockIngestor {
+            chain_store,
+            endpoint,
+            logger,
+            phantom: PhantomData {},
+        }
+    }
+
+    pub async fn run(self) {
+        use firehose::ForkStep::*;
+
+        let mut latest_cursor = self.fetch_head_cursor().await;
+        let mut backoff =
+            ExponentialBackoff::new(Duration::from_millis(250), Duration::from_secs(30));
+
+        loop {
+            info!(
+                self.logger,
+                "Blockstream disconnected, connecting"; "endpoint uri" => format_args!("{}", self.endpoint), "cursor" => format_args!("{}", latest_cursor),
+            );
+
+            let result = self
+                .endpoint
+                .clone()
+                .stream_blocks(firehose::Request {
+                    // Starts at current HEAD block of the chain (viewed from Firehose side)
+                    start_block_num: -1,
+                    start_cursor: latest_cursor.clone(),
+                    fork_steps: vec![StepNew as i32, StepUndo as i32],
+                    ..Default::default()
+                })
+                .await;
+
+            match result {
+                Ok(stream) => {
+                    info!(self.logger, "Blockstream connected, consuming blocks");
+
+                    // Consume the stream of blocks until an error is hit
+                    latest_cursor = self.process_blocks(latest_cursor, stream).await
+                }
+                Err(e) => {
+                    error!(self.logger, "Unable to connect to endpoint: {:?}", e);
+                }
+            }
+
+            // If we reach this point, we must wait a bit before retrying
+            backoff.sleep_async().await;
+        }
+    }
+
+    async fn fetch_head_cursor(&self) -> String {
+        let mut backoff =
+            ExponentialBackoff::new(Duration::from_millis(250), Duration::from_secs(30));
+        loop {
+            match self.chain_store.clone().chain_head_cursor() {
+                Ok(cursor) => return cursor.unwrap_or_else(|| "".to_string()),
+                Err(e) => {
+                    error!(self.logger, "Fetching chain head cursor failed: {:?}", e);
+
+                    backoff.sleep_async().await;
+                }
+            }
+        }
+    }
+
+    /// Consumes the incoming stream of blocks infinitely until it hits an error. In which case
+    /// the error is logged right away and the latest available cursor is returned
+    /// upstream for future consumption.
+    async fn process_blocks(
+        &self,
+        cursor: String,
+        mut stream: Streaming<firehose::Response>,
+    ) -> String {
+        use firehose::ForkStep;
+        use firehose::ForkStep::*;
+
+        let mut latest_cursor = cursor;
+
+        while let Some(message) = stream.next().await {
+            match message {
+                Ok(v) => {
+                    let step = ForkStep::from_i32(v.step)
+                        .expect("Fork step should always match to known value");
+
+                    let result = match step {
+                        StepNew => self.process_new_block(&v).await,
+                        StepUndo => {
+                            trace!(self.logger, "Received undo block to ingest, skipping");
+                            Ok(())
+                        }
+                        StepIrreversible | StepUnknown => panic!(
+                            "We explicitly requested StepNew|StepUndo but received something else"
+                        ),
+                    };
+
+                    if let Err(e) = result {
+                        error!(self.logger, "Process block failed: {:?}", e);
+                        break;
+                    }
+
+                    latest_cursor = v.cursor;
+                }
+                Err(e) => {
+                    info!(
+                        self.logger,
+                        "An error occurred while streaming blocks: {}", e
+                    );
+                    break;
+                }
+            }
+        }
+
+        error!(
+            self.logger,
+            "Stream blocks complete unexpectedly, expecting stream to always stream blocks"
+        );
+        latest_cursor
+    }
+
+    async fn process_new_block(&self, response: &firehose::Response) -> Result<(), Error> {
+        let block = decode_firehose_block::<M>(response)
+            .context("Mapping firehose block to blockchain::Block")?;
+
+        trace!(self.logger, "Received new block to ingest {}", block.ptr());
+
+        self.chain_store
+            .clone()
+            .set_chain_head(block, response.cursor.clone())
+            .await
+            .context("Updating chain head")?;
+
+        Ok(())
+    }
+}
diff --git a/graph/src/blockchain/firehose_block_stream.rs b/graph/src/blockchain/firehose_block_stream.rs
new file mode 100644
index 0000000..bcf4c85
--- /dev/null
+++ b/graph/src/blockchain/firehose_block_stream.rs
@@ -0,0 +1,507 @@
+use super::block_stream::{BlockStream, BlockStreamEvent, FirehoseMapper};
+use super::{Blockchain, TriggersAdapter};
+use crate::blockchain::block_stream::FirehoseCursor;
+use crate::blockchain::TriggerFilter;
+use crate::firehose::ForkStep::*;
+use crate::prelude::*;
+use crate::util::backoff::ExponentialBackoff;
+use crate::{firehose, firehose::FirehoseEndpoint};
+use async_stream::try_stream;
+use futures03::{Stream, StreamExt};
+use std::sync::Arc;
+use std::task::{Context, Poll};
+use std::time::{Duration, Instant};
+use tonic::Status;
+
+struct FirehoseBlockStreamMetrics {
+    deployment: DeploymentHash,
+    provider: String,
+    restarts: CounterVec,
+    connect_duration: GaugeVec,
+    time_between_responses: HistogramVec,
+    responses: CounterVec,
+}
+
+impl FirehoseBlockStreamMetrics {
+    pub fn new(
+        registry: Arc<dyn MetricsRegistry>,
+        deployment: DeploymentHash,
+        provider: String,
+    ) -> Self {
+        Self {
+            deployment,
+            provider,
+
+            restarts: registry
+                .global_counter_vec(
+                    "deployment_firehose_blockstream_restarts",
+                    "Counts the number of times a Firehose block stream is (re)started",
+                    vec!["deployment", "provider", "success"].as_slice(),
+                )
+                .unwrap(),
+
+            connect_duration: registry
+                .global_gauge_vec(
+                    "deployment_firehose_blockstream_connect_duration",
+                    "Measures the time it takes to connect a Firehose block stream",
+                    vec!["deployment", "provider"].as_slice(),
+                )
+                .unwrap(),
+
+            time_between_responses: registry
+                .global_histogram_vec(
+                    "deployment_firehose_blockstream_time_between_responses",
+                    "Measures the time between receiving and processing Firehose stream responses",
+                    vec!["deployment", "provider"].as_slice(),
+                )
+                .unwrap(),
+
+            responses: registry
+                .global_counter_vec(
+                    "deployment_firehose_blockstream_responses",
+                    "Counts the number of responses received from a Firehose block stream",
+                    vec!["deployment", "provider", "kind"].as_slice(),
+                )
+                .unwrap(),
+        }
+    }
+
+    fn observe_successful_connection(&self, time: &mut Instant) {
+        self.restarts
+            .with_label_values(&[&self.deployment, &self.provider, "true"])
+            .inc();
+        self.connect_duration
+            .with_label_values(&[&self.deployment, &self.provider])
+            .set(time.elapsed().as_secs_f64());
+
+        // Reset last connection timestamp
+        *time = Instant::now();
+    }
+
+    fn observe_failed_connection(&self, time: &mut Instant) {
+        self.restarts
+            .with_label_values(&[&self.deployment, &self.provider, "false"])
+            .inc();
+        self.connect_duration
+            .with_label_values(&[&self.deployment, &self.provider])
+            .set(time.elapsed().as_secs_f64());
+
+        // Reset last connection timestamp
+        *time = Instant::now();
+    }
+
+    fn observe_response(&self, kind: &str, time: &mut Instant) {
+        self.time_between_responses
+            .with_label_values(&[&self.deployment, &self.provider])
+            .observe(time.elapsed().as_secs_f64());
+        self.responses
+            .with_label_values(&[&self.deployment, &self.provider, kind])
+            .inc();
+
+        // Reset last response timestamp
+        *time = Instant::now();
+    }
+}
+
+pub struct FirehoseBlockStream<C: Blockchain> {
+    stream: Pin<Box<dyn Stream<Item = Result<BlockStreamEvent<C>, Error>> + Send>>,
+}
+
+impl<C> FirehoseBlockStream<C>
+where
+    C: Blockchain,
+{
+    pub fn new<F>(
+        deployment: DeploymentHash,
+        endpoint: Arc<FirehoseEndpoint>,
+        subgraph_current_block: Option<BlockPtr>,
+        cursor: FirehoseCursor,
+        mapper: Arc<F>,
+        adapter: Arc<dyn TriggersAdapter<C>>,
+        filter: Arc<C::TriggerFilter>,
+        start_blocks: Vec<BlockNumber>,
+        logger: Logger,
+        registry: Arc<dyn MetricsRegistry>,
+    ) -> Self
+    where
+        F: FirehoseMapper<C> + 'static,
+    {
+        let manifest_start_block_num = start_blocks
+            .into_iter()
+            .min()
+            // Firehose knows where to start the stream for the specific chain, 0 here means
+            // start at Genesis block.
+            .unwrap_or(0);
+
+        let metrics =
+            FirehoseBlockStreamMetrics::new(registry, deployment, endpoint.provider.clone());
+
+        FirehoseBlockStream {
+            stream: Box::pin(stream_blocks(
+                endpoint,
+                cursor,
+                mapper,
+                adapter,
+                filter,
+                manifest_start_block_num,
+                subgraph_current_block,
+                logger,
+                metrics,
+            )),
+        }
+    }
+}
+
+fn stream_blocks<C: Blockchain, F: FirehoseMapper<C>>(
+    endpoint: Arc<FirehoseEndpoint>,
+    mut latest_cursor: FirehoseCursor,
+    mapper: Arc<F>,
+    adapter: Arc<dyn TriggersAdapter<C>>,
+    filter: Arc<C::TriggerFilter>,
+    manifest_start_block_num: BlockNumber,
+    subgraph_current_block: Option<BlockPtr>,
+    logger: Logger,
+    metrics: FirehoseBlockStreamMetrics,
+) -> impl Stream<Item = Result<BlockStreamEvent<C>, Error>> {
+    let mut subgraph_current_block = subgraph_current_block;
+    let mut start_block_num = subgraph_current_block
+        .as_ref()
+        .map(|ptr| {
+            // Firehose start block is inclusive while the subgraph_current_block is where the actual
+            // subgraph is currently at. So to process the actual next block, we must start one block
+            // further in the chain.
+            ptr.block_number() + 1 as BlockNumber
+        })
+        .unwrap_or(manifest_start_block_num);
+
+    // Sanity check when starting from a subgraph block ptr directly. When
+    // this happens, we must ensure that Firehose first picked block directly follows the
+    // subgraph block ptr. So we check that Firehose first picked block's parent is
+    // equal to subgraph block ptr.
+    //
+    // This can happen for example when rewinding, unfailing a deterministic error or
+    // when switching from RPC to Firehose on Ethereum.
+    //
+    // What could go wrong is that the subgraph block ptr points to a forked block but
+    // since Firehose only accepts `block_number`, it could pick right away the canonical
+    // block of the longuest chain creating inconsistencies in the data (because it would
+    // not revert the forked the block).
+    //
+    // If a Firehose cursor is present, it's used to resume the stream and as such, there is no need to
+    // perform the chain continuity check.
+    //
+    // If there was no cursor, now we need to check if the subgraph current block is set to something.
+    // When the graph node deploys a new subgraph, it always create a subgraph ptr for this subgraph, the
+    // initial subgraph block pointer points to the parent block of the manifest's start block, which is usually
+    // equivalent (but not always) to manifest's start block number - 1.
+    //
+    // Hence, we only need to check the chain continuity if the subgraph current block ptr is higher or equal
+    // to the subgraph manifest's start block number. Indeed, only in this case (and when there is no firehose
+    // cursor) it means the subgraph was started and advanced with something else than Firehose and as such,
+    // chain continuity check needs to be performed.
+    let mut check_subgraph_continuity = must_check_subgraph_continuity(
+        &logger,
+        &subgraph_current_block,
+        &latest_cursor,
+        manifest_start_block_num,
+    );
+    if check_subgraph_continuity {
+        debug!(&logger, "Going to check continuity of chain on first block");
+    }
+
+    // Back off exponentially whenever we encounter a connection error or a stream with bad data
+    let mut backoff = ExponentialBackoff::new(Duration::from_millis(500), Duration::from_secs(45));
+
+    // This attribute is needed because `try_stream!` seems to break detection of `skip_backoff` assignments
+    #[allow(unused_assignments)]
+    let mut skip_backoff = false;
+
+    try_stream! {
+        loop {
+            info!(
+                &logger,
+                "Blockstream disconnected, connecting";
+                "endpoint_uri" => format_args!("{}", endpoint),
+                "start_block" => start_block_num,
+                "cursor" => latest_cursor.to_string(),
+            );
+
+            // We just reconnected, assume that we want to back off on errors
+            skip_backoff = false;
+
+            let mut request = firehose::Request {
+                start_block_num: start_block_num as i64,
+                start_cursor: latest_cursor.to_string(),
+                fork_steps: vec![StepNew as i32, StepUndo as i32],
+                ..Default::default()
+            };
+
+            if endpoint.filters_enabled {
+                request.transforms = filter.as_ref().clone().to_firehose_filter();
+            }
+
+            let mut connect_start = Instant::now();
+            let req = endpoint.clone().stream_blocks(request);
+            let result = tokio::time::timeout(Duration::from_secs(120), req).await.map_err(|x| x.into()).and_then(|x| x);
+
+            match result {
+                Ok(stream) => {
+                    info!(&logger, "Blockstream connected");
+
+                    // Track the time it takes to set up the block stream
+                    metrics.observe_successful_connection(&mut connect_start);
+
+                    let mut last_response_time = Instant::now();
+                    let mut expected_stream_end = false;
+
+                    for await response in stream {
+                        match process_firehose_response(
+                            response,
+                            &mut check_subgraph_continuity,
+                            manifest_start_block_num,
+                            subgraph_current_block.as_ref(),
+                            mapper.as_ref(),
+                            &adapter,
+                            &filter,
+                            &logger,
+                        ).await {
+                            Ok(BlockResponse::Proceed(event, cursor)) => {
+                                // Reset backoff because we got a good value from the stream
+                                backoff.reset();
+
+                                metrics.observe_response("proceed", &mut last_response_time);
+
+                                yield event;
+
+                                latest_cursor = FirehoseCursor::from(cursor);
+                            },
+                            Ok(BlockResponse::Rewind(revert_to)) => {
+                                // Reset backoff because we got a good value from the stream
+                                backoff.reset();
+
+                                metrics.observe_response("rewind", &mut last_response_time);
+
+                                // It's totally correct to pass the None as the cursor here, if we are here, there
+                                // was no cursor before anyway, so it's totally fine to pass `None`
+                                yield BlockStreamEvent::Revert(revert_to.clone(), FirehoseCursor::None);
+
+                                latest_cursor = FirehoseCursor::None;
+
+                                // We have to reconnect (see below) but we don't wait to wait before doing
+                                // that, so skip the optional backing off at the end of the loop
+                                skip_backoff = true;
+
+                                // We must restart the stream to ensure we now send block from revert_to point
+                                // and we add + 1 to start block num because Firehose is inclusive and as such,
+                                // we need to move to "next" block.
+                                start_block_num = revert_to.number + 1;
+                                subgraph_current_block = Some(revert_to);
+                                expected_stream_end = true;
+                                break;
+                            },
+                            Err(err) => {
+                                // We have an open connection but there was an error processing the Firehose
+                                // response. We will reconnect the stream after this; this is the case where
+                                // we actually _want_ to back off in case we keep running into the same error.
+                                // An example of this situation is if we get invalid block or transaction data
+                                // that cannot be decoded properly.
+
+                                metrics.observe_response("error", &mut last_response_time);
+
+                                error!(logger, "{:#}", err);
+                                expected_stream_end = true;
+                                break;
+                            }
+                        }
+                    }
+
+                    if !expected_stream_end {
+                        error!(logger, "Stream blocks complete unexpectedly, expecting stream to always stream blocks");
+                    }
+                },
+                Err(e) => {
+                    // We failed to connect and will try again; this is another
+                    // case where we actually _want_ to back off in case we keep
+                    // having connection errors.
+
+                    metrics.observe_failed_connection(&mut connect_start);
+
+                    error!(logger, "Unable to connect to endpoint: {:#}", e);
+                }
+            }
+
+            // If we reach this point, we must wait a bit before retrying, unless `skip_backoff` is true
+            if !skip_backoff {
+                backoff.sleep_async().await;
+            }
+        }
+    }
+}
+
+enum BlockResponse<C: Blockchain> {
+    Proceed(BlockStreamEvent<C>, String),
+    Rewind(BlockPtr),
+}
+
+async fn process_firehose_response<C: Blockchain, F: FirehoseMapper<C>>(
+    result: Result<firehose::Response, Status>,
+    check_subgraph_continuity: &mut bool,
+    manifest_start_block_num: BlockNumber,
+    subgraph_current_block: Option<&BlockPtr>,
+    mapper: &F,
+    adapter: &Arc<dyn TriggersAdapter<C>>,
+    filter: &C::TriggerFilter,
+    logger: &Logger,
+) -> Result<BlockResponse<C>, Error> {
+    let response = result.context("An error occurred while streaming blocks")?;
+
+    let event = mapper
+        .to_block_stream_event(logger, &response, adapter, filter)
+        .await
+        .context("Mapping block to BlockStreamEvent failed")?;
+
+    if *check_subgraph_continuity {
+        info!(logger, "Firehose started from a subgraph pointer without an existing cursor, ensuring chain continuity");
+
+        if let BlockStreamEvent::ProcessBlock(ref block, _) = event {
+            let previous_block_ptr = block.parent_ptr();
+            if previous_block_ptr.is_some() && previous_block_ptr.as_ref() != subgraph_current_block
+            {
+                warn!(&logger,
+                    "Firehose selected first streamed block's parent should match subgraph start block, reverting to last know final chain segment";
+                    "subgraph_current_block" => &subgraph_current_block.unwrap(),
+                    "firehose_start_block" => &previous_block_ptr.unwrap(),
+                );
+
+                let mut revert_to = mapper
+                    .final_block_ptr_for(logger, &block.block)
+                    .await
+                    .context("Could not fetch final block to revert to")?;
+
+                if revert_to.number < manifest_start_block_num {
+                    warn!(&logger, "We would return before subgraph manifest's start block, limiting rewind to manifest's start block");
+
+                    // We must revert up to parent's of manifest start block to ensure we delete everything "including" the start
+                    // block that was processed.
+                    let mut block_num = manifest_start_block_num - 1;
+                    if block_num < 0 {
+                        block_num = 0;
+                    }
+
+                    revert_to = mapper
+                        .block_ptr_for_number(logger, block_num)
+                        .await
+                        .context("Could not fetch manifest start block to revert to")?;
+                }
+
+                return Ok(BlockResponse::Rewind(revert_to));
+            }
+        }
+
+        info!(
+            logger,
+            "Subgraph chain continuity is respected, proceeding normally"
+        );
+        *check_subgraph_continuity = false;
+    }
+
+    Ok(BlockResponse::Proceed(event, response.cursor))
+}
+
+impl<C: Blockchain> Stream for FirehoseBlockStream<C> {
+    type Item = Result<BlockStreamEvent<C>, Error>;
+
+    fn poll_next(mut self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<Option<Self::Item>> {
+        self.stream.poll_next_unpin(cx)
+    }
+}
+
+impl<C: Blockchain> BlockStream<C> for FirehoseBlockStream<C> {}
+
+fn must_check_subgraph_continuity(
+    logger: &Logger,
+    subgraph_current_block: &Option<BlockPtr>,
+    subgraph_cursor: &FirehoseCursor,
+    subgraph_manifest_start_block_number: i32,
+) -> bool {
+    match subgraph_current_block {
+        Some(current_block) if subgraph_cursor.is_none() => {
+            debug!(&logger, "Checking if subgraph current block is after manifest start block";
+                "subgraph_current_block_number" => current_block.number,
+                "manifest_start_block_number" => subgraph_manifest_start_block_number,
+            );
+
+            current_block.number >= subgraph_manifest_start_block_number
+        }
+        _ => false,
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    use crate::blockchain::{
+        block_stream::FirehoseCursor, firehose_block_stream::must_check_subgraph_continuity,
+        BlockPtr,
+    };
+    use slog::{o, Logger};
+
+    #[test]
+    fn check_continuity() {
+        let logger = Logger::root(slog::Discard, o!());
+        let no_current_block: Option<BlockPtr> = None;
+        let no_cursor = FirehoseCursor::None;
+        let some_cursor = FirehoseCursor::from("abc".to_string());
+        let some_current_block = |number: i32| -> Option<BlockPtr> {
+            Some(BlockPtr {
+                hash: vec![0xab, 0xcd].into(),
+                number,
+            })
+        };
+
+        // Nothing
+
+        assert_eq!(
+            must_check_subgraph_continuity(&logger, &no_current_block, &no_cursor, 10),
+            false,
+        );
+
+        // No cursor, subgraph current block ptr <, ==, > than manifest start block num
+
+        assert_eq!(
+            must_check_subgraph_continuity(&logger, &some_current_block(9), &no_cursor, 10),
+            false,
+        );
+
+        assert_eq!(
+            must_check_subgraph_continuity(&logger, &some_current_block(10), &no_cursor, 10),
+            true,
+        );
+
+        assert_eq!(
+            must_check_subgraph_continuity(&logger, &some_current_block(11), &no_cursor, 10),
+            true,
+        );
+
+        // Some cursor, subgraph current block ptr <, ==, > than manifest start block num
+
+        assert_eq!(
+            must_check_subgraph_continuity(&logger, &no_current_block, &some_cursor, 10),
+            false,
+        );
+
+        assert_eq!(
+            must_check_subgraph_continuity(&logger, &some_current_block(9), &some_cursor, 10),
+            false,
+        );
+
+        assert_eq!(
+            must_check_subgraph_continuity(&logger, &some_current_block(10), &some_cursor, 10),
+            false,
+        );
+
+        assert_eq!(
+            must_check_subgraph_continuity(&logger, &some_current_block(11), &some_cursor, 10),
+            false,
+        );
+    }
+}
diff --git a/graph/src/blockchain/mock.rs b/graph/src/blockchain/mock.rs
new file mode 100644
index 0000000..5902795
--- /dev/null
+++ b/graph/src/blockchain/mock.rs
@@ -0,0 +1,339 @@
+use crate::{
+    components::{link_resolver::LinkResolver, store::BlockNumber},
+    prelude::DataSourceTemplateInfo,
+};
+use anyhow::Error;
+use async_trait::async_trait;
+use core::fmt;
+use serde::Deserialize;
+use std::{convert::TryFrom, sync::Arc};
+
+use super::{
+    block_stream::{self, FirehoseCursor},
+    HostFn, IngestorError, TriggerWithHandler,
+};
+
+use super::{
+    block_stream::BlockWithTriggers, Block, BlockPtr, Blockchain, BlockchainKind, DataSource,
+    DataSourceTemplate, NodeCapabilities, RuntimeAdapter, TriggerData, TriggerFilter,
+    TriggersAdapter, UnresolvedDataSource, UnresolvedDataSourceTemplate,
+};
+
+#[derive(Debug)]
+pub struct MockBlockchain;
+
+#[derive(Clone, Hash, Eq, PartialEq, Debug, Default)]
+pub struct MockBlock {
+    pub number: u64,
+}
+
+impl Block for MockBlock {
+    fn ptr(&self) -> BlockPtr {
+        todo!()
+    }
+
+    fn parent_ptr(&self) -> Option<BlockPtr> {
+        todo!()
+    }
+}
+
+#[derive(Clone)]
+pub struct MockDataSource;
+
+impl<C: Blockchain> TryFrom<DataSourceTemplateInfo<C>> for MockDataSource {
+    type Error = Error;
+
+    fn try_from(_value: DataSourceTemplateInfo<C>) -> Result<Self, Self::Error> {
+        todo!()
+    }
+}
+
+impl<C: Blockchain> DataSource<C> for MockDataSource {
+    fn address(&self) -> Option<&[u8]> {
+        todo!()
+    }
+
+    fn start_block(&self) -> crate::components::store::BlockNumber {
+        todo!()
+    }
+
+    fn name(&self) -> &str {
+        todo!()
+    }
+
+    fn kind(&self) -> &str {
+        todo!()
+    }
+
+    fn network(&self) -> Option<&str> {
+        todo!()
+    }
+
+    fn context(&self) -> std::sync::Arc<Option<crate::prelude::DataSourceContext>> {
+        todo!()
+    }
+
+    fn creation_block(&self) -> Option<crate::components::store::BlockNumber> {
+        todo!()
+    }
+
+    fn api_version(&self) -> semver::Version {
+        todo!()
+    }
+
+    fn runtime(&self) -> Option<Arc<Vec<u8>>> {
+        todo!()
+    }
+
+    fn match_and_decode(
+        &self,
+        _trigger: &C::TriggerData,
+        _block: &std::sync::Arc<C::Block>,
+        _logger: &slog::Logger,
+    ) -> Result<Option<TriggerWithHandler<C>>, anyhow::Error> {
+        todo!()
+    }
+
+    fn is_duplicate_of(&self, _other: &Self) -> bool {
+        todo!()
+    }
+
+    fn as_stored_dynamic_data_source(&self) -> crate::components::store::StoredDynamicDataSource {
+        todo!()
+    }
+
+    fn from_stored_dynamic_data_source(
+        _template: &C::DataSourceTemplate,
+        _stored: crate::components::store::StoredDynamicDataSource,
+    ) -> Result<Self, anyhow::Error> {
+        todo!()
+    }
+
+    fn validate(&self) -> Vec<anyhow::Error> {
+        todo!()
+    }
+}
+
+#[derive(Clone, Default, Deserialize)]
+pub struct MockUnresolvedDataSource;
+
+#[async_trait]
+impl<C: Blockchain> UnresolvedDataSource<C> for MockUnresolvedDataSource {
+    async fn resolve(
+        self,
+        _resolver: &Arc<dyn LinkResolver>,
+        _logger: &slog::Logger,
+        _manifest_idx: u32,
+    ) -> Result<C::DataSource, anyhow::Error> {
+        todo!()
+    }
+}
+
+#[derive(Debug, Clone)]
+pub struct MockDataSourceTemplate;
+
+impl<C: Blockchain> DataSourceTemplate<C> for MockDataSourceTemplate {
+    fn api_version(&self) -> semver::Version {
+        todo!()
+    }
+
+    fn runtime(&self) -> Option<Arc<Vec<u8>>> {
+        todo!()
+    }
+
+    fn name(&self) -> &str {
+        todo!()
+    }
+
+    fn manifest_idx(&self) -> u32 {
+        todo!()
+    }
+}
+
+#[derive(Clone, Default, Deserialize)]
+pub struct MockUnresolvedDataSourceTemplate;
+
+#[async_trait]
+impl<C: Blockchain> UnresolvedDataSourceTemplate<C> for MockUnresolvedDataSourceTemplate {
+    async fn resolve(
+        self,
+        _resolver: &Arc<dyn LinkResolver>,
+        _logger: &slog::Logger,
+        _manifest_idx: u32,
+    ) -> Result<C::DataSourceTemplate, anyhow::Error> {
+        todo!()
+    }
+}
+
+pub struct MockTriggersAdapter;
+
+#[async_trait]
+impl<C: Blockchain> TriggersAdapter<C> for MockTriggersAdapter {
+    async fn ancestor_block(
+        &self,
+        _ptr: BlockPtr,
+        _offset: BlockNumber,
+    ) -> Result<Option<C::Block>, Error> {
+        todo!()
+    }
+
+    async fn scan_triggers(
+        &self,
+        _from: crate::components::store::BlockNumber,
+        _to: crate::components::store::BlockNumber,
+        _filter: &C::TriggerFilter,
+    ) -> Result<Vec<block_stream::BlockWithTriggers<C>>, Error> {
+        todo!()
+    }
+
+    async fn triggers_in_block(
+        &self,
+        _logger: &slog::Logger,
+        _block: C::Block,
+        _filter: &C::TriggerFilter,
+    ) -> Result<BlockWithTriggers<C>, Error> {
+        todo!()
+    }
+
+    async fn is_on_main_chain(&self, _ptr: BlockPtr) -> Result<bool, Error> {
+        todo!()
+    }
+
+    async fn parent_ptr(&self, _block: &BlockPtr) -> Result<Option<BlockPtr>, Error> {
+        todo!()
+    }
+}
+
+#[derive(Clone, Debug, Eq, PartialEq, Ord, PartialOrd)]
+pub struct MockTriggerData;
+
+impl TriggerData for MockTriggerData {
+    fn error_context(&self) -> String {
+        todo!()
+    }
+}
+
+#[derive(Debug)]
+pub struct MockMappingTrigger {}
+
+#[derive(Clone, Default)]
+pub struct MockTriggerFilter;
+
+impl<C: Blockchain> TriggerFilter<C> for MockTriggerFilter {
+    fn extend<'a>(&mut self, _data_sources: impl Iterator<Item = &'a C::DataSource> + Clone) {
+        todo!()
+    }
+
+    fn node_capabilities(&self) -> C::NodeCapabilities {
+        todo!()
+    }
+
+    fn extend_with_template(
+        &mut self,
+        _data_source: impl Iterator<Item = <C as Blockchain>::DataSourceTemplate>,
+    ) {
+        todo!()
+    }
+
+    fn to_firehose_filter(self) -> Vec<prost_types::Any> {
+        todo!()
+    }
+}
+
+#[derive(Debug)]
+pub struct MockNodeCapabilities;
+
+impl fmt::Display for MockNodeCapabilities {
+    fn fmt(&self, _f: &mut fmt::Formatter<'_>) -> fmt::Result {
+        todo!()
+    }
+}
+
+impl<C: Blockchain> NodeCapabilities<C> for MockNodeCapabilities {
+    fn from_data_sources(_data_sources: &[C::DataSource]) -> Self {
+        todo!()
+    }
+}
+
+pub struct MockRuntimeAdapter;
+
+impl<C: Blockchain> RuntimeAdapter<C> for MockRuntimeAdapter {
+    fn host_fns(&self, _ds: &C::DataSource) -> Result<Vec<HostFn>, Error> {
+        todo!()
+    }
+}
+
+#[async_trait]
+impl Blockchain for MockBlockchain {
+    const KIND: BlockchainKind = BlockchainKind::Ethereum;
+
+    type Block = MockBlock;
+
+    type DataSource = MockDataSource;
+
+    type UnresolvedDataSource = MockUnresolvedDataSource;
+
+    type DataSourceTemplate = MockDataSourceTemplate;
+
+    type UnresolvedDataSourceTemplate = MockUnresolvedDataSourceTemplate;
+
+    type TriggerData = MockTriggerData;
+
+    type MappingTrigger = MockMappingTrigger;
+
+    type TriggerFilter = MockTriggerFilter;
+
+    type NodeCapabilities = MockNodeCapabilities;
+
+    fn triggers_adapter(
+        &self,
+        _loc: &crate::components::store::DeploymentLocator,
+        _capabilities: &Self::NodeCapabilities,
+        _unified_api_version: crate::data::subgraph::UnifiedMappingApiVersion,
+    ) -> Result<std::sync::Arc<dyn TriggersAdapter<Self>>, anyhow::Error> {
+        todo!()
+    }
+
+    async fn new_firehose_block_stream(
+        &self,
+        _deployment: crate::components::store::DeploymentLocator,
+        _block_cursor: FirehoseCursor,
+        _start_blocks: Vec<crate::components::store::BlockNumber>,
+        _subgraph_current_block: Option<BlockPtr>,
+        _filter: std::sync::Arc<Self::TriggerFilter>,
+        _unified_api_version: crate::data::subgraph::UnifiedMappingApiVersion,
+    ) -> Result<Box<dyn block_stream::BlockStream<Self>>, anyhow::Error> {
+        todo!()
+    }
+
+    async fn new_polling_block_stream(
+        &self,
+        _deployment: crate::components::store::DeploymentLocator,
+        _start_blocks: Vec<crate::components::store::BlockNumber>,
+        _subgraph_current_block: Option<BlockPtr>,
+        _filter: std::sync::Arc<Self::TriggerFilter>,
+        _unified_api_version: crate::data::subgraph::UnifiedMappingApiVersion,
+    ) -> Result<Box<dyn block_stream::BlockStream<Self>>, anyhow::Error> {
+        todo!()
+    }
+
+    fn chain_store(&self) -> std::sync::Arc<dyn crate::components::store::ChainStore> {
+        todo!()
+    }
+
+    async fn block_pointer_from_number(
+        &self,
+        _logger: &slog::Logger,
+        _number: crate::components::store::BlockNumber,
+    ) -> Result<BlockPtr, IngestorError> {
+        todo!()
+    }
+
+    fn runtime_adapter(&self) -> std::sync::Arc<dyn RuntimeAdapter<Self>> {
+        todo!()
+    }
+
+    fn is_firehose_supported(&self) -> bool {
+        todo!()
+    }
+}
diff --git a/graph/src/blockchain/mod.rs b/graph/src/blockchain/mod.rs
new file mode 100644
index 0000000..dc18103
--- /dev/null
+++ b/graph/src/blockchain/mod.rs
@@ -0,0 +1,390 @@
+//! The `blockchain` module exports the necessary traits and data structures to integrate a
+//! blockchain into Graph Node. A blockchain is represented by an implementation of the `Blockchain`
+//! trait which is the centerpiece of this module.
+
+pub mod block_stream;
+pub mod firehose_block_ingestor;
+pub mod firehose_block_stream;
+pub mod mock;
+pub mod polling_block_stream;
+pub mod substreams_block_stream;
+mod types;
+
+// Try to reexport most of the necessary types
+use crate::{
+    cheap_clone::CheapClone,
+    components::store::{DeploymentLocator, StoredDynamicDataSource},
+    data::subgraph::UnifiedMappingApiVersion,
+    data_source,
+    prelude::DataSourceContext,
+    runtime::{gas::GasCounter, AscHeap, HostExportError},
+};
+use crate::{
+    components::{
+        store::{BlockNumber, ChainStore},
+        subgraph::DataSourceTemplateInfo,
+    },
+    prelude::{thiserror::Error, LinkResolver},
+};
+use anyhow::{anyhow, Context, Error};
+use async_trait::async_trait;
+use serde::de::DeserializeOwned;
+use serde::{Deserialize, Serialize};
+use slog::Logger;
+use std::{
+    any::Any,
+    collections::HashMap,
+    convert::TryFrom,
+    fmt::{self, Debug},
+    str::FromStr,
+    sync::Arc,
+};
+use web3::types::H256;
+
+pub use block_stream::{ChainHeadUpdateListener, ChainHeadUpdateStream, TriggersAdapter};
+pub use types::{BlockHash, BlockPtr, ChainIdentifier};
+
+use self::block_stream::{BlockStream, FirehoseCursor};
+
+pub trait TriggersAdapterSelector<C: Blockchain>: Sync + Send {
+    fn triggers_adapter(
+        &self,
+        loc: &DeploymentLocator,
+        capabilities: &C::NodeCapabilities,
+        unified_api_version: UnifiedMappingApiVersion,
+    ) -> Result<Arc<dyn TriggersAdapter<C>>, Error>;
+}
+
+pub trait Block: Send + Sync {
+    fn ptr(&self) -> BlockPtr;
+    fn parent_ptr(&self) -> Option<BlockPtr>;
+
+    fn number(&self) -> i32 {
+        self.ptr().number
+    }
+
+    fn hash(&self) -> BlockHash {
+        self.ptr().hash
+    }
+
+    fn parent_hash(&self) -> Option<BlockHash> {
+        self.parent_ptr().map(|ptr| ptr.hash)
+    }
+
+    /// The data that should be stored for this block in the `ChainStore`
+    fn data(&self) -> Result<serde_json::Value, serde_json::Error> {
+        Ok(serde_json::Value::Null)
+    }
+}
+
+#[async_trait]
+// This is only `Debug` because some tests require that
+pub trait Blockchain: Debug + Sized + Send + Sync + Unpin + 'static {
+    const KIND: BlockchainKind;
+    const ALIASES: &'static [&'static str] = &[];
+
+    // The `Clone` bound is used when reprocessing a block, because `triggers_in_block` requires an
+    // owned `Block`. It would be good to come up with a way to remove this bound.
+    type Block: Block + Clone + Debug + Default;
+    type DataSource: DataSource<Self>;
+    type UnresolvedDataSource: UnresolvedDataSource<Self>;
+
+    type DataSourceTemplate: DataSourceTemplate<Self> + Clone;
+    type UnresolvedDataSourceTemplate: UnresolvedDataSourceTemplate<Self> + Clone;
+
+    /// Trigger data as parsed from the triggers adapter.
+    type TriggerData: TriggerData + Ord + Send + Sync + Debug;
+
+    /// Decoded trigger ready to be processed by the mapping.
+    /// New implementations should have this be the same as `TriggerData`.
+    type MappingTrigger: Send + Sync + Debug;
+
+    /// Trigger filter used as input to the triggers adapter.
+    type TriggerFilter: TriggerFilter<Self>;
+
+    type NodeCapabilities: NodeCapabilities<Self> + std::fmt::Display;
+
+    fn triggers_adapter(
+        &self,
+        log: &DeploymentLocator,
+        capabilities: &Self::NodeCapabilities,
+        unified_api_version: UnifiedMappingApiVersion,
+    ) -> Result<Arc<dyn TriggersAdapter<Self>>, Error>;
+
+    async fn new_firehose_block_stream(
+        &self,
+        deployment: DeploymentLocator,
+        block_cursor: FirehoseCursor,
+        start_blocks: Vec<BlockNumber>,
+        subgraph_current_block: Option<BlockPtr>,
+        filter: Arc<Self::TriggerFilter>,
+        unified_api_version: UnifiedMappingApiVersion,
+    ) -> Result<Box<dyn BlockStream<Self>>, Error>;
+
+    async fn new_polling_block_stream(
+        &self,
+        deployment: DeploymentLocator,
+        start_blocks: Vec<BlockNumber>,
+        subgraph_current_block: Option<BlockPtr>,
+        filter: Arc<Self::TriggerFilter>,
+        unified_api_version: UnifiedMappingApiVersion,
+    ) -> Result<Box<dyn BlockStream<Self>>, Error>;
+
+    fn chain_store(&self) -> Arc<dyn ChainStore>;
+
+    async fn block_pointer_from_number(
+        &self,
+        logger: &Logger,
+        number: BlockNumber,
+    ) -> Result<BlockPtr, IngestorError>;
+
+    fn runtime_adapter(&self) -> Arc<dyn RuntimeAdapter<Self>>;
+
+    fn is_firehose_supported(&self) -> bool;
+}
+
+#[derive(Error, Debug)]
+pub enum IngestorError {
+    /// The Ethereum node does not know about this block for some reason, probably because it
+    /// disappeared in a chain reorg.
+    #[error("Block data unavailable, block was likely uncled (block hash = {0:?})")]
+    BlockUnavailable(H256),
+
+    /// The Ethereum node does not know about this block for some reason, probably because it
+    /// disappeared in a chain reorg.
+    #[error("Receipt for tx {1:?} unavailable, block was likely uncled (block hash = {0:?})")]
+    ReceiptUnavailable(H256, H256),
+
+    /// An unexpected error occurred.
+    #[error("Ingestor error: {0:#}")]
+    Unknown(#[from] Error),
+}
+
+impl From<web3::Error> for IngestorError {
+    fn from(e: web3::Error) -> Self {
+        IngestorError::Unknown(anyhow::anyhow!(e))
+    }
+}
+
+pub trait TriggerFilter<C: Blockchain>: Default + Clone + Send + Sync {
+    fn from_data_sources<'a>(
+        data_sources: impl Iterator<Item = &'a C::DataSource> + Clone,
+    ) -> Self {
+        let mut this = Self::default();
+        this.extend(data_sources);
+        this
+    }
+
+    fn extend_with_template(&mut self, data_source: impl Iterator<Item = C::DataSourceTemplate>);
+
+    fn extend<'a>(&mut self, data_sources: impl Iterator<Item = &'a C::DataSource> + Clone);
+
+    fn node_capabilities(&self) -> C::NodeCapabilities;
+
+    fn to_firehose_filter(self) -> Vec<prost_types::Any>;
+}
+
+pub trait DataSource<C: Blockchain>:
+    'static + Sized + Send + Sync + Clone + TryFrom<DataSourceTemplateInfo<C>, Error = anyhow::Error>
+{
+    fn address(&self) -> Option<&[u8]>;
+    fn start_block(&self) -> BlockNumber;
+    fn name(&self) -> &str;
+    fn kind(&self) -> &str;
+    fn network(&self) -> Option<&str>;
+    fn context(&self) -> Arc<Option<DataSourceContext>>;
+    fn creation_block(&self) -> Option<BlockNumber>;
+    fn api_version(&self) -> semver::Version;
+    fn runtime(&self) -> Option<Arc<Vec<u8>>>;
+
+    /// Checks if `trigger` matches this data source, and if so decodes it into a `MappingTrigger`.
+    /// A return of `Ok(None)` mean the trigger does not match.
+    ///
+    /// Performance note: This is very hot code, because in the worst case it could be called a
+    /// quadratic T*D times where T is the total number of triggers in the chain and D is the number
+    /// of data sources in the subgraph. So it could be called billions, or even trillions, of times
+    /// in the sync time of a subgraph.
+    ///
+    /// This is typicaly reduced by the triggers being pre-filtered in the block stream. But with
+    /// dynamic data sources the block stream does not filter on the dynamic parameters, so the
+    /// matching should efficently discard false positives.
+    fn match_and_decode(
+        &self,
+        trigger: &C::TriggerData,
+        block: &Arc<C::Block>,
+        logger: &Logger,
+    ) -> Result<Option<TriggerWithHandler<C>>, Error>;
+
+    fn is_duplicate_of(&self, other: &Self) -> bool;
+
+    fn as_stored_dynamic_data_source(&self) -> StoredDynamicDataSource;
+
+    fn from_stored_dynamic_data_source(
+        template: &C::DataSourceTemplate,
+        stored: StoredDynamicDataSource,
+    ) -> Result<Self, Error>;
+
+    /// Used as part of manifest validation. If there are no errors, return an empty vector.
+    fn validate(&self) -> Vec<Error>;
+}
+
+#[async_trait]
+pub trait UnresolvedDataSourceTemplate<C: Blockchain>:
+    'static + Sized + Send + Sync + DeserializeOwned + Default
+{
+    async fn resolve(
+        self,
+        resolver: &Arc<dyn LinkResolver>,
+        logger: &Logger,
+        manifest_idx: u32,
+    ) -> Result<C::DataSourceTemplate, anyhow::Error>;
+}
+
+pub trait DataSourceTemplate<C: Blockchain>: Send + Sync + Debug {
+    fn api_version(&self) -> semver::Version;
+    fn runtime(&self) -> Option<Arc<Vec<u8>>>;
+    fn name(&self) -> &str;
+    fn manifest_idx(&self) -> u32;
+}
+
+#[async_trait]
+pub trait UnresolvedDataSource<C: Blockchain>:
+    'static + Sized + Send + Sync + DeserializeOwned
+{
+    async fn resolve(
+        self,
+        resolver: &Arc<dyn LinkResolver>,
+        logger: &Logger,
+        manifest_idx: u32,
+    ) -> Result<C::DataSource, anyhow::Error>;
+}
+
+pub trait TriggerData {
+    /// If there is an error when processing this trigger, this will called to add relevant context.
+    /// For example an useful return is: `"block #<N> (<hash>), transaction <tx_hash>".
+    fn error_context(&self) -> String;
+}
+
+pub struct HostFnCtx<'a> {
+    pub logger: Logger,
+    pub block_ptr: BlockPtr,
+    pub heap: &'a mut dyn AscHeap,
+    pub gas: GasCounter,
+}
+
+/// Host fn that receives one u32 argument and returns an u32.
+/// The name for an AS fuction is in the format `<namespace>.<function>`.
+#[derive(Clone)]
+pub struct HostFn {
+    pub name: &'static str,
+    pub func: Arc<dyn Send + Sync + Fn(HostFnCtx, u32) -> Result<u32, HostExportError>>,
+}
+
+impl CheapClone for HostFn {
+    fn cheap_clone(&self) -> Self {
+        HostFn {
+            name: self.name,
+            func: self.func.cheap_clone(),
+        }
+    }
+}
+
+pub trait RuntimeAdapter<C: Blockchain>: Send + Sync {
+    fn host_fns(&self, ds: &C::DataSource) -> Result<Vec<HostFn>, Error>;
+}
+
+pub trait NodeCapabilities<C: Blockchain> {
+    fn from_data_sources(data_sources: &[C::DataSource]) -> Self;
+}
+
+/// Blockchain technologies supported by Graph Node.
+#[derive(Copy, Clone, Debug, PartialEq, Eq, PartialOrd, Ord, Hash, Deserialize, Serialize)]
+#[serde(rename_all = "lowercase")]
+pub enum BlockchainKind {
+    /// Arweave chains that are compatible.
+    Arweave,
+
+    /// Ethereum itself or chains that are compatible.
+    Ethereum,
+
+    /// NEAR chains (Mainnet, Testnet) or chains that are compatible
+    Near,
+
+    /// Cosmos chains
+    Cosmos,
+
+    Substreams,
+}
+
+impl fmt::Display for BlockchainKind {
+    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
+        let value = match self {
+            BlockchainKind::Arweave => "arweave",
+            BlockchainKind::Ethereum => "ethereum",
+            BlockchainKind::Near => "near",
+            BlockchainKind::Cosmos => "cosmos",
+            BlockchainKind::Substreams => "substreams",
+        };
+        write!(f, "{}", value)
+    }
+}
+
+impl FromStr for BlockchainKind {
+    type Err = Error;
+
+    fn from_str(s: &str) -> Result<Self, Self::Err> {
+        match s {
+            "arweave" => Ok(BlockchainKind::Arweave),
+            "ethereum" => Ok(BlockchainKind::Ethereum),
+            "near" => Ok(BlockchainKind::Near),
+            "cosmos" => Ok(BlockchainKind::Cosmos),
+            "substreams" => Ok(BlockchainKind::Substreams),
+            _ => Err(anyhow!("unknown blockchain kind {}", s)),
+        }
+    }
+}
+
+impl BlockchainKind {
+    pub fn from_manifest(manifest: &serde_yaml::Mapping) -> Result<Self, Error> {
+        use serde_yaml::Value;
+
+        // The `kind` field of the first data source in the manifest.
+        //
+        // Split by `/` to, for example, read 'ethereum' in 'ethereum/contracts'.
+        manifest
+            .get(&Value::String("dataSources".to_owned()))
+            .and_then(|ds| ds.as_sequence())
+            .and_then(|ds| ds.first())
+            .and_then(|ds| ds.as_mapping())
+            .and_then(|ds| ds.get(&Value::String("kind".to_owned())))
+            .and_then(|kind| kind.as_str())
+            .and_then(|kind| kind.split('/').next())
+            .context("invalid manifest")
+            .and_then(BlockchainKind::from_str)
+    }
+}
+
+/// A collection of blockchains, keyed by `BlockchainKind` and network.
+#[derive(Default, Debug, Clone)]
+pub struct BlockchainMap(HashMap<(BlockchainKind, String), Arc<dyn Any + Send + Sync>>);
+
+impl BlockchainMap {
+    pub fn new() -> Self {
+        Self::default()
+    }
+
+    pub fn insert<C: Blockchain>(&mut self, network: String, chain: Arc<C>) {
+        self.0.insert((C::KIND, network), chain);
+    }
+
+    pub fn get<C: Blockchain>(&self, network: String) -> Result<Arc<C>, Error> {
+        self.0
+            .get(&(C::KIND, network.clone()))
+            .with_context(|| format!("no network {} found on chain {}", network, C::KIND))?
+            .cheap_clone()
+            .downcast()
+            .map_err(|_| anyhow!("unable to downcast, wrong type for blockchain {}", C::KIND))
+    }
+}
+
+pub type TriggerWithHandler<C> = data_source::TriggerWithHandler<<C as Blockchain>::MappingTrigger>;
diff --git a/graph/src/blockchain/polling_block_stream.rs b/graph/src/blockchain/polling_block_stream.rs
new file mode 100644
index 0000000..daebeef
--- /dev/null
+++ b/graph/src/blockchain/polling_block_stream.rs
@@ -0,0 +1,611 @@
+use anyhow::Error;
+use futures03::{stream::Stream, Future, FutureExt};
+use std::cmp;
+use std::collections::VecDeque;
+use std::pin::Pin;
+use std::sync::Arc;
+use std::task::{Context, Poll};
+use std::time::Duration;
+
+use super::block_stream::{
+    BlockStream, BlockStreamEvent, BlockWithTriggers, ChainHeadUpdateStream, FirehoseCursor,
+    TriggersAdapter,
+};
+use super::{Block, BlockPtr, Blockchain};
+
+use crate::components::store::BlockNumber;
+use crate::data::subgraph::UnifiedMappingApiVersion;
+use crate::prelude::*;
+
+// A high number here forces a slow start.
+const STARTING_PREVIOUS_TRIGGERS_PER_BLOCK: f64 = 1_000_000.0;
+
+enum BlockStreamState<C>
+where
+    C: Blockchain,
+{
+    /// Starting or restarting reconciliation.
+    ///
+    /// Valid next states: Reconciliation
+    BeginReconciliation,
+
+    /// The BlockStream is reconciling the subgraph store state with the chain store state.
+    ///
+    /// Valid next states: YieldingBlocks, Idle, BeginReconciliation (in case of revert)
+    Reconciliation(Pin<Box<dyn Future<Output = Result<NextBlocks<C>, Error>> + Send>>),
+
+    /// The BlockStream is emitting blocks that must be processed in order to bring the subgraph
+    /// store up to date with the chain store.
+    ///
+    /// Valid next states: BeginReconciliation
+    YieldingBlocks(Box<VecDeque<BlockWithTriggers<C>>>),
+
+    /// The BlockStream experienced an error and is pausing before attempting to produce
+    /// blocks again.
+    ///
+    /// Valid next states: BeginReconciliation
+    RetryAfterDelay(Pin<Box<dyn Future<Output = Result<(), Error>> + Send>>),
+
+    /// The BlockStream has reconciled the subgraph store and chain store states.
+    /// No more work is needed until a chain head update.
+    ///
+    /// Valid next states: BeginReconciliation
+    Idle,
+}
+
+/// A single next step to take in reconciling the state of the subgraph store with the state of the
+/// chain store.
+enum ReconciliationStep<C>
+where
+    C: Blockchain,
+{
+    /// Revert(to) the block the subgraph should be reverted to, so it becomes the new subgraph
+    /// head.
+    Revert(BlockPtr),
+
+    /// Move forwards, processing one or more blocks. Second element is the block range size.
+    ProcessDescendantBlocks(Vec<BlockWithTriggers<C>>, BlockNumber),
+
+    /// This step is a no-op, but we need to check again for a next step.
+    Retry,
+
+    /// Subgraph pointer now matches chain head pointer.
+    /// Reconciliation is complete.
+    Done,
+}
+
+struct PollingBlockStreamContext<C>
+where
+    C: Blockchain,
+{
+    chain_store: Arc<dyn ChainStore>,
+    adapter: Arc<dyn TriggersAdapter<C>>,
+    node_id: NodeId,
+    subgraph_id: DeploymentHash,
+    // This is not really a block number, but the (unsigned) difference
+    // between two block numbers
+    reorg_threshold: BlockNumber,
+    filter: Arc<C::TriggerFilter>,
+    start_blocks: Vec<BlockNumber>,
+    logger: Logger,
+    previous_triggers_per_block: f64,
+    // Not a BlockNumber, but the difference between two block numbers
+    previous_block_range_size: BlockNumber,
+    // Not a BlockNumber, but the difference between two block numbers
+    max_block_range_size: BlockNumber,
+    target_triggers_per_block_range: u64,
+    unified_api_version: UnifiedMappingApiVersion,
+    current_block: Option<BlockPtr>,
+}
+
+impl<C: Blockchain> Clone for PollingBlockStreamContext<C> {
+    fn clone(&self) -> Self {
+        Self {
+            chain_store: self.chain_store.cheap_clone(),
+            adapter: self.adapter.clone(),
+            node_id: self.node_id.clone(),
+            subgraph_id: self.subgraph_id.clone(),
+            reorg_threshold: self.reorg_threshold,
+            filter: self.filter.clone(),
+            start_blocks: self.start_blocks.clone(),
+            logger: self.logger.clone(),
+            previous_triggers_per_block: self.previous_triggers_per_block,
+            previous_block_range_size: self.previous_block_range_size,
+            max_block_range_size: self.max_block_range_size,
+            target_triggers_per_block_range: self.target_triggers_per_block_range,
+            unified_api_version: self.unified_api_version.clone(),
+            current_block: self.current_block.clone(),
+        }
+    }
+}
+
+pub struct PollingBlockStream<C: Blockchain> {
+    state: BlockStreamState<C>,
+    consecutive_err_count: u32,
+    chain_head_update_stream: ChainHeadUpdateStream,
+    ctx: PollingBlockStreamContext<C>,
+}
+
+// This is the same as `ReconciliationStep` but without retries.
+enum NextBlocks<C>
+where
+    C: Blockchain,
+{
+    /// Blocks and range size
+    Blocks(VecDeque<BlockWithTriggers<C>>, BlockNumber),
+
+    // The payload is block the subgraph should be reverted to, so it becomes the new subgraph head.
+    Revert(BlockPtr),
+    Done,
+}
+
+impl<C> PollingBlockStream<C>
+where
+    C: Blockchain,
+{
+    pub fn new(
+        chain_store: Arc<dyn ChainStore>,
+        chain_head_update_stream: ChainHeadUpdateStream,
+        adapter: Arc<dyn TriggersAdapter<C>>,
+        node_id: NodeId,
+        subgraph_id: DeploymentHash,
+        filter: Arc<C::TriggerFilter>,
+        start_blocks: Vec<BlockNumber>,
+        reorg_threshold: BlockNumber,
+        logger: Logger,
+        max_block_range_size: BlockNumber,
+        target_triggers_per_block_range: u64,
+        unified_api_version: UnifiedMappingApiVersion,
+        start_block: Option<BlockPtr>,
+    ) -> Self {
+        Self {
+            state: BlockStreamState::BeginReconciliation,
+            consecutive_err_count: 0,
+            chain_head_update_stream,
+            ctx: PollingBlockStreamContext {
+                current_block: start_block,
+                chain_store,
+                adapter,
+                node_id,
+                subgraph_id,
+                reorg_threshold,
+                logger,
+                filter,
+                start_blocks,
+                previous_triggers_per_block: STARTING_PREVIOUS_TRIGGERS_PER_BLOCK,
+                previous_block_range_size: 1,
+                max_block_range_size,
+                target_triggers_per_block_range,
+                unified_api_version,
+            },
+        }
+    }
+}
+
+impl<C> PollingBlockStreamContext<C>
+where
+    C: Blockchain,
+{
+    /// Perform reconciliation steps until there are blocks to yield or we are up-to-date.
+    async fn next_blocks(&self) -> Result<NextBlocks<C>, Error> {
+        let ctx = self.clone();
+
+        loop {
+            match ctx.get_next_step().await? {
+                ReconciliationStep::ProcessDescendantBlocks(next_blocks, range_size) => {
+                    return Ok(NextBlocks::Blocks(
+                        next_blocks.into_iter().collect(),
+                        range_size,
+                    ));
+                }
+                ReconciliationStep::Retry => {
+                    continue;
+                }
+                ReconciliationStep::Done => {
+                    return Ok(NextBlocks::Done);
+                }
+                ReconciliationStep::Revert(parent_ptr) => {
+                    return Ok(NextBlocks::Revert(parent_ptr))
+                }
+            }
+        }
+    }
+
+    /// Determine the next reconciliation step. Does not modify Store or ChainStore.
+    async fn get_next_step(&self) -> Result<ReconciliationStep<C>, Error> {
+        let ctx = self.clone();
+        let start_blocks = self.start_blocks.clone();
+        let max_block_range_size = self.max_block_range_size;
+
+        // Get pointers from database for comparison
+        let head_ptr_opt = ctx.chain_store.chain_head_ptr().await?;
+        let subgraph_ptr = self.current_block.clone();
+
+        // If chain head ptr is not set yet
+        let head_ptr = match head_ptr_opt {
+            Some(head_ptr) => head_ptr,
+
+            // Don't do any reconciliation until the chain store has more blocks
+            None => {
+                return Ok(ReconciliationStep::Done);
+            }
+        };
+
+        trace!(
+            ctx.logger, "Chain head pointer";
+            "hash" => format!("{:?}", head_ptr.hash),
+            "number" => &head_ptr.number
+        );
+        trace!(
+            ctx.logger, "Subgraph pointer";
+            "hash" => format!("{:?}", subgraph_ptr.as_ref().map(|block| &block.hash)),
+            "number" => subgraph_ptr.as_ref().map(|block| &block.number),
+        );
+
+        // Make sure not to include genesis in the reorg threshold.
+        let reorg_threshold = ctx.reorg_threshold.min(head_ptr.number);
+
+        // Only continue if the subgraph block ptr is behind the head block ptr.
+        // subgraph_ptr > head_ptr shouldn't happen, but if it does, it's safest to just stop.
+        if let Some(ptr) = &subgraph_ptr {
+            if ptr.number >= head_ptr.number {
+                return Ok(ReconciliationStep::Done);
+            }
+        }
+
+        // Subgraph ptr is behind head ptr.
+        // Let's try to move the subgraph ptr one step in the right direction.
+        // First question: which direction should the ptr be moved?
+        //
+        // We will use a different approach to deciding the step direction depending on how far
+        // the subgraph ptr is behind the head ptr.
+        //
+        // Normally, we need to worry about chain reorganizations -- situations where the
+        // Ethereum client discovers a new longer chain of blocks different from the one we had
+        // processed so far, forcing us to rollback one or more blocks we had already
+        // processed.
+        // We can't assume that blocks we receive are permanent.
+        //
+        // However, as a block receives more and more confirmations, eventually it becomes safe
+        // to assume that that block will be permanent.
+        // The probability of a block being "uncled" approaches zero as more and more blocks
+        // are chained on after that block.
+        // Eventually, the probability is so low, that a block is effectively permanent.
+        // The "effectively permanent" part is what makes blockchains useful.
+        // See here for more discussion:
+        // https://blog.ethereum.org/2016/05/09/on-settlement-finality/
+        //
+        // Accordingly, if the subgraph ptr is really far behind the head ptr, then we can
+        // trust that the Ethereum node knows what the real, permanent block is for that block
+        // number.
+        // We'll define "really far" to mean "greater than reorg_threshold blocks".
+        //
+        // If the subgraph ptr is not too far behind the head ptr (i.e. less than
+        // reorg_threshold blocks behind), then we have to allow for the possibility that the
+        // block might be on the main chain now, but might become uncled in the future.
+        //
+        // Most importantly: Our ability to make this assumption (or not) will determine what
+        // Ethereum RPC calls can give us accurate data without race conditions.
+        // (This is mostly due to some unfortunate API design decisions on the Ethereum side)
+        if subgraph_ptr.is_none()
+            || (head_ptr.number - subgraph_ptr.as_ref().unwrap().number) > reorg_threshold
+        {
+            // Since we are beyond the reorg threshold, the Ethereum node knows what block has
+            // been permanently assigned this block number.
+            // This allows us to ask the node: does subgraph_ptr point to a block that was
+            // permanently accepted into the main chain, or does it point to a block that was
+            // uncled?
+            let is_on_main_chain = match &subgraph_ptr {
+                Some(ptr) => ctx.adapter.is_on_main_chain(ptr.clone()).await?,
+                None => true,
+            };
+            if !is_on_main_chain {
+                // The subgraph ptr points to a block that was uncled.
+                // We need to revert this block.
+                //
+                // Note: We can safely unwrap the subgraph ptr here, because
+                // if it was `None`, `is_on_main_chain` would be true.
+                let from = subgraph_ptr.unwrap();
+                let parent = self.parent_ptr(&from, "is_on_main_chain").await?;
+
+                return Ok(ReconciliationStep::Revert(parent));
+            }
+
+            // The subgraph ptr points to a block on the main chain.
+            // This means that the last block we processed does not need to be
+            // reverted.
+            // Therefore, our direction of travel will be forward, towards the
+            // chain head.
+
+            // As an optimization, instead of advancing one block, we will use an
+            // Ethereum RPC call to find the first few blocks that have event(s) we
+            // are interested in that lie within the block range between the subgraph ptr
+            // and either the next data source start_block or the reorg threshold.
+            // Note that we use block numbers here.
+            // This is an artifact of Ethereum RPC limitations.
+            // It is only safe to use block numbers because we are beyond the reorg
+            // threshold.
+
+            // Start with first block after subgraph ptr; if the ptr is None,
+            // then we start with the genesis block
+            let from = subgraph_ptr.map_or(0, |ptr| ptr.number + 1);
+
+            // Get the next subsequent data source start block to ensure the block
+            // range is aligned with data source. This is not necessary for
+            // correctness, but it avoids an ineffecient situation such as the range
+            // being 0..100 and the start block for a data source being 99, then
+            // `calls_in_block_range` would request unecessary traces for the blocks
+            // 0 to 98 because the start block is within the range.
+            let next_start_block: BlockNumber = start_blocks
+                .into_iter()
+                .filter(|block_num| block_num > &from)
+                .min()
+                .unwrap_or(BLOCK_NUMBER_MAX);
+
+            // End either just before the the next data source start_block or just
+            // prior to the reorg threshold. It isn't safe to go farther than the
+            // reorg threshold due to race conditions.
+            let to_limit = cmp::min(head_ptr.number - reorg_threshold, next_start_block - 1);
+
+            // Calculate the range size according to the target number of triggers,
+            // respecting the global maximum and also not increasing too
+            // drastically from the previous block range size.
+            //
+            // An example of the block range dynamics:
+            // - Start with a block range of 1, target of 1000.
+            // - Scan 1 block:
+            //   0 triggers found, max_range_size = 10, range_size = 10
+            // - Scan 10 blocks:
+            //   2 triggers found, 0.2 per block, range_size = 1000 / 0.2 = 5000
+            // - Scan 5000 blocks:
+            //   10000 triggers found, 2 per block, range_size = 1000 / 2 = 500
+            // - Scan 500 blocks:
+            //   1000 triggers found, 2 per block, range_size = 1000 / 2 = 500
+            let range_size_upper_limit =
+                max_block_range_size.min(ctx.previous_block_range_size * 10);
+            let range_size = if ctx.previous_triggers_per_block == 0.0 {
+                range_size_upper_limit
+            } else {
+                (self.target_triggers_per_block_range as f64 / ctx.previous_triggers_per_block)
+                    .max(1.0)
+                    .min(range_size_upper_limit as f64) as BlockNumber
+            };
+            let to = cmp::min(from + range_size - 1, to_limit);
+
+            info!(
+                ctx.logger,
+                "Scanning blocks [{}, {}]", from, to;
+                "range_size" => range_size
+            );
+
+            let blocks = self.adapter.scan_triggers(from, to, &self.filter).await?;
+
+            Ok(ReconciliationStep::ProcessDescendantBlocks(
+                blocks, range_size,
+            ))
+        } else {
+            // The subgraph ptr is not too far behind the head ptr.
+            // This means a few things.
+            //
+            // First, because we are still within the reorg threshold,
+            // we can't trust the Ethereum RPC methods that use block numbers.
+            // Block numbers in this region are not yet immutable pointers to blocks;
+            // the block associated with a particular block number on the Ethereum node could
+            // change under our feet at any time.
+            //
+            // Second, due to how the BlockIngestor is designed, we get a helpful guarantee:
+            // the head block and at least its reorg_threshold most recent ancestors will be
+            // present in the block store.
+            // This allows us to work locally in the block store instead of relying on
+            // Ethereum RPC calls, so that we are not subject to the limitations of the RPC
+            // API.
+
+            // To determine the step direction, we need to find out if the subgraph ptr refers
+            // to a block that is an ancestor of the head block.
+            // We can do so by walking back up the chain from the head block to the appropriate
+            // block number, and checking to see if the block we found matches the
+            // subgraph_ptr.
+
+            let subgraph_ptr =
+                subgraph_ptr.expect("subgraph block pointer should not be `None` here");
+
+            // Precondition: subgraph_ptr.number < head_ptr.number
+            // Walk back to one block short of subgraph_ptr.number
+            let offset = head_ptr.number - subgraph_ptr.number - 1;
+
+            // In principle this block should be in the store, but we have seen this error for deep
+            // reorgs in ropsten.
+            let head_ancestor_opt = self.adapter.ancestor_block(head_ptr, offset).await?;
+
+            match head_ancestor_opt {
+                None => {
+                    // Block is missing in the block store.
+                    // This generally won't happen often, but can happen if the head ptr has
+                    // been updated since we retrieved the head ptr, and the block store has
+                    // been garbage collected.
+                    // It's easiest to start over at this point.
+                    Ok(ReconciliationStep::Retry)
+                }
+                Some(head_ancestor) => {
+                    // We stopped one block short, so we'll compare the parent hash to the
+                    // subgraph ptr.
+                    if head_ancestor.parent_hash().as_ref() == Some(&subgraph_ptr.hash) {
+                        // The subgraph ptr is an ancestor of the head block.
+                        // We cannot use an RPC call here to find the first interesting block
+                        // due to the race conditions previously mentioned,
+                        // so instead we will advance the subgraph ptr by one block.
+                        // Note that head_ancestor is a child of subgraph_ptr.
+                        let block = self
+                            .adapter
+                            .triggers_in_block(&self.logger, head_ancestor, &self.filter)
+                            .await?;
+                        Ok(ReconciliationStep::ProcessDescendantBlocks(vec![block], 1))
+                    } else {
+                        let parent = self.parent_ptr(&subgraph_ptr, "nonfinal").await?;
+
+                        // The subgraph ptr is not on the main chain.
+                        // We will need to step back (possibly repeatedly) one block at a time
+                        // until we are back on the main chain.
+                        Ok(ReconciliationStep::Revert(parent))
+                    }
+                }
+            }
+        }
+    }
+
+    async fn parent_ptr(&self, block_ptr: &BlockPtr, reason: &str) -> Result<BlockPtr, Error> {
+        let ptr =
+            self.adapter.parent_ptr(block_ptr).await?.ok_or_else(|| {
+                anyhow!("Failed to get parent pointer for {block_ptr} ({reason})")
+            })?;
+
+        Ok(ptr)
+    }
+}
+
+impl<C: Blockchain> BlockStream<C> for PollingBlockStream<C> {}
+
+impl<C: Blockchain> Stream for PollingBlockStream<C> {
+    type Item = Result<BlockStreamEvent<C>, Error>;
+
+    fn poll_next(mut self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<Option<Self::Item>> {
+        let result = loop {
+            match &mut self.state {
+                BlockStreamState::BeginReconciliation => {
+                    // Start the reconciliation process by asking for blocks
+                    let ctx = self.ctx.clone();
+                    let fut = async move { ctx.next_blocks().await };
+                    self.state = BlockStreamState::Reconciliation(fut.boxed());
+                }
+
+                // Waiting for the reconciliation to complete or yield blocks
+                BlockStreamState::Reconciliation(next_blocks_future) => {
+                    match next_blocks_future.poll_unpin(cx) {
+                        Poll::Ready(Ok(next_block_step)) => match next_block_step {
+                            NextBlocks::Blocks(next_blocks, block_range_size) => {
+                                // We had only one error, so we infer that reducing the range size is
+                                // what fixed it. Reduce the max range size to prevent future errors.
+                                // See: 018c6df4-132f-4acc-8697-a2d64e83a9f0
+                                if self.consecutive_err_count == 1 {
+                                    // Reduce the max range size by 10%, but to no less than 10.
+                                    self.ctx.max_block_range_size =
+                                        (self.ctx.max_block_range_size * 9 / 10).max(10);
+                                }
+                                self.consecutive_err_count = 0;
+
+                                let total_triggers =
+                                    next_blocks.iter().map(|b| b.trigger_count()).sum::<usize>();
+                                self.ctx.previous_triggers_per_block =
+                                    total_triggers as f64 / block_range_size as f64;
+                                self.ctx.previous_block_range_size = block_range_size;
+                                if total_triggers > 0 {
+                                    debug!(
+                                        self.ctx.logger,
+                                        "Processing {} triggers", total_triggers
+                                    );
+                                }
+
+                                // Switch to yielding state until next_blocks is depleted
+                                self.state =
+                                    BlockStreamState::YieldingBlocks(Box::new(next_blocks));
+
+                                // Yield the first block in next_blocks
+                                continue;
+                            }
+                            // Reconciliation completed. We're caught up to chain head.
+                            NextBlocks::Done => {
+                                // Reset error count
+                                self.consecutive_err_count = 0;
+
+                                // Switch to idle
+                                self.state = BlockStreamState::Idle;
+
+                                // Poll for chain head update
+                                continue;
+                            }
+                            NextBlocks::Revert(parent_ptr) => {
+                                self.ctx.current_block = Some(parent_ptr.clone());
+
+                                self.state = BlockStreamState::BeginReconciliation;
+                                break Poll::Ready(Some(Ok(BlockStreamEvent::Revert(
+                                    parent_ptr,
+                                    FirehoseCursor::None,
+                                ))));
+                            }
+                        },
+                        Poll::Pending => break Poll::Pending,
+                        Poll::Ready(Err(e)) => {
+                            // Reset the block range size in an attempt to recover from the error.
+                            // See also: 018c6df4-132f-4acc-8697-a2d64e83a9f0
+                            self.ctx.previous_triggers_per_block =
+                                STARTING_PREVIOUS_TRIGGERS_PER_BLOCK;
+                            self.consecutive_err_count += 1;
+
+                            // Pause before trying again
+                            let secs = (5 * self.consecutive_err_count).max(120) as u64;
+
+                            self.state = BlockStreamState::RetryAfterDelay(Box::pin(
+                                tokio::time::sleep(Duration::from_secs(secs)).map(Ok),
+                            ));
+
+                            break Poll::Ready(Some(Err(e)));
+                        }
+                    }
+                }
+
+                // Yielding blocks from reconciliation process
+                BlockStreamState::YieldingBlocks(ref mut next_blocks) => {
+                    match next_blocks.pop_front() {
+                        // Yield one block
+                        Some(next_block) => {
+                            self.ctx.current_block = Some(next_block.block.ptr());
+
+                            break Poll::Ready(Some(Ok(BlockStreamEvent::ProcessBlock(
+                                next_block,
+                                FirehoseCursor::None,
+                            ))));
+                        }
+
+                        // Done yielding blocks
+                        None => {
+                            self.state = BlockStreamState::BeginReconciliation;
+                        }
+                    }
+                }
+
+                // Pausing after an error, before looking for more blocks
+                BlockStreamState::RetryAfterDelay(ref mut delay) => match delay.as_mut().poll(cx) {
+                    Poll::Ready(Ok(..)) | Poll::Ready(Err(_)) => {
+                        self.state = BlockStreamState::BeginReconciliation;
+                    }
+
+                    Poll::Pending => {
+                        break Poll::Pending;
+                    }
+                },
+
+                // Waiting for a chain head update
+                BlockStreamState::Idle => {
+                    match Pin::new(self.chain_head_update_stream.as_mut()).poll_next(cx) {
+                        // Chain head was updated
+                        Poll::Ready(Some(())) => {
+                            self.state = BlockStreamState::BeginReconciliation;
+                        }
+
+                        // Chain head update stream ended
+                        Poll::Ready(None) => {
+                            // Should not happen
+                            return Poll::Ready(Some(Err(anyhow::anyhow!(
+                                "chain head update stream ended unexpectedly"
+                            ))));
+                        }
+
+                        Poll::Pending => break Poll::Pending,
+                    }
+                }
+            }
+        };
+
+        result
+    }
+}
diff --git a/graph/src/blockchain/substreams_block_stream.rs b/graph/src/blockchain/substreams_block_stream.rs
new file mode 100644
index 0000000..291e14b
--- /dev/null
+++ b/graph/src/blockchain/substreams_block_stream.rs
@@ -0,0 +1,323 @@
+use super::block_stream::SubstreamsMapper;
+use crate::blockchain::block_stream::{BlockStream, BlockStreamEvent};
+use crate::blockchain::Blockchain;
+use crate::firehose::FirehoseEndpoint;
+use crate::prelude::*;
+use crate::substreams::response::Message;
+use crate::substreams::ForkStep::{StepNew, StepUndo};
+use crate::substreams::{Modules, Request, Response};
+use crate::util::backoff::ExponentialBackoff;
+use async_stream::try_stream;
+use futures03::{Stream, StreamExt};
+use std::sync::Arc;
+use std::task::{Context, Poll};
+use std::time::{Duration, Instant};
+use tonic::Status;
+
+struct SubstreamsBlockStreamMetrics {
+    deployment: DeploymentHash,
+    provider: String,
+    restarts: CounterVec,
+    connect_duration: GaugeVec,
+    time_between_responses: HistogramVec,
+    responses: CounterVec,
+}
+
+impl SubstreamsBlockStreamMetrics {
+    pub fn new(
+        registry: Arc<dyn MetricsRegistry>,
+        deployment: DeploymentHash,
+        provider: String,
+    ) -> Self {
+        Self {
+            deployment,
+            provider,
+
+            restarts: registry
+                .global_counter_vec(
+                    "deployment_substreams_blockstream_restarts",
+                    "Counts the number of times a Substreams block stream is (re)started",
+                    vec!["deployment", "provider", "success"].as_slice(),
+                )
+                .unwrap(),
+
+            connect_duration: registry
+                .global_gauge_vec(
+                    "deployment_substreams_blockstream_connect_duration",
+                    "Measures the time it takes to connect a Substreams block stream",
+                    vec!["deployment", "provider"].as_slice(),
+                )
+                .unwrap(),
+
+            time_between_responses: registry
+                .global_histogram_vec(
+                    "deployment_substreams_blockstream_time_between_responses",
+                    "Measures the time between receiving and processing Substreams stream responses",
+                    vec!["deployment", "provider"].as_slice(),
+                )
+                .unwrap(),
+
+            responses: registry
+                .global_counter_vec(
+                    "deployment_substreams_blockstream_responses",
+                    "Counts the number of responses received from a Substreams block stream",
+                    vec!["deployment", "provider", "kind"].as_slice(),
+                )
+                .unwrap(),
+        }
+    }
+
+    fn observe_successful_connection(&self, time: &mut Instant) {
+        self.restarts
+            .with_label_values(&[&self.deployment, &self.provider, "true"])
+            .inc();
+        self.connect_duration
+            .with_label_values(&[&self.deployment, &self.provider])
+            .set(time.elapsed().as_secs_f64());
+
+        // Reset last connection timestamp
+        *time = Instant::now();
+    }
+
+    fn observe_failed_connection(&self, time: &mut Instant) {
+        self.restarts
+            .with_label_values(&[&self.deployment, &self.provider, "false"])
+            .inc();
+        self.connect_duration
+            .with_label_values(&[&self.deployment, &self.provider])
+            .set(time.elapsed().as_secs_f64());
+
+        // Reset last connection timestamp
+        *time = Instant::now();
+    }
+
+    fn observe_response(&self, kind: &str, time: &mut Instant) {
+        self.time_between_responses
+            .with_label_values(&[&self.deployment, &self.provider])
+            .observe(time.elapsed().as_secs_f64());
+        self.responses
+            .with_label_values(&[&self.deployment, &self.provider, kind])
+            .inc();
+
+        // Reset last response timestamp
+        *time = Instant::now();
+    }
+}
+
+pub struct SubstreamsBlockStream<C: Blockchain> {
+    //fixme: not sure if this is ok to be set as public, maybe
+    // we do not want to expose the stream to the caller
+    stream: Pin<Box<dyn Stream<Item = Result<BlockStreamEvent<C>, Error>> + Send>>,
+}
+
+impl<C> SubstreamsBlockStream<C>
+where
+    C: Blockchain,
+{
+    pub fn new<F>(
+        deployment: DeploymentHash,
+        endpoint: Arc<FirehoseEndpoint>,
+        subgraph_current_block: Option<BlockPtr>,
+        cursor: Option<String>,
+        mapper: Arc<F>,
+        modules: Option<Modules>,
+        module_name: String,
+        start_blocks: Vec<BlockNumber>,
+        end_blocks: Vec<BlockNumber>,
+        logger: Logger,
+        registry: Arc<dyn MetricsRegistry>,
+    ) -> Self
+    where
+        F: SubstreamsMapper<C> + 'static,
+    {
+        let manifest_start_block_num = start_blocks.into_iter().min().unwrap_or(0);
+
+        let manifest_end_block_num = end_blocks.into_iter().min().unwrap_or(0);
+
+        let metrics =
+            SubstreamsBlockStreamMetrics::new(registry, deployment, endpoint.provider.clone());
+
+        SubstreamsBlockStream {
+            stream: Box::pin(stream_blocks(
+                endpoint,
+                cursor,
+                mapper,
+                modules,
+                module_name,
+                manifest_start_block_num,
+                manifest_end_block_num,
+                subgraph_current_block,
+                logger,
+                metrics,
+            )),
+        }
+    }
+}
+
+fn stream_blocks<C: Blockchain, F: SubstreamsMapper<C>>(
+    endpoint: Arc<FirehoseEndpoint>,
+    cursor: Option<String>,
+    mapper: Arc<F>,
+    modules: Option<Modules>,
+    module_name: String,
+    manifest_start_block_num: BlockNumber,
+    manifest_end_block_num: BlockNumber,
+    _subgraph_current_block: Option<BlockPtr>,
+    logger: Logger,
+    metrics: SubstreamsBlockStreamMetrics,
+) -> impl Stream<Item = Result<BlockStreamEvent<C>, Error>> {
+    let mut latest_cursor = cursor.unwrap_or_else(|| "".to_string());
+
+    let start_block_num = manifest_start_block_num as i64;
+    let stop_block_num = manifest_end_block_num as u64;
+
+    let request = Request {
+        start_block_num,
+        start_cursor: latest_cursor.clone(),
+        stop_block_num,
+        fork_steps: vec![StepNew as i32, StepUndo as i32],
+        irreversibility_condition: "".to_string(),
+        modules,
+        output_modules: vec![module_name],
+        ..Default::default()
+    };
+
+    // Back off exponentially whenever we encounter a connection error or a stream with bad data
+    let mut backoff = ExponentialBackoff::new(Duration::from_millis(500), Duration::from_secs(45));
+
+    // This attribute is needed because `try_stream!` seems to break detection of `skip_backoff` assignments
+    #[allow(unused_assignments)]
+    let mut skip_backoff = false;
+
+    try_stream! {
+        loop {
+            info!(
+                &logger,
+                "Blockstreams disconnected, connecting";
+                "endpoint_uri" => format_args!("{}", endpoint),
+                "start_block" => start_block_num,
+                "cursor" => &latest_cursor,
+            );
+
+            // We just reconnected, assume that we want to back off on errors
+            skip_backoff = false;
+
+            let mut connect_start = Instant::now();
+            let result = endpoint.clone().substreams(request.clone()).await;
+
+            match result {
+                Ok(stream) => {
+                    info!(&logger, "Blockstreams connected");
+
+                    // Track the time it takes to set up the block stream
+                    metrics.observe_successful_connection(&mut connect_start);
+
+                    let mut last_response_time = Instant::now();
+                    let mut expected_stream_end = false;
+
+                    for await response in stream{
+                        match process_substreams_response(
+                            response,
+                            mapper.as_ref(),
+                            &logger,
+                        ).await {
+                            Ok(block_response) => {
+                                match block_response {
+                                    None => {}
+                                    Some(BlockResponse::Proceed(event, cursor)) => {
+                                        // Reset backoff because we got a good value from the stream
+                                        backoff.reset();
+
+                                        metrics.observe_response("proceed", &mut last_response_time);
+
+                                        yield event;
+
+                                        latest_cursor = cursor;
+                                    }
+                                }
+                            },
+                            Err(err) => {
+                                info!(&logger, "received err");
+                                // We have an open connection but there was an error processing the Firehose
+                                // response. We will reconnect the stream after this; this is the case where
+                                // we actually _want_ to back off in case we keep running into the same error.
+                                // An example of this situation is if we get invalid block or transaction data
+                                // that cannot be decoded properly.
+
+                                metrics.observe_response("error", &mut last_response_time);
+
+                                error!(logger, "{:#}", err);
+                                expected_stream_end = true;
+                                break;
+                            }
+                        }
+                    }
+
+                    if !expected_stream_end {
+                        error!(logger, "Stream blocks complete unexpectedly, expecting stream to always stream blocks");
+                    }
+                },
+                Err(e) => {
+                    // We failed to connect and will try again; this is another
+                    // case where we actually _want_ to back off in case we keep
+                    // having connection errors.
+
+                    metrics.observe_failed_connection(&mut connect_start);
+
+                    error!(logger, "Unable to connect to endpoint: {:?}", e);
+                }
+            }
+
+            // If we reach this point, we must wait a bit before retrying, unless `skip_backoff` is true
+            if !skip_backoff {
+                backoff.sleep_async().await;
+            }
+        }
+    }
+}
+
+enum BlockResponse<C: Blockchain> {
+    Proceed(BlockStreamEvent<C>, String),
+}
+
+async fn process_substreams_response<C: Blockchain, F: SubstreamsMapper<C>>(
+    result: Result<Response, Status>,
+    mapper: &F,
+    logger: &Logger,
+) -> Result<Option<BlockResponse<C>>, Error> {
+    let response = match result {
+        Ok(v) => v,
+        Err(e) => return Err(anyhow!("An error occurred while streaming blocks: {:?}", e)),
+    };
+
+    match response.message {
+        Some(Message::Data(block_scoped_data)) => {
+            match mapper
+                .to_block_stream_event(logger, &block_scoped_data)
+                .await
+                .context("Mapping block to BlockStreamEvent failed")?
+            {
+                Some(event) => Ok(Some(BlockResponse::Proceed(
+                    event,
+                    block_scoped_data.cursor.to_string(),
+                ))),
+                None => Ok(None),
+            }
+        }
+        None => {
+            warn!(&logger, "Got None on substream message");
+            Ok(None)
+        }
+        _ => Ok(None),
+    }
+}
+
+impl<C: Blockchain> Stream for SubstreamsBlockStream<C> {
+    type Item = Result<BlockStreamEvent<C>, Error>;
+
+    fn poll_next(mut self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<Option<Self::Item>> {
+        self.stream.poll_next_unpin(cx)
+    }
+}
+
+impl<C: Blockchain> BlockStream<C> for SubstreamsBlockStream<C> {}
diff --git a/graph/src/blockchain/types.rs b/graph/src/blockchain/types.rs
new file mode 100644
index 0000000..de7bbce
--- /dev/null
+++ b/graph/src/blockchain/types.rs
@@ -0,0 +1,282 @@
+use anyhow::anyhow;
+use std::convert::TryFrom;
+use std::{fmt, str::FromStr};
+use web3::types::{Block, H256};
+
+use crate::data::graphql::IntoValue;
+use crate::object;
+use crate::prelude::{r, BigInt, TryFromValue, ValueMap};
+use crate::util::stable_hash_glue::{impl_stable_hash, AsBytes};
+use crate::{cheap_clone::CheapClone, components::store::BlockNumber};
+
+/// A simple marker for byte arrays that are really block hashes
+#[derive(Clone, Default, PartialEq, Eq, Hash)]
+pub struct BlockHash(pub Box<[u8]>);
+
+impl_stable_hash!(BlockHash(transparent: AsBytes));
+
+impl BlockHash {
+    pub fn as_slice(&self) -> &[u8] {
+        &self.0
+    }
+
+    /// Encodes the block hash into a hexadecimal string **without** a "0x"
+    /// prefix. Hashes are stored in the database in this format when the
+    /// schema uses `text` columns, which is a legacy and such columns
+    /// should be changed to use `bytea`
+    pub fn hash_hex(&self) -> String {
+        hex::encode(&self.0)
+    }
+
+    pub fn zero() -> Self {
+        Self::from(H256::zero())
+    }
+}
+
+impl fmt::Display for BlockHash {
+    fn fmt(&self, f: &mut fmt::Formatter) -> Result<(), fmt::Error> {
+        write!(f, "0x{}", hex::encode(&self.0))
+    }
+}
+
+impl fmt::Debug for BlockHash {
+    fn fmt(&self, f: &mut fmt::Formatter) -> Result<(), fmt::Error> {
+        write!(f, "0x{}", hex::encode(&self.0))
+    }
+}
+
+impl fmt::LowerHex for BlockHash {
+    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
+        f.write_str(&hex::encode(&self.0))
+    }
+}
+
+impl CheapClone for BlockHash {}
+
+impl From<H256> for BlockHash {
+    fn from(hash: H256) -> Self {
+        BlockHash(hash.as_bytes().into())
+    }
+}
+
+impl From<Vec<u8>> for BlockHash {
+    fn from(bytes: Vec<u8>) -> Self {
+        BlockHash(bytes.as_slice().into())
+    }
+}
+
+impl TryFrom<&str> for BlockHash {
+    type Error = anyhow::Error;
+
+    fn try_from(hash: &str) -> Result<Self, Self::Error> {
+        let hash = hash.trim_start_matches("0x");
+        let hash = hex::decode(hash)?;
+
+        Ok(BlockHash(hash.as_slice().into()))
+    }
+}
+
+impl FromStr for BlockHash {
+    type Err = anyhow::Error;
+
+    fn from_str(hash: &str) -> Result<Self, Self::Err> {
+        Self::try_from(hash)
+    }
+}
+
+/// A block hash and block number from a specific Ethereum block.
+///
+/// Block numbers are signed 32 bit integers
+#[derive(Clone, PartialEq, Eq, Hash)]
+pub struct BlockPtr {
+    pub hash: BlockHash,
+    pub number: BlockNumber,
+}
+
+impl CheapClone for BlockPtr {}
+
+impl_stable_hash!(BlockPtr { hash, number });
+
+impl BlockPtr {
+    pub fn new(hash: BlockHash, number: BlockNumber) -> Self {
+        Self { hash, number }
+    }
+
+    /// Encodes the block hash into a hexadecimal string **without** a "0x" prefix.
+    /// Hashes are stored in the database in this format.
+    pub fn hash_hex(&self) -> String {
+        self.hash.hash_hex()
+    }
+
+    /// Block number to be passed into the store. Panics if it does not fit in an i32.
+    pub fn block_number(&self) -> BlockNumber {
+        self.number
+    }
+
+    // FIXME:
+    //
+    // workaround for arweave
+    pub fn hash_as_h256(&self) -> H256 {
+        H256::from_slice(&self.hash_slice()[..32])
+    }
+
+    pub fn hash_slice(&self) -> &[u8] {
+        self.hash.0.as_ref()
+    }
+}
+
+impl fmt::Display for BlockPtr {
+    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
+        write!(f, "#{} ({})", self.number, self.hash_hex())
+    }
+}
+
+impl fmt::Debug for BlockPtr {
+    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
+        write!(f, "#{} ({})", self.number, self.hash_hex())
+    }
+}
+
+impl slog::Value for BlockPtr {
+    fn serialize(
+        &self,
+        record: &slog::Record,
+        key: slog::Key,
+        serializer: &mut dyn slog::Serializer,
+    ) -> slog::Result {
+        slog::Value::serialize(&self.to_string(), record, key, serializer)
+    }
+}
+
+impl<T> From<Block<T>> for BlockPtr {
+    fn from(b: Block<T>) -> BlockPtr {
+        BlockPtr::from((b.hash.unwrap(), b.number.unwrap().as_u64()))
+    }
+}
+
+impl<'a, T> From<&'a Block<T>> for BlockPtr {
+    fn from(b: &'a Block<T>) -> BlockPtr {
+        BlockPtr::from((b.hash.unwrap(), b.number.unwrap().as_u64()))
+    }
+}
+
+impl From<(Vec<u8>, i32)> for BlockPtr {
+    fn from((bytes, number): (Vec<u8>, i32)) -> Self {
+        BlockPtr {
+            hash: BlockHash::from(bytes),
+            number,
+        }
+    }
+}
+
+impl From<(H256, i32)> for BlockPtr {
+    fn from((hash, number): (H256, i32)) -> BlockPtr {
+        BlockPtr {
+            hash: hash.into(),
+            number,
+        }
+    }
+}
+
+impl From<(Vec<u8>, u64)> for BlockPtr {
+    fn from((bytes, number): (Vec<u8>, u64)) -> Self {
+        let number = i32::try_from(number).unwrap();
+        BlockPtr {
+            hash: BlockHash::from(bytes),
+            number,
+        }
+    }
+}
+
+impl From<(H256, u64)> for BlockPtr {
+    fn from((hash, number): (H256, u64)) -> BlockPtr {
+        let number = i32::try_from(number).unwrap();
+
+        BlockPtr::from((hash, number))
+    }
+}
+
+impl From<(H256, i64)> for BlockPtr {
+    fn from((hash, number): (H256, i64)) -> BlockPtr {
+        if number < 0 {
+            panic!("block number out of range: {}", number);
+        }
+
+        BlockPtr::from((hash, number as u64))
+    }
+}
+
+impl TryFrom<(&str, i64)> for BlockPtr {
+    type Error = anyhow::Error;
+
+    fn try_from((hash, number): (&str, i64)) -> Result<Self, Self::Error> {
+        let hash = hash.trim_start_matches("0x");
+        let hash = BlockHash::from_str(hash)?;
+
+        Ok(BlockPtr::new(hash, number as i32))
+    }
+}
+
+impl TryFrom<(&[u8], i64)> for BlockPtr {
+    type Error = anyhow::Error;
+
+    fn try_from((bytes, number): (&[u8], i64)) -> Result<Self, Self::Error> {
+        let hash = if bytes.len() == H256::len_bytes() {
+            H256::from_slice(bytes)
+        } else {
+            return Err(anyhow!(
+                "invalid H256 value `{}` has {} bytes instead of {}",
+                hex::encode(bytes),
+                bytes.len(),
+                H256::len_bytes()
+            ));
+        };
+        Ok(BlockPtr::from((hash, number)))
+    }
+}
+
+impl TryFromValue for BlockPtr {
+    fn try_from_value(value: &r::Value) -> Result<Self, anyhow::Error> {
+        match value {
+            r::Value::Object(o) => {
+                let number = o.get_required::<BigInt>("number")?.to_u64() as BlockNumber;
+                let hash = o.get_required::<BlockHash>("hash")?;
+
+                Ok(BlockPtr::new(hash, number))
+            }
+            _ => Err(anyhow!(
+                "failed to parse non-object value into BlockPtr: {:?}",
+                value
+            )),
+        }
+    }
+}
+
+impl IntoValue for BlockPtr {
+    fn into_value(self) -> r::Value {
+        object! {
+            __typename: "Block",
+            hash: self.hash_hex(),
+            number: format!("{}", self.number),
+        }
+    }
+}
+
+impl From<BlockPtr> for H256 {
+    fn from(ptr: BlockPtr) -> Self {
+        ptr.hash_as_h256()
+    }
+}
+
+impl From<BlockPtr> for BlockNumber {
+    fn from(ptr: BlockPtr) -> Self {
+        ptr.number
+    }
+}
+
+#[derive(Clone, Debug, PartialEq, Eq, Hash)]
+/// A collection of attributes that (kind of) uniquely identify a blockchain.
+pub struct ChainIdentifier {
+    pub net_version: String,
+    pub genesis_block_hash: BlockHash,
+}
diff --git a/graph/src/cheap_clone.rs b/graph/src/cheap_clone.rs
new file mode 100644
index 0000000..7deff5c
--- /dev/null
+++ b/graph/src/cheap_clone.rs
@@ -0,0 +1,38 @@
+use slog::Logger;
+use std::future::Future;
+use std::rc::Rc;
+use std::sync::Arc;
+use tonic::transport::Channel;
+
+/// Things that are fast to clone in the context of an application such as Graph Node
+///
+/// The purpose of this API is to reduce the number of calls to .clone() which need to
+/// be audited for performance.
+///
+/// As a rule of thumb, only constant-time Clone impls should also implement CheapClone.
+/// Eg:
+///    ✔ Arc<T>
+///    ✗ Vec<T>
+///    ✔ u128
+///    ✗ String
+pub trait CheapClone: Clone {
+    #[inline]
+    fn cheap_clone(&self) -> Self {
+        self.clone()
+    }
+}
+
+impl<T: ?Sized> CheapClone for Rc<T> {}
+impl<T: ?Sized> CheapClone for Arc<T> {}
+impl<T: ?Sized + CheapClone> CheapClone for Box<T> {}
+impl<T: ?Sized + CheapClone> CheapClone for std::pin::Pin<T> {}
+impl<T: CheapClone> CheapClone for Option<T> {}
+impl CheapClone for Logger {}
+
+// Pool is implemented as a newtype over Arc,
+// So it is CheapClone.
+impl<M: diesel::r2d2::ManageConnection> CheapClone for diesel::r2d2::Pool<M> {}
+
+impl<F: Future> CheapClone for futures03::future::Shared<F> {}
+
+impl CheapClone for Channel {}
diff --git a/graph/src/components/ethereum/mod.rs b/graph/src/components/ethereum/mod.rs
new file mode 100644
index 0000000..45f1f5d
--- /dev/null
+++ b/graph/src/components/ethereum/mod.rs
@@ -0,0 +1,6 @@
+mod types;
+
+pub use self::types::{
+    evaluate_transaction_status, EthereumBlock, EthereumBlockWithCalls, EthereumCall,
+    LightEthereumBlock, LightEthereumBlockExt,
+};
diff --git a/graph/src/components/ethereum/types.rs b/graph/src/components/ethereum/types.rs
new file mode 100644
index 0000000..ca823aa
--- /dev/null
+++ b/graph/src/components/ethereum/types.rs
@@ -0,0 +1,172 @@
+use serde::{Deserialize, Serialize};
+use std::{convert::TryFrom, sync::Arc};
+use web3::types::{
+    Action, Address, Block, Bytes, Log, Res, Trace, Transaction, TransactionReceipt, H256, U256,
+    U64,
+};
+
+use crate::{blockchain::BlockPtr, prelude::BlockNumber};
+
+pub type LightEthereumBlock = Block<Transaction>;
+
+pub trait LightEthereumBlockExt {
+    fn number(&self) -> BlockNumber;
+    fn transaction_for_log(&self, log: &Log) -> Option<Transaction>;
+    fn transaction_for_call(&self, call: &EthereumCall) -> Option<Transaction>;
+    fn parent_ptr(&self) -> Option<BlockPtr>;
+    fn format(&self) -> String;
+    fn block_ptr(&self) -> BlockPtr;
+}
+
+impl LightEthereumBlockExt for LightEthereumBlock {
+    fn number(&self) -> BlockNumber {
+        BlockNumber::try_from(self.number.unwrap().as_u64()).unwrap()
+    }
+
+    fn transaction_for_log(&self, log: &Log) -> Option<Transaction> {
+        log.transaction_hash
+            .and_then(|hash| self.transactions.iter().find(|tx| tx.hash == hash))
+            .cloned()
+    }
+
+    fn transaction_for_call(&self, call: &EthereumCall) -> Option<Transaction> {
+        call.transaction_hash
+            .and_then(|hash| self.transactions.iter().find(|tx| tx.hash == hash))
+            .cloned()
+    }
+
+    fn parent_ptr(&self) -> Option<BlockPtr> {
+        match self.number() {
+            0 => None,
+            n => Some(BlockPtr::from((self.parent_hash, n - 1))),
+        }
+    }
+
+    fn format(&self) -> String {
+        format!(
+            "{} ({})",
+            self.number
+                .map_or(String::from("none"), |number| format!("#{}", number)),
+            self.hash
+                .map_or(String::from("-"), |hash| format!("{:x}", hash))
+        )
+    }
+
+    fn block_ptr(&self) -> BlockPtr {
+        BlockPtr::from((self.hash.unwrap(), self.number.unwrap().as_u64()))
+    }
+}
+
+#[derive(Clone, Debug)]
+pub struct EthereumBlockWithCalls {
+    pub ethereum_block: EthereumBlock,
+    /// The calls in this block; `None` means we haven't checked yet,
+    /// `Some(vec![])` means that we checked and there were none
+    pub calls: Option<Vec<EthereumCall>>,
+}
+
+impl EthereumBlockWithCalls {
+    /// Given an `EthereumCall`, check within receipts if that transaction was successful.
+    pub fn transaction_for_call_succeeded(&self, call: &EthereumCall) -> anyhow::Result<bool> {
+        let call_transaction_hash = call.transaction_hash.ok_or(anyhow::anyhow!(
+            "failed to find a transaction for this call"
+        ))?;
+
+        let receipt = self
+            .ethereum_block
+            .transaction_receipts
+            .iter()
+            .find(|txn| txn.transaction_hash == call_transaction_hash)
+            .ok_or(anyhow::anyhow!(
+                "failed to find the receipt for this transaction"
+            ))?;
+
+        Ok(evaluate_transaction_status(receipt.status))
+    }
+}
+
+/// Evaluates if a given transaction was successful.
+///
+/// Returns `true` on success and `false` on failure.
+/// If a receipt does not have a status value (EIP-658), assume the transaction was successful.
+pub fn evaluate_transaction_status(receipt_status: Option<U64>) -> bool {
+    receipt_status
+        .map(|status| !status.is_zero())
+        .unwrap_or(true)
+}
+
+#[derive(Clone, Debug, Default, Deserialize, Serialize, PartialEq)]
+pub struct EthereumBlock {
+    pub block: Arc<LightEthereumBlock>,
+    pub transaction_receipts: Vec<Arc<TransactionReceipt>>,
+}
+
+#[derive(Debug, Default, Clone, PartialEq)]
+pub struct EthereumCall {
+    pub from: Address,
+    pub to: Address,
+    pub value: U256,
+    pub gas_used: U256,
+    pub input: Bytes,
+    pub output: Bytes,
+    pub block_number: BlockNumber,
+    pub block_hash: H256,
+    pub transaction_hash: Option<H256>,
+    pub transaction_index: u64,
+}
+
+impl EthereumCall {
+    pub fn try_from_trace(trace: &Trace) -> Option<Self> {
+        // The parity-ethereum tracing api returns traces for operations which had execution errors.
+        // Filter errorful traces out, since call handlers should only run on successful CALLs.
+        if trace.error.is_some() {
+            return None;
+        }
+        // We are only interested in traces from CALLs
+        let call = match &trace.action {
+            // Contract to contract value transfers compile to the CALL opcode
+            // and have no input. Call handlers are for triggering on explicit method calls right now.
+            Action::Call(call) if call.input.0.len() >= 4 => call,
+            _ => return None,
+        };
+        let (output, gas_used) = match &trace.result {
+            Some(Res::Call(result)) => (result.output.clone(), result.gas_used),
+            _ => return None,
+        };
+
+        // The only traces without transactions are those from Parity block reward contracts, we
+        // don't support triggering on that.
+        let transaction_index = trace.transaction_position? as u64;
+
+        Some(EthereumCall {
+            from: call.from,
+            to: call.to,
+            value: call.value,
+            gas_used,
+            input: call.input.clone(),
+            output,
+            block_number: trace.block_number as BlockNumber,
+            block_hash: trace.block_hash,
+            transaction_hash: trace.transaction_hash,
+            transaction_index,
+        })
+    }
+}
+
+impl From<EthereumBlock> for BlockPtr {
+    fn from(b: EthereumBlock) -> BlockPtr {
+        BlockPtr::from((b.block.hash.unwrap(), b.block.number.unwrap().as_u64()))
+    }
+}
+
+impl<'a> From<&'a EthereumBlock> for BlockPtr {
+    fn from(b: &'a EthereumBlock) -> BlockPtr {
+        BlockPtr::from((b.block.hash.unwrap(), b.block.number.unwrap().as_u64()))
+    }
+}
+
+impl<'a> From<&'a EthereumCall> for BlockPtr {
+    fn from(call: &'a EthereumCall) -> BlockPtr {
+        BlockPtr::from((call.block_hash, call.block_number))
+    }
+}
diff --git a/graph/src/components/graphql.rs b/graph/src/components/graphql.rs
new file mode 100644
index 0000000..78c5472
--- /dev/null
+++ b/graph/src/components/graphql.rs
@@ -0,0 +1,59 @@
+use futures::prelude::*;
+
+use crate::data::query::{CacheStatus, Query, QueryTarget};
+use crate::data::subscription::{Subscription, SubscriptionError, SubscriptionResult};
+use crate::data::{graphql::effort::LoadManager, query::QueryResults};
+use crate::prelude::DeploymentHash;
+
+use async_trait::async_trait;
+use std::sync::Arc;
+use std::time::Duration;
+
+/// Future for subscription results.
+pub type SubscriptionResultFuture =
+    Box<dyn Future<Item = SubscriptionResult, Error = SubscriptionError> + Send>;
+
+pub enum GraphQlTarget {
+    SubgraphName(String),
+    Deployment(DeploymentHash),
+}
+
+/// A component that can run GraphqL queries against a [Store](../store/trait.Store.html).
+#[async_trait]
+pub trait GraphQlRunner: Send + Sync + 'static {
+    /// Runs a GraphQL query and returns its result.
+    async fn run_query(self: Arc<Self>, query: Query, target: QueryTarget) -> QueryResults;
+
+    /// Runs a GraphqL query up to the given complexity. Overrides the global complexity limit.
+    async fn run_query_with_complexity(
+        self: Arc<Self>,
+        query: Query,
+        target: QueryTarget,
+        max_complexity: Option<u64>,
+        max_depth: Option<u8>,
+        max_first: Option<u32>,
+        max_skip: Option<u32>,
+    ) -> QueryResults;
+
+    /// Runs a GraphQL subscription and returns a stream of results.
+    async fn run_subscription(
+        self: Arc<Self>,
+        subscription: Subscription,
+        target: QueryTarget,
+    ) -> Result<SubscriptionResult, SubscriptionError>;
+
+    fn load_manager(&self) -> Arc<LoadManager>;
+
+    fn metrics(&self) -> Arc<dyn GraphQLMetrics>;
+}
+
+pub trait GraphQLMetrics: Send + Sync + 'static {
+    fn observe_query_execution(&self, duration: Duration, results: &QueryResults);
+    fn observe_query_parsing(&self, duration: Duration, results: &QueryResults);
+    fn observe_query_validation(&self, duration: Duration, id: &DeploymentHash);
+}
+
+#[async_trait]
+pub trait QueryLoadManager: Send + Sync {
+    fn record_work(&self, shape_hash: u64, duration: Duration, cache_status: CacheStatus);
+}
diff --git a/graph/src/components/link_resolver.rs b/graph/src/components/link_resolver.rs
new file mode 100644
index 0000000..42f6a26
--- /dev/null
+++ b/graph/src/components/link_resolver.rs
@@ -0,0 +1,44 @@
+use std::pin::Pin;
+use std::time::Duration;
+
+use async_trait::async_trait;
+use futures03::prelude::Stream;
+use serde_json::Value;
+use slog::Logger;
+
+use crate::data::subgraph::Link;
+use crate::prelude::Error;
+use std::fmt::Debug;
+
+/// The values that `json_stream` returns. The struct contains the deserialized
+/// JSON value from the input stream, together with the line number from which
+/// the value was read.
+pub struct JsonStreamValue {
+    pub value: Value,
+    pub line: usize,
+}
+
+pub type JsonValueStream =
+    Pin<Box<dyn Stream<Item = Result<JsonStreamValue, Error>> + Send + 'static>>;
+
+/// Resolves links to subgraph manifests and resources referenced by them.
+#[async_trait]
+pub trait LinkResolver: Send + Sync + 'static + Debug {
+    /// Updates the timeout used by the resolver.
+    fn with_timeout(&self, timeout: Duration) -> Box<dyn LinkResolver>;
+
+    /// Enables infinite retries.
+    fn with_retries(&self) -> Box<dyn LinkResolver>;
+
+    /// Fetches the link contents as bytes.
+    async fn cat(&self, logger: &Logger, link: &Link) -> Result<Vec<u8>, Error>;
+
+    /// Fetches the IPLD block contents as bytes.
+    async fn get_block(&self, logger: &Logger, link: &Link) -> Result<Vec<u8>, Error>;
+
+    /// Read the contents of `link` and deserialize them into a stream of JSON
+    /// values. The values must each be on a single line; newlines are significant
+    /// as they are used to split the file contents and each line is deserialized
+    /// separately.
+    async fn json_stream(&self, logger: &Logger, link: &Link) -> Result<JsonValueStream, Error>;
+}
diff --git a/graph/src/components/metrics/aggregate.rs b/graph/src/components/metrics/aggregate.rs
new file mode 100644
index 0000000..a8f0822
--- /dev/null
+++ b/graph/src/components/metrics/aggregate.rs
@@ -0,0 +1,63 @@
+use std::time::Duration;
+
+use crate::prelude::*;
+
+pub struct Aggregate {
+    /// Number of values.
+    count: Gauge,
+
+    /// Sum over all values.
+    sum: Gauge,
+
+    /// Moving average over the values.
+    avg: Gauge,
+
+    /// Latest value.
+    cur: Gauge,
+}
+
+impl Aggregate {
+    pub fn new(name: &str, subgraph: &str, help: &str, registry: Arc<dyn MetricsRegistry>) -> Self {
+        let make_gauge = |suffix: &str| {
+            registry
+                .new_deployment_gauge(
+                    &format!("{}_{}", name, suffix),
+                    &format!("{} ({})", help, suffix),
+                    subgraph,
+                )
+                .unwrap_or_else(|_| {
+                    panic!(
+                        "failed to register metric `{}_{}` for {}",
+                        name, suffix, subgraph
+                    )
+                })
+        };
+
+        Aggregate {
+            count: make_gauge("count"),
+            sum: make_gauge("sum"),
+            avg: make_gauge("avg"),
+            cur: make_gauge("cur"),
+        }
+    }
+
+    pub fn update(&self, x: f64) {
+        // Update count
+        self.count.inc();
+        let n = self.count.get();
+
+        // Update sum
+        self.sum.add(x);
+
+        // Update current value
+        self.cur.set(x);
+
+        // Update aggregate value.
+        let avg = self.avg.get();
+        self.avg.set(avg + (x - avg) / n);
+    }
+
+    pub fn update_duration(&self, x: Duration) {
+        self.update(x.as_secs_f64())
+    }
+}
diff --git a/graph/src/components/metrics/mod.rs b/graph/src/components/metrics/mod.rs
new file mode 100644
index 0000000..581cea6
--- /dev/null
+++ b/graph/src/components/metrics/mod.rs
@@ -0,0 +1,301 @@
+pub use prometheus::core::Collector;
+pub use prometheus::{
+    labels, Counter, CounterVec, Error as PrometheusError, Gauge, GaugeVec, Histogram,
+    HistogramOpts, HistogramVec, Opts, Registry,
+};
+pub mod subgraph;
+
+use std::collections::HashMap;
+
+/// Metrics for measuring where time is spent during indexing.
+pub mod stopwatch;
+
+/// Aggregates over individual values.
+pub mod aggregate;
+
+fn deployment_labels(subgraph: &str) -> HashMap<String, String> {
+    labels! { String::from("deployment") => String::from(subgraph), }
+}
+
+/// Create an unregistered counter with labels
+pub fn counter_with_labels(
+    name: &str,
+    help: &str,
+    const_labels: HashMap<String, String>,
+) -> Result<Counter, PrometheusError> {
+    let opts = Opts::new(name, help).const_labels(const_labels);
+    Counter::with_opts(opts)
+}
+
+/// Create an unregistered gauge with labels
+pub fn gauge_with_labels(
+    name: &str,
+    help: &str,
+    const_labels: HashMap<String, String>,
+) -> Result<Gauge, PrometheusError> {
+    let opts = Opts::new(name, help).const_labels(const_labels);
+    Gauge::with_opts(opts)
+}
+
+pub trait MetricsRegistry: Send + Sync + 'static {
+    fn register(&self, name: &str, c: Box<dyn Collector>);
+
+    fn unregister(&self, metric: Box<dyn Collector>);
+
+    fn global_counter(
+        &self,
+        name: &str,
+        help: &str,
+        const_labels: HashMap<String, String>,
+    ) -> Result<Counter, PrometheusError>;
+
+    fn global_counter_vec(
+        &self,
+        name: &str,
+        help: &str,
+        variable_labels: &[&str],
+    ) -> Result<CounterVec, PrometheusError>;
+
+    fn global_deployment_counter(
+        &self,
+        name: &str,
+        help: &str,
+        subgraph: &str,
+    ) -> Result<Counter, PrometheusError> {
+        self.global_counter(name, help, deployment_labels(subgraph))
+    }
+
+    fn global_deployment_counter_vec(
+        &self,
+        name: &str,
+        help: &str,
+        subgraph: &str,
+        variable_labels: &[&str],
+    ) -> Result<CounterVec, PrometheusError>;
+
+    fn global_gauge(
+        &self,
+        name: &str,
+        help: &str,
+        const_labels: HashMap<String, String>,
+    ) -> Result<Gauge, PrometheusError>;
+
+    fn global_gauge_vec(
+        &self,
+        name: &str,
+        help: &str,
+        variable_labels: &[&str],
+    ) -> Result<GaugeVec, PrometheusError>;
+
+    fn new_gauge(
+        &self,
+        name: &str,
+        help: &str,
+        const_labels: HashMap<String, String>,
+    ) -> Result<Box<Gauge>, PrometheusError> {
+        let opts = Opts::new(name, help).const_labels(const_labels);
+        let gauge = Box::new(Gauge::with_opts(opts)?);
+        self.register(name, gauge.clone());
+        Ok(gauge)
+    }
+
+    fn new_deployment_gauge(
+        &self,
+        name: &str,
+        help: &str,
+        subgraph: &str,
+    ) -> Result<Gauge, PrometheusError> {
+        let opts = Opts::new(name, help).const_labels(deployment_labels(subgraph));
+        let gauge = Gauge::with_opts(opts)?;
+        self.register(name, Box::new(gauge.clone()));
+        Ok(gauge)
+    }
+
+    fn new_gauge_vec(
+        &self,
+        name: &str,
+        help: &str,
+        variable_labels: Vec<String>,
+    ) -> Result<Box<GaugeVec>, PrometheusError> {
+        let opts = Opts::new(name, help);
+        let gauges = Box::new(GaugeVec::new(
+            opts,
+            variable_labels
+                .iter()
+                .map(String::as_str)
+                .collect::<Vec<&str>>()
+                .as_slice(),
+        )?);
+        self.register(name, gauges.clone());
+        Ok(gauges)
+    }
+
+    fn new_deployment_gauge_vec(
+        &self,
+        name: &str,
+        help: &str,
+        subgraph: &str,
+        variable_labels: Vec<String>,
+    ) -> Result<Box<GaugeVec>, PrometheusError> {
+        let opts = Opts::new(name, help).const_labels(deployment_labels(subgraph));
+        let gauges = Box::new(GaugeVec::new(
+            opts,
+            variable_labels
+                .iter()
+                .map(String::as_str)
+                .collect::<Vec<&str>>()
+                .as_slice(),
+        )?);
+        self.register(name, gauges.clone());
+        Ok(gauges)
+    }
+
+    fn new_counter(&self, name: &str, help: &str) -> Result<Box<Counter>, PrometheusError> {
+        let opts = Opts::new(name, help);
+        let counter = Box::new(Counter::with_opts(opts)?);
+        self.register(name, counter.clone());
+        Ok(counter)
+    }
+
+    fn new_counter_with_labels(
+        &self,
+        name: &str,
+        help: &str,
+        const_labels: HashMap<String, String>,
+    ) -> Result<Box<Counter>, PrometheusError> {
+        let counter = Box::new(counter_with_labels(name, help, const_labels)?);
+        self.register(name, counter.clone());
+        Ok(counter)
+    }
+
+    fn new_deployment_counter(
+        &self,
+        name: &str,
+        help: &str,
+        subgraph: &str,
+    ) -> Result<Counter, PrometheusError> {
+        let counter = counter_with_labels(name, help, deployment_labels(subgraph))?;
+        self.register(name, Box::new(counter.clone()));
+        Ok(counter)
+    }
+
+    fn new_counter_vec(
+        &self,
+        name: &str,
+        help: &str,
+        variable_labels: Vec<String>,
+    ) -> Result<Box<CounterVec>, PrometheusError> {
+        let opts = Opts::new(name, help);
+        let counters = Box::new(CounterVec::new(
+            opts,
+            variable_labels
+                .iter()
+                .map(String::as_str)
+                .collect::<Vec<&str>>()
+                .as_slice(),
+        )?);
+        self.register(name, counters.clone());
+        Ok(counters)
+    }
+
+    fn new_deployment_counter_vec(
+        &self,
+        name: &str,
+        help: &str,
+        subgraph: &str,
+        variable_labels: Vec<String>,
+    ) -> Result<Box<CounterVec>, PrometheusError> {
+        let opts = Opts::new(name, help).const_labels(deployment_labels(subgraph));
+        let counters = Box::new(CounterVec::new(
+            opts,
+            variable_labels
+                .iter()
+                .map(String::as_str)
+                .collect::<Vec<&str>>()
+                .as_slice(),
+        )?);
+        self.register(name, counters.clone());
+        Ok(counters)
+    }
+
+    fn new_deployment_histogram(
+        &self,
+        name: &str,
+        help: &str,
+        subgraph: &str,
+        buckets: Vec<f64>,
+    ) -> Result<Box<Histogram>, PrometheusError> {
+        let opts = HistogramOpts::new(name, help)
+            .const_labels(deployment_labels(subgraph))
+            .buckets(buckets);
+        let histogram = Box::new(Histogram::with_opts(opts)?);
+        self.register(name, histogram.clone());
+        Ok(histogram)
+    }
+
+    fn new_histogram(
+        &self,
+        name: &str,
+        help: &str,
+        buckets: Vec<f64>,
+    ) -> Result<Box<Histogram>, PrometheusError> {
+        let opts = HistogramOpts::new(name, help).buckets(buckets);
+        let histogram = Box::new(Histogram::with_opts(opts)?);
+        self.register(name, histogram.clone());
+        Ok(histogram)
+    }
+
+    fn new_histogram_vec(
+        &self,
+        name: &str,
+        help: &str,
+        variable_labels: Vec<String>,
+        buckets: Vec<f64>,
+    ) -> Result<Box<HistogramVec>, PrometheusError> {
+        let opts = Opts::new(name, help);
+        let histograms = Box::new(HistogramVec::new(
+            HistogramOpts {
+                common_opts: opts,
+                buckets,
+            },
+            variable_labels
+                .iter()
+                .map(String::as_str)
+                .collect::<Vec<&str>>()
+                .as_slice(),
+        )?);
+        self.register(name, histograms.clone());
+        Ok(histograms)
+    }
+
+    fn new_deployment_histogram_vec(
+        &self,
+        name: &str,
+        help: &str,
+        subgraph: &str,
+        variable_labels: Vec<String>,
+        buckets: Vec<f64>,
+    ) -> Result<Box<HistogramVec>, PrometheusError> {
+        let opts = Opts::new(name, help).const_labels(deployment_labels(subgraph));
+        let histograms = Box::new(HistogramVec::new(
+            HistogramOpts {
+                common_opts: opts,
+                buckets,
+            },
+            variable_labels
+                .iter()
+                .map(String::as_str)
+                .collect::<Vec<&str>>()
+                .as_slice(),
+        )?);
+        self.register(name, histograms.clone());
+        Ok(histograms)
+    }
+
+    fn global_histogram_vec(
+        &self,
+        name: &str,
+        help: &str,
+        variable_labels: &[&str],
+    ) -> Result<HistogramVec, PrometheusError>;
+}
diff --git a/graph/src/components/metrics/stopwatch.rs b/graph/src/components/metrics/stopwatch.rs
new file mode 100644
index 0000000..fe56cdb
--- /dev/null
+++ b/graph/src/components/metrics/stopwatch.rs
@@ -0,0 +1,163 @@
+use crate::prelude::*;
+use std::sync::{atomic::AtomicBool, atomic::Ordering, Mutex};
+use std::time::Instant;
+
+/// This is a "section guard", that closes the section on drop.
+pub struct Section {
+    id: String,
+    stopwatch: StopwatchMetrics,
+}
+
+impl Section {
+    /// A more readable `drop`.
+    pub fn end(self) {}
+}
+
+impl Drop for Section {
+    fn drop(&mut self) {
+        self.stopwatch.end_section(std::mem::take(&mut self.id))
+    }
+}
+
+/// Usage example:
+/// ```ignore
+/// // Start counting time for the "main_section".
+/// let _main_section = stopwatch.start_section("main_section");
+/// // do stuff...
+/// // Pause timer for "main_section", start for "child_section".
+/// let child_section = stopwatch.start_section("child_section");
+/// // do stuff...
+/// // Register time spent in "child_section", implicitly going back to "main_section".
+/// section.end();
+/// // do stuff...
+/// // At the end of the scope `_main_section` is dropped, which is equivalent to calling
+/// // `_main_section.end()`.
+#[derive(Clone)]
+pub struct StopwatchMetrics {
+    disabled: Arc<AtomicBool>,
+    inner: Arc<Mutex<StopwatchInner>>,
+}
+
+impl CheapClone for StopwatchMetrics {}
+
+impl StopwatchMetrics {
+    pub fn new(
+        logger: Logger,
+        subgraph_id: DeploymentHash,
+        stage: &str,
+        registry: Arc<dyn MetricsRegistry>,
+    ) -> Self {
+        let stage = stage.to_owned();
+        let mut inner = StopwatchInner {
+            counter: registry
+                .global_deployment_counter_vec(
+                    "deployment_sync_secs",
+                    "total time spent syncing",
+                    subgraph_id.as_str(),
+                    &["section", "stage"],
+                )
+                .unwrap_or_else(|_| {
+                    panic!(
+                        "failed to register subgraph_sync_total_secs prometheus counter for {}",
+                        subgraph_id
+                    )
+                }),
+            logger,
+            stage,
+            section_stack: Vec::new(),
+            timer: Instant::now(),
+        };
+
+        // Start a base section so that all time is accounted for.
+        inner.start_section("unknown".to_owned());
+
+        StopwatchMetrics {
+            disabled: Arc::new(AtomicBool::new(false)),
+            inner: Arc::new(Mutex::new(inner)),
+        }
+    }
+
+    pub fn start_section(&self, id: &str) -> Section {
+        let id = id.to_owned();
+        if !self.disabled.load(Ordering::SeqCst) {
+            self.inner.lock().unwrap().start_section(id.clone())
+        }
+
+        // If disabled, this will do nothing on drop.
+        Section {
+            id,
+            stopwatch: self.clone(),
+        }
+    }
+
+    /// Turns `start_section` and `end_section` into no-ops, no more metrics will be updated.
+    pub fn disable(&self) {
+        self.disabled.store(true, Ordering::SeqCst)
+    }
+
+    fn end_section(&self, id: String) {
+        if !self.disabled.load(Ordering::SeqCst) {
+            self.inner.lock().unwrap().end_section(id)
+        }
+    }
+}
+
+/// We want to account for all subgraph indexing time, based on "wall clock" time. To do this we
+/// break down indexing into _sequential_ sections, and register the total time spent in each. So
+/// that there is no double counting, time spent in child sections doesn't count for the parent.
+struct StopwatchInner {
+    logger: Logger,
+
+    // Counter for the total time the subgraph spent syncing in various sections.
+    counter: CounterVec,
+
+    // The top section (last item) is the one that's currently executing.
+    section_stack: Vec<String>,
+
+    // The timer is reset whenever a section starts or ends.
+    timer: Instant,
+
+    // The processing stage the metrics belong to; for pipelined uses, the
+    // pipeline stage
+    stage: String,
+}
+
+impl StopwatchInner {
+    fn record_and_reset(&mut self) {
+        if let Some(section) = self.section_stack.last() {
+            // Register the current timer.
+            let elapsed = self.timer.elapsed().as_secs_f64();
+            self.counter
+                .get_metric_with_label_values(&[section, &self.stage])
+                .map(|counter| counter.inc_by(elapsed))
+                .unwrap_or_else(|e| {
+                    error!(self.logger, "failed to find counter for section";
+                    "id" => section,
+                    "error" => e.to_string());
+                });
+        }
+
+        // Reset the timer.
+        self.timer = Instant::now();
+    }
+
+    fn start_section(&mut self, id: String) {
+        self.record_and_reset();
+        self.section_stack.push(id);
+    }
+
+    fn end_section(&mut self, id: String) {
+        // Validate that the expected section is running.
+        match self.section_stack.last() {
+            Some(current_section) if current_section == &id => {
+                self.record_and_reset();
+                self.section_stack.pop();
+            }
+            Some(current_section) => error!(self.logger, "`end_section` with mismatched section";
+                                                        "current" => current_section,
+                                                        "received" => id),
+            None => error!(self.logger, "`end_section` with no current section";
+                                        "received" => id),
+        }
+    }
+}
diff --git a/graph/src/components/metrics/subgraph.rs b/graph/src/components/metrics/subgraph.rs
new file mode 100644
index 0000000..5fff2f3
--- /dev/null
+++ b/graph/src/components/metrics/subgraph.rs
@@ -0,0 +1,101 @@
+use crate::blockchain::block_stream::BlockStreamMetrics;
+use crate::prelude::{Gauge, Histogram, HostMetrics, MetricsRegistry};
+use std::collections::HashMap;
+use std::sync::Arc;
+
+use super::stopwatch::StopwatchMetrics;
+
+pub struct SubgraphInstanceMetrics {
+    pub block_trigger_count: Box<Histogram>,
+    pub block_processing_duration: Box<Histogram>,
+    pub block_ops_transaction_duration: Box<Histogram>,
+
+    pub stopwatch: StopwatchMetrics,
+    trigger_processing_duration: Box<Histogram>,
+}
+
+impl SubgraphInstanceMetrics {
+    pub fn new(
+        registry: Arc<dyn MetricsRegistry>,
+        subgraph_hash: &str,
+        stopwatch: StopwatchMetrics,
+    ) -> Self {
+        let block_trigger_count = registry
+            .new_deployment_histogram(
+                "deployment_block_trigger_count",
+                "Measures the number of triggers in each block for a subgraph deployment",
+                subgraph_hash,
+                vec![1.0, 5.0, 10.0, 20.0, 50.0],
+            )
+            .expect("failed to create `deployment_block_trigger_count` histogram");
+        let trigger_processing_duration = registry
+            .new_deployment_histogram(
+                "deployment_trigger_processing_duration",
+                "Measures duration of trigger processing for a subgraph deployment",
+                subgraph_hash,
+                vec![0.01, 0.05, 0.1, 0.5, 1.5, 5.0, 10.0, 30.0, 120.0],
+            )
+            .expect("failed to create `deployment_trigger_processing_duration` histogram");
+        let block_processing_duration = registry
+            .new_deployment_histogram(
+                "deployment_block_processing_duration",
+                "Measures duration of block processing for a subgraph deployment",
+                subgraph_hash,
+                vec![0.05, 0.2, 0.7, 1.5, 4.0, 10.0, 60.0, 120.0, 240.0],
+            )
+            .expect("failed to create `deployment_block_processing_duration` histogram");
+        let block_ops_transaction_duration = registry
+            .new_deployment_histogram(
+                "deployment_transact_block_operations_duration",
+                "Measures duration of commiting all the entity operations in a block and updating the subgraph pointer",
+                subgraph_hash,
+                vec![0.01, 0.05, 0.1, 0.3, 0.7, 2.0],
+            )
+            .expect("failed to create `deployment_transact_block_operations_duration_{}");
+
+        Self {
+            block_trigger_count,
+            block_processing_duration,
+            trigger_processing_duration,
+            block_ops_transaction_duration,
+            stopwatch,
+        }
+    }
+
+    pub fn observe_trigger_processing_duration(&self, duration: f64) {
+        self.trigger_processing_duration.observe(duration);
+    }
+
+    pub fn unregister(&self, registry: Arc<dyn MetricsRegistry>) {
+        registry.unregister(self.block_processing_duration.clone());
+        registry.unregister(self.block_trigger_count.clone());
+        registry.unregister(self.trigger_processing_duration.clone());
+        registry.unregister(self.block_ops_transaction_duration.clone());
+    }
+}
+
+pub struct SubgraphInstanceManagerMetrics {
+    pub subgraph_count: Box<Gauge>,
+}
+
+impl SubgraphInstanceManagerMetrics {
+    pub fn new(registry: Arc<dyn MetricsRegistry>) -> Self {
+        let subgraph_count = registry
+            .new_gauge(
+                "deployment_count",
+                "Counts the number of deployments currently being indexed by the graph-node.",
+                HashMap::new(),
+            )
+            .expect("failed to create `deployment_count` gauge");
+        Self { subgraph_count }
+    }
+}
+
+pub struct RunnerMetrics {
+    /// Sensors to measure the execution of the subgraph instance
+    pub subgraph: Arc<SubgraphInstanceMetrics>,
+    /// Sensors to measure the execution of the subgraph's runtime hosts
+    pub host: Arc<HostMetrics>,
+    /// Sensors to measure the BlockStream metrics
+    pub stream: Arc<BlockStreamMetrics>,
+}
diff --git a/graph/src/components/mod.rs b/graph/src/components/mod.rs
new file mode 100644
index 0000000..79d698f
--- /dev/null
+++ b/graph/src/components/mod.rs
@@ -0,0 +1,81 @@
+//! The Graph network nodes are internally structured as a layers of reusable
+//! components with non-blocking communication, with each component having a
+//! corresponding trait defining it's interface.
+//!
+//! As examples of components, at the top layer component there is the GraphQL
+//! server which interacts with clients, and at the lowest layer we have data
+//! sources that interact with storage backends.
+//!
+//! The layers are not well defined, but it's expected that a higher-level
+//! component will make requests for a lower-level component to respond, and
+//! that a lower-level component will send events to interested higher-level
+//! components when it's state changes.
+//!
+//! A request/response interaction between C1 and C2 is made by C1 requiring an
+//! `Arc<C2>` in it's constructor and then calling the functions defined on C2.
+//!
+//! Event-based interactions propagate changes in the underlining data upwards
+//! in the component graph, with low level components generating event streams
+//! based on changes in external systems, mid level components transforming
+//! these streams and high level components finally consuming the received
+//! events.
+//!
+//! These events are communicated through sinks and streams (typically senders
+//! and receivers of channels), which are managed by long-running Tokio tasks.
+//! Each component may have an internal task for handling input events and
+//! sending out output events, and the "dumb pipes" that plug together components
+//! are tasks that send out events in the order that they are received.
+//!
+//! A component declares it's inputs and outputs by having `EventConsumer<U>` and
+//! `EventProducer<T>` traits as supertraits.
+//!
+//! Components should use the helper functions in this module (e.g. `forward`)
+//! that define common operations on event streams, facilitating the
+//! configuration of component graphs.
+
+use futures::prelude::*;
+
+/// Components dealing with subgraphs.
+pub mod subgraph;
+
+/// Components dealing with Ethereum.
+pub mod ethereum;
+
+/// Components dealing with processing GraphQL.
+pub mod graphql;
+
+/// Components powering GraphQL, JSON-RPC, WebSocket APIs, Metrics.
+pub mod server;
+
+/// Components dealing with storing entities.
+pub mod store;
+
+pub mod link_resolver;
+
+pub mod trigger_processor;
+
+/// Components dealing with collecting metrics
+pub mod metrics;
+
+/// Components dealing with versioning
+pub mod versions;
+
+/// A component that receives events of type `T`.
+pub trait EventConsumer<E> {
+    /// Get the event sink.
+    ///
+    /// Avoid calling directly, prefer helpers such as `forward`.
+    fn event_sink(&self) -> Box<dyn Sink<SinkItem = E, SinkError = ()> + Send>;
+}
+
+/// A component that outputs events of type `T`.
+pub trait EventProducer<E> {
+    /// Get the event stream. Because we use single-consumer semantics, the
+    /// first caller will take the output stream and any further calls will
+    /// return `None`.
+    ///
+    /// Avoid calling directly, prefer helpers such as `forward`.
+    fn take_event_stream(&mut self) -> Option<Box<dyn Stream<Item = E, Error = ()> + Send>>;
+}
+
+pub mod transaction_receipt;
diff --git a/graph/src/components/server/index_node.rs b/graph/src/components/server/index_node.rs
new file mode 100644
index 0000000..eddf1fa
--- /dev/null
+++ b/graph/src/components/server/index_node.rs
@@ -0,0 +1,31 @@
+use std::sync::Arc;
+
+use futures::prelude::*;
+
+use crate::prelude::{BlockNumber, Schema};
+
+/// This is only needed to support the explorer API.
+#[derive(Debug)]
+pub struct VersionInfo {
+    pub created_at: String,
+    pub deployment_id: String,
+    pub latest_ethereum_block_number: Option<BlockNumber>,
+    pub total_ethereum_blocks_count: Option<BlockNumber>,
+    pub synced: bool,
+    pub failed: bool,
+    pub description: Option<String>,
+    pub repository: Option<String>,
+    pub schema: Arc<Schema>,
+    pub network: String,
+}
+
+/// Common trait for index node server implementations.
+pub trait IndexNodeServer {
+    type ServeError;
+
+    /// Creates a new Tokio task that, when spawned, brings up the index node server.
+    fn serve(
+        &mut self,
+        port: u16,
+    ) -> Result<Box<dyn Future<Item = (), Error = ()> + Send>, Self::ServeError>;
+}
diff --git a/graph/src/components/server/metrics.rs b/graph/src/components/server/metrics.rs
new file mode 100644
index 0000000..1bd9f4e
--- /dev/null
+++ b/graph/src/components/server/metrics.rs
@@ -0,0 +1,12 @@
+use futures::prelude::*;
+
+/// Common trait for index node server implementations.
+pub trait MetricsServer {
+    type ServeError;
+
+    /// Creates a new Tokio task that, when spawned, brings up the index node server.
+    fn serve(
+        &mut self,
+        port: u16,
+    ) -> Result<Box<dyn Future<Item = (), Error = ()> + Send>, Self::ServeError>;
+}
diff --git a/graph/src/components/server/mod.rs b/graph/src/components/server/mod.rs
new file mode 100644
index 0000000..b0a510c
--- /dev/null
+++ b/graph/src/components/server/mod.rs
@@ -0,0 +1,11 @@
+/// Component for running GraphQL queries over HTTP.
+pub mod query;
+
+/// Component for running GraphQL subscriptions over WebSockets.
+pub mod subscription;
+
+/// Component for the index node server.
+pub mod index_node;
+
+/// Components for the Prometheus metrics server.
+pub mod metrics;
diff --git a/graph/src/components/server/query.rs b/graph/src/components/server/query.rs
new file mode 100644
index 0000000..9fca8ea
--- /dev/null
+++ b/graph/src/components/server/query.rs
@@ -0,0 +1,71 @@
+use crate::data::query::QueryError;
+use futures::prelude::*;
+use std::error::Error;
+use std::fmt;
+
+use crate::components::store::StoreError;
+
+/// Errors that can occur while processing incoming requests.
+#[derive(Debug)]
+pub enum GraphQLServerError {
+    ClientError(String),
+    QueryError(QueryError),
+    InternalError(String),
+}
+
+impl From<QueryError> for GraphQLServerError {
+    fn from(e: QueryError) -> Self {
+        GraphQLServerError::QueryError(e)
+    }
+}
+
+impl From<StoreError> for GraphQLServerError {
+    fn from(e: StoreError) -> Self {
+        match e {
+            StoreError::ConstraintViolation(s) => GraphQLServerError::InternalError(s),
+            _ => GraphQLServerError::ClientError(e.to_string()),
+        }
+    }
+}
+
+impl fmt::Display for GraphQLServerError {
+    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
+        match *self {
+            GraphQLServerError::ClientError(ref s) => {
+                write!(f, "GraphQL server error (client error): {}", s)
+            }
+            GraphQLServerError::QueryError(ref e) => {
+                write!(f, "GraphQL server error (query error): {}", e)
+            }
+            GraphQLServerError::InternalError(ref s) => {
+                write!(f, "GraphQL server error (internal error): {}", s)
+            }
+        }
+    }
+}
+
+impl Error for GraphQLServerError {
+    fn description(&self) -> &str {
+        "Failed to process the GraphQL request"
+    }
+
+    fn cause(&self) -> Option<&dyn Error> {
+        match *self {
+            GraphQLServerError::ClientError(_) => None,
+            GraphQLServerError::QueryError(ref e) => Some(e),
+            GraphQLServerError::InternalError(_) => None,
+        }
+    }
+}
+
+/// Common trait for GraphQL server implementations.
+pub trait GraphQLServer {
+    type ServeError;
+
+    /// Creates a new Tokio task that, when spawned, brings up the GraphQL server.
+    fn serve(
+        &mut self,
+        port: u16,
+        ws_port: u16,
+    ) -> Result<Box<dyn Future<Item = (), Error = ()> + Send>, Self::ServeError>;
+}
diff --git a/graph/src/components/server/subscription.rs b/graph/src/components/server/subscription.rs
new file mode 100644
index 0000000..dae6193
--- /dev/null
+++ b/graph/src/components/server/subscription.rs
@@ -0,0 +1,8 @@
+use async_trait::async_trait;
+
+/// Common trait for GraphQL subscription servers.
+#[async_trait]
+pub trait SubscriptionServer {
+    /// Returns a Future that, when spawned, brings up the GraphQL subscription server.
+    async fn serve(self, port: u16);
+}
diff --git a/graph/src/components/store/cache.rs b/graph/src/components/store/cache.rs
new file mode 100644
index 0000000..e5e9903
--- /dev/null
+++ b/graph/src/components/store/cache.rs
@@ -0,0 +1,360 @@
+use anyhow::anyhow;
+use std::collections::{BTreeMap, HashMap};
+use std::fmt::{self, Debug};
+use std::sync::Arc;
+
+use crate::blockchain::BlockPtr;
+use crate::components::store::{
+    self as s, Entity, EntityKey, EntityOp, EntityOperation, EntityType,
+};
+use crate::data_source::DataSource;
+use crate::prelude::{Schema, ENV_VARS};
+use crate::util::lfu_cache::LfuCache;
+
+/// A cache for entities from the store that provides the basic functionality
+/// needed for the store interactions in the host exports. This struct tracks
+/// how entities are modified, and caches all entities looked up from the
+/// store. The cache makes sure that
+///   (1) no entity appears in more than one operation
+///   (2) only entities that will actually be changed from what they
+///       are in the store are changed
+pub struct EntityCache {
+    /// The state of entities in the store. An entry of `None`
+    /// means that the entity is not present in the store
+    current: LfuCache<EntityKey, Option<Entity>>,
+
+    /// The accumulated changes to an entity.
+    updates: HashMap<EntityKey, EntityOp>,
+
+    // Updates for a currently executing handler.
+    handler_updates: HashMap<EntityKey, EntityOp>,
+
+    // Marks whether updates should go in `handler_updates`.
+    in_handler: bool,
+
+    data_sources: Vec<s::StoredDynamicDataSource>,
+
+    /// The store is only used to read entities.
+    pub store: Arc<dyn s::ReadStore>,
+
+    schema: Arc<Schema>,
+}
+
+impl Debug for EntityCache {
+    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
+        f.debug_struct("EntityCache")
+            .field("current", &self.current)
+            .field("updates", &self.updates)
+            .finish()
+    }
+}
+
+pub struct ModificationsAndCache {
+    pub modifications: Vec<s::EntityModification>,
+    pub data_sources: Vec<s::StoredDynamicDataSource>,
+    pub entity_lfu_cache: LfuCache<EntityKey, Option<Entity>>,
+}
+
+impl EntityCache {
+    pub fn new(store: Arc<dyn s::ReadStore>) -> Self {
+        Self {
+            current: LfuCache::new(),
+            updates: HashMap::new(),
+            handler_updates: HashMap::new(),
+            in_handler: false,
+            data_sources: vec![],
+            schema: store.input_schema(),
+            store,
+        }
+    }
+
+    pub fn with_current(
+        store: Arc<dyn s::ReadStore>,
+        current: LfuCache<EntityKey, Option<Entity>>,
+    ) -> EntityCache {
+        EntityCache {
+            current,
+            updates: HashMap::new(),
+            handler_updates: HashMap::new(),
+            in_handler: false,
+            data_sources: vec![],
+            schema: store.input_schema(),
+            store,
+        }
+    }
+
+    pub(crate) fn enter_handler(&mut self) {
+        assert!(!self.in_handler);
+        self.in_handler = true;
+    }
+
+    pub(crate) fn exit_handler(&mut self) {
+        assert!(self.in_handler);
+        self.in_handler = false;
+
+        // Apply all handler updates to the main `updates`.
+        let handler_updates = Vec::from_iter(self.handler_updates.drain());
+        for (key, op) in handler_updates {
+            self.entity_op(key, op)
+        }
+    }
+
+    pub(crate) fn exit_handler_and_discard_changes(&mut self) {
+        assert!(self.in_handler);
+        self.in_handler = false;
+        self.handler_updates.clear();
+    }
+
+    pub fn get(&mut self, eref: &EntityKey) -> Result<Option<Entity>, s::QueryExecutionError> {
+        // Get the current entity, apply any updates from `updates`, then
+        // from `handler_updates`.
+        let mut entity = self.current.get_entity(&*self.store, eref)?;
+        if let Some(op) = self.updates.get(eref).cloned() {
+            entity = op.apply_to(entity)
+        }
+        if let Some(op) = self.handler_updates.get(eref).cloned() {
+            entity = op.apply_to(entity)
+        }
+        Ok(entity)
+    }
+
+    pub fn remove(&mut self, key: EntityKey) {
+        self.entity_op(key, EntityOp::Remove);
+    }
+
+    /// Store the `entity` under the given `key`. The `entity` may be only a
+    /// partial entity; the cache will ensure partial updates get merged
+    /// with existing data. The entity will be validated against the
+    /// subgraph schema, and any errors will result in an `Err` being
+    /// returned.
+    pub fn set(&mut self, key: EntityKey, mut entity: Entity) -> Result<(), anyhow::Error> {
+        fn check_id(key: &EntityKey, prev_id: &str) -> Result<(), anyhow::Error> {
+            if prev_id != key.entity_id.as_str() {
+                return Err(anyhow!(
+                    "Value of {} attribute 'id' conflicts with ID passed to `store.set()`: \
+                {} != {}",
+                    key.entity_type,
+                    prev_id,
+                    key.entity_id,
+                ));
+            } else {
+                Ok(())
+            }
+        }
+
+        // Set the id if there isn't one yet, and make sure that a
+        // previously set id agrees with the one in the `key`
+        match entity.get("id") {
+            Some(s::Value::String(s)) => check_id(&key, s)?,
+            Some(s::Value::Bytes(b)) => check_id(&key, &b.to_string())?,
+            Some(_) => {
+                // The validation will catch the type mismatch
+            }
+            None => {
+                let value = self.schema.id_value(&key)?;
+                entity.set("id", value);
+            }
+        }
+
+        let is_valid = entity.validate(&self.schema, &key).is_ok();
+
+        self.entity_op(key.clone(), EntityOp::Update(entity));
+
+        // The updates we were given are not valid by themselves; force a
+        // lookup in the database and check again with an entity that merges
+        // the existing entity with the changes
+        if !is_valid {
+            let entity = self.get(&key)?.ok_or_else(|| {
+                anyhow!(
+                    "Failed to read entity {}[{}] back from cache",
+                    key.entity_type,
+                    key.entity_id
+                )
+            })?;
+            entity.validate(&self.schema, &key)?;
+        }
+
+        Ok(())
+    }
+
+    pub fn append(&mut self, operations: Vec<EntityOperation>) {
+        assert!(!self.in_handler);
+
+        for operation in operations {
+            match operation {
+                EntityOperation::Set { key, data } => {
+                    self.entity_op(key, EntityOp::Update(data));
+                }
+                EntityOperation::Remove { key } => {
+                    self.entity_op(key, EntityOp::Remove);
+                }
+            }
+        }
+    }
+
+    /// Add a dynamic data source
+    pub fn add_data_source<C: s::Blockchain>(&mut self, data_source: &DataSource<C>) {
+        self.data_sources
+            .push(data_source.as_stored_dynamic_data_source());
+    }
+
+    fn entity_op(&mut self, key: EntityKey, op: EntityOp) {
+        use std::collections::hash_map::Entry;
+        let updates = match self.in_handler {
+            true => &mut self.handler_updates,
+            false => &mut self.updates,
+        };
+
+        match updates.entry(key) {
+            Entry::Vacant(entry) => {
+                entry.insert(op);
+            }
+            Entry::Occupied(mut entry) => entry.get_mut().accumulate(op),
+        }
+    }
+
+    pub(crate) fn extend(&mut self, other: EntityCache) {
+        assert!(!other.in_handler);
+
+        self.current.extend(other.current);
+        for (key, op) in other.updates {
+            self.entity_op(key, op);
+        }
+    }
+
+    /// Return the changes that have been made via `set` and `remove` as
+    /// `EntityModification`, making sure to only produce one when a change
+    /// to the current state is actually needed.
+    ///
+    /// Also returns the updated `LfuCache`.
+    pub fn as_modifications(mut self) -> Result<ModificationsAndCache, s::QueryExecutionError> {
+        assert!(!self.in_handler);
+
+        // The first step is to make sure all entities being set are in `self.current`.
+        // For each subgraph, we need a map of entity type to missing entity ids.
+        let missing = self
+            .updates
+            .keys()
+            .filter(|key| !self.current.contains_key(key));
+
+        // For immutable types, we assume that the subgraph is well-behaved,
+        // and all updated immutable entities are in fact new, and skip
+        // looking them up in the store. That ultimately always leads to an
+        // `Insert` modification for immutable entities; if the assumption
+        // is wrong and the store already has a version of the entity from a
+        // previous block, the attempt to insert will trigger a constraint
+        // violation in the database, ensuring correctness
+        let missing = missing.filter(|key| !self.schema.is_immutable(&key.entity_type));
+
+        let mut missing_by_type: BTreeMap<&EntityType, Vec<&str>> = BTreeMap::new();
+        for key in missing {
+            missing_by_type
+                .entry(&key.entity_type)
+                .or_default()
+                .push(&key.entity_id);
+        }
+
+        for (entity_type, entities) in self.store.get_many(missing_by_type)? {
+            for entity in entities {
+                let key = EntityKey {
+                    entity_type: entity_type.clone(),
+                    entity_id: entity.id().unwrap().into(),
+                };
+                self.current.insert(key, Some(entity));
+            }
+        }
+
+        let mut mods = Vec::new();
+        for (key, update) in self.updates {
+            use s::EntityModification::*;
+
+            let current = self.current.remove(&key).and_then(|entity| entity);
+            let modification = match (current, update) {
+                // Entity was created
+                (None, EntityOp::Update(updates)) | (None, EntityOp::Overwrite(updates)) => {
+                    // Merging with an empty entity removes null fields.
+                    let mut data = Entity::new();
+                    data.merge_remove_null_fields(updates);
+                    self.current.insert(key.clone(), Some(data.clone()));
+                    Some(Insert { key, data })
+                }
+                // Entity may have been changed
+                (Some(current), EntityOp::Update(updates)) => {
+                    let mut data = current.clone();
+                    data.merge_remove_null_fields(updates);
+                    self.current.insert(key.clone(), Some(data.clone()));
+                    if current != data {
+                        Some(Overwrite { key, data })
+                    } else {
+                        None
+                    }
+                }
+                // Entity was removed and then updated, so it will be overwritten
+                (Some(current), EntityOp::Overwrite(data)) => {
+                    self.current.insert(key.clone(), Some(data.clone()));
+                    if current != data {
+                        Some(Overwrite { key, data })
+                    } else {
+                        None
+                    }
+                }
+                // Existing entity was deleted
+                (Some(_), EntityOp::Remove) => {
+                    self.current.insert(key.clone(), None);
+                    Some(Remove { key })
+                }
+                // Entity was deleted, but it doesn't exist in the store
+                (None, EntityOp::Remove) => None,
+            };
+            if let Some(modification) = modification {
+                mods.push(modification)
+            }
+        }
+        self.current.evict(ENV_VARS.mappings.entity_cache_size);
+
+        Ok(ModificationsAndCache {
+            modifications: mods,
+            data_sources: self.data_sources,
+            entity_lfu_cache: self.current,
+        })
+    }
+}
+
+impl LfuCache<EntityKey, Option<Entity>> {
+    // Helper for cached lookup of an entity.
+    fn get_entity(
+        &mut self,
+        store: &(impl s::ReadStore + ?Sized),
+        key: &EntityKey,
+    ) -> Result<Option<Entity>, s::QueryExecutionError> {
+        match self.get(key) {
+            None => {
+                let mut entity = store.get(key)?;
+                if let Some(entity) = &mut entity {
+                    // `__typename` is for queries not for mappings.
+                    entity.remove("__typename");
+                }
+                self.insert(key.clone(), entity.clone());
+                Ok(entity)
+            }
+            Some(data) => Ok(data.to_owned()),
+        }
+    }
+}
+
+/// Represents an item retrieved from an
+/// [`EthereumCallCache`](super::EthereumCallCache) implementor.
+pub struct CachedEthereumCall {
+    /// The BLAKE3 hash that uniquely represents this cache item. The way this
+    /// hash is constructed is an implementation detail.
+    pub blake3_id: Vec<u8>,
+
+    /// Block details related to this Ethereum call.
+    pub block_ptr: BlockPtr,
+
+    /// The address to the called contract.
+    pub contract_address: ethabi::Address,
+
+    /// The encoded return value of this call.
+    pub return_value: Vec<u8>,
+}
diff --git a/graph/src/components/store/err.rs b/graph/src/components/store/err.rs
new file mode 100644
index 0000000..7187e6a
--- /dev/null
+++ b/graph/src/components/store/err.rs
@@ -0,0 +1,120 @@
+use super::{BlockNumber, DeploymentHash, DeploymentSchemaVersion};
+use crate::prelude::QueryExecutionError;
+use anyhow::{anyhow, Error};
+use diesel::result::Error as DieselError;
+use thiserror::Error;
+use tokio::task::JoinError;
+
+#[derive(Error, Debug)]
+pub enum StoreError {
+    #[error("store error: {0:#}")]
+    Unknown(Error),
+    #[error(
+        "tried to set entity of type `{0}` with ID \"{1}\" but an entity of type `{2}`, \
+         which has an interface in common with `{0}`, exists with the same ID"
+    )]
+    ConflictingId(String, String, String), // (entity, id, conflicting_entity)
+    #[error("unknown field '{0}'")]
+    UnknownField(String),
+    #[error("unknown table '{0}'")]
+    UnknownTable(String),
+    #[error("malformed directive '{0}'")]
+    MalformedDirective(String),
+    #[error("query execution failed: {0}")]
+    QueryExecutionError(String),
+    #[error("invalid identifier: {0}")]
+    InvalidIdentifier(String),
+    #[error(
+        "subgraph `{0}` has already processed block `{1}`; \
+         there are most likely two (or more) nodes indexing this subgraph"
+    )]
+    DuplicateBlockProcessing(DeploymentHash, BlockNumber),
+    /// An internal error where we expected the application logic to enforce
+    /// some constraint, e.g., that subgraph names are unique, but found that
+    /// constraint to not hold
+    #[error("internal constraint violated: {0}")]
+    ConstraintViolation(String),
+    #[error("deployment not found: {0}")]
+    DeploymentNotFound(String),
+    #[error("shard not found: {0} (this usually indicates a misconfiguration)")]
+    UnknownShard(String),
+    #[error("Fulltext search not yet deterministic")]
+    FulltextSearchNonDeterministic,
+    #[error("operation was canceled")]
+    Canceled,
+    #[error("database unavailable")]
+    DatabaseUnavailable,
+    #[error("database disabled")]
+    DatabaseDisabled,
+    #[error("subgraph forking failed: {0}")]
+    ForkFailure(String),
+    #[error("subgraph writer poisoned by previous error")]
+    Poisoned,
+    #[error("panic in subgraph writer: {0}")]
+    WriterPanic(JoinError),
+    #[error(
+        "found schema version {0} but this graph node only supports versions up to {}. \
+         Did you downgrade Graph Node?",
+        DeploymentSchemaVersion::LATEST
+    )]
+    UnsupportedDeploymentSchemaVersion(i32),
+}
+
+// Convenience to report a constraint violation
+#[macro_export]
+macro_rules! constraint_violation {
+    ($msg:expr) => {{
+        StoreError::ConstraintViolation(format!("{}", $msg))
+    }};
+    ($fmt:expr, $($arg:tt)*) => {{
+        StoreError::ConstraintViolation(format!($fmt, $($arg)*))
+    }}
+}
+
+impl From<DieselError> for StoreError {
+    fn from(e: DieselError) -> Self {
+        // When the error is caused by a closed connection, treat the error
+        // as 'database unavailable'. When this happens during indexing, the
+        // indexing machinery will retry in that case rather than fail the
+        // subgraph
+        if let DieselError::DatabaseError(_, info) = &e {
+            if info
+                .message()
+                .contains("server closed the connection unexpectedly")
+            {
+                return StoreError::DatabaseUnavailable;
+            }
+        }
+        StoreError::Unknown(e.into())
+    }
+}
+
+impl From<::diesel::r2d2::PoolError> for StoreError {
+    fn from(e: ::diesel::r2d2::PoolError) -> Self {
+        StoreError::Unknown(e.into())
+    }
+}
+
+impl From<Error> for StoreError {
+    fn from(e: Error) -> Self {
+        StoreError::Unknown(e)
+    }
+}
+
+impl From<serde_json::Error> for StoreError {
+    fn from(e: serde_json::Error) -> Self {
+        StoreError::Unknown(e.into())
+    }
+}
+
+impl From<QueryExecutionError> for StoreError {
+    fn from(e: QueryExecutionError) -> Self {
+        StoreError::QueryExecutionError(e.to_string())
+    }
+}
+
+impl From<std::fmt::Error> for StoreError {
+    fn from(e: std::fmt::Error) -> Self {
+        StoreError::Unknown(anyhow!("{}", e.to_string()))
+    }
+}
diff --git a/graph/src/components/store/mod.rs b/graph/src/components/store/mod.rs
new file mode 100644
index 0000000..77cb363
--- /dev/null
+++ b/graph/src/components/store/mod.rs
@@ -0,0 +1,1110 @@
+mod cache;
+mod err;
+mod traits;
+
+pub use cache::{CachedEthereumCall, EntityCache, ModificationsAndCache};
+pub use err::StoreError;
+use itertools::Itertools;
+pub use traits::*;
+
+use futures::stream::poll_fn;
+use futures::{Async, Poll, Stream};
+use graphql_parser::schema as s;
+use serde::{Deserialize, Serialize};
+use std::collections::btree_map::Entry;
+use std::collections::{BTreeMap, BTreeSet, HashSet};
+use std::fmt;
+use std::fmt::Display;
+use std::sync::atomic::{AtomicUsize, Ordering};
+use std::sync::{Arc, RwLock};
+use std::time::Duration;
+
+use crate::blockchain::{Block, Blockchain};
+use crate::data::store::scalar::Bytes;
+use crate::data::store::*;
+use crate::data::value::Word;
+use crate::prelude::*;
+
+/// The type name of an entity. This is the string that is used in the
+/// subgraph's GraphQL schema as `type NAME @entity { .. }`
+#[derive(Clone, Debug, Serialize, Deserialize, PartialEq, Eq, PartialOrd, Ord, Hash)]
+pub struct EntityType(Word);
+
+impl EntityType {
+    /// Construct a new entity type. Ideally, this is only called when
+    /// `entity_type` either comes from the GraphQL schema, or from
+    /// the database from fields that are known to contain a valid entity type
+    pub fn new(entity_type: String) -> Self {
+        Self(entity_type.into())
+    }
+
+    pub fn as_str(&self) -> &str {
+        self.0.as_str()
+    }
+
+    pub fn into_string(self) -> String {
+        self.0.to_string()
+    }
+
+    pub fn is_poi(&self) -> bool {
+        self.0.as_str() == "Poi$"
+    }
+}
+
+impl fmt::Display for EntityType {
+    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
+        write!(f, "{}", self.0)
+    }
+}
+
+impl<'a> From<&s::ObjectType<'a, String>> for EntityType {
+    fn from(object_type: &s::ObjectType<'a, String>) -> Self {
+        EntityType::new(object_type.name.to_owned())
+    }
+}
+
+impl<'a> From<&s::InterfaceType<'a, String>> for EntityType {
+    fn from(interface_type: &s::InterfaceType<'a, String>) -> Self {
+        EntityType::new(interface_type.name.to_owned())
+    }
+}
+
+// This conversion should only be used in tests since it makes it too
+// easy to convert random strings into entity types
+#[cfg(debug_assertions)]
+impl From<&str> for EntityType {
+    fn from(s: &str) -> Self {
+        EntityType::new(s.to_owned())
+    }
+}
+
+impl CheapClone for EntityType {}
+
+#[derive(Clone, Debug, Serialize, Deserialize, PartialEq, Eq, PartialOrd, Ord, Hash)]
+pub struct EntityFilterDerivative(bool);
+
+impl EntityFilterDerivative {
+    pub fn new(derived: bool) -> Self {
+        Self(derived)
+    }
+
+    pub fn is_derived(&self) -> bool {
+        self.0
+    }
+}
+
+/// Key by which an individual entity in the store can be accessed. Stores
+/// only the entity type and id. The deployment must be known from context.
+#[derive(Clone, Debug, PartialEq, Eq, PartialOrd, Ord, Hash)]
+pub struct EntityKey {
+    /// Name of the entity type.
+    pub entity_type: EntityType,
+
+    /// ID of the individual entity.
+    pub entity_id: Word,
+}
+
+impl EntityKey {
+    pub fn data(entity_type: String, entity_id: String) -> Self {
+        Self {
+            entity_type: EntityType::new(entity_type),
+            entity_id: entity_id.into(),
+        }
+    }
+}
+
+#[derive(Clone, Debug, PartialEq)]
+pub struct Child {
+    pub attr: Attribute,
+    pub entity_type: EntityType,
+    pub filter: Box<EntityFilter>,
+    pub derived: bool,
+}
+
+/// Supported types of store filters.
+#[derive(Clone, Debug, PartialEq)]
+pub enum EntityFilter {
+    And(Vec<EntityFilter>),
+    Or(Vec<EntityFilter>),
+    Equal(Attribute, Value),
+    Not(Attribute, Value),
+    GreaterThan(Attribute, Value),
+    LessThan(Attribute, Value),
+    GreaterOrEqual(Attribute, Value),
+    LessOrEqual(Attribute, Value),
+    In(Attribute, Vec<Value>),
+    NotIn(Attribute, Vec<Value>),
+    Contains(Attribute, Value),
+    ContainsNoCase(Attribute, Value),
+    NotContains(Attribute, Value),
+    NotContainsNoCase(Attribute, Value),
+    StartsWith(Attribute, Value),
+    StartsWithNoCase(Attribute, Value),
+    NotStartsWith(Attribute, Value),
+    NotStartsWithNoCase(Attribute, Value),
+    EndsWith(Attribute, Value),
+    EndsWithNoCase(Attribute, Value),
+    NotEndsWith(Attribute, Value),
+    NotEndsWithNoCase(Attribute, Value),
+    ChangeBlockGte(BlockNumber),
+    Child(Child),
+}
+
+// A somewhat concise string representation of a filter
+impl fmt::Display for EntityFilter {
+    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
+        use EntityFilter::*;
+
+        match self {
+            And(fs) => {
+                write!(f, "{}", fs.iter().map(|f| f.to_string()).join(" and "))
+            }
+            Or(fs) => {
+                write!(f, "{}", fs.iter().map(|f| f.to_string()).join(" or "))
+            }
+            Equal(a, v) => write!(f, "{a} = {v}"),
+            Not(a, v) => write!(f, "{a} != {v}"),
+            GreaterThan(a, v) => write!(f, "{a} > {v}"),
+            LessThan(a, v) => write!(f, "{a} < {v}"),
+            GreaterOrEqual(a, v) => write!(f, "{a} >= {v}"),
+            LessOrEqual(a, v) => write!(f, "{a} <= {v}"),
+            In(a, vs) => write!(
+                f,
+                "{a} in ({})",
+                vs.into_iter().map(|v| v.to_string()).join(",")
+            ),
+            NotIn(a, vs) => write!(
+                f,
+                "{a} not in ({})",
+                vs.into_iter().map(|v| v.to_string()).join(",")
+            ),
+            Contains(a, v) => write!(f, "{a} ~ *{v}*"),
+            ContainsNoCase(a, v) => write!(f, "{a} ~ *{v}*i"),
+            NotContains(a, v) => write!(f, "{a} !~ *{v}*"),
+            NotContainsNoCase(a, v) => write!(f, "{a} !~ *{v}*i"),
+            StartsWith(a, v) => write!(f, "{a} ~ ^{v}*"),
+            StartsWithNoCase(a, v) => write!(f, "{a} ~ ^{v}*i"),
+            NotStartsWith(a, v) => write!(f, "{a} !~ ^{v}*"),
+            NotStartsWithNoCase(a, v) => write!(f, "{a} !~ ^{v}*i"),
+            EndsWith(a, v) => write!(f, "{a} ~ *{v}$"),
+            EndsWithNoCase(a, v) => write!(f, "{a} ~ *{v}$i"),
+            NotEndsWith(a, v) => write!(f, "{a} !~ *{v}$"),
+            NotEndsWithNoCase(a, v) => write!(f, "{a} !~ *{v}$i"),
+            ChangeBlockGte(b) => write!(f, "block >= {b}"),
+            Child(child /* a, et, cf, _ */) => write!(
+                f,
+                "join on {} with {}({})",
+                child.attr,
+                child.entity_type,
+                child.filter.to_string()
+            ),
+        }
+    }
+}
+
+// Define some convenience methods
+impl EntityFilter {
+    pub fn new_equal(
+        attribute_name: impl Into<Attribute>,
+        attribute_value: impl Into<Value>,
+    ) -> Self {
+        EntityFilter::Equal(attribute_name.into(), attribute_value.into())
+    }
+
+    pub fn new_in(
+        attribute_name: impl Into<Attribute>,
+        attribute_values: Vec<impl Into<Value>>,
+    ) -> Self {
+        EntityFilter::In(
+            attribute_name.into(),
+            attribute_values.into_iter().map(Into::into).collect(),
+        )
+    }
+
+    pub fn and_maybe(self, other: Option<Self>) -> Self {
+        use EntityFilter as f;
+        match other {
+            Some(other) => match (self, other) {
+                (f::And(mut fs1), f::And(mut fs2)) => {
+                    fs1.append(&mut fs2);
+                    f::And(fs1)
+                }
+                (f::And(mut fs1), f2) => {
+                    fs1.push(f2);
+                    f::And(fs1)
+                }
+                (f1, f::And(mut fs2)) => {
+                    fs2.push(f1);
+                    f::And(fs2)
+                }
+                (f1, f2) => f::And(vec![f1, f2]),
+            },
+            None => self,
+        }
+    }
+}
+
+/// The order in which entities should be restored from a store.
+#[derive(Clone, Debug, PartialEq)]
+pub enum EntityOrder {
+    /// Order ascending by the given attribute. Use `id` as a tie-breaker
+    Ascending(String, ValueType),
+    /// Order descending by the given attribute. Use `id` as a tie-breaker
+    Descending(String, ValueType),
+    /// Order by the `id` of the entities
+    Default,
+    /// Do not order at all. This speeds up queries where we know that
+    /// order does not matter
+    Unordered,
+}
+
+/// How many entities to return, how many to skip etc.
+#[derive(Clone, Debug, PartialEq)]
+pub struct EntityRange {
+    /// Limit on how many entities to return.
+    pub first: Option<u32>,
+
+    /// How many entities to skip.
+    pub skip: u32,
+}
+
+impl EntityRange {
+    /// Query for the first `n` entities.
+    pub fn first(n: u32) -> Self {
+        Self {
+            first: Some(n),
+            skip: 0,
+        }
+    }
+}
+
+/// The attribute we want to window by in an `EntityWindow`. We have to
+/// distinguish between scalar and list attributes since we need to use
+/// different queries for them, and the JSONB storage scheme can not
+/// determine that by itself
+#[derive(Clone, Debug, PartialEq)]
+pub enum WindowAttribute {
+    Scalar(String),
+    List(String),
+}
+
+impl WindowAttribute {
+    pub fn name(&self) -> &str {
+        match self {
+            WindowAttribute::Scalar(name) => name,
+            WindowAttribute::List(name) => name,
+        }
+    }
+}
+
+/// How to connect children to their parent when the child table does not
+/// store parent id's
+#[derive(Clone, Debug, PartialEq)]
+pub enum ParentLink {
+    /// The parent stores a list of child ids. The ith entry in the outer
+    /// vector contains the id of the children for `EntityWindow.ids[i]`
+    List(Vec<Vec<String>>),
+    /// The parent stores the id of one child. The ith entry in the
+    /// vector contains the id of the child of the parent with id
+    /// `EntityWindow.ids[i]`
+    Scalar(Vec<String>),
+}
+
+/// How many children a parent can have when the child stores
+/// the id of the parent
+#[derive(Clone, Copy, Debug, PartialEq)]
+pub enum ChildMultiplicity {
+    Single,
+    Many,
+}
+
+/// How to select children for their parents depending on whether the
+/// child stores parent ids (`Direct`) or the parent
+/// stores child ids (`Parent`)
+#[derive(Clone, Debug, PartialEq)]
+pub enum EntityLink {
+    /// The parent id is stored in this child attribute
+    Direct(WindowAttribute, ChildMultiplicity),
+    /// Join with the parents table to get at the parent id
+    Parent(EntityType, ParentLink),
+}
+
+/// Window results of an `EntityQuery` query along the parent's id:
+/// the `order_by`, `order_direction`, and `range` of the query apply to
+/// entities that belong to the same parent. Only entities that belong to
+/// one of the parents listed in `ids` will be included in the query result.
+///
+/// Note that different windows can vary both by the entity type and id of
+/// the children, but also by how to get from a child to its parent, i.e.,
+/// it is possible that two windows access the same entity type, but look
+/// at different attributes to connect to parent entities
+#[derive(Clone, Debug, PartialEq)]
+pub struct EntityWindow {
+    /// The entity type for this window
+    pub child_type: EntityType,
+    /// The ids of parents that should be considered for this window
+    pub ids: Vec<String>,
+    /// How to get the parent id
+    pub link: EntityLink,
+    pub column_names: AttributeNames,
+}
+
+/// The base collections from which we are going to get entities for use in
+/// `EntityQuery`; the result of the query comes from applying the query's
+/// filter and order etc. to the entities described in this collection. For
+/// a windowed collection order and range are applied to each individual
+/// window
+#[derive(Clone, Debug, PartialEq)]
+pub enum EntityCollection {
+    /// Use all entities of the given types
+    All(Vec<(EntityType, AttributeNames)>),
+    /// Use entities according to the windows. The set of entities that we
+    /// apply order and range to is formed by taking all entities matching
+    /// the window, and grouping them by the attribute of the window. Entities
+    /// that have the same value in the `attribute` field of their window are
+    /// grouped together. Note that it is possible to have one window for
+    /// entity type `A` and attribute `a`, and another for entity type `B` and
+    /// column `b`; they will be grouped by using `A.a` and `B.b` as the keys
+    Window(Vec<EntityWindow>),
+}
+
+impl EntityCollection {
+    pub fn entity_types_and_column_names(&self) -> BTreeMap<EntityType, AttributeNames> {
+        let mut map = BTreeMap::new();
+        match self {
+            EntityCollection::All(pairs) => pairs.iter().for_each(|(entity_type, column_names)| {
+                map.insert(entity_type.clone(), column_names.clone());
+            }),
+            EntityCollection::Window(windows) => windows.iter().for_each(
+                |EntityWindow {
+                     child_type,
+                     column_names,
+                     ..
+                 }| match map.entry(child_type.clone()) {
+                    Entry::Occupied(mut entry) => entry.get_mut().extend(column_names.clone()),
+                    Entry::Vacant(entry) => {
+                        entry.insert(column_names.clone());
+                    }
+                },
+            ),
+        }
+        map
+    }
+}
+
+/// The type we use for block numbers. This has to be a signed integer type
+/// since Postgres does not support unsigned integer types. But 2G ought to
+/// be enough for everybody
+pub type BlockNumber = i32;
+
+pub const BLOCK_NUMBER_MAX: BlockNumber = std::i32::MAX;
+
+/// A query for entities in a store.
+///
+/// Details of how query generation for `EntityQuery` works can be found
+/// at https://github.com/graphprotocol/rfcs/blob/master/engineering-plans/0001-graphql-query-prefetching.md
+#[derive(Clone, Debug)]
+pub struct EntityQuery {
+    /// ID of the subgraph.
+    pub subgraph_id: DeploymentHash,
+
+    /// The block height at which to execute the query. Set this to
+    /// `BLOCK_NUMBER_MAX` to run the query at the latest available block.
+    /// If the subgraph uses JSONB storage, anything but `BLOCK_NUMBER_MAX`
+    /// will cause an error as JSONB storage does not support querying anything
+    /// but the latest block
+    pub block: BlockNumber,
+
+    /// The names of the entity types being queried. The result is the union
+    /// (with repetition) of the query for each entity.
+    pub collection: EntityCollection,
+
+    /// Filter to filter entities by.
+    pub filter: Option<EntityFilter>,
+
+    /// How to order the entities
+    pub order: EntityOrder,
+
+    /// A range to limit the size of the result.
+    pub range: EntityRange,
+
+    /// Optional logger for anything related to this query
+    pub logger: Option<Logger>,
+
+    pub query_id: Option<String>,
+
+    _force_use_of_new: (),
+}
+
+impl EntityQuery {
+    pub fn new(
+        subgraph_id: DeploymentHash,
+        block: BlockNumber,
+        collection: EntityCollection,
+    ) -> Self {
+        EntityQuery {
+            subgraph_id,
+            block,
+            collection,
+            filter: None,
+            order: EntityOrder::Default,
+            range: EntityRange::first(100),
+            logger: None,
+            query_id: None,
+            _force_use_of_new: (),
+        }
+    }
+
+    pub fn filter(mut self, filter: EntityFilter) -> Self {
+        self.filter = Some(filter);
+        self
+    }
+
+    pub fn order(mut self, order: EntityOrder) -> Self {
+        self.order = order;
+        self
+    }
+
+    pub fn range(mut self, range: EntityRange) -> Self {
+        self.range = range;
+        self
+    }
+
+    pub fn first(mut self, first: u32) -> Self {
+        self.range.first = Some(first);
+        self
+    }
+
+    pub fn skip(mut self, skip: u32) -> Self {
+        self.range.skip = skip;
+        self
+    }
+
+    pub fn simplify(mut self) -> Self {
+        // If there is one window, with one id, in a direct relation to the
+        // entities, we can simplify the query by changing the filter and
+        // getting rid of the window
+        if let EntityCollection::Window(windows) = &self.collection {
+            if windows.len() == 1 {
+                let window = windows.first().expect("we just checked");
+                if window.ids.len() == 1 {
+                    let id = window.ids.first().expect("we just checked");
+                    if let EntityLink::Direct(attribute, _) = &window.link {
+                        let filter = match attribute {
+                            WindowAttribute::Scalar(name) => {
+                                EntityFilter::Equal(name.to_owned(), id.into())
+                            }
+                            WindowAttribute::List(name) => {
+                                EntityFilter::Contains(name.to_owned(), Value::from(vec![id]))
+                            }
+                        };
+                        self.filter = Some(filter.and_maybe(self.filter));
+                        self.collection = EntityCollection::All(vec![(
+                            window.child_type.to_owned(),
+                            window.column_names.clone(),
+                        )]);
+                    }
+                }
+            }
+        }
+        self
+    }
+}
+
+/// Operation types that lead to entity changes.
+#[derive(Clone, Debug, Serialize, Deserialize, PartialEq, Eq, Hash)]
+#[serde(rename_all = "lowercase")]
+pub enum EntityChangeOperation {
+    /// An entity was added or updated
+    Set,
+    /// An existing entity was removed.
+    Removed,
+}
+
+/// Entity change events emitted by [Store](trait.Store.html) implementations.
+#[derive(Clone, Debug, Serialize, Deserialize, PartialEq, Eq, Hash)]
+pub enum EntityChange {
+    Data {
+        subgraph_id: DeploymentHash,
+        /// Entity type name of the changed entity.
+        entity_type: EntityType,
+    },
+    Assignment {
+        deployment: DeploymentLocator,
+        operation: EntityChangeOperation,
+    },
+}
+
+impl EntityChange {
+    pub fn for_data(subgraph_id: DeploymentHash, key: EntityKey) -> Self {
+        Self::Data {
+            subgraph_id: subgraph_id,
+            entity_type: key.entity_type,
+        }
+    }
+
+    pub fn for_assignment(deployment: DeploymentLocator, operation: EntityChangeOperation) -> Self {
+        Self::Assignment {
+            deployment,
+            operation,
+        }
+    }
+
+    pub fn as_filter(&self) -> SubscriptionFilter {
+        use EntityChange::*;
+        match self {
+            Data {
+                subgraph_id,
+                entity_type,
+                ..
+            } => SubscriptionFilter::Entities(subgraph_id.clone(), entity_type.clone()),
+            Assignment { .. } => SubscriptionFilter::Assignment,
+        }
+    }
+}
+
+#[derive(Clone, Debug, Serialize, Deserialize)]
+/// The store emits `StoreEvents` to indicate that some entities have changed.
+/// For block-related data, at most one `StoreEvent` is emitted for each block
+/// that is processed. The `changes` vector contains the details of what changes
+/// were made, and to which entity.
+///
+/// Since the 'subgraph of subgraphs' is special, and not directly related to
+/// any specific blocks, `StoreEvents` for it are generated as soon as they are
+/// written to the store.
+pub struct StoreEvent {
+    // The tag is only there to make it easier to track StoreEvents in the
+    // logs as they flow through the system
+    pub tag: usize,
+    pub changes: HashSet<EntityChange>,
+}
+
+impl StoreEvent {
+    pub fn new(changes: Vec<EntityChange>) -> StoreEvent {
+        static NEXT_TAG: AtomicUsize = AtomicUsize::new(0);
+
+        let tag = NEXT_TAG.fetch_add(1, Ordering::Relaxed);
+        let changes = changes.into_iter().collect();
+        StoreEvent { tag, changes }
+    }
+
+    pub fn from_mods<'a, I: IntoIterator<Item = &'a EntityModification>>(
+        subgraph_id: &DeploymentHash,
+        mods: I,
+    ) -> Self {
+        let changes: Vec<_> = mods
+            .into_iter()
+            .map(|op| {
+                use self::EntityModification::*;
+                match op {
+                    Insert { key, .. } | Overwrite { key, .. } | Remove { key } => {
+                        EntityChange::for_data(subgraph_id.clone(), key.clone())
+                    }
+                }
+            })
+            .collect();
+        StoreEvent::new(changes)
+    }
+
+    /// Extend `ev1` with `ev2`. If `ev1` is `None`, just set it to `ev2`
+    fn accumulate(logger: &Logger, ev1: &mut Option<StoreEvent>, ev2: StoreEvent) {
+        if let Some(e) = ev1 {
+            trace!(logger, "Adding changes to event";
+                           "from" => ev2.tag, "to" => e.tag);
+            e.changes.extend(ev2.changes);
+        } else {
+            *ev1 = Some(ev2);
+        }
+    }
+
+    pub fn extend(mut self, other: StoreEvent) -> Self {
+        self.changes.extend(other.changes);
+        self
+    }
+
+    pub fn matches(&self, filters: &BTreeSet<SubscriptionFilter>) -> bool {
+        self.changes
+            .iter()
+            .any(|change| filters.iter().any(|filter| filter.matches(change)))
+    }
+}
+
+impl fmt::Display for StoreEvent {
+    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
+        write!(
+            f,
+            "StoreEvent[{}](changes: {})",
+            self.tag,
+            self.changes.len()
+        )
+    }
+}
+
+impl PartialEq for StoreEvent {
+    fn eq(&self, other: &StoreEvent) -> bool {
+        // Ignore tag for equality
+        self.changes == other.changes
+    }
+}
+
+/// A `StoreEventStream` produces the `StoreEvents`. Various filters can be applied
+/// to it to reduce which and how many events are delivered by the stream.
+pub struct StoreEventStream<S> {
+    source: S,
+}
+
+/// A boxed `StoreEventStream`
+pub type StoreEventStreamBox =
+    StoreEventStream<Box<dyn Stream<Item = Arc<StoreEvent>, Error = ()> + Send>>;
+
+pub type UnitStream = Box<dyn futures03::Stream<Item = ()> + Unpin + Send + Sync>;
+
+impl<S> Stream for StoreEventStream<S>
+where
+    S: Stream<Item = Arc<StoreEvent>, Error = ()> + Send,
+{
+    type Item = Arc<StoreEvent>;
+    type Error = ();
+
+    fn poll(&mut self) -> Result<Async<Option<Self::Item>>, Self::Error> {
+        self.source.poll()
+    }
+}
+
+impl<S> StoreEventStream<S>
+where
+    S: Stream<Item = Arc<StoreEvent>, Error = ()> + Send + 'static,
+{
+    // Create a new `StoreEventStream` from another such stream
+    pub fn new(source: S) -> Self {
+        StoreEventStream { source }
+    }
+
+    /// Filter a `StoreEventStream` by subgraph and entity. Only events that have
+    /// at least one change to one of the given (subgraph, entity) combinations
+    /// will be delivered by the filtered stream.
+    pub fn filter_by_entities(self, filters: BTreeSet<SubscriptionFilter>) -> StoreEventStreamBox {
+        let source = self.source.filter(move |event| event.matches(&filters));
+
+        StoreEventStream::new(Box::new(source))
+    }
+
+    /// Reduce the frequency with which events are generated while a
+    /// subgraph deployment is syncing. While the given `deployment` is not
+    /// synced yet, events from `source` are reported at most every
+    /// `interval`. At the same time, no event is held for longer than
+    /// `interval`. The `StoreEvents` that arrive during an interval appear
+    /// on the returned stream as a single `StoreEvent`; the events are
+    /// combined by using the maximum of all sources and the concatenation
+    /// of the changes of the `StoreEvents` received during the interval.
+    //
+    // Currently unused, needs to be made compatible with `subscribe_no_payload`.
+    pub async fn throttle_while_syncing(
+        self,
+        logger: &Logger,
+        store: Arc<dyn QueryStore>,
+        interval: Duration,
+    ) -> StoreEventStreamBox {
+        // Check whether a deployment is marked as synced in the store. Note that in the moment a
+        // subgraph becomes synced any existing subscriptions will continue to be throttled since
+        // this is not re-checked.
+        let synced = store.is_deployment_synced().await.unwrap_or(false);
+
+        let mut pending_event: Option<StoreEvent> = None;
+        let mut source = self.source.fuse();
+        let mut had_err = false;
+        let mut delay = tokio::time::sleep(interval).unit_error().boxed().compat();
+        let logger = logger.clone();
+
+        let source = Box::new(poll_fn(move || -> Poll<Option<Arc<StoreEvent>>, ()> {
+            if had_err {
+                // We had an error the last time through, but returned the pending
+                // event first. Indicate the error now
+                had_err = false;
+                return Err(());
+            }
+
+            if synced {
+                return source.poll();
+            }
+
+            // Check if interval has passed since the last time we sent something.
+            // If it has, start a new delay timer
+            let should_send = match futures::future::Future::poll(&mut delay) {
+                Ok(Async::NotReady) => false,
+                // Timer errors are harmless. Treat them as if the timer had
+                // become ready.
+                Ok(Async::Ready(())) | Err(_) => {
+                    delay = tokio::time::sleep(interval).unit_error().boxed().compat();
+                    true
+                }
+            };
+
+            // Get as many events as we can off of the source stream
+            loop {
+                match source.poll() {
+                    Ok(Async::NotReady) => {
+                        if should_send && pending_event.is_some() {
+                            let event = pending_event.take().map(Arc::new);
+                            return Ok(Async::Ready(event));
+                        } else {
+                            return Ok(Async::NotReady);
+                        }
+                    }
+                    Ok(Async::Ready(None)) => {
+                        let event = pending_event.take().map(Arc::new);
+                        return Ok(Async::Ready(event));
+                    }
+                    Ok(Async::Ready(Some(event))) => {
+                        StoreEvent::accumulate(&logger, &mut pending_event, (*event).clone());
+                    }
+                    Err(()) => {
+                        // Before we report the error, deliver what we have accumulated so far.
+                        // We will report the error the next time poll() is called
+                        if pending_event.is_some() {
+                            had_err = true;
+                            let event = pending_event.take().map(Arc::new);
+                            return Ok(Async::Ready(event));
+                        } else {
+                            return Err(());
+                        }
+                    }
+                };
+            }
+        }));
+        StoreEventStream::new(source)
+    }
+}
+
+/// An entity operation that can be transacted into the store.
+#[derive(Clone, Debug, PartialEq)]
+pub enum EntityOperation {
+    /// Locates the entity specified by `key` and sets its attributes according to the contents of
+    /// `data`.  If no entity exists with this key, creates a new entity.
+    Set { key: EntityKey, data: Entity },
+
+    /// Removes an entity with the specified key, if one exists.
+    Remove { key: EntityKey },
+}
+
+#[derive(Debug, PartialEq)]
+pub enum UnfailOutcome {
+    Noop,
+    Unfailed,
+}
+
+#[derive(Clone, PartialEq, Eq, Debug)]
+pub struct StoredDynamicDataSource {
+    pub manifest_idx: u32,
+    pub param: Option<Bytes>,
+    pub context: Option<serde_json::Value>,
+    pub creation_block: Option<BlockNumber>,
+    pub is_offchain: bool,
+}
+
+/// An internal identifer for the specific instance of a deployment. The
+/// identifier only has meaning in the context of a specific instance of
+/// graph-node. Only store code should ever construct or consume it; all
+/// other code passes it around as an opaque token.
+#[derive(Copy, Clone, Debug, Serialize, Deserialize, PartialEq, Eq, Hash)]
+pub struct DeploymentId(pub i32);
+
+impl Display for DeploymentId {
+    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> Result<(), fmt::Error> {
+        write!(f, "{}", self.0)
+    }
+}
+
+impl DeploymentId {
+    pub fn new(id: i32) -> Self {
+        Self(id)
+    }
+}
+
+/// A unique identifier for a deployment that specifies both its external
+/// identifier (`hash`) and its unique internal identifier (`id`) which
+/// ensures we are talking about a unique location for the deployment's data
+/// in the store
+#[derive(Clone, Debug, Serialize, Deserialize, PartialEq, Eq, Hash)]
+pub struct DeploymentLocator {
+    pub id: DeploymentId,
+    pub hash: DeploymentHash,
+}
+
+impl CheapClone for DeploymentLocator {}
+
+impl slog::Value for DeploymentLocator {
+    fn serialize(
+        &self,
+        record: &slog::Record,
+        key: slog::Key,
+        serializer: &mut dyn slog::Serializer,
+    ) -> slog::Result {
+        slog::Value::serialize(&self.to_string(), record, key, serializer)
+    }
+}
+
+impl DeploymentLocator {
+    pub fn new(id: DeploymentId, hash: DeploymentHash) -> Self {
+        Self { id, hash }
+    }
+}
+
+impl Display for DeploymentLocator {
+    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
+        write!(f, "{}[{}]", self.hash, self.id)
+    }
+}
+
+// The type that the connection pool uses to track wait times for
+// connection checkouts
+pub type PoolWaitStats = Arc<RwLock<MovingStats>>;
+
+/// An entity operation that can be transacted into the store; as opposed to
+/// `EntityOperation`, we already know whether a `Set` should be an `Insert`
+/// or `Update`
+#[derive(Clone, Debug, PartialEq, Eq)]
+pub enum EntityModification {
+    /// Insert the entity
+    Insert { key: EntityKey, data: Entity },
+    /// Update the entity by overwriting it
+    Overwrite { key: EntityKey, data: Entity },
+    /// Remove the entity
+    Remove { key: EntityKey },
+}
+
+impl EntityModification {
+    pub fn entity_ref(&self) -> &EntityKey {
+        use EntityModification::*;
+        match self {
+            Insert { key, .. } | Overwrite { key, .. } | Remove { key } => key,
+        }
+    }
+
+    pub fn entity(&self) -> Option<&Entity> {
+        match self {
+            EntityModification::Insert { data, .. }
+            | EntityModification::Overwrite { data, .. } => Some(data),
+            EntityModification::Remove { .. } => None,
+        }
+    }
+
+    pub fn is_remove(&self) -> bool {
+        match self {
+            EntityModification::Remove { .. } => true,
+            _ => false,
+        }
+    }
+}
+
+/// A representation of entity operations that can be accumulated.
+#[derive(Debug, Clone)]
+enum EntityOp {
+    Remove,
+    Update(Entity),
+    Overwrite(Entity),
+}
+
+impl EntityOp {
+    fn apply_to(self, entity: Option<Entity>) -> Option<Entity> {
+        use EntityOp::*;
+        match (self, entity) {
+            (Remove, _) => None,
+            (Overwrite(new), _) | (Update(new), None) => Some(new),
+            (Update(updates), Some(mut entity)) => {
+                entity.merge_remove_null_fields(updates);
+                Some(entity)
+            }
+        }
+    }
+
+    fn accumulate(&mut self, next: EntityOp) {
+        use EntityOp::*;
+        let update = match next {
+            // Remove and Overwrite ignore the current value.
+            Remove | Overwrite(_) => {
+                *self = next;
+                return;
+            }
+            Update(update) => update,
+        };
+
+        // We have an update, apply it.
+        match self {
+            // This is how `Overwrite` is constructed, by accumulating `Update` onto `Remove`.
+            Remove => *self = Overwrite(update),
+            Update(current) | Overwrite(current) => current.merge(update),
+        }
+    }
+}
+
+/// Determines which columns should be selected in a table.
+#[derive(Clone, Debug, PartialEq, Eq, Hash)]
+pub enum AttributeNames {
+    /// Select all columns. Equivalent to a `"SELECT *"`.
+    All,
+    /// Individual column names to be selected.
+    Select(BTreeSet<String>),
+}
+
+impl AttributeNames {
+    fn insert(&mut self, column_name: &str) {
+        match self {
+            AttributeNames::All => {
+                let mut set = BTreeSet::new();
+                set.insert(column_name.to_string());
+                *self = AttributeNames::Select(set)
+            }
+            AttributeNames::Select(set) => {
+                set.insert(column_name.to_string());
+            }
+        }
+    }
+
+    pub fn update(&mut self, field_name: &str) {
+        if Self::is_meta_field(field_name) {
+            return;
+        }
+        self.insert(field_name)
+    }
+
+    /// Adds a attribute name. Ignores meta fields.
+    pub fn add_str(&mut self, field_name: &str) {
+        if Self::is_meta_field(field_name) {
+            return;
+        }
+        self.insert(field_name);
+    }
+
+    /// Returns `true` for meta field names, `false` otherwise.
+    fn is_meta_field(field_name: &str) -> bool {
+        field_name.starts_with("__")
+    }
+
+    pub fn extend(&mut self, other: Self) {
+        use AttributeNames::*;
+        match (self, other) {
+            (All, All) => {}
+            (self_ @ All, other @ Select(_)) => *self_ = other,
+            (Select(_), All) => {
+                unreachable!()
+            }
+            (Select(a), Select(b)) => a.extend(b),
+        }
+    }
+}
+
+#[derive(Debug, Clone)]
+pub struct PartialBlockPtr {
+    pub number: BlockNumber,
+    pub hash: Option<BlockHash>,
+}
+
+impl From<BlockNumber> for PartialBlockPtr {
+    fn from(number: BlockNumber) -> Self {
+        Self { number, hash: None }
+    }
+}
+
+#[derive(Copy, Clone, Debug, PartialEq, Eq, PartialOrd, Ord)]
+pub enum DeploymentSchemaVersion {
+    /// V0, baseline version, in which:
+    /// - A relational schema is used.
+    /// - Each deployment has its own namespace for entity tables.
+    /// - Dynamic data sources are stored in `subgraphs.dynamic_ethereum_contract_data_source`.
+    V0 = 0,
+
+    /// V1: Dynamic data sources moved to `sgd*.data_sources$`.
+    V1 = 1,
+}
+
+impl DeploymentSchemaVersion {
+    // Latest schema version supported by this version of graph node.
+    pub const LATEST: Self = Self::V1;
+
+    pub fn private_data_sources(self) -> bool {
+        use DeploymentSchemaVersion::*;
+        match self {
+            V0 => false,
+            V1 => true,
+        }
+    }
+}
+
+impl TryFrom<i32> for DeploymentSchemaVersion {
+    type Error = StoreError;
+
+    fn try_from(value: i32) -> Result<Self, Self::Error> {
+        match value {
+            0 => Ok(Self::V0),
+            1 => Ok(Self::V1),
+            _ => Err(StoreError::UnsupportedDeploymentSchemaVersion(value)),
+        }
+    }
+}
+
+impl fmt::Display for DeploymentSchemaVersion {
+    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
+        fmt::Display::fmt(&(*self as i32), f)
+    }
+}
+
+/// A `ReadStore` that is always empty.
+pub struct EmptyStore {
+    schema: Arc<Schema>,
+}
+
+impl EmptyStore {
+    pub fn new(schema: Arc<Schema>) -> Self {
+        EmptyStore { schema }
+    }
+}
+
+impl ReadStore for EmptyStore {
+    fn get(&self, _key: &EntityKey) -> Result<Option<Entity>, StoreError> {
+        Ok(None)
+    }
+
+    fn get_many(
+        &self,
+        _ids_for_type: BTreeMap<&EntityType, Vec<&str>>,
+    ) -> Result<BTreeMap<EntityType, Vec<Entity>>, StoreError> {
+        Ok(BTreeMap::new())
+    }
+
+    fn input_schema(&self) -> Arc<Schema> {
+        self.schema.cheap_clone()
+    }
+}
+
+/// An estimate of the number of entities and the number of entity versions
+/// in a database table
+#[derive(Clone, Debug)]
+pub struct VersionStats {
+    pub entities: i32,
+    pub versions: i32,
+    pub tablename: String,
+    /// The ratio `entities / versions`
+    pub ratio: f64,
+}
+
+/// Callbacks for `SubgraphStore.prune` so that callers can report progress
+/// of the pruning procedure to users
+#[allow(unused_variables)]
+pub trait PruneReporter: Send + 'static {
+    fn start_analyze(&mut self) {}
+    fn start_analyze_table(&mut self, table: &str) {}
+    fn finish_analyze_table(&mut self, table: &str) {}
+    fn finish_analyze(&mut self, stats: &[VersionStats]) {}
+
+    fn copy_final_start(&mut self, earliest_block: BlockNumber, final_block: BlockNumber) {}
+    fn copy_final_batch(&mut self, table: &str, rows: usize, total_rows: usize, finished: bool) {}
+    fn copy_final_finish(&mut self) {}
+
+    fn start_switch(&mut self) {}
+    fn copy_nonfinal_start(&mut self, table: &str) {}
+    fn copy_nonfinal_finish(&mut self, table: &str, rows: usize) {}
+    fn finish_switch(&mut self) {}
+
+    fn finish_prune(&mut self) {}
+}
diff --git a/graph/src/components/store/traits.rs b/graph/src/components/store/traits.rs
new file mode 100644
index 0000000..1749b8b
--- /dev/null
+++ b/graph/src/components/store/traits.rs
@@ -0,0 +1,517 @@
+use web3::types::{Address, H256};
+
+use super::*;
+use crate::blockchain::block_stream::FirehoseCursor;
+use crate::components::server::index_node::VersionInfo;
+use crate::components::transaction_receipt;
+use crate::components::versions::ApiVersion;
+use crate::data::query::Trace;
+use crate::data::subgraph::status;
+use crate::data::value::Word;
+use crate::data::{query::QueryTarget, subgraph::schema::*};
+
+pub trait SubscriptionManager: Send + Sync + 'static {
+    /// Subscribe to changes for specific subgraphs and entities.
+    ///
+    /// Returns a stream of store events that match the input arguments.
+    fn subscribe(&self, entities: BTreeSet<SubscriptionFilter>) -> StoreEventStreamBox;
+
+    /// If the payload is not required, use for a more efficient subscription mechanism backed by a watcher.
+    fn subscribe_no_payload(&self, entities: BTreeSet<SubscriptionFilter>) -> UnitStream;
+}
+
+/// Subgraph forking is the process of lazily fetching entities
+/// from another subgraph's store (usually a remote one).
+pub trait SubgraphFork: Send + Sync + 'static {
+    fn fetch(&self, entity_type: String, id: String) -> Result<Option<Entity>, StoreError>;
+}
+
+/// A special trait to handle looking up ENS names from special rainbow
+/// tables that need to be manually loaded into the system
+pub trait EnsLookup: Send + Sync + 'static {
+    /// Find the reverse of keccak256 for `hash` through looking it up in the
+    /// rainbow table.
+    fn find_name(&self, hash: &str) -> Result<Option<String>, StoreError>;
+}
+
+/// An entry point for all operations that require access to the node's storage
+/// layer. It provides access to a [`BlockStore`] and a [`SubgraphStore`].
+pub trait Store: Clone + StatusStore + Send + Sync + 'static {
+    /// The [`BlockStore`] implementor used by this [`Store`].
+    type BlockStore: BlockStore;
+
+    /// The [`SubgraphStore`] implementor used by this [`Store`].
+    type SubgraphStore: SubgraphStore;
+
+    fn block_store(&self) -> Arc<Self::BlockStore>;
+
+    fn subgraph_store(&self) -> Arc<Self::SubgraphStore>;
+}
+
+/// Common trait for store implementations.
+#[async_trait]
+pub trait SubgraphStore: Send + Sync + 'static {
+    fn ens_lookup(&self) -> Arc<dyn EnsLookup>;
+
+    /// Check if the store is accepting queries for the specified subgraph.
+    /// May return true even if the specified subgraph is not currently assigned to an indexing
+    /// node, as the store will still accept queries.
+    fn is_deployed(&self, id: &DeploymentHash) -> Result<bool, StoreError>;
+
+    /// Create a new deployment for the subgraph `name`. If the deployment
+    /// already exists (as identified by the `schema.id`), reuse that, otherwise
+    /// create a new deployment, and point the current or pending version of
+    /// `name` at it, depending on the `mode`
+    fn create_subgraph_deployment(
+        &self,
+        name: SubgraphName,
+        schema: &Schema,
+        deployment: DeploymentCreate,
+        node_id: NodeId,
+        network: String,
+        mode: SubgraphVersionSwitchingMode,
+    ) -> Result<DeploymentLocator, StoreError>;
+
+    /// Create a new subgraph with the given name. If one already exists, use
+    /// the existing one. Return the `id` of the newly created or existing
+    /// subgraph
+    fn create_subgraph(&self, name: SubgraphName) -> Result<String, StoreError>;
+
+    /// Remove a subgraph and all its versions; if deployments that were used
+    /// by this subgraph do not need to be indexed anymore, also remove
+    /// their assignment, but keep the deployments themselves around
+    fn remove_subgraph(&self, name: SubgraphName) -> Result<(), StoreError>;
+
+    /// Assign the subgraph with `id` to the node `node_id`. If there is no
+    /// assignment for the given deployment, report an error.
+    fn reassign_subgraph(
+        &self,
+        deployment: &DeploymentLocator,
+        node_id: &NodeId,
+    ) -> Result<(), StoreError>;
+
+    fn assigned_node(&self, deployment: &DeploymentLocator) -> Result<Option<NodeId>, StoreError>;
+
+    fn assignments(&self, node: &NodeId) -> Result<Vec<DeploymentLocator>, StoreError>;
+
+    /// Return `true` if a subgraph `name` exists, regardless of whether the
+    /// subgraph has any deployments attached to it
+    fn subgraph_exists(&self, name: &SubgraphName) -> Result<bool, StoreError>;
+
+    /// Returns a collection of all [`EntityModification`] items in relation to
+    /// the given [`BlockNumber`]. No distinction is made between inserts and
+    /// updates, which may be returned as either [`EntityModification::Insert`]
+    /// or [`EntityModification::Overwrite`].
+    fn entity_changes_in_block(
+        &self,
+        subgraph_id: &DeploymentHash,
+        block_number: BlockNumber,
+    ) -> Result<Vec<EntityOperation>, StoreError>;
+
+    /// Return the GraphQL schema supplied by the user
+    fn input_schema(&self, subgraph_id: &DeploymentHash) -> Result<Arc<Schema>, StoreError>;
+
+    /// Return the GraphQL schema that was derived from the user's schema by
+    /// adding a root query type etc. to it
+    fn api_schema(
+        &self,
+        subgraph_id: &DeploymentHash,
+        api_version: &ApiVersion,
+    ) -> Result<Arc<ApiSchema>, StoreError>;
+
+    /// Return a `SubgraphFork`, derived from the user's `debug-fork` deployment argument,
+    /// that is used for debugging purposes only.
+    fn debug_fork(
+        &self,
+        subgraph_id: &DeploymentHash,
+        logger: Logger,
+    ) -> Result<Option<Arc<dyn SubgraphFork>>, StoreError>;
+
+    /// Return a `WritableStore` that is used for indexing subgraphs. Only
+    /// code that is part of indexing a subgraph should ever use this. The
+    /// `logger` will be used to log important messages related to the
+    /// subgraph.
+    ///
+    /// This function should only be called in situations where no
+    /// assumptions about the in-memory state of writing has been made; in
+    /// particular, no assumptions about whether previous writes have
+    /// actually been committed or not.
+    async fn writable(
+        self: Arc<Self>,
+        logger: Logger,
+        deployment: DeploymentId,
+    ) -> Result<Arc<dyn WritableStore>, StoreError>;
+
+    /// Return the minimum block pointer of all deployments with this `id`
+    /// that we would use to query or copy from; in particular, this will
+    /// ignore any instances of this deployment that are in the process of
+    /// being set up
+    async fn least_block_ptr(&self, id: &DeploymentHash) -> Result<Option<BlockPtr>, StoreError>;
+
+    async fn is_healthy(&self, id: &DeploymentHash) -> Result<bool, StoreError>;
+
+    /// Find the deployment locators for the subgraph with the given hash
+    fn locators(&self, hash: &str) -> Result<Vec<DeploymentLocator>, StoreError>;
+}
+
+pub trait ReadStore: Send + Sync + 'static {
+    /// Looks up an entity using the given store key at the latest block.
+    fn get(&self, key: &EntityKey) -> Result<Option<Entity>, StoreError>;
+
+    /// Look up multiple entities as of the latest block. Returns a map of
+    /// entities by type.
+    fn get_many(
+        &self,
+        ids_for_type: BTreeMap<&EntityType, Vec<&str>>,
+    ) -> Result<BTreeMap<EntityType, Vec<Entity>>, StoreError>;
+
+    fn input_schema(&self) -> Arc<Schema>;
+}
+
+// This silly impl is needed until https://github.com/rust-lang/rust/issues/65991 is stable.
+impl<T: ?Sized + ReadStore> ReadStore for Arc<T> {
+    fn get(&self, key: &EntityKey) -> Result<Option<Entity>, StoreError> {
+        (**self).get(key)
+    }
+
+    fn get_many(
+        &self,
+        ids_for_type: BTreeMap<&EntityType, Vec<&str>>,
+    ) -> Result<BTreeMap<EntityType, Vec<Entity>>, StoreError> {
+        (**self).get_many(ids_for_type)
+    }
+
+    fn input_schema(&self) -> Arc<Schema> {
+        (**self).input_schema()
+    }
+}
+
+/// A view of the store for indexing. All indexing-related operations need
+/// to go through this trait. Methods in this trait will never return a
+/// `StoreError::DatabaseUnavailable`. Instead, they will retry the
+/// operation indefinitely until it succeeds.
+#[async_trait]
+pub trait WritableStore: ReadStore {
+    /// Get a pointer to the most recently processed block in the subgraph.
+    fn block_ptr(&self) -> Option<BlockPtr>;
+
+    /// Returns the Firehose `cursor` this deployment is currently at in the block stream of events. This
+    /// is used when re-connecting a Firehose stream to start back exactly where we left off.
+    fn block_cursor(&self) -> FirehoseCursor;
+
+    /// Start an existing subgraph deployment.
+    async fn start_subgraph_deployment(&self, logger: &Logger) -> Result<(), StoreError>;
+
+    /// Revert the entity changes from a single block atomically in the store, and update the
+    /// subgraph block pointer to `block_ptr_to`.
+    ///
+    /// `block_ptr_to` must point to the parent block of the subgraph block pointer.
+    async fn revert_block_operations(
+        &self,
+        block_ptr_to: BlockPtr,
+        firehose_cursor: FirehoseCursor,
+    ) -> Result<(), StoreError>;
+
+    /// If a deterministic error happened, this function reverts the block operations from the
+    /// current block to the previous block.
+    async fn unfail_deterministic_error(
+        &self,
+        current_ptr: &BlockPtr,
+        parent_ptr: &BlockPtr,
+    ) -> Result<UnfailOutcome, StoreError>;
+
+    /// If a non-deterministic error happened and the current deployment head is past the error
+    /// block range, this function unfails the subgraph and deletes the error.
+    fn unfail_non_deterministic_error(
+        &self,
+        current_ptr: &BlockPtr,
+    ) -> Result<UnfailOutcome, StoreError>;
+
+    /// Set subgraph status to failed with the given error as the cause.
+    async fn fail_subgraph(&self, error: SubgraphError) -> Result<(), StoreError>;
+
+    async fn supports_proof_of_indexing(&self) -> Result<bool, StoreError>;
+
+    /// Transact the entity changes from a single block atomically into the store, and update the
+    /// subgraph block pointer to `block_ptr_to`, and update the firehose cursor to `firehose_cursor`
+    ///
+    /// `block_ptr_to` must point to a child block of the current subgraph block pointer.
+    async fn transact_block_operations(
+        &self,
+        block_ptr_to: BlockPtr,
+        firehose_cursor: FirehoseCursor,
+        mods: Vec<EntityModification>,
+        stopwatch: &StopwatchMetrics,
+        data_sources: Vec<StoredDynamicDataSource>,
+        deterministic_errors: Vec<SubgraphError>,
+        manifest_idx_and_name: Vec<(u32, String)>,
+        offchain_to_remove: Vec<StoredDynamicDataSource>,
+    ) -> Result<(), StoreError>;
+
+    /// The deployment `id` finished syncing, mark it as synced in the database
+    /// and promote it to the current version in the subgraphs where it was the
+    /// pending version so far
+    fn deployment_synced(&self) -> Result<(), StoreError>;
+
+    /// Return true if the deployment with the given id is fully synced,
+    /// and return false otherwise. Errors from the store are passed back up
+    async fn is_deployment_synced(&self) -> Result<bool, StoreError>;
+
+    fn unassign_subgraph(&self) -> Result<(), StoreError>;
+
+    /// Load the dynamic data sources for the given deployment
+    async fn load_dynamic_data_sources(
+        &self,
+        manifest_idx_and_name: Vec<(u32, String)>,
+    ) -> Result<Vec<StoredDynamicDataSource>, StoreError>;
+
+    /// Report the name of the shard in which the subgraph is stored. This
+    /// should only be used for reporting and monitoring
+    fn shard(&self) -> &str;
+
+    async fn health(&self) -> Result<SubgraphHealth, StoreError>;
+
+    /// Wait for the background writer to finish processing its queue
+    async fn flush(&self) -> Result<(), StoreError>;
+}
+
+#[async_trait]
+pub trait QueryStoreManager: Send + Sync + 'static {
+    /// Get a new `QueryStore`. A `QueryStore` is tied to a DB replica, so if Graph Node is
+    /// configured to use secondary DB servers the queries will be distributed between servers.
+    ///
+    /// The query store is specific to a deployment, and `id` must indicate
+    /// which deployment will be queried. It is not possible to use the id of the
+    /// metadata subgraph, though the resulting store can be used to query
+    /// metadata about the deployment `id` (but not metadata about other deployments).
+    ///
+    /// If `for_subscription` is true, the main replica will always be used.
+    async fn query_store(
+        &self,
+        target: QueryTarget,
+        for_subscription: bool,
+    ) -> Result<Arc<dyn QueryStore + Send + Sync>, QueryExecutionError>;
+}
+
+pub trait BlockStore: Send + Sync + 'static {
+    type ChainStore: ChainStore;
+
+    fn chain_store(&self, network: &str) -> Option<Arc<Self::ChainStore>>;
+}
+
+/// Common trait for blockchain store implementations.
+#[async_trait]
+pub trait ChainStore: Send + Sync + 'static {
+    /// Get a pointer to this blockchain's genesis block.
+    fn genesis_block_ptr(&self) -> Result<BlockPtr, Error>;
+
+    /// Insert a block into the store (or update if they are already present).
+    async fn upsert_block(&self, block: Arc<dyn Block>) -> Result<(), Error>;
+
+    fn upsert_light_blocks(&self, blocks: &[&dyn Block]) -> Result<(), Error>;
+
+    /// Try to update the head block pointer to the block with the highest block number.
+    ///
+    /// Only updates pointer if there is a block with a higher block number than the current head
+    /// block, and the `ancestor_count` most recent ancestors of that block are in the store.
+    /// Note that this means if the Ethereum node returns a different "latest block" with a
+    /// different hash but same number, we do not update the chain head pointer.
+    /// This situation can happen on e.g. Infura where requests are load balanced across many
+    /// Ethereum nodes, in which case it's better not to continuously revert and reapply the latest
+    /// blocks.
+    ///
+    /// If the pointer was updated, returns `Ok(vec![])`, and fires a HeadUpdateEvent.
+    ///
+    /// If no block has a number higher than the current head block, returns `Ok(vec![])`.
+    ///
+    /// If the candidate new head block had one or more missing ancestors, returns
+    /// `Ok(missing_blocks)`, where `missing_blocks` is a nonexhaustive list of missing blocks.
+    async fn attempt_chain_head_update(
+        self: Arc<Self>,
+        ancestor_count: BlockNumber,
+    ) -> Result<Option<H256>, Error>;
+
+    /// Get the current head block pointer for this chain.
+    /// Any changes to the head block pointer will be to a block with a larger block number, never
+    /// to a block with a smaller or equal block number.
+    ///
+    /// The head block pointer will be None on initial set up.
+    async fn chain_head_ptr(self: Arc<Self>) -> Result<Option<BlockPtr>, Error>;
+
+    /// In-memory time cached version of `chain_head_ptr`.
+    async fn cached_head_ptr(self: Arc<Self>) -> Result<Option<BlockPtr>, Error>;
+
+    /// Get the current head block cursor for this chain.
+    ///
+    /// The head block cursor will be None on initial set up.
+    fn chain_head_cursor(&self) -> Result<Option<String>, Error>;
+
+    /// This method does actually three operations:
+    /// - Upserts received block into blocks table
+    /// - Update chain head block into networks table
+    /// - Update chain head cursor into networks table
+    async fn set_chain_head(
+        self: Arc<Self>,
+        block: Arc<dyn Block>,
+        cursor: String,
+    ) -> Result<(), Error>;
+
+    /// Returns the blocks present in the store.
+    fn blocks(&self, hashes: &[BlockHash]) -> Result<Vec<serde_json::Value>, Error>;
+
+    /// Get the `offset`th ancestor of `block_hash`, where offset=0 means the block matching
+    /// `block_hash` and offset=1 means its parent. Returns None if unable to complete due to
+    /// missing blocks in the chain store.
+    ///
+    /// Returns an error if the offset would reach past the genesis block.
+    async fn ancestor_block(
+        self: Arc<Self>,
+        block_ptr: BlockPtr,
+        offset: BlockNumber,
+    ) -> Result<Option<serde_json::Value>, Error>;
+
+    /// Remove old blocks from the cache we maintain in the database and
+    /// return a pair containing the number of the oldest block retained
+    /// and the number of blocks deleted.
+    /// We will never remove blocks that are within `ancestor_count` of
+    /// the chain head.
+    fn cleanup_cached_blocks(
+        &self,
+        ancestor_count: BlockNumber,
+    ) -> Result<Option<(BlockNumber, usize)>, Error>;
+
+    /// Return the hashes of all blocks with the given number
+    fn block_hashes_by_block_number(&self, number: BlockNumber) -> Result<Vec<BlockHash>, Error>;
+
+    /// Confirm that block number `number` has hash `hash` and that the store
+    /// may purge any other blocks with that number
+    fn confirm_block_hash(&self, number: BlockNumber, hash: &BlockHash) -> Result<usize, Error>;
+
+    /// Find the block with `block_hash` and return the network name, number and timestamp if present.
+    /// Currently, the timestamp is only returned if it's present in the top level block. This format is
+    /// depends on the chain and the implementation of Blockchain::Block for the specific chain.
+    /// eg: {"block": { "timestamp": 123123123 } }
+    async fn block_number(
+        &self,
+        hash: &BlockHash,
+    ) -> Result<Option<(String, BlockNumber, Option<u64>)>, StoreError>;
+
+    /// Tries to retrieve all transactions receipts for a given block.
+    async fn transaction_receipts_in_block(
+        &self,
+        block_ptr: &H256,
+    ) -> Result<Vec<transaction_receipt::LightTransactionReceipt>, StoreError>;
+}
+
+pub trait EthereumCallCache: Send + Sync + 'static {
+    /// Returns the return value of the provided Ethereum call, if present in
+    /// the cache.
+    fn get_call(
+        &self,
+        contract_address: ethabi::Address,
+        encoded_call: &[u8],
+        block: BlockPtr,
+    ) -> Result<Option<Vec<u8>>, Error>;
+
+    /// Returns all cached calls for a given `block`. This method does *not*
+    /// update the last access time of the returned cached calls.
+    fn get_calls_in_block(&self, block: BlockPtr) -> Result<Vec<CachedEthereumCall>, Error>;
+
+    /// Stores the provided Ethereum call in the cache.
+    fn set_call(
+        &self,
+        contract_address: ethabi::Address,
+        encoded_call: &[u8],
+        block: BlockPtr,
+        return_value: &[u8],
+    ) -> Result<(), Error>;
+}
+
+/// Store operations used when serving queries for a specific deployment
+#[async_trait]
+pub trait QueryStore: Send + Sync {
+    fn find_query_values(
+        &self,
+        query: EntityQuery,
+    ) -> Result<(Vec<BTreeMap<Word, r::Value>>, Trace), QueryExecutionError>;
+
+    async fn is_deployment_synced(&self) -> Result<bool, Error>;
+
+    async fn block_ptr(&self) -> Result<Option<BlockPtr>, StoreError>;
+
+    async fn block_number(&self, block_hash: &BlockHash)
+        -> Result<Option<BlockNumber>, StoreError>;
+
+    /// Returns the blocknumber as well as the timestamp. Timestamp depends on the chain block type
+    /// and can have multiple formats, it can also not be prevent. For now this is only available
+    /// for EVM chains both firehose and rpc.
+    async fn block_number_with_timestamp(
+        &self,
+        block_hash: &BlockHash,
+    ) -> Result<Option<(BlockNumber, Option<u64>)>, StoreError>;
+
+    fn wait_stats(&self) -> Result<PoolWaitStats, StoreError>;
+
+    async fn has_deterministic_errors(&self, block: BlockNumber) -> Result<bool, StoreError>;
+
+    /// Find the current state for the subgraph deployment `id` and
+    /// return details about it needed for executing queries
+    async fn deployment_state(&self) -> Result<DeploymentState, QueryExecutionError>;
+
+    fn api_schema(&self) -> Result<Arc<ApiSchema>, QueryExecutionError>;
+
+    fn network_name(&self) -> &str;
+
+    /// A permit should be acquired before starting query execution.
+    async fn query_permit(&self) -> Result<tokio::sync::OwnedSemaphorePermit, StoreError>;
+}
+
+/// A view of the store that can provide information about the indexing status
+/// of any subgraph and any deployment
+#[async_trait]
+pub trait StatusStore: Send + Sync + 'static {
+    /// A permit should be acquired before starting query execution.
+    async fn query_permit(&self) -> Result<tokio::sync::OwnedSemaphorePermit, StoreError>;
+
+    fn status(&self, filter: status::Filter) -> Result<Vec<status::Info>, StoreError>;
+
+    /// Support for the explorer-specific API
+    fn version_info(&self, version_id: &str) -> Result<VersionInfo, StoreError>;
+
+    /// Support for the explorer-specific API; note that `subgraph_id` must be
+    /// the id of an entry in `subgraphs.subgraph`, not that of a deployment.
+    /// The return values are the ids of the `subgraphs.subgraph_version` for
+    /// the current and pending versions of the subgraph
+    fn versions_for_subgraph_id(
+        &self,
+        subgraph_id: &str,
+    ) -> Result<(Option<String>, Option<String>), StoreError>;
+
+    /// Support for the explorer-specific API. Returns a vector of (name, version) of all
+    /// subgraphs for a given deployment hash.
+    fn subgraphs_for_deployment_hash(
+        &self,
+        deployment_hash: &str,
+    ) -> Result<Vec<(String, String)>, StoreError>;
+
+    /// A value of None indicates that the table is not available. Re-deploying
+    /// the subgraph fixes this. It is undesirable to force everything to
+    /// re-sync from scratch, so existing deployments will continue without a
+    /// Proof of Indexing. Once all subgraphs have been re-deployed the Option
+    /// can be removed.
+    async fn get_proof_of_indexing(
+        &self,
+        subgraph_id: &DeploymentHash,
+        indexer: &Option<Address>,
+        block: BlockPtr,
+    ) -> Result<Option<[u8; 32]>, StoreError>;
+
+    /// Like `get_proof_of_indexing` but returns a Proof of Indexing signed by
+    /// address `0x00...0`, which allows it to be shared in public without
+    /// revealing the indexers _real_ Proof of Indexing.
+    async fn get_public_proof_of_indexing(
+        &self,
+        subgraph_id: &DeploymentHash,
+        block_number: BlockNumber,
+    ) -> Result<Option<(PartialBlockPtr, [u8; 32])>, StoreError>;
+}
diff --git a/graph/src/components/subgraph/host.rs b/graph/src/components/subgraph/host.rs
new file mode 100644
index 0000000..27d7d4c
--- /dev/null
+++ b/graph/src/components/subgraph/host.rs
@@ -0,0 +1,172 @@
+use std::cmp::PartialEq;
+use std::sync::Arc;
+use std::time::Instant;
+
+use anyhow::Error;
+use async_trait::async_trait;
+use futures::sync::mpsc;
+
+use crate::components::store::SubgraphFork;
+use crate::data_source::{
+    DataSource, DataSourceTemplate, MappingTrigger, TriggerData, TriggerWithHandler,
+};
+use crate::prelude::*;
+use crate::{blockchain::Blockchain, components::subgraph::SharedProofOfIndexing};
+use crate::{components::metrics::HistogramVec, runtime::DeterministicHostError};
+
+#[derive(Debug)]
+pub enum MappingError {
+    /// A possible reorg was detected while running the mapping.
+    PossibleReorg(anyhow::Error),
+    Unknown(anyhow::Error),
+}
+
+impl From<anyhow::Error> for MappingError {
+    fn from(e: anyhow::Error) -> Self {
+        MappingError::Unknown(e)
+    }
+}
+
+impl From<DeterministicHostError> for MappingError {
+    fn from(value: DeterministicHostError) -> MappingError {
+        MappingError::Unknown(value.inner())
+    }
+}
+
+impl MappingError {
+    pub fn context(self, s: String) -> Self {
+        use MappingError::*;
+        match self {
+            PossibleReorg(e) => PossibleReorg(e.context(s)),
+            Unknown(e) => Unknown(e.context(s)),
+        }
+    }
+}
+
+/// Common trait for runtime host implementations.
+#[async_trait]
+pub trait RuntimeHost<C: Blockchain>: Send + Sync + 'static {
+    fn data_source(&self) -> &DataSource<C>;
+
+    fn match_and_decode(
+        &self,
+        trigger: &TriggerData<C>,
+        block: &Arc<C::Block>,
+        logger: &Logger,
+    ) -> Result<Option<TriggerWithHandler<MappingTrigger<C>>>, Error>;
+
+    async fn process_mapping_trigger(
+        &self,
+        logger: &Logger,
+        block_ptr: BlockPtr,
+        trigger: TriggerWithHandler<MappingTrigger<C>>,
+        state: BlockState<C>,
+        proof_of_indexing: SharedProofOfIndexing,
+        debug_fork: &Option<Arc<dyn SubgraphFork>>,
+    ) -> Result<BlockState<C>, MappingError>;
+
+    /// Block number in which this host was created.
+    /// Returns `None` for static data sources.
+    fn creation_block_number(&self) -> Option<BlockNumber>;
+}
+
+pub struct HostMetrics {
+    handler_execution_time: Box<HistogramVec>,
+    host_fn_execution_time: Box<HistogramVec>,
+    pub stopwatch: StopwatchMetrics,
+}
+
+impl HostMetrics {
+    pub fn new(
+        registry: Arc<dyn MetricsRegistry>,
+        subgraph: &str,
+        stopwatch: StopwatchMetrics,
+    ) -> Self {
+        let handler_execution_time = registry
+            .new_deployment_histogram_vec(
+                "deployment_handler_execution_time",
+                "Measures the execution time for handlers",
+                subgraph,
+                vec![String::from("handler")],
+                vec![0.1, 0.5, 1.0, 10.0, 100.0],
+            )
+            .expect("failed to create `deployment_handler_execution_time` histogram");
+        let host_fn_execution_time = registry
+            .new_deployment_histogram_vec(
+                "deployment_host_fn_execution_time",
+                "Measures the execution time for host functions",
+                subgraph,
+                vec![String::from("host_fn_name")],
+                vec![0.025, 0.05, 0.2, 2.0, 8.0, 20.0],
+            )
+            .expect("failed to create `deployment_host_fn_execution_time` histogram");
+        Self {
+            handler_execution_time,
+            host_fn_execution_time,
+            stopwatch,
+        }
+    }
+
+    pub fn observe_handler_execution_time(&self, duration: f64, handler: &str) {
+        self.handler_execution_time
+            .with_label_values(&[handler][..])
+            .observe(duration);
+    }
+
+    pub fn observe_host_fn_execution_time(&self, duration: f64, fn_name: &str) {
+        self.host_fn_execution_time
+            .with_label_values(&[fn_name][..])
+            .observe(duration);
+    }
+
+    pub fn time_host_fn_execution_region(
+        self: Arc<HostMetrics>,
+        fn_name: &'static str,
+    ) -> HostFnExecutionTimer {
+        HostFnExecutionTimer {
+            start: Instant::now(),
+            metrics: self,
+            fn_name,
+        }
+    }
+}
+
+#[must_use]
+pub struct HostFnExecutionTimer {
+    start: Instant,
+    metrics: Arc<HostMetrics>,
+    fn_name: &'static str,
+}
+
+impl Drop for HostFnExecutionTimer {
+    fn drop(&mut self) {
+        let elapsed = (Instant::now() - self.start).as_secs_f64();
+        self.metrics
+            .observe_host_fn_execution_time(elapsed, self.fn_name)
+    }
+}
+
+pub trait RuntimeHostBuilder<C: Blockchain>: Clone + Send + Sync + 'static {
+    type Host: RuntimeHost<C> + PartialEq;
+    type Req: 'static + Send;
+
+    /// Build a new runtime host for a subgraph data source.
+    fn build(
+        &self,
+        network_name: String,
+        subgraph_id: DeploymentHash,
+        data_source: DataSource<C>,
+        top_level_templates: Arc<Vec<DataSourceTemplate<C>>>,
+        mapping_request_sender: mpsc::Sender<Self::Req>,
+        metrics: Arc<HostMetrics>,
+    ) -> Result<Self::Host, Error>;
+
+    /// Spawn a mapping and return a channel for mapping requests. The sender should be able to be
+    /// cached and shared among mappings that use the same wasm file.
+    fn spawn_mapping(
+        raw_module: &[u8],
+        logger: Logger,
+        subgraph_id: DeploymentHash,
+        metrics: Arc<HostMetrics>,
+    ) -> Result<mpsc::Sender<Self::Req>, anyhow::Error>;
+}
diff --git a/graph/src/components/subgraph/instance.rs b/graph/src/components/subgraph/instance.rs
new file mode 100644
index 0000000..ec35c82
--- /dev/null
+++ b/graph/src/components/subgraph/instance.rs
@@ -0,0 +1,107 @@
+use crate::{
+    blockchain::Blockchain,
+    components::store::{EntityKey, ReadStore, StoredDynamicDataSource},
+    data::subgraph::schema::SubgraphError,
+    data_source::DataSourceTemplate,
+    prelude::*,
+    util::lfu_cache::LfuCache,
+};
+
+#[derive(Clone, Debug)]
+pub struct DataSourceTemplateInfo<C: Blockchain> {
+    pub template: DataSourceTemplate<C>,
+    pub params: Vec<String>,
+    pub context: Option<DataSourceContext>,
+    pub creation_block: BlockNumber,
+}
+
+#[derive(Debug)]
+pub struct BlockState<C: Blockchain> {
+    pub entity_cache: EntityCache,
+    pub deterministic_errors: Vec<SubgraphError>,
+    created_data_sources: Vec<DataSourceTemplateInfo<C>>,
+
+    // Data sources created in the current handler.
+    handler_created_data_sources: Vec<DataSourceTemplateInfo<C>>,
+
+    // offchain data sources to be removed because they've been processed.
+    pub offchain_to_remove: Vec<StoredDynamicDataSource>,
+
+    // Marks whether a handler is currently executing.
+    in_handler: bool,
+}
+
+impl<C: Blockchain> BlockState<C> {
+    pub fn new(store: impl ReadStore, lfu_cache: LfuCache<EntityKey, Option<Entity>>) -> Self {
+        BlockState {
+            entity_cache: EntityCache::with_current(Arc::new(store), lfu_cache),
+            deterministic_errors: Vec::new(),
+            created_data_sources: Vec::new(),
+            handler_created_data_sources: Vec::new(),
+            offchain_to_remove: Vec::new(),
+            in_handler: false,
+        }
+    }
+
+    pub fn extend(&mut self, other: BlockState<C>) {
+        assert!(!other.in_handler);
+
+        let BlockState {
+            entity_cache,
+            deterministic_errors,
+            created_data_sources,
+            handler_created_data_sources,
+            offchain_to_remove,
+            in_handler,
+        } = self;
+
+        match in_handler {
+            true => handler_created_data_sources.extend(other.created_data_sources),
+            false => created_data_sources.extend(other.created_data_sources),
+        }
+        deterministic_errors.extend(other.deterministic_errors);
+        entity_cache.extend(other.entity_cache);
+        offchain_to_remove.extend(other.offchain_to_remove);
+    }
+
+    pub fn has_errors(&self) -> bool {
+        !self.deterministic_errors.is_empty()
+    }
+
+    pub fn has_created_data_sources(&self) -> bool {
+        assert!(!self.in_handler);
+        !self.created_data_sources.is_empty()
+    }
+
+    pub fn drain_created_data_sources(&mut self) -> Vec<DataSourceTemplateInfo<C>> {
+        assert!(!self.in_handler);
+        std::mem::take(&mut self.created_data_sources)
+    }
+
+    pub fn enter_handler(&mut self) {
+        assert!(!self.in_handler);
+        self.in_handler = true;
+        self.entity_cache.enter_handler()
+    }
+
+    pub fn exit_handler(&mut self) {
+        assert!(self.in_handler);
+        self.in_handler = false;
+        self.created_data_sources
+            .append(&mut self.handler_created_data_sources);
+        self.entity_cache.exit_handler()
+    }
+
+    pub fn exit_handler_and_discard_changes_due_to_error(&mut self, e: SubgraphError) {
+        assert!(self.in_handler);
+        self.in_handler = false;
+        self.handler_created_data_sources.clear();
+        self.entity_cache.exit_handler_and_discard_changes();
+        self.deterministic_errors.push(e);
+    }
+
+    pub fn push_created_data_source(&mut self, ds: DataSourceTemplateInfo<C>) {
+        assert!(self.in_handler);
+        self.handler_created_data_sources.push(ds);
+    }
+}
diff --git a/graph/src/components/subgraph/instance_manager.rs b/graph/src/components/subgraph/instance_manager.rs
new file mode 100644
index 0000000..3b1777e
--- /dev/null
+++ b/graph/src/components/subgraph/instance_manager.rs
@@ -0,0 +1,20 @@
+use crate::prelude::BlockNumber;
+use std::sync::Arc;
+
+use crate::components::store::DeploymentLocator;
+
+/// A `SubgraphInstanceManager` loads and manages subgraph instances.
+///
+/// When a subgraph is added, the subgraph instance manager creates and starts
+/// a subgraph instances for the subgraph. When a subgraph is removed, the
+/// subgraph instance manager stops and removes the corresponding instance.
+#[async_trait::async_trait]
+pub trait SubgraphInstanceManager: Send + Sync + 'static {
+    async fn start_subgraph(
+        self: Arc<Self>,
+        deployment: DeploymentLocator,
+        manifest: serde_yaml::Mapping,
+        stop_block: Option<BlockNumber>,
+    );
+    fn stop_subgraph(&self, deployment: DeploymentLocator);
+}
diff --git a/graph/src/components/subgraph/mod.rs b/graph/src/components/subgraph/mod.rs
new file mode 100644
index 0000000..cd930c8
--- /dev/null
+++ b/graph/src/components/subgraph/mod.rs
@@ -0,0 +1,18 @@
+mod host;
+mod instance;
+mod instance_manager;
+mod proof_of_indexing;
+mod provider;
+mod registrar;
+
+pub use crate::prelude::Entity;
+
+pub use self::host::{HostMetrics, MappingError, RuntimeHost, RuntimeHostBuilder};
+pub use self::instance::{BlockState, DataSourceTemplateInfo};
+pub use self::instance_manager::SubgraphInstanceManager;
+pub use self::proof_of_indexing::{
+    CausalityRegion, ProofOfIndexing, ProofOfIndexingEvent, ProofOfIndexingFinisher,
+    ProofOfIndexingVersion, SharedProofOfIndexing,
+};
+pub use self::provider::SubgraphAssignmentProvider;
+pub use self::registrar::{SubgraphRegistrar, SubgraphVersionSwitchingMode};
diff --git a/graph/src/components/subgraph/proof_of_indexing/event.rs b/graph/src/components/subgraph/proof_of_indexing/event.rs
new file mode 100644
index 0000000..06d4e9f
--- /dev/null
+++ b/graph/src/components/subgraph/proof_of_indexing/event.rs
@@ -0,0 +1,148 @@
+use crate::prelude::{impl_slog_value, Value};
+use stable_hash_legacy::StableHasher;
+use std::collections::{BTreeMap, HashMap};
+use std::fmt;
+use strum::AsStaticRef as _;
+use strum_macros::AsStaticStr;
+
+#[derive(AsStaticStr)]
+pub enum ProofOfIndexingEvent<'a> {
+    /// For when an entity is removed from the store.
+    RemoveEntity { entity_type: &'a str, id: &'a str },
+    /// For when an entity is set into the store.
+    SetEntity {
+        entity_type: &'a str,
+        id: &'a str,
+        data: &'a HashMap<String, Value>,
+    },
+    /// For when a deterministic error has happened.
+    ///
+    /// The number of redacted events covers the events previous to this one
+    /// which are no longer transacted to the database. The property that we
+    /// want to maintain is that no two distinct databases share the same PoI.
+    /// Since there is no event for the beginning of a handler the
+    /// non-fatal-errors feature creates an ambiguity without this field. This
+    /// is best illustrated by example. Consider:
+    ///    1. Start handler
+    ///       1. Save Entity A
+    ///    2. Start handler
+    ///       2. Save Entity B
+    ///       3. Save Entity C
+    ///       4. Deterministic Error
+    ///
+    /// The Deterministic Error redacts the effect of 2.1 and 2.2 since entity B
+    /// and C are not saved to the database.
+    ///
+    /// Without the redacted events field, this results in the following event
+    /// stream for the PoI: [Save(A), Save(B), Save(C), DeterministicError]
+    ///
+    /// But, an equivalent PoI would be generated with this sequence of events:
+    ///    1. Start handler
+    ///       1. Save Entity A
+    ///       2. Save Entity B
+    ///    2. Start handler
+    ///       1. Save Entity C
+    ///       2. Deterministic Error
+    ///
+    /// The databases would be different even though the PoI is the same. (The
+    /// first database in [A] and the second is [A, B])
+    ///
+    /// By emitting the number of redacted events we get a different PoI for
+    /// different databases because the PoIs become:
+    ///
+    ///   [Save(A), Save(B), Save(C), DeterministicError(2)]
+    ///
+    ///   [Save(A), Save(B), Save(C), DeterministicError(1)]
+    ///
+    /// for the first and second cases respectively.
+    DeterministicError { redacted_events: u64 },
+}
+
+impl stable_hash_legacy::StableHash for ProofOfIndexingEvent<'_> {
+    fn stable_hash<H: StableHasher>(&self, mut sequence_number: H::Seq, state: &mut H) {
+        use stable_hash_legacy::prelude::*;
+        use ProofOfIndexingEvent::*;
+
+        self.as_static()
+            .stable_hash(sequence_number.next_child(), state);
+        match self {
+            RemoveEntity { entity_type, id } => {
+                entity_type.stable_hash(sequence_number.next_child(), state);
+                id.stable_hash(sequence_number.next_child(), state);
+            }
+            SetEntity {
+                entity_type,
+                id,
+                data,
+            } => {
+                entity_type.stable_hash(sequence_number.next_child(), state);
+                id.stable_hash(sequence_number.next_child(), state);
+                data.stable_hash(sequence_number.next_child(), state);
+            }
+            DeterministicError { redacted_events } => {
+                redacted_events.stable_hash(sequence_number.next_child(), state)
+            }
+        }
+    }
+}
+
+impl stable_hash::StableHash for ProofOfIndexingEvent<'_> {
+    fn stable_hash<H: stable_hash::StableHasher>(&self, field_address: H::Addr, state: &mut H) {
+        use stable_hash::prelude::*;
+
+        let variant = match self {
+            Self::RemoveEntity { entity_type, id } => {
+                entity_type.stable_hash(field_address.child(0), state);
+                id.stable_hash(field_address.child(1), state);
+                1
+            }
+            Self::SetEntity {
+                entity_type,
+                id,
+                data,
+            } => {
+                entity_type.stable_hash(field_address.child(0), state);
+                id.stable_hash(field_address.child(1), state);
+                data.stable_hash(field_address.child(2), state);
+                2
+            }
+            Self::DeterministicError { redacted_events } => {
+                redacted_events.stable_hash(field_address.child(0), state);
+                3
+            }
+        };
+
+        state.write(field_address, &[variant]);
+    }
+}
+
+/// Different than #[derive(Debug)] in order to be deterministic so logs can be
+/// diffed easily. In particular, we swap out the HashMap for a BTreeMap when
+/// printing the data field of the SetEntity variant so that the keys are
+/// sorted.
+impl fmt::Debug for ProofOfIndexingEvent<'_> {
+    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
+        let mut builder = f.debug_struct(self.as_static());
+        match self {
+            Self::RemoveEntity { entity_type, id } => {
+                builder.field("entity_type", entity_type);
+                builder.field("id", id);
+            }
+            Self::SetEntity {
+                entity_type,
+                id,
+                data,
+            } => {
+                builder.field("entity_type", entity_type);
+                builder.field("id", id);
+                builder.field("data", &data.iter().collect::<BTreeMap<_, _>>());
+            }
+            Self::DeterministicError { redacted_events } => {
+                builder.field("redacted_events", redacted_events);
+            }
+        }
+        builder.finish()
+    }
+}
+
+impl_slog_value!(ProofOfIndexingEvent<'_>, "{:?}");
diff --git a/graph/src/components/subgraph/proof_of_indexing/mod.rs b/graph/src/components/subgraph/proof_of_indexing/mod.rs
new file mode 100644
index 0000000..712b84d
--- /dev/null
+++ b/graph/src/components/subgraph/proof_of_indexing/mod.rs
@@ -0,0 +1,318 @@
+mod event;
+mod online;
+mod reference;
+
+pub use event::ProofOfIndexingEvent;
+pub use online::{ProofOfIndexing, ProofOfIndexingFinisher};
+pub use reference::CausalityRegion;
+
+use atomic_refcell::AtomicRefCell;
+use std::sync::Arc;
+
+#[derive(Copy, Clone, Debug)]
+pub enum ProofOfIndexingVersion {
+    Fast,
+    Legacy,
+}
+
+/// This concoction of types is to allow MappingContext to be static, yet still
+/// have shared mutable data for derive_with_empty_block_state. The static
+/// requirement is so that host exports can be static for wasmtime.
+/// AtomicRefCell is chosen over Mutex because concurrent access is
+/// intentionally disallowed - PoI requires sequential access to the hash
+/// function within a given causality region even if ownership is shared across
+/// multiple mapping contexts.
+///
+/// The Option<_> is because not all subgraphs support PoI until re-deployed.
+/// Eventually this can be removed.
+///
+/// This is not a great place to define this type, since the ProofOfIndexing
+/// shouldn't "know" these details about wasmtime and subgraph re-deployments,
+/// but the APIs that would make use of this are in graph/components so this
+/// lives here for lack of a better choice.
+pub type SharedProofOfIndexing = Option<Arc<AtomicRefCell<ProofOfIndexing>>>;
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+    use crate::prelude::{BlockPtr, DeploymentHash, Value};
+    use maplit::hashmap;
+    use online::ProofOfIndexingFinisher;
+    use reference::*;
+    use slog::{o, Discard, Logger};
+    use stable_hash::{fast_stable_hash, utils::check_for_child_errors};
+    use stable_hash_legacy::crypto::SetHasher;
+    use stable_hash_legacy::utils::stable_hash as stable_hash_legacy;
+    use std::collections::HashMap;
+    use std::convert::TryInto;
+    use web3::types::{Address, H256};
+
+    /// Verify that the stable hash of a reference and online implementation match
+    fn check(case: Case, cache: &mut HashMap<String, &str>) {
+        let logger = Logger::root(Discard, o!());
+
+        // Does a sanity check to ensure that the schema itself is correct,
+        // which is separate to verifying that the online/offline version
+        // return the same result.
+        check_for_child_errors(&case.data).expect("Found child errors");
+
+        let offline_fast = tiny_keccak::keccak256(&fast_stable_hash(&case.data).to_le_bytes());
+        let offline_legacy = stable_hash_legacy::<SetHasher, _>(&case.data);
+
+        for (version, offline, hardcoded) in [
+            (ProofOfIndexingVersion::Legacy, offline_legacy, case.legacy),
+            (ProofOfIndexingVersion::Fast, offline_fast, case.fast),
+        ] {
+            // The code is meant to approximate what happens during indexing as
+            // close as possible. The API for the online PoI is meant to be
+            // pretty foolproof so that the actual usage will also match.
+
+            // Create a database which stores intermediate PoIs
+            let mut db = HashMap::<String, Vec<u8>>::new();
+
+            let mut block_count = 1;
+            for causality_region in case.data.causality_regions.values() {
+                block_count = causality_region.blocks.len();
+                break;
+            }
+
+            for block_i in 0..block_count {
+                let mut stream = ProofOfIndexing::new(block_i.try_into().unwrap(), version);
+
+                for (name, region) in case.data.causality_regions.iter() {
+                    let block = &region.blocks[block_i];
+
+                    for evt in block.events.iter() {
+                        stream.write(&logger, name, evt);
+                    }
+                }
+
+                for (name, region) in stream.take() {
+                    let prev = db.get(&name);
+                    let update = region.pause(prev.map(|v| &v[..]));
+                    db.insert(name, update);
+                }
+            }
+
+            let block_number = (block_count - 1) as u64;
+            let block_ptr = BlockPtr::from((case.data.block_hash, block_number));
+
+            // This region emulates the request
+            let mut finisher = ProofOfIndexingFinisher::new(
+                &block_ptr,
+                &case.data.subgraph_id,
+                &case.data.indexer,
+                version,
+            );
+            for (name, region) in db.iter() {
+                finisher.add_causality_region(name, region);
+            }
+
+            let online = hex::encode(finisher.finish());
+            let offline = hex::encode(&offline);
+            assert_eq!(&online, &offline);
+            assert_eq!(&online, hardcoded);
+
+            if let Some(prev) = cache.insert(offline, case.name) {
+                panic!("Found conflict for case: {} == {}", case.name, prev);
+            }
+        }
+    }
+
+    struct Case<'a> {
+        name: &'static str,
+        legacy: &'static str,
+        fast: &'static str,
+        data: PoI<'a>,
+    }
+
+    /// This test checks that each case resolves to a unique hash, and that
+    /// in each case the reference and online versions match
+    #[test]
+    fn online_vs_reference() {
+        let data = hashmap! {
+            "val".to_owned() => Value::Int(1)
+        };
+        let data_empty = hashmap! {};
+        let data2 = hashmap! {
+            "key".to_owned() => Value::String("s".to_owned()),
+            "null".to_owned() => Value::Null,
+        };
+
+        let mut cases = vec![
+            // Simple case of basically nothing
+            Case {
+                name: "genesis",
+                legacy: "401e5bef572bc3a56b0ced0eb6cb4619d2ca748db6af8855828d16ff3446cfdd",
+                fast: "dced49c45eac68e8b3d8f857928e7be6c270f2db8b56b0d7f27ce725100bae01",
+                data: PoI {
+                    subgraph_id: DeploymentHash::new("test").unwrap(),
+                    block_hash: H256::repeat_byte(1),
+                    causality_regions: HashMap::new(),
+                    indexer: None,
+                },
+            },
+            // Add an event
+            Case {
+                name: "one_event",
+                legacy: "9241634bfc8a9a12c796a0de6f326326a74967cd477ee7ce78fbac20a9e9c303",
+                fast: "bb3c37659d4bc799b9dcf3d17b1b1e93847f5fc0b2c50ee6a27f13b5c07f7e97",
+                data: PoI {
+                    subgraph_id: DeploymentHash::new("test").unwrap(),
+                    block_hash: H256::repeat_byte(1),
+                    causality_regions: hashmap! {
+                        "eth".to_owned() => CausalityRegion {
+                            blocks: vec! [
+                                Block::default(),
+                                Block {
+                                    events: vec![
+                                        ProofOfIndexingEvent::SetEntity {
+                                            entity_type: "t",
+                                            id: "id",
+                                            data: &data_empty,
+                                        }
+                                    ]
+                                }
+                            ],
+                        },
+                    },
+                    indexer: Some(Address::repeat_byte(1)),
+                },
+            },
+            // Try adding a couple more blocks, including an empty block on the end
+            Case {
+                name: "multiple_blocks",
+                legacy: "775fa30bbaef2a8659456a317923a36f46e3715e6c9cf43203dd3486af4e361f",
+                fast: "3bb882049e8f4a11cd4a7a005c6ce3b3c779a0e90057a9556c595660e626268d",
+                data: PoI {
+                    subgraph_id: DeploymentHash::new("b").unwrap(),
+                    block_hash: H256::repeat_byte(3),
+                    causality_regions: hashmap! {
+                        "eth".to_owned() => CausalityRegion {
+                            blocks: vec! [
+                                Block::default(),
+                                Block {
+                                    events: vec![
+                                        ProofOfIndexingEvent::SetEntity {
+                                            entity_type: "type",
+                                            id: "id",
+                                            data: &data,
+                                        }
+                                    ]
+                                },
+                                Block::default(),
+                                Block {
+                                    events: vec![
+                                        ProofOfIndexingEvent::SetEntity {
+                                            entity_type: "type",
+                                            id: "id",
+                                            data: &data_empty,
+                                        }
+                                    ]
+                                },
+                                Block::default(),
+                            ],
+                        },
+                    },
+                    indexer: Some(Address::repeat_byte(1)),
+                },
+            },
+            // Try adding another causality region
+            Case {
+                name: "causality_regions",
+                legacy: "13e6fd2b581911c80d935d4f098b40ef3d87cbc564b5a635c81b06091a381e54",
+                fast: "b2cb70acd4a1337a67df810fe4c5c2fb3d3a3b2b8eb137dbb592bd6014869362",
+                data: PoI {
+                    subgraph_id: DeploymentHash::new("b").unwrap(),
+                    block_hash: H256::repeat_byte(3),
+                    causality_regions: hashmap! {
+                        "eth".to_owned() => CausalityRegion {
+                            blocks: vec! [
+                                Block::default(),
+                                Block {
+                                    events: vec![
+                                        ProofOfIndexingEvent::SetEntity {
+                                            entity_type: "type",
+                                            id: "id",
+                                            data: &data2,
+                                        }
+                                    ]
+                                },
+                                Block::default(),
+                                Block {
+                                    events: vec![
+                                        ProofOfIndexingEvent::RemoveEntity {
+                                            entity_type: "type",
+                                            id: "id",
+                                        }
+                                    ]
+                                },
+                                Block::default(),
+                            ],
+                        },
+                        "ipfs".to_owned() => CausalityRegion {
+                            blocks: vec! [
+                                Block::default(),
+                                Block {
+                                    events: vec![
+                                        ProofOfIndexingEvent::SetEntity {
+                                            entity_type: "type",
+                                            id: "id",
+                                            data: &data,
+                                        }
+                                    ]
+                                },
+                                Block::default(),
+                                Block {
+                                    events: vec![
+                                        ProofOfIndexingEvent::SetEntity {
+                                            entity_type: "type",
+                                            id: "id",
+                                            data: &data,
+                                        }
+                                    ]
+                                },
+                                Block::default(),
+                            ],
+                        },
+                    },
+                    indexer: Some(Address::repeat_byte(1)),
+                },
+            },
+            // Back to the one event case, but try adding some data.
+            Case {
+                name: "data",
+                legacy: "cd3020511cf4c88dd2be542aca4f95bb2a67b06e29f444bcdf44009933b8ff31",
+                fast: "a992ba24702615a3f591014f7351acf85a35b75e1f8646fc8d77509c4b5d31ed",
+                data: PoI {
+                    subgraph_id: DeploymentHash::new("test").unwrap(),
+                    block_hash: H256::repeat_byte(1),
+                    causality_regions: hashmap! {
+                        "eth".to_owned() => CausalityRegion {
+                            blocks: vec! [
+                                Block::default(),
+                                Block {
+                                    events: vec![
+                                        ProofOfIndexingEvent::SetEntity {
+                                            entity_type: "type",
+                                            id: "id",
+                                            data: &data,
+                                        }
+                                    ]
+                                }
+                            ],
+                        },
+                    },
+                    indexer: Some(Address::repeat_byte(4)),
+                },
+            },
+        ];
+
+        // Lots of data up there ⬆️ to test. Finally, loop over each case, comparing the reference and
+        // online version, then checking that there are no conflicts for the reference versions.
+        let mut results = HashMap::new();
+        for case in cases.drain(..) {
+            check(case, &mut results);
+        }
+    }
+}
diff --git a/graph/src/components/subgraph/proof_of_indexing/online.rs b/graph/src/components/subgraph/proof_of_indexing/online.rs
new file mode 100644
index 0000000..013f2a8
--- /dev/null
+++ b/graph/src/components/subgraph/proof_of_indexing/online.rs
@@ -0,0 +1,316 @@
+//! This is an online (streaming) implementation of the reference implementation
+//! Any hash constructed from here should be the same as if the same data was given
+//! to the reference implementation, but this is updated incrementally
+
+use super::{ProofOfIndexingEvent, ProofOfIndexingVersion};
+use crate::{
+    blockchain::BlockPtr,
+    prelude::{debug, BlockNumber, DeploymentHash, Logger, ENV_VARS},
+    util::stable_hash_glue::AsBytes,
+};
+use stable_hash::{fast::FastStableHasher, FieldAddress, StableHash, StableHasher};
+use stable_hash_legacy::crypto::{Blake3SeqNo, SetHasher};
+use stable_hash_legacy::prelude::{
+    StableHash as StableHashLegacy, StableHasher as StableHasherLegacy, *,
+};
+use std::collections::HashMap;
+use std::convert::TryInto;
+use std::fmt;
+use web3::types::Address;
+
+pub struct BlockEventStream {
+    vec_length: u64,
+    handler_start: u64,
+    block_index: u64,
+    hasher: Hashers,
+}
+
+enum Hashers {
+    Fast(FastStableHasher),
+    Legacy(SetHasher),
+}
+
+impl Hashers {
+    fn new(version: ProofOfIndexingVersion) -> Self {
+        match version {
+            ProofOfIndexingVersion::Legacy => Hashers::Legacy(SetHasher::new()),
+            ProofOfIndexingVersion::Fast => Hashers::Fast(FastStableHasher::new()),
+        }
+    }
+
+    fn from_bytes(bytes: &[u8]) -> Self {
+        match bytes.try_into() {
+            Ok(bytes) => Hashers::Fast(FastStableHasher::from_bytes(bytes)),
+            Err(_) => Hashers::Legacy(SetHasher::from_bytes(bytes)),
+        }
+    }
+
+    fn write<T>(&mut self, value: &T, children: &[u64])
+    where
+        T: StableHash + StableHashLegacy,
+    {
+        match self {
+            Hashers::Fast(fast) => {
+                let addr = children.iter().fold(u128::root(), |s, i| s.child(*i));
+                StableHash::stable_hash(value, addr, fast);
+            }
+            Hashers::Legacy(legacy) => {
+                let seq_no = traverse_seq_no(children);
+                StableHashLegacy::stable_hash(value, seq_no, legacy);
+            }
+        }
+    }
+}
+
+/// Go directly to a SequenceNumber identifying a field within a struct.
+/// This is best understood by example. Consider the struct:
+///
+/// struct Outer {
+///    inners: Vec<Inner>,
+///    outer_num: i32
+/// }
+/// struct Inner {
+///    inner_num: i32,
+///    inner_str: String,
+/// }
+///
+/// Let's say that we have the following data:
+/// Outer {
+///    inners: vec![
+///       Inner {
+///           inner_num: 10,
+///           inner_str: "THIS",
+///       },
+///    ],
+///    outer_num: 0,
+/// }
+///
+/// And we need to identify the string "THIS", at outer.inners[0].inner_str;
+/// This would require the following:
+/// traverse_seq_no(&[
+///    0, // Outer.inners
+///    0, // Vec<Inner>[0]
+///    1, // Inner.inner_str
+///])
+// Performance: Could write a specialized function for this, avoiding a bunch of clones of Blake3SeqNo
+fn traverse_seq_no(counts: &[u64]) -> Blake3SeqNo {
+    counts.iter().fold(Blake3SeqNo::root(), |mut s, i| {
+        s.skip(*i as usize);
+        s.next_child()
+    })
+}
+
+impl BlockEventStream {
+    fn new(block_number: BlockNumber, version: ProofOfIndexingVersion) -> Self {
+        let block_index: u64 = block_number.try_into().unwrap();
+
+        Self {
+            vec_length: 0,
+            handler_start: 0,
+            block_index,
+            hasher: Hashers::new(version),
+        }
+    }
+
+    /// Finishes the current block and returns the serialized hash function to
+    /// be resumed later. Cases in which the hash function is resumed include
+    /// when asking for the final PoI, or when combining with the next modified
+    /// block via the argument `prev`
+    pub fn pause(mut self, prev: Option<&[u8]>) -> Vec<u8> {
+        self.hasher
+            .write(&self.vec_length, &[1, 0, self.block_index, 0]);
+        match self.hasher {
+            Hashers::Legacy(mut digest) => {
+                if let Some(prev) = prev {
+                    let prev = SetHasher::from_bytes(prev);
+                    // SequenceNumber::root() is misleading here since the parameter
+                    // is unused.
+                    digest.finish_unordered(prev, SequenceNumber::root());
+                }
+                digest.to_bytes()
+            }
+            Hashers::Fast(mut digest) => {
+                if let Some(prev) = prev {
+                    let prev = prev
+                        .try_into()
+                        .expect("Expected valid fast stable hash representation");
+                    let prev = FastStableHasher::from_bytes(prev);
+                    digest.mixin(&prev);
+                }
+                digest.to_bytes().to_vec()
+            }
+        }
+    }
+
+    fn write(&mut self, event: &ProofOfIndexingEvent<'_>) {
+        let children = &[
+            1,                // kvp -> v
+            0,                // CausalityRegion.blocks: Vec<Block>
+            self.block_index, // Vec<Block> -> [i]
+            0,                // Block.events -> Vec<ProofOfIndexingEvent>
+            self.vec_length,
+        ];
+        self.hasher.write(&event, children);
+        self.vec_length += 1;
+    }
+
+    fn start_handler(&mut self) {
+        self.handler_start = self.vec_length;
+    }
+}
+
+pub struct ProofOfIndexing {
+    version: ProofOfIndexingVersion,
+    block_number: BlockNumber,
+    /// The POI is updated for each data source independently. This is necessary because
+    /// some data sources (eg: IPFS files) may be unreliable and therefore cannot mix
+    /// state with other data sources. This may also give us some freedom to change
+    /// the order of triggers in the future.
+    per_causality_region: HashMap<String, BlockEventStream>,
+}
+
+impl fmt::Debug for ProofOfIndexing {
+    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
+        f.debug_tuple("ProofOfIndexing").field(&"...").finish()
+    }
+}
+
+impl ProofOfIndexing {
+    pub fn new(block_number: BlockNumber, version: ProofOfIndexingVersion) -> Self {
+        Self {
+            version,
+            block_number,
+            per_causality_region: HashMap::new(),
+        }
+    }
+}
+
+impl ProofOfIndexing {
+    pub fn write_deterministic_error(&mut self, logger: &Logger, causality_region: &str) {
+        let redacted_events = self.with_causality_region(causality_region, |entry| {
+            entry.vec_length - entry.handler_start
+        });
+
+        self.write(
+            logger,
+            causality_region,
+            &ProofOfIndexingEvent::DeterministicError { redacted_events },
+        )
+    }
+
+    /// Adds an event to the digest of the ProofOfIndexingStream local to the causality region
+    pub fn write(
+        &mut self,
+        logger: &Logger,
+        causality_region: &str,
+        event: &ProofOfIndexingEvent<'_>,
+    ) {
+        if ENV_VARS.log_poi_events {
+            debug!(
+                logger,
+                "Proof of indexing event";
+                "event" => &event,
+                "causality_region" => causality_region
+            );
+        }
+
+        self.with_causality_region(causality_region, |entry| entry.write(event))
+    }
+
+    pub fn start_handler(&mut self, causality_region: &str) {
+        self.with_causality_region(causality_region, |entry| entry.start_handler())
+    }
+
+    // This is just here because the raw_entry API is not stabilized.
+    fn with_causality_region<F, T>(&mut self, causality_region: &str, f: F) -> T
+    where
+        F: FnOnce(&mut BlockEventStream) -> T,
+    {
+        if let Some(causality_region) = self.per_causality_region.get_mut(causality_region) {
+            f(causality_region)
+        } else {
+            let mut entry = BlockEventStream::new(self.block_number, self.version);
+            let result = f(&mut entry);
+            self.per_causality_region
+                .insert(causality_region.to_owned(), entry);
+            result
+        }
+    }
+
+    pub fn take(self) -> HashMap<String, BlockEventStream> {
+        self.per_causality_region
+    }
+}
+
+pub struct ProofOfIndexingFinisher {
+    block_number: BlockNumber,
+    state: Hashers,
+    causality_count: usize,
+}
+
+impl ProofOfIndexingFinisher {
+    pub fn new(
+        block: &BlockPtr,
+        subgraph_id: &DeploymentHash,
+        indexer: &Option<Address>,
+        version: ProofOfIndexingVersion,
+    ) -> Self {
+        let mut state = Hashers::new(version);
+
+        // Add PoI.subgraph_id
+        state.write(&subgraph_id, &[1]);
+
+        // Add PoI.block_hash
+        state.write(&AsBytes(block.hash_slice()), &[2]);
+
+        // Add PoI.indexer
+        state.write(&indexer.as_ref().map(|i| AsBytes(i.as_bytes())), &[3]);
+
+        ProofOfIndexingFinisher {
+            block_number: block.number,
+            state,
+            causality_count: 0,
+        }
+    }
+
+    pub fn add_causality_region(&mut self, name: &str, region: &[u8]) {
+        let mut state = Hashers::from_bytes(region);
+
+        // Finish the blocks vec by writing kvp[v], CausalityRegion.blocks.len()
+        // + 1 is to account that the length of the blocks array for the genesis block is 1, not 0.
+        state.write(&(self.block_number + 1), &[1, 0]);
+
+        // Add the name (kvp[k]).
+        state.write(&name, &[0]);
+
+        // Mixin the region into PoI.causality_regions.
+        match state {
+            Hashers::Legacy(legacy) => {
+                let state = legacy.finish();
+                self.state.write(&AsBytes(&state), &[0, 1]);
+            }
+            Hashers::Fast(fast) => {
+                let state = fast.to_bytes();
+                self.state.write(&AsBytes(&state), &[0]);
+            }
+        }
+
+        self.causality_count += 1;
+    }
+
+    pub fn finish(mut self) -> [u8; 32] {
+        if let Hashers::Legacy(_) = self.state {
+            // Add PoI.causality_regions.len()
+            // Note that technically to get the same sequence number one would need
+            // to call causality_regions_count_seq_no.skip(self.causality_count);
+            // but it turns out that the result happens to be the same for
+            // non-negative numbers.
+            self.state.write(&self.causality_count, &[0, 2]);
+        }
+
+        match self.state {
+            Hashers::Legacy(legacy) => legacy.finish(),
+            Hashers::Fast(fast) => tiny_keccak::keccak256(&fast.finish().to_le_bytes()),
+        }
+    }
+}
diff --git a/graph/src/components/subgraph/proof_of_indexing/reference.rs b/graph/src/components/subgraph/proof_of_indexing/reference.rs
new file mode 100644
index 0000000..63d9703
--- /dev/null
+++ b/graph/src/components/subgraph/proof_of_indexing/reference.rs
@@ -0,0 +1,51 @@
+use super::ProofOfIndexingEvent;
+use crate::prelude::DeploymentHash;
+use crate::util::stable_hash_glue::{impl_stable_hash, AsBytes};
+use std::collections::HashMap;
+use web3::types::{Address, H256};
+
+/// The PoI is the StableHash of this struct. This reference implementation is
+/// mostly here just to make sure that the online implementation is
+/// well-implemented (without conflicting sequence numbers, or other oddities).
+/// It's just way easier to check that this works, and serves as a kind of
+/// documentation as a side-benefit.
+pub struct PoI<'a> {
+    pub causality_regions: HashMap<String, CausalityRegion<'a>>,
+    pub subgraph_id: DeploymentHash,
+    pub block_hash: H256,
+    pub indexer: Option<Address>,
+}
+
+fn h256_as_bytes(val: &H256) -> AsBytes<&[u8]> {
+    AsBytes(val.as_bytes())
+}
+
+fn indexer_opt_as_bytes(val: &Option<Address>) -> Option<AsBytes<&[u8]>> {
+    val.as_ref().map(|v| AsBytes(v.as_bytes()))
+}
+
+impl_stable_hash!(PoI<'_> {
+    causality_regions,
+    subgraph_id,
+    block_hash: h256_as_bytes,
+    indexer: indexer_opt_as_bytes
+});
+
+pub struct CausalityRegion<'a> {
+    pub blocks: Vec<Block<'a>>,
+}
+
+impl_stable_hash!(CausalityRegion<'_> {blocks});
+
+impl CausalityRegion<'_> {
+    pub fn from_network(network: &str) -> String {
+        format!("ethereum/{}", network)
+    }
+}
+
+#[derive(Default)]
+pub struct Block<'a> {
+    pub events: Vec<ProofOfIndexingEvent<'a>>,
+}
+
+impl_stable_hash!(Block<'_> {events});
diff --git a/graph/src/components/subgraph/provider.rs b/graph/src/components/subgraph/provider.rs
new file mode 100644
index 0000000..5edc223
--- /dev/null
+++ b/graph/src/components/subgraph/provider.rs
@@ -0,0 +1,17 @@
+use async_trait::async_trait;
+
+use crate::{components::store::DeploymentLocator, prelude::*};
+
+/// Common trait for subgraph providers.
+#[async_trait]
+pub trait SubgraphAssignmentProvider: Send + Sync + 'static {
+    async fn start(
+        &self,
+        deployment: DeploymentLocator,
+        stop_block: Option<BlockNumber>,
+    ) -> Result<(), SubgraphAssignmentProviderError>;
+    async fn stop(
+        &self,
+        deployment: DeploymentLocator,
+    ) -> Result<(), SubgraphAssignmentProviderError>;
+}
diff --git a/graph/src/components/subgraph/registrar.rs b/graph/src/components/subgraph/registrar.rs
new file mode 100644
index 0000000..cfb2c2f
--- /dev/null
+++ b/graph/src/components/subgraph/registrar.rs
@@ -0,0 +1,56 @@
+use std::str::FromStr;
+
+use async_trait::async_trait;
+
+use crate::{components::store::DeploymentLocator, prelude::*};
+
+#[derive(Clone, Copy, Debug)]
+pub enum SubgraphVersionSwitchingMode {
+    Instant,
+    Synced,
+}
+
+impl SubgraphVersionSwitchingMode {
+    pub fn parse(mode: &str) -> Self {
+        Self::from_str(mode).unwrap()
+    }
+}
+
+impl FromStr for SubgraphVersionSwitchingMode {
+    type Err = String;
+
+    fn from_str(s: &str) -> Result<Self, Self::Err> {
+        match s.to_ascii_lowercase().as_str() {
+            "instant" => Ok(SubgraphVersionSwitchingMode::Instant),
+            "synced" => Ok(SubgraphVersionSwitchingMode::Synced),
+            _ => Err(format!("invalid version switching mode: {:?}", s)),
+        }
+    }
+}
+
+/// Common trait for subgraph registrars.
+#[async_trait]
+pub trait SubgraphRegistrar: Send + Sync + 'static {
+    async fn create_subgraph(
+        &self,
+        name: SubgraphName,
+    ) -> Result<CreateSubgraphResult, SubgraphRegistrarError>;
+
+    async fn create_subgraph_version(
+        &self,
+        name: SubgraphName,
+        hash: DeploymentHash,
+        assignment_node_id: NodeId,
+        debug_fork: Option<DeploymentHash>,
+        start_block_block: Option<BlockPtr>,
+        graft_block_override: Option<BlockPtr>,
+    ) -> Result<DeploymentLocator, SubgraphRegistrarError>;
+
+    async fn remove_subgraph(&self, name: SubgraphName) -> Result<(), SubgraphRegistrarError>;
+
+    async fn reassign_subgraph(
+        &self,
+        hash: &DeploymentHash,
+        node_id: &NodeId,
+    ) -> Result<(), SubgraphRegistrarError>;
+}
diff --git a/graph/src/components/transaction_receipt.rs b/graph/src/components/transaction_receipt.rs
new file mode 100644
index 0000000..30b2bb2
--- /dev/null
+++ b/graph/src/components/transaction_receipt.rs
@@ -0,0 +1,39 @@
+//! Code for retrieving transaction receipts from the database.
+//!
+//! This module exposes the [`LightTransactionReceipt`] type, which holds basic information about
+//! the retrieved transaction receipts.
+
+use web3::types::{TransactionReceipt, H256, U256, U64};
+
+/// Like web3::types::Receipt, but with fewer fields.
+#[derive(Debug, PartialEq)]
+pub struct LightTransactionReceipt {
+    pub transaction_hash: H256,
+    pub transaction_index: U64,
+    pub block_hash: Option<H256>,
+    pub block_number: Option<U64>,
+    pub gas_used: Option<U256>,
+    pub status: Option<U64>,
+}
+
+impl From<TransactionReceipt> for LightTransactionReceipt {
+    fn from(receipt: TransactionReceipt) -> Self {
+        let TransactionReceipt {
+            transaction_hash,
+            transaction_index,
+            block_hash,
+            block_number,
+            gas_used,
+            status,
+            ..
+        } = receipt;
+        LightTransactionReceipt {
+            transaction_hash,
+            transaction_index,
+            block_hash,
+            block_number,
+            gas_used,
+            status,
+        }
+    }
+}
diff --git a/graph/src/components/trigger_processor.rs b/graph/src/components/trigger_processor.rs
new file mode 100644
index 0000000..ce02a21
--- /dev/null
+++ b/graph/src/components/trigger_processor.rs
@@ -0,0 +1,31 @@
+use std::sync::Arc;
+
+use async_trait::async_trait;
+use slog::Logger;
+
+use crate::{blockchain::Blockchain, data_source::TriggerData, prelude::SubgraphInstanceMetrics};
+
+use super::{
+    store::SubgraphFork,
+    subgraph::{BlockState, MappingError, RuntimeHostBuilder, SharedProofOfIndexing},
+};
+
+#[async_trait]
+pub trait TriggerProcessor<C, T>: Sync + Send
+where
+    C: Blockchain,
+    T: RuntimeHostBuilder<C>,
+{
+    async fn process_trigger(
+        &self,
+        logger: &Logger,
+        hosts: &[Arc<T::Host>],
+        block: &Arc<C::Block>,
+        trigger: &TriggerData<C>,
+        mut state: BlockState<C>,
+        proof_of_indexing: &SharedProofOfIndexing,
+        causality_region: &str,
+        debug_fork: &Option<Arc<dyn SubgraphFork>>,
+        subgraph_metrics: &Arc<SubgraphInstanceMetrics>,
+    ) -> Result<BlockState<C>, MappingError>;
+}
diff --git a/graph/src/components/versions/features.rs b/graph/src/components/versions/features.rs
new file mode 100644
index 0000000..5d3b377
--- /dev/null
+++ b/graph/src/components/versions/features.rs
@@ -0,0 +1,2 @@
+#[derive(Clone, PartialEq, Eq, Debug, Ord, PartialOrd, Hash)]
+pub enum FeatureFlag {}
diff --git a/graph/src/components/versions/mod.rs b/graph/src/components/versions/mod.rs
new file mode 100644
index 0000000..675e12e
--- /dev/null
+++ b/graph/src/components/versions/mod.rs
@@ -0,0 +1,5 @@
+mod features;
+mod registry;
+
+pub use features::FeatureFlag;
+pub use registry::{ApiVersion, VERSIONS};
diff --git a/graph/src/components/versions/registry.rs b/graph/src/components/versions/registry.rs
new file mode 100644
index 0000000..d365e90
--- /dev/null
+++ b/graph/src/components/versions/registry.rs
@@ -0,0 +1,71 @@
+use crate::prelude::FeatureFlag;
+use itertools::Itertools;
+use lazy_static::lazy_static;
+use semver::{Version, VersionReq};
+use std::collections::HashMap;
+
+lazy_static! {
+    static ref VERSION_COLLECTION: HashMap<Version, Vec<FeatureFlag>> = {
+        vec![
+            // baseline version
+            (Version::new(1, 0, 0), vec![]),
+        ].into_iter().collect()
+    };
+
+    // Sorted vector of versions. From higher to lower.
+    pub static ref VERSIONS: Vec<&'static Version> = {
+        let mut versions = VERSION_COLLECTION.keys().collect_vec().clone();
+        versions.sort_by(|a, b| b.partial_cmp(a).unwrap());
+        versions
+    };
+}
+
+#[derive(Clone, Debug, PartialEq, Eq, PartialOrd, Ord, Hash)]
+pub struct ApiVersion {
+    pub version: Version,
+    features: Vec<FeatureFlag>,
+}
+
+impl ApiVersion {
+    pub fn new(version_requirement: &VersionReq) -> Result<Self, String> {
+        let version = Self::resolve(&version_requirement)?;
+
+        Ok(Self {
+            version: version.clone(),
+            features: VERSION_COLLECTION
+                .get(&version)
+                .expect(format!("Version {:?} is not supported", version).as_str())
+                .to_vec(),
+        })
+    }
+
+    pub fn from_version(version: &Version) -> Result<ApiVersion, String> {
+        ApiVersion::new(
+            &VersionReq::parse(version.to_string().as_str())
+                .map_err(|error| format!("Invalid version requirement: {}", error))?,
+        )
+    }
+
+    pub fn supports(&self, feature: FeatureFlag) -> bool {
+        self.features.contains(&feature)
+    }
+
+    fn resolve(version_requirement: &VersionReq) -> Result<&Version, String> {
+        for version in VERSIONS.iter() {
+            if version_requirement.matches(version) {
+                return Ok(version.clone());
+            }
+        }
+
+        Err("Could not resolve the version".to_string())
+    }
+}
+
+impl Default for ApiVersion {
+    fn default() -> Self {
+        // Default to the latest version.
+        // The `VersionReq::default()` returns `*` which means "any version".
+        // The first matching version is the latest version.
+        ApiVersion::new(&VersionReq::default()).unwrap()
+    }
+}
diff --git a/graph/src/data/graphql/effort.rs b/graph/src/data/graphql/effort.rs
new file mode 100644
index 0000000..23753a2
--- /dev/null
+++ b/graph/src/data/graphql/effort.rs
@@ -0,0 +1,504 @@
+//! Utilities to keep moving statistics about queries
+
+use prometheus::core::GenericCounter;
+use rand::{prelude::Rng, thread_rng};
+use std::collections::{HashMap, HashSet};
+use std::iter::FromIterator;
+use std::sync::{Arc, RwLock};
+use std::time::{Duration, Instant};
+
+use crate::components::metrics::{Counter, Gauge, MetricsRegistry};
+use crate::components::store::PoolWaitStats;
+use crate::data::graphql::shape_hash::shape_hash;
+use crate::data::query::{CacheStatus, QueryExecutionError};
+use crate::prelude::q;
+use crate::prelude::{async_trait, debug, info, o, warn, Logger, QueryLoadManager, ENV_VARS};
+use crate::util::stats::MovingStats;
+
+struct QueryEffort {
+    inner: Arc<RwLock<QueryEffortInner>>,
+}
+
+/// Track the effort for queries (identified by their ShapeHash) over a
+/// time window.
+struct QueryEffortInner {
+    window_size: Duration,
+    bin_size: Duration,
+    effort: HashMap<u64, MovingStats>,
+    total: MovingStats,
+}
+
+/// Create a `QueryEffort` that uses the window and bin sizes configured in
+/// the environment
+impl Default for QueryEffort {
+    fn default() -> Self {
+        Self::new(ENV_VARS.load_window_size, ENV_VARS.load_bin_size)
+    }
+}
+
+impl QueryEffort {
+    pub fn new(window_size: Duration, bin_size: Duration) -> Self {
+        Self {
+            inner: Arc::new(RwLock::new(QueryEffortInner::new(window_size, bin_size))),
+        }
+    }
+
+    pub fn add(&self, shape_hash: u64, duration: Duration, gauge: &Gauge) {
+        let mut inner = self.inner.write().unwrap();
+        inner.add(shape_hash, duration);
+        gauge.set(inner.total.average().unwrap_or(Duration::ZERO).as_millis() as f64);
+    }
+
+    /// Return what we know right now about the effort for the query
+    /// `shape_hash`, and about the total effort. If we have no measurements
+    /// at all, return `ZERO_DURATION` as the total effort. If we have no
+    /// data for the particular query, return `None` as the effort
+    /// for the query
+    pub fn current_effort(&self, shape_hash: u64) -> (Option<Duration>, Duration) {
+        let inner = self.inner.read().unwrap();
+        let total_effort = inner.total.duration();
+        let query_effort = inner.effort.get(&shape_hash).map(|stats| stats.duration());
+        (query_effort, total_effort)
+    }
+}
+
+impl QueryEffortInner {
+    fn new(window_size: Duration, bin_size: Duration) -> Self {
+        Self {
+            window_size,
+            bin_size,
+            effort: HashMap::default(),
+            total: MovingStats::new(window_size, bin_size),
+        }
+    }
+
+    fn add(&mut self, shape_hash: u64, duration: Duration) {
+        let window_size = self.window_size;
+        let bin_size = self.bin_size;
+        let now = Instant::now();
+        self.effort
+            .entry(shape_hash)
+            .or_insert_with(|| MovingStats::new(window_size, bin_size))
+            .add_at(now, duration);
+        self.total.add_at(now, duration);
+    }
+}
+
+/// What to log about the state we are currently in
+enum KillStateLogEvent {
+    /// Overload is starting right now
+    Start,
+    /// Overload has been going on for the duration
+    Ongoing(Duration),
+    /// No longer overloaded, reducing the kill_rate
+    Settling,
+    /// Overload was resolved after duration time
+    Resolved(Duration),
+    /// Don't log anything right now
+    Skip,
+}
+
+struct KillState {
+    // A value between 0 and 1, where 0 means 'respond to all queries'
+    // and 1 means 'do not respond to any queries'
+    kill_rate: f64,
+    // We adjust the `kill_rate` at most every `KILL_RATE_UPDATE_INTERVAL`
+    last_update: Instant,
+    // When the current overload situation started
+    overload_start: Option<Instant>,
+    // Throttle logging while we are overloaded to no more often than
+    // once every 30s
+    last_overload_log: Instant,
+}
+
+impl KillState {
+    fn new() -> Self {
+        // Set before to an instant long enough ago so that we don't
+        // immediately log or adjust the kill rate if the node is already
+        // under load. Unfortunately, on OSX, `Instant` measures time from
+        // the last boot, and if that was less than 60s ago, we can't
+        // subtract 60s from `now`. Since the worst that can happen if
+        // we set `before` to `now` is that we might log more than strictly
+        // necessary, and adjust the kill rate one time too often right after
+        // node start, it is acceptable to fall back to `now`
+        let before = {
+            let long_ago = Duration::from_secs(60);
+            let now = Instant::now();
+            now.checked_sub(long_ago).unwrap_or(now)
+        };
+        Self {
+            kill_rate: 0.0,
+            last_update: before,
+            overload_start: None,
+            last_overload_log: before,
+        }
+    }
+
+    fn log_event(&mut self, now: Instant, kill_rate: f64, overloaded: bool) -> KillStateLogEvent {
+        use KillStateLogEvent::*;
+
+        if let Some(overload_start) = self.overload_start {
+            if !overloaded {
+                if kill_rate == 0.0 {
+                    self.overload_start = None;
+                    Resolved(overload_start.elapsed())
+                } else {
+                    Settling
+                }
+            } else if now.saturating_duration_since(self.last_overload_log)
+                > Duration::from_secs(30)
+            {
+                self.last_overload_log = now;
+                Ongoing(overload_start.elapsed())
+            } else {
+                Skip
+            }
+        } else if overloaded {
+            self.overload_start = Some(now);
+            self.last_overload_log = now;
+            Start
+        } else {
+            Skip
+        }
+    }
+}
+
+/// Indicate what the load manager wants query execution to do with a query
+#[derive(Debug, Clone, Copy)]
+pub enum Decision {
+    /// Proceed with executing the query
+    Proceed,
+    /// The query is too expensive and should not be executed
+    TooExpensive,
+    /// The service is overloaded, and we should not execute the query
+    /// right now
+    Throttle,
+}
+
+impl Decision {
+    pub fn to_result(self) -> Result<(), QueryExecutionError> {
+        use Decision::*;
+        match self {
+            Proceed => Ok(()),
+            TooExpensive => Err(QueryExecutionError::TooExpensive),
+            Throttle => Err(QueryExecutionError::Throttled),
+        }
+    }
+}
+
+pub struct LoadManager {
+    logger: Logger,
+    effort: QueryEffort,
+    /// List of query shapes that have been statically blocked through
+    /// configuration
+    blocked_queries: HashSet<u64>,
+    /// List of query shapes that have caused more than `JAIL_THRESHOLD`
+    /// proportion of the work while the system was overloaded. Currently,
+    /// there is no way for a query to get out of jail other than
+    /// restarting the process
+    jailed_queries: RwLock<HashSet<u64>>,
+    kill_state: RwLock<KillState>,
+    effort_gauge: Box<Gauge>,
+    query_counters: HashMap<CacheStatus, Counter>,
+    kill_rate_gauge: Box<Gauge>,
+}
+
+impl LoadManager {
+    pub fn new(
+        logger: &Logger,
+        blocked_queries: Vec<Arc<q::Document>>,
+        registry: Arc<dyn MetricsRegistry>,
+    ) -> Self {
+        let logger = logger.new(o!("component" => "LoadManager"));
+        let blocked_queries = blocked_queries
+            .into_iter()
+            .map(|doc| shape_hash(&doc))
+            .collect::<HashSet<_>>();
+
+        let mode = if ENV_VARS.load_management_is_disabled() {
+            "disabled"
+        } else if ENV_VARS.load_simulate {
+            "simulation"
+        } else {
+            "enabled"
+        };
+        info!(logger, "Creating LoadManager in {} mode", mode,);
+
+        let effort_gauge = registry
+            .new_gauge(
+                "query_effort_ms",
+                "Moving average of time spent running queries",
+                HashMap::new(),
+            )
+            .expect("failed to create `query_effort_ms` counter");
+        let kill_rate_gauge = registry
+            .new_gauge(
+                "query_kill_rate",
+                "The rate at which the load manager kills queries",
+                HashMap::new(),
+            )
+            .expect("failed to create `query_kill_rate` counter");
+        let query_counters = CacheStatus::iter()
+            .map(|s| {
+                let labels = HashMap::from_iter(vec![("cache_status".to_owned(), s.to_string())]);
+                let counter = registry
+                    .global_counter(
+                        "query_cache_status_count",
+                        "Count toplevel GraphQL fields executed and their cache status",
+                        labels,
+                    )
+                    .expect("Failed to register query_counter metric");
+                (*s, counter)
+            })
+            .collect::<HashMap<_, _>>();
+
+        Self {
+            logger,
+            effort: QueryEffort::default(),
+            blocked_queries,
+            jailed_queries: RwLock::new(HashSet::new()),
+            kill_state: RwLock::new(KillState::new()),
+            effort_gauge,
+            query_counters,
+            kill_rate_gauge,
+        }
+    }
+
+    /// Record that we spent `duration` amount of work for the query
+    /// `shape_hash`, where `cache_status` indicates whether the query
+    /// was cached or had to actually run
+    pub fn record_work(&self, shape_hash: u64, duration: Duration, cache_status: CacheStatus) {
+        self.query_counters
+            .get(&cache_status)
+            .map(GenericCounter::inc);
+        if !ENV_VARS.load_management_is_disabled() {
+            self.effort.add(shape_hash, duration, &self.effort_gauge);
+        }
+    }
+
+    /// Decide whether we should decline to run the query with this
+    /// `ShapeHash`. This is the heart of reacting to overload situations.
+    ///
+    /// The decision to decline a query is geared towards mitigating two
+    /// different ways in which the system comes under high load:
+    /// 1) A relatively small number of queries causes a large fraction
+    ///    of the overall work that goes into responding to queries. That
+    ///    is usually inadvertent, and the result of a dApp using a new query,
+    ///    or the data for a subgraph changing in a way that makes a query
+    ///    that was previously fast take a long time
+    /// 2) A large number of queries that by themselves are reasonably fast
+    ///    cause so much work that the system gets bogged down. When none
+    ///    of them by themselves is expensive, it becomes impossible to
+    ///    name a culprit for an overload, and we therefore shed
+    ///    increasing amounts of traffic by declining to run queries
+    ///    in proportion to the work they cause
+    ///
+    /// Note that any mitigation for (2) is prone to flip-flopping in and
+    /// out of overload situations, as we will oscillate  between being
+    /// overloaded and not being overloaded, though we'd expect the amount
+    /// of traffic we shed to settle on something that stays close to the
+    /// point where we alternate between the two states.
+    ///
+    /// We detect whether we are in an overloaded situation by looking at
+    /// the average wait time for connection checkouts. If that exceeds
+    /// [`ENV_VARS.load_threshold`], we consider ourselves to be in an overload
+    /// situation.
+    ///
+    /// There are several criteria that will lead to us declining to run
+    /// a query with a certain `ShapeHash`:
+    /// 1) If the query is one of the configured `blocked_queries`, we will
+    ///    always decline
+    /// 2) If a query, during an overload situation, causes more than
+    ///    `JAIL_THRESHOLD` fraction of the total query effort, we will
+    ///    refuse to run this query again for the lifetime of the process
+    /// 3) During an overload situation, we step a `kill_rate` from 0 to 1,
+    ///    roughly in steps of `KILL_RATE_STEP`, though with an eye towards
+    ///    not hitting a `kill_rate` of 1 too soon. We will decline to run
+    ///    queries randomly with a probability of
+    ///    kill_rate * query_effort / total_effort
+    ///
+    /// If [`ENV_VARS.load_threshold`] is set to 0, we bypass all this logic,
+    /// and only ever decline to run statically configured queries (1). In that
+    /// case, we also do not take any locks when asked to update statistics,
+    /// or to check whether we are overloaded; these operations amount to
+    /// noops.
+    pub fn decide(&self, wait_stats: &PoolWaitStats, shape_hash: u64, query: &str) -> Decision {
+        use Decision::*;
+
+        if self.blocked_queries.contains(&shape_hash) {
+            return TooExpensive;
+        }
+        if ENV_VARS.load_management_is_disabled() {
+            return Proceed;
+        }
+
+        if self.jailed_queries.read().unwrap().contains(&shape_hash) {
+            return if ENV_VARS.load_simulate {
+                Proceed
+            } else {
+                TooExpensive
+            };
+        }
+
+        let (overloaded, wait_ms) = self.overloaded(wait_stats);
+        let (kill_rate, last_update) = self.kill_state();
+        if !overloaded && kill_rate == 0.0 {
+            return Proceed;
+        }
+
+        let (query_effort, total_effort) = self.effort.current_effort(shape_hash);
+        // When `total_effort` is `Duratino::ZERO`, we haven't done any work. All are
+        // welcome
+        if total_effort.is_zero() {
+            return Proceed;
+        }
+
+        // If `query_effort` is `None`, we haven't seen the query. Since we
+        // are in an overload situation, we are very suspicious of new things
+        // and assume the worst. This ensures that even if we only ever see
+        // new queries, we drop `kill_rate` amount of traffic
+        let known_query = query_effort.is_some();
+        let query_effort = query_effort.unwrap_or(total_effort).as_millis() as f64;
+        let total_effort = total_effort.as_millis() as f64;
+
+        // When this variable is not set, we never jail any queries.
+        if let Some(jail_threshold) = ENV_VARS.load_jail_threshold {
+            if known_query && query_effort / total_effort > jail_threshold {
+                // Any single query that causes at least JAIL_THRESHOLD of the
+                // effort in an overload situation gets killed
+                warn!(self.logger, "Jailing query";
+                "query" => query,
+                "wait_ms" => wait_ms.as_millis(),
+                "query_effort_ms" => query_effort,
+                "total_effort_ms" => total_effort,
+                "ratio" => format!("{:.4}", query_effort/total_effort));
+                self.jailed_queries.write().unwrap().insert(shape_hash);
+                return if ENV_VARS.load_simulate {
+                    Proceed
+                } else {
+                    TooExpensive
+                };
+            }
+        }
+
+        // Kill random queries in case we have no queries, or not enough queries
+        // that cause at least 20% of the effort
+        let kill_rate = self.update_kill_rate(kill_rate, last_update, overloaded, wait_ms);
+        let decline =
+            thread_rng().gen_bool((kill_rate * query_effort / total_effort).min(1.0).max(0.0));
+        if decline {
+            if ENV_VARS.load_simulate {
+                debug!(self.logger, "Declining query";
+                    "query" => query,
+                    "wait_ms" => wait_ms.as_millis(),
+                    "query_weight" => format!("{:.2}", query_effort / total_effort),
+                    "kill_rate" => format!("{:.4}", kill_rate),
+                );
+                return Proceed;
+            } else {
+                return Throttle;
+            }
+        }
+        Proceed
+    }
+
+    fn overloaded(&self, wait_stats: &PoolWaitStats) -> (bool, Duration) {
+        let store_avg = wait_stats.read().unwrap().average();
+        let overloaded = store_avg
+            .map(|average| average > ENV_VARS.load_threshold)
+            .unwrap_or(false);
+        (overloaded, store_avg.unwrap_or(Duration::ZERO))
+    }
+
+    fn kill_state(&self) -> (f64, Instant) {
+        let state = self.kill_state.read().unwrap();
+        (state.kill_rate, state.last_update)
+    }
+
+    fn update_kill_rate(
+        &self,
+        mut kill_rate: f64,
+        last_update: Instant,
+        overloaded: bool,
+        wait_ms: Duration,
+    ) -> f64 {
+        // The rates by which we increase and decrease the `kill_rate`; when
+        // we increase the `kill_rate`, we do that in a way so that we do drop
+        // fewer queries as the `kill_rate` approaches 1.0. After `n`
+        // consecutive steps of increasing the `kill_rate`, it will
+        // be `1 - (1-KILL_RATE_STEP_UP)^n`
+        //
+        // When we step down, we do that in fixed size steps to move away from
+        // dropping queries fairly quickly so that after `n` steps of reducing
+        // the `kill_rate`, it is at most `1 - n * KILL_RATE_STEP_DOWN`
+        //
+        // The idea behind this is that we want to be conservative when we drop
+        // queries, but aggressive when we reduce the amount of queries we drop
+        // to disrupt traffic for as little as possible.
+        const KILL_RATE_STEP_UP: f64 = 0.1;
+        const KILL_RATE_STEP_DOWN: f64 = 2.0 * KILL_RATE_STEP_UP;
+        const KILL_RATE_UPDATE_INTERVAL: Duration = Duration::from_millis(1000);
+
+        assert!(overloaded || kill_rate > 0.0);
+
+        let now = Instant::now();
+        if now.saturating_duration_since(last_update) > KILL_RATE_UPDATE_INTERVAL {
+            // Update the kill_rate
+            if overloaded {
+                kill_rate = (kill_rate + KILL_RATE_STEP_UP * (1.0 - kill_rate)).min(1.0);
+            } else {
+                kill_rate = (kill_rate - KILL_RATE_STEP_DOWN).max(0.0);
+            }
+            let event = {
+                let mut state = self.kill_state.write().unwrap();
+                state.kill_rate = kill_rate;
+                state.last_update = now;
+                state.log_event(now, kill_rate, overloaded)
+            };
+            // Log information about what's happening after we've released the
+            // lock on self.kill_state
+            use KillStateLogEvent::*;
+            match event {
+                Settling => {
+                    info!(self.logger, "Query overload improving";
+                        "wait_ms" => wait_ms.as_millis(),
+                        "kill_rate" => format!("{:.4}", kill_rate),
+                        "event" => "settling");
+                }
+                Resolved(duration) => {
+                    info!(self.logger, "Query overload resolved";
+                        "duration_ms" => duration.as_millis(),
+                        "wait_ms" => wait_ms.as_millis(),
+                        "event" => "resolved");
+                }
+                Ongoing(duration) => {
+                    info!(self.logger, "Query overload still happening";
+                        "duration_ms" => duration.as_millis(),
+                        "wait_ms" => wait_ms.as_millis(),
+                        "kill_rate" => format!("{:.4}", kill_rate),
+                        "event" => "ongoing");
+                }
+                Start => {
+                    warn!(self.logger, "Query overload";
+                    "wait_ms" => wait_ms.as_millis(),
+                    "event" => "start");
+                }
+                Skip => { /* do nothing */ }
+            }
+        }
+        self.kill_rate_gauge.set(kill_rate);
+        kill_rate
+    }
+}
+
+#[async_trait]
+impl QueryLoadManager for LoadManager {
+    fn record_work(&self, shape_hash: u64, duration: Duration, cache_status: CacheStatus) {
+        self.query_counters
+            .get(&cache_status)
+            .map(|counter| counter.inc());
+        if !ENV_VARS.load_management_is_disabled() {
+            self.effort.add(shape_hash, duration, &self.effort_gauge);
+        }
+    }
+}
diff --git a/graph/src/data/graphql/ext.rs b/graph/src/data/graphql/ext.rs
new file mode 100644
index 0000000..c25cdbc
--- /dev/null
+++ b/graph/src/data/graphql/ext.rs
@@ -0,0 +1,444 @@
+use super::ObjectOrInterface;
+use crate::data::schema::{META_FIELD_TYPE, SCHEMA_TYPE_NAME};
+use crate::prelude::s::{
+    Definition, Directive, Document, EnumType, Field, InterfaceType, ObjectType, Type,
+    TypeDefinition, Value,
+};
+use crate::prelude::ENV_VARS;
+use std::collections::{BTreeMap, HashMap};
+
+pub trait ObjectTypeExt {
+    fn field(&self, name: &str) -> Option<&Field>;
+    fn is_meta(&self) -> bool;
+    fn is_immutable(&self) -> bool;
+}
+
+impl ObjectTypeExt for ObjectType {
+    fn field(&self, name: &str) -> Option<&Field> {
+        self.fields.iter().find(|field| field.name == name)
+    }
+
+    fn is_meta(&self) -> bool {
+        self.name == META_FIELD_TYPE
+    }
+
+    fn is_immutable(&self) -> bool {
+        self.find_directive("entity")
+            .and_then(|dir| dir.argument("immutable"))
+            .map(|value| match value {
+                Value::Boolean(b) => *b,
+                _ => false,
+            })
+            .unwrap_or(false)
+    }
+}
+
+impl ObjectTypeExt for InterfaceType {
+    fn field(&self, name: &str) -> Option<&Field> {
+        self.fields.iter().find(|field| field.name == name)
+    }
+
+    fn is_meta(&self) -> bool {
+        false
+    }
+
+    fn is_immutable(&self) -> bool {
+        false
+    }
+}
+
+pub trait DocumentExt {
+    fn get_object_type_definitions(&self) -> Vec<&ObjectType>;
+
+    fn get_interface_type_definitions(&self) -> Vec<&InterfaceType>;
+
+    fn get_object_type_definition(&self, name: &str) -> Option<&ObjectType>;
+
+    fn get_object_and_interface_type_fields(&self) -> HashMap<&str, &Vec<Field>>;
+
+    fn get_enum_definitions(&self) -> Vec<&EnumType>;
+
+    fn find_interface(&self, name: &str) -> Option<&InterfaceType>;
+
+    fn get_fulltext_directives(&self) -> Result<Vec<&Directive>, anyhow::Error>;
+
+    fn get_root_query_type(&self) -> Option<&ObjectType>;
+
+    fn get_root_subscription_type(&self) -> Option<&ObjectType>;
+
+    fn object_or_interface(&self, name: &str) -> Option<ObjectOrInterface<'_>>;
+
+    fn get_named_type(&self, name: &str) -> Option<&TypeDefinition>;
+
+    /// Return `true` if the type does not allow selection of child fields.
+    ///
+    /// # Panics
+    ///
+    /// If `field_type` names an unknown type
+    fn is_leaf_type(&self, field_type: &Type) -> bool;
+}
+
+impl DocumentExt for Document {
+    /// Returns all object type definitions in the schema.
+    fn get_object_type_definitions(&self) -> Vec<&ObjectType> {
+        self.definitions
+            .iter()
+            .filter_map(|d| match d {
+                Definition::TypeDefinition(TypeDefinition::Object(t)) => Some(t),
+                _ => None,
+            })
+            .collect()
+    }
+
+    /// Returns all interface definitions in the schema.
+    fn get_interface_type_definitions(&self) -> Vec<&InterfaceType> {
+        self.definitions
+            .iter()
+            .filter_map(|d| match d {
+                Definition::TypeDefinition(TypeDefinition::Interface(t)) => Some(t),
+                _ => None,
+            })
+            .collect()
+    }
+
+    fn get_object_type_definition(&self, name: &str) -> Option<&ObjectType> {
+        self.get_object_type_definitions()
+            .into_iter()
+            .find(|object_type| object_type.name.eq(name))
+    }
+
+    fn get_object_and_interface_type_fields(&self) -> HashMap<&str, &Vec<Field>> {
+        self.definitions
+            .iter()
+            .filter_map(|d| match d {
+                Definition::TypeDefinition(TypeDefinition::Object(t)) => {
+                    Some((t.name.as_str(), &t.fields))
+                }
+                Definition::TypeDefinition(TypeDefinition::Interface(t)) => {
+                    Some((&t.name, &t.fields))
+                }
+                _ => None,
+            })
+            .collect()
+    }
+
+    fn get_enum_definitions(&self) -> Vec<&EnumType> {
+        self.definitions
+            .iter()
+            .filter_map(|d| match d {
+                Definition::TypeDefinition(TypeDefinition::Enum(e)) => Some(e),
+                _ => None,
+            })
+            .collect()
+    }
+
+    fn find_interface(&self, name: &str) -> Option<&InterfaceType> {
+        self.definitions.iter().find_map(|d| match d {
+            Definition::TypeDefinition(TypeDefinition::Interface(t)) if t.name == name => Some(t),
+            _ => None,
+        })
+    }
+
+    fn get_fulltext_directives(&self) -> Result<Vec<&Directive>, anyhow::Error> {
+        let directives = self.get_object_type_definition(SCHEMA_TYPE_NAME).map_or(
+            vec![],
+            |subgraph_schema_type| {
+                subgraph_schema_type
+                    .directives
+                    .iter()
+                    .filter(|directives| directives.name.eq("fulltext"))
+                    .collect()
+            },
+        );
+        if !ENV_VARS.allow_non_deterministic_fulltext_search && !directives.is_empty() {
+            Err(anyhow::anyhow!("Fulltext search is not yet deterministic"))
+        } else {
+            Ok(directives)
+        }
+    }
+
+    /// Returns the root query type (if there is one).
+    fn get_root_query_type(&self) -> Option<&ObjectType> {
+        self.definitions
+            .iter()
+            .filter_map(|d| match d {
+                Definition::TypeDefinition(TypeDefinition::Object(t)) if t.name == "Query" => {
+                    Some(t)
+                }
+                _ => None,
+            })
+            .peekable()
+            .next()
+    }
+
+    fn get_root_subscription_type(&self) -> Option<&ObjectType> {
+        self.definitions
+            .iter()
+            .filter_map(|d| match d {
+                Definition::TypeDefinition(TypeDefinition::Object(t))
+                    if t.name == "Subscription" =>
+                {
+                    Some(t)
+                }
+                _ => None,
+            })
+            .peekable()
+            .next()
+    }
+
+    fn object_or_interface(&self, name: &str) -> Option<ObjectOrInterface<'_>> {
+        match self.get_named_type(name) {
+            Some(TypeDefinition::Object(t)) => Some(t.into()),
+            Some(TypeDefinition::Interface(t)) => Some(t.into()),
+            _ => None,
+        }
+    }
+
+    fn get_named_type(&self, name: &str) -> Option<&TypeDefinition> {
+        self.definitions
+            .iter()
+            .filter_map(|def| match def {
+                Definition::TypeDefinition(typedef) => Some(typedef),
+                _ => None,
+            })
+            .find(|typedef| match typedef {
+                TypeDefinition::Object(t) => t.name == name,
+                TypeDefinition::Enum(t) => t.name == name,
+                TypeDefinition::InputObject(t) => t.name == name,
+                TypeDefinition::Interface(t) => t.name == name,
+                TypeDefinition::Scalar(t) => t.name == name,
+                TypeDefinition::Union(t) => t.name == name,
+            })
+    }
+
+    fn is_leaf_type(&self, field_type: &Type) -> bool {
+        match self
+            .get_named_type(field_type.get_base_type())
+            .expect("names of field types have been validated")
+        {
+            TypeDefinition::Enum(_) | TypeDefinition::Scalar(_) => true,
+            TypeDefinition::Object(_)
+            | TypeDefinition::Interface(_)
+            | TypeDefinition::Union(_)
+            | TypeDefinition::InputObject(_) => false,
+        }
+    }
+}
+
+pub trait TypeExt {
+    fn get_base_type(&self) -> &str;
+    fn is_list(&self) -> bool;
+    fn is_non_null(&self) -> bool;
+}
+
+impl TypeExt for Type {
+    fn get_base_type(&self) -> &str {
+        match self {
+            Type::NamedType(name) => name,
+            Type::NonNullType(inner) => Self::get_base_type(inner),
+            Type::ListType(inner) => Self::get_base_type(inner),
+        }
+    }
+
+    fn is_list(&self) -> bool {
+        match self {
+            Type::NamedType(_) => false,
+            Type::NonNullType(inner) => inner.is_list(),
+            Type::ListType(_) => true,
+        }
+    }
+
+    // Returns true if the given type is a non-null type.
+    fn is_non_null(&self) -> bool {
+        match self {
+            Type::NonNullType(_) => true,
+            _ => false,
+        }
+    }
+}
+
+pub trait DirectiveExt {
+    fn argument(&self, name: &str) -> Option<&Value>;
+}
+
+impl DirectiveExt for Directive {
+    fn argument(&self, name: &str) -> Option<&Value> {
+        self.arguments
+            .iter()
+            .find(|(key, _value)| key == name)
+            .map(|(_argument, value)| value)
+    }
+}
+
+pub trait ValueExt {
+    fn as_object(&self) -> Option<&BTreeMap<String, Value>>;
+    fn as_list(&self) -> Option<&Vec<Value>>;
+    fn as_str(&self) -> Option<&str>;
+    fn as_enum(&self) -> Option<&str>;
+}
+
+impl ValueExt for Value {
+    fn as_object(&self) -> Option<&BTreeMap<String, Value>> {
+        match self {
+            Value::Object(object) => Some(object),
+            _ => None,
+        }
+    }
+
+    fn as_list(&self) -> Option<&Vec<Value>> {
+        match self {
+            Value::List(list) => Some(list),
+            _ => None,
+        }
+    }
+
+    fn as_str(&self) -> Option<&str> {
+        match self {
+            Value::String(string) => Some(string),
+            _ => None,
+        }
+    }
+
+    fn as_enum(&self) -> Option<&str> {
+        match self {
+            Value::Enum(e) => Some(e),
+            _ => None,
+        }
+    }
+}
+
+pub trait DirectiveFinder {
+    fn find_directive(&self, name: &str) -> Option<&Directive>;
+    fn is_derived(&self) -> bool;
+}
+
+impl DirectiveFinder for ObjectType {
+    fn find_directive(&self, name: &str) -> Option<&Directive> {
+        self.directives
+            .iter()
+            .find(|directive| directive.name.eq(&name))
+    }
+
+    fn is_derived(&self) -> bool {
+        let is_derived = |directive: &Directive| directive.name.eq("derivedFrom");
+
+        self.directives.iter().any(is_derived)
+    }
+}
+
+impl DirectiveFinder for Field {
+    fn find_directive(&self, name: &str) -> Option<&Directive> {
+        self.directives
+            .iter()
+            .find(|directive| directive.name.eq(name))
+    }
+
+    fn is_derived(&self) -> bool {
+        let is_derived = |directive: &Directive| directive.name.eq("derivedFrom");
+
+        self.directives.iter().any(is_derived)
+    }
+}
+
+impl DirectiveFinder for Vec<Directive> {
+    fn find_directive(&self, name: &str) -> Option<&Directive> {
+        self.iter().find(|directive| directive.name.eq(&name))
+    }
+
+    fn is_derived(&self) -> bool {
+        let is_derived = |directive: &Directive| directive.name.eq("derivedFrom");
+
+        self.iter().any(is_derived)
+    }
+}
+
+pub trait TypeDefinitionExt {
+    fn name(&self) -> &str;
+
+    // Return `true` if this is the definition of a type from the
+    // introspection schema
+    fn is_introspection(&self) -> bool {
+        self.name().starts_with("__")
+    }
+}
+
+impl TypeDefinitionExt for TypeDefinition {
+    fn name(&self) -> &str {
+        match self {
+            TypeDefinition::Scalar(t) => &t.name,
+            TypeDefinition::Object(t) => &t.name,
+            TypeDefinition::Interface(t) => &t.name,
+            TypeDefinition::Union(t) => &t.name,
+            TypeDefinition::Enum(t) => &t.name,
+            TypeDefinition::InputObject(t) => &t.name,
+        }
+    }
+}
+
+pub trait FieldExt {
+    // Return `true` if this is the name of one of the query fields from the
+    // introspection schema
+    fn is_introspection(&self) -> bool;
+}
+
+impl FieldExt for Field {
+    fn is_introspection(&self) -> bool {
+        &self.name == "__schema" || &self.name == "__type"
+    }
+}
+
+#[cfg(test)]
+mod directive_finder_tests {
+    use graphql_parser::parse_schema;
+
+    use super::*;
+
+    const SCHEMA: &str = "
+    type BuyEvent implements Event @derivedFrom(field: \"buyEvent\") {
+        id: ID!,
+        transaction: Transaction! @derivedFrom(field: \"buyEvent\")
+    }";
+
+    /// Makes sure that the DirectiveFinder::find_directive implementation for ObjectiveType and Field works
+    #[test]
+    fn find_directive_impls() {
+        let ast = parse_schema::<String>(SCHEMA).unwrap();
+        let object_types = ast.get_object_type_definitions();
+        assert_eq!(object_types.len(), 1);
+        let object_type = object_types[0];
+
+        // The object type BuyEvent has a @derivedFrom directive
+        assert!(object_type.find_directive("derivedFrom").is_some());
+
+        // BuyEvent has no deprecated directive
+        assert!(object_type.find_directive("deprecated").is_none());
+
+        let fields = &object_type.fields;
+        assert_eq!(fields.len(), 2);
+
+        // Field 1 `id` is not derived
+        assert!(fields[0].find_directive("derivedFrom").is_none());
+        // Field 2 `transaction` is derived
+        assert!(fields[1].find_directive("derivedFrom").is_some());
+    }
+
+    /// Makes sure that the DirectiveFinder::is_derived implementation for ObjectiveType and Field works
+    #[test]
+    fn is_derived_impls() {
+        let ast = parse_schema::<String>(SCHEMA).unwrap();
+        let object_types = ast.get_object_type_definitions();
+        assert_eq!(object_types.len(), 1);
+        let object_type = object_types[0];
+
+        // The object type BuyEvent is derived
+        assert!(object_type.is_derived());
+
+        let fields = &object_type.fields;
+        assert_eq!(fields.len(), 2);
+
+        // Field 1 `id` is not derived
+        assert!(!fields[0].is_derived());
+        // Field 2 `transaction` is derived
+        assert!(fields[1].is_derived());
+    }
+}
diff --git a/graph/src/data/graphql/mod.rs b/graph/src/data/graphql/mod.rs
new file mode 100644
index 0000000..b41df57
--- /dev/null
+++ b/graph/src/data/graphql/mod.rs
@@ -0,0 +1,33 @@
+mod serialization;
+
+/// Traits to navigate the GraphQL AST
+pub mod ext;
+pub use ext::{DirectiveExt, DocumentExt, ObjectTypeExt, TypeExt, ValueExt};
+
+/// Utilities for working with GraphQL values.
+mod values;
+
+/// Serializable wrapper around a GraphQL value.
+pub use self::serialization::SerializableValue;
+
+pub use self::values::{
+    // Trait for converting from GraphQL values into other types.
+    TryFromValue,
+
+    // Trait for plucking typed values from a GraphQL list.
+    ValueList,
+
+    // Trait for plucking typed values out of a GraphQL value maps.
+    ValueMap,
+};
+
+pub mod shape_hash;
+
+pub mod effort;
+
+pub mod object_or_interface;
+pub use object_or_interface::ObjectOrInterface;
+
+pub mod object_macro;
+pub use crate::object;
+pub use object_macro::{object_value, IntoValue};
diff --git a/graph/src/data/graphql/object_macro.rs b/graph/src/data/graphql/object_macro.rs
new file mode 100644
index 0000000..8af3bbc
--- /dev/null
+++ b/graph/src/data/graphql/object_macro.rs
@@ -0,0 +1,116 @@
+use crate::data::value::Object;
+use crate::prelude::q;
+use crate::prelude::r;
+use std::iter::FromIterator;
+
+/// Creates a `graphql_parser::query::Value::Object` from key/value pairs.
+/// If you don't need to determine which keys are included dynamically at runtime
+/// consider using the `object! {}` macro instead.
+pub fn object_value(data: Vec<(&str, r::Value)>) -> r::Value {
+    r::Value::Object(Object::from_iter(
+        data.into_iter().map(|(k, v)| (k.to_string(), v)),
+    ))
+}
+
+pub trait IntoValue {
+    fn into_value(self) -> r::Value;
+}
+
+impl IntoValue for r::Value {
+    #[inline]
+    fn into_value(self) -> r::Value {
+        self
+    }
+}
+
+impl IntoValue for &'_ str {
+    #[inline]
+    fn into_value(self) -> r::Value {
+        self.to_owned().into_value()
+    }
+}
+
+impl IntoValue for i32 {
+    #[inline]
+    fn into_value(self) -> r::Value {
+        r::Value::Int(self as i64)
+    }
+}
+
+impl IntoValue for q::Number {
+    #[inline]
+    fn into_value(self) -> r::Value {
+        r::Value::Int(self.as_i64().unwrap())
+    }
+}
+
+impl IntoValue for u64 {
+    #[inline]
+    fn into_value(self) -> r::Value {
+        r::Value::String(self.to_string())
+    }
+}
+
+impl<T: IntoValue> IntoValue for Option<T> {
+    #[inline]
+    fn into_value(self) -> r::Value {
+        match self {
+            Some(v) => v.into_value(),
+            None => r::Value::Null,
+        }
+    }
+}
+
+impl<T: IntoValue> IntoValue for Vec<T> {
+    #[inline]
+    fn into_value(self) -> r::Value {
+        r::Value::List(self.into_iter().map(|e| e.into_value()).collect::<Vec<_>>())
+    }
+}
+
+impl IntoValue for &[u8] {
+    #[inline]
+    fn into_value(self) -> r::Value {
+        r::Value::String(format!("0x{}", hex::encode(self)))
+    }
+}
+
+impl IntoValue for chrono::NaiveDate {
+    #[inline]
+    fn into_value(self) -> r::Value {
+        r::Value::String(self.format("%Y-%m-%d").to_string())
+    }
+}
+
+macro_rules! impl_into_values {
+    ($(($T:ty, $V:ident)),*) => {
+        $(
+            impl IntoValue for $T {
+                #[inline]
+                fn into_value(self) -> r::Value {
+                    r::Value::$V(self)
+                }
+            }
+        )+
+    };
+}
+
+impl_into_values![(String, String), (f64, Float), (bool, Boolean)];
+
+/// Creates a `data::value::Value::Object` from key/value pairs.
+#[macro_export]
+macro_rules! object {
+    ($($name:ident: $value:expr,)*) => {
+        {
+            let mut result = Vec::new();
+            $(
+                let value = $crate::data::graphql::object_macro::IntoValue::into_value($value);
+                result.push((stringify!($name).to_string(), value));
+            )*
+            $crate::prelude::r::Value::Object($crate::data::value::Object::from_iter(result))
+        }
+    };
+    ($($name:ident: $value:expr),*) => {
+        object! {$($name: $value,)*}
+    };
+}
diff --git a/graph/src/data/graphql/object_or_interface.rs b/graph/src/data/graphql/object_or_interface.rs
new file mode 100644
index 0000000..4805355
--- /dev/null
+++ b/graph/src/data/graphql/object_or_interface.rs
@@ -0,0 +1,146 @@
+use crate::prelude::Schema;
+use crate::{components::store::EntityType, prelude::s};
+use std::cmp::Ordering;
+use std::collections::BTreeMap;
+use std::hash::{Hash, Hasher};
+use std::mem;
+
+use super::ObjectTypeExt;
+
+#[derive(Copy, Clone, Debug)]
+pub enum ObjectOrInterface<'a> {
+    Object(&'a s::ObjectType),
+    Interface(&'a s::InterfaceType),
+}
+
+impl<'a> PartialEq for ObjectOrInterface<'a> {
+    fn eq(&self, other: &Self) -> bool {
+        use ObjectOrInterface::*;
+        match (self, other) {
+            (Object(a), Object(b)) => a.name == b.name,
+            (Interface(a), Interface(b)) => a.name == b.name,
+            (Interface(_), Object(_)) | (Object(_), Interface(_)) => false,
+        }
+    }
+}
+
+impl<'a> Eq for ObjectOrInterface<'a> {}
+
+impl<'a> Hash for ObjectOrInterface<'a> {
+    fn hash<H: Hasher>(&self, state: &mut H) {
+        mem::discriminant(self).hash(state);
+        self.name().hash(state)
+    }
+}
+
+impl<'a> PartialOrd for ObjectOrInterface<'a> {
+    fn partial_cmp(&self, other: &Self) -> Option<std::cmp::Ordering> {
+        Some(self.cmp(other))
+    }
+}
+
+impl<'a> Ord for ObjectOrInterface<'a> {
+    fn cmp(&self, other: &Self) -> std::cmp::Ordering {
+        use ObjectOrInterface::*;
+        match (self, other) {
+            (Object(a), Object(b)) => a.name.cmp(&b.name),
+            (Interface(a), Interface(b)) => a.name.cmp(&b.name),
+            (Interface(_), Object(_)) => Ordering::Less,
+            (Object(_), Interface(_)) => Ordering::Greater,
+        }
+    }
+}
+
+impl<'a> From<&'a s::ObjectType> for ObjectOrInterface<'a> {
+    fn from(object: &'a s::ObjectType) -> Self {
+        ObjectOrInterface::Object(object)
+    }
+}
+
+impl<'a> From<&'a s::InterfaceType> for ObjectOrInterface<'a> {
+    fn from(interface: &'a s::InterfaceType) -> Self {
+        ObjectOrInterface::Interface(interface)
+    }
+}
+
+impl<'a> From<ObjectOrInterface<'a>> for EntityType {
+    fn from(ooi: ObjectOrInterface) -> Self {
+        match ooi {
+            ObjectOrInterface::Object(ty) => EntityType::from(ty),
+            ObjectOrInterface::Interface(ty) => EntityType::from(ty),
+        }
+    }
+}
+
+impl<'a> ObjectOrInterface<'a> {
+    pub fn is_object(self) -> bool {
+        match self {
+            ObjectOrInterface::Object(_) => true,
+            ObjectOrInterface::Interface(_) => false,
+        }
+    }
+
+    pub fn is_interface(self) -> bool {
+        match self {
+            ObjectOrInterface::Object(_) => false,
+            ObjectOrInterface::Interface(_) => true,
+        }
+    }
+
+    pub fn name(self) -> &'a str {
+        match self {
+            ObjectOrInterface::Object(object) => &object.name,
+            ObjectOrInterface::Interface(interface) => &interface.name,
+        }
+    }
+
+    pub fn directives(self) -> &'a Vec<s::Directive> {
+        match self {
+            ObjectOrInterface::Object(object) => &object.directives,
+            ObjectOrInterface::Interface(interface) => &interface.directives,
+        }
+    }
+
+    pub fn fields(self) -> &'a Vec<s::Field> {
+        match self {
+            ObjectOrInterface::Object(object) => &object.fields,
+            ObjectOrInterface::Interface(interface) => &interface.fields,
+        }
+    }
+
+    pub fn field(&self, name: &str) -> Option<&s::Field> {
+        self.fields().iter().find(|field| &field.name == name)
+    }
+
+    pub fn object_types(self, schema: &'a Schema) -> Option<Vec<&'a s::ObjectType>> {
+        match self {
+            ObjectOrInterface::Object(object) => Some(vec![object]),
+            ObjectOrInterface::Interface(interface) => schema
+                .types_for_interface()
+                .get(&interface.into())
+                .map(|object_types| object_types.iter().collect()),
+        }
+    }
+
+    /// `typename` is the name of an object type. Matches if `self` is an object and has the same
+    /// name, or if self is an interface implemented by `typename`.
+    pub fn matches(
+        self,
+        typename: &str,
+        types_for_interface: &BTreeMap<EntityType, Vec<s::ObjectType>>,
+    ) -> bool {
+        match self {
+            ObjectOrInterface::Object(o) => o.name == typename,
+            ObjectOrInterface::Interface(i) => types_for_interface[&i.into()]
+                .iter()
+                .any(|o| o.name == typename),
+        }
+    }
+
+    pub fn is_meta(&self) -> bool {
+        match self {
+            ObjectOrInterface::Object(o) => o.is_meta(),
+            ObjectOrInterface::Interface(i) => i.is_meta(),
+        }
+    }
+}
diff --git a/graph/src/data/graphql/serialization.rs b/graph/src/data/graphql/serialization.rs
new file mode 100644
index 0000000..b9820e7
--- /dev/null
+++ b/graph/src/data/graphql/serialization.rs
@@ -0,0 +1,36 @@
+use crate::prelude::q::*;
+use serde::ser::*;
+
+/// Serializable wrapper around a GraphQL value.
+pub struct SerializableValue<'a>(pub &'a Value);
+
+impl<'a> Serialize for SerializableValue<'a> {
+    fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
+    where
+        S: Serializer,
+    {
+        match self.0 {
+            Value::Boolean(v) => serializer.serialize_bool(*v),
+            Value::Enum(v) => serializer.serialize_str(v),
+            Value::Float(v) => serializer.serialize_f64(*v),
+            Value::Int(v) => serializer.serialize_newtype_struct("Number", &v.as_i64().unwrap()),
+            Value::List(l) => {
+                let mut seq = serializer.serialize_seq(Some(l.len()))?;
+                for v in l {
+                    seq.serialize_element(&SerializableValue(v))?;
+                }
+                seq.end()
+            }
+            Value::Null => serializer.serialize_none(),
+            Value::String(s) => serializer.serialize_str(s),
+            Value::Object(o) => {
+                let mut map = serializer.serialize_map(Some(o.len()))?;
+                for (k, v) in o {
+                    map.serialize_entry(k, &SerializableValue(v))?;
+                }
+                map.end()
+            }
+            Value::Variable(_) => unreachable!("output cannot contain variables"),
+        }
+    }
+}
diff --git a/graph/src/data/graphql/shape_hash.rs b/graph/src/data/graphql/shape_hash.rs
new file mode 100644
index 0000000..00ab647
--- /dev/null
+++ b/graph/src/data/graphql/shape_hash.rs
@@ -0,0 +1,179 @@
+//! Calculate a hash for a GraphQL query that reflects the shape of
+//! the query. The shape hash will be the same for two instances of a query
+//! that are deemed identical except for unimportant details. Those details
+//! are any values used with filters, and any differences in the query
+//! name or response keys
+
+use crate::prelude::{q, s};
+use std::collections::hash_map::DefaultHasher;
+use std::hash::{Hash, Hasher};
+
+type ShapeHasher = DefaultHasher;
+
+pub trait ShapeHash {
+    fn shape_hash(&self, hasher: &mut ShapeHasher);
+}
+
+pub fn shape_hash(query: &q::Document) -> u64 {
+    let mut hasher = DefaultHasher::new();
+    query.shape_hash(&mut hasher);
+    hasher.finish()
+}
+
+// In all ShapeHash implementations, we never include anything to do with
+// the position of the element in the query, i.e., fields that involve
+// `Pos`
+
+impl ShapeHash for q::Document {
+    fn shape_hash(&self, hasher: &mut ShapeHasher) {
+        for defn in &self.definitions {
+            use q::Definition::*;
+            match defn {
+                Operation(op) => op.shape_hash(hasher),
+                Fragment(frag) => frag.shape_hash(hasher),
+            }
+        }
+    }
+}
+
+impl ShapeHash for q::OperationDefinition {
+    fn shape_hash(&self, hasher: &mut ShapeHasher) {
+        use graphql_parser::query::OperationDefinition::*;
+        // We want `[query|subscription|mutation] things { BODY }` to hash
+        // to the same thing as just `things { BODY }`
+        match self {
+            SelectionSet(set) => set.shape_hash(hasher),
+            Query(query) => query.selection_set.shape_hash(hasher),
+            Mutation(mutation) => mutation.selection_set.shape_hash(hasher),
+            Subscription(subscription) => subscription.selection_set.shape_hash(hasher),
+        }
+    }
+}
+
+impl ShapeHash for q::FragmentDefinition {
+    fn shape_hash(&self, hasher: &mut ShapeHasher) {
+        // Omit directives
+        self.name.hash(hasher);
+        self.type_condition.shape_hash(hasher);
+        self.selection_set.shape_hash(hasher);
+    }
+}
+
+impl ShapeHash for q::SelectionSet {
+    fn shape_hash(&self, hasher: &mut ShapeHasher) {
+        for item in &self.items {
+            item.shape_hash(hasher);
+        }
+    }
+}
+
+impl ShapeHash for q::Selection {
+    fn shape_hash(&self, hasher: &mut ShapeHasher) {
+        use graphql_parser::query::Selection::*;
+        match self {
+            Field(field) => field.shape_hash(hasher),
+            FragmentSpread(spread) => spread.shape_hash(hasher),
+            InlineFragment(frag) => frag.shape_hash(hasher),
+        }
+    }
+}
+
+impl ShapeHash for q::Field {
+    fn shape_hash(&self, hasher: &mut ShapeHasher) {
+        // Omit alias, directives
+        self.name.hash(hasher);
+        self.selection_set.shape_hash(hasher);
+        for (name, value) in &self.arguments {
+            name.hash(hasher);
+            value.shape_hash(hasher);
+        }
+    }
+}
+
+impl ShapeHash for s::Value {
+    fn shape_hash(&self, hasher: &mut ShapeHasher) {
+        use graphql_parser::schema::Value::*;
+
+        match self {
+            Variable(_) | Int(_) | Float(_) | String(_) | Boolean(_) | Null | Enum(_) => {
+                /* ignore */
+            }
+            List(values) => {
+                for value in values {
+                    value.shape_hash(hasher);
+                }
+            }
+            Object(map) => {
+                for (name, value) in map {
+                    name.hash(hasher);
+                    value.shape_hash(hasher);
+                }
+            }
+        }
+    }
+}
+
+impl ShapeHash for q::FragmentSpread {
+    fn shape_hash(&self, hasher: &mut ShapeHasher) {
+        // Omit directives
+        self.fragment_name.hash(hasher)
+    }
+}
+
+impl ShapeHash for q::InlineFragment {
+    fn shape_hash(&self, hasher: &mut ShapeHasher) {
+        // Omit directives
+        self.type_condition.shape_hash(hasher);
+        self.selection_set.shape_hash(hasher);
+    }
+}
+
+impl<T: ShapeHash> ShapeHash for Option<T> {
+    fn shape_hash(&self, hasher: &mut ShapeHasher) {
+        match self {
+            None => false.hash(hasher),
+            Some(t) => {
+                Some(true).hash(hasher);
+                t.shape_hash(hasher);
+            }
+        }
+    }
+}
+
+impl ShapeHash for q::TypeCondition {
+    fn shape_hash(&self, hasher: &mut ShapeHasher) {
+        match self {
+            q::TypeCondition::On(value) => value.hash(hasher),
+        }
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+    use graphql_parser::parse_query;
+
+    #[test]
+    fn identical_and_different() {
+        const Q1: &str = "query things($stuff: Int) { things(where: { stuff_gt: $stuff }) { id } }";
+        const Q2: &str = "{ things(where: { stuff_gt: 42 }) { id } }";
+        const Q3: &str = "{ things(where: { stuff_lte: 42 }) { id } }";
+        const Q4: &str = "{ things(where: { stuff_gt: 42 }) { id name } }";
+        let q1 = parse_query(Q1)
+            .expect("q1 is syntactically valid")
+            .into_static();
+        let q2 = parse_query(Q2)
+            .expect("q2 is syntactically valid")
+            .into_static();
+        let q3 = parse_query(Q3)
+            .expect("q3 is syntactically valid")
+            .into_static();
+        let q4 = parse_query(Q4)
+            .expect("q4 is syntactically valid")
+            .into_static();
+
+        assert_eq!(shape_hash(&q1), shape_hash(&q2));
+        assert_ne!(shape_hash(&q1), shape_hash(&q3));
+        assert_ne!(shape_hash(&q2), shape_hash(&q4));
+    }
+}
diff --git a/graph/src/data/graphql/values.rs b/graph/src/data/graphql/values.rs
new file mode 100644
index 0000000..7db68d7
--- /dev/null
+++ b/graph/src/data/graphql/values.rs
@@ -0,0 +1,237 @@
+use anyhow::{anyhow, Error};
+use std::collections::HashMap;
+use std::convert::TryFrom;
+use std::str::FromStr;
+
+use crate::blockchain::BlockHash;
+use crate::data::value::Object;
+use crate::prelude::{r, BigInt, Entity};
+use web3::types::H160;
+
+pub trait TryFromValue: Sized {
+    fn try_from_value(value: &r::Value) -> Result<Self, Error>;
+}
+
+impl TryFromValue for r::Value {
+    fn try_from_value(value: &r::Value) -> Result<Self, Error> {
+        Ok(value.clone())
+    }
+}
+
+impl TryFromValue for bool {
+    fn try_from_value(value: &r::Value) -> Result<Self, Error> {
+        match value {
+            r::Value::Boolean(b) => Ok(*b),
+            _ => Err(anyhow!("Cannot parse value into a boolean: {:?}", value)),
+        }
+    }
+}
+
+impl TryFromValue for String {
+    fn try_from_value(value: &r::Value) -> Result<Self, Error> {
+        match value {
+            r::Value::String(s) => Ok(s.clone()),
+            r::Value::Enum(s) => Ok(s.clone()),
+            _ => Err(anyhow!("Cannot parse value into a string: {:?}", value)),
+        }
+    }
+}
+
+impl TryFromValue for u64 {
+    fn try_from_value(value: &r::Value) -> Result<Self, Error> {
+        match value {
+            r::Value::Int(n) => {
+                if *n >= 0 {
+                    Ok(*n as u64)
+                } else {
+                    Err(anyhow!("Cannot parse value into an integer/u64: {:?}", n))
+                }
+            }
+            // `BigInt`s are represented as `String`s.
+            r::Value::String(s) => u64::from_str(s).map_err(Into::into),
+            _ => Err(anyhow!(
+                "Cannot parse value into an integer/u64: {:?}",
+                value
+            )),
+        }
+    }
+}
+
+impl TryFromValue for i32 {
+    fn try_from_value(value: &r::Value) -> Result<Self, Error> {
+        match value {
+            r::Value::Int(n) => {
+                let n = *n;
+                i32::try_from(n).map_err(Error::from)
+            }
+            // `BigInt`s are represented as `String`s.
+            r::Value::String(s) => i32::from_str(s).map_err(Into::into),
+            _ => Err(anyhow!(
+                "Cannot parse value into an integer/u64: {:?}",
+                value
+            )),
+        }
+    }
+}
+
+impl TryFromValue for H160 {
+    fn try_from_value(value: &r::Value) -> Result<Self, Error> {
+        match value {
+            r::Value::String(s) => {
+                // `H160::from_str` takes a hex string with no leading `0x`.
+                let string = s.trim_start_matches("0x");
+                H160::from_str(string).map_err(|e| {
+                    anyhow!("Cannot parse Address/H160 value from string `{}`: {}", s, e)
+                })
+            }
+            _ => Err(anyhow!(
+                "Cannot parse value into an Address/H160: {:?}",
+                value
+            )),
+        }
+    }
+}
+
+impl TryFromValue for BlockHash {
+    fn try_from_value(value: &r::Value) -> Result<Self, Error> {
+        match value {
+            r::Value::String(s) => BlockHash::from_str(s)
+                .map_err(|e| anyhow!("Cannot parse hex value from string `{}`: {}", s, e)),
+            _ => Err(anyhow!("Cannot parse non-string value: {:?}", value)),
+        }
+    }
+}
+
+impl TryFromValue for BigInt {
+    fn try_from_value(value: &r::Value) -> Result<Self, Error> {
+        match value {
+            r::Value::String(s) => BigInt::from_str(s)
+                .map_err(|e| anyhow!("Cannot parse BigInt value from string `{}`: {}", s, e)),
+            _ => Err(anyhow!("Cannot parse value into an BigInt: {:?}", value)),
+        }
+    }
+}
+
+impl<T> TryFromValue for Vec<T>
+where
+    T: TryFromValue,
+{
+    fn try_from_value(value: &r::Value) -> Result<Self, Error> {
+        match value {
+            r::Value::List(values) => values.iter().try_fold(vec![], |mut values, value| {
+                values.push(T::try_from_value(value)?);
+                Ok(values)
+            }),
+            _ => Err(anyhow!("Cannot parse value into a vector: {:?}", value)),
+        }
+    }
+}
+
+/// Assumes the entity is stored as a JSON string.
+impl TryFromValue for Entity {
+    fn try_from_value(value: &r::Value) -> Result<Self, Error> {
+        match value {
+            r::Value::String(s) => serde_json::from_str(s).map_err(Into::into),
+            _ => Err(anyhow!(
+                "Cannot parse entity, value is not a string: {:?}",
+                value
+            )),
+        }
+    }
+}
+
+pub trait ValueMap {
+    fn get_required<T: TryFromValue>(&self, key: &str) -> Result<T, Error>;
+    fn get_optional<T: TryFromValue>(&self, key: &str) -> Result<Option<T>, Error>;
+}
+
+impl ValueMap for r::Value {
+    fn get_required<T: TryFromValue>(&self, key: &str) -> Result<T, Error> {
+        match self {
+            r::Value::Object(map) => map.get_required(key),
+            _ => Err(anyhow!("value is not a map: {:?}", self)),
+        }
+    }
+
+    fn get_optional<T>(&self, key: &str) -> Result<Option<T>, Error>
+    where
+        T: TryFromValue,
+    {
+        match self {
+            r::Value::Object(map) => map.get_optional(key),
+            _ => Err(anyhow!("value is not a map: {:?}", self)),
+        }
+    }
+}
+
+impl ValueMap for &Object {
+    fn get_required<T>(&self, key: &str) -> Result<T, Error>
+    where
+        T: TryFromValue,
+    {
+        self.get(key)
+            .ok_or_else(|| anyhow!("Required field `{}` not set", key))
+            .and_then(T::try_from_value)
+    }
+
+    fn get_optional<T>(&self, key: &str) -> Result<Option<T>, Error>
+    where
+        T: TryFromValue,
+    {
+        self.get(key).map_or(Ok(None), |value| match value {
+            r::Value::Null => Ok(None),
+            _ => T::try_from_value(value).map(Some),
+        })
+    }
+}
+
+impl ValueMap for &HashMap<&str, r::Value> {
+    fn get_required<T>(&self, key: &str) -> Result<T, Error>
+    where
+        T: TryFromValue,
+    {
+        self.get(key)
+            .ok_or_else(|| anyhow!("Required field `{}` not set", key))
+            .and_then(T::try_from_value)
+    }
+
+    fn get_optional<T>(&self, key: &str) -> Result<Option<T>, Error>
+    where
+        T: TryFromValue,
+    {
+        self.get(key).map_or(Ok(None), |value| match value {
+            r::Value::Null => Ok(None),
+            _ => T::try_from_value(value).map(Some),
+        })
+    }
+}
+
+pub trait ValueList {
+    fn get_values<T>(&self) -> Result<Vec<T>, Error>
+    where
+        T: TryFromValue;
+}
+
+impl ValueList for r::Value {
+    fn get_values<T>(&self) -> Result<Vec<T>, Error>
+    where
+        T: TryFromValue,
+    {
+        match self {
+            r::Value::List(values) => values.get_values(),
+            _ => Err(anyhow!("value is not a list: {:?}", self)),
+        }
+    }
+}
+
+impl ValueList for Vec<r::Value> {
+    fn get_values<T>(&self) -> Result<Vec<T>, Error>
+    where
+        T: TryFromValue,
+    {
+        self.iter().try_fold(vec![], |mut acc, value| {
+            acc.push(T::try_from_value(value)?);
+            Ok(acc)
+        })
+    }
+}
diff --git a/graph/src/data/graphql/visitor.rs b/graph/src/data/graphql/visitor.rs
new file mode 100644
index 0000000..94d26c0
--- /dev/null
+++ b/graph/src/data/graphql/visitor.rs
@@ -0,0 +1,62 @@
+use crate::prelude::q;
+
+pub trait Visitor<E> {
+    fn enter_field(&mut self, _: &q::Field) -> Result<(), E> {
+        Ok(())
+    }
+    fn leave_field(&mut self, _: &mut q::Field) -> Result<(), E> {
+        Ok(())
+    }
+
+    fn enter_query(&mut self, _: &q::Query) -> Result<(), E> {
+        Ok(())
+    }
+    fn leave_query(&mut self, _: &mut q::Query) -> Result<(), E> {
+        Ok(())
+    }
+
+    fn visit_fragment_spread(&mut self, _: &q::FragmentSpread) -> Result<(), E> {
+        Ok(())
+    }
+}
+
+pub fn visit<E, T>(visitor: &mut dyn Visitor<E>, doc: &mut q::Document) -> Result<(), E> {
+    for def in &mut doc.definitions {
+        match def {
+            q::Definition::Operation(op) => match op {
+                q::OperationDefinition::SelectionSet(set) => {
+                    visit_selection_set(visitor, set)?;
+                }
+                q::OperationDefinition::Query(query) => {
+                    visitor.enter_query(query)?;
+                    visit_selection_set(visitor, &mut query.selection_set)?;
+                    visitor.leave_query(query)?;
+                }
+                q::OperationDefinition::Mutation(_) => todo!(),
+                q::OperationDefinition::Subscription(_) => todo!(),
+            },
+            q::Definition::Fragment(frag) => {}
+        }
+    }
+    Ok(())
+}
+
+fn visit_selection_set<E>(
+    visitor: &mut dyn Visitor<E>,
+    set: &mut q::SelectionSet,
+) -> Result<(), E> {
+    for sel in &mut set.items {
+        match sel {
+            q::Selection::Field(field) => {
+                visitor.enter_field(field)?;
+                visit_selection_set(visitor, &mut field.selection_set)?;
+                visitor.leave_field(field)?;
+            }
+            q::Selection::FragmentSpread(frag) => {
+                visitor.visit_fragment_spread(frag)?;
+            }
+            q::Selection::InlineFragment(frag) => {}
+        }
+    }
+    Ok(())
+}
diff --git a/graph/src/data/introspection.graphql b/graph/src/data/introspection.graphql
new file mode 100644
index 0000000..c3d2c1b
--- /dev/null
+++ b/graph/src/data/introspection.graphql
@@ -0,0 +1,98 @@
+# A GraphQL introspection schema for inclusion in a subgraph's API schema.
+# The schema differs from the 'standard' introspection schema in that it
+# doesn't have a Query type nor scalar declarations as they come from the
+# API schema.
+
+type __Schema {
+  types: [__Type!]!
+  queryType: __Type!
+  mutationType: __Type
+  subscriptionType: __Type
+  directives: [__Directive!]!
+}
+
+type __Type {
+  kind: __TypeKind!
+  name: String
+  description: String
+
+  # OBJECT and INTERFACE only
+  fields(includeDeprecated: Boolean = false): [__Field!]
+
+  # OBJECT only
+  interfaces: [__Type!]
+
+  # INTERFACE and UNION only
+  possibleTypes: [__Type!]
+
+  # ENUM only
+  enumValues(includeDeprecated: Boolean = false): [__EnumValue!]
+
+  # INPUT_OBJECT only
+  inputFields: [__InputValue!]
+
+  # NON_NULL and LIST only
+  ofType: __Type
+}
+
+type __Field {
+  name: String!
+  description: String
+  args: [__InputValue!]!
+  type: __Type!
+  isDeprecated: Boolean!
+  deprecationReason: String
+}
+
+type __InputValue {
+  name: String!
+  description: String
+  type: __Type!
+  defaultValue: String
+}
+
+type __EnumValue {
+  name: String!
+  description: String
+  isDeprecated: Boolean!
+  deprecationReason: String
+}
+
+enum __TypeKind {
+  SCALAR
+  OBJECT
+  INTERFACE
+  UNION
+  ENUM
+  INPUT_OBJECT
+  LIST
+  NON_NULL
+}
+
+type __Directive {
+  name: String!
+  description: String
+  locations: [__DirectiveLocation!]!
+  args: [__InputValue!]!
+}
+
+enum __DirectiveLocation {
+  QUERY
+  MUTATION
+  SUBSCRIPTION
+  FIELD
+  FRAGMENT_DEFINITION
+  FRAGMENT_SPREAD
+  INLINE_FRAGMENT
+  SCHEMA
+  SCALAR
+  OBJECT
+  FIELD_DEFINITION
+  ARGUMENT_DEFINITION
+  INTERFACE
+  UNION
+  ENUM
+  ENUM_VALUE
+  INPUT_OBJECT
+  INPUT_FIELD_DEFINITION
+}
\ No newline at end of file
diff --git a/graph/src/data/mod.rs b/graph/src/data/mod.rs
new file mode 100644
index 0000000..b308c75
--- /dev/null
+++ b/graph/src/data/mod.rs
@@ -0,0 +1,20 @@
+/// Data types for dealing with subgraphs.
+pub mod subgraph;
+
+/// Data types for dealing with GraphQL queries.
+pub mod query;
+
+/// Data types for dealing with GraphQL schemas.
+pub mod schema;
+
+/// Data types for dealing with storing entities.
+pub mod store;
+
+/// Data types for dealing with GraphQL subscriptions.
+pub mod subscription;
+
+/// Data types for dealing with GraphQL values.
+pub mod graphql;
+
+/// Our representation of values for query results and the like
+pub mod value;
diff --git a/graph/src/data/query/cache_status.rs b/graph/src/data/query/cache_status.rs
new file mode 100644
index 0000000..93d7a96
--- /dev/null
+++ b/graph/src/data/query/cache_status.rs
@@ -0,0 +1,43 @@
+use std::fmt;
+use std::slice::Iter;
+
+/// Used for checking if a response hit the cache.
+#[derive(Copy, Clone, PartialEq, Eq, Hash)]
+pub enum CacheStatus {
+    /// Hit is a hit in the generational cache.
+    Hit,
+
+    /// Shared is a hit in the herd cache.
+    Shared,
+
+    /// Insert is a miss that inserted in the generational cache.
+    Insert,
+
+    /// A miss is none of the above.
+    Miss,
+}
+
+impl Default for CacheStatus {
+    fn default() -> Self {
+        CacheStatus::Miss
+    }
+}
+
+impl fmt::Display for CacheStatus {
+    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
+        match self {
+            CacheStatus::Hit => f.write_str("hit"),
+            CacheStatus::Shared => f.write_str("shared"),
+            CacheStatus::Insert => f.write_str("insert"),
+            CacheStatus::Miss => f.write_str("miss"),
+        }
+    }
+}
+
+impl CacheStatus {
+    pub fn iter() -> Iter<'static, CacheStatus> {
+        use CacheStatus::*;
+        static STATUSES: [CacheStatus; 4] = [Hit, Shared, Insert, Miss];
+        STATUSES.iter()
+    }
+}
diff --git a/graph/src/data/query/error.rs b/graph/src/data/query/error.rs
new file mode 100644
index 0000000..602162d
--- /dev/null
+++ b/graph/src/data/query/error.rs
@@ -0,0 +1,458 @@
+use graphql_parser::Pos;
+use hex::FromHexError;
+use num_bigint;
+use serde::ser::*;
+use std::collections::HashMap;
+use std::error::Error;
+use std::fmt;
+use std::string::FromUtf8Error;
+use std::sync::Arc;
+
+use crate::data::subgraph::*;
+use crate::prelude::q;
+use crate::{components::store::StoreError, prelude::CacheWeight};
+
+#[derive(Debug, Clone)]
+pub struct CloneableAnyhowError(Arc<anyhow::Error>);
+
+impl From<anyhow::Error> for CloneableAnyhowError {
+    fn from(f: anyhow::Error) -> Self {
+        Self(Arc::new(f))
+    }
+}
+
+/// Error caused while executing a [Query](struct.Query.html).
+#[derive(Debug, Clone)]
+pub enum QueryExecutionError {
+    OperationNameRequired,
+    OperationNotFound(String),
+    NotSupported(String),
+    NoRootSubscriptionObjectType,
+    NonNullError(Pos, String),
+    ListValueError(Pos, String),
+    NamedTypeError(String),
+    AbstractTypeError(String),
+    InvalidArgumentError(Pos, String, q::Value),
+    MissingArgumentError(Pos, String),
+    ValidationError(Option<Pos>, String),
+    InvalidVariableTypeError(Pos, String),
+    MissingVariableError(Pos, String),
+    ResolveEntitiesError(String),
+    OrderByNotSupportedError(String, String),
+    OrderByNotSupportedForType(String),
+    FilterNotSupportedError(String, String),
+    UnknownField(Pos, String, String),
+    EmptyQuery,
+    MultipleSubscriptionFields,
+    SubgraphDeploymentIdError(String),
+    RangeArgumentsError(&'static str, u32, i64),
+    InvalidFilterError,
+    EntityFieldError(String, String),
+    ListTypesError(String, Vec<String>),
+    ListFilterError(String),
+    ValueParseError(String, String),
+    AttributeTypeError(String, String),
+    EntityParseError(String),
+    StoreError(CloneableAnyhowError),
+    Timeout,
+    EmptySelectionSet(String),
+    AmbiguousDerivedFromResult(Pos, String, String, String),
+    Unimplemented(String),
+    EnumCoercionError(Pos, String, q::Value, String, Vec<String>),
+    ScalarCoercionError(Pos, String, q::Value, String),
+    TooComplex(u64, u64), // (complexity, max_complexity)
+    TooDeep(u8),          // max_depth
+    CyclicalFragment(String),
+    TooExpensive,
+    Throttled,
+    UndefinedFragment(String),
+    Panic(String),
+    EventStreamError,
+    FulltextQueryRequiresFilter,
+    FulltextQueryInvalidSyntax(String),
+    DeploymentReverted,
+    SubgraphManifestResolveError(Arc<SubgraphManifestResolveError>),
+    InvalidSubgraphManifest,
+    ResultTooBig(usize, usize),
+    DeploymentNotFound(String),
+}
+
+impl QueryExecutionError {
+    pub fn is_attestable(&self) -> bool {
+        use self::QueryExecutionError::*;
+        match self {
+            OperationNameRequired
+            | OperationNotFound(_)
+            | NotSupported(_)
+            | NoRootSubscriptionObjectType
+            | NonNullError(_, _)
+            | NamedTypeError(_)
+            | AbstractTypeError(_)
+            | InvalidArgumentError(_, _, _)
+            | MissingArgumentError(_, _)
+            | InvalidVariableTypeError(_, _)
+            | MissingVariableError(_, _)
+            | OrderByNotSupportedError(_, _)
+            | OrderByNotSupportedForType(_)
+            | FilterNotSupportedError(_, _)
+            | UnknownField(_, _, _)
+            | EmptyQuery
+            | MultipleSubscriptionFields
+            | SubgraphDeploymentIdError(_)
+            | InvalidFilterError
+            | EntityFieldError(_, _)
+            | ListTypesError(_, _)
+            | ListFilterError(_)
+            | AttributeTypeError(_, _)
+            | EmptySelectionSet(_)
+            | Unimplemented(_)
+            | CyclicalFragment(_)
+            | UndefinedFragment(_)
+            | FulltextQueryInvalidSyntax(_)
+            | FulltextQueryRequiresFilter => true,
+            ListValueError(_, _)
+            | ResolveEntitiesError(_)
+            | RangeArgumentsError(_, _, _)
+            | ValueParseError(_, _)
+            | EntityParseError(_)
+            | StoreError(_)
+            | Timeout
+            | EnumCoercionError(_, _, _, _, _)
+            | ScalarCoercionError(_, _, _, _)
+            | AmbiguousDerivedFromResult(_, _, _, _)
+            | TooComplex(_, _)
+            | TooDeep(_)
+            | Panic(_)
+            | EventStreamError
+            | TooExpensive
+            | Throttled
+            | DeploymentReverted
+            | SubgraphManifestResolveError(_)
+            | InvalidSubgraphManifest
+            | ValidationError(_, _)
+            | ResultTooBig(_, _)
+            | DeploymentNotFound(_) => false,
+        }
+    }
+}
+
+impl Error for QueryExecutionError {
+    fn description(&self) -> &str {
+        "Query execution error"
+    }
+
+    fn cause(&self) -> Option<&dyn Error> {
+        None
+    }
+}
+
+impl fmt::Display for QueryExecutionError {
+    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
+        use self::QueryExecutionError::*;
+
+        match self {
+            OperationNameRequired => write!(f, "Operation name required"),
+            OperationNotFound(s) => {
+                write!(f, "Operation name not found `{}`", s)
+            }
+            ValidationError(_pos, message) => {
+                write!(f, "{}", message)
+            }
+            NotSupported(s) => write!(f, "Not supported: {}", s),
+            NoRootSubscriptionObjectType => {
+                write!(f, "No root Subscription type defined in the schema")
+            }
+            NonNullError(_, s) => {
+                write!(f, "Null value resolved for non-null field `{}`", s)
+            }
+            ListValueError(_, s) => {
+                write!(f, "Non-list value resolved for list field `{}`", s)
+            }
+            NamedTypeError(s) => {
+                write!(f, "Failed to resolve named type `{}`", s)
+            }
+            AbstractTypeError(s) => {
+                write!(f, "Failed to resolve abstract type `{}`", s)
+            }
+            InvalidArgumentError(_, s, v) => {
+                write!(f, "Invalid value provided for argument `{}`: {:?}", s, v)
+            }
+            MissingArgumentError(_, s) => {
+                write!(f, "No value provided for required argument: `{}`", s)
+            }
+            InvalidVariableTypeError(_, s) => {
+                write!(f, "Variable `{}` must have an input type", s)
+            }
+            MissingVariableError(_, s) => {
+                write!(f, "No value provided for required variable `{}`", s)
+            }
+            ResolveEntitiesError(e) => {
+                write!(f, "Failed to get entities from store: {}", e)
+            }
+            OrderByNotSupportedError(entity, field) => {
+                write!(f, "Ordering by `{}` is not supported for type `{}`", field, entity)
+            }
+            OrderByNotSupportedForType(field_type) => {
+                write!(f, "Ordering by `{}` fields is not supported", field_type)
+            }
+            FilterNotSupportedError(value, filter) => {
+                write!(f, "Filter not supported by value `{}`: `{}`", value, filter)
+            }
+            UnknownField(_, t, s) => {
+                write!(f, "Type `{}` has no field `{}`", t, s)
+            }
+            EmptyQuery => write!(f, "The query is empty"),
+            MultipleSubscriptionFields => write!(
+                f,
+                "Only a single top-level field is allowed in subscriptions"
+            ),
+            SubgraphDeploymentIdError(s) => {
+                write!(f, "Failed to get subgraph ID from type: `{}`", s)
+            }
+            RangeArgumentsError(arg, max, actual) => {
+                write!(f, "The `{}` argument must be between 0 and {}, but is {}", arg, max, actual)
+            }
+            InvalidFilterError => write!(f, "Filter must by an object"),
+            EntityFieldError(e, a) => {
+                write!(f, "Entity `{}` has no attribute `{}`", e, a)
+            }
+
+            ListTypesError(s, v) => write!(
+                f,
+                "Values passed to filter `{}` must be of the same type but are of different types: {}",
+                s,
+                v.join(", ")
+            ),
+            ListFilterError(s) => {
+                write!(f, "Non-list value passed to `{}` filter", s)
+            }
+            ValueParseError(t, e) => {
+                write!(f, "Failed to decode `{}` value: `{}`", t, e)
+            }
+            AttributeTypeError(value, ty) => {
+                write!(f, "Query contains value with invalid type `{}`: `{}`", ty, value)
+            }
+            EntityParseError(s) => {
+                write!(f, "Broken entity found in store: {}", s)
+            }
+            StoreError(e) => {
+                write!(f, "Store error: {}", e.0)
+            }
+            Timeout => write!(f, "Query timed out"),
+            EmptySelectionSet(entity_type) => {
+                write!(f, "Selection set for type `{}` is empty", entity_type)
+            }
+            AmbiguousDerivedFromResult(_, field, target_type, target_field) => {
+                write!(f, "Ambiguous result for derived field `{}`: \
+                           Multiple `{}` entities refer back via `{}`",
+                       field, target_type, target_field)
+            }
+            Unimplemented(feature) => {
+                write!(f, "Feature `{}` is not yet implemented", feature)
+            }
+            EnumCoercionError(_, field, value, enum_type, values) => {
+                write!(f, "Failed to coerce value `{}` of field `{}` to enum type `{}`. Possible values are: {}", value, field, enum_type, values.join(", "))
+            }
+            ScalarCoercionError(_, field, value, scalar_type) => {
+                write!(f, "Failed to coerce value `{}` of field `{}` to scalar type `{}`", value, field, scalar_type)
+            }
+            TooComplex(complexity, max_complexity) => {
+                write!(f, "query potentially returns `{}` entities or more and thereby exceeds \
+                           the limit of `{}` entities. Possible solutions are reducing the depth \
+                           of the query, querying fewer relationships or using `first` to \
+                           return smaller collections", complexity, max_complexity)
+            }
+            TooDeep(max_depth) => write!(f, "query has a depth that exceeds the limit of `{}`", max_depth),
+            CyclicalFragment(name) =>write!(f, "query has fragment cycle including `{}`", name),
+            UndefinedFragment(frag_name) => write!(f, "fragment `{}` is not defined", frag_name),
+            Panic(msg) => write!(f, "panic processing query: {}", msg),
+            EventStreamError => write!(f, "error in the subscription event stream"),
+            FulltextQueryRequiresFilter => write!(f, "fulltext search queries can only use EntityFilter::Equal"),
+            FulltextQueryInvalidSyntax(msg) => write!(f, "Invalid fulltext search query syntax. Error: {}. Hint: Search terms with spaces need to be enclosed in single quotes", msg),
+            TooExpensive => write!(f, "query is too expensive"),
+            Throttled => write!(f, "service is overloaded and can not run the query right now. Please try again in a few minutes"),
+            DeploymentReverted => write!(f, "the chain was reorganized while executing the query"),
+            SubgraphManifestResolveError(e) => write!(f, "failed to resolve subgraph manifest: {}", e),
+            InvalidSubgraphManifest => write!(f, "invalid subgraph manifest file"),
+            ResultTooBig(actual, limit) => write!(f, "the result size of {} is larger than the allowed limit of {}", actual, limit),
+            DeploymentNotFound(id_or_name) => write!(f, "deployment `{}` does not exist", id_or_name)
+        }
+    }
+}
+
+impl From<QueryExecutionError> for Vec<QueryExecutionError> {
+    fn from(e: QueryExecutionError) -> Self {
+        vec![e]
+    }
+}
+
+impl From<FromHexError> for QueryExecutionError {
+    fn from(e: FromHexError) -> Self {
+        QueryExecutionError::ValueParseError("Bytes".to_string(), e.to_string())
+    }
+}
+
+impl From<num_bigint::ParseBigIntError> for QueryExecutionError {
+    fn from(e: num_bigint::ParseBigIntError) -> Self {
+        QueryExecutionError::ValueParseError("BigInt".to_string(), format!("{}", e))
+    }
+}
+
+impl From<bigdecimal::ParseBigDecimalError> for QueryExecutionError {
+    fn from(e: bigdecimal::ParseBigDecimalError) -> Self {
+        QueryExecutionError::ValueParseError("BigDecimal".to_string(), format!("{}", e))
+    }
+}
+
+impl From<StoreError> for QueryExecutionError {
+    fn from(e: StoreError) -> Self {
+        match e {
+            StoreError::DeploymentNotFound(id_or_name) => {
+                QueryExecutionError::DeploymentNotFound(id_or_name)
+            }
+            _ => QueryExecutionError::StoreError(CloneableAnyhowError(Arc::new(e.into()))),
+        }
+    }
+}
+
+impl From<SubgraphManifestResolveError> for QueryExecutionError {
+    fn from(e: SubgraphManifestResolveError) -> Self {
+        QueryExecutionError::SubgraphManifestResolveError(Arc::new(e))
+    }
+}
+
+/// Error caused while processing a [Query](struct.Query.html) request.
+#[derive(Clone, Debug)]
+pub enum QueryError {
+    EncodingError(FromUtf8Error),
+    ParseError(Arc<anyhow::Error>),
+    ExecutionError(QueryExecutionError),
+    IndexingError,
+}
+
+impl QueryError {
+    pub fn is_attestable(&self) -> bool {
+        match self {
+            QueryError::EncodingError(_) | QueryError::ParseError(_) => true,
+            QueryError::ExecutionError(err) => err.is_attestable(),
+            QueryError::IndexingError => false,
+        }
+    }
+}
+
+impl From<FromUtf8Error> for QueryError {
+    fn from(e: FromUtf8Error) -> Self {
+        QueryError::EncodingError(e)
+    }
+}
+
+impl From<QueryExecutionError> for QueryError {
+    fn from(e: QueryExecutionError) -> Self {
+        QueryError::ExecutionError(e)
+    }
+}
+
+impl Error for QueryError {
+    fn description(&self) -> &str {
+        "Query error"
+    }
+
+    fn cause(&self) -> Option<&dyn Error> {
+        match *self {
+            QueryError::EncodingError(ref e) => Some(e),
+            QueryError::ExecutionError(ref e) => Some(e),
+            _ => None,
+        }
+    }
+}
+
+impl fmt::Display for QueryError {
+    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
+        match *self {
+            QueryError::EncodingError(ref e) => write!(f, "{}", e),
+            QueryError::ExecutionError(ref e) => write!(f, "{}", e),
+            QueryError::ParseError(ref e) => write!(f, "{}", e),
+
+            // This error message is part of attestable responses.
+            QueryError::IndexingError => write!(f, "indexing_error"),
+        }
+    }
+}
+
+impl Serialize for QueryError {
+    fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
+    where
+        S: Serializer,
+    {
+        use self::QueryExecutionError::*;
+
+        let mut map = serializer.serialize_map(Some(1))?;
+
+        let msg = match self {
+            // Serialize parse errors with their location (line, column) to make it easier
+            // for users to find where the errors are; this is likely to change as the
+            // graphql_parser team makes improvements to their error reporting
+            QueryError::ParseError(_) => {
+                // Split the inner message into (first line, rest)
+                let msg = format!("{}", self);
+                let inner_msg = msg.replace("query parse error:", "");
+                let inner_msg = inner_msg.trim();
+                let parts: Vec<&str> = inner_msg.splitn(2, '\n').collect();
+
+                // Find the colon in the first line and split there
+                let colon_pos = parts[0].rfind(':').unwrap();
+                let (a, b) = parts[0].split_at(colon_pos);
+
+                // Find the line and column numbers and convert them to u32
+                let line: u32 = a
+                    .matches(char::is_numeric)
+                    .collect::<String>()
+                    .parse()
+                    .unwrap();
+                let column: u32 = b
+                    .matches(char::is_numeric)
+                    .collect::<String>()
+                    .parse()
+                    .unwrap();
+
+                // Generate the list of locations
+                let mut location = HashMap::new();
+                location.insert("line", line);
+                location.insert("column", column);
+                map.serialize_entry("locations", &vec![location])?;
+
+                // Only use the remainder after the location as the error message
+                parts[1].to_string()
+            }
+
+            // Serialize entity resolution errors using their position
+            QueryError::ExecutionError(NonNullError(pos, _))
+            | QueryError::ExecutionError(ListValueError(pos, _))
+            | QueryError::ExecutionError(InvalidArgumentError(pos, _, _))
+            | QueryError::ExecutionError(MissingArgumentError(pos, _))
+            | QueryError::ExecutionError(InvalidVariableTypeError(pos, _))
+            | QueryError::ExecutionError(MissingVariableError(pos, _))
+            | QueryError::ExecutionError(AmbiguousDerivedFromResult(pos, _, _, _))
+            | QueryError::ExecutionError(EnumCoercionError(pos, _, _, _, _))
+            | QueryError::ExecutionError(ScalarCoercionError(pos, _, _, _))
+            | QueryError::ExecutionError(UnknownField(pos, _, _)) => {
+                let mut location = HashMap::new();
+                location.insert("line", pos.line);
+                location.insert("column", pos.column);
+                map.serialize_entry("locations", &vec![location])?;
+                format!("{}", self)
+            }
+            _ => format!("{}", self),
+        };
+
+        map.serialize_entry("message", msg.as_str())?;
+        map.end()
+    }
+}
+
+impl CacheWeight for QueryError {
+    fn indirect_weight(&self) -> usize {
+        // Errors don't have a weight since they are never cached
+        0
+    }
+}
diff --git a/graph/src/data/query/mod.rs b/graph/src/data/query/mod.rs
new file mode 100644
index 0000000..7b5a901
--- /dev/null
+++ b/graph/src/data/query/mod.rs
@@ -0,0 +1,11 @@
+mod cache_status;
+mod error;
+mod query;
+mod result;
+mod trace;
+
+pub use self::cache_status::CacheStatus;
+pub use self::error::{QueryError, QueryExecutionError};
+pub use self::query::{Query, QueryTarget, QueryVariables};
+pub use self::result::{QueryResult, QueryResults};
+pub use self::trace::Trace;
diff --git a/graph/src/data/query/query.rs b/graph/src/data/query/query.rs
new file mode 100644
index 0000000..2eaf351
--- /dev/null
+++ b/graph/src/data/query/query.rs
@@ -0,0 +1,164 @@
+use serde::de::Deserializer;
+use serde::Deserialize;
+use std::collections::{BTreeMap, HashMap};
+use std::convert::TryFrom;
+use std::ops::{Deref, DerefMut};
+use std::sync::Arc;
+
+use crate::{
+    data::graphql::shape_hash::shape_hash,
+    prelude::{q, r, ApiVersion, DeploymentHash, SubgraphName, ENV_VARS},
+};
+
+fn deserialize_number<'de, D>(deserializer: D) -> Result<q::Number, D::Error>
+where
+    D: Deserializer<'de>,
+{
+    let i: i32 = Deserialize::deserialize(deserializer)?;
+    Ok(q::Number::from(i))
+}
+
+fn deserialize_list<'de, D>(deserializer: D) -> Result<Vec<q::Value>, D::Error>
+where
+    D: Deserializer<'de>,
+{
+    let values: Vec<DeserializableGraphQlValue> = Deserialize::deserialize(deserializer)?;
+    Ok(values.into_iter().map(|v| v.0).collect())
+}
+
+fn deserialize_object<'de, D>(deserializer: D) -> Result<BTreeMap<String, q::Value>, D::Error>
+where
+    D: Deserializer<'de>,
+{
+    let pairs: BTreeMap<String, DeserializableGraphQlValue> =
+        Deserialize::deserialize(deserializer)?;
+    Ok(pairs.into_iter().map(|(k, v)| (k, v.0)).collect())
+}
+
+#[derive(Deserialize)]
+#[serde(untagged, remote = "q::Value")]
+enum GraphQLValue {
+    #[serde(deserialize_with = "deserialize_number")]
+    Int(q::Number),
+    Float(f64),
+    String(String),
+    Boolean(bool),
+    Null,
+    Enum(String),
+    #[serde(deserialize_with = "deserialize_list")]
+    List(Vec<q::Value>),
+    #[serde(deserialize_with = "deserialize_object")]
+    Object(BTreeMap<String, q::Value>),
+}
+
+/// Variable value for a GraphQL query.
+#[derive(Clone, Debug, Deserialize)]
+pub struct DeserializableGraphQlValue(#[serde(with = "GraphQLValue")] q::Value);
+
+fn deserialize_variables<'de, D>(deserializer: D) -> Result<HashMap<String, r::Value>, D::Error>
+where
+    D: Deserializer<'de>,
+{
+    use serde::de::Error;
+    let pairs: BTreeMap<String, DeserializableGraphQlValue> =
+        Deserialize::deserialize(deserializer)?;
+    pairs
+        .into_iter()
+        .map(|(k, DeserializableGraphQlValue(v))| r::Value::try_from(v).map(|v| (k, v)))
+        .collect::<Result<_, _>>()
+        .map_err(|v| D::Error::custom(format!("failed to convert to r::Value: {:?}", v)))
+}
+
+/// Variable values for a GraphQL query.
+#[derive(Clone, Debug, Default, Deserialize, PartialEq)]
+pub struct QueryVariables(
+    #[serde(deserialize_with = "deserialize_variables")] HashMap<String, r::Value>,
+);
+
+impl QueryVariables {
+    pub fn new(variables: HashMap<String, r::Value>) -> Self {
+        QueryVariables(variables)
+    }
+}
+
+impl Deref for QueryVariables {
+    type Target = HashMap<String, r::Value>;
+
+    fn deref(&self) -> &Self::Target {
+        &self.0
+    }
+}
+
+impl DerefMut for QueryVariables {
+    fn deref_mut(&mut self) -> &mut HashMap<String, r::Value> {
+        &mut self.0
+    }
+}
+
+impl serde::ser::Serialize for QueryVariables {
+    fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
+    where
+        S: serde::ser::Serializer,
+    {
+        use serde::ser::SerializeMap;
+
+        let mut map = serializer.serialize_map(Some(self.0.len()))?;
+        for (k, v) in &self.0 {
+            map.serialize_entry(k, &v)?;
+        }
+        map.end()
+    }
+}
+
+#[derive(Clone, Debug)]
+pub enum QueryTarget {
+    Name(SubgraphName, ApiVersion),
+    Deployment(DeploymentHash, ApiVersion),
+}
+
+impl QueryTarget {
+    pub fn get_version(&self) -> &ApiVersion {
+        match self {
+            Self::Deployment(_, version) | Self::Name(_, version) => version,
+        }
+    }
+}
+
+/// A GraphQL query as submitted by a client, either directly or through a subscription.
+#[derive(Clone, Debug)]
+pub struct Query {
+    pub document: q::Document,
+    pub variables: Option<QueryVariables>,
+    pub shape_hash: u64,
+    pub query_text: Arc<String>,
+    pub variables_text: Arc<String>,
+    _force_use_of_new: (),
+}
+
+impl Query {
+    pub fn new(document: q::Document, variables: Option<QueryVariables>) -> Self {
+        let shape_hash = shape_hash(&document);
+
+        let (query_text, variables_text) = if ENV_VARS.log_gql_timing()
+            || (ENV_VARS.graphql.enable_validations && ENV_VARS.graphql.silent_graphql_validations)
+        {
+            (
+                document
+                    .format(graphql_parser::Style::default().indent(0))
+                    .replace('\n', " "),
+                serde_json::to_string(&variables).unwrap_or_default(),
+            )
+        } else {
+            ("(gql logging turned off)".to_owned(), "".to_owned())
+        };
+
+        Query {
+            document,
+            variables,
+            shape_hash,
+            query_text: Arc::new(query_text),
+            variables_text: Arc::new(variables_text),
+            _force_use_of_new: (),
+        }
+    }
+}
diff --git a/graph/src/data/query/result.rs b/graph/src/data/query/result.rs
new file mode 100644
index 0000000..6b8bebd
--- /dev/null
+++ b/graph/src/data/query/result.rs
@@ -0,0 +1,375 @@
+use super::error::{QueryError, QueryExecutionError};
+use crate::data::value::Object;
+use crate::prelude::{r, CacheWeight, DeploymentHash};
+use http::header::{
+    ACCESS_CONTROL_ALLOW_HEADERS, ACCESS_CONTROL_ALLOW_METHODS, ACCESS_CONTROL_ALLOW_ORIGIN,
+    CONTENT_TYPE,
+};
+use serde::ser::*;
+use serde::Serialize;
+use std::convert::TryFrom;
+use std::sync::Arc;
+
+use super::Trace;
+
+fn serialize_data<S>(data: &Option<Data>, serializer: S) -> Result<S::Ok, S::Error>
+where
+    S: Serializer,
+{
+    let mut ser = serializer.serialize_map(None)?;
+
+    // Unwrap: data is only serialized if it is `Some`.
+    for (k, v) in data.as_ref().unwrap() {
+        ser.serialize_entry(k, v)?;
+    }
+    ser.end()
+}
+
+fn serialize_value_map<'a, S>(
+    data: impl Iterator<Item = &'a Data>,
+    serializer: S,
+) -> Result<S::Ok, S::Error>
+where
+    S: Serializer,
+{
+    let mut ser = serializer.serialize_map(None)?;
+    for map in data {
+        for (k, v) in map {
+            ser.serialize_entry(k, v)?;
+        }
+    }
+    ser.end()
+}
+
+pub type Data = Object;
+
+#[derive(Debug)]
+/// A collection of query results that is serialized as a single result.
+pub struct QueryResults {
+    results: Vec<Arc<QueryResult>>,
+}
+
+impl QueryResults {
+    pub fn empty() -> Self {
+        QueryResults {
+            results: Vec::new(),
+        }
+    }
+
+    pub fn first(&self) -> Option<&Arc<QueryResult>> {
+        self.results.first()
+    }
+
+    pub fn has_errors(&self) -> bool {
+        self.results.iter().any(|result| result.has_errors())
+    }
+
+    pub fn not_found(&self) -> bool {
+        self.results.iter().any(|result| result.not_found())
+    }
+
+    pub fn deployment_hash(&self) -> Option<&DeploymentHash> {
+        self.results
+            .iter()
+            .filter_map(|result| result.deployment.as_ref())
+            .next()
+    }
+
+    pub fn traces(&self) -> Vec<&Trace> {
+        self.results.iter().map(|res| &res.trace).collect()
+    }
+}
+
+impl Serialize for QueryResults {
+    fn serialize<S: Serializer>(&self, serializer: S) -> Result<S::Ok, S::Error> {
+        let mut len = 0;
+        let has_data = self.results.iter().any(|r| r.has_data());
+        if has_data {
+            len += 1;
+        }
+        let has_errors = self.results.iter().any(|r| r.has_errors());
+        if has_errors {
+            len += 1;
+        }
+
+        let mut state = serializer.serialize_struct("QueryResults", len)?;
+
+        // Serialize data.
+        if has_data {
+            struct SerData<'a>(&'a QueryResults);
+
+            impl Serialize for SerData<'_> {
+                fn serialize<S: Serializer>(&self, serializer: S) -> Result<S::Ok, S::Error> {
+                    serialize_value_map(
+                        self.0.results.iter().filter_map(|r| r.data.as_ref()),
+                        serializer,
+                    )
+                }
+            }
+
+            state.serialize_field("data", &SerData(self))?;
+        }
+
+        // Serialize errors.
+        if has_errors {
+            struct SerError<'a>(&'a QueryResults);
+
+            impl Serialize for SerError<'_> {
+                fn serialize<S: Serializer>(&self, serializer: S) -> Result<S::Ok, S::Error> {
+                    let mut seq = serializer.serialize_seq(None)?;
+                    for err in self.0.results.iter().map(|r| &r.errors).flatten() {
+                        seq.serialize_element(err)?;
+                    }
+                    seq.end()
+                }
+            }
+
+            state.serialize_field("errors", &SerError(self))?;
+        }
+
+        state.end()
+    }
+}
+
+impl From<Data> for QueryResults {
+    fn from(x: Data) -> Self {
+        QueryResults {
+            results: vec![Arc::new(x.into())],
+        }
+    }
+}
+
+impl From<QueryResult> for QueryResults {
+    fn from(x: QueryResult) -> Self {
+        QueryResults {
+            results: vec![Arc::new(x)],
+        }
+    }
+}
+
+impl From<Arc<QueryResult>> for QueryResults {
+    fn from(x: Arc<QueryResult>) -> Self {
+        QueryResults { results: vec![x] }
+    }
+}
+
+impl From<QueryExecutionError> for QueryResults {
+    fn from(x: QueryExecutionError) -> Self {
+        QueryResults {
+            results: vec![Arc::new(x.into())],
+        }
+    }
+}
+
+impl From<Vec<QueryExecutionError>> for QueryResults {
+    fn from(x: Vec<QueryExecutionError>) -> Self {
+        QueryResults {
+            results: vec![Arc::new(x.into())],
+        }
+    }
+}
+
+impl QueryResults {
+    pub fn append(&mut self, other: Arc<QueryResult>) {
+        self.results.push(other);
+    }
+
+    pub fn as_http_response<T: From<String>>(&self) -> http::Response<T> {
+        let status_code = http::StatusCode::OK;
+        let json =
+            serde_json::to_string(self).expect("Failed to serialize GraphQL response to JSON");
+        http::Response::builder()
+            .status(status_code)
+            .header(ACCESS_CONTROL_ALLOW_ORIGIN, "*")
+            .header(ACCESS_CONTROL_ALLOW_HEADERS, "Content-Type, User-Agent")
+            .header(ACCESS_CONTROL_ALLOW_METHODS, "GET, OPTIONS, POST")
+            .header(CONTENT_TYPE, "application/json")
+            .header(
+                "Graph-Attestable",
+                self.results.iter().all(|r| r.is_attestable()).to_string(),
+            )
+            .body(T::from(json))
+            .unwrap()
+    }
+}
+
+/// The result of running a query, if successful.
+#[derive(Debug, Default, Serialize)]
+pub struct QueryResult {
+    #[serde(
+        skip_serializing_if = "Option::is_none",
+        serialize_with = "serialize_data"
+    )]
+    data: Option<Data>,
+    #[serde(skip_serializing_if = "Vec::is_empty")]
+    errors: Vec<QueryError>,
+    #[serde(skip_serializing)]
+    pub deployment: Option<DeploymentHash>,
+    #[serde(skip_serializing)]
+    pub trace: Trace,
+}
+
+impl QueryResult {
+    pub fn new(data: Data) -> Self {
+        QueryResult {
+            data: Some(data),
+            errors: Vec::new(),
+            deployment: None,
+            trace: Trace::None,
+        }
+    }
+
+    /// This is really `clone`, but we do not want to implement `Clone`;
+    /// this is only meant for test purposes and should not be used in production
+    /// code since cloning query results can be very expensive
+    pub fn duplicate(&self) -> Self {
+        Self {
+            data: self.data.clone(),
+            errors: self.errors.clone(),
+            deployment: self.deployment.clone(),
+            trace: Trace::None,
+        }
+    }
+
+    pub fn has_errors(&self) -> bool {
+        !self.errors.is_empty()
+    }
+
+    pub fn not_found(&self) -> bool {
+        self.errors.iter().any(|e| {
+            matches!(
+                e,
+                QueryError::ExecutionError(QueryExecutionError::DeploymentNotFound(_))
+            )
+        })
+    }
+
+    pub fn has_data(&self) -> bool {
+        self.data.is_some()
+    }
+
+    pub fn is_attestable(&self) -> bool {
+        self.errors.iter().all(|err| err.is_attestable())
+    }
+
+    pub fn to_result(self) -> Result<Option<r::Value>, Vec<QueryError>> {
+        if self.has_errors() {
+            Err(self.errors)
+        } else {
+            Ok(self.data.map(r::Value::Object))
+        }
+    }
+
+    pub fn take_data(&mut self) -> Option<Data> {
+        self.data.take()
+    }
+
+    pub fn set_data(&mut self, data: Option<Data>) {
+        self.data = data
+    }
+
+    pub fn errors_mut(&mut self) -> &mut Vec<QueryError> {
+        &mut self.errors
+    }
+
+    pub fn data(&self) -> Option<&Data> {
+        self.data.as_ref()
+    }
+}
+
+impl From<QueryExecutionError> for QueryResult {
+    fn from(e: QueryExecutionError) -> Self {
+        QueryResult {
+            data: None,
+            errors: vec![e.into()],
+            deployment: None,
+            trace: Trace::None,
+        }
+    }
+}
+
+impl From<QueryError> for QueryResult {
+    fn from(e: QueryError) -> Self {
+        QueryResult {
+            data: None,
+            errors: vec![e],
+            deployment: None,
+            trace: Trace::None,
+        }
+    }
+}
+
+impl From<Vec<QueryExecutionError>> for QueryResult {
+    fn from(e: Vec<QueryExecutionError>) -> Self {
+        QueryResult {
+            data: None,
+            errors: e.into_iter().map(QueryError::from).collect(),
+            deployment: None,
+            trace: Trace::None,
+        }
+    }
+}
+
+impl From<Object> for QueryResult {
+    fn from(val: Object) -> Self {
+        QueryResult::new(val)
+    }
+}
+
+impl From<(Object, Trace)> for QueryResult {
+    fn from((val, trace): (Object, Trace)) -> Self {
+        let mut res = QueryResult::new(val);
+        res.trace = trace;
+        res
+    }
+}
+
+impl TryFrom<r::Value> for QueryResult {
+    type Error = &'static str;
+
+    fn try_from(value: r::Value) -> Result<Self, Self::Error> {
+        match value {
+            r::Value::Object(map) => Ok(QueryResult::from(map)),
+            _ => Err("only objects can be turned into a QueryResult"),
+        }
+    }
+}
+
+impl<V: Into<QueryResult>, E: Into<QueryResult>> From<Result<V, E>> for QueryResult {
+    fn from(result: Result<V, E>) -> Self {
+        match result {
+            Ok(v) => v.into(),
+            Err(e) => e.into(),
+        }
+    }
+}
+
+impl CacheWeight for QueryResult {
+    fn indirect_weight(&self) -> usize {
+        self.data.indirect_weight() + self.errors.indirect_weight()
+    }
+}
+
+// Check that when we serialize a `QueryResult` with multiple entries
+// in `data` it appears as if we serialized one big map
+#[test]
+fn multiple_data_items() {
+    use serde_json::json;
+
+    fn make_obj(key: &str, value: &str) -> Arc<QueryResult> {
+        let obj = Object::from_iter([(key.to_owned(), r::Value::String(value.to_owned()))]);
+        Arc::new(obj.into())
+    }
+
+    let obj1 = make_obj("key1", "value1");
+    let obj2 = make_obj("key2", "value2");
+
+    let mut res = QueryResults::empty();
+    res.append(obj1);
+    res.append(obj2);
+
+    let expected =
+        serde_json::to_string(&json!({"data":{"key1": "value1", "key2": "value2"}})).unwrap();
+    let actual = serde_json::to_string(&res).unwrap();
+    assert_eq!(expected, actual)
+}
diff --git a/graph/src/data/query/trace.rs b/graph/src/data/query/trace.rs
new file mode 100644
index 0000000..11a26e0
--- /dev/null
+++ b/graph/src/data/query/trace.rs
@@ -0,0 +1,77 @@
+use std::{
+    sync::{Arc, Mutex},
+    time::Duration,
+};
+
+use serde::Serialize;
+
+use crate::env::ENV_VARS;
+
+#[derive(Debug, Serialize)]
+pub enum Trace {
+    None,
+    Root {
+        query: Arc<String>,
+        elapsed: Mutex<Duration>,
+        children: Vec<(String, Trace)>,
+    },
+    Query {
+        query: String,
+        elapsed: Duration,
+        entity_count: usize,
+
+        children: Vec<(String, Trace)>,
+    },
+}
+
+impl Default for Trace {
+    fn default() -> Self {
+        Self::None
+    }
+}
+
+impl Trace {
+    pub fn root(query: Arc<String>) -> Trace {
+        if ENV_VARS.log_sql_timing() || ENV_VARS.log_gql_timing() {
+            return Trace::Root {
+                query,
+                elapsed: Mutex::new(Duration::from_millis(0)),
+                children: Vec::new(),
+            };
+        } else {
+            Trace::None
+        }
+    }
+
+    pub fn finish(&self, dur: Duration) {
+        match self {
+            Trace::None | Trace::Query { .. } => { /* nothing to do */ }
+            Trace::Root { elapsed, .. } => *elapsed.lock().unwrap() = dur,
+        }
+    }
+
+    pub fn query(query: &str, elapsed: Duration, entity_count: usize) -> Trace {
+        Trace::Query {
+            query: query.to_string(),
+            elapsed,
+            entity_count,
+            children: Vec::new(),
+        }
+    }
+
+    pub fn push(&mut self, name: &str, trace: Trace) {
+        match (self, &trace) {
+            (Self::Root { children, .. }, Self::Query { .. }) => {
+                children.push((name.to_string(), trace))
+            }
+            (Self::Query { children, .. }, Self::Query { .. }) => {
+                children.push((name.to_string(), trace))
+            }
+            (Self::None, Self::None) | (Self::Root { .. }, Self::None) => { /* tracing is turned off */
+            }
+            (s, t) => {
+                unreachable!("can not add child self: {:#?} trace: {:#?}", s, t)
+            }
+        }
+    }
+}
diff --git a/graph/src/data/schema.rs b/graph/src/data/schema.rs
new file mode 100644
index 0000000..20de5cd
--- /dev/null
+++ b/graph/src/data/schema.rs
@@ -0,0 +1,1954 @@
+use crate::cheap_clone::CheapClone;
+use crate::components::store::{EntityKey, EntityType, SubgraphStore};
+use crate::data::graphql::ext::{DirectiveExt, DirectiveFinder, DocumentExt, TypeExt, ValueExt};
+use crate::data::graphql::ObjectTypeExt;
+use crate::data::store::{self, ValueType};
+use crate::data::subgraph::{DeploymentHash, SubgraphName};
+use crate::prelude::{
+    anyhow, lazy_static,
+    q::Value,
+    s::{self, Definition, InterfaceType, ObjectType, TypeDefinition, *},
+};
+
+use anyhow::{Context, Error};
+use graphql_parser::{self, Pos};
+use inflector::Inflector;
+use itertools::Itertools;
+use serde::{Deserialize, Serialize};
+use thiserror::Error;
+
+use std::collections::{BTreeMap, HashMap, HashSet};
+use std::convert::TryFrom;
+use std::fmt;
+use std::hash::Hash;
+use std::iter::FromIterator;
+use std::str::FromStr;
+use std::sync::Arc;
+
+use super::graphql::ObjectOrInterface;
+use super::store::scalar;
+
+pub const SCHEMA_TYPE_NAME: &str = "_Schema_";
+
+pub const META_FIELD_TYPE: &str = "_Meta_";
+pub const META_FIELD_NAME: &str = "_meta";
+
+pub const BLOCK_FIELD_TYPE: &str = "_Block_";
+
+#[derive(Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]
+pub struct Strings(Vec<String>);
+
+impl fmt::Display for Strings {
+    fn fmt(&self, f: &mut fmt::Formatter) -> Result<(), fmt::Error> {
+        let s = (&self.0).join(", ");
+        write!(f, "{}", s)
+    }
+}
+
+#[derive(Debug, Error, PartialEq, Eq)]
+pub enum SchemaValidationError {
+    #[error("Interface `{0}` not defined")]
+    InterfaceUndefined(String),
+
+    #[error("@entity directive missing on the following types: `{0}`")]
+    EntityDirectivesMissing(Strings),
+
+    #[error(
+        "Entity type `{0}` does not satisfy interface `{1}` because it is missing \
+         the following fields: {2}"
+    )]
+    InterfaceFieldsMissing(String, String, Strings), // (type, interface, missing_fields)
+    #[error("Implementors of interface `{0}` use different id types `{1}`. They must all use the same type")]
+    InterfaceImplementorsMixId(String, String),
+    #[error("Field `{1}` in type `{0}` has invalid @derivedFrom: {2}")]
+    InvalidDerivedFrom(String, String, String), // (type, field, reason)
+    #[error("The following type names are reserved: `{0}`")]
+    UsageOfReservedTypes(Strings),
+    #[error("_Schema_ type is only for @imports and must not have any fields")]
+    SchemaTypeWithFields,
+    #[error("Imported subgraph name `{0}` is invalid")]
+    ImportedSubgraphNameInvalid(String),
+    #[error("Imported subgraph id `{0}` is invalid")]
+    ImportedSubgraphIdInvalid(String),
+    #[error("The _Schema_ type only allows @import directives")]
+    InvalidSchemaTypeDirectives,
+    #[error(
+        r#"@import directives must have the form \
+@import(types: ["A", {{ name: "B", as: "C"}}], from: {{ name: "org/subgraph"}}) or \
+@import(types: ["A", {{ name: "B", as: "C"}}], from: {{ id: "Qm..."}})"#
+    )]
+    ImportDirectiveInvalid,
+    #[error("Type `{0}`, field `{1}`: type `{2}` is neither defined nor imported")]
+    FieldTypeUnknown(String, String, String), // (type_name, field_name, field_type)
+    #[error("Imported type `{0}` does not exist in the `{1}` schema")]
+    ImportedTypeUndefined(String, String), // (type_name, schema)
+    #[error("Fulltext directive name undefined")]
+    FulltextNameUndefined,
+    #[error("Fulltext directive name overlaps with type: {0}")]
+    FulltextNameConflict(String),
+    #[error("Fulltext directive name overlaps with an existing entity field or a top-level query field: {0}")]
+    FulltextNameCollision(String),
+    #[error("Fulltext language is undefined")]
+    FulltextLanguageUndefined,
+    #[error("Fulltext language is invalid: {0}")]
+    FulltextLanguageInvalid(String),
+    #[error("Fulltext algorithm is undefined")]
+    FulltextAlgorithmUndefined,
+    #[error("Fulltext algorithm is invalid: {0}")]
+    FulltextAlgorithmInvalid(String),
+    #[error("Fulltext include is invalid")]
+    FulltextIncludeInvalid,
+    #[error("Fulltext directive requires an 'include' list")]
+    FulltextIncludeUndefined,
+    #[error("Fulltext 'include' list must contain an object")]
+    FulltextIncludeObjectMissing,
+    #[error(
+        "Fulltext 'include' object must contain 'entity' (String) and 'fields' (List) attributes"
+    )]
+    FulltextIncludeEntityMissingOrIncorrectAttributes,
+    #[error("Fulltext directive includes an entity not found on the subgraph schema")]
+    FulltextIncludedEntityNotFound,
+    #[error("Fulltext include field must have a 'name' attribute")]
+    FulltextIncludedFieldMissingRequiredProperty,
+    #[error("Fulltext entity field, {0}, not found or not a string")]
+    FulltextIncludedFieldInvalid(String),
+}
+
+#[derive(Clone, Debug, PartialEq)]
+pub enum FulltextLanguage {
+    Simple,
+    Danish,
+    Dutch,
+    English,
+    Finnish,
+    French,
+    German,
+    Hungarian,
+    Italian,
+    Norwegian,
+    Portugese,
+    Romanian,
+    Russian,
+    Spanish,
+    Swedish,
+    Turkish,
+}
+
+impl TryFrom<&str> for FulltextLanguage {
+    type Error = String;
+    fn try_from(language: &str) -> Result<Self, Self::Error> {
+        match &language[..] {
+            "simple" => Ok(FulltextLanguage::Simple),
+            "da" => Ok(FulltextLanguage::Danish),
+            "nl" => Ok(FulltextLanguage::Dutch),
+            "en" => Ok(FulltextLanguage::English),
+            "fi" => Ok(FulltextLanguage::Finnish),
+            "fr" => Ok(FulltextLanguage::French),
+            "de" => Ok(FulltextLanguage::German),
+            "hu" => Ok(FulltextLanguage::Hungarian),
+            "it" => Ok(FulltextLanguage::Italian),
+            "no" => Ok(FulltextLanguage::Norwegian),
+            "pt" => Ok(FulltextLanguage::Portugese),
+            "ro" => Ok(FulltextLanguage::Romanian),
+            "ru" => Ok(FulltextLanguage::Russian),
+            "es" => Ok(FulltextLanguage::Spanish),
+            "sv" => Ok(FulltextLanguage::Swedish),
+            "tr" => Ok(FulltextLanguage::Turkish),
+            invalid => Err(format!(
+                "Provided language for fulltext search is invalid: {}",
+                invalid
+            )),
+        }
+    }
+}
+
+impl FulltextLanguage {
+    pub fn as_str(&self) -> &'static str {
+        match self {
+            Self::Simple => "simple",
+            Self::Danish => "danish",
+            Self::Dutch => "dutch",
+            Self::English => "english",
+            Self::Finnish => "finnish",
+            Self::French => "french",
+            Self::German => "german",
+            Self::Hungarian => "hungarian",
+            Self::Italian => "italian",
+            Self::Norwegian => "norwegian",
+            Self::Portugese => "portugese",
+            Self::Romanian => "romanian",
+            Self::Russian => "russian",
+            Self::Spanish => "spanish",
+            Self::Swedish => "swedish",
+            Self::Turkish => "turkish",
+        }
+    }
+}
+
+#[derive(Clone, Debug, PartialEq)]
+pub enum FulltextAlgorithm {
+    Rank,
+    ProximityRank,
+}
+
+impl TryFrom<&str> for FulltextAlgorithm {
+    type Error = String;
+    fn try_from(algorithm: &str) -> Result<Self, Self::Error> {
+        match algorithm {
+            "rank" => Ok(FulltextAlgorithm::Rank),
+            "proximityRank" => Ok(FulltextAlgorithm::ProximityRank),
+            invalid => Err(format!(
+                "The provided fulltext search algorithm {} is invalid. It must be one of: rank, proximityRank",
+                invalid,
+            )),
+        }
+    }
+}
+
+#[derive(Clone, Debug, PartialEq)]
+pub struct FulltextConfig {
+    pub language: FulltextLanguage,
+    pub algorithm: FulltextAlgorithm,
+}
+
+pub struct FulltextDefinition {
+    pub config: FulltextConfig,
+    pub included_fields: HashSet<String>,
+    pub name: String,
+}
+
+impl From<&s::Directive> for FulltextDefinition {
+    // Assumes the input is a Fulltext Directive that has already been validated because it makes
+    // liberal use of unwrap() where specific types are expected
+    fn from(directive: &Directive) -> Self {
+        let name = directive.argument("name").unwrap().as_str().unwrap();
+
+        let algorithm = FulltextAlgorithm::try_from(
+            directive.argument("algorithm").unwrap().as_enum().unwrap(),
+        )
+        .unwrap();
+
+        let language =
+            FulltextLanguage::try_from(directive.argument("language").unwrap().as_enum().unwrap())
+                .unwrap();
+
+        let included_entity_list = directive.argument("include").unwrap().as_list().unwrap();
+        // Currently fulltext query fields are limited to 1 entity, so we just take the first (and only) included Entity
+        let included_entity = included_entity_list.first().unwrap().as_object().unwrap();
+        let included_field_values = included_entity.get("fields").unwrap().as_list().unwrap();
+        let included_fields: HashSet<String> = included_field_values
+            .iter()
+            .map(|field| {
+                field
+                    .as_object()
+                    .unwrap()
+                    .get("name")
+                    .unwrap()
+                    .as_str()
+                    .unwrap()
+                    .into()
+            })
+            .collect();
+
+        FulltextDefinition {
+            config: FulltextConfig {
+                language,
+                algorithm,
+            },
+            included_fields,
+            name: name.into(),
+        }
+    }
+}
+#[derive(Debug, Error, PartialEq, Eq, Clone)]
+pub enum SchemaImportError {
+    #[error("Schema for imported subgraph `{0}` was not found")]
+    ImportedSchemaNotFound(SchemaReference),
+    #[error("Subgraph for imported schema `{0}` is not deployed")]
+    ImportedSubgraphNotFound(SchemaReference),
+}
+
+/// The representation of a single type from an import statement. This
+/// corresponds either to a string `"Thing"` or an object
+/// `{name: "Thing", as: "Stuff"}`. The first form is equivalent to
+/// `{name: "Thing", as: "Thing"}`
+#[derive(Clone, Debug, PartialEq, Eq, Hash)]
+pub struct ImportedType {
+    /// The 'name'
+    name: String,
+    /// The 'as' alias or a copy of `name` if the user did not specify an alias
+    alias: String,
+    /// Whether the alias was explicitly given or is just a copy of the name
+    explicit: bool,
+}
+
+impl fmt::Display for ImportedType {
+    fn fmt(&self, f: &mut fmt::Formatter) -> Result<(), fmt::Error> {
+        if self.explicit {
+            write!(f, "name: {}, as: {}", self.name, self.alias)
+        } else {
+            write!(f, "{}", self.name)
+        }
+    }
+}
+
+impl ImportedType {
+    fn parse(type_import: &Value) -> Option<Self> {
+        match type_import {
+            Value::String(type_name) => Some(ImportedType {
+                name: type_name.to_string(),
+                alias: type_name.to_string(),
+                explicit: false,
+            }),
+            Value::Object(type_name_as) => {
+                match (type_name_as.get("name"), type_name_as.get("as")) {
+                    (Some(name), Some(az)) => Some(ImportedType {
+                        name: name.to_string(),
+                        alias: az.to_string(),
+                        explicit: true,
+                    }),
+                    _ => None,
+                }
+            }
+            _ => None,
+        }
+    }
+}
+
+#[derive(Clone, Debug, PartialEq, Eq, Hash)]
+pub struct SchemaReference {
+    subgraph: DeploymentHash,
+}
+
+impl fmt::Display for SchemaReference {
+    fn fmt(&self, f: &mut fmt::Formatter) -> Result<(), fmt::Error> {
+        write!(f, "{}", self.subgraph)
+    }
+}
+
+impl SchemaReference {
+    fn new(subgraph: DeploymentHash) -> Self {
+        SchemaReference { subgraph }
+    }
+
+    pub fn resolve<S: SubgraphStore>(
+        &self,
+        store: Arc<S>,
+    ) -> Result<Arc<Schema>, SchemaImportError> {
+        store
+            .input_schema(&self.subgraph)
+            .map_err(|_| SchemaImportError::ImportedSchemaNotFound(self.clone()))
+    }
+
+    fn parse(value: &Value) -> Option<Self> {
+        match value {
+            Value::Object(map) => match map.get("id") {
+                Some(Value::String(id)) => match DeploymentHash::new(id) {
+                    Ok(id) => Some(SchemaReference::new(id)),
+                    _ => None,
+                },
+                _ => None,
+            },
+            _ => None,
+        }
+    }
+}
+
+#[derive(Debug)]
+pub struct ApiSchema {
+    schema: Schema,
+
+    // Root types for the api schema.
+    pub query_type: Arc<ObjectType>,
+    pub subscription_type: Option<Arc<ObjectType>>,
+    object_types: HashMap<String, Arc<ObjectType>>,
+}
+
+impl ApiSchema {
+    /// `api_schema` will typically come from `fn api_schema` in the graphql
+    /// crate.
+    ///
+    /// In addition, the API schema has an introspection schema mixed into
+    /// `api_schema`. In particular, the `Query` type has fields called
+    /// `__schema` and `__type`
+    pub fn from_api_schema(mut api_schema: Schema) -> Result<Self, anyhow::Error> {
+        add_introspection_schema(&mut api_schema.document);
+
+        let query_type = api_schema
+            .document
+            .get_root_query_type()
+            .context("no root `Query` in the schema")?
+            .clone();
+        let subscription_type = api_schema
+            .document
+            .get_root_subscription_type()
+            .cloned()
+            .map(Arc::new);
+
+        let object_types = HashMap::from_iter(
+            api_schema
+                .document
+                .get_object_type_definitions()
+                .into_iter()
+                .map(|obj_type| (obj_type.name.clone(), Arc::new(obj_type.clone()))),
+        );
+
+        Ok(Self {
+            schema: api_schema,
+            query_type: Arc::new(query_type),
+            subscription_type,
+            object_types,
+        })
+    }
+
+    pub fn document(&self) -> &s::Document {
+        &self.schema.document
+    }
+
+    pub fn id(&self) -> &DeploymentHash {
+        &self.schema.id
+    }
+
+    pub fn schema(&self) -> &Schema {
+        &self.schema
+    }
+
+    pub fn types_for_interface(&self) -> &BTreeMap<EntityType, Vec<ObjectType>> {
+        &self.schema.types_for_interface
+    }
+
+    /// Returns `None` if the type implements no interfaces.
+    pub fn interfaces_for_type(&self, type_name: &EntityType) -> Option<&Vec<InterfaceType>> {
+        self.schema.interfaces_for_type(type_name)
+    }
+
+    /// Return an `Arc` around the `ObjectType` from our internal cache
+    ///
+    /// # Panics
+    /// If `obj_type` is not part of this schema, this function panics
+    pub fn object_type(&self, obj_type: &ObjectType) -> Arc<ObjectType> {
+        self.object_types
+            .get(&obj_type.name)
+            .expect("ApiSchema.object_type is only used with existing types")
+            .cheap_clone()
+    }
+
+    pub fn get_named_type(&self, name: &str) -> Option<&TypeDefinition> {
+        self.schema.document.get_named_type(name)
+    }
+
+    /// Returns true if the given type is an input type.
+    ///
+    /// Uses the algorithm outlined on
+    /// https://facebook.github.io/graphql/draft/#IsInputType().
+    pub fn is_input_type(&self, t: &s::Type) -> bool {
+        match t {
+            s::Type::NamedType(name) => {
+                let named_type = self.get_named_type(name);
+                named_type.map_or(false, |type_def| match type_def {
+                    s::TypeDefinition::Scalar(_)
+                    | s::TypeDefinition::Enum(_)
+                    | s::TypeDefinition::InputObject(_) => true,
+                    _ => false,
+                })
+            }
+            s::Type::ListType(inner) => self.is_input_type(inner),
+            s::Type::NonNullType(inner) => self.is_input_type(inner),
+        }
+    }
+
+    pub fn get_root_query_type_def(&self) -> Option<&s::TypeDefinition> {
+        self.schema
+            .document
+            .definitions
+            .iter()
+            .find_map(|d| match d {
+                s::Definition::TypeDefinition(def @ s::TypeDefinition::Object(_)) => match def {
+                    s::TypeDefinition::Object(t) if t.name == "Query" => Some(def),
+                    _ => None,
+                },
+                _ => None,
+            })
+    }
+
+    pub fn object_or_interface(&self, name: &str) -> Option<ObjectOrInterface<'_>> {
+        if name.starts_with("__") {
+            INTROSPECTION_SCHEMA.object_or_interface(name)
+        } else {
+            self.schema.document.object_or_interface(name)
+        }
+    }
+
+    /// Returns the type definition that a field type corresponds to.
+    pub fn get_type_definition_from_field<'a>(
+        &'a self,
+        field: &s::Field,
+    ) -> Option<&'a s::TypeDefinition> {
+        self.get_type_definition_from_type(&field.field_type)
+    }
+
+    /// Returns the type definition for a type.
+    pub fn get_type_definition_from_type<'a>(
+        &'a self,
+        t: &s::Type,
+    ) -> Option<&'a s::TypeDefinition> {
+        match t {
+            s::Type::NamedType(name) => self.get_named_type(name),
+            s::Type::ListType(inner) => self.get_type_definition_from_type(inner),
+            s::Type::NonNullType(inner) => self.get_type_definition_from_type(inner),
+        }
+    }
+
+    #[cfg(debug_assertions)]
+    pub fn definitions(&self) -> impl Iterator<Item = &s::Definition<'static, String>> {
+        self.schema.document.definitions.iter()
+    }
+}
+
+lazy_static! {
+    static ref INTROSPECTION_SCHEMA: Document = {
+        let schema = include_str!("introspection.graphql");
+        parse_schema(schema).expect("the schema `introspection.graphql` is invalid")
+    };
+}
+
+fn add_introspection_schema(schema: &mut Document) {
+    fn introspection_fields() -> Vec<Field> {
+        // Generate fields for the root query fields in an introspection schema,
+        // the equivalent of the fields of the `Query` type:
+        //
+        // type Query {
+        //   __schema: __Schema!
+        //   __type(name: String!): __Type
+        // }
+
+        let type_args = vec![InputValue {
+            position: Pos::default(),
+            description: None,
+            name: "name".to_string(),
+            value_type: Type::NonNullType(Box::new(Type::NamedType("String".to_string()))),
+            default_value: None,
+            directives: vec![],
+        }];
+
+        vec![
+            Field {
+                position: Pos::default(),
+                description: None,
+                name: "__schema".to_string(),
+                arguments: vec![],
+                field_type: Type::NonNullType(Box::new(Type::NamedType("__Schema".to_string()))),
+                directives: vec![],
+            },
+            Field {
+                position: Pos::default(),
+                description: None,
+                name: "__type".to_string(),
+                arguments: type_args,
+                field_type: Type::NamedType("__Type".to_string()),
+                directives: vec![],
+            },
+        ]
+    }
+
+    schema
+        .definitions
+        .extend(INTROSPECTION_SCHEMA.definitions.iter().cloned());
+
+    let query_type = schema
+        .definitions
+        .iter_mut()
+        .filter_map(|d| match d {
+            Definition::TypeDefinition(TypeDefinition::Object(t)) if t.name == "Query" => Some(t),
+            _ => None,
+        })
+        .peekable()
+        .next()
+        .expect("no root `Query` in the schema");
+    query_type.fields.append(&mut introspection_fields());
+}
+
+/// A validated and preprocessed GraphQL schema for a subgraph.
+#[derive(Clone, Debug, PartialEq)]
+pub struct Schema {
+    pub id: DeploymentHash,
+    pub document: s::Document,
+
+    // Maps type name to implemented interfaces.
+    pub interfaces_for_type: BTreeMap<EntityType, Vec<InterfaceType>>,
+
+    // Maps an interface name to the list of entities that implement it.
+    pub types_for_interface: BTreeMap<EntityType, Vec<ObjectType>>,
+
+    immutable_types: HashSet<EntityType>,
+}
+
+impl Schema {
+    /// Create a new schema. The document must already have been validated
+    //
+    // TODO: The way some validation is expected to be done beforehand, and
+    // some is done here makes it incredibly murky whether a `Schema` is
+    // fully validated. The code should be changed to make sure that a
+    // `Schema` is always fully valid
+    pub fn new(id: DeploymentHash, document: s::Document) -> Result<Self, SchemaValidationError> {
+        let (interfaces_for_type, types_for_interface) = Self::collect_interfaces(&document)?;
+        let immutable_types = Self::collect_immutable_types(&document);
+
+        let mut schema = Schema {
+            id: id.clone(),
+            document,
+            interfaces_for_type,
+            types_for_interface,
+            immutable_types,
+        };
+
+        schema.add_subgraph_id_directives(id);
+
+        Ok(schema)
+    }
+
+    /// Construct a value for the entity type's id attribute
+    pub fn id_value(&self, key: &EntityKey) -> Result<store::Value, Error> {
+        let base_type = self
+            .document
+            .get_object_type_definition(key.entity_type.as_str())
+            .ok_or_else(|| {
+                anyhow!(
+                    "Entity {}[{}]: unknown entity type `{}`",
+                    key.entity_type,
+                    key.entity_id,
+                    key.entity_type
+                )
+            })?
+            .field("id")
+            .unwrap()
+            .field_type
+            .get_base_type();
+
+        match base_type {
+            "ID" | "String" => Ok(store::Value::String(key.entity_id.to_string())),
+            "Bytes" => Ok(store::Value::Bytes(scalar::Bytes::from_str(
+                &key.entity_id,
+            )?)),
+            s => {
+                return Err(anyhow!(
+                    "Entity type {} uses illegal type {} for id column",
+                    key.entity_type,
+                    s
+                ))
+            }
+        }
+    }
+
+    pub fn is_immutable(&self, entity_type: &EntityType) -> bool {
+        self.immutable_types.contains(entity_type)
+    }
+
+    pub fn resolve_schema_references<S: SubgraphStore>(
+        &self,
+        store: Arc<S>,
+    ) -> (
+        HashMap<SchemaReference, Arc<Schema>>,
+        Vec<SchemaImportError>,
+    ) {
+        let mut schemas = HashMap::new();
+        let mut visit_log = HashSet::new();
+        let import_errors = self.resolve_import_graph(store, &mut schemas, &mut visit_log);
+        (schemas, import_errors)
+    }
+
+    fn resolve_import_graph<S: SubgraphStore>(
+        &self,
+        store: Arc<S>,
+        schemas: &mut HashMap<SchemaReference, Arc<Schema>>,
+        visit_log: &mut HashSet<DeploymentHash>,
+    ) -> Vec<SchemaImportError> {
+        // Use the visit log to detect cycles in the import graph
+        self.imported_schemas()
+            .into_iter()
+            .fold(vec![], |mut errors, schema_ref| {
+                match schema_ref.resolve(store.clone()) {
+                    Ok(schema) => {
+                        schemas.insert(schema_ref, schema.clone());
+                        // If this node in the graph has already been visited stop traversing
+                        if !visit_log.contains(&schema.id) {
+                            visit_log.insert(schema.id.clone());
+                            errors.extend(schema.resolve_import_graph(
+                                store.clone(),
+                                schemas,
+                                visit_log,
+                            ));
+                        }
+                    }
+                    Err(err) => {
+                        errors.push(err);
+                    }
+                }
+                errors
+            })
+    }
+
+    fn collect_interfaces(
+        document: &s::Document,
+    ) -> Result<
+        (
+            BTreeMap<EntityType, Vec<InterfaceType>>,
+            BTreeMap<EntityType, Vec<ObjectType>>,
+        ),
+        SchemaValidationError,
+    > {
+        // Initialize with an empty vec for each interface, so we don't
+        // miss interfaces that have no implementors.
+        let mut types_for_interface =
+            BTreeMap::from_iter(document.definitions.iter().filter_map(|d| match d {
+                Definition::TypeDefinition(TypeDefinition::Interface(t)) => {
+                    Some((EntityType::from(t), vec![]))
+                }
+                _ => None,
+            }));
+        let mut interfaces_for_type = BTreeMap::<_, Vec<_>>::new();
+
+        for object_type in document.get_object_type_definitions() {
+            for implemented_interface in object_type.implements_interfaces.clone() {
+                let interface_type = document
+                    .definitions
+                    .iter()
+                    .find_map(|def| match def {
+                        Definition::TypeDefinition(TypeDefinition::Interface(i))
+                            if i.name.eq(&implemented_interface) =>
+                        {
+                            Some(i.clone())
+                        }
+                        _ => None,
+                    })
+                    .ok_or_else(|| {
+                        SchemaValidationError::InterfaceUndefined(implemented_interface.clone())
+                    })?;
+
+                Self::validate_interface_implementation(object_type, &interface_type)?;
+
+                interfaces_for_type
+                    .entry(EntityType::from(object_type))
+                    .or_default()
+                    .push(interface_type);
+                types_for_interface
+                    .get_mut(&EntityType::new(implemented_interface))
+                    .unwrap()
+                    .push(object_type.clone());
+            }
+        }
+
+        Ok((interfaces_for_type, types_for_interface))
+    }
+
+    fn collect_immutable_types(document: &s::Document) -> HashSet<EntityType> {
+        HashSet::from_iter(
+            document
+                .get_object_type_definitions()
+                .into_iter()
+                .filter(|obj_type| obj_type.is_immutable())
+                .map(Into::into),
+        )
+    }
+
+    pub fn parse(raw: &str, id: DeploymentHash) -> Result<Self, Error> {
+        let document = graphql_parser::parse_schema(raw)?.into_static();
+
+        Schema::new(id, document).map_err(Into::into)
+    }
+
+    fn imported_types(&self) -> HashMap<ImportedType, SchemaReference> {
+        fn parse_types(import: &Directive) -> Vec<ImportedType> {
+            import
+                .argument("types")
+                .map_or(vec![], |value| match value {
+                    Value::List(types) => types.iter().filter_map(ImportedType::parse).collect(),
+                    _ => vec![],
+                })
+        }
+
+        self.subgraph_schema_object_type()
+            .map_or(HashMap::new(), |object| {
+                object
+                    .directives
+                    .iter()
+                    .filter(|directive| directive.name.eq("import"))
+                    .map(|import| {
+                        import.argument("from").map_or(vec![], |from| {
+                            SchemaReference::parse(from).map_or(vec![], |schema_ref| {
+                                parse_types(import)
+                                    .into_iter()
+                                    .map(|imported_type| (imported_type, schema_ref.clone()))
+                                    .collect()
+                            })
+                        })
+                    })
+                    .flatten()
+                    .collect::<HashMap<ImportedType, SchemaReference>>()
+            })
+    }
+
+    pub fn imported_schemas(&self) -> Vec<SchemaReference> {
+        self.subgraph_schema_object_type().map_or(vec![], |object| {
+            object
+                .directives
+                .iter()
+                .filter(|directive| directive.name.eq("import"))
+                .filter_map(|directive| directive.argument("from"))
+                .filter_map(SchemaReference::parse)
+                .collect()
+        })
+    }
+
+    pub fn name_argument_value_from_directive(directive: &Directive) -> Value {
+        directive
+            .argument("name")
+            .expect("fulltext directive must have name argument")
+            .clone()
+    }
+
+    /// Returned map has one an entry for each interface in the schema.
+    pub fn types_for_interface(&self) -> &BTreeMap<EntityType, Vec<ObjectType>> {
+        &self.types_for_interface
+    }
+
+    /// Returns `None` if the type implements no interfaces.
+    pub fn interfaces_for_type(&self, type_name: &EntityType) -> Option<&Vec<InterfaceType>> {
+        self.interfaces_for_type.get(type_name)
+    }
+
+    // Adds a @subgraphId(id: ...) directive to object/interface/enum types in the schema.
+    pub fn add_subgraph_id_directives(&mut self, id: DeploymentHash) {
+        for definition in self.document.definitions.iter_mut() {
+            let subgraph_id_argument = (String::from("id"), s::Value::String(id.to_string()));
+
+            let subgraph_id_directive = s::Directive {
+                name: "subgraphId".to_string(),
+                position: Pos::default(),
+                arguments: vec![subgraph_id_argument],
+            };
+
+            if let Definition::TypeDefinition(ref mut type_definition) = definition {
+                let (name, directives) = match type_definition {
+                    TypeDefinition::Object(object_type) => {
+                        (&object_type.name, &mut object_type.directives)
+                    }
+                    TypeDefinition::Interface(interface_type) => {
+                        (&interface_type.name, &mut interface_type.directives)
+                    }
+                    TypeDefinition::Enum(enum_type) => (&enum_type.name, &mut enum_type.directives),
+                    TypeDefinition::Scalar(scalar_type) => {
+                        (&scalar_type.name, &mut scalar_type.directives)
+                    }
+                    TypeDefinition::InputObject(input_object_type) => {
+                        (&input_object_type.name, &mut input_object_type.directives)
+                    }
+                    TypeDefinition::Union(union_type) => {
+                        (&union_type.name, &mut union_type.directives)
+                    }
+                };
+
+                if !name.eq(SCHEMA_TYPE_NAME)
+                    && !directives
+                        .iter()
+                        .any(|directive| directive.name.eq("subgraphId"))
+                {
+                    directives.push(subgraph_id_directive);
+                }
+            };
+        }
+    }
+
+    pub fn validate(
+        &self,
+        schemas: &HashMap<SchemaReference, Arc<Schema>>,
+    ) -> Result<(), Vec<SchemaValidationError>> {
+        let mut errors: Vec<SchemaValidationError> = [
+            self.validate_schema_types(),
+            self.validate_derived_from(),
+            self.validate_schema_type_has_no_fields(),
+            self.validate_directives_on_schema_type(),
+            self.validate_reserved_types_usage(),
+            self.validate_interface_id_type(),
+        ]
+        .into_iter()
+        .filter(Result::is_err)
+        // Safe unwrap due to the filter above
+        .map(Result::unwrap_err)
+        .collect();
+
+        errors.append(&mut self.validate_fields());
+        errors.append(&mut self.validate_import_directives());
+        errors.append(&mut self.validate_fulltext_directives());
+        errors.append(&mut self.validate_imported_types(schemas));
+
+        if errors.is_empty() {
+            Ok(())
+        } else {
+            Err(errors)
+        }
+    }
+
+    fn validate_schema_type_has_no_fields(&self) -> Result<(), SchemaValidationError> {
+        match self
+            .subgraph_schema_object_type()
+            .and_then(|subgraph_schema_type| {
+                if !subgraph_schema_type.fields.is_empty() {
+                    Some(SchemaValidationError::SchemaTypeWithFields)
+                } else {
+                    None
+                }
+            }) {
+            Some(err) => Err(err),
+            None => Ok(()),
+        }
+    }
+
+    fn validate_directives_on_schema_type(&self) -> Result<(), SchemaValidationError> {
+        match self
+            .subgraph_schema_object_type()
+            .and_then(|subgraph_schema_type| {
+                if !subgraph_schema_type
+                    .directives
+                    .iter()
+                    .filter(|directive| {
+                        !directive.name.eq("import") && !directive.name.eq("fulltext")
+                    })
+                    .next()
+                    .is_none()
+                {
+                    Some(SchemaValidationError::InvalidSchemaTypeDirectives)
+                } else {
+                    None
+                }
+            }) {
+            Some(err) => Err(err),
+            None => Ok(()),
+        }
+    }
+
+    /// Check the syntax of a single `@import` directive
+    fn validate_import_directive_arguments(import: &Directive) -> Option<SchemaValidationError> {
+        fn validate_import_type(typ: &Value) -> Result<(), ()> {
+            match typ {
+                Value::String(_) => Ok(()),
+                Value::Object(typ) => match (typ.get("name"), typ.get("as")) {
+                    (Some(Value::String(_)), Some(Value::String(_))) => Ok(()),
+                    _ => Err(()),
+                },
+                _ => Err(()),
+            }
+        }
+
+        fn types_are_valid(types: Option<&Value>) -> bool {
+            // All of the elements in the `types` field are valid: either
+            // a string or an object with keys `name` and `as` which are strings
+            if let Some(Value::List(types)) = types {
+                types
+                    .iter()
+                    .try_for_each(validate_import_type)
+                    .err()
+                    .is_none()
+            } else {
+                false
+            }
+        }
+
+        fn from_is_valid(from: Option<&Value>) -> bool {
+            if let Some(Value::Object(from)) = from {
+                let has_id = matches!(from.get("id"), Some(Value::String(_)));
+
+                let has_name = matches!(from.get("name"), Some(Value::String(_)));
+                has_id ^ has_name
+            } else {
+                false
+            }
+        }
+
+        if from_is_valid(import.argument("from")) && types_are_valid(import.argument("types")) {
+            None
+        } else {
+            Some(SchemaValidationError::ImportDirectiveInvalid)
+        }
+    }
+
+    fn validate_import_directive_schema_reference_parses(
+        directive: &Directive,
+    ) -> Option<SchemaValidationError> {
+        directive.argument("from").and_then(|from| match from {
+            Value::Object(from) => {
+                let id_parse_error = match from.get("id") {
+                    Some(Value::String(id)) => match DeploymentHash::new(id) {
+                        Err(_) => {
+                            Some(SchemaValidationError::ImportedSubgraphIdInvalid(id.clone()))
+                        }
+                        _ => None,
+                    },
+                    _ => None,
+                };
+                let name_parse_error = match from.get("name") {
+                    Some(Value::String(name)) => match SubgraphName::new(name) {
+                        Err(_) => Some(SchemaValidationError::ImportedSubgraphNameInvalid(
+                            name.clone(),
+                        )),
+                        _ => None,
+                    },
+                    _ => None,
+                };
+                id_parse_error.or(name_parse_error)
+            }
+            _ => None,
+        })
+    }
+
+    fn validate_fulltext_directives(&self) -> Vec<SchemaValidationError> {
+        self.subgraph_schema_object_type()
+            .map_or(vec![], |subgraph_schema_type| {
+                subgraph_schema_type
+                    .directives
+                    .iter()
+                    .filter(|directives| directives.name.eq("fulltext"))
+                    .fold(vec![], |mut errors, fulltext| {
+                        errors.extend(self.validate_fulltext_directive_name(fulltext).into_iter());
+                        errors.extend(
+                            self.validate_fulltext_directive_language(fulltext)
+                                .into_iter(),
+                        );
+                        errors.extend(
+                            self.validate_fulltext_directive_algorithm(fulltext)
+                                .into_iter(),
+                        );
+                        errors.extend(
+                            self.validate_fulltext_directive_includes(fulltext)
+                                .into_iter(),
+                        );
+                        errors
+                    })
+            })
+    }
+
+    fn validate_fulltext_directive_name(&self, fulltext: &Directive) -> Vec<SchemaValidationError> {
+        let name = match fulltext.argument("name") {
+            Some(Value::String(name)) => name,
+            _ => return vec![SchemaValidationError::FulltextNameUndefined],
+        };
+
+        let local_types: Vec<&ObjectType> = self
+            .document
+            .get_object_type_definitions()
+            .into_iter()
+            .collect();
+
+        // Validate that the fulltext field doesn't collide with any top-level Query fields
+        // generated for entity types. The field name conversions should always align with those used
+        // to create the field names in `graphql::schema::api::query_fields_for_type()`.
+        if local_types.iter().any(|typ| {
+            typ.fields.iter().any(|field| {
+                name == &field.name.as_str().to_camel_case()
+                    || name == &field.name.to_plural().to_camel_case()
+                    || field.name.eq(name)
+            })
+        }) {
+            return vec![SchemaValidationError::FulltextNameCollision(
+                name.to_string(),
+            )];
+        }
+
+        // Validate that each fulltext directive has a distinct name
+        if self
+            .subgraph_schema_object_type()
+            .unwrap()
+            .directives
+            .iter()
+            .filter(|directive| directive.name.eq("fulltext"))
+            .filter_map(|fulltext| {
+                // Collect all @fulltext directives with the same name
+                match fulltext.argument("name") {
+                    Some(Value::String(n)) if name.eq(n) => Some(n.as_str()),
+                    _ => None,
+                }
+            })
+            .count()
+            > 1
+        {
+            return vec![SchemaValidationError::FulltextNameConflict(
+                name.to_string(),
+            )];
+        } else {
+            return vec![];
+        }
+    }
+
+    fn validate_fulltext_directive_language(
+        &self,
+        fulltext: &Directive,
+    ) -> Vec<SchemaValidationError> {
+        let language = match fulltext.argument("language") {
+            Some(Value::Enum(language)) => language,
+            _ => return vec![SchemaValidationError::FulltextLanguageUndefined],
+        };
+        match FulltextLanguage::try_from(language.as_str()) {
+            Ok(_) => vec![],
+            Err(_) => vec![SchemaValidationError::FulltextLanguageInvalid(
+                language.to_string(),
+            )],
+        }
+    }
+
+    fn validate_fulltext_directive_algorithm(
+        &self,
+        fulltext: &Directive,
+    ) -> Vec<SchemaValidationError> {
+        let algorithm = match fulltext.argument("algorithm") {
+            Some(Value::Enum(algorithm)) => algorithm,
+            _ => return vec![SchemaValidationError::FulltextAlgorithmUndefined],
+        };
+        match FulltextAlgorithm::try_from(algorithm.as_str()) {
+            Ok(_) => vec![],
+            Err(_) => vec![SchemaValidationError::FulltextAlgorithmInvalid(
+                algorithm.to_string(),
+            )],
+        }
+    }
+
+    fn validate_fulltext_directive_includes(
+        &self,
+        fulltext: &Directive,
+    ) -> Vec<SchemaValidationError> {
+        // Only allow fulltext directive on local types
+        let local_types: Vec<&ObjectType> = self
+            .document
+            .get_object_type_definitions()
+            .into_iter()
+            .collect();
+
+        // Validate that each entity in fulltext.include exists
+        let includes = match fulltext.argument("include") {
+            Some(Value::List(includes)) if !includes.is_empty() => includes,
+            _ => return vec![SchemaValidationError::FulltextIncludeUndefined],
+        };
+
+        for include in includes {
+            match include.as_object() {
+                None => return vec![SchemaValidationError::FulltextIncludeObjectMissing],
+                Some(include_entity) => {
+                    let (entity, fields) =
+                        match (include_entity.get("entity"), include_entity.get("fields")) {
+                            (Some(Value::String(entity)), Some(Value::List(fields))) => {
+                                (entity, fields)
+                            }
+                            _ => return vec![SchemaValidationError::FulltextIncludeEntityMissingOrIncorrectAttributes],
+                        };
+
+                    // Validate the included entity type is one of the local types
+                    let entity_type = match local_types
+                        .iter()
+                        .cloned()
+                        .find(|typ| typ.name[..].eq(entity))
+                    {
+                        None => return vec![SchemaValidationError::FulltextIncludedEntityNotFound],
+                        Some(t) => t.clone(),
+                    };
+
+                    for field_value in fields {
+                        let field_name = match field_value {
+                            Value::Object(field_map) => match field_map.get("name") {
+                                Some(Value::String(name)) => name,
+                                _ => return vec![SchemaValidationError::FulltextIncludedFieldMissingRequiredProperty],
+                            },
+                            _ => return vec![SchemaValidationError::FulltextIncludeEntityMissingOrIncorrectAttributes],
+                        };
+
+                        // Validate the included field is a String field on the local entity types specified
+                        if !&entity_type
+                            .fields
+                            .iter()
+                            .any(|field| {
+                                let base_type: &str = field.field_type.get_base_type();
+                                matches!(ValueType::from_str(base_type), Ok(ValueType::String) if field.name.eq(field_name))
+                            })
+                        {
+                            return vec![SchemaValidationError::FulltextIncludedFieldInvalid(
+                                field_name.clone(),
+                            )];
+                        };
+                    }
+                }
+            }
+        }
+        // Fulltext include validations all passed, so we return an empty vector
+        return vec![];
+    }
+
+    fn validate_import_directives(&self) -> Vec<SchemaValidationError> {
+        self.subgraph_schema_object_type()
+            .map_or(vec![], |subgraph_schema_type| {
+                subgraph_schema_type
+                    .directives
+                    .iter()
+                    .filter(|directives| directives.name.eq("import"))
+                    .fold(vec![], |mut errors, import| {
+                        Self::validate_import_directive_arguments(import)
+                            .into_iter()
+                            .for_each(|err| errors.push(err));
+                        Self::validate_import_directive_schema_reference_parses(import)
+                            .into_iter()
+                            .for_each(|err| errors.push(err));
+                        errors
+                    })
+            })
+    }
+
+    fn validate_imported_types(
+        &self,
+        schemas: &HashMap<SchemaReference, Arc<Schema>>,
+    ) -> Vec<SchemaValidationError> {
+        self.imported_types()
+            .iter()
+            .fold(vec![], |mut errors, (imported_type, schema_ref)| {
+                schemas
+                    .get(schema_ref)
+                    .and_then(|schema| {
+                        let local_types = schema.document.get_object_type_definitions();
+                        let imported_types = schema.imported_types();
+
+                        // Ensure that the imported type is either local to
+                        // the respective schema or is itself imported
+                        // If the imported type is itself imported, do not
+                        // recursively check the schema
+                        let schema_handle = schema_ref.subgraph.to_string();
+                        let name = imported_type.name.as_str();
+
+                        let is_local = local_types.iter().any(|object| object.name == name);
+                        let is_imported = imported_types
+                            .iter()
+                            .any(|(import, _)| name == import.alias);
+                        if !is_local && !is_imported {
+                            Some(SchemaValidationError::ImportedTypeUndefined(
+                                name.to_string(),
+                                schema_handle,
+                            ))
+                        } else {
+                            None
+                        }
+                    })
+                    .into_iter()
+                    .for_each(|err| errors.push(err));
+                errors
+            })
+    }
+
+    fn validate_fields(&self) -> Vec<SchemaValidationError> {
+        let local_types = self.document.get_object_and_interface_type_fields();
+        let local_enums = self
+            .document
+            .get_enum_definitions()
+            .iter()
+            .map(|enu| enu.name.clone())
+            .collect::<Vec<String>>();
+        let imported_types = self.imported_types();
+        local_types
+            .iter()
+            .fold(vec![], |errors, (type_name, fields)| {
+                fields.iter().fold(errors, |mut errors, field| {
+                    let base = field.field_type.get_base_type();
+                    if ValueType::is_scalar(base) {
+                        return errors;
+                    }
+                    if local_types.contains_key(base) {
+                        return errors;
+                    }
+                    if imported_types
+                        .iter()
+                        .any(|(imported_type, _)| &imported_type.alias == base)
+                    {
+                        return errors;
+                    }
+                    if local_enums.iter().any(|enu| enu.eq(base)) {
+                        return errors;
+                    }
+                    errors.push(SchemaValidationError::FieldTypeUnknown(
+                        type_name.to_string(),
+                        field.name.to_string(),
+                        base.to_string(),
+                    ));
+                    errors
+                })
+            })
+    }
+
+    /// Checks if the schema is using types that are reserved
+    /// by `graph-node`
+    fn validate_reserved_types_usage(&self) -> Result<(), SchemaValidationError> {
+        let document = &self.document;
+        let object_types: Vec<_> = document
+            .get_object_type_definitions()
+            .into_iter()
+            .map(|obj_type| &obj_type.name)
+            .collect();
+
+        let interface_types: Vec<_> = document
+            .get_interface_type_definitions()
+            .into_iter()
+            .map(|iface_type| &iface_type.name)
+            .collect();
+
+        // TYPE_NAME_filter types for all object and interface types
+        let mut filter_types: Vec<String> = object_types
+            .iter()
+            .chain(interface_types.iter())
+            .map(|type_name| format!("{}_filter", type_name))
+            .collect();
+
+        // TYPE_NAME_orderBy types for all object and interface types
+        let mut order_by_types: Vec<_> = object_types
+            .iter()
+            .chain(interface_types.iter())
+            .map(|type_name| format!("{}_orderBy", type_name))
+            .collect();
+
+        let mut reserved_types: Vec<String> = vec![
+            // The built-in scalar types
+            "Boolean".into(),
+            "ID".into(),
+            "Int".into(),
+            "BigDecimal".into(),
+            "String".into(),
+            "Bytes".into(),
+            "BigInt".into(),
+            // Reserved Query and Subscription types
+            "Query".into(),
+            "Subscription".into(),
+        ];
+
+        reserved_types.append(&mut filter_types);
+        reserved_types.append(&mut order_by_types);
+
+        // `reserved_types` will now only contain
+        // the reserved types that the given schema *is* using.
+        //
+        // That is, if the schema is compliant and not using any reserved
+        // types, then it'll become an empty vector
+        reserved_types.retain(|reserved_type| document.get_named_type(reserved_type).is_some());
+
+        if reserved_types.is_empty() {
+            Ok(())
+        } else {
+            Err(SchemaValidationError::UsageOfReservedTypes(Strings(
+                reserved_types,
+            )))
+        }
+    }
+
+    fn validate_schema_types(&self) -> Result<(), SchemaValidationError> {
+        let types_without_entity_directive = self
+            .document
+            .get_object_type_definitions()
+            .iter()
+            .filter(|t| t.find_directive("entity").is_none() && !t.name.eq(SCHEMA_TYPE_NAME))
+            .map(|t| t.name.to_owned())
+            .collect::<Vec<_>>();
+        if types_without_entity_directive.is_empty() {
+            Ok(())
+        } else {
+            Err(SchemaValidationError::EntityDirectivesMissing(Strings(
+                types_without_entity_directive,
+            )))
+        }
+    }
+
+    fn validate_derived_from(&self) -> Result<(), SchemaValidationError> {
+        // Helper to construct a DerivedFromInvalid
+        fn invalid(
+            object_type: &ObjectType,
+            field_name: &str,
+            reason: &str,
+        ) -> SchemaValidationError {
+            SchemaValidationError::InvalidDerivedFrom(
+                object_type.name.to_owned(),
+                field_name.to_owned(),
+                reason.to_owned(),
+            )
+        }
+
+        let type_definitions = self.document.get_object_type_definitions();
+        let object_and_interface_type_fields = self.document.get_object_and_interface_type_fields();
+
+        // Iterate over all derived fields in all entity types; include the
+        // interface types that the entity with the `@derivedFrom` implements
+        // and the `field` argument of @derivedFrom directive
+        for (object_type, interface_types, field, target_field) in type_definitions
+            .clone()
+            .iter()
+            .flat_map(|object_type| {
+                object_type
+                    .fields
+                    .iter()
+                    .map(move |field| (object_type, field))
+            })
+            .filter_map(|(object_type, field)| {
+                field.find_directive("derivedFrom").map(|directive| {
+                    (
+                        object_type,
+                        object_type
+                            .implements_interfaces
+                            .iter()
+                            .filter(|iface| {
+                                // Any interface that has `field` can be used
+                                // as the type of the field
+                                self.document
+                                    .find_interface(iface)
+                                    .map(|iface| {
+                                        iface
+                                            .fields
+                                            .iter()
+                                            .any(|ifield| ifield.name.eq(&field.name))
+                                    })
+                                    .unwrap_or(false)
+                            })
+                            .collect::<Vec<_>>(),
+                        field,
+                        directive.argument("field"),
+                    )
+                })
+            })
+        {
+            // Turn `target_field` into the string name of the field
+            let target_field = target_field.ok_or_else(|| {
+                invalid(
+                    object_type,
+                    &field.name,
+                    "the @derivedFrom directive must have a `field` argument",
+                )
+            })?;
+            let target_field = match target_field {
+                Value::String(s) => s,
+                _ => {
+                    return Err(invalid(
+                        object_type,
+                        &field.name,
+                        "the @derivedFrom `field` argument must be a string",
+                    ))
+                }
+            };
+
+            // Check that the type we are deriving from exists
+            let target_type_name = field.field_type.get_base_type();
+            let target_fields = object_and_interface_type_fields
+                .get(target_type_name)
+                .ok_or_else(|| {
+                    invalid(
+                        object_type,
+                        &field.name,
+                        "type must be an existing entity or interface",
+                    )
+                })?;
+
+            // Check that the type we are deriving from has a field with the
+            // right name and type
+            let target_field = target_fields
+                .iter()
+                .find(|field| field.name.eq(target_field))
+                .ok_or_else(|| {
+                    let msg = format!(
+                        "field `{}` does not exist on type `{}`",
+                        target_field, target_type_name
+                    );
+                    invalid(object_type, &field.name, &msg)
+                })?;
+
+            // The field we are deriving from has to point back to us; as an
+            // exception, we allow deriving from the `id` of another type.
+            // For that, we will wind up comparing the `id`s of the two types
+            // when we query, and just assume that that's ok.
+            let target_field_type = target_field.field_type.get_base_type();
+            if target_field_type != object_type.name
+                && target_field_type != "ID"
+                && !interface_types
+                    .iter()
+                    .any(|iface| target_field_type.eq(iface.as_str()))
+            {
+                fn type_signatures(name: &str) -> Vec<String> {
+                    vec![
+                        format!("{}", name),
+                        format!("{}!", name),
+                        format!("[{}!]", name),
+                        format!("[{}!]!", name),
+                    ]
+                }
+
+                let mut valid_types = type_signatures(&object_type.name);
+                valid_types.extend(
+                    interface_types
+                        .iter()
+                        .flat_map(|iface| type_signatures(iface)),
+                );
+                let valid_types = valid_types.join(", ");
+
+                let msg = format!(
+                    "field `{tf}` on type `{tt}` must have one of the following types: {valid_types}",
+                    tf = target_field.name,
+                    tt = target_type_name,
+                    valid_types = valid_types,
+                );
+                return Err(invalid(object_type, &field.name, &msg));
+            }
+        }
+        Ok(())
+    }
+
+    /// Validate that `object` implements `interface`.
+    fn validate_interface_implementation(
+        object: &ObjectType,
+        interface: &InterfaceType,
+    ) -> Result<(), SchemaValidationError> {
+        // Check that all fields in the interface exist in the object with same name and type.
+        let mut missing_fields = vec![];
+        for i in &interface.fields {
+            if !object
+                .fields
+                .iter()
+                .any(|o| o.name.eq(&i.name) && o.field_type.eq(&i.field_type))
+            {
+                missing_fields.push(i.to_string().trim().to_owned());
+            }
+        }
+        if !missing_fields.is_empty() {
+            Err(SchemaValidationError::InterfaceFieldsMissing(
+                object.name.clone(),
+                interface.name.clone(),
+                Strings(missing_fields),
+            ))
+        } else {
+            Ok(())
+        }
+    }
+
+    fn validate_interface_id_type(&self) -> Result<(), SchemaValidationError> {
+        for (intf, obj_types) in &self.types_for_interface {
+            let id_types: HashSet<&str> = HashSet::from_iter(
+                obj_types
+                    .iter()
+                    .filter_map(|obj_type| obj_type.field("id"))
+                    .map(|f| f.field_type.get_base_type())
+                    .map(|name| if name == "ID" { "String" } else { name }),
+            );
+            if id_types.len() > 1 {
+                return Err(SchemaValidationError::InterfaceImplementorsMixId(
+                    intf.to_string(),
+                    id_types.iter().join(", "),
+                ));
+            }
+        }
+        Ok(())
+    }
+
+    fn subgraph_schema_object_type(&self) -> Option<&ObjectType> {
+        self.document
+            .get_object_type_definitions()
+            .into_iter()
+            .find(|object_type| object_type.name.eq(SCHEMA_TYPE_NAME))
+    }
+
+    pub fn entity_fulltext_definitions(
+        entity: &str,
+        document: &Document,
+    ) -> Result<Vec<FulltextDefinition>, anyhow::Error> {
+        Ok(document
+            .get_fulltext_directives()?
+            .into_iter()
+            .filter(|directive| match directive.argument("include") {
+                Some(Value::List(includes)) if !includes.is_empty() => {
+                    includes.iter().any(|include| match include {
+                        Value::Object(include) => match include.get("entity") {
+                            Some(Value::String(fulltext_entity)) if fulltext_entity == entity => {
+                                true
+                            }
+                            _ => false,
+                        },
+                        _ => false,
+                    })
+                }
+                _ => false,
+            })
+            .map(FulltextDefinition::from)
+            .collect())
+    }
+}
+
+#[test]
+fn non_existing_interface() {
+    let schema = "type Foo implements Bar @entity { foo: Int }";
+    let res = Schema::parse(schema, DeploymentHash::new("dummy").unwrap());
+    let error = res
+        .unwrap_err()
+        .downcast::<SchemaValidationError>()
+        .unwrap();
+    assert_eq!(
+        error,
+        SchemaValidationError::InterfaceUndefined("Bar".to_owned())
+    );
+}
+
+#[test]
+fn invalid_interface_implementation() {
+    let schema = "
+        interface Foo {
+            x: Int,
+            y: Int
+        }
+
+        type Bar implements Foo @entity {
+            x: Boolean
+        }
+    ";
+    let res = Schema::parse(schema, DeploymentHash::new("dummy").unwrap());
+    assert_eq!(
+        res.unwrap_err().to_string(),
+        "Entity type `Bar` does not satisfy interface `Foo` because it is missing \
+         the following fields: x: Int, y: Int",
+    );
+}
+
+#[test]
+fn interface_implementations_id_type() {
+    fn check_schema(bar_id: &str, baz_id: &str, ok: bool) {
+        let schema = format!(
+            "interface Foo {{ x: Int }}
+             type Bar implements Foo @entity {{
+                id: {bar_id}!
+                x: Int
+             }}
+
+             type Baz implements Foo @entity {{
+                id: {baz_id}!
+                x: Int
+            }}"
+        );
+        let schema = Schema::parse(&schema, DeploymentHash::new("dummy").unwrap()).unwrap();
+        let res = schema.validate(&HashMap::new());
+        if ok {
+            assert!(matches!(res, Ok(_)));
+        } else {
+            assert!(matches!(res, Err(_)));
+            assert!(matches!(
+                res.unwrap_err()[0],
+                SchemaValidationError::InterfaceImplementorsMixId(_, _)
+            ));
+        }
+    }
+    check_schema("ID", "ID", true);
+    check_schema("ID", "String", true);
+    check_schema("ID", "Bytes", false);
+    check_schema("Bytes", "String", false);
+}
+
+#[test]
+fn test_derived_from_validation() {
+    const OTHER_TYPES: &str = "
+type B @entity { id: ID! }
+type C @entity { id: ID! }
+type D @entity { id: ID! }
+type E @entity { id: ID! }
+type F @entity { id: ID! }
+type G @entity { id: ID! a: BigInt }
+type H @entity { id: ID! a: A! }
+# This sets up a situation where we need to allow `Transaction.from` to
+# point to an interface because of `Account.txn`
+type Transaction @entity { from: Address! }
+interface Address { txn: Transaction! @derivedFrom(field: \"from\") }
+type Account implements Address @entity { id: ID!, txn: Transaction! @derivedFrom(field: \"from\") }";
+
+    fn validate(field: &str, errmsg: &str) {
+        let raw = format!("type A @entity {{ id: ID!\n {} }}\n{}", field, OTHER_TYPES);
+
+        let document = graphql_parser::parse_schema(&raw)
+            .expect("Failed to parse raw schema")
+            .into_static();
+        let schema = Schema::new(DeploymentHash::new("id").unwrap(), document).unwrap();
+        match schema.validate_derived_from() {
+            Err(ref e) => match e {
+                SchemaValidationError::InvalidDerivedFrom(_, _, msg) => assert_eq!(errmsg, msg),
+                _ => panic!("expected variant SchemaValidationError::DerivedFromInvalid"),
+            },
+            Ok(_) => {
+                if errmsg != "ok" {
+                    panic!("expected validation for `{}` to fail", field)
+                }
+            }
+        }
+    }
+
+    validate(
+        "b: B @derivedFrom(field: \"a\")",
+        "field `a` does not exist on type `B`",
+    );
+    validate(
+        "c: [C!]! @derivedFrom(field: \"a\")",
+        "field `a` does not exist on type `C`",
+    );
+    validate(
+        "d: D @derivedFrom",
+        "the @derivedFrom directive must have a `field` argument",
+    );
+    validate(
+        "e: E @derivedFrom(attr: \"a\")",
+        "the @derivedFrom directive must have a `field` argument",
+    );
+    validate(
+        "f: F @derivedFrom(field: 123)",
+        "the @derivedFrom `field` argument must be a string",
+    );
+    validate(
+        "g: G @derivedFrom(field: \"a\")",
+        "field `a` on type `G` must have one of the following types: A, A!, [A!], [A!]!",
+    );
+    validate("h: H @derivedFrom(field: \"a\")", "ok");
+    validate(
+        "i: NotAType @derivedFrom(field: \"a\")",
+        "type must be an existing entity or interface",
+    );
+    validate("j: B @derivedFrom(field: \"id\")", "ok");
+}
+
+#[test]
+fn test_reserved_type_with_fields() {
+    const ROOT_SCHEMA: &str = "
+type _Schema_ { id: ID! }";
+
+    let document = graphql_parser::parse_schema(ROOT_SCHEMA).expect("Failed to parse root schema");
+    let schema = Schema::new(DeploymentHash::new("id").unwrap(), document).unwrap();
+    assert_eq!(
+        schema
+            .validate_schema_type_has_no_fields()
+            .expect_err("Expected validation to fail due to fields defined on the reserved type"),
+        SchemaValidationError::SchemaTypeWithFields
+    )
+}
+
+#[test]
+fn test_reserved_type_directives() {
+    const ROOT_SCHEMA: &str = "
+type _Schema_ @illegal";
+
+    let document = graphql_parser::parse_schema(ROOT_SCHEMA).expect("Failed to parse root schema");
+    let schema = Schema::new(DeploymentHash::new("id").unwrap(), document).unwrap();
+    assert_eq!(
+        schema.validate_directives_on_schema_type().expect_err(
+            "Expected validation to fail due to extra imports defined on the reserved type"
+        ),
+        SchemaValidationError::InvalidSchemaTypeDirectives
+    )
+}
+
+#[test]
+fn test_imports_directive_from_argument() {
+    const ROOT_SCHEMA: &str = r#"
+type _Schema_ @import(types: ["T", "A", "C"])"#;
+
+    let document = graphql_parser::parse_schema(ROOT_SCHEMA).expect("Failed to parse root schema");
+    let schema = Schema::new(DeploymentHash::new("id").unwrap(), document).unwrap();
+    match schema
+        .validate_import_directives()
+        .into_iter()
+        .find(|err| *err == SchemaValidationError::ImportDirectiveInvalid) {
+            None => panic!(
+                "Expected validation for `{}` to fail due to an @imports directive without a `from` argument",
+                ROOT_SCHEMA,
+            ),
+            _ => (),
+    }
+}
+
+#[test]
+fn test_enums_pass_field_validation() {
+    const ROOT_SCHEMA: &str = r#"
+enum Color {
+  RED
+  GREEN
+}
+
+type A @entity {
+  id: ID!
+  color: Color
+}"#;
+
+    let document = graphql_parser::parse_schema(ROOT_SCHEMA).expect("Failed to parse root schema");
+    let schema = Schema::new(DeploymentHash::new("id").unwrap(), document).unwrap();
+    assert_eq!(schema.validate_fields().len(), 0);
+}
+
+#[test]
+fn test_recursively_imported_type_validates() {
+    const ROOT_SCHEMA: &str = r#"
+type _Schema_ @import(types: ["T"], from: { id: "c1id" })"#;
+    const CHILD_1_SCHEMA: &str = r#"
+type _Schema_ @import(types: ["T"], from: { id: "c2id" })"#;
+    const CHILD_2_SCHEMA: &str = r#"
+type T @entity { id: ID! }
+"#;
+
+    let root_document =
+        graphql_parser::parse_schema(ROOT_SCHEMA).expect("Failed to parse root schema");
+    let child_1_document =
+        graphql_parser::parse_schema(CHILD_1_SCHEMA).expect("Failed to parse child 1 schema");
+    let child_2_document =
+        graphql_parser::parse_schema(CHILD_2_SCHEMA).expect("Failed to parse child 2 schema");
+
+    let c1id = DeploymentHash::new("c1id").unwrap();
+    let c2id = DeploymentHash::new("c2id").unwrap();
+    let root_schema = Schema::new(DeploymentHash::new("rid").unwrap(), root_document).unwrap();
+    let child_1_schema = Schema::new(c1id.clone(), child_1_document).unwrap();
+    let child_2_schema = Schema::new(c2id.clone(), child_2_document).unwrap();
+
+    let mut schemas = HashMap::new();
+    schemas.insert(SchemaReference::new(c1id), Arc::new(child_1_schema));
+    schemas.insert(SchemaReference::new(c2id), Arc::new(child_2_schema));
+
+    match root_schema.validate_imported_types(&schemas).is_empty() {
+        false => panic!(
+            "Expected imported types validation for `{}` to suceed",
+            ROOT_SCHEMA,
+        ),
+        true => (),
+    }
+}
+
+#[test]
+fn test_recursively_imported_type_which_dne_fails_validation() {
+    const ROOT_SCHEMA: &str = r#"
+type _Schema_ @import(types: ["T"], from: { id:"c1id"})"#;
+    const CHILD_1_SCHEMA: &str = r#"
+type _Schema_ @import(types: [{name: "T", as: "A"}], from: { id:"c2id"})"#;
+    const CHILD_2_SCHEMA: &str = r#"
+type T @entity { id: ID! }
+"#;
+    let root_document =
+        graphql_parser::parse_schema(ROOT_SCHEMA).expect("Failed to parse root schema");
+    let child_1_document =
+        graphql_parser::parse_schema(CHILD_1_SCHEMA).expect("Failed to parse child 1 schema");
+    let child_2_document =
+        graphql_parser::parse_schema(CHILD_2_SCHEMA).expect("Failed to parse child 2 schema");
+
+    let c1id = DeploymentHash::new("c1id").unwrap();
+    let c2id = DeploymentHash::new("c2id").unwrap();
+    let root_schema = Schema::new(DeploymentHash::new("rid").unwrap(), root_document).unwrap();
+    let child_1_schema = Schema::new(c1id.clone(), child_1_document).unwrap();
+    let child_2_schema = Schema::new(c2id.clone(), child_2_document).unwrap();
+
+    let mut schemas = HashMap::new();
+    schemas.insert(SchemaReference::new(c1id), Arc::new(child_1_schema));
+    schemas.insert(SchemaReference::new(c2id), Arc::new(child_2_schema));
+
+    match root_schema.validate_imported_types(&schemas).into_iter().find(|err| match err {
+        SchemaValidationError::ImportedTypeUndefined(_, _) => true,
+        _ => false,
+    }) {
+        None => panic!(
+            "Expected imported types validation to fail because an imported type was missing in the target schema",
+        ),
+        _ => (),
+    }
+}
+
+#[test]
+fn test_reserved_types_validation() {
+    let reserved_types = [
+        // Built-in scalars
+        "Boolean",
+        "ID",
+        "Int",
+        "BigDecimal",
+        "String",
+        "Bytes",
+        "BigInt",
+        // Reserved keywords
+        "Query",
+        "Subscription",
+    ];
+
+    let dummy_hash = DeploymentHash::new("dummy").unwrap();
+
+    for reserved_type in reserved_types {
+        let schema = format!("type {} @entity {{ _: Boolean }}\n", reserved_type);
+
+        let schema = Schema::parse(&schema, dummy_hash.clone()).unwrap();
+
+        let errors = schema.validate(&HashMap::new()).unwrap_err();
+        for error in errors {
+            assert!(matches!(
+                error,
+                SchemaValidationError::UsageOfReservedTypes(_)
+            ))
+        }
+    }
+}
+
+#[test]
+fn test_reserved_filter_and_group_by_types_validation() {
+    const SCHEMA: &str = r#"
+    type Gravatar @entity {
+        _: Boolean
+      }
+    type Gravatar_filter @entity {
+        _: Boolean
+    }
+    type Gravatar_orderBy @entity {
+        _: Boolean
+    }
+    "#;
+
+    let dummy_hash = DeploymentHash::new("dummy").unwrap();
+
+    let schema = Schema::parse(SCHEMA, dummy_hash).unwrap();
+
+    let errors = schema.validate(&HashMap::new()).unwrap_err();
+
+    // The only problem in the schema is the usage of reserved types
+    assert_eq!(errors.len(), 1);
+
+    assert!(matches!(
+        &errors[0],
+        SchemaValidationError::UsageOfReservedTypes(Strings(_))
+    ));
+
+    // We know this will match due to the assertion above
+    match &errors[0] {
+        SchemaValidationError::UsageOfReservedTypes(Strings(reserved_types)) => {
+            let expected_types: Vec<String> =
+                vec!["Gravatar_filter".into(), "Gravatar_orderBy".into()];
+            assert_eq!(reserved_types, &expected_types);
+        }
+        _ => unreachable!(),
+    }
+}
+
+#[test]
+fn test_fulltext_directive_validation() {
+    const SCHEMA: &str = r#"
+type _Schema_ @fulltext(
+  name: "metadata"
+  language: en
+  algorithm: rank
+  include: [
+    {
+      entity: "Gravatar",
+      fields: [
+        { name: "displayName"},
+        { name: "imageUrl"},
+      ]
+    }
+  ]
+)
+type Gravatar @entity {
+  id: ID!
+  owner: Bytes!
+  displayName: String!
+  imageUrl: String!
+}"#;
+
+    let document = graphql_parser::parse_schema(SCHEMA).expect("Failed to parse schema");
+    let schema = Schema::new(DeploymentHash::new("id1").unwrap(), document).unwrap();
+
+    assert_eq!(schema.validate_fulltext_directives(), vec![]);
+}
diff --git a/graph/src/data/store/ethereum.rs b/graph/src/data/store/ethereum.rs
new file mode 100644
index 0000000..ada156e
--- /dev/null
+++ b/graph/src/data/store/ethereum.rs
@@ -0,0 +1,51 @@
+use super::scalar;
+use crate::prelude::*;
+use web3::types::{Address, Bytes, H2048, H256, H64, U128, U256, U64};
+
+impl From<U128> for Value {
+    fn from(n: U128) -> Value {
+        Value::BigInt(scalar::BigInt::from_signed_u256(&n.into()))
+    }
+}
+
+impl From<Address> for Value {
+    fn from(address: Address) -> Value {
+        Value::Bytes(scalar::Bytes::from(address.as_ref()))
+    }
+}
+
+impl From<H64> for Value {
+    fn from(hash: H64) -> Value {
+        Value::Bytes(scalar::Bytes::from(hash.as_ref()))
+    }
+}
+
+impl From<H256> for Value {
+    fn from(hash: H256) -> Value {
+        Value::Bytes(scalar::Bytes::from(hash.as_ref()))
+    }
+}
+
+impl From<H2048> for Value {
+    fn from(hash: H2048) -> Value {
+        Value::Bytes(scalar::Bytes::from(hash.as_ref()))
+    }
+}
+
+impl From<Bytes> for Value {
+    fn from(bytes: Bytes) -> Value {
+        Value::Bytes(scalar::Bytes::from(bytes.0.as_slice()))
+    }
+}
+
+impl From<U64> for Value {
+    fn from(n: U64) -> Value {
+        Value::BigInt(BigInt::from(n))
+    }
+}
+
+impl From<U256> for Value {
+    fn from(n: U256) -> Value {
+        Value::BigInt(BigInt::from_unsigned_u256(&n))
+    }
+}
diff --git a/graph/src/data/store/mod.rs b/graph/src/data/store/mod.rs
new file mode 100644
index 0000000..e08385e
--- /dev/null
+++ b/graph/src/data/store/mod.rs
@@ -0,0 +1,1022 @@
+use crate::{
+    components::store::{DeploymentLocator, EntityKey, EntityType},
+    data::graphql::ObjectTypeExt,
+    prelude::{anyhow::Context, q, r, s, CacheWeight, QueryExecutionError, Schema},
+    runtime::gas::{Gas, GasSizeOf},
+};
+use crate::{data::subgraph::DeploymentHash, prelude::EntityChange};
+use anyhow::{anyhow, Error};
+use itertools::Itertools;
+use serde::de;
+use serde::{Deserialize, Serialize};
+use stable_hash::{FieldAddress, StableHash, StableHasher};
+use std::convert::TryFrom;
+use std::fmt;
+use std::iter::FromIterator;
+use std::str::FromStr;
+use std::{
+    borrow::Cow,
+    collections::{BTreeMap, HashMap},
+};
+use strum::AsStaticRef as _;
+use strum_macros::AsStaticStr;
+
+use super::graphql::{ext::DirectiveFinder, DocumentExt as _, TypeExt as _};
+
+/// Custom scalars in GraphQL.
+pub mod scalar;
+
+// Ethereum compatibility.
+pub mod ethereum;
+
+/// Filter subscriptions
+#[derive(Clone, PartialEq, Eq, Hash, PartialOrd, Ord)]
+pub enum SubscriptionFilter {
+    /// Receive updates about all entities from the given deployment of the
+    /// given type
+    Entities(DeploymentHash, EntityType),
+    /// Subscripe to changes in deployment assignments
+    Assignment,
+}
+
+impl SubscriptionFilter {
+    pub fn matches(&self, change: &EntityChange) -> bool {
+        match (self, change) {
+            (
+                Self::Entities(eid, etype),
+                EntityChange::Data {
+                    subgraph_id,
+                    entity_type,
+                    ..
+                },
+            ) => subgraph_id == eid && entity_type == etype,
+            (Self::Assignment, EntityChange::Assignment { .. }) => true,
+            _ => false,
+        }
+    }
+}
+
+#[derive(Clone, Debug, PartialEq, Eq, Hash)]
+pub struct NodeId(String);
+
+impl NodeId {
+    pub fn new(s: impl Into<String>) -> Result<Self, ()> {
+        let s = s.into();
+
+        // Enforce minimum and maximum length limit
+        if s.len() > 63 || s.len() < 1 {
+            return Err(());
+        }
+
+        Ok(NodeId(s))
+    }
+
+    pub fn as_str(&self) -> &str {
+        &self.0
+    }
+}
+
+impl fmt::Display for NodeId {
+    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
+        self.0.fmt(f)
+    }
+}
+
+impl slog::Value for NodeId {
+    fn serialize(
+        &self,
+        _record: &slog::Record,
+        key: slog::Key,
+        serializer: &mut dyn slog::Serializer,
+    ) -> slog::Result {
+        serializer.emit_str(key, self.0.as_str())
+    }
+}
+
+impl<'de> de::Deserialize<'de> for NodeId {
+    fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
+    where
+        D: de::Deserializer<'de>,
+    {
+        let s: String = de::Deserialize::deserialize(deserializer)?;
+        NodeId::new(s.clone())
+            .map_err(|()| de::Error::invalid_value(de::Unexpected::Str(&s), &"valid node ID"))
+    }
+}
+
+#[derive(Clone, Debug, Deserialize, PartialEq, Eq)]
+#[serde(tag = "type")]
+pub enum AssignmentEvent {
+    Add {
+        deployment: DeploymentLocator,
+        node_id: NodeId,
+    },
+    Remove {
+        deployment: DeploymentLocator,
+        node_id: NodeId,
+    },
+}
+
+impl AssignmentEvent {
+    pub fn node_id(&self) -> &NodeId {
+        match self {
+            AssignmentEvent::Add { node_id, .. } => node_id,
+            AssignmentEvent::Remove { node_id, .. } => node_id,
+        }
+    }
+}
+
+/// An entity attribute name is represented as a string.
+pub type Attribute = String;
+
+pub const ID: &str = "ID";
+pub const BYTES_SCALAR: &str = "Bytes";
+pub const BIG_INT_SCALAR: &str = "BigInt";
+pub const BIG_DECIMAL_SCALAR: &str = "BigDecimal";
+
+#[derive(Clone, Debug, PartialEq)]
+pub enum ValueType {
+    Boolean,
+    BigInt,
+    Bytes,
+    BigDecimal,
+    Int,
+    String,
+}
+
+impl FromStr for ValueType {
+    type Err = Error;
+
+    fn from_str(s: &str) -> Result<Self, Self::Err> {
+        match s {
+            "Boolean" => Ok(ValueType::Boolean),
+            "BigInt" => Ok(ValueType::BigInt),
+            "Bytes" => Ok(ValueType::Bytes),
+            "BigDecimal" => Ok(ValueType::BigDecimal),
+            "Int" => Ok(ValueType::Int),
+            "String" | "ID" => Ok(ValueType::String),
+            s => Err(anyhow!("Type not available in this context: {}", s)),
+        }
+    }
+}
+
+impl ValueType {
+    /// Return `true` if `s` is the name of a builtin scalar type
+    pub fn is_scalar(s: &str) -> bool {
+        Self::from_str(s).is_ok()
+    }
+}
+
+// Note: Do not modify fields without also making a backward compatible change to the StableHash impl (below)
+/// An attribute value is represented as an enum with variants for all supported value types.
+#[derive(Clone, Deserialize, Serialize, PartialEq, Eq)]
+#[serde(tag = "type", content = "data")]
+#[derive(AsStaticStr)]
+pub enum Value {
+    String(String),
+    Int(i32),
+    BigDecimal(scalar::BigDecimal),
+    Bool(bool),
+    List(Vec<Value>),
+    Null,
+    Bytes(scalar::Bytes),
+    BigInt(scalar::BigInt),
+}
+
+impl stable_hash_legacy::StableHash for Value {
+    fn stable_hash<H: stable_hash_legacy::StableHasher>(
+        &self,
+        mut sequence_number: H::Seq,
+        state: &mut H,
+    ) {
+        use stable_hash_legacy::prelude::*;
+        use Value::*;
+
+        // This is the default, so write nothing.
+        if self == &Null {
+            return;
+        }
+        stable_hash_legacy::StableHash::stable_hash(
+            &self.as_static().to_string(),
+            sequence_number.next_child(),
+            state,
+        );
+
+        match self {
+            Null => unreachable!(),
+            String(inner) => {
+                stable_hash_legacy::StableHash::stable_hash(inner, sequence_number, state)
+            }
+            Int(inner) => {
+                stable_hash_legacy::StableHash::stable_hash(inner, sequence_number, state)
+            }
+            BigDecimal(inner) => {
+                stable_hash_legacy::StableHash::stable_hash(inner, sequence_number, state)
+            }
+            Bool(inner) => {
+                stable_hash_legacy::StableHash::stable_hash(inner, sequence_number, state)
+            }
+            List(inner) => {
+                stable_hash_legacy::StableHash::stable_hash(inner, sequence_number, state)
+            }
+            Bytes(inner) => {
+                stable_hash_legacy::StableHash::stable_hash(inner, sequence_number, state)
+            }
+            BigInt(inner) => {
+                stable_hash_legacy::StableHash::stable_hash(inner, sequence_number, state)
+            }
+        }
+    }
+}
+
+impl StableHash for Value {
+    fn stable_hash<H: StableHasher>(&self, field_address: H::Addr, state: &mut H) {
+        use Value::*;
+
+        // This is the default, so write nothing.
+        if self == &Null {
+            return;
+        }
+
+        let variant = match self {
+            Null => unreachable!(),
+            String(inner) => {
+                inner.stable_hash(field_address.child(0), state);
+                1
+            }
+            Int(inner) => {
+                inner.stable_hash(field_address.child(0), state);
+                2
+            }
+            BigDecimal(inner) => {
+                inner.stable_hash(field_address.child(0), state);
+                3
+            }
+            Bool(inner) => {
+                inner.stable_hash(field_address.child(0), state);
+                4
+            }
+            List(inner) => {
+                inner.stable_hash(field_address.child(0), state);
+                5
+            }
+            Bytes(inner) => {
+                inner.stable_hash(field_address.child(0), state);
+                6
+            }
+            BigInt(inner) => {
+                inner.stable_hash(field_address.child(0), state);
+                7
+            }
+        };
+
+        state.write(field_address, &[variant])
+    }
+}
+
+impl Value {
+    pub fn from_query_value(value: &r::Value, ty: &s::Type) -> Result<Value, QueryExecutionError> {
+        use graphql_parser::schema::Type::{ListType, NamedType, NonNullType};
+
+        Ok(match (value, ty) {
+            // When dealing with non-null types, use the inner type to convert the value
+            (value, NonNullType(t)) => Value::from_query_value(value, t)?,
+
+            (r::Value::List(values), ListType(ty)) => Value::List(
+                values
+                    .iter()
+                    .map(|value| Self::from_query_value(value, ty))
+                    .collect::<Result<Vec<_>, _>>()?,
+            ),
+
+            (r::Value::List(values), NamedType(n)) => Value::List(
+                values
+                    .iter()
+                    .map(|value| Self::from_query_value(value, &NamedType(n.to_string())))
+                    .collect::<Result<Vec<_>, _>>()?,
+            ),
+            (r::Value::Enum(e), NamedType(_)) => Value::String(e.clone()),
+            (r::Value::String(s), NamedType(n)) => {
+                // Check if `ty` is a custom scalar type, otherwise assume it's
+                // just a string.
+                match n.as_str() {
+                    BYTES_SCALAR => Value::Bytes(scalar::Bytes::from_str(s)?),
+                    BIG_INT_SCALAR => Value::BigInt(scalar::BigInt::from_str(s)?),
+                    BIG_DECIMAL_SCALAR => Value::BigDecimal(scalar::BigDecimal::from_str(s)?),
+                    _ => Value::String(s.clone()),
+                }
+            }
+            (r::Value::Int(i), _) => Value::Int(*i as i32),
+            (r::Value::Boolean(b), _) => Value::Bool(b.to_owned()),
+            (r::Value::Null, _) => Value::Null,
+            _ => {
+                return Err(QueryExecutionError::AttributeTypeError(
+                    value.to_string(),
+                    ty.to_string(),
+                ));
+            }
+        })
+    }
+
+    pub fn as_string(self) -> Option<String> {
+        if let Value::String(s) = self {
+            Some(s)
+        } else {
+            None
+        }
+    }
+
+    pub fn as_str(&self) -> Option<&str> {
+        if let Value::String(s) = self {
+            Some(s.as_str())
+        } else {
+            None
+        }
+    }
+
+    pub fn is_string(&self) -> bool {
+        matches!(self, Value::String(_))
+    }
+
+    pub fn as_int(&self) -> Option<i32> {
+        if let Value::Int(i) = self {
+            Some(*i)
+        } else {
+            None
+        }
+    }
+
+    pub fn as_big_decimal(self) -> Option<scalar::BigDecimal> {
+        if let Value::BigDecimal(d) = self {
+            Some(d)
+        } else {
+            None
+        }
+    }
+
+    pub fn as_bool(self) -> Option<bool> {
+        if let Value::Bool(b) = self {
+            Some(b)
+        } else {
+            None
+        }
+    }
+
+    pub fn as_list(self) -> Option<Vec<Value>> {
+        if let Value::List(v) = self {
+            Some(v)
+        } else {
+            None
+        }
+    }
+
+    pub fn as_bytes(self) -> Option<scalar::Bytes> {
+        if let Value::Bytes(b) = self {
+            Some(b)
+        } else {
+            None
+        }
+    }
+
+    pub fn as_bigint(self) -> Option<scalar::BigInt> {
+        if let Value::BigInt(b) = self {
+            Some(b)
+        } else {
+            None
+        }
+    }
+
+    /// Return the name of the type of this value for display to the user
+    pub fn type_name(&self) -> String {
+        match self {
+            Value::BigDecimal(_) => "BigDecimal".to_owned(),
+            Value::BigInt(_) => "BigInt".to_owned(),
+            Value::Bool(_) => "Boolean".to_owned(),
+            Value::Bytes(_) => "Bytes".to_owned(),
+            Value::Int(_) => "Int".to_owned(),
+            Value::List(values) => {
+                if let Some(v) = values.first() {
+                    format!("[{}]", v.type_name())
+                } else {
+                    "[Any]".to_owned()
+                }
+            }
+            Value::Null => "Null".to_owned(),
+            Value::String(_) => "String".to_owned(),
+        }
+    }
+
+    pub fn is_assignable(&self, scalar_type: &ValueType, is_list: bool) -> bool {
+        match (self, scalar_type) {
+            (Value::String(_), ValueType::String)
+            | (Value::BigDecimal(_), ValueType::BigDecimal)
+            | (Value::BigInt(_), ValueType::BigInt)
+            | (Value::Bool(_), ValueType::Boolean)
+            | (Value::Bytes(_), ValueType::Bytes)
+            | (Value::Int(_), ValueType::Int)
+            | (Value::Null, _) => true,
+            (Value::List(values), _) if is_list => values
+                .iter()
+                .all(|value| value.is_assignable(scalar_type, false)),
+            _ => false,
+        }
+    }
+}
+
+impl fmt::Display for Value {
+    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
+        write!(
+            f,
+            "{}",
+            match self {
+                Value::String(s) => s.to_string(),
+                Value::Int(i) => i.to_string(),
+                Value::BigDecimal(d) => d.to_string(),
+                Value::Bool(b) => b.to_string(),
+                Value::Null => "null".to_string(),
+                Value::List(ref values) =>
+                    format!("[{}]", values.iter().map(ToString::to_string).join(", ")),
+                Value::Bytes(ref bytes) => bytes.to_string(),
+                Value::BigInt(ref number) => number.to_string(),
+            }
+        )
+    }
+}
+
+impl fmt::Debug for Value {
+    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
+        match self {
+            Self::String(s) => f.debug_tuple("String").field(s).finish(),
+            Self::Int(i) => f.debug_tuple("Int").field(i).finish(),
+            Self::BigDecimal(d) => d.fmt(f),
+            Self::Bool(arg0) => f.debug_tuple("Bool").field(arg0).finish(),
+            Self::List(arg0) => f.debug_tuple("List").field(arg0).finish(),
+            Self::Null => write!(f, "Null"),
+            Self::Bytes(bytes) => bytes.fmt(f),
+            Self::BigInt(number) => number.fmt(f),
+        }
+    }
+}
+
+impl From<Value> for q::Value {
+    fn from(value: Value) -> Self {
+        match value {
+            Value::String(s) => q::Value::String(s),
+            Value::Int(i) => q::Value::Int(q::Number::from(i)),
+            Value::BigDecimal(d) => q::Value::String(d.to_string()),
+            Value::Bool(b) => q::Value::Boolean(b),
+            Value::Null => q::Value::Null,
+            Value::List(values) => {
+                q::Value::List(values.into_iter().map(|value| value.into()).collect())
+            }
+            Value::Bytes(bytes) => q::Value::String(bytes.to_string()),
+            Value::BigInt(number) => q::Value::String(number.to_string()),
+        }
+    }
+}
+
+impl From<Value> for r::Value {
+    fn from(value: Value) -> Self {
+        match value {
+            Value::String(s) => r::Value::String(s),
+            Value::Int(i) => r::Value::Int(i as i64),
+            Value::BigDecimal(d) => r::Value::String(d.to_string()),
+            Value::Bool(b) => r::Value::Boolean(b),
+            Value::Null => r::Value::Null,
+            Value::List(values) => {
+                r::Value::List(values.into_iter().map(|value| value.into()).collect())
+            }
+            Value::Bytes(bytes) => r::Value::String(bytes.to_string()),
+            Value::BigInt(number) => r::Value::String(number.to_string()),
+        }
+    }
+}
+
+impl<'a> From<&'a str> for Value {
+    fn from(value: &'a str) -> Value {
+        Value::String(value.to_owned())
+    }
+}
+
+impl From<String> for Value {
+    fn from(value: String) -> Value {
+        Value::String(value)
+    }
+}
+
+impl<'a> From<&'a String> for Value {
+    fn from(value: &'a String) -> Value {
+        Value::String(value.clone())
+    }
+}
+
+impl From<scalar::Bytes> for Value {
+    fn from(value: scalar::Bytes) -> Value {
+        Value::Bytes(value)
+    }
+}
+
+impl From<bool> for Value {
+    fn from(value: bool) -> Value {
+        Value::Bool(value)
+    }
+}
+
+impl From<i32> for Value {
+    fn from(value: i32) -> Value {
+        Value::Int(value)
+    }
+}
+
+impl From<scalar::BigDecimal> for Value {
+    fn from(value: scalar::BigDecimal) -> Value {
+        Value::BigDecimal(value)
+    }
+}
+
+impl From<scalar::BigInt> for Value {
+    fn from(value: scalar::BigInt) -> Value {
+        Value::BigInt(value)
+    }
+}
+
+impl From<u64> for Value {
+    fn from(value: u64) -> Value {
+        Value::BigInt(value.into())
+    }
+}
+
+impl TryFrom<Value> for Option<scalar::BigInt> {
+    type Error = Error;
+
+    fn try_from(value: Value) -> Result<Self, Self::Error> {
+        match value {
+            Value::BigInt(n) => Ok(Some(n)),
+            Value::Null => Ok(None),
+            _ => Err(anyhow!("Value is not an BigInt")),
+        }
+    }
+}
+
+impl<T> From<Vec<T>> for Value
+where
+    T: Into<Value>,
+{
+    fn from(values: Vec<T>) -> Value {
+        Value::List(values.into_iter().map(Into::into).collect())
+    }
+}
+
+impl<T> From<Option<T>> for Value
+where
+    Value: From<T>,
+{
+    fn from(x: Option<T>) -> Value {
+        match x {
+            Some(x) => x.into(),
+            None => Value::Null,
+        }
+    }
+}
+
+/// An entity is represented as a map of attribute names to values.
+#[derive(Clone, Debug, Default, Deserialize, PartialEq, Eq, Serialize)]
+pub struct Entity(HashMap<Attribute, Value>);
+
+impl stable_hash_legacy::StableHash for Entity {
+    #[inline]
+    fn stable_hash<H: stable_hash_legacy::StableHasher>(
+        &self,
+        mut sequence_number: H::Seq,
+        state: &mut H,
+    ) {
+        use stable_hash_legacy::SequenceNumber;
+        let Self(inner) = self;
+        stable_hash_legacy::StableHash::stable_hash(inner, sequence_number.next_child(), state);
+    }
+}
+
+impl StableHash for Entity {
+    fn stable_hash<H: StableHasher>(&self, field_address: H::Addr, state: &mut H) {
+        let Self(inner) = self;
+        StableHash::stable_hash(inner, field_address.child(0), state);
+    }
+}
+
+#[macro_export]
+macro_rules! entity {
+    ($($name:ident: $value:expr,)*) => {
+        {
+            let mut result = $crate::data::store::Entity::new();
+            $(
+                result.set(stringify!($name), $crate::data::store::Value::from($value));
+            )*
+            result
+        }
+    };
+    ($($name:ident: $value:expr),*) => {
+        entity! {$($name: $value,)*}
+    };
+}
+
+impl Entity {
+    /// Creates a new entity with no attributes set.
+    pub fn new() -> Self {
+        Default::default()
+    }
+
+    pub fn get(&self, key: &str) -> Option<&Value> {
+        self.0.get(key)
+    }
+
+    pub fn insert(&mut self, key: String, value: Value) -> Option<Value> {
+        self.0.insert(key, value)
+    }
+
+    pub fn remove(&mut self, key: &str) -> Option<Value> {
+        self.0.remove(key)
+    }
+
+    pub fn contains_key(&self, key: &str) -> bool {
+        self.0.contains_key(key)
+    }
+
+    // This collects the entity into an ordered vector so that it can be iterated deterministically.
+    pub fn sorted(self) -> Vec<(String, Value)> {
+        let mut v: Vec<_> = self.0.into_iter().collect();
+        v.sort_by(|(k1, _), (k2, _)| k1.cmp(k2));
+        v
+    }
+
+    /// Return the ID of this entity. If the ID is a string, return the
+    /// string. If it is `Bytes`, return it as a hex string with a `0x`
+    /// prefix. If the ID is not set or anything but a `String` or `Bytes`,
+    /// return an error
+    pub fn id(&self) -> Result<String, Error> {
+        match self.get("id") {
+            None => Err(anyhow!("Entity is missing an `id` attribute")),
+            Some(Value::String(s)) => Ok(s.to_owned()),
+            Some(Value::Bytes(b)) => Ok(b.to_string()),
+            _ => Err(anyhow!("Entity has non-string `id` attribute")),
+        }
+    }
+
+    /// Convenience method to save having to `.into()` the arguments.
+    pub fn set(&mut self, name: impl Into<Attribute>, value: impl Into<Value>) -> Option<Value> {
+        self.0.insert(name.into(), value.into())
+    }
+
+    /// Merges an entity update `update` into this entity.
+    ///
+    /// If a key exists in both entities, the value from `update` is chosen.
+    /// If a key only exists on one entity, the value from that entity is chosen.
+    /// If a key is set to `Value::Null` in `update`, the key/value pair is set to `Value::Null`.
+    pub fn merge(&mut self, update: Entity) {
+        for (key, value) in update.0.into_iter() {
+            self.insert(key, value);
+        }
+    }
+
+    /// Merges an entity update `update` into this entity, removing `Value::Null` values.
+    ///
+    /// If a key exists in both entities, the value from `update` is chosen.
+    /// If a key only exists on one entity, the value from that entity is chosen.
+    /// If a key is set to `Value::Null` in `update`, the key/value pair is removed.
+    pub fn merge_remove_null_fields(&mut self, update: Entity) {
+        for (key, value) in update.0.into_iter() {
+            match value {
+                Value::Null => self.remove(&key),
+                _ => self.insert(key, value),
+            };
+        }
+    }
+
+    /// Validate that this entity matches the object type definition in the
+    /// schema. An entity that passes these checks can be stored
+    /// successfully in the subgraph's database schema
+    pub fn validate(&self, schema: &Schema, key: &EntityKey) -> Result<(), anyhow::Error> {
+        fn scalar_value_type(schema: &Schema, field_type: &s::Type) -> ValueType {
+            use s::TypeDefinition as t;
+            match field_type {
+                s::Type::NamedType(name) => ValueType::from_str(name).unwrap_or_else(|_| {
+                    match schema.document.get_named_type(name) {
+                        Some(t::Object(obj_type)) => {
+                            let id = obj_type.field("id").expect("all object types have an id");
+                            scalar_value_type(schema, &id.field_type)
+                        }
+                        Some(t::Interface(intf)) => {
+                            // Validation checks that all implementors of an
+                            // interface use the same type for `id`. It is
+                            // therefore enough to use the id type of one of
+                            // the implementors
+                            match schema
+                                .types_for_interface()
+                                .get(&EntityType::new(intf.name.clone()))
+                                .expect("interface type names are known")
+                                .first()
+                            {
+                                None => {
+                                    // Nothing is implementing this interface; we assume it's of type string
+                                    // see also: id-type-for-unimplemented-interfaces
+                                    ValueType::String
+                                }
+                                Some(obj_type) => {
+                                    let id =
+                                        obj_type.field("id").expect("all object types have an id");
+                                    scalar_value_type(schema, &id.field_type)
+                                }
+                            }
+                        }
+                        Some(t::Enum(_)) => ValueType::String,
+                        Some(t::Scalar(_)) => unreachable!("user-defined scalars are not used"),
+                        Some(t::Union(_)) => unreachable!("unions are not used"),
+                        Some(t::InputObject(_)) => unreachable!("inputObjects are not used"),
+                        None => unreachable!("names of field types have been validated"),
+                    }
+                }),
+                s::Type::NonNullType(inner) => scalar_value_type(schema, inner),
+                s::Type::ListType(inner) => scalar_value_type(schema, inner),
+            }
+        }
+
+        if key.entity_type.is_poi() {
+            // Users can't modify Poi entities, and therefore they do not
+            // need to be validated. In addition, the schema has no object
+            // type for them, and validation would therefore fail
+            return Ok(());
+        }
+        let object_type_definitions = schema.document.get_object_type_definitions();
+        let object_type = object_type_definitions
+            .iter()
+            .find(|object_type| key.entity_type.as_str() == object_type.name)
+            .with_context(|| {
+                format!(
+                    "Entity {}[{}]: unknown entity type `{}`",
+                    key.entity_type, key.entity_id, key.entity_type
+                )
+            })?;
+
+        for field in &object_type.fields {
+            let is_derived = field.is_derived();
+            match (self.get(&field.name), is_derived) {
+                (Some(value), false) => {
+                    let scalar_type = scalar_value_type(schema, &field.field_type);
+                    if field.field_type.is_list() {
+                        // Check for inhomgeneous lists to produce a better
+                        // error message for them; other problems, like
+                        // assigning a scalar to a list will be caught below
+                        if let Value::List(elts) = value {
+                            for (index, elt) in elts.iter().enumerate() {
+                                if !elt.is_assignable(&scalar_type, false) {
+                                    anyhow::bail!(
+                                        "Entity {}[{}]: field `{}` is of type {}, but the value `{}` \
+                                        contains a {} at index {}",
+                                        key.entity_type,
+                                        key.entity_id,
+                                        field.name,
+                                        &field.field_type,
+                                        value,
+                                        elt.type_name(),
+                                        index
+                                    );
+                                }
+                            }
+                        }
+                    }
+                    if !value.is_assignable(&scalar_type, field.field_type.is_list()) {
+                        anyhow::bail!(
+                            "Entity {}[{}]: the value `{}` for field `{}` must have type {} but has type {}",
+                            key.entity_type,
+                            key.entity_id,
+                            value,
+                            field.name,
+                            &field.field_type,
+                            value.type_name()
+                        );
+                    }
+                }
+                (None, false) => {
+                    if field.field_type.is_non_null() {
+                        anyhow::bail!(
+                            "Entity {}[{}]: missing value for non-nullable field `{}`",
+                            key.entity_type,
+                            key.entity_id,
+                            field.name,
+                        );
+                    }
+                }
+                (Some(_), true) => {
+                    anyhow::bail!(
+                        "Entity {}[{}]: field `{}` is derived and can not be set",
+                        key.entity_type,
+                        key.entity_id,
+                        field.name,
+                    );
+                }
+                (None, true) => {
+                    // derived fields should not be set
+                }
+            }
+        }
+        Ok(())
+    }
+}
+
+impl From<Entity> for BTreeMap<String, q::Value> {
+    fn from(entity: Entity) -> BTreeMap<String, q::Value> {
+        entity.0.into_iter().map(|(k, v)| (k, v.into())).collect()
+    }
+}
+
+impl From<Entity> for q::Value {
+    fn from(entity: Entity) -> q::Value {
+        q::Value::Object(entity.into())
+    }
+}
+
+impl From<HashMap<Attribute, Value>> for Entity {
+    fn from(m: HashMap<Attribute, Value>) -> Entity {
+        Entity(m)
+    }
+}
+
+impl<'a> From<&'a Entity> for Cow<'a, Entity> {
+    fn from(entity: &'a Entity) -> Self {
+        Cow::Borrowed(entity)
+    }
+}
+
+impl<'a> From<Vec<(&'a str, Value)>> for Entity {
+    fn from(entries: Vec<(&'a str, Value)>) -> Entity {
+        Entity::from(HashMap::from_iter(
+            entries.into_iter().map(|(k, v)| (String::from(k), v)),
+        ))
+    }
+}
+
+impl CacheWeight for Entity {
+    fn indirect_weight(&self) -> usize {
+        self.0.indirect_weight()
+    }
+}
+
+impl GasSizeOf for Entity {
+    fn gas_size_of(&self) -> Gas {
+        self.0.gas_size_of()
+    }
+}
+
+/// A value that can (maybe) be converted to an `Entity`.
+pub trait TryIntoEntity {
+    fn try_into_entity(self) -> Result<Entity, Error>;
+}
+
+#[test]
+fn value_bytes() {
+    let graphql_value = r::Value::String("0x8f494c66afc1d3f8ac1b45df21f02a46".to_owned());
+    let ty = q::Type::NamedType(BYTES_SCALAR.to_owned());
+    let from_query = Value::from_query_value(&graphql_value, &ty).unwrap();
+    assert_eq!(
+        from_query,
+        Value::Bytes(scalar::Bytes::from(
+            &[143, 73, 76, 102, 175, 193, 211, 248, 172, 27, 69, 223, 33, 240, 42, 70][..]
+        ))
+    );
+    assert_eq!(r::Value::from(from_query), graphql_value);
+}
+
+#[test]
+fn value_bigint() {
+    let big_num = "340282366920938463463374607431768211456";
+    let graphql_value = r::Value::String(big_num.to_owned());
+    let ty = q::Type::NamedType(BIG_INT_SCALAR.to_owned());
+    let from_query = Value::from_query_value(&graphql_value, &ty).unwrap();
+    assert_eq!(
+        from_query,
+        Value::BigInt(FromStr::from_str(big_num).unwrap())
+    );
+    assert_eq!(r::Value::from(from_query), graphql_value);
+}
+
+#[test]
+fn entity_validation() {
+    fn make_thing(name: &str) -> Entity {
+        let mut thing = Entity::new();
+        thing.set("id", name);
+        thing.set("name", name);
+        thing.set("stuff", "less");
+        thing.set("favorite_color", "red");
+        thing.set("things", Value::List(vec![]));
+        thing
+    }
+
+    fn check(thing: Entity, errmsg: &str) {
+        const DOCUMENT: &str = "
+      enum Color { red, yellow, blue }
+      interface Stuff { id: ID!, name: String! }
+      type Cruft @entity {
+          id: ID!,
+          thing: Thing!
+      }
+      type Thing @entity {
+          id: ID!,
+          name: String!,
+          favorite_color: Color,
+          stuff: Stuff,
+          things: [Thing!]!
+          # Make sure we do not validate derived fields; it's ok
+          # to store a thing with a null Cruft
+          cruft: Cruft! @derivedFrom(field: \"thing\")
+      }";
+        let subgraph = DeploymentHash::new("doesntmatter").unwrap();
+        let schema =
+            crate::prelude::Schema::parse(DOCUMENT, subgraph).expect("Failed to parse test schema");
+        let id = thing.id().unwrap_or("none".to_owned());
+        let key = EntityKey::data("Thing".to_owned(), id.clone());
+
+        let err = thing.validate(&schema, &key);
+        if errmsg == "" {
+            assert!(
+                err.is_ok(),
+                "checking entity {}: expected ok but got {}",
+                id,
+                err.unwrap_err()
+            );
+        } else {
+            if let Err(e) = err {
+                assert_eq!(errmsg, e.to_string(), "checking entity {}", id);
+            } else {
+                panic!(
+                    "Expected error `{}` but got ok when checking entity {}",
+                    errmsg, id
+                );
+            }
+        }
+    }
+
+    let mut thing = make_thing("t1");
+    thing.set("things", Value::from(vec!["thing1", "thing2"]));
+    check(thing, "");
+
+    let thing = make_thing("t2");
+    check(thing, "");
+
+    let mut thing = make_thing("t3");
+    thing.remove("name");
+    check(
+        thing,
+        "Entity Thing[t3]: missing value for non-nullable field `name`",
+    );
+
+    let mut thing = make_thing("t4");
+    thing.remove("things");
+    check(
+        thing,
+        "Entity Thing[t4]: missing value for non-nullable field `things`",
+    );
+
+    let mut thing = make_thing("t5");
+    thing.set("name", Value::Int(32));
+    check(
+        thing,
+        "Entity Thing[t5]: the value `32` for field `name` must \
+         have type String! but has type Int",
+    );
+
+    let mut thing = make_thing("t6");
+    thing.set("things", Value::List(vec!["thing1".into(), 17.into()]));
+    check(
+        thing,
+        "Entity Thing[t6]: field `things` is of type [Thing!]!, \
+         but the value `[thing1, 17]` contains a Int at index 1",
+    );
+
+    let mut thing = make_thing("t7");
+    thing.remove("favorite_color");
+    thing.remove("stuff");
+    check(thing, "");
+
+    let mut thing = make_thing("t8");
+    thing.set("cruft", "wat");
+    check(
+        thing,
+        "Entity Thing[t8]: field `cruft` is derived and can not be set",
+    );
+}
+
+#[test]
+fn fmt_debug() {
+    assert_eq!("String(\"hello\")", format!("{:?}", Value::from("hello")));
+    assert_eq!("Int(17)", format!("{:?}", Value::Int(17)));
+    assert_eq!("Bool(false)", format!("{:?}", Value::Bool(false)));
+    assert_eq!("Null", format!("{:?}", Value::Null));
+
+    let bd = Value::BigDecimal(scalar::BigDecimal::from(-0.17));
+    assert_eq!("BigDecimal(-0.17)", format!("{:?}", bd));
+
+    let bytes = Value::Bytes(scalar::Bytes::from([222, 173, 190, 239].as_slice()));
+    assert_eq!("Bytes(0xdeadbeef)", format!("{:?}", bytes));
+
+    let bi = Value::BigInt(scalar::BigInt::from(-17i32));
+    assert_eq!("BigInt(-17)", format!("{:?}", bi));
+}
diff --git a/graph/src/data/store/scalar.rs b/graph/src/data/store/scalar.rs
new file mode 100644
index 0000000..fb43cd7
--- /dev/null
+++ b/graph/src/data/store/scalar.rs
@@ -0,0 +1,739 @@
+use diesel::deserialize::FromSql;
+use diesel::serialize::ToSql;
+use diesel_derives::{AsExpression, FromSqlRow};
+use hex;
+use num_bigint;
+use serde::{self, Deserialize, Serialize};
+use stable_hash::utils::AsInt;
+use stable_hash::{FieldAddress, StableHash};
+use stable_hash_legacy::SequenceNumber;
+use thiserror::Error;
+use web3::types::*;
+
+use std::convert::{TryFrom, TryInto};
+use std::fmt::{self, Display, Formatter};
+use std::io::Write;
+use std::ops::{Add, BitAnd, BitOr, Deref, Div, Mul, Rem, Shl, Shr, Sub};
+use std::str::FromStr;
+
+pub use num_bigint::Sign as BigIntSign;
+
+use crate::blockchain::BlockHash;
+use crate::util::stable_hash_glue::{impl_stable_hash, AsBytes};
+
+/// All operations on `BigDecimal` return a normalized value.
+// Caveat: The exponent is currently an i64 and may overflow. See
+// https://github.com/akubera/bigdecimal-rs/issues/54.
+// Using `#[serde(from = "BigDecimal"]` makes sure deserialization calls `BigDecimal::new()`.
+#[derive(
+    Clone, PartialEq, Eq, PartialOrd, Ord, Serialize, Deserialize, AsExpression, FromSqlRow,
+)]
+#[serde(from = "bigdecimal::BigDecimal")]
+#[sql_type = "diesel::sql_types::Numeric"]
+pub struct BigDecimal(bigdecimal::BigDecimal);
+
+impl From<bigdecimal::BigDecimal> for BigDecimal {
+    fn from(big_decimal: bigdecimal::BigDecimal) -> Self {
+        BigDecimal(big_decimal).normalized()
+    }
+}
+
+impl BigDecimal {
+    /// These are the limits of IEEE-754 decimal128, a format we may want to switch to. See
+    /// https://en.wikipedia.org/wiki/Decimal128_floating-point_format.
+    pub const MIN_EXP: i32 = -6143;
+    pub const MAX_EXP: i32 = 6144;
+    pub const MAX_SIGNFICANT_DIGITS: i32 = 34;
+
+    pub fn new(digits: BigInt, exp: i64) -> Self {
+        // bigdecimal uses `scale` as the opposite of the power of ten, so negate `exp`.
+        Self::from(bigdecimal::BigDecimal::new(digits.0, -exp))
+    }
+
+    pub fn parse_bytes(bytes: &[u8]) -> Option<Self> {
+        bigdecimal::BigDecimal::parse_bytes(bytes, 10).map(Self)
+    }
+
+    pub fn zero() -> BigDecimal {
+        use bigdecimal::Zero;
+
+        BigDecimal(bigdecimal::BigDecimal::zero())
+    }
+
+    pub fn as_bigint_and_exponent(&self) -> (num_bigint::BigInt, i64) {
+        self.0.as_bigint_and_exponent()
+    }
+
+    pub fn digits(&self) -> u64 {
+        self.0.digits()
+    }
+
+    // Copy-pasted from `bigdecimal::BigDecimal::normalize`. We can use the upstream version once it
+    // is included in a released version supported by Diesel.
+    #[must_use]
+    pub fn normalized(&self) -> BigDecimal {
+        if self == &BigDecimal::zero() {
+            return BigDecimal::zero();
+        }
+
+        // Round to the maximum significant digits.
+        let big_decimal = self.0.with_prec(Self::MAX_SIGNFICANT_DIGITS as u64);
+
+        let (bigint, exp) = big_decimal.as_bigint_and_exponent();
+        let (sign, mut digits) = bigint.to_radix_be(10);
+        let trailing_count = digits.iter().rev().take_while(|i| **i == 0).count();
+        digits.truncate(digits.len() - trailing_count);
+        let int_val = num_bigint::BigInt::from_radix_be(sign, &digits, 10).unwrap();
+        let scale = exp - trailing_count as i64;
+
+        BigDecimal(bigdecimal::BigDecimal::new(int_val, scale))
+    }
+}
+
+impl Display for BigDecimal {
+    fn fmt(&self, f: &mut Formatter) -> Result<(), fmt::Error> {
+        self.0.fmt(f)
+    }
+}
+
+impl fmt::Debug for BigDecimal {
+    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
+        write!(f, "BigDecimal({})", self.0)
+    }
+}
+
+impl FromStr for BigDecimal {
+    type Err = <bigdecimal::BigDecimal as FromStr>::Err;
+
+    fn from_str(s: &str) -> Result<BigDecimal, Self::Err> {
+        Ok(Self::from(bigdecimal::BigDecimal::from_str(s)?))
+    }
+}
+
+impl From<i32> for BigDecimal {
+    fn from(n: i32) -> Self {
+        Self::from(bigdecimal::BigDecimal::from(n))
+    }
+}
+
+impl From<i64> for BigDecimal {
+    fn from(n: i64) -> Self {
+        Self::from(bigdecimal::BigDecimal::from(n))
+    }
+}
+
+impl From<u64> for BigDecimal {
+    fn from(n: u64) -> Self {
+        Self::from(bigdecimal::BigDecimal::from(n))
+    }
+}
+
+impl From<f64> for BigDecimal {
+    fn from(n: f64) -> Self {
+        Self::from(bigdecimal::BigDecimal::from(n))
+    }
+}
+
+impl Add for BigDecimal {
+    type Output = Self;
+
+    fn add(self, other: Self) -> Self {
+        Self::from(self.0.add(other.0))
+    }
+}
+
+impl Sub for BigDecimal {
+    type Output = Self;
+
+    fn sub(self, other: Self) -> Self {
+        Self::from(self.0.sub(other.0))
+    }
+}
+
+impl Mul for BigDecimal {
+    type Output = Self;
+
+    fn mul(self, other: Self) -> Self {
+        Self::from(self.0.mul(other.0))
+    }
+}
+
+impl Div for BigDecimal {
+    type Output = Self;
+
+    fn div(self, other: Self) -> Self {
+        if other == BigDecimal::from(0) {
+            panic!("Cannot divide by zero-valued `BigDecimal`!")
+        }
+
+        Self::from(self.0.div(other.0))
+    }
+}
+
+// Used only for JSONB support
+impl ToSql<diesel::sql_types::Numeric, diesel::pg::Pg> for BigDecimal {
+    fn to_sql<W: Write>(
+        &self,
+        out: &mut diesel::serialize::Output<W, diesel::pg::Pg>,
+    ) -> diesel::serialize::Result {
+        <_ as ToSql<diesel::sql_types::Numeric, _>>::to_sql(&self.0, out)
+    }
+}
+
+impl FromSql<diesel::sql_types::Numeric, diesel::pg::Pg> for BigDecimal {
+    fn from_sql(
+        bytes: Option<&<diesel::pg::Pg as diesel::backend::Backend>::RawValue>,
+    ) -> diesel::deserialize::Result<Self> {
+        Ok(Self::from(bigdecimal::BigDecimal::from_sql(bytes)?))
+    }
+}
+
+impl bigdecimal::ToPrimitive for BigDecimal {
+    fn to_i64(&self) -> Option<i64> {
+        self.0.to_i64()
+    }
+    fn to_u64(&self) -> Option<u64> {
+        self.0.to_u64()
+    }
+}
+
+impl stable_hash_legacy::StableHash for BigDecimal {
+    fn stable_hash<H: stable_hash_legacy::StableHasher>(
+        &self,
+        mut sequence_number: H::Seq,
+        state: &mut H,
+    ) {
+        let (int, exp) = self.as_bigint_and_exponent();
+        // This only allows for backward compatible changes between
+        // BigDecimal and unsigned ints
+        stable_hash_legacy::StableHash::stable_hash(&exp, sequence_number.next_child(), state);
+        stable_hash_legacy::StableHash::stable_hash(&BigInt(int), sequence_number, state);
+    }
+}
+
+impl StableHash for BigDecimal {
+    fn stable_hash<H: stable_hash::StableHasher>(&self, field_address: H::Addr, state: &mut H) {
+        // This implementation allows for backward compatible changes from integers (signed or unsigned)
+        // when the exponent is zero.
+        let (int, exp) = self.as_bigint_and_exponent();
+        StableHash::stable_hash(&exp, field_address.child(1), state);
+        // Normally it would be a red flag to pass field_address in after having used a child slot.
+        // But, we know the implementation of StableHash for BigInt will not use child(1) and that
+        // it will not in the future due to having no forward schema evolutions for ints and the
+        // stability guarantee.
+        //
+        // For reference, ints use child(0) for the sign and write the little endian bytes to the parent slot.
+        BigInt(int).stable_hash(field_address, state);
+    }
+}
+
+#[derive(Clone, PartialEq, Eq, PartialOrd, Ord)]
+pub struct BigInt(num_bigint::BigInt);
+
+impl stable_hash_legacy::StableHash for BigInt {
+    #[inline]
+    fn stable_hash<H: stable_hash_legacy::StableHasher>(
+        &self,
+        sequence_number: H::Seq,
+        state: &mut H,
+    ) {
+        stable_hash_legacy::utils::AsInt {
+            is_negative: self.0.sign() == BigIntSign::Minus,
+            little_endian: &self.to_bytes_le().1,
+        }
+        .stable_hash(sequence_number, state)
+    }
+}
+
+impl StableHash for BigInt {
+    fn stable_hash<H: stable_hash::StableHasher>(&self, field_address: H::Addr, state: &mut H) {
+        AsInt {
+            is_negative: self.0.sign() == BigIntSign::Minus,
+            little_endian: &self.to_bytes_le().1,
+        }
+        .stable_hash(field_address, state)
+    }
+}
+
+#[derive(Error, Debug)]
+pub enum BigIntOutOfRangeError {
+    #[error("Cannot convert negative BigInt into type")]
+    Negative,
+    #[error("BigInt value is too large for type")]
+    Overflow,
+}
+
+impl<'a> TryFrom<&'a BigInt> for u64 {
+    type Error = BigIntOutOfRangeError;
+    fn try_from(value: &'a BigInt) -> Result<u64, BigIntOutOfRangeError> {
+        let (sign, bytes) = value.to_bytes_le();
+
+        if sign == num_bigint::Sign::Minus {
+            return Err(BigIntOutOfRangeError::Negative);
+        }
+
+        if bytes.len() > 8 {
+            return Err(BigIntOutOfRangeError::Overflow);
+        }
+
+        // Replace this with u64::from_le_bytes when stabilized
+        let mut n = 0u64;
+        let mut shift_dist = 0;
+        for b in bytes {
+            n |= (b as u64) << shift_dist;
+            shift_dist += 8;
+        }
+        Ok(n)
+    }
+}
+
+impl TryFrom<BigInt> for u64 {
+    type Error = BigIntOutOfRangeError;
+    fn try_from(value: BigInt) -> Result<u64, BigIntOutOfRangeError> {
+        (&value).try_into()
+    }
+}
+
+impl fmt::Debug for BigInt {
+    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
+        write!(f, "BigInt({})", self)
+    }
+}
+
+impl BigInt {
+    pub fn from_unsigned_bytes_le(bytes: &[u8]) -> Self {
+        BigInt(num_bigint::BigInt::from_bytes_le(
+            num_bigint::Sign::Plus,
+            bytes,
+        ))
+    }
+
+    pub fn from_signed_bytes_le(bytes: &[u8]) -> Self {
+        BigInt(num_bigint::BigInt::from_signed_bytes_le(bytes))
+    }
+
+    pub fn from_signed_bytes_be(bytes: &[u8]) -> Self {
+        BigInt(num_bigint::BigInt::from_signed_bytes_be(bytes))
+    }
+
+    pub fn to_bytes_le(&self) -> (BigIntSign, Vec<u8>) {
+        self.0.to_bytes_le()
+    }
+
+    pub fn to_bytes_be(&self) -> (BigIntSign, Vec<u8>) {
+        self.0.to_bytes_be()
+    }
+
+    pub fn to_signed_bytes_le(&self) -> Vec<u8> {
+        self.0.to_signed_bytes_le()
+    }
+
+    /// Deprecated. Use try_into instead
+    pub fn to_u64(&self) -> u64 {
+        self.try_into().unwrap()
+    }
+
+    pub fn from_unsigned_u256(n: &U256) -> Self {
+        let mut bytes: [u8; 32] = [0; 32];
+        n.to_little_endian(&mut bytes);
+        BigInt::from_unsigned_bytes_le(&bytes)
+    }
+
+    pub fn from_signed_u256(n: &U256) -> Self {
+        let mut bytes: [u8; 32] = [0; 32];
+        n.to_little_endian(&mut bytes);
+        BigInt::from_signed_bytes_le(&bytes)
+    }
+
+    pub fn to_signed_u256(&self) -> U256 {
+        let bytes = self.to_signed_bytes_le();
+        if self < &BigInt::from(0) {
+            assert!(
+                bytes.len() <= 32,
+                "BigInt value does not fit into signed U256"
+            );
+            let mut i_bytes: [u8; 32] = [255; 32];
+            i_bytes[..bytes.len()].copy_from_slice(&bytes);
+            U256::from_little_endian(&i_bytes)
+        } else {
+            U256::from_little_endian(&bytes)
+        }
+    }
+
+    pub fn to_unsigned_u256(&self) -> U256 {
+        let (sign, bytes) = self.to_bytes_le();
+        assert!(
+            sign == BigIntSign::NoSign || sign == BigIntSign::Plus,
+            "negative value encountered for U256: {}",
+            self
+        );
+        U256::from_little_endian(&bytes)
+    }
+
+    pub fn pow(self, exponent: u8) -> Self {
+        use num_traits::pow::Pow;
+
+        BigInt(self.0.pow(&exponent))
+    }
+
+    pub fn bits(&self) -> usize {
+        self.0.bits()
+    }
+}
+
+impl Display for BigInt {
+    fn fmt(&self, f: &mut Formatter) -> Result<(), fmt::Error> {
+        self.0.fmt(f)
+    }
+}
+
+impl From<num_bigint::BigInt> for BigInt {
+    fn from(big_int: num_bigint::BigInt) -> BigInt {
+        BigInt(big_int)
+    }
+}
+
+impl From<i32> for BigInt {
+    fn from(i: i32) -> BigInt {
+        BigInt(i.into())
+    }
+}
+
+impl From<u64> for BigInt {
+    fn from(i: u64) -> BigInt {
+        BigInt(i.into())
+    }
+}
+
+impl From<i64> for BigInt {
+    fn from(i: i64) -> BigInt {
+        BigInt(i.into())
+    }
+}
+
+impl From<U64> for BigInt {
+    /// This implementation assumes that U64 represents an unsigned U64,
+    /// and not a signed U64 (aka int64 in Solidity). Right now, this is
+    /// all we need (for block numbers). If it ever becomes necessary to
+    /// handle signed U64s, we should add the same
+    /// `{to,from}_{signed,unsigned}_u64` methods that we have for U64.
+    fn from(n: U64) -> BigInt {
+        BigInt::from(n.as_u64())
+    }
+}
+
+impl From<U128> for BigInt {
+    /// This implementation assumes that U128 represents an unsigned U128,
+    /// and not a signed U128 (aka int128 in Solidity). Right now, this is
+    /// all we need (for block numbers). If it ever becomes necessary to
+    /// handle signed U128s, we should add the same
+    /// `{to,from}_{signed,unsigned}_u128` methods that we have for U256.
+    fn from(n: U128) -> BigInt {
+        let mut bytes: [u8; 16] = [0; 16];
+        n.to_little_endian(&mut bytes);
+        BigInt::from_unsigned_bytes_le(&bytes)
+    }
+}
+
+impl FromStr for BigInt {
+    type Err = <num_bigint::BigInt as FromStr>::Err;
+
+    fn from_str(s: &str) -> Result<BigInt, Self::Err> {
+        num_bigint::BigInt::from_str(s).map(BigInt)
+    }
+}
+
+impl Serialize for BigInt {
+    fn serialize<S: serde::Serializer>(&self, serializer: S) -> Result<S::Ok, S::Error> {
+        self.to_string().serialize(serializer)
+    }
+}
+
+impl<'de> Deserialize<'de> for BigInt {
+    fn deserialize<D: serde::Deserializer<'de>>(deserializer: D) -> Result<Self, D::Error> {
+        use serde::de::Error;
+
+        let decimal_string = <String>::deserialize(deserializer)?;
+        BigInt::from_str(&decimal_string).map_err(D::Error::custom)
+    }
+}
+
+impl Add for BigInt {
+    type Output = BigInt;
+
+    fn add(self, other: BigInt) -> BigInt {
+        BigInt(self.0.add(other.0))
+    }
+}
+
+impl Sub for BigInt {
+    type Output = BigInt;
+
+    fn sub(self, other: BigInt) -> BigInt {
+        BigInt(self.0.sub(other.0))
+    }
+}
+
+impl Mul for BigInt {
+    type Output = BigInt;
+
+    fn mul(self, other: BigInt) -> BigInt {
+        BigInt(self.0.mul(other.0))
+    }
+}
+
+impl Div for BigInt {
+    type Output = BigInt;
+
+    fn div(self, other: BigInt) -> BigInt {
+        if other == BigInt::from(0) {
+            panic!("Cannot divide by zero-valued `BigInt`!")
+        }
+
+        BigInt(self.0.div(other.0))
+    }
+}
+
+impl Rem for BigInt {
+    type Output = BigInt;
+
+    fn rem(self, other: BigInt) -> BigInt {
+        BigInt(self.0.rem(other.0))
+    }
+}
+
+impl BitOr for BigInt {
+    type Output = Self;
+
+    fn bitor(self, other: Self) -> Self {
+        Self::from(self.0.bitor(other.0))
+    }
+}
+
+impl BitAnd for BigInt {
+    type Output = Self;
+
+    fn bitand(self, other: Self) -> Self {
+        Self::from(self.0.bitand(other.0))
+    }
+}
+
+impl Shl<u8> for BigInt {
+    type Output = Self;
+
+    fn shl(self, bits: u8) -> Self {
+        Self::from(self.0.shl(bits.into()))
+    }
+}
+
+impl Shr<u8> for BigInt {
+    type Output = Self;
+
+    fn shr(self, bits: u8) -> Self {
+        Self::from(self.0.shr(bits.into()))
+    }
+}
+
+/// A byte array that's serialized as a hex string prefixed by `0x`.
+#[derive(Clone, PartialEq, Eq)]
+pub struct Bytes(Box<[u8]>);
+
+impl Deref for Bytes {
+    type Target = [u8];
+    fn deref(&self) -> &Self::Target {
+        &self.0
+    }
+}
+
+impl fmt::Debug for Bytes {
+    fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {
+        write!(f, "Bytes(0x{})", hex::encode(&self.0))
+    }
+}
+
+impl_stable_hash!(Bytes(transparent: AsBytes));
+
+impl Bytes {
+    pub fn as_slice(&self) -> &[u8] {
+        &self.0
+    }
+}
+
+impl Display for Bytes {
+    fn fmt(&self, f: &mut Formatter) -> Result<(), fmt::Error> {
+        write!(f, "0x{}", hex::encode(&self.0))
+    }
+}
+
+impl FromStr for Bytes {
+    type Err = hex::FromHexError;
+
+    fn from_str(s: &str) -> Result<Bytes, Self::Err> {
+        hex::decode(s.trim_start_matches("0x")).map(|x| Bytes(x.into()))
+    }
+}
+
+impl<'a> From<&'a [u8]> for Bytes {
+    fn from(array: &[u8]) -> Self {
+        Bytes(array.into())
+    }
+}
+
+impl From<Address> for Bytes {
+    fn from(address: Address) -> Bytes {
+        Bytes::from(address.as_ref())
+    }
+}
+
+impl From<web3::types::Bytes> for Bytes {
+    fn from(bytes: web3::types::Bytes) -> Bytes {
+        Bytes::from(bytes.0.as_slice())
+    }
+}
+
+impl From<BlockHash> for Bytes {
+    fn from(hash: BlockHash) -> Self {
+        Bytes(hash.0)
+    }
+}
+
+impl Serialize for Bytes {
+    fn serialize<S: serde::Serializer>(&self, serializer: S) -> Result<S::Ok, S::Error> {
+        self.to_string().serialize(serializer)
+    }
+}
+
+impl<'de> Deserialize<'de> for Bytes {
+    fn deserialize<D: serde::Deserializer<'de>>(deserializer: D) -> Result<Self, D::Error> {
+        use serde::de::Error;
+
+        let hex_string = <String>::deserialize(deserializer)?;
+        Bytes::from_str(&hex_string).map_err(D::Error::custom)
+    }
+}
+
+impl<const N: usize> From<[u8; N]> for Bytes {
+    fn from(array: [u8; N]) -> Bytes {
+        Bytes(array.into())
+    }
+}
+
+impl From<Vec<u8>> for Bytes {
+    fn from(vec: Vec<u8>) -> Self {
+        Bytes(vec.into())
+    }
+}
+
+#[cfg(test)]
+mod test {
+    use super::{BigDecimal, BigInt, Bytes};
+    use stable_hash_legacy::crypto::SetHasher;
+    use stable_hash_legacy::prelude::*;
+    use stable_hash_legacy::utils::stable_hash;
+    use std::str::FromStr;
+    use web3::types::U64;
+
+    #[test]
+    fn bigint_to_from_u64() {
+        for n in 0..100 {
+            let u = U64::from(n as u64);
+            let bn = BigInt::from(u);
+            assert_eq!(n, bn.to_u64());
+        }
+    }
+
+    fn crypto_stable_hash(value: impl StableHash) -> <SetHasher as StableHasher>::Out {
+        stable_hash::<SetHasher, _>(&value)
+    }
+
+    fn same_stable_hash(left: impl StableHash, right: impl StableHash) {
+        let left = crypto_stable_hash(left);
+        let right = crypto_stable_hash(right);
+        assert_eq!(left, right);
+    }
+
+    #[test]
+    fn big_int_stable_hash_same_as_int() {
+        same_stable_hash(0, BigInt::from(0u64));
+        same_stable_hash(1, BigInt::from(1u64));
+        same_stable_hash(1u64 << 20, BigInt::from(1u64 << 20));
+
+        same_stable_hash(-1, BigInt::from_signed_bytes_le(&(-1i32).to_le_bytes()));
+    }
+
+    #[test]
+    fn big_decimal_stable_hash_same_as_uint() {
+        same_stable_hash(0, BigDecimal::from(0u64));
+        same_stable_hash(4, BigDecimal::from(4i64));
+        same_stable_hash(1u64 << 21, BigDecimal::from(1u64 << 21));
+    }
+
+    #[test]
+    fn big_decimal_stable() {
+        let cases = vec![
+            (
+                "28b09c9c3f3e2fe037631b7fbccdf65c37594073016d8bf4bb0708b3fda8066a",
+                "0.1",
+            ),
+            (
+                "74fb39f038d2f1c8975740bf2651a5ac0403330ee7e9367f9563cbd7d21086bd",
+                "-0.1",
+            ),
+            (
+                "1d79e0476bc5d6fe6074fb54636b04fd3bc207053c767d9cb5e710ba5f002441",
+                "198.98765544",
+            ),
+            (
+                "e63f6ad2c65f193aa9eba18dd7e1043faa2d6183597ba84c67765aaa95c95351",
+                "0.00000093937698",
+            ),
+            (
+                "6b06b34cc714810072988dc46c493c66a6b6c2c2dd0030271aa3adf3b3f21c20",
+                "98765587998098786876.0",
+            ),
+        ];
+        for (hash, s) in cases.iter() {
+            let dec = BigDecimal::from_str(s).unwrap();
+            assert_eq!(*hash, hex::encode(crypto_stable_hash(dec)));
+        }
+    }
+
+    #[test]
+    fn test_normalize() {
+        let vals = vec![
+            (
+                BigDecimal::new(BigInt::from(10), -2),
+                BigDecimal(bigdecimal::BigDecimal::new(1.into(), 1)),
+                "0.1",
+            ),
+            (
+                BigDecimal::new(BigInt::from(132400), 4),
+                BigDecimal(bigdecimal::BigDecimal::new(1324.into(), -6)),
+                "1324000000",
+            ),
+            (
+                BigDecimal::new(BigInt::from(1_900_000), -3),
+                BigDecimal(bigdecimal::BigDecimal::new(19.into(), -2)),
+                "1900",
+            ),
+            (BigDecimal::new(0.into(), 3), BigDecimal::zero(), "0"),
+            (BigDecimal::new(0.into(), -5), BigDecimal::zero(), "0"),
+        ];
+
+        for (not_normalized, normalized, string) in vals {
+            assert_eq!(not_normalized.normalized(), normalized);
+            assert_eq!(not_normalized.normalized().to_string(), string);
+            assert_eq!(normalized.to_string(), string);
+        }
+    }
+
+    #[test]
+    fn fmt_debug() {
+        let bi = BigInt::from(-17);
+        let bd = BigDecimal::new(bi.clone(), -2);
+        let bytes = Bytes::from([222, 173, 190, 239].as_slice());
+        assert_eq!("BigInt(-17)", format!("{:?}", bi));
+        assert_eq!("BigDecimal(-0.17)", format!("{:?}", bd));
+        assert_eq!("Bytes(0xdeadbeef)", format!("{:?}", bytes));
+    }
+}
diff --git a/graph/src/data/subgraph/api_version.rs b/graph/src/data/subgraph/api_version.rs
new file mode 100644
index 0000000..7975639
--- /dev/null
+++ b/graph/src/data/subgraph/api_version.rs
@@ -0,0 +1,108 @@
+use itertools::Itertools;
+use semver::Version;
+use std::collections::BTreeSet;
+use thiserror::Error;
+
+pub const API_VERSION_0_0_2: Version = Version::new(0, 0, 2);
+
+/// This version adds a new subgraph validation step that rejects manifests whose mappings have
+/// different API versions if at least one of them is equal to or higher than `0.0.5`.
+pub const API_VERSION_0_0_5: Version = Version::new(0, 0, 5);
+
+// Adds two new fields to the Transaction object: nonce and input
+pub const API_VERSION_0_0_6: Version = Version::new(0, 0, 6);
+
+/// Enables event handlers to require transaction receipts in the runtime.
+pub const API_VERSION_0_0_7: Version = Version::new(0, 0, 7);
+
+/// Before this check was introduced, there were already subgraphs in the wild with spec version
+/// 0.0.3, due to confusion with the api version. To avoid breaking those, we accept 0.0.3 though it
+/// doesn't exist.
+pub const SPEC_VERSION_0_0_3: Version = Version::new(0, 0, 3);
+
+/// This version supports subgraph feature management.
+pub const SPEC_VERSION_0_0_4: Version = Version::new(0, 0, 4);
+
+/// This version supports event handlers having access to transaction receipts.
+pub const SPEC_VERSION_0_0_5: Version = Version::new(0, 0, 5);
+
+/// Enables the Fast POI calculation variant.
+pub const SPEC_VERSION_0_0_6: Version = Version::new(0, 0, 6);
+
+/// Enables offchain data sources.
+pub const SPEC_VERSION_0_0_7: Version = Version::new(0, 0, 7);
+
+pub const MIN_SPEC_VERSION: Version = Version::new(0, 0, 2);
+
+#[derive(Clone, PartialEq, Debug)]
+pub struct UnifiedMappingApiVersion(Option<Version>);
+
+impl UnifiedMappingApiVersion {
+    pub fn equal_or_greater_than(&self, other_version: &Version) -> bool {
+        assert!(
+            other_version >= &API_VERSION_0_0_5,
+            "api versions before 0.0.5 should not be used for comparison"
+        );
+        match &self.0 {
+            Some(version) => version >= other_version,
+            None => false,
+        }
+    }
+
+    pub(super) fn try_from_versions(
+        versions: impl Iterator<Item = Version>,
+    ) -> Result<Self, DifferentMappingApiVersions> {
+        let unique_versions: BTreeSet<Version> = versions.collect();
+
+        let all_below_referential_version = unique_versions.iter().all(|v| *v < API_VERSION_0_0_5);
+        let all_the_same = unique_versions.len() == 1;
+
+        let unified_version: Option<Version> = match (all_below_referential_version, all_the_same) {
+            (false, false) => return Err(DifferentMappingApiVersions(unique_versions)),
+            (false, true) => Some(unique_versions.iter().nth(0).unwrap().clone()),
+            (true, _) => None,
+        };
+
+        Ok(UnifiedMappingApiVersion(unified_version))
+    }
+}
+
+pub(super) fn format_versions(versions: &BTreeSet<Version>) -> String {
+    versions.iter().map(ToString::to_string).join(", ")
+}
+
+#[derive(Error, Debug, PartialEq)]
+#[error("Expected a single apiVersion for mappings. Found: {}.", format_versions(.0))]
+pub struct DifferentMappingApiVersions(pub BTreeSet<Version>);
+
+#[test]
+fn unified_mapping_api_version_from_iterator() {
+    let input = [
+        vec![Version::new(0, 0, 5), Version::new(0, 0, 5)], // Ok(Some(0.0.5))
+        vec![Version::new(0, 0, 6), Version::new(0, 0, 6)], // Ok(Some(0.0.6))
+        vec![Version::new(0, 0, 3), Version::new(0, 0, 4)], // Ok(None)
+        vec![Version::new(0, 0, 4), Version::new(0, 0, 4)], // Ok(None)
+        vec![Version::new(0, 0, 3), Version::new(0, 0, 5)], // Err({0.0.3, 0.0.5})
+        vec![Version::new(0, 0, 6), Version::new(0, 0, 5)], // Err({0.0.5, 0.0.6})
+    ];
+    let output: [Result<UnifiedMappingApiVersion, DifferentMappingApiVersions>; 6] = [
+        Ok(UnifiedMappingApiVersion(Some(Version::new(0, 0, 5)))),
+        Ok(UnifiedMappingApiVersion(Some(Version::new(0, 0, 6)))),
+        Ok(UnifiedMappingApiVersion(None)),
+        Ok(UnifiedMappingApiVersion(None)),
+        Err(DifferentMappingApiVersions(
+            input[4].iter().cloned().collect::<BTreeSet<Version>>(),
+        )),
+        Err(DifferentMappingApiVersions(
+            input[5].iter().cloned().collect::<BTreeSet<Version>>(),
+        )),
+    ];
+    for (version_vec, expected_unified_version) in input.iter().zip(output.iter()) {
+        let unified = UnifiedMappingApiVersion::try_from_versions(version_vec.iter().cloned());
+        match (unified, expected_unified_version) {
+            (Ok(a), Ok(b)) => assert_eq!(a, *b),
+            (Err(a), Err(b)) => assert_eq!(a, *b),
+            _ => panic!(),
+        }
+    }
+}
diff --git a/graph/src/data/subgraph/features.rs b/graph/src/data/subgraph/features.rs
new file mode 100644
index 0000000..29c769f
--- /dev/null
+++ b/graph/src/data/subgraph/features.rs
@@ -0,0 +1,176 @@
+//! Functions to detect subgraph features.
+//!
+//! The rationale of this module revolves around the concept of feature declaration and detection.
+//!
+//! Features are declared in the `subgraph.yml` file, also known as the subgraph's manifest, and are
+//! validated by a graph-node instance during the deploy phase or by direct request.
+//!
+//! A feature validation error will be triggered if a subgraph use any feature without declaring it
+//! in the `features` section of the manifest file.
+//!
+//! Feature validation is performed by the [`validate_subgraph_features`] function.
+
+use crate::{
+    blockchain::Blockchain,
+    data::{graphql::DocumentExt, schema::Schema, subgraph::SubgraphManifest},
+    prelude::{Deserialize, Serialize},
+};
+use itertools::Itertools;
+use std::{collections::BTreeSet, fmt, str::FromStr};
+
+use super::calls_host_fn;
+
+/// This array must contain all IPFS-related functions that are exported by the host WASM runtime.
+///
+/// For reference, search this codebase for: ff652476-e6ad-40e4-85b8-e815d6c6e5e2
+const IPFS_ON_ETHEREUM_CONTRACTS_FUNCTION_NAMES: [&'static str; 3] =
+    ["ipfs.cat", "ipfs.getBlock", "ipfs.map"];
+
+#[derive(Debug, Deserialize, Serialize, Copy, Clone, PartialEq, Eq, PartialOrd, Ord)]
+#[serde(rename_all = "camelCase")]
+pub enum SubgraphFeature {
+    NonFatalErrors,
+    Grafting,
+    FullTextSearch,
+    #[serde(alias = "nonDeterministicIpfs")]
+    IpfsOnEthereumContracts,
+}
+
+impl fmt::Display for SubgraphFeature {
+    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
+        serde_plain::to_string(self)
+            .map_err(|_| fmt::Error)
+            .and_then(|x| write!(f, "{}", x))
+    }
+}
+
+impl FromStr for SubgraphFeature {
+    type Err = anyhow::Error;
+
+    fn from_str(value: &str) -> anyhow::Result<Self> {
+        serde_plain::from_str(value)
+            .map_err(|_error| anyhow::anyhow!("Invalid subgraph feature: {}", value))
+    }
+}
+
+#[derive(PartialEq, Eq, PartialOrd, Ord, Serialize, thiserror::Error, Debug)]
+pub enum SubgraphFeatureValidationError {
+    /// A feature is used by the subgraph but it is not declared in the `features` section of the manifest file.
+    #[error("The feature `{}` is used by the subgraph but it is not declared in the manifest.", fmt_subgraph_features(.0))]
+    Undeclared(BTreeSet<SubgraphFeature>),
+
+    /// The provided compiled mapping is not a valid WASM module.
+    #[error("Failed to parse the provided mapping WASM module")]
+    InvalidMapping,
+}
+
+fn fmt_subgraph_features(subgraph_features: &BTreeSet<SubgraphFeature>) -> String {
+    subgraph_features.iter().join(", ")
+}
+
+pub fn validate_subgraph_features<C: Blockchain>(
+    manifest: &SubgraphManifest<C>,
+) -> Result<BTreeSet<SubgraphFeature>, SubgraphFeatureValidationError> {
+    let declared: &BTreeSet<SubgraphFeature> = &manifest.features;
+    let used = detect_features(manifest)?;
+    let undeclared: BTreeSet<SubgraphFeature> = used.difference(declared).cloned().collect();
+    if !undeclared.is_empty() {
+        Err(SubgraphFeatureValidationError::Undeclared(undeclared))
+    } else {
+        Ok(used)
+    }
+}
+
+pub fn detect_features<C: Blockchain>(
+    manifest: &SubgraphManifest<C>,
+) -> Result<BTreeSet<SubgraphFeature>, InvalidMapping> {
+    let features = vec![
+        detect_non_fatal_errors(manifest),
+        detect_grafting(manifest),
+        detect_full_text_search(&manifest.schema),
+        detect_ipfs_on_ethereum_contracts(manifest)?,
+    ]
+    .into_iter()
+    .flatten()
+    .collect();
+    Ok(features)
+}
+
+fn detect_non_fatal_errors<C: Blockchain>(
+    manifest: &SubgraphManifest<C>,
+) -> Option<SubgraphFeature> {
+    if manifest.features.contains(&SubgraphFeature::NonFatalErrors) {
+        Some(SubgraphFeature::NonFatalErrors)
+    } else {
+        None
+    }
+}
+
+fn detect_grafting<C: Blockchain>(manifest: &SubgraphManifest<C>) -> Option<SubgraphFeature> {
+    manifest.graft.as_ref().map(|_| SubgraphFeature::Grafting)
+}
+
+fn detect_full_text_search(schema: &Schema) -> Option<SubgraphFeature> {
+    match schema.document.get_fulltext_directives() {
+        Ok(directives) => (!directives.is_empty()).then(|| SubgraphFeature::FullTextSearch),
+
+        Err(_) => {
+            // Currently we return an error from `get_fulltext_directives` function if the
+            // fullTextSearch directive is found.
+            Some(SubgraphFeature::FullTextSearch)
+        }
+    }
+}
+
+pub struct InvalidMapping;
+
+impl From<InvalidMapping> for SubgraphFeatureValidationError {
+    fn from(_: InvalidMapping) -> Self {
+        SubgraphFeatureValidationError::InvalidMapping
+    }
+}
+
+fn detect_ipfs_on_ethereum_contracts<C: Blockchain>(
+    manifest: &SubgraphManifest<C>,
+) -> Result<Option<SubgraphFeature>, InvalidMapping> {
+    for runtime in manifest.runtimes() {
+        for function_name in IPFS_ON_ETHEREUM_CONTRACTS_FUNCTION_NAMES {
+            if calls_host_fn(&runtime, function_name).map_err(|_| InvalidMapping)? {
+                return Ok(Some(SubgraphFeature::IpfsOnEthereumContracts));
+            }
+        }
+    }
+    Ok(None)
+}
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+    use SubgraphFeature::*;
+    const VARIANTS: [SubgraphFeature; 4] = [
+        NonFatalErrors,
+        Grafting,
+        FullTextSearch,
+        IpfsOnEthereumContracts,
+    ];
+    const STRING: [&str; 4] = [
+        "nonFatalErrors",
+        "grafting",
+        "fullTextSearch",
+        "ipfsOnEthereumContracts",
+    ];
+
+    #[test]
+    fn subgraph_feature_display() {
+        for (variant, string) in VARIANTS.iter().zip(STRING.iter()) {
+            assert_eq!(variant.to_string(), *string)
+        }
+    }
+
+    #[test]
+    fn subgraph_feature_from_str() {
+        for (variant, string) in VARIANTS.iter().zip(STRING.iter()) {
+            assert_eq!(SubgraphFeature::from_str(string).unwrap(), *variant)
+        }
+    }
+}
diff --git a/graph/src/data/subgraph/mod.rs b/graph/src/data/subgraph/mod.rs
new file mode 100644
index 0000000..3e451eb
--- /dev/null
+++ b/graph/src/data/subgraph/mod.rs
@@ -0,0 +1,873 @@
+/// Rust representation of the GraphQL schema for a `SubgraphManifest`.
+pub mod schema;
+
+/// API version and spec version.
+pub mod api_version;
+pub use api_version::*;
+
+pub mod features;
+pub mod status;
+
+pub use features::{SubgraphFeature, SubgraphFeatureValidationError};
+
+use anyhow::ensure;
+use anyhow::{anyhow, Error};
+use futures03::{future::try_join3, stream::FuturesOrdered, TryStreamExt as _};
+use semver::Version;
+use serde::{de, ser};
+use serde_yaml;
+use slog::{debug, info, Logger};
+use stable_hash::{FieldAddress, StableHash};
+use stable_hash_legacy::SequenceNumber;
+use std::{collections::BTreeSet, marker::PhantomData};
+use thiserror::Error;
+use wasmparser;
+use web3::types::Address;
+
+use crate::{
+    blockchain::{BlockPtr, Blockchain, DataSource as _},
+    components::{
+        link_resolver::LinkResolver,
+        store::{DeploymentLocator, StoreError, SubgraphStore},
+    },
+    data::{
+        graphql::TryFromValue,
+        query::QueryExecutionError,
+        schema::{Schema, SchemaImportError, SchemaValidationError},
+        store::Entity,
+        subgraph::features::validate_subgraph_features,
+    },
+    data_source::{
+        offchain::OFFCHAIN_KINDS, DataSource, DataSourceTemplate, UnresolvedDataSource,
+        UnresolvedDataSourceTemplate,
+    },
+    prelude::{r, CheapClone, ENV_VARS},
+};
+
+use crate::prelude::{impl_slog_value, BlockNumber, Deserialize, Serialize};
+
+use std::fmt;
+use std::ops::Deref;
+use std::str::FromStr;
+use std::sync::Arc;
+
+/// Deserialize an Address (with or without '0x' prefix).
+fn deserialize_address<'de, D>(deserializer: D) -> Result<Option<Address>, D::Error>
+where
+    D: de::Deserializer<'de>,
+{
+    use serde::de::Error;
+
+    let s: String = de::Deserialize::deserialize(deserializer)?;
+    let address = s.trim_start_matches("0x");
+    Address::from_str(address)
+        .map_err(D::Error::custom)
+        .map(Some)
+}
+
+/// The IPFS hash used to identifiy a deployment externally, i.e., the
+/// `Qm..` string that `graph-cli` prints when deploying to a subgraph
+#[derive(Clone, Debug, PartialEq, Eq, Hash, PartialOrd, Ord)]
+pub struct DeploymentHash(String);
+
+impl stable_hash_legacy::StableHash for DeploymentHash {
+    #[inline]
+    fn stable_hash<H: stable_hash_legacy::StableHasher>(
+        &self,
+        mut sequence_number: H::Seq,
+        state: &mut H,
+    ) {
+        let Self(inner) = self;
+        stable_hash_legacy::StableHash::stable_hash(inner, sequence_number.next_child(), state);
+    }
+}
+
+impl StableHash for DeploymentHash {
+    fn stable_hash<H: stable_hash::StableHasher>(&self, field_address: H::Addr, state: &mut H) {
+        let Self(inner) = self;
+        stable_hash::StableHash::stable_hash(inner, field_address.child(0), state);
+    }
+}
+
+impl_slog_value!(DeploymentHash);
+
+/// `DeploymentHash` is fixed-length so cheap to clone.
+impl CheapClone for DeploymentHash {}
+
+impl DeploymentHash {
+    /// Check that `s` is a valid `SubgraphDeploymentId` and create a new one.
+    /// If `s` is longer than 46 characters, or contains characters other than
+    /// alphanumeric characters or `_`, return s (as a `String`) as the error
+    pub fn new(s: impl Into<String>) -> Result<Self, String> {
+        let s = s.into();
+
+        // Enforce length limit
+        if s.len() > 46 {
+            return Err(s);
+        }
+
+        // Check that the ID contains only allowed characters.
+        if !s.chars().all(|c| c.is_ascii_alphanumeric() || c == '_') {
+            return Err(s);
+        }
+
+        // Allow only deployment id's for 'real' subgraphs, not the old
+        // metadata subgraph.
+        if s == "subgraphs" {
+            return Err(s);
+        }
+
+        Ok(DeploymentHash(s))
+    }
+
+    pub fn to_ipfs_link(&self) -> Link {
+        Link {
+            link: format!("/ipfs/{}", self),
+        }
+    }
+}
+
+impl Deref for DeploymentHash {
+    type Target = String;
+
+    fn deref(&self) -> &Self::Target {
+        &self.0
+    }
+}
+
+impl fmt::Display for DeploymentHash {
+    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
+        self.0.fmt(f)
+    }
+}
+
+impl ser::Serialize for DeploymentHash {
+    fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
+    where
+        S: ser::Serializer,
+    {
+        serializer.serialize_str(&self.0)
+    }
+}
+
+impl<'de> de::Deserialize<'de> for DeploymentHash {
+    fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
+    where
+        D: de::Deserializer<'de>,
+    {
+        let s: String = de::Deserialize::deserialize(deserializer)?;
+        DeploymentHash::new(s)
+            .map_err(|s| de::Error::invalid_value(de::Unexpected::Str(&s), &"valid subgraph name"))
+    }
+}
+
+impl TryFromValue for DeploymentHash {
+    fn try_from_value(value: &r::Value) -> Result<Self, Error> {
+        Self::new(String::try_from_value(value)?)
+            .map_err(|s| anyhow!("Invalid subgraph ID `{}`", s))
+    }
+}
+
+#[derive(Clone, Debug, PartialEq, Eq, Hash, PartialOrd, Ord)]
+pub struct SubgraphName(String);
+
+impl SubgraphName {
+    pub fn new(s: impl Into<String>) -> Result<Self, ()> {
+        let s = s.into();
+
+        // Note: these validation rules must be kept consistent with the validation rules
+        // implemented in any other components that rely on subgraph names.
+
+        // Enforce length limits
+        if s.is_empty() || s.len() > 255 {
+            return Err(());
+        }
+
+        // Check that the name contains only allowed characters.
+        if !s
+            .chars()
+            .all(|c| c.is_ascii_alphanumeric() || c == '-' || c == '_' || c == '/')
+        {
+            return Err(());
+        }
+
+        // Parse into components and validate each
+        for part in s.split('/') {
+            // Each part must be non-empty
+            if part.is_empty() {
+                return Err(());
+            }
+
+            // To keep URLs unambiguous, reserve the token "graphql"
+            if part == "graphql" {
+                return Err(());
+            }
+
+            // Part should not start or end with a special character.
+            let first_char = part.chars().next().unwrap();
+            let last_char = part.chars().last().unwrap();
+            if !first_char.is_ascii_alphanumeric()
+                || !last_char.is_ascii_alphanumeric()
+                || !part.chars().any(|c| c.is_ascii_alphabetic())
+            {
+                return Err(());
+            }
+        }
+
+        Ok(SubgraphName(s))
+    }
+
+    pub fn as_str(&self) -> &str {
+        self.0.as_str()
+    }
+}
+
+impl fmt::Display for SubgraphName {
+    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
+        self.0.fmt(f)
+    }
+}
+
+impl ser::Serialize for SubgraphName {
+    fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
+    where
+        S: ser::Serializer,
+    {
+        serializer.serialize_str(&self.0)
+    }
+}
+
+impl<'de> de::Deserialize<'de> for SubgraphName {
+    fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
+    where
+        D: de::Deserializer<'de>,
+    {
+        let s: String = de::Deserialize::deserialize(deserializer)?;
+        SubgraphName::new(s.clone())
+            .map_err(|()| de::Error::invalid_value(de::Unexpected::Str(&s), &"valid subgraph name"))
+    }
+}
+
+/// Result of a creating a subgraph in the registar.
+#[derive(Serialize)]
+pub struct CreateSubgraphResult {
+    /// The ID of the subgraph that was created.
+    pub id: String,
+}
+
+#[derive(Error, Debug)]
+pub enum SubgraphRegistrarError {
+    #[error("subgraph resolve error: {0}")]
+    ResolveError(SubgraphManifestResolveError),
+    #[error("subgraph already exists: {0}")]
+    NameExists(String),
+    #[error("subgraph name not found: {0}")]
+    NameNotFound(String),
+    #[error("network not supported by registrar: {0}")]
+    NetworkNotSupported(Error),
+    #[error("deployment not found: {0}")]
+    DeploymentNotFound(String),
+    #[error("deployment assignment unchanged: {0}")]
+    DeploymentAssignmentUnchanged(String),
+    #[error("subgraph registrar internal query error: {0}")]
+    QueryExecutionError(#[from] QueryExecutionError),
+    #[error("subgraph registrar error with store: {0}")]
+    StoreError(StoreError),
+    #[error("subgraph validation error: {}", display_vector(.0))]
+    ManifestValidationError(Vec<SubgraphManifestValidationError>),
+    #[error("subgraph deployment error: {0}")]
+    SubgraphDeploymentError(StoreError),
+    #[error("subgraph registrar error: {0}")]
+    Unknown(#[from] anyhow::Error),
+}
+
+impl From<StoreError> for SubgraphRegistrarError {
+    fn from(e: StoreError) -> Self {
+        match e {
+            StoreError::DeploymentNotFound(id) => SubgraphRegistrarError::DeploymentNotFound(id),
+            e => SubgraphRegistrarError::StoreError(e),
+        }
+    }
+}
+
+impl From<SubgraphManifestValidationError> for SubgraphRegistrarError {
+    fn from(e: SubgraphManifestValidationError) -> Self {
+        SubgraphRegistrarError::ManifestValidationError(vec![e])
+    }
+}
+
+#[derive(Error, Debug)]
+pub enum SubgraphAssignmentProviderError {
+    #[error("Subgraph resolve error: {0}")]
+    ResolveError(Error),
+    /// Occurs when attempting to remove a subgraph that's not hosted.
+    #[error("Subgraph with ID {0} already running")]
+    AlreadyRunning(DeploymentHash),
+    #[error("Subgraph with ID {0} is not running")]
+    NotRunning(DeploymentLocator),
+    #[error("Subgraph provider error: {0}")]
+    Unknown(#[from] anyhow::Error),
+}
+
+impl From<::diesel::result::Error> for SubgraphAssignmentProviderError {
+    fn from(e: ::diesel::result::Error) -> Self {
+        SubgraphAssignmentProviderError::Unknown(e.into())
+    }
+}
+
+#[derive(Error, Debug)]
+pub enum SubgraphManifestValidationWarning {
+    #[error("schema validation produced warnings: {0:?}")]
+    SchemaValidationWarning(SchemaImportError),
+}
+
+#[derive(Error, Debug)]
+pub enum SubgraphManifestValidationError {
+    #[error("subgraph has no data sources")]
+    NoDataSources,
+    #[error("subgraph source address is required")]
+    SourceAddressRequired,
+    #[error("subgraph cannot index data from different Ethereum networks")]
+    MultipleEthereumNetworks,
+    #[error("subgraph must have at least one Ethereum network data source")]
+    EthereumNetworkRequired,
+    #[error("the specified block must exist on the Ethereum network")]
+    BlockNotFound(String),
+    #[error("imported schema(s) are invalid: {0:?}")]
+    SchemaImportError(Vec<SchemaImportError>),
+    #[error("schema validation failed: {0:?}")]
+    SchemaValidationError(Vec<SchemaValidationError>),
+    #[error("the graft base is invalid: {0}")]
+    GraftBaseInvalid(String),
+    #[error("subgraph must use a single apiVersion across its data sources. Found: {}", format_versions(&(.0).0))]
+    DifferentApiVersions(#[from] DifferentMappingApiVersions),
+    #[error(transparent)]
+    FeatureValidationError(#[from] SubgraphFeatureValidationError),
+    #[error("data source {0} is invalid: {1}")]
+    DataSourceValidation(String, Error),
+}
+
+#[derive(Error, Debug)]
+pub enum SubgraphManifestResolveError {
+    #[error("parse error: {0}")]
+    ParseError(#[from] serde_yaml::Error),
+    #[error("subgraph is not UTF-8")]
+    NonUtf8,
+    #[error("subgraph is not valid YAML")]
+    InvalidFormat,
+    #[error("resolve error: {0}")]
+    ResolveError(anyhow::Error),
+}
+
+/// Data source contexts are conveniently represented as entities.
+pub type DataSourceContext = Entity;
+
+/// IPLD link.
+#[derive(Clone, Debug, Default, Hash, Eq, PartialEq, Deserialize)]
+pub struct Link {
+    #[serde(rename = "/")]
+    pub link: String,
+}
+
+impl<S: ToString> From<S> for Link {
+    fn from(s: S) -> Self {
+        Self {
+            link: s.to_string(),
+        }
+    }
+}
+
+#[derive(Clone, Debug, Hash, Eq, PartialEq, Deserialize)]
+pub struct UnresolvedSchema {
+    pub file: Link,
+}
+
+impl UnresolvedSchema {
+    pub async fn resolve(
+        self,
+        id: DeploymentHash,
+        resolver: &Arc<dyn LinkResolver>,
+        logger: &Logger,
+    ) -> Result<Schema, anyhow::Error> {
+        info!(logger, "Resolve schema"; "link" => &self.file.link);
+
+        let schema_bytes = resolver.cat(logger, &self.file).await?;
+        Schema::parse(&String::from_utf8(schema_bytes)?, id)
+    }
+}
+
+#[derive(Clone, Debug, Hash, Eq, PartialEq, Deserialize)]
+pub struct Source {
+    /// The contract address for the data source. We allow data sources
+    /// without an address for 'wildcard' triggers that catch all possible
+    /// events with the given `abi`
+    #[serde(default, deserialize_with = "deserialize_address")]
+    pub address: Option<Address>,
+    pub abi: String,
+    #[serde(rename = "startBlock", default)]
+    pub start_block: BlockNumber,
+}
+
+pub fn calls_host_fn(runtime: &[u8], host_fn: &str) -> anyhow::Result<bool> {
+    use wasmparser::Payload;
+
+    for payload in wasmparser::Parser::new(0).parse_all(runtime) {
+        if let Payload::ImportSection(s) = payload? {
+            for import in s {
+                let import = import?;
+                if import.field == Some(host_fn) {
+                    return Ok(true);
+                }
+            }
+        }
+    }
+
+    Ok(false)
+}
+
+#[derive(Clone, Debug, Deserialize)]
+#[serde(rename_all = "camelCase")]
+pub struct Graft {
+    pub base: DeploymentHash,
+    pub block: BlockNumber,
+}
+
+impl Graft {
+    async fn validate<S: SubgraphStore>(
+        &self,
+        store: Arc<S>,
+    ) -> Result<(), SubgraphManifestValidationError> {
+        use SubgraphManifestValidationError::*;
+
+        let last_processed_block = store
+            .least_block_ptr(&self.base)
+            .await
+            .map_err(|e| GraftBaseInvalid(e.to_string()))?;
+        let is_base_healthy = store
+            .is_healthy(&self.base)
+            .await
+            .map_err(|e| GraftBaseInvalid(e.to_string()))?;
+
+        // We are being defensive here: we don't know which specific
+        // instance of a subgraph we will use as the base for the graft,
+        // since the notion of which of these instances is active can change
+        // between this check and when the graft actually happens when the
+        // subgraph is started. We therefore check that any instance of the
+        // base subgraph is suitable.
+        match (last_processed_block, is_base_healthy) {
+            (None, _) => Err(GraftBaseInvalid(format!(
+                "failed to graft onto `{}` since it has not processed any blocks",
+                self.base
+            ))),
+            (Some(ptr), true) if ptr.number < self.block => Err(GraftBaseInvalid(format!(
+                "failed to graft onto `{}` at block {} since it has only processed block {}",
+                self.base, self.block, ptr.number
+            ))),
+            // If the base deployment is failed *and* the `graft.block` is not
+            // less than the `base.block`, the graft shouldn't be permitted.
+            //
+            // The developer should change their `graft.block` in the manifest
+            // to `base.block - 1` or less.
+            (Some(ptr), false) if !(self.block < ptr.number) => Err(GraftBaseInvalid(format!(
+                "failed to graft onto `{}` at block {} since it's not healthy. You can graft it starting at block {} backwards",
+                self.base, self.block, ptr.number - 1
+            ))),
+            (Some(_), _) => Ok(()),
+        }
+    }
+}
+
+#[derive(Debug, Deserialize)]
+#[serde(rename_all = "camelCase")]
+pub struct BaseSubgraphManifest<C, S, D, T> {
+    pub id: DeploymentHash,
+    pub spec_version: Version,
+    #[serde(default)]
+    pub features: BTreeSet<SubgraphFeature>,
+    pub description: Option<String>,
+    pub repository: Option<String>,
+    pub schema: S,
+    pub data_sources: Vec<D>,
+    pub graft: Option<Graft>,
+    #[serde(default)]
+    pub templates: Vec<T>,
+    #[serde(skip_serializing, default)]
+    pub chain: PhantomData<C>,
+}
+
+/// SubgraphManifest with IPFS links unresolved
+type UnresolvedSubgraphManifest<C> = BaseSubgraphManifest<
+    C,
+    UnresolvedSchema,
+    UnresolvedDataSource<C>,
+    UnresolvedDataSourceTemplate<C>,
+>;
+
+/// SubgraphManifest validated with IPFS links resolved
+pub type SubgraphManifest<C> =
+    BaseSubgraphManifest<C, Schema, DataSource<C>, DataSourceTemplate<C>>;
+
+/// Unvalidated SubgraphManifest
+pub struct UnvalidatedSubgraphManifest<C: Blockchain>(SubgraphManifest<C>);
+
+impl<C: Blockchain> UnvalidatedSubgraphManifest<C> {
+    /// Entry point for resolving a subgraph definition.
+    /// Right now the only supported links are of the form:
+    /// `/ipfs/QmUmg7BZC1YP1ca66rRtWKxpXp77WgVHrnv263JtDuvs2k`
+    pub async fn resolve(
+        id: DeploymentHash,
+        raw: serde_yaml::Mapping,
+        resolver: &Arc<dyn LinkResolver>,
+        logger: &Logger,
+        max_spec_version: semver::Version,
+    ) -> Result<Self, SubgraphManifestResolveError> {
+        Ok(Self(
+            SubgraphManifest::resolve_from_raw(id, raw, resolver, logger, max_spec_version).await?,
+        ))
+    }
+
+    /// Validates the subgraph manifest file.
+    ///
+    /// Graft base validation will be skipped if the parameter `validate_graft_base` is false.
+    pub async fn validate<S: SubgraphStore>(
+        self,
+        store: Arc<S>,
+        validate_graft_base: bool,
+    ) -> Result<SubgraphManifest<C>, Vec<SubgraphManifestValidationError>> {
+        let (schemas, _) = self.0.schema.resolve_schema_references(store.clone());
+
+        let mut errors: Vec<SubgraphManifestValidationError> = vec![];
+
+        // Validate that the manifest has at least one data source
+        if self.0.data_sources.is_empty() {
+            errors.push(SubgraphManifestValidationError::NoDataSources);
+        }
+
+        for ds in &self.0.data_sources {
+            errors.extend(ds.validate().into_iter().map(|e| {
+                SubgraphManifestValidationError::DataSourceValidation(ds.name().to_owned(), e)
+            }));
+        }
+
+        // For API versions newer than 0.0.5, validate that all mappings uses the same api_version
+        if let Err(different_api_versions) = self.0.unified_mapping_api_version() {
+            errors.push(different_api_versions.into());
+        };
+
+        let mut networks = self
+            .0
+            .data_sources
+            .iter()
+            .filter_map(|d| Some(d.as_onchain()?.network()?.to_string()))
+            .collect::<Vec<String>>();
+        networks.sort();
+        networks.dedup();
+        match networks.len() {
+            0 => errors.push(SubgraphManifestValidationError::EthereumNetworkRequired),
+            1 => (),
+            _ => errors.push(SubgraphManifestValidationError::MultipleEthereumNetworks),
+        }
+
+        self.0
+            .schema
+            .validate(&schemas)
+            .err()
+            .into_iter()
+            .for_each(|schema_errors| {
+                errors.push(SubgraphManifestValidationError::SchemaValidationError(
+                    schema_errors,
+                ));
+            });
+
+        if let Some(graft) = &self.0.graft {
+            if ENV_VARS.disable_grafts {
+                errors.push(SubgraphManifestValidationError::GraftBaseInvalid(
+                    "Grafting of subgraphs is currently disabled".to_owned(),
+                ));
+            }
+            if validate_graft_base {
+                if let Err(graft_err) = graft.validate(store).await {
+                    errors.push(graft_err);
+                }
+            }
+        }
+
+        // Validate subgraph feature usage and declaration.
+        if self.0.spec_version >= SPEC_VERSION_0_0_4 {
+            if let Err(feature_validation_error) = validate_subgraph_features(&self.0) {
+                errors.push(feature_validation_error.into())
+            }
+        }
+
+        match errors.is_empty() {
+            true => Ok(self.0),
+            false => Err(errors),
+        }
+    }
+
+    pub fn spec_version(&self) -> &Version {
+        &self.0.spec_version
+    }
+}
+
+impl<C: Blockchain> SubgraphManifest<C> {
+    /// Entry point for resolving a subgraph definition.
+    pub async fn resolve_from_raw(
+        id: DeploymentHash,
+        mut raw: serde_yaml::Mapping,
+        resolver: &Arc<dyn LinkResolver>,
+        logger: &Logger,
+        max_spec_version: semver::Version,
+    ) -> Result<Self, SubgraphManifestResolveError> {
+        // Inject the IPFS hash as the ID of the subgraph into the definition.
+        raw.insert("id".into(), id.to_string().into());
+
+        // Parse the YAML data into an UnresolvedSubgraphManifest
+        let unresolved: UnresolvedSubgraphManifest<C> = serde_yaml::from_value(raw.into())?;
+
+        debug!(logger, "Features {:?}", unresolved.features);
+
+        let resolved = unresolved
+            .resolve(resolver, logger, max_spec_version)
+            .await
+            .map_err(SubgraphManifestResolveError::ResolveError)?;
+
+        if (resolved.spec_version < SPEC_VERSION_0_0_7)
+            && resolved
+                .data_sources
+                .iter()
+                .any(|ds| OFFCHAIN_KINDS.contains(&ds.kind()))
+        {
+            return Err(SubgraphManifestResolveError::ResolveError(anyhow!(
+                "Offchain data sources not supported prior to {}",
+                SPEC_VERSION_0_0_7
+            )));
+        }
+
+        Ok(resolved)
+    }
+
+    pub fn network_name(&self) -> String {
+        // Assume the manifest has been validated, ensuring network names are homogenous
+        self.data_sources
+            .iter()
+            .find_map(|d| Some(d.as_onchain()?.network()?.to_string()))
+            .expect("Validated manifest does not have a network defined on any datasource")
+    }
+
+    pub fn start_blocks(&self) -> Vec<BlockNumber> {
+        self.data_sources
+            .iter()
+            .filter_map(|d| Some(d.as_onchain()?.start_block()))
+            .collect()
+    }
+
+    pub fn api_versions(&self) -> impl Iterator<Item = semver::Version> + '_ {
+        self.templates
+            .iter()
+            .map(|template| template.api_version())
+            .chain(self.data_sources.iter().map(|source| source.api_version()))
+    }
+
+    pub fn runtimes(&self) -> impl Iterator<Item = Arc<Vec<u8>>> + '_ {
+        self.templates
+            .iter()
+            .filter_map(|template| template.runtime())
+            .chain(
+                self.data_sources
+                    .iter()
+                    .filter_map(|source| source.runtime()),
+            )
+    }
+
+    pub fn unified_mapping_api_version(
+        &self,
+    ) -> Result<UnifiedMappingApiVersion, DifferentMappingApiVersions> {
+        UnifiedMappingApiVersion::try_from_versions(self.api_versions())
+    }
+}
+
+impl<C: Blockchain> UnresolvedSubgraphManifest<C> {
+    pub async fn resolve(
+        self,
+        resolver: &Arc<dyn LinkResolver>,
+        logger: &Logger,
+        max_spec_version: semver::Version,
+    ) -> Result<SubgraphManifest<C>, anyhow::Error> {
+        let UnresolvedSubgraphManifest {
+            id,
+            spec_version,
+            features,
+            description,
+            repository,
+            schema,
+            data_sources,
+            graft,
+            templates,
+            chain,
+        } = self;
+
+        if !(MIN_SPEC_VERSION..=max_spec_version.clone()).contains(&spec_version) {
+            return Err(anyhow!(
+                "This Graph Node only supports manifest spec versions between {} and {}, but subgraph `{}` uses `{}`",
+                MIN_SPEC_VERSION,
+                max_spec_version,
+                id,
+                spec_version
+            ));
+        }
+
+        let ds_count = data_sources.len();
+        if ds_count as u64 + templates.len() as u64 > u32::MAX as u64 {
+            return Err(anyhow!(
+                "Subgraph has too many declared data sources and templates",
+            ));
+        }
+
+        let (schema, data_sources, templates) = try_join3(
+            schema.resolve(id.clone(), &resolver, logger),
+            data_sources
+                .into_iter()
+                .enumerate()
+                .map(|(idx, ds)| ds.resolve(&resolver, logger, idx as u32))
+                .collect::<FuturesOrdered<_>>()
+                .try_collect::<Vec<_>>(),
+            templates
+                .into_iter()
+                .enumerate()
+                .map(|(idx, template)| {
+                    template.resolve(&resolver, logger, ds_count as u32 + idx as u32)
+                })
+                .collect::<FuturesOrdered<_>>()
+                .try_collect::<Vec<_>>(),
+        )
+        .await?;
+
+        for ds in &data_sources {
+            ensure!(
+                semver::VersionReq::parse(&format!("<= {}", ENV_VARS.mappings.max_api_version))
+                    .unwrap()
+                    .matches(&ds.api_version()),
+                "The maximum supported mapping API version of this indexer is {}, but `{}` was found",
+                ENV_VARS.mappings.max_api_version,
+                ds.api_version()
+            );
+        }
+
+        Ok(SubgraphManifest {
+            id,
+            spec_version,
+            features,
+            description,
+            repository,
+            schema,
+            data_sources,
+            graft,
+            templates,
+            chain,
+        })
+    }
+}
+
+/// Important details about the current state of a subgraph deployment
+/// used while executing queries against a deployment
+///
+/// The `reorg_count` and `max_reorg_depth` fields are maintained (in the
+/// database) by `store::metadata::forward_block_ptr` and
+/// `store::metadata::revert_block_ptr` which get called as part of transacting
+/// new entities into the store or reverting blocks.
+#[derive(Debug, Clone)]
+pub struct DeploymentState {
+    pub id: DeploymentHash,
+    /// The number of blocks that were ever reverted in this subgraph. This
+    /// number increases monotonically every time a block is reverted
+    pub reorg_count: u32,
+    /// The maximum number of blocks we ever reorged without moving a block
+    /// forward in between
+    pub max_reorg_depth: u32,
+    /// The last block that the subgraph has processed
+    pub latest_block: BlockPtr,
+    /// The earliest block that the subgraph has processed
+    pub earliest_block_number: BlockNumber,
+}
+
+impl DeploymentState {
+    /// Is this subgraph deployed and has it processed any blocks?
+    pub fn is_deployed(&self) -> bool {
+        self.latest_block.number > 0
+    }
+
+    pub fn block_queryable(&self, block: BlockNumber) -> Result<(), String> {
+        if block > self.latest_block.number {
+            return Err(format!(
+                "subgraph {} has only indexed up to block number {} \
+                        and data for block number {} is therefore not yet available",
+                self.id, self.latest_block.number, block
+            ));
+        }
+        if block < self.earliest_block_number {
+            return Err(format!(
+                "subgraph {} only has data starting at block number {} \
+                            and data for block number {} is therefore not available",
+                self.id, self.earliest_block_number, block
+            ));
+        }
+        Ok(())
+    }
+}
+
+fn display_vector(input: &[impl std::fmt::Display]) -> impl std::fmt::Display {
+    let formatted_errors = input
+        .iter()
+        .map(ToString::to_string)
+        .collect::<Vec<String>>()
+        .join("; ");
+    format!("[{}]", formatted_errors)
+}
+
+#[test]
+fn test_subgraph_name_validation() {
+    assert!(SubgraphName::new("a").is_ok());
+    assert!(SubgraphName::new("a/a").is_ok());
+    assert!(SubgraphName::new("a-lOng-name_with_0ne-component").is_ok());
+    assert!(SubgraphName::new("a-long-name_with_one-3omponent").is_ok());
+    assert!(SubgraphName::new("a/b_c").is_ok());
+    assert!(SubgraphName::new("A/Z-Z").is_ok());
+    assert!(SubgraphName::new("a1/A-A").is_ok());
+    assert!(SubgraphName::new("aaa/a1").is_ok());
+    assert!(SubgraphName::new("1a/aaaa").is_ok());
+    assert!(SubgraphName::new("aaaa/1a").is_ok());
+    assert!(SubgraphName::new("2nena4test/lala").is_ok());
+
+    assert!(SubgraphName::new("").is_err());
+    assert!(SubgraphName::new("/a").is_err());
+    assert!(SubgraphName::new("a/").is_err());
+    assert!(SubgraphName::new("a//a").is_err());
+    assert!(SubgraphName::new("a/0").is_err());
+    assert!(SubgraphName::new("a/_").is_err());
+    assert!(SubgraphName::new("a/a_").is_err());
+    assert!(SubgraphName::new("a/_a").is_err());
+    assert!(SubgraphName::new("aaaa aaaaa").is_err());
+    assert!(SubgraphName::new("aaaa!aaaaa").is_err());
+    assert!(SubgraphName::new("aaaa+aaaaa").is_err());
+    assert!(SubgraphName::new("a/graphql").is_err());
+    assert!(SubgraphName::new("graphql/a").is_err());
+    assert!(SubgraphName::new("this-component-is-very-long-but-we-dont-care").is_ok());
+}
+
+#[test]
+fn test_display_vector() {
+    let manifest_validation_error = SubgraphRegistrarError::ManifestValidationError(vec![
+        SubgraphManifestValidationError::NoDataSources,
+        SubgraphManifestValidationError::SourceAddressRequired,
+    ]);
+
+    let expected_display_message =
+	"subgraph validation error: [subgraph has no data sources; subgraph source address is required]"
+	.to_string();
+
+    assert_eq!(
+        expected_display_message,
+        format!("{}", manifest_validation_error)
+    )
+}
diff --git a/graph/src/data/subgraph/schema.rs b/graph/src/data/subgraph/schema.rs
new file mode 100644
index 0000000..c8e5d7f
--- /dev/null
+++ b/graph/src/data/subgraph/schema.rs
@@ -0,0 +1,223 @@
+//! Entity types that contain the graph-node state.
+
+use anyhow::{anyhow, Error};
+use hex;
+use lazy_static::lazy_static;
+use rand::rngs::OsRng;
+use rand::Rng;
+use std::str::FromStr;
+use std::{fmt, fmt::Display};
+
+use super::DeploymentHash;
+use crate::data::graphql::TryFromValue;
+use crate::data::store::Value;
+use crate::data::subgraph::SubgraphManifest;
+use crate::prelude::*;
+use crate::util::stable_hash_glue::impl_stable_hash;
+use crate::{blockchain::Blockchain, components::store::EntityType};
+
+pub const POI_TABLE: &str = "poi2$";
+lazy_static! {
+    pub static ref POI_OBJECT: EntityType = EntityType::new("Poi$".to_string());
+}
+
+#[derive(Copy, Clone, PartialEq, Eq, Debug)]
+pub enum SubgraphHealth {
+    /// Syncing without errors.
+    Healthy,
+
+    /// Syncing but has errors.
+    Unhealthy,
+
+    /// No longer syncing due to fatal error.
+    Failed,
+}
+
+impl SubgraphHealth {
+    pub fn as_str(&self) -> &'static str {
+        match self {
+            SubgraphHealth::Healthy => "healthy",
+            SubgraphHealth::Unhealthy => "unhealthy",
+            SubgraphHealth::Failed => "failed",
+        }
+    }
+
+    pub fn is_failed(&self) -> bool {
+        match self {
+            SubgraphHealth::Failed => true,
+            SubgraphHealth::Healthy | SubgraphHealth::Unhealthy => false,
+        }
+    }
+}
+
+impl FromStr for SubgraphHealth {
+    type Err = Error;
+
+    fn from_str(s: &str) -> Result<SubgraphHealth, Error> {
+        match s {
+            "healthy" => Ok(SubgraphHealth::Healthy),
+            "unhealthy" => Ok(SubgraphHealth::Unhealthy),
+            "failed" => Ok(SubgraphHealth::Failed),
+            _ => Err(anyhow!("failed to parse `{}` as SubgraphHealth", s)),
+        }
+    }
+}
+
+impl From<SubgraphHealth> for String {
+    fn from(health: SubgraphHealth) -> String {
+        health.as_str().to_string()
+    }
+}
+
+impl From<SubgraphHealth> for Value {
+    fn from(health: SubgraphHealth) -> Value {
+        String::from(health).into()
+    }
+}
+
+impl From<SubgraphHealth> for q::Value {
+    fn from(health: SubgraphHealth) -> q::Value {
+        q::Value::Enum(health.into())
+    }
+}
+
+impl From<SubgraphHealth> for r::Value {
+    fn from(health: SubgraphHealth) -> r::Value {
+        r::Value::Enum(health.into())
+    }
+}
+
+impl TryFromValue for SubgraphHealth {
+    fn try_from_value(value: &r::Value) -> Result<SubgraphHealth, Error> {
+        match value {
+            r::Value::Enum(health) => SubgraphHealth::from_str(health),
+            _ => Err(anyhow!(
+                "cannot parse value as SubgraphHealth: `{:?}`",
+                value
+            )),
+        }
+    }
+}
+
+/// The deployment data that is needed to create a deployment
+pub struct DeploymentCreate {
+    pub manifest: SubgraphManifestEntity,
+    pub earliest_block: Option<BlockPtr>,
+    pub graft_base: Option<DeploymentHash>,
+    pub graft_block: Option<BlockPtr>,
+    pub debug_fork: Option<DeploymentHash>,
+}
+
+impl DeploymentCreate {
+    pub fn new(
+        source_manifest: &SubgraphManifest<impl Blockchain>,
+        earliest_block: Option<BlockPtr>,
+    ) -> Self {
+        Self {
+            manifest: SubgraphManifestEntity::from(source_manifest),
+            earliest_block: earliest_block.cheap_clone(),
+            graft_base: None,
+            graft_block: None,
+            debug_fork: None,
+        }
+    }
+
+    pub fn graft(mut self, base: Option<(DeploymentHash, BlockPtr)>) -> Self {
+        if let Some((subgraph, ptr)) = base {
+            self.graft_base = Some(subgraph);
+            self.graft_block = Some(ptr);
+        }
+        self
+    }
+
+    pub fn debug(mut self, fork: Option<DeploymentHash>) -> Self {
+        self.debug_fork = fork;
+        self
+    }
+}
+
+/// The representation of a subgraph deployment when reading an existing
+/// deployment
+#[derive(Debug)]
+pub struct SubgraphDeploymentEntity {
+    pub manifest: SubgraphManifestEntity,
+    pub failed: bool,
+    pub health: SubgraphHealth,
+    pub synced: bool,
+    pub fatal_error: Option<SubgraphError>,
+    pub non_fatal_errors: Vec<SubgraphError>,
+    pub earliest_block: Option<BlockPtr>,
+    pub latest_block: Option<BlockPtr>,
+    pub graft_base: Option<DeploymentHash>,
+    pub graft_block: Option<BlockPtr>,
+    pub debug_fork: Option<DeploymentHash>,
+    pub reorg_count: i32,
+    pub current_reorg_depth: i32,
+    pub max_reorg_depth: i32,
+}
+
+#[derive(Debug)]
+pub struct SubgraphManifestEntity {
+    pub spec_version: String,
+    pub description: Option<String>,
+    pub repository: Option<String>,
+    pub features: Vec<String>,
+    pub schema: String,
+}
+
+impl<'a, C: Blockchain> From<&'a super::SubgraphManifest<C>> for SubgraphManifestEntity {
+    fn from(manifest: &'a super::SubgraphManifest<C>) -> Self {
+        Self {
+            spec_version: manifest.spec_version.to_string(),
+            description: manifest.description.clone(),
+            repository: manifest.repository.clone(),
+            features: manifest.features.iter().map(|f| f.to_string()).collect(),
+            schema: manifest.schema.document.clone().to_string(),
+        }
+    }
+}
+
+#[derive(Clone, Debug)]
+pub struct SubgraphError {
+    pub subgraph_id: DeploymentHash,
+    pub message: String,
+    pub block_ptr: Option<BlockPtr>,
+    pub handler: Option<String>,
+
+    // `true` if we are certain the error is deterministic. If in doubt, this is `false`.
+    pub deterministic: bool,
+}
+
+impl Display for SubgraphError {
+    fn fmt(&self, f: &mut fmt::Formatter) -> Result<(), fmt::Error> {
+        write!(f, "{}", self.message)?;
+        if let Some(handler) = &self.handler {
+            write!(f, " in handler `{}`", handler)?;
+        }
+        if let Some(block_ptr) = &self.block_ptr {
+            write!(f, " at block {}", block_ptr)?;
+        }
+        Ok(())
+    }
+}
+
+impl_stable_hash!(SubgraphError {
+    subgraph_id,
+    message,
+    block_ptr,
+    handler,
+    deterministic
+});
+
+pub fn generate_entity_id() -> String {
+    // Fast crypto RNG from operating system
+    let mut rng = OsRng::default();
+
+    // 128 random bits
+    let id_bytes: [u8; 16] = rng.gen();
+
+    // 32 hex chars
+    // Comparable to uuidv4, but without the hyphens,
+    // and without spending bits on a version identifier.
+    hex::encode(id_bytes)
+}
diff --git a/graph/src/data/subgraph/status.rs b/graph/src/data/subgraph/status.rs
new file mode 100644
index 0000000..0813221
--- /dev/null
+++ b/graph/src/data/subgraph/status.rs
@@ -0,0 +1,171 @@
+//! Support for the indexing status API
+
+use super::schema::{SubgraphError, SubgraphHealth};
+use crate::blockchain::BlockHash;
+use crate::components::store::{BlockNumber, DeploymentId};
+use crate::data::graphql::{object, IntoValue};
+use crate::prelude::{r, BlockPtr, Value};
+
+pub enum Filter {
+    /// Get all versions for the named subgraph
+    SubgraphName(String),
+    /// Get the current (`true`) or pending (`false`) version of the named
+    /// subgraph
+    SubgraphVersion(String, bool),
+    /// Get the status of all deployments whose the given given IPFS hashes
+    Deployments(Vec<String>),
+    /// Get the status of all deployments with the given ids
+    DeploymentIds(Vec<DeploymentId>),
+}
+
+/// Light wrapper around `EthereumBlockPointer` that is compatible with GraphQL values.
+#[derive(Debug)]
+pub struct EthereumBlock(BlockPtr);
+
+impl EthereumBlock {
+    pub fn new(hash: BlockHash, number: BlockNumber) -> Self {
+        EthereumBlock(BlockPtr::new(hash, number))
+    }
+
+    pub fn to_ptr(self) -> BlockPtr {
+        self.0
+    }
+
+    pub fn number(&self) -> i32 {
+        self.0.number
+    }
+}
+
+impl IntoValue for EthereumBlock {
+    fn into_value(self) -> r::Value {
+        object! {
+            __typename: "EthereumBlock",
+            hash: self.0.hash_hex(),
+            number: format!("{}", self.0.number),
+        }
+    }
+}
+
+impl From<BlockPtr> for EthereumBlock {
+    fn from(ptr: BlockPtr) -> Self {
+        Self(ptr)
+    }
+}
+
+/// Indexing status information related to the chain. Right now, we only
+/// support Ethereum, but once we support more chains, we'll have to turn this into
+/// an enum
+#[derive(Debug)]
+pub struct ChainInfo {
+    /// The network name (e.g. `mainnet`, `ropsten`, `rinkeby`, `kovan` or `goerli`).
+    pub network: String,
+    /// The current head block of the chain.
+    pub chain_head_block: Option<EthereumBlock>,
+    /// The earliest block available for this subgraph (only the number).
+    pub earliest_block_number: BlockNumber,
+    /// The latest block that the subgraph has synced to.
+    pub latest_block: Option<EthereumBlock>,
+}
+
+impl IntoValue for ChainInfo {
+    fn into_value(self) -> r::Value {
+        let ChainInfo {
+            network,
+            chain_head_block,
+            earliest_block_number,
+            latest_block,
+        } = self;
+        object! {
+            // `__typename` is needed for the `ChainIndexingStatus` interface
+            // in GraphQL to work.
+            __typename: "EthereumIndexingStatus",
+            network: network,
+            chainHeadBlock: chain_head_block,
+            earliestBlock: object! {
+                __typename: "EarliestBlock",
+                number: earliest_block_number,
+                hash: "0x0"
+            },
+            latestBlock: latest_block,
+        }
+    }
+}
+
+#[derive(Debug)]
+pub struct Info {
+    pub id: DeploymentId,
+
+    /// The deployment hash
+    pub subgraph: String,
+
+    /// Whether or not the subgraph has synced all the way to the current chain head.
+    pub synced: bool,
+    pub health: SubgraphHealth,
+    pub fatal_error: Option<SubgraphError>,
+    pub non_fatal_errors: Vec<SubgraphError>,
+
+    /// Indexing status on different chains involved in the subgraph's data sources.
+    pub chains: Vec<ChainInfo>,
+
+    pub entity_count: u64,
+
+    /// ID of the Graph Node that the subgraph is indexed by.
+    pub node: Option<String>,
+}
+
+impl IntoValue for Info {
+    fn into_value(self) -> r::Value {
+        let Info {
+            id: _,
+            subgraph,
+            chains,
+            entity_count,
+            fatal_error,
+            health,
+            node,
+            non_fatal_errors,
+            synced,
+        } = self;
+
+        fn subgraph_error_to_value(subgraph_error: SubgraphError) -> r::Value {
+            let SubgraphError {
+                subgraph_id,
+                message,
+                block_ptr,
+                handler,
+                deterministic,
+            } = subgraph_error;
+
+            object! {
+                __typename: "SubgraphError",
+                subgraphId: subgraph_id.to_string(),
+                message: message,
+                handler: handler,
+                block: object! {
+                    __typename: "Block",
+                    number: block_ptr.as_ref().map(|x| x.number),
+                    hash: block_ptr.map(|x| r::Value::from(Value::Bytes(x.hash.into()))),
+                },
+                deterministic: deterministic,
+            }
+        }
+
+        let non_fatal_errors: Vec<_> = non_fatal_errors
+            .into_iter()
+            .map(subgraph_error_to_value)
+            .collect();
+        let fatal_error_val = fatal_error.map_or(r::Value::Null, subgraph_error_to_value);
+
+        object! {
+            __typename: "SubgraphIndexingStatus",
+            subgraph: subgraph,
+            synced: synced,
+            health: r::Value::from(health),
+            fatalError: fatal_error_val,
+            nonFatalErrors: non_fatal_errors,
+            chains: chains.into_iter().map(|chain| chain.into_value()).collect::<Vec<_>>(),
+            entityCount: format!("{}", entity_count),
+            node: node,
+        }
+    }
+}
diff --git a/graph/src/data/subscription/error.rs b/graph/src/data/subscription/error.rs
new file mode 100644
index 0000000..20cf3f3
--- /dev/null
+++ b/graph/src/data/subscription/error.rs
@@ -0,0 +1,34 @@
+use serde::ser::*;
+
+use crate::prelude::QueryExecutionError;
+use thiserror::Error;
+
+/// Error caused while processing a [Subscription](struct.Subscription.html) request.
+#[derive(Debug, Error)]
+pub enum SubscriptionError {
+    #[error("GraphQL error: {0:?}")]
+    GraphQLError(Vec<QueryExecutionError>),
+}
+
+impl From<QueryExecutionError> for SubscriptionError {
+    fn from(e: QueryExecutionError) -> Self {
+        SubscriptionError::GraphQLError(vec![e])
+    }
+}
+
+impl From<Vec<QueryExecutionError>> for SubscriptionError {
+    fn from(e: Vec<QueryExecutionError>) -> Self {
+        SubscriptionError::GraphQLError(e)
+    }
+}
+impl Serialize for SubscriptionError {
+    fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
+    where
+        S: Serializer,
+    {
+        let mut map = serializer.serialize_map(Some(1))?;
+        let msg = format!("{}", self);
+        map.serialize_entry("message", msg.as_str())?;
+        map.end()
+    }
+}
diff --git a/graph/src/data/subscription/mod.rs b/graph/src/data/subscription/mod.rs
new file mode 100644
index 0000000..093c000
--- /dev/null
+++ b/graph/src/data/subscription/mod.rs
@@ -0,0 +1,7 @@
+mod error;
+mod result;
+mod subscription;
+
+pub use self::error::SubscriptionError;
+pub use self::result::{QueryResultStream, SubscriptionResult};
+pub use self::subscription::Subscription;
diff --git a/graph/src/data/subscription/result.rs b/graph/src/data/subscription/result.rs
new file mode 100644
index 0000000..648ce79
--- /dev/null
+++ b/graph/src/data/subscription/result.rs
@@ -0,0 +1,10 @@
+use crate::prelude::QueryResult;
+use std::pin::Pin;
+use std::sync::Arc;
+
+/// A stream of query results for a subscription.
+pub type QueryResultStream =
+    Pin<Box<dyn futures03::stream::Stream<Item = Arc<QueryResult>> + Send>>;
+
+/// The result of running a subscription, if successful.
+pub type SubscriptionResult = QueryResultStream;
diff --git a/graph/src/data/subscription/subscription.rs b/graph/src/data/subscription/subscription.rs
new file mode 100644
index 0000000..8ae6b87
--- /dev/null
+++ b/graph/src/data/subscription/subscription.rs
@@ -0,0 +1,11 @@
+use crate::prelude::Query;
+
+/// A GraphQL subscription made by a client.
+///
+/// At the moment, this only contains the GraphQL query submitted as the
+/// subscription payload.
+#[derive(Clone, Debug)]
+pub struct Subscription {
+    /// The GraphQL subscription query.
+    pub query: Query,
+}
diff --git a/graph/src/data/value.rs b/graph/src/data/value.rs
new file mode 100644
index 0000000..fc62ef9
--- /dev/null
+++ b/graph/src/data/value.rs
@@ -0,0 +1,435 @@
+use crate::prelude::{q, s, CacheWeight};
+use serde::ser::{SerializeMap, SerializeSeq, Serializer};
+use serde::Serialize;
+use std::collections::BTreeMap;
+use std::convert::TryFrom;
+use std::iter::FromIterator;
+
+/// An immutable string that is more memory-efficient since it only has an
+/// overhead of 16 bytes for storing a string vs the 24 bytes that `String`
+/// requires
+#[derive(Clone, Default, Debug, PartialOrd, Ord, PartialEq, Eq, Hash)]
+pub struct Word(Box<str>);
+
+impl Word {
+    pub fn as_str(&self) -> &str {
+        &*self.0
+    }
+}
+
+impl std::fmt::Display for Word {
+    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
+        write!(f, "{}", self.0)
+    }
+}
+
+impl std::ops::Deref for Word {
+    type Target = str;
+
+    fn deref(&self) -> &Self::Target {
+        &*self.0
+    }
+}
+
+impl From<&str> for Word {
+    fn from(s: &str) -> Self {
+        Word(s.into())
+    }
+}
+
+impl From<String> for Word {
+    fn from(s: String) -> Self {
+        Word(s.into_boxed_str())
+    }
+}
+
+impl Serialize for Word {
+    fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
+    where
+        S: Serializer,
+    {
+        self.0.serialize(serializer)
+    }
+}
+
+impl<'de> serde::Deserialize<'de> for Word {
+    fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
+    where
+        D: serde::Deserializer<'de>,
+    {
+        String::deserialize(deserializer).map(Into::into)
+    }
+}
+
+#[derive(Clone, Debug, PartialEq)]
+struct Entry {
+    key: Option<Word>,
+    value: Value,
+}
+
+impl Entry {
+    fn new(key: Word, value: Value) -> Self {
+        Entry {
+            key: Some(key),
+            value,
+        }
+    }
+
+    fn has_key(&self, key: &str) -> bool {
+        match &self.key {
+            None => false,
+            Some(k) => k.as_str() == key,
+        }
+    }
+}
+
+#[derive(Clone, PartialEq, Default)]
+pub struct Object(Box<[Entry]>);
+
+impl Object {
+    pub fn get(&self, key: &str) -> Option<&Value> {
+        self.0
+            .iter()
+            .find(|entry| entry.has_key(key))
+            .map(|entry| &entry.value)
+    }
+
+    pub fn remove(&mut self, key: &str) -> Option<Value> {
+        self.0
+            .iter_mut()
+            .find(|entry| entry.has_key(key))
+            .map(|entry| {
+                entry.key = None;
+                std::mem::replace(&mut entry.value, Value::Null)
+            })
+    }
+
+    pub fn iter(&self) -> impl Iterator<Item = (&str, &Value)> {
+        ObjectIter::new(self)
+    }
+
+    fn len(&self) -> usize {
+        self.0.len()
+    }
+
+    pub fn extend(&mut self, other: Object) {
+        let mut entries = std::mem::replace(&mut self.0, Box::new([])).into_vec();
+        entries.extend(other.0.into_vec());
+        self.0 = entries.into_boxed_slice();
+    }
+}
+
+impl FromIterator<(String, Value)> for Object {
+    fn from_iter<T: IntoIterator<Item = (String, Value)>>(iter: T) -> Self {
+        let mut items: Vec<_> = Vec::new();
+        for (key, value) in iter {
+            items.push(Entry::new(key.into(), value))
+        }
+        Object(items.into_boxed_slice())
+    }
+}
+
+pub struct ObjectOwningIter {
+    iter: std::vec::IntoIter<Entry>,
+}
+
+impl Iterator for ObjectOwningIter {
+    type Item = (Word, Value);
+
+    fn next(&mut self) -> Option<Self::Item> {
+        while let Some(entry) = self.iter.next() {
+            if let Some(key) = entry.key {
+                return Some((key, entry.value));
+            }
+        }
+        None
+    }
+}
+
+impl IntoIterator for Object {
+    type Item = (Word, Value);
+
+    type IntoIter = ObjectOwningIter;
+
+    fn into_iter(self) -> Self::IntoIter {
+        ObjectOwningIter {
+            iter: self.0.into_vec().into_iter(),
+        }
+    }
+}
+
+pub struct ObjectIter<'a> {
+    iter: std::slice::Iter<'a, Entry>,
+}
+
+impl<'a> ObjectIter<'a> {
+    fn new(object: &'a Object) -> Self {
+        Self {
+            iter: object.0.iter(),
+        }
+    }
+}
+impl<'a> Iterator for ObjectIter<'a> {
+    type Item = (&'a str, &'a Value);
+
+    fn next(&mut self) -> Option<Self::Item> {
+        while let Some(entry) = self.iter.next() {
+            if let Some(key) = &entry.key {
+                return Some((key.as_str(), &entry.value));
+            }
+        }
+        None
+    }
+}
+
+impl<'a> IntoIterator for &'a Object {
+    type Item = <ObjectIter<'a> as Iterator>::Item;
+
+    type IntoIter = ObjectIter<'a>;
+
+    fn into_iter(self) -> Self::IntoIter {
+        ObjectIter::new(self)
+    }
+}
+
+impl CacheWeight for Entry {
+    fn indirect_weight(&self) -> usize {
+        self.key.indirect_weight() + self.value.indirect_weight()
+    }
+}
+
+impl CacheWeight for Object {
+    fn indirect_weight(&self) -> usize {
+        self.0.iter().map(CacheWeight::indirect_weight).sum()
+    }
+}
+
+impl std::fmt::Debug for Object {
+    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
+        self.0.fmt(f)
+    }
+}
+
+#[derive(Debug, Clone, PartialEq)]
+pub enum Value {
+    Int(i64),
+    Float(f64),
+    String(String),
+    Boolean(bool),
+    Null,
+    Enum(String),
+    List(Vec<Value>),
+    Object(Object),
+}
+
+impl Value {
+    pub fn object(map: BTreeMap<Word, Value>) -> Self {
+        let items = map
+            .into_iter()
+            .map(|(key, value)| Entry::new(key, value))
+            .collect();
+        Value::Object(Object(items))
+    }
+
+    pub fn is_null(&self) -> bool {
+        matches!(self, Value::Null)
+    }
+
+    pub fn coerce_enum(self, using_type: &s::EnumType) -> Result<Value, Value> {
+        match self {
+            Value::Null => Ok(Value::Null),
+            Value::String(name) | Value::Enum(name)
+                if using_type.values.iter().any(|value| value.name == name) =>
+            {
+                Ok(Value::Enum(name))
+            }
+            _ => Err(self),
+        }
+    }
+
+    pub fn coerce_scalar(self, using_type: &s::ScalarType) -> Result<Value, Value> {
+        match (using_type.name.as_str(), self) {
+            (_, Value::Null) => Ok(Value::Null),
+            ("Boolean", Value::Boolean(b)) => Ok(Value::Boolean(b)),
+            ("BigDecimal", Value::Float(f)) => Ok(Value::String(f.to_string())),
+            ("BigDecimal", Value::Int(i)) => Ok(Value::String(i.to_string())),
+            ("BigDecimal", Value::String(s)) => Ok(Value::String(s)),
+            ("Int", Value::Int(num)) => {
+                if i32::min_value() as i64 <= num && num <= i32::max_value() as i64 {
+                    Ok(Value::Int(num))
+                } else {
+                    Err(Value::Int(num))
+                }
+            }
+            ("String", Value::String(s)) => Ok(Value::String(s)),
+            ("ID", Value::String(s)) => Ok(Value::String(s)),
+            ("ID", Value::Int(n)) => Ok(Value::String(n.to_string())),
+            ("Bytes", Value::String(s)) => Ok(Value::String(s)),
+            ("BigInt", Value::String(s)) => Ok(Value::String(s)),
+            ("BigInt", Value::Int(n)) => Ok(Value::String(n.to_string())),
+            ("JSONObject", Value::Object(obj)) => Ok(Value::Object(obj)),
+            ("Date", Value::String(obj)) => Ok(Value::String(obj)),
+            (_, v) => Err(v),
+        }
+    }
+}
+
+impl std::fmt::Display for Value {
+    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
+        match *self {
+            Value::Int(ref num) => write!(f, "{}", num),
+            Value::Float(val) => write!(f, "{}", val),
+            Value::String(ref val) => write!(f, "\"{}\"", val.replace('"', "\\\"")),
+            Value::Boolean(true) => write!(f, "true"),
+            Value::Boolean(false) => write!(f, "false"),
+            Value::Null => write!(f, "null"),
+            Value::Enum(ref name) => write!(f, "{}", name),
+            Value::List(ref items) => {
+                write!(f, "[")?;
+                if !items.is_empty() {
+                    write!(f, "{}", items[0])?;
+                    for item in &items[1..] {
+                        write!(f, ", {}", item)?;
+                    }
+                }
+                write!(f, "]")
+            }
+            Value::Object(ref items) => {
+                write!(f, "{{")?;
+                let mut first = true;
+                for (name, value) in items.iter() {
+                    if first {
+                        first = false;
+                    } else {
+                        write!(f, ", ")?;
+                    }
+                    write!(f, "{}: {}", name, value)?;
+                }
+                write!(f, "}}")
+            }
+        }
+    }
+}
+
+impl CacheWeight for Value {
+    fn indirect_weight(&self) -> usize {
+        match self {
+            Value::Boolean(_) | Value::Int(_) | Value::Null | Value::Float(_) => 0,
+            Value::Enum(s) | Value::String(s) => s.indirect_weight(),
+            Value::List(l) => l.indirect_weight(),
+            Value::Object(o) => o.indirect_weight(),
+        }
+    }
+}
+
+impl Serialize for Value {
+    fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
+    where
+        S: Serializer,
+    {
+        match self {
+            Value::Boolean(v) => serializer.serialize_bool(*v),
+            Value::Enum(v) => serializer.serialize_str(v),
+            Value::Float(v) => serializer.serialize_f64(*v),
+            Value::Int(v) => serializer.serialize_i64(*v),
+            Value::List(l) => {
+                let mut seq = serializer.serialize_seq(Some(l.len()))?;
+                for v in l {
+                    seq.serialize_element(v)?;
+                }
+                seq.end()
+            }
+            Value::Null => serializer.serialize_none(),
+            Value::String(s) => serializer.serialize_str(s),
+            Value::Object(o) => {
+                let mut map = serializer.serialize_map(Some(o.len()))?;
+                for (k, v) in o {
+                    map.serialize_entry(k, v)?;
+                }
+                map.end()
+            }
+        }
+    }
+}
+
+impl TryFrom<q::Value> for Value {
+    type Error = q::Value;
+
+    fn try_from(value: q::Value) -> Result<Self, Self::Error> {
+        match value {
+            q::Value::Variable(_) => Err(value),
+            q::Value::Int(ref num) => match num.as_i64() {
+                Some(i) => Ok(Value::Int(i)),
+                None => Err(value),
+            },
+            q::Value::Float(f) => Ok(Value::Float(f)),
+            q::Value::String(s) => Ok(Value::String(s)),
+            q::Value::Boolean(b) => Ok(Value::Boolean(b)),
+            q::Value::Null => Ok(Value::Null),
+            q::Value::Enum(s) => Ok(Value::Enum(s)),
+            q::Value::List(vals) => {
+                let vals: Vec<_> = vals
+                    .into_iter()
+                    .map(Value::try_from)
+                    .collect::<Result<Vec<_>, _>>()?;
+                Ok(Value::List(vals))
+            }
+            q::Value::Object(map) => {
+                let mut rmap = BTreeMap::new();
+                for (key, value) in map.into_iter() {
+                    let value = Value::try_from(value)?;
+                    rmap.insert(key.into(), value);
+                }
+                Ok(Value::object(rmap))
+            }
+        }
+    }
+}
+
+impl From<serde_json::Value> for Value {
+    fn from(value: serde_json::Value) -> Self {
+        match value {
+            serde_json::Value::Null => Value::Null,
+            serde_json::Value::Bool(b) => Value::Boolean(b),
+            serde_json::Value::Number(n) => match n.as_i64() {
+                Some(i) => Value::Int(i),
+                None => Value::Float(n.as_f64().unwrap()),
+            },
+            serde_json::Value::String(s) => Value::String(s),
+            serde_json::Value::Array(vals) => {
+                let vals: Vec<_> = vals.into_iter().map(Value::from).collect::<Vec<_>>();
+                Value::List(vals)
+            }
+            serde_json::Value::Object(map) => {
+                let obj =
+                    Object::from_iter(map.into_iter().map(|(key, val)| (key, Value::from(val))));
+                Value::Object(obj)
+            }
+        }
+    }
+}
+
+impl From<Value> for q::Value {
+    fn from(value: Value) -> Self {
+        match value {
+            Value::Int(i) => q::Value::Int((i as i32).into()),
+            Value::Float(f) => q::Value::Float(f),
+            Value::String(s) => q::Value::String(s),
+            Value::Boolean(b) => q::Value::Boolean(b),
+            Value::Null => q::Value::Null,
+            Value::Enum(s) => q::Value::Enum(s),
+            Value::List(vals) => {
+                let vals: Vec<q::Value> = vals.into_iter().map(q::Value::from).collect();
+                q::Value::List(vals)
+            }
+            Value::Object(map) => {
+                let mut rmap = BTreeMap::new();
+                for (key, value) in map.into_iter() {
+                    let value = q::Value::from(value);
+                    rmap.insert(key.to_string(), value);
+                }
+                q::Value::Object(rmap)
+            }
+        }
+    }
+}
diff --git a/graph/src/data_source/mod.rs b/graph/src/data_source/mod.rs
new file mode 100644
index 0000000..2d92a27
--- /dev/null
+++ b/graph/src/data_source/mod.rs
@@ -0,0 +1,407 @@
+pub mod offchain;
+
+use crate::{
+    blockchain::{
+        BlockPtr, Blockchain, DataSource as _, DataSourceTemplate as _, TriggerData as _,
+        UnresolvedDataSource as _, UnresolvedDataSourceTemplate as _,
+    },
+    components::{
+        link_resolver::LinkResolver,
+        store::{BlockNumber, StoredDynamicDataSource},
+        subgraph::DataSourceTemplateInfo,
+    },
+    data_source::offchain::OFFCHAIN_KINDS,
+    prelude::{CheapClone as _, DataSourceContext},
+};
+use anyhow::Error;
+use semver::Version;
+use serde::{de::IntoDeserializer as _, Deserialize, Deserializer};
+use slog::{Logger, SendSyncRefUnwindSafeKV};
+use std::{collections::BTreeMap, fmt, sync::Arc};
+
+#[derive(Debug)]
+pub enum DataSource<C: Blockchain> {
+    Onchain(C::DataSource),
+    Offchain(offchain::DataSource),
+}
+
+impl<C: Blockchain> TryFrom<DataSourceTemplateInfo<C>> for DataSource<C> {
+    type Error = Error;
+
+    fn try_from(info: DataSourceTemplateInfo<C>) -> Result<Self, Self::Error> {
+        match &info.template {
+            DataSourceTemplate::Onchain(_) => {
+                C::DataSource::try_from(info).map(DataSource::Onchain)
+            }
+            DataSourceTemplate::Offchain(_) => {
+                offchain::DataSource::try_from(info).map(DataSource::Offchain)
+            }
+        }
+    }
+}
+
+impl<C: Blockchain> DataSource<C> {
+    pub fn as_onchain(&self) -> Option<&C::DataSource> {
+        match self {
+            Self::Onchain(ds) => Some(&ds),
+            Self::Offchain(_) => None,
+        }
+    }
+
+    pub fn as_offchain(&self) -> Option<&offchain::DataSource> {
+        match self {
+            Self::Onchain(_) => None,
+            Self::Offchain(ds) => Some(&ds),
+        }
+    }
+
+    pub fn address(&self) -> Option<Vec<u8>> {
+        match self {
+            Self::Onchain(ds) => ds.address().map(ToOwned::to_owned),
+            Self::Offchain(ds) => ds.address(),
+        }
+    }
+
+    pub fn name(&self) -> &str {
+        match self {
+            Self::Onchain(ds) => ds.name(),
+            Self::Offchain(ds) => &ds.name,
+        }
+    }
+
+    pub fn kind(&self) -> &str {
+        match self {
+            Self::Onchain(ds) => ds.kind(),
+            Self::Offchain(ds) => &ds.kind,
+        }
+    }
+
+    pub fn creation_block(&self) -> Option<BlockNumber> {
+        match self {
+            Self::Onchain(ds) => ds.creation_block(),
+            Self::Offchain(ds) => ds.creation_block,
+        }
+    }
+
+    pub fn context(&self) -> Arc<Option<DataSourceContext>> {
+        match self {
+            Self::Onchain(ds) => ds.context(),
+            Self::Offchain(ds) => ds.context.clone(),
+        }
+    }
+
+    pub fn api_version(&self) -> Version {
+        match self {
+            Self::Onchain(ds) => ds.api_version(),
+            Self::Offchain(ds) => ds.mapping.api_version.clone(),
+        }
+    }
+
+    pub fn runtime(&self) -> Option<Arc<Vec<u8>>> {
+        match self {
+            Self::Onchain(ds) => ds.runtime(),
+            Self::Offchain(ds) => Some(ds.mapping.runtime.cheap_clone()),
+        }
+    }
+
+    pub fn match_and_decode(
+        &self,
+        trigger: &TriggerData<C>,
+        block: &Arc<C::Block>,
+        logger: &Logger,
+    ) -> Result<Option<TriggerWithHandler<MappingTrigger<C>>>, Error> {
+        match (self, trigger) {
+            (Self::Onchain(ds), TriggerData::Onchain(trigger)) => ds
+                .match_and_decode(trigger, block, logger)
+                .map(|t| t.map(|t| t.map(MappingTrigger::Onchain))),
+            (Self::Offchain(ds), TriggerData::Offchain(trigger)) => {
+                Ok(ds.match_and_decode(trigger))
+            }
+            (Self::Onchain(_), TriggerData::Offchain(_))
+            | (Self::Offchain(_), TriggerData::Onchain(_)) => Ok(None),
+        }
+    }
+
+    pub fn is_duplicate_of(&self, other: &Self) -> bool {
+        match (self, other) {
+            (Self::Onchain(a), Self::Onchain(b)) => a.is_duplicate_of(b),
+            (Self::Offchain(a), Self::Offchain(b)) => {
+                // See also: data-source-is-duplicate-of
+                a.manifest_idx == b.manifest_idx && a.source == b.source && a.context == b.context
+            }
+            _ => false,
+        }
+    }
+
+    pub fn as_stored_dynamic_data_source(&self) -> StoredDynamicDataSource {
+        match self {
+            Self::Onchain(ds) => ds.as_stored_dynamic_data_source(),
+            Self::Offchain(ds) => ds.as_stored_dynamic_data_source(),
+        }
+    }
+
+    pub fn from_stored_dynamic_data_source(
+        template: &DataSourceTemplate<C>,
+        stored: StoredDynamicDataSource,
+    ) -> Result<Self, Error> {
+        match template {
+            DataSourceTemplate::Onchain(template) => {
+                C::DataSource::from_stored_dynamic_data_source(template, stored)
+                    .map(DataSource::Onchain)
+            }
+            DataSourceTemplate::Offchain(template) => {
+                offchain::DataSource::from_stored_dynamic_data_source(template, stored)
+                    .map(DataSource::Offchain)
+            }
+        }
+    }
+
+    pub fn validate(&self) -> Vec<Error> {
+        match self {
+            Self::Onchain(ds) => ds.validate(),
+            Self::Offchain(_) => vec![],
+        }
+    }
+}
+
+#[derive(Debug)]
+pub enum UnresolvedDataSource<C: Blockchain> {
+    Onchain(C::UnresolvedDataSource),
+    Offchain(offchain::UnresolvedDataSource),
+}
+
+impl<C: Blockchain> UnresolvedDataSource<C> {
+    pub async fn resolve(
+        self,
+        resolver: &Arc<dyn LinkResolver>,
+        logger: &Logger,
+        manifest_idx: u32,
+    ) -> Result<DataSource<C>, anyhow::Error> {
+        match self {
+            Self::Onchain(unresolved) => unresolved
+                .resolve(resolver, logger, manifest_idx)
+                .await
+                .map(DataSource::Onchain),
+            Self::Offchain(unresolved) => unresolved
+                .resolve(resolver, logger, manifest_idx)
+                .await
+                .map(DataSource::Offchain),
+        }
+    }
+}
+
+#[derive(Debug)]
+pub enum DataSourceTemplate<C: Blockchain> {
+    Onchain(C::DataSourceTemplate),
+    Offchain(offchain::DataSourceTemplate),
+}
+
+impl<C: Blockchain> DataSourceTemplate<C> {
+    pub fn as_onchain(&self) -> Option<&C::DataSourceTemplate> {
+        match self {
+            Self::Onchain(ds) => Some(ds),
+            Self::Offchain(_) => None,
+        }
+    }
+
+    pub fn into_onchain(self) -> Option<C::DataSourceTemplate> {
+        match self {
+            Self::Onchain(ds) => Some(ds),
+            Self::Offchain(_) => None,
+        }
+    }
+
+    pub fn name(&self) -> &str {
+        match self {
+            Self::Onchain(ds) => ds.name(),
+            Self::Offchain(ds) => &ds.name,
+        }
+    }
+
+    pub fn api_version(&self) -> semver::Version {
+        match self {
+            Self::Onchain(ds) => ds.api_version(),
+            Self::Offchain(ds) => ds.mapping.api_version.clone(),
+        }
+    }
+
+    pub fn runtime(&self) -> Option<Arc<Vec<u8>>> {
+        match self {
+            Self::Onchain(ds) => ds.runtime(),
+            Self::Offchain(ds) => Some(ds.mapping.runtime.clone()),
+        }
+    }
+
+    pub fn manifest_idx(&self) -> u32 {
+        match self {
+            Self::Onchain(ds) => ds.manifest_idx(),
+            Self::Offchain(ds) => ds.manifest_idx,
+        }
+    }
+}
+
+#[derive(Clone, Debug)]
+pub enum UnresolvedDataSourceTemplate<C: Blockchain> {
+    Onchain(C::UnresolvedDataSourceTemplate),
+    Offchain(offchain::UnresolvedDataSourceTemplate),
+}
+
+impl<C: Blockchain> Default for UnresolvedDataSourceTemplate<C> {
+    fn default() -> Self {
+        Self::Onchain(C::UnresolvedDataSourceTemplate::default())
+    }
+}
+
+impl<C: Blockchain> UnresolvedDataSourceTemplate<C> {
+    pub async fn resolve(
+        self,
+        resolver: &Arc<dyn LinkResolver>,
+        logger: &Logger,
+        manifest_idx: u32,
+    ) -> Result<DataSourceTemplate<C>, Error> {
+        match self {
+            Self::Onchain(ds) => ds
+                .resolve(resolver, logger, manifest_idx)
+                .await
+                .map(DataSourceTemplate::Onchain),
+            Self::Offchain(ds) => ds
+                .resolve(resolver, logger, manifest_idx)
+                .await
+                .map(DataSourceTemplate::Offchain),
+        }
+    }
+}
+
+pub struct TriggerWithHandler<T> {
+    pub trigger: T,
+    handler: String,
+    block_ptr: BlockPtr,
+    logging_extras: Arc<dyn SendSyncRefUnwindSafeKV>,
+}
+
+impl<T: fmt::Debug> fmt::Debug for TriggerWithHandler<T> {
+    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
+        let mut builder = f.debug_struct("TriggerWithHandler");
+        builder.field("trigger", &self.trigger);
+        builder.field("handler", &self.handler);
+        builder.finish()
+    }
+}
+
+impl<T> TriggerWithHandler<T> {
+    pub fn new(trigger: T, handler: String, block_ptr: BlockPtr) -> Self {
+        Self {
+            trigger,
+            handler,
+            block_ptr,
+            logging_extras: Arc::new(slog::o! {}),
+        }
+    }
+
+    pub fn new_with_logging_extras(
+        trigger: T,
+        handler: String,
+        block_ptr: BlockPtr,
+        logging_extras: Arc<dyn SendSyncRefUnwindSafeKV>,
+    ) -> Self {
+        TriggerWithHandler {
+            trigger,
+            handler,
+            block_ptr,
+            logging_extras,
+        }
+    }
+
+    /// Additional key-value pairs to be logged with the "Done processing trigger" message.
+    pub fn logging_extras(&self) -> Arc<dyn SendSyncRefUnwindSafeKV> {
+        self.logging_extras.cheap_clone()
+    }
+
+    pub fn handler_name(&self) -> &str {
+        &self.handler
+    }
+
+    fn map<T_>(self, f: impl FnOnce(T) -> T_) -> TriggerWithHandler<T_> {
+        TriggerWithHandler {
+            trigger: f(self.trigger),
+            handler: self.handler,
+            block_ptr: self.block_ptr,
+            logging_extras: self.logging_extras,
+        }
+    }
+
+    pub fn block_ptr(&self) -> BlockPtr {
+        self.block_ptr.clone()
+    }
+}
+
+pub enum TriggerData<C: Blockchain> {
+    Onchain(C::TriggerData),
+    Offchain(offchain::TriggerData),
+}
+
+impl<C: Blockchain> TriggerData<C> {
+    pub fn error_context(&self) -> String {
+        match self {
+            Self::Onchain(trigger) => trigger.error_context(),
+            Self::Offchain(trigger) => format!("{:?}", trigger.source),
+        }
+    }
+}
+
+#[derive(Debug)]
+pub enum MappingTrigger<C: Blockchain> {
+    Onchain(C::MappingTrigger),
+    Offchain(offchain::TriggerData),
+}
+
+macro_rules! clone_data_source {
+    ($t:ident) => {
+        impl<C: Blockchain> Clone for $t<C> {
+            fn clone(&self) -> Self {
+                match self {
+                    Self::Onchain(ds) => Self::Onchain(ds.clone()),
+                    Self::Offchain(ds) => Self::Offchain(ds.clone()),
+                }
+            }
+        }
+    };
+}
+
+clone_data_source!(DataSource);
+clone_data_source!(DataSourceTemplate);
+
+macro_rules! deserialize_data_source {
+    ($t:ident) => {
+        impl<'de, C: Blockchain> Deserialize<'de> for $t<C> {
+            fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
+            where
+                D: Deserializer<'de>,
+            {
+                let map: BTreeMap<String, serde_json::Value> = BTreeMap::deserialize(deserializer)?;
+                let kind = map
+                    .get("kind")
+                    .ok_or(serde::de::Error::missing_field("kind"))?
+                    .as_str()
+                    .unwrap_or("?");
+                if OFFCHAIN_KINDS.contains(&kind) {
+                    offchain::$t::deserialize(map.into_deserializer())
+                        .map_err(serde::de::Error::custom)
+                        .map($t::Offchain)
+                } else if (&C::KIND.to_string() == kind) || C::ALIASES.contains(&kind) {
+                    C::$t::deserialize(map.into_deserializer())
+                        .map_err(serde::de::Error::custom)
+                        .map($t::Onchain)
+                } else {
+                    Err(serde::de::Error::custom(format!(
+                        "data source has invalid `kind`; expected {}, file/ipfs",
+                        C::KIND,
+                    )))
+                }
+            }
+        }
+    };
+}
+
+deserialize_data_source!(UnresolvedDataSource);
+deserialize_data_source!(UnresolvedDataSourceTemplate);
diff --git a/graph/src/data_source/offchain.rs b/graph/src/data_source/offchain.rs
new file mode 100644
index 0000000..a36ca1f
--- /dev/null
+++ b/graph/src/data_source/offchain.rs
@@ -0,0 +1,272 @@
+use crate::{
+    blockchain::{BlockPtr, Blockchain},
+    components::{
+        link_resolver::LinkResolver,
+        store::{BlockNumber, StoredDynamicDataSource},
+        subgraph::DataSourceTemplateInfo,
+    },
+    data::store::scalar::Bytes,
+    data_source,
+    prelude::{DataSourceContext, Link},
+};
+use anyhow::{self, Context, Error};
+use cid::Cid;
+use serde::Deserialize;
+use slog::{info, Logger};
+use std::{fmt, sync::Arc};
+
+use super::TriggerWithHandler;
+
+pub const OFFCHAIN_KINDS: &'static [&'static str] = &["file/ipfs"];
+
+#[derive(Clone, Debug)]
+pub struct DataSource {
+    pub kind: String,
+    pub name: String,
+    pub manifest_idx: u32,
+    pub source: Source,
+    pub mapping: Mapping,
+    pub context: Arc<Option<DataSourceContext>>,
+    pub creation_block: Option<BlockNumber>,
+}
+
+impl<C: Blockchain> TryFrom<DataSourceTemplateInfo<C>> for DataSource {
+    type Error = Error;
+
+    fn try_from(info: DataSourceTemplateInfo<C>) -> Result<Self, Self::Error> {
+        let template = match info.template {
+            data_source::DataSourceTemplate::Offchain(template) => template,
+            data_source::DataSourceTemplate::Onchain(_) => {
+                anyhow::bail!("Cannot create offchain data source from onchain template")
+            }
+        };
+        let source = info.params.get(0).ok_or(anyhow::anyhow!(
+            "Failed to create data source from template `{}`: source parameter is missing",
+            template.name
+        ))?;
+        Ok(Self {
+            kind: template.kind.clone(),
+            name: template.name.clone(),
+            manifest_idx: template.manifest_idx,
+            source: Source::Ipfs(source.parse()?),
+            mapping: template.mapping.clone(),
+            context: Arc::new(info.context),
+            creation_block: Some(info.creation_block),
+        })
+    }
+}
+
+impl DataSource {
+    pub fn match_and_decode<C: Blockchain>(
+        &self,
+        trigger: &TriggerData,
+    ) -> Option<TriggerWithHandler<super::MappingTrigger<C>>> {
+        if self.source != trigger.source {
+            return None;
+        }
+
+        Some(TriggerWithHandler::new(
+            data_source::MappingTrigger::Offchain(trigger.clone()),
+            self.mapping.handler.clone(),
+            BlockPtr::new(Default::default(), self.creation_block.unwrap_or(0)),
+        ))
+    }
+
+    pub fn as_stored_dynamic_data_source(&self) -> StoredDynamicDataSource {
+        let param = match self.source {
+            Source::Ipfs(link) => Bytes::from(link.to_bytes()),
+        };
+        let context = self
+            .context
+            .as_ref()
+            .as_ref()
+            .map(|ctx| serde_json::to_value(&ctx).unwrap());
+        StoredDynamicDataSource {
+            manifest_idx: self.manifest_idx,
+            param: Some(param),
+            context,
+            creation_block: self.creation_block,
+            is_offchain: true,
+        }
+    }
+
+    pub fn from_stored_dynamic_data_source(
+        template: &DataSourceTemplate,
+        stored: StoredDynamicDataSource,
+    ) -> Result<Self, Error> {
+        let param = stored.param.context("no param on stored data source")?;
+        let source = Source::Ipfs(Cid::try_from(param.as_slice().to_vec())?);
+        let context = Arc::new(stored.context.map(serde_json::from_value).transpose()?);
+        Ok(Self {
+            kind: template.kind.clone(),
+            name: template.name.clone(),
+            manifest_idx: stored.manifest_idx,
+            source,
+            mapping: template.mapping.clone(),
+            context,
+            creation_block: stored.creation_block,
+        })
+    }
+
+    /// The concept of an address may or not make sense for an offchain data source, but this is
+    /// used as the value to be returned to mappings from the `dataSource.address()` host function.
+    pub fn address(&self) -> Option<Vec<u8>> {
+        match self.source {
+            Source::Ipfs(cid) => Some(cid.to_bytes()),
+        }
+    }
+}
+
+#[derive(Clone, Debug, Eq, PartialEq)]
+pub enum Source {
+    Ipfs(Cid),
+}
+
+#[derive(Clone, Debug)]
+pub struct Mapping {
+    pub language: String,
+    pub api_version: semver::Version,
+    pub entities: Vec<String>,
+    pub handler: String,
+    pub runtime: Arc<Vec<u8>>,
+    pub link: Link,
+}
+
+#[derive(Clone, Debug, Default, Eq, PartialEq, Deserialize)]
+pub struct UnresolvedDataSource {
+    pub kind: String,
+    pub name: String,
+    pub source: UnresolvedSource,
+    pub mapping: UnresolvedMapping,
+}
+
+#[derive(Clone, Debug, Default, Hash, Eq, PartialEq, Deserialize)]
+pub struct UnresolvedSource {
+    file: Link,
+}
+
+#[derive(Clone, Debug, Default, Hash, Eq, PartialEq, Deserialize)]
+#[serde(rename_all = "camelCase")]
+pub struct UnresolvedMapping {
+    pub api_version: String,
+    pub language: String,
+    pub file: Link,
+    pub handler: String,
+    pub entities: Vec<String>,
+}
+
+impl UnresolvedDataSource {
+    #[allow(unreachable_code)]
+    #[allow(unused_variables)]
+    pub async fn resolve(
+        self,
+        resolver: &Arc<dyn LinkResolver>,
+        logger: &Logger,
+        manifest_idx: u32,
+    ) -> Result<DataSource, Error> {
+        anyhow::bail!(
+            "static file data sources are not yet supported, \\
+             for details see https://github.com/graphprotocol/graph-node/issues/3864"
+        );
+
+        info!(logger, "Resolve offchain data source";
+            "name" => &self.name,
+            "kind" => &self.kind,
+            "source" => format_args!("{:?}", &self.source),
+        );
+        let source = match self.kind.as_str() {
+            "file/ipfs" => Source::Ipfs(self.source.file.link.parse()?),
+            _ => {
+                anyhow::bail!(
+                    "offchain data source has invalid `kind`, expected `file/ipfs` but found {}",
+                    self.kind
+                );
+            }
+        };
+        Ok(DataSource {
+            manifest_idx,
+            kind: self.kind,
+            name: self.name,
+            source,
+            mapping: self.mapping.resolve(&*resolver, logger).await?,
+            context: Arc::new(None),
+            creation_block: None,
+        })
+    }
+}
+
+impl UnresolvedMapping {
+    pub async fn resolve(
+        self,
+        resolver: &Arc<dyn LinkResolver>,
+        logger: &Logger,
+    ) -> Result<Mapping, Error> {
+        info!(logger, "Resolve offchain mapping"; "link" => &self.file.link);
+        Ok(Mapping {
+            language: self.language,
+            api_version: semver::Version::parse(&self.api_version)?,
+            entities: self.entities,
+            handler: self.handler,
+            runtime: Arc::new(resolver.cat(logger, &self.file).await?),
+            link: self.file,
+        })
+    }
+}
+
+#[derive(Clone, Debug, Deserialize)]
+pub struct UnresolvedDataSourceTemplate {
+    pub kind: String,
+    pub network: Option<String>,
+    pub name: String,
+    pub mapping: UnresolvedMapping,
+}
+
+#[derive(Clone, Debug)]
+pub struct DataSourceTemplate {
+    pub kind: String,
+    pub network: Option<String>,
+    pub name: String,
+    pub manifest_idx: u32,
+    pub mapping: Mapping,
+}
+
+impl UnresolvedDataSourceTemplate {
+    pub async fn resolve(
+        self,
+        resolver: &Arc<dyn LinkResolver>,
+        logger: &Logger,
+        manifest_idx: u32,
+    ) -> Result<DataSourceTemplate, Error> {
+        info!(logger, "Resolve data source template"; "name" => &self.name);
+
+        Ok(DataSourceTemplate {
+            kind: self.kind,
+            network: self.network,
+            name: self.name,
+            manifest_idx,
+            mapping: self.mapping.resolve(resolver, logger).await?,
+        })
+    }
+}
+
+#[derive(Clone)]
+pub struct TriggerData {
+    pub source: Source,
+    pub data: Arc<bytes::Bytes>,
+}
+
+impl fmt::Debug for TriggerData {
+    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
+        #[derive(Debug)]
+        struct TriggerDataWithoutData<'a> {
+            _source: &'a Source,
+        }
+        write!(
+            f,
+            "{:?}",
+            TriggerDataWithoutData {
+                _source: &self.source
+            }
+        )
+    }
+}
diff --git a/graph/src/env/graphql.rs b/graph/src/env/graphql.rs
new file mode 100644
index 0000000..6c06b53
--- /dev/null
+++ b/graph/src/env/graphql.rs
@@ -0,0 +1,176 @@
+use std::fmt;
+
+use super::*;
+
+#[derive(Clone)]
+pub struct EnvVarsGraphQl {
+    /// Set by the flag `ENABLE_GRAPHQL_VALIDATIONS`. On by default.
+    pub enable_validations: bool,
+    /// Set by the flag `SILENT_GRAPHQL_VALIDATIONS`. On by default.
+    pub silent_graphql_validations: bool,
+    pub subscription_throttle_interval: Duration,
+    /// This is the timeout duration for SQL queries.
+    ///
+    /// If it is not set, no statement timeout will be enforced. The statement
+    /// timeout is local, i.e., can only be used within a transaction and
+    /// will be cleared at the end of the transaction.
+    ///
+    /// Set by the environment variable `GRAPH_SQL_STATEMENT_TIMEOUT` (expressed
+    /// in seconds). No default value is provided.
+    pub sql_statement_timeout: Option<Duration>,
+
+    /// Set by the environment variable `GRAPH_CACHED_SUBGRAPH_IDS` (comma
+    /// separated). When the value of the variable is `*`, queries are cached
+    /// for all subgraphs, which is the default
+    /// behavior.
+    pub cached_subgraph_ids: CachedSubgraphIds,
+    /// In how many shards (mutexes) the query block cache is split.
+    /// Ideally this should divide 256 so that the distribution of queries to
+    /// shards is even.
+    ///
+    /// Set by the environment variable `GRAPH_QUERY_BLOCK_CACHE_SHARDS`. The
+    /// default value is 128.
+    pub query_block_cache_shards: u8,
+    /// Set by the environment variable `GRAPH_QUERY_LFU_CACHE_SHARDS`. The
+    /// default value is set to whatever `GRAPH_QUERY_BLOCK_CACHE_SHARDS` is set
+    /// to. Set to 0 to disable this cache.
+    pub query_lfu_cache_shards: u8,
+    /// How many blocks per network should be kept in the query cache. When the
+    /// limit is reached, older blocks are evicted. This should be kept small
+    /// since a lookup to the cache is O(n) on this value, and the cache memory
+    /// usage also increases with larger number. Set to 0 to disable
+    /// the cache.
+    ///
+    /// Set by the environment variable `GRAPH_QUERY_CACHE_BLOCKS`. The default
+    /// value is 2.
+    pub query_cache_blocks: usize,
+    /// Maximum total memory to be used by the cache. Each block has a max size of
+    /// `QUERY_CACHE_MAX_MEM` / (`QUERY_CACHE_BLOCKS` *
+    /// `GRAPH_QUERY_BLOCK_CACHE_SHARDS`).
+    ///
+    /// Set by the environment variable `GRAPH_QUERY_CACHE_MAX_MEM` (expressed
+    /// in MB). The default value is 1GB.
+    pub query_cache_max_mem: usize,
+    /// Set by the environment variable `GRAPH_QUERY_CACHE_STALE_PERIOD`. The
+    /// default value is 100.
+    pub query_cache_stale_period: u64,
+    /// Set by the environment variable `GRAPH_GRAPHQL_QUERY_TIMEOUT` (expressed in
+    /// seconds). No default value is provided.
+    pub query_timeout: Option<Duration>,
+    /// Set by the environment variable `GRAPH_GRAPHQL_MAX_COMPLEXITY`. No
+    /// default value is provided.
+    pub max_complexity: Option<u64>,
+    /// Set by the environment variable `GRAPH_GRAPHQL_MAX_DEPTH`. The default
+    /// value is 255.
+    pub max_depth: u8,
+    /// Set by the environment variable `GRAPH_GRAPHQL_MAX_FIRST`. The default
+    /// value is 1000.
+    pub max_first: u32,
+    /// Set by the environment variable `GRAPH_GRAPHQL_MAX_SKIP`. The default
+    /// value is 4294967295 ([`u32::MAX`]).
+    pub max_skip: u32,
+    /// Allow skipping the check whether a deployment has changed while
+    /// we were running a query. Once we are sure that the check mechanism
+    /// is reliable, this variable should be removed.
+    ///
+    /// Set by the flag `GRAPHQL_ALLOW_DEPLOYMENT_CHANGE`. Off by default.
+    pub allow_deployment_change: bool,
+    /// Set by the environment variable `GRAPH_GRAPHQL_WARN_RESULT_SIZE`. The
+    /// default value is [`usize::MAX`].
+    pub warn_result_size: usize,
+    /// Set by the environment variable `GRAPH_GRAPHQL_ERROR_RESULT_SIZE`. The
+    /// default value is [`usize::MAX`].
+    pub error_result_size: usize,
+    /// Set by the flag `GRAPH_GRAPHQL_MAX_OPERATIONS_PER_CONNECTION`.
+    /// Defaults to 1000.
+    pub max_operations_per_connection: usize,
+}
+
+// This does not print any values avoid accidentally leaking any sensitive env vars
+impl fmt::Debug for EnvVarsGraphQl {
+    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
+        write!(f, "env vars")
+    }
+}
+
+impl From<InnerGraphQl> for EnvVarsGraphQl {
+    fn from(x: InnerGraphQl) -> Self {
+        Self {
+            enable_validations: x.enable_validations.0,
+            silent_graphql_validations: x.silent_graphql_validations.0,
+            subscription_throttle_interval: Duration::from_millis(
+                x.subscription_throttle_interval_in_ms,
+            ),
+            sql_statement_timeout: x.sql_statement_timeout_in_secs.map(Duration::from_secs),
+            cached_subgraph_ids: if x.cached_subgraph_ids == "*" {
+                CachedSubgraphIds::All
+            } else {
+                CachedSubgraphIds::Only(
+                    x.cached_subgraph_ids
+                        .split(',')
+                        .map(str::to_string)
+                        .collect(),
+                )
+            },
+            query_block_cache_shards: x.query_block_cache_shards,
+            query_lfu_cache_shards: x
+                .query_lfu_cache_shards
+                .unwrap_or(x.query_block_cache_shards),
+            query_cache_blocks: x.query_cache_blocks,
+            query_cache_max_mem: x.query_cache_max_mem_in_mb.0 * 1000 * 1000,
+            query_cache_stale_period: x.query_cache_stale_period,
+            query_timeout: x.query_timeout_in_secs.map(Duration::from_secs),
+            max_complexity: x.max_complexity.map(|x| x.0),
+            max_depth: x.max_depth.0,
+            max_first: x.max_first,
+            max_skip: x.max_skip.0,
+            allow_deployment_change: x.allow_deployment_change.0,
+            warn_result_size: x.warn_result_size.0 .0,
+            error_result_size: x.error_result_size.0 .0,
+            max_operations_per_connection: x.max_operations_per_connection,
+        }
+    }
+}
+
+#[derive(Clone, Debug, Envconfig)]
+pub struct InnerGraphQl {
+    #[envconfig(from = "ENABLE_GRAPHQL_VALIDATIONS", default = "false")]
+    enable_validations: EnvVarBoolean,
+    #[envconfig(from = "SILENT_GRAPHQL_VALIDATIONS", default = "true")]
+    silent_graphql_validations: EnvVarBoolean,
+    #[envconfig(from = "SUBSCRIPTION_THROTTLE_INTERVAL", default = "1000")]
+    subscription_throttle_interval_in_ms: u64,
+    #[envconfig(from = "GRAPH_SQL_STATEMENT_TIMEOUT")]
+    sql_statement_timeout_in_secs: Option<u64>,
+
+    #[envconfig(from = "GRAPH_CACHED_SUBGRAPH_IDS", default = "*")]
+    cached_subgraph_ids: String,
+    #[envconfig(from = "GRAPH_QUERY_BLOCK_CACHE_SHARDS", default = "128")]
+    query_block_cache_shards: u8,
+    #[envconfig(from = "GRAPH_QUERY_LFU_CACHE_SHARDS")]
+    query_lfu_cache_shards: Option<u8>,
+    #[envconfig(from = "GRAPH_QUERY_CACHE_BLOCKS", default = "2")]
+    query_cache_blocks: usize,
+    #[envconfig(from = "GRAPH_QUERY_CACHE_MAX_MEM", default = "1000")]
+    query_cache_max_mem_in_mb: NoUnderscores<usize>,
+    #[envconfig(from = "GRAPH_QUERY_CACHE_STALE_PERIOD", default = "100")]
+    query_cache_stale_period: u64,
+    #[envconfig(from = "GRAPH_GRAPHQL_QUERY_TIMEOUT")]
+    query_timeout_in_secs: Option<u64>,
+    #[envconfig(from = "GRAPH_GRAPHQL_MAX_COMPLEXITY")]
+    max_complexity: Option<NoUnderscores<u64>>,
+    #[envconfig(from = "GRAPH_GRAPHQL_MAX_DEPTH", default = "")]
+    max_depth: WithDefaultUsize<u8, { u8::MAX as usize }>,
+    #[envconfig(from = "GRAPH_GRAPHQL_MAX_FIRST", default = "1000")]
+    max_first: u32,
+    #[envconfig(from = "GRAPH_GRAPHQL_MAX_SKIP", default = "")]
+    max_skip: WithDefaultUsize<u32, { u32::MAX as usize }>,
+    #[envconfig(from = "GRAPHQL_ALLOW_DEPLOYMENT_CHANGE", default = "false")]
+    allow_deployment_change: EnvVarBoolean,
+    #[envconfig(from = "GRAPH_GRAPHQL_WARN_RESULT_SIZE", default = "")]
+    warn_result_size: WithDefaultUsize<NoUnderscores<usize>, { usize::MAX }>,
+    #[envconfig(from = "GRAPH_GRAPHQL_ERROR_RESULT_SIZE", default = "")]
+    error_result_size: WithDefaultUsize<NoUnderscores<usize>, { usize::MAX }>,
+    #[envconfig(from = "GRAPH_GRAPHQL_MAX_OPERATIONS_PER_CONNECTION", default = "1000")]
+    max_operations_per_connection: usize,
+}
diff --git a/graph/src/env/mappings.rs b/graph/src/env/mappings.rs
new file mode 100644
index 0000000..82507da
--- /dev/null
+++ b/graph/src/env/mappings.rs
@@ -0,0 +1,113 @@
+use std::fmt;
+
+use super::*;
+
+#[derive(Clone)]
+pub struct EnvVarsMapping {
+    /// Forces the cache eviction policy to take its own memory overhead into account.
+    ///
+    /// Set by the flag `DEAD_WEIGHT`. Setting `DEAD_WEIGHT` is dangerous since it can lead to a
+    /// situation where an empty cache is bigger than the max_weight,
+    /// which leads to a panic. Off by default.
+    pub entity_cache_dead_weight: bool,
+    /// Size limit of the entity LFU cache.
+    ///
+    /// Set by the environment variable `GRAPH_ENTITY_CACHE_SIZE` (expressed in
+    /// kilobytes). The default value is 10 megabytes.
+    pub entity_cache_size: usize,
+    /// Set by the environment variable `GRAPH_MAX_API_VERSION`. The default
+    /// value is `0.0.7`.
+    pub max_api_version: Version,
+    /// Set by the environment variable `GRAPH_MAPPING_HANDLER_TIMEOUT`
+    /// (expressed in seconds). No default is provided.
+    pub timeout: Option<Duration>,
+    /// Maximum stack size for the WASM runtime.
+    ///
+    /// Set by the environment variable `GRAPH_RUNTIME_MAX_STACK_SIZE`
+    /// (expressed in bytes). The default value is 512KiB.
+    pub max_stack_size: usize,
+
+    /// Set by the environment variable `GRAPH_MAX_IPFS_CACHE_FILE_SIZE`
+    /// (expressed in bytes). The default value is 1MiB.
+    pub max_ipfs_cache_file_size: usize,
+    /// Set by the environment variable `GRAPH_MAX_IPFS_CACHE_SIZE`. The default
+    /// value is 50 items.
+    pub max_ipfs_cache_size: u64,
+    /// The timeout for all IPFS requests.
+    ///
+    /// Set by the environment variable `GRAPH_IPFS_TIMEOUT` (expressed in
+    /// seconds). The default value is 30s.
+    pub ipfs_timeout: Duration,
+    /// Sets the `ipfs.map` file size limit.
+    ///
+    /// Set by the environment variable `GRAPH_MAX_IPFS_MAP_FILE_SIZE_LIMIT`
+    /// (expressed in bytes). The default value is 256MiB.
+    pub max_ipfs_map_file_size: usize,
+    /// Sets the `ipfs.cat` file size limit.
+    ///
+    /// Set by the environment variable `GRAPH_MAX_IPFS_FILE_BYTES` (expressed in
+    /// bytes). Defaults to 256 MiB.
+    pub max_ipfs_file_bytes: usize,
+    pub max_ipfs_concurrent_requests: u16,
+    /// Set by the flag `GRAPH_ALLOW_NON_DETERMINISTIC_IPFS`. Off by
+    /// default.
+    pub allow_non_deterministic_ipfs: bool,
+}
+
+// This does not print any values avoid accidentally leaking any sensitive env vars
+impl fmt::Debug for EnvVarsMapping {
+    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
+        write!(f, "env vars")
+    }
+}
+
+impl From<InnerMappingHandlers> for EnvVarsMapping {
+    fn from(x: InnerMappingHandlers) -> Self {
+        Self {
+            entity_cache_dead_weight: x.entity_cache_dead_weight.0,
+            entity_cache_size: x.entity_cache_size_in_kb * 1000,
+
+            max_api_version: x.max_api_version,
+            timeout: x.mapping_handler_timeout_in_secs.map(Duration::from_secs),
+            max_stack_size: x.runtime_max_stack_size.0 .0,
+
+            max_ipfs_cache_file_size: x.max_ipfs_cache_file_size.0,
+            max_ipfs_cache_size: x.max_ipfs_cache_size,
+            ipfs_timeout: Duration::from_secs(x.ipfs_timeout_in_secs),
+            max_ipfs_map_file_size: x.max_ipfs_map_file_size.0,
+            max_ipfs_file_bytes: x.max_ipfs_file_bytes.0,
+            max_ipfs_concurrent_requests: x.max_ipfs_concurrent_requests,
+            allow_non_deterministic_ipfs: x.allow_non_deterministic_ipfs.0,
+        }
+    }
+}
+
+#[derive(Clone, Debug, Envconfig)]
+pub struct InnerMappingHandlers {
+    #[envconfig(from = "DEAD_WEIGHT", default = "false")]
+    entity_cache_dead_weight: EnvVarBoolean,
+    #[envconfig(from = "GRAPH_ENTITY_CACHE_SIZE", default = "10000")]
+    entity_cache_size_in_kb: usize,
+    #[envconfig(from = "GRAPH_MAX_API_VERSION", default = "0.0.7")]
+    max_api_version: Version,
+    #[envconfig(from = "GRAPH_MAPPING_HANDLER_TIMEOUT")]
+    mapping_handler_timeout_in_secs: Option<u64>,
+    #[envconfig(from = "GRAPH_RUNTIME_MAX_STACK_SIZE", default = "")]
+    runtime_max_stack_size: WithDefaultUsize<NoUnderscores<usize>, { 512 * 1024 }>,
+
+    // IPFS.
+    #[envconfig(from = "GRAPH_MAX_IPFS_CACHE_FILE_SIZE", default = "")]
+    max_ipfs_cache_file_size: WithDefaultUsize<usize, { 1024 * 1024 }>,
+    #[envconfig(from = "GRAPH_MAX_IPFS_CACHE_SIZE", default = "50")]
+    max_ipfs_cache_size: u64,
+    #[envconfig(from = "GRAPH_IPFS_TIMEOUT", default = "30")]
+    ipfs_timeout_in_secs: u64,
+    #[envconfig(from = "GRAPH_MAX_IPFS_MAP_FILE_SIZE", default = "")]
+    max_ipfs_map_file_size: WithDefaultUsize<usize, { 256 * 1024 * 1024 }>,
+    #[envconfig(from = "GRAPH_MAX_IPFS_FILE_BYTES", default = "")]
+    max_ipfs_file_bytes: WithDefaultUsize<usize, { 256 * 1024 * 1024 }>,
+    #[envconfig(from = "GRAPH_MAX_IPFS_CONCURRENT_REQUESTS", default = "100")]
+    max_ipfs_concurrent_requests: u16,
+    #[envconfig(from = "GRAPH_ALLOW_NON_DETERMINISTIC_IPFS", default = "false")]
+    allow_non_deterministic_ipfs: EnvVarBoolean,
+}
diff --git a/graph/src/env/mod.rs b/graph/src/env/mod.rs
new file mode 100644
index 0000000..b7e1fc7
--- /dev/null
+++ b/graph/src/env/mod.rs
@@ -0,0 +1,445 @@
+mod graphql;
+mod mappings;
+mod store;
+
+use envconfig::Envconfig;
+use lazy_static::lazy_static;
+use semver::Version;
+use std::{
+    collections::HashSet,
+    env::VarError,
+    fmt,
+    str::FromStr,
+    sync::atomic::{AtomicBool, Ordering},
+    time::Duration,
+};
+
+use self::graphql::*;
+use self::mappings::*;
+use self::store::*;
+use crate::{
+    components::subgraph::SubgraphVersionSwitchingMode, runtime::gas::CONST_MAX_GAS_PER_HANDLER,
+};
+
+pub static UNSAFE_CONFIG: AtomicBool = AtomicBool::new(false);
+
+lazy_static! {
+    pub static ref ENV_VARS: EnvVars = EnvVars::from_env().unwrap();
+}
+
+// This is currently unused but is kept as a potentially useful mechanism.
+/// Panics if:
+/// - The value is not UTF8.
+/// - The value cannot be parsed as T.
+/// - The value differs from the default, and `--unsafe-config` flag is not set.
+pub fn unsafe_env_var<E: std::error::Error + Send + Sync, T: FromStr<Err = E> + Eq>(
+    name: &'static str,
+    default_value: T,
+) -> T {
+    let var = match std::env::var(name) {
+        Ok(var) => var,
+        Err(VarError::NotPresent) => return default_value,
+        Err(VarError::NotUnicode(_)) => panic!("environment variable {} is not UTF8", name),
+    };
+
+    let value = var
+        .parse::<T>()
+        .unwrap_or_else(|e| panic!("failed to parse environment variable {}: {}", name, e));
+
+    if !UNSAFE_CONFIG.load(Ordering::SeqCst) && value != default_value {
+        panic!(
+            "unsafe environment variable {} is set. The recommended action is to unset it. \
+             If this is not an indexer on the network, \
+             you may provide the `--unsafe-config` to allow setting this variable.",
+            name
+        )
+    }
+
+    value
+}
+
+/// Panics if:
+/// - The value is not UTF8.
+/// - The value cannot be parsed as T..
+pub fn env_var<E: std::error::Error + Send + Sync, T: FromStr<Err = E> + Eq>(
+    name: &'static str,
+    default_value: T,
+) -> T {
+    let var = match std::env::var(name) {
+        Ok(var) => var,
+        Err(VarError::NotPresent) => return default_value,
+        Err(VarError::NotUnicode(_)) => panic!("environment variable {} is not UTF8", name),
+    };
+
+    var.parse::<T>()
+        .unwrap_or_else(|e| panic!("failed to parse environment variable {}: {}", name, e))
+}
+
+#[derive(Clone)]
+#[non_exhaustive]
+pub struct EnvVars {
+    pub graphql: EnvVarsGraphQl,
+    pub mappings: EnvVarsMapping,
+    pub store: EnvVarsStore,
+
+    /// Enables query throttling when getting database connections goes over this value.
+    /// Load management can be disabled by setting this to 0.
+    ///
+    /// Set by the environment variable `GRAPH_LOAD_THRESHOLD` (expressed in
+    /// milliseconds). The default value is 0.
+    pub load_threshold: Duration,
+    /// When the system is overloaded, any query that causes more than this
+    /// fraction of the effort will be rejected for as long as the process is
+    /// running (i.e. even after the overload situation is resolved).
+    ///
+    /// Set by the environment variable `GRAPH_LOAD_THRESHOLD`
+    /// (expressed as a number). No default value is provided. When *not* set,
+    /// no queries will ever be jailed, even though they will still be subject
+    /// to normal load management when the system is overloaded.
+    pub load_jail_threshold: Option<f64>,
+    /// When this is active, the system will trigger all the steps that the load
+    /// manager would given the other load management configuration settings,
+    /// but never actually decline to run a query; instead, log about load
+    /// management decisions.
+    ///
+    /// Set by the flag `GRAPH_LOAD_SIMULATE`.
+    pub load_simulate: bool,
+    /// Set by the flag `GRAPH_ALLOW_NON_DETERMINISTIC_FULLTEXT_SEARCH`, but
+    /// enabled anyway (overridden) if [debug
+    /// assertions](https://doc.rust-lang.org/reference/conditional-compilation.html#debug_assertions)
+    /// are enabled.
+    pub allow_non_deterministic_fulltext_search: bool,
+    /// Set by the environment variable `GRAPH_MAX_SPEC_VERSION`. The default
+    /// value is `0.0.7`.
+    pub max_spec_version: Version,
+    /// Set by the flag `GRAPH_DISABLE_GRAFTS`.
+    pub disable_grafts: bool,
+    /// Set by the environment variable `GRAPH_LOAD_WINDOW_SIZE` (expressed in
+    /// seconds). The default value is 300 seconds.
+    pub load_window_size: Duration,
+    /// Set by the environment variable `GRAPH_LOAD_BIN_SIZE` (expressed in
+    /// seconds). The default value is 1 second.
+    pub load_bin_size: Duration,
+    /// Set by the environment variable
+    /// `GRAPH_ELASTIC_SEARCH_FLUSH_INTERVAL_SECS` (expressed in seconds). The
+    /// default value is 5 seconds.
+    pub elastic_search_flush_interval: Duration,
+    /// Set by the environment variable
+    /// `GRAPH_ELASTIC_SEARCH_MAX_RETRIES`. The default value is 5.
+    pub elastic_search_max_retries: usize,
+    /// If an instrumented lock is contended for longer than the specified
+    /// duration, a warning will be logged.
+    ///
+    /// Set by the environment variable `GRAPH_LOCK_CONTENTION_LOG_THRESHOLD_MS`
+    /// (expressed in milliseconds). The default value is 100ms.
+    pub lock_contention_log_threshold: Duration,
+    /// This is configurable only for debugging purposes. This value is set by
+    /// the protocol, so indexers running in the network should never set this
+    /// config.
+    ///
+    /// Set by the environment variable `GRAPH_MAX_GAS_PER_HANDLER`.
+    pub max_gas_per_handler: u64,
+    /// Set by the environment variable `GRAPH_LOG_QUERY_TIMING`.
+    pub log_query_timing: HashSet<String>,
+    /// A
+    /// [`chrono`](https://docs.rs/chrono/latest/chrono/#formatting-and-parsing)
+    /// -like format string for logs.
+    ///
+    /// Set by the environment variable `GRAPH_LOG_TIME_FORMAT`. The default
+    /// value is `%b %d %H:%M:%S%.3f`.
+    pub log_time_format: String,
+    /// Set by the flag `GRAPH_LOG_POI_EVENTS`.
+    pub log_poi_events: bool,
+    /// Set by the environment variable `GRAPH_LOG`.
+    pub log_levels: Option<String>,
+    /// Set by the flag `EXPERIMENTAL_STATIC_FILTERS`. Off by default.
+    pub experimental_static_filters: bool,
+    /// Set by the environment variable
+    /// `EXPERIMENTAL_SUBGRAPH_VERSION_SWITCHING_MODE`. The default value is
+    /// `"instant"`.
+    pub subgraph_version_switching_mode: SubgraphVersionSwitchingMode,
+    /// Set by the flag `GRAPH_KILL_IF_UNRESPONSIVE`. Off by default.
+    pub kill_if_unresponsive: bool,
+    /// Guards public access to POIs in the `index-node`.
+    ///
+    /// Set by the environment variable `GRAPH_POI_ACCESS_TOKEN`. No default
+    /// value is provided.
+    pub poi_access_token: Option<String>,
+    /// Set by the environment variable `GRAPH_SUBGRAPH_MAX_DATA_SOURCES`. No
+    /// default value is provided.
+    pub subgraph_max_data_sources: Option<usize>,
+    /// Keep deterministic errors non-fatal even if the subgraph is pending.
+    /// Used for testing Graph Node itself.
+    ///
+    /// Set by the flag `GRAPH_DISABLE_FAIL_FAST`. Off by default.
+    pub disable_fail_fast: bool,
+    /// Ceiling for the backoff retry of non-deterministic errors.
+    ///
+    /// Set by the environment variable `GRAPH_SUBGRAPH_ERROR_RETRY_CEIL_SECS`
+    /// (expressed in seconds). The default value is 1800s (30 minutes).
+    pub subgraph_error_retry_ceil: Duration,
+    /// Experimental feature.
+    ///
+    /// Set by the flag `GRAPH_ENABLE_SELECT_BY_SPECIFIC_ATTRIBUTES`. Off by
+    /// default.
+    pub enable_select_by_specific_attributes: bool,
+    /// Verbose logging of mapping inputs.
+    ///
+    /// Set by the flag `GRAPH_LOG_TRIGGER_DATA`. Off by
+    /// default.
+    pub log_trigger_data: bool,
+    /// Set by the environment variable `GRAPH_EXPLORER_TTL`
+    /// (expressed in seconds). The default value is 10s.
+    pub explorer_ttl: Duration,
+    /// Set by the environment variable `GRAPH_EXPLORER_LOCK_THRESHOLD`
+    /// (expressed in milliseconds). The default value is 100ms.
+    pub explorer_lock_threshold: Duration,
+    /// Set by the environment variable `GRAPH_EXPLORER_QUERY_THRESHOLD`
+    /// (expressed in milliseconds). The default value is 500ms.
+    pub explorer_query_threshold: Duration,
+    /// Set by the environment variable `EXTERNAL_HTTP_BASE_URL`. No default
+    /// value is provided.
+    pub external_http_base_url: Option<String>,
+    /// Set by the environment variable `EXTERNAL_WS_BASE_URL`. No default
+    /// value is provided.
+    pub external_ws_base_url: Option<String>,
+}
+
+impl EnvVars {
+    pub fn from_env() -> Result<Self, envconfig::Error> {
+        let inner = Inner::init_from_env()?;
+        let graphql = InnerGraphQl::init_from_env()?.into();
+        let mapping_handlers = InnerMappingHandlers::init_from_env()?.into();
+        let store = InnerStore::init_from_env()?.into();
+
+        Ok(Self {
+            graphql,
+            mappings: mapping_handlers,
+            store,
+
+            load_threshold: Duration::from_millis(inner.load_threshold_in_ms),
+            load_jail_threshold: inner.load_jail_threshold,
+            load_simulate: inner.load_simulate.0,
+            allow_non_deterministic_fulltext_search: inner
+                .allow_non_deterministic_fulltext_search
+                .0
+                || cfg!(debug_assertions),
+            max_spec_version: inner.max_spec_version,
+            disable_grafts: inner.disable_grafts.0,
+            load_window_size: Duration::from_secs(inner.load_window_size_in_secs),
+            load_bin_size: Duration::from_secs(inner.load_bin_size_in_secs),
+            elastic_search_flush_interval: Duration::from_secs(
+                inner.elastic_search_flush_interval_in_secs,
+            ),
+            elastic_search_max_retries: inner.elastic_search_max_retries,
+            lock_contention_log_threshold: Duration::from_millis(
+                inner.lock_contention_log_threshold_in_ms,
+            ),
+            max_gas_per_handler: inner.max_gas_per_handler.0 .0,
+            log_query_timing: inner
+                .log_query_timing
+                .split(',')
+                .map(str::to_string)
+                .collect(),
+            log_time_format: inner.log_time_format,
+            log_poi_events: inner.log_poi_events.0,
+            log_levels: inner.log_levels,
+            experimental_static_filters: inner.experimental_static_filters.0,
+            subgraph_version_switching_mode: inner.subgraph_version_switching_mode,
+            kill_if_unresponsive: inner.kill_if_unresponsive.0,
+            poi_access_token: inner.poi_access_token,
+            subgraph_max_data_sources: inner.subgraph_max_data_sources,
+            disable_fail_fast: inner.disable_fail_fast.0,
+            subgraph_error_retry_ceil: Duration::from_secs(inner.subgraph_error_retry_ceil_in_secs),
+            enable_select_by_specific_attributes: inner.enable_select_by_specific_attributes.0,
+            log_trigger_data: inner.log_trigger_data.0,
+            explorer_ttl: Duration::from_secs(inner.explorer_ttl_in_secs),
+            explorer_lock_threshold: Duration::from_millis(inner.explorer_lock_threshold_in_msec),
+            explorer_query_threshold: Duration::from_millis(inner.explorer_query_threshold_in_msec),
+            external_http_base_url: inner.external_http_base_url,
+            external_ws_base_url: inner.external_ws_base_url,
+        })
+    }
+
+    /// Equivalent to checking if [`EnvVar::load_threshold`] is set to
+    /// [`Duration::ZERO`].
+    pub fn load_management_is_disabled(&self) -> bool {
+        self.load_threshold.is_zero()
+    }
+
+    fn log_query_timing_contains(&self, kind: &str) -> bool {
+        self.log_query_timing.iter().any(|s| s == kind)
+    }
+
+    pub fn log_sql_timing(&self) -> bool {
+        self.log_query_timing_contains("sql")
+    }
+
+    pub fn log_gql_timing(&self) -> bool {
+        self.log_query_timing_contains("gql")
+    }
+
+    pub fn log_gql_cache_timing(&self) -> bool {
+        self.log_query_timing_contains("cache") && self.log_gql_timing()
+    }
+}
+
+impl Default for EnvVars {
+    fn default() -> Self {
+        ENV_VARS.clone()
+    }
+}
+
+// This does not print any values avoid accidentally leaking any sensitive env vars
+impl fmt::Debug for EnvVars {
+    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
+        write!(f, "env vars")
+    }
+}
+
+#[derive(Clone, Debug, Envconfig)]
+struct Inner {
+    #[envconfig(from = "GRAPH_LOAD_THRESHOLD", default = "0")]
+    load_threshold_in_ms: u64,
+    #[envconfig(from = "GRAPH_LOAD_JAIL_THRESHOLD")]
+    load_jail_threshold: Option<f64>,
+    #[envconfig(from = "GRAPH_LOAD_SIMULATE", default = "false")]
+    load_simulate: EnvVarBoolean,
+    #[envconfig(
+        from = "GRAPH_ALLOW_NON_DETERMINISTIC_FULLTEXT_SEARCH",
+        default = "false"
+    )]
+    allow_non_deterministic_fulltext_search: EnvVarBoolean,
+    #[envconfig(from = "GRAPH_MAX_SPEC_VERSION", default = "0.0.7")]
+    max_spec_version: Version,
+    #[envconfig(from = "GRAPH_DISABLE_GRAFTS", default = "false")]
+    disable_grafts: EnvVarBoolean,
+    #[envconfig(from = "GRAPH_LOAD_WINDOW_SIZE", default = "300")]
+    load_window_size_in_secs: u64,
+    #[envconfig(from = "GRAPH_LOAD_BIN_SIZE", default = "1")]
+    load_bin_size_in_secs: u64,
+    #[envconfig(from = "GRAPH_ELASTIC_SEARCH_FLUSH_INTERVAL_SECS", default = "5")]
+    elastic_search_flush_interval_in_secs: u64,
+    #[envconfig(from = "GRAPH_ELASTIC_SEARCH_MAX_RETRIES", default = "5")]
+    elastic_search_max_retries: usize,
+    #[envconfig(from = "GRAPH_LOCK_CONTENTION_LOG_THRESHOLD_MS", default = "100")]
+    lock_contention_log_threshold_in_ms: u64,
+
+    // For now this is set absurdly high by default because we've seen many cases of gas being
+    // overestimated and failing otherwise legit subgraphs. Once gas costs have been better
+    // benchmarked and adjusted, and out of gas has been made a deterministic error, this default
+    // should be removed and this should somehow be gated on `UNSAFE_CONFIG`.
+    #[envconfig(from = "GRAPH_MAX_GAS_PER_HANDLER", default = "1_000_000_000_000_000")]
+    max_gas_per_handler:
+        WithDefaultUsize<NoUnderscores<u64>, { CONST_MAX_GAS_PER_HANDLER as usize }>,
+    #[envconfig(from = "GRAPH_LOG_QUERY_TIMING", default = "")]
+    log_query_timing: String,
+    #[envconfig(from = "GRAPH_LOG_TIME_FORMAT", default = "%b %d %H:%M:%S%.3f")]
+    log_time_format: String,
+    #[envconfig(from = "GRAPH_LOG_POI_EVENTS", default = "false")]
+    log_poi_events: EnvVarBoolean,
+    #[envconfig(from = "GRAPH_LOG")]
+    log_levels: Option<String>,
+    #[envconfig(from = "EXPERIMENTAL_STATIC_FILTERS", default = "false")]
+    experimental_static_filters: EnvVarBoolean,
+    #[envconfig(
+        from = "EXPERIMENTAL_SUBGRAPH_VERSION_SWITCHING_MODE",
+        default = "instant"
+    )]
+    subgraph_version_switching_mode: SubgraphVersionSwitchingMode,
+    #[envconfig(from = "GRAPH_KILL_IF_UNRESPONSIVE", default = "false")]
+    kill_if_unresponsive: EnvVarBoolean,
+    #[envconfig(from = "GRAPH_POI_ACCESS_TOKEN")]
+    poi_access_token: Option<String>,
+    #[envconfig(from = "GRAPH_SUBGRAPH_MAX_DATA_SOURCES")]
+    subgraph_max_data_sources: Option<usize>,
+    #[envconfig(from = "GRAPH_DISABLE_FAIL_FAST", default = "false")]
+    disable_fail_fast: EnvVarBoolean,
+    #[envconfig(from = "GRAPH_SUBGRAPH_ERROR_RETRY_CEIL_SECS", default = "1800")]
+    subgraph_error_retry_ceil_in_secs: u64,
+    #[envconfig(from = "GRAPH_ENABLE_SELECT_BY_SPECIFIC_ATTRIBUTES", default = "false")]
+    enable_select_by_specific_attributes: EnvVarBoolean,
+    #[envconfig(from = "GRAPH_LOG_TRIGGER_DATA", default = "false")]
+    log_trigger_data: EnvVarBoolean,
+    #[envconfig(from = "GRAPH_EXPLORER_TTL", default = "10")]
+    explorer_ttl_in_secs: u64,
+    #[envconfig(from = "GRAPH_EXPLORER_LOCK_THRESHOLD", default = "100")]
+    explorer_lock_threshold_in_msec: u64,
+    #[envconfig(from = "GRAPH_EXPLORER_QUERY_THRESHOLD", default = "500")]
+    explorer_query_threshold_in_msec: u64,
+    #[envconfig(from = "EXTERNAL_HTTP_BASE_URL")]
+    external_http_base_url: Option<String>,
+    #[envconfig(from = "EXTERNAL_WS_BASE_URL")]
+    external_ws_base_url: Option<String>,
+}
+
+#[derive(Clone, Debug)]
+pub enum CachedSubgraphIds {
+    All,
+    Only(Vec<String>),
+}
+
+/// When reading [`bool`] values from environment variables, we must be able to
+/// parse many different ways to specify booleans:
+///
+///  - Empty strings, i.e. as a flag.
+///  - `true` or `false`.
+///  - `1` or `0`.
+#[derive(Copy, Clone, Debug)]
+pub struct EnvVarBoolean(pub bool);
+
+impl FromStr for EnvVarBoolean {
+    type Err = String;
+
+    fn from_str(s: &str) -> Result<Self, Self::Err> {
+        match s {
+            "" | "true" | "1" => Ok(Self(true)),
+            "false" | "0" => Ok(Self(false)),
+            _ => Err("Invalid env. var. flag, expected true / false / 1 / 0".to_string()),
+        }
+    }
+}
+
+/// Allows us to parse stuff ignoring underscores, notably big numbers.
+#[derive(Copy, Clone, Debug)]
+pub struct NoUnderscores<T>(T);
+
+impl<T> FromStr for NoUnderscores<T>
+where
+    T: FromStr,
+    T::Err: ToString,
+{
+    type Err = String;
+
+    fn from_str(s: &str) -> Result<Self, Self::Err> {
+        match T::from_str(s.replace('_', "").as_str()) {
+            Ok(x) => Ok(Self(x)),
+            Err(e) => Err(e.to_string()),
+        }
+    }
+}
+
+/// Provide a numeric ([`usize`]) default value if the environment flag is
+/// empty.
+#[derive(Copy, Clone, Debug)]
+pub struct WithDefaultUsize<T, const N: usize>(T);
+
+impl<T, const N: usize> FromStr for WithDefaultUsize<T, N>
+where
+    T: FromStr,
+    T::Err: ToString,
+{
+    type Err = String;
+
+    fn from_str(s: &str) -> Result<Self, Self::Err> {
+        let x = if s.is_empty() {
+            T::from_str(N.to_string().as_str())
+        } else {
+            T::from_str(s)
+        };
+        match x {
+            Ok(x) => Ok(Self(x)),
+            Err(e) => Err(e.to_string()),
+        }
+    }
+}
diff --git a/graph/src/env/store.rs b/graph/src/env/store.rs
new file mode 100644
index 0000000..077088b
--- /dev/null
+++ b/graph/src/env/store.rs
@@ -0,0 +1,176 @@
+use std::fmt;
+
+use super::*;
+
+#[derive(Clone)]
+pub struct EnvVarsStore {
+    /// Set by the environment variable `GRAPH_CHAIN_HEAD_WATCHER_TIMEOUT`
+    /// (expressed in seconds). The default value is 30 seconds.
+    pub chain_head_watcher_timeout: Duration,
+    /// This is how long statistics that influence query execution are cached in
+    /// memory before they are reloaded from the database.
+    ///
+    /// Set by the environment variable `GRAPH_QUERY_STATS_REFRESH_INTERVAL`
+    /// (expressed in seconds). The default value is 300 seconds.
+    pub query_stats_refresh_interval: Duration,
+    /// This can be used to effectively disable the query semaphore by setting
+    /// it to a high number, but there's typically no need to configure this.
+    ///
+    /// Set by the environment variable `GRAPH_EXTRA_QUERY_PERMITS`. The default
+    /// value is 0.
+    pub extra_query_permits: usize,
+    /// Set by the environment variable `LARGE_NOTIFICATION_CLEANUP_INTERVAL`
+    /// (expressed in seconds). The default value is 300 seconds.
+    pub large_notification_cleanup_interval: Duration,
+    /// Set by the environment variable `GRAPH_NOTIFICATION_BROADCAST_TIMEOUT`
+    /// (expressed in seconds). The default value is 60 seconds.
+    pub notification_broadcast_timeout: Duration,
+    /// This variable is only here temporarily until we can settle on the right
+    /// batch size through experimentation, and should then just become an
+    /// ordinary constant.
+    ///
+    /// Set by the environment variable `TYPEA_BATCH_SIZE`.
+    pub typea_batch_size: usize,
+    /// Allows for some optimizations when running relational queries. Set this
+    /// to 0 to turn off this optimization.
+    ///
+    /// Set by the environment variable `TYPED_CHILDREN_SET_SIZE`.
+    pub typed_children_set_size: usize,
+    /// When enabled, turns `ORDER BY id` into `ORDER BY id, block_range` in
+    /// some relational queries.
+    ///
+    /// Set by the flag `ORDER_BY_BLOCK_RANGE`. Not meant as a user-tunable,
+    /// only as an emergency setting for the hosted service. Remove after
+    /// 2022-07-01 if hosted service had no issues with it being `true`
+    pub order_by_block_range: bool,
+    /// When the flag is present, `ORDER BY` clauses are changed so that `asc`
+    /// and `desc` ordering produces reverse orders. Setting the flag turns the
+    /// new, correct behavior off.
+    ///
+    /// Set by the flag `REVERSIBLE_ORDER_BY_OFF`.
+    pub reversible_order_by_off: bool,
+    /// Whether to disable the notifications that feed GraphQL
+    /// subscriptions. When the flag is set, no updates
+    /// about entity changes will be sent to query nodes.
+    ///
+    /// Set by the flag `GRAPH_DISABLE_SUBSCRIPTION_NOTIFICATIONS`. Not set
+    /// by default.
+    pub disable_subscription_notifications: bool,
+    /// A fallback in case the logic to remember database availability goes
+    /// wrong; when this is set, we always try to get a connection and never
+    /// use the availability state we remembered.
+    ///
+    /// Set by the flag `GRAPH_STORE_CONNECTION_TRY_ALWAYS`. Disabled by
+    /// default.
+    pub connection_try_always: bool,
+    /// Set by the environment variable `GRAPH_REMOVE_UNUSED_INTERVAL`
+    /// (expressed in minutes). The default value is 360 minutes.
+    pub remove_unused_interval: chrono::Duration,
+
+    // These should really be set through the configuration file, especially for
+    // `GRAPH_STORE_CONNECTION_MIN_IDLE` and
+    // `GRAPH_STORE_CONNECTION_IDLE_TIMEOUT`. It's likely that they should be
+    // configured differently for each pool.
+    /// Set by the environment variable `GRAPH_STORE_CONNECTION_TIMEOUT` (expressed
+    /// in milliseconds). The default value is 5000ms.
+    pub connection_timeout: Duration,
+    /// Set by the environment variable `GRAPH_STORE_CONNECTION_MIN_IDLE`. No
+    /// default value is provided.
+    pub connection_min_idle: Option<u32>,
+    /// Set by the environment variable `GRAPH_STORE_CONNECTION_IDLE_TIMEOUT`
+    /// (expressed in seconds). The default value is 600s.
+    pub connection_idle_timeout: Duration,
+
+    /// The size of the write queue; this many blocks can be buffered for
+    /// writing before calls to transact block operations will block.
+    /// Setting this to `0` disables pipelined writes, and writes will be
+    /// done synchronously.
+    pub write_queue_size: usize,
+
+    /// This is just in case new behavior causes issues. This can be removed
+    /// once the new behavior has run in the hosted service for a few days
+    /// without issues.
+    pub disable_error_for_toplevel_parents: bool,
+}
+
+// This does not print any values avoid accidentally leaking any sensitive env vars
+impl fmt::Debug for EnvVarsStore {
+    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
+        write!(f, "env vars")
+    }
+}
+
+impl From<InnerStore> for EnvVarsStore {
+    fn from(x: InnerStore) -> Self {
+        Self {
+            chain_head_watcher_timeout: Duration::from_secs(x.chain_head_watcher_timeout_in_secs),
+            query_stats_refresh_interval: Duration::from_secs(
+                x.query_stats_refresh_interval_in_secs,
+            ),
+            extra_query_permits: x.extra_query_permits,
+            large_notification_cleanup_interval: Duration::from_secs(
+                x.large_notification_cleanup_interval_in_secs,
+            ),
+            notification_broadcast_timeout: Duration::from_secs(
+                x.notification_broadcast_timeout_in_secs,
+            ),
+            typea_batch_size: x.typea_batch_size,
+            typed_children_set_size: x.typed_children_set_size,
+            order_by_block_range: x.order_by_block_range.0,
+            reversible_order_by_off: x.reversible_order_by_off.0,
+            disable_subscription_notifications: x.disable_subscription_notifications.0,
+            connection_try_always: x.connection_try_always.0,
+            remove_unused_interval: chrono::Duration::minutes(
+                x.remove_unused_interval_in_minutes as i64,
+            ),
+            connection_timeout: Duration::from_millis(x.connection_timeout_in_millis),
+            connection_min_idle: x.connection_min_idle,
+            connection_idle_timeout: Duration::from_secs(x.connection_idle_timeout_in_secs),
+            write_queue_size: x.write_queue_size,
+            disable_error_for_toplevel_parents: x.disable_error_for_toplevel_parents.0,
+        }
+    }
+}
+
+#[derive(Clone, Debug, Envconfig)]
+pub struct InnerStore {
+    #[envconfig(from = "GRAPH_CHAIN_HEAD_WATCHER_TIMEOUT", default = "30")]
+    chain_head_watcher_timeout_in_secs: u64,
+    #[envconfig(from = "GRAPH_QUERY_STATS_REFRESH_INTERVAL", default = "300")]
+    query_stats_refresh_interval_in_secs: u64,
+    #[envconfig(from = "GRAPH_EXTRA_QUERY_PERMITS", default = "0")]
+    extra_query_permits: usize,
+    #[envconfig(from = "LARGE_NOTIFICATION_CLEANUP_INTERVAL", default = "300")]
+    large_notification_cleanup_interval_in_secs: u64,
+    #[envconfig(from = "GRAPH_NOTIFICATION_BROADCAST_TIMEOUT", default = "60")]
+    notification_broadcast_timeout_in_secs: u64,
+    #[envconfig(from = "TYPEA_BATCH_SIZE", default = "150")]
+    typea_batch_size: usize,
+    #[envconfig(from = "TYPED_CHILDREN_SET_SIZE", default = "150")]
+    typed_children_set_size: usize,
+    #[envconfig(from = "ORDER_BY_BLOCK_RANGE", default = "true")]
+    order_by_block_range: EnvVarBoolean,
+    #[envconfig(from = "REVERSIBLE_ORDER_BY_OFF", default = "false")]
+    reversible_order_by_off: EnvVarBoolean,
+    #[envconfig(from = "GRAPH_DISABLE_SUBSCRIPTION_NOTIFICATIONS", default = "false")]
+    disable_subscription_notifications: EnvVarBoolean,
+    #[envconfig(from = "GRAPH_STORE_CONNECTION_TRY_ALWAYS", default = "false")]
+    connection_try_always: EnvVarBoolean,
+    #[envconfig(from = "GRAPH_REMOVE_UNUSED_INTERVAL", default = "360")]
+    remove_unused_interval_in_minutes: u64,
+
+    // These should really be set through the configuration file, especially for
+    // `GRAPH_STORE_CONNECTION_MIN_IDLE` and
+    // `GRAPH_STORE_CONNECTION_IDLE_TIMEOUT`. It's likely that they should be
+    // configured differently for each pool.
+    #[envconfig(from = "GRAPH_STORE_CONNECTION_TIMEOUT", default = "5000")]
+    connection_timeout_in_millis: u64,
+    #[envconfig(from = "GRAPH_STORE_CONNECTION_MIN_IDLE")]
+    connection_min_idle: Option<u32>,
+    #[envconfig(from = "GRAPH_STORE_CONNECTION_IDLE_TIMEOUT", default = "600")]
+    connection_idle_timeout_in_secs: u64,
+    #[envconfig(from = "GRAPH_STORE_WRITE_QUEUE", default = "5")]
+    write_queue_size: usize,
+    #[envconfig(from = "GRAPH_DISABLE_ERROR_FOR_TOPLEVEL_PARENTS", default = "false")]
+    disable_error_for_toplevel_parents: EnvVarBoolean,
+}
diff --git a/graph/src/ext/futures.rs b/graph/src/ext/futures.rs
new file mode 100644
index 0000000..57eae69
--- /dev/null
+++ b/graph/src/ext/futures.rs
@@ -0,0 +1,330 @@
+use crate::prelude::tokio::macros::support::Poll;
+use crate::prelude::{Pin, StoreError};
+use futures03::channel::oneshot;
+use futures03::{future::Fuse, Future, FutureExt, Stream};
+use std::fmt::{Debug, Display};
+use std::sync::{Arc, Mutex, Weak};
+use std::task::Context;
+use std::time::Duration;
+
+/// A cancelable stream or future.
+///
+/// Created by calling `cancelable` extension method.
+/// Can be canceled through the corresponding `CancelGuard`.
+pub struct Cancelable<T, C> {
+    inner: T,
+    cancel_receiver: Fuse<oneshot::Receiver<()>>,
+    on_cancel: C,
+}
+
+impl<T, C> Cancelable<T, C> {
+    pub fn get_mut(&mut self) -> &mut T {
+        &mut self.inner
+    }
+}
+
+/// It's not viable to use `select` directly, so we do a custom implementation.
+impl<S: Stream + Unpin, C: Fn() -> S::Item + Unpin> Stream for Cancelable<S, C> {
+    type Item = S::Item;
+
+    fn poll_next(mut self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<Option<Self::Item>> {
+        // Error if the stream was canceled by dropping the sender.
+        match self.cancel_receiver.poll_unpin(cx) {
+            Poll::Ready(Ok(_)) => unreachable!(),
+            Poll::Ready(Err(_)) => Poll::Ready(Some((self.on_cancel)())),
+            Poll::Pending => Pin::new(&mut self.inner).poll_next(cx),
+        }
+    }
+}
+
+impl<F: Future + Unpin, C: Fn() -> F::Output + Unpin> Future for Cancelable<F, C> {
+    type Output = F::Output;
+
+    fn poll(mut self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<Self::Output> {
+        // Error if the future was canceled by dropping the sender.
+        // `canceled` is fused so we may ignore `Ok`s.
+        match self.cancel_receiver.poll_unpin(cx) {
+            Poll::Ready(Ok(_)) => unreachable!(),
+            Poll::Ready(Err(_)) => Poll::Ready((self.on_cancel)()),
+            Poll::Pending => Pin::new(&mut self.inner).poll(cx),
+        }
+    }
+}
+
+/// A `CancelGuard` or `SharedCancelGuard`.
+pub trait Canceler {
+    /// Adds `cancel_sender` to the set being guarded.
+    /// Avoid calling directly and prefer using `cancelable`.
+    fn add_cancel_sender(&self, cancel_sender: oneshot::Sender<()>);
+}
+
+/// Cancels any guarded futures and streams when dropped.
+#[derive(Debug, Default)]
+pub struct CancelGuard {
+    /// This is the only non-temporary strong reference to this `Arc`, therefore
+    /// the `Vec` should be dropped shortly after `self` is dropped.
+    cancel_senders: Arc<Mutex<Vec<oneshot::Sender<()>>>>,
+}
+
+impl CancelGuard {
+    /// Creates a guard that initially guards nothing.
+    pub fn new() -> Self {
+        Self::default()
+    }
+
+    /// A more readable `drop`.
+    pub fn cancel(self) {}
+
+    pub fn handle(&self) -> CancelHandle {
+        CancelHandle {
+            guard: Arc::downgrade(&self.cancel_senders),
+        }
+    }
+}
+
+impl Canceler for CancelGuard {
+    fn add_cancel_sender(&self, cancel_sender: oneshot::Sender<()>) {
+        self.cancel_senders.lock().unwrap().push(cancel_sender);
+    }
+}
+
+/// A shared handle to a guard, used to add more cancelables. The handle
+/// may outlive the guard, if `cancelable` is called with a handle to a
+/// dropped guard, then the future or stream it is immediately canceled.
+///
+/// Dropping a handle has no effect.
+#[derive(Clone, Debug)]
+pub struct CancelHandle {
+    guard: Weak<Mutex<Vec<oneshot::Sender<()>>>>,
+}
+
+pub trait CancelToken {
+    fn is_canceled(&self) -> bool;
+    fn check_cancel(&self) -> Result<(), Canceled> {
+        if self.is_canceled() {
+            Err(Canceled)
+        } else {
+            Ok(())
+        }
+    }
+}
+
+pub struct NeverCancel;
+
+impl CancelToken for NeverCancel {
+    #[inline]
+    fn is_canceled(&self) -> bool {
+        false
+    }
+}
+
+pub struct Canceled;
+
+impl CancelToken for CancelHandle {
+    fn is_canceled(&self) -> bool {
+        // Has been canceled if and only if the guard is gone.
+        self.guard.upgrade().is_none()
+    }
+}
+
+impl Canceler for CancelHandle {
+    fn add_cancel_sender(&self, cancel_sender: oneshot::Sender<()>) {
+        if let Some(guard) = self.guard.upgrade() {
+            // If the guard exists, register the canceler.
+            guard.lock().unwrap().push(cancel_sender);
+        } else {
+            // Otherwise cancel immediately.
+            drop(cancel_sender)
+        }
+    }
+}
+
+/// A cancelation guard that can be canceled through a shared reference such as
+/// an `Arc`.
+///
+/// To cancel guarded streams or futures, call `cancel` or drop the guard.
+#[derive(Debug)]
+pub struct SharedCancelGuard {
+    guard: Mutex<Option<CancelGuard>>,
+}
+
+impl SharedCancelGuard {
+    /// Creates a guard that initially guards nothing.
+    pub fn new() -> Self {
+        Self::default()
+    }
+
+    /// Cancels the stream, a noop if already canceled.
+    pub fn cancel(&self) {
+        *self.guard.lock().unwrap() = None
+    }
+
+    pub fn is_canceled(&self) -> bool {
+        self.guard.lock().unwrap().is_none()
+    }
+
+    pub fn handle(&self) -> CancelHandle {
+        if let Some(ref guard) = *self.guard.lock().unwrap() {
+            guard.handle()
+        } else {
+            // A handle that is always canceled.
+            CancelHandle { guard: Weak::new() }
+        }
+    }
+}
+
+impl Default for SharedCancelGuard {
+    fn default() -> Self {
+        Self {
+            guard: Mutex::new(Some(CancelGuard::new())),
+        }
+    }
+}
+
+impl Canceler for SharedCancelGuard {
+    /// Cancels immediately if `self` has already been canceled.
+    fn add_cancel_sender(&self, cancel_sender: oneshot::Sender<()>) {
+        if let Some(ref mut guard) = *self.guard.lock().unwrap() {
+            guard.add_cancel_sender(cancel_sender);
+        } else {
+            drop(cancel_sender)
+        }
+    }
+}
+
+/// An implementor of `Canceler` that never cancels,
+/// making `cancelable` a noop.
+#[derive(Debug, Default)]
+pub struct DummyCancelGuard;
+
+impl Canceler for DummyCancelGuard {
+    fn add_cancel_sender(&self, cancel_sender: oneshot::Sender<()>) {
+        // Send to the channel, preventing cancelation.
+        let _ = cancel_sender.send(());
+    }
+}
+
+pub trait StreamExtension: Stream + Sized {
+    /// When `cancel` is called on a `CancelGuard` or it is dropped,
+    /// `Cancelable` receives an error.
+    ///
+    fn cancelable<C: Fn() -> Self::Item>(
+        self,
+        guard: &impl Canceler,
+        on_cancel: C,
+    ) -> Cancelable<Self, C>;
+}
+
+impl<S: Stream> StreamExtension for S {
+    fn cancelable<C: Fn() -> S::Item>(
+        self,
+        guard: &impl Canceler,
+        on_cancel: C,
+    ) -> Cancelable<Self, C> {
+        let (canceler, cancel_receiver) = oneshot::channel();
+        guard.add_cancel_sender(canceler);
+        Cancelable {
+            inner: self,
+            cancel_receiver: cancel_receiver.fuse(),
+            on_cancel,
+        }
+    }
+}
+
+pub trait FutureExtension: Future + Sized {
+    /// When `cancel` is called on a `CancelGuard` or it is dropped,
+    /// `Cancelable` receives an error.
+    ///
+    /// `on_cancel` is called to make an error value upon cancelation.
+    fn cancelable<C: Fn() -> Self::Output>(
+        self,
+        guard: &impl Canceler,
+        on_cancel: C,
+    ) -> Cancelable<Self, C>;
+
+    fn timeout(self, dur: Duration) -> tokio::time::Timeout<Self>;
+}
+
+impl<F: Future> FutureExtension for F {
+    fn cancelable<C: Fn() -> F::Output>(
+        self,
+        guard: &impl Canceler,
+        on_cancel: C,
+    ) -> Cancelable<Self, C> {
+        let (canceler, cancel_receiver) = oneshot::channel();
+        guard.add_cancel_sender(canceler);
+        Cancelable {
+            inner: self,
+            cancel_receiver: cancel_receiver.fuse(),
+            on_cancel,
+        }
+    }
+
+    fn timeout(self, dur: Duration) -> tokio::time::Timeout<Self> {
+        tokio::time::timeout(dur, self)
+    }
+}
+
+#[derive(thiserror::Error, Debug)]
+pub enum CancelableError<E: Display + Debug> {
+    #[error("operation canceled")]
+    Cancel,
+
+    #[error("{0:}")]
+    Error(E),
+}
+
+impl From<StoreError> for CancelableError<anyhow::Error> {
+    fn from(e: StoreError) -> Self {
+        Self::Error(anyhow::Error::from(e))
+    }
+}
+
+impl From<CancelableError<anyhow::Error>> for CancelableError<StoreError> {
+    fn from(e: CancelableError<anyhow::Error>) -> Self {
+        match e {
+            CancelableError::Error(e) => CancelableError::Error(e.into()),
+            CancelableError::Cancel => CancelableError::Cancel,
+        }
+    }
+}
+
+impl From<StoreError> for CancelableError<StoreError> {
+    fn from(e: StoreError) -> Self {
+        Self::Error(e)
+    }
+}
+
+impl<E: Display + Debug> From<Canceled> for CancelableError<E> {
+    fn from(_: Canceled) -> Self {
+        Self::Cancel
+    }
+}
+
+impl From<diesel::result::Error> for CancelableError<anyhow::Error> {
+    fn from(e: diesel::result::Error) -> Self {
+        Self::Error(e.into())
+    }
+}
+
+impl From<diesel::result::Error> for CancelableError<StoreError> {
+    fn from(e: diesel::result::Error) -> Self {
+        Self::Error(e.into())
+    }
+}
+
+impl From<anyhow::Error> for CancelableError<anyhow::Error> {
+    fn from(e: anyhow::Error) -> Self {
+        Self::Error(e)
+    }
+}
+
+impl From<CancelableError<StoreError>> for StoreError {
+    fn from(err: CancelableError<StoreError>) -> StoreError {
+        use CancelableError::*;
+        match err {
+            Cancel => StoreError::Canceled,
+            Error(e) => e,
+        }
+    }
+}
diff --git a/graph/src/ext/mod.rs b/graph/src/ext/mod.rs
new file mode 100644
index 0000000..4e9773f
--- /dev/null
+++ b/graph/src/ext/mod.rs
@@ -0,0 +1,2 @@
+///! Extension traits for external types.
+pub mod futures;
diff --git a/graph/src/firehose/.gitignore b/graph/src/firehose/.gitignore
new file mode 100644
index 0000000..0a1cbe2
--- /dev/null
+++ b/graph/src/firehose/.gitignore
@@ -0,0 +1,3 @@
+# For an unknown reason, the build script generates this file but it should not.
+# See https://github.com/hyperium/tonic/issues/757
+google.protobuf.rs
\ No newline at end of file
diff --git a/graph/src/firehose/codec.rs b/graph/src/firehose/codec.rs
new file mode 100644
index 0000000..c3b81ce
--- /dev/null
+++ b/graph/src/firehose/codec.rs
@@ -0,0 +1,20 @@
+#[rustfmt::skip]
+#[path = "sf.firehose.v1.rs"]
+mod pbfirehose;
+
+#[rustfmt::skip]
+#[path = "sf.ethereum.transform.v1.rs"]
+mod pbethereum;
+
+#[rustfmt::skip]
+#[path = "sf.near.transform.v1.rs"]
+mod pbnear;
+
+#[rustfmt::skip]
+#[path = "sf.cosmos.transform.v1.rs"]
+mod pbcosmos;
+
+pub use pbcosmos::*;
+pub use pbethereum::*;
+pub use pbfirehose::*;
+pub use pbnear::*;
diff --git a/graph/src/firehose/endpoints.rs b/graph/src/firehose/endpoints.rs
new file mode 100644
index 0000000..344506a
--- /dev/null
+++ b/graph/src/firehose/endpoints.rs
@@ -0,0 +1,332 @@
+use crate::{
+    blockchain::Block as BlockchainBlock,
+    blockchain::BlockPtr,
+    cheap_clone::CheapClone,
+    components::store::BlockNumber,
+    firehose::{decode_firehose_block, ForkStep},
+    prelude::{debug, info},
+    substreams,
+};
+use futures03::StreamExt;
+use http::uri::{Scheme, Uri};
+use rand::prelude::IteratorRandom;
+use slog::Logger;
+use std::{collections::BTreeMap, fmt::Display, iter, sync::Arc, time::Duration};
+use tonic::{
+    metadata::MetadataValue,
+    transport::{Channel, ClientTlsConfig},
+    Request,
+};
+
+use super::codec as firehose;
+
+#[derive(Clone, Debug)]
+pub struct FirehoseEndpoint {
+    pub provider: String,
+    pub token: Option<String>,
+    pub filters_enabled: bool,
+    pub compression_enabled: bool,
+    channel: Channel,
+}
+
+impl Display for FirehoseEndpoint {
+    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
+        Display::fmt(self.provider.as_str(), f)
+    }
+}
+
+impl FirehoseEndpoint {
+    pub fn new<S: AsRef<str>>(
+        provider: S,
+        url: S,
+        token: Option<String>,
+        filters_enabled: bool,
+        compression_enabled: bool,
+        conn_pool_size: u16,
+    ) -> Self {
+        let uri = url
+            .as_ref()
+            .parse::<Uri>()
+            .expect("the url should have been validated by now, so it is a valid Uri");
+
+        let endpoint_builder = match uri.scheme().unwrap_or(&Scheme::HTTP).as_str() {
+            "http" => Channel::builder(uri),
+            "https" => Channel::builder(uri)
+                .tls_config(ClientTlsConfig::new())
+                .expect("TLS config on this host is invalid"),
+            _ => panic!("invalid uri scheme for firehose endpoint"),
+        };
+
+        // Note on the connection window size: We run multiple block streams on a same connection,
+        // and a problematic subgraph with a stalled block stream might consume the entire window
+        // capacity for its http2 stream and never release it. If there are enough stalled block
+        // streams to consume all the capacity on the http2 connection, then _all_ subgraphs using
+        // this same http2 connection will stall. At a default stream window size of 2^16, setting
+        // the connection window size to the maximum of 2^31 allows for 2^15 streams without any
+        // contention, which is effectively unlimited for normal graph node operation.
+        //
+        // Note: Do not set `http2_keep_alive_interval` or `http2_adaptive_window`, as these will
+        // send ping frames, and many cloud load balancers will drop connections that frequently
+        // send pings.
+        let endpoint = endpoint_builder
+            .initial_connection_window_size(Some((1 << 31) - 1))
+            .connect_timeout(Duration::from_secs(10))
+            .tcp_keepalive(Some(Duration::from_secs(15)))
+            // Timeout on each request, so the timeout to estabilish each 'Blocks' stream.
+            .timeout(Duration::from_secs(120));
+
+        // Load balancing on a same endpoint is useful because it creates a connection pool.
+        let channel = Channel::balance_list(iter::repeat(endpoint).take(conn_pool_size as usize));
+
+        FirehoseEndpoint {
+            provider: provider.as_ref().to_string(),
+            channel,
+            token,
+            filters_enabled,
+            compression_enabled,
+        }
+    }
+
+    pub async fn genesis_block_ptr<M>(&self, logger: &Logger) -> Result<BlockPtr, anyhow::Error>
+    where
+        M: prost::Message + BlockchainBlock + Default + 'static,
+    {
+        info!(logger, "Requesting genesis block from firehose");
+
+        // We use 0 here to mean the genesis block of the chain. Firehose
+        // when seeing start block number 0 will always return the genesis
+        // block of the chain, even if the chain's start block number is
+        // not starting at block #0.
+        self.block_ptr_for_number::<M>(logger, 0).await
+    }
+
+    pub async fn block_ptr_for_number<M>(
+        &self,
+        logger: &Logger,
+        number: BlockNumber,
+    ) -> Result<BlockPtr, anyhow::Error>
+    where
+        M: prost::Message + BlockchainBlock + Default + 'static,
+    {
+        let token_metadata = match self.token.clone() {
+            Some(token) => Some(MetadataValue::from_str(token.as_str())?),
+            None => None,
+        };
+
+        let mut client = firehose::stream_client::StreamClient::with_interceptor(
+            self.channel.cheap_clone(),
+            move |mut r: Request<()>| {
+                if let Some(ref t) = token_metadata {
+                    r.metadata_mut().insert("authorization", t.clone());
+                }
+
+                Ok(r)
+            },
+        )
+        .accept_gzip();
+
+        if self.compression_enabled {
+            client = client.send_gzip();
+        }
+
+        debug!(
+            logger,
+            "Connecting to firehose to retrieve block for number {}", number
+        );
+
+        // The trick is the following.
+        //
+        // Firehose `start_block_num` and `stop_block_num` are both inclusive, so we specify
+        // the block we are looking for in both.
+        //
+        // Now, the remaining question is how the block from the canonical chain is picked. We
+        // leverage the fact that Firehose will always send the block in the longuest chain as the
+        // last message of this request.
+        //
+        // That way, we either get the final block if the block is now in a final segment of the
+        // chain (or probabilisticly if not finality concept exists for the chain). Or we get the
+        // block that is in the longuest chain according to Firehose.
+        let response_stream = client
+            .blocks(firehose::Request {
+                start_block_num: number as i64,
+                stop_block_num: number as u64,
+                fork_steps: vec![ForkStep::StepNew as i32, ForkStep::StepUndo as i32],
+                ..Default::default()
+            })
+            .await?;
+
+        let mut block_stream = response_stream.into_inner();
+
+        debug!(logger, "Retrieving block(s) from firehose");
+
+        let mut latest_received_block: Option<BlockPtr> = None;
+        while let Some(message) = block_stream.next().await {
+            match message {
+                Ok(v) => {
+                    let block = decode_firehose_block::<M>(&v)?.ptr();
+
+                    match latest_received_block {
+                        None => {
+                            latest_received_block = Some(block);
+                        }
+                        Some(ref actual_ptr) => {
+                            // We want to receive all events related to a specific block number,
+                            // however, in some circumstances, it seems Firehose would not stop sending
+                            // blocks (`start_block_num: 0 and stop_block_num: 0` on NEAR seems to trigger
+                            // this).
+                            //
+                            // To prevent looping infinitely, we stop as soon as a new received block's
+                            // number is higher than the latest received block's number, in which case it
+                            // means it's an event for a block we are not interested in.
+                            if block.number > actual_ptr.number {
+                                break;
+                            }
+
+                            latest_received_block = Some(block);
+                        }
+                    }
+                }
+                Err(e) => return Err(anyhow::format_err!("firehose error {}", e)),
+            };
+        }
+
+        match latest_received_block {
+            Some(block_ptr) => Ok(block_ptr),
+            None => Err(anyhow::format_err!(
+                "Firehose should have returned at least one block for request"
+            )),
+        }
+    }
+
+    pub async fn stream_blocks(
+        self: Arc<Self>,
+        request: firehose::Request,
+    ) -> Result<tonic::Streaming<firehose::Response>, anyhow::Error> {
+        let token_metadata = match self.token.clone() {
+            Some(token) => Some(MetadataValue::from_str(token.as_str())?),
+            None => None,
+        };
+
+        let mut client = firehose::stream_client::StreamClient::with_interceptor(
+            self.channel.cheap_clone(),
+            move |mut r: Request<()>| {
+                if let Some(ref t) = token_metadata {
+                    r.metadata_mut().insert("authorization", t.clone());
+                }
+
+                Ok(r)
+            },
+        )
+        .accept_gzip();
+        if self.compression_enabled {
+            client = client.send_gzip();
+        }
+
+        let response_stream = client.blocks(request).await?;
+        let block_stream = response_stream.into_inner();
+
+        Ok(block_stream)
+    }
+
+    pub async fn substreams(
+        self: Arc<Self>,
+        request: substreams::Request,
+    ) -> Result<tonic::Streaming<substreams::Response>, anyhow::Error> {
+        let token_metadata = match self.token.clone() {
+            Some(token) => Some(MetadataValue::from_str(token.as_str())?),
+            None => None,
+        };
+
+        let mut client = substreams::stream_client::StreamClient::with_interceptor(
+            self.channel.cheap_clone(),
+            move |mut r: Request<()>| {
+                if let Some(ref t) = token_metadata {
+                    r.metadata_mut().insert("authorization", t.clone());
+                }
+
+                Ok(r)
+            },
+        );
+
+        let response_stream = client.blocks(request).await?;
+        let block_stream = response_stream.into_inner();
+
+        Ok(block_stream)
+    }
+}
+
+#[derive(Clone, Debug)]
+pub struct FirehoseEndpoints(Vec<Arc<FirehoseEndpoint>>);
+
+impl FirehoseEndpoints {
+    pub fn new() -> Self {
+        Self(vec![])
+    }
+
+    pub fn len(&self) -> usize {
+        self.0.len()
+    }
+
+    pub fn random(&self) -> Option<&Arc<FirehoseEndpoint>> {
+        // Select from the matching adapters randomly
+        let mut rng = rand::thread_rng();
+        self.0.iter().choose(&mut rng)
+    }
+
+    pub fn remove(&mut self, provider: &str) {
+        self.0
+            .retain(|network_endpoint| network_endpoint.provider != provider);
+    }
+}
+
+impl From<Vec<Arc<FirehoseEndpoint>>> for FirehoseEndpoints {
+    fn from(val: Vec<Arc<FirehoseEndpoint>>) -> Self {
+        FirehoseEndpoints(val)
+    }
+}
+
+#[derive(Clone, Debug)]
+pub struct FirehoseNetworks {
+    /// networks contains a map from chain id (`near-mainnet`, `near-testnet`, `solana-mainnet`, etc.)
+    /// to a list of FirehoseEndpoint (type wrapper around `Arc<Vec<FirehoseEndpoint>>`).
+    pub networks: BTreeMap<String, FirehoseEndpoints>,
+}
+
+impl FirehoseNetworks {
+    pub fn new() -> FirehoseNetworks {
+        FirehoseNetworks {
+            networks: BTreeMap::new(),
+        }
+    }
+
+    pub fn insert(&mut self, chain_id: String, endpoint: Arc<FirehoseEndpoint>) {
+        let endpoints = self
+            .networks
+            .entry(chain_id)
+            .or_insert_with(FirehoseEndpoints::new);
+
+        endpoints.0.push(endpoint);
+    }
+
+    pub fn remove(&mut self, chain_id: &str, provider: &str) {
+        if let Some(endpoints) = self.networks.get_mut(chain_id) {
+            endpoints.remove(provider);
+        }
+    }
+
+    /// Returns a `Vec` of tuples where the first element of the tuple is
+    /// the chain's id and the second one is an endpoint for this chain.
+    /// There can be mulitple tuple with the same chain id but with different
+    /// endpoint where multiple providers exist for a single chain id.
+    pub fn flatten(&self) -> Vec<(String, Arc<FirehoseEndpoint>)> {
+        self.networks
+            .iter()
+            .flat_map(|(chain_id, firehose_endpoints)| {
+                firehose_endpoints
+                    .0
+                    .iter()
+                    .map(move |endpoint| (chain_id.clone(), endpoint.clone()))
+            })
+            .collect()
+    }
+}
diff --git a/graph/src/firehose/helpers.rs b/graph/src/firehose/helpers.rs
new file mode 100644
index 0000000..b66052b
--- /dev/null
+++ b/graph/src/firehose/helpers.rs
@@ -0,0 +1,19 @@
+use std::sync::Arc;
+
+use crate::blockchain::Block as BlockchainBlock;
+use crate::firehose;
+use anyhow::Error;
+
+pub fn decode_firehose_block<M>(
+    block_response: &firehose::Response,
+) -> Result<Arc<dyn BlockchainBlock>, Error>
+where
+    M: prost::Message + BlockchainBlock + Default + 'static,
+{
+    let any_block = block_response
+        .block
+        .as_ref()
+        .expect("block payload information should always be present");
+
+    Ok(Arc::new(M::decode(any_block.value.as_ref())?))
+}
diff --git a/graph/src/firehose/mod.rs b/graph/src/firehose/mod.rs
new file mode 100644
index 0000000..8dd12b0
--- /dev/null
+++ b/graph/src/firehose/mod.rs
@@ -0,0 +1,7 @@
+mod codec;
+mod endpoints;
+mod helpers;
+
+pub use codec::*;
+pub use endpoints::*;
+pub use helpers::decode_firehose_block;
diff --git a/graph/src/firehose/sf.cosmos.transform.v1.rs b/graph/src/firehose/sf.cosmos.transform.v1.rs
new file mode 100644
index 0000000..f93fef1
--- /dev/null
+++ b/graph/src/firehose/sf.cosmos.transform.v1.rs
@@ -0,0 +1,5 @@
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct EventTypeFilter {
+    #[prost(string, repeated, tag="1")]
+    pub event_types: ::prost::alloc::vec::Vec<::prost::alloc::string::String>,
+}
diff --git a/graph/src/firehose/sf.ethereum.transform.v1.rs b/graph/src/firehose/sf.ethereum.transform.v1.rs
new file mode 100644
index 0000000..b677e17
--- /dev/null
+++ b/graph/src/firehose/sf.ethereum.transform.v1.rs
@@ -0,0 +1,69 @@
+/// CombinedFilter is a combination of "LogFilters" and "CallToFilters"
+///
+/// It transforms the requested stream in two ways: 
+///   1. STRIPPING
+///      The block data is stripped from all transactions that don't
+///      match any of the filters.  
+///
+///   2. SKIPPING
+///      If an "block index" covers a range containing a
+///      block that does NOT match any of the filters, the block will be
+///      skipped altogether, UNLESS send_all_block_headers is enabled
+///      In that case, the block would still be sent, but without any
+///      transactionTrace
+///
+/// The SKIPPING feature only applies to historical blocks, because
+/// the "block index" is always produced after the merged-blocks files
+/// are produced. Therefore, the "live" blocks are never filtered out.
+///
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct CombinedFilter {
+    #[prost(message, repeated, tag="1")]
+    pub log_filters: ::prost::alloc::vec::Vec<LogFilter>,
+    #[prost(message, repeated, tag="2")]
+    pub call_filters: ::prost::alloc::vec::Vec<CallToFilter>,
+    /// Always send all blocks. if they don't match any log_filters or call_filters, 
+    /// all the transactions will be filtered out, sending only the header.
+    #[prost(bool, tag="3")]
+    pub send_all_block_headers: bool,
+}
+/// MultiLogFilter concatenates the results of each LogFilter (inclusive OR)
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct MultiLogFilter {
+    #[prost(message, repeated, tag="1")]
+    pub log_filters: ::prost::alloc::vec::Vec<LogFilter>,
+}
+/// LogFilter will match calls where *BOTH*
+/// * the contract address that emits the log is one in the provided addresses -- OR addresses list is empty --
+/// * the event signature (topic.0) is one of the provided event_signatures -- OR event_signatures is empty --
+///
+/// a LogFilter with both empty addresses and event_signatures lists is invalid and will fail.
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct LogFilter {
+    #[prost(bytes="vec", repeated, tag="1")]
+    pub addresses: ::prost::alloc::vec::Vec<::prost::alloc::vec::Vec<u8>>,
+    /// corresponds to the keccak of the event signature which is stores in topic.0
+    #[prost(bytes="vec", repeated, tag="2")]
+    pub event_signatures: ::prost::alloc::vec::Vec<::prost::alloc::vec::Vec<u8>>,
+}
+/// MultiCallToFilter concatenates the results of each CallToFilter (inclusive OR)
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct MultiCallToFilter {
+    #[prost(message, repeated, tag="1")]
+    pub call_filters: ::prost::alloc::vec::Vec<CallToFilter>,
+}
+/// CallToFilter will match calls where *BOTH*
+/// * the contract address (TO) is one in the provided addresses -- OR addresses list is empty --
+/// * the method signature (in 4-bytes format) is one of the provided signatures -- OR signatures is empty --
+///
+/// a CallToFilter with both empty addresses and signatures lists is invalid and will fail.
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct CallToFilter {
+    #[prost(bytes="vec", repeated, tag="1")]
+    pub addresses: ::prost::alloc::vec::Vec<::prost::alloc::vec::Vec<u8>>,
+    #[prost(bytes="vec", repeated, tag="2")]
+    pub signatures: ::prost::alloc::vec::Vec<::prost::alloc::vec::Vec<u8>>,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct LightBlock {
+}
diff --git a/graph/src/firehose/sf.firehose.v1.rs b/graph/src/firehose/sf.firehose.v1.rs
new file mode 100644
index 0000000..d57c793
--- /dev/null
+++ b/graph/src/firehose/sf.firehose.v1.rs
@@ -0,0 +1,332 @@
+/// For historical segments, forks are not passed
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct Request {
+    /// Controls where the stream of blocks will start.
+    ///
+    /// The stream will start **inclusively** at the requested block num.
+    ///
+    /// When not provided, starts at first streamable block of the chain. Not all
+    /// chain starts at the same block number, so you might get an higher block than
+    /// requested when using default value of 0.
+    ///
+    /// Can be negative, will be resolved relative to the chain head block, assuming
+    /// a chain at head block #100, then using `-50` as the value will start at block
+    /// #50. If it resolves before first streamable block of chain, we assume start
+    /// of chain.
+    ///
+    /// If `start_cursor` is passed, this value is ignored and the stream instead starts
+    /// immediately after the Block pointed by the opaque `start_cursor` value.
+    #[prost(int64, tag="1")]
+    pub start_block_num: i64,
+    /// Controls where the stream of blocks will start which will be immediately after
+    /// the Block pointed by this opaque cursor.
+    ///
+    /// Obtain this value from a previously received from `Response.cursor`.
+    ///
+    /// This value takes precedence over `start_block_num`.
+    #[prost(string, tag="13")]
+    pub start_cursor: ::prost::alloc::string::String,
+    /// When non-zero, controls where the stream of blocks will stop.
+    ///
+    /// The stream will close **after** that block has passed so the boundary is
+    /// **inclusive**.
+    #[prost(uint64, tag="5")]
+    pub stop_block_num: u64,
+    /// Filter the steps you want to see. If not specified, defaults to all steps.
+    ///
+    /// Most common steps will be \[STEP_IRREVERSIBLE\], or [STEP_NEW, STEP_UNDO, STEP_IRREVERSIBLE].
+    #[prost(enumeration="ForkStep", repeated, tag="8")]
+    pub fork_steps: ::prost::alloc::vec::Vec<i32>,
+    /// The CEL filter expression used to include transactions, specific to the target protocol,
+    /// works in combination with `exclude_filter_expr` value.
+    #[prost(string, tag="10")]
+    pub include_filter_expr: ::prost::alloc::string::String,
+    /// The CEL filter expression used to exclude transactions, specific to the target protocol, works
+    /// in combination with `include_filter_expr` value.
+    #[prost(string, tag="11")]
+    pub exclude_filter_expr: ::prost::alloc::string::String,
+    ///- EOS "handoffs:3"
+    ///- EOS "lib"
+    ///- EOS "confirms:3"
+    ///- ETH "confirms:200"
+    ///- ETH "confirms:7"
+    ///- SOL "commmitement:finalized"
+    ///- SOL "confirms:200"
+    #[prost(string, tag="17")]
+    pub irreversibility_condition: ::prost::alloc::string::String,
+    #[prost(message, repeated, tag="18")]
+    pub transforms: ::prost::alloc::vec::Vec<::prost_types::Any>,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct Response {
+    /// Chain specific block payload, one of:
+    /// - sf.eosio.codec.v1.Block
+    /// - sf.ethereum.codec.v1.Block
+    /// - sf.near.codec.v1.Block
+    /// - sf.solana.codec.v1.Block
+    #[prost(message, optional, tag="1")]
+    pub block: ::core::option::Option<::prost_types::Any>,
+    #[prost(enumeration="ForkStep", tag="6")]
+    pub step: i32,
+    #[prost(string, tag="10")]
+    pub cursor: ::prost::alloc::string::String,
+}
+#[derive(Clone, Copy, Debug, PartialEq, Eq, Hash, PartialOrd, Ord, ::prost::Enumeration)]
+#[repr(i32)]
+pub enum ForkStep {
+    StepUnknown = 0,
+    /// Block is new head block of the chain, that is linear with the previous block
+    StepNew = 1,
+    /// Block is now forked and should be undone, it's not the head block of the chain anymore
+    StepUndo = 2,
+    /// Block is now irreversible and can be committed to (finality is chain specific, see chain documentation for more details)
+    StepIrreversible = 4,
+}
+/// TODO: move to ethereum specific transforms
+#[derive(Clone, Copy, Debug, PartialEq, Eq, Hash, PartialOrd, Ord, ::prost::Enumeration)]
+#[repr(i32)]
+pub enum BlockDetails {
+    Full = 0,
+    Light = 1,
+}
+/// Generated client implementations.
+pub mod stream_client {
+    #![allow(unused_variables, dead_code, missing_docs, clippy::let_unit_value)]
+    use tonic::codegen::*;
+    #[derive(Debug, Clone)]
+    pub struct StreamClient<T> {
+        inner: tonic::client::Grpc<T>,
+    }
+    impl StreamClient<tonic::transport::Channel> {
+        /// Attempt to create a new client by connecting to a given endpoint.
+        pub async fn connect<D>(dst: D) -> Result<Self, tonic::transport::Error>
+        where
+            D: std::convert::TryInto<tonic::transport::Endpoint>,
+            D::Error: Into<StdError>,
+        {
+            let conn = tonic::transport::Endpoint::new(dst)?.connect().await?;
+            Ok(Self::new(conn))
+        }
+    }
+    impl<T> StreamClient<T>
+    where
+        T: tonic::client::GrpcService<tonic::body::BoxBody>,
+        T::Error: Into<StdError>,
+        T::ResponseBody: Body<Data = Bytes> + Send + 'static,
+        <T::ResponseBody as Body>::Error: Into<StdError> + Send,
+    {
+        pub fn new(inner: T) -> Self {
+            let inner = tonic::client::Grpc::new(inner);
+            Self { inner }
+        }
+        pub fn with_interceptor<F>(
+            inner: T,
+            interceptor: F,
+        ) -> StreamClient<InterceptedService<T, F>>
+        where
+            F: tonic::service::Interceptor,
+            T::ResponseBody: Default,
+            T: tonic::codegen::Service<
+                http::Request<tonic::body::BoxBody>,
+                Response = http::Response<
+                    <T as tonic::client::GrpcService<tonic::body::BoxBody>>::ResponseBody,
+                >,
+            >,
+            <T as tonic::codegen::Service<
+                http::Request<tonic::body::BoxBody>,
+            >>::Error: Into<StdError> + Send + Sync,
+        {
+            StreamClient::new(InterceptedService::new(inner, interceptor))
+        }
+        /// Compress requests with `gzip`.
+        ///
+        /// This requires the server to support it otherwise it might respond with an
+        /// error.
+        #[must_use]
+        pub fn send_gzip(mut self) -> Self {
+            self.inner = self.inner.send_gzip();
+            self
+        }
+        /// Enable decompressing responses with `gzip`.
+        #[must_use]
+        pub fn accept_gzip(mut self) -> Self {
+            self.inner = self.inner.accept_gzip();
+            self
+        }
+        pub async fn blocks(
+            &mut self,
+            request: impl tonic::IntoRequest<super::Request>,
+        ) -> Result<
+                tonic::Response<tonic::codec::Streaming<super::Response>>,
+                tonic::Status,
+            > {
+            self.inner
+                .ready()
+                .await
+                .map_err(|e| {
+                    tonic::Status::new(
+                        tonic::Code::Unknown,
+                        format!("Service was not ready: {}", e.into()),
+                    )
+                })?;
+            let codec = tonic::codec::ProstCodec::default();
+            let path = http::uri::PathAndQuery::from_static(
+                "/sf.firehose.v1.Stream/Blocks",
+            );
+            self.inner.server_streaming(request.into_request(), path, codec).await
+        }
+    }
+}
+/// Generated server implementations.
+pub mod stream_server {
+    #![allow(unused_variables, dead_code, missing_docs, clippy::let_unit_value)]
+    use tonic::codegen::*;
+    ///Generated trait containing gRPC methods that should be implemented for use with StreamServer.
+    #[async_trait]
+    pub trait Stream: Send + Sync + 'static {
+        ///Server streaming response type for the Blocks method.
+        type BlocksStream: futures_core::Stream<
+                Item = Result<super::Response, tonic::Status>,
+            >
+            + Send
+            + 'static;
+        async fn blocks(
+            &self,
+            request: tonic::Request<super::Request>,
+        ) -> Result<tonic::Response<Self::BlocksStream>, tonic::Status>;
+    }
+    #[derive(Debug)]
+    pub struct StreamServer<T: Stream> {
+        inner: _Inner<T>,
+        accept_compression_encodings: EnabledCompressionEncodings,
+        send_compression_encodings: EnabledCompressionEncodings,
+    }
+    struct _Inner<T>(Arc<T>);
+    impl<T: Stream> StreamServer<T> {
+        pub fn new(inner: T) -> Self {
+            Self::from_arc(Arc::new(inner))
+        }
+        pub fn from_arc(inner: Arc<T>) -> Self {
+            let inner = _Inner(inner);
+            Self {
+                inner,
+                accept_compression_encodings: Default::default(),
+                send_compression_encodings: Default::default(),
+            }
+        }
+        pub fn with_interceptor<F>(
+            inner: T,
+            interceptor: F,
+        ) -> InterceptedService<Self, F>
+        where
+            F: tonic::service::Interceptor,
+        {
+            InterceptedService::new(Self::new(inner), interceptor)
+        }
+        /// Enable decompressing requests with `gzip`.
+        #[must_use]
+        pub fn accept_gzip(mut self) -> Self {
+            self.accept_compression_encodings.enable_gzip();
+            self
+        }
+        /// Compress responses with `gzip`, if the client supports it.
+        #[must_use]
+        pub fn send_gzip(mut self) -> Self {
+            self.send_compression_encodings.enable_gzip();
+            self
+        }
+    }
+    impl<T, B> tonic::codegen::Service<http::Request<B>> for StreamServer<T>
+    where
+        T: Stream,
+        B: Body + Send + 'static,
+        B::Error: Into<StdError> + Send + 'static,
+    {
+        type Response = http::Response<tonic::body::BoxBody>;
+        type Error = std::convert::Infallible;
+        type Future = BoxFuture<Self::Response, Self::Error>;
+        fn poll_ready(
+            &mut self,
+            _cx: &mut Context<'_>,
+        ) -> Poll<Result<(), Self::Error>> {
+            Poll::Ready(Ok(()))
+        }
+        fn call(&mut self, req: http::Request<B>) -> Self::Future {
+            let inner = self.inner.clone();
+            match req.uri().path() {
+                "/sf.firehose.v1.Stream/Blocks" => {
+                    #[allow(non_camel_case_types)]
+                    struct BlocksSvc<T: Stream>(pub Arc<T>);
+                    impl<T: Stream> tonic::server::ServerStreamingService<super::Request>
+                    for BlocksSvc<T> {
+                        type Response = super::Response;
+                        type ResponseStream = T::BlocksStream;
+                        type Future = BoxFuture<
+                            tonic::Response<Self::ResponseStream>,
+                            tonic::Status,
+                        >;
+                        fn call(
+                            &mut self,
+                            request: tonic::Request<super::Request>,
+                        ) -> Self::Future {
+                            let inner = self.0.clone();
+                            let fut = async move { (*inner).blocks(request).await };
+                            Box::pin(fut)
+                        }
+                    }
+                    let accept_compression_encodings = self.accept_compression_encodings;
+                    let send_compression_encodings = self.send_compression_encodings;
+                    let inner = self.inner.clone();
+                    let fut = async move {
+                        let inner = inner.0;
+                        let method = BlocksSvc(inner);
+                        let codec = tonic::codec::ProstCodec::default();
+                        let mut grpc = tonic::server::Grpc::new(codec)
+                            .apply_compression_config(
+                                accept_compression_encodings,
+                                send_compression_encodings,
+                            );
+                        let res = grpc.server_streaming(method, req).await;
+                        Ok(res)
+                    };
+                    Box::pin(fut)
+                }
+                _ => {
+                    Box::pin(async move {
+                        Ok(
+                            http::Response::builder()
+                                .status(200)
+                                .header("grpc-status", "12")
+                                .header("content-type", "application/grpc")
+                                .body(empty_body())
+                                .unwrap(),
+                        )
+                    })
+                }
+            }
+        }
+    }
+    impl<T: Stream> Clone for StreamServer<T> {
+        fn clone(&self) -> Self {
+            let inner = self.inner.clone();
+            Self {
+                inner,
+                accept_compression_encodings: self.accept_compression_encodings,
+                send_compression_encodings: self.send_compression_encodings,
+            }
+        }
+    }
+    impl<T: Stream> Clone for _Inner<T> {
+        fn clone(&self) -> Self {
+            Self(self.0.clone())
+        }
+    }
+    impl<T: std::fmt::Debug> std::fmt::Debug for _Inner<T> {
+        fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
+            write!(f, "{:?}", self.0)
+        }
+    }
+    impl<T: Stream> tonic::transport::NamedService for StreamServer<T> {
+        const NAME: &'static str = "sf.firehose.v1.Stream";
+    }
+}
diff --git a/graph/src/firehose/sf.near.transform.v1.rs b/graph/src/firehose/sf.near.transform.v1.rs
new file mode 100644
index 0000000..86972b6
--- /dev/null
+++ b/graph/src/firehose/sf.near.transform.v1.rs
@@ -0,0 +1,21 @@
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct BasicReceiptFilter {
+    #[prost(string, repeated, tag="1")]
+    pub accounts: ::prost::alloc::vec::Vec<::prost::alloc::string::String>,
+    #[prost(message, repeated, tag="2")]
+    pub prefix_and_suffix_pairs: ::prost::alloc::vec::Vec<PrefixSuffixPair>,
+}
+/// PrefixSuffixPair applies a logical AND to prefix and suffix when both fields are non-empty.
+/// * {prefix="hello",suffix="world"} will match "hello.world" but not "hello.friend"
+/// * {prefix="hello",suffix=""}      will match both "hello.world" and "hello.friend"
+/// * {prefix="",suffix="world"}      will match both "hello.world" and "good.day.world"
+/// * {prefix="",suffix=""}           is invalid
+///
+/// Note that the suffix will usually have a TLD, ex: "mydomain.near" or "mydomain.testnet"
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct PrefixSuffixPair {
+    #[prost(string, tag="1")]
+    pub prefix: ::prost::alloc::string::String,
+    #[prost(string, tag="2")]
+    pub suffix: ::prost::alloc::string::String,
+}
diff --git a/graph/src/ipfs_client.rs b/graph/src/ipfs_client.rs
new file mode 100644
index 0000000..c99d83b
--- /dev/null
+++ b/graph/src/ipfs_client.rs
@@ -0,0 +1,169 @@
+use crate::prelude::CheapClone;
+use anyhow::Error;
+use bytes::Bytes;
+use futures03::Stream;
+use http::header::CONTENT_LENGTH;
+use http::Uri;
+use reqwest::multipart;
+use serde::Deserialize;
+use std::time::Duration;
+use std::{str::FromStr, sync::Arc};
+
+#[derive(Clone, Copy, PartialEq, Eq)]
+pub enum StatApi {
+    Block,
+    Files,
+}
+
+impl StatApi {
+    fn route(&self) -> &'static str {
+        match self {
+            Self::Block => "block",
+            Self::Files => "files",
+        }
+    }
+}
+
+#[derive(Debug, Deserialize)]
+#[serde(rename_all = "PascalCase")]
+struct BlockStatResponse {
+    size: u64,
+}
+
+#[derive(Debug, Deserialize)]
+#[serde(rename_all = "PascalCase")]
+struct FilesStatResponse {
+    cumulative_size: u64,
+}
+
+#[derive(Debug, Deserialize)]
+#[serde(rename_all = "PascalCase")]
+pub struct AddResponse {
+    pub name: String,
+    pub hash: String,
+    pub size: String,
+}
+
+/// Reference type, clones will share the connection pool.
+#[derive(Clone)]
+pub struct IpfsClient {
+    base: Arc<Uri>,
+    client: Arc<reqwest::Client>,
+}
+
+impl CheapClone for IpfsClient {
+    fn cheap_clone(&self) -> Self {
+        IpfsClient {
+            base: self.base.cheap_clone(),
+            client: self.client.cheap_clone(),
+        }
+    }
+}
+
+impl IpfsClient {
+    pub fn new(base: &str) -> Result<Self, Error> {
+        Ok(IpfsClient {
+            client: Arc::new(reqwest::Client::new()),
+            base: Arc::new(Uri::from_str(base)?),
+        })
+    }
+
+    pub fn localhost() -> Self {
+        IpfsClient {
+            client: Arc::new(reqwest::Client::new()),
+            base: Arc::new(Uri::from_str("http://localhost:5001").unwrap()),
+        }
+    }
+
+    /// Calls stat for the given API route, and returns the total size of the object.
+    pub async fn stat_size(
+        &self,
+        api: StatApi,
+        mut cid: String,
+        timeout: Duration,
+    ) -> Result<u64, reqwest::Error> {
+        let route = format!("{}/stat", api.route());
+        if api == StatApi::Files {
+            // files/stat requires a leading `/ipfs/`.
+            cid = format!("/ipfs/{}", cid);
+        }
+        let url = self.url(&route, &cid);
+        let res = self.call(url, None, Some(timeout)).await?;
+        match api {
+            StatApi::Files => Ok(res.json::<FilesStatResponse>().await?.cumulative_size),
+            StatApi::Block => Ok(res.json::<BlockStatResponse>().await?.size),
+        }
+    }
+
+    /// Download the entire contents.
+    pub async fn cat_all(&self, cid: &str, timeout: Duration) -> Result<Bytes, reqwest::Error> {
+        self.call(self.url("cat", cid), None, Some(timeout))
+            .await?
+            .bytes()
+            .await
+    }
+
+    pub async fn cat(
+        &self,
+        cid: &str,
+        timeout: Option<Duration>,
+    ) -> Result<impl Stream<Item = Result<Bytes, reqwest::Error>>, reqwest::Error> {
+        Ok(self
+            .call(self.url("cat", cid), None, timeout)
+            .await?
+            .bytes_stream())
+    }
+
+    pub async fn get_block(&self, cid: String) -> Result<Bytes, reqwest::Error> {
+        let form = multipart::Form::new().part("arg", multipart::Part::text(cid));
+        self.call(format!("{}api/v0/block/get", self.base), Some(form), None)
+            .await?
+            .bytes()
+            .await
+    }
+
+    pub async fn test(&self) -> Result<(), reqwest::Error> {
+        self.call(format!("{}api/v0/version", self.base), None, None)
+            .await
+            .map(|_| ())
+    }
+
+    pub async fn add(&self, data: Vec<u8>) -> Result<AddResponse, reqwest::Error> {
+        let form = multipart::Form::new().part("path", multipart::Part::bytes(data));
+
+        self.call(format!("{}api/v0/add", self.base), Some(form), None)
+            .await?
+            .json()
+            .await
+    }
+
+    fn url(&self, route: &str, arg: &str) -> String {
+        // URL security: We control the base and the route, user-supplied input goes only into the
+        // query parameters.
+        format!("{}api/v0/{}?arg={}", self.base, route, arg)
+    }
+
+    async fn call(
+        &self,
+        url: String,
+        form: Option<multipart::Form>,
+        timeout: Option<Duration>,
+    ) -> Result<reqwest::Response, reqwest::Error> {
+        let mut req = self.client.post(&url);
+        if let Some(form) = form {
+            req = req.multipart(form);
+        } else {
+            // Some servers require `content-length` even for an empty body.
+            req = req.header(CONTENT_LENGTH, 0);
+        }
+
+        if let Some(timeout) = timeout {
+            req = req.timeout(timeout)
+        }
+
+        req.send()
+            .await
+            .map(|res| res.error_for_status())
+            .and_then(|x| x)
+    }
+}
diff --git a/graph/src/lib.rs b/graph/src/lib.rs
new file mode 100644
index 0000000..553f134
--- /dev/null
+++ b/graph/src/lib.rs
@@ -0,0 +1,207 @@
+/// Traits and types for all system components.
+pub mod components;
+
+/// Common data types used throughout The Graph.
+pub mod data;
+
+/// Utilities.
+pub mod util;
+
+/// Extension traits for external types.
+pub mod ext;
+
+/// Logging utilities
+pub mod log;
+
+/// `CheapClone` trait.
+pub mod cheap_clone;
+
+pub mod ipfs_client;
+
+pub mod data_source;
+
+pub mod blockchain;
+
+pub mod runtime;
+
+pub mod firehose;
+
+pub mod substreams;
+
+/// Helpers for parsing environment variables.
+pub mod env;
+
+/// Wrapper for spawning tasks that abort on panic, which is our default.
+mod task_spawn;
+pub use task_spawn::{
+    block_on, spawn, spawn_allow_panic, spawn_blocking, spawn_blocking_allow_panic, spawn_thread,
+};
+
+pub use anyhow;
+pub use bytes;
+pub use itertools;
+pub use parking_lot;
+pub use petgraph;
+pub use prometheus;
+pub use semver;
+pub use slog;
+pub use stable_hash_legacy;
+pub use tokio;
+pub use tokio_stream;
+pub use url;
+
+/// A prelude that makes all system component traits and data types available.
+///
+/// Add the following code to import all traits and data types listed below at once.
+///
+/// ```
+/// use graph::prelude::*;
+/// ```
+pub mod prelude {
+    pub use super::entity;
+    pub use ::anyhow;
+    pub use anyhow::{anyhow, Context as _, Error};
+    pub use async_trait::async_trait;
+    pub use bigdecimal;
+    pub use chrono;
+    pub use envconfig;
+    pub use ethabi;
+    pub use futures::future;
+    pub use futures::prelude::*;
+    pub use futures::stream;
+    pub use futures03;
+    pub use futures03::compat::{Future01CompatExt, Sink01CompatExt, Stream01CompatExt};
+    pub use futures03::future::{FutureExt as _, TryFutureExt};
+    pub use futures03::sink::SinkExt as _;
+    pub use futures03::stream::{StreamExt as _, TryStreamExt};
+    pub use hex;
+    pub use lazy_static::lazy_static;
+    pub use prost;
+    pub use rand;
+    pub use reqwest;
+    pub use serde;
+    pub use serde_derive::{Deserialize, Serialize};
+    pub use serde_json;
+    pub use serde_yaml;
+    pub use slog::{self, crit, debug, error, info, o, trace, warn, Logger};
+    pub use std::convert::TryFrom;
+    pub use std::fmt::Debug;
+    pub use std::iter::FromIterator;
+    pub use std::pin::Pin;
+    pub use std::sync::Arc;
+    pub use std::time::Duration;
+    pub use thiserror;
+    pub use tiny_keccak;
+    pub use tokio;
+    pub use tonic;
+    pub use web3;
+
+    pub type DynTryFuture<'a, Ok = (), Err = Error> =
+        Pin<Box<dyn futures03::Future<Output = Result<Ok, Err>> + Send + 'a>>;
+
+    pub use crate::blockchain::{BlockHash, BlockPtr};
+
+    pub use crate::components::ethereum::{
+        EthereumBlock, EthereumBlockWithCalls, EthereumCall, LightEthereumBlock,
+        LightEthereumBlockExt,
+    };
+    pub use crate::components::graphql::{
+        GraphQLMetrics, GraphQlRunner, QueryLoadManager, SubscriptionResultFuture,
+    };
+    pub use crate::components::link_resolver::{JsonStreamValue, JsonValueStream, LinkResolver};
+    pub use crate::components::metrics::{
+        aggregate::Aggregate, stopwatch::StopwatchMetrics, subgraph::*, Collector, Counter,
+        CounterVec, Gauge, GaugeVec, Histogram, HistogramOpts, HistogramVec, MetricsRegistry, Opts,
+        PrometheusError, Registry,
+    };
+    pub use crate::components::server::index_node::IndexNodeServer;
+    pub use crate::components::server::metrics::MetricsServer;
+    pub use crate::components::server::query::GraphQLServer;
+    pub use crate::components::server::subscription::SubscriptionServer;
+    pub use crate::components::store::{
+        AttributeNames, BlockNumber, CachedEthereumCall, ChainStore, Child, ChildMultiplicity,
+        EntityCache, EntityChange, EntityChangeOperation, EntityCollection, EntityFilter,
+        EntityLink, EntityModification, EntityOperation, EntityOrder, EntityQuery, EntityRange,
+        EntityWindow, EthereumCallCache, ParentLink, PartialBlockPtr, PoolWaitStats, QueryStore,
+        QueryStoreManager, StoreError, StoreEvent, StoreEventStream, StoreEventStreamBox,
+        SubgraphStore, UnfailOutcome, WindowAttribute, BLOCK_NUMBER_MAX,
+    };
+    pub use crate::components::subgraph::{
+        BlockState, DataSourceTemplateInfo, HostMetrics, RuntimeHost, RuntimeHostBuilder,
+        SubgraphAssignmentProvider, SubgraphInstanceManager, SubgraphRegistrar,
+        SubgraphVersionSwitchingMode,
+    };
+    pub use crate::components::trigger_processor::TriggerProcessor;
+    pub use crate::components::versions::{ApiVersion, FeatureFlag};
+    pub use crate::components::{transaction_receipt, EventConsumer, EventProducer};
+    pub use crate::env::ENV_VARS;
+
+    pub use crate::cheap_clone::CheapClone;
+    pub use crate::data::graphql::{
+        shape_hash::shape_hash, SerializableValue, TryFromValue, ValueMap,
+    };
+    pub use crate::data::query::{
+        Query, QueryError, QueryExecutionError, QueryResult, QueryTarget, QueryVariables,
+    };
+    pub use crate::data::schema::{ApiSchema, Schema};
+    pub use crate::data::store::ethereum::*;
+    pub use crate::data::store::scalar::{BigDecimal, BigInt, BigIntSign};
+    pub use crate::data::store::{
+        AssignmentEvent, Attribute, Entity, NodeId, SubscriptionFilter, TryIntoEntity, Value,
+        ValueType,
+    };
+    pub use crate::data::subgraph::schema::SubgraphDeploymentEntity;
+    pub use crate::data::subgraph::{
+        CreateSubgraphResult, DataSourceContext, DeploymentHash, DeploymentState, Link,
+        SubgraphAssignmentProviderError, SubgraphManifest, SubgraphManifestResolveError,
+        SubgraphManifestValidationError, SubgraphName, SubgraphRegistrarError,
+        UnvalidatedSubgraphManifest,
+    };
+    pub use crate::data::subscription::{
+        QueryResultStream, Subscription, SubscriptionError, SubscriptionResult,
+    };
+    pub use crate::ext::futures::{
+        CancelGuard, CancelHandle, CancelToken, CancelableError, FutureExtension,
+        SharedCancelGuard, StreamExtension,
+    };
+    pub use crate::impl_slog_value;
+    pub use crate::log::codes::LogCode;
+    pub use crate::log::elastic::{elastic_logger, ElasticDrainConfig, ElasticLoggingConfig};
+    pub use crate::log::factory::{
+        ComponentLoggerConfig, ElasticComponentLoggerConfig, LoggerFactory,
+    };
+    pub use crate::log::split::split_logger;
+    pub use crate::util::cache_weight::CacheWeight;
+    pub use crate::util::futures::{retry, TimeoutError};
+    pub use crate::util::stats::MovingStats;
+
+    macro_rules! static_graphql {
+        ($m:ident, $m2:ident, {$($n:ident,)*}) => {
+            pub mod $m {
+                use graphql_parser::$m2 as $m;
+                pub use $m::*;
+                $(
+                    pub type $n = $m::$n<'static, String>;
+                )*
+            }
+        };
+    }
+
+    // Static graphql mods. These are to be phased out, with a preference
+    // toward making graphql generic over text. This helps to ease the
+    // transition by providing the old graphql-parse 0.2.x API
+    static_graphql!(q, query, {
+        Document, Value, OperationDefinition, InlineFragment, TypeCondition,
+        FragmentSpread, Field, Selection, SelectionSet, FragmentDefinition,
+        Directive, VariableDefinition, Type, Query,
+    });
+    static_graphql!(s, schema, {
+        Field, Directive, InterfaceType, ObjectType, Value, TypeDefinition,
+        EnumType, Type, Document, ScalarType, InputValue, DirectiveDefinition,
+        UnionType, InputObjectType, EnumValue,
+    });
+
+    pub mod r {
+        pub use crate::data::value::Value;
+    }
+}
diff --git a/graph/src/log/codes.rs b/graph/src/log/codes.rs
new file mode 100644
index 0000000..b12d52c
--- /dev/null
+++ b/graph/src/log/codes.rs
@@ -0,0 +1,30 @@
+use std::fmt::{Display, Error, Formatter};
+
+pub enum LogCode {
+    SubgraphStartFailure,
+    SubgraphSyncingFailure,
+    SubgraphSyncingFailureNotRecorded,
+    BlockIngestionStatus,
+    BlockIngestionLagging,
+    GraphQlQuerySuccess,
+    GraphQlQueryFailure,
+    TokioContention,
+}
+
+impl Display for LogCode {
+    fn fmt(&self, f: &mut Formatter) -> Result<(), Error> {
+        let value = match self {
+            LogCode::SubgraphStartFailure => "SubgraphStartFailure",
+            LogCode::SubgraphSyncingFailure => "SubgraphSyncingFailure",
+            LogCode::SubgraphSyncingFailureNotRecorded => "SubgraphSyncingFailureNotRecorded",
+            LogCode::BlockIngestionStatus => "BlockIngestionStatus",
+            LogCode::BlockIngestionLagging => "BlockIngestionLagging",
+            LogCode::GraphQlQuerySuccess => "GraphQLQuerySuccess",
+            LogCode::GraphQlQueryFailure => "GraphQLQueryFailure",
+            LogCode::TokioContention => "TokioContention",
+        };
+        write!(f, "{}", value)
+    }
+}
+
+impl_slog_value!(LogCode, "{}");
diff --git a/graph/src/log/elastic.rs b/graph/src/log/elastic.rs
new file mode 100644
index 0000000..1a6294b
--- /dev/null
+++ b/graph/src/log/elastic.rs
@@ -0,0 +1,390 @@
+use std::collections::HashMap;
+use std::fmt;
+use std::fmt::Write;
+use std::result::Result;
+use std::sync::{Arc, Mutex};
+use std::time::Duration;
+
+use chrono::prelude::{SecondsFormat, Utc};
+use futures03::TryFutureExt;
+use http::header::CONTENT_TYPE;
+use reqwest;
+use reqwest::Client;
+use serde::ser::Serializer as SerdeSerializer;
+use serde::Serialize;
+use serde_json::json;
+use slog::*;
+use slog_async;
+
+use crate::util::futures::retry;
+
+/// General configuration parameters for Elasticsearch logging.
+#[derive(Clone, Debug)]
+pub struct ElasticLoggingConfig {
+    /// The Elasticsearch service to log to.
+    pub endpoint: String,
+    /// The Elasticsearch username.
+    pub username: Option<String>,
+    /// The Elasticsearch password (optional).
+    pub password: Option<String>,
+    /// A client to serve as a connection pool to the endpoint.
+    pub client: Client,
+}
+
+/// Serializes an slog log level using a serde Serializer.
+fn serialize_log_level<S>(level: &Level, serializer: S) -> Result<S::Ok, S::Error>
+where
+    S: SerdeSerializer,
+{
+    serializer.serialize_str(match level {
+        Level::Critical => "critical",
+        Level::Error => "error",
+        Level::Warning => "warning",
+        Level::Info => "info",
+        Level::Debug => "debug",
+        Level::Trace => "trace",
+    })
+}
+
+// Log message meta data.
+#[derive(Clone, Debug, Serialize)]
+#[serde(rename_all = "camelCase")]
+struct ElasticLogMeta {
+    module: String,
+    line: i64,
+    column: i64,
+}
+
+// Log message to be written to Elasticsearch.
+#[derive(Clone, Debug, Serialize)]
+#[serde(rename_all = "camelCase")]
+struct ElasticLog {
+    id: String,
+    #[serde(flatten)]
+    custom_id: HashMap<String, String>,
+    arguments: HashMap<String, String>,
+    timestamp: String,
+    text: String,
+    #[serde(serialize_with = "serialize_log_level")]
+    level: Level,
+    meta: ElasticLogMeta,
+}
+
+struct HashMapKVSerializer {
+    kvs: Vec<(String, String)>,
+}
+
+impl HashMapKVSerializer {
+    fn new() -> Self {
+        HashMapKVSerializer {
+            kvs: Default::default(),
+        }
+    }
+
+    fn finish(self) -> HashMap<String, String> {
+        let mut map = HashMap::new();
+        self.kvs.into_iter().for_each(|(k, v)| {
+            map.insert(k, v);
+        });
+        map
+    }
+}
+
+impl Serializer for HashMapKVSerializer {
+    fn emit_arguments(&mut self, key: Key, val: &fmt::Arguments) -> slog::Result {
+        Ok(self.kvs.push((key.into(), format!("{}", val))))
+    }
+}
+
+/// A super-simple slog Serializer for concatenating key/value arguments.
+struct SimpleKVSerializer {
+    kvs: Vec<(String, String)>,
+}
+
+impl SimpleKVSerializer {
+    /// Creates a new `SimpleKVSerializer`.
+    fn new() -> Self {
+        SimpleKVSerializer {
+            kvs: Default::default(),
+        }
+    }
+
+    /// Collects all key/value arguments into a single, comma-separated string.
+    /// Returns the number of key/value pairs and the string itself.
+    fn finish(self) -> (usize, String) {
+        (
+            self.kvs.len(),
+            self.kvs
+                .iter()
+                .map(|(k, v)| format!("{}: {}", k, v))
+                .collect::<Vec<_>>()
+                .join(", "),
+        )
+    }
+}
+
+impl Serializer for SimpleKVSerializer {
+    fn emit_arguments(&mut self, key: Key, val: &fmt::Arguments) -> slog::Result {
+        Ok(self.kvs.push((key.into(), format!("{}", val))))
+    }
+}
+
+/// Configuration for `ElasticDrain`.
+#[derive(Clone, Debug)]
+pub struct ElasticDrainConfig {
+    /// General Elasticsearch logging configuration.
+    pub general: ElasticLoggingConfig,
+    /// The Elasticsearch index to log to.
+    pub index: String,
+    /// The Elasticsearch type to use for logs.
+    pub document_type: String,
+    /// The name of the custom object id that the drain is for.
+    pub custom_id_key: String,
+    /// The custom id for the object that the drain is for.
+    pub custom_id_value: String,
+    /// The batching interval.
+    pub flush_interval: Duration,
+    /// Maximum retries in case of error.
+    pub max_retries: usize,
+}
+
+/// An slog `Drain` for logging to Elasticsearch.
+///
+/// Writes logs to Elasticsearch using the following format:
+/// ```ignore
+/// {
+///   "_index": "subgraph-logs"
+///   "_type": "log",
+///   "_id": "Qmb31zcpzqga7ERaUTp83gVdYcuBasz4rXUHFufikFTJGU-2018-11-08T00:54:52.589258000Z",
+///   "_source": {
+///     "level": "debug",
+///     "timestamp": "2018-11-08T00:54:52.589258000Z",
+///     "subgraphId": "Qmb31zcpzqga7ERaUTp83gVdYcuBasz4rXUHFufikFTJGU",
+///     "meta": {
+///       "module": "graph_chain_ethereum::block_stream",
+///       "line": 220,
+///       "column": 9
+///     },
+///     "text": "Chain head pointer, number: 6661038, hash: 0xf089c457700a57798ced06bd3f18eef53bb8b46510bcefaf13615a8a26e4424a, component: BlockStream",
+///     "id": "Qmb31zcpzqga7ERaUTp83gVdYcuBasz4rXUHFufikFTJGU-2018-11-08T00:54:52.589258000Z"
+///   }
+/// }
+/// ```
+pub struct ElasticDrain {
+    config: ElasticDrainConfig,
+    error_logger: Logger,
+    logs: Arc<Mutex<Vec<ElasticLog>>>,
+}
+
+impl ElasticDrain {
+    /// Creates a new `ElasticDrain`.
+    pub fn new(config: ElasticDrainConfig, error_logger: Logger) -> Self {
+        let drain = ElasticDrain {
+            config,
+            error_logger,
+            logs: Arc::new(Mutex::new(vec![])),
+        };
+        drain.periodically_flush_logs();
+        drain
+    }
+
+    fn periodically_flush_logs(&self) {
+        let flush_logger = self.error_logger.clone();
+        let logs = self.logs.clone();
+        let config = self.config.clone();
+        let mut interval = tokio::time::interval(self.config.flush_interval);
+        let max_retries = self.config.max_retries;
+
+        crate::task_spawn::spawn(async move {
+            loop {
+                interval.tick().await;
+
+                let logs = logs.clone();
+                let config = config.clone();
+                let flush_logger = flush_logger.clone();
+                let logs_to_send = {
+                    let mut logs = logs.lock().unwrap();
+                    let logs_to_send = (*logs).clone();
+                    // Clear the logs, so the next batch can be recorded
+                    logs.clear();
+                    logs_to_send
+                };
+
+                // Do nothing if there are no logs to flush
+                if logs_to_send.is_empty() {
+                    continue;
+                }
+
+                debug!(
+                    flush_logger,
+                    "Flushing {} logs to Elasticsearch",
+                    logs_to_send.len()
+                );
+
+                // The Elasticsearch batch API takes requests with the following format:
+                // ```ignore
+                // action_and_meta_data\n
+                // optional_source\n
+                // action_and_meta_data\n
+                // optional_source\n
+                // ```
+                // For more details, see:
+                // https://www.elastic.co/guide/en/elasticsearch/reference/current/docs-bulk.html
+                //
+                // We're assembly the request body in the same way below:
+                let batch_body = logs_to_send.iter().fold(String::from(""), |mut out, log| {
+                    // Try to serialize the log itself to a JSON string
+                    match serde_json::to_string(log) {
+                        Ok(log_line) => {
+                            // Serialize the action line to a string
+                            let action_line = json!({
+                                "index": {
+                                    "_index": config.index,
+                                    "_type": config.document_type,
+                                    "_id": log.id,
+                                }
+                            })
+                            .to_string();
+
+                            // Combine the two lines with newlines, make sure there is
+                            // a newline at the end as well
+                            out.push_str(format!("{}\n{}\n", action_line, log_line).as_str());
+                        }
+                        Err(e) => {
+                            error!(
+                                flush_logger,
+                                "Failed to serialize Elasticsearch log to JSON: {}", e
+                            );
+                        }
+                    };
+
+                    out
+                });
+
+                // Build the batch API URL
+                let mut batch_url = reqwest::Url::parse(config.general.endpoint.as_str())
+                    .expect("invalid Elasticsearch URL");
+                batch_url.set_path("_bulk");
+
+                // Send batch of logs to Elasticsearch
+                let header = match config.general.username {
+                    Some(username) => config
+                        .general
+                        .client
+                        .post(batch_url)
+                        .header(CONTENT_TYPE, "application/json")
+                        .basic_auth(username, config.general.password.clone()),
+                    None => config
+                        .general
+                        .client
+                        .post(batch_url)
+                        .header(CONTENT_TYPE, "application/json"),
+                };
+
+                retry("send logs to elasticsearch", &flush_logger)
+                    .limit(max_retries)
+                    .timeout_secs(30)
+                    .run(move || {
+                        header
+                            .try_clone()
+                            .unwrap() // Unwrap: Request body not yet set
+                            .body(batch_body.clone())
+                            .send()
+                            .and_then(|response| async { response.error_for_status() })
+                            .map_ok(|_| ())
+                    })
+                    .await
+                    .unwrap_or_else(|e| {
+                        // Log if there was a problem sending the logs
+                        error!(flush_logger, "Failed to send logs to Elasticsearch: {}", e);
+                    })
+            }
+        });
+    }
+}
+
+impl Drain for ElasticDrain {
+    type Ok = ();
+    type Err = ();
+
+    fn log(&self, record: &Record, values: &OwnedKVList) -> Result<Self::Ok, Self::Err> {
+        // Don't sent `trace` logs to ElasticSearch.
+        if record.level() == Level::Trace {
+            return Ok(());
+        }
+        let timestamp = Utc::now().to_rfc3339_opts(SecondsFormat::Nanos, true);
+        let id = format!("{}-{}", self.config.custom_id_value, timestamp);
+
+        // Serialize logger arguments
+        let mut serializer = SimpleKVSerializer::new();
+        record
+            .kv()
+            .serialize(record, &mut serializer)
+            .expect("failed to serializer logger arguments");
+        let (n_logger_kvs, logger_kvs) = serializer.finish();
+
+        // Serialize log message arguments
+        let mut serializer = SimpleKVSerializer::new();
+        values
+            .serialize(record, &mut serializer)
+            .expect("failed to serialize log message arguments");
+        let (n_value_kvs, value_kvs) = serializer.finish();
+
+        // Serialize log message arguments into hash map
+        let mut serializer = HashMapKVSerializer::new();
+        record
+            .kv()
+            .serialize(record, &mut serializer)
+            .expect("failed to serialize log message arguments into hash map");
+        let arguments = serializer.finish();
+
+        let mut text = format!("{}", record.msg());
+        if n_logger_kvs > 0 {
+            write!(text, ", {}", logger_kvs).unwrap();
+        }
+        if n_value_kvs > 0 {
+            write!(text, ", {}", value_kvs).unwrap();
+        }
+
+        // Prepare custom id for log document
+        let mut custom_id = HashMap::new();
+        custom_id.insert(
+            self.config.custom_id_key.clone(),
+            self.config.custom_id_value.clone(),
+        );
+
+        // Prepare log document
+        let log = ElasticLog {
+            id,
+            custom_id,
+            arguments,
+            timestamp,
+            text,
+            level: record.level(),
+            meta: ElasticLogMeta {
+                module: record.module().into(),
+                line: record.line() as i64,
+                column: record.column() as i64,
+            },
+        };
+
+        // Push the log into the queue
+        let mut logs = self.logs.lock().unwrap();
+        logs.push(log);
+
+        Ok(())
+    }
+}
+
+/// Creates a new asynchronous Elasticsearch logger.
+///
+/// Uses `error_logger` to print any Elasticsearch logging errors,
+/// so they don't go unnoticed.
+pub fn elastic_logger(config: ElasticDrainConfig, error_logger: Logger) -> Logger {
+    let elastic_drain = ElasticDrain::new(config, error_logger).fuse();
+    let async_drain = slog_async::Async::new(elastic_drain)
+        .chan_size(20000)
+        .build()
+        .fuse();
+    Logger::root(async_drain, o!())
+}
diff --git a/graph/src/log/factory.rs b/graph/src/log/factory.rs
new file mode 100644
index 0000000..8565c56
--- /dev/null
+++ b/graph/src/log/factory.rs
@@ -0,0 +1,106 @@
+use slog::*;
+
+use crate::components::store::DeploymentLocator;
+use crate::log::elastic::*;
+use crate::log::split::*;
+use crate::prelude::ENV_VARS;
+
+/// Configuration for component-specific logging to Elasticsearch.
+pub struct ElasticComponentLoggerConfig {
+    pub index: String,
+}
+
+/// Configuration for component-specific logging.
+pub struct ComponentLoggerConfig {
+    pub elastic: Option<ElasticComponentLoggerConfig>,
+}
+
+/// Factory for creating component and subgraph loggers.
+#[derive(Clone)]
+pub struct LoggerFactory {
+    parent: Logger,
+    elastic_config: Option<ElasticLoggingConfig>,
+}
+
+impl LoggerFactory {
+    /// Creates a new factory using a parent logger and optional Elasticsearch configuration.
+    pub fn new(logger: Logger, elastic_config: Option<ElasticLoggingConfig>) -> Self {
+        Self {
+            parent: logger,
+            elastic_config,
+        }
+    }
+
+    /// Creates a new factory with a new parent logger.
+    pub fn with_parent(&self, parent: Logger) -> Self {
+        Self {
+            parent,
+            elastic_config: self.elastic_config.clone(),
+        }
+    }
+
+    /// Creates a component-specific logger with optional Elasticsearch support.
+    pub fn component_logger(
+        &self,
+        component: &str,
+        config: Option<ComponentLoggerConfig>,
+    ) -> Logger {
+        let term_logger = self.parent.new(o!("component" => component.to_string()));
+
+        match config {
+            None => term_logger,
+            Some(config) => match config.elastic {
+                None => term_logger,
+                Some(config) => self
+                    .elastic_config
+                    .clone()
+                    .map(|elastic_config| {
+                        split_logger(
+                            term_logger.clone(),
+                            elastic_logger(
+                                ElasticDrainConfig {
+                                    general: elastic_config,
+                                    index: config.index,
+                                    document_type: String::from("log"),
+                                    custom_id_key: String::from("componentId"),
+                                    custom_id_value: component.to_string(),
+                                    flush_interval: ENV_VARS.elastic_search_flush_interval,
+                                    max_retries: ENV_VARS.elastic_search_max_retries,
+                                },
+                                term_logger.clone(),
+                            ),
+                        )
+                    })
+                    .unwrap_or(term_logger),
+            },
+        }
+    }
+
+    /// Creates a subgraph logger with Elasticsearch support.
+    pub fn subgraph_logger(&self, loc: &DeploymentLocator) -> Logger {
+        let term_logger = self
+            .parent
+            .new(o!("subgraph_id" => loc.hash.to_string(), "sgd" => loc.id.to_string()));
+
+        self.elastic_config
+            .clone()
+            .map(|elastic_config| {
+                split_logger(
+                    term_logger.clone(),
+                    elastic_logger(
+                        ElasticDrainConfig {
+                            general: elastic_config,
+                            index: String::from("subgraph-logs"),
+                            document_type: String::from("log"),
+                            custom_id_key: String::from("subgraphId"),
+                            custom_id_value: loc.hash.to_string(),
+                            flush_interval: ENV_VARS.elastic_search_flush_interval,
+                            max_retries: ENV_VARS.elastic_search_max_retries,
+                        },
+                        term_logger.clone(),
+                    ),
+                )
+            })
+            .unwrap_or(term_logger)
+    }
+}
diff --git a/graph/src/log/mod.rs b/graph/src/log/mod.rs
new file mode 100644
index 0000000..6b28413
--- /dev/null
+++ b/graph/src/log/mod.rs
@@ -0,0 +1,383 @@
+#[macro_export]
+macro_rules! impl_slog_value {
+    ($T:ty) => {
+        impl_slog_value!($T, "{}");
+    };
+    ($T:ty, $fmt:expr) => {
+        impl $crate::slog::Value for $T {
+            fn serialize(
+                &self,
+                record: &$crate::slog::Record,
+                key: $crate::slog::Key,
+                serializer: &mut dyn $crate::slog::Serializer,
+            ) -> $crate::slog::Result {
+                format!($fmt, self).serialize(record, key, serializer)
+            }
+        }
+    };
+}
+
+use isatty;
+use slog::*;
+use slog_async;
+use slog_envlogger;
+use slog_term::*;
+use std::{fmt, io, result};
+
+use crate::prelude::ENV_VARS;
+
+pub mod codes;
+pub mod elastic;
+pub mod factory;
+pub mod split;
+
+pub fn logger(show_debug: bool) -> Logger {
+    let use_color = isatty::stdout_isatty();
+    let decorator = slog_term::TermDecorator::new().build();
+    let drain = CustomFormat::new(decorator, use_color).fuse();
+    let drain = slog_envlogger::LogBuilder::new(drain)
+        .filter(
+            None,
+            if show_debug {
+                FilterLevel::Debug
+            } else {
+                FilterLevel::Info
+            },
+        )
+        .parse(ENV_VARS.log_levels.as_deref().unwrap_or(""))
+        .build();
+    let drain = slog_async::Async::new(drain)
+        .chan_size(20000)
+        .build()
+        .fuse();
+    Logger::root(drain, o!())
+}
+
+pub fn discard() -> Logger {
+    Logger::root(slog::Discard, o!())
+}
+
+pub struct CustomFormat<D>
+where
+    D: Decorator,
+{
+    decorator: D,
+    use_color: bool,
+}
+
+impl<D> Drain for CustomFormat<D>
+where
+    D: Decorator,
+{
+    type Ok = ();
+    type Err = io::Error;
+
+    fn log(&self, record: &Record, values: &OwnedKVList) -> result::Result<Self::Ok, Self::Err> {
+        self.format_custom(record, values)
+    }
+}
+
+impl<D> CustomFormat<D>
+where
+    D: Decorator,
+{
+    pub fn new(decorator: D, use_color: bool) -> Self {
+        CustomFormat {
+            decorator,
+            use_color,
+        }
+    }
+
+    fn format_custom(&self, record: &Record, values: &OwnedKVList) -> io::Result<()> {
+        self.decorator.with_record(record, values, |mut decorator| {
+            decorator.start_timestamp()?;
+            formatted_timestamp_local(&mut decorator)?;
+            decorator.start_whitespace()?;
+            write!(decorator, " ")?;
+
+            decorator.start_level()?;
+            write!(decorator, "{}", record.level())?;
+
+            decorator.start_whitespace()?;
+            write!(decorator, " ")?;
+
+            decorator.start_msg()?;
+            write!(decorator, "{}", record.msg())?;
+
+            // Collect key values from the record
+            let mut serializer = KeyValueSerializer::new();
+            record.kv().serialize(record, &mut serializer)?;
+            let body_kvs = serializer.finish();
+
+            // Collect subgraph ID, components and extra key values from the record
+            let mut serializer = HeaderSerializer::new();
+            values.serialize(record, &mut serializer)?;
+            let (subgraph_id, components, header_kvs) = serializer.finish();
+
+            // Regular key values first
+            for (k, v) in body_kvs.iter().chain(header_kvs.iter()) {
+                decorator.start_comma()?;
+                write!(decorator, ", ")?;
+
+                decorator.start_key()?;
+                write!(decorator, "{}", k)?;
+
+                decorator.start_separator()?;
+                write!(decorator, ": ")?;
+
+                decorator.start_value()?;
+                write!(decorator, "{}", v)?;
+            }
+
+            // Then log the subgraph ID (if present)
+            if let Some(subgraph_id) = subgraph_id.as_ref() {
+                decorator.start_comma()?;
+                write!(decorator, ", ")?;
+                decorator.start_key()?;
+                write!(decorator, "subgraph_id")?;
+                decorator.start_separator()?;
+                write!(decorator, ": ")?;
+                decorator.start_value()?;
+                if self.use_color {
+                    write!(decorator, "\u{001b}[35m{}\u{001b}[0m", subgraph_id)?;
+                } else {
+                    write!(decorator, "{}", subgraph_id)?;
+                }
+            }
+
+            // Then log the component hierarchy
+            if !components.is_empty() {
+                decorator.start_comma()?;
+                write!(decorator, ", ")?;
+                decorator.start_key()?;
+                write!(decorator, "component")?;
+                decorator.start_separator()?;
+                write!(decorator, ": ")?;
+                decorator.start_value()?;
+                if self.use_color {
+                    write!(
+                        decorator,
+                        "\u{001b}[36m{}\u{001b}[0m",
+                        components.join(" > ")
+                    )?;
+                } else {
+                    write!(decorator, "{}", components.join(" > "))?;
+                }
+            }
+
+            write!(decorator, "\n")?;
+            decorator.flush()?;
+
+            Ok(())
+        })
+    }
+}
+
+struct HeaderSerializer {
+    subgraph_id: Option<String>,
+    components: Vec<String>,
+    kvs: Vec<(String, String)>,
+}
+
+impl HeaderSerializer {
+    pub fn new() -> Self {
+        Self {
+            subgraph_id: None,
+            components: vec![],
+            kvs: vec![],
+        }
+    }
+
+    pub fn finish(mut self) -> (Option<String>, Vec<String>, Vec<(String, String)>) {
+        // Reverse components so the parent components come first
+        self.components.reverse();
+
+        (self.subgraph_id, self.components, self.kvs)
+    }
+}
+
+macro_rules! s(
+    ($s:expr, $k:expr, $v:expr) => {
+        Ok(match $k {
+            "component" => $s.components.push(format!("{}", $v)),
+            "subgraph_id" => $s.subgraph_id = Some(format!("{}", $v)),
+            _ => $s.kvs.push(($k.into(), format!("{}", $v))),
+        })
+    };
+);
+
+impl ser::Serializer for HeaderSerializer {
+    fn emit_none(&mut self, key: Key) -> slog::Result {
+        s!(self, key, "None")
+    }
+
+    fn emit_unit(&mut self, key: Key) -> slog::Result {
+        s!(self, key, "()")
+    }
+
+    fn emit_bool(&mut self, key: Key, val: bool) -> slog::Result {
+        s!(self, key, val)
+    }
+
+    fn emit_char(&mut self, key: Key, val: char) -> slog::Result {
+        s!(self, key, val)
+    }
+
+    fn emit_usize(&mut self, key: Key, val: usize) -> slog::Result {
+        s!(self, key, val)
+    }
+
+    fn emit_isize(&mut self, key: Key, val: isize) -> slog::Result {
+        s!(self, key, val)
+    }
+
+    fn emit_u8(&mut self, key: Key, val: u8) -> slog::Result {
+        s!(self, key, val)
+    }
+
+    fn emit_i8(&mut self, key: Key, val: i8) -> slog::Result {
+        s!(self, key, val)
+    }
+
+    fn emit_u16(&mut self, key: Key, val: u16) -> slog::Result {
+        s!(self, key, val)
+    }
+
+    fn emit_i16(&mut self, key: Key, val: i16) -> slog::Result {
+        s!(self, key, val)
+    }
+
+    fn emit_u32(&mut self, key: Key, val: u32) -> slog::Result {
+        s!(self, key, val)
+    }
+
+    fn emit_i32(&mut self, key: Key, val: i32) -> slog::Result {
+        s!(self, key, val)
+    }
+
+    fn emit_f32(&mut self, key: Key, val: f32) -> slog::Result {
+        s!(self, key, val)
+    }
+
+    fn emit_u64(&mut self, key: Key, val: u64) -> slog::Result {
+        s!(self, key, val)
+    }
+
+    fn emit_i64(&mut self, key: Key, val: i64) -> slog::Result {
+        s!(self, key, val)
+    }
+
+    fn emit_f64(&mut self, key: Key, val: f64) -> slog::Result {
+        s!(self, key, val)
+    }
+
+    fn emit_str(&mut self, key: Key, val: &str) -> slog::Result {
+        s!(self, key, val)
+    }
+
+    fn emit_arguments(&mut self, key: Key, val: &fmt::Arguments) -> slog::Result {
+        s!(self, key, val)
+    }
+}
+
+struct KeyValueSerializer {
+    kvs: Vec<(String, String)>,
+}
+
+impl KeyValueSerializer {
+    pub fn new() -> Self {
+        Self { kvs: vec![] }
+    }
+
+    pub fn finish(self) -> Vec<(String, String)> {
+        self.kvs
+    }
+}
+
+macro_rules! s(
+    ($s:expr, $k:expr, $v:expr) => {
+        Ok($s.kvs.push(($k.into(), format!("{}", $v))))
+    };
+);
+
+impl ser::Serializer for KeyValueSerializer {
+    fn emit_none(&mut self, key: Key) -> slog::Result {
+        s!(self, key, "None")
+    }
+
+    fn emit_unit(&mut self, key: Key) -> slog::Result {
+        s!(self, key, "()")
+    }
+
+    fn emit_bool(&mut self, key: Key, val: bool) -> slog::Result {
+        s!(self, key, val)
+    }
+
+    fn emit_char(&mut self, key: Key, val: char) -> slog::Result {
+        s!(self, key, val)
+    }
+
+    fn emit_usize(&mut self, key: Key, val: usize) -> slog::Result {
+        s!(self, key, val)
+    }
+
+    fn emit_isize(&mut self, key: Key, val: isize) -> slog::Result {
+        s!(self, key, val)
+    }
+
+    fn emit_u8(&mut self, key: Key, val: u8) -> slog::Result {
+        s!(self, key, val)
+    }
+
+    fn emit_i8(&mut self, key: Key, val: i8) -> slog::Result {
+        s!(self, key, val)
+    }
+
+    fn emit_u16(&mut self, key: Key, val: u16) -> slog::Result {
+        s!(self, key, val)
+    }
+
+    fn emit_i16(&mut self, key: Key, val: i16) -> slog::Result {
+        s!(self, key, val)
+    }
+
+    fn emit_u32(&mut self, key: Key, val: u32) -> slog::Result {
+        s!(self, key, val)
+    }
+
+    fn emit_i32(&mut self, key: Key, val: i32) -> slog::Result {
+        s!(self, key, val)
+    }
+
+    fn emit_f32(&mut self, key: Key, val: f32) -> slog::Result {
+        s!(self, key, val)
+    }
+
+    fn emit_u64(&mut self, key: Key, val: u64) -> slog::Result {
+        s!(self, key, val)
+    }
+
+    fn emit_i64(&mut self, key: Key, val: i64) -> slog::Result {
+        s!(self, key, val)
+    }
+
+    fn emit_f64(&mut self, key: Key, val: f64) -> slog::Result {
+        s!(self, key, val)
+    }
+
+    fn emit_str(&mut self, key: Key, val: &str) -> slog::Result {
+        s!(self, key, val)
+    }
+
+    fn emit_arguments(&mut self, key: Key, val: &fmt::Arguments) -> slog::Result {
+        s!(self, key, val)
+    }
+}
+
+fn formatted_timestamp_local(io: &mut impl io::Write) -> io::Result<()> {
+    write!(
+        io,
+        "{}",
+        chrono::Local::now().format(ENV_VARS.log_time_format.as_str())
+    )
+}
diff --git a/graph/src/log/split.rs b/graph/src/log/split.rs
new file mode 100644
index 0000000..8e6711d
--- /dev/null
+++ b/graph/src/log/split.rs
@@ -0,0 +1,74 @@
+use std::fmt::Debug;
+use std::result::Result as StdResult;
+
+use slog::*;
+use slog_async;
+
+/// An error that could come from either of two slog `Drain`s.
+#[derive(Debug)]
+enum SplitDrainError<D1, D2>
+where
+    D1: Drain,
+    D2: Drain,
+{
+    Drain1Error(D1::Err),
+    Drain2Error(D2::Err),
+}
+
+/// An slog `Drain` that forwards log messages to two other drains.
+struct SplitDrain<D1, D2>
+where
+    D1: Drain,
+    D2: Drain,
+{
+    drain1: D1,
+    drain2: D2,
+}
+
+impl<D1, D2> SplitDrain<D1, D2>
+where
+    D1: Drain,
+    D2: Drain,
+{
+    /// Creates a new split drain that forwards to the two provided drains.
+    fn new(drain1: D1, drain2: D2) -> Self {
+        SplitDrain { drain1, drain2 }
+    }
+}
+
+impl<D1, D2> Drain for SplitDrain<D1, D2>
+where
+    D1: Drain,
+    D2: Drain,
+{
+    type Ok = ();
+    type Err = SplitDrainError<D1, D2>;
+
+    fn log(&self, record: &Record, values: &OwnedKVList) -> StdResult<Self::Ok, Self::Err> {
+        self.drain1
+            .log(record, values)
+            .map_err(SplitDrainError::Drain1Error)
+            .and(
+                self.drain2
+                    .log(record, values)
+                    .map(|_| ())
+                    .map_err(SplitDrainError::Drain2Error),
+            )
+    }
+}
+
+/// Creates an async slog logger that writes to two drains in parallel.
+pub fn split_logger<D1, D2>(drain1: D1, drain2: D2) -> Logger
+where
+    D1: Drain + Send + Debug + 'static,
+    D2: Drain + Send + Debug + 'static,
+    D1::Err: Debug,
+    D2::Err: Debug,
+{
+    let split_drain = SplitDrain::new(drain1.fuse(), drain2.fuse()).fuse();
+    let async_drain = slog_async::Async::new(split_drain)
+        .chan_size(20000)
+        .build()
+        .fuse();
+    Logger::root(async_drain, o!())
+}
diff --git a/graph/src/runtime/asc_heap.rs b/graph/src/runtime/asc_heap.rs
new file mode 100644
index 0000000..c391654
--- /dev/null
+++ b/graph/src/runtime/asc_heap.rs
@@ -0,0 +1,144 @@
+use std::mem::MaybeUninit;
+
+use semver::Version;
+
+use super::{
+    gas::GasCounter, AscIndexId, AscPtr, AscType, DeterministicHostError, IndexForAscTypeId,
+};
+/// A type that can read and write to the Asc heap. Call `asc_new` and `asc_get`
+/// for reading and writing Rust structs from and to Asc.
+///
+/// The implementor must provide the direct Asc interface with `raw_new` and `get`.
+pub trait AscHeap {
+    /// Allocate new space and write `bytes`, return the allocated address.
+    fn raw_new(&mut self, bytes: &[u8], gas: &GasCounter) -> Result<u32, DeterministicHostError>;
+
+    fn read<'a>(
+        &self,
+        offset: u32,
+        buffer: &'a mut [MaybeUninit<u8>],
+        gas: &GasCounter,
+    ) -> Result<&'a mut [u8], DeterministicHostError>;
+
+    fn read_u32(&self, offset: u32, gas: &GasCounter) -> Result<u32, DeterministicHostError>;
+
+    fn api_version(&self) -> Version;
+
+    fn asc_type_id(
+        &mut self,
+        type_id_index: IndexForAscTypeId,
+    ) -> Result<u32, DeterministicHostError>;
+}
+
+/// Instantiate `rust_obj` as an Asc object of class `C`.
+/// Returns a pointer to the Asc heap.
+///
+/// This operation is expensive as it requires a call to `raw_new` for every
+/// nested object.
+pub fn asc_new<C, T: ?Sized, H: AscHeap + ?Sized>(
+    heap: &mut H,
+    rust_obj: &T,
+    gas: &GasCounter,
+) -> Result<AscPtr<C>, DeterministicHostError>
+where
+    C: AscType + AscIndexId,
+    T: ToAscObj<C>,
+{
+    let obj = rust_obj.to_asc_obj(heap, gas)?;
+    AscPtr::alloc_obj(obj, heap, gas)
+}
+
+/// Map an optional object to its Asc equivalent if Some, otherwise return a missing field error.
+pub fn asc_new_or_missing<H, O, A>(
+    heap: &mut H,
+    object: &Option<O>,
+    gas: &GasCounter,
+    type_name: &str,
+    field_name: &str,
+) -> Result<AscPtr<A>, DeterministicHostError>
+where
+    H: AscHeap + ?Sized,
+    O: ToAscObj<A>,
+    A: AscType + AscIndexId,
+{
+    match object {
+        Some(o) => asc_new(heap, o, gas),
+        None => Err(missing_field_error(type_name, field_name)),
+    }
+}
+
+/// Map an optional object to its Asc equivalent if Some, otherwise return null.
+pub fn asc_new_or_null<H, O, A>(
+    heap: &mut H,
+    object: &Option<O>,
+    gas: &GasCounter,
+) -> Result<AscPtr<A>, DeterministicHostError>
+where
+    H: AscHeap + ?Sized,
+    O: ToAscObj<A>,
+    A: AscType + AscIndexId,
+{
+    match object {
+        Some(o) => asc_new(heap, o, gas),
+        None => Ok(AscPtr::null()),
+    }
+}
+
+/// Create an error for a missing field in a type.
+fn missing_field_error(type_name: &str, field_name: &str) -> DeterministicHostError {
+    DeterministicHostError::from(anyhow::anyhow!("{} missing {}", type_name, field_name))
+}
+
+///  Read the rust representation of an Asc object of class `C`.
+///
+///  This operation is expensive as it requires a call to `get` for every
+///  nested object.
+pub fn asc_get<T, C, H: AscHeap + ?Sized>(
+    heap: &H,
+    asc_ptr: AscPtr<C>,
+    gas: &GasCounter,
+) -> Result<T, DeterministicHostError>
+where
+    C: AscType + AscIndexId,
+    T: FromAscObj<C>,
+{
+    T::from_asc_obj(asc_ptr.read_ptr(heap, gas)?, heap, gas)
+}
+
+/// Type that can be converted to an Asc object of class `C`.
+pub trait ToAscObj<C: AscType> {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<C, DeterministicHostError>;
+}
+
+impl<C: AscType, T: ToAscObj<C>> ToAscObj<C> for &T {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<C, DeterministicHostError> {
+        (*self).to_asc_obj(heap, gas)
+    }
+}
+
+impl ToAscObj<bool> for bool {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        _heap: &mut H,
+        _gas: &GasCounter,
+    ) -> Result<bool, DeterministicHostError> {
+        Ok(*self)
+    }
+}
+
+/// Type that can be converted from an Asc object of class `C`.
+pub trait FromAscObj<C: AscType>: Sized {
+    fn from_asc_obj<H: AscHeap + ?Sized>(
+        obj: C,
+        heap: &H,
+        gas: &GasCounter,
+    ) -> Result<Self, DeterministicHostError>;
+}
diff --git a/graph/src/runtime/asc_ptr.rs b/graph/src/runtime/asc_ptr.rs
new file mode 100644
index 0000000..aa7c1c6
--- /dev/null
+++ b/graph/src/runtime/asc_ptr.rs
@@ -0,0 +1,245 @@
+use super::gas::GasCounter;
+use super::{padding_to_16, DeterministicHostError};
+
+use super::{AscHeap, AscIndexId, AscType, IndexForAscTypeId};
+use semver::Version;
+use std::fmt;
+use std::marker::PhantomData;
+use std::mem::MaybeUninit;
+
+/// The `rt_size` field contained in an AssemblyScript header has a size of 4 bytes.
+const SIZE_OF_RT_SIZE: u32 = 4;
+
+/// A pointer to an object in the Asc heap.
+pub struct AscPtr<C>(u32, PhantomData<C>);
+
+impl<T> Copy for AscPtr<T> {}
+
+impl<T> Clone for AscPtr<T> {
+    fn clone(&self) -> Self {
+        AscPtr(self.0, PhantomData)
+    }
+}
+
+impl<T> Default for AscPtr<T> {
+    fn default() -> Self {
+        AscPtr(0, PhantomData)
+    }
+}
+
+impl<T> fmt::Debug for AscPtr<T> {
+    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
+        self.0.fmt(f)
+    }
+}
+
+impl<C> AscPtr<C> {
+    /// A raw pointer to be passed to Wasm.
+    pub fn wasm_ptr(self) -> u32 {
+        self.0
+    }
+
+    #[inline(always)]
+    pub fn new(heap_ptr: u32) -> Self {
+        Self(heap_ptr, PhantomData)
+    }
+}
+
+impl<C: AscType> AscPtr<C> {
+    /// Create a pointer that is equivalent to AssemblyScript's `null`.
+    #[inline(always)]
+    pub fn null() -> Self {
+        AscPtr::new(0)
+    }
+
+    /// Read from `self` into the Rust struct `C`.
+    pub fn read_ptr<H: AscHeap + ?Sized>(
+        self,
+        heap: &H,
+        gas: &GasCounter,
+    ) -> Result<C, DeterministicHostError> {
+        let len = match heap.api_version() {
+            // TODO: The version check here conflicts with the comment on C::asc_size,
+            // which states "Only used for version <= 0.0.3."
+            version if version <= Version::new(0, 0, 4) => C::asc_size(self, heap, gas),
+            _ => self.read_len(heap, gas),
+        }?;
+
+        let using_buffer = |buffer: &mut [MaybeUninit<u8>]| {
+            let buffer = heap.read(self.0, buffer, gas)?;
+            C::from_asc_bytes(buffer, &heap.api_version())
+        };
+
+        let len = len as usize;
+
+        if len <= 32 {
+            let mut buffer = [MaybeUninit::<u8>::uninit(); 32];
+            using_buffer(&mut buffer[..len])
+        } else {
+            let mut buffer = Vec::with_capacity(len);
+            using_buffer(buffer.spare_capacity_mut())
+        }
+    }
+
+    /// Allocate `asc_obj` as an Asc object of class `C`.
+    pub fn alloc_obj<H: AscHeap + ?Sized>(
+        asc_obj: C,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscPtr<C>, DeterministicHostError>
+    where
+        C: AscIndexId,
+    {
+        match heap.api_version() {
+            version if version <= Version::new(0, 0, 4) => {
+                let heap_ptr = heap.raw_new(&asc_obj.to_asc_bytes()?, gas)?;
+                Ok(AscPtr::new(heap_ptr))
+            }
+            _ => {
+                let mut bytes = asc_obj.to_asc_bytes()?;
+
+                let aligned_len = padding_to_16(bytes.len());
+                // Since AssemblyScript keeps all allocated objects with a 16 byte alignment,
+                // we need to do the same when we allocate ourselves.
+                bytes.extend(std::iter::repeat(0).take(aligned_len));
+
+                let header = Self::generate_header(
+                    heap,
+                    C::INDEX_ASC_TYPE_ID,
+                    asc_obj.content_len(&bytes),
+                    bytes.len(),
+                )?;
+                let header_len = header.len() as u32;
+
+                let heap_ptr = heap.raw_new(&[header, bytes].concat(), gas)?;
+
+                // Use header length as offset. so the AscPtr points directly at the content.
+                Ok(AscPtr::new(heap_ptr + header_len))
+            }
+        }
+    }
+
+    /// Helper used by arrays and strings to read their length.
+    /// Only used for version <= 0.0.4.
+    pub fn read_u32<H: AscHeap + ?Sized>(
+        &self,
+        heap: &H,
+        gas: &GasCounter,
+    ) -> Result<u32, DeterministicHostError> {
+        // Read the bytes pointed to by `self` as the bytes of a `u32`.
+        heap.read_u32(self.0, gas)
+    }
+
+    /// Helper that generates an AssemblyScript header.
+    /// An AssemblyScript header has 20 bytes and it is composed of 5 values.
+    /// - mm_info: usize -> size of all header contents + payload contents + padding
+    /// - gc_info: usize -> first GC info (we don't free memory so it's irrelevant)
+    /// - gc_info2: usize -> second GC info (we don't free memory so it's irrelevant)
+    /// - rt_id: u32 -> identifier for the class being allocated
+    /// - rt_size: u32 -> content size
+    /// Only used for version >= 0.0.5.
+    fn generate_header<H: AscHeap + ?Sized>(
+        heap: &mut H,
+        type_id_index: IndexForAscTypeId,
+        content_length: usize,
+        full_length: usize,
+    ) -> Result<Vec<u8>, DeterministicHostError> {
+        let mut header: Vec<u8> = Vec::with_capacity(20);
+
+        let gc_info: [u8; 4] = (0u32).to_le_bytes();
+        let gc_info2: [u8; 4] = (0u32).to_le_bytes();
+        let asc_type_id = heap.asc_type_id(type_id_index)?;
+        let rt_id: [u8; 4] = asc_type_id.to_le_bytes();
+        let rt_size: [u8; 4] = (content_length as u32).to_le_bytes();
+
+        let mm_info: [u8; 4] =
+            ((gc_info.len() + gc_info2.len() + rt_id.len() + rt_size.len() + full_length) as u32)
+                .to_le_bytes();
+
+        header.extend(&mm_info);
+        header.extend(&gc_info);
+        header.extend(&gc_info2);
+        header.extend(&rt_id);
+        header.extend(&rt_size);
+
+        Ok(header)
+    }
+
+    /// Helper to read the length from the header.
+    /// An AssemblyScript header has 20 bytes, and it's right before the content, and composed by:
+    /// - mm_info: usize
+    /// - gc_info: usize
+    /// - gc_info2: usize
+    /// - rt_id: u32
+    /// - rt_size: u32
+    /// This function returns the `rt_size`.
+    /// Only used for version >= 0.0.5.
+    pub fn read_len<H: AscHeap + ?Sized>(
+        &self,
+        heap: &H,
+        gas: &GasCounter,
+    ) -> Result<u32, DeterministicHostError> {
+        // We're trying to read the pointer below, we should check it's
+        // not null before using it.
+        self.check_is_not_null()?;
+
+        let start_of_rt_size = self.0.checked_sub(SIZE_OF_RT_SIZE).ok_or_else(|| {
+            DeterministicHostError::from(anyhow::anyhow!(
+                "Subtract overflow on pointer: {}",
+                self.0
+            ))
+        })?;
+
+        heap.read_u32(start_of_rt_size, gas)
+    }
+
+    /// Conversion to `u64` for use with `AscEnum`.
+    pub fn to_payload(&self) -> u64 {
+        self.0 as u64
+    }
+
+    /// We typically assume `AscPtr` is never null, but for types such as `string | null` it can be.
+    pub fn is_null(&self) -> bool {
+        self.0 == 0
+    }
+
+    /// There's no problem in an AscPtr being 'null' (see above AscPtr::is_null function).
+    /// However if one tries to read that pointer, it should fail with a helpful error message,
+    /// this function does this error handling.
+    ///
+    /// Summary: ALWAYS call this before reading an AscPtr.
+    pub fn check_is_not_null(&self) -> Result<(), DeterministicHostError> {
+        if self.is_null() {
+            return Err(DeterministicHostError::from(anyhow::anyhow!(
+                "Tried to read AssemblyScript value that is 'null'. Suggestion: look into the function that the error happened and add 'log' calls till you find where a 'null' value is being used as non-nullable. It's likely that you're calling a 'graph-ts' function (or operator) with a 'null' value when it doesn't support it."
+            )));
+        }
+
+        Ok(())
+    }
+
+    // Erase type information.
+    pub fn erase(self) -> AscPtr<()> {
+        AscPtr::new(self.0)
+    }
+}
+
+impl<C> From<u32> for AscPtr<C> {
+    fn from(ptr: u32) -> Self {
+        AscPtr::new(ptr)
+    }
+}
+
+impl<T> AscType for AscPtr<T> {
+    fn to_asc_bytes(&self) -> Result<Vec<u8>, DeterministicHostError> {
+        self.0.to_asc_bytes()
+    }
+
+    fn from_asc_bytes(
+        asc_obj: &[u8],
+        api_version: &Version,
+    ) -> Result<Self, DeterministicHostError> {
+        let bytes = u32::from_asc_bytes(asc_obj, api_version)?;
+        Ok(AscPtr::new(bytes))
+    }
+}
diff --git a/graph/src/runtime/gas/combinators.rs b/graph/src/runtime/gas/combinators.rs
new file mode 100644
index 0000000..a6bc379
--- /dev/null
+++ b/graph/src/runtime/gas/combinators.rs
@@ -0,0 +1,136 @@
+use super::{Gas, GasSizeOf};
+use std::cmp::{max, min};
+
+pub mod complexity {
+    use super::*;
+
+    // Args have additive linear complexity
+    // Eg: O(N₁+N₂)
+    pub struct Linear;
+    // Args have multiplicative complexity
+    // Eg: O(N₁*N₂)
+    pub struct Mul;
+
+    // Exponential complexity.
+    // Eg: O(N₁^N₂)
+    pub struct Exponential;
+
+    // There is only one arg and it scales linearly with it's size
+    pub struct Size;
+
+    // Complexity is captured by the lesser complexity of the two args
+    // Eg: O(min(N₁, N₂))
+    pub struct Min;
+
+    // Complexity is captured by the greater complexity of the two args
+    // Eg: O(max(N₁, N₂))
+    pub struct Max;
+
+    impl GasCombinator for Linear {
+        #[inline(always)]
+        fn combine(lhs: Gas, rhs: Gas) -> Gas {
+            lhs + rhs
+        }
+    }
+
+    impl GasCombinator for Mul {
+        #[inline(always)]
+        fn combine(lhs: Gas, rhs: Gas) -> Gas {
+            Gas(lhs.0.saturating_mul(rhs.0))
+        }
+    }
+
+    impl GasCombinator for Min {
+        #[inline(always)]
+        fn combine(lhs: Gas, rhs: Gas) -> Gas {
+            min(lhs, rhs)
+        }
+    }
+
+    impl GasCombinator for Max {
+        #[inline(always)]
+        fn combine(lhs: Gas, rhs: Gas) -> Gas {
+            max(lhs, rhs)
+        }
+    }
+
+    impl<T> GasSizeOf for Combine<T, Size>
+    where
+        T: GasSizeOf,
+    {
+        fn gas_size_of(&self) -> Gas {
+            self.0.gas_size_of()
+        }
+    }
+}
+
+pub struct Combine<Tuple, Combinator>(pub Tuple, pub Combinator);
+
+pub trait GasCombinator {
+    fn combine(lhs: Gas, rhs: Gas) -> Gas;
+}
+
+impl<T0, T1, C> GasSizeOf for Combine<(T0, T1), C>
+where
+    T0: GasSizeOf,
+    T1: GasSizeOf,
+    C: GasCombinator,
+{
+    fn gas_size_of(&self) -> Gas {
+        let (a, b) = &self.0;
+        C::combine(a.gas_size_of(), b.gas_size_of())
+    }
+
+    #[inline]
+    fn const_gas_size_of() -> Option<Gas> {
+        if let Some(t0) = T0::const_gas_size_of() {
+            if let Some(t1) = T1::const_gas_size_of() {
+                return Some(C::combine(t0, t1));
+            }
+        }
+        None
+    }
+}
+
+impl<T0, T1, T2, C> GasSizeOf for Combine<(T0, T1, T2), C>
+where
+    T0: GasSizeOf,
+    T1: GasSizeOf,
+    T2: GasSizeOf,
+    C: GasCombinator,
+{
+    fn gas_size_of(&self) -> Gas {
+        let (a, b, c) = &self.0;
+        C::combine(
+            C::combine(a.gas_size_of(), b.gas_size_of()),
+            c.gas_size_of(),
+        )
+    }
+
+    #[inline] // Const propagation to the rescue. I hope.
+    fn const_gas_size_of() -> Option<Gas> {
+        if let Some(t0) = T0::const_gas_size_of() {
+            if let Some(t1) = T1::const_gas_size_of() {
+                if let Some(t2) = T2::const_gas_size_of() {
+                    return Some(C::combine(C::combine(t0, t1), t2));
+                }
+            }
+        }
+        None
+    }
+}
+
+impl<T0> GasSizeOf for Combine<(T0, u8), complexity::Exponential>
+where
+    T0: GasSizeOf,
+{
+    fn gas_size_of(&self) -> Gas {
+        let (a, b) = &self.0;
+        Gas(a.gas_size_of().0.saturating_pow(*b as u32))
+    }
+
+    #[inline]
+    fn const_gas_size_of() -> Option<Gas> {
+        None
+    }
+}
diff --git a/graph/src/runtime/gas/costs.rs b/graph/src/runtime/gas/costs.rs
new file mode 100644
index 0000000..a4593a0
--- /dev/null
+++ b/graph/src/runtime/gas/costs.rs
@@ -0,0 +1,76 @@
+//! Stores all the gas costs is one place so they can be compared easily.
+//! Determinism: Once deployed, none of these values can be changed without a version upgrade.
+
+use super::*;
+
+/// Using 10 gas = ~1ns for WASM instructions.
+const GAS_PER_SECOND: u64 = 10_000_000_000;
+
+/// Set max gas to 1000 seconds worth of gas per handler. The intent here is to have the determinism
+/// cutoff be very high, while still allowing more reasonable timer based cutoffs. Having a unit
+/// like 10 gas for ~1ns allows us to be granular in instructions which are aggregated into metered
+/// blocks via https://docs.rs/pwasm-utils/0.16.0/pwasm_utils/fn.inject_gas_counter.html But we can
+/// still charge very high numbers for other things.
+pub const CONST_MAX_GAS_PER_HANDLER: u64 = 1000 * GAS_PER_SECOND;
+
+/// Gas for instructions are aggregated into blocks, so hopefully gas calls each have relatively
+/// large gas. But in the case they don't, we don't want the overhead of calling out into a host
+/// export to be the dominant cost that causes unexpectedly high execution times.
+///
+/// This value is based on the benchmark of an empty infinite loop, which does basically nothing
+/// other than call the gas function. The benchmark result was closer to 5000 gas but use 10_000 to
+/// be conservative.
+pub const HOST_EXPORT_GAS: Gas = Gas(10_000);
+
+/// As a heuristic for the cost of host fns it makes sense to reason in terms of bandwidth and
+/// calculate the cost from there. Because we don't have benchmarks for each host fn, we go with
+/// pessimistic assumption of performance of 10 MB/s, which nonetheless allows for 10 GB to be
+/// processed through host exports by a single handler at a 1000 seconds budget.
+const DEFAULT_BYTE_PER_SECOND: u64 = 10_000_000;
+
+/// With the current parameters DEFAULT_GAS_PER_BYTE = 1_000.
+const DEFAULT_GAS_PER_BYTE: u64 = GAS_PER_SECOND / DEFAULT_BYTE_PER_SECOND;
+
+/// Base gas cost for calling any host export.
+/// Security: This must be non-zero.
+pub const DEFAULT_BASE_COST: u64 = 100_000;
+
+pub const DEFAULT_GAS_OP: GasOp = GasOp {
+    base_cost: DEFAULT_BASE_COST,
+    size_mult: DEFAULT_GAS_PER_BYTE,
+};
+
+/// Because big math has a multiplicative complexity, that can result in high sizes, so assume a
+/// bandwidth of 100 MB/s, faster than the default.
+const BIG_MATH_BYTE_PER_SECOND: u64 = 100_000_000;
+const BIG_MATH_GAS_PER_BYTE: u64 = GAS_PER_SECOND / BIG_MATH_BYTE_PER_SECOND;
+
+pub const BIG_MATH_GAS_OP: GasOp = GasOp {
+    base_cost: DEFAULT_BASE_COST,
+    size_mult: BIG_MATH_GAS_PER_BYTE,
+};
+
+// Allow up to 100,000 data sources to be created
+pub const CREATE_DATA_SOURCE: Gas = Gas(CONST_MAX_GAS_PER_HANDLER / 100_000);
+
+pub const LOG_OP: GasOp = GasOp {
+    // Allow up to 100,000 logs
+    base_cost: CONST_MAX_GAS_PER_HANDLER / 100_000,
+    size_mult: DEFAULT_GAS_PER_BYTE,
+};
+
+// Saving to the store is one of the most expensive operations.
+pub const STORE_SET: GasOp = GasOp {
+    // Allow up to 250k entities saved.
+    base_cost: CONST_MAX_GAS_PER_HANDLER / 250_000,
+    // If the size roughly corresponds to bytes, allow 1GB to be saved.
+    size_mult: CONST_MAX_GAS_PER_HANDLER / 1_000_000_000,
+};
+
+// Reading from the store is much cheaper than writing.
+pub const STORE_GET: GasOp = GasOp {
+    base_cost: CONST_MAX_GAS_PER_HANDLER / 10_000_000,
+    size_mult: CONST_MAX_GAS_PER_HANDLER / 10_000_000_000,
+};
+
+pub const STORE_REMOVE: GasOp = STORE_SET;
diff --git a/graph/src/runtime/gas/mod.rs b/graph/src/runtime/gas/mod.rs
new file mode 100644
index 0000000..7d9bb38
--- /dev/null
+++ b/graph/src/runtime/gas/mod.rs
@@ -0,0 +1,110 @@
+mod combinators;
+mod costs;
+mod ops;
+mod saturating;
+mod size_of;
+use crate::prelude::{CheapClone, ENV_VARS};
+use crate::runtime::DeterministicHostError;
+pub use combinators::*;
+pub use costs::DEFAULT_BASE_COST;
+pub use costs::*;
+pub use saturating::*;
+
+use std::sync::atomic::{AtomicU64, Ordering::SeqCst};
+use std::sync::Arc;
+use std::{fmt, fmt::Display};
+
+pub struct GasOp {
+    base_cost: u64,
+    size_mult: u64,
+}
+
+impl GasOp {
+    pub fn with_args<T, C>(&self, c: C, args: T) -> Gas
+    where
+        Combine<T, C>: GasSizeOf,
+    {
+        Gas(self.base_cost) + Combine(args, c).gas_size_of() * self.size_mult
+    }
+}
+
+/// Sort of a base unit for gas operations. For example, if one is operating
+/// on a BigDecimal one might like to know how large that BigDecimal is compared
+/// to other BigDecimals so that one could to (MultCost * gas_size_of(big_decimal))
+/// and re-use that logic for (WriteToDBCost or ReadFromDBCost) rather than having
+/// one-offs for each use-case.
+/// This is conceptually much like CacheWeight, but has some key differences.
+/// First, this needs to be stable - like StableHash (same independent of
+/// platform/compiler/run). Also this can be somewhat context dependent. An example
+/// of context dependent costs might be if a value is being hex encoded or binary encoded
+/// when serializing.
+///
+/// Either implement gas_size_of or const_gas_size_of but never none or both.
+pub trait GasSizeOf {
+    #[inline(always)]
+    fn gas_size_of(&self) -> Gas {
+        Self::const_gas_size_of().expect("GasSizeOf unimplemented")
+    }
+    /// Some when every member of the type has the same gas size.
+    #[inline(always)]
+    fn const_gas_size_of() -> Option<Gas> {
+        None
+    }
+}
+
+/// This wrapper ensures saturating arithmetic is used
+#[derive(Copy, Clone, PartialEq, Eq, Hash, Debug, PartialOrd, Ord)]
+pub struct Gas(u64);
+
+impl Gas {
+    pub const ZERO: Gas = Gas(0);
+
+    pub const fn new(gas: u64) -> Self {
+        Gas(gas)
+    }
+
+    #[cfg(debug_assertions)]
+    pub const fn value(&self) -> u64 {
+        self.0
+    }
+}
+
+impl Display for Gas {
+    fn fmt(&self, f: &mut fmt::Formatter) -> Result<(), fmt::Error> {
+        self.0.fmt(f)
+    }
+}
+
+#[derive(Clone, Default)]
+pub struct GasCounter(Arc<AtomicU64>);
+
+impl CheapClone for GasCounter {}
+
+impl GasCounter {
+    /// Alias of [`Default::default`].
+    pub fn new() -> Self {
+        Self::default()
+    }
+
+    /// This should be called once per host export
+    pub fn consume_host_fn(&self, mut amount: Gas) -> Result<(), DeterministicHostError> {
+        amount += costs::HOST_EXPORT_GAS;
+        let old = self
+            .0
+            .fetch_update(SeqCst, SeqCst, |v| Some(v.saturating_add(amount.0)))
+            .unwrap();
+        let new = old.saturating_add(amount.0);
+        if new >= ENV_VARS.max_gas_per_handler {
+            Err(DeterministicHostError::gas(anyhow::anyhow!(
+                "Gas limit exceeded. Used: {}",
+                new
+            )))
+        } else {
+            Ok(())
+        }
+    }
+
+    pub fn get(&self) -> Gas {
+        Gas(self.0.load(SeqCst))
+    }
+}
diff --git a/graph/src/runtime/gas/ops.rs b/graph/src/runtime/gas/ops.rs
new file mode 100644
index 0000000..a7e5987
--- /dev/null
+++ b/graph/src/runtime/gas/ops.rs
@@ -0,0 +1,54 @@
+//! All the operators go here
+//! Gas operations are all saturating and additive (never trending toward zero)
+
+use super::{Gas, SaturatingInto as _};
+use std::iter::Sum;
+use std::ops::{Add, AddAssign, Mul, MulAssign};
+
+impl Add for Gas {
+    type Output = Gas;
+    #[inline]
+    fn add(self, rhs: Gas) -> Self::Output {
+        Gas(self.0.saturating_add(rhs.0))
+    }
+}
+
+impl Mul<u64> for Gas {
+    type Output = Gas;
+    #[inline]
+    fn mul(self, rhs: u64) -> Self::Output {
+        Gas(self.0.saturating_mul(rhs))
+    }
+}
+
+impl Mul<usize> for Gas {
+    type Output = Gas;
+    #[inline]
+    fn mul(self, rhs: usize) -> Self::Output {
+        Gas(self.0.saturating_mul(rhs.saturating_into()))
+    }
+}
+
+impl MulAssign<u64> for Gas {
+    #[inline]
+    fn mul_assign(&mut self, rhs: u64) {
+        self.0 = self.0.saturating_add(rhs);
+    }
+}
+
+impl AddAssign for Gas {
+    #[inline]
+    fn add_assign(&mut self, rhs: Gas) {
+        self.0 = self.0.saturating_add(rhs.0);
+    }
+}
+
+impl Sum for Gas {
+    fn sum<I: Iterator<Item = Self>>(iter: I) -> Self {
+        let mut sum = Gas::ZERO;
+        for elem in iter {
+            sum += elem;
+        }
+        sum
+    }
+}
diff --git a/graph/src/runtime/gas/saturating.rs b/graph/src/runtime/gas/saturating.rs
new file mode 100644
index 0000000..de2a477
--- /dev/null
+++ b/graph/src/runtime/gas/saturating.rs
@@ -0,0 +1,51 @@
+use super::Gas;
+use std::convert::TryInto as _;
+
+pub trait SaturatingFrom<T> {
+    fn saturating_from(value: T) -> Self;
+}
+
+// It would be good to put this trait into a new or existing crate.
+// Tried conv but the owner seems to be away
+// https://github.com/DanielKeep/rust-conv/issues/15
+pub trait SaturatingInto<T> {
+    fn saturating_into(self) -> T;
+}
+
+impl<I, F> SaturatingInto<F> for I
+where
+    F: SaturatingFrom<I>,
+{
+    #[inline(always)]
+    fn saturating_into(self) -> F {
+        F::saturating_from(self)
+    }
+}
+
+impl SaturatingFrom<usize> for Gas {
+    #[inline]
+    fn saturating_from(value: usize) -> Gas {
+        Gas(value.try_into().unwrap_or(u64::MAX))
+    }
+}
+
+impl SaturatingFrom<usize> for u64 {
+    #[inline]
+    fn saturating_from(value: usize) -> Self {
+        value.try_into().unwrap_or(u64::MAX)
+    }
+}
+
+impl SaturatingFrom<f64> for Gas {
+    #[inline]
+    fn saturating_from(value: f64) -> Self {
+        Gas(value as u64)
+    }
+}
+
+impl SaturatingFrom<u32> for Gas {
+    #[inline]
+    fn saturating_from(value: u32) -> Self {
+        Gas(value as u64)
+    }
+}
diff --git a/graph/src/runtime/gas/size_of.rs b/graph/src/runtime/gas/size_of.rs
new file mode 100644
index 0000000..49bb60b
--- /dev/null
+++ b/graph/src/runtime/gas/size_of.rs
@@ -0,0 +1,175 @@
+//! Various implementations of GasSizeOf;
+
+use crate::{
+    components::store::{EntityKey, EntityType},
+    data::store::{scalar::Bytes, Value},
+    prelude::{BigDecimal, BigInt},
+};
+
+use super::{Gas, GasSizeOf, SaturatingInto as _};
+
+impl GasSizeOf for Value {
+    fn gas_size_of(&self) -> Gas {
+        let inner = match self {
+            Value::BigDecimal(big_decimal) => big_decimal.gas_size_of(),
+            Value::String(string) => string.gas_size_of(),
+            Value::Null => Gas(1),
+            Value::List(list) => list.gas_size_of(),
+            Value::Int(int) => int.gas_size_of(),
+            Value::Bytes(bytes) => bytes.gas_size_of(),
+            Value::Bool(bool) => bool.gas_size_of(),
+            Value::BigInt(big_int) => big_int.gas_size_of(),
+        };
+        Gas(4) + inner
+    }
+}
+
+impl GasSizeOf for Bytes {
+    fn gas_size_of(&self) -> Gas {
+        (&self[..]).gas_size_of()
+    }
+}
+
+impl GasSizeOf for bool {
+    #[inline(always)]
+    fn const_gas_size_of() -> Option<Gas> {
+        Some(Gas(1))
+    }
+}
+
+impl<T> GasSizeOf for Option<T>
+where
+    T: GasSizeOf,
+{
+    fn gas_size_of(&self) -> Gas {
+        if let Some(v) = self {
+            Gas(1) + v.gas_size_of()
+        } else {
+            Gas(1)
+        }
+    }
+}
+
+impl GasSizeOf for BigInt {
+    fn gas_size_of(&self) -> Gas {
+        // Add one to always have an upper bound on the number of bytes required to represent the
+        // number, and so that `0` has a size of 1.
+        let n_bytes = self.bits() / 8 + 1;
+        n_bytes.saturating_into()
+    }
+}
+
+impl GasSizeOf for BigDecimal {
+    fn gas_size_of(&self) -> Gas {
+        let (int, _) = self.as_bigint_and_exponent();
+        BigInt::from(int).gas_size_of()
+    }
+}
+
+impl GasSizeOf for str {
+    fn gas_size_of(&self) -> Gas {
+        self.len().saturating_into()
+    }
+}
+
+impl GasSizeOf for String {
+    fn gas_size_of(&self) -> Gas {
+        self.as_str().gas_size_of()
+    }
+}
+
+impl<K, V, S> GasSizeOf for std::collections::HashMap<K, V, S>
+where
+    K: GasSizeOf,
+    V: GasSizeOf,
+{
+    fn gas_size_of(&self) -> Gas {
+        let members = match (K::const_gas_size_of(), V::const_gas_size_of()) {
+            (Some(k_gas), None) => {
+                self.values().map(|v| v.gas_size_of()).sum::<Gas>() + k_gas * self.len()
+            }
+            (None, Some(v_gas)) => {
+                self.keys().map(|k| k.gas_size_of()).sum::<Gas>() + v_gas * self.len()
+            }
+            (Some(k_gas), Some(v_gas)) => (k_gas + v_gas) * self.len(),
+            (None, None) => self
+                .iter()
+                .map(|(k, v)| k.gas_size_of() + v.gas_size_of())
+                .sum(),
+        };
+        members + Gas(32) + (Gas(8) * self.len())
+    }
+}
+
+impl<T> GasSizeOf for &[T]
+where
+    T: GasSizeOf,
+{
+    fn gas_size_of(&self) -> Gas {
+        if let Some(gas) = T::const_gas_size_of() {
+            gas * self.len()
+        } else {
+            self.iter().map(|e| e.gas_size_of()).sum()
+        }
+    }
+}
+
+impl<T> GasSizeOf for Vec<T>
+where
+    T: GasSizeOf,
+{
+    fn gas_size_of(&self) -> Gas {
+        let members = (&self[..]).gas_size_of();
+        // Overhead for Vec so that Vec<Vec<T>> is more expensive than Vec<T>
+        members + Gas(16) + self.len().saturating_into()
+    }
+}
+
+impl<T: ?Sized> GasSizeOf for &T
+where
+    T: GasSizeOf,
+{
+    #[inline(always)]
+    fn gas_size_of(&self) -> Gas {
+        <T as GasSizeOf>::gas_size_of(*self)
+    }
+
+    #[inline(always)]
+    fn const_gas_size_of() -> Option<Gas> {
+        T::const_gas_size_of()
+    }
+}
+
+macro_rules! int_gas {
+    ($($name: ident),*) => {
+        $(
+            impl GasSizeOf for $name {
+                #[inline(always)]
+                fn const_gas_size_of() -> Option<Gas> {
+                    Some(std::mem::size_of::<$name>().saturating_into())
+                }
+            }
+        )*
+    }
+}
+
+int_gas!(u8, i8, u16, i16, u32, i32, u64, i64, u128, i128);
+
+impl GasSizeOf for usize {
+    fn const_gas_size_of() -> Option<Gas> {
+        // Must be the same regardless of platform.
+        u64::const_gas_size_of()
+    }
+}
+
+impl GasSizeOf for EntityKey {
+    fn gas_size_of(&self) -> Gas {
+        self.entity_type.gas_size_of() + self.entity_id.gas_size_of()
+    }
+}
+
+impl GasSizeOf for EntityType {
+    fn gas_size_of(&self) -> Gas {
+        self.as_str().gas_size_of()
+    }
+}
diff --git a/graph/src/runtime/mod.rs b/graph/src/runtime/mod.rs
new file mode 100644
index 0000000..14128e6
--- /dev/null
+++ b/graph/src/runtime/mod.rs
@@ -0,0 +1,452 @@
+//! Facilities for creating and reading objects on the memory of an AssemblyScript (Asc) WASM
+//! module. Objects are passed through the `asc_new` and `asc_get` methods of an `AscHeap`
+//! implementation. These methods take types that implement `To`/`FromAscObj` and are therefore
+//! convertible to/from an `AscType`.
+
+pub mod gas;
+
+mod asc_heap;
+mod asc_ptr;
+
+pub use asc_heap::{
+    asc_get, asc_new, asc_new_or_missing, asc_new_or_null, AscHeap, FromAscObj, ToAscObj,
+};
+pub use asc_ptr::AscPtr;
+
+use anyhow::Error;
+use semver::Version;
+use std::convert::TryInto;
+use std::fmt;
+use std::mem::size_of;
+
+use self::gas::GasCounter;
+
+/// Marker trait for AssemblyScript types that the id should
+/// be in the header.
+pub trait AscIndexId {
+    /// Constant string with the name of the type in AssemblyScript.
+    /// This is used to get the identifier for the type in memory layout.
+    /// Info about memory layout:
+    /// https://www.assemblyscript.org/memory.html#common-header-layout.
+    /// Info about identifier (`idof<T>`):
+    /// https://www.assemblyscript.org/garbage-collection.html#runtime-interface
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId;
+}
+
+/// A type that has a direct correspondence to an Asc type.
+///
+/// This can be derived for structs that are `#[repr(C)]`, contain no padding
+/// and whose fields are all `AscValue`. Enums can derive if they are `#[repr(u32)]`.
+///
+/// Special classes like `ArrayBuffer` use custom impls.
+///
+/// See https://github.com/graphprotocol/graph-node/issues/607 for more considerations.
+pub trait AscType: Sized {
+    /// Transform the Rust representation of this instance into an sequence of
+    /// bytes that is precisely the memory layout of a corresponding Asc instance.
+    fn to_asc_bytes(&self) -> Result<Vec<u8>, DeterministicHostError>;
+
+    /// The Rust representation of an Asc object as layed out in Asc memory.
+    fn from_asc_bytes(
+        asc_obj: &[u8],
+        api_version: &Version,
+    ) -> Result<Self, DeterministicHostError>;
+
+    fn content_len(&self, asc_bytes: &[u8]) -> usize {
+        asc_bytes.len()
+    }
+
+    /// Size of the corresponding Asc instance in bytes.
+    /// Only used for version <= 0.0.3.
+    fn asc_size<H: AscHeap + ?Sized>(
+        _ptr: AscPtr<Self>,
+        _heap: &H,
+        _gas: &GasCounter,
+    ) -> Result<u32, DeterministicHostError> {
+        Ok(std::mem::size_of::<Self>() as u32)
+    }
+}
+
+// Only implemented because of structs that derive AscType and
+// contain fields that are PhantomData.
+impl<T> AscType for std::marker::PhantomData<T> {
+    fn to_asc_bytes(&self) -> Result<Vec<u8>, DeterministicHostError> {
+        Ok(vec![])
+    }
+
+    fn from_asc_bytes(
+        asc_obj: &[u8],
+        _api_version: &Version,
+    ) -> Result<Self, DeterministicHostError> {
+        assert!(asc_obj.is_empty());
+
+        Ok(Self)
+    }
+}
+
+/// An Asc primitive or an `AscPtr` into the Asc heap. A type marked as
+/// `AscValue` must have the same byte representation in Rust and Asc, including
+/// same size, and size must be equal to alignment.
+pub trait AscValue: AscType + Copy + Default {}
+
+impl AscType for bool {
+    fn to_asc_bytes(&self) -> Result<Vec<u8>, DeterministicHostError> {
+        Ok(vec![*self as u8])
+    }
+
+    fn from_asc_bytes(
+        asc_obj: &[u8],
+        _api_version: &Version,
+    ) -> Result<Self, DeterministicHostError> {
+        if asc_obj.len() != 1 {
+            Err(DeterministicHostError::from(anyhow::anyhow!(
+                "Incorrect size for bool. Expected 1, got {},",
+                asc_obj.len()
+            )))
+        } else {
+            Ok(asc_obj[0] != 0)
+        }
+    }
+}
+
+impl AscValue for bool {}
+impl<T> AscValue for AscPtr<T> {}
+
+macro_rules! impl_asc_type {
+    ($($T:ty),*) => {
+        $(
+            impl AscType for $T {
+                fn to_asc_bytes(&self) -> Result<Vec<u8>, DeterministicHostError> {
+                    Ok(self.to_le_bytes().to_vec())
+                }
+
+                fn from_asc_bytes(asc_obj: &[u8], _api_version: &Version) -> Result<Self, DeterministicHostError> {
+                    let bytes = asc_obj.try_into().map_err(|_| {
+                        DeterministicHostError::from(anyhow::anyhow!(
+                            "Incorrect size for {}. Expected {}, got {},",
+                            stringify!($T),
+                            size_of::<Self>(),
+                            asc_obj.len()
+                        ))
+                    })?;
+
+                    Ok(Self::from_le_bytes(bytes))
+                }
+            }
+
+            impl AscValue for $T {}
+        )*
+    };
+}
+
+impl_asc_type!(u8, u16, u32, u64, i8, i32, i64, f32, f64);
+
+/// Contains type IDs and their discriminants for every blockchain supported by Graph-Node.
+///
+/// Each variant corresponds to the unique ID of an AssemblyScript concrete class used in the
+/// [`runtime`].
+///
+/// # Rules for updating this enum
+///
+/// 1 .The discriminants must have the same value as their counterparts in `TypeId` enum from
+///    graph-ts' `global` module. If not, the runtime will fail to determine the correct class
+///    during allocation.
+/// 2. Each supported blockchain has a reserved space of 1,000 contiguous variants.
+/// 3. Once defined, items and their discriminants cannot be changed, as this would break running
+///    subgraphs compiled in previous versions of this representation.
+#[repr(u32)]
+#[derive(Copy, Clone, Debug)]
+pub enum IndexForAscTypeId {
+    // Ethereum type IDs
+    String = 0,
+    ArrayBuffer = 1,
+    Int8Array = 2,
+    Int16Array = 3,
+    Int32Array = 4,
+    Int64Array = 5,
+    Uint8Array = 6,
+    Uint16Array = 7,
+    Uint32Array = 8,
+    Uint64Array = 9,
+    Float32Array = 10,
+    Float64Array = 11,
+    BigDecimal = 12,
+    ArrayBool = 13,
+    ArrayUint8Array = 14,
+    ArrayEthereumValue = 15,
+    ArrayStoreValue = 16,
+    ArrayJsonValue = 17,
+    ArrayString = 18,
+    ArrayEventParam = 19,
+    ArrayTypedMapEntryStringJsonValue = 20,
+    ArrayTypedMapEntryStringStoreValue = 21,
+    SmartContractCall = 22,
+    EventParam = 23,
+    EthereumTransaction = 24,
+    EthereumBlock = 25,
+    EthereumCall = 26,
+    WrappedTypedMapStringJsonValue = 27,
+    WrappedBool = 28,
+    WrappedJsonValue = 29,
+    EthereumValue = 30,
+    StoreValue = 31,
+    JsonValue = 32,
+    EthereumEvent = 33,
+    TypedMapEntryStringStoreValue = 34,
+    TypedMapEntryStringJsonValue = 35,
+    TypedMapStringStoreValue = 36,
+    TypedMapStringJsonValue = 37,
+    TypedMapStringTypedMapStringJsonValue = 38,
+    ResultTypedMapStringJsonValueBool = 39,
+    ResultJsonValueBool = 40,
+    ArrayU8 = 41,
+    ArrayU16 = 42,
+    ArrayU32 = 43,
+    ArrayU64 = 44,
+    ArrayI8 = 45,
+    ArrayI16 = 46,
+    ArrayI32 = 47,
+    ArrayI64 = 48,
+    ArrayF32 = 49,
+    ArrayF64 = 50,
+    ArrayBigDecimal = 51,
+
+    // Near Type IDs
+    NearArrayDataReceiver = 52,
+    NearArrayCryptoHash = 53,
+    NearArrayActionEnum = 54,
+    NearArrayMerklePathItem = 55,
+    NearArrayValidatorStake = 56,
+    NearArraySlashedValidator = 57,
+    NearArraySignature = 58,
+    NearArrayChunkHeader = 59,
+    NearAccessKeyPermissionEnum = 60,
+    NearActionEnum = 61,
+    NearDirectionEnum = 62,
+    NearPublicKey = 63,
+    NearSignature = 64,
+    NearFunctionCallPermission = 65,
+    NearFullAccessPermission = 66,
+    NearAccessKey = 67,
+    NearDataReceiver = 68,
+    NearCreateAccountAction = 69,
+    NearDeployContractAction = 70,
+    NearFunctionCallAction = 71,
+    NearTransferAction = 72,
+    NearStakeAction = 73,
+    NearAddKeyAction = 74,
+    NearDeleteKeyAction = 75,
+    NearDeleteAccountAction = 76,
+    NearActionReceipt = 77,
+    NearSuccessStatusEnum = 78,
+    NearMerklePathItem = 79,
+    NearExecutionOutcome = 80,
+    NearSlashedValidator = 81,
+    NearBlockHeader = 82,
+    NearValidatorStake = 83,
+    NearChunkHeader = 84,
+    NearBlock = 85,
+    NearReceiptWithOutcome = 86,
+    // Reserved discriminant space for more Near type IDs: [87, 999]:
+    // Continue to add more Near type IDs here.
+    // e.g.:
+    // NextNearType = 87,
+    // AnotherNearType = 88,
+    // ...
+    // LastNearType = 999,
+
+    // Reserved discriminant space for more Ethereum type IDs: [1000, 1499]
+    TransactionReceipt = 1000,
+    Log = 1001,
+    ArrayH256 = 1002,
+    ArrayLog = 1003,
+    // Continue to add more Ethereum type IDs here.
+    // e.g.:
+    // NextEthereumType = 1004,
+    // AnotherEthereumType = 1005,
+    // ...
+    // LastEthereumType = 1499,
+
+    // Reserved discriminant space for Cosmos type IDs: [1,500, 2,499]
+    CosmosAny = 1500,
+    CosmosAnyArray = 1501,
+    CosmosBytesArray = 1502,
+    CosmosCoinArray = 1503,
+    CosmosCommitSigArray = 1504,
+    CosmosEventArray = 1505,
+    CosmosEventAttributeArray = 1506,
+    CosmosEvidenceArray = 1507,
+    CosmosModeInfoArray = 1508,
+    CosmosSignerInfoArray = 1509,
+    CosmosTxResultArray = 1510,
+    CosmosValidatorArray = 1511,
+    CosmosValidatorUpdateArray = 1512,
+    CosmosAuthInfo = 1513,
+    CosmosBlock = 1514,
+    CosmosBlockId = 1515,
+    CosmosBlockIdFlagEnum = 1516,
+    CosmosBlockParams = 1517,
+    CosmosCoin = 1518,
+    CosmosCommit = 1519,
+    CosmosCommitSig = 1520,
+    CosmosCompactBitArray = 1521,
+    CosmosConsensus = 1522,
+    CosmosConsensusParams = 1523,
+    CosmosDuplicateVoteEvidence = 1524,
+    CosmosDuration = 1525,
+    CosmosEvent = 1526,
+    CosmosEventAttribute = 1527,
+    CosmosEventData = 1528,
+    CosmosEventVote = 1529,
+    CosmosEvidence = 1530,
+    CosmosEvidenceList = 1531,
+    CosmosEvidenceParams = 1532,
+    CosmosFee = 1533,
+    CosmosHeader = 1534,
+    CosmosHeaderOnlyBlock = 1535,
+    CosmosLightBlock = 1536,
+    CosmosLightClientAttackEvidence = 1537,
+    CosmosModeInfo = 1538,
+    CosmosModeInfoMulti = 1539,
+    CosmosModeInfoSingle = 1540,
+    CosmosPartSetHeader = 1541,
+    CosmosPublicKey = 1542,
+    CosmosResponseBeginBlock = 1543,
+    CosmosResponseDeliverTx = 1544,
+    CosmosResponseEndBlock = 1545,
+    CosmosSignModeEnum = 1546,
+    CosmosSignedHeader = 1547,
+    CosmosSignedMsgTypeEnum = 1548,
+    CosmosSignerInfo = 1549,
+    CosmosTimestamp = 1550,
+    CosmosTip = 1551,
+    CosmosTransactionData = 1552,
+    CosmosTx = 1553,
+    CosmosTxBody = 1554,
+    CosmosTxResult = 1555,
+    CosmosValidator = 1556,
+    CosmosValidatorParams = 1557,
+    CosmosValidatorSet = 1558,
+    CosmosValidatorSetUpdates = 1559,
+    CosmosValidatorUpdate = 1560,
+    CosmosVersionParams = 1561,
+
+    // Continue to add more Cosmos type IDs here.
+    // e.g.:
+    // NextCosmosType = 1562,
+    // AnotherCosmosType = 1563,
+    // ...
+    // LastCosmosType = 2499,
+
+    // Arweave types
+    ArweaveBlock = 2500,
+    ArweaveProofOfAccess = 2501,
+    ArweaveTag = 2502,
+    ArweaveTagArray = 2503,
+    ArweaveTransaction = 2504,
+    ArweaveTransactionArray = 2505,
+    ArweaveTransactionWithBlockPtr = 2506,
+    // Continue to add more Arweave type IDs here.
+    // e.g.:
+    // NextArweaveType = 2507,
+    // AnotherArweaveType = 2508,
+    // ...
+    // LastArweaveType = 3499,
+
+    // Reserved discriminant space for a future blockchain type IDs: [3,500, 4,499]
+    //
+    // Generated with the following shell script:
+    //
+    // ```
+    // grep -Po "(?<=IndexForAscTypeId::)IDENDIFIER_PREFIX.*\b" SRC_FILE | sort |uniq | awk 'BEGIN{count=2500} {sub("$", " = "count",", $1); count++} 1'
+    // ```
+    //
+    // INSTRUCTIONS:
+    // 1. Replace the IDENTIFIER_PREFIX and the SRC_FILE placeholders according to the blockchain
+    //    name and implementation before running this script.
+    // 2. Replace `3500` part with the first number of that blockchain's reserved discriminant space.
+    // 3. Insert the output right before the end of this block.
+    UnitTestNetworkUnitTestTypeU32 = u32::MAX - 7,
+    UnitTestNetworkUnitTestTypeU32Array = u32::MAX - 6,
+
+    UnitTestNetworkUnitTestTypeU16 = u32::MAX - 5,
+    UnitTestNetworkUnitTestTypeU16Array = u32::MAX - 4,
+
+    UnitTestNetworkUnitTestTypeI8 = u32::MAX - 3,
+    UnitTestNetworkUnitTestTypeI8Array = u32::MAX - 2,
+
+    UnitTestNetworkUnitTestTypeBool = u32::MAX - 1,
+    UnitTestNetworkUnitTestTypeBoolArray = u32::MAX,
+}
+
+impl ToAscObj<u32> for IndexForAscTypeId {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        _heap: &mut H,
+        _gas: &GasCounter,
+    ) -> Result<u32, DeterministicHostError> {
+        Ok(*self as u32)
+    }
+}
+
+#[derive(Debug)]
+pub enum DeterministicHostError {
+    Gas(Error),
+    Other(Error),
+}
+
+impl DeterministicHostError {
+    pub fn gas(e: Error) -> Self {
+        DeterministicHostError::Gas(e)
+    }
+
+    pub fn inner(self) -> Error {
+        match self {
+            DeterministicHostError::Gas(e) | DeterministicHostError::Other(e) => e,
+        }
+    }
+}
+
+impl fmt::Display for DeterministicHostError {
+    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
+        match self {
+            DeterministicHostError::Gas(e) | DeterministicHostError::Other(e) => e.fmt(f),
+        }
+    }
+}
+
+impl From<Error> for DeterministicHostError {
+    fn from(e: Error) -> DeterministicHostError {
+        DeterministicHostError::Other(e)
+    }
+}
+
+impl std::error::Error for DeterministicHostError {}
+
+#[derive(thiserror::Error, Debug)]
+pub enum HostExportError {
+    #[error("{0:#}")]
+    Unknown(#[from] anyhow::Error),
+
+    #[error("{0:#}")]
+    PossibleReorg(anyhow::Error),
+
+    #[error("{0:#}")]
+    Deterministic(anyhow::Error),
+}
+
+impl From<DeterministicHostError> for HostExportError {
+    fn from(value: DeterministicHostError) -> Self {
+        match value {
+            // Until we are confident on the gas numbers, gas errors are not deterministic
+            DeterministicHostError::Gas(e) => HostExportError::Unknown(e),
+            DeterministicHostError::Other(e) => HostExportError::Deterministic(e),
+        }
+    }
+}
+
+pub const HEADER_SIZE: usize = 20;
+
+pub fn padding_to_16(content_length: usize) -> usize {
+    (16 - (HEADER_SIZE + content_length) % 16) % 16
+}
diff --git a/graph/src/substreams/codec.rs b/graph/src/substreams/codec.rs
new file mode 100644
index 0000000..23edcc3
--- /dev/null
+++ b/graph/src/substreams/codec.rs
@@ -0,0 +1,5 @@
+#[rustfmt::skip]
+#[path = "sf.substreams.v1.rs"]
+mod pbsubstreams;
+
+pub use pbsubstreams::*;
diff --git a/graph/src/substreams/mod.rs b/graph/src/substreams/mod.rs
new file mode 100644
index 0000000..38e96fd
--- /dev/null
+++ b/graph/src/substreams/mod.rs
@@ -0,0 +1,3 @@
+mod codec;
+
+pub use codec::*;
diff --git a/graph/src/substreams/sf.substreams.v1.rs b/graph/src/substreams/sf.substreams.v1.rs
new file mode 100644
index 0000000..0f81ea7
--- /dev/null
+++ b/graph/src/substreams/sf.substreams.v1.rs
@@ -0,0 +1,616 @@
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct Request {
+    #[prost(int64, tag="1")]
+    pub start_block_num: i64,
+    #[prost(string, tag="2")]
+    pub start_cursor: ::prost::alloc::string::String,
+    #[prost(uint64, tag="3")]
+    pub stop_block_num: u64,
+    #[prost(enumeration="ForkStep", repeated, tag="4")]
+    pub fork_steps: ::prost::alloc::vec::Vec<i32>,
+    #[prost(string, tag="5")]
+    pub irreversibility_condition: ::prost::alloc::string::String,
+    #[prost(message, optional, tag="6")]
+    pub modules: ::core::option::Option<Modules>,
+    #[prost(string, repeated, tag="7")]
+    pub output_modules: ::prost::alloc::vec::Vec<::prost::alloc::string::String>,
+    #[prost(string, repeated, tag="8")]
+    pub initial_store_snapshot_for_modules: ::prost::alloc::vec::Vec<::prost::alloc::string::String>,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct Response {
+    #[prost(oneof="response::Message", tags="1, 2, 3, 4")]
+    pub message: ::core::option::Option<response::Message>,
+}
+/// Nested message and enum types in `Response`.
+pub mod response {
+    #[derive(Clone, PartialEq, ::prost::Oneof)]
+    pub enum Message {
+        /// Progress of data preparation, before sending in the stream of `data` events.
+        #[prost(message, tag="1")]
+        Progress(super::ModulesProgress),
+        #[prost(message, tag="2")]
+        SnapshotData(super::InitialSnapshotData),
+        #[prost(message, tag="3")]
+        SnapshotComplete(super::InitialSnapshotComplete),
+        #[prost(message, tag="4")]
+        Data(super::BlockScopedData),
+    }
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct InitialSnapshotComplete {
+    #[prost(string, tag="1")]
+    pub cursor: ::prost::alloc::string::String,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct InitialSnapshotData {
+    #[prost(string, tag="1")]
+    pub module_name: ::prost::alloc::string::String,
+    #[prost(message, optional, tag="2")]
+    pub deltas: ::core::option::Option<StoreDeltas>,
+    #[prost(uint64, tag="4")]
+    pub sent_keys: u64,
+    #[prost(uint64, tag="3")]
+    pub total_keys: u64,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct BlockScopedData {
+    #[prost(message, repeated, tag="1")]
+    pub outputs: ::prost::alloc::vec::Vec<ModuleOutput>,
+    #[prost(message, optional, tag="3")]
+    pub clock: ::core::option::Option<Clock>,
+    #[prost(enumeration="ForkStep", tag="6")]
+    pub step: i32,
+    #[prost(string, tag="10")]
+    pub cursor: ::prost::alloc::string::String,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct ModuleOutput {
+    #[prost(string, tag="1")]
+    pub name: ::prost::alloc::string::String,
+    #[prost(string, repeated, tag="4")]
+    pub logs: ::prost::alloc::vec::Vec<::prost::alloc::string::String>,
+    /// LogsTruncated is a flag that tells you if you received all the logs or if they
+    /// were truncated because you logged too much (fixed limit currently is set to 128 KiB).
+    #[prost(bool, tag="5")]
+    pub logs_truncated: bool,
+    #[prost(oneof="module_output::Data", tags="2, 3")]
+    pub data: ::core::option::Option<module_output::Data>,
+}
+/// Nested message and enum types in `ModuleOutput`.
+pub mod module_output {
+    #[derive(Clone, PartialEq, ::prost::Oneof)]
+    pub enum Data {
+        #[prost(message, tag="2")]
+        MapOutput(::prost_types::Any),
+        #[prost(message, tag="3")]
+        StoreDeltas(super::StoreDeltas),
+    }
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct ModulesProgress {
+    #[prost(message, repeated, tag="1")]
+    pub modules: ::prost::alloc::vec::Vec<ModuleProgress>,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct ModuleProgress {
+    #[prost(string, tag="1")]
+    pub name: ::prost::alloc::string::String,
+    #[prost(oneof="module_progress::Type", tags="2, 3, 4, 5")]
+    pub r#type: ::core::option::Option<module_progress::Type>,
+}
+/// Nested message and enum types in `ModuleProgress`.
+pub mod module_progress {
+    #[derive(Clone, PartialEq, ::prost::Message)]
+    pub struct ProcessedRange {
+        #[prost(message, repeated, tag="1")]
+        pub processed_ranges: ::prost::alloc::vec::Vec<super::BlockRange>,
+    }
+    #[derive(Clone, PartialEq, ::prost::Message)]
+    pub struct InitialState {
+        #[prost(uint64, tag="2")]
+        pub available_up_to_block: u64,
+    }
+    #[derive(Clone, PartialEq, ::prost::Message)]
+    pub struct ProcessedBytes {
+        #[prost(uint64, tag="1")]
+        pub total_bytes_read: u64,
+        #[prost(uint64, tag="2")]
+        pub total_bytes_written: u64,
+    }
+    #[derive(Clone, PartialEq, ::prost::Message)]
+    pub struct Failed {
+        #[prost(string, tag="1")]
+        pub reason: ::prost::alloc::string::String,
+        #[prost(string, repeated, tag="2")]
+        pub logs: ::prost::alloc::vec::Vec<::prost::alloc::string::String>,
+        /// FailureLogsTruncated is a flag that tells you if you received all the logs or if they
+        /// were truncated because you logged too much (fixed limit currently is set to 128 KiB).
+        #[prost(bool, tag="3")]
+        pub logs_truncated: bool,
+    }
+    #[derive(Clone, PartialEq, ::prost::Oneof)]
+    pub enum Type {
+        #[prost(message, tag="2")]
+        ProcessedRanges(ProcessedRange),
+        #[prost(message, tag="3")]
+        InitialState(InitialState),
+        #[prost(message, tag="4")]
+        ProcessedBytes(ProcessedBytes),
+        #[prost(message, tag="5")]
+        Failed(Failed),
+    }
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct BlockRange {
+    #[prost(uint64, tag="1")]
+    pub start_block: u64,
+    #[prost(uint64, tag="2")]
+    pub end_block: u64,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct StoreDeltas {
+    #[prost(message, repeated, tag="1")]
+    pub deltas: ::prost::alloc::vec::Vec<StoreDelta>,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct StoreDelta {
+    #[prost(enumeration="store_delta::Operation", tag="1")]
+    pub operation: i32,
+    #[prost(uint64, tag="2")]
+    pub ordinal: u64,
+    #[prost(string, tag="3")]
+    pub key: ::prost::alloc::string::String,
+    #[prost(bytes="vec", tag="4")]
+    pub old_value: ::prost::alloc::vec::Vec<u8>,
+    #[prost(bytes="vec", tag="5")]
+    pub new_value: ::prost::alloc::vec::Vec<u8>,
+}
+/// Nested message and enum types in `StoreDelta`.
+pub mod store_delta {
+    #[derive(Clone, Copy, Debug, PartialEq, Eq, Hash, PartialOrd, Ord, ::prost::Enumeration)]
+    #[repr(i32)]
+    pub enum Operation {
+        Unset = 0,
+        Create = 1,
+        Update = 2,
+        Delete = 3,
+    }
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct Output {
+    #[prost(uint64, tag="1")]
+    pub block_num: u64,
+    #[prost(string, tag="2")]
+    pub block_id: ::prost::alloc::string::String,
+    #[prost(message, optional, tag="4")]
+    pub timestamp: ::core::option::Option<::prost_types::Timestamp>,
+    #[prost(message, optional, tag="10")]
+    pub value: ::core::option::Option<::prost_types::Any>,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct Modules {
+    #[prost(message, repeated, tag="1")]
+    pub modules: ::prost::alloc::vec::Vec<Module>,
+    #[prost(message, repeated, tag="2")]
+    pub binaries: ::prost::alloc::vec::Vec<Binary>,
+}
+/// Binary represents some code compiled to its binary form.
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct Binary {
+    #[prost(string, tag="1")]
+    pub r#type: ::prost::alloc::string::String,
+    #[prost(bytes="vec", tag="2")]
+    pub content: ::prost::alloc::vec::Vec<u8>,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct Module {
+    #[prost(string, tag="1")]
+    pub name: ::prost::alloc::string::String,
+    #[prost(uint32, tag="4")]
+    pub binary_index: u32,
+    #[prost(string, tag="5")]
+    pub binary_entrypoint: ::prost::alloc::string::String,
+    #[prost(message, repeated, tag="6")]
+    pub inputs: ::prost::alloc::vec::Vec<module::Input>,
+    #[prost(message, optional, tag="7")]
+    pub output: ::core::option::Option<module::Output>,
+    #[prost(uint64, tag="8")]
+    pub initial_block: u64,
+    #[prost(oneof="module::Kind", tags="2, 3")]
+    pub kind: ::core::option::Option<module::Kind>,
+}
+/// Nested message and enum types in `Module`.
+pub mod module {
+    #[derive(Clone, PartialEq, ::prost::Message)]
+    pub struct KindMap {
+        #[prost(string, tag="1")]
+        pub output_type: ::prost::alloc::string::String,
+    }
+    #[derive(Clone, PartialEq, ::prost::Message)]
+    pub struct KindStore {
+        /// The `update_policy` determines the functions available to mutate the store
+        /// (like `set()`, `set_if_not_exists()` or `sum()`, etc..) in
+        /// order to ensure that parallel operations are possible and deterministic
+        ///
+        /// Say a store cumulates keys from block 0 to 1M, and a second store
+        /// cumulates keys from block 1M to 2M. When we want to use this
+        /// store as a dependency for a downstream module, we will merge the
+        /// two stores according to this policy.
+        #[prost(enumeration="kind_store::UpdatePolicy", tag="1")]
+        pub update_policy: i32,
+        #[prost(string, tag="2")]
+        pub value_type: ::prost::alloc::string::String,
+    }
+    /// Nested message and enum types in `KindStore`.
+    pub mod kind_store {
+        #[derive(Clone, Copy, Debug, PartialEq, Eq, Hash, PartialOrd, Ord, ::prost::Enumeration)]
+        #[repr(i32)]
+        pub enum UpdatePolicy {
+            Unset = 0,
+            /// Provides a store where you can `set()` keys, and the latest key wins
+            Set = 1,
+            /// Provides a store where you can `set_if_not_exists()` keys, and the first key wins
+            SetIfNotExists = 2,
+            /// Provides a store where you can `add_*()` keys, where two stores merge by summing its values.
+            Add = 3,
+            /// Provides a store where you can `min_*()` keys, where two stores merge by leaving the minimum value.
+            Min = 4,
+            /// Provides a store where you can `max_*()` keys, where two stores merge by leaving the maximum value.
+            Max = 5,
+        }
+    }
+    #[derive(Clone, PartialEq, ::prost::Message)]
+    pub struct Input {
+        #[prost(oneof="input::Input", tags="1, 2, 3")]
+        pub input: ::core::option::Option<input::Input>,
+    }
+    /// Nested message and enum types in `Input`.
+    pub mod input {
+        #[derive(Clone, PartialEq, ::prost::Message)]
+        pub struct Source {
+            /// ex: "sf.ethereum.type.v1.Block"
+            #[prost(string, tag="1")]
+            pub r#type: ::prost::alloc::string::String,
+        }
+        #[derive(Clone, PartialEq, ::prost::Message)]
+        pub struct Map {
+            /// ex: "block_to_pairs"
+            #[prost(string, tag="1")]
+            pub module_name: ::prost::alloc::string::String,
+        }
+        #[derive(Clone, PartialEq, ::prost::Message)]
+        pub struct Store {
+            #[prost(string, tag="1")]
+            pub module_name: ::prost::alloc::string::String,
+            #[prost(enumeration="store::Mode", tag="2")]
+            pub mode: i32,
+        }
+        /// Nested message and enum types in `Store`.
+        pub mod store {
+            #[derive(Clone, Copy, Debug, PartialEq, Eq, Hash, PartialOrd, Ord, ::prost::Enumeration)]
+            #[repr(i32)]
+            pub enum Mode {
+                Unset = 0,
+                Get = 1,
+                Deltas = 2,
+            }
+        }
+        #[derive(Clone, PartialEq, ::prost::Oneof)]
+        pub enum Input {
+            #[prost(message, tag="1")]
+            Source(Source),
+            #[prost(message, tag="2")]
+            Map(Map),
+            #[prost(message, tag="3")]
+            Store(Store),
+        }
+    }
+    #[derive(Clone, PartialEq, ::prost::Message)]
+    pub struct Output {
+        #[prost(string, tag="1")]
+        pub r#type: ::prost::alloc::string::String,
+    }
+    #[derive(Clone, PartialEq, ::prost::Oneof)]
+    pub enum Kind {
+        #[prost(message, tag="2")]
+        KindMap(KindMap),
+        #[prost(message, tag="3")]
+        KindStore(KindStore),
+    }
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct Clock {
+    #[prost(string, tag="1")]
+    pub id: ::prost::alloc::string::String,
+    #[prost(uint64, tag="2")]
+    pub number: u64,
+    #[prost(message, optional, tag="3")]
+    pub timestamp: ::core::option::Option<::prost_types::Timestamp>,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct Package {
+    /// Needs to be one so this file can be used _directly_ as a
+    /// buf `Image` andor a ProtoSet for grpcurl and other tools
+    #[prost(message, repeated, tag="1")]
+    pub proto_files: ::prost::alloc::vec::Vec<::prost_types::FileDescriptorProto>,
+    #[prost(uint64, tag="5")]
+    pub version: u64,
+    #[prost(message, optional, tag="6")]
+    pub modules: ::core::option::Option<Modules>,
+    #[prost(message, repeated, tag="7")]
+    pub module_meta: ::prost::alloc::vec::Vec<ModuleMetadata>,
+    #[prost(message, repeated, tag="8")]
+    pub package_meta: ::prost::alloc::vec::Vec<PackageMetadata>,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct PackageMetadata {
+    #[prost(string, tag="1")]
+    pub version: ::prost::alloc::string::String,
+    #[prost(string, tag="2")]
+    pub url: ::prost::alloc::string::String,
+    #[prost(string, tag="3")]
+    pub name: ::prost::alloc::string::String,
+    #[prost(string, tag="4")]
+    pub doc: ::prost::alloc::string::String,
+}
+#[derive(Clone, PartialEq, ::prost::Message)]
+pub struct ModuleMetadata {
+    /// Corresponds to the index in `Package.metadata.package_meta`
+    #[prost(uint64, tag="1")]
+    pub package_index: u64,
+    #[prost(string, tag="2")]
+    pub doc: ::prost::alloc::string::String,
+}
+#[derive(Clone, Copy, Debug, PartialEq, Eq, Hash, PartialOrd, Ord, ::prost::Enumeration)]
+#[repr(i32)]
+pub enum ForkStep {
+    StepUnknown = 0,
+    /// Block is new head block of the chain, that is linear with the previous block
+    StepNew = 1,
+    /// Block is now forked and should be undone, it's not the head block of the chain anymore
+    StepUndo = 2,
+    /// Block is now irreversible and can be committed to (finality is chain specific, see chain documentation for more details)
+    StepIrreversible = 4,
+}
+/// Generated client implementations.
+pub mod stream_client {
+    #![allow(unused_variables, dead_code, missing_docs, clippy::let_unit_value)]
+    use tonic::codegen::*;
+    #[derive(Debug, Clone)]
+    pub struct StreamClient<T> {
+        inner: tonic::client::Grpc<T>,
+    }
+    impl StreamClient<tonic::transport::Channel> {
+        /// Attempt to create a new client by connecting to a given endpoint.
+        pub async fn connect<D>(dst: D) -> Result<Self, tonic::transport::Error>
+        where
+            D: std::convert::TryInto<tonic::transport::Endpoint>,
+            D::Error: Into<StdError>,
+        {
+            let conn = tonic::transport::Endpoint::new(dst)?.connect().await?;
+            Ok(Self::new(conn))
+        }
+    }
+    impl<T> StreamClient<T>
+    where
+        T: tonic::client::GrpcService<tonic::body::BoxBody>,
+        T::Error: Into<StdError>,
+        T::ResponseBody: Body<Data = Bytes> + Send + 'static,
+        <T::ResponseBody as Body>::Error: Into<StdError> + Send,
+    {
+        pub fn new(inner: T) -> Self {
+            let inner = tonic::client::Grpc::new(inner);
+            Self { inner }
+        }
+        pub fn with_interceptor<F>(
+            inner: T,
+            interceptor: F,
+        ) -> StreamClient<InterceptedService<T, F>>
+        where
+            F: tonic::service::Interceptor,
+            T::ResponseBody: Default,
+            T: tonic::codegen::Service<
+                http::Request<tonic::body::BoxBody>,
+                Response = http::Response<
+                    <T as tonic::client::GrpcService<tonic::body::BoxBody>>::ResponseBody,
+                >,
+            >,
+            <T as tonic::codegen::Service<
+                http::Request<tonic::body::BoxBody>,
+            >>::Error: Into<StdError> + Send + Sync,
+        {
+            StreamClient::new(InterceptedService::new(inner, interceptor))
+        }
+        /// Compress requests with `gzip`.
+        ///
+        /// This requires the server to support it otherwise it might respond with an
+        /// error.
+        #[must_use]
+        pub fn send_gzip(mut self) -> Self {
+            self.inner = self.inner.send_gzip();
+            self
+        }
+        /// Enable decompressing responses with `gzip`.
+        #[must_use]
+        pub fn accept_gzip(mut self) -> Self {
+            self.inner = self.inner.accept_gzip();
+            self
+        }
+        pub async fn blocks(
+            &mut self,
+            request: impl tonic::IntoRequest<super::Request>,
+        ) -> Result<
+                tonic::Response<tonic::codec::Streaming<super::Response>>,
+                tonic::Status,
+            > {
+            self.inner
+                .ready()
+                .await
+                .map_err(|e| {
+                    tonic::Status::new(
+                        tonic::Code::Unknown,
+                        format!("Service was not ready: {}", e.into()),
+                    )
+                })?;
+            let codec = tonic::codec::ProstCodec::default();
+            let path = http::uri::PathAndQuery::from_static(
+                "/sf.substreams.v1.Stream/Blocks",
+            );
+            self.inner.server_streaming(request.into_request(), path, codec).await
+        }
+    }
+}
+/// Generated server implementations.
+pub mod stream_server {
+    #![allow(unused_variables, dead_code, missing_docs, clippy::let_unit_value)]
+    use tonic::codegen::*;
+    ///Generated trait containing gRPC methods that should be implemented for use with StreamServer.
+    #[async_trait]
+    pub trait Stream: Send + Sync + 'static {
+        ///Server streaming response type for the Blocks method.
+        type BlocksStream: futures_core::Stream<
+                Item = Result<super::Response, tonic::Status>,
+            >
+            + Send
+            + 'static;
+        async fn blocks(
+            &self,
+            request: tonic::Request<super::Request>,
+        ) -> Result<tonic::Response<Self::BlocksStream>, tonic::Status>;
+    }
+    #[derive(Debug)]
+    pub struct StreamServer<T: Stream> {
+        inner: _Inner<T>,
+        accept_compression_encodings: EnabledCompressionEncodings,
+        send_compression_encodings: EnabledCompressionEncodings,
+    }
+    struct _Inner<T>(Arc<T>);
+    impl<T: Stream> StreamServer<T> {
+        pub fn new(inner: T) -> Self {
+            Self::from_arc(Arc::new(inner))
+        }
+        pub fn from_arc(inner: Arc<T>) -> Self {
+            let inner = _Inner(inner);
+            Self {
+                inner,
+                accept_compression_encodings: Default::default(),
+                send_compression_encodings: Default::default(),
+            }
+        }
+        pub fn with_interceptor<F>(
+            inner: T,
+            interceptor: F,
+        ) -> InterceptedService<Self, F>
+        where
+            F: tonic::service::Interceptor,
+        {
+            InterceptedService::new(Self::new(inner), interceptor)
+        }
+        /// Enable decompressing requests with `gzip`.
+        #[must_use]
+        pub fn accept_gzip(mut self) -> Self {
+            self.accept_compression_encodings.enable_gzip();
+            self
+        }
+        /// Compress responses with `gzip`, if the client supports it.
+        #[must_use]
+        pub fn send_gzip(mut self) -> Self {
+            self.send_compression_encodings.enable_gzip();
+            self
+        }
+    }
+    impl<T, B> tonic::codegen::Service<http::Request<B>> for StreamServer<T>
+    where
+        T: Stream,
+        B: Body + Send + 'static,
+        B::Error: Into<StdError> + Send + 'static,
+    {
+        type Response = http::Response<tonic::body::BoxBody>;
+        type Error = std::convert::Infallible;
+        type Future = BoxFuture<Self::Response, Self::Error>;
+        fn poll_ready(
+            &mut self,
+            _cx: &mut Context<'_>,
+        ) -> Poll<Result<(), Self::Error>> {
+            Poll::Ready(Ok(()))
+        }
+        fn call(&mut self, req: http::Request<B>) -> Self::Future {
+            let inner = self.inner.clone();
+            match req.uri().path() {
+                "/sf.substreams.v1.Stream/Blocks" => {
+                    #[allow(non_camel_case_types)]
+                    struct BlocksSvc<T: Stream>(pub Arc<T>);
+                    impl<T: Stream> tonic::server::ServerStreamingService<super::Request>
+                    for BlocksSvc<T> {
+                        type Response = super::Response;
+                        type ResponseStream = T::BlocksStream;
+                        type Future = BoxFuture<
+                            tonic::Response<Self::ResponseStream>,
+                            tonic::Status,
+                        >;
+                        fn call(
+                            &mut self,
+                            request: tonic::Request<super::Request>,
+                        ) -> Self::Future {
+                            let inner = self.0.clone();
+                            let fut = async move { (*inner).blocks(request).await };
+                            Box::pin(fut)
+                        }
+                    }
+                    let accept_compression_encodings = self.accept_compression_encodings;
+                    let send_compression_encodings = self.send_compression_encodings;
+                    let inner = self.inner.clone();
+                    let fut = async move {
+                        let inner = inner.0;
+                        let method = BlocksSvc(inner);
+                        let codec = tonic::codec::ProstCodec::default();
+                        let mut grpc = tonic::server::Grpc::new(codec)
+                            .apply_compression_config(
+                                accept_compression_encodings,
+                                send_compression_encodings,
+                            );
+                        let res = grpc.server_streaming(method, req).await;
+                        Ok(res)
+                    };
+                    Box::pin(fut)
+                }
+                _ => {
+                    Box::pin(async move {
+                        Ok(
+                            http::Response::builder()
+                                .status(200)
+                                .header("grpc-status", "12")
+                                .header("content-type", "application/grpc")
+                                .body(empty_body())
+                                .unwrap(),
+                        )
+                    })
+                }
+            }
+        }
+    }
+    impl<T: Stream> Clone for StreamServer<T> {
+        fn clone(&self) -> Self {
+            let inner = self.inner.clone();
+            Self {
+                inner,
+                accept_compression_encodings: self.accept_compression_encodings,
+                send_compression_encodings: self.send_compression_encodings,
+            }
+        }
+    }
+    impl<T: Stream> Clone for _Inner<T> {
+        fn clone(&self) -> Self {
+            Self(self.0.clone())
+        }
+    }
+    impl<T: std::fmt::Debug> std::fmt::Debug for _Inner<T> {
+        fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
+            write!(f, "{:?}", self.0)
+        }
+    }
+    impl<T: Stream> tonic::transport::NamedService for StreamServer<T> {
+        const NAME: &'static str = "sf.substreams.v1.Stream";
+    }
+}
diff --git a/graph/src/task_spawn.rs b/graph/src/task_spawn.rs
new file mode 100644
index 0000000..c323d6d
--- /dev/null
+++ b/graph/src/task_spawn.rs
@@ -0,0 +1,70 @@
+//! The functions in this module should be used to execute futures, serving as a facade to the
+//! underlying executor implementation which currently is tokio. This serves a few purposes:
+//! - Avoid depending directly on tokio APIs, making upgrades or a potential switch easier.
+//! - Reflect our chosen default semantics of aborting on task panic, offering `*_allow_panic`
+//!   functions to opt out of that.
+//! - Reflect that historically we've used blocking futures due to making DB calls directly within
+//!   futures. This point should go away once https://github.com/graphprotocol/graph-node/issues/905
+//!   is resolved. Then the blocking flavors should no longer accept futures but closures.
+//!
+//! These should not be called from within executors other than tokio, particularly the blocking
+//! functions will panic in that case. We should generally avoid mixing executors whenever possible.
+
+use futures03::future::{FutureExt, TryFutureExt};
+use std::future::Future as Future03;
+use std::panic::AssertUnwindSafe;
+use tokio::task::JoinHandle;
+
+fn abort_on_panic<T: Send + 'static>(
+    f: impl Future03<Output = T> + Send + 'static,
+) -> impl Future03<Output = T> {
+    // We're crashing, unwind safety doesn't matter.
+    AssertUnwindSafe(f).catch_unwind().unwrap_or_else(|_| {
+        println!("Panic in tokio task, aborting!");
+        std::process::abort()
+    })
+}
+
+/// Aborts on panic.
+pub fn spawn<T: Send + 'static>(f: impl Future03<Output = T> + Send + 'static) -> JoinHandle<T> {
+    tokio::spawn(abort_on_panic(f))
+}
+
+pub fn spawn_allow_panic<T: Send + 'static>(
+    f: impl Future03<Output = T> + Send + 'static,
+) -> JoinHandle<T> {
+    tokio::spawn(f)
+}
+
+/// Aborts on panic.
+pub fn spawn_blocking<T: Send + 'static>(
+    f: impl Future03<Output = T> + Send + 'static,
+) -> JoinHandle<T> {
+    tokio::task::spawn_blocking(move || block_on(abort_on_panic(f)))
+}
+
+/// Does not abort on panic, panics result in an `Err` in `JoinHandle`.
+pub fn spawn_blocking_allow_panic<R: 'static + Send>(
+    f: impl 'static + FnOnce() -> R + Send,
+) -> JoinHandle<R> {
+    tokio::task::spawn_blocking(f)
+}
+
+/// Runs the future on the current thread. Panics if not within a tokio runtime.
+pub fn block_on<T>(f: impl Future03<Output = T>) -> T {
+    tokio::runtime::Handle::current().block_on(f)
+}
+
+/// Spawns a thread with access to the tokio runtime. Panics if the thread cannot be spawned.
+pub fn spawn_thread(
+    name: impl Into<String>,
+    f: impl 'static + FnOnce() + Send,
+) -> std::thread::JoinHandle<()> {
+    let conf = std::thread::Builder::new().name(name.into());
+    let runtime = tokio::runtime::Handle::current();
+    conf.spawn(move || {
+        let _runtime_guard = runtime.enter();
+        f()
+    })
+    .unwrap()
+}
diff --git a/graph/src/util/backoff.rs b/graph/src/util/backoff.rs
new file mode 100644
index 0000000..1a5d3b2
--- /dev/null
+++ b/graph/src/util/backoff.rs
@@ -0,0 +1,52 @@
+use std::time::Duration;
+
+/// Facilitate sleeping with an exponential backoff. Sleep durations will
+/// increase by a factor of 2 from `base` until they reach `ceiling`, at
+/// which point any call to `sleep` or `sleep_async` will sleep for
+/// `ceiling`
+pub struct ExponentialBackoff {
+    pub attempt: u64,
+    base: Duration,
+    ceiling: Duration,
+}
+
+impl ExponentialBackoff {
+    pub fn new(base: Duration, ceiling: Duration) -> Self {
+        ExponentialBackoff {
+            attempt: 0,
+            base,
+            ceiling,
+        }
+    }
+
+    /// Record that we made an attempt and sleep for the appropriate amount
+    /// of time. Do not use this from async contexts since it uses
+    /// `thread::sleep`
+    pub fn sleep(&mut self) {
+        std::thread::sleep(self.next_attempt());
+    }
+
+    /// Record that we made an attempt and sleep for the appropriate amount
+    /// of time
+    pub async fn sleep_async(&mut self) {
+        tokio::time::sleep(self.next_attempt()).await
+    }
+
+    pub fn delay(&self) -> Duration {
+        let mut delay = self.base.saturating_mul(1 << self.attempt);
+        if delay > self.ceiling {
+            delay = self.ceiling;
+        }
+        delay
+    }
+
+    fn next_attempt(&mut self) -> Duration {
+        let delay = self.delay();
+        self.attempt += 1;
+        delay
+    }
+
+    pub fn reset(&mut self) {
+        self.attempt = 0;
+    }
+}
diff --git a/graph/src/util/bounded_queue.rs b/graph/src/util/bounded_queue.rs
new file mode 100644
index 0000000..5e0a666
--- /dev/null
+++ b/graph/src/util/bounded_queue.rs
@@ -0,0 +1,150 @@
+use std::{collections::VecDeque, sync::Mutex};
+
+use crate::prelude::tokio::sync::Semaphore;
+
+/// An async-friendly queue of bounded size. In contrast to a bounded channel,
+/// the queue makes it possible to modify and remove entries in it.
+pub struct BoundedQueue<T> {
+    /// The maximum number of entries allowed in the queue
+    capacity: usize,
+    /// The actual items in the queue. New items are appended at the back, and
+    /// popped off the front.
+    queue: Mutex<VecDeque<T>>,
+    /// This semaphore has as many permits as there are empty spots in the
+    /// `queue`, i.e., `capacity - queue.len()` many permits
+    push_semaphore: Semaphore,
+    /// This semaphore has as many permits as there are entrie in the queue,
+    /// i.e., `queue.len()` many
+    pop_semaphore: Semaphore,
+}
+
+impl<T> std::fmt::Debug for BoundedQueue<T> {
+    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
+        let queue = self.queue.lock().unwrap();
+        write!(
+            f,
+            "BoundedQueue[cap: {}, queue: {}/{}, push: {}, pop: {}]",
+            self.capacity,
+            queue.len(),
+            queue.capacity(),
+            self.push_semaphore.available_permits(),
+            self.pop_semaphore.available_permits(),
+        )
+    }
+}
+
+impl<T: Clone> BoundedQueue<T> {
+    pub fn with_capacity(capacity: usize) -> Self {
+        Self {
+            capacity,
+            queue: Mutex::new(VecDeque::with_capacity(capacity)),
+            push_semaphore: Semaphore::new(capacity),
+            pop_semaphore: Semaphore::new(0),
+        }
+    }
+
+    /// Get an item from the queue. If the queue is currently empty
+    /// this method blocks until an item is available.
+    pub async fn pop(&self) -> T {
+        let permit = self.pop_semaphore.acquire().await.unwrap();
+        let item = self
+            .queue
+            .lock()
+            .unwrap()
+            .pop_front()
+            .expect("the queue is not empty");
+        permit.forget();
+        self.push_semaphore.add_permits(1);
+        item
+    }
+
+    /// Get an item from the queue without blocking; if the queue is empty,
+    /// return `None`
+    pub fn try_pop(&self) -> Option<T> {
+        let permit = match self.pop_semaphore.try_acquire() {
+            Err(_) => return None,
+            Ok(permit) => permit,
+        };
+        let item = self
+            .queue
+            .lock()
+            .unwrap()
+            .pop_front()
+            .expect("the queue is not empty");
+        permit.forget();
+        self.push_semaphore.add_permits(1);
+        Some(item)
+    }
+
+    /// Take an item from the front of the queue and return a copy. If the
+    /// queue is currently empty this method blocks until an item is
+    /// available.
+    pub async fn peek(&self) -> T {
+        let _permit = self.pop_semaphore.acquire().await.unwrap();
+        let queue = self.queue.lock().unwrap();
+        let item = queue.front().expect("the queue is not empty");
+        item.clone()
+    }
+
+    /// Push an item into the queue. If the queue is currently full this method
+    /// blocks until an item is available
+    pub async fn push(&self, item: T) {
+        let permit = self.push_semaphore.acquire().await.unwrap();
+        self.queue.lock().unwrap().push_back(item);
+        permit.forget();
+        self.pop_semaphore.add_permits(1);
+    }
+
+    pub async fn wait_empty(&self) {
+        self.push_semaphore
+            .acquire_many(self.capacity as u32)
+            .await
+            .map(|_| ())
+            .expect("we never close the push_semaphore")
+    }
+
+    pub fn len(&self) -> usize {
+        self.queue.lock().unwrap().len()
+    }
+
+    pub fn is_empty(&self) -> bool {
+        self.queue.lock().unwrap().is_empty()
+    }
+
+    pub fn capacity(&self) -> usize {
+        self.capacity
+    }
+
+    /// Iterate over the entries in the queue from newest to oldest entry
+    /// atomically, applying `f` to each entry and returning the first
+    /// result that is not `None`.
+    ///
+    /// This method locks the queue while it is executing, and `f` should
+    /// therefore not do any slow work.
+    pub fn find_map<B, F>(&self, f: F) -> Option<B>
+    where
+        F: FnMut(&T) -> Option<B>,
+    {
+        let queue = self.queue.lock().unwrap();
+        queue.iter().rev().find_map(f)
+    }
+
+    /// Iterate over the entries in the queue from newest to oldest entry
+    /// atomically, applying `f` to each entry and returning the result of
+    /// the last invocation of `f`.
+    ///
+    /// This method locks the queue while it is executing, and `f` should
+    /// therefore not do any slow work.
+    pub fn fold<B, F>(&self, init: B, f: F) -> B
+    where
+        F: FnMut(B, &T) -> B,
+    {
+        let queue = self.queue.lock().unwrap();
+        queue.iter().rev().fold(init, f)
+    }
+
+    /// Clear the queue by popping entries until there are none left
+    pub fn clear(&self) {
+        while let Some(_) = self.try_pop() {}
+    }
+}
diff --git a/graph/src/util/cache_weight.rs b/graph/src/util/cache_weight.rs
new file mode 100644
index 0000000..af15a82
--- /dev/null
+++ b/graph/src/util/cache_weight.rs
@@ -0,0 +1,246 @@
+use crate::{
+    components::store::{EntityKey, EntityType},
+    data::value::Word,
+    prelude::{q, BigDecimal, BigInt, Value},
+};
+use std::{
+    collections::{BTreeMap, HashMap},
+    mem,
+};
+
+/// Estimate of how much memory a value consumes.
+/// Useful for measuring the size of caches.
+pub trait CacheWeight {
+    /// Total weight of the value.
+    fn weight(&self) -> usize {
+        mem::size_of_val(self) + self.indirect_weight()
+    }
+
+    /// The weight of values pointed to by this value but logically owned by it, which is not
+    /// accounted for by `size_of`.
+    fn indirect_weight(&self) -> usize;
+}
+
+impl<T: CacheWeight> CacheWeight for Option<T> {
+    fn indirect_weight(&self) -> usize {
+        match self {
+            Some(x) => x.indirect_weight(),
+            None => 0,
+        }
+    }
+}
+
+impl<T: CacheWeight> CacheWeight for Vec<T> {
+    fn indirect_weight(&self) -> usize {
+        self.iter().map(CacheWeight::indirect_weight).sum::<usize>()
+            + self.capacity() * mem::size_of::<T>()
+    }
+}
+
+impl<T: CacheWeight, U: CacheWeight> CacheWeight for BTreeMap<T, U> {
+    fn indirect_weight(&self) -> usize {
+        self.iter()
+            .map(|(key, value)| key.indirect_weight() + value.indirect_weight())
+            .sum::<usize>()
+            + btree::node_size(self)
+    }
+}
+
+impl<T: CacheWeight, U: CacheWeight> CacheWeight for HashMap<T, U> {
+    fn indirect_weight(&self) -> usize {
+        self.iter()
+            .map(|(key, value)| key.indirect_weight() + value.indirect_weight())
+            .sum::<usize>()
+            + self.capacity() * mem::size_of::<(T, U, u64)>()
+    }
+}
+
+impl CacheWeight for String {
+    fn indirect_weight(&self) -> usize {
+        self.capacity()
+    }
+}
+
+impl CacheWeight for Word {
+    fn indirect_weight(&self) -> usize {
+        self.len()
+    }
+}
+
+impl CacheWeight for BigDecimal {
+    fn indirect_weight(&self) -> usize {
+        ((self.digits() as f32 * std::f32::consts::LOG2_10) / 8.0).ceil() as usize
+    }
+}
+
+impl CacheWeight for BigInt {
+    fn indirect_weight(&self) -> usize {
+        self.bits() / 8
+    }
+}
+
+impl CacheWeight for crate::data::store::scalar::Bytes {
+    fn indirect_weight(&self) -> usize {
+        self.as_slice().len()
+    }
+}
+
+impl CacheWeight for Value {
+    fn indirect_weight(&self) -> usize {
+        match self {
+            Value::String(s) => s.indirect_weight(),
+            Value::BigDecimal(d) => d.indirect_weight(),
+            Value::List(values) => values.indirect_weight(),
+            Value::Bytes(bytes) => bytes.indirect_weight(),
+            Value::BigInt(n) => n.indirect_weight(),
+            Value::Int(_) | Value::Bool(_) | Value::Null => 0,
+        }
+    }
+}
+
+impl CacheWeight for q::Value {
+    fn indirect_weight(&self) -> usize {
+        match self {
+            q::Value::Boolean(_) | q::Value::Int(_) | q::Value::Null | q::Value::Float(_) => 0,
+            q::Value::Enum(s) | q::Value::String(s) | q::Value::Variable(s) => s.indirect_weight(),
+            q::Value::List(l) => l.indirect_weight(),
+            q::Value::Object(o) => o.indirect_weight(),
+        }
+    }
+}
+
+impl CacheWeight for usize {
+    fn indirect_weight(&self) -> usize {
+        0
+    }
+}
+
+impl CacheWeight for EntityType {
+    fn indirect_weight(&self) -> usize {
+        0
+    }
+}
+
+impl CacheWeight for EntityKey {
+    fn indirect_weight(&self) -> usize {
+        self.entity_id.indirect_weight() + self.entity_type.indirect_weight()
+    }
+}
+
+impl CacheWeight for [u8; 32] {
+    fn indirect_weight(&self) -> usize {
+        0
+    }
+}
+
+#[cfg(test)]
+impl CacheWeight for &'static str {
+    fn indirect_weight(&self) -> usize {
+        0
+    }
+}
+
+#[test]
+fn big_decimal_cache_weight() {
+    use std::str::FromStr;
+
+    // 22.4548 has 18 bits as binary, so 3 bytes.
+    let n = BigDecimal::from_str("22.454800000000").unwrap();
+    assert_eq!(n.indirect_weight(), 3);
+}
+
+/// Helpers to estimate the size of a `BTreeMap`. Everything in this module,
+/// except for `node_size()` is copied from `std::collections::btree`.
+///
+/// It is not possible to know how many nodes a BTree has, as
+/// `BTreeMap` does not expose its depth or any other detail about
+/// the true size of the BTree. We estimate that size, assuming the
+/// average case, i.e., a BTree where every node has the average
+/// between the minimum and maximum number of entries per node, i.e.,
+/// the average of (B-1) and (2*B-1) entries, which we call
+/// `NODE_FILL`. The number of leaf nodes in the tree is then the
+/// number of entries divided by `NODE_FILL`, and the number of
+/// interior nodes can be determined by dividing the number of nodes
+/// at the child level by `NODE_FILL`
+
+/// The other difficulty is that the structs with which `BTreeMap`
+/// represents internal and leaf nodes are not public, so we can't
+/// get their size with `std::mem::size_of`; instead, we base our
+/// estimates of their size on the current `std` code, assuming that
+/// these structs will not change
+
+pub mod btree {
+    use std::collections::BTreeMap;
+    use std::mem;
+    use std::{mem::MaybeUninit, ptr::NonNull};
+
+    const B: usize = 6;
+    const CAPACITY: usize = 2 * B - 1;
+
+    /// Assume BTree nodes are this full (average of minimum and maximum fill)
+    const NODE_FILL: usize = ((B - 1) + (2 * B - 1)) / 2;
+
+    type BoxedNode<K, V> = NonNull<LeafNode<K, V>>;
+
+    struct InternalNode<K, V> {
+        _data: LeafNode<K, V>,
+
+        /// The pointers to the children of this node. `len + 1` of these are considered
+        /// initialized and valid, except that near the end, while the tree is held
+        /// through borrow type `Dying`, some of these pointers are dangling.
+        _edges: [MaybeUninit<BoxedNode<K, V>>; 2 * B],
+    }
+
+    struct LeafNode<K, V> {
+        /// We want to be covariant in `K` and `V`.
+        _parent: Option<NonNull<InternalNode<K, V>>>,
+
+        /// This node's index into the parent node's `edges` array.
+        /// `*node.parent.edges[node.parent_idx]` should be the same thing as `node`.
+        /// This is only guaranteed to be initialized when `parent` is non-null.
+        _parent_idx: MaybeUninit<u16>,
+
+        /// The number of keys and values this node stores.
+        _len: u16,
+
+        /// The arrays storing the actual data of the node. Only the first `len` elements of each
+        /// array are initialized and valid.
+        _keys: [MaybeUninit<K>; CAPACITY],
+        _vals: [MaybeUninit<V>; CAPACITY],
+    }
+
+    /// Estimate the size of the BTreeMap `map` ignoring the size of any keys
+    /// and values
+    pub fn node_size<K, V>(map: &BTreeMap<K, V>) -> usize {
+        // Measure the size of internal and leaf nodes directly - that's why
+        // we copied all this code from `std`
+        let ln_sz = mem::size_of::<LeafNode<K, V>>();
+        let in_sz = mem::size_of::<InternalNode<K, V>>();
+
+        // Estimate the number of internal and leaf nodes based on the only
+        // thing we can measure about a BTreeMap, the number of entries in
+        // it, and use our `NODE_FILL` assumption to estimate how the tree
+        // is structured. We try to be very good for small maps, since
+        // that's what we use most often in our code. This estimate is only
+        // for the indirect weight of the `BTreeMap`
+        let (leaves, int_nodes) = if map.is_empty() {
+            // An empty tree has no indirect weight
+            (0, 0)
+        } else if map.len() <= CAPACITY {
+            // We only have the root node
+            (1, 0)
+        } else {
+            // Estimate based on our `NODE_FILL` assumption
+            let leaves = map.len() / NODE_FILL + 1;
+            let mut prev_level = leaves / NODE_FILL + 1;
+            let mut int_nodes = prev_level;
+            while prev_level > 1 {
+                int_nodes += prev_level;
+                prev_level = prev_level / NODE_FILL + 1;
+            }
+            (leaves, int_nodes)
+        };
+
+        leaves * ln_sz + int_nodes * in_sz
+    }
+}
diff --git a/graph/src/util/error.rs b/graph/src/util/error.rs
new file mode 100644
index 0000000..1b3cb88
--- /dev/null
+++ b/graph/src/util/error.rs
@@ -0,0 +1,19 @@
+// `ensure!` from `anyhow`, but calling `from`.
+#[macro_export]
+macro_rules! ensure {
+    ($cond:expr, $msg:literal $(,)?) => {
+        if !$cond {
+            return Err(From::from($crate::prelude::anyhow::anyhow!($msg)));
+        }
+    };
+    ($cond:expr, $err:expr $(,)?) => {
+        if !$cond {
+            return Err(From::from($crate::prelude::anyhow::anyhow!($err)));
+        }
+    };
+    ($cond:expr, $fmt:expr, $($arg:tt)*) => {
+        if !$cond {
+            return Err(From::from($crate::prelude::anyhow::anyhow!($fmt, $($arg)*)));
+        }
+    };
+}
diff --git a/graph/src/util/futures.rs b/graph/src/util/futures.rs
new file mode 100644
index 0000000..eba48ae
--- /dev/null
+++ b/graph/src/util/futures.rs
@@ -0,0 +1,548 @@
+use crate::ext::futures::FutureExtension;
+use futures03::{Future, FutureExt, TryFutureExt};
+use slog::{debug, trace, warn, Logger};
+use std::fmt::Debug;
+use std::marker::PhantomData;
+use std::sync::Arc;
+use std::time::Duration;
+use thiserror::Error;
+use tokio_retry::strategy::{jitter, ExponentialBackoff};
+use tokio_retry::Retry;
+
+/// Generic helper function for retrying async operations with built-in logging.
+///
+/// To use this helper, do the following:
+///
+/// 1. Call this function with an operation name (used for logging) and a `Logger`.
+/// 2. Optional: Chain a call to `.when(...)` to set a custom retry condition.
+/// 3. Optional: call `.log_after(...)` or `.no_logging()`.
+/// 4. Call either `.limit(...)` or `.no_limit()`.
+/// 5. Call one of `.timeout_secs(...)`, `.timeout_millis(...)`, `.timeout(...)`, and
+///    `.no_timeout()`.
+/// 6. Call `.run(...)`.
+///
+/// All steps are required, except Step 2 and Step 3.
+///
+/// Example usage:
+/// ```
+/// # extern crate graph;
+/// # use graph::prelude::*;
+/// # use tokio::time::timeout;
+/// use std::future::Future;
+/// use graph::prelude::{Logger, TimeoutError};
+/// #
+/// # type Memes = (); // the memes are a lie :(
+/// #
+/// # async fn  download_the_memes() -> Result<Memes, ()> {
+/// #     Ok(())
+/// # }
+///
+/// fn async_function(logger: Logger) -> impl Future<Output=Result<Memes, TimeoutError<()>>> {
+///     // Retry on error
+///     retry("download memes", &logger)
+///         .no_limit() // Retry forever
+///         .timeout_secs(30) // Retry if an attempt takes > 30 seconds
+///         .run(|| {
+///             download_the_memes() // Return a Future
+///         })
+/// }
+/// ```
+pub fn retry<I, E>(operation_name: impl ToString, logger: &Logger) -> RetryConfig<I, E> {
+    RetryConfig {
+        operation_name: operation_name.to_string(),
+        logger: logger.to_owned(),
+        condition: RetryIf::Error,
+        log_after: 1,
+        warn_after: 10,
+        limit: RetryConfigProperty::Unknown,
+        phantom_item: PhantomData,
+        phantom_error: PhantomData,
+    }
+}
+
+pub struct RetryConfig<I, E> {
+    operation_name: String,
+    logger: Logger,
+    condition: RetryIf<I, E>,
+    log_after: u64,
+    warn_after: u64,
+    limit: RetryConfigProperty<usize>,
+    phantom_item: PhantomData<I>,
+    phantom_error: PhantomData<E>,
+}
+
+impl<I, E> RetryConfig<I, E>
+where
+    I: Send,
+    E: Debug + Send + Send + Sync + 'static,
+{
+    /// Sets a function used to determine if a retry is needed.
+    /// Note: timeouts always trigger a retry.
+    ///
+    /// Overrides the default behaviour of retrying on any `Err`.
+    pub fn when<P>(mut self, predicate: P) -> Self
+    where
+        P: Fn(&Result<I, E>) -> bool + Send + Sync + 'static,
+    {
+        self.condition = RetryIf::Predicate(Box::new(predicate));
+        self
+    }
+
+    /// Only log retries after `min_attempts` failed attempts.
+    pub fn log_after(mut self, min_attempts: u64) -> Self {
+        self.log_after = min_attempts;
+        self
+    }
+
+    pub fn warn_after(mut self, min_attempts: u64) -> Self {
+        self.warn_after = min_attempts;
+        self
+    }
+
+    /// Never log failed attempts.
+    /// May still log at `trace` logging level.
+    pub fn no_logging(mut self) -> Self {
+        self.log_after = u64::max_value();
+        self.warn_after = u64::max_value();
+        self
+    }
+
+    /// Set a limit on how many retry attempts to make.
+    pub fn limit(mut self, limit: usize) -> Self {
+        self.limit.set(limit);
+        self
+    }
+
+    /// Allow unlimited retry attempts.
+    pub fn no_limit(mut self) -> Self {
+        self.limit.clear();
+        self
+    }
+
+    /// Set how long (in seconds) to wait for an attempt to complete before giving up on that
+    /// attempt.
+    pub fn timeout_secs(self, timeout_secs: u64) -> RetryConfigWithTimeout<I, E> {
+        self.timeout(Duration::from_secs(timeout_secs))
+    }
+
+    /// Set how long (in milliseconds) to wait for an attempt to complete before giving up on that
+    /// attempt.
+    pub fn timeout_millis(self, timeout_ms: u64) -> RetryConfigWithTimeout<I, E> {
+        self.timeout(Duration::from_millis(timeout_ms))
+    }
+
+    /// Set how long to wait for an attempt to complete before giving up on that attempt.
+    pub fn timeout(self, timeout: Duration) -> RetryConfigWithTimeout<I, E> {
+        RetryConfigWithTimeout {
+            inner: self,
+            timeout,
+        }
+    }
+
+    /// Allow attempts to take as long as they need (or potentially hang forever).
+    pub fn no_timeout(self) -> RetryConfigNoTimeout<I, E> {
+        RetryConfigNoTimeout { inner: self }
+    }
+}
+
+pub struct RetryConfigWithTimeout<I, E> {
+    inner: RetryConfig<I, E>,
+    timeout: Duration,
+}
+
+impl<I, E> RetryConfigWithTimeout<I, E>
+where
+    I: Debug + Send + 'static,
+    E: Debug + Send + Send + Sync + 'static,
+{
+    /// Rerun the provided function as many times as needed.
+    pub fn run<F, R>(self, mut try_it: F) -> impl Future<Output = Result<I, TimeoutError<E>>>
+    where
+        F: FnMut() -> R + Send + 'static,
+        R: Future<Output = Result<I, E>> + Send + 'static,
+    {
+        let operation_name = self.inner.operation_name;
+        let logger = self.inner.logger.clone();
+        let condition = self.inner.condition;
+        let log_after = self.inner.log_after;
+        let warn_after = self.inner.warn_after;
+        let limit_opt = self.inner.limit.unwrap(&operation_name, "limit");
+        let timeout = self.timeout;
+
+        trace!(logger, "Run with retry: {}", operation_name);
+
+        run_retry(
+            operation_name,
+            logger,
+            condition,
+            log_after,
+            warn_after,
+            limit_opt,
+            move || {
+                try_it()
+                    .timeout(timeout)
+                    .map_err(|_| TimeoutError::Elapsed)
+                    .and_then(|res| std::future::ready(res.map_err(TimeoutError::Inner)))
+                    .boxed()
+            },
+        )
+    }
+}
+
+pub struct RetryConfigNoTimeout<I, E> {
+    inner: RetryConfig<I, E>,
+}
+
+impl<I, E> RetryConfigNoTimeout<I, E> {
+    /// Rerun the provided function as many times as needed.
+    pub fn run<F, R>(self, try_it: F) -> impl Future<Output = Result<I, E>>
+    where
+        I: Debug + Send + 'static,
+        E: Debug + Send + Sync + 'static,
+        F: Fn() -> R + Send + 'static,
+        R: Future<Output = Result<I, E>> + Send,
+    {
+        let operation_name = self.inner.operation_name;
+        let logger = self.inner.logger.clone();
+        let condition = self.inner.condition;
+        let log_after = self.inner.log_after;
+        let warn_after = self.inner.warn_after;
+        let limit_opt = self.inner.limit.unwrap(&operation_name, "limit");
+
+        trace!(logger, "Run with retry: {}", operation_name);
+
+        run_retry(
+            operation_name,
+            logger,
+            condition,
+            log_after,
+            warn_after,
+            limit_opt,
+            // No timeout, so all errors are inner errors
+            move || try_it().map_err(TimeoutError::Inner),
+        )
+        .map_err(|e| {
+            // No timeout, so all errors are inner errors
+            e.into_inner().unwrap()
+        })
+    }
+}
+
+#[derive(Error, Debug)]
+pub enum TimeoutError<T: Debug + Send + Sync + 'static> {
+    #[error("{0:?}")]
+    Inner(T),
+    #[error("Timeout elapsed")]
+    Elapsed,
+}
+
+impl<T: Debug + Send + Sync + 'static> TimeoutError<T> {
+    pub fn is_elapsed(&self) -> bool {
+        match self {
+            TimeoutError::Inner(_) => false,
+            TimeoutError::Elapsed => true,
+        }
+    }
+
+    pub fn into_inner(self) -> Option<T> {
+        match self {
+            TimeoutError::Inner(x) => Some(x),
+            TimeoutError::Elapsed => None,
+        }
+    }
+}
+
+fn run_retry<O, E, F, R>(
+    operation_name: String,
+    logger: Logger,
+    condition: RetryIf<O, E>,
+    log_after: u64,
+    warn_after: u64,
+    limit_opt: Option<usize>,
+    mut try_it_with_timeout: F,
+) -> impl Future<Output = Result<O, TimeoutError<E>>> + Send
+where
+    O: Debug + Send + 'static,
+    E: Debug + Send + Sync + 'static,
+    F: FnMut() -> R + Send + 'static,
+    R: Future<Output = Result<O, TimeoutError<E>>> + Send,
+{
+    let condition = Arc::new(condition);
+
+    let mut attempt_count = 0;
+
+    Retry::spawn(retry_strategy(limit_opt), move || {
+        let operation_name = operation_name.clone();
+        let logger = logger.clone();
+        let condition = condition.clone();
+
+        attempt_count += 1;
+
+        try_it_with_timeout().then(move |result_with_timeout| {
+            let is_elapsed = result_with_timeout
+                .as_ref()
+                .err()
+                .map(TimeoutError::is_elapsed)
+                .unwrap_or(false);
+
+            if is_elapsed {
+                if attempt_count >= log_after {
+                    debug!(
+                        logger,
+                        "Trying again after {} timed out (attempt #{})",
+                        &operation_name,
+                        attempt_count,
+                    );
+                }
+
+                // Wrap in Err to force retry
+                std::future::ready(Err(result_with_timeout))
+            } else {
+                // Any error must now be an inner error.
+                // Unwrap the inner error so that the predicate doesn't need to think
+                // about timeout::Error.
+                let result = result_with_timeout.map_err(|e| e.into_inner().unwrap());
+
+                // If needs retry
+                if condition.check(&result) {
+                    if attempt_count >= warn_after {
+                        // This looks like it would be nice to de-duplicate, but if we try
+                        // to use log! slog complains about requiring a const for the log level
+                        // See also b05e1594-e408-4047-aefb-71fc60d70e8f
+                        warn!(
+                            logger,
+                            "Trying again after {} failed (attempt #{}) with result {:?}",
+                            &operation_name,
+                            attempt_count,
+                            result
+                        );
+                    } else if attempt_count >= log_after {
+                        // See also b05e1594-e408-4047-aefb-71fc60d70e8f
+                        debug!(
+                            logger,
+                            "Trying again after {} failed (attempt #{}) with result {:?}",
+                            &operation_name,
+                            attempt_count,
+                            result
+                        );
+                    }
+
+                    // Wrap in Err to force retry
+                    std::future::ready(Err(result.map_err(TimeoutError::Inner)))
+                } else {
+                    // Wrap in Ok to prevent retry
+                    std::future::ready(Ok(result.map_err(TimeoutError::Inner)))
+                }
+            }
+        })
+    })
+    .boxed()
+    .then(|retry_result| async {
+        // Unwrap the inner result.
+        // The outer Ok/Err is only used for retry control flow.
+        match retry_result {
+            Ok(r) => r,
+            Err(e) => e,
+        }
+    })
+}
+
+fn retry_strategy(limit_opt: Option<usize>) -> Box<dyn Iterator<Item = Duration> + Send> {
+    // Exponential backoff, but with a maximum
+    let max_delay_ms = 30_000;
+    let backoff = ExponentialBackoff::from_millis(2)
+        .max_delay(Duration::from_millis(max_delay_ms))
+        .map(jitter);
+
+    // Apply limit (maximum retry count)
+    match limit_opt {
+        Some(limit) => {
+            // Items are delays *between* attempts,
+            // so subtract 1 from limit.
+            Box::new(backoff.take(limit - 1))
+        }
+        None => Box::new(backoff),
+    }
+}
+
+enum RetryIf<I, E> {
+    Error,
+    Predicate(Box<dyn Fn(&Result<I, E>) -> bool + Send + Sync>),
+}
+
+impl<I, E> RetryIf<I, E> {
+    fn check(&self, result: &Result<I, E>) -> bool {
+        match *self {
+            RetryIf::Error => result.is_err(),
+            RetryIf::Predicate(ref pred) => pred(result),
+        }
+    }
+}
+
+#[derive(Clone, Copy, Debug, PartialEq, Eq)]
+enum RetryConfigProperty<V> {
+    /// Property was explicitly set
+    Set(V),
+
+    /// Property was explicitly unset
+    Clear,
+
+    /// Property was not explicitly set or unset
+    Unknown,
+}
+
+impl<V> RetryConfigProperty<V>
+where
+    V: PartialEq + Eq,
+{
+    fn set(&mut self, v: V) {
+        if *self != RetryConfigProperty::Unknown {
+            panic!("Retry config properties must be configured only once");
+        }
+
+        *self = RetryConfigProperty::Set(v);
+    }
+
+    fn clear(&mut self) {
+        if *self != RetryConfigProperty::Unknown {
+            panic!("Retry config properties must be configured only once");
+        }
+
+        *self = RetryConfigProperty::Clear;
+    }
+
+    fn unwrap(self, operation_name: &str, property_name: &str) -> Option<V> {
+        match self {
+            RetryConfigProperty::Set(v) => Some(v),
+            RetryConfigProperty::Clear => None,
+            RetryConfigProperty::Unknown => panic!(
+                "Retry helper for {} must have {} parameter configured",
+                operation_name, property_name
+            ),
+        }
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    use futures::future;
+    use futures03::compat::Future01CompatExt;
+    use slog::o;
+    use std::sync::Mutex;
+
+    #[test]
+    fn test() {
+        let logger = Logger::root(::slog::Discard, o!());
+
+        let runtime = tokio::runtime::Builder::new_current_thread()
+            .enable_all()
+            .build()
+            .unwrap();
+        let result = runtime.block_on(async {
+            let c = Mutex::new(0);
+            retry("test", &logger)
+                .no_logging()
+                .no_limit()
+                .no_timeout()
+                .run(move || {
+                    let mut c_guard = c.lock().unwrap();
+                    *c_guard += 1;
+
+                    if *c_guard >= 10 {
+                        future::ok(*c_guard).compat()
+                    } else {
+                        future::err(()).compat()
+                    }
+                })
+                .await
+        });
+        assert_eq!(result, Ok(10));
+    }
+
+    #[test]
+    fn limit_reached() {
+        let logger = Logger::root(::slog::Discard, o!());
+        let runtime = tokio::runtime::Builder::new_current_thread()
+            .enable_all()
+            .build()
+            .unwrap();
+
+        let result = runtime.block_on({
+            let c = Mutex::new(0);
+            retry("test", &logger)
+                .no_logging()
+                .limit(5)
+                .no_timeout()
+                .run(move || {
+                    let mut c_guard = c.lock().unwrap();
+                    *c_guard += 1;
+
+                    if *c_guard >= 10 {
+                        future::ok(*c_guard).compat()
+                    } else {
+                        future::err(*c_guard).compat()
+                    }
+                })
+        });
+        assert_eq!(result, Err(5));
+    }
+
+    #[test]
+    fn limit_not_reached() {
+        let logger = Logger::root(::slog::Discard, o!());
+        let runtime = tokio::runtime::Builder::new_current_thread()
+            .enable_all()
+            .build()
+            .unwrap();
+
+        let result = runtime.block_on({
+            let c = Mutex::new(0);
+            retry("test", &logger)
+                .no_logging()
+                .limit(20)
+                .no_timeout()
+                .run(move || {
+                    let mut c_guard = c.lock().unwrap();
+                    *c_guard += 1;
+
+                    if *c_guard >= 10 {
+                        future::ok(*c_guard).compat()
+                    } else {
+                        future::err(*c_guard).compat()
+                    }
+                })
+        });
+        assert_eq!(result, Ok(10));
+    }
+
+    #[test]
+    fn custom_when() {
+        let logger = Logger::root(::slog::Discard, o!());
+        let c = Mutex::new(0);
+
+        let runtime = tokio::runtime::Builder::new_current_thread()
+            .enable_all()
+            .build()
+            .unwrap();
+        let result = runtime.block_on({
+            retry("test", &logger)
+                .when(|result| result.unwrap() < 10)
+                .no_logging()
+                .limit(20)
+                .no_timeout()
+                .run(move || {
+                    let mut c_guard = c.lock().unwrap();
+                    *c_guard += 1;
+                    if *c_guard > 30 {
+                        future::err(()).compat()
+                    } else {
+                        future::ok(*c_guard).compat()
+                    }
+                })
+        });
+
+        assert_eq!(result, Ok(10));
+    }
+}
diff --git a/graph/src/util/jobs.rs b/graph/src/util/jobs.rs
new file mode 100644
index 0000000..d366bcc
--- /dev/null
+++ b/graph/src/util/jobs.rs
@@ -0,0 +1,148 @@
+//! A simple job running framework for predefined jobs running repeatedly
+//! at fixed intervals. This facility is not meant for work that needs
+//! to be done on a tight deadline, solely for work that needs to be done
+//! at reasonably long intervals (like a few hours)
+
+use slog::{debug, info, o, trace, warn, Logger};
+use std::sync::atomic::{AtomicBool, Ordering};
+use std::sync::Arc;
+use std::time::{Duration, Instant};
+
+use async_trait::async_trait;
+
+/// An individual job to run. Each job should be written in a way that it
+/// doesn't take more than a few minutes.
+#[async_trait]
+pub trait Job: Send + Sync {
+    fn name(&self) -> &str;
+    async fn run(&self, logger: &Logger);
+}
+
+struct Task {
+    job: Arc<dyn Job>,
+    logger: Logger,
+    interval: Duration,
+    next_run: Instant,
+}
+
+pub struct Runner {
+    logger: Logger,
+    tasks: Vec<Task>,
+    pub stop: Arc<AtomicBool>,
+}
+
+impl Runner {
+    pub fn new(logger: &Logger) -> Runner {
+        Runner {
+            logger: logger.new(o!("component" => "JobRunner")),
+            tasks: Vec::new(),
+            stop: Arc::new(AtomicBool::new(false)),
+        }
+    }
+
+    pub fn register(&mut self, job: Arc<dyn Job>, interval: Duration) {
+        let logger = self.logger.new(o!("job" => job.name().to_owned()));
+        // We want tasks to start running pretty soon after server start, but
+        // also want to avoid that they all need to run at the same time. We
+        // therefore run them a small fraction of their interval from now. For
+        // a job that runs daily, we'd do the first run in about 15 minutes
+        let next_run = Instant::now() + interval / 91;
+        let task = Task {
+            job,
+            interval,
+            logger,
+            next_run,
+        };
+        self.tasks.push(task);
+    }
+
+    pub async fn start(mut self) {
+        info!(
+            self.logger,
+            "Starting job runner with {} jobs",
+            self.tasks.len()
+        );
+
+        for task in &self.tasks {
+            let next = task.next_run.saturating_duration_since(Instant::now());
+            debug!(self.logger, "Schedule for {}", task.job.name();
+                   "interval_s" => task.interval.as_secs(),
+                   "first_run_in_s" => next.as_secs());
+        }
+
+        while !self.stop.load(Ordering::SeqCst) {
+            let now = Instant::now();
+            let mut next = Instant::now() + Duration::from_secs(365 * 24 * 60 * 60);
+            for task in self.tasks.iter_mut() {
+                if task.next_run < now {
+                    // This will become obnoxious pretty quickly
+                    trace!(self.logger, "Running job"; "name" => task.job.name());
+                    // We only run one job at a time since we don't want to
+                    // deal with the same job possibly starting twice.
+                    task.job.run(&task.logger).await;
+                    task.next_run = Instant::now() + task.interval;
+                }
+                next = next.min(task.next_run);
+            }
+            let wait = next.saturating_duration_since(Instant::now());
+            tokio::time::sleep(wait).await;
+        }
+        self.stop.store(false, Ordering::SeqCst);
+        warn!(self.logger, "Received request to stop. Stopping runner");
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+    use std::sync::{Arc, Mutex};
+    use test_store::LOGGER;
+
+    struct CounterJob {
+        count: Arc<Mutex<usize>>,
+    }
+
+    #[async_trait]
+    impl Job for CounterJob {
+        fn name(&self) -> &str {
+            "counter job"
+        }
+
+        async fn run(&self, _: &Logger) {
+            let mut count = self.count.lock().expect("Failed to lock count");
+            if *count < 10 {
+                *count += 1;
+            }
+        }
+    }
+
+    #[tokio::test(flavor = "multi_thread")]
+    async fn jobs_run() {
+        let count = Arc::new(Mutex::new(0));
+        let job = CounterJob {
+            count: count.clone(),
+        };
+        let mut runner = Runner::new(&*LOGGER);
+        runner.register(Arc::new(job), Duration::from_millis(10));
+        let stop = runner.stop.clone();
+
+        crate::spawn_blocking(runner.start());
+
+        let start = Instant::now();
+        loop {
+            let current = { *count.lock().unwrap() };
+            if current >= 10 {
+                break;
+            }
+            if start.elapsed() > Duration::from_secs(2) {
+                assert!(false, "Counting to 10 took longer than 2 seconds");
+            }
+        }
+
+        stop.store(true, Ordering::SeqCst);
+        // Wait for the runner to shut down
+        while stop.load(Ordering::SeqCst) {
+            tokio::time::sleep(Duration::from_millis(10)).await;
+        }
+    }
+}
diff --git a/graph/src/util/lfu_cache.rs b/graph/src/util/lfu_cache.rs
new file mode 100644
index 0000000..55f252c
--- /dev/null
+++ b/graph/src/util/lfu_cache.rs
@@ -0,0 +1,334 @@
+use crate::env::ENV_VARS;
+use crate::prelude::CacheWeight;
+use priority_queue::PriorityQueue;
+use std::cmp::Reverse;
+use std::fmt::Debug;
+use std::hash::{Hash, Hasher};
+use std::time::{Duration, Instant};
+
+// The number of `evict` calls without access after which an entry is considered stale.
+const STALE_PERIOD: u64 = 100;
+
+/// `PartialEq` and `Hash` are delegated to the `key`.
+#[derive(Clone, Debug)]
+pub struct CacheEntry<K, V> {
+    weight: usize,
+    key: K,
+    value: V,
+    will_stale: bool,
+}
+
+impl<K: Eq, V> PartialEq for CacheEntry<K, V> {
+    fn eq(&self, other: &Self) -> bool {
+        self.key.eq(&other.key)
+    }
+}
+
+impl<K: Eq, V> Eq for CacheEntry<K, V> {}
+
+impl<K: Hash, V> Hash for CacheEntry<K, V> {
+    fn hash<H: Hasher>(&self, state: &mut H) {
+        self.key.hash(state)
+    }
+}
+
+impl<K, V: Default + CacheWeight> CacheEntry<K, V> {
+    fn cache_key(key: K) -> Self {
+        // Only the key matters for finding an entry in the cache.
+        CacheEntry {
+            key,
+            value: V::default(),
+            weight: 0,
+            will_stale: false,
+        }
+    }
+}
+
+impl<K: CacheWeight, V: Default + CacheWeight> CacheEntry<K, V> {
+    /// Estimate the size of a `CacheEntry` with the given key and value. Do
+    /// not count the size of `Self` since that is memory that is not freed
+    /// when the cache entry is dropped as its storage is embedded in the
+    /// `PriorityQueue`
+    fn weight(key: &K, value: &V) -> usize {
+        value.indirect_weight() + key.indirect_weight()
+    }
+}
+
+// The priorities are `(stale, frequency)` tuples, first all stale entries will be popped and
+// then non-stale entries by least frequency.
+type Priority = (bool, Reverse<u64>);
+
+/// Statistics about what happened during cache eviction
+pub struct EvictStats {
+    /// The weight of the cache after eviction
+    pub new_weight: usize,
+    /// The weight of the items that were evicted
+    pub evicted_weight: usize,
+    /// The number of entries after eviction
+    pub new_count: usize,
+    /// The number if entries that were evicted
+    pub evicted_count: usize,
+    /// Whether we updated the stale status of entries
+    pub stale_update: bool,
+    /// How long eviction took
+    pub evict_time: Duration,
+}
+
+/// Each entry in the cache has a frequency, which is incremented by 1 on access. Entries also have
+/// a weight, upon eviction first stale entries will be removed and then non-stale entries by order
+/// of least frequency until the max weight is respected. This cache only removes entries on calls
+/// to `evict`, so the max weight may be exceeded until `evict` is called. Every STALE_PERIOD
+/// evictions entities are checked for staleness.
+#[derive(Debug)]
+pub struct LfuCache<K: Eq + Hash, V> {
+    queue: PriorityQueue<CacheEntry<K, V>, Priority>,
+    total_weight: usize,
+    stale_counter: u64,
+    dead_weight: bool,
+}
+
+impl<K: Ord + Eq + Hash, V> Default for LfuCache<K, V> {
+    fn default() -> Self {
+        LfuCache {
+            queue: PriorityQueue::new(),
+            total_weight: 0,
+            stale_counter: 0,
+            dead_weight: false,
+        }
+    }
+}
+
+impl<K: Clone + Ord + Eq + Hash + Debug + CacheWeight, V: CacheWeight + Default> LfuCache<K, V> {
+    pub fn new() -> Self {
+        LfuCache {
+            queue: PriorityQueue::new(),
+            total_weight: 0,
+            stale_counter: 0,
+            dead_weight: ENV_VARS.mappings.entity_cache_dead_weight,
+        }
+    }
+
+    /// Updates and bumps freceny if already present.
+    pub fn insert(&mut self, key: K, value: V) {
+        let weight = CacheEntry::weight(&key, &value);
+        match self.get_mut(key.clone()) {
+            None => {
+                self.total_weight += weight;
+                self.queue.push(
+                    CacheEntry {
+                        weight,
+                        key,
+                        value,
+                        will_stale: false,
+                    },
+                    (false, Reverse(1)),
+                );
+            }
+            Some(entry) => {
+                let old_weight = entry.weight;
+                entry.weight = weight;
+                entry.value = value;
+                self.total_weight -= old_weight;
+                self.total_weight += weight;
+            }
+        }
+    }
+
+    #[cfg(test)]
+    fn weight(&self, key: K) -> usize {
+        let key_entry = CacheEntry::cache_key(key);
+        self.queue
+            .get(&key_entry)
+            .map(|(entry, _)| entry.weight)
+            .unwrap_or(0)
+    }
+
+    fn get_mut(&mut self, key: K) -> Option<&mut CacheEntry<K, V>> {
+        // Increment the frequency by 1
+        let key_entry = CacheEntry::cache_key(key);
+        self.queue
+            .change_priority_by(&key_entry, |(s, Reverse(f))| (s, Reverse(f + 1)));
+        self.queue.get_mut(&key_entry).map(|x| {
+            x.0.will_stale = false;
+            x.0
+        })
+    }
+
+    pub fn get(&mut self, key: &K) -> Option<&V> {
+        self.get_mut(key.clone()).map(|x| &x.value)
+    }
+
+    pub fn remove(&mut self, key: &K) -> Option<V> {
+        // `PriorityQueue` doesn't have a remove method, so emulate that by setting the priority to
+        // the absolute minimum and popping.
+        let key_entry = CacheEntry::cache_key(key.clone());
+        self.queue
+            .change_priority(&key_entry, (true, Reverse(u64::min_value())))
+            .and_then(|_| {
+                self.queue.pop().map(|(e, _)| {
+                    assert_eq!(e.key, key_entry.key);
+                    self.total_weight -= e.weight;
+                    e.value
+                })
+            })
+    }
+
+    pub fn contains_key(&self, key: &K) -> bool {
+        self.queue
+            .get(&CacheEntry::cache_key(key.clone()))
+            .is_some()
+    }
+
+    pub fn is_empty(&self) -> bool {
+        self.queue.is_empty()
+    }
+
+    pub fn len(&self) -> usize {
+        self.queue.len()
+    }
+
+    /// Same as `evict_with_period(max_weight, STALE_PERIOD)`
+    pub fn evict(&mut self, max_weight: usize) -> Option<EvictStats> {
+        self.evict_with_period(max_weight, STALE_PERIOD)
+    }
+
+    /// Evict entries in the cache until the total weight of the cache is
+    /// equal to or smaller than `max_weight`.
+    ///
+    /// The return value is mostly useful for testing and diagnostics and can
+    /// safely ignored in normal use. It gives the sum of the weight of all
+    /// evicted entries, the weight before anything was evicted and the new
+    /// total weight of the cache, in that order, if anything was evicted
+    /// at all. If there was no reason to evict, `None` is returned.
+    pub fn evict_with_period(
+        &mut self,
+        max_weight: usize,
+        stale_period: u64,
+    ) -> Option<EvictStats> {
+        if self.total_weight <= max_weight {
+            return None;
+        }
+
+        let start = Instant::now();
+
+        self.stale_counter += 1;
+        if self.stale_counter == stale_period {
+            self.stale_counter = 0;
+
+            // Entries marked `will_stale` were not accessed in this period. Properly mark them as
+            // stale in their priorities. Also mark all entities as `will_stale` for the _next_
+            // period so that they will be marked stale next time unless they are updated or looked
+            // up between now and then.
+            for (e, p) in self.queue.iter_mut() {
+                p.0 = e.will_stale;
+                e.will_stale = true;
+            }
+        }
+
+        let mut evicted = 0;
+        let old_len = self.len();
+        let dead_weight = if self.dead_weight {
+            self.len() * (std::mem::size_of::<CacheEntry<K, V>>() + 40)
+        } else {
+            0
+        };
+        while self.total_weight + dead_weight > max_weight {
+            let entry = self
+                .queue
+                .pop()
+                .expect("empty cache but total_weight > max_weight")
+                .0;
+            evicted += entry.weight;
+            self.total_weight -= entry.weight;
+        }
+        Some(EvictStats {
+            new_weight: self.total_weight,
+            evicted_weight: evicted,
+            new_count: self.len(),
+            evicted_count: old_len - self.len(),
+            stale_update: self.stale_counter == 0,
+            evict_time: start.elapsed(),
+        })
+    }
+}
+
+impl<K: Ord + Eq + Hash + 'static, V: 'static> IntoIterator for LfuCache<K, V> {
+    type Item = (CacheEntry<K, V>, Priority);
+    type IntoIter = Box<dyn Iterator<Item = Self::Item>>;
+
+    fn into_iter(self) -> Self::IntoIter {
+        Box::new(self.queue.into_iter())
+    }
+}
+
+impl<K: Ord + Eq + Hash, V> Extend<(CacheEntry<K, V>, Priority)> for LfuCache<K, V> {
+    fn extend<T: IntoIterator<Item = (CacheEntry<K, V>, Priority)>>(&mut self, iter: T) {
+        self.queue.extend(iter);
+    }
+}
+
+#[test]
+fn entity_lru_cache() {
+    #[derive(Default, Debug, PartialEq, Eq)]
+    struct Weight(usize);
+
+    impl CacheWeight for Weight {
+        fn weight(&self) -> usize {
+            self.indirect_weight()
+        }
+
+        fn indirect_weight(&self) -> usize {
+            self.0
+        }
+    }
+
+    let mut cache: LfuCache<&'static str, Weight> = LfuCache::new();
+    cache.insert("panda", Weight(2));
+    cache.insert("cow", Weight(1));
+    let panda_weight = cache.weight("panda");
+    let cow_weight = cache.weight("cow");
+
+    assert_eq!(cache.get(&"cow"), Some(&Weight(1)));
+    assert_eq!(cache.get(&"panda"), Some(&Weight(2)));
+
+    // Nothing is evicted.
+    cache.evict(panda_weight + cow_weight);
+    assert_eq!(cache.len(), 2);
+
+    // "cow" was accessed twice, so "panda" is evicted.
+    cache.get(&"cow");
+    cache.evict(cow_weight);
+    assert!(cache.get(&"panda").is_none());
+
+    cache.insert("alligator", Weight(2));
+    let alligator_weight = cache.weight("alligator");
+
+    // Give "cow" and "alligator" a high frequency.
+    for _ in 0..1000 {
+        cache.get(&"cow");
+        cache.get(&"alligator");
+    }
+
+    // Insert a lion and make it weigh the same as the cow and the alligator
+    // together.
+    cache.insert("lion", Weight(0));
+    let lion_weight = cache.weight("lion");
+    let lion_inner_weight = cow_weight + alligator_weight - lion_weight;
+    cache.insert("lion", Weight(lion_inner_weight));
+    let lion_weight = cache.weight("lion");
+
+    // Make "cow" and "alligator" stale and remove them.
+    for _ in 0..(2 * STALE_PERIOD) {
+        cache.get(&"lion");
+
+        // The "whale" is something to evict so the stale counter moves.
+        cache.insert("whale", Weight(100 * lion_weight));
+        cache.evict(2 * lion_weight);
+    }
+
+    // Either "cow" and "alligator" fit in the cache, or just "lion".
+    // "lion" will be kept, it had lower frequency but was not stale.
+    assert!(cache.get(&"cow").is_none());
+    assert!(cache.get(&"alligator").is_none());
+    assert_eq!(cache.get(&"lion"), Some(&Weight(lion_inner_weight)));
+}
diff --git a/graph/src/util/mem.rs b/graph/src/util/mem.rs
new file mode 100644
index 0000000..b98b7d5
--- /dev/null
+++ b/graph/src/util/mem.rs
@@ -0,0 +1,13 @@
+use std::mem::{transmute, MaybeUninit};
+
+/// Temporarily needed until MaybeUninit::write_slice is stabilized.
+pub fn init_slice<'a, T>(src: &[T], dst: &'a mut [MaybeUninit<T>]) -> &'a mut [T]
+where
+    T: Copy,
+{
+    unsafe {
+        let uninit_src: &[MaybeUninit<T>] = transmute(src);
+        dst.copy_from_slice(uninit_src);
+        &mut *(dst as *mut [MaybeUninit<T>] as *mut [T])
+    }
+}
diff --git a/graph/src/util/mod.rs b/graph/src/util/mod.rs
new file mode 100644
index 0000000..8af2540
--- /dev/null
+++ b/graph/src/util/mod.rs
@@ -0,0 +1,31 @@
+/// Utilities for working with futures.
+pub mod futures;
+
+/// Security utilities.
+pub mod security;
+
+pub mod lfu_cache;
+
+pub mod timed_cache;
+
+pub mod error;
+
+pub mod stats;
+
+pub mod cache_weight;
+
+pub mod timed_rw_lock;
+
+pub mod jobs;
+
+/// Increasingly longer sleeps to back off some repeated operation
+pub mod backoff;
+
+pub mod bounded_queue;
+
+pub mod stable_hash_glue;
+
+pub mod mem;
+
+/// Data structures instrumented with Prometheus metrics.
+pub mod monitored;
diff --git a/graph/src/util/monitored.rs b/graph/src/util/monitored.rs
new file mode 100644
index 0000000..c0f7147
--- /dev/null
+++ b/graph/src/util/monitored.rs
@@ -0,0 +1,39 @@
+use prometheus::{Counter, Gauge};
+use std::collections::VecDeque;
+
+pub struct MonitoredVecDeque<T> {
+    vec_deque: VecDeque<T>,
+    depth: Gauge,
+    popped: Counter,
+}
+
+impl<T> MonitoredVecDeque<T> {
+    pub fn new(depth: Gauge, popped: Counter) -> Self {
+        Self {
+            vec_deque: VecDeque::new(),
+            depth,
+            popped,
+        }
+    }
+
+    pub fn push_back(&mut self, item: T) {
+        self.vec_deque.push_back(item);
+        self.depth.set(self.vec_deque.len() as f64);
+    }
+
+    pub fn push_front(&mut self, item: T) {
+        self.vec_deque.push_front(item);
+        self.depth.set(self.vec_deque.len() as f64);
+    }
+
+    pub fn pop_front(&mut self) -> Option<T> {
+        let item = self.vec_deque.pop_front();
+        self.depth.set(self.vec_deque.len() as f64);
+        self.popped.inc();
+        item
+    }
+
+    pub fn is_empty(&self) -> bool {
+        self.vec_deque.is_empty()
+    }
+}
diff --git a/graph/src/util/security.rs b/graph/src/util/security.rs
new file mode 100644
index 0000000..4e19fb1
--- /dev/null
+++ b/graph/src/util/security.rs
@@ -0,0 +1,40 @@
+use std::fmt;
+use url::Url;
+
+/// Helper function to redact passwords from URLs
+fn display_url(url: &str) -> String {
+    let mut url = match Url::parse(url) {
+        Ok(url) => url,
+        Err(_) => return String::from(url),
+    };
+
+    if url.password().is_some() {
+        url.set_password(Some("HIDDEN_PASSWORD"))
+            .expect("failed to redact password");
+    }
+
+    String::from(url)
+}
+
+pub struct SafeDisplay<T>(pub T);
+
+impl<T: fmt::Display> fmt::Display for SafeDisplay<T> {
+    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
+        // First, format the inner value
+        let inner = format!("{}", self.0);
+
+        // Then, make sure to redact passwords from the inner string
+        write!(f, "{}", display_url(inner.as_str()))
+    }
+}
+
+impl<T: fmt::Display> slog::Value for SafeDisplay<T> {
+    fn serialize(
+        &self,
+        _rec: &slog::Record,
+        key: slog::Key,
+        serializer: &mut dyn slog::Serializer,
+    ) -> slog::Result {
+        serializer.emit_str(key, format!("{}", self).as_str())
+    }
+}
diff --git a/graph/src/util/stable_hash_glue.rs b/graph/src/util/stable_hash_glue.rs
new file mode 100644
index 0000000..8c872c4
--- /dev/null
+++ b/graph/src/util/stable_hash_glue.rs
@@ -0,0 +1,40 @@
+use stable_hash::{StableHash, StableHasher};
+use stable_hash_legacy::prelude::{
+    StableHash as StableHashLegacy, StableHasher as StableHasherLegacy,
+};
+
+/// Implements StableHash and StableHashLegacy. This macro supports two forms:
+/// Struct { field1, field2, ... } and Tuple(transparent). Each field supports
+/// an optional modifier. For example: Tuple(transparent: AsBytes)
+#[macro_export]
+macro_rules! _impl_stable_hash {
+    ($T:ident$(<$lt:lifetime>)? {$($field:ident$(:$e:path)?),*}) => {
+        ::stable_hash::impl_stable_hash!($T$(<$lt>)? {$($field$(:$e)?),*});
+        ::stable_hash_legacy::impl_stable_hash!($T$(<$lt>)? {$($field$(:$e)?),*});
+    };
+    ($T:ident$(<$lt:lifetime>)? (transparent$(:$e:path)?)) => {
+        ::stable_hash::impl_stable_hash!($T$(<$lt>)? (transparent$(:$e)?));
+        ::stable_hash_legacy::impl_stable_hash!($T$(<$lt>)? (transparent$(:$e)?));
+    };
+}
+pub use crate::_impl_stable_hash as impl_stable_hash;
+
+pub struct AsBytes<T>(pub T);
+
+impl<T> StableHashLegacy for AsBytes<T>
+where
+    T: AsRef<[u8]>,
+{
+    fn stable_hash<H: StableHasherLegacy>(&self, sequence_number: H::Seq, state: &mut H) {
+        stable_hash_legacy::utils::AsBytes(self.0.as_ref()).stable_hash(sequence_number, state);
+    }
+}
+
+impl<T> StableHash for AsBytes<T>
+where
+    T: AsRef<[u8]>,
+{
+    fn stable_hash<H: StableHasher>(&self, field_address: H::Addr, state: &mut H) {
+        stable_hash::utils::AsBytes(self.0.as_ref()).stable_hash(field_address, state);
+    }
+}
diff --git a/graph/src/util/stats.rs b/graph/src/util/stats.rs
new file mode 100644
index 0000000..b5e04c5
--- /dev/null
+++ b/graph/src/util/stats.rs
@@ -0,0 +1,222 @@
+use std::collections::VecDeque;
+use std::time::{Duration, Instant};
+
+use prometheus::Gauge;
+
+use crate::prelude::ENV_VARS;
+
+/// One bin of durations. The bin starts at time `start`, and we've added `count`
+/// entries to it whose durations add up to `duration`
+struct Bin {
+    start: Instant,
+    duration: Duration,
+    count: u32,
+}
+
+impl Bin {
+    fn new(start: Instant) -> Self {
+        Self {
+            start,
+            duration: Duration::from_millis(0),
+            count: 0,
+        }
+    }
+
+    /// Add a new measurement to the bin
+    fn add(&mut self, duration: Duration) {
+        self.count += 1;
+        self.duration += duration;
+    }
+
+    /// Remove the measurements for `other` from this bin. Only used to
+    /// keep a running total of measurements in `MovingStats`
+    fn remove(&mut self, other: &Bin) {
+        self.count -= other.count;
+        self.duration -= other.duration;
+    }
+
+    /// Return `true` if the average of measurements in this bin is above
+    /// `duration`
+    fn average_gt(&self, duration: Duration) -> bool {
+        // Compute self.duration / self.count > duration as
+        // self.duration > duration * self.count. If the RHS
+        // overflows, we assume the average would have been smaller
+        // than any duration
+        duration
+            .checked_mul(self.count)
+            .map(|rhs| self.duration > rhs)
+            .unwrap_or(false)
+    }
+}
+
+/// Collect statistics over a moving window of size `window_size`. To keep
+/// the amount of memory needed to store the values inside the window
+/// constant, values are put into bins of size `bin_size`. For example, using
+/// a `window_size` of 5 minutes and a bin size of one second would use
+/// 300 bins. Each bin has constant size
+pub struct MovingStats {
+    window_size: Duration,
+    bin_size: Duration,
+    /// The buffer with measurements. The back has the most recent entries,
+    /// and the front has the oldest entries
+    bins: VecDeque<Bin>,
+    /// Sum over the values in `elements` The `start` of this bin
+    /// is meaningless
+    total: Bin,
+}
+
+/// Create `MovingStats` that use the window and bin sizes configured in
+/// the environment
+impl Default for MovingStats {
+    fn default() -> Self {
+        Self::new(ENV_VARS.load_window_size, ENV_VARS.load_bin_size)
+    }
+}
+
+impl MovingStats {
+    /// Track moving statistics over a window of `window_size` duration
+    /// and keep the measurements in bins of `bin_size` each.
+    ///
+    /// # Panics
+    ///
+    /// Panics if `window_size` or `bin_size` is `0`, or if `bin_size` >=
+    /// `window_size`
+    pub fn new(window_size: Duration, bin_size: Duration) -> Self {
+        assert!(window_size.as_millis() > 0);
+        assert!(bin_size.as_millis() > 0);
+        assert!(window_size > bin_size);
+
+        let capacity = window_size.as_millis() as usize / bin_size.as_millis() as usize;
+
+        MovingStats {
+            window_size,
+            bin_size,
+            bins: VecDeque::with_capacity(capacity),
+            total: Bin::new(Instant::now()),
+        }
+    }
+
+    /// Return `true` if the average of measurements in within `window_size`
+    /// is above `duration`
+    pub fn average_gt(&self, duration: Duration) -> bool {
+        // Depending on how often add() is called, we should
+        // call expire_bins first, but that would require taking a
+        // `&mut self`
+        self.total.average_gt(duration)
+    }
+
+    /// Return the average over the current window in milliseconds
+    pub fn average(&self) -> Option<Duration> {
+        self.total.duration.checked_div(self.total.count)
+    }
+
+    pub fn add(&mut self, duration: Duration) {
+        self.add_at(Instant::now(), duration);
+    }
+
+    /// Add an entry with the given timestamp. Note that the entry will
+    /// still be added either to the current latest bin or a new
+    /// latest bin. It is expected that subsequent calls to `add_at` still
+    /// happen with monotonically increasing `now` values. If the `now`
+    /// values do not monotonically increase, the average calculation
+    /// becomes imprecise because values are expired later than they
+    /// should be.
+    pub fn add_at(&mut self, now: Instant, duration: Duration) {
+        let need_new_bin = self
+            .bins
+            .back()
+            .map(|bin| now.saturating_duration_since(bin.start) >= self.bin_size)
+            .unwrap_or(true);
+        if need_new_bin {
+            self.bins.push_back(Bin::new(now));
+        }
+        self.expire_bins(now);
+        // unwrap is fine because we just added a bin if there wasn't one
+        // before
+        let bin = self.bins.back_mut().unwrap();
+        bin.add(duration);
+        self.total.add(duration);
+    }
+
+    fn expire_bins(&mut self, now: Instant) {
+        while self
+            .bins
+            .front()
+            .map(|existing| now.saturating_duration_since(existing.start) >= self.window_size)
+            .unwrap_or(false)
+        {
+            if let Some(existing) = self.bins.pop_front() {
+                self.total.remove(&existing);
+            }
+        }
+    }
+
+    pub fn duration(&self) -> Duration {
+        self.total.duration
+    }
+
+    /// Adds `duration` to the stats, and register the average ms to `avg_gauge`.
+    pub fn add_and_register(&mut self, duration: Duration, avg_gauge: &Gauge) {
+        let wait_avg = {
+            self.add(duration);
+            self.average()
+        };
+        let wait_avg = wait_avg.map(|wait_avg| wait_avg.as_millis()).unwrap_or(0);
+        avg_gauge.set(wait_avg as f64);
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+    use std::time::{Duration, Instant};
+
+    #[allow(dead_code)]
+    fn dump_bin(msg: &str, bin: &Bin, start: Instant) {
+        println!(
+            "bin[{}]: age={}ms count={} duration={}ms",
+            msg,
+            bin.start.saturating_duration_since(start).as_millis(),
+            bin.count,
+            bin.duration.as_millis()
+        );
+    }
+
+    #[test]
+    fn add_one_const() {
+        let mut stats = MovingStats::new(Duration::from_secs(5), Duration::from_secs(1));
+        let start = Instant::now();
+        for i in 0..10 {
+            stats.add_at(start + Duration::from_secs(i), Duration::from_secs(1));
+        }
+        assert_eq!(5, stats.bins.len());
+        for (i, bin) in stats.bins.iter().enumerate() {
+            assert_eq!(1, bin.count);
+            assert_eq!(Duration::from_secs(1), bin.duration);
+            assert_eq!(Duration::from_secs(i as u64 + 5), (bin.start - start));
+        }
+        assert_eq!(5, stats.total.count);
+        assert_eq!(Duration::from_secs(5), stats.total.duration);
+        assert!(stats.average_gt(Duration::from_millis(900)));
+        assert!(!stats.average_gt(Duration::from_secs(1)));
+    }
+
+    #[test]
+    fn add_four_linear() {
+        let mut stats = MovingStats::new(Duration::from_secs(5), Duration::from_secs(1));
+        let start = Instant::now();
+        for i in 0..40 {
+            stats.add_at(
+                start + Duration::from_millis(250 * i),
+                Duration::from_secs(i),
+            );
+        }
+        assert_eq!(5, stats.bins.len());
+        for (b, bin) in stats.bins.iter().enumerate() {
+            assert_eq!(4, bin.count);
+            assert_eq!(Duration::from_secs(86 + 16 * b as u64), bin.duration);
+        }
+        assert_eq!(20, stats.total.count);
+        assert_eq!(Duration::from_secs(5 * 86 + 16 * 10), stats.total.duration);
+    }
+}
diff --git a/graph/src/util/timed_cache.rs b/graph/src/util/timed_cache.rs
new file mode 100644
index 0000000..1d2e6c7
--- /dev/null
+++ b/graph/src/util/timed_cache.rs
@@ -0,0 +1,103 @@
+use std::{
+    borrow::Borrow,
+    cmp::Eq,
+    collections::HashMap,
+    hash::Hash,
+    sync::{Arc, RwLock},
+    time::{Duration, Instant},
+};
+
+/// Caching of values for a specified amount of time
+#[derive(Debug)]
+struct CacheEntry<V> {
+    value: Arc<V>,
+    expires: Instant,
+}
+
+/// A cache that keeps entries live for a fixed amount of time. It is assumed
+/// that all that data that could possibly wind up in the cache is very small,
+/// and that expired entries are replaced by an updated entry whenever expiry
+/// is detected. In other words, the cache does not ever remove entries.
+#[derive(Debug)]
+pub struct TimedCache<K, V> {
+    ttl: Duration,
+    entries: RwLock<HashMap<K, CacheEntry<V>>>,
+}
+
+impl<K, V> TimedCache<K, V> {
+    pub fn new(ttl: Duration) -> Self {
+        Self {
+            ttl,
+            entries: RwLock::new(HashMap::new()),
+        }
+    }
+
+    /// Return the entry for `key` if it exists and is not expired yet, and
+    /// return `None` otherwise. Note that expired entries stay in the cache
+    /// as it is assumed that, after returning `None`, the caller will
+    /// immediately overwrite that entry with a call to `set`
+    pub fn get<Q: ?Sized>(&self, key: &Q) -> Option<Arc<V>>
+    where
+        K: Borrow<Q> + Eq + Hash,
+        Q: Hash + Eq,
+    {
+        self.get_at(key, Instant::now())
+    }
+
+    fn get_at<Q: ?Sized>(&self, key: &Q, now: Instant) -> Option<Arc<V>>
+    where
+        K: Borrow<Q> + Eq + Hash,
+        Q: Hash + Eq,
+    {
+        match self.entries.read().unwrap().get(key) {
+            Some(CacheEntry { value, expires }) if expires >= &now => Some(value.clone()),
+            _ => None,
+        }
+    }
+
+    /// Associate `key` with `value` in the cache. The `value` will be
+    /// valid for `self.ttl` duration
+    pub fn set(&self, key: K, value: Arc<V>)
+    where
+        K: Eq + Hash,
+    {
+        self.set_at(key, value, Instant::now())
+    }
+
+    fn set_at(&self, key: K, value: Arc<V>, now: Instant)
+    where
+        K: Eq + Hash,
+    {
+        let entry = CacheEntry {
+            value,
+            expires: now + self.ttl,
+        };
+        self.entries.write().unwrap().insert(key, entry);
+    }
+
+    pub fn clear(&self) {
+        self.entries.write().unwrap().clear();
+    }
+
+    pub fn find<F>(&self, pred: F) -> Option<Arc<V>>
+    where
+        F: Fn(&V) -> bool,
+    {
+        self.entries
+            .read()
+            .unwrap()
+            .values()
+            .find(move |entry| pred(entry.value.as_ref()))
+            .map(|entry| entry.value.clone())
+    }
+}
+
+#[test]
+fn cache() {
+    const KEY: &str = "one";
+    let cache = TimedCache::<String, String>::new(Duration::from_millis(10));
+    let now = Instant::now();
+    cache.set_at(KEY.to_string(), Arc::new("value".to_string()), now);
+    assert!(cache.get_at(KEY, now + Duration::from_millis(5)).is_some());
+    assert!(cache.get_at(KEY, now + Duration::from_millis(15)).is_none());
+}
diff --git a/graph/src/util/timed_rw_lock.rs b/graph/src/util/timed_rw_lock.rs
new file mode 100644
index 0000000..6a9a486
--- /dev/null
+++ b/graph/src/util/timed_rw_lock.rs
@@ -0,0 +1,84 @@
+use parking_lot::{Mutex, RwLock};
+use slog::{warn, Logger};
+use std::time::{Duration, Instant};
+
+use crate::prelude::ENV_VARS;
+
+/// Adds instrumentation for timing the performance of the lock.
+pub struct TimedRwLock<T> {
+    id: String,
+    lock: RwLock<T>,
+    log_threshold: Duration,
+}
+
+impl<T> TimedRwLock<T> {
+    pub fn new(x: T, id: impl Into<String>) -> Self {
+        TimedRwLock {
+            id: id.into(),
+            lock: RwLock::new(x),
+            log_threshold: ENV_VARS.lock_contention_log_threshold,
+        }
+    }
+
+    pub fn write(&self, logger: &Logger) -> parking_lot::RwLockWriteGuard<T> {
+        loop {
+            let mut elapsed = Duration::from_secs(0);
+            match self.lock.try_write_for(self.log_threshold) {
+                Some(guard) => break guard,
+                None => {
+                    elapsed += self.log_threshold;
+                    warn!(logger, "Write lock taking a long time to acquire";
+                                  "id" => &self.id,
+                                  "wait_ms" => elapsed.as_millis(),
+                    );
+                }
+            }
+        }
+    }
+
+    pub fn read(&self, logger: &Logger) -> parking_lot::RwLockReadGuard<T> {
+        loop {
+            let mut elapsed = Duration::from_secs(0);
+            match self.lock.try_read_for(self.log_threshold) {
+                Some(guard) => break guard,
+                None => {
+                    elapsed += self.log_threshold;
+                    warn!(logger, "Read lock taking a long time to acquire";
+                                  "id" => &self.id,
+                                  "wait_ms" => elapsed.as_millis(),
+                    );
+                }
+            }
+        }
+    }
+}
+
+/// Adds instrumentation for timing the performance of the lock.
+pub struct TimedMutex<T> {
+    id: String,
+    lock: Mutex<T>,
+    log_threshold: Duration,
+}
+
+impl<T> TimedMutex<T> {
+    pub fn new(x: T, id: impl Into<String>) -> Self {
+        TimedMutex {
+            id: id.into(),
+            lock: Mutex::new(x),
+            log_threshold: ENV_VARS.lock_contention_log_threshold,
+        }
+    }
+
+    pub fn lock(&self, logger: &Logger) -> parking_lot::MutexGuard<T> {
+        let start = Instant::now();
+        let guard = self.lock.lock();
+        let elapsed = start.elapsed();
+        if elapsed > self.log_threshold {
+            warn!(logger, "Mutex lock took a long time to acquire";
+                          "id" => &self.id,
+                          "wait_ms" => elapsed.as_millis(),
+            );
+        }
+        guard
+    }
+}
diff --git a/graph/tests/entity_cache.rs b/graph/tests/entity_cache.rs
new file mode 100644
index 0000000..10935fd
--- /dev/null
+++ b/graph/tests/entity_cache.rs
@@ -0,0 +1,350 @@
+use async_trait::async_trait;
+use graph::blockchain::block_stream::FirehoseCursor;
+use graph::blockchain::BlockPtr;
+use graph::data::subgraph::schema::{SubgraphError, SubgraphHealth};
+use graph::prelude::{Schema, StopwatchMetrics, StoreError, UnfailOutcome};
+use lazy_static::lazy_static;
+use slog::Logger;
+use std::collections::BTreeMap;
+use std::sync::Arc;
+
+use graph::components::store::{
+    EntityKey, EntityType, ReadStore, StoredDynamicDataSource, WritableStore,
+};
+use graph::{
+    components::store::{DeploymentId, DeploymentLocator},
+    prelude::{anyhow, DeploymentHash, Entity, EntityCache, EntityModification, Value},
+};
+
+lazy_static! {
+    static ref SUBGRAPH_ID: DeploymentHash = DeploymentHash::new("entity_cache").unwrap();
+    static ref DEPLOYMENT: DeploymentLocator =
+        DeploymentLocator::new(DeploymentId::new(-12), SUBGRAPH_ID.clone());
+    static ref SCHEMA: Arc<Schema> = Arc::new(
+        Schema::parse(
+            "
+            type Band @entity {
+                id: ID!
+                name: String!
+                founded: Int
+                label: String
+            }
+            ",
+            SUBGRAPH_ID.clone(),
+        )
+        .expect("Test schema invalid")
+    );
+}
+
+struct MockStore {
+    get_many_res: BTreeMap<EntityType, Vec<Entity>>,
+}
+
+impl MockStore {
+    fn new(get_many_res: BTreeMap<EntityType, Vec<Entity>>) -> Self {
+        Self { get_many_res }
+    }
+}
+
+impl ReadStore for MockStore {
+    fn get(&self, key: &EntityKey) -> Result<Option<Entity>, StoreError> {
+        match self.get_many_res.get(&key.entity_type) {
+            Some(entities) => Ok(entities
+                .iter()
+                .find(|entity| entity.id().ok().as_deref() == Some(key.entity_id.as_str()))
+                .cloned()),
+            None => Err(StoreError::Unknown(anyhow!(
+                "nothing for type {}",
+                key.entity_type
+            ))),
+        }
+    }
+
+    fn get_many(
+        &self,
+        _ids_for_type: BTreeMap<&EntityType, Vec<&str>>,
+    ) -> Result<BTreeMap<EntityType, Vec<Entity>>, StoreError> {
+        Ok(self.get_many_res.clone())
+    }
+
+    fn input_schema(&self) -> Arc<Schema> {
+        SCHEMA.clone()
+    }
+}
+
+#[async_trait]
+impl WritableStore for MockStore {
+    fn block_ptr(&self) -> Option<BlockPtr> {
+        unimplemented!()
+    }
+
+    fn block_cursor(&self) -> FirehoseCursor {
+        unimplemented!()
+    }
+
+    async fn start_subgraph_deployment(&self, _: &Logger) -> Result<(), StoreError> {
+        unimplemented!()
+    }
+
+    async fn revert_block_operations(
+        &self,
+        _: BlockPtr,
+        _: FirehoseCursor,
+    ) -> Result<(), StoreError> {
+        unimplemented!()
+    }
+
+    async fn unfail_deterministic_error(
+        &self,
+        _: &BlockPtr,
+        _: &BlockPtr,
+    ) -> Result<UnfailOutcome, StoreError> {
+        unimplemented!()
+    }
+
+    fn unfail_non_deterministic_error(&self, _: &BlockPtr) -> Result<UnfailOutcome, StoreError> {
+        unimplemented!()
+    }
+
+    async fn fail_subgraph(&self, _: SubgraphError) -> Result<(), StoreError> {
+        unimplemented!()
+    }
+
+    async fn supports_proof_of_indexing(&self) -> Result<bool, StoreError> {
+        unimplemented!()
+    }
+
+    async fn transact_block_operations(
+        &self,
+        _: BlockPtr,
+        _: FirehoseCursor,
+        _: Vec<EntityModification>,
+        _: &StopwatchMetrics,
+        _: Vec<StoredDynamicDataSource>,
+        _: Vec<SubgraphError>,
+        _: Vec<(u32, String)>,
+        _: Vec<StoredDynamicDataSource>,
+    ) -> Result<(), StoreError> {
+        unimplemented!()
+    }
+
+    async fn is_deployment_synced(&self) -> Result<bool, StoreError> {
+        unimplemented!()
+    }
+
+    fn unassign_subgraph(&self) -> Result<(), StoreError> {
+        unimplemented!()
+    }
+
+    async fn load_dynamic_data_sources(
+        &self,
+        _manifest_idx_and_name: Vec<(u32, String)>,
+    ) -> Result<Vec<StoredDynamicDataSource>, StoreError> {
+        unimplemented!()
+    }
+
+    fn deployment_synced(&self) -> Result<(), StoreError> {
+        unimplemented!()
+    }
+
+    fn shard(&self) -> &str {
+        unimplemented!()
+    }
+
+    async fn health(&self) -> Result<SubgraphHealth, StoreError> {
+        unimplemented!()
+    }
+
+    async fn flush(&self) -> Result<(), StoreError> {
+        unimplemented!()
+    }
+}
+
+fn make_band(id: &'static str, data: Vec<(&str, Value)>) -> (EntityKey, Entity) {
+    (
+        EntityKey {
+            entity_type: EntityType::new("Band".to_string()),
+            entity_id: id.into(),
+        },
+        Entity::from(data),
+    )
+}
+
+fn sort_by_entity_key(mut mods: Vec<EntityModification>) -> Vec<EntityModification> {
+    mods.sort_by_key(|m| m.entity_ref().clone());
+    mods
+}
+
+#[tokio::test]
+async fn empty_cache_modifications() {
+    let store = Arc::new(MockStore::new(BTreeMap::new()));
+    let cache = EntityCache::new(store.clone());
+    let result = cache.as_modifications();
+    assert_eq!(result.unwrap().modifications, vec![]);
+}
+
+#[test]
+fn insert_modifications() {
+    // Return no entities from the store, forcing the cache to treat any `set`
+    // operation as an insert.
+    let store = MockStore::new(BTreeMap::new());
+
+    let store = Arc::new(store);
+    let mut cache = EntityCache::new(store.clone());
+
+    let (mogwai_key, mogwai_data) = make_band(
+        "mogwai",
+        vec![("id", "mogwai".into()), ("name", "Mogwai".into())],
+    );
+    cache.set(mogwai_key.clone(), mogwai_data.clone()).unwrap();
+
+    let (sigurros_key, sigurros_data) = make_band(
+        "sigurros",
+        vec![("id", "sigurros".into()), ("name", "Sigur Ros".into())],
+    );
+    cache
+        .set(sigurros_key.clone(), sigurros_data.clone())
+        .unwrap();
+
+    let result = cache.as_modifications();
+    assert_eq!(
+        sort_by_entity_key(result.unwrap().modifications),
+        sort_by_entity_key(vec![
+            EntityModification::Insert {
+                key: mogwai_key,
+                data: mogwai_data,
+            },
+            EntityModification::Insert {
+                key: sigurros_key,
+                data: sigurros_data,
+            }
+        ])
+    );
+}
+
+fn entity_version_map(
+    entity_type: &str,
+    entities: Vec<Entity>,
+) -> BTreeMap<EntityType, Vec<Entity>> {
+    let mut map = BTreeMap::new();
+    map.insert(EntityType::from(entity_type), entities);
+    map
+}
+
+#[test]
+fn overwrite_modifications() {
+    // Pre-populate the store with entities so that the cache treats
+    // every set operation as an overwrite.
+    let store = {
+        let entities = vec![
+            make_band(
+                "mogwai",
+                vec![("id", "mogwai".into()), ("name", "Mogwai".into())],
+            )
+            .1,
+            make_band(
+                "sigurros",
+                vec![("id", "sigurros".into()), ("name", "Sigur Ros".into())],
+            )
+            .1,
+        ];
+        MockStore::new(entity_version_map("Band", entities))
+    };
+
+    let store = Arc::new(store);
+    let mut cache = EntityCache::new(store.clone());
+
+    let (mogwai_key, mogwai_data) = make_band(
+        "mogwai",
+        vec![
+            ("id", "mogwai".into()),
+            ("name", "Mogwai".into()),
+            ("founded", 1995.into()),
+        ],
+    );
+    cache.set(mogwai_key.clone(), mogwai_data.clone()).unwrap();
+
+    let (sigurros_key, sigurros_data) = make_band(
+        "sigurros",
+        vec![
+            ("id", "sigurros".into()),
+            ("name", "Sigur Ros".into()),
+            ("founded", 1994.into()),
+        ],
+    );
+    cache
+        .set(sigurros_key.clone(), sigurros_data.clone())
+        .unwrap();
+
+    let result = cache.as_modifications();
+    assert_eq!(
+        sort_by_entity_key(result.unwrap().modifications),
+        sort_by_entity_key(vec![
+            EntityModification::Overwrite {
+                key: mogwai_key,
+                data: mogwai_data,
+            },
+            EntityModification::Overwrite {
+                key: sigurros_key,
+                data: sigurros_data,
+            }
+        ])
+    );
+}
+
+#[test]
+fn consecutive_modifications() {
+    // Pre-populate the store with data so that we can test setting a field to
+    // `Value::Null`.
+    let store = {
+        let entities = vec![
+            make_band(
+                "mogwai",
+                vec![
+                    ("id", "mogwai".into()),
+                    ("name", "Mogwai".into()),
+                    ("label", "Chemikal Underground".into()),
+                ],
+            )
+            .1,
+        ];
+
+        MockStore::new(entity_version_map("Band", entities))
+    };
+
+    let store = Arc::new(store);
+    let mut cache = EntityCache::new(store.clone());
+
+    // First, add "founded" and change the "label".
+    let (update_key, update_data) = make_band(
+        "mogwai",
+        vec![
+            ("id", "mogwai".into()),
+            ("founded", 1995.into()),
+            ("label", "Rock Action Records".into()),
+        ],
+    );
+    cache.set(update_key.clone(), update_data.clone()).unwrap();
+
+    // Then, just reset the "label".
+    let (update_key, update_data) = make_band(
+        "mogwai",
+        vec![("id", "mogwai".into()), ("label", Value::Null)],
+    );
+    cache.set(update_key.clone(), update_data.clone()).unwrap();
+
+    // We expect a single overwrite modification for the above that leaves "id"
+    // and "name" untouched, sets "founded" and removes the "label" field.
+    let result = cache.as_modifications();
+    assert_eq!(
+        sort_by_entity_key(result.unwrap().modifications),
+        sort_by_entity_key(vec![EntityModification::Overwrite {
+            key: update_key,
+            data: Entity::from(vec![
+                ("id", "mogwai".into()),
+                ("name", "Mogwai".into()),
+                ("founded", 1995.into()),
+            ]),
+        },])
+    );
+}
diff --git a/graphql/Cargo.toml b/graphql/Cargo.toml
new file mode 100644
index 0000000..a973e20
--- /dev/null
+++ b/graphql/Cargo.toml
@@ -0,0 +1,24 @@
+[package]
+name = "graph-graphql"
+version = "0.27.0"
+edition = "2021"
+
+[dependencies]
+crossbeam = "0.8"
+graph = { path = "../graph" }
+graphql-parser = "0.4.0"
+graphql-tools = "0.2.0"
+indexmap = "1.9"
+Inflector = "0.11.3"
+lazy_static = "1.2.0"
+stable-hash_legacy = { version = "0.3.3", package = "stable-hash" }
+stable-hash = { version = "0.4.2"}
+defer = "0.1"
+parking_lot = "0.12"
+anyhow = "1.0"
+async-recursion = "1.0.0"
+
+[dev-dependencies]
+pretty_assertions = "1.3.0"
+test-store = { path = "../store/test-store" }
+graph-chain-ethereum = { path = "../chain/ethereum" }
diff --git a/graphql/examples/schema.rs b/graphql/examples/schema.rs
new file mode 100644
index 0000000..0bf77f7
--- /dev/null
+++ b/graphql/examples/schema.rs
@@ -0,0 +1,40 @@
+use graphql_parser::parse_schema;
+use std::env;
+use std::fs;
+use std::process::exit;
+
+use graph_graphql::schema::api::api_schema;
+
+pub fn usage(msg: &str) -> ! {
+    println!("{}", msg);
+    println!("usage: schema schema.graphql");
+    println!("\nPrint the API schema we derive from the given input schema");
+    std::process::exit(1);
+}
+
+pub fn ensure<T, E: std::fmt::Display>(res: Result<T, E>, msg: &str) -> T {
+    match res {
+        Ok(ok) => ok,
+        Err(err) => {
+            eprintln!("{}:\n    {}", msg, err);
+            exit(1)
+        }
+    }
+}
+
+pub fn main() {
+    let args: Vec<String> = env::args().collect();
+    let schema = match args.len() {
+        0 | 1 => usage("please provide a GraphQL schema"),
+        2 => args[1].clone(),
+        _ => usage("too many arguments"),
+    };
+    let schema = ensure(fs::read_to_string(schema), "Can not read schema file");
+    let schema = ensure(
+        parse_schema(&schema).map(|v| v.into_static()),
+        "Failed to parse schema",
+    );
+    let schema = ensure(api_schema(&schema), "Failed to convert to API schema");
+
+    println!("{}", schema);
+}
diff --git a/graphql/src/execution/ast.rs b/graphql/src/execution/ast.rs
new file mode 100644
index 0000000..2a0c19e
--- /dev/null
+++ b/graphql/src/execution/ast.rs
@@ -0,0 +1,376 @@
+use std::collections::HashSet;
+
+use graph::{
+    components::store::EntityType,
+    data::graphql::ObjectOrInterface,
+    prelude::{anyhow, q, r, s, ApiSchema, QueryExecutionError, ValueMap},
+};
+use graphql_parser::Pos;
+
+use crate::schema::ast::ObjectType;
+
+/// A selection set is a table that maps object types to the fields that
+/// should be selected for objects of that type. The types are always
+/// concrete object types, never interface or union types. When a
+/// `SelectionSet` is constructed, fragments must already have been resolved
+/// as it only allows using fields.
+///
+/// The set of types that a `SelectionSet` can accommodate must be set at
+/// the time the `SelectionSet` is constructed. It is not possible to add
+/// more types to it, but it is possible to add fields for all known types
+/// or only some of them
+#[derive(Debug, Clone, PartialEq)]
+pub struct SelectionSet {
+    // Map object types to the list of fields that should be selected for
+    // them. In most cases, this will have a single entry. If the
+    // `SelectionSet` is attached to a field with an interface or union
+    // type, it will have an entry for each object type implementing that
+    // interface or being part of the union
+    items: Vec<(ObjectType, Vec<Field>)>,
+}
+
+impl SelectionSet {
+    /// Create a new `SelectionSet` that can handle the given types
+    pub fn new(types: Vec<ObjectType>) -> Self {
+        let items = types
+            .into_iter()
+            .map(|obj_type| (obj_type, Vec::new()))
+            .collect();
+        SelectionSet { items }
+    }
+
+    /// Create a new `SelectionSet` that can handle the same types as
+    /// `other`, but ignore all fields from `other`
+    pub fn empty_from(other: &SelectionSet) -> Self {
+        let items = other
+            .items
+            .iter()
+            .map(|(name, _)| (name.clone(), Vec::new()))
+            .collect();
+        SelectionSet { items }
+    }
+
+    /// Return `true` if this selection set does not select any fields for
+    /// its types
+    pub fn is_empty(&self) -> bool {
+        self.items.iter().all(|(_, fields)| fields.is_empty())
+    }
+
+    /// If the selection set contains a single field across all its types,
+    /// return it. Otherwise, return `None`
+    pub fn single_field(&self) -> Option<&Field> {
+        let mut iter = self.items.iter();
+        let field = match iter.next() {
+            Some((_, fields)) => {
+                if fields.len() != 1 {
+                    return None;
+                } else {
+                    &fields[0]
+                }
+            }
+            None => return None,
+        };
+        for (_, fields) in iter {
+            if fields.len() != 1 {
+                return None;
+            }
+            if &fields[0] != field {
+                return None;
+            }
+        }
+        Some(field)
+    }
+
+    /// Iterate over all types and the fields for those types
+    pub fn fields(&self) -> impl Iterator<Item = (&ObjectType, impl Iterator<Item = &Field>)> {
+        self.items
+            .iter()
+            .map(|(obj_type, fields)| (obj_type, fields.iter()))
+    }
+
+    /// Iterate over all types and the fields that are not leaf fields, i.e.
+    /// whose selection sets are not empty
+    pub fn interior_fields(
+        &self,
+    ) -> impl Iterator<Item = (&ObjectType, impl Iterator<Item = &Field>)> {
+        self.items
+            .iter()
+            .map(|(obj_type, fields)| (obj_type, fields.iter().filter(|field| !field.is_leaf())))
+    }
+
+    /// Iterate over all fields for the given object type
+    pub fn fields_for(
+        &self,
+        obj_type: &ObjectType,
+    ) -> Result<impl Iterator<Item = &Field>, QueryExecutionError> {
+        let item = self
+            .items
+            .iter()
+            .find(|(our_type, _)| our_type == obj_type)
+            .ok_or_else(|| {
+                // see: graphql-bug-compat
+                // Once queries are validated, this can become a panic since
+                // users won't be able to trigger this any more
+                QueryExecutionError::ValidationError(
+                    None,
+                    format!("invalid query: no fields for type `{}`", obj_type.name),
+                )
+            })?;
+        Ok(item.1.iter())
+    }
+
+    /// Append the field for all the sets' types
+    pub fn push(&mut self, new_field: &Field) -> Result<(), QueryExecutionError> {
+        for (_, fields) in &mut self.items {
+            Self::merge_field(fields, new_field.clone())?;
+        }
+        Ok(())
+    }
+
+    /// Append the fields for all the sets' types
+    pub fn push_fields(&mut self, fields: Vec<&Field>) -> Result<(), QueryExecutionError> {
+        for field in fields {
+            self.push(field)?;
+        }
+        Ok(())
+    }
+
+    /// Merge `self` with the fields from `other`, which must have the same,
+    /// or a subset of, the types of `self`. The `directives` are added to
+    /// `self`'s directives so that they take precedence over existing
+    /// directives with the same name
+    pub fn merge(
+        &mut self,
+        other: SelectionSet,
+        directives: Vec<Directive>,
+    ) -> Result<(), QueryExecutionError> {
+        for (other_type, other_fields) in other.items {
+            let item = self
+                .items
+                .iter_mut()
+                .find(|(obj_type, _)| &other_type == obj_type)
+                .ok_or_else(|| {
+                    // graphql-bug-compat: once queries are validated, this
+                    // can become a panic since users won't be able to
+                    // trigger this anymore
+                    QueryExecutionError::ValidationError(
+                        None,
+                        format!(
+                            "invalid query: can not merge fields because type `{}` showed up unexpectedly",
+                            other_type.name
+                        ),
+                    )
+                })?;
+            for mut other_field in other_fields {
+                other_field.prepend_directives(directives.clone());
+                Self::merge_field(&mut item.1, other_field)?;
+            }
+        }
+        Ok(())
+    }
+
+    fn merge_field(fields: &mut Vec<Field>, new_field: Field) -> Result<(), QueryExecutionError> {
+        match fields
+            .iter_mut()
+            .find(|field| field.response_key() == new_field.response_key())
+        {
+            Some(field) => {
+                // TODO: check that _field and new_field are mergeable, in
+                // particular that their name, directives and arguments are
+                // compatible
+                field.selection_set.merge(new_field.selection_set, vec![])?;
+            }
+            None => fields.push(new_field),
+        }
+        Ok(())
+    }
+}
+
+#[derive(Debug, Clone, PartialEq)]
+pub struct Directive {
+    pub position: Pos,
+    pub name: String,
+    pub arguments: Vec<(String, r::Value)>,
+}
+
+impl Directive {
+    /// Looks up the value of an argument of this directive
+    pub fn argument_value(&self, name: &str) -> Option<&r::Value> {
+        self.arguments
+            .iter()
+            .find(|(n, _)| n == name)
+            .map(|(_, v)| v)
+    }
+
+    fn eval_if(&self) -> bool {
+        match self.argument_value("if") {
+            None => true,
+            Some(r::Value::Boolean(b)) => *b,
+            Some(_) => false,
+        }
+    }
+
+    /// Return `true` if this directive says that we should not include the
+    /// field it is attached to. That is the case if the directive is
+    /// `include` and its `if` condition is `false`, or if it is `skip` and
+    /// its `if` condition is `true`. In all other cases, return `false`
+    pub fn skip(&self) -> bool {
+        match self.name.as_str() {
+            "include" => !self.eval_if(),
+            "skip" => self.eval_if(),
+            _ => false,
+        }
+    }
+}
+
+/// A field to execute as part of a query. When the field is constructed by
+/// `Query::new`, variables are interpolated, and argument values have
+/// already been coerced to the appropriate types for the field argument
+#[derive(Debug, Clone, PartialEq)]
+pub struct Field {
+    pub position: Pos,
+    pub alias: Option<String>,
+    pub name: String,
+    pub arguments: Vec<(String, r::Value)>,
+    pub directives: Vec<Directive>,
+    pub selection_set: SelectionSet,
+}
+
+impl Field {
+    /// Returns the response key of a field, which is either its name or its
+    /// alias (if there is one).
+    pub fn response_key(&self) -> &str {
+        self.alias.as_deref().unwrap_or(self.name.as_str())
+    }
+
+    /// Looks up the value of an argument for this field
+    pub fn argument_value(&self, name: &str) -> Option<&r::Value> {
+        self.arguments
+            .iter()
+            .find(|(n, _)| n == name)
+            .map(|(_, v)| v)
+    }
+
+    fn prepend_directives(&mut self, mut directives: Vec<Directive>) {
+        // TODO: check that the new directives don't conflict with existing
+        // directives
+        std::mem::swap(&mut self.directives, &mut directives);
+        self.directives.extend(directives);
+    }
+
+    fn is_leaf(&self) -> bool {
+        self.selection_set.is_empty()
+    }
+}
+
+impl ValueMap for Field {
+    fn get_required<T: graph::prelude::TryFromValue>(&self, key: &str) -> Result<T, anyhow::Error> {
+        self.argument_value(key)
+            .ok_or_else(|| anyhow!("Required field `{}` not set", key))
+            .and_then(T::try_from_value)
+    }
+
+    fn get_optional<T: graph::prelude::TryFromValue>(
+        &self,
+        key: &str,
+    ) -> Result<Option<T>, anyhow::Error> {
+        self.argument_value(key)
+            .map_or(Ok(None), |value| match value {
+                r::Value::Null => Ok(None),
+                _ => T::try_from_value(value).map(Some),
+            })
+    }
+}
+
+/// A set of object types, generated from resolving interfaces into the
+/// object types that implement them, and possibly narrowing further when
+/// expanding fragments with type conditions
+#[derive(Debug, Clone, PartialEq)]
+pub(crate) enum ObjectTypeSet {
+    Any,
+    Only(HashSet<ObjectType>),
+}
+
+impl ObjectTypeSet {
+    pub fn convert(
+        schema: &ApiSchema,
+        type_cond: Option<&q::TypeCondition>,
+    ) -> Result<ObjectTypeSet, QueryExecutionError> {
+        match type_cond {
+            Some(q::TypeCondition::On(name)) => Self::from_name(schema, name),
+            None => Ok(ObjectTypeSet::Any),
+        }
+    }
+
+    pub fn from_name(schema: &ApiSchema, name: &str) -> Result<ObjectTypeSet, QueryExecutionError> {
+        let set = resolve_object_types(schema, name)?;
+        Ok(ObjectTypeSet::Only(set))
+    }
+
+    fn contains(&self, obj_type: &ObjectType) -> bool {
+        match self {
+            ObjectTypeSet::Any => true,
+            ObjectTypeSet::Only(set) => set.contains(obj_type),
+        }
+    }
+
+    pub fn intersect(self, other: &ObjectTypeSet) -> ObjectTypeSet {
+        match self {
+            ObjectTypeSet::Any => other.clone(),
+            ObjectTypeSet::Only(set) => {
+                ObjectTypeSet::Only(set.into_iter().filter(|ty| other.contains(ty)).collect())
+            }
+        }
+    }
+
+    /// Return a list of the object type names that are in this type set and
+    /// are also implementations of `current_type`
+    pub fn type_names(
+        &self,
+        schema: &ApiSchema,
+        current_type: ObjectOrInterface<'_>,
+    ) -> Result<Vec<ObjectType>, QueryExecutionError> {
+        Ok(resolve_object_types(schema, current_type.name())?
+            .into_iter()
+            .filter(|obj_type| match self {
+                ObjectTypeSet::Any => true,
+                ObjectTypeSet::Only(set) => set.contains(obj_type),
+            })
+            .collect())
+    }
+}
+
+/// Look up the type `name` from the schema and resolve interfaces
+/// and unions until we are left with a set of concrete object types
+pub(crate) fn resolve_object_types(
+    schema: &ApiSchema,
+    name: &str,
+) -> Result<HashSet<ObjectType>, QueryExecutionError> {
+    let mut set = HashSet::new();
+    match schema
+        .get_named_type(name)
+        .ok_or_else(|| QueryExecutionError::AbstractTypeError(name.to_string()))?
+    {
+        s::TypeDefinition::Interface(intf) => {
+            for obj_ty in &schema.types_for_interface()[&EntityType::new(intf.name.to_string())] {
+                let obj_ty = schema.object_type(obj_ty);
+                set.insert(obj_ty.into());
+            }
+        }
+        s::TypeDefinition::Union(tys) => {
+            for ty in &tys.types {
+                set.extend(resolve_object_types(schema, ty)?)
+            }
+        }
+        s::TypeDefinition::Object(ty) => {
+            let ty = schema.object_type(ty);
+            set.insert(ty.into());
+        }
+        s::TypeDefinition::Scalar(_)
+        | s::TypeDefinition::Enum(_)
+        | s::TypeDefinition::InputObject(_) => {
+            return Err(QueryExecutionError::NamedTypeError(name.to_string()));
+        }
+    }
+    Ok(set)
+}
diff --git a/graphql/src/execution/cache.rs b/graphql/src/execution/cache.rs
new file mode 100644
index 0000000..9343f5e
--- /dev/null
+++ b/graphql/src/execution/cache.rs
@@ -0,0 +1,251 @@
+use futures03::future::FutureExt;
+use futures03::future::Shared;
+use graph::{
+    prelude::{debug, futures03, BlockPtr, CheapClone, Logger, QueryResult},
+    util::timed_rw_lock::TimedMutex,
+};
+use stable_hash_legacy::crypto::SetHasher;
+use stable_hash_legacy::prelude::*;
+use std::future::Future;
+use std::pin::Pin;
+use std::sync::atomic::{AtomicU64, Ordering};
+use std::sync::Arc;
+use std::{collections::HashMap, time::Duration};
+use std::{
+    collections::{hash_map::Entry, VecDeque},
+    time::Instant,
+};
+
+use super::QueryHash;
+
+type Hash = <SetHasher as StableHasher>::Out;
+
+type PinFut<R> = Pin<Box<dyn Future<Output = R> + 'static + Send>>;
+/// Cache that keeps a result around as long as it is still being processed.
+/// The cache ensures that the query is not re-entrant, so multiple consumers
+/// of identical queries will not execute them in parallel.
+///
+/// This has a lot in common with AsyncCache in the network-services repo,
+/// but more specialized.
+pub struct QueryCache<R> {
+    cache: Arc<TimedMutex<HashMap<Hash, Shared<PinFut<R>>>>>,
+}
+
+impl<R: CheapClone> QueryCache<R> {
+    pub fn new(id: impl Into<String>) -> Self {
+        Self {
+            cache: Arc::new(TimedMutex::new(HashMap::new(), id)),
+        }
+    }
+
+    /// Assumption: Whatever F is passed in consistently returns the same
+    /// value for any input - for all values of F used with this Cache.
+    ///
+    /// Returns `(value, cached)`, where `cached` is true if the value was
+    /// already in the cache and false otherwise.
+    pub async fn cached_query<F: Future<Output = R> + Send + 'static>(
+        &self,
+        hash: Hash,
+        f: F,
+        logger: &Logger,
+    ) -> (R, bool) {
+        let f = f.boxed();
+
+        let (work, cached) = {
+            let mut cache = self.cache.lock(logger);
+
+            match cache.entry(hash) {
+                Entry::Occupied(entry) => {
+                    // This is already being worked on.
+                    let entry = entry.get().cheap_clone();
+                    (entry, true)
+                }
+                Entry::Vacant(entry) => {
+                    // New work, put it in the in-flight list.
+                    let uncached = f.shared();
+                    entry.insert(uncached.clone());
+                    (uncached, false)
+                }
+            }
+        };
+
+        let _remove_guard = if !cached {
+            // Make sure to remove this from the in-flight list, even if `poll` panics.
+            Some(defer::defer(|| {
+                self.cache.lock(logger).remove(&hash);
+            }))
+        } else {
+            None
+        };
+
+        (work.await, cached)
+    }
+}
+
+#[derive(Debug)]
+struct CacheByBlock {
+    block: BlockPtr,
+    max_weight: usize,
+    weight: usize,
+
+    // The value is `(result, n_hits)`.
+    cache: HashMap<QueryHash, (Arc<QueryResult>, AtomicU64)>,
+    total_insert_time: Duration,
+}
+
+impl CacheByBlock {
+    fn new(block: BlockPtr, max_weight: usize) -> Self {
+        CacheByBlock {
+            block,
+            max_weight,
+            weight: 0,
+            cache: HashMap::new(),
+            total_insert_time: Duration::default(),
+        }
+    }
+
+    fn get(&self, key: &QueryHash) -> Option<&Arc<QueryResult>> {
+        let (value, hit_count) = self.cache.get(key)?;
+        hit_count.fetch_add(1, Ordering::SeqCst);
+        Some(value)
+    }
+
+    /// Returns `true` if the insert was successful or `false` if the cache was full.
+    fn insert(&mut self, key: QueryHash, value: Arc<QueryResult>, weight: usize) -> bool {
+        // We never try to insert errors into this cache, and always resolve some value.
+        assert!(!value.has_errors());
+        let fits_in_cache = self.weight + weight <= self.max_weight;
+        if fits_in_cache {
+            let start = Instant::now();
+            self.weight += weight;
+            self.cache.insert(key, (value, AtomicU64::new(0)));
+            self.total_insert_time += start.elapsed();
+        }
+        fits_in_cache
+    }
+}
+
+/// Organize block caches by network names. Since different networks
+/// will be at different block heights, we need to keep their `CacheByBlock`
+/// separate
+pub struct QueryBlockCache {
+    shard: u8,
+    cache_by_network: Vec<(String, VecDeque<CacheByBlock>)>,
+    max_weight: usize,
+    max_blocks: usize,
+}
+
+impl QueryBlockCache {
+    pub fn new(max_blocks: usize, shard: u8, max_weight: usize) -> Self {
+        QueryBlockCache {
+            shard,
+            cache_by_network: Vec::new(),
+            max_weight,
+            max_blocks,
+        }
+    }
+
+    pub fn insert(
+        &mut self,
+        network: &str,
+        block_ptr: BlockPtr,
+        key: QueryHash,
+        result: Arc<QueryResult>,
+        weight: usize,
+        logger: Logger,
+    ) -> bool {
+        // Check if the cache is disabled
+        if self.max_blocks == 0 {
+            return false;
+        }
+
+        // Get or insert the cache for this network.
+        let cache = match self
+            .cache_by_network
+            .iter_mut()
+            .find(|(n, _)| n == network)
+            .map(|(_, c)| c)
+        {
+            Some(c) => c,
+            None => {
+                self.cache_by_network
+                    .push((network.to_owned(), VecDeque::new()));
+                &mut self.cache_by_network.last_mut().unwrap().1
+            }
+        };
+
+        // If there is already a cache by the block of this query, just add it there.
+        if let Some(cache_by_block) = cache.iter_mut().find(|c| c.block == block_ptr) {
+            return cache_by_block.insert(key, result.cheap_clone(), weight);
+        }
+
+        // We're creating a new `CacheByBlock` if:
+        // - There are none yet, this is the first query being cached, or
+        // - `block_ptr` is of higher or equal number than the most recent block in the cache.
+        // Otherwise this is a historical query that does not belong in the block cache.
+        if let Some(highest) = cache.iter().next() {
+            if highest.block.number > block_ptr.number {
+                return false;
+            }
+        };
+
+        if cache.len() == self.max_blocks {
+            // At capacity, so pop the oldest block.
+            // Stats are reported in a task since we don't need the lock for it.
+            let block = cache.pop_back().unwrap();
+            let shard = self.shard;
+            let network = network.to_string();
+
+            graph::spawn(async move {
+                let insert_time_ms = block.total_insert_time.as_millis();
+                let mut dead_inserts = 0;
+                let mut total_hits = 0;
+                for (_, hits) in block.cache.values() {
+                    let hits = hits.load(Ordering::SeqCst);
+                    total_hits += hits;
+                    if hits == 0 {
+                        dead_inserts += 1;
+                    }
+                }
+                let n_entries = block.cache.len();
+                debug!(logger, "Rotating query cache, stats for last block";
+                    "shard" => shard,
+                    "network" => network,
+                    "entries" => n_entries,
+                    "avg_hits" => format!("{0:.2}", (total_hits as f64) / (n_entries as f64)),
+                    "dead_inserts" => dead_inserts,
+                    "fill_ratio" => format!("{0:.2}", (block.weight as f64) / (block.max_weight as f64)),
+                    "avg_insert_time_ms" => format!("{0:.2}", insert_time_ms as f64 / (n_entries as f64)),
+                )
+            });
+        }
+
+        // Create a new cache by block, insert this entry, and add it to the QUERY_CACHE.
+        let mut cache_by_block = CacheByBlock::new(block_ptr, self.max_weight);
+        let cache_insert = cache_by_block.insert(key, result, weight);
+        cache.push_front(cache_by_block);
+        cache_insert
+    }
+
+    pub fn get(
+        &self,
+        network: &str,
+        block_ptr: &BlockPtr,
+        key: &QueryHash,
+    ) -> Option<Arc<QueryResult>> {
+        if let Some(cache) = self
+            .cache_by_network
+            .iter()
+            .find(|(n, _)| n == network)
+            .map(|(_, c)| c)
+        {
+            // Iterate from the most recent block looking for a block that matches.
+            if let Some(cache_by_block) = cache.iter().find(|c| &c.block == block_ptr) {
+                if let Some(response) = cache_by_block.get(key) {
+                    return Some(response.cheap_clone());
+                }
+            }
+        }
+        None
+    }
+}
diff --git a/graphql/src/execution/execution.rs b/graphql/src/execution/execution.rs
new file mode 100644
index 0000000..88e993a
--- /dev/null
+++ b/graphql/src/execution/execution.rs
@@ -0,0 +1,890 @@
+use super::cache::{QueryBlockCache, QueryCache};
+use async_recursion::async_recursion;
+use crossbeam::atomic::AtomicCell;
+use graph::{
+    data::{query::Trace, schema::META_FIELD_NAME, value::Object},
+    prelude::{s, CheapClone},
+    util::{lfu_cache::EvictStats, timed_rw_lock::TimedMutex},
+};
+use lazy_static::lazy_static;
+use parking_lot::MutexGuard;
+use std::time::Instant;
+use std::{borrow::ToOwned, collections::HashSet};
+
+use graph::data::graphql::*;
+use graph::data::query::CacheStatus;
+use graph::env::CachedSubgraphIds;
+use graph::prelude::*;
+use graph::util::{lfu_cache::LfuCache, stable_hash_glue::impl_stable_hash};
+
+use super::QueryHash;
+use crate::execution::ast as a;
+use crate::introspection::{is_introspection_field, INTROSPECTION_QUERY_TYPE};
+use crate::prelude::*;
+use crate::schema::ast as sast;
+
+lazy_static! {
+    // Sharded query results cache for recent blocks by network.
+    // The `VecDeque` works as a ring buffer with a capacity of `QUERY_CACHE_BLOCKS`.
+    static ref QUERY_BLOCK_CACHE: Vec<TimedMutex<QueryBlockCache>> = {
+            let shards = ENV_VARS.graphql.query_block_cache_shards;
+            let blocks = ENV_VARS.graphql.query_cache_blocks;
+
+            // The memory budget is evenly divided among blocks and their shards.
+            let max_weight = ENV_VARS.graphql.query_cache_max_mem / (blocks * shards as usize);
+            let mut caches = Vec::new();
+            for i in 0..shards {
+                let id = format!("query_block_cache_{}", i);
+                caches.push(TimedMutex::new(QueryBlockCache::new(blocks, i, max_weight), id))
+            }
+            caches
+    };
+    static ref QUERY_HERD_CACHE: QueryCache<Arc<QueryResult>> = QueryCache::new("query_herd_cache");
+}
+
+struct WeightedResult {
+    result: Arc<QueryResult>,
+    weight: usize,
+}
+
+impl CacheWeight for WeightedResult {
+    fn indirect_weight(&self) -> usize {
+        self.weight
+    }
+}
+
+impl Default for WeightedResult {
+    fn default() -> Self {
+        WeightedResult {
+            result: Arc::new(QueryResult::new(Object::default())),
+            weight: 0,
+        }
+    }
+}
+
+struct HashableQuery<'a> {
+    query_schema_id: &'a DeploymentHash,
+    selection_set: &'a a::SelectionSet,
+    block_ptr: &'a BlockPtr,
+}
+
+// Note that the use of StableHash here is a little bit loose. In particular,
+// we are converting items to a string inside here as a quick-and-dirty
+// implementation. This precludes the ability to add new fields (unlikely
+// anyway). So, this hash isn't really Stable in the way that the StableHash
+// crate defines it. Since hashes are only persisted for this process, we don't
+// need that property. The reason we are using StableHash is to get collision
+// resistance and use it's foolproof API to prevent easy mistakes instead.
+//
+// This is also only as collision resistant insofar as the to_string impls are
+// collision resistant. It is highly likely that this is ok, since these come
+// from an ast.
+//
+// It is possible that multiple asts that are effectively the same query with
+// different representations. This is considered not an issue. The worst
+// possible outcome is that the same query will have multiple cache entries.
+// But, the wrong result should not be served.
+impl_stable_hash!(HashableQuery<'_> {
+    query_schema_id,
+    // Not stable! Uses to_string
+    // TODO: Performance: Save a cryptographic hash (Blake3) of the original query
+    // and pass it through, rather than formatting the selection set.
+    selection_set: format_selection_set,
+    block_ptr
+});
+
+fn format_selection_set(s: &a::SelectionSet) -> String {
+    format!("{:?}", s)
+}
+
+// The key is: subgraph id + selection set + variables + fragment definitions
+fn cache_key(
+    ctx: &ExecutionContext<impl Resolver>,
+    selection_set: &a::SelectionSet,
+    block_ptr: &BlockPtr,
+) -> QueryHash {
+    // It is very important that all data used for the query is included.
+    // Otherwise, incorrect results may be returned.
+    let query = HashableQuery {
+        query_schema_id: ctx.query.schema.id(),
+        selection_set,
+        block_ptr,
+    };
+    // Security:
+    // This uses the crypo stable hash because a collision would
+    // cause us to fetch the incorrect query response and possibly
+    // attest to it. A collision should be impossibly rare with the
+    // non-crypto version, but a determined attacker should be able
+    // to find one and cause disputes which we must avoid.
+    stable_hash::crypto_stable_hash(&query)
+}
+
+fn lfu_cache(
+    logger: &Logger,
+    cache_key: &[u8; 32],
+) -> Option<MutexGuard<'static, LfuCache<[u8; 32], WeightedResult>>> {
+    lazy_static! {
+        static ref QUERY_LFU_CACHE: Vec<TimedMutex<LfuCache<QueryHash, WeightedResult>>> = {
+            std::iter::repeat_with(|| TimedMutex::new(LfuCache::new(), "query_lfu_cache"))
+                .take(ENV_VARS.graphql.query_lfu_cache_shards as usize)
+                .collect()
+        };
+    }
+
+    match QUERY_LFU_CACHE.len() {
+        0 => None,
+        n => {
+            let shard = (cache_key[0] as usize) % n;
+            Some(QUERY_LFU_CACHE[shard].lock(logger))
+        }
+    }
+}
+
+fn log_lfu_evict_stats(
+    logger: &Logger,
+    network: &str,
+    cache_key: &[u8; 32],
+    evict_stats: Option<EvictStats>,
+) {
+    let total_shards = ENV_VARS.graphql.query_lfu_cache_shards as usize;
+
+    if total_shards > 0 {
+        if let Some(EvictStats {
+            new_weight,
+            evicted_weight,
+            new_count,
+            evicted_count,
+            stale_update,
+            evict_time,
+        }) = evict_stats
+        {
+            {
+                let shard = (cache_key[0] as usize) % total_shards;
+                let network = network.to_string();
+                let logger = logger.clone();
+
+                graph::spawn(async move {
+                    debug!(logger, "Evicted LFU cache";
+                        "shard" => shard,
+                        "network" => network,
+                        "entries" => new_count,
+                        "entries_evicted" => evicted_count,
+                        "weight" => new_weight,
+                        "weight_evicted" => evicted_weight,
+                        "stale_update" => stale_update,
+                        "evict_time_ms" => evict_time.as_millis()
+                    )
+                });
+            }
+        }
+    }
+}
+/// Contextual information passed around during query execution.
+pub struct ExecutionContext<R>
+where
+    R: Resolver,
+{
+    /// The logger to use.
+    pub logger: Logger,
+
+    /// The query to execute.
+    pub query: Arc<crate::execution::Query>,
+
+    /// The resolver to use.
+    pub resolver: R,
+
+    /// Time at which the query times out.
+    pub deadline: Option<Instant>,
+
+    /// Max value for `first`.
+    pub max_first: u32,
+
+    /// Max value for `skip`
+    pub max_skip: u32,
+
+    /// Records whether this was a cache hit, used for logging.
+    pub(crate) cache_status: AtomicCell<CacheStatus>,
+}
+
+pub(crate) fn get_field<'a>(
+    object_type: impl Into<ObjectOrInterface<'a>>,
+    name: &str,
+) -> Option<s::Field> {
+    if name == "__schema" || name == "__type" {
+        let object_type = &*INTROSPECTION_QUERY_TYPE;
+        sast::get_field(object_type, name).cloned()
+    } else {
+        sast::get_field(object_type, name).cloned()
+    }
+}
+
+impl<R> ExecutionContext<R>
+where
+    R: Resolver,
+{
+    pub fn as_introspection_context(&self) -> ExecutionContext<IntrospectionResolver> {
+        let introspection_resolver =
+            IntrospectionResolver::new(&self.logger, self.query.schema.schema());
+
+        ExecutionContext {
+            logger: self.logger.cheap_clone(),
+            resolver: introspection_resolver,
+            query: self.query.cheap_clone(),
+            deadline: self.deadline,
+            max_first: std::u32::MAX,
+            max_skip: std::u32::MAX,
+
+            // `cache_status` is a dead value for the introspection context.
+            cache_status: AtomicCell::new(CacheStatus::Miss),
+        }
+    }
+}
+
+pub(crate) async fn execute_root_selection_set_uncached(
+    ctx: &ExecutionContext<impl Resolver>,
+    selection_set: &a::SelectionSet,
+    root_type: &sast::ObjectType,
+) -> Result<(Object, Trace), Vec<QueryExecutionError>> {
+    // Split the top-level fields into introspection fields and
+    // regular data fields
+    let mut data_set = a::SelectionSet::empty_from(selection_set);
+    let mut intro_set = a::SelectionSet::empty_from(selection_set);
+    let mut meta_items = Vec::new();
+
+    for field in selection_set.fields_for(root_type)? {
+        // See if this is an introspection or data field. We don't worry about
+        // non-existent fields; those will cause an error later when we execute
+        // the data_set SelectionSet
+        if is_introspection_field(&field.name) {
+            intro_set.push(field)?
+        } else if field.name == META_FIELD_NAME || field.name == "__typename" {
+            meta_items.push(field)
+        } else {
+            data_set.push(field)?
+        }
+    }
+
+    // If we are getting regular data, prefetch it from the database
+    let (mut values, trace) = if data_set.is_empty() && meta_items.is_empty() {
+        (Object::default(), Trace::None)
+    } else {
+        let (initial_data, trace) = ctx.resolver.prefetch(ctx, &data_set)?;
+        data_set.push_fields(meta_items)?;
+        (
+            execute_selection_set_to_map(ctx, &data_set, root_type, initial_data).await?,
+            trace,
+        )
+    };
+
+    // Resolve introspection fields, if there are any
+    if !intro_set.is_empty() {
+        let ictx = ctx.as_introspection_context();
+
+        values.extend(
+            execute_selection_set_to_map(
+                &ictx,
+                ctx.query.selection_set.as_ref(),
+                &*INTROSPECTION_QUERY_TYPE,
+                None,
+            )
+            .await?,
+        );
+    }
+
+    Ok((values, trace))
+}
+
+/// Executes the root selection set of a query.
+pub(crate) async fn execute_root_selection_set<R: Resolver>(
+    ctx: Arc<ExecutionContext<R>>,
+    selection_set: Arc<a::SelectionSet>,
+    root_type: sast::ObjectType,
+    block_ptr: Option<BlockPtr>,
+) -> Arc<QueryResult> {
+    // Cache the cache key to not have to calculate it twice - once for lookup
+    // and once for insert.
+    let mut key: Option<QueryHash> = None;
+
+    let should_check_cache = R::CACHEABLE
+        && match ENV_VARS.graphql.cached_subgraph_ids {
+            CachedSubgraphIds::All => true,
+            CachedSubgraphIds::Only(ref subgraph_ids) => {
+                subgraph_ids.contains(ctx.query.schema.id())
+            }
+        };
+
+    if should_check_cache {
+        if let (Some(block_ptr), Some(network)) = (block_ptr.as_ref(), &ctx.query.network) {
+            // JSONB and metadata queries use `BLOCK_NUMBER_MAX`. Ignore this case for two reasons:
+            // - Metadata queries are not cacheable.
+            // - Caching `BLOCK_NUMBER_MAX` would make this cache think all other blocks are old.
+            if block_ptr.number != BLOCK_NUMBER_MAX {
+                // Calculate the hash outside of the lock
+                let cache_key = cache_key(&ctx, &selection_set, block_ptr);
+                let shard = (cache_key[0] as usize) % QUERY_BLOCK_CACHE.len();
+
+                // Check if the response is cached, first in the recent blocks cache,
+                // and then in the LfuCache for historical queries
+                // The blocks are used to delimit how long locks need to be held
+                {
+                    let cache = QUERY_BLOCK_CACHE[shard].lock(&ctx.logger);
+                    if let Some(result) = cache.get(network, block_ptr, &cache_key) {
+                        ctx.cache_status.store(CacheStatus::Hit);
+                        return result;
+                    }
+                }
+                if let Some(mut cache) = lfu_cache(&ctx.logger, &cache_key) {
+                    if let Some(weighted) = cache.get(&cache_key) {
+                        ctx.cache_status.store(CacheStatus::Hit);
+                        return weighted.result.cheap_clone();
+                    }
+                }
+                key = Some(cache_key);
+            }
+        }
+    }
+
+    let execute_ctx = ctx.cheap_clone();
+    let execute_selection_set = selection_set.cheap_clone();
+    let execute_root_type = root_type.cheap_clone();
+    let run_query = async move {
+        let _permit = execute_ctx.resolver.query_permit().await;
+
+        let logger = execute_ctx.logger.clone();
+        let query_text = execute_ctx.query.query_text.cheap_clone();
+        let variables_text = execute_ctx.query.variables_text.cheap_clone();
+        match graph::spawn_blocking_allow_panic(move || {
+            let mut query_res =
+                QueryResult::from(graph::block_on(execute_root_selection_set_uncached(
+                    &execute_ctx,
+                    &execute_selection_set,
+                    &execute_root_type,
+                )));
+
+            // Unwrap: In practice should never fail, but if it does we will catch the panic.
+            execute_ctx.resolver.post_process(&mut query_res).unwrap();
+            query_res.deployment = Some(execute_ctx.query.schema.id().clone());
+            Arc::new(query_res)
+        })
+        .await
+        {
+            Ok(result) => result,
+            Err(e) => {
+                let e = e.into_panic();
+                let e = match e
+                    .downcast_ref::<String>()
+                    .map(String::as_str)
+                    .or(e.downcast_ref::<&'static str>().copied())
+                {
+                    Some(e) => e.to_string(),
+                    None => "panic is not a string".to_string(),
+                };
+                error!(
+                    logger,
+                    "panic when processing graphql query";
+                    "panic" => e.to_string(),
+                    "query" => query_text,
+                    "variables" => variables_text,
+                );
+                Arc::new(QueryResult::from(QueryExecutionError::Panic(e)))
+            }
+        }
+    };
+
+    let (result, herd_hit) = if let Some(key) = key {
+        QUERY_HERD_CACHE
+            .cached_query(key, run_query, &ctx.logger)
+            .await
+    } else {
+        (run_query.await, false)
+    };
+    if herd_hit {
+        ctx.cache_status.store(CacheStatus::Shared);
+    }
+
+    // Check if this query should be cached.
+    // Share errors from the herd cache, but don't store them in generational cache.
+    // In particular, there is a problem where asking for a block pointer beyond the chain
+    // head can cause the legitimate cache to be thrown out.
+    // It would be redundant to insert herd cache hits.
+    let no_cache = herd_hit || result.has_errors();
+    if let (false, Some(key), Some(block_ptr), Some(network)) =
+        (no_cache, key, block_ptr, &ctx.query.network)
+    {
+        // Calculate the weight outside the lock.
+        let weight = result.weight();
+        let shard = (key[0] as usize) % QUERY_BLOCK_CACHE.len();
+        let inserted = QUERY_BLOCK_CACHE[shard].lock(&ctx.logger).insert(
+            network,
+            block_ptr,
+            key,
+            result.cheap_clone(),
+            weight,
+            ctx.logger.cheap_clone(),
+        );
+
+        if inserted {
+            ctx.cache_status.store(CacheStatus::Insert);
+        } else if let Some(mut cache) = lfu_cache(&ctx.logger, &key) {
+            // Results that are too old for the QUERY_BLOCK_CACHE go into the QUERY_LFU_CACHE
+            let max_mem = ENV_VARS.graphql.query_cache_max_mem
+                / ENV_VARS.graphql.query_lfu_cache_shards as usize;
+
+            let evict_stats =
+                cache.evict_with_period(max_mem, ENV_VARS.graphql.query_cache_stale_period);
+
+            log_lfu_evict_stats(&ctx.logger, network, &key, evict_stats);
+
+            cache.insert(
+                key,
+                WeightedResult {
+                    result: result.cheap_clone(),
+                    weight,
+                },
+            );
+            ctx.cache_status.store(CacheStatus::Insert);
+        }
+    }
+
+    result
+}
+
+/// Executes a selection set, requiring the result to be of the given object type.
+///
+/// Allows passing in a parent value during recursive processing of objects and their fields.
+async fn execute_selection_set<'a>(
+    ctx: &'a ExecutionContext<impl Resolver>,
+    selection_set: &'a a::SelectionSet,
+    object_type: &sast::ObjectType,
+    prefetched_value: Option<r::Value>,
+) -> Result<r::Value, Vec<QueryExecutionError>> {
+    Ok(r::Value::Object(
+        execute_selection_set_to_map(ctx, selection_set, object_type, prefetched_value).await?,
+    ))
+}
+
+async fn execute_selection_set_to_map<'a>(
+    ctx: &'a ExecutionContext<impl Resolver>,
+    selection_set: &'a a::SelectionSet,
+    object_type: &sast::ObjectType,
+    prefetched_value: Option<r::Value>,
+) -> Result<Object, Vec<QueryExecutionError>> {
+    let mut prefetched_object = match prefetched_value {
+        Some(r::Value::Object(object)) => Some(object),
+        Some(_) => unreachable!(),
+        None => None,
+    };
+    let mut errors: Vec<QueryExecutionError> = Vec::new();
+    let mut results = Vec::new();
+
+    // Gather fields that appear more than once with the same response key.
+    let multiple_response_keys = {
+        let mut multiple_response_keys = HashSet::new();
+        let mut fields = HashSet::new();
+        for field in selection_set.fields_for(object_type)? {
+            if !fields.insert(field.name.as_str()) {
+                multiple_response_keys.insert(field.name.as_str());
+            }
+        }
+        multiple_response_keys
+    };
+
+    // Process all field groups in order
+    for field in selection_set.fields_for(object_type)? {
+        match ctx.deadline {
+            Some(deadline) if deadline < Instant::now() => {
+                errors.push(QueryExecutionError::Timeout);
+                break;
+            }
+            _ => (),
+        }
+
+        let response_key = field.response_key();
+
+        // Unwrap: The query was validated to contain only valid fields.
+        let field_type = sast::get_field(object_type, &field.name).unwrap();
+
+        // Check if we have the value already.
+        let field_value = prefetched_object
+            .as_mut()
+            .map(|o| {
+                // Prefetched objects are associated to `prefetch:response_key`.
+                if let Some(val) = o.remove(&format!("prefetch:{}", response_key)) {
+                    return Some(val);
+                }
+
+                // Scalars and scalar lists are associated to the field name.
+                // If the field has more than one response key, we have to clone.
+                match multiple_response_keys.contains(field.name.as_str()) {
+                    false => o.remove(&field.name),
+                    true => o.get(&field.name).cloned(),
+                }
+            })
+            .flatten();
+
+        if field.name.as_str() == "__typename" && field_value.is_none() {
+            results.push((response_key, r::Value::String(object_type.name.clone())));
+        } else {
+            match execute_field(ctx, object_type, field_value, field, field_type).await {
+                Ok(v) => {
+                    results.push((response_key, v));
+                }
+                Err(mut e) => {
+                    errors.append(&mut e);
+                }
+            }
+        }
+    }
+
+    if errors.is_empty() {
+        let obj = Object::from_iter(results.into_iter().map(|(k, v)| (k.to_owned(), v)));
+        Ok(obj)
+    } else {
+        Err(errors)
+    }
+}
+
+/// Executes a field.
+async fn execute_field(
+    ctx: &ExecutionContext<impl Resolver>,
+    object_type: &s::ObjectType,
+    field_value: Option<r::Value>,
+    field: &a::Field,
+    field_definition: &s::Field,
+) -> Result<r::Value, Vec<QueryExecutionError>> {
+    resolve_field_value(
+        ctx,
+        object_type,
+        field_value,
+        field,
+        field_definition,
+        &field_definition.field_type,
+    )
+    .and_then(|value| complete_value(ctx, field, &field_definition.field_type, value))
+    .await
+}
+
+/// Resolves the value of a field.
+#[async_recursion]
+async fn resolve_field_value(
+    ctx: &ExecutionContext<impl Resolver>,
+    object_type: &s::ObjectType,
+    field_value: Option<r::Value>,
+    field: &a::Field,
+    field_definition: &s::Field,
+    field_type: &s::Type,
+) -> Result<r::Value, Vec<QueryExecutionError>> {
+    match field_type {
+        s::Type::NonNullType(inner_type) => {
+            resolve_field_value(
+                ctx,
+                object_type,
+                field_value,
+                field,
+                field_definition,
+                inner_type.as_ref(),
+            )
+            .await
+        }
+
+        s::Type::NamedType(ref name) => {
+            resolve_field_value_for_named_type(
+                ctx,
+                object_type,
+                field_value,
+                field,
+                field_definition,
+                name,
+            )
+            .await
+        }
+
+        s::Type::ListType(inner_type) => {
+            resolve_field_value_for_list_type(
+                ctx,
+                object_type,
+                field_value,
+                field,
+                field_definition,
+                inner_type.as_ref(),
+            )
+            .await
+        }
+    }
+}
+
+/// Resolves the value of a field that corresponds to a named type.
+async fn resolve_field_value_for_named_type(
+    ctx: &ExecutionContext<impl Resolver>,
+    object_type: &s::ObjectType,
+    field_value: Option<r::Value>,
+    field: &a::Field,
+    field_definition: &s::Field,
+    type_name: &str,
+) -> Result<r::Value, Vec<QueryExecutionError>> {
+    // Try to resolve the type name into the actual type
+    let named_type = ctx
+        .query
+        .schema
+        .get_named_type(type_name)
+        .ok_or_else(|| QueryExecutionError::NamedTypeError(type_name.to_string()))?;
+    match named_type {
+        // Let the resolver decide how the field (with the given object type) is resolved
+        s::TypeDefinition::Object(t) => {
+            ctx.resolver
+                .resolve_object(field_value, field, field_definition, t.into())
+                .await
+        }
+
+        // Let the resolver decide how values in the resolved object value
+        // map to values of GraphQL enums
+        s::TypeDefinition::Enum(t) => ctx.resolver.resolve_enum_value(field, t, field_value),
+
+        // Let the resolver decide how values in the resolved object value
+        // map to values of GraphQL scalars
+        s::TypeDefinition::Scalar(t) => {
+            ctx.resolver
+                .resolve_scalar_value(object_type, field, t, field_value)
+                .await
+        }
+
+        s::TypeDefinition::Interface(i) => {
+            ctx.resolver
+                .resolve_object(field_value, field, field_definition, i.into())
+                .await
+        }
+
+        s::TypeDefinition::Union(_) => Err(QueryExecutionError::Unimplemented("unions".to_owned())),
+
+        s::TypeDefinition::InputObject(_) => unreachable!("input objects are never resolved"),
+    }
+    .map_err(|e| vec![e])
+}
+
+/// Resolves the value of a field that corresponds to a list type.
+#[async_recursion]
+async fn resolve_field_value_for_list_type(
+    ctx: &ExecutionContext<impl Resolver>,
+    object_type: &s::ObjectType,
+    field_value: Option<r::Value>,
+    field: &a::Field,
+    field_definition: &s::Field,
+    inner_type: &s::Type,
+) -> Result<r::Value, Vec<QueryExecutionError>> {
+    match inner_type {
+        s::Type::NonNullType(inner_type) => {
+            resolve_field_value_for_list_type(
+                ctx,
+                object_type,
+                field_value,
+                field,
+                field_definition,
+                inner_type,
+            )
+            .await
+        }
+
+        s::Type::NamedType(ref type_name) => {
+            let named_type = ctx
+                .query
+                .schema
+                .get_named_type(type_name)
+                .ok_or_else(|| QueryExecutionError::NamedTypeError(type_name.to_string()))?;
+
+            match named_type {
+                // Let the resolver decide how the list field (with the given item object type)
+                // is resolved into a entities based on the (potential) parent object
+                s::TypeDefinition::Object(t) => ctx
+                    .resolver
+                    .resolve_objects(field_value, field, field_definition, t.into())
+                    .await
+                    .map_err(|e| vec![e]),
+
+                // Let the resolver decide how values in the resolved object value
+                // map to values of GraphQL enums
+                s::TypeDefinition::Enum(t) => {
+                    ctx.resolver.resolve_enum_values(field, t, field_value)
+                }
+
+                // Let the resolver decide how values in the resolved object value
+                // map to values of GraphQL scalars
+                s::TypeDefinition::Scalar(t) => {
+                    ctx.resolver.resolve_scalar_values(field, t, field_value)
+                }
+
+                s::TypeDefinition::Interface(t) => ctx
+                    .resolver
+                    .resolve_objects(field_value, field, field_definition, t.into())
+                    .await
+                    .map_err(|e| vec![e]),
+
+                s::TypeDefinition::Union(_) => Err(vec![QueryExecutionError::Unimplemented(
+                    "unions".to_owned(),
+                )]),
+
+                s::TypeDefinition::InputObject(_) => {
+                    unreachable!("input objects are never resolved")
+                }
+            }
+        }
+
+        // We don't support nested lists yet
+        s::Type::ListType(_) => Err(vec![QueryExecutionError::Unimplemented(
+            "nested list types".to_owned(),
+        )]),
+    }
+}
+
+/// Ensures that a value matches the expected return type.
+#[async_recursion]
+async fn complete_value(
+    ctx: &ExecutionContext<impl Resolver>,
+    field: &a::Field,
+    field_type: &s::Type,
+    resolved_value: r::Value,
+) -> Result<r::Value, Vec<QueryExecutionError>> {
+    match field_type {
+        // Fail if the field type is non-null but the value is null
+        s::Type::NonNullType(inner_type) => {
+            match complete_value(ctx, field, inner_type, resolved_value).await? {
+                r::Value::Null => Err(vec![QueryExecutionError::NonNullError(
+                    field.position,
+                    field.name.to_string(),
+                )]),
+
+                v => Ok(v),
+            }
+        }
+
+        // If the resolved value is null, return null
+        _ if resolved_value.is_null() => Ok(resolved_value),
+
+        // Complete list values
+        s::Type::ListType(inner_type) => {
+            match resolved_value {
+                // Complete list values individually
+                r::Value::List(mut values) => {
+                    let mut errors = Vec::new();
+
+                    // To avoid allocating a new vector this completes the values in place.
+                    for value_place in &mut values {
+                        // Put in a placeholder, complete the value, put the completed value back.
+                        let value = std::mem::replace(value_place, r::Value::Null);
+                        match complete_value(ctx, field, inner_type, value).await {
+                            Ok(value) => {
+                                *value_place = value;
+                            }
+                            Err(errs) => errors.extend(errs),
+                        }
+                    }
+                    match errors.is_empty() {
+                        true => Ok(r::Value::List(values)),
+                        false => Err(errors),
+                    }
+                }
+
+                // Return field error if the resolved value for the list is not a list
+                _ => Err(vec![QueryExecutionError::ListValueError(
+                    field.position,
+                    field.name.to_string(),
+                )]),
+            }
+        }
+
+        s::Type::NamedType(name) => {
+            let named_type = ctx.query.schema.get_named_type(name).unwrap();
+
+            match named_type {
+                // Complete scalar values
+                s::TypeDefinition::Scalar(scalar_type) => {
+                    resolved_value.coerce_scalar(scalar_type).map_err(|value| {
+                        vec![QueryExecutionError::ScalarCoercionError(
+                            field.position,
+                            field.name.to_owned(),
+                            value.into(),
+                            scalar_type.name.to_owned(),
+                        )]
+                    })
+                }
+
+                // Complete enum values
+                s::TypeDefinition::Enum(enum_type) => {
+                    resolved_value.coerce_enum(enum_type).map_err(|value| {
+                        vec![QueryExecutionError::EnumCoercionError(
+                            field.position,
+                            field.name.to_owned(),
+                            value.into(),
+                            enum_type.name.to_owned(),
+                            enum_type
+                                .values
+                                .iter()
+                                .map(|value| value.name.to_owned())
+                                .collect(),
+                        )]
+                    })
+                }
+
+                // Complete object types recursively
+                s::TypeDefinition::Object(object_type) => {
+                    let object_type = ctx.query.schema.object_type(object_type).into();
+                    execute_selection_set(
+                        ctx,
+                        &field.selection_set,
+                        &object_type,
+                        Some(resolved_value),
+                    )
+                    .await
+                }
+
+                // Resolve interface types using the resolved value and complete the value recursively
+                s::TypeDefinition::Interface(_) => {
+                    let object_type = resolve_abstract_type(ctx, named_type, &resolved_value)?;
+
+                    execute_selection_set(
+                        ctx,
+                        &field.selection_set,
+                        &object_type,
+                        Some(resolved_value),
+                    )
+                    .await
+                }
+
+                // Resolve union types using the resolved value and complete the value recursively
+                s::TypeDefinition::Union(_) => {
+                    let object_type = resolve_abstract_type(ctx, named_type, &resolved_value)?;
+
+                    execute_selection_set(
+                        ctx,
+                        &field.selection_set,
+                        &object_type,
+                        Some(resolved_value),
+                    )
+                    .await
+                }
+
+                s::TypeDefinition::InputObject(_) => {
+                    unreachable!("input objects are never resolved")
+                }
+            }
+        }
+    }
+}
+
+/// Resolves an abstract type (interface, union) into an object type based on the given value.
+fn resolve_abstract_type<'a>(
+    ctx: &'a ExecutionContext<impl Resolver>,
+    abstract_type: &s::TypeDefinition,
+    object_value: &r::Value,
+) -> Result<sast::ObjectType, Vec<QueryExecutionError>> {
+    // Let the resolver handle the type resolution, return an error if the resolution
+    // yields nothing
+    let obj_type = ctx
+        .resolver
+        .resolve_abstract_type(&ctx.query.schema, abstract_type, object_value)
+        .ok_or_else(|| {
+            vec![QueryExecutionError::AbstractTypeError(
+                sast::get_type_name(abstract_type).to_string(),
+            )]
+        })?;
+    Ok(ctx.query.schema.object_type(obj_type).into())
+}
diff --git a/graphql/src/execution/mod.rs b/graphql/src/execution/mod.rs
new file mode 100644
index 0000000..8e409d6
--- /dev/null
+++ b/graphql/src/execution/mod.rs
@@ -0,0 +1,17 @@
+mod cache;
+/// Implementation of the GraphQL execution algorithm.
+mod execution;
+mod query;
+/// Common trait for field resolvers used in the execution.
+mod resolver;
+
+/// Our representation of a query AST
+pub mod ast;
+
+use stable_hash_legacy::{crypto::SetHasher, StableHasher};
+
+pub use self::execution::*;
+pub use self::query::Query;
+pub use self::resolver::Resolver;
+
+type QueryHash = <SetHasher as StableHasher>::Out;
diff --git a/graphql/src/execution/query.rs b/graphql/src/execution/query.rs
new file mode 100644
index 0000000..ddc0959
--- /dev/null
+++ b/graphql/src/execution/query.rs
@@ -0,0 +1,1050 @@
+use graph::data::graphql::DocumentExt as _;
+use graph::data::value::Object;
+use graphql_parser::Pos;
+use graphql_tools::validation::rules::*;
+use graphql_tools::validation::validate::{validate, ValidationPlan};
+use lazy_static::lazy_static;
+use std::collections::{BTreeMap, HashMap, HashSet};
+use std::hash::{Hash, Hasher};
+use std::iter::FromIterator;
+use std::sync::Arc;
+use std::time::Instant;
+use std::{collections::hash_map::DefaultHasher, convert::TryFrom};
+
+use graph::data::graphql::{ext::TypeExt, ObjectOrInterface};
+use graph::data::query::QueryExecutionError;
+use graph::data::query::{Query as GraphDataQuery, QueryVariables};
+use graph::data::schema::ApiSchema;
+use graph::prelude::{
+    info, o, q, r, s, warn, BlockNumber, CheapClone, GraphQLMetrics, Logger, TryFromValue, ENV_VARS,
+};
+
+use crate::execution::ast as a;
+use crate::query::{ast as qast, ext::BlockConstraint};
+use crate::schema::ast::{self as sast};
+use crate::values::coercion;
+use crate::{execution::get_field, schema::api::ErrorPolicy};
+
+lazy_static! {
+    static ref GRAPHQL_VALIDATION_PLAN: ValidationPlan =
+        ValidationPlan::from(if !ENV_VARS.graphql.enable_validations {
+            vec![]
+        } else {
+            vec![
+                Box::new(UniqueOperationNames::new()),
+                Box::new(LoneAnonymousOperation::new()),
+                Box::new(SingleFieldSubscriptions::new()),
+                Box::new(KnownTypeNames::new()),
+                Box::new(FragmentsOnCompositeTypes::new()),
+                Box::new(VariablesAreInputTypes::new()),
+                Box::new(LeafFieldSelections::new()),
+                Box::new(FieldsOnCorrectType::new()),
+                Box::new(UniqueFragmentNames::new()),
+                Box::new(KnownFragmentNames::new()),
+                Box::new(NoUnusedFragments::new()),
+                Box::new(OverlappingFieldsCanBeMerged::new()),
+                Box::new(NoFragmentsCycle::new()),
+                Box::new(PossibleFragmentSpreads::new()),
+                Box::new(NoUnusedVariables::new()),
+                Box::new(NoUndefinedVariables::new()),
+                Box::new(KnownArgumentNames::new()),
+                Box::new(UniqueArgumentNames::new()),
+                Box::new(UniqueVariableNames::new()),
+                Box::new(ProvidedRequiredArguments::new()),
+                Box::new(KnownDirectives::new()),
+                Box::new(VariablesInAllowedPosition::new()),
+                Box::new(ValuesOfCorrectType::new()),
+                Box::new(UniqueDirectivesPerLocation::new()),
+            ]
+        });
+}
+
+#[derive(Clone, Debug)]
+pub enum ComplexityError {
+    TooDeep,
+    Overflow,
+    Invalid,
+    CyclicalFragment(String),
+}
+
+#[derive(Copy, Clone)]
+enum Kind {
+    Query,
+    Subscription,
+}
+
+/// Helper to log the fields in a `SelectionSet` without cloning. Writes
+/// a list of field names from the selection set separated by ';'. Using
+/// ';' as a separator makes parsing the log a little easier since slog
+/// uses ',' to separate key/value pairs.
+/// If `SelectionSet` is `None`, log `*` to indicate that the query was
+/// for the entire selection set of the query
+struct SelectedFields<'a>(&'a a::SelectionSet);
+
+impl<'a> std::fmt::Display for SelectedFields<'a> {
+    fn fmt(&self, fmt: &mut std::fmt::Formatter) -> Result<(), std::fmt::Error> {
+        let mut first = true;
+        for (obj_type, fields) in self.0.fields() {
+            write!(fmt, "{}:", obj_type.name)?;
+            for field in fields {
+                if first {
+                    write!(fmt, "{}", field.response_key())?;
+                } else {
+                    write!(fmt, ";{}", field.response_key())?;
+                }
+                first = false;
+            }
+        }
+        if first {
+            // There wasn't a single `q::Selection::Field` in the set. That
+            // seems impossible, but log '-' to be on the safe side
+            write!(fmt, "-")?;
+        }
+
+        Ok(())
+    }
+}
+
+/// A GraphQL query that has been preprocessed and checked and is ready
+/// for execution. Checking includes validating all query fields and, if
+/// desired, checking the query's complexity
+//
+// The implementation contains various workarounds to make it compatible
+// with the previous implementation when it comes to queries that are not
+// fully spec compliant and should be rejected through rigorous validation
+// against the GraphQL spec. Once we do validate queries, code that is
+// marked with `graphql-bug-compat` can be deleted.
+pub struct Query {
+    /// The schema against which to execute the query
+    pub schema: Arc<ApiSchema>,
+    /// The root selection set of the query. All variable references have already been resolved
+    pub selection_set: Arc<a::SelectionSet>,
+    /// The ShapeHash of the original query
+    pub shape_hash: u64,
+
+    pub network: Option<String>,
+
+    pub logger: Logger,
+
+    start: Instant,
+
+    kind: Kind,
+
+    /// Used only for logging; if logging is configured off, these will
+    /// have dummy values
+    pub query_text: Arc<String>,
+    pub variables_text: Arc<String>,
+    pub query_id: String,
+}
+
+fn validate_query(
+    logger: &Logger,
+    query: &GraphDataQuery,
+    document: &s::Document,
+) -> Result<(), Vec<QueryExecutionError>> {
+    let validation_errors = validate(&document, &query.document, &GRAPHQL_VALIDATION_PLAN);
+
+    if !validation_errors.is_empty() {
+        if !ENV_VARS.graphql.silent_graphql_validations {
+            return Err(validation_errors
+                .into_iter()
+                .map(|e| {
+                    QueryExecutionError::ValidationError(
+                        e.locations.first().cloned(),
+                        e.message.clone(),
+                    )
+                })
+                .collect());
+        } else {
+            warn!(
+              &logger,
+              "GraphQL Validation failure";
+              "query" => &query.query_text,
+              "variables" => &query.variables_text,
+              "errors" => format!("[{:?}]", validation_errors.iter().map(|e| e.message.clone()).collect::<Vec<_>>().join(", "))
+            );
+        }
+    }
+
+    Ok(())
+}
+
+impl Query {
+    /// Process the raw GraphQL query `query` and prepare for executing it.
+    /// The returned `Query` has already been validated and, if `max_complexity`
+    /// is given, also checked whether it is too complex. If validation fails,
+    /// or the query is too complex, errors are returned
+    pub fn new(
+        logger: &Logger,
+        schema: Arc<ApiSchema>,
+        network: Option<String>,
+        query: GraphDataQuery,
+        max_complexity: Option<u64>,
+        max_depth: u8,
+        metrics: Arc<dyn GraphQLMetrics>,
+    ) -> Result<Arc<Self>, Vec<QueryExecutionError>> {
+        let validation_phase_start = Instant::now();
+        validate_query(logger, &query, &schema.document())?;
+        metrics.observe_query_validation(validation_phase_start.elapsed(), schema.id());
+
+        let mut operation = None;
+        let mut fragments = HashMap::new();
+        for defn in query.document.definitions.into_iter() {
+            match defn {
+                q::Definition::Operation(op) => match operation {
+                    None => operation = Some(op),
+                    Some(_) => return Err(vec![QueryExecutionError::OperationNameRequired]),
+                },
+                q::Definition::Fragment(frag) => {
+                    fragments.insert(frag.name.clone(), frag);
+                }
+            }
+        }
+        let operation = operation.ok_or(QueryExecutionError::OperationNameRequired)?;
+
+        let variables = coerce_variables(schema.as_ref(), &operation, query.variables)?;
+        let (kind, selection_set) = match operation {
+            q::OperationDefinition::Query(q::Query { selection_set, .. }) => {
+                (Kind::Query, selection_set)
+            }
+            // Queries can be run by just sending a selection set
+            q::OperationDefinition::SelectionSet(selection_set) => (Kind::Query, selection_set),
+            q::OperationDefinition::Subscription(q::Subscription { selection_set, .. }) => {
+                (Kind::Subscription, selection_set)
+            }
+            q::OperationDefinition::Mutation(_) => {
+                return Err(vec![QueryExecutionError::NotSupported(
+                    "Mutations are not supported".to_owned(),
+                )])
+            }
+        };
+
+        let query_hash = {
+            let mut hasher = DefaultHasher::new();
+            query.query_text.hash(&mut hasher);
+            query.variables_text.hash(&mut hasher);
+            hasher.finish()
+        };
+        let query_id = format!("{:x}-{:x}", query.shape_hash, query_hash);
+        let logger = logger.new(o!(
+            "subgraph_id" => schema.id().clone(),
+            "query_id" => query_id.clone()
+        ));
+
+        let start = Instant::now();
+        let root_type = match kind {
+            Kind::Query => schema.query_type.as_ref(),
+            Kind::Subscription => schema.subscription_type.as_ref().unwrap(),
+        };
+        // Use an intermediate struct so we can modify the query before
+        // enclosing it in an Arc
+        let raw_query = RawQuery {
+            schema: schema.cheap_clone(),
+            variables,
+            selection_set,
+            fragments,
+            root_type,
+        };
+
+        // It's important to check complexity first, so `validate_fields`
+        // doesn't risk a stack overflow from invalid queries. We don't
+        // really care about the resulting complexity, only that all the
+        // checks that `check_complexity` performs pass successfully
+        let _ = raw_query.check_complexity(max_complexity, max_depth)?;
+        raw_query.validate_fields()?;
+        let selection_set = raw_query.convert()?;
+
+        let query = Self {
+            schema,
+            selection_set: Arc::new(selection_set),
+            shape_hash: query.shape_hash,
+            kind,
+            network,
+            logger,
+            start,
+            query_text: query.query_text.cheap_clone(),
+            variables_text: query.variables_text.cheap_clone(),
+            query_id,
+        };
+
+        Ok(Arc::new(query))
+    }
+
+    /// Return the block constraint for the toplevel query field(s), merging
+    /// consecutive fields that have the same block constraint, while making
+    /// sure that the fields appear in the same order as they did in the
+    /// query
+    ///
+    /// Also returns the combined error policy for those fields, which is
+    /// `Deny` if any field is `Deny` and `Allow` otherwise.
+    pub fn block_constraint(
+        &self,
+    ) -> Result<Vec<(BlockConstraint, (a::SelectionSet, ErrorPolicy))>, Vec<QueryExecutionError>>
+    {
+        let mut bcs: Vec<(BlockConstraint, (a::SelectionSet, ErrorPolicy))> = Vec::new();
+
+        let root_type = sast::ObjectType::from(self.schema.query_type.cheap_clone());
+        let mut prev_bc: Option<BlockConstraint> = None;
+        for field in self.selection_set.fields_for(&root_type)? {
+            let bc = match field.argument_value("block") {
+                Some(bc) => BlockConstraint::try_from_value(bc).map_err(|_| {
+                    vec![QueryExecutionError::InvalidArgumentError(
+                        Pos::default(),
+                        "block".to_string(),
+                        bc.clone().into(),
+                    )]
+                })?,
+                None => BlockConstraint::Latest,
+            };
+
+            let field_error_policy = match field.argument_value("subgraphError") {
+                Some(value) => ErrorPolicy::try_from(value).map_err(|_| {
+                    vec![QueryExecutionError::InvalidArgumentError(
+                        Pos::default(),
+                        "subgraphError".to_string(),
+                        value.clone().into(),
+                    )]
+                })?,
+                None => ErrorPolicy::Deny,
+            };
+
+            let next_bc = Some(bc.clone());
+            if prev_bc == next_bc {
+                let (selection_set, error_policy) = &mut bcs.last_mut().unwrap().1;
+                selection_set.push(field)?;
+                if field_error_policy == ErrorPolicy::Deny {
+                    *error_policy = ErrorPolicy::Deny;
+                }
+            } else {
+                let mut selection_set = a::SelectionSet::empty_from(&self.selection_set);
+                selection_set.push(field)?;
+                bcs.push((bc, (selection_set, field_error_policy)))
+            }
+            prev_bc = next_bc;
+        }
+        Ok(bcs)
+    }
+
+    /// Return `true` if this is a query, and not a subscription or
+    /// mutation
+    pub fn is_query(&self) -> bool {
+        match self.kind {
+            Kind::Query => true,
+            Kind::Subscription => false,
+        }
+    }
+
+    /// Return `true` if this is a subscription, not a query or a mutation
+    pub fn is_subscription(&self) -> bool {
+        match self.kind {
+            Kind::Subscription => true,
+            Kind::Query => false,
+        }
+    }
+
+    /// Log details about the overall execution of the query
+    pub fn log_execution(&self, block: BlockNumber) {
+        if ENV_VARS.log_gql_timing() {
+            info!(
+                &self.logger,
+                "Query timing (GraphQL)";
+                "query" => &self.query_text,
+                "variables" => &self.variables_text,
+                "query_time_ms" => self.start.elapsed().as_millis(),
+                "block" => block,
+            );
+        }
+    }
+
+    /// Log details about how the part of the query corresponding to
+    /// `selection_set` was cached
+    pub fn log_cache_status(
+        &self,
+        selection_set: &a::SelectionSet,
+        block: BlockNumber,
+        start: Instant,
+        cache_status: String,
+    ) {
+        if ENV_VARS.log_gql_cache_timing() {
+            info!(
+                &self.logger,
+                "Query caching";
+                "query_time_ms" => start.elapsed().as_millis(),
+                "cached" => cache_status,
+                "selection" => %SelectedFields(selection_set),
+                "block" => block,
+            );
+        }
+    }
+}
+
+/// Coerces variable values for an operation.
+pub fn coerce_variables(
+    schema: &ApiSchema,
+    operation: &q::OperationDefinition,
+    mut variables: Option<QueryVariables>,
+) -> Result<HashMap<String, r::Value>, Vec<QueryExecutionError>> {
+    let mut coerced_values = HashMap::new();
+    let mut errors = vec![];
+
+    for variable_def in qast::get_variable_definitions(operation)
+        .into_iter()
+        .flatten()
+    {
+        // Skip variable if it has an invalid type
+        if !schema.is_input_type(&variable_def.var_type) {
+            errors.push(QueryExecutionError::InvalidVariableTypeError(
+                variable_def.position,
+                variable_def.name.to_owned(),
+            ));
+            continue;
+        }
+
+        let value = variables
+            .as_mut()
+            .and_then(|vars| vars.remove(&variable_def.name));
+
+        let value = match value.or_else(|| {
+            variable_def
+                .default_value
+                .clone()
+                .map(r::Value::try_from)
+                .transpose()
+                .unwrap()
+        }) {
+            // No variable value provided and no default for non-null type, fail
+            None => {
+                if sast::is_non_null_type(&variable_def.var_type) {
+                    errors.push(QueryExecutionError::MissingVariableError(
+                        variable_def.position,
+                        variable_def.name.to_owned(),
+                    ));
+                };
+                continue;
+            }
+            Some(value) => value,
+        };
+
+        // We have a variable value, attempt to coerce it to the value type
+        // of the variable definition
+        coerced_values.insert(
+            variable_def.name.to_owned(),
+            coerce_variable(schema, variable_def, value)?,
+        );
+    }
+
+    if errors.is_empty() {
+        Ok(coerced_values)
+    } else {
+        Err(errors)
+    }
+}
+
+fn coerce_variable(
+    schema: &ApiSchema,
+    variable_def: &q::VariableDefinition,
+    value: r::Value,
+) -> Result<r::Value, Vec<QueryExecutionError>> {
+    use crate::values::coercion::coerce_value;
+
+    let resolver = |name: &str| schema.get_named_type(name);
+
+    coerce_value(value, &variable_def.var_type, &resolver).map_err(|value| {
+        vec![QueryExecutionError::InvalidArgumentError(
+            variable_def.position,
+            variable_def.name.to_owned(),
+            value.into(),
+        )]
+    })
+}
+
+struct RawQuery<'s> {
+    /// The schema against which to execute the query
+    schema: Arc<ApiSchema>,
+    /// The variables for the query, coerced into proper values
+    variables: HashMap<String, r::Value>,
+    /// The root selection set of the query
+    selection_set: q::SelectionSet,
+
+    fragments: HashMap<String, q::FragmentDefinition>,
+    root_type: &'s s::ObjectType,
+}
+
+impl<'s> RawQuery<'s> {
+    fn check_complexity(
+        &self,
+        max_complexity: Option<u64>,
+        max_depth: u8,
+    ) -> Result<u64, Vec<QueryExecutionError>> {
+        let complexity = self.complexity(max_depth).map_err(|e| vec![e])?;
+        if let Some(max_complexity) = max_complexity {
+            if complexity > max_complexity {
+                return Err(vec![QueryExecutionError::TooComplex(
+                    complexity,
+                    max_complexity,
+                )]);
+            }
+        }
+        Ok(complexity)
+    }
+
+    fn complexity_inner<'a>(
+        &'a self,
+        ty: &s::TypeDefinition,
+        selection_set: &'a q::SelectionSet,
+        max_depth: u8,
+        depth: u8,
+        visited_fragments: &'a HashSet<&'a str>,
+    ) -> Result<u64, ComplexityError> {
+        use ComplexityError::*;
+
+        if depth >= max_depth {
+            return Err(TooDeep);
+        }
+
+        selection_set
+            .items
+            .iter()
+            .try_fold(0, |total_complexity, selection| {
+                match selection {
+                    q::Selection::Field(field) => {
+                        // Empty selection sets are the base case.
+                        if field.selection_set.items.is_empty() {
+                            return Ok(total_complexity);
+                        }
+
+                        // Get field type to determine if this is a collection query.
+                        let s_field = match ty {
+                            s::TypeDefinition::Object(t) => get_field(t, &field.name),
+                            s::TypeDefinition::Interface(t) => get_field(t, &field.name),
+
+                            // `Scalar` and `Enum` cannot have selection sets.
+                            // `InputObject` can't appear in a selection.
+                            // `Union` is not yet supported.
+                            s::TypeDefinition::Scalar(_)
+                            | s::TypeDefinition::Enum(_)
+                            | s::TypeDefinition::InputObject(_)
+                            | s::TypeDefinition::Union(_) => None,
+                        }
+                        .ok_or(Invalid)?;
+
+                        let field_complexity = self.complexity_inner(
+                            self.schema
+                                .get_named_type(s_field.field_type.get_base_type())
+                                .ok_or(Invalid)?,
+                            &field.selection_set,
+                            max_depth,
+                            depth + 1,
+                            visited_fragments,
+                        )?;
+
+                        // Non-collection queries pass through.
+                        if !sast::is_list_or_non_null_list_field(&s_field) {
+                            return Ok(total_complexity + field_complexity);
+                        }
+
+                        // For collection queries, check the `first` argument.
+                        let max_entities = qast::get_argument_value(&field.arguments, "first")
+                            .and_then(|arg| match arg {
+                                q::Value::Int(n) => Some(n.as_i64()? as u64),
+                                _ => None,
+                            })
+                            .unwrap_or(100);
+                        max_entities
+                            .checked_add(
+                                max_entities.checked_mul(field_complexity).ok_or(Overflow)?,
+                            )
+                            .ok_or(Overflow)
+                    }
+                    q::Selection::FragmentSpread(fragment) => {
+                        let def = self.fragments.get(&fragment.fragment_name).unwrap();
+                        let q::TypeCondition::On(type_name) = &def.type_condition;
+                        let ty = self.schema.get_named_type(type_name).ok_or(Invalid)?;
+
+                        // Copy `visited_fragments` on write.
+                        let mut visited_fragments = visited_fragments.clone();
+                        if !visited_fragments.insert(&fragment.fragment_name) {
+                            return Err(CyclicalFragment(fragment.fragment_name.clone()));
+                        }
+                        self.complexity_inner(
+                            ty,
+                            &def.selection_set,
+                            max_depth,
+                            depth + 1,
+                            &visited_fragments,
+                        )
+                    }
+                    q::Selection::InlineFragment(fragment) => {
+                        let ty = match &fragment.type_condition {
+                            Some(q::TypeCondition::On(type_name)) => {
+                                self.schema.get_named_type(type_name).ok_or(Invalid)?
+                            }
+                            _ => ty,
+                        };
+                        self.complexity_inner(
+                            ty,
+                            &fragment.selection_set,
+                            max_depth,
+                            depth + 1,
+                            visited_fragments,
+                        )
+                    }
+                }
+                .and_then(|complexity| total_complexity.checked_add(complexity).ok_or(Overflow))
+            })
+    }
+
+    /// See https://developer.github.com/v4/guides/resource-limitations/.
+    ///
+    /// If the query is invalid, returns `Ok(0)` so that execution proceeds and
+    /// gives a proper error.
+    fn complexity(&self, max_depth: u8) -> Result<u64, QueryExecutionError> {
+        let root_type = self.schema.get_root_query_type_def().unwrap();
+
+        match self.complexity_inner(
+            root_type,
+            &self.selection_set,
+            max_depth,
+            0,
+            &HashSet::new(),
+        ) {
+            Ok(complexity) => Ok(complexity),
+            Err(ComplexityError::Invalid) => Ok(0),
+            Err(ComplexityError::TooDeep) => Err(QueryExecutionError::TooDeep(max_depth)),
+            Err(ComplexityError::Overflow) => {
+                Err(QueryExecutionError::TooComplex(u64::max_value(), 0))
+            }
+            Err(ComplexityError::CyclicalFragment(name)) => {
+                Err(QueryExecutionError::CyclicalFragment(name))
+            }
+        }
+    }
+
+    fn validate_fields(&self) -> Result<(), Vec<QueryExecutionError>> {
+        let root_type = self.schema.query_type.as_ref();
+
+        let errors =
+            self.validate_fields_inner(&"Query".to_owned(), root_type.into(), &self.selection_set);
+        if errors.is_empty() {
+            Ok(())
+        } else {
+            Err(errors)
+        }
+    }
+
+    // Checks for invalid selections.
+    fn validate_fields_inner(
+        &self,
+        type_name: &str,
+        ty: ObjectOrInterface<'_>,
+        selection_set: &q::SelectionSet,
+    ) -> Vec<QueryExecutionError> {
+        selection_set
+            .items
+            .iter()
+            .fold(vec![], |mut errors, selection| {
+                match selection {
+                    q::Selection::Field(field) => match get_field(ty, &field.name) {
+                        Some(s_field) => {
+                            let base_type = s_field.field_type.get_base_type();
+                            if self.schema.get_named_type(base_type).is_none() {
+                                errors.push(QueryExecutionError::NamedTypeError(base_type.into()));
+                            } else if let Some(ty) = self.schema.object_or_interface(base_type) {
+                                errors.extend(self.validate_fields_inner(
+                                    base_type,
+                                    ty,
+                                    &field.selection_set,
+                                ))
+                            }
+                        }
+                        None => errors.push(QueryExecutionError::UnknownField(
+                            field.position,
+                            type_name.into(),
+                            field.name.clone(),
+                        )),
+                    },
+                    q::Selection::FragmentSpread(fragment) => {
+                        match self.fragments.get(&fragment.fragment_name) {
+                            Some(frag) => {
+                                let q::TypeCondition::On(type_name) = &frag.type_condition;
+                                match self.schema.object_or_interface(type_name) {
+                                    Some(ty) => errors.extend(self.validate_fields_inner(
+                                        type_name,
+                                        ty,
+                                        &frag.selection_set,
+                                    )),
+                                    None => errors.push(QueryExecutionError::NamedTypeError(
+                                        type_name.clone(),
+                                    )),
+                                }
+                            }
+                            None => errors.push(QueryExecutionError::UndefinedFragment(
+                                fragment.fragment_name.clone(),
+                            )),
+                        }
+                    }
+                    q::Selection::InlineFragment(fragment) => match &fragment.type_condition {
+                        Some(q::TypeCondition::On(type_name)) => {
+                            match self.schema.object_or_interface(type_name) {
+                                Some(ty) => errors.extend(self.validate_fields_inner(
+                                    type_name,
+                                    ty,
+                                    &fragment.selection_set,
+                                )),
+                                None => errors
+                                    .push(QueryExecutionError::NamedTypeError(type_name.clone())),
+                            }
+                        }
+                        _ => errors.extend(self.validate_fields_inner(
+                            type_name,
+                            ty,
+                            &fragment.selection_set,
+                        )),
+                    },
+                }
+                errors
+            })
+    }
+
+    fn convert(self) -> Result<a::SelectionSet, Vec<QueryExecutionError>> {
+        let RawQuery {
+            schema,
+            variables,
+            selection_set,
+            fragments,
+            root_type,
+        } = self;
+
+        let transform = Transform {
+            schema,
+            variables,
+            fragments,
+        };
+        transform.expand_selection_set(selection_set, &a::ObjectTypeSet::Any, root_type.into())
+    }
+}
+
+struct Transform {
+    schema: Arc<ApiSchema>,
+    variables: HashMap<String, r::Value>,
+    fragments: HashMap<String, q::FragmentDefinition>,
+}
+
+impl Transform {
+    /// Look up the value of the variable `name`. If the variable is not
+    /// defined, return `r::Value::Null`
+    // graphql-bug-compat: Once queries are fully validated, all variables
+    // will be defined
+    fn variable(&self, name: &str) -> r::Value {
+        self.variables.get(name).cloned().unwrap_or(r::Value::Null)
+    }
+
+    /// Interpolate variable references in the arguments `args`
+    fn interpolate_arguments(
+        &self,
+        args: Vec<(String, q::Value)>,
+        pos: &Pos,
+    ) -> Vec<(String, r::Value)> {
+        args.into_iter()
+            .map(|(name, val)| {
+                let val = self.interpolate_value(val, pos);
+                (name, val)
+            })
+            .collect()
+    }
+
+    /// Turn `value` into an `r::Value` by resolving variable references
+    fn interpolate_value(&self, value: q::Value, pos: &Pos) -> r::Value {
+        match value {
+            q::Value::Variable(var) => self.variable(&var),
+            q::Value::Int(ref num) => {
+                r::Value::Int(num.as_i64().expect("q::Value::Int contains an i64"))
+            }
+            q::Value::Float(f) => r::Value::Float(f),
+            q::Value::String(s) => r::Value::String(s),
+            q::Value::Boolean(b) => r::Value::Boolean(b),
+            q::Value::Null => r::Value::Null,
+            q::Value::Enum(s) => r::Value::Enum(s),
+            q::Value::List(vals) => {
+                let vals = vals
+                    .into_iter()
+                    .map(|val| self.interpolate_value(val, pos))
+                    .collect();
+                r::Value::List(vals)
+            }
+            q::Value::Object(map) => {
+                let mut rmap = BTreeMap::new();
+                for (key, value) in map.into_iter() {
+                    let value = self.interpolate_value(value, pos);
+                    rmap.insert(key.into(), value);
+                }
+                r::Value::object(rmap)
+            }
+        }
+    }
+
+    /// Interpolate variable references in directives. Return the directives
+    /// and a boolean indicating whether the element these directives are
+    /// attached to should be skipped
+    fn interpolate_directives(
+        &self,
+        dirs: Vec<q::Directive>,
+    ) -> Result<(Vec<a::Directive>, bool), QueryExecutionError> {
+        let dirs: Vec<_> = dirs
+            .into_iter()
+            .map(|dir| {
+                let q::Directive {
+                    name,
+                    position,
+                    arguments,
+                } = dir;
+                let arguments = self.interpolate_arguments(arguments, &position);
+                a::Directive {
+                    name,
+                    position,
+                    arguments,
+                }
+            })
+            .collect();
+        let skip = dirs.iter().any(|dir| dir.skip());
+        Ok((dirs, skip))
+    }
+
+    /// Coerces argument values into GraphQL values.
+    pub fn coerce_argument_values<'a>(
+        &self,
+        arguments: &mut Vec<(String, r::Value)>,
+        ty: ObjectOrInterface<'a>,
+        field_name: &str,
+    ) -> Result<(), Vec<QueryExecutionError>> {
+        let mut errors = vec![];
+
+        let resolver = |name: &str| self.schema.get_named_type(name);
+
+        let mut defined_args: usize = 0;
+        for argument_def in sast::get_argument_definitions(ty, field_name)
+            .into_iter()
+            .flatten()
+        {
+            let arg_value = arguments
+                .iter_mut()
+                .find(|arg| arg.0 == argument_def.name)
+                .map(|arg| &mut arg.1);
+            if arg_value.is_some() {
+                defined_args += 1;
+            }
+            match coercion::coerce_input_value(
+                arg_value.as_deref().cloned(),
+                argument_def,
+                &resolver,
+            ) {
+                Ok(Some(value)) => {
+                    let value = if argument_def.name == *"text" {
+                        r::Value::Object(Object::from_iter(vec![(field_name.to_string(), value)]))
+                    } else {
+                        value
+                    };
+                    match arg_value {
+                        Some(arg_value) => *arg_value = value,
+                        None => arguments.push((argument_def.name.clone(), value)),
+                    }
+                }
+                Ok(None) => {}
+                Err(e) => errors.push(e),
+            }
+        }
+
+        // see: graphql-bug-compat
+        // avoids error 'unknown argument on field'
+        if defined_args < arguments.len() {
+            // `arguments` contains undefined arguments, remove them
+            match sast::get_argument_definitions(ty, field_name) {
+                None => arguments.clear(),
+                Some(arg_defs) => {
+                    arguments.retain(|(name, _)| arg_defs.iter().any(|def| &def.name == name))
+                }
+            }
+        }
+
+        if errors.is_empty() {
+            Ok(())
+        } else {
+            Err(errors)
+        }
+    }
+
+    /// Expand fragments and interpolate variables in a field. Return `None`
+    /// if the field should be skipped
+    fn expand_field(
+        &self,
+        field: q::Field,
+        parent_type: ObjectOrInterface<'_>,
+    ) -> Result<Option<a::Field>, Vec<QueryExecutionError>> {
+        let q::Field {
+            position,
+            alias,
+            name,
+            arguments,
+            directives,
+            selection_set,
+        } = field;
+
+        // Short-circuit '__typename' since it is not a real field
+        if name == "__typename" {
+            return Ok(Some(a::Field {
+                position,
+                alias,
+                name,
+                arguments: vec![],
+                directives: vec![],
+                selection_set: a::SelectionSet::new(vec![]),
+            }));
+        }
+
+        let field_type = parent_type.field(&name).ok_or_else(|| {
+            vec![QueryExecutionError::UnknownField(
+                position,
+                parent_type.name().to_string(),
+                name.clone(),
+            )]
+        })?;
+
+        let (directives, skip) = self.interpolate_directives(directives)?;
+        if skip {
+            return Ok(None);
+        }
+
+        let mut arguments = self.interpolate_arguments(arguments, &position);
+        self.coerce_argument_values(&mut arguments, parent_type, &name)?;
+
+        let is_leaf_type = self.schema.document().is_leaf_type(&field_type.field_type);
+        let selection_set = if selection_set.items.is_empty() {
+            if !is_leaf_type {
+                // see: graphql-bug-compat
+                // Field requires selection, ignore this field
+                return Ok(None);
+            }
+            a::SelectionSet::new(vec![])
+        } else {
+            if is_leaf_type {
+                // see: graphql-bug-compat
+                // Field does not allow selections, ignore selections
+                a::SelectionSet::new(vec![])
+            } else {
+                let ty = field_type.field_type.get_base_type();
+                let type_set = a::ObjectTypeSet::from_name(&self.schema, ty)?;
+                let ty = self.schema.object_or_interface(ty).unwrap();
+                self.expand_selection_set(selection_set, &type_set, ty)?
+            }
+        };
+
+        Ok(Some(a::Field {
+            position,
+            alias,
+            name,
+            arguments,
+            directives,
+            selection_set,
+        }))
+    }
+
+    /// Expand fragments and interpolate variables in a selection set
+    fn expand_selection_set(
+        &self,
+        set: q::SelectionSet,
+        type_set: &a::ObjectTypeSet,
+        ty: ObjectOrInterface<'_>,
+    ) -> Result<a::SelectionSet, Vec<QueryExecutionError>> {
+        let q::SelectionSet { span: _, items } = set;
+        // check_complexity already checked for cycles in fragment
+        // expansion, i.e. situations where a named fragment includes itself
+        // recursively. We still want to guard against spreading the same
+        // fragment twice at the same level in the query
+        let mut visited_fragments = HashSet::new();
+
+        // All the types that could possibly be returned by this selection set
+        let types = type_set.type_names(&self.schema, ty)?;
+        let mut newset = a::SelectionSet::new(types);
+
+        for sel in items {
+            match sel {
+                q::Selection::Field(field) => {
+                    if let Some(field) = self.expand_field(field, ty)? {
+                        newset.push(&field)?;
+                    }
+                }
+                q::Selection::FragmentSpread(spread) => {
+                    // TODO: we ignore the directives here (and so did the
+                    // old implementation), but that seems wrong
+                    let q::FragmentSpread {
+                        position: _,
+                        fragment_name,
+                        directives: _,
+                    } = spread;
+                    let frag = self.fragments.get(&fragment_name).unwrap();
+                    if visited_fragments.insert(fragment_name) {
+                        let q::FragmentDefinition {
+                            position: _,
+                            name: _,
+                            type_condition,
+                            directives,
+                            selection_set,
+                        } = frag;
+                        self.expand_fragment(
+                            directives.clone(),
+                            Some(type_condition),
+                            type_set,
+                            selection_set.clone(),
+                            ty,
+                            &mut newset,
+                        )?;
+                    }
+                }
+                q::Selection::InlineFragment(frag) => {
+                    let q::InlineFragment {
+                        position: _,
+                        type_condition,
+                        directives,
+                        selection_set,
+                    } = frag;
+                    self.expand_fragment(
+                        directives,
+                        type_condition.as_ref(),
+                        type_set,
+                        selection_set,
+                        ty,
+                        &mut newset,
+                    )?;
+                }
+            }
+        }
+        Ok(newset)
+    }
+
+    fn expand_fragment(
+        &self,
+        directives: Vec<q::Directive>,
+        frag_cond: Option<&q::TypeCondition>,
+        type_set: &a::ObjectTypeSet,
+        selection_set: q::SelectionSet,
+        ty: ObjectOrInterface,
+        newset: &mut a::SelectionSet,
+    ) -> Result<(), Vec<QueryExecutionError>> {
+        let (directives, skip) = self.interpolate_directives(directives)?;
+        // Field names in fragment spreads refer to this type, which will
+        // usually be different from the outer type
+        let ty = match frag_cond {
+            Some(q::TypeCondition::On(name)) => self
+                .schema
+                .object_or_interface(name)
+                .expect("type names on fragment spreads are valid"),
+            None => ty,
+        };
+        if !skip {
+            let type_set = a::ObjectTypeSet::convert(&self.schema, frag_cond)?.intersect(type_set);
+            let selection_set = self.expand_selection_set(selection_set, &type_set, ty)?;
+            newset.merge(selection_set, directives)?;
+        }
+        Ok(())
+    }
+}
diff --git a/graphql/src/execution/resolver.rs b/graphql/src/execution/resolver.rs
new file mode 100644
index 0000000..f601b6f
--- /dev/null
+++ b/graphql/src/execution/resolver.rs
@@ -0,0 +1,124 @@
+use graph::components::store::UnitStream;
+use graph::data::query::Trace;
+use graph::prelude::{async_trait, s, tokio, ApiSchema, Error, QueryExecutionError};
+use graph::{
+    data::graphql::ObjectOrInterface,
+    prelude::{r, QueryResult},
+};
+
+use crate::execution::{ast as a, ExecutionContext};
+
+/// A GraphQL resolver that can resolve entities, enum values, scalar types and interfaces/unions.
+#[async_trait]
+pub trait Resolver: Sized + Send + Sync + 'static {
+    const CACHEABLE: bool;
+
+    async fn query_permit(&self) -> Result<tokio::sync::OwnedSemaphorePermit, QueryExecutionError>;
+
+    /// Prepare for executing a query by prefetching as much data as possible
+    fn prefetch(
+        &self,
+        ctx: &ExecutionContext<Self>,
+        selection_set: &a::SelectionSet,
+    ) -> Result<(Option<r::Value>, Trace), Vec<QueryExecutionError>>;
+
+    /// Resolves list of objects, `prefetched_objects` is `Some` if the parent already calculated the value.
+    async fn resolve_objects(
+        &self,
+        prefetched_objects: Option<r::Value>,
+        field: &a::Field,
+        field_definition: &s::Field,
+        object_type: ObjectOrInterface<'_>,
+    ) -> Result<r::Value, QueryExecutionError>;
+
+    /// Resolves an object, `prefetched_object` is `Some` if the parent already calculated the value.
+    async fn resolve_object(
+        &self,
+        prefetched_object: Option<r::Value>,
+        field: &a::Field,
+        field_definition: &s::Field,
+        object_type: ObjectOrInterface<'_>,
+    ) -> Result<r::Value, QueryExecutionError>;
+
+    /// Resolves an enum value for a given enum type.
+    fn resolve_enum_value(
+        &self,
+        _field: &a::Field,
+        _enum_type: &s::EnumType,
+        value: Option<r::Value>,
+    ) -> Result<r::Value, QueryExecutionError> {
+        Ok(value.unwrap_or(r::Value::Null))
+    }
+
+    /// Resolves a scalar value for a given scalar type.
+    async fn resolve_scalar_value(
+        &self,
+        _parent_object_type: &s::ObjectType,
+        _field: &a::Field,
+        _scalar_type: &s::ScalarType,
+        value: Option<r::Value>,
+    ) -> Result<r::Value, QueryExecutionError> {
+        // This code is duplicated.
+        // See also c2112309-44fd-4a84-92a0-5a651e6ed548
+        Ok(value.unwrap_or(r::Value::Null))
+    }
+
+    /// Resolves a list of enum values for a given enum type.
+    fn resolve_enum_values(
+        &self,
+        _field: &a::Field,
+        _enum_type: &s::EnumType,
+        value: Option<r::Value>,
+    ) -> Result<r::Value, Vec<QueryExecutionError>> {
+        Ok(value.unwrap_or(r::Value::Null))
+    }
+
+    /// Resolves a list of scalar values for a given list type.
+    fn resolve_scalar_values(
+        &self,
+        _field: &a::Field,
+        _scalar_type: &s::ScalarType,
+        value: Option<r::Value>,
+    ) -> Result<r::Value, Vec<QueryExecutionError>> {
+        Ok(value.unwrap_or(r::Value::Null))
+    }
+
+    // Resolves an abstract type into the specific type of an object.
+    fn resolve_abstract_type<'a>(
+        &self,
+        schema: &'a ApiSchema,
+        _abstract_type: &s::TypeDefinition,
+        object_value: &r::Value,
+    ) -> Option<&'a s::ObjectType> {
+        let concrete_type_name = match object_value {
+            // All objects contain `__typename`
+            r::Value::Object(data) => match &data.get("__typename").unwrap() {
+                r::Value::String(name) => name.clone(),
+                _ => unreachable!("__typename must be a string"),
+            },
+            _ => unreachable!("abstract type value must be an object"),
+        };
+
+        // A name returned in a `__typename` must exist in the schema.
+        match schema.get_named_type(&concrete_type_name).unwrap() {
+            s::TypeDefinition::Object(object) => Some(object),
+            _ => unreachable!("only objects may implement interfaces"),
+        }
+    }
+
+    // Resolves a change stream for a given field.
+    fn resolve_field_stream(
+        &self,
+        _schema: &ApiSchema,
+        _object_type: &s::ObjectType,
+        _field: &a::Field,
+    ) -> Result<UnitStream, QueryExecutionError> {
+        Err(QueryExecutionError::NotSupported(String::from(
+            "Resolving field streams is not supported by this resolver",
+        )))
+    }
+
+    fn post_process(&self, _result: &mut QueryResult) -> Result<(), Error> {
+        Ok(())
+    }
+}
diff --git a/graphql/src/introspection/mod.rs b/graphql/src/introspection/mod.rs
new file mode 100644
index 0000000..16b7512
--- /dev/null
+++ b/graphql/src/introspection/mod.rs
@@ -0,0 +1,5 @@
+mod resolver;
+mod schema;
+
+pub use self::resolver::IntrospectionResolver;
+pub use self::schema::{is_introspection_field, INTROSPECTION_DOCUMENT, INTROSPECTION_QUERY_TYPE};
diff --git a/graphql/src/introspection/resolver.rs b/graphql/src/introspection/resolver.rs
new file mode 100644
index 0000000..ed95e00
--- /dev/null
+++ b/graphql/src/introspection/resolver.rs
@@ -0,0 +1,446 @@
+use graph::data::graphql::ext::{FieldExt, TypeDefinitionExt};
+use graph::data::query::Trace;
+use graphql_parser::Pos;
+use std::collections::BTreeMap;
+
+use graph::data::graphql::{object, DocumentExt, ObjectOrInterface};
+use graph::prelude::*;
+
+use crate::execution::ast as a;
+use crate::prelude::*;
+use crate::schema::ast as sast;
+
+type TypeObjectsMap = BTreeMap<String, r::Value>;
+
+/// Our Schema has the introspection schema mixed in. When we build the
+/// `TypeObjectsMap`, suppress types and fields that belong to the
+/// introspection schema
+fn schema_type_objects(schema: &Schema) -> TypeObjectsMap {
+    sast::get_type_definitions(&schema.document)
+        .iter()
+        .filter(|def| !def.is_introspection())
+        .fold(BTreeMap::new(), |mut type_objects, typedef| {
+            let type_name = sast::get_type_name(typedef);
+            if !type_objects.contains_key(type_name) {
+                let type_object = type_definition_object(schema, &mut type_objects, typedef);
+                type_objects.insert(type_name.to_owned(), type_object);
+            }
+            type_objects
+        })
+}
+
+fn type_object(schema: &Schema, type_objects: &mut TypeObjectsMap, t: &s::Type) -> r::Value {
+    match t {
+        // We store the name of the named type here to be able to resolve it dynamically later
+        s::Type::NamedType(s) => r::Value::String(s.to_owned()),
+        s::Type::ListType(ref inner) => list_type_object(schema, type_objects, inner),
+        s::Type::NonNullType(ref inner) => non_null_type_object(schema, type_objects, inner),
+    }
+}
+
+fn list_type_object(
+    schema: &Schema,
+    type_objects: &mut TypeObjectsMap,
+    inner_type: &s::Type,
+) -> r::Value {
+    object! {
+        kind: r::Value::Enum(String::from("LIST")),
+        ofType: type_object(schema, type_objects, inner_type),
+    }
+}
+
+fn non_null_type_object(
+    schema: &Schema,
+    type_objects: &mut TypeObjectsMap,
+    inner_type: &s::Type,
+) -> r::Value {
+    object! {
+        kind: r::Value::Enum(String::from("NON_NULL")),
+        ofType: type_object(schema, type_objects, inner_type),
+    }
+}
+
+fn type_definition_object(
+    schema: &Schema,
+    type_objects: &mut TypeObjectsMap,
+    typedef: &s::TypeDefinition,
+) -> r::Value {
+    let type_name = sast::get_type_name(typedef);
+
+    type_objects.get(type_name).cloned().unwrap_or_else(|| {
+        let type_object = match typedef {
+            s::TypeDefinition::Enum(enum_type) => enum_type_object(enum_type),
+            s::TypeDefinition::InputObject(input_object_type) => {
+                input_object_type_object(schema, type_objects, input_object_type)
+            }
+            s::TypeDefinition::Interface(interface_type) => {
+                interface_type_object(schema, type_objects, interface_type)
+            }
+            s::TypeDefinition::Object(object_type) => {
+                object_type_object(schema, type_objects, object_type)
+            }
+            s::TypeDefinition::Scalar(scalar_type) => scalar_type_object(scalar_type),
+            s::TypeDefinition::Union(union_type) => union_type_object(schema, union_type),
+        };
+
+        type_objects.insert(type_name.to_owned(), type_object.clone());
+        type_object
+    })
+}
+
+fn enum_type_object(enum_type: &s::EnumType) -> r::Value {
+    object! {
+        kind: r::Value::Enum(String::from("ENUM")),
+        name: enum_type.name.to_owned(),
+        description: enum_type.description.clone(),
+        enumValues: enum_values(enum_type),
+    }
+}
+
+fn enum_values(enum_type: &s::EnumType) -> r::Value {
+    r::Value::List(enum_type.values.iter().map(enum_value).collect())
+}
+
+fn enum_value(enum_value: &s::EnumValue) -> r::Value {
+    object! {
+        name: enum_value.name.to_owned(),
+        description: enum_value.description.clone(),
+        isDeprecated: false,
+        deprecationReason: r::Value::Null,
+    }
+}
+
+fn input_object_type_object(
+    schema: &Schema,
+    type_objects: &mut TypeObjectsMap,
+    input_object_type: &s::InputObjectType,
+) -> r::Value {
+    let input_values = input_values(schema, type_objects, &input_object_type.fields);
+    object! {
+        name: input_object_type.name.to_owned(),
+        kind: r::Value::Enum(String::from("INPUT_OBJECT")),
+        description: input_object_type.description.clone(),
+        inputFields: input_values,
+    }
+}
+
+fn interface_type_object(
+    schema: &Schema,
+    type_objects: &mut TypeObjectsMap,
+    interface_type: &s::InterfaceType,
+) -> r::Value {
+    object! {
+        name: interface_type.name.to_owned(),
+        kind: r::Value::Enum(String::from("INTERFACE")),
+        description: interface_type.description.clone(),
+        fields:
+            field_objects(schema, type_objects, &interface_type.fields),
+        possibleTypes: schema.types_for_interface()[&interface_type.into()]
+            .iter()
+            .map(|object_type| r::Value::String(object_type.name.to_owned()))
+            .collect::<Vec<_>>(),
+    }
+}
+
+fn object_type_object(
+    schema: &Schema,
+    type_objects: &mut TypeObjectsMap,
+    object_type: &s::ObjectType,
+) -> r::Value {
+    type_objects
+        .get(&object_type.name)
+        .cloned()
+        .unwrap_or_else(|| {
+            let type_object = object! {
+                kind: r::Value::Enum(String::from("OBJECT")),
+                name: object_type.name.to_owned(),
+                description: object_type.description.clone(),
+                fields: field_objects(schema, type_objects, &object_type.fields),
+                interfaces: object_interfaces(schema, type_objects, object_type),
+            };
+
+            type_objects.insert(object_type.name.to_owned(), type_object.clone());
+            type_object
+        })
+}
+
+fn field_objects(
+    schema: &Schema,
+    type_objects: &mut TypeObjectsMap,
+    fields: &[s::Field],
+) -> r::Value {
+    r::Value::List(
+        fields
+            .iter()
+            .filter(|field| !field.is_introspection())
+            .map(|field| field_object(schema, type_objects, field))
+            .collect(),
+    )
+}
+
+fn field_object(schema: &Schema, type_objects: &mut TypeObjectsMap, field: &s::Field) -> r::Value {
+    object! {
+        name: field.name.to_owned(),
+        description: field.description.clone(),
+        args: input_values(schema, type_objects, &field.arguments),
+        type: type_object(schema, type_objects, &field.field_type),
+        isDeprecated: false,
+        deprecationReason: r::Value::Null,
+    }
+}
+
+fn object_interfaces(
+    schema: &Schema,
+    type_objects: &mut TypeObjectsMap,
+    object_type: &s::ObjectType,
+) -> r::Value {
+    r::Value::List(
+        schema
+            .interfaces_for_type(&object_type.into())
+            .unwrap_or(&vec![])
+            .iter()
+            .map(|typedef| interface_type_object(schema, type_objects, typedef))
+            .collect(),
+    )
+}
+
+fn scalar_type_object(scalar_type: &s::ScalarType) -> r::Value {
+    object! {
+        name: scalar_type.name.to_owned(),
+        kind: r::Value::Enum(String::from("SCALAR")),
+        description: scalar_type.description.clone(),
+        isDeprecated: false,
+        deprecationReason: r::Value::Null,
+    }
+}
+
+fn union_type_object(schema: &Schema, union_type: &s::UnionType) -> r::Value {
+    object! {
+        name: union_type.name.to_owned(),
+        kind: r::Value::Enum(String::from("UNION")),
+        description: union_type.description.clone(),
+        possibleTypes:
+            schema.document.get_object_type_definitions()
+                .iter()
+                .filter(|object_type| {
+                    object_type
+                        .implements_interfaces
+                        .iter()
+                        .any(|implemented_name| implemented_name == &union_type.name)
+                })
+                .map(|object_type| r::Value::String(object_type.name.to_owned()))
+                .collect::<Vec<_>>(),
+    }
+}
+
+fn schema_directive_objects(schema: &Schema, type_objects: &mut TypeObjectsMap) -> r::Value {
+    r::Value::List(
+        schema
+            .document
+            .definitions
+            .iter()
+            .filter_map(|d| match d {
+                s::Definition::DirectiveDefinition(dd) => Some(dd),
+                _ => None,
+            })
+            .map(|dd| directive_object(schema, type_objects, dd))
+            .collect(),
+    )
+}
+
+fn directive_object(
+    schema: &Schema,
+    type_objects: &mut TypeObjectsMap,
+    directive: &s::DirectiveDefinition,
+) -> r::Value {
+    object! {
+        name: directive.name.to_owned(),
+        description: directive.description.clone(),
+        locations: directive_locations(directive),
+        args: input_values(schema, type_objects, &directive.arguments),
+    }
+}
+
+fn directive_locations(directive: &s::DirectiveDefinition) -> r::Value {
+    r::Value::List(
+        directive
+            .locations
+            .iter()
+            .map(|location| location.as_str())
+            .map(|name| r::Value::Enum(name.to_owned()))
+            .collect(),
+    )
+}
+
+fn input_values(
+    schema: &Schema,
+    type_objects: &mut TypeObjectsMap,
+    input_values: &[s::InputValue],
+) -> Vec<r::Value> {
+    input_values
+        .iter()
+        .map(|value| input_value(schema, type_objects, value))
+        .collect()
+}
+
+fn input_value(
+    schema: &Schema,
+    type_objects: &mut TypeObjectsMap,
+    input_value: &s::InputValue,
+) -> r::Value {
+    object! {
+        name: input_value.name.to_owned(),
+        description: input_value.description.clone(),
+        type: type_object(schema, type_objects, &input_value.value_type),
+        defaultValue:
+            input_value
+                .default_value
+                .as_ref()
+                .map_or(r::Value::Null, |value| {
+                    r::Value::String(format!("{}", value))
+                }),
+    }
+}
+
+#[derive(Clone)]
+pub struct IntrospectionResolver {
+    _logger: Logger,
+    type_objects: TypeObjectsMap,
+    directives: r::Value,
+}
+
+impl IntrospectionResolver {
+    pub fn new(logger: &Logger, schema: &Schema) -> Self {
+        let logger = logger.new(o!("component" => "IntrospectionResolver"));
+
+        // Generate queryable objects for all types in the schema
+        let mut type_objects = schema_type_objects(schema);
+
+        // Generate queryable objects for all directives in the schema
+        let directives = schema_directive_objects(schema, &mut type_objects);
+
+        IntrospectionResolver {
+            _logger: logger,
+            type_objects,
+            directives,
+        }
+    }
+
+    fn schema_object(&self) -> r::Value {
+        object! {
+            queryType:
+                self.type_objects
+                    .get(&String::from("Query"))
+                    .cloned(),
+            subscriptionType:
+                self.type_objects
+                    .get(&String::from("Subscription"))
+                    .cloned(),
+            mutationType: r::Value::Null,
+            types: self.type_objects.values().cloned().collect::<Vec<_>>(),
+            directives: self.directives.clone(),
+        }
+    }
+
+    fn type_object(&self, name: &r::Value) -> r::Value {
+        match name {
+            r::Value::String(s) => Some(s),
+            _ => None,
+        }
+        .and_then(|name| self.type_objects.get(name).cloned())
+        .unwrap_or(r::Value::Null)
+    }
+}
+
+/// A GraphQL resolver that can resolve entities, enum values, scalar types and interfaces/unions.
+#[async_trait]
+impl Resolver for IntrospectionResolver {
+    // `IntrospectionResolver` is not used as a "top level" resolver,
+    // see `fn as_introspection_context`, so this value is irrelevant.
+    const CACHEABLE: bool = false;
+
+    async fn query_permit(&self) -> Result<tokio::sync::OwnedSemaphorePermit, QueryExecutionError> {
+        unreachable!()
+    }
+
+    fn prefetch(
+        &self,
+        _: &ExecutionContext<Self>,
+        _: &a::SelectionSet,
+    ) -> Result<(Option<r::Value>, Trace), Vec<QueryExecutionError>> {
+        Ok((None, Trace::None))
+    }
+
+    async fn resolve_objects(
+        &self,
+        prefetched_objects: Option<r::Value>,
+        field: &a::Field,
+        _field_definition: &s::Field,
+        _object_type: ObjectOrInterface<'_>,
+    ) -> Result<r::Value, QueryExecutionError> {
+        match field.name.as_str() {
+            "possibleTypes" => {
+                let type_names = match prefetched_objects {
+                    Some(r::Value::List(type_names)) => Some(type_names),
+                    _ => None,
+                }
+                .unwrap_or_default();
+
+                if !type_names.is_empty() {
+                    Ok(r::Value::List(
+                        type_names
+                            .iter()
+                            .filter_map(|type_name| match type_name {
+                                r::Value::String(ref type_name) => Some(type_name),
+                                _ => None,
+                            })
+                            .filter_map(|type_name| self.type_objects.get(type_name).cloned())
+                            .map(r::Value::try_from)
+                            .collect::<Result<_, _>>()
+                            .map_err(|v| {
+                                QueryExecutionError::ValueParseError(
+                                    "internal error resolving type name".to_string(),
+                                    v.to_string(),
+                                )
+                            })?,
+                    ))
+                } else {
+                    Ok(r::Value::Null)
+                }
+            }
+            _ => Ok(prefetched_objects.unwrap_or(r::Value::Null)),
+        }
+    }
+
+    async fn resolve_object(
+        &self,
+        prefetched_object: Option<r::Value>,
+        field: &a::Field,
+        _field_definition: &s::Field,
+        _object_type: ObjectOrInterface<'_>,
+    ) -> Result<r::Value, QueryExecutionError> {
+        let object = match field.name.as_str() {
+            "__schema" => self.schema_object(),
+            "__type" => {
+                let name = field.argument_value("name").ok_or_else(|| {
+                    QueryExecutionError::MissingArgumentError(
+                        Pos::default(),
+                        "missing argument `name` in `__type(name: String!)`".to_owned(),
+                    )
+                })?;
+                self.type_object(name)
+            }
+            "type" | "ofType" => match prefetched_object {
+                Some(r::Value::String(type_name)) => self
+                    .type_objects
+                    .get(&type_name)
+                    .cloned()
+                    .unwrap_or(r::Value::Null),
+                Some(v) => v,
+                None => r::Value::Null,
+            },
+            _ => prefetched_object.unwrap_or(r::Value::Null),
+        };
+        Ok(object)
+    }
+}
diff --git a/graphql/src/introspection/schema.rs b/graphql/src/introspection/schema.rs
new file mode 100644
index 0000000..97379af
--- /dev/null
+++ b/graphql/src/introspection/schema.rs
@@ -0,0 +1,132 @@
+use std::sync::Arc;
+
+use graphql_parser;
+
+use graph::data::graphql::ext::DocumentExt;
+use graph::data::graphql::ext::ObjectTypeExt;
+use graph::prelude::s::Document;
+
+use lazy_static::lazy_static;
+
+use crate::schema::ast as sast;
+
+const INTROSPECTION_SCHEMA: &str = "
+scalar Boolean
+scalar Float
+scalar Int
+scalar ID
+scalar String
+
+type Query {
+  __schema: __Schema!
+  __type(name: String!): __Type
+}
+
+type __Schema {
+  types: [__Type!]!
+  queryType: __Type!
+  mutationType: __Type
+  subscriptionType: __Type
+  directives: [__Directive!]!
+}
+
+type __Type {
+  kind: __TypeKind!
+  name: String
+  description: String
+
+  # OBJECT and INTERFACE only
+  fields(includeDeprecated: Boolean = false): [__Field!]
+
+  # OBJECT only
+  interfaces: [__Type!]
+
+  # INTERFACE and UNION only
+  possibleTypes: [__Type!]
+
+  # ENUM only
+  enumValues(includeDeprecated: Boolean = false): [__EnumValue!]
+
+  # INPUT_OBJECT only
+  inputFields: [__InputValue!]
+
+  # NON_NULL and LIST only
+  ofType: __Type
+}
+
+type __Field {
+  name: String!
+  description: String
+  args: [__InputValue!]!
+  type: __Type!
+  isDeprecated: Boolean!
+  deprecationReason: String
+}
+
+type __InputValue {
+  name: String!
+  description: String
+  type: __Type!
+  defaultValue: String
+}
+
+type __EnumValue {
+  name: String!
+  description: String
+  isDeprecated: Boolean!
+  deprecationReason: String
+}
+
+enum __TypeKind {
+  SCALAR
+  OBJECT
+  INTERFACE
+  UNION
+  ENUM
+  INPUT_OBJECT
+  LIST
+  NON_NULL
+}
+
+type __Directive {
+  name: String!
+  description: String
+  locations: [__DirectiveLocation!]!
+  args: [__InputValue!]!
+}
+
+enum __DirectiveLocation {
+  QUERY
+  MUTATION
+  SUBSCRIPTION
+  FIELD
+  FRAGMENT_DEFINITION
+  FRAGMENT_SPREAD
+  INLINE_FRAGMENT
+  SCHEMA
+  SCALAR
+  OBJECT
+  FIELD_DEFINITION
+  ARGUMENT_DEFINITION
+  INTERFACE
+  UNION
+  ENUM
+  ENUM_VALUE
+  INPUT_OBJECT
+  INPUT_FIELD_DEFINITION
+}";
+
+lazy_static! {
+    pub static ref INTROSPECTION_DOCUMENT: Document =
+        graphql_parser::parse_schema(INTROSPECTION_SCHEMA).unwrap();
+    pub static ref INTROSPECTION_QUERY_TYPE: sast::ObjectType = sast::ObjectType::from(Arc::new(
+        INTROSPECTION_DOCUMENT
+            .get_root_query_type()
+            .unwrap()
+            .clone()
+    ));
+}
+
+pub fn is_introspection_field(name: &str) -> bool {
+    INTROSPECTION_QUERY_TYPE.field(name).is_some()
+}
diff --git a/graphql/src/lib.rs b/graphql/src/lib.rs
new file mode 100644
index 0000000..310f58a
--- /dev/null
+++ b/graphql/src/lib.rs
@@ -0,0 +1,49 @@
+pub extern crate graphql_parser;
+
+/// Utilities for working with GraphQL schemas.
+pub mod schema;
+
+/// Utilities for schema introspection.
+pub mod introspection;
+
+/// Utilities for executing GraphQL.
+mod execution;
+
+/// Utilities for executing GraphQL queries and working with query ASTs.
+pub mod query;
+
+/// Utilities for executing GraphQL subscriptions.
+pub mod subscription;
+
+/// Utilities for working with GraphQL values.
+mod values;
+
+/// Utilities for querying `Store` components.
+mod store;
+
+/// The external interface for actually running queries
+mod runner;
+
+/// Utilities for working with Prometheus.
+mod metrics;
+
+/// Prelude that exports the most important traits and types.
+pub mod prelude {
+    pub use super::execution::{ast as a, ExecutionContext, Query, Resolver};
+    pub use super::introspection::IntrospectionResolver;
+    pub use super::query::{execute_query, ext::BlockConstraint, QueryExecutionOptions};
+    pub use super::schema::{api_schema, APISchemaError};
+    pub use super::store::StoreResolver;
+    pub use super::subscription::SubscriptionExecutionOptions;
+    pub use super::values::MaybeCoercible;
+
+    pub use super::metrics::GraphQLMetrics;
+    pub use super::runner::GraphQlRunner;
+    pub use graph::prelude::s::ObjectType;
+}
+
+#[cfg(debug_assertions)]
+pub mod test_support {
+    pub use super::metrics::GraphQLMetrics;
+    pub use super::runner::INITIAL_DEPLOYMENT_STATE_FOR_TESTS;
+}
diff --git a/graphql/src/metrics.rs b/graphql/src/metrics.rs
new file mode 100644
index 0000000..5163e8c
--- /dev/null
+++ b/graphql/src/metrics.rs
@@ -0,0 +1,136 @@
+use std::collections::HashMap;
+use std::fmt;
+use std::sync::Arc;
+use std::time::Duration;
+
+use graph::data::query::QueryResults;
+use graph::prelude::{DeploymentHash, GraphQLMetrics as GraphQLMetricsTrait, MetricsRegistry};
+use graph::prometheus::{Gauge, Histogram, HistogramVec};
+
+pub struct GraphQLMetrics {
+    query_execution_time: Box<HistogramVec>,
+    query_parsing_time: Box<HistogramVec>,
+    query_validation_time: Box<HistogramVec>,
+    query_result_size: Box<Histogram>,
+    query_result_size_max: Box<Gauge>,
+}
+
+impl fmt::Debug for GraphQLMetrics {
+    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
+        write!(f, "GraphQLMetrics {{ }}")
+    }
+}
+
+impl GraphQLMetricsTrait for GraphQLMetrics {
+    fn observe_query_execution(&self, duration: Duration, results: &QueryResults) {
+        let id = results
+            .deployment_hash()
+            .map(|h| h.as_str())
+            .unwrap_or_else(|| {
+                if results.not_found() {
+                    "notfound"
+                } else {
+                    "unknown"
+                }
+            });
+        let status = if results.has_errors() {
+            "failed"
+        } else {
+            "success"
+        };
+        self.query_execution_time
+            .with_label_values(&[id, status])
+            .observe(duration.as_secs_f64());
+    }
+
+    fn observe_query_parsing(&self, duration: Duration, results: &QueryResults) {
+        let id = results
+            .deployment_hash()
+            .map(|h| h.as_str())
+            .unwrap_or_else(|| {
+                if results.not_found() {
+                    "notfound"
+                } else {
+                    "unknown"
+                }
+            });
+        self.query_parsing_time
+            .with_label_values(&[id])
+            .observe(duration.as_secs_f64());
+    }
+
+    fn observe_query_validation(&self, duration: Duration, id: &DeploymentHash) {
+        self.query_validation_time
+            .with_label_values(&[id.as_str()])
+            .observe(duration.as_secs_f64());
+    }
+}
+
+impl GraphQLMetrics {
+    pub fn new(registry: Arc<dyn MetricsRegistry>) -> Self {
+        let query_execution_time = registry
+            .new_histogram_vec(
+                "query_execution_time",
+                "Execution time for successful GraphQL queries",
+                vec![String::from("deployment"), String::from("status")],
+                vec![0.1, 0.5, 1.0, 10.0, 100.0],
+            )
+            .expect("failed to create `query_execution_time` histogram");
+        let query_parsing_time = registry
+            .new_histogram_vec(
+                "query_parsing_time",
+                "Parsing time for GraphQL queries",
+                vec![String::from("deployment")],
+                vec![0.1, 0.5, 1.0, 10.0, 100.0],
+            )
+            .expect("failed to create `query_parsing_time` histogram");
+
+        let query_validation_time = registry
+            .new_histogram_vec(
+                "query_validation_time",
+                "Validation time for GraphQL queries",
+                vec![String::from("deployment")],
+                vec![0.1, 0.5, 1.0, 10.0, 100.0],
+            )
+            .expect("failed to create `query_validation_time` histogram");
+
+        let bins = (10..32).map(|n| 2u64.pow(n) as f64).collect::<Vec<_>>();
+        let query_result_size = registry
+            .new_histogram(
+                "query_result_size",
+                "the size of the result of successful GraphQL queries (in CacheWeight)",
+                bins,
+            )
+            .unwrap();
+
+        let query_result_size_max = registry
+            .new_gauge(
+                "query_result_max",
+                "the maximum size of a query result (in CacheWeight)",
+                HashMap::new(),
+            )
+            .unwrap();
+
+        Self {
+            query_execution_time,
+            query_parsing_time,
+            query_validation_time,
+            query_result_size,
+            query_result_size_max,
+        }
+    }
+
+    // Tests need to construct one of these, but normal code doesn't
+    #[cfg(debug_assertions)]
+    pub fn make(registry: Arc<dyn MetricsRegistry>) -> Self {
+        Self::new(registry)
+    }
+
+    pub fn observe_query_result_size(&self, size: usize) {
+        let size = size as f64;
+        self.query_result_size.observe(size);
+        if self.query_result_size_max.get() < size {
+            self.query_result_size_max.set(size);
+        }
+    }
+}
diff --git a/graphql/src/query/ast.rs b/graphql/src/query/ast.rs
new file mode 100644
index 0000000..431c2b6
--- /dev/null
+++ b/graphql/src/query/ast.rs
@@ -0,0 +1,74 @@
+use graph::prelude::q::*;
+
+use graph::prelude::QueryExecutionError;
+
+/// Returns the operation for the given name (or the only operation if no name is defined).
+pub fn get_operation<'a>(
+    document: &'a Document,
+    name: Option<&str>,
+) -> Result<&'a OperationDefinition, QueryExecutionError> {
+    let operations = get_operations(document);
+
+    match (name, operations.len()) {
+        (None, 1) => Ok(operations[0]),
+        (None, _) => Err(QueryExecutionError::OperationNameRequired),
+        (Some(s), n) if n > 0 => operations
+            .into_iter()
+            .find(|op| match get_operation_name(op) {
+                Some(n) => s == n,
+                None => false,
+            })
+            .ok_or_else(|| QueryExecutionError::OperationNotFound(s.to_string())),
+        _ => Err(QueryExecutionError::OperationNameRequired),
+    }
+}
+
+/// Returns all operation definitions in the document.
+pub fn get_operations(document: &Document) -> Vec<&OperationDefinition> {
+    document
+        .definitions
+        .iter()
+        .filter_map(|d| match d {
+            Definition::Operation(op) => Some(op),
+            _ => None,
+        })
+        .collect()
+}
+
+/// Returns the name of the given operation (if it has one).
+pub fn get_operation_name(operation: &OperationDefinition) -> Option<&str> {
+    match operation {
+        OperationDefinition::Mutation(m) => m.name.as_deref(),
+        OperationDefinition::Query(q) => q.name.as_deref(),
+        OperationDefinition::SelectionSet(_) => None,
+        OperationDefinition::Subscription(s) => s.name.as_deref(),
+    }
+}
+
+/// Looks up a directive in a selection, if it is provided.
+pub fn get_directive(selection: &Selection, name: String) -> Option<&Directive> {
+    match selection {
+        Selection::Field(field) => field
+            .directives
+            .iter()
+            .find(|directive| directive.name == name),
+        _ => None,
+    }
+}
+
+/// Looks up the value of an argument in a vector of (name, value) tuples.
+pub fn get_argument_value<'a>(arguments: &'a [(String, Value)], name: &str) -> Option<&'a Value> {
+    arguments.iter().find(|(n, _)| n == name).map(|(_, v)| v)
+}
+
+/// Returns the variable definitions for an operation.
+pub fn get_variable_definitions(
+    operation: &OperationDefinition,
+) -> Option<&Vec<VariableDefinition>> {
+    match operation {
+        OperationDefinition::Query(q) => Some(&q.variable_definitions),
+        OperationDefinition::Subscription(s) => Some(&s.variable_definitions),
+        OperationDefinition::Mutation(m) => Some(&m.variable_definitions),
+        OperationDefinition::SelectionSet(_) => None,
+    }
+}
diff --git a/graphql/src/query/ext.rs b/graphql/src/query/ext.rs
new file mode 100644
index 0000000..a285a4b
--- /dev/null
+++ b/graphql/src/query/ext.rs
@@ -0,0 +1,97 @@
+//! Extension traits for graphql_parser::query structs
+
+use graph::blockchain::BlockHash;
+use graph::prelude::TryFromValue;
+use graphql_parser::Pos;
+
+use std::collections::{BTreeMap, HashMap};
+
+use anyhow::anyhow;
+use graph::data::query::QueryExecutionError;
+use graph::prelude::{q, r, BlockNumber, Error};
+
+pub trait ValueExt: Sized {
+    fn as_object(&self) -> &BTreeMap<String, q::Value>;
+    fn as_string(&self) -> &str;
+
+    /// If `self` is a variable reference, look it up in `vars` and return
+    /// that. Otherwise, just return `self`.
+    ///
+    /// If `self` is a variable reference, but has no entry in `vars` return
+    /// an error
+    fn lookup<'a>(
+        &'a self,
+        vars: &'a HashMap<String, Self>,
+        pos: Pos,
+    ) -> Result<&'a Self, QueryExecutionError>;
+}
+
+impl ValueExt for q::Value {
+    fn as_object(&self) -> &BTreeMap<String, q::Value> {
+        match self {
+            q::Value::Object(object) => object,
+            _ => panic!("expected a Value::Object"),
+        }
+    }
+
+    fn as_string(&self) -> &str {
+        match self {
+            q::Value::String(string) => string,
+            _ => panic!("expected a Value::String"),
+        }
+    }
+
+    fn lookup<'a>(
+        &'a self,
+        vars: &'a HashMap<String, q::Value>,
+        pos: Pos,
+    ) -> Result<&'a q::Value, QueryExecutionError> {
+        match self {
+            q::Value::Variable(name) => vars
+                .get(name)
+                .ok_or_else(|| QueryExecutionError::MissingVariableError(pos, name.to_owned())),
+            _ => Ok(self),
+        }
+    }
+}
+
+#[derive(Clone, PartialEq, Eq, Hash, Debug)]
+pub enum BlockConstraint {
+    Hash(BlockHash),
+    Number(BlockNumber),
+    /// Execute the query on the latest block only if the the subgraph has progressed to or past the
+    /// given block number.
+    Min(BlockNumber),
+    Latest,
+}
+
+impl Default for BlockConstraint {
+    fn default() -> Self {
+        BlockConstraint::Latest
+    }
+}
+
+impl TryFromValue for BlockConstraint {
+    /// `value` should be the output of input object coercion.
+    fn try_from_value(value: &r::Value) -> Result<Self, Error> {
+        let map = match value {
+            r::Value::Object(map) => map,
+            r::Value::Null => return Ok(Self::default()),
+            _ => return Err(anyhow!("invalid `BlockConstraint`")),
+        };
+
+        if let Some(hash) = map.get("hash") {
+            Ok(BlockConstraint::Hash(TryFromValue::try_from_value(hash)?))
+        } else if let Some(number_value) = map.get("number") {
+            Ok(BlockConstraint::Number(BlockNumber::try_from_value(
+                number_value,
+            )?))
+        } else if let Some(number_value) = map.get("number_gte") {
+            Ok(BlockConstraint::Min(BlockNumber::try_from_value(
+                number_value,
+            )?))
+        } else {
+            Err(anyhow!("invalid `BlockConstraint`"))
+        }
+    }
+}
diff --git a/graphql/src/query/mod.rs b/graphql/src/query/mod.rs
new file mode 100644
index 0000000..b8f9b3f
--- /dev/null
+++ b/graphql/src/query/mod.rs
@@ -0,0 +1,85 @@
+use graph::prelude::{BlockPtr, CheapClone, QueryExecutionError, QueryResult};
+use std::sync::Arc;
+use std::time::Instant;
+
+use graph::data::graphql::effort::LoadManager;
+
+use crate::execution::{ast as a, *};
+
+/// Utilities for working with GraphQL query ASTs.
+pub mod ast;
+
+/// Extension traits
+pub mod ext;
+
+/// Options available for query execution.
+pub struct QueryExecutionOptions<R> {
+    /// The resolver to use.
+    pub resolver: R,
+
+    /// Time at which the query times out.
+    pub deadline: Option<Instant>,
+
+    /// Maximum value for the `first` argument.
+    pub max_first: u32,
+
+    /// Maximum value for the `skip` argument
+    pub max_skip: u32,
+
+    pub load_manager: Arc<LoadManager>,
+}
+
+/// Executes a query and returns a result.
+/// If the query is not cacheable, the `Arc` may be unwrapped.
+pub async fn execute_query<R>(
+    query: Arc<Query>,
+    selection_set: Option<a::SelectionSet>,
+    block_ptr: Option<BlockPtr>,
+    options: QueryExecutionOptions<R>,
+) -> Arc<QueryResult>
+where
+    R: Resolver,
+{
+    // Create a fresh execution context
+    let ctx = Arc::new(ExecutionContext {
+        logger: query.logger.clone(),
+        resolver: options.resolver,
+        query: query.clone(),
+        deadline: options.deadline,
+        max_first: options.max_first,
+        max_skip: options.max_skip,
+        cache_status: Default::default(),
+    });
+
+    if !query.is_query() {
+        return Arc::new(
+            QueryExecutionError::NotSupported("Only queries are supported".to_string()).into(),
+        );
+    }
+    let selection_set = selection_set
+        .map(Arc::new)
+        .unwrap_or_else(|| query.selection_set.cheap_clone());
+
+    // Execute top-level `query { ... }` and `{ ... }` expressions.
+    let query_type = ctx.query.schema.query_type.cheap_clone().into();
+    let start = Instant::now();
+    let result = execute_root_selection_set(
+        ctx.cheap_clone(),
+        selection_set.cheap_clone(),
+        query_type,
+        block_ptr.clone(),
+    )
+    .await;
+    let elapsed = start.elapsed();
+    let cache_status = ctx.cache_status.load();
+    options
+        .load_manager
+        .record_work(query.shape_hash, elapsed, cache_status);
+    query.log_cache_status(
+        &selection_set,
+        block_ptr.map(|b| b.number).unwrap_or(0),
+        start,
+        cache_status.to_string(),
+    );
+    result
+}
diff --git a/graphql/src/runner.rs b/graphql/src/runner.rs
new file mode 100644
index 0000000..968c426
--- /dev/null
+++ b/graphql/src/runner.rs
@@ -0,0 +1,280 @@
+use std::sync::Arc;
+use std::time::Instant;
+
+use crate::metrics::GraphQLMetrics;
+use crate::prelude::{QueryExecutionOptions, StoreResolver, SubscriptionExecutionOptions};
+use crate::query::execute_query;
+use crate::subscription::execute_prepared_subscription;
+use graph::prelude::MetricsRegistry;
+use graph::{
+    components::store::SubscriptionManager,
+    prelude::{
+        async_trait, o, CheapClone, DeploymentState, GraphQLMetrics as GraphQLMetricsTrait,
+        GraphQlRunner as GraphQlRunnerTrait, Logger, Query, QueryExecutionError, Subscription,
+        SubscriptionError, SubscriptionResult, ENV_VARS,
+    },
+};
+use graph::{data::graphql::effort::LoadManager, prelude::QueryStoreManager};
+use graph::{
+    data::query::{QueryResults, QueryTarget},
+    prelude::QueryStore,
+};
+
+/// GraphQL runner implementation for The Graph.
+pub struct GraphQlRunner<S, SM> {
+    logger: Logger,
+    store: Arc<S>,
+    subscription_manager: Arc<SM>,
+    load_manager: Arc<LoadManager>,
+    graphql_metrics: Arc<GraphQLMetrics>,
+}
+
+#[cfg(debug_assertions)]
+lazy_static::lazy_static! {
+    // Test only, see c435c25decbc4ad7bbbadf8e0ced0ff2
+    pub static ref INITIAL_DEPLOYMENT_STATE_FOR_TESTS: std::sync::Mutex<Option<DeploymentState>> = std::sync::Mutex::new(None);
+}
+
+impl<S, SM> GraphQlRunner<S, SM>
+where
+    S: QueryStoreManager,
+    SM: SubscriptionManager,
+{
+    /// Creates a new query runner.
+    pub fn new(
+        logger: &Logger,
+        store: Arc<S>,
+        subscription_manager: Arc<SM>,
+        load_manager: Arc<LoadManager>,
+        registry: Arc<dyn MetricsRegistry>,
+    ) -> Self {
+        let logger = logger.new(o!("component" => "GraphQlRunner"));
+        let graphql_metrics = Arc::new(GraphQLMetrics::new(registry));
+        GraphQlRunner {
+            logger,
+            store,
+            subscription_manager,
+            load_manager,
+            graphql_metrics,
+        }
+    }
+
+    /// Check if the subgraph state differs from `state` now in a way that
+    /// would affect a query that looked at data as fresh as `latest_block`.
+    /// If the subgraph did change, return the `Err` that should be sent back
+    /// to clients to indicate that condition
+    async fn deployment_changed(
+        &self,
+        store: &dyn QueryStore,
+        state: DeploymentState,
+        latest_block: u64,
+    ) -> Result<(), QueryExecutionError> {
+        if ENV_VARS.graphql.allow_deployment_change {
+            return Ok(());
+        }
+        let new_state = store.deployment_state().await?;
+        assert!(new_state.reorg_count >= state.reorg_count);
+        if new_state.reorg_count > state.reorg_count {
+            // One or more reorgs happened; each reorg can't have gone back
+            // farther than `max_reorg_depth`, so that querying at blocks
+            // far enough away from the previous latest block is fine. Taking
+            // this into consideration is important, since most of the time
+            // there is only one reorg of one block, and we therefore avoid
+            // flagging a lot of queries a bit behind the head
+            let n_blocks = new_state.max_reorg_depth * (new_state.reorg_count - state.reorg_count);
+            if latest_block + n_blocks as u64 > state.latest_block.number as u64 {
+                return Err(QueryExecutionError::DeploymentReverted);
+            }
+        }
+        Ok(())
+    }
+
+    async fn execute(
+        &self,
+        query: Query,
+        target: QueryTarget,
+        max_complexity: Option<u64>,
+        max_depth: Option<u8>,
+        max_first: Option<u32>,
+        max_skip: Option<u32>,
+        metrics: Arc<GraphQLMetrics>,
+    ) -> Result<QueryResults, QueryResults> {
+        // We need to use the same `QueryStore` for the entire query to ensure
+        // we have a consistent view if the world, even when replicas, which
+        // are eventually consistent, are in use. If we run different parts
+        // of the query against different replicas, it would be possible for
+        // them to be at wildly different states, and we might unwittingly
+        // mix data from different block heights even if no reverts happen
+        // while the query is running. `self.store` can not be used after this
+        // point, and everything needs to go through the `store` we are
+        // setting up here
+
+        let store = self.store.query_store(target.clone(), false).await?;
+        let state = store.deployment_state().await?;
+        let network = Some(store.network_name().to_string());
+        let schema = store.api_schema()?;
+
+        // Test only, see c435c25decbc4ad7bbbadf8e0ced0ff2
+        #[cfg(debug_assertions)]
+        let state = INITIAL_DEPLOYMENT_STATE_FOR_TESTS
+            .lock()
+            .unwrap()
+            .clone()
+            .unwrap_or(state);
+
+        let max_depth = max_depth.unwrap_or(ENV_VARS.graphql.max_depth);
+        let query = crate::execution::Query::new(
+            &self.logger,
+            schema,
+            network,
+            query,
+            max_complexity,
+            max_depth,
+            metrics.cheap_clone(),
+        )?;
+        self.load_manager
+            .decide(
+                &store.wait_stats().map_err(QueryExecutionError::from)?,
+                query.shape_hash,
+                query.query_text.as_ref(),
+            )
+            .to_result()?;
+        let by_block_constraint = query.block_constraint()?;
+        let mut max_block = 0;
+        let mut result: QueryResults = QueryResults::empty();
+
+        // Note: This will always iterate at least once.
+        for (bc, (selection_set, error_policy)) in by_block_constraint {
+            let query_start = Instant::now();
+            let resolver = StoreResolver::at_block(
+                &self.logger,
+                store.cheap_clone(),
+                &state,
+                self.subscription_manager.cheap_clone(),
+                bc,
+                error_policy,
+                query.schema.id().clone(),
+                metrics.cheap_clone(),
+            )
+            .await?;
+            max_block = max_block.max(resolver.block_number());
+            let query_res = execute_query(
+                query.clone(),
+                Some(selection_set),
+                resolver.block_ptr.as_ref().map(Into::into).clone(),
+                QueryExecutionOptions {
+                    resolver,
+                    deadline: ENV_VARS.graphql.query_timeout.map(|t| Instant::now() + t),
+                    max_first: max_first.unwrap_or(ENV_VARS.graphql.max_first),
+                    max_skip: max_skip.unwrap_or(ENV_VARS.graphql.max_skip),
+                    load_manager: self.load_manager.clone(),
+                },
+            )
+            .await;
+            query_res.trace.finish(query_start.elapsed());
+            result.append(query_res);
+        }
+
+        query.log_execution(max_block);
+        self.deployment_changed(store.as_ref(), state, max_block as u64)
+            .await
+            .map_err(QueryResults::from)
+            .map(|()| result)
+    }
+}
+
+#[async_trait]
+impl<S, SM> GraphQlRunnerTrait for GraphQlRunner<S, SM>
+where
+    S: QueryStoreManager,
+    SM: SubscriptionManager,
+{
+    async fn run_query(self: Arc<Self>, query: Query, target: QueryTarget) -> QueryResults {
+        self.run_query_with_complexity(
+            query,
+            target,
+            ENV_VARS.graphql.max_complexity,
+            Some(ENV_VARS.graphql.max_depth),
+            Some(ENV_VARS.graphql.max_first),
+            Some(ENV_VARS.graphql.max_skip),
+        )
+        .await
+    }
+
+    async fn run_query_with_complexity(
+        self: Arc<Self>,
+        query: Query,
+        target: QueryTarget,
+        max_complexity: Option<u64>,
+        max_depth: Option<u8>,
+        max_first: Option<u32>,
+        max_skip: Option<u32>,
+    ) -> QueryResults {
+        self.execute(
+            query,
+            target,
+            max_complexity,
+            max_depth,
+            max_first,
+            max_skip,
+            self.graphql_metrics.clone(),
+        )
+        .await
+        .unwrap_or_else(|e| e)
+    }
+
+    async fn run_subscription(
+        self: Arc<Self>,
+        subscription: Subscription,
+        target: QueryTarget,
+    ) -> Result<SubscriptionResult, SubscriptionError> {
+        let store = self.store.query_store(target.clone(), true).await?;
+        let schema = store.api_schema()?;
+        let network = store.network_name().to_string();
+
+        let query = crate::execution::Query::new(
+            &self.logger,
+            schema,
+            Some(network),
+            subscription.query,
+            ENV_VARS.graphql.max_complexity,
+            ENV_VARS.graphql.max_depth,
+            self.graphql_metrics.cheap_clone(),
+        )?;
+
+        if let Err(err) = self
+            .load_manager
+            .decide(
+                &store.wait_stats().map_err(QueryExecutionError::from)?,
+                query.shape_hash,
+                query.query_text.as_ref(),
+            )
+            .to_result()
+        {
+            return Err(SubscriptionError::GraphQLError(vec![err]));
+        }
+
+        execute_prepared_subscription(
+            query,
+            SubscriptionExecutionOptions {
+                logger: self.logger.clone(),
+                store,
+                subscription_manager: self.subscription_manager.cheap_clone(),
+                timeout: ENV_VARS.graphql.query_timeout,
+                max_complexity: ENV_VARS.graphql.max_complexity,
+                max_depth: ENV_VARS.graphql.max_depth,
+                max_first: ENV_VARS.graphql.max_first,
+                max_skip: ENV_VARS.graphql.max_skip,
+                graphql_metrics: self.graphql_metrics.clone(),
+            },
+        )
+    }
+
+    fn load_manager(&self) -> Arc<LoadManager> {
+        self.load_manager.clone()
+    }
+
+    fn metrics(&self) -> Arc<dyn GraphQLMetricsTrait> {
+        self.graphql_metrics.clone()
+    }
+}
diff --git a/graphql/src/schema/api.rs b/graphql/src/schema/api.rs
new file mode 100644
index 0000000..03d061c
--- /dev/null
+++ b/graphql/src/schema/api.rs
@@ -0,0 +1,1403 @@
+use std::str::FromStr;
+
+use graphql_parser::Pos;
+use inflector::Inflector;
+use lazy_static::lazy_static;
+
+use crate::schema::ast;
+
+use graph::data::{
+    graphql::ext::{DirectiveExt, DocumentExt, ValueExt},
+    schema::{META_FIELD_NAME, META_FIELD_TYPE, SCHEMA_TYPE_NAME},
+};
+use graph::prelude::s::{Value, *};
+use graph::prelude::*;
+use thiserror::Error;
+
+#[derive(Error, Debug)]
+pub enum APISchemaError {
+    #[error("type {0} already exists in the input schema")]
+    TypeExists(String),
+    #[error("Type {0} not found")]
+    TypeNotFound(String),
+    #[error("Fulltext search is not yet deterministic")]
+    FulltextSearchNonDeterministic,
+}
+
+// The followoing types are defined in meta.graphql
+const BLOCK_HEIGHT: &str = "Block_height";
+const CHANGE_BLOCK_FILTER_NAME: &str = "BlockChangedFilter";
+const ERROR_POLICY_TYPE: &str = "_SubgraphErrorPolicy_";
+
+#[derive(Debug, PartialEq, Eq, Copy, Clone)]
+pub enum ErrorPolicy {
+    Allow,
+    Deny,
+}
+
+impl std::str::FromStr for ErrorPolicy {
+    type Err = anyhow::Error;
+
+    fn from_str(s: &str) -> Result<ErrorPolicy, anyhow::Error> {
+        match s {
+            "allow" => Ok(ErrorPolicy::Allow),
+            "deny" => Ok(ErrorPolicy::Deny),
+            _ => Err(anyhow::anyhow!("failed to parse `{}` as ErrorPolicy", s)),
+        }
+    }
+}
+
+impl TryFrom<&q::Value> for ErrorPolicy {
+    type Error = anyhow::Error;
+
+    /// `value` should be the output of input value coercion.
+    fn try_from(value: &q::Value) -> Result<Self, Self::Error> {
+        match value {
+            q::Value::Enum(s) => ErrorPolicy::from_str(s),
+            _ => Err(anyhow::anyhow!("invalid `ErrorPolicy`")),
+        }
+    }
+}
+
+impl TryFrom<&r::Value> for ErrorPolicy {
+    type Error = anyhow::Error;
+
+    /// `value` should be the output of input value coercion.
+    fn try_from(value: &r::Value) -> Result<Self, Self::Error> {
+        match value {
+            r::Value::Enum(s) => ErrorPolicy::from_str(s),
+            _ => Err(anyhow::anyhow!("invalid `ErrorPolicy`")),
+        }
+    }
+}
+
+/// Derives a full-fledged GraphQL API schema from an input schema.
+///
+/// The input schema should only have type/enum/interface/union definitions
+/// and must not include a root Query type. This Query type is derived, with
+/// all its fields and their input arguments, based on the existing types.
+pub fn api_schema(input_schema: &Document) -> Result<Document, APISchemaError> {
+    // Refactor: Take `input_schema` by value.
+    let object_types = input_schema.get_object_type_definitions();
+    let interface_types = input_schema.get_interface_type_definitions();
+
+    // Refactor: Don't clone the schema.
+    let mut schema = input_schema.clone();
+    add_meta_field_type(&mut schema);
+    add_types_for_object_types(&mut schema, &object_types)?;
+    add_types_for_interface_types(&mut schema, &interface_types)?;
+    add_field_arguments(&mut schema, input_schema)?;
+    add_query_type(&mut schema, &object_types, &interface_types)?;
+    add_subscription_type(&mut schema, &object_types, &interface_types)?;
+
+    // Remove the `_Schema_` type from the generated schema.
+    schema.definitions.retain(|d| match d {
+        Definition::TypeDefinition(def @ TypeDefinition::Object(_)) => match def {
+            TypeDefinition::Object(t) if t.name.eq(SCHEMA_TYPE_NAME) => false,
+            _ => true,
+        },
+        _ => true,
+    });
+
+    Ok(schema)
+}
+
+/// Adds a global `_Meta_` type to the schema. The `_meta` field
+/// accepts values of this type
+fn add_meta_field_type(schema: &mut Document) {
+    lazy_static! {
+        static ref META_FIELD_SCHEMA: Document = {
+            let schema = include_str!("meta.graphql");
+            parse_schema(schema).expect("the schema `meta.graphql` is invalid")
+        };
+    }
+
+    schema
+        .definitions
+        .extend(META_FIELD_SCHEMA.definitions.iter().cloned());
+}
+
+fn add_types_for_object_types(
+    schema: &mut Document,
+    object_types: &[&ObjectType],
+) -> Result<(), APISchemaError> {
+    for object_type in object_types {
+        if !object_type.name.eq(SCHEMA_TYPE_NAME) {
+            add_order_by_type(schema, &object_type.name, &object_type.fields)?;
+            add_filter_type(schema, &object_type.name, &object_type.fields)?;
+        }
+    }
+    Ok(())
+}
+
+/// Adds `*_orderBy` and `*_filter` enum types for the given interfaces to the schema.
+fn add_types_for_interface_types(
+    schema: &mut Document,
+    interface_types: &[&InterfaceType],
+) -> Result<(), APISchemaError> {
+    for interface_type in interface_types {
+        add_order_by_type(schema, &interface_type.name, &interface_type.fields)?;
+        add_filter_type(schema, &interface_type.name, &interface_type.fields)?;
+    }
+    Ok(())
+}
+
+/// Adds a `<type_name>_orderBy` enum type for the given fields to the schema.
+fn add_order_by_type(
+    schema: &mut Document,
+    type_name: &str,
+    fields: &[Field],
+) -> Result<(), APISchemaError> {
+    let type_name = format!("{}_orderBy", type_name);
+
+    match schema.get_named_type(&type_name) {
+        None => {
+            let typedef = TypeDefinition::Enum(EnumType {
+                position: Pos::default(),
+                description: None,
+                name: type_name,
+                directives: vec![],
+                values: fields
+                    .iter()
+                    .map(|field| &field.name)
+                    .map(|name| EnumValue {
+                        position: Pos::default(),
+                        description: None,
+                        name: name.to_owned(),
+                        directives: vec![],
+                    })
+                    .collect(),
+            });
+            let def = Definition::TypeDefinition(typedef);
+            schema.definitions.push(def);
+        }
+        Some(_) => return Err(APISchemaError::TypeExists(type_name)),
+    }
+    Ok(())
+}
+
+/// Adds a `<type_name>_filter` enum type for the given fields to the schema.
+fn add_filter_type(
+    schema: &mut Document,
+    type_name: &str,
+    fields: &[Field],
+) -> Result<(), APISchemaError> {
+    let filter_type_name = format!("{}_filter", type_name);
+    match schema.get_named_type(&filter_type_name) {
+        None => {
+            let mut generated_filter_fields = field_input_values(schema, fields)?;
+            generated_filter_fields.push(block_changed_filter_argument());
+
+            let typedef = TypeDefinition::InputObject(InputObjectType {
+                position: Pos::default(),
+                description: None,
+                name: filter_type_name,
+                directives: vec![],
+                fields: generated_filter_fields,
+            });
+            let def = Definition::TypeDefinition(typedef);
+            schema.definitions.push(def);
+        }
+        Some(_) => return Err(APISchemaError::TypeExists(filter_type_name)),
+    }
+
+    Ok(())
+}
+
+/// Generates `*_filter` input values for the given set of fields.
+fn field_input_values(
+    schema: &Document,
+    fields: &[Field],
+) -> Result<Vec<InputValue>, APISchemaError> {
+    let mut input_values = vec![];
+    for field in fields {
+        input_values.extend(field_filter_input_values(schema, field, &field.field_type)?);
+    }
+    Ok(input_values)
+}
+
+/// Generates `*_filter` input values for the given field.
+fn field_filter_input_values(
+    schema: &Document,
+    field: &Field,
+    field_type: &Type,
+) -> Result<Vec<InputValue>, APISchemaError> {
+    match field_type {
+        Type::NamedType(ref name) => {
+            let named_type = schema
+                .get_named_type(name)
+                .ok_or_else(|| APISchemaError::TypeNotFound(name.clone()))?;
+            Ok(match named_type {
+                TypeDefinition::Object(_) | TypeDefinition::Interface(_) => {
+                    let mut input_values = match ast::get_derived_from_directive(field) {
+                        // Only add `where` filter fields for object and interface fields
+                        // if they are not @derivedFrom
+                        Some(_) => vec![],
+                        // We allow filtering with `where: { other: "some-id" }` and
+                        // `where: { others: ["some-id", "other-id"] }`. In both cases,
+                        // we allow ID strings as the values to be passed to these
+                        // filters.
+                        None => field_scalar_filter_input_values(
+                            schema,
+                            field,
+                            &ScalarType::new(String::from("String")),
+                        ),
+                    };
+                    extend_with_child_filter_input_value(field, name, &mut input_values);
+                    input_values
+                }
+                TypeDefinition::Scalar(ref t) => field_scalar_filter_input_values(schema, field, t),
+                TypeDefinition::Enum(ref t) => field_enum_filter_input_values(schema, field, t),
+                _ => vec![],
+            })
+        }
+        Type::ListType(ref t) => {
+            Ok(field_list_filter_input_values(schema, field, t).unwrap_or(vec![]))
+        }
+        Type::NonNullType(ref t) => field_filter_input_values(schema, field, t),
+    }
+}
+
+/// Generates `*_filter` input values for the given scalar field.
+fn field_scalar_filter_input_values(
+    _schema: &Document,
+    field: &Field,
+    field_type: &ScalarType,
+) -> Vec<InputValue> {
+    match field_type.name.as_ref() {
+        "BigInt" => vec!["", "not", "gt", "lt", "gte", "lte", "in", "not_in"],
+        "Boolean" => vec!["", "not", "in", "not_in"],
+        "Bytes" => vec!["", "not", "in", "not_in", "contains", "not_contains"],
+        "BigDecimal" => vec!["", "not", "gt", "lt", "gte", "lte", "in", "not_in"],
+        "ID" => vec!["", "not", "gt", "lt", "gte", "lte", "in", "not_in"],
+        "Int" => vec!["", "not", "gt", "lt", "gte", "lte", "in", "not_in"],
+        "String" => vec![
+            "",
+            "not",
+            "gt",
+            "lt",
+            "gte",
+            "lte",
+            "in",
+            "not_in",
+            "contains",
+            "contains_nocase",
+            "not_contains",
+            "not_contains_nocase",
+            "starts_with",
+            "starts_with_nocase",
+            "not_starts_with",
+            "not_starts_with_nocase",
+            "ends_with",
+            "ends_with_nocase",
+            "not_ends_with",
+            "not_ends_with_nocase",
+        ],
+        _ => vec!["", "not"],
+    }
+    .into_iter()
+    .map(|filter_type| {
+        let field_type = Type::NamedType(field_type.name.to_owned());
+        let value_type = match filter_type {
+            "in" | "not_in" => Type::ListType(Box::new(Type::NonNullType(Box::new(field_type)))),
+            _ => field_type,
+        };
+        input_value(&field.name, filter_type, value_type)
+    })
+    .collect()
+}
+
+/// Appends a child filter to input values
+fn extend_with_child_filter_input_value(
+    field: &Field,
+    field_type_name: &String,
+    input_values: &mut Vec<InputValue>,
+) {
+    input_values.push(input_value(
+        &format!("{}_", field.name),
+        "",
+        Type::NamedType(format!("{}_filter", field_type_name)),
+    ));
+}
+
+/// Generates `*_filter` input values for the given enum field.
+fn field_enum_filter_input_values(
+    _schema: &Document,
+    field: &Field,
+    field_type: &EnumType,
+) -> Vec<InputValue> {
+    vec!["", "not", "in", "not_in"]
+        .into_iter()
+        .map(|filter_type| {
+            let field_type = Type::NamedType(field_type.name.to_owned());
+            let value_type = match filter_type {
+                "in" | "not_in" => {
+                    Type::ListType(Box::new(Type::NonNullType(Box::new(field_type))))
+                }
+                _ => field_type,
+            };
+            input_value(&field.name, filter_type, value_type)
+        })
+        .collect()
+}
+
+/// Generates `*_filter` input values for the given list field.
+fn field_list_filter_input_values(
+    schema: &Document,
+    field: &Field,
+    field_type: &Type,
+) -> Option<Vec<InputValue>> {
+    // Only add a filter field if the type of the field exists in the schema
+    ast::get_type_definition_from_type(schema, field_type).and_then(|typedef| {
+        // Decide what type of values can be passed to the filter. In the case
+        // one-to-many or many-to-many object or interface fields that are not
+        // derived, we allow ID strings to be passed on.
+        // Adds child filter only to object types.
+        let (input_field_type, parent_type_name) = match typedef {
+            TypeDefinition::Object(ObjectType { name, .. })
+            | TypeDefinition::Interface(InterfaceType { name, .. }) => {
+                if ast::get_derived_from_directive(field).is_some() {
+                    (None, Some(name.clone()))
+                } else {
+                    (Some(Type::NamedType("String".into())), Some(name.clone()))
+                }
+            }
+            TypeDefinition::Scalar(ref t) => (Some(Type::NamedType(t.name.to_owned())), None),
+            TypeDefinition::Enum(ref t) => (Some(Type::NamedType(t.name.to_owned())), None),
+            TypeDefinition::InputObject(_) | TypeDefinition::Union(_) => (None, None),
+        };
+
+        let mut input_values: Vec<InputValue> = match input_field_type {
+            None => {
+                vec![]
+            }
+            Some(input_field_type) => vec![
+                "",
+                "not",
+                "contains",
+                "contains_nocase",
+                "not_contains",
+                "not_contains_nocase",
+            ]
+            .into_iter()
+            .map(|filter_type| {
+                input_value(
+                    &field.name,
+                    filter_type,
+                    Type::ListType(Box::new(Type::NonNullType(Box::new(
+                        input_field_type.clone(),
+                    )))),
+                )
+            })
+            .collect(),
+        };
+
+        if let Some(parent) = parent_type_name {
+            extend_with_child_filter_input_value(field, &parent, &mut input_values);
+        }
+
+        Some(input_values)
+    })
+}
+
+/// Generates a `*_filter` input value for the given field name, suffix and value type.
+fn input_value(name: &str, suffix: &'static str, value_type: Type) -> InputValue {
+    InputValue {
+        position: Pos::default(),
+        description: None,
+        name: if suffix.is_empty() {
+            name.to_owned()
+        } else {
+            format!("{}_{}", name, suffix)
+        },
+        value_type,
+        default_value: None,
+        directives: vec![],
+    }
+}
+
+/// Adds a root `Query` object type to the schema.
+fn add_query_type(
+    schema: &mut Document,
+    object_types: &[&ObjectType],
+    interface_types: &[&InterfaceType],
+) -> Result<(), APISchemaError> {
+    let type_name = String::from("Query");
+
+    if schema.get_named_type(&type_name).is_some() {
+        return Err(APISchemaError::TypeExists(type_name));
+    }
+
+    let mut fields = object_types
+        .iter()
+        .map(|t| t.name.as_str())
+        .filter(|name| !name.eq(&SCHEMA_TYPE_NAME))
+        .chain(interface_types.iter().map(|t| t.name.as_str()))
+        .flat_map(query_fields_for_type)
+        .collect::<Vec<Field>>();
+    let mut fulltext_fields = schema
+        .get_fulltext_directives()
+        .map_err(|_| APISchemaError::FulltextSearchNonDeterministic)?
+        .iter()
+        .filter_map(|fulltext| query_field_for_fulltext(fulltext))
+        .collect();
+    fields.append(&mut fulltext_fields);
+    fields.push(meta_field());
+
+    let typedef = TypeDefinition::Object(ObjectType {
+        position: Pos::default(),
+        description: None,
+        name: type_name,
+        implements_interfaces: vec![],
+        directives: vec![],
+        fields,
+    });
+    let def = Definition::TypeDefinition(typedef);
+    schema.definitions.push(def);
+    Ok(())
+}
+
+fn query_field_for_fulltext(fulltext: &Directive) -> Option<Field> {
+    let name = fulltext.argument("name").unwrap().as_str().unwrap().into();
+
+    let includes = fulltext.argument("include").unwrap().as_list().unwrap();
+    // Only one include is allowed per fulltext directive
+    let include = includes.iter().next().unwrap();
+    let included_entity = include.as_object().unwrap();
+    let entity_name = included_entity.get("entity").unwrap().as_str().unwrap();
+
+    let mut arguments = vec![
+        // text: String
+        InputValue {
+            position: Pos::default(),
+            description: None,
+            name: String::from("text"),
+            value_type: Type::NonNullType(Box::new(Type::NamedType(String::from("String")))),
+            default_value: None,
+            directives: vec![],
+        },
+        // first: Int
+        InputValue {
+            position: Pos::default(),
+            description: None,
+            name: String::from("first"),
+            value_type: Type::NamedType(String::from("Int")),
+            default_value: Some(Value::Int(100.into())),
+            directives: vec![],
+        },
+        // skip: Int
+        InputValue {
+            position: Pos::default(),
+            description: None,
+            name: String::from("skip"),
+            value_type: Type::NamedType(String::from("Int")),
+            default_value: Some(Value::Int(0.into())),
+            directives: vec![],
+        },
+        // block: BlockHeight
+        block_argument(),
+    ];
+
+    arguments.push(subgraph_error_argument());
+
+    Some(Field {
+        position: Pos::default(),
+        description: None,
+        name,
+        arguments,
+        field_type: Type::NonNullType(Box::new(Type::ListType(Box::new(Type::NonNullType(
+            Box::new(Type::NamedType(entity_name.into())),
+        ))))), // included entity type name
+        directives: vec![fulltext.clone()],
+    })
+}
+
+/// Adds a root `Subscription` object type to the schema.
+fn add_subscription_type(
+    schema: &mut Document,
+    object_types: &[&ObjectType],
+    interface_types: &[&InterfaceType],
+) -> Result<(), APISchemaError> {
+    let type_name = String::from("Subscription");
+
+    if schema.get_named_type(&type_name).is_some() {
+        return Err(APISchemaError::TypeExists(type_name));
+    }
+
+    let mut fields: Vec<Field> = object_types
+        .iter()
+        .map(|t| &t.name)
+        .filter(|name| !name.eq(&SCHEMA_TYPE_NAME))
+        .chain(interface_types.iter().map(|t| &t.name))
+        .flat_map(|name| query_fields_for_type(name))
+        .collect();
+    fields.push(meta_field());
+
+    let typedef = TypeDefinition::Object(ObjectType {
+        position: Pos::default(),
+        description: None,
+        name: type_name,
+        implements_interfaces: vec![],
+        directives: vec![],
+        fields,
+    });
+    let def = Definition::TypeDefinition(typedef);
+    schema.definitions.push(def);
+    Ok(())
+}
+
+fn block_argument() -> InputValue {
+    InputValue {
+        position: Pos::default(),
+        description: Some(
+            "The block at which the query should be executed. \
+             Can either be a `{ hash: Bytes }` value containing a block hash, \
+             a `{ number: Int }` containing the block number, \
+             or a `{ number_gte: Int }` containing the minimum block number. \
+             In the case of `number_gte`, the query will be executed on the latest block only if \
+             the subgraph has progressed to or past the minimum block number. \
+             Defaults to the latest block when omitted."
+                .to_owned(),
+        ),
+        name: "block".to_string(),
+        value_type: Type::NamedType(BLOCK_HEIGHT.to_owned()),
+        default_value: None,
+        directives: vec![],
+    }
+}
+
+fn block_changed_filter_argument() -> InputValue {
+    InputValue {
+        position: Pos::default(),
+        description: Some("Filter for the block changed event.".to_owned()),
+        name: "_change_block".to_string(),
+        value_type: Type::NamedType(CHANGE_BLOCK_FILTER_NAME.to_owned()),
+        default_value: None,
+        directives: vec![],
+    }
+}
+
+fn subgraph_error_argument() -> InputValue {
+    InputValue {
+        position: Pos::default(),
+        description: Some(
+            "Set to `allow` to receive data even if the subgraph has skipped over errors while syncing."
+                .to_owned(),
+        ),
+        name: "subgraphError".to_string(),
+        value_type: Type::NonNullType(Box::new(Type::NamedType(ERROR_POLICY_TYPE.to_string()))),
+        default_value: Some(Value::Enum("deny".to_string())),
+        directives: vec![],
+    }
+}
+
+/// Generates `Query` fields for the given type name (e.g. `users` and `user`).
+fn query_fields_for_type(type_name: &str) -> Vec<Field> {
+    let mut collection_arguments = collection_arguments_for_named_type(type_name);
+    collection_arguments.push(block_argument());
+
+    let mut by_id_arguments = vec![
+        InputValue {
+            position: Pos::default(),
+            description: None,
+            name: "id".to_string(),
+            value_type: Type::NonNullType(Box::new(Type::NamedType("ID".to_string()))),
+            default_value: None,
+            directives: vec![],
+        },
+        block_argument(),
+    ];
+
+    collection_arguments.push(subgraph_error_argument());
+    by_id_arguments.push(subgraph_error_argument());
+
+    vec![
+        Field {
+            position: Pos::default(),
+            description: None,
+            name: type_name.to_camel_case(), // Name formatting must be updated in sync with `graph::data::schema::validate_fulltext_directive_name()`
+            arguments: by_id_arguments,
+            field_type: Type::NamedType(type_name.to_owned()),
+            directives: vec![],
+        },
+        Field {
+            position: Pos::default(),
+            description: None,
+            name: type_name.to_plural().to_camel_case(), // Name formatting must be updated in sync with `graph::data::schema::validate_fulltext_directive_name()`
+            arguments: collection_arguments,
+            field_type: Type::NonNullType(Box::new(Type::ListType(Box::new(Type::NonNullType(
+                Box::new(Type::NamedType(type_name.to_owned())),
+            ))))),
+            directives: vec![],
+        },
+    ]
+}
+
+fn meta_field() -> Field {
+    lazy_static! {
+        static ref META_FIELD: Field = Field {
+            position: Pos::default(),
+            description: Some("Access to subgraph metadata".to_string()),
+            name: META_FIELD_NAME.to_string(),
+            arguments: vec![
+                // block: BlockHeight
+                InputValue {
+                    position: Pos::default(),
+                    description: None,
+                    name: String::from("block"),
+                    value_type: Type::NamedType(BLOCK_HEIGHT.to_string()),
+                    default_value: None,
+                    directives: vec![],
+                },
+            ],
+            field_type: Type::NamedType(META_FIELD_TYPE.to_string()),
+            directives: vec![],
+        };
+    }
+    META_FIELD.clone()
+}
+
+/// Generates arguments for collection queries of a named type (e.g. User).
+fn collection_arguments_for_named_type(type_name: &str) -> Vec<InputValue> {
+    // `first` and `skip` should be non-nullable, but the Apollo graphql client
+    // exhibts non-conforming behaviour by erroing if no value is provided for a
+    // non-nullable field, regardless of the presence of a default.
+    let mut skip = input_value(&"skip".to_string(), "", Type::NamedType("Int".to_string()));
+    skip.default_value = Some(Value::Int(0.into()));
+
+    let mut first = input_value(&"first".to_string(), "", Type::NamedType("Int".to_string()));
+    first.default_value = Some(Value::Int(100.into()));
+
+    let args = vec![
+        skip,
+        first,
+        input_value(
+            &"orderBy".to_string(),
+            "",
+            Type::NamedType(format!("{}_orderBy", type_name)),
+        ),
+        input_value(
+            &"orderDirection".to_string(),
+            "",
+            Type::NamedType("OrderDirection".to_string()),
+        ),
+        input_value(
+            &"where".to_string(),
+            "",
+            Type::NamedType(format!("{}_filter", type_name)),
+        ),
+    ];
+
+    args
+}
+
+fn add_field_arguments(
+    schema: &mut Document,
+    input_schema: &Document,
+) -> Result<(), APISchemaError> {
+    // Refactor: Remove the `input_schema` argument and do a mutable iteration
+    // over the definitions in `schema`. Also the duplication between this and
+    // the loop for interfaces below.
+    for input_object_type in input_schema.get_object_type_definitions() {
+        for input_field in &input_object_type.fields {
+            if let Some(input_reference_type) =
+                ast::get_referenced_entity_type(input_schema, input_field)
+            {
+                if ast::is_list_or_non_null_list_field(input_field) {
+                    // Get corresponding object type and field in the output schema
+                    let object_type = ast::get_object_type_mut(schema, &input_object_type.name)
+                        .expect("object type from input schema is missing in API schema");
+                    let mut field = object_type
+                        .fields
+                        .iter_mut()
+                        .find(|field| field.name == input_field.name)
+                        .expect("field from input schema is missing in API schema");
+
+                    match input_reference_type {
+                        TypeDefinition::Object(ot) => {
+                            field.arguments = collection_arguments_for_named_type(&ot.name);
+                        }
+                        TypeDefinition::Interface(it) => {
+                            field.arguments = collection_arguments_for_named_type(&it.name);
+                        }
+                        _ => unreachable!(
+                            "referenced entity types can only be object or interface types"
+                        ),
+                    }
+                }
+            }
+        }
+    }
+
+    for input_interface_type in input_schema.get_interface_type_definitions() {
+        for input_field in &input_interface_type.fields {
+            if let Some(input_reference_type) =
+                ast::get_referenced_entity_type(input_schema, input_field)
+            {
+                if ast::is_list_or_non_null_list_field(input_field) {
+                    // Get corresponding interface type and field in the output schema
+                    let interface_type =
+                        ast::get_interface_type_mut(schema, &input_interface_type.name)
+                            .expect("interface type from input schema is missing in API schema");
+                    let mut field = interface_type
+                        .fields
+                        .iter_mut()
+                        .find(|field| field.name == input_field.name)
+                        .expect("field from input schema is missing in API schema");
+
+                    match input_reference_type {
+                        TypeDefinition::Object(ot) => {
+                            field.arguments = collection_arguments_for_named_type(&ot.name);
+                        }
+                        TypeDefinition::Interface(it) => {
+                            field.arguments = collection_arguments_for_named_type(&it.name);
+                        }
+                        _ => unreachable!(
+                            "referenced entity types can only be object or interface types"
+                        ),
+                    }
+                }
+            }
+        }
+    }
+
+    Ok(())
+}
+
+#[cfg(test)]
+mod tests {
+    use graph::data::graphql::DocumentExt;
+    use graphql_parser::schema::*;
+
+    use super::api_schema;
+    use crate::schema::ast;
+
+    #[test]
+    fn api_schema_contains_built_in_scalar_types() {
+        let input_schema =
+            parse_schema("type User { id: ID! }").expect("Failed to parse input schema");
+        let schema = api_schema(&input_schema).expect("Failed to derive API schema");
+
+        schema
+            .get_named_type("Boolean")
+            .expect("Boolean type is missing in API schema");
+        schema
+            .get_named_type("ID")
+            .expect("ID type is missing in API schema");
+        schema
+            .get_named_type("Int")
+            .expect("Int type is missing in API schema");
+        schema
+            .get_named_type("BigDecimal")
+            .expect("BigDecimal type is missing in API schema");
+        schema
+            .get_named_type("String")
+            .expect("String type is missing in API schema");
+    }
+
+    #[test]
+    fn api_schema_contains_order_direction_enum() {
+        let input_schema = parse_schema("type User { id: ID!, name: String! }")
+            .expect("Failed to parse input schema");
+        let schema = api_schema(&input_schema).expect("Failed to derived API schema");
+
+        let order_direction = schema
+            .get_named_type("OrderDirection")
+            .expect("OrderDirection type is missing in derived API schema");
+        let enum_type = match order_direction {
+            TypeDefinition::Enum(t) => Some(t),
+            _ => None,
+        }
+        .expect("OrderDirection type is not an enum");
+
+        let values: Vec<&str> = enum_type
+            .values
+            .iter()
+            .map(|value| value.name.as_str())
+            .collect();
+        assert_eq!(values, ["asc", "desc"]);
+    }
+
+    #[test]
+    fn api_schema_contains_query_type() {
+        let input_schema =
+            parse_schema("type User { id: ID! }").expect("Failed to parse input schema");
+        let schema = api_schema(&input_schema).expect("Failed to derive API schema");
+        schema
+            .get_named_type("Query")
+            .expect("Root Query type is missing in API schema");
+    }
+
+    #[test]
+    fn api_schema_contains_field_order_by_enum() {
+        let input_schema = parse_schema("type User { id: ID!, name: String! }")
+            .expect("Failed to parse input schema");
+        let schema = api_schema(&input_schema).expect("Failed to derived API schema");
+
+        let user_order_by = schema
+            .get_named_type("User_orderBy")
+            .expect("User_orderBy type is missing in derived API schema");
+
+        let enum_type = match user_order_by {
+            TypeDefinition::Enum(t) => Some(t),
+            _ => None,
+        }
+        .expect("User_orderBy type is not an enum");
+
+        let values: Vec<&str> = enum_type
+            .values
+            .iter()
+            .map(|value| value.name.as_str())
+            .collect();
+        assert_eq!(values, ["id", "name"]);
+    }
+
+    #[test]
+    fn api_schema_contains_object_type_filter_enum() {
+        let input_schema = parse_schema(
+            r#"
+              enum FurType {
+                  NONE
+                  FLUFFY
+                  BRISTLY
+              }
+
+              type Pet {
+                  id: ID!
+                  name: String!
+                  mostHatedBy: [User!]!
+                  mostLovedBy: [User!]!
+              }
+
+              type User {
+                  id: ID!
+                  name: String!
+                  favoritePetNames: [String!]
+                  pets: [Pet!]!
+                  favoriteFurType: FurType!
+                  favoritePet: Pet!
+                  leastFavoritePet: Pet @derivedFrom(field: "mostHatedBy")
+                  mostFavoritePets: [Pet!] @derivedFrom(field: "mostLovedBy")
+              }
+            "#,
+        )
+        .expect("Failed to parse input schema");
+        let schema = api_schema(&input_schema).expect("Failed to derived API schema");
+
+        let user_filter = schema
+            .get_named_type("User_filter")
+            .expect("User_filter type is missing in derived API schema");
+
+        let user_filter_type = match user_filter {
+            TypeDefinition::InputObject(t) => Some(t),
+            _ => None,
+        }
+        .expect("User_filter type is not an input object");
+
+        assert_eq!(
+            user_filter_type
+                .fields
+                .iter()
+                .map(|field| field.name.to_owned())
+                .collect::<Vec<String>>(),
+            [
+                "id",
+                "id_not",
+                "id_gt",
+                "id_lt",
+                "id_gte",
+                "id_lte",
+                "id_in",
+                "id_not_in",
+                "name",
+                "name_not",
+                "name_gt",
+                "name_lt",
+                "name_gte",
+                "name_lte",
+                "name_in",
+                "name_not_in",
+                "name_contains",
+                "name_contains_nocase",
+                "name_not_contains",
+                "name_not_contains_nocase",
+                "name_starts_with",
+                "name_starts_with_nocase",
+                "name_not_starts_with",
+                "name_not_starts_with_nocase",
+                "name_ends_with",
+                "name_ends_with_nocase",
+                "name_not_ends_with",
+                "name_not_ends_with_nocase",
+                "favoritePetNames",
+                "favoritePetNames_not",
+                "favoritePetNames_contains",
+                "favoritePetNames_contains_nocase",
+                "favoritePetNames_not_contains",
+                "favoritePetNames_not_contains_nocase",
+                "pets",
+                "pets_not",
+                "pets_contains",
+                "pets_contains_nocase",
+                "pets_not_contains",
+                "pets_not_contains_nocase",
+                "pets_",
+                "favoriteFurType",
+                "favoriteFurType_not",
+                "favoriteFurType_in",
+                "favoriteFurType_not_in",
+                "favoritePet",
+                "favoritePet_not",
+                "favoritePet_gt",
+                "favoritePet_lt",
+                "favoritePet_gte",
+                "favoritePet_lte",
+                "favoritePet_in",
+                "favoritePet_not_in",
+                "favoritePet_contains",
+                "favoritePet_contains_nocase",
+                "favoritePet_not_contains",
+                "favoritePet_not_contains_nocase",
+                "favoritePet_starts_with",
+                "favoritePet_starts_with_nocase",
+                "favoritePet_not_starts_with",
+                "favoritePet_not_starts_with_nocase",
+                "favoritePet_ends_with",
+                "favoritePet_ends_with_nocase",
+                "favoritePet_not_ends_with",
+                "favoritePet_not_ends_with_nocase",
+                "favoritePet_",
+                "leastFavoritePet_",
+                "mostFavoritePets_",
+                "_change_block"
+            ]
+            .iter()
+            .map(ToString::to_string)
+            .collect::<Vec<String>>()
+        );
+
+        let pets_field = user_filter_type
+            .fields
+            .iter()
+            .find(|field| field.name == "pets_")
+            .expect("pets_ field is missing");
+
+        assert_eq!(
+            pets_field.value_type.to_string(),
+            String::from("Pet_filter")
+        );
+
+        let pet_filter = schema
+            .get_named_type("Pet_filter")
+            .expect("Pet_filter type is missing in derived API schema");
+
+        let pet_filter_type = match pet_filter {
+            TypeDefinition::InputObject(t) => Some(t),
+            _ => None,
+        }
+        .expect("Pet_filter type is not an input object");
+
+        assert_eq!(
+            pet_filter_type
+                .fields
+                .iter()
+                .map(|field| field.name.to_owned())
+                .collect::<Vec<String>>(),
+            [
+                "id",
+                "id_not",
+                "id_gt",
+                "id_lt",
+                "id_gte",
+                "id_lte",
+                "id_in",
+                "id_not_in",
+                "name",
+                "name_not",
+                "name_gt",
+                "name_lt",
+                "name_gte",
+                "name_lte",
+                "name_in",
+                "name_not_in",
+                "name_contains",
+                "name_contains_nocase",
+                "name_not_contains",
+                "name_not_contains_nocase",
+                "name_starts_with",
+                "name_starts_with_nocase",
+                "name_not_starts_with",
+                "name_not_starts_with_nocase",
+                "name_ends_with",
+                "name_ends_with_nocase",
+                "name_not_ends_with",
+                "name_not_ends_with_nocase",
+                "mostHatedBy",
+                "mostHatedBy_not",
+                "mostHatedBy_contains",
+                "mostHatedBy_contains_nocase",
+                "mostHatedBy_not_contains",
+                "mostHatedBy_not_contains_nocase",
+                "mostHatedBy_",
+                "mostLovedBy",
+                "mostLovedBy_not",
+                "mostLovedBy_contains",
+                "mostLovedBy_contains_nocase",
+                "mostLovedBy_not_contains",
+                "mostLovedBy_not_contains_nocase",
+                "mostLovedBy_",
+                "_change_block"
+            ]
+            .iter()
+            .map(ToString::to_string)
+            .collect::<Vec<String>>()
+        );
+
+        let change_block_filter = user_filter_type
+            .fields
+            .iter()
+            .find(move |p| match p.name.as_str() {
+                "_change_block" => true,
+                _ => false,
+            })
+            .expect("_change_block field is missing in User_filter");
+
+        match &change_block_filter.value_type {
+            Type::NamedType(name) => assert_eq!(name.as_str(), "BlockChangedFilter"),
+            _ => panic!("_change_block field is not a named type"),
+        }
+
+        schema
+            .get_named_type("BlockChangedFilter")
+            .expect("BlockChangedFilter type is missing in derived API schema");
+    }
+
+    #[test]
+    fn api_schema_contains_object_type_with_field_interface() {
+        let input_schema = parse_schema(
+            r#"
+              interface Pet {
+                  id: ID!
+                  name: String!
+              }
+
+              type Dog implements Pet {
+                id: ID!
+                name: String!
+              }
+
+              type Cat implements Pet {
+                id: ID!
+                name: String!
+                owner: User!
+              }
+
+              type User {
+                  id: ID!
+                  name: String!
+                  pets: [Pet!]! @derivedFrom(field: "owner")
+                  favoritePet: Pet!
+              }
+            "#,
+        )
+        .expect("Failed to parse input schema");
+        let schema = api_schema(&input_schema).expect("Failed to derived API schema");
+
+        let user_filter = schema
+            .get_named_type("User_filter")
+            .expect("User_filter type is missing in derived API schema");
+
+        let user_filter_type = match user_filter {
+            TypeDefinition::InputObject(t) => Some(t),
+            _ => None,
+        }
+        .expect("User_filter type is not an input object");
+
+        assert_eq!(
+            user_filter_type
+                .fields
+                .iter()
+                .map(|field| field.name.to_owned())
+                .collect::<Vec<String>>(),
+            [
+                "id",
+                "id_not",
+                "id_gt",
+                "id_lt",
+                "id_gte",
+                "id_lte",
+                "id_in",
+                "id_not_in",
+                "name",
+                "name_not",
+                "name_gt",
+                "name_lt",
+                "name_gte",
+                "name_lte",
+                "name_in",
+                "name_not_in",
+                "name_contains",
+                "name_contains_nocase",
+                "name_not_contains",
+                "name_not_contains_nocase",
+                "name_starts_with",
+                "name_starts_with_nocase",
+                "name_not_starts_with",
+                "name_not_starts_with_nocase",
+                "name_ends_with",
+                "name_ends_with_nocase",
+                "name_not_ends_with",
+                "name_not_ends_with_nocase",
+                "pets_",
+                "favoritePet",
+                "favoritePet_not",
+                "favoritePet_gt",
+                "favoritePet_lt",
+                "favoritePet_gte",
+                "favoritePet_lte",
+                "favoritePet_in",
+                "favoritePet_not_in",
+                "favoritePet_contains",
+                "favoritePet_contains_nocase",
+                "favoritePet_not_contains",
+                "favoritePet_not_contains_nocase",
+                "favoritePet_starts_with",
+                "favoritePet_starts_with_nocase",
+                "favoritePet_not_starts_with",
+                "favoritePet_not_starts_with_nocase",
+                "favoritePet_ends_with",
+                "favoritePet_ends_with_nocase",
+                "favoritePet_not_ends_with",
+                "favoritePet_not_ends_with_nocase",
+                "favoritePet_",
+                "_change_block"
+            ]
+            .iter()
+            .map(ToString::to_string)
+            .collect::<Vec<String>>()
+        );
+
+        let change_block_filter = user_filter_type
+            .fields
+            .iter()
+            .find(move |p| match p.name.as_str() {
+                "_change_block" => true,
+                _ => false,
+            })
+            .expect("_change_block field is missing in User_filter");
+
+        match &change_block_filter.value_type {
+            Type::NamedType(name) => assert_eq!(name.as_str(), "BlockChangedFilter"),
+            _ => panic!("_change_block field is not a named type"),
+        }
+
+        schema
+            .get_named_type("BlockChangedFilter")
+            .expect("BlockChangedFilter type is missing in derived API schema");
+    }
+
+    #[test]
+    fn api_schema_contains_object_fields_on_query_type() {
+        let input_schema = parse_schema(
+            "type User { id: ID!, name: String! } type UserProfile { id: ID!, title: String! }",
+        )
+        .expect("Failed to parse input schema");
+        let schema = api_schema(&input_schema).expect("Failed to derive API schema");
+
+        let query_type = schema
+            .get_named_type("Query")
+            .expect("Query type is missing in derived API schema");
+
+        let user_singular_field = match query_type {
+            TypeDefinition::Object(t) => ast::get_field(t, &"user".to_string()),
+            _ => None,
+        }
+        .expect("\"user\" field is missing on Query type");
+
+        assert_eq!(
+            user_singular_field.field_type,
+            Type::NamedType("User".to_string())
+        );
+
+        assert_eq!(
+            user_singular_field
+                .arguments
+                .iter()
+                .map(|input_value| input_value.name.to_owned())
+                .collect::<Vec<String>>(),
+            vec![
+                "id".to_string(),
+                "block".to_string(),
+                "subgraphError".to_string()
+            ],
+        );
+
+        let user_plural_field = match query_type {
+            TypeDefinition::Object(t) => ast::get_field(t, &"users".to_string()),
+            _ => None,
+        }
+        .expect("\"users\" field is missing on Query type");
+
+        assert_eq!(
+            user_plural_field.field_type,
+            Type::NonNullType(Box::new(Type::ListType(Box::new(Type::NonNullType(
+                Box::new(Type::NamedType("User".to_string()))
+            )))))
+        );
+
+        assert_eq!(
+            user_plural_field
+                .arguments
+                .iter()
+                .map(|input_value| input_value.name.to_owned())
+                .collect::<Vec<String>>(),
+            [
+                "skip",
+                "first",
+                "orderBy",
+                "orderDirection",
+                "where",
+                "block",
+                "subgraphError",
+            ]
+            .iter()
+            .map(ToString::to_string)
+            .collect::<Vec<String>>()
+        );
+
+        let user_profile_singular_field = match query_type {
+            TypeDefinition::Object(t) => ast::get_field(t, &"userProfile".to_string()),
+            _ => None,
+        }
+        .expect("\"userProfile\" field is missing on Query type");
+
+        assert_eq!(
+            user_profile_singular_field.field_type,
+            Type::NamedType("UserProfile".to_string())
+        );
+
+        let user_profile_plural_field = match query_type {
+            TypeDefinition::Object(t) => ast::get_field(t, &"userProfiles".to_string()),
+            _ => None,
+        }
+        .expect("\"userProfiles\" field is missing on Query type");
+
+        assert_eq!(
+            user_profile_plural_field.field_type,
+            Type::NonNullType(Box::new(Type::ListType(Box::new(Type::NonNullType(
+                Box::new(Type::NamedType("UserProfile".to_string()))
+            )))))
+        );
+    }
+
+    #[test]
+    fn api_schema_contains_interface_fields_on_query_type() {
+        let input_schema = parse_schema(
+            "
+            interface Node { id: ID!, name: String! }
+            type User implements Node { id: ID!, name: String!, email: String }
+            ",
+        )
+        .expect("Failed to parse input schema");
+        let schema = api_schema(&input_schema).expect("Failed to derived API schema");
+
+        let query_type = schema
+            .get_named_type("Query")
+            .expect("Query type is missing in derived API schema");
+
+        let singular_field = match query_type {
+            TypeDefinition::Object(ref t) => ast::get_field(t, &"node".to_string()),
+            _ => None,
+        }
+        .expect("\"node\" field is missing on Query type");
+
+        assert_eq!(
+            singular_field.field_type,
+            Type::NamedType("Node".to_string())
+        );
+
+        assert_eq!(
+            singular_field
+                .arguments
+                .iter()
+                .map(|input_value| input_value.name.to_owned())
+                .collect::<Vec<String>>(),
+            vec![
+                "id".to_string(),
+                "block".to_string(),
+                "subgraphError".to_string()
+            ],
+        );
+
+        let plural_field = match query_type {
+            TypeDefinition::Object(ref t) => ast::get_field(t, &"nodes".to_string()),
+            _ => None,
+        }
+        .expect("\"nodes\" field is missing on Query type");
+
+        assert_eq!(
+            plural_field.field_type,
+            Type::NonNullType(Box::new(Type::ListType(Box::new(Type::NonNullType(
+                Box::new(Type::NamedType("Node".to_string()))
+            )))))
+        );
+
+        assert_eq!(
+            plural_field
+                .arguments
+                .iter()
+                .map(|input_value| input_value.name.to_owned())
+                .collect::<Vec<String>>(),
+            [
+                "skip",
+                "first",
+                "orderBy",
+                "orderDirection",
+                "where",
+                "block",
+                "subgraphError"
+            ]
+            .iter()
+            .map(ToString::to_string)
+            .collect::<Vec<String>>()
+        );
+    }
+
+    #[test]
+    fn api_schema_contains_fulltext_query_field_on_query_type() {
+        const SCHEMA: &str = r#"
+type _Schema_ @fulltext(
+  name: "metadata"
+  language: en
+  algorithm: rank
+  include: [
+    {
+      entity: "Gravatar",
+      fields: [
+        { name: "displayName"},
+        { name: "imageUrl"},
+      ]
+    }
+  ]
+)
+type Gravatar @entity {
+  id: ID!
+  owner: Bytes!
+  displayName: String!
+  imageUrl: String!
+}
+"#;
+        let input_schema = parse_schema(SCHEMA).expect("Failed to parse input schema");
+        let schema = api_schema(&input_schema).expect("Failed to derive API schema");
+
+        let query_type = schema
+            .get_named_type("Query")
+            .expect("Query type is missing in derived API schema");
+
+        let _metadata_field = match query_type {
+            TypeDefinition::Object(t) => ast::get_field(t, &String::from("metadata")),
+            _ => None,
+        }
+        .expect("\"metadata\" field is missing on Query type");
+    }
+}
diff --git a/graphql/src/schema/ast.rs b/graphql/src/schema/ast.rs
new file mode 100644
index 0000000..6460f24
--- /dev/null
+++ b/graphql/src/schema/ast.rs
@@ -0,0 +1,511 @@
+use graph::cheap_clone::CheapClone;
+use graphql_parser::Pos;
+use lazy_static::lazy_static;
+use std::ops::Deref;
+use std::str::FromStr;
+use std::sync::Arc;
+
+use graph::data::graphql::ext::DirectiveFinder;
+use graph::data::graphql::{DocumentExt, ObjectOrInterface};
+use graph::prelude::anyhow::anyhow;
+use graph::prelude::{s, Error, ValueType};
+
+use crate::query::ast as qast;
+
+pub(crate) enum FilterOp {
+    Not,
+    GreaterThan,
+    LessThan,
+    GreaterOrEqual,
+    LessOrEqual,
+    In,
+    NotIn,
+    Contains,
+    ContainsNoCase,
+    NotContains,
+    NotContainsNoCase,
+    StartsWith,
+    StartsWithNoCase,
+    NotStartsWith,
+    NotStartsWithNoCase,
+    EndsWith,
+    EndsWithNoCase,
+    NotEndsWith,
+    NotEndsWithNoCase,
+    Equal,
+    Child,
+}
+
+/// Split a "name_eq" style name into an attribute ("name") and a filter op (`Equal`).
+pub(crate) fn parse_field_as_filter(key: &str) -> (String, FilterOp) {
+    let (suffix, op) = match key {
+        k if k.ends_with("_not") => ("_not", FilterOp::Not),
+        k if k.ends_with("_gt") => ("_gt", FilterOp::GreaterThan),
+        k if k.ends_with("_lt") => ("_lt", FilterOp::LessThan),
+        k if k.ends_with("_gte") => ("_gte", FilterOp::GreaterOrEqual),
+        k if k.ends_with("_lte") => ("_lte", FilterOp::LessOrEqual),
+        k if k.ends_with("_not_in") => ("_not_in", FilterOp::NotIn),
+        k if k.ends_with("_in") => ("_in", FilterOp::In),
+        k if k.ends_with("_not_contains") => ("_not_contains", FilterOp::NotContains),
+        k if k.ends_with("_not_contains_nocase") => {
+            ("_not_contains_nocase", FilterOp::NotContainsNoCase)
+        }
+        k if k.ends_with("_contains") => ("_contains", FilterOp::Contains),
+        k if k.ends_with("_contains_nocase") => ("_contains_nocase", FilterOp::ContainsNoCase),
+        k if k.ends_with("_not_starts_with") => ("_not_starts_with", FilterOp::NotStartsWith),
+        k if k.ends_with("_not_starts_with_nocase") => {
+            ("_not_starts_with_nocase", FilterOp::NotStartsWithNoCase)
+        }
+        k if k.ends_with("_not_ends_with") => ("_not_ends_with", FilterOp::NotEndsWith),
+        k if k.ends_with("_not_ends_with_nocase") => {
+            ("_not_ends_with_nocase", FilterOp::NotEndsWithNoCase)
+        }
+        k if k.ends_with("_starts_with") => ("_starts_with", FilterOp::StartsWith),
+        k if k.ends_with("_starts_with_nocase") => {
+            ("_starts_with_nocase", FilterOp::StartsWithNoCase)
+        }
+        k if k.ends_with("_ends_with") => ("_ends_with", FilterOp::EndsWith),
+        k if k.ends_with("_ends_with_nocase") => ("_ends_with_nocase", FilterOp::EndsWithNoCase),
+        k if k.ends_with("_") => ("_", FilterOp::Child),
+        _ => ("", FilterOp::Equal),
+    };
+
+    // Strip the operator suffix to get the attribute.
+    (key.trim_end_matches(suffix).to_owned(), op)
+}
+
+/// An `ObjectType` with `Hash` and `Eq` derived from the name.
+#[derive(Clone, Debug)]
+pub struct ObjectType(Arc<s::ObjectType>);
+
+impl Ord for ObjectType {
+    fn cmp(&self, other: &Self) -> std::cmp::Ordering {
+        self.0.name.cmp(&other.0.name)
+    }
+}
+
+impl PartialOrd for ObjectType {
+    fn partial_cmp(&self, other: &Self) -> Option<std::cmp::Ordering> {
+        Some(self.0.name.cmp(&other.0.name))
+    }
+}
+
+impl std::hash::Hash for ObjectType {
+    fn hash<H: std::hash::Hasher>(&self, state: &mut H) {
+        self.0.name.hash(state)
+    }
+}
+
+impl PartialEq for ObjectType {
+    fn eq(&self, other: &Self) -> bool {
+        self.0.name.eq(&other.0.name)
+    }
+}
+
+impl Eq for ObjectType {}
+
+impl From<Arc<s::ObjectType>> for ObjectType {
+    fn from(object: Arc<s::ObjectType>) -> Self {
+        ObjectType(object)
+    }
+}
+
+impl<'a> From<&'a ObjectType> for ObjectOrInterface<'a> {
+    fn from(cond: &'a ObjectType) -> Self {
+        ObjectOrInterface::Object(cond.0.as_ref())
+    }
+}
+
+impl Deref for ObjectType {
+    type Target = s::ObjectType;
+
+    fn deref(&self) -> &Self::Target {
+        &self.0
+    }
+}
+
+impl CheapClone for ObjectType {}
+
+impl ObjectType {
+    pub fn name(&self) -> &str {
+        &self.0.name
+    }
+}
+
+/// Returns all type definitions in the schema.
+pub fn get_type_definitions(schema: &s::Document) -> Vec<&s::TypeDefinition> {
+    schema
+        .definitions
+        .iter()
+        .filter_map(|d| match d {
+            s::Definition::TypeDefinition(typedef) => Some(typedef),
+            _ => None,
+        })
+        .collect()
+}
+
+/// Returns the object type with the given name.
+pub fn get_object_type_mut<'a>(
+    schema: &'a mut s::Document,
+    name: &str,
+) -> Option<&'a mut s::ObjectType> {
+    use graphql_parser::schema::TypeDefinition::*;
+
+    get_named_type_definition_mut(schema, name).and_then(|type_def| match type_def {
+        Object(object_type) => Some(object_type),
+        _ => None,
+    })
+}
+
+/// Returns the interface type with the given name.
+pub fn get_interface_type_mut<'a>(
+    schema: &'a mut s::Document,
+    name: &str,
+) -> Option<&'a mut s::InterfaceType> {
+    use graphql_parser::schema::TypeDefinition::*;
+
+    get_named_type_definition_mut(schema, name).and_then(|type_def| match type_def {
+        Interface(interface_type) => Some(interface_type),
+        _ => None,
+    })
+}
+
+/// Returns the type of a field of an object type.
+pub fn get_field<'a>(
+    object_type: impl Into<ObjectOrInterface<'a>>,
+    name: &str,
+) -> Option<&'a s::Field> {
+    lazy_static! {
+        pub static ref TYPENAME_FIELD: s::Field = s::Field {
+            position: Pos::default(),
+            description: None,
+            name: "__typename".to_owned(),
+            field_type: s::Type::NonNullType(Box::new(s::Type::NamedType("String".to_owned()))),
+            arguments: vec![],
+            directives: vec![],
+        };
+    }
+
+    if name == TYPENAME_FIELD.name {
+        Some(&TYPENAME_FIELD)
+    } else {
+        object_type
+            .into()
+            .fields()
+            .iter()
+            .find(|field| field.name == name)
+    }
+}
+
+/// Returns the value type for a GraphQL field type.
+pub fn get_field_value_type(field_type: &s::Type) -> Result<ValueType, Error> {
+    match field_type {
+        s::Type::NamedType(ref name) => ValueType::from_str(&name),
+        s::Type::NonNullType(inner) => get_field_value_type(&inner),
+        s::Type::ListType(_) => Err(anyhow!("Only scalar values are supported in this context")),
+    }
+}
+
+/// Returns the value type for a GraphQL field type.
+pub fn get_field_name(field_type: &s::Type) -> String {
+    match field_type {
+        s::Type::NamedType(name) => name.to_string(),
+        s::Type::NonNullType(inner) => get_field_name(inner),
+        s::Type::ListType(inner) => get_field_name(inner),
+    }
+}
+
+/// Returns a mutable version of the type with the given name.
+fn get_named_type_definition_mut<'a>(
+    schema: &'a mut s::Document,
+    name: &str,
+) -> Option<&'a mut s::TypeDefinition> {
+    schema
+        .definitions
+        .iter_mut()
+        .filter_map(|def| match def {
+            s::Definition::TypeDefinition(typedef) => Some(typedef),
+            _ => None,
+        })
+        .find(|typedef| get_type_name(typedef) == name)
+}
+
+/// Returns the name of a type.
+pub fn get_type_name(t: &s::TypeDefinition) -> &str {
+    match t {
+        s::TypeDefinition::Enum(t) => &t.name,
+        s::TypeDefinition::InputObject(t) => &t.name,
+        s::TypeDefinition::Interface(t) => &t.name,
+        s::TypeDefinition::Object(t) => &t.name,
+        s::TypeDefinition::Scalar(t) => &t.name,
+        s::TypeDefinition::Union(t) => &t.name,
+    }
+}
+
+/// Returns the argument definitions for a field of an object type.
+pub fn get_argument_definitions<'a>(
+    object_type: impl Into<ObjectOrInterface<'a>>,
+    name: &str,
+) -> Option<&'a Vec<s::InputValue>> {
+    lazy_static! {
+        pub static ref NAME_ARGUMENT: Vec<s::InputValue> = vec![s::InputValue {
+            position: Pos::default(),
+            description: None,
+            name: "name".to_owned(),
+            value_type: s::Type::NonNullType(Box::new(s::Type::NamedType("String".to_owned()))),
+            default_value: None,
+            directives: vec![],
+        }];
+    }
+
+    // Introspection: `__type(name: String!): __Type`
+    if name == "__type" {
+        Some(&NAME_ARGUMENT)
+    } else {
+        get_field(object_type, name).map(|field| &field.arguments)
+    }
+}
+
+/// Returns the type definition for a type.
+pub fn get_type_definition_from_type<'a>(
+    schema: &'a s::Document,
+    t: &s::Type,
+) -> Option<&'a s::TypeDefinition> {
+    match t {
+        s::Type::NamedType(name) => schema.get_named_type(name),
+        s::Type::ListType(inner) => get_type_definition_from_type(schema, inner),
+        s::Type::NonNullType(inner) => get_type_definition_from_type(schema, inner),
+    }
+}
+
+/// Looks up a directive in a object type, if it is provided.
+pub fn get_object_type_directive(
+    object_type: &s::ObjectType,
+    name: String,
+) -> Option<&s::Directive> {
+    object_type
+        .directives
+        .iter()
+        .find(|directive| directive.name == name)
+}
+
+// Returns true if the given type is a non-null type.
+pub fn is_non_null_type(t: &s::Type) -> bool {
+    match t {
+        s::Type::NonNullType(_) => true,
+        _ => false,
+    }
+}
+
+/// Returns true if the given type is an input type.
+///
+/// Uses the algorithm outlined on
+/// https://facebook.github.io/graphql/draft/#IsInputType().
+pub fn is_input_type(schema: &s::Document, t: &s::Type) -> bool {
+    match t {
+        s::Type::NamedType(name) => {
+            let named_type = schema.get_named_type(name);
+            named_type.map_or(false, |type_def| match type_def {
+                s::TypeDefinition::Scalar(_)
+                | s::TypeDefinition::Enum(_)
+                | s::TypeDefinition::InputObject(_) => true,
+                _ => false,
+            })
+        }
+        s::Type::ListType(inner) => is_input_type(schema, inner),
+        s::Type::NonNullType(inner) => is_input_type(schema, inner),
+    }
+}
+
+pub fn is_entity_type(schema: &s::Document, t: &s::Type) -> bool {
+    match t {
+        s::Type::NamedType(name) => schema
+            .get_named_type(name)
+            .map_or(false, is_entity_type_definition),
+        s::Type::ListType(inner_type) => is_entity_type(schema, inner_type),
+        s::Type::NonNullType(inner_type) => is_entity_type(schema, inner_type),
+    }
+}
+
+pub fn is_entity_type_definition(type_def: &s::TypeDefinition) -> bool {
+    match type_def {
+        // Entity types are obvious
+        s::TypeDefinition::Object(object_type) => {
+            get_object_type_directive(object_type, String::from("entity")).is_some()
+        }
+
+        // For now, we'll assume that only entities can implement interfaces;
+        // thus, any interface type definition is automatically an entity type
+        s::TypeDefinition::Interface(_) => true,
+
+        // Everything else (unions, scalars, enums) are not considered entity
+        // types for now
+        _ => false,
+    }
+}
+
+pub fn is_list_or_non_null_list_field(field: &s::Field) -> bool {
+    match &field.field_type {
+        s::Type::ListType(_) => true,
+        s::Type::NonNullType(inner_type) => match inner_type.deref() {
+            s::Type::ListType(_) => true,
+            _ => false,
+        },
+        _ => false,
+    }
+}
+
+fn unpack_type<'a>(schema: &'a s::Document, t: &s::Type) -> Option<&'a s::TypeDefinition> {
+    match t {
+        s::Type::NamedType(name) => schema.get_named_type(name),
+        s::Type::ListType(inner_type) => unpack_type(schema, inner_type),
+        s::Type::NonNullType(inner_type) => unpack_type(schema, inner_type),
+    }
+}
+
+pub fn get_referenced_entity_type<'a>(
+    schema: &'a s::Document,
+    field: &s::Field,
+) -> Option<&'a s::TypeDefinition> {
+    unpack_type(schema, &field.field_type).filter(|ty| is_entity_type_definition(ty))
+}
+
+/// If the field has a `@derivedFrom(field: "foo")` directive, obtain the
+/// name of the field (e.g. `"foo"`)
+pub fn get_derived_from_directive(field_definition: &s::Field) -> Option<&s::Directive> {
+    field_definition.find_directive("derivedFrom")
+}
+
+pub fn get_derived_from_field<'a>(
+    object_type: impl Into<ObjectOrInterface<'a>>,
+    field_definition: &'a s::Field,
+) -> Option<&'a s::Field> {
+    get_derived_from_directive(field_definition)
+        .and_then(|directive| qast::get_argument_value(&directive.arguments, "field"))
+        .and_then(|value| match value {
+            s::Value::String(s) => Some(s),
+            _ => None,
+        })
+        .and_then(|derived_from_field_name| get_field(object_type, derived_from_field_name))
+}
+
+pub fn is_list(field_type: &s::Type) -> bool {
+    match field_type {
+        s::Type::NamedType(_) => false,
+        s::Type::NonNullType(inner) => is_list(inner),
+        s::Type::ListType(_) => true,
+    }
+}
+
+#[test]
+fn entity_validation() {
+    use graph::components::store::EntityKey;
+    use graph::data::store;
+    use graph::prelude::{DeploymentHash, Entity};
+
+    fn make_thing(name: &str) -> Entity {
+        let mut thing = Entity::new();
+        thing.set("id", name);
+        thing.set("name", name);
+        thing.set("stuff", "less");
+        thing.set("favorite_color", "red");
+        thing.set("things", store::Value::List(vec![]));
+        thing
+    }
+
+    fn check(thing: Entity, errmsg: &str) {
+        const DOCUMENT: &str = "
+      enum Color { red, yellow, blue }
+      interface Stuff { id: ID!, name: String! }
+      type Cruft @entity {
+          id: ID!,
+          thing: Thing!
+      }
+      type Thing @entity {
+          id: ID!,
+          name: String!,
+          favorite_color: Color,
+          stuff: Stuff,
+          things: [Thing!]!
+          # Make sure we do not validate derived fields; it's ok
+          # to store a thing with a null Cruft
+          cruft: Cruft! @derivedFrom(field: \"thing\")
+      }";
+        let subgraph = DeploymentHash::new("doesntmatter").unwrap();
+        let schema =
+            graph::prelude::Schema::parse(DOCUMENT, subgraph).expect("Failed to parse test schema");
+        let id = thing.id().unwrap_or("none".to_owned());
+        let key = EntityKey::data("Thing".to_owned(), id.clone());
+
+        let err = thing.validate(&schema, &key);
+        if errmsg == "" {
+            assert!(
+                err.is_ok(),
+                "checking entity {}: expected ok but got {}",
+                id,
+                err.unwrap_err()
+            );
+        } else {
+            if let Err(e) = err {
+                assert_eq!(errmsg, e.to_string(), "checking entity {}", id);
+            } else {
+                panic!(
+                    "Expected error `{}` but got ok when checking entity {}",
+                    errmsg, id
+                );
+            }
+        }
+    }
+
+    let mut thing = make_thing("t1");
+    thing.set("things", store::Value::from(vec!["thing1", "thing2"]));
+    check(thing, "");
+
+    let thing = make_thing("t2");
+    check(thing, "");
+
+    let mut thing = make_thing("t3");
+    thing.remove("name");
+    check(
+        thing,
+        "Entity Thing[t3]: missing value for non-nullable field `name`",
+    );
+
+    let mut thing = make_thing("t4");
+    thing.remove("things");
+    check(
+        thing,
+        "Entity Thing[t4]: missing value for non-nullable field `things`",
+    );
+
+    let mut thing = make_thing("t5");
+    thing.set("name", store::Value::Int(32));
+    check(
+        thing,
+        "Entity Thing[t5]: the value `32` for field `name` must \
+         have type String! but has type Int",
+    );
+
+    let mut thing = make_thing("t6");
+    thing.set(
+        "things",
+        store::Value::List(vec!["thing1".into(), 17.into()]),
+    );
+    check(
+        thing,
+        "Entity Thing[t6]: field `things` is of type [Thing!]!, \
+         but the value `[thing1, 17]` contains a Int at index 1",
+    );
+
+    let mut thing = make_thing("t7");
+    thing.remove("favorite_color");
+    thing.remove("stuff");
+    check(thing, "");
+
+    let mut thing = make_thing("t8");
+    thing.set("cruft", "wat");
+    check(
+        thing,
+        "Entity Thing[t8]: field `cruft` is derived and can not be set",
+    );
+}
diff --git a/graphql/src/schema/meta.graphql b/graphql/src/schema/meta.graphql
new file mode 100644
index 0000000..b2b5ffd
--- /dev/null
+++ b/graphql/src/schema/meta.graphql
@@ -0,0 +1,89 @@
+# GraphQL core functionality
+scalar Boolean
+scalar ID
+scalar Int
+scalar Float
+scalar String
+
+directive @skip(if: Boolean!) on FIELD | FRAGMENT_SPREAD | INLINE_FRAGMENT
+directive @include(if: Boolean!) on FIELD | FRAGMENT_SPREAD | INLINE_FRAGMENT
+
+# The Graph extensions
+
+"Marks the GraphQL type as indexable entity.  Each type that should be an entity is required to be annotated with this directive."
+directive @entity on OBJECT
+
+"Defined a Subgraph ID for an object type"
+directive @subgraphId(id: String!) on OBJECT
+
+"creates a virtual field on the entity that may be queried but cannot be set manually through the mappings API."
+directive @derivedFrom(field: String!) on FIELD_DEFINITION
+
+scalar BigDecimal
+scalar Bytes
+scalar BigInt
+
+# The type names are purposely awkward to minimize the risk of them
+# colliding with user-supplied types
+"The type for the top-level _meta field"
+type _Meta_ {
+  """
+  Information about a specific subgraph block. The hash of the block
+  will be null if the _meta field has a block constraint that asks for
+  a block number. It will be filled if the _meta field has no block constraint
+  and therefore asks for the latest  block
+  """
+  block: _Block_!
+  "The deployment ID"
+  deployment: String!
+  "If `true`, the subgraph encountered indexing errors at some past block"
+  hasIndexingErrors: Boolean!
+}
+
+input BlockChangedFilter {
+  number_gte: Int!
+}
+
+input Block_height {
+  hash: Bytes
+  number: Int
+  number_gte: Int
+}
+
+type _Block_ {
+  "The hash of the block"
+  hash: Bytes
+  "The block number"
+  number: Int!
+  "Integer representation of the timestamp stored in blocks for the chain" 
+  timestamp: Int
+}
+
+enum _SubgraphErrorPolicy_ {
+  "Data will be returned even if the subgraph has indexing errors"
+  allow,
+
+  "If the subgraph has indexing errors, data will be omitted. The default."
+  deny
+}
+
+"The block at which the query should be executed."
+input Block_height {
+  "Value containing a block hash"
+  hash: Bytes
+  "Value containing a block number"
+  number: Int
+  """
+  Value containing the minimum block number. 
+  In the case of `number_gte`, the query will be executed on the latest block only if
+  the subgraph has progressed to or past the minimum block number.
+  Defaults to the latest block when omitted.
+  """
+  number_gte: Int
+}
+
+"Defines the order direction, either ascending or descending"
+enum OrderDirection {
+  asc
+  desc
+}
\ No newline at end of file
diff --git a/graphql/src/schema/mod.rs b/graphql/src/schema/mod.rs
new file mode 100644
index 0000000..6df5190
--- /dev/null
+++ b/graphql/src/schema/mod.rs
@@ -0,0 +1,7 @@
+/// Generate full-fledged API schemas from existing GraphQL schemas.
+pub mod api;
+
+/// Utilities for working with GraphQL schema ASTs.
+pub mod ast;
+
+pub use self::api::{api_schema, APISchemaError};
diff --git a/graphql/src/store/mod.rs b/graphql/src/store/mod.rs
new file mode 100644
index 0000000..85ceb42
--- /dev/null
+++ b/graphql/src/store/mod.rs
@@ -0,0 +1,6 @@
+mod prefetch;
+mod query;
+mod resolver;
+
+pub use self::query::parse_subgraph_id;
+pub use self::resolver::StoreResolver;
diff --git a/graphql/src/store/prefetch.rs b/graphql/src/store/prefetch.rs
new file mode 100644
index 0000000..e480181
--- /dev/null
+++ b/graphql/src/store/prefetch.rs
@@ -0,0 +1,777 @@
+//! Run a GraphQL query and fetch all the entitied needed to build the
+//! final result
+
+use anyhow::{anyhow, Error};
+use graph::constraint_violation;
+use graph::data::query::Trace;
+use graph::data::value::{Object, Word};
+use graph::prelude::{r, CacheWeight};
+use graph::slog::warn;
+use graph::util::cache_weight;
+use lazy_static::lazy_static;
+use std::collections::BTreeMap;
+use std::rc::Rc;
+use std::time::Instant;
+
+use graph::{components::store::EntityType, data::graphql::*};
+use graph::{
+    data::graphql::ext::DirectiveFinder,
+    prelude::{
+        s, ApiSchema, AttributeNames, BlockNumber, ChildMultiplicity, EntityCollection,
+        EntityFilter, EntityLink, EntityOrder, EntityWindow, Logger, ParentLink,
+        QueryExecutionError, QueryStore, StoreError, Value as StoreValue, WindowAttribute,
+        ENV_VARS,
+    },
+};
+
+use crate::execution::{ast as a, ExecutionContext, Resolver};
+use crate::metrics::GraphQLMetrics;
+use crate::schema::ast as sast;
+use crate::store::query::build_query;
+use crate::store::StoreResolver;
+
+lazy_static! {
+    static ref ARG_FIRST: String = String::from("first");
+    static ref ARG_SKIP: String = String::from("skip");
+    static ref ARG_ID: String = String::from("id");
+}
+
+/// Intermediate data structure to hold the results of prefetching entities
+/// and their nested associations. For each association of `entity`, `children`
+/// has an entry mapping the response key to the list of nodes.
+#[derive(Debug, Clone)]
+struct Node {
+    /// Estimate the size of the children using their `CacheWeight`. This
+    /// field will have the cache weight of the `entity` plus the weight of
+    /// the keys and values of the `children` map, but not of the map itself
+    children_weight: usize,
+
+    entity: BTreeMap<Word, r::Value>,
+    /// We are using an `Rc` here for two reasons: it allows us to defer
+    /// copying objects until the end, when converting to `q::Value` forces
+    /// us to copy any child that is referenced by multiple parents. It also
+    /// makes it possible to avoid unnecessary copying of a child that is
+    /// referenced by only one parent - without the `Rc` we would have to
+    /// copy since we do not know that only one parent uses it.
+    ///
+    /// Multiple parents can reference a single child in the following
+    /// situation: assume a GraphQL query `balances { token { issuer {id}}}`
+    /// where `balances` stores the `id` of the `token`, and `token` stores
+    /// the `id` of its `issuer`. Execution of the query when all `balances`
+    /// reference the same `token` will happen through several invocations
+    /// of `fetch`. For the purposes of this comment, we can think of
+    /// `fetch` as taking a list of `(parent_id, child_id)` pairs and
+    /// returning entities that are identified by this pair, i.e., there
+    /// will be one entity for each unique `(parent_id, child_id)`
+    /// combination, rather than one for each unique `child_id`. In reality,
+    /// of course, we will usually not know the `child_id` yet until we
+    /// actually run the query.
+    ///
+    /// Query execution works as follows:
+    /// 1. Fetch all `balances`, returning `#b` `Balance` entities. The
+    ///    `Balance.token` field will be the same for all these entities.
+    /// 2. Fetch `#b` `Token` entities, identified through `(Balance.id,
+    ///    Balance.token)` resulting in one `Token` entity
+    /// 3. Fetch 1 `Issuer` entity, identified through `(Token.id,
+    ///    Token.issuer)`
+    /// 4. Glue all these results together into a DAG through invocations of
+    ///    `Join::perform`
+    ///
+    /// We now have `#b` `Node` instances representing the same `Token`, but
+    /// each the child of a different `Node` for the `#b` balances. Each of
+    /// those `#b` `Token` nodes points to the same `Issuer` node. It's
+    /// important to note that the issuer node could itself be the root of a
+    /// large tree and could therefore take up a lot of memory. When we
+    /// convert this DAG into `q::Value`, we need to make `#b` copies of the
+    /// `Issuer` node. Using an `Rc` in `Node` allows us to defer these
+    /// copies to the point where we need to convert to `q::Value`, and it
+    /// would be desirable to base the data structure that GraphQL execution
+    /// uses on a DAG rather than a tree, but that's a good amount of work
+    children: BTreeMap<Word, Vec<Rc<Node>>>,
+}
+
+impl From<BTreeMap<Word, r::Value>> for Node {
+    fn from(entity: BTreeMap<Word, r::Value>) -> Self {
+        Node {
+            children_weight: entity.weight(),
+            entity,
+            children: BTreeMap::default(),
+        }
+    }
+}
+
+impl CacheWeight for Node {
+    fn indirect_weight(&self) -> usize {
+        self.children_weight + cache_weight::btree::node_size(&self.children)
+    }
+}
+
+/// Convert a list of nodes into a `q::Value::List` where each node has also
+/// been converted to a `q::Value`
+fn node_list_as_value(nodes: Vec<Rc<Node>>) -> r::Value {
+    r::Value::List(
+        nodes
+            .into_iter()
+            .map(|node| Rc::try_unwrap(node).unwrap_or_else(|rc| rc.as_ref().clone()))
+            .map(Into::into)
+            .collect(),
+    )
+}
+
+/// We pass the root node of the result around as a vec of nodes, not as
+/// a single node so that we can use the same functions on interior node
+/// lists which are the result of querying the database. The root list
+/// consists of exactly one entry, and that entry has an empty
+/// (not even a `__typename`) entity.
+///
+/// That distinguishes it from both the result of a query that matches
+/// nothing (an empty `Vec`), and a result that finds just one entity
+/// (the entity is not completely empty)
+fn is_root_node<'a>(mut nodes: impl Iterator<Item = &'a Node>) -> bool {
+    if let Some(node) = nodes.next() {
+        node.entity.is_empty()
+    } else {
+        false
+    }
+}
+
+fn make_root_node() -> Vec<Node> {
+    let entity = BTreeMap::new();
+    vec![Node {
+        children_weight: entity.weight(),
+        entity,
+        children: BTreeMap::default(),
+    }]
+}
+
+/// Recursively convert a `Node` into the corresponding `q::Value`, which is
+/// always a `q::Value::Object`. The entity's associations are mapped to
+/// entries `r:{response_key}` as that name is guaranteed to not conflict
+/// with any field of the entity.
+impl From<Node> for r::Value {
+    fn from(node: Node) -> Self {
+        let mut map = node.entity;
+        for (key, nodes) in node.children.into_iter() {
+            map.insert(
+                format!("prefetch:{}", key).into(),
+                node_list_as_value(nodes),
+            );
+        }
+        r::Value::object(map)
+    }
+}
+
+trait ValueExt {
+    fn as_str(&self) -> Option<&str>;
+}
+
+impl ValueExt for r::Value {
+    fn as_str(&self) -> Option<&str> {
+        match self {
+            r::Value::String(s) => Some(s),
+            _ => None,
+        }
+    }
+}
+
+impl Node {
+    fn id(&self) -> Result<String, Error> {
+        match self.get("id") {
+            None => Err(anyhow!("Entity is missing an `id` attribute")),
+            Some(r::Value::String(s)) => Ok(s.to_owned()),
+            _ => Err(anyhow!("Entity has non-string `id` attribute")),
+        }
+    }
+
+    fn get(&self, key: &str) -> Option<&r::Value> {
+        self.entity.get(&key.into())
+    }
+
+    fn typename(&self) -> &str {
+        self.get("__typename")
+            .expect("all entities have a __typename")
+            .as_str()
+            .expect("__typename must be a string")
+    }
+
+    fn set_children(&mut self, response_key: String, nodes: Vec<Rc<Node>>) {
+        fn nodes_weight(nodes: &Vec<Rc<Node>>) -> usize {
+            let vec_weight = nodes.capacity() * std::mem::size_of::<Rc<Node>>();
+            let children_weight = nodes.iter().map(|node| node.weight()).sum::<usize>();
+            vec_weight + children_weight
+        }
+
+        let key_weight = response_key.weight();
+
+        self.children_weight += nodes_weight(&nodes) + key_weight;
+        let old = self.children.insert(response_key.into(), nodes);
+        if let Some(old) = old {
+            self.children_weight -= nodes_weight(&old) + key_weight;
+        }
+    }
+}
+
+/// Describe a field that we join on. The distinction between scalar and
+/// list is important for generating the right filter, and handling results
+/// correctly
+#[derive(Debug)]
+enum JoinField<'a> {
+    List(&'a str),
+    Scalar(&'a str),
+}
+
+impl<'a> JoinField<'a> {
+    fn new(field: &'a s::Field) -> Self {
+        let name = field.name.as_str();
+        if sast::is_list_or_non_null_list_field(field) {
+            JoinField::List(name)
+        } else {
+            JoinField::Scalar(name)
+        }
+    }
+
+    fn window_attribute(&self) -> WindowAttribute {
+        match self {
+            JoinField::Scalar(name) => WindowAttribute::Scalar(name.to_string()),
+            JoinField::List(name) => WindowAttribute::List(name.to_string()),
+        }
+    }
+}
+
+#[derive(Debug)]
+enum JoinRelation<'a> {
+    // Name of field in which child stores parent ids
+    Direct(JoinField<'a>),
+    // Name of the field in the parent type containing child ids
+    Derived(JoinField<'a>),
+}
+
+#[derive(Debug)]
+struct JoinCond<'a> {
+    /// The (concrete) object type of the parent, interfaces will have
+    /// one `JoinCond` for each implementing type
+    parent_type: EntityType,
+    /// The (concrete) object type of the child, interfaces will have
+    /// one `JoinCond` for each implementing type
+    child_type: EntityType,
+    relation: JoinRelation<'a>,
+}
+
+impl<'a> JoinCond<'a> {
+    fn new(
+        parent_type: &'a s::ObjectType,
+        child_type: &'a s::ObjectType,
+        field_name: &str,
+    ) -> Self {
+        let field = parent_type
+            .field(field_name)
+            .expect("field_name is a valid field of parent_type");
+        let relation =
+            if let Some(derived_from_field) = sast::get_derived_from_field(child_type, field) {
+                JoinRelation::Direct(JoinField::new(derived_from_field))
+            } else {
+                JoinRelation::Derived(JoinField::new(field))
+            };
+        JoinCond {
+            parent_type: parent_type.into(),
+            child_type: child_type.into(),
+            relation,
+        }
+    }
+
+    fn entity_link(
+        &self,
+        parents_by_id: Vec<(String, &Node)>,
+        multiplicity: ChildMultiplicity,
+    ) -> (Vec<String>, EntityLink) {
+        match &self.relation {
+            JoinRelation::Direct(field) => {
+                // we only need the parent ids
+                let ids = parents_by_id.into_iter().map(|(id, _)| id).collect();
+                (
+                    ids,
+                    EntityLink::Direct(field.window_attribute(), multiplicity),
+                )
+            }
+            JoinRelation::Derived(field) => {
+                let (ids, parent_link) = match field {
+                    JoinField::Scalar(child_field) => {
+                        // child_field contains a String id of the child; extract
+                        // those and the parent ids
+                        let (ids, child_ids): (Vec<_>, Vec<_>) = parents_by_id
+                            .into_iter()
+                            .filter_map(|(id, node)| {
+                                node.get(*child_field)
+                                    .and_then(|value| value.as_str())
+                                    .map(|child_id| (id, child_id.to_owned()))
+                            })
+                            .unzip();
+
+                        (ids, ParentLink::Scalar(child_ids))
+                    }
+                    JoinField::List(child_field) => {
+                        // child_field stores a list of child ids; extract them,
+                        // turn them into a list of strings and combine with the
+                        // parent ids
+                        let (ids, child_ids): (Vec<_>, Vec<_>) = parents_by_id
+                            .into_iter()
+                            .filter_map(|(id, node)| {
+                                node.get(*child_field)
+                                    .and_then(|value| match value {
+                                        r::Value::List(values) => {
+                                            let values: Vec<_> = values
+                                                .iter()
+                                                .filter_map(|value| {
+                                                    value.as_str().map(|value| value.to_owned())
+                                                })
+                                                .collect();
+                                            if values.is_empty() {
+                                                None
+                                            } else {
+                                                Some(values)
+                                            }
+                                        }
+                                        _ => None,
+                                    })
+                                    .map(|child_ids| (id, child_ids))
+                            })
+                            .unzip();
+                        (ids, ParentLink::List(child_ids))
+                    }
+                };
+                (
+                    ids,
+                    EntityLink::Parent(self.parent_type.clone(), parent_link),
+                )
+            }
+        }
+    }
+}
+
+/// Encapsulate how we should join a list of parent entities with a list of
+/// child entities.
+#[derive(Debug)]
+struct Join<'a> {
+    /// The object type of the child entities
+    child_type: ObjectOrInterface<'a>,
+    conds: Vec<JoinCond<'a>>,
+}
+
+impl<'a> Join<'a> {
+    /// Construct a `Join` based on the parent field pointing to the child
+    fn new(
+        schema: &'a ApiSchema,
+        parent_type: &'a s::ObjectType,
+        child_type: ObjectOrInterface<'a>,
+        field_name: &str,
+    ) -> Self {
+        let child_types = child_type
+            .object_types(schema.schema())
+            .expect("the name of the child type is valid");
+
+        let conds = child_types
+            .iter()
+            .map(|child_type| JoinCond::new(parent_type, child_type, field_name))
+            .collect();
+
+        Join { child_type, conds }
+    }
+
+    /// Perform the join. The child nodes are distributed into the parent nodes
+    /// according to the `parent_id` returned by the database in each child as
+    /// attribute `g$parent_id`, and are stored in the `response_key` entry
+    /// in each parent's `children` map.
+    ///
+    /// The `children` must contain the nodes in the correct order for each
+    /// parent; we simply pick out matching children for each parent but
+    /// otherwise maintain the order in `children`
+    fn perform(parents: &mut [&mut Node], children: Vec<Node>, response_key: &str) {
+        let children: Vec<_> = children.into_iter().map(Rc::new).collect();
+
+        if parents.len() == 1 {
+            let parent = parents.first_mut().expect("we just checked");
+            parent.set_children(response_key.to_owned(), children);
+            return;
+        }
+
+        // Build a map parent_id -> Vec<child> that we will use to add
+        // children to their parent. This relies on the fact that interfaces
+        // make sure that id's are distinct across all implementations of the
+        // interface.
+        let mut grouped: BTreeMap<&str, Vec<Rc<Node>>> = BTreeMap::default();
+        for child in children.iter() {
+            match child
+                .get("g$parent_id")
+                .expect("the query that produces 'child' ensures there is always a g$parent_id")
+            {
+                r::Value::String(key) => grouped.entry(key).or_default().push(child.clone()),
+                _ => unreachable!("the parent_id returned by the query is always a string"),
+            }
+        }
+
+        // Add appropriate children using grouped map
+        for parent in parents {
+            // Set the `response_key` field in `parent`. Make sure that even if `parent` has no
+            // matching `children`, the field gets set (to an empty `Vec`).
+            //
+            // This `insert` will overwrite in the case where the response key occurs both at the
+            // interface level and in nested object type conditions. The values for the interface
+            // query are always joined first, and may then be overwritten by the merged selection
+            // set under the object type condition. See also: e0d6da3e-60cf-41a5-b83c-b60a7a766d4a
+            let values = parent.id().ok().and_then(|id| grouped.get(&*id).cloned());
+            parent.set_children(response_key.to_owned(), values.unwrap_or(vec![]));
+        }
+    }
+
+    fn windows(
+        &self,
+        parents: &[&mut Node],
+        multiplicity: ChildMultiplicity,
+        previous_collection: &EntityCollection,
+    ) -> Vec<EntityWindow> {
+        let mut windows = vec![];
+        let column_names_map = previous_collection.entity_types_and_column_names();
+        for cond in &self.conds {
+            let mut parents_by_id = parents
+                .iter()
+                .filter(|parent| parent.typename() == cond.parent_type.as_str())
+                .filter_map(|parent| parent.id().ok().map(|id| (id, &**parent)))
+                .collect::<Vec<_>>();
+
+            if !parents_by_id.is_empty() {
+                parents_by_id.sort_unstable_by(|(id1, _), (id2, _)| id1.cmp(id2));
+                parents_by_id.dedup_by(|(id1, _), (id2, _)| id1 == id2);
+
+                let (ids, link) = cond.entity_link(parents_by_id, multiplicity);
+                let child_type: EntityType = cond.child_type.to_owned();
+                let column_names = match column_names_map.get(&child_type) {
+                    Some(column_names) => column_names.clone(),
+                    None => AttributeNames::All,
+                };
+                windows.push(EntityWindow {
+                    child_type,
+                    ids,
+                    link,
+                    column_names,
+                });
+            }
+        }
+        windows
+    }
+}
+
+/// Run the query in `ctx` in such a manner that we only perform one query
+/// per 'level' in the query. A query like `musicians { id bands { id } }`
+/// will perform two queries: one for musicians, and one for bands, regardless
+/// of how many musicians there are.
+///
+/// The returned value contains a `q::Value::Object` that contains a tree of
+/// all the entities (converted into objects) in the form in which they need
+/// to be returned. Nested object fields appear under the key `r:response_key`
+/// in these objects, and are always `q::Value::List` of objects.
+///
+/// For the above example, the returned object would have one entry under
+/// `r:musicians`, which is a list of all the musicians; each musician has an
+/// entry `r:bands` that contains a list of the bands for that musician. Note
+/// that even for single-object fields, we return a list so that we can spot
+/// cases where the store contains data that violates the data model by having
+/// multiple values for what should be a relationship to a single object in
+/// @derivedFrom fields
+pub fn run(
+    resolver: &StoreResolver,
+    ctx: &ExecutionContext<impl Resolver>,
+    selection_set: &a::SelectionSet,
+    graphql_metrics: &GraphQLMetrics,
+) -> Result<(r::Value, Trace), Vec<QueryExecutionError>> {
+    execute_root_selection_set(resolver, ctx, selection_set).map(|(nodes, trace)| {
+        graphql_metrics.observe_query_result_size(nodes.weight());
+        let obj = Object::from_iter(
+            nodes
+                .into_iter()
+                .map(|node| {
+                    node.children.into_iter().map(|(key, nodes)| {
+                        (format!("prefetch:{}", key), node_list_as_value(nodes))
+                    })
+                })
+                .flatten(),
+        );
+        (r::Value::Object(obj), trace)
+    })
+}
+
+/// Executes the root selection set of a query.
+fn execute_root_selection_set(
+    resolver: &StoreResolver,
+    ctx: &ExecutionContext<impl Resolver>,
+    selection_set: &a::SelectionSet,
+) -> Result<(Vec<Node>, Trace), Vec<QueryExecutionError>> {
+    let trace = Trace::root(ctx.query.query_text.clone());
+    // Execute the root selection set against the root query type
+    execute_selection_set(resolver, ctx, make_root_node(), trace, selection_set)
+}
+
+fn check_result_size<'a>(
+    ctx: &'a ExecutionContext<impl Resolver>,
+    size: usize,
+) -> Result<(), QueryExecutionError> {
+    if size > ENV_VARS.graphql.error_result_size {
+        return Err(QueryExecutionError::ResultTooBig(
+            size,
+            ENV_VARS.graphql.error_result_size,
+        ));
+    }
+    if size > ENV_VARS.graphql.warn_result_size {
+        warn!(ctx.logger, "Large query result"; "size" => size, "query_id" => &ctx.query.query_id);
+    }
+    Ok(())
+}
+
+fn execute_selection_set<'a>(
+    resolver: &StoreResolver,
+    ctx: &'a ExecutionContext<impl Resolver>,
+    mut parents: Vec<Node>,
+    mut parent_trace: Trace,
+    selection_set: &a::SelectionSet,
+) -> Result<(Vec<Node>, Trace), Vec<QueryExecutionError>> {
+    let schema = &ctx.query.schema;
+    let mut errors: Vec<QueryExecutionError> = Vec::new();
+
+    // Process all field groups in order
+    for (object_type, fields) in selection_set.interior_fields() {
+        if let Some(deadline) = ctx.deadline {
+            if deadline < Instant::now() {
+                errors.push(QueryExecutionError::Timeout);
+                break;
+            }
+        }
+
+        // Filter out parents that do not match the type condition.
+        let mut parents: Vec<&mut Node> = if is_root_node(parents.iter()) {
+            parents.iter_mut().collect()
+        } else {
+            parents
+                .iter_mut()
+                .filter(|p| object_type.name == p.typename())
+                .collect()
+        };
+
+        if parents.is_empty() {
+            continue;
+        }
+
+        for field in fields {
+            let field_type = object_type
+                .field(&field.name)
+                .expect("field names are valid");
+            let child_type = schema
+                .object_or_interface(field_type.field_type.get_base_type())
+                .expect("we only collect fields that are objects or interfaces");
+
+            let join = Join::new(
+                ctx.query.schema.as_ref(),
+                object_type,
+                child_type,
+                &field.name,
+            );
+
+            // "Select by Specific Attribute Names" is an experimental feature and can be disabled completely.
+            // If this environment variable is set, the program will use an empty collection that,
+            // effectively, causes the `AttributeNames::All` variant to be used as a fallback value for all
+            // queries.
+            let collected_columns = if !ENV_VARS.enable_select_by_specific_attributes {
+                SelectedAttributes(BTreeMap::new())
+            } else {
+                SelectedAttributes::for_field(field)?
+            };
+
+            match execute_field(
+                resolver,
+                ctx,
+                &parents,
+                &join,
+                field,
+                field_type,
+                collected_columns,
+            ) {
+                Ok((children, trace)) => {
+                    match execute_selection_set(
+                        resolver,
+                        ctx,
+                        children,
+                        trace,
+                        &field.selection_set,
+                    ) {
+                        Ok((children, trace)) => {
+                            Join::perform(&mut parents, children, field.response_key());
+                            let weight =
+                                parents.iter().map(|parent| parent.weight()).sum::<usize>();
+                            check_result_size(ctx, weight)?;
+                            parent_trace.push(field.response_key(), trace);
+                        }
+                        Err(mut e) => errors.append(&mut e),
+                    }
+                }
+                Err(mut e) => {
+                    errors.append(&mut e);
+                }
+            };
+        }
+    }
+
+    if errors.is_empty() {
+        Ok((parents, parent_trace))
+    } else {
+        Err(errors)
+    }
+}
+
+/// Executes a field.
+fn execute_field(
+    resolver: &StoreResolver,
+    ctx: &ExecutionContext<impl Resolver>,
+    parents: &[&mut Node],
+    join: &Join<'_>,
+    field: &a::Field,
+    field_definition: &s::Field,
+    selected_attrs: SelectedAttributes,
+) -> Result<(Vec<Node>, Trace), Vec<QueryExecutionError>> {
+    let multiplicity = if sast::is_list_or_non_null_list_field(field_definition) {
+        ChildMultiplicity::Many
+    } else {
+        ChildMultiplicity::Single
+    };
+
+    fetch(
+        ctx.logger.clone(),
+        resolver.store.as_ref(),
+        parents,
+        join,
+        ctx.query.schema.as_ref(),
+        field,
+        multiplicity,
+        ctx.query.schema.types_for_interface(),
+        resolver.block_number(),
+        ctx.max_first,
+        ctx.max_skip,
+        ctx.query.query_id.clone(),
+        selected_attrs,
+    )
+    .map_err(|e| vec![e])
+}
+
+/// Query child entities for `parents` from the store. The `join` indicates
+/// in which child field to look for the parent's id/join field. When
+/// `is_single` is `true`, there is at most one child per parent.
+fn fetch(
+    logger: Logger,
+    store: &(impl QueryStore + ?Sized),
+    parents: &[&mut Node],
+    join: &Join<'_>,
+    schema: &ApiSchema,
+    field: &a::Field,
+    multiplicity: ChildMultiplicity,
+    types_for_interface: &BTreeMap<EntityType, Vec<s::ObjectType>>,
+    block: BlockNumber,
+    max_first: u32,
+    max_skip: u32,
+    query_id: String,
+    selected_attrs: SelectedAttributes,
+) -> Result<(Vec<Node>, Trace), QueryExecutionError> {
+    let mut query = build_query(
+        join.child_type,
+        block,
+        field,
+        types_for_interface,
+        max_first,
+        max_skip,
+        selected_attrs,
+        schema,
+    )?;
+    query.query_id = Some(query_id);
+
+    if multiplicity == ChildMultiplicity::Single {
+        // Suppress 'order by' in lookups of scalar values since
+        // that causes unnecessary work in the database
+        query.order = EntityOrder::Unordered;
+    }
+
+    query.logger = Some(logger);
+    if let Some(r::Value::String(id)) = field.argument_value(ARG_ID.as_str()) {
+        query.filter = Some(
+            EntityFilter::Equal(ARG_ID.to_owned(), StoreValue::from(id.to_owned()))
+                .and_maybe(query.filter),
+        );
+    }
+
+    if !is_root_node(parents.iter().map(|p| &**p)) {
+        // For anything but the root node, restrict the children we select
+        // by the parent list
+        let windows = join.windows(parents, multiplicity, &query.collection);
+        if windows.is_empty() {
+            return Ok((vec![], Trace::None));
+        }
+        query.collection = EntityCollection::Window(windows);
+    }
+    store.find_query_values(query).map(|(values, trace)| {
+        (
+            values.into_iter().map(|entity| entity.into()).collect(),
+            trace,
+        )
+    })
+}
+
+#[derive(Debug, Default, Clone)]
+pub(crate) struct SelectedAttributes(BTreeMap<String, AttributeNames>);
+
+impl SelectedAttributes {
+    /// Extract the attributes we should select from `selection_set`. In
+    /// particular, disregard derived fields since they are not stored
+    fn for_field(field: &a::Field) -> Result<SelectedAttributes, Vec<QueryExecutionError>> {
+        let mut map = BTreeMap::new();
+        for (object_type, fields) in field.selection_set.fields() {
+            let column_names = fields
+                .filter(|field| {
+                    // Keep fields that are not derived and for which we
+                    // can find the field type
+                    sast::get_field(object_type, &field.name)
+                        .map(|field_type| !field_type.is_derived())
+                        .unwrap_or(false)
+                })
+                .filter_map(|field| {
+                    if field.name.starts_with("__") {
+                        None
+                    } else {
+                        Some(field.name.clone())
+                    }
+                })
+                .collect();
+            map.insert(
+                object_type.name().to_string(),
+                AttributeNames::Select(column_names),
+            );
+        }
+        // We need to also select the `orderBy` field if there is one.
+        // Because of how the API Schema is set up, `orderBy` can only have
+        // an enum value
+        match field.argument_value("orderBy") {
+            None => { /* nothing to do */ }
+            Some(r::Value::Enum(e)) => {
+                for columns in map.values_mut() {
+                    columns.add_str(e);
+                }
+            }
+            Some(v) => {
+                return Err(vec![constraint_violation!(
+                    "'orderBy' attribute must be an enum but is {:?}",
+                    v
+                )
+                .into()]);
+            }
+        }
+        Ok(SelectedAttributes(map))
+    }
+
+    pub fn get(&mut self, obj_type: &s::ObjectType) -> AttributeNames {
+        self.0.remove(&obj_type.name).unwrap_or(AttributeNames::All)
+    }
+}
diff --git a/graphql/src/store/query.rs b/graphql/src/store/query.rs
new file mode 100644
index 0000000..c31b00b
--- /dev/null
+++ b/graphql/src/store/query.rs
@@ -0,0 +1,952 @@
+use std::collections::{BTreeMap, BTreeSet, HashSet, VecDeque};
+use std::mem::discriminant;
+
+use graph::data::graphql::ext::DirectiveFinder;
+use graph::data::graphql::TypeExt as _;
+use graph::data::value::Object;
+use graph::data::value::Value as DataValue;
+use graph::prelude::*;
+use graph::{components::store::EntityType, data::graphql::ObjectOrInterface};
+
+use crate::execution::ast as a;
+use crate::schema::ast as sast;
+
+use super::prefetch::SelectedAttributes;
+
+#[derive(Debug)]
+enum OrderDirection {
+    Ascending,
+    Descending,
+}
+
+/// Builds a EntityQuery from GraphQL arguments.
+///
+/// Panics if `entity` is not present in `schema`.
+pub(crate) fn build_query<'a>(
+    entity: impl Into<ObjectOrInterface<'a>>,
+    block: BlockNumber,
+    field: &a::Field,
+    types_for_interface: &'a BTreeMap<EntityType, Vec<s::ObjectType>>,
+    max_first: u32,
+    max_skip: u32,
+    mut column_names: SelectedAttributes,
+    schema: &ApiSchema,
+) -> Result<EntityQuery, QueryExecutionError> {
+    let entity = entity.into();
+    let entity_types = EntityCollection::All(match &entity {
+        ObjectOrInterface::Object(object) => {
+            let selected_columns = column_names.get(object);
+            vec![((*object).into(), selected_columns)]
+        }
+        ObjectOrInterface::Interface(interface) => types_for_interface
+            [&EntityType::from(*interface)]
+            .iter()
+            .map(|o| {
+                let selected_columns = column_names.get(o);
+                (o.into(), selected_columns)
+            })
+            .collect(),
+    });
+    let mut query = EntityQuery::new(parse_subgraph_id(entity)?, block, entity_types)
+        .range(build_range(field, max_first, max_skip)?);
+    if let Some(filter) = build_filter(entity, field, schema)? {
+        query = query.filter(filter);
+    }
+    let order = match (
+        build_order_by(entity, field)?,
+        build_order_direction(field)?,
+    ) {
+        (Some((attr, value_type)), OrderDirection::Ascending) => {
+            EntityOrder::Ascending(attr, value_type)
+        }
+        (Some((attr, value_type)), OrderDirection::Descending) => {
+            EntityOrder::Descending(attr, value_type)
+        }
+        (None, _) => EntityOrder::Default,
+    };
+    query = query.order(order);
+    Ok(query)
+}
+
+/// Parses GraphQL arguments into a EntityRange, if present.
+fn build_range(
+    field: &a::Field,
+    max_first: u32,
+    max_skip: u32,
+) -> Result<EntityRange, QueryExecutionError> {
+    let first = match field.argument_value("first") {
+        Some(r::Value::Int(n)) => {
+            let n = *n;
+            if n > 0 && n <= (max_first as i64) {
+                n as u32
+            } else {
+                return Err(QueryExecutionError::RangeArgumentsError(
+                    "first", max_first, n,
+                ));
+            }
+        }
+        Some(r::Value::Null) | None => 100,
+        _ => unreachable!("first is an Int with a default value"),
+    };
+
+    let skip = match field.argument_value("skip") {
+        Some(r::Value::Int(n)) => {
+            let n = *n;
+            if n >= 0 && n <= (max_skip as i64) {
+                n as u32
+            } else {
+                return Err(QueryExecutionError::RangeArgumentsError(
+                    "skip", max_skip, n,
+                ));
+            }
+        }
+        Some(r::Value::Null) | None => 0,
+        _ => unreachable!("skip is an Int with a default value"),
+    };
+
+    Ok(EntityRange {
+        first: Some(first),
+        skip,
+    })
+}
+
+/// Parses GraphQL arguments into an EntityFilter, if present.
+fn build_filter(
+    entity: ObjectOrInterface,
+    field: &a::Field,
+    schema: &ApiSchema,
+) -> Result<Option<EntityFilter>, QueryExecutionError> {
+    match field.argument_value("where") {
+        Some(r::Value::Object(object)) => match build_filter_from_object(entity, object, schema) {
+            Ok(filter) => Ok(Some(filter)),
+            Err(e) => Err(e),
+        },
+        Some(r::Value::Null) => Ok(None),
+        None => match field.argument_value("text") {
+            Some(r::Value::Object(filter)) => build_fulltext_filter_from_object(filter),
+            None => Ok(None),
+            _ => Err(QueryExecutionError::InvalidFilterError),
+        },
+        _ => Err(QueryExecutionError::InvalidFilterError),
+    }
+}
+
+fn build_fulltext_filter_from_object(
+    object: &Object,
+) -> Result<Option<EntityFilter>, QueryExecutionError> {
+    object.iter().next().map_or(
+        Err(QueryExecutionError::FulltextQueryRequiresFilter),
+        |(key, value)| {
+            if let r::Value::String(s) = value {
+                Ok(Some(EntityFilter::Equal(
+                    key.to_string(),
+                    Value::String(s.clone()),
+                )))
+            } else {
+                Err(QueryExecutionError::FulltextQueryRequiresFilter)
+            }
+        },
+    )
+}
+
+fn parse_change_block_filter(value: &r::Value) -> Result<BlockNumber, QueryExecutionError> {
+    match value {
+        r::Value::Object(object) => i32::try_from_value(
+            object
+                .get("number_gte")
+                .ok_or_else(|| QueryExecutionError::InvalidFilterError)?,
+        )
+        .map_err(|_| QueryExecutionError::InvalidFilterError),
+        _ => Err(QueryExecutionError::InvalidFilterError),
+    }
+}
+
+/// Parses a GraphQL input object into an EntityFilter, if present.
+fn build_filter_from_object(
+    entity: ObjectOrInterface,
+    object: &Object,
+    schema: &ApiSchema,
+) -> Result<EntityFilter, QueryExecutionError> {
+    Ok(EntityFilter::And({
+        object
+            .iter()
+            .map(|(key, value)| {
+                // Special handling for _change_block input filter since its not a
+                // standard entity filter that is based on entity structure/fields
+                if key == "_change_block" {
+                    return match parse_change_block_filter(value) {
+                        Ok(block_number) => Ok(EntityFilter::ChangeBlockGte(block_number)),
+                        Err(e) => Err(e),
+                    };
+                }
+
+                use self::sast::FilterOp::*;
+                let (field_name, op) = sast::parse_field_as_filter(key);
+
+                let field = sast::get_field(entity, &field_name).ok_or_else(|| {
+                    QueryExecutionError::EntityFieldError(
+                        entity.name().to_owned(),
+                        field_name.clone(),
+                    )
+                })?;
+
+                let ty = &field.field_type;
+
+                Ok(match op {
+                    Child => match value {
+                        DataValue::Object(obj) => {
+                            build_child_filter_from_object(entity, field_name, obj, schema)?
+                        }
+                        _ => {
+                            return Err(QueryExecutionError::AttributeTypeError(
+                                value.to_string(),
+                                ty.to_string(),
+                            ))
+                        }
+                    },
+                    _ => {
+                        let store_value = Value::from_query_value(value, ty)?;
+
+                        match op {
+                            Not => EntityFilter::Not(field_name, store_value),
+                            GreaterThan => EntityFilter::GreaterThan(field_name, store_value),
+                            LessThan => EntityFilter::LessThan(field_name, store_value),
+                            GreaterOrEqual => EntityFilter::GreaterOrEqual(field_name, store_value),
+                            LessOrEqual => EntityFilter::LessOrEqual(field_name, store_value),
+                            In => EntityFilter::In(field_name, list_values(store_value, "_in")?),
+                            NotIn => EntityFilter::NotIn(
+                                field_name,
+                                list_values(store_value, "_not_in")?,
+                            ),
+                            Contains => EntityFilter::Contains(field_name, store_value),
+                            ContainsNoCase => EntityFilter::ContainsNoCase(field_name, store_value),
+                            NotContains => EntityFilter::NotContains(field_name, store_value),
+                            NotContainsNoCase => {
+                                EntityFilter::NotContainsNoCase(field_name, store_value)
+                            }
+                            StartsWith => EntityFilter::StartsWith(field_name, store_value),
+                            StartsWithNoCase => {
+                                EntityFilter::StartsWithNoCase(field_name, store_value)
+                            }
+                            NotStartsWith => EntityFilter::NotStartsWith(field_name, store_value),
+                            NotStartsWithNoCase => {
+                                EntityFilter::NotStartsWithNoCase(field_name, store_value)
+                            }
+                            EndsWith => EntityFilter::EndsWith(field_name, store_value),
+                            EndsWithNoCase => EntityFilter::EndsWithNoCase(field_name, store_value),
+                            NotEndsWith => EntityFilter::NotEndsWith(field_name, store_value),
+                            NotEndsWithNoCase => {
+                                EntityFilter::NotEndsWithNoCase(field_name, store_value)
+                            }
+                            Equal => EntityFilter::Equal(field_name, store_value),
+                            _ => unreachable!(),
+                        }
+                    }
+                })
+            })
+            .collect::<Result<Vec<EntityFilter>, QueryExecutionError>>()?
+    }))
+}
+
+fn build_child_filter_from_object(
+    entity: ObjectOrInterface,
+    field_name: String,
+    object: &Object,
+    schema: &ApiSchema,
+) -> Result<EntityFilter, QueryExecutionError> {
+    let field = entity
+        .field(&field_name)
+        .ok_or(QueryExecutionError::InvalidFilterError)?;
+    let type_name = &field.field_type.get_base_type();
+    let child_entity = schema
+        .object_or_interface(type_name)
+        .ok_or(QueryExecutionError::InvalidFilterError)?;
+    let filter = Box::new(build_filter_from_object(child_entity, object, schema)?);
+    let derived = field.is_derived();
+    let attr = match derived {
+        true => sast::get_derived_from_field(child_entity, field)
+            .ok_or(QueryExecutionError::InvalidFilterError)?
+            .name
+            .to_string(),
+        false => field_name.clone(),
+    };
+
+    if child_entity.is_interface() {
+        Ok(EntityFilter::Or(
+            child_entity
+                .object_types(schema.schema())
+                .ok_or(QueryExecutionError::AbstractTypeError(
+                    "Interface is not implemented by any types".to_string(),
+                ))?
+                .iter()
+                .map(|object_type| {
+                    EntityFilter::Child(Child {
+                        attr: attr.clone(),
+                        entity_type: EntityType::new(object_type.name.to_string()),
+                        filter: filter.clone(),
+                        derived,
+                    })
+                })
+                .collect(),
+        ))
+    } else if entity.is_interface() {
+        Ok(EntityFilter::Or(
+            entity
+                .object_types(schema.schema())
+                .ok_or(QueryExecutionError::AbstractTypeError(
+                    "Interface is not implemented by any types".to_string(),
+                ))?
+                .iter()
+                .map(|object_type| {
+                    let field = object_type
+                        .fields
+                        .iter()
+                        .find(|f| f.name == field_name.clone())
+                        .ok_or(QueryExecutionError::InvalidFilterError)?;
+                    let derived = field.is_derived();
+
+                    let attr = match derived {
+                        true => sast::get_derived_from_field(child_entity, field)
+                            .ok_or(QueryExecutionError::InvalidFilterError)?
+                            .name
+                            .to_string(),
+                        false => field_name.clone(),
+                    };
+
+                    Ok(EntityFilter::Child(Child {
+                        attr: attr.clone(),
+                        entity_type: EntityType::new(child_entity.name().to_string()),
+                        filter: filter.clone(),
+                        derived,
+                    }))
+                })
+                .collect::<Result<Vec<EntityFilter>, QueryExecutionError>>()?,
+        ))
+    } else {
+        Ok(EntityFilter::Child(Child {
+            attr,
+            entity_type: EntityType::new(type_name.to_string()),
+            filter,
+            derived,
+        }))
+    }
+}
+
+/// Parses a list of GraphQL values into a vector of entity field values.
+fn list_values(value: Value, filter_type: &str) -> Result<Vec<Value>, QueryExecutionError> {
+    match value {
+        Value::List(ref values) if !values.is_empty() => {
+            // Check that all values in list are of the same type
+            let root_discriminant = discriminant(&values[0]);
+            values
+                .iter()
+                .map(|value| {
+                    let current_discriminant = discriminant(value);
+                    if root_discriminant == current_discriminant {
+                        Ok(value.clone())
+                    } else {
+                        Err(QueryExecutionError::ListTypesError(
+                            filter_type.to_string(),
+                            vec![values[0].to_string(), value.to_string()],
+                        ))
+                    }
+                })
+                .collect::<Result<Vec<_>, _>>()
+        }
+        Value::List(ref values) if values.is_empty() => Ok(vec![]),
+        _ => Err(QueryExecutionError::ListFilterError(
+            filter_type.to_string(),
+        )),
+    }
+}
+
+/// Parses GraphQL arguments into an field name to order by, if present.
+fn build_order_by(
+    entity: ObjectOrInterface,
+    field: &a::Field,
+) -> Result<Option<(String, ValueType)>, QueryExecutionError> {
+    match field.argument_value("orderBy") {
+        Some(r::Value::Enum(name)) => {
+            let field = sast::get_field(entity, name).ok_or_else(|| {
+                QueryExecutionError::EntityFieldError(entity.name().to_owned(), name.clone())
+            })?;
+            sast::get_field_value_type(&field.field_type)
+                .map(|value_type| Some((name.to_owned(), value_type)))
+                .map_err(|_| {
+                    QueryExecutionError::OrderByNotSupportedError(
+                        entity.name().to_owned(),
+                        name.clone(),
+                    )
+                })
+        }
+        _ => match field.argument_value("text") {
+            Some(r::Value::Object(filter)) => build_fulltext_order_by_from_object(filter),
+            None => Ok(None),
+            _ => Err(QueryExecutionError::InvalidFilterError),
+        },
+    }
+}
+
+fn build_fulltext_order_by_from_object(
+    object: &Object,
+) -> Result<Option<(String, ValueType)>, QueryExecutionError> {
+    object.iter().next().map_or(
+        Err(QueryExecutionError::FulltextQueryRequiresFilter),
+        |(key, value)| {
+            if let r::Value::String(_) = value {
+                Ok(Some((key.to_string(), ValueType::String)))
+            } else {
+                Err(QueryExecutionError::FulltextQueryRequiresFilter)
+            }
+        },
+    )
+}
+
+/// Parses GraphQL arguments into a EntityOrder, if present.
+fn build_order_direction(field: &a::Field) -> Result<OrderDirection, QueryExecutionError> {
+    Ok(field
+        .argument_value("orderDirection")
+        .map(|value| match value {
+            r::Value::Enum(name) if name == "asc" => OrderDirection::Ascending,
+            r::Value::Enum(name) if name == "desc" => OrderDirection::Descending,
+            _ => OrderDirection::Ascending,
+        })
+        .unwrap_or(OrderDirection::Ascending))
+}
+
+/// Parses the subgraph ID from the ObjectType directives.
+pub fn parse_subgraph_id<'a>(
+    entity: impl Into<ObjectOrInterface<'a>>,
+) -> Result<DeploymentHash, QueryExecutionError> {
+    let entity = entity.into();
+    let entity_name = entity.name();
+    entity
+        .directives()
+        .iter()
+        .find(|directive| directive.name == "subgraphId")
+        .and_then(|directive| directive.arguments.iter().find(|(name, _)| name == "id"))
+        .and_then(|(_, value)| match value {
+            s::Value::String(id) => Some(id),
+            _ => None,
+        })
+        .ok_or(())
+        .and_then(|id| DeploymentHash::new(id).map_err(|_| ()))
+        .map_err(|_| QueryExecutionError::SubgraphDeploymentIdError(entity_name.to_owned()))
+}
+
+/// Recursively collects entities involved in a query field as `(subgraph ID, name)` tuples.
+pub(crate) fn collect_entities_from_query_field(
+    schema: &ApiSchema,
+    object_type: sast::ObjectType,
+    field: &a::Field,
+) -> Result<BTreeSet<SubscriptionFilter>, QueryExecutionError> {
+    // Output entities
+    let mut entities = HashSet::new();
+
+    // List of objects/fields to visit next
+    let mut queue = VecDeque::new();
+    queue.push_back((object_type, field));
+
+    while let Some((object_type, field)) = queue.pop_front() {
+        // Check if the field exists on the object type
+        if let Some(field_type) = sast::get_field(&object_type, &field.name) {
+            // Check if the field type corresponds to a type definition (in a valid schema,
+            // this should always be the case)
+            if let Some(type_definition) = schema.get_type_definition_from_field(field_type) {
+                // If the field's type definition is an object type, extract that type
+                if let s::TypeDefinition::Object(object_type) = type_definition {
+                    // Only collect whether the field's type has an @entity directive
+                    if sast::get_object_type_directive(object_type, String::from("entity"))
+                        .is_some()
+                    {
+                        // Obtain the subgraph ID from the object type
+                        if let Ok(subgraph_id) = parse_subgraph_id(object_type) {
+                            // Add the (subgraph_id, entity_name) tuple to the result set
+                            entities.insert((subgraph_id, object_type.name.to_owned()));
+                        }
+                    }
+
+                    // If the query field has a non-empty selection set, this means we
+                    // need to recursively process it
+                    let object_type = schema.object_type(object_type).into();
+                    for sub_field in field.selection_set.fields_for(&object_type)? {
+                        queue.push_back((object_type.cheap_clone(), sub_field))
+                    }
+                }
+            }
+        }
+    }
+
+    Ok(entities
+        .into_iter()
+        .map(|(id, entity_type)| SubscriptionFilter::Entities(id, EntityType::new(entity_type)))
+        .collect())
+}
+
+#[cfg(test)]
+mod tests {
+    use graph::{
+        components::store::EntityType,
+        data::value::Object,
+        prelude::{
+            r, ApiSchema, AttributeNames, DeploymentHash, EntityCollection, EntityFilter,
+            EntityRange, Schema, Value, ValueType, BLOCK_NUMBER_MAX,
+        },
+        prelude::{
+            s::{self, Directive, Field, InputValue, ObjectType, Type, Value as SchemaValue},
+            EntityOrder,
+        },
+    };
+    use graphql_parser::Pos;
+    use std::{collections::BTreeMap, iter::FromIterator, sync::Arc};
+
+    use super::{a, build_query};
+
+    fn default_object() -> ObjectType {
+        let subgraph_id_argument = (
+            String::from("id"),
+            s::Value::String("QmZ5dsusHwD1PEbx6L4dLCWkDsk1BLhrx9mPsGyPvTxPCM".to_string()),
+        );
+        let subgraph_id_directive = Directive {
+            name: "subgraphId".to_string(),
+            position: Pos::default(),
+            arguments: vec![subgraph_id_argument],
+        };
+        let name_input_value = InputValue {
+            position: Pos::default(),
+            description: Some("name input".to_string()),
+            name: "name".to_string(),
+            value_type: Type::NamedType("String".to_string()),
+            default_value: Some(SchemaValue::String("name".to_string())),
+            directives: vec![],
+        };
+        let name_field = Field {
+            position: Pos::default(),
+            description: Some("name field".to_string()),
+            name: "name".to_string(),
+            arguments: vec![name_input_value.clone()],
+            field_type: Type::NamedType("String".to_string()),
+            directives: vec![],
+        };
+        let email_field = Field {
+            position: Pos::default(),
+            description: Some("email field".to_string()),
+            name: "email".to_string(),
+            arguments: vec![name_input_value],
+            field_type: Type::NamedType("String".to_string()),
+            directives: vec![],
+        };
+
+        ObjectType {
+            position: Default::default(),
+            description: None,
+            name: String::new(),
+            implements_interfaces: vec![],
+            directives: vec![subgraph_id_directive],
+            fields: vec![name_field, email_field],
+        }
+    }
+
+    fn object(name: &str) -> ObjectType {
+        ObjectType {
+            name: name.to_owned(),
+            ..default_object()
+        }
+    }
+
+    fn field(name: &str, field_type: Type) -> Field {
+        Field {
+            position: Default::default(),
+            description: None,
+            name: name.to_owned(),
+            arguments: vec![],
+            field_type,
+            directives: vec![],
+        }
+    }
+
+    fn default_field() -> a::Field {
+        let arguments = vec![
+            ("first".to_string(), r::Value::Int(100.into())),
+            ("skip".to_string(), r::Value::Int(0.into())),
+        ];
+        let obj_type = Arc::new(object("SomeType")).into();
+        a::Field {
+            position: Default::default(),
+            alias: None,
+            name: "aField".to_string(),
+            arguments,
+            directives: vec![],
+            selection_set: a::SelectionSet::new(vec![obj_type]),
+        }
+    }
+
+    fn default_field_with(arg_name: &str, arg_value: r::Value) -> a::Field {
+        let mut field = default_field();
+        field.arguments.push((arg_name.to_string(), arg_value));
+        field
+    }
+
+    fn default_field_with_vec(args: Vec<(&str, r::Value)>) -> a::Field {
+        let mut field = default_field();
+        for (name, value) in args {
+            field.arguments.push((name.to_string(), value));
+        }
+        field
+    }
+
+    fn build_schema(raw_schema: &str) -> ApiSchema {
+        let document = graphql_parser::parse_schema(raw_schema)
+            .expect("Failed to parse raw schema")
+            .into_static();
+
+        let schema = Schema::new(DeploymentHash::new("id").unwrap(), document).unwrap();
+        ApiSchema::from_api_schema(schema).expect("Failed to build schema")
+    }
+
+    fn build_default_schema() -> ApiSchema {
+        build_schema(
+            r#"
+                type Query {
+                    aField(first: Int, skip: Int): [SomeType]
+                }
+
+                type SomeType @entity {
+                    id: ID!
+                    name: String!
+                }
+            "#,
+        )
+    }
+
+    #[test]
+    fn build_query_uses_the_entity_name() {
+        let schema = build_default_schema();
+        assert_eq!(
+            build_query(
+                &object("Entity1"),
+                BLOCK_NUMBER_MAX,
+                &default_field(),
+                &BTreeMap::new(),
+                std::u32::MAX,
+                std::u32::MAX,
+                Default::default(),
+                &schema
+            )
+            .unwrap()
+            .collection,
+            EntityCollection::All(vec![(EntityType::from("Entity1"), AttributeNames::All)])
+        );
+        assert_eq!(
+            build_query(
+                &object("Entity2"),
+                BLOCK_NUMBER_MAX,
+                &default_field(),
+                &BTreeMap::new(),
+                std::u32::MAX,
+                std::u32::MAX,
+                Default::default(),
+                &schema,
+            )
+            .unwrap()
+            .collection,
+            EntityCollection::All(vec![(EntityType::from("Entity2"), AttributeNames::All)])
+        );
+    }
+
+    #[test]
+    fn build_query_yields_no_order_if_order_arguments_are_missing() {
+        let schema = build_default_schema();
+        assert_eq!(
+            build_query(
+                &default_object(),
+                BLOCK_NUMBER_MAX,
+                &default_field(),
+                &BTreeMap::new(),
+                std::u32::MAX,
+                std::u32::MAX,
+                Default::default(),
+                &schema,
+            )
+            .unwrap()
+            .order,
+            EntityOrder::Default,
+        );
+    }
+
+    #[test]
+    fn build_query_parses_order_by_from_enum_values_correctly() {
+        let schema = build_default_schema();
+        let field = default_field_with("orderBy", r::Value::Enum("name".to_string()));
+        assert_eq!(
+            build_query(
+                &default_object(),
+                BLOCK_NUMBER_MAX,
+                &field,
+                &BTreeMap::new(),
+                std::u32::MAX,
+                std::u32::MAX,
+                Default::default(),
+                &schema,
+            )
+            .unwrap()
+            .order,
+            EntityOrder::Ascending("name".to_string(), ValueType::String)
+        );
+
+        let field = default_field_with("orderBy", r::Value::Enum("email".to_string()));
+        assert_eq!(
+            build_query(
+                &default_object(),
+                BLOCK_NUMBER_MAX,
+                &field,
+                &BTreeMap::new(),
+                std::u32::MAX,
+                std::u32::MAX,
+                Default::default(),
+                &schema,
+            )
+            .unwrap()
+            .order,
+            EntityOrder::Ascending("email".to_string(), ValueType::String)
+        );
+    }
+
+    #[test]
+    fn build_query_ignores_order_by_from_non_enum_values() {
+        let schema = build_default_schema();
+        let field = default_field_with("orderBy", r::Value::String("name".to_string()));
+        assert_eq!(
+            build_query(
+                &default_object(),
+                BLOCK_NUMBER_MAX,
+                &field,
+                &BTreeMap::new(),
+                std::u32::MAX,
+                std::u32::MAX,
+                Default::default(),
+                &schema
+            )
+            .unwrap()
+            .order,
+            EntityOrder::Default
+        );
+
+        let field = default_field_with("orderBy", r::Value::String("email".to_string()));
+        assert_eq!(
+            build_query(
+                &default_object(),
+                BLOCK_NUMBER_MAX,
+                &field,
+                &BTreeMap::new(),
+                std::u32::MAX,
+                std::u32::MAX,
+                Default::default(),
+                &schema,
+            )
+            .unwrap()
+            .order,
+            EntityOrder::Default
+        );
+    }
+
+    #[test]
+    fn build_query_parses_order_direction_from_enum_values_correctly() {
+        let schema = build_default_schema();
+        let field = default_field_with_vec(vec![
+            ("orderBy", r::Value::Enum("name".to_string())),
+            ("orderDirection", r::Value::Enum("asc".to_string())),
+        ]);
+        assert_eq!(
+            build_query(
+                &default_object(),
+                BLOCK_NUMBER_MAX,
+                &field,
+                &BTreeMap::new(),
+                std::u32::MAX,
+                std::u32::MAX,
+                Default::default(),
+                &schema,
+            )
+            .unwrap()
+            .order,
+            EntityOrder::Ascending("name".to_string(), ValueType::String)
+        );
+
+        let field = default_field_with_vec(vec![
+            ("orderBy", r::Value::Enum("name".to_string())),
+            ("orderDirection", r::Value::Enum("desc".to_string())),
+        ]);
+        assert_eq!(
+            build_query(
+                &default_object(),
+                BLOCK_NUMBER_MAX,
+                &field,
+                &BTreeMap::new(),
+                std::u32::MAX,
+                std::u32::MAX,
+                Default::default(),
+                &schema,
+            )
+            .unwrap()
+            .order,
+            EntityOrder::Descending("name".to_string(), ValueType::String)
+        );
+
+        let field = default_field_with_vec(vec![
+            ("orderBy", r::Value::Enum("name".to_string())),
+            (
+                "orderDirection",
+                r::Value::Enum("descending...".to_string()),
+            ),
+        ]);
+        assert_eq!(
+            build_query(
+                &default_object(),
+                BLOCK_NUMBER_MAX,
+                &field,
+                &BTreeMap::new(),
+                std::u32::MAX,
+                std::u32::MAX,
+                Default::default(),
+                &schema,
+            )
+            .unwrap()
+            .order,
+            EntityOrder::Ascending("name".to_string(), ValueType::String)
+        );
+
+        // No orderBy -> EntityOrder::Default
+        let field = default_field_with(
+            "orderDirection",
+            r::Value::Enum("descending...".to_string()),
+        );
+        assert_eq!(
+            build_query(
+                &default_object(),
+                BLOCK_NUMBER_MAX,
+                &field,
+                &BTreeMap::new(),
+                std::u32::MAX,
+                std::u32::MAX,
+                Default::default(),
+                &schema
+            )
+            .unwrap()
+            .order,
+            EntityOrder::Default
+        );
+    }
+
+    #[test]
+    fn build_query_yields_default_range_if_none_is_present() {
+        let schema = build_default_schema();
+        assert_eq!(
+            build_query(
+                &default_object(),
+                BLOCK_NUMBER_MAX,
+                &default_field(),
+                &BTreeMap::new(),
+                std::u32::MAX,
+                std::u32::MAX,
+                Default::default(),
+                &schema
+            )
+            .unwrap()
+            .range,
+            EntityRange::first(100)
+        );
+    }
+
+    #[test]
+    fn build_query_yields_default_first_if_only_skip_is_present() {
+        let schema = build_default_schema();
+        let mut field = default_field();
+        field.arguments = vec![("skip".to_string(), r::Value::Int(50))];
+
+        assert_eq!(
+            build_query(
+                &default_object(),
+                BLOCK_NUMBER_MAX,
+                &field,
+                &BTreeMap::new(),
+                std::u32::MAX,
+                std::u32::MAX,
+                Default::default(),
+                &schema
+            )
+            .unwrap()
+            .range,
+            EntityRange {
+                first: Some(100),
+                skip: 50,
+            },
+        );
+    }
+
+    #[test]
+    fn build_query_yields_filters() {
+        let schema = build_default_schema();
+        let query_field = default_field_with(
+            "where",
+            r::Value::Object(Object::from_iter(vec![(
+                "name_ends_with".to_string(),
+                r::Value::String("ello".to_string()),
+            )])),
+        );
+        assert_eq!(
+            build_query(
+                &ObjectType {
+                    fields: vec![field("name", Type::NamedType("string".to_owned()))],
+                    ..default_object()
+                },
+                BLOCK_NUMBER_MAX,
+                &query_field,
+                &BTreeMap::new(),
+                std::u32::MAX,
+                std::u32::MAX,
+                Default::default(),
+                &schema
+            )
+            .unwrap()
+            .filter,
+            Some(EntityFilter::And(vec![EntityFilter::EndsWith(
+                "name".to_string(),
+                Value::String("ello".to_string()),
+            )]))
+        )
+    }
+
+    #[test]
+    fn build_query_yields_block_change_gte_filter() {
+        let schema = build_default_schema();
+        let query_field = default_field_with(
+            "where",
+            r::Value::Object(Object::from_iter(vec![(
+                "_change_block".to_string(),
+                r::Value::Object(Object::from_iter(vec![(
+                    "number_gte".to_string(),
+                    r::Value::Int(10),
+                )])),
+            )])),
+        );
+        assert_eq!(
+            build_query(
+                &ObjectType {
+                    fields: vec![field("name", Type::NamedType("string".to_owned()))],
+                    ..default_object()
+                },
+                BLOCK_NUMBER_MAX,
+                &query_field,
+                &BTreeMap::new(),
+                std::u32::MAX,
+                std::u32::MAX,
+                Default::default(),
+                &schema
+            )
+            .unwrap()
+            .filter,
+            Some(EntityFilter::And(vec![EntityFilter::ChangeBlockGte(10)]))
+        )
+    }
+}
diff --git a/graphql/src/store/resolver.rs b/graphql/src/store/resolver.rs
new file mode 100644
index 0000000..d95a626
--- /dev/null
+++ b/graphql/src/store/resolver.rs
@@ -0,0 +1,390 @@
+use std::collections::BTreeMap;
+use std::result;
+use std::sync::Arc;
+
+use graph::data::query::Trace;
+use graph::data::value::Object;
+use graph::data::{
+    graphql::{object, ObjectOrInterface},
+    schema::META_FIELD_TYPE,
+};
+use graph::prelude::*;
+use graph::{components::store::*, data::schema::BLOCK_FIELD_TYPE};
+
+use crate::execution::ast as a;
+use crate::metrics::GraphQLMetrics;
+use crate::query::ext::BlockConstraint;
+use crate::schema::ast as sast;
+use crate::{prelude::*, schema::api::ErrorPolicy};
+
+use crate::store::query::collect_entities_from_query_field;
+
+/// A resolver that fetches entities from a `Store`.
+#[derive(Clone)]
+pub struct StoreResolver {
+    #[allow(dead_code)]
+    logger: Logger,
+    pub(crate) store: Arc<dyn QueryStore>,
+    subscription_manager: Arc<dyn SubscriptionManager>,
+    pub(crate) block_ptr: Option<BlockPtrTs>,
+    deployment: DeploymentHash,
+    has_non_fatal_errors: bool,
+    error_policy: ErrorPolicy,
+    graphql_metrics: Arc<GraphQLMetrics>,
+}
+
+#[derive(Clone, Debug)]
+pub(crate) struct BlockPtrTs {
+    pub ptr: BlockPtr,
+    pub timestamp: Option<u64>,
+}
+
+impl From<BlockPtr> for BlockPtrTs {
+    fn from(ptr: BlockPtr) -> Self {
+        Self {
+            ptr,
+            timestamp: None,
+        }
+    }
+}
+
+impl From<&BlockPtrTs> for BlockPtr {
+    fn from(ptr: &BlockPtrTs) -> Self {
+        ptr.ptr.cheap_clone()
+    }
+}
+
+impl CheapClone for StoreResolver {}
+
+impl StoreResolver {
+    /// Create a resolver that looks up entities at whatever block is the
+    /// latest when the query is run. That means that multiple calls to find
+    /// entities into this resolver might return entities from different
+    /// blocks
+    pub fn for_subscription(
+        logger: &Logger,
+        deployment: DeploymentHash,
+        store: Arc<dyn QueryStore>,
+        subscription_manager: Arc<dyn SubscriptionManager>,
+        graphql_metrics: Arc<GraphQLMetrics>,
+    ) -> Self {
+        StoreResolver {
+            logger: logger.new(o!("component" => "StoreResolver")),
+            store,
+            subscription_manager,
+            block_ptr: None,
+            deployment,
+
+            // Checking for non-fatal errors does not work with subscriptions.
+            has_non_fatal_errors: false,
+            error_policy: ErrorPolicy::Deny,
+            graphql_metrics,
+        }
+    }
+
+    /// Create a resolver that looks up entities at the block specified
+    /// by `bc`. Any calls to find objects will always return entities as
+    /// of that block. Note that if `bc` is `BlockConstraint::Latest` we use
+    /// whatever the latest block for the subgraph was when the resolver was
+    /// created
+    pub async fn at_block(
+        logger: &Logger,
+        store: Arc<dyn QueryStore>,
+        state: &DeploymentState,
+        subscription_manager: Arc<dyn SubscriptionManager>,
+        bc: BlockConstraint,
+        error_policy: ErrorPolicy,
+        deployment: DeploymentHash,
+        graphql_metrics: Arc<GraphQLMetrics>,
+    ) -> Result<Self, QueryExecutionError> {
+        let store_clone = store.cheap_clone();
+        let block_ptr = Self::locate_block(store_clone.as_ref(), bc, state).await?;
+
+        let has_non_fatal_errors = store
+            .has_deterministic_errors(block_ptr.ptr.block_number())
+            .await?;
+
+        let resolver = StoreResolver {
+            logger: logger.new(o!("component" => "StoreResolver")),
+            store,
+            subscription_manager,
+            block_ptr: Some(block_ptr),
+            deployment,
+            has_non_fatal_errors,
+            error_policy,
+            graphql_metrics,
+        };
+        Ok(resolver)
+    }
+
+    pub fn block_number(&self) -> BlockNumber {
+        self.block_ptr
+            .as_ref()
+            .map(|ptr| ptr.ptr.number as BlockNumber)
+            .unwrap_or(BLOCK_NUMBER_MAX)
+    }
+
+    /// locate_block returns the block pointer and it's timestamp when available.
+    async fn locate_block(
+        store: &dyn QueryStore,
+        bc: BlockConstraint,
+        state: &DeploymentState,
+    ) -> Result<BlockPtrTs, QueryExecutionError> {
+        fn block_queryable(
+            state: &DeploymentState,
+            block: BlockNumber,
+        ) -> Result<(), QueryExecutionError> {
+            state
+                .block_queryable(block)
+                .map_err(|msg| QueryExecutionError::ValueParseError("block.number".to_owned(), msg))
+        }
+
+        async fn get_block_ts(
+            store: &dyn QueryStore,
+            ptr: &BlockPtr,
+        ) -> Result<Option<u64>, QueryExecutionError> {
+            match store
+                .block_number_with_timestamp(&ptr.hash)
+                .await
+                .map_err(Into::<QueryExecutionError>::into)?
+            {
+                Some((_, Some(ts))) => Ok(Some(ts)),
+                _ => Ok(None),
+            }
+        }
+
+        match bc {
+            BlockConstraint::Hash(hash) => {
+                let ptr = store
+                    .block_number_with_timestamp(&hash)
+                    .await
+                    .map_err(Into::into)
+                    .and_then(|result| {
+                        result
+                            .ok_or_else(|| {
+                                QueryExecutionError::ValueParseError(
+                                    "block.hash".to_owned(),
+                                    "no block with that hash found".to_owned(),
+                                )
+                            })
+                            .map(|(number, ts)| BlockPtrTs {
+                                ptr: BlockPtr::new(hash, number),
+                                timestamp: ts,
+                            })
+                    })?;
+
+                block_queryable(state, ptr.ptr.number)?;
+                Ok(ptr)
+            }
+            BlockConstraint::Number(number) => {
+                block_queryable(state, number)?;
+                // We don't have a way here to look the block hash up from
+                // the database, and even if we did, there is no guarantee
+                // that we have the block in our cache. We therefore
+                // always return an all zeroes hash when users specify
+                // a block number
+                // See 7a7b9708-adb7-4fc2-acec-88680cb07ec1
+                Ok(BlockPtr::from((web3::types::H256::zero(), number as u64)).into())
+            }
+            BlockConstraint::Min(min) => {
+                let ptr = state.latest_block.cheap_clone();
+                if ptr.number < min {
+                    return Err(QueryExecutionError::ValueParseError(
+                        "block.number_gte".to_owned(),
+                        format!(
+                            "subgraph {} has only indexed up to block number {} \
+                                and data for block number {} is therefore not yet available",
+                            state.id, ptr.number, min
+                        ),
+                    ));
+                }
+                let timestamp = get_block_ts(store, &state.latest_block).await?;
+
+                Ok(BlockPtrTs { ptr, timestamp })
+            }
+            BlockConstraint::Latest => {
+                let timestamp = get_block_ts(store, &state.latest_block).await?;
+
+                Ok(BlockPtrTs {
+                    ptr: state.latest_block.cheap_clone(),
+                    timestamp,
+                })
+            }
+        }
+    }
+
+    fn handle_meta(
+        &self,
+        prefetched_object: Option<r::Value>,
+        object_type: &ObjectOrInterface<'_>,
+    ) -> Result<(Option<r::Value>, Option<r::Value>), QueryExecutionError> {
+        // Pretend that the whole `_meta` field was loaded by prefetch. Eager
+        // loading this is ok until we add more information to this field
+        // that would force us to query the database; when that happens, we
+        // need to switch to loading on demand
+        if object_type.is_meta() {
+            let hash = self
+                .block_ptr
+                .as_ref()
+                .and_then(|ptr| {
+                    // locate_block indicates that we do not have a block hash
+                    // by setting the hash to `zero`
+                    // See 7a7b9708-adb7-4fc2-acec-88680cb07ec1
+                    let hash_h256 = ptr.ptr.hash_as_h256();
+                    if hash_h256 == web3::types::H256::zero() {
+                        None
+                    } else {
+                        Some(r::Value::String(format!("0x{:x}", hash_h256)))
+                    }
+                })
+                .unwrap_or(r::Value::Null);
+            let number = self
+                .block_ptr
+                .as_ref()
+                .map(|ptr| r::Value::Int((ptr.ptr.number as i32).into()))
+                .unwrap_or(r::Value::Null);
+
+            let timestamp = self.block_ptr.as_ref().map(|ptr| {
+                ptr.timestamp
+                    .clone()
+                    .map(|ts| r::Value::Int(ts as i64))
+                    .unwrap_or(r::Value::Null)
+            });
+
+            let mut map = BTreeMap::new();
+            let block = object! {
+                hash: hash,
+                number: number,
+                timestamp: timestamp,
+                __typename: BLOCK_FIELD_TYPE
+            };
+            map.insert("prefetch:block".into(), r::Value::List(vec![block]));
+            map.insert(
+                "deployment".into(),
+                r::Value::String(self.deployment.to_string()),
+            );
+            map.insert(
+                "hasIndexingErrors".into(),
+                r::Value::Boolean(self.has_non_fatal_errors),
+            );
+            map.insert(
+                "__typename".into(),
+                r::Value::String(META_FIELD_TYPE.to_string()),
+            );
+            return Ok((None, Some(r::Value::object(map))));
+        }
+        Ok((prefetched_object, None))
+    }
+}
+
+#[async_trait]
+impl Resolver for StoreResolver {
+    const CACHEABLE: bool = true;
+
+    async fn query_permit(&self) -> Result<tokio::sync::OwnedSemaphorePermit, QueryExecutionError> {
+        self.store.query_permit().await.map_err(Into::into)
+    }
+
+    fn prefetch(
+        &self,
+        ctx: &ExecutionContext<Self>,
+        selection_set: &a::SelectionSet,
+    ) -> Result<(Option<r::Value>, Trace), Vec<QueryExecutionError>> {
+        super::prefetch::run(self, ctx, selection_set, &self.graphql_metrics)
+            .map(|(value, trace)| (Some(value), trace))
+    }
+
+    async fn resolve_objects(
+        &self,
+        prefetched_objects: Option<r::Value>,
+        field: &a::Field,
+        _field_definition: &s::Field,
+        object_type: ObjectOrInterface<'_>,
+    ) -> Result<r::Value, QueryExecutionError> {
+        if let Some(child) = prefetched_objects {
+            Ok(child)
+        } else {
+            Err(QueryExecutionError::ResolveEntitiesError(format!(
+                "internal error resolving {}.{}: \
+                 expected prefetched result, but found nothing",
+                object_type.name(),
+                &field.name,
+            )))
+        }
+    }
+
+    async fn resolve_object(
+        &self,
+        prefetched_object: Option<r::Value>,
+        field: &a::Field,
+        field_definition: &s::Field,
+        object_type: ObjectOrInterface<'_>,
+    ) -> Result<r::Value, QueryExecutionError> {
+        let (prefetched_object, meta) = self.handle_meta(prefetched_object, &object_type)?;
+        if let Some(meta) = meta {
+            return Ok(meta);
+        }
+        if let Some(r::Value::List(children)) = prefetched_object {
+            if children.len() > 1 {
+                let derived_from_field =
+                    sast::get_derived_from_field(object_type, field_definition)
+                        .expect("only derived fields can lead to multiple children here");
+
+                return Err(QueryExecutionError::AmbiguousDerivedFromResult(
+                    field.position,
+                    field.name.to_owned(),
+                    object_type.name().to_owned(),
+                    derived_from_field.name.to_owned(),
+                ));
+            } else {
+                Ok(children.into_iter().next().unwrap_or(r::Value::Null))
+            }
+        } else {
+            return Err(QueryExecutionError::ResolveEntitiesError(format!(
+                "internal error resolving {}.{}: \
+                 expected prefetched result, but found nothing",
+                object_type.name(),
+                &field.name,
+            )));
+        }
+    }
+
+    fn resolve_field_stream(
+        &self,
+        schema: &ApiSchema,
+        object_type: &s::ObjectType,
+        field: &a::Field,
+    ) -> result::Result<UnitStream, QueryExecutionError> {
+        // Collect all entities involved in the query field
+        let object_type = schema.object_type(object_type).into();
+        let entities = collect_entities_from_query_field(schema, object_type, field)?;
+
+        // Subscribe to the store and return the entity change stream
+        Ok(self.subscription_manager.subscribe_no_payload(entities))
+    }
+
+    fn post_process(&self, result: &mut QueryResult) -> Result<(), anyhow::Error> {
+        // Post-processing is only necessary for queries with indexing errors, and no query errors.
+        if !self.has_non_fatal_errors || result.has_errors() {
+            return Ok(());
+        }
+
+        // Add the "indexing_error" to the response.
+        assert!(result.errors_mut().is_empty());
+        *result.errors_mut() = vec![QueryError::IndexingError];
+
+        match self.error_policy {
+            // If indexing errors are denied, we omit results, except for the `_meta` response.
+            // Note that the meta field could have been queried under a different response key,
+            // or a different field queried under the response key `_meta`.
+            ErrorPolicy::Deny => {
+                let data = result.take_data();
+                let meta =
+                    data.and_then(|mut d| d.remove("_meta").map(|m| ("_meta".to_string(), m)));
+                result.set_data(meta.map(|m| Object::from_iter(Some(m))));
+            }
+            ErrorPolicy::Allow => (),
+        }
+        Ok(())
+    }
+}
diff --git a/graphql/src/subscription/mod.rs b/graphql/src/subscription/mod.rs
new file mode 100644
index 0000000..c07bf27
--- /dev/null
+++ b/graphql/src/subscription/mod.rs
@@ -0,0 +1,239 @@
+use std::result::Result;
+use std::time::{Duration, Instant};
+
+use graph::components::store::UnitStream;
+use graph::{components::store::SubscriptionManager, prelude::*};
+
+use crate::metrics::GraphQLMetrics;
+use crate::{
+    execution::ast as a,
+    execution::*,
+    prelude::{BlockConstraint, StoreResolver},
+    schema::api::ErrorPolicy,
+};
+
+/// Options available for subscription execution.
+pub struct SubscriptionExecutionOptions {
+    /// The logger to use during subscription execution.
+    pub logger: Logger,
+
+    /// The store to use.
+    pub store: Arc<dyn QueryStore>,
+
+    pub subscription_manager: Arc<dyn SubscriptionManager>,
+
+    /// Individual timeout for each subscription query.
+    pub timeout: Option<Duration>,
+
+    /// Maximum complexity for a subscription query.
+    pub max_complexity: Option<u64>,
+
+    /// Maximum depth for a subscription query.
+    pub max_depth: u8,
+
+    /// Maximum value for the `first` argument.
+    pub max_first: u32,
+
+    /// Maximum value for the `skip` argument.
+    pub max_skip: u32,
+
+    pub graphql_metrics: Arc<GraphQLMetrics>,
+}
+
+pub fn execute_subscription(
+    subscription: Subscription,
+    schema: Arc<ApiSchema>,
+    options: SubscriptionExecutionOptions,
+) -> Result<SubscriptionResult, SubscriptionError> {
+    let query = crate::execution::Query::new(
+        &options.logger,
+        schema,
+        None,
+        subscription.query,
+        options.max_complexity,
+        options.max_depth,
+        options.graphql_metrics.cheap_clone(),
+    )?;
+    execute_prepared_subscription(query, options)
+}
+
+pub(crate) fn execute_prepared_subscription(
+    query: Arc<crate::execution::Query>,
+    options: SubscriptionExecutionOptions,
+) -> Result<SubscriptionResult, SubscriptionError> {
+    if !query.is_subscription() {
+        return Err(SubscriptionError::from(QueryExecutionError::NotSupported(
+            "Only subscriptions are supported".to_string(),
+        )));
+    }
+
+    info!(
+        options.logger,
+        "Execute subscription";
+        "query" => &query.query_text,
+    );
+
+    let source_stream = create_source_event_stream(query.clone(), &options)?;
+    let response_stream = map_source_to_response_stream(query, options, source_stream);
+    Ok(response_stream)
+}
+
+fn create_source_event_stream(
+    query: Arc<crate::execution::Query>,
+    options: &SubscriptionExecutionOptions,
+) -> Result<UnitStream, SubscriptionError> {
+    let resolver = StoreResolver::for_subscription(
+        &options.logger,
+        query.schema.id().clone(),
+        options.store.clone(),
+        options.subscription_manager.cheap_clone(),
+        options.graphql_metrics.cheap_clone(),
+    );
+    let ctx = ExecutionContext {
+        logger: options.logger.cheap_clone(),
+        resolver,
+        query,
+        deadline: None,
+        max_first: options.max_first,
+        max_skip: options.max_skip,
+        cache_status: Default::default(),
+    };
+
+    let subscription_type = ctx
+        .query
+        .schema
+        .subscription_type
+        .as_ref()
+        .ok_or(QueryExecutionError::NoRootSubscriptionObjectType)?;
+
+    let field = if ctx.query.selection_set.is_empty() {
+        return Err(SubscriptionError::from(QueryExecutionError::EmptyQuery));
+    } else {
+        match ctx.query.selection_set.single_field() {
+            Some(field) => field,
+            None => {
+                return Err(SubscriptionError::from(
+                    QueryExecutionError::MultipleSubscriptionFields,
+                ));
+            }
+        }
+    };
+
+    resolve_field_stream(&ctx, subscription_type, field)
+}
+
+fn resolve_field_stream(
+    ctx: &ExecutionContext<impl Resolver>,
+    object_type: &s::ObjectType,
+    field: &a::Field,
+) -> Result<UnitStream, SubscriptionError> {
+    ctx.resolver
+        .resolve_field_stream(&ctx.query.schema, object_type, field)
+        .map_err(SubscriptionError::from)
+}
+
+fn map_source_to_response_stream(
+    query: Arc<crate::execution::Query>,
+    options: SubscriptionExecutionOptions,
+    source_stream: UnitStream,
+) -> QueryResultStream {
+    // Create a stream with a single empty event. By chaining this in front
+    // of the real events, we trick the subscription into executing its query
+    // at least once. This satisfies the GraphQL over Websocket protocol
+    // requirement of "respond[ing] with at least one GQL_DATA message", see
+    // https://github.com/apollographql/subscriptions-transport-ws/blob/master/PROTOCOL.md#gql_data
+    let trigger_stream = futures03::stream::once(async {});
+
+    let SubscriptionExecutionOptions {
+        logger,
+        store,
+        subscription_manager,
+        timeout,
+        max_complexity: _,
+        max_depth: _,
+        max_first,
+        max_skip,
+        graphql_metrics,
+    } = options;
+
+    trigger_stream
+        .chain(source_stream)
+        .then(move |()| {
+            execute_subscription_event(
+                logger.clone(),
+                store.clone(),
+                subscription_manager.cheap_clone(),
+                query.clone(),
+                timeout,
+                max_first,
+                max_skip,
+                graphql_metrics.cheap_clone(),
+            )
+            .boxed()
+        })
+        .boxed()
+}
+
+async fn execute_subscription_event(
+    logger: Logger,
+    store: Arc<dyn QueryStore>,
+    subscription_manager: Arc<dyn SubscriptionManager>,
+    query: Arc<crate::execution::Query>,
+    timeout: Option<Duration>,
+    max_first: u32,
+    max_skip: u32,
+    metrics: Arc<GraphQLMetrics>,
+) -> Arc<QueryResult> {
+    async fn make_resolver(
+        store: Arc<dyn QueryStore>,
+        logger: &Logger,
+        subscription_manager: Arc<dyn SubscriptionManager>,
+        query: &Arc<crate::execution::Query>,
+        metrics: Arc<GraphQLMetrics>,
+    ) -> Result<StoreResolver, QueryExecutionError> {
+        let state = store.deployment_state().await?;
+        StoreResolver::at_block(
+            logger,
+            store,
+            &state,
+            subscription_manager,
+            BlockConstraint::Latest,
+            ErrorPolicy::Deny,
+            query.schema.id().clone(),
+            metrics,
+        )
+        .await
+    }
+
+    let resolver = match make_resolver(store, &logger, subscription_manager, &query, metrics).await
+    {
+        Ok(resolver) => resolver,
+        Err(e) => return Arc::new(e.into()),
+    };
+
+    let block_ptr = resolver.block_ptr.as_ref().map(Into::into);
+
+    // Create a fresh execution context with deadline.
+    let ctx = Arc::new(ExecutionContext {
+        logger,
+        resolver,
+        query,
+        deadline: timeout.map(|t| Instant::now() + t),
+        max_first,
+        max_skip,
+        cache_status: Default::default(),
+    });
+
+    let subscription_type = match ctx.query.schema.subscription_type.as_ref() {
+        Some(t) => t.cheap_clone(),
+        None => return Arc::new(QueryExecutionError::NoRootSubscriptionObjectType.into()),
+    };
+
+    execute_root_selection_set(
+        ctx.cheap_clone(),
+        ctx.query.selection_set.cheap_clone(),
+        subscription_type.into(),
+        block_ptr,
+    )
+    .await
+}
diff --git a/graphql/src/values/coercion.rs b/graphql/src/values/coercion.rs
new file mode 100644
index 0000000..b7ed80b
--- /dev/null
+++ b/graphql/src/values/coercion.rs
@@ -0,0 +1,424 @@
+use crate::schema;
+use graph::prelude::s::{EnumType, InputValue, ScalarType, Type, TypeDefinition};
+use graph::prelude::{q, r, QueryExecutionError};
+use std::collections::BTreeMap;
+use std::convert::TryFrom;
+
+/// A GraphQL value that can be coerced according to a type.
+pub trait MaybeCoercible<T> {
+    /// On error,  `self` is returned as `Err(self)`.
+    fn coerce(self, using_type: &T) -> Result<r::Value, q::Value>;
+}
+
+impl MaybeCoercible<EnumType> for q::Value {
+    fn coerce(self, using_type: &EnumType) -> Result<r::Value, q::Value> {
+        match self {
+            q::Value::Null => Ok(r::Value::Null),
+            q::Value::String(name) | q::Value::Enum(name)
+                if using_type.values.iter().any(|value| value.name == name) =>
+            {
+                Ok(r::Value::Enum(name))
+            }
+            _ => Err(self),
+        }
+    }
+}
+
+impl MaybeCoercible<ScalarType> for q::Value {
+    fn coerce(self, using_type: &ScalarType) -> Result<r::Value, q::Value> {
+        match (using_type.name.as_str(), self) {
+            (_, q::Value::Null) => Ok(r::Value::Null),
+            ("Boolean", q::Value::Boolean(b)) => Ok(r::Value::Boolean(b)),
+            ("BigDecimal", q::Value::Float(f)) => Ok(r::Value::String(f.to_string())),
+            ("BigDecimal", q::Value::Int(i)) => Ok(r::Value::String(
+                i.as_i64().ok_or(q::Value::Int(i))?.to_string(),
+            )),
+            ("BigDecimal", q::Value::String(s)) => Ok(r::Value::String(s)),
+            ("Int", q::Value::Int(num)) => {
+                let n = num.as_i64().ok_or_else(|| q::Value::Int(num.clone()))?;
+                if i32::min_value() as i64 <= n && n <= i32::max_value() as i64 {
+                    Ok(r::Value::Int((n as i32).into()))
+                } else {
+                    Err(q::Value::Int(num))
+                }
+            }
+            ("String", q::Value::String(s)) => Ok(r::Value::String(s)),
+            ("ID", q::Value::String(s)) => Ok(r::Value::String(s)),
+            ("ID", q::Value::Int(n)) => Ok(r::Value::String(
+                n.as_i64().ok_or(q::Value::Int(n))?.to_string(),
+            )),
+            ("Bytes", q::Value::String(s)) => Ok(r::Value::String(s)),
+            ("BigInt", q::Value::String(s)) => Ok(r::Value::String(s)),
+            ("BigInt", q::Value::Int(n)) => Ok(r::Value::String(
+                n.as_i64().ok_or(q::Value::Int(n))?.to_string(),
+            )),
+            (_, v) => Err(v),
+        }
+    }
+}
+
+/// On error, the `value` is returned as `Err(value)`.
+fn coerce_to_definition<'a>(
+    value: r::Value,
+    definition: &str,
+    resolver: &impl Fn(&str) -> Option<&'a TypeDefinition>,
+) -> Result<r::Value, r::Value> {
+    match resolver(definition).ok_or_else(|| value.clone())? {
+        // Accept enum values if they match a value in the enum type
+        TypeDefinition::Enum(t) => value.coerce_enum(t),
+
+        // Try to coerce Scalar values
+        TypeDefinition::Scalar(t) => value.coerce_scalar(t),
+
+        // Try to coerce InputObject values
+        TypeDefinition::InputObject(t) => match value {
+            r::Value::Object(object) => {
+                let object_for_error = r::Value::Object(object.clone());
+                let mut coerced_object = BTreeMap::new();
+                for (name, value) in object {
+                    let def = t
+                        .fields
+                        .iter()
+                        .find(|f| f.name == &*name)
+                        .ok_or_else(|| object_for_error.clone())?;
+                    coerced_object.insert(
+                        name.clone(),
+                        match coerce_input_value(Some(value), def, resolver) {
+                            Err(_) | Ok(None) => return Err(object_for_error),
+                            Ok(Some(v)) => v,
+                        },
+                    );
+                }
+                Ok(r::Value::object(coerced_object))
+            }
+            _ => Err(value),
+        },
+
+        // Everything else remains unimplemented
+        _ => Err(value),
+    }
+}
+
+/// Coerces an argument into a GraphQL value.
+///
+/// `Ok(None)` happens when no value is found for a nullable type.
+pub(crate) fn coerce_input_value<'a>(
+    mut value: Option<r::Value>,
+    def: &InputValue,
+    resolver: &impl Fn(&str) -> Option<&'a TypeDefinition>,
+) -> Result<Option<r::Value>, QueryExecutionError> {
+    // Use the default value if necessary and present.
+    value = match value {
+        Some(value) => Some(value),
+        None => def
+            .default_value
+            .clone()
+            .map(r::Value::try_from)
+            .transpose()
+            .map_err(|value| {
+                QueryExecutionError::Panic(format!(
+                    "internal error: failed to convert default value {:?}",
+                    value
+                ))
+            })?,
+    };
+
+    // Extract value, checking for null or missing.
+    let value = match value {
+        None => {
+            return if schema::ast::is_non_null_type(&def.value_type) {
+                Err(QueryExecutionError::MissingArgumentError(
+                    def.position,
+                    def.name.to_owned(),
+                ))
+            } else {
+                Ok(None)
+            };
+        }
+        Some(value) => value,
+    };
+
+    Ok(Some(
+        coerce_value(value, &def.value_type, resolver).map_err(|val| {
+            QueryExecutionError::InvalidArgumentError(def.position, def.name.to_owned(), val.into())
+        })?,
+    ))
+}
+
+/// On error, the `value` is returned as `Err(value)`.
+pub(crate) fn coerce_value<'a>(
+    value: r::Value,
+    ty: &Type,
+    resolver: &impl Fn(&str) -> Option<&'a TypeDefinition>,
+) -> Result<r::Value, r::Value> {
+    match (ty, value) {
+        // Null values cannot be coerced into non-null types.
+        (Type::NonNullType(_), r::Value::Null) => Err(r::Value::Null),
+
+        // Non-null values may be coercible into non-null types
+        (Type::NonNullType(_), val) => {
+            // We cannot bind `t` in the pattern above because "binding by-move and by-ref in the
+            // same pattern is unstable". Refactor this and the others when Rust fixes this.
+            let t = match ty {
+                Type::NonNullType(ty) => ty,
+                _ => unreachable!(),
+            };
+            coerce_value(val, t, resolver)
+        }
+
+        // Nullable types can be null.
+        (_, r::Value::Null) => Ok(r::Value::Null),
+
+        // Resolve named types, then try to coerce the value into the resolved type
+        (Type::NamedType(_), val) => {
+            let name = match ty {
+                Type::NamedType(name) => name,
+                _ => unreachable!(),
+            };
+            coerce_to_definition(val, name, resolver)
+        }
+
+        // List values are coercible if their values are coercible into the
+        // inner type.
+        (Type::ListType(_), r::Value::List(values)) => {
+            let t = match ty {
+                Type::ListType(ty) => ty,
+                _ => unreachable!(),
+            };
+            let mut coerced_values = vec![];
+
+            // Coerce the list values individually
+            for value in values {
+                coerced_values.push(coerce_value(value, t, resolver)?);
+            }
+
+            Ok(r::Value::List(coerced_values))
+        }
+
+        // Otherwise the list type is not coercible.
+        (Type::ListType(_), value) => Err(value),
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    use graph::prelude::r::Value;
+    use graphql_parser::schema::{EnumType, EnumValue, ScalarType, TypeDefinition};
+    use graphql_parser::Pos;
+
+    use super::coerce_to_definition;
+
+    #[test]
+    fn coercion_using_enum_type_definitions_is_correct() {
+        let enum_type = TypeDefinition::Enum(EnumType {
+            name: "Enum".to_string(),
+            description: None,
+            directives: vec![],
+            position: Pos::default(),
+            values: vec![EnumValue {
+                name: "ValidVariant".to_string(),
+                position: Pos::default(),
+                description: None,
+                directives: vec![],
+            }],
+        });
+        let resolver = |_: &str| Some(&enum_type);
+
+        // We can coerce from Value::Enum -> TypeDefinition::Enum if the variant is valid
+        assert_eq!(
+            coerce_to_definition(Value::Enum("ValidVariant".to_string()), "", &resolver,),
+            Ok(Value::Enum("ValidVariant".to_string()))
+        );
+
+        // We cannot coerce from Value::Enum -> TypeDefinition::Enum if the variant is invalid
+        assert!(
+            coerce_to_definition(Value::Enum("InvalidVariant".to_string()), "", &resolver,)
+                .is_err()
+        );
+
+        // We also support going from Value::String -> TypeDefinition::Scalar(Enum)
+        assert_eq!(
+            coerce_to_definition(Value::String("ValidVariant".to_string()), "", &resolver,),
+            Ok(Value::Enum("ValidVariant".to_string())),
+        );
+
+        // But we don't support invalid variants
+        assert!(
+            coerce_to_definition(Value::String("InvalidVariant".to_string()), "", &resolver,)
+                .is_err()
+        );
+    }
+
+    #[test]
+    fn coercion_using_boolean_type_definitions_is_correct() {
+        let bool_type = TypeDefinition::Scalar(ScalarType {
+            name: "Boolean".to_string(),
+            description: None,
+            directives: vec![],
+            position: Pos::default(),
+        });
+        let resolver = |_: &str| Some(&bool_type);
+
+        // We can coerce from Value::Boolean -> TypeDefinition::Scalar(Boolean)
+        assert_eq!(
+            coerce_to_definition(Value::Boolean(true), "", &resolver),
+            Ok(Value::Boolean(true))
+        );
+        assert_eq!(
+            coerce_to_definition(Value::Boolean(false), "", &resolver),
+            Ok(Value::Boolean(false))
+        );
+
+        // We don't support going from Value::String -> TypeDefinition::Scalar(Boolean)
+        assert!(coerce_to_definition(Value::String("true".to_string()), "", &resolver,).is_err());
+        assert!(coerce_to_definition(Value::String("false".to_string()), "", &resolver,).is_err());
+
+        // We don't support going from Value::Float -> TypeDefinition::Scalar(Boolean)
+        assert!(coerce_to_definition(Value::Float(1.0), "", &resolver).is_err());
+        assert!(coerce_to_definition(Value::Float(0.0), "", &resolver).is_err());
+    }
+
+    #[test]
+    fn coercion_using_big_decimal_type_definitions_is_correct() {
+        let big_decimal_type = TypeDefinition::Scalar(ScalarType::new("BigDecimal".to_string()));
+        let resolver = |_: &str| Some(&big_decimal_type);
+
+        // We can coerce from Value::Float -> TypeDefinition::Scalar(BigDecimal)
+        assert_eq!(
+            coerce_to_definition(Value::Float(23.7), "", &resolver),
+            Ok(Value::String("23.7".to_string()))
+        );
+        assert_eq!(
+            coerce_to_definition(Value::Float(-5.879), "", &resolver),
+            Ok(Value::String("-5.879".to_string()))
+        );
+
+        // We can coerce from Value::String -> TypeDefinition::Scalar(BigDecimal)
+        assert_eq!(
+            coerce_to_definition(Value::String("23.7".to_string()), "", &resolver,),
+            Ok(Value::String("23.7".to_string()))
+        );
+        assert_eq!(
+            coerce_to_definition(Value::String("-5.879".to_string()), "", &resolver,),
+            Ok(Value::String("-5.879".to_string())),
+        );
+
+        // We can coerce from Value::Int -> TypeDefinition::Scalar(BigDecimal)
+        assert_eq!(
+            coerce_to_definition(Value::Int(23.into()), "", &resolver),
+            Ok(Value::String("23".to_string()))
+        );
+        assert_eq!(
+            coerce_to_definition(Value::Int((-5 as i32).into()), "", &resolver,),
+            Ok(Value::String("-5".to_string())),
+        );
+
+        // We don't support going from Value::Boolean -> TypeDefinition::Scalar(Boolean)
+        assert!(coerce_to_definition(Value::Boolean(true), "", &resolver).is_err());
+        assert!(coerce_to_definition(Value::Boolean(false), "", &resolver).is_err());
+    }
+
+    #[test]
+    fn coercion_using_string_type_definitions_is_correct() {
+        let string_type = TypeDefinition::Scalar(ScalarType::new("String".to_string()));
+        let resolver = |_: &str| Some(&string_type);
+
+        // We can coerce from Value::String -> TypeDefinition::Scalar(String)
+        assert_eq!(
+            coerce_to_definition(Value::String("foo".to_string()), "", &resolver,),
+            Ok(Value::String("foo".to_string()))
+        );
+        assert_eq!(
+            coerce_to_definition(Value::String("bar".to_string()), "", &resolver,),
+            Ok(Value::String("bar".to_string()))
+        );
+
+        // We don't support going from Value::Boolean -> TypeDefinition::Scalar(String)
+        assert!(coerce_to_definition(Value::Boolean(true), "", &resolver).is_err());
+        assert!(coerce_to_definition(Value::Boolean(false), "", &resolver).is_err());
+
+        // We don't support going from Value::Float -> TypeDefinition::Scalar(String)
+        assert!(coerce_to_definition(Value::Float(23.7), "", &resolver).is_err());
+        assert!(coerce_to_definition(Value::Float(-5.879), "", &resolver).is_err());
+    }
+
+    #[test]
+    fn coercion_using_id_type_definitions_is_correct() {
+        let string_type = TypeDefinition::Scalar(ScalarType::new("ID".to_owned()));
+        let resolver = |_: &str| Some(&string_type);
+
+        // We can coerce from Value::String -> TypeDefinition::Scalar(ID)
+        assert_eq!(
+            coerce_to_definition(Value::String("foo".to_string()), "", &resolver,),
+            Ok(Value::String("foo".to_string()))
+        );
+        assert_eq!(
+            coerce_to_definition(Value::String("bar".to_string()), "", &resolver,),
+            Ok(Value::String("bar".to_string()))
+        );
+
+        // And also from Value::Int
+        assert_eq!(
+            coerce_to_definition(Value::Int(1234.into()), "", &resolver),
+            Ok(Value::String("1234".to_string()))
+        );
+
+        // We don't support going from Value::Boolean -> TypeDefinition::Scalar(ID)
+        assert!(coerce_to_definition(Value::Boolean(true), "", &resolver).is_err());
+
+        assert!(coerce_to_definition(Value::Boolean(false), "", &resolver).is_err());
+
+        // We don't support going from Value::Float -> TypeDefinition::Scalar(ID)
+        assert!(coerce_to_definition(Value::Float(23.7), "", &resolver).is_err());
+        assert!(coerce_to_definition(Value::Float(-5.879), "", &resolver).is_err());
+    }
+
+    #[test]
+    fn coerce_big_int_scalar() {
+        let big_int_type = TypeDefinition::Scalar(ScalarType::new("BigInt".to_string()));
+        let resolver = |_: &str| Some(&big_int_type);
+
+        // We can coerce from Value::String -> TypeDefinition::Scalar(BigInt)
+        assert_eq!(
+            coerce_to_definition(Value::String("1234".to_string()), "", &resolver,),
+            Ok(Value::String("1234".to_string()))
+        );
+
+        // And also from Value::Int
+        assert_eq!(
+            coerce_to_definition(Value::Int(1234.into()), "", &resolver),
+            Ok(Value::String("1234".to_string()))
+        );
+        assert_eq!(
+            coerce_to_definition(Value::Int((-1234 as i32).into()), "", &resolver,),
+            Ok(Value::String("-1234".to_string()))
+        );
+    }
+
+    #[test]
+    fn coerce_bytes_scalar() {
+        let bytes_type = TypeDefinition::Scalar(ScalarType::new("Bytes".to_string()));
+        let resolver = |_: &str| Some(&bytes_type);
+
+        // We can coerce from Value::String -> TypeDefinition::Scalar(Bytes)
+        assert_eq!(
+            coerce_to_definition(Value::String("0x21f".to_string()), "", &resolver,),
+            Ok(Value::String("0x21f".to_string()))
+        );
+    }
+
+    #[test]
+    fn coerce_int_scalar() {
+        let int_type = TypeDefinition::Scalar(ScalarType::new("Int".to_string()));
+        let resolver = |_: &str| Some(&int_type);
+
+        assert_eq!(
+            coerce_to_definition(Value::Int(13289123.into()), "", &resolver,),
+            Ok(Value::Int(13289123.into()))
+        );
+        assert_eq!(
+            coerce_to_definition(Value::Int((-13289123 as i32).into()), "", &resolver,),
+            Ok(Value::Int((-13289123 as i32).into()))
+        );
+    }
+}
diff --git a/graphql/src/values/mod.rs b/graphql/src/values/mod.rs
new file mode 100644
index 0000000..db78a5b
--- /dev/null
+++ b/graphql/src/values/mod.rs
@@ -0,0 +1,4 @@
+/// Utilities for coercing GraphQL values based on GraphQL types.
+pub mod coercion;
+
+pub use self::coercion::MaybeCoercible;
diff --git a/graphql/tests/introspection.rs b/graphql/tests/introspection.rs
new file mode 100644
index 0000000..1056684
--- /dev/null
+++ b/graphql/tests/introspection.rs
@@ -0,0 +1,1286 @@
+#[macro_use]
+extern crate pretty_assertions;
+
+use std::sync::Arc;
+
+use graph::data::graphql::{object, object_value, ObjectOrInterface};
+use graph::data::query::Trace;
+use graph::prelude::{
+    async_trait, o, r, s, slog, tokio, ApiSchema, DeploymentHash, Logger, Query,
+    QueryExecutionError, QueryResult, Schema,
+};
+use graph_graphql::prelude::{
+    a, api_schema, execute_query, ExecutionContext, Query as PreparedQuery, QueryExecutionOptions,
+    Resolver,
+};
+use test_store::graphql_metrics;
+use test_store::LOAD_MANAGER;
+
+/// Mock resolver used in tests that don't need a resolver.
+#[derive(Clone)]
+pub struct MockResolver;
+
+#[async_trait]
+impl Resolver for MockResolver {
+    const CACHEABLE: bool = false;
+
+    fn prefetch(
+        &self,
+        _: &ExecutionContext<Self>,
+        _: &a::SelectionSet,
+    ) -> Result<(Option<r::Value>, Trace), Vec<QueryExecutionError>> {
+        Ok((None, Trace::None))
+    }
+
+    async fn resolve_objects(
+        &self,
+        _: Option<r::Value>,
+        _field: &a::Field,
+        _field_definition: &s::Field,
+        _object_type: ObjectOrInterface<'_>,
+    ) -> Result<r::Value, QueryExecutionError> {
+        Ok(r::Value::Null)
+    }
+
+    async fn resolve_object(
+        &self,
+        __: Option<r::Value>,
+        _field: &a::Field,
+        _field_definition: &s::Field,
+        _object_type: ObjectOrInterface<'_>,
+    ) -> Result<r::Value, QueryExecutionError> {
+        Ok(r::Value::Null)
+    }
+
+    async fn query_permit(&self) -> Result<tokio::sync::OwnedSemaphorePermit, QueryExecutionError> {
+        Ok(Arc::new(tokio::sync::Semaphore::new(1))
+            .acquire_owned()
+            .await
+            .unwrap())
+    }
+}
+
+/// Creates a basic GraphQL schema that exercies scalars, directives,
+/// enums, interfaces, input objects, object types and field arguments.
+fn mock_schema() -> Schema {
+    Schema::parse(
+        "
+             scalar ID
+             scalar Int
+             scalar String
+             scalar Boolean
+
+             directive @language(
+               language: String = \"English\"
+             ) on FIELD_DEFINITION
+
+             enum Role {
+               USER
+               ADMIN
+             }
+
+             interface Node {
+               id: ID!
+             }
+
+             type User implements Node @entity {
+               id: ID!
+               name: String! @language(language: \"English\")
+               role: Role!
+             }
+
+             enum User_orderBy {
+               id
+               name
+             }
+
+             input User_filter {
+               name_eq: String = \"default name\",
+               name_not: String,
+             }
+
+             type Query @entity {
+               allUsers(orderBy: User_orderBy, filter: User_filter): [User!]
+               anyUserWithAge(age: Int = 99): User
+               User: User
+             }
+             ",
+        DeploymentHash::new("mockschema").unwrap(),
+    )
+    .unwrap()
+}
+
+/// Builds the expected result for GraphiQL's introspection query that we are
+/// using for testing.
+fn expected_mock_schema_introspection() -> r::Value {
+    let string_type = object! {
+        kind: r::Value::Enum("SCALAR".to_string()),
+        name: "String",
+        description: r::Value::Null,
+        fields: r::Value::Null,
+        inputFields: r::Value::Null,
+        interfaces: r::Value::Null,
+        enumValues: r::Value::Null,
+        possibleTypes: r::Value::Null,
+    };
+
+    let id_type = object! {
+        kind: r::Value::Enum("SCALAR".to_string()),
+        name: "ID",
+        description: r::Value::Null,
+        fields: r::Value::Null,
+        inputFields: r::Value::Null,
+        interfaces: r::Value::Null,
+        enumValues: r::Value::Null,
+        possibleTypes: r::Value::Null,
+    };
+
+    let int_type = object! {
+        kind: r::Value::Enum("SCALAR".to_string()),
+        name: "Int",
+        description: r::Value::Null,
+        fields: r::Value::Null,
+        inputFields: r::Value::Null,
+        interfaces: r::Value::Null,
+        enumValues: r::Value::Null,
+        possibleTypes: r::Value::Null,
+    };
+
+    let boolean_type = object! {
+        kind: r::Value::Enum("SCALAR".to_string()),
+        name: "Boolean",
+        description: r::Value::Null,
+        fields: r::Value::Null,
+        inputFields: r::Value::Null,
+        interfaces: r::Value::Null,
+        enumValues: r::Value::Null,
+        possibleTypes: r::Value::Null,
+    };
+
+    let role_type = object! {
+        kind: r::Value::Enum("ENUM".to_string()),
+        name: "Role",
+        description: r::Value::Null,
+        fields: r::Value::Null,
+        inputFields: r::Value::Null,
+        interfaces: r::Value::Null,
+        enumValues:
+            r::Value::List(vec![
+                object! {
+                    name: "USER",
+                    description: r::Value::Null,
+                    isDeprecated: r::Value::Boolean(false),
+                    deprecationReason: r::Value::Null,
+                },
+                object! {
+                    name: "ADMIN",
+                    description: r::Value::Null,
+                    isDeprecated: false,
+                    deprecationReason: r::Value::Null,
+                },
+            ]),
+        possibleTypes: r::Value::Null,
+    };
+
+    let node_type = object_value(vec![
+        ("kind", r::Value::Enum("INTERFACE".to_string())),
+        ("name", r::Value::String("Node".to_string())),
+        ("description", r::Value::Null),
+        (
+            "fields",
+            r::Value::List(vec![object_value(vec![
+                ("name", r::Value::String("id".to_string())),
+                ("description", r::Value::Null),
+                ("args", r::Value::List(vec![])),
+                (
+                    "type",
+                    object_value(vec![
+                        ("kind", r::Value::Enum("NON_NULL".to_string())),
+                        ("name", r::Value::Null),
+                        (
+                            "ofType",
+                            object_value(vec![
+                                ("kind", r::Value::Enum("SCALAR".to_string())),
+                                ("name", r::Value::String("ID".to_string())),
+                                ("ofType", r::Value::Null),
+                            ]),
+                        ),
+                    ]),
+                ),
+                ("isDeprecated", r::Value::Boolean(false)),
+                ("deprecationReason", r::Value::Null),
+            ])]),
+        ),
+        ("inputFields", r::Value::Null),
+        ("interfaces", r::Value::Null),
+        ("enumValues", r::Value::Null),
+        (
+            "possibleTypes",
+            r::Value::List(vec![object_value(vec![
+                ("kind", r::Value::Enum("OBJECT".to_string())),
+                ("name", r::Value::String("User".to_string())),
+                ("ofType", r::Value::Null),
+            ])]),
+        ),
+    ]);
+
+    let user_orderby_type = object_value(vec![
+        ("kind", r::Value::Enum("ENUM".to_string())),
+        ("name", r::Value::String("User_orderBy".to_string())),
+        ("description", r::Value::Null),
+        ("fields", r::Value::Null),
+        ("inputFields", r::Value::Null),
+        ("interfaces", r::Value::Null),
+        (
+            "enumValues",
+            r::Value::List(vec![
+                object_value(vec![
+                    ("name", r::Value::String("id".to_string())),
+                    ("description", r::Value::Null),
+                    ("isDeprecated", r::Value::Boolean(false)),
+                    ("deprecationReason", r::Value::Null),
+                ]),
+                object_value(vec![
+                    ("name", r::Value::String("name".to_string())),
+                    ("description", r::Value::Null),
+                    ("isDeprecated", r::Value::Boolean(false)),
+                    ("deprecationReason", r::Value::Null),
+                ]),
+            ]),
+        ),
+        ("possibleTypes", r::Value::Null),
+    ]);
+
+    let user_filter_type = object_value(vec![
+        ("kind", r::Value::Enum("INPUT_OBJECT".to_string())),
+        ("name", r::Value::String("User_filter".to_string())),
+        ("description", r::Value::Null),
+        ("fields", r::Value::Null),
+        (
+            "inputFields",
+            r::Value::List(vec![
+                object_value(vec![
+                    ("name", r::Value::String("name_eq".to_string())),
+                    ("description", r::Value::Null),
+                    (
+                        "type",
+                        object_value(vec![
+                            ("kind", r::Value::Enum("SCALAR".to_string())),
+                            ("name", r::Value::String("String".to_string())),
+                            ("ofType", r::Value::Null),
+                        ]),
+                    ),
+                    (
+                        "defaultValue",
+                        r::Value::String("\"default name\"".to_string()),
+                    ),
+                ]),
+                object_value(vec![
+                    ("name", r::Value::String("name_not".to_string())),
+                    ("description", r::Value::Null),
+                    (
+                        "type",
+                        object_value(vec![
+                            ("kind", r::Value::Enum("SCALAR".to_string())),
+                            ("name", r::Value::String("String".to_string())),
+                            ("ofType", r::Value::Null),
+                        ]),
+                    ),
+                    ("defaultValue", r::Value::Null),
+                ]),
+            ]),
+        ),
+        ("interfaces", r::Value::Null),
+        ("enumValues", r::Value::Null),
+        ("possibleTypes", r::Value::Null),
+    ]);
+
+    let user_type = object_value(vec![
+        ("kind", r::Value::Enum("OBJECT".to_string())),
+        ("name", r::Value::String("User".to_string())),
+        ("description", r::Value::Null),
+        (
+            "fields",
+            r::Value::List(vec![
+                object_value(vec![
+                    ("name", r::Value::String("id".to_string())),
+                    ("description", r::Value::Null),
+                    ("args", r::Value::List(vec![])),
+                    (
+                        "type",
+                        object_value(vec![
+                            ("kind", r::Value::Enum("NON_NULL".to_string())),
+                            ("name", r::Value::Null),
+                            (
+                                "ofType",
+                                object_value(vec![
+                                    ("kind", r::Value::Enum("SCALAR".to_string())),
+                                    ("name", r::Value::String("ID".to_string())),
+                                    ("ofType", r::Value::Null),
+                                ]),
+                            ),
+                        ]),
+                    ),
+                    ("isDeprecated", r::Value::Boolean(false)),
+                    ("deprecationReason", r::Value::Null),
+                ]),
+                object_value(vec![
+                    ("name", r::Value::String("name".to_string())),
+                    ("description", r::Value::Null),
+                    ("args", r::Value::List(vec![])),
+                    (
+                        "type",
+                        object_value(vec![
+                            ("kind", r::Value::Enum("NON_NULL".to_string())),
+                            ("name", r::Value::Null),
+                            (
+                                "ofType",
+                                object_value(vec![
+                                    ("kind", r::Value::Enum("SCALAR".to_string())),
+                                    ("name", r::Value::String("String".to_string())),
+                                    ("ofType", r::Value::Null),
+                                ]),
+                            ),
+                        ]),
+                    ),
+                    ("isDeprecated", r::Value::Boolean(false)),
+                    ("deprecationReason", r::Value::Null),
+                ]),
+                object_value(vec![
+                    ("name", r::Value::String("role".to_string())),
+                    ("description", r::Value::Null),
+                    ("args", r::Value::List(vec![])),
+                    (
+                        "type",
+                        object_value(vec![
+                            ("kind", r::Value::Enum("NON_NULL".to_string())),
+                            ("name", r::Value::Null),
+                            (
+                                "ofType",
+                                object_value(vec![
+                                    ("kind", r::Value::Enum("ENUM".to_string())),
+                                    ("name", r::Value::String("Role".to_string())),
+                                    ("ofType", r::Value::Null),
+                                ]),
+                            ),
+                        ]),
+                    ),
+                    ("isDeprecated", r::Value::Boolean(false)),
+                    ("deprecationReason", r::Value::Null),
+                ]),
+            ]),
+        ),
+        ("inputFields", r::Value::Null),
+        (
+            "interfaces",
+            r::Value::List(vec![object_value(vec![
+                ("kind", r::Value::Enum("INTERFACE".to_string())),
+                ("name", r::Value::String("Node".to_string())),
+                ("ofType", r::Value::Null),
+            ])]),
+        ),
+        ("enumValues", r::Value::Null),
+        ("possibleTypes", r::Value::Null),
+    ]);
+
+    let query_type = object_value(vec![
+        ("kind", r::Value::Enum("OBJECT".to_string())),
+        ("name", r::Value::String("Query".to_string())),
+        ("description", r::Value::Null),
+        (
+            "fields",
+            r::Value::List(vec![
+                object_value(vec![
+                    ("name", r::Value::String("allUsers".to_string())),
+                    ("description", r::Value::Null),
+                    (
+                        "args",
+                        r::Value::List(vec![
+                            object_value(vec![
+                                ("name", r::Value::String("orderBy".to_string())),
+                                ("description", r::Value::Null),
+                                (
+                                    "type",
+                                    object_value(vec![
+                                        ("kind", r::Value::Enum("ENUM".to_string())),
+                                        ("name", r::Value::String("User_orderBy".to_string())),
+                                        ("ofType", r::Value::Null),
+                                    ]),
+                                ),
+                                ("defaultValue", r::Value::Null),
+                            ]),
+                            object_value(vec![
+                                ("name", r::Value::String("filter".to_string())),
+                                ("description", r::Value::Null),
+                                (
+                                    "type",
+                                    object_value(vec![
+                                        ("kind", r::Value::Enum("INPUT_OBJECT".to_string())),
+                                        ("name", r::Value::String("User_filter".to_string())),
+                                        ("ofType", r::Value::Null),
+                                    ]),
+                                ),
+                                ("defaultValue", r::Value::Null),
+                            ]),
+                        ]),
+                    ),
+                    (
+                        "type",
+                        object_value(vec![
+                            ("kind", r::Value::Enum("LIST".to_string())),
+                            ("name", r::Value::Null),
+                            (
+                                "ofType",
+                                object_value(vec![
+                                    ("kind", r::Value::Enum("NON_NULL".to_string())),
+                                    ("name", r::Value::Null),
+                                    (
+                                        "ofType",
+                                        object_value(vec![
+                                            ("kind", r::Value::Enum("OBJECT".to_string())),
+                                            ("name", r::Value::String("User".to_string())),
+                                            ("ofType", r::Value::Null),
+                                        ]),
+                                    ),
+                                ]),
+                            ),
+                        ]),
+                    ),
+                    ("isDeprecated", r::Value::Boolean(false)),
+                    ("deprecationReason", r::Value::Null),
+                ]),
+                object_value(vec![
+                    ("name", r::Value::String("anyUserWithAge".to_string())),
+                    ("description", r::Value::Null),
+                    (
+                        "args",
+                        r::Value::List(vec![object_value(vec![
+                            ("name", r::Value::String("age".to_string())),
+                            ("description", r::Value::Null),
+                            (
+                                "type",
+                                object_value(vec![
+                                    ("kind", r::Value::Enum("SCALAR".to_string())),
+                                    ("name", r::Value::String("Int".to_string())),
+                                    ("ofType", r::Value::Null),
+                                ]),
+                            ),
+                            ("defaultValue", r::Value::String("99".to_string())),
+                        ])]),
+                    ),
+                    (
+                        "type",
+                        object_value(vec![
+                            ("kind", r::Value::Enum("OBJECT".to_string())),
+                            ("name", r::Value::String("User".to_string())),
+                            ("ofType", r::Value::Null),
+                        ]),
+                    ),
+                    ("isDeprecated", r::Value::Boolean(false)),
+                    ("deprecationReason", r::Value::Null),
+                ]),
+                object_value(vec![
+                    ("name", r::Value::String("User".to_string())),
+                    ("description", r::Value::Null),
+                    ("args", r::Value::List(vec![])),
+                    (
+                        "type",
+                        object_value(vec![
+                            ("kind", r::Value::Enum("OBJECT".to_string())),
+                            ("name", r::Value::String("User".to_string())),
+                            ("ofType", r::Value::Null),
+                        ]),
+                    ),
+                    ("isDeprecated", r::Value::Boolean(false)),
+                    ("deprecationReason", r::Value::Null),
+                ]),
+            ]),
+        ),
+        ("inputFields", r::Value::Null),
+        ("interfaces", r::Value::List(vec![])),
+        ("enumValues", r::Value::Null),
+        ("possibleTypes", r::Value::Null),
+    ]);
+
+    let expected_types = r::Value::List(vec![
+        boolean_type,
+        id_type,
+        int_type,
+        node_type,
+        query_type,
+        role_type,
+        string_type,
+        user_type,
+        user_filter_type,
+        user_orderby_type,
+    ]);
+
+    let expected_directives = r::Value::List(vec![object_value(vec![
+        ("name", r::Value::String("language".to_string())),
+        ("description", r::Value::Null),
+        (
+            "locations",
+            r::Value::List(vec![r::Value::Enum(String::from("FIELD_DEFINITION"))]),
+        ),
+        (
+            "args",
+            r::Value::List(vec![object_value(vec![
+                ("name", r::Value::String("language".to_string())),
+                ("description", r::Value::Null),
+                (
+                    "type",
+                    object_value(vec![
+                        ("kind", r::Value::Enum("SCALAR".to_string())),
+                        ("name", r::Value::String("String".to_string())),
+                        ("ofType", r::Value::Null),
+                    ]),
+                ),
+                ("defaultValue", r::Value::String("\"English\"".to_string())),
+            ])]),
+        ),
+    ])]);
+
+    let schema_type = object_value(vec![
+        (
+            "queryType",
+            object_value(vec![("name", r::Value::String("Query".to_string()))]),
+        ),
+        ("mutationType", r::Value::Null),
+        ("subscriptionType", r::Value::Null),
+        ("types", expected_types),
+        ("directives", expected_directives),
+    ]);
+
+    object_value(vec![("__schema", schema_type)])
+}
+
+/// Execute an introspection query.
+async fn introspection_query(schema: Schema, query: &str) -> QueryResult {
+    // Create the query
+    let query = Query::new(
+        graphql_parser::parse_query(query).unwrap().into_static(),
+        None,
+    );
+
+    // Execute it
+    let logger = Logger::root(slog::Discard, o!());
+    let options = QueryExecutionOptions {
+        resolver: MockResolver,
+        deadline: None,
+        max_first: std::u32::MAX,
+        max_skip: std::u32::MAX,
+        load_manager: LOAD_MANAGER.clone(),
+    };
+
+    let schema = Arc::new(ApiSchema::from_api_schema(schema).unwrap());
+    let result =
+        match PreparedQuery::new(&logger, schema, None, query, None, 100, graphql_metrics()) {
+            Ok(query) => {
+                Ok(Arc::try_unwrap(execute_query(query, None, None, options).await).unwrap())
+            }
+            Err(e) => Err(e),
+        };
+    QueryResult::from(result)
+}
+
+#[tokio::test]
+async fn satisfies_graphiql_introspection_query_without_fragments() {
+    let result = introspection_query(
+        mock_schema(),
+        "
+      query IntrospectionQuery {
+        __schema {
+          queryType { name }
+          mutationType { name }
+          subscriptionType { name}
+          types {
+            kind
+            name
+            description
+            fields(includeDeprecated: true) {
+              name
+              description
+              args {
+                name
+                description
+                type {
+                  kind
+                  name
+                  ofType {
+                    kind
+                    name
+                    ofType {
+                      kind
+                      name
+                      ofType {
+                        kind
+                        name
+                        ofType {
+                          kind
+                          name
+                          ofType {
+                            kind
+                            name
+                            ofType {
+                              kind
+                              name
+                              ofType {
+                                kind
+                                name
+                              }
+                            }
+                          }
+                        }
+                      }
+                    }
+                  }
+                }
+                defaultValue
+              }
+              type {
+                kind
+                name
+                ofType {
+                  kind
+                  name
+                  ofType {
+                    kind
+                    name
+                    ofType {
+                      kind
+                      name
+                      ofType {
+                        kind
+                        name
+                        ofType {
+                          kind
+                          name
+                          ofType {
+                            kind
+                            name
+                            ofType {
+                              kind
+                              name
+                            }
+                          }
+                        }
+                      }
+                    }
+                  }
+                }
+              }
+              isDeprecated
+              deprecationReason
+            }
+            inputFields {
+              name
+              description
+              type {
+                kind
+                name
+                ofType {
+                  kind
+                  name
+                  ofType {
+                    kind
+                    name
+                    ofType {
+                      kind
+                      name
+                      ofType {
+                        kind
+                        name
+                        ofType {
+                          kind
+                          name
+                          ofType {
+                            kind
+                            name
+                            ofType {
+                              kind
+                              name
+                            }
+                          }
+                        }
+                      }
+                    }
+                  }
+                }
+              }
+              defaultValue
+            }
+            interfaces {
+              kind
+              name
+              ofType {
+                kind
+                name
+                ofType {
+                  kind
+                  name
+                  ofType {
+                    kind
+                    name
+                    ofType {
+                      kind
+                      name
+                      ofType {
+                        kind
+                        name
+                        ofType {
+                          kind
+                          name
+                          ofType {
+                            kind
+                            name
+                          }
+                        }
+                      }
+                    }
+                  }
+                }
+              }
+            }
+            enumValues(includeDeprecated: true) {
+              name
+              description
+              isDeprecated
+              deprecationReason
+            }
+            possibleTypes {
+              kind
+              name
+              ofType {
+                kind
+                name
+                ofType {
+                  kind
+                  name
+                  ofType {
+                    kind
+                    name
+                    ofType {
+                      kind
+                      name
+                      ofType {
+                        kind
+                        name
+                        ofType {
+                          kind
+                          name
+                          ofType {
+                            kind
+                            name
+                          }
+                        }
+                      }
+                    }
+                  }
+                }
+              }
+           }
+          }
+          directives {
+            name
+            description
+            locations
+            args {
+              name
+              description
+              type {
+                kind
+                name
+                ofType {
+                  kind
+                  name
+                  ofType {
+                    kind
+                    name
+                    ofType {
+                      kind
+                      name
+                      ofType {
+                        kind
+                        name
+                        ofType {
+                          kind
+                          name
+                          ofType {
+                            kind
+                            name
+                            ofType {
+                              kind
+                              name
+                            }
+                          }
+                        }
+                      }
+                    }
+                  }
+                }
+              }
+              defaultValue
+            }
+          }
+        }
+      }
+    ",
+    )
+    .await;
+
+    let data = result
+        .to_result()
+        .expect("Introspection query returned no result")
+        .unwrap();
+    assert_eq!(data, expected_mock_schema_introspection());
+}
+
+#[tokio::test]
+async fn satisfies_graphiql_introspection_query_with_fragments() {
+    let result = introspection_query(
+        mock_schema(),
+        "
+      query IntrospectionQuery {
+        __schema {
+          queryType { name }
+          mutationType { name }
+          subscriptionType { name }
+          types {
+            ...FullType
+          }
+          directives {
+            name
+            description
+            locations
+            args {
+              ...InputValue
+            }
+          }
+        }
+      }
+
+      fragment FullType on __Type {
+        kind
+        name
+        description
+        fields(includeDeprecated: true) {
+          name
+          description
+          args {
+            ...InputValue
+          }
+          type {
+            ...TypeRef
+          }
+          isDeprecated
+          deprecationReason
+        }
+        inputFields {
+          ...InputValue
+        }
+        interfaces {
+          ...TypeRef
+        }
+        enumValues(includeDeprecated: true) {
+          name
+          description
+          isDeprecated
+          deprecationReason
+        }
+        possibleTypes {
+          ...TypeRef
+        }
+      }
+
+      fragment InputValue on __InputValue {
+        name
+        description
+        type { ...TypeRef }
+        defaultValue
+      }
+
+      fragment TypeRef on __Type {
+        kind
+        name
+        ofType {
+          kind
+          name
+          ofType {
+            kind
+            name
+            ofType {
+              kind
+              name
+              ofType {
+                kind
+                name
+                ofType {
+                  kind
+                  name
+                  ofType {
+                    kind
+                    name
+                    ofType {
+                      kind
+                      name
+                    }
+                  }
+                }
+              }
+            }
+          }
+        }
+      }
+    ",
+    )
+    .await;
+
+    let data = result
+        .to_result()
+        .expect("Introspection query returned no result")
+        .unwrap();
+    assert_eq!(data, expected_mock_schema_introspection());
+}
+
+const COMPLEX_SCHEMA: &str = "
+enum RegEntryStatus {
+  regEntry_status_challengePeriod
+  regEntry_status_commitPeriod
+  regEntry_status_revealPeriod
+  regEntry_status_blacklisted
+  regEntry_status_whitelisted
+}
+
+interface RegEntry {
+  regEntry_address: ID
+  regEntry_version: Int
+  regEntry_status: RegEntryStatus
+  regEntry_creator: User
+  regEntry_deposit: Int
+  regEntry_createdOn: String
+  regEntry_challengePeriodEnd: String
+  challenge_challenger: User
+  challenge_createdOn: String
+  challenge_comment: String
+  challenge_votingToken: String
+  challenge_rewardPool: Int
+  challenge_commitPeriodEnd: String
+  challenge_revealPeriodEnd: String
+  challenge_votesFor: Int
+  challenge_votesAgainst: Int
+  challenge_votesTotal: Int
+  challenge_claimedRewardOn: String
+  challenge_vote(vote_voter: ID!): Vote
+}
+
+enum VoteOption {
+  voteOption_noVote
+  voteOption_voteFor
+  voteOption_voteAgainst
+}
+
+type Vote @entity {
+  vote_secretHash: String
+  vote_option: VoteOption
+  vote_amount: Int
+  vote_revealedOn: String
+  vote_claimedRewardOn: String
+  vote_reward: Int
+}
+
+type Meme implements RegEntry @entity {
+  regEntry_address: ID
+  regEntry_version: Int
+  regEntry_status: RegEntryStatus
+  regEntry_creator: User
+  regEntry_deposit: Int
+  regEntry_createdOn: String
+  regEntry_challengePeriodEnd: String
+  challenge_challenger: User
+  challenge_createdOn: String
+  challenge_comment: String
+  challenge_votingToken: String
+  challenge_rewardPool: Int
+  challenge_commitPeriodEnd: String
+  challenge_revealPeriodEnd: String
+  challenge_votesFor: Int
+  challenge_votesAgainst: Int
+  challenge_votesTotal: Int
+  challenge_claimedRewardOn: String
+  challenge_vote(vote_voter: ID!): Vote
+  # Balance of voting token of a voter. This is client-side only, server doesn't return this
+  challenge_availableVoteAmount(voter: ID!): Int
+  meme_title: String
+  meme_number: Int
+  meme_metaHash: String
+  meme_imageHash: String
+  meme_totalSupply: Int
+  meme_totalMinted: Int
+  meme_tokenIdStart: Int
+  meme_totalTradeVolume: Int
+  meme_totalTradeVolumeRank: Int
+  meme_ownedMemeTokens(owner: String): [MemeToken]
+  meme_tags: [Tag]
+}
+
+type Tag  @entity {
+  tag_id: ID
+  tag_name: String
+}
+
+type MemeToken @entity {
+  memeToken_tokenId: ID
+  memeToken_number: Int
+  memeToken_owner: User
+  memeToken_meme: Meme
+}
+
+enum MemeAuctionStatus {
+  memeAuction_status_active
+  memeAuction_status_canceled
+  memeAuction_status_done
+}
+
+type MemeAuction @entity {
+  memeAuction_address: ID
+  memeAuction_seller: User
+  memeAuction_buyer: User
+  memeAuction_startPrice: Int
+  memeAuction_endPrice: Int
+  memeAuction_duration: Int
+  memeAuction_startedOn: String
+  memeAuction_boughtOn: String
+  memeAuction_status: MemeAuctionStatus
+  memeAuction_memeToken: MemeToken
+}
+
+type ParamChange implements RegEntry @entity {
+  regEntry_address: ID
+  regEntry_version: Int
+  regEntry_status: RegEntryStatus
+  regEntry_creator: User
+  regEntry_deposit: Int
+  regEntry_createdOn: String
+  regEntry_challengePeriodEnd: String
+  challenge_challenger: User
+  challenge_createdOn: String
+  challenge_comment: String
+  challenge_votingToken: String
+  challenge_rewardPool: Int
+  challenge_commitPeriodEnd: String
+  challenge_revealPeriodEnd: String
+  challenge_votesFor: Int
+  challenge_votesAgainst: Int
+  challenge_votesTotal: Int
+  challenge_claimedRewardOn: String
+  challenge_vote(vote_voter: ID!): Vote
+  # Balance of voting token of a voter. This is client-side only, server doesn't return this
+  challenge_availableVoteAmount(voter: ID!): Int
+  paramChange_db: String
+  paramChange_key: String
+  paramChange_value: Int
+  paramChange_originalValue: Int
+  paramChange_appliedOn: String
+}
+
+type User @entity {
+  # Ethereum address of an user
+  user_address: ID
+  # Total number of memes submitted by user
+  user_totalCreatedMemes: Int
+  # Total number of memes submitted by user, which successfully got into TCR
+  user_totalCreatedMemesWhitelisted: Int
+  # Largest sale creator has done with his newly minted meme
+  user_creatorLargestSale: MemeAuction
+  # Position of a creator in leaderboard according to user_totalCreatedMemesWhitelisted
+  user_creatorRank: Int
+  # Amount of meme tokenIds owned by user
+  user_totalCollectedTokenIds: Int
+  # Amount of unique memes owned by user
+  user_totalCollectedMemes: Int
+  # Largest auction user sold, in terms of price
+  user_largestSale: MemeAuction
+  # Largest auction user bought into, in terms of price
+  user_largestBuy: MemeAuction
+  # Amount of challenges user created
+  user_totalCreatedChallenges: Int
+  # Amount of challenges user created and ended up in his favor
+  user_totalCreatedChallengesSuccess: Int
+  # Total amount of DANK token user received from challenger rewards
+  user_challengerTotalEarned: Int
+  # Total amount of DANK token user received from challenger rewards
+  user_challengerRank: Int
+  # Amount of different votes user participated in
+  user_totalParticipatedVotes: Int
+  # Amount of different votes user voted for winning option
+  user_totalParticipatedVotesSuccess: Int
+  # Amount of DANK token user received for voting for winning option
+  user_voterTotalEarned: Int
+  # Position of voter in leaderboard according to user_voterTotalEarned
+  user_voterRank: Int
+  # Sum of user_challengerTotalEarned and user_voterTotalEarned
+  user_curatorTotalEarned: Int
+  # Position of curator in leaderboard according to user_curatorTotalEarned
+  user_curatorRank: Int
+}
+
+type Parameter @entity {
+  param_db: ID
+  param_key: ID
+  param_value: Int
+}
+";
+
+#[tokio::test]
+async fn successfully_runs_introspection_query_against_complex_schema() {
+    let mut schema = Schema::parse(
+        COMPLEX_SCHEMA,
+        DeploymentHash::new("complexschema").unwrap(),
+    )
+    .unwrap();
+    schema.document = api_schema(&schema.document).unwrap();
+
+    let result = introspection_query(
+        schema.clone(),
+        "
+        query IntrospectionQuery {
+          __schema {
+            queryType { name }
+            mutationType { name }
+            subscriptionType { name }
+            types {
+              ...FullType
+            }
+            directives {
+              name
+              description
+              locations
+              args {
+                ...InputValue
+              }
+            }
+          }
+        }
+
+        fragment FullType on __Type {
+          kind
+          name
+          description
+          fields(includeDeprecated: true) {
+            name
+            description
+            args {
+              ...InputValue
+            }
+            type {
+              ...TypeRef
+            }
+            isDeprecated
+            deprecationReason
+          }
+          inputFields {
+            ...InputValue
+          }
+          interfaces {
+            ...TypeRef
+          }
+          enumValues(includeDeprecated: true) {
+            name
+            description
+            isDeprecated
+            deprecationReason
+          }
+          possibleTypes {
+            ...TypeRef
+          }
+        }
+
+        fragment InputValue on __InputValue {
+          name
+          description
+          type { ...TypeRef }
+          defaultValue
+        }
+
+        fragment TypeRef on __Type {
+          kind
+          name
+          ofType {
+            kind
+            name
+            ofType {
+              kind
+              name
+              ofType {
+                kind
+                name
+                ofType {
+                  kind
+                  name
+                  ofType {
+                    kind
+                    name
+                    ofType {
+                      kind
+                      name
+                      ofType {
+                        kind
+                        name
+                      }
+                    }
+                  }
+                }
+              }
+            }
+          }
+        }
+    ",
+    )
+    .await;
+
+    assert!(!result.has_errors(), "{:#?}", result);
+}
+
+#[tokio::test]
+async fn introspection_possible_types() {
+    let mut schema = Schema::parse(
+        COMPLEX_SCHEMA,
+        DeploymentHash::new("complexschema").unwrap(),
+    )
+    .unwrap();
+    schema.document = api_schema(&schema.document).unwrap();
+
+    // Test "possibleTypes" introspection in interfaces
+    let response = introspection_query(
+        schema,
+        "query {
+          __type(name: \"RegEntry\") {
+              name
+              possibleTypes {
+                name
+              }
+          }
+        }",
+    )
+    .await
+    .to_result()
+    .unwrap()
+    .unwrap();
+
+    assert_eq!(
+        response,
+        object_value(vec![(
+            "__type",
+            object_value(vec![
+                ("name", r::Value::String("RegEntry".to_string())),
+                (
+                    "possibleTypes",
+                    r::Value::List(vec![
+                        object_value(vec![("name", r::Value::String("Meme".to_owned()))]),
+                        object_value(vec![("name", r::Value::String("ParamChange".to_owned()))])
+                    ])
+                )
+            ])
+        )])
+    )
+}
diff --git a/graphql/tests/query.rs b/graphql/tests/query.rs
new file mode 100644
index 0000000..0c0b01d
--- /dev/null
+++ b/graphql/tests/query.rs
@@ -0,0 +1,2125 @@
+#[macro_use]
+extern crate pretty_assertions;
+
+use graph::components::store::{EntityKey, EntityType};
+use graph::data::subgraph::schema::DeploymentCreate;
+use graph::entity;
+use graph::prelude::SubscriptionResult;
+use graphql_parser::Pos;
+use std::iter::FromIterator;
+use std::sync::atomic::{AtomicBool, Ordering};
+use std::sync::Arc;
+use std::time::{Duration, Instant};
+use std::{
+    collections::{BTreeSet, HashMap},
+    marker::PhantomData,
+};
+
+use graph::{
+    components::store::DeploymentLocator,
+    data::graphql::{object, object_value},
+    data::subgraph::schema::SubgraphError,
+    data::{
+        query::{QueryResults, QueryTarget},
+        subgraph::SubgraphFeature,
+    },
+    prelude::{
+        futures03::stream::StreamExt, lazy_static, o, q, r, serde_json, slog, BlockPtr,
+        DeploymentHash, Entity, EntityOperation, FutureExtension, GraphQlRunner as _, Logger,
+        NodeId, Query, QueryError, QueryExecutionError, QueryResult, QueryStoreManager,
+        QueryVariables, Schema, SubgraphManifest, SubgraphName, SubgraphStore,
+        SubgraphVersionSwitchingMode, Subscription, SubscriptionError,
+    },
+    semver::Version,
+};
+use graph_graphql::{prelude::*, subscription::execute_subscription};
+use test_store::{
+    deployment_state, execute_subgraph_query_with_deadline, graphql_metrics, revert_block,
+    run_test_sequentially, transact_errors, Store, BLOCK_ONE, GENESIS_PTR, LOAD_MANAGER, LOGGER,
+    METRICS_REGISTRY, STORE, SUBSCRIPTION_MANAGER,
+};
+
+const NETWORK_NAME: &str = "fake_network";
+const SONGS_STRING: [&str; 5] = ["s0", "s1", "s2", "s3", "s4"];
+const SONGS_BYTES: [&str; 5] = ["0xf0", "0xf1", "0xf2", "0xf3", "0xf4"];
+const MEDIA_STRING: [&str; 7] = ["md0", "md1", "md2", "md3", "md4", "md5", "md6"];
+const MEDIA_BYTES: [&str; 7] = ["0xf0", "0xf1", "0xf2", "0xf3", "0xf4", "0xf5", "0xf6"];
+
+#[derive(Clone, Copy, Debug)]
+enum IdType {
+    String,
+    #[allow(dead_code)]
+    Bytes,
+}
+
+impl IdType {
+    fn songs(&self) -> &[&str] {
+        match self {
+            IdType::String => SONGS_STRING.as_slice(),
+            IdType::Bytes => SONGS_BYTES.as_slice(),
+        }
+    }
+
+    fn medias(&self) -> &[&str] {
+        match self {
+            IdType::String => MEDIA_STRING.as_slice(),
+            IdType::Bytes => MEDIA_BYTES.as_slice(),
+        }
+    }
+
+    fn as_str(&self) -> &str {
+        match self {
+            IdType::String => "String",
+            IdType::Bytes => "Bytes",
+        }
+    }
+
+    fn deployment_id(&self) -> &str {
+        match self {
+            IdType::String => "graphqlTestsQuery",
+            IdType::Bytes => "graphqlTestsQueryBytes",
+        }
+    }
+}
+
+/// Setup a basic deployment. The test using the deployment must not modify
+/// the deployment at all
+async fn setup_readonly(store: &Store) -> DeploymentLocator {
+    setup(store, "graphqlTestsQuery", BTreeSet::new(), IdType::String).await
+}
+
+/// Set up a deployment `id` with the test schema and populate it with test
+/// data. If the `id` is the same as `id_type.deployment_id()`, the test
+/// must not modify the deployment in any way as these are reused for other
+/// tests that expect pristine data
+async fn setup(
+    store: &Store,
+    id: &str,
+    features: BTreeSet<SubgraphFeature>,
+    id_type: IdType,
+) -> DeploymentLocator {
+    use test_store::block_store::{self, BLOCK_ONE, BLOCK_TWO, GENESIS_BLOCK};
+
+    /// Make sure we get rid of all subgraphs once for the entire test run
+    fn global_init() {
+        lazy_static! {
+            static ref STORE_CLEAN: AtomicBool = AtomicBool::new(false);
+        }
+        if !STORE_CLEAN.load(Ordering::SeqCst) {
+            let chain = vec![&*GENESIS_BLOCK, &*BLOCK_ONE, &*BLOCK_TWO];
+            block_store::set_chain(chain, NETWORK_NAME);
+            test_store::remove_subgraphs();
+            STORE_CLEAN.store(true, Ordering::SeqCst);
+        }
+    }
+
+    async fn initialize(
+        store: &Store,
+        id: DeploymentHash,
+        features: BTreeSet<SubgraphFeature>,
+        id_type: IdType,
+    ) -> DeploymentLocator {
+        let schema = test_schema(id.clone(), id_type);
+        let manifest = SubgraphManifest::<graph_chain_ethereum::Chain> {
+            id: id.clone(),
+            spec_version: Version::new(1, 0, 0),
+            features,
+            description: None,
+            repository: None,
+            schema: schema.clone(),
+            data_sources: vec![],
+            graft: None,
+            templates: vec![],
+            chain: PhantomData,
+        };
+
+        insert_test_entities(store.subgraph_store().as_ref(), manifest, id_type).await
+    }
+
+    global_init();
+    let id = DeploymentHash::new(id).unwrap();
+    let loc = store.subgraph_store().locators(&id).unwrap().pop();
+
+    match loc {
+        Some(loc) if id_type.deployment_id() == loc.hash.as_str() => loc,
+        Some(loc) => {
+            test_store::remove_subgraph(&loc.hash);
+            initialize(store, id, features, id_type).await
+        }
+        None => initialize(store, id, features, id_type).await,
+    }
+}
+
+fn test_schema(id: DeploymentHash, id_type: IdType) -> Schema {
+    const SCHEMA: &str = "
+    type Musician @entity {
+        id: ID!
+        name: String!
+        mainBand: Band
+        bands: [Band!]!
+        writtenSongs: [Song!]! @derivedFrom(field: \"writtenBy\")
+    }
+
+    type Band @entity {
+        id: ID!
+        name: String!
+        members: [Musician!]! @derivedFrom(field: \"bands\")
+        reviews: [BandReview!]! @derivedFrom(field: \"band\")
+        originalSongs: [Song!]!
+    }
+
+    type Song @entity {
+        id: @ID@!
+        title: String!
+        writtenBy: Musician!
+        publisher: Publisher!
+        band: Band @derivedFrom(field: \"originalSongs\")
+        reviews: [SongReview!]! @derivedFrom(field: \"song\")
+        media: [Media!]!
+        release: Release! @derivedFrom(field: \"songs\")
+    }
+
+    type SongStat @entity {
+        id: @ID@!
+        song: Song @derivedFrom(field: \"id\")
+        played: Int!
+    }
+
+    type Publisher {
+        id: Bytes!
+    }
+
+    interface Review {
+        id: ID!
+        body: String!
+        author: User!
+    }
+
+    type SongReview implements Review @entity {
+        id: ID!
+        body: String!
+        song: Song
+        author: User!
+    }
+
+    type BandReview implements Review @entity {
+        id: ID!
+        body: String!
+        band: Band
+        author: User!
+    }
+
+    type User @entity {
+        id: ID!
+        name: String!
+        bandReviews: [BandReview!]! @derivedFrom(field: \"author\")
+        songReviews: [SongReview!]! @derivedFrom(field: \"author\")
+        reviews: [Review!]! @derivedFrom(field: \"author\")
+        latestSongReview: SongReview!
+        latestBandReview: BandReview!
+        latestReview: Review!
+    }
+
+    interface Media {
+        id: ID!
+        title: String!
+        song: Song!
+    }
+
+    type Photo implements Media @entity {
+        id: ID!
+        title: String!
+        song: Song! @derivedFrom(field: \"media\")
+    }
+
+    type Video implements Media @entity {
+        id: ID!
+        title: String!
+        song: Song! @derivedFrom(field: \"media\")
+    }
+
+    interface Release {
+        id: ID!
+        title: String!
+        songs: [Song!]!
+    }
+
+    type Single implements Release @entity {
+        id: ID!
+        title: String!
+        # It could be a single song
+        # but let's say a Single represents one song + bonus tracks
+        songs: [Song!]!
+    }
+
+    type Album implements Release @entity {
+        id: ID!
+        title: String!
+        songs: [Song!]!
+    }
+    ";
+
+    Schema::parse(&SCHEMA.replace("@ID@", id_type.as_str()), id).expect("Test schema invalid")
+}
+
+async fn insert_test_entities(
+    store: &impl SubgraphStore,
+    manifest: SubgraphManifest<graph_chain_ethereum::Chain>,
+    id_type: IdType,
+) -> DeploymentLocator {
+    let deployment = DeploymentCreate::new(&manifest, None);
+    let name = SubgraphName::new(manifest.id.as_str()).unwrap();
+    let node_id = NodeId::new("test").unwrap();
+    let deployment = store
+        .create_subgraph_deployment(
+            name,
+            &manifest.schema,
+            deployment,
+            node_id,
+            NETWORK_NAME.to_string(),
+            SubgraphVersionSwitchingMode::Instant,
+        )
+        .unwrap();
+
+    let s = id_type.songs();
+    let md = id_type.medias();
+    let entities0 = vec![
+        entity! { __typename: "Musician", id: "m1", name: "John", mainBand: "b1", bands: vec!["b1", "b2"] },
+        entity! { __typename: "Musician", id: "m2", name: "Lisa", mainBand: "b1", bands: vec!["b1"] },
+        entity! { __typename: "Publisher", id: "0xb1" },
+        entity! { __typename: "Band", id: "b1", name: "The Musicians", originalSongs: vec![s[1], s[2]] },
+        entity! { __typename: "Band", id: "b2", name: "The Amateurs",  originalSongs: vec![s[1], s[3], s[4]] },
+        entity! { __typename: "Song", id: s[1], title: "Cheesy Tune",  publisher: "0xb1", writtenBy: "m1", media: vec![md[1], md[2]] },
+        entity! { __typename: "Song", id: s[2], title: "Rock Tune",    publisher: "0xb1", writtenBy: "m2", media: vec![md[3], md[4]] },
+        entity! { __typename: "Song", id: s[3], title: "Pop Tune",     publisher: "0xb1", writtenBy: "m1", media: vec![md[5]] },
+        entity! { __typename: "Song", id: s[4], title: "Folk Tune",    publisher: "0xb1", writtenBy: "m3", media: vec![md[6]] },
+        entity! { __typename: "SongStat", id: s[1], played: 10 },
+        entity! { __typename: "SongStat", id: s[2], played: 15 },
+        entity! { __typename: "BandReview", id: "r1", body: "Bad musicians", band: "b1", author: "u1" },
+        entity! { __typename: "BandReview", id: "r2", body: "Good amateurs", band: "b2", author: "u2" },
+        entity! { __typename: "SongReview", id: "r3", body: "Bad", song: s[2], author: "u1" },
+        entity! { __typename: "SongReview", id: "r4", body: "Good", song: s[3], author: "u2" },
+        entity! { __typename: "User", id: "u1", name: "Baden", latestSongReview: "r3", latestBandReview: "r1", latestReview: "r1" },
+        entity! { __typename: "User", id: "u2", name: "Goodwill", latestSongReview: "r4", latestBandReview: "r2", latestReview: "r2" },
+        entity! { __typename: "Photo", id: md[1], title: "Cheesy Tune Single Cover" },
+        entity! { __typename: "Video", id: md[2], title: "Cheesy Tune Music Video" },
+        entity! { __typename: "Photo", id: md[3], title: "Rock Tune Single Cover" },
+        entity! { __typename: "Video", id: md[4], title: "Rock Tune Music Video" },
+        entity! { __typename: "Photo", id: md[5], title: "Pop Tune Single Cover" },
+        entity! { __typename: "Video", id: md[6], title: "Folk Tune Music Video" },
+        entity! { __typename: "Album", id: "rl1", title: "Pop and Folk", songs: vec![s[3], s[4]] },
+        entity! { __typename: "Single", id: "rl2", title: "Rock", songs: vec![s[2]] },
+        entity! { __typename: "Single", id: "rl3", title: "Cheesy", songs: vec![s[1]] },
+    ];
+
+    let entities1 = vec![
+        entity! { __typename: "Musician", id: "m3", name: "Tom", mainBand: "b2", bands: vec!["b1", "b2"] },
+        entity! { __typename: "Musician", id: "m4", name: "Valerie", bands: Vec::<String>::new() },
+    ];
+
+    async fn insert_at(entities: Vec<Entity>, deployment: &DeploymentLocator, block_ptr: BlockPtr) {
+        let insert_ops = entities.into_iter().map(|data| EntityOperation::Set {
+            key: EntityKey {
+                entity_type: EntityType::new(
+                    data.get("__typename").unwrap().clone().as_string().unwrap(),
+                ),
+                entity_id: data.get("id").unwrap().clone().as_string().unwrap().into(),
+            },
+            data,
+        });
+
+        test_store::transact_and_wait(
+            &STORE.subgraph_store(),
+            &deployment,
+            block_ptr,
+            insert_ops.collect::<Vec<_>>(),
+        )
+        .await
+        .unwrap();
+    }
+
+    insert_at(entities0, &deployment, GENESIS_PTR.clone()).await;
+    insert_at(entities1, &deployment, BLOCK_ONE.clone()).await;
+    deployment
+}
+
+async fn execute_query(loc: &DeploymentLocator, query: &str) -> QueryResult {
+    let query = graphql_parser::parse_query(query)
+        .expect("invalid test query")
+        .into_static();
+    execute_query_document_with_variables(&loc.hash, query, None).await
+}
+
+async fn execute_query_document_with_variables(
+    id: &DeploymentHash,
+    query: q::Document,
+    variables: Option<QueryVariables>,
+) -> QueryResult {
+    let runner = Arc::new(GraphQlRunner::new(
+        &*LOGGER,
+        STORE.clone(),
+        SUBSCRIPTION_MANAGER.clone(),
+        LOAD_MANAGER.clone(),
+        METRICS_REGISTRY.clone(),
+    ));
+    let target = QueryTarget::Deployment(id.clone(), Default::default());
+    let query = Query::new(query, variables);
+
+    runner
+        .run_query_with_complexity(query, target, None, None, None, None)
+        .await
+        .first()
+        .unwrap()
+        .duplicate()
+}
+
+async fn first_result(f: QueryResults) -> QueryResult {
+    f.first().unwrap().duplicate()
+}
+
+/// Extract the data from a `QueryResult`, and panic if it has errors
+macro_rules! extract_data {
+    ($result: expr) => {
+        match $result.to_result() {
+            Err(errors) => panic!("Unexpected errors return for query: {:#?}", errors),
+            Ok(data) => data,
+        }
+    };
+}
+
+struct QueryArgs {
+    query: String,
+    variables: Option<QueryVariables>,
+    max_complexity: Option<u64>,
+}
+
+impl From<&str> for QueryArgs {
+    fn from(query: &str) -> Self {
+        QueryArgs {
+            query: query.to_owned(),
+            variables: None,
+            max_complexity: None,
+        }
+    }
+}
+
+impl From<(&str, r::Value)> for QueryArgs {
+    fn from((query, vars): (&str, r::Value)) -> Self {
+        let vars = match vars {
+            r::Value::Object(map) => map,
+            _ => panic!("vars must be an object"),
+        };
+        let vars = QueryVariables::new(HashMap::from_iter(
+            vars.into_iter().map(|(k, v)| (k.to_string(), v)),
+        ));
+        QueryArgs {
+            query: query.to_owned(),
+            variables: Some(vars),
+            max_complexity: None,
+        }
+    }
+}
+
+/// Run a GraphQL query against the `test_schema` and call the `test`
+/// function with the result. The query is actually run twice: once against
+/// the test schema where the `id` of `Song` and `SongStats` has type
+/// `String`, and once where it has type `Bytes`. The second argument to
+/// `test` indicates which type is being used for the id.
+///
+/// The query can contain placeholders `@S1@` .. `@S4@` which will be
+/// replaced with the id's of songs 1 through 4 before running the query.
+fn run_query<F>(args: impl Into<QueryArgs>, test: F)
+where
+    F: Fn(QueryResult, IdType) -> () + Send + 'static,
+{
+    let QueryArgs {
+        query,
+        variables,
+        max_complexity,
+    } = args.into();
+    run_test_sequentially(move |store| async move {
+        for id_type in [IdType::String, IdType::Bytes] {
+            let name = id_type.deployment_id();
+
+            let deployment = setup(store.as_ref(), name, BTreeSet::new(), id_type).await;
+
+            let mut query = query.clone();
+            for (i, id) in id_type.songs().iter().enumerate() {
+                let pat = format!("@S{i}@");
+                let repl = format!("\"{id}\"");
+                query = query.replace(&pat, &repl);
+            }
+
+            let result = {
+                let id = &deployment.hash;
+                let query = graphql_parser::parse_query(&query)
+                    .expect("Invalid test query")
+                    .into_static();
+                let variables = variables.clone();
+                let runner = Arc::new(GraphQlRunner::new(
+                    &*LOGGER,
+                    STORE.clone(),
+                    SUBSCRIPTION_MANAGER.clone(),
+                    LOAD_MANAGER.clone(),
+                    METRICS_REGISTRY.clone(),
+                ));
+                let target = QueryTarget::Deployment(id.clone(), Default::default());
+                let query = Query::new(query, variables);
+
+                runner
+                    .run_query_with_complexity(query, target, max_complexity, None, None, None)
+                    .await
+                    .first()
+                    .unwrap()
+                    .duplicate()
+            };
+            test(result, id_type);
+        }
+    })
+}
+
+/// Helper to run a subscription
+async fn run_subscription(
+    store: &Arc<Store>,
+    query: &str,
+    max_complexity: Option<u64>,
+) -> Result<SubscriptionResult, SubscriptionError> {
+    let deployment = setup_readonly(store.as_ref()).await;
+    let logger = Logger::root(slog::Discard, o!());
+    let query_store = store
+        .query_store(
+            QueryTarget::Deployment(deployment.hash.clone(), Default::default()),
+            true,
+        )
+        .await
+        .unwrap();
+
+    let query = Query::new(
+        graphql_parser::parse_query(query).unwrap().into_static(),
+        None,
+    );
+    let options = SubscriptionExecutionOptions {
+        logger: logger.clone(),
+        store: query_store.clone(),
+        subscription_manager: SUBSCRIPTION_MANAGER.clone(),
+        timeout: None,
+        max_complexity,
+        max_depth: 100,
+        max_first: std::u32::MAX,
+        max_skip: std::u32::MAX,
+        graphql_metrics: graphql_metrics(),
+    };
+    let schema = STORE
+        .subgraph_store()
+        .api_schema(&deployment.hash, &Default::default())
+        .unwrap();
+
+    execute_subscription(Subscription { query }, schema.clone(), options)
+}
+
+#[test]
+fn can_query_one_to_one_relationship() {
+    const QUERY: &str = "
+    query {
+        musicians(first: 100, orderBy: id) {
+            name
+            mainBand {
+                name
+            }
+        }
+        songStats(first: 100, orderBy: id) {
+            id
+            song {
+              id
+              title
+            }
+            played
+        }
+    }
+    ";
+
+    run_query(QUERY, |result, id_type| {
+        let s = id_type.songs();
+        let exp = object! {
+            musicians: vec![
+                object! { name: "John", mainBand: object! { name: "The Musicians" } },
+                object! { name: "Lisa", mainBand: object! { name: "The Musicians" } },
+                object! { name: "Tom",  mainBand: object! { name: "The Amateurs"} },
+                object! { name: "Valerie", mainBand: r::Value::Null }
+            ],
+            songStats: vec![
+                object! {
+                    id: s[1],
+                    song: object! { id: s[1], title: "Cheesy Tune" },
+                    played: 10,
+                },
+                object! {
+                    id: s[2],
+                    song: object! { id: s[2], title: "Rock Tune" },
+                    played: 15
+                }
+            ]
+        };
+        let data = extract_data!(result).unwrap();
+        assert_eq!(data, exp);
+    })
+}
+
+#[test]
+fn can_query_one_to_many_relationships_in_both_directions() {
+    const QUERY: &str = "
+    query {
+        musicians(first: 100, orderBy: id) {
+            name
+            writtenSongs(first: 100, orderBy: id) {
+                title
+                writtenBy { name }
+            }
+        }
+    }";
+
+    run_query(QUERY, |result, _| {
+        fn song(title: &str, author: &str) -> r::Value {
+            object! {
+                title: title,
+                writtenBy: object! { name: author }
+            }
+        }
+
+        let exp = object! {
+            musicians: vec![
+                object! {
+                    name: "John",
+                    writtenSongs: vec![
+                        song("Cheesy Tune", "John"),
+                        song("Pop Tune", "John"),
+                    ]
+                },
+                object! {
+                    name: "Lisa", writtenSongs: vec![ song("Rock Tune", "Lisa") ]
+                },
+                object! {
+                    name: "Tom", writtenSongs: vec![ song("Folk Tune", "Tom") ]
+                },
+                object! {
+                    name: "Valerie", writtenSongs: Vec::<String>::new()
+                },
+            ]
+        };
+
+        let data = extract_data!(result).unwrap();
+        assert_eq!(data, exp);
+    })
+}
+
+#[test]
+fn can_query_many_to_many_relationship() {
+    const QUERY: &str = "
+    query {
+        musicians(first: 100, orderBy: id) {
+            name
+            bands(first: 100, orderBy: id) {
+                name
+                members(first: 100, orderBy: id) {
+                    name
+                }
+            }
+        }
+    }";
+
+    run_query(QUERY, |result, _| {
+        fn members(names: Vec<&str>) -> Vec<r::Value> {
+            names
+                .into_iter()
+                .map(|name| object! { name: name })
+                .collect()
+        }
+
+        let the_musicians = object! {
+            name: "The Musicians",
+            members: members(vec!["John", "Lisa", "Tom"])
+        };
+
+        let the_amateurs = object! {
+            name: "The Amateurs",
+            members: members(vec![ "John", "Tom" ])
+        };
+
+        let exp = object! {
+            musicians: vec![
+                object! { name: "John", bands: vec![ the_musicians.clone(), the_amateurs.clone() ]},
+                object! { name: "Lisa", bands: vec![ the_musicians.clone() ] },
+                object! { name: "Tom", bands: vec![ the_musicians.clone(), the_amateurs.clone() ] },
+                object! { name: "Valerie", bands: Vec::<String>::new() }
+            ]
+        };
+
+        let data = extract_data!(result).unwrap();
+        assert_eq!(data, exp);
+    })
+}
+
+#[test]
+fn can_query_with_child_filter_on_list_type_field() {
+    const QUERY: &str = "
+    query {
+        musicians(first: 100, orderBy: id, where: { bands_: { name: \"The Amateurs\" } }) {
+            name
+            bands(first: 100, orderBy: id) {
+                name
+            }
+        }
+    }";
+
+    run_query(QUERY, |result, _| {
+        let the_musicians = object! {
+            name: "The Musicians",
+        };
+
+        let the_amateurs = object! {
+            name: "The Amateurs",
+        };
+
+        let exp = object! {
+            musicians: vec![
+                object! { name: "John", bands: vec![ the_musicians.clone(), the_amateurs.clone() ]},
+                object! { name: "Tom", bands: vec![ the_musicians.clone(), the_amateurs.clone() ] },
+            ]
+        };
+
+        let data = extract_data!(result).unwrap();
+        assert_eq!(data, exp);
+    })
+}
+
+#[test]
+fn can_query_with_child_filter_on_derived_list_type_field() {
+    const QUERY: &str = "
+    query {
+        musicians(first: 100, orderBy: id, where: { writtenSongs_: { title_contains: \"Rock\" } }) {
+            name
+        }
+    }";
+
+    run_query(QUERY, |result, _| {
+        let exp = object! {
+            musicians: vec![
+                object! { name: "Lisa" },
+            ]
+        };
+
+        let data = extract_data!(result).unwrap();
+        assert_eq!(data, exp);
+    })
+}
+
+#[test]
+fn can_query_with_child_filter_on_named_type_field() {
+    const QUERY: &str = "
+    query {
+        musicians(first: 100, orderBy: id, where: { mainBand_: { name_contains: \"The Amateurs\" } }) {
+            name
+            mainBand {
+                id
+            }
+        }
+    }";
+
+    run_query(QUERY, |result, _| {
+        let exp = object! {
+            musicians: vec![
+                object! { name: "Tom", mainBand: object! { id: "b2"} }
+            ]
+        };
+
+        let data = extract_data!(result).unwrap();
+        assert_eq!(data, exp);
+    })
+}
+
+#[test]
+fn can_query_with_child_filter_on_derived_named_type_field() {
+    const QUERY: &str = "
+    query {
+        songs(first: 100, orderBy: id, where: { band_: { name_contains: \"The Musicians\" } }) {
+            title
+        }
+    }";
+
+    run_query(QUERY, |result, _| {
+        let exp = object! {
+            songs: vec![
+                object! { title: "Cheesy Tune" },
+                object! { title: "Rock Tune" },
+            ]
+        };
+
+        let data = extract_data!(result).unwrap();
+        assert_eq!(data, exp);
+    })
+}
+
+#[test]
+fn can_query_an_interface_with_child_filter_on_named_type_field() {
+    const QUERY: &str = "
+    query {
+        reviews(first: 100, orderBy: id, where: { author_: { name_starts_with: \"Good\" } }) {
+            body
+            author {
+                name
+            }
+        }
+    }";
+
+    run_query(QUERY, |result, _| {
+        let exp = object! {
+            reviews: vec![
+                object! { body: "Good amateurs", author: object! { name: "Goodwill" } },
+                object! { body: "Good", author: object! { name: "Goodwill" } },
+            ]
+        };
+
+        let data = extract_data!(result).unwrap();
+        assert_eq!(data, exp);
+    })
+}
+
+#[test]
+fn can_query_with_child_filter_on_derived_interface_list_field() {
+    const QUERY: &str = "
+    query {
+        users(first: 100, orderBy: id, where: { reviews_: { body_starts_with: \"Good\" } }) {
+            name
+            reviews {
+                body
+            }
+        }
+    }";
+
+    run_query(QUERY, |result, _| {
+        let exp = object! {
+            users: vec![
+                object! { name: "Goodwill", reviews: vec![ object! { body: "Good amateurs" }, object! { body: "Good" } ] },
+            ]
+        };
+
+        let data = extract_data!(result).unwrap();
+        assert_eq!(data, exp);
+    })
+}
+
+#[test]
+fn can_query_entity_by_child_entity_field() {
+    const QUERY: &str = "
+    query {
+        users(first: 100, orderBy: id, where: { latestSongReview_: { body_starts_with: \"Good\" } }) {
+            name
+            latestSongReview {
+                body
+            }
+        }
+    }";
+
+    run_query(QUERY, |result, _| {
+        let exp = object! {
+            users: vec![
+                object! { name: "Goodwill", latestSongReview: object! { body: "Good" } },
+            ]
+        };
+
+        let data = extract_data!(result).unwrap();
+        assert_eq!(data, exp);
+    })
+}
+
+#[test]
+fn can_query_entity_by_child_interface_field() {
+    const QUERY: &str = "
+    query {
+        users(first: 100, orderBy: id, where: { latestReview_: { body_starts_with: \"Good\" } }) {
+            name
+            latestReview {
+                body
+            }
+        }
+    }";
+
+    run_query(QUERY, |result, _| {
+        let exp = object! {
+            users: vec![
+                object! { name: "Goodwill", latestReview: object! { body: "Good amateurs" } },
+            ]
+        };
+
+        let data = extract_data!(result).unwrap();
+        assert_eq!(data, exp);
+    })
+}
+
+#[test]
+fn can_query_interface_by_child_entity_field() {
+    const QUERY: &str = "
+    query {
+        reviews(first: 100, orderBy: id, where: { author_: { name_starts_with: \"Good\" } }) {
+            body
+            author {
+                name
+            }
+        }
+    }";
+
+    run_query(QUERY, |result, _| {
+        let exp = object! {
+            reviews: vec![
+                object! { body: "Good amateurs", author: object! { name: "Goodwill" } },
+                object! { body: "Good", author: object! { name: "Goodwill" } },
+            ]
+        };
+
+        let data = extract_data!(result).unwrap();
+        assert_eq!(data, exp);
+    })
+}
+
+#[test]
+fn can_query_entity_by_child_interface_derived_field() {
+    const QUERY: &str = "
+    query {
+        songs(first: 100, orderBy: id, where: { release_: { title_starts_with: \"Pop\" } }) {
+            title
+            release {
+                title
+            }
+        }
+    }";
+
+    run_query(QUERY, |result, _| {
+        let exp = object! {
+            songs: vec![
+                object! { title: "Pop Tune", release: object! { title: "Pop and Folk" } },
+                object! { title: "Folk Tune", release: object! { title: "Pop and Folk" } },
+            ]
+        };
+
+        let data = extract_data!(result).unwrap();
+        assert_eq!(data, exp);
+    })
+}
+
+#[test]
+fn can_query_interface_by_child_entity_derived_field() {
+    const QUERY: &str = "
+    query {
+        medias(first: 100, orderBy: id, where: { song_: { title_starts_with: \"Folk\" } }) {
+            title
+            song {
+                title
+            }
+        }
+    }";
+
+    run_query(QUERY, |result, _| {
+        let exp = object! {
+            medias: vec![
+                object! { title: "Folk Tune Music Video", song: object! { title: "Folk Tune" } },
+            ]
+        };
+
+        let data = extract_data!(result).unwrap();
+        assert_eq!(data, exp);
+    })
+}
+
+#[test]
+fn can_query_entity_by_child_interface_list_field() {
+    const QUERY: &str = "
+    query {
+        songs(first: 100, orderBy: id, where: { media_: { title_starts_with: \"Cheesy Tune\" } }) {
+            title
+            media {
+                title
+            }
+        }
+    }";
+
+    run_query(QUERY, |result, _| {
+        let exp = object! {
+            songs: vec![
+                object! { title: "Cheesy Tune", media: vec![
+                    object! { title: "Cheesy Tune Single Cover" },
+                    object! { title: "Cheesy Tune Music Video" }
+                ] },
+            ]
+        };
+
+        let data = extract_data!(result).unwrap();
+        assert_eq!(data, exp);
+    })
+}
+
+#[test]
+fn can_query_entity_by_child_interface_list_derived_field() {
+    const QUERY: &str = "
+    query {
+        songs(first: 100, orderBy: id, where: { reviews_: { body_starts_with: \"Good\" } }) {
+            title
+            reviews {
+                body
+            }
+        }
+    }";
+
+    run_query(QUERY, |result, _| {
+        let exp = object! {
+            songs: vec![
+                object! { title: "Pop Tune", reviews: vec![
+                    object! { body: "Good" },
+                ] },
+            ]
+        };
+
+        let data = extract_data!(result).unwrap();
+        assert_eq!(data, exp);
+    })
+}
+
+#[test]
+fn root_fragments_are_expanded() {
+    const QUERY: &str = r#"
+    fragment Musicians on Query {
+        musicians(first: 100, where: { name: "Tom" }) {
+            name
+        }
+    }
+    query MyQuery {
+        ...Musicians
+    }"#;
+
+    run_query(QUERY, |result, _| {
+        let exp = object! { musicians: vec![ object! { name: "Tom" }]};
+        assert_eq!(extract_data!(result), Some(exp));
+    })
+}
+
+#[test]
+fn query_variables_are_used() {
+    const QUERY: &str = "
+    query musicians($where: Musician_filter!) {
+      musicians(first: 100, where: $where) {
+        name
+      }
+    }";
+
+    run_query(
+        (QUERY, object![ where: object! { name: "Tom"} ]),
+        |result, _| {
+            let exp = object! {
+                musicians: vec![ object! { name: "Tom" }]
+            };
+            let data = extract_data!(result).unwrap();
+            assert_eq!(data, exp);
+        },
+    );
+}
+
+#[test]
+fn mixed_parent_child_id() {
+    // Check that any combination of parent and child id type (String or
+    // Bytes) works in queries
+
+    // `Publisher` has `id` of type `Bytes`, which used to lead to
+    // `NonNullError` when `Song` used `String`
+    const QUERY: &str = "
+    query amxx {
+        songs(first: 2) {
+            publisher { id }
+        }
+    }";
+
+    run_query(QUERY, |result, _| {
+        let exp = object! {
+            songs: vec![
+                object! { publisher: object! { id: "0xb1" } },
+                object! { publisher: object! { id: "0xb1" } }
+            ]
+        };
+        let data = extract_data!(result).unwrap();
+        assert_eq!(data, exp);
+    });
+
+    const QUERY2: &str = "
+    query bytes_string {
+        songs(first: 2) {
+            writtenBy { id }
+        }
+    }
+    ";
+    run_query(QUERY2, |result, _| {
+        let exp = object! {
+            songs: vec![
+                object! { writtenBy: object! { id: "m1" } },
+                object! { writtenBy: object! { id: "m2" } }
+            ]
+        };
+        let data = extract_data!(result).unwrap();
+        assert_eq!(data, exp);
+    })
+}
+
+#[test]
+fn skip_directive_works_with_query_variables() {
+    const QUERY: &str = "
+    query musicians($skip: Boolean!) {
+      musicians(first: 100, orderBy: id) {
+        id @skip(if: $skip)
+        name
+      }
+    }
+";
+
+    run_query((QUERY, object! { skip: true }), |result, _| {
+        // Assert that only names are returned
+        let musicians: Vec<_> = ["John", "Lisa", "Tom", "Valerie"]
+            .into_iter()
+            .map(|name| object! { name: name })
+            .collect();
+        let exp = object! { musicians: musicians };
+        let data = extract_data!(result).unwrap();
+        assert_eq!(data, exp);
+    });
+
+    run_query((QUERY, object! { skip: false }), |result, _| {
+        // Assert that IDs and names are returned
+        let exp = object! {
+            musicians: vec![
+                object! { id: "m1", name: "John" },
+                object! { id: "m2", name: "Lisa"},
+                object! { id: "m3", name: "Tom" },
+                object! { id: "m4", name: "Valerie" }
+            ]
+        };
+        let data = extract_data!(result).unwrap();
+        assert_eq!(data, exp);
+    });
+}
+
+#[test]
+fn include_directive_works_with_query_variables() {
+    const QUERY: &str = "
+    query musicians($include: Boolean!) {
+      musicians(first: 100, orderBy: id) {
+        id @include(if: $include)
+        name
+      }
+    }
+";
+
+    run_query((QUERY, object! { include: true }), |result, _| {
+        // Assert that IDs and names are returned
+        let exp = object! {
+            musicians: vec![
+                object! { id: "m1", name: "John" },
+                object! { id: "m2", name: "Lisa"},
+                object! { id: "m3", name: "Tom" },
+                object! { id: "m4", name: "Valerie" }
+            ]
+        };
+        let data = extract_data!(result).unwrap();
+        assert_eq!(data, exp);
+    });
+
+    run_query((QUERY, object! { include: false }), |result, _| {
+        // Assert that only names are returned
+        let musicians: Vec<_> = ["John", "Lisa", "Tom", "Valerie"]
+            .into_iter()
+            .map(|name| object! { name: name })
+            .collect();
+        let exp = object! { musicians: musicians };
+        let data = extract_data!(result).unwrap();
+        assert_eq!(data, exp);
+    });
+}
+
+#[test]
+fn query_complexity() {
+    const QUERY1: &str = "query {
+        musicians(orderBy: id) {
+            name
+            bands(first: 100, orderBy: id) {
+                name
+                members(first: 100, orderBy: id) {
+                    name
+                }
+            }
+        }
+    }";
+    let args = QueryArgs {
+        query: QUERY1.to_owned(),
+        variables: None,
+        max_complexity: Some(1_010_100),
+    };
+    run_query(args, |result, _| {
+        // This query is exactly at the maximum complexity.
+        assert!(!result.has_errors());
+    });
+
+    const QUERY2: &str = "query {
+        musicians(orderBy: id) {
+            name
+            bands(first: 100, orderBy: id) {
+                name
+                members(first: 100, orderBy: id) {
+                    name
+                }
+            }
+        }
+        __schema {
+            types {
+                name
+            }
+        }
+    }";
+    let args = QueryArgs {
+        query: QUERY2.to_owned(),
+        variables: None,
+        max_complexity: Some(1_010_100),
+    };
+    run_query(args, |result, _| {
+        // The extra introspection causes the complexity to go over.
+        match result.to_result().unwrap_err()[0] {
+            QueryError::ExecutionError(QueryExecutionError::TooComplex(1_010_200, _)) => (),
+            _ => panic!("did not catch complexity"),
+        };
+    })
+}
+
+#[test]
+fn query_complexity_subscriptions() {
+    run_test_sequentially(|store| async move {
+        const QUERY1: &str = "subscription {
+                musicians(orderBy: id) {
+                    name
+                    bands(first: 100, orderBy: id) {
+                        name
+                        members(first: 100, orderBy: id) {
+                            name
+                        }
+                    }
+                }
+            }";
+        let max_complexity = Some(1_010_100);
+
+        // This query is exactly at the maximum complexity.
+        // FIXME: Not collecting the stream because that will hang the test.
+        let _ignore_stream = run_subscription(&store, QUERY1, max_complexity)
+            .await
+            .unwrap();
+
+        const QUERY2: &str = "subscription {
+                musicians(orderBy: id) {
+                    name
+                    t1: bands(first: 100, orderBy: id) {
+                        name
+                        members(first: 100, orderBy: id) {
+                            name
+                        }
+                    }
+                    t2: bands(first: 200, orderBy: id) {
+                      name
+                      members(first: 100, orderBy: id) {
+                          name
+                      }
+                  }
+                }
+            }";
+
+        let result = run_subscription(&store, QUERY2, max_complexity).await;
+
+        match result {
+            Err(SubscriptionError::GraphQLError(e)) => match &e[0] {
+                QueryExecutionError::TooComplex(3_030_100, _) => (), // Expected
+                e => panic!("did not catch complexity: {:?}", e),
+            },
+            _ => panic!("did not catch complexity"),
+        }
+    })
+}
+
+#[test]
+fn instant_timeout() {
+    run_test_sequentially(|store| async move {
+        let deployment = setup_readonly(store.as_ref()).await;
+        let query = Query::new(
+            graphql_parser::parse_query("query { musicians(first: 100) { name } }")
+                .unwrap()
+                .into_static(),
+            None,
+        );
+
+        match first_result(
+            execute_subgraph_query_with_deadline(
+                query,
+                QueryTarget::Deployment(deployment.hash.into(), Default::default()),
+                Some(Instant::now()),
+            )
+            .await,
+        )
+        .await
+        .to_result()
+        .unwrap_err()[0]
+        {
+            QueryError::ExecutionError(QueryExecutionError::Timeout) => (), // Expected
+            _ => panic!("did not time out"),
+        };
+    })
+}
+
+#[test]
+fn variable_defaults() {
+    const QUERY: &str = "
+    query musicians($orderDir: OrderDirection = desc) {
+      bands(first: 2, orderBy: id, orderDirection: $orderDir) {
+        id
+      }
+    }
+";
+
+    run_query((QUERY, object! {}), |result, _| {
+        let exp = object! {
+            bands: vec![
+                object! { id: "b2" },
+                object! { id: "b1" }
+            ]
+        };
+        let data = extract_data!(result).unwrap();
+        assert_eq!(data, exp);
+    });
+
+    run_query(
+        (QUERY, object! { orderDir: r::Value::Null }),
+        |result, _| {
+            let exp = object! {
+                bands: vec![
+                    object! { id: "b1" },
+                    object! { id: "b2" }
+                ]
+            };
+            let data = extract_data!(result).unwrap();
+            assert_eq!(data, exp);
+        },
+    )
+}
+
+#[test]
+fn skip_is_nullable() {
+    const QUERY: &str = "
+    query musicians {
+      musicians(orderBy: id, skip: null) {
+        name
+      }
+    }
+";
+
+    run_query(QUERY, |result, _| {
+        let musicians: Vec<_> = ["John", "Lisa", "Tom", "Valerie"]
+            .into_iter()
+            .map(|name| object! { name: name })
+            .collect();
+        let exp = object! { musicians: musicians };
+        let data = extract_data!(result).unwrap();
+        assert_eq!(data, exp);
+    })
+}
+
+#[test]
+fn first_is_nullable() {
+    const QUERY: &str = "
+    query musicians {
+      musicians(first: null, orderBy: id) {
+        name
+      }
+    }
+";
+
+    run_query(QUERY, |result, _| {
+        let musicians: Vec<_> = ["John", "Lisa", "Tom", "Valerie"]
+            .into_iter()
+            .map(|name| object! { name: name })
+            .collect();
+        let exp = object! { musicians: musicians };
+        let data = extract_data!(result).unwrap();
+        assert_eq!(data, exp);
+    })
+}
+
+#[test]
+fn nested_variable() {
+    const QUERY: &str = "
+    query musicians($name: String) {
+      musicians(first: 100, where: { name: $name }) {
+        name
+      }
+    }
+";
+
+    run_query((QUERY, object! { name: "Lisa" }), |result, _| {
+        let exp = object! {
+            musicians: vec! { object! { name: "Lisa" }}
+        };
+        let data = extract_data!(result).unwrap();
+        assert_eq!(data, exp);
+    })
+}
+
+#[test]
+fn ambiguous_derived_from_result() {
+    const QUERY: &str = "{ songs(first: 100, orderBy: id) { id band { id } } }";
+
+    run_query(QUERY, |result, _| {
+        match &result.to_result().unwrap_err()[0] {
+            QueryError::ExecutionError(QueryExecutionError::AmbiguousDerivedFromResult(
+                pos,
+                derived_from_field,
+                target_type,
+                target_field,
+            )) => {
+                assert_eq!(
+                    pos,
+                    &Pos {
+                        line: 1,
+                        column: 39
+                    }
+                );
+                assert_eq!(derived_from_field.as_str(), "band");
+                assert_eq!(target_type.as_str(), "Band");
+                assert_eq!(target_field.as_str(), "originalSongs");
+            }
+            e => panic!("expected AmbiguousDerivedFromResult error, got {}", e),
+        }
+    })
+}
+
+#[test]
+fn can_filter_by_relationship_fields() {
+    const QUERY: &str = "
+    query {
+        musicians(orderBy: id, where: { mainBand: \"b2\" }) {
+            id name
+            mainBand { id }
+        }
+        bands(orderBy: id, where: { originalSongs: [@S1@, @S3@, @S4@] }) {
+            id name
+            originalSongs { id }
+        }
+    }
+    ";
+
+    run_query(QUERY, |result, id_type| {
+        let s = id_type.songs();
+
+        let exp = object! {
+            musicians: vec![
+                object! { id: "m3", name: "Tom", mainBand: object! { id: "b2"} }
+            ],
+            bands: vec![
+                object! {
+                    id: "b2",
+                    name: "The Amateurs",
+                    originalSongs: vec! [
+                        object! { id: s[1] },
+                        object! { id: s[3] },
+                        object! { id: s[4] }
+                    ]
+                }
+            ]
+        };
+
+        let data = extract_data!(result).unwrap();
+        assert_eq!(data, exp);
+    })
+}
+
+#[test]
+fn cannot_filter_by_derved_relationship_fields() {
+    const QUERY: &str = "
+    query {
+        musicians(orderBy: id, where: { writtenSongs: [@S1@] }) {
+            id name
+            mainBand { id }
+        }
+    }
+    ";
+
+    run_query(QUERY, |result, _id_type| {
+        match &result.to_result().unwrap_err()[0] {
+            // With validations
+            QueryError::ExecutionError(QueryExecutionError::ValidationError(_, error_message)) => {
+                assert_eq!(
+                    error_message,
+                    "Field \"writtenSongs\" is not defined by type \"Musician_filter\"."
+                );
+            }
+            // Without validations
+            QueryError::ExecutionError(QueryExecutionError::InvalidArgumentError(
+                _pos,
+                error_message,
+                _value,
+            )) => {
+                assert_eq!(error_message, "where");
+            }
+            e => panic!("expected a runtime/validation error, got {:?}", e),
+        };
+    })
+}
+
+#[test]
+fn subscription_gets_result_even_without_events() {
+    run_test_sequentially(|store| async move {
+        const QUERY: &str = "subscription {
+            musicians(orderBy: id, first: 2) {
+              name
+            }
+          }";
+
+        // Execute the subscription and expect at least one result to be
+        // available in the result stream
+        let stream = run_subscription(&store, QUERY, None).await.unwrap();
+        let results: Vec<_> = stream
+            .take(1)
+            .collect()
+            .timeout(Duration::from_secs(3))
+            .await
+            .unwrap();
+
+        assert_eq!(results.len(), 1);
+        let result = Arc::try_unwrap(results.into_iter().next().unwrap()).unwrap();
+        let data = extract_data!(result).unwrap();
+        let exp = object! {
+            musicians: vec![
+                object! { name: "John" },
+                object! { name: "Lisa" }
+            ]
+        };
+        assert_eq!(data, exp);
+    })
+}
+
+#[test]
+fn can_use_nested_filter() {
+    const QUERY: &str = "
+    query {
+        musicians(orderBy: id) {
+            name
+            bands(where: { originalSongs: [@S1@, @S3@, @S4@] }) { id }
+        }
+    }
+    ";
+
+    run_query(QUERY, |result, _| {
+        let exp = object! {
+            musicians: vec![
+                object! {
+                    name: "John",
+                    bands: vec![ object! { id: "b2" }]
+                },
+                object! {
+                    name: "Lisa",
+                    bands: Vec::<r::Value>::new(),
+                },
+                object! {
+                    name: "Tom",
+                    bands: vec![ object! { id: "b2" }]
+                },
+                object! {
+                    name: "Valerie",
+                    bands: Vec::<r::Value>::new(),
+                }
+            ]
+        };
+
+        let data = extract_data!(result).unwrap();
+        assert_eq!(data, exp);
+    })
+}
+
+// see: graphql-bug-compat
+#[test]
+fn ignores_invalid_field_arguments() {
+    // This query has to return all the musicians since `id` is not a
+    // valid argument for the `musicians` field and must therefore be
+    // ignored
+    const QUERY: &str = "query { musicians(id: \"m1\") { id } } ";
+
+    run_query(QUERY, |result, _| {
+        match &result.to_result() {
+            // Without validations
+            Ok(Some(r::Value::Object(obj))) => match obj.get("musicians").unwrap() {
+                r::Value::List(lst) => {
+                    assert_eq!(4, lst.len());
+                }
+                _ => panic!("expected a list of values"),
+            },
+            // With validations
+            Err(e) => {
+                match e.get(0).unwrap() {
+                    QueryError::ExecutionError(QueryExecutionError::ValidationError(
+                        _pos,
+                        message,
+                    )) => {
+                        assert_eq!(
+                            message,
+                            "Unknown argument \"id\" on field \"Query.musicians\"."
+                        );
+                    }
+                    r => panic!("unexpexted query error: {:?}", r),
+                };
+            }
+            r => {
+                panic!("unexpexted result: {:?}", r);
+            }
+        }
+    })
+}
+
+// see: graphql-bug-compat
+#[test]
+fn leaf_selection_mismatch() {
+    const QUERY1: &str = "query { musician(id: \"m1\") { id name { wat }} } ";
+
+    run_query(QUERY1, |result, _| {
+        let exp = object! { musician: object! { id: "m1", name: "John" } };
+
+        match &result.to_result() {
+            // Without validations
+            Ok(Some(data)) => {
+                assert_eq!(exp, *data);
+            }
+            // With validations
+            Err(e) => {
+                match e.get(0).unwrap() {
+                    QueryError::ExecutionError(QueryExecutionError::ValidationError(
+                        _pos,
+                        message,
+                    )) => {
+                        assert_eq!(message, "Field \"name\" must not have a selection since type \"String!\" has no subfields.");
+                    }
+                    r => panic!("unexpexted query error: {:?}", r),
+                };
+                match e.get(1).unwrap() {
+                    QueryError::ExecutionError(QueryExecutionError::ValidationError(
+                        _pos,
+                        message,
+                    )) => {
+                        assert_eq!(message, "Cannot query field \"wat\" on type \"String\".");
+                    }
+                    r => panic!("unexpexted query error: {:?}", r),
+                }
+            }
+            r => {
+                panic!("unexpexted result: {:?}", r);
+            }
+        }
+    });
+
+    const QUERY2: &str = "query { musician(id: \"m1\") { id name mainBand } } ";
+    run_query(QUERY2, |result, _| {
+        let exp = object! { musician: object! { id: "m1", name: "John" } };
+
+        match &result.to_result() {
+            // Without validations
+            Ok(Some(data)) => {
+                assert_eq!(exp, *data);
+            }
+            // With validations
+            Err(e) => {
+                match e.get(0).unwrap() {
+                    QueryError::ExecutionError(QueryExecutionError::ValidationError(
+                        _pos,
+                        message,
+                    )) => {
+                        assert_eq!(message, "Field \"mainBand\" of type \"Band\" must have a selection of subfields. Did you mean \"mainBand { ... }\"?");
+                    }
+                    r => panic!("unexpexted query error: {:?}", r),
+                };
+            }
+            r => {
+                panic!("unexpexted result: {:?}", r);
+            }
+        }
+    })
+}
+
+// see: graphql-bug-compat
+#[test]
+fn missing_variable() {
+    // '$first' is not defined, use its default from the schema
+    const QUERY1: &str = "query { musicians(first: $first) { id } }";
+    run_query(QUERY1, |result, _| {
+        let exp = object! {
+            musicians: vec![
+                object! { id: "m1" },
+                object! { id: "m2" },
+                object! { id: "m3" },
+                object! { id: "m4" },
+            ]
+        };
+
+        match &result.to_result() {
+            // We silently set `$first` to 100 and `$skip` to 0, and therefore
+            Ok(Some(data)) => {
+                assert_eq!(exp, *data);
+            }
+            // With GraphQL validations active, this query fails
+            Err(e) => match e.get(0).unwrap() {
+                QueryError::ExecutionError(QueryExecutionError::ValidationError(_pos, message)) => {
+                    assert_eq!(message, "Variable \"$first\" is not defined.");
+                }
+                r => panic!("unexpexted query error: {:?}", r),
+            },
+            r => {
+                panic!("unexpexted result: {:?}", r);
+            }
+        }
+    });
+
+    // '$where' is not defined but nullable, ignore the argument
+    const QUERY2: &str = "query { musicians(where: $where) { id } }";
+    run_query(QUERY2, |result, _| {
+        let exp = object! {
+            musicians: vec![
+                object! { id: "m1" },
+                object! { id: "m2" },
+                object! { id: "m3" },
+                object! { id: "m4" },
+            ]
+        };
+
+        match &result.to_result() {
+            // '$where' is not defined but nullable, ignore the argument
+            Ok(Some(data)) => {
+                assert_eq!(exp, *data);
+            }
+            // With GraphQL validations active, this query fails
+            Err(e) => match e.get(0).unwrap() {
+                QueryError::ExecutionError(QueryExecutionError::ValidationError(_pos, message)) => {
+                    assert_eq!(message, "Variable \"$where\" is not defined.");
+                }
+                r => panic!("unexpexted query error: {:?}", r),
+            },
+            r => {
+                panic!("unexpexted result: {:?}", r);
+            }
+        }
+    })
+}
+
+// see: graphql-bug-compat
+// Test that queries with nonmergeable fields do not cause a panic. Can be
+// deleted once queries are validated
+#[test]
+fn invalid_field_merge() {
+    const QUERY: &str = "query { musicians { t: id t: mainBand { id } } }";
+
+    run_query(QUERY, |result, _| {
+        assert!(result.has_errors());
+    })
+}
+
+/// What we expect the query to return: either a list of musician ids when
+/// the query should succeed (`Ok`) or a string that should appear in the
+/// error message when the query should return an `Err`. The error string
+/// can contain `@DEPLOYMENT@` which will be replaced with the deployment id
+type Expected = Result<Vec<&'static str>, &'static str>;
+
+fn check_musicians_at(query0: &str, block_var: r::Value, expected: Expected, qid: &'static str) {
+    run_query((query0, block_var), move |result, id_type| {
+        match &expected {
+            Ok(ids) => {
+                let ids: Vec<_> = ids.into_iter().map(|id| object! { id: *id }).collect();
+                let expected = Some(object_value(vec![("musicians", r::Value::List(ids))]));
+                let data = match result.to_result() {
+                    Err(errors) => panic!("unexpected error: {:?} ({})\n", errors, qid),
+                    Ok(data) => data,
+                };
+                assert_eq!(data, expected, "failed query: ({})", qid);
+            }
+            Err(msg) => {
+                let errors = match result.to_result() {
+                    Err(errors) => errors,
+                    Ok(_) => panic!(
+                        "expected error `{}` but got successful result ({})",
+                        msg, qid
+                    ),
+                };
+                let actual = errors
+                    .first()
+                    .expect("we expect one error message")
+                    .to_string();
+                let msg = msg.replace("@DEPLOYMENT@", id_type.deployment_id());
+                assert!(
+                    actual.contains(&msg),
+                    "expected error message `{}` but got {:?} ({})",
+                    msg,
+                    errors,
+                    qid
+                );
+            }
+        };
+    });
+}
+
+#[test]
+fn query_at_block() {
+    use test_store::block_store::{FakeBlock, BLOCK_ONE, BLOCK_THREE, BLOCK_TWO, GENESIS_BLOCK};
+
+    fn musicians_at(block: &str, expected: Expected, qid: &'static str) {
+        let query = format!("query {{ musicians(block: {{ {} }}) {{ id }} }}", block);
+        check_musicians_at(&query, object! {}, expected, qid);
+    }
+
+    fn hash(block: &FakeBlock) -> String {
+        format!("hash : \"0x{}\"", block.hash)
+    }
+
+    const BLOCK_NOT_INDEXED: &str = "subgraph @DEPLOYMENT@ has only indexed \
+         up to block number 1 and data for block number 7000 is therefore not yet available";
+    const BLOCK_NOT_INDEXED2: &str = "subgraph @DEPLOYMENT@ has only indexed \
+         up to block number 1 and data for block number 2 is therefore not yet available";
+    const BLOCK_HASH_NOT_FOUND: &str = "no block with that hash found";
+
+    musicians_at("number: 7000", Err(BLOCK_NOT_INDEXED), "n7000");
+    musicians_at("number: 0", Ok(vec!["m1", "m2"]), "n0");
+    musicians_at("number: 1", Ok(vec!["m1", "m2", "m3", "m4"]), "n1");
+
+    musicians_at(&hash(&*GENESIS_BLOCK), Ok(vec!["m1", "m2"]), "h0");
+    musicians_at(&hash(&*BLOCK_ONE), Ok(vec!["m1", "m2", "m3", "m4"]), "h1");
+    musicians_at(&hash(&*BLOCK_TWO), Err(BLOCK_NOT_INDEXED2), "h2");
+    musicians_at(&hash(&*BLOCK_THREE), Err(BLOCK_HASH_NOT_FOUND), "h3");
+}
+
+#[test]
+fn query_at_block_with_vars() {
+    use test_store::block_store::{FakeBlock, BLOCK_ONE, BLOCK_THREE, BLOCK_TWO, GENESIS_BLOCK};
+
+    fn musicians_at_nr(block: i32, expected: Expected, qid: &'static str) {
+        let query = "query by_nr($block: Int!) { musicians(block: { number: $block }) { id } }";
+        let var = object! { block: block };
+
+        check_musicians_at(query, var, expected.clone(), qid);
+
+        let query = "query by_nr($block: Block_height!) { musicians(block: $block) { id } }";
+        let var = object! { block: object! { number: block } };
+
+        check_musicians_at(query, var, expected, qid);
+    }
+
+    fn musicians_at_nr_gte(block: i32, expected: Expected, qid: &'static str) {
+        let query = "query by_nr($block: Int!) { musicians(block: { number_gte: $block }) { id } }";
+        let var = object! { block: block };
+
+        check_musicians_at(query, var, expected, qid);
+    }
+
+    fn musicians_at_hash(block: &FakeBlock, expected: Expected, qid: &'static str) {
+        let query = "query by_hash($block: Bytes!) { musicians(block: { hash: $block }) { id } }";
+        let var = object! { block: block.hash.to_string() };
+
+        check_musicians_at(query, var, expected, qid);
+    }
+
+    const BLOCK_NOT_INDEXED: &str = "subgraph @DEPLOYMENT@ has only indexed \
+         up to block number 1 and data for block number 7000 is therefore not yet available";
+    const BLOCK_NOT_INDEXED2: &str = "subgraph @DEPLOYMENT@ has only indexed \
+         up to block number 1 and data for block number 2 is therefore not yet available";
+    const BLOCK_HASH_NOT_FOUND: &str = "no block with that hash found";
+
+    musicians_at_nr(7000, Err(BLOCK_NOT_INDEXED), "n7000");
+    musicians_at_nr(0, Ok(vec!["m1", "m2"]), "n0");
+    musicians_at_nr(1, Ok(vec!["m1", "m2", "m3", "m4"]), "n1");
+
+    musicians_at_nr_gte(7000, Err(BLOCK_NOT_INDEXED), "ngte7000");
+    musicians_at_nr_gte(0, Ok(vec!["m1", "m2", "m3", "m4"]), "ngte0");
+    musicians_at_nr_gte(1, Ok(vec!["m1", "m2", "m3", "m4"]), "ngte1");
+
+    musicians_at_hash(&GENESIS_BLOCK, Ok(vec!["m1", "m2"]), "h0");
+    musicians_at_hash(&BLOCK_ONE, Ok(vec!["m1", "m2", "m3", "m4"]), "h1");
+    musicians_at_hash(&BLOCK_TWO, Err(BLOCK_NOT_INDEXED2), "h2");
+    musicians_at_hash(&BLOCK_THREE, Err(BLOCK_HASH_NOT_FOUND), "h3");
+}
+
+#[test]
+fn query_detects_reorg() {
+    async fn query_at(deployment: &DeploymentLocator, block: i32) -> QueryResult {
+        let query =
+            format!("query {{ musician(id: \"m1\", block: {{ number: {block} }}) {{ id }} }}");
+        execute_query(&deployment, &query).await
+    }
+
+    run_test_sequentially(|store| async move {
+        let deployment = setup(
+            store.as_ref(),
+            "graphqlQueryDetectsReorg",
+            BTreeSet::new(),
+            IdType::String,
+        )
+        .await;
+        // Initial state with latest block at block 1
+        let state = deployment_state(STORE.as_ref(), &deployment.hash).await;
+
+        // Inject a fake initial state; c435c25decbc4ad7bbbadf8e0ced0ff2
+        *graph_graphql::test_support::INITIAL_DEPLOYMENT_STATE_FOR_TESTS
+            .lock()
+            .unwrap() = Some(state);
+
+        // When there is no revert, queries work fine
+        let result = query_at(&deployment, 1).await;
+
+        assert_eq!(
+            extract_data!(result),
+            Some(object!(musician: object!(id: "m1")))
+        );
+
+        // Revert one block
+        revert_block(&*STORE, &deployment, &*GENESIS_PTR).await;
+
+        // A query is still fine since we query at block 0; we were at block
+        // 1 when we got `state`, and reorged once by one block, which can
+        // not affect block 0, and it's therefore ok to query at block 0
+        // even with a concurrent reorg
+        let result = query_at(&deployment, 0).await;
+        assert_eq!(
+            extract_data!(result),
+            Some(object!(musician: object!(id: "m1")))
+        );
+
+        // We move the subgraph head forward. The state we have is also for
+        // block 1, but with a smaller reorg count and we therefore report
+        // an error
+        test_store::transact_and_wait(
+            &STORE.subgraph_store(),
+            &deployment,
+            BLOCK_ONE.clone(),
+            vec![],
+        )
+        .await
+        .unwrap();
+
+        let result = query_at(&deployment, 1).await;
+        match result.to_result().unwrap_err()[0] {
+            QueryError::ExecutionError(QueryExecutionError::DeploymentReverted) => { /* expected */
+            }
+            _ => panic!("unexpected error from block reorg"),
+        }
+
+        // Reset the fake initial state; c435c25decbc4ad7bbbadf8e0ced0ff2
+        *graph_graphql::test_support::INITIAL_DEPLOYMENT_STATE_FOR_TESTS
+            .lock()
+            .unwrap() = None;
+    })
+}
+
+#[test]
+fn can_query_meta() {
+    // metadata for the latest block (block 1)
+    const QUERY1: &str =
+        "query { _meta { deployment block { hash number __typename } __typename } }";
+    run_query(QUERY1, |result, id_type| {
+        let exp = object! {
+            _meta: object! {
+                deployment: id_type.deployment_id(),
+                block: object! {
+                    hash: "0x8511fa04b64657581e3f00e14543c1d522d5d7e771b54aa3060b662ade47da13",
+                    number: 1,
+                    __typename: "_Block_"
+                },
+                __typename: "_Meta_"
+            },
+        };
+        assert_eq!(extract_data!(result), Some(exp));
+    });
+
+    // metadata for block 0 by number
+    const QUERY2: &str =
+        "query { _meta(block: { number: 0 }) { deployment block { hash number } } }";
+    run_query(QUERY2, |result, id_type| {
+        let exp = object! {
+            _meta: object! {
+                deployment: id_type.deployment_id(),
+                block: object! {
+                    hash: r::Value::Null,
+                    number: 0
+                },
+            },
+        };
+        assert_eq!(extract_data!(result), Some(exp));
+    });
+
+    // metadata for block 0 by hash
+    const QUERY3: &str = "query { _meta(block: { hash: \"bd34884280958002c51d3f7b5f853e6febeba33de0f40d15b0363006533c924f\" }) { \
+                                        deployment block { hash number } } }";
+    run_query(QUERY3, |result, id_type| {
+        let exp = object! {
+            _meta: object! {
+                deployment: id_type.deployment_id(),
+                block: object! {
+                    hash: "0xbd34884280958002c51d3f7b5f853e6febeba33de0f40d15b0363006533c924f",
+                    number: 0
+                },
+            },
+        };
+        assert_eq!(extract_data!(result), Some(exp));
+    });
+
+    // metadata for block 2, which is beyond what the subgraph has indexed
+    const QUERY4: &str =
+        "query { _meta(block: { number: 2 }) { deployment block { hash number } } }";
+    run_query(QUERY4, |result, _| {
+        assert!(result.has_errors());
+    });
+}
+
+#[test]
+fn non_fatal_errors() {
+    use serde_json::json;
+    use test_store::block_store::BLOCK_TWO;
+
+    run_test_sequentially(|store| async move {
+        let deployment = setup(
+            store.as_ref(),
+            "testNonFatalErrors",
+            BTreeSet::from_iter(Some(SubgraphFeature::NonFatalErrors)),
+            IdType::String,
+        )
+        .await;
+
+        let err = SubgraphError {
+            subgraph_id: deployment.hash.clone(),
+            message: "cow template handler could not moo event transaction".to_string(),
+            block_ptr: Some(BLOCK_TWO.block_ptr()),
+            handler: Some("handleMoo".to_string()),
+            deterministic: true,
+        };
+
+        transact_errors(&*STORE, &deployment, BLOCK_TWO.block_ptr(), vec![err])
+            .await
+            .unwrap();
+
+        // `subgraphError` is implicitly `deny`, data is omitted.
+        let query = "query { musician(id: \"m1\") { id } }";
+        let result = execute_query(&deployment, query).await;
+        let expected = json!({
+            "errors": [
+                {
+                    "message": "indexing_error"
+                }
+            ]
+        });
+        assert_eq!(expected, serde_json::to_value(&result).unwrap());
+
+        // Same result for explicit `deny`.
+        let query = "query { musician(id: \"m1\", subgraphError: deny) { id } }";
+        let result = execute_query(&deployment, query).await;
+        assert_eq!(expected, serde_json::to_value(&result).unwrap());
+
+        // But `_meta` is still returned.
+        let query = "query { musician(id: \"m1\") { id }  _meta { hasIndexingErrors } }";
+        let result = execute_query(&deployment, query).await;
+        let expected = json!({
+            "data": {
+                "_meta": {
+                    "hasIndexingErrors": true
+                }
+            },
+            "errors": [
+                {
+                    "message": "indexing_error"
+                }
+            ]
+        });
+        assert_eq!(expected, serde_json::to_value(&result).unwrap());
+
+        // With `allow`, the error remains but the data is included.
+        let query = "query { musician(id: \"m1\", subgraphError: allow) { id } }";
+        let result = execute_query(&deployment, query).await;
+        let expected = json!({
+            "data": {
+                "musician": {
+                    "id": "m1"
+                }
+            },
+            "errors": [
+                {
+                    "message": "indexing_error"
+                }
+            ]
+        });
+        assert_eq!(expected, serde_json::to_value(&result).unwrap());
+
+        // Test error reverts.
+        revert_block(&*STORE, &deployment, &*BLOCK_ONE).await;
+        let query = "query { musician(id: \"m1\") { id }  _meta { hasIndexingErrors } }";
+        let result = execute_query(&deployment, query).await;
+        let expected = json!({
+            "data": {
+                "musician": {
+                    "id": "m1"
+                },
+                "_meta": {
+                    "hasIndexingErrors": false
+                }
+            }
+        });
+        assert_eq!(expected, serde_json::to_value(&result).unwrap());
+    })
+}
+
+#[test]
+fn can_query_root_typename() {
+    const QUERY: &str = "query { __typename }";
+    run_query(QUERY, |result, _| {
+        let exp = object! {
+            __typename: "Query"
+        };
+        assert_eq!(extract_data!(result), Some(exp));
+    })
+}
+
+#[test]
+fn deterministic_error() {
+    use serde_json::json;
+    use test_store::block_store::BLOCK_TWO;
+
+    run_test_sequentially(|store| async move {
+        let deployment = setup(
+            store.as_ref(),
+            "testDeterministicError",
+            BTreeSet::new(),
+            IdType::String,
+        )
+        .await;
+
+        let err = SubgraphError {
+            subgraph_id: deployment.hash.clone(),
+            message: "cow template handler could not moo event transaction".to_string(),
+            block_ptr: Some(BLOCK_TWO.block_ptr()),
+            handler: Some("handleMoo".to_string()),
+            deterministic: true,
+        };
+
+        transact_errors(&*STORE, &deployment, BLOCK_TWO.block_ptr(), vec![err])
+            .await
+            .unwrap();
+
+        // `subgraphError` is implicitly `deny`, data is omitted.
+        let query = "query { musician(id: \"m1\") { id } }";
+        let result = execute_query(&deployment, query).await;
+        let expected = json!({
+            "errors": [
+                {
+                    "message": "indexing_error"
+                }
+            ]
+        });
+        assert_eq!(expected, serde_json::to_value(&result).unwrap());
+    })
+}
diff --git a/mock/Cargo.toml b/mock/Cargo.toml
new file mode 100644
index 0000000..7a3a79a
--- /dev/null
+++ b/mock/Cargo.toml
@@ -0,0 +1,7 @@
+[package]
+name = "graph-mock"
+version = "0.27.0"
+edition = "2021"
+
+[dependencies]
+graph = { path = "../graph" }
diff --git a/mock/src/lib.rs b/mock/src/lib.rs
new file mode 100644
index 0000000..8d4df4b
--- /dev/null
+++ b/mock/src/lib.rs
@@ -0,0 +1,3 @@
+mod metrics_registry;
+
+pub use self::metrics_registry::MockMetricsRegistry;
diff --git a/mock/src/metrics_registry.rs b/mock/src/metrics_registry.rs
new file mode 100644
index 0000000..0b45052
--- /dev/null
+++ b/mock/src/metrics_registry.rs
@@ -0,0 +1,87 @@
+use graph::components::metrics::{Collector, Counter, Gauge, Opts, PrometheusError};
+use graph::prelude::MetricsRegistry as MetricsRegistryTrait;
+use graph::prometheus::{CounterVec, GaugeVec, HistogramOpts, HistogramVec};
+
+use std::collections::HashMap;
+
+#[derive(Clone)]
+pub struct MockMetricsRegistry {}
+
+impl MockMetricsRegistry {
+    pub fn new() -> Self {
+        Self {}
+    }
+}
+
+impl MetricsRegistryTrait for MockMetricsRegistry {
+    fn register(&self, _name: &str, _c: Box<dyn Collector>) {
+        // Ignore, we do not register metrics
+    }
+
+    fn global_counter(
+        &self,
+        name: &str,
+        help: &str,
+        const_labels: HashMap<String, String>,
+    ) -> Result<Counter, PrometheusError> {
+        let opts = Opts::new(name, help).const_labels(const_labels);
+        Counter::with_opts(opts)
+    }
+
+    fn global_gauge(
+        &self,
+        name: &str,
+        help: &str,
+        const_labels: HashMap<String, String>,
+    ) -> Result<Gauge, PrometheusError> {
+        let opts = Opts::new(name, help).const_labels(const_labels);
+        Gauge::with_opts(opts)
+    }
+
+    fn unregister(&self, _: Box<dyn Collector>) {}
+
+    fn global_counter_vec(
+        &self,
+        name: &str,
+        help: &str,
+        variable_labels: &[&str],
+    ) -> Result<CounterVec, PrometheusError> {
+        let opts = Opts::new(name, help);
+        let counters = CounterVec::new(opts, variable_labels)?;
+        Ok(counters)
+    }
+
+    fn global_deployment_counter_vec(
+        &self,
+        name: &str,
+        help: &str,
+        subgraph: &str,
+        variable_labels: &[&str],
+    ) -> Result<CounterVec, PrometheusError> {
+        let opts = Opts::new(name, help).const_label("deployment", subgraph);
+        let counters = CounterVec::new(opts, variable_labels)?;
+        Ok(counters)
+    }
+
+    fn global_gauge_vec(
+        &self,
+        name: &str,
+        help: &str,
+        variable_labels: &[&str],
+    ) -> Result<GaugeVec, PrometheusError> {
+        let opts = Opts::new(name, help);
+        let gauges = GaugeVec::new(opts, variable_labels)?;
+        Ok(gauges)
+    }
+
+    fn global_histogram_vec(
+        &self,
+        name: &str,
+        help: &str,
+        variable_labels: &[&str],
+    ) -> Result<HistogramVec, PrometheusError> {
+        let opts = HistogramOpts::new(name, help);
+        let histograms = HistogramVec::new(opts, variable_labels)?;
+        Ok(histograms)
+    }
+}
diff --git a/node/Cargo.toml b/node/Cargo.toml
new file mode 100644
index 0000000..ddee868
--- /dev/null
+++ b/node/Cargo.toml
@@ -0,0 +1,47 @@
+[package]
+name = "graph-node"
+version = "0.27.0"
+edition = "2021"
+default-run = "graph-node"
+
+[[bin]]
+name = "graph-node"
+path = "src/main.rs"
+
+[[bin]]
+name = "graphman"
+path = "src/bin/manager.rs"
+
+[dependencies]
+clap = { version = "3.2.22", features = ["derive", "env"] }
+env_logger = "0.9.0"
+git-testament = "0.2"
+graphql-parser = "0.4.0"
+futures = { version = "0.3.1", features = ["compat"] }
+lazy_static = "1.2.0"
+url = "2.2.1"
+crossbeam-channel = "0.5.5"
+graph = { path = "../graph" }
+graph-core = { path = "../core" }
+graph-chain-arweave = { path = "../chain/arweave" }
+graph-chain-ethereum = { path = "../chain/ethereum" }
+graph-chain-near = { path = "../chain/near" }
+graph-chain-cosmos = { path = "../chain/cosmos" }
+graph-chain-substreams= { path = "../chain/substreams" }
+graph-graphql = { path = "../graphql" }
+graph-runtime-wasm = { path = "../runtime/wasm" }
+graph-server-http = { path = "../server/http" }
+graph-server-index-node = { path = "../server/index-node" }
+graph-server-json-rpc = { path = "../server/json-rpc"}
+graph-server-websocket = { path = "../server/websocket" }
+graph-server-metrics = { path = "../server/metrics" }
+graph-store-postgres = { path = "../store/postgres" }
+regex = "1.5.4"
+serde = { version = "1.0.126", features = ["derive", "rc"] }
+serde_regex = "1.1.0"
+toml = "0.5.7"
+shellexpand = "2.1.0"
+diesel = "1.4.8"
+http = "0.2.5" # must be compatible with the version rust-web3 uses
+prometheus = { version ="0.13.2", features = ["push"] }
+json-structural-diff = {version = "0.1", features = ["colorize"] }
diff --git a/node/resources/tests/full_config.toml b/node/resources/tests/full_config.toml
new file mode 100644
index 0000000..97d3be6
--- /dev/null
+++ b/node/resources/tests/full_config.toml
@@ -0,0 +1,70 @@
+[general]
+query = "query_node_.*"
+
+[store]
+[store.primary]
+connection = "postgresql://postgres:1.1.1.1@test/primary"
+pool_size = [
+  { node = "index_node_1_.*", size = 2 },
+  { node = "index_node_2_.*", size = 10 },
+  { node = "index_node_3_.*", size = 10 },
+  { node = "index_node_4_.*", size = 2 },
+  { node = "query_node_.*", size = 10 }
+]
+
+[store.shard_a]
+connection = "postgresql://postgres:1.1.1.1@test/shard-a"
+pool_size = [
+  { node = "index_node_1_.*", size = 2 },
+  { node = "index_node_2_.*", size = 10 },
+  { node = "index_node_3_.*", size = 10 },
+  { node = "index_node_4_.*", size = 2 },
+  { node = "query_node_.*", size = 10 }
+]
+
+[deployment]
+# Studio subgraphs
+[[deployment.rule]]
+match = { name = "^prefix/" }
+shard = "shard_a"
+indexers = [ "index_prefix_0",
+             "index_prefix_1" ]
+
+[[deployment.rule]]
+match = { name = "^custom/.*" }
+indexers = [ "index_custom_0" ]
+
+[[deployment.rule]]
+shards = [ "primary", "shard_a" ]
+indexers = [ "index_node_1_a",
+             "index_node_2_a",
+             "index_node_3_a" ]
+
+[chains]
+ingestor = "index_0"
+
+[chains.mainnet]
+shard = "primary"
+provider = [
+  { label = "mainnet-0", url = "http://rpc.mainnet.io", features = ["archive", "traces"] },
+  { label = "firehose", details = { type = "firehose", url = "http://localhost:9000", features = [] }},
+  { label = "substreams", details = { type = "substreams", url = "http://localhost:9000", features = [] }},
+]
+
+[chains.ropsten]
+shard = "primary"
+provider = [
+  { label = "ropsten-0", url = "http://rpc.ropsten.io", transport = "rpc", features = ["archive", "traces"] }
+]
+
+[chains.goerli]
+shard = "primary"
+provider = [
+  { label = "goerli-0", url = "http://rpc.goerli.io", transport = "ipc", features = ["archive"] }
+]
+
+[chains.kovan]
+shard = "primary"
+provider = [
+  { label = "kovan-0", url = "http://rpc.kovan.io", transport = "ws", features = [] }
+]
diff --git a/node/src/bin/manager.rs b/node/src/bin/manager.rs
new file mode 100644
index 0000000..f68a2db
--- /dev/null
+++ b/node/src/bin/manager.rs
@@ -0,0 +1,1073 @@
+use clap::{Parser, Subcommand};
+use config::PoolSize;
+use git_testament::{git_testament, render_testament};
+use graph::{data::graphql::effort::LoadManager, prelude::chrono, prometheus::Registry};
+use graph::{
+    log::logger,
+    prelude::{
+        anyhow::{self, Context as AnyhowContextTrait},
+        info, o, slog, tokio, Logger, NodeId, ENV_VARS,
+    },
+    url::Url,
+};
+use graph_chain_ethereum::{EthereumAdapter, EthereumNetworks};
+use graph_core::MetricsRegistry;
+use graph_graphql::prelude::GraphQlRunner;
+use graph_node::config::{self, Config as Cfg};
+use graph_node::manager::commands;
+use graph_node::{
+    chain::create_ethereum_networks,
+    manager::{deployment::DeploymentSearch, PanicSubscriptionManager},
+    store_builder::StoreBuilder,
+    MetricsContext,
+};
+use graph_store_postgres::ChainStore;
+use graph_store_postgres::{
+    connection_pool::ConnectionPool, BlockStore, NotificationSender, Shard, Store, SubgraphStore,
+    SubscriptionManager, PRIMARY_SHARD,
+};
+use lazy_static::lazy_static;
+use std::{collections::HashMap, env, num::ParseIntError, sync::Arc, time::Duration};
+const VERSION_LABEL_KEY: &str = "version";
+
+git_testament!(TESTAMENT);
+
+lazy_static! {
+    static ref RENDERED_TESTAMENT: String = render_testament!(TESTAMENT);
+}
+
+#[derive(Parser, Clone, Debug)]
+#[clap(
+    name = "graphman",
+    about = "Management tool for a graph-node infrastructure",
+    author = "Graph Protocol, Inc.",
+    version = RENDERED_TESTAMENT.as_str()
+)]
+pub struct Opt {
+    #[clap(
+        long,
+        short,
+        env = "GRAPH_NODE_CONFIG",
+        help = "the name of the configuration file\n"
+    )]
+    pub config: String,
+    #[clap(
+        long,
+        default_value = "default",
+        value_name = "NODE_ID",
+        env = "GRAPH_NODE_ID",
+        help = "a unique identifier for this node.\nShould have the same value between consecutive node restarts\n"
+    )]
+    pub node_id: String,
+    #[clap(
+        long,
+        value_name = "{HOST:PORT|URL}",
+        default_value = "https://api.thegraph.com/ipfs/",
+        env = "IPFS",
+        help = "HTTP addresses of IPFS nodes"
+    )]
+    pub ipfs: Vec<String>,
+    #[clap(
+        long,
+        default_value = "3",
+        help = "the size for connection pools. Set to 0\n to use pool size from configuration file\n corresponding to NODE_ID"
+    )]
+    pub pool_size: u32,
+    #[clap(long, value_name = "URL", help = "Base URL for forking subgraphs")]
+    pub fork_base: Option<String>,
+    #[clap(long, help = "version label, used for prometheus metrics")]
+    pub version_label: Option<String>,
+    #[clap(subcommand)]
+    pub cmd: Command,
+}
+
+#[derive(Clone, Debug, Subcommand)]
+pub enum Command {
+    /// Calculate the transaction speed
+    TxnSpeed {
+        #[clap(long, short, default_value = "60")]
+        delay: u64,
+    },
+    /// Print details about a deployment
+    ///
+    /// The deployment can be specified as either a subgraph name, an IPFS
+    /// hash `Qm..`, or the database namespace `sgdNNN`. Since the same IPFS
+    /// hash can be deployed in multiple shards, it is possible to specify
+    /// the shard by adding `:shard` to the IPFS hash.
+    Info {
+        /// The deployment (see above)
+        deployment: DeploymentSearch,
+        /// List only current version
+        #[clap(long, short)]
+        current: bool,
+        /// List only pending versions
+        #[clap(long, short)]
+        pending: bool,
+        /// Include status information
+        #[clap(long, short)]
+        status: bool,
+        /// List only used (current and pending) versions
+        #[clap(long, short)]
+        used: bool,
+    },
+    /// Manage unused deployments
+    ///
+    /// Record which deployments are unused with `record`, then remove them
+    /// with `remove`
+    #[clap(subcommand)]
+    Unused(UnusedCommand),
+    /// Remove a named subgraph
+    Remove {
+        /// The name of the subgraph to remove
+        name: String,
+    },
+    /// Create a subgraph name
+    Create {
+        /// The name of the subgraph to create
+        name: String,
+    },
+    /// Assign or reassign a deployment
+    Reassign {
+        /// The deployment (see `help info`)
+        deployment: DeploymentSearch,
+        /// The name of the node that should index the deployment
+        node: String,
+    },
+    /// Unassign a deployment
+    Unassign {
+        /// The deployment (see `help info`)
+        deployment: DeploymentSearch,
+    },
+    /// Rewind a subgraph to a specific block
+    Rewind {
+        /// Force rewinding even if the block hash is not found in the local
+        /// database
+        #[clap(long, short)]
+        force: bool,
+        /// Sleep for this many seconds after pausing subgraphs
+        #[clap(
+            long,
+            short,
+            default_value = "10",
+            parse(try_from_str = parse_duration_in_secs)
+        )]
+        sleep: Duration,
+        /// The block hash of the target block
+        block_hash: String,
+        /// The block number of the target block
+        block_number: i32,
+        /// The deployments to rewind (see `help info`)
+        deployments: Vec<DeploymentSearch>,
+    },
+    /// Deploy and run an arbitrary subgraph up to a certain block
+    ///
+    /// The run can surpass it by a few blocks, it's not exact (use for dev
+    /// and testing purposes) -- WARNING: WILL RUN MIGRATIONS ON THE DB, DO
+    /// NOT USE IN PRODUCTION
+    ///
+    /// Also worth noting that the deployed subgraph will be removed at the
+    /// end.
+    Run {
+        /// Network name (must fit one of the chain)
+        network_name: String,
+
+        /// Subgraph in the form `<IPFS Hash>` or `<name>:<IPFS Hash>`
+        subgraph: String,
+
+        /// Highest block number to process before stopping (inclusive)
+        stop_block: i32,
+
+        /// Prometheus push gateway endpoint.
+        prometheus_host: Option<String>,
+    },
+    /// Check and interrogate the configuration
+    ///
+    /// Print information about a configuration file without
+    /// actually connecting to databases or network clients
+    #[clap(subcommand)]
+    Config(ConfigCommand),
+    /// Listen for store events and print them
+    #[clap(subcommand)]
+    Listen(ListenCommand),
+    /// Manage deployment copies and grafts
+    #[clap(subcommand)]
+    Copy(CopyCommand),
+    /// Run a GraphQL query
+    Query {
+        /// Save the JSON query result in this file
+        #[clap(long, short)]
+        output: Option<String>,
+        /// Save the query trace in this file
+        #[clap(long, short)]
+        trace: Option<String>,
+
+        /// The subgraph to query
+        ///
+        /// Either a deployment id `Qm..` or a subgraph name
+        target: String,
+        /// The GraphQL query
+        query: String,
+        /// The variables in the form `key=value`
+        vars: Vec<String>,
+    },
+    /// Get information about chains and manipulate them
+    #[clap(subcommand)]
+    Chain(ChainCommand),
+    /// Manipulate internal subgraph statistics
+    #[clap(subcommand)]
+    Stats(StatsCommand),
+
+    /// Manage database indexes
+    #[clap(subcommand)]
+    Index(IndexCommand),
+
+    /// Prune deployments
+    Prune {
+        /// The deployment to prune (see `help info`)
+        deployment: DeploymentSearch,
+        /// Prune tables with a ratio of entities to entity versions lower than this
+        #[clap(long, short, default_value = "0.20")]
+        prune_ratio: f64,
+        /// How much history to keep in blocks
+        #[clap(long, short, default_value = "10000")]
+        history: usize,
+    },
+}
+
+impl Command {
+    /// Return `true` if the command should not override connection pool
+    /// sizes, in general only when we will not actually connect to any
+    /// databases
+    fn use_configured_pool_size(&self) -> bool {
+        matches!(self, Command::Config(_))
+    }
+}
+
+#[derive(Clone, Debug, Subcommand)]
+pub enum UnusedCommand {
+    /// List unused deployments
+    List {
+        /// Only list unused deployments that still exist
+        #[clap(short, long)]
+        existing: bool,
+    },
+    /// Update and record currently unused deployments
+    Record,
+    /// Remove deployments that were marked as unused with `record`.
+    ///
+    /// Deployments are removed in descending order of number of entities,
+    /// i.e., smaller deployments are removed before larger ones
+    Remove {
+        /// How many unused deployments to remove (default: all)
+        #[clap(short, long)]
+        count: Option<usize>,
+        /// Remove a specific deployment
+        #[clap(short, long, conflicts_with = "count")]
+        deployment: Option<String>,
+        /// Remove unused deployments that were recorded at least this many minutes ago
+        #[clap(short, long)]
+        older: Option<u32>,
+    },
+}
+
+#[derive(Clone, Debug, Subcommand)]
+pub enum ConfigCommand {
+    /// Check and validate the configuration file
+    Check {
+        /// Print the configuration as JSON
+        #[clap(long)]
+        print: bool,
+    },
+    /// Print how a specific subgraph would be placed
+    Place {
+        /// The name of the subgraph
+        name: String,
+        /// The network the subgraph indexes
+        network: String,
+    },
+    /// Information about the size of database pools
+    Pools {
+        /// The names of the nodes that are going to run
+        nodes: Vec<String>,
+        /// Print connections by shard rather than by node
+        #[clap(short, long)]
+        shard: bool,
+    },
+    /// Show eligible providers
+    ///
+    /// Prints the providers that can be used for a deployment on a given
+    /// network with the given features. Set the name of the node for which
+    /// to simulate placement with the toplevel `--node-id` option
+    Provider {
+        #[clap(short, long, default_value = "")]
+        features: String,
+        network: String,
+    },
+}
+
+#[derive(Clone, Debug, Subcommand)]
+pub enum ListenCommand {
+    /// Listen only to assignment events
+    Assignments,
+    /// Listen to events for entities in a specific deployment
+    Entities {
+        /// The deployment (see `help info`).
+        deployment: DeploymentSearch,
+        /// The entity types for which to print change notifications
+        entity_types: Vec<String>,
+    },
+}
+#[derive(Clone, Debug, Subcommand)]
+pub enum CopyCommand {
+    /// Create a copy of an existing subgraph
+    ///
+    /// The copy will be treated as its own deployment. The deployment with
+    /// IPFS hash `src` will be copied to a new deployment in the database
+    /// shard `shard` and will be assigned to `node` for indexing. The new
+    /// subgraph will start as a copy of all blocks of `src` that are
+    /// `offset` behind the current subgraph head of `src`. The offset
+    /// should be chosen such that only final blocks are copied
+    Create {
+        /// How far behind `src` subgraph head to copy
+        #[clap(long, short, default_value = "200")]
+        offset: u32,
+        /// The source deployment (see `help info`)
+        src: DeploymentSearch,
+        /// The name of the database shard into which to copy
+        shard: String,
+        /// The name of the node that should index the copy
+        node: String,
+    },
+    /// Activate the copy of a deployment.
+    ///
+    /// This will route queries to that specific copy (with some delay); the
+    /// previously active copy will become inactive. Only copies that have
+    /// progressed at least as far as the original should be activated.
+    Activate {
+        /// The IPFS hash of the deployment to activate
+        deployment: String,
+        /// The name of the database shard that holds the copy
+        shard: String,
+    },
+    /// List all currently running copy and graft operations
+    List,
+    /// Print the progress of a copy operation
+    Status {
+        /// The destination deployment of the copy operation (see `help info`)
+        dst: DeploymentSearch,
+    },
+}
+
+#[derive(Clone, Debug, Subcommand)]
+pub enum ChainCommand {
+    /// List all chains that are in the database
+    List,
+    /// Show information about a chain
+    Info {
+        #[clap(
+            long,
+            short,
+            default_value = "50",
+            env = "ETHEREUM_REORG_THRESHOLD",
+            help = "the reorg threshold to check\n"
+        )]
+        reorg_threshold: i32,
+        #[clap(long, help = "display block hashes\n")]
+        hashes: bool,
+        name: String,
+    },
+    /// Remove a chain and all its data
+    ///
+    /// There must be no deployments using that chain. If there are, the
+    /// subgraphs and/or deployments using the chain must first be removed
+    Remove { name: String },
+
+    /// Compares cached blocks with fresh ones and clears the block cache when they differ.
+    CheckBlocks {
+        #[clap(subcommand)] // Note that we mark a field as a subcommand
+        method: CheckBlockMethod,
+
+        /// Chain name (must be an existing chain, see 'chain list')
+        #[clap(empty_values = false)]
+        chain_name: String,
+    },
+    /// Truncates the whole block cache for the given chain.
+    Truncate {
+        /// Chain name (must be an existing chain, see 'chain list')
+        #[clap(empty_values = false)]
+        chain_name: String,
+        /// Skips confirmation prompt
+        #[clap(long, short)]
+        force: bool,
+    },
+}
+
+#[derive(Clone, Debug, Subcommand)]
+pub enum StatsCommand {
+    /// Toggle whether a table is account-like
+    ///
+    /// Setting a table to 'account-like' enables a query optimization that
+    /// is very effective for tables with a high ratio of entity versions
+    /// to distinct entities. It can take up to 5 minutes for this to take
+    /// effect.
+    AccountLike {
+        #[clap(long, short, help = "do not set but clear the account-like flag\n")]
+        clear: bool,
+        /// The deployment (see `help info`).
+        deployment: DeploymentSearch,
+        /// The name of the database table
+        table: String,
+    },
+    /// Show statistics for the tables of a deployment
+    ///
+    /// Show how many distinct entities and how many versions the tables of
+    /// each subgraph have. The data is based on the statistics that
+    /// Postgres keeps, and only refreshed when a table is analyzed.
+    Show {
+        /// The deployment (see `help info`).
+        deployment: DeploymentSearch,
+    },
+    /// Perform a SQL ANALYZE in a Entity table
+    Analyze {
+        /// The deployment (see `help info`).
+        deployment: DeploymentSearch,
+        /// The name of the Entity to ANALYZE, in camel case
+        entity: String,
+    },
+}
+
+#[derive(Clone, Debug, Subcommand)]
+pub enum IndexCommand {
+    /// Creates a new database index.
+    ///
+    /// The new index will be created concurrenly for the provided entity and its fields. whose
+    /// names must be declared the in camel case, following GraphQL conventions.
+    ///
+    /// The index will have its validity checked after the operation and will be dropped if it is
+    /// invalid.
+    ///
+    /// This command may be time-consuming.
+    Create {
+        /// The deployment (see `help info`).
+        #[clap(empty_values = false)]
+        deployment: DeploymentSearch,
+        /// The Entity name.
+        ///
+        /// Can be expressed either in upper camel case (as its GraphQL definition) or in snake case
+        /// (as its SQL table name).
+        #[clap(empty_values = false)]
+        entity: String,
+        /// The Field names.
+        ///
+        /// Each field can be expressed either in camel case (as its GraphQL definition) or in snake
+        /// case (as its SQL colmun name).
+        #[clap(min_values = 1, required = true)]
+        fields: Vec<String>,
+        /// The index method. Defaults to `btree`.
+        #[clap(
+            short, long, default_value = "btree",
+            possible_values = &["btree", "hash", "gist", "spgist", "gin", "brin"]
+        )]
+        method: String,
+    },
+    /// Lists existing indexes for a given Entity
+    List {
+        /// The deployment (see `help info`).
+        #[clap(empty_values = false)]
+        deployment: DeploymentSearch,
+        /// The Entity name.
+        ///
+        /// Can be expressed either in upper camel case (as its GraphQL definition) or in snake case
+        /// (as its SQL table name).
+        #[clap(empty_values = false)]
+        entity: String,
+    },
+
+    /// Drops an index for a given deployment, concurrently
+    Drop {
+        /// The deployment (see `help info`).
+        #[clap(empty_values = false)]
+        deployment: DeploymentSearch,
+        /// The name of the index to be dropped
+        #[clap(empty_values = false)]
+        index_name: String,
+    },
+}
+
+#[derive(Clone, Debug, Subcommand)]
+pub enum CheckBlockMethod {
+    /// The number of the target block
+    ByHash { hash: String },
+
+    /// The hash of the target block
+    ByNumber { number: i32 },
+
+    /// A block number range, inclusive on both ends.
+    ByRange {
+        #[clap(long, short)]
+        from: Option<i32>,
+        #[clap(long, short)]
+        to: Option<i32>,
+    },
+}
+
+impl From<Opt> for config::Opt {
+    fn from(opt: Opt) -> Self {
+        let mut config_opt = config::Opt::default();
+        config_opt.config = Some(opt.config);
+        config_opt.store_connection_pool_size = 5;
+        config_opt.node_id = opt.node_id;
+        config_opt
+    }
+}
+
+/// Utilities to interact mostly with the store and build the parts of the
+/// store we need for specific commands
+struct Context {
+    logger: Logger,
+    node_id: NodeId,
+    config: Cfg,
+    ipfs_url: Vec<String>,
+    fork_base: Option<Url>,
+    registry: Arc<MetricsRegistry>,
+    pub prometheus_registry: Arc<Registry>,
+}
+
+impl Context {
+    fn new(
+        logger: Logger,
+        node_id: NodeId,
+        config: Cfg,
+        ipfs_url: Vec<String>,
+        fork_base: Option<Url>,
+        version_label: Option<String>,
+    ) -> Self {
+        let prometheus_registry = Arc::new(
+            Registry::new_custom(
+                None,
+                version_label.map(|label| {
+                    let mut m = HashMap::<String, String>::new();
+                    m.insert(VERSION_LABEL_KEY.into(), label);
+                    m
+                }),
+            )
+            .expect("unable to build prometheus registry"),
+        );
+        let registry = Arc::new(MetricsRegistry::new(
+            logger.clone(),
+            prometheus_registry.clone(),
+        ));
+
+        Self {
+            logger,
+            node_id,
+            config,
+            ipfs_url,
+            fork_base,
+            registry,
+            prometheus_registry,
+        }
+    }
+
+    fn metrics_registry(&self) -> Arc<MetricsRegistry> {
+        self.registry.clone()
+    }
+
+    fn config(&self) -> Cfg {
+        self.config.clone()
+    }
+
+    fn node_id(&self) -> NodeId {
+        self.node_id.clone()
+    }
+
+    fn notification_sender(&self) -> Arc<NotificationSender> {
+        Arc::new(NotificationSender::new(self.registry.clone()))
+    }
+
+    fn primary_pool(self) -> ConnectionPool {
+        let primary = self.config.primary_store();
+        let pool = StoreBuilder::main_pool(
+            &self.logger,
+            &self.node_id,
+            PRIMARY_SHARD.as_str(),
+            primary,
+            self.metrics_registry(),
+            Arc::new(vec![]),
+        );
+        pool.skip_setup();
+        pool
+    }
+
+    fn subgraph_store(self) -> Arc<SubgraphStore> {
+        self.store_and_pools().0.subgraph_store()
+    }
+
+    fn subscription_manager(&self) -> Arc<SubscriptionManager> {
+        let primary = self.config.primary_store();
+
+        Arc::new(SubscriptionManager::new(
+            self.logger.clone(),
+            primary.connection.to_owned(),
+            self.registry.clone(),
+        ))
+    }
+
+    fn primary_and_subscription_manager(self) -> (ConnectionPool, Arc<SubscriptionManager>) {
+        let mgr = self.subscription_manager();
+        let primary_pool = self.primary_pool();
+
+        (primary_pool, mgr)
+    }
+
+    fn store(self) -> Arc<Store> {
+        let (store, _) = self.store_and_pools();
+        store
+    }
+
+    fn pools(self) -> HashMap<Shard, ConnectionPool> {
+        let (_, pools) = self.store_and_pools();
+        pools
+    }
+
+    async fn store_builder(&self) -> StoreBuilder {
+        StoreBuilder::new(
+            &self.logger,
+            &self.node_id,
+            &self.config,
+            self.fork_base.clone(),
+            self.registry.clone(),
+        )
+        .await
+    }
+
+    fn store_and_pools(self) -> (Arc<Store>, HashMap<Shard, ConnectionPool>) {
+        let (subgraph_store, pools) = StoreBuilder::make_subgraph_store_and_pools(
+            &self.logger,
+            &self.node_id,
+            &self.config,
+            self.fork_base,
+            self.registry,
+        );
+
+        for pool in pools.values() {
+            pool.skip_setup();
+        }
+
+        let store = StoreBuilder::make_store(
+            &self.logger,
+            pools.clone(),
+            subgraph_store,
+            HashMap::default(),
+            vec![],
+        );
+
+        (store, pools)
+    }
+
+    fn store_and_primary(self) -> (Arc<Store>, ConnectionPool) {
+        let (store, pools) = self.store_and_pools();
+        let primary = pools.get(&*PRIMARY_SHARD).expect("there is a primary pool");
+        (store, primary.clone())
+    }
+
+    fn block_store_and_primary_pool(self) -> (Arc<BlockStore>, ConnectionPool) {
+        let (store, pools) = self.store_and_pools();
+
+        let primary = pools.get(&*PRIMARY_SHARD).unwrap();
+        (store.block_store(), primary.clone())
+    }
+
+    fn graphql_runner(self) -> Arc<GraphQlRunner<Store, PanicSubscriptionManager>> {
+        let logger = self.logger.clone();
+        let registry = self.registry.clone();
+
+        let store = self.store();
+
+        let subscription_manager = Arc::new(PanicSubscriptionManager);
+        let load_manager = Arc::new(LoadManager::new(&logger, vec![], registry.clone()));
+
+        Arc::new(GraphQlRunner::new(
+            &logger,
+            store,
+            subscription_manager,
+            load_manager,
+            registry,
+        ))
+    }
+
+    async fn ethereum_networks(&self) -> anyhow::Result<EthereumNetworks> {
+        let logger = self.logger.clone();
+        let registry = self.metrics_registry();
+        create_ethereum_networks(logger, registry, &self.config).await
+    }
+
+    fn chain_store(self, chain_name: &str) -> anyhow::Result<Arc<ChainStore>> {
+        use graph::components::store::BlockStore;
+        self.store()
+            .block_store()
+            .chain_store(&chain_name)
+            .ok_or_else(|| anyhow::anyhow!("Could not find a network named '{}'", chain_name))
+    }
+
+    async fn chain_store_and_adapter(
+        self,
+        chain_name: &str,
+    ) -> anyhow::Result<(Arc<ChainStore>, Arc<EthereumAdapter>)> {
+        let ethereum_networks = self.ethereum_networks().await?;
+        let chain_store = self.chain_store(chain_name)?;
+        let ethereum_adapter = ethereum_networks
+            .networks
+            .get(chain_name)
+            .map(|adapters| adapters.cheapest())
+            .flatten()
+            .ok_or(anyhow::anyhow!(
+                "Failed to obtain an Ethereum adapter for chain '{}'",
+                chain_name
+            ))?;
+        Ok((chain_store, ethereum_adapter))
+    }
+}
+
+#[tokio::main]
+async fn main() -> anyhow::Result<()> {
+    let opt = Opt::parse();
+
+    let version_label = opt.version_label.clone();
+    // Set up logger
+    let logger = match ENV_VARS.log_levels {
+        Some(_) => logger(false),
+        None => Logger::root(slog::Discard, o!()),
+    };
+
+    // Log version information
+    info!(
+        logger,
+        "Graph Node version: {}",
+        render_testament!(TESTAMENT)
+    );
+
+    let mut config = Cfg::load(&logger, &opt.clone().into()).context("Configuration error")?;
+
+    if opt.pool_size > 0 && !opt.cmd.use_configured_pool_size() {
+        // Override pool size from configuration
+        for shard in config.stores.values_mut() {
+            shard.pool_size = PoolSize::Fixed(opt.pool_size);
+            for replica in shard.replicas.values_mut() {
+                replica.pool_size = PoolSize::Fixed(opt.pool_size);
+            }
+        }
+    }
+
+    let node = match NodeId::new(&opt.node_id) {
+        Err(()) => {
+            eprintln!("invalid node id: {}", opt.node_id);
+            std::process::exit(1);
+        }
+        Ok(node) => node,
+    };
+
+    let fork_base = match &opt.fork_base {
+        Some(url) => {
+            // Make sure the endpoint ends with a terminating slash.
+            let url = if !url.ends_with("/") {
+                let mut url = url.clone();
+                url.push('/');
+                Url::parse(&url)
+            } else {
+                Url::parse(url)
+            };
+
+            match url {
+                Err(e) => {
+                    eprintln!("invalid fork base URL: {}", e);
+                    std::process::exit(1);
+                }
+                Ok(url) => Some(url),
+            }
+        }
+        None => None,
+    };
+
+    let ctx = Context::new(
+        logger.clone(),
+        node,
+        config,
+        opt.ipfs,
+        fork_base,
+        version_label.clone(),
+    );
+
+    use Command::*;
+    match opt.cmd {
+        TxnSpeed { delay } => commands::txn_speed::run(ctx.primary_pool(), delay),
+        Info {
+            deployment,
+            current,
+            pending,
+            status,
+            used,
+        } => {
+            let (primary, store) = if status {
+                let (store, primary) = ctx.store_and_primary();
+                (primary.clone(), Some(store))
+            } else {
+                (ctx.primary_pool(), None)
+            };
+            commands::info::run(primary, store, deployment, current, pending, used)
+        }
+        Unused(cmd) => {
+            let store = ctx.subgraph_store();
+            use UnusedCommand::*;
+
+            match cmd {
+                List { existing } => commands::unused_deployments::list(store, existing),
+                Record => commands::unused_deployments::record(store),
+                Remove {
+                    count,
+                    deployment,
+                    older,
+                } => {
+                    let count = count.unwrap_or(1_000_000);
+                    let older = older.map(|older| chrono::Duration::minutes(older as i64));
+                    commands::unused_deployments::remove(store, count, deployment, older)
+                }
+            }
+        }
+        Config(cmd) => {
+            use ConfigCommand::*;
+
+            match cmd {
+                Place { name, network } => {
+                    commands::config::place(&ctx.config.deployment, &name, &network)
+                }
+                Check { print } => commands::config::check(&ctx.config, print),
+                Pools { nodes, shard } => commands::config::pools(&ctx.config, nodes, shard),
+                Provider { features, network } => {
+                    let logger = ctx.logger.clone();
+                    let registry = ctx.registry.clone();
+                    commands::config::provider(logger, &ctx.config, registry, features, network)
+                        .await
+                }
+            }
+        }
+        Remove { name } => commands::remove::run(ctx.subgraph_store(), name),
+        Create { name } => commands::create::run(ctx.subgraph_store(), name),
+        Unassign { deployment } => {
+            let sender = ctx.notification_sender();
+            commands::assign::unassign(ctx.primary_pool(), &sender, &deployment).await
+        }
+        Reassign { deployment, node } => {
+            let sender = ctx.notification_sender();
+            commands::assign::reassign(ctx.primary_pool(), &sender, &deployment, node)
+        }
+        Rewind {
+            force,
+            sleep,
+            block_hash,
+            block_number,
+            deployments,
+        } => {
+            let (store, primary) = ctx.store_and_primary();
+            commands::rewind::run(
+                primary,
+                store,
+                deployments,
+                block_hash,
+                block_number,
+                force,
+                sleep,
+            )
+            .await
+        }
+        Run {
+            network_name,
+            subgraph,
+            stop_block,
+            prometheus_host,
+        } => {
+            let logger = ctx.logger.clone();
+            let config = ctx.config();
+            let registry = ctx.metrics_registry().clone();
+            let node_id = ctx.node_id().clone();
+            let store_builder = ctx.store_builder().await;
+            let job_name = version_label.clone();
+            let ipfs_url = ctx.ipfs_url.clone();
+            let metrics_ctx = MetricsContext {
+                prometheus: ctx.prometheus_registry.clone(),
+                registry: registry.clone(),
+                prometheus_host,
+                job_name,
+            };
+
+            commands::run::run(
+                logger,
+                store_builder,
+                network_name,
+                ipfs_url,
+                config,
+                metrics_ctx,
+                node_id,
+                subgraph,
+                stop_block,
+            )
+            .await
+        }
+        Listen(cmd) => {
+            use ListenCommand::*;
+            match cmd {
+                Assignments => commands::listen::assignments(ctx.subscription_manager()).await,
+                Entities {
+                    deployment,
+                    entity_types,
+                } => {
+                    let (primary, mgr) = ctx.primary_and_subscription_manager();
+                    commands::listen::entities(primary, mgr, &deployment, entity_types).await
+                }
+            }
+        }
+        Copy(cmd) => {
+            use CopyCommand::*;
+            match cmd {
+                Create {
+                    src,
+                    shard,
+                    node,
+                    offset,
+                } => {
+                    let shards: Vec<_> = ctx.config.stores.keys().cloned().collect();
+                    let (store, primary) = ctx.store_and_primary();
+                    commands::copy::create(store, primary, src, shard, shards, node, offset).await
+                }
+                Activate { deployment, shard } => {
+                    commands::copy::activate(ctx.subgraph_store(), deployment, shard)
+                }
+                List => commands::copy::list(ctx.pools()),
+                Status { dst } => commands::copy::status(ctx.pools(), &dst),
+            }
+        }
+        Query {
+            output,
+            trace,
+            target,
+            query,
+            vars,
+        } => commands::query::run(ctx.graphql_runner(), target, query, vars, output, trace).await,
+        Chain(cmd) => {
+            use ChainCommand::*;
+            match cmd {
+                List => {
+                    let (block_store, primary) = ctx.block_store_and_primary_pool();
+                    commands::chain::list(primary, block_store).await
+                }
+                Info {
+                    name,
+                    reorg_threshold,
+                    hashes,
+                } => {
+                    let (block_store, primary) = ctx.block_store_and_primary_pool();
+                    commands::chain::info(primary, block_store, name, reorg_threshold, hashes).await
+                }
+                Remove { name } => {
+                    let (block_store, primary) = ctx.block_store_and_primary_pool();
+                    commands::chain::remove(primary, block_store, name)
+                }
+                CheckBlocks { method, chain_name } => {
+                    use commands::check_blocks::{by_hash, by_number, by_range};
+                    use CheckBlockMethod::*;
+                    let logger = ctx.logger.clone();
+                    let (chain_store, ethereum_adapter) =
+                        ctx.chain_store_and_adapter(&chain_name).await?;
+                    match method {
+                        ByHash { hash } => {
+                            by_hash(&hash, chain_store, &ethereum_adapter, &logger).await
+                        }
+                        ByNumber { number } => {
+                            by_number(number, chain_store, &ethereum_adapter, &logger).await
+                        }
+                        ByRange { from, to } => {
+                            by_range(chain_store, &ethereum_adapter, from, to, &logger).await
+                        }
+                    }
+                }
+                Truncate { chain_name, force } => {
+                    use commands::check_blocks::truncate;
+                    let chain_store = ctx.chain_store(&chain_name)?;
+                    truncate(chain_store, force)
+                }
+            }
+        }
+        Stats(cmd) => {
+            use StatsCommand::*;
+            match cmd {
+                AccountLike {
+                    clear,
+                    deployment,
+                    table,
+                } => {
+                    let (store, primary_pool) = ctx.store_and_primary();
+                    let subgraph_store = store.subgraph_store();
+                    commands::stats::account_like(
+                        subgraph_store,
+                        primary_pool,
+                        clear,
+                        &deployment,
+                        table,
+                    )
+                    .await
+                }
+                Show { deployment } => commands::stats::show(ctx.pools(), &deployment),
+                Analyze { deployment, entity } => {
+                    let (store, primary_pool) = ctx.store_and_primary();
+                    let subgraph_store = store.subgraph_store();
+                    commands::stats::analyze(subgraph_store, primary_pool, deployment, &entity)
+                }
+            }
+        }
+        Index(cmd) => {
+            use IndexCommand::*;
+            let (store, primary_pool) = ctx.store_and_primary();
+            let subgraph_store = store.subgraph_store();
+            match cmd {
+                Create {
+                    deployment,
+                    entity,
+                    fields,
+                    method,
+                } => {
+                    commands::index::create(
+                        subgraph_store,
+                        primary_pool,
+                        deployment,
+                        &entity,
+                        fields,
+                        method,
+                    )
+                    .await
+                }
+                List { deployment, entity } => {
+                    commands::index::list(subgraph_store, primary_pool, deployment, &entity).await
+                }
+                Drop {
+                    deployment,
+                    index_name,
+                } => {
+                    commands::index::drop(subgraph_store, primary_pool, deployment, &index_name)
+                        .await
+                }
+            }
+        }
+        Prune {
+            deployment,
+            history,
+            prune_ratio,
+        } => {
+            let (store, primary_pool) = ctx.store_and_primary();
+            commands::prune::run(store, primary_pool, deployment, history, prune_ratio).await
+        }
+    }
+}
+
+fn parse_duration_in_secs(s: &str) -> Result<Duration, ParseIntError> {
+    Ok(Duration::from_secs(s.parse()?))
+}
diff --git a/node/src/chain.rs b/node/src/chain.rs
new file mode 100644
index 0000000..a7713d2
--- /dev/null
+++ b/node/src/chain.rs
@@ -0,0 +1,522 @@
+use crate::config::{Config, ProviderDetails};
+use ethereum::{EthereumNetworks, ProviderEthRpcMetrics};
+use futures::future::join_all;
+use futures::TryFutureExt;
+use graph::anyhow::Error;
+use graph::blockchain::{Block as BlockchainBlock, BlockchainKind, ChainIdentifier};
+use graph::cheap_clone::CheapClone;
+use graph::firehose::{FirehoseEndpoint, FirehoseNetworks};
+use graph::ipfs_client::IpfsClient;
+use graph::prelude::{anyhow, tokio};
+use graph::prelude::{prost, MetricsRegistry as MetricsRegistryTrait};
+use graph::slog::{debug, error, info, o, Logger};
+use graph::url::Url;
+use graph::util::security::SafeDisplay;
+use graph_chain_ethereum::{self as ethereum, EthereumAdapterTrait, Transport};
+use std::collections::{BTreeMap, HashMap};
+use std::sync::Arc;
+use std::time::Duration;
+
+// The status of a provider that we learned from connecting to it
+#[derive(PartialEq)]
+enum ProviderNetworkStatus {
+    Broken {
+        chain_id: String,
+        provider: String,
+    },
+    Version {
+        chain_id: String,
+        ident: ChainIdentifier,
+    },
+}
+
+/// How long we will hold up node startup to get the net version and genesis
+/// hash from the client. If we can't get it within that time, we'll try and
+/// continue regardless.
+const NET_VERSION_WAIT_TIME: Duration = Duration::from_secs(30);
+
+pub fn create_ipfs_clients(logger: &Logger, ipfs_addresses: &Vec<String>) -> Vec<IpfsClient> {
+    // Parse the IPFS URL from the `--ipfs` command line argument
+    let ipfs_addresses: Vec<_> = ipfs_addresses
+        .iter()
+        .map(|uri| {
+            if uri.starts_with("http://") || uri.starts_with("https://") {
+                String::from(uri)
+            } else {
+                format!("http://{}", uri)
+            }
+        })
+        .collect();
+
+    ipfs_addresses
+        .into_iter()
+        .map(|ipfs_address| {
+            info!(
+                logger,
+                "Trying IPFS node at: {}",
+                SafeDisplay(&ipfs_address)
+            );
+
+            let ipfs_client = match IpfsClient::new(&ipfs_address) {
+                Ok(ipfs_client) => ipfs_client,
+                Err(e) => {
+                    error!(
+                        logger,
+                        "Failed to create IPFS client for `{}`: {}",
+                        SafeDisplay(&ipfs_address),
+                        e
+                    );
+                    panic!("Could not connect to IPFS");
+                }
+            };
+
+            // Test the IPFS client by getting the version from the IPFS daemon
+            let ipfs_test = ipfs_client.cheap_clone();
+            let ipfs_ok_logger = logger.clone();
+            let ipfs_err_logger = logger.clone();
+            let ipfs_address_for_ok = ipfs_address.clone();
+            let ipfs_address_for_err = ipfs_address.clone();
+            graph::spawn(async move {
+                ipfs_test
+                    .test()
+                    .map_err(move |e| {
+                        error!(
+                            ipfs_err_logger,
+                            "Is there an IPFS node running at \"{}\"?",
+                            SafeDisplay(ipfs_address_for_err),
+                        );
+                        panic!("Failed to connect to IPFS: {}", e);
+                    })
+                    .map_ok(move |_| {
+                        info!(
+                            ipfs_ok_logger,
+                            "Successfully connected to IPFS node at: {}",
+                            SafeDisplay(ipfs_address_for_ok)
+                        );
+                    })
+                    .await
+            });
+
+            ipfs_client
+        })
+        .collect()
+}
+
+/// Parses an Ethereum connection string and returns the network name and Ethereum adapter.
+pub async fn create_ethereum_networks(
+    logger: Logger,
+    registry: Arc<dyn MetricsRegistryTrait>,
+    config: &Config,
+) -> Result<EthereumNetworks, anyhow::Error> {
+    let eth_rpc_metrics = Arc::new(ProviderEthRpcMetrics::new(registry));
+    let mut parsed_networks = EthereumNetworks::new();
+    for (name, chain) in &config.chains.chains {
+        if chain.protocol != BlockchainKind::Ethereum {
+            continue;
+        }
+
+        for provider in &chain.providers {
+            if let ProviderDetails::Web3(web3) = &provider.details {
+                let capabilities = web3.node_capabilities();
+
+                let logger = logger.new(o!("provider" => provider.label.clone()));
+                info!(
+                    logger,
+                    "Creating transport";
+                    "url" => &web3.url,
+                    "capabilities" => capabilities
+                );
+
+                use crate::config::Transport::*;
+
+                let transport = match web3.transport {
+                    Rpc => Transport::new_rpc(Url::parse(&web3.url)?, web3.headers.clone()),
+                    Ipc => Transport::new_ipc(&web3.url).await,
+                    Ws => Transport::new_ws(&web3.url).await,
+                };
+
+                let supports_eip_1898 = !web3.features.contains("no_eip1898");
+
+                parsed_networks.insert(
+                    name.to_string(),
+                    capabilities,
+                    Arc::new(
+                        graph_chain_ethereum::EthereumAdapter::new(
+                            logger,
+                            provider.label.clone(),
+                            &web3.url,
+                            transport,
+                            eth_rpc_metrics.clone(),
+                            supports_eip_1898,
+                        )
+                        .await,
+                    ),
+                    web3.limit_for(&config.node),
+                );
+            }
+        }
+    }
+    parsed_networks.sort();
+    Ok(parsed_networks)
+}
+
+pub fn create_substreams_networks(
+    logger: Logger,
+    config: &Config,
+) -> BTreeMap<BlockchainKind, FirehoseNetworks> {
+    debug!(
+        logger,
+        "Creating firehose networks [{} chains, ingestor {}]",
+        config.chains.chains.len(),
+        config.chains.ingestor,
+    );
+
+    let mut networks_by_kind = BTreeMap::new();
+
+    for (name, chain) in &config.chains.chains {
+        for provider in &chain.providers {
+            if let ProviderDetails::Substreams(ref firehose) = provider.details {
+                info!(
+                    logger,
+                    "Configuring firehose endpoint";
+                    "provider" => &provider.label,
+                );
+
+                let endpoint = FirehoseEndpoint::new(
+                    &provider.label,
+                    &firehose.url,
+                    firehose.token.clone(),
+                    firehose.filters_enabled(),
+                    firehose.compression_enabled(),
+                    firehose.conn_pool_size,
+                );
+
+                let parsed_networks = networks_by_kind
+                    .entry(chain.protocol)
+                    .or_insert_with(|| FirehoseNetworks::new());
+                parsed_networks.insert(name.to_string(), Arc::new(endpoint));
+            }
+        }
+    }
+
+    networks_by_kind
+}
+
+pub fn create_firehose_networks(
+    logger: Logger,
+    config: &Config,
+) -> BTreeMap<BlockchainKind, FirehoseNetworks> {
+    debug!(
+        logger,
+        "Creating firehose networks [{} chains, ingestor {}]",
+        config.chains.chains.len(),
+        config.chains.ingestor,
+    );
+
+    let mut networks_by_kind = BTreeMap::new();
+
+    for (name, chain) in &config.chains.chains {
+        for provider in &chain.providers {
+            if let ProviderDetails::Firehose(ref firehose) = provider.details {
+                info!(
+                    logger,
+                    "Configuring firehose endpoint";
+                    "provider" => &provider.label,
+                );
+
+                let endpoint = FirehoseEndpoint::new(
+                    &provider.label,
+                    &firehose.url,
+                    firehose.token.clone(),
+                    firehose.filters_enabled(),
+                    firehose.compression_enabled(),
+                    firehose.conn_pool_size,
+                );
+
+                let parsed_networks = networks_by_kind
+                    .entry(chain.protocol)
+                    .or_insert_with(|| FirehoseNetworks::new());
+                parsed_networks.insert(name.to_string(), Arc::new(endpoint));
+            }
+        }
+    }
+
+    networks_by_kind
+}
+
+/// Try to connect to all the providers in `eth_networks` and get their net
+/// version and genesis block. Return the same `eth_networks` and the
+/// retrieved net identifiers grouped by network name. Remove all providers
+/// for which trying to connect resulted in an error from the returned
+/// `EthereumNetworks`, since it's likely pointless to try and connect to
+/// them. If the connection attempt to a provider times out after
+/// `NET_VERSION_WAIT_TIME`, keep the provider, but don't report a
+/// version for it.
+pub async fn connect_ethereum_networks(
+    logger: &Logger,
+    mut eth_networks: EthereumNetworks,
+) -> (EthereumNetworks, Vec<(String, Vec<ChainIdentifier>)>) {
+    // This has one entry for each provider, and therefore multiple entries
+    // for each network
+    let statuses = join_all(
+        eth_networks
+            .flatten()
+            .into_iter()
+            .map(|(network_name, capabilities, eth_adapter)| {
+                (network_name, capabilities, eth_adapter, logger.clone())
+            })
+            .map(|(network, capabilities, eth_adapter, logger)| async move {
+                let logger = logger.new(o!("provider" => eth_adapter.provider().to_string()));
+                info!(
+                    logger, "Connecting to Ethereum to get network identifier";
+                    "capabilities" => &capabilities
+                );
+                match tokio::time::timeout(NET_VERSION_WAIT_TIME, eth_adapter.net_identifiers())
+                    .await
+                    .map_err(Error::from)
+                {
+                    // An `Err` means a timeout, an `Ok(Err)` means some other error (maybe a typo
+                    // on the URL)
+                    Ok(Err(e)) | Err(e) => {
+                        error!(logger, "Connection to provider failed. Not using this provider";
+                                       "error" =>  e.to_string());
+                        ProviderNetworkStatus::Broken {
+                            chain_id: network,
+                            provider: eth_adapter.provider().to_string(),
+                        }
+                    }
+                    Ok(Ok(ident)) => {
+                        info!(
+                            logger,
+                            "Connected to Ethereum";
+                            "network_version" => &ident.net_version,
+                            "capabilities" => &capabilities
+                        );
+                        ProviderNetworkStatus::Version {
+                            chain_id: network,
+                            ident,
+                        }
+                    }
+                }
+            }),
+    )
+    .await;
+
+    // Group identifiers by network name
+    let idents: HashMap<String, Vec<ChainIdentifier>> =
+        statuses
+            .into_iter()
+            .fold(HashMap::new(), |mut networks, status| {
+                match status {
+                    ProviderNetworkStatus::Broken {
+                        chain_id: network,
+                        provider,
+                    } => eth_networks.remove(&network, &provider),
+                    ProviderNetworkStatus::Version {
+                        chain_id: network,
+                        ident,
+                    } => networks.entry(network.to_string()).or_default().push(ident),
+                }
+                networks
+            });
+    let idents: Vec<_> = idents.into_iter().collect();
+    (eth_networks, idents)
+}
+
+/// Try to connect to all the providers in `firehose_networks` and get their net
+/// version and genesis block. Return the same `eth_networks` and the
+/// retrieved net identifiers grouped by network name. Remove all providers
+/// for which trying to connect resulted in an error from the returned
+/// `EthereumNetworks`, since it's likely pointless to try and connect to
+/// them. If the connection attempt to a provider times out after
+/// `NET_VERSION_WAIT_TIME`, keep the provider, but don't report a
+/// version for it.
+pub async fn connect_firehose_networks<M>(
+    logger: &Logger,
+    mut firehose_networks: FirehoseNetworks,
+) -> (FirehoseNetworks, Vec<(String, Vec<ChainIdentifier>)>)
+where
+    M: prost::Message + BlockchainBlock + Default + 'static,
+{
+    // This has one entry for each provider, and therefore multiple entries
+    // for each network
+    let statuses = join_all(
+        firehose_networks
+            .flatten()
+            .into_iter()
+            .map(|(chain_id, endpoint)| (chain_id, endpoint, logger.clone()))
+            .map(|(chain_id, endpoint, logger)| async move {
+                let logger = logger.new(o!("provider" => endpoint.provider.to_string()));
+                info!(
+                    logger, "Connecting to Firehose to get chain identifier";
+                    "provider" => &endpoint.provider,
+                );
+                match tokio::time::timeout(
+                    NET_VERSION_WAIT_TIME,
+                    endpoint.genesis_block_ptr::<M>(&logger),
+                )
+                .await
+                .map_err(Error::from)
+                {
+                    // An `Err` means a timeout, an `Ok(Err)` means some other error (maybe a typo
+                    // on the URL)
+                    Ok(Err(e)) | Err(e) => {
+                        error!(logger, "Connection to provider failed. Not using this provider";
+                                       "error" =>  format!("{:#}", e));
+                        ProviderNetworkStatus::Broken {
+                            chain_id,
+                            provider: endpoint.provider.to_string(),
+                        }
+                    }
+                    Ok(Ok(ptr)) => {
+                        info!(
+                            logger,
+                            "Connected to Firehose";
+                            "provider" => &endpoint.provider,
+                            "genesis_block" => format_args!("{}", &ptr),
+                        );
+
+                        let ident = ChainIdentifier {
+                            net_version: "0".to_string(),
+                            genesis_block_hash: ptr.hash,
+                        };
+
+                        ProviderNetworkStatus::Version { chain_id, ident }
+                    }
+                }
+            }),
+    )
+    .await;
+
+    // Group identifiers by chain id
+    let idents: HashMap<String, Vec<ChainIdentifier>> =
+        statuses
+            .into_iter()
+            .fold(HashMap::new(), |mut networks, status| {
+                match status {
+                    ProviderNetworkStatus::Broken { chain_id, provider } => {
+                        firehose_networks.remove(&chain_id, &provider)
+                    }
+                    ProviderNetworkStatus::Version { chain_id, ident } => networks
+                        .entry(chain_id.to_string())
+                        .or_default()
+                        .push(ident),
+                }
+                networks
+            });
+
+    // Clean-up chains with 0 provider
+    firehose_networks.networks.retain(|chain_id, endpoints| {
+        if endpoints.len() == 0 {
+            error!(
+                logger,
+                "No non-broken providers available for chain {}; ignoring this chain", chain_id
+            );
+        }
+
+        endpoints.len() > 0
+    });
+
+    let idents: Vec<_> = idents.into_iter().collect();
+    (firehose_networks, idents)
+}
+
+#[cfg(test)]
+mod test {
+    use crate::chain::create_ethereum_networks;
+    use crate::config::{Config, Opt};
+    use graph::log::logger;
+    use graph::prelude::tokio;
+    use graph::prometheus::Registry;
+    use graph_chain_ethereum::NodeCapabilities;
+    use graph_core::MetricsRegistry;
+    use std::sync::Arc;
+
+    #[tokio::test]
+    async fn correctly_parse_ethereum_networks() {
+        let logger = logger(true);
+
+        let network_args = vec![
+            "mainnet:traces:http://localhost:8545/".to_string(),
+            "goerli:archive:http://localhost:8546/".to_string(),
+        ];
+
+        let opt = Opt {
+            postgres_url: Some("not needed".to_string()),
+            config: None,
+            store_connection_pool_size: 5,
+            postgres_secondary_hosts: vec![],
+            postgres_host_weights: vec![],
+            disable_block_ingestor: true,
+            node_id: "default".to_string(),
+            ethereum_rpc: network_args,
+            ethereum_ws: vec![],
+            ethereum_ipc: vec![],
+            unsafe_config: false,
+        };
+
+        let config = Config::load(&logger, &opt).expect("can create config");
+        let prometheus_registry = Arc::new(Registry::new());
+        let metrics_registry = Arc::new(MetricsRegistry::new(
+            logger.clone(),
+            prometheus_registry.clone(),
+        ));
+
+        let ethereum_networks = create_ethereum_networks(logger, metrics_registry, &config)
+            .await
+            .expect("Correctly parse Ethereum network args");
+        let mut network_names = ethereum_networks.networks.keys().collect::<Vec<&String>>();
+        network_names.sort();
+
+        let traces = NodeCapabilities {
+            archive: false,
+            traces: true,
+        };
+        let archive = NodeCapabilities {
+            archive: true,
+            traces: false,
+        };
+        let has_mainnet_with_traces = ethereum_networks
+            .adapter_with_capabilities("mainnet".to_string(), &traces)
+            .is_ok();
+        let has_goerli_with_archive = ethereum_networks
+            .adapter_with_capabilities("goerli".to_string(), &archive)
+            .is_ok();
+        let has_mainnet_with_archive = ethereum_networks
+            .adapter_with_capabilities("mainnet".to_string(), &archive)
+            .is_ok();
+        let has_goerli_with_traces = ethereum_networks
+            .adapter_with_capabilities("goerli".to_string(), &traces)
+            .is_ok();
+
+        assert_eq!(has_mainnet_with_traces, true);
+        assert_eq!(has_goerli_with_archive, true);
+        assert_eq!(has_mainnet_with_archive, false);
+        assert_eq!(has_goerli_with_traces, false);
+
+        let goerli_capability = ethereum_networks
+            .networks
+            .get("goerli")
+            .unwrap()
+            .adapters
+            .iter()
+            .next()
+            .unwrap()
+            .capabilities;
+        let mainnet_capability = ethereum_networks
+            .networks
+            .get("mainnet")
+            .unwrap()
+            .adapters
+            .iter()
+            .next()
+            .unwrap()
+            .capabilities;
+        assert_eq!(
+            network_names,
+            vec![&"goerli".to_string(), &"mainnet".to_string()]
+        );
+        assert_eq!(goerli_capability, archive);
+        assert_eq!(mainnet_capability, traces);
+    }
+}
diff --git a/node/src/config.rs b/node/src/config.rs
new file mode 100644
index 0000000..067b2dc
--- /dev/null
+++ b/node/src/config.rs
@@ -0,0 +1,1444 @@
+use graph::{
+    anyhow::Error,
+    blockchain::BlockchainKind,
+    prelude::{
+        anyhow::{anyhow, bail, Context, Result},
+        info,
+        serde::{
+            de::{self, value, SeqAccess, Visitor},
+            Deserialize, Deserializer, Serialize,
+        },
+        serde_json, Logger, NodeId, StoreError,
+    },
+};
+use graph_chain_ethereum::{self as ethereum, NodeCapabilities};
+use graph_store_postgres::{DeploymentPlacer, Shard as ShardName, PRIMARY_SHARD};
+
+use http::{HeaderMap, Uri};
+use regex::Regex;
+use std::fs::read_to_string;
+use std::{
+    collections::{BTreeMap, BTreeSet},
+    fmt,
+};
+use url::Url;
+
+const ANY_NAME: &str = ".*";
+/// A regular expression that matches nothing
+const NO_NAME: &str = ".^";
+
+pub struct Opt {
+    pub postgres_url: Option<String>,
+    pub config: Option<String>,
+    // This is only used when we cosntruct a config purely from command
+    // line options. When using a configuration file, pool sizes must be
+    // set in the configuration file alone
+    pub store_connection_pool_size: u32,
+    pub postgres_secondary_hosts: Vec<String>,
+    pub postgres_host_weights: Vec<usize>,
+    pub disable_block_ingestor: bool,
+    pub node_id: String,
+    pub ethereum_rpc: Vec<String>,
+    pub ethereum_ws: Vec<String>,
+    pub ethereum_ipc: Vec<String>,
+    pub unsafe_config: bool,
+}
+
+impl Default for Opt {
+    fn default() -> Self {
+        Opt {
+            postgres_url: None,
+            config: None,
+            store_connection_pool_size: 10,
+            postgres_secondary_hosts: vec![],
+            postgres_host_weights: vec![],
+            disable_block_ingestor: true,
+            node_id: "default".to_string(),
+            ethereum_rpc: vec![],
+            ethereum_ws: vec![],
+            ethereum_ipc: vec![],
+            unsafe_config: false,
+        }
+    }
+}
+
+#[derive(Clone, Debug, Deserialize, Serialize)]
+pub struct Config {
+    #[serde(skip, default = "default_node_id")]
+    pub node: NodeId,
+    pub general: Option<GeneralSection>,
+    #[serde(rename = "store")]
+    pub stores: BTreeMap<String, Shard>,
+    pub chains: ChainSection,
+    pub deployment: Deployment,
+}
+
+fn validate_name(s: &str) -> Result<()> {
+    if s.is_empty() {
+        return Err(anyhow!("names must not be empty"));
+    }
+    if s.len() > 30 {
+        return Err(anyhow!(
+            "names can be at most 30 characters, but `{}` has {} characters",
+            s,
+            s.len()
+        ));
+    }
+
+    if !s
+        .chars()
+        .all(|c| c.is_ascii_lowercase() || c.is_ascii_digit() || c == '-')
+    {
+        return Err(anyhow!(
+            "name `{}` is invalid: names can only contain lowercase alphanumeric characters or '-'",
+            s
+        ));
+    }
+    Ok(())
+}
+
+impl Config {
+    /// Check that the config is valid.
+    fn validate(&mut self) -> Result<()> {
+        if !self.stores.contains_key(PRIMARY_SHARD.as_str()) {
+            return Err(anyhow!("missing a primary store"));
+        }
+        if self.stores.len() > 1 && ethereum::ENV_VARS.cleanup_blocks {
+            // See 8b6ad0c64e244023ac20ced7897fe666
+            return Err(anyhow!(
+                "GRAPH_ETHEREUM_CLEANUP_BLOCKS can not be used with a sharded store"
+            ));
+        }
+        for (key, shard) in self.stores.iter_mut() {
+            shard.validate(&key)?;
+        }
+        self.deployment.validate()?;
+
+        // Check that deployment rules only reference existing stores and chains
+        for (i, rule) in self.deployment.rules.iter().enumerate() {
+            for shard in &rule.shards {
+                if !self.stores.contains_key(shard) {
+                    return Err(anyhow!("unknown shard {} in deployment rule {}", shard, i));
+                }
+            }
+            if let Some(networks) = &rule.pred.network {
+                for network in networks.to_vec() {
+                    if !self.chains.chains.contains_key(&network) {
+                        return Err(anyhow!(
+                            "unknown network {} in deployment rule {}",
+                            network,
+                            i
+                        ));
+                    }
+                }
+            }
+        }
+
+        // Check that chains only reference existing stores
+        for (name, chain) in &self.chains.chains {
+            if !self.stores.contains_key(&chain.shard) {
+                return Err(anyhow!("unknown shard {} in chain {}", chain.shard, name));
+            }
+        }
+
+        self.chains.validate()?;
+
+        Ok(())
+    }
+
+    /// Load a configuration file if `opt.config` is set. If not, generate
+    /// a config from the command line arguments in `opt`
+    pub fn load(logger: &Logger, opt: &Opt) -> Result<Config> {
+        if let Some(config) = &opt.config {
+            Self::from_file(logger, config, &opt.node_id)
+        } else {
+            info!(
+                logger,
+                "Generating configuration from command line arguments"
+            );
+            Self::from_opt(opt)
+        }
+    }
+
+    pub fn from_file(logger: &Logger, path: &str, node: &str) -> Result<Config> {
+        info!(logger, "Reading configuration file `{}`", path);
+        Self::from_str(&read_to_string(path)?, node)
+    }
+
+    pub fn from_str(config: &str, node: &str) -> Result<Config> {
+        let mut config: Config = toml::from_str(&config)?;
+        config.node =
+            NodeId::new(node.clone()).map_err(|()| anyhow!("invalid node id {}", node))?;
+        config.validate()?;
+        Ok(config)
+    }
+
+    fn from_opt(opt: &Opt) -> Result<Config> {
+        let deployment = Deployment::from_opt(opt);
+        let mut stores = BTreeMap::new();
+        let chains = ChainSection::from_opt(opt)?;
+        let node = NodeId::new(opt.node_id.to_string())
+            .map_err(|()| anyhow!("invalid node id {}", opt.node_id))?;
+        stores.insert(PRIMARY_SHARD.to_string(), Shard::from_opt(true, opt)?);
+        Ok(Config {
+            node,
+            general: None,
+            stores,
+            chains,
+            deployment,
+        })
+    }
+
+    /// Generate a JSON representation of the config.
+    pub fn to_json(&self) -> Result<String> {
+        // It would be nice to produce a TOML representation, but that runs
+        // into this error: https://github.com/alexcrichton/toml-rs/issues/142
+        // and fixing it as described in the issue didn't fix it. Since serializing
+        // this data isn't crucial and only needed for debugging, we'll
+        // just stick with JSON
+        Ok(serde_json::to_string_pretty(&self)?)
+    }
+
+    pub fn primary_store(&self) -> &Shard {
+        self.stores
+            .get(PRIMARY_SHARD.as_str())
+            .expect("a validated config has a primary store")
+    }
+
+    pub fn query_only(&self, node: &NodeId) -> bool {
+        self.general
+            .as_ref()
+            .map(|g| match g.query.find(node.as_str()) {
+                None => false,
+                Some(m) => m.as_str() == node.as_str(),
+            })
+            .unwrap_or(false)
+    }
+}
+
+#[derive(Clone, Debug, Deserialize, Serialize)]
+pub struct GeneralSection {
+    #[serde(with = "serde_regex", default = "no_name")]
+    query: Regex,
+}
+
+#[derive(Clone, Debug, Deserialize, Serialize)]
+pub struct Shard {
+    pub connection: String,
+    #[serde(default = "one")]
+    pub weight: usize,
+    #[serde(default)]
+    pub pool_size: PoolSize,
+    #[serde(default = "PoolSize::five")]
+    pub fdw_pool_size: PoolSize,
+    #[serde(default)]
+    pub replicas: BTreeMap<String, Replica>,
+}
+
+impl Shard {
+    fn validate(&mut self, name: &str) -> Result<()> {
+        ShardName::new(name.to_string()).map_err(|e| anyhow!(e))?;
+
+        self.connection = shellexpand::env(&self.connection)?.into_owned();
+
+        if matches!(self.pool_size, PoolSize::None) {
+            return Err(anyhow!("missing pool size definition for shard `{}`", name));
+        }
+
+        self.pool_size
+            .validate(name == PRIMARY_SHARD.as_str(), &self.connection)?;
+        for (name, replica) in self.replicas.iter_mut() {
+            validate_name(name).context("illegal replica name")?;
+            replica.validate(name == PRIMARY_SHARD.as_str(), &self.pool_size)?;
+        }
+
+        let no_weight =
+            self.weight == 0 && self.replicas.values().all(|replica| replica.weight == 0);
+        if no_weight {
+            return Err(anyhow!(
+                "all weights for shard `{}` are 0; \
+                remove explicit weights or set at least one of them to a value bigger than 0",
+                name
+            ));
+        }
+        Ok(())
+    }
+
+    fn from_opt(is_primary: bool, opt: &Opt) -> Result<Self> {
+        let postgres_url = opt
+            .postgres_url
+            .as_ref()
+            .expect("validation checked that postgres_url is set");
+        let pool_size = PoolSize::Fixed(opt.store_connection_pool_size);
+        pool_size.validate(is_primary, &postgres_url)?;
+        let mut replicas = BTreeMap::new();
+        for (i, host) in opt.postgres_secondary_hosts.iter().enumerate() {
+            let replica = Replica {
+                connection: replace_host(&postgres_url, &host),
+                weight: opt.postgres_host_weights.get(i + 1).cloned().unwrap_or(1),
+                pool_size: pool_size.clone(),
+            };
+            replicas.insert(format!("replica{}", i + 1), replica);
+        }
+        Ok(Self {
+            connection: postgres_url.clone(),
+            weight: opt.postgres_host_weights.get(0).cloned().unwrap_or(1),
+            pool_size,
+            fdw_pool_size: PoolSize::five(),
+            replicas,
+        })
+    }
+}
+
+#[derive(Clone, Debug, Deserialize, Serialize)]
+#[serde(untagged)]
+pub enum PoolSize {
+    None,
+    Fixed(u32),
+    Rule(Vec<PoolSizeRule>),
+}
+
+impl Default for PoolSize {
+    fn default() -> Self {
+        Self::None
+    }
+}
+
+impl PoolSize {
+    fn five() -> Self {
+        Self::Fixed(5)
+    }
+
+    fn validate(&self, is_primary: bool, connection: &str) -> Result<()> {
+        use PoolSize::*;
+
+        let pool_size = match self {
+            None => bail!("missing pool size for {}", connection),
+            Fixed(s) => *s,
+            Rule(rules) => rules.iter().map(|rule| rule.size).min().unwrap_or(0u32),
+        };
+
+        match pool_size {
+            0 if is_primary => Err(anyhow!(
+                "the pool size for the primary shard must be at least 2"
+            )),
+            0 => Ok(()),
+            1 => Err(anyhow!(
+                "connection pool size must be at least 2, but is {} for {}",
+                pool_size,
+                connection
+            )),
+            _ => Ok(()),
+        }
+    }
+
+    pub fn size_for(&self, node: &NodeId, name: &str) -> Result<u32> {
+        use PoolSize::*;
+        match self {
+            None => unreachable!("validation ensures we have a pool size"),
+            Fixed(s) => Ok(*s),
+            Rule(rules) => rules
+                .iter()
+                .find(|rule| rule.matches(node.as_str()))
+                .map(|rule| rule.size)
+                .ok_or_else(|| {
+                    anyhow!(
+                        "no rule matches node id `{}` for the pool of shard {}",
+                        node.as_str(),
+                        name
+                    )
+                }),
+        }
+    }
+}
+
+#[derive(Clone, Debug, Deserialize, Serialize)]
+pub struct PoolSizeRule {
+    #[serde(with = "serde_regex", default = "any_name")]
+    node: Regex,
+    size: u32,
+}
+
+impl PoolSizeRule {
+    fn matches(&self, name: &str) -> bool {
+        match self.node.find(name) {
+            None => false,
+            Some(m) => m.as_str() == name,
+        }
+    }
+}
+
+#[derive(Clone, Debug, Deserialize, Serialize)]
+pub struct Replica {
+    pub connection: String,
+    #[serde(default = "one")]
+    pub weight: usize,
+    #[serde(default)]
+    pub pool_size: PoolSize,
+}
+
+impl Replica {
+    fn validate(&mut self, is_primary: bool, pool_size: &PoolSize) -> Result<()> {
+        self.connection = shellexpand::env(&self.connection)?.into_owned();
+        if matches!(self.pool_size, PoolSize::None) {
+            self.pool_size = pool_size.clone();
+        }
+
+        self.pool_size.validate(is_primary, &self.connection)?;
+        Ok(())
+    }
+}
+
+#[derive(Clone, Debug, Deserialize, Serialize)]
+pub struct ChainSection {
+    pub ingestor: String,
+    #[serde(flatten)]
+    pub chains: BTreeMap<String, Chain>,
+}
+
+impl ChainSection {
+    fn validate(&mut self) -> Result<()> {
+        NodeId::new(&self.ingestor)
+            .map_err(|()| anyhow!("invalid node id for ingestor {}", &self.ingestor))?;
+        for (_, chain) in self.chains.iter_mut() {
+            chain.validate()?
+        }
+        Ok(())
+    }
+
+    fn from_opt(opt: &Opt) -> Result<Self> {
+        // If we are not the block ingestor, set the node name
+        // to something that is definitely not our node_id
+        let ingestor = if opt.disable_block_ingestor {
+            format!("{} is not ingesting", opt.node_id)
+        } else {
+            opt.node_id.clone()
+        };
+        let mut chains = BTreeMap::new();
+        Self::parse_networks(&mut chains, Transport::Rpc, &opt.ethereum_rpc)?;
+        Self::parse_networks(&mut chains, Transport::Ws, &opt.ethereum_ws)?;
+        Self::parse_networks(&mut chains, Transport::Ipc, &opt.ethereum_ipc)?;
+        Ok(Self { ingestor, chains })
+    }
+
+    fn parse_networks(
+        chains: &mut BTreeMap<String, Chain>,
+        transport: Transport,
+        args: &Vec<String>,
+    ) -> Result<()> {
+        for (nr, arg) in args.iter().enumerate() {
+            if arg.starts_with("wss://")
+                || arg.starts_with("http://")
+                || arg.starts_with("https://")
+            {
+                return Err(anyhow!(
+                    "Is your Ethereum node string missing a network name? \
+                     Try 'mainnet:' + the Ethereum node URL."
+                ));
+            } else {
+                // Parse string (format is "NETWORK_NAME:NETWORK_CAPABILITIES:URL" OR
+                // "NETWORK_NAME::URL" which will default to NETWORK_CAPABILITIES="archive,traces")
+                let colon = arg.find(':').ok_or_else(|| {
+                    return anyhow!(
+                        "A network name must be provided alongside the \
+                         Ethereum node location. Try e.g. 'mainnet:URL'."
+                    );
+                })?;
+
+                let (name, rest_with_delim) = arg.split_at(colon);
+                let rest = &rest_with_delim[1..];
+                if name.is_empty() {
+                    return Err(anyhow!("Ethereum network name cannot be an empty string"));
+                }
+                if rest.is_empty() {
+                    return Err(anyhow!("Ethereum node URL cannot be an empty string"));
+                }
+
+                let colon = rest.find(':').ok_or_else(|| {
+                    return anyhow!(
+                        "A network name must be provided alongside the \
+                         Ethereum node location. Try e.g. 'mainnet:URL'."
+                    );
+                })?;
+
+                let (features, url_str) = rest.split_at(colon);
+                let (url, features) = if vec!["http", "https", "ws", "wss"].contains(&features) {
+                    (rest, DEFAULT_PROVIDER_FEATURES.to_vec())
+                } else {
+                    (&url_str[1..], features.split(',').collect())
+                };
+                let features = features.into_iter().map(|s| s.to_string()).collect();
+                let provider = Provider {
+                    label: format!("{}-{}-{}", name, transport, nr),
+                    details: ProviderDetails::Web3(Web3Provider {
+                        transport,
+                        url: url.to_string(),
+                        features,
+                        headers: Default::default(),
+                        rules: Vec::new(),
+                    }),
+                };
+                let entry = chains.entry(name.to_string()).or_insert_with(|| Chain {
+                    shard: PRIMARY_SHARD.to_string(),
+                    protocol: BlockchainKind::Ethereum,
+                    providers: vec![],
+                });
+                entry.providers.push(provider);
+            }
+        }
+        Ok(())
+    }
+}
+
+#[derive(Clone, Debug, PartialEq, Deserialize, Serialize)]
+pub struct Chain {
+    pub shard: String,
+    #[serde(default = "default_blockchain_kind")]
+    pub protocol: BlockchainKind,
+    #[serde(rename = "provider")]
+    pub providers: Vec<Provider>,
+}
+
+fn default_blockchain_kind() -> BlockchainKind {
+    BlockchainKind::Ethereum
+}
+
+impl Chain {
+    fn validate(&mut self) -> Result<()> {
+        // `Config` validates that `self.shard` references a configured shard
+
+        for provider in self.providers.iter_mut() {
+            provider.validate()?
+        }
+        Ok(())
+    }
+}
+
+fn deserialize_http_headers<'de, D>(deserializer: D) -> Result<HeaderMap, D::Error>
+where
+    D: serde::Deserializer<'de>,
+{
+    let kvs: BTreeMap<String, String> = Deserialize::deserialize(deserializer)?;
+    Ok(btree_map_to_http_headers(kvs))
+}
+
+fn btree_map_to_http_headers(kvs: BTreeMap<String, String>) -> HeaderMap {
+    let mut headers = HeaderMap::new();
+    for (k, v) in kvs.into_iter() {
+        headers.insert(
+            k.parse::<http::header::HeaderName>()
+                .expect(&format!("invalid HTTP header name: {}", k)),
+            v.parse::<http::header::HeaderValue>()
+                .expect(&format!("invalid HTTP header value: {}: {}", k, v)),
+        );
+    }
+    headers
+}
+
+#[derive(Clone, Debug, Serialize, PartialEq)]
+pub struct Provider {
+    pub label: String,
+    pub details: ProviderDetails,
+}
+
+#[derive(Clone, Debug, Deserialize, Serialize, PartialEq)]
+#[serde(tag = "type", rename_all = "lowercase")]
+pub enum ProviderDetails {
+    Firehose(FirehoseProvider),
+    Web3(Web3Provider),
+    Substreams(FirehoseProvider),
+}
+
+const FIREHOSE_FILTER_FEATURE: &str = "filters";
+const FIREHOSE_COMPRESSION_FEATURE: &str = "compression";
+const FIREHOSE_PROVIDER_FEATURES: [&str; 2] =
+    [FIREHOSE_FILTER_FEATURE, FIREHOSE_COMPRESSION_FEATURE];
+
+fn ten() -> u16 {
+    10
+}
+
+#[derive(Clone, Debug, Deserialize, Serialize, PartialEq)]
+pub struct FirehoseProvider {
+    pub url: String,
+    pub token: Option<String>,
+    #[serde(default = "ten")]
+    pub conn_pool_size: u16,
+    #[serde(default)]
+    pub features: BTreeSet<String>,
+}
+
+impl FirehoseProvider {
+    pub fn filters_enabled(&self) -> bool {
+        self.features.contains(FIREHOSE_FILTER_FEATURE)
+    }
+    pub fn compression_enabled(&self) -> bool {
+        self.features.contains(FIREHOSE_COMPRESSION_FEATURE)
+    }
+}
+
+#[derive(Clone, Debug, Deserialize, Serialize)]
+struct Web3Rule {
+    #[serde(with = "serde_regex")]
+    name: Regex,
+    limit: usize,
+}
+
+impl PartialEq for Web3Rule {
+    fn eq(&self, other: &Self) -> bool {
+        self.name.to_string() == other.name.to_string() && self.limit == other.limit
+    }
+}
+
+impl Web3Rule {
+    fn limit_for(&self, node: &NodeId) -> Option<usize> {
+        match self.name.find(node.as_str()) {
+            Some(m) if m.as_str() == node.as_str() => Some(self.limit),
+            _ => None,
+        }
+    }
+}
+
+#[derive(Clone, Debug, Deserialize, Serialize, PartialEq)]
+pub struct Web3Provider {
+    #[serde(default)]
+    pub transport: Transport,
+    pub url: String,
+    pub features: BTreeSet<String>,
+
+    // TODO: This should be serialized.
+    #[serde(
+        skip_serializing,
+        default,
+        deserialize_with = "deserialize_http_headers"
+    )]
+    pub headers: HeaderMap,
+
+    #[serde(default, rename = "match")]
+    rules: Vec<Web3Rule>,
+}
+
+impl Web3Provider {
+    pub fn node_capabilities(&self) -> NodeCapabilities {
+        NodeCapabilities {
+            archive: self.features.contains("archive"),
+            traces: self.features.contains("traces"),
+        }
+    }
+
+    pub fn limit_for(&self, node: &NodeId) -> usize {
+        self.rules
+            .iter()
+            .find_map(|l| l.limit_for(node))
+            .unwrap_or(usize::MAX)
+    }
+}
+
+const PROVIDER_FEATURES: [&str; 3] = ["traces", "archive", "no_eip1898"];
+const DEFAULT_PROVIDER_FEATURES: [&str; 2] = ["traces", "archive"];
+
+impl Provider {
+    fn validate(&mut self) -> Result<()> {
+        validate_name(&self.label).context("illegal provider name")?;
+
+        match self.details {
+            ProviderDetails::Firehose(ref mut firehose)
+            | ProviderDetails::Substreams(ref mut firehose) => {
+                firehose.url = shellexpand::env(&firehose.url)?.into_owned();
+
+                // A Firehose url must be a valid Uri since gRPC library we use (Tonic)
+                // works with Uri.
+                let label = &self.label;
+                firehose.url.parse::<Uri>().map_err(|e| {
+                    anyhow!(
+                        "the url `{}` for firehose provider {} is not a legal URI: {}",
+                        firehose.url,
+                        label,
+                        e
+                    )
+                })?;
+
+                if let Some(token) = &firehose.token {
+                    firehose.token = Some(shellexpand::env(token)?.into_owned());
+                }
+
+                if firehose
+                    .features
+                    .iter()
+                    .any(|feature| !FIREHOSE_PROVIDER_FEATURES.contains(&feature.as_str()))
+                {
+                    return Err(anyhow!(
+                        "supported firehose endpoint filters are: {:?}",
+                        FIREHOSE_PROVIDER_FEATURES
+                    ));
+                }
+            }
+
+            ProviderDetails::Web3(ref mut web3) => {
+                for feature in &web3.features {
+                    if !PROVIDER_FEATURES.contains(&feature.as_str()) {
+                        return Err(anyhow!(
+                            "illegal feature `{}` for provider {}. Features must be one of {}",
+                            feature,
+                            self.label,
+                            PROVIDER_FEATURES.join(", ")
+                        ));
+                    }
+                }
+
+                web3.url = shellexpand::env(&web3.url)?.into_owned();
+
+                let label = &self.label;
+                Url::parse(&web3.url).map_err(|e| {
+                    anyhow!(
+                        "the url `{}` for provider {} is not a legal URL: {}",
+                        web3.url,
+                        label,
+                        e
+                    )
+                })?;
+            }
+        }
+
+        Ok(())
+    }
+}
+
+impl<'de> Deserialize<'de> for Provider {
+    fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
+    where
+        D: serde::Deserializer<'de>,
+    {
+        struct ProviderVisitor;
+
+        impl<'de> serde::de::Visitor<'de> for ProviderVisitor {
+            type Value = Provider;
+
+            fn expecting(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
+                formatter.write_str("struct Provider")
+            }
+
+            fn visit_map<V>(self, mut map: V) -> Result<Provider, V::Error>
+            where
+                V: serde::de::MapAccess<'de>,
+            {
+                let mut label = None;
+                let mut details = None;
+
+                let mut url = None;
+                let mut transport = None;
+                let mut features = None;
+                let mut headers = None;
+                let mut nodes = Vec::new();
+
+                while let Some(key) = map.next_key()? {
+                    match key {
+                        ProviderField::Label => {
+                            if label.is_some() {
+                                return Err(serde::de::Error::duplicate_field("label"));
+                            }
+                            label = Some(map.next_value()?);
+                        }
+                        ProviderField::Details => {
+                            if details.is_some() {
+                                return Err(serde::de::Error::duplicate_field("details"));
+                            }
+                            details = Some(map.next_value()?);
+                        }
+                        ProviderField::Url => {
+                            if url.is_some() {
+                                return Err(serde::de::Error::duplicate_field("url"));
+                            }
+                            url = Some(map.next_value()?);
+                        }
+                        ProviderField::Transport => {
+                            if transport.is_some() {
+                                return Err(serde::de::Error::duplicate_field("transport"));
+                            }
+                            transport = Some(map.next_value()?);
+                        }
+                        ProviderField::Features => {
+                            if features.is_some() {
+                                return Err(serde::de::Error::duplicate_field("features"));
+                            }
+                            features = Some(map.next_value()?);
+                        }
+                        ProviderField::Headers => {
+                            if headers.is_some() {
+                                return Err(serde::de::Error::duplicate_field("headers"));
+                            }
+
+                            let raw_headers: BTreeMap<String, String> = map.next_value()?;
+                            headers = Some(btree_map_to_http_headers(raw_headers));
+                        }
+                        ProviderField::Match => {
+                            nodes = map.next_value()?;
+                        }
+                    }
+                }
+
+                let label = label.ok_or_else(|| serde::de::Error::missing_field("label"))?;
+                let details = match details {
+                    Some(v) => {
+                        if url.is_some()
+                            || transport.is_some()
+                            || features.is_some()
+                            || headers.is_some()
+                        {
+                            return Err(serde::de::Error::custom("when `details` field is provided, deprecated `url`, `transport`, `features` and `headers` cannot be specified"));
+                        }
+
+                        v
+                    }
+                    None => ProviderDetails::Web3(Web3Provider {
+                        url: url.ok_or_else(|| serde::de::Error::missing_field("url"))?,
+                        transport: transport.unwrap_or(Transport::Rpc),
+                        features: features
+                            .ok_or_else(|| serde::de::Error::missing_field("features"))?,
+                        headers: headers.unwrap_or_else(|| HeaderMap::new()),
+                        rules: nodes,
+                    }),
+                };
+
+                Ok(Provider { label, details })
+            }
+        }
+
+        const FIELDS: &'static [&'static str] = &[
+            "label",
+            "details",
+            "transport",
+            "url",
+            "features",
+            "headers",
+        ];
+        deserializer.deserialize_struct("Provider", FIELDS, ProviderVisitor)
+    }
+}
+
+#[derive(Deserialize)]
+#[serde(field_identifier, rename_all = "lowercase")]
+enum ProviderField {
+    Label,
+    Details,
+    Match,
+
+    // Deprecated fields
+    Url,
+    Transport,
+    Features,
+    Headers,
+}
+
+#[derive(Copy, Clone, Debug, Deserialize, Serialize, PartialEq)]
+pub enum Transport {
+    #[serde(rename = "rpc")]
+    Rpc,
+    #[serde(rename = "ws")]
+    Ws,
+    #[serde(rename = "ipc")]
+    Ipc,
+}
+
+impl Default for Transport {
+    fn default() -> Self {
+        Self::Rpc
+    }
+}
+
+impl std::fmt::Display for Transport {
+    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
+        use Transport::*;
+
+        match self {
+            Rpc => write!(f, "rpc"),
+            Ws => write!(f, "ws"),
+            Ipc => write!(f, "ipc"),
+        }
+    }
+}
+
+#[derive(Clone, Debug, Deserialize, Serialize)]
+pub struct Deployment {
+    #[serde(rename = "rule")]
+    rules: Vec<Rule>,
+}
+
+impl Deployment {
+    fn validate(&self) -> Result<()> {
+        if self.rules.is_empty() {
+            return Err(anyhow!(
+                "there must be at least one deployment rule".to_string()
+            ));
+        }
+        let mut default_rule = false;
+        for rule in &self.rules {
+            rule.validate()?;
+            if default_rule {
+                return Err(anyhow!("rules after a default rule are useless"));
+            }
+            default_rule = rule.is_default();
+        }
+        if !default_rule {
+            return Err(anyhow!(
+                "the rules do not contain a default rule that matches everything"
+            ));
+        }
+        Ok(())
+    }
+
+    fn from_opt(_: &Opt) -> Self {
+        Self { rules: vec![] }
+    }
+}
+
+impl DeploymentPlacer for Deployment {
+    fn place(
+        &self,
+        name: &str,
+        network: &str,
+    ) -> Result<Option<(Vec<ShardName>, Vec<NodeId>)>, String> {
+        // Errors here are really programming errors. We should have validated
+        // everything already so that the various conversions can't fail. We
+        // still return errors so that they bubble up to the deployment request
+        // rather than crashing the node and burying the crash in the logs
+        let placement = match self.rules.iter().find(|rule| rule.matches(name, network)) {
+            Some(rule) => {
+                let shards = rule.shard_names().map_err(|e| e.to_string())?;
+                let indexers: Vec<_> = rule
+                    .indexers
+                    .iter()
+                    .map(|idx| {
+                        NodeId::new(idx.clone())
+                            .map_err(|()| format!("{} is not a valid node name", idx))
+                    })
+                    .collect::<Result<Vec<_>, _>>()?;
+                Some((shards, indexers))
+            }
+            None => None,
+        };
+        Ok(placement)
+    }
+}
+
+#[derive(Clone, Debug, Deserialize, Serialize)]
+struct Rule {
+    #[serde(rename = "match", default)]
+    pred: Predicate,
+    // For backwards compatibility, we also accept 'shard' for the shards
+    #[serde(
+        alias = "shard",
+        default = "primary_store",
+        deserialize_with = "string_or_vec"
+    )]
+    shards: Vec<String>,
+    indexers: Vec<String>,
+}
+
+impl Rule {
+    fn is_default(&self) -> bool {
+        self.pred.matches_anything()
+    }
+
+    fn matches(&self, name: &str, network: &str) -> bool {
+        self.pred.matches(name, network)
+    }
+
+    fn shard_names(&self) -> Result<Vec<ShardName>, StoreError> {
+        self.shards
+            .iter()
+            .cloned()
+            .map(ShardName::new)
+            .collect::<Result<_, _>>()
+    }
+
+    fn validate(&self) -> Result<()> {
+        if self.indexers.is_empty() {
+            return Err(anyhow!("useless rule without indexers"));
+        }
+        for indexer in &self.indexers {
+            NodeId::new(indexer).map_err(|()| anyhow!("invalid node id {}", &indexer))?;
+        }
+        self.shard_names().map_err(Error::from)?;
+        Ok(())
+    }
+}
+
+#[derive(Clone, Debug, Deserialize, Serialize)]
+struct Predicate {
+    #[serde(with = "serde_regex", default = "any_name")]
+    name: Regex,
+    network: Option<NetworkPredicate>,
+}
+
+impl Predicate {
+    fn matches_anything(&self) -> bool {
+        self.name.as_str() == ANY_NAME && self.network.is_none()
+    }
+
+    pub fn matches(&self, name: &str, network: &str) -> bool {
+        if let Some(n) = &self.network {
+            if !n.matches(network) {
+                return false;
+            }
+        }
+
+        match self.name.find(name) {
+            None => false,
+            Some(m) => m.as_str() == name,
+        }
+    }
+}
+
+impl Default for Predicate {
+    fn default() -> Self {
+        Predicate {
+            name: any_name(),
+            network: None,
+        }
+    }
+}
+
+#[derive(Clone, Debug, Deserialize, Serialize)]
+#[serde(untagged)]
+enum NetworkPredicate {
+    Single(String),
+    Many(Vec<String>),
+}
+
+impl NetworkPredicate {
+    fn matches(&self, network: &str) -> bool {
+        use NetworkPredicate::*;
+        match self {
+            Single(n) => n == network,
+            Many(ns) => ns.iter().any(|n| n == network),
+        }
+    }
+
+    fn to_vec(&self) -> Vec<String> {
+        use NetworkPredicate::*;
+        match self {
+            Single(n) => vec![n.clone()],
+            Many(ns) => ns.clone(),
+        }
+    }
+}
+
+/// Replace the host portion of `url` and return a new URL with `host`
+/// as the host portion
+///
+/// Panics if `url` is not a valid URL (which won't happen in our case since
+/// we would have paniced before getting here as `url` is the connection for
+/// the primary Postgres instance)
+fn replace_host(url: &str, host: &str) -> String {
+    let mut url = match Url::parse(url) {
+        Ok(url) => url,
+        Err(_) => panic!("Invalid Postgres URL {}", url),
+    };
+    if let Err(e) = url.set_host(Some(host)) {
+        panic!("Invalid Postgres url {}: {}", url, e.to_string());
+    }
+    String::from(url)
+}
+
+// Various default functions for deserialization
+fn any_name() -> Regex {
+    Regex::new(ANY_NAME).unwrap()
+}
+
+fn no_name() -> Regex {
+    Regex::new(NO_NAME).unwrap()
+}
+
+fn primary_store() -> Vec<String> {
+    vec![PRIMARY_SHARD.to_string()]
+}
+
+fn one() -> usize {
+    1
+}
+
+fn default_node_id() -> NodeId {
+    NodeId::new("default").unwrap()
+}
+
+// From https://github.com/serde-rs/serde/issues/889#issuecomment-295988865
+fn string_or_vec<'de, D>(deserializer: D) -> Result<Vec<String>, D::Error>
+where
+    D: Deserializer<'de>,
+{
+    struct StringOrVec;
+
+    impl<'de> Visitor<'de> for StringOrVec {
+        type Value = Vec<String>;
+
+        fn expecting(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
+            formatter.write_str("string or list of strings")
+        }
+
+        fn visit_str<E>(self, s: &str) -> Result<Self::Value, E>
+        where
+            E: de::Error,
+        {
+            Ok(vec![s.to_owned()])
+        }
+
+        fn visit_seq<S>(self, seq: S) -> Result<Self::Value, S::Error>
+        where
+            S: SeqAccess<'de>,
+        {
+            Deserialize::deserialize(value::SeqAccessDeserializer::new(seq))
+        }
+    }
+
+    deserializer.deserialize_any(StringOrVec)
+}
+
+#[cfg(test)]
+mod tests {
+
+    use super::{
+        Chain, Config, FirehoseProvider, Provider, ProviderDetails, Transport, Web3Provider,
+    };
+    use graph::blockchain::BlockchainKind;
+    use graph::prelude::NodeId;
+    use http::{HeaderMap, HeaderValue};
+    use std::collections::BTreeSet;
+    use std::fs::read_to_string;
+    use std::path::{Path, PathBuf};
+
+    #[test]
+    fn it_works_on_standard_config() {
+        let content = read_resource_as_string("full_config.toml");
+        let actual: Config = toml::from_str(&content).unwrap();
+
+        // We do basic checks because writing the full equality method is really too long
+
+        assert_eq!(
+            "query_node_.*".to_string(),
+            actual.general.unwrap().query.to_string()
+        );
+        assert_eq!(4, actual.chains.chains.len());
+        assert_eq!(2, actual.stores.len());
+        assert_eq!(3, actual.deployment.rules.len());
+    }
+
+    #[test]
+    fn it_works_on_chain_without_protocol() {
+        let actual = toml::from_str(
+            r#"
+            shard = "primary"
+            provider = []
+        "#,
+        )
+        .unwrap();
+
+        assert_eq!(
+            Chain {
+                shard: "primary".to_string(),
+                protocol: BlockchainKind::Ethereum,
+                providers: vec![],
+            },
+            actual
+        );
+    }
+
+    #[test]
+    fn it_works_on_chain_with_protocol() {
+        let actual = toml::from_str(
+            r#"
+            shard = "primary"
+            protocol = "near"
+            provider = []
+        "#,
+        )
+        .unwrap();
+
+        assert_eq!(
+            Chain {
+                shard: "primary".to_string(),
+                protocol: BlockchainKind::Near,
+                providers: vec![],
+            },
+            actual
+        );
+    }
+
+    #[test]
+    fn it_works_on_deprecated_provider_from_toml() {
+        let actual = toml::from_str(
+            r#"
+            transport = "rpc"
+            label = "peering"
+            url = "http://localhost:8545"
+            features = []
+        "#,
+        )
+        .unwrap();
+
+        assert_eq!(
+            Provider {
+                label: "peering".to_owned(),
+                details: ProviderDetails::Web3(Web3Provider {
+                    transport: Transport::Rpc,
+                    url: "http://localhost:8545".to_owned(),
+                    features: BTreeSet::new(),
+                    headers: HeaderMap::new(),
+                    rules: Vec::new(),
+                }),
+            },
+            actual
+        );
+    }
+
+    #[test]
+    fn it_works_on_deprecated_provider_without_transport_from_toml() {
+        let actual = toml::from_str(
+            r#"
+            label = "peering"
+            url = "http://localhost:8545"
+            features = []
+        "#,
+        )
+        .unwrap();
+
+        assert_eq!(
+            Provider {
+                label: "peering".to_owned(),
+                details: ProviderDetails::Web3(Web3Provider {
+                    transport: Transport::Rpc,
+                    url: "http://localhost:8545".to_owned(),
+                    features: BTreeSet::new(),
+                    headers: HeaderMap::new(),
+                    rules: Vec::new(),
+                }),
+            },
+            actual
+        );
+    }
+
+    #[test]
+    fn it_errors_on_deprecated_provider_missing_url_from_toml() {
+        let actual = toml::from_str::<Provider>(
+            r#"
+            transport = "rpc"
+            label = "peering"
+            features = []
+        "#,
+        );
+
+        assert_eq!(true, actual.is_err());
+        assert_eq!(
+            actual.unwrap_err().to_string(),
+            "missing field `url` at line 1 column 1"
+        );
+    }
+
+    #[test]
+    fn it_errors_on_deprecated_provider_missing_features_from_toml() {
+        let actual = toml::from_str::<Provider>(
+            r#"
+            transport = "rpc"
+            url = "http://localhost:8545"
+            label = "peering"
+        "#,
+        );
+
+        assert_eq!(true, actual.is_err());
+        assert_eq!(
+            actual.unwrap_err().to_string(),
+            "missing field `features` at line 1 column 1"
+        );
+    }
+
+    #[test]
+    fn it_works_on_new_web3_provider_from_toml() {
+        let actual = toml::from_str(
+            r#"
+            label = "peering"
+            details = { type = "web3", transport = "ipc", url = "http://localhost:8545", features = ["archive"], headers = { x-test = "value" } }
+        "#,
+        )
+        .unwrap();
+
+        let mut features = BTreeSet::new();
+        features.insert("archive".to_string());
+
+        let mut headers = HeaderMap::new();
+        headers.insert("x-test", HeaderValue::from_static("value"));
+
+        assert_eq!(
+            Provider {
+                label: "peering".to_owned(),
+                details: ProviderDetails::Web3(Web3Provider {
+                    transport: Transport::Ipc,
+                    url: "http://localhost:8545".to_owned(),
+                    features,
+                    headers,
+                    rules: Vec::new(),
+                }),
+            },
+            actual
+        );
+    }
+
+    #[test]
+    fn it_works_on_new_web3_provider_without_transport_from_toml() {
+        let actual = toml::from_str(
+            r#"
+            label = "peering"
+            details = { type = "web3", url = "http://localhost:8545", features = [] }
+        "#,
+        )
+        .unwrap();
+
+        assert_eq!(
+            Provider {
+                label: "peering".to_owned(),
+                details: ProviderDetails::Web3(Web3Provider {
+                    transport: Transport::Rpc,
+                    url: "http://localhost:8545".to_owned(),
+                    features: BTreeSet::new(),
+                    headers: HeaderMap::new(),
+                    rules: Vec::new(),
+                }),
+            },
+            actual
+        );
+    }
+
+    #[test]
+    fn it_errors_on_new_provider_with_deprecated_fields_from_toml() {
+        let actual = toml::from_str::<Provider>(
+            r#"
+            label = "peering"
+            url = "http://localhost:8545"
+            details = { type = "web3", url = "http://localhost:8545", features = [] }
+        "#,
+        );
+
+        assert_eq!(true, actual.is_err());
+        assert_eq!(actual.unwrap_err().to_string(), "when `details` field is provided, deprecated `url`, `transport`, `features` and `headers` cannot be specified at line 1 column 1");
+    }
+
+    #[test]
+    fn it_works_on_new_firehose_provider_from_toml() {
+        let actual = toml::from_str(
+            r#"
+                label = "firehose"
+                details = { type = "firehose", url = "http://localhost:9000", features = [] }
+            "#,
+        )
+        .unwrap();
+
+        assert_eq!(
+            Provider {
+                label: "firehose".to_owned(),
+                details: ProviderDetails::Firehose(FirehoseProvider {
+                    url: "http://localhost:9000".to_owned(),
+                    token: None,
+                    features: BTreeSet::new(),
+                    conn_pool_size: 10,
+                }),
+            },
+            actual
+        );
+    }
+
+    #[test]
+    fn it_works_on_substreams_provider_from_toml() {
+        let actual = toml::from_str(
+            r#"
+                label = "bananas"
+                details = { type = "substreams", url = "http://localhost:9000", features = [] }
+            "#,
+        )
+        .unwrap();
+
+        assert_eq!(
+            Provider {
+                label: "bananas".to_owned(),
+                details: ProviderDetails::Substreams(FirehoseProvider {
+                    url: "http://localhost:9000".to_owned(),
+                    token: None,
+                    features: BTreeSet::new(),
+                    conn_pool_size: 10,
+                }),
+            },
+            actual
+        );
+    }
+    #[test]
+    fn it_works_on_new_firehose_provider_from_toml_no_features() {
+        let actual = toml::from_str(
+            r#"
+                label = "firehose"
+                details = { type = "firehose", url = "http://localhost:9000" }
+            "#,
+        )
+        .unwrap();
+
+        assert_eq!(
+            Provider {
+                label: "firehose".to_owned(),
+                details: ProviderDetails::Firehose(FirehoseProvider {
+                    url: "http://localhost:9000".to_owned(),
+                    token: None,
+                    features: BTreeSet::new(),
+                    conn_pool_size: 10,
+                }),
+            },
+            actual
+        );
+    }
+
+    #[test]
+    fn it_works_on_new_firehose_provider_from_toml_unsupported_features() {
+        let actual = toml::from_str::<Provider>(
+            r#"
+                label = "firehose"
+                details = { type = "firehose", url = "http://localhost:9000", features = ["bananas"]}
+            "#,
+        ).unwrap().validate();
+        assert_eq!(true, actual.is_err(), "{:?}", actual);
+
+        if let Err(error) = actual {
+            assert_eq!(
+                true,
+                error
+                    .to_string()
+                    .starts_with("supported firehose endpoint filters are:")
+            )
+        }
+    }
+
+    #[test]
+    fn it_parses_web3_provider_rules() {
+        fn limit_for(node: &str) -> usize {
+            let prov = toml::from_str::<Web3Provider>(
+                r#"
+            label = "something"
+            url = "http://example.com"
+            features = []
+            match = [ { name = "some_node_.*", limit = 10 },
+                      { name = "other_node_.*", limit = 0 } ]
+        "#,
+            )
+            .unwrap();
+
+            prov.limit_for(&NodeId::new(node.to_string()).unwrap())
+        }
+
+        assert_eq!(10, limit_for("some_node_0"));
+        assert_eq!(0, limit_for("other_node_0"));
+        assert_eq!(usize::MAX, limit_for("default"));
+    }
+
+    fn read_resource_as_string<P: AsRef<Path>>(path: P) -> String {
+        let mut d = PathBuf::from(env!("CARGO_MANIFEST_DIR"));
+        d.push("resources/tests");
+        d.push(path);
+
+        read_to_string(&d).expect(&format!("resource {:?} not found", &d))
+    }
+}
diff --git a/node/src/lib.rs b/node/src/lib.rs
new file mode 100644
index 0000000..2d4f8ca
--- /dev/null
+++ b/node/src/lib.rs
@@ -0,0 +1,21 @@
+use std::sync::Arc;
+
+use graph::prometheus::Registry;
+use graph_core::MetricsRegistry;
+
+#[macro_use]
+extern crate diesel;
+
+pub mod chain;
+pub mod config;
+pub mod opt;
+pub mod store_builder;
+
+pub mod manager;
+
+pub struct MetricsContext {
+    pub prometheus: Arc<Registry>,
+    pub registry: Arc<MetricsRegistry>,
+    pub prometheus_host: Option<String>,
+    pub job_name: Option<String>,
+}
diff --git a/node/src/main.rs b/node/src/main.rs
new file mode 100644
index 0000000..326d5e8
--- /dev/null
+++ b/node/src/main.rs
@@ -0,0 +1,952 @@
+use clap::Parser as _;
+use ethereum::chain::{EthereumAdapterSelector, EthereumStreamBuilder};
+use ethereum::{
+    BlockIngestor as EthereumBlockIngestor, EthereumAdapterTrait, EthereumNetworks, RuntimeAdapter,
+};
+use git_testament::{git_testament, render_testament};
+use graph::blockchain::firehose_block_ingestor::FirehoseBlockIngestor;
+use graph::blockchain::{Block as BlockchainBlock, Blockchain, BlockchainKind, BlockchainMap};
+use graph::components::store::BlockStore;
+use graph::data::graphql::effort::LoadManager;
+use graph::env::EnvVars;
+use graph::firehose::{FirehoseEndpoints, FirehoseNetworks};
+use graph::log::logger;
+use graph::prelude::{IndexNodeServer as _, *};
+use graph::prometheus::Registry;
+use graph::url::Url;
+use graph_chain_arweave::{self as arweave, Block as ArweaveBlock};
+use graph_chain_cosmos::{self as cosmos, Block as CosmosFirehoseBlock};
+use graph_chain_ethereum as ethereum;
+use graph_chain_near::{self as near, HeaderOnlyBlock as NearFirehoseHeaderOnlyBlock};
+use graph_chain_substreams as substreams;
+use graph_core::polling_monitor::ipfs_service::IpfsService;
+use graph_core::{
+    LinkResolver, MetricsRegistry, SubgraphAssignmentProvider as IpfsSubgraphAssignmentProvider,
+    SubgraphInstanceManager, SubgraphRegistrar as IpfsSubgraphRegistrar,
+};
+use graph_graphql::prelude::GraphQlRunner;
+use graph_node::chain::{
+    connect_ethereum_networks, connect_firehose_networks, create_ethereum_networks,
+    create_firehose_networks, create_ipfs_clients, create_substreams_networks,
+};
+use graph_node::config::Config;
+use graph_node::opt;
+use graph_node::store_builder::StoreBuilder;
+use graph_server_http::GraphQLServer as GraphQLQueryServer;
+use graph_server_index_node::IndexNodeServer;
+use graph_server_json_rpc::JsonRpcServer;
+use graph_server_metrics::PrometheusMetricsServer;
+use graph_server_websocket::SubscriptionServer as GraphQLSubscriptionServer;
+use graph_store_postgres::{register_jobs as register_store_jobs, ChainHeadUpdateListener, Store};
+use near::NearStreamBuilder;
+use std::collections::BTreeMap;
+use std::io::{BufRead, BufReader};
+use std::path::Path;
+use std::sync::atomic;
+use std::time::Duration;
+use std::{collections::HashMap, env};
+use tokio::sync::mpsc;
+
+git_testament!(TESTAMENT);
+
+fn read_expensive_queries(
+    logger: &Logger,
+    expensive_queries_filename: String,
+) -> Result<Vec<Arc<q::Document>>, std::io::Error> {
+    // A file with a list of expensive queries, one query per line
+    // Attempts to run these queries will return a
+    // QueryExecutionError::TooExpensive to clients
+    let path = Path::new(&expensive_queries_filename);
+    let mut queries = Vec::new();
+    if path.exists() {
+        info!(
+            logger,
+            "Reading expensive queries file: {}", expensive_queries_filename
+        );
+        let file = std::fs::File::open(path)?;
+        let reader = BufReader::new(file);
+        for line in reader.lines() {
+            let line = line?;
+            let query = graphql_parser::parse_query(&line)
+                .map_err(|e| {
+                    let msg = format!(
+                        "invalid GraphQL query in {}: {}\n{}",
+                        expensive_queries_filename,
+                        e.to_string(),
+                        line
+                    );
+                    std::io::Error::new(std::io::ErrorKind::InvalidData, msg)
+                })?
+                .into_static();
+            queries.push(Arc::new(query));
+        }
+    } else {
+        warn!(
+            logger,
+            "Expensive queries file not set to a valid file: {}", expensive_queries_filename
+        );
+    }
+    Ok(queries)
+}
+
+#[tokio::main]
+async fn main() {
+    env_logger::init();
+
+    let opt = opt::Opt::parse();
+
+    // Set up logger
+    let logger = logger(opt.debug);
+
+    // Log version information
+    info!(
+        logger,
+        "Graph Node version: {}",
+        render_testament!(TESTAMENT)
+    );
+
+    if opt.unsafe_config {
+        warn!(logger, "allowing unsafe configurations");
+        graph::env::UNSAFE_CONFIG.store(true, atomic::Ordering::SeqCst);
+    }
+
+    if !graph_server_index_node::PoiProtection::from_env(&ENV_VARS).is_active() {
+        warn!(
+            logger,
+            "GRAPH_POI_ACCESS_TOKEN not set; might leak POIs to the public via GraphQL"
+        );
+    }
+
+    let config = match Config::load(&logger, &opt.clone().into()) {
+        Err(e) => {
+            eprintln!("configuration error: {}", e);
+            std::process::exit(1);
+        }
+        Ok(config) => config,
+    };
+    if opt.check_config {
+        match config.to_json() {
+            Ok(txt) => println!("{}", txt),
+            Err(e) => eprintln!("error serializing config: {}", e),
+        }
+        eprintln!("Successfully validated configuration");
+        std::process::exit(0);
+    }
+
+    let node_id = NodeId::new(opt.node_id.clone())
+        .expect("Node ID must be between 1 and 63 characters in length");
+    let query_only = config.query_only(&node_id);
+
+    // Obtain subgraph related command-line arguments
+    let subgraph = opt.subgraph.clone();
+
+    // Obtain ports to use for the GraphQL server(s)
+    let http_port = opt.http_port;
+    let ws_port = opt.ws_port;
+
+    // Obtain JSON-RPC server port
+    let json_rpc_port = opt.admin_port;
+
+    // Obtain index node server port
+    let index_node_port = opt.index_node_port;
+
+    // Obtain metrics server port
+    let metrics_port = opt.metrics_port;
+
+    // Obtain the fork base URL
+    let fork_base = match &opt.fork_base {
+        Some(url) => {
+            // Make sure the endpoint ends with a terminating slash.
+            let url = if !url.ends_with("/") {
+                let mut url = url.clone();
+                url.push('/');
+                Url::parse(&url)
+            } else {
+                Url::parse(url)
+            };
+
+            Some(url.expect("Failed to parse the fork base URL"))
+        }
+        None => {
+            warn!(
+                logger,
+                "No fork base URL specified, subgraph forking is disabled"
+            );
+            None
+        }
+    };
+
+    info!(logger, "Starting up");
+
+    // Optionally, identify the Elasticsearch logging configuration
+    let elastic_config = opt
+        .elasticsearch_url
+        .clone()
+        .map(|endpoint| ElasticLoggingConfig {
+            endpoint: endpoint.clone(),
+            username: opt.elasticsearch_user.clone(),
+            password: opt.elasticsearch_password.clone(),
+            client: reqwest::Client::new(),
+        });
+
+    // Create a component and subgraph logger factory
+    let logger_factory = LoggerFactory::new(logger.clone(), elastic_config);
+
+    // Try to create IPFS clients for each URL specified in `--ipfs`
+    let ipfs_clients: Vec<_> = create_ipfs_clients(&logger, &opt.ipfs);
+    let ipfs_client = ipfs_clients.first().cloned().expect("Missing IPFS client");
+    let ipfs_service = IpfsService::new(
+        ipfs_client,
+        ENV_VARS.mappings.max_ipfs_file_bytes as u64,
+        ENV_VARS.mappings.ipfs_timeout,
+        ENV_VARS.mappings.max_ipfs_concurrent_requests,
+    );
+
+    // Convert the clients into a link resolver. Since we want to get past
+    // possible temporary DNS failures, make the resolver retry
+    let link_resolver = Arc::new(LinkResolver::new(
+        ipfs_clients,
+        Arc::new(EnvVars::default()),
+    ));
+
+    // Set up Prometheus registry
+    let prometheus_registry = Arc::new(Registry::new());
+    let metrics_registry = Arc::new(MetricsRegistry::new(
+        logger.clone(),
+        prometheus_registry.clone(),
+    ));
+    let mut metrics_server =
+        PrometheusMetricsServer::new(&logger_factory, prometheus_registry.clone());
+
+    // Ethereum clients; query nodes ignore all ethereum clients and never
+    // connect to them directly
+    let eth_networks = if query_only {
+        EthereumNetworks::new()
+    } else {
+        create_ethereum_networks(logger.clone(), metrics_registry.clone(), &config)
+            .await
+            .expect("Failed to parse Ethereum networks")
+    };
+
+    let mut firehose_networks_by_kind = if query_only {
+        BTreeMap::new()
+    } else {
+        create_firehose_networks(logger.clone(), &config)
+    };
+
+    let substreams_networks_by_kind = if query_only {
+        BTreeMap::new()
+    } else {
+        create_substreams_networks(logger.clone(), &config)
+    };
+
+    let graphql_metrics_registry = metrics_registry.clone();
+
+    let contention_logger = logger.clone();
+
+    // TODO: make option loadable from configuration TOML and environment:
+    let expensive_queries =
+        read_expensive_queries(&logger, opt.expensive_queries_filename).unwrap();
+
+    let store_builder = StoreBuilder::new(
+        &logger,
+        &node_id,
+        &config,
+        fork_base,
+        metrics_registry.cheap_clone(),
+    )
+    .await;
+
+    let launch_services = |logger: Logger| async move {
+        let subscription_manager = store_builder.subscription_manager();
+        let chain_head_update_listener = store_builder.chain_head_update_listener();
+        let primary_pool = store_builder.primary_pool();
+
+        // To support the ethereum block ingestor, ethereum networks are referenced both by the
+        // `blockchain_map` and `ethereum_chains`. Future chains should be referred to only in
+        // `blockchain_map`.
+        let mut blockchain_map = BlockchainMap::new();
+
+        let (arweave_networks, arweave_idents) = connect_firehose_networks::<ArweaveBlock>(
+            &logger,
+            firehose_networks_by_kind
+                .remove(&BlockchainKind::Arweave)
+                .unwrap_or_else(|| FirehoseNetworks::new()),
+        )
+        .await;
+
+        let (eth_networks, ethereum_idents) =
+            connect_ethereum_networks(&logger, eth_networks).await;
+
+        let (near_networks, near_idents) =
+            connect_firehose_networks::<NearFirehoseHeaderOnlyBlock>(
+                &logger,
+                firehose_networks_by_kind
+                    .remove(&BlockchainKind::Near)
+                    .unwrap_or_else(|| FirehoseNetworks::new()),
+            )
+            .await;
+
+        let (cosmos_networks, cosmos_idents) = connect_firehose_networks::<CosmosFirehoseBlock>(
+            &logger,
+            firehose_networks_by_kind
+                .remove(&BlockchainKind::Cosmos)
+                .unwrap_or_else(|| FirehoseNetworks::new()),
+        )
+        .await;
+
+        let network_identifiers = ethereum_idents
+            .into_iter()
+            .chain(arweave_idents)
+            .chain(near_idents)
+            .chain(cosmos_idents)
+            .collect();
+
+        let network_store = store_builder.network_store(network_identifiers);
+
+        let arweave_chains = arweave_networks_as_chains(
+            &mut blockchain_map,
+            &logger,
+            &arweave_networks,
+            network_store.as_ref(),
+            &logger_factory,
+            metrics_registry.clone(),
+        );
+
+        let ethereum_chains = ethereum_networks_as_chains(
+            &mut blockchain_map,
+            &logger,
+            node_id.clone(),
+            metrics_registry.clone(),
+            firehose_networks_by_kind.get(&BlockchainKind::Ethereum),
+            substreams_networks_by_kind.get(&BlockchainKind::Ethereum),
+            &eth_networks,
+            network_store.as_ref(),
+            chain_head_update_listener,
+            &logger_factory,
+            metrics_registry.clone(),
+        );
+
+        let near_chains = near_networks_as_chains(
+            &mut blockchain_map,
+            &logger,
+            &near_networks,
+            network_store.as_ref(),
+            &logger_factory,
+            metrics_registry.clone(),
+        );
+
+        let cosmos_chains = cosmos_networks_as_chains(
+            &mut blockchain_map,
+            &logger,
+            &cosmos_networks,
+            network_store.as_ref(),
+            &logger_factory,
+            metrics_registry.clone(),
+        );
+
+        let blockchain_map = Arc::new(blockchain_map);
+
+        let load_manager = Arc::new(LoadManager::new(
+            &logger,
+            expensive_queries,
+            metrics_registry.clone(),
+        ));
+        let graphql_runner = Arc::new(GraphQlRunner::new(
+            &logger,
+            network_store.clone(),
+            subscription_manager.clone(),
+            load_manager,
+            graphql_metrics_registry,
+        ));
+        let mut graphql_server =
+            GraphQLQueryServer::new(&logger_factory, graphql_runner.clone(), node_id.clone());
+        let subscription_server =
+            GraphQLSubscriptionServer::new(&logger, graphql_runner.clone(), network_store.clone());
+
+        let mut index_node_server = IndexNodeServer::new(
+            &logger_factory,
+            blockchain_map.clone(),
+            graphql_runner.clone(),
+            network_store.clone(),
+            link_resolver.clone(),
+        );
+
+        if !opt.disable_block_ingestor {
+            if ethereum_chains.len() > 0 {
+                let block_polling_interval = Duration::from_millis(opt.ethereum_polling_interval);
+
+                start_block_ingestor(
+                    &logger,
+                    &logger_factory,
+                    block_polling_interval,
+                    ethereum_chains,
+                );
+            }
+
+            start_firehose_block_ingestor::<_, ArweaveBlock>(
+                &logger,
+                &network_store,
+                arweave_chains,
+            );
+
+            start_firehose_block_ingestor::<_, NearFirehoseHeaderOnlyBlock>(
+                &logger,
+                &network_store,
+                near_chains,
+            );
+            start_firehose_block_ingestor::<_, CosmosFirehoseBlock>(
+                &logger,
+                &network_store,
+                cosmos_chains,
+            );
+
+            // Start a task runner
+            let mut job_runner = graph::util::jobs::Runner::new(&logger);
+            register_store_jobs(
+                &mut job_runner,
+                network_store.clone(),
+                primary_pool,
+                metrics_registry.clone(),
+            );
+            graph::spawn_blocking(job_runner.start());
+        }
+        let static_filters = ENV_VARS.experimental_static_filters;
+
+        let subgraph_instance_manager = SubgraphInstanceManager::new(
+            &logger_factory,
+            network_store.subgraph_store(),
+            blockchain_map.cheap_clone(),
+            metrics_registry.clone(),
+            link_resolver.clone(),
+            ipfs_service,
+            static_filters,
+        );
+
+        // Create IPFS-based subgraph provider
+        let subgraph_provider = IpfsSubgraphAssignmentProvider::new(
+            &logger_factory,
+            link_resolver.clone(),
+            subgraph_instance_manager,
+        );
+
+        // Check version switching mode environment variable
+        let version_switching_mode = ENV_VARS.subgraph_version_switching_mode;
+
+        // Create named subgraph provider for resolving subgraph name->ID mappings
+        let subgraph_registrar = Arc::new(IpfsSubgraphRegistrar::new(
+            &logger_factory,
+            link_resolver,
+            Arc::new(subgraph_provider),
+            network_store.subgraph_store(),
+            subscription_manager,
+            blockchain_map,
+            node_id.clone(),
+            version_switching_mode,
+        ));
+        graph::spawn(
+            subgraph_registrar
+                .start()
+                .map_err(|e| panic!("failed to initialize subgraph provider {}", e))
+                .compat(),
+        );
+
+        // Start admin JSON-RPC server.
+        let json_rpc_server = JsonRpcServer::serve(
+            json_rpc_port,
+            http_port,
+            ws_port,
+            subgraph_registrar.clone(),
+            node_id.clone(),
+            logger.clone(),
+        )
+        .await
+        .expect("failed to start JSON-RPC admin server");
+
+        // Let the server run forever.
+        std::mem::forget(json_rpc_server);
+
+        // Add the CLI subgraph with a REST request to the admin server.
+        if let Some(subgraph) = subgraph {
+            let (name, hash) = if subgraph.contains(':') {
+                let mut split = subgraph.split(':');
+                (split.next().unwrap(), split.next().unwrap().to_owned())
+            } else {
+                ("cli", subgraph)
+            };
+
+            let name = SubgraphName::new(name)
+                .expect("Subgraph name must contain only a-z, A-Z, 0-9, '-' and '_'");
+            let subgraph_id =
+                DeploymentHash::new(hash).expect("Subgraph hash must be a valid IPFS hash");
+            let debug_fork = opt
+                .debug_fork
+                .map(DeploymentHash::new)
+                .map(|h| h.expect("Debug fork hash must be a valid IPFS hash"));
+            let start_block = opt
+                .start_block
+                .map(|block| {
+                    let mut split = block.split(":");
+                    (
+                        // BlockHash
+                        split.next().unwrap().to_owned(),
+                        // BlockNumber
+                        split.next().unwrap().parse::<i64>().unwrap(),
+                    )
+                })
+                .map(|(hash, number)| BlockPtr::try_from((hash.as_str(), number)))
+                .map(Result::unwrap);
+
+            graph::spawn(
+                async move {
+                    subgraph_registrar.create_subgraph(name.clone()).await?;
+                    subgraph_registrar
+                        .create_subgraph_version(
+                            name,
+                            subgraph_id,
+                            node_id,
+                            debug_fork,
+                            start_block,
+                            None,
+                        )
+                        .await
+                }
+                .map_err(|e| panic!("Failed to deploy subgraph from `--subgraph` flag: {}", e)),
+            );
+        }
+
+        // Serve GraphQL queries over HTTP
+        graph::spawn(
+            graphql_server
+                .serve(http_port, ws_port)
+                .expect("Failed to start GraphQL query server")
+                .compat(),
+        );
+
+        // Serve GraphQL subscriptions over WebSockets
+        graph::spawn(subscription_server.serve(ws_port));
+
+        // Run the index node server
+        graph::spawn(
+            index_node_server
+                .serve(index_node_port)
+                .expect("Failed to start index node server")
+                .compat(),
+        );
+
+        graph::spawn(
+            metrics_server
+                .serve(metrics_port)
+                .expect("Failed to start metrics server")
+                .compat(),
+        );
+    };
+
+    graph::spawn(launch_services(logger.clone()));
+
+    // Periodically check for contention in the tokio threadpool. First spawn a
+    // task that simply responds to "ping" requests. Then spawn a separate
+    // thread to periodically ping it and check responsiveness.
+    let (ping_send, mut ping_receive) = mpsc::channel::<crossbeam_channel::Sender<()>>(1);
+    graph::spawn(async move {
+        while let Some(pong_send) = ping_receive.recv().await {
+            let _ = pong_send.clone().send(());
+        }
+        panic!("ping sender dropped");
+    });
+    std::thread::spawn(move || loop {
+        std::thread::sleep(Duration::from_secs(1));
+        let (pong_send, pong_receive) = crossbeam_channel::bounded(1);
+        if futures::executor::block_on(ping_send.clone().send(pong_send)).is_err() {
+            debug!(contention_logger, "Shutting down contention checker thread");
+            break;
+        }
+        let mut timeout = Duration::from_millis(10);
+        while pong_receive.recv_timeout(timeout)
+            == Err(crossbeam_channel::RecvTimeoutError::Timeout)
+        {
+            debug!(contention_logger, "Possible contention in tokio threadpool";
+                                     "timeout_ms" => timeout.as_millis(),
+                                     "code" => LogCode::TokioContention);
+            if timeout < Duration::from_secs(10) {
+                timeout *= 10;
+            } else if ENV_VARS.kill_if_unresponsive {
+                // The node is unresponsive, kill it in hopes it will be restarted.
+                crit!(contention_logger, "Node is unresponsive, killing process");
+                std::process::abort()
+            }
+        }
+    });
+
+    futures::future::pending::<()>().await;
+}
+
+/// Return the hashmap of Arweave chains and also add them to `blockchain_map`.
+fn arweave_networks_as_chains(
+    blockchain_map: &mut BlockchainMap,
+    logger: &Logger,
+    firehose_networks: &FirehoseNetworks,
+    store: &Store,
+    logger_factory: &LoggerFactory,
+    metrics_registry: Arc<MetricsRegistry>,
+) -> HashMap<String, FirehoseChain<arweave::Chain>> {
+    let chains: Vec<_> = firehose_networks
+        .networks
+        .iter()
+        .filter_map(|(chain_id, endpoints)| {
+            store
+                .block_store()
+                .chain_store(chain_id)
+                .map(|chain_store| (chain_id, chain_store, endpoints))
+                .or_else(|| {
+                    error!(
+                        logger,
+                        "No store configured for Arweave chain {}; ignoring this chain", chain_id
+                    );
+                    None
+                })
+        })
+        .map(|(chain_id, chain_store, endpoints)| {
+            (
+                chain_id.clone(),
+                FirehoseChain {
+                    chain: Arc::new(arweave::Chain::new(
+                        logger_factory.clone(),
+                        chain_id.clone(),
+                        chain_store,
+                        endpoints.clone(),
+                        metrics_registry.clone(),
+                    )),
+                    firehose_endpoints: endpoints.clone(),
+                },
+            )
+        })
+        .collect();
+
+    for (chain_id, firehose_chain) in chains.iter() {
+        blockchain_map.insert::<arweave::Chain>(chain_id.clone(), firehose_chain.chain.clone())
+    }
+
+    HashMap::from_iter(chains)
+}
+
+/// Return the hashmap of ethereum chains and also add them to `blockchain_map`.
+fn ethereum_networks_as_chains(
+    blockchain_map: &mut BlockchainMap,
+    logger: &Logger,
+    node_id: NodeId,
+    registry: Arc<MetricsRegistry>,
+    firehose_networks: Option<&FirehoseNetworks>,
+    substreams_networks: Option<&FirehoseNetworks>,
+    eth_networks: &EthereumNetworks,
+    store: &Store,
+    chain_head_update_listener: Arc<ChainHeadUpdateListener>,
+    logger_factory: &LoggerFactory,
+    metrics_registry: Arc<MetricsRegistry>,
+) -> HashMap<String, Arc<ethereum::Chain>> {
+    let chains: Vec<_> = eth_networks
+        .networks
+        .iter()
+        .filter_map(|(network_name, eth_adapters)| {
+            store
+                .block_store()
+                .chain_store(network_name)
+                .map(|chain_store| {
+                    let is_ingestible = chain_store.is_ingestible();
+                    (network_name, eth_adapters, chain_store, is_ingestible)
+                })
+                .or_else(|| {
+                    error!(
+                        logger,
+                        "No store configured for Ethereum chain {}; ignoring this chain",
+                        network_name
+                    );
+                    None
+                })
+        })
+        .map(|(network_name, eth_adapters, chain_store, is_ingestible)| {
+            let firehose_endpoints = firehose_networks.and_then(|v| v.networks.get(network_name));
+
+            let adapter_selector = EthereumAdapterSelector::new(
+                logger_factory.clone(),
+                Arc::new(eth_adapters.clone()),
+                Arc::new(
+                    firehose_endpoints
+                        .map(|fe| fe.clone())
+                        .unwrap_or(FirehoseEndpoints::new()),
+                ),
+                registry.clone(),
+                chain_store.clone(),
+            );
+
+            let runtime_adapter = Arc::new(RuntimeAdapter {
+                eth_adapters: Arc::new(eth_adapters.clone()),
+                call_cache: chain_store.cheap_clone(),
+            });
+
+            let chain = ethereum::Chain::new(
+                logger_factory.clone(),
+                network_name.clone(),
+                node_id.clone(),
+                registry.clone(),
+                chain_store.cheap_clone(),
+                chain_store,
+                firehose_endpoints.map_or_else(|| FirehoseEndpoints::new(), |v| v.clone()),
+                eth_adapters.clone(),
+                chain_head_update_listener.clone(),
+                Arc::new(EthereumStreamBuilder {}),
+                Arc::new(adapter_selector),
+                runtime_adapter,
+                ethereum::ENV_VARS.reorg_threshold,
+                is_ingestible,
+            );
+            (network_name.clone(), Arc::new(chain))
+        })
+        .collect();
+
+    for (network_name, chain) in chains.iter().cloned() {
+        blockchain_map.insert::<graph_chain_ethereum::Chain>(network_name, chain)
+    }
+
+    if let Some(substreams_networks) = substreams_networks {
+        for (network_name, firehose_endpoints) in substreams_networks.networks.iter() {
+            let chain_store = blockchain_map
+                .get::<graph_chain_ethereum::Chain>(network_name.clone())
+                .expect("any substreams endpoint needs an rpc or firehose chain defined")
+                .chain_store();
+
+            blockchain_map.insert::<substreams::Chain>(
+                network_name.clone(),
+                Arc::new(substreams::Chain::new(
+                    logger_factory.clone(),
+                    firehose_endpoints.clone(),
+                    metrics_registry.clone(),
+                    chain_store,
+                    Arc::new(substreams::BlockStreamBuilder::new()),
+                )),
+            );
+        }
+    }
+
+    HashMap::from_iter(chains)
+}
+
+fn cosmos_networks_as_chains(
+    blockchain_map: &mut BlockchainMap,
+    logger: &Logger,
+    firehose_networks: &FirehoseNetworks,
+    store: &Store,
+    logger_factory: &LoggerFactory,
+    metrics_registry: Arc<MetricsRegistry>,
+) -> HashMap<String, FirehoseChain<cosmos::Chain>> {
+    let chains: Vec<_> = firehose_networks
+        .networks
+        .iter()
+        .filter_map(|(network_name, firehose_endpoints)| {
+            store
+                .block_store()
+                .chain_store(network_name)
+                .map(|chain_store| (network_name, chain_store, firehose_endpoints))
+                .or_else(|| {
+                    error!(
+                        logger,
+                        "No store configured for Cosmos chain {}; ignoring this chain",
+                        network_name
+                    );
+                    None
+                })
+        })
+        .map(|(network_name, chain_store, firehose_endpoints)| {
+            (
+                network_name.clone(),
+                FirehoseChain {
+                    chain: Arc::new(cosmos::Chain::new(
+                        logger_factory.clone(),
+                        network_name.clone(),
+                        chain_store,
+                        firehose_endpoints.clone(),
+                        metrics_registry.clone(),
+                    )),
+                    firehose_endpoints: firehose_endpoints.clone(),
+                },
+            )
+        })
+        .collect();
+
+    for (network_name, firehose_chain) in chains.iter() {
+        blockchain_map.insert::<cosmos::Chain>(network_name.clone(), firehose_chain.chain.clone())
+    }
+
+    HashMap::from_iter(chains)
+}
+
+/// Return the hashmap of NEAR chains and also add them to `blockchain_map`.
+fn near_networks_as_chains(
+    blockchain_map: &mut BlockchainMap,
+    logger: &Logger,
+    firehose_networks: &FirehoseNetworks,
+    store: &Store,
+    logger_factory: &LoggerFactory,
+    metrics_registry: Arc<MetricsRegistry>,
+) -> HashMap<String, FirehoseChain<near::Chain>> {
+    let chains: Vec<_> = firehose_networks
+        .networks
+        .iter()
+        .filter_map(|(chain_id, endpoints)| {
+            store
+                .block_store()
+                .chain_store(chain_id)
+                .map(|chain_store| (chain_id, chain_store, endpoints))
+                .or_else(|| {
+                    error!(
+                        logger,
+                        "No store configured for NEAR chain {}; ignoring this chain", chain_id
+                    );
+                    None
+                })
+        })
+        .map(|(chain_id, chain_store, endpoints)| {
+            (
+                chain_id.clone(),
+                FirehoseChain {
+                    chain: Arc::new(near::Chain::new(
+                        logger_factory.clone(),
+                        chain_id.clone(),
+                        chain_store,
+                        endpoints.clone(),
+                        metrics_registry.clone(),
+                        Arc::new(NearStreamBuilder {}),
+                    )),
+                    firehose_endpoints: endpoints.clone(),
+                },
+            )
+        })
+        .collect();
+
+    for (chain_id, firehose_chain) in chains.iter() {
+        blockchain_map
+            .insert::<graph_chain_near::Chain>(chain_id.clone(), firehose_chain.chain.clone())
+    }
+
+    HashMap::from_iter(chains)
+}
+
+fn start_block_ingestor(
+    logger: &Logger,
+    logger_factory: &LoggerFactory,
+    block_polling_interval: Duration,
+    chains: HashMap<String, Arc<ethereum::Chain>>,
+) {
+    info!(
+        logger,
+        "Starting block ingestors with {} chains [{}]",
+        chains.len(),
+        chains
+            .keys()
+            .map(|v| v.clone())
+            .collect::<Vec<String>>()
+            .join(", ")
+    );
+
+    // Create Ethereum block ingestors and spawn a thread to run each
+    chains
+        .iter()
+        .filter(|(network_name, chain)| {
+            if !chain.is_ingestible {
+                error!(logger, "Not starting block ingestor (chain is defective)"; "network_name" => &network_name);
+            }
+            chain.is_ingestible
+        })
+        .for_each(|(network_name, chain)| {
+            info!(
+                logger,
+                "Starting block ingestor for network";
+                "network_name" => &network_name
+            );
+
+            let eth_adapter = chain.cheapest_adapter();
+                let logger = logger_factory
+                    .component_logger(
+                        "BlockIngestor",
+                        Some(ComponentLoggerConfig {
+                            elastic: Some(ElasticComponentLoggerConfig {
+                                index: String::from("block-ingestor-logs"),
+                            }),
+                        }),
+                    )
+                    .new(o!("provider" => eth_adapter.provider().to_string()));
+
+            // The block ingestor must be configured to keep at least REORG_THRESHOLD ancestors,
+            // because the json-rpc BlockStream expects blocks after the reorg threshold to be
+            // present in the DB.
+            let block_ingestor = EthereumBlockIngestor::new(
+                logger,
+                ethereum::ENV_VARS.reorg_threshold,
+                eth_adapter,
+                chain.chain_store(),
+                block_polling_interval,
+            )
+            .expect("failed to create Ethereum block ingestor");
+
+            // Run the Ethereum block ingestor in the background
+            graph::spawn(block_ingestor.into_polling_stream());
+        });
+}
+
+#[derive(Clone)]
+struct FirehoseChain<C: Blockchain> {
+    chain: Arc<C>,
+    firehose_endpoints: FirehoseEndpoints,
+}
+
+fn start_firehose_block_ingestor<C, M>(
+    logger: &Logger,
+    store: &Store,
+    chains: HashMap<String, FirehoseChain<C>>,
+) where
+    C: Blockchain,
+    M: prost::Message + BlockchainBlock + Default + 'static,
+{
+    info!(
+        logger,
+        "Starting firehose block ingestors with {} chains [{}]",
+        chains.len(),
+        chains
+            .keys()
+            .map(|v| v.clone())
+            .collect::<Vec<String>>()
+            .join(", ")
+    );
+
+    // Create Firehose block ingestors and spawn a thread to run each
+    chains
+        .iter()
+        .for_each(|(network_name, chain)| {
+            info!(
+                logger,
+                "Starting firehose block ingestor for network";
+                "network_name" => &network_name
+            );
+
+            let endpoint = chain
+                .firehose_endpoints
+                .random()
+                .expect("One Firehose endpoint should exist at that execution point");
+
+            match store.block_store().chain_store(network_name.as_ref()) {
+                Some(s) => {
+                    let block_ingestor = FirehoseBlockIngestor::<M>::new(
+                        s,
+                        endpoint.clone(),
+                        logger.new(o!("component" => "FirehoseBlockIngestor", "provider" => endpoint.provider.clone())),
+                    );
+
+                    // Run the Firehose block ingestor in the background
+                    graph::spawn(block_ingestor.run());
+                },
+                None => {
+                    error!(logger, "Not starting firehose block ingestor (no chain store available)"; "network_name" => &network_name);
+                }
+            }
+        });
+}
diff --git a/node/src/manager/catalog.rs b/node/src/manager/catalog.rs
new file mode 100644
index 0000000..af17a38
--- /dev/null
+++ b/node/src/manager/catalog.rs
@@ -0,0 +1,71 @@
+pub mod pg_catalog {
+    diesel::table! {
+        pg_catalog.pg_stat_database (datid) {
+            datid -> Oid,
+            datname -> Nullable<Text>,
+            numbackends -> Nullable<Int4>,
+            xact_commit -> Nullable<Int8>,
+            xact_rollback -> Nullable<Int8>,
+            blks_read -> Nullable<Int8>,
+            blks_hit -> Nullable<Int8>,
+            tup_returned -> Nullable<Int8>,
+            tup_fetched -> Nullable<Int8>,
+            tup_inserted -> Nullable<Int8>,
+            tup_updated -> Nullable<Int8>,
+            tup_deleted -> Nullable<Int8>,
+            conflicts -> Nullable<Int8>,
+            temp_files -> Nullable<Int8>,
+            temp_bytes -> Nullable<Int8>,
+            deadlocks -> Nullable<Int8>,
+            blk_read_time -> Nullable<Float8>,
+            blk_write_time -> Nullable<Float8>,
+            stats_reset -> Nullable<Timestamptz>,
+        }
+    }
+
+    diesel::table! {
+        pg_catalog.pg_stat_user_indexes (relid) {
+            relid -> Oid,
+            indexrelid -> Nullable<Oid>,
+            schemaname -> Nullable<Text>,
+            relname -> Nullable<Text>,
+            indexrelname -> Nullable<Text>,
+            idx_scan -> Nullable<Int8>,
+            idx_tup_read -> Nullable<Int8>,
+            idx_tup_fetch -> Nullable<Int8>,
+        }
+    }
+
+    diesel::table! {
+        pg_catalog.pg_stat_user_tables (relid) {
+            relid -> Oid,
+            schemaname -> Nullable<Text>,
+            relname -> Nullable<Text>,
+            seq_scan -> Nullable<Int8>,
+            seq_tup_read -> Nullable<Int8>,
+            idx_scan -> Nullable<Int8>,
+            idx_tup_fetch -> Nullable<Int8>,
+            n_tup_ins -> Nullable<Int8>,
+            n_tup_upd -> Nullable<Int8>,
+            n_tup_del -> Nullable<Int8>,
+            n_tup_hot_upd -> Nullable<Int8>,
+            n_live_tup -> Nullable<Int8>,
+            n_dead_tup -> Nullable<Int8>,
+            n_mod_since_analyze -> Nullable<Int8>,
+            last_vacuum -> Nullable<Timestamptz>,
+            last_autovacuum -> Nullable<Timestamptz>,
+            last_analyze -> Nullable<Timestamptz>,
+            last_autoanalyze -> Nullable<Timestamptz>,
+            vacuum_count -> Nullable<Int8>,
+            autovacuum_count -> Nullable<Int8>,
+            analyze_count -> Nullable<Int8>,
+            autoanalyze_count -> Nullable<Int8>,
+        }
+    }
+
+    diesel::allow_tables_to_appear_in_same_query!(
+        pg_stat_database,
+        pg_stat_user_indexes,
+        pg_stat_user_tables,
+    );
+}
diff --git a/node/src/manager/commands/assign.rs b/node/src/manager/commands/assign.rs
new file mode 100644
index 0000000..aa045a1
--- /dev/null
+++ b/node/src/manager/commands/assign.rs
@@ -0,0 +1,62 @@
+use graph::prelude::{anyhow::anyhow, Error, NodeId, StoreEvent};
+use graph_store_postgres::{
+    command_support::catalog, connection_pool::ConnectionPool, NotificationSender,
+};
+
+use crate::manager::deployment::DeploymentSearch;
+
+pub async fn unassign(
+    primary: ConnectionPool,
+    sender: &NotificationSender,
+    search: &DeploymentSearch,
+) -> Result<(), Error> {
+    let locator = search.locate_unique(&primary)?;
+
+    let conn = primary.get()?;
+    let conn = catalog::Connection::new(conn);
+
+    let site = conn
+        .locate_site(locator.clone())?
+        .ok_or_else(|| anyhow!("failed to locate site for {locator}"))?;
+
+    println!("unassigning {locator}");
+    let changes = conn.unassign_subgraph(&site)?;
+    conn.send_store_event(sender, &StoreEvent::new(changes))?;
+
+    Ok(())
+}
+
+pub fn reassign(
+    primary: ConnectionPool,
+    sender: &NotificationSender,
+    search: &DeploymentSearch,
+    node: String,
+) -> Result<(), Error> {
+    let node = NodeId::new(node.clone()).map_err(|()| anyhow!("illegal node id `{}`", node))?;
+    let locator = search.locate_unique(&primary)?;
+
+    let conn = primary.get()?;
+    let conn = catalog::Connection::new(conn);
+
+    let site = conn
+        .locate_site(locator.clone())?
+        .ok_or_else(|| anyhow!("failed to locate site for {locator}"))?;
+    let changes = match conn.assigned_node(&site)? {
+        Some(cur) => {
+            if cur == node {
+                println!("deployment {locator} is already assigned to {cur}");
+                vec![]
+            } else {
+                println!("reassigning {locator} to {node} (was {cur})");
+                conn.reassign_subgraph(&site, &node)?
+            }
+        }
+        None => {
+            println!("assigning {locator} to {node}");
+            conn.assign_subgraph(&site, &node)?
+        }
+    };
+    conn.send_store_event(sender, &StoreEvent::new(changes))?;
+
+    Ok(())
+}
diff --git a/node/src/manager/commands/chain.rs b/node/src/manager/commands/chain.rs
new file mode 100644
index 0000000..764ae06
--- /dev/null
+++ b/node/src/manager/commands/chain.rs
@@ -0,0 +1,131 @@
+use std::sync::Arc;
+
+use graph::blockchain::BlockPtr;
+use graph::cheap_clone::CheapClone;
+use graph::prelude::BlockNumber;
+use graph::prelude::ChainStore as _;
+use graph::prelude::EthereumBlock;
+use graph::prelude::LightEthereumBlockExt as _;
+use graph::prelude::{anyhow, anyhow::bail};
+use graph::{
+    components::store::BlockStore as _, prelude::anyhow::Error, prelude::serde_json as json,
+};
+use graph_store_postgres::BlockStore;
+use graph_store_postgres::{
+    command_support::catalog::block_store, connection_pool::ConnectionPool,
+};
+
+pub async fn list(primary: ConnectionPool, store: Arc<BlockStore>) -> Result<(), Error> {
+    let mut chains = {
+        let conn = primary.get()?;
+        block_store::load_chains(&conn)?
+    };
+    chains.sort_by_key(|chain| chain.name.clone());
+
+    if !chains.is_empty() {
+        println!(
+            "{:^20} | {:^10} | {:^10} | {:^7} | {:^10}",
+            "name", "shard", "namespace", "version", "head block"
+        );
+        println!(
+            "{:-^20}-+-{:-^10}-+-{:-^10}-+-{:-^7}-+-{:-^10}",
+            "", "", "", "", ""
+        );
+    }
+    for chain in chains {
+        let head_block = match store.chain_store(&chain.name) {
+            None => "no chain".to_string(),
+            Some(chain_store) => chain_store
+                .chain_head_ptr()
+                .await?
+                .map(|ptr| ptr.number.to_string())
+                .unwrap_or("none".to_string()),
+        };
+        println!(
+            "{:<20} | {:<10} | {:<10} | {:>7} | {:>10}",
+            chain.name, chain.shard, chain.storage, chain.net_version, head_block
+        );
+    }
+    Ok(())
+}
+
+pub async fn info(
+    primary: ConnectionPool,
+    store: Arc<BlockStore>,
+    name: String,
+    offset: BlockNumber,
+    hashes: bool,
+) -> Result<(), Error> {
+    fn row(label: &str, value: impl std::fmt::Display) {
+        println!("{:<16} | {}", label, value.to_string());
+    }
+
+    fn print_ptr(label: &str, ptr: Option<BlockPtr>, hashes: bool) {
+        match ptr {
+            None => {
+                row(label, "ø");
+            }
+            Some(ptr) => {
+                row(label, ptr.number);
+                if hashes {
+                    row("", ptr.hash);
+                }
+            }
+        }
+    }
+
+    let conn = primary.get()?;
+
+    let chain =
+        block_store::find_chain(&conn, &name)?.ok_or_else(|| anyhow!("unknown chain: {}", name))?;
+
+    let chain_store = store
+        .chain_store(&chain.name)
+        .ok_or_else(|| anyhow!("unknown chain: {}", name))?;
+    let head_block = chain_store.cheap_clone().chain_head_ptr().await?;
+    let ancestor = match &head_block {
+        None => None,
+        Some(head_block) => chain_store
+            .ancestor_block(head_block.clone(), offset)
+            .await?
+            .map(json::from_value::<EthereumBlock>)
+            .transpose()?
+            .map(|b| b.block.block_ptr()),
+    };
+
+    row("name", chain.name);
+    row("shard", chain.shard);
+    row("namespace", chain.storage);
+    row("net_version", chain.net_version);
+    if hashes {
+        row("genesis", chain.genesis_block);
+    }
+    print_ptr("head block", head_block, hashes);
+    row("reorg threshold", offset);
+    print_ptr("reorg ancestor", ancestor, hashes);
+
+    Ok(())
+}
+
+pub fn remove(primary: ConnectionPool, store: Arc<BlockStore>, name: String) -> Result<(), Error> {
+    let sites = {
+        let conn = graph_store_postgres::command_support::catalog::Connection::new(primary.get()?);
+        conn.find_sites_for_network(&name)?
+    };
+
+    if !sites.is_empty() {
+        println!(
+            "there are {} deployments using chain {}:",
+            sites.len(),
+            name
+        );
+        for site in sites {
+            println!("{:<8} | {} ", site.namespace, site.deployment);
+        }
+        bail!("remove all deployments using chain {} first", name);
+    }
+
+    store.drop_chain(&name)?;
+
+    Ok(())
+}
diff --git a/node/src/manager/commands/check_blocks.rs b/node/src/manager/commands/check_blocks.rs
new file mode 100644
index 0000000..e5d2c0c
--- /dev/null
+++ b/node/src/manager/commands/check_blocks.rs
@@ -0,0 +1,269 @@
+use graph::{
+    anyhow::{bail, ensure},
+    components::store::ChainStore as ChainStoreTrait,
+    prelude::{
+        anyhow::{self, anyhow, Context},
+        web3::types::H256,
+    },
+    slog::Logger,
+};
+use graph_chain_ethereum::{EthereumAdapter, EthereumAdapterTrait};
+use graph_store_postgres::ChainStore;
+use std::sync::Arc;
+
+pub async fn by_hash(
+    hash: &str,
+    chain_store: Arc<ChainStore>,
+    ethereum_adapter: &EthereumAdapter,
+    logger: &Logger,
+) -> anyhow::Result<()> {
+    let block_hash = helpers::parse_block_hash(hash)?;
+    run(&block_hash, &chain_store, ethereum_adapter, logger).await
+}
+
+pub async fn by_number(
+    number: i32,
+    chain_store: Arc<ChainStore>,
+    ethereum_adapter: &EthereumAdapter,
+    logger: &Logger,
+) -> anyhow::Result<()> {
+    let block_hash = steps::resolve_block_hash_from_block_number(number, &chain_store)?;
+    run(&block_hash, &chain_store, ethereum_adapter, logger).await
+}
+
+pub async fn by_range(
+    chain_store: Arc<ChainStore>,
+    ethereum_adapter: &EthereumAdapter,
+    range_from: Option<i32>,
+    range_to: Option<i32>,
+    logger: &Logger,
+) -> anyhow::Result<()> {
+    // Resolve a range of block numbers into a collection of blocks hashes
+    let range = ranges::Range::new(range_from, range_to)?;
+    let max = match range.upper_bound {
+        // When we have an open upper bound, we use the chain head's block number
+        None => steps::find_chain_head(&chain_store)?,
+        Some(x) => x,
+    };
+    // FIXME: This performs poorly.
+    // TODO: This could be turned into async code
+    for block_number in range.lower_bound..=max {
+        println!("Fixing block [{block_number}/{max}]");
+        let block_hash = steps::resolve_block_hash_from_block_number(block_number, &chain_store)?;
+        run(&block_hash, &chain_store, ethereum_adapter, logger).await?
+    }
+    Ok(())
+}
+
+pub fn truncate(chain_store: Arc<ChainStore>, skip_confirmation: bool) -> anyhow::Result<()> {
+    if !skip_confirmation && !helpers::prompt_for_confirmation()? {
+        println!("Aborting.");
+        return Ok(());
+    }
+
+    chain_store
+        .truncate_block_cache()
+        .with_context(|| format!("Failed to truncate block cache for {}", chain_store.chain))
+}
+
+async fn run(
+    block_hash: &H256,
+    chain_store: &ChainStore,
+    ethereum_adapter: &EthereumAdapter,
+    logger: &Logger,
+) -> anyhow::Result<()> {
+    let cached_block = steps::fetch_single_cached_block(*block_hash, &chain_store)?;
+    let provider_block =
+        steps::fetch_single_provider_block(&block_hash, ethereum_adapter, logger).await?;
+    let diff = steps::diff_block_pair(&cached_block, &provider_block);
+    steps::report_difference(diff.as_deref(), &block_hash);
+    if diff.is_some() {
+        steps::delete_block(&block_hash, &chain_store)?;
+    }
+    Ok(())
+}
+
+mod steps {
+    use super::*;
+    use futures::compat::Future01CompatExt;
+    use graph::prelude::serde_json::{self, Value};
+    use json_structural_diff::{colorize as diff_to_string, JsonDiff};
+
+    /// Queries the [`ChainStore`] about the block hash for the given block number.
+    ///
+    /// Errors on a non-unary result.
+    pub(super) fn resolve_block_hash_from_block_number(
+        number: i32,
+        chain_store: &ChainStore,
+    ) -> anyhow::Result<H256> {
+        let block_hashes = chain_store.block_hashes_by_block_number(number)?;
+        let hash = helpers::get_single_item("block hash", block_hashes)
+            .with_context(|| format!("Failed to locate block number {} in store", number))?;
+        Ok(H256(hash.as_slice().try_into()?))
+    }
+
+    /// Queries the [`ChainStore`] for a cached block given a block hash.
+    ///
+    /// Errors on a non-unary result.
+    pub(super) fn fetch_single_cached_block(
+        block_hash: H256,
+        chain_store: &ChainStore,
+    ) -> anyhow::Result<Value> {
+        let blocks = chain_store.blocks(&[block_hash.into()])?;
+        if blocks.is_empty() {
+            bail!("Could not find a block with hash={block_hash:?} in cache")
+        }
+        helpers::get_single_item("block", blocks)
+            .with_context(|| format!("Failed to locate block {} in store.", block_hash))
+    }
+
+    /// Fetches a block from a JRPC endpoint.
+    ///
+    /// Errors on a non-unary result.
+    pub(super) async fn fetch_single_provider_block(
+        block_hash: &H256,
+        ethereum_adapter: &EthereumAdapter,
+        logger: &Logger,
+    ) -> anyhow::Result<Value> {
+        let provider_block = ethereum_adapter
+            .block_by_hash(&logger, *block_hash)
+            .compat()
+            .await
+            .with_context(|| format!("failed to fetch block {block_hash}"))?
+            .ok_or_else(|| anyhow!("JRPC provider found no block {block_hash}"))?;
+        ensure!(
+            provider_block.hash == Some(*block_hash),
+            "Provider responded with a different block hash"
+        );
+        serde_json::to_value(provider_block)
+            .context("failed to parse provider block as a JSON value")
+    }
+
+    /// Compares two [`serde_json::Value`] values.
+    ///
+    /// If they are different, returns a user-friendly string ready to be displayed.
+    pub(super) fn diff_block_pair(a: &Value, b: &Value) -> Option<String> {
+        if a == b {
+            None
+        } else {
+            match JsonDiff::diff(a, &b, false).diff {
+                // The diff could potentially be a `Value::Null`, which is equivalent to not being
+                // different at all.
+                None | Some(Value::Null) => None,
+                Some(diff) => {
+                    // Convert the JSON diff to a pretty-formatted text that will be displayed to
+                    // the user
+                    Some(diff_to_string(&diff, false))
+                }
+            }
+        }
+    }
+
+    /// Prints the difference between two [`serde_json::Value`] values to the user.
+    pub(super) fn report_difference(difference: Option<&str>, hash: &H256) {
+        if let Some(diff) = difference {
+            eprintln!("block {hash} diverges from cache:");
+            eprintln!("{diff}");
+        } else {
+            println!("Cached block is equal to the same block from provider.")
+        }
+    }
+
+    /// Attempts to delete a block from the block cache.
+    pub(super) fn delete_block(hash: &H256, chain_store: &ChainStore) -> anyhow::Result<()> {
+        println!("Deleting block {hash} from cache.");
+        chain_store.delete_blocks(&[&hash])?;
+        println!("Done.");
+        Ok(())
+    }
+
+    /// Queries the [`ChainStore`] about the chain head.
+    pub(super) fn find_chain_head(chain_store: &ChainStore) -> anyhow::Result<i32> {
+        let chain_head: Option<i32> = chain_store.chain_head_block(&chain_store.chain)?;
+        chain_head.ok_or_else(|| anyhow!("Could not find the chain head for {}", chain_store.chain))
+    }
+}
+
+mod helpers {
+    use super::*;
+    use graph::prelude::hex;
+    use std::io::{self, Write};
+
+    /// Tries to parse a [`H256`] from a hex string.
+    pub(super) fn parse_block_hash(hash: &str) -> anyhow::Result<H256> {
+        let hash = hash.trim_start_matches("0x");
+        let hash = hex::decode(hash)?;
+        Ok(H256::from_slice(&hash))
+    }
+
+    /// Asks users if they are certain about truncating the whole block cache.
+    pub(super) fn prompt_for_confirmation() -> anyhow::Result<bool> {
+        print!("This will delete all cached blocks.\nProceed? [y/N] ");
+        io::stdout().flush()?;
+
+        let mut answer = String::new();
+        io::stdin().read_line(&mut answer)?;
+        answer.make_ascii_lowercase();
+
+        match answer.trim() {
+            "y" | "yes" => Ok(true),
+            _ => Ok(false),
+        }
+    }
+
+    /// Convenience function for extracting values from unary sets.
+    pub(super) fn get_single_item<I, T>(name: &'static str, collection: I) -> anyhow::Result<T>
+    where
+        I: IntoIterator<Item = T>,
+    {
+        let mut iterator = collection.into_iter();
+        match (iterator.next(), iterator.next()) {
+            (Some(a), None) => Ok(a),
+            (None, None) => bail!("Expected a single {name} but found none."),
+            _ => bail!("Expected a single {name} but found multiple occurrences."),
+        }
+    }
+}
+
+/// Custom range type
+mod ranges {
+    use graph::prelude::anyhow::{self, bail};
+
+    pub(super) struct Range {
+        pub(super) lower_bound: i32,
+        pub(super) upper_bound: Option<i32>,
+    }
+
+    impl Range {
+        pub fn new(lower_bound: Option<i32>, upper_bound: Option<i32>) -> anyhow::Result<Self> {
+            let (lower_bound, upper_bound) = match (lower_bound, upper_bound) {
+                // Invalid cases:
+                (None, None) => {
+                    bail!(
+                        "This would wipe the whole cache. \
+                         Use `graphman chain truncate` instead"
+                    )
+                }
+                (Some(0), _) => bail!("Genesis block can't be removed"),
+                (Some(x), _) | (_, Some(x)) if x < 0 => {
+                    bail!("Negative block number used as range bound: {}", x)
+                }
+                (Some(lower), Some(upper)) if upper < lower => bail!(
+                    "Upper bound ({}) can't be smaller than lower bound ({})",
+                    upper,
+                    lower
+                ),
+
+                // Valid cases:
+                // Open lower bounds are set to the lowest possible block number
+                (None, upper @ Some(_)) => (1, upper),
+                (Some(lower), upper) => (lower, upper),
+            };
+
+            Ok(Self {
+                lower_bound,
+                upper_bound,
+            })
+        }
+    }
+}
diff --git a/node/src/manager/commands/config.rs b/node/src/manager/commands/config.rs
new file mode 100644
index 0000000..f33552b
--- /dev/null
+++ b/node/src/manager/commands/config.rs
@@ -0,0 +1,142 @@
+use std::{collections::BTreeMap, sync::Arc};
+
+use graph::{
+    anyhow::bail,
+    components::metrics::MetricsRegistry,
+    itertools::Itertools,
+    prelude::{
+        anyhow::{anyhow, Error},
+        NodeId,
+    },
+    slog::Logger,
+};
+use graph_chain_ethereum::{EthereumAdapterTrait, NodeCapabilities};
+use graph_store_postgres::DeploymentPlacer;
+
+use crate::config::Config;
+
+pub fn place(placer: &dyn DeploymentPlacer, name: &str, network: &str) -> Result<(), Error> {
+    match placer.place(name, network).map_err(|s| anyhow!(s))? {
+        None => {
+            println!(
+                "no matching placement rule; default placement from JSON RPC call would be used"
+            );
+        }
+        Some((shards, nodes)) => {
+            let nodes: Vec<_> = nodes.into_iter().map(|n| n.to_string()).collect();
+            let shards: Vec<_> = shards.into_iter().map(|s| s.to_string()).collect();
+            println!("subgraph: {}", name);
+            println!("network:  {}", network);
+            println!("shard:    {}", shards.join(", "));
+            println!("nodes:    {}", nodes.join(", "));
+        }
+    }
+    Ok(())
+}
+
+pub fn check(config: &Config, print: bool) -> Result<(), Error> {
+    match config.to_json() {
+        Ok(txt) => {
+            if print {
+                println!("{}", txt);
+            } else {
+                println!("Successfully validated configuration");
+            }
+            Ok(())
+        }
+        Err(e) => Err(anyhow!("error serializing config: {}", e)),
+    }
+}
+
+pub fn pools(config: &Config, nodes: Vec<String>, shard: bool) -> Result<(), Error> {
+    // Quietly replace `-` with `_` in node names to make passing in pod names
+    // from k8s less annoying
+    let nodes: Vec<_> = nodes
+        .into_iter()
+        .map(|name| {
+            NodeId::new(name.replace("-", "_"))
+                .map_err(|()| anyhow!("illegal node name `{}`", name))
+        })
+        .collect::<Result<_, _>>()?;
+    // node -> shard_name -> size
+    let mut sizes = BTreeMap::new();
+    for node in &nodes {
+        let mut shard_sizes = BTreeMap::new();
+        for (name, shard) in &config.stores {
+            let size = shard.pool_size.size_for(node, name)?;
+            shard_sizes.insert(name.to_string(), size);
+            for (replica_name, replica) in &shard.replicas {
+                let qname = format!("{}.{}", name, replica_name);
+                let size = replica.pool_size.size_for(node, &qname)?;
+                shard_sizes.insert(qname, size);
+            }
+        }
+        sizes.insert(node.to_string(), shard_sizes);
+    }
+
+    if shard {
+        let mut by_shard: BTreeMap<&str, u32> = BTreeMap::new();
+        for shard_sizes in sizes.values() {
+            for (shard_name, size) in shard_sizes {
+                *by_shard.entry(shard_name).or_default() += size;
+            }
+        }
+        for (shard_name, size) in by_shard {
+            println!("{}: {}", shard_name, size);
+        }
+    } else {
+        for node in &nodes {
+            let empty = BTreeMap::new();
+            println!("{}:", node);
+            let node_sizes = sizes.get(node.as_str()).unwrap_or(&empty);
+            for (shard, size) in node_sizes {
+                println!("    {}: {}", shard, size);
+            }
+        }
+    }
+    Ok(())
+}
+
+pub async fn provider(
+    logger: Logger,
+    config: &Config,
+    registry: Arc<dyn MetricsRegistry>,
+    features: String,
+    network: String,
+) -> Result<(), Error> {
+    // Like NodeCapabilities::from_str but with error checking for typos etc.
+    fn caps_from_features(features: String) -> Result<NodeCapabilities, Error> {
+        let mut caps = NodeCapabilities {
+            archive: false,
+            traces: false,
+        };
+        for feature in features.split(',') {
+            match feature {
+                "archive" => caps.archive = true,
+                "traces" => caps.traces = true,
+                _ => bail!("unknown feature {}", feature),
+            }
+        }
+        Ok(caps)
+    }
+
+    let caps = caps_from_features(features)?;
+    let networks =
+        crate::manager::commands::run::create_ethereum_networks(logger, registry, config, &network)
+            .await?;
+    let adapters = networks
+        .networks
+        .get(&network)
+        .ok_or_else(|| anyhow!("unknown network {}", network))?;
+    let adapters = adapters.all_cheapest_with(&caps);
+    println!(
+        "deploy on network {} with features [{}] on node {}\neligible providers: {}",
+        network,
+        caps,
+        config.node.as_str(),
+        adapters
+            .map(|adapter| adapter.provider().to_string())
+            .join(", ")
+    );
+    Ok(())
+}
diff --git a/node/src/manager/commands/copy.rs b/node/src/manager/commands/copy.rs
new file mode 100644
index 0000000..c832c57
--- /dev/null
+++ b/node/src/manager/commands/copy.rs
@@ -0,0 +1,346 @@
+use diesel::{ExpressionMethods, JoinOnDsl, OptionalExtension, QueryDsl, RunQueryDsl};
+use std::{collections::HashMap, sync::Arc, time::SystemTime};
+
+use graph::{
+    components::store::BlockStore as _,
+    data::query::QueryTarget,
+    prelude::{
+        anyhow::{anyhow, bail, Error},
+        chrono::{DateTime, Duration, SecondsFormat, Utc},
+        BlockPtr, ChainStore, DeploymentHash, NodeId, QueryStoreManager,
+    },
+};
+use graph_store_postgres::{
+    command_support::catalog::{self, copy_state, copy_table_state},
+    PRIMARY_SHARD,
+};
+use graph_store_postgres::{connection_pool::ConnectionPool, Shard, Store, SubgraphStore};
+
+use crate::manager::deployment::DeploymentSearch;
+use crate::manager::display::List;
+
+type UtcDateTime = DateTime<Utc>;
+
+#[derive(Queryable, QueryableByName, Debug)]
+#[table_name = "copy_state"]
+struct CopyState {
+    src: i32,
+    dst: i32,
+    #[allow(dead_code)]
+    target_block_hash: Vec<u8>,
+    target_block_number: i32,
+    started_at: UtcDateTime,
+    finished_at: Option<UtcDateTime>,
+    cancelled_at: Option<UtcDateTime>,
+}
+
+#[derive(Queryable, QueryableByName, Debug)]
+#[table_name = "copy_table_state"]
+struct CopyTableState {
+    #[allow(dead_code)]
+    id: i32,
+    entity_type: String,
+    #[allow(dead_code)]
+    dst: i32,
+    next_vid: i64,
+    target_vid: i64,
+    batch_size: i64,
+    #[allow(dead_code)]
+    started_at: UtcDateTime,
+    finished_at: Option<UtcDateTime>,
+    duration_ms: i64,
+}
+
+impl CopyState {
+    fn find(
+        pools: &HashMap<Shard, ConnectionPool>,
+        shard: &Shard,
+        dst: i32,
+    ) -> Result<Option<(CopyState, Vec<CopyTableState>)>, Error> {
+        use copy_state as cs;
+        use copy_table_state as cts;
+
+        let dpool = pools
+            .get(shard)
+            .ok_or_else(|| anyhow!("can not find pool for shard {}", shard))?;
+
+        let dconn = dpool.get()?;
+
+        let tables = cts::table
+            .filter(cts::dst.eq(dst))
+            .order_by(cts::entity_type)
+            .load::<CopyTableState>(&dconn)?;
+
+        Ok(cs::table
+            .filter(cs::dst.eq(dst))
+            .get_result::<CopyState>(&dconn)
+            .optional()?
+            .map(|state| (state, tables)))
+    }
+}
+
+pub async fn create(
+    store: Arc<Store>,
+    primary: ConnectionPool,
+    src: DeploymentSearch,
+    shard: String,
+    shards: Vec<String>,
+    node: String,
+    block_offset: u32,
+) -> Result<(), Error> {
+    let block_offset = block_offset as i32;
+    let subgraph_store = store.subgraph_store();
+    let src = src.locate_unique(&primary)?;
+    let query_store = store
+        .query_store(
+            QueryTarget::Deployment(src.hash.clone(), Default::default()),
+            true,
+        )
+        .await?;
+    let network = query_store.network_name();
+
+    let src_ptr = query_store.block_ptr().await?.ok_or_else(|| anyhow!("subgraph {} has not indexed any blocks yet and can not be used as the source of a copy", src))?;
+    let src_number = if src_ptr.number <= block_offset {
+        bail!("subgraph {} has only indexed up to block {}, but we need at least block {} before we can copy from it", src, src_ptr.number, block_offset);
+    } else {
+        src_ptr.number - block_offset
+    };
+
+    let chain_store = store
+        .block_store()
+        .chain_store(&network)
+        .ok_or_else(|| anyhow!("could not find chain store for network {}", network))?;
+    let mut hashes = chain_store.block_hashes_by_block_number(src_number)?;
+    let hash = match hashes.len() {
+        0 => bail!(
+            "could not find a block with number {} in our cache",
+            src_number
+        ),
+        1 => hashes.pop().unwrap(),
+        n => bail!(
+            "the cache contains {} hashes for block number {}",
+            n,
+            src_number
+        ),
+    };
+    let base_ptr = BlockPtr::new(hash, src_number);
+
+    if !shards.contains(&shard) {
+        bail!(
+            "unknown shard {shard}, only shards {} are configured",
+            shards.join(", ")
+        )
+    }
+    let shard = Shard::new(shard)?;
+    let node = NodeId::new(node.clone()).map_err(|()| anyhow!("invalid node id `{}`", node))?;
+
+    let dst = subgraph_store.copy_deployment(&src, shard, node, base_ptr)?;
+
+    println!("created deployment {} as copy of {}", dst, src);
+    Ok(())
+}
+
+pub fn activate(store: Arc<SubgraphStore>, deployment: String, shard: String) -> Result<(), Error> {
+    let shard = Shard::new(shard)?;
+    let deployment =
+        DeploymentHash::new(deployment).map_err(|s| anyhow!("illegal deployment hash `{}`", s))?;
+    let deployment = store
+        .locate_in_shard(&deployment, shard.clone())?
+        .ok_or_else(|| {
+            anyhow!(
+                "could not find a copy for {} in shard {}",
+                deployment,
+                shard
+            )
+        })?;
+    store.activate(&deployment)?;
+    println!("activated copy {}", deployment);
+    Ok(())
+}
+
+pub fn list(pools: HashMap<Shard, ConnectionPool>) -> Result<(), Error> {
+    use catalog::active_copies as ac;
+    use catalog::deployment_schemas as ds;
+
+    let primary = pools.get(&*PRIMARY_SHARD).expect("there is a primary pool");
+    let conn = primary.get()?;
+
+    let copies = ac::table
+        .inner_join(ds::table.on(ds::id.eq(ac::dst)))
+        .select((
+            ac::src,
+            ac::dst,
+            ac::cancelled_at,
+            ac::queued_at,
+            ds::subgraph,
+            ds::shard,
+        ))
+        .load::<(i32, i32, Option<UtcDateTime>, UtcDateTime, String, Shard)>(&conn)?;
+    if copies.is_empty() {
+        println!("no active copies");
+    } else {
+        fn status(name: &str, at: UtcDateTime) {
+            println!(
+                "{:20} | {}",
+                name,
+                at.to_rfc3339_opts(SecondsFormat::Secs, false)
+            );
+        }
+
+        for (src, dst, cancelled_at, queued_at, deployment_hash, shard) in copies {
+            println!("{:-<78}", "");
+
+            println!("{:20} | {}", "deployment", deployment_hash);
+            println!("{:20} | sgd{} -> sgd{} ({})", "action", src, dst, shard);
+            match CopyState::find(&pools, &shard, dst)? {
+                Some((state, tables)) => match cancelled_at {
+                    Some(cancel_requested) => match state.cancelled_at {
+                        Some(cancelled_at) => status("cancelled", cancelled_at),
+                        None => status("cancel requested", cancel_requested),
+                    },
+                    None => match state.finished_at {
+                        Some(finished_at) => status("finished", finished_at),
+                        None => {
+                            let target: i64 = tables.iter().map(|table| table.target_vid).sum();
+                            let next: i64 = tables.iter().map(|table| table.next_vid).sum();
+                            let done = next as f64 / target as f64 * 100.0;
+                            status("started", state.started_at);
+                            println!("{:20} | {:.2}% done, {}/{}", "progress", done, next, target)
+                        }
+                    },
+                },
+                None => status("queued", queued_at),
+            };
+        }
+    }
+    Ok(())
+}
+
+pub fn status(pools: HashMap<Shard, ConnectionPool>, dst: &DeploymentSearch) -> Result<(), Error> {
+    use catalog::active_copies as ac;
+    use catalog::deployment_schemas as ds;
+
+    fn done(ts: &Option<UtcDateTime>) -> String {
+        ts.map(|_| "✓").unwrap_or(".").to_string()
+    }
+
+    fn duration(start: &UtcDateTime, end: &Option<UtcDateTime>) -> String {
+        let start = *start;
+        let end = *end;
+
+        let end = end.unwrap_or(UtcDateTime::from(SystemTime::now()));
+        let duration = end - start;
+
+        human_duration(duration)
+    }
+
+    fn human_duration(duration: Duration) -> String {
+        if duration.num_seconds() < 5 {
+            format!("{}ms", duration.num_milliseconds())
+        } else if duration.num_minutes() < 5 {
+            format!("{}s", duration.num_seconds())
+        } else {
+            format!("{}m", duration.num_minutes())
+        }
+    }
+
+    let primary = pools
+        .get(&*PRIMARY_SHARD)
+        .ok_or_else(|| anyhow!("can not find deployment with id {}", dst))?;
+    let pconn = primary.get()?;
+    let dst = dst.locate_unique(&primary)?.id.0;
+
+    let (shard, deployment) = ds::table
+        .filter(ds::id.eq(dst as i32))
+        .select((ds::shard, ds::subgraph))
+        .get_result::<(Shard, String)>(&pconn)?;
+
+    let (active, cancelled_at) = ac::table
+        .filter(ac::dst.eq(dst))
+        .select((ac::src, ac::cancelled_at))
+        .get_result::<(i32, Option<UtcDateTime>)>(&pconn)
+        .optional()?
+        .map(|(_, cancelled_at)| (true, cancelled_at))
+        .unwrap_or((false, None));
+
+    let (state, tables) = match CopyState::find(&pools, &shard, dst)? {
+        Some((state, tables)) => (state, tables),
+        None => {
+            if active {
+                println!("copying is queued but has not started");
+                return Ok(());
+            } else {
+                bail!("no copy operation for {} exists", dst);
+            }
+        }
+    };
+
+    let progress = match &state.finished_at {
+        Some(_) => done(&state.finished_at),
+        None => {
+            let target: i64 = tables.iter().map(|table| table.target_vid).sum();
+            let next: i64 = tables.iter().map(|table| table.next_vid).sum();
+            let pct = next as f64 / target as f64 * 100.0;
+            format!("{:.2}% done, {}/{}", pct, next, target)
+        }
+    };
+
+    let mut lst = vec![
+        "deployment",
+        "src",
+        "dst",
+        "target block",
+        "duration",
+        "status",
+    ];
+    let mut vals = vec![
+        deployment,
+        state.src.to_string(),
+        state.dst.to_string(),
+        state.target_block_number.to_string(),
+        duration(&state.started_at, &state.finished_at),
+        progress,
+    ];
+    match (cancelled_at, state.cancelled_at) {
+        (Some(c), None) => {
+            lst.push("cancel");
+            vals.push(format!("requested at {}", c));
+        }
+        (_, Some(c)) => {
+            lst.push("cancel");
+            vals.push(format!("cancelled at {}", c));
+        }
+        (None, None) => {}
+    }
+    let mut lst = List::new(lst);
+    lst.append(vals);
+    lst.render();
+    println!("");
+
+    println!(
+        "{:^30} | {:^8} | {:^8} | {:^8} | {:^8}",
+        "entity type", "next", "target", "batch", "duration"
+    );
+    println!("{:-<74}", "-");
+    for table in tables {
+        let status = if table.next_vid > 0 && table.next_vid < table.target_vid {
+            ">".to_string()
+        } else if table.target_vid < 0 {
+            // empty source table
+            "✓".to_string()
+        } else {
+            done(&table.finished_at)
+        };
+        println!(
+            "{} {:<28} | {:>8} | {:>8} | {:>8} | {:>8}",
+            status,
+            table.entity_type,
+            table.next_vid,
+            table.target_vid,
+            table.batch_size,
+            human_duration(Duration::milliseconds(table.duration_ms)),
+        );
+    }
+
+    Ok(())
+}
diff --git a/node/src/manager/commands/create.rs b/node/src/manager/commands/create.rs
new file mode 100644
index 0000000..02e1184
--- /dev/null
+++ b/node/src/manager/commands/create.rs
@@ -0,0 +1,14 @@
+use std::sync::Arc;
+
+use graph::prelude::{anyhow, Error, SubgraphName, SubgraphStore as _};
+use graph_store_postgres::SubgraphStore;
+
+pub fn run(store: Arc<SubgraphStore>, name: String) -> Result<(), Error> {
+    let name = SubgraphName::new(name.clone())
+        .map_err(|()| anyhow!("illegal subgraph name `{}`", name))?;
+
+    println!("creating subgraph {}", name);
+    store.create_subgraph(name)?;
+
+    Ok(())
+}
diff --git a/node/src/manager/commands/index.rs b/node/src/manager/commands/index.rs
new file mode 100644
index 0000000..2ef9582
--- /dev/null
+++ b/node/src/manager/commands/index.rs
@@ -0,0 +1,70 @@
+use crate::manager::deployment::DeploymentSearch;
+use graph::prelude::{anyhow, StoreError};
+use graph_store_postgres::{connection_pool::ConnectionPool, SubgraphStore};
+use std::{collections::HashSet, sync::Arc};
+
+fn validate_fields<T: AsRef<str>>(fields: &[T]) -> Result<(), anyhow::Error> {
+    // Must be non-empty. Double checking, since [`StructOpt`] already checks this.
+    if fields.is_empty() {
+        anyhow::bail!("at least one field must be informed")
+    }
+    // All values must be unique
+    let unique: HashSet<_> = fields.iter().map(AsRef::as_ref).collect();
+    if fields.len() != unique.len() {
+        anyhow::bail!("entity fields must be unique")
+    }
+    Ok(())
+}
+pub async fn create(
+    store: Arc<SubgraphStore>,
+    pool: ConnectionPool,
+    search: DeploymentSearch,
+    entity_name: &str,
+    field_names: Vec<String>,
+    index_method: String,
+) -> Result<(), anyhow::Error> {
+    validate_fields(&field_names)?;
+    let deployment_locator = search.locate_unique(&pool)?;
+    println!("Index creation started. Please wait.");
+    match store
+        .create_manual_index(&deployment_locator, entity_name, field_names, index_method)
+        .await
+    {
+        Ok(()) => Ok(()),
+        Err(StoreError::Canceled) => {
+            eprintln!("Index creation attempt faield. Please retry.");
+            ::std::process::exit(1);
+        }
+        Err(other) => Err(anyhow::anyhow!(other)),
+    }
+}
+
+pub async fn list(
+    store: Arc<SubgraphStore>,
+    pool: ConnectionPool,
+    search: DeploymentSearch,
+    entity_name: &str,
+) -> Result<(), anyhow::Error> {
+    let deployment_locator = search.locate_unique(&pool)?;
+    let indexes: Vec<String> = store
+        .indexes_for_entity(&deployment_locator, entity_name)
+        .await?;
+    for index in &indexes {
+        println!("{index}")
+    }
+    Ok(())
+}
+
+pub async fn drop(
+    store: Arc<SubgraphStore>,
+    pool: ConnectionPool,
+    search: DeploymentSearch,
+    index_name: &str,
+) -> Result<(), anyhow::Error> {
+    let deployment_locator = search.locate_unique(&pool)?;
+    store
+        .drop_index_for_deployment(&deployment_locator, &index_name)
+        .await?;
+    println!("Dropped index {index_name}");
+    Ok(())
+}
diff --git a/node/src/manager/commands/info.rs b/node/src/manager/commands/info.rs
new file mode 100644
index 0000000..19994b6
--- /dev/null
+++ b/node/src/manager/commands/info.rs
@@ -0,0 +1,54 @@
+use std::sync::Arc;
+
+use graph::{components::store::StatusStore, data::subgraph::status, prelude::anyhow};
+use graph_store_postgres::{connection_pool::ConnectionPool, Store};
+
+use crate::manager::deployment::{Deployment, DeploymentSearch};
+
+fn find(
+    pool: ConnectionPool,
+    search: DeploymentSearch,
+    current: bool,
+    pending: bool,
+    used: bool,
+) -> Result<Vec<Deployment>, anyhow::Error> {
+    let current = current || used;
+    let pending = pending || used;
+
+    let deployments = search.lookup(&pool)?;
+    // Filter by status; if neither `current` or `pending` are set, list
+    // all deployments
+    let deployments: Vec<_> = deployments
+        .into_iter()
+        .filter(|deployment| match (current, pending) {
+            (true, false) => deployment.status == "current",
+            (false, true) => deployment.status == "pending",
+            (true, true) => deployment.status == "current" || deployment.status == "pending",
+            (false, false) => true,
+        })
+        .collect();
+    Ok(deployments)
+}
+
+pub fn run(
+    pool: ConnectionPool,
+    store: Option<Arc<Store>>,
+    search: DeploymentSearch,
+    current: bool,
+    pending: bool,
+    used: bool,
+) -> Result<(), anyhow::Error> {
+    let deployments = find(pool, search, current, pending, used)?;
+    let ids: Vec<_> = deployments.iter().map(|d| d.locator().id).collect();
+    let statuses = match store {
+        Some(store) => store.status(status::Filter::DeploymentIds(ids))?,
+        None => vec![],
+    };
+
+    if deployments.is_empty() {
+        println!("No matches");
+    } else {
+        Deployment::print_table(deployments, statuses);
+    }
+    Ok(())
+}
diff --git a/node/src/manager/commands/listen.rs b/node/src/manager/commands/listen.rs
new file mode 100644
index 0000000..3193a4a
--- /dev/null
+++ b/node/src/manager/commands/listen.rs
@@ -0,0 +1,71 @@
+use std::iter::FromIterator;
+use std::sync::Arc;
+use std::{collections::BTreeSet, io::Write};
+
+use futures::compat::Future01CompatExt;
+//use futures::future;
+use graph::{
+    components::store::{EntityType, SubscriptionManager as _},
+    prelude::{serde_json, Error, Stream, SubscriptionFilter},
+};
+use graph_store_postgres::connection_pool::ConnectionPool;
+use graph_store_postgres::SubscriptionManager;
+
+use crate::manager::deployment::DeploymentSearch;
+
+async fn listen(
+    mgr: Arc<SubscriptionManager>,
+    filter: BTreeSet<SubscriptionFilter>,
+) -> Result<(), Error> {
+    let events = mgr.subscribe(filter);
+    println!("press ctrl-c to stop");
+    let res = events
+        .inspect(move |event| {
+            serde_json::to_writer_pretty(std::io::stdout(), event)
+                .expect("event can be serialized to JSON");
+            writeln!(std::io::stdout(), "").unwrap();
+            std::io::stdout().flush().unwrap();
+        })
+        .collect()
+        .compat()
+        .await;
+
+    match res {
+        Ok(_) => {
+            println!("stream finished")
+        }
+        Err(()) => {
+            eprintln!("stream failed")
+        }
+    }
+    Ok(())
+}
+
+pub async fn assignments(mgr: Arc<SubscriptionManager>) -> Result<(), Error> {
+    println!("waiting for assignment events");
+    listen(
+        mgr,
+        FromIterator::from_iter([SubscriptionFilter::Assignment]),
+    )
+    .await?;
+
+    Ok(())
+}
+
+pub async fn entities(
+    primary_pool: ConnectionPool,
+    mgr: Arc<SubscriptionManager>,
+    search: &DeploymentSearch,
+    entity_types: Vec<String>,
+) -> Result<(), Error> {
+    let locator = search.locate_unique(&primary_pool)?;
+    let filter = entity_types
+        .into_iter()
+        .map(|et| SubscriptionFilter::Entities(locator.hash.clone(), EntityType::new(et)))
+        .collect();
+
+    println!("waiting for store events from {}", locator);
+    listen(mgr, filter).await?;
+
+    Ok(())
+}
diff --git a/node/src/manager/commands/mod.rs b/node/src/manager/commands/mod.rs
new file mode 100644
index 0000000..eab1f1a
--- /dev/null
+++ b/node/src/manager/commands/mod.rs
@@ -0,0 +1,17 @@
+pub mod assign;
+pub mod chain;
+pub mod check_blocks;
+pub mod config;
+pub mod copy;
+pub mod create;
+pub mod index;
+pub mod info;
+pub mod listen;
+pub mod prune;
+pub mod query;
+pub mod remove;
+pub mod rewind;
+pub mod run;
+pub mod stats;
+pub mod txn_speed;
+pub mod unused_deployments;
diff --git a/node/src/manager/commands/prune.rs b/node/src/manager/commands/prune.rs
new file mode 100644
index 0000000..e635df7
--- /dev/null
+++ b/node/src/manager/commands/prune.rs
@@ -0,0 +1,183 @@
+use std::{
+    collections::HashSet,
+    io::Write,
+    sync::Arc,
+    time::{Duration, Instant},
+};
+
+use graph::{
+    components::store::{PruneReporter, StatusStore},
+    data::subgraph::status,
+    prelude::{anyhow, BlockNumber},
+};
+use graph_chain_ethereum::ENV_VARS as ETH_ENV;
+use graph_store_postgres::{connection_pool::ConnectionPool, Store};
+
+use crate::manager::{
+    commands::stats::{abbreviate_table_name, show_stats},
+    deployment::DeploymentSearch,
+};
+
+struct Progress {
+    start: Instant,
+    analyze_start: Instant,
+    switch_start: Instant,
+    final_start: Instant,
+    final_table_start: Instant,
+    nonfinal_start: Instant,
+}
+
+impl Progress {
+    fn new() -> Self {
+        Self {
+            start: Instant::now(),
+            analyze_start: Instant::now(),
+            switch_start: Instant::now(),
+            final_start: Instant::now(),
+            final_table_start: Instant::now(),
+            nonfinal_start: Instant::now(),
+        }
+    }
+}
+
+fn print_copy_header() {
+    println!("{:^30} | {:^10} | {:^11}", "table", "versions", "time");
+    println!("{:-^30}-+-{:-^10}-+-{:-^11}", "", "", "");
+    std::io::stdout().flush().ok();
+}
+
+fn print_copy_row(table: &str, total_rows: usize, elapsed: Duration) {
+    print!(
+        "\r{:<30} | {:>10} | {:>9}s",
+        abbreviate_table_name(table, 30),
+        total_rows,
+        elapsed.as_secs()
+    );
+    std::io::stdout().flush().ok();
+}
+
+impl PruneReporter for Progress {
+    fn start_analyze(&mut self) {
+        print!("Analyze tables");
+        self.analyze_start = Instant::now();
+    }
+
+    fn start_analyze_table(&mut self, table: &str) {
+        print!("\rAnalyze {table:48} ");
+        std::io::stdout().flush().ok();
+    }
+
+    fn finish_analyze(&mut self, stats: &[graph::components::store::VersionStats]) {
+        println!(
+            "\rAnalyzed {} tables in {}s",
+            stats.len(),
+            self.analyze_start.elapsed().as_secs()
+        );
+        show_stats(stats, HashSet::new()).ok();
+        println!("");
+    }
+
+    fn copy_final_start(&mut self, earliest_block: BlockNumber, final_block: BlockNumber) {
+        println!("Copy final entities (versions live between {earliest_block} and {final_block})");
+        print_copy_header();
+
+        self.final_start = Instant::now();
+        self.final_table_start = self.final_start;
+    }
+
+    fn copy_final_batch(&mut self, table: &str, _rows: usize, total_rows: usize, finished: bool) {
+        print_copy_row(table, total_rows, self.final_table_start.elapsed());
+        if finished {
+            println!("");
+            self.final_table_start = Instant::now();
+        }
+        std::io::stdout().flush().ok();
+    }
+
+    fn copy_final_finish(&mut self) {
+        println!(
+            "Finished copying final entity versions in {}s\n",
+            self.final_start.elapsed().as_secs()
+        );
+    }
+
+    fn start_switch(&mut self) {
+        println!("Blocking writes and switching tables");
+        print_copy_header();
+        self.switch_start = Instant::now();
+    }
+
+    fn finish_switch(&mut self) {
+        println!(
+            "Enabling writes. Switching took {}s\n",
+            self.switch_start.elapsed().as_secs()
+        );
+    }
+
+    fn copy_nonfinal_start(&mut self, table: &str) {
+        print_copy_row(table, 0, Duration::from_secs(0));
+        self.nonfinal_start = Instant::now();
+    }
+
+    fn copy_nonfinal_finish(&mut self, table: &str, rows: usize) {
+        print_copy_row(table, rows, self.nonfinal_start.elapsed());
+        println!("");
+        std::io::stdout().flush().ok();
+    }
+
+    fn finish_prune(&mut self) {
+        println!("Finished pruning in {}s", self.start.elapsed().as_secs());
+    }
+}
+
+pub async fn run(
+    store: Arc<Store>,
+    primary_pool: ConnectionPool,
+    search: DeploymentSearch,
+    history: usize,
+    prune_ratio: f64,
+) -> Result<(), anyhow::Error> {
+    let history = history as BlockNumber;
+    let deployment = search.locate_unique(&primary_pool)?;
+    let mut info = store
+        .status(status::Filter::DeploymentIds(vec![deployment.id]))?
+        .pop()
+        .ok_or_else(|| anyhow!("deployment {deployment} not found"))?;
+    if info.chains.len() > 1 {
+        return Err(anyhow!(
+            "deployment {deployment} indexes {} chains, not sure how to deal with more than one chain",
+            info.chains.len()
+        ));
+    }
+    let status = info
+        .chains
+        .pop()
+        .ok_or_else(|| anyhow!("deployment {} does not index any chain", deployment))?;
+    let latest = status.latest_block.map(|ptr| ptr.number()).unwrap_or(0);
+    if latest <= history {
+        return Err(anyhow!("deployment {deployment} has only indexed up to block {latest} and we can't preserve {history} blocks of history"));
+    }
+
+    println!("prune {deployment}");
+    println!("    latest: {latest}");
+    println!("     final: {}", latest - ETH_ENV.reorg_threshold);
+    println!("  earliest: {}\n", latest - history);
+
+    let reporter = Box::new(Progress::new());
+    store
+        .subgraph_store()
+        .prune(
+            reporter,
+            &deployment,
+            latest - history,
+            // Using the setting for eth chains is a bit lazy; the value
+            // should really depend on the chain, but we don't have a
+            // convenient way to figure out how each chain deals with
+            // finality
+            ETH_ENV.reorg_threshold,
+            prune_ratio,
+        )
+        .await?;
+
+    Ok(())
+}
diff --git a/node/src/manager/commands/query.rs b/node/src/manager/commands/query.rs
new file mode 100644
index 0000000..a57ca14
--- /dev/null
+++ b/node/src/manager/commands/query.rs
@@ -0,0 +1,143 @@
+use std::fs::File;
+use std::io::Write;
+use std::iter::FromIterator;
+use std::time::Duration;
+use std::{collections::HashMap, sync::Arc};
+
+use graph::data::query::Trace;
+use graph::prelude::r;
+use graph::{
+    data::query::QueryTarget,
+    prelude::{
+        anyhow::{self, anyhow},
+        serde_json, DeploymentHash, GraphQlRunner as _, Query, QueryVariables, SubgraphName,
+    },
+};
+use graph_graphql::prelude::GraphQlRunner;
+use graph_store_postgres::Store;
+
+use crate::manager::PanicSubscriptionManager;
+
+pub async fn run(
+    runner: Arc<GraphQlRunner<Store, PanicSubscriptionManager>>,
+    target: String,
+    query: String,
+    vars: Vec<String>,
+    output: Option<String>,
+    trace: Option<String>,
+) -> Result<(), anyhow::Error> {
+    let target = if target.starts_with("Qm") {
+        let id =
+            DeploymentHash::new(target).map_err(|id| anyhow!("illegal deployment id `{}`", id))?;
+        QueryTarget::Deployment(id, Default::default())
+    } else {
+        let name = SubgraphName::new(target.clone())
+            .map_err(|()| anyhow!("illegal subgraph name `{}`", target))?;
+        QueryTarget::Name(name, Default::default())
+    };
+
+    let document = graphql_parser::parse_query(&query)?.into_static();
+    let vars: Vec<(String, r::Value)> = vars
+        .into_iter()
+        .map(|v| {
+            let mut pair = v.splitn(2, '=').map(|s| s.to_string());
+            let key = pair.next();
+            let value = pair
+                .next()
+                .map(|s| r::Value::String(s))
+                .unwrap_or(r::Value::Null);
+            match key {
+                Some(key) => Ok((key, value)),
+                None => Err(anyhow!(
+                    "malformed variable `{}`, it must be of the form `key=value`",
+                    v
+                )),
+            }
+        })
+        .collect::<Result<_, _>>()?;
+    let query = Query::new(
+        document,
+        Some(QueryVariables::new(HashMap::from_iter(vars))),
+    );
+
+    let res = runner.run_query(query, target).await;
+    if let Some(output) = output {
+        let mut f = File::create(output)?;
+        let json = serde_json::to_string(&res)?;
+        writeln!(f, "{}", json)?;
+    }
+
+    // The format of this file is pretty awful, but good enough to fish out
+    // interesting SQL queries
+    if let Some(trace) = trace {
+        let mut f = File::create(trace)?;
+        let json = serde_json::to_string(&res.traces())?;
+        writeln!(f, "{}", json)?;
+    }
+
+    for trace in res.traces() {
+        print_brief_trace("root", trace, 0)?;
+    }
+    Ok(())
+}
+
+fn print_brief_trace(name: &str, trace: &Trace, indent: usize) -> Result<(), anyhow::Error> {
+    use Trace::*;
+
+    fn query_time(trace: &Trace) -> Duration {
+        match trace {
+            None => Duration::from_millis(0),
+            Root { children, .. } => children.iter().map(|(_, trace)| query_time(trace)).sum(),
+            Query {
+                elapsed, children, ..
+            } => *elapsed + children.iter().map(|(_, trace)| query_time(trace)).sum(),
+        }
+    }
+
+    match trace {
+        None => { /* do nothing */ }
+        Root {
+            elapsed, children, ..
+        } => {
+            let elapsed = *elapsed.lock().unwrap();
+            let qt = query_time(trace);
+            let pt = elapsed - qt;
+
+            println!(
+                "{space:indent$}{name:rest$} {elapsed:7}ms",
+                space = " ",
+                indent = indent,
+                rest = 48 - indent,
+                name = name,
+                elapsed = elapsed.as_millis(),
+            );
+            for (name, trace) in children {
+                print_brief_trace(name, trace, indent + 2)?;
+            }
+            println!("\nquery:      {:7}ms", qt.as_millis());
+            println!("other:      {:7}ms", pt.as_millis());
+            println!("total:      {:7}ms", elapsed.as_millis())
+        }
+        Query {
+            elapsed,
+            entity_count,
+            children,
+            ..
+        } => {
+            println!(
+                "{space:indent$}{name:rest$} {elapsed:7}ms [{count:7} entities]",
+                space = " ",
+                indent = indent,
+                rest = 50 - indent,
+                name = name,
+                elapsed = elapsed.as_millis(),
+                count = entity_count
+            );
+            for (name, trace) in children {
+                print_brief_trace(name, trace, indent + 2)?;
+            }
+        }
+    }
+
+    Ok(())
+}
diff --git a/node/src/manager/commands/remove.rs b/node/src/manager/commands/remove.rs
new file mode 100644
index 0000000..36d0b61
--- /dev/null
+++ b/node/src/manager/commands/remove.rs
@@ -0,0 +1,14 @@
+use std::sync::Arc;
+
+use graph::prelude::{anyhow, Error, SubgraphName, SubgraphStore as _};
+use graph_store_postgres::SubgraphStore;
+
+pub fn run(store: Arc<SubgraphStore>, name: String) -> Result<(), Error> {
+    let name = SubgraphName::new(name.clone())
+        .map_err(|()| anyhow!("illegal subgraph name `{}`", name))?;
+
+    println!("Removing subgraph {}", name);
+    store.remove_subgraph(name)?;
+
+    Ok(())
+}
diff --git a/node/src/manager/commands/rewind.rs b/node/src/manager/commands/rewind.rs
new file mode 100644
index 0000000..393d778
--- /dev/null
+++ b/node/src/manager/commands/rewind.rs
@@ -0,0 +1,134 @@
+use std::sync::Arc;
+use std::thread;
+use std::time::Duration;
+use std::{collections::HashSet, convert::TryFrom};
+
+use graph::anyhow::bail;
+use graph::components::store::{BlockStore as _, ChainStore as _};
+use graph::prelude::{anyhow, BlockNumber, BlockPtr, NodeId, SubgraphStore};
+use graph_store_postgres::BlockStore;
+use graph_store_postgres::{connection_pool::ConnectionPool, Store};
+
+use crate::manager::deployment::{Deployment, DeploymentSearch};
+
+async fn block_ptr(
+    store: Arc<BlockStore>,
+    searches: &[DeploymentSearch],
+    deployments: &[Deployment],
+    hash: &str,
+    number: BlockNumber,
+    force: bool,
+) -> Result<BlockPtr, anyhow::Error> {
+    let block_ptr_to = BlockPtr::try_from((hash, number as i64))
+        .map_err(|e| anyhow!("error converting to block pointer: {}", e))?;
+
+    let chains = deployments.iter().map(|d| &d.chain).collect::<HashSet<_>>();
+    if chains.len() > 1 {
+        let names = searches
+            .into_iter()
+            .map(|s| s.to_string())
+            .collect::<Vec<_>>()
+            .join(", ");
+        bail!("the deployments matching `{names}` are on different chains");
+    }
+    let chain = chains.iter().next().unwrap();
+    let chain_store = match store.chain_store(chain) {
+        None => bail!("can not find chain store for {}", chain),
+        Some(store) => store,
+    };
+    if let Some((_, number, _)) = chain_store.block_number(&block_ptr_to.hash).await? {
+        if number != block_ptr_to.number {
+            bail!(
+                "the given hash is for block number {} but the command specified block number {}",
+                number,
+                block_ptr_to.number
+            );
+        }
+    } else {
+        if !force {
+            bail!(
+                "the chain {} does not have a block with hash {} \
+                   (run with --force to avoid this error)",
+                chain,
+                block_ptr_to.hash
+            );
+        }
+    }
+    Ok(block_ptr_to)
+}
+
+pub async fn run(
+    primary: ConnectionPool,
+    store: Arc<Store>,
+    searches: Vec<DeploymentSearch>,
+    block_hash: String,
+    block_number: BlockNumber,
+    force: bool,
+    sleep: Duration,
+) -> Result<(), anyhow::Error> {
+    const PAUSED: &str = "paused_";
+
+    let subgraph_store = store.subgraph_store();
+    let block_store = store.block_store();
+
+    let deployments = searches
+        .iter()
+        .map(|search| search.lookup(&primary))
+        .collect::<Result<Vec<_>, _>>()?
+        .into_iter()
+        .flatten()
+        .collect::<Vec<_>>();
+    if deployments.is_empty() {
+        println!("nothing to do");
+        return Ok(());
+    }
+
+    let block_ptr_to = block_ptr(
+        block_store,
+        &searches,
+        &deployments,
+        &block_hash,
+        block_number,
+        force,
+    )
+    .await?;
+
+    println!("Pausing deployments");
+    let mut paused = false;
+    for deployment in &deployments {
+        if let Some(node) = &deployment.node_id {
+            if !node.starts_with(PAUSED) {
+                let loc = deployment.locator();
+                let node =
+                    NodeId::new(format!("{}{}", PAUSED, node)).expect("paused_ node id is valid");
+                subgraph_store.reassign_subgraph(&loc, &node)?;
+                println!("  ... paused {}", loc);
+                paused = true;
+            }
+        }
+    }
+
+    if paused {
+        // There's no good way to tell that a subgraph has in fact stopped
+        // indexing. We sleep and hope for the best.
+        println!("\nWaiting 10s to make sure pausing was processed");
+        thread::sleep(sleep);
+    }
+
+    println!("\nRewinding deployments");
+    for deployment in &deployments {
+        let loc = deployment.locator();
+        subgraph_store.rewind(loc.hash.clone(), block_ptr_to.clone())?;
+        println!("  ... rewound {}", loc);
+    }
+
+    println!("Resuming deployments");
+    for deployment in &deployments {
+        if let Some(node) = &deployment.node_id {
+            let loc = deployment.locator();
+            let node = NodeId::new(node.clone()).expect("node id is valid");
+            subgraph_store.reassign_subgraph(&loc, &node)?;
+        }
+    }
+    Ok(())
+}
diff --git a/node/src/manager/commands/run.rs b/node/src/manager/commands/run.rs
new file mode 100644
index 0000000..df0db21
--- /dev/null
+++ b/node/src/manager/commands/run.rs
@@ -0,0 +1,489 @@
+use std::collections::HashMap;
+use std::sync::Arc;
+use std::time::Duration;
+
+use crate::chain::create_firehose_networks;
+use crate::config::{Config, ProviderDetails};
+use crate::manager::PanicSubscriptionManager;
+use crate::store_builder::StoreBuilder;
+use crate::MetricsContext;
+use ethereum::chain::{EthereumAdapterSelector, EthereumStreamBuilder};
+use ethereum::{EthereumNetworks, ProviderEthRpcMetrics, RuntimeAdapter as EthereumRuntimeAdapter};
+use futures::future::join_all;
+use futures::TryFutureExt;
+use graph::anyhow::{bail, format_err, Error};
+use graph::blockchain::{BlockchainKind, BlockchainMap, ChainIdentifier};
+use graph::cheap_clone::CheapClone;
+use graph::components::store::{BlockStore as _, DeploymentLocator};
+use graph::env::EnvVars;
+use graph::firehose::FirehoseEndpoints;
+use graph::ipfs_client::IpfsClient;
+use graph::prelude::{
+    anyhow, tokio, BlockNumber, DeploymentHash, LoggerFactory,
+    MetricsRegistry as MetricsRegistryTrait, NodeId, SubgraphAssignmentProvider, SubgraphName,
+    SubgraphRegistrar, SubgraphStore, SubgraphVersionSwitchingMode, ENV_VARS,
+};
+use graph::slog::{debug, error, info, o, Logger};
+use graph::util::security::SafeDisplay;
+use graph_chain_ethereum::{self as ethereum, EthereumAdapterTrait, Transport};
+use graph_core::polling_monitor::ipfs_service::IpfsService;
+use graph_core::{
+    LinkResolver, SubgraphAssignmentProvider as IpfsSubgraphAssignmentProvider,
+    SubgraphInstanceManager, SubgraphRegistrar as IpfsSubgraphRegistrar,
+};
+use url::Url;
+
+fn locate(store: &dyn SubgraphStore, hash: &str) -> Result<DeploymentLocator, anyhow::Error> {
+    let mut locators = store.locators(&hash)?;
+    match locators.len() {
+        0 => bail!("could not find subgraph {hash} we just created"),
+        1 => Ok(locators.pop().unwrap()),
+        n => bail!("there are {n} subgraphs with hash {hash}"),
+    }
+}
+
+pub async fn run(
+    logger: Logger,
+    store_builder: StoreBuilder,
+    network_name: String,
+    ipfs_url: Vec<String>,
+    config: Config,
+    metrics_ctx: MetricsContext,
+    node_id: NodeId,
+    subgraph: String,
+    stop_block: BlockNumber,
+) -> Result<(), anyhow::Error> {
+    println!(
+        "Run command: starting subgraph => {}, stop_block = {}",
+        subgraph, stop_block
+    );
+
+    let metrics_registry = metrics_ctx.registry.clone();
+    let logger_factory = LoggerFactory::new(logger.clone(), None);
+
+    // FIXME: Hard-coded IPFS config, take it from config file instead?
+    let ipfs_clients: Vec<_> = create_ipfs_clients(&logger, &ipfs_url);
+    let ipfs_client = ipfs_clients.first().cloned().expect("Missing IPFS client");
+    let ipfs_service = IpfsService::new(
+        ipfs_client,
+        ENV_VARS.mappings.max_ipfs_file_bytes as u64,
+        ENV_VARS.mappings.ipfs_timeout,
+        ENV_VARS.mappings.max_ipfs_concurrent_requests,
+    );
+
+    // Convert the clients into a link resolver. Since we want to get past
+    // possible temporary DNS failures, make the resolver retry
+    let link_resolver = Arc::new(LinkResolver::new(
+        ipfs_clients,
+        Arc::new(EnvVars::default()),
+    ));
+
+    let eth_networks = create_ethereum_networks(
+        logger.clone(),
+        metrics_registry.clone(),
+        &config,
+        &network_name,
+    )
+    .await
+    .expect("Failed to parse Ethereum networks");
+    let firehose_networks_by_kind = create_firehose_networks(logger.clone(), &config);
+    let firehose_networks = firehose_networks_by_kind.get(&BlockchainKind::Ethereum);
+    let firehose_endpoints = firehose_networks
+        .and_then(|v| v.networks.get(&network_name))
+        .map_or_else(|| FirehoseEndpoints::new(), |v| v.clone());
+
+    let eth_adapters = match eth_networks.networks.get(&network_name) {
+        Some(adapters) => adapters.clone(),
+        None => {
+            return Err(format_err!(
+                "No ethereum adapters found, but required in this state of graphman run command"
+            ))
+        }
+    };
+
+    let eth_adapters2 = eth_adapters.clone();
+
+    let (_, ethereum_idents) = connect_ethereum_networks(&logger, eth_networks).await;
+    // let (near_networks, near_idents) = connect_firehose_networks::<NearFirehoseHeaderOnlyBlock>(
+    //     &logger,
+    //     firehose_networks_by_kind
+    //         .remove(&BlockchainKind::Near)
+    //         .unwrap_or_else(|| FirehoseNetworks::new()),
+    // )
+    // .await;
+
+    let chain_head_update_listener = store_builder.chain_head_update_listener();
+    let network_identifiers = ethereum_idents.into_iter().collect();
+    let network_store = store_builder.network_store(network_identifiers);
+
+    let subgraph_store = network_store.subgraph_store();
+    let chain_store = network_store
+        .block_store()
+        .chain_store(network_name.as_ref())
+        .expect(format!("No chain store for {}", &network_name).as_ref());
+
+    let chain = ethereum::Chain::new(
+        logger_factory.clone(),
+        network_name.clone(),
+        node_id.clone(),
+        metrics_registry.clone(),
+        chain_store.cheap_clone(),
+        chain_store.cheap_clone(),
+        firehose_endpoints.clone(),
+        eth_adapters.clone(),
+        chain_head_update_listener,
+        Arc::new(EthereumStreamBuilder {}),
+        Arc::new(EthereumAdapterSelector::new(
+            logger_factory.clone(),
+            Arc::new(eth_adapters),
+            Arc::new(firehose_endpoints.clone()),
+            metrics_registry.clone(),
+            chain_store.cheap_clone(),
+        )),
+        Arc::new(EthereumRuntimeAdapter {
+            call_cache: chain_store.cheap_clone(),
+            eth_adapters: Arc::new(eth_adapters2),
+        }),
+        ethereum::ENV_VARS.reorg_threshold,
+        // We assume the tested chain is always ingestible for now
+        true,
+    );
+
+    let mut blockchain_map = BlockchainMap::new();
+    blockchain_map.insert(network_name.clone(), Arc::new(chain));
+
+    let static_filters = ENV_VARS.experimental_static_filters;
+
+    let blockchain_map = Arc::new(blockchain_map);
+    let subgraph_instance_manager = SubgraphInstanceManager::new(
+        &logger_factory,
+        subgraph_store.clone(),
+        blockchain_map.clone(),
+        metrics_registry.clone(),
+        link_resolver.cheap_clone(),
+        ipfs_service,
+        static_filters,
+    );
+
+    // Create IPFS-based subgraph provider
+    let subgraph_provider = Arc::new(IpfsSubgraphAssignmentProvider::new(
+        &logger_factory,
+        link_resolver.cheap_clone(),
+        subgraph_instance_manager,
+    ));
+
+    let panicking_subscription_manager = Arc::new(PanicSubscriptionManager {});
+
+    let subgraph_registrar = Arc::new(IpfsSubgraphRegistrar::new(
+        &logger_factory,
+        link_resolver.cheap_clone(),
+        subgraph_provider.clone(),
+        subgraph_store.clone(),
+        panicking_subscription_manager,
+        blockchain_map,
+        node_id.clone(),
+        SubgraphVersionSwitchingMode::Instant,
+    ));
+
+    let (name, hash) = if subgraph.contains(':') {
+        let mut split = subgraph.split(':');
+        (split.next().unwrap(), split.next().unwrap().to_owned())
+    } else {
+        ("cli", subgraph)
+    };
+
+    let subgraph_name = SubgraphName::new(name)
+        .expect("Subgraph name must contain only a-z, A-Z, 0-9, '-' and '_'");
+    let subgraph_hash =
+        DeploymentHash::new(hash.clone()).expect("Subgraph hash must be a valid IPFS hash");
+
+    info!(&logger, "Creating subgraph {}", name);
+    let create_result =
+        SubgraphRegistrar::create_subgraph(subgraph_registrar.as_ref(), subgraph_name.clone())
+            .await?;
+
+    info!(
+        &logger,
+        "Looking up subgraph deployment {} (Deployment hash => {}, id => {})",
+        name,
+        subgraph_hash,
+        create_result.id,
+    );
+
+    SubgraphRegistrar::create_subgraph_version(
+        subgraph_registrar.as_ref(),
+        subgraph_name.clone(),
+        subgraph_hash.clone(),
+        node_id.clone(),
+        None,
+        None,
+        None,
+    )
+    .await?;
+
+    let locator = locate(subgraph_store.as_ref(), &hash)?;
+
+    SubgraphAssignmentProvider::start(subgraph_provider.as_ref(), locator, Some(stop_block))
+        .await?;
+
+    loop {
+        tokio::time::sleep(Duration::from_millis(1000)).await;
+
+        let block_ptr = subgraph_store
+            .least_block_ptr(&subgraph_hash)
+            .await
+            .unwrap()
+            .unwrap();
+
+        debug!(&logger, "subgraph block: {:?}", block_ptr);
+
+        if block_ptr.number >= stop_block {
+            info!(
+                &logger,
+                "subgraph now at block {}, reached stop block {}", block_ptr.number, stop_block
+            );
+            break;
+        }
+    }
+
+    info!(&logger, "Removing subgraph {}", name);
+    subgraph_store.clone().remove_subgraph(subgraph_name)?;
+
+    if let Some(host) = metrics_ctx.prometheus_host {
+        let mfs = metrics_ctx.prometheus.gather();
+        let job_name = match metrics_ctx.job_name {
+            Some(name) => name,
+            None => "graphman run".into(),
+        };
+
+        tokio::task::spawn_blocking(move || {
+            prometheus::push_metrics(&job_name, HashMap::new(), &host, mfs, None)
+        })
+        .await??;
+    }
+
+    Ok(())
+}
+
+// Stuff copied directly moslty from `main.rs`
+//
+// FIXME: Share that with `main.rs` stuff
+
+// The status of a provider that we learned from connecting to it
+#[derive(PartialEq)]
+enum ProviderNetworkStatus {
+    Broken {
+        network: String,
+        provider: String,
+    },
+    Version {
+        network: String,
+        ident: ChainIdentifier,
+    },
+}
+
+/// How long we will hold up node startup to get the net version and genesis
+/// hash from the client. If we can't get it within that time, we'll try and
+/// continue regardless.
+const NET_VERSION_WAIT_TIME: Duration = Duration::from_secs(30);
+
+fn create_ipfs_clients(logger: &Logger, ipfs_addresses: &Vec<String>) -> Vec<IpfsClient> {
+    // Parse the IPFS URL from the `--ipfs` command line argument
+    let ipfs_addresses: Vec<_> = ipfs_addresses
+        .iter()
+        .map(|uri| {
+            if uri.starts_with("http://") || uri.starts_with("https://") {
+                String::from(uri)
+            } else {
+                format!("http://{}", uri)
+            }
+        })
+        .collect();
+
+    ipfs_addresses
+        .into_iter()
+        .map(|ipfs_address| {
+            info!(
+                logger,
+                "Trying IPFS node at: {}",
+                SafeDisplay(&ipfs_address)
+            );
+
+            let ipfs_client = match IpfsClient::new(&ipfs_address) {
+                Ok(ipfs_client) => ipfs_client,
+                Err(e) => {
+                    error!(
+                        logger,
+                        "Failed to create IPFS client for `{}`: {}",
+                        SafeDisplay(&ipfs_address),
+                        e
+                    );
+                    panic!("Could not connect to IPFS");
+                }
+            };
+
+            // Test the IPFS client by getting the version from the IPFS daemon
+            let ipfs_test = ipfs_client.cheap_clone();
+            let ipfs_ok_logger = logger.clone();
+            let ipfs_err_logger = logger.clone();
+            let ipfs_address_for_ok = ipfs_address.clone();
+            let ipfs_address_for_err = ipfs_address.clone();
+            graph::spawn(async move {
+                ipfs_test
+                    .test()
+                    .map_err(move |e| {
+                        error!(
+                            ipfs_err_logger,
+                            "Is there an IPFS node running at \"{}\"?",
+                            SafeDisplay(ipfs_address_for_err),
+                        );
+                        panic!("Failed to connect to IPFS: {}", e);
+                    })
+                    .map_ok(move |_| {
+                        info!(
+                            ipfs_ok_logger,
+                            "Successfully connected to IPFS node at: {}",
+                            SafeDisplay(ipfs_address_for_ok)
+                        );
+                    })
+                    .await
+            });
+
+            ipfs_client
+        })
+        .collect()
+}
+
+/// Parses an Ethereum connection string and returns the network name and Ethereum adapter.
+pub async fn create_ethereum_networks(
+    logger: Logger,
+    registry: Arc<dyn MetricsRegistryTrait>,
+    config: &Config,
+    network_name: &str,
+) -> Result<EthereumNetworks, anyhow::Error> {
+    let eth_rpc_metrics = Arc::new(ProviderEthRpcMetrics::new(registry));
+    let mut parsed_networks = EthereumNetworks::new();
+    let chain = config
+        .chains
+        .chains
+        .get(network_name)
+        .ok_or_else(|| anyhow!("unknown network {}", network_name))?;
+    if chain.protocol == BlockchainKind::Ethereum {
+        for provider in &chain.providers {
+            if let ProviderDetails::Web3(web3) = &provider.details {
+                let capabilities = web3.node_capabilities();
+
+                let logger = logger.new(o!("provider" => provider.label.clone()));
+                info!(
+                    logger,
+                    "Creating transport";
+                    "url" => &web3.url,
+                    "capabilities" => capabilities
+                );
+
+                use crate::config::Transport::*;
+
+                let transport = match web3.transport {
+                    Rpc => Transport::new_rpc(Url::parse(&web3.url)?, web3.headers.clone()),
+                    Ipc => Transport::new_ipc(&web3.url).await,
+                    Ws => Transport::new_ws(&web3.url).await,
+                };
+
+                let supports_eip_1898 = !web3.features.contains("no_eip1898");
+
+                parsed_networks.insert(
+                    network_name.to_string(),
+                    capabilities,
+                    Arc::new(
+                        graph_chain_ethereum::EthereumAdapter::new(
+                            logger,
+                            provider.label.clone(),
+                            &web3.url,
+                            transport,
+                            eth_rpc_metrics.clone(),
+                            supports_eip_1898,
+                        )
+                        .await,
+                    ),
+                    web3.limit_for(&config.node),
+                );
+            }
+        }
+    }
+    parsed_networks.sort();
+    Ok(parsed_networks)
+}
+
+/// Try to connect to all the providers in `eth_networks` and get their net
+/// version and genesis block. Return the same `eth_networks` and the
+/// retrieved net identifiers grouped by network name. Remove all providers
+/// for which trying to connect resulted in an error from the returned
+/// `EthereumNetworks`, since it's likely pointless to try and connect to
+/// them. If the connection attempt to a provider times out after
+/// `NET_VERSION_WAIT_TIME`, keep the provider, but don't report a
+/// version for it.
+async fn connect_ethereum_networks(
+    logger: &Logger,
+    mut eth_networks: EthereumNetworks,
+) -> (EthereumNetworks, Vec<(String, Vec<ChainIdentifier>)>) {
+    // This has one entry for each provider, and therefore multiple entries
+    // for each network
+    let statuses = join_all(
+        eth_networks
+            .flatten()
+            .into_iter()
+            .map(|(network_name, capabilities, eth_adapter)| {
+                (network_name, capabilities, eth_adapter, logger.clone())
+            })
+            .map(|(network, capabilities, eth_adapter, logger)| async move {
+                let logger = logger.new(o!("provider" => eth_adapter.provider().to_string()));
+                info!(
+                    logger, "Connecting to Ethereum to get network identifier";
+                    "capabilities" => &capabilities
+                );
+                match tokio::time::timeout(NET_VERSION_WAIT_TIME, eth_adapter.net_identifiers())
+                    .await
+                    .map_err(Error::from)
+                {
+                    // An `Err` means a timeout, an `Ok(Err)` means some other error (maybe a typo
+                    // on the URL)
+                    Ok(Err(e)) | Err(e) => {
+                        error!(logger, "Connection to provider failed. Not using this provider";
+                                       "error" =>  e.to_string());
+                        ProviderNetworkStatus::Broken {
+                            network,
+                            provider: eth_adapter.provider().to_string(),
+                        }
+                    }
+                    Ok(Ok(ident)) => {
+                        info!(
+                            logger,
+                            "Connected to Ethereum";
+                            "network_version" => &ident.net_version,
+                            "capabilities" => &capabilities
+                        );
+                        ProviderNetworkStatus::Version { network, ident }
+                    }
+                }
+            }),
+    )
+    .await;
+
+    // Group identifiers by network name
+    let idents: HashMap<String, Vec<ChainIdentifier>> =
+        statuses
+            .into_iter()
+            .fold(HashMap::new(), |mut networks, status| {
+                match status {
+                    ProviderNetworkStatus::Broken { network, provider } => {
+                        eth_networks.remove(&network, &provider)
+                    }
+                    ProviderNetworkStatus::Version { network, ident } => {
+                        networks.entry(network.to_string()).or_default().push(ident)
+                    }
+                }
+                networks
+            });
+    let idents: Vec<_> = idents.into_iter().collect();
+    (eth_networks, idents)
+}
diff --git a/node/src/manager/commands/stats.rs b/node/src/manager/commands/stats.rs
new file mode 100644
index 0000000..ca07cb1
--- /dev/null
+++ b/node/src/manager/commands/stats.rs
@@ -0,0 +1,126 @@
+use std::collections::HashMap;
+use std::collections::HashSet;
+use std::sync::Arc;
+
+use crate::manager::deployment::DeploymentSearch;
+use diesel::r2d2::ConnectionManager;
+use diesel::r2d2::PooledConnection;
+use diesel::PgConnection;
+use graph::components::store::VersionStats;
+use graph::prelude::anyhow;
+use graph_store_postgres::command_support::catalog as store_catalog;
+use graph_store_postgres::command_support::catalog::Site;
+use graph_store_postgres::connection_pool::ConnectionPool;
+use graph_store_postgres::Shard;
+use graph_store_postgres::SubgraphStore;
+use graph_store_postgres::PRIMARY_SHARD;
+
+fn site_and_conn(
+    pools: HashMap<Shard, ConnectionPool>,
+    search: &DeploymentSearch,
+) -> Result<(Site, PooledConnection<ConnectionManager<PgConnection>>), anyhow::Error> {
+    let primary_pool = pools.get(&*PRIMARY_SHARD).unwrap();
+    let locator = search.locate_unique(primary_pool)?;
+
+    let conn = primary_pool.get()?;
+    let conn = store_catalog::Connection::new(conn);
+
+    let site = conn
+        .locate_site(locator)?
+        .ok_or_else(|| anyhow!("deployment `{}` does not exist", search))?;
+
+    let conn = pools.get(&site.shard).unwrap().get()?;
+
+    Ok((site, conn))
+}
+
+pub async fn account_like(
+    store: Arc<SubgraphStore>,
+    primary_pool: ConnectionPool,
+    clear: bool,
+    search: &DeploymentSearch,
+    table: String,
+) -> Result<(), anyhow::Error> {
+    let locator = search.locate_unique(&primary_pool)?;
+
+    store.set_account_like(&locator, &table, !clear).await?;
+    let clear_text = if clear { "cleared" } else { "set" };
+    println!("{}: account-like flag {}", table, clear_text);
+
+    Ok(())
+}
+
+pub fn abbreviate_table_name(table: &str, size: usize) -> String {
+    if table.len() > size {
+        let fragment = size / 2 - 2;
+        let last = table.len() - fragment;
+        let mut table = table.to_string();
+        table.replace_range(fragment..last, "..");
+        let table = table.trim().to_string();
+        table
+    } else {
+        table.to_string()
+    }
+}
+
+pub fn show_stats(
+    stats: &[VersionStats],
+    account_like: HashSet<String>,
+) -> Result<(), anyhow::Error> {
+    fn header() {
+        println!(
+            "{:^30} | {:^10} | {:^10} | {:^7}",
+            "table", "entities", "versions", "ratio"
+        );
+        println!("{:-^30}-+-{:-^10}-+-{:-^10}-+-{:-^7}", "", "", "", "");
+    }
+
+    fn footer() {
+        println!("  (a): account-like flag set");
+    }
+
+    fn print_stats(s: &VersionStats, account_like: bool) {
+        println!(
+            "{:<26} {:3} | {:>10} | {:>10} | {:>5.1}%",
+            abbreviate_table_name(&s.tablename, 26),
+            if account_like { "(a)" } else { "   " },
+            s.entities,
+            s.versions,
+            s.ratio * 100.0
+        );
+    }
+
+    header();
+    for s in stats {
+        print_stats(s, account_like.contains(&s.tablename));
+    }
+    if !account_like.is_empty() {
+        footer();
+    }
+
+    Ok(())
+}
+
+pub fn show(
+    pools: HashMap<Shard, ConnectionPool>,
+    search: &DeploymentSearch,
+) -> Result<(), anyhow::Error> {
+    let (site, conn) = site_and_conn(pools, search)?;
+
+    let stats = store_catalog::stats(&conn, &site.namespace)?;
+
+    let account_like = store_catalog::account_like(&conn, &site)?;
+
+    show_stats(stats.as_slice(), account_like)
+}
+
+pub fn analyze(
+    store: Arc<SubgraphStore>,
+    pool: ConnectionPool,
+    search: DeploymentSearch,
+    entity_name: &str,
+) -> Result<(), anyhow::Error> {
+    let locator = search.locate_unique(&pool)?;
+    println!("Analyzing table sgd{}.{entity_name}", locator.id);
+    store.analyze(&locator, entity_name).map_err(|e| anyhow!(e))
+}
diff --git a/node/src/manager/commands/txn_speed.rs b/node/src/manager/commands/txn_speed.rs
new file mode 100644
index 0000000..795483b
--- /dev/null
+++ b/node/src/manager/commands/txn_speed.rs
@@ -0,0 +1,58 @@
+use diesel::PgConnection;
+use std::{collections::HashMap, thread::sleep, time::Duration};
+
+use graph::prelude::anyhow;
+use graph_store_postgres::connection_pool::ConnectionPool;
+
+use crate::manager::catalog;
+
+pub fn run(pool: ConnectionPool, delay: u64) -> Result<(), anyhow::Error> {
+    fn query(conn: &PgConnection) -> Result<Vec<(String, i64, i64)>, anyhow::Error> {
+        use catalog::pg_catalog::pg_stat_database as d;
+        use diesel::dsl::*;
+        use diesel::sql_types::BigInt;
+        use diesel::{ExpressionMethods, QueryDsl, RunQueryDsl};
+
+        let rows = d::table
+            .filter(d::datname.eq(any(vec!["explorer", "graph"])))
+            .select((
+                d::datname,
+                sql::<BigInt>("(xact_commit + xact_rollback)::bigint"),
+                sql::<BigInt>("txid_current()::bigint"),
+            ))
+            //.select((d::datname))
+            .load::<(Option<String>, i64, i64)>(conn)?;
+        Ok(rows
+            .into_iter()
+            .map(|(datname, all_txn, write_txn)| {
+                (datname.unwrap_or("none".to_string()), all_txn, write_txn)
+            })
+            .collect())
+    }
+
+    let mut speeds = HashMap::new();
+    let conn = pool.get()?;
+    for (datname, all_txn, write_txn) in query(&conn)? {
+        speeds.insert(datname, (all_txn, write_txn));
+    }
+    println!(
+        "Looking for number of transactions performed in {}s ...",
+        delay
+    );
+    sleep(Duration::from_secs(delay));
+    println!("Number of transactions/minute");
+    println!("{:10} {:>7} {}", "database", "all", "write");
+    for (datname, all_txn, write_txn) in query(&conn)? {
+        let (all_speed, write_speed) = speeds
+            .get(&datname)
+            .map(|(all_txn_old, write_txn_old)| {
+                (all_txn - *all_txn_old, write_txn - *write_txn_old)
+            })
+            .unwrap_or((0, 0));
+        let all_speed = all_speed as f64 * 60.0 / delay as f64;
+        let write_speed = write_speed as f64 * 60.0 / delay as f64;
+        println!("{:10} {:>7} {}", datname, all_speed, write_speed);
+    }
+
+    Ok(())
+}
diff --git a/node/src/manager/commands/unused_deployments.rs b/node/src/manager/commands/unused_deployments.rs
new file mode 100644
index 0000000..632b205
--- /dev/null
+++ b/node/src/manager/commands/unused_deployments.rs
@@ -0,0 +1,139 @@
+use std::{sync::Arc, time::Instant};
+
+use graph::prelude::{anyhow::Error, chrono};
+use graph_store_postgres::{unused, SubgraphStore, UnusedDeployment};
+
+use crate::manager::display::List;
+
+fn make_list() -> List {
+    List::new(vec!["id", "shard", "namespace", "subgraphs", "entities"])
+}
+
+fn add_row(list: &mut List, deployment: UnusedDeployment) {
+    let UnusedDeployment {
+        id,
+        shard,
+        namespace,
+        subgraphs,
+        entity_count,
+        ..
+    } = deployment;
+    let subgraphs = subgraphs.unwrap_or(vec![]).join(", ");
+
+    list.append(vec![
+        id.to_string(),
+        shard,
+        namespace,
+        subgraphs,
+        entity_count.to_string(),
+    ])
+}
+
+pub fn list(store: Arc<SubgraphStore>, existing: bool) -> Result<(), Error> {
+    let mut list = make_list();
+
+    let filter = if existing {
+        unused::Filter::New
+    } else {
+        unused::Filter::All
+    };
+
+    for deployment in store.list_unused_deployments(filter)? {
+        add_row(&mut list, deployment);
+    }
+
+    if list.is_empty() {
+        println!("no unused deployments");
+    } else {
+        list.render();
+    }
+
+    Ok(())
+}
+
+pub fn record(store: Arc<SubgraphStore>) -> Result<(), Error> {
+    let mut list = make_list();
+
+    println!("Recording unused deployments. This might take a while.");
+    let recorded = store.record_unused_deployments()?;
+
+    for unused in store.list_unused_deployments(unused::Filter::New)? {
+        if recorded
+            .iter()
+            .find(|r| r.deployment == unused.deployment)
+            .is_some()
+        {
+            add_row(&mut list, unused);
+        }
+    }
+
+    list.render();
+    println!("Recorded {} unused deployments", recorded.len());
+
+    Ok(())
+}
+
+pub fn remove(
+    store: Arc<SubgraphStore>,
+    count: usize,
+    deployment: Option<String>,
+    older: Option<chrono::Duration>,
+) -> Result<(), Error> {
+    let filter = match older {
+        Some(duration) => unused::Filter::UnusedLongerThan(duration),
+        None => unused::Filter::New,
+    };
+    let unused = store.list_unused_deployments(filter)?;
+    let unused = match &deployment {
+        None => unused,
+        Some(deployment) => unused
+            .into_iter()
+            .filter(|u| u.deployment.as_str() == deployment)
+            .collect::<Vec<_>>(),
+    };
+
+    if unused.is_empty() {
+        match &deployment {
+            Some(s) => println!("No unused subgraph matches `{}`", s),
+            None => println!("Nothing to remove."),
+        }
+        return Ok(());
+    }
+
+    for (i, deployment) in unused.iter().take(count).enumerate() {
+        println!("{:=<36} {:4} {:=<36}", "", i + 1, "");
+        println!(
+            "removing {} from {}",
+            deployment.namespace, deployment.shard
+        );
+        println!("  {:>14}: {}", "deployment id", deployment.deployment);
+        println!("  {:>14}: {}", "entities", deployment.entity_count);
+        if let Some(subgraphs) = &deployment.subgraphs {
+            let mut first = true;
+            for name in subgraphs {
+                if first {
+                    println!("  {:>14}: {}", "subgraphs", name);
+                } else {
+                    println!("  {:>14}  {}", "", name);
+                }
+                first = false;
+            }
+        }
+
+        let start = Instant::now();
+        match store.remove_deployment(deployment.id) {
+            Ok(()) => {
+                println!(
+                    "done removing {} from {} in {:.1}s\n",
+                    deployment.namespace,
+                    deployment.shard,
+                    start.elapsed().as_millis() as f64 / 1000.0
+                );
+            }
+            Err(e) => {
+                println!("removal failed: {}", e)
+            }
+        }
+    }
+    Ok(())
+}
diff --git a/node/src/manager/deployment.rs b/node/src/manager/deployment.rs
new file mode 100644
index 0000000..db17db1
--- /dev/null
+++ b/node/src/manager/deployment.rs
@@ -0,0 +1,219 @@
+use std::collections::HashSet;
+use std::fmt;
+use std::str::FromStr;
+
+use diesel::{dsl::sql, prelude::*};
+use diesel::{sql_types::Text, PgConnection};
+use regex::Regex;
+
+use graph::components::store::DeploymentId;
+use graph::{
+    components::store::DeploymentLocator,
+    data::subgraph::status,
+    prelude::{
+        anyhow::{self},
+        lazy_static, DeploymentHash,
+    },
+};
+use graph_store_postgres::command_support::catalog as store_catalog;
+use graph_store_postgres::connection_pool::ConnectionPool;
+
+use crate::manager::display::List;
+
+lazy_static! {
+    // `Qm...` optionally follow by `:$shard`
+    static ref HASH_RE: Regex = Regex::new("\\A(?P<hash>Qm[^:]+)(:(?P<shard>[a-z0-9_]+))?\\z").unwrap();
+    // `sgdNNN`
+    static ref DEPLOYMENT_RE: Regex = Regex::new("\\A(?P<nsp>sgd[0-9]+)\\z").unwrap();
+}
+
+/// A search for one or multiple deployments to make it possible to search
+/// by subgraph name, IPFS hash, or namespace. Since there can be multiple
+/// deployments for the same IPFS hash, the search term for a hash can
+/// optionally specify a shard.
+#[derive(Clone, Debug)]
+pub enum DeploymentSearch {
+    Name { name: String },
+    Hash { hash: String, shard: Option<String> },
+    Deployment { namespace: String },
+}
+
+impl fmt::Display for DeploymentSearch {
+    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
+        match self {
+            DeploymentSearch::Name { name } => write!(f, "{}", name),
+            DeploymentSearch::Hash {
+                hash,
+                shard: Some(shard),
+            } => write!(f, "{}:{}", hash, shard),
+            DeploymentSearch::Hash { hash, shard: None } => write!(f, "{}", hash),
+            DeploymentSearch::Deployment { namespace } => write!(f, "{}", namespace),
+        }
+    }
+}
+
+impl FromStr for DeploymentSearch {
+    type Err = anyhow::Error;
+
+    fn from_str(s: &str) -> Result<Self, Self::Err> {
+        if let Some(caps) = HASH_RE.captures(s) {
+            let hash = caps.name("hash").unwrap().as_str().to_string();
+            let shard = caps.name("shard").map(|shard| shard.as_str().to_string());
+            Ok(DeploymentSearch::Hash { hash, shard })
+        } else if let Some(caps) = DEPLOYMENT_RE.captures(s) {
+            let namespace = caps.name("nsp").unwrap().as_str().to_string();
+            Ok(DeploymentSearch::Deployment { namespace })
+        } else {
+            Ok(DeploymentSearch::Name {
+                name: s.to_string(),
+            })
+        }
+    }
+}
+
+impl DeploymentSearch {
+    pub fn lookup(&self, primary: &ConnectionPool) -> Result<Vec<Deployment>, anyhow::Error> {
+        let conn = primary.get()?;
+        self.lookup_with_conn(&conn)
+    }
+
+    pub fn lookup_with_conn(&self, conn: &PgConnection) -> Result<Vec<Deployment>, anyhow::Error> {
+        use store_catalog::deployment_schemas as ds;
+        use store_catalog::subgraph as s;
+        use store_catalog::subgraph_deployment_assignment as a;
+        use store_catalog::subgraph_version as v;
+
+        let query = ds::table
+            .inner_join(v::table.on(v::deployment.eq(ds::subgraph)))
+            .inner_join(s::table.on(v::subgraph.eq(s::id)))
+            .left_outer_join(a::table.on(a::id.eq(ds::id)))
+            .select((
+                s::name,
+                sql::<Text>(
+                    "(case
+                    when subgraphs.subgraph.pending_version = subgraphs.subgraph_version.id then 'pending'
+                    when subgraphs.subgraph.current_version = subgraphs.subgraph_version.id then 'current'
+                    else 'unused' end) status",
+                ),
+                v::deployment,
+                ds::name,
+                ds::id,
+                a::node_id.nullable(),
+                ds::shard,
+                ds::network,
+                ds::active,
+            ));
+
+        let deployments: Vec<Deployment> = match self {
+            DeploymentSearch::Name { name } => {
+                let pattern = format!("%{}%", name);
+                query.filter(s::name.ilike(&pattern)).load(conn)?
+            }
+            DeploymentSearch::Hash { hash, shard } => {
+                let query = query.filter(ds::subgraph.eq(&hash));
+                match shard {
+                    Some(shard) => query.filter(ds::shard.eq(shard)).load(conn)?,
+                    None => query.load(conn)?,
+                }
+            }
+            DeploymentSearch::Deployment { namespace } => {
+                query.filter(ds::name.eq(&namespace)).load(conn)?
+            }
+        };
+        Ok(deployments)
+    }
+
+    /// Finds a single deployment locator for the given deployment identifier.
+    pub fn locate_unique(&self, pool: &ConnectionPool) -> anyhow::Result<DeploymentLocator> {
+        let mut locators: Vec<DeploymentLocator> = HashSet::<DeploymentLocator>::from_iter(
+            self.lookup(pool)?
+                .into_iter()
+                .map(|deployment| deployment.locator()),
+        )
+        .into_iter()
+        .collect();
+        let deployment_locator = match locators.len() {
+            0 => anyhow::bail!("Found no deployment for `{}`", self),
+            1 => locators.pop().unwrap(),
+            n => anyhow::bail!("Found {} deployments for `{}`", n, self),
+        };
+        Ok(deployment_locator)
+    }
+}
+
+#[derive(Queryable, PartialEq, Eq, Hash, Debug)]
+pub struct Deployment {
+    pub name: String,
+    pub status: String,
+    pub deployment: String,
+    pub namespace: String,
+    pub id: i32,
+    pub node_id: Option<String>,
+    pub shard: String,
+    pub chain: String,
+    pub active: bool,
+}
+
+impl Deployment {
+    pub fn locator(&self) -> DeploymentLocator {
+        DeploymentLocator::new(
+            DeploymentId(self.id),
+            DeploymentHash::new(self.deployment.clone()).unwrap(),
+        )
+    }
+
+    pub fn print_table(deployments: Vec<Self>, statuses: Vec<status::Info>) {
+        let mut rows = vec![
+            "name",
+            "status",
+            "id",
+            "namespace",
+            "shard",
+            "active",
+            "chain",
+            "node_id",
+        ];
+        if !statuses.is_empty() {
+            rows.extend(vec!["synced", "health", "latest block", "chain head block"]);
+        }
+
+        let mut list = List::new(rows);
+
+        for deployment in deployments {
+            let status = statuses
+                .iter()
+                .find(|status| &status.id.0 == &deployment.id);
+
+            let mut rows = vec![
+                deployment.name,
+                deployment.status,
+                deployment.deployment,
+                deployment.namespace,
+                deployment.shard,
+                deployment.active.to_string(),
+                deployment.chain,
+                deployment.node_id.unwrap_or("---".to_string()),
+            ];
+            if let Some(status) = status {
+                let chain = &status.chains[0];
+                rows.extend(vec![
+                    status.synced.to_string(),
+                    status.health.as_str().to_string(),
+                    chain
+                        .latest_block
+                        .as_ref()
+                        .map(|b| b.number().to_string())
+                        .unwrap_or("-".to_string()),
+                    chain
+                        .chain_head_block
+                        .as_ref()
+                        .map(|b| b.number().to_string())
+                        .unwrap_or("-".to_string()),
+                ])
+            }
+            list.append(rows);
+        }
+
+        list.render();
+    }
+}
diff --git a/node/src/manager/display.rs b/node/src/manager/display.rs
new file mode 100644
index 0000000..694eaf6
--- /dev/null
+++ b/node/src/manager/display.rs
@@ -0,0 +1,54 @@
+pub struct List {
+    pub headers: Vec<String>,
+    pub rows: Vec<Vec<String>>,
+}
+
+impl List {
+    pub fn new(headers: Vec<&str>) -> Self {
+        let headers = headers.into_iter().map(|s| s.to_string()).collect();
+        Self {
+            headers,
+            rows: Vec::new(),
+        }
+    }
+
+    pub fn append(&mut self, row: Vec<String>) {
+        if row.len() != self.headers.len() {
+            panic!(
+                "there are {} headers but the row has {} entries: {:?}",
+                self.headers.len(),
+                row.len(),
+                row
+            );
+        }
+        self.rows.push(row);
+    }
+
+    pub fn is_empty(&self) -> bool {
+        self.rows.is_empty()
+    }
+
+    pub fn render(&self) {
+        const LINE_WIDTH: usize = 78;
+
+        let header_width = self.headers.iter().map(|h| h.len()).max().unwrap_or(0);
+        let header_width = if header_width < 5 { 5 } else { header_width };
+        let mut first = true;
+        for row in &self.rows {
+            if !first {
+                println!(
+                    "{:-<width$}-+-{:-<rest$}",
+                    "",
+                    "",
+                    width = header_width,
+                    rest = LINE_WIDTH - 3 - header_width
+                );
+            }
+            first = false;
+
+            for (header, value) in self.headers.iter().zip(row) {
+                println!("{:width$} | {}", header, value, width = header_width);
+            }
+        }
+    }
+}
diff --git a/node/src/manager/mod.rs b/node/src/manager/mod.rs
new file mode 100644
index 0000000..37bebf9
--- /dev/null
+++ b/node/src/manager/mod.rs
@@ -0,0 +1,24 @@
+use std::collections::BTreeSet;
+
+use graph::{
+    components::store::{SubscriptionManager, UnitStream},
+    prelude::{StoreEventStreamBox, SubscriptionFilter},
+};
+
+pub mod catalog;
+pub mod commands;
+pub mod deployment;
+mod display;
+
+/// A dummy subscription manager that always panics
+pub struct PanicSubscriptionManager;
+
+impl SubscriptionManager for PanicSubscriptionManager {
+    fn subscribe(&self, _: BTreeSet<SubscriptionFilter>) -> StoreEventStreamBox {
+        panic!("we were never meant to call `subscribe`");
+    }
+
+    fn subscribe_no_payload(&self, _: BTreeSet<SubscriptionFilter>) -> UnitStream {
+        panic!("we were never meant to call `subscribe_no_payload`");
+    }
+}
diff --git a/node/src/opt.rs b/node/src/opt.rs
new file mode 100644
index 0000000..c40c1c5
--- /dev/null
+++ b/node/src/opt.rs
@@ -0,0 +1,259 @@
+use clap::Parser;
+use git_testament::{git_testament, render_testament};
+use lazy_static::lazy_static;
+
+use crate::config;
+
+git_testament!(TESTAMENT);
+lazy_static! {
+    static ref RENDERED_TESTAMENT: String = render_testament!(TESTAMENT);
+}
+
+#[derive(Clone, Debug, Parser)]
+#[clap(
+    name = "graph-node",
+    about = "Scalable queries for a decentralized future",
+    author = "Graph Protocol, Inc.",
+    version = RENDERED_TESTAMENT.as_str()
+)]
+pub struct Opt {
+    #[clap(
+        long,
+        env = "GRAPH_NODE_CONFIG",
+        conflicts_with_all = &["postgres-url", "postgres-secondary-hosts", "postgres-host-weights"],
+        required_unless = "postgres-url",
+        help = "the name of the configuration file",
+    )]
+    pub config: Option<String>,
+    #[clap(long, help = "validate the configuration and exit")]
+    pub check_config: bool,
+    #[clap(
+        long,
+        value_name = "[NAME:]IPFS_HASH",
+        env = "SUBGRAPH",
+        help = "name and IPFS hash of the subgraph manifest"
+    )]
+    pub subgraph: Option<String>,
+
+    #[clap(
+        long,
+        value_name = "BLOCK_HASH:BLOCK_NUMBER",
+        help = "block hash and number that the subgraph passed will start indexing at"
+    )]
+    pub start_block: Option<String>,
+
+    #[clap(
+        long,
+        value_name = "URL",
+        env = "POSTGRES_URL",
+        conflicts_with = "config",
+        required_unless = "config",
+        help = "Location of the Postgres database used for storing entities"
+    )]
+    pub postgres_url: Option<String>,
+    #[clap(
+        long,
+        value_name = "URL,",
+        use_delimiter = true,
+        env = "GRAPH_POSTGRES_SECONDARY_HOSTS",
+        conflicts_with = "config",
+        help = "Comma-separated list of host names/IP's for read-only Postgres replicas, \
+           which will share the load with the primary server"
+    )]
+    // FIXME: Make sure delimiter is ','
+    pub postgres_secondary_hosts: Vec<String>,
+    #[clap(
+        long,
+        value_name = "WEIGHT,",
+        use_delimiter = true,
+        env = "GRAPH_POSTGRES_HOST_WEIGHTS",
+        conflicts_with = "config",
+        help = "Comma-separated list of relative weights for selecting the main database \
+    and secondary databases. The list is in the order MAIN,REPLICA1,REPLICA2,...\
+    A host will receive approximately WEIGHT/SUM(WEIGHTS) fraction of total queries. \
+    Defaults to weight 1 for each host"
+    )]
+    pub postgres_host_weights: Vec<usize>,
+    #[clap(
+        long,
+        min_values=0,
+        required_unless_one = &["ethereum-ws", "ethereum-ipc", "config"],
+        conflicts_with_all = &["ethereum-ws", "ethereum-ipc", "config"],
+        value_name="NETWORK_NAME:[CAPABILITIES]:URL",
+        env="ETHEREUM_RPC",
+        help= "Ethereum network name (e.g. 'mainnet'), optional comma-seperated capabilities (eg 'full,archive'), and an Ethereum RPC URL, separated by a ':'",
+    )]
+    pub ethereum_rpc: Vec<String>,
+    #[clap(long, min_values=0,
+        required_unless_one = &["ethereum-rpc", "ethereum-ipc", "config"],
+        conflicts_with_all = &["ethereum-rpc", "ethereum-ipc", "config"],
+        value_name="NETWORK_NAME:[CAPABILITIES]:URL",
+        env="ETHEREUM_WS",
+        help= "Ethereum network name (e.g. 'mainnet'), optional comma-seperated capabilities (eg 'full,archive`, and an Ethereum WebSocket URL, separated by a ':'",
+    )]
+    pub ethereum_ws: Vec<String>,
+    #[clap(long, min_values=0,
+        required_unless_one = &["ethereum-rpc", "ethereum-ws", "config"],
+        conflicts_with_all = &["ethereum-rpc", "ethereum-ws", "config"],
+        value_name="NETWORK_NAME:[CAPABILITIES]:FILE",
+        env="ETHEREUM_IPC",
+        help= "Ethereum network name (e.g. 'mainnet'), optional comma-seperated capabilities (eg 'full,archive'), and an Ethereum IPC pipe, separated by a ':'",
+    )]
+    pub ethereum_ipc: Vec<String>,
+    #[clap(
+        long,
+        value_name = "HOST:PORT",
+        env = "IPFS",
+        help = "HTTP addresses of IPFS nodes"
+    )]
+    pub ipfs: Vec<String>,
+    #[clap(
+        long,
+        default_value = "8000",
+        value_name = "PORT",
+        help = "Port for the GraphQL HTTP server",
+        env = "GRAPH_GRAPHQL_HTTP_PORT"
+    )]
+    pub http_port: u16,
+    #[clap(
+        long,
+        default_value = "8030",
+        value_name = "PORT",
+        help = "Port for the index node server"
+    )]
+    pub index_node_port: u16,
+    #[clap(
+        long,
+        default_value = "8001",
+        value_name = "PORT",
+        help = "Port for the GraphQL WebSocket server",
+        env = "GRAPH_GRAPHQL_WS_PORT"
+    )]
+    pub ws_port: u16,
+    #[clap(
+        long,
+        default_value = "8020",
+        value_name = "PORT",
+        help = "Port for the JSON-RPC admin server"
+    )]
+    pub admin_port: u16,
+    #[clap(
+        long,
+        default_value = "8040",
+        value_name = "PORT",
+        help = "Port for the Prometheus metrics server"
+    )]
+    pub metrics_port: u16,
+    #[clap(
+        long,
+        default_value = "default",
+        value_name = "NODE_ID",
+        env = "GRAPH_NODE_ID",
+        help = "a unique identifier for this node. Should have the same value between consecutive node restarts"
+    )]
+    pub node_id: String,
+    #[clap(
+        long,
+        value_name = "FILE",
+        env = "GRAPH_NODE_EXPENSIVE_QUERIES_FILE",
+        default_value = "/etc/graph-node/expensive-queries.txt",
+        help = "a file with a list of expensive queries, one query per line. Attempts to run these queries will return a QueryExecutionError::TooExpensive to clients"
+    )]
+    pub expensive_queries_filename: String,
+    #[clap(long, help = "Enable debug logging")]
+    pub debug: bool,
+
+    #[clap(
+        long,
+        value_name = "URL",
+        env = "ELASTICSEARCH_URL",
+        help = "Elasticsearch service to write subgraph logs to"
+    )]
+    pub elasticsearch_url: Option<String>,
+    #[clap(
+        long,
+        value_name = "USER",
+        env = "ELASTICSEARCH_USER",
+        help = "User to use for Elasticsearch logging"
+    )]
+    pub elasticsearch_user: Option<String>,
+    #[clap(
+        long,
+        value_name = "PASSWORD",
+        env = "ELASTICSEARCH_PASSWORD",
+        hide_env_values = true,
+        help = "Password to use for Elasticsearch logging"
+    )]
+    pub elasticsearch_password: Option<String>,
+    #[clap(
+        long,
+        value_name = "MILLISECONDS",
+        default_value = "1000",
+        env = "ETHEREUM_POLLING_INTERVAL",
+        help = "How often to poll the Ethereum node for new blocks"
+    )]
+    pub ethereum_polling_interval: u64,
+    #[clap(
+        long,
+        value_name = "DISABLE_BLOCK_INGESTOR",
+        env = "DISABLE_BLOCK_INGESTOR",
+        help = "Ensures that the block ingestor component does not execute"
+    )]
+    pub disable_block_ingestor: bool,
+    #[clap(
+        long,
+        value_name = "STORE_CONNECTION_POOL_SIZE",
+        default_value = "10",
+        env = "STORE_CONNECTION_POOL_SIZE",
+        help = "Limits the number of connections in the store's connection pool"
+    )]
+    pub store_connection_pool_size: u32,
+    #[clap(
+        long,
+        help = "Allows setting configurations that may result in incorrect Proofs of Indexing."
+    )]
+    pub unsafe_config: bool,
+
+    #[clap(
+        long,
+        value_name = "IPFS_HASH",
+        help = "IPFS hash of the subgraph manifest that you want to fork"
+    )]
+    pub debug_fork: Option<String>,
+
+    #[clap(long, value_name = "URL", help = "Base URL for forking subgraphs")]
+    pub fork_base: Option<String>,
+}
+
+impl From<Opt> for config::Opt {
+    fn from(opt: Opt) -> Self {
+        let Opt {
+            postgres_url,
+            config,
+            store_connection_pool_size,
+            postgres_host_weights,
+            postgres_secondary_hosts,
+            disable_block_ingestor,
+            node_id,
+            ethereum_rpc,
+            ethereum_ws,
+            ethereum_ipc,
+            unsafe_config,
+            ..
+        } = opt;
+
+        config::Opt {
+            postgres_url,
+            config,
+            store_connection_pool_size,
+            postgres_host_weights,
+            postgres_secondary_hosts,
+            disable_block_ingestor,
+            node_id,
+            ethereum_rpc,
+            ethereum_ws,
+            ethereum_ipc,
+            unsafe_config,
+        }
+    }
+}
diff --git a/node/src/store_builder.rs b/node/src/store_builder.rs
new file mode 100644
index 0000000..205f182
--- /dev/null
+++ b/node/src/store_builder.rs
@@ -0,0 +1,292 @@
+use std::iter::FromIterator;
+use std::{collections::HashMap, sync::Arc};
+
+use futures::future::join_all;
+use graph::blockchain::ChainIdentifier;
+use graph::prelude::{o, MetricsRegistry, NodeId};
+use graph::url::Url;
+use graph::{
+    prelude::{info, CheapClone, Logger},
+    util::security::SafeDisplay,
+};
+use graph_store_postgres::connection_pool::{ConnectionPool, ForeignServer, PoolName};
+use graph_store_postgres::{
+    BlockStore as DieselBlockStore, ChainHeadUpdateListener as PostgresChainHeadUpdateListener,
+    NotificationSender, Shard as ShardName, Store as DieselStore, SubgraphStore,
+    SubscriptionManager, PRIMARY_SHARD,
+};
+
+use crate::config::{Config, Shard};
+
+pub struct StoreBuilder {
+    logger: Logger,
+    subgraph_store: Arc<SubgraphStore>,
+    pools: HashMap<ShardName, ConnectionPool>,
+    subscription_manager: Arc<SubscriptionManager>,
+    chain_head_update_listener: Arc<PostgresChainHeadUpdateListener>,
+    /// Map network names to the shards where they are/should be stored
+    chains: HashMap<String, ShardName>,
+}
+
+impl StoreBuilder {
+    /// Set up all stores, and run migrations. This does a complete store
+    /// setup whereas other methods here only get connections for an already
+    /// initialized store
+    pub async fn new(
+        logger: &Logger,
+        node: &NodeId,
+        config: &Config,
+        fork_base: Option<Url>,
+        registry: Arc<dyn MetricsRegistry>,
+    ) -> Self {
+        let primary_shard = config.primary_store().clone();
+
+        let subscription_manager = Arc::new(SubscriptionManager::new(
+            logger.cheap_clone(),
+            primary_shard.connection.to_owned(),
+            registry.clone(),
+        ));
+
+        let (store, pools) = Self::make_subgraph_store_and_pools(
+            logger,
+            node,
+            config,
+            fork_base,
+            registry.cheap_clone(),
+        );
+
+        // Try to perform setup (migrations etc.) for all the pools. If this
+        // attempt doesn't work for all of them because the database is
+        // unavailable, they will try again later in the normal course of
+        // using the pool
+        join_all(pools.iter().map(|(_, pool)| pool.setup())).await;
+
+        let chains = HashMap::from_iter(config.chains.chains.iter().map(|(name, chain)| {
+            let shard = ShardName::new(chain.shard.to_string())
+                .expect("config validation catches invalid names");
+            (name.to_string(), shard)
+        }));
+
+        let chain_head_update_listener = Arc::new(PostgresChainHeadUpdateListener::new(
+            &logger,
+            registry.cheap_clone(),
+            primary_shard.connection.to_owned(),
+        ));
+
+        Self {
+            logger: logger.cheap_clone(),
+            subgraph_store: store,
+            pools,
+            subscription_manager,
+            chain_head_update_listener,
+            chains,
+        }
+    }
+
+    /// Make a `ShardedStore` across all configured shards, and also return
+    /// the main connection pools for each shard, but not any pools for
+    /// replicas
+    pub fn make_subgraph_store_and_pools(
+        logger: &Logger,
+        node: &NodeId,
+        config: &Config,
+        fork_base: Option<Url>,
+        registry: Arc<dyn MetricsRegistry>,
+    ) -> (Arc<SubgraphStore>, HashMap<ShardName, ConnectionPool>) {
+        let notification_sender = Arc::new(NotificationSender::new(registry.cheap_clone()));
+
+        let servers = config
+            .stores
+            .iter()
+            .map(|(name, shard)| ForeignServer::new_from_raw(name.to_string(), &shard.connection))
+            .collect::<Result<Vec<_>, _>>()
+            .expect("connection url's contain enough detail");
+        let servers = Arc::new(servers);
+
+        let shards: Vec<_> = config
+            .stores
+            .iter()
+            .map(|(name, shard)| {
+                let logger = logger.new(o!("shard" => name.to_string()));
+                let conn_pool = Self::main_pool(
+                    &logger,
+                    node,
+                    name,
+                    shard,
+                    registry.cheap_clone(),
+                    servers.clone(),
+                );
+
+                let (read_only_conn_pools, weights) = Self::replica_pools(
+                    &logger,
+                    node,
+                    name,
+                    shard,
+                    registry.cheap_clone(),
+                    servers.clone(),
+                );
+
+                let name =
+                    ShardName::new(name.to_string()).expect("shard names have been validated");
+                (name, conn_pool, read_only_conn_pools, weights)
+            })
+            .collect();
+
+        let pools: HashMap<_, _> = HashMap::from_iter(
+            shards
+                .iter()
+                .map(|(name, pool, _, _)| (name.clone(), pool.clone())),
+        );
+
+        let store = Arc::new(SubgraphStore::new(
+            logger,
+            shards,
+            Arc::new(config.deployment.clone()),
+            notification_sender,
+            fork_base,
+            registry,
+        ));
+
+        (store, pools)
+    }
+
+    pub fn make_store(
+        logger: &Logger,
+        pools: HashMap<ShardName, ConnectionPool>,
+        subgraph_store: Arc<SubgraphStore>,
+        chains: HashMap<String, ShardName>,
+        networks: Vec<(String, Vec<ChainIdentifier>)>,
+    ) -> Arc<DieselStore> {
+        let networks = networks
+            .into_iter()
+            .map(|(name, idents)| {
+                let shard = chains.get(&name).unwrap_or(&*PRIMARY_SHARD).clone();
+                (name, idents, shard)
+            })
+            .collect();
+
+        let logger = logger.new(o!("component" => "BlockStore"));
+
+        let block_store = Arc::new(
+            DieselBlockStore::new(
+                logger,
+                networks,
+                pools.clone(),
+                subgraph_store.notification_sender(),
+            )
+            .expect("Creating the BlockStore works"),
+        );
+        block_store
+            .update_db_version()
+            .expect("Updating `db_version` works");
+
+        Arc::new(DieselStore::new(subgraph_store, block_store))
+    }
+
+    /// Create a connection pool for the main database of the primary shard
+    /// without connecting to all the other configured databases
+    pub fn main_pool(
+        logger: &Logger,
+        node: &NodeId,
+        name: &str,
+        shard: &Shard,
+        registry: Arc<dyn MetricsRegistry>,
+        servers: Arc<Vec<ForeignServer>>,
+    ) -> ConnectionPool {
+        let logger = logger.new(o!("pool" => "main"));
+        let pool_size = shard.pool_size.size_for(node, name).expect(&format!(
+            "cannot determine the pool size for store {}",
+            name
+        ));
+        let fdw_pool_size = shard.fdw_pool_size.size_for(node, name).expect(&format!(
+            "cannot determine the fdw pool size for store {}",
+            name
+        ));
+        info!(
+            logger,
+            "Connecting to Postgres";
+            "url" => SafeDisplay(shard.connection.as_str()),
+            "conn_pool_size" => pool_size,
+            "weight" => shard.weight
+        );
+        ConnectionPool::create(
+            name,
+            PoolName::Main,
+            shard.connection.to_owned(),
+            pool_size,
+            Some(fdw_pool_size),
+            &logger,
+            registry.cheap_clone(),
+            servers,
+        )
+    }
+
+    /// Create connection pools for each of the replicas
+    fn replica_pools(
+        logger: &Logger,
+        node: &NodeId,
+        name: &str,
+        shard: &Shard,
+        registry: Arc<dyn MetricsRegistry>,
+        servers: Arc<Vec<ForeignServer>>,
+    ) -> (Vec<ConnectionPool>, Vec<usize>) {
+        let mut weights: Vec<_> = vec![shard.weight];
+        (
+            shard
+                .replicas
+                .values()
+                .enumerate()
+                .map(|(i, replica)| {
+                    let pool = format!("replica{}", i + 1);
+                    let logger = logger.new(o!("pool" => pool.clone()));
+                    info!(
+                        &logger,
+                        "Connecting to Postgres (read replica {})", i+1;
+                        "url" => SafeDisplay(replica.connection.as_str()),
+                        "weight" => replica.weight
+                    );
+                    weights.push(replica.weight);
+                    let pool_size = replica.pool_size.size_for(node, name).expect(&format!(
+                        "we can determine the pool size for replica {}",
+                        name
+                    ));
+                    ConnectionPool::create(
+                        name,
+                        PoolName::Replica(pool),
+                        replica.connection.clone(),
+                        pool_size,
+                        None,
+                        &logger,
+                        registry.cheap_clone(),
+                        servers.clone(),
+                    )
+                })
+                .collect(),
+            weights,
+        )
+    }
+
+    /// Return a store that combines both a `Store` for subgraph data
+    /// and a `BlockStore` for all chain related data
+    pub fn network_store(self, networks: Vec<(String, Vec<ChainIdentifier>)>) -> Arc<DieselStore> {
+        Self::make_store(
+            &self.logger,
+            self.pools,
+            self.subgraph_store,
+            self.chains,
+            networks,
+        )
+    }
+
+    pub fn subscription_manager(&self) -> Arc<SubscriptionManager> {
+        self.subscription_manager.cheap_clone()
+    }
+
+    pub fn chain_head_update_listener(&self) -> Arc<PostgresChainHeadUpdateListener> {
+        self.chain_head_update_listener.clone()
+    }
+
+    pub fn primary_pool(&self) -> ConnectionPool {
+        self.pools.get(&*PRIMARY_SHARD).unwrap().clone()
+    }
+}
diff --git a/resources/construction.svg b/resources/construction.svg
new file mode 100644
index 0000000..e4d4ce9
--- /dev/null
+++ b/resources/construction.svg
@@ -0,0 +1,168 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<svg width="842px" height="245px" viewBox="0 0 842 245" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
+    <!-- Generator: Sketch 50 (54983) - http://www.bohemiancoding.com/sketch -->
+    <title>under consctruction 2</title>
+    <desc>Created with Sketch.</desc>
+    <defs></defs>
+    <g id="Page-1" stroke="none" stroke-width="1" fill="none" fill-rule="evenodd" stroke-linecap="round" stroke-linejoin="round">
+        <g id="under-consctruction-2" transform="translate(1.000000, 20.000000)" stroke="#3537C8" stroke-width="0.5">
+            <g id="Group-3" transform="translate(147.000000, 77.000000)">
+                <circle id="Oval" cx="420" cy="13" r="3"></circle>
+                <circle id="Oval" cx="420" cy="37" r="3"></circle>
+                <path d="M405,48 L405,2" id="Shape"></path>
+                <path d="M424,36.75 C424,43.5154882 418.403559,49 411.5,49 C404.596441,49 399,43.5154882 399,36.75 L399,12.25 C399,5.48451181 404.596441,0 411.5,0 C418.403559,0 424,5.48451181 424,12.25" id="Shape"></path>
+                <circle id="Oval" cx="205" cy="13" r="3"></circle>
+                <circle id="Oval" cx="205" cy="37" r="3"></circle>
+                <path d="M190,48 L190,2" id="Shape"></path>
+                <path d="M209,36.75 C209,43.5154882 203.403559,49 196.5,49 C189.596441,49 184,43.5154882 184,36.75 L184,12.25 C184,5.48451181 189.596441,0 196.5,0 C203.403559,0 209,5.48451181 209,12.25" id="Shape"></path>
+                <path d="M61,0 L61,12" id="Shape"></path>
+                <path d="M61,37 L61,49" id="Shape"></path>
+                <path d="M61,0 L67.25,0 C77.6053391,0 86,8.28273213 86,18.5 C86,28.7172679 77.6053391,37 67.25,37 L61,37" id="Shape"></path>
+                <path d="M61,50 L67.25,50 C77.6053391,50 86,41.7172679 86,31.5 C86,21.2827321 77.6053391,13 67.25,13 L61,13" id="Shape"></path>
+                <path d="M61,19 L61,31" id="Shape"></path>
+                <path d="M288,13 L288,38" id="Shape"></path>
+                <path d="M301,12.3265198 C301.000154,6.34521926 296.645124,1.22719469 290.671475,0.188452998 C284.697826,-0.850288697 278.830119,2.49013176 276.755438,8.1106984 C274.680757,13.731265 276.998052,20.0093497 282.251206,23 L282.251206,1.69001466" id="Shape"></path>
+                <path d="M276,37.6734802 C275.999846,43.6547807 280.354876,48.7728053 286.328525,49.811547 C292.302174,50.8502887 298.169881,47.5098682 300.244562,41.8893016 C302.319243,36.268735 300.001948,29.9906503 294.748794,27 L294.748794,48.3469604" id="Shape"></path>
+                <path d="M344,25 L362,43" id="Shape"></path>
+                <path d="M344,31 L362,49" id="Shape"></path>
+                <path d="M337,31 L337,49" id="Shape"></path>
+                <path d="M343.25,6 L349.5,6 C356.40356,6.00000029 362,11.5964408 362,18.5 C362,25.4035592 356.40356,30.9999997 349.5,31 L337,31" id="Shape"></path>
+                <path d="M337,0 L349.5,0 C356.40356,2.90963271e-07 362,5.59644083 362,12.5 C362,19.4035592 356.40356,24.9999997 349.5,25 L343.25,25" id="Shape"></path>
+                <path d="M129,25 L147,43" id="Shape"></path>
+                <path d="M129,31 L147,49" id="Shape"></path>
+                <path d="M123,31 L123,49" id="Shape"></path>
+                <path d="M129.25,6 L135.5,6 C142.40356,6.00000029 148,11.5964408 148,18.5 C148,25.4035592 142.40356,30.9999997 135.5,31 L123,31" id="Shape"></path>
+                <path d="M123,0 L135.5,0 C142.40356,2.90963236e-07 148,5.59644083 148,12.5 C148,19.4035592 142.40356,24.9999997 135.5,25 L129.25,25" id="Shape"></path>
+                <path d="M98,6 L110,6" id="Shape"></path>
+                <path d="M98,43 L110,43" id="Shape"></path>
+                <polyline id="Shape" points="92 12 104.5 0 117 0"></polyline>
+                <polyline id="Shape" points="92 37 104.5 49 117 49"></polyline>
+                <polyline id="Shape" points="98 0 92 0 92 12.25 92 12.25 104 24.5 104 24.5 92 36.75 92 36.75 92 49 98 49"></polyline>
+                <path d="M221,12 C221,8.6862915 223.686292,6 227,6 C230.313708,6 233,8.6862915 233,12" id="Shape"></path>
+                <path d="M240,36.75 L240,12.25 C240,5.48451181 234.403559,0 227.5,0 C220.596441,0 215,5.48451181 215,12.25 L215,36.75 C215,43.5154882 220.596441,49 227.5,49 C234.403559,49 240,43.5154882 240,36.75 Z" id="Shape"></path>
+                <path d="M221,37 C221,40.3137085 223.686292,43 227,43 C230.313708,43 233,40.3137085 233,37" id="Shape"></path>
+                <path d="M227,13 L227,38" id="Shape"></path>
+                <path d="M497,12 C497,8.6862915 499.686292,6 503,6 C506.313708,6 509,8.6862915 509,12" id="Shape"></path>
+                <path d="M516,36.75 L516,12.25 C516,5.48451181 510.403559,0 503.5,0 C496.596441,0 491,5.48451181 491,12.25 L491,36.75 C491,43.5154882 496.596441,49 503.5,49 C510.403559,49 516,43.5154882 516,36.75 Z" id="Shape"></path>
+                <path d="M497,37 C497,40.3137085 499.686292,43 503,43 C506.313708,43 509,40.3137085 509,37" id="Shape"></path>
+                <path d="M503,13 L503,38" id="Shape"></path>
+                <path d="M522,25 L547,50" id="Shape"></path>
+                <path d="M546,43 L534,31" id="Shape"></path>
+                <path d="M540,31 L546,37" id="Shape"></path>
+                <path d="M522,0 L547,25" id="Shape"></path>
+                <path d="M522,6 L534,18" id="Shape"></path>
+                <path d="M528,19 L522,13" id="Shape"></path>
+                <path d="M522,49 L522,0" id="Shape"></path>
+                <path d="M546,49 L546,0" id="Shape"></path>
+                <path d="M528,25 L540,25" id="Shape"></path>
+                <path d="M30,25 L55,50" id="Shape"></path>
+                <path d="M55,43 L43,31" id="Shape"></path>
+                <path d="M49,31 L55,37" id="Shape"></path>
+                <path d="M30,0 L55,25" id="Shape"></path>
+                <path d="M30,6 L42,18" id="Shape"></path>
+                <path d="M36,19 L30,13" id="Shape"></path>
+                <path d="M30,49 L30,0" id="Shape"></path>
+                <path d="M55,49 L55,0" id="Shape"></path>
+                <path d="M37,25 L49,25" id="Shape"></path>
+                <path d="M245,25 L270,50" id="Shape"></path>
+                <path d="M270,43 L258,31" id="Shape"></path>
+                <path d="M264,31 L270,37" id="Shape"></path>
+                <path d="M245,0 L270,25" id="Shape"></path>
+                <path d="M245,6 L257,18" id="Shape"></path>
+                <path d="M251,19 L245,13" id="Shape"></path>
+                <path d="M245,49 L245,0" id="Shape"></path>
+                <path d="M270,49 L270,0" id="Shape"></path>
+                <path d="M251,25 L263,25" id="Shape"></path>
+                <path d="M319,0 L319,49" id="Shape"></path>
+                <path d="M307,6 L332,6" id="Shape"></path>
+                <polyline id="Shape" points="332 12 319.5 0 307 12"></polyline>
+                <polyline id="Shape" points="307 12 307 0 332 0 332 12"></polyline>
+                <path d="M313,50 L325,50" id="Shape"></path>
+                <path d="M442,0 L442,49" id="Shape"></path>
+                <path d="M430,6 L455,6" id="Shape"></path>
+                <polyline id="Shape" points="455 12 442.5 0 430 12"></polyline>
+                <polyline id="Shape" points="430 12 430 0 455 0 455 12"></polyline>
+                <path d="M436,50 L448,50" id="Shape"></path>
+                <path d="M374,0 L374,48" id="Shape"></path>
+                <path d="M387,0 L387,48" id="Shape"></path>
+                <path d="M386.75,0 C386.75,3.38274409 389.54822,6.125 393,6.125 L393,36.75 C393,43.5154882 387.403559,49 380.5,49 C373.596441,49 368,43.5154882 368,36.75 L368,6.125 C371.45178,6.125 374.25,3.38274409 374.25,0" id="Shape"></path>
+                <path d="M6,0 L6,48" id="Shape"></path>
+                <path d="M18,0 L18,48" id="Shape"></path>
+                <path d="M18.75,0 C18.75,3.38274409 21.5482203,6.125 25,6.125 L25,36.75 C25,43.5154882 19.4035594,49 12.5,49 C5.59644063,49 0,43.5154882 0,36.75 L0,6.125 C3.45177969,6.125 6.25,3.38274409 6.25,0" id="Shape"></path>
+                <path d="M473,6 L473,43" id="Shape"></path>
+                <path d="M466,0 L466,49" id="Shape"></path>
+                <path d="M479,49 L479,0" id="Shape"></path>
+                <polyline id="Shape" points="460 0 466.25 0 466.25 0 472.5 6 478.75 0 478.75 0 485 0"></polyline>
+                <polyline id="Shape" points="460 49 466.25 49 466.25 49 472.5 43 478.75 49 485 49"></polyline>
+            </g>
+            <g id="Group-2" transform="translate(0.000000, 193.000000)">
+                <path d="M320.08,0.81 L330.08,10.81" id="Shape"></path>
+                <path d="M330.08,0.81 L340.08,10.81" id="Shape"></path>
+                <path d="M340.08,0.81 L350.08,10.81" id="Shape"></path>
+                <path d="M350.08,0.81 L360.08,10.81" id="Shape"></path>
+                <path d="M360.08,0.81 L370.08,10.81" id="Shape"></path>
+                <path d="M370.08,0.81 L380.08,10.81" id="Shape"></path>
+                <path d="M380.08,0.81 L390.08,10.81" id="Shape"></path>
+                <path d="M390.08,0.81 L400.08,10.81" id="Shape"></path>
+                <path d="M400.08,0.81 L410.08,10.81" id="Shape"></path>
+                <path d="M410.08,0.81 L420.08,10.81" id="Shape"></path>
+                <path d="M420.08,0.81 L430.08,10.81" id="Shape"></path>
+                <path d="M430.08,0.81 L440.08,10.81" id="Shape"></path>
+                <path d="M440.08,0.81 L450.08,10.81" id="Shape"></path>
+                <path d="M450.08,0.81 L460.08,10.81" id="Shape"></path>
+                <path d="M520.08,0.81 L510.08,10.81" id="Shape"></path>
+                <path d="M510.08,0.81 L500.08,10.81" id="Shape"></path>
+                <path d="M500.08,0.81 L490.08,10.81" id="Shape"></path>
+                <path d="M490.08,0.81 L480.08,10.81" id="Shape"></path>
+                <path d="M480.08,0.81 L470.08,10.81" id="Shape"></path>
+                <path d="M470.08,0.81 L460.08,10.81" id="Shape"></path>
+                <path d="M460.08,0.81 L450.08,10.81" id="Shape"></path>
+                <path d="M450.08,0.81 L440.08,10.81" id="Shape"></path>
+                <path d="M440.08,0.81 L430.08,10.81" id="Shape"></path>
+                <path d="M430.08,0.81 L420.08,10.81" id="Shape"></path>
+                <path d="M420.08,0.81 L410.08,10.81" id="Shape"></path>
+                <path d="M410.08,0.81 L400.08,10.81" id="Shape"></path>
+                <path d="M400.08,0.81 L390.08,10.81" id="Shape"></path>
+                <path d="M390.08,0.81 L380.08,10.81" id="Shape"></path>
+                <path d="M308.66,5.81 L16.17,5.81" id="Shape"></path>
+                <rect id="Rectangle-path" transform="translate(5.240088, 5.812538) rotate(-45.000000) translate(-5.240088, -5.812538) " x="1.70508807" y="2.27753793" width="7.07" height="7.07"></rect>
+                <path d="M531.51,5.81 L824,5.81" id="Shape"></path>
+                <rect id="Rectangle-path" transform="translate(834.915371, 5.807255) rotate(-45.000000) translate(-834.915371, -5.807255) " x="831.380371" y="2.27225479" width="7.07" height="7.07"></rect>
+            </g>
+            <g id="Group">
+                <path d="M520.08,10.25 L510.08,0.25" id="Shape"></path>
+                <path d="M510.08,10.25 L500.08,0.25" id="Shape"></path>
+                <path d="M500.08,10.25 L490.08,0.25" id="Shape"></path>
+                <path d="M490.08,10.25 L480.08,0.25" id="Shape"></path>
+                <path d="M480.08,10.25 L470.08,0.25" id="Shape"></path>
+                <path d="M470.08,10.25 L460.08,0.25" id="Shape"></path>
+                <path d="M460.08,10.25 L450.08,0.25" id="Shape"></path>
+                <path d="M450.08,10.25 L440.08,0.25" id="Shape"></path>
+                <path d="M440.08,10.25 L430.08,0.25" id="Shape"></path>
+                <path d="M430.08,10.25 L420.08,0.25" id="Shape"></path>
+                <path d="M420.08,10.25 L410.08,0.25" id="Shape"></path>
+                <path d="M410.08,10.25 L400.08,0.25" id="Shape"></path>
+                <path d="M400.08,10.25 L390.08,0.25" id="Shape"></path>
+                <path d="M390.08,10.25 L380.08,0.25" id="Shape"></path>
+                <path d="M320.08,10.25 L330.08,0.25" id="Shape"></path>
+                <path d="M330.08,10.25 L340.08,0.25" id="Shape"></path>
+                <path d="M340.08,10.25 L350.08,0.25" id="Shape"></path>
+                <path d="M350.08,10.25 L360.08,0.25" id="Shape"></path>
+                <path d="M360.08,10.25 L370.08,0.25" id="Shape"></path>
+                <path d="M370.08,10.25 L380.08,0.25" id="Shape"></path>
+                <path d="M380.08,10.25 L390.08,0.25" id="Shape"></path>
+                <path d="M390.08,10.25 L400.08,0.25" id="Shape"></path>
+                <path d="M400.08,10.25 L410.08,0.25" id="Shape"></path>
+                <path d="M410.08,10.25 L420.08,0.25" id="Shape"></path>
+                <path d="M420.08,10.25 L430.08,0.25" id="Shape"></path>
+                <path d="M430.08,10.25 L440.08,0.25" id="Shape"></path>
+                <path d="M440.08,10.25 L450.08,0.25" id="Shape"></path>
+                <path d="M450.08,10.25 L460.08,0.25" id="Shape"></path>
+                <path d="M531.51,5.25 L824,5.25" id="Shape"></path>
+                <rect id="Rectangle-path" transform="translate(834.912833, 5.254717) rotate(-45.000000) translate(-834.912833, -5.254717) " x="831.377833" y="1.71971685" width="7.07" height="7.07"></rect>
+                <path d="M308.66,5.25 L16.17,5.25" id="Shape"></path>
+                <rect id="Rectangle-path" transform="translate(5.247550, 5.250000) rotate(-45.000000) translate(-5.247550, -5.250000) " x="1.71255013" y="1.715" width="7.07" height="7.07"></rect>
+            </g>
+        </g>
+    </g>
+</svg>
\ No newline at end of file
diff --git a/runtime/derive/Cargo.toml b/runtime/derive/Cargo.toml
new file mode 100644
index 0000000..13013d7
--- /dev/null
+++ b/runtime/derive/Cargo.toml
@@ -0,0 +1,13 @@
+[package]
+name = "graph-runtime-derive"
+version = "0.27.0"
+edition = "2021"
+
+[lib]
+proc-macro = true
+
+[dependencies]
+syn = { version = "1.0.98", features = ["full"] }
+quote = "1.0"
+proc-macro2 = "1.0.43"
+heck = "0.4"
diff --git a/runtime/derive/src/generate_array_type.rs b/runtime/derive/src/generate_array_type.rs
new file mode 100644
index 0000000..91a7d1d
--- /dev/null
+++ b/runtime/derive/src/generate_array_type.rs
@@ -0,0 +1,80 @@
+use proc_macro::TokenStream;
+use proc_macro2::{Ident, Span};
+use quote::quote;
+use syn::{self, parse_macro_input, AttributeArgs, ItemStruct, Meta, NestedMeta, Path};
+
+pub fn generate_array_type(metadata: TokenStream, input: TokenStream) -> TokenStream {
+    let item_struct = parse_macro_input!(input as ItemStruct);
+    let name = item_struct.ident.clone();
+
+    let asc_name = Ident::new(&format!("Asc{}", name.to_string()), Span::call_site());
+    let asc_name_array = Ident::new(&format!("Asc{}Array", name.to_string()), Span::call_site());
+
+    let args = parse_macro_input!(metadata as AttributeArgs);
+
+    let args = args
+        .iter()
+        .filter_map(|a| {
+            if let NestedMeta::Meta(Meta::Path(Path { segments, .. })) = a {
+                if let Some(p) = segments.last() {
+                    return Some(p.ident.to_string().to_owned());
+                }
+            }
+            None
+        })
+        .collect::<Vec<String>>();
+
+    assert!(
+        args.len() > 0,
+        "arguments not found! generate_array_type(<network-name>)"
+    );
+
+    let no_asc_name = if name.to_string().to_uppercase().starts_with("ASC") {
+        name.to_string()[3..].to_owned()
+    } else {
+        name.to_string()
+    };
+
+    let index_asc_type_id_array = format!("{}{}Array", args[0], no_asc_name)
+        .parse::<proc_macro2::TokenStream>()
+        .unwrap();
+
+    quote! {
+        #item_struct
+
+        #[automatically_derived]
+        pub struct #asc_name_array(pub  graph_runtime_wasm::asc_abi::class::Array<graph::runtime::AscPtr<#asc_name>>);
+
+        impl graph::runtime::ToAscObj<#asc_name_array> for Vec<#name> {
+            fn to_asc_obj<H: graph::runtime::AscHeap + ?Sized>(
+                &self,
+                heap: &mut H,
+                gas: &graph::runtime::gas::GasCounter,
+            ) -> Result<#asc_name_array, graph::runtime::DeterministicHostError> {
+                let content: Result<Vec<_>, _> = self.iter().map(|x| graph::runtime::asc_new(heap, x, gas)).collect();
+
+                Ok(#asc_name_array(graph_runtime_wasm::asc_abi::class::Array::new(&content?, heap, gas)?))
+            }
+        }
+
+        impl graph::runtime::AscType for #asc_name_array {
+            fn to_asc_bytes(&self) -> Result<Vec<u8>, graph::runtime::DeterministicHostError> {
+                self.0.to_asc_bytes()
+            }
+
+            fn from_asc_bytes(
+                asc_obj: &[u8],
+                api_version: &graph::semver::Version,
+            ) -> Result<Self, graph::runtime::DeterministicHostError> {
+                Ok(Self(graph_runtime_wasm::asc_abi::class::Array::from_asc_bytes(asc_obj, api_version)?))
+            }
+        }
+
+        #[automatically_derived]
+        impl graph::runtime::AscIndexId for #asc_name_array {
+            const INDEX_ASC_TYPE_ID: graph::runtime::IndexForAscTypeId = graph::runtime::IndexForAscTypeId::#index_asc_type_id_array ;
+        }
+
+    }
+    .into()
+}
diff --git a/runtime/derive/src/generate_asc_type.rs b/runtime/derive/src/generate_asc_type.rs
new file mode 100644
index 0000000..0d133a3
--- /dev/null
+++ b/runtime/derive/src/generate_asc_type.rs
@@ -0,0 +1,172 @@
+use proc_macro::TokenStream;
+use proc_macro2::{Ident, Span};
+use quote::quote;
+use syn::{self, parse_macro_input, Field, ItemStruct};
+
+pub fn generate_asc_type(metadata: TokenStream, input: TokenStream) -> TokenStream {
+    let item_struct = parse_macro_input!(input as ItemStruct);
+    let args = parse_macro_input!(metadata as super::Args);
+
+    let name = item_struct.ident.clone();
+    let asc_name = Ident::new(&format!("Asc{}", name.to_string()), Span::call_site());
+
+    let enum_names = args
+        .vars
+        .iter()
+        .filter(|f| f.ident.to_string() != super::REQUIRED_IDENT_NAME)
+        .map(|f| f.ident.to_string())
+        .collect::<Vec<String>>();
+
+    //struct's fields -> need to skip enum fields
+    let mut fields = item_struct
+        .fields
+        .iter()
+        .filter(|f| !enum_names.contains(&f.ident.as_ref().unwrap().to_string()))
+        .collect::<Vec<&Field>>();
+
+    //extend fields list with enum's variants
+    args.vars
+        .iter()
+        .filter(|f| f.ident.to_string() != super::REQUIRED_IDENT_NAME)
+        .flat_map(|f| f.fields.named.iter())
+        .for_each(|f| fields.push(f));
+
+    let m_fields: Vec<proc_macro2::TokenStream> = fields
+        .iter()
+        .map(|f| {
+            let fld_name = f.ident.clone().unwrap();
+            let typ = field_type_map(field_type(f));
+            let fld_type = typ.parse::<proc_macro2::TokenStream>().unwrap();
+
+            quote! {
+                pub #fld_name : #fld_type ,
+            }
+        })
+        .collect();
+
+    let expanded = quote! {
+
+        #item_struct
+
+        #[automatically_derived]
+
+        #[repr(C)]
+        #[derive(graph_runtime_derive::AscType)]
+        #[derive(Debug, Default)]
+        pub struct #asc_name {
+            #(#m_fields)*
+        }
+    };
+
+    expanded.into()
+}
+
+fn is_scalar(nm: &str) -> bool {
+    match nm {
+        "i8" | "u8" => true,
+        "i16" | "u16" => true,
+        "i32" | "u32" => true,
+        "i64" | "u64" => true,
+        "usize" | "isize" => true,
+        "bool" => true,
+        _ => false,
+    }
+}
+
+fn field_type_map(tp: String) -> String {
+    if is_scalar(&tp) {
+        tp
+    } else {
+        match tp.as_ref() {
+            "String" => "graph_runtime_wasm::asc_abi::class::AscString".into(),
+            _ => tp.to_owned(),
+        }
+    }
+}
+
+fn field_type(fld: &syn::Field) -> String {
+    if let syn::Type::Path(tp) = &fld.ty {
+        if let Some(ps) = tp.path.segments.last() {
+            let name = ps.ident.to_string();
+            //TODO - this must be optimized
+            match name.as_ref() {
+                "Vec" => match &ps.arguments {
+                    syn::PathArguments::AngleBracketed(v) => {
+                        if let syn::GenericArgument::Type(syn::Type::Path(p)) = &v.args[0] {
+                            let nm = path_to_string(&p.path);
+
+                            match nm.as_ref(){
+                                    "u8" => "graph::runtime::AscPtr<graph_runtime_wasm::asc_abi::class::Uint8Array>".to_owned(),
+                                    "Vec<u8>" => "graph::runtime::AscPtr<crate::protobuf::AscBytesArray>".to_owned(),
+                                    "String" => "graph::runtime::AscPtr<crate::protobuf::Array<graph::runtime::AscPtr<graph_runtime_wasm::asc_abi::class::AscString>>>".to_owned(),
+                                    _ => format!("graph::runtime::AscPtr<crate::protobuf::Asc{}Array>", path_to_string(&p.path))
+                                }
+                        } else {
+                            name
+                        }
+                    }
+
+                    syn::PathArguments::None => name,
+                    syn::PathArguments::Parenthesized(_v) => {
+                        panic!("syn::PathArguments::Parenthesized is not implemented")
+                    }
+                },
+                "Option" => match &ps.arguments {
+                    syn::PathArguments::AngleBracketed(v) => {
+                        if let syn::GenericArgument::Type(syn::Type::Path(p)) = &v.args[0] {
+                            let tp_nm = path_to_string(&p.path);
+                            if is_scalar(&tp_nm) {
+                                format!("Option<{}>", tp_nm)
+                            } else {
+                                format!("graph::runtime::AscPtr<crate::protobuf::Asc{}>", tp_nm)
+                            }
+                        } else {
+                            name
+                        }
+                    }
+
+                    syn::PathArguments::None => name,
+                    syn::PathArguments::Parenthesized(_v) => {
+                        panic!("syn::PathArguments::Parenthesized is not implemented")
+                    }
+                },
+                "String" => {
+                    //format!("graph::runtime::AscPtr<Asc{}>", name)
+                    "graph::runtime::AscPtr<graph_runtime_wasm::asc_abi::class::AscString>"
+                        .to_owned()
+                }
+
+                _ => {
+                    if is_scalar(&name) {
+                        name
+                    } else {
+                        format!("graph::runtime::AscPtr<Asc{}>", name)
+                    }
+                }
+            }
+        } else {
+            "N/A".into()
+        }
+    } else {
+        "N/A".into()
+    }
+}
+
+//recursive
+fn path_to_string(path: &syn::Path) -> String {
+    if let Some(ps) = path.segments.last() {
+        let nm = ps.ident.to_string();
+
+        if let syn::PathArguments::AngleBracketed(v) = &ps.arguments {
+            if let syn::GenericArgument::Type(syn::Type::Path(p)) = &v.args[0] {
+                format!("{}<{}>", nm, path_to_string(&p.path))
+            } else {
+                nm
+            }
+        } else {
+            nm
+        }
+    } else {
+        panic!("path_to_string - can't get last segment!")
+    }
+}
diff --git a/runtime/derive/src/generate_from_rust_type.rs b/runtime/derive/src/generate_from_rust_type.rs
new file mode 100644
index 0000000..a21de91
--- /dev/null
+++ b/runtime/derive/src/generate_from_rust_type.rs
@@ -0,0 +1,233 @@
+use proc_macro::TokenStream;
+use proc_macro2::{Ident, Span};
+use quote::quote;
+use syn::{self, parse_macro_input, Field, ItemStruct};
+
+pub fn generate_from_rust_type(metadata: TokenStream, input: TokenStream) -> TokenStream {
+    let item_struct = parse_macro_input!(input as ItemStruct);
+    let args = parse_macro_input!(metadata as super::Args);
+
+    let enum_names = args
+        .vars
+        .iter()
+        .filter(|f| f.ident.to_string() != super::REQUIRED_IDENT_NAME)
+        .map(|f| f.ident.to_string())
+        .collect::<Vec<String>>();
+
+    let required_flds = args
+        .vars
+        .iter()
+        .filter(|f| f.ident.to_string() == super::REQUIRED_IDENT_NAME)
+        .flat_map(|f| f.fields.named.iter())
+        .map(|f| f.ident.as_ref().unwrap().to_string())
+        .collect::<Vec<String>>();
+
+    //struct's standard fields
+    let fields = item_struct
+        .fields
+        .iter()
+        .filter(|f| {
+            let nm = f.ident.as_ref().unwrap().to_string();
+            !enum_names.contains(&nm) && !nm.starts_with("_")
+        })
+        .collect::<Vec<&Field>>();
+
+    //struct's enum fields
+    let enum_fields = item_struct
+        .fields
+        .iter()
+        .filter(|f| enum_names.contains(&f.ident.as_ref().unwrap().to_string()))
+        .collect::<Vec<&Field>>();
+
+    //module name
+    let mod_name = Ident::new(
+        &format!("__{}__", item_struct.ident.to_string().to_lowercase()),
+        item_struct.ident.span(),
+    );
+
+    let name = item_struct.ident.clone();
+    let asc_name = Ident::new(&format!("Asc{}", name.to_string()), Span::call_site());
+
+    //generate enum fields validator
+    let enum_validation = enum_fields.iter().map(|f|{
+        let fld_name = f.ident.as_ref().unwrap(); //empty, maybe call it "sum"?
+        let type_nm = format!("\"{}\"", name.to_string()).parse::<proc_macro2::TokenStream>().unwrap();
+        let fld_nm = format!("\"{}\"", fld_name.to_string()).to_string().parse::<proc_macro2::TokenStream>().unwrap();
+
+        quote! {
+            let #fld_name = self.#fld_name.as_ref()
+                .ok_or_else(||  graph::runtime::DeterministicHostError::from(anyhow::anyhow!("{} missing {}", #type_nm, #fld_nm)))?;
+            }
+    });
+
+    let mut methods:Vec<proc_macro2::TokenStream> =
+        fields.iter().map(|f| {
+            let fld_name = f.ident.as_ref().unwrap();
+            let self_ref =
+                if is_byte_array(f){
+                    quote! { graph_runtime_wasm::asc_abi::class::Bytes(&self.#fld_name) }
+                }else{
+                    quote!{ self.#fld_name }
+                };
+
+            let is_required = is_required(f, &required_flds);
+
+            let setter =
+                if is_nullable(&f) {
+                    if is_required{
+                        let type_nm = format!("\"{}\"", name.to_string()).parse::<proc_macro2::TokenStream>().unwrap();
+                        let fld_nm = format!("\"{}\"", fld_name.to_string()).parse::<proc_macro2::TokenStream>().unwrap();
+
+                        quote! {
+                            #fld_name: graph::runtime::asc_new_or_missing(heap, &#self_ref, gas, #type_nm, #fld_nm)?,
+                        }
+                    }else{
+                        quote! {
+                            #fld_name: graph::runtime::asc_new_or_null(heap, &#self_ref, gas)?,
+                        }
+                    }
+                } else {
+                    if is_scalar(&field_type(f)){
+                        quote!{
+                            #fld_name: #self_ref,
+                        }
+                    }else{
+                        quote! {
+                            #fld_name: graph::runtime::asc_new(heap, &#self_ref, gas)?,
+                        }
+                    }
+                };
+            setter
+        })
+        .collect();
+
+    for var in args.vars {
+        let var_nm = var.ident.to_string();
+        if var_nm == super::REQUIRED_IDENT_NAME {
+            continue;
+        }
+
+        let mut c = var_nm.chars();
+        let var_type_name = c.next().unwrap().to_uppercase().collect::<String>() + c.as_str();
+
+        var.fields.named.iter().map(|f|{
+
+            let fld_nm = f.ident.as_ref().unwrap();
+            let var_nm = var.ident.clone();
+
+            use heck::{ToUpperCamelCase, ToSnakeCase};
+
+            let varian_type_name = fld_nm.to_string().to_upper_camel_case();
+            let mod_name = item_struct.ident.to_string().to_snake_case();
+            let varian_type_name = format!("{}::{}::{}",mod_name, var_type_name, varian_type_name).parse::<proc_macro2::TokenStream>().unwrap();
+
+            let setter =
+                if is_byte_array(f){
+                    quote! {
+                        #fld_nm: if let #varian_type_name(v) = #var_nm {graph::runtime::asc_new(heap, &graph_runtime_wasm::asc_abi::class::Bytes(v), gas)? } else {graph::runtime::AscPtr::null()},
+                    }
+                }else{
+                    quote! {
+                        #fld_nm: if let #varian_type_name(v) = #var_nm {graph::runtime::asc_new(heap, v, gas)? } else {graph::runtime::AscPtr::null()},
+                    }
+                };
+
+            setter
+        })
+        .for_each(|ts| methods.push(ts));
+    }
+
+    let expanded = quote! {
+        #item_struct
+
+        #[automatically_derived]
+        mod #mod_name{
+            use super::*;
+
+            use crate::protobuf::*;
+
+            impl graph::runtime::ToAscObj<#asc_name> for #name {
+
+                #[allow(unused_variables)]
+                fn to_asc_obj<H: graph::runtime::AscHeap + ?Sized>(
+                    &self,
+                    heap: &mut H,
+                    gas: &graph::runtime::gas::GasCounter,
+                ) -> Result<#asc_name, graph::runtime::DeterministicHostError> {
+
+                    #(#enum_validation)*
+
+                    Ok(
+                         #asc_name {
+                            #(#methods)*
+                            ..Default::default()
+                        }
+                    )
+                }
+            }
+        } // -------- end of mod
+
+
+    };
+
+    expanded.into()
+}
+
+fn is_scalar(fld: &str) -> bool {
+    match fld {
+        "i8" | "u8" => true,
+        "i16" | "u16" => true,
+        "i32" | "u32" => true,
+        "i64" | "u64" => true,
+        "usize" | "isize" => true,
+        "bool" => true,
+        _ => false,
+    }
+}
+
+fn field_type(fld: &syn::Field) -> String {
+    if let syn::Type::Path(tp) = &fld.ty {
+        if let Some(ps) = tp.path.segments.last() {
+            return ps.ident.to_string();
+        } else {
+            "N/A".into()
+        }
+    } else {
+        "N/A".into()
+    }
+}
+
+fn is_required(fld: &syn::Field, req_list: &[String]) -> bool {
+    let fld_name = fld.ident.as_ref().unwrap().to_string();
+    req_list.iter().find(|r| *r == &fld_name).is_some()
+}
+
+fn is_nullable(fld: &syn::Field) -> bool {
+    if let syn::Type::Path(tp) = &fld.ty {
+        if let Some(last) = tp.path.segments.last() {
+            return last.ident == "Option";
+        }
+    }
+    false
+}
+
+fn is_byte_array(fld: &syn::Field) -> bool {
+    if let syn::Type::Path(tp) = &fld.ty {
+        if let Some(last) = tp.path.segments.last() {
+            if last.ident == "Vec" {
+                if let syn::PathArguments::AngleBracketed(ref v) = last.arguments {
+                    if let Some(last) = v.args.last() {
+                        if let syn::GenericArgument::Type(t) = last {
+                            if let syn::Type::Path(p) = t {
+                                if let Some(a) = p.path.segments.last() {
+                                    return a.ident == "u8";
+                                }
+                            }
+                        }
+                    }
+                }
+            }
+        }
+    }
+    false
+}
diff --git a/runtime/derive/src/generate_network_type_id.rs b/runtime/derive/src/generate_network_type_id.rs
new file mode 100644
index 0000000..1b66ca8
--- /dev/null
+++ b/runtime/derive/src/generate_network_type_id.rs
@@ -0,0 +1,56 @@
+use proc_macro::TokenStream;
+use proc_macro2::{Ident, Span};
+use quote::quote;
+use syn::{self, parse_macro_input, AttributeArgs, ItemStruct, Meta, NestedMeta, Path};
+
+pub fn generate_network_type_id(metadata: TokenStream, input: TokenStream) -> TokenStream {
+    let item_struct = parse_macro_input!(input as ItemStruct);
+    let name = item_struct.ident.clone();
+
+    let asc_name = if name.to_string().to_uppercase().starts_with("ASC") {
+        name.clone()
+    } else {
+        Ident::new(&format!("Asc{}", name.to_string()), Span::call_site())
+    };
+
+    let no_asc_name = if name.to_string().to_uppercase().starts_with("ASC") {
+        name.to_string()[3..].to_owned()
+    } else {
+        name.to_string()
+    };
+
+    let args = parse_macro_input!(metadata as AttributeArgs);
+
+    let args = args
+        .iter()
+        .filter_map(|a| {
+            if let NestedMeta::Meta(Meta::Path(Path { segments, .. })) = a {
+                if let Some(p) = segments.last() {
+                    return Some(p.ident.to_string().to_owned());
+                }
+            }
+            None
+        })
+        .collect::<Vec<String>>();
+
+    assert!(
+        args.len() > 0,
+        "arguments not found! generate_network_type_id(<network-name>)"
+    );
+
+    //type_id variant name
+    let index_asc_type_id = format!("{}{}", args[0], no_asc_name)
+        .parse::<proc_macro2::TokenStream>()
+        .unwrap();
+
+    let expanded = quote! {
+        #item_struct
+
+        #[automatically_derived]
+        impl graph::runtime::AscIndexId for #asc_name {
+            const INDEX_ASC_TYPE_ID: graph::runtime::IndexForAscTypeId = graph::runtime::IndexForAscTypeId::#index_asc_type_id ;
+        }
+    };
+
+    expanded.into()
+}
diff --git a/runtime/derive/src/lib.rs b/runtime/derive/src/lib.rs
new file mode 100644
index 0000000..f95c11f
--- /dev/null
+++ b/runtime/derive/src/lib.rs
@@ -0,0 +1,446 @@
+#![recursion_limit = "128"]
+
+extern crate proc_macro;
+
+use proc_macro::TokenStream;
+use quote::quote;
+use syn::{
+    parse::{Parse, ParseStream},
+    Fields, FieldsNamed, Ident, Item, ItemEnum, ItemStruct, Token,
+};
+
+const REQUIRED_IDENT_NAME: &str = "__required__";
+
+struct Args {
+    vars: Vec<ArgsField>,
+}
+
+struct ArgsField {
+    ident: Ident,
+    fields: FieldsNamed,
+}
+
+impl Parse for Args {
+    fn parse(input: ParseStream) -> syn::Result<Self> {
+        let mut idents = Vec::<ArgsField>::new();
+
+        while input.peek(syn::Ident) {
+            let ident = input.call(Ident::parse)?;
+            idents.push(ArgsField {
+                ident,
+                fields: input.call(FieldsNamed::parse)?,
+            });
+            let _: Option<Token![,]> = input.parse()?;
+        }
+
+        Ok(Args { vars: idents })
+    }
+}
+
+#[derive(Debug)]
+struct TypeParam(syn::Ident);
+
+impl syn::parse::Parse for TypeParam {
+    fn parse(input: syn::parse::ParseStream) -> syn::Result<Self> {
+        let content;
+        syn::parenthesized!(content in input);
+        let typ = content.parse()?;
+        Ok(TypeParam(typ))
+    }
+}
+
+#[derive(Debug)]
+struct TypeParamList(Vec<syn::Ident>);
+
+impl syn::parse::Parse for TypeParamList {
+    fn parse(input: syn::parse::ParseStream) -> syn::Result<Self> {
+        let content;
+        syn::parenthesized!(content in input);
+
+        let mut params: Vec<syn::Ident> = Vec::new();
+
+        while !content.is_empty() {
+            let typ = content.parse()?;
+            params.push(typ);
+
+            if !content.is_empty() {
+                let _comma: syn::Token![,] = content.parse()?;
+            }
+        }
+
+        Ok(TypeParamList(params))
+    }
+}
+
+//generates graph::runtime::ToAscObj implementation for the type
+//takes optional optional list of required fields '__required__{name:TypeName}' and enumerations field decraration with types, i.e. sum{single: ModeInfoSingle,multi: ModeInfoMulti}
+//intended use is in build.rs with tonic_build's type_attribute(<...>, <...>) to generate type implementation of graph::runtime::ToAscObj
+//Annotation example:
+//#[graph_runtime_derive::generate_from_rust_type(...)]
+// pub struct MyMessageType {
+//    ..
+// }
+//the above annotation will produce following implementation
+//  impl graph::runtime::ToAscObj<AscMyMessageType> for MyMessageType {
+//    ...
+//  }
+mod generate_from_rust_type;
+#[proc_macro_attribute]
+pub fn generate_from_rust_type(args: TokenStream, input: TokenStream) -> TokenStream {
+    generate_from_rust_type::generate_from_rust_type(args, input)
+}
+
+//generates graph::runtime::AscIndexId implementation for the type
+//takes required network name attribute to form variant name graph::runtime::IndexForAscTypeId::<NetworkName>+<TypeName>
+//Annotation example:
+//#[graph_runtime_derive::generate_network_type_id(Cosmos)]
+// pub struct MyMessageType {
+//    ..
+// }
+//the above annotation will produce following implementation
+//  impl graph::runtime::AscIndexId for AscMyMessageType {
+//     const INDEX_ASC_TYPE_ID: graph::runtime::IndexForAscTypeId = graph::runtime::IndexForAscTypeId::CosmosMyMessageType ;
+//  }
+
+mod generate_network_type_id;
+#[proc_macro_attribute]
+pub fn generate_network_type_id(args: TokenStream, input: TokenStream) -> TokenStream {
+    generate_network_type_id::generate_network_type_id(args, input)
+}
+
+//generates AscType for Type. Takes optional list of non-optional field+type
+//Annotation example:
+//#[graph_runtime_derive::generate_asc_type(non-optional-field-name: non-optional-field-type,...)]
+// pub struct MyMessageType {
+//    ..
+// }
+//the above annotation will produce following implementation
+// #[repr(C)]
+// #[derive(graph_runtime_derive::AscType)]
+// #[derive(Debug, Default)]
+// pub struct AscMyMessageType {
+//    ...
+// }
+//
+//Note: this macro makes heavy reliance on types to be available via crate::protobuf (network chain crate root/src/protobuf/lib.rs)
+//please see usage exmple in chain::cosmos crate... lib.rs imports generates protobuf bindings, as well as any other needed types
+mod generate_asc_type;
+#[proc_macro_attribute]
+pub fn generate_asc_type(args: TokenStream, input: TokenStream) -> TokenStream {
+    generate_asc_type::generate_asc_type(args, input)
+}
+
+//generates array type for a type.
+//Annotation example:
+// #[graph_runtime_derive::generate_array_type(<network name, i.e. Cosmos>>)]
+// pub struct MyMessageType {
+//    ..
+// }
+//the above annoation will generate code for MyMessageType type
+//Example:
+//  pub struct AscMyMessageTypeArray(pub  graph_runtime_wasm::asc_abi::class::Array<graph::runtime::AscPtr<AscMyMessageType>>)
+//where "AscMyMessageTypeArray" is an array type for "AscMyMessageType" (AscMyMessageType is generated by asc_type derive macro above)
+//Macro, also, will generate code for the following 3 trait implementations
+//1. graph::runtime::ToAscObj trait
+//Example:
+//  impl graph::runtime::ToAscObj<AscMyMessageTypeArray> for Vec<AscMyMessageType> {
+//     ...
+//  }
+//2. graph::runtime::AscType
+//Example:
+//  impl graph::runtime::AscType for AscMyMessageTypeArray {
+//    ...
+//    }
+//3. graph::runtime::AscIndexId (adding expected <NetworkName><BaseType>>Array (CosmosMyMessageTypeArray)  variant to graph::runtime::IndexForAscTypeId is manual step)
+//impl graph::runtime::AscIndexId for MyMessageTypeArray {
+//    const INDEX_ASC_TYPE_ID: graph::runtime::IndexForAscTypeId = graph::runtime::IndexForAscTypeId::CosmosMyMessageTypeArray ;
+//}
+mod generate_array_type;
+#[proc_macro_attribute]
+pub fn generate_array_type(args: TokenStream, input: TokenStream) -> TokenStream {
+    generate_array_type::generate_array_type(args, input)
+}
+
+#[proc_macro_derive(AscType)]
+pub fn asc_type_derive(input: TokenStream) -> TokenStream {
+    let item: Item = syn::parse(input).unwrap();
+    match item {
+        Item::Struct(item_struct) => asc_type_derive_struct(item_struct),
+        Item::Enum(item_enum) => asc_type_derive_enum(item_enum),
+        _ => panic!("AscType can only be derived for structs and enums"),
+    }
+}
+
+// Example input:
+// #[repr(C)]
+// #[derive(AscType)]
+// struct AscTypedMapEntry<K, V> {
+//     pub key: AscPtr<K>,
+//     pub value: AscPtr<V>,
+// }
+//
+// Example output:
+// impl<K, V> graph::runtime::AscType for AscTypedMapEntry<K, V> {
+//     fn to_asc_bytes(&self) -> Vec<u8> {
+//         let mut bytes = Vec::new();
+//         bytes.extend_from_slice(&self.key.to_asc_bytes());
+//         bytes.extend_from_slice(&self.value.to_asc_bytes());
+//         assert_eq!(&bytes.len(), &size_of::<Self>());
+//         bytes
+//     }
+
+//     #[allow(unused_variables)]
+//     fn from_asc_bytes(asc_obj: &[u8], api_version: graph::semver::Version) -> Self {
+//         assert_eq!(&asc_obj.len(), &size_of::<Self>());
+//         let mut offset = 0;
+//         let field_size = std::mem::size_of::<AscPtr<K>>();
+//         let key = graph::runtime::AscType::from_asc_bytes(&asc_obj[offset..(offset + field_size)],
+//         api_version.clone());
+//         offset += field_size;
+//         let field_size = std::mem::size_of::<AscPtr<V>>();
+//         let value = graph::runtime::AscType::from_asc_bytes(&asc_obj[offset..(offset + field_size)], api_version);
+//         offset += field_size;
+//         Self { key, value }
+//     }
+// }
+//
+// padding logic inspired by:
+// https://doc.rust-lang.org/reference/type-layout.html#reprc-structs
+//
+// start with offset 0
+// for each field:
+//     * if offset is not multiple of field alignment add padding bytes with size needed to fill
+//     the gap to the next alignment multiple: alignment - (offset % alignment)
+//     * increase offset by size of padding, if any
+//     * increase offset by size of field bytes
+//     * keep track of maximum field alignment to determine alignment of struct
+// if end offset is not multiple of struct alignment add padding field with required size.
+fn asc_type_derive_struct(item_struct: ItemStruct) -> TokenStream {
+    let struct_name = &item_struct.ident;
+    let (impl_generics, ty_generics, where_clause) = item_struct.generics.split_for_impl();
+    let field_names: Vec<_> = match &item_struct.fields {
+        Fields::Named(fields) => fields
+            .named
+            .iter()
+            .map(|field| field.ident.as_ref().unwrap())
+            .collect(),
+        _ => panic!("AscType can only be derived for structs with named fields"),
+    };
+    let field_names2 = field_names.clone();
+    let field_names3 = field_names.clone();
+    let field_types = match &item_struct.fields {
+        Fields::Named(fields) => fields.named.iter().map(|field| &field.ty),
+        _ => panic!("AscType can only be derived for structs with named fields"),
+    };
+    let field_types2 = field_types.clone();
+
+    // if no fields, return immediately
+    let (no_fields_return_bytes, no_fields_return_self) = if field_names.is_empty() {
+        (
+            quote! {
+                #![allow(unreachable_code)]
+                return Ok(Vec::new());
+            },
+            quote! {
+                #![allow(unreachable_code)]
+                return Ok(Self {});
+            },
+        )
+    } else {
+        (quote! {}, quote! {})
+    };
+
+    TokenStream::from(quote! {
+        impl #impl_generics graph::runtime::AscType for #struct_name #ty_generics #where_clause {
+            fn to_asc_bytes(&self) -> Result<Vec<u8>, graph::runtime::DeterministicHostError> {
+                #no_fields_return_bytes
+
+                let in_memory_byte_count = std::mem::size_of::<Self>();
+                let mut bytes = Vec::with_capacity(in_memory_byte_count);
+
+                let mut offset = 0;
+                // max field alignment will also be struct alignment which we need to pad the end
+                let mut max_align = 0;
+
+                #(
+                    let field_align = std::mem::align_of::<#field_types>();
+                    let misalignment = offset % field_align;
+
+                    if misalignment > 0 {
+                        let padding_size = field_align - misalignment;
+
+                        bytes.extend_from_slice(&vec![0; padding_size]);
+
+                        offset += padding_size;
+                    }
+
+                    let field_bytes = self.#field_names.to_asc_bytes()?;
+
+                    bytes.extend_from_slice(&field_bytes);
+
+                    offset += field_bytes.len();
+
+                    if max_align < field_align {
+                        max_align = field_align;
+                    }
+                )*
+
+                // pad end of struct data if needed
+                let struct_misalignment = offset % max_align;
+
+                if struct_misalignment > 0 {
+                    let padding_size = max_align - struct_misalignment;
+
+                    bytes.extend_from_slice(&vec![0; padding_size]);
+                }
+
+                // **Important** AssemblyScript and `repr(C)` in Rust does not follow exactly
+                // the same rules always. One caveats is that some struct are packed in AssemblyScript
+                // but padded for alignment in `repr(C)` like a struct `{ one: AscPtr, two: AscPtr, three: AscPtr, four: u64 }`,
+                // it appears this struct is always padded in `repr(C)` by Rust whatever order is tried.
+                // However, it's possible to packed completely this struct in AssemblyScript and avoid
+                // any padding.
+                //
+                // To overcome those cases where re-ordering never work, you will need to add an explicit
+                // _padding field to account for missing padding and pass this check.
+                assert_eq!(bytes.len(), in_memory_byte_count, "Alignment mismatch for {}, re-order fields or explicitely add a _padding field", stringify!(#struct_name));
+                Ok(bytes)
+            }
+
+            #[allow(unused_variables)]
+            fn from_asc_bytes(asc_obj: &[u8], api_version: &graph::semver::Version) -> Result<Self, graph::runtime::DeterministicHostError> {
+                #no_fields_return_self
+
+                // Sanity check
+                match api_version {
+                    api_version if *api_version <= graph::semver::Version::new(0, 0, 4) => {
+                        // This was using an double equal sign before instead of less than.
+                        // This happened because of the new apiVersion support.
+                        // Since some structures need different implementations for each
+                        // version, their memory size got bigger because we're using an enum
+                        // that contains both versions (each in a variant), and that increased
+                        // the memory size, so that's why we use less than.
+                        if asc_obj.len() < std::mem::size_of::<Self>() {
+                            return Err(graph::runtime::DeterministicHostError::from(graph::prelude::anyhow::anyhow!("Size does not match")));
+                        }
+                    }
+                    _ => {
+                        let content_size = std::mem::size_of::<Self>();
+                        let aligned_size = graph::runtime::padding_to_16(content_size);
+
+                        if graph::runtime::HEADER_SIZE + asc_obj.len() == aligned_size + content_size {
+                            return Err(graph::runtime::DeterministicHostError::from(graph::prelude::anyhow::anyhow!("Size does not match")));
+                        }
+                    },
+                };
+
+                let mut offset = 0;
+
+                #(
+                    // skip padding
+                    let field_align = std::mem::align_of::<#field_types2>();
+                    let misalignment = offset % field_align;
+                    if misalignment > 0 {
+                        let padding_size = field_align - misalignment;
+
+                        offset += padding_size;
+                    }
+
+                    let field_size = std::mem::size_of::<#field_types2>();
+                    let field_data = asc_obj.get(offset..(offset + field_size)).ok_or_else(|| {
+                        graph::runtime::DeterministicHostError::from(graph::prelude::anyhow::anyhow!("Attempted to read past end of array"))
+                    })?;
+                    let #field_names2 = graph::runtime::AscType::from_asc_bytes(&field_data, api_version)?;
+                    offset += field_size;
+                )*
+
+                Ok(Self {
+                    #(#field_names3,)*
+                })
+            }
+        }
+    })
+}
+
+// Example input:
+// #[repr(u32)]
+// #[derive(AscType)]
+// enum JsonValueKind {
+//     Null,
+//     Bool,
+//     Number,
+//     String,
+//     Array,
+//     Object,
+// }
+//
+// Example output:
+// impl graph::runtime::AscType for JsonValueKind {
+//     fn to_asc_bytes(&self) -> Result<Vec<u8>, graph::runtime::DeterministicHostError> {
+//         let discriminant: u32 = match *self {
+//             JsonValueKind::Null => 0u32,
+//             JsonValueKind::Bool => 1u32,
+//             JsonValueKind::Number => 2u32,
+//             JsonValueKind::String => 3u32,
+//             JsonValueKind::Array => 4u32,
+//             JsonValueKind::Object => 5u32,
+//         };
+//         Ok(discriminant.to_asc_bytes())
+//     }
+//
+//     fn from_asc_bytes(asc_obj: &[u8], _api_version: graph::semver::Version) -> Result<Self, graph::runtime::DeterministicHostError> {
+//         let mut u32_bytes: [u8; size_of::<u32>()] = [0; size_of::<u32>()];
+//         if std::mem::size_of_val(&u32_bytes) != std::mem::size_of_val(&asc_obj) {
+//             return Err(graph::runtime::DeterministicHostError::from(graph::prelude::anyhow::anyhow!("Invalid asc bytes size")));
+//         }
+//         u32_bytes.copy_from_slice(&asc_obj);
+//         let discr = u32::from_le_bytes(u32_bytes);
+//         match discr {
+//             0u32 => JsonValueKind::Null,
+//             1u32 => JsonValueKind::Bool,
+//             2u32 => JsonValueKind::Number,
+//             3u32 => JsonValueKind::String,
+//             4u32 => JsonValueKind::Array,
+//             5u32 => JsonValueKind::Object,
+//             _ => Err(graph::runtime::DeterministicHostError::from(graph::prelude::anyhow::anyhow!("value {} is out of range for {}", discr, "JsonValueKind"))),
+//         }
+//     }
+// }
+fn asc_type_derive_enum(item_enum: ItemEnum) -> TokenStream {
+    let enum_name = &item_enum.ident;
+    let enum_name_iter = std::iter::repeat(enum_name);
+    let enum_name_iter2 = enum_name_iter.clone();
+    let (impl_generics, ty_generics, where_clause) = item_enum.generics.split_for_impl();
+    let variant_paths: Vec<_> = item_enum
+        .variants
+        .iter()
+        .map(|v| {
+            assert!(v.discriminant.is_none());
+            &v.ident
+        })
+        .collect();
+    let variant_paths2 = variant_paths.clone();
+    let variant_discriminant = 0..(variant_paths.len() as u32);
+    let variant_discriminant2 = variant_discriminant.clone();
+
+    TokenStream::from(quote! {
+        impl #impl_generics graph::runtime::AscType for #enum_name #ty_generics #where_clause {
+            fn to_asc_bytes(&self) -> Result<Vec<u8>, graph::runtime::DeterministicHostError> {
+                let discriminant: u32 = match self {
+                    #(#enum_name_iter::#variant_paths => #variant_discriminant,)*
+                };
+                discriminant.to_asc_bytes()
+            }
+
+            fn from_asc_bytes(asc_obj: &[u8], _api_version: &graph::semver::Version) -> Result<Self, graph::runtime::DeterministicHostError> {
+                let u32_bytes = ::std::convert::TryFrom::try_from(asc_obj)
+                    .map_err(|_| graph::runtime::DeterministicHostError::from(graph::prelude::anyhow::anyhow!("Invalid asc bytes size")))?;
+                let discr = u32::from_le_bytes(u32_bytes);
+                match discr {
+                    #(#variant_discriminant2 => Ok(#enum_name_iter2::#variant_paths2),)*
+                    _ => Err(graph::runtime::DeterministicHostError::from(graph::prelude::anyhow::anyhow!("value {} is out of range for {}", discr, stringify!(#enum_name))))
+                }
+            }
+        }
+    })
+}
diff --git a/runtime/test/Cargo.toml b/runtime/test/Cargo.toml
new file mode 100644
index 0000000..cd85bbc
--- /dev/null
+++ b/runtime/test/Cargo.toml
@@ -0,0 +1,19 @@
+[package]
+name = "graph-runtime-test"
+version = "0.27.0"
+edition = "2021"
+
+[dependencies]
+semver = "1.0"
+wasmtime = "0.27.0"
+graph = { path = "../../graph" }
+graph-chain-ethereum = { path = "../../chain/ethereum" }
+graph-runtime-wasm = { path = "../wasm" }
+graph-core = { path = "../../core" }
+graph-runtime-derive = { path = "../derive" }
+rand = "0.8.5"
+
+
+[dev-dependencies]
+test-store = { path = "../../store/test-store" }
+graph-mock = { path = "../../mock" }
diff --git a/runtime/test/README.md b/runtime/test/README.md
new file mode 100644
index 0000000..c555617
--- /dev/null
+++ b/runtime/test/README.md
@@ -0,0 +1,86 @@
+# Runtime tests
+
+These are the unit tests that check if the WASM runtime code is working. For now we only run code compiled from the [`AssemblyScript`](https://www.assemblyscript.org/) language, which is done by [`asc`](https://github.com/AssemblyScript/assemblyscript) (the AssemblyScript Compiler) in our [`CLI`](https://github.com/graphprotocol/graph-cli).
+
+We support two versions of their compiler/language for now:
+
+- [`v0.6`](https://github.com/AssemblyScript/assemblyscript/releases/tag/v0.6)
+- +[`v0.19.10`](https://github.com/AssemblyScript/assemblyscript/releases/tag/v0.19.10)
+
+Because the internal ABIs changed between these versions, the runtime was added, etc, we had to duplicate the source files used for the tests (`.ts` and `.wasm`).
+
+If you look into the [`wasm_test`](https://github.com/graphprotocol/graph-node/tree/master/runtime/test/wasm_test) folder you'll find two other folders:
+
+- [`api_version_0_0_4`](https://github.com/graphprotocol/graph-node/tree/master/runtime/test/wasm_test/api_version_0_0_4)
+- [`api_version_0_0_5`](https://github.com/graphprotocol/graph-node/tree/master/runtime/test/wasm_test/api_version_0_0_5)
+
+This is because the first one (`0.0.4` `apiVersion`) is related to the `v0.6` of `AssemblyScript` and the second (`0.0.5` `apiVersion`) to +`v0.19.10`.
+
+## How to change the `.ts`/`.wasm` files
+
+### Api Version 0.0.4
+
+First make sure your `asc` version is `v0.6`, to check use `asc --version`.
+
+To install the correct one use:
+
+```
+npm install -g AssemblyScript/assemblyscript#v0.6
+```
+
+And to compile/change the desired test use the command below (just rename the files to the correct ones):
+
+```
+asc wasm_test/api_version_0_0_4/abi_classes.ts -b wasm_test/api_version_0_0_4/abi_classes.wasm
+```
+
+### Api Version 0.0.5
+
+First make sure your `asc` version is +`v0.19.10`, to check use `asc --version`.
+
+To install the correct one use:
+
+```
+# for the precise one
+npm install -g assemblyscript@0.19.10
+
+# for the latest one, it should work as well
+npm install -g assemblyscript
+```
+
+And to compile/change the desired test use the command below (just rename the files to the correct ones):
+
+```
+asc --explicitStart --exportRuntime --runtime stub wasm_test/api_version_0_0_5/abi_classes.ts -b wasm_test/api_version_0_0_5/abi_classes.wasm
+```
+
+## Caveats
+
+### Api Version 0.0.4
+
+You'll always have to put this at the beginning of your `.ts` files:
+
+```typescript
+import "allocator/arena";
+
+export { memory };
+```
+
+So the runtime can use the allocator properly.
+
+### Api Version 0.0.5
+
+Since in this version we started:
+
+- Using the `--explicitStart` flag, that requires `__alloc(0)` to always be called before any global be defined
+- To add the necessary variants for `TypeId` and using on `id_of_type` function. References from [`here`](https://github.com/graphprotocol/graph-node/blob/8bef4c005f5b1357fe29ca091c9188e1395cc227/graph/src/runtime/mod.rs#L140)
+
+Instead of having to add this manually to all of the files, you can just import and re-export this [`common`](https://github.com/graphprotocol/graph-node/tree/master/runtime/test/wasm_test/api_version_0_0_5/common/global.ts) file like this:
+
+```typescript
+export * from './common/global'
+```
+
+And import the types you need from [`here`](https://github.com/graphprotocol/graph-node/tree/master/runtime/test/wasm_test/api_version_0_0_5/common/types.ts). If the type you need is missing, just add them there.
+
+This way the runtime can both properly generate the headers with proper class identifiers and do memory allocations.
diff --git a/runtime/test/src/common.rs b/runtime/test/src/common.rs
new file mode 100644
index 0000000..8b0d77b
--- /dev/null
+++ b/runtime/test/src/common.rs
@@ -0,0 +1,149 @@
+use ethabi::Contract;
+use graph::components::store::DeploymentLocator;
+use graph::data::subgraph::*;
+use graph::data_source;
+use graph::env::EnvVars;
+use graph::ipfs_client::IpfsClient;
+use graph::log;
+use graph::prelude::*;
+use graph_chain_ethereum::{
+    Chain, DataSource, DataSourceTemplate, Mapping, MappingABI, TemplateSource,
+};
+use graph_runtime_wasm::{HostExports, MappingContext};
+use semver::Version;
+use std::env;
+use std::str::FromStr;
+use web3::types::Address;
+
+lazy_static! {
+    pub static ref LOGGER: Logger = match env::var_os("GRAPH_LOG") {
+        Some(_) => log::logger(false),
+        None => Logger::root(slog::Discard, o!()),
+    };
+}
+
+fn mock_host_exports(
+    subgraph_id: DeploymentHash,
+    data_source: DataSource,
+    store: Arc<impl SubgraphStore>,
+    api_version: Version,
+) -> HostExports<Chain> {
+    let templates = vec![data_source::DataSourceTemplate::Onchain(
+        DataSourceTemplate {
+            kind: String::from("ethereum/contract"),
+            name: String::from("example template"),
+            manifest_idx: 0,
+            network: Some(String::from("mainnet")),
+            source: TemplateSource {
+                abi: String::from("foo"),
+            },
+            mapping: Mapping {
+                kind: String::from("ethereum/events"),
+                api_version,
+                language: String::from("wasm/assemblyscript"),
+                entities: vec![],
+                abis: vec![],
+                event_handlers: vec![],
+                call_handlers: vec![],
+                block_handlers: vec![],
+                link: Link {
+                    link: "link".to_owned(),
+                },
+                runtime: Arc::new(vec![]),
+            },
+        },
+    )];
+
+    let network = data_source.network.clone().unwrap();
+    let ens_lookup = store.ens_lookup();
+    HostExports::new(
+        subgraph_id,
+        &data_source::DataSource::Onchain(data_source),
+        network,
+        Arc::new(templates),
+        Arc::new(graph_core::LinkResolver::new(
+            vec![IpfsClient::localhost()],
+            Arc::new(EnvVars::default()),
+        )),
+        ens_lookup,
+    )
+}
+
+fn mock_abi() -> MappingABI {
+    MappingABI {
+        name: "mock_abi".to_string(),
+        contract: Contract::load(
+            r#"[
+            {
+                "inputs": [
+                    {
+                        "name": "a",
+                        "type": "address"
+                    }
+                ],
+                "type": "constructor"
+            }
+        ]"#
+            .as_bytes(),
+        )
+        .unwrap(),
+    }
+}
+
+pub fn mock_context(
+    deployment: DeploymentLocator,
+    data_source: DataSource,
+    store: Arc<impl SubgraphStore>,
+    api_version: Version,
+) -> MappingContext<Chain> {
+    MappingContext {
+        logger: Logger::root(slog::Discard, o!()),
+        block_ptr: BlockPtr {
+            hash: Default::default(),
+            number: 0,
+        },
+        host_exports: Arc::new(mock_host_exports(
+            deployment.hash.clone(),
+            data_source,
+            store.clone(),
+            api_version,
+        )),
+        state: BlockState::new(
+            futures03::executor::block_on(store.writable(LOGGER.clone(), deployment.id)).unwrap(),
+            Default::default(),
+        ),
+        proof_of_indexing: None,
+        host_fns: Arc::new(Vec::new()),
+        debug_fork: None,
+    }
+}
+
+pub fn mock_data_source(path: &str, api_version: Version) -> DataSource {
+    let runtime = std::fs::read(path).unwrap();
+
+    DataSource {
+        kind: String::from("ethereum/contract"),
+        name: String::from("example data source"),
+        manifest_idx: 0,
+        network: Some(String::from("mainnet")),
+        address: Some(Address::from_str("0123123123012312312301231231230123123123").unwrap()),
+        start_block: 0,
+        mapping: Mapping {
+            kind: String::from("ethereum/events"),
+            api_version,
+            language: String::from("wasm/assemblyscript"),
+            entities: vec![],
+            abis: vec![],
+            event_handlers: vec![],
+            call_handlers: vec![],
+            block_handlers: vec![],
+            link: Link {
+                link: "link".to_owned(),
+            },
+            runtime: Arc::new(runtime.clone()),
+        },
+        context: Default::default(),
+        creation_block: None,
+        contract_abi: Arc::new(mock_abi()),
+    }
+}
diff --git a/runtime/test/src/lib.rs b/runtime/test/src/lib.rs
new file mode 100644
index 0000000..9bdc7b7
--- /dev/null
+++ b/runtime/test/src/lib.rs
@@ -0,0 +1,13 @@
+#![cfg(test)]
+pub mod common;
+mod test;
+
+#[cfg(test)]
+pub mod test_padding;
+
+// this used in crate::test_padding module
+// graph_runtime_derive::generate_from_rust_type looks for types in crate::protobuf,
+// hence this mod presence in crate that uses ASC related macros is required
+pub mod protobuf {
+    pub use super::test_padding::data::*;
+}
diff --git a/runtime/test/src/test.rs b/runtime/test/src/test.rs
new file mode 100644
index 0000000..cad61b5
--- /dev/null
+++ b/runtime/test/src/test.rs
@@ -0,0 +1,1163 @@
+use graph::data::store::scalar;
+use graph::data::subgraph::*;
+use graph::prelude::web3::types::U256;
+use graph::prelude::*;
+use graph::runtime::{AscIndexId, AscType};
+use graph::runtime::{AscPtr, ToAscObj};
+use graph::{components::store::*, ipfs_client::IpfsClient};
+use graph_chain_ethereum::{Chain, DataSource};
+use graph_mock::MockMetricsRegistry;
+use graph_runtime_wasm::asc_abi::class::{Array, AscBigInt, AscEntity, AscString, Uint8Array};
+use graph_runtime_wasm::{ExperimentalFeatures, ValidModule, WasmInstance};
+use hex;
+use semver::Version;
+use std::collections::{BTreeMap, HashMap};
+use std::str::FromStr;
+use test_store::{LOGGER, STORE};
+use web3::types::H160;
+
+use crate::common::{mock_context, mock_data_source};
+
+mod abi;
+
+pub const API_VERSION_0_0_4: Version = Version::new(0, 0, 4);
+pub const API_VERSION_0_0_5: Version = Version::new(0, 0, 5);
+
+pub fn wasm_file_path(wasm_file: &str, api_version: Version) -> String {
+    format!(
+        "wasm_test/api_version_{}_{}_{}/{}",
+        api_version.major, api_version.minor, api_version.patch, wasm_file
+    )
+}
+
+fn subgraph_id_with_api_version(subgraph_id: &str, api_version: Version) -> String {
+    format!(
+        "{}_{}_{}_{}",
+        subgraph_id, api_version.major, api_version.minor, api_version.patch
+    )
+}
+
+async fn test_valid_module_and_store(
+    subgraph_id: &str,
+    data_source: DataSource,
+    api_version: Version,
+) -> (
+    WasmInstance<Chain>,
+    Arc<impl SubgraphStore>,
+    DeploymentLocator,
+) {
+    test_valid_module_and_store_with_timeout(subgraph_id, data_source, api_version, None).await
+}
+
+async fn test_valid_module_and_store_with_timeout(
+    subgraph_id: &str,
+    data_source: DataSource,
+    api_version: Version,
+    timeout: Option<Duration>,
+) -> (
+    WasmInstance<Chain>,
+    Arc<impl SubgraphStore>,
+    DeploymentLocator,
+) {
+    let logger = Logger::root(slog::Discard, o!());
+    let subgraph_id_with_api_version =
+        subgraph_id_with_api_version(subgraph_id, api_version.clone());
+
+    let store = STORE.clone();
+    let metrics_registry = Arc::new(MockMetricsRegistry::new());
+    let deployment_id = DeploymentHash::new(&subgraph_id_with_api_version).unwrap();
+    let deployment = test_store::create_test_subgraph(
+        &deployment_id,
+        "type User @entity {
+            id: ID!,
+            name: String,
+        }
+
+        type Thing @entity {
+            id: ID!,
+            value: String,
+            extra: String
+        }",
+    )
+    .await;
+    let stopwatch_metrics = StopwatchMetrics::new(
+        logger.clone(),
+        deployment_id.clone(),
+        "test",
+        metrics_registry.clone(),
+    );
+    let host_metrics = Arc::new(HostMetrics::new(
+        metrics_registry,
+        deployment_id.as_str(),
+        stopwatch_metrics,
+    ));
+
+    let experimental_features = ExperimentalFeatures {
+        allow_non_deterministic_ipfs: true,
+    };
+
+    let module = WasmInstance::from_valid_module_with_ctx(
+        Arc::new(ValidModule::new(&logger, data_source.mapping.runtime.as_ref()).unwrap()),
+        mock_context(
+            deployment.clone(),
+            data_source,
+            store.subgraph_store(),
+            api_version,
+        ),
+        host_metrics,
+        timeout,
+        experimental_features,
+    )
+    .unwrap();
+
+    (module, store.subgraph_store(), deployment)
+}
+
+pub async fn test_module(
+    subgraph_id: &str,
+    data_source: DataSource,
+    api_version: Version,
+) -> WasmInstance<Chain> {
+    test_valid_module_and_store(subgraph_id, data_source, api_version)
+        .await
+        .0
+}
+
+// A test module using the latest API version
+pub async fn test_module_latest(subgraph_id: &str, wasm_file: &str) -> WasmInstance<Chain> {
+    let version = ENV_VARS.mappings.max_api_version.clone();
+    let ds = mock_data_source(
+        &wasm_file_path(wasm_file, API_VERSION_0_0_5.clone()),
+        version.clone(),
+    );
+    test_valid_module_and_store(subgraph_id, ds, version)
+        .await
+        .0
+}
+
+pub trait WasmInstanceExt {
+    fn invoke_export0_void(&self, f: &str) -> Result<(), wasmtime::Trap>;
+    fn invoke_export1_val_void<V: wasmtime::WasmTy>(
+        &self,
+        f: &str,
+        v: V,
+    ) -> Result<(), wasmtime::Trap>;
+    fn invoke_export0<R>(&self, f: &str) -> AscPtr<R>;
+    fn invoke_export1<C, T, R>(&mut self, f: &str, arg: &T) -> AscPtr<R>
+    where
+        C: AscType + AscIndexId,
+        T: ToAscObj<C> + ?Sized;
+    fn invoke_export2<C1, T1, T2, C2, R>(&mut self, f: &str, arg0: &T1, arg1: &T2) -> AscPtr<R>
+    where
+        C1: AscType + AscIndexId,
+        C2: AscType + AscIndexId,
+        T1: ToAscObj<C1> + ?Sized,
+        T2: ToAscObj<C2> + ?Sized;
+    fn invoke_export2_void<C1, T1, T2, C2>(
+        &mut self,
+        f: &str,
+        arg0: &T1,
+        arg1: &T2,
+    ) -> Result<(), wasmtime::Trap>
+    where
+        C1: AscType + AscIndexId,
+        C2: AscType + AscIndexId,
+        T1: ToAscObj<C1> + ?Sized,
+        T2: ToAscObj<C2> + ?Sized;
+    fn invoke_export0_val<V: wasmtime::WasmTy>(&mut self, func: &str) -> V;
+    fn invoke_export1_val<V: wasmtime::WasmTy, C, T>(&mut self, func: &str, v: &T) -> V
+    where
+        C: AscType + AscIndexId,
+        T: ToAscObj<C> + ?Sized;
+    fn takes_ptr_returns_ptr<C, R>(&self, f: &str, arg: AscPtr<C>) -> AscPtr<R>;
+    fn takes_val_returns_ptr<P>(&mut self, fn_name: &str, val: impl wasmtime::WasmTy) -> AscPtr<P>;
+}
+
+impl WasmInstanceExt for WasmInstance<Chain> {
+    fn invoke_export0_void(&self, f: &str) -> Result<(), wasmtime::Trap> {
+        let func = self.get_func(f).typed().unwrap().clone();
+        func.call(())
+    }
+
+    fn invoke_export0<R>(&self, f: &str) -> AscPtr<R> {
+        let func = self.get_func(f).typed().unwrap().clone();
+        let ptr: u32 = func.call(()).unwrap();
+        ptr.into()
+    }
+
+    fn takes_ptr_returns_ptr<C, R>(&self, f: &str, arg: AscPtr<C>) -> AscPtr<R> {
+        let func = self.get_func(f).typed().unwrap().clone();
+        let ptr: u32 = func.call(arg.wasm_ptr()).unwrap();
+        ptr.into()
+    }
+
+    fn invoke_export1<C, T, R>(&mut self, f: &str, arg: &T) -> AscPtr<R>
+    where
+        C: AscType + AscIndexId,
+        T: ToAscObj<C> + ?Sized,
+    {
+        let func = self.get_func(f).typed().unwrap().clone();
+        let ptr = self.asc_new(arg).unwrap();
+        let ptr: u32 = func.call(ptr.wasm_ptr()).unwrap();
+        ptr.into()
+    }
+
+    fn invoke_export1_val_void<V: wasmtime::WasmTy>(
+        &self,
+        f: &str,
+        v: V,
+    ) -> Result<(), wasmtime::Trap> {
+        let func = self.get_func(f).typed().unwrap().clone();
+        func.call(v)?;
+        Ok(())
+    }
+
+    fn invoke_export2<C1, T1, T2, C2, R>(&mut self, f: &str, arg0: &T1, arg1: &T2) -> AscPtr<R>
+    where
+        C1: AscType + AscIndexId,
+        C2: AscType + AscIndexId,
+        T1: ToAscObj<C1> + ?Sized,
+        T2: ToAscObj<C2> + ?Sized,
+    {
+        let func = self.get_func(f).typed().unwrap().clone();
+        let arg0 = self.asc_new(arg0).unwrap();
+        let arg1 = self.asc_new(arg1).unwrap();
+        let ptr: u32 = func.call((arg0.wasm_ptr(), arg1.wasm_ptr())).unwrap();
+        ptr.into()
+    }
+
+    fn invoke_export2_void<C1, T1, T2, C2>(
+        &mut self,
+        f: &str,
+        arg0: &T1,
+        arg1: &T2,
+    ) -> Result<(), wasmtime::Trap>
+    where
+        C1: AscType + AscIndexId,
+        C2: AscType + AscIndexId,
+        T1: ToAscObj<C1> + ?Sized,
+        T2: ToAscObj<C2> + ?Sized,
+    {
+        let func = self.get_func(f).typed().unwrap().clone();
+        let arg0 = self.asc_new(arg0).unwrap();
+        let arg1 = self.asc_new(arg1).unwrap();
+        func.call((arg0.wasm_ptr(), arg1.wasm_ptr()))
+    }
+
+    fn invoke_export0_val<V: wasmtime::WasmTy>(&mut self, func: &str) -> V {
+        let func = self.get_func(func).typed().unwrap().clone();
+        func.call(()).unwrap()
+    }
+
+    fn invoke_export1_val<V: wasmtime::WasmTy, C, T>(&mut self, func: &str, v: &T) -> V
+    where
+        C: AscType + AscIndexId,
+        T: ToAscObj<C> + ?Sized,
+    {
+        let func = self.get_func(func).typed().unwrap().clone();
+        let ptr = self.asc_new(v).unwrap();
+        func.call(ptr.wasm_ptr()).unwrap()
+    }
+
+    fn takes_val_returns_ptr<P>(&mut self, fn_name: &str, val: impl wasmtime::WasmTy) -> AscPtr<P> {
+        let func = self.get_func(fn_name).typed().unwrap().clone();
+        let ptr: u32 = func.call(val).unwrap();
+        ptr.into()
+    }
+}
+
+async fn test_json_conversions(api_version: Version, gas_used: u64) {
+    let mut module = test_module(
+        "jsonConversions",
+        mock_data_source(
+            &wasm_file_path("string_to_number.wasm", api_version.clone()),
+            api_version.clone(),
+        ),
+        api_version,
+    )
+    .await;
+
+    // test u64 conversion
+    let number = 9223372036850770800;
+    let converted: i64 = module.invoke_export1_val("testToU64", &number.to_string());
+    assert_eq!(number, u64::from_le_bytes(converted.to_le_bytes()));
+
+    // test i64 conversion
+    let number = -9223372036850770800;
+    let converted: i64 = module.invoke_export1_val("testToI64", &number.to_string());
+    assert_eq!(number, converted);
+
+    // test f64 conversion
+    let number = -9223372036850770.92345034;
+    let converted: f64 = module.invoke_export1_val("testToF64", &number.to_string());
+    assert_eq!(number, converted);
+
+    // test BigInt conversion
+    let number = "-922337203685077092345034";
+    let big_int_obj: AscPtr<AscBigInt> = module.invoke_export1("testToBigInt", number);
+    let bytes: Vec<u8> = module.asc_get(big_int_obj).unwrap();
+
+    assert_eq!(
+        scalar::BigInt::from_str(number).unwrap(),
+        scalar::BigInt::from_signed_bytes_le(&bytes)
+    );
+
+    assert_eq!(module.gas_used(), gas_used);
+}
+
+#[tokio::test]
+async fn json_conversions_v0_0_4() {
+    test_json_conversions(API_VERSION_0_0_4, 52976429).await;
+}
+
+#[tokio::test]
+async fn json_conversions_v0_0_5() {
+    test_json_conversions(API_VERSION_0_0_5, 2289897).await;
+}
+
+async fn test_json_parsing(api_version: Version, gas_used: u64) {
+    let mut module = test_module(
+        "jsonParsing",
+        mock_data_source(
+            &wasm_file_path("json_parsing.wasm", api_version.clone()),
+            api_version.clone(),
+        ),
+        api_version,
+    )
+    .await;
+
+    // Parse invalid JSON and handle the error gracefully
+    let s = "foo"; // Invalid because there are no quotes around `foo`
+    let bytes: &[u8] = s.as_ref();
+    let return_value: AscPtr<AscString> = module.invoke_export1("handleJsonError", bytes);
+    let output: String = module.asc_get(return_value).unwrap();
+    assert_eq!(output, "ERROR: true");
+
+    // Parse valid JSON and get it back
+    let s = "\"foo\""; // Valid because there are quotes around `foo`
+    let bytes: &[u8] = s.as_ref();
+    let return_value: AscPtr<AscString> = module.invoke_export1("handleJsonError", bytes);
+
+    let output: String = module.asc_get(return_value).unwrap();
+    assert_eq!(output, "OK: foo, ERROR: false");
+    assert_eq!(module.gas_used(), gas_used);
+}
+
+#[tokio::test]
+async fn json_parsing_v0_0_4() {
+    test_json_parsing(API_VERSION_0_0_4, 2722284).await;
+}
+
+#[tokio::test]
+async fn json_parsing_v0_0_5() {
+    test_json_parsing(API_VERSION_0_0_5, 3862933).await;
+}
+
+async fn test_ipfs_cat(api_version: Version) {
+    // Ipfs host functions use `block_on` which must be called from a sync context,
+    // so we replicate what we do `spawn_module`.
+    let runtime = tokio::runtime::Handle::current();
+    std::thread::spawn(move || {
+        let _runtime_guard = runtime.enter();
+
+        let ipfs = IpfsClient::localhost();
+        let hash = graph::block_on(ipfs.add("42".into())).unwrap().hash;
+
+        let mut module = graph::block_on(test_module(
+            "ipfsCat",
+            mock_data_source(
+                &wasm_file_path("ipfs_cat.wasm", api_version.clone()),
+                api_version.clone(),
+            ),
+            api_version,
+        ));
+        let converted: AscPtr<AscString> = module.invoke_export1("ipfsCatString", &hash);
+        let data: String = module.asc_get(converted).unwrap();
+        assert_eq!(data, "42");
+    })
+    .join()
+    .unwrap();
+}
+
+#[tokio::test(flavor = "multi_thread")]
+async fn ipfs_cat_v0_0_4() {
+    test_ipfs_cat(API_VERSION_0_0_4).await;
+}
+
+#[tokio::test(flavor = "multi_thread")]
+async fn ipfs_cat_v0_0_5() {
+    test_ipfs_cat(API_VERSION_0_0_5).await;
+}
+
+#[tokio::test(flavor = "multi_thread")]
+async fn test_ipfs_block() {
+    // Ipfs host functions use `block_on` which must be called from a sync context,
+    // so we replicate what we do `spawn_module`.
+    let runtime = tokio::runtime::Handle::current();
+    std::thread::spawn(move || {
+        let _runtime_guard = runtime.enter();
+
+        let ipfs = IpfsClient::localhost();
+        let hash = graph::block_on(ipfs.add("42".into())).unwrap().hash;
+        let mut module = graph::block_on(test_module(
+            "ipfsBlock",
+            mock_data_source(
+                &wasm_file_path("ipfs_block.wasm", API_VERSION_0_0_5),
+                API_VERSION_0_0_5,
+            ),
+            API_VERSION_0_0_5,
+        ));
+        let converted: AscPtr<AscString> = module.invoke_export1("ipfsBlockHex", &hash);
+        let data: String = module.asc_get(converted).unwrap();
+        assert_eq!(data, "0x0a080802120234321802");
+    })
+    .join()
+    .unwrap();
+}
+
+// The user_data value we use with calls to ipfs_map
+const USER_DATA: &str = "user_data";
+
+fn make_thing(id: &str, value: &str) -> (String, EntityModification) {
+    let mut data = Entity::new();
+    data.set("id", id);
+    data.set("value", value);
+    data.set("extra", USER_DATA);
+    let key = EntityKey {
+        entity_type: EntityType::new("Thing".to_string()),
+        entity_id: id.into(),
+    };
+    (
+        format!("{{ \"id\": \"{}\", \"value\": \"{}\"}}", id, value),
+        EntityModification::Insert { key, data },
+    )
+}
+
+const BAD_IPFS_HASH: &str = "bad-ipfs-hash";
+
+async fn run_ipfs_map(
+    ipfs: IpfsClient,
+    subgraph_id: &'static str,
+    json_string: String,
+    api_version: Version,
+) -> Result<Vec<EntityModification>, anyhow::Error> {
+    let hash = if json_string == BAD_IPFS_HASH {
+        "Qm".to_string()
+    } else {
+        ipfs.add(json_string.into()).await.unwrap().hash
+    };
+
+    // Ipfs host functions use `block_on` which must be called from a sync context,
+    // so we replicate what we do `spawn_module`.
+    let runtime = tokio::runtime::Handle::current();
+    std::thread::spawn(move || {
+        let _runtime_guard = runtime.enter();
+
+        let (mut module, _, _) = graph::block_on(test_valid_module_and_store(
+            &subgraph_id,
+            mock_data_source(
+                &wasm_file_path("ipfs_map.wasm", api_version.clone()),
+                api_version.clone(),
+            ),
+            api_version,
+        ));
+
+        let value = module.asc_new(&hash).unwrap();
+        let user_data = module.asc_new(USER_DATA).unwrap();
+
+        // Invoke the callback
+        let func = module.get_func("ipfsMap").typed().unwrap().clone();
+        let _: () = func.call((value.wasm_ptr(), user_data.wasm_ptr()))?;
+        let mut mods = module
+            .take_ctx()
+            .ctx
+            .state
+            .entity_cache
+            .as_modifications()?
+            .modifications;
+
+        // Bring the modifications into a predictable order (by entity_id)
+        mods.sort_by(|a, b| {
+            a.entity_ref()
+                .entity_id
+                .partial_cmp(&b.entity_ref().entity_id)
+                .unwrap()
+        });
+        Ok(mods)
+    })
+    .join()
+    .unwrap()
+}
+
+async fn test_ipfs_map(api_version: Version, json_error_msg: &str) {
+    let ipfs = IpfsClient::localhost();
+    let subgraph_id = "ipfsMap";
+
+    // Try it with two valid objects
+    let (str1, thing1) = make_thing("one", "eins");
+    let (str2, thing2) = make_thing("two", "zwei");
+    let ops = run_ipfs_map(
+        ipfs.clone(),
+        subgraph_id,
+        format!("{}\n{}", str1, str2),
+        api_version.clone(),
+    )
+    .await
+    .expect("call failed");
+    let expected = vec![thing1, thing2];
+    assert_eq!(expected, ops);
+
+    // Valid JSON, but not what the callback expected; it will
+    // fail on an assertion
+    let err = run_ipfs_map(
+        ipfs.clone(),
+        subgraph_id,
+        format!("{}\n[1,2]", str1),
+        api_version.clone(),
+    )
+    .await
+    .unwrap_err();
+    assert!(
+        format!("{:#}", err).contains("JSON value is not an object."),
+        "{:#}",
+        err
+    );
+
+    // Malformed JSON
+    let errmsg = run_ipfs_map(
+        ipfs.clone(),
+        subgraph_id,
+        format!("{}\n[", str1),
+        api_version.clone(),
+    )
+    .await
+    .unwrap_err()
+    .to_string();
+    assert!(errmsg.contains("EOF while parsing a list"));
+
+    // Empty input
+    let ops = run_ipfs_map(
+        ipfs.clone(),
+        subgraph_id,
+        "".to_string(),
+        api_version.clone(),
+    )
+    .await
+    .expect("call failed for emoty string");
+    assert_eq!(0, ops.len());
+
+    // Missing entry in the JSON object
+    let errmsg = format!(
+        "{:#}",
+        run_ipfs_map(
+            ipfs.clone(),
+            subgraph_id,
+            "{\"value\": \"drei\"}".to_string(),
+            api_version.clone(),
+        )
+        .await
+        .unwrap_err()
+    );
+    assert!(errmsg.contains(json_error_msg));
+
+    // Bad IPFS hash.
+    let errmsg = run_ipfs_map(
+        ipfs.clone(),
+        subgraph_id,
+        BAD_IPFS_HASH.to_string(),
+        api_version.clone(),
+    )
+    .await
+    .unwrap_err()
+    .to_string();
+    assert!(errmsg.contains("500 Internal Server Error"));
+}
+
+#[tokio::test(flavor = "multi_thread")]
+async fn ipfs_map_v0_0_4() {
+    test_ipfs_map(API_VERSION_0_0_4, "JSON value is not a string.").await;
+}
+
+#[tokio::test(flavor = "multi_thread")]
+async fn ipfs_map_v0_0_5() {
+    test_ipfs_map(API_VERSION_0_0_5, "'id' should not be null").await;
+}
+
+async fn test_ipfs_fail(api_version: Version) {
+    let runtime = tokio::runtime::Handle::current();
+
+    // Ipfs host functions use `block_on` which must be called from a sync context,
+    // so we replicate what we do `spawn_module`.
+    std::thread::spawn(move || {
+        let _runtime_guard = runtime.enter();
+
+        let mut module = graph::block_on(test_module(
+            "ipfsFail",
+            mock_data_source(
+                &wasm_file_path("ipfs_cat.wasm", api_version.clone()),
+                api_version.clone(),
+            ),
+            api_version,
+        ));
+
+        assert!(module
+            .invoke_export1::<_, _, AscString>("ipfsCat", "invalid hash")
+            .is_null());
+    })
+    .join()
+    .unwrap();
+}
+
+#[tokio::test(flavor = "multi_thread")]
+async fn ipfs_fail_v0_0_4() {
+    test_ipfs_fail(API_VERSION_0_0_4).await;
+}
+
+#[tokio::test(flavor = "multi_thread")]
+async fn ipfs_fail_v0_0_5() {
+    test_ipfs_fail(API_VERSION_0_0_5).await;
+}
+
+async fn test_crypto_keccak256(api_version: Version) {
+    let mut module = test_module(
+        "cryptoKeccak256",
+        mock_data_source(
+            &wasm_file_path("crypto.wasm", api_version.clone()),
+            api_version.clone(),
+        ),
+        api_version,
+    )
+    .await;
+    let input: &[u8] = "eth".as_ref();
+
+    let hash: AscPtr<Uint8Array> = module.invoke_export1("hash", input);
+    let hash: Vec<u8> = module.asc_get(hash).unwrap();
+    assert_eq!(
+        hex::encode(hash),
+        "4f5b812789fc606be1b3b16908db13fc7a9adf7ca72641f84d75b47069d3d7f0"
+    );
+}
+
+#[tokio::test]
+async fn crypto_keccak256_v0_0_4() {
+    test_crypto_keccak256(API_VERSION_0_0_4).await;
+}
+
+#[tokio::test]
+async fn crypto_keccak256_v0_0_5() {
+    test_crypto_keccak256(API_VERSION_0_0_5).await;
+}
+
+async fn test_big_int_to_hex(api_version: Version, gas_used: u64) {
+    let mut module = test_module(
+        "BigIntToHex",
+        mock_data_source(
+            &wasm_file_path("big_int_to_hex.wasm", api_version.clone()),
+            api_version.clone(),
+        ),
+        api_version,
+    )
+    .await;
+
+    // Convert zero to hex
+    let zero = BigInt::from_unsigned_u256(&U256::zero());
+    let zero_hex_ptr: AscPtr<AscString> = module.invoke_export1("big_int_to_hex", &zero);
+    let zero_hex_str: String = module.asc_get(zero_hex_ptr).unwrap();
+    assert_eq!(zero_hex_str, "0x0");
+
+    // Convert 1 to hex
+    let one = BigInt::from_unsigned_u256(&U256::one());
+    let one_hex_ptr: AscPtr<AscString> = module.invoke_export1("big_int_to_hex", &one);
+    let one_hex_str: String = module.asc_get(one_hex_ptr).unwrap();
+    assert_eq!(one_hex_str, "0x1");
+
+    // Convert U256::max_value() to hex
+    let u256_max = BigInt::from_unsigned_u256(&U256::max_value());
+    let u256_max_hex_ptr: AscPtr<AscString> = module.invoke_export1("big_int_to_hex", &u256_max);
+    let u256_max_hex_str: String = module.asc_get(u256_max_hex_ptr).unwrap();
+    assert_eq!(
+        u256_max_hex_str,
+        "0xffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff"
+    );
+
+    assert_eq!(module.gas_used(), gas_used);
+}
+
+#[tokio::test]
+async fn big_int_to_hex_v0_0_4() {
+    test_big_int_to_hex(API_VERSION_0_0_4, 53113760).await;
+}
+
+#[tokio::test]
+async fn big_int_to_hex_v0_0_5() {
+    test_big_int_to_hex(API_VERSION_0_0_5, 2858580).await;
+}
+
+async fn test_big_int_arithmetic(api_version: Version, gas_used: u64) {
+    let mut module = test_module(
+        "BigIntArithmetic",
+        mock_data_source(
+            &wasm_file_path("big_int_arithmetic.wasm", api_version.clone()),
+            api_version.clone(),
+        ),
+        api_version,
+    )
+    .await;
+
+    // 0 + 1 = 1
+    let zero = BigInt::from(0);
+    let one = BigInt::from(1);
+    let result_ptr: AscPtr<AscBigInt> = module.invoke_export2("plus", &zero, &one);
+    let result: BigInt = module.asc_get(result_ptr).unwrap();
+    assert_eq!(result, BigInt::from(1));
+
+    // 127 + 1 = 128
+    let zero = BigInt::from(127);
+    let one = BigInt::from(1);
+    let result_ptr: AscPtr<AscBigInt> = module.invoke_export2("plus", &zero, &one);
+    let result: BigInt = module.asc_get(result_ptr).unwrap();
+    assert_eq!(result, BigInt::from(128));
+
+    // 5 - 10 = -5
+    let five = BigInt::from(5);
+    let ten = BigInt::from(10);
+    let result_ptr: AscPtr<AscBigInt> = module.invoke_export2("minus", &five, &ten);
+    let result: BigInt = module.asc_get(result_ptr).unwrap();
+    assert_eq!(result, BigInt::from(-5));
+
+    // -20 * 5 = -100
+    let minus_twenty = BigInt::from(-20);
+    let five = BigInt::from(5);
+    let result_ptr: AscPtr<AscBigInt> = module.invoke_export2("times", &minus_twenty, &five);
+    let result: BigInt = module.asc_get(result_ptr).unwrap();
+    assert_eq!(result, BigInt::from(-100));
+
+    // 5 / 2 = 2
+    let five = BigInt::from(5);
+    let two = BigInt::from(2);
+    let result_ptr: AscPtr<AscBigInt> = module.invoke_export2("dividedBy", &five, &two);
+    let result: BigInt = module.asc_get(result_ptr).unwrap();
+    assert_eq!(result, BigInt::from(2));
+
+    // 5 % 2 = 1
+    let five = BigInt::from(5);
+    let two = BigInt::from(2);
+    let result_ptr: AscPtr<AscBigInt> = module.invoke_export2("mod", &five, &two);
+    let result: BigInt = module.asc_get(result_ptr).unwrap();
+    assert_eq!(result, BigInt::from(1));
+
+    assert_eq!(module.gas_used(), gas_used);
+}
+
+#[tokio::test]
+async fn big_int_arithmetic_v0_0_4() {
+    test_big_int_arithmetic(API_VERSION_0_0_4, 54962411).await;
+}
+
+#[tokio::test]
+async fn big_int_arithmetic_v0_0_5() {
+    test_big_int_arithmetic(API_VERSION_0_0_5, 7318364).await;
+}
+
+async fn test_abort(api_version: Version, error_msg: &str) {
+    let module = test_module(
+        "abort",
+        mock_data_source(
+            &wasm_file_path("abort.wasm", api_version.clone()),
+            api_version.clone(),
+        ),
+        api_version,
+    )
+    .await;
+    let res: Result<(), _> = module.get_func("abort").typed().unwrap().call(());
+    assert!(res.unwrap_err().to_string().contains(error_msg));
+}
+
+#[tokio::test]
+async fn abort_v0_0_4() {
+    test_abort(
+        API_VERSION_0_0_4,
+        "line 6, column 2, with message: not true",
+    )
+    .await;
+}
+
+#[tokio::test]
+async fn abort_v0_0_5() {
+    test_abort(
+        API_VERSION_0_0_5,
+        "line 4, column 3, with message: not true",
+    )
+    .await;
+}
+
+async fn test_bytes_to_base58(api_version: Version, gas_used: u64) {
+    let mut module = test_module(
+        "bytesToBase58",
+        mock_data_source(
+            &wasm_file_path("bytes_to_base58.wasm", api_version.clone()),
+            api_version.clone(),
+        ),
+        api_version,
+    )
+    .await;
+    let bytes = hex::decode("12207D5A99F603F231D53A4F39D1521F98D2E8BB279CF29BEBFD0687DC98458E7F89")
+        .unwrap();
+    let result_ptr: AscPtr<AscString> = module.invoke_export1("bytes_to_base58", bytes.as_slice());
+    let base58: String = module.asc_get(result_ptr).unwrap();
+
+    assert_eq!(base58, "QmWmyoMoctfbAaiEs2G46gpeUmhqFRDW6KWo64y5r581Vz");
+    assert_eq!(module.gas_used(), gas_used);
+}
+
+#[tokio::test]
+async fn bytes_to_base58_v0_0_4() {
+    test_bytes_to_base58(API_VERSION_0_0_4, 52301689).await;
+}
+
+#[tokio::test]
+async fn bytes_to_base58_v0_0_5() {
+    test_bytes_to_base58(API_VERSION_0_0_5, 1310019).await;
+}
+
+async fn test_data_source_create(api_version: Version, gas_used: u64) {
+    // Test with a valid template
+    let template = String::from("example template");
+    let params = vec![String::from("0xc0a47dFe034B400B47bDaD5FecDa2621de6c4d95")];
+    let result = run_data_source_create(
+        template.clone(),
+        params.clone(),
+        api_version.clone(),
+        gas_used,
+    )
+    .await
+    .expect("unexpected error returned from dataSourceCreate");
+    assert_eq!(result[0].params, params.clone());
+    assert_eq!(result[0].template.name(), template);
+
+    // Test with a template that doesn't exist
+    let template = String::from("nonexistent template");
+    let params = vec![String::from("0xc000000000000000000000000000000000000000")];
+    match run_data_source_create(template.clone(), params.clone(), api_version, gas_used).await {
+        Ok(_) => panic!("expected an error because the template does not exist"),
+        Err(e) => assert!(e.to_string().contains(
+            "Failed to create data source from name `nonexistent template`: \
+             No template with this name in parent data source `example data source`. \
+             Available names: example template."
+        )),
+    };
+}
+
+async fn run_data_source_create(
+    name: String,
+    params: Vec<String>,
+    api_version: Version,
+    gas_used: u64,
+) -> Result<Vec<DataSourceTemplateInfo<Chain>>, wasmtime::Trap> {
+    let mut module = test_module(
+        "DataSourceCreate",
+        mock_data_source(
+            &wasm_file_path("data_source_create.wasm", api_version.clone()),
+            api_version.clone(),
+        ),
+        api_version.clone(),
+    )
+    .await;
+
+    module.instance_ctx_mut().ctx.state.enter_handler();
+    module.invoke_export2_void("dataSourceCreate", &name, &params)?;
+    module.instance_ctx_mut().ctx.state.exit_handler();
+
+    assert_eq!(module.gas_used(), gas_used);
+
+    Ok(module.take_ctx().ctx.state.drain_created_data_sources())
+}
+
+#[tokio::test]
+async fn data_source_create_v0_0_4() {
+    test_data_source_create(API_VERSION_0_0_4, 152102833).await;
+}
+
+#[tokio::test]
+async fn data_source_create_v0_0_5() {
+    test_data_source_create(API_VERSION_0_0_5, 101450079).await;
+}
+
+async fn test_ens_name_by_hash(api_version: Version) {
+    let mut module = test_module(
+        "EnsNameByHash",
+        mock_data_source(
+            &wasm_file_path("ens_name_by_hash.wasm", api_version.clone()),
+            api_version.clone(),
+        ),
+        api_version,
+    )
+    .await;
+
+    let hash = "0x7f0c1b04d1a4926f9c635a030eeb611d4c26e5e73291b32a1c7a4ac56935b5b3";
+    let name = "dealdrafts";
+    test_store::insert_ens_name(hash, name);
+    let converted: AscPtr<AscString> = module.invoke_export1("nameByHash", hash);
+    let data: String = module.asc_get(converted).unwrap();
+    assert_eq!(data, name);
+
+    assert!(module
+        .invoke_export1::<_, _, AscString>("nameByHash", "impossible keccak hash")
+        .is_null());
+}
+
+#[tokio::test]
+async fn ens_name_by_hash_v0_0_4() {
+    test_ens_name_by_hash(API_VERSION_0_0_4).await;
+}
+
+#[tokio::test]
+async fn ens_name_by_hash_v0_0_5() {
+    test_ens_name_by_hash(API_VERSION_0_0_5).await;
+}
+
+async fn test_entity_store(api_version: Version) {
+    let (mut module, store, deployment) = test_valid_module_and_store(
+        "entityStore",
+        mock_data_source(
+            &wasm_file_path("store.wasm", api_version.clone()),
+            api_version.clone(),
+        ),
+        api_version,
+    )
+    .await;
+
+    let mut alex = Entity::new();
+    alex.set("id", "alex");
+    alex.set("name", "Alex");
+    let mut steve = Entity::new();
+    steve.set("id", "steve");
+    steve.set("name", "Steve");
+    let user_type = EntityType::from("User");
+    test_store::insert_entities(
+        &deployment,
+        vec![(user_type.clone(), alex), (user_type, steve)],
+    )
+    .await
+    .unwrap();
+
+    let get_user = move |module: &mut WasmInstance<Chain>, id: &str| -> Option<Entity> {
+        let entity_ptr: AscPtr<AscEntity> = module.invoke_export1("getUser", id);
+        if entity_ptr.is_null() {
+            None
+        } else {
+            Some(Entity::from(
+                module
+                    .asc_get::<HashMap<String, Value>, _>(entity_ptr)
+                    .unwrap(),
+            ))
+        }
+    };
+
+    let load_and_set_user_name = |module: &mut WasmInstance<Chain>, id: &str, name: &str| {
+        module
+            .invoke_export2_void("loadAndSetUserName", id, name)
+            .unwrap();
+    };
+
+    // store.get of a nonexistent user
+    assert_eq!(None, get_user(&mut module, "herobrine"));
+    // store.get of an existing user
+    let steve = get_user(&mut module, "steve").unwrap();
+    assert_eq!(Some(&Value::from("Steve")), steve.get("name"));
+
+    // Load, set, save cycle for an existing entity
+    load_and_set_user_name(&mut module, "steve", "Steve-O");
+
+    // We need to empty the cache for the next test
+    let writable = store.writable(LOGGER.clone(), deployment.id).await.unwrap();
+    let cache = std::mem::replace(
+        &mut module.instance_ctx_mut().ctx.state.entity_cache,
+        EntityCache::new(Arc::new(writable.clone())),
+    );
+    let mut mods = cache.as_modifications().unwrap().modifications;
+    assert_eq!(1, mods.len());
+    match mods.pop().unwrap() {
+        EntityModification::Overwrite { data, .. } => {
+            assert_eq!(Some(&Value::from("steve")), data.get("id"));
+            assert_eq!(Some(&Value::from("Steve-O")), data.get("name"));
+        }
+        _ => assert!(false, "expected Overwrite modification"),
+    }
+
+    // Load, set, save cycle for a new entity with fulltext API
+    load_and_set_user_name(&mut module, "herobrine", "Brine-O");
+    let mut fulltext_entities = BTreeMap::new();
+    let mut fulltext_fields = BTreeMap::new();
+    fulltext_fields.insert("name".to_string(), vec!["search".to_string()]);
+    fulltext_entities.insert("User".to_string(), fulltext_fields);
+    let mut mods = module
+        .take_ctx()
+        .ctx
+        .state
+        .entity_cache
+        .as_modifications()
+        .unwrap()
+        .modifications;
+    assert_eq!(1, mods.len());
+    match mods.pop().unwrap() {
+        EntityModification::Insert { data, .. } => {
+            assert_eq!(Some(&Value::from("herobrine")), data.get("id"));
+            assert_eq!(Some(&Value::from("Brine-O")), data.get("name"));
+        }
+        _ => assert!(false, "expected Insert modification"),
+    };
+}
+
+#[tokio::test]
+async fn entity_store_v0_0_4() {
+    test_entity_store(API_VERSION_0_0_4).await;
+}
+
+#[tokio::test]
+async fn entity_store_v0_0_5() {
+    test_entity_store(API_VERSION_0_0_5).await;
+}
+
+fn test_detect_contract_calls(api_version: Version) {
+    let data_source_without_calls = mock_data_source(
+        &wasm_file_path("abi_store_value.wasm", api_version.clone()),
+        api_version.clone(),
+    );
+    assert_eq!(
+        data_source_without_calls
+            .mapping
+            .requires_archive()
+            .unwrap(),
+        false
+    );
+
+    let data_source_with_calls = mock_data_source(
+        &wasm_file_path("contract_calls.wasm", api_version.clone()),
+        api_version,
+    );
+    assert_eq!(
+        data_source_with_calls.mapping.requires_archive().unwrap(),
+        true
+    );
+}
+
+#[tokio::test]
+async fn detect_contract_calls_v0_0_4() {
+    test_detect_contract_calls(API_VERSION_0_0_4);
+}
+
+#[tokio::test]
+async fn detect_contract_calls_v0_0_5() {
+    test_detect_contract_calls(API_VERSION_0_0_5);
+}
+
+async fn test_allocate_global(api_version: Version) {
+    let module = test_module(
+        "AllocateGlobal",
+        mock_data_source(
+            &wasm_file_path("allocate_global.wasm", api_version.clone()),
+            api_version.clone(),
+        ),
+        api_version,
+    )
+    .await;
+
+    // Assert globals can be allocated and don't break the heap
+    module.invoke_export0_void("assert_global_works").unwrap();
+}
+
+#[tokio::test]
+async fn allocate_global_v0_0_5() {
+    // Only in apiVersion v0.0.5 because there's no issue in older versions.
+    // The problem with the new one is related to the AS stub runtime `offset`
+    // variable not being initialized (lazy) before we use it so this test checks
+    // that it works (at the moment using __alloc call to force offset to be eagerly
+    // evaluated).
+    test_allocate_global(API_VERSION_0_0_5).await;
+}
+
+async fn test_null_ptr_read(api_version: Version) {
+    let module = test_module(
+        "NullPtrRead",
+        mock_data_source(
+            &wasm_file_path("null_ptr_read.wasm", api_version.clone()),
+            api_version.clone(),
+        ),
+        api_version,
+    )
+    .await;
+
+    module.invoke_export0_void("nullPtrRead").unwrap();
+}
+
+#[tokio::test]
+#[should_panic(expected = "Tried to read AssemblyScript value that is 'null'")]
+async fn null_ptr_read_0_0_5() {
+    test_null_ptr_read(API_VERSION_0_0_5).await;
+}
+
+async fn test_safe_null_ptr_read(api_version: Version) {
+    let module = test_module(
+        "SafeNullPtrRead",
+        mock_data_source(
+            &wasm_file_path("null_ptr_read.wasm", api_version.clone()),
+            api_version.clone(),
+        ),
+        api_version,
+    )
+    .await;
+
+    module.invoke_export0_void("safeNullPtrRead").unwrap();
+}
+
+#[tokio::test]
+#[should_panic(expected = "Failed to sum BigInts because left hand side is 'null'")]
+async fn safe_null_ptr_read_0_0_5() {
+    test_safe_null_ptr_read(API_VERSION_0_0_5).await;
+}
+
+#[ignore] // Ignored because of long run time in debug build.
+#[tokio::test]
+async fn test_array_blowup() {
+    let module = test_module_latest("ArrayBlowup", "array_blowup.wasm").await;
+
+    assert!(module
+        .invoke_export0_void("arrayBlowup")
+        .unwrap_err()
+        .to_string()
+        .contains("Gas limit exceeded. Used: 11286295575421"));
+}
+
+#[tokio::test]
+async fn test_boolean() {
+    let mut module = test_module_latest("boolean", "boolean.wasm").await;
+
+    let true_: i32 = module.invoke_export0_val("testReturnTrue");
+    assert_eq!(true_, 1);
+
+    let false_: i32 = module.invoke_export0_val("testReturnFalse");
+    assert_eq!(false_, 0);
+
+    // non-zero values are true
+    for x in (-10i32..10).filter(|&x| x != 0) {
+        assert!(module.invoke_export1_val_void("testReceiveTrue", x).is_ok(),);
+    }
+
+    // zero is not true
+    assert!(module
+        .invoke_export1_val_void("testReceiveTrue", 0i32)
+        .is_err());
+
+    // zero is false
+    assert!(module
+        .invoke_export1_val_void("testReceiveFalse", 0i32)
+        .is_ok());
+
+    // non-zero values are not false
+    for x in (-10i32..10).filter(|&x| x != 0) {
+        assert!(module
+            .invoke_export1_val_void("testReceiveFalse", x)
+            .is_err());
+    }
+}
diff --git a/runtime/test/src/test/abi.rs b/runtime/test/src/test/abi.rs
new file mode 100644
index 0000000..dc62f44
--- /dev/null
+++ b/runtime/test/src/test/abi.rs
@@ -0,0 +1,529 @@
+use graph::prelude::{ethabi::Token, web3::types::U256};
+use graph_runtime_wasm::{
+    asc_abi::class::{
+        ArrayBuffer, AscAddress, AscEnum, AscEnumArray, EthereumValueKind, StoreValueKind,
+        TypedArray,
+    },
+    TRAP_TIMEOUT,
+};
+
+use super::*;
+
+async fn test_unbounded_loop(api_version: Version) {
+    // Set handler timeout to 3 seconds.
+    let module = test_valid_module_and_store_with_timeout(
+        "unboundedLoop",
+        mock_data_source(
+            &wasm_file_path("non_terminating.wasm", api_version.clone()),
+            api_version.clone(),
+        ),
+        api_version,
+        Some(Duration::from_secs(3)),
+    )
+    .await
+    .0;
+    let res: Result<(), _> = module.get_func("loop").typed().unwrap().call(());
+    assert!(res.unwrap_err().to_string().contains(TRAP_TIMEOUT));
+}
+
+#[tokio::test(flavor = "multi_thread")]
+async fn unbounded_loop_v0_0_4() {
+    test_unbounded_loop(API_VERSION_0_0_4).await;
+}
+
+#[tokio::test(flavor = "multi_thread")]
+async fn unbounded_loop_v0_0_5() {
+    test_unbounded_loop(API_VERSION_0_0_5).await;
+}
+
+async fn test_unbounded_recursion(api_version: Version) {
+    let module = test_module(
+        "unboundedRecursion",
+        mock_data_source(
+            &wasm_file_path("non_terminating.wasm", api_version.clone()),
+            api_version.clone(),
+        ),
+        api_version,
+    )
+    .await;
+    let res: Result<(), _> = module.get_func("rabbit_hole").typed().unwrap().call(());
+    let err_msg = res.unwrap_err().to_string();
+    assert!(err_msg.contains("call stack exhausted"), "{:#?}", err_msg);
+}
+
+#[tokio::test]
+async fn unbounded_recursion_v0_0_4() {
+    test_unbounded_recursion(API_VERSION_0_0_4).await;
+}
+
+#[tokio::test]
+async fn unbounded_recursion_v0_0_5() {
+    test_unbounded_recursion(API_VERSION_0_0_5).await;
+}
+
+async fn test_abi_array(api_version: Version, gas_used: u64) {
+    let mut module = test_module(
+        "abiArray",
+        mock_data_source(
+            &wasm_file_path("abi_classes.wasm", api_version.clone()),
+            api_version.clone(),
+        ),
+        api_version,
+    )
+    .await;
+
+    let vec = vec![
+        "1".to_owned(),
+        "2".to_owned(),
+        "3".to_owned(),
+        "4".to_owned(),
+    ];
+    let new_vec_obj: AscPtr<Array<AscPtr<AscString>>> = module.invoke_export1("test_array", &vec);
+    let new_vec: Vec<String> = module.asc_get(new_vec_obj).unwrap();
+
+    assert_eq!(module.gas_used(), gas_used);
+    assert_eq!(
+        new_vec,
+        vec![
+            "1".to_owned(),
+            "2".to_owned(),
+            "3".to_owned(),
+            "4".to_owned(),
+            "5".to_owned(),
+        ]
+    );
+}
+
+#[tokio::test]
+async fn abi_array_v0_0_4() {
+    test_abi_array(API_VERSION_0_0_4, 695935).await;
+}
+
+#[tokio::test]
+async fn abi_array_v0_0_5() {
+    test_abi_array(API_VERSION_0_0_5, 1636130).await;
+}
+
+async fn test_abi_subarray(api_version: Version) {
+    let mut module = test_module(
+        "abiSubarray",
+        mock_data_source(
+            &wasm_file_path("abi_classes.wasm", api_version.clone()),
+            api_version.clone(),
+        ),
+        api_version,
+    )
+    .await;
+
+    let vec: Vec<u8> = vec![1, 2, 3, 4];
+    let new_vec_obj: AscPtr<TypedArray<u8>> =
+        module.invoke_export1("byte_array_third_quarter", vec.as_slice());
+    let new_vec: Vec<u8> = module.asc_get(new_vec_obj).unwrap();
+
+    assert_eq!(new_vec, vec![3]);
+}
+
+#[tokio::test]
+async fn abi_subarray_v0_0_4() {
+    test_abi_subarray(API_VERSION_0_0_4).await;
+}
+
+#[tokio::test]
+async fn abi_subarray_v0_0_5() {
+    test_abi_subarray(API_VERSION_0_0_5).await;
+}
+
+async fn test_abi_bytes_and_fixed_bytes(api_version: Version) {
+    let mut module = test_module(
+        "abiBytesAndFixedBytes",
+        mock_data_source(
+            &wasm_file_path("abi_classes.wasm", api_version.clone()),
+            api_version.clone(),
+        ),
+        api_version,
+    )
+    .await;
+    let bytes1: Vec<u8> = vec![42, 45, 7, 245, 45];
+    let bytes2: Vec<u8> = vec![3, 12, 0, 1, 255];
+    let new_vec_obj: AscPtr<Uint8Array> = module.invoke_export2("concat", &*bytes1, &*bytes2);
+
+    // This should be bytes1 and bytes2 concatenated.
+    let new_vec: Vec<u8> = module.asc_get(new_vec_obj).unwrap();
+
+    let mut concated = bytes1.clone();
+    concated.extend(bytes2.clone());
+    assert_eq!(new_vec, concated);
+}
+
+#[tokio::test]
+async fn abi_bytes_and_fixed_bytes_v0_0_4() {
+    test_abi_bytes_and_fixed_bytes(API_VERSION_0_0_4).await;
+}
+
+#[tokio::test]
+async fn abi_bytes_and_fixed_bytes_v0_0_5() {
+    test_abi_bytes_and_fixed_bytes(API_VERSION_0_0_5).await;
+}
+
+async fn test_abi_ethabi_token_identity(api_version: Version) {
+    let mut module = test_module(
+        "abiEthabiTokenIdentity",
+        mock_data_source(
+            &wasm_file_path("abi_token.wasm", api_version.clone()),
+            api_version.clone(),
+        ),
+        api_version,
+    )
+    .await;
+
+    // Token::Address
+    let address = H160([1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1]);
+    let token_address = Token::Address(address);
+
+    let new_address_obj: AscPtr<AscAddress> =
+        module.invoke_export1("token_to_address", &token_address);
+
+    let new_token_ptr = module.takes_ptr_returns_ptr("token_from_address", new_address_obj);
+    let new_token = module.asc_get(new_token_ptr).unwrap();
+
+    assert_eq!(token_address, new_token);
+
+    // Token::Bytes
+    let token_bytes = Token::Bytes(vec![42, 45, 7, 245, 45]);
+    let new_bytes_obj: AscPtr<ArrayBuffer> = module.invoke_export1("token_to_bytes", &token_bytes);
+    let new_token_ptr = module.takes_ptr_returns_ptr("token_from_bytes", new_bytes_obj);
+    let new_token = module.asc_get(new_token_ptr).unwrap();
+
+    assert_eq!(token_bytes, new_token);
+
+    // Token::Int
+    let int_token = Token::Int(U256([256, 453452345, 0, 42]));
+    let new_int_obj: AscPtr<ArrayBuffer> = module.invoke_export1("token_to_int", &int_token);
+
+    let new_token_ptr = module.takes_ptr_returns_ptr("token_from_int", new_int_obj);
+    let new_token = module.asc_get(new_token_ptr).unwrap();
+
+    assert_eq!(int_token, new_token);
+
+    // Token::Uint
+    let uint_token = Token::Uint(U256([256, 453452345, 0, 42]));
+
+    let new_uint_obj: AscPtr<ArrayBuffer> = module.invoke_export1("token_to_uint", &uint_token);
+    let new_token_ptr = module.takes_ptr_returns_ptr("token_from_uint", new_uint_obj);
+    let new_token = module.asc_get(new_token_ptr).unwrap();
+
+    assert_eq!(uint_token, new_token);
+    assert_ne!(uint_token, int_token);
+
+    // Token::Bool
+    let token_bool = Token::Bool(true);
+
+    let token_bool_ptr = module.asc_new(&token_bool).unwrap();
+    let func = module.get_func("token_to_bool").typed().unwrap().clone();
+    let boolean: i32 = func.call(token_bool_ptr.wasm_ptr()).unwrap();
+
+    let new_token_ptr = module.takes_val_returns_ptr("token_from_bool", boolean);
+    let new_token = module.asc_get(new_token_ptr).unwrap();
+
+    assert_eq!(token_bool, new_token);
+
+    // Token::String
+    let token_string = Token::String("漢字Go🇧🇷".into());
+    let new_string_obj: AscPtr<AscString> = module.invoke_export1("token_to_string", &token_string);
+    let new_token_ptr = module.takes_ptr_returns_ptr("token_from_string", new_string_obj);
+    let new_token = module.asc_get(new_token_ptr).unwrap();
+
+    assert_eq!(token_string, new_token);
+
+    // Token::Array
+    let token_array = Token::Array(vec![token_address, token_bytes, token_bool]);
+    let token_array_nested = Token::Array(vec![token_string, token_array]);
+    let new_array_obj: AscEnumArray<EthereumValueKind> =
+        module.invoke_export1("token_to_array", &token_array_nested);
+
+    let new_token_ptr = module.takes_ptr_returns_ptr("token_from_array", new_array_obj);
+    let new_token: Token = module.asc_get(new_token_ptr).unwrap();
+
+    assert_eq!(new_token, token_array_nested);
+}
+
+/// Test a roundtrip Token -> Payload -> Token identity conversion through asc,
+/// and assert the final token is the same as the starting one.
+#[tokio::test]
+async fn abi_ethabi_token_identity_v0_0_4() {
+    test_abi_ethabi_token_identity(API_VERSION_0_0_4).await;
+}
+
+/// Test a roundtrip Token -> Payload -> Token identity conversion through asc,
+/// and assert the final token is the same as the starting one.
+#[tokio::test]
+async fn abi_ethabi_token_identity_v0_0_5() {
+    test_abi_ethabi_token_identity(API_VERSION_0_0_5).await;
+}
+
+async fn test_abi_store_value(api_version: Version) {
+    let mut module = test_module(
+        "abiStoreValue",
+        mock_data_source(
+            &wasm_file_path("abi_store_value.wasm", api_version.clone()),
+            api_version.clone(),
+        ),
+        api_version,
+    )
+    .await;
+
+    // Value::Null
+    let func = module.get_func("value_null").typed().unwrap().clone();
+    let ptr: u32 = func.call(()).unwrap();
+    let null_value_ptr: AscPtr<AscEnum<StoreValueKind>> = ptr.into();
+    let null_value: Value = module.asc_get(null_value_ptr).unwrap();
+    assert_eq!(null_value, Value::Null);
+
+    // Value::String
+    let string = "some string";
+    let new_value_ptr = module.invoke_export1("value_from_string", string);
+    let new_value: Value = module.asc_get(new_value_ptr).unwrap();
+    assert_eq!(new_value, Value::from(string));
+
+    // Value::Int
+    let int = i32::min_value();
+    let new_value_ptr = module.takes_val_returns_ptr("value_from_int", int);
+    let new_value: Value = module.asc_get(new_value_ptr).unwrap();
+    assert_eq!(new_value, Value::Int(int));
+
+    // Value::BigDecimal
+    let big_decimal = BigDecimal::from_str("3.14159001").unwrap();
+    let new_value_ptr = module.invoke_export1("value_from_big_decimal", &big_decimal);
+    let new_value: Value = module.asc_get(new_value_ptr).unwrap();
+    assert_eq!(new_value, Value::BigDecimal(big_decimal));
+
+    let big_decimal = BigDecimal::new(10.into(), 5);
+    let new_value_ptr = module.invoke_export1("value_from_big_decimal", &big_decimal);
+    let new_value: Value = module.asc_get(new_value_ptr).unwrap();
+    assert_eq!(new_value, Value::BigDecimal(1_000_000.into()));
+
+    // Value::Bool
+    let boolean = true;
+    let new_value_ptr =
+        module.takes_val_returns_ptr("value_from_bool", if boolean { 1 } else { 0 });
+    let new_value: Value = module.asc_get(new_value_ptr).unwrap();
+    assert_eq!(new_value, Value::Bool(boolean));
+
+    // Value::List
+    let func = module
+        .get_func("array_from_values")
+        .typed()
+        .unwrap()
+        .clone();
+    let new_value_ptr: u32 = func
+        .call((module.asc_new(string).unwrap().wasm_ptr(), int))
+        .unwrap();
+    let new_value_ptr = AscPtr::from(new_value_ptr);
+    let new_value: Value = module.asc_get(new_value_ptr).unwrap();
+    assert_eq!(
+        new_value,
+        Value::List(vec![Value::from(string), Value::Int(int)])
+    );
+
+    let array: &[Value] = &[
+        Value::String("foo".to_owned()),
+        Value::String("bar".to_owned()),
+    ];
+    let new_value_ptr = module.invoke_export1("value_from_array", array);
+    let new_value: Value = module.asc_get(new_value_ptr).unwrap();
+    assert_eq!(
+        new_value,
+        Value::List(vec![
+            Value::String("foo".to_owned()),
+            Value::String("bar".to_owned()),
+        ])
+    );
+
+    // Value::Bytes
+    let bytes: &[u8] = &[0, 2, 5];
+    let new_value_ptr = module.invoke_export1("value_from_bytes", bytes);
+    let new_value: Value = module.asc_get(new_value_ptr).unwrap();
+    assert_eq!(new_value, Value::Bytes(bytes.into()));
+
+    // Value::BigInt
+    let bytes: &[u8] = &[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1];
+    let new_value_ptr = module.invoke_export1("value_from_bigint", bytes);
+    let new_value: Value = module.asc_get(new_value_ptr).unwrap();
+    assert_eq!(
+        new_value,
+        Value::BigInt(::graph::data::store::scalar::BigInt::from_unsigned_bytes_le(bytes))
+    );
+}
+
+#[tokio::test]
+async fn abi_store_value_v0_0_4() {
+    test_abi_store_value(API_VERSION_0_0_4).await;
+}
+
+#[tokio::test]
+async fn abi_store_value_v0_0_5() {
+    test_abi_store_value(API_VERSION_0_0_5).await;
+}
+
+async fn test_abi_h160(api_version: Version) {
+    let mut module = test_module(
+        "abiH160",
+        mock_data_source(
+            &wasm_file_path("abi_classes.wasm", api_version.clone()),
+            api_version.clone(),
+        ),
+        api_version,
+    )
+    .await;
+    let address = H160::zero();
+
+    // As an `Uint8Array`
+    let new_address_obj: AscPtr<Uint8Array> = module.invoke_export1("test_address", &address);
+
+    // This should have 1 added to the first and last byte.
+    let new_address: H160 = module.asc_get(new_address_obj).unwrap();
+
+    assert_eq!(
+        new_address,
+        H160([1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1])
+    )
+}
+
+#[tokio::test]
+async fn abi_h160_v0_0_4() {
+    test_abi_h160(API_VERSION_0_0_4).await;
+}
+
+#[tokio::test]
+async fn abi_h160_v0_0_5() {
+    test_abi_h160(API_VERSION_0_0_5).await;
+}
+
+async fn test_string(api_version: Version) {
+    let mut module = test_module(
+        "string",
+        mock_data_source(
+            &wasm_file_path("abi_classes.wasm", api_version.clone()),
+            api_version.clone(),
+        ),
+        api_version,
+    )
+    .await;
+    let string = "    漢字Double_Me🇧🇷  ";
+    let trimmed_string_obj: AscPtr<AscString> = module.invoke_export1("repeat_twice", string);
+    let doubled_string: String = module.asc_get(trimmed_string_obj).unwrap();
+    assert_eq!(doubled_string, string.repeat(2));
+}
+
+#[tokio::test]
+async fn string_v0_0_4() {
+    test_string(API_VERSION_0_0_4).await;
+}
+
+#[tokio::test]
+async fn string_v0_0_5() {
+    test_string(API_VERSION_0_0_5).await;
+}
+
+async fn test_abi_big_int(api_version: Version) {
+    let mut module = test_module(
+        "abiBigInt",
+        mock_data_source(
+            &wasm_file_path("abi_classes.wasm", api_version.clone()),
+            api_version.clone(),
+        ),
+        api_version,
+    )
+    .await;
+
+    // Test passing in 0 and increment it by 1
+    let old_uint = U256::zero();
+    let new_uint_obj: AscPtr<AscBigInt> =
+        module.invoke_export1("test_uint", &BigInt::from_unsigned_u256(&old_uint));
+    let new_uint: BigInt = module.asc_get(new_uint_obj).unwrap();
+    assert_eq!(new_uint, BigInt::from(1 as i32));
+    let new_uint = new_uint.to_unsigned_u256();
+    assert_eq!(new_uint, U256([1, 0, 0, 0]));
+
+    // Test passing in -50 and increment it by 1
+    let old_uint = BigInt::from(-50);
+    let new_uint_obj: AscPtr<AscBigInt> = module.invoke_export1("test_uint", &old_uint);
+    let new_uint: BigInt = module.asc_get(new_uint_obj).unwrap();
+    assert_eq!(new_uint, BigInt::from(-49 as i32));
+    let new_uint_from_u256 = BigInt::from_signed_u256(&new_uint.to_signed_u256());
+    assert_eq!(new_uint, new_uint_from_u256);
+}
+
+#[tokio::test]
+async fn abi_big_int_v0_0_4() {
+    test_abi_big_int(API_VERSION_0_0_4).await;
+}
+
+#[tokio::test]
+async fn abi_big_int_v0_0_5() {
+    test_abi_big_int(API_VERSION_0_0_5).await;
+}
+
+async fn test_big_int_to_string(api_version: Version) {
+    let mut module = test_module(
+        "bigIntToString",
+        mock_data_source(
+            &wasm_file_path("big_int_to_string.wasm", api_version.clone()),
+            api_version.clone(),
+        ),
+        api_version,
+    )
+    .await;
+
+    let big_int_str = "30145144166666665000000000000000000";
+    let big_int = BigInt::from_str(big_int_str).unwrap();
+    let string_obj: AscPtr<AscString> = module.invoke_export1("big_int_to_string", &big_int);
+    let string: String = module.asc_get(string_obj).unwrap();
+    assert_eq!(string, big_int_str);
+}
+
+#[tokio::test]
+async fn big_int_to_string_v0_0_4() {
+    test_big_int_to_string(API_VERSION_0_0_4).await;
+}
+
+#[tokio::test]
+async fn big_int_to_string_v0_0_5() {
+    test_big_int_to_string(API_VERSION_0_0_5).await;
+}
+
+async fn test_invalid_discriminant(api_version: Version) {
+    let module = test_module(
+        "invalidDiscriminant",
+        mock_data_source(
+            &wasm_file_path("abi_store_value.wasm", api_version.clone()),
+            api_version.clone(),
+        ),
+        api_version,
+    )
+    .await;
+
+    let func = module
+        .get_func("invalid_discriminant")
+        .typed()
+        .unwrap()
+        .clone();
+    let ptr: u32 = func.call(()).unwrap();
+    let _value: Value = module.asc_get(ptr.into()).unwrap();
+}
+
+// This should panic rather than exhibiting UB. It's hard to test for UB, but
+// when reproducing a SIGILL was observed which would be caught by this.
+#[tokio::test]
+#[should_panic]
+async fn invalid_discriminant_v0_0_4() {
+    test_invalid_discriminant(API_VERSION_0_0_4).await;
+}
+
+// This should panic rather than exhibiting UB. It's hard to test for UB, but
+// when reproducing a SIGILL was observed which would be caught by this.
+#[tokio::test]
+#[should_panic]
+async fn invalid_discriminant_v0_0_5() {
+    test_invalid_discriminant(API_VERSION_0_0_5).await;
+}
diff --git a/runtime/test/src/test_padding.rs b/runtime/test/src/test_padding.rs
new file mode 100644
index 0000000..85da8f3
--- /dev/null
+++ b/runtime/test/src/test_padding.rs
@@ -0,0 +1,429 @@
+use crate::protobuf;
+use graph::prelude::tokio;
+
+use self::data::BadFixed;
+
+const WASM_FILE_NAME: &str = "test_padding.wasm";
+
+//for tests, to run in parallel, sub graph name has be unique
+fn rnd_sub_graph_name(size: usize) -> String {
+    use rand::{distributions::Alphanumeric, Rng};
+    rand::thread_rng()
+        .sample_iter(&Alphanumeric)
+        .take(size)
+        .map(char::from)
+        .collect()
+}
+
+pub mod data {
+    #[graph_runtime_derive::generate_asc_type()]
+    #[graph_runtime_derive::generate_network_type_id(UnitTestNetwork)]
+    #[graph_runtime_derive::generate_from_rust_type()]
+    #[graph_runtime_derive::generate_array_type(UnitTestNetwork)]
+    #[derive(Debug, PartialEq)]
+    pub struct UnitTestTypeBool {
+        pub str_pref: String,
+        pub under_test: bool,
+        pub str_suff: String,
+        pub large: i64,
+        pub tail: bool,
+    }
+
+    #[graph_runtime_derive::generate_asc_type()]
+    #[graph_runtime_derive::generate_network_type_id(UnitTestNetwork)]
+    #[graph_runtime_derive::generate_from_rust_type()]
+    #[graph_runtime_derive::generate_array_type(UnitTestNetwork)]
+    #[derive(Debug, PartialEq)]
+    pub struct UnitTestTypeI8 {
+        pub str_pref: String,
+        pub under_test: i8,
+        pub str_suff: String,
+        pub large: i64,
+        pub tail: bool,
+    }
+    #[graph_runtime_derive::generate_asc_type()]
+    #[graph_runtime_derive::generate_network_type_id(UnitTestNetwork)]
+    #[graph_runtime_derive::generate_from_rust_type()]
+    #[graph_runtime_derive::generate_array_type(UnitTestNetwork)]
+    #[derive(Debug, PartialEq)]
+    pub struct UnitTestTypeU16 {
+        pub str_pref: String,
+        pub under_test: u16,
+        pub str_suff: String,
+        pub large: i64,
+        pub tail: bool,
+    }
+    #[graph_runtime_derive::generate_asc_type()]
+    #[graph_runtime_derive::generate_network_type_id(UnitTestNetwork)]
+    #[graph_runtime_derive::generate_from_rust_type()]
+    #[graph_runtime_derive::generate_array_type(UnitTestNetwork)]
+    #[derive(Debug, PartialEq)]
+    pub struct UnitTestTypeU32 {
+        pub str_pref: String,
+        pub under_test: u32,
+        pub str_suff: String,
+        pub large: i64,
+        pub tail: bool,
+    }
+
+    pub struct Bad {
+        pub nonce: u64,
+        pub str_suff: String,
+        pub tail: u64,
+    }
+
+    #[repr(C)]
+    pub struct AscBad {
+        pub nonce: u64,
+        pub str_suff: graph::runtime::AscPtr<graph_runtime_wasm::asc_abi::class::AscString>,
+        pub tail: u64,
+    }
+
+    impl AscType for AscBad {
+        fn to_asc_bytes(&self) -> Result<Vec<u8>, DeterministicHostError> {
+            let in_memory_byte_count = std::mem::size_of::<Self>();
+            let mut bytes = Vec::with_capacity(in_memory_byte_count);
+
+            bytes.extend_from_slice(&self.nonce.to_asc_bytes()?);
+            bytes.extend_from_slice(&self.str_suff.to_asc_bytes()?);
+            bytes.extend_from_slice(&self.tail.to_asc_bytes()?);
+
+            //ensure misaligned
+            assert!(
+                bytes.len() != in_memory_byte_count,
+                "struct is intentionally misaligned",
+            );
+            Ok(bytes)
+        }
+
+        fn from_asc_bytes(
+            _asc_obj: &[u8],
+            _api_version: &graph::semver::Version,
+        ) -> Result<Self, DeterministicHostError> {
+            unimplemented!();
+        }
+    }
+
+    impl AscIndexId for AscBad {
+        const INDEX_ASC_TYPE_ID: IndexForAscTypeId =
+            IndexForAscTypeId::UnitTestNetworkUnitTestTypeBool;
+    }
+
+    pub use graph::runtime::{
+        asc_new, gas::GasCounter, AscHeap, AscIndexId, AscPtr, AscType, AscValue,
+        DeterministicHostError, IndexForAscTypeId, ToAscObj,
+    };
+
+    impl ToAscObj<AscBad> for Bad {
+        fn to_asc_obj<H: AscHeap + ?Sized>(
+            &self,
+            heap: &mut H,
+            gas: &GasCounter,
+        ) -> Result<AscBad, DeterministicHostError> {
+            Ok(AscBad {
+                nonce: self.nonce,
+                str_suff: asc_new(heap, &self.str_suff, gas)?,
+                tail: self.tail,
+            })
+        }
+    }
+
+    pub struct BadFixed {
+        pub nonce: u64,
+        pub str_suff: String,
+        pub tail: u64,
+    }
+    #[repr(C)]
+    pub struct AscBadFixed {
+        pub nonce: u64,
+        pub str_suff: graph::runtime::AscPtr<graph_runtime_wasm::asc_abi::class::AscString>,
+        pub _padding: u32,
+        pub tail: u64,
+    }
+
+    impl AscType for AscBadFixed {
+        fn to_asc_bytes(&self) -> Result<Vec<u8>, DeterministicHostError> {
+            let in_memory_byte_count = std::mem::size_of::<Self>();
+            let mut bytes = Vec::with_capacity(in_memory_byte_count);
+
+            bytes.extend_from_slice(&self.nonce.to_asc_bytes()?);
+            bytes.extend_from_slice(&self.str_suff.to_asc_bytes()?);
+            bytes.extend_from_slice(&self._padding.to_asc_bytes()?);
+            bytes.extend_from_slice(&self.tail.to_asc_bytes()?);
+
+            assert_eq!(
+                bytes.len(),
+                in_memory_byte_count,
+                "Alignment mismatch for AscBadFixed, re-order fields or explicitely add a _padding field",
+            );
+            Ok(bytes)
+        }
+
+        fn from_asc_bytes(
+            _asc_obj: &[u8],
+            _api_version: &graph::semver::Version,
+        ) -> Result<Self, DeterministicHostError> {
+            unimplemented!();
+        }
+    }
+
+    //we will have to keep this chain specific (Inner/Outer)
+    impl AscIndexId for AscBadFixed {
+        const INDEX_ASC_TYPE_ID: IndexForAscTypeId =
+            IndexForAscTypeId::UnitTestNetworkUnitTestTypeBool;
+    }
+
+    impl ToAscObj<AscBadFixed> for BadFixed {
+        fn to_asc_obj<H: AscHeap + ?Sized>(
+            &self,
+            heap: &mut H,
+            gas: &GasCounter,
+        ) -> Result<AscBadFixed, DeterministicHostError> {
+            Ok(AscBadFixed {
+                nonce: self.nonce,
+                str_suff: asc_new(heap, &self.str_suff, gas)?,
+                _padding: 0,
+                tail: self.tail,
+            })
+        }
+    }
+}
+
+#[tokio::test]
+async fn test_v5_manual_padding_manualy_fixed_ok() {
+    manual_padding_manualy_fixed_ok(super::test::API_VERSION_0_0_5).await
+}
+
+#[tokio::test]
+async fn test_v4_manual_padding_manualy_fixed_ok() {
+    manual_padding_manualy_fixed_ok(super::test::API_VERSION_0_0_4).await
+}
+
+#[tokio::test]
+async fn test_v5_manual_padding_should_fail() {
+    manual_padding_should_fail(super::test::API_VERSION_0_0_5).await
+}
+
+#[tokio::test]
+async fn test_v4_manual_padding_should_fail() {
+    manual_padding_should_fail(super::test::API_VERSION_0_0_4).await
+}
+
+#[tokio::test]
+async fn test_v5_bool_padding_ok() {
+    bool_padding_ok(super::test::API_VERSION_0_0_5).await
+}
+
+#[tokio::test]
+async fn test_v4_bool_padding_ok() {
+    bool_padding_ok(super::test::API_VERSION_0_0_4).await
+}
+
+#[tokio::test]
+async fn test_v5_i8_padding_ok() {
+    i8_padding_ok(super::test::API_VERSION_0_0_5).await
+}
+
+#[tokio::test]
+async fn test_v4_i8_padding_ok() {
+    i8_padding_ok(super::test::API_VERSION_0_0_4).await
+}
+
+#[tokio::test]
+async fn test_v5_u16_padding_ok() {
+    u16_padding_ok(super::test::API_VERSION_0_0_5).await
+}
+
+#[tokio::test]
+async fn test_v4_u16_padding_ok() {
+    u16_padding_ok(super::test::API_VERSION_0_0_4).await
+}
+
+#[tokio::test]
+async fn test_v5_u32_padding_ok() {
+    u32_padding_ok(super::test::API_VERSION_0_0_5).await
+}
+
+#[tokio::test]
+async fn test_v4_u32_padding_ok() {
+    u32_padding_ok(super::test::API_VERSION_0_0_4).await
+}
+
+async fn manual_padding_should_fail(api_version: semver::Version) {
+    let mut module = super::test::test_module(
+        &rnd_sub_graph_name(12),
+        super::common::mock_data_source(
+            &super::test::wasm_file_path(WASM_FILE_NAME, api_version.clone()),
+            api_version.clone(),
+        ),
+        api_version,
+    )
+    .await;
+
+    let parm = protobuf::Bad {
+        nonce: i64::MAX as u64,
+        str_suff: "suff".into(),
+        tail: i64::MAX as u64,
+    };
+
+    let new_obj = module.asc_new(&parm).unwrap();
+
+    let func = module
+        .get_func("test_padding_manual")
+        .typed()
+        .unwrap()
+        .clone();
+
+    let res: Result<(), _> = func.call(new_obj.wasm_ptr());
+
+    assert!(
+        res.is_err(),
+        "suposed to fail due to WASM memory padding error"
+    );
+}
+
+async fn manual_padding_manualy_fixed_ok(api_version: semver::Version) {
+    let parm = BadFixed {
+        nonce: i64::MAX as u64,
+        str_suff: "suff".into(),
+        tail: i64::MAX as u64,
+    };
+
+    let mut module = super::test::test_module(
+        &rnd_sub_graph_name(12),
+        super::common::mock_data_source(
+            &super::test::wasm_file_path(WASM_FILE_NAME, api_version.clone()),
+            api_version.clone(),
+        ),
+        api_version.clone(),
+    )
+    .await;
+
+    let new_obj = module.asc_new(&parm).unwrap();
+
+    let func = module
+        .get_func("test_padding_manual")
+        .typed()
+        .unwrap()
+        .clone();
+
+    let res: Result<(), _> = func.call(new_obj.wasm_ptr());
+
+    assert!(res.is_ok(), "{:?}", res.err());
+}
+
+async fn bool_padding_ok(api_version: semver::Version) {
+    let mut module = super::test::test_module(
+        &rnd_sub_graph_name(12),
+        super::common::mock_data_source(
+            &super::test::wasm_file_path(WASM_FILE_NAME, api_version.clone()),
+            api_version.clone(),
+        ),
+        api_version,
+    )
+    .await;
+
+    let parm = protobuf::UnitTestTypeBool {
+        str_pref: "pref".into(),
+        under_test: true,
+        str_suff: "suff".into(),
+        large: i64::MAX,
+        tail: true,
+    };
+
+    let new_obj = module.asc_new(&parm).unwrap();
+
+    let func = module
+        .get_func("test_padding_bool")
+        .typed()
+        .unwrap()
+        .clone();
+
+    let res: Result<(), _> = func.call(new_obj.wasm_ptr());
+
+    assert!(res.is_ok(), "{:?}", res.err());
+}
+
+async fn i8_padding_ok(api_version: semver::Version) {
+    let mut module = super::test::test_module(
+        &rnd_sub_graph_name(12),
+        super::common::mock_data_source(
+            &super::test::wasm_file_path(WASM_FILE_NAME, api_version.clone()),
+            api_version.clone(),
+        ),
+        api_version,
+    )
+    .await;
+
+    let parm = protobuf::UnitTestTypeI8 {
+        str_pref: "pref".into(),
+        under_test: i8::MAX,
+        str_suff: "suff".into(),
+        large: i64::MAX,
+        tail: true,
+    };
+
+    let new_obj = module.asc_new(&parm).unwrap();
+
+    let func = module.get_func("test_padding_i8").typed().unwrap().clone();
+
+    let res: Result<(), _> = func.call(new_obj.wasm_ptr());
+
+    assert!(res.is_ok(), "{:?}", res.err());
+}
+
+async fn u16_padding_ok(api_version: semver::Version) {
+    let mut module = super::test::test_module(
+        &rnd_sub_graph_name(12),
+        super::common::mock_data_source(
+            &super::test::wasm_file_path(WASM_FILE_NAME, api_version.clone()),
+            api_version.clone(),
+        ),
+        api_version,
+    )
+    .await;
+
+    let parm = protobuf::UnitTestTypeU16 {
+        str_pref: "pref".into(),
+        under_test: i16::MAX as u16,
+        str_suff: "suff".into(),
+        large: i64::MAX,
+        tail: true,
+    };
+
+    let new_obj = module.asc_new(&parm).unwrap();
+
+    let func = module.get_func("test_padding_i16").typed().unwrap().clone();
+
+    let res: Result<(), _> = func.call(new_obj.wasm_ptr());
+
+    assert!(res.is_ok(), "{:?}", res.err());
+}
+
+async fn u32_padding_ok(api_version: semver::Version) {
+    let mut module = super::test::test_module(
+        &rnd_sub_graph_name(12),
+        super::common::mock_data_source(
+            &super::test::wasm_file_path(WASM_FILE_NAME, api_version.clone()),
+            api_version.clone(),
+        ),
+        api_version,
+    )
+    .await;
+
+    let parm = protobuf::UnitTestTypeU32 {
+        str_pref: "pref".into(),
+        under_test: i32::MAX as u32,
+        str_suff: "suff".into(),
+        large: i64::MAX,
+        tail: true,
+    };
+
+    let new_obj = module.asc_new(&parm).unwrap();
+
+    let func = module.get_func("test_padding_i32").typed().unwrap().clone();
+
+    let res: Result<(), _> = func.call(new_obj.wasm_ptr());
+
+    assert!(res.is_ok(), "{:?}", res.err());
+}
diff --git a/runtime/test/wasm_test/api_version_0_0_4/abi_classes.ts b/runtime/test/wasm_test/api_version_0_0_4/abi_classes.ts
new file mode 100644
index 0000000..bac8093
--- /dev/null
+++ b/runtime/test/wasm_test/api_version_0_0_4/abi_classes.ts
@@ -0,0 +1,72 @@
+import "allocator/arena";
+
+export { memory };
+
+// Sequence of 20 `u8`s.
+type Address = Uint8Array;
+
+const array_buffer_header_size = 8;
+
+// Clone the address to a new buffer, add 1 to the first and last bytes of the
+// address and return the new address.
+export function test_address(address: Address): Address {
+  let new_address = address.subarray();
+
+  // Add 1 to the first and last byte.
+  new_address[0] += 1;
+  new_address[address.length - 1] += 1;
+
+  return new_address
+}
+
+// Sequence of 32 `u8`s.
+type Uint = Uint8Array;
+
+// Clone the Uint to a new buffer, add 1 to the first and last `u8`s and return
+// the new Uint.
+export function test_uint(address: Uint): Uint {
+  let new_address = address.subarray();
+
+  // Add 1 to the first byte.
+  new_address[0] += 1;
+
+  return new_address
+}
+
+// Return the string repeated twice.
+export function repeat_twice(original: string): string {
+  return original.repeat(2)
+}
+
+// Sequences of `u8`s.
+type FixedBytes = Uint8Array;
+type Bytes = Uint8Array;
+
+// Concatenate two byte sequences into a new one.
+export function concat(bytes1: Bytes, bytes2: FixedBytes): Bytes {
+  let concated = new ArrayBuffer(bytes1.byteLength + bytes2.byteLength);
+  let concated_offset = changetype<usize>(concated) + array_buffer_header_size;
+  let bytes1_start = load<usize>(changetype<usize>(bytes1)) + array_buffer_header_size;
+  let bytes2_start = load<usize>(changetype<usize>(bytes2)) + array_buffer_header_size;
+
+  // Move bytes1.
+  memory.copy(concated_offset, bytes1_start, bytes1.byteLength);
+  concated_offset += bytes1.byteLength
+
+  // Move bytes2.
+  memory.copy(concated_offset, bytes2_start, bytes2.byteLength);
+
+  let new_typed_array = new Uint8Array(concated.byteLength);
+  store<usize>(changetype<usize>(new_typed_array), changetype<usize>(concated));
+
+  return new_typed_array;
+}
+
+export function test_array(strings: Array<string>): Array<string> {
+  strings.push("5")
+  return strings
+}
+
+export function byte_array_third_quarter(bytes: Uint8Array): Uint8Array {
+  return bytes.subarray(bytes.length * 2/4, bytes.length * 3/4)
+}
diff --git a/runtime/test/wasm_test/api_version_0_0_4/abi_classes.wasm b/runtime/test/wasm_test/api_version_0_0_4/abi_classes.wasm
new file mode 100644
index 0000000..274d1e3
Binary files /dev/null and b/runtime/test/wasm_test/api_version_0_0_4/abi_classes.wasm differ
diff --git a/runtime/test/wasm_test/api_version_0_0_4/abi_store_value.ts b/runtime/test/wasm_test/api_version_0_0_4/abi_store_value.ts
new file mode 100644
index 0000000..69e67ea
--- /dev/null
+++ b/runtime/test/wasm_test/api_version_0_0_4/abi_store_value.ts
@@ -0,0 +1,104 @@
+import "allocator/arena";
+
+export { memory };
+
+enum ValueKind {
+    STRING = 0,
+    INT = 1,
+    BIG_DECIMAL = 2,
+    BOOL = 3,
+    ARRAY = 4,
+    NULL = 5,
+    BYTES = 6,
+    BIG_INT = 7,
+}
+
+// Big enough to fit any pointer or native `this.data`.
+type Payload = u64
+
+type Bytes = Uint8Array;
+type BigInt = Uint8Array;
+
+export class BigDecimal {
+    exp: BigInt
+    digits: BigInt
+}
+
+export class Value {
+    kind: ValueKind
+    data: Payload
+}
+
+export function value_from_string(str: string): Value {
+    let token = new Value();
+    token.kind = ValueKind.STRING;
+    token.data = str as u64;
+    return token
+}
+
+export function value_from_int(int: i32): Value {
+    let value = new Value();
+    value.kind = ValueKind.INT;
+    value.data = int as u64
+    return value
+}
+
+export function value_from_big_decimal(float: BigInt): Value {
+    let value = new Value();
+    value.kind = ValueKind.BIG_DECIMAL;
+    value.data = float as u64;
+    return value
+}
+
+export function value_from_bool(bool: boolean): Value {
+    let value = new Value();
+    value.kind = ValueKind.BOOL;
+    value.data = bool ? 1 : 0;
+    return value
+}
+
+export function array_from_values(str: string, i: i32): Value {
+    let array = new Array<Value>();
+    array.push(value_from_string(str));
+    array.push(value_from_int(i));
+
+    let value = new Value();
+    value.kind = ValueKind.ARRAY;
+    value.data = array as u64;
+    return value
+}
+
+export function value_null(): Value {
+    let value = new Value();
+    value.kind = ValueKind.NULL;
+    return value
+}
+
+export function value_from_bytes(bytes: Bytes): Value {
+    let value = new Value();
+    value.kind = ValueKind.BYTES;
+    value.data = bytes as u64;
+    return value
+}
+
+export function value_from_bigint(bigint: BigInt): Value {
+    let value = new Value();
+    value.kind = ValueKind.BIG_INT;
+    value.data = bigint as u64;
+    return value
+}
+
+export function value_from_array(array: Array<string>): Value {
+    let value = new Value()
+    value.kind = ValueKind.ARRAY
+    value.data = array as u64
+    return value
+}
+
+// Test that this does not cause undefined behaviour in Rust.
+export function invalid_discriminant(): Value {
+    let token = new Value();
+    token.kind = 70;
+    token.data = "blebers" as u64;
+    return token
+}
diff --git a/runtime/test/wasm_test/api_version_0_0_4/abi_store_value.wasm b/runtime/test/wasm_test/api_version_0_0_4/abi_store_value.wasm
new file mode 100644
index 0000000..635271b
Binary files /dev/null and b/runtime/test/wasm_test/api_version_0_0_4/abi_store_value.wasm differ
diff --git a/runtime/test/wasm_test/api_version_0_0_4/abi_token.ts b/runtime/test/wasm_test/api_version_0_0_4/abi_token.ts
new file mode 100644
index 0000000..7c59dc7
--- /dev/null
+++ b/runtime/test/wasm_test/api_version_0_0_4/abi_token.ts
@@ -0,0 +1,122 @@
+import "allocator/arena";
+
+export { memory };
+
+// Sequence of 20 `u8`s.
+type Address = Uint8Array;
+
+// Sequences of `u8`s.
+type Bytes = Uint8Array;
+
+// Sequence of 4 `u64`s.
+type Int = Uint64Array;
+type Uint = Uint64Array;
+
+enum TokenKind {
+    ADDRESS = 0,
+    FIXED_BYTES = 1,
+    BYTES = 2,
+    INT = 3,
+    UINT = 4,
+    BOOL = 5,
+    STRING = 6,
+    FIXED_ARRAY = 7,
+    ARRAY = 8
+}
+
+// Big enough to fit any pointer or native this.data.
+type Payload = u64
+
+export class Token {
+    kind: TokenKind
+    data: Payload
+}
+
+export function token_to_address(token: Token): Address {  
+    assert(token.kind == TokenKind.ADDRESS, "Token is not an address.");
+    return changetype<Address>(token.data as u32);
+}
+  
+export function token_to_bytes(token: Token): Bytes {
+    assert(token.kind == TokenKind.FIXED_BYTES 
+            || token.kind == TokenKind.BYTES, "Token is not bytes.")
+    return changetype<Bytes>(token.data as u32)
+}
+  
+export function token_to_int(token: Token): Int {
+    assert(token.kind == TokenKind.INT
+            || token.kind == TokenKind.UINT, "Token is not an int or uint.")
+    return changetype<Int>(token.data as u32)
+}
+
+export function token_to_uint(token: Token): Uint {
+    assert(token.kind == TokenKind.INT
+            || token.kind == TokenKind.UINT, "Token is not an int or uint.")
+    return changetype<Uint>(token.data as u32)
+}
+
+export function token_to_bool(token: Token): boolean {
+    assert(token.kind == TokenKind.BOOL, "Token is not a boolean.")
+    return token.data != 0
+}
+  
+export function token_to_string(token: Token): string {
+    assert(token.kind == TokenKind.STRING, "Token is not a string.")
+    return changetype<string>(token.data as u32)
+}
+  
+export function token_to_array(token: Token): Array<Token> {
+    assert(token.kind == TokenKind.FIXED_ARRAY ||
+        token.kind == TokenKind.ARRAY, "Token is not an array.")
+    return changetype<Array<Token>>(token.data as u32)
+}
+
+
+export function token_from_address(address: Address): Token {  
+    let token: Token;
+    token.kind = TokenKind.ADDRESS;
+    token.data = address as u64;
+    return token
+}
+
+export function token_from_bytes(bytes: Bytes): Token {
+    let token: Token;
+    token.kind = TokenKind.BYTES;
+    token.data = bytes as u64;
+    return token
+}
+  
+export function token_from_int(int: Int): Token {
+    let token: Token;
+    token.kind = TokenKind.INT;
+    token.data = int as u64;
+    return token
+}
+
+export function token_from_uint(uint: Uint): Token {
+    let token: Token;
+    token.kind = TokenKind.UINT;
+    token.data = uint as u64;
+    return token
+}
+
+export function token_from_bool(bool: boolean): Token {
+    let token: Token;
+    token.kind = TokenKind.BOOL;
+    token.data = bool as u64;
+    return token
+}
+  
+export function token_from_string(str: string): Token {
+    let token: Token;
+    token.kind = TokenKind.STRING;
+    token.data = str as u64;
+    return token
+}
+  
+export function token_from_array(array: Token): Token {
+    let token: Token;
+    token.kind = TokenKind.ARRAY;
+    token.data = array as u64;
+    return token
+}
diff --git a/runtime/test/wasm_test/api_version_0_0_4/abi_token.wasm b/runtime/test/wasm_test/api_version_0_0_4/abi_token.wasm
new file mode 100644
index 0000000..edf14dc
Binary files /dev/null and b/runtime/test/wasm_test/api_version_0_0_4/abi_token.wasm differ
diff --git a/runtime/test/wasm_test/api_version_0_0_4/abort.ts b/runtime/test/wasm_test/api_version_0_0_4/abort.ts
new file mode 100644
index 0000000..5ff4b1a
--- /dev/null
+++ b/runtime/test/wasm_test/api_version_0_0_4/abort.ts
@@ -0,0 +1,7 @@
+import "allocator/arena";
+
+export { memory };
+
+export function abort(): void {
+  assert(false, "not true")
+}
diff --git a/runtime/test/wasm_test/api_version_0_0_4/abort.wasm b/runtime/test/wasm_test/api_version_0_0_4/abort.wasm
new file mode 100644
index 0000000..2fbfbab
Binary files /dev/null and b/runtime/test/wasm_test/api_version_0_0_4/abort.wasm differ
diff --git a/runtime/test/wasm_test/api_version_0_0_4/big_int_arithmetic.ts b/runtime/test/wasm_test/api_version_0_0_4/big_int_arithmetic.ts
new file mode 100644
index 0000000..1fe4615
--- /dev/null
+++ b/runtime/test/wasm_test/api_version_0_0_4/big_int_arithmetic.ts
@@ -0,0 +1,33 @@
+import "allocator/arena";
+
+export { memory };
+
+type BigInt = Uint8Array;
+
+declare namespace bigInt {
+    function plus(x: BigInt, y: BigInt): BigInt
+    function minus(x: BigInt, y: BigInt): BigInt
+    function times(x: BigInt, y: BigInt): BigInt
+    function dividedBy(x: BigInt, y: BigInt): BigInt
+    function mod(x: BigInt, y: BigInt): BigInt
+}
+
+export function plus(x: BigInt, y: BigInt): BigInt {
+    return bigInt.plus(x, y)
+}
+
+export function minus(x: BigInt, y: BigInt): BigInt {
+    return bigInt.minus(x, y)
+}
+
+export function times(x: BigInt, y: BigInt): BigInt {
+    return bigInt.times(x, y)
+}
+
+export function dividedBy(x: BigInt, y: BigInt): BigInt {
+    return bigInt.dividedBy(x, y)
+}
+
+export function mod(x: BigInt, y: BigInt): BigInt {
+    return bigInt.mod(x, y)
+}
diff --git a/runtime/test/wasm_test/api_version_0_0_4/big_int_arithmetic.wasm b/runtime/test/wasm_test/api_version_0_0_4/big_int_arithmetic.wasm
new file mode 100644
index 0000000..df2f9e3
Binary files /dev/null and b/runtime/test/wasm_test/api_version_0_0_4/big_int_arithmetic.wasm differ
diff --git a/runtime/test/wasm_test/api_version_0_0_4/big_int_to_hex.ts b/runtime/test/wasm_test/api_version_0_0_4/big_int_to_hex.ts
new file mode 100644
index 0000000..8e9b77d
--- /dev/null
+++ b/runtime/test/wasm_test/api_version_0_0_4/big_int_to_hex.ts
@@ -0,0 +1,11 @@
+import "allocator/arena";
+
+export { memory };
+
+declare namespace typeConversion {
+    function bigIntToHex(n: Uint8Array): String
+}
+
+export function big_int_to_hex(n: Uint8Array): String {
+    return typeConversion.bigIntToHex(n)
+}
diff --git a/runtime/test/wasm_test/api_version_0_0_4/big_int_to_hex.wasm b/runtime/test/wasm_test/api_version_0_0_4/big_int_to_hex.wasm
new file mode 100644
index 0000000..9e30ff2
Binary files /dev/null and b/runtime/test/wasm_test/api_version_0_0_4/big_int_to_hex.wasm differ
diff --git a/runtime/test/wasm_test/api_version_0_0_4/big_int_to_string.ts b/runtime/test/wasm_test/api_version_0_0_4/big_int_to_string.ts
new file mode 100644
index 0000000..d2c4651
--- /dev/null
+++ b/runtime/test/wasm_test/api_version_0_0_4/big_int_to_string.ts
@@ -0,0 +1,11 @@
+import "allocator/arena";
+
+export { memory };
+
+declare namespace typeConversion {
+    function bigIntToString(n: Uint8Array): String
+}
+
+export function big_int_to_string(n: Uint8Array): String {
+    return typeConversion.bigIntToString(n)
+}
diff --git a/runtime/test/wasm_test/api_version_0_0_4/big_int_to_string.wasm b/runtime/test/wasm_test/api_version_0_0_4/big_int_to_string.wasm
new file mode 100644
index 0000000..40063ca
Binary files /dev/null and b/runtime/test/wasm_test/api_version_0_0_4/big_int_to_string.wasm differ
diff --git a/runtime/test/wasm_test/api_version_0_0_4/bytes_to_base58.ts b/runtime/test/wasm_test/api_version_0_0_4/bytes_to_base58.ts
new file mode 100644
index 0000000..b867cee
--- /dev/null
+++ b/runtime/test/wasm_test/api_version_0_0_4/bytes_to_base58.ts
@@ -0,0 +1,11 @@
+import "allocator/arena";
+
+export { memory };
+
+declare namespace typeConversion {
+    function bytesToBase58(n: Uint8Array): string
+}
+
+export function bytes_to_base58(n: Uint8Array): string {
+    return typeConversion.bytesToBase58(n)
+}
diff --git a/runtime/test/wasm_test/api_version_0_0_4/bytes_to_base58.wasm b/runtime/test/wasm_test/api_version_0_0_4/bytes_to_base58.wasm
new file mode 100644
index 0000000..ea85915
Binary files /dev/null and b/runtime/test/wasm_test/api_version_0_0_4/bytes_to_base58.wasm differ
diff --git a/runtime/test/wasm_test/api_version_0_0_4/contract_calls.ts b/runtime/test/wasm_test/api_version_0_0_4/contract_calls.ts
new file mode 100644
index 0000000..003bd38
--- /dev/null
+++ b/runtime/test/wasm_test/api_version_0_0_4/contract_calls.ts
@@ -0,0 +1,9 @@
+type Address = Uint8Array;
+
+export declare namespace ethereum {
+  function call(call: Address): Array<Address> | null
+}
+
+export function callContract(address: Address): void {
+  ethereum.call(address)
+}
\ No newline at end of file
diff --git a/runtime/test/wasm_test/api_version_0_0_4/contract_calls.wasm b/runtime/test/wasm_test/api_version_0_0_4/contract_calls.wasm
new file mode 100644
index 0000000..6206608
Binary files /dev/null and b/runtime/test/wasm_test/api_version_0_0_4/contract_calls.wasm differ
diff --git a/runtime/test/wasm_test/api_version_0_0_4/crypto.ts b/runtime/test/wasm_test/api_version_0_0_4/crypto.ts
new file mode 100644
index 0000000..8210831
--- /dev/null
+++ b/runtime/test/wasm_test/api_version_0_0_4/crypto.ts
@@ -0,0 +1,11 @@
+import "allocator/arena";
+
+export { memory };
+
+declare namespace crypto {
+    function keccak256(input: Uint8Array): Uint8Array
+}
+
+export function hash(input: Uint8Array): Uint8Array {
+    return crypto.keccak256(input)
+}
diff --git a/runtime/test/wasm_test/api_version_0_0_4/crypto.wasm b/runtime/test/wasm_test/api_version_0_0_4/crypto.wasm
new file mode 100644
index 0000000..c683c05
Binary files /dev/null and b/runtime/test/wasm_test/api_version_0_0_4/crypto.wasm differ
diff --git a/runtime/test/wasm_test/api_version_0_0_4/data_source_create.ts b/runtime/test/wasm_test/api_version_0_0_4/data_source_create.ts
new file mode 100644
index 0000000..ca12b37
--- /dev/null
+++ b/runtime/test/wasm_test/api_version_0_0_4/data_source_create.ts
@@ -0,0 +1,11 @@
+import "allocator/arena";
+
+export { memory };
+
+declare namespace dataSource {
+    function create(name: string, params: Array<string>): void
+}
+
+export function dataSourceCreate(name: string, params: Array<string>): void {
+    dataSource.create(name, params)
+}
diff --git a/runtime/test/wasm_test/api_version_0_0_4/data_source_create.wasm b/runtime/test/wasm_test/api_version_0_0_4/data_source_create.wasm
new file mode 100644
index 0000000..02b302a
Binary files /dev/null and b/runtime/test/wasm_test/api_version_0_0_4/data_source_create.wasm differ
diff --git a/runtime/test/wasm_test/api_version_0_0_4/ens_name_by_hash.ts b/runtime/test/wasm_test/api_version_0_0_4/ens_name_by_hash.ts
new file mode 100644
index 0000000..0e2748f
--- /dev/null
+++ b/runtime/test/wasm_test/api_version_0_0_4/ens_name_by_hash.ts
@@ -0,0 +1,11 @@
+import "allocator/arena";
+
+export { memory };
+
+declare namespace ens {
+    function nameByHash(hash: string): string|null
+}
+
+export function nameByHash(hash: string): string|null {
+  return ens.nameByHash(hash)
+}
diff --git a/runtime/test/wasm_test/api_version_0_0_4/ens_name_by_hash.wasm b/runtime/test/wasm_test/api_version_0_0_4/ens_name_by_hash.wasm
new file mode 100644
index 0000000..c7e21be
Binary files /dev/null and b/runtime/test/wasm_test/api_version_0_0_4/ens_name_by_hash.wasm differ
diff --git a/runtime/test/wasm_test/api_version_0_0_4/ipfs_cat.ts b/runtime/test/wasm_test/api_version_0_0_4/ipfs_cat.ts
new file mode 100644
index 0000000..76a06d7
--- /dev/null
+++ b/runtime/test/wasm_test/api_version_0_0_4/ipfs_cat.ts
@@ -0,0 +1,19 @@
+import "allocator/arena";
+
+export { memory };
+
+declare namespace typeConversion {
+    function bytesToString(bytes: Uint8Array): string
+}
+
+declare namespace ipfs {
+    function cat(hash: String): Uint8Array
+}
+
+export function ipfsCatString(hash: string): string {
+    return typeConversion.bytesToString(ipfs.cat(hash))
+}
+
+export function ipfsCat(hash: string): Uint8Array {
+    return ipfs.cat(hash)
+}
diff --git a/runtime/test/wasm_test/api_version_0_0_4/ipfs_cat.wasm b/runtime/test/wasm_test/api_version_0_0_4/ipfs_cat.wasm
new file mode 100644
index 0000000..dc52142
Binary files /dev/null and b/runtime/test/wasm_test/api_version_0_0_4/ipfs_cat.wasm differ
diff --git a/runtime/test/wasm_test/api_version_0_0_4/ipfs_map.ts b/runtime/test/wasm_test/api_version_0_0_4/ipfs_map.ts
new file mode 100644
index 0000000..acab2eb
--- /dev/null
+++ b/runtime/test/wasm_test/api_version_0_0_4/ipfs_map.ts
@@ -0,0 +1,138 @@
+import "allocator/arena";
+
+export { memory };
+
+/*
+ * Declarations copied from graph-ts/input.ts and edited for brevity
+ */
+
+declare namespace store {
+  function set(entity: string, id: string, data: Entity): void
+}
+
+class TypedMapEntry<K, V> {
+  key: K
+  value: V
+
+  constructor(key: K, value: V) {
+    this.key = key
+    this.value = value
+  }
+}
+
+class TypedMap<K, V> {
+  entries: Array<TypedMapEntry<K, V>>
+
+  constructor() {
+    this.entries = new Array<TypedMapEntry<K, V>>(0)
+  }
+
+  set(key: K, value: V): void {
+    let entry = this.getEntry(key)
+    if (entry !== null) {
+      entry.value = value
+    } else {
+      let entry = new TypedMapEntry<K, V>(key, value)
+      this.entries.push(entry)
+    }
+  }
+
+  getEntry(key: K): TypedMapEntry<K, V> | null {
+    for (let i: i32 = 0; i < this.entries.length; i++) {
+      if (this.entries[i].key == key) {
+        return this.entries[i]
+      }
+    }
+    return null
+  }
+
+  get(key: K): V | null {
+    for (let i: i32 = 0; i < this.entries.length; i++) {
+      if (this.entries[i].key == key) {
+        return this.entries[i].value
+      }
+    }
+    return null
+  }
+}
+
+enum ValueKind {
+  STRING = 0,
+  INT = 1,
+  FLOAT = 2,
+  BOOL = 3,
+  ARRAY = 4,
+  NULL = 5,
+  BYTES = 6,
+  BIGINT = 7,
+}
+
+type ValuePayload = u64
+
+class Value {
+  kind: ValueKind
+  data: ValuePayload
+
+  toString(): string {
+    assert(this.kind == ValueKind.STRING, 'Value is not a string.')
+    return changetype<string>(this.data as u32)
+  }
+
+  static fromString(s: string): Value {
+    let value = new Value()
+    value.kind = ValueKind.STRING
+    value.data = s as u64
+    return value
+  }
+}
+
+class Entity extends TypedMap<string, Value> { }
+
+enum JSONValueKind {
+  NULL = 0,
+  BOOL = 1,
+  NUMBER = 2,
+  STRING = 3,
+  ARRAY = 4,
+  OBJECT = 5,
+}
+
+type JSONValuePayload = u64
+class JSONValue {
+  kind: JSONValueKind
+  data: JSONValuePayload
+
+  toString(): string {
+    assert(this.kind == JSONValueKind.STRING, 'JSON value is not a string.')
+    return changetype<string>(this.data as u32)
+  }
+
+  toObject(): TypedMap<string, JSONValue> {
+    assert(this.kind == JSONValueKind.OBJECT, 'JSON value is not an object.')
+    return changetype<TypedMap<string, JSONValue>>(this.data as u32)
+  }
+}
+
+/*
+ * Actual setup for the test
+ */
+declare namespace ipfs {
+  function map(hash: String, callback: String, userData: Value, flags: String[]): void
+}
+
+export function echoToStore(data: JSONValue, userData: Value): void {
+  // expect a map of the form { "id": "anId", "value": "aValue" }
+  let map = data.toObject();
+  let id = map.get("id").toString();
+  let value = map.get("value").toString();
+
+  let entity = new Entity();
+  entity.set("id", Value.fromString(id));
+  entity.set("value", Value.fromString(value));
+  entity.set("extra", userData);
+  store.set("Thing", id, entity);
+}
+
+export function ipfsMap(hash: string, userData: string): void {
+  ipfs.map(hash, "echoToStore", Value.fromString(userData), ["json"])
+}
diff --git a/runtime/test/wasm_test/api_version_0_0_4/ipfs_map.wasm b/runtime/test/wasm_test/api_version_0_0_4/ipfs_map.wasm
new file mode 100644
index 0000000..5776f0f
Binary files /dev/null and b/runtime/test/wasm_test/api_version_0_0_4/ipfs_map.wasm differ
diff --git a/runtime/test/wasm_test/api_version_0_0_4/json_parsing.ts b/runtime/test/wasm_test/api_version_0_0_4/json_parsing.ts
new file mode 100644
index 0000000..0e55733
--- /dev/null
+++ b/runtime/test/wasm_test/api_version_0_0_4/json_parsing.ts
@@ -0,0 +1,78 @@
+import "allocator/arena";
+export { memory };
+
+export class Wrapped<T> {
+  inner: T;
+
+  constructor(inner: T) {
+    this.inner = inner;
+  }
+}
+
+export class Result<V, E> {
+  _value: Wrapped<V> | null;
+  _error: Wrapped<E> | null;
+
+  get isOk(): boolean {
+    return this._value !== null;
+  }
+
+  get isError(): boolean {
+    return this._error !== null;
+  }
+
+  get value(): V {
+    assert(this._value != null, "Trying to get a value from an error result");
+    return (this._value as Wrapped<V>).inner;
+  }
+
+  get error(): E {
+    assert(
+      this._error != null,
+      "Trying to get an error from a successful result"
+    );
+    return (this._error as Wrapped<E>).inner;
+  }
+}
+
+/** Type hint for JSON values. */
+export enum JSONValueKind {
+  NULL = 0,
+  BOOL = 1,
+  NUMBER = 2,
+  STRING = 3,
+  ARRAY = 4,
+  OBJECT = 5
+}
+
+/**
+ * Pointer type for JSONValue data.
+ *
+ * Big enough to fit any pointer or native `this.data`.
+ */
+export type JSONValuePayload = u64;
+
+export class JSONValue {
+  kind: JSONValueKind;
+  data: JSONValuePayload;
+
+  toString(): string {
+    assert(this.kind == JSONValueKind.STRING, "JSON value is not a string.");
+    return changetype<string>(this.data as u32);
+  }
+}
+
+export class Bytes extends Uint8Array {}
+
+declare namespace json {
+  function try_fromBytes(data: Bytes): Result<JSONValue, boolean>;
+}
+
+export function handleJsonError(data: Bytes): string {
+  let result = json.try_fromBytes(data);
+  if (result.isOk) {
+    return "OK: " + result.value.toString() + ", ERROR: " + (result.isError ? "true" : "false");
+  } else {
+    return "ERROR: " + (result.error ? "true" : "false");
+  }
+}
diff --git a/runtime/test/wasm_test/api_version_0_0_4/json_parsing.wasm b/runtime/test/wasm_test/api_version_0_0_4/json_parsing.wasm
new file mode 100644
index 0000000..ad6a932
Binary files /dev/null and b/runtime/test/wasm_test/api_version_0_0_4/json_parsing.wasm differ
diff --git a/runtime/test/wasm_test/api_version_0_0_4/non_terminating.ts b/runtime/test/wasm_test/api_version_0_0_4/non_terminating.ts
new file mode 100644
index 0000000..e289416
--- /dev/null
+++ b/runtime/test/wasm_test/api_version_0_0_4/non_terminating.ts
@@ -0,0 +1,11 @@
+import "allocator/arena";
+export { memory };
+
+// Test that non-terminating handlers are killed by timeout.
+export function loop(): void {
+    while (true) {}
+}
+
+export function rabbit_hole(): void {
+    rabbit_hole()
+}
diff --git a/runtime/test/wasm_test/api_version_0_0_4/non_terminating.wasm b/runtime/test/wasm_test/api_version_0_0_4/non_terminating.wasm
new file mode 100644
index 0000000..6e3eb54
Binary files /dev/null and b/runtime/test/wasm_test/api_version_0_0_4/non_terminating.wasm differ
diff --git a/runtime/test/wasm_test/api_version_0_0_4/store.ts b/runtime/test/wasm_test/api_version_0_0_4/store.ts
new file mode 100644
index 0000000..15c3b8e
--- /dev/null
+++ b/runtime/test/wasm_test/api_version_0_0_4/store.ts
@@ -0,0 +1,526 @@
+import "allocator/arena";
+
+export { memory };
+
+/** Definitions copied from graph-ts/index.ts */
+declare namespace store {
+  function get(entity: string, id: string): Entity | null
+  function set(entity: string, id: string, data: Entity): void
+  function remove(entity: string, id: string): void
+}
+
+/** Host Ethereum interface */
+declare namespace ethereum {
+  function call(call: SmartContractCall): Array<EthereumValue>
+}
+
+/** Host interface for BigInt arithmetic */
+declare namespace bigInt {
+  function plus(x: BigInt, y: BigInt): BigInt
+  function minus(x: BigInt, y: BigInt): BigInt
+  function times(x: BigInt, y: BigInt): BigInt
+  function dividedBy(x: BigInt, y: BigInt): BigInt
+  function dividedByDecimal(x: BigInt, y: BigDecimal): BigDecimal
+  function mod(x: BigInt, y: BigInt): BigInt
+}
+
+/** Host interface for BigDecimal */
+declare namespace bigDecimal {
+  function plus(x: BigDecimal, y: BigDecimal): BigDecimal
+  function minus(x: BigDecimal, y: BigDecimal): BigDecimal
+  function times(x: BigDecimal, y: BigDecimal): BigDecimal
+  function dividedBy(x: BigDecimal, y: BigDecimal): BigDecimal
+  function equals(x: BigDecimal, y: BigDecimal): boolean
+  function toString(bigDecimal: BigDecimal): string
+  function fromString(s: string): BigDecimal
+}
+
+/**
+ * TypedMap entry.
+ */
+class TypedMapEntry<K, V> {
+  key: K
+  value: V
+
+  constructor(key: K, value: V) {
+    this.key = key
+    this.value = value
+  }
+}
+
+/** Typed map */
+class TypedMap<K, V> {
+  entries: Array<TypedMapEntry<K, V>>
+
+  constructor() {
+    this.entries = new Array<TypedMapEntry<K, V>>(0)
+  }
+
+  set(key: K, value: V): void {
+    let entry = this.getEntry(key)
+    if (entry !== null) {
+      entry.value = value
+    } else {
+      let entry = new TypedMapEntry<K, V>(key, value)
+      this.entries.push(entry)
+    }
+  }
+
+  getEntry(key: K): TypedMapEntry<K, V> | null {
+    for (let i: i32 = 0; i < this.entries.length; i++) {
+      if (this.entries[i].key == key) {
+        return this.entries[i]
+      }
+    }
+    return null
+  }
+
+  get(key: K): V | null {
+    for (let i: i32 = 0; i < this.entries.length; i++) {
+      if (this.entries[i].key == key) {
+        return this.entries[i].value
+      }
+    }
+    return null
+  }
+
+  isSet(key: K): bool {
+    for (let i: i32 = 0; i < this.entries.length; i++) {
+      if (this.entries[i].key == key) {
+        return true
+      }
+    }
+    return false
+  }
+}
+
+/**
+ * Byte array
+ */
+class ByteArray extends Uint8Array {
+  toHex(): string {
+    return typeConversion.bytesToHex(this)
+  }
+
+  toHexString(): string {
+    return typeConversion.bytesToHex(this)
+  }
+
+  toString(): string {
+    return typeConversion.bytesToString(this)
+  }
+
+  toBase58(): string {
+    return typeConversion.bytesToBase58(this)
+  }
+}
+
+/** A dynamically-sized byte array. */
+class Bytes extends ByteArray { }
+
+/** An Ethereum address (20 bytes). */
+class Address extends Bytes {
+  static fromString(s: string): Address {
+    return typeConversion.stringToH160(s) as Address
+  }
+}
+
+/** An arbitrary size integer represented as an array of bytes. */
+class BigInt extends Uint8Array {
+  toHex(): string {
+    return typeConversion.bigIntToHex(this)
+  }
+
+  toHexString(): string {
+    return typeConversion.bigIntToHex(this)
+  }
+
+  toString(): string {
+    return typeConversion.bigIntToString(this)
+  }
+
+  static fromI32(x: i32): BigInt {
+    return typeConversion.i32ToBigInt(x) as BigInt
+  }
+
+  toI32(): i32 {
+    return typeConversion.bigIntToI32(this)
+  }
+
+  @operator('+')
+  plus(other: BigInt): BigInt {
+    return bigInt.plus(this, other)
+  }
+
+  @operator('-')
+  minus(other: BigInt): BigInt {
+    return bigInt.minus(this, other)
+  }
+
+  @operator('*')
+  times(other: BigInt): BigInt {
+    return bigInt.times(this, other)
+  }
+
+  @operator('/')
+  div(other: BigInt): BigInt {
+    return bigInt.dividedBy(this, other)
+  }
+
+  divDecimal(other: BigDecimal): BigDecimal {
+    return bigInt.dividedByDecimal(this, other)
+  }
+
+  @operator('%')
+  mod(other: BigInt): BigInt {
+    return bigInt.mod(this, other)
+  }
+
+  @operator('==')
+  equals(other: BigInt): boolean {
+    if (this.length !== other.length) {
+      return false;
+    }
+    for (let i = 0; i < this.length; i++) {
+      if (this[i] !== other[i]) {
+        return false;
+      }
+    }
+    return true;
+  }
+
+  toBigDecimal(): BigDecimal {
+    return new BigDecimal(this)
+  }
+}
+
+class BigDecimal {
+  digits: BigInt
+  exp: BigInt
+
+  constructor(bigInt: BigInt) {
+    this.digits = bigInt
+    this.exp = BigInt.fromI32(0)
+  }
+
+  static fromString(s: string): BigDecimal {
+    return bigDecimal.fromString(s)
+  }
+
+  toString(): string {
+    return bigDecimal.toString(this)
+  }
+
+  truncate(decimals: i32): BigDecimal {
+    let digitsRightOfZero = this.digits.toString().length + this.exp.toI32()
+    let newDigitLength = decimals + digitsRightOfZero
+    let truncateLength = this.digits.toString().length - newDigitLength
+    if (truncateLength < 0) {
+      return this
+    } else {
+      for (let i = 0; i < truncateLength; i++) {
+        this.digits = this.digits.div(BigInt.fromI32(10))
+      }
+      this.exp = BigInt.fromI32(decimals* -1)
+      return this
+    }
+  }
+
+  @operator('+')
+  plus(other: BigDecimal): BigDecimal {
+    return bigDecimal.plus(this, other)
+  }
+
+  @operator('-')
+  minus(other: BigDecimal): BigDecimal {
+    return bigDecimal.minus(this, other)
+  }
+
+  @operator('*')
+  times(other: BigDecimal): BigDecimal {
+    return bigDecimal.times(this, other)
+  }
+
+  @operator('/')
+  div(other: BigDecimal): BigDecimal {
+    return bigDecimal.dividedBy(this, other)
+  }
+
+  @operator('==')
+  equals(other: BigDecimal): boolean {
+    return bigDecimal.equals(this, other)
+  }
+}
+
+/**
+ * Enum for supported value types.
+ */
+enum ValueKind {
+  STRING = 0,
+  INT = 1,
+  BIGDECIMAL = 2,
+  BOOL = 3,
+  ARRAY = 4,
+  NULL = 5,
+  BYTES = 6,
+  BIGINT = 7,
+}
+
+/**
+ * Pointer type for Value data.
+ *
+ * Big enough to fit any pointer or native `this.data`.
+ */
+type ValuePayload = u64
+
+/**
+ * A dynamically typed value.
+ */
+class Value {
+  kind: ValueKind
+  data: ValuePayload
+
+  toAddress(): Address {
+    assert(this.kind == ValueKind.BYTES, 'Value is not an address.')
+    return changetype<Address>(this.data as u32)
+  }
+
+  toBoolean(): boolean {
+    if (this.kind == ValueKind.NULL) {
+      return false;
+    }
+    assert(this.kind == ValueKind.BOOL, 'Value is not a boolean.')
+    return this.data != 0
+  }
+
+  toBytes(): Bytes {
+    assert(this.kind == ValueKind.BYTES, 'Value is not a byte array.')
+    return changetype<Bytes>(this.data as u32)
+  }
+
+  toI32(): i32 {
+    if (this.kind == ValueKind.NULL) {
+      return 0;
+    }
+    assert(this.kind == ValueKind.INT, 'Value is not an i32.')
+    return this.data as i32
+  }
+
+  toString(): string {
+    assert(this.kind == ValueKind.STRING, 'Value is not a string.')
+    return changetype<string>(this.data as u32)
+  }
+
+  toBigInt(): BigInt {
+    assert(this.kind == ValueKind.BIGINT, 'Value is not a BigInt.')
+    return changetype<BigInt>(this.data as u32)
+  }
+
+  toBigDecimal(): BigDecimal {
+    assert(this.kind == ValueKind.BIGDECIMAL, 'Value is not a BigDecimal.')
+    return changetype<BigDecimal>(this.data as u32)
+  }
+
+  toArray(): Array<Value> {
+    assert(this.kind == ValueKind.ARRAY, 'Value is not an array.')
+    return changetype<Array<Value>>(this.data as u32)
+  }
+
+  toBooleanArray(): Array<boolean> {
+    let values = this.toArray()
+    let output = new Array<boolean>(values.length)
+    for (let i: i32; i < values.length; i++) {
+      output[i] = values[i].toBoolean()
+    }
+    return output
+  }
+
+  toBytesArray(): Array<Bytes> {
+    let values = this.toArray()
+    let output = new Array<Bytes>(values.length)
+    for (let i: i32 = 0; i < values.length; i++) {
+      output[i] = values[i].toBytes()
+    }
+    return output
+  }
+
+  toStringArray(): Array<string> {
+    let values = this.toArray()
+    let output = new Array<string>(values.length)
+    for (let i: i32 = 0; i < values.length; i++) {
+      output[i] = values[i].toString()
+    }
+    return output
+  }
+
+  toI32Array(): Array<i32> {
+    let values = this.toArray()
+    let output = new Array<i32>(values.length)
+    for (let i: i32 = 0; i < values.length; i++) {
+      output[i] = values[i].toI32()
+    }
+    return output
+  }
+
+  toBigIntArray(): Array<BigInt> {
+    let values = this.toArray()
+    let output = new Array<BigInt>(values.length)
+    for (let i: i32 = 0; i < values.length; i++) {
+      output[i] = values[i].toBigInt()
+    }
+    return output
+  }
+
+  toBigDecimalArray(): Array<BigDecimal> {
+    let values = this.toArray()
+    let output = new Array<BigDecimal>(values.length)
+    for (let i: i32 = 0; i < values.length; i++) {
+      output[i] = values[i].toBigDecimal()
+    }
+    return output
+  }
+
+  static fromBooleanArray(input: Array<boolean>): Value {
+    let output = new Array<Value>(input.length)
+    for (let i: i32 = 0; i < input.length; i++) {
+      output[i] = Value.fromBoolean(input[i])
+    }
+    return Value.fromArray(output)
+  }
+
+  static fromBytesArray(input: Array<Bytes>): Value {
+    let output = new Array<Value>(input.length)
+    for (let i: i32 = 0; i < input.length; i++) {
+      output[i] = Value.fromBytes(input[i])
+    }
+    return Value.fromArray(output)
+  }
+
+  static fromI32Array(input: Array<i32>): Value {
+    let output = new Array<Value>(input.length)
+    for (let i: i32 = 0; i < input.length; i++) {
+      output[i] = Value.fromI32(input[i])
+    }
+    return Value.fromArray(output)
+  }
+
+  static fromBigIntArray(input: Array<BigInt>): Value {
+    let output = new Array<Value>(input.length)
+    for (let i: i32 = 0; i < input.length; i++) {
+      output[i] = Value.fromBigInt(input[i])
+    }
+    return Value.fromArray(output)
+  }
+
+  static fromBigDecimalArray(input: Array<BigDecimal>): Value {
+    let output = new Array<Value>(input.length)
+    for (let i: i32 = 0; i < input.length; i++) {
+      output[i] = Value.fromBigDecimal(input[i])
+    }
+    return Value.fromArray(output)
+  }
+
+  static fromStringArray(input: Array<string>): Value {
+    let output = new Array<Value>(input.length)
+    for (let i: i32 = 0; i < input.length; i++) {
+      output[i] = Value.fromString(input[i])
+    }
+    return Value.fromArray(output)
+  }
+
+  static fromArray(input: Array<Value>): Value {
+    let value = new Value()
+    value.kind = ValueKind.ARRAY
+    value.data = input as u64
+    return value
+  }
+
+  static fromBigInt(n: BigInt): Value {
+    let value = new Value()
+    value.kind = ValueKind.BIGINT
+    value.data = n as u64
+    return value
+  }
+
+  static fromBoolean(b: boolean): Value {
+    let value = new Value()
+    value.kind = ValueKind.BOOL
+    value.data = b ? 1 : 0
+    return value
+  }
+
+  static fromBytes(bytes: Bytes): Value {
+    let value = new Value()
+    value.kind = ValueKind.BYTES
+    value.data = bytes as u64
+    return value
+  }
+
+  static fromNull(): Value {
+    let value = new Value()
+    value.kind = ValueKind.NULL
+    return value
+  }
+
+  static fromI32(n: i32): Value {
+    let value = new Value()
+    value.kind = ValueKind.INT
+    value.data = n as u64
+    return value
+  }
+
+  static fromString(s: string): Value {
+    let value = new Value()
+    value.kind = ValueKind.STRING
+    value.data = s as u64
+    return value
+  }
+
+  static fromBigDecimal(n: BigDecimal): Value {
+    let value = new Value()
+    value.kind = ValueKind.BIGDECIMAL
+    value.data = n as u64
+    return value
+  }
+}
+
+/**
+ * Common representation for entity data, storing entity attributes
+ * as `string` keys and the attribute values as dynamically-typed
+ * `Value` objects.
+ */
+export class Entity extends TypedMap<string, Value> {
+  unset(key: string): void {
+    this.set(key, Value.fromNull())
+  }
+
+  /** Assigns properties from sources to this Entity in right-to-left order */
+  merge(sources: Array<Entity>): Entity {
+    var target = this
+    for (let i = 0; i < sources.length; i++) {
+      let entries = sources[i].entries
+      for (let j = 0; j < entries.length; j++) {
+        target.set(entries[j].key, entries[j].value)
+      }
+    }
+    return target
+  }
+}
+
+/**
+ * Test functions
+ */
+export function getUser(id: string): Entity | null {
+  return store.get("User", id);
+}
+
+export function loadAndSetUserName(id: string, name: string) : void {
+  let user = store.get("User", id);
+  if (user == null) {
+    user = new Entity();
+    user.set("id", Value.fromString(id));
+  }
+  user.set("name", Value.fromString(name));
+  // save it
+  store.set("User", id, (user as Entity));
+}
diff --git a/runtime/test/wasm_test/api_version_0_0_4/store.wasm b/runtime/test/wasm_test/api_version_0_0_4/store.wasm
new file mode 100644
index 0000000..ec7027c
Binary files /dev/null and b/runtime/test/wasm_test/api_version_0_0_4/store.wasm differ
diff --git a/runtime/test/wasm_test/api_version_0_0_4/string_to_number.ts b/runtime/test/wasm_test/api_version_0_0_4/string_to_number.ts
new file mode 100644
index 0000000..1622c27
--- /dev/null
+++ b/runtime/test/wasm_test/api_version_0_0_4/string_to_number.ts
@@ -0,0 +1,29 @@
+import "allocator/arena";
+
+export { memory };
+
+type BigInt = Uint8Array;
+
+/** Host JSON interface */
+declare namespace json {
+    function toI64(decimal: string): i64
+    function toU64(decimal: string): u64
+    function toF64(decimal: string): f64
+    function toBigInt(decimal: string): BigInt
+}
+
+export function testToI64(decimal: string): i64 {
+    return json.toI64(decimal);
+}
+
+export function testToU64(decimal: string): u64 {
+    return json.toU64(decimal);
+}
+
+export function testToF64(decimal: string): f64 {
+    return json.toF64(decimal)
+}
+
+export function testToBigInt(decimal: string): BigInt {
+    return json.toBigInt(decimal)
+}
diff --git a/runtime/test/wasm_test/api_version_0_0_4/string_to_number.wasm b/runtime/test/wasm_test/api_version_0_0_4/string_to_number.wasm
new file mode 100644
index 0000000..981539f
Binary files /dev/null and b/runtime/test/wasm_test/api_version_0_0_4/string_to_number.wasm differ
diff --git a/runtime/test/wasm_test/api_version_0_0_4/test_padding.ts b/runtime/test/wasm_test/api_version_0_0_4/test_padding.ts
new file mode 100644
index 0000000..57af24d
--- /dev/null
+++ b/runtime/test/wasm_test/api_version_0_0_4/test_padding.ts
@@ -0,0 +1,129 @@
+import "allocator/arena";
+
+export { memory };
+
+
+
+export class UnitTestTypeBool{
+    str_pref: string;
+    under_test: boolean;
+    str_suff: string;
+    large: i64 ;
+    tail:  boolean ;
+
+
+
+    constructor(str_pref: string, under_test: boolean, str_suff:string, large: i64, tail:boolean) {
+        this.str_pref = str_pref;
+        this.under_test = under_test;
+        this.str_suff = str_suff;
+        this.large = large;
+        this.tail = tail;
+    }
+}
+
+export function test_padding_bool(p: UnitTestTypeBool): void {
+     assert(p.str_pref == "pref", "parm.str_pref: Assertion failed!");
+     assert(p.under_test == true, "parm.under_test: Assertion failed!");
+     assert(p.str_suff == "suff", "parm.str_suff: Assertion failed!");
+     assert(p.large == 9223372036854775807, "parm.large: Assertion failed!");
+     assert(p.tail == true, "parm.tail: Assertion failed!");
+}
+
+export class UnitTestTypeI8{
+    str_pref: string;
+    under_test: i8;
+    str_suff: string;
+    large: i64 ;
+    tail:  boolean ;
+
+
+
+    constructor(str_pref: string, under_test: i8, str_suff:string, large: i64, tail:boolean) {
+        this.str_pref = str_pref;
+        this.under_test = under_test;
+        this.str_suff = str_suff;
+        this.large = large;
+        this.tail = tail;
+    }
+}
+
+export function test_padding_i8(p: UnitTestTypeI8): void {
+    assert(p.str_pref == "pref", "parm.str_pref: Assertion failed!");
+    assert(p.under_test == 127, "parm.under_test: Assertion failed!");
+    assert(p.str_suff == "suff", "parm.str_suff: Assertion failed!");
+    assert(p.large == 9223372036854775807, "parm.large: Assertion failed!");
+    assert(p.tail == true, "parm.tail: Assertion failed!");
+}
+
+
+export class UnitTestTypeU16{
+    str_pref: string;
+    under_test: i16;
+    str_suff: string;
+    large: i64 ;
+    tail:  boolean ;
+
+
+
+    constructor(str_pref: string, under_test: i16, str_suff:string, large: i64, tail:boolean) {
+        this.str_pref = str_pref;
+        this.under_test = under_test;
+        this.str_suff = str_suff;
+        this.large = large;
+        this.tail = tail;
+    }
+}
+
+export function test_padding_i16(p: UnitTestTypeU16): void {
+    assert(p.str_pref == "pref", "parm.str_pref: Assertion failed!");
+    assert(p.under_test == 32767, "parm.under_test: Assertion failed!");
+    assert(p.str_suff == "suff", "parm.str_suff: Assertion failed!");
+    assert(p.large == 9223372036854775807, "parm.large: Assertion failed!");
+    assert(p.tail == true, "parm.tail: Assertion failed!");
+}
+
+export class UnitTestTypeU32{
+    str_pref: string;
+    under_test: i32;
+    str_suff: string;
+    large: i64 ;
+    tail:  boolean ;
+
+
+
+    constructor(str_pref: string, under_test: i32, str_suff:string, large: i64, tail:boolean) {
+        this.str_pref = str_pref;
+        this.under_test = under_test;
+        this.str_suff = str_suff;
+        this.large = large;
+        this.tail = tail;
+    }
+}
+
+export function test_padding_i32(p: UnitTestTypeU32): void {
+    assert(p.str_pref == "pref", "parm.str_pref: Assertion failed!");
+    assert(p.under_test == 2147483647, "parm.under_test: Assertion failed!");
+    assert(p.str_suff == "suff", "parm.str_suff: Assertion failed!");
+    assert(p.large == 9223372036854775807, "parm.large: Assertion failed!");
+    assert(p.tail == true, "parm.tail: Assertion failed!");
+}
+
+
+export class ManualPadding{
+    nonce: i64 ;
+    str_suff: string;
+    tail: i64 ;
+
+    constructor(nonce: i64, str_suff:string, tail:i64) {
+        this.nonce = nonce;
+        this.str_suff = str_suff;
+        this.tail = tail
+    }
+}
+
+export function test_padding_manual(p: ManualPadding): void {
+    assert(p.nonce == 9223372036854775807, "parm.nonce: Assertion failed!");
+    assert(p.str_suff == "suff", "parm.str_suff: Assertion failed!");
+    assert(p.tail == 9223372036854775807, "parm.tail: Assertion failed!");
+}
diff --git a/runtime/test/wasm_test/api_version_0_0_4/test_padding.wasm b/runtime/test/wasm_test/api_version_0_0_4/test_padding.wasm
new file mode 100644
index 0000000..af72b0f
Binary files /dev/null and b/runtime/test/wasm_test/api_version_0_0_4/test_padding.wasm differ
diff --git a/runtime/test/wasm_test/api_version_0_0_5/abi_classes.ts b/runtime/test/wasm_test/api_version_0_0_5/abi_classes.ts
new file mode 100644
index 0000000..037e0ef
--- /dev/null
+++ b/runtime/test/wasm_test/api_version_0_0_5/abi_classes.ts
@@ -0,0 +1,62 @@
+export * from './common/global'
+import { Address, Uint8, FixedBytes, Bytes, Payload, Value } from './common/types'
+
+// Clone the address to a new buffer, add 1 to the first and last bytes of the
+// address and return the new address.
+export function test_address(address: Address): Address {
+  let new_address = address.subarray();
+
+  // Add 1 to the first and last byte.
+  new_address[0] += 1;
+  new_address[address.length - 1] += 1;
+
+  return changetype<Address>(new_address)
+}
+
+// Clone the Uint8 to a new buffer, add 1 to the first and last `u8`s and return
+// the new Uint8
+export function test_uint(address: Uint8): Uint8 {
+  let new_address = address.subarray();
+
+  // Add 1 to the first byte.
+  new_address[0] += 1;
+
+  return new_address
+}
+
+// Return the string repeated twice.
+export function repeat_twice(original: string): string {
+  return original.repeat(2)
+}
+
+// Concatenate two byte sequences into a new one.
+export function concat(bytes1: Bytes, bytes2: FixedBytes): Bytes {
+  let concated_buff = new ArrayBuffer(bytes1.byteLength + bytes2.byteLength);
+  let concated_buff_ptr = changetype<usize>(concated_buff);
+
+  let bytes1_ptr = changetype<usize>(bytes1);
+  let bytes1_buff_ptr = load<usize>(bytes1_ptr);
+
+  let bytes2_ptr = changetype<usize>(bytes2);
+  let bytes2_buff_ptr = load<usize>(bytes2_ptr);
+
+  // Move bytes1.
+  memory.copy(concated_buff_ptr, bytes1_buff_ptr, bytes1.byteLength);
+  concated_buff_ptr += bytes1.byteLength
+
+  // Move bytes2.
+  memory.copy(concated_buff_ptr, bytes2_buff_ptr, bytes2.byteLength);
+
+  let new_typed_array = Uint8Array.wrap(concated_buff);
+
+  return changetype<Bytes>(new_typed_array);
+}
+
+export function test_array(strings: Array<string>): Array<string> {
+  strings.push("5")
+  return strings
+}
+
+export function byte_array_third_quarter(bytes: Uint8Array): Uint8Array {
+  return bytes.subarray(bytes.length * 2/4, bytes.length * 3/4)
+}
diff --git a/runtime/test/wasm_test/api_version_0_0_5/abi_classes.wasm b/runtime/test/wasm_test/api_version_0_0_5/abi_classes.wasm
new file mode 100644
index 0000000..8a29ed1
Binary files /dev/null and b/runtime/test/wasm_test/api_version_0_0_5/abi_classes.wasm differ
diff --git a/runtime/test/wasm_test/api_version_0_0_5/abi_store_value.ts b/runtime/test/wasm_test/api_version_0_0_5/abi_store_value.ts
new file mode 100644
index 0000000..4a2a58b
--- /dev/null
+++ b/runtime/test/wasm_test/api_version_0_0_5/abi_store_value.ts
@@ -0,0 +1,76 @@
+export * from './common/global'
+import { BigInt, BigDecimal, Bytes, Value, ValueKind } from './common/types'
+
+export function value_from_string(str: string): Value {
+    let token = new Value();
+    token.kind = ValueKind.STRING;
+    token.data = changetype<u32>(str);
+    return token
+}
+
+export function value_from_int(int: i32): Value {
+    let value = new Value();
+    value.kind = ValueKind.INT;
+    value.data = int as u64
+    return value
+}
+
+export function value_from_big_decimal(float: BigInt): Value {
+    let value = new Value();
+    value.kind = ValueKind.BIG_DECIMAL;
+    value.data = changetype<u32>(float);
+    return value
+}
+
+export function value_from_bool(bool: boolean): Value {
+    let value = new Value();
+    value.kind = ValueKind.BOOL;
+    value.data = bool ? 1 : 0;
+    return value
+}
+
+export function array_from_values(str: string, i: i32): Value {
+    let array = new Array<Value>();
+    array.push(value_from_string(str));
+    array.push(value_from_int(i));
+
+    let value = new Value();
+    value.kind = ValueKind.ARRAY;
+    value.data = changetype<u32>(array);
+    return value
+}
+
+export function value_null(): Value {
+    let value = new Value();
+    value.kind = ValueKind.NULL;
+    return value
+}
+
+export function value_from_bytes(bytes: Bytes): Value {
+    let value = new Value();
+    value.kind = ValueKind.BYTES;
+    value.data = changetype<u32>(bytes);
+    return value
+}
+
+export function value_from_bigint(bigint: BigInt): Value {
+    let value = new Value();
+    value.kind = ValueKind.BIG_INT;
+    value.data = changetype<u32>(bigint);
+    return value
+}
+
+export function value_from_array(array: Array<string>): Value {
+    let value = new Value()
+    value.kind = ValueKind.ARRAY
+    value.data = changetype<u32>(array)
+    return value
+}
+
+// Test that this does not cause undefined behaviour in Rust.
+export function invalid_discriminant(): Value {
+    let token = new Value();
+    token.kind = 70;
+    token.data = changetype<u32>("blebers");
+    return token
+}
diff --git a/runtime/test/wasm_test/api_version_0_0_5/abi_store_value.wasm b/runtime/test/wasm_test/api_version_0_0_5/abi_store_value.wasm
new file mode 100644
index 0000000..5ac9f91
Binary files /dev/null and b/runtime/test/wasm_test/api_version_0_0_5/abi_store_value.wasm differ
diff --git a/runtime/test/wasm_test/api_version_0_0_5/abi_token.ts b/runtime/test/wasm_test/api_version_0_0_5/abi_token.ts
new file mode 100644
index 0000000..5a170b5
--- /dev/null
+++ b/runtime/test/wasm_test/api_version_0_0_5/abi_token.ts
@@ -0,0 +1,91 @@
+export * from './common/global'
+import { Address, Bytes, Token, TokenKind, Int64, Uint64 } from './common/types'
+
+export function token_to_address(token: Token): Address {
+    assert(token.kind == TokenKind.ADDRESS, "Token is not an address.");
+    return changetype<Address>(token.data as u32);
+}
+
+export function token_to_bytes(token: Token): Bytes {
+    assert(token.kind == TokenKind.FIXED_BYTES 
+            || token.kind == TokenKind.BYTES, "Token is not bytes.")
+    return changetype<Bytes>(token.data as u32)
+}
+  
+export function token_to_int(token: Token): Int64 {
+    assert(token.kind == TokenKind.INT
+            || token.kind == TokenKind.UINT, "Token is not an int or uint.")
+    return changetype<Int64>(token.data as u32)
+}
+
+export function token_to_uint(token: Token): Uint64 {
+    assert(token.kind == TokenKind.INT
+            || token.kind == TokenKind.UINT, "Token is not an int or uint.")
+    return changetype<Uint64>(token.data as u32)
+}
+
+export function token_to_bool(token: Token): boolean {
+    assert(token.kind == TokenKind.BOOL, "Token is not a boolean.")
+    return token.data != 0
+}
+  
+export function token_to_string(token: Token): string {
+    assert(token.kind == TokenKind.STRING, "Token is not a string.")
+    return changetype<string>(token.data as u32)
+}
+  
+export function token_to_array(token: Token): Array<Token> {
+    assert(token.kind == TokenKind.FIXED_ARRAY ||
+        token.kind == TokenKind.ARRAY, "Token is not an array.")
+    return changetype<Array<Token>>(token.data as u32)
+}
+
+
+export function token_from_address(address: Address): Token {  
+    let token = new Token();
+    token.kind = TokenKind.ADDRESS;
+    token.data = changetype<u32>(address);
+    return token
+}
+
+export function token_from_bytes(bytes: Bytes): Token {
+    let token = new Token();
+    token.kind = TokenKind.BYTES;
+    token.data = changetype<u32>(bytes);
+    return token
+}
+  
+export function token_from_int(int: Int64): Token {
+    let token = new Token();
+    token.kind = TokenKind.INT;
+    token.data = changetype<u32>(int);
+    return token
+}
+
+export function token_from_uint(uint: Uint64): Token {
+    let token = new Token();
+    token.kind = TokenKind.UINT;
+    token.data = changetype<u32>(uint);
+    return token
+}
+
+export function token_from_bool(bool: boolean): Token {
+    let token = new Token();
+    token.kind = TokenKind.BOOL;
+    token.data = bool as u32;
+    return token
+}
+  
+export function token_from_string(str: string): Token {
+    let token = new Token();
+    token.kind = TokenKind.STRING;
+    token.data = changetype<u32>(str);
+    return token
+}
+  
+export function token_from_array(array: Token): Token {
+    let token = new Token();
+    token.kind = TokenKind.ARRAY;
+    token.data = changetype<u32>(array);
+    return token
+}
diff --git a/runtime/test/wasm_test/api_version_0_0_5/abi_token.wasm b/runtime/test/wasm_test/api_version_0_0_5/abi_token.wasm
new file mode 100644
index 0000000..0cd6cd2
Binary files /dev/null and b/runtime/test/wasm_test/api_version_0_0_5/abi_token.wasm differ
diff --git a/runtime/test/wasm_test/api_version_0_0_5/abort.ts b/runtime/test/wasm_test/api_version_0_0_5/abort.ts
new file mode 100644
index 0000000..88f7dee
--- /dev/null
+++ b/runtime/test/wasm_test/api_version_0_0_5/abort.ts
@@ -0,0 +1,5 @@
+export * from './common/global'
+
+export function abort(): void {
+  assert(false, "not true")
+}
diff --git a/runtime/test/wasm_test/api_version_0_0_5/abort.wasm b/runtime/test/wasm_test/api_version_0_0_5/abort.wasm
new file mode 100644
index 0000000..b8e08d7
Binary files /dev/null and b/runtime/test/wasm_test/api_version_0_0_5/abort.wasm differ
diff --git a/runtime/test/wasm_test/api_version_0_0_5/allocate_global.ts b/runtime/test/wasm_test/api_version_0_0_5/allocate_global.ts
new file mode 100644
index 0000000..c1f0a90
--- /dev/null
+++ b/runtime/test/wasm_test/api_version_0_0_5/allocate_global.ts
@@ -0,0 +1,13 @@
+export * from './common/global'
+import { BigInt } from './common/types'
+
+let globalOne = bigInt.fromString("1")
+
+declare namespace bigInt {
+    function fromString(s: string): BigInt
+}
+
+export function assert_global_works(): void {
+  let localOne = bigInt.fromString("1")
+  assert(globalOne != localOne)
+}
diff --git a/runtime/test/wasm_test/api_version_0_0_5/allocate_global.wasm b/runtime/test/wasm_test/api_version_0_0_5/allocate_global.wasm
new file mode 100644
index 0000000..779d930
Binary files /dev/null and b/runtime/test/wasm_test/api_version_0_0_5/allocate_global.wasm differ
diff --git a/runtime/test/wasm_test/api_version_0_0_5/array_blowup.ts b/runtime/test/wasm_test/api_version_0_0_5/array_blowup.ts
new file mode 100644
index 0000000..a7891af
--- /dev/null
+++ b/runtime/test/wasm_test/api_version_0_0_5/array_blowup.ts
@@ -0,0 +1,20 @@
+export * from './common/global'
+import { Bytes, Entity, Value } from './common/types'
+
+/** Definitions copied from graph-ts/index.ts */
+declare namespace store {
+    function set(entity: string, id: string, data: Entity): void
+}
+
+export function arrayBlowup(): void {
+    // 1 GB array.
+    let s = changetype<Bytes>(new Bytes(1_000_000_000).fill(1));
+
+    // Repeated 100 times.
+    let a = new Array<Bytes>(100).fill(s);
+
+    let entity = new Entity();
+    entity.set("field", Value.fromBytesArray(a));
+    store.set("NonExisting", "foo", entity)
+}
+
diff --git a/runtime/test/wasm_test/api_version_0_0_5/array_blowup.wasm b/runtime/test/wasm_test/api_version_0_0_5/array_blowup.wasm
new file mode 100644
index 0000000..80c5aba
Binary files /dev/null and b/runtime/test/wasm_test/api_version_0_0_5/array_blowup.wasm differ
diff --git a/runtime/test/wasm_test/api_version_0_0_5/big_int_arithmetic.ts b/runtime/test/wasm_test/api_version_0_0_5/big_int_arithmetic.ts
new file mode 100644
index 0000000..6cea38e
--- /dev/null
+++ b/runtime/test/wasm_test/api_version_0_0_5/big_int_arithmetic.ts
@@ -0,0 +1,30 @@
+export * from './common/global'
+import { BigInt } from './common/types'
+
+declare namespace bigInt {
+    function plus(x: BigInt, y: BigInt): BigInt
+    function minus(x: BigInt, y: BigInt): BigInt
+    function times(x: BigInt, y: BigInt): BigInt
+    function dividedBy(x: BigInt, y: BigInt): BigInt
+    function mod(x: BigInt, y: BigInt): BigInt
+}
+
+export function plus(x: BigInt, y: BigInt): BigInt {
+    return bigInt.plus(x, y)
+}
+
+export function minus(x: BigInt, y: BigInt): BigInt {
+    return bigInt.minus(x, y)
+}
+
+export function times(x: BigInt, y: BigInt): BigInt {
+    return bigInt.times(x, y)
+}
+
+export function dividedBy(x: BigInt, y: BigInt): BigInt {
+    return bigInt.dividedBy(x, y)
+}
+
+export function mod(x: BigInt, y: BigInt): BigInt {
+    return bigInt.mod(x, y)
+}
diff --git a/runtime/test/wasm_test/api_version_0_0_5/big_int_arithmetic.wasm b/runtime/test/wasm_test/api_version_0_0_5/big_int_arithmetic.wasm
new file mode 100644
index 0000000..a69c405
Binary files /dev/null and b/runtime/test/wasm_test/api_version_0_0_5/big_int_arithmetic.wasm differ
diff --git a/runtime/test/wasm_test/api_version_0_0_5/big_int_to_hex.ts b/runtime/test/wasm_test/api_version_0_0_5/big_int_to_hex.ts
new file mode 100644
index 0000000..4da1265
--- /dev/null
+++ b/runtime/test/wasm_test/api_version_0_0_5/big_int_to_hex.ts
@@ -0,0 +1,9 @@
+export * from './common/global'
+
+declare namespace typeConversion {
+    function bigIntToHex(n: Uint8Array): string
+}
+
+export function big_int_to_hex(n: Uint8Array): string {
+    return typeConversion.bigIntToHex(n)
+}
diff --git a/runtime/test/wasm_test/api_version_0_0_5/big_int_to_hex.wasm b/runtime/test/wasm_test/api_version_0_0_5/big_int_to_hex.wasm
new file mode 100644
index 0000000..fae821a
Binary files /dev/null and b/runtime/test/wasm_test/api_version_0_0_5/big_int_to_hex.wasm differ
diff --git a/runtime/test/wasm_test/api_version_0_0_5/big_int_to_string.ts b/runtime/test/wasm_test/api_version_0_0_5/big_int_to_string.ts
new file mode 100644
index 0000000..8c9c5eb
--- /dev/null
+++ b/runtime/test/wasm_test/api_version_0_0_5/big_int_to_string.ts
@@ -0,0 +1,9 @@
+export * from './common/global'
+
+declare namespace typeConversion {
+    function bigIntToString(n: Uint8Array): string
+}
+
+export function big_int_to_string(n: Uint8Array): string {
+    return typeConversion.bigIntToString(n)
+}
diff --git a/runtime/test/wasm_test/api_version_0_0_5/big_int_to_string.wasm b/runtime/test/wasm_test/api_version_0_0_5/big_int_to_string.wasm
new file mode 100644
index 0000000..137414e
Binary files /dev/null and b/runtime/test/wasm_test/api_version_0_0_5/big_int_to_string.wasm differ
diff --git a/runtime/test/wasm_test/api_version_0_0_5/boolean.ts b/runtime/test/wasm_test/api_version_0_0_5/boolean.ts
new file mode 100644
index 0000000..7bf85ca
--- /dev/null
+++ b/runtime/test/wasm_test/api_version_0_0_5/boolean.ts
@@ -0,0 +1,17 @@
+export * from "./common/global"
+
+export function testReceiveTrue(a: bool): void {
+  assert(a)
+}
+
+export function testReceiveFalse(a: bool): void {
+  assert(!a)
+}
+
+export function testReturnTrue(): bool {
+  return true
+}
+
+export function testReturnFalse(): bool {
+  return false
+}
diff --git a/runtime/test/wasm_test/api_version_0_0_5/boolean.wasm b/runtime/test/wasm_test/api_version_0_0_5/boolean.wasm
new file mode 100644
index 0000000..ba80672
Binary files /dev/null and b/runtime/test/wasm_test/api_version_0_0_5/boolean.wasm differ
diff --git a/runtime/test/wasm_test/api_version_0_0_5/bytes_to_base58.ts b/runtime/test/wasm_test/api_version_0_0_5/bytes_to_base58.ts
new file mode 100644
index 0000000..38c956d
--- /dev/null
+++ b/runtime/test/wasm_test/api_version_0_0_5/bytes_to_base58.ts
@@ -0,0 +1,9 @@
+export * from './common/global'
+
+declare namespace typeConversion {
+    function bytesToBase58(n: Uint8Array): string
+}
+
+export function bytes_to_base58(n: Uint8Array): string {
+    return typeConversion.bytesToBase58(n)
+}
diff --git a/runtime/test/wasm_test/api_version_0_0_5/bytes_to_base58.wasm b/runtime/test/wasm_test/api_version_0_0_5/bytes_to_base58.wasm
new file mode 100644
index 0000000..851bb60
Binary files /dev/null and b/runtime/test/wasm_test/api_version_0_0_5/bytes_to_base58.wasm differ
diff --git a/runtime/test/wasm_test/api_version_0_0_5/common/global.ts b/runtime/test/wasm_test/api_version_0_0_5/common/global.ts
new file mode 100644
index 0000000..7979b14
--- /dev/null
+++ b/runtime/test/wasm_test/api_version_0_0_5/common/global.ts
@@ -0,0 +1,173 @@
+__alloc(0);
+
+import { BigDecimal, TypedMapEntry, Entity, TypedMap, Result, Wrapped, JSONValue, Value, Token } from './types'
+
+export enum TypeId {
+  String = 0,
+  ArrayBuffer = 1,
+  Int8Array = 2,
+  Int16Array = 3,
+  Int32Array = 4,
+  Int64Array = 5,
+  Uint8Array = 6,
+  Uint16Array = 7,
+  Uint32Array = 8,
+  Uint64Array = 9,
+  Float32Array = 10,
+  Float64Array = 11,
+  BigDecimal = 12,
+  ArrayBool = 13,
+  ArrayUint8Array = 14,
+  ArrayEthereumValue = 15,
+  ArrayStoreValue = 16,
+  ArrayJsonValue = 17,
+  ArrayString = 18,
+  ArrayEventParam = 19,
+  ArrayTypedMapEntryStringJsonValue = 20,
+  ArrayTypedMapEntryStringStoreValue = 21,
+  SmartContractCall = 22,
+  EventParam = 23,
+  // EthereumTransaction = 24,
+  // EthereumBlock = 25,
+  // EthereumCall = 26,
+  WrappedTypedMapStringJsonValue = 27,
+  WrappedBool = 28,
+  WrappedJsonValue = 29,
+  EthereumValue = 30,
+  StoreValue = 31,
+  JsonValue = 32,
+  // EthereumEvent = 33,
+  TypedMapEntryStringStoreValue = 34,
+  TypedMapEntryStringJsonValue = 35,
+  TypedMapStringStoreValue = 36,
+  TypedMapStringJsonValue = 37,
+  TypedMapStringTypedMapStringJsonValue = 38,
+  ResultTypedMapStringJsonValueBool = 39,
+  ResultJsonValueBool = 40,
+  ArrayU8 = 41,
+  ArrayU16 = 42,
+  ArrayU32 = 43,
+  ArrayU64 = 44,
+  ArrayI8 = 45,
+  ArrayI16 = 46,
+  ArrayI32 = 47,
+  ArrayI64 = 48,
+  ArrayF32 = 49,
+  ArrayF64 = 50,
+  ArrayBigDecimal = 51,
+}
+
+export function id_of_type(typeId: TypeId): usize {
+  switch (typeId) {
+    case TypeId.String:
+      return idof<string>()
+    case TypeId.ArrayBuffer:
+      return idof<ArrayBuffer>()
+    case TypeId.Int8Array:
+      return idof<Int8Array>()
+    case TypeId.Int16Array:
+      return idof<Int16Array>()
+    case TypeId.Int32Array:
+      return idof<Int32Array>()
+    case TypeId.Int64Array:
+      return idof<Int64Array>()
+    case TypeId.Uint8Array:
+      return idof<Uint8Array>()
+    case TypeId.Uint16Array:
+      return idof<Uint16Array>()
+    case TypeId.Uint32Array:
+      return idof<Uint32Array>()
+    case TypeId.Uint64Array:
+      return idof<Uint64Array>()
+    case TypeId.Float32Array:
+      return idof<Float32Array>()
+    case TypeId.Float64Array:
+      return idof<Float64Array>()
+    case TypeId.BigDecimal:
+      return idof<BigDecimal>()
+    case TypeId.ArrayBool:
+      return idof<Array<bool>>()
+    case TypeId.ArrayUint8Array:
+      return idof<Array<Uint8Array>>()
+    case TypeId.ArrayEthereumValue:
+      return idof<Array<Token>>()
+    case TypeId.ArrayStoreValue:
+      return idof<Array<Value>>()
+    case TypeId.ArrayJsonValue:
+      return idof<Array<JSONValue>>()
+    case TypeId.ArrayString:
+      return idof<Array<string>>()
+    // case TypeId.ArrayEventParam:
+    //   return idof<Array<ethereum.EventParam>>()
+    case TypeId.ArrayTypedMapEntryStringJsonValue:
+      return idof<Array<TypedMapEntry<string, JSONValue>>>()
+    case TypeId.ArrayTypedMapEntryStringStoreValue:
+      return idof<Array<Entity>>()
+    case TypeId.WrappedTypedMapStringJsonValue:
+      return idof<Wrapped<TypedMapEntry<string, JSONValue>>>()
+    case TypeId.WrappedBool:
+      return idof<Wrapped<boolean>>()
+    case TypeId.WrappedJsonValue:
+      return idof<Wrapped<JSONValue>>()
+    // case TypeId.SmartContractCall:
+    //   return idof<ethereum.SmartContractCall>()
+    // case TypeId.EventParam:
+    //   return idof<ethereum.EventParam>()
+    // case TypeId.EthereumTransaction:
+    //   return idof<ethereum.Transaction>()
+    // case TypeId.EthereumBlock:
+    //   return idof<ethereum.Block>()
+    // case TypeId.EthereumCall:
+    //   return idof<ethereum.Call>()
+    case TypeId.EthereumValue:
+      return idof<Token>()
+    case TypeId.StoreValue:
+      return idof<Value>()
+    case TypeId.JsonValue:
+      return idof<JSONValue>()
+    // case TypeId.EthereumEvent:
+    //   return idof<ethereum.Event>()
+    case TypeId.TypedMapEntryStringStoreValue:
+      return idof<Entity>()
+    case TypeId.TypedMapEntryStringJsonValue:
+      return idof<TypedMap<string, JSONValue>>()
+    case TypeId.TypedMapStringStoreValue:
+      return idof<TypedMap<string, Value>>()
+    case TypeId.TypedMapStringJsonValue:
+      return idof<TypedMap<string, JSONValue>>()
+    case TypeId.TypedMapStringTypedMapStringJsonValue:
+      return idof<TypedMap<string, TypedMap<string, JSONValue>>>()
+    case TypeId.ResultTypedMapStringJsonValueBool:
+      return idof<Result<TypedMap<string, JSONValue>, boolean>>()
+    case TypeId.ResultJsonValueBool:
+      return idof<Result<JSONValue, boolean>>()
+    case TypeId.ArrayU8:
+      return idof<Array<u8>>()
+    case TypeId.ArrayU16:
+      return idof<Array<u16>>()
+    case TypeId.ArrayU32:
+      return idof<Array<u32>>()
+    case TypeId.ArrayU64:
+      return idof<Array<u64>>()
+    case TypeId.ArrayI8:
+      return idof<Array<i8>>()
+    case TypeId.ArrayI16:
+      return idof<Array<i16>>()
+    case TypeId.ArrayI32:
+      return idof<Array<i32>>()
+    case TypeId.ArrayI64:
+      return idof<Array<i64>>()
+    case TypeId.ArrayF32:
+      return idof<Array<f32>>()
+    case TypeId.ArrayF64:
+      return idof<Array<f64>>()
+    case TypeId.ArrayBigDecimal:
+      return idof<Array<BigDecimal>>()
+    default:
+      return 0
+  }
+}
+
+export function allocate(size: usize): usize {
+  return __alloc(size)
+}
diff --git a/runtime/test/wasm_test/api_version_0_0_5/common/types.ts b/runtime/test/wasm_test/api_version_0_0_5/common/types.ts
new file mode 100644
index 0000000..73a6189
--- /dev/null
+++ b/runtime/test/wasm_test/api_version_0_0_5/common/types.ts
@@ -0,0 +1,560 @@
+/** A dynamically-sized byte array. */
+export class Bytes extends ByteArray { }
+
+/** An Ethereum address (20 bytes). */
+export class Address extends Bytes {
+  static fromString(s: string): Address {
+    return typeConversion.stringToH160(s) as Address
+  }
+}
+
+// Sequence of 20 `u8`s.
+// export type Address = Uint8Array;
+
+// Sequence of 32 `u8`s.
+export type Uint8 = Uint8Array;
+
+// Sequences of `u8`s.
+export type FixedBytes = Uint8Array;
+// export type Bytes = Uint8Array;
+
+/**
+ * Enum for supported value types.
+ */
+export enum ValueKind {
+  STRING = 0,
+  INT = 1,
+  BIG_DECIMAL = 2,
+  BOOL = 3,
+  ARRAY = 4,
+  NULL = 5,
+  BYTES = 6,
+  BIG_INT = 7,
+}
+// Big enough to fit any pointer or native `this.data`.
+export type Payload = u64
+/**
+ * A dynamically typed value.
+ */
+export class Value {
+  kind: ValueKind
+  data: Payload
+
+  toAddress(): Address {
+    assert(this.kind == ValueKind.BYTES, 'Value is not an address.')
+    return changetype<Address>(this.data as u32)
+  }
+
+  toBoolean(): boolean {
+    if (this.kind == ValueKind.NULL) {
+      return false;
+    }
+    assert(this.kind == ValueKind.BOOL, 'Value is not a boolean.')
+    return this.data != 0
+  }
+
+  toBytes(): Bytes {
+    assert(this.kind == ValueKind.BYTES, 'Value is not a byte array.')
+    return changetype<Bytes>(this.data as u32)
+  }
+
+  toI32(): i32 {
+    if (this.kind == ValueKind.NULL) {
+      return 0;
+    }
+    assert(this.kind == ValueKind.INT, 'Value is not an i32.')
+    return this.data as i32
+  }
+
+  toString(): string {
+    assert(this.kind == ValueKind.STRING, 'Value is not a string.')
+    return changetype<string>(this.data as u32)
+  }
+
+  toBigInt(): BigInt {
+    assert(this.kind == ValueKind.BIGINT, 'Value is not a BigInt.')
+    return changetype<BigInt>(this.data as u32)
+  }
+
+  toBigDecimal(): BigDecimal {
+    assert(this.kind == ValueKind.BIGDECIMAL, 'Value is not a BigDecimal.')
+    return changetype<BigDecimal>(this.data as u32)
+  }
+
+  toArray(): Array<Value> {
+    assert(this.kind == ValueKind.ARRAY, 'Value is not an array.')
+    return changetype<Array<Value>>(this.data as u32)
+  }
+
+  toBooleanArray(): Array<boolean> {
+    let values = this.toArray()
+    let output = new Array<boolean>(values.length)
+    for (let i: i32; i < values.length; i++) {
+      output[i] = values[i].toBoolean()
+    }
+    return output
+  }
+
+  toBytesArray(): Array<Bytes> {
+    let values = this.toArray()
+    let output = new Array<Bytes>(values.length)
+    for (let i: i32 = 0; i < values.length; i++) {
+      output[i] = values[i].toBytes()
+    }
+    return output
+  }
+
+  toStringArray(): Array<string> {
+    let values = this.toArray()
+    let output = new Array<string>(values.length)
+    for (let i: i32 = 0; i < values.length; i++) {
+      output[i] = values[i].toString()
+    }
+    return output
+  }
+
+  toI32Array(): Array<i32> {
+    let values = this.toArray()
+    let output = new Array<i32>(values.length)
+    for (let i: i32 = 0; i < values.length; i++) {
+      output[i] = values[i].toI32()
+    }
+    return output
+  }
+
+  toBigIntArray(): Array<BigInt> {
+    let values = this.toArray()
+    let output = new Array<BigInt>(values.length)
+    for (let i: i32 = 0; i < values.length; i++) {
+      output[i] = values[i].toBigInt()
+    }
+    return output
+  }
+
+  toBigDecimalArray(): Array<BigDecimal> {
+    let values = this.toArray()
+    let output = new Array<BigDecimal>(values.length)
+    for (let i: i32 = 0; i < values.length; i++) {
+      output[i] = values[i].toBigDecimal()
+    }
+    return output
+  }
+
+  static fromBooleanArray(input: Array<boolean>): Value {
+    let output = new Array<Value>(input.length)
+    for (let i: i32 = 0; i < input.length; i++) {
+      output[i] = Value.fromBoolean(input[i])
+    }
+    return Value.fromArray(output)
+  }
+
+  static fromBytesArray(input: Array<Bytes>): Value {
+    let output = new Array<Value>(input.length)
+    for (let i: i32 = 0; i < input.length; i++) {
+      output[i] = Value.fromBytes(input[i])
+    }
+    return Value.fromArray(output)
+  }
+
+  static fromI32Array(input: Array<i32>): Value {
+    let output = new Array<Value>(input.length)
+    for (let i: i32 = 0; i < input.length; i++) {
+      output[i] = Value.fromI32(input[i])
+    }
+    return Value.fromArray(output)
+  }
+
+  static fromBigIntArray(input: Array<BigInt>): Value {
+    let output = new Array<Value>(input.length)
+    for (let i: i32 = 0; i < input.length; i++) {
+      output[i] = Value.fromBigInt(input[i])
+    }
+    return Value.fromArray(output)
+  }
+
+  static fromBigDecimalArray(input: Array<BigDecimal>): Value {
+    let output = new Array<Value>(input.length)
+    for (let i: i32 = 0; i < input.length; i++) {
+      output[i] = Value.fromBigDecimal(input[i])
+    }
+    return Value.fromArray(output)
+  }
+
+  static fromStringArray(input: Array<string>): Value {
+    let output = new Array<Value>(input.length)
+    for (let i: i32 = 0; i < input.length; i++) {
+      output[i] = Value.fromString(input[i])
+    }
+    return Value.fromArray(output)
+  }
+
+  static fromArray(input: Array<Value>): Value {
+    let value = new Value()
+    value.kind = ValueKind.ARRAY
+    value.data = changetype<u32>(input) as u64
+    return value
+  }
+
+  static fromBigInt(n: BigInt): Value {
+    let value = new Value()
+    value.kind = ValueKind.BIGINT
+    value.data = n as u64
+    return value
+  }
+
+  static fromBoolean(b: boolean): Value {
+    let value = new Value()
+    value.kind = ValueKind.BOOL
+    value.data = b ? 1 : 0
+    return value
+  }
+
+  static fromBytes(bytes: Bytes): Value {
+    let value = new Value()
+    value.kind = ValueKind.BYTES
+    value.data = changetype<u32>(bytes) as u64
+    return value
+  }
+
+  static fromNull(): Value {
+    let value = new Value()
+    value.kind = ValueKind.NULL
+    return value
+  }
+
+  static fromI32(n: i32): Value {
+    let value = new Value()
+    value.kind = ValueKind.INT
+    value.data = n as u64
+    return value
+  }
+
+  static fromString(s: string): Value {
+    let value = new Value()
+    value.kind = ValueKind.STRING
+    value.data = changetype<u32>(s)
+    return value
+  }
+
+  static fromBigDecimal(n: BigDecimal): Value {
+    let value = new Value()
+    value.kind = ValueKind.BIGDECIMAL
+    value.data = n as u64
+    return value
+  }
+}
+
+/** An arbitrary size integer represented as an array of bytes. */
+export class BigInt extends Uint8Array {
+  toHex(): string {
+    return typeConversion.bigIntToHex(this)
+  }
+
+  toHexString(): string {
+    return typeConversion.bigIntToHex(this)
+  }
+
+  toString(): string {
+    return typeConversion.bigIntToString(this)
+  }
+
+  static fromI32(x: i32): BigInt {
+    return typeConversion.i32ToBigInt(x) as BigInt
+  }
+
+  toI32(): i32 {
+    return typeConversion.bigIntToI32(this)
+  }
+
+  @operator('+')
+  plus(other: BigInt): BigInt {
+    return bigInt.plus(this, other)
+  }
+
+  @operator('-')
+  minus(other: BigInt): BigInt {
+    return bigInt.minus(this, other)
+  }
+
+  @operator('*')
+  times(other: BigInt): BigInt {
+    return bigInt.times(this, other)
+  }
+
+  @operator('/')
+  div(other: BigInt): BigInt {
+    return bigInt.dividedBy(this, other)
+  }
+
+  divDecimal(other: BigDecimal): BigDecimal {
+    return bigInt.dividedByDecimal(this, other)
+  }
+
+  @operator('%')
+  mod(other: BigInt): BigInt {
+    return bigInt.mod(this, other)
+  }
+
+  @operator('==')
+  equals(other: BigInt): boolean {
+    if (this.length !== other.length) {
+      return false;
+    }
+    for (let i = 0; i < this.length; i++) {
+      if (this[i] !== other[i]) {
+        return false;
+      }
+    }
+    return true;
+  }
+
+  toBigDecimal(): BigDecimal {
+    return new BigDecimal(this)
+  }
+}
+
+export class BigDecimal {
+  exp!: BigInt
+  digits!: BigInt
+
+  constructor(bigInt: BigInt) {
+    this.digits = bigInt
+    this.exp = BigInt.fromI32(0)
+  }
+
+  static fromString(s: string): BigDecimal {
+    return bigDecimal.fromString(s)
+  }
+
+  toString(): string {
+    return bigDecimal.toString(this)
+  }
+
+  truncate(decimals: i32): BigDecimal {
+    let digitsRightOfZero = this.digits.toString().length + this.exp.toI32()
+    let newDigitLength = decimals + digitsRightOfZero
+    let truncateLength = this.digits.toString().length - newDigitLength
+    if (truncateLength < 0) {
+      return this
+    } else {
+      for (let i = 0; i < truncateLength; i++) {
+        this.digits = this.digits.div(BigInt.fromI32(10))
+      }
+      this.exp = BigInt.fromI32(decimals * -1)
+      return this
+    }
+  }
+
+  @operator('+')
+  plus(other: BigDecimal): BigDecimal {
+    return bigDecimal.plus(this, other)
+  }
+
+  @operator('-')
+  minus(other: BigDecimal): BigDecimal {
+    return bigDecimal.minus(this, other)
+  }
+
+  @operator('*')
+  times(other: BigDecimal): BigDecimal {
+    return bigDecimal.times(this, other)
+  }
+
+  @operator('/')
+  div(other: BigDecimal): BigDecimal {
+    return bigDecimal.dividedBy(this, other)
+  }
+
+  @operator('==')
+  equals(other: BigDecimal): boolean {
+    return bigDecimal.equals(this, other)
+  }
+}
+
+export enum TokenKind {
+  ADDRESS = 0,
+  FIXED_BYTES = 1,
+  BYTES = 2,
+  INT = 3,
+  UINT = 4,
+  BOOL = 5,
+  STRING = 6,
+  FIXED_ARRAY = 7,
+  ARRAY = 8
+}
+export class Token {
+  kind: TokenKind
+  data: Payload
+}
+
+// Sequence of 4 `u64`s.
+export type Int64 = Uint64Array;
+export type Uint64 = Uint64Array;
+
+/**
+ * TypedMap entry.
+ */
+export class TypedMapEntry<K, V> {
+  key: K
+  value: V
+
+  constructor(key: K, value: V) {
+    this.key = key
+    this.value = value
+  }
+}
+
+/** Typed map */
+export class TypedMap<K, V> {
+  entries: Array<TypedMapEntry<K, V>>
+
+  constructor() {
+    this.entries = new Array<TypedMapEntry<K, V>>(0)
+  }
+
+  set(key: K, value: V): void {
+    let entry = this.getEntry(key)
+    if (entry !== null) {
+      entry.value = value
+    } else {
+      let entry = new TypedMapEntry<K, V>(key, value)
+      this.entries.push(entry)
+    }
+  }
+
+  getEntry(key: K): TypedMapEntry<K, V> | null {
+    for (let i: i32 = 0; i < this.entries.length; i++) {
+      if (this.entries[i].key == key) {
+        return this.entries[i]
+      }
+    }
+    return null
+  }
+
+  get(key: K): V | null {
+    for (let i: i32 = 0; i < this.entries.length; i++) {
+      if (this.entries[i].key == key) {
+        return this.entries[i].value
+      }
+    }
+    return null
+  }
+
+  isSet(key: K): bool {
+    for (let i: i32 = 0; i < this.entries.length; i++) {
+      if (this.entries[i].key == key) {
+        return true
+      }
+    }
+    return false
+  }
+}
+
+/**
+ * Common representation for entity data, storing entity attributes
+ * as `string` keys and the attribute values as dynamically-typed
+ * `Value` objects.
+ */
+export class Entity extends TypedMap<string, Value> {
+  unset(key: string): void {
+    this.set(key, Value.fromNull())
+  }
+
+  /** Assigns properties from sources to this Entity in right-to-left order */
+  merge(sources: Array<Entity>): Entity {
+    var target = this
+    for (let i = 0; i < sources.length; i++) {
+      let entries = sources[i].entries
+      for (let j = 0; j < entries.length; j++) {
+        target.set(entries[j].key, entries[j].value)
+      }
+    }
+    return target
+  }
+}
+
+/** Type hint for JSON values. */
+export enum JSONValueKind {
+  NULL = 0,
+  BOOL = 1,
+  NUMBER = 2,
+  STRING = 3,
+  ARRAY = 4,
+  OBJECT = 5,
+}
+
+/**
+ * Pointer type for JSONValue data.
+ *
+ * Big enough to fit any pointer or native `this.data`.
+ */
+export type JSONValuePayload = u64
+export class JSONValue {
+  kind: JSONValueKind
+  data: JSONValuePayload
+
+  toString(): string {
+    assert(this.kind == JSONValueKind.STRING, 'JSON value is not a string.')
+    return changetype<string>(this.data as u32)
+  }
+
+  toObject(): TypedMap<string, JSONValue> {
+    assert(this.kind == JSONValueKind.OBJECT, 'JSON value is not an object.')
+    return changetype<TypedMap<string, JSONValue>>(this.data as u32)
+  }
+}
+
+export class Wrapped<T> {
+  inner: T;
+
+  constructor(inner: T) {
+    this.inner = inner;
+  }
+}
+
+export class Result<V, E> {
+  _value: Wrapped<V> | null;
+  _error: Wrapped<E> | null;
+
+  get isOk(): boolean {
+    return this._value !== null;
+  }
+
+  get isError(): boolean {
+    return this._error !== null;
+  }
+
+  get value(): V {
+    assert(this._value != null, "Trying to get a value from an error result");
+    return (this._value as Wrapped<V>).inner;
+  }
+
+  get error(): E {
+    assert(
+      this._error != null,
+      "Trying to get an error from a successful result"
+    );
+    return (this._error as Wrapped<E>).inner;
+  }
+}
+
+/**
+ * Byte array
+ */
+class ByteArray extends Uint8Array {
+  toHex(): string {
+    return typeConversion.bytesToHex(this)
+  }
+
+  toHexString(): string {
+    return typeConversion.bytesToHex(this)
+  }
+
+  toString(): string {
+    return typeConversion.bytesToString(this)
+  }
+
+  toBase58(): string {
+    return typeConversion.bytesToBase58(this)
+  }
+}
diff --git a/runtime/test/wasm_test/api_version_0_0_5/contract_calls.ts b/runtime/test/wasm_test/api_version_0_0_5/contract_calls.ts
new file mode 100644
index 0000000..223ea0c
--- /dev/null
+++ b/runtime/test/wasm_test/api_version_0_0_5/contract_calls.ts
@@ -0,0 +1,10 @@
+export * from './common/global'
+import { Address } from './common/types'
+
+export declare namespace ethereum {
+  function call(call: Address): Array<Address> | null
+}
+
+export function callContract(address: Address): void {
+  ethereum.call(address)
+}
diff --git a/runtime/test/wasm_test/api_version_0_0_5/contract_calls.wasm b/runtime/test/wasm_test/api_version_0_0_5/contract_calls.wasm
new file mode 100644
index 0000000..b2ab791
Binary files /dev/null and b/runtime/test/wasm_test/api_version_0_0_5/contract_calls.wasm differ
diff --git a/runtime/test/wasm_test/api_version_0_0_5/crypto.ts b/runtime/test/wasm_test/api_version_0_0_5/crypto.ts
new file mode 100644
index 0000000..89a1781
--- /dev/null
+++ b/runtime/test/wasm_test/api_version_0_0_5/crypto.ts
@@ -0,0 +1,9 @@
+export * from './common/global'
+
+declare namespace crypto {
+    function keccak256(input: Uint8Array): Uint8Array
+}
+
+export function hash(input: Uint8Array): Uint8Array {
+    return crypto.keccak256(input)
+}
diff --git a/runtime/test/wasm_test/api_version_0_0_5/crypto.wasm b/runtime/test/wasm_test/api_version_0_0_5/crypto.wasm
new file mode 100644
index 0000000..393c57a
Binary files /dev/null and b/runtime/test/wasm_test/api_version_0_0_5/crypto.wasm differ
diff --git a/runtime/test/wasm_test/api_version_0_0_5/data_source_create.ts b/runtime/test/wasm_test/api_version_0_0_5/data_source_create.ts
new file mode 100644
index 0000000..c071dd8
--- /dev/null
+++ b/runtime/test/wasm_test/api_version_0_0_5/data_source_create.ts
@@ -0,0 +1,9 @@
+export * from './common/global'
+
+declare namespace dataSource {
+    function create(name: string, params: Array<string>): void
+}
+
+export function dataSourceCreate(name: string, params: Array<string>): void {
+    dataSource.create(name, params)
+}
diff --git a/runtime/test/wasm_test/api_version_0_0_5/data_source_create.wasm b/runtime/test/wasm_test/api_version_0_0_5/data_source_create.wasm
new file mode 100644
index 0000000..6b3f7e6
Binary files /dev/null and b/runtime/test/wasm_test/api_version_0_0_5/data_source_create.wasm differ
diff --git a/runtime/test/wasm_test/api_version_0_0_5/ens_name_by_hash.ts b/runtime/test/wasm_test/api_version_0_0_5/ens_name_by_hash.ts
new file mode 100644
index 0000000..8f11518
--- /dev/null
+++ b/runtime/test/wasm_test/api_version_0_0_5/ens_name_by_hash.ts
@@ -0,0 +1,9 @@
+export * from './common/global'
+
+declare namespace ens {
+    function nameByHash(hash: string): string|null
+}
+
+export function nameByHash(hash: string): string|null {
+  return ens.nameByHash(hash)
+}
diff --git a/runtime/test/wasm_test/api_version_0_0_5/ens_name_by_hash.wasm b/runtime/test/wasm_test/api_version_0_0_5/ens_name_by_hash.wasm
new file mode 100644
index 0000000..6fe9960
Binary files /dev/null and b/runtime/test/wasm_test/api_version_0_0_5/ens_name_by_hash.wasm differ
diff --git a/runtime/test/wasm_test/api_version_0_0_5/ipfs_block.ts b/runtime/test/wasm_test/api_version_0_0_5/ipfs_block.ts
new file mode 100644
index 0000000..7fc1797
--- /dev/null
+++ b/runtime/test/wasm_test/api_version_0_0_5/ipfs_block.ts
@@ -0,0 +1,13 @@
+export * from './common/global'
+
+declare namespace typeConversion {
+    function bytesToHex(bytes: Uint8Array): string
+}
+
+declare namespace ipfs {
+    function getBlock(hash: String): Uint8Array
+}
+
+export function ipfsBlockHex(hash: string): string {
+    return typeConversion.bytesToHex(ipfs.getBlock(hash))
+}
diff --git a/runtime/test/wasm_test/api_version_0_0_5/ipfs_block.wasm b/runtime/test/wasm_test/api_version_0_0_5/ipfs_block.wasm
new file mode 100644
index 0000000..985b3bb
Binary files /dev/null and b/runtime/test/wasm_test/api_version_0_0_5/ipfs_block.wasm differ
diff --git a/runtime/test/wasm_test/api_version_0_0_5/ipfs_cat.ts b/runtime/test/wasm_test/api_version_0_0_5/ipfs_cat.ts
new file mode 100644
index 0000000..a66540b
--- /dev/null
+++ b/runtime/test/wasm_test/api_version_0_0_5/ipfs_cat.ts
@@ -0,0 +1,17 @@
+export * from './common/global'
+
+declare namespace typeConversion {
+    function bytesToString(bytes: Uint8Array): string
+}
+
+declare namespace ipfs {
+    function cat(hash: String): Uint8Array
+}
+
+export function ipfsCatString(hash: string): string {
+    return typeConversion.bytesToString(ipfs.cat(hash))
+}
+
+export function ipfsCat(hash: string): Uint8Array {
+    return ipfs.cat(hash)
+}
diff --git a/runtime/test/wasm_test/api_version_0_0_5/ipfs_cat.wasm b/runtime/test/wasm_test/api_version_0_0_5/ipfs_cat.wasm
new file mode 100644
index 0000000..b803eb6
Binary files /dev/null and b/runtime/test/wasm_test/api_version_0_0_5/ipfs_cat.wasm differ
diff --git a/runtime/test/wasm_test/api_version_0_0_5/ipfs_map.ts b/runtime/test/wasm_test/api_version_0_0_5/ipfs_map.ts
new file mode 100644
index 0000000..b52d31b
--- /dev/null
+++ b/runtime/test/wasm_test/api_version_0_0_5/ipfs_map.ts
@@ -0,0 +1,41 @@
+export * from './common/global'
+import { Value, ValueKind, TypedMapEntry, TypedMap, Entity, JSONValueKind, JSONValue } from './common/types'
+
+/*
+ * Declarations copied from graph-ts/input.ts and edited for brevity
+ */
+
+declare namespace store {
+  function set(entity: string, id: string, data: Entity): void
+}
+
+/*
+ * Actual setup for the test
+ */
+declare namespace ipfs {
+  function map(hash: String, callback: String, userData: Value, flags: String[]): void
+}
+
+export function echoToStore(data: JSONValue, userData: Value): void {
+  // expect a map of the form { "id": "anId", "value": "aValue" }
+  let map = data.toObject();
+
+  let id = map.get("id");
+  let value = map.get("value");
+
+  assert(id !== null, "'id' should not be null");
+  assert(value !== null, "'value' should not be null");
+
+  let stringId = id!.toString();
+  let stringValue = value!.toString();
+
+  let entity = new Entity();
+  entity.set("id", Value.fromString(stringId));
+  entity.set("value", Value.fromString(stringValue));
+  entity.set("extra", userData);
+  store.set("Thing", stringId, entity);
+}
+
+export function ipfsMap(hash: string, userData: string): void {
+  ipfs.map(hash, "echoToStore", Value.fromString(userData), ["json"])
+}
diff --git a/runtime/test/wasm_test/api_version_0_0_5/ipfs_map.wasm b/runtime/test/wasm_test/api_version_0_0_5/ipfs_map.wasm
new file mode 100644
index 0000000..e4b5cdc
Binary files /dev/null and b/runtime/test/wasm_test/api_version_0_0_5/ipfs_map.wasm differ
diff --git a/runtime/test/wasm_test/api_version_0_0_5/json_parsing.ts b/runtime/test/wasm_test/api_version_0_0_5/json_parsing.ts
new file mode 100644
index 0000000..d1d27ff
--- /dev/null
+++ b/runtime/test/wasm_test/api_version_0_0_5/json_parsing.ts
@@ -0,0 +1,49 @@
+import { JSONValue, JSONValueKind, Bytes, Wrapped, Result } from './common/types'
+
+enum IndexForAscTypeId {
+  STRING = 0,
+  ARRAY_BUFFER = 1,
+  UINT8_ARRAY = 6,
+  WRAPPED_BOOL = 28,
+  WRAPPED_JSON_VALUE = 29,
+  JSON_VALUE = 32,
+  RESULT_JSON_VALUE_BOOL = 40,
+}
+
+export function id_of_type(type_id_index: IndexForAscTypeId): usize {
+  switch (type_id_index) {
+    case IndexForAscTypeId.STRING:
+      return idof<string>();
+    case IndexForAscTypeId.ARRAY_BUFFER:
+      return idof<ArrayBuffer>();
+    case IndexForAscTypeId.UINT8_ARRAY:
+      return idof<Uint8Array>();
+    case IndexForAscTypeId.WRAPPED_BOOL:
+      return idof<Wrapped<bool>>();
+    case IndexForAscTypeId.WRAPPED_JSON_VALUE:
+      return idof<Wrapped<JSONValue>>();
+    case IndexForAscTypeId.JSON_VALUE:
+      return idof<JSONValue>();
+    case IndexForAscTypeId.RESULT_JSON_VALUE_BOOL:
+      return idof<Result<JSONValue, bool>>();
+    default:
+      return 0;
+  }
+}
+
+export function allocate(n: usize): usize {
+  return __alloc(n);
+}
+
+declare namespace json {
+  function try_fromBytes(data: Bytes): Result<JSONValue, boolean>;
+}
+
+export function handleJsonError(data: Bytes): string {
+  let result = json.try_fromBytes(data);
+  if (result.isOk) {
+    return "OK: " + result.value.toString() + ", ERROR: " + (result.isError ? "true" : "false");
+  } else {
+    return "ERROR: " + (result.error ? "true" : "false");
+  }
+}
diff --git a/runtime/test/wasm_test/api_version_0_0_5/json_parsing.wasm b/runtime/test/wasm_test/api_version_0_0_5/json_parsing.wasm
new file mode 100644
index 0000000..99479a5
Binary files /dev/null and b/runtime/test/wasm_test/api_version_0_0_5/json_parsing.wasm differ
diff --git a/runtime/test/wasm_test/api_version_0_0_5/non_terminating.ts b/runtime/test/wasm_test/api_version_0_0_5/non_terminating.ts
new file mode 100644
index 0000000..77866c3
--- /dev/null
+++ b/runtime/test/wasm_test/api_version_0_0_5/non_terminating.ts
@@ -0,0 +1,10 @@
+export * from './common/global'
+
+// Test that non-terminating handlers are killed by timeout.
+export function loop(): void {
+    while (true) {}
+}
+
+export function rabbit_hole(): void {
+    rabbit_hole()
+}
diff --git a/runtime/test/wasm_test/api_version_0_0_5/non_terminating.wasm b/runtime/test/wasm_test/api_version_0_0_5/non_terminating.wasm
new file mode 100644
index 0000000..bd9d564
Binary files /dev/null and b/runtime/test/wasm_test/api_version_0_0_5/non_terminating.wasm differ
diff --git a/runtime/test/wasm_test/api_version_0_0_5/null_ptr_read.ts b/runtime/test/wasm_test/api_version_0_0_5/null_ptr_read.ts
new file mode 100644
index 0000000..f111e6a
--- /dev/null
+++ b/runtime/test/wasm_test/api_version_0_0_5/null_ptr_read.ts
@@ -0,0 +1,82 @@
+export * from './common/global';
+
+declare namespace bigInt {
+    function plus(x: BigInt, y: BigInt): BigInt
+}
+
+class BigInt extends Uint8Array {
+    static fromI32(x: i32): BigInt {
+        let self = new Uint8Array(4);
+        self[0] = x as u8;
+        self[1] = (x >> 8) as u8;
+        self[2] = (x >> 16) as u8;
+        self[3] = (x >> 24) as u8;
+        return changetype<BigInt>(self);
+    }
+
+    @operator('+')
+    plus(other: BigInt): BigInt {
+        return bigInt.plus(this, other);
+    }
+}
+
+class Wrapper {
+    public constructor(
+        public n: BigInt | null
+    ) {}
+}
+
+export function nullPtrRead(): void {
+    let x = BigInt.fromI32(2);
+    let y: BigInt | null = null;
+
+    let wrapper = new Wrapper(y);
+
+    // Operator overloading works even on nullable types.
+    // To fix this, the type signature of the function should
+    // consider nullable types, like this:
+    //
+    // @operator('+')
+    // plus(other: BigInt | null): BigInt {
+    //   // Do null checks
+    // }
+    //
+    // This test is proposidely doing this to make sure we give
+    // the correct error message to the user.
+    wrapper.n = wrapper.n + x;
+}
+
+class SafeBigInt extends Uint8Array {
+    static fromI32(x: i32): SafeBigInt {
+        let self = new Uint8Array(4);
+        self[0] = x as u8;
+        self[1] = (x >> 8) as u8;
+        self[2] = (x >> 16) as u8;
+        self[3] = (x >> 24) as u8;
+        return changetype<SafeBigInt>(self);
+    }
+
+    @operator('+')
+    plus(other: SafeBigInt): SafeBigInt {
+        assert(this !== null, "Failed to sum BigInts because left hand side is 'null'");
+
+        return changetype<SafeBigInt>(bigInt.plus(changetype<BigInt>(this), changetype<BigInt>(other)));
+    }
+}
+
+class Wrapper2 {
+    public constructor(
+        public n: SafeBigInt | null
+    ) {}
+}
+
+export function safeNullPtrRead(): void {
+    let x = SafeBigInt.fromI32(2);
+    let y: SafeBigInt | null = null;
+
+    let wrapper2 = new Wrapper2(y);
+
+    // Breaks as well, but by our assertion, before getting into
+    // the Rust code.
+    wrapper2.n = wrapper2.n + x;
+}
diff --git a/runtime/test/wasm_test/api_version_0_0_5/null_ptr_read.wasm b/runtime/test/wasm_test/api_version_0_0_5/null_ptr_read.wasm
new file mode 100644
index 0000000..a4e05ba
Binary files /dev/null and b/runtime/test/wasm_test/api_version_0_0_5/null_ptr_read.wasm differ
diff --git a/runtime/test/wasm_test/api_version_0_0_5/store.ts b/runtime/test/wasm_test/api_version_0_0_5/store.ts
new file mode 100644
index 0000000..e755c27
--- /dev/null
+++ b/runtime/test/wasm_test/api_version_0_0_5/store.ts
@@ -0,0 +1,53 @@
+export * from './common/global'
+import { TypedMap, Entity, BigDecimal, Value } from './common/types'
+
+/** Definitions copied from graph-ts/index.ts */
+declare namespace store {
+  function get(entity: string, id: string): Entity | null
+  function set(entity: string, id: string, data: Entity): void
+  function remove(entity: string, id: string): void
+}
+
+/** Host Ethereum interface */
+declare namespace ethereum {
+  function call(call: SmartContractCall): Array<EthereumValue>
+}
+
+/** Host interface for BigInt arithmetic */
+declare namespace bigInt {
+  function plus(x: BigInt, y: BigInt): BigInt
+  function minus(x: BigInt, y: BigInt): BigInt
+  function times(x: BigInt, y: BigInt): BigInt
+  function dividedBy(x: BigInt, y: BigInt): BigInt
+  function dividedByDecimal(x: BigInt, y: BigDecimal): BigDecimal
+  function mod(x: BigInt, y: BigInt): BigInt
+}
+
+/** Host interface for BigDecimal */
+declare namespace bigDecimal {
+  function plus(x: BigDecimal, y: BigDecimal): BigDecimal
+  function minus(x: BigDecimal, y: BigDecimal): BigDecimal
+  function times(x: BigDecimal, y: BigDecimal): BigDecimal
+  function dividedBy(x: BigDecimal, y: BigDecimal): BigDecimal
+  function equals(x: BigDecimal, y: BigDecimal): boolean
+  function toString(bigDecimal: BigDecimal): string
+  function fromString(s: string): BigDecimal
+}
+
+/**
+ * Test functions
+ */
+export function getUser(id: string): Entity | null {
+  return store.get("User", id);
+}
+
+export function loadAndSetUserName(id: string, name: string) : void {
+  let user = store.get("User", id);
+  if (user == null) {
+    user = new Entity();
+    user.set("id", Value.fromString(id));
+  }
+  user.set("name", Value.fromString(name));
+  // save it
+  store.set("User", id, (user as Entity));
+}
diff --git a/runtime/test/wasm_test/api_version_0_0_5/store.wasm b/runtime/test/wasm_test/api_version_0_0_5/store.wasm
new file mode 100644
index 0000000..577d136
Binary files /dev/null and b/runtime/test/wasm_test/api_version_0_0_5/store.wasm differ
diff --git a/runtime/test/wasm_test/api_version_0_0_5/string_to_number.ts b/runtime/test/wasm_test/api_version_0_0_5/string_to_number.ts
new file mode 100644
index 0000000..027b387
--- /dev/null
+++ b/runtime/test/wasm_test/api_version_0_0_5/string_to_number.ts
@@ -0,0 +1,26 @@
+export * from './common/global'
+import { BigInt } from './common/types'
+
+/** Host JSON interface */
+declare namespace json {
+    function toI64(decimal: string): i64
+    function toU64(decimal: string): u64
+    function toF64(decimal: string): f64
+    function toBigInt(decimal: string): BigInt
+}
+
+export function testToI64(decimal: string): i64 {
+    return json.toI64(decimal);
+}
+
+export function testToU64(decimal: string): u64 {
+    return json.toU64(decimal);
+}
+
+export function testToF64(decimal: string): f64 {
+    return json.toF64(decimal)
+}
+
+export function testToBigInt(decimal: string): BigInt {
+    return json.toBigInt(decimal)
+}
diff --git a/runtime/test/wasm_test/api_version_0_0_5/string_to_number.wasm b/runtime/test/wasm_test/api_version_0_0_5/string_to_number.wasm
new file mode 100644
index 0000000..bc46b67
Binary files /dev/null and b/runtime/test/wasm_test/api_version_0_0_5/string_to_number.wasm differ
diff --git a/runtime/test/wasm_test/api_version_0_0_5/test_padding.ts b/runtime/test/wasm_test/api_version_0_0_5/test_padding.ts
new file mode 100644
index 0000000..7051de3
--- /dev/null
+++ b/runtime/test/wasm_test/api_version_0_0_5/test_padding.ts
@@ -0,0 +1,125 @@
+export * from './common/global'
+
+export class UnitTestTypeBool{
+    str_pref: string;
+    under_test: boolean;
+    str_suff: string;
+    large: i64 ;
+    tail:  boolean ;
+
+
+
+    constructor(str_pref: string, under_test: boolean, str_suff:string, large: i64, tail:boolean) {
+        this.str_pref = str_pref;
+        this.under_test = under_test;
+        this.str_suff = str_suff;
+        this.large = large;
+        this.tail = tail;
+    }
+}
+
+export function test_padding_bool(p: UnitTestTypeBool): void {
+     assert(p.str_pref == "pref", "parm.str_pref: Assertion failed!");
+     assert(p.under_test == true, "parm.under_test: Assertion failed!");
+     assert(p.str_suff == "suff", "parm.str_suff: Assertion failed!");
+     assert(p.large == 9223372036854775807, "parm.large: Assertion failed!");
+     assert(p.tail == true, "parm.tail: Assertion failed!");
+}
+
+export class UnitTestTypeI8{
+    str_pref: string;
+    under_test: i8;
+    str_suff: string;
+    large: i64 ;
+    tail:  boolean ;
+
+
+
+    constructor(str_pref: string, under_test: i8, str_suff:string, large: i64, tail:boolean) {
+        this.str_pref = str_pref;
+        this.under_test = under_test;
+        this.str_suff = str_suff;
+        this.large = large;
+        this.tail = tail;
+    }
+}
+
+export function test_padding_i8(p: UnitTestTypeI8): void {
+    assert(p.str_pref == "pref", "parm.str_pref: Assertion failed!");
+    assert(p.under_test == 127, "parm.under_test: Assertion failed!");
+    assert(p.str_suff == "suff", "parm.str_suff: Assertion failed!");
+    assert(p.large == 9223372036854775807, "parm.large: Assertion failed!");
+    assert(p.tail == true, "parm.tail: Assertion failed!");
+}
+
+
+export class UnitTestTypeU16{
+    str_pref: string;
+    under_test: i16;
+    str_suff: string;
+    large: i64 ;
+    tail:  boolean ;
+
+
+
+    constructor(str_pref: string, under_test: i16, str_suff:string, large: i64, tail:boolean) {
+        this.str_pref = str_pref;
+        this.under_test = under_test;
+        this.str_suff = str_suff;
+        this.large = large;
+        this.tail = tail;
+    }
+}
+
+export function test_padding_i16(p: UnitTestTypeU16): void {
+    assert(p.str_pref == "pref", "parm.str_pref: Assertion failed!");
+    assert(p.under_test == 32767, "parm.under_test: Assertion failed!");
+    assert(p.str_suff == "suff", "parm.str_suff: Assertion failed!");
+    assert(p.large == 9223372036854775807, "parm.large: Assertion failed!");
+    assert(p.tail == true, "parm.tail: Assertion failed!");
+}
+
+export class UnitTestTypeU32{
+    str_pref: string;
+    under_test: i32;
+    str_suff: string;
+    large: i64 ;
+    tail:  boolean ;
+
+
+
+    constructor(str_pref: string, under_test: i32, str_suff:string, large: i64, tail:boolean) {
+        this.str_pref = str_pref;
+        this.under_test = under_test;
+        this.str_suff = str_suff;
+        this.large = large;
+        this.tail = tail;
+    }
+}
+
+export function test_padding_i32(p: UnitTestTypeU32): void {
+    assert(p.str_pref == "pref", "parm.str_pref: Assertion failed!");
+    assert(p.under_test == 2147483647, "parm.under_test: Assertion failed!");
+    assert(p.str_suff == "suff", "parm.str_suff: Assertion failed!");
+    assert(p.large == 9223372036854775807, "parm.large: Assertion failed!");
+    assert(p.tail == true, "parm.tail: Assertion failed!");
+}
+
+
+export class ManualPadding{
+    nonce: i64 ;
+    str_suff: string;
+    tail: i64 ;
+
+    constructor(nonce: i64, str_suff:string, tail:i64) {
+        this.nonce = nonce;
+        this.str_suff = str_suff;
+        this.tail = tail
+    }
+}
+
+export function test_padding_manual(p: ManualPadding): void {
+    assert(p.nonce == 9223372036854775807, "parm.nonce: Assertion failed!");
+    assert(p.str_suff == "suff", "parm.str_suff: Assertion failed!");
+    assert(p.tail == 9223372036854775807, "parm.tail: Assertion failed!");
+}
diff --git a/runtime/test/wasm_test/api_version_0_0_5/test_padding.wasm b/runtime/test/wasm_test/api_version_0_0_5/test_padding.wasm
new file mode 100644
index 0000000..f68205a
Binary files /dev/null and b/runtime/test/wasm_test/api_version_0_0_5/test_padding.wasm differ
diff --git a/runtime/wasm/Cargo.toml b/runtime/wasm/Cargo.toml
new file mode 100644
index 0000000..32818eb
--- /dev/null
+++ b/runtime/wasm/Cargo.toml
@@ -0,0 +1,29 @@
+[package]
+name = "graph-runtime-wasm"
+version = "0.27.0"
+edition = "2021"
+
+[dependencies]
+async-trait = "0.1.50"
+atomic_refcell = "0.1.8"
+ethabi = "17.2"
+futures = "0.1.21"
+hex = "0.4.3"
+graph = { path = "../../graph" }
+bs58 = "0.4.0"
+graph-runtime-derive = { path = "../derive" }
+semver = "1.0.12"
+lazy_static = "1.4"
+uuid = { version = "1.1.2", features = ["v4"] }
+strum = "0.21.0"
+strum_macros = "0.21.1"
+bytes = "1.0"
+anyhow = "1.0"
+wasmtime = "0.27.0"
+defer = "0.1"
+never = "0.1"
+
+wasm-instrument = { version = "0.2.0", features = ["std", "sign_ext"] }
+
+# AssemblyScript uses sign extensions
+parity-wasm = { version = "0.45", features = ["std", "sign_ext"] }
diff --git a/runtime/wasm/src/asc_abi/class.rs b/runtime/wasm/src/asc_abi/class.rs
new file mode 100644
index 0000000..5298eee
--- /dev/null
+++ b/runtime/wasm/src/asc_abi/class.rs
@@ -0,0 +1,723 @@
+use ethabi;
+use semver::Version;
+
+use graph::{
+    data::store,
+    runtime::{
+        gas::GasCounter, AscHeap, AscIndexId, AscType, AscValue, IndexForAscTypeId, ToAscObj,
+    },
+};
+use graph::{prelude::serde_json, runtime::DeterministicHostError};
+use graph::{prelude::slog, runtime::AscPtr};
+use graph_runtime_derive::AscType;
+
+use crate::asc_abi::{v0_0_4, v0_0_5};
+
+///! Rust types that have with a direct correspondence to an Asc class,
+///! with their `AscType` implementations.
+
+/// Wrapper of ArrayBuffer for multiple AssemblyScript versions.
+/// It just delegates its method calls to the correct mappings apiVersion.
+pub enum ArrayBuffer {
+    ApiVersion0_0_4(v0_0_4::ArrayBuffer),
+    ApiVersion0_0_5(v0_0_5::ArrayBuffer),
+}
+
+impl ArrayBuffer {
+    pub(crate) fn new<T: AscType>(
+        values: &[T],
+        api_version: Version,
+    ) -> Result<Self, DeterministicHostError> {
+        match api_version {
+            version if version <= Version::new(0, 0, 4) => {
+                Ok(Self::ApiVersion0_0_4(v0_0_4::ArrayBuffer::new(values)?))
+            }
+            _ => Ok(Self::ApiVersion0_0_5(v0_0_5::ArrayBuffer::new(values)?)),
+        }
+    }
+}
+
+impl AscType for ArrayBuffer {
+    fn to_asc_bytes(&self) -> Result<Vec<u8>, DeterministicHostError> {
+        match self {
+            Self::ApiVersion0_0_4(a) => a.to_asc_bytes(),
+            Self::ApiVersion0_0_5(a) => a.to_asc_bytes(),
+        }
+    }
+
+    fn from_asc_bytes(
+        asc_obj: &[u8],
+        api_version: &Version,
+    ) -> Result<Self, DeterministicHostError> {
+        match api_version {
+            version if *version <= Version::new(0, 0, 4) => Ok(Self::ApiVersion0_0_4(
+                v0_0_4::ArrayBuffer::from_asc_bytes(asc_obj, api_version)?,
+            )),
+            _ => Ok(Self::ApiVersion0_0_5(v0_0_5::ArrayBuffer::from_asc_bytes(
+                asc_obj,
+                api_version,
+            )?)),
+        }
+    }
+
+    fn asc_size<H: AscHeap + ?Sized>(
+        ptr: AscPtr<Self>,
+        heap: &H,
+        gas: &GasCounter,
+    ) -> Result<u32, DeterministicHostError> {
+        v0_0_4::ArrayBuffer::asc_size(AscPtr::new(ptr.wasm_ptr()), heap, gas)
+    }
+
+    fn content_len(&self, asc_bytes: &[u8]) -> usize {
+        match self {
+            Self::ApiVersion0_0_5(a) => a.content_len(asc_bytes),
+            _ => unreachable!("Only called for apiVersion >=0.0.5"),
+        }
+    }
+}
+
+impl AscIndexId for ArrayBuffer {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::ArrayBuffer;
+}
+
+/// Wrapper of TypedArray for multiple AssemblyScript versions.
+/// It just delegates its method calls to the correct mappings apiVersion.
+pub enum TypedArray<T> {
+    ApiVersion0_0_4(v0_0_4::TypedArray<T>),
+    ApiVersion0_0_5(v0_0_5::TypedArray<T>),
+}
+
+impl<T: AscValue> TypedArray<T> {
+    pub fn new<H: AscHeap + ?Sized>(
+        content: &[T],
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<Self, DeterministicHostError> {
+        match heap.api_version() {
+            version if version <= Version::new(0, 0, 4) => Ok(Self::ApiVersion0_0_4(
+                v0_0_4::TypedArray::new(content, heap, gas)?,
+            )),
+            _ => Ok(Self::ApiVersion0_0_5(v0_0_5::TypedArray::new(
+                content, heap, gas,
+            )?)),
+        }
+    }
+
+    pub fn to_vec<H: AscHeap + ?Sized>(
+        &self,
+        heap: &H,
+        gas: &GasCounter,
+    ) -> Result<Vec<T>, DeterministicHostError> {
+        match self {
+            Self::ApiVersion0_0_4(t) => t.to_vec(heap, gas),
+            Self::ApiVersion0_0_5(t) => t.to_vec(heap, gas),
+        }
+    }
+}
+
+impl<T> AscType for TypedArray<T> {
+    fn to_asc_bytes(&self) -> Result<Vec<u8>, DeterministicHostError> {
+        match self {
+            Self::ApiVersion0_0_4(t) => t.to_asc_bytes(),
+            Self::ApiVersion0_0_5(t) => t.to_asc_bytes(),
+        }
+    }
+
+    fn from_asc_bytes(
+        asc_obj: &[u8],
+        api_version: &Version,
+    ) -> Result<Self, DeterministicHostError> {
+        match api_version {
+            version if *version <= Version::new(0, 0, 4) => Ok(Self::ApiVersion0_0_4(
+                v0_0_4::TypedArray::from_asc_bytes(asc_obj, api_version)?,
+            )),
+            _ => Ok(Self::ApiVersion0_0_5(v0_0_5::TypedArray::from_asc_bytes(
+                asc_obj,
+                api_version,
+            )?)),
+        }
+    }
+}
+
+pub struct Bytes<'a>(pub &'a Vec<u8>);
+
+pub type Uint8Array = TypedArray<u8>;
+impl ToAscObj<Uint8Array> for Bytes<'_> {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<Uint8Array, DeterministicHostError> {
+        self.0.to_asc_obj(heap, gas)
+    }
+}
+
+impl AscIndexId for TypedArray<i8> {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::Int8Array;
+}
+
+impl AscIndexId for TypedArray<i16> {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::Int16Array;
+}
+
+impl AscIndexId for TypedArray<i32> {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::Int32Array;
+}
+
+impl AscIndexId for TypedArray<i64> {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::Int64Array;
+}
+
+impl AscIndexId for TypedArray<u8> {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::Uint8Array;
+}
+
+impl AscIndexId for TypedArray<u16> {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::Uint16Array;
+}
+
+impl AscIndexId for TypedArray<u32> {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::Uint32Array;
+}
+
+impl AscIndexId for TypedArray<u64> {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::Uint64Array;
+}
+
+impl AscIndexId for TypedArray<f32> {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::Float32Array;
+}
+
+impl AscIndexId for TypedArray<f64> {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::Float64Array;
+}
+
+/// Wrapper of String for multiple AssemblyScript versions.
+/// It just delegates its method calls to the correct mappings apiVersion.
+pub enum AscString {
+    ApiVersion0_0_4(v0_0_4::AscString),
+    ApiVersion0_0_5(v0_0_5::AscString),
+}
+
+impl AscString {
+    pub fn new(content: &[u16], api_version: Version) -> Result<Self, DeterministicHostError> {
+        match api_version {
+            version if version <= Version::new(0, 0, 4) => {
+                Ok(Self::ApiVersion0_0_4(v0_0_4::AscString::new(content)?))
+            }
+            _ => Ok(Self::ApiVersion0_0_5(v0_0_5::AscString::new(content)?)),
+        }
+    }
+
+    pub fn content(&self) -> &[u16] {
+        match self {
+            Self::ApiVersion0_0_4(s) => &s.content,
+            Self::ApiVersion0_0_5(s) => &s.content,
+        }
+    }
+}
+
+impl AscIndexId for AscString {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::String;
+}
+
+impl AscType for AscString {
+    fn to_asc_bytes(&self) -> Result<Vec<u8>, DeterministicHostError> {
+        match self {
+            Self::ApiVersion0_0_4(s) => s.to_asc_bytes(),
+            Self::ApiVersion0_0_5(s) => s.to_asc_bytes(),
+        }
+    }
+
+    fn from_asc_bytes(
+        asc_obj: &[u8],
+        api_version: &Version,
+    ) -> Result<Self, DeterministicHostError> {
+        match api_version {
+            version if *version <= Version::new(0, 0, 4) => Ok(Self::ApiVersion0_0_4(
+                v0_0_4::AscString::from_asc_bytes(asc_obj, api_version)?,
+            )),
+            _ => Ok(Self::ApiVersion0_0_5(v0_0_5::AscString::from_asc_bytes(
+                asc_obj,
+                api_version,
+            )?)),
+        }
+    }
+
+    fn asc_size<H: AscHeap + ?Sized>(
+        ptr: AscPtr<Self>,
+        heap: &H,
+        gas: &GasCounter,
+    ) -> Result<u32, DeterministicHostError> {
+        v0_0_4::AscString::asc_size(AscPtr::new(ptr.wasm_ptr()), heap, gas)
+    }
+
+    fn content_len(&self, asc_bytes: &[u8]) -> usize {
+        match self {
+            Self::ApiVersion0_0_5(s) => s.content_len(asc_bytes),
+            _ => unreachable!("Only called for apiVersion >=0.0.5"),
+        }
+    }
+}
+
+/// Wrapper of Array for multiple AssemblyScript versions.
+/// It just delegates its method calls to the correct mappings apiVersion.
+pub enum Array<T> {
+    ApiVersion0_0_4(v0_0_4::Array<T>),
+    ApiVersion0_0_5(v0_0_5::Array<T>),
+}
+
+impl<T: AscValue> Array<T> {
+    pub fn new<H: AscHeap + ?Sized>(
+        content: &[T],
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<Self, DeterministicHostError> {
+        match heap.api_version() {
+            version if version <= Version::new(0, 0, 4) => Ok(Self::ApiVersion0_0_4(
+                v0_0_4::Array::new(content, heap, gas)?,
+            )),
+            _ => Ok(Self::ApiVersion0_0_5(v0_0_5::Array::new(
+                content, heap, gas,
+            )?)),
+        }
+    }
+
+    pub(crate) fn to_vec<H: AscHeap + ?Sized>(
+        &self,
+        heap: &H,
+        gas: &GasCounter,
+    ) -> Result<Vec<T>, DeterministicHostError> {
+        match self {
+            Self::ApiVersion0_0_4(a) => a.to_vec(heap, gas),
+            Self::ApiVersion0_0_5(a) => a.to_vec(heap, gas),
+        }
+    }
+}
+
+impl<T> AscType for Array<T> {
+    fn to_asc_bytes(&self) -> Result<Vec<u8>, DeterministicHostError> {
+        match self {
+            Self::ApiVersion0_0_4(a) => a.to_asc_bytes(),
+            Self::ApiVersion0_0_5(a) => a.to_asc_bytes(),
+        }
+    }
+
+    fn from_asc_bytes(
+        asc_obj: &[u8],
+        api_version: &Version,
+    ) -> Result<Self, DeterministicHostError> {
+        match api_version {
+            version if *version <= Version::new(0, 0, 4) => Ok(Self::ApiVersion0_0_4(
+                v0_0_4::Array::from_asc_bytes(asc_obj, api_version)?,
+            )),
+            _ => Ok(Self::ApiVersion0_0_5(v0_0_5::Array::from_asc_bytes(
+                asc_obj,
+                api_version,
+            )?)),
+        }
+    }
+}
+
+impl AscIndexId for Array<bool> {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::ArrayBool;
+}
+
+impl AscIndexId for Array<Uint8Array> {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::ArrayUint8Array;
+}
+
+impl AscIndexId for Array<AscPtr<AscEnum<EthereumValueKind>>> {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::ArrayEthereumValue;
+}
+
+impl AscIndexId for Array<AscPtr<AscEnum<StoreValueKind>>> {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::ArrayStoreValue;
+}
+
+impl AscIndexId for Array<AscPtr<AscEnum<JsonValueKind>>> {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::ArrayJsonValue;
+}
+
+impl AscIndexId for Array<AscPtr<AscString>> {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::ArrayString;
+}
+
+impl AscIndexId for Array<AscPtr<AscTypedMapEntry<AscString, AscEnum<JsonValueKind>>>> {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId =
+        IndexForAscTypeId::ArrayTypedMapEntryStringJsonValue;
+}
+
+impl AscIndexId for Array<AscPtr<AscTypedMapEntry<AscString, AscEnum<StoreValueKind>>>> {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId =
+        IndexForAscTypeId::ArrayTypedMapEntryStringStoreValue;
+}
+
+impl AscIndexId for Array<u8> {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::ArrayU8;
+}
+
+impl AscIndexId for Array<u16> {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::ArrayU16;
+}
+
+impl AscIndexId for Array<u32> {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::ArrayU32;
+}
+
+impl AscIndexId for Array<u64> {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::ArrayU64;
+}
+
+impl AscIndexId for Array<i8> {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::ArrayI8;
+}
+
+impl AscIndexId for Array<i16> {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::ArrayI16;
+}
+
+impl AscIndexId for Array<i32> {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::ArrayI32;
+}
+
+impl AscIndexId for Array<i64> {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::ArrayI64;
+}
+
+impl AscIndexId for Array<f32> {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::ArrayF32;
+}
+
+impl AscIndexId for Array<f64> {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::ArrayF64;
+}
+
+impl AscIndexId for Array<AscPtr<AscBigDecimal>> {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::ArrayBigDecimal;
+}
+
+/// Represents any `AscValue` since they all fit in 64 bits.
+#[repr(C)]
+#[derive(Copy, Clone, Default)]
+pub struct EnumPayload(pub u64);
+
+impl AscType for EnumPayload {
+    fn to_asc_bytes(&self) -> Result<Vec<u8>, DeterministicHostError> {
+        self.0.to_asc_bytes()
+    }
+
+    fn from_asc_bytes(
+        asc_obj: &[u8],
+        api_version: &Version,
+    ) -> Result<Self, DeterministicHostError> {
+        Ok(EnumPayload(u64::from_asc_bytes(asc_obj, api_version)?))
+    }
+}
+
+impl From<EnumPayload> for i32 {
+    fn from(payload: EnumPayload) -> i32 {
+        payload.0 as i32
+    }
+}
+
+impl From<EnumPayload> for f64 {
+    fn from(payload: EnumPayload) -> f64 {
+        f64::from_bits(payload.0)
+    }
+}
+
+impl From<EnumPayload> for bool {
+    fn from(payload: EnumPayload) -> bool {
+        payload.0 != 0
+    }
+}
+
+impl From<i32> for EnumPayload {
+    fn from(x: i32) -> EnumPayload {
+        EnumPayload(x as u64)
+    }
+}
+
+impl From<f64> for EnumPayload {
+    fn from(x: f64) -> EnumPayload {
+        EnumPayload(x.to_bits())
+    }
+}
+
+impl From<bool> for EnumPayload {
+    fn from(b: bool) -> EnumPayload {
+        EnumPayload(if b { 1 } else { 0 })
+    }
+}
+
+impl From<i64> for EnumPayload {
+    fn from(x: i64) -> EnumPayload {
+        EnumPayload(x as u64)
+    }
+}
+
+impl<C> From<EnumPayload> for AscPtr<C> {
+    fn from(payload: EnumPayload) -> Self {
+        AscPtr::new(payload.0 as u32)
+    }
+}
+
+impl<C> From<AscPtr<C>> for EnumPayload {
+    fn from(x: AscPtr<C>) -> EnumPayload {
+        EnumPayload(x.wasm_ptr() as u64)
+    }
+}
+
+/// In Asc, we represent a Rust enum as a discriminant `kind: D`, which is an
+/// Asc enum so in Rust it's a `#[repr(u32)]` enum, plus an arbitrary `AscValue`
+/// payload.
+#[repr(C)]
+#[derive(AscType)]
+pub struct AscEnum<D: AscValue> {
+    pub kind: D,
+    pub _padding: u32, // Make padding explicit.
+    pub payload: EnumPayload,
+}
+
+impl AscIndexId for AscEnum<EthereumValueKind> {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::EthereumValue;
+}
+
+impl AscIndexId for AscEnum<StoreValueKind> {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::StoreValue;
+}
+
+impl AscIndexId for AscEnum<JsonValueKind> {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::JsonValue;
+}
+
+pub type AscEnumArray<D> = AscPtr<Array<AscPtr<AscEnum<D>>>>;
+
+#[repr(u32)]
+#[derive(AscType, Copy, Clone)]
+pub enum EthereumValueKind {
+    Address,
+    FixedBytes,
+    Bytes,
+    Int,
+    Uint,
+    Bool,
+    String,
+    FixedArray,
+    Array,
+    Tuple,
+}
+
+impl EthereumValueKind {
+    pub(crate) fn get_kind(token: &ethabi::Token) -> Self {
+        match token {
+            ethabi::Token::Address(_) => EthereumValueKind::Address,
+            ethabi::Token::FixedBytes(_) => EthereumValueKind::FixedBytes,
+            ethabi::Token::Bytes(_) => EthereumValueKind::Bytes,
+            ethabi::Token::Int(_) => EthereumValueKind::Int,
+            ethabi::Token::Uint(_) => EthereumValueKind::Uint,
+            ethabi::Token::Bool(_) => EthereumValueKind::Bool,
+            ethabi::Token::String(_) => EthereumValueKind::String,
+            ethabi::Token::FixedArray(_) => EthereumValueKind::FixedArray,
+            ethabi::Token::Array(_) => EthereumValueKind::Array,
+            ethabi::Token::Tuple(_) => EthereumValueKind::Tuple,
+        }
+    }
+}
+
+impl Default for EthereumValueKind {
+    fn default() -> Self {
+        EthereumValueKind::Address
+    }
+}
+
+impl AscValue for EthereumValueKind {}
+
+#[repr(u32)]
+#[derive(AscType, Copy, Clone)]
+pub enum StoreValueKind {
+    String,
+    Int,
+    BigDecimal,
+    Bool,
+    Array,
+    Null,
+    Bytes,
+    BigInt,
+}
+
+impl StoreValueKind {
+    pub(crate) fn get_kind(value: &store::Value) -> StoreValueKind {
+        use self::store::Value;
+
+        match value {
+            Value::String(_) => StoreValueKind::String,
+            Value::Int(_) => StoreValueKind::Int,
+            Value::BigDecimal(_) => StoreValueKind::BigDecimal,
+            Value::Bool(_) => StoreValueKind::Bool,
+            Value::List(_) => StoreValueKind::Array,
+            Value::Null => StoreValueKind::Null,
+            Value::Bytes(_) => StoreValueKind::Bytes,
+            Value::BigInt(_) => StoreValueKind::BigInt,
+        }
+    }
+}
+
+impl Default for StoreValueKind {
+    fn default() -> Self {
+        StoreValueKind::Null
+    }
+}
+
+impl AscValue for StoreValueKind {}
+
+/// Big ints are represented using signed number representation. Note: This differs
+/// from how U256 and U128 are represented (they use two's complement). So whenever
+/// we convert between them, we need to make sure we handle signed and unsigned
+/// cases correctly.
+pub type AscBigInt = Uint8Array;
+
+pub type AscAddress = Uint8Array;
+pub type AscH160 = Uint8Array;
+
+#[repr(C)]
+#[derive(AscType)]
+pub struct AscTypedMapEntry<K, V> {
+    pub key: AscPtr<K>,
+    pub value: AscPtr<V>,
+}
+
+impl AscIndexId for AscTypedMapEntry<AscString, AscEnum<StoreValueKind>> {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::TypedMapEntryStringStoreValue;
+}
+
+impl AscIndexId for AscTypedMapEntry<AscString, AscEnum<JsonValueKind>> {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::TypedMapEntryStringJsonValue;
+}
+
+pub(crate) type AscTypedMapEntryArray<K, V> = Array<AscPtr<AscTypedMapEntry<K, V>>>;
+
+#[repr(C)]
+#[derive(AscType)]
+pub struct AscTypedMap<K, V> {
+    pub entries: AscPtr<AscTypedMapEntryArray<K, V>>,
+}
+
+impl AscIndexId for AscTypedMap<AscString, AscEnum<StoreValueKind>> {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::TypedMapStringStoreValue;
+}
+
+impl AscIndexId for AscTypedMap<AscString, AscEnum<JsonValueKind>> {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::TypedMapStringJsonValue;
+}
+
+impl AscIndexId for AscTypedMap<AscString, AscTypedMap<AscString, AscEnum<JsonValueKind>>> {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId =
+        IndexForAscTypeId::TypedMapStringTypedMapStringJsonValue;
+}
+
+pub type AscEntity = AscTypedMap<AscString, AscEnum<StoreValueKind>>;
+pub(crate) type AscJson = AscTypedMap<AscString, AscEnum<JsonValueKind>>;
+
+#[repr(u32)]
+#[derive(AscType, Copy, Clone)]
+pub enum JsonValueKind {
+    Null,
+    Bool,
+    Number,
+    String,
+    Array,
+    Object,
+}
+
+impl Default for JsonValueKind {
+    fn default() -> Self {
+        JsonValueKind::Null
+    }
+}
+
+impl AscValue for JsonValueKind {}
+
+impl JsonValueKind {
+    pub(crate) fn get_kind(token: &serde_json::Value) -> Self {
+        use serde_json::Value;
+
+        match token {
+            Value::Null => JsonValueKind::Null,
+            Value::Bool(_) => JsonValueKind::Bool,
+            Value::Number(_) => JsonValueKind::Number,
+            Value::String(_) => JsonValueKind::String,
+            Value::Array(_) => JsonValueKind::Array,
+            Value::Object(_) => JsonValueKind::Object,
+        }
+    }
+}
+
+#[repr(C)]
+#[derive(AscType)]
+pub struct AscBigDecimal {
+    pub digits: AscPtr<AscBigInt>,
+
+    // Decimal exponent. This is the opposite of `scale` in rust BigDecimal.
+    pub exp: AscPtr<AscBigInt>,
+}
+
+impl AscIndexId for AscBigDecimal {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::BigDecimal;
+}
+
+#[repr(u32)]
+pub(crate) enum LogLevel {
+    Critical,
+    Error,
+    Warning,
+    Info,
+    Debug,
+}
+
+impl From<LogLevel> for slog::Level {
+    fn from(level: LogLevel) -> slog::Level {
+        match level {
+            LogLevel::Critical => slog::Level::Critical,
+            LogLevel::Error => slog::Level::Error,
+            LogLevel::Warning => slog::Level::Warning,
+            LogLevel::Info => slog::Level::Info,
+            LogLevel::Debug => slog::Level::Debug,
+        }
+    }
+}
+
+#[repr(C)]
+#[derive(AscType)]
+pub struct AscResult<V: AscValue, E: AscValue> {
+    pub value: AscPtr<AscWrapped<V>>,
+    pub error: AscPtr<AscWrapped<E>>,
+}
+
+impl AscIndexId for AscResult<AscPtr<AscJson>, bool> {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId =
+        IndexForAscTypeId::ResultTypedMapStringJsonValueBool;
+}
+
+impl AscIndexId for AscResult<AscPtr<AscEnum<JsonValueKind>>, bool> {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::ResultJsonValueBool;
+}
+
+#[repr(C)]
+#[derive(AscType, Copy, Clone)]
+pub struct AscWrapped<V: AscValue> {
+    pub inner: V,
+}
+
+impl AscIndexId for AscWrapped<AscPtr<AscJson>> {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::WrappedTypedMapStringJsonValue;
+}
+
+impl AscIndexId for AscWrapped<bool> {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::WrappedBool;
+}
+
+impl AscIndexId for AscWrapped<AscPtr<AscEnum<JsonValueKind>>> {
+    const INDEX_ASC_TYPE_ID: IndexForAscTypeId = IndexForAscTypeId::WrappedJsonValue;
+}
diff --git a/runtime/wasm/src/asc_abi/mod.rs b/runtime/wasm/src/asc_abi/mod.rs
new file mode 100644
index 0000000..4f69f52
--- /dev/null
+++ b/runtime/wasm/src/asc_abi/mod.rs
@@ -0,0 +1,4 @@
+// This unecessary nesting of the module should be resolved by further refactoring.
+pub mod class;
+pub mod v0_0_4;
+pub mod v0_0_5;
diff --git a/runtime/wasm/src/asc_abi/v0_0_4.rs b/runtime/wasm/src/asc_abi/v0_0_4.rs
new file mode 100644
index 0000000..92f14ed
--- /dev/null
+++ b/runtime/wasm/src/asc_abi/v0_0_4.rs
@@ -0,0 +1,330 @@
+use graph::runtime::gas::GasCounter;
+use std::convert::TryInto as _;
+use std::marker::PhantomData;
+use std::mem::{size_of, size_of_val};
+
+use anyhow::anyhow;
+use semver::Version;
+
+use graph::runtime::{AscHeap, AscPtr, AscType, AscValue, DeterministicHostError};
+use graph_runtime_derive::AscType;
+
+use crate::asc_abi::class;
+
+/// Module related to AssemblyScript version v0.6.
+
+/// Asc std ArrayBuffer: "a generic, fixed-length raw binary data buffer".
+/// See https://github.com/AssemblyScript/assemblyscript/wiki/Memory-Layout-&-Management/86447e88be5aa8ec633eaf5fe364651136d136ab#arrays
+pub struct ArrayBuffer {
+    pub byte_length: u32,
+    // Asc allocators always align at 8 bytes, we already have 4 bytes from
+    // `byte_length_size` so with 4 more bytes we align the contents at 8
+    // bytes. No Asc type has alignment greater than 8, so the
+    // elements in `content` will be aligned for any element type.
+    pub padding: [u8; 4],
+    // In Asc this slice is layed out inline with the ArrayBuffer.
+    pub content: Box<[u8]>,
+}
+
+impl ArrayBuffer {
+    pub fn new<T: AscType>(values: &[T]) -> Result<Self, DeterministicHostError> {
+        let mut content = Vec::new();
+        for value in values {
+            let asc_bytes = value.to_asc_bytes()?;
+            // An `AscValue` has size equal to alignment, no padding required.
+            content.extend(&asc_bytes);
+        }
+
+        if content.len() > u32::max_value() as usize {
+            return Err(DeterministicHostError::from(anyhow::anyhow!(
+                "slice cannot fit in WASM memory"
+            )));
+        }
+        Ok(ArrayBuffer {
+            byte_length: content.len() as u32,
+            padding: [0; 4],
+            content: content.into(),
+        })
+    }
+
+    /// Read `length` elements of type `T` starting at `byte_offset`.
+    ///
+    /// Panics if that tries to read beyond the length of `self.content`.
+    pub fn get<T: AscType>(
+        &self,
+        byte_offset: u32,
+        length: u32,
+        api_version: Version,
+    ) -> Result<Vec<T>, DeterministicHostError> {
+        let length = length as usize;
+        let byte_offset = byte_offset as usize;
+
+        self.content[byte_offset..]
+            .chunks(size_of::<T>())
+            .take(length)
+            .map(|asc_obj| T::from_asc_bytes(asc_obj, &api_version))
+            .collect()
+
+        // TODO: This code is preferred as it validates the length of the array.
+        // But, some existing subgraphs were found to break when this was added.
+        // This needs to be root caused
+        /*
+        let range = byte_offset..byte_offset + length * size_of::<T>();
+        self.content
+            .get(range)
+            .ok_or_else(|| {
+                DeterministicHostError::from(anyhow::anyhow!("Attempted to read past end of array"))
+            })?
+            .chunks_exact(size_of::<T>())
+            .map(|bytes| T::from_asc_bytes(bytes))
+            .collect()
+            */
+    }
+}
+
+impl AscType for ArrayBuffer {
+    fn to_asc_bytes(&self) -> Result<Vec<u8>, DeterministicHostError> {
+        let mut asc_layout: Vec<u8> = Vec::new();
+
+        let byte_length: [u8; 4] = self.byte_length.to_le_bytes();
+        asc_layout.extend(&byte_length);
+        asc_layout.extend(&self.padding);
+        asc_layout.extend(self.content.iter());
+
+        // Allocate extra capacity to next power of two, as required by asc.
+        let header_size = size_of_val(&byte_length) + size_of_val(&self.padding);
+        let total_size = self.byte_length as usize + header_size;
+        let total_capacity = total_size.next_power_of_two();
+        let extra_capacity = total_capacity - total_size;
+        asc_layout.extend(std::iter::repeat(0).take(extra_capacity));
+        assert_eq!(asc_layout.len(), total_capacity);
+
+        Ok(asc_layout)
+    }
+
+    /// The Rust representation of an Asc object as layed out in Asc memory.
+    fn from_asc_bytes(
+        asc_obj: &[u8],
+        api_version: &Version,
+    ) -> Result<Self, DeterministicHostError> {
+        // Skip `byte_length` and the padding.
+        let content_offset = size_of::<u32>() + 4;
+        let byte_length = asc_obj.get(..size_of::<u32>()).ok_or_else(|| {
+            DeterministicHostError::from(anyhow!("Attempted to read past end of array"))
+        })?;
+        let content = asc_obj.get(content_offset..).ok_or_else(|| {
+            DeterministicHostError::from(anyhow!("Attempted to read past end of array"))
+        })?;
+        Ok(ArrayBuffer {
+            byte_length: u32::from_asc_bytes(&byte_length, api_version)?,
+            padding: [0; 4],
+            content: content.to_vec().into(),
+        })
+    }
+
+    fn asc_size<H: AscHeap + ?Sized>(
+        ptr: AscPtr<Self>,
+        heap: &H,
+        gas: &GasCounter,
+    ) -> Result<u32, DeterministicHostError> {
+        let byte_length = ptr.read_u32(heap, gas)?;
+        let byte_length_size = size_of::<u32>() as u32;
+        let padding_size = size_of::<u32>() as u32;
+        Ok(byte_length_size + padding_size + byte_length)
+    }
+}
+
+/// A typed, indexable view of an `ArrayBuffer` of Asc primitives. In Asc it's
+/// an abstract class with subclasses for each primitive, for example
+/// `Uint8Array` is `TypedArray<u8>`.
+///  See https://github.com/AssemblyScript/assemblyscript/wiki/Memory-Layout-&-Management/86447e88be5aa8ec633eaf5fe364651136d136ab#arrays
+#[repr(C)]
+#[derive(AscType)]
+pub struct TypedArray<T> {
+    pub buffer: AscPtr<ArrayBuffer>,
+    /// Byte position in `buffer` of the array start.
+    byte_offset: u32,
+    byte_length: u32,
+    ty: PhantomData<T>,
+}
+
+impl<T: AscValue> TypedArray<T> {
+    pub(crate) fn new<H: AscHeap + ?Sized>(
+        content: &[T],
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<Self, DeterministicHostError> {
+        let buffer = class::ArrayBuffer::new(content, heap.api_version())?;
+        let buffer_byte_length = if let class::ArrayBuffer::ApiVersion0_0_4(ref a) = buffer {
+            a.byte_length
+        } else {
+            unreachable!("Only the correct ArrayBuffer will be constructed")
+        };
+        let ptr = AscPtr::alloc_obj(buffer, heap, gas)?;
+        Ok(TypedArray {
+            byte_length: buffer_byte_length,
+            buffer: AscPtr::new(ptr.wasm_ptr()),
+            byte_offset: 0,
+            ty: PhantomData,
+        })
+    }
+
+    pub(crate) fn to_vec<H: AscHeap + ?Sized>(
+        &self,
+        heap: &H,
+        gas: &GasCounter,
+    ) -> Result<Vec<T>, DeterministicHostError> {
+        self.buffer.read_ptr(heap, gas)?.get(
+            self.byte_offset,
+            self.byte_length / size_of::<T>() as u32,
+            heap.api_version(),
+        )
+    }
+}
+
+/// Asc std string: "Strings are encoded as UTF-16LE in AssemblyScript, and are
+/// prefixed with their length (in character codes) as a 32-bit integer". See
+/// https://github.com/AssemblyScript/assemblyscript/wiki/Memory-Layout-&-Management/86447e88be5aa8ec633eaf5fe364651136d136ab#arrays
+pub struct AscString {
+    // In number of UTF-16 code units (2 bytes each).
+    length: u32,
+    // The sequence of UTF-16LE code units that form the string.
+    pub content: Box<[u16]>,
+}
+
+impl AscString {
+    pub fn new(content: &[u16]) -> Result<Self, DeterministicHostError> {
+        if size_of_val(content) > u32::max_value() as usize {
+            return Err(DeterministicHostError::from(anyhow!(
+                "string cannot fit in WASM memory"
+            )));
+        }
+
+        Ok(AscString {
+            length: content.len() as u32,
+            content: content.into(),
+        })
+    }
+}
+
+impl AscType for AscString {
+    fn to_asc_bytes(&self) -> Result<Vec<u8>, DeterministicHostError> {
+        let mut asc_layout: Vec<u8> = Vec::new();
+
+        let length: [u8; 4] = self.length.to_le_bytes();
+        asc_layout.extend(&length);
+
+        // Write the code points, in little-endian (LE) order.
+        for &code_unit in self.content.iter() {
+            let low_byte = code_unit as u8;
+            let high_byte = (code_unit >> 8) as u8;
+            asc_layout.push(low_byte);
+            asc_layout.push(high_byte);
+        }
+
+        Ok(asc_layout)
+    }
+
+    /// The Rust representation of an Asc object as layed out in Asc memory.
+    fn from_asc_bytes(
+        asc_obj: &[u8],
+        _api_version: &Version,
+    ) -> Result<Self, DeterministicHostError> {
+        // Pointer for our current position within `asc_obj`,
+        // initially at the start of the content skipping `length`.
+        let mut offset = size_of::<i32>();
+
+        let length = asc_obj
+            .get(..offset)
+            .ok_or(DeterministicHostError::from(anyhow::anyhow!(
+                "String bytes not long enough to contain length"
+            )))?;
+
+        // Does not panic - already validated slice length == size_of::<i32>.
+        let length = i32::from_le_bytes(length.try_into().unwrap());
+        if length.checked_mul(2).and_then(|l| l.checked_add(4)) != asc_obj.len().try_into().ok() {
+            return Err(DeterministicHostError::from(anyhow::anyhow!(
+                "String length header does not equal byte length"
+            )));
+        }
+
+        // Prevents panic when accessing offset + 1 in the loop
+        if asc_obj.len() % 2 != 0 {
+            return Err(DeterministicHostError::from(anyhow::anyhow!(
+                "Invalid string length"
+            )));
+        }
+
+        // UTF-16 (used in assemblyscript) always uses one
+        // pair of bytes per code unit.
+        // https://mathiasbynens.be/notes/javascript-encoding
+        // UTF-16 (16-bit Unicode Transformation Format) is an
+        // extension of UCS-2 that allows representing code points
+        // outside the BMP. It produces a variable-length result
+        // of either one or two 16-bit code units per code point.
+        // This way, it can encode code points in the range from 0
+        // to 0x10FFFF.
+
+        // Read the content.
+        let mut content = Vec::new();
+        while offset < asc_obj.len() {
+            let code_point_bytes = [asc_obj[offset], asc_obj[offset + 1]];
+            let code_point = u16::from_le_bytes(code_point_bytes);
+            content.push(code_point);
+            offset += size_of::<u16>();
+        }
+        AscString::new(&content)
+    }
+
+    fn asc_size<H: AscHeap + ?Sized>(
+        ptr: AscPtr<Self>,
+        heap: &H,
+        gas: &GasCounter,
+    ) -> Result<u32, DeterministicHostError> {
+        let length = ptr.read_u32(heap, gas)?;
+        let length_size = size_of::<u32>() as u32;
+        let code_point_size = size_of::<u16>() as u32;
+        let data_size = code_point_size.checked_mul(length);
+        let total_size = data_size.and_then(|d| d.checked_add(length_size));
+        total_size.ok_or_else(|| {
+            DeterministicHostError::from(anyhow::anyhow!("Overflowed when getting size of string"))
+        })
+    }
+}
+
+/// Growable array backed by an `ArrayBuffer`.
+/// See https://github.com/AssemblyScript/assemblyscript/wiki/Memory-Layout-&-Management/86447e88be5aa8ec633eaf5fe364651136d136ab#arrays
+#[repr(C)]
+#[derive(AscType)]
+pub struct Array<T> {
+    buffer: AscPtr<ArrayBuffer>,
+    length: u32,
+    ty: PhantomData<T>,
+}
+
+impl<T: AscValue> Array<T> {
+    pub fn new<H: AscHeap + ?Sized>(
+        content: &[T],
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<Self, DeterministicHostError> {
+        let arr_buffer = class::ArrayBuffer::new(content, heap.api_version())?;
+        let arr_buffer_ptr = AscPtr::alloc_obj(arr_buffer, heap, gas)?;
+        Ok(Array {
+            buffer: AscPtr::new(arr_buffer_ptr.wasm_ptr()),
+            // If this cast would overflow, the above line has already panicked.
+            length: content.len() as u32,
+            ty: PhantomData,
+        })
+    }
+
+    pub(crate) fn to_vec<H: AscHeap + ?Sized>(
+        &self,
+        heap: &H,
+        gas: &GasCounter,
+    ) -> Result<Vec<T>, DeterministicHostError> {
+        self.buffer
+            .read_ptr(heap, gas)?
+            .get(0, self.length, heap.api_version())
+    }
+}
diff --git a/runtime/wasm/src/asc_abi/v0_0_5.rs b/runtime/wasm/src/asc_abi/v0_0_5.rs
new file mode 100644
index 0000000..31503af
--- /dev/null
+++ b/runtime/wasm/src/asc_abi/v0_0_5.rs
@@ -0,0 +1,313 @@
+use std::marker::PhantomData;
+use std::mem::{size_of, size_of_val};
+
+use anyhow::anyhow;
+use semver::Version;
+
+use graph::runtime::gas::GasCounter;
+use graph::runtime::{AscHeap, AscPtr, AscType, AscValue, DeterministicHostError, HEADER_SIZE};
+use graph_runtime_derive::AscType;
+
+use crate::asc_abi::class;
+
+/// Module related to AssemblyScript version >=v0.19.2.
+/// All `to_asc_bytes`/`from_asc_bytes` only consider the #data/content/payload
+/// not the #header, that's handled on `AscPtr`.
+/// Header in question: https://www.assemblyscript.org/memory.html#common-header-layout
+
+/// Similar as JS ArrayBuffer, "a generic, fixed-length raw binary data buffer".
+/// See https://www.assemblyscript.org/memory.html#arraybuffer-layout
+pub struct ArrayBuffer {
+    // Not included in memory layout
+    pub byte_length: u32,
+    // #data
+    pub content: Box<[u8]>,
+}
+
+impl ArrayBuffer {
+    pub fn new<T: AscType>(values: &[T]) -> Result<Self, DeterministicHostError> {
+        let mut content = Vec::new();
+        for value in values {
+            let asc_bytes = value.to_asc_bytes()?;
+            content.extend(&asc_bytes);
+        }
+
+        if content.len() > u32::max_value() as usize {
+            return Err(DeterministicHostError::from(anyhow::anyhow!(
+                "slice cannot fit in WASM memory"
+            )));
+        }
+        Ok(ArrayBuffer {
+            byte_length: content.len() as u32,
+            content: content.into(),
+        })
+    }
+
+    /// Read `length` elements of type `T` starting at `byte_offset`.
+    ///
+    /// Panics if that tries to read beyond the length of `self.content`.
+    pub fn get<T: AscType>(
+        &self,
+        byte_offset: u32,
+        length: u32,
+        api_version: Version,
+    ) -> Result<Vec<T>, DeterministicHostError> {
+        let length = length as usize;
+        let byte_offset = byte_offset as usize;
+
+        self.content[byte_offset..]
+            .chunks(size_of::<T>())
+            .take(length)
+            .map(|asc_obj| T::from_asc_bytes(asc_obj, &api_version))
+            .collect()
+    }
+}
+
+impl AscType for ArrayBuffer {
+    fn to_asc_bytes(&self) -> Result<Vec<u8>, DeterministicHostError> {
+        let mut asc_layout: Vec<u8> = Vec::new();
+
+        asc_layout.extend(self.content.iter());
+
+        // Allocate extra capacity to next power of two, as required by asc.
+        let total_size = self.byte_length as usize + HEADER_SIZE;
+        let total_capacity = total_size.next_power_of_two();
+        let extra_capacity = total_capacity - total_size;
+        asc_layout.extend(std::iter::repeat(0).take(extra_capacity));
+
+        Ok(asc_layout)
+    }
+
+    fn from_asc_bytes(
+        asc_obj: &[u8],
+        _api_version: &Version,
+    ) -> Result<Self, DeterministicHostError> {
+        Ok(ArrayBuffer {
+            byte_length: asc_obj.len() as u32,
+            content: asc_obj.to_vec().into(),
+        })
+    }
+
+    fn content_len(&self, _asc_bytes: &[u8]) -> usize {
+        self.byte_length as usize // without extra_capacity
+    }
+}
+
+/// A typed, indexable view of an `ArrayBuffer` of Asc primitives. In Asc it's
+/// an abstract class with subclasses for each primitive, for example
+/// `Uint8Array` is `TypedArray<u8>`.
+/// Also known as `ArrayBufferView`.
+/// See https://www.assemblyscript.org/memory.html#arraybufferview-layout
+#[repr(C)]
+#[derive(AscType)]
+pub struct TypedArray<T> {
+    // #data -> Backing buffer reference
+    pub buffer: AscPtr<ArrayBuffer>,
+    // #dataStart -> Start within the #data
+    data_start: u32,
+    // #dataLength -> Length of the data from #dataStart
+    byte_length: u32,
+    // Not included in memory layout, it's just for typings
+    ty: PhantomData<T>,
+}
+
+impl<T: AscValue> TypedArray<T> {
+    pub(crate) fn new<H: AscHeap + ?Sized>(
+        content: &[T],
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<Self, DeterministicHostError> {
+        let buffer = class::ArrayBuffer::new(content, heap.api_version())?;
+        let byte_length = content.len() as u32;
+        let ptr = AscPtr::alloc_obj(buffer, heap, gas)?;
+        Ok(TypedArray {
+            buffer: AscPtr::new(ptr.wasm_ptr()), // new AscPtr necessary to convert type parameter
+            data_start: ptr.wasm_ptr(),
+            byte_length,
+            ty: PhantomData,
+        })
+    }
+
+    pub(crate) fn to_vec<H: AscHeap + ?Sized>(
+        &self,
+        heap: &H,
+        gas: &GasCounter,
+    ) -> Result<Vec<T>, DeterministicHostError> {
+        // We're trying to read the pointer below, we should check it's
+        // not null before using it.
+        self.buffer.check_is_not_null()?;
+
+        // This subtraction is needed because on the ArrayBufferView memory layout
+        // there are two pointers to the data.
+        // - The first (self.buffer) points to the related ArrayBuffer.
+        // - The second (self.data_start) points to where in this ArrayBuffer the data starts.
+        // So this is basically getting the offset.
+        // Related docs: https://www.assemblyscript.org/memory.html#arraybufferview-layout
+        let data_start_with_offset = self
+            .data_start
+            .checked_sub(self.buffer.wasm_ptr())
+            .ok_or_else(|| {
+                DeterministicHostError::from(anyhow::anyhow!(
+                    "Subtract overflow on pointer: {}",
+                    self.data_start
+                ))
+            })?;
+
+        self.buffer.read_ptr(heap, gas)?.get(
+            data_start_with_offset,
+            self.byte_length / size_of::<T>() as u32,
+            heap.api_version(),
+        )
+    }
+}
+
+/// Asc std string: "Strings are encoded as UTF-16LE in AssemblyScript"
+/// See https://www.assemblyscript.org/memory.html#string-layout
+pub struct AscString {
+    // Not included in memory layout
+    // In number of UTF-16 code units (2 bytes each).
+    byte_length: u32,
+    // #data
+    // The sequence of UTF-16LE code units that form the string.
+    pub content: Box<[u16]>,
+}
+
+impl AscString {
+    pub fn new(content: &[u16]) -> Result<Self, DeterministicHostError> {
+        if size_of_val(content) > u32::max_value() as usize {
+            return Err(DeterministicHostError::from(anyhow!(
+                "string cannot fit in WASM memory"
+            )));
+        }
+
+        Ok(AscString {
+            byte_length: content.len() as u32,
+            content: content.into(),
+        })
+    }
+}
+
+impl AscType for AscString {
+    fn to_asc_bytes(&self) -> Result<Vec<u8>, DeterministicHostError> {
+        let mut content: Vec<u8> = Vec::new();
+
+        // Write the code points, in little-endian (LE) order.
+        for &code_unit in self.content.iter() {
+            let low_byte = code_unit as u8;
+            let high_byte = (code_unit >> 8) as u8;
+            content.push(low_byte);
+            content.push(high_byte);
+        }
+
+        let header_size = 20;
+        let total_size = (self.byte_length as usize * 2) + header_size;
+        let total_capacity = total_size.next_power_of_two();
+        let extra_capacity = total_capacity - total_size;
+        content.extend(std::iter::repeat(0).take(extra_capacity));
+
+        Ok(content)
+    }
+
+    /// The Rust representation of an Asc object as layed out in Asc memory.
+    fn from_asc_bytes(
+        asc_obj: &[u8],
+        _api_version: &Version,
+    ) -> Result<Self, DeterministicHostError> {
+        // UTF-16 (used in assemblyscript) always uses one
+        // pair of bytes per code unit.
+        // https://mathiasbynens.be/notes/javascript-encoding
+        // UTF-16 (16-bit Unicode Transformation Format) is an
+        // extension of UCS-2 that allows representing code points
+        // outside the BMP. It produces a variable-length result
+        // of either one or two 16-bit code units per code point.
+        // This way, it can encode code points in the range from 0
+        // to 0x10FFFF.
+
+        let mut content = Vec::new();
+        for pair in asc_obj.chunks(2) {
+            let code_point_bytes = [
+                pair[0],
+                *pair.get(1).ok_or_else(|| {
+                    DeterministicHostError::from(anyhow!(
+                        "Attempted to read past end of string content bytes chunk"
+                    ))
+                })?,
+            ];
+            let code_point = u16::from_le_bytes(code_point_bytes);
+            content.push(code_point);
+        }
+        AscString::new(&content)
+    }
+
+    fn content_len(&self, _asc_bytes: &[u8]) -> usize {
+        self.byte_length as usize * 2 // without extra_capacity, and times 2 because the content is measured in u8s
+    }
+}
+
+/// Growable array backed by an `ArrayBuffer`.
+/// See https://www.assemblyscript.org/memory.html#array-layout
+#[repr(C)]
+#[derive(AscType)]
+pub struct Array<T> {
+    // #data -> Backing buffer reference
+    buffer: AscPtr<ArrayBuffer>,
+    // #dataStart -> Start of the data within #data
+    buffer_data_start: u32,
+    // #dataLength -> Length of the data from #dataStart
+    buffer_data_length: u32,
+    // #length -> Mutable length of the data the user is interested in
+    length: i32,
+    // Not included in memory layout, it's just for typings
+    ty: PhantomData<T>,
+}
+
+impl<T: AscValue> Array<T> {
+    pub fn new<H: AscHeap + ?Sized>(
+        content: &[T],
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<Self, DeterministicHostError> {
+        let arr_buffer = class::ArrayBuffer::new(content, heap.api_version())?;
+        let buffer = AscPtr::alloc_obj(arr_buffer, heap, gas)?;
+        let buffer_data_length = buffer.read_len(heap, gas)?;
+        Ok(Array {
+            buffer: AscPtr::new(buffer.wasm_ptr()),
+            buffer_data_start: buffer.wasm_ptr(),
+            buffer_data_length,
+            length: content.len() as i32,
+            ty: PhantomData,
+        })
+    }
+
+    pub(crate) fn to_vec<H: AscHeap + ?Sized>(
+        &self,
+        heap: &H,
+        gas: &GasCounter,
+    ) -> Result<Vec<T>, DeterministicHostError> {
+        // We're trying to read the pointer below, we should check it's
+        // not null before using it.
+        self.buffer.check_is_not_null()?;
+
+        // This subtraction is needed because on the ArrayBufferView memory layout
+        // there are two pointers to the data.
+        // - The first (self.buffer) points to the related ArrayBuffer.
+        // - The second (self.buffer_data_start) points to where in this ArrayBuffer the data starts.
+        // So this is basically getting the offset.
+        // Related docs: https://www.assemblyscript.org/memory.html#arraybufferview-layout
+        let buffer_data_start_with_offset = self
+            .buffer_data_start
+            .checked_sub(self.buffer.wasm_ptr())
+            .ok_or_else(|| {
+                DeterministicHostError::from(anyhow::anyhow!(
+                    "Subtract overflow on pointer: {}",
+                    self.buffer_data_start
+                ))
+            })?;
+
+        self.buffer.read_ptr(heap, gas)?.get(
+            buffer_data_start_with_offset,
+            self.length as u32,
+            heap.api_version(),
+        )
+    }
+}
diff --git a/runtime/wasm/src/error.rs b/runtime/wasm/src/error.rs
new file mode 100644
index 0000000..e3852b3
--- /dev/null
+++ b/runtime/wasm/src/error.rs
@@ -0,0 +1,33 @@
+use wasmtime::Trap;
+
+use graph::runtime::DeterministicHostError;
+
+use crate::module::IntoTrap;
+
+pub enum DeterminismLevel {
+    /// This error is known to be deterministic. For example, divide by zero.
+    /// TODO: For these errors, a further designation should be created about the contents
+    /// of the actual message.
+    Deterministic,
+
+    /// This error is known to be non-deterministic. For example, an intermittent http failure.
+    #[allow(dead_code)]
+    NonDeterministic,
+
+    /// The runtime is processing a given block, but there is an indication that the blockchain client
+    /// might not consider that block to be on the main chain. So the block must be reprocessed.
+    PossibleReorg,
+
+    /// An error has not yet been designated as deterministic or not. This should be phased out over time,
+    /// and is the default for errors like anyhow which are of an unknown origin.
+    Unimplemented,
+}
+
+impl IntoTrap for DeterministicHostError {
+    fn determinism_level(&self) -> DeterminismLevel {
+        DeterminismLevel::Deterministic
+    }
+    fn into_trap(self) -> Trap {
+        Trap::from(self.inner())
+    }
+}
diff --git a/runtime/wasm/src/gas_rules.rs b/runtime/wasm/src/gas_rules.rs
new file mode 100644
index 0000000..10717f9
--- /dev/null
+++ b/runtime/wasm/src/gas_rules.rs
@@ -0,0 +1,168 @@
+use std::{convert::TryInto, num::NonZeroU32};
+
+use graph::runtime::gas::CONST_MAX_GAS_PER_HANDLER;
+use parity_wasm::elements::Instruction;
+use wasm_instrument::gas_metering::{MemoryGrowCost, Rules};
+
+pub const GAS_COST_STORE: u32 = 2263;
+pub const GAS_COST_LOAD: u32 = 1573;
+
+pub struct GasRules;
+
+impl Rules for GasRules {
+    fn instruction_cost(&self, instruction: &Instruction) -> Option<u32> {
+        use Instruction::*;
+        let weight = match instruction {
+            // These are taken from this post: https://github.com/paritytech/substrate/pull/7361#issue-506217103
+            // from the table under the "Schedule" dropdown. Each decimal is multiplied by 10.
+            // Note that those were calculated for wasi, not wasmtime, so they are likely very conservative.
+            I64Const(_) => 16,
+            I64Load(_, _) => GAS_COST_LOAD,
+            I64Store(_, _) => GAS_COST_STORE,
+            Select => 61,
+            Instruction::If(_) => 79,
+            Br(_) => 30,
+            BrIf(_) => 63,
+            BrTable(data) => 146 + data.table.len() as u32,
+            Call(_) => 951,
+            // TODO: To figure out the param cost we need to look up the function
+            CallIndirect(_, _) => 1995,
+            GetLocal(_) => 18,
+            SetLocal(_) => 21,
+            TeeLocal(_) => 21,
+            GetGlobal(_) => 66,
+            SetGlobal(_) => 107,
+            CurrentMemory(_) => 23,
+            GrowMemory(_) => 435000,
+            I64Clz => 23,
+            I64Ctz => 23,
+            I64Popcnt => 29,
+            I64Eqz => 24,
+            I64ExtendSI32 => 22,
+            I64ExtendUI32 => 22,
+            I32WrapI64 => 23,
+            I64Eq => 26,
+            I64Ne => 25,
+            I64LtS => 25,
+            I64LtU => 26,
+            I64GtS => 25,
+            I64GtU => 25,
+            I64LeS => 25,
+            I64LeU => 26,
+            I64GeS => 26,
+            I64GeU => 25,
+            I64Add => 25,
+            I64Sub => 26,
+            I64Mul => 25,
+            I64DivS => 82,
+            I64DivU => 72,
+            I64RemS => 81,
+            I64RemU => 73,
+            I64And => 25,
+            I64Or => 25,
+            I64Xor => 26,
+            I64Shl => 25,
+            I64ShrS => 26,
+            I64ShrU => 26,
+            I64Rotl => 25,
+            I64Rotr => 26,
+
+            // These are similar enough to something above so just referencing a similar
+            // instruction
+            I32Load(_, _)
+            | F32Load(_, _)
+            | F64Load(_, _)
+            | I32Load8S(_, _)
+            | I32Load8U(_, _)
+            | I32Load16S(_, _)
+            | I32Load16U(_, _)
+            | I64Load8S(_, _)
+            | I64Load8U(_, _)
+            | I64Load16S(_, _)
+            | I64Load16U(_, _)
+            | I64Load32S(_, _)
+            | I64Load32U(_, _) => GAS_COST_LOAD,
+
+            I32Store(_, _)
+            | F32Store(_, _)
+            | F64Store(_, _)
+            | I32Store8(_, _)
+            | I32Store16(_, _)
+            | I64Store8(_, _)
+            | I64Store16(_, _)
+            | I64Store32(_, _) => GAS_COST_STORE,
+
+            I32Const(_) | F32Const(_) | F64Const(_) => 16,
+            I32Eqz => 26,
+            I32Eq => 26,
+            I32Ne => 25,
+            I32LtS => 25,
+            I32LtU => 26,
+            I32GtS => 25,
+            I32GtU => 25,
+            I32LeS => 25,
+            I32LeU => 26,
+            I32GeS => 26,
+            I32GeU => 25,
+            I32Add => 25,
+            I32Sub => 26,
+            I32Mul => 25,
+            I32DivS => 82,
+            I32DivU => 72,
+            I32RemS => 81,
+            I32RemU => 73,
+            I32And => 25,
+            I32Or => 25,
+            I32Xor => 26,
+            I32Shl => 25,
+            I32ShrS => 26,
+            I32ShrU => 26,
+            I32Rotl => 25,
+            I32Rotr => 26,
+            I32Clz => 23,
+            I32Popcnt => 29,
+            I32Ctz => 23,
+
+            // Float weights not calculated by reference source material. Making up
+            // some conservative values. The point here is not to be perfect but just
+            // to have some reasonable upper bound.
+            F64ReinterpretI64 | F32ReinterpretI32 | F64PromoteF32 | F64ConvertUI64
+            | F64ConvertSI64 | F64ConvertUI32 | F64ConvertSI32 | F32DemoteF64 | F32ConvertUI64
+            | F32ConvertSI64 | F32ConvertUI32 | F32ConvertSI32 | I64TruncUF64 | I64TruncSF64
+            | I64TruncUF32 | I64TruncSF32 | I32TruncUF64 | I32TruncSF64 | I32TruncUF32
+            | I32TruncSF32 | F64Copysign | F64Max | F64Min | F64Mul | F64Sub | F64Add
+            | F64Trunc | F64Floor | F64Ceil | F64Neg | F64Abs | F64Nearest | F32Copysign
+            | F32Max | F32Min | F32Mul | F32Sub | F32Add | F32Nearest | F32Trunc | F32Floor
+            | F32Ceil | F32Neg | F32Abs | F32Eq | F32Ne | F32Lt | F32Gt | F32Le | F32Ge | F64Eq
+            | F64Ne | F64Lt | F64Gt | F64Le | F64Ge | I32ReinterpretF32 | I64ReinterpretF64 => 100,
+            F64Div | F64Sqrt | F32Div | F32Sqrt => 100,
+
+            // More invented weights
+            Block(_) => 100,
+            Loop(_) => 100,
+            Else => 100,
+            End => 100,
+            Return => 100,
+            Drop => 100,
+            SignExt(_) => 100,
+            Nop => 1,
+            Unreachable => 1,
+        };
+        Some(weight)
+    }
+
+    fn memory_grow_cost(&self) -> MemoryGrowCost {
+        // Each page is 64KiB which is 65536 bytes.
+        const PAGE: u64 = 64 * 1024;
+        // 1 GB
+        const GIB: u64 = 1073741824;
+        // 12GiB to pages for the max memory allocation
+        // In practice this will never be hit unless we also
+        // free pages because this is 32bit WASM.
+        const MAX_PAGES: u64 = 12 * GIB / PAGE;
+        let gas_per_page =
+            NonZeroU32::new((CONST_MAX_GAS_PER_HANDLER / MAX_PAGES).try_into().unwrap()).unwrap();
+
+        MemoryGrowCost::Linear(gas_per_page)
+    }
+}
diff --git a/runtime/wasm/src/host.rs b/runtime/wasm/src/host.rs
new file mode 100644
index 0000000..e6423a5
--- /dev/null
+++ b/runtime/wasm/src/host.rs
@@ -0,0 +1,263 @@
+use std::cmp::PartialEq;
+use std::time::Instant;
+
+use async_trait::async_trait;
+use futures::sync::mpsc::Sender;
+use futures03::channel::oneshot::channel;
+
+use graph::blockchain::{Blockchain, HostFn, RuntimeAdapter};
+use graph::components::store::{EnsLookup, SubgraphFork};
+use graph::components::subgraph::{MappingError, SharedProofOfIndexing};
+use graph::data_source::{
+    DataSource, DataSourceTemplate, MappingTrigger, TriggerData, TriggerWithHandler,
+};
+use graph::prelude::{
+    RuntimeHost as RuntimeHostTrait, RuntimeHostBuilder as RuntimeHostBuilderTrait, *,
+};
+
+use crate::mapping::{MappingContext, MappingRequest};
+use crate::module::ToAscPtr;
+use crate::{host_exports::HostExports, module::ExperimentalFeatures};
+use graph::runtime::gas::Gas;
+
+pub struct RuntimeHostBuilder<C: Blockchain> {
+    runtime_adapter: Arc<dyn RuntimeAdapter<C>>,
+    link_resolver: Arc<dyn LinkResolver>,
+    ens_lookup: Arc<dyn EnsLookup>,
+}
+
+impl<C: Blockchain> Clone for RuntimeHostBuilder<C> {
+    fn clone(&self) -> Self {
+        RuntimeHostBuilder {
+            runtime_adapter: self.runtime_adapter.cheap_clone(),
+            link_resolver: self.link_resolver.cheap_clone(),
+            ens_lookup: self.ens_lookup.cheap_clone(),
+        }
+    }
+}
+
+impl<C: Blockchain> RuntimeHostBuilder<C> {
+    pub fn new(
+        runtime_adapter: Arc<dyn RuntimeAdapter<C>>,
+        link_resolver: Arc<dyn LinkResolver>,
+        ens_lookup: Arc<dyn EnsLookup>,
+    ) -> Self {
+        RuntimeHostBuilder {
+            runtime_adapter,
+            link_resolver,
+            ens_lookup,
+        }
+    }
+}
+
+impl<C: Blockchain> RuntimeHostBuilderTrait<C> for RuntimeHostBuilder<C>
+where
+    <C as Blockchain>::MappingTrigger: ToAscPtr,
+{
+    type Host = RuntimeHost<C>;
+    type Req = MappingRequest<C>;
+
+    fn spawn_mapping(
+        raw_module: &[u8],
+        logger: Logger,
+        subgraph_id: DeploymentHash,
+        metrics: Arc<HostMetrics>,
+    ) -> Result<Sender<Self::Req>, Error> {
+        let experimental_features = ExperimentalFeatures {
+            allow_non_deterministic_ipfs: ENV_VARS.mappings.allow_non_deterministic_ipfs,
+        };
+        crate::mapping::spawn_module(
+            raw_module,
+            logger,
+            subgraph_id,
+            metrics,
+            tokio::runtime::Handle::current(),
+            ENV_VARS.mappings.timeout,
+            experimental_features,
+        )
+    }
+
+    fn build(
+        &self,
+        network_name: String,
+        subgraph_id: DeploymentHash,
+        data_source: DataSource<C>,
+        templates: Arc<Vec<DataSourceTemplate<C>>>,
+        mapping_request_sender: Sender<MappingRequest<C>>,
+        metrics: Arc<HostMetrics>,
+    ) -> Result<Self::Host, Error> {
+        RuntimeHost::new(
+            self.runtime_adapter.cheap_clone(),
+            self.link_resolver.clone(),
+            network_name,
+            subgraph_id,
+            data_source,
+            templates,
+            mapping_request_sender,
+            metrics,
+            self.ens_lookup.cheap_clone(),
+        )
+    }
+}
+
+pub struct RuntimeHost<C: Blockchain> {
+    host_fns: Arc<Vec<HostFn>>,
+    data_source: DataSource<C>,
+    mapping_request_sender: Sender<MappingRequest<C>>,
+    host_exports: Arc<HostExports<C>>,
+    metrics: Arc<HostMetrics>,
+}
+
+impl<C> RuntimeHost<C>
+where
+    C: Blockchain,
+{
+    fn new(
+        runtime_adapter: Arc<dyn RuntimeAdapter<C>>,
+        link_resolver: Arc<dyn LinkResolver>,
+        network_name: String,
+        subgraph_id: DeploymentHash,
+        data_source: DataSource<C>,
+        templates: Arc<Vec<DataSourceTemplate<C>>>,
+        mapping_request_sender: Sender<MappingRequest<C>>,
+        metrics: Arc<HostMetrics>,
+        ens_lookup: Arc<dyn EnsLookup>,
+    ) -> Result<Self, Error> {
+        // Create new instance of externally hosted functions invoker. The `Arc` is simply to avoid
+        // implementing `Clone` for `HostExports`.
+        let host_exports = Arc::new(HostExports::new(
+            subgraph_id,
+            &data_source,
+            network_name,
+            templates,
+            link_resolver,
+            ens_lookup,
+        ));
+
+        let host_fns = data_source
+            .as_onchain()
+            .map(|ds| runtime_adapter.host_fns(ds))
+            .transpose()?
+            .unwrap_or_default();
+
+        Ok(RuntimeHost {
+            host_fns: Arc::new(host_fns),
+            data_source,
+            mapping_request_sender,
+            host_exports,
+            metrics,
+        })
+    }
+
+    /// Sends a MappingRequest to the thread which owns the host,
+    /// and awaits the result.
+    async fn send_mapping_request(
+        &self,
+        logger: &Logger,
+        state: BlockState<C>,
+        trigger: TriggerWithHandler<MappingTrigger<C>>,
+        block_ptr: BlockPtr,
+        proof_of_indexing: SharedProofOfIndexing,
+        debug_fork: &Option<Arc<dyn SubgraphFork>>,
+    ) -> Result<BlockState<C>, MappingError> {
+        let handler = trigger.handler_name().to_string();
+
+        let extras = trigger.logging_extras();
+        trace!(
+            logger, "Start processing trigger";
+            &extras,
+            "handler" => &handler,
+            "data_source" => &self.data_source.name(),
+        );
+
+        let (result_sender, result_receiver) = channel();
+        let start_time = Instant::now();
+        let metrics = self.metrics.clone();
+
+        self.mapping_request_sender
+            .clone()
+            .send(MappingRequest {
+                ctx: MappingContext {
+                    logger: logger.cheap_clone(),
+                    state,
+                    host_exports: self.host_exports.cheap_clone(),
+                    block_ptr,
+                    proof_of_indexing,
+                    host_fns: self.host_fns.cheap_clone(),
+                    debug_fork: debug_fork.cheap_clone(),
+                },
+                trigger,
+                result_sender,
+            })
+            .compat()
+            .await
+            .context("Mapping terminated before passing in trigger")?;
+
+        let result = result_receiver
+            .await
+            .context("Mapping terminated before handling trigger")?;
+
+        let elapsed = start_time.elapsed();
+        metrics.observe_handler_execution_time(elapsed.as_secs_f64(), &handler);
+
+        // If there is an error, "gas_used" is incorrectly reported as 0.
+        let gas_used = result.as_ref().map(|(_, gas)| gas).unwrap_or(&Gas::ZERO);
+        info!(
+            logger, "Done processing trigger";
+            &extras,
+            "total_ms" => elapsed.as_millis(),
+            "handler" => handler,
+            "data_source" => &self.data_source.name(),
+            "gas_used" => gas_used.to_string(),
+        );
+
+        // Discard the gas value
+        result.map(|(block_state, _)| block_state)
+    }
+}
+
+#[async_trait]
+impl<C: Blockchain> RuntimeHostTrait<C> for RuntimeHost<C> {
+    fn data_source(&self) -> &DataSource<C> {
+        &self.data_source
+    }
+
+    fn match_and_decode(
+        &self,
+        trigger: &TriggerData<C>,
+        block: &Arc<C::Block>,
+        logger: &Logger,
+    ) -> Result<Option<TriggerWithHandler<MappingTrigger<C>>>, Error> {
+        self.data_source.match_and_decode(trigger, block, logger)
+    }
+
+    async fn process_mapping_trigger(
+        &self,
+        logger: &Logger,
+        block_ptr: BlockPtr,
+        trigger: TriggerWithHandler<MappingTrigger<C>>,
+        state: BlockState<C>,
+        proof_of_indexing: SharedProofOfIndexing,
+        debug_fork: &Option<Arc<dyn SubgraphFork>>,
+    ) -> Result<BlockState<C>, MappingError> {
+        self.send_mapping_request(
+            logger,
+            state,
+            trigger,
+            block_ptr,
+            proof_of_indexing,
+            debug_fork,
+        )
+        .await
+    }
+
+    fn creation_block_number(&self) -> Option<BlockNumber> {
+        self.data_source.creation_block()
+    }
+}
+
+impl<C: Blockchain> PartialEq for RuntimeHost<C> {
+    fn eq(&self, other: &Self) -> bool {
+        self.data_source.is_duplicate_of(&other.data_source)
+    }
+}
diff --git a/runtime/wasm/src/host_exports.rs b/runtime/wasm/src/host_exports.rs
new file mode 100644
index 0000000..28ef3b8
--- /dev/null
+++ b/runtime/wasm/src/host_exports.rs
@@ -0,0 +1,826 @@
+use std::collections::HashMap;
+use std::ops::Deref;
+use std::str::FromStr;
+use std::time::{Duration, Instant};
+
+use never::Never;
+use semver::Version;
+use wasmtime::Trap;
+use web3::types::H160;
+
+use graph::blockchain::Blockchain;
+use graph::components::store::EnsLookup;
+use graph::components::store::{EntityKey, EntityType};
+use graph::components::subgraph::{CausalityRegion, ProofOfIndexingEvent, SharedProofOfIndexing};
+use graph::data::store;
+use graph::data_source::{DataSource, DataSourceTemplate};
+use graph::ensure;
+use graph::prelude::ethabi::param_type::Reader;
+use graph::prelude::ethabi::{decode, encode, Token};
+use graph::prelude::serde_json;
+use graph::prelude::{slog::b, slog::record_static, *};
+use graph::runtime::gas::{self, complexity, Gas, GasCounter};
+pub use graph::runtime::{DeterministicHostError, HostExportError};
+
+use crate::module::{WasmInstance, WasmInstanceContext};
+use crate::{error::DeterminismLevel, module::IntoTrap};
+
+fn write_poi_event(
+    proof_of_indexing: &SharedProofOfIndexing,
+    poi_event: &ProofOfIndexingEvent,
+    causality_region: &str,
+    logger: &Logger,
+) {
+    if let Some(proof_of_indexing) = proof_of_indexing {
+        let mut proof_of_indexing = proof_of_indexing.deref().borrow_mut();
+        proof_of_indexing.write(logger, causality_region, poi_event);
+    }
+}
+
+impl IntoTrap for HostExportError {
+    fn determinism_level(&self) -> DeterminismLevel {
+        match self {
+            HostExportError::Deterministic(_) => DeterminismLevel::Deterministic,
+            HostExportError::Unknown(_) => DeterminismLevel::Unimplemented,
+            HostExportError::PossibleReorg(_) => DeterminismLevel::PossibleReorg,
+        }
+    }
+    fn into_trap(self) -> Trap {
+        match self {
+            HostExportError::Unknown(e)
+            | HostExportError::PossibleReorg(e)
+            | HostExportError::Deterministic(e) => Trap::from(e),
+        }
+    }
+}
+
+pub struct HostExports<C: Blockchain> {
+    pub(crate) subgraph_id: DeploymentHash,
+    pub api_version: Version,
+    data_source_name: String,
+    data_source_address: Vec<u8>,
+    data_source_network: String,
+    data_source_context: Arc<Option<DataSourceContext>>,
+    /// Some data sources have indeterminism or different notions of time. These
+    /// need to be each be stored separately to separate causality between them,
+    /// and merge the results later. Right now, this is just the ethereum
+    /// networks but will be expanded for ipfs and the availability chain.
+    causality_region: String,
+    templates: Arc<Vec<DataSourceTemplate<C>>>,
+    pub(crate) link_resolver: Arc<dyn LinkResolver>,
+    ens_lookup: Arc<dyn EnsLookup>,
+}
+
+impl<C: Blockchain> HostExports<C> {
+    pub fn new(
+        subgraph_id: DeploymentHash,
+        data_source: &DataSource<C>,
+        data_source_network: String,
+        templates: Arc<Vec<DataSourceTemplate<C>>>,
+        link_resolver: Arc<dyn LinkResolver>,
+        ens_lookup: Arc<dyn EnsLookup>,
+    ) -> Self {
+        Self {
+            subgraph_id,
+            api_version: data_source.api_version(),
+            data_source_name: data_source.name().to_owned(),
+            data_source_address: data_source.address().unwrap_or_default(),
+            data_source_context: data_source.context().cheap_clone(),
+            causality_region: CausalityRegion::from_network(&data_source_network),
+            data_source_network,
+            templates,
+            link_resolver,
+            ens_lookup,
+        }
+    }
+
+    pub(crate) fn abort(
+        &self,
+        message: Option<String>,
+        file_name: Option<String>,
+        line_number: Option<u32>,
+        column_number: Option<u32>,
+        gas: &GasCounter,
+    ) -> Result<Never, DeterministicHostError> {
+        gas.consume_host_fn(Gas::new(gas::DEFAULT_BASE_COST))?;
+
+        let message = message
+            .map(|message| format!("message: {}", message))
+            .unwrap_or_else(|| "no message".into());
+        let location = match (file_name, line_number, column_number) {
+            (None, None, None) => "an unknown location".into(),
+            (Some(file_name), None, None) => file_name,
+            (Some(file_name), Some(line_number), None) => {
+                format!("{}, line {}", file_name, line_number)
+            }
+            (Some(file_name), Some(line_number), Some(column_number)) => format!(
+                "{}, line {}, column {}",
+                file_name, line_number, column_number
+            ),
+            _ => unreachable!(),
+        };
+        Err(DeterministicHostError::from(anyhow::anyhow!(
+            "Mapping aborted at {}, with {}",
+            location,
+            message
+        )))
+    }
+
+    pub(crate) fn store_set(
+        &self,
+        logger: &Logger,
+        state: &mut BlockState<C>,
+        proof_of_indexing: &SharedProofOfIndexing,
+        entity_type: String,
+        entity_id: String,
+        data: HashMap<String, Value>,
+        stopwatch: &StopwatchMetrics,
+        gas: &GasCounter,
+    ) -> Result<(), anyhow::Error> {
+        let poi_section = stopwatch.start_section("host_export_store_set__proof_of_indexing");
+        write_poi_event(
+            proof_of_indexing,
+            &ProofOfIndexingEvent::SetEntity {
+                entity_type: &entity_type,
+                id: &entity_id,
+                data: &data,
+            },
+            &self.causality_region,
+            logger,
+        );
+        poi_section.end();
+
+        let key = EntityKey {
+            entity_type: EntityType::new(entity_type),
+            entity_id: entity_id.into(),
+        };
+
+        gas.consume_host_fn(gas::STORE_SET.with_args(complexity::Linear, (&key, &data)))?;
+
+        let entity = Entity::from(data);
+        state.entity_cache.set(key.clone(), entity)?;
+
+        Ok(())
+    }
+
+    pub(crate) fn store_remove(
+        &self,
+        logger: &Logger,
+        state: &mut BlockState<C>,
+        proof_of_indexing: &SharedProofOfIndexing,
+        entity_type: String,
+        entity_id: String,
+        gas: &GasCounter,
+    ) -> Result<(), HostExportError> {
+        write_poi_event(
+            proof_of_indexing,
+            &ProofOfIndexingEvent::RemoveEntity {
+                entity_type: &entity_type,
+                id: &entity_id,
+            },
+            &self.causality_region,
+            logger,
+        );
+        let key = EntityKey {
+            entity_type: EntityType::new(entity_type),
+            entity_id: entity_id.into(),
+        };
+
+        gas.consume_host_fn(gas::STORE_REMOVE.with_args(complexity::Size, &key))?;
+
+        state.entity_cache.remove(key);
+
+        Ok(())
+    }
+
+    pub(crate) fn store_get(
+        &self,
+        state: &mut BlockState<C>,
+        entity_type: String,
+        entity_id: String,
+        gas: &GasCounter,
+    ) -> Result<Option<Entity>, anyhow::Error> {
+        let store_key = EntityKey {
+            entity_type: EntityType::new(entity_type),
+            entity_id: entity_id.into(),
+        };
+
+        let result = state.entity_cache.get(&store_key)?;
+        gas.consume_host_fn(gas::STORE_GET.with_args(complexity::Linear, (&store_key, &result)))?;
+
+        Ok(result)
+    }
+
+    /// Prints the module of `n` in hex.
+    /// Integers are encoded using the least amount of digits (no leading zero digits).
+    /// Their encoding may be of uneven length. The number zero encodes as "0x0".
+    ///
+    /// https://godoc.org/github.com/ethereum/go-ethereum/common/hexutil#hdr-Encoding_Rules
+    pub(crate) fn big_int_to_hex(
+        &self,
+        n: BigInt,
+        gas: &GasCounter,
+    ) -> Result<String, DeterministicHostError> {
+        gas.consume_host_fn(gas::DEFAULT_GAS_OP.with_args(complexity::Size, &n))?;
+
+        if n == 0.into() {
+            return Ok("0x0".to_string());
+        }
+
+        let bytes = n.to_bytes_be().1;
+        Ok(format!(
+            "0x{}",
+            ::hex::encode(bytes).trim_start_matches('0')
+        ))
+    }
+
+    pub(crate) fn ipfs_cat(&self, logger: &Logger, link: String) -> Result<Vec<u8>, anyhow::Error> {
+        // Does not consume gas because this is not a part of the deterministic feature set.
+        // Ideally this would first consume gas for fetching the file stats, and then again
+        // for the bytes of the file.
+        graph::block_on(self.link_resolver.cat(logger, &Link { link }))
+    }
+
+    pub(crate) fn ipfs_get_block(
+        &self,
+        logger: &Logger,
+        link: String,
+    ) -> Result<Vec<u8>, anyhow::Error> {
+        // Does not consume gas because this is not a part of the deterministic feature set.
+        // Ideally this would first consume gas for fetching the file stats, and then again
+        // for the bytes of the file.
+        graph::block_on(self.link_resolver.get_block(logger, &Link { link }))
+    }
+
+    // Read the IPFS file `link`, split it into JSON objects, and invoke the
+    // exported function `callback` on each JSON object. The successful return
+    // value contains the block state produced by each callback invocation. Each
+    // invocation of `callback` happens in its own instance of a WASM module,
+    // which is identical to `module` when it was first started. The signature
+    // of the callback must be `callback(JSONValue, Value)`, and the `userData`
+    // parameter is passed to the callback without any changes
+    pub(crate) fn ipfs_map(
+        link_resolver: &Arc<dyn LinkResolver>,
+        module: &mut WasmInstanceContext<C>,
+        link: String,
+        callback: &str,
+        user_data: store::Value,
+        flags: Vec<String>,
+    ) -> Result<Vec<BlockState<C>>, anyhow::Error> {
+        // Does not consume gas because this is not a part of deterministic APIs.
+        // Ideally we would consume gas the same as ipfs_cat and then share
+        // gas across the spawned modules for callbacks.
+
+        const JSON_FLAG: &str = "json";
+        ensure!(
+            flags.contains(&JSON_FLAG.to_string()),
+            "Flags must contain 'json'"
+        );
+
+        let host_metrics = module.host_metrics.clone();
+        let valid_module = module.valid_module.clone();
+        let ctx = module.ctx.derive_with_empty_block_state();
+        let callback = callback.to_owned();
+        // Create a base error message to avoid borrowing headaches
+        let errmsg = format!(
+            "ipfs_map: callback '{}' failed when processing file '{}'",
+            &*callback, &link
+        );
+
+        let start = Instant::now();
+        let mut last_log = start;
+        let logger = ctx.logger.new(o!("ipfs_map" => link.clone()));
+
+        let result = {
+            let mut stream: JsonValueStream =
+                graph::block_on(link_resolver.json_stream(&logger, &Link { link }))?;
+            let mut v = Vec::new();
+            while let Some(sv) = graph::block_on(stream.next()) {
+                let sv = sv?;
+                let module = WasmInstance::from_valid_module_with_ctx(
+                    valid_module.clone(),
+                    ctx.derive_with_empty_block_state(),
+                    host_metrics.clone(),
+                    module.timeout,
+                    module.experimental_features,
+                )?;
+                let result = module.handle_json_callback(&callback, &sv.value, &user_data)?;
+                // Log progress every 15s
+                if last_log.elapsed() > Duration::from_secs(15) {
+                    debug!(
+                        logger,
+                        "Processed {} lines in {}s so far",
+                        sv.line,
+                        start.elapsed().as_secs()
+                    );
+                    last_log = Instant::now();
+                }
+                v.push(result)
+            }
+            Ok(v)
+        };
+        result.map_err(move |e: Error| anyhow::anyhow!("{}: {}", errmsg, e.to_string()))
+    }
+
+    /// Expects a decimal string.
+    pub(crate) fn json_to_i64(
+        &self,
+        json: String,
+        gas: &GasCounter,
+    ) -> Result<i64, DeterministicHostError> {
+        gas.consume_host_fn(gas::DEFAULT_GAS_OP.with_args(complexity::Size, &json))?;
+        i64::from_str(&json)
+            .with_context(|| format!("JSON `{}` cannot be parsed as i64", json))
+            .map_err(DeterministicHostError::from)
+    }
+
+    /// Expects a decimal string.
+    pub(crate) fn json_to_u64(
+        &self,
+        json: String,
+        gas: &GasCounter,
+    ) -> Result<u64, DeterministicHostError> {
+        gas.consume_host_fn(gas::DEFAULT_GAS_OP.with_args(complexity::Size, &json))?;
+
+        u64::from_str(&json)
+            .with_context(|| format!("JSON `{}` cannot be parsed as u64", json))
+            .map_err(DeterministicHostError::from)
+    }
+
+    /// Expects a decimal string.
+    pub(crate) fn json_to_f64(
+        &self,
+        json: String,
+        gas: &GasCounter,
+    ) -> Result<f64, DeterministicHostError> {
+        gas.consume_host_fn(gas::DEFAULT_GAS_OP.with_args(complexity::Size, &json))?;
+
+        f64::from_str(&json)
+            .with_context(|| format!("JSON `{}` cannot be parsed as f64", json))
+            .map_err(DeterministicHostError::from)
+    }
+
+    /// Expects a decimal string.
+    pub(crate) fn json_to_big_int(
+        &self,
+        json: String,
+        gas: &GasCounter,
+    ) -> Result<Vec<u8>, DeterministicHostError> {
+        gas.consume_host_fn(gas::DEFAULT_GAS_OP.with_args(complexity::Size, &json))?;
+
+        let big_int = BigInt::from_str(&json)
+            .with_context(|| format!("JSON `{}` is not a decimal string", json))
+            .map_err(DeterministicHostError::from)?;
+        Ok(big_int.to_signed_bytes_le())
+    }
+
+    pub(crate) fn crypto_keccak_256(
+        &self,
+        input: Vec<u8>,
+        gas: &GasCounter,
+    ) -> Result<[u8; 32], DeterministicHostError> {
+        let data = &input[..];
+        gas.consume_host_fn(gas::DEFAULT_GAS_OP.with_args(complexity::Size, data))?;
+        Ok(tiny_keccak::keccak256(data))
+    }
+
+    pub(crate) fn big_int_plus(
+        &self,
+        x: BigInt,
+        y: BigInt,
+        gas: &GasCounter,
+    ) -> Result<BigInt, DeterministicHostError> {
+        gas.consume_host_fn(gas::BIG_MATH_GAS_OP.with_args(complexity::Max, (&x, &y)))?;
+        Ok(x + y)
+    }
+
+    pub(crate) fn big_int_minus(
+        &self,
+        x: BigInt,
+        y: BigInt,
+        gas: &GasCounter,
+    ) -> Result<BigInt, DeterministicHostError> {
+        gas.consume_host_fn(gas::BIG_MATH_GAS_OP.with_args(complexity::Max, (&x, &y)))?;
+        Ok(x - y)
+    }
+
+    pub(crate) fn big_int_times(
+        &self,
+        x: BigInt,
+        y: BigInt,
+        gas: &GasCounter,
+    ) -> Result<BigInt, DeterministicHostError> {
+        gas.consume_host_fn(gas::BIG_MATH_GAS_OP.with_args(complexity::Mul, (&x, &y)))?;
+        Ok(x * y)
+    }
+
+    pub(crate) fn big_int_divided_by(
+        &self,
+        x: BigInt,
+        y: BigInt,
+        gas: &GasCounter,
+    ) -> Result<BigInt, DeterministicHostError> {
+        gas.consume_host_fn(gas::BIG_MATH_GAS_OP.with_args(complexity::Mul, (&x, &y)))?;
+        if y == 0.into() {
+            return Err(DeterministicHostError::from(anyhow!(
+                "attempted to divide BigInt `{}` by zero",
+                x
+            )));
+        }
+        Ok(x / y)
+    }
+
+    pub(crate) fn big_int_mod(
+        &self,
+        x: BigInt,
+        y: BigInt,
+        gas: &GasCounter,
+    ) -> Result<BigInt, DeterministicHostError> {
+        gas.consume_host_fn(gas::BIG_MATH_GAS_OP.with_args(complexity::Mul, (&x, &y)))?;
+        if y == 0.into() {
+            return Err(DeterministicHostError::from(anyhow!(
+                "attempted to calculate the remainder of `{}` with a divisor of zero",
+                x
+            )));
+        }
+        Ok(x % y)
+    }
+
+    /// Limited to a small exponent to avoid creating huge BigInts.
+    pub(crate) fn big_int_pow(
+        &self,
+        x: BigInt,
+        exp: u8,
+        gas: &GasCounter,
+    ) -> Result<BigInt, DeterministicHostError> {
+        gas.consume_host_fn(
+            gas::BIG_MATH_GAS_OP
+                .with_args(complexity::Exponential, (&x, (exp as f32).log2() as u8)),
+        )?;
+        Ok(x.pow(exp))
+    }
+
+    pub(crate) fn big_int_from_string(
+        &self,
+        s: String,
+        gas: &GasCounter,
+    ) -> Result<BigInt, DeterministicHostError> {
+        gas.consume_host_fn(gas::DEFAULT_GAS_OP.with_args(complexity::Size, &s))?;
+        BigInt::from_str(&s)
+            .with_context(|| format!("string is not a BigInt: `{}`", s))
+            .map_err(DeterministicHostError::from)
+    }
+
+    pub(crate) fn big_int_bit_or(
+        &self,
+        x: BigInt,
+        y: BigInt,
+        gas: &GasCounter,
+    ) -> Result<BigInt, DeterministicHostError> {
+        gas.consume_host_fn(gas::BIG_MATH_GAS_OP.with_args(complexity::Max, (&x, &y)))?;
+        Ok(x | y)
+    }
+
+    pub(crate) fn big_int_bit_and(
+        &self,
+        x: BigInt,
+        y: BigInt,
+        gas: &GasCounter,
+    ) -> Result<BigInt, DeterministicHostError> {
+        gas.consume_host_fn(gas::BIG_MATH_GAS_OP.with_args(complexity::Min, (&x, &y)))?;
+        Ok(x & y)
+    }
+
+    pub(crate) fn big_int_left_shift(
+        &self,
+        x: BigInt,
+        bits: u8,
+        gas: &GasCounter,
+    ) -> Result<BigInt, DeterministicHostError> {
+        gas.consume_host_fn(gas::BIG_MATH_GAS_OP.with_args(complexity::Linear, (&x, &bits)))?;
+        Ok(x << bits)
+    }
+
+    pub(crate) fn big_int_right_shift(
+        &self,
+        x: BigInt,
+        bits: u8,
+        gas: &GasCounter,
+    ) -> Result<BigInt, DeterministicHostError> {
+        gas.consume_host_fn(gas::BIG_MATH_GAS_OP.with_args(complexity::Linear, (&x, &bits)))?;
+        Ok(x >> bits)
+    }
+
+    /// Useful for IPFS hashes stored as bytes
+    pub(crate) fn bytes_to_base58(
+        &self,
+        bytes: Vec<u8>,
+        gas: &GasCounter,
+    ) -> Result<String, DeterministicHostError> {
+        gas.consume_host_fn(gas::DEFAULT_GAS_OP.with_args(complexity::Size, &bytes))?;
+        Ok(::bs58::encode(&bytes).into_string())
+    }
+
+    pub(crate) fn big_decimal_plus(
+        &self,
+        x: BigDecimal,
+        y: BigDecimal,
+        gas: &GasCounter,
+    ) -> Result<BigDecimal, DeterministicHostError> {
+        gas.consume_host_fn(gas::BIG_MATH_GAS_OP.with_args(complexity::Linear, (&x, &y)))?;
+        Ok(x + y)
+    }
+
+    pub(crate) fn big_decimal_minus(
+        &self,
+        x: BigDecimal,
+        y: BigDecimal,
+        gas: &GasCounter,
+    ) -> Result<BigDecimal, DeterministicHostError> {
+        gas.consume_host_fn(gas::BIG_MATH_GAS_OP.with_args(complexity::Linear, (&x, &y)))?;
+        Ok(x - y)
+    }
+
+    pub(crate) fn big_decimal_times(
+        &self,
+        x: BigDecimal,
+        y: BigDecimal,
+        gas: &GasCounter,
+    ) -> Result<BigDecimal, DeterministicHostError> {
+        gas.consume_host_fn(gas::BIG_MATH_GAS_OP.with_args(complexity::Mul, (&x, &y)))?;
+        Ok(x * y)
+    }
+
+    /// Maximum precision of 100 decimal digits.
+    pub(crate) fn big_decimal_divided_by(
+        &self,
+        x: BigDecimal,
+        y: BigDecimal,
+        gas: &GasCounter,
+    ) -> Result<BigDecimal, DeterministicHostError> {
+        gas.consume_host_fn(gas::BIG_MATH_GAS_OP.with_args(complexity::Mul, (&x, &y)))?;
+        if y == 0.into() {
+            return Err(DeterministicHostError::from(anyhow!(
+                "attempted to divide BigDecimal `{}` by zero",
+                x
+            )));
+        }
+        Ok(x / y)
+    }
+
+    pub(crate) fn big_decimal_equals(
+        &self,
+        x: BigDecimal,
+        y: BigDecimal,
+        gas: &GasCounter,
+    ) -> Result<bool, DeterministicHostError> {
+        gas.consume_host_fn(gas::BIG_MATH_GAS_OP.with_args(complexity::Min, (&x, &y)))?;
+        Ok(x == y)
+    }
+
+    pub(crate) fn big_decimal_to_string(
+        &self,
+        x: BigDecimal,
+        gas: &GasCounter,
+    ) -> Result<String, DeterministicHostError> {
+        gas.consume_host_fn(gas::DEFAULT_GAS_OP.with_args(complexity::Size, &x))?;
+        Ok(x.to_string())
+    }
+
+    pub(crate) fn big_decimal_from_string(
+        &self,
+        s: String,
+        gas: &GasCounter,
+    ) -> Result<BigDecimal, DeterministicHostError> {
+        gas.consume_host_fn(gas::DEFAULT_GAS_OP.with_args(complexity::Size, &s))?;
+        BigDecimal::from_str(&s)
+            .with_context(|| format!("string  is not a BigDecimal: '{}'", s))
+            .map_err(DeterministicHostError::from)
+    }
+
+    pub(crate) fn data_source_create(
+        &self,
+        logger: &Logger,
+        state: &mut BlockState<C>,
+        name: String,
+        params: Vec<String>,
+        context: Option<DataSourceContext>,
+        creation_block: BlockNumber,
+        gas: &GasCounter,
+    ) -> Result<(), HostExportError> {
+        gas.consume_host_fn(gas::CREATE_DATA_SOURCE)?;
+        info!(
+            logger,
+            "Create data source";
+            "name" => &name,
+            "params" => format!("{}", params.join(","))
+        );
+
+        // Resolve the name into the right template
+        let template = self
+            .templates
+            .iter()
+            .find(|template| template.name() == name)
+            .with_context(|| {
+                format!(
+                    "Failed to create data source from name `{}`: \
+                     No template with this name in parent data source `{}`. \
+                     Available names: {}.",
+                    name,
+                    self.data_source_name,
+                    self.templates
+                        .iter()
+                        .map(|template| template.name())
+                        .collect::<Vec<_>>()
+                        .join(", ")
+                )
+            })
+            .map_err(DeterministicHostError::from)?
+            .clone();
+
+        // Remember that we need to create this data source
+        state.push_created_data_source(DataSourceTemplateInfo {
+            template,
+            params,
+            context,
+            creation_block,
+        });
+
+        Ok(())
+    }
+
+    pub(crate) fn ens_name_by_hash(&self, hash: &str) -> Result<Option<String>, anyhow::Error> {
+        Ok(self.ens_lookup.find_name(hash)?)
+    }
+
+    pub(crate) fn log_log(
+        &self,
+        logger: &Logger,
+        level: slog::Level,
+        msg: String,
+        gas: &GasCounter,
+    ) -> Result<(), DeterministicHostError> {
+        gas.consume_host_fn(gas::LOG_OP.with_args(complexity::Size, &msg))?;
+
+        let rs = record_static!(level, self.data_source_name.as_str());
+
+        logger.log(&slog::Record::new(
+            &rs,
+            &format_args!("{}", msg),
+            b!("data_source" => &self.data_source_name),
+        ));
+
+        if level == slog::Level::Critical {
+            return Err(DeterministicHostError::from(anyhow!(
+                "Critical error logged in mapping"
+            )));
+        }
+        Ok(())
+    }
+
+    pub(crate) fn data_source_address(
+        &self,
+        gas: &GasCounter,
+    ) -> Result<Vec<u8>, DeterministicHostError> {
+        gas.consume_host_fn(Gas::new(gas::DEFAULT_BASE_COST))?;
+        Ok(self.data_source_address.clone())
+    }
+
+    pub(crate) fn data_source_network(
+        &self,
+        gas: &GasCounter,
+    ) -> Result<String, DeterministicHostError> {
+        gas.consume_host_fn(Gas::new(gas::DEFAULT_BASE_COST))?;
+        Ok(self.data_source_network.clone())
+    }
+
+    pub(crate) fn data_source_context(
+        &self,
+        gas: &GasCounter,
+    ) -> Result<Entity, DeterministicHostError> {
+        gas.consume_host_fn(Gas::new(gas::DEFAULT_BASE_COST))?;
+        Ok(self
+            .data_source_context
+            .as_ref()
+            .clone()
+            .unwrap_or_default())
+    }
+
+    pub(crate) fn json_from_bytes(
+        &self,
+        bytes: &Vec<u8>,
+        gas: &GasCounter,
+    ) -> Result<serde_json::Value, DeterministicHostError> {
+        gas.consume_host_fn(gas::DEFAULT_GAS_OP.with_args(gas::complexity::Size, &bytes))?;
+        serde_json::from_reader(bytes.as_slice())
+            .map_err(|e| DeterministicHostError::from(Error::from(e)))
+    }
+
+    pub(crate) fn string_to_h160(
+        &self,
+        string: &str,
+        gas: &GasCounter,
+    ) -> Result<H160, DeterministicHostError> {
+        gas.consume_host_fn(gas::DEFAULT_GAS_OP.with_args(complexity::Size, &string))?;
+        string_to_h160(string)
+    }
+
+    pub(crate) fn bytes_to_string(
+        &self,
+        logger: &Logger,
+        bytes: Vec<u8>,
+        gas: &GasCounter,
+    ) -> Result<String, DeterministicHostError> {
+        gas.consume_host_fn(gas::DEFAULT_GAS_OP.with_args(complexity::Size, &bytes))?;
+
+        Ok(bytes_to_string(logger, bytes))
+    }
+
+    pub(crate) fn ethereum_encode(
+        &self,
+        token: Token,
+        gas: &GasCounter,
+    ) -> Result<Vec<u8>, DeterministicHostError> {
+        let encoded = encode(&[token]);
+
+        gas.consume_host_fn(gas::DEFAULT_GAS_OP.with_args(complexity::Size, &encoded))?;
+
+        Ok(encoded)
+    }
+
+    pub(crate) fn ethereum_decode(
+        &self,
+        types: String,
+        data: Vec<u8>,
+        gas: &GasCounter,
+    ) -> Result<Token, anyhow::Error> {
+        gas.consume_host_fn(gas::DEFAULT_GAS_OP.with_args(complexity::Size, &data))?;
+
+        let param_types =
+            Reader::read(&types).map_err(|e| anyhow::anyhow!("Failed to read types: {}", e))?;
+
+        decode(&[param_types], &data)
+            // The `.pop().unwrap()` here is ok because we're always only passing one
+            // `param_types` to `decode`, so the returned `Vec` has always size of one.
+            // We can't do `tokens[0]` because the value can't be moved out of the `Vec`.
+            .map(|mut tokens| tokens.pop().unwrap())
+            .context("Failed to decode")
+    }
+}
+
+fn string_to_h160(string: &str) -> Result<H160, DeterministicHostError> {
+    // `H160::from_str` takes a hex string with no leading `0x`.
+    let s = string.trim_start_matches("0x");
+    H160::from_str(s)
+        .with_context(|| format!("Failed to convert string to Address/H160: '{}'", s))
+        .map_err(DeterministicHostError::from)
+}
+
+fn bytes_to_string(logger: &Logger, bytes: Vec<u8>) -> String {
+    let s = String::from_utf8_lossy(&bytes);
+
+    // If the string was re-allocated, that means it was not UTF8.
+    if matches!(s, std::borrow::Cow::Owned(_)) {
+        warn!(
+            logger,
+            "Bytes contain invalid UTF8. This may be caused by attempting \
+            to convert a value such as an address that cannot be parsed to a unicode string. \
+            You may want to use 'toHexString()' instead. String (truncated to 1024 chars): '{}'",
+            &s.chars().take(1024).collect::<String>(),
+        )
+    }
+
+    // The string may have been encoded in a fixed length buffer and padded with null
+    // characters, so trim trailing nulls.
+    s.trim_end_matches('\u{0000}').to_string()
+}
+
+#[test]
+fn test_string_to_h160_with_0x() {
+    assert_eq!(
+        H160::from_str("A16081F360e3847006dB660bae1c6d1b2e17eC2A").unwrap(),
+        string_to_h160("0xA16081F360e3847006dB660bae1c6d1b2e17eC2A").unwrap()
+    )
+}
+
+#[test]
+fn bytes_to_string_is_lossy() {
+    assert_eq!(
+        "Downcoin WETH-USDT",
+        bytes_to_string(
+            &graph::log::logger(true),
+            vec![68, 111, 119, 110, 99, 111, 105, 110, 32, 87, 69, 84, 72, 45, 85, 83, 68, 84],
+        )
+    );
+
+    assert_eq!(
+        "Downcoin WETH-USDT�",
+        bytes_to_string(
+            &graph::log::logger(true),
+            vec![
+                68, 111, 119, 110, 99, 111, 105, 110, 32, 87, 69, 84, 72, 45, 85, 83, 68, 84, 160,
+                0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
+            ],
+        )
+    )
+}
diff --git a/runtime/wasm/src/lib.rs b/runtime/wasm/src/lib.rs
new file mode 100644
index 0000000..2a365b9
--- /dev/null
+++ b/runtime/wasm/src/lib.rs
@@ -0,0 +1,26 @@
+pub mod asc_abi;
+
+mod host;
+pub mod to_from;
+
+/// Public interface of the crate, receives triggers to be processed.
+
+/// Pre-processes modules and manages their threads. Serves as an interface from `host` to `module`.
+pub mod mapping;
+
+/// WASM module instance.
+pub mod module;
+
+/// Runtime-agnostic implementation of exports to WASM.
+pub mod host_exports;
+
+pub mod error;
+mod gas_rules;
+
+pub use host::RuntimeHostBuilder;
+pub use host_exports::HostExports;
+pub use mapping::{MappingContext, ValidModule};
+pub use module::{ExperimentalFeatures, WasmInstance};
+
+#[cfg(debug_assertions)]
+pub use module::TRAP_TIMEOUT;
diff --git a/runtime/wasm/src/mapping.rs b/runtime/wasm/src/mapping.rs
new file mode 100644
index 0000000..cd1198b
--- /dev/null
+++ b/runtime/wasm/src/mapping.rs
@@ -0,0 +1,216 @@
+use crate::gas_rules::GasRules;
+use crate::module::{ExperimentalFeatures, ToAscPtr, WasmInstance};
+use futures::sync::mpsc;
+use futures03::channel::oneshot::Sender;
+use graph::blockchain::{Blockchain, HostFn};
+use graph::components::store::SubgraphFork;
+use graph::components::subgraph::{MappingError, SharedProofOfIndexing};
+use graph::data_source::{MappingTrigger, TriggerWithHandler};
+use graph::prelude::*;
+use graph::runtime::gas::Gas;
+use std::collections::BTreeMap;
+use std::sync::Arc;
+use std::thread;
+
+/// Spawn a wasm module in its own thread.
+pub fn spawn_module<C: Blockchain>(
+    raw_module: &[u8],
+    logger: Logger,
+    subgraph_id: DeploymentHash,
+    host_metrics: Arc<HostMetrics>,
+    runtime: tokio::runtime::Handle,
+    timeout: Option<Duration>,
+    experimental_features: ExperimentalFeatures,
+) -> Result<mpsc::Sender<MappingRequest<C>>, anyhow::Error>
+where
+    <C as Blockchain>::MappingTrigger: ToAscPtr,
+{
+    let valid_module = Arc::new(ValidModule::new(&logger, raw_module)?);
+
+    // Create channel for event handling requests
+    let (mapping_request_sender, mapping_request_receiver) = mpsc::channel(100);
+
+    // wasmtime instances are not `Send` therefore they cannot be scheduled by
+    // the regular tokio executor, so we create a dedicated thread.
+    //
+    // In case of failure, this thread may panic or simply terminate,
+    // dropping the `mapping_request_receiver` which ultimately causes the
+    // subgraph to fail the next time it tries to handle an event.
+    let conf =
+        thread::Builder::new().name(format!("mapping-{}-{}", &subgraph_id, uuid::Uuid::new_v4()));
+    conf.spawn(move || {
+        let _runtime_guard = runtime.enter();
+
+        // Pass incoming triggers to the WASM module and return entity changes;
+        // Stop when canceled because all RuntimeHosts and their senders were dropped.
+        match mapping_request_receiver
+            .map_err(|()| unreachable!())
+            .for_each(move |request| {
+                let MappingRequest {
+                    ctx,
+                    trigger,
+                    result_sender,
+                } = request;
+
+                let result = instantiate_module_and_handle_trigger(
+                    valid_module.cheap_clone(),
+                    ctx,
+                    trigger,
+                    host_metrics.cheap_clone(),
+                    timeout,
+                    experimental_features,
+                );
+
+                result_sender
+                    .send(result)
+                    .map_err(|_| anyhow::anyhow!("WASM module result receiver dropped."))
+            })
+            .wait()
+        {
+            Ok(()) => debug!(logger, "Subgraph stopped, WASM runtime thread terminated"),
+            Err(e) => debug!(logger, "WASM runtime thread terminated abnormally";
+                                    "error" => e.to_string()),
+        }
+    })
+    .map(|_| ())
+    .context("Spawning WASM runtime thread failed")?;
+
+    Ok(mapping_request_sender)
+}
+
+fn instantiate_module_and_handle_trigger<C: Blockchain>(
+    valid_module: Arc<ValidModule>,
+    ctx: MappingContext<C>,
+    trigger: TriggerWithHandler<MappingTrigger<C>>,
+    host_metrics: Arc<HostMetrics>,
+    timeout: Option<Duration>,
+    experimental_features: ExperimentalFeatures,
+) -> Result<(BlockState<C>, Gas), MappingError>
+where
+    <C as Blockchain>::MappingTrigger: ToAscPtr,
+{
+    let logger = ctx.logger.cheap_clone();
+
+    // Start the WASM module runtime.
+    let section = host_metrics.stopwatch.start_section("module_init");
+    let module = WasmInstance::from_valid_module_with_ctx(
+        valid_module,
+        ctx,
+        host_metrics.cheap_clone(),
+        timeout,
+        experimental_features,
+    )?;
+    section.end();
+
+    let _section = host_metrics.stopwatch.start_section("run_handler");
+    if ENV_VARS.log_trigger_data {
+        debug!(logger, "trigger data: {:?}", trigger);
+    }
+    module.handle_trigger(trigger)
+}
+
+pub struct MappingRequest<C: Blockchain> {
+    pub(crate) ctx: MappingContext<C>,
+    pub(crate) trigger: TriggerWithHandler<MappingTrigger<C>>,
+    pub(crate) result_sender: Sender<Result<(BlockState<C>, Gas), MappingError>>,
+}
+
+pub struct MappingContext<C: Blockchain> {
+    pub logger: Logger,
+    pub host_exports: Arc<crate::host_exports::HostExports<C>>,
+    pub block_ptr: BlockPtr,
+    pub state: BlockState<C>,
+    pub proof_of_indexing: SharedProofOfIndexing,
+    pub host_fns: Arc<Vec<HostFn>>,
+    pub debug_fork: Option<Arc<dyn SubgraphFork>>,
+}
+
+impl<C: Blockchain> MappingContext<C> {
+    pub fn derive_with_empty_block_state(&self) -> Self {
+        MappingContext {
+            logger: self.logger.cheap_clone(),
+            host_exports: self.host_exports.cheap_clone(),
+            block_ptr: self.block_ptr.cheap_clone(),
+            state: BlockState::new(self.state.entity_cache.store.clone(), Default::default()),
+            proof_of_indexing: self.proof_of_indexing.cheap_clone(),
+            host_fns: self.host_fns.cheap_clone(),
+            debug_fork: self.debug_fork.cheap_clone(),
+        }
+    }
+}
+
+/// A pre-processed and valid WASM module, ready to be started as a WasmModule.
+pub struct ValidModule {
+    pub module: wasmtime::Module,
+
+    // A wasm import consists of a `module` and a `name`. AS will generate imports such that they
+    // have `module` set to the name of the file it is imported from and `name` set to the imported
+    // function name or `namespace.function` if inside a namespace. We'd rather not specify names of
+    // source files, so we consider that the import `name` uniquely identifies an import. Still we
+    // need to know the `module` to properly link it, so here we map import names to modules.
+    //
+    // AS now has an `@external("module", "name")` decorator which would make things cleaner, but
+    // the ship has sailed.
+    pub import_name_to_modules: BTreeMap<String, Vec<String>>,
+}
+
+impl ValidModule {
+    /// Pre-process and validate the module.
+    pub fn new(logger: &Logger, raw_module: &[u8]) -> Result<Self, anyhow::Error> {
+        // Add the gas calls here. Module name "gas" must match. See also
+        // e3f03e62-40e4-4f8c-b4a1-d0375cca0b76. We do this by round-tripping the module through
+        // parity - injecting gas then serializing again.
+        let parity_module = parity_wasm::elements::Module::from_bytes(raw_module)?;
+        let parity_module = match parity_module.parse_names() {
+            Ok(module) => module,
+            Err((errs, module)) => {
+                for (index, err) in errs {
+                    warn!(
+                        logger,
+                        "unable to parse function name for index {}: {}",
+                        index,
+                        err.to_string()
+                    );
+                }
+
+                module
+            }
+        };
+        let parity_module = wasm_instrument::gas_metering::inject(parity_module, &GasRules, "gas")
+            .map_err(|_| anyhow!("Failed to inject gas counter"))?;
+        let raw_module = parity_module.into_bytes()?;
+
+        // We currently use Cranelift as a compilation engine. Cranelift is an optimizing compiler,
+        // but that should not cause determinism issues since it adheres to the Wasm spec. Still we
+        // turn off optional optimizations to be conservative.
+        let mut config = wasmtime::Config::new();
+        config.strategy(wasmtime::Strategy::Cranelift).unwrap();
+        config.interruptable(true); // For timeouts.
+        config.cranelift_nan_canonicalization(true); // For NaN determinism.
+        config.cranelift_opt_level(wasmtime::OptLevel::None);
+        config
+            .max_wasm_stack(ENV_VARS.mappings.max_stack_size)
+            .unwrap(); // Safe because this only panics if size passed is 0.
+
+        let engine = &wasmtime::Engine::new(&config)?;
+        let module = wasmtime::Module::from_binary(&engine, &raw_module)?;
+
+        let mut import_name_to_modules: BTreeMap<String, Vec<String>> = BTreeMap::new();
+
+        // Unwrap: Module linking is disabled.
+        for (name, module) in module
+            .imports()
+            .map(|import| (import.name().unwrap(), import.module()))
+        {
+            import_name_to_modules
+                .entry(name.to_string())
+                .or_default()
+                .push(module.to_string());
+        }
+
+        Ok(ValidModule {
+            module,
+            import_name_to_modules,
+        })
+    }
+}
diff --git a/runtime/wasm/src/module/into_wasm_ret.rs b/runtime/wasm/src/module/into_wasm_ret.rs
new file mode 100644
index 0000000..444c9eb
--- /dev/null
+++ b/runtime/wasm/src/module/into_wasm_ret.rs
@@ -0,0 +1,78 @@
+use never::Never;
+use wasmtime::Trap;
+
+use graph::runtime::AscPtr;
+
+/// Helper trait for the `link!` macro.
+pub trait IntoWasmRet {
+    type Ret: wasmtime::WasmRet;
+
+    fn into_wasm_ret(self) -> Self::Ret;
+}
+
+impl IntoWasmRet for () {
+    type Ret = Self;
+    fn into_wasm_ret(self) -> Self {
+        self
+    }
+}
+
+impl IntoWasmRet for Never {
+    type Ret = ();
+    fn into_wasm_ret(self) -> Self::Ret {
+        unreachable!()
+    }
+}
+
+impl IntoWasmRet for i32 {
+    type Ret = Self;
+    fn into_wasm_ret(self) -> Self {
+        self
+    }
+}
+
+impl IntoWasmRet for i64 {
+    type Ret = Self;
+    fn into_wasm_ret(self) -> Self {
+        self
+    }
+}
+
+impl IntoWasmRet for f64 {
+    type Ret = Self;
+    fn into_wasm_ret(self) -> Self {
+        self
+    }
+}
+
+impl IntoWasmRet for u64 {
+    type Ret = u64;
+    fn into_wasm_ret(self) -> u64 {
+        self
+    }
+}
+
+impl IntoWasmRet for bool {
+    type Ret = i32;
+    fn into_wasm_ret(self) -> i32 {
+        self.into()
+    }
+}
+
+impl<C> IntoWasmRet for AscPtr<C> {
+    type Ret = u32;
+    fn into_wasm_ret(self) -> u32 {
+        self.wasm_ptr()
+    }
+}
+
+impl<T> IntoWasmRet for Result<T, Trap>
+where
+    T: IntoWasmRet,
+    T::Ret: wasmtime::WasmTy,
+{
+    type Ret = Result<T::Ret, Trap>;
+    fn into_wasm_ret(self) -> Self::Ret {
+        self.map(|x| x.into_wasm_ret())
+    }
+}
diff --git a/runtime/wasm/src/module/mod.rs b/runtime/wasm/src/module/mod.rs
new file mode 100644
index 0000000..327b00e
--- /dev/null
+++ b/runtime/wasm/src/module/mod.rs
@@ -0,0 +1,1763 @@
+use std::cell::RefCell;
+use std::collections::HashMap;
+use std::convert::TryFrom;
+use std::mem::MaybeUninit;
+use std::ops::{Deref, DerefMut};
+use std::rc::Rc;
+use std::sync::atomic::{AtomicBool, Ordering};
+use std::time::Instant;
+
+use anyhow::anyhow;
+use anyhow::Error;
+use never::Never;
+use semver::Version;
+use wasmtime::{Memory, Trap};
+
+use graph::blockchain::{Blockchain, HostFnCtx};
+use graph::data::store;
+use graph::data::subgraph::schema::SubgraphError;
+use graph::data_source::{offchain, MappingTrigger, TriggerWithHandler};
+use graph::prelude::*;
+use graph::runtime::{
+    asc_get, asc_new,
+    gas::{self, Gas, GasCounter, SaturatingInto},
+    AscHeap, AscIndexId, AscType, DeterministicHostError, FromAscObj, HostExportError,
+    IndexForAscTypeId, ToAscObj,
+};
+use graph::util::mem::init_slice;
+use graph::{components::subgraph::MappingError, runtime::AscPtr};
+pub use into_wasm_ret::IntoWasmRet;
+pub use stopwatch::TimeoutStopwatch;
+
+use crate::asc_abi::class::*;
+use crate::error::DeterminismLevel;
+use crate::gas_rules::{GAS_COST_LOAD, GAS_COST_STORE};
+pub use crate::host_exports;
+use crate::host_exports::HostExports;
+use crate::mapping::MappingContext;
+use crate::mapping::ValidModule;
+
+mod into_wasm_ret;
+pub mod stopwatch;
+
+pub const TRAP_TIMEOUT: &str = "trap: interrupt";
+
+pub trait IntoTrap {
+    fn determinism_level(&self) -> DeterminismLevel;
+    fn into_trap(self) -> Trap;
+}
+
+/// A flexible interface for writing a type to AS memory, any pointer can be returned.
+/// Use `AscPtr::erased` to convert `AscPtr<T>` into `AscPtr<()>`.
+pub trait ToAscPtr {
+    fn to_asc_ptr<H: AscHeap>(
+        self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscPtr<()>, DeterministicHostError>;
+}
+
+impl ToAscPtr for offchain::TriggerData {
+    fn to_asc_ptr<H: AscHeap>(
+        self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscPtr<()>, DeterministicHostError> {
+        asc_new(heap, self.data.as_ref() as &[u8], gas).map(|ptr| ptr.erase())
+    }
+}
+
+impl<C: Blockchain> ToAscPtr for MappingTrigger<C>
+where
+    C::MappingTrigger: ToAscPtr,
+{
+    fn to_asc_ptr<H: AscHeap>(
+        self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscPtr<()>, DeterministicHostError> {
+        match self {
+            MappingTrigger::Onchain(trigger) => trigger.to_asc_ptr(heap, gas),
+            MappingTrigger::Offchain(trigger) => trigger.to_asc_ptr(heap, gas),
+        }
+    }
+}
+
+impl<T: ToAscPtr> ToAscPtr for TriggerWithHandler<T> {
+    fn to_asc_ptr<H: AscHeap>(
+        self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscPtr<()>, DeterministicHostError> {
+        self.trigger.to_asc_ptr(heap, gas)
+    }
+}
+
+/// Handle to a WASM instance, which is terminated if and only if this is dropped.
+pub struct WasmInstance<C: Blockchain> {
+    pub instance: wasmtime::Instance,
+
+    // This is the only reference to `WasmInstanceContext` that's not within the instance itself, so
+    // we can always borrow the `RefCell` with no concern for race conditions.
+    //
+    // Also this is the only strong reference, so the instance will be dropped once this is dropped.
+    // The weak references are circulary held by instance itself through host exports.
+    pub instance_ctx: Rc<RefCell<Option<WasmInstanceContext<C>>>>,
+
+    // A reference to the gas counter used for reporting the gas used.
+    pub gas: GasCounter,
+}
+
+impl<C: Blockchain> Drop for WasmInstance<C> {
+    fn drop(&mut self) {
+        // Assert that the instance will be dropped.
+        assert_eq!(Rc::strong_count(&self.instance_ctx), 1);
+    }
+}
+
+impl<C: Blockchain> WasmInstance<C> {
+    pub fn asc_get<T, P>(&self, asc_ptr: AscPtr<P>) -> Result<T, DeterministicHostError>
+    where
+        P: AscType + AscIndexId,
+        T: FromAscObj<P>,
+    {
+        asc_get(self.instance_ctx().deref(), asc_ptr, &self.gas)
+    }
+
+    pub fn asc_new<P, T: ?Sized>(
+        &mut self,
+        rust_obj: &T,
+    ) -> Result<AscPtr<P>, DeterministicHostError>
+    where
+        P: AscType + AscIndexId,
+        T: ToAscObj<P>,
+    {
+        asc_new(self.instance_ctx_mut().deref_mut(), rust_obj, &self.gas)
+    }
+}
+
+impl<C: Blockchain> WasmInstance<C> {
+    pub(crate) fn handle_json_callback(
+        mut self,
+        handler_name: &str,
+        value: &serde_json::Value,
+        user_data: &store::Value,
+    ) -> Result<BlockState<C>, anyhow::Error> {
+        let gas = GasCounter::default();
+        let value = asc_new(self.instance_ctx_mut().deref_mut(), value, &gas)?;
+        let user_data = asc_new(self.instance_ctx_mut().deref_mut(), user_data, &gas)?;
+
+        self.instance_ctx_mut().ctx.state.enter_handler();
+
+        // Invoke the callback
+        self.instance
+            .get_func(handler_name)
+            .with_context(|| format!("function {} not found", handler_name))?
+            .typed()?
+            .call((value.wasm_ptr(), user_data.wasm_ptr()))
+            .with_context(|| format!("Failed to handle callback '{}'", handler_name))?;
+
+        self.instance_ctx_mut().ctx.state.exit_handler();
+
+        Ok(self.take_ctx().ctx.state)
+    }
+
+    pub(crate) fn handle_trigger(
+        mut self,
+        trigger: TriggerWithHandler<MappingTrigger<C>>,
+    ) -> Result<(BlockState<C>, Gas), MappingError>
+    where
+        <C as Blockchain>::MappingTrigger: ToAscPtr,
+    {
+        let handler_name = trigger.handler_name().to_owned();
+        let gas = self.gas.clone();
+        let asc_trigger = trigger.to_asc_ptr(self.instance_ctx_mut().deref_mut(), &gas)?;
+        self.invoke_handler(&handler_name, asc_trigger)
+    }
+
+    pub fn take_ctx(&mut self) -> WasmInstanceContext<C> {
+        self.instance_ctx.borrow_mut().take().unwrap()
+    }
+
+    pub(crate) fn instance_ctx(&self) -> std::cell::Ref<'_, WasmInstanceContext<C>> {
+        std::cell::Ref::map(self.instance_ctx.borrow(), |i| i.as_ref().unwrap())
+    }
+
+    pub fn instance_ctx_mut(&self) -> std::cell::RefMut<'_, WasmInstanceContext<C>> {
+        std::cell::RefMut::map(self.instance_ctx.borrow_mut(), |i| i.as_mut().unwrap())
+    }
+
+    #[cfg(debug_assertions)]
+    pub fn get_func(&self, func_name: &str) -> wasmtime::Func {
+        self.instance.get_func(func_name).unwrap()
+    }
+
+    #[cfg(debug_assertions)]
+    pub fn gas_used(&self) -> u64 {
+        self.gas.get().value()
+    }
+
+    fn invoke_handler<T>(
+        &mut self,
+        handler: &str,
+        arg: AscPtr<T>,
+    ) -> Result<(BlockState<C>, Gas), MappingError> {
+        let func = self
+            .instance
+            .get_func(handler)
+            .with_context(|| format!("function {} not found", handler))?;
+
+        // Caution: Make sure all exit paths from this function call `exit_handler`.
+        self.instance_ctx_mut().ctx.state.enter_handler();
+
+        // This `match` will return early if there was a non-deterministic trap.
+        let deterministic_error: Option<Error> = match func.typed()?.call(arg.wasm_ptr()) {
+            Ok(()) => None,
+            Err(trap) if self.instance_ctx().possible_reorg => {
+                self.instance_ctx_mut().ctx.state.exit_handler();
+                return Err(MappingError::PossibleReorg(trap.into()));
+            }
+            Err(trap) if trap.to_string().contains(TRAP_TIMEOUT) => {
+                self.instance_ctx_mut().ctx.state.exit_handler();
+                return Err(MappingError::Unknown(Error::from(trap).context(format!(
+                    "Handler '{}' hit the timeout of '{}' seconds",
+                    handler,
+                    self.instance_ctx().timeout.unwrap().as_secs()
+                ))));
+            }
+            Err(trap) => {
+                use wasmtime::TrapCode::*;
+                let trap_code = trap.trap_code();
+                let e = Error::from(trap);
+                match trap_code {
+                    Some(MemoryOutOfBounds)
+                    | Some(HeapMisaligned)
+                    | Some(TableOutOfBounds)
+                    | Some(IndirectCallToNull)
+                    | Some(BadSignature)
+                    | Some(IntegerOverflow)
+                    | Some(IntegerDivisionByZero)
+                    | Some(BadConversionToInteger)
+                    | Some(UnreachableCodeReached) => Some(e),
+                    _ if self.instance_ctx().deterministic_host_trap => Some(e),
+                    _ => {
+                        self.instance_ctx_mut().ctx.state.exit_handler();
+                        return Err(MappingError::Unknown(e));
+                    }
+                }
+            }
+        };
+
+        if let Some(deterministic_error) = deterministic_error {
+            let message = format!("{:#}", deterministic_error).replace("\n", "\t");
+
+            // Log the error and restore the updates snapshot, effectively reverting the handler.
+            error!(&self.instance_ctx().ctx.logger,
+                "Handler skipped due to execution failure";
+                "handler" => handler,
+                "error" => &message,
+            );
+            let subgraph_error = SubgraphError {
+                subgraph_id: self.instance_ctx().ctx.host_exports.subgraph_id.clone(),
+                message,
+                block_ptr: Some(self.instance_ctx().ctx.block_ptr.cheap_clone()),
+                handler: Some(handler.to_string()),
+                deterministic: true,
+            };
+            self.instance_ctx_mut()
+                .ctx
+                .state
+                .exit_handler_and_discard_changes_due_to_error(subgraph_error);
+        } else {
+            self.instance_ctx_mut().ctx.state.exit_handler();
+        }
+
+        let gas = self.gas.get();
+        Ok((self.take_ctx().ctx.state, gas))
+    }
+}
+
+#[derive(Copy, Clone)]
+pub struct ExperimentalFeatures {
+    pub allow_non_deterministic_ipfs: bool,
+}
+
+pub struct WasmInstanceContext<C: Blockchain> {
+    // In the future there may be multiple memories, but currently there is only one memory per
+    // module. And at least AS calls it "memory". There is no uninitialized memory in Wasm, memory
+    // is zeroed when initialized or grown.
+    memory: Memory,
+
+    // Function exported by the wasm module that will allocate the request number of bytes and
+    // return a pointer to the first byte of allocated space.
+    memory_allocate: wasmtime::TypedFunc<i32, i32>,
+
+    // Function wrapper for `idof<T>` from AssemblyScript
+    id_of_type: Option<wasmtime::TypedFunc<u32, u32>>,
+
+    pub ctx: MappingContext<C>,
+    pub valid_module: Arc<ValidModule>,
+    pub host_metrics: Arc<HostMetrics>,
+    pub(crate) timeout: Option<Duration>,
+
+    // Used by ipfs.map.
+    pub(crate) timeout_stopwatch: Arc<std::sync::Mutex<TimeoutStopwatch>>,
+
+    // First free byte in the current arena. Set on the first call to `raw_new`.
+    arena_start_ptr: i32,
+
+    // Number of free bytes starting from `arena_start_ptr`.
+    arena_free_size: i32,
+
+    // A trap ocurred due to a possible reorg detection.
+    pub possible_reorg: bool,
+
+    // A host export trap ocurred for a deterministic reason.
+    pub deterministic_host_trap: bool,
+
+    pub(crate) experimental_features: ExperimentalFeatures,
+}
+
+impl<C: Blockchain> WasmInstance<C> {
+    /// Instantiates the module and sets it to be interrupted after `timeout`.
+    pub fn from_valid_module_with_ctx(
+        valid_module: Arc<ValidModule>,
+        ctx: MappingContext<C>,
+        host_metrics: Arc<HostMetrics>,
+        timeout: Option<Duration>,
+        experimental_features: ExperimentalFeatures,
+    ) -> Result<WasmInstance<C>, anyhow::Error> {
+        let mut linker = wasmtime::Linker::new(&wasmtime::Store::new(valid_module.module.engine()));
+        let host_fns = ctx.host_fns.cheap_clone();
+        let api_version = ctx.host_exports.api_version.clone();
+
+        // Used by exports to access the instance context. There are two ways this can be set:
+        // - After instantiation, if no host export is called in the start function.
+        // - During the start function, if it calls a host export.
+        // Either way, after instantiation this will have been set.
+        let shared_ctx: Rc<RefCell<Option<WasmInstanceContext<C>>>> = Rc::new(RefCell::new(None));
+
+        // We will move the ctx only once, to init `shared_ctx`. But we don't statically know where
+        // it will be moved so we need this ugly thing.
+        let ctx: Rc<RefCell<Option<MappingContext<C>>>> = Rc::new(RefCell::new(Some(ctx)));
+
+        // Start the timeout watchdog task.
+        let timeout_stopwatch = Arc::new(std::sync::Mutex::new(TimeoutStopwatch::start_new()));
+        if let Some(timeout) = timeout {
+            // This task is likely to outlive the instance, which is fine.
+            let interrupt_handle = linker.store().interrupt_handle().unwrap();
+            let timeout_stopwatch = timeout_stopwatch.clone();
+            graph::spawn_allow_panic(async move {
+                let minimum_wait = Duration::from_secs(1);
+                loop {
+                    let time_left =
+                        timeout.checked_sub(timeout_stopwatch.lock().unwrap().elapsed());
+                    match time_left {
+                        None => break interrupt_handle.interrupt(), // Timed out.
+
+                        Some(time) if time < minimum_wait => break interrupt_handle.interrupt(),
+                        Some(time) => tokio::time::sleep(time).await,
+                    }
+                }
+            });
+        }
+
+        // Because `gas` and `deterministic_host_trap` need to be accessed from the gas
+        // host fn, they need to be separate from the rest of the context.
+        let gas = GasCounter::default();
+        let deterministic_host_trap = Rc::new(AtomicBool::new(false));
+
+        macro_rules! link {
+            ($wasm_name:expr, $rust_name:ident, $($param:ident),*) => {
+                link!($wasm_name, $rust_name, "host_export_other", $($param),*)
+            };
+
+            ($wasm_name:expr, $rust_name:ident, $section:expr, $($param:ident),*) => {
+                let modules = valid_module
+                    .import_name_to_modules
+                    .get($wasm_name)
+                    .into_iter()
+                    .flatten();
+
+                // link an import with all the modules that require it.
+                for module in modules {
+                    let func_shared_ctx = Rc::downgrade(&shared_ctx);
+                    let valid_module = valid_module.cheap_clone();
+                    let host_metrics = host_metrics.cheap_clone();
+                    let timeout_stopwatch = timeout_stopwatch.cheap_clone();
+                    let ctx = ctx.cheap_clone();
+                    let gas = gas.cheap_clone();
+                    linker.func(
+                        module,
+                        $wasm_name,
+                        move |caller: wasmtime::Caller, $($param: u32),*| {
+                            let instance = func_shared_ctx.upgrade().unwrap();
+                            let mut instance = instance.borrow_mut();
+
+                            // Happens when calling a host fn in Wasm start.
+                            if instance.is_none() {
+                                *instance = Some(WasmInstanceContext::from_caller(
+                                    caller,
+                                    ctx.borrow_mut().take().unwrap(),
+                                    valid_module.cheap_clone(),
+                                    host_metrics.cheap_clone(),
+                                    timeout,
+                                    timeout_stopwatch.cheap_clone(),
+                                    experimental_features.clone()
+                                ).unwrap())
+                            }
+
+                            let instance = instance.as_mut().unwrap();
+                            let _section = instance.host_metrics.stopwatch.start_section($section);
+
+                            let result = instance.$rust_name(
+                                &gas,
+                                $($param.into()),*
+                            );
+                            match result {
+                                Ok(result) => Ok(result.into_wasm_ret()),
+                                Err(e) => {
+                                    match IntoTrap::determinism_level(&e) {
+                                        DeterminismLevel::Deterministic => {
+                                            instance.deterministic_host_trap = true;
+                                        },
+                                        DeterminismLevel::PossibleReorg => {
+                                            instance.possible_reorg = true;
+                                        },
+                                        DeterminismLevel::Unimplemented | DeterminismLevel::NonDeterministic => {},
+                                    }
+
+                                    Err(IntoTrap::into_trap(e))
+                                }
+                            }
+                        }
+                    )?;
+                }
+            };
+        }
+
+        // Link chain-specifc host fns.
+        for host_fn in host_fns.iter() {
+            let modules = valid_module
+                .import_name_to_modules
+                .get(host_fn.name)
+                .into_iter()
+                .flatten();
+
+            for module in modules {
+                let func_shared_ctx = Rc::downgrade(&shared_ctx);
+                let host_fn = host_fn.cheap_clone();
+                let gas = gas.cheap_clone();
+                linker.func(module, host_fn.name, move |call_ptr: u32| {
+                    let start = Instant::now();
+                    let instance = func_shared_ctx.upgrade().unwrap();
+                    let mut instance = instance.borrow_mut();
+
+                    let instance = match &mut *instance {
+                        Some(instance) => instance,
+
+                        // Happens when calling a host fn in Wasm start.
+                        None => {
+                            return Err(anyhow!(
+                                "{} is not allowed in global variables",
+                                host_fn.name
+                            )
+                            .into());
+                        }
+                    };
+
+                    let name_for_metrics = host_fn.name.replace('.', "_");
+                    let stopwatch = &instance.host_metrics.stopwatch;
+                    let _section =
+                        stopwatch.start_section(&format!("host_export_{}", name_for_metrics));
+
+                    let ctx = HostFnCtx {
+                        logger: instance.ctx.logger.cheap_clone(),
+                        block_ptr: instance.ctx.block_ptr.cheap_clone(),
+                        heap: instance,
+                        gas: gas.cheap_clone(),
+                    };
+                    let ret = (host_fn.func)(ctx, call_ptr).map_err(|e| match e {
+                        HostExportError::Deterministic(e) => {
+                            instance.deterministic_host_trap = true;
+                            e
+                        }
+                        HostExportError::PossibleReorg(e) => {
+                            instance.possible_reorg = true;
+                            e
+                        }
+                        HostExportError::Unknown(e) => e,
+                    })?;
+                    instance.host_metrics.observe_host_fn_execution_time(
+                        start.elapsed().as_secs_f64(),
+                        &name_for_metrics,
+                    );
+                    Ok(ret)
+                })?;
+            }
+        }
+
+        link!("ethereum.encode", ethereum_encode, params_ptr);
+        link!("ethereum.decode", ethereum_decode, params_ptr, data_ptr);
+
+        link!("abort", abort, message_ptr, file_name_ptr, line, column);
+
+        link!("store.get", store_get, "host_export_store_get", entity, id);
+        link!(
+            "store.set",
+            store_set,
+            "host_export_store_set",
+            entity,
+            id,
+            data
+        );
+
+        // All IPFS-related functions exported by the host WASM runtime should be listed in the
+        // graph::data::subgraph::features::IPFS_ON_ETHEREUM_CONTRACTS_FUNCTION_NAMES array for
+        // automatic feature detection to work.
+        //
+        // For reference, search this codebase for: ff652476-e6ad-40e4-85b8-e815d6c6e5e2
+        link!("ipfs.cat", ipfs_cat, "host_export_ipfs_cat", hash_ptr);
+        link!(
+            "ipfs.map",
+            ipfs_map,
+            "host_export_ipfs_map",
+            link_ptr,
+            callback,
+            user_data,
+            flags
+        );
+        // The previous ipfs-related functions are unconditionally linked for backward compatibility
+        if experimental_features.allow_non_deterministic_ipfs {
+            link!(
+                "ipfs.getBlock",
+                ipfs_get_block,
+                "host_export_ipfs_get_block",
+                hash_ptr
+            );
+        }
+
+        link!("store.remove", store_remove, entity_ptr, id_ptr);
+
+        link!("typeConversion.bytesToString", bytes_to_string, ptr);
+        link!("typeConversion.bytesToHex", bytes_to_hex, ptr);
+        link!("typeConversion.bigIntToString", big_int_to_string, ptr);
+        link!("typeConversion.bigIntToHex", big_int_to_hex, ptr);
+        link!("typeConversion.stringToH160", string_to_h160, ptr);
+        link!("typeConversion.bytesToBase58", bytes_to_base58, ptr);
+
+        link!("json.fromBytes", json_from_bytes, ptr);
+        link!("json.try_fromBytes", json_try_from_bytes, ptr);
+        link!("json.toI64", json_to_i64, ptr);
+        link!("json.toU64", json_to_u64, ptr);
+        link!("json.toF64", json_to_f64, ptr);
+        link!("json.toBigInt", json_to_big_int, ptr);
+
+        link!("crypto.keccak256", crypto_keccak_256, ptr);
+
+        link!("bigInt.plus", big_int_plus, x_ptr, y_ptr);
+        link!("bigInt.minus", big_int_minus, x_ptr, y_ptr);
+        link!("bigInt.times", big_int_times, x_ptr, y_ptr);
+        link!("bigInt.dividedBy", big_int_divided_by, x_ptr, y_ptr);
+        link!("bigInt.dividedByDecimal", big_int_divided_by_decimal, x, y);
+        link!("bigInt.mod", big_int_mod, x_ptr, y_ptr);
+        link!("bigInt.pow", big_int_pow, x_ptr, exp);
+        link!("bigInt.fromString", big_int_from_string, ptr);
+        link!("bigInt.bitOr", big_int_bit_or, x_ptr, y_ptr);
+        link!("bigInt.bitAnd", big_int_bit_and, x_ptr, y_ptr);
+        link!("bigInt.leftShift", big_int_left_shift, x_ptr, bits);
+        link!("bigInt.rightShift", big_int_right_shift, x_ptr, bits);
+
+        link!("bigDecimal.toString", big_decimal_to_string, ptr);
+        link!("bigDecimal.fromString", big_decimal_from_string, ptr);
+        link!("bigDecimal.plus", big_decimal_plus, x_ptr, y_ptr);
+        link!("bigDecimal.minus", big_decimal_minus, x_ptr, y_ptr);
+        link!("bigDecimal.times", big_decimal_times, x_ptr, y_ptr);
+        link!("bigDecimal.dividedBy", big_decimal_divided_by, x, y);
+        link!("bigDecimal.equals", big_decimal_equals, x_ptr, y_ptr);
+
+        link!("dataSource.create", data_source_create, name, params);
+        link!(
+            "dataSource.createWithContext",
+            data_source_create_with_context,
+            name,
+            params,
+            context
+        );
+        link!("dataSource.address", data_source_address,);
+        link!("dataSource.network", data_source_network,);
+        link!("dataSource.context", data_source_context,);
+
+        link!("ens.nameByHash", ens_name_by_hash, ptr);
+
+        link!("log.log", log_log, level, msg_ptr);
+
+        // `arweave and `box` functionality was removed, but apiVersion <= 0.0.4 must link it.
+        if api_version <= Version::new(0, 0, 4) {
+            link!("arweave.transactionData", arweave_transaction_data, ptr);
+            link!("box.profile", box_profile, ptr);
+        }
+
+        // link the `gas` function
+        // See also e3f03e62-40e4-4f8c-b4a1-d0375cca0b76
+        {
+            let gas = gas.cheap_clone();
+            linker.func("gas", "gas", move |gas_used: u32| -> Result<(), Trap> {
+                // Gas metering has a relevant execution cost cost, being called tens of thousands
+                // of times per handler, but it's not worth having a stopwatch section here because
+                // the cost of measuring would be greater than the cost of `consume_host_fn`. Last
+                // time this was benchmarked it took < 100ns to run.
+                if let Err(e) = gas.consume_host_fn(gas_used.saturating_into()) {
+                    deterministic_host_trap.store(true, Ordering::SeqCst);
+                    return Err(e.into_trap());
+                }
+
+                Ok(())
+            })?;
+        }
+
+        let instance = linker.instantiate(&valid_module.module)?;
+
+        // Usually `shared_ctx` is still `None` because no host fns were called during start.
+        if shared_ctx.borrow().is_none() {
+            *shared_ctx.borrow_mut() = Some(WasmInstanceContext::from_instance(
+                &instance,
+                ctx.borrow_mut().take().unwrap(),
+                valid_module,
+                host_metrics,
+                timeout,
+                timeout_stopwatch,
+                experimental_features,
+            )?);
+        }
+
+        match api_version {
+            version if version <= Version::new(0, 0, 4) => {}
+            _ => {
+                instance
+                    .get_func("_start")
+                    .context("`_start` function not found")?
+                    .typed::<(), ()>()?
+                    .call(())?;
+            }
+        }
+
+        Ok(WasmInstance {
+            instance,
+            instance_ctx: shared_ctx,
+            gas,
+        })
+    }
+}
+
+impl<C: Blockchain> AscHeap for WasmInstanceContext<C> {
+    fn raw_new(&mut self, bytes: &[u8], gas: &GasCounter) -> Result<u32, DeterministicHostError> {
+        // The cost of writing to wasm memory from the host is the same as of writing from wasm
+        // using load instructions.
+        gas.consume_host_fn(Gas::new(GAS_COST_STORE as u64 * bytes.len() as u64))?;
+
+        // We request large chunks from the AssemblyScript allocator to use as arenas that we
+        // manage directly.
+
+        static MIN_ARENA_SIZE: i32 = 10_000;
+
+        let size = i32::try_from(bytes.len()).unwrap();
+        if size > self.arena_free_size {
+            // Allocate a new arena. Any free space left in the previous arena is left unused. This
+            // causes at most half of memory to be wasted, which is acceptable.
+            let arena_size = size.max(MIN_ARENA_SIZE);
+
+            // Unwrap: This may panic if more memory needs to be requested from the OS and that
+            // fails. This error is not deterministic since it depends on the operating conditions
+            // of the node.
+            self.arena_start_ptr = self.memory_allocate.call(arena_size).unwrap();
+            self.arena_free_size = arena_size;
+
+            match &self.ctx.host_exports.api_version {
+                version if *version <= Version::new(0, 0, 4) => {}
+                _ => {
+                    // This arithmetic is done because when you call AssemblyScripts's `__alloc`
+                    // function, it isn't typed and it just returns `mmInfo` on it's header,
+                    // differently from allocating on regular types (`__new` for example).
+                    // `mmInfo` has size of 4, and everything allocated on AssemblyScript memory
+                    // should have alignment of 16, this means we need to do a 12 offset on these
+                    // big chunks of untyped allocation.
+                    self.arena_start_ptr += 12;
+                    self.arena_free_size -= 12;
+                }
+            };
+        };
+
+        let ptr = self.arena_start_ptr as usize;
+
+        // Unwrap: We have just allocated enough space for `bytes`.
+        self.memory.write(ptr, bytes).unwrap();
+        self.arena_start_ptr += size;
+        self.arena_free_size -= size;
+
+        Ok(ptr as u32)
+    }
+
+    fn read_u32(&self, offset: u32, gas: &GasCounter) -> Result<u32, DeterministicHostError> {
+        gas.consume_host_fn(Gas::new(GAS_COST_LOAD as u64 * 4))?;
+        let mut bytes = [0; 4];
+        self.memory.read(offset as usize, &mut bytes).map_err(|_| {
+            DeterministicHostError::from(anyhow!(
+                "Heap access out of bounds. Offset: {} Size: {}",
+                offset,
+                4
+            ))
+        })?;
+        Ok(u32::from_le_bytes(bytes))
+    }
+
+    fn read<'a>(
+        &self,
+        offset: u32,
+        buffer: &'a mut [MaybeUninit<u8>],
+        gas: &GasCounter,
+    ) -> Result<&'a mut [u8], DeterministicHostError> {
+        // The cost of reading wasm memory from the host is the same as of reading from wasm using
+        // load instructions.
+        gas.consume_host_fn(Gas::new(GAS_COST_LOAD as u64 * (buffer.len() as u64)))?;
+
+        let offset = offset as usize;
+
+        unsafe {
+            // Safety: This was copy-pasted from Memory::read, and we ensure
+            // nothing else is writing this memory because we don't call into
+            // WASM here.
+            let src = self
+                .memory
+                .data_unchecked()
+                .get(offset..)
+                .and_then(|s| s.get(..buffer.len()))
+                .ok_or(DeterministicHostError::from(anyhow!(
+                    "Heap access out of bounds. Offset: {} Size: {}",
+                    offset,
+                    buffer.len()
+                )))?;
+
+            Ok(init_slice(src, buffer))
+        }
+    }
+
+    fn api_version(&self) -> Version {
+        self.ctx.host_exports.api_version.clone()
+    }
+
+    fn asc_type_id(
+        &mut self,
+        type_id_index: IndexForAscTypeId,
+    ) -> Result<u32, DeterministicHostError> {
+        let type_id = self
+            .id_of_type
+            .as_ref()
+            .unwrap() // Unwrap ok because it's only called on correct apiVersion, look for AscPtr::generate_header
+            .call(type_id_index as u32)
+            .with_context(|| format!("Failed to call 'asc_type_id' with '{:?}'", type_id_index))
+            .map_err(DeterministicHostError::from)?;
+        Ok(type_id)
+    }
+}
+
+impl<C: Blockchain> WasmInstanceContext<C> {
+    pub fn from_instance(
+        instance: &wasmtime::Instance,
+        ctx: MappingContext<C>,
+        valid_module: Arc<ValidModule>,
+        host_metrics: Arc<HostMetrics>,
+        timeout: Option<Duration>,
+        timeout_stopwatch: Arc<std::sync::Mutex<TimeoutStopwatch>>,
+        experimental_features: ExperimentalFeatures,
+    ) -> Result<Self, anyhow::Error> {
+        // Provide access to the WASM runtime linear memory
+        let memory = instance
+            .get_memory("memory")
+            .context("Failed to find memory export in the WASM module")?;
+
+        let memory_allocate = match &ctx.host_exports.api_version {
+            version if *version <= Version::new(0, 0, 4) => instance
+                .get_func("memory.allocate")
+                .context("`memory.allocate` function not found"),
+            _ => instance
+                .get_func("allocate")
+                .context("`allocate` function not found"),
+        }?
+        .typed()?
+        .clone();
+
+        let id_of_type = match &ctx.host_exports.api_version {
+            version if *version <= Version::new(0, 0, 4) => None,
+            _ => Some(
+                instance
+                    .get_func("id_of_type")
+                    .context("`id_of_type` function not found")?
+                    .typed()?
+                    .clone(),
+            ),
+        };
+
+        Ok(WasmInstanceContext {
+            memory_allocate,
+            id_of_type,
+            memory,
+            ctx,
+            valid_module,
+            host_metrics,
+            timeout,
+            timeout_stopwatch,
+            arena_free_size: 0,
+            arena_start_ptr: 0,
+            possible_reorg: false,
+            deterministic_host_trap: false,
+            experimental_features,
+        })
+    }
+
+    pub fn from_caller(
+        caller: wasmtime::Caller,
+        ctx: MappingContext<C>,
+        valid_module: Arc<ValidModule>,
+        host_metrics: Arc<HostMetrics>,
+        timeout: Option<Duration>,
+        timeout_stopwatch: Arc<std::sync::Mutex<TimeoutStopwatch>>,
+        experimental_features: ExperimentalFeatures,
+    ) -> Result<Self, anyhow::Error> {
+        let memory = caller
+            .get_export("memory")
+            .and_then(|e| e.into_memory())
+            .context("Failed to find memory export in the WASM module")?;
+
+        let memory_allocate = match &ctx.host_exports.api_version {
+            version if *version <= Version::new(0, 0, 4) => caller
+                .get_export("memory.allocate")
+                .and_then(|e| e.into_func())
+                .context("`memory.allocate` function not found"),
+            _ => caller
+                .get_export("allocate")
+                .and_then(|e| e.into_func())
+                .context("`allocate` function not found"),
+        }?
+        .typed()?
+        .clone();
+
+        let id_of_type = match &ctx.host_exports.api_version {
+            version if *version <= Version::new(0, 0, 4) => None,
+            _ => Some(
+                caller
+                    .get_export("id_of_type")
+                    .and_then(|e| e.into_func())
+                    .context("`id_of_type` function not found")?
+                    .typed()?
+                    .clone(),
+            ),
+        };
+
+        Ok(WasmInstanceContext {
+            id_of_type,
+            memory_allocate,
+            memory,
+            ctx,
+            valid_module,
+            host_metrics,
+            timeout,
+            timeout_stopwatch,
+            arena_free_size: 0,
+            arena_start_ptr: 0,
+            possible_reorg: false,
+            deterministic_host_trap: false,
+            experimental_features,
+        })
+    }
+}
+
+// Implementation of externals.
+impl<C: Blockchain> WasmInstanceContext<C> {
+    /// function abort(message?: string | null, fileName?: string | null, lineNumber?: u32, columnNumber?: u32): void
+    /// Always returns a trap.
+    pub fn abort(
+        &mut self,
+        gas: &GasCounter,
+        message_ptr: AscPtr<AscString>,
+        file_name_ptr: AscPtr<AscString>,
+        line_number: u32,
+        column_number: u32,
+    ) -> Result<Never, DeterministicHostError> {
+        let message = match message_ptr.is_null() {
+            false => Some(asc_get(self, message_ptr, gas)?),
+            true => None,
+        };
+        let file_name = match file_name_ptr.is_null() {
+            false => Some(asc_get(self, file_name_ptr, gas)?),
+            true => None,
+        };
+        let line_number = match line_number {
+            0 => None,
+            _ => Some(line_number),
+        };
+        let column_number = match column_number {
+            0 => None,
+            _ => Some(column_number),
+        };
+
+        self.ctx
+            .host_exports
+            .abort(message, file_name, line_number, column_number, gas)
+    }
+
+    /// function store.set(entity: string, id: string, data: Entity): void
+    pub fn store_set(
+        &mut self,
+        gas: &GasCounter,
+        entity_ptr: AscPtr<AscString>,
+        id_ptr: AscPtr<AscString>,
+        data_ptr: AscPtr<AscEntity>,
+    ) -> Result<(), HostExportError> {
+        let stopwatch = &self.host_metrics.stopwatch;
+        stopwatch.start_section("host_export_store_set__wasm_instance_context_store_set");
+
+        let entity = asc_get(self, entity_ptr, gas)?;
+        let id = asc_get(self, id_ptr, gas)?;
+        let data = asc_get(self, data_ptr, gas)?;
+
+        self.ctx.host_exports.store_set(
+            &self.ctx.logger,
+            &mut self.ctx.state,
+            &self.ctx.proof_of_indexing,
+            entity,
+            id,
+            data,
+            stopwatch,
+            gas,
+        )?;
+
+        Ok(())
+    }
+
+    /// function store.remove(entity: string, id: string): void
+    pub fn store_remove(
+        &mut self,
+        gas: &GasCounter,
+        entity_ptr: AscPtr<AscString>,
+        id_ptr: AscPtr<AscString>,
+    ) -> Result<(), HostExportError> {
+        let entity = asc_get(self, entity_ptr, gas)?;
+        let id = asc_get(self, id_ptr, gas)?;
+        self.ctx.host_exports.store_remove(
+            &self.ctx.logger,
+            &mut self.ctx.state,
+            &self.ctx.proof_of_indexing,
+            entity,
+            id,
+            gas,
+        )
+    }
+
+    /// function store.get(entity: string, id: string): Entity | null
+    pub fn store_get(
+        &mut self,
+        gas: &GasCounter,
+        entity_ptr: AscPtr<AscString>,
+        id_ptr: AscPtr<AscString>,
+    ) -> Result<AscPtr<AscEntity>, HostExportError> {
+        let _timer = self
+            .host_metrics
+            .cheap_clone()
+            .time_host_fn_execution_region("store_get");
+
+        let entity_type: String = asc_get(self, entity_ptr, gas)?;
+        let id: String = asc_get(self, id_ptr, gas)?;
+        let entity_option = self.ctx.host_exports.store_get(
+            &mut self.ctx.state,
+            entity_type.clone(),
+            id.clone(),
+            gas,
+        )?;
+
+        let ret = match entity_option {
+            Some(entity) => {
+                let _section = self
+                    .host_metrics
+                    .stopwatch
+                    .start_section("store_get_asc_new");
+                asc_new(self, &entity.sorted(), gas)?
+            }
+            None => match &self.ctx.debug_fork {
+                Some(fork) => {
+                    let entity_option = fork.fetch(entity_type, id).map_err(|e| {
+                        HostExportError::Unknown(anyhow!(
+                            "store_get: failed to fetch entity from the debug fork: {}",
+                            e
+                        ))
+                    })?;
+                    match entity_option {
+                        Some(entity) => {
+                            let _section = self
+                                .host_metrics
+                                .stopwatch
+                                .start_section("store_get_asc_new");
+                            let entity = asc_new(self, &entity.sorted(), gas)?;
+                            self.store_set(gas, entity_ptr, id_ptr, entity)?;
+                            entity
+                        }
+                        None => AscPtr::null(),
+                    }
+                }
+                None => AscPtr::null(),
+            },
+        };
+
+        Ok(ret)
+    }
+
+    /// function typeConversion.bytesToString(bytes: Bytes): string
+    pub fn bytes_to_string(
+        &mut self,
+        gas: &GasCounter,
+        bytes_ptr: AscPtr<Uint8Array>,
+    ) -> Result<AscPtr<AscString>, DeterministicHostError> {
+        let string = self.ctx.host_exports.bytes_to_string(
+            &self.ctx.logger,
+            asc_get(self, bytes_ptr, gas)?,
+            gas,
+        )?;
+        asc_new(self, &string, gas)
+    }
+
+    /// Converts bytes to a hex string.
+    /// function typeConversion.bytesToHex(bytes: Bytes): string
+    /// References:
+    /// https://godoc.org/github.com/ethereum/go-ethereum/common/hexutil#hdr-Encoding_Rules
+    /// https://github.com/ethereum/web3.js/blob/f98fe1462625a6c865125fecc9cb6b414f0a5e83/packages/web3-utils/src/utils.js#L283
+    pub fn bytes_to_hex(
+        &mut self,
+        gas: &GasCounter,
+        bytes_ptr: AscPtr<Uint8Array>,
+    ) -> Result<AscPtr<AscString>, DeterministicHostError> {
+        let bytes: Vec<u8> = asc_get(self, bytes_ptr, gas)?;
+        gas.consume_host_fn(gas::DEFAULT_GAS_OP.with_args(gas::complexity::Size, &bytes))?;
+
+        // Even an empty string must be prefixed with `0x`.
+        // Encodes each byte as a two hex digits.
+        let hex = format!("0x{}", hex::encode(bytes));
+        asc_new(self, &hex, gas)
+    }
+
+    /// function typeConversion.bigIntToString(n: Uint8Array): string
+    pub fn big_int_to_string(
+        &mut self,
+        gas: &GasCounter,
+        big_int_ptr: AscPtr<AscBigInt>,
+    ) -> Result<AscPtr<AscString>, DeterministicHostError> {
+        let n: BigInt = asc_get(self, big_int_ptr, gas)?;
+        gas.consume_host_fn(gas::DEFAULT_GAS_OP.with_args(gas::complexity::Size, &n))?;
+        asc_new(self, &n.to_string(), gas)
+    }
+
+    /// function bigInt.fromString(x: string): BigInt
+    pub fn big_int_from_string(
+        &mut self,
+        gas: &GasCounter,
+        string_ptr: AscPtr<AscString>,
+    ) -> Result<AscPtr<AscBigInt>, DeterministicHostError> {
+        let result = self
+            .ctx
+            .host_exports
+            .big_int_from_string(asc_get(self, string_ptr, gas)?, gas)?;
+        asc_new(self, &result, gas)
+    }
+
+    /// function typeConversion.bigIntToHex(n: Uint8Array): string
+    pub fn big_int_to_hex(
+        &mut self,
+        gas: &GasCounter,
+        big_int_ptr: AscPtr<AscBigInt>,
+    ) -> Result<AscPtr<AscString>, DeterministicHostError> {
+        let n: BigInt = asc_get(self, big_int_ptr, gas)?;
+        let hex = self.ctx.host_exports.big_int_to_hex(n, gas)?;
+        asc_new(self, &hex, gas)
+    }
+
+    /// function typeConversion.stringToH160(s: String): H160
+    pub fn string_to_h160(
+        &mut self,
+        gas: &GasCounter,
+        str_ptr: AscPtr<AscString>,
+    ) -> Result<AscPtr<AscH160>, DeterministicHostError> {
+        let s: String = asc_get(self, str_ptr, gas)?;
+        let h160 = self.ctx.host_exports.string_to_h160(&s, gas)?;
+        asc_new(self, &h160, gas)
+    }
+
+    /// function json.fromBytes(bytes: Bytes): JSONValue
+    pub fn json_from_bytes(
+        &mut self,
+        gas: &GasCounter,
+        bytes_ptr: AscPtr<Uint8Array>,
+    ) -> Result<AscPtr<AscEnum<JsonValueKind>>, DeterministicHostError> {
+        let bytes: Vec<u8> = asc_get(self, bytes_ptr, gas)?;
+        let result = self
+            .ctx
+            .host_exports
+            .json_from_bytes(&bytes, gas)
+            .with_context(|| {
+                format!(
+                    "Failed to parse JSON from byte array. Bytes (truncated to 1024 chars): `{:?}`",
+                    &bytes[..bytes.len().min(1024)],
+                )
+            })
+            .map_err(DeterministicHostError::from)?;
+        asc_new(self, &result, gas)
+    }
+
+    /// function json.try_fromBytes(bytes: Bytes): Result<JSONValue, boolean>
+    pub fn json_try_from_bytes(
+        &mut self,
+        gas: &GasCounter,
+        bytes_ptr: AscPtr<Uint8Array>,
+    ) -> Result<AscPtr<AscResult<AscPtr<AscEnum<JsonValueKind>>, bool>>, DeterministicHostError>
+    {
+        let bytes: Vec<u8> = asc_get(self, bytes_ptr, gas)?;
+        let result = self
+            .ctx
+            .host_exports
+            .json_from_bytes(&bytes, gas)
+            .map_err(|e| {
+                warn!(
+                    &self.ctx.logger,
+                    "Failed to parse JSON from byte array";
+                    "bytes" => format!("{:?}", bytes),
+                    "error" => format!("{}", e)
+                );
+
+                // Map JSON errors to boolean to match the `Result<JSONValue, boolean>`
+                // result type expected by mappings
+                true
+            });
+        asc_new(self, &result, gas)
+    }
+
+    /// function ipfs.cat(link: String): Bytes
+    pub fn ipfs_cat(
+        &mut self,
+        gas: &GasCounter,
+        link_ptr: AscPtr<AscString>,
+    ) -> Result<AscPtr<Uint8Array>, HostExportError> {
+        // Note on gas: There is no gas costing for the ipfs call itself,
+        // since it's not enabled on the network.
+
+        if !self.experimental_features.allow_non_deterministic_ipfs {
+            return Err(HostExportError::Deterministic(anyhow!(
+                "`ipfs.cat` is deprecated. Improved support for IPFS will be added in the future"
+            )));
+        }
+
+        let link = asc_get(self, link_ptr, gas)?;
+        let ipfs_res = self.ctx.host_exports.ipfs_cat(&self.ctx.logger, link);
+        match ipfs_res {
+            Ok(bytes) => asc_new(self, &*bytes, gas).map_err(Into::into),
+
+            // Return null in case of error.
+            Err(e) => {
+                info!(&self.ctx.logger, "Failed ipfs.cat, returning `null`";
+                                    "link" => asc_get::<String, _, _>(self, link_ptr, gas)?,
+                                    "error" => e.to_string());
+                Ok(AscPtr::null())
+            }
+        }
+    }
+
+    /// function ipfs.getBlock(link: String): Bytes
+    pub fn ipfs_get_block(
+        &mut self,
+        gas: &GasCounter,
+        link_ptr: AscPtr<AscString>,
+    ) -> Result<AscPtr<Uint8Array>, HostExportError> {
+        // Note on gas: There is no gas costing for the ipfs call itself,
+        // since it's not enabled on the network.
+
+        if !self.experimental_features.allow_non_deterministic_ipfs {
+            return Err(HostExportError::Deterministic(anyhow!(
+                "`ipfs.getBlock` is deprecated. Improved support for IPFS will be added in the future"
+            )));
+        }
+
+        let link = asc_get(self, link_ptr, gas)?;
+        let ipfs_res = self.ctx.host_exports.ipfs_get_block(&self.ctx.logger, link);
+        match ipfs_res {
+            Ok(bytes) => asc_new(self, &*bytes, gas).map_err(Into::into),
+
+            // Return null in case of error.
+            Err(e) => {
+                info!(&self.ctx.logger, "Failed ipfs.getBlock, returning `null`";
+                                    "link" => asc_get::<String, _, _>(self, link_ptr, gas)?,
+                                    "error" => e.to_string());
+                Ok(AscPtr::null())
+            }
+        }
+    }
+
+    /// function ipfs.map(link: String, callback: String, flags: String[]): void
+    pub fn ipfs_map(
+        &mut self,
+        gas: &GasCounter,
+        link_ptr: AscPtr<AscString>,
+        callback: AscPtr<AscString>,
+        user_data: AscPtr<AscEnum<StoreValueKind>>,
+        flags: AscPtr<Array<AscPtr<AscString>>>,
+    ) -> Result<(), HostExportError> {
+        // Note on gas:
+        // Ideally we would consume gas the same as ipfs_cat and then share
+        // gas across the spawned modules for callbacks.
+
+        if !self.experimental_features.allow_non_deterministic_ipfs {
+            return Err(HostExportError::Deterministic(anyhow!(
+                "`ipfs.map` is deprecated. Improved support for IPFS will be added in the future"
+            )));
+        }
+
+        let link: String = asc_get(self, link_ptr, gas)?;
+        let callback: String = asc_get(self, callback, gas)?;
+        let user_data: store::Value = asc_get(self, user_data, gas)?;
+
+        let flags = asc_get(self, flags, gas)?;
+
+        // Pause the timeout while running ipfs_map, ensure it will be restarted by using a guard.
+        self.timeout_stopwatch.lock().unwrap().stop();
+        let defer_stopwatch = self.timeout_stopwatch.clone();
+        let _stopwatch_guard = defer::defer(|| defer_stopwatch.lock().unwrap().start());
+
+        let start_time = Instant::now();
+        let output_states = HostExports::ipfs_map(
+            &self.ctx.host_exports.link_resolver.clone(),
+            self,
+            link.clone(),
+            &*callback,
+            user_data,
+            flags,
+        )?;
+
+        debug!(
+            &self.ctx.logger,
+            "Successfully processed file with ipfs.map";
+            "link" => &link,
+            "callback" => &*callback,
+            "n_calls" => output_states.len(),
+            "time" => format!("{}ms", start_time.elapsed().as_millis())
+        );
+        for output_state in output_states {
+            self.ctx.state.extend(output_state);
+        }
+
+        Ok(())
+    }
+
+    /// Expects a decimal string.
+    /// function json.toI64(json: String): i64
+    pub fn json_to_i64(
+        &mut self,
+        gas: &GasCounter,
+        json_ptr: AscPtr<AscString>,
+    ) -> Result<i64, DeterministicHostError> {
+        self.ctx
+            .host_exports
+            .json_to_i64(asc_get(self, json_ptr, gas)?, gas)
+    }
+
+    /// Expects a decimal string.
+    /// function json.toU64(json: String): u64
+    pub fn json_to_u64(
+        &mut self,
+        gas: &GasCounter,
+        json_ptr: AscPtr<AscString>,
+    ) -> Result<u64, DeterministicHostError> {
+        self.ctx
+            .host_exports
+            .json_to_u64(asc_get(self, json_ptr, gas)?, gas)
+    }
+
+    /// Expects a decimal string.
+    /// function json.toF64(json: String): f64
+    pub fn json_to_f64(
+        &mut self,
+        gas: &GasCounter,
+        json_ptr: AscPtr<AscString>,
+    ) -> Result<f64, DeterministicHostError> {
+        self.ctx
+            .host_exports
+            .json_to_f64(asc_get(self, json_ptr, gas)?, gas)
+    }
+
+    /// Expects a decimal string.
+    /// function json.toBigInt(json: String): BigInt
+    pub fn json_to_big_int(
+        &mut self,
+        gas: &GasCounter,
+        json_ptr: AscPtr<AscString>,
+    ) -> Result<AscPtr<AscBigInt>, DeterministicHostError> {
+        let big_int = self
+            .ctx
+            .host_exports
+            .json_to_big_int(asc_get(self, json_ptr, gas)?, gas)?;
+        asc_new(self, &*big_int, gas)
+    }
+
+    /// function crypto.keccak256(input: Bytes): Bytes
+    pub fn crypto_keccak_256(
+        &mut self,
+        gas: &GasCounter,
+        input_ptr: AscPtr<Uint8Array>,
+    ) -> Result<AscPtr<Uint8Array>, DeterministicHostError> {
+        let input = self
+            .ctx
+            .host_exports
+            .crypto_keccak_256(asc_get(self, input_ptr, gas)?, gas)?;
+        asc_new(self, input.as_ref(), gas)
+    }
+
+    /// function bigInt.plus(x: BigInt, y: BigInt): BigInt
+    pub fn big_int_plus(
+        &mut self,
+        gas: &GasCounter,
+        x_ptr: AscPtr<AscBigInt>,
+        y_ptr: AscPtr<AscBigInt>,
+    ) -> Result<AscPtr<AscBigInt>, DeterministicHostError> {
+        let result = self.ctx.host_exports.big_int_plus(
+            asc_get(self, x_ptr, gas)?,
+            asc_get(self, y_ptr, gas)?,
+            gas,
+        )?;
+        asc_new(self, &result, gas)
+    }
+
+    /// function bigInt.minus(x: BigInt, y: BigInt): BigInt
+    pub fn big_int_minus(
+        &mut self,
+        gas: &GasCounter,
+        x_ptr: AscPtr<AscBigInt>,
+        y_ptr: AscPtr<AscBigInt>,
+    ) -> Result<AscPtr<AscBigInt>, DeterministicHostError> {
+        let result = self.ctx.host_exports.big_int_minus(
+            asc_get(self, x_ptr, gas)?,
+            asc_get(self, y_ptr, gas)?,
+            gas,
+        )?;
+        asc_new(self, &result, gas)
+    }
+
+    /// function bigInt.times(x: BigInt, y: BigInt): BigInt
+    pub fn big_int_times(
+        &mut self,
+        gas: &GasCounter,
+        x_ptr: AscPtr<AscBigInt>,
+        y_ptr: AscPtr<AscBigInt>,
+    ) -> Result<AscPtr<AscBigInt>, DeterministicHostError> {
+        let result = self.ctx.host_exports.big_int_times(
+            asc_get(self, x_ptr, gas)?,
+            asc_get(self, y_ptr, gas)?,
+            gas,
+        )?;
+        asc_new(self, &result, gas)
+    }
+
+    /// function bigInt.dividedBy(x: BigInt, y: BigInt): BigInt
+    pub fn big_int_divided_by(
+        &mut self,
+        gas: &GasCounter,
+        x_ptr: AscPtr<AscBigInt>,
+        y_ptr: AscPtr<AscBigInt>,
+    ) -> Result<AscPtr<AscBigInt>, DeterministicHostError> {
+        let result = self.ctx.host_exports.big_int_divided_by(
+            asc_get(self, x_ptr, gas)?,
+            asc_get(self, y_ptr, gas)?,
+            gas,
+        )?;
+        asc_new(self, &result, gas)
+    }
+
+    /// function bigInt.dividedByDecimal(x: BigInt, y: BigDecimal): BigDecimal
+    pub fn big_int_divided_by_decimal(
+        &mut self,
+        gas: &GasCounter,
+        x_ptr: AscPtr<AscBigInt>,
+        y_ptr: AscPtr<AscBigDecimal>,
+    ) -> Result<AscPtr<AscBigDecimal>, DeterministicHostError> {
+        let x = BigDecimal::new(asc_get(self, x_ptr, gas)?, 0);
+        let result =
+            self.ctx
+                .host_exports
+                .big_decimal_divided_by(x, asc_get(self, y_ptr, gas)?, gas)?;
+        asc_new(self, &result, gas)
+    }
+
+    /// function bigInt.mod(x: BigInt, y: BigInt): BigInt
+    pub fn big_int_mod(
+        &mut self,
+        gas: &GasCounter,
+        x_ptr: AscPtr<AscBigInt>,
+        y_ptr: AscPtr<AscBigInt>,
+    ) -> Result<AscPtr<AscBigInt>, DeterministicHostError> {
+        let result = self.ctx.host_exports.big_int_mod(
+            asc_get(self, x_ptr, gas)?,
+            asc_get(self, y_ptr, gas)?,
+            gas,
+        )?;
+        asc_new(self, &result, gas)
+    }
+
+    /// function bigInt.pow(x: BigInt, exp: u8): BigInt
+    pub fn big_int_pow(
+        &mut self,
+        gas: &GasCounter,
+        x_ptr: AscPtr<AscBigInt>,
+        exp: u32,
+    ) -> Result<AscPtr<AscBigInt>, DeterministicHostError> {
+        let exp = u8::try_from(exp).map_err(|e| DeterministicHostError::from(Error::from(e)))?;
+        let result = self
+            .ctx
+            .host_exports
+            .big_int_pow(asc_get(self, x_ptr, gas)?, exp, gas)?;
+        asc_new(self, &result, gas)
+    }
+
+    /// function bigInt.bitOr(x: BigInt, y: BigInt): BigInt
+    pub fn big_int_bit_or(
+        &mut self,
+        gas: &GasCounter,
+        x_ptr: AscPtr<AscBigInt>,
+        y_ptr: AscPtr<AscBigInt>,
+    ) -> Result<AscPtr<AscBigInt>, DeterministicHostError> {
+        let result = self.ctx.host_exports.big_int_bit_or(
+            asc_get(self, x_ptr, gas)?,
+            asc_get(self, y_ptr, gas)?,
+            gas,
+        )?;
+        asc_new(self, &result, gas)
+    }
+
+    /// function bigInt.bitAnd(x: BigInt, y: BigInt): BigInt
+    pub fn big_int_bit_and(
+        &mut self,
+        gas: &GasCounter,
+        x_ptr: AscPtr<AscBigInt>,
+        y_ptr: AscPtr<AscBigInt>,
+    ) -> Result<AscPtr<AscBigInt>, DeterministicHostError> {
+        let result = self.ctx.host_exports.big_int_bit_and(
+            asc_get(self, x_ptr, gas)?,
+            asc_get(self, y_ptr, gas)?,
+            gas,
+        )?;
+        asc_new(self, &result, gas)
+    }
+
+    /// function bigInt.leftShift(x: BigInt, bits: u8): BigInt
+    pub fn big_int_left_shift(
+        &mut self,
+        gas: &GasCounter,
+        x_ptr: AscPtr<AscBigInt>,
+        bits: u32,
+    ) -> Result<AscPtr<AscBigInt>, DeterministicHostError> {
+        let bits = u8::try_from(bits).map_err(|e| DeterministicHostError::from(Error::from(e)))?;
+        let result =
+            self.ctx
+                .host_exports
+                .big_int_left_shift(asc_get(self, x_ptr, gas)?, bits, gas)?;
+        asc_new(self, &result, gas)
+    }
+
+    /// function bigInt.rightShift(x: BigInt, bits: u8): BigInt
+    pub fn big_int_right_shift(
+        &mut self,
+        gas: &GasCounter,
+        x_ptr: AscPtr<AscBigInt>,
+        bits: u32,
+    ) -> Result<AscPtr<AscBigInt>, DeterministicHostError> {
+        let bits = u8::try_from(bits).map_err(|e| DeterministicHostError::from(Error::from(e)))?;
+        let result =
+            self.ctx
+                .host_exports
+                .big_int_right_shift(asc_get(self, x_ptr, gas)?, bits, gas)?;
+        asc_new(self, &result, gas)
+    }
+
+    /// function typeConversion.bytesToBase58(bytes: Bytes): string
+    pub fn bytes_to_base58(
+        &mut self,
+        gas: &GasCounter,
+        bytes_ptr: AscPtr<Uint8Array>,
+    ) -> Result<AscPtr<AscString>, DeterministicHostError> {
+        let result = self
+            .ctx
+            .host_exports
+            .bytes_to_base58(asc_get(self, bytes_ptr, gas)?, gas)?;
+        asc_new(self, &result, gas)
+    }
+
+    /// function bigDecimal.toString(x: BigDecimal): string
+    pub fn big_decimal_to_string(
+        &mut self,
+        gas: &GasCounter,
+        big_decimal_ptr: AscPtr<AscBigDecimal>,
+    ) -> Result<AscPtr<AscString>, DeterministicHostError> {
+        let result = self
+            .ctx
+            .host_exports
+            .big_decimal_to_string(asc_get(self, big_decimal_ptr, gas)?, gas)?;
+        asc_new(self, &result, gas)
+    }
+
+    /// function bigDecimal.fromString(x: string): BigDecimal
+    pub fn big_decimal_from_string(
+        &mut self,
+        gas: &GasCounter,
+        string_ptr: AscPtr<AscString>,
+    ) -> Result<AscPtr<AscBigDecimal>, DeterministicHostError> {
+        let result = self
+            .ctx
+            .host_exports
+            .big_decimal_from_string(asc_get(self, string_ptr, gas)?, gas)?;
+        asc_new(self, &result, gas)
+    }
+
+    /// function bigDecimal.plus(x: BigDecimal, y: BigDecimal): BigDecimal
+    pub fn big_decimal_plus(
+        &mut self,
+        gas: &GasCounter,
+        x_ptr: AscPtr<AscBigDecimal>,
+        y_ptr: AscPtr<AscBigDecimal>,
+    ) -> Result<AscPtr<AscBigDecimal>, DeterministicHostError> {
+        let result = self.ctx.host_exports.big_decimal_plus(
+            asc_get(self, x_ptr, gas)?,
+            asc_get(self, y_ptr, gas)?,
+            gas,
+        )?;
+        asc_new(self, &result, gas)
+    }
+
+    /// function bigDecimal.minus(x: BigDecimal, y: BigDecimal): BigDecimal
+    pub fn big_decimal_minus(
+        &mut self,
+        gas: &GasCounter,
+        x_ptr: AscPtr<AscBigDecimal>,
+        y_ptr: AscPtr<AscBigDecimal>,
+    ) -> Result<AscPtr<AscBigDecimal>, DeterministicHostError> {
+        let result = self.ctx.host_exports.big_decimal_minus(
+            asc_get(self, x_ptr, gas)?,
+            asc_get(self, y_ptr, gas)?,
+            gas,
+        )?;
+        asc_new(self, &result, gas)
+    }
+
+    /// function bigDecimal.times(x: BigDecimal, y: BigDecimal): BigDecimal
+    pub fn big_decimal_times(
+        &mut self,
+        gas: &GasCounter,
+        x_ptr: AscPtr<AscBigDecimal>,
+        y_ptr: AscPtr<AscBigDecimal>,
+    ) -> Result<AscPtr<AscBigDecimal>, DeterministicHostError> {
+        let result = self.ctx.host_exports.big_decimal_times(
+            asc_get(self, x_ptr, gas)?,
+            asc_get(self, y_ptr, gas)?,
+            gas,
+        )?;
+        asc_new(self, &result, gas)
+    }
+
+    /// function bigDecimal.dividedBy(x: BigDecimal, y: BigDecimal): BigDecimal
+    pub fn big_decimal_divided_by(
+        &mut self,
+        gas: &GasCounter,
+        x_ptr: AscPtr<AscBigDecimal>,
+        y_ptr: AscPtr<AscBigDecimal>,
+    ) -> Result<AscPtr<AscBigDecimal>, DeterministicHostError> {
+        let result = self.ctx.host_exports.big_decimal_divided_by(
+            asc_get(self, x_ptr, gas)?,
+            asc_get(self, y_ptr, gas)?,
+            gas,
+        )?;
+        asc_new(self, &result, gas)
+    }
+
+    /// function bigDecimal.equals(x: BigDecimal, y: BigDecimal): bool
+    pub fn big_decimal_equals(
+        &mut self,
+        gas: &GasCounter,
+        x_ptr: AscPtr<AscBigDecimal>,
+        y_ptr: AscPtr<AscBigDecimal>,
+    ) -> Result<bool, DeterministicHostError> {
+        self.ctx.host_exports.big_decimal_equals(
+            asc_get(self, x_ptr, gas)?,
+            asc_get(self, y_ptr, gas)?,
+            gas,
+        )
+    }
+
+    /// function dataSource.create(name: string, params: Array<string>): void
+    pub fn data_source_create(
+        &mut self,
+        gas: &GasCounter,
+        name_ptr: AscPtr<AscString>,
+        params_ptr: AscPtr<Array<AscPtr<AscString>>>,
+    ) -> Result<(), HostExportError> {
+        let name: String = asc_get(self, name_ptr, gas)?;
+        let params: Vec<String> = asc_get(self, params_ptr, gas)?;
+        self.ctx.host_exports.data_source_create(
+            &self.ctx.logger,
+            &mut self.ctx.state,
+            name,
+            params,
+            None,
+            self.ctx.block_ptr.number,
+            gas,
+        )
+    }
+
+    /// function createWithContext(name: string, params: Array<string>, context: DataSourceContext): void
+    pub fn data_source_create_with_context(
+        &mut self,
+        gas: &GasCounter,
+        name_ptr: AscPtr<AscString>,
+        params_ptr: AscPtr<Array<AscPtr<AscString>>>,
+        context_ptr: AscPtr<AscEntity>,
+    ) -> Result<(), HostExportError> {
+        let name: String = asc_get(self, name_ptr, gas)?;
+        let params: Vec<String> = asc_get(self, params_ptr, gas)?;
+        let context: HashMap<_, _> = asc_get(self, context_ptr, gas)?;
+        self.ctx.host_exports.data_source_create(
+            &self.ctx.logger,
+            &mut self.ctx.state,
+            name,
+            params,
+            Some(context.into()),
+            self.ctx.block_ptr.number,
+            gas,
+        )
+    }
+
+    /// function dataSource.address(): Bytes
+    pub fn data_source_address(
+        &mut self,
+        gas: &GasCounter,
+    ) -> Result<AscPtr<Uint8Array>, DeterministicHostError> {
+        asc_new(
+            self,
+            self.ctx.host_exports.data_source_address(gas)?.as_slice(),
+            gas,
+        )
+    }
+
+    /// function dataSource.network(): String
+    pub fn data_source_network(
+        &mut self,
+        gas: &GasCounter,
+    ) -> Result<AscPtr<AscString>, DeterministicHostError> {
+        asc_new(self, &self.ctx.host_exports.data_source_network(gas)?, gas)
+    }
+
+    /// function dataSource.context(): DataSourceContext
+    pub fn data_source_context(
+        &mut self,
+        gas: &GasCounter,
+    ) -> Result<AscPtr<AscEntity>, DeterministicHostError> {
+        asc_new(
+            self,
+            &self.ctx.host_exports.data_source_context(gas)?.sorted(),
+            gas,
+        )
+    }
+
+    pub fn ens_name_by_hash(
+        &mut self,
+        gas: &GasCounter,
+        hash_ptr: AscPtr<AscString>,
+    ) -> Result<AscPtr<AscString>, HostExportError> {
+        // Not enabled on the network, no gas consumed.
+        drop(gas);
+
+        // This is unrelated to IPFS, but piggyback on the config to disallow it on the network.
+        if !self.experimental_features.allow_non_deterministic_ipfs {
+            return Err(HostExportError::Deterministic(anyhow!(
+                "`ens_name_by_hash` is deprecated"
+            )));
+        }
+
+        let hash: String = asc_get(self, hash_ptr, gas)?;
+        let name = self.ctx.host_exports.ens_name_by_hash(&*hash)?;
+
+        // map `None` to `null`, and `Some(s)` to a runtime string
+        name.map(|name| asc_new(self, &*name, gas).map_err(Into::into))
+            .unwrap_or(Ok(AscPtr::null()))
+    }
+
+    pub fn log_log(
+        &mut self,
+        gas: &GasCounter,
+        level: u32,
+        msg: AscPtr<AscString>,
+    ) -> Result<(), DeterministicHostError> {
+        let level = LogLevel::from(level).into();
+        let msg: String = asc_get(self, msg, gas)?;
+        self.ctx
+            .host_exports
+            .log_log(&self.ctx.logger, level, msg, gas)
+    }
+
+    /// function encode(token: ethereum.Value): Bytes | null
+    pub fn ethereum_encode(
+        &mut self,
+        gas: &GasCounter,
+        token_ptr: AscPtr<AscEnum<EthereumValueKind>>,
+    ) -> Result<AscPtr<Uint8Array>, DeterministicHostError> {
+        let data = self
+            .ctx
+            .host_exports
+            .ethereum_encode(asc_get(self, token_ptr, gas)?, gas);
+
+        // return `null` if it fails
+        data.map(|bytes| asc_new(self, &*bytes, gas))
+            .unwrap_or(Ok(AscPtr::null()))
+    }
+
+    /// function decode(types: String, data: Bytes): ethereum.Value | null
+    pub fn ethereum_decode(
+        &mut self,
+        gas: &GasCounter,
+        types_ptr: AscPtr<AscString>,
+        data_ptr: AscPtr<Uint8Array>,
+    ) -> Result<AscPtr<AscEnum<EthereumValueKind>>, DeterministicHostError> {
+        let result = self.ctx.host_exports.ethereum_decode(
+            asc_get(self, types_ptr, gas)?,
+            asc_get(self, data_ptr, gas)?,
+            gas,
+        );
+
+        // return `null` if it fails
+        result
+            .map(|param| asc_new(self, &param, gas))
+            .unwrap_or(Ok(AscPtr::null()))
+    }
+
+    /// function arweave.transactionData(txId: string): Bytes | null
+    pub fn arweave_transaction_data(
+        &mut self,
+        _gas: &GasCounter,
+        _tx_id: AscPtr<AscString>,
+    ) -> Result<AscPtr<Uint8Array>, HostExportError> {
+        Err(HostExportError::Deterministic(anyhow!(
+            "`arweave.transactionData` has been removed."
+        )))
+    }
+
+    /// function box.profile(address: string): JSONValue | null
+    pub fn box_profile(
+        &mut self,
+        _gas: &GasCounter,
+        _address: AscPtr<AscString>,
+    ) -> Result<AscPtr<AscJson>, HostExportError> {
+        Err(HostExportError::Deterministic(anyhow!(
+            "`box.profile` has been removed."
+        )))
+    }
+}
diff --git a/runtime/wasm/src/module/stopwatch.rs b/runtime/wasm/src/module/stopwatch.rs
new file mode 100644
index 0000000..52d3b71
--- /dev/null
+++ b/runtime/wasm/src/module/stopwatch.rs
@@ -0,0 +1,58 @@
+// Copied from https://github.com/ellisonch/rust-stopwatch
+// Copyright (c) 2014 Chucky Ellison <cme at freefour.com> under MIT license
+
+use std::default::Default;
+use std::time::{Duration, Instant};
+
+#[derive(Clone, Copy)]
+pub struct TimeoutStopwatch {
+    /// The time the stopwatch was started last, if ever.
+    start_time: Option<Instant>,
+    /// The time elapsed while the stopwatch was running (between start() and stop()).
+    pub elapsed: Duration,
+}
+
+impl Default for TimeoutStopwatch {
+    fn default() -> TimeoutStopwatch {
+        TimeoutStopwatch {
+            start_time: None,
+            elapsed: Duration::from_secs(0),
+        }
+    }
+}
+
+impl TimeoutStopwatch {
+    /// Returns a new stopwatch.
+    pub fn new() -> TimeoutStopwatch {
+        let sw: TimeoutStopwatch = Default::default();
+        sw
+    }
+
+    /// Returns a new stopwatch which will immediately be started.
+    pub fn start_new() -> TimeoutStopwatch {
+        let mut sw = TimeoutStopwatch::new();
+        sw.start();
+        sw
+    }
+
+    /// Starts the stopwatch.
+    pub fn start(&mut self) {
+        self.start_time = Some(Instant::now());
+    }
+
+    /// Stops the stopwatch.
+    pub fn stop(&mut self) {
+        self.elapsed = self.elapsed();
+        self.start_time = None;
+    }
+
+    /// Returns the elapsed time since the start of the stopwatch.
+    pub fn elapsed(&self) -> Duration {
+        match self.start_time {
+            // stopwatch is running
+            Some(t1) => t1.elapsed() + self.elapsed,
+            // stopwatch is not running
+            None => self.elapsed,
+        }
+    }
+}
diff --git a/runtime/wasm/src/to_from/external.rs b/runtime/wasm/src/to_from/external.rs
new file mode 100644
index 0000000..96e99d7
--- /dev/null
+++ b/runtime/wasm/src/to_from/external.rs
@@ -0,0 +1,411 @@
+use ethabi;
+
+use graph::prelude::{BigDecimal, BigInt};
+use graph::runtime::gas::GasCounter;
+use graph::runtime::{asc_get, asc_new, AscIndexId, AscPtr, AscType, AscValue, ToAscObj};
+use graph::{data::store, runtime::DeterministicHostError};
+use graph::{prelude::serde_json, runtime::FromAscObj};
+use graph::{prelude::web3::types as web3, runtime::AscHeap};
+
+use crate::asc_abi::class::*;
+
+impl ToAscObj<Uint8Array> for web3::H160 {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<Uint8Array, DeterministicHostError> {
+        self.0.to_asc_obj(heap, gas)
+    }
+}
+
+impl FromAscObj<Uint8Array> for web3::H160 {
+    fn from_asc_obj<H: AscHeap + ?Sized>(
+        typed_array: Uint8Array,
+        heap: &H,
+        gas: &GasCounter,
+    ) -> Result<Self, DeterministicHostError> {
+        let data = <[u8; 20]>::from_asc_obj(typed_array, heap, gas)?;
+        Ok(Self(data))
+    }
+}
+
+impl FromAscObj<Uint8Array> for web3::H256 {
+    fn from_asc_obj<H: AscHeap + ?Sized>(
+        typed_array: Uint8Array,
+        heap: &H,
+        gas: &GasCounter,
+    ) -> Result<Self, DeterministicHostError> {
+        let data = <[u8; 32]>::from_asc_obj(typed_array, heap, gas)?;
+        Ok(Self(data))
+    }
+}
+
+impl ToAscObj<Uint8Array> for web3::H256 {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<Uint8Array, DeterministicHostError> {
+        self.0.to_asc_obj(heap, gas)
+    }
+}
+
+impl ToAscObj<AscBigInt> for web3::U128 {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscBigInt, DeterministicHostError> {
+        let mut bytes: [u8; 16] = [0; 16];
+        self.to_little_endian(&mut bytes);
+        bytes.to_asc_obj(heap, gas)
+    }
+}
+
+impl ToAscObj<AscBigInt> for BigInt {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscBigInt, DeterministicHostError> {
+        let bytes = self.to_signed_bytes_le();
+        bytes.to_asc_obj(heap, gas)
+    }
+}
+
+impl FromAscObj<AscBigInt> for BigInt {
+    fn from_asc_obj<H: AscHeap + ?Sized>(
+        array_buffer: AscBigInt,
+        heap: &H,
+        gas: &GasCounter,
+    ) -> Result<Self, DeterministicHostError> {
+        let bytes = <Vec<u8>>::from_asc_obj(array_buffer, heap, gas)?;
+        Ok(BigInt::from_signed_bytes_le(&bytes))
+    }
+}
+
+impl ToAscObj<AscBigDecimal> for BigDecimal {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscBigDecimal, DeterministicHostError> {
+        // From the docs: "Note that a positive exponent indicates a negative power of 10",
+        // so "exponent" is the opposite of what you'd expect.
+        let (digits, negative_exp) = self.as_bigint_and_exponent();
+        Ok(AscBigDecimal {
+            exp: asc_new(heap, &BigInt::from(-negative_exp), gas)?,
+            digits: asc_new(heap, &BigInt::from(digits), gas)?,
+        })
+    }
+}
+
+impl FromAscObj<AscBigDecimal> for BigDecimal {
+    fn from_asc_obj<H: AscHeap + ?Sized>(
+        big_decimal: AscBigDecimal,
+        heap: &H,
+        gas: &GasCounter,
+    ) -> Result<Self, DeterministicHostError> {
+        let digits: BigInt = asc_get(heap, big_decimal.digits, gas)?;
+        let exp: BigInt = asc_get(heap, big_decimal.exp, gas)?;
+
+        let bytes = exp.to_signed_bytes_le();
+        let mut byte_array = if exp >= 0.into() { [0; 8] } else { [255; 8] };
+        byte_array[..bytes.len()].copy_from_slice(&bytes);
+        let big_decimal = BigDecimal::new(digits, i64::from_le_bytes(byte_array));
+
+        // Validate the exponent.
+        let exp = -big_decimal.as_bigint_and_exponent().1;
+        let min_exp: i64 = BigDecimal::MIN_EXP.into();
+        let max_exp: i64 = BigDecimal::MAX_EXP.into();
+        if exp < min_exp || max_exp < exp {
+            Err(DeterministicHostError::from(anyhow::anyhow!(
+                "big decimal exponent `{}` is outside the `{}` to `{}` range",
+                exp,
+                min_exp,
+                max_exp
+            )))
+        } else {
+            Ok(big_decimal)
+        }
+    }
+}
+
+impl ToAscObj<Array<AscPtr<AscString>>> for Vec<String> {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<Array<AscPtr<AscString>>, DeterministicHostError> {
+        let content: Result<Vec<_>, _> = self.iter().map(|x| asc_new(heap, x, gas)).collect();
+        let content = content?;
+        Ok(Array::new(&*content, heap, gas)?)
+    }
+}
+
+impl ToAscObj<AscEnum<EthereumValueKind>> for ethabi::Token {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscEnum<EthereumValueKind>, DeterministicHostError> {
+        use ethabi::Token::*;
+
+        let kind = EthereumValueKind::get_kind(self);
+        let payload = match self {
+            Address(address) => asc_new::<AscAddress, _, _>(heap, address, gas)?.to_payload(),
+            FixedBytes(bytes) | Bytes(bytes) => {
+                asc_new::<Uint8Array, _, _>(heap, &**bytes, gas)?.to_payload()
+            }
+            Int(uint) => {
+                let n = BigInt::from_signed_u256(&uint);
+                asc_new(heap, &n, gas)?.to_payload()
+            }
+            Uint(uint) => {
+                let n = BigInt::from_unsigned_u256(&uint);
+                asc_new(heap, &n, gas)?.to_payload()
+            }
+            Bool(b) => *b as u64,
+            String(string) => asc_new(heap, &**string, gas)?.to_payload(),
+            FixedArray(tokens) | Array(tokens) => asc_new(heap, &**tokens, gas)?.to_payload(),
+            Tuple(tokens) => asc_new(heap, &**tokens, gas)?.to_payload(),
+        };
+
+        Ok(AscEnum {
+            kind,
+            _padding: 0,
+            payload: EnumPayload(payload),
+        })
+    }
+}
+
+impl FromAscObj<AscEnum<EthereumValueKind>> for ethabi::Token {
+    fn from_asc_obj<H: AscHeap + ?Sized>(
+        asc_enum: AscEnum<EthereumValueKind>,
+        heap: &H,
+        gas: &GasCounter,
+    ) -> Result<Self, DeterministicHostError> {
+        use ethabi::Token;
+
+        let payload = asc_enum.payload;
+        Ok(match asc_enum.kind {
+            EthereumValueKind::Bool => Token::Bool(bool::from(payload)),
+            EthereumValueKind::Address => {
+                let ptr: AscPtr<AscAddress> = AscPtr::from(payload);
+                Token::Address(asc_get(heap, ptr, gas)?)
+            }
+            EthereumValueKind::FixedBytes => {
+                let ptr: AscPtr<Uint8Array> = AscPtr::from(payload);
+                Token::FixedBytes(asc_get(heap, ptr, gas)?)
+            }
+            EthereumValueKind::Bytes => {
+                let ptr: AscPtr<Uint8Array> = AscPtr::from(payload);
+                Token::Bytes(asc_get(heap, ptr, gas)?)
+            }
+            EthereumValueKind::Int => {
+                let ptr: AscPtr<AscBigInt> = AscPtr::from(payload);
+                let n: BigInt = asc_get(heap, ptr, gas)?;
+                Token::Int(n.to_signed_u256())
+            }
+            EthereumValueKind::Uint => {
+                let ptr: AscPtr<AscBigInt> = AscPtr::from(payload);
+                let n: BigInt = asc_get(heap, ptr, gas)?;
+                Token::Uint(n.to_unsigned_u256())
+            }
+            EthereumValueKind::String => {
+                let ptr: AscPtr<AscString> = AscPtr::from(payload);
+                Token::String(asc_get(heap, ptr, gas)?)
+            }
+            EthereumValueKind::FixedArray => {
+                let ptr: AscEnumArray<EthereumValueKind> = AscPtr::from(payload);
+                Token::FixedArray(asc_get(heap, ptr, gas)?)
+            }
+            EthereumValueKind::Array => {
+                let ptr: AscEnumArray<EthereumValueKind> = AscPtr::from(payload);
+                Token::Array(asc_get(heap, ptr, gas)?)
+            }
+            EthereumValueKind::Tuple => {
+                let ptr: AscEnumArray<EthereumValueKind> = AscPtr::from(payload);
+                Token::Tuple(asc_get(heap, ptr, gas)?)
+            }
+        })
+    }
+}
+
+impl FromAscObj<AscEnum<StoreValueKind>> for store::Value {
+    fn from_asc_obj<H: AscHeap + ?Sized>(
+        asc_enum: AscEnum<StoreValueKind>,
+        heap: &H,
+        gas: &GasCounter,
+    ) -> Result<Self, DeterministicHostError> {
+        use self::store::Value;
+
+        let payload = asc_enum.payload;
+        Ok(match asc_enum.kind {
+            StoreValueKind::String => {
+                let ptr: AscPtr<AscString> = AscPtr::from(payload);
+                Value::String(asc_get(heap, ptr, gas)?)
+            }
+            StoreValueKind::Int => Value::Int(i32::from(payload)),
+            StoreValueKind::BigDecimal => {
+                let ptr: AscPtr<AscBigDecimal> = AscPtr::from(payload);
+                Value::BigDecimal(asc_get(heap, ptr, gas)?)
+            }
+            StoreValueKind::Bool => Value::Bool(bool::from(payload)),
+            StoreValueKind::Array => {
+                let ptr: AscEnumArray<StoreValueKind> = AscPtr::from(payload);
+                Value::List(asc_get(heap, ptr, gas)?)
+            }
+            StoreValueKind::Null => Value::Null,
+            StoreValueKind::Bytes => {
+                let ptr: AscPtr<Uint8Array> = AscPtr::from(payload);
+                let array: Vec<u8> = asc_get(heap, ptr, gas)?;
+                Value::Bytes(array.as_slice().into())
+            }
+            StoreValueKind::BigInt => {
+                let ptr: AscPtr<AscBigInt> = AscPtr::from(payload);
+                let array: Vec<u8> = asc_get(heap, ptr, gas)?;
+                Value::BigInt(store::scalar::BigInt::from_signed_bytes_le(&array))
+            }
+        })
+    }
+}
+
+impl ToAscObj<AscEnum<StoreValueKind>> for store::Value {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscEnum<StoreValueKind>, DeterministicHostError> {
+        use self::store::Value;
+
+        let payload = match self {
+            Value::String(string) => asc_new(heap, string.as_str(), gas)?.into(),
+            Value::Int(n) => EnumPayload::from(*n),
+            Value::BigDecimal(n) => asc_new(heap, n, gas)?.into(),
+            Value::Bool(b) => EnumPayload::from(*b),
+            Value::List(array) => asc_new(heap, array.as_slice(), gas)?.into(),
+            Value::Null => EnumPayload(0),
+            Value::Bytes(bytes) => {
+                let bytes_obj: AscPtr<Uint8Array> = asc_new(heap, bytes.as_slice(), gas)?;
+                bytes_obj.into()
+            }
+            Value::BigInt(big_int) => {
+                let bytes_obj: AscPtr<Uint8Array> =
+                    asc_new(heap, &*big_int.to_signed_bytes_le(), gas)?;
+                bytes_obj.into()
+            }
+        };
+
+        Ok(AscEnum {
+            kind: StoreValueKind::get_kind(self),
+            _padding: 0,
+            payload,
+        })
+    }
+}
+
+impl ToAscObj<AscJson> for serde_json::Map<String, serde_json::Value> {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscJson, DeterministicHostError> {
+        Ok(AscTypedMap {
+            entries: asc_new(heap, &*self.iter().collect::<Vec<_>>(), gas)?,
+        })
+    }
+}
+
+// Used for serializing entities.
+impl ToAscObj<AscEntity> for Vec<(String, store::Value)> {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscEntity, DeterministicHostError> {
+        Ok(AscTypedMap {
+            entries: asc_new(heap, self.as_slice(), gas)?,
+        })
+    }
+}
+
+impl ToAscObj<AscEnum<JsonValueKind>> for serde_json::Value {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscEnum<JsonValueKind>, DeterministicHostError> {
+        use serde_json::Value;
+
+        let payload = match self {
+            Value::Null => EnumPayload(0),
+            Value::Bool(b) => EnumPayload::from(*b),
+            Value::Number(number) => asc_new(heap, &*number.to_string(), gas)?.into(),
+            Value::String(string) => asc_new(heap, string.as_str(), gas)?.into(),
+            Value::Array(array) => asc_new(heap, array.as_slice(), gas)?.into(),
+            Value::Object(object) => asc_new(heap, object, gas)?.into(),
+        };
+
+        Ok(AscEnum {
+            kind: JsonValueKind::get_kind(self),
+            _padding: 0,
+            payload,
+        })
+    }
+}
+
+impl From<u32> for LogLevel {
+    fn from(i: u32) -> Self {
+        match i {
+            0 => LogLevel::Critical,
+            1 => LogLevel::Error,
+            2 => LogLevel::Warning,
+            3 => LogLevel::Info,
+            4 => LogLevel::Debug,
+            _ => LogLevel::Debug,
+        }
+    }
+}
+
+impl<T: AscValue> ToAscObj<AscWrapped<T>> for AscWrapped<T> {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        _heap: &mut H,
+        _gas: &GasCounter,
+    ) -> Result<AscWrapped<T>, DeterministicHostError> {
+        Ok(*self)
+    }
+}
+
+impl<V, VAsc> ToAscObj<AscResult<AscPtr<VAsc>, bool>> for Result<V, bool>
+where
+    V: ToAscObj<VAsc>,
+    VAsc: AscType + AscIndexId,
+    AscWrapped<AscPtr<VAsc>>: AscIndexId,
+{
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscResult<AscPtr<VAsc>, bool>, DeterministicHostError> {
+        Ok(match self {
+            Ok(value) => AscResult {
+                value: {
+                    let inner = asc_new(heap, value, gas)?;
+                    let wrapped = AscWrapped { inner };
+                    asc_new(heap, &wrapped, gas)?
+                },
+                error: AscPtr::null(),
+            },
+            Err(_) => AscResult {
+                value: AscPtr::null(),
+                error: {
+                    let wrapped = AscWrapped { inner: true };
+                    asc_new(heap, &wrapped, gas)?
+                },
+            },
+        })
+    }
+}
diff --git a/runtime/wasm/src/to_from/mod.rs b/runtime/wasm/src/to_from/mod.rs
new file mode 100644
index 0000000..334f74c
--- /dev/null
+++ b/runtime/wasm/src/to_from/mod.rs
@@ -0,0 +1,161 @@
+use anyhow::anyhow;
+use std::collections::HashMap;
+use std::hash::Hash;
+use std::iter::FromIterator;
+
+use graph::runtime::{
+    asc_get, asc_new, gas::GasCounter, AscHeap, AscIndexId, AscPtr, AscType, AscValue,
+    DeterministicHostError, FromAscObj, ToAscObj,
+};
+
+use crate::asc_abi::class::*;
+
+///! Implementations of `ToAscObj` and `FromAscObj` for Rust types.
+///! Standard Rust types go in `mod.rs` and external types in `external.rs`.
+mod external;
+
+impl<T: AscValue> ToAscObj<TypedArray<T>> for [T] {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<TypedArray<T>, DeterministicHostError> {
+        TypedArray::new(self, heap, gas)
+    }
+}
+
+impl<T: AscValue> FromAscObj<TypedArray<T>> for Vec<T> {
+    fn from_asc_obj<H: AscHeap + ?Sized>(
+        typed_array: TypedArray<T>,
+        heap: &H,
+        gas: &GasCounter,
+    ) -> Result<Self, DeterministicHostError> {
+        typed_array.to_vec(heap, gas)
+    }
+}
+
+impl<T: AscValue + Send + Sync, const LEN: usize> FromAscObj<TypedArray<T>> for [T; LEN] {
+    fn from_asc_obj<H: AscHeap + ?Sized>(
+        typed_array: TypedArray<T>,
+        heap: &H,
+        gas: &GasCounter,
+    ) -> Result<Self, DeterministicHostError> {
+        let v = typed_array.to_vec(heap, gas)?;
+        let array = <[T; LEN]>::try_from(v)
+            .map_err(|v| anyhow!("expected array of length {}, found length {}", LEN, v.len()))?;
+        Ok(array)
+    }
+}
+
+impl ToAscObj<AscString> for str {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        _gas: &GasCounter,
+    ) -> Result<AscString, DeterministicHostError> {
+        AscString::new(&self.encode_utf16().collect::<Vec<_>>(), heap.api_version())
+    }
+}
+
+impl ToAscObj<AscString> for String {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscString, DeterministicHostError> {
+        self.as_str().to_asc_obj(heap, gas)
+    }
+}
+
+impl FromAscObj<AscString> for String {
+    fn from_asc_obj<H: AscHeap + ?Sized>(
+        asc_string: AscString,
+        _: &H,
+        _gas: &GasCounter,
+    ) -> Result<Self, DeterministicHostError> {
+        let mut string = String::from_utf16(asc_string.content())
+            .map_err(|e| DeterministicHostError::from(anyhow::Error::from(e)))?;
+
+        // Strip null characters since they are not accepted by Postgres.
+        if string.contains('\u{0000}') {
+            string = string.replace("\u{0000}", "");
+        }
+        Ok(string)
+    }
+}
+
+impl<C: AscType + AscIndexId, T: ToAscObj<C>> ToAscObj<Array<AscPtr<C>>> for [T] {
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<Array<AscPtr<C>>, DeterministicHostError> {
+        let content: Result<Vec<_>, _> = self.iter().map(|x| asc_new(heap, x, gas)).collect();
+        let content = content?;
+        Array::new(&*content, heap, gas)
+    }
+}
+
+impl<C: AscType + AscIndexId, T: FromAscObj<C>> FromAscObj<Array<AscPtr<C>>> for Vec<T> {
+    fn from_asc_obj<H: AscHeap + ?Sized>(
+        array: Array<AscPtr<C>>,
+        heap: &H,
+        gas: &GasCounter,
+    ) -> Result<Self, DeterministicHostError> {
+        array
+            .to_vec(heap, gas)?
+            .into_iter()
+            .map(|x| asc_get(heap, x, gas))
+            .collect()
+    }
+}
+
+impl<K: AscType + AscIndexId, V: AscType + AscIndexId, T: FromAscObj<K>, U: FromAscObj<V>>
+    FromAscObj<AscTypedMapEntry<K, V>> for (T, U)
+{
+    fn from_asc_obj<H: AscHeap + ?Sized>(
+        asc_entry: AscTypedMapEntry<K, V>,
+        heap: &H,
+        gas: &GasCounter,
+    ) -> Result<Self, DeterministicHostError> {
+        Ok((
+            asc_get(heap, asc_entry.key, gas)?,
+            asc_get(heap, asc_entry.value, gas)?,
+        ))
+    }
+}
+
+impl<K: AscType + AscIndexId, V: AscType + AscIndexId, T: ToAscObj<K>, U: ToAscObj<V>>
+    ToAscObj<AscTypedMapEntry<K, V>> for (T, U)
+{
+    fn to_asc_obj<H: AscHeap + ?Sized>(
+        &self,
+        heap: &mut H,
+        gas: &GasCounter,
+    ) -> Result<AscTypedMapEntry<K, V>, DeterministicHostError> {
+        Ok(AscTypedMapEntry {
+            key: asc_new(heap, &self.0, gas)?,
+            value: asc_new(heap, &self.1, gas)?,
+        })
+    }
+}
+
+impl<
+        K: AscType + AscIndexId,
+        V: AscType + AscIndexId,
+        T: FromAscObj<K> + Hash + Eq,
+        U: FromAscObj<V>,
+    > FromAscObj<AscTypedMap<K, V>> for HashMap<T, U>
+where
+    Array<AscPtr<AscTypedMapEntry<K, V>>>: AscIndexId,
+    AscTypedMapEntry<K, V>: AscIndexId,
+{
+    fn from_asc_obj<H: AscHeap + ?Sized>(
+        asc_map: AscTypedMap<K, V>,
+        heap: &H,
+        gas: &GasCounter,
+    ) -> Result<Self, DeterministicHostError> {
+        let entries: Vec<(T, U)> = asc_get(heap, asc_map.entries, gas)?;
+        Ok(HashMap::from_iter(entries.into_iter()))
+    }
+}
diff --git a/scripts/README.md b/scripts/README.md
new file mode 100644
index 0000000..0786d33
--- /dev/null
+++ b/scripts/README.md
@@ -0,0 +1,39 @@
+# scripts
+
+## update-cargo-version.sh
+
+This script helps to update the versions of all `Cargo.toml` files and the `Cargo.lock` one.
+
+### Functionality
+
+It does more than what's listed below, but this represents the main behavior of it.
+
+1. Asserts that currently all `Cargo.toml` files in the repository have the **same version**;
+2. Changes all of the crates to use the new provided version: `patch`, `minor` or `major`;
+3. Updates the `Cargo.lock` via `cargo check --tests`;
+4. Adds the changes in a `Release X.Y.Z` commit.
+
+### Usage
+
+The only argument it accepts is the type of version you want to do `(patch|minor|major)`.
+
+```bash
+./scripts/update-cargo-version.sh patch
+```
+
+Example output:
+
+```
+Current version: "0.25.1"
+New version: "0.25.2"
+Changing 18 toml files
+Toml files are still consistent in their version after the update
+Updating Cargo.lock file
+    Finished dev [unoptimized + debuginfo] target(s) in 0.58s
+Cargo.lock file updated
+Updating version of the Cargo.{lock, toml} files succeded!
+[otavio/update-news-0-25-2 2f2175bae] Release 0.25.2
+ 20 files changed, 38 insertions(+), 38 deletions(-)
+```
+
+This script contains several assertions to make sure no mistake has been made. Unfortunately for now we don't have a way to revert it, or to recover from an error when it fails in the middle of it, this can be improved in the future.
diff --git a/scripts/abort.sh b/scripts/abort.sh
new file mode 100644
index 0000000..ed47868
--- /dev/null
+++ b/scripts/abort.sh
@@ -0,0 +1,6 @@
+abort () {
+  local ERROR_MESSAGE=$1
+  echo "Release failed, error message:"
+  echo $ERROR_MESSAGE
+  exit 1
+}
diff --git a/scripts/lines-unique.sh b/scripts/lines-unique.sh
new file mode 100755
index 0000000..186ea75
--- /dev/null
+++ b/scripts/lines-unique.sh
@@ -0,0 +1,15 @@
+#!/bin/bash
+
+source 'scripts/abort.sh'
+
+# Exits with code 0 if lines are unique, 1 otherwise
+LINES=$@
+
+# Validate that parameters are being sent
+[ -z "$LINES" ] && abort "No lines received"
+
+if [ $(echo $LINES | tr " " "\n" | sort | uniq | wc -l) -eq 1 ]; then
+  exit 0
+else
+  exit 1
+fi
diff --git a/scripts/toml-utils.sh b/scripts/toml-utils.sh
new file mode 100755
index 0000000..8687206
--- /dev/null
+++ b/scripts/toml-utils.sh
@@ -0,0 +1,19 @@
+# Get all files named 'Cargo.toml' in the `graph-node` directory, excluding the `integration-tests` folder.
+get_all_toml_files () {
+  echo "$(find . -name Cargo.toml | grep -v integration-tests)"
+}
+
+get_all_toml_versions () {
+  local FILE_NAMES=$@
+  echo $(
+    echo $FILE_NAMES | \
+    # Read all 'Cargo.toml' file contents.
+    xargs cat | \
+    # Get the 'version' key of the TOML, eg: version = "0.25.2"
+    grep '^version = ' | \
+    # Remove the '"' enclosing the version, eg: "0.25.2"
+    tr -d '"' | \
+    # Get only the version number, eg: 0.25.2
+    awk '{print $3}' \
+  )
+}
diff --git a/scripts/update-cargo-version.sh b/scripts/update-cargo-version.sh
new file mode 100755
index 0000000..1471d0a
--- /dev/null
+++ b/scripts/update-cargo-version.sh
@@ -0,0 +1,92 @@
+#!/bin/bash
+
+source 'scripts/abort.sh'
+source 'scripts/toml-utils.sh'
+
+ALL_TOML_FILE_NAMES=$(get_all_toml_files)
+ALL_TOML_VERSIONS=$(get_all_toml_versions $ALL_TOML_FILE_NAMES)
+
+# Asserts all .toml versions are currently the same, otherwise abort.
+if ./scripts/lines-unique.sh $ALL_TOML_VERSIONS; then
+  CURRENT_VERSION=$(echo $ALL_TOML_VERSIONS | awk '{print $1}')
+  echo "Current version: \"$CURRENT_VERSION\""
+else
+  abort "Some Cargo.toml files have different versions than others, make sure they're all the same before creating a new release"
+fi
+
+
+# Increment by CLI argument (major, minor, patch)
+MAJOR=$(echo $CURRENT_VERSION | cut -d. -f1)
+MINOR=$(echo $CURRENT_VERSION | cut -d. -f2)
+PATCH=$(echo $CURRENT_VERSION | cut -d. -f3)
+
+case $1 in
+  "major")
+    let "MAJOR++"
+    MINOR=0
+    PATCH=0
+    ;;
+  "minor")
+    let "MINOR++"
+    PATCH=0
+    ;;
+  "patch")
+    let "PATCH++"
+    ;;
+  *)
+    abort "Version argument should be one of: major, minor or patch"
+    ;;
+esac
+
+NEW_VERSION="${MAJOR}.${MINOR}.${PATCH}"
+echo "New version: \"$NEW_VERSION\""
+
+
+# Replace on all .toml files
+echo "Changing $(echo $ALL_TOML_VERSIONS | tr " " "\n" | wc -l | awk '{$1=$1;print}') toml files"
+
+# MacOS/OSX unfortunately doesn't have the same API for `sed`, so we're
+# using `perl` instead since it's installed by default in all Mac machines.
+#
+# For mor info: https://stackoverflow.com/questions/4247068/sed-command-with-i-option-failing-on-mac-but-works-on-linux
+if [[ "$OSTYPE" == "darwin"* ]]; then
+    perl -i -pe"s/^version = \"${CURRENT_VERSION}\"/version = \"${NEW_VERSION}\"/" $ALL_TOML_FILE_NAMES
+# Default, for decent OSs (eg: GNU-Linux)
+else
+    sed -i "s/^version = \"${CURRENT_VERSION}\"/version = \"${NEW_VERSION}\"/" $ALL_TOML_FILE_NAMES
+fi
+
+
+# Assert all the new .toml versions are the same, otherwise abort
+UPDATED_TOML_VERSIONS=$(get_all_toml_versions $ALL_TOML_FILE_NAMES)
+if ./scripts/lines-unique.sh $UPDATED_TOML_VERSIONS; then
+  echo "Toml files are still consistent in their version after the update"
+else
+  abort "Something went wrong with the version replacement and the new version isn't the same across the Cargo.toml files"
+fi
+
+
+# Assert there was a git diff in the changed files, otherwise abort
+if [[ $(git diff $ALL_TOML_FILE_NAMES) ]]; then
+  :
+else
+  abort "Somehow the toml files didn't get changed"
+fi
+
+
+echo "Updating Cargo.lock file"
+cargo check --tests
+
+
+# Assert .lock file changed the versions, otherwise abort
+if [[ $(git diff Cargo.lock) ]]; then
+    echo "Cargo.lock file updated"
+else
+    abort "There was no change in the Cargo.lock file, something went wrong with updating the crates versions"
+fi
+
+
+echo "Updating version of the Cargo.{lock, toml} files succeded!"
+
+git add Cargo.lock $ALL_TOML_FILE_NAMES
+git commit -m "Release ${NEW_VERSION}"
diff --git a/server/http/Cargo.toml b/server/http/Cargo.toml
new file mode 100644
index 0000000..34387f4
--- /dev/null
+++ b/server/http/Cargo.toml
@@ -0,0 +1,16 @@
+[package]
+name = "graph-server-http"
+version = "0.27.0"
+edition = "2021"
+
+[dependencies]
+futures = "0.1.21"
+graphql-parser = "0.4.0"
+http = "0.2"
+hyper = "0.14"
+serde = "1.0"
+graph = { path = "../../graph" }
+graph-graphql = { path = "../../graphql" }
+
+[dev-dependencies]
+graph-mock = { path = "../../mock" }
diff --git a/server/http/assets/index.html b/server/http/assets/index.html
new file mode 100644
index 0000000..7b049ea
--- /dev/null
+++ b/server/http/assets/index.html
@@ -0,0 +1,87052 @@
+<!DOCTYPE html>
+<html lang="en">
+  <head>
+    <meta charset="utf-8" />
+    <title>The GraphiQL</title>
+    <style>
+      .graphiql-container,
+      .graphiql-container button,
+      .graphiql-container input {
+        color: #141823;
+        font-family: system, -apple-system, San Francisco,
+          ".SFNSDisplay-Regular", Segoe UI, Segoe, Segoe WP, Helvetica Neue,
+          helvetica, Lucida Grande, arial, sans-serif;
+        font-size: 14px;
+      }
+      .graphiql-container {
+        display: flex;
+        flex-direction: row;
+        height: 100%;
+        margin: 0;
+        overflow: hidden;
+        width: 100%;
+      }
+      .graphiql-container .editorWrap {
+        display: flex;
+        flex-direction: column;
+        flex: 1;
+        overflow-x: hidden;
+      }
+      .graphiql-container .title {
+        font-size: 18px;
+      }
+      .graphiql-container .title em {
+        font-family: georgia;
+        font-size: 19px;
+      }
+      .graphiql-container .topBarWrap {
+        display: flex;
+        flex-direction: row;
+      }
+      .graphiql-container .topBar {
+        align-items: center;
+        background: linear-gradient(#f7f7f7, #e2e2e2);
+        border-bottom: 1px solid #d0d0d0;
+        cursor: default;
+        display: flex;
+        flex-direction: row;
+        flex: 1;
+        height: 34px;
+        overflow-y: visible;
+        padding: 7px 14px 6px;
+        user-select: none;
+      }
+      .graphiql-container .toolbar {
+        overflow-x: visible;
+        display: flex;
+      }
+      .graphiql-container .docExplorerShow,
+      .graphiql-container .historyShow {
+        background: linear-gradient(#f7f7f7, #e2e2e2);
+        border-radius: 0;
+        border-bottom: 1px solid #d0d0d0;
+        border-right: none;
+        border-top: none;
+        color: #3b5998;
+        cursor: pointer;
+        font-size: 14px;
+        margin: 0;
+        padding: 2px 20px 0 18px;
+      }
+      .graphiql-container .docExplorerShow {
+        border-left: 1px solid rgba(0, 0, 0, 0.2);
+      }
+      .graphiql-container .historyShow {
+        border-right: 1px solid rgba(0, 0, 0, 0.2);
+        border-left: 0;
+      }
+      .graphiql-container .docExplorerShow:before {
+        border-left: 2px solid #3b5998;
+        border-top: 2px solid #3b5998;
+        content: "";
+        display: inline-block;
+        height: 9px;
+        margin: 0 3px -1px 0;
+        position: relative;
+        transform: rotate(-45deg);
+        width: 9px;
+      }
+      .graphiql-container .editorBar {
+        display: flex;
+        flex-direction: row;
+        flex: 1;
+        max-height: 100%;
+      }
+      .graphiql-container .queryWrap {
+        display: flex;
+        flex-direction: column;
+        flex: 1;
+      }
+      .graphiql-container .resultWrap {
+        border-left: solid 1px #e0e0e0;
+        display: flex;
+        flex-direction: column;
+        flex: 1;
+        flex-basis: 1em;
+        position: relative;
+      }
+      .graphiql-container .docExplorerWrap,
+      .graphiql-container .historyPaneWrap {
+        background: white;
+        box-shadow: 0 0 8px #00000026;
+        position: relative;
+        z-index: 3;
+      }
+      .graphiql-container .historyPaneWrap {
+        min-width: 230px;
+        z-index: 5;
+      }
+      .graphiql-container .docExplorerResizer {
+        cursor: col-resize;
+        height: 100%;
+        left: -5px;
+        position: absolute;
+        top: 0;
+        width: 10px;
+        z-index: 10;
+      }
+      .graphiql-container .docExplorerHide {
+        cursor: pointer;
+        font-size: 18px;
+        margin: -7px -8px -6px 0;
+        padding: 18px 16px 15px 12px;
+        background: 0;
+        border: 0;
+        line-height: 14px;
+      }
+      .graphiql-container div .query-editor {
+        flex: 1;
+        position: relative;
+      }
+      .graphiql-container .secondary-editor {
+        display: flex;
+        flex-direction: column;
+        height: 30px;
+        position: relative;
+      }
+      .graphiql-container .secondary-editor-title {
+        background: #eeeeee;
+        border-bottom: 1px solid #d6d6d6;
+        border-top: 1px solid #e0e0e0;
+        color: #777;
+        font-variant: small-caps;
+        font-weight: 700;
+        letter-spacing: 1px;
+        line-height: 14px;
+        padding: 6px 0 8px 43px;
+        text-transform: lowercase;
+        user-select: none;
+      }
+      .graphiql-container .codemirrorWrap,
+      .graphiql-container .result-window {
+        flex: 1;
+        height: 100%;
+        position: relative;
+      }
+      .graphiql-container .footer {
+        background: #f6f7f8;
+        border-left: 1px solid #e0e0e0;
+        border-top: 1px solid #e0e0e0;
+        margin-left: 12px;
+        position: relative;
+      }
+      .graphiql-container .footer:before {
+        background: #eeeeee;
+        bottom: 0;
+        content: " ";
+        left: -13px;
+        position: absolute;
+        top: -1px;
+        width: 12px;
+      }
+      .result-window .CodeMirror.cm-s-graphiql {
+        background: #f6f7f8;
+      }
+      .graphiql-container .result-window .CodeMirror-gutters {
+        background-color: #eee;
+        border-color: #e0e0e0;
+        cursor: col-resize;
+      }
+      .graphiql-container .result-window .CodeMirror-foldgutter,
+      .graphiql-container .result-window .CodeMirror-foldgutter-open:after,
+      .graphiql-container .result-window .CodeMirror-foldgutter-folded:after {
+        padding-left: 3px;
+      }
+      .graphiql-container .toolbar-button {
+        background: #fdfdfd;
+        background: linear-gradient(#f9f9f9, #ececec);
+        border: 0;
+        border-radius: 3px;
+        box-shadow: inset 0 0 0 1px #0003, 0 1px #ffffffb3, inset 0 1px #fff;
+        color: #555;
+        cursor: pointer;
+        display: inline-block;
+        margin: 0 5px;
+        padding: 3px 11px 5px;
+        text-decoration: none;
+        text-overflow: ellipsis;
+        white-space: nowrap;
+        max-width: 150px;
+      }
+      .graphiql-container .toolbar-button:active {
+        background: linear-gradient(#ececec, #d5d5d5);
+        box-shadow: 0 1px #ffffffb3, inset 0 0 0 1px #0000001a,
+          inset 0 1px 1px 1px #0000001f, inset 0 0 5px #0000001a;
+      }
+      .graphiql-container .toolbar-button.error {
+        background: linear-gradient(#fdf3f3, #e6d6d7);
+        color: #b00;
+      }
+      .graphiql-container .toolbar-button-group {
+        margin: 0 5px;
+        white-space: nowrap;
+      }
+      .graphiql-container .toolbar-button-group > * {
+        margin: 0;
+      }
+      .graphiql-container .toolbar-button-group > *:not(:last-child) {
+        border-top-right-radius: 0;
+        border-bottom-right-radius: 0;
+      }
+      .graphiql-container .toolbar-button-group > *:not(:first-child) {
+        border-top-left-radius: 0;
+        border-bottom-left-radius: 0;
+        margin-left: -1px;
+      }
+      .graphiql-container .execute-button-wrap {
+        height: 34px;
+        margin: 0 14px 0 28px;
+        position: relative;
+      }
+      .graphiql-container .execute-button {
+        background: linear-gradient(#fdfdfd, #d2d3d6);
+        border-radius: 17px;
+        border: 1px solid rgba(0, 0, 0, 0.25);
+        box-shadow: 0 1px #fff;
+        cursor: pointer;
+        fill: #444;
+        height: 34px;
+        margin: 0;
+        padding: 0;
+        width: 34px;
+      }
+      .graphiql-container .execute-button svg {
+        pointer-events: none;
+      }
+      .graphiql-container .execute-button:active {
+        background: linear-gradient(#e6e6e6, #c3c3c3);
+        box-shadow: 0 1px #fff, inset 0 0 2px #0003, inset 0 0 6px #0000001a;
+      }
+      .graphiql-container .toolbar-menu,
+      .graphiql-container .toolbar-select {
+        position: relative;
+      }
+      .graphiql-container .execute-options,
+      .graphiql-container .toolbar-menu-items,
+      .graphiql-container .toolbar-select-options {
+        background: #fff;
+        box-shadow: 0 0 0 1px #0000001a, 0 2px 4px #00000040;
+        margin: 0;
+        padding: 6px 0;
+        position: absolute;
+        z-index: 100;
+      }
+      .graphiql-container .execute-options {
+        min-width: 100px;
+        top: 37px;
+        left: -1px;
+      }
+      .graphiql-container .toolbar-menu-items {
+        left: 1px;
+        margin-top: -1px;
+        min-width: 110%;
+        top: 100%;
+        visibility: hidden;
+      }
+      .graphiql-container .toolbar-menu-items.open {
+        visibility: visible;
+      }
+      .graphiql-container .toolbar-select-options {
+        left: 0;
+        min-width: 100%;
+        top: -5px;
+        visibility: hidden;
+      }
+      .graphiql-container .toolbar-select-options.open {
+        visibility: visible;
+      }
+      .graphiql-container .execute-options > li,
+      .graphiql-container .toolbar-menu-items > li,
+      .graphiql-container .toolbar-select-options > li {
+        cursor: pointer;
+        display: block;
+        margin: none;
+        max-width: 300px;
+        overflow: hidden;
+        padding: 2px 20px 4px 11px;
+        white-space: nowrap;
+      }
+      .graphiql-container .execute-options > li.selected,
+      .graphiql-container .toolbar-menu-items > li.hover,
+      .graphiql-container .toolbar-menu-items > li:active,
+      .graphiql-container .toolbar-menu-items > li:hover,
+      .graphiql-container .toolbar-select-options > li.hover,
+      .graphiql-container .toolbar-select-options > li:active,
+      .graphiql-container .toolbar-select-options > li:hover,
+      .graphiql-container .history-contents > li:hover,
+      .graphiql-container .history-contents > li:active {
+        background: #e10098;
+        color: #fff;
+      }
+      .graphiql-container .toolbar-select-options > li > svg {
+        display: inline;
+        fill: #666;
+        margin: 0 -6px 0 6px;
+        pointer-events: none;
+        vertical-align: middle;
+      }
+      .graphiql-container .toolbar-select-options > li.hover > svg,
+      .graphiql-container .toolbar-select-options > li:active > svg,
+      .graphiql-container .toolbar-select-options > li:hover > svg {
+        fill: #fff;
+      }
+      .graphiql-container .CodeMirror-scroll {
+        overflow-scrolling: touch;
+      }
+      .graphiql-container .CodeMirror {
+        color: #141823;
+        font-family: Consolas, Inconsolata, Droid Sans Mono, Monaco, monospace;
+        font-size: 13px;
+        height: 100%;
+        left: 0;
+        position: absolute;
+        top: 0;
+        width: 100%;
+      }
+      .graphiql-container .CodeMirror-lines {
+        padding: 20px 0;
+      }
+      .CodeMirror-hint-information .content {
+        box-orient: vertical;
+        color: #141823;
+        display: flex;
+        font-family: system, -apple-system, San Francisco,
+          ".SFNSDisplay-Regular", Segoe UI, Segoe, Segoe WP, Helvetica Neue,
+          helvetica, Lucida Grande, arial, sans-serif;
+        font-size: 13px;
+        line-clamp: 3;
+        line-height: 16px;
+        max-height: 48px;
+        overflow: hidden;
+        text-overflow: -o-ellipsis-lastline;
+      }
+      .CodeMirror-hint-information .content p:first-child {
+        margin-top: 0;
+      }
+      .CodeMirror-hint-information .content p:last-child {
+        margin-bottom: 0;
+      }
+      .CodeMirror-hint-information .infoType {
+        color: #ca9800;
+        cursor: pointer;
+        display: inline;
+        margin-right: 0.5em;
+      }
+      .autoInsertedLeaf.cm-property {
+        animation-duration: 6s;
+        animation-name: insertionFade;
+        border-bottom: 2px solid rgba(255, 255, 255, 0);
+        border-radius: 2px;
+        margin: -2px -4px -1px;
+        padding: 2px 4px 1px;
+      }
+      @keyframes insertionFade {
+        0%,
+        to {
+          background: rgba(255, 255, 255, 0);
+          border-color: #fff0;
+        }
+        15%,
+        85% {
+          background: #fbffc9;
+          border-color: #f0f3c0;
+        }
+      }
+      div.CodeMirror-lint-tooltip {
+        background-color: #fff;
+        border-radius: 2px;
+        border: 0;
+        color: #141823;
+        box-shadow: 0 1px 3px #00000073;
+        font-size: 13px;
+        line-height: 16px;
+        max-width: 430px;
+        opacity: 0;
+        padding: 8px 10px;
+        transition: opacity 0.15s;
+        white-space: pre-wrap;
+      }
+      div.CodeMirror-lint-tooltip > * {
+        padding-left: 23px;
+      }
+      div.CodeMirror-lint-tooltip > * + * {
+        margin-top: 12px;
+      }
+      .graphiql-container .variable-editor-title-text {
+        cursor: pointer;
+        display: inline-block;
+        color: gray;
+      }
+      .graphiql-container .variable-editor-title-text.active {
+        color: #000;
+      }
+      .graphiql-container .tabs {
+        height: 42px;
+        background-image: linear-gradient(#f7f7f7, #e2e2e2);
+        display: flex;
+        align-items: center;
+      }
+      .graphiql-container .tab {
+        position: relative;
+        cursor: pointer;
+        display: flex;
+        align-items: center;
+        justify-content: center;
+        padding-top: 0;
+        padding-right: 6px;
+        padding-left: 14px;
+        height: 100%;
+        color: #0009;
+        border-left: 1px solid lightgray;
+        border-top-style: none;
+        border-bottom-style: none;
+        border-right-style: none;
+      }
+      .graphiql-container .tab:first-child:nth-last-child(2) {
+        padding-right: 14px;
+      }
+      .graphiql-container .tab:hover {
+        background-image: linear-gradient(
+          rgba(245, 245, 245, 0.7),
+          rgba(215, 215, 215, 1)
+        );
+        color: #000c;
+      }
+      .graphiql-container .tab.active {
+        background-image: linear-gradient(
+          rgba(233, 233, 233, 0.7),
+          rgba(205, 205, 205, 1)
+        );
+        color: #000;
+      }
+      .graphiql-container .tab .close {
+        display: inline-block;
+        cursor: pointer;
+        border: none;
+        background: transparent;
+        margin-left: 6px;
+        padding: 3px 6px;
+        border-radius: 4px;
+      }
+      .graphiql-container .tab:hover .close,
+      .graphiql-container .tab.active .close {
+        opacity: 1;
+      }
+      .graphiql-container .tab .close:before {
+        content: "\2715";
+        display: inline-block;
+        font-weight: 700;
+        font-size: 12px;
+        color: #000000b3;
+        height: 14px;
+      }
+      .graphiql-container .tab .close:hover {
+        background: rgba(0, 0, 0, 0.08);
+      }
+      .graphiql-container .tab .close:active {
+        background: rgba(0, 0, 0, 0.12);
+      }
+      .graphiql-container .tab-add {
+        display: flex;
+        align-items: center;
+        justify-content: center;
+        border: none;
+        background: transparent;
+        line-height: 1;
+        font-size: 26px;
+        padding: 0 8px 3px;
+        height: 30px;
+        border-radius: 4px;
+        color: #00000080;
+        margin-left: 6px;
+        cursor: pointer;
+      }
+      .graphiql-container .tab-add:hover {
+        background: rgba(0, 0, 0, 0.06);
+      }
+      .graphiql-container .tab-add:active {
+        background: rgba(0, 0, 0, 0.1);
+      }
+      .graphiql-container .CodeMirror-foldmarker {
+        border-radius: 4px;
+        background: #08f;
+        background: linear-gradient(#43a8ff, #0f83e8);
+        box-shadow: 0 1px 1px #0003, inset 0 0 0 1px #0000001a;
+        color: #fff;
+        font-family: arial;
+        font-size: 12px;
+        line-height: 0;
+        margin: 0 3px;
+        padding: 0 4px 1px;
+        text-shadow: 0 -1px rgba(0, 0, 0, 0.1);
+      }
+      .graphiql-container div.CodeMirror span.CodeMirror-matchingbracket {
+        color: #555;
+        text-decoration: underline;
+      }
+      .graphiql-container div.CodeMirror span.CodeMirror-nonmatchingbracket {
+        color: red;
+      }
+      .cm-comment {
+        color: #666;
+      }
+      .cm-punctuation {
+        color: #555;
+      }
+      .cm-keyword {
+        color: #b11a04;
+      }
+      .cm-def {
+        color: #d2054e;
+      }
+      .cm-property {
+        color: #1f61a0;
+      }
+      .cm-qualifier {
+        color: #1c92a9;
+      }
+      .cm-attribute {
+        color: #8b2bb9;
+      }
+      .cm-number {
+        color: #2882f9;
+      }
+      .cm-string {
+        color: #d64292;
+      }
+      .cm-builtin {
+        color: #d47509;
+      }
+      .cm-string-2 {
+        color: #0b7fc7;
+      }
+      .cm-variable {
+        color: #397d13;
+      }
+      .cm-meta {
+        color: #b33086;
+      }
+      .cm-atom {
+        color: #ca9800;
+      }
+      .CodeMirror {
+        color: #000;
+        font-family: monospace;
+        height: 300px;
+      }
+      .CodeMirror-lines {
+        padding: 4px 0;
+      }
+      .CodeMirror pre {
+        padding: 0 4px;
+      }
+      .CodeMirror-scrollbar-filler,
+      .CodeMirror-gutter-filler {
+        background-color: #fff;
+      }
+      .CodeMirror-gutters {
+        border-right: 1px solid #ddd;
+        background-color: #f7f7f7;
+        white-space: nowrap;
+      }
+      .CodeMirror-linenumber {
+        color: #666;
+        min-width: 20px;
+        padding: 0 3px 0 5px;
+        text-align: right;
+        white-space: nowrap;
+      }
+      .CodeMirror-guttermarker {
+        color: #000;
+      }
+      .CodeMirror-guttermarker-subtle {
+        color: #666;
+      }
+      .CodeMirror .CodeMirror-cursor {
+        border-left: 1px solid black;
+      }
+      .CodeMirror div.CodeMirror-secondarycursor {
+        border-left: 1px solid silver;
+      }
+      .CodeMirror.cm-fat-cursor div.CodeMirror-cursor {
+        background: #7e7;
+        border: 0;
+        width: auto;
+      }
+      .CodeMirror.cm-fat-cursor div.CodeMirror-cursors {
+        z-index: 1;
+      }
+      .cm-animate-fat-cursor {
+        animation: blink 1.06s steps(1) infinite;
+        border: 0;
+        width: auto;
+      }
+      @keyframes blink {
+        0% {
+          background: #7e7;
+        }
+        50% {
+          background: none;
+        }
+        to {
+          background: #7e7;
+        }
+      }
+      .cm-tab {
+        display: inline-block;
+        text-decoration: inherit;
+      }
+      .CodeMirror-ruler {
+        border-left: 1px solid #ccc;
+        position: absolute;
+      }
+      .cm-s-default .cm-keyword {
+        color: #708;
+      }
+      .cm-s-default .cm-atom {
+        color: #219;
+      }
+      .cm-s-default .cm-number {
+        color: #164;
+      }
+      .cm-s-default .cm-def {
+        color: #00f;
+      }
+      .cm-s-default .cm-variable-2 {
+        color: #05a;
+      }
+      .cm-s-default .cm-variable-3 {
+        color: #085;
+      }
+      .cm-s-default .cm-comment {
+        color: #a50;
+      }
+      .cm-s-default .cm-string {
+        color: #a11;
+      }
+      .cm-s-default .cm-string-2 {
+        color: #f50;
+      }
+      .cm-s-default .cm-meta,
+      .cm-s-default .cm-qualifier {
+        color: #555;
+      }
+      .cm-s-default .cm-builtin {
+        color: #30a;
+      }
+      .cm-s-default .cm-bracket {
+        color: #666;
+      }
+      .cm-s-default .cm-tag {
+        color: #170;
+      }
+      .cm-s-default .cm-attribute {
+        color: #00c;
+      }
+      .cm-s-default .cm-header {
+        color: #00f;
+      }
+      .cm-s-default .cm-quote {
+        color: #090;
+      }
+      .cm-s-default .cm-hr {
+        color: #666;
+      }
+      .cm-s-default .cm-link {
+        color: #00c;
+      }
+      .cm-negative {
+        color: #d44;
+      }
+      .cm-positive {
+        color: #292;
+      }
+      .cm-header,
+      .cm-strong {
+        font-weight: 700;
+      }
+      .cm-em {
+        font-style: italic;
+      }
+      .cm-link {
+        text-decoration: underline;
+      }
+      .cm-strikethrough {
+        text-decoration: line-through;
+      }
+      .cm-s-default .cm-error,
+      .cm-invalidchar {
+        color: red;
+      }
+      .CodeMirror-composing {
+        border-bottom: 2px solid;
+      }
+      div.CodeMirror span.CodeMirror-matchingbracket {
+        color: #0f0;
+      }
+      div.CodeMirror span.CodeMirror-nonmatchingbracket {
+        color: #f22;
+      }
+      .CodeMirror-matchingtag {
+        background: rgba(255, 150, 0, 0.3);
+      }
+      .CodeMirror-activeline-background {
+        background: #e8f2ff;
+      }
+      .CodeMirror {
+        background: white;
+        overflow: hidden;
+        position: relative;
+      }
+      .CodeMirror-scroll {
+        height: 100%;
+        margin-bottom: -30px;
+        margin-right: -30px;
+        outline: none;
+        overflow: scroll !important;
+        padding-bottom: 30px;
+        position: relative;
+      }
+      .CodeMirror-sizer {
+        border-right: 30px solid transparent;
+        position: relative;
+      }
+      .CodeMirror-vscrollbar,
+      .CodeMirror-hscrollbar,
+      .CodeMirror-scrollbar-filler,
+      .CodeMirror-gutter-filler {
+        display: none;
+        position: absolute;
+        z-index: 6;
+      }
+      .CodeMirror-vscrollbar {
+        overflow-x: hidden;
+        overflow-y: scroll;
+        right: 0;
+        top: 0;
+      }
+      .CodeMirror-hscrollbar {
+        bottom: 0;
+        left: 0;
+        overflow-x: scroll;
+        overflow-y: hidden;
+      }
+      .CodeMirror-scrollbar-filler {
+        right: 0;
+        bottom: 0;
+      }
+      .CodeMirror-gutter-filler {
+        left: 0;
+        bottom: 0;
+      }
+      .CodeMirror-gutters {
+        min-height: 100%;
+        position: absolute;
+        left: 0;
+        top: 0;
+        z-index: 3;
+      }
+      .CodeMirror-gutter {
+        display: inline-block;
+        height: 100%;
+        margin-bottom: -30px;
+        vertical-align: top;
+        white-space: normal;
+      }
+      .CodeMirror-gutter-wrapper {
+        background: none !important;
+        border: none !important;
+        position: absolute;
+        z-index: 4;
+      }
+      .CodeMirror-gutter-background {
+        position: absolute;
+        top: 0;
+        bottom: 0;
+        z-index: 4;
+      }
+      .CodeMirror-gutter-elt {
+        cursor: default;
+        position: absolute;
+        z-index: 4;
+      }
+      .CodeMirror-gutter-wrapper {
+        user-select: none;
+      }
+      .CodeMirror-lines {
+        cursor: text;
+        min-height: 1px;
+      }
+      .CodeMirror pre {
+        -webkit-tap-highlight-color: transparent;
+        background: transparent;
+        border-radius: 0;
+        border-width: 0;
+        color: inherit;
+        font-family: inherit;
+        font-size: inherit;
+        font-variant-ligatures: none;
+        line-height: inherit;
+        margin: 0;
+        overflow: visible;
+        position: relative;
+        white-space: pre;
+        word-wrap: normal;
+        z-index: 2;
+      }
+      .CodeMirror-wrap pre {
+        word-wrap: break-word;
+        white-space: pre-wrap;
+        word-break: normal;
+      }
+      .CodeMirror-linebackground {
+        position: absolute;
+        left: 0;
+        right: 0;
+        top: 0;
+        bottom: 0;
+        z-index: 0;
+      }
+      .CodeMirror-linewidget {
+        overflow: auto;
+        position: relative;
+        z-index: 2;
+      }
+      .CodeMirror-code {
+        outline: none;
+      }
+      .CodeMirror-scroll,
+      .CodeMirror-sizer,
+      .CodeMirror-gutter,
+      .CodeMirror-gutters,
+      .CodeMirror-linenumber {
+        box-sizing: content-box;
+      }
+      .CodeMirror-measure {
+        height: 0;
+        overflow: hidden;
+        position: absolute;
+        visibility: hidden;
+        width: 100%;
+      }
+      .CodeMirror-cursor {
+        position: absolute;
+      }
+      .CodeMirror-measure pre {
+        position: static;
+      }
+      div.CodeMirror-cursors {
+        position: relative;
+        visibility: hidden;
+        z-index: 3;
+      }
+      div.CodeMirror-dragcursors,
+      .CodeMirror-focused div.CodeMirror-cursors {
+        visibility: visible;
+      }
+      .CodeMirror-selected {
+        background: #d9d9d9;
+      }
+      .CodeMirror-focused .CodeMirror-selected {
+        background: #d7d4f0;
+      }
+      .CodeMirror-crosshair {
+        cursor: crosshair;
+      }
+      .CodeMirror-line::selection,
+      .CodeMirror-line > span::selection,
+      .CodeMirror-line > span > span::selection {
+        background: #d7d4f0;
+      }
+      .CodeMirror-line::-moz-selection,
+      .CodeMirror-line > span::-moz-selection,
+      .CodeMirror-line > span > span::-moz-selection {
+        background: #d7d4f0;
+      }
+      .cm-searching {
+        background: #ffa;
+        background: rgba(255, 255, 0, 0.4);
+      }
+      .cm-force-border {
+        padding-right: 0.1px;
+      }
+      @media print {
+        .CodeMirror div.CodeMirror-cursors {
+          visibility: hidden;
+        }
+      }
+      .cm-tab-wrap-hack:after {
+        content: "";
+      }
+      span.CodeMirror-selectedtext {
+        background: none;
+      }
+      .CodeMirror-dialog {
+        background: inherit;
+        color: inherit;
+        left: 0;
+        right: 0;
+        overflow: hidden;
+        padding: 0.1em 0.8em;
+        position: absolute;
+        z-index: 15;
+      }
+      .CodeMirror-dialog-top {
+        border-bottom: 1px solid #eee;
+        top: 0;
+      }
+      .CodeMirror-dialog-bottom {
+        border-top: 1px solid #eee;
+        bottom: 0;
+      }
+      .CodeMirror-dialog input {
+        background: transparent;
+        border: 1px solid #d3d6db;
+        color: inherit;
+        font-family: monospace;
+        outline: none;
+        width: 20em;
+      }
+      .CodeMirror-dialog button {
+        font-size: 70%;
+      }
+      .CodeMirror-foldmarker {
+        color: #00f;
+        cursor: pointer;
+        font-family: arial;
+        line-height: 0.3;
+        text-shadow: #b9f 1px 1px 2px, #b9f -1px -1px 2px, #b9f 1px -1px 2px,
+          #b9f -1px 1px 2px;
+      }
+      .CodeMirror-foldgutter {
+        width: 0.7em;
+      }
+      .CodeMirror-foldgutter-open,
+      .CodeMirror-foldgutter-folded {
+        cursor: pointer;
+      }
+      .CodeMirror-foldgutter-open:after {
+        content: "\25be";
+      }
+      .CodeMirror-foldgutter-folded:after {
+        content: "\25b8";
+      }
+      .CodeMirror-info {
+        background: white;
+        border-radius: 2px;
+        box-shadow: 0 1px 3px #00000073;
+        box-sizing: border-box;
+        color: #555;
+        font-family: system, -apple-system, San Francisco,
+          ".SFNSDisplay-Regular", Segoe UI, Segoe, Segoe WP, Helvetica Neue,
+          helvetica, Lucida Grande, arial, sans-serif;
+        font-size: 13px;
+        line-height: 16px;
+        margin: 8px -8px;
+        max-width: 400px;
+        opacity: 0;
+        overflow: hidden;
+        padding: 8px;
+        position: fixed;
+        transition: opacity 0.15s;
+        z-index: 50;
+      }
+      .CodeMirror-info :first-child {
+        margin-top: 0;
+      }
+      .CodeMirror-info :last-child {
+        margin-bottom: 0;
+      }
+      .CodeMirror-info p {
+        margin: 1em 0;
+      }
+      .CodeMirror-info .info-description {
+        color: #777;
+        line-height: 16px;
+        margin-top: 1em;
+        max-height: 80px;
+        overflow: hidden;
+      }
+      .CodeMirror-info .info-deprecation {
+        background: #fffae8;
+        box-shadow: inset 0 1px 1px -1px #bfb063;
+        color: #867f70;
+        line-height: 16px;
+        margin: 8px -8px -8px;
+        max-height: 80px;
+        overflow: hidden;
+        padding: 8px;
+      }
+      .CodeMirror-info .info-deprecation-label {
+        color: #c79b2e;
+        cursor: default;
+        display: block;
+        font-size: 9px;
+        font-weight: 700;
+        letter-spacing: 1px;
+        line-height: 1;
+        padding-bottom: 5px;
+        text-transform: uppercase;
+        user-select: none;
+      }
+      .CodeMirror-info .info-deprecation-label + * {
+        margin-top: 0;
+      }
+      .CodeMirror-info a {
+        text-decoration: none;
+      }
+      .CodeMirror-info a:hover {
+        text-decoration: underline;
+      }
+      .CodeMirror-info .type-name {
+        color: #ca9800;
+      }
+      .CodeMirror-info .field-name {
+        color: #1f61a0;
+      }
+      .CodeMirror-info .enum-value {
+        color: #0b7fc7;
+      }
+      .CodeMirror-info .arg-name {
+        color: #8b2bb9;
+      }
+      .CodeMirror-info .directive-name {
+        color: #b33086;
+      }
+      .CodeMirror-jump-token {
+        text-decoration: underline;
+        cursor: pointer;
+      }
+      .CodeMirror-lint-markers {
+        width: 16px;
+      }
+      .CodeMirror-lint-tooltip {
+        background-color: infobackground;
+        border-radius: 4px;
+        border: 1px solid black;
+        color: infotext;
+        font-family: monospace;
+        font-size: 10pt;
+        max-width: 600px;
+        opacity: 0;
+        overflow: hidden;
+        padding: 2px 5px;
+        position: fixed;
+        transition: opacity 0.4s;
+        white-space: pre-wrap;
+        z-index: 100;
+      }
+      .CodeMirror-lint-mark-error,
+      .CodeMirror-lint-mark-warning {
+        background-position: left bottom;
+        background-repeat: repeat-x;
+      }
+      .CodeMirror-lint-mark-error {
+        background-image: url(data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAAQAAAADCAYAAAC09K7GAAAAAXNSR0IArs4c6QAAAAZiS0dEAP8A/wD/oL2nkwAAAAlwSFlzAAALEwAACxMBAJqcGAAAAAd0SU1FB9sJDw4cOCW1/KIAAAAZdEVYdENvbW1lbnQAQ3JlYXRlZCB3aXRoIEdJTVBXgQ4XAAAAHElEQVQI12NggIL/DAz/GdA5/xkY/qPKMDAwAADLZwf5rvm+LQAAAABJRU5ErkJggg==);
+      }
+      .CodeMirror-lint-mark-warning {
+        background-image: url(data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAAQAAAADCAYAAAC09K7GAAAAAXNSR0IArs4c6QAAAAZiS0dEAP8A/wD/oL2nkwAAAAlwSFlzAAALEwAACxMBAJqcGAAAAAd0SU1FB9sJFhQXEbhTg7YAAAAZdEVYdENvbW1lbnQAQ3JlYXRlZCB3aXRoIEdJTVBXgQ4XAAAAMklEQVQI12NkgIIvJ3QXMjAwdDN+OaEbysDA4MPAwNDNwMCwiOHLCd1zX07o6kBVGQEAKBANtobskNMAAAAASUVORK5CYII=);
+      }
+      .CodeMirror-lint-marker-error,
+      .CodeMirror-lint-marker-warning {
+        background-position: center center;
+        background-repeat: no-repeat;
+        cursor: pointer;
+        display: inline-block;
+        height: 16px;
+        position: relative;
+        vertical-align: middle;
+        width: 16px;
+      }
+      .CodeMirror-lint-message-error,
+      .CodeMirror-lint-message-warning {
+        background-position: top left;
+        background-repeat: no-repeat;
+        padding-left: 18px;
+      }
+      .CodeMirror-lint-marker-error,
+      .CodeMirror-lint-message-error {
+        background-image: url(data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAABAAAAAQCAMAAAAoLQ9TAAAAHlBMVEW7AAC7AACxAAC7AAC7AAAAAAC4AAC5AAD///+7AAAUdclpAAAABnRSTlMXnORSiwCK0ZKSAAAATUlEQVR42mWPOQ7AQAgDuQLx/z8csYRmPRIFIwRGnosRrpamvkKi0FTIiMASR3hhKW+hAN6/tIWhu9PDWiTGNEkTtIOucA5Oyr9ckPgAWm0GPBog6v4AAAAASUVORK5CYII=);
+      }
+      .CodeMirror-lint-marker-warning,
+      .CodeMirror-lint-message-warning {
+        background-image: url(data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAABAAAAAQCAMAAAAoLQ9TAAAANlBMVEX/uwDvrwD/uwD/uwD/uwD/uwD/uwD/uwD/uwD6twD/uwAAAADurwD2tQD7uAD+ugAAAAD/uwDhmeTRAAAADHRSTlMJ8mN1EYcbmiixgACm7WbuAAAAVklEQVR42n3PUQqAIBBFUU1LLc3u/jdbOJoW1P08DA9Gba8+YWJ6gNJoNYIBzAA2chBth5kLmG9YUoG0NHAUwFXwO9LuBQL1giCQb8gC9Oro2vp5rncCIY8L8uEx5ZkAAAAASUVORK5CYII=);
+      }
+      .CodeMirror-lint-marker-multiple {
+        background-image: url(data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAAcAAAAHCAMAAADzjKfhAAAACVBMVEUAAAAAAAC/v7914kyHAAAAAXRSTlMAQObYZgAAACNJREFUeNo1ioEJAAAIwmz/H90iFFSGJgFMe3gaLZ0od+9/AQZ0ADosbYraAAAAAElFTkSuQmCC);
+        background-position: right bottom;
+        background-repeat: no-repeat;
+        width: 100%;
+        height: 100%;
+      }
+      .graphiql-container .spinner-container {
+        height: 36px;
+        left: 50%;
+        position: absolute;
+        top: 50%;
+        transform: translate(-50%, -50%);
+        width: 36px;
+        z-index: 10;
+      }
+      .graphiql-container .spinner {
+        animation: rotation 0.6s infinite linear;
+        border-bottom: 6px solid rgba(150, 150, 150, 0.15);
+        border-left: 6px solid rgba(150, 150, 150, 0.15);
+        border-radius: 100%;
+        border-right: 6px solid rgba(150, 150, 150, 0.15);
+        border-top: 6px solid rgba(150, 150, 150, 0.8);
+        display: inline-block;
+        height: 24px;
+        position: absolute;
+        vertical-align: middle;
+        width: 24px;
+      }
+      @keyframes rotation {
+        0% {
+          transform: rotate(0);
+        }
+        to {
+          transform: rotate(359deg);
+        }
+      }
+      .CodeMirror-hints {
+        background: white;
+        box-shadow: 0 1px 3px #00000073;
+        font-family: Consolas, Inconsolata, Droid Sans Mono, Monaco, monospace;
+        font-size: 13px;
+        list-style: none;
+        margin: 0;
+        max-height: 14.5em;
+        overflow: hidden;
+        overflow-y: auto;
+        padding: 0;
+        position: absolute;
+        z-index: 10;
+      }
+      .CodeMirror-hint {
+        border-top: solid 1px #f7f7f7;
+        color: #141823;
+        cursor: pointer;
+        margin: 0;
+        max-width: 300px;
+        overflow: hidden;
+        padding: 2px 6px;
+        white-space: pre;
+      }
+      li.CodeMirror-hint-active {
+        background-color: #08f;
+        border-top-color: #fff;
+        color: #fff;
+      }
+      .CodeMirror-hint-information {
+        border-top: solid 1px #c0c0c0;
+        max-width: 300px;
+        padding: 4px 6px;
+        position: relative;
+        z-index: 1;
+      }
+      .CodeMirror-hint-information:first-child {
+        border-bottom: solid 1px #c0c0c0;
+        border-top: none;
+        margin-bottom: -1px;
+      }
+      .CodeMirror-hint-deprecation {
+        background: #fffae8;
+        box-shadow: inset 0 1px 1px -1px #bfb063;
+        color: #867f70;
+        font-family: system, -apple-system, San Francisco,
+          ".SFNSDisplay-Regular", Segoe UI, Segoe, Segoe WP, Helvetica Neue,
+          helvetica, Lucida Grande, arial, sans-serif;
+        font-size: 13px;
+        line-height: 16px;
+        margin-top: 4px;
+        max-height: 80px;
+        overflow: hidden;
+        padding: 6px;
+      }
+      .CodeMirror-hint-deprecation .deprecation-label {
+        color: #c79b2e;
+        cursor: default;
+        display: block;
+        font-size: 9px;
+        font-weight: 700;
+        letter-spacing: 1px;
+        line-height: 1;
+        padding-bottom: 5px;
+        text-transform: uppercase;
+        user-select: none;
+      }
+      .CodeMirror-hint-deprecation .deprecation-label + * {
+        margin-top: 0;
+      }
+      .CodeMirror-hint-deprecation :last-child {
+        margin-bottom: 0;
+      }
+      .graphiql-container .doc-explorer {
+        background: white;
+      }
+      .graphiql-container .doc-explorer-title-bar,
+      .graphiql-container .history-title-bar {
+        cursor: default;
+        display: flex;
+        height: 34px;
+        line-height: 14px;
+        padding: 8px 8px 5px;
+        position: relative;
+        user-select: none;
+      }
+      .graphiql-container .doc-explorer-title,
+      .graphiql-container .history-title {
+        flex: 1;
+        font-weight: 700;
+        overflow-x: hidden;
+        padding: 10px 0 10px 10px;
+        text-align: center;
+        text-overflow: ellipsis;
+        user-select: text;
+        white-space: nowrap;
+      }
+      .graphiql-container .doc-explorer-back {
+        color: #3b5998;
+        cursor: pointer;
+        margin: -7px 0 -6px -8px;
+        overflow-x: hidden;
+        padding: 17px 12px 16px 16px;
+        text-overflow: ellipsis;
+        white-space: nowrap;
+        background: 0;
+        border: 0;
+        line-height: 14px;
+      }
+      .doc-explorer-narrow .doc-explorer-back {
+        width: 0;
+      }
+      .graphiql-container .doc-explorer-back:before {
+        border-left: 2px solid #3b5998;
+        border-top: 2px solid #3b5998;
+        content: "";
+        display: inline-block;
+        height: 9px;
+        margin: 0 3px -1px 0;
+        position: relative;
+        transform: rotate(-45deg);
+        width: 9px;
+      }
+      .graphiql-container .doc-explorer-rhs {
+        position: relative;
+      }
+      .graphiql-container .doc-explorer-contents,
+      .graphiql-container .history-contents {
+        background-color: #fff;
+        border-top: 1px solid #d6d6d6;
+        bottom: 0;
+        left: 0;
+        overflow-y: auto;
+        padding: 20px 15px;
+        position: absolute;
+        right: 0;
+        top: 47px;
+      }
+      .graphiql-container .doc-explorer-contents {
+        min-width: 300px;
+      }
+      .graphiql-container .doc-type-description p:first-child,
+      .graphiql-container .doc-type-description blockquote:first-child {
+        margin-top: 0;
+      }
+      .graphiql-container .doc-explorer-contents a {
+        cursor: pointer;
+        text-decoration: none;
+      }
+      .graphiql-container .doc-explorer-contents a:hover {
+        text-decoration: underline;
+      }
+      .graphiql-container .doc-value-description > :first-child {
+        margin-top: 4px;
+      }
+      .graphiql-container .doc-value-description > :last-child {
+        margin-bottom: 4px;
+      }
+      .graphiql-container .doc-type-description code,
+      .graphiql-container .doc-type-description pre,
+      .graphiql-container .doc-category code,
+      .graphiql-container .doc-category pre {
+        --saf-0: rgba(var(--sk_foreground_low, 29, 28, 29), 0.13);
+        font-size: 12px;
+        line-height: 1.50001;
+        font-variant-ligatures: none;
+        white-space: pre;
+        white-space: pre-wrap;
+        word-wrap: break-word;
+        word-break: normal;
+        -webkit-tab-size: 4;
+        -moz-tab-size: 4;
+        tab-size: 4;
+      }
+      .graphiql-container .doc-type-description code,
+      .graphiql-container .doc-category code {
+        padding: 2px 3px 1px;
+        border: 1px solid var(--saf-0);
+        border-radius: 3px;
+        background-color: rgba(var(--sk_foreground_min, 29, 28, 29), 0.04);
+        color: #e01e5a;
+        background-color: #fff;
+      }
+      .graphiql-container .doc-category {
+        margin: 20px 0;
+      }
+      .graphiql-container .doc-category-title {
+        border-bottom: 1px solid #e0e0e0;
+        color: #777;
+        cursor: default;
+        font-size: 14px;
+        font-variant: small-caps;
+        font-weight: 700;
+        letter-spacing: 1px;
+        margin: 0 -15px 10px 0;
+        padding: 10px 0;
+        user-select: none;
+      }
+      .graphiql-container .doc-category-item {
+        margin: 12px 0;
+        color: #555;
+      }
+      .graphiql-container .keyword {
+        color: #b11a04;
+      }
+      .graphiql-container .type-name {
+        color: #ca9800;
+      }
+      .graphiql-container .field-name {
+        color: #1f61a0;
+      }
+      .graphiql-container .field-short-description {
+        color: #666;
+        margin-left: 5px;
+        overflow: hidden;
+        text-overflow: ellipsis;
+      }
+      .graphiql-container .enum-value {
+        color: #0b7fc7;
+      }
+      .graphiql-container .arg-name {
+        color: #8b2bb9;
+      }
+      .graphiql-container .arg {
+        display: block;
+        margin-left: 1em;
+      }
+      .graphiql-container .arg:first-child:last-child,
+      .graphiql-container .arg:first-child:nth-last-child(2),
+      .graphiql-container .arg:first-child:nth-last-child(2) ~ .arg {
+        display: inherit;
+        margin: inherit;
+      }
+      .graphiql-container .arg:first-child:nth-last-child(2):after {
+        content: ", ";
+      }
+      .graphiql-container .arg-default-value {
+        color: #43a047;
+      }
+      .graphiql-container .doc-deprecation {
+        background: #fffae8;
+        box-shadow: inset 0 0 1px #bfb063;
+        color: #867f70;
+        line-height: 16px;
+        margin: 8px -8px;
+        max-height: 80px;
+        overflow: hidden;
+        padding: 8px;
+        border-radius: 3px;
+      }
+      .graphiql-container .doc-deprecation:before {
+        content: "Deprecated:";
+        color: #c79b2e;
+        cursor: default;
+        display: block;
+        font-size: 9px;
+        font-weight: 700;
+        letter-spacing: 1px;
+        line-height: 1;
+        padding-bottom: 5px;
+        text-transform: uppercase;
+        user-select: none;
+      }
+      .graphiql-container .doc-deprecation > :first-child {
+        margin-top: 0;
+      }
+      .graphiql-container .doc-deprecation > :last-child {
+        margin-bottom: 0;
+      }
+      .graphiql-container .show-btn {
+        -webkit-appearance: initial;
+        display: block;
+        border-radius: 3px;
+        border: solid 1px #ccc;
+        text-align: center;
+        padding: 8px 12px 10px;
+        width: 100%;
+        box-sizing: border-box;
+        background: #fbfcfc;
+        color: #555;
+        cursor: pointer;
+      }
+      .graphiql-container .search-box {
+        border-bottom: 1px solid #d3d6db;
+        display: flex;
+        align-items: center;
+        font-size: 14px;
+        margin: -15px -15px 12px 0;
+        position: relative;
+      }
+      .graphiql-container .search-box-icon {
+        cursor: pointer;
+        display: block;
+        font-size: 24px;
+        transform: rotate(-45deg);
+        user-select: none;
+      }
+      .graphiql-container .search-box .search-box-clear {
+        background-color: #d0d0d0;
+        border-radius: 12px;
+        color: #fff;
+        cursor: pointer;
+        font-size: 11px;
+        padding: 1px 5px 2px;
+        position: absolute;
+        right: 3px;
+        user-select: none;
+        border: 0;
+      }
+      .graphiql-container .search-box .search-box-clear:hover {
+        background-color: #b9b9b9;
+      }
+      .graphiql-container .search-box > input {
+        border: none;
+        box-sizing: border-box;
+        font-size: 14px;
+        outline: none;
+        padding: 6px 24px 8px 20px;
+        width: 100%;
+      }
+      .graphiql-container .error-container {
+        font-weight: 700;
+        left: 0;
+        letter-spacing: 1px;
+        opacity: 0.5;
+        position: absolute;
+        right: 0;
+        text-align: center;
+        text-transform: uppercase;
+        top: 50%;
+        transform: translateY(-50%);
+      }
+      .graphiql-container .history-contents {
+        font-family: Consolas, Inconsolata, Droid Sans Mono, Monaco, monospace;
+      }
+      .graphiql-container .history-contents {
+        margin: 0;
+        padding: 0;
+      }
+      .graphiql-container .history-contents li {
+        align-items: center;
+        display: flex;
+        font-size: 12px;
+        overflow: hidden;
+        text-overflow: ellipsis;
+        white-space: nowrap;
+        margin: 0;
+        padding: 8px;
+        border-bottom: 1px solid #e0e0e0;
+      }
+      .graphiql-container .history-contents li button:not(.history-label) {
+        display: none;
+        margin-left: 10px;
+      }
+      .graphiql-container .history-contents li:hover button:not(.history-label),
+      .graphiql-container
+        .history-contents
+        li:focus-within
+        button:not(.history-label) {
+        display: inline-block;
+      }
+      .graphiql-container .history-contents input,
+      .graphiql-container .history-contents button {
+        padding: 0;
+        background: 0;
+        border: 0;
+        font-size: inherit;
+        font-family: inherit;
+        line-height: 14px;
+        color: inherit;
+      }
+      .graphiql-container .history-contents input {
+        flex-grow: 1;
+      }
+      .graphiql-container .history-contents input::placeholder {
+        color: inherit;
+      }
+      .graphiql-container .history-contents button {
+        cursor: pointer;
+        text-align: left;
+      }
+      .graphiql-container .history-contents .history-label {
+        flex-grow: 1;
+        overflow: hidden;
+        text-overflow: ellipsis;
+      }
+      body,
+      html {
+        margin: 0;
+      }
+      .graphiql-container {
+        height: 100vh;
+        width: 100vw;
+      }
+      .graphiql-explorer-node {
+        margin-left: 3px;
+      }
+      .graphiql-explorer-root .graphiql-operation-title-bar {
+        display: flex;
+        align-items: center;
+      }
+      .graphiql-explorer-root .graphiql-operation-title-bar input {
+        min-width: 11ch;
+      }
+      .graphiql-container .docExplorerShowReverse {
+        border-right: 1px solid rgba(0, 0, 0, 0.2) !important;
+      }
+      .docExplorerShowReverse:before {
+        display: none !important;
+      }
+      .docExplorerShowReverse:after {
+        border-left: 2px solid #3b5998;
+        border-top: 2px solid #3b5998;
+        content: "";
+        display: inline-block;
+        height: 9px;
+        margin: 0 0 -1px 3px;
+        position: relative;
+        transform: rotate(135deg);
+        width: 9px;
+      }
+      .graphiql-explorer-root input {
+        background-color: #282d34 !important;
+        padding-left: 5px;
+      }
+      .graphiql-explorer-actions select {
+        background-color: #282d34 !important;
+        color: #fff;
+        margin-left: 5px;
+      }
+      .graphiql-explorer-root div:first-child {
+        overflow: auto !important;
+      }
+      .graphiql-operation-title-bar {
+        background-color: transparent;
+      }
+      .CodeMirror {
+        background: #282d34 !important;
+      }
+      .graphiql-container .doc-explorer-contents,
+      .graphiql-container .history-contents {
+        background-color: #21262b;
+        border-top: 1px solid #181a1f;
+      }
+      .graphiql-container .doc-explorer-contents .graphiql-explorer-node svg {
+        margin-right: 5px !important;
+      }
+      .graphiql-container .doc-explorer-contents .graphiql-explorer-node path {
+        fill: #e0dddd !important;
+      }
+      .graphiql-container .toolbar-button {
+        background: #1c2125 !important;
+        box-shadow: none !important;
+        color: #fff !important;
+        border: 1px solid #181a1f !important;
+      }
+      .graphiql-container .toolbar-button:hover {
+        color: #c7c7c7 !important;
+      }
+      .graphiql-container .result-window .CodeMirror-gutters {
+        background: #282d33;
+        border: none !important;
+      }
+      .graphiql-container .resultWrap {
+        border-left: solid 1px #181a1f;
+      }
+      .graphiql-container .variable-editor-title {
+        background: #21262b;
+        border-bottom: 1px solid #181a1f;
+        border-top: 1px solid #181a1f;
+        color: #cacdd3;
+      }
+      .graphiql-container .topBar {
+        background: #21262b;
+        border-color: #181a1f;
+      }
+      .graphiql-container .docExplorerHide {
+        color: #fff;
+      }
+      .graphiql-container .docExplorerHide:hover {
+        color: #c7c7c7;
+      }
+      .graphiql-container .doc-explorer-title,
+      .graphiql-container .history-title,
+      .doc-explorer-back {
+        color: #cacdd3 !important;
+      }
+      .graphiql-container .doc-explorer {
+        background: #21262b;
+      }
+      .graphiql-container .docExplorerWrap,
+      .graphiql-container .historyPaneWrap {
+        box-shadow: none;
+      }
+      .graphiql-container .docExplorerShow {
+        border-left: none;
+      }
+      .graphiql-container .docExplorerShow,
+      .graphiql-container .historyShow {
+        background: #21262b;
+        border-bottom: 1px solid #181a1e;
+        color: #cacdd3;
+      }
+      .graphiql-container .docExplorerShow:before,
+      .graphiql-container .doc-explorer-back:before {
+        border-color: #cacdd3;
+      }
+      .graphiql-container .search-box {
+        margin: auto auto 10px;
+        border: none;
+      }
+      .graphiql-container .search-box input {
+        background: #1e2127;
+        padding-left: 28px;
+      }
+      .graphiql-container .search-box .search-box-clear,
+      .graphiql-container .search-box .search-box-clear:hover {
+        background: #1d2126;
+      }
+      .graphiql-container .search-box:before {
+        color: #c1c4ca;
+        font-size: 21px;
+        left: 8px;
+      }
+      .search-box-icon {
+        position: absolute;
+        padding-left: 5px;
+      }
+      .graphiql-container,
+      .graphiql-container button,
+      .graphiql-container input {
+        color: #9299a7;
+      }
+      .CodeMirror-gutters {
+        border: none !important;
+        background-color: #282d33;
+      }
+      .graphiql-container .execute-button {
+        background: #21262b;
+        border: 1px solid rgb(91, 98, 107);
+        box-shadow: none !important;
+        fill: #c9ccd2;
+      }
+      .graphiql-container .execute-button:hover {
+        fill: #999ba0;
+      }
+      .graphiql-container .history-contents p {
+        border: none;
+      }
+      .graphiql-container .historyPaneWrap {
+        background: #21262b;
+      }
+      .graphiql-container .execute-options > li.selected,
+      .graphiql-container .toolbar-menu-items > li.hover,
+      .graphiql-container .toolbar-menu-items > li:active,
+      .graphiql-container .toolbar-menu-items > li:hover,
+      .graphiql-container .toolbar-select-options > li.hover,
+      .graphiql-container .toolbar-select-options > li:active,
+      .graphiql-container .toolbar-select-options > li:hover,
+      .graphiql-container .history-contents > p:hover,
+      .graphiql-container .history-contents > p:active {
+        background: #383c41;
+      }
+      .graphiql-container .doc-category-title {
+        border-bottom: 1px solid #181a1f;
+        color: #cacdd3;
+      }
+      .graphiql-container .field-name {
+        color: #0083c7;
+      }
+      .graphiql-container .type-name {
+        color: #ff6d5d;
+      }
+      .graphiql-container .keyword {
+        color: #9ea5b0;
+      }
+      .graphiql-container .arg-name {
+        color: #0083c7;
+      }
+      .graphiql-container .doc-category-item {
+        color: #ff9f4c;
+      }
+      .graphiql-container .variable-editor-title-text.active {
+        color: #fff;
+      }
+      .cm-property {
+        color: #0083c7;
+      }
+      .cm-number {
+        color: #97b1aa;
+      }
+      .cm-string {
+        color: #00917d;
+      }
+      .cm-builtin {
+        color: #da8aff;
+      }
+      .cm-variable {
+        color: #f9f871;
+      }
+      .cm-attribute {
+        color: #00b8ff;
+      }
+      .cm-def {
+        color: #9f51d9;
+      }
+      .cm-punctuation {
+        color: #c7c7c7 !important;
+      }
+      .doc-type-description code {
+        color: #cc3932;
+        background-color: #383c41 !important;
+      }
+      .cm-keyword {
+        color: #ff6d5d;
+      }
+      .cm-atom {
+        color: #ff9f4c;
+      }
+      a {
+        color: #7b9ad4;
+      }
+      .CodeMirror .CodeMirror-cursor {
+        border-left: 1px solid white;
+      }
+      .CodeMirror-lint-tooltip {
+        background: #1a1e22 !important;
+        color: red;
+      }
+      .CodeMirror-hints {
+        background: #21262a;
+        box-shadow: 0 16px 13px -10px #0000004d;
+      }
+      .CodeMirror-hint {
+        border-top: solid 1px #212629;
+        color: #a45300;
+      }
+      .CodeMirror-hint-information {
+        border-top: solid 1px #181a1e;
+      }
+      li.CodeMirror-hint-active {
+        background-color: #262c2f;
+        border-top-color: #212629;
+        color: #d17825;
+      }
+      .CodeMirror-hint-information .content {
+        color: #a4abb7;
+      }
+      .graphiql-container .tabs {
+        background: #21262b;
+      }
+      .graphiql-container .tabs .tab,
+      .graphiql-container .tab-add,
+      .graphiql-container .tab .close:before {
+        background: #1c2125;
+        color: #ffffffb3;
+      }
+      .graphiql-container .tab-add:hover,
+      .graphiql-container .tabs .tab:hover {
+        color: #ffffffe6;
+      }
+      .graphiql-container .tabs .tab.active,
+      .graphiql-container .tab.active .close:before {
+        color: #fff;
+      }
+      .graphiql-container .tabs .tab {
+        border-color: #9299a74d;
+      }
+      .graphiql-container .tabs .tab:first-child {
+        border: none;
+      }
+    </style>
+  </head>
+  <body id="body" class="no-focus-outline">
+    <noscript>You need to enable JavaScript to run this app.</noscript>
+    <div id="root"></div>
+    <script>
+      // Polyfills until we can change DataLoader
+      if (globalThis.window?.setImmediate == null) {
+        //@ts-ignore
+        globalThis.window.setImmediate = setTimeout;
+        globalThis.global = globalThis;
+      }
+    </script>
+    <!-- Pull in the GraphiQL subscriptions fetcher -->
+    <script src="//unpkg.com/subscriptions-transport-ws@0.8.2/browser/client.js"></script>
+    <script src="//unpkg.com/graphiql-subscriptions-fetcher@0.0.2/browser/client.js"></script>
+    <script type="module">
+      var __defProp = Object.defineProperty;
+      var __defProps = Object.defineProperties;
+      var __getOwnPropDescs = Object.getOwnPropertyDescriptors;
+      var __getOwnPropSymbols = Object.getOwnPropertySymbols;
+      var __hasOwnProp = Object.prototype.hasOwnProperty;
+      var __propIsEnum = Object.prototype.propertyIsEnumerable;
+      var __defNormalProp = (obj, key, value) =>
+        key in obj
+          ? __defProp(obj, key, {
+              enumerable: true,
+              configurable: true,
+              writable: true,
+              value,
+            })
+          : (obj[key] = value);
+      var __spreadValues = (a, b) => {
+        for (var prop2 in b || (b = {}))
+          if (__hasOwnProp.call(b, prop2)) __defNormalProp(a, prop2, b[prop2]);
+        if (__getOwnPropSymbols)
+          for (var prop2 of __getOwnPropSymbols(b)) {
+            if (__propIsEnum.call(b, prop2))
+              __defNormalProp(a, prop2, b[prop2]);
+          }
+        return a;
+      };
+      var __spreadProps = (a, b) => __defProps(a, __getOwnPropDescs(b));
+      function _mergeNamespaces(n2, m) {
+        m.forEach(function (e) {
+          e &&
+            typeof e !== "string" &&
+            !Array.isArray(e) &&
+            Object.keys(e).forEach(function (k) {
+              if (k !== "default" && !(k in n2)) {
+                var d = Object.getOwnPropertyDescriptor(e, k);
+                Object.defineProperty(
+                  n2,
+                  k,
+                  d.get
+                    ? d
+                    : {
+                        enumerable: true,
+                        get: function () {
+                          return e[k];
+                        },
+                      }
+                );
+              }
+            });
+        });
+        return Object.freeze(n2);
+      }
+      var commonjsGlobal =
+        typeof globalThis !== "undefined"
+          ? globalThis
+          : typeof window !== "undefined"
+          ? window
+          : typeof global !== "undefined"
+          ? global
+          : typeof self !== "undefined"
+          ? self
+          : {};
+      function getDefaultExportFromCjs(x2) {
+        return x2 &&
+          x2.__esModule &&
+          Object.prototype.hasOwnProperty.call(x2, "default")
+          ? x2["default"]
+          : x2;
+      }
+      function getAugmentedNamespace(n2) {
+        if (n2.__esModule) return n2;
+        var a = Object.defineProperty({}, "__esModule", { value: true });
+        Object.keys(n2).forEach(function (k) {
+          var d = Object.getOwnPropertyDescriptor(n2, k);
+          Object.defineProperty(
+            a,
+            k,
+            d.get
+              ? d
+              : {
+                  enumerable: true,
+                  get: function () {
+                    return n2[k];
+                  },
+                }
+          );
+        });
+        return a;
+      }
+      var react = { exports: {} };
+      var react_production_min = {};
+      /**
+       * @license React
+       * react.production.min.js
+       *
+       * Copyright (c) Facebook, Inc. and its affiliates.
+       *
+       * This source code is licensed under the MIT license found in the
+       * LICENSE file in the root directory of this source tree.
+       */
+      var l = Symbol.for("react.element"),
+        n = Symbol.for("react.portal"),
+        p$2 = Symbol.for("react.fragment"),
+        q$1 = Symbol.for("react.strict_mode"),
+        r = Symbol.for("react.profiler"),
+        t$1 = Symbol.for("react.provider"),
+        u = Symbol.for("react.context"),
+        v = Symbol.for("react.forward_ref"),
+        w = Symbol.for("react.suspense"),
+        x = Symbol.for("react.memo"),
+        y = Symbol.for("react.lazy"),
+        z$1 = Symbol.iterator;
+      function A$1(a) {
+        if (a === null || typeof a !== "object") return null;
+        a = (z$1 && a[z$1]) || a["@@iterator"];
+        return typeof a === "function" ? a : null;
+      }
+      var B = {
+          isMounted: function () {
+            return false;
+          },
+          enqueueForceUpdate: function () {},
+          enqueueReplaceState: function () {},
+          enqueueSetState: function () {},
+        },
+        C = Object.assign,
+        D$1 = {};
+      function E$1(a, b, e) {
+        this.props = a;
+        this.context = b;
+        this.refs = D$1;
+        this.updater = e || B;
+      }
+      E$1.prototype.isReactComponent = {};
+      E$1.prototype.setState = function (a, b) {
+        if (typeof a !== "object" && typeof a !== "function" && a != null)
+          throw Error(
+            "setState(...): takes an object of state variables to update or a function which returns an object of state variables."
+          );
+        this.updater.enqueueSetState(this, a, b, "setState");
+      };
+      E$1.prototype.forceUpdate = function (a) {
+        this.updater.enqueueForceUpdate(this, a, "forceUpdate");
+      };
+      function F$1() {}
+      F$1.prototype = E$1.prototype;
+      function G$1(a, b, e) {
+        this.props = a;
+        this.context = b;
+        this.refs = D$1;
+        this.updater = e || B;
+      }
+      var H$1 = (G$1.prototype = new F$1());
+      H$1.constructor = G$1;
+      C(H$1, E$1.prototype);
+      H$1.isPureReactComponent = true;
+      var I$1 = Array.isArray,
+        J$1 = Object.prototype.hasOwnProperty,
+        K$1 = { current: null },
+        L = { key: true, ref: true, __self: true, __source: true };
+      function M$1(a, b, e) {
+        var d,
+          c = {},
+          k = null,
+          h = null;
+        if (b != null)
+          for (d in (b.ref !== void 0 && (h = b.ref),
+          b.key !== void 0 && (k = "" + b.key),
+          b))
+            J$1.call(b, d) && !L.hasOwnProperty(d) && (c[d] = b[d]);
+        var g = arguments.length - 2;
+        if (g === 1) c.children = e;
+        else if (1 < g) {
+          for (var f = Array(g), m = 0; m < g; m++) f[m] = arguments[m + 2];
+          c.children = f;
+        }
+        if (a && a.defaultProps)
+          for (d in ((g = a.defaultProps), g)) c[d] === void 0 && (c[d] = g[d]);
+        return {
+          $$typeof: l,
+          type: a,
+          key: k,
+          ref: h,
+          props: c,
+          _owner: K$1.current,
+        };
+      }
+      function N$1(a, b) {
+        return {
+          $$typeof: l,
+          type: a.type,
+          key: b,
+          ref: a.ref,
+          props: a.props,
+          _owner: a._owner,
+        };
+      }
+      function O(a) {
+        return typeof a === "object" && a !== null && a.$$typeof === l;
+      }
+      function escape(a) {
+        var b = { "=": "=0", ":": "=2" };
+        return (
+          "$" +
+          a.replace(/[=:]/g, function (a2) {
+            return b[a2];
+          })
+        );
+      }
+      var P$1 = /\/+/g;
+      function Q$1(a, b) {
+        return typeof a === "object" && a !== null && a.key != null
+          ? escape("" + a.key)
+          : b.toString(36);
+      }
+      function R$1(a, b, e, d, c) {
+        var k = typeof a;
+        if (k === "undefined" || k === "boolean") a = null;
+        var h = false;
+        if (a === null) h = true;
+        else
+          switch (k) {
+            case "string":
+            case "number":
+              h = true;
+              break;
+            case "object":
+              switch (a.$$typeof) {
+                case l:
+                case n:
+                  h = true;
+              }
+          }
+        if (h)
+          return (
+            (h = a),
+            (c = c(h)),
+            (a = d === "" ? "." + Q$1(h, 0) : d),
+            I$1(c)
+              ? ((e = ""),
+                a != null && (e = a.replace(P$1, "$&/") + "/"),
+                R$1(c, b, e, "", function (a2) {
+                  return a2;
+                }))
+              : c != null &&
+                (O(c) &&
+                  (c = N$1(
+                    c,
+                    e +
+                      (!c.key || (h && h.key === c.key)
+                        ? ""
+                        : ("" + c.key).replace(P$1, "$&/") + "/") +
+                      a
+                  )),
+                b.push(c)),
+            1
+          );
+        h = 0;
+        d = d === "" ? "." : d + ":";
+        if (I$1(a))
+          for (var g = 0; g < a.length; g++) {
+            k = a[g];
+            var f = d + Q$1(k, g);
+            h += R$1(k, b, e, f, c);
+          }
+        else if (((f = A$1(a)), typeof f === "function"))
+          for (a = f.call(a), g = 0; !(k = a.next()).done; )
+            (k = k.value), (f = d + Q$1(k, g++)), (h += R$1(k, b, e, f, c));
+        else if (k === "object")
+          throw (
+            ((b = String(a)),
+            Error(
+              "Objects are not valid as a React child (found: " +
+                (b === "[object Object]"
+                  ? "object with keys {" + Object.keys(a).join(", ") + "}"
+                  : b) +
+                "). If you meant to render a collection of children, use an array instead."
+            ))
+          );
+        return h;
+      }
+      function S$1(a, b, e) {
+        if (a == null) return a;
+        var d = [],
+          c = 0;
+        R$1(a, d, "", "", function (a2) {
+          return b.call(e, a2, c++);
+        });
+        return d;
+      }
+      function T(a) {
+        if (a._status === -1) {
+          var b = a._result;
+          b = b();
+          b.then(
+            function (b2) {
+              if (a._status === 0 || a._status === -1)
+                (a._status = 1), (a._result = b2);
+            },
+            function (b2) {
+              if (a._status === 0 || a._status === -1)
+                (a._status = 2), (a._result = b2);
+            }
+          );
+          a._status === -1 && ((a._status = 0), (a._result = b));
+        }
+        if (a._status === 1) return a._result.default;
+        throw a._result;
+      }
+      var U$1 = { current: null },
+        V$1 = { transition: null },
+        W$1 = {
+          ReactCurrentDispatcher: U$1,
+          ReactCurrentBatchConfig: V$1,
+          ReactCurrentOwner: K$1,
+        };
+      react_production_min.Children = {
+        map: S$1,
+        forEach: function (a, b, e) {
+          S$1(
+            a,
+            function () {
+              b.apply(this, arguments);
+            },
+            e
+          );
+        },
+        count: function (a) {
+          var b = 0;
+          S$1(a, function () {
+            b++;
+          });
+          return b;
+        },
+        toArray: function (a) {
+          return (
+            S$1(a, function (a2) {
+              return a2;
+            }) || []
+          );
+        },
+        only: function (a) {
+          if (!O(a))
+            throw Error(
+              "React.Children.only expected to receive a single React element child."
+            );
+          return a;
+        },
+      };
+      react_production_min.Component = E$1;
+      react_production_min.Fragment = p$2;
+      react_production_min.Profiler = r;
+      react_production_min.PureComponent = G$1;
+      react_production_min.StrictMode = q$1;
+      react_production_min.Suspense = w;
+      react_production_min.__SECRET_INTERNALS_DO_NOT_USE_OR_YOU_WILL_BE_FIRED =
+        W$1;
+      react_production_min.cloneElement = function (a, b, e) {
+        if (a === null || a === void 0)
+          throw Error(
+            "React.cloneElement(...): The argument must be a React element, but you passed " +
+              a +
+              "."
+          );
+        var d = C({}, a.props),
+          c = a.key,
+          k = a.ref,
+          h = a._owner;
+        if (b != null) {
+          b.ref !== void 0 && ((k = b.ref), (h = K$1.current));
+          b.key !== void 0 && (c = "" + b.key);
+          if (a.type && a.type.defaultProps) var g = a.type.defaultProps;
+          for (f in b)
+            J$1.call(b, f) &&
+              !L.hasOwnProperty(f) &&
+              (d[f] = b[f] === void 0 && g !== void 0 ? g[f] : b[f]);
+        }
+        var f = arguments.length - 2;
+        if (f === 1) d.children = e;
+        else if (1 < f) {
+          g = Array(f);
+          for (var m = 0; m < f; m++) g[m] = arguments[m + 2];
+          d.children = g;
+        }
+        return {
+          $$typeof: l,
+          type: a.type,
+          key: c,
+          ref: k,
+          props: d,
+          _owner: h,
+        };
+      };
+      react_production_min.createContext = function (a) {
+        a = {
+          $$typeof: u,
+          _currentValue: a,
+          _currentValue2: a,
+          _threadCount: 0,
+          Provider: null,
+          Consumer: null,
+          _defaultValue: null,
+          _globalName: null,
+        };
+        a.Provider = { $$typeof: t$1, _context: a };
+        return (a.Consumer = a);
+      };
+      react_production_min.createElement = M$1;
+      react_production_min.createFactory = function (a) {
+        var b = M$1.bind(null, a);
+        b.type = a;
+        return b;
+      };
+      react_production_min.createRef = function () {
+        return { current: null };
+      };
+      react_production_min.forwardRef = function (a) {
+        return { $$typeof: v, render: a };
+      };
+      react_production_min.isValidElement = O;
+      react_production_min.lazy = function (a) {
+        return { $$typeof: y, _payload: { _status: -1, _result: a }, _init: T };
+      };
+      react_production_min.memo = function (a, b) {
+        return { $$typeof: x, type: a, compare: b === void 0 ? null : b };
+      };
+      react_production_min.startTransition = function (a) {
+        var b = V$1.transition;
+        V$1.transition = {};
+        try {
+          a();
+        } finally {
+          V$1.transition = b;
+        }
+      };
+      react_production_min.unstable_act = function () {
+        throw Error("act(...) is not supported in production builds of React.");
+      };
+      react_production_min.useCallback = function (a, b) {
+        return U$1.current.useCallback(a, b);
+      };
+      react_production_min.useContext = function (a) {
+        return U$1.current.useContext(a);
+      };
+      react_production_min.useDebugValue = function () {};
+      react_production_min.useDeferredValue = function (a) {
+        return U$1.current.useDeferredValue(a);
+      };
+      react_production_min.useEffect = function (a, b) {
+        return U$1.current.useEffect(a, b);
+      };
+      react_production_min.useId = function () {
+        return U$1.current.useId();
+      };
+      react_production_min.useImperativeHandle = function (a, b, e) {
+        return U$1.current.useImperativeHandle(a, b, e);
+      };
+      react_production_min.useInsertionEffect = function (a, b) {
+        return U$1.current.useInsertionEffect(a, b);
+      };
+      react_production_min.useLayoutEffect = function (a, b) {
+        return U$1.current.useLayoutEffect(a, b);
+      };
+      react_production_min.useMemo = function (a, b) {
+        return U$1.current.useMemo(a, b);
+      };
+      react_production_min.useReducer = function (a, b, e) {
+        return U$1.current.useReducer(a, b, e);
+      };
+      react_production_min.useRef = function (a) {
+        return U$1.current.useRef(a);
+      };
+      react_production_min.useState = function (a) {
+        return U$1.current.useState(a);
+      };
+      react_production_min.useSyncExternalStore = function (a, b, e) {
+        return U$1.current.useSyncExternalStore(a, b, e);
+      };
+      react_production_min.useTransition = function () {
+        return U$1.current.useTransition();
+      };
+      react_production_min.version = "18.0.0-fc46dba67-20220329";
+      {
+        react.exports = react_production_min;
+      }
+      var React$1 = react.exports;
+      var reactDom = { exports: {} };
+      var reactDom_production_min = {};
+      var scheduler = { exports: {} };
+      var scheduler_production_min = {};
+      /**
+       * @license React
+       * scheduler.production.min.js
+       *
+       * Copyright (c) Facebook, Inc. and its affiliates.
+       *
+       * This source code is licensed under the MIT license found in the
+       * LICENSE file in the root directory of this source tree.
+       */
+      (function (exports) {
+        function f(a, b) {
+          var c = a.length;
+          a.push(b);
+          a: for (; 0 < c; ) {
+            var d = (c - 1) >>> 1,
+              e = a[d];
+            if (0 < g(e, b)) (a[d] = b), (a[c] = e), (c = d);
+            else break a;
+          }
+        }
+        function h(a) {
+          return a.length === 0 ? null : a[0];
+        }
+        function k(a) {
+          if (a.length === 0) return null;
+          var b = a[0],
+            c = a.pop();
+          if (c !== b) {
+            a[0] = c;
+            a: for (var d = 0, e = a.length, w2 = e >>> 1; d < w2; ) {
+              var m = 2 * (d + 1) - 1,
+                C2 = a[m],
+                n2 = m + 1,
+                x2 = a[n2];
+              if (0 > g(C2, c))
+                n2 < e && 0 > g(x2, C2)
+                  ? ((a[d] = x2), (a[n2] = c), (d = n2))
+                  : ((a[d] = C2), (a[m] = c), (d = m));
+              else if (n2 < e && 0 > g(x2, c))
+                (a[d] = x2), (a[n2] = c), (d = n2);
+              else break a;
+            }
+          }
+          return b;
+        }
+        function g(a, b) {
+          var c = a.sortIndex - b.sortIndex;
+          return c !== 0 ? c : a.id - b.id;
+        }
+        if (
+          typeof performance === "object" &&
+          typeof performance.now === "function"
+        ) {
+          var l2 = performance;
+          exports.unstable_now = function () {
+            return l2.now();
+          };
+        } else {
+          var p2 = Date,
+            q2 = p2.now();
+          exports.unstable_now = function () {
+            return p2.now() - q2;
+          };
+        }
+        var r2 = [],
+          t2 = [],
+          u2 = 1,
+          v2 = null,
+          y2 = 3,
+          z2 = false,
+          A2 = false,
+          B2 = false,
+          D2 = typeof setTimeout === "function" ? setTimeout : null,
+          E2 = typeof clearTimeout === "function" ? clearTimeout : null,
+          F2 = typeof setImmediate !== "undefined" ? setImmediate : null;
+        typeof navigator !== "undefined" &&
+          navigator.scheduling !== void 0 &&
+          navigator.scheduling.isInputPending !== void 0 &&
+          navigator.scheduling.isInputPending.bind(navigator.scheduling);
+        function G2(a) {
+          for (var b = h(t2); b !== null; ) {
+            if (b.callback === null) k(t2);
+            else if (b.startTime <= a)
+              k(t2), (b.sortIndex = b.expirationTime), f(r2, b);
+            else break;
+            b = h(t2);
+          }
+        }
+        function H2(a) {
+          B2 = false;
+          G2(a);
+          if (!A2)
+            if (h(r2) !== null) (A2 = true), I2(J2);
+            else {
+              var b = h(t2);
+              b !== null && K2(H2, b.startTime - a);
+            }
+        }
+        function J2(a, b) {
+          A2 = false;
+          B2 && ((B2 = false), E2(L2), (L2 = -1));
+          z2 = true;
+          var c = y2;
+          try {
+            G2(b);
+            for (
+              v2 = h(r2);
+              v2 !== null && (!(v2.expirationTime > b) || (a && !M2()));
+
+            ) {
+              var d = v2.callback;
+              if (typeof d === "function") {
+                v2.callback = null;
+                y2 = v2.priorityLevel;
+                var e = d(v2.expirationTime <= b);
+                b = exports.unstable_now();
+                typeof e === "function"
+                  ? (v2.callback = e)
+                  : v2 === h(r2) && k(r2);
+                G2(b);
+              } else k(r2);
+              v2 = h(r2);
+            }
+            if (v2 !== null) var w2 = true;
+            else {
+              var m = h(t2);
+              m !== null && K2(H2, m.startTime - b);
+              w2 = false;
+            }
+            return w2;
+          } finally {
+            (v2 = null), (y2 = c), (z2 = false);
+          }
+        }
+        var N2 = false,
+          O2 = null,
+          L2 = -1,
+          P2 = 5,
+          Q2 = -1;
+        function M2() {
+          return exports.unstable_now() - Q2 < P2 ? false : true;
+        }
+        function R2() {
+          if (O2 !== null) {
+            var a = exports.unstable_now();
+            Q2 = a;
+            var b = true;
+            try {
+              b = O2(true, a);
+            } finally {
+              b ? S2() : ((N2 = false), (O2 = null));
+            }
+          } else N2 = false;
+        }
+        var S2;
+        if (typeof F2 === "function")
+          S2 = function () {
+            F2(R2);
+          };
+        else if (typeof MessageChannel !== "undefined") {
+          var T2 = new MessageChannel(),
+            U2 = T2.port2;
+          T2.port1.onmessage = R2;
+          S2 = function () {
+            U2.postMessage(null);
+          };
+        } else
+          S2 = function () {
+            D2(R2, 0);
+          };
+        function I2(a) {
+          O2 = a;
+          N2 || ((N2 = true), S2());
+        }
+        function K2(a, b) {
+          L2 = D2(function () {
+            a(exports.unstable_now());
+          }, b);
+        }
+        exports.unstable_IdlePriority = 5;
+        exports.unstable_ImmediatePriority = 1;
+        exports.unstable_LowPriority = 4;
+        exports.unstable_NormalPriority = 3;
+        exports.unstable_Profiling = null;
+        exports.unstable_UserBlockingPriority = 2;
+        exports.unstable_cancelCallback = function (a) {
+          a.callback = null;
+        };
+        exports.unstable_continueExecution = function () {
+          A2 || z2 || ((A2 = true), I2(J2));
+        };
+        exports.unstable_forceFrameRate = function (a) {
+          0 > a || 125 < a
+            ? console.error(
+                "forceFrameRate takes a positive int between 0 and 125, forcing frame rates higher than 125 fps is not supported"
+              )
+            : (P2 = 0 < a ? Math.floor(1e3 / a) : 5);
+        };
+        exports.unstable_getCurrentPriorityLevel = function () {
+          return y2;
+        };
+        exports.unstable_getFirstCallbackNode = function () {
+          return h(r2);
+        };
+        exports.unstable_next = function (a) {
+          switch (y2) {
+            case 1:
+            case 2:
+            case 3:
+              var b = 3;
+              break;
+            default:
+              b = y2;
+          }
+          var c = y2;
+          y2 = b;
+          try {
+            return a();
+          } finally {
+            y2 = c;
+          }
+        };
+        exports.unstable_pauseExecution = function () {};
+        exports.unstable_requestPaint = function () {};
+        exports.unstable_runWithPriority = function (a, b) {
+          switch (a) {
+            case 1:
+            case 2:
+            case 3:
+            case 4:
+            case 5:
+              break;
+            default:
+              a = 3;
+          }
+          var c = y2;
+          y2 = a;
+          try {
+            return b();
+          } finally {
+            y2 = c;
+          }
+        };
+        exports.unstable_scheduleCallback = function (a, b, c) {
+          var d = exports.unstable_now();
+          typeof c === "object" && c !== null
+            ? ((c = c.delay), (c = typeof c === "number" && 0 < c ? d + c : d))
+            : (c = d);
+          switch (a) {
+            case 1:
+              var e = -1;
+              break;
+            case 2:
+              e = 250;
+              break;
+            case 5:
+              e = 1073741823;
+              break;
+            case 4:
+              e = 1e4;
+              break;
+            default:
+              e = 5e3;
+          }
+          e = c + e;
+          a = {
+            id: u2++,
+            callback: b,
+            priorityLevel: a,
+            startTime: c,
+            expirationTime: e,
+            sortIndex: -1,
+          };
+          c > d
+            ? ((a.sortIndex = c),
+              f(t2, a),
+              h(r2) === null &&
+                a === h(t2) &&
+                (B2 ? (E2(L2), (L2 = -1)) : (B2 = true), K2(H2, c - d)))
+            : ((a.sortIndex = e), f(r2, a), A2 || z2 || ((A2 = true), I2(J2)));
+          return a;
+        };
+        exports.unstable_shouldYield = M2;
+        exports.unstable_wrapCallback = function (a) {
+          var b = y2;
+          return function () {
+            var c = y2;
+            y2 = b;
+            try {
+              return a.apply(this, arguments);
+            } finally {
+              y2 = c;
+            }
+          };
+        };
+      })(scheduler_production_min);
+      {
+        scheduler.exports = scheduler_production_min;
+      }
+      /**
+       * @license React
+       * react-dom.production.min.js
+       *
+       * Copyright (c) Facebook, Inc. and its affiliates.
+       *
+       * This source code is licensed under the MIT license found in the
+       * LICENSE file in the root directory of this source tree.
+       */
+      var aa = react.exports,
+        ba = scheduler.exports;
+      function p$1(a) {
+        for (
+          var b = "https://reactjs.org/docs/error-decoder.html?invariant=" + a,
+            c = 1;
+          c < arguments.length;
+          c++
+        )
+          b += "&args[]=" + encodeURIComponent(arguments[c]);
+        return (
+          "Minified React error #" +
+          a +
+          "; visit " +
+          b +
+          " for the full message or use the non-minified dev environment for full errors and additional helpful warnings."
+        );
+      }
+      var ca = /* @__PURE__ */ new Set(),
+        da = {};
+      function ea(a, b) {
+        fa(a, b);
+        fa(a + "Capture", b);
+      }
+      function fa(a, b) {
+        da[a] = b;
+        for (a = 0; a < b.length; a++) ca.add(b[a]);
+      }
+      var ha = !(
+          typeof window === "undefined" ||
+          typeof window.document === "undefined" ||
+          typeof window.document.createElement === "undefined"
+        ),
+        ia = Object.prototype.hasOwnProperty,
+        ja =
+          /^[:A-Z_a-z\u00C0-\u00D6\u00D8-\u00F6\u00F8-\u02FF\u0370-\u037D\u037F-\u1FFF\u200C-\u200D\u2070-\u218F\u2C00-\u2FEF\u3001-\uD7FF\uF900-\uFDCF\uFDF0-\uFFFD][:A-Z_a-z\u00C0-\u00D6\u00D8-\u00F6\u00F8-\u02FF\u0370-\u037D\u037F-\u1FFF\u200C-\u200D\u2070-\u218F\u2C00-\u2FEF\u3001-\uD7FF\uF900-\uFDCF\uFDF0-\uFFFD\-.0-9\u00B7\u0300-\u036F\u203F-\u2040]*$/,
+        ka = {},
+        la = {};
+      function ma(a) {
+        if (ia.call(la, a)) return true;
+        if (ia.call(ka, a)) return false;
+        if (ja.test(a)) return (la[a] = true);
+        ka[a] = true;
+        return false;
+      }
+      function na(a, b, c, d) {
+        if (c !== null && c.type === 0) return false;
+        switch (typeof b) {
+          case "function":
+          case "symbol":
+            return true;
+          case "boolean":
+            if (d) return false;
+            if (c !== null) return !c.acceptsBooleans;
+            a = a.toLowerCase().slice(0, 5);
+            return a !== "data-" && a !== "aria-";
+          default:
+            return false;
+        }
+      }
+      function oa(a, b, c, d) {
+        if (b === null || typeof b === "undefined" || na(a, b, c, d))
+          return true;
+        if (d) return false;
+        if (c !== null)
+          switch (c.type) {
+            case 3:
+              return !b;
+            case 4:
+              return b === false;
+            case 5:
+              return isNaN(b);
+            case 6:
+              return isNaN(b) || 1 > b;
+          }
+        return false;
+      }
+      function q(a, b, c, d, e, f, g) {
+        this.acceptsBooleans = b === 2 || b === 3 || b === 4;
+        this.attributeName = d;
+        this.attributeNamespace = e;
+        this.mustUseProperty = c;
+        this.propertyName = a;
+        this.type = b;
+        this.sanitizeURL = f;
+        this.removeEmptyString = g;
+      }
+      var z = {};
+      "children dangerouslySetInnerHTML defaultValue defaultChecked innerHTML suppressContentEditableWarning suppressHydrationWarning style"
+        .split(" ")
+        .forEach(function (a) {
+          z[a] = new q(a, 0, false, a, null, false, false);
+        });
+      [
+        ["acceptCharset", "accept-charset"],
+        ["className", "class"],
+        ["htmlFor", "for"],
+        ["httpEquiv", "http-equiv"],
+      ].forEach(function (a) {
+        var b = a[0];
+        z[b] = new q(b, 1, false, a[1], null, false, false);
+      });
+      ["contentEditable", "draggable", "spellCheck", "value"].forEach(function (
+        a
+      ) {
+        z[a] = new q(a, 2, false, a.toLowerCase(), null, false, false);
+      });
+      [
+        "autoReverse",
+        "externalResourcesRequired",
+        "focusable",
+        "preserveAlpha",
+      ].forEach(function (a) {
+        z[a] = new q(a, 2, false, a, null, false, false);
+      });
+      "allowFullScreen async autoFocus autoPlay controls default defer disabled disablePictureInPicture disableRemotePlayback formNoValidate hidden loop noModule noValidate open playsInline readOnly required reversed scoped seamless itemScope"
+        .split(" ")
+        .forEach(function (a) {
+          z[a] = new q(a, 3, false, a.toLowerCase(), null, false, false);
+        });
+      ["checked", "multiple", "muted", "selected"].forEach(function (a) {
+        z[a] = new q(a, 3, true, a, null, false, false);
+      });
+      ["capture", "download"].forEach(function (a) {
+        z[a] = new q(a, 4, false, a, null, false, false);
+      });
+      ["cols", "rows", "size", "span"].forEach(function (a) {
+        z[a] = new q(a, 6, false, a, null, false, false);
+      });
+      ["rowSpan", "start"].forEach(function (a) {
+        z[a] = new q(a, 5, false, a.toLowerCase(), null, false, false);
+      });
+      var pa = /[\-:]([a-z])/g;
+      function qa(a) {
+        return a[1].toUpperCase();
+      }
+      "accent-height alignment-baseline arabic-form baseline-shift cap-height clip-path clip-rule color-interpolation color-interpolation-filters color-profile color-rendering dominant-baseline enable-background fill-opacity fill-rule flood-color flood-opacity font-family font-size font-size-adjust font-stretch font-style font-variant font-weight glyph-name glyph-orientation-horizontal glyph-orientation-vertical horiz-adv-x horiz-origin-x image-rendering letter-spacing lighting-color marker-end marker-mid marker-start overline-position overline-thickness paint-order panose-1 pointer-events rendering-intent shape-rendering stop-color stop-opacity strikethrough-position strikethrough-thickness stroke-dasharray stroke-dashoffset stroke-linecap stroke-linejoin stroke-miterlimit stroke-opacity stroke-width text-anchor text-decoration text-rendering underline-position underline-thickness unicode-bidi unicode-range units-per-em v-alphabetic v-hanging v-ideographic v-mathematical vector-effect vert-adv-y vert-origin-x vert-origin-y word-spacing writing-mode xmlns:xlink x-height"
+        .split(" ")
+        .forEach(function (a) {
+          var b = a.replace(pa, qa);
+          z[b] = new q(b, 1, false, a, null, false, false);
+        });
+      "xlink:actuate xlink:arcrole xlink:role xlink:show xlink:title xlink:type"
+        .split(" ")
+        .forEach(function (a) {
+          var b = a.replace(pa, qa);
+          z[b] = new q(
+            b,
+            1,
+            false,
+            a,
+            "http://www.w3.org/1999/xlink",
+            false,
+            false
+          );
+        });
+      ["xml:base", "xml:lang", "xml:space"].forEach(function (a) {
+        var b = a.replace(pa, qa);
+        z[b] = new q(
+          b,
+          1,
+          false,
+          a,
+          "http://www.w3.org/XML/1998/namespace",
+          false,
+          false
+        );
+      });
+      ["tabIndex", "crossOrigin"].forEach(function (a) {
+        z[a] = new q(a, 1, false, a.toLowerCase(), null, false, false);
+      });
+      z.xlinkHref = new q(
+        "xlinkHref",
+        1,
+        false,
+        "xlink:href",
+        "http://www.w3.org/1999/xlink",
+        true,
+        false
+      );
+      ["src", "href", "action", "formAction"].forEach(function (a) {
+        z[a] = new q(a, 1, false, a.toLowerCase(), null, true, true);
+      });
+      function ra(a, b, c, d) {
+        var e = z.hasOwnProperty(b) ? z[b] : null;
+        if (
+          e !== null
+            ? e.type !== 0
+            : d ||
+              !(2 < b.length) ||
+              (b[0] !== "o" && b[0] !== "O") ||
+              (b[1] !== "n" && b[1] !== "N")
+        )
+          oa(b, c, e, d) && (c = null),
+            d || e === null
+              ? ma(b) &&
+                (c === null ? a.removeAttribute(b) : a.setAttribute(b, "" + c))
+              : e.mustUseProperty
+              ? (a[e.propertyName] =
+                  c === null ? (e.type === 3 ? false : "") : c)
+              : ((b = e.attributeName),
+                (d = e.attributeNamespace),
+                c === null
+                  ? a.removeAttribute(b)
+                  : ((e = e.type),
+                    (c = e === 3 || (e === 4 && c === true) ? "" : "" + c),
+                    d ? a.setAttributeNS(d, b, c) : a.setAttribute(b, c)));
+      }
+      var sa = aa.__SECRET_INTERNALS_DO_NOT_USE_OR_YOU_WILL_BE_FIRED,
+        ta = Symbol.for("react.element"),
+        ua = Symbol.for("react.portal"),
+        va = Symbol.for("react.fragment"),
+        wa = Symbol.for("react.strict_mode"),
+        xa = Symbol.for("react.profiler"),
+        ya = Symbol.for("react.provider"),
+        Aa = Symbol.for("react.context"),
+        Ba = Symbol.for("react.forward_ref"),
+        Ca = Symbol.for("react.suspense"),
+        Da = Symbol.for("react.suspense_list"),
+        Ea = Symbol.for("react.memo"),
+        Fa = Symbol.for("react.lazy");
+      var Ga = Symbol.for("react.offscreen");
+      var Ha = Symbol.iterator;
+      function Ia(a) {
+        if (a === null || typeof a !== "object") return null;
+        a = (Ha && a[Ha]) || a["@@iterator"];
+        return typeof a === "function" ? a : null;
+      }
+      var A = Object.assign,
+        Ja;
+      function Ka(a) {
+        if (Ja === void 0)
+          try {
+            throw Error();
+          } catch (c) {
+            var b = c.stack.trim().match(/\n( *(at )?)/);
+            Ja = (b && b[1]) || "";
+          }
+        return "\n" + Ja + a;
+      }
+      var La = false;
+      function Ma(a, b) {
+        if (!a || La) return "";
+        La = true;
+        var c = Error.prepareStackTrace;
+        Error.prepareStackTrace = void 0;
+        try {
+          if (b)
+            if (
+              ((b = function () {
+                throw Error();
+              }),
+              Object.defineProperty(b.prototype, "props", {
+                set: function () {
+                  throw Error();
+                },
+              }),
+              typeof Reflect === "object" && Reflect.construct)
+            ) {
+              try {
+                Reflect.construct(b, []);
+              } catch (l2) {
+                var d = l2;
+              }
+              Reflect.construct(a, [], b);
+            } else {
+              try {
+                b.call();
+              } catch (l2) {
+                d = l2;
+              }
+              a.call(b.prototype);
+            }
+          else {
+            try {
+              throw Error();
+            } catch (l2) {
+              d = l2;
+            }
+            a();
+          }
+        } catch (l2) {
+          if (l2 && d && typeof l2.stack === "string") {
+            for (
+              var e = l2.stack.split("\n"),
+                f = d.stack.split("\n"),
+                g = e.length - 1,
+                h = f.length - 1;
+              1 <= g && 0 <= h && e[g] !== f[h];
+
+            )
+              h--;
+            for (; 1 <= g && 0 <= h; g--, h--)
+              if (e[g] !== f[h]) {
+                if (g !== 1 || h !== 1) {
+                  do
+                    if ((g--, h--, 0 > h || e[g] !== f[h])) {
+                      var k = "\n" + e[g].replace(" at new ", " at ");
+                      a.displayName &&
+                        k.includes("<anonymous>") &&
+                        (k = k.replace("<anonymous>", a.displayName));
+                      return k;
+                    }
+                  while (1 <= g && 0 <= h);
+                }
+                break;
+              }
+          }
+        } finally {
+          (La = false), (Error.prepareStackTrace = c);
+        }
+        return (a = a ? a.displayName || a.name : "") ? Ka(a) : "";
+      }
+      function Na(a) {
+        switch (a.tag) {
+          case 5:
+            return Ka(a.type);
+          case 16:
+            return Ka("Lazy");
+          case 13:
+            return Ka("Suspense");
+          case 19:
+            return Ka("SuspenseList");
+          case 0:
+          case 2:
+          case 15:
+            return (a = Ma(a.type, false)), a;
+          case 11:
+            return (a = Ma(a.type.render, false)), a;
+          case 1:
+            return (a = Ma(a.type, true)), a;
+          default:
+            return "";
+        }
+      }
+      function Oa(a) {
+        if (a == null) return null;
+        if (typeof a === "function") return a.displayName || a.name || null;
+        if (typeof a === "string") return a;
+        switch (a) {
+          case va:
+            return "Fragment";
+          case ua:
+            return "Portal";
+          case xa:
+            return "Profiler";
+          case wa:
+            return "StrictMode";
+          case Ca:
+            return "Suspense";
+          case Da:
+            return "SuspenseList";
+        }
+        if (typeof a === "object")
+          switch (a.$$typeof) {
+            case Aa:
+              return (a.displayName || "Context") + ".Consumer";
+            case ya:
+              return (a._context.displayName || "Context") + ".Provider";
+            case Ba:
+              var b = a.render;
+              a = a.displayName;
+              a ||
+                ((a = b.displayName || b.name || ""),
+                (a = a !== "" ? "ForwardRef(" + a + ")" : "ForwardRef"));
+              return a;
+            case Ea:
+              return (
+                (b = a.displayName || null),
+                b !== null ? b : Oa(a.type) || "Memo"
+              );
+            case Fa:
+              b = a._payload;
+              a = a._init;
+              try {
+                return Oa(a(b));
+              } catch (c) {}
+          }
+        return null;
+      }
+      function Pa(a) {
+        var b = a.type;
+        switch (a.tag) {
+          case 24:
+            return "Cache";
+          case 9:
+            return (b.displayName || "Context") + ".Consumer";
+          case 10:
+            return (b._context.displayName || "Context") + ".Provider";
+          case 18:
+            return "DehydratedFragment";
+          case 11:
+            return (
+              (a = b.render),
+              (a = a.displayName || a.name || ""),
+              b.displayName ||
+                (a !== "" ? "ForwardRef(" + a + ")" : "ForwardRef")
+            );
+          case 7:
+            return "Fragment";
+          case 5:
+            return b;
+          case 4:
+            return "Portal";
+          case 3:
+            return "Root";
+          case 6:
+            return "Text";
+          case 16:
+            return Oa(b);
+          case 8:
+            return b === wa ? "StrictMode" : "Mode";
+          case 22:
+            return "Offscreen";
+          case 12:
+            return "Profiler";
+          case 21:
+            return "Scope";
+          case 13:
+            return "Suspense";
+          case 19:
+            return "SuspenseList";
+          case 25:
+            return "TracingMarker";
+          case 1:
+          case 0:
+          case 17:
+          case 2:
+          case 14:
+          case 15:
+            if (typeof b === "function") return b.displayName || b.name || null;
+            if (typeof b === "string") return b;
+        }
+        return null;
+      }
+      function Qa(a) {
+        switch (typeof a) {
+          case "boolean":
+          case "number":
+          case "string":
+          case "undefined":
+            return a;
+          case "object":
+            return a;
+          default:
+            return "";
+        }
+      }
+      function Ra(a) {
+        var b = a.type;
+        return (
+          (a = a.nodeName) &&
+          a.toLowerCase() === "input" &&
+          (b === "checkbox" || b === "radio")
+        );
+      }
+      function Sa(a) {
+        var b = Ra(a) ? "checked" : "value",
+          c = Object.getOwnPropertyDescriptor(a.constructor.prototype, b),
+          d = "" + a[b];
+        if (
+          !a.hasOwnProperty(b) &&
+          typeof c !== "undefined" &&
+          typeof c.get === "function" &&
+          typeof c.set === "function"
+        ) {
+          var e = c.get,
+            f = c.set;
+          Object.defineProperty(a, b, {
+            configurable: true,
+            get: function () {
+              return e.call(this);
+            },
+            set: function (a2) {
+              d = "" + a2;
+              f.call(this, a2);
+            },
+          });
+          Object.defineProperty(a, b, { enumerable: c.enumerable });
+          return {
+            getValue: function () {
+              return d;
+            },
+            setValue: function (a2) {
+              d = "" + a2;
+            },
+            stopTracking: function () {
+              a._valueTracker = null;
+              delete a[b];
+            },
+          };
+        }
+      }
+      function Ta(a) {
+        a._valueTracker || (a._valueTracker = Sa(a));
+      }
+      function Ua(a) {
+        if (!a) return false;
+        var b = a._valueTracker;
+        if (!b) return true;
+        var c = b.getValue();
+        var d = "";
+        a && (d = Ra(a) ? (a.checked ? "true" : "false") : a.value);
+        a = d;
+        return a !== c ? (b.setValue(a), true) : false;
+      }
+      function Va(a) {
+        a = a || (typeof document !== "undefined" ? document : void 0);
+        if (typeof a === "undefined") return null;
+        try {
+          return a.activeElement || a.body;
+        } catch (b) {
+          return a.body;
+        }
+      }
+      function Wa(a, b) {
+        var c = b.checked;
+        return A({}, b, {
+          defaultChecked: void 0,
+          defaultValue: void 0,
+          value: void 0,
+          checked: c != null ? c : a._wrapperState.initialChecked,
+        });
+      }
+      function Xa(a, b) {
+        var c = b.defaultValue == null ? "" : b.defaultValue,
+          d = b.checked != null ? b.checked : b.defaultChecked;
+        c = Qa(b.value != null ? b.value : c);
+        a._wrapperState = {
+          initialChecked: d,
+          initialValue: c,
+          controlled:
+            b.type === "checkbox" || b.type === "radio"
+              ? b.checked != null
+              : b.value != null,
+        };
+      }
+      function Ya(a, b) {
+        b = b.checked;
+        b != null && ra(a, "checked", b, false);
+      }
+      function Za(a, b) {
+        Ya(a, b);
+        var c = Qa(b.value),
+          d = b.type;
+        if (c != null)
+          if (d === "number") {
+            if ((c === 0 && a.value === "") || a.value != c) a.value = "" + c;
+          } else a.value !== "" + c && (a.value = "" + c);
+        else if (d === "submit" || d === "reset") {
+          a.removeAttribute("value");
+          return;
+        }
+        b.hasOwnProperty("value")
+          ? $a(a, b.type, c)
+          : b.hasOwnProperty("defaultValue") &&
+            $a(a, b.type, Qa(b.defaultValue));
+        b.checked == null &&
+          b.defaultChecked != null &&
+          (a.defaultChecked = !!b.defaultChecked);
+      }
+      function ab(a, b, c) {
+        if (b.hasOwnProperty("value") || b.hasOwnProperty("defaultValue")) {
+          var d = b.type;
+          if (
+            !(
+              (d !== "submit" && d !== "reset") ||
+              (b.value !== void 0 && b.value !== null)
+            )
+          )
+            return;
+          b = "" + a._wrapperState.initialValue;
+          c || b === a.value || (a.value = b);
+          a.defaultValue = b;
+        }
+        c = a.name;
+        c !== "" && (a.name = "");
+        a.defaultChecked = !!a._wrapperState.initialChecked;
+        c !== "" && (a.name = c);
+      }
+      function $a(a, b, c) {
+        if (b !== "number" || Va(a.ownerDocument) !== a)
+          c == null
+            ? (a.defaultValue = "" + a._wrapperState.initialValue)
+            : a.defaultValue !== "" + c && (a.defaultValue = "" + c);
+      }
+      var bb = Array.isArray;
+      function cb(a, b, c, d) {
+        a = a.options;
+        if (b) {
+          b = {};
+          for (var e = 0; e < c.length; e++) b["$" + c[e]] = true;
+          for (c = 0; c < a.length; c++)
+            (e = b.hasOwnProperty("$" + a[c].value)),
+              a[c].selected !== e && (a[c].selected = e),
+              e && d && (a[c].defaultSelected = true);
+        } else {
+          c = "" + Qa(c);
+          b = null;
+          for (e = 0; e < a.length; e++) {
+            if (a[e].value === c) {
+              a[e].selected = true;
+              d && (a[e].defaultSelected = true);
+              return;
+            }
+            b !== null || a[e].disabled || (b = a[e]);
+          }
+          b !== null && (b.selected = true);
+        }
+      }
+      function db(a, b) {
+        if (b.dangerouslySetInnerHTML != null) throw Error(p$1(91));
+        return A({}, b, {
+          value: void 0,
+          defaultValue: void 0,
+          children: "" + a._wrapperState.initialValue,
+        });
+      }
+      function eb(a, b) {
+        var c = b.value;
+        if (c == null) {
+          c = b.children;
+          b = b.defaultValue;
+          if (c != null) {
+            if (b != null) throw Error(p$1(92));
+            if (bb(c)) {
+              if (1 < c.length) throw Error(p$1(93));
+              c = c[0];
+            }
+            b = c;
+          }
+          b == null && (b = "");
+          c = b;
+        }
+        a._wrapperState = { initialValue: Qa(c) };
+      }
+      function fb(a, b) {
+        var c = Qa(b.value),
+          d = Qa(b.defaultValue);
+        c != null &&
+          ((c = "" + c),
+          c !== a.value && (a.value = c),
+          b.defaultValue == null &&
+            a.defaultValue !== c &&
+            (a.defaultValue = c));
+        d != null && (a.defaultValue = "" + d);
+      }
+      function gb(a) {
+        var b = a.textContent;
+        b === a._wrapperState.initialValue &&
+          b !== "" &&
+          b !== null &&
+          (a.value = b);
+      }
+      function hb(a) {
+        switch (a) {
+          case "svg":
+            return "http://www.w3.org/2000/svg";
+          case "math":
+            return "http://www.w3.org/1998/Math/MathML";
+          default:
+            return "http://www.w3.org/1999/xhtml";
+        }
+      }
+      function ib(a, b) {
+        return a == null || a === "http://www.w3.org/1999/xhtml"
+          ? hb(b)
+          : a === "http://www.w3.org/2000/svg" && b === "foreignObject"
+          ? "http://www.w3.org/1999/xhtml"
+          : a;
+      }
+      var jb,
+        kb = (function (a) {
+          return typeof MSApp !== "undefined" && MSApp.execUnsafeLocalFunction
+            ? function (b, c, d, e) {
+                MSApp.execUnsafeLocalFunction(function () {
+                  return a(b, c, d, e);
+                });
+              }
+            : a;
+        })(function (a, b) {
+          if (
+            a.namespaceURI !== "http://www.w3.org/2000/svg" ||
+            "innerHTML" in a
+          )
+            a.innerHTML = b;
+          else {
+            jb = jb || document.createElement("div");
+            jb.innerHTML = "<svg>" + b.valueOf().toString() + "</svg>";
+            for (b = jb.firstChild; a.firstChild; ) a.removeChild(a.firstChild);
+            for (; b.firstChild; ) a.appendChild(b.firstChild);
+          }
+        });
+      function lb(a, b) {
+        if (b) {
+          var c = a.firstChild;
+          if (c && c === a.lastChild && c.nodeType === 3) {
+            c.nodeValue = b;
+            return;
+          }
+        }
+        a.textContent = b;
+      }
+      var mb = {
+          animationIterationCount: true,
+          aspectRatio: true,
+          borderImageOutset: true,
+          borderImageSlice: true,
+          borderImageWidth: true,
+          boxFlex: true,
+          boxFlexGroup: true,
+          boxOrdinalGroup: true,
+          columnCount: true,
+          columns: true,
+          flex: true,
+          flexGrow: true,
+          flexPositive: true,
+          flexShrink: true,
+          flexNegative: true,
+          flexOrder: true,
+          gridArea: true,
+          gridRow: true,
+          gridRowEnd: true,
+          gridRowSpan: true,
+          gridRowStart: true,
+          gridColumn: true,
+          gridColumnEnd: true,
+          gridColumnSpan: true,
+          gridColumnStart: true,
+          fontWeight: true,
+          lineClamp: true,
+          lineHeight: true,
+          opacity: true,
+          order: true,
+          orphans: true,
+          tabSize: true,
+          widows: true,
+          zIndex: true,
+          zoom: true,
+          fillOpacity: true,
+          floodOpacity: true,
+          stopOpacity: true,
+          strokeDasharray: true,
+          strokeDashoffset: true,
+          strokeMiterlimit: true,
+          strokeOpacity: true,
+          strokeWidth: true,
+        },
+        nb = ["Webkit", "ms", "Moz", "O"];
+      Object.keys(mb).forEach(function (a) {
+        nb.forEach(function (b) {
+          b = b + a.charAt(0).toUpperCase() + a.substring(1);
+          mb[b] = mb[a];
+        });
+      });
+      function ob(a, b, c) {
+        return b == null || typeof b === "boolean" || b === ""
+          ? ""
+          : c ||
+            typeof b !== "number" ||
+            b === 0 ||
+            (mb.hasOwnProperty(a) && mb[a])
+          ? ("" + b).trim()
+          : b + "px";
+      }
+      function pb(a, b) {
+        a = a.style;
+        for (var c in b)
+          if (b.hasOwnProperty(c)) {
+            var d = c.indexOf("--") === 0,
+              e = ob(c, b[c], d);
+            c === "float" && (c = "cssFloat");
+            d ? a.setProperty(c, e) : (a[c] = e);
+          }
+      }
+      var qb = A(
+        { menuitem: true },
+        {
+          area: true,
+          base: true,
+          br: true,
+          col: true,
+          embed: true,
+          hr: true,
+          img: true,
+          input: true,
+          keygen: true,
+          link: true,
+          meta: true,
+          param: true,
+          source: true,
+          track: true,
+          wbr: true,
+        }
+      );
+      function rb(a, b) {
+        if (b) {
+          if (
+            qb[a] &&
+            (b.children != null || b.dangerouslySetInnerHTML != null)
+          )
+            throw Error(p$1(137, a));
+          if (b.dangerouslySetInnerHTML != null) {
+            if (b.children != null) throw Error(p$1(60));
+            if (
+              typeof b.dangerouslySetInnerHTML !== "object" ||
+              !("__html" in b.dangerouslySetInnerHTML)
+            )
+              throw Error(p$1(61));
+          }
+          if (b.style != null && typeof b.style !== "object")
+            throw Error(p$1(62));
+        }
+      }
+      function sb(a, b) {
+        if (a.indexOf("-") === -1) return typeof b.is === "string";
+        switch (a) {
+          case "annotation-xml":
+          case "color-profile":
+          case "font-face":
+          case "font-face-src":
+          case "font-face-uri":
+          case "font-face-format":
+          case "font-face-name":
+          case "missing-glyph":
+            return false;
+          default:
+            return true;
+        }
+      }
+      var tb = null;
+      function ub(a) {
+        a = a.target || a.srcElement || window;
+        a.correspondingUseElement && (a = a.correspondingUseElement);
+        return a.nodeType === 3 ? a.parentNode : a;
+      }
+      var vb = null,
+        wb = null,
+        xb = null;
+      function yb(a) {
+        if ((a = zb(a))) {
+          if (typeof vb !== "function") throw Error(p$1(280));
+          var b = a.stateNode;
+          b && ((b = Ab(b)), vb(a.stateNode, a.type, b));
+        }
+      }
+      function Bb(a) {
+        wb ? (xb ? xb.push(a) : (xb = [a])) : (wb = a);
+      }
+      function Cb() {
+        if (wb) {
+          var a = wb,
+            b = xb;
+          xb = wb = null;
+          yb(a);
+          if (b) for (a = 0; a < b.length; a++) yb(b[a]);
+        }
+      }
+      function Db(a, b) {
+        return a(b);
+      }
+      function Eb() {}
+      var Fb = false;
+      function Gb(a, b, c) {
+        if (Fb) return a(b, c);
+        Fb = true;
+        try {
+          return Db(a, b, c);
+        } finally {
+          if (((Fb = false), wb !== null || xb !== null)) Eb(), Cb();
+        }
+      }
+      function Hb(a, b) {
+        var c = a.stateNode;
+        if (c === null) return null;
+        var d = Ab(c);
+        if (d === null) return null;
+        c = d[b];
+        a: switch (b) {
+          case "onClick":
+          case "onClickCapture":
+          case "onDoubleClick":
+          case "onDoubleClickCapture":
+          case "onMouseDown":
+          case "onMouseDownCapture":
+          case "onMouseMove":
+          case "onMouseMoveCapture":
+          case "onMouseUp":
+          case "onMouseUpCapture":
+          case "onMouseEnter":
+            (d = !d.disabled) ||
+              ((a = a.type),
+              (d = !(
+                a === "button" ||
+                a === "input" ||
+                a === "select" ||
+                a === "textarea"
+              )));
+            a = !d;
+            break a;
+          default:
+            a = false;
+        }
+        if (a) return null;
+        if (c && typeof c !== "function") throw Error(p$1(231, b, typeof c));
+        return c;
+      }
+      var Ib = false;
+      if (ha)
+        try {
+          var Jb = {};
+          Object.defineProperty(Jb, "passive", {
+            get: function () {
+              Ib = true;
+            },
+          });
+          window.addEventListener("test", Jb, Jb);
+          window.removeEventListener("test", Jb, Jb);
+        } catch (a) {
+          Ib = false;
+        }
+      function Kb(a, b, c, d, e, f, g, h, k) {
+        var l2 = Array.prototype.slice.call(arguments, 3);
+        try {
+          b.apply(c, l2);
+        } catch (m) {
+          this.onError(m);
+        }
+      }
+      var Lb = false,
+        Mb = null,
+        Nb = false,
+        Ob = null,
+        Pb = {
+          onError: function (a) {
+            Lb = true;
+            Mb = a;
+          },
+        };
+      function Qb(a, b, c, d, e, f, g, h, k) {
+        Lb = false;
+        Mb = null;
+        Kb.apply(Pb, arguments);
+      }
+      function Rb(a, b, c, d, e, f, g, h, k) {
+        Qb.apply(this, arguments);
+        if (Lb) {
+          if (Lb) {
+            var l2 = Mb;
+            Lb = false;
+            Mb = null;
+          } else throw Error(p$1(198));
+          Nb || ((Nb = true), (Ob = l2));
+        }
+      }
+      function Sb(a) {
+        var b = a,
+          c = a;
+        if (a.alternate) for (; b.return; ) b = b.return;
+        else {
+          a = b;
+          do (b = a), (b.flags & 4098) !== 0 && (c = b.return), (a = b.return);
+          while (a);
+        }
+        return b.tag === 3 ? c : null;
+      }
+      function Tb(a) {
+        if (a.tag === 13) {
+          var b = a.memoizedState;
+          b === null &&
+            ((a = a.alternate), a !== null && (b = a.memoizedState));
+          if (b !== null) return b.dehydrated;
+        }
+        return null;
+      }
+      function Ub(a) {
+        if (Sb(a) !== a) throw Error(p$1(188));
+      }
+      function Vb(a) {
+        var b = a.alternate;
+        if (!b) {
+          b = Sb(a);
+          if (b === null) throw Error(p$1(188));
+          return b !== a ? null : a;
+        }
+        for (var c = a, d = b; ; ) {
+          var e = c.return;
+          if (e === null) break;
+          var f = e.alternate;
+          if (f === null) {
+            d = e.return;
+            if (d !== null) {
+              c = d;
+              continue;
+            }
+            break;
+          }
+          if (e.child === f.child) {
+            for (f = e.child; f; ) {
+              if (f === c) return Ub(e), a;
+              if (f === d) return Ub(e), b;
+              f = f.sibling;
+            }
+            throw Error(p$1(188));
+          }
+          if (c.return !== d.return) (c = e), (d = f);
+          else {
+            for (var g = false, h = e.child; h; ) {
+              if (h === c) {
+                g = true;
+                c = e;
+                d = f;
+                break;
+              }
+              if (h === d) {
+                g = true;
+                d = e;
+                c = f;
+                break;
+              }
+              h = h.sibling;
+            }
+            if (!g) {
+              for (h = f.child; h; ) {
+                if (h === c) {
+                  g = true;
+                  c = f;
+                  d = e;
+                  break;
+                }
+                if (h === d) {
+                  g = true;
+                  d = f;
+                  c = e;
+                  break;
+                }
+                h = h.sibling;
+              }
+              if (!g) throw Error(p$1(189));
+            }
+          }
+          if (c.alternate !== d) throw Error(p$1(190));
+        }
+        if (c.tag !== 3) throw Error(p$1(188));
+        return c.stateNode.current === c ? a : b;
+      }
+      function Wb(a) {
+        a = Vb(a);
+        return a !== null ? Xb(a) : null;
+      }
+      function Xb(a) {
+        if (a.tag === 5 || a.tag === 6) return a;
+        for (a = a.child; a !== null; ) {
+          var b = Xb(a);
+          if (b !== null) return b;
+          a = a.sibling;
+        }
+        return null;
+      }
+      var Yb = ba.unstable_scheduleCallback,
+        Zb = ba.unstable_cancelCallback,
+        $b = ba.unstable_shouldYield,
+        ac$1 = ba.unstable_requestPaint,
+        D = ba.unstable_now,
+        bc = ba.unstable_getCurrentPriorityLevel,
+        cc = ba.unstable_ImmediatePriority,
+        dc = ba.unstable_UserBlockingPriority,
+        ec = ba.unstable_NormalPriority,
+        fc = ba.unstable_LowPriority,
+        gc = ba.unstable_IdlePriority,
+        hc = null,
+        ic$1 = null;
+      function jc(a) {
+        if (ic$1 && typeof ic$1.onCommitFiberRoot === "function")
+          try {
+            ic$1.onCommitFiberRoot(
+              hc,
+              a,
+              void 0,
+              (a.current.flags & 128) === 128
+            );
+          } catch (b) {}
+      }
+      var lc = Math.clz32 ? Math.clz32 : kc,
+        mc = Math.log,
+        nc = Math.LN2;
+      function kc(a) {
+        a >>>= 0;
+        return a === 0 ? 32 : (31 - ((mc(a) / nc) | 0)) | 0;
+      }
+      var oc = 64,
+        pc = 4194304;
+      function qc(a) {
+        switch (a & -a) {
+          case 1:
+            return 1;
+          case 2:
+            return 2;
+          case 4:
+            return 4;
+          case 8:
+            return 8;
+          case 16:
+            return 16;
+          case 32:
+            return 32;
+          case 64:
+          case 128:
+          case 256:
+          case 512:
+          case 1024:
+          case 2048:
+          case 4096:
+          case 8192:
+          case 16384:
+          case 32768:
+          case 65536:
+          case 131072:
+          case 262144:
+          case 524288:
+          case 1048576:
+          case 2097152:
+            return a & 4194240;
+          case 4194304:
+          case 8388608:
+          case 16777216:
+          case 33554432:
+          case 67108864:
+            return a & 130023424;
+          case 134217728:
+            return 134217728;
+          case 268435456:
+            return 268435456;
+          case 536870912:
+            return 536870912;
+          case 1073741824:
+            return 1073741824;
+          default:
+            return a;
+        }
+      }
+      function rc(a, b) {
+        var c = a.pendingLanes;
+        if (c === 0) return 0;
+        var d = 0,
+          e = a.suspendedLanes,
+          f = a.pingedLanes,
+          g = c & 268435455;
+        if (g !== 0) {
+          var h = g & ~e;
+          h !== 0 ? (d = qc(h)) : ((f &= g), f !== 0 && (d = qc(f)));
+        } else (g = c & ~e), g !== 0 ? (d = qc(g)) : f !== 0 && (d = qc(f));
+        if (d === 0) return 0;
+        if (
+          b !== 0 &&
+          b !== d &&
+          (b & e) === 0 &&
+          ((e = d & -d),
+          (f = b & -b),
+          e >= f || (e === 16 && (f & 4194240) !== 0))
+        )
+          return b;
+        (d & 4) !== 0 && (d |= c & 16);
+        b = a.entangledLanes;
+        if (b !== 0)
+          for (a = a.entanglements, b &= d; 0 < b; )
+            (c = 31 - lc(b)), (e = 1 << c), (d |= a[c]), (b &= ~e);
+        return d;
+      }
+      function sc$1(a, b) {
+        switch (a) {
+          case 1:
+          case 2:
+          case 4:
+            return b + 250;
+          case 8:
+          case 16:
+          case 32:
+          case 64:
+          case 128:
+          case 256:
+          case 512:
+          case 1024:
+          case 2048:
+          case 4096:
+          case 8192:
+          case 16384:
+          case 32768:
+          case 65536:
+          case 131072:
+          case 262144:
+          case 524288:
+          case 1048576:
+          case 2097152:
+            return b + 5e3;
+          case 4194304:
+          case 8388608:
+          case 16777216:
+          case 33554432:
+          case 67108864:
+            return -1;
+          case 134217728:
+          case 268435456:
+          case 536870912:
+          case 1073741824:
+            return -1;
+          default:
+            return -1;
+        }
+      }
+      function tc(a, b) {
+        for (
+          var c = a.suspendedLanes,
+            d = a.pingedLanes,
+            e = a.expirationTimes,
+            f = a.pendingLanes;
+          0 < f;
+
+        ) {
+          var g = 31 - lc(f),
+            h = 1 << g,
+            k = e[g];
+          if (k === -1) {
+            if ((h & c) === 0 || (h & d) !== 0) e[g] = sc$1(h, b);
+          } else k <= b && (a.expiredLanes |= h);
+          f &= ~h;
+        }
+      }
+      function uc(a) {
+        a = a.pendingLanes & -1073741825;
+        return a !== 0 ? a : a & 1073741824 ? 1073741824 : 0;
+      }
+      function vc(a) {
+        for (var b = [], c = 0; 31 > c; c++) b.push(a);
+        return b;
+      }
+      function wc(a, b, c) {
+        a.pendingLanes |= b;
+        b !== 536870912 && ((a.suspendedLanes = 0), (a.pingedLanes = 0));
+        a = a.eventTimes;
+        b = 31 - lc(b);
+        a[b] = c;
+      }
+      function xc(a, b) {
+        var c = a.pendingLanes & ~b;
+        a.pendingLanes = b;
+        a.suspendedLanes = 0;
+        a.pingedLanes = 0;
+        a.expiredLanes &= b;
+        a.mutableReadLanes &= b;
+        a.entangledLanes &= b;
+        b = a.entanglements;
+        var d = a.eventTimes;
+        for (a = a.expirationTimes; 0 < c; ) {
+          var e = 31 - lc(c),
+            f = 1 << e;
+          b[e] = 0;
+          d[e] = -1;
+          a[e] = -1;
+          c &= ~f;
+        }
+      }
+      function yc(a, b) {
+        var c = (a.entangledLanes |= b);
+        for (a = a.entanglements; c; ) {
+          var d = 31 - lc(c),
+            e = 1 << d;
+          (e & b) | (a[d] & b) && (a[d] |= b);
+          c &= ~e;
+        }
+      }
+      var E = 0;
+      function zc(a) {
+        a &= -a;
+        return 1 < a
+          ? 4 < a
+            ? (a & 268435455) !== 0
+              ? 16
+              : 536870912
+            : 4
+          : 1;
+      }
+      var Ac,
+        Bc,
+        Cc,
+        Dc,
+        Ec,
+        Fc = false,
+        Gc = [],
+        Hc = null,
+        Ic = null,
+        Jc = null,
+        Kc = /* @__PURE__ */ new Map(),
+        Lc = /* @__PURE__ */ new Map(),
+        Mc = [],
+        Nc =
+          "mousedown mouseup touchcancel touchend touchstart auxclick dblclick pointercancel pointerdown pointerup dragend dragstart drop compositionend compositionstart keydown keypress keyup input textInput copy cut paste click change contextmenu reset submit".split(
+            " "
+          );
+      function Oc(a, b) {
+        switch (a) {
+          case "focusin":
+          case "focusout":
+            Hc = null;
+            break;
+          case "dragenter":
+          case "dragleave":
+            Ic = null;
+            break;
+          case "mouseover":
+          case "mouseout":
+            Jc = null;
+            break;
+          case "pointerover":
+          case "pointerout":
+            Kc.delete(b.pointerId);
+            break;
+          case "gotpointercapture":
+          case "lostpointercapture":
+            Lc.delete(b.pointerId);
+        }
+      }
+      function Pc(a, b, c, d, e, f) {
+        if (a === null || a.nativeEvent !== f)
+          return (
+            (a = {
+              blockedOn: b,
+              domEventName: c,
+              eventSystemFlags: d,
+              nativeEvent: f,
+              targetContainers: [e],
+            }),
+            b !== null && ((b = zb(b)), b !== null && Bc(b)),
+            a
+          );
+        a.eventSystemFlags |= d;
+        b = a.targetContainers;
+        e !== null && b.indexOf(e) === -1 && b.push(e);
+        return a;
+      }
+      function Qc(a, b, c, d, e) {
+        switch (b) {
+          case "focusin":
+            return (Hc = Pc(Hc, a, b, c, d, e)), true;
+          case "dragenter":
+            return (Ic = Pc(Ic, a, b, c, d, e)), true;
+          case "mouseover":
+            return (Jc = Pc(Jc, a, b, c, d, e)), true;
+          case "pointerover":
+            var f = e.pointerId;
+            Kc.set(f, Pc(Kc.get(f) || null, a, b, c, d, e));
+            return true;
+          case "gotpointercapture":
+            return (
+              (f = e.pointerId),
+              Lc.set(f, Pc(Lc.get(f) || null, a, b, c, d, e)),
+              true
+            );
+        }
+        return false;
+      }
+      function Rc(a) {
+        var b = Sc$1(a.target);
+        if (b !== null) {
+          var c = Sb(b);
+          if (c !== null) {
+            if (((b = c.tag), b === 13)) {
+              if (((b = Tb(c)), b !== null)) {
+                a.blockedOn = b;
+                Ec(a.priority, function () {
+                  Cc(c);
+                });
+                return;
+              }
+            } else if (
+              b === 3 &&
+              c.stateNode.current.memoizedState.isDehydrated
+            ) {
+              a.blockedOn = c.tag === 3 ? c.stateNode.containerInfo : null;
+              return;
+            }
+          }
+        }
+        a.blockedOn = null;
+      }
+      function Tc(a) {
+        if (a.blockedOn !== null) return false;
+        for (var b = a.targetContainers; 0 < b.length; ) {
+          var c = Uc(a.domEventName, a.eventSystemFlags, b[0], a.nativeEvent);
+          if (c === null) {
+            c = a.nativeEvent;
+            var d = new c.constructor(c.type, c);
+            tb = d;
+            c.target.dispatchEvent(d);
+            tb = null;
+          } else
+            return (b = zb(c)), b !== null && Bc(b), (a.blockedOn = c), false;
+          b.shift();
+        }
+        return true;
+      }
+      function Vc(a, b, c) {
+        Tc(a) && c.delete(b);
+      }
+      function Wc() {
+        Fc = false;
+        Hc !== null && Tc(Hc) && (Hc = null);
+        Ic !== null && Tc(Ic) && (Ic = null);
+        Jc !== null && Tc(Jc) && (Jc = null);
+        Kc.forEach(Vc);
+        Lc.forEach(Vc);
+      }
+      function Xc(a, b) {
+        a.blockedOn === b &&
+          ((a.blockedOn = null),
+          Fc ||
+            ((Fc = true),
+            ba.unstable_scheduleCallback(ba.unstable_NormalPriority, Wc)));
+      }
+      function Yc(a) {
+        function b(b2) {
+          return Xc(b2, a);
+        }
+        if (0 < Gc.length) {
+          Xc(Gc[0], a);
+          for (var c = 1; c < Gc.length; c++) {
+            var d = Gc[c];
+            d.blockedOn === a && (d.blockedOn = null);
+          }
+        }
+        Hc !== null && Xc(Hc, a);
+        Ic !== null && Xc(Ic, a);
+        Jc !== null && Xc(Jc, a);
+        Kc.forEach(b);
+        Lc.forEach(b);
+        for (c = 0; c < Mc.length; c++)
+          (d = Mc[c]), d.blockedOn === a && (d.blockedOn = null);
+        for (; 0 < Mc.length && ((c = Mc[0]), c.blockedOn === null); )
+          Rc(c), c.blockedOn === null && Mc.shift();
+      }
+      var Zc = sa.ReactCurrentBatchConfig;
+      function $c(a, b, c, d) {
+        var e = E,
+          f = Zc.transition;
+        Zc.transition = null;
+        try {
+          (E = 1), ad(a, b, c, d);
+        } finally {
+          (E = e), (Zc.transition = f);
+        }
+      }
+      function bd(a, b, c, d) {
+        var e = E,
+          f = Zc.transition;
+        Zc.transition = null;
+        try {
+          (E = 4), ad(a, b, c, d);
+        } finally {
+          (E = e), (Zc.transition = f);
+        }
+      }
+      function ad(a, b, c, d) {
+        var e = Uc(a, b, c, d);
+        if (e === null) cd(a, b, d, dd$1, c), Oc(a, d);
+        else if (Qc(e, a, b, c, d)) d.stopPropagation();
+        else if ((Oc(a, d), b & 4 && -1 < Nc.indexOf(a))) {
+          for (; e !== null; ) {
+            var f = zb(e);
+            f !== null && Ac(f);
+            f = Uc(a, b, c, d);
+            f === null && cd(a, b, d, dd$1, c);
+            if (f === e) break;
+            e = f;
+          }
+          e !== null && d.stopPropagation();
+        } else cd(a, b, d, null, c);
+      }
+      var dd$1 = null;
+      function Uc(a, b, c, d) {
+        dd$1 = null;
+        a = ub(d);
+        a = Sc$1(a);
+        if (a !== null)
+          if (((b = Sb(a)), b === null)) a = null;
+          else if (((c = b.tag), c === 13)) {
+            a = Tb(b);
+            if (a !== null) return a;
+            a = null;
+          } else if (c === 3) {
+            if (b.stateNode.current.memoizedState.isDehydrated)
+              return b.tag === 3 ? b.stateNode.containerInfo : null;
+            a = null;
+          } else b !== a && (a = null);
+        dd$1 = a;
+        return null;
+      }
+      function ed(a) {
+        switch (a) {
+          case "cancel":
+          case "click":
+          case "close":
+          case "contextmenu":
+          case "copy":
+          case "cut":
+          case "auxclick":
+          case "dblclick":
+          case "dragend":
+          case "dragstart":
+          case "drop":
+          case "focusin":
+          case "focusout":
+          case "input":
+          case "invalid":
+          case "keydown":
+          case "keypress":
+          case "keyup":
+          case "mousedown":
+          case "mouseup":
+          case "paste":
+          case "pause":
+          case "play":
+          case "pointercancel":
+          case "pointerdown":
+          case "pointerup":
+          case "ratechange":
+          case "reset":
+          case "resize":
+          case "seeked":
+          case "submit":
+          case "touchcancel":
+          case "touchend":
+          case "touchstart":
+          case "volumechange":
+          case "change":
+          case "selectionchange":
+          case "textInput":
+          case "compositionstart":
+          case "compositionend":
+          case "compositionupdate":
+          case "beforeblur":
+          case "afterblur":
+          case "beforeinput":
+          case "blur":
+          case "fullscreenchange":
+          case "focus":
+          case "hashchange":
+          case "popstate":
+          case "select":
+          case "selectstart":
+            return 1;
+          case "drag":
+          case "dragenter":
+          case "dragexit":
+          case "dragleave":
+          case "dragover":
+          case "mousemove":
+          case "mouseout":
+          case "mouseover":
+          case "pointermove":
+          case "pointerout":
+          case "pointerover":
+          case "scroll":
+          case "toggle":
+          case "touchmove":
+          case "wheel":
+          case "mouseenter":
+          case "mouseleave":
+          case "pointerenter":
+          case "pointerleave":
+            return 4;
+          case "message":
+            switch (bc()) {
+              case cc:
+                return 1;
+              case dc:
+                return 4;
+              case ec:
+              case fc:
+                return 16;
+              case gc:
+                return 536870912;
+              default:
+                return 16;
+            }
+          default:
+            return 16;
+        }
+      }
+      var fd = null,
+        gd = null,
+        hd = null;
+      function id() {
+        if (hd) return hd;
+        var a,
+          b = gd,
+          c = b.length,
+          d,
+          e = "value" in fd ? fd.value : fd.textContent,
+          f = e.length;
+        for (a = 0; a < c && b[a] === e[a]; a++);
+        var g = c - a;
+        for (d = 1; d <= g && b[c - d] === e[f - d]; d++);
+        return (hd = e.slice(a, 1 < d ? 1 - d : void 0));
+      }
+      function jd(a) {
+        var b = a.keyCode;
+        "charCode" in a
+          ? ((a = a.charCode), a === 0 && b === 13 && (a = 13))
+          : (a = b);
+        a === 10 && (a = 13);
+        return 32 <= a || a === 13 ? a : 0;
+      }
+      function kd() {
+        return true;
+      }
+      function ld() {
+        return false;
+      }
+      function md$3(a) {
+        function b(b2, d, e, f, g) {
+          this._reactName = b2;
+          this._targetInst = e;
+          this.type = d;
+          this.nativeEvent = f;
+          this.target = g;
+          this.currentTarget = null;
+          for (var c in a)
+            a.hasOwnProperty(c) && ((b2 = a[c]), (this[c] = b2 ? b2(f) : f[c]));
+          this.isDefaultPrevented = (
+            f.defaultPrevented != null
+              ? f.defaultPrevented
+              : f.returnValue === false
+          )
+            ? kd
+            : ld;
+          this.isPropagationStopped = ld;
+          return this;
+        }
+        A(b.prototype, {
+          preventDefault: function () {
+            this.defaultPrevented = true;
+            var a2 = this.nativeEvent;
+            a2 &&
+              (a2.preventDefault
+                ? a2.preventDefault()
+                : typeof a2.returnValue !== "unknown" &&
+                  (a2.returnValue = false),
+              (this.isDefaultPrevented = kd));
+          },
+          stopPropagation: function () {
+            var a2 = this.nativeEvent;
+            a2 &&
+              (a2.stopPropagation
+                ? a2.stopPropagation()
+                : typeof a2.cancelBubble !== "unknown" &&
+                  (a2.cancelBubble = true),
+              (this.isPropagationStopped = kd));
+          },
+          persist: function () {},
+          isPersistent: kd,
+        });
+        return b;
+      }
+      var nd = {
+          eventPhase: 0,
+          bubbles: 0,
+          cancelable: 0,
+          timeStamp: function (a) {
+            return a.timeStamp || Date.now();
+          },
+          defaultPrevented: 0,
+          isTrusted: 0,
+        },
+        od = md$3(nd),
+        pd = A({}, nd, { view: 0, detail: 0 }),
+        qd = md$3(pd),
+        rd,
+        sd,
+        td,
+        vd = A({}, pd, {
+          screenX: 0,
+          screenY: 0,
+          clientX: 0,
+          clientY: 0,
+          pageX: 0,
+          pageY: 0,
+          ctrlKey: 0,
+          shiftKey: 0,
+          altKey: 0,
+          metaKey: 0,
+          getModifierState: ud,
+          button: 0,
+          buttons: 0,
+          relatedTarget: function (a) {
+            return a.relatedTarget === void 0
+              ? a.fromElement === a.srcElement
+                ? a.toElement
+                : a.fromElement
+              : a.relatedTarget;
+          },
+          movementX: function (a) {
+            if ("movementX" in a) return a.movementX;
+            a !== td &&
+              (td && a.type === "mousemove"
+                ? ((rd = a.screenX - td.screenX), (sd = a.screenY - td.screenY))
+                : (sd = rd = 0),
+              (td = a));
+            return rd;
+          },
+          movementY: function (a) {
+            return "movementY" in a ? a.movementY : sd;
+          },
+        }),
+        wd = md$3(vd),
+        xd = A({}, vd, { dataTransfer: 0 }),
+        yd = md$3(xd),
+        zd = A({}, pd, { relatedTarget: 0 }),
+        Ad = md$3(zd),
+        Bd = A({}, nd, { animationName: 0, elapsedTime: 0, pseudoElement: 0 }),
+        Cd = md$3(Bd),
+        Dd = A({}, nd, {
+          clipboardData: function (a) {
+            return "clipboardData" in a
+              ? a.clipboardData
+              : window.clipboardData;
+          },
+        }),
+        Ed = md$3(Dd),
+        Fd = A({}, nd, { data: 0 }),
+        Gd = md$3(Fd),
+        Hd = {
+          Esc: "Escape",
+          Spacebar: " ",
+          Left: "ArrowLeft",
+          Up: "ArrowUp",
+          Right: "ArrowRight",
+          Down: "ArrowDown",
+          Del: "Delete",
+          Win: "OS",
+          Menu: "ContextMenu",
+          Apps: "ContextMenu",
+          Scroll: "ScrollLock",
+          MozPrintableKey: "Unidentified",
+        },
+        Id = {
+          8: "Backspace",
+          9: "Tab",
+          12: "Clear",
+          13: "Enter",
+          16: "Shift",
+          17: "Control",
+          18: "Alt",
+          19: "Pause",
+          20: "CapsLock",
+          27: "Escape",
+          32: " ",
+          33: "PageUp",
+          34: "PageDown",
+          35: "End",
+          36: "Home",
+          37: "ArrowLeft",
+          38: "ArrowUp",
+          39: "ArrowRight",
+          40: "ArrowDown",
+          45: "Insert",
+          46: "Delete",
+          112: "F1",
+          113: "F2",
+          114: "F3",
+          115: "F4",
+          116: "F5",
+          117: "F6",
+          118: "F7",
+          119: "F8",
+          120: "F9",
+          121: "F10",
+          122: "F11",
+          123: "F12",
+          144: "NumLock",
+          145: "ScrollLock",
+          224: "Meta",
+        },
+        Jd = {
+          Alt: "altKey",
+          Control: "ctrlKey",
+          Meta: "metaKey",
+          Shift: "shiftKey",
+        };
+      function Kd(a) {
+        var b = this.nativeEvent;
+        return b.getModifierState
+          ? b.getModifierState(a)
+          : (a = Jd[a])
+          ? !!b[a]
+          : false;
+      }
+      function ud() {
+        return Kd;
+      }
+      var Ld = A({}, pd, {
+          key: function (a) {
+            if (a.key) {
+              var b = Hd[a.key] || a.key;
+              if (b !== "Unidentified") return b;
+            }
+            return a.type === "keypress"
+              ? ((a = jd(a)), a === 13 ? "Enter" : String.fromCharCode(a))
+              : a.type === "keydown" || a.type === "keyup"
+              ? Id[a.keyCode] || "Unidentified"
+              : "";
+          },
+          code: 0,
+          location: 0,
+          ctrlKey: 0,
+          shiftKey: 0,
+          altKey: 0,
+          metaKey: 0,
+          repeat: 0,
+          locale: 0,
+          getModifierState: ud,
+          charCode: function (a) {
+            return a.type === "keypress" ? jd(a) : 0;
+          },
+          keyCode: function (a) {
+            return a.type === "keydown" || a.type === "keyup" ? a.keyCode : 0;
+          },
+          which: function (a) {
+            return a.type === "keypress"
+              ? jd(a)
+              : a.type === "keydown" || a.type === "keyup"
+              ? a.keyCode
+              : 0;
+          },
+        }),
+        Md = md$3(Ld),
+        Nd = A({}, vd, {
+          pointerId: 0,
+          width: 0,
+          height: 0,
+          pressure: 0,
+          tangentialPressure: 0,
+          tiltX: 0,
+          tiltY: 0,
+          twist: 0,
+          pointerType: 0,
+          isPrimary: 0,
+        }),
+        Od = md$3(Nd),
+        Pd = A({}, pd, {
+          touches: 0,
+          targetTouches: 0,
+          changedTouches: 0,
+          altKey: 0,
+          metaKey: 0,
+          ctrlKey: 0,
+          shiftKey: 0,
+          getModifierState: ud,
+        }),
+        Qd = md$3(Pd),
+        Rd = A({}, nd, { propertyName: 0, elapsedTime: 0, pseudoElement: 0 }),
+        Sd = md$3(Rd),
+        Td = A({}, vd, {
+          deltaX: function (a) {
+            return "deltaX" in a
+              ? a.deltaX
+              : "wheelDeltaX" in a
+              ? -a.wheelDeltaX
+              : 0;
+          },
+          deltaY: function (a) {
+            return "deltaY" in a
+              ? a.deltaY
+              : "wheelDeltaY" in a
+              ? -a.wheelDeltaY
+              : "wheelDelta" in a
+              ? -a.wheelDelta
+              : 0;
+          },
+          deltaZ: 0,
+          deltaMode: 0,
+        }),
+        Ud = md$3(Td),
+        Vd = [9, 13, 27, 32],
+        Wd = ha && "CompositionEvent" in window,
+        Xd = null;
+      ha && "documentMode" in document && (Xd = document.documentMode);
+      var Yd = ha && "TextEvent" in window && !Xd,
+        Zd = ha && (!Wd || (Xd && 8 < Xd && 11 >= Xd)),
+        $d = String.fromCharCode(32),
+        ae = false;
+      function be(a, b) {
+        switch (a) {
+          case "keyup":
+            return Vd.indexOf(b.keyCode) !== -1;
+          case "keydown":
+            return b.keyCode !== 229;
+          case "keypress":
+          case "mousedown":
+          case "focusout":
+            return true;
+          default:
+            return false;
+        }
+      }
+      function ce(a) {
+        a = a.detail;
+        return typeof a === "object" && "data" in a ? a.data : null;
+      }
+      var de = false;
+      function ee$1(a, b) {
+        switch (a) {
+          case "compositionend":
+            return ce(b);
+          case "keypress":
+            if (b.which !== 32) return null;
+            ae = true;
+            return $d;
+          case "textInput":
+            return (a = b.data), a === $d && ae ? null : a;
+          default:
+            return null;
+        }
+      }
+      function fe(a, b) {
+        if (de)
+          return a === "compositionend" || (!Wd && be(a, b))
+            ? ((a = id()), (hd = gd = fd = null), (de = false), a)
+            : null;
+        switch (a) {
+          case "paste":
+            return null;
+          case "keypress":
+            if (
+              !(b.ctrlKey || b.altKey || b.metaKey) ||
+              (b.ctrlKey && b.altKey)
+            ) {
+              if (b.char && 1 < b.char.length) return b.char;
+              if (b.which) return String.fromCharCode(b.which);
+            }
+            return null;
+          case "compositionend":
+            return Zd && b.locale !== "ko" ? null : b.data;
+          default:
+            return null;
+        }
+      }
+      var ge$1 = {
+        color: true,
+        date: true,
+        datetime: true,
+        "datetime-local": true,
+        email: true,
+        month: true,
+        number: true,
+        password: true,
+        range: true,
+        search: true,
+        tel: true,
+        text: true,
+        time: true,
+        url: true,
+        week: true,
+      };
+      function he(a) {
+        var b = a && a.nodeName && a.nodeName.toLowerCase();
+        return b === "input" ? !!ge$1[a.type] : b === "textarea" ? true : false;
+      }
+      function ie(a, b, c, d) {
+        Bb(d);
+        b = je(b, "onChange");
+        0 < b.length &&
+          ((c = new od("onChange", "change", null, c, d)),
+          a.push({ event: c, listeners: b }));
+      }
+      var ke = null,
+        le$1 = null;
+      function me(a) {
+        ne$1(a, 0);
+      }
+      function oe(a) {
+        var b = pe(a);
+        if (Ua(b)) return a;
+      }
+      function qe(a, b) {
+        if (a === "change") return b;
+      }
+      var re$1 = false;
+      if (ha) {
+        var se;
+        if (ha) {
+          var te = "oninput" in document;
+          if (!te) {
+            var ue = document.createElement("div");
+            ue.setAttribute("oninput", "return;");
+            te = typeof ue.oninput === "function";
+          }
+          se = te;
+        } else se = false;
+        re$1 = se && (!document.documentMode || 9 < document.documentMode);
+      }
+      function ve() {
+        ke && (ke.detachEvent("onpropertychange", we), (le$1 = ke = null));
+      }
+      function we(a) {
+        if (a.propertyName === "value" && oe(le$1)) {
+          var b = [];
+          ie(b, le$1, a, ub(a));
+          Gb(me, b);
+        }
+      }
+      function xe(a, b, c) {
+        a === "focusin"
+          ? (ve(), (ke = b), (le$1 = c), ke.attachEvent("onpropertychange", we))
+          : a === "focusout" && ve();
+      }
+      function ye(a) {
+        if (a === "selectionchange" || a === "keyup" || a === "keydown")
+          return oe(le$1);
+      }
+      function ze(a, b) {
+        if (a === "click") return oe(b);
+      }
+      function Ae(a, b) {
+        if (a === "input" || a === "change") return oe(b);
+      }
+      function Be(a, b) {
+        return (
+          (a === b && (a !== 0 || 1 / a === 1 / b)) || (a !== a && b !== b)
+        );
+      }
+      var Ce = typeof Object.is === "function" ? Object.is : Be;
+      function De(a, b) {
+        if (Ce(a, b)) return true;
+        if (
+          typeof a !== "object" ||
+          a === null ||
+          typeof b !== "object" ||
+          b === null
+        )
+          return false;
+        var c = Object.keys(a),
+          d = Object.keys(b);
+        if (c.length !== d.length) return false;
+        for (d = 0; d < c.length; d++) {
+          var e = c[d];
+          if (!ia.call(b, e) || !Ce(a[e], b[e])) return false;
+        }
+        return true;
+      }
+      function Ee(a) {
+        for (; a && a.firstChild; ) a = a.firstChild;
+        return a;
+      }
+      function Fe(a, b) {
+        var c = Ee(a);
+        a = 0;
+        for (var d; c; ) {
+          if (c.nodeType === 3) {
+            d = a + c.textContent.length;
+            if (a <= b && d >= b) return { node: c, offset: b - a };
+            a = d;
+          }
+          a: {
+            for (; c; ) {
+              if (c.nextSibling) {
+                c = c.nextSibling;
+                break a;
+              }
+              c = c.parentNode;
+            }
+            c = void 0;
+          }
+          c = Ee(c);
+        }
+      }
+      function Ge(a, b) {
+        return a && b
+          ? a === b
+            ? true
+            : a && a.nodeType === 3
+            ? false
+            : b && b.nodeType === 3
+            ? Ge(a, b.parentNode)
+            : "contains" in a
+            ? a.contains(b)
+            : a.compareDocumentPosition
+            ? !!(a.compareDocumentPosition(b) & 16)
+            : false
+          : false;
+      }
+      function He() {
+        for (var a = window, b = Va(); b instanceof a.HTMLIFrameElement; ) {
+          try {
+            var c = typeof b.contentWindow.location.href === "string";
+          } catch (d) {
+            c = false;
+          }
+          if (c) a = b.contentWindow;
+          else break;
+          b = Va(a.document);
+        }
+        return b;
+      }
+      function Ie(a) {
+        var b = a && a.nodeName && a.nodeName.toLowerCase();
+        return (
+          b &&
+          ((b === "input" &&
+            (a.type === "text" ||
+              a.type === "search" ||
+              a.type === "tel" ||
+              a.type === "url" ||
+              a.type === "password")) ||
+            b === "textarea" ||
+            a.contentEditable === "true")
+        );
+      }
+      function Je(a) {
+        var b = He(),
+          c = a.focusedElem,
+          d = a.selectionRange;
+        if (
+          b !== c &&
+          c &&
+          c.ownerDocument &&
+          Ge(c.ownerDocument.documentElement, c)
+        ) {
+          if (d !== null && Ie(c)) {
+            if (
+              ((b = d.start),
+              (a = d.end),
+              a === void 0 && (a = b),
+              "selectionStart" in c)
+            )
+              (c.selectionStart = b),
+                (c.selectionEnd = Math.min(a, c.value.length));
+            else if (
+              ((a =
+                ((b = c.ownerDocument || document) && b.defaultView) || window),
+              a.getSelection)
+            ) {
+              a = a.getSelection();
+              var e = c.textContent.length,
+                f = Math.min(d.start, e);
+              d = d.end === void 0 ? f : Math.min(d.end, e);
+              !a.extend && f > d && ((e = d), (d = f), (f = e));
+              e = Fe(c, f);
+              var g = Fe(c, d);
+              e &&
+                g &&
+                (a.rangeCount !== 1 ||
+                  a.anchorNode !== e.node ||
+                  a.anchorOffset !== e.offset ||
+                  a.focusNode !== g.node ||
+                  a.focusOffset !== g.offset) &&
+                ((b = b.createRange()),
+                b.setStart(e.node, e.offset),
+                a.removeAllRanges(),
+                f > d
+                  ? (a.addRange(b), a.extend(g.node, g.offset))
+                  : (b.setEnd(g.node, g.offset), a.addRange(b)));
+            }
+          }
+          b = [];
+          for (a = c; (a = a.parentNode); )
+            a.nodeType === 1 &&
+              b.push({ element: a, left: a.scrollLeft, top: a.scrollTop });
+          typeof c.focus === "function" && c.focus();
+          for (c = 0; c < b.length; c++)
+            (a = b[c]),
+              (a.element.scrollLeft = a.left),
+              (a.element.scrollTop = a.top);
+        }
+      }
+      var Ke = ha && "documentMode" in document && 11 >= document.documentMode,
+        Le = null,
+        Me = null,
+        Ne = null,
+        Oe = false;
+      function Pe(a, b, c) {
+        var d =
+          c.window === c ? c.document : c.nodeType === 9 ? c : c.ownerDocument;
+        Oe ||
+          Le == null ||
+          Le !== Va(d) ||
+          ((d = Le),
+          "selectionStart" in d && Ie(d)
+            ? (d = { start: d.selectionStart, end: d.selectionEnd })
+            : ((d = (
+                (d.ownerDocument && d.ownerDocument.defaultView) ||
+                window
+              ).getSelection()),
+              (d = {
+                anchorNode: d.anchorNode,
+                anchorOffset: d.anchorOffset,
+                focusNode: d.focusNode,
+                focusOffset: d.focusOffset,
+              })),
+          (Ne && De(Ne, d)) ||
+            ((Ne = d),
+            (d = je(Me, "onSelect")),
+            0 < d.length &&
+              ((b = new od("onSelect", "select", null, b, c)),
+              a.push({ event: b, listeners: d }),
+              (b.target = Le))));
+      }
+      function Qe(a, b) {
+        var c = {};
+        c[a.toLowerCase()] = b.toLowerCase();
+        c["Webkit" + a] = "webkit" + b;
+        c["Moz" + a] = "moz" + b;
+        return c;
+      }
+      var Re$1 = {
+          animationend: Qe("Animation", "AnimationEnd"),
+          animationiteration: Qe("Animation", "AnimationIteration"),
+          animationstart: Qe("Animation", "AnimationStart"),
+          transitionend: Qe("Transition", "TransitionEnd"),
+        },
+        Se = {},
+        Te = {};
+      ha &&
+        ((Te = document.createElement("div").style),
+        "AnimationEvent" in window ||
+          (delete Re$1.animationend.animation,
+          delete Re$1.animationiteration.animation,
+          delete Re$1.animationstart.animation),
+        "TransitionEvent" in window || delete Re$1.transitionend.transition);
+      function Ue(a) {
+        if (Se[a]) return Se[a];
+        if (!Re$1[a]) return a;
+        var b = Re$1[a],
+          c;
+        for (c in b) if (b.hasOwnProperty(c) && c in Te) return (Se[a] = b[c]);
+        return a;
+      }
+      var Ve = Ue("animationend"),
+        We = Ue("animationiteration"),
+        Xe = Ue("animationstart"),
+        Ye = Ue("transitionend"),
+        Ze = /* @__PURE__ */ new Map(),
+        $e =
+          "abort auxClick cancel canPlay canPlayThrough click close contextMenu copy cut drag dragEnd dragEnter dragExit dragLeave dragOver dragStart drop durationChange emptied encrypted ended error gotPointerCapture input invalid keyDown keyPress keyUp load loadedData loadedMetadata loadStart lostPointerCapture mouseDown mouseMove mouseOut mouseOver mouseUp paste pause play playing pointerCancel pointerDown pointerMove pointerOut pointerOver pointerUp progress rateChange reset resize seeked seeking stalled submit suspend timeUpdate touchCancel touchEnd touchStart volumeChange scroll toggle touchMove waiting wheel".split(
+            " "
+          );
+      function af$1(a, b) {
+        Ze.set(a, b);
+        ea(b, [a]);
+      }
+      for (var bf = 0; bf < $e.length; bf++) {
+        var cf = $e[bf],
+          df = cf.toLowerCase(),
+          ef = cf[0].toUpperCase() + cf.slice(1);
+        af$1(df, "on" + ef);
+      }
+      af$1(Ve, "onAnimationEnd");
+      af$1(We, "onAnimationIteration");
+      af$1(Xe, "onAnimationStart");
+      af$1("dblclick", "onDoubleClick");
+      af$1("focusin", "onFocus");
+      af$1("focusout", "onBlur");
+      af$1(Ye, "onTransitionEnd");
+      fa("onMouseEnter", ["mouseout", "mouseover"]);
+      fa("onMouseLeave", ["mouseout", "mouseover"]);
+      fa("onPointerEnter", ["pointerout", "pointerover"]);
+      fa("onPointerLeave", ["pointerout", "pointerover"]);
+      ea(
+        "onChange",
+        "change click focusin focusout input keydown keyup selectionchange".split(
+          " "
+        )
+      );
+      ea(
+        "onSelect",
+        "focusout contextmenu dragend focusin keydown keyup mousedown mouseup selectionchange".split(
+          " "
+        )
+      );
+      ea("onBeforeInput", ["compositionend", "keypress", "textInput", "paste"]);
+      ea(
+        "onCompositionEnd",
+        "compositionend focusout keydown keypress keyup mousedown".split(" ")
+      );
+      ea(
+        "onCompositionStart",
+        "compositionstart focusout keydown keypress keyup mousedown".split(" ")
+      );
+      ea(
+        "onCompositionUpdate",
+        "compositionupdate focusout keydown keypress keyup mousedown".split(" ")
+      );
+      var ff =
+          "abort canplay canplaythrough durationchange emptied encrypted ended error loadeddata loadedmetadata loadstart pause play playing progress ratechange resize seeked seeking stalled suspend timeupdate volumechange waiting".split(
+            " "
+          ),
+        gf = new Set(
+          "cancel close invalid load scroll toggle".split(" ").concat(ff)
+        );
+      function hf(a, b, c) {
+        var d = a.type || "unknown-event";
+        a.currentTarget = c;
+        Rb(d, b, void 0, a);
+        a.currentTarget = null;
+      }
+      function ne$1(a, b) {
+        b = (b & 4) !== 0;
+        for (var c = 0; c < a.length; c++) {
+          var d = a[c],
+            e = d.event;
+          d = d.listeners;
+          a: {
+            var f = void 0;
+            if (b)
+              for (var g = d.length - 1; 0 <= g; g--) {
+                var h = d[g],
+                  k = h.instance,
+                  l2 = h.currentTarget;
+                h = h.listener;
+                if (k !== f && e.isPropagationStopped()) break a;
+                hf(e, h, l2);
+                f = k;
+              }
+            else
+              for (g = 0; g < d.length; g++) {
+                h = d[g];
+                k = h.instance;
+                l2 = h.currentTarget;
+                h = h.listener;
+                if (k !== f && e.isPropagationStopped()) break a;
+                hf(e, h, l2);
+                f = k;
+              }
+          }
+        }
+        if (Nb) throw ((a = Ob), (Nb = false), (Ob = null), a);
+      }
+      function F(a, b) {
+        var c = b[jf];
+        c === void 0 && (c = b[jf] = /* @__PURE__ */ new Set());
+        var d = a + "__bubble";
+        c.has(d) || (kf(b, a, 2, false), c.add(d));
+      }
+      function lf(a, b, c) {
+        var d = 0;
+        b && (d |= 4);
+        kf(c, a, d, b);
+      }
+      var mf = "_reactListening" + Math.random().toString(36).slice(2);
+      function nf(a) {
+        if (!a[mf]) {
+          a[mf] = true;
+          ca.forEach(function (b2) {
+            b2 !== "selectionchange" &&
+              (gf.has(b2) || lf(b2, false, a), lf(b2, true, a));
+          });
+          var b = a.nodeType === 9 ? a : a.ownerDocument;
+          b === null ||
+            b[mf] ||
+            ((b[mf] = true), lf("selectionchange", false, b));
+        }
+      }
+      function kf(a, b, c, d) {
+        switch (ed(b)) {
+          case 1:
+            var e = $c;
+            break;
+          case 4:
+            e = bd;
+            break;
+          default:
+            e = ad;
+        }
+        c = e.bind(null, b, c, a);
+        e = void 0;
+        !Ib ||
+          (b !== "touchstart" && b !== "touchmove" && b !== "wheel") ||
+          (e = true);
+        d
+          ? e !== void 0
+            ? a.addEventListener(b, c, { capture: true, passive: e })
+            : a.addEventListener(b, c, true)
+          : e !== void 0
+          ? a.addEventListener(b, c, { passive: e })
+          : a.addEventListener(b, c, false);
+      }
+      function cd(a, b, c, d, e) {
+        var f = d;
+        if ((b & 1) === 0 && (b & 2) === 0 && d !== null)
+          a: for (;;) {
+            if (d === null) return;
+            var g = d.tag;
+            if (g === 3 || g === 4) {
+              var h = d.stateNode.containerInfo;
+              if (h === e || (h.nodeType === 8 && h.parentNode === e)) break;
+              if (g === 4)
+                for (g = d.return; g !== null; ) {
+                  var k = g.tag;
+                  if (k === 3 || k === 4) {
+                    if (
+                      ((k = g.stateNode.containerInfo),
+                      k === e || (k.nodeType === 8 && k.parentNode === e))
+                    )
+                      return;
+                  }
+                  g = g.return;
+                }
+              for (; h !== null; ) {
+                g = Sc$1(h);
+                if (g === null) return;
+                k = g.tag;
+                if (k === 5 || k === 6) {
+                  d = f = g;
+                  continue a;
+                }
+                h = h.parentNode;
+              }
+            }
+            d = d.return;
+          }
+        Gb(function () {
+          var d2 = f,
+            e2 = ub(c),
+            g2 = [];
+          a: {
+            var h2 = Ze.get(a);
+            if (h2 !== void 0) {
+              var k2 = od,
+                n2 = a;
+              switch (a) {
+                case "keypress":
+                  if (jd(c) === 0) break a;
+                case "keydown":
+                case "keyup":
+                  k2 = Md;
+                  break;
+                case "focusin":
+                  n2 = "focus";
+                  k2 = Ad;
+                  break;
+                case "focusout":
+                  n2 = "blur";
+                  k2 = Ad;
+                  break;
+                case "beforeblur":
+                case "afterblur":
+                  k2 = Ad;
+                  break;
+                case "click":
+                  if (c.button === 2) break a;
+                case "auxclick":
+                case "dblclick":
+                case "mousedown":
+                case "mousemove":
+                case "mouseup":
+                case "mouseout":
+                case "mouseover":
+                case "contextmenu":
+                  k2 = wd;
+                  break;
+                case "drag":
+                case "dragend":
+                case "dragenter":
+                case "dragexit":
+                case "dragleave":
+                case "dragover":
+                case "dragstart":
+                case "drop":
+                  k2 = yd;
+                  break;
+                case "touchcancel":
+                case "touchend":
+                case "touchmove":
+                case "touchstart":
+                  k2 = Qd;
+                  break;
+                case Ve:
+                case We:
+                case Xe:
+                  k2 = Cd;
+                  break;
+                case Ye:
+                  k2 = Sd;
+                  break;
+                case "scroll":
+                  k2 = qd;
+                  break;
+                case "wheel":
+                  k2 = Ud;
+                  break;
+                case "copy":
+                case "cut":
+                case "paste":
+                  k2 = Ed;
+                  break;
+                case "gotpointercapture":
+                case "lostpointercapture":
+                case "pointercancel":
+                case "pointerdown":
+                case "pointermove":
+                case "pointerout":
+                case "pointerover":
+                case "pointerup":
+                  k2 = Od;
+              }
+              var v2 = (b & 4) !== 0,
+                C2 = !v2 && a === "scroll",
+                t2 = v2 ? (h2 !== null ? h2 + "Capture" : null) : h2;
+              v2 = [];
+              for (var r2 = d2, x2; r2 !== null; ) {
+                x2 = r2;
+                var B2 = x2.stateNode;
+                x2.tag === 5 &&
+                  B2 !== null &&
+                  ((x2 = B2),
+                  t2 !== null &&
+                    ((B2 = Hb(r2, t2)), B2 != null && v2.push(of(r2, B2, x2))));
+                if (C2) break;
+                r2 = r2.return;
+              }
+              0 < v2.length &&
+                ((h2 = new k2(h2, n2, null, c, e2)),
+                g2.push({ event: h2, listeners: v2 }));
+            }
+          }
+          if ((b & 7) === 0) {
+            a: {
+              h2 = a === "mouseover" || a === "pointerover";
+              k2 = a === "mouseout" || a === "pointerout";
+              if (
+                h2 &&
+                c !== tb &&
+                (n2 = c.relatedTarget || c.fromElement) &&
+                (Sc$1(n2) || n2[pf])
+              )
+                break a;
+              if (k2 || h2) {
+                h2 =
+                  e2.window === e2
+                    ? e2
+                    : (h2 = e2.ownerDocument)
+                    ? h2.defaultView || h2.parentWindow
+                    : window;
+                if (k2) {
+                  if (
+                    ((n2 = c.relatedTarget || c.toElement),
+                    (k2 = d2),
+                    (n2 = n2 ? Sc$1(n2) : null),
+                    n2 !== null &&
+                      ((C2 = Sb(n2)),
+                      n2 !== C2 || (n2.tag !== 5 && n2.tag !== 6)))
+                  )
+                    n2 = null;
+                } else (k2 = null), (n2 = d2);
+                if (k2 !== n2) {
+                  v2 = wd;
+                  B2 = "onMouseLeave";
+                  t2 = "onMouseEnter";
+                  r2 = "mouse";
+                  if (a === "pointerout" || a === "pointerover")
+                    (v2 = Od),
+                      (B2 = "onPointerLeave"),
+                      (t2 = "onPointerEnter"),
+                      (r2 = "pointer");
+                  C2 = k2 == null ? h2 : pe(k2);
+                  x2 = n2 == null ? h2 : pe(n2);
+                  h2 = new v2(B2, r2 + "leave", k2, c, e2);
+                  h2.target = C2;
+                  h2.relatedTarget = x2;
+                  B2 = null;
+                  Sc$1(e2) === d2 &&
+                    ((v2 = new v2(t2, r2 + "enter", n2, c, e2)),
+                    (v2.target = x2),
+                    (v2.relatedTarget = C2),
+                    (B2 = v2));
+                  C2 = B2;
+                  if (k2 && n2)
+                    b: {
+                      v2 = k2;
+                      t2 = n2;
+                      r2 = 0;
+                      for (x2 = v2; x2; x2 = qf(x2)) r2++;
+                      x2 = 0;
+                      for (B2 = t2; B2; B2 = qf(B2)) x2++;
+                      for (; 0 < r2 - x2; ) (v2 = qf(v2)), r2--;
+                      for (; 0 < x2 - r2; ) (t2 = qf(t2)), x2--;
+                      for (; r2--; ) {
+                        if (v2 === t2 || (t2 !== null && v2 === t2.alternate))
+                          break b;
+                        v2 = qf(v2);
+                        t2 = qf(t2);
+                      }
+                      v2 = null;
+                    }
+                  else v2 = null;
+                  k2 !== null && rf(g2, h2, k2, v2, false);
+                  n2 !== null && C2 !== null && rf(g2, C2, n2, v2, true);
+                }
+              }
+            }
+            a: {
+              h2 = d2 ? pe(d2) : window;
+              k2 = h2.nodeName && h2.nodeName.toLowerCase();
+              if (k2 === "select" || (k2 === "input" && h2.type === "file"))
+                var O2 = qe;
+              else if (he(h2))
+                if (re$1) O2 = Ae;
+                else {
+                  O2 = ye;
+                  var T2 = xe;
+                }
+              else
+                (k2 = h2.nodeName) &&
+                  k2.toLowerCase() === "input" &&
+                  (h2.type === "checkbox" || h2.type === "radio") &&
+                  (O2 = ze);
+              if (O2 && (O2 = O2(a, d2))) {
+                ie(g2, O2, c, e2);
+                break a;
+              }
+              T2 && T2(a, h2, d2);
+              a === "focusout" &&
+                (T2 = h2._wrapperState) &&
+                T2.controlled &&
+                h2.type === "number" &&
+                $a(h2, "number", h2.value);
+            }
+            T2 = d2 ? pe(d2) : window;
+            switch (a) {
+              case "focusin":
+                if (he(T2) || T2.contentEditable === "true")
+                  (Le = T2), (Me = d2), (Ne = null);
+                break;
+              case "focusout":
+                Ne = Me = Le = null;
+                break;
+              case "mousedown":
+                Oe = true;
+                break;
+              case "contextmenu":
+              case "mouseup":
+              case "dragend":
+                Oe = false;
+                Pe(g2, c, e2);
+                break;
+              case "selectionchange":
+                if (Ke) break;
+              case "keydown":
+              case "keyup":
+                Pe(g2, c, e2);
+            }
+            var za;
+            if (Wd)
+              b: {
+                switch (a) {
+                  case "compositionstart":
+                    var L2 = "onCompositionStart";
+                    break b;
+                  case "compositionend":
+                    L2 = "onCompositionEnd";
+                    break b;
+                  case "compositionupdate":
+                    L2 = "onCompositionUpdate";
+                    break b;
+                }
+                L2 = void 0;
+              }
+            else
+              de
+                ? be(a, c) && (L2 = "onCompositionEnd")
+                : a === "keydown" &&
+                  c.keyCode === 229 &&
+                  (L2 = "onCompositionStart");
+            L2 &&
+              (Zd &&
+                c.locale !== "ko" &&
+                (de || L2 !== "onCompositionStart"
+                  ? L2 === "onCompositionEnd" && de && (za = id())
+                  : ((fd = e2),
+                    (gd = "value" in fd ? fd.value : fd.textContent),
+                    (de = true))),
+              (T2 = je(d2, L2)),
+              0 < T2.length &&
+                ((L2 = new Gd(L2, a, null, c, e2)),
+                g2.push({ event: L2, listeners: T2 }),
+                za
+                  ? (L2.data = za)
+                  : ((za = ce(c)), za !== null && (L2.data = za))));
+            if ((za = Yd ? ee$1(a, c) : fe(a, c)))
+              (d2 = je(d2, "onBeforeInput")),
+                0 < d2.length &&
+                  ((e2 = new Gd("onBeforeInput", "beforeinput", null, c, e2)),
+                  g2.push({ event: e2, listeners: d2 }),
+                  (e2.data = za));
+          }
+          ne$1(g2, b);
+        });
+      }
+      function of(a, b, c) {
+        return { instance: a, listener: b, currentTarget: c };
+      }
+      function je(a, b) {
+        for (var c = b + "Capture", d = []; a !== null; ) {
+          var e = a,
+            f = e.stateNode;
+          e.tag === 5 &&
+            f !== null &&
+            ((e = f),
+            (f = Hb(a, c)),
+            f != null && d.unshift(of(a, f, e)),
+            (f = Hb(a, b)),
+            f != null && d.push(of(a, f, e)));
+          a = a.return;
+        }
+        return d;
+      }
+      function qf(a) {
+        if (a === null) return null;
+        do a = a.return;
+        while (a && a.tag !== 5);
+        return a ? a : null;
+      }
+      function rf(a, b, c, d, e) {
+        for (var f = b._reactName, g = []; c !== null && c !== d; ) {
+          var h = c,
+            k = h.alternate,
+            l2 = h.stateNode;
+          if (k !== null && k === d) break;
+          h.tag === 5 &&
+            l2 !== null &&
+            ((h = l2),
+            e
+              ? ((k = Hb(c, f)), k != null && g.unshift(of(c, k, h)))
+              : e || ((k = Hb(c, f)), k != null && g.push(of(c, k, h))));
+          c = c.return;
+        }
+        g.length !== 0 && a.push({ event: b, listeners: g });
+      }
+      var sf = /\r\n?/g,
+        tf = /\u0000|\uFFFD/g;
+      function uf(a) {
+        return (typeof a === "string" ? a : "" + a)
+          .replace(sf, "\n")
+          .replace(tf, "");
+      }
+      function vf(a, b, c) {
+        b = uf(b);
+        if (uf(a) !== b && c) throw Error(p$1(425));
+      }
+      function wf() {}
+      var xf = null;
+      function yf(a, b) {
+        return (
+          a === "textarea" ||
+          a === "noscript" ||
+          typeof b.children === "string" ||
+          typeof b.children === "number" ||
+          (typeof b.dangerouslySetInnerHTML === "object" &&
+            b.dangerouslySetInnerHTML !== null &&
+            b.dangerouslySetInnerHTML.__html != null)
+        );
+      }
+      var zf = typeof setTimeout === "function" ? setTimeout : void 0,
+        Af = typeof clearTimeout === "function" ? clearTimeout : void 0,
+        Bf = typeof Promise === "function" ? Promise : void 0,
+        Df =
+          typeof queueMicrotask === "function"
+            ? queueMicrotask
+            : typeof Bf !== "undefined"
+            ? function (a) {
+                return Bf.resolve(null).then(a).catch(Cf);
+              }
+            : zf;
+      function Cf(a) {
+        setTimeout(function () {
+          throw a;
+        });
+      }
+      function Ef(a, b) {
+        var c = b,
+          d = 0;
+        do {
+          var e = c.nextSibling;
+          a.removeChild(c);
+          if (e && e.nodeType === 8)
+            if (((c = e.data), c === "/$")) {
+              if (d === 0) {
+                a.removeChild(e);
+                Yc(b);
+                return;
+              }
+              d--;
+            } else (c !== "$" && c !== "$?" && c !== "$!") || d++;
+          c = e;
+        } while (c);
+        Yc(b);
+      }
+      function Ff(a) {
+        for (; a != null; a = a.nextSibling) {
+          var b = a.nodeType;
+          if (b === 1 || b === 3) break;
+          if (b === 8) {
+            b = a.data;
+            if (b === "$" || b === "$!" || b === "$?") break;
+            if (b === "/$") return null;
+          }
+        }
+        return a;
+      }
+      function Gf(a) {
+        a = a.previousSibling;
+        for (var b = 0; a; ) {
+          if (a.nodeType === 8) {
+            var c = a.data;
+            if (c === "$" || c === "$!" || c === "$?") {
+              if (b === 0) return a;
+              b--;
+            } else c === "/$" && b++;
+          }
+          a = a.previousSibling;
+        }
+        return null;
+      }
+      var Hf = Math.random().toString(36).slice(2),
+        If = "__reactFiber$" + Hf,
+        Jf = "__reactProps$" + Hf,
+        pf = "__reactContainer$" + Hf,
+        jf = "__reactEvents$" + Hf,
+        Kf = "__reactListeners$" + Hf,
+        Lf = "__reactHandles$" + Hf;
+      function Sc$1(a) {
+        var b = a[If];
+        if (b) return b;
+        for (var c = a.parentNode; c; ) {
+          if ((b = c[pf] || c[If])) {
+            c = b.alternate;
+            if (b.child !== null || (c !== null && c.child !== null))
+              for (a = Gf(a); a !== null; ) {
+                if ((c = a[If])) return c;
+                a = Gf(a);
+              }
+            return b;
+          }
+          a = c;
+          c = a.parentNode;
+        }
+        return null;
+      }
+      function zb(a) {
+        a = a[If] || a[pf];
+        return !a || (a.tag !== 5 && a.tag !== 6 && a.tag !== 13 && a.tag !== 3)
+          ? null
+          : a;
+      }
+      function pe(a) {
+        if (a.tag === 5 || a.tag === 6) return a.stateNode;
+        throw Error(p$1(33));
+      }
+      function Ab(a) {
+        return a[Jf] || null;
+      }
+      var Mf = [],
+        Nf = -1;
+      function Of(a) {
+        return { current: a };
+      }
+      function G(a) {
+        0 > Nf || ((a.current = Mf[Nf]), (Mf[Nf] = null), Nf--);
+      }
+      function H(a, b) {
+        Nf++;
+        Mf[Nf] = a.current;
+        a.current = b;
+      }
+      var Pf = {},
+        I = Of(Pf),
+        Qf = Of(false),
+        Rf = Pf;
+      function Sf(a, b) {
+        var c = a.type.contextTypes;
+        if (!c) return Pf;
+        var d = a.stateNode;
+        if (d && d.__reactInternalMemoizedUnmaskedChildContext === b)
+          return d.__reactInternalMemoizedMaskedChildContext;
+        var e = {},
+          f;
+        for (f in c) e[f] = b[f];
+        d &&
+          ((a = a.stateNode),
+          (a.__reactInternalMemoizedUnmaskedChildContext = b),
+          (a.__reactInternalMemoizedMaskedChildContext = e));
+        return e;
+      }
+      function Tf(a) {
+        a = a.childContextTypes;
+        return a !== null && a !== void 0;
+      }
+      function Uf() {
+        G(Qf);
+        G(I);
+      }
+      function Vf(a, b, c) {
+        if (I.current !== Pf) throw Error(p$1(168));
+        H(I, b);
+        H(Qf, c);
+      }
+      function Wf(a, b, c) {
+        var d = a.stateNode;
+        b = b.childContextTypes;
+        if (typeof d.getChildContext !== "function") return c;
+        d = d.getChildContext();
+        for (var e in d)
+          if (!(e in b)) throw Error(p$1(108, Pa(a) || "Unknown", e));
+        return A({}, c, d);
+      }
+      function Xf(a) {
+        a =
+          ((a = a.stateNode) && a.__reactInternalMemoizedMergedChildContext) ||
+          Pf;
+        Rf = I.current;
+        H(I, a);
+        H(Qf, Qf.current);
+        return true;
+      }
+      function Yf(a, b, c) {
+        var d = a.stateNode;
+        if (!d) throw Error(p$1(169));
+        c
+          ? ((a = Wf(a, b, Rf)),
+            (d.__reactInternalMemoizedMergedChildContext = a),
+            G(Qf),
+            G(I),
+            H(I, a))
+          : G(Qf);
+        H(Qf, c);
+      }
+      var Zf = null,
+        $f = false,
+        ag = false;
+      function bg(a) {
+        Zf === null ? (Zf = [a]) : Zf.push(a);
+      }
+      function cg(a) {
+        $f = true;
+        bg(a);
+      }
+      function dg() {
+        if (!ag && Zf !== null) {
+          ag = true;
+          var a = 0,
+            b = E;
+          try {
+            var c = Zf;
+            for (E = 1; a < c.length; a++) {
+              var d = c[a];
+              do d = d(true);
+              while (d !== null);
+            }
+            Zf = null;
+            $f = false;
+          } catch (e) {
+            throw (Zf !== null && (Zf = Zf.slice(a + 1)), Yb(cc, dg), e);
+          } finally {
+            (E = b), (ag = false);
+          }
+        }
+        return null;
+      }
+      var eg$1 = sa.ReactCurrentBatchConfig;
+      function fg(a, b) {
+        if (a && a.defaultProps) {
+          b = A({}, b);
+          a = a.defaultProps;
+          for (var c in a) b[c] === void 0 && (b[c] = a[c]);
+          return b;
+        }
+        return b;
+      }
+      var gg$1 = Of(null),
+        hg = null,
+        ig = null,
+        jg = null;
+      function kg() {
+        jg = ig = hg = null;
+      }
+      function lg$1(a) {
+        var b = gg$1.current;
+        G(gg$1);
+        a._currentValue = b;
+      }
+      function mg(a, b, c) {
+        for (; a !== null; ) {
+          var d = a.alternate;
+          (a.childLanes & b) !== b
+            ? ((a.childLanes |= b), d !== null && (d.childLanes |= b))
+            : d !== null && (d.childLanes & b) !== b && (d.childLanes |= b);
+          if (a === c) break;
+          a = a.return;
+        }
+      }
+      function ng(a, b) {
+        hg = a;
+        jg = ig = null;
+        a = a.dependencies;
+        a !== null &&
+          a.firstContext !== null &&
+          ((a.lanes & b) !== 0 && (og = true), (a.firstContext = null));
+      }
+      function pg(a) {
+        var b = a._currentValue;
+        if (jg !== a)
+          if (
+            ((a = { context: a, memoizedValue: b, next: null }), ig === null)
+          ) {
+            if (hg === null) throw Error(p$1(308));
+            ig = a;
+            hg.dependencies = { lanes: 0, firstContext: a };
+          } else ig = ig.next = a;
+        return b;
+      }
+      var qg = null,
+        rg = false;
+      function sg(a) {
+        a.updateQueue = {
+          baseState: a.memoizedState,
+          firstBaseUpdate: null,
+          lastBaseUpdate: null,
+          shared: { pending: null, interleaved: null, lanes: 0 },
+          effects: null,
+        };
+      }
+      function tg(a, b) {
+        a = a.updateQueue;
+        b.updateQueue === a &&
+          (b.updateQueue = {
+            baseState: a.baseState,
+            firstBaseUpdate: a.firstBaseUpdate,
+            lastBaseUpdate: a.lastBaseUpdate,
+            shared: a.shared,
+            effects: a.effects,
+          });
+      }
+      function ug(a, b) {
+        return {
+          eventTime: a,
+          lane: b,
+          tag: 0,
+          payload: null,
+          callback: null,
+          next: null,
+        };
+      }
+      function vg(a, b) {
+        var c = a.updateQueue;
+        c !== null &&
+          ((c = c.shared),
+          J !== null && (a.mode & 1) !== 0 && (K & 2) === 0
+            ? ((a = c.interleaved),
+              a === null
+                ? ((b.next = b), qg === null ? (qg = [c]) : qg.push(c))
+                : ((b.next = a.next), (a.next = b)),
+              (c.interleaved = b))
+            : ((a = c.pending),
+              a === null ? (b.next = b) : ((b.next = a.next), (a.next = b)),
+              (c.pending = b)));
+      }
+      function wg(a, b, c) {
+        b = b.updateQueue;
+        if (b !== null && ((b = b.shared), (c & 4194240) !== 0)) {
+          var d = b.lanes;
+          d &= a.pendingLanes;
+          c |= d;
+          b.lanes = c;
+          yc(a, c);
+        }
+      }
+      function xg(a, b) {
+        var c = a.updateQueue,
+          d = a.alternate;
+        if (d !== null && ((d = d.updateQueue), c === d)) {
+          var e = null,
+            f = null;
+          c = c.firstBaseUpdate;
+          if (c !== null) {
+            do {
+              var g = {
+                eventTime: c.eventTime,
+                lane: c.lane,
+                tag: c.tag,
+                payload: c.payload,
+                callback: c.callback,
+                next: null,
+              };
+              f === null ? (e = f = g) : (f = f.next = g);
+              c = c.next;
+            } while (c !== null);
+            f === null ? (e = f = b) : (f = f.next = b);
+          } else e = f = b;
+          c = {
+            baseState: d.baseState,
+            firstBaseUpdate: e,
+            lastBaseUpdate: f,
+            shared: d.shared,
+            effects: d.effects,
+          };
+          a.updateQueue = c;
+          return;
+        }
+        a = c.lastBaseUpdate;
+        a === null ? (c.firstBaseUpdate = b) : (a.next = b);
+        c.lastBaseUpdate = b;
+      }
+      function yg(a, b, c, d) {
+        var e = a.updateQueue;
+        rg = false;
+        var f = e.firstBaseUpdate,
+          g = e.lastBaseUpdate,
+          h = e.shared.pending;
+        if (h !== null) {
+          e.shared.pending = null;
+          var k = h,
+            l2 = k.next;
+          k.next = null;
+          g === null ? (f = l2) : (g.next = l2);
+          g = k;
+          var m = a.alternate;
+          m !== null &&
+            ((m = m.updateQueue),
+            (h = m.lastBaseUpdate),
+            h !== g &&
+              (h === null ? (m.firstBaseUpdate = l2) : (h.next = l2),
+              (m.lastBaseUpdate = k)));
+        }
+        if (f !== null) {
+          var w2 = e.baseState;
+          g = 0;
+          m = l2 = k = null;
+          h = f;
+          do {
+            var u2 = h.lane,
+              y2 = h.eventTime;
+            if ((d & u2) === u2) {
+              m !== null &&
+                (m = m.next =
+                  {
+                    eventTime: y2,
+                    lane: 0,
+                    tag: h.tag,
+                    payload: h.payload,
+                    callback: h.callback,
+                    next: null,
+                  });
+              a: {
+                var n2 = a,
+                  v2 = h;
+                u2 = b;
+                y2 = c;
+                switch (v2.tag) {
+                  case 1:
+                    n2 = v2.payload;
+                    if (typeof n2 === "function") {
+                      w2 = n2.call(y2, w2, u2);
+                      break a;
+                    }
+                    w2 = n2;
+                    break a;
+                  case 3:
+                    n2.flags = (n2.flags & -65537) | 128;
+                  case 0:
+                    n2 = v2.payload;
+                    u2 = typeof n2 === "function" ? n2.call(y2, w2, u2) : n2;
+                    if (u2 === null || u2 === void 0) break a;
+                    w2 = A({}, w2, u2);
+                    break a;
+                  case 2:
+                    rg = true;
+                }
+              }
+              h.callback !== null &&
+                h.lane !== 0 &&
+                ((a.flags |= 64),
+                (u2 = e.effects),
+                u2 === null ? (e.effects = [h]) : u2.push(h));
+            } else
+              (y2 = {
+                eventTime: y2,
+                lane: u2,
+                tag: h.tag,
+                payload: h.payload,
+                callback: h.callback,
+                next: null,
+              }),
+                m === null ? ((l2 = m = y2), (k = w2)) : (m = m.next = y2),
+                (g |= u2);
+            h = h.next;
+            if (h === null)
+              if (((h = e.shared.pending), h === null)) break;
+              else
+                (u2 = h),
+                  (h = u2.next),
+                  (u2.next = null),
+                  (e.lastBaseUpdate = u2),
+                  (e.shared.pending = null);
+          } while (1);
+          m === null && (k = w2);
+          e.baseState = k;
+          e.firstBaseUpdate = l2;
+          e.lastBaseUpdate = m;
+          b = e.shared.interleaved;
+          if (b !== null) {
+            e = b;
+            do (g |= e.lane), (e = e.next);
+            while (e !== b);
+          } else f === null && (e.shared.lanes = 0);
+          zg |= g;
+          a.lanes = g;
+          a.memoizedState = w2;
+        }
+      }
+      function Ag(a, b, c) {
+        a = b.effects;
+        b.effects = null;
+        if (a !== null)
+          for (b = 0; b < a.length; b++) {
+            var d = a[b],
+              e = d.callback;
+            if (e !== null) {
+              d.callback = null;
+              d = c;
+              if (typeof e !== "function") throw Error(p$1(191, e));
+              e.call(d);
+            }
+          }
+      }
+      var Bg = new aa.Component().refs;
+      function Cg(a, b, c, d) {
+        b = a.memoizedState;
+        c = c(d, b);
+        c = c === null || c === void 0 ? b : A({}, b, c);
+        a.memoizedState = c;
+        a.lanes === 0 && (a.updateQueue.baseState = c);
+      }
+      var Fg = {
+        isMounted: function (a) {
+          return (a = a._reactInternals) ? Sb(a) === a : false;
+        },
+        enqueueSetState: function (a, b, c) {
+          a = a._reactInternals;
+          var d = M(),
+            e = Dg(a),
+            f = ug(d, e);
+          f.payload = b;
+          c !== void 0 && c !== null && (f.callback = c);
+          vg(a, f);
+          b = Eg(a, e, d);
+          b !== null && wg(b, a, e);
+        },
+        enqueueReplaceState: function (a, b, c) {
+          a = a._reactInternals;
+          var d = M(),
+            e = Dg(a),
+            f = ug(d, e);
+          f.tag = 1;
+          f.payload = b;
+          c !== void 0 && c !== null && (f.callback = c);
+          vg(a, f);
+          b = Eg(a, e, d);
+          b !== null && wg(b, a, e);
+        },
+        enqueueForceUpdate: function (a, b) {
+          a = a._reactInternals;
+          var c = M(),
+            d = Dg(a),
+            e = ug(c, d);
+          e.tag = 2;
+          b !== void 0 && b !== null && (e.callback = b);
+          vg(a, e);
+          b = Eg(a, d, c);
+          b !== null && wg(b, a, d);
+        },
+      };
+      function Gg$1(a, b, c, d, e, f, g) {
+        a = a.stateNode;
+        return typeof a.shouldComponentUpdate === "function"
+          ? a.shouldComponentUpdate(d, f, g)
+          : b.prototype && b.prototype.isPureReactComponent
+          ? !De(c, d) || !De(e, f)
+          : true;
+      }
+      function Hg(a, b, c) {
+        var d = false,
+          e = Pf;
+        var f = b.contextType;
+        typeof f === "object" && f !== null
+          ? (f = pg(f))
+          : ((e = Tf(b) ? Rf : I.current),
+            (d = b.contextTypes),
+            (f = (d = d !== null && d !== void 0) ? Sf(a, e) : Pf));
+        b = new b(c, f);
+        a.memoizedState =
+          b.state !== null && b.state !== void 0 ? b.state : null;
+        b.updater = Fg;
+        a.stateNode = b;
+        b._reactInternals = a;
+        d &&
+          ((a = a.stateNode),
+          (a.__reactInternalMemoizedUnmaskedChildContext = e),
+          (a.__reactInternalMemoizedMaskedChildContext = f));
+        return b;
+      }
+      function Ig(a, b, c, d) {
+        a = b.state;
+        typeof b.componentWillReceiveProps === "function" &&
+          b.componentWillReceiveProps(c, d);
+        typeof b.UNSAFE_componentWillReceiveProps === "function" &&
+          b.UNSAFE_componentWillReceiveProps(c, d);
+        b.state !== a && Fg.enqueueReplaceState(b, b.state, null);
+      }
+      function Jg(a, b, c, d) {
+        var e = a.stateNode;
+        e.props = c;
+        e.state = a.memoizedState;
+        e.refs = Bg;
+        sg(a);
+        var f = b.contextType;
+        typeof f === "object" && f !== null
+          ? (e.context = pg(f))
+          : ((f = Tf(b) ? Rf : I.current), (e.context = Sf(a, f)));
+        e.state = a.memoizedState;
+        f = b.getDerivedStateFromProps;
+        typeof f === "function" &&
+          (Cg(a, b, f, c), (e.state = a.memoizedState));
+        typeof b.getDerivedStateFromProps === "function" ||
+          typeof e.getSnapshotBeforeUpdate === "function" ||
+          (typeof e.UNSAFE_componentWillMount !== "function" &&
+            typeof e.componentWillMount !== "function") ||
+          ((b = e.state),
+          typeof e.componentWillMount === "function" && e.componentWillMount(),
+          typeof e.UNSAFE_componentWillMount === "function" &&
+            e.UNSAFE_componentWillMount(),
+          b !== e.state && Fg.enqueueReplaceState(e, e.state, null),
+          yg(a, c, e, d),
+          (e.state = a.memoizedState));
+        typeof e.componentDidMount === "function" && (a.flags |= 4194308);
+      }
+      var Kg = [],
+        Lg = 0,
+        Mg = null,
+        Ng = 0,
+        Og = [],
+        Pg = 0,
+        Qg = null,
+        Rg = 1,
+        Sg = "";
+      function Tg(a, b) {
+        Kg[Lg++] = Ng;
+        Kg[Lg++] = Mg;
+        Mg = a;
+        Ng = b;
+      }
+      function Ug(a, b, c) {
+        Og[Pg++] = Rg;
+        Og[Pg++] = Sg;
+        Og[Pg++] = Qg;
+        Qg = a;
+        var d = Rg;
+        a = Sg;
+        var e = 32 - lc(d) - 1;
+        d &= ~(1 << e);
+        c += 1;
+        var f = 32 - lc(b) + e;
+        if (30 < f) {
+          var g = e - (e % 5);
+          f = (d & ((1 << g) - 1)).toString(32);
+          d >>= g;
+          e -= g;
+          Rg = (1 << (32 - lc(b) + e)) | (c << e) | d;
+          Sg = f + a;
+        } else (Rg = (1 << f) | (c << e) | d), (Sg = a);
+      }
+      function Vg(a) {
+        a.return !== null && (Tg(a, 1), Ug(a, 1, 0));
+      }
+      function Wg(a) {
+        for (; a === Mg; )
+          (Mg = Kg[--Lg]), (Kg[Lg] = null), (Ng = Kg[--Lg]), (Kg[Lg] = null);
+        for (; a === Qg; )
+          (Qg = Og[--Pg]),
+            (Og[Pg] = null),
+            (Sg = Og[--Pg]),
+            (Og[Pg] = null),
+            (Rg = Og[--Pg]),
+            (Og[Pg] = null);
+      }
+      var Xg = null,
+        Yg = null,
+        N = false,
+        Zg = null;
+      function $g(a, b) {
+        var c = ah(5, null, null, 0);
+        c.elementType = "DELETED";
+        c.stateNode = b;
+        c.return = a;
+        b = a.deletions;
+        b === null ? ((a.deletions = [c]), (a.flags |= 16)) : b.push(c);
+      }
+      function bh(a, b) {
+        switch (a.tag) {
+          case 5:
+            var c = a.type;
+            b =
+              b.nodeType !== 1 || c.toLowerCase() !== b.nodeName.toLowerCase()
+                ? null
+                : b;
+            return b !== null
+              ? ((a.stateNode = b), (Xg = a), (Yg = Ff(b.firstChild)), true)
+              : false;
+          case 6:
+            return (
+              (b = a.pendingProps === "" || b.nodeType !== 3 ? null : b),
+              b !== null
+                ? ((a.stateNode = b), (Xg = a), (Yg = null), true)
+                : false
+            );
+          case 13:
+            return (
+              (b = b.nodeType !== 8 ? null : b),
+              b !== null
+                ? ((c = Qg !== null ? { id: Rg, overflow: Sg } : null),
+                  (a.memoizedState = {
+                    dehydrated: b,
+                    treeContext: c,
+                    retryLane: 1073741824,
+                  }),
+                  (c = ah(18, null, null, 0)),
+                  (c.stateNode = b),
+                  (c.return = a),
+                  (a.child = c),
+                  (Xg = a),
+                  (Yg = null),
+                  true)
+                : false
+            );
+          default:
+            return false;
+        }
+      }
+      function ch$1(a) {
+        return (a.mode & 1) !== 0 && (a.flags & 128) === 0;
+      }
+      function dh(a) {
+        if (N) {
+          var b = Yg;
+          if (b) {
+            var c = b;
+            if (!bh(a, b)) {
+              if (ch$1(a)) throw Error(p$1(418));
+              b = Ff(c.nextSibling);
+              var d = Xg;
+              b && bh(a, b)
+                ? $g(d, c)
+                : ((a.flags = (a.flags & -4097) | 2), (N = false), (Xg = a));
+            }
+          } else {
+            if (ch$1(a)) throw Error(p$1(418));
+            a.flags = (a.flags & -4097) | 2;
+            N = false;
+            Xg = a;
+          }
+        }
+      }
+      function eh(a) {
+        for (
+          a = a.return;
+          a !== null && a.tag !== 5 && a.tag !== 3 && a.tag !== 13;
+
+        )
+          a = a.return;
+        Xg = a;
+      }
+      function fh(a) {
+        if (a !== Xg) return false;
+        if (!N) return eh(a), (N = true), false;
+        var b;
+        (b = a.tag !== 3) &&
+          !(b = a.tag !== 5) &&
+          ((b = a.type),
+          (b = b !== "head" && b !== "body" && !yf(a.type, a.memoizedProps)));
+        if (b && (b = Yg)) {
+          if (ch$1(a)) {
+            for (a = Yg; a; ) a = Ff(a.nextSibling);
+            throw Error(p$1(418));
+          }
+          for (; b; ) $g(a, b), (b = Ff(b.nextSibling));
+        }
+        eh(a);
+        if (a.tag === 13) {
+          a = a.memoizedState;
+          a = a !== null ? a.dehydrated : null;
+          if (!a) throw Error(p$1(317));
+          a: {
+            a = a.nextSibling;
+            for (b = 0; a; ) {
+              if (a.nodeType === 8) {
+                var c = a.data;
+                if (c === "/$") {
+                  if (b === 0) {
+                    Yg = Ff(a.nextSibling);
+                    break a;
+                  }
+                  b--;
+                } else (c !== "$" && c !== "$!" && c !== "$?") || b++;
+              }
+              a = a.nextSibling;
+            }
+            Yg = null;
+          }
+        } else Yg = Xg ? Ff(a.stateNode.nextSibling) : null;
+        return true;
+      }
+      function gh() {
+        Yg = Xg = null;
+        N = false;
+      }
+      function hh(a) {
+        Zg === null ? (Zg = [a]) : Zg.push(a);
+      }
+      function ih(a, b, c) {
+        a = c.ref;
+        if (a !== null && typeof a !== "function" && typeof a !== "object") {
+          if (c._owner) {
+            c = c._owner;
+            if (c) {
+              if (c.tag !== 1) throw Error(p$1(309));
+              var d = c.stateNode;
+            }
+            if (!d) throw Error(p$1(147, a));
+            var e = d,
+              f = "" + a;
+            if (
+              b !== null &&
+              b.ref !== null &&
+              typeof b.ref === "function" &&
+              b.ref._stringRef === f
+            )
+              return b.ref;
+            b = function (a2) {
+              var b2 = e.refs;
+              b2 === Bg && (b2 = e.refs = {});
+              a2 === null ? delete b2[f] : (b2[f] = a2);
+            };
+            b._stringRef = f;
+            return b;
+          }
+          if (typeof a !== "string") throw Error(p$1(284));
+          if (!c._owner) throw Error(p$1(290, a));
+        }
+        return a;
+      }
+      function jh(a, b) {
+        a = Object.prototype.toString.call(b);
+        throw Error(
+          p$1(
+            31,
+            a === "[object Object]"
+              ? "object with keys {" + Object.keys(b).join(", ") + "}"
+              : a
+          )
+        );
+      }
+      function kh(a) {
+        var b = a._init;
+        return b(a._payload);
+      }
+      function lh(a) {
+        function b(b2, c2) {
+          if (a) {
+            var d2 = b2.deletions;
+            d2 === null
+              ? ((b2.deletions = [c2]), (b2.flags |= 16))
+              : d2.push(c2);
+          }
+        }
+        function c(c2, d2) {
+          if (!a) return null;
+          for (; d2 !== null; ) b(c2, d2), (d2 = d2.sibling);
+          return null;
+        }
+        function d(a2, b2) {
+          for (a2 = /* @__PURE__ */ new Map(); b2 !== null; )
+            b2.key !== null ? a2.set(b2.key, b2) : a2.set(b2.index, b2),
+              (b2 = b2.sibling);
+          return a2;
+        }
+        function e(a2, b2) {
+          a2 = mh(a2, b2);
+          a2.index = 0;
+          a2.sibling = null;
+          return a2;
+        }
+        function f(b2, c2, d2) {
+          b2.index = d2;
+          if (!a) return (b2.flags |= 1048576), c2;
+          d2 = b2.alternate;
+          if (d2 !== null)
+            return (d2 = d2.index), d2 < c2 ? ((b2.flags |= 2), c2) : d2;
+          b2.flags |= 2;
+          return c2;
+        }
+        function g(b2) {
+          a && b2.alternate === null && (b2.flags |= 2);
+          return b2;
+        }
+        function h(a2, b2, c2, d2) {
+          if (b2 === null || b2.tag !== 6)
+            return (b2 = nh(c2, a2.mode, d2)), (b2.return = a2), b2;
+          b2 = e(b2, c2);
+          b2.return = a2;
+          return b2;
+        }
+        function k(a2, b2, c2, d2) {
+          var f2 = c2.type;
+          if (f2 === va) return m(a2, b2, c2.props.children, d2, c2.key);
+          if (
+            b2 !== null &&
+            (b2.elementType === f2 ||
+              (typeof f2 === "object" &&
+                f2 !== null &&
+                f2.$$typeof === Fa &&
+                kh(f2) === b2.type))
+          )
+            return (
+              (d2 = e(b2, c2.props)),
+              (d2.ref = ih(a2, b2, c2)),
+              (d2.return = a2),
+              d2
+            );
+          d2 = oh(c2.type, c2.key, c2.props, null, a2.mode, d2);
+          d2.ref = ih(a2, b2, c2);
+          d2.return = a2;
+          return d2;
+        }
+        function l2(a2, b2, c2, d2) {
+          if (
+            b2 === null ||
+            b2.tag !== 4 ||
+            b2.stateNode.containerInfo !== c2.containerInfo ||
+            b2.stateNode.implementation !== c2.implementation
+          )
+            return (b2 = ph(c2, a2.mode, d2)), (b2.return = a2), b2;
+          b2 = e(b2, c2.children || []);
+          b2.return = a2;
+          return b2;
+        }
+        function m(a2, b2, c2, d2, f2) {
+          if (b2 === null || b2.tag !== 7)
+            return (b2 = qh(c2, a2.mode, d2, f2)), (b2.return = a2), b2;
+          b2 = e(b2, c2);
+          b2.return = a2;
+          return b2;
+        }
+        function w2(a2, b2, c2) {
+          if ((typeof b2 === "string" && b2 !== "") || typeof b2 === "number")
+            return (b2 = nh("" + b2, a2.mode, c2)), (b2.return = a2), b2;
+          if (typeof b2 === "object" && b2 !== null) {
+            switch (b2.$$typeof) {
+              case ta:
+                return (
+                  (c2 = oh(b2.type, b2.key, b2.props, null, a2.mode, c2)),
+                  (c2.ref = ih(a2, null, b2)),
+                  (c2.return = a2),
+                  c2
+                );
+              case ua:
+                return (b2 = ph(b2, a2.mode, c2)), (b2.return = a2), b2;
+              case Fa:
+                var d2 = b2._init;
+                return w2(a2, d2(b2._payload), c2);
+            }
+            if (bb(b2) || Ia(b2))
+              return (b2 = qh(b2, a2.mode, c2, null)), (b2.return = a2), b2;
+            jh(a2, b2);
+          }
+          return null;
+        }
+        function u2(a2, b2, c2, d2) {
+          var e2 = b2 !== null ? b2.key : null;
+          if ((typeof c2 === "string" && c2 !== "") || typeof c2 === "number")
+            return e2 !== null ? null : h(a2, b2, "" + c2, d2);
+          if (typeof c2 === "object" && c2 !== null) {
+            switch (c2.$$typeof) {
+              case ta:
+                return c2.key === e2 ? k(a2, b2, c2, d2) : null;
+              case ua:
+                return c2.key === e2 ? l2(a2, b2, c2, d2) : null;
+              case Fa:
+                return (e2 = c2._init), u2(a2, b2, e2(c2._payload), d2);
+            }
+            if (bb(c2) || Ia(c2))
+              return e2 !== null ? null : m(a2, b2, c2, d2, null);
+            jh(a2, c2);
+          }
+          return null;
+        }
+        function y2(a2, b2, c2, d2, e2) {
+          if ((typeof d2 === "string" && d2 !== "") || typeof d2 === "number")
+            return (a2 = a2.get(c2) || null), h(b2, a2, "" + d2, e2);
+          if (typeof d2 === "object" && d2 !== null) {
+            switch (d2.$$typeof) {
+              case ta:
+                return (
+                  (a2 = a2.get(d2.key === null ? c2 : d2.key) || null),
+                  k(b2, a2, d2, e2)
+                );
+              case ua:
+                return (
+                  (a2 = a2.get(d2.key === null ? c2 : d2.key) || null),
+                  l2(b2, a2, d2, e2)
+                );
+              case Fa:
+                var f2 = d2._init;
+                return y2(a2, b2, c2, f2(d2._payload), e2);
+            }
+            if (bb(d2) || Ia(d2))
+              return (a2 = a2.get(c2) || null), m(b2, a2, d2, e2, null);
+            jh(b2, d2);
+          }
+          return null;
+        }
+        function n2(e2, g2, h2, k2) {
+          for (
+            var l3 = null, n3 = null, m2 = g2, r2 = (g2 = 0), x2 = null;
+            m2 !== null && r2 < h2.length;
+            r2++
+          ) {
+            m2.index > r2 ? ((x2 = m2), (m2 = null)) : (x2 = m2.sibling);
+            var t2 = u2(e2, m2, h2[r2], k2);
+            if (t2 === null) {
+              m2 === null && (m2 = x2);
+              break;
+            }
+            a && m2 && t2.alternate === null && b(e2, m2);
+            g2 = f(t2, g2, r2);
+            n3 === null ? (l3 = t2) : (n3.sibling = t2);
+            n3 = t2;
+            m2 = x2;
+          }
+          if (r2 === h2.length) return c(e2, m2), N && Tg(e2, r2), l3;
+          if (m2 === null) {
+            for (; r2 < h2.length; r2++)
+              (m2 = w2(e2, h2[r2], k2)),
+                m2 !== null &&
+                  ((g2 = f(m2, g2, r2)),
+                  n3 === null ? (l3 = m2) : (n3.sibling = m2),
+                  (n3 = m2));
+            N && Tg(e2, r2);
+            return l3;
+          }
+          for (m2 = d(e2, m2); r2 < h2.length; r2++)
+            (x2 = y2(m2, e2, r2, h2[r2], k2)),
+              x2 !== null &&
+                (a &&
+                  x2.alternate !== null &&
+                  m2.delete(x2.key === null ? r2 : x2.key),
+                (g2 = f(x2, g2, r2)),
+                n3 === null ? (l3 = x2) : (n3.sibling = x2),
+                (n3 = x2));
+          a &&
+            m2.forEach(function (a2) {
+              return b(e2, a2);
+            });
+          N && Tg(e2, r2);
+          return l3;
+        }
+        function v2(e2, g2, h2, k2) {
+          var l3 = Ia(h2);
+          if (typeof l3 !== "function") throw Error(p$1(150));
+          h2 = l3.call(h2);
+          if (h2 == null) throw Error(p$1(151));
+          for (
+            var m2 = (l3 = null),
+              n3 = g2,
+              r2 = (g2 = 0),
+              x2 = null,
+              t2 = h2.next();
+            n3 !== null && !t2.done;
+            r2++, t2 = h2.next()
+          ) {
+            n3.index > r2 ? ((x2 = n3), (n3 = null)) : (x2 = n3.sibling);
+            var v3 = u2(e2, n3, t2.value, k2);
+            if (v3 === null) {
+              n3 === null && (n3 = x2);
+              break;
+            }
+            a && n3 && v3.alternate === null && b(e2, n3);
+            g2 = f(v3, g2, r2);
+            m2 === null ? (l3 = v3) : (m2.sibling = v3);
+            m2 = v3;
+            n3 = x2;
+          }
+          if (t2.done) return c(e2, n3), N && Tg(e2, r2), l3;
+          if (n3 === null) {
+            for (; !t2.done; r2++, t2 = h2.next())
+              (t2 = w2(e2, t2.value, k2)),
+                t2 !== null &&
+                  ((g2 = f(t2, g2, r2)),
+                  m2 === null ? (l3 = t2) : (m2.sibling = t2),
+                  (m2 = t2));
+            N && Tg(e2, r2);
+            return l3;
+          }
+          for (n3 = d(e2, n3); !t2.done; r2++, t2 = h2.next())
+            (t2 = y2(n3, e2, r2, t2.value, k2)),
+              t2 !== null &&
+                (a &&
+                  t2.alternate !== null &&
+                  n3.delete(t2.key === null ? r2 : t2.key),
+                (g2 = f(t2, g2, r2)),
+                m2 === null ? (l3 = t2) : (m2.sibling = t2),
+                (m2 = t2));
+          a &&
+            n3.forEach(function (a2) {
+              return b(e2, a2);
+            });
+          N && Tg(e2, r2);
+          return l3;
+        }
+        function C2(a2, d2, f2, h2) {
+          typeof f2 === "object" &&
+            f2 !== null &&
+            f2.type === va &&
+            f2.key === null &&
+            (f2 = f2.props.children);
+          if (typeof f2 === "object" && f2 !== null) {
+            switch (f2.$$typeof) {
+              case ta:
+                a: {
+                  for (var k2 = f2.key, l3 = d2; l3 !== null; ) {
+                    if (l3.key === k2) {
+                      k2 = f2.type;
+                      if (k2 === va) {
+                        if (l3.tag === 7) {
+                          c(a2, l3.sibling);
+                          d2 = e(l3, f2.props.children);
+                          d2.return = a2;
+                          a2 = d2;
+                          break a;
+                        }
+                      } else if (
+                        l3.elementType === k2 ||
+                        (typeof k2 === "object" &&
+                          k2 !== null &&
+                          k2.$$typeof === Fa &&
+                          kh(k2) === l3.type)
+                      ) {
+                        c(a2, l3.sibling);
+                        d2 = e(l3, f2.props);
+                        d2.ref = ih(a2, l3, f2);
+                        d2.return = a2;
+                        a2 = d2;
+                        break a;
+                      }
+                      c(a2, l3);
+                      break;
+                    } else b(a2, l3);
+                    l3 = l3.sibling;
+                  }
+                  f2.type === va
+                    ? ((d2 = qh(f2.props.children, a2.mode, h2, f2.key)),
+                      (d2.return = a2),
+                      (a2 = d2))
+                    : ((h2 = oh(f2.type, f2.key, f2.props, null, a2.mode, h2)),
+                      (h2.ref = ih(a2, d2, f2)),
+                      (h2.return = a2),
+                      (a2 = h2));
+                }
+                return g(a2);
+              case ua:
+                a: {
+                  for (l3 = f2.key; d2 !== null; ) {
+                    if (d2.key === l3)
+                      if (
+                        d2.tag === 4 &&
+                        d2.stateNode.containerInfo === f2.containerInfo &&
+                        d2.stateNode.implementation === f2.implementation
+                      ) {
+                        c(a2, d2.sibling);
+                        d2 = e(d2, f2.children || []);
+                        d2.return = a2;
+                        a2 = d2;
+                        break a;
+                      } else {
+                        c(a2, d2);
+                        break;
+                      }
+                    else b(a2, d2);
+                    d2 = d2.sibling;
+                  }
+                  d2 = ph(f2, a2.mode, h2);
+                  d2.return = a2;
+                  a2 = d2;
+                }
+                return g(a2);
+              case Fa:
+                return (l3 = f2._init), C2(a2, d2, l3(f2._payload), h2);
+            }
+            if (bb(f2)) return n2(a2, d2, f2, h2);
+            if (Ia(f2)) return v2(a2, d2, f2, h2);
+            jh(a2, f2);
+          }
+          return (typeof f2 === "string" && f2 !== "") || typeof f2 === "number"
+            ? ((f2 = "" + f2),
+              d2 !== null && d2.tag === 6
+                ? (c(a2, d2.sibling),
+                  (d2 = e(d2, f2)),
+                  (d2.return = a2),
+                  (a2 = d2))
+                : (c(a2, d2),
+                  (d2 = nh(f2, a2.mode, h2)),
+                  (d2.return = a2),
+                  (a2 = d2)),
+              g(a2))
+            : c(a2, d2);
+        }
+        return C2;
+      }
+      var rh = lh(true),
+        sh = lh(false),
+        th = {},
+        uh = Of(th),
+        vh = Of(th),
+        wh = Of(th);
+      function xh(a) {
+        if (a === th) throw Error(p$1(174));
+        return a;
+      }
+      function yh(a, b) {
+        H(wh, b);
+        H(vh, a);
+        H(uh, th);
+        a = b.nodeType;
+        switch (a) {
+          case 9:
+          case 11:
+            b = (b = b.documentElement) ? b.namespaceURI : ib(null, "");
+            break;
+          default:
+            (a = a === 8 ? b.parentNode : b),
+              (b = a.namespaceURI || null),
+              (a = a.tagName),
+              (b = ib(b, a));
+        }
+        G(uh);
+        H(uh, b);
+      }
+      function zh() {
+        G(uh);
+        G(vh);
+        G(wh);
+      }
+      function Ah(a) {
+        xh(wh.current);
+        var b = xh(uh.current);
+        var c = ib(b, a.type);
+        b !== c && (H(vh, a), H(uh, c));
+      }
+      function Bh(a) {
+        vh.current === a && (G(uh), G(vh));
+      }
+      var P = Of(0);
+      function Ch(a) {
+        for (var b = a; b !== null; ) {
+          if (b.tag === 13) {
+            var c = b.memoizedState;
+            if (
+              c !== null &&
+              ((c = c.dehydrated),
+              c === null || c.data === "$?" || c.data === "$!")
+            )
+              return b;
+          } else if (b.tag === 19 && b.memoizedProps.revealOrder !== void 0) {
+            if ((b.flags & 128) !== 0) return b;
+          } else if (b.child !== null) {
+            b.child.return = b;
+            b = b.child;
+            continue;
+          }
+          if (b === a) break;
+          for (; b.sibling === null; ) {
+            if (b.return === null || b.return === a) return null;
+            b = b.return;
+          }
+          b.sibling.return = b.return;
+          b = b.sibling;
+        }
+        return null;
+      }
+      var Dh = [];
+      function Eh() {
+        for (var a = 0; a < Dh.length; a++)
+          Dh[a]._workInProgressVersionPrimary = null;
+        Dh.length = 0;
+      }
+      var Fh = sa.ReactCurrentDispatcher,
+        Gh = sa.ReactCurrentBatchConfig,
+        Hh = 0,
+        Q = null,
+        R = null,
+        S = null,
+        Ih = false,
+        Jh = false,
+        Kh = 0,
+        Lh = 0;
+      function U() {
+        throw Error(p$1(321));
+      }
+      function Mh(a, b) {
+        if (b === null) return false;
+        for (var c = 0; c < b.length && c < a.length; c++)
+          if (!Ce(a[c], b[c])) return false;
+        return true;
+      }
+      function Nh(a, b, c, d, e, f) {
+        Hh = f;
+        Q = b;
+        b.memoizedState = null;
+        b.updateQueue = null;
+        b.lanes = 0;
+        Fh.current = a === null || a.memoizedState === null ? Oh : Ph;
+        a = c(d, e);
+        if (Jh) {
+          f = 0;
+          do {
+            Jh = false;
+            Kh = 0;
+            if (25 <= f) throw Error(p$1(301));
+            f += 1;
+            S = R = null;
+            b.updateQueue = null;
+            Fh.current = Qh;
+            a = c(d, e);
+          } while (Jh);
+        }
+        Fh.current = Rh;
+        b = R !== null && R.next !== null;
+        Hh = 0;
+        S = R = Q = null;
+        Ih = false;
+        if (b) throw Error(p$1(300));
+        return a;
+      }
+      function Sh() {
+        var a = Kh !== 0;
+        Kh = 0;
+        return a;
+      }
+      function Th() {
+        var a = {
+          memoizedState: null,
+          baseState: null,
+          baseQueue: null,
+          queue: null,
+          next: null,
+        };
+        S === null ? (Q.memoizedState = S = a) : (S = S.next = a);
+        return S;
+      }
+      function Uh() {
+        if (R === null) {
+          var a = Q.alternate;
+          a = a !== null ? a.memoizedState : null;
+        } else a = R.next;
+        var b = S === null ? Q.memoizedState : S.next;
+        if (b !== null) (S = b), (R = a);
+        else {
+          if (a === null) throw Error(p$1(310));
+          R = a;
+          a = {
+            memoizedState: R.memoizedState,
+            baseState: R.baseState,
+            baseQueue: R.baseQueue,
+            queue: R.queue,
+            next: null,
+          };
+          S === null ? (Q.memoizedState = S = a) : (S = S.next = a);
+        }
+        return S;
+      }
+      function Vh(a, b) {
+        return typeof b === "function" ? b(a) : b;
+      }
+      function Wh(a) {
+        var b = Uh(),
+          c = b.queue;
+        if (c === null) throw Error(p$1(311));
+        c.lastRenderedReducer = a;
+        var d = R,
+          e = d.baseQueue,
+          f = c.pending;
+        if (f !== null) {
+          if (e !== null) {
+            var g = e.next;
+            e.next = f.next;
+            f.next = g;
+          }
+          d.baseQueue = e = f;
+          c.pending = null;
+        }
+        if (e !== null) {
+          f = e.next;
+          d = d.baseState;
+          var h = (g = null),
+            k = null,
+            l2 = f;
+          do {
+            var m = l2.lane;
+            if ((Hh & m) === m)
+              k !== null &&
+                (k = k.next =
+                  {
+                    lane: 0,
+                    action: l2.action,
+                    hasEagerState: l2.hasEagerState,
+                    eagerState: l2.eagerState,
+                    next: null,
+                  }),
+                (d = l2.hasEagerState ? l2.eagerState : a(d, l2.action));
+            else {
+              var w2 = {
+                lane: m,
+                action: l2.action,
+                hasEagerState: l2.hasEagerState,
+                eagerState: l2.eagerState,
+                next: null,
+              };
+              k === null ? ((h = k = w2), (g = d)) : (k = k.next = w2);
+              Q.lanes |= m;
+              zg |= m;
+            }
+            l2 = l2.next;
+          } while (l2 !== null && l2 !== f);
+          k === null ? (g = d) : (k.next = h);
+          Ce(d, b.memoizedState) || (og = true);
+          b.memoizedState = d;
+          b.baseState = g;
+          b.baseQueue = k;
+          c.lastRenderedState = d;
+        }
+        a = c.interleaved;
+        if (a !== null) {
+          e = a;
+          do (f = e.lane), (Q.lanes |= f), (zg |= f), (e = e.next);
+          while (e !== a);
+        } else e === null && (c.lanes = 0);
+        return [b.memoizedState, c.dispatch];
+      }
+      function Xh(a) {
+        var b = Uh(),
+          c = b.queue;
+        if (c === null) throw Error(p$1(311));
+        c.lastRenderedReducer = a;
+        var d = c.dispatch,
+          e = c.pending,
+          f = b.memoizedState;
+        if (e !== null) {
+          c.pending = null;
+          var g = (e = e.next);
+          do (f = a(f, g.action)), (g = g.next);
+          while (g !== e);
+          Ce(f, b.memoizedState) || (og = true);
+          b.memoizedState = f;
+          b.baseQueue === null && (b.baseState = f);
+          c.lastRenderedState = f;
+        }
+        return [f, d];
+      }
+      function Yh() {}
+      function Zh(a, b) {
+        var c = Q,
+          d = Uh(),
+          e = b(),
+          f = !Ce(d.memoizedState, e);
+        f && ((d.memoizedState = e), (og = true));
+        d = d.queue;
+        $h(ai.bind(null, c, d, a), [a]);
+        if (
+          d.getSnapshot !== b ||
+          f ||
+          (S !== null && S.memoizedState.tag & 1)
+        ) {
+          c.flags |= 2048;
+          bi(9, ci.bind(null, c, d, e, b), void 0, null);
+          if (J === null) throw Error(p$1(349));
+          (Hh & 30) !== 0 || di(c, b, e);
+        }
+        return e;
+      }
+      function di(a, b, c) {
+        a.flags |= 16384;
+        a = { getSnapshot: b, value: c };
+        b = Q.updateQueue;
+        b === null
+          ? ((b = { lastEffect: null, stores: null }),
+            (Q.updateQueue = b),
+            (b.stores = [a]))
+          : ((c = b.stores), c === null ? (b.stores = [a]) : c.push(a));
+      }
+      function ci(a, b, c, d) {
+        b.value = c;
+        b.getSnapshot = d;
+        ei(b) && Eg(a, 1, -1);
+      }
+      function ai(a, b, c) {
+        return c(function () {
+          ei(b) && Eg(a, 1, -1);
+        });
+      }
+      function ei(a) {
+        var b = a.getSnapshot;
+        a = a.value;
+        try {
+          var c = b();
+          return !Ce(a, c);
+        } catch (d) {
+          return true;
+        }
+      }
+      function fi(a) {
+        var b = Th();
+        typeof a === "function" && (a = a());
+        b.memoizedState = b.baseState = a;
+        a = {
+          pending: null,
+          interleaved: null,
+          lanes: 0,
+          dispatch: null,
+          lastRenderedReducer: Vh,
+          lastRenderedState: a,
+        };
+        b.queue = a;
+        a = a.dispatch = gi.bind(null, Q, a);
+        return [b.memoizedState, a];
+      }
+      function bi(a, b, c, d) {
+        a = { tag: a, create: b, destroy: c, deps: d, next: null };
+        b = Q.updateQueue;
+        b === null
+          ? ((b = { lastEffect: null, stores: null }),
+            (Q.updateQueue = b),
+            (b.lastEffect = a.next = a))
+          : ((c = b.lastEffect),
+            c === null
+              ? (b.lastEffect = a.next = a)
+              : ((d = c.next), (c.next = a), (a.next = d), (b.lastEffect = a)));
+        return a;
+      }
+      function hi() {
+        return Uh().memoizedState;
+      }
+      function ii$1(a, b, c, d) {
+        var e = Th();
+        Q.flags |= a;
+        e.memoizedState = bi(1 | b, c, void 0, d === void 0 ? null : d);
+      }
+      function ji(a, b, c, d) {
+        var e = Uh();
+        d = d === void 0 ? null : d;
+        var f = void 0;
+        if (R !== null) {
+          var g = R.memoizedState;
+          f = g.destroy;
+          if (d !== null && Mh(d, g.deps)) {
+            e.memoizedState = bi(b, c, f, d);
+            return;
+          }
+        }
+        Q.flags |= a;
+        e.memoizedState = bi(1 | b, c, f, d);
+      }
+      function ki(a, b) {
+        return ii$1(8390656, 8, a, b);
+      }
+      function $h(a, b) {
+        return ji(2048, 8, a, b);
+      }
+      function li(a, b) {
+        return ji(4, 2, a, b);
+      }
+      function mi(a, b) {
+        return ji(4, 4, a, b);
+      }
+      function ni$1(a, b) {
+        if (typeof b === "function")
+          return (
+            (a = a()),
+            b(a),
+            function () {
+              b(null);
+            }
+          );
+        if (b !== null && b !== void 0)
+          return (
+            (a = a()),
+            (b.current = a),
+            function () {
+              b.current = null;
+            }
+          );
+      }
+      function oi(a, b, c) {
+        c = c !== null && c !== void 0 ? c.concat([a]) : null;
+        return ji(4, 4, ni$1.bind(null, b, a), c);
+      }
+      function pi$1() {}
+      function qi(a, b) {
+        var c = Uh();
+        b = b === void 0 ? null : b;
+        var d = c.memoizedState;
+        if (d !== null && b !== null && Mh(b, d[1])) return d[0];
+        c.memoizedState = [a, b];
+        return a;
+      }
+      function ri(a, b) {
+        var c = Uh();
+        b = b === void 0 ? null : b;
+        var d = c.memoizedState;
+        if (d !== null && b !== null && Mh(b, d[1])) return d[0];
+        a = a();
+        c.memoizedState = [a, b];
+        return a;
+      }
+      function si(a, b) {
+        var c = E;
+        E = c !== 0 && 4 > c ? c : 4;
+        a(true);
+        var d = Gh.transition;
+        Gh.transition = {};
+        try {
+          a(false), b();
+        } finally {
+          (E = c), (Gh.transition = d);
+        }
+      }
+      function ti() {
+        return Uh().memoizedState;
+      }
+      function ui(a, b, c) {
+        var d = Dg(a);
+        c = {
+          lane: d,
+          action: c,
+          hasEagerState: false,
+          eagerState: null,
+          next: null,
+        };
+        vi(a)
+          ? wi(b, c)
+          : (xi$1(a, b, c),
+            (c = M()),
+            (a = Eg(a, d, c)),
+            a !== null && yi(a, b, d));
+      }
+      function gi(a, b, c) {
+        var d = Dg(a),
+          e = {
+            lane: d,
+            action: c,
+            hasEagerState: false,
+            eagerState: null,
+            next: null,
+          };
+        if (vi(a)) wi(b, e);
+        else {
+          xi$1(a, b, e);
+          var f = a.alternate;
+          if (
+            a.lanes === 0 &&
+            (f === null || f.lanes === 0) &&
+            ((f = b.lastRenderedReducer), f !== null)
+          )
+            try {
+              var g = b.lastRenderedState,
+                h = f(g, c);
+              e.hasEagerState = true;
+              e.eagerState = h;
+              if (Ce(h, g)) return;
+            } catch (k) {
+            } finally {
+            }
+          c = M();
+          a = Eg(a, d, c);
+          a !== null && yi(a, b, d);
+        }
+      }
+      function vi(a) {
+        var b = a.alternate;
+        return a === Q || (b !== null && b === Q);
+      }
+      function wi(a, b) {
+        Jh = Ih = true;
+        var c = a.pending;
+        c === null ? (b.next = b) : ((b.next = c.next), (c.next = b));
+        a.pending = b;
+      }
+      function xi$1(a, b, c) {
+        J !== null && (a.mode & 1) !== 0 && (K & 2) === 0
+          ? ((a = b.interleaved),
+            a === null
+              ? ((c.next = c), qg === null ? (qg = [b]) : qg.push(b))
+              : ((c.next = a.next), (a.next = c)),
+            (b.interleaved = c))
+          : ((a = b.pending),
+            a === null ? (c.next = c) : ((c.next = a.next), (a.next = c)),
+            (b.pending = c));
+      }
+      function yi(a, b, c) {
+        if ((c & 4194240) !== 0) {
+          var d = b.lanes;
+          d &= a.pendingLanes;
+          c |= d;
+          b.lanes = c;
+          yc(a, c);
+        }
+      }
+      var Rh = {
+          readContext: pg,
+          useCallback: U,
+          useContext: U,
+          useEffect: U,
+          useImperativeHandle: U,
+          useInsertionEffect: U,
+          useLayoutEffect: U,
+          useMemo: U,
+          useReducer: U,
+          useRef: U,
+          useState: U,
+          useDebugValue: U,
+          useDeferredValue: U,
+          useTransition: U,
+          useMutableSource: U,
+          useSyncExternalStore: U,
+          useId: U,
+          unstable_isNewReconciler: false,
+        },
+        Oh = {
+          readContext: pg,
+          useCallback: function (a, b) {
+            Th().memoizedState = [a, b === void 0 ? null : b];
+            return a;
+          },
+          useContext: pg,
+          useEffect: ki,
+          useImperativeHandle: function (a, b, c) {
+            c = c !== null && c !== void 0 ? c.concat([a]) : null;
+            return ii$1(4194308, 4, ni$1.bind(null, b, a), c);
+          },
+          useLayoutEffect: function (a, b) {
+            return ii$1(4194308, 4, a, b);
+          },
+          useInsertionEffect: function (a, b) {
+            return ii$1(4, 2, a, b);
+          },
+          useMemo: function (a, b) {
+            var c = Th();
+            b = b === void 0 ? null : b;
+            a = a();
+            c.memoizedState = [a, b];
+            return a;
+          },
+          useReducer: function (a, b, c) {
+            var d = Th();
+            b = c !== void 0 ? c(b) : b;
+            d.memoizedState = d.baseState = b;
+            a = {
+              pending: null,
+              interleaved: null,
+              lanes: 0,
+              dispatch: null,
+              lastRenderedReducer: a,
+              lastRenderedState: b,
+            };
+            d.queue = a;
+            a = a.dispatch = ui.bind(null, Q, a);
+            return [d.memoizedState, a];
+          },
+          useRef: function (a) {
+            var b = Th();
+            a = { current: a };
+            return (b.memoizedState = a);
+          },
+          useState: fi,
+          useDebugValue: pi$1,
+          useDeferredValue: function (a) {
+            var b = fi(a),
+              c = b[0],
+              d = b[1];
+            ki(
+              function () {
+                var b2 = Gh.transition;
+                Gh.transition = {};
+                try {
+                  d(a);
+                } finally {
+                  Gh.transition = b2;
+                }
+              },
+              [a]
+            );
+            return c;
+          },
+          useTransition: function () {
+            var a = fi(false),
+              b = a[0];
+            a = si.bind(null, a[1]);
+            Th().memoizedState = a;
+            return [b, a];
+          },
+          useMutableSource: function () {},
+          useSyncExternalStore: function (a, b, c) {
+            var d = Q,
+              e = Th();
+            if (N) {
+              if (c === void 0) throw Error(p$1(407));
+              c = c();
+            } else {
+              c = b();
+              if (J === null) throw Error(p$1(349));
+              (Hh & 30) !== 0 || di(d, b, c);
+            }
+            e.memoizedState = c;
+            var f = { value: c, getSnapshot: b };
+            e.queue = f;
+            ki(ai.bind(null, d, f, a), [a]);
+            d.flags |= 2048;
+            bi(9, ci.bind(null, d, f, c, b), void 0, null);
+            return c;
+          },
+          useId: function () {
+            var a = Th(),
+              b = J.identifierPrefix;
+            if (N) {
+              var c = Sg;
+              var d = Rg;
+              c = (d & ~(1 << (32 - lc(d) - 1))).toString(32) + c;
+              b = ":" + b + "R" + c;
+              c = Kh++;
+              0 < c && (b += "H" + c.toString(32));
+              b += ":";
+            } else (c = Lh++), (b = ":" + b + "r" + c.toString(32) + ":");
+            return (a.memoizedState = b);
+          },
+          unstable_isNewReconciler: false,
+        },
+        Ph = {
+          readContext: pg,
+          useCallback: qi,
+          useContext: pg,
+          useEffect: $h,
+          useImperativeHandle: oi,
+          useInsertionEffect: li,
+          useLayoutEffect: mi,
+          useMemo: ri,
+          useReducer: Wh,
+          useRef: hi,
+          useState: function () {
+            return Wh(Vh);
+          },
+          useDebugValue: pi$1,
+          useDeferredValue: function (a) {
+            var b = Wh(Vh),
+              c = b[0],
+              d = b[1];
+            $h(
+              function () {
+                var b2 = Gh.transition;
+                Gh.transition = {};
+                try {
+                  d(a);
+                } finally {
+                  Gh.transition = b2;
+                }
+              },
+              [a]
+            );
+            return c;
+          },
+          useTransition: function () {
+            var a = Wh(Vh)[0],
+              b = Uh().memoizedState;
+            return [a, b];
+          },
+          useMutableSource: Yh,
+          useSyncExternalStore: Zh,
+          useId: ti,
+          unstable_isNewReconciler: false,
+        },
+        Qh = {
+          readContext: pg,
+          useCallback: qi,
+          useContext: pg,
+          useEffect: $h,
+          useImperativeHandle: oi,
+          useInsertionEffect: li,
+          useLayoutEffect: mi,
+          useMemo: ri,
+          useReducer: Xh,
+          useRef: hi,
+          useState: function () {
+            return Xh(Vh);
+          },
+          useDebugValue: pi$1,
+          useDeferredValue: function (a) {
+            var b = Xh(Vh),
+              c = b[0],
+              d = b[1];
+            $h(
+              function () {
+                var b2 = Gh.transition;
+                Gh.transition = {};
+                try {
+                  d(a);
+                } finally {
+                  Gh.transition = b2;
+                }
+              },
+              [a]
+            );
+            return c;
+          },
+          useTransition: function () {
+            var a = Xh(Vh)[0],
+              b = Uh().memoizedState;
+            return [a, b];
+          },
+          useMutableSource: Yh,
+          useSyncExternalStore: Zh,
+          useId: ti,
+          unstable_isNewReconciler: false,
+        };
+      function zi(a, b) {
+        try {
+          var c = "",
+            d = b;
+          do (c += Na(d)), (d = d.return);
+          while (d);
+          var e = c;
+        } catch (f) {
+          e = "\nError generating stack: " + f.message + "\n" + f.stack;
+        }
+        return { value: a, source: b, stack: e };
+      }
+      function Ai(a, b) {
+        try {
+          console.error(b.value);
+        } catch (c) {
+          setTimeout(function () {
+            throw c;
+          });
+        }
+      }
+      var Bi = typeof WeakMap === "function" ? WeakMap : Map;
+      function Ci(a, b, c) {
+        c = ug(-1, c);
+        c.tag = 3;
+        c.payload = { element: null };
+        var d = b.value;
+        c.callback = function () {
+          Di || ((Di = true), (Ei = d));
+          Ai(a, b);
+        };
+        return c;
+      }
+      function Fi(a, b, c) {
+        c = ug(-1, c);
+        c.tag = 3;
+        var d = a.type.getDerivedStateFromError;
+        if (typeof d === "function") {
+          var e = b.value;
+          c.payload = function () {
+            return d(e);
+          };
+          c.callback = function () {
+            Ai(a, b);
+          };
+        }
+        var f = a.stateNode;
+        f !== null &&
+          typeof f.componentDidCatch === "function" &&
+          (c.callback = function () {
+            Ai(a, b);
+            typeof d !== "function" &&
+              (Gi === null
+                ? (Gi = /* @__PURE__ */ new Set([this]))
+                : Gi.add(this));
+            var c2 = b.stack;
+            this.componentDidCatch(b.value, {
+              componentStack: c2 !== null ? c2 : "",
+            });
+          });
+        return c;
+      }
+      function Hi(a, b, c) {
+        var d = a.pingCache;
+        if (d === null) {
+          d = a.pingCache = new Bi();
+          var e = /* @__PURE__ */ new Set();
+          d.set(b, e);
+        } else
+          (e = d.get(b)),
+            e === void 0 && ((e = /* @__PURE__ */ new Set()), d.set(b, e));
+        e.has(c) || (e.add(c), (a = Ii.bind(null, a, b, c)), b.then(a, a));
+      }
+      function Ji(a) {
+        do {
+          var b;
+          if ((b = a.tag === 13))
+            (b = a.memoizedState),
+              (b = b !== null ? (b.dehydrated !== null ? true : false) : true);
+          if (b) return a;
+          a = a.return;
+        } while (a !== null);
+        return null;
+      }
+      function Ki(a, b, c, d, e) {
+        if ((a.mode & 1) === 0)
+          return (
+            a === b
+              ? (a.flags |= 65536)
+              : ((a.flags |= 128),
+                (c.flags |= 131072),
+                (c.flags &= -52805),
+                c.tag === 1 &&
+                  (c.alternate === null
+                    ? (c.tag = 17)
+                    : ((b = ug(-1, 1)), (b.tag = 2), vg(c, b))),
+                (c.lanes |= 1)),
+            a
+          );
+        a.flags |= 65536;
+        a.lanes = e;
+        return a;
+      }
+      var Li, Mi, Ni, Oi;
+      Li = function (a, b) {
+        for (var c = b.child; c !== null; ) {
+          if (c.tag === 5 || c.tag === 6) a.appendChild(c.stateNode);
+          else if (c.tag !== 4 && c.child !== null) {
+            c.child.return = c;
+            c = c.child;
+            continue;
+          }
+          if (c === b) break;
+          for (; c.sibling === null; ) {
+            if (c.return === null || c.return === b) return;
+            c = c.return;
+          }
+          c.sibling.return = c.return;
+          c = c.sibling;
+        }
+      };
+      Mi = function () {};
+      Ni = function (a, b, c, d) {
+        var e = a.memoizedProps;
+        if (e !== d) {
+          a = b.stateNode;
+          xh(uh.current);
+          var f = null;
+          switch (c) {
+            case "input":
+              e = Wa(a, e);
+              d = Wa(a, d);
+              f = [];
+              break;
+            case "select":
+              e = A({}, e, { value: void 0 });
+              d = A({}, d, { value: void 0 });
+              f = [];
+              break;
+            case "textarea":
+              e = db(a, e);
+              d = db(a, d);
+              f = [];
+              break;
+            default:
+              typeof e.onClick !== "function" &&
+                typeof d.onClick === "function" &&
+                (a.onclick = wf);
+          }
+          rb(c, d);
+          var g;
+          c = null;
+          for (l2 in e)
+            if (!d.hasOwnProperty(l2) && e.hasOwnProperty(l2) && e[l2] != null)
+              if (l2 === "style") {
+                var h = e[l2];
+                for (g in h)
+                  h.hasOwnProperty(g) && (c || (c = {}), (c[g] = ""));
+              } else
+                l2 !== "dangerouslySetInnerHTML" &&
+                  l2 !== "children" &&
+                  l2 !== "suppressContentEditableWarning" &&
+                  l2 !== "suppressHydrationWarning" &&
+                  l2 !== "autoFocus" &&
+                  (da.hasOwnProperty(l2)
+                    ? f || (f = [])
+                    : (f = f || []).push(l2, null));
+          for (l2 in d) {
+            var k = d[l2];
+            h = e != null ? e[l2] : void 0;
+            if (d.hasOwnProperty(l2) && k !== h && (k != null || h != null))
+              if (l2 === "style")
+                if (h) {
+                  for (g in h)
+                    !h.hasOwnProperty(g) ||
+                      (k && k.hasOwnProperty(g)) ||
+                      (c || (c = {}), (c[g] = ""));
+                  for (g in k)
+                    k.hasOwnProperty(g) &&
+                      h[g] !== k[g] &&
+                      (c || (c = {}), (c[g] = k[g]));
+                } else c || (f || (f = []), f.push(l2, c)), (c = k);
+              else
+                l2 === "dangerouslySetInnerHTML"
+                  ? ((k = k ? k.__html : void 0),
+                    (h = h ? h.__html : void 0),
+                    k != null && h !== k && (f = f || []).push(l2, k))
+                  : l2 === "children"
+                  ? (typeof k !== "string" && typeof k !== "number") ||
+                    (f = f || []).push(l2, "" + k)
+                  : l2 !== "suppressContentEditableWarning" &&
+                    l2 !== "suppressHydrationWarning" &&
+                    (da.hasOwnProperty(l2)
+                      ? (k != null && l2 === "onScroll" && F("scroll", a),
+                        f || h === k || (f = []))
+                      : (f = f || []).push(l2, k));
+          }
+          c && (f = f || []).push("style", c);
+          var l2 = f;
+          if ((b.updateQueue = l2)) b.flags |= 4;
+        }
+      };
+      Oi = function (a, b, c, d) {
+        c !== d && (b.flags |= 4);
+      };
+      function Pi$1(a, b) {
+        if (!N)
+          switch (a.tailMode) {
+            case "hidden":
+              b = a.tail;
+              for (var c = null; b !== null; )
+                b.alternate !== null && (c = b), (b = b.sibling);
+              c === null ? (a.tail = null) : (c.sibling = null);
+              break;
+            case "collapsed":
+              c = a.tail;
+              for (var d = null; c !== null; )
+                c.alternate !== null && (d = c), (c = c.sibling);
+              d === null
+                ? b || a.tail === null
+                  ? (a.tail = null)
+                  : (a.tail.sibling = null)
+                : (d.sibling = null);
+          }
+      }
+      function V(a) {
+        var b = a.alternate !== null && a.alternate.child === a.child,
+          c = 0,
+          d = 0;
+        if (b)
+          for (var e = a.child; e !== null; )
+            (c |= e.lanes | e.childLanes),
+              (d |= e.subtreeFlags & 14680064),
+              (d |= e.flags & 14680064),
+              (e.return = a),
+              (e = e.sibling);
+        else
+          for (e = a.child; e !== null; )
+            (c |= e.lanes | e.childLanes),
+              (d |= e.subtreeFlags),
+              (d |= e.flags),
+              (e.return = a),
+              (e = e.sibling);
+        a.subtreeFlags |= d;
+        a.childLanes = c;
+        return b;
+      }
+      function Qi(a, b, c) {
+        var d = b.pendingProps;
+        Wg(b);
+        switch (b.tag) {
+          case 2:
+          case 16:
+          case 15:
+          case 0:
+          case 11:
+          case 7:
+          case 8:
+          case 12:
+          case 9:
+          case 14:
+            return V(b), null;
+          case 1:
+            return Tf(b.type) && Uf(), V(b), null;
+          case 3:
+            d = b.stateNode;
+            zh();
+            G(Qf);
+            G(I);
+            Eh();
+            d.pendingContext &&
+              ((d.context = d.pendingContext), (d.pendingContext = null));
+            if (a === null || a.child === null)
+              fh(b)
+                ? (b.flags |= 4)
+                : a === null ||
+                  (a.memoizedState.isDehydrated && (b.flags & 256) === 0) ||
+                  ((b.flags |= 1024), Zg !== null && (Ri(Zg), (Zg = null)));
+            Mi(a, b);
+            V(b);
+            return null;
+          case 5:
+            Bh(b);
+            var e = xh(wh.current);
+            c = b.type;
+            if (a !== null && b.stateNode != null)
+              Ni(a, b, c, d, e),
+                a.ref !== b.ref && ((b.flags |= 512), (b.flags |= 2097152));
+            else {
+              if (!d) {
+                if (b.stateNode === null) throw Error(p$1(166));
+                V(b);
+                return null;
+              }
+              a = xh(uh.current);
+              if (fh(b)) {
+                d = b.stateNode;
+                c = b.type;
+                var f = b.memoizedProps;
+                d[If] = b;
+                d[Jf] = f;
+                a = (b.mode & 1) !== 0;
+                switch (c) {
+                  case "dialog":
+                    F("cancel", d);
+                    F("close", d);
+                    break;
+                  case "iframe":
+                  case "object":
+                  case "embed":
+                    F("load", d);
+                    break;
+                  case "video":
+                  case "audio":
+                    for (e = 0; e < ff.length; e++) F(ff[e], d);
+                    break;
+                  case "source":
+                    F("error", d);
+                    break;
+                  case "img":
+                  case "image":
+                  case "link":
+                    F("error", d);
+                    F("load", d);
+                    break;
+                  case "details":
+                    F("toggle", d);
+                    break;
+                  case "input":
+                    Xa(d, f);
+                    F("invalid", d);
+                    break;
+                  case "select":
+                    d._wrapperState = { wasMultiple: !!f.multiple };
+                    F("invalid", d);
+                    break;
+                  case "textarea":
+                    eb(d, f), F("invalid", d);
+                }
+                rb(c, f);
+                e = null;
+                for (var g in f)
+                  if (f.hasOwnProperty(g)) {
+                    var h = f[g];
+                    g === "children"
+                      ? typeof h === "string"
+                        ? d.textContent !== h &&
+                          (vf(d.textContent, h, a), (e = ["children", h]))
+                        : typeof h === "number" &&
+                          d.textContent !== "" + h &&
+                          (vf(d.textContent, h, a), (e = ["children", "" + h]))
+                      : da.hasOwnProperty(g) &&
+                        h != null &&
+                        g === "onScroll" &&
+                        F("scroll", d);
+                  }
+                switch (c) {
+                  case "input":
+                    Ta(d);
+                    ab(d, f, true);
+                    break;
+                  case "textarea":
+                    Ta(d);
+                    gb(d);
+                    break;
+                  case "select":
+                  case "option":
+                    break;
+                  default:
+                    typeof f.onClick === "function" && (d.onclick = wf);
+                }
+                d = e;
+                b.updateQueue = d;
+                d !== null && (b.flags |= 4);
+              } else {
+                g = e.nodeType === 9 ? e : e.ownerDocument;
+                a === "http://www.w3.org/1999/xhtml" && (a = hb(c));
+                a === "http://www.w3.org/1999/xhtml"
+                  ? c === "script"
+                    ? ((a = g.createElement("div")),
+                      (a.innerHTML = "<script><\/script>"),
+                      (a = a.removeChild(a.firstChild)))
+                    : typeof d.is === "string"
+                    ? (a = g.createElement(c, { is: d.is }))
+                    : ((a = g.createElement(c)),
+                      c === "select" &&
+                        ((g = a),
+                        d.multiple
+                          ? (g.multiple = true)
+                          : d.size && (g.size = d.size)))
+                  : (a = g.createElementNS(a, c));
+                a[If] = b;
+                a[Jf] = d;
+                Li(a, b, false, false);
+                b.stateNode = a;
+                a: {
+                  g = sb(c, d);
+                  switch (c) {
+                    case "dialog":
+                      F("cancel", a);
+                      F("close", a);
+                      e = d;
+                      break;
+                    case "iframe":
+                    case "object":
+                    case "embed":
+                      F("load", a);
+                      e = d;
+                      break;
+                    case "video":
+                    case "audio":
+                      for (e = 0; e < ff.length; e++) F(ff[e], a);
+                      e = d;
+                      break;
+                    case "source":
+                      F("error", a);
+                      e = d;
+                      break;
+                    case "img":
+                    case "image":
+                    case "link":
+                      F("error", a);
+                      F("load", a);
+                      e = d;
+                      break;
+                    case "details":
+                      F("toggle", a);
+                      e = d;
+                      break;
+                    case "input":
+                      Xa(a, d);
+                      e = Wa(a, d);
+                      F("invalid", a);
+                      break;
+                    case "option":
+                      e = d;
+                      break;
+                    case "select":
+                      a._wrapperState = { wasMultiple: !!d.multiple };
+                      e = A({}, d, { value: void 0 });
+                      F("invalid", a);
+                      break;
+                    case "textarea":
+                      eb(a, d);
+                      e = db(a, d);
+                      F("invalid", a);
+                      break;
+                    default:
+                      e = d;
+                  }
+                  rb(c, e);
+                  h = e;
+                  for (f in h)
+                    if (h.hasOwnProperty(f)) {
+                      var k = h[f];
+                      f === "style"
+                        ? pb(a, k)
+                        : f === "dangerouslySetInnerHTML"
+                        ? ((k = k ? k.__html : void 0), k != null && kb(a, k))
+                        : f === "children"
+                        ? typeof k === "string"
+                          ? (c !== "textarea" || k !== "") && lb(a, k)
+                          : typeof k === "number" && lb(a, "" + k)
+                        : f !== "suppressContentEditableWarning" &&
+                          f !== "suppressHydrationWarning" &&
+                          f !== "autoFocus" &&
+                          (da.hasOwnProperty(f)
+                            ? k != null && f === "onScroll" && F("scroll", a)
+                            : k != null && ra(a, f, k, g));
+                    }
+                  switch (c) {
+                    case "input":
+                      Ta(a);
+                      ab(a, d, false);
+                      break;
+                    case "textarea":
+                      Ta(a);
+                      gb(a);
+                      break;
+                    case "option":
+                      d.value != null &&
+                        a.setAttribute("value", "" + Qa(d.value));
+                      break;
+                    case "select":
+                      a.multiple = !!d.multiple;
+                      f = d.value;
+                      f != null
+                        ? cb(a, !!d.multiple, f, false)
+                        : d.defaultValue != null &&
+                          cb(a, !!d.multiple, d.defaultValue, true);
+                      break;
+                    default:
+                      typeof e.onClick === "function" && (a.onclick = wf);
+                  }
+                  switch (c) {
+                    case "button":
+                    case "input":
+                    case "select":
+                    case "textarea":
+                      d = !!d.autoFocus;
+                      break a;
+                    case "img":
+                      d = true;
+                      break a;
+                    default:
+                      d = false;
+                  }
+                }
+                d && (b.flags |= 4);
+              }
+              b.ref !== null && ((b.flags |= 512), (b.flags |= 2097152));
+            }
+            V(b);
+            return null;
+          case 6:
+            if (a && b.stateNode != null) Oi(a, b, a.memoizedProps, d);
+            else {
+              if (typeof d !== "string" && b.stateNode === null)
+                throw Error(p$1(166));
+              c = xh(wh.current);
+              xh(uh.current);
+              if (fh(b)) {
+                d = b.stateNode;
+                c = b.memoizedProps;
+                d[If] = b;
+                if ((f = d.nodeValue !== c)) {
+                  if (((a = Xg), a !== null))
+                    switch (((g = (a.mode & 1) !== 0), a.tag)) {
+                      case 3:
+                        vf(d.nodeValue, c, g);
+                        break;
+                      case 5:
+                        a.memoizedProps[void 0] !== true &&
+                          vf(d.nodeValue, c, g);
+                    }
+                }
+                f && (b.flags |= 4);
+              } else
+                (d = (c.nodeType === 9 ? c : c.ownerDocument).createTextNode(
+                  d
+                )),
+                  (d[If] = b),
+                  (b.stateNode = d);
+            }
+            V(b);
+            return null;
+          case 13:
+            G(P);
+            d = b.memoizedState;
+            if (
+              N &&
+              Yg !== null &&
+              (b.mode & 1) !== 0 &&
+              (b.flags & 128) === 0
+            ) {
+              for (d = Yg; d; ) d = Ff(d.nextSibling);
+              gh();
+              b.flags |= 98560;
+              return b;
+            }
+            if (d !== null && d.dehydrated !== null) {
+              d = fh(b);
+              if (a === null) {
+                if (!d) throw Error(p$1(318));
+                d = b.memoizedState;
+                d = d !== null ? d.dehydrated : null;
+                if (!d) throw Error(p$1(317));
+                d[If] = b;
+              } else
+                gh(),
+                  (b.flags & 128) === 0 && (b.memoizedState = null),
+                  (b.flags |= 4);
+              V(b);
+              return null;
+            }
+            Zg !== null && (Ri(Zg), (Zg = null));
+            if ((b.flags & 128) !== 0) return (b.lanes = c), b;
+            d = d !== null;
+            c = false;
+            a === null ? fh(b) : (c = a.memoizedState !== null);
+            d &&
+              !c &&
+              ((b.child.flags |= 8192),
+              (b.mode & 1) !== 0 &&
+                (a === null || (P.current & 1) !== 0
+                  ? W === 0 && (W = 3)
+                  : Si()));
+            b.updateQueue !== null && (b.flags |= 4);
+            V(b);
+            return null;
+          case 4:
+            return (
+              zh(),
+              Mi(a, b),
+              a === null && nf(b.stateNode.containerInfo),
+              V(b),
+              null
+            );
+          case 10:
+            return lg$1(b.type._context), V(b), null;
+          case 17:
+            return Tf(b.type) && Uf(), V(b), null;
+          case 19:
+            G(P);
+            f = b.memoizedState;
+            if (f === null) return V(b), null;
+            d = (b.flags & 128) !== 0;
+            g = f.rendering;
+            if (g === null)
+              if (d) Pi$1(f, false);
+              else {
+                if (W !== 0 || (a !== null && (a.flags & 128) !== 0))
+                  for (a = b.child; a !== null; ) {
+                    g = Ch(a);
+                    if (g !== null) {
+                      b.flags |= 128;
+                      Pi$1(f, false);
+                      d = g.updateQueue;
+                      d !== null && ((b.updateQueue = d), (b.flags |= 4));
+                      b.subtreeFlags = 0;
+                      d = c;
+                      for (c = b.child; c !== null; )
+                        (f = c),
+                          (a = d),
+                          (f.flags &= 14680066),
+                          (g = f.alternate),
+                          g === null
+                            ? ((f.childLanes = 0),
+                              (f.lanes = a),
+                              (f.child = null),
+                              (f.subtreeFlags = 0),
+                              (f.memoizedProps = null),
+                              (f.memoizedState = null),
+                              (f.updateQueue = null),
+                              (f.dependencies = null),
+                              (f.stateNode = null))
+                            : ((f.childLanes = g.childLanes),
+                              (f.lanes = g.lanes),
+                              (f.child = g.child),
+                              (f.subtreeFlags = 0),
+                              (f.deletions = null),
+                              (f.memoizedProps = g.memoizedProps),
+                              (f.memoizedState = g.memoizedState),
+                              (f.updateQueue = g.updateQueue),
+                              (f.type = g.type),
+                              (a = g.dependencies),
+                              (f.dependencies =
+                                a === null
+                                  ? null
+                                  : {
+                                      lanes: a.lanes,
+                                      firstContext: a.firstContext,
+                                    })),
+                          (c = c.sibling);
+                      H(P, (P.current & 1) | 2);
+                      return b.child;
+                    }
+                    a = a.sibling;
+                  }
+                f.tail !== null &&
+                  D() > Ti &&
+                  ((b.flags |= 128),
+                  (d = true),
+                  Pi$1(f, false),
+                  (b.lanes = 4194304));
+              }
+            else {
+              if (!d)
+                if (((a = Ch(g)), a !== null)) {
+                  if (
+                    ((b.flags |= 128),
+                    (d = true),
+                    (c = a.updateQueue),
+                    c !== null && ((b.updateQueue = c), (b.flags |= 4)),
+                    Pi$1(f, true),
+                    f.tail === null &&
+                      f.tailMode === "hidden" &&
+                      !g.alternate &&
+                      !N)
+                  )
+                    return V(b), null;
+                } else
+                  2 * D() - f.renderingStartTime > Ti &&
+                    c !== 1073741824 &&
+                    ((b.flags |= 128),
+                    (d = true),
+                    Pi$1(f, false),
+                    (b.lanes = 4194304));
+              f.isBackwards
+                ? ((g.sibling = b.child), (b.child = g))
+                : ((c = f.last),
+                  c !== null ? (c.sibling = g) : (b.child = g),
+                  (f.last = g));
+            }
+            if (f.tail !== null)
+              return (
+                (b = f.tail),
+                (f.rendering = b),
+                (f.tail = b.sibling),
+                (f.renderingStartTime = D()),
+                (b.sibling = null),
+                (c = P.current),
+                H(P, d ? (c & 1) | 2 : c & 1),
+                b
+              );
+            V(b);
+            return null;
+          case 22:
+          case 23:
+            return (
+              Ui(),
+              (d = b.memoizedState !== null),
+              a !== null &&
+                (a.memoizedState !== null) !== d &&
+                (b.flags |= 8192),
+              d && (b.mode & 1) !== 0
+                ? (Vi & 1073741824) !== 0 &&
+                  (V(b), b.subtreeFlags & 6 && (b.flags |= 8192))
+                : V(b),
+              null
+            );
+          case 24:
+            return null;
+          case 25:
+            return null;
+        }
+        throw Error(p$1(156, b.tag));
+      }
+      var Wi = sa.ReactCurrentOwner,
+        og = false;
+      function Xi$1(a, b, c, d) {
+        b.child = a === null ? sh(b, null, c, d) : rh(b, a.child, c, d);
+      }
+      function Yi(a, b, c, d, e) {
+        c = c.render;
+        var f = b.ref;
+        ng(b, e);
+        d = Nh(a, b, c, d, f, e);
+        c = Sh();
+        if (a !== null && !og)
+          return (
+            (b.updateQueue = a.updateQueue),
+            (b.flags &= -2053),
+            (a.lanes &= ~e),
+            Zi(a, b, e)
+          );
+        N && c && Vg(b);
+        b.flags |= 1;
+        Xi$1(a, b, d, e);
+        return b.child;
+      }
+      function $i(a, b, c, d, e) {
+        if (a === null) {
+          var f = c.type;
+          if (
+            typeof f === "function" &&
+            !aj(f) &&
+            f.defaultProps === void 0 &&
+            c.compare === null &&
+            c.defaultProps === void 0
+          )
+            return (b.tag = 15), (b.type = f), bj(a, b, f, d, e);
+          a = oh(c.type, null, d, b, b.mode, e);
+          a.ref = b.ref;
+          a.return = b;
+          return (b.child = a);
+        }
+        f = a.child;
+        if ((a.lanes & e) === 0) {
+          var g = f.memoizedProps;
+          c = c.compare;
+          c = c !== null ? c : De;
+          if (c(g, d) && a.ref === b.ref) return Zi(a, b, e);
+        }
+        b.flags |= 1;
+        a = mh(f, d);
+        a.ref = b.ref;
+        a.return = b;
+        return (b.child = a);
+      }
+      function bj(a, b, c, d, e) {
+        if (a !== null && De(a.memoizedProps, d) && a.ref === b.ref)
+          if (((og = false), (a.lanes & e) !== 0))
+            (a.flags & 131072) !== 0 && (og = true);
+          else return (b.lanes = a.lanes), Zi(a, b, e);
+        return cj(a, b, c, d, e);
+      }
+      function dj(a, b, c) {
+        var d = b.pendingProps,
+          e = d.children,
+          f = a !== null ? a.memoizedState : null;
+        if (d.mode === "hidden")
+          if ((b.mode & 1) === 0)
+            (b.memoizedState = { baseLanes: 0, cachePool: null }),
+              H(ej, Vi),
+              (Vi |= c);
+          else if ((c & 1073741824) !== 0)
+            (b.memoizedState = { baseLanes: 0, cachePool: null }),
+              (d = f !== null ? f.baseLanes : c),
+              H(ej, Vi),
+              (Vi |= d);
+          else
+            return (
+              (a = f !== null ? f.baseLanes | c : c),
+              (b.lanes = b.childLanes = 1073741824),
+              (b.memoizedState = { baseLanes: a, cachePool: null }),
+              (b.updateQueue = null),
+              H(ej, Vi),
+              (Vi |= a),
+              null
+            );
+        else
+          f !== null
+            ? ((d = f.baseLanes | c), (b.memoizedState = null))
+            : (d = c),
+            H(ej, Vi),
+            (Vi |= d);
+        Xi$1(a, b, e, c);
+        return b.child;
+      }
+      function fj(a, b) {
+        var c = b.ref;
+        if ((a === null && c !== null) || (a !== null && a.ref !== c))
+          (b.flags |= 512), (b.flags |= 2097152);
+      }
+      function cj(a, b, c, d, e) {
+        var f = Tf(c) ? Rf : I.current;
+        f = Sf(b, f);
+        ng(b, e);
+        c = Nh(a, b, c, d, f, e);
+        d = Sh();
+        if (a !== null && !og)
+          return (
+            (b.updateQueue = a.updateQueue),
+            (b.flags &= -2053),
+            (a.lanes &= ~e),
+            Zi(a, b, e)
+          );
+        N && d && Vg(b);
+        b.flags |= 1;
+        Xi$1(a, b, c, e);
+        return b.child;
+      }
+      function gj(a, b, c, d, e) {
+        if (Tf(c)) {
+          var f = true;
+          Xf(b);
+        } else f = false;
+        ng(b, e);
+        if (b.stateNode === null)
+          a !== null &&
+            ((a.alternate = null), (b.alternate = null), (b.flags |= 2)),
+            Hg(b, c, d),
+            Jg(b, c, d, e),
+            (d = true);
+        else if (a === null) {
+          var g = b.stateNode,
+            h = b.memoizedProps;
+          g.props = h;
+          var k = g.context,
+            l2 = c.contextType;
+          typeof l2 === "object" && l2 !== null
+            ? (l2 = pg(l2))
+            : ((l2 = Tf(c) ? Rf : I.current), (l2 = Sf(b, l2)));
+          var m = c.getDerivedStateFromProps,
+            w2 =
+              typeof m === "function" ||
+              typeof g.getSnapshotBeforeUpdate === "function";
+          w2 ||
+            (typeof g.UNSAFE_componentWillReceiveProps !== "function" &&
+              typeof g.componentWillReceiveProps !== "function") ||
+            ((h !== d || k !== l2) && Ig(b, g, d, l2));
+          rg = false;
+          var u2 = b.memoizedState;
+          g.state = u2;
+          yg(b, d, g, e);
+          k = b.memoizedState;
+          h !== d || u2 !== k || Qf.current || rg
+            ? (typeof m === "function" &&
+                (Cg(b, c, m, d), (k = b.memoizedState)),
+              (h = rg || Gg$1(b, c, h, d, u2, k, l2))
+                ? (w2 ||
+                    (typeof g.UNSAFE_componentWillMount !== "function" &&
+                      typeof g.componentWillMount !== "function") ||
+                    (typeof g.componentWillMount === "function" &&
+                      g.componentWillMount(),
+                    typeof g.UNSAFE_componentWillMount === "function" &&
+                      g.UNSAFE_componentWillMount()),
+                  typeof g.componentDidMount === "function" &&
+                    (b.flags |= 4194308))
+                : (typeof g.componentDidMount === "function" &&
+                    (b.flags |= 4194308),
+                  (b.memoizedProps = d),
+                  (b.memoizedState = k)),
+              (g.props = d),
+              (g.state = k),
+              (g.context = l2),
+              (d = h))
+            : (typeof g.componentDidMount === "function" &&
+                (b.flags |= 4194308),
+              (d = false));
+        } else {
+          g = b.stateNode;
+          tg(a, b);
+          h = b.memoizedProps;
+          l2 = b.type === b.elementType ? h : fg(b.type, h);
+          g.props = l2;
+          w2 = b.pendingProps;
+          u2 = g.context;
+          k = c.contextType;
+          typeof k === "object" && k !== null
+            ? (k = pg(k))
+            : ((k = Tf(c) ? Rf : I.current), (k = Sf(b, k)));
+          var y2 = c.getDerivedStateFromProps;
+          (m =
+            typeof y2 === "function" ||
+            typeof g.getSnapshotBeforeUpdate === "function") ||
+            (typeof g.UNSAFE_componentWillReceiveProps !== "function" &&
+              typeof g.componentWillReceiveProps !== "function") ||
+            ((h !== w2 || u2 !== k) && Ig(b, g, d, k));
+          rg = false;
+          u2 = b.memoizedState;
+          g.state = u2;
+          yg(b, d, g, e);
+          var n2 = b.memoizedState;
+          h !== w2 || u2 !== n2 || Qf.current || rg
+            ? (typeof y2 === "function" &&
+                (Cg(b, c, y2, d), (n2 = b.memoizedState)),
+              (l2 = rg || Gg$1(b, c, l2, d, u2, n2, k) || false)
+                ? (m ||
+                    (typeof g.UNSAFE_componentWillUpdate !== "function" &&
+                      typeof g.componentWillUpdate !== "function") ||
+                    (typeof g.componentWillUpdate === "function" &&
+                      g.componentWillUpdate(d, n2, k),
+                    typeof g.UNSAFE_componentWillUpdate === "function" &&
+                      g.UNSAFE_componentWillUpdate(d, n2, k)),
+                  typeof g.componentDidUpdate === "function" && (b.flags |= 4),
+                  typeof g.getSnapshotBeforeUpdate === "function" &&
+                    (b.flags |= 1024))
+                : (typeof g.componentDidUpdate !== "function" ||
+                    (h === a.memoizedProps && u2 === a.memoizedState) ||
+                    (b.flags |= 4),
+                  typeof g.getSnapshotBeforeUpdate !== "function" ||
+                    (h === a.memoizedProps && u2 === a.memoizedState) ||
+                    (b.flags |= 1024),
+                  (b.memoizedProps = d),
+                  (b.memoizedState = n2)),
+              (g.props = d),
+              (g.state = n2),
+              (g.context = k),
+              (d = l2))
+            : (typeof g.componentDidUpdate !== "function" ||
+                (h === a.memoizedProps && u2 === a.memoizedState) ||
+                (b.flags |= 4),
+              typeof g.getSnapshotBeforeUpdate !== "function" ||
+                (h === a.memoizedProps && u2 === a.memoizedState) ||
+                (b.flags |= 1024),
+              (d = false));
+        }
+        return hj(a, b, c, d, f, e);
+      }
+      function hj(a, b, c, d, e, f) {
+        fj(a, b);
+        var g = (b.flags & 128) !== 0;
+        if (!d && !g) return e && Yf(b, c, false), Zi(a, b, f);
+        d = b.stateNode;
+        Wi.current = b;
+        var h =
+          g && typeof c.getDerivedStateFromError !== "function"
+            ? null
+            : d.render();
+        b.flags |= 1;
+        a !== null && g
+          ? ((b.child = rh(b, a.child, null, f)), (b.child = rh(b, null, h, f)))
+          : Xi$1(a, b, h, f);
+        b.memoizedState = d.state;
+        e && Yf(b, c, true);
+        return b.child;
+      }
+      function ij(a) {
+        var b = a.stateNode;
+        b.pendingContext
+          ? Vf(a, b.pendingContext, b.pendingContext !== b.context)
+          : b.context && Vf(a, b.context, false);
+        yh(a, b.containerInfo);
+      }
+      function jj(a, b, c, d, e) {
+        gh();
+        hh(e);
+        b.flags |= 256;
+        Xi$1(a, b, c, d);
+        return b.child;
+      }
+      var kj = { dehydrated: null, treeContext: null, retryLane: 0 };
+      function lj(a) {
+        return { baseLanes: a, cachePool: null };
+      }
+      function mj(a, b, c) {
+        var d = b.pendingProps,
+          e = P.current,
+          f = false,
+          g = (b.flags & 128) !== 0,
+          h;
+        (h = g) ||
+          (h = a !== null && a.memoizedState === null ? false : (e & 2) !== 0);
+        if (h) (f = true), (b.flags &= -129);
+        else if (a === null || a.memoizedState !== null) e |= 1;
+        H(P, e & 1);
+        if (a === null) {
+          dh(b);
+          a = b.memoizedState;
+          if (a !== null && ((a = a.dehydrated), a !== null))
+            return (
+              (b.mode & 1) === 0
+                ? (b.lanes = 1)
+                : a.data === "$!"
+                ? (b.lanes = 8)
+                : (b.lanes = 1073741824),
+              null
+            );
+          e = d.children;
+          a = d.fallback;
+          return f
+            ? ((d = b.mode),
+              (f = b.child),
+              (e = { mode: "hidden", children: e }),
+              (d & 1) === 0 && f !== null
+                ? ((f.childLanes = 0), (f.pendingProps = e))
+                : (f = nj(e, d, 0, null)),
+              (a = qh(a, d, c, null)),
+              (f.return = b),
+              (a.return = b),
+              (f.sibling = a),
+              (b.child = f),
+              (b.child.memoizedState = lj(c)),
+              (b.memoizedState = kj),
+              a)
+            : oj(b, e);
+        }
+        e = a.memoizedState;
+        if (e !== null) {
+          h = e.dehydrated;
+          if (h !== null) {
+            if (g) {
+              if (b.flags & 256)
+                return (b.flags &= -257), pj(a, b, c, Error(p$1(422)));
+              if (b.memoizedState !== null)
+                return (b.child = a.child), (b.flags |= 128), null;
+              f = d.fallback;
+              e = b.mode;
+              d = nj({ mode: "visible", children: d.children }, e, 0, null);
+              f = qh(f, e, c, null);
+              f.flags |= 2;
+              d.return = b;
+              f.return = b;
+              d.sibling = f;
+              b.child = d;
+              (b.mode & 1) !== 0 && rh(b, a.child, null, c);
+              b.child.memoizedState = lj(c);
+              b.memoizedState = kj;
+              return f;
+            }
+            if ((b.mode & 1) === 0) b = pj(a, b, c, null);
+            else if (h.data === "$!") b = pj(a, b, c, Error(p$1(419)));
+            else if (((d = (c & a.childLanes) !== 0), og || d)) {
+              d = J;
+              if (d !== null) {
+                switch (c & -c) {
+                  case 4:
+                    f = 2;
+                    break;
+                  case 16:
+                    f = 8;
+                    break;
+                  case 64:
+                  case 128:
+                  case 256:
+                  case 512:
+                  case 1024:
+                  case 2048:
+                  case 4096:
+                  case 8192:
+                  case 16384:
+                  case 32768:
+                  case 65536:
+                  case 131072:
+                  case 262144:
+                  case 524288:
+                  case 1048576:
+                  case 2097152:
+                  case 4194304:
+                  case 8388608:
+                  case 16777216:
+                  case 33554432:
+                  case 67108864:
+                    f = 32;
+                    break;
+                  case 536870912:
+                    f = 268435456;
+                    break;
+                  default:
+                    f = 0;
+                }
+                d = (f & (d.suspendedLanes | c)) !== 0 ? 0 : f;
+                d !== 0 &&
+                  d !== e.retryLane &&
+                  ((e.retryLane = d), Eg(a, d, -1));
+              }
+              Si();
+              b = pj(a, b, c, Error(p$1(421)));
+            } else
+              h.data === "$?"
+                ? ((b.flags |= 128),
+                  (b.child = a.child),
+                  (b = qj.bind(null, a)),
+                  (h._reactRetry = b),
+                  (b = null))
+                : ((c = e.treeContext),
+                  (Yg = Ff(h.nextSibling)),
+                  (Xg = b),
+                  (N = true),
+                  (Zg = null),
+                  c !== null &&
+                    ((Og[Pg++] = Rg),
+                    (Og[Pg++] = Sg),
+                    (Og[Pg++] = Qg),
+                    (Rg = c.id),
+                    (Sg = c.overflow),
+                    (Qg = b)),
+                  (b = oj(b, b.pendingProps.children)),
+                  (b.flags |= 4096));
+            return b;
+          }
+          if (f)
+            return (
+              (d = rj(a, b, d.children, d.fallback, c)),
+              (f = b.child),
+              (e = a.child.memoizedState),
+              (f.memoizedState =
+                e === null
+                  ? lj(c)
+                  : { baseLanes: e.baseLanes | c, cachePool: null }),
+              (f.childLanes = a.childLanes & ~c),
+              (b.memoizedState = kj),
+              d
+            );
+          c = sj(a, b, d.children, c);
+          b.memoizedState = null;
+          return c;
+        }
+        if (f)
+          return (
+            (d = rj(a, b, d.children, d.fallback, c)),
+            (f = b.child),
+            (e = a.child.memoizedState),
+            (f.memoizedState =
+              e === null
+                ? lj(c)
+                : { baseLanes: e.baseLanes | c, cachePool: null }),
+            (f.childLanes = a.childLanes & ~c),
+            (b.memoizedState = kj),
+            d
+          );
+        c = sj(a, b, d.children, c);
+        b.memoizedState = null;
+        return c;
+      }
+      function oj(a, b) {
+        b = nj({ mode: "visible", children: b }, a.mode, 0, null);
+        b.return = a;
+        return (a.child = b);
+      }
+      function sj(a, b, c, d) {
+        var e = a.child;
+        a = e.sibling;
+        c = mh(e, { mode: "visible", children: c });
+        (b.mode & 1) === 0 && (c.lanes = d);
+        c.return = b;
+        c.sibling = null;
+        a !== null &&
+          ((d = b.deletions),
+          d === null ? ((b.deletions = [a]), (b.flags |= 16)) : d.push(a));
+        return (b.child = c);
+      }
+      function rj(a, b, c, d, e) {
+        var f = b.mode;
+        a = a.child;
+        var g = a.sibling,
+          h = { mode: "hidden", children: c };
+        (f & 1) === 0 && b.child !== a
+          ? ((c = b.child),
+            (c.childLanes = 0),
+            (c.pendingProps = h),
+            (b.deletions = null))
+          : ((c = mh(a, h)), (c.subtreeFlags = a.subtreeFlags & 14680064));
+        g !== null ? (d = mh(g, d)) : ((d = qh(d, f, e, null)), (d.flags |= 2));
+        d.return = b;
+        c.return = b;
+        c.sibling = d;
+        b.child = c;
+        return d;
+      }
+      function pj(a, b, c, d) {
+        d !== null && hh(d);
+        rh(b, a.child, null, c);
+        a = oj(b, b.pendingProps.children);
+        a.flags |= 2;
+        b.memoizedState = null;
+        return a;
+      }
+      function tj(a, b, c) {
+        a.lanes |= b;
+        var d = a.alternate;
+        d !== null && (d.lanes |= b);
+        mg(a.return, b, c);
+      }
+      function uj(a, b, c, d, e) {
+        var f = a.memoizedState;
+        f === null
+          ? (a.memoizedState = {
+              isBackwards: b,
+              rendering: null,
+              renderingStartTime: 0,
+              last: d,
+              tail: c,
+              tailMode: e,
+            })
+          : ((f.isBackwards = b),
+            (f.rendering = null),
+            (f.renderingStartTime = 0),
+            (f.last = d),
+            (f.tail = c),
+            (f.tailMode = e));
+      }
+      function vj(a, b, c) {
+        var d = b.pendingProps,
+          e = d.revealOrder,
+          f = d.tail;
+        Xi$1(a, b, d.children, c);
+        d = P.current;
+        if ((d & 2) !== 0) (d = (d & 1) | 2), (b.flags |= 128);
+        else {
+          if (a !== null && (a.flags & 128) !== 0)
+            a: for (a = b.child; a !== null; ) {
+              if (a.tag === 13) a.memoizedState !== null && tj(a, c, b);
+              else if (a.tag === 19) tj(a, c, b);
+              else if (a.child !== null) {
+                a.child.return = a;
+                a = a.child;
+                continue;
+              }
+              if (a === b) break a;
+              for (; a.sibling === null; ) {
+                if (a.return === null || a.return === b) break a;
+                a = a.return;
+              }
+              a.sibling.return = a.return;
+              a = a.sibling;
+            }
+          d &= 1;
+        }
+        H(P, d);
+        if ((b.mode & 1) === 0) b.memoizedState = null;
+        else
+          switch (e) {
+            case "forwards":
+              c = b.child;
+              for (e = null; c !== null; )
+                (a = c.alternate),
+                  a !== null && Ch(a) === null && (e = c),
+                  (c = c.sibling);
+              c = e;
+              c === null
+                ? ((e = b.child), (b.child = null))
+                : ((e = c.sibling), (c.sibling = null));
+              uj(b, false, e, c, f);
+              break;
+            case "backwards":
+              c = null;
+              e = b.child;
+              for (b.child = null; e !== null; ) {
+                a = e.alternate;
+                if (a !== null && Ch(a) === null) {
+                  b.child = e;
+                  break;
+                }
+                a = e.sibling;
+                e.sibling = c;
+                c = e;
+                e = a;
+              }
+              uj(b, true, c, null, f);
+              break;
+            case "together":
+              uj(b, false, null, null, void 0);
+              break;
+            default:
+              b.memoizedState = null;
+          }
+        return b.child;
+      }
+      function Zi(a, b, c) {
+        a !== null && (b.dependencies = a.dependencies);
+        zg |= b.lanes;
+        if ((c & b.childLanes) === 0) return null;
+        if (a !== null && b.child !== a.child) throw Error(p$1(153));
+        if (b.child !== null) {
+          a = b.child;
+          c = mh(a, a.pendingProps);
+          b.child = c;
+          for (c.return = b; a.sibling !== null; )
+            (a = a.sibling),
+              (c = c.sibling = mh(a, a.pendingProps)),
+              (c.return = b);
+          c.sibling = null;
+        }
+        return b.child;
+      }
+      function wj(a, b, c) {
+        switch (b.tag) {
+          case 3:
+            ij(b);
+            gh();
+            break;
+          case 5:
+            Ah(b);
+            break;
+          case 1:
+            Tf(b.type) && Xf(b);
+            break;
+          case 4:
+            yh(b, b.stateNode.containerInfo);
+            break;
+          case 10:
+            var d = b.type._context,
+              e = b.memoizedProps.value;
+            H(gg$1, d._currentValue);
+            d._currentValue = e;
+            break;
+          case 13:
+            d = b.memoizedState;
+            if (d !== null) {
+              if (d.dehydrated !== null)
+                return H(P, P.current & 1), (b.flags |= 128), null;
+              if ((c & b.child.childLanes) !== 0) return mj(a, b, c);
+              H(P, P.current & 1);
+              a = Zi(a, b, c);
+              return a !== null ? a.sibling : null;
+            }
+            H(P, P.current & 1);
+            break;
+          case 19:
+            d = (c & b.childLanes) !== 0;
+            if ((a.flags & 128) !== 0) {
+              if (d) return vj(a, b, c);
+              b.flags |= 128;
+            }
+            e = b.memoizedState;
+            e !== null &&
+              ((e.rendering = null), (e.tail = null), (e.lastEffect = null));
+            H(P, P.current);
+            if (d) break;
+            else return null;
+          case 22:
+          case 23:
+            return (b.lanes = 0), dj(a, b, c);
+        }
+        return Zi(a, b, c);
+      }
+      function xj(a, b) {
+        Wg(b);
+        switch (b.tag) {
+          case 1:
+            return (
+              Tf(b.type) && Uf(),
+              (a = b.flags),
+              a & 65536 ? ((b.flags = (a & -65537) | 128), b) : null
+            );
+          case 3:
+            return (
+              zh(),
+              G(Qf),
+              G(I),
+              Eh(),
+              (a = b.flags),
+              (a & 65536) !== 0 && (a & 128) === 0
+                ? ((b.flags = (a & -65537) | 128), b)
+                : null
+            );
+          case 5:
+            return Bh(b), null;
+          case 13:
+            G(P);
+            a = b.memoizedState;
+            if (a !== null && a.dehydrated !== null) {
+              if (b.alternate === null) throw Error(p$1(340));
+              gh();
+            }
+            a = b.flags;
+            return a & 65536 ? ((b.flags = (a & -65537) | 128), b) : null;
+          case 19:
+            return G(P), null;
+          case 4:
+            return zh(), null;
+          case 10:
+            return lg$1(b.type._context), null;
+          case 22:
+          case 23:
+            return Ui(), null;
+          case 24:
+            return null;
+          default:
+            return null;
+        }
+      }
+      var yj = false,
+        zj = false,
+        Aj = typeof WeakSet === "function" ? WeakSet : Set,
+        X = null;
+      function Bj(a, b) {
+        var c = a.ref;
+        if (c !== null)
+          if (typeof c === "function")
+            try {
+              c(null);
+            } catch (d) {
+              Cj(a, b, d);
+            }
+          else c.current = null;
+      }
+      function Dj(a, b, c) {
+        try {
+          c();
+        } catch (d) {
+          Cj(a, b, d);
+        }
+      }
+      var Ej = false;
+      function Fj(a, b) {
+        a = He();
+        if (Ie(a)) {
+          if ("selectionStart" in a)
+            var c = { start: a.selectionStart, end: a.selectionEnd };
+          else
+            a: {
+              c = ((c = a.ownerDocument) && c.defaultView) || window;
+              var d = c.getSelection && c.getSelection();
+              if (d && d.rangeCount !== 0) {
+                c = d.anchorNode;
+                var e = d.anchorOffset,
+                  f = d.focusNode;
+                d = d.focusOffset;
+                try {
+                  c.nodeType, f.nodeType;
+                } catch (O2) {
+                  c = null;
+                  break a;
+                }
+                var g = 0,
+                  h = -1,
+                  k = -1,
+                  l2 = 0,
+                  m = 0,
+                  w2 = a,
+                  u2 = null;
+                b: for (;;) {
+                  for (var y2; ; ) {
+                    w2 !== c || (e !== 0 && w2.nodeType !== 3) || (h = g + e);
+                    w2 !== f || (d !== 0 && w2.nodeType !== 3) || (k = g + d);
+                    w2.nodeType === 3 && (g += w2.nodeValue.length);
+                    if ((y2 = w2.firstChild) === null) break;
+                    u2 = w2;
+                    w2 = y2;
+                  }
+                  for (;;) {
+                    if (w2 === a) break b;
+                    u2 === c && ++l2 === e && (h = g);
+                    u2 === f && ++m === d && (k = g);
+                    if ((y2 = w2.nextSibling) !== null) break;
+                    w2 = u2;
+                    u2 = w2.parentNode;
+                  }
+                  w2 = y2;
+                }
+                c = h === -1 || k === -1 ? null : { start: h, end: k };
+              } else c = null;
+            }
+          c = c || { start: 0, end: 0 };
+        } else c = null;
+        xf = { focusedElem: a, selectionRange: c };
+        for (X = b; X !== null; )
+          if (
+            ((b = X),
+            (a = b.child),
+            (b.subtreeFlags & 1028) !== 0 && a !== null)
+          )
+            (a.return = b), (X = a);
+          else
+            for (; X !== null; ) {
+              b = X;
+              try {
+                var n2 = b.alternate;
+                if ((b.flags & 1024) !== 0)
+                  switch (b.tag) {
+                    case 0:
+                    case 11:
+                    case 15:
+                      break;
+                    case 1:
+                      if (n2 !== null) {
+                        var v2 = n2.memoizedProps,
+                          C2 = n2.memoizedState,
+                          t2 = b.stateNode,
+                          r2 = t2.getSnapshotBeforeUpdate(
+                            b.elementType === b.type ? v2 : fg(b.type, v2),
+                            C2
+                          );
+                        t2.__reactInternalSnapshotBeforeUpdate = r2;
+                      }
+                      break;
+                    case 3:
+                      var x2 = b.stateNode.containerInfo;
+                      if (x2.nodeType === 1) x2.textContent = "";
+                      else if (x2.nodeType === 9) {
+                        var B2 = x2.body;
+                        B2 != null && (B2.textContent = "");
+                      }
+                      break;
+                    case 5:
+                    case 6:
+                    case 4:
+                    case 17:
+                      break;
+                    default:
+                      throw Error(p$1(163));
+                  }
+              } catch (O2) {
+                Cj(b, b.return, O2);
+              }
+              a = b.sibling;
+              if (a !== null) {
+                a.return = b.return;
+                X = a;
+                break;
+              }
+              X = b.return;
+            }
+        n2 = Ej;
+        Ej = false;
+        return n2;
+      }
+      function Gj(a, b, c) {
+        var d = b.updateQueue;
+        d = d !== null ? d.lastEffect : null;
+        if (d !== null) {
+          var e = (d = d.next);
+          do {
+            if ((e.tag & a) === a) {
+              var f = e.destroy;
+              e.destroy = void 0;
+              f !== void 0 && Dj(b, c, f);
+            }
+            e = e.next;
+          } while (e !== d);
+        }
+      }
+      function Hj(a, b) {
+        b = b.updateQueue;
+        b = b !== null ? b.lastEffect : null;
+        if (b !== null) {
+          var c = (b = b.next);
+          do {
+            if ((c.tag & a) === a) {
+              var d = c.create;
+              c.destroy = d();
+            }
+            c = c.next;
+          } while (c !== b);
+        }
+      }
+      function Ij(a) {
+        var b = a.ref;
+        if (b !== null) {
+          var c = a.stateNode;
+          switch (a.tag) {
+            case 5:
+              a = c;
+              break;
+            default:
+              a = c;
+          }
+          typeof b === "function" ? b(a) : (b.current = a);
+        }
+      }
+      function Jj(a, b, c) {
+        if (ic$1 && typeof ic$1.onCommitFiberUnmount === "function")
+          try {
+            ic$1.onCommitFiberUnmount(hc, b);
+          } catch (g) {}
+        switch (b.tag) {
+          case 0:
+          case 11:
+          case 14:
+          case 15:
+            a = b.updateQueue;
+            if (a !== null && ((a = a.lastEffect), a !== null)) {
+              var d = (a = a.next);
+              do {
+                var e = d,
+                  f = e.destroy;
+                e = e.tag;
+                f !== void 0 &&
+                  ((e & 2) !== 0 ? Dj(b, c, f) : (e & 4) !== 0 && Dj(b, c, f));
+                d = d.next;
+              } while (d !== a);
+            }
+            break;
+          case 1:
+            Bj(b, c);
+            a = b.stateNode;
+            if (typeof a.componentWillUnmount === "function")
+              try {
+                (a.props = b.memoizedProps),
+                  (a.state = b.memoizedState),
+                  a.componentWillUnmount();
+              } catch (g) {
+                Cj(b, c, g);
+              }
+            break;
+          case 5:
+            Bj(b, c);
+            break;
+          case 4:
+            Kj(a, b, c);
+        }
+      }
+      function Lj(a) {
+        var b = a.alternate;
+        b !== null && ((a.alternate = null), Lj(b));
+        a.child = null;
+        a.deletions = null;
+        a.sibling = null;
+        a.tag === 5 &&
+          ((b = a.stateNode),
+          b !== null &&
+            (delete b[If],
+            delete b[Jf],
+            delete b[jf],
+            delete b[Kf],
+            delete b[Lf]));
+        a.stateNode = null;
+        a.return = null;
+        a.dependencies = null;
+        a.memoizedProps = null;
+        a.memoizedState = null;
+        a.pendingProps = null;
+        a.stateNode = null;
+        a.updateQueue = null;
+      }
+      function Mj(a) {
+        return a.tag === 5 || a.tag === 3 || a.tag === 4;
+      }
+      function Nj(a) {
+        a: for (;;) {
+          for (; a.sibling === null; ) {
+            if (a.return === null || Mj(a.return)) return null;
+            a = a.return;
+          }
+          a.sibling.return = a.return;
+          for (a = a.sibling; a.tag !== 5 && a.tag !== 6 && a.tag !== 18; ) {
+            if (a.flags & 2) continue a;
+            if (a.child === null || a.tag === 4) continue a;
+            else (a.child.return = a), (a = a.child);
+          }
+          if (!(a.flags & 2)) return a.stateNode;
+        }
+      }
+      function Oj(a) {
+        a: {
+          for (var b = a.return; b !== null; ) {
+            if (Mj(b)) break a;
+            b = b.return;
+          }
+          throw Error(p$1(160));
+        }
+        var c = b;
+        switch (c.tag) {
+          case 5:
+            b = c.stateNode;
+            c.flags & 32 && (lb(b, ""), (c.flags &= -33));
+            c = Nj(a);
+            Pj(a, c, b);
+            break;
+          case 3:
+          case 4:
+            b = c.stateNode.containerInfo;
+            c = Nj(a);
+            Qj(a, c, b);
+            break;
+          default:
+            throw Error(p$1(161));
+        }
+      }
+      function Qj(a, b, c) {
+        var d = a.tag;
+        if (d === 5 || d === 6)
+          (a = a.stateNode),
+            b
+              ? c.nodeType === 8
+                ? c.parentNode.insertBefore(a, b)
+                : c.insertBefore(a, b)
+              : (c.nodeType === 8
+                  ? ((b = c.parentNode), b.insertBefore(a, c))
+                  : ((b = c), b.appendChild(a)),
+                (c = c._reactRootContainer),
+                (c !== null && c !== void 0) ||
+                  b.onclick !== null ||
+                  (b.onclick = wf));
+        else if (d !== 4 && ((a = a.child), a !== null))
+          for (Qj(a, b, c), a = a.sibling; a !== null; )
+            Qj(a, b, c), (a = a.sibling);
+      }
+      function Pj(a, b, c) {
+        var d = a.tag;
+        if (d === 5 || d === 6)
+          (a = a.stateNode), b ? c.insertBefore(a, b) : c.appendChild(a);
+        else if (d !== 4 && ((a = a.child), a !== null))
+          for (Pj(a, b, c), a = a.sibling; a !== null; )
+            Pj(a, b, c), (a = a.sibling);
+      }
+      function Kj(a, b, c) {
+        for (var d = b, e = false, f, g; ; ) {
+          if (!e) {
+            e = d.return;
+            a: for (;;) {
+              if (e === null) throw Error(p$1(160));
+              f = e.stateNode;
+              switch (e.tag) {
+                case 5:
+                  g = false;
+                  break a;
+                case 3:
+                  f = f.containerInfo;
+                  g = true;
+                  break a;
+                case 4:
+                  f = f.containerInfo;
+                  g = true;
+                  break a;
+              }
+              e = e.return;
+            }
+            e = true;
+          }
+          if (d.tag === 5 || d.tag === 6) {
+            a: for (var h = a, k = d, l2 = c, m = k; ; )
+              if ((Jj(h, m, l2), m.child !== null && m.tag !== 4))
+                (m.child.return = m), (m = m.child);
+              else {
+                if (m === k) break a;
+                for (; m.sibling === null; ) {
+                  if (m.return === null || m.return === k) break a;
+                  m = m.return;
+                }
+                m.sibling.return = m.return;
+                m = m.sibling;
+              }
+            g
+              ? ((h = f),
+                (k = d.stateNode),
+                h.nodeType === 8
+                  ? h.parentNode.removeChild(k)
+                  : h.removeChild(k))
+              : f.removeChild(d.stateNode);
+          } else if (d.tag === 18)
+            g
+              ? ((h = f),
+                (k = d.stateNode),
+                h.nodeType === 8
+                  ? Ef(h.parentNode, k)
+                  : h.nodeType === 1 && Ef(h, k),
+                Yc(h))
+              : Ef(f, d.stateNode);
+          else if (d.tag === 4) {
+            if (d.child !== null) {
+              f = d.stateNode.containerInfo;
+              g = true;
+              d.child.return = d;
+              d = d.child;
+              continue;
+            }
+          } else if ((Jj(a, d, c), d.child !== null)) {
+            d.child.return = d;
+            d = d.child;
+            continue;
+          }
+          if (d === b) break;
+          for (; d.sibling === null; ) {
+            if (d.return === null || d.return === b) return;
+            d = d.return;
+            d.tag === 4 && (e = false);
+          }
+          d.sibling.return = d.return;
+          d = d.sibling;
+        }
+      }
+      function Rj(a, b) {
+        switch (b.tag) {
+          case 0:
+          case 11:
+          case 14:
+          case 15:
+            Gj(3, b, b.return);
+            Hj(3, b);
+            Gj(5, b, b.return);
+            return;
+          case 1:
+            return;
+          case 5:
+            var c = b.stateNode;
+            if (c != null) {
+              var d = b.memoizedProps,
+                e = a !== null ? a.memoizedProps : d;
+              a = b.type;
+              var f = b.updateQueue;
+              b.updateQueue = null;
+              if (f !== null) {
+                a === "input" &&
+                  d.type === "radio" &&
+                  d.name != null &&
+                  Ya(c, d);
+                sb(a, e);
+                b = sb(a, d);
+                for (e = 0; e < f.length; e += 2) {
+                  var g = f[e],
+                    h = f[e + 1];
+                  g === "style"
+                    ? pb(c, h)
+                    : g === "dangerouslySetInnerHTML"
+                    ? kb(c, h)
+                    : g === "children"
+                    ? lb(c, h)
+                    : ra(c, g, h, b);
+                }
+                switch (a) {
+                  case "input":
+                    Za(c, d);
+                    break;
+                  case "textarea":
+                    fb(c, d);
+                    break;
+                  case "select":
+                    (a = c._wrapperState.wasMultiple),
+                      (c._wrapperState.wasMultiple = !!d.multiple),
+                      (f = d.value),
+                      f != null
+                        ? cb(c, !!d.multiple, f, false)
+                        : a !== !!d.multiple &&
+                          (d.defaultValue != null
+                            ? cb(c, !!d.multiple, d.defaultValue, true)
+                            : cb(c, !!d.multiple, d.multiple ? [] : "", false));
+                }
+                c[Jf] = d;
+              }
+            }
+            return;
+          case 6:
+            if (b.stateNode === null) throw Error(p$1(162));
+            b.stateNode.nodeValue = b.memoizedProps;
+            return;
+          case 3:
+            a !== null &&
+              a.memoizedState.isDehydrated &&
+              Yc(b.stateNode.containerInfo);
+            return;
+          case 12:
+            return;
+          case 13:
+            Sj(b);
+            return;
+          case 19:
+            Sj(b);
+            return;
+          case 17:
+            return;
+        }
+        throw Error(p$1(163));
+      }
+      function Sj(a) {
+        var b = a.updateQueue;
+        if (b !== null) {
+          a.updateQueue = null;
+          var c = a.stateNode;
+          c === null && (c = a.stateNode = new Aj());
+          b.forEach(function (b2) {
+            var d = Tj.bind(null, a, b2);
+            c.has(b2) || (c.add(b2), b2.then(d, d));
+          });
+        }
+      }
+      function Uj(a, b) {
+        for (X = b; X !== null; ) {
+          b = X;
+          var c = b.deletions;
+          if (c !== null)
+            for (var d = 0; d < c.length; d++) {
+              var e = c[d];
+              try {
+                Kj(a, e, b);
+                var f = e.alternate;
+                f !== null && (f.return = null);
+                e.return = null;
+              } catch (L2) {
+                Cj(e, b, L2);
+              }
+            }
+          c = b.child;
+          if ((b.subtreeFlags & 12854) !== 0 && c !== null)
+            (c.return = b), (X = c);
+          else
+            for (; X !== null; ) {
+              b = X;
+              try {
+                var g = b.flags;
+                g & 32 && lb(b.stateNode, "");
+                if (g & 512) {
+                  var h = b.alternate;
+                  if (h !== null) {
+                    var k = h.ref;
+                    k !== null &&
+                      (typeof k === "function" ? k(null) : (k.current = null));
+                  }
+                }
+                if (g & 8192)
+                  switch (b.tag) {
+                    case 13:
+                      if (b.memoizedState !== null) {
+                        var l2 = b.alternate;
+                        if (l2 === null || l2.memoizedState === null) Vj = D();
+                      }
+                      break;
+                    case 22:
+                      var m = b.memoizedState !== null,
+                        w2 = b.alternate,
+                        u2 = w2 !== null && w2.memoizedState !== null;
+                      c = b;
+                      a: {
+                        d = c;
+                        e = m;
+                        for (var y2 = null, n2 = d; ; ) {
+                          if (n2.tag === 5) {
+                            if (y2 === null) {
+                              y2 = n2;
+                              var v2 = n2.stateNode;
+                              if (e) {
+                                var C2 = v2.style;
+                                typeof C2.setProperty === "function"
+                                  ? C2.setProperty(
+                                      "display",
+                                      "none",
+                                      "important"
+                                    )
+                                  : (C2.display = "none");
+                              } else {
+                                var t2 = n2.stateNode,
+                                  r2 = n2.memoizedProps.style,
+                                  x2 =
+                                    r2 !== void 0 &&
+                                    r2 !== null &&
+                                    r2.hasOwnProperty("display")
+                                      ? r2.display
+                                      : null;
+                                t2.style.display = ob("display", x2);
+                              }
+                            }
+                          } else if (n2.tag === 6)
+                            y2 === null &&
+                              (n2.stateNode.nodeValue = e
+                                ? ""
+                                : n2.memoizedProps);
+                          else if (
+                            ((n2.tag !== 22 && n2.tag !== 23) ||
+                              n2.memoizedState === null ||
+                              n2 === d) &&
+                            n2.child !== null
+                          ) {
+                            n2.child.return = n2;
+                            n2 = n2.child;
+                            continue;
+                          }
+                          if (n2 === d) break;
+                          for (; n2.sibling === null; ) {
+                            if (n2.return === null || n2.return === d) break a;
+                            y2 === n2 && (y2 = null);
+                            n2 = n2.return;
+                          }
+                          y2 === n2 && (y2 = null);
+                          n2.sibling.return = n2.return;
+                          n2 = n2.sibling;
+                        }
+                      }
+                      if (m && !u2 && (c.mode & 1) !== 0) {
+                        X = c;
+                        for (var B2 = c.child; B2 !== null; ) {
+                          for (c = X = B2; X !== null; ) {
+                            d = X;
+                            var O2 = d.child;
+                            switch (d.tag) {
+                              case 0:
+                              case 11:
+                              case 14:
+                              case 15:
+                                Gj(4, d, d.return);
+                                break;
+                              case 1:
+                                Bj(d, d.return);
+                                var T2 = d.stateNode;
+                                if (
+                                  typeof T2.componentWillUnmount === "function"
+                                ) {
+                                  var za = d.return;
+                                  try {
+                                    (T2.props = d.memoizedProps),
+                                      (T2.state = d.memoizedState),
+                                      T2.componentWillUnmount();
+                                  } catch (L2) {
+                                    Cj(d, za, L2);
+                                  }
+                                }
+                                break;
+                              case 5:
+                                Bj(d, d.return);
+                                break;
+                              case 22:
+                                if (d.memoizedState !== null) {
+                                  Wj(c);
+                                  continue;
+                                }
+                            }
+                            O2 !== null ? ((O2.return = d), (X = O2)) : Wj(c);
+                          }
+                          B2 = B2.sibling;
+                        }
+                      }
+                  }
+                switch (g & 4102) {
+                  case 2:
+                    Oj(b);
+                    b.flags &= -3;
+                    break;
+                  case 6:
+                    Oj(b);
+                    b.flags &= -3;
+                    Rj(b.alternate, b);
+                    break;
+                  case 4096:
+                    b.flags &= -4097;
+                    break;
+                  case 4100:
+                    b.flags &= -4097;
+                    Rj(b.alternate, b);
+                    break;
+                  case 4:
+                    Rj(b.alternate, b);
+                }
+              } catch (L2) {
+                Cj(b, b.return, L2);
+              }
+              c = b.sibling;
+              if (c !== null) {
+                c.return = b.return;
+                X = c;
+                break;
+              }
+              X = b.return;
+            }
+        }
+      }
+      function Xj(a, b, c) {
+        X = a;
+        Yj(a);
+      }
+      function Yj(a, b, c) {
+        for (var d = (a.mode & 1) !== 0; X !== null; ) {
+          var e = X,
+            f = e.child;
+          if (e.tag === 22 && d) {
+            var g = e.memoizedState !== null || yj;
+            if (!g) {
+              var h = e.alternate,
+                k = (h !== null && h.memoizedState !== null) || zj;
+              h = yj;
+              var l2 = zj;
+              yj = g;
+              if ((zj = k) && !l2)
+                for (X = e; X !== null; )
+                  (g = X),
+                    (k = g.child),
+                    g.tag === 22 && g.memoizedState !== null
+                      ? Zj(e)
+                      : k !== null
+                      ? ((k.return = g), (X = k))
+                      : Zj(e);
+              for (; f !== null; ) (X = f), Yj(f), (f = f.sibling);
+              X = e;
+              yj = h;
+              zj = l2;
+            }
+            ak(a);
+          } else
+            (e.subtreeFlags & 8772) !== 0 && f !== null
+              ? ((f.return = e), (X = f))
+              : ak(a);
+        }
+      }
+      function ak(a) {
+        for (; X !== null; ) {
+          var b = X;
+          if ((b.flags & 8772) !== 0) {
+            var c = b.alternate;
+            try {
+              if ((b.flags & 8772) !== 0)
+                switch (b.tag) {
+                  case 0:
+                  case 11:
+                  case 15:
+                    zj || Hj(5, b);
+                    break;
+                  case 1:
+                    var d = b.stateNode;
+                    if (b.flags & 4 && !zj)
+                      if (c === null) d.componentDidMount();
+                      else {
+                        var e =
+                          b.elementType === b.type
+                            ? c.memoizedProps
+                            : fg(b.type, c.memoizedProps);
+                        d.componentDidUpdate(
+                          e,
+                          c.memoizedState,
+                          d.__reactInternalSnapshotBeforeUpdate
+                        );
+                      }
+                    var f = b.updateQueue;
+                    f !== null && Ag(b, f, d);
+                    break;
+                  case 3:
+                    var g = b.updateQueue;
+                    if (g !== null) {
+                      c = null;
+                      if (b.child !== null)
+                        switch (b.child.tag) {
+                          case 5:
+                            c = b.child.stateNode;
+                            break;
+                          case 1:
+                            c = b.child.stateNode;
+                        }
+                      Ag(b, g, c);
+                    }
+                    break;
+                  case 5:
+                    var h = b.stateNode;
+                    if (c === null && b.flags & 4) {
+                      c = h;
+                      var k = b.memoizedProps;
+                      switch (b.type) {
+                        case "button":
+                        case "input":
+                        case "select":
+                        case "textarea":
+                          k.autoFocus && c.focus();
+                          break;
+                        case "img":
+                          k.src && (c.src = k.src);
+                      }
+                    }
+                    break;
+                  case 6:
+                    break;
+                  case 4:
+                    break;
+                  case 12:
+                    break;
+                  case 13:
+                    if (b.memoizedState === null) {
+                      var l2 = b.alternate;
+                      if (l2 !== null) {
+                        var m = l2.memoizedState;
+                        if (m !== null) {
+                          var w2 = m.dehydrated;
+                          w2 !== null && Yc(w2);
+                        }
+                      }
+                    }
+                    break;
+                  case 19:
+                  case 17:
+                  case 21:
+                  case 22:
+                  case 23:
+                    break;
+                  default:
+                    throw Error(p$1(163));
+                }
+              zj || (b.flags & 512 && Ij(b));
+            } catch (u2) {
+              Cj(b, b.return, u2);
+            }
+          }
+          if (b === a) {
+            X = null;
+            break;
+          }
+          c = b.sibling;
+          if (c !== null) {
+            c.return = b.return;
+            X = c;
+            break;
+          }
+          X = b.return;
+        }
+      }
+      function Wj(a) {
+        for (; X !== null; ) {
+          var b = X;
+          if (b === a) {
+            X = null;
+            break;
+          }
+          var c = b.sibling;
+          if (c !== null) {
+            c.return = b.return;
+            X = c;
+            break;
+          }
+          X = b.return;
+        }
+      }
+      function Zj(a) {
+        for (; X !== null; ) {
+          var b = X;
+          try {
+            switch (b.tag) {
+              case 0:
+              case 11:
+              case 15:
+                var c = b.return;
+                try {
+                  Hj(4, b);
+                } catch (k) {
+                  Cj(b, c, k);
+                }
+                break;
+              case 1:
+                var d = b.stateNode;
+                if (typeof d.componentDidMount === "function") {
+                  var e = b.return;
+                  try {
+                    d.componentDidMount();
+                  } catch (k) {
+                    Cj(b, e, k);
+                  }
+                }
+                var f = b.return;
+                try {
+                  Ij(b);
+                } catch (k) {
+                  Cj(b, f, k);
+                }
+                break;
+              case 5:
+                var g = b.return;
+                try {
+                  Ij(b);
+                } catch (k) {
+                  Cj(b, g, k);
+                }
+            }
+          } catch (k) {
+            Cj(b, b.return, k);
+          }
+          if (b === a) {
+            X = null;
+            break;
+          }
+          var h = b.sibling;
+          if (h !== null) {
+            h.return = b.return;
+            X = h;
+            break;
+          }
+          X = b.return;
+        }
+      }
+      var bk = Math.ceil,
+        ck = sa.ReactCurrentDispatcher,
+        dk = sa.ReactCurrentOwner,
+        ek = sa.ReactCurrentBatchConfig,
+        K = 0,
+        J = null,
+        Y = null,
+        Z = 0,
+        Vi = 0,
+        ej = Of(0),
+        W = 0,
+        fk = null,
+        zg = 0,
+        gk = 0,
+        hk = 0,
+        ik = null,
+        jk = null,
+        Vj = 0,
+        Ti = Infinity,
+        Di = false,
+        Ei = null,
+        Gi = null,
+        kk = false,
+        lk = null,
+        mk = 0,
+        nk = 0,
+        ok = null,
+        pk = -1,
+        qk = 0;
+      function M() {
+        return (K & 6) !== 0 ? D() : pk !== -1 ? pk : (pk = D());
+      }
+      function Dg(a) {
+        if ((a.mode & 1) === 0) return 1;
+        if ((K & 2) !== 0 && Z !== 0) return Z & -Z;
+        if (eg$1.transition !== null)
+          return (
+            qk === 0 &&
+              ((a = oc),
+              (oc <<= 1),
+              (oc & 4194240) === 0 && (oc = 64),
+              (qk = a)),
+            qk
+          );
+        a = E;
+        if (a !== 0) return a;
+        a = window.event;
+        a = a === void 0 ? 16 : ed(a.type);
+        return a;
+      }
+      function Eg(a, b, c) {
+        if (50 < nk) throw ((nk = 0), (ok = null), Error(p$1(185)));
+        var d = rk(a, b);
+        if (d === null) return null;
+        wc(d, b, c);
+        if ((K & 2) === 0 || d !== J)
+          d === J && ((K & 2) === 0 && (gk |= b), W === 4 && sk(d, Z)),
+            tk(d, c),
+            b === 1 &&
+              K === 0 &&
+              (a.mode & 1) === 0 &&
+              ((Ti = D() + 500), $f && dg());
+        return d;
+      }
+      function rk(a, b) {
+        a.lanes |= b;
+        var c = a.alternate;
+        c !== null && (c.lanes |= b);
+        c = a;
+        for (a = a.return; a !== null; )
+          (a.childLanes |= b),
+            (c = a.alternate),
+            c !== null && (c.childLanes |= b),
+            (c = a),
+            (a = a.return);
+        return c.tag === 3 ? c.stateNode : null;
+      }
+      function tk(a, b) {
+        var c = a.callbackNode;
+        tc(a, b);
+        var d = rc(a, a === J ? Z : 0);
+        if (d === 0)
+          c !== null && Zb(c),
+            (a.callbackNode = null),
+            (a.callbackPriority = 0);
+        else if (((b = d & -d), a.callbackPriority !== b)) {
+          c != null && Zb(c);
+          if (b === 1)
+            a.tag === 0 ? cg(uk.bind(null, a)) : bg(uk.bind(null, a)),
+              Df(function () {
+                K === 0 && dg();
+              }),
+              (c = null);
+          else {
+            switch (zc(d)) {
+              case 1:
+                c = cc;
+                break;
+              case 4:
+                c = dc;
+                break;
+              case 16:
+                c = ec;
+                break;
+              case 536870912:
+                c = gc;
+                break;
+              default:
+                c = ec;
+            }
+            c = vk(c, wk.bind(null, a));
+          }
+          a.callbackPriority = b;
+          a.callbackNode = c;
+        }
+      }
+      function wk(a, b) {
+        pk = -1;
+        qk = 0;
+        if ((K & 6) !== 0) throw Error(p$1(327));
+        var c = a.callbackNode;
+        if (xk() && a.callbackNode !== c) return null;
+        var d = rc(a, a === J ? Z : 0);
+        if (d === 0) return null;
+        if ((d & 30) !== 0 || (d & a.expiredLanes) !== 0 || b) b = yk(a, d);
+        else {
+          b = d;
+          var e = K;
+          K |= 2;
+          var f = zk();
+          if (J !== a || Z !== b) (Ti = D() + 500), Ak(a, b);
+          do
+            try {
+              Bk();
+              break;
+            } catch (h) {
+              Ck(a, h);
+            }
+          while (1);
+          kg();
+          ck.current = f;
+          K = e;
+          Y !== null ? (b = 0) : ((J = null), (Z = 0), (b = W));
+        }
+        if (b !== 0) {
+          b === 2 && ((e = uc(a)), e !== 0 && ((d = e), (b = Dk(a, e))));
+          if (b === 1) throw ((c = fk), Ak(a, 0), sk(a, d), tk(a, D()), c);
+          if (b === 6) sk(a, d);
+          else {
+            e = a.current.alternate;
+            if (
+              (d & 30) === 0 &&
+              !Ek(e) &&
+              ((b = yk(a, d)),
+              b === 2 && ((f = uc(a)), f !== 0 && ((d = f), (b = Dk(a, f)))),
+              b === 1)
+            )
+              throw ((c = fk), Ak(a, 0), sk(a, d), tk(a, D()), c);
+            a.finishedWork = e;
+            a.finishedLanes = d;
+            switch (b) {
+              case 0:
+              case 1:
+                throw Error(p$1(345));
+              case 2:
+                Fk(a, jk);
+                break;
+              case 3:
+                sk(a, d);
+                if ((d & 130023424) === d && ((b = Vj + 500 - D()), 10 < b)) {
+                  if (rc(a, 0) !== 0) break;
+                  e = a.suspendedLanes;
+                  if ((e & d) !== d) {
+                    M();
+                    a.pingedLanes |= a.suspendedLanes & e;
+                    break;
+                  }
+                  a.timeoutHandle = zf(Fk.bind(null, a, jk), b);
+                  break;
+                }
+                Fk(a, jk);
+                break;
+              case 4:
+                sk(a, d);
+                if ((d & 4194240) === d) break;
+                b = a.eventTimes;
+                for (e = -1; 0 < d; ) {
+                  var g = 31 - lc(d);
+                  f = 1 << g;
+                  g = b[g];
+                  g > e && (e = g);
+                  d &= ~f;
+                }
+                d = e;
+                d = D() - d;
+                d =
+                  (120 > d
+                    ? 120
+                    : 480 > d
+                    ? 480
+                    : 1080 > d
+                    ? 1080
+                    : 1920 > d
+                    ? 1920
+                    : 3e3 > d
+                    ? 3e3
+                    : 4320 > d
+                    ? 4320
+                    : 1960 * bk(d / 1960)) - d;
+                if (10 < d) {
+                  a.timeoutHandle = zf(Fk.bind(null, a, jk), d);
+                  break;
+                }
+                Fk(a, jk);
+                break;
+              case 5:
+                Fk(a, jk);
+                break;
+              default:
+                throw Error(p$1(329));
+            }
+          }
+        }
+        tk(a, D());
+        return a.callbackNode === c ? wk.bind(null, a) : null;
+      }
+      function Dk(a, b) {
+        var c = ik;
+        a.current.memoizedState.isDehydrated && (Ak(a, b).flags |= 256);
+        a = yk(a, b);
+        a !== 2 && ((b = jk), (jk = c), b !== null && Ri(b));
+        return a;
+      }
+      function Ri(a) {
+        jk === null ? (jk = a) : jk.push.apply(jk, a);
+      }
+      function Ek(a) {
+        for (var b = a; ; ) {
+          if (b.flags & 16384) {
+            var c = b.updateQueue;
+            if (c !== null && ((c = c.stores), c !== null))
+              for (var d = 0; d < c.length; d++) {
+                var e = c[d],
+                  f = e.getSnapshot;
+                e = e.value;
+                try {
+                  if (!Ce(f(), e)) return false;
+                } catch (g) {
+                  return false;
+                }
+              }
+          }
+          c = b.child;
+          if (b.subtreeFlags & 16384 && c !== null) (c.return = b), (b = c);
+          else {
+            if (b === a) break;
+            for (; b.sibling === null; ) {
+              if (b.return === null || b.return === a) return true;
+              b = b.return;
+            }
+            b.sibling.return = b.return;
+            b = b.sibling;
+          }
+        }
+        return true;
+      }
+      function sk(a, b) {
+        b &= ~hk;
+        b &= ~gk;
+        a.suspendedLanes |= b;
+        a.pingedLanes &= ~b;
+        for (a = a.expirationTimes; 0 < b; ) {
+          var c = 31 - lc(b),
+            d = 1 << c;
+          a[c] = -1;
+          b &= ~d;
+        }
+      }
+      function uk(a) {
+        if ((K & 6) !== 0) throw Error(p$1(327));
+        xk();
+        var b = rc(a, 0);
+        if ((b & 1) === 0) return tk(a, D()), null;
+        var c = yk(a, b);
+        if (a.tag !== 0 && c === 2) {
+          var d = uc(a);
+          d !== 0 && ((b = d), (c = Dk(a, d)));
+        }
+        if (c === 1) throw ((c = fk), Ak(a, 0), sk(a, b), tk(a, D()), c);
+        if (c === 6) throw Error(p$1(345));
+        a.finishedWork = a.current.alternate;
+        a.finishedLanes = b;
+        Fk(a, jk);
+        tk(a, D());
+        return null;
+      }
+      function Gk(a, b) {
+        var c = K;
+        K |= 1;
+        try {
+          return a(b);
+        } finally {
+          (K = c), K === 0 && ((Ti = D() + 500), $f && dg());
+        }
+      }
+      function Hk(a) {
+        lk !== null && lk.tag === 0 && (K & 6) === 0 && xk();
+        var b = K;
+        K |= 1;
+        var c = ek.transition,
+          d = E;
+        try {
+          if (((ek.transition = null), (E = 1), a)) return a();
+        } finally {
+          (E = d), (ek.transition = c), (K = b), (K & 6) === 0 && dg();
+        }
+      }
+      function Ui() {
+        Vi = ej.current;
+        G(ej);
+      }
+      function Ak(a, b) {
+        a.finishedWork = null;
+        a.finishedLanes = 0;
+        var c = a.timeoutHandle;
+        c !== -1 && ((a.timeoutHandle = -1), Af(c));
+        if (Y !== null)
+          for (c = Y.return; c !== null; ) {
+            var d = c;
+            Wg(d);
+            switch (d.tag) {
+              case 1:
+                d = d.type.childContextTypes;
+                d !== null && d !== void 0 && Uf();
+                break;
+              case 3:
+                zh();
+                G(Qf);
+                G(I);
+                Eh();
+                break;
+              case 5:
+                Bh(d);
+                break;
+              case 4:
+                zh();
+                break;
+              case 13:
+                G(P);
+                break;
+              case 19:
+                G(P);
+                break;
+              case 10:
+                lg$1(d.type._context);
+                break;
+              case 22:
+              case 23:
+                Ui();
+            }
+            c = c.return;
+          }
+        J = a;
+        Y = a = mh(a.current, null);
+        Z = Vi = b;
+        W = 0;
+        fk = null;
+        hk = gk = zg = 0;
+        jk = ik = null;
+        if (qg !== null) {
+          for (b = 0; b < qg.length; b++)
+            if (((c = qg[b]), (d = c.interleaved), d !== null)) {
+              c.interleaved = null;
+              var e = d.next,
+                f = c.pending;
+              if (f !== null) {
+                var g = f.next;
+                f.next = e;
+                d.next = g;
+              }
+              c.pending = d;
+            }
+          qg = null;
+        }
+        return a;
+      }
+      function Ck(a, b) {
+        do {
+          var c = Y;
+          try {
+            kg();
+            Fh.current = Rh;
+            if (Ih) {
+              for (var d = Q.memoizedState; d !== null; ) {
+                var e = d.queue;
+                e !== null && (e.pending = null);
+                d = d.next;
+              }
+              Ih = false;
+            }
+            Hh = 0;
+            S = R = Q = null;
+            Jh = false;
+            Kh = 0;
+            dk.current = null;
+            if (c === null || c.return === null) {
+              W = 1;
+              fk = b;
+              Y = null;
+              break;
+            }
+            a: {
+              var f = a,
+                g = c.return,
+                h = c,
+                k = b;
+              b = Z;
+              h.flags |= 32768;
+              if (
+                k !== null &&
+                typeof k === "object" &&
+                typeof k.then === "function"
+              ) {
+                var l2 = k,
+                  m = h,
+                  w2 = m.tag;
+                if (
+                  (m.mode & 1) === 0 &&
+                  (w2 === 0 || w2 === 11 || w2 === 15)
+                ) {
+                  var u2 = m.alternate;
+                  u2
+                    ? ((m.updateQueue = u2.updateQueue),
+                      (m.memoizedState = u2.memoizedState),
+                      (m.lanes = u2.lanes))
+                    : ((m.updateQueue = null), (m.memoizedState = null));
+                }
+                var y2 = Ji(g);
+                if (y2 !== null) {
+                  y2.flags &= -257;
+                  Ki(y2, g, h, f, b);
+                  y2.mode & 1 && Hi(f, l2, b);
+                  b = y2;
+                  k = l2;
+                  var n2 = b.updateQueue;
+                  if (n2 === null) {
+                    var v2 = /* @__PURE__ */ new Set();
+                    v2.add(k);
+                    b.updateQueue = v2;
+                  } else n2.add(k);
+                  break a;
+                } else {
+                  if ((b & 1) === 0) {
+                    Hi(f, l2, b);
+                    Si();
+                    break a;
+                  }
+                  k = Error(p$1(426));
+                }
+              } else if (N && h.mode & 1) {
+                var C2 = Ji(g);
+                if (C2 !== null) {
+                  (C2.flags & 65536) === 0 && (C2.flags |= 256);
+                  Ki(C2, g, h, f, b);
+                  hh(k);
+                  break a;
+                }
+              }
+              f = k;
+              W !== 4 && (W = 2);
+              ik === null ? (ik = [f]) : ik.push(f);
+              k = zi(k, h);
+              h = g;
+              do {
+                switch (h.tag) {
+                  case 3:
+                    h.flags |= 65536;
+                    b &= -b;
+                    h.lanes |= b;
+                    var t2 = Ci(h, k, b);
+                    xg(h, t2);
+                    break a;
+                  case 1:
+                    f = k;
+                    var r2 = h.type,
+                      x2 = h.stateNode;
+                    if (
+                      (h.flags & 128) === 0 &&
+                      (typeof r2.getDerivedStateFromError === "function" ||
+                        (x2 !== null &&
+                          typeof x2.componentDidCatch === "function" &&
+                          (Gi === null || !Gi.has(x2))))
+                    ) {
+                      h.flags |= 65536;
+                      b &= -b;
+                      h.lanes |= b;
+                      var B2 = Fi(h, f, b);
+                      xg(h, B2);
+                      break a;
+                    }
+                }
+                h = h.return;
+              } while (h !== null);
+            }
+            Ik(c);
+          } catch (O2) {
+            b = O2;
+            Y === c && c !== null && (Y = c = c.return);
+            continue;
+          }
+          break;
+        } while (1);
+      }
+      function zk() {
+        var a = ck.current;
+        ck.current = Rh;
+        return a === null ? Rh : a;
+      }
+      function Si() {
+        if (W === 0 || W === 3 || W === 2) W = 4;
+        J === null ||
+          ((zg & 268435455) === 0 && (gk & 268435455) === 0) ||
+          sk(J, Z);
+      }
+      function yk(a, b) {
+        var c = K;
+        K |= 2;
+        var d = zk();
+        (J === a && Z === b) || Ak(a, b);
+        do
+          try {
+            Jk();
+            break;
+          } catch (e) {
+            Ck(a, e);
+          }
+        while (1);
+        kg();
+        K = c;
+        ck.current = d;
+        if (Y !== null) throw Error(p$1(261));
+        J = null;
+        Z = 0;
+        return W;
+      }
+      function Jk() {
+        for (; Y !== null; ) Kk(Y);
+      }
+      function Bk() {
+        for (; Y !== null && !$b(); ) Kk(Y);
+      }
+      function Kk(a) {
+        var b = Lk(a.alternate, a, Vi);
+        a.memoizedProps = a.pendingProps;
+        b === null ? Ik(a) : (Y = b);
+        dk.current = null;
+      }
+      function Ik(a) {
+        var b = a;
+        do {
+          var c = b.alternate;
+          a = b.return;
+          if ((b.flags & 32768) === 0) {
+            if (((c = Qi(c, b, Vi)), c !== null)) {
+              Y = c;
+              return;
+            }
+          } else {
+            c = xj(c, b);
+            if (c !== null) {
+              c.flags &= 32767;
+              Y = c;
+              return;
+            }
+            if (a !== null)
+              (a.flags |= 32768), (a.subtreeFlags = 0), (a.deletions = null);
+            else {
+              W = 6;
+              Y = null;
+              return;
+            }
+          }
+          b = b.sibling;
+          if (b !== null) {
+            Y = b;
+            return;
+          }
+          Y = b = a;
+        } while (b !== null);
+        W === 0 && (W = 5);
+      }
+      function Fk(a, b) {
+        var c = E,
+          d = ek.transition;
+        try {
+          (ek.transition = null), (E = 1), Mk(a, b, c);
+        } finally {
+          (ek.transition = d), (E = c);
+        }
+        return null;
+      }
+      function Mk(a, b, c) {
+        do xk();
+        while (lk !== null);
+        if ((K & 6) !== 0) throw Error(p$1(327));
+        var d = a.finishedWork,
+          e = a.finishedLanes;
+        if (d === null) return null;
+        a.finishedWork = null;
+        a.finishedLanes = 0;
+        if (d === a.current) throw Error(p$1(177));
+        a.callbackNode = null;
+        a.callbackPriority = 0;
+        var f = d.lanes | d.childLanes;
+        xc(a, f);
+        a === J && ((Y = J = null), (Z = 0));
+        ((d.subtreeFlags & 2064) === 0 && (d.flags & 2064) === 0) ||
+          kk ||
+          ((kk = true),
+          vk(ec, function () {
+            xk();
+            return null;
+          }));
+        f = (d.flags & 15990) !== 0;
+        if ((d.subtreeFlags & 15990) !== 0 || f) {
+          f = ek.transition;
+          ek.transition = null;
+          var g = E;
+          E = 1;
+          var h = K;
+          K |= 4;
+          dk.current = null;
+          Fj(a, d);
+          Uj(a, d);
+          Je(xf);
+          xf = null;
+          a.current = d;
+          Xj(d);
+          ac$1();
+          K = h;
+          E = g;
+          ek.transition = f;
+        } else a.current = d;
+        kk && ((kk = false), (lk = a), (mk = e));
+        f = a.pendingLanes;
+        f === 0 && (Gi = null);
+        jc(d.stateNode);
+        tk(a, D());
+        if (b !== null)
+          for (c = a.onRecoverableError, d = 0; d < b.length; d++) c(b[d]);
+        if (Di) throw ((Di = false), (a = Ei), (Ei = null), a);
+        (mk & 1) !== 0 && a.tag !== 0 && xk();
+        f = a.pendingLanes;
+        (f & 1) !== 0 ? (a === ok ? nk++ : ((nk = 0), (ok = a))) : (nk = 0);
+        dg();
+        return null;
+      }
+      function xk() {
+        if (lk !== null) {
+          var a = zc(mk),
+            b = ek.transition,
+            c = E;
+          try {
+            ek.transition = null;
+            E = 16 > a ? 16 : a;
+            if (lk === null) var d = false;
+            else {
+              a = lk;
+              lk = null;
+              mk = 0;
+              if ((K & 6) !== 0) throw Error(p$1(331));
+              var e = K;
+              K |= 4;
+              for (X = a.current; X !== null; ) {
+                var f = X,
+                  g = f.child;
+                if ((X.flags & 16) !== 0) {
+                  var h = f.deletions;
+                  if (h !== null) {
+                    for (var k = 0; k < h.length; k++) {
+                      var l2 = h[k];
+                      for (X = l2; X !== null; ) {
+                        var m = X;
+                        switch (m.tag) {
+                          case 0:
+                          case 11:
+                          case 15:
+                            Gj(8, m, f);
+                        }
+                        var w2 = m.child;
+                        if (w2 !== null) (w2.return = m), (X = w2);
+                        else
+                          for (; X !== null; ) {
+                            m = X;
+                            var u2 = m.sibling,
+                              y2 = m.return;
+                            Lj(m);
+                            if (m === l2) {
+                              X = null;
+                              break;
+                            }
+                            if (u2 !== null) {
+                              u2.return = y2;
+                              X = u2;
+                              break;
+                            }
+                            X = y2;
+                          }
+                      }
+                    }
+                    var n2 = f.alternate;
+                    if (n2 !== null) {
+                      var v2 = n2.child;
+                      if (v2 !== null) {
+                        n2.child = null;
+                        do {
+                          var C2 = v2.sibling;
+                          v2.sibling = null;
+                          v2 = C2;
+                        } while (v2 !== null);
+                      }
+                    }
+                    X = f;
+                  }
+                }
+                if ((f.subtreeFlags & 2064) !== 0 && g !== null)
+                  (g.return = f), (X = g);
+                else
+                  b: for (; X !== null; ) {
+                    f = X;
+                    if ((f.flags & 2048) !== 0)
+                      switch (f.tag) {
+                        case 0:
+                        case 11:
+                        case 15:
+                          Gj(9, f, f.return);
+                      }
+                    var t2 = f.sibling;
+                    if (t2 !== null) {
+                      t2.return = f.return;
+                      X = t2;
+                      break b;
+                    }
+                    X = f.return;
+                  }
+              }
+              var r2 = a.current;
+              for (X = r2; X !== null; ) {
+                g = X;
+                var x2 = g.child;
+                if ((g.subtreeFlags & 2064) !== 0 && x2 !== null)
+                  (x2.return = g), (X = x2);
+                else
+                  b: for (g = r2; X !== null; ) {
+                    h = X;
+                    if ((h.flags & 2048) !== 0)
+                      try {
+                        switch (h.tag) {
+                          case 0:
+                          case 11:
+                          case 15:
+                            Hj(9, h);
+                        }
+                      } catch (O2) {
+                        Cj(h, h.return, O2);
+                      }
+                    if (h === g) {
+                      X = null;
+                      break b;
+                    }
+                    var B2 = h.sibling;
+                    if (B2 !== null) {
+                      B2.return = h.return;
+                      X = B2;
+                      break b;
+                    }
+                    X = h.return;
+                  }
+              }
+              K = e;
+              dg();
+              if (ic$1 && typeof ic$1.onPostCommitFiberRoot === "function")
+                try {
+                  ic$1.onPostCommitFiberRoot(hc, a);
+                } catch (O2) {}
+              d = true;
+            }
+            return d;
+          } finally {
+            (E = c), (ek.transition = b);
+          }
+        }
+        return false;
+      }
+      function Nk(a, b, c) {
+        b = zi(c, b);
+        b = Ci(a, b, 1);
+        vg(a, b);
+        b = M();
+        a = rk(a, 1);
+        a !== null && (wc(a, 1, b), tk(a, b));
+      }
+      function Cj(a, b, c) {
+        if (a.tag === 3) Nk(a, a, c);
+        else
+          for (; b !== null; ) {
+            if (b.tag === 3) {
+              Nk(b, a, c);
+              break;
+            } else if (b.tag === 1) {
+              var d = b.stateNode;
+              if (
+                typeof b.type.getDerivedStateFromError === "function" ||
+                (typeof d.componentDidCatch === "function" &&
+                  (Gi === null || !Gi.has(d)))
+              ) {
+                a = zi(c, a);
+                a = Fi(b, a, 1);
+                vg(b, a);
+                a = M();
+                b = rk(b, 1);
+                b !== null && (wc(b, 1, a), tk(b, a));
+                break;
+              }
+            }
+            b = b.return;
+          }
+      }
+      function Ii(a, b, c) {
+        var d = a.pingCache;
+        d !== null && d.delete(b);
+        b = M();
+        a.pingedLanes |= a.suspendedLanes & c;
+        J === a &&
+          (Z & c) === c &&
+          (W === 4 || (W === 3 && (Z & 130023424) === Z && 500 > D() - Vj)
+            ? Ak(a, 0)
+            : (hk |= c));
+        tk(a, b);
+      }
+      function Ok(a, b) {
+        b === 0 &&
+          ((a.mode & 1) === 0
+            ? (b = 1)
+            : ((b = pc), (pc <<= 1), (pc & 130023424) === 0 && (pc = 4194304)));
+        var c = M();
+        a = rk(a, b);
+        a !== null && (wc(a, b, c), tk(a, c));
+      }
+      function qj(a) {
+        var b = a.memoizedState,
+          c = 0;
+        b !== null && (c = b.retryLane);
+        Ok(a, c);
+      }
+      function Tj(a, b) {
+        var c = 0;
+        switch (a.tag) {
+          case 13:
+            var d = a.stateNode;
+            var e = a.memoizedState;
+            e !== null && (c = e.retryLane);
+            break;
+          case 19:
+            d = a.stateNode;
+            break;
+          default:
+            throw Error(p$1(314));
+        }
+        d !== null && d.delete(b);
+        Ok(a, c);
+      }
+      var Lk;
+      Lk = function (a, b, c) {
+        if (a !== null)
+          if (a.memoizedProps !== b.pendingProps || Qf.current) og = true;
+          else {
+            if ((a.lanes & c) === 0 && (b.flags & 128) === 0)
+              return (og = false), wj(a, b, c);
+            og = (a.flags & 131072) !== 0 ? true : false;
+          }
+        else (og = false), N && (b.flags & 1048576) !== 0 && Ug(b, Ng, b.index);
+        b.lanes = 0;
+        switch (b.tag) {
+          case 2:
+            var d = b.type;
+            a !== null &&
+              ((a.alternate = null), (b.alternate = null), (b.flags |= 2));
+            a = b.pendingProps;
+            var e = Sf(b, I.current);
+            ng(b, c);
+            e = Nh(null, b, d, a, e, c);
+            var f = Sh();
+            b.flags |= 1;
+            typeof e === "object" &&
+            e !== null &&
+            typeof e.render === "function" &&
+            e.$$typeof === void 0
+              ? ((b.tag = 1),
+                (b.memoizedState = null),
+                (b.updateQueue = null),
+                Tf(d) ? ((f = true), Xf(b)) : (f = false),
+                (b.memoizedState =
+                  e.state !== null && e.state !== void 0 ? e.state : null),
+                sg(b),
+                (e.updater = Fg),
+                (b.stateNode = e),
+                (e._reactInternals = b),
+                Jg(b, d, a, c),
+                (b = hj(null, b, d, true, f, c)))
+              : ((b.tag = 0),
+                N && f && Vg(b),
+                Xi$1(null, b, e, c),
+                (b = b.child));
+            return b;
+          case 16:
+            d = b.elementType;
+            a: {
+              a !== null &&
+                ((a.alternate = null), (b.alternate = null), (b.flags |= 2));
+              a = b.pendingProps;
+              e = d._init;
+              d = e(d._payload);
+              b.type = d;
+              e = b.tag = Pk(d);
+              a = fg(d, a);
+              switch (e) {
+                case 0:
+                  b = cj(null, b, d, a, c);
+                  break a;
+                case 1:
+                  b = gj(null, b, d, a, c);
+                  break a;
+                case 11:
+                  b = Yi(null, b, d, a, c);
+                  break a;
+                case 14:
+                  b = $i(null, b, d, fg(d.type, a), c);
+                  break a;
+              }
+              throw Error(p$1(306, d, ""));
+            }
+            return b;
+          case 0:
+            return (
+              (d = b.type),
+              (e = b.pendingProps),
+              (e = b.elementType === d ? e : fg(d, e)),
+              cj(a, b, d, e, c)
+            );
+          case 1:
+            return (
+              (d = b.type),
+              (e = b.pendingProps),
+              (e = b.elementType === d ? e : fg(d, e)),
+              gj(a, b, d, e, c)
+            );
+          case 3:
+            a: {
+              ij(b);
+              if (a === null) throw Error(p$1(387));
+              d = b.pendingProps;
+              f = b.memoizedState;
+              e = f.element;
+              tg(a, b);
+              yg(b, d, null, c);
+              var g = b.memoizedState;
+              d = g.element;
+              if (f.isDehydrated)
+                if (
+                  ((f = {
+                    element: d,
+                    isDehydrated: false,
+                    cache: g.cache,
+                    transitions: g.transitions,
+                  }),
+                  (b.updateQueue.baseState = f),
+                  (b.memoizedState = f),
+                  b.flags & 256)
+                ) {
+                  e = Error(p$1(423));
+                  b = jj(a, b, d, c, e);
+                  break a;
+                } else if (d !== e) {
+                  e = Error(p$1(424));
+                  b = jj(a, b, d, c, e);
+                  break a;
+                } else
+                  for (
+                    Yg = Ff(b.stateNode.containerInfo.firstChild),
+                      Xg = b,
+                      N = true,
+                      Zg = null,
+                      c = sh(b, null, d, c),
+                      b.child = c;
+                    c;
+
+                  )
+                    (c.flags = (c.flags & -3) | 4096), (c = c.sibling);
+              else {
+                gh();
+                if (d === e) {
+                  b = Zi(a, b, c);
+                  break a;
+                }
+                Xi$1(a, b, d, c);
+              }
+              b = b.child;
+            }
+            return b;
+          case 5:
+            return (
+              Ah(b),
+              a === null && dh(b),
+              (d = b.type),
+              (e = b.pendingProps),
+              (f = a !== null ? a.memoizedProps : null),
+              (g = e.children),
+              yf(d, e) ? (g = null) : f !== null && yf(d, f) && (b.flags |= 32),
+              fj(a, b),
+              Xi$1(a, b, g, c),
+              b.child
+            );
+          case 6:
+            return a === null && dh(b), null;
+          case 13:
+            return mj(a, b, c);
+          case 4:
+            return (
+              yh(b, b.stateNode.containerInfo),
+              (d = b.pendingProps),
+              a === null ? (b.child = rh(b, null, d, c)) : Xi$1(a, b, d, c),
+              b.child
+            );
+          case 11:
+            return (
+              (d = b.type),
+              (e = b.pendingProps),
+              (e = b.elementType === d ? e : fg(d, e)),
+              Yi(a, b, d, e, c)
+            );
+          case 7:
+            return Xi$1(a, b, b.pendingProps, c), b.child;
+          case 8:
+            return Xi$1(a, b, b.pendingProps.children, c), b.child;
+          case 12:
+            return Xi$1(a, b, b.pendingProps.children, c), b.child;
+          case 10:
+            a: {
+              d = b.type._context;
+              e = b.pendingProps;
+              f = b.memoizedProps;
+              g = e.value;
+              H(gg$1, d._currentValue);
+              d._currentValue = g;
+              if (f !== null)
+                if (Ce(f.value, g)) {
+                  if (f.children === e.children && !Qf.current) {
+                    b = Zi(a, b, c);
+                    break a;
+                  }
+                } else
+                  for (
+                    f = b.child, f !== null && (f.return = b);
+                    f !== null;
+
+                  ) {
+                    var h = f.dependencies;
+                    if (h !== null) {
+                      g = f.child;
+                      for (var k = h.firstContext; k !== null; ) {
+                        if (k.context === d) {
+                          if (f.tag === 1) {
+                            k = ug(-1, c & -c);
+                            k.tag = 2;
+                            var l2 = f.updateQueue;
+                            if (l2 !== null) {
+                              l2 = l2.shared;
+                              var m = l2.pending;
+                              m === null
+                                ? (k.next = k)
+                                : ((k.next = m.next), (m.next = k));
+                              l2.pending = k;
+                            }
+                          }
+                          f.lanes |= c;
+                          k = f.alternate;
+                          k !== null && (k.lanes |= c);
+                          mg(f.return, c, b);
+                          h.lanes |= c;
+                          break;
+                        }
+                        k = k.next;
+                      }
+                    } else if (f.tag === 10)
+                      g = f.type === b.type ? null : f.child;
+                    else if (f.tag === 18) {
+                      g = f.return;
+                      if (g === null) throw Error(p$1(341));
+                      g.lanes |= c;
+                      h = g.alternate;
+                      h !== null && (h.lanes |= c);
+                      mg(g, c, b);
+                      g = f.sibling;
+                    } else g = f.child;
+                    if (g !== null) g.return = f;
+                    else
+                      for (g = f; g !== null; ) {
+                        if (g === b) {
+                          g = null;
+                          break;
+                        }
+                        f = g.sibling;
+                        if (f !== null) {
+                          f.return = g.return;
+                          g = f;
+                          break;
+                        }
+                        g = g.return;
+                      }
+                    f = g;
+                  }
+              Xi$1(a, b, e.children, c);
+              b = b.child;
+            }
+            return b;
+          case 9:
+            return (
+              (e = b.type),
+              (d = b.pendingProps.children),
+              ng(b, c),
+              (e = pg(e)),
+              (d = d(e)),
+              (b.flags |= 1),
+              Xi$1(a, b, d, c),
+              b.child
+            );
+          case 14:
+            return (
+              (d = b.type),
+              (e = fg(d, b.pendingProps)),
+              (e = fg(d.type, e)),
+              $i(a, b, d, e, c)
+            );
+          case 15:
+            return bj(a, b, b.type, b.pendingProps, c);
+          case 17:
+            return (
+              (d = b.type),
+              (e = b.pendingProps),
+              (e = b.elementType === d ? e : fg(d, e)),
+              a !== null &&
+                ((a.alternate = null), (b.alternate = null), (b.flags |= 2)),
+              (b.tag = 1),
+              Tf(d) ? ((a = true), Xf(b)) : (a = false),
+              ng(b, c),
+              Hg(b, d, e),
+              Jg(b, d, e, c),
+              hj(null, b, d, true, a, c)
+            );
+          case 19:
+            return vj(a, b, c);
+          case 22:
+            return dj(a, b, c);
+        }
+        throw Error(p$1(156, b.tag));
+      };
+      function vk(a, b) {
+        return Yb(a, b);
+      }
+      function Qk(a, b, c, d) {
+        this.tag = a;
+        this.key = c;
+        this.sibling =
+          this.child =
+          this.return =
+          this.stateNode =
+          this.type =
+          this.elementType =
+            null;
+        this.index = 0;
+        this.ref = null;
+        this.pendingProps = b;
+        this.dependencies =
+          this.memoizedState =
+          this.updateQueue =
+          this.memoizedProps =
+            null;
+        this.mode = d;
+        this.subtreeFlags = this.flags = 0;
+        this.deletions = null;
+        this.childLanes = this.lanes = 0;
+        this.alternate = null;
+      }
+      function ah(a, b, c, d) {
+        return new Qk(a, b, c, d);
+      }
+      function aj(a) {
+        a = a.prototype;
+        return !(!a || !a.isReactComponent);
+      }
+      function Pk(a) {
+        if (typeof a === "function") return aj(a) ? 1 : 0;
+        if (a !== void 0 && a !== null) {
+          a = a.$$typeof;
+          if (a === Ba) return 11;
+          if (a === Ea) return 14;
+        }
+        return 2;
+      }
+      function mh(a, b) {
+        var c = a.alternate;
+        c === null
+          ? ((c = ah(a.tag, b, a.key, a.mode)),
+            (c.elementType = a.elementType),
+            (c.type = a.type),
+            (c.stateNode = a.stateNode),
+            (c.alternate = a),
+            (a.alternate = c))
+          : ((c.pendingProps = b),
+            (c.type = a.type),
+            (c.flags = 0),
+            (c.subtreeFlags = 0),
+            (c.deletions = null));
+        c.flags = a.flags & 14680064;
+        c.childLanes = a.childLanes;
+        c.lanes = a.lanes;
+        c.child = a.child;
+        c.memoizedProps = a.memoizedProps;
+        c.memoizedState = a.memoizedState;
+        c.updateQueue = a.updateQueue;
+        b = a.dependencies;
+        c.dependencies =
+          b === null ? null : { lanes: b.lanes, firstContext: b.firstContext };
+        c.sibling = a.sibling;
+        c.index = a.index;
+        c.ref = a.ref;
+        return c;
+      }
+      function oh(a, b, c, d, e, f) {
+        var g = 2;
+        d = a;
+        if (typeof a === "function") aj(a) && (g = 1);
+        else if (typeof a === "string") g = 5;
+        else
+          a: switch (a) {
+            case va:
+              return qh(c.children, e, f, b);
+            case wa:
+              g = 8;
+              e |= 8;
+              break;
+            case xa:
+              return (
+                (a = ah(12, c, b, e | 2)),
+                (a.elementType = xa),
+                (a.lanes = f),
+                a
+              );
+            case Ca:
+              return (
+                (a = ah(13, c, b, e)), (a.elementType = Ca), (a.lanes = f), a
+              );
+            case Da:
+              return (
+                (a = ah(19, c, b, e)), (a.elementType = Da), (a.lanes = f), a
+              );
+            case Ga:
+              return nj(c, e, f, b);
+            default:
+              if (typeof a === "object" && a !== null)
+                switch (a.$$typeof) {
+                  case ya:
+                    g = 10;
+                    break a;
+                  case Aa:
+                    g = 9;
+                    break a;
+                  case Ba:
+                    g = 11;
+                    break a;
+                  case Ea:
+                    g = 14;
+                    break a;
+                  case Fa:
+                    g = 16;
+                    d = null;
+                    break a;
+                }
+              throw Error(p$1(130, a == null ? a : typeof a, ""));
+          }
+        b = ah(g, c, b, e);
+        b.elementType = a;
+        b.type = d;
+        b.lanes = f;
+        return b;
+      }
+      function qh(a, b, c, d) {
+        a = ah(7, a, d, b);
+        a.lanes = c;
+        return a;
+      }
+      function nj(a, b, c, d) {
+        a = ah(22, a, d, b);
+        a.elementType = Ga;
+        a.lanes = c;
+        a.stateNode = {};
+        return a;
+      }
+      function nh(a, b, c) {
+        a = ah(6, a, null, b);
+        a.lanes = c;
+        return a;
+      }
+      function ph(a, b, c) {
+        b = ah(4, a.children !== null ? a.children : [], a.key, b);
+        b.lanes = c;
+        b.stateNode = {
+          containerInfo: a.containerInfo,
+          pendingChildren: null,
+          implementation: a.implementation,
+        };
+        return b;
+      }
+      function Rk(a, b, c, d, e) {
+        this.tag = b;
+        this.containerInfo = a;
+        this.finishedWork =
+          this.pingCache =
+          this.current =
+          this.pendingChildren =
+            null;
+        this.timeoutHandle = -1;
+        this.callbackNode = this.pendingContext = this.context = null;
+        this.callbackPriority = 0;
+        this.eventTimes = vc(0);
+        this.expirationTimes = vc(-1);
+        this.entangledLanes =
+          this.finishedLanes =
+          this.mutableReadLanes =
+          this.expiredLanes =
+          this.pingedLanes =
+          this.suspendedLanes =
+          this.pendingLanes =
+            0;
+        this.entanglements = vc(0);
+        this.identifierPrefix = d;
+        this.onRecoverableError = e;
+        this.mutableSourceEagerHydrationData = null;
+      }
+      function Sk(a, b, c, d, e, f, g, h, k) {
+        a = new Rk(a, b, c, h, k);
+        b === 1 ? ((b = 1), f === true && (b |= 8)) : (b = 0);
+        f = ah(3, null, null, b);
+        a.current = f;
+        f.stateNode = a;
+        f.memoizedState = {
+          element: d,
+          isDehydrated: c,
+          cache: null,
+          transitions: null,
+        };
+        sg(f);
+        return a;
+      }
+      function Tk(a, b, c) {
+        var d =
+          3 < arguments.length && arguments[3] !== void 0 ? arguments[3] : null;
+        return {
+          $$typeof: ua,
+          key: d == null ? null : "" + d,
+          children: a,
+          containerInfo: b,
+          implementation: c,
+        };
+      }
+      function Uk(a) {
+        if (!a) return Pf;
+        a = a._reactInternals;
+        a: {
+          if (Sb(a) !== a || a.tag !== 1) throw Error(p$1(170));
+          var b = a;
+          do {
+            switch (b.tag) {
+              case 3:
+                b = b.stateNode.context;
+                break a;
+              case 1:
+                if (Tf(b.type)) {
+                  b = b.stateNode.__reactInternalMemoizedMergedChildContext;
+                  break a;
+                }
+            }
+            b = b.return;
+          } while (b !== null);
+          throw Error(p$1(171));
+        }
+        if (a.tag === 1) {
+          var c = a.type;
+          if (Tf(c)) return Wf(a, c, b);
+        }
+        return b;
+      }
+      function Vk(a, b, c, d, e, f, g, h, k) {
+        a = Sk(c, d, true, a, e, f, g, h, k);
+        a.context = Uk(null);
+        c = a.current;
+        d = M();
+        e = Dg(c);
+        f = ug(d, e);
+        f.callback = b !== void 0 && b !== null ? b : null;
+        vg(c, f);
+        a.current.lanes = e;
+        wc(a, e, d);
+        tk(a, d);
+        return a;
+      }
+      function Wk(a, b, c, d) {
+        var e = b.current,
+          f = M(),
+          g = Dg(e);
+        c = Uk(c);
+        b.context === null ? (b.context = c) : (b.pendingContext = c);
+        b = ug(f, g);
+        b.payload = { element: a };
+        d = d === void 0 ? null : d;
+        d !== null && (b.callback = d);
+        vg(e, b);
+        a = Eg(e, g, f);
+        a !== null && wg(a, e, g);
+        return g;
+      }
+      function Xk(a) {
+        a = a.current;
+        if (!a.child) return null;
+        switch (a.child.tag) {
+          case 5:
+            return a.child.stateNode;
+          default:
+            return a.child.stateNode;
+        }
+      }
+      function Yk(a, b) {
+        a = a.memoizedState;
+        if (a !== null && a.dehydrated !== null) {
+          var c = a.retryLane;
+          a.retryLane = c !== 0 && c < b ? c : b;
+        }
+      }
+      function Zk(a, b) {
+        Yk(a, b);
+        (a = a.alternate) && Yk(a, b);
+      }
+      function $k() {
+        return null;
+      }
+      var al =
+        typeof reportError === "function"
+          ? reportError
+          : function (a) {
+              console.error(a);
+            };
+      function bl(a) {
+        this._internalRoot = a;
+      }
+      cl.prototype.render = bl.prototype.render = function (a) {
+        var b = this._internalRoot;
+        if (b === null) throw Error(p$1(409));
+        Wk(a, b, null, null);
+      };
+      cl.prototype.unmount = bl.prototype.unmount = function () {
+        var a = this._internalRoot;
+        if (a !== null) {
+          this._internalRoot = null;
+          var b = a.containerInfo;
+          Hk(function () {
+            Wk(null, a, null, null);
+          });
+          b[pf] = null;
+        }
+      };
+      function cl(a) {
+        this._internalRoot = a;
+      }
+      cl.prototype.unstable_scheduleHydration = function (a) {
+        if (a) {
+          var b = Dc();
+          a = { blockedOn: null, target: a, priority: b };
+          for (var c = 0; c < Mc.length && b !== 0 && b < Mc[c].priority; c++);
+          Mc.splice(c, 0, a);
+          c === 0 && Rc(a);
+        }
+      };
+      function dl(a) {
+        return !(
+          !a ||
+          (a.nodeType !== 1 && a.nodeType !== 9 && a.nodeType !== 11)
+        );
+      }
+      function el$1(a) {
+        return !(
+          !a ||
+          (a.nodeType !== 1 &&
+            a.nodeType !== 9 &&
+            a.nodeType !== 11 &&
+            (a.nodeType !== 8 ||
+              a.nodeValue !== " react-mount-point-unstable "))
+        );
+      }
+      function fl() {}
+      function gl$1(a, b, c, d, e) {
+        if (e) {
+          if (typeof d === "function") {
+            var f = d;
+            d = function () {
+              var a2 = Xk(g);
+              f.call(a2);
+            };
+          }
+          var g = Vk(b, d, a, 0, null, false, false, "", fl);
+          a._reactRootContainer = g;
+          a[pf] = g.current;
+          nf(a.nodeType === 8 ? a.parentNode : a);
+          Hk();
+          return g;
+        }
+        for (; (e = a.lastChild); ) a.removeChild(e);
+        if (typeof d === "function") {
+          var h = d;
+          d = function () {
+            var a2 = Xk(k);
+            h.call(a2);
+          };
+        }
+        var k = Sk(a, 0, false, null, null, false, false, "", fl);
+        a._reactRootContainer = k;
+        a[pf] = k.current;
+        nf(a.nodeType === 8 ? a.parentNode : a);
+        Hk(function () {
+          Wk(b, k, c, d);
+        });
+        return k;
+      }
+      function hl(a, b, c, d, e) {
+        var f = c._reactRootContainer;
+        if (f) {
+          var g = f;
+          if (typeof e === "function") {
+            var h = e;
+            e = function () {
+              var a2 = Xk(g);
+              h.call(a2);
+            };
+          }
+          Wk(b, g, a, e);
+        } else g = gl$1(c, b, a, e, d);
+        return Xk(g);
+      }
+      Ac = function (a) {
+        switch (a.tag) {
+          case 3:
+            var b = a.stateNode;
+            if (b.current.memoizedState.isDehydrated) {
+              var c = qc(b.pendingLanes);
+              c !== 0 &&
+                (yc(b, c | 1),
+                tk(b, D()),
+                (K & 6) === 0 && ((Ti = D() + 500), dg()));
+            }
+            break;
+          case 13:
+            var d = M();
+            Hk(function () {
+              return Eg(a, 1, d);
+            });
+            Zk(a, 1);
+        }
+      };
+      Bc = function (a) {
+        if (a.tag === 13) {
+          var b = M();
+          Eg(a, 134217728, b);
+          Zk(a, 134217728);
+        }
+      };
+      Cc = function (a) {
+        if (a.tag === 13) {
+          var b = M(),
+            c = Dg(a);
+          Eg(a, c, b);
+          Zk(a, c);
+        }
+      };
+      Dc = function () {
+        return E;
+      };
+      Ec = function (a, b) {
+        var c = E;
+        try {
+          return (E = a), b();
+        } finally {
+          E = c;
+        }
+      };
+      vb = function (a, b, c) {
+        switch (b) {
+          case "input":
+            Za(a, c);
+            b = c.name;
+            if (c.type === "radio" && b != null) {
+              for (c = a; c.parentNode; ) c = c.parentNode;
+              c = c.querySelectorAll(
+                "input[name=" + JSON.stringify("" + b) + '][type="radio"]'
+              );
+              for (b = 0; b < c.length; b++) {
+                var d = c[b];
+                if (d !== a && d.form === a.form) {
+                  var e = Ab(d);
+                  if (!e) throw Error(p$1(90));
+                  Ua(d);
+                  Za(d, e);
+                }
+              }
+            }
+            break;
+          case "textarea":
+            fb(a, c);
+            break;
+          case "select":
+            (b = c.value), b != null && cb(a, !!c.multiple, b, false);
+        }
+      };
+      Db = Gk;
+      Eb = Hk;
+      var il = {
+          usingClientEntryPoint: false,
+          Events: [zb, pe, Ab, Bb, Cb, Gk],
+        },
+        jl = {
+          findFiberByHostInstance: Sc$1,
+          bundleType: 0,
+          version: "18.0.0-fc46dba67-20220329",
+          rendererPackageName: "react-dom",
+        };
+      var kl = {
+        bundleType: jl.bundleType,
+        version: jl.version,
+        rendererPackageName: jl.rendererPackageName,
+        rendererConfig: jl.rendererConfig,
+        overrideHookState: null,
+        overrideHookStateDeletePath: null,
+        overrideHookStateRenamePath: null,
+        overrideProps: null,
+        overridePropsDeletePath: null,
+        overridePropsRenamePath: null,
+        setErrorHandler: null,
+        setSuspenseHandler: null,
+        scheduleUpdate: null,
+        currentDispatcherRef: sa.ReactCurrentDispatcher,
+        findHostInstanceByFiber: function (a) {
+          a = Wb(a);
+          return a === null ? null : a.stateNode;
+        },
+        findFiberByHostInstance: jl.findFiberByHostInstance || $k,
+        findHostInstancesForRefresh: null,
+        scheduleRefresh: null,
+        scheduleRoot: null,
+        setRefreshHandler: null,
+        getCurrentFiber: null,
+        reconcilerVersion: "18.0.0-fc46dba67-20220329",
+      };
+      if (typeof __REACT_DEVTOOLS_GLOBAL_HOOK__ !== "undefined") {
+        var ll$1 = __REACT_DEVTOOLS_GLOBAL_HOOK__;
+        if (!ll$1.isDisabled && ll$1.supportsFiber)
+          try {
+            (hc = ll$1.inject(kl)), (ic$1 = ll$1);
+          } catch (a) {}
+      }
+      reactDom_production_min.__SECRET_INTERNALS_DO_NOT_USE_OR_YOU_WILL_BE_FIRED =
+        il;
+      reactDom_production_min.createPortal = function (a, b) {
+        var c =
+          2 < arguments.length && arguments[2] !== void 0 ? arguments[2] : null;
+        if (!dl(b)) throw Error(p$1(200));
+        return Tk(a, b, null, c);
+      };
+      reactDom_production_min.createRoot = function (a, b) {
+        if (!dl(a)) throw Error(p$1(299));
+        var c = false,
+          d = "",
+          e = al;
+        b !== null &&
+          b !== void 0 &&
+          (b.unstable_strictMode === true && (c = true),
+          b.identifierPrefix !== void 0 && (d = b.identifierPrefix),
+          b.onRecoverableError !== void 0 && (e = b.onRecoverableError));
+        b = Sk(a, 1, false, null, null, c, false, d, e);
+        a[pf] = b.current;
+        nf(a.nodeType === 8 ? a.parentNode : a);
+        return new bl(b);
+      };
+      reactDom_production_min.findDOMNode = function (a) {
+        if (a == null) return null;
+        if (a.nodeType === 1) return a;
+        var b = a._reactInternals;
+        if (b === void 0) {
+          if (typeof a.render === "function") throw Error(p$1(188));
+          a = Object.keys(a).join(",");
+          throw Error(p$1(268, a));
+        }
+        a = Wb(b);
+        a = a === null ? null : a.stateNode;
+        return a;
+      };
+      reactDom_production_min.flushSync = function (a) {
+        return Hk(a);
+      };
+      reactDom_production_min.hydrate = function (a, b, c) {
+        if (!el$1(b)) throw Error(p$1(200));
+        return hl(null, a, b, true, c);
+      };
+      reactDom_production_min.hydrateRoot = function (a, b, c) {
+        if (!dl(a)) throw Error(p$1(405));
+        var d = (c != null && c.hydratedSources) || null,
+          e = false,
+          f = "",
+          g = al;
+        c !== null &&
+          c !== void 0 &&
+          (c.unstable_strictMode === true && (e = true),
+          c.identifierPrefix !== void 0 && (f = c.identifierPrefix),
+          c.onRecoverableError !== void 0 && (g = c.onRecoverableError));
+        b = Vk(b, null, a, 1, c != null ? c : null, e, false, f, g);
+        a[pf] = b.current;
+        nf(a);
+        if (d)
+          for (a = 0; a < d.length; a++)
+            (c = d[a]),
+              (e = c._getVersion),
+              (e = e(c._source)),
+              b.mutableSourceEagerHydrationData == null
+                ? (b.mutableSourceEagerHydrationData = [c, e])
+                : b.mutableSourceEagerHydrationData.push(c, e);
+        return new cl(b);
+      };
+      reactDom_production_min.render = function (a, b, c) {
+        if (!el$1(b)) throw Error(p$1(200));
+        return hl(null, a, b, false, c);
+      };
+      reactDom_production_min.unmountComponentAtNode = function (a) {
+        if (!el$1(a)) throw Error(p$1(40));
+        return a._reactRootContainer
+          ? (Hk(function () {
+              hl(null, null, a, false, function () {
+                a._reactRootContainer = null;
+                a[pf] = null;
+              });
+            }),
+            true)
+          : false;
+      };
+      reactDom_production_min.unstable_batchedUpdates = Gk;
+      reactDom_production_min.unstable_renderSubtreeIntoContainer = function (
+        a,
+        b,
+        c,
+        d
+      ) {
+        if (!el$1(c)) throw Error(p$1(200));
+        if (a == null || a._reactInternals === void 0) throw Error(p$1(38));
+        return hl(a, b, c, false, d);
+      };
+      reactDom_production_min.version = "18.0.0-fc46dba67-20220329";
+      function checkDCE() {
+        if (
+          typeof __REACT_DEVTOOLS_GLOBAL_HOOK__ === "undefined" ||
+          typeof __REACT_DEVTOOLS_GLOBAL_HOOK__.checkDCE !== "function"
+        ) {
+          return;
+        }
+        try {
+          __REACT_DEVTOOLS_GLOBAL_HOOK__.checkDCE(checkDCE);
+        } catch (err) {
+          console.error(err);
+        }
+      }
+      {
+        checkDCE();
+        reactDom.exports = reactDom_production_min;
+      }
+      var ReactDOM = reactDom.exports;
+      var toggleSelection = function () {
+        var selection = document.getSelection();
+        if (!selection.rangeCount) {
+          return function () {};
+        }
+        var active = document.activeElement;
+        var ranges = [];
+        for (var i = 0; i < selection.rangeCount; i++) {
+          ranges.push(selection.getRangeAt(i));
+        }
+        switch (active.tagName.toUpperCase()) {
+          case "INPUT":
+          case "TEXTAREA":
+            active.blur();
+            break;
+          default:
+            active = null;
+            break;
+        }
+        selection.removeAllRanges();
+        return function () {
+          selection.type === "Caret" && selection.removeAllRanges();
+          if (!selection.rangeCount) {
+            ranges.forEach(function (range2) {
+              selection.addRange(range2);
+            });
+          }
+          active && active.focus();
+        };
+      };
+      var deselectCurrent = toggleSelection;
+      var clipboardToIE11Formatting = {
+        "text/plain": "Text",
+        "text/html": "Url",
+        default: "Text",
+      };
+      var defaultMessage = "Copy to clipboard: #{key}, Enter";
+      function format$1(message) {
+        var copyKey =
+          (/mac os x/i.test(navigator.userAgent) ? "\u2318" : "Ctrl") + "+C";
+        return message.replace(/#{\s*key\s*}/g, copyKey);
+      }
+      function copy$1(text3, options) {
+        var debug,
+          message,
+          reselectPrevious,
+          range2,
+          selection,
+          mark,
+          success = false;
+        if (!options) {
+          options = {};
+        }
+        debug = options.debug || false;
+        try {
+          reselectPrevious = deselectCurrent();
+          range2 = document.createRange();
+          selection = document.getSelection();
+          mark = document.createElement("span");
+          mark.textContent = text3;
+          mark.style.all = "unset";
+          mark.style.position = "fixed";
+          mark.style.top = 0;
+          mark.style.clip = "rect(0, 0, 0, 0)";
+          mark.style.whiteSpace = "pre";
+          mark.style.webkitUserSelect = "text";
+          mark.style.MozUserSelect = "text";
+          mark.style.msUserSelect = "text";
+          mark.style.userSelect = "text";
+          mark.addEventListener("copy", function (e) {
+            e.stopPropagation();
+            if (options.format) {
+              e.preventDefault();
+              if (typeof e.clipboardData === "undefined") {
+                debug && console.warn("unable to use e.clipboardData");
+                debug && console.warn("trying IE specific stuff");
+                window.clipboardData.clearData();
+                var format3 =
+                  clipboardToIE11Formatting[options.format] ||
+                  clipboardToIE11Formatting["default"];
+                window.clipboardData.setData(format3, text3);
+              } else {
+                e.clipboardData.clearData();
+                e.clipboardData.setData(options.format, text3);
+              }
+            }
+            if (options.onCopy) {
+              e.preventDefault();
+              options.onCopy(e.clipboardData);
+            }
+          });
+          document.body.appendChild(mark);
+          range2.selectNodeContents(mark);
+          selection.addRange(range2);
+          var successful = document.execCommand("copy");
+          if (!successful) {
+            throw new Error("copy command was unsuccessful");
+          }
+          success = true;
+        } catch (err) {
+          debug && console.error("unable to copy using execCommand: ", err);
+          debug && console.warn("trying IE specific stuff");
+          try {
+            window.clipboardData.setData(options.format || "text", text3);
+            options.onCopy && options.onCopy(window.clipboardData);
+            success = true;
+          } catch (err2) {
+            debug &&
+              console.error("unable to copy using clipboardData: ", err2);
+            debug && console.error("falling back to prompt");
+            message = format$1(
+              "message" in options ? options.message : defaultMessage
+            );
+            window.prompt(message, text3);
+          }
+        } finally {
+          if (selection) {
+            if (typeof selection.removeRange == "function") {
+              selection.removeRange(range2);
+            } else {
+              selection.removeAllRanges();
+            }
+          }
+          if (mark) {
+            document.body.removeChild(mark);
+          }
+          reselectPrevious();
+        }
+        return success;
+      }
+      var copyToClipboard = copy$1;
+      const version = "16.4.0";
+      const versionInfo = Object.freeze({
+        major: 16,
+        minor: 4,
+        patch: 0,
+        preReleaseTag: null,
+      });
+      function devAssert$1(condition, message) {
+        const booleanCondition = Boolean(condition);
+        if (!booleanCondition) {
+          throw new Error(message);
+        }
+      }
+      function isPromise$2(value) {
+        return (
+          typeof (value === null || value === void 0 ? void 0 : value.then) ===
+          "function"
+        );
+      }
+      function isObjectLike$1(value) {
+        return typeof value == "object" && value !== null;
+      }
+      function invariant$2(condition, message) {
+        const booleanCondition = Boolean(condition);
+        if (!booleanCondition) {
+          throw new Error(
+            message != null ? message : "Unexpected invariant triggered."
+          );
+        }
+      }
+      const LineRegExp = /\r\n|[\n\r]/g;
+      function getLocation$1(source, position) {
+        let lastLineStart = 0;
+        let line = 1;
+        for (const match2 of source.body.matchAll(LineRegExp)) {
+          typeof match2.index === "number" || invariant$2(false);
+          if (match2.index >= position) {
+            break;
+          }
+          lastLineStart = match2.index + match2[0].length;
+          line += 1;
+        }
+        return {
+          line,
+          column: position + 1 - lastLineStart,
+        };
+      }
+      function printLocation(location2) {
+        return printSourceLocation(
+          location2.source,
+          getLocation$1(location2.source, location2.start)
+        );
+      }
+      function printSourceLocation(source, sourceLocation) {
+        const firstLineColumnOffset = source.locationOffset.column - 1;
+        const body = "".padStart(firstLineColumnOffset) + source.body;
+        const lineIndex = sourceLocation.line - 1;
+        const lineOffset = source.locationOffset.line - 1;
+        const lineNum = sourceLocation.line + lineOffset;
+        const columnOffset =
+          sourceLocation.line === 1 ? firstLineColumnOffset : 0;
+        const columnNum = sourceLocation.column + columnOffset;
+        const locationStr = `${source.name}:${lineNum}:${columnNum}
+`;
+        const lines = body.split(/\r\n|[\n\r]/g);
+        const locationLine = lines[lineIndex];
+        if (locationLine.length > 120) {
+          const subLineIndex = Math.floor(columnNum / 80);
+          const subLineColumnNum = columnNum % 80;
+          const subLines = [];
+          for (let i = 0; i < locationLine.length; i += 80) {
+            subLines.push(locationLine.slice(i, i + 80));
+          }
+          return (
+            locationStr +
+            printPrefixedLines([
+              [`${lineNum} |`, subLines[0]],
+              ...subLines
+                .slice(1, subLineIndex + 1)
+                .map((subLine) => ["|", subLine]),
+              ["|", "^".padStart(subLineColumnNum)],
+              ["|", subLines[subLineIndex + 1]],
+            ])
+          );
+        }
+        return (
+          locationStr +
+          printPrefixedLines([
+            [`${lineNum - 1} |`, lines[lineIndex - 1]],
+            [`${lineNum} |`, locationLine],
+            ["|", "^".padStart(columnNum)],
+            [`${lineNum + 1} |`, lines[lineIndex + 1]],
+          ])
+        );
+      }
+      function printPrefixedLines(lines) {
+        const existingLines = lines.filter(([_, line]) => line !== void 0);
+        const padLen = Math.max(
+          ...existingLines.map(([prefix]) => prefix.length)
+        );
+        return existingLines
+          .map(
+            ([prefix, line]) =>
+              prefix.padStart(padLen) + (line ? " " + line : "")
+          )
+          .join("\n");
+      }
+      function toNormalizedArgs(args) {
+        const firstArg = args[0];
+        if (firstArg == null || "kind" in firstArg || "length" in firstArg) {
+          return {
+            nodes: firstArg,
+            source: args[1],
+            positions: args[2],
+            path: args[3],
+            originalError: args[4],
+            extensions: args[5],
+          };
+        }
+        return firstArg;
+      }
+      class GraphQLError extends Error {
+        constructor(message, ...rawArgs) {
+          var _this$nodes, _nodeLocations$, _ref;
+          const { nodes, source, positions, path, originalError, extensions } =
+            toNormalizedArgs(rawArgs);
+          super(message);
+          this.name = "GraphQLError";
+          this.path = path !== null && path !== void 0 ? path : void 0;
+          this.originalError =
+            originalError !== null && originalError !== void 0
+              ? originalError
+              : void 0;
+          this.nodes = undefinedIfEmpty(
+            Array.isArray(nodes) ? nodes : nodes ? [nodes] : void 0
+          );
+          const nodeLocations = undefinedIfEmpty(
+            (_this$nodes = this.nodes) === null || _this$nodes === void 0
+              ? void 0
+              : _this$nodes.map((node) => node.loc).filter((loc) => loc != null)
+          );
+          this.source =
+            source !== null && source !== void 0
+              ? source
+              : nodeLocations === null || nodeLocations === void 0
+              ? void 0
+              : (_nodeLocations$ = nodeLocations[0]) === null ||
+                _nodeLocations$ === void 0
+              ? void 0
+              : _nodeLocations$.source;
+          this.positions =
+            positions !== null && positions !== void 0
+              ? positions
+              : nodeLocations === null || nodeLocations === void 0
+              ? void 0
+              : nodeLocations.map((loc) => loc.start);
+          this.locations =
+            positions && source
+              ? positions.map((pos) => getLocation$1(source, pos))
+              : nodeLocations === null || nodeLocations === void 0
+              ? void 0
+              : nodeLocations.map((loc) =>
+                  getLocation$1(loc.source, loc.start)
+                );
+          const originalExtensions = isObjectLike$1(
+            originalError === null || originalError === void 0
+              ? void 0
+              : originalError.extensions
+          )
+            ? originalError === null || originalError === void 0
+              ? void 0
+              : originalError.extensions
+            : void 0;
+          this.extensions =
+            (_ref =
+              extensions !== null && extensions !== void 0
+                ? extensions
+                : originalExtensions) !== null && _ref !== void 0
+              ? _ref
+              : /* @__PURE__ */ Object.create(null);
+          Object.defineProperties(this, {
+            message: {
+              writable: true,
+              enumerable: true,
+            },
+            name: {
+              enumerable: false,
+            },
+            nodes: {
+              enumerable: false,
+            },
+            source: {
+              enumerable: false,
+            },
+            positions: {
+              enumerable: false,
+            },
+            originalError: {
+              enumerable: false,
+            },
+          });
+          if (
+            originalError !== null &&
+            originalError !== void 0 &&
+            originalError.stack
+          ) {
+            Object.defineProperty(this, "stack", {
+              value: originalError.stack,
+              writable: true,
+              configurable: true,
+            });
+          } else if (Error.captureStackTrace) {
+            Error.captureStackTrace(this, GraphQLError);
+          } else {
+            Object.defineProperty(this, "stack", {
+              value: Error().stack,
+              writable: true,
+              configurable: true,
+            });
+          }
+        }
+        get [Symbol.toStringTag]() {
+          return "GraphQLError";
+        }
+        toString() {
+          let output = this.message;
+          if (this.nodes) {
+            for (const node of this.nodes) {
+              if (node.loc) {
+                output += "\n\n" + printLocation(node.loc);
+              }
+            }
+          } else if (this.source && this.locations) {
+            for (const location2 of this.locations) {
+              output += "\n\n" + printSourceLocation(this.source, location2);
+            }
+          }
+          return output;
+        }
+        toJSON() {
+          const formattedError = {
+            message: this.message,
+          };
+          if (this.locations != null) {
+            formattedError.locations = this.locations;
+          }
+          if (this.path != null) {
+            formattedError.path = this.path;
+          }
+          if (
+            this.extensions != null &&
+            Object.keys(this.extensions).length > 0
+          ) {
+            formattedError.extensions = this.extensions;
+          }
+          return formattedError;
+        }
+      }
+      function undefinedIfEmpty(array) {
+        return array === void 0 || array.length === 0 ? void 0 : array;
+      }
+      function printError(error2) {
+        return error2.toString();
+      }
+      function formatError$1(error2) {
+        return error2.toJSON();
+      }
+      function syntaxError$1(source, position, description) {
+        return new GraphQLError(`Syntax Error: ${description}`, {
+          source,
+          positions: [position],
+        });
+      }
+      class Location$1 {
+        constructor(startToken, endToken, source) {
+          this.start = startToken.start;
+          this.end = endToken.end;
+          this.startToken = startToken;
+          this.endToken = endToken;
+          this.source = source;
+        }
+        get [Symbol.toStringTag]() {
+          return "Location";
+        }
+        toJSON() {
+          return {
+            start: this.start,
+            end: this.end,
+          };
+        }
+      }
+      class Token$4 {
+        constructor(kind2, start2, end2, line, column, value) {
+          this.kind = kind2;
+          this.start = start2;
+          this.end = end2;
+          this.line = line;
+          this.column = column;
+          this.value = value;
+          this.prev = null;
+          this.next = null;
+        }
+        get [Symbol.toStringTag]() {
+          return "Token";
+        }
+        toJSON() {
+          return {
+            kind: this.kind,
+            value: this.value,
+            line: this.line,
+            column: this.column,
+          };
+        }
+      }
+      const QueryDocumentKeys = {
+        Name: [],
+        Document: ["definitions"],
+        OperationDefinition: [
+          "name",
+          "variableDefinitions",
+          "directives",
+          "selectionSet",
+        ],
+        VariableDefinition: ["variable", "type", "defaultValue", "directives"],
+        Variable: ["name"],
+        SelectionSet: ["selections"],
+        Field: ["alias", "name", "arguments", "directives", "selectionSet"],
+        Argument: ["name", "value"],
+        FragmentSpread: ["name", "directives"],
+        InlineFragment: ["typeCondition", "directives", "selectionSet"],
+        FragmentDefinition: [
+          "name",
+          "variableDefinitions",
+          "typeCondition",
+          "directives",
+          "selectionSet",
+        ],
+        IntValue: [],
+        FloatValue: [],
+        StringValue: [],
+        BooleanValue: [],
+        NullValue: [],
+        EnumValue: [],
+        ListValue: ["values"],
+        ObjectValue: ["fields"],
+        ObjectField: ["name", "value"],
+        Directive: ["name", "arguments"],
+        NamedType: ["name"],
+        ListType: ["type"],
+        NonNullType: ["type"],
+        SchemaDefinition: ["description", "directives", "operationTypes"],
+        OperationTypeDefinition: ["type"],
+        ScalarTypeDefinition: ["description", "name", "directives"],
+        ObjectTypeDefinition: [
+          "description",
+          "name",
+          "interfaces",
+          "directives",
+          "fields",
+        ],
+        FieldDefinition: [
+          "description",
+          "name",
+          "arguments",
+          "type",
+          "directives",
+        ],
+        InputValueDefinition: [
+          "description",
+          "name",
+          "type",
+          "defaultValue",
+          "directives",
+        ],
+        InterfaceTypeDefinition: [
+          "description",
+          "name",
+          "interfaces",
+          "directives",
+          "fields",
+        ],
+        UnionTypeDefinition: ["description", "name", "directives", "types"],
+        EnumTypeDefinition: ["description", "name", "directives", "values"],
+        EnumValueDefinition: ["description", "name", "directives"],
+        InputObjectTypeDefinition: [
+          "description",
+          "name",
+          "directives",
+          "fields",
+        ],
+        DirectiveDefinition: ["description", "name", "arguments", "locations"],
+        SchemaExtension: ["directives", "operationTypes"],
+        ScalarTypeExtension: ["name", "directives"],
+        ObjectTypeExtension: ["name", "interfaces", "directives", "fields"],
+        InterfaceTypeExtension: ["name", "interfaces", "directives", "fields"],
+        UnionTypeExtension: ["name", "directives", "types"],
+        EnumTypeExtension: ["name", "directives", "values"],
+        InputObjectTypeExtension: ["name", "directives", "fields"],
+      };
+      const kindValues = new Set(Object.keys(QueryDocumentKeys));
+      function isNode(maybeNode) {
+        const maybeKind =
+          maybeNode === null || maybeNode === void 0 ? void 0 : maybeNode.kind;
+        return typeof maybeKind === "string" && kindValues.has(maybeKind);
+      }
+      let OperationTypeNode;
+      (function (OperationTypeNode2) {
+        OperationTypeNode2["QUERY"] = "query";
+        OperationTypeNode2["MUTATION"] = "mutation";
+        OperationTypeNode2["SUBSCRIPTION"] = "subscription";
+      })(OperationTypeNode || (OperationTypeNode = {}));
+      let DirectiveLocation;
+      (function (DirectiveLocation2) {
+        DirectiveLocation2["QUERY"] = "QUERY";
+        DirectiveLocation2["MUTATION"] = "MUTATION";
+        DirectiveLocation2["SUBSCRIPTION"] = "SUBSCRIPTION";
+        DirectiveLocation2["FIELD"] = "FIELD";
+        DirectiveLocation2["FRAGMENT_DEFINITION"] = "FRAGMENT_DEFINITION";
+        DirectiveLocation2["FRAGMENT_SPREAD"] = "FRAGMENT_SPREAD";
+        DirectiveLocation2["INLINE_FRAGMENT"] = "INLINE_FRAGMENT";
+        DirectiveLocation2["VARIABLE_DEFINITION"] = "VARIABLE_DEFINITION";
+        DirectiveLocation2["SCHEMA"] = "SCHEMA";
+        DirectiveLocation2["SCALAR"] = "SCALAR";
+        DirectiveLocation2["OBJECT"] = "OBJECT";
+        DirectiveLocation2["FIELD_DEFINITION"] = "FIELD_DEFINITION";
+        DirectiveLocation2["ARGUMENT_DEFINITION"] = "ARGUMENT_DEFINITION";
+        DirectiveLocation2["INTERFACE"] = "INTERFACE";
+        DirectiveLocation2["UNION"] = "UNION";
+        DirectiveLocation2["ENUM"] = "ENUM";
+        DirectiveLocation2["ENUM_VALUE"] = "ENUM_VALUE";
+        DirectiveLocation2["INPUT_OBJECT"] = "INPUT_OBJECT";
+        DirectiveLocation2["INPUT_FIELD_DEFINITION"] = "INPUT_FIELD_DEFINITION";
+      })(DirectiveLocation || (DirectiveLocation = {}));
+      let Kind;
+      (function (Kind2) {
+        Kind2["NAME"] = "Name";
+        Kind2["DOCUMENT"] = "Document";
+        Kind2["OPERATION_DEFINITION"] = "OperationDefinition";
+        Kind2["VARIABLE_DEFINITION"] = "VariableDefinition";
+        Kind2["SELECTION_SET"] = "SelectionSet";
+        Kind2["FIELD"] = "Field";
+        Kind2["ARGUMENT"] = "Argument";
+        Kind2["FRAGMENT_SPREAD"] = "FragmentSpread";
+        Kind2["INLINE_FRAGMENT"] = "InlineFragment";
+        Kind2["FRAGMENT_DEFINITION"] = "FragmentDefinition";
+        Kind2["VARIABLE"] = "Variable";
+        Kind2["INT"] = "IntValue";
+        Kind2["FLOAT"] = "FloatValue";
+        Kind2["STRING"] = "StringValue";
+        Kind2["BOOLEAN"] = "BooleanValue";
+        Kind2["NULL"] = "NullValue";
+        Kind2["ENUM"] = "EnumValue";
+        Kind2["LIST"] = "ListValue";
+        Kind2["OBJECT"] = "ObjectValue";
+        Kind2["OBJECT_FIELD"] = "ObjectField";
+        Kind2["DIRECTIVE"] = "Directive";
+        Kind2["NAMED_TYPE"] = "NamedType";
+        Kind2["LIST_TYPE"] = "ListType";
+        Kind2["NON_NULL_TYPE"] = "NonNullType";
+        Kind2["SCHEMA_DEFINITION"] = "SchemaDefinition";
+        Kind2["OPERATION_TYPE_DEFINITION"] = "OperationTypeDefinition";
+        Kind2["SCALAR_TYPE_DEFINITION"] = "ScalarTypeDefinition";
+        Kind2["OBJECT_TYPE_DEFINITION"] = "ObjectTypeDefinition";
+        Kind2["FIELD_DEFINITION"] = "FieldDefinition";
+        Kind2["INPUT_VALUE_DEFINITION"] = "InputValueDefinition";
+        Kind2["INTERFACE_TYPE_DEFINITION"] = "InterfaceTypeDefinition";
+        Kind2["UNION_TYPE_DEFINITION"] = "UnionTypeDefinition";
+        Kind2["ENUM_TYPE_DEFINITION"] = "EnumTypeDefinition";
+        Kind2["ENUM_VALUE_DEFINITION"] = "EnumValueDefinition";
+        Kind2["INPUT_OBJECT_TYPE_DEFINITION"] = "InputObjectTypeDefinition";
+        Kind2["DIRECTIVE_DEFINITION"] = "DirectiveDefinition";
+        Kind2["SCHEMA_EXTENSION"] = "SchemaExtension";
+        Kind2["SCALAR_TYPE_EXTENSION"] = "ScalarTypeExtension";
+        Kind2["OBJECT_TYPE_EXTENSION"] = "ObjectTypeExtension";
+        Kind2["INTERFACE_TYPE_EXTENSION"] = "InterfaceTypeExtension";
+        Kind2["UNION_TYPE_EXTENSION"] = "UnionTypeExtension";
+        Kind2["ENUM_TYPE_EXTENSION"] = "EnumTypeExtension";
+        Kind2["INPUT_OBJECT_TYPE_EXTENSION"] = "InputObjectTypeExtension";
+      })(Kind || (Kind = {}));
+      function isWhiteSpace$2(code3) {
+        return code3 === 9 || code3 === 32;
+      }
+      function isDigit$2(code3) {
+        return code3 >= 48 && code3 <= 57;
+      }
+      function isLetter$1(code3) {
+        return (code3 >= 97 && code3 <= 122) || (code3 >= 65 && code3 <= 90);
+      }
+      function isNameStart(code3) {
+        return isLetter$1(code3) || code3 === 95;
+      }
+      function isNameContinue(code3) {
+        return isLetter$1(code3) || isDigit$2(code3) || code3 === 95;
+      }
+      function dedentBlockStringLines(lines) {
+        var _firstNonEmptyLine2;
+        let commonIndent = Number.MAX_SAFE_INTEGER;
+        let firstNonEmptyLine = null;
+        let lastNonEmptyLine = -1;
+        for (let i = 0; i < lines.length; ++i) {
+          var _firstNonEmptyLine;
+          const line = lines[i];
+          const indent2 = leadingWhitespace$1(line);
+          if (indent2 === line.length) {
+            continue;
+          }
+          firstNonEmptyLine =
+            (_firstNonEmptyLine = firstNonEmptyLine) !== null &&
+            _firstNonEmptyLine !== void 0
+              ? _firstNonEmptyLine
+              : i;
+          lastNonEmptyLine = i;
+          if (i !== 0 && indent2 < commonIndent) {
+            commonIndent = indent2;
+          }
+        }
+        return lines
+          .map((line, i) => (i === 0 ? line : line.slice(commonIndent)))
+          .slice(
+            (_firstNonEmptyLine2 = firstNonEmptyLine) !== null &&
+              _firstNonEmptyLine2 !== void 0
+              ? _firstNonEmptyLine2
+              : 0,
+            lastNonEmptyLine + 1
+          );
+      }
+      function leadingWhitespace$1(str) {
+        let i = 0;
+        while (i < str.length && isWhiteSpace$2(str.charCodeAt(i))) {
+          ++i;
+        }
+        return i;
+      }
+      function isPrintableAsBlockString(value) {
+        if (value === "") {
+          return true;
+        }
+        let isEmptyLine = true;
+        let hasIndent = false;
+        let hasCommonIndent = true;
+        let seenNonEmptyLine = false;
+        for (let i = 0; i < value.length; ++i) {
+          switch (value.codePointAt(i)) {
+            case 0:
+            case 1:
+            case 2:
+            case 3:
+            case 4:
+            case 5:
+            case 6:
+            case 7:
+            case 8:
+            case 11:
+            case 12:
+            case 14:
+            case 15:
+              return false;
+            case 13:
+              return false;
+            case 10:
+              if (isEmptyLine && !seenNonEmptyLine) {
+                return false;
+              }
+              seenNonEmptyLine = true;
+              isEmptyLine = true;
+              hasIndent = false;
+              break;
+            case 9:
+            case 32:
+              hasIndent || (hasIndent = isEmptyLine);
+              break;
+            default:
+              hasCommonIndent && (hasCommonIndent = hasIndent);
+              isEmptyLine = false;
+          }
+        }
+        if (isEmptyLine) {
+          return false;
+        }
+        if (hasCommonIndent && seenNonEmptyLine) {
+          return false;
+        }
+        return true;
+      }
+      function printBlockString$1(value, options) {
+        const escapedValue = value.replace(/"""/g, '\\"""');
+        const lines = escapedValue.split(/\r\n|[\n\r]/g);
+        const isSingleLine = lines.length === 1;
+        const forceLeadingNewLine =
+          lines.length > 1 &&
+          lines
+            .slice(1)
+            .every(
+              (line) => line.length === 0 || isWhiteSpace$2(line.charCodeAt(0))
+            );
+        const hasTrailingTripleQuotes = escapedValue.endsWith('\\"""');
+        const hasTrailingQuote =
+          value.endsWith('"') && !hasTrailingTripleQuotes;
+        const hasTrailingSlash = value.endsWith("\\");
+        const forceTrailingNewline = hasTrailingQuote || hasTrailingSlash;
+        const printAsMultipleLines =
+          !(options !== null && options !== void 0 && options.minimize) &&
+          (!isSingleLine ||
+            value.length > 70 ||
+            forceTrailingNewline ||
+            forceLeadingNewLine ||
+            hasTrailingTripleQuotes);
+        let result2 = "";
+        const skipLeadingNewLine =
+          isSingleLine && isWhiteSpace$2(value.charCodeAt(0));
+        if (
+          (printAsMultipleLines && !skipLeadingNewLine) ||
+          forceLeadingNewLine
+        ) {
+          result2 += "\n";
+        }
+        result2 += escapedValue;
+        if (printAsMultipleLines || forceTrailingNewline) {
+          result2 += "\n";
+        }
+        return '"""' + result2 + '"""';
+      }
+      let TokenKind;
+      (function (TokenKind2) {
+        TokenKind2["SOF"] = "<SOF>";
+        TokenKind2["EOF"] = "<EOF>";
+        TokenKind2["BANG"] = "!";
+        TokenKind2["DOLLAR"] = "$";
+        TokenKind2["AMP"] = "&";
+        TokenKind2["PAREN_L"] = "(";
+        TokenKind2["PAREN_R"] = ")";
+        TokenKind2["SPREAD"] = "...";
+        TokenKind2["COLON"] = ":";
+        TokenKind2["EQUALS"] = "=";
+        TokenKind2["AT"] = "@";
+        TokenKind2["BRACKET_L"] = "[";
+        TokenKind2["BRACKET_R"] = "]";
+        TokenKind2["BRACE_L"] = "{";
+        TokenKind2["PIPE"] = "|";
+        TokenKind2["BRACE_R"] = "}";
+        TokenKind2["NAME"] = "Name";
+        TokenKind2["INT"] = "Int";
+        TokenKind2["FLOAT"] = "Float";
+        TokenKind2["STRING"] = "String";
+        TokenKind2["BLOCK_STRING"] = "BlockString";
+        TokenKind2["COMMENT"] = "Comment";
+      })(TokenKind || (TokenKind = {}));
+      class Lexer {
+        constructor(source) {
+          const startOfFileToken = new Token$4(TokenKind.SOF, 0, 0, 0, 0);
+          this.source = source;
+          this.lastToken = startOfFileToken;
+          this.token = startOfFileToken;
+          this.line = 1;
+          this.lineStart = 0;
+        }
+        get [Symbol.toStringTag]() {
+          return "Lexer";
+        }
+        advance() {
+          this.lastToken = this.token;
+          const token2 = (this.token = this.lookahead());
+          return token2;
+        }
+        lookahead() {
+          let token2 = this.token;
+          if (token2.kind !== TokenKind.EOF) {
+            do {
+              if (token2.next) {
+                token2 = token2.next;
+              } else {
+                const nextToken = readNextToken(this, token2.end);
+                token2.next = nextToken;
+                nextToken.prev = token2;
+                token2 = nextToken;
+              }
+            } while (token2.kind === TokenKind.COMMENT);
+          }
+          return token2;
+        }
+      }
+      function isPunctuatorTokenKind(kind2) {
+        return (
+          kind2 === TokenKind.BANG ||
+          kind2 === TokenKind.DOLLAR ||
+          kind2 === TokenKind.AMP ||
+          kind2 === TokenKind.PAREN_L ||
+          kind2 === TokenKind.PAREN_R ||
+          kind2 === TokenKind.SPREAD ||
+          kind2 === TokenKind.COLON ||
+          kind2 === TokenKind.EQUALS ||
+          kind2 === TokenKind.AT ||
+          kind2 === TokenKind.BRACKET_L ||
+          kind2 === TokenKind.BRACKET_R ||
+          kind2 === TokenKind.BRACE_L ||
+          kind2 === TokenKind.PIPE ||
+          kind2 === TokenKind.BRACE_R
+        );
+      }
+      function isUnicodeScalarValue(code3) {
+        return (
+          (code3 >= 0 && code3 <= 55295) || (code3 >= 57344 && code3 <= 1114111)
+        );
+      }
+      function isSupplementaryCodePoint(body, location2) {
+        return (
+          isLeadingSurrogate(body.charCodeAt(location2)) &&
+          isTrailingSurrogate(body.charCodeAt(location2 + 1))
+        );
+      }
+      function isLeadingSurrogate(code3) {
+        return code3 >= 55296 && code3 <= 56319;
+      }
+      function isTrailingSurrogate(code3) {
+        return code3 >= 56320 && code3 <= 57343;
+      }
+      function printCodePointAt(lexer, location2) {
+        const code3 = lexer.source.body.codePointAt(location2);
+        if (code3 === void 0) {
+          return TokenKind.EOF;
+        } else if (code3 >= 32 && code3 <= 126) {
+          const char = String.fromCodePoint(code3);
+          return char === '"' ? `'"'` : `"${char}"`;
+        }
+        return "U+" + code3.toString(16).toUpperCase().padStart(4, "0");
+      }
+      function createToken(lexer, kind2, start2, end2, value) {
+        const line = lexer.line;
+        const col = 1 + start2 - lexer.lineStart;
+        return new Token$4(kind2, start2, end2, line, col, value);
+      }
+      function readNextToken(lexer, start2) {
+        const body = lexer.source.body;
+        const bodyLength = body.length;
+        let position = start2;
+        while (position < bodyLength) {
+          const code3 = body.charCodeAt(position);
+          switch (code3) {
+            case 65279:
+            case 9:
+            case 32:
+            case 44:
+              ++position;
+              continue;
+            case 10:
+              ++position;
+              ++lexer.line;
+              lexer.lineStart = position;
+              continue;
+            case 13:
+              if (body.charCodeAt(position + 1) === 10) {
+                position += 2;
+              } else {
+                ++position;
+              }
+              ++lexer.line;
+              lexer.lineStart = position;
+              continue;
+            case 35:
+              return readComment(lexer, position);
+            case 33:
+              return createToken(lexer, TokenKind.BANG, position, position + 1);
+            case 36:
+              return createToken(
+                lexer,
+                TokenKind.DOLLAR,
+                position,
+                position + 1
+              );
+            case 38:
+              return createToken(lexer, TokenKind.AMP, position, position + 1);
+            case 40:
+              return createToken(
+                lexer,
+                TokenKind.PAREN_L,
+                position,
+                position + 1
+              );
+            case 41:
+              return createToken(
+                lexer,
+                TokenKind.PAREN_R,
+                position,
+                position + 1
+              );
+            case 46:
+              if (
+                body.charCodeAt(position + 1) === 46 &&
+                body.charCodeAt(position + 2) === 46
+              ) {
+                return createToken(
+                  lexer,
+                  TokenKind.SPREAD,
+                  position,
+                  position + 3
+                );
+              }
+              break;
+            case 58:
+              return createToken(
+                lexer,
+                TokenKind.COLON,
+                position,
+                position + 1
+              );
+            case 61:
+              return createToken(
+                lexer,
+                TokenKind.EQUALS,
+                position,
+                position + 1
+              );
+            case 64:
+              return createToken(lexer, TokenKind.AT, position, position + 1);
+            case 91:
+              return createToken(
+                lexer,
+                TokenKind.BRACKET_L,
+                position,
+                position + 1
+              );
+            case 93:
+              return createToken(
+                lexer,
+                TokenKind.BRACKET_R,
+                position,
+                position + 1
+              );
+            case 123:
+              return createToken(
+                lexer,
+                TokenKind.BRACE_L,
+                position,
+                position + 1
+              );
+            case 124:
+              return createToken(lexer, TokenKind.PIPE, position, position + 1);
+            case 125:
+              return createToken(
+                lexer,
+                TokenKind.BRACE_R,
+                position,
+                position + 1
+              );
+            case 34:
+              if (
+                body.charCodeAt(position + 1) === 34 &&
+                body.charCodeAt(position + 2) === 34
+              ) {
+                return readBlockString(lexer, position);
+              }
+              return readString$1(lexer, position);
+          }
+          if (isDigit$2(code3) || code3 === 45) {
+            return readNumber$1(lexer, position, code3);
+          }
+          if (isNameStart(code3)) {
+            return readName(lexer, position);
+          }
+          throw syntaxError$1(
+            lexer.source,
+            position,
+            code3 === 39
+              ? `Unexpected single quote character ('), did you mean to use a double quote (")?`
+              : isUnicodeScalarValue(code3) ||
+                isSupplementaryCodePoint(body, position)
+              ? `Unexpected character: ${printCodePointAt(lexer, position)}.`
+              : `Invalid character: ${printCodePointAt(lexer, position)}.`
+          );
+        }
+        return createToken(lexer, TokenKind.EOF, bodyLength, bodyLength);
+      }
+      function readComment(lexer, start2) {
+        const body = lexer.source.body;
+        const bodyLength = body.length;
+        let position = start2 + 1;
+        while (position < bodyLength) {
+          const code3 = body.charCodeAt(position);
+          if (code3 === 10 || code3 === 13) {
+            break;
+          }
+          if (isUnicodeScalarValue(code3)) {
+            ++position;
+          } else if (isSupplementaryCodePoint(body, position)) {
+            position += 2;
+          } else {
+            break;
+          }
+        }
+        return createToken(
+          lexer,
+          TokenKind.COMMENT,
+          start2,
+          position,
+          body.slice(start2 + 1, position)
+        );
+      }
+      function readNumber$1(lexer, start2, firstCode) {
+        const body = lexer.source.body;
+        let position = start2;
+        let code3 = firstCode;
+        let isFloat = false;
+        if (code3 === 45) {
+          code3 = body.charCodeAt(++position);
+        }
+        if (code3 === 48) {
+          code3 = body.charCodeAt(++position);
+          if (isDigit$2(code3)) {
+            throw syntaxError$1(
+              lexer.source,
+              position,
+              `Invalid number, unexpected digit after 0: ${printCodePointAt(
+                lexer,
+                position
+              )}.`
+            );
+          }
+        } else {
+          position = readDigits$1(lexer, position, code3);
+          code3 = body.charCodeAt(position);
+        }
+        if (code3 === 46) {
+          isFloat = true;
+          code3 = body.charCodeAt(++position);
+          position = readDigits$1(lexer, position, code3);
+          code3 = body.charCodeAt(position);
+        }
+        if (code3 === 69 || code3 === 101) {
+          isFloat = true;
+          code3 = body.charCodeAt(++position);
+          if (code3 === 43 || code3 === 45) {
+            code3 = body.charCodeAt(++position);
+          }
+          position = readDigits$1(lexer, position, code3);
+          code3 = body.charCodeAt(position);
+        }
+        if (code3 === 46 || isNameStart(code3)) {
+          throw syntaxError$1(
+            lexer.source,
+            position,
+            `Invalid number, expected digit but got: ${printCodePointAt(
+              lexer,
+              position
+            )}.`
+          );
+        }
+        return createToken(
+          lexer,
+          isFloat ? TokenKind.FLOAT : TokenKind.INT,
+          start2,
+          position,
+          body.slice(start2, position)
+        );
+      }
+      function readDigits$1(lexer, start2, firstCode) {
+        if (!isDigit$2(firstCode)) {
+          throw syntaxError$1(
+            lexer.source,
+            start2,
+            `Invalid number, expected digit but got: ${printCodePointAt(
+              lexer,
+              start2
+            )}.`
+          );
+        }
+        const body = lexer.source.body;
+        let position = start2 + 1;
+        while (isDigit$2(body.charCodeAt(position))) {
+          ++position;
+        }
+        return position;
+      }
+      function readString$1(lexer, start2) {
+        const body = lexer.source.body;
+        const bodyLength = body.length;
+        let position = start2 + 1;
+        let chunkStart = position;
+        let value = "";
+        while (position < bodyLength) {
+          const code3 = body.charCodeAt(position);
+          if (code3 === 34) {
+            value += body.slice(chunkStart, position);
+            return createToken(
+              lexer,
+              TokenKind.STRING,
+              start2,
+              position + 1,
+              value
+            );
+          }
+          if (code3 === 92) {
+            value += body.slice(chunkStart, position);
+            const escape3 =
+              body.charCodeAt(position + 1) === 117
+                ? body.charCodeAt(position + 2) === 123
+                  ? readEscapedUnicodeVariableWidth(lexer, position)
+                  : readEscapedUnicodeFixedWidth(lexer, position)
+                : readEscapedCharacter(lexer, position);
+            value += escape3.value;
+            position += escape3.size;
+            chunkStart = position;
+            continue;
+          }
+          if (code3 === 10 || code3 === 13) {
+            break;
+          }
+          if (isUnicodeScalarValue(code3)) {
+            ++position;
+          } else if (isSupplementaryCodePoint(body, position)) {
+            position += 2;
+          } else {
+            throw syntaxError$1(
+              lexer.source,
+              position,
+              `Invalid character within String: ${printCodePointAt(
+                lexer,
+                position
+              )}.`
+            );
+          }
+        }
+        throw syntaxError$1(lexer.source, position, "Unterminated string.");
+      }
+      function readEscapedUnicodeVariableWidth(lexer, position) {
+        const body = lexer.source.body;
+        let point = 0;
+        let size = 3;
+        while (size < 12) {
+          const code3 = body.charCodeAt(position + size++);
+          if (code3 === 125) {
+            if (size < 5 || !isUnicodeScalarValue(point)) {
+              break;
+            }
+            return {
+              value: String.fromCodePoint(point),
+              size,
+            };
+          }
+          point = (point << 4) | readHexDigit(code3);
+          if (point < 0) {
+            break;
+          }
+        }
+        throw syntaxError$1(
+          lexer.source,
+          position,
+          `Invalid Unicode escape sequence: "${body.slice(
+            position,
+            position + size
+          )}".`
+        );
+      }
+      function readEscapedUnicodeFixedWidth(lexer, position) {
+        const body = lexer.source.body;
+        const code3 = read16BitHexCode(body, position + 2);
+        if (isUnicodeScalarValue(code3)) {
+          return {
+            value: String.fromCodePoint(code3),
+            size: 6,
+          };
+        }
+        if (isLeadingSurrogate(code3)) {
+          if (
+            body.charCodeAt(position + 6) === 92 &&
+            body.charCodeAt(position + 7) === 117
+          ) {
+            const trailingCode = read16BitHexCode(body, position + 8);
+            if (isTrailingSurrogate(trailingCode)) {
+              return {
+                value: String.fromCodePoint(code3, trailingCode),
+                size: 12,
+              };
+            }
+          }
+        }
+        throw syntaxError$1(
+          lexer.source,
+          position,
+          `Invalid Unicode escape sequence: "${body.slice(
+            position,
+            position + 6
+          )}".`
+        );
+      }
+      function read16BitHexCode(body, position) {
+        return (
+          (readHexDigit(body.charCodeAt(position)) << 12) |
+          (readHexDigit(body.charCodeAt(position + 1)) << 8) |
+          (readHexDigit(body.charCodeAt(position + 2)) << 4) |
+          readHexDigit(body.charCodeAt(position + 3))
+        );
+      }
+      function readHexDigit(code3) {
+        return code3 >= 48 && code3 <= 57
+          ? code3 - 48
+          : code3 >= 65 && code3 <= 70
+          ? code3 - 55
+          : code3 >= 97 && code3 <= 102
+          ? code3 - 87
+          : -1;
+      }
+      function readEscapedCharacter(lexer, position) {
+        const body = lexer.source.body;
+        const code3 = body.charCodeAt(position + 1);
+        switch (code3) {
+          case 34:
+            return {
+              value: '"',
+              size: 2,
+            };
+          case 92:
+            return {
+              value: "\\",
+              size: 2,
+            };
+          case 47:
+            return {
+              value: "/",
+              size: 2,
+            };
+          case 98:
+            return {
+              value: "\b",
+              size: 2,
+            };
+          case 102:
+            return {
+              value: "\f",
+              size: 2,
+            };
+          case 110:
+            return {
+              value: "\n",
+              size: 2,
+            };
+          case 114:
+            return {
+              value: "\r",
+              size: 2,
+            };
+          case 116:
+            return {
+              value: "	",
+              size: 2,
+            };
+        }
+        throw syntaxError$1(
+          lexer.source,
+          position,
+          `Invalid character escape sequence: "${body.slice(
+            position,
+            position + 2
+          )}".`
+        );
+      }
+      function readBlockString(lexer, start2) {
+        const body = lexer.source.body;
+        const bodyLength = body.length;
+        let lineStart = lexer.lineStart;
+        let position = start2 + 3;
+        let chunkStart = position;
+        let currentLine = "";
+        const blockLines = [];
+        while (position < bodyLength) {
+          const code3 = body.charCodeAt(position);
+          if (
+            code3 === 34 &&
+            body.charCodeAt(position + 1) === 34 &&
+            body.charCodeAt(position + 2) === 34
+          ) {
+            currentLine += body.slice(chunkStart, position);
+            blockLines.push(currentLine);
+            const token2 = createToken(
+              lexer,
+              TokenKind.BLOCK_STRING,
+              start2,
+              position + 3,
+              dedentBlockStringLines(blockLines).join("\n")
+            );
+            lexer.line += blockLines.length - 1;
+            lexer.lineStart = lineStart;
+            return token2;
+          }
+          if (
+            code3 === 92 &&
+            body.charCodeAt(position + 1) === 34 &&
+            body.charCodeAt(position + 2) === 34 &&
+            body.charCodeAt(position + 3) === 34
+          ) {
+            currentLine += body.slice(chunkStart, position);
+            chunkStart = position + 1;
+            position += 4;
+            continue;
+          }
+          if (code3 === 10 || code3 === 13) {
+            currentLine += body.slice(chunkStart, position);
+            blockLines.push(currentLine);
+            if (code3 === 13 && body.charCodeAt(position + 1) === 10) {
+              position += 2;
+            } else {
+              ++position;
+            }
+            currentLine = "";
+            chunkStart = position;
+            lineStart = position;
+            continue;
+          }
+          if (isUnicodeScalarValue(code3)) {
+            ++position;
+          } else if (isSupplementaryCodePoint(body, position)) {
+            position += 2;
+          } else {
+            throw syntaxError$1(
+              lexer.source,
+              position,
+              `Invalid character within String: ${printCodePointAt(
+                lexer,
+                position
+              )}.`
+            );
+          }
+        }
+        throw syntaxError$1(lexer.source, position, "Unterminated string.");
+      }
+      function readName(lexer, start2) {
+        const body = lexer.source.body;
+        const bodyLength = body.length;
+        let position = start2 + 1;
+        while (position < bodyLength) {
+          const code3 = body.charCodeAt(position);
+          if (isNameContinue(code3)) {
+            ++position;
+          } else {
+            break;
+          }
+        }
+        return createToken(
+          lexer,
+          TokenKind.NAME,
+          start2,
+          position,
+          body.slice(start2, position)
+        );
+      }
+      const MAX_ARRAY_LENGTH$1 = 10;
+      const MAX_RECURSIVE_DEPTH$2 = 2;
+      function inspect$2(value) {
+        return formatValue$2(value, []);
+      }
+      function formatValue$2(value, seenValues) {
+        switch (typeof value) {
+          case "string":
+            return JSON.stringify(value);
+          case "function":
+            return value.name ? `[function ${value.name}]` : "[function]";
+          case "object":
+            return formatObjectValue$2(value, seenValues);
+          default:
+            return String(value);
+        }
+      }
+      function formatObjectValue$2(value, previouslySeenValues) {
+        if (value === null) {
+          return "null";
+        }
+        if (previouslySeenValues.includes(value)) {
+          return "[Circular]";
+        }
+        const seenValues = [...previouslySeenValues, value];
+        if (isJSONable$2(value)) {
+          const jsonValue = value.toJSON();
+          if (jsonValue !== value) {
+            return typeof jsonValue === "string"
+              ? jsonValue
+              : formatValue$2(jsonValue, seenValues);
+          }
+        } else if (Array.isArray(value)) {
+          return formatArray$2(value, seenValues);
+        }
+        return formatObject$2(value, seenValues);
+      }
+      function isJSONable$2(value) {
+        return typeof value.toJSON === "function";
+      }
+      function formatObject$2(object, seenValues) {
+        const entries = Object.entries(object);
+        if (entries.length === 0) {
+          return "{}";
+        }
+        if (seenValues.length > MAX_RECURSIVE_DEPTH$2) {
+          return "[" + getObjectTag$2(object) + "]";
+        }
+        const properties = entries.map(
+          ([key, value]) => key + ": " + formatValue$2(value, seenValues)
+        );
+        return "{ " + properties.join(", ") + " }";
+      }
+      function formatArray$2(array, seenValues) {
+        if (array.length === 0) {
+          return "[]";
+        }
+        if (seenValues.length > MAX_RECURSIVE_DEPTH$2) {
+          return "[Array]";
+        }
+        const len = Math.min(MAX_ARRAY_LENGTH$1, array.length);
+        const remaining = array.length - len;
+        const items = [];
+        for (let i = 0; i < len; ++i) {
+          items.push(formatValue$2(array[i], seenValues));
+        }
+        if (remaining === 1) {
+          items.push("... 1 more item");
+        } else if (remaining > 1) {
+          items.push(`... ${remaining} more items`);
+        }
+        return "[" + items.join(", ") + "]";
+      }
+      function getObjectTag$2(object) {
+        const tag = Object.prototype.toString
+          .call(object)
+          .replace(/^\[object /, "")
+          .replace(/]$/, "");
+        if (tag === "Object" && typeof object.constructor === "function") {
+          const name2 = object.constructor.name;
+          if (typeof name2 === "string" && name2 !== "") {
+            return name2;
+          }
+        }
+        return tag;
+      }
+      const instanceOf = function instanceOf2(value, constructor) {
+        return value instanceof constructor;
+      };
+      class Source {
+        constructor(
+          body,
+          name2 = "GraphQL request",
+          locationOffset = {
+            line: 1,
+            column: 1,
+          }
+        ) {
+          typeof body === "string" ||
+            devAssert$1(
+              false,
+              `Body must be a string. Received: ${inspect$2(body)}.`
+            );
+          this.body = body;
+          this.name = name2;
+          this.locationOffset = locationOffset;
+          this.locationOffset.line > 0 ||
+            devAssert$1(
+              false,
+              "line in locationOffset is 1-indexed and must be positive."
+            );
+          this.locationOffset.column > 0 ||
+            devAssert$1(
+              false,
+              "column in locationOffset is 1-indexed and must be positive."
+            );
+        }
+        get [Symbol.toStringTag]() {
+          return "Source";
+        }
+      }
+      function isSource(source) {
+        return instanceOf(source, Source);
+      }
+      function parse$1(source, options) {
+        const parser = new Parser(source, options);
+        return parser.parseDocument();
+      }
+      function parseValue$1(source, options) {
+        const parser = new Parser(source, options);
+        parser.expectToken(TokenKind.SOF);
+        const value = parser.parseValueLiteral(false);
+        parser.expectToken(TokenKind.EOF);
+        return value;
+      }
+      function parseConstValue(source, options) {
+        const parser = new Parser(source, options);
+        parser.expectToken(TokenKind.SOF);
+        const value = parser.parseConstValueLiteral();
+        parser.expectToken(TokenKind.EOF);
+        return value;
+      }
+      function parseType(source, options) {
+        const parser = new Parser(source, options);
+        parser.expectToken(TokenKind.SOF);
+        const type2 = parser.parseTypeReference();
+        parser.expectToken(TokenKind.EOF);
+        return type2;
+      }
+      class Parser {
+        constructor(source, options) {
+          const sourceObj = isSource(source) ? source : new Source(source);
+          this._lexer = new Lexer(sourceObj);
+          this._options = options;
+        }
+        parseName() {
+          const token2 = this.expectToken(TokenKind.NAME);
+          return this.node(token2, {
+            kind: Kind.NAME,
+            value: token2.value,
+          });
+        }
+        parseDocument() {
+          return this.node(this._lexer.token, {
+            kind: Kind.DOCUMENT,
+            definitions: this.many(
+              TokenKind.SOF,
+              this.parseDefinition,
+              TokenKind.EOF
+            ),
+          });
+        }
+        parseDefinition() {
+          if (this.peek(TokenKind.BRACE_L)) {
+            return this.parseOperationDefinition();
+          }
+          const hasDescription = this.peekDescription();
+          const keywordToken = hasDescription
+            ? this._lexer.lookahead()
+            : this._lexer.token;
+          if (keywordToken.kind === TokenKind.NAME) {
+            switch (keywordToken.value) {
+              case "schema":
+                return this.parseSchemaDefinition();
+              case "scalar":
+                return this.parseScalarTypeDefinition();
+              case "type":
+                return this.parseObjectTypeDefinition();
+              case "interface":
+                return this.parseInterfaceTypeDefinition();
+              case "union":
+                return this.parseUnionTypeDefinition();
+              case "enum":
+                return this.parseEnumTypeDefinition();
+              case "input":
+                return this.parseInputObjectTypeDefinition();
+              case "directive":
+                return this.parseDirectiveDefinition();
+            }
+            if (hasDescription) {
+              throw syntaxError$1(
+                this._lexer.source,
+                this._lexer.token.start,
+                "Unexpected description, descriptions are supported only on type definitions."
+              );
+            }
+            switch (keywordToken.value) {
+              case "query":
+              case "mutation":
+              case "subscription":
+                return this.parseOperationDefinition();
+              case "fragment":
+                return this.parseFragmentDefinition();
+              case "extend":
+                return this.parseTypeSystemExtension();
+            }
+          }
+          throw this.unexpected(keywordToken);
+        }
+        parseOperationDefinition() {
+          const start2 = this._lexer.token;
+          if (this.peek(TokenKind.BRACE_L)) {
+            return this.node(start2, {
+              kind: Kind.OPERATION_DEFINITION,
+              operation: OperationTypeNode.QUERY,
+              name: void 0,
+              variableDefinitions: [],
+              directives: [],
+              selectionSet: this.parseSelectionSet(),
+            });
+          }
+          const operation = this.parseOperationType();
+          let name2;
+          if (this.peek(TokenKind.NAME)) {
+            name2 = this.parseName();
+          }
+          return this.node(start2, {
+            kind: Kind.OPERATION_DEFINITION,
+            operation,
+            name: name2,
+            variableDefinitions: this.parseVariableDefinitions(),
+            directives: this.parseDirectives(false),
+            selectionSet: this.parseSelectionSet(),
+          });
+        }
+        parseOperationType() {
+          const operationToken = this.expectToken(TokenKind.NAME);
+          switch (operationToken.value) {
+            case "query":
+              return OperationTypeNode.QUERY;
+            case "mutation":
+              return OperationTypeNode.MUTATION;
+            case "subscription":
+              return OperationTypeNode.SUBSCRIPTION;
+          }
+          throw this.unexpected(operationToken);
+        }
+        parseVariableDefinitions() {
+          return this.optionalMany(
+            TokenKind.PAREN_L,
+            this.parseVariableDefinition,
+            TokenKind.PAREN_R
+          );
+        }
+        parseVariableDefinition() {
+          return this.node(this._lexer.token, {
+            kind: Kind.VARIABLE_DEFINITION,
+            variable: this.parseVariable(),
+            type:
+              (this.expectToken(TokenKind.COLON), this.parseTypeReference()),
+            defaultValue: this.expectOptionalToken(TokenKind.EQUALS)
+              ? this.parseConstValueLiteral()
+              : void 0,
+            directives: this.parseConstDirectives(),
+          });
+        }
+        parseVariable() {
+          const start2 = this._lexer.token;
+          this.expectToken(TokenKind.DOLLAR);
+          return this.node(start2, {
+            kind: Kind.VARIABLE,
+            name: this.parseName(),
+          });
+        }
+        parseSelectionSet() {
+          return this.node(this._lexer.token, {
+            kind: Kind.SELECTION_SET,
+            selections: this.many(
+              TokenKind.BRACE_L,
+              this.parseSelection,
+              TokenKind.BRACE_R
+            ),
+          });
+        }
+        parseSelection() {
+          return this.peek(TokenKind.SPREAD)
+            ? this.parseFragment()
+            : this.parseField();
+        }
+        parseField() {
+          const start2 = this._lexer.token;
+          const nameOrAlias = this.parseName();
+          let alias;
+          let name2;
+          if (this.expectOptionalToken(TokenKind.COLON)) {
+            alias = nameOrAlias;
+            name2 = this.parseName();
+          } else {
+            name2 = nameOrAlias;
+          }
+          return this.node(start2, {
+            kind: Kind.FIELD,
+            alias,
+            name: name2,
+            arguments: this.parseArguments(false),
+            directives: this.parseDirectives(false),
+            selectionSet: this.peek(TokenKind.BRACE_L)
+              ? this.parseSelectionSet()
+              : void 0,
+          });
+        }
+        parseArguments(isConst) {
+          const item = isConst ? this.parseConstArgument : this.parseArgument;
+          return this.optionalMany(TokenKind.PAREN_L, item, TokenKind.PAREN_R);
+        }
+        parseArgument(isConst = false) {
+          const start2 = this._lexer.token;
+          const name2 = this.parseName();
+          this.expectToken(TokenKind.COLON);
+          return this.node(start2, {
+            kind: Kind.ARGUMENT,
+            name: name2,
+            value: this.parseValueLiteral(isConst),
+          });
+        }
+        parseConstArgument() {
+          return this.parseArgument(true);
+        }
+        parseFragment() {
+          const start2 = this._lexer.token;
+          this.expectToken(TokenKind.SPREAD);
+          const hasTypeCondition = this.expectOptionalKeyword("on");
+          if (!hasTypeCondition && this.peek(TokenKind.NAME)) {
+            return this.node(start2, {
+              kind: Kind.FRAGMENT_SPREAD,
+              name: this.parseFragmentName(),
+              directives: this.parseDirectives(false),
+            });
+          }
+          return this.node(start2, {
+            kind: Kind.INLINE_FRAGMENT,
+            typeCondition: hasTypeCondition ? this.parseNamedType() : void 0,
+            directives: this.parseDirectives(false),
+            selectionSet: this.parseSelectionSet(),
+          });
+        }
+        parseFragmentDefinition() {
+          var _this$_options;
+          const start2 = this._lexer.token;
+          this.expectKeyword("fragment");
+          if (
+            ((_this$_options = this._options) === null ||
+            _this$_options === void 0
+              ? void 0
+              : _this$_options.allowLegacyFragmentVariables) === true
+          ) {
+            return this.node(start2, {
+              kind: Kind.FRAGMENT_DEFINITION,
+              name: this.parseFragmentName(),
+              variableDefinitions: this.parseVariableDefinitions(),
+              typeCondition: (this.expectKeyword("on"), this.parseNamedType()),
+              directives: this.parseDirectives(false),
+              selectionSet: this.parseSelectionSet(),
+            });
+          }
+          return this.node(start2, {
+            kind: Kind.FRAGMENT_DEFINITION,
+            name: this.parseFragmentName(),
+            typeCondition: (this.expectKeyword("on"), this.parseNamedType()),
+            directives: this.parseDirectives(false),
+            selectionSet: this.parseSelectionSet(),
+          });
+        }
+        parseFragmentName() {
+          if (this._lexer.token.value === "on") {
+            throw this.unexpected();
+          }
+          return this.parseName();
+        }
+        parseValueLiteral(isConst) {
+          const token2 = this._lexer.token;
+          switch (token2.kind) {
+            case TokenKind.BRACKET_L:
+              return this.parseList(isConst);
+            case TokenKind.BRACE_L:
+              return this.parseObject(isConst);
+            case TokenKind.INT:
+              this._lexer.advance();
+              return this.node(token2, {
+                kind: Kind.INT,
+                value: token2.value,
+              });
+            case TokenKind.FLOAT:
+              this._lexer.advance();
+              return this.node(token2, {
+                kind: Kind.FLOAT,
+                value: token2.value,
+              });
+            case TokenKind.STRING:
+            case TokenKind.BLOCK_STRING:
+              return this.parseStringLiteral();
+            case TokenKind.NAME:
+              this._lexer.advance();
+              switch (token2.value) {
+                case "true":
+                  return this.node(token2, {
+                    kind: Kind.BOOLEAN,
+                    value: true,
+                  });
+                case "false":
+                  return this.node(token2, {
+                    kind: Kind.BOOLEAN,
+                    value: false,
+                  });
+                case "null":
+                  return this.node(token2, {
+                    kind: Kind.NULL,
+                  });
+                default:
+                  return this.node(token2, {
+                    kind: Kind.ENUM,
+                    value: token2.value,
+                  });
+              }
+            case TokenKind.DOLLAR:
+              if (isConst) {
+                this.expectToken(TokenKind.DOLLAR);
+                if (this._lexer.token.kind === TokenKind.NAME) {
+                  const varName = this._lexer.token.value;
+                  throw syntaxError$1(
+                    this._lexer.source,
+                    token2.start,
+                    `Unexpected variable "$${varName}" in constant value.`
+                  );
+                } else {
+                  throw this.unexpected(token2);
+                }
+              }
+              return this.parseVariable();
+            default:
+              throw this.unexpected();
+          }
+        }
+        parseConstValueLiteral() {
+          return this.parseValueLiteral(true);
+        }
+        parseStringLiteral() {
+          const token2 = this._lexer.token;
+          this._lexer.advance();
+          return this.node(token2, {
+            kind: Kind.STRING,
+            value: token2.value,
+            block: token2.kind === TokenKind.BLOCK_STRING,
+          });
+        }
+        parseList(isConst) {
+          const item = () => this.parseValueLiteral(isConst);
+          return this.node(this._lexer.token, {
+            kind: Kind.LIST,
+            values: this.any(TokenKind.BRACKET_L, item, TokenKind.BRACKET_R),
+          });
+        }
+        parseObject(isConst) {
+          const item = () => this.parseObjectField(isConst);
+          return this.node(this._lexer.token, {
+            kind: Kind.OBJECT,
+            fields: this.any(TokenKind.BRACE_L, item, TokenKind.BRACE_R),
+          });
+        }
+        parseObjectField(isConst) {
+          const start2 = this._lexer.token;
+          const name2 = this.parseName();
+          this.expectToken(TokenKind.COLON);
+          return this.node(start2, {
+            kind: Kind.OBJECT_FIELD,
+            name: name2,
+            value: this.parseValueLiteral(isConst),
+          });
+        }
+        parseDirectives(isConst) {
+          const directives = [];
+          while (this.peek(TokenKind.AT)) {
+            directives.push(this.parseDirective(isConst));
+          }
+          return directives;
+        }
+        parseConstDirectives() {
+          return this.parseDirectives(true);
+        }
+        parseDirective(isConst) {
+          const start2 = this._lexer.token;
+          this.expectToken(TokenKind.AT);
+          return this.node(start2, {
+            kind: Kind.DIRECTIVE,
+            name: this.parseName(),
+            arguments: this.parseArguments(isConst),
+          });
+        }
+        parseTypeReference() {
+          const start2 = this._lexer.token;
+          let type2;
+          if (this.expectOptionalToken(TokenKind.BRACKET_L)) {
+            const innerType = this.parseTypeReference();
+            this.expectToken(TokenKind.BRACKET_R);
+            type2 = this.node(start2, {
+              kind: Kind.LIST_TYPE,
+              type: innerType,
+            });
+          } else {
+            type2 = this.parseNamedType();
+          }
+          if (this.expectOptionalToken(TokenKind.BANG)) {
+            return this.node(start2, {
+              kind: Kind.NON_NULL_TYPE,
+              type: type2,
+            });
+          }
+          return type2;
+        }
+        parseNamedType() {
+          return this.node(this._lexer.token, {
+            kind: Kind.NAMED_TYPE,
+            name: this.parseName(),
+          });
+        }
+        peekDescription() {
+          return (
+            this.peek(TokenKind.STRING) || this.peek(TokenKind.BLOCK_STRING)
+          );
+        }
+        parseDescription() {
+          if (this.peekDescription()) {
+            return this.parseStringLiteral();
+          }
+        }
+        parseSchemaDefinition() {
+          const start2 = this._lexer.token;
+          const description = this.parseDescription();
+          this.expectKeyword("schema");
+          const directives = this.parseConstDirectives();
+          const operationTypes = this.many(
+            TokenKind.BRACE_L,
+            this.parseOperationTypeDefinition,
+            TokenKind.BRACE_R
+          );
+          return this.node(start2, {
+            kind: Kind.SCHEMA_DEFINITION,
+            description,
+            directives,
+            operationTypes,
+          });
+        }
+        parseOperationTypeDefinition() {
+          const start2 = this._lexer.token;
+          const operation = this.parseOperationType();
+          this.expectToken(TokenKind.COLON);
+          const type2 = this.parseNamedType();
+          return this.node(start2, {
+            kind: Kind.OPERATION_TYPE_DEFINITION,
+            operation,
+            type: type2,
+          });
+        }
+        parseScalarTypeDefinition() {
+          const start2 = this._lexer.token;
+          const description = this.parseDescription();
+          this.expectKeyword("scalar");
+          const name2 = this.parseName();
+          const directives = this.parseConstDirectives();
+          return this.node(start2, {
+            kind: Kind.SCALAR_TYPE_DEFINITION,
+            description,
+            name: name2,
+            directives,
+          });
+        }
+        parseObjectTypeDefinition() {
+          const start2 = this._lexer.token;
+          const description = this.parseDescription();
+          this.expectKeyword("type");
+          const name2 = this.parseName();
+          const interfaces = this.parseImplementsInterfaces();
+          const directives = this.parseConstDirectives();
+          const fields = this.parseFieldsDefinition();
+          return this.node(start2, {
+            kind: Kind.OBJECT_TYPE_DEFINITION,
+            description,
+            name: name2,
+            interfaces,
+            directives,
+            fields,
+          });
+        }
+        parseImplementsInterfaces() {
+          return this.expectOptionalKeyword("implements")
+            ? this.delimitedMany(TokenKind.AMP, this.parseNamedType)
+            : [];
+        }
+        parseFieldsDefinition() {
+          return this.optionalMany(
+            TokenKind.BRACE_L,
+            this.parseFieldDefinition,
+            TokenKind.BRACE_R
+          );
+        }
+        parseFieldDefinition() {
+          const start2 = this._lexer.token;
+          const description = this.parseDescription();
+          const name2 = this.parseName();
+          const args = this.parseArgumentDefs();
+          this.expectToken(TokenKind.COLON);
+          const type2 = this.parseTypeReference();
+          const directives = this.parseConstDirectives();
+          return this.node(start2, {
+            kind: Kind.FIELD_DEFINITION,
+            description,
+            name: name2,
+            arguments: args,
+            type: type2,
+            directives,
+          });
+        }
+        parseArgumentDefs() {
+          return this.optionalMany(
+            TokenKind.PAREN_L,
+            this.parseInputValueDef,
+            TokenKind.PAREN_R
+          );
+        }
+        parseInputValueDef() {
+          const start2 = this._lexer.token;
+          const description = this.parseDescription();
+          const name2 = this.parseName();
+          this.expectToken(TokenKind.COLON);
+          const type2 = this.parseTypeReference();
+          let defaultValue2;
+          if (this.expectOptionalToken(TokenKind.EQUALS)) {
+            defaultValue2 = this.parseConstValueLiteral();
+          }
+          const directives = this.parseConstDirectives();
+          return this.node(start2, {
+            kind: Kind.INPUT_VALUE_DEFINITION,
+            description,
+            name: name2,
+            type: type2,
+            defaultValue: defaultValue2,
+            directives,
+          });
+        }
+        parseInterfaceTypeDefinition() {
+          const start2 = this._lexer.token;
+          const description = this.parseDescription();
+          this.expectKeyword("interface");
+          const name2 = this.parseName();
+          const interfaces = this.parseImplementsInterfaces();
+          const directives = this.parseConstDirectives();
+          const fields = this.parseFieldsDefinition();
+          return this.node(start2, {
+            kind: Kind.INTERFACE_TYPE_DEFINITION,
+            description,
+            name: name2,
+            interfaces,
+            directives,
+            fields,
+          });
+        }
+        parseUnionTypeDefinition() {
+          const start2 = this._lexer.token;
+          const description = this.parseDescription();
+          this.expectKeyword("union");
+          const name2 = this.parseName();
+          const directives = this.parseConstDirectives();
+          const types = this.parseUnionMemberTypes();
+          return this.node(start2, {
+            kind: Kind.UNION_TYPE_DEFINITION,
+            description,
+            name: name2,
+            directives,
+            types,
+          });
+        }
+        parseUnionMemberTypes() {
+          return this.expectOptionalToken(TokenKind.EQUALS)
+            ? this.delimitedMany(TokenKind.PIPE, this.parseNamedType)
+            : [];
+        }
+        parseEnumTypeDefinition() {
+          const start2 = this._lexer.token;
+          const description = this.parseDescription();
+          this.expectKeyword("enum");
+          const name2 = this.parseName();
+          const directives = this.parseConstDirectives();
+          const values = this.parseEnumValuesDefinition();
+          return this.node(start2, {
+            kind: Kind.ENUM_TYPE_DEFINITION,
+            description,
+            name: name2,
+            directives,
+            values,
+          });
+        }
+        parseEnumValuesDefinition() {
+          return this.optionalMany(
+            TokenKind.BRACE_L,
+            this.parseEnumValueDefinition,
+            TokenKind.BRACE_R
+          );
+        }
+        parseEnumValueDefinition() {
+          const start2 = this._lexer.token;
+          const description = this.parseDescription();
+          const name2 = this.parseEnumValueName();
+          const directives = this.parseConstDirectives();
+          return this.node(start2, {
+            kind: Kind.ENUM_VALUE_DEFINITION,
+            description,
+            name: name2,
+            directives,
+          });
+        }
+        parseEnumValueName() {
+          if (
+            this._lexer.token.value === "true" ||
+            this._lexer.token.value === "false" ||
+            this._lexer.token.value === "null"
+          ) {
+            throw syntaxError$1(
+              this._lexer.source,
+              this._lexer.token.start,
+              `${getTokenDesc(
+                this._lexer.token
+              )} is reserved and cannot be used for an enum value.`
+            );
+          }
+          return this.parseName();
+        }
+        parseInputObjectTypeDefinition() {
+          const start2 = this._lexer.token;
+          const description = this.parseDescription();
+          this.expectKeyword("input");
+          const name2 = this.parseName();
+          const directives = this.parseConstDirectives();
+          const fields = this.parseInputFieldsDefinition();
+          return this.node(start2, {
+            kind: Kind.INPUT_OBJECT_TYPE_DEFINITION,
+            description,
+            name: name2,
+            directives,
+            fields,
+          });
+        }
+        parseInputFieldsDefinition() {
+          return this.optionalMany(
+            TokenKind.BRACE_L,
+            this.parseInputValueDef,
+            TokenKind.BRACE_R
+          );
+        }
+        parseTypeSystemExtension() {
+          const keywordToken = this._lexer.lookahead();
+          if (keywordToken.kind === TokenKind.NAME) {
+            switch (keywordToken.value) {
+              case "schema":
+                return this.parseSchemaExtension();
+              case "scalar":
+                return this.parseScalarTypeExtension();
+              case "type":
+                return this.parseObjectTypeExtension();
+              case "interface":
+                return this.parseInterfaceTypeExtension();
+              case "union":
+                return this.parseUnionTypeExtension();
+              case "enum":
+                return this.parseEnumTypeExtension();
+              case "input":
+                return this.parseInputObjectTypeExtension();
+            }
+          }
+          throw this.unexpected(keywordToken);
+        }
+        parseSchemaExtension() {
+          const start2 = this._lexer.token;
+          this.expectKeyword("extend");
+          this.expectKeyword("schema");
+          const directives = this.parseConstDirectives();
+          const operationTypes = this.optionalMany(
+            TokenKind.BRACE_L,
+            this.parseOperationTypeDefinition,
+            TokenKind.BRACE_R
+          );
+          if (directives.length === 0 && operationTypes.length === 0) {
+            throw this.unexpected();
+          }
+          return this.node(start2, {
+            kind: Kind.SCHEMA_EXTENSION,
+            directives,
+            operationTypes,
+          });
+        }
+        parseScalarTypeExtension() {
+          const start2 = this._lexer.token;
+          this.expectKeyword("extend");
+          this.expectKeyword("scalar");
+          const name2 = this.parseName();
+          const directives = this.parseConstDirectives();
+          if (directives.length === 0) {
+            throw this.unexpected();
+          }
+          return this.node(start2, {
+            kind: Kind.SCALAR_TYPE_EXTENSION,
+            name: name2,
+            directives,
+          });
+        }
+        parseObjectTypeExtension() {
+          const start2 = this._lexer.token;
+          this.expectKeyword("extend");
+          this.expectKeyword("type");
+          const name2 = this.parseName();
+          const interfaces = this.parseImplementsInterfaces();
+          const directives = this.parseConstDirectives();
+          const fields = this.parseFieldsDefinition();
+          if (
+            interfaces.length === 0 &&
+            directives.length === 0 &&
+            fields.length === 0
+          ) {
+            throw this.unexpected();
+          }
+          return this.node(start2, {
+            kind: Kind.OBJECT_TYPE_EXTENSION,
+            name: name2,
+            interfaces,
+            directives,
+            fields,
+          });
+        }
+        parseInterfaceTypeExtension() {
+          const start2 = this._lexer.token;
+          this.expectKeyword("extend");
+          this.expectKeyword("interface");
+          const name2 = this.parseName();
+          const interfaces = this.parseImplementsInterfaces();
+          const directives = this.parseConstDirectives();
+          const fields = this.parseFieldsDefinition();
+          if (
+            interfaces.length === 0 &&
+            directives.length === 0 &&
+            fields.length === 0
+          ) {
+            throw this.unexpected();
+          }
+          return this.node(start2, {
+            kind: Kind.INTERFACE_TYPE_EXTENSION,
+            name: name2,
+            interfaces,
+            directives,
+            fields,
+          });
+        }
+        parseUnionTypeExtension() {
+          const start2 = this._lexer.token;
+          this.expectKeyword("extend");
+          this.expectKeyword("union");
+          const name2 = this.parseName();
+          const directives = this.parseConstDirectives();
+          const types = this.parseUnionMemberTypes();
+          if (directives.length === 0 && types.length === 0) {
+            throw this.unexpected();
+          }
+          return this.node(start2, {
+            kind: Kind.UNION_TYPE_EXTENSION,
+            name: name2,
+            directives,
+            types,
+          });
+        }
+        parseEnumTypeExtension() {
+          const start2 = this._lexer.token;
+          this.expectKeyword("extend");
+          this.expectKeyword("enum");
+          const name2 = this.parseName();
+          const directives = this.parseConstDirectives();
+          const values = this.parseEnumValuesDefinition();
+          if (directives.length === 0 && values.length === 0) {
+            throw this.unexpected();
+          }
+          return this.node(start2, {
+            kind: Kind.ENUM_TYPE_EXTENSION,
+            name: name2,
+            directives,
+            values,
+          });
+        }
+        parseInputObjectTypeExtension() {
+          const start2 = this._lexer.token;
+          this.expectKeyword("extend");
+          this.expectKeyword("input");
+          const name2 = this.parseName();
+          const directives = this.parseConstDirectives();
+          const fields = this.parseInputFieldsDefinition();
+          if (directives.length === 0 && fields.length === 0) {
+            throw this.unexpected();
+          }
+          return this.node(start2, {
+            kind: Kind.INPUT_OBJECT_TYPE_EXTENSION,
+            name: name2,
+            directives,
+            fields,
+          });
+        }
+        parseDirectiveDefinition() {
+          const start2 = this._lexer.token;
+          const description = this.parseDescription();
+          this.expectKeyword("directive");
+          this.expectToken(TokenKind.AT);
+          const name2 = this.parseName();
+          const args = this.parseArgumentDefs();
+          const repeatable = this.expectOptionalKeyword("repeatable");
+          this.expectKeyword("on");
+          const locations = this.parseDirectiveLocations();
+          return this.node(start2, {
+            kind: Kind.DIRECTIVE_DEFINITION,
+            description,
+            name: name2,
+            arguments: args,
+            repeatable,
+            locations,
+          });
+        }
+        parseDirectiveLocations() {
+          return this.delimitedMany(
+            TokenKind.PIPE,
+            this.parseDirectiveLocation
+          );
+        }
+        parseDirectiveLocation() {
+          const start2 = this._lexer.token;
+          const name2 = this.parseName();
+          if (
+            Object.prototype.hasOwnProperty.call(DirectiveLocation, name2.value)
+          ) {
+            return name2;
+          }
+          throw this.unexpected(start2);
+        }
+        node(startToken, node) {
+          var _this$_options2;
+          if (
+            ((_this$_options2 = this._options) === null ||
+            _this$_options2 === void 0
+              ? void 0
+              : _this$_options2.noLocation) !== true
+          ) {
+            node.loc = new Location$1(
+              startToken,
+              this._lexer.lastToken,
+              this._lexer.source
+            );
+          }
+          return node;
+        }
+        peek(kind2) {
+          return this._lexer.token.kind === kind2;
+        }
+        expectToken(kind2) {
+          const token2 = this._lexer.token;
+          if (token2.kind === kind2) {
+            this._lexer.advance();
+            return token2;
+          }
+          throw syntaxError$1(
+            this._lexer.source,
+            token2.start,
+            `Expected ${getTokenKindDesc(kind2)}, found ${getTokenDesc(
+              token2
+            )}.`
+          );
+        }
+        expectOptionalToken(kind2) {
+          const token2 = this._lexer.token;
+          if (token2.kind === kind2) {
+            this._lexer.advance();
+            return true;
+          }
+          return false;
+        }
+        expectKeyword(value) {
+          const token2 = this._lexer.token;
+          if (token2.kind === TokenKind.NAME && token2.value === value) {
+            this._lexer.advance();
+          } else {
+            throw syntaxError$1(
+              this._lexer.source,
+              token2.start,
+              `Expected "${value}", found ${getTokenDesc(token2)}.`
+            );
+          }
+        }
+        expectOptionalKeyword(value) {
+          const token2 = this._lexer.token;
+          if (token2.kind === TokenKind.NAME && token2.value === value) {
+            this._lexer.advance();
+            return true;
+          }
+          return false;
+        }
+        unexpected(atToken) {
+          const token2 =
+            atToken !== null && atToken !== void 0
+              ? atToken
+              : this._lexer.token;
+          return syntaxError$1(
+            this._lexer.source,
+            token2.start,
+            `Unexpected ${getTokenDesc(token2)}.`
+          );
+        }
+        any(openKind, parseFn, closeKind) {
+          this.expectToken(openKind);
+          const nodes = [];
+          while (!this.expectOptionalToken(closeKind)) {
+            nodes.push(parseFn.call(this));
+          }
+          return nodes;
+        }
+        optionalMany(openKind, parseFn, closeKind) {
+          if (this.expectOptionalToken(openKind)) {
+            const nodes = [];
+            do {
+              nodes.push(parseFn.call(this));
+            } while (!this.expectOptionalToken(closeKind));
+            return nodes;
+          }
+          return [];
+        }
+        many(openKind, parseFn, closeKind) {
+          this.expectToken(openKind);
+          const nodes = [];
+          do {
+            nodes.push(parseFn.call(this));
+          } while (!this.expectOptionalToken(closeKind));
+          return nodes;
+        }
+        delimitedMany(delimiterKind, parseFn) {
+          this.expectOptionalToken(delimiterKind);
+          const nodes = [];
+          do {
+            nodes.push(parseFn.call(this));
+          } while (this.expectOptionalToken(delimiterKind));
+          return nodes;
+        }
+      }
+      function getTokenDesc(token2) {
+        const value = token2.value;
+        return (
+          getTokenKindDesc(token2.kind) + (value != null ? ` "${value}"` : "")
+        );
+      }
+      function getTokenKindDesc(kind2) {
+        return isPunctuatorTokenKind(kind2) ? `"${kind2}"` : kind2;
+      }
+      const MAX_SUGGESTIONS$1 = 5;
+      function didYouMean$1(firstArg, secondArg) {
+        const [subMessage, suggestionsArg] = secondArg
+          ? [firstArg, secondArg]
+          : [void 0, firstArg];
+        let message = " Did you mean ";
+        if (subMessage) {
+          message += subMessage + " ";
+        }
+        const suggestions = suggestionsArg.map((x2) => `"${x2}"`);
+        switch (suggestions.length) {
+          case 0:
+            return "";
+          case 1:
+            return message + suggestions[0] + "?";
+          case 2:
+            return message + suggestions[0] + " or " + suggestions[1] + "?";
+        }
+        const selected = suggestions.slice(0, MAX_SUGGESTIONS$1);
+        const lastItem = selected.pop();
+        return message + selected.join(", ") + ", or " + lastItem + "?";
+      }
+      function identityFunc(x2) {
+        return x2;
+      }
+      function keyMap$1(list3, keyFn) {
+        const result2 = /* @__PURE__ */ Object.create(null);
+        for (const item of list3) {
+          result2[keyFn(item)] = item;
+        }
+        return result2;
+      }
+      function keyValMap(list3, keyFn, valFn) {
+        const result2 = /* @__PURE__ */ Object.create(null);
+        for (const item of list3) {
+          result2[keyFn(item)] = valFn(item);
+        }
+        return result2;
+      }
+      function mapValue(map2, fn) {
+        const result2 = /* @__PURE__ */ Object.create(null);
+        for (const key of Object.keys(map2)) {
+          result2[key] = fn(map2[key], key);
+        }
+        return result2;
+      }
+      function naturalCompare$1(aStr, bStr) {
+        let aIndex = 0;
+        let bIndex = 0;
+        while (aIndex < aStr.length && bIndex < bStr.length) {
+          let aChar = aStr.charCodeAt(aIndex);
+          let bChar = bStr.charCodeAt(bIndex);
+          if (isDigit$1(aChar) && isDigit$1(bChar)) {
+            let aNum = 0;
+            do {
+              ++aIndex;
+              aNum = aNum * 10 + aChar - DIGIT_0$1;
+              aChar = aStr.charCodeAt(aIndex);
+            } while (isDigit$1(aChar) && aNum > 0);
+            let bNum = 0;
+            do {
+              ++bIndex;
+              bNum = bNum * 10 + bChar - DIGIT_0$1;
+              bChar = bStr.charCodeAt(bIndex);
+            } while (isDigit$1(bChar) && bNum > 0);
+            if (aNum < bNum) {
+              return -1;
+            }
+            if (aNum > bNum) {
+              return 1;
+            }
+          } else {
+            if (aChar < bChar) {
+              return -1;
+            }
+            if (aChar > bChar) {
+              return 1;
+            }
+            ++aIndex;
+            ++bIndex;
+          }
+        }
+        return aStr.length - bStr.length;
+      }
+      const DIGIT_0$1 = 48;
+      const DIGIT_9$1 = 57;
+      function isDigit$1(code3) {
+        return !isNaN(code3) && DIGIT_0$1 <= code3 && code3 <= DIGIT_9$1;
+      }
+      function suggestionList$1(input, options) {
+        const optionsByDistance = /* @__PURE__ */ Object.create(null);
+        const lexicalDistance2 = new LexicalDistance$1(input);
+        const threshold = Math.floor(input.length * 0.4) + 1;
+        for (const option of options) {
+          const distance = lexicalDistance2.measure(option, threshold);
+          if (distance !== void 0) {
+            optionsByDistance[option] = distance;
+          }
+        }
+        return Object.keys(optionsByDistance).sort((a, b) => {
+          const distanceDiff = optionsByDistance[a] - optionsByDistance[b];
+          return distanceDiff !== 0 ? distanceDiff : naturalCompare$1(a, b);
+        });
+      }
+      class LexicalDistance$1 {
+        constructor(input) {
+          this._input = input;
+          this._inputLowerCase = input.toLowerCase();
+          this._inputArray = stringToArray$1(this._inputLowerCase);
+          this._rows = [
+            new Array(input.length + 1).fill(0),
+            new Array(input.length + 1).fill(0),
+            new Array(input.length + 1).fill(0),
+          ];
+        }
+        measure(option, threshold) {
+          if (this._input === option) {
+            return 0;
+          }
+          const optionLowerCase = option.toLowerCase();
+          if (this._inputLowerCase === optionLowerCase) {
+            return 1;
+          }
+          let a = stringToArray$1(optionLowerCase);
+          let b = this._inputArray;
+          if (a.length < b.length) {
+            const tmp = a;
+            a = b;
+            b = tmp;
+          }
+          const aLength = a.length;
+          const bLength = b.length;
+          if (aLength - bLength > threshold) {
+            return void 0;
+          }
+          const rows = this._rows;
+          for (let j = 0; j <= bLength; j++) {
+            rows[0][j] = j;
+          }
+          for (let i = 1; i <= aLength; i++) {
+            const upRow = rows[(i - 1) % 3];
+            const currentRow = rows[i % 3];
+            let smallestCell = (currentRow[0] = i);
+            for (let j = 1; j <= bLength; j++) {
+              const cost = a[i - 1] === b[j - 1] ? 0 : 1;
+              let currentCell = Math.min(
+                upRow[j] + 1,
+                currentRow[j - 1] + 1,
+                upRow[j - 1] + cost
+              );
+              if (
+                i > 1 &&
+                j > 1 &&
+                a[i - 1] === b[j - 2] &&
+                a[i - 2] === b[j - 1]
+              ) {
+                const doubleDiagonalCell = rows[(i - 2) % 3][j - 2];
+                currentCell = Math.min(currentCell, doubleDiagonalCell + 1);
+              }
+              if (currentCell < smallestCell) {
+                smallestCell = currentCell;
+              }
+              currentRow[j] = currentCell;
+            }
+            if (smallestCell > threshold) {
+              return void 0;
+            }
+          }
+          const distance = rows[aLength % 3][bLength];
+          return distance <= threshold ? distance : void 0;
+        }
+      }
+      function stringToArray$1(str) {
+        const strLength = str.length;
+        const array = new Array(strLength);
+        for (let i = 0; i < strLength; ++i) {
+          array[i] = str.charCodeAt(i);
+        }
+        return array;
+      }
+      function toObjMap(obj) {
+        if (obj == null) {
+          return /* @__PURE__ */ Object.create(null);
+        }
+        if (Object.getPrototypeOf(obj) === null) {
+          return obj;
+        }
+        const map2 = /* @__PURE__ */ Object.create(null);
+        for (const [key, value] of Object.entries(obj)) {
+          map2[key] = value;
+        }
+        return map2;
+      }
+      function printString(str) {
+        return `"${str.replace(escapedRegExp, escapedReplacer)}"`;
+      }
+      const escapedRegExp = /[\x00-\x1f\x22\x5c\x7f-\x9f]/g;
+      function escapedReplacer(str) {
+        return escapeSequences[str.charCodeAt(0)];
+      }
+      const escapeSequences = [
+        "\\u0000",
+        "\\u0001",
+        "\\u0002",
+        "\\u0003",
+        "\\u0004",
+        "\\u0005",
+        "\\u0006",
+        "\\u0007",
+        "\\b",
+        "\\t",
+        "\\n",
+        "\\u000B",
+        "\\f",
+        "\\r",
+        "\\u000E",
+        "\\u000F",
+        "\\u0010",
+        "\\u0011",
+        "\\u0012",
+        "\\u0013",
+        "\\u0014",
+        "\\u0015",
+        "\\u0016",
+        "\\u0017",
+        "\\u0018",
+        "\\u0019",
+        "\\u001A",
+        "\\u001B",
+        "\\u001C",
+        "\\u001D",
+        "\\u001E",
+        "\\u001F",
+        "",
+        "",
+        '\\"',
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "\\\\",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "\\u007F",
+        "\\u0080",
+        "\\u0081",
+        "\\u0082",
+        "\\u0083",
+        "\\u0084",
+        "\\u0085",
+        "\\u0086",
+        "\\u0087",
+        "\\u0088",
+        "\\u0089",
+        "\\u008A",
+        "\\u008B",
+        "\\u008C",
+        "\\u008D",
+        "\\u008E",
+        "\\u008F",
+        "\\u0090",
+        "\\u0091",
+        "\\u0092",
+        "\\u0093",
+        "\\u0094",
+        "\\u0095",
+        "\\u0096",
+        "\\u0097",
+        "\\u0098",
+        "\\u0099",
+        "\\u009A",
+        "\\u009B",
+        "\\u009C",
+        "\\u009D",
+        "\\u009E",
+        "\\u009F",
+      ];
+      const BREAK = Object.freeze({});
+      function visit(root2, visitor, visitorKeys = QueryDocumentKeys) {
+        const enterLeaveMap = /* @__PURE__ */ new Map();
+        for (const kind2 of Object.values(Kind)) {
+          enterLeaveMap.set(kind2, getEnterLeaveForKind(visitor, kind2));
+        }
+        let stack = void 0;
+        let inArray = Array.isArray(root2);
+        let keys = [root2];
+        let index = -1;
+        let edits = [];
+        let node = root2;
+        let key = void 0;
+        let parent = void 0;
+        const path = [];
+        const ancestors = [];
+        do {
+          index++;
+          const isLeaving = index === keys.length;
+          const isEdited = isLeaving && edits.length !== 0;
+          if (isLeaving) {
+            key = ancestors.length === 0 ? void 0 : path[path.length - 1];
+            node = parent;
+            parent = ancestors.pop();
+            if (isEdited) {
+              if (inArray) {
+                node = node.slice();
+                let editOffset = 0;
+                for (const [editKey, editValue] of edits) {
+                  const arrayKey = editKey - editOffset;
+                  if (editValue === null) {
+                    node.splice(arrayKey, 1);
+                    editOffset++;
+                  } else {
+                    node[arrayKey] = editValue;
+                  }
+                }
+              } else {
+                node = Object.defineProperties(
+                  {},
+                  Object.getOwnPropertyDescriptors(node)
+                );
+                for (const [editKey, editValue] of edits) {
+                  node[editKey] = editValue;
+                }
+              }
+            }
+            index = stack.index;
+            keys = stack.keys;
+            edits = stack.edits;
+            inArray = stack.inArray;
+            stack = stack.prev;
+          } else if (parent) {
+            key = inArray ? index : keys[index];
+            node = parent[key];
+            if (node === null || node === void 0) {
+              continue;
+            }
+            path.push(key);
+          }
+          let result2;
+          if (!Array.isArray(node)) {
+            var _enterLeaveMap$get, _enterLeaveMap$get2;
+            isNode(node) ||
+              devAssert$1(false, `Invalid AST Node: ${inspect$2(node)}.`);
+            const visitFn = isLeaving
+              ? (_enterLeaveMap$get = enterLeaveMap.get(node.kind)) === null ||
+                _enterLeaveMap$get === void 0
+                ? void 0
+                : _enterLeaveMap$get.leave
+              : (_enterLeaveMap$get2 = enterLeaveMap.get(node.kind)) === null ||
+                _enterLeaveMap$get2 === void 0
+              ? void 0
+              : _enterLeaveMap$get2.enter;
+            result2 =
+              visitFn === null || visitFn === void 0
+                ? void 0
+                : visitFn.call(visitor, node, key, parent, path, ancestors);
+            if (result2 === BREAK) {
+              break;
+            }
+            if (result2 === false) {
+              if (!isLeaving) {
+                path.pop();
+                continue;
+              }
+            } else if (result2 !== void 0) {
+              edits.push([key, result2]);
+              if (!isLeaving) {
+                if (isNode(result2)) {
+                  node = result2;
+                } else {
+                  path.pop();
+                  continue;
+                }
+              }
+            }
+          }
+          if (result2 === void 0 && isEdited) {
+            edits.push([key, node]);
+          }
+          if (isLeaving) {
+            path.pop();
+          } else {
+            var _node$kind;
+            stack = {
+              inArray,
+              index,
+              keys,
+              edits,
+              prev: stack,
+            };
+            inArray = Array.isArray(node);
+            keys = inArray
+              ? node
+              : (_node$kind = visitorKeys[node.kind]) !== null &&
+                _node$kind !== void 0
+              ? _node$kind
+              : [];
+            index = -1;
+            edits = [];
+            if (parent) {
+              ancestors.push(parent);
+            }
+            parent = node;
+          }
+        } while (stack !== void 0);
+        if (edits.length !== 0) {
+          return edits[edits.length - 1][1];
+        }
+        return root2;
+      }
+      function visitInParallel(visitors) {
+        const skipping = new Array(visitors.length).fill(null);
+        const mergedVisitor = /* @__PURE__ */ Object.create(null);
+        for (const kind2 of Object.values(Kind)) {
+          let hasVisitor = false;
+          const enterList = new Array(visitors.length).fill(void 0);
+          const leaveList = new Array(visitors.length).fill(void 0);
+          for (let i = 0; i < visitors.length; ++i) {
+            const { enter, leave } = getEnterLeaveForKind(visitors[i], kind2);
+            hasVisitor || (hasVisitor = enter != null || leave != null);
+            enterList[i] = enter;
+            leaveList[i] = leave;
+          }
+          if (!hasVisitor) {
+            continue;
+          }
+          const mergedEnterLeave = {
+            enter(...args) {
+              const node = args[0];
+              for (let i = 0; i < visitors.length; i++) {
+                if (skipping[i] === null) {
+                  var _enterList$i;
+                  const result2 =
+                    (_enterList$i = enterList[i]) === null ||
+                    _enterList$i === void 0
+                      ? void 0
+                      : _enterList$i.apply(visitors[i], args);
+                  if (result2 === false) {
+                    skipping[i] = node;
+                  } else if (result2 === BREAK) {
+                    skipping[i] = BREAK;
+                  } else if (result2 !== void 0) {
+                    return result2;
+                  }
+                }
+              }
+            },
+            leave(...args) {
+              const node = args[0];
+              for (let i = 0; i < visitors.length; i++) {
+                if (skipping[i] === null) {
+                  var _leaveList$i;
+                  const result2 =
+                    (_leaveList$i = leaveList[i]) === null ||
+                    _leaveList$i === void 0
+                      ? void 0
+                      : _leaveList$i.apply(visitors[i], args);
+                  if (result2 === BREAK) {
+                    skipping[i] = BREAK;
+                  } else if (result2 !== void 0 && result2 !== false) {
+                    return result2;
+                  }
+                } else if (skipping[i] === node) {
+                  skipping[i] = null;
+                }
+              }
+            },
+          };
+          mergedVisitor[kind2] = mergedEnterLeave;
+        }
+        return mergedVisitor;
+      }
+      function getEnterLeaveForKind(visitor, kind2) {
+        const kindVisitor = visitor[kind2];
+        if (typeof kindVisitor === "object") {
+          return kindVisitor;
+        } else if (typeof kindVisitor === "function") {
+          return {
+            enter: kindVisitor,
+            leave: void 0,
+          };
+        }
+        return {
+          enter: visitor.enter,
+          leave: visitor.leave,
+        };
+      }
+      function getVisitFn(visitor, kind2, isLeaving) {
+        const { enter, leave } = getEnterLeaveForKind(visitor, kind2);
+        return isLeaving ? leave : enter;
+      }
+      function print(ast2) {
+        return visit(ast2, printDocASTReducer$1);
+      }
+      const MAX_LINE_LENGTH$1 = 80;
+      const printDocASTReducer$1 = {
+        Name: {
+          leave: (node) => node.value,
+        },
+        Variable: {
+          leave: (node) => "$" + node.name,
+        },
+        Document: {
+          leave: (node) => join$1(node.definitions, "\n\n"),
+        },
+        OperationDefinition: {
+          leave(node) {
+            const varDefs = wrap$1(
+              "(",
+              join$1(node.variableDefinitions, ", "),
+              ")"
+            );
+            const prefix = join$1(
+              [
+                node.operation,
+                join$1([node.name, varDefs]),
+                join$1(node.directives, " "),
+              ],
+              " "
+            );
+            return (prefix === "query" ? "" : prefix + " ") + node.selectionSet;
+          },
+        },
+        VariableDefinition: {
+          leave: ({
+            variable,
+            type: type2,
+            defaultValue: defaultValue2,
+            directives,
+          }) =>
+            variable +
+            ": " +
+            type2 +
+            wrap$1(" = ", defaultValue2) +
+            wrap$1(" ", join$1(directives, " ")),
+        },
+        SelectionSet: {
+          leave: ({ selections }) => block$3(selections),
+        },
+        Field: {
+          leave({
+            alias,
+            name: name2,
+            arguments: args,
+            directives,
+            selectionSet,
+          }) {
+            const prefix = wrap$1("", alias, ": ") + name2;
+            let argsLine = prefix + wrap$1("(", join$1(args, ", "), ")");
+            if (argsLine.length > MAX_LINE_LENGTH$1) {
+              argsLine =
+                prefix + wrap$1("(\n", indent$4(join$1(args, "\n")), "\n)");
+            }
+            return join$1(
+              [argsLine, join$1(directives, " "), selectionSet],
+              " "
+            );
+          },
+        },
+        Argument: {
+          leave: ({ name: name2, value }) => name2 + ": " + value,
+        },
+        FragmentSpread: {
+          leave: ({ name: name2, directives }) =>
+            "..." + name2 + wrap$1(" ", join$1(directives, " ")),
+        },
+        InlineFragment: {
+          leave: ({ typeCondition, directives, selectionSet }) =>
+            join$1(
+              [
+                "...",
+                wrap$1("on ", typeCondition),
+                join$1(directives, " "),
+                selectionSet,
+              ],
+              " "
+            ),
+        },
+        FragmentDefinition: {
+          leave: ({
+            name: name2,
+            typeCondition,
+            variableDefinitions,
+            directives,
+            selectionSet,
+          }) =>
+            `fragment ${name2}${wrap$1(
+              "(",
+              join$1(variableDefinitions, ", "),
+              ")"
+            )} on ${typeCondition} ${wrap$1(
+              "",
+              join$1(directives, " "),
+              " "
+            )}` + selectionSet,
+        },
+        IntValue: {
+          leave: ({ value }) => value,
+        },
+        FloatValue: {
+          leave: ({ value }) => value,
+        },
+        StringValue: {
+          leave: ({ value, block: isBlockString }) =>
+            isBlockString ? printBlockString$1(value) : printString(value),
+        },
+        BooleanValue: {
+          leave: ({ value }) => (value ? "true" : "false"),
+        },
+        NullValue: {
+          leave: () => "null",
+        },
+        EnumValue: {
+          leave: ({ value }) => value,
+        },
+        ListValue: {
+          leave: ({ values }) => "[" + join$1(values, ", ") + "]",
+        },
+        ObjectValue: {
+          leave: ({ fields }) => "{" + join$1(fields, ", ") + "}",
+        },
+        ObjectField: {
+          leave: ({ name: name2, value }) => name2 + ": " + value,
+        },
+        Directive: {
+          leave: ({ name: name2, arguments: args }) =>
+            "@" + name2 + wrap$1("(", join$1(args, ", "), ")"),
+        },
+        NamedType: {
+          leave: ({ name: name2 }) => name2,
+        },
+        ListType: {
+          leave: ({ type: type2 }) => "[" + type2 + "]",
+        },
+        NonNullType: {
+          leave: ({ type: type2 }) => type2 + "!",
+        },
+        SchemaDefinition: {
+          leave: ({ description, directives, operationTypes }) =>
+            wrap$1("", description, "\n") +
+            join$1(
+              ["schema", join$1(directives, " "), block$3(operationTypes)],
+              " "
+            ),
+        },
+        OperationTypeDefinition: {
+          leave: ({ operation, type: type2 }) => operation + ": " + type2,
+        },
+        ScalarTypeDefinition: {
+          leave: ({ description, name: name2, directives }) =>
+            wrap$1("", description, "\n") +
+            join$1(["scalar", name2, join$1(directives, " ")], " "),
+        },
+        ObjectTypeDefinition: {
+          leave: ({
+            description,
+            name: name2,
+            interfaces,
+            directives,
+            fields,
+          }) =>
+            wrap$1("", description, "\n") +
+            join$1(
+              [
+                "type",
+                name2,
+                wrap$1("implements ", join$1(interfaces, " & ")),
+                join$1(directives, " "),
+                block$3(fields),
+              ],
+              " "
+            ),
+        },
+        FieldDefinition: {
+          leave: ({
+            description,
+            name: name2,
+            arguments: args,
+            type: type2,
+            directives,
+          }) =>
+            wrap$1("", description, "\n") +
+            name2 +
+            (hasMultilineItems$1(args)
+              ? wrap$1("(\n", indent$4(join$1(args, "\n")), "\n)")
+              : wrap$1("(", join$1(args, ", "), ")")) +
+            ": " +
+            type2 +
+            wrap$1(" ", join$1(directives, " ")),
+        },
+        InputValueDefinition: {
+          leave: ({
+            description,
+            name: name2,
+            type: type2,
+            defaultValue: defaultValue2,
+            directives,
+          }) =>
+            wrap$1("", description, "\n") +
+            join$1(
+              [
+                name2 + ": " + type2,
+                wrap$1("= ", defaultValue2),
+                join$1(directives, " "),
+              ],
+              " "
+            ),
+        },
+        InterfaceTypeDefinition: {
+          leave: ({
+            description,
+            name: name2,
+            interfaces,
+            directives,
+            fields,
+          }) =>
+            wrap$1("", description, "\n") +
+            join$1(
+              [
+                "interface",
+                name2,
+                wrap$1("implements ", join$1(interfaces, " & ")),
+                join$1(directives, " "),
+                block$3(fields),
+              ],
+              " "
+            ),
+        },
+        UnionTypeDefinition: {
+          leave: ({ description, name: name2, directives, types }) =>
+            wrap$1("", description, "\n") +
+            join$1(
+              [
+                "union",
+                name2,
+                join$1(directives, " "),
+                wrap$1("= ", join$1(types, " | ")),
+              ],
+              " "
+            ),
+        },
+        EnumTypeDefinition: {
+          leave: ({ description, name: name2, directives, values }) =>
+            wrap$1("", description, "\n") +
+            join$1(
+              ["enum", name2, join$1(directives, " "), block$3(values)],
+              " "
+            ),
+        },
+        EnumValueDefinition: {
+          leave: ({ description, name: name2, directives }) =>
+            wrap$1("", description, "\n") +
+            join$1([name2, join$1(directives, " ")], " "),
+        },
+        InputObjectTypeDefinition: {
+          leave: ({ description, name: name2, directives, fields }) =>
+            wrap$1("", description, "\n") +
+            join$1(
+              ["input", name2, join$1(directives, " "), block$3(fields)],
+              " "
+            ),
+        },
+        DirectiveDefinition: {
+          leave: ({
+            description,
+            name: name2,
+            arguments: args,
+            repeatable,
+            locations,
+          }) =>
+            wrap$1("", description, "\n") +
+            "directive @" +
+            name2 +
+            (hasMultilineItems$1(args)
+              ? wrap$1("(\n", indent$4(join$1(args, "\n")), "\n)")
+              : wrap$1("(", join$1(args, ", "), ")")) +
+            (repeatable ? " repeatable" : "") +
+            " on " +
+            join$1(locations, " | "),
+        },
+        SchemaExtension: {
+          leave: ({ directives, operationTypes }) =>
+            join$1(
+              [
+                "extend schema",
+                join$1(directives, " "),
+                block$3(operationTypes),
+              ],
+              " "
+            ),
+        },
+        ScalarTypeExtension: {
+          leave: ({ name: name2, directives }) =>
+            join$1(["extend scalar", name2, join$1(directives, " ")], " "),
+        },
+        ObjectTypeExtension: {
+          leave: ({ name: name2, interfaces, directives, fields }) =>
+            join$1(
+              [
+                "extend type",
+                name2,
+                wrap$1("implements ", join$1(interfaces, " & ")),
+                join$1(directives, " "),
+                block$3(fields),
+              ],
+              " "
+            ),
+        },
+        InterfaceTypeExtension: {
+          leave: ({ name: name2, interfaces, directives, fields }) =>
+            join$1(
+              [
+                "extend interface",
+                name2,
+                wrap$1("implements ", join$1(interfaces, " & ")),
+                join$1(directives, " "),
+                block$3(fields),
+              ],
+              " "
+            ),
+        },
+        UnionTypeExtension: {
+          leave: ({ name: name2, directives, types }) =>
+            join$1(
+              [
+                "extend union",
+                name2,
+                join$1(directives, " "),
+                wrap$1("= ", join$1(types, " | ")),
+              ],
+              " "
+            ),
+        },
+        EnumTypeExtension: {
+          leave: ({ name: name2, directives, values }) =>
+            join$1(
+              ["extend enum", name2, join$1(directives, " "), block$3(values)],
+              " "
+            ),
+        },
+        InputObjectTypeExtension: {
+          leave: ({ name: name2, directives, fields }) =>
+            join$1(
+              ["extend input", name2, join$1(directives, " "), block$3(fields)],
+              " "
+            ),
+        },
+      };
+      function join$1(maybeArray, separator2 = "") {
+        var _maybeArray$filter$jo;
+        return (_maybeArray$filter$jo =
+          maybeArray === null || maybeArray === void 0
+            ? void 0
+            : maybeArray.filter((x2) => x2).join(separator2)) !== null &&
+          _maybeArray$filter$jo !== void 0
+          ? _maybeArray$filter$jo
+          : "";
+      }
+      function block$3(array) {
+        return wrap$1("{\n", indent$4(join$1(array, "\n")), "\n}");
+      }
+      function wrap$1(start2, maybeString, end2 = "") {
+        return maybeString != null && maybeString !== ""
+          ? start2 + maybeString + end2
+          : "";
+      }
+      function indent$4(str) {
+        return wrap$1("  ", str.replace(/\n/g, "\n  "));
+      }
+      function hasMultilineItems$1(maybeArray) {
+        var _maybeArray$some;
+        return (_maybeArray$some =
+          maybeArray === null || maybeArray === void 0
+            ? void 0
+            : maybeArray.some((str) => str.includes("\n"))) !== null &&
+          _maybeArray$some !== void 0
+          ? _maybeArray$some
+          : false;
+      }
+      var printer = /* @__PURE__ */ Object.freeze({
+        __proto__: null,
+        [Symbol.toStringTag]: "Module",
+        print,
+      });
+      function valueFromASTUntyped(valueNode, variables) {
+        switch (valueNode.kind) {
+          case Kind.NULL:
+            return null;
+          case Kind.INT:
+            return parseInt(valueNode.value, 10);
+          case Kind.FLOAT:
+            return parseFloat(valueNode.value);
+          case Kind.STRING:
+          case Kind.ENUM:
+          case Kind.BOOLEAN:
+            return valueNode.value;
+          case Kind.LIST:
+            return valueNode.values.map((node) =>
+              valueFromASTUntyped(node, variables)
+            );
+          case Kind.OBJECT:
+            return keyValMap(
+              valueNode.fields,
+              (field) => field.name.value,
+              (field) => valueFromASTUntyped(field.value, variables)
+            );
+          case Kind.VARIABLE:
+            return variables === null || variables === void 0
+              ? void 0
+              : variables[valueNode.name.value];
+        }
+      }
+      function assertName(name2) {
+        name2 != null || devAssert$1(false, "Must provide name.");
+        typeof name2 === "string" ||
+          devAssert$1(false, "Expected name to be a string.");
+        if (name2.length === 0) {
+          throw new GraphQLError("Expected name to be a non-empty string.");
+        }
+        for (let i = 1; i < name2.length; ++i) {
+          if (!isNameContinue(name2.charCodeAt(i))) {
+            throw new GraphQLError(
+              `Names must only contain [_a-zA-Z0-9] but "${name2}" does not.`
+            );
+          }
+        }
+        if (!isNameStart(name2.charCodeAt(0))) {
+          throw new GraphQLError(
+            `Names must start with [_a-zA-Z] but "${name2}" does not.`
+          );
+        }
+        return name2;
+      }
+      function assertEnumValueName(name2) {
+        if (name2 === "true" || name2 === "false" || name2 === "null") {
+          throw new GraphQLError(`Enum values cannot be named: ${name2}`);
+        }
+        return assertName(name2);
+      }
+      function isType(type2) {
+        return (
+          isScalarType(type2) ||
+          isObjectType(type2) ||
+          isInterfaceType(type2) ||
+          isUnionType(type2) ||
+          isEnumType(type2) ||
+          isInputObjectType(type2) ||
+          isListType(type2) ||
+          isNonNullType(type2)
+        );
+      }
+      function assertType(type2) {
+        if (!isType(type2)) {
+          throw new Error(`Expected ${inspect$2(type2)} to be a GraphQL type.`);
+        }
+        return type2;
+      }
+      function isScalarType(type2) {
+        return instanceOf(type2, GraphQLScalarType);
+      }
+      function assertScalarType(type2) {
+        if (!isScalarType(type2)) {
+          throw new Error(
+            `Expected ${inspect$2(type2)} to be a GraphQL Scalar type.`
+          );
+        }
+        return type2;
+      }
+      function isObjectType(type2) {
+        return instanceOf(type2, GraphQLObjectType);
+      }
+      function assertObjectType(type2) {
+        if (!isObjectType(type2)) {
+          throw new Error(
+            `Expected ${inspect$2(type2)} to be a GraphQL Object type.`
+          );
+        }
+        return type2;
+      }
+      function isInterfaceType(type2) {
+        return instanceOf(type2, GraphQLInterfaceType);
+      }
+      function assertInterfaceType(type2) {
+        if (!isInterfaceType(type2)) {
+          throw new Error(
+            `Expected ${inspect$2(type2)} to be a GraphQL Interface type.`
+          );
+        }
+        return type2;
+      }
+      function isUnionType(type2) {
+        return instanceOf(type2, GraphQLUnionType);
+      }
+      function assertUnionType(type2) {
+        if (!isUnionType(type2)) {
+          throw new Error(
+            `Expected ${inspect$2(type2)} to be a GraphQL Union type.`
+          );
+        }
+        return type2;
+      }
+      function isEnumType(type2) {
+        return instanceOf(type2, GraphQLEnumType);
+      }
+      function assertEnumType(type2) {
+        if (!isEnumType(type2)) {
+          throw new Error(
+            `Expected ${inspect$2(type2)} to be a GraphQL Enum type.`
+          );
+        }
+        return type2;
+      }
+      function isInputObjectType(type2) {
+        return instanceOf(type2, GraphQLInputObjectType);
+      }
+      function assertInputObjectType(type2) {
+        if (!isInputObjectType(type2)) {
+          throw new Error(
+            `Expected ${inspect$2(type2)} to be a GraphQL Input Object type.`
+          );
+        }
+        return type2;
+      }
+      function isListType(type2) {
+        return instanceOf(type2, GraphQLList);
+      }
+      function assertListType(type2) {
+        if (!isListType(type2)) {
+          throw new Error(
+            `Expected ${inspect$2(type2)} to be a GraphQL List type.`
+          );
+        }
+        return type2;
+      }
+      function isNonNullType(type2) {
+        return instanceOf(type2, GraphQLNonNull);
+      }
+      function assertNonNullType(type2) {
+        if (!isNonNullType(type2)) {
+          throw new Error(
+            `Expected ${inspect$2(type2)} to be a GraphQL Non-Null type.`
+          );
+        }
+        return type2;
+      }
+      function isInputType(type2) {
+        return (
+          isScalarType(type2) ||
+          isEnumType(type2) ||
+          isInputObjectType(type2) ||
+          (isWrappingType(type2) && isInputType(type2.ofType))
+        );
+      }
+      function assertInputType(type2) {
+        if (!isInputType(type2)) {
+          throw new Error(
+            `Expected ${inspect$2(type2)} to be a GraphQL input type.`
+          );
+        }
+        return type2;
+      }
+      function isOutputType(type2) {
+        return (
+          isScalarType(type2) ||
+          isObjectType(type2) ||
+          isInterfaceType(type2) ||
+          isUnionType(type2) ||
+          isEnumType(type2) ||
+          (isWrappingType(type2) && isOutputType(type2.ofType))
+        );
+      }
+      function assertOutputType(type2) {
+        if (!isOutputType(type2)) {
+          throw new Error(
+            `Expected ${inspect$2(type2)} to be a GraphQL output type.`
+          );
+        }
+        return type2;
+      }
+      function isLeafType(type2) {
+        return isScalarType(type2) || isEnumType(type2);
+      }
+      function assertLeafType(type2) {
+        if (!isLeafType(type2)) {
+          throw new Error(
+            `Expected ${inspect$2(type2)} to be a GraphQL leaf type.`
+          );
+        }
+        return type2;
+      }
+      function isCompositeType(type2) {
+        return (
+          isObjectType(type2) || isInterfaceType(type2) || isUnionType(type2)
+        );
+      }
+      function assertCompositeType(type2) {
+        if (!isCompositeType(type2)) {
+          throw new Error(
+            `Expected ${inspect$2(type2)} to be a GraphQL composite type.`
+          );
+        }
+        return type2;
+      }
+      function isAbstractType(type2) {
+        return isInterfaceType(type2) || isUnionType(type2);
+      }
+      function assertAbstractType(type2) {
+        if (!isAbstractType(type2)) {
+          throw new Error(
+            `Expected ${inspect$2(type2)} to be a GraphQL abstract type.`
+          );
+        }
+        return type2;
+      }
+      class GraphQLList {
+        constructor(ofType) {
+          isType(ofType) ||
+            devAssert$1(
+              false,
+              `Expected ${inspect$2(ofType)} to be a GraphQL type.`
+            );
+          this.ofType = ofType;
+        }
+        get [Symbol.toStringTag]() {
+          return "GraphQLList";
+        }
+        toString() {
+          return "[" + String(this.ofType) + "]";
+        }
+        toJSON() {
+          return this.toString();
+        }
+      }
+      class GraphQLNonNull {
+        constructor(ofType) {
+          isNullableType(ofType) ||
+            devAssert$1(
+              false,
+              `Expected ${inspect$2(ofType)} to be a GraphQL nullable type.`
+            );
+          this.ofType = ofType;
+        }
+        get [Symbol.toStringTag]() {
+          return "GraphQLNonNull";
+        }
+        toString() {
+          return String(this.ofType) + "!";
+        }
+        toJSON() {
+          return this.toString();
+        }
+      }
+      function isWrappingType(type2) {
+        return isListType(type2) || isNonNullType(type2);
+      }
+      function assertWrappingType(type2) {
+        if (!isWrappingType(type2)) {
+          throw new Error(
+            `Expected ${inspect$2(type2)} to be a GraphQL wrapping type.`
+          );
+        }
+        return type2;
+      }
+      function isNullableType(type2) {
+        return isType(type2) && !isNonNullType(type2);
+      }
+      function assertNullableType(type2) {
+        if (!isNullableType(type2)) {
+          throw new Error(
+            `Expected ${inspect$2(type2)} to be a GraphQL nullable type.`
+          );
+        }
+        return type2;
+      }
+      function getNullableType(type2) {
+        if (type2) {
+          return isNonNullType(type2) ? type2.ofType : type2;
+        }
+      }
+      function isNamedType(type2) {
+        return (
+          isScalarType(type2) ||
+          isObjectType(type2) ||
+          isInterfaceType(type2) ||
+          isUnionType(type2) ||
+          isEnumType(type2) ||
+          isInputObjectType(type2)
+        );
+      }
+      function assertNamedType(type2) {
+        if (!isNamedType(type2)) {
+          throw new Error(
+            `Expected ${inspect$2(type2)} to be a GraphQL named type.`
+          );
+        }
+        return type2;
+      }
+      function getNamedType(type2) {
+        if (type2) {
+          let unwrappedType = type2;
+          while (isWrappingType(unwrappedType)) {
+            unwrappedType = unwrappedType.ofType;
+          }
+          return unwrappedType;
+        }
+      }
+      function resolveReadonlyArrayThunk(thunk) {
+        return typeof thunk === "function" ? thunk() : thunk;
+      }
+      function resolveObjMapThunk(thunk) {
+        return typeof thunk === "function" ? thunk() : thunk;
+      }
+      class GraphQLScalarType {
+        constructor(config2) {
+          var _config$parseValue,
+            _config$serialize,
+            _config$parseLiteral,
+            _config$extensionASTN;
+          const parseValue2 =
+            (_config$parseValue = config2.parseValue) !== null &&
+            _config$parseValue !== void 0
+              ? _config$parseValue
+              : identityFunc;
+          this.name = assertName(config2.name);
+          this.description = config2.description;
+          this.specifiedByURL = config2.specifiedByURL;
+          this.serialize =
+            (_config$serialize = config2.serialize) !== null &&
+            _config$serialize !== void 0
+              ? _config$serialize
+              : identityFunc;
+          this.parseValue = parseValue2;
+          this.parseLiteral =
+            (_config$parseLiteral = config2.parseLiteral) !== null &&
+            _config$parseLiteral !== void 0
+              ? _config$parseLiteral
+              : (node, variables) =>
+                  parseValue2(valueFromASTUntyped(node, variables));
+          this.extensions = toObjMap(config2.extensions);
+          this.astNode = config2.astNode;
+          this.extensionASTNodes =
+            (_config$extensionASTN = config2.extensionASTNodes) !== null &&
+            _config$extensionASTN !== void 0
+              ? _config$extensionASTN
+              : [];
+          config2.specifiedByURL == null ||
+            typeof config2.specifiedByURL === "string" ||
+            devAssert$1(
+              false,
+              `${
+                this.name
+              } must provide "specifiedByURL" as a string, but got: ${inspect$2(
+                config2.specifiedByURL
+              )}.`
+            );
+          config2.serialize == null ||
+            typeof config2.serialize === "function" ||
+            devAssert$1(
+              false,
+              `${this.name} must provide "serialize" function. If this custom Scalar is also used as an input type, ensure "parseValue" and "parseLiteral" functions are also provided.`
+            );
+          if (config2.parseLiteral) {
+            (typeof config2.parseValue === "function" &&
+              typeof config2.parseLiteral === "function") ||
+              devAssert$1(
+                false,
+                `${this.name} must provide both "parseValue" and "parseLiteral" functions.`
+              );
+          }
+        }
+        get [Symbol.toStringTag]() {
+          return "GraphQLScalarType";
+        }
+        toConfig() {
+          return {
+            name: this.name,
+            description: this.description,
+            specifiedByURL: this.specifiedByURL,
+            serialize: this.serialize,
+            parseValue: this.parseValue,
+            parseLiteral: this.parseLiteral,
+            extensions: this.extensions,
+            astNode: this.astNode,
+            extensionASTNodes: this.extensionASTNodes,
+          };
+        }
+        toString() {
+          return this.name;
+        }
+        toJSON() {
+          return this.toString();
+        }
+      }
+      class GraphQLObjectType {
+        constructor(config2) {
+          var _config$extensionASTN2;
+          this.name = assertName(config2.name);
+          this.description = config2.description;
+          this.isTypeOf = config2.isTypeOf;
+          this.extensions = toObjMap(config2.extensions);
+          this.astNode = config2.astNode;
+          this.extensionASTNodes =
+            (_config$extensionASTN2 = config2.extensionASTNodes) !== null &&
+            _config$extensionASTN2 !== void 0
+              ? _config$extensionASTN2
+              : [];
+          this._fields = () => defineFieldMap(config2);
+          this._interfaces = () => defineInterfaces(config2);
+          config2.isTypeOf == null ||
+            typeof config2.isTypeOf === "function" ||
+            devAssert$1(
+              false,
+              `${
+                this.name
+              } must provide "isTypeOf" as a function, but got: ${inspect$2(
+                config2.isTypeOf
+              )}.`
+            );
+        }
+        get [Symbol.toStringTag]() {
+          return "GraphQLObjectType";
+        }
+        getFields() {
+          if (typeof this._fields === "function") {
+            this._fields = this._fields();
+          }
+          return this._fields;
+        }
+        getInterfaces() {
+          if (typeof this._interfaces === "function") {
+            this._interfaces = this._interfaces();
+          }
+          return this._interfaces;
+        }
+        toConfig() {
+          return {
+            name: this.name,
+            description: this.description,
+            interfaces: this.getInterfaces(),
+            fields: fieldsToFieldsConfig(this.getFields()),
+            isTypeOf: this.isTypeOf,
+            extensions: this.extensions,
+            astNode: this.astNode,
+            extensionASTNodes: this.extensionASTNodes,
+          };
+        }
+        toString() {
+          return this.name;
+        }
+        toJSON() {
+          return this.toString();
+        }
+      }
+      function defineInterfaces(config2) {
+        var _config$interfaces;
+        const interfaces = resolveReadonlyArrayThunk(
+          (_config$interfaces = config2.interfaces) !== null &&
+            _config$interfaces !== void 0
+            ? _config$interfaces
+            : []
+        );
+        Array.isArray(interfaces) ||
+          devAssert$1(
+            false,
+            `${config2.name} interfaces must be an Array or a function which returns an Array.`
+          );
+        return interfaces;
+      }
+      function defineFieldMap(config2) {
+        const fieldMap = resolveObjMapThunk(config2.fields);
+        isPlainObj(fieldMap) ||
+          devAssert$1(
+            false,
+            `${config2.name} fields must be an object with field names as keys or a function which returns such an object.`
+          );
+        return mapValue(fieldMap, (fieldConfig, fieldName) => {
+          var _fieldConfig$args;
+          isPlainObj(fieldConfig) ||
+            devAssert$1(
+              false,
+              `${config2.name}.${fieldName} field config must be an object.`
+            );
+          fieldConfig.resolve == null ||
+            typeof fieldConfig.resolve === "function" ||
+            devAssert$1(
+              false,
+              `${
+                config2.name
+              }.${fieldName} field resolver must be a function if provided, but got: ${inspect$2(
+                fieldConfig.resolve
+              )}.`
+            );
+          const argsConfig =
+            (_fieldConfig$args = fieldConfig.args) !== null &&
+            _fieldConfig$args !== void 0
+              ? _fieldConfig$args
+              : {};
+          isPlainObj(argsConfig) ||
+            devAssert$1(
+              false,
+              `${config2.name}.${fieldName} args must be an object with argument names as keys.`
+            );
+          return {
+            name: assertName(fieldName),
+            description: fieldConfig.description,
+            type: fieldConfig.type,
+            args: defineArguments(argsConfig),
+            resolve: fieldConfig.resolve,
+            subscribe: fieldConfig.subscribe,
+            deprecationReason: fieldConfig.deprecationReason,
+            extensions: toObjMap(fieldConfig.extensions),
+            astNode: fieldConfig.astNode,
+          };
+        });
+      }
+      function defineArguments(config2) {
+        return Object.entries(config2).map(([argName, argConfig]) => ({
+          name: assertName(argName),
+          description: argConfig.description,
+          type: argConfig.type,
+          defaultValue: argConfig.defaultValue,
+          deprecationReason: argConfig.deprecationReason,
+          extensions: toObjMap(argConfig.extensions),
+          astNode: argConfig.astNode,
+        }));
+      }
+      function isPlainObj(obj) {
+        return isObjectLike$1(obj) && !Array.isArray(obj);
+      }
+      function fieldsToFieldsConfig(fields) {
+        return mapValue(fields, (field) => ({
+          description: field.description,
+          type: field.type,
+          args: argsToArgsConfig(field.args),
+          resolve: field.resolve,
+          subscribe: field.subscribe,
+          deprecationReason: field.deprecationReason,
+          extensions: field.extensions,
+          astNode: field.astNode,
+        }));
+      }
+      function argsToArgsConfig(args) {
+        return keyValMap(
+          args,
+          (arg) => arg.name,
+          (arg) => ({
+            description: arg.description,
+            type: arg.type,
+            defaultValue: arg.defaultValue,
+            deprecationReason: arg.deprecationReason,
+            extensions: arg.extensions,
+            astNode: arg.astNode,
+          })
+        );
+      }
+      function isRequiredArgument$1(arg) {
+        return isNonNullType(arg.type) && arg.defaultValue === void 0;
+      }
+      class GraphQLInterfaceType {
+        constructor(config2) {
+          var _config$extensionASTN3;
+          this.name = assertName(config2.name);
+          this.description = config2.description;
+          this.resolveType = config2.resolveType;
+          this.extensions = toObjMap(config2.extensions);
+          this.astNode = config2.astNode;
+          this.extensionASTNodes =
+            (_config$extensionASTN3 = config2.extensionASTNodes) !== null &&
+            _config$extensionASTN3 !== void 0
+              ? _config$extensionASTN3
+              : [];
+          this._fields = defineFieldMap.bind(void 0, config2);
+          this._interfaces = defineInterfaces.bind(void 0, config2);
+          config2.resolveType == null ||
+            typeof config2.resolveType === "function" ||
+            devAssert$1(
+              false,
+              `${
+                this.name
+              } must provide "resolveType" as a function, but got: ${inspect$2(
+                config2.resolveType
+              )}.`
+            );
+        }
+        get [Symbol.toStringTag]() {
+          return "GraphQLInterfaceType";
+        }
+        getFields() {
+          if (typeof this._fields === "function") {
+            this._fields = this._fields();
+          }
+          return this._fields;
+        }
+        getInterfaces() {
+          if (typeof this._interfaces === "function") {
+            this._interfaces = this._interfaces();
+          }
+          return this._interfaces;
+        }
+        toConfig() {
+          return {
+            name: this.name,
+            description: this.description,
+            interfaces: this.getInterfaces(),
+            fields: fieldsToFieldsConfig(this.getFields()),
+            resolveType: this.resolveType,
+            extensions: this.extensions,
+            astNode: this.astNode,
+            extensionASTNodes: this.extensionASTNodes,
+          };
+        }
+        toString() {
+          return this.name;
+        }
+        toJSON() {
+          return this.toString();
+        }
+      }
+      class GraphQLUnionType {
+        constructor(config2) {
+          var _config$extensionASTN4;
+          this.name = assertName(config2.name);
+          this.description = config2.description;
+          this.resolveType = config2.resolveType;
+          this.extensions = toObjMap(config2.extensions);
+          this.astNode = config2.astNode;
+          this.extensionASTNodes =
+            (_config$extensionASTN4 = config2.extensionASTNodes) !== null &&
+            _config$extensionASTN4 !== void 0
+              ? _config$extensionASTN4
+              : [];
+          this._types = defineTypes.bind(void 0, config2);
+          config2.resolveType == null ||
+            typeof config2.resolveType === "function" ||
+            devAssert$1(
+              false,
+              `${
+                this.name
+              } must provide "resolveType" as a function, but got: ${inspect$2(
+                config2.resolveType
+              )}.`
+            );
+        }
+        get [Symbol.toStringTag]() {
+          return "GraphQLUnionType";
+        }
+        getTypes() {
+          if (typeof this._types === "function") {
+            this._types = this._types();
+          }
+          return this._types;
+        }
+        toConfig() {
+          return {
+            name: this.name,
+            description: this.description,
+            types: this.getTypes(),
+            resolveType: this.resolveType,
+            extensions: this.extensions,
+            astNode: this.astNode,
+            extensionASTNodes: this.extensionASTNodes,
+          };
+        }
+        toString() {
+          return this.name;
+        }
+        toJSON() {
+          return this.toString();
+        }
+      }
+      function defineTypes(config2) {
+        const types = resolveReadonlyArrayThunk(config2.types);
+        Array.isArray(types) ||
+          devAssert$1(
+            false,
+            `Must provide Array of types or a function which returns such an array for Union ${config2.name}.`
+          );
+        return types;
+      }
+      class GraphQLEnumType {
+        constructor(config2) {
+          var _config$extensionASTN5;
+          this.name = assertName(config2.name);
+          this.description = config2.description;
+          this.extensions = toObjMap(config2.extensions);
+          this.astNode = config2.astNode;
+          this.extensionASTNodes =
+            (_config$extensionASTN5 = config2.extensionASTNodes) !== null &&
+            _config$extensionASTN5 !== void 0
+              ? _config$extensionASTN5
+              : [];
+          this._values = defineEnumValues(this.name, config2.values);
+          this._valueLookup = new Map(
+            this._values.map((enumValue) => [enumValue.value, enumValue])
+          );
+          this._nameLookup = keyMap$1(this._values, (value) => value.name);
+        }
+        get [Symbol.toStringTag]() {
+          return "GraphQLEnumType";
+        }
+        getValues() {
+          return this._values;
+        }
+        getValue(name2) {
+          return this._nameLookup[name2];
+        }
+        serialize(outputValue) {
+          const enumValue = this._valueLookup.get(outputValue);
+          if (enumValue === void 0) {
+            throw new GraphQLError(
+              `Enum "${this.name}" cannot represent value: ${inspect$2(
+                outputValue
+              )}`
+            );
+          }
+          return enumValue.name;
+        }
+        parseValue(inputValue) {
+          if (typeof inputValue !== "string") {
+            const valueStr = inspect$2(inputValue);
+            throw new GraphQLError(
+              `Enum "${this.name}" cannot represent non-string value: ${valueStr}.` +
+                didYouMeanEnumValue(this, valueStr)
+            );
+          }
+          const enumValue = this.getValue(inputValue);
+          if (enumValue == null) {
+            throw new GraphQLError(
+              `Value "${inputValue}" does not exist in "${this.name}" enum.` +
+                didYouMeanEnumValue(this, inputValue)
+            );
+          }
+          return enumValue.value;
+        }
+        parseLiteral(valueNode, _variables) {
+          if (valueNode.kind !== Kind.ENUM) {
+            const valueStr = print(valueNode);
+            throw new GraphQLError(
+              `Enum "${this.name}" cannot represent non-enum value: ${valueStr}.` +
+                didYouMeanEnumValue(this, valueStr),
+              {
+                nodes: valueNode,
+              }
+            );
+          }
+          const enumValue = this.getValue(valueNode.value);
+          if (enumValue == null) {
+            const valueStr = print(valueNode);
+            throw new GraphQLError(
+              `Value "${valueStr}" does not exist in "${this.name}" enum.` +
+                didYouMeanEnumValue(this, valueStr),
+              {
+                nodes: valueNode,
+              }
+            );
+          }
+          return enumValue.value;
+        }
+        toConfig() {
+          const values = keyValMap(
+            this.getValues(),
+            (value) => value.name,
+            (value) => ({
+              description: value.description,
+              value: value.value,
+              deprecationReason: value.deprecationReason,
+              extensions: value.extensions,
+              astNode: value.astNode,
+            })
+          );
+          return {
+            name: this.name,
+            description: this.description,
+            values,
+            extensions: this.extensions,
+            astNode: this.astNode,
+            extensionASTNodes: this.extensionASTNodes,
+          };
+        }
+        toString() {
+          return this.name;
+        }
+        toJSON() {
+          return this.toString();
+        }
+      }
+      function didYouMeanEnumValue(enumType, unknownValueStr) {
+        const allNames = enumType.getValues().map((value) => value.name);
+        const suggestedValues = suggestionList$1(unknownValueStr, allNames);
+        return didYouMean$1("the enum value", suggestedValues);
+      }
+      function defineEnumValues(typeName, valueMap) {
+        isPlainObj(valueMap) ||
+          devAssert$1(
+            false,
+            `${typeName} values must be an object with value names as keys.`
+          );
+        return Object.entries(valueMap).map(([valueName, valueConfig]) => {
+          isPlainObj(valueConfig) ||
+            devAssert$1(
+              false,
+              `${typeName}.${valueName} must refer to an object with a "value" key representing an internal value but got: ${inspect$2(
+                valueConfig
+              )}.`
+            );
+          return {
+            name: assertEnumValueName(valueName),
+            description: valueConfig.description,
+            value: valueConfig.value !== void 0 ? valueConfig.value : valueName,
+            deprecationReason: valueConfig.deprecationReason,
+            extensions: toObjMap(valueConfig.extensions),
+            astNode: valueConfig.astNode,
+          };
+        });
+      }
+      class GraphQLInputObjectType {
+        constructor(config2) {
+          var _config$extensionASTN6;
+          this.name = assertName(config2.name);
+          this.description = config2.description;
+          this.extensions = toObjMap(config2.extensions);
+          this.astNode = config2.astNode;
+          this.extensionASTNodes =
+            (_config$extensionASTN6 = config2.extensionASTNodes) !== null &&
+            _config$extensionASTN6 !== void 0
+              ? _config$extensionASTN6
+              : [];
+          this._fields = defineInputFieldMap.bind(void 0, config2);
+        }
+        get [Symbol.toStringTag]() {
+          return "GraphQLInputObjectType";
+        }
+        getFields() {
+          if (typeof this._fields === "function") {
+            this._fields = this._fields();
+          }
+          return this._fields;
+        }
+        toConfig() {
+          const fields = mapValue(this.getFields(), (field) => ({
+            description: field.description,
+            type: field.type,
+            defaultValue: field.defaultValue,
+            deprecationReason: field.deprecationReason,
+            extensions: field.extensions,
+            astNode: field.astNode,
+          }));
+          return {
+            name: this.name,
+            description: this.description,
+            fields,
+            extensions: this.extensions,
+            astNode: this.astNode,
+            extensionASTNodes: this.extensionASTNodes,
+          };
+        }
+        toString() {
+          return this.name;
+        }
+        toJSON() {
+          return this.toString();
+        }
+      }
+      function defineInputFieldMap(config2) {
+        const fieldMap = resolveObjMapThunk(config2.fields);
+        isPlainObj(fieldMap) ||
+          devAssert$1(
+            false,
+            `${config2.name} fields must be an object with field names as keys or a function which returns such an object.`
+          );
+        return mapValue(fieldMap, (fieldConfig, fieldName) => {
+          !("resolve" in fieldConfig) ||
+            devAssert$1(
+              false,
+              `${config2.name}.${fieldName} field has a resolve property, but Input Types cannot define resolvers.`
+            );
+          return {
+            name: assertName(fieldName),
+            description: fieldConfig.description,
+            type: fieldConfig.type,
+            defaultValue: fieldConfig.defaultValue,
+            deprecationReason: fieldConfig.deprecationReason,
+            extensions: toObjMap(fieldConfig.extensions),
+            astNode: fieldConfig.astNode,
+          };
+        });
+      }
+      function isRequiredInputField(field) {
+        return isNonNullType(field.type) && field.defaultValue === void 0;
+      }
+      function isEqualType(typeA, typeB) {
+        if (typeA === typeB) {
+          return true;
+        }
+        if (isNonNullType(typeA) && isNonNullType(typeB)) {
+          return isEqualType(typeA.ofType, typeB.ofType);
+        }
+        if (isListType(typeA) && isListType(typeB)) {
+          return isEqualType(typeA.ofType, typeB.ofType);
+        }
+        return false;
+      }
+      function isTypeSubTypeOf(schema, maybeSubType, superType) {
+        if (maybeSubType === superType) {
+          return true;
+        }
+        if (isNonNullType(superType)) {
+          if (isNonNullType(maybeSubType)) {
+            return isTypeSubTypeOf(
+              schema,
+              maybeSubType.ofType,
+              superType.ofType
+            );
+          }
+          return false;
+        }
+        if (isNonNullType(maybeSubType)) {
+          return isTypeSubTypeOf(schema, maybeSubType.ofType, superType);
+        }
+        if (isListType(superType)) {
+          if (isListType(maybeSubType)) {
+            return isTypeSubTypeOf(
+              schema,
+              maybeSubType.ofType,
+              superType.ofType
+            );
+          }
+          return false;
+        }
+        if (isListType(maybeSubType)) {
+          return false;
+        }
+        return (
+          isAbstractType(superType) &&
+          (isInterfaceType(maybeSubType) || isObjectType(maybeSubType)) &&
+          schema.isSubType(superType, maybeSubType)
+        );
+      }
+      function doTypesOverlap(schema, typeA, typeB) {
+        if (typeA === typeB) {
+          return true;
+        }
+        if (isAbstractType(typeA)) {
+          if (isAbstractType(typeB)) {
+            return schema
+              .getPossibleTypes(typeA)
+              .some((type2) => schema.isSubType(typeB, type2));
+          }
+          return schema.isSubType(typeA, typeB);
+        }
+        if (isAbstractType(typeB)) {
+          return schema.isSubType(typeB, typeA);
+        }
+        return false;
+      }
+      const GRAPHQL_MAX_INT = 2147483647;
+      const GRAPHQL_MIN_INT = -2147483648;
+      const GraphQLInt = new GraphQLScalarType({
+        name: "Int",
+        description:
+          "The `Int` scalar type represents non-fractional signed whole numeric values. Int can represent values between -(2^31) and 2^31 - 1.",
+        serialize(outputValue) {
+          const coercedValue = serializeObject(outputValue);
+          if (typeof coercedValue === "boolean") {
+            return coercedValue ? 1 : 0;
+          }
+          let num2 = coercedValue;
+          if (typeof coercedValue === "string" && coercedValue !== "") {
+            num2 = Number(coercedValue);
+          }
+          if (typeof num2 !== "number" || !Number.isInteger(num2)) {
+            throw new GraphQLError(
+              `Int cannot represent non-integer value: ${inspect$2(
+                coercedValue
+              )}`
+            );
+          }
+          if (num2 > GRAPHQL_MAX_INT || num2 < GRAPHQL_MIN_INT) {
+            throw new GraphQLError(
+              "Int cannot represent non 32-bit signed integer value: " +
+                inspect$2(coercedValue)
+            );
+          }
+          return num2;
+        },
+        parseValue(inputValue) {
+          if (typeof inputValue !== "number" || !Number.isInteger(inputValue)) {
+            throw new GraphQLError(
+              `Int cannot represent non-integer value: ${inspect$2(inputValue)}`
+            );
+          }
+          if (inputValue > GRAPHQL_MAX_INT || inputValue < GRAPHQL_MIN_INT) {
+            throw new GraphQLError(
+              `Int cannot represent non 32-bit signed integer value: ${inputValue}`
+            );
+          }
+          return inputValue;
+        },
+        parseLiteral(valueNode) {
+          if (valueNode.kind !== Kind.INT) {
+            throw new GraphQLError(
+              `Int cannot represent non-integer value: ${print(valueNode)}`,
+              {
+                nodes: valueNode,
+              }
+            );
+          }
+          const num2 = parseInt(valueNode.value, 10);
+          if (num2 > GRAPHQL_MAX_INT || num2 < GRAPHQL_MIN_INT) {
+            throw new GraphQLError(
+              `Int cannot represent non 32-bit signed integer value: ${valueNode.value}`,
+              {
+                nodes: valueNode,
+              }
+            );
+          }
+          return num2;
+        },
+      });
+      const GraphQLFloat = new GraphQLScalarType({
+        name: "Float",
+        description:
+          "The `Float` scalar type represents signed double-precision fractional values as specified by [IEEE 754](https://en.wikipedia.org/wiki/IEEE_floating_point).",
+        serialize(outputValue) {
+          const coercedValue = serializeObject(outputValue);
+          if (typeof coercedValue === "boolean") {
+            return coercedValue ? 1 : 0;
+          }
+          let num2 = coercedValue;
+          if (typeof coercedValue === "string" && coercedValue !== "") {
+            num2 = Number(coercedValue);
+          }
+          if (typeof num2 !== "number" || !Number.isFinite(num2)) {
+            throw new GraphQLError(
+              `Float cannot represent non numeric value: ${inspect$2(
+                coercedValue
+              )}`
+            );
+          }
+          return num2;
+        },
+        parseValue(inputValue) {
+          if (typeof inputValue !== "number" || !Number.isFinite(inputValue)) {
+            throw new GraphQLError(
+              `Float cannot represent non numeric value: ${inspect$2(
+                inputValue
+              )}`
+            );
+          }
+          return inputValue;
+        },
+        parseLiteral(valueNode) {
+          if (valueNode.kind !== Kind.FLOAT && valueNode.kind !== Kind.INT) {
+            throw new GraphQLError(
+              `Float cannot represent non numeric value: ${print(valueNode)}`,
+              valueNode
+            );
+          }
+          return parseFloat(valueNode.value);
+        },
+      });
+      const GraphQLString = new GraphQLScalarType({
+        name: "String",
+        description:
+          "The `String` scalar type represents textual data, represented as UTF-8 character sequences. The String type is most often used by GraphQL to represent free-form human-readable text.",
+        serialize(outputValue) {
+          const coercedValue = serializeObject(outputValue);
+          if (typeof coercedValue === "string") {
+            return coercedValue;
+          }
+          if (typeof coercedValue === "boolean") {
+            return coercedValue ? "true" : "false";
+          }
+          if (
+            typeof coercedValue === "number" &&
+            Number.isFinite(coercedValue)
+          ) {
+            return coercedValue.toString();
+          }
+          throw new GraphQLError(
+            `String cannot represent value: ${inspect$2(outputValue)}`
+          );
+        },
+        parseValue(inputValue) {
+          if (typeof inputValue !== "string") {
+            throw new GraphQLError(
+              `String cannot represent a non string value: ${inspect$2(
+                inputValue
+              )}`
+            );
+          }
+          return inputValue;
+        },
+        parseLiteral(valueNode) {
+          if (valueNode.kind !== Kind.STRING) {
+            throw new GraphQLError(
+              `String cannot represent a non string value: ${print(valueNode)}`,
+              {
+                nodes: valueNode,
+              }
+            );
+          }
+          return valueNode.value;
+        },
+      });
+      const GraphQLBoolean = new GraphQLScalarType({
+        name: "Boolean",
+        description: "The `Boolean` scalar type represents `true` or `false`.",
+        serialize(outputValue) {
+          const coercedValue = serializeObject(outputValue);
+          if (typeof coercedValue === "boolean") {
+            return coercedValue;
+          }
+          if (Number.isFinite(coercedValue)) {
+            return coercedValue !== 0;
+          }
+          throw new GraphQLError(
+            `Boolean cannot represent a non boolean value: ${inspect$2(
+              coercedValue
+            )}`
+          );
+        },
+        parseValue(inputValue) {
+          if (typeof inputValue !== "boolean") {
+            throw new GraphQLError(
+              `Boolean cannot represent a non boolean value: ${inspect$2(
+                inputValue
+              )}`
+            );
+          }
+          return inputValue;
+        },
+        parseLiteral(valueNode) {
+          if (valueNode.kind !== Kind.BOOLEAN) {
+            throw new GraphQLError(
+              `Boolean cannot represent a non boolean value: ${print(
+                valueNode
+              )}`,
+              {
+                nodes: valueNode,
+              }
+            );
+          }
+          return valueNode.value;
+        },
+      });
+      const GraphQLID = new GraphQLScalarType({
+        name: "ID",
+        description:
+          'The `ID` scalar type represents a unique identifier, often used to refetch an object or as key for a cache. The ID type appears in a JSON response as a String; however, it is not intended to be human-readable. When expected as an input type, any string (such as `"4"`) or integer (such as `4`) input value will be accepted as an ID.',
+        serialize(outputValue) {
+          const coercedValue = serializeObject(outputValue);
+          if (typeof coercedValue === "string") {
+            return coercedValue;
+          }
+          if (Number.isInteger(coercedValue)) {
+            return String(coercedValue);
+          }
+          throw new GraphQLError(
+            `ID cannot represent value: ${inspect$2(outputValue)}`
+          );
+        },
+        parseValue(inputValue) {
+          if (typeof inputValue === "string") {
+            return inputValue;
+          }
+          if (typeof inputValue === "number" && Number.isInteger(inputValue)) {
+            return inputValue.toString();
+          }
+          throw new GraphQLError(
+            `ID cannot represent value: ${inspect$2(inputValue)}`
+          );
+        },
+        parseLiteral(valueNode) {
+          if (valueNode.kind !== Kind.STRING && valueNode.kind !== Kind.INT) {
+            throw new GraphQLError(
+              "ID cannot represent a non-string and non-integer value: " +
+                print(valueNode),
+              {
+                nodes: valueNode,
+              }
+            );
+          }
+          return valueNode.value;
+        },
+      });
+      const specifiedScalarTypes = Object.freeze([
+        GraphQLString,
+        GraphQLInt,
+        GraphQLFloat,
+        GraphQLBoolean,
+        GraphQLID,
+      ]);
+      function isSpecifiedScalarType(type2) {
+        return specifiedScalarTypes.some(
+          ({ name: name2 }) => type2.name === name2
+        );
+      }
+      function serializeObject(outputValue) {
+        if (isObjectLike$1(outputValue)) {
+          if (typeof outputValue.valueOf === "function") {
+            const valueOfResult = outputValue.valueOf();
+            if (!isObjectLike$1(valueOfResult)) {
+              return valueOfResult;
+            }
+          }
+          if (typeof outputValue.toJSON === "function") {
+            return outputValue.toJSON();
+          }
+        }
+        return outputValue;
+      }
+      function isDirective(directive) {
+        return instanceOf(directive, GraphQLDirective);
+      }
+      function assertDirective(directive) {
+        if (!isDirective(directive)) {
+          throw new Error(
+            `Expected ${inspect$2(directive)} to be a GraphQL directive.`
+          );
+        }
+        return directive;
+      }
+      class GraphQLDirective {
+        constructor(config2) {
+          var _config$isRepeatable, _config$args;
+          this.name = assertName(config2.name);
+          this.description = config2.description;
+          this.locations = config2.locations;
+          this.isRepeatable =
+            (_config$isRepeatable = config2.isRepeatable) !== null &&
+            _config$isRepeatable !== void 0
+              ? _config$isRepeatable
+              : false;
+          this.extensions = toObjMap(config2.extensions);
+          this.astNode = config2.astNode;
+          Array.isArray(config2.locations) ||
+            devAssert$1(false, `@${config2.name} locations must be an Array.`);
+          const args =
+            (_config$args = config2.args) !== null && _config$args !== void 0
+              ? _config$args
+              : {};
+          (isObjectLike$1(args) && !Array.isArray(args)) ||
+            devAssert$1(
+              false,
+              `@${config2.name} args must be an object with argument names as keys.`
+            );
+          this.args = defineArguments(args);
+        }
+        get [Symbol.toStringTag]() {
+          return "GraphQLDirective";
+        }
+        toConfig() {
+          return {
+            name: this.name,
+            description: this.description,
+            locations: this.locations,
+            args: argsToArgsConfig(this.args),
+            isRepeatable: this.isRepeatable,
+            extensions: this.extensions,
+            astNode: this.astNode,
+          };
+        }
+        toString() {
+          return "@" + this.name;
+        }
+        toJSON() {
+          return this.toString();
+        }
+      }
+      const GraphQLIncludeDirective = new GraphQLDirective({
+        name: "include",
+        description:
+          "Directs the executor to include this field or fragment only when the `if` argument is true.",
+        locations: [
+          DirectiveLocation.FIELD,
+          DirectiveLocation.FRAGMENT_SPREAD,
+          DirectiveLocation.INLINE_FRAGMENT,
+        ],
+        args: {
+          if: {
+            type: new GraphQLNonNull(GraphQLBoolean),
+            description: "Included when true.",
+          },
+        },
+      });
+      const GraphQLSkipDirective = new GraphQLDirective({
+        name: "skip",
+        description:
+          "Directs the executor to skip this field or fragment when the `if` argument is true.",
+        locations: [
+          DirectiveLocation.FIELD,
+          DirectiveLocation.FRAGMENT_SPREAD,
+          DirectiveLocation.INLINE_FRAGMENT,
+        ],
+        args: {
+          if: {
+            type: new GraphQLNonNull(GraphQLBoolean),
+            description: "Skipped when true.",
+          },
+        },
+      });
+      const DEFAULT_DEPRECATION_REASON = "No longer supported";
+      const GraphQLDeprecatedDirective = new GraphQLDirective({
+        name: "deprecated",
+        description:
+          "Marks an element of a GraphQL schema as no longer supported.",
+        locations: [
+          DirectiveLocation.FIELD_DEFINITION,
+          DirectiveLocation.ARGUMENT_DEFINITION,
+          DirectiveLocation.INPUT_FIELD_DEFINITION,
+          DirectiveLocation.ENUM_VALUE,
+        ],
+        args: {
+          reason: {
+            type: GraphQLString,
+            description:
+              "Explains why this element was deprecated, usually also including a suggestion for how to access supported similar data. Formatted using the Markdown syntax, as specified by [CommonMark](https://commonmark.org/).",
+            defaultValue: DEFAULT_DEPRECATION_REASON,
+          },
+        },
+      });
+      const GraphQLSpecifiedByDirective = new GraphQLDirective({
+        name: "specifiedBy",
+        description:
+          "Exposes a URL that specifies the behavior of this scalar.",
+        locations: [DirectiveLocation.SCALAR],
+        args: {
+          url: {
+            type: new GraphQLNonNull(GraphQLString),
+            description: "The URL that specifies the behavior of this scalar.",
+          },
+        },
+      });
+      const specifiedDirectives = Object.freeze([
+        GraphQLIncludeDirective,
+        GraphQLSkipDirective,
+        GraphQLDeprecatedDirective,
+        GraphQLSpecifiedByDirective,
+      ]);
+      function isSpecifiedDirective(directive) {
+        return specifiedDirectives.some(
+          ({ name: name2 }) => name2 === directive.name
+        );
+      }
+      function isIterableObject$1(maybeIterable) {
+        return (
+          typeof maybeIterable === "object" &&
+          typeof (maybeIterable === null || maybeIterable === void 0
+            ? void 0
+            : maybeIterable[Symbol.iterator]) === "function"
+        );
+      }
+      function astFromValue(value, type2) {
+        if (isNonNullType(type2)) {
+          const astValue = astFromValue(value, type2.ofType);
+          if (
+            (astValue === null || astValue === void 0
+              ? void 0
+              : astValue.kind) === Kind.NULL
+          ) {
+            return null;
+          }
+          return astValue;
+        }
+        if (value === null) {
+          return {
+            kind: Kind.NULL,
+          };
+        }
+        if (value === void 0) {
+          return null;
+        }
+        if (isListType(type2)) {
+          const itemType = type2.ofType;
+          if (isIterableObject$1(value)) {
+            const valuesNodes = [];
+            for (const item of value) {
+              const itemNode = astFromValue(item, itemType);
+              if (itemNode != null) {
+                valuesNodes.push(itemNode);
+              }
+            }
+            return {
+              kind: Kind.LIST,
+              values: valuesNodes,
+            };
+          }
+          return astFromValue(value, itemType);
+        }
+        if (isInputObjectType(type2)) {
+          if (!isObjectLike$1(value)) {
+            return null;
+          }
+          const fieldNodes = [];
+          for (const field of Object.values(type2.getFields())) {
+            const fieldValue = astFromValue(value[field.name], field.type);
+            if (fieldValue) {
+              fieldNodes.push({
+                kind: Kind.OBJECT_FIELD,
+                name: {
+                  kind: Kind.NAME,
+                  value: field.name,
+                },
+                value: fieldValue,
+              });
+            }
+          }
+          return {
+            kind: Kind.OBJECT,
+            fields: fieldNodes,
+          };
+        }
+        if (isLeafType(type2)) {
+          const serialized = type2.serialize(value);
+          if (serialized == null) {
+            return null;
+          }
+          if (typeof serialized === "boolean") {
+            return {
+              kind: Kind.BOOLEAN,
+              value: serialized,
+            };
+          }
+          if (typeof serialized === "number" && Number.isFinite(serialized)) {
+            const stringNum = String(serialized);
+            return integerStringRegExp.test(stringNum)
+              ? {
+                  kind: Kind.INT,
+                  value: stringNum,
+                }
+              : {
+                  kind: Kind.FLOAT,
+                  value: stringNum,
+                };
+          }
+          if (typeof serialized === "string") {
+            if (isEnumType(type2)) {
+              return {
+                kind: Kind.ENUM,
+                value: serialized,
+              };
+            }
+            if (type2 === GraphQLID && integerStringRegExp.test(serialized)) {
+              return {
+                kind: Kind.INT,
+                value: serialized,
+              };
+            }
+            return {
+              kind: Kind.STRING,
+              value: serialized,
+            };
+          }
+          throw new TypeError(
+            `Cannot convert value to AST: ${inspect$2(serialized)}.`
+          );
+        }
+        invariant$2(false, "Unexpected input type: " + inspect$2(type2));
+      }
+      const integerStringRegExp = /^-?(?:0|[1-9][0-9]*)$/;
+      const __Schema$1 = new GraphQLObjectType({
+        name: "__Schema",
+        description:
+          "A GraphQL Schema defines the capabilities of a GraphQL server. It exposes all available types and directives on the server, as well as the entry points for query, mutation, and subscription operations.",
+        fields: () => ({
+          description: {
+            type: GraphQLString,
+            resolve: (schema) => schema.description,
+          },
+          types: {
+            description: "A list of all types supported by this server.",
+            type: new GraphQLNonNull(
+              new GraphQLList(new GraphQLNonNull(__Type$1))
+            ),
+            resolve(schema) {
+              return Object.values(schema.getTypeMap());
+            },
+          },
+          queryType: {
+            description: "The type that query operations will be rooted at.",
+            type: new GraphQLNonNull(__Type$1),
+            resolve: (schema) => schema.getQueryType(),
+          },
+          mutationType: {
+            description:
+              "If this server supports mutation, the type that mutation operations will be rooted at.",
+            type: __Type$1,
+            resolve: (schema) => schema.getMutationType(),
+          },
+          subscriptionType: {
+            description:
+              "If this server support subscription, the type that subscription operations will be rooted at.",
+            type: __Type$1,
+            resolve: (schema) => schema.getSubscriptionType(),
+          },
+          directives: {
+            description: "A list of all directives supported by this server.",
+            type: new GraphQLNonNull(
+              new GraphQLList(new GraphQLNonNull(__Directive$1))
+            ),
+            resolve: (schema) => schema.getDirectives(),
+          },
+        }),
+      });
+      const __Directive$1 = new GraphQLObjectType({
+        name: "__Directive",
+        description:
+          "A Directive provides a way to describe alternate runtime execution and type validation behavior in a GraphQL document.\n\nIn some cases, you need to provide options to alter GraphQL's execution behavior in ways field arguments will not suffice, such as conditionally including or skipping a field. Directives provide this by describing additional information to the executor.",
+        fields: () => ({
+          name: {
+            type: new GraphQLNonNull(GraphQLString),
+            resolve: (directive) => directive.name,
+          },
+          description: {
+            type: GraphQLString,
+            resolve: (directive) => directive.description,
+          },
+          isRepeatable: {
+            type: new GraphQLNonNull(GraphQLBoolean),
+            resolve: (directive) => directive.isRepeatable,
+          },
+          locations: {
+            type: new GraphQLNonNull(
+              new GraphQLList(new GraphQLNonNull(__DirectiveLocation))
+            ),
+            resolve: (directive) => directive.locations,
+          },
+          args: {
+            type: new GraphQLNonNull(
+              new GraphQLList(new GraphQLNonNull(__InputValue$1))
+            ),
+            args: {
+              includeDeprecated: {
+                type: GraphQLBoolean,
+                defaultValue: false,
+              },
+            },
+            resolve(field, { includeDeprecated }) {
+              return includeDeprecated
+                ? field.args
+                : field.args.filter((arg) => arg.deprecationReason == null);
+            },
+          },
+        }),
+      });
+      const __DirectiveLocation = new GraphQLEnumType({
+        name: "__DirectiveLocation",
+        description:
+          "A Directive can be adjacent to many parts of the GraphQL language, a __DirectiveLocation describes one such possible adjacencies.",
+        values: {
+          QUERY: {
+            value: DirectiveLocation.QUERY,
+            description: "Location adjacent to a query operation.",
+          },
+          MUTATION: {
+            value: DirectiveLocation.MUTATION,
+            description: "Location adjacent to a mutation operation.",
+          },
+          SUBSCRIPTION: {
+            value: DirectiveLocation.SUBSCRIPTION,
+            description: "Location adjacent to a subscription operation.",
+          },
+          FIELD: {
+            value: DirectiveLocation.FIELD,
+            description: "Location adjacent to a field.",
+          },
+          FRAGMENT_DEFINITION: {
+            value: DirectiveLocation.FRAGMENT_DEFINITION,
+            description: "Location adjacent to a fragment definition.",
+          },
+          FRAGMENT_SPREAD: {
+            value: DirectiveLocation.FRAGMENT_SPREAD,
+            description: "Location adjacent to a fragment spread.",
+          },
+          INLINE_FRAGMENT: {
+            value: DirectiveLocation.INLINE_FRAGMENT,
+            description: "Location adjacent to an inline fragment.",
+          },
+          VARIABLE_DEFINITION: {
+            value: DirectiveLocation.VARIABLE_DEFINITION,
+            description: "Location adjacent to a variable definition.",
+          },
+          SCHEMA: {
+            value: DirectiveLocation.SCHEMA,
+            description: "Location adjacent to a schema definition.",
+          },
+          SCALAR: {
+            value: DirectiveLocation.SCALAR,
+            description: "Location adjacent to a scalar definition.",
+          },
+          OBJECT: {
+            value: DirectiveLocation.OBJECT,
+            description: "Location adjacent to an object type definition.",
+          },
+          FIELD_DEFINITION: {
+            value: DirectiveLocation.FIELD_DEFINITION,
+            description: "Location adjacent to a field definition.",
+          },
+          ARGUMENT_DEFINITION: {
+            value: DirectiveLocation.ARGUMENT_DEFINITION,
+            description: "Location adjacent to an argument definition.",
+          },
+          INTERFACE: {
+            value: DirectiveLocation.INTERFACE,
+            description: "Location adjacent to an interface definition.",
+          },
+          UNION: {
+            value: DirectiveLocation.UNION,
+            description: "Location adjacent to a union definition.",
+          },
+          ENUM: {
+            value: DirectiveLocation.ENUM,
+            description: "Location adjacent to an enum definition.",
+          },
+          ENUM_VALUE: {
+            value: DirectiveLocation.ENUM_VALUE,
+            description: "Location adjacent to an enum value definition.",
+          },
+          INPUT_OBJECT: {
+            value: DirectiveLocation.INPUT_OBJECT,
+            description:
+              "Location adjacent to an input object type definition.",
+          },
+          INPUT_FIELD_DEFINITION: {
+            value: DirectiveLocation.INPUT_FIELD_DEFINITION,
+            description:
+              "Location adjacent to an input object field definition.",
+          },
+        },
+      });
+      const __Type$1 = new GraphQLObjectType({
+        name: "__Type",
+        description:
+          "The fundamental unit of any GraphQL Schema is the type. There are many kinds of types in GraphQL as represented by the `__TypeKind` enum.\n\nDepending on the kind of a type, certain fields describe information about that type. Scalar types provide no information beyond a name, description and optional `specifiedByURL`, while Enum types provide their values. Object and Interface types provide the fields they describe. Abstract types, Union and Interface, provide the Object types possible at runtime. List and NonNull types compose other types.",
+        fields: () => ({
+          kind: {
+            type: new GraphQLNonNull(__TypeKind),
+            resolve(type2) {
+              if (isScalarType(type2)) {
+                return TypeKind.SCALAR;
+              }
+              if (isObjectType(type2)) {
+                return TypeKind.OBJECT;
+              }
+              if (isInterfaceType(type2)) {
+                return TypeKind.INTERFACE;
+              }
+              if (isUnionType(type2)) {
+                return TypeKind.UNION;
+              }
+              if (isEnumType(type2)) {
+                return TypeKind.ENUM;
+              }
+              if (isInputObjectType(type2)) {
+                return TypeKind.INPUT_OBJECT;
+              }
+              if (isListType(type2)) {
+                return TypeKind.LIST;
+              }
+              if (isNonNullType(type2)) {
+                return TypeKind.NON_NULL;
+              }
+              invariant$2(false, `Unexpected type: "${inspect$2(type2)}".`);
+            },
+          },
+          name: {
+            type: GraphQLString,
+            resolve: (type2) => ("name" in type2 ? type2.name : void 0),
+          },
+          description: {
+            type: GraphQLString,
+            resolve: (type2) =>
+              "description" in type2 ? type2.description : void 0,
+          },
+          specifiedByURL: {
+            type: GraphQLString,
+            resolve: (obj) =>
+              "specifiedByURL" in obj ? obj.specifiedByURL : void 0,
+          },
+          fields: {
+            type: new GraphQLList(new GraphQLNonNull(__Field$1)),
+            args: {
+              includeDeprecated: {
+                type: GraphQLBoolean,
+                defaultValue: false,
+              },
+            },
+            resolve(type2, { includeDeprecated }) {
+              if (isObjectType(type2) || isInterfaceType(type2)) {
+                const fields = Object.values(type2.getFields());
+                return includeDeprecated
+                  ? fields
+                  : fields.filter((field) => field.deprecationReason == null);
+              }
+            },
+          },
+          interfaces: {
+            type: new GraphQLList(new GraphQLNonNull(__Type$1)),
+            resolve(type2) {
+              if (isObjectType(type2) || isInterfaceType(type2)) {
+                return type2.getInterfaces();
+              }
+            },
+          },
+          possibleTypes: {
+            type: new GraphQLList(new GraphQLNonNull(__Type$1)),
+            resolve(type2, _args, _context, { schema }) {
+              if (isAbstractType(type2)) {
+                return schema.getPossibleTypes(type2);
+              }
+            },
+          },
+          enumValues: {
+            type: new GraphQLList(new GraphQLNonNull(__EnumValue)),
+            args: {
+              includeDeprecated: {
+                type: GraphQLBoolean,
+                defaultValue: false,
+              },
+            },
+            resolve(type2, { includeDeprecated }) {
+              if (isEnumType(type2)) {
+                const values = type2.getValues();
+                return includeDeprecated
+                  ? values
+                  : values.filter((field) => field.deprecationReason == null);
+              }
+            },
+          },
+          inputFields: {
+            type: new GraphQLList(new GraphQLNonNull(__InputValue$1)),
+            args: {
+              includeDeprecated: {
+                type: GraphQLBoolean,
+                defaultValue: false,
+              },
+            },
+            resolve(type2, { includeDeprecated }) {
+              if (isInputObjectType(type2)) {
+                const values = Object.values(type2.getFields());
+                return includeDeprecated
+                  ? values
+                  : values.filter((field) => field.deprecationReason == null);
+              }
+            },
+          },
+          ofType: {
+            type: __Type$1,
+            resolve: (type2) => ("ofType" in type2 ? type2.ofType : void 0),
+          },
+        }),
+      });
+      const __Field$1 = new GraphQLObjectType({
+        name: "__Field",
+        description:
+          "Object and Interface types are described by a list of Fields, each of which has a name, potentially a list of arguments, and a return type.",
+        fields: () => ({
+          name: {
+            type: new GraphQLNonNull(GraphQLString),
+            resolve: (field) => field.name,
+          },
+          description: {
+            type: GraphQLString,
+            resolve: (field) => field.description,
+          },
+          args: {
+            type: new GraphQLNonNull(
+              new GraphQLList(new GraphQLNonNull(__InputValue$1))
+            ),
+            args: {
+              includeDeprecated: {
+                type: GraphQLBoolean,
+                defaultValue: false,
+              },
+            },
+            resolve(field, { includeDeprecated }) {
+              return includeDeprecated
+                ? field.args
+                : field.args.filter((arg) => arg.deprecationReason == null);
+            },
+          },
+          type: {
+            type: new GraphQLNonNull(__Type$1),
+            resolve: (field) => field.type,
+          },
+          isDeprecated: {
+            type: new GraphQLNonNull(GraphQLBoolean),
+            resolve: (field) => field.deprecationReason != null,
+          },
+          deprecationReason: {
+            type: GraphQLString,
+            resolve: (field) => field.deprecationReason,
+          },
+        }),
+      });
+      const __InputValue$1 = new GraphQLObjectType({
+        name: "__InputValue",
+        description:
+          "Arguments provided to Fields or Directives and the input fields of an InputObject are represented as Input Values which describe their type and optionally a default value.",
+        fields: () => ({
+          name: {
+            type: new GraphQLNonNull(GraphQLString),
+            resolve: (inputValue) => inputValue.name,
+          },
+          description: {
+            type: GraphQLString,
+            resolve: (inputValue) => inputValue.description,
+          },
+          type: {
+            type: new GraphQLNonNull(__Type$1),
+            resolve: (inputValue) => inputValue.type,
+          },
+          defaultValue: {
+            type: GraphQLString,
+            description:
+              "A GraphQL-formatted string representing the default value for this input value.",
+            resolve(inputValue) {
+              const { type: type2, defaultValue: defaultValue2 } = inputValue;
+              const valueAST = astFromValue(defaultValue2, type2);
+              return valueAST ? print(valueAST) : null;
+            },
+          },
+          isDeprecated: {
+            type: new GraphQLNonNull(GraphQLBoolean),
+            resolve: (field) => field.deprecationReason != null,
+          },
+          deprecationReason: {
+            type: GraphQLString,
+            resolve: (obj) => obj.deprecationReason,
+          },
+        }),
+      });
+      const __EnumValue = new GraphQLObjectType({
+        name: "__EnumValue",
+        description:
+          "One possible value for a given Enum. Enum values are unique values, not a placeholder for a string or numeric value. However an Enum value is returned in a JSON response as a string.",
+        fields: () => ({
+          name: {
+            type: new GraphQLNonNull(GraphQLString),
+            resolve: (enumValue) => enumValue.name,
+          },
+          description: {
+            type: GraphQLString,
+            resolve: (enumValue) => enumValue.description,
+          },
+          isDeprecated: {
+            type: new GraphQLNonNull(GraphQLBoolean),
+            resolve: (enumValue) => enumValue.deprecationReason != null,
+          },
+          deprecationReason: {
+            type: GraphQLString,
+            resolve: (enumValue) => enumValue.deprecationReason,
+          },
+        }),
+      });
+      let TypeKind;
+      (function (TypeKind2) {
+        TypeKind2["SCALAR"] = "SCALAR";
+        TypeKind2["OBJECT"] = "OBJECT";
+        TypeKind2["INTERFACE"] = "INTERFACE";
+        TypeKind2["UNION"] = "UNION";
+        TypeKind2["ENUM"] = "ENUM";
+        TypeKind2["INPUT_OBJECT"] = "INPUT_OBJECT";
+        TypeKind2["LIST"] = "LIST";
+        TypeKind2["NON_NULL"] = "NON_NULL";
+      })(TypeKind || (TypeKind = {}));
+      const __TypeKind = new GraphQLEnumType({
+        name: "__TypeKind",
+        description:
+          "An enum describing what kind of type a given `__Type` is.",
+        values: {
+          SCALAR: {
+            value: TypeKind.SCALAR,
+            description: "Indicates this type is a scalar.",
+          },
+          OBJECT: {
+            value: TypeKind.OBJECT,
+            description:
+              "Indicates this type is an object. `fields` and `interfaces` are valid fields.",
+          },
+          INTERFACE: {
+            value: TypeKind.INTERFACE,
+            description:
+              "Indicates this type is an interface. `fields`, `interfaces`, and `possibleTypes` are valid fields.",
+          },
+          UNION: {
+            value: TypeKind.UNION,
+            description:
+              "Indicates this type is a union. `possibleTypes` is a valid field.",
+          },
+          ENUM: {
+            value: TypeKind.ENUM,
+            description:
+              "Indicates this type is an enum. `enumValues` is a valid field.",
+          },
+          INPUT_OBJECT: {
+            value: TypeKind.INPUT_OBJECT,
+            description:
+              "Indicates this type is an input object. `inputFields` is a valid field.",
+          },
+          LIST: {
+            value: TypeKind.LIST,
+            description:
+              "Indicates this type is a list. `ofType` is a valid field.",
+          },
+          NON_NULL: {
+            value: TypeKind.NON_NULL,
+            description:
+              "Indicates this type is a non-null. `ofType` is a valid field.",
+          },
+        },
+      });
+      const SchemaMetaFieldDef$1 = {
+        name: "__schema",
+        type: new GraphQLNonNull(__Schema$1),
+        description: "Access the current type schema of this server.",
+        args: [],
+        resolve: (_source, _args, _context, { schema }) => schema,
+        deprecationReason: void 0,
+        extensions: /* @__PURE__ */ Object.create(null),
+        astNode: void 0,
+      };
+      const TypeMetaFieldDef$1 = {
+        name: "__type",
+        type: __Type$1,
+        description: "Request the type information of a single type.",
+        args: [
+          {
+            name: "name",
+            description: void 0,
+            type: new GraphQLNonNull(GraphQLString),
+            defaultValue: void 0,
+            deprecationReason: void 0,
+            extensions: /* @__PURE__ */ Object.create(null),
+            astNode: void 0,
+          },
+        ],
+        resolve: (_source, { name: name2 }, _context, { schema }) =>
+          schema.getType(name2),
+        deprecationReason: void 0,
+        extensions: /* @__PURE__ */ Object.create(null),
+        astNode: void 0,
+      };
+      const TypeNameMetaFieldDef = {
+        name: "__typename",
+        type: new GraphQLNonNull(GraphQLString),
+        description: "The name of the current Object type at runtime.",
+        args: [],
+        resolve: (_source, _args, _context, { parentType }) => parentType.name,
+        deprecationReason: void 0,
+        extensions: /* @__PURE__ */ Object.create(null),
+        astNode: void 0,
+      };
+      const introspectionTypes$1 = Object.freeze([
+        __Schema$1,
+        __Directive$1,
+        __DirectiveLocation,
+        __Type$1,
+        __Field$1,
+        __InputValue$1,
+        __EnumValue,
+        __TypeKind,
+      ]);
+      function isIntrospectionType(type2) {
+        return introspectionTypes$1.some(
+          ({ name: name2 }) => type2.name === name2
+        );
+      }
+      var introspection = /* @__PURE__ */ Object.freeze({
+        __proto__: null,
+        [Symbol.toStringTag]: "Module",
+        __Schema: __Schema$1,
+        __Directive: __Directive$1,
+        __DirectiveLocation,
+        __Type: __Type$1,
+        __Field: __Field$1,
+        __InputValue: __InputValue$1,
+        __EnumValue,
+        get TypeKind() {
+          return TypeKind;
+        },
+        __TypeKind,
+        SchemaMetaFieldDef: SchemaMetaFieldDef$1,
+        TypeMetaFieldDef: TypeMetaFieldDef$1,
+        TypeNameMetaFieldDef,
+        introspectionTypes: introspectionTypes$1,
+        isIntrospectionType,
+      });
+      function isSchema(schema) {
+        return instanceOf(schema, GraphQLSchema);
+      }
+      function assertSchema(schema) {
+        if (!isSchema(schema)) {
+          throw new Error(
+            `Expected ${inspect$2(schema)} to be a GraphQL schema.`
+          );
+        }
+        return schema;
+      }
+      class GraphQLSchema {
+        constructor(config2) {
+          var _config$extensionASTN, _config$directives;
+          this.__validationErrors = config2.assumeValid === true ? [] : void 0;
+          isObjectLike$1(config2) ||
+            devAssert$1(false, "Must provide configuration object.");
+          !config2.types ||
+            Array.isArray(config2.types) ||
+            devAssert$1(
+              false,
+              `"types" must be Array if provided but got: ${inspect$2(
+                config2.types
+              )}.`
+            );
+          !config2.directives ||
+            Array.isArray(config2.directives) ||
+            devAssert$1(
+              false,
+              `"directives" must be Array if provided but got: ${inspect$2(
+                config2.directives
+              )}.`
+            );
+          this.description = config2.description;
+          this.extensions = toObjMap(config2.extensions);
+          this.astNode = config2.astNode;
+          this.extensionASTNodes =
+            (_config$extensionASTN = config2.extensionASTNodes) !== null &&
+            _config$extensionASTN !== void 0
+              ? _config$extensionASTN
+              : [];
+          this._queryType = config2.query;
+          this._mutationType = config2.mutation;
+          this._subscriptionType = config2.subscription;
+          this._directives =
+            (_config$directives = config2.directives) !== null &&
+            _config$directives !== void 0
+              ? _config$directives
+              : specifiedDirectives;
+          const allReferencedTypes = new Set(config2.types);
+          if (config2.types != null) {
+            for (const type2 of config2.types) {
+              allReferencedTypes.delete(type2);
+              collectReferencedTypes(type2, allReferencedTypes);
+            }
+          }
+          if (this._queryType != null) {
+            collectReferencedTypes(this._queryType, allReferencedTypes);
+          }
+          if (this._mutationType != null) {
+            collectReferencedTypes(this._mutationType, allReferencedTypes);
+          }
+          if (this._subscriptionType != null) {
+            collectReferencedTypes(this._subscriptionType, allReferencedTypes);
+          }
+          for (const directive of this._directives) {
+            if (isDirective(directive)) {
+              for (const arg of directive.args) {
+                collectReferencedTypes(arg.type, allReferencedTypes);
+              }
+            }
+          }
+          collectReferencedTypes(__Schema$1, allReferencedTypes);
+          this._typeMap = /* @__PURE__ */ Object.create(null);
+          this._subTypeMap = /* @__PURE__ */ Object.create(null);
+          this._implementationsMap = /* @__PURE__ */ Object.create(null);
+          for (const namedType of allReferencedTypes) {
+            if (namedType == null) {
+              continue;
+            }
+            const typeName = namedType.name;
+            typeName ||
+              devAssert$1(
+                false,
+                "One of the provided types for building the Schema is missing a name."
+              );
+            if (this._typeMap[typeName] !== void 0) {
+              throw new Error(
+                `Schema must contain uniquely named types but contains multiple types named "${typeName}".`
+              );
+            }
+            this._typeMap[typeName] = namedType;
+            if (isInterfaceType(namedType)) {
+              for (const iface of namedType.getInterfaces()) {
+                if (isInterfaceType(iface)) {
+                  let implementations = this._implementationsMap[iface.name];
+                  if (implementations === void 0) {
+                    implementations = this._implementationsMap[iface.name] = {
+                      objects: [],
+                      interfaces: [],
+                    };
+                  }
+                  implementations.interfaces.push(namedType);
+                }
+              }
+            } else if (isObjectType(namedType)) {
+              for (const iface of namedType.getInterfaces()) {
+                if (isInterfaceType(iface)) {
+                  let implementations = this._implementationsMap[iface.name];
+                  if (implementations === void 0) {
+                    implementations = this._implementationsMap[iface.name] = {
+                      objects: [],
+                      interfaces: [],
+                    };
+                  }
+                  implementations.objects.push(namedType);
+                }
+              }
+            }
+          }
+        }
+        get [Symbol.toStringTag]() {
+          return "GraphQLSchema";
+        }
+        getQueryType() {
+          return this._queryType;
+        }
+        getMutationType() {
+          return this._mutationType;
+        }
+        getSubscriptionType() {
+          return this._subscriptionType;
+        }
+        getRootType(operation) {
+          switch (operation) {
+            case OperationTypeNode.QUERY:
+              return this.getQueryType();
+            case OperationTypeNode.MUTATION:
+              return this.getMutationType();
+            case OperationTypeNode.SUBSCRIPTION:
+              return this.getSubscriptionType();
+          }
+        }
+        getTypeMap() {
+          return this._typeMap;
+        }
+        getType(name2) {
+          return this.getTypeMap()[name2];
+        }
+        getPossibleTypes(abstractType) {
+          return isUnionType(abstractType)
+            ? abstractType.getTypes()
+            : this.getImplementations(abstractType).objects;
+        }
+        getImplementations(interfaceType) {
+          const implementations = this._implementationsMap[interfaceType.name];
+          return implementations !== null && implementations !== void 0
+            ? implementations
+            : {
+                objects: [],
+                interfaces: [],
+              };
+        }
+        isSubType(abstractType, maybeSubType) {
+          let map2 = this._subTypeMap[abstractType.name];
+          if (map2 === void 0) {
+            map2 = /* @__PURE__ */ Object.create(null);
+            if (isUnionType(abstractType)) {
+              for (const type2 of abstractType.getTypes()) {
+                map2[type2.name] = true;
+              }
+            } else {
+              const implementations = this.getImplementations(abstractType);
+              for (const type2 of implementations.objects) {
+                map2[type2.name] = true;
+              }
+              for (const type2 of implementations.interfaces) {
+                map2[type2.name] = true;
+              }
+            }
+            this._subTypeMap[abstractType.name] = map2;
+          }
+          return map2[maybeSubType.name] !== void 0;
+        }
+        getDirectives() {
+          return this._directives;
+        }
+        getDirective(name2) {
+          return this.getDirectives().find(
+            (directive) => directive.name === name2
+          );
+        }
+        toConfig() {
+          return {
+            description: this.description,
+            query: this.getQueryType(),
+            mutation: this.getMutationType(),
+            subscription: this.getSubscriptionType(),
+            types: Object.values(this.getTypeMap()),
+            directives: this.getDirectives(),
+            extensions: this.extensions,
+            astNode: this.astNode,
+            extensionASTNodes: this.extensionASTNodes,
+            assumeValid: this.__validationErrors !== void 0,
+          };
+        }
+      }
+      function collectReferencedTypes(type2, typeSet) {
+        const namedType = getNamedType(type2);
+        if (!typeSet.has(namedType)) {
+          typeSet.add(namedType);
+          if (isUnionType(namedType)) {
+            for (const memberType of namedType.getTypes()) {
+              collectReferencedTypes(memberType, typeSet);
+            }
+          } else if (isObjectType(namedType) || isInterfaceType(namedType)) {
+            for (const interfaceType of namedType.getInterfaces()) {
+              collectReferencedTypes(interfaceType, typeSet);
+            }
+            for (const field of Object.values(namedType.getFields())) {
+              collectReferencedTypes(field.type, typeSet);
+              for (const arg of field.args) {
+                collectReferencedTypes(arg.type, typeSet);
+              }
+            }
+          } else if (isInputObjectType(namedType)) {
+            for (const field of Object.values(namedType.getFields())) {
+              collectReferencedTypes(field.type, typeSet);
+            }
+          }
+        }
+        return typeSet;
+      }
+      function validateSchema(schema) {
+        assertSchema(schema);
+        if (schema.__validationErrors) {
+          return schema.__validationErrors;
+        }
+        const context = new SchemaValidationContext(schema);
+        validateRootTypes(context);
+        validateDirectives(context);
+        validateTypes$1(context);
+        const errors2 = context.getErrors();
+        schema.__validationErrors = errors2;
+        return errors2;
+      }
+      function assertValidSchema(schema) {
+        const errors2 = validateSchema(schema);
+        if (errors2.length !== 0) {
+          throw new Error(errors2.map((error2) => error2.message).join("\n\n"));
+        }
+      }
+      class SchemaValidationContext {
+        constructor(schema) {
+          this._errors = [];
+          this.schema = schema;
+        }
+        reportError(message, nodes) {
+          const _nodes = Array.isArray(nodes) ? nodes.filter(Boolean) : nodes;
+          this._errors.push(
+            new GraphQLError(message, {
+              nodes: _nodes,
+            })
+          );
+        }
+        getErrors() {
+          return this._errors;
+        }
+      }
+      function validateRootTypes(context) {
+        const schema = context.schema;
+        const queryType = schema.getQueryType();
+        if (!queryType) {
+          context.reportError(
+            "Query root type must be provided.",
+            schema.astNode
+          );
+        } else if (!isObjectType(queryType)) {
+          var _getOperationTypeNode;
+          context.reportError(
+            `Query root type must be Object type, it cannot be ${inspect$2(
+              queryType
+            )}.`,
+            (_getOperationTypeNode = getOperationTypeNode(
+              schema,
+              OperationTypeNode.QUERY
+            )) !== null && _getOperationTypeNode !== void 0
+              ? _getOperationTypeNode
+              : queryType.astNode
+          );
+        }
+        const mutationType = schema.getMutationType();
+        if (mutationType && !isObjectType(mutationType)) {
+          var _getOperationTypeNode2;
+          context.reportError(
+            `Mutation root type must be Object type if provided, it cannot be ${inspect$2(
+              mutationType
+            )}.`,
+            (_getOperationTypeNode2 = getOperationTypeNode(
+              schema,
+              OperationTypeNode.MUTATION
+            )) !== null && _getOperationTypeNode2 !== void 0
+              ? _getOperationTypeNode2
+              : mutationType.astNode
+          );
+        }
+        const subscriptionType = schema.getSubscriptionType();
+        if (subscriptionType && !isObjectType(subscriptionType)) {
+          var _getOperationTypeNode3;
+          context.reportError(
+            `Subscription root type must be Object type if provided, it cannot be ${inspect$2(
+              subscriptionType
+            )}.`,
+            (_getOperationTypeNode3 = getOperationTypeNode(
+              schema,
+              OperationTypeNode.SUBSCRIPTION
+            )) !== null && _getOperationTypeNode3 !== void 0
+              ? _getOperationTypeNode3
+              : subscriptionType.astNode
+          );
+        }
+      }
+      function getOperationTypeNode(schema, operation) {
+        var _flatMap$find;
+        return (_flatMap$find = [schema.astNode, ...schema.extensionASTNodes]
+          .flatMap((schemaNode) => {
+            var _schemaNode$operation;
+            return (_schemaNode$operation =
+              schemaNode === null || schemaNode === void 0
+                ? void 0
+                : schemaNode.operationTypes) !== null &&
+              _schemaNode$operation !== void 0
+              ? _schemaNode$operation
+              : [];
+          })
+          .find((operationNode) => operationNode.operation === operation)) ===
+          null || _flatMap$find === void 0
+          ? void 0
+          : _flatMap$find.type;
+      }
+      function validateDirectives(context) {
+        for (const directive of context.schema.getDirectives()) {
+          if (!isDirective(directive)) {
+            context.reportError(
+              `Expected directive but got: ${inspect$2(directive)}.`,
+              directive === null || directive === void 0
+                ? void 0
+                : directive.astNode
+            );
+            continue;
+          }
+          validateName(context, directive);
+          for (const arg of directive.args) {
+            validateName(context, arg);
+            if (!isInputType(arg.type)) {
+              context.reportError(
+                `The type of @${directive.name}(${
+                  arg.name
+                }:) must be Input Type but got: ${inspect$2(arg.type)}.`,
+                arg.astNode
+              );
+            }
+            if (isRequiredArgument$1(arg) && arg.deprecationReason != null) {
+              var _arg$astNode;
+              context.reportError(
+                `Required argument @${directive.name}(${arg.name}:) cannot be deprecated.`,
+                [
+                  getDeprecatedDirectiveNode(arg.astNode),
+                  (_arg$astNode = arg.astNode) === null ||
+                  _arg$astNode === void 0
+                    ? void 0
+                    : _arg$astNode.type,
+                ]
+              );
+            }
+          }
+        }
+      }
+      function validateName(context, node) {
+        if (node.name.startsWith("__")) {
+          context.reportError(
+            `Name "${node.name}" must not begin with "__", which is reserved by GraphQL introspection.`,
+            node.astNode
+          );
+        }
+      }
+      function validateTypes$1(context) {
+        const validateInputObjectCircularRefs =
+          createInputObjectCircularRefsValidator(context);
+        const typeMap = context.schema.getTypeMap();
+        for (const type2 of Object.values(typeMap)) {
+          if (!isNamedType(type2)) {
+            context.reportError(
+              `Expected GraphQL named type but got: ${inspect$2(type2)}.`,
+              type2.astNode
+            );
+            continue;
+          }
+          if (!isIntrospectionType(type2)) {
+            validateName(context, type2);
+          }
+          if (isObjectType(type2)) {
+            validateFields(context, type2);
+            validateInterfaces(context, type2);
+          } else if (isInterfaceType(type2)) {
+            validateFields(context, type2);
+            validateInterfaces(context, type2);
+          } else if (isUnionType(type2)) {
+            validateUnionMembers(context, type2);
+          } else if (isEnumType(type2)) {
+            validateEnumValues(context, type2);
+          } else if (isInputObjectType(type2)) {
+            validateInputFields(context, type2);
+            validateInputObjectCircularRefs(type2);
+          }
+        }
+      }
+      function validateFields(context, type2) {
+        const fields = Object.values(type2.getFields());
+        if (fields.length === 0) {
+          context.reportError(
+            `Type ${type2.name} must define one or more fields.`,
+            [type2.astNode, ...type2.extensionASTNodes]
+          );
+        }
+        for (const field of fields) {
+          validateName(context, field);
+          if (!isOutputType(field.type)) {
+            var _field$astNode;
+            context.reportError(
+              `The type of ${type2.name}.${
+                field.name
+              } must be Output Type but got: ${inspect$2(field.type)}.`,
+              (_field$astNode = field.astNode) === null ||
+                _field$astNode === void 0
+                ? void 0
+                : _field$astNode.type
+            );
+          }
+          for (const arg of field.args) {
+            const argName = arg.name;
+            validateName(context, arg);
+            if (!isInputType(arg.type)) {
+              var _arg$astNode2;
+              context.reportError(
+                `The type of ${type2.name}.${
+                  field.name
+                }(${argName}:) must be Input Type but got: ${inspect$2(
+                  arg.type
+                )}.`,
+                (_arg$astNode2 = arg.astNode) === null ||
+                  _arg$astNode2 === void 0
+                  ? void 0
+                  : _arg$astNode2.type
+              );
+            }
+            if (isRequiredArgument$1(arg) && arg.deprecationReason != null) {
+              var _arg$astNode3;
+              context.reportError(
+                `Required argument ${type2.name}.${field.name}(${argName}:) cannot be deprecated.`,
+                [
+                  getDeprecatedDirectiveNode(arg.astNode),
+                  (_arg$astNode3 = arg.astNode) === null ||
+                  _arg$astNode3 === void 0
+                    ? void 0
+                    : _arg$astNode3.type,
+                ]
+              );
+            }
+          }
+        }
+      }
+      function validateInterfaces(context, type2) {
+        const ifaceTypeNames = /* @__PURE__ */ Object.create(null);
+        for (const iface of type2.getInterfaces()) {
+          if (!isInterfaceType(iface)) {
+            context.reportError(
+              `Type ${inspect$2(
+                type2
+              )} must only implement Interface types, it cannot implement ${inspect$2(
+                iface
+              )}.`,
+              getAllImplementsInterfaceNodes(type2, iface)
+            );
+            continue;
+          }
+          if (type2 === iface) {
+            context.reportError(
+              `Type ${type2.name} cannot implement itself because it would create a circular reference.`,
+              getAllImplementsInterfaceNodes(type2, iface)
+            );
+            continue;
+          }
+          if (ifaceTypeNames[iface.name]) {
+            context.reportError(
+              `Type ${type2.name} can only implement ${iface.name} once.`,
+              getAllImplementsInterfaceNodes(type2, iface)
+            );
+            continue;
+          }
+          ifaceTypeNames[iface.name] = true;
+          validateTypeImplementsAncestors(context, type2, iface);
+          validateTypeImplementsInterface(context, type2, iface);
+        }
+      }
+      function validateTypeImplementsInterface(context, type2, iface) {
+        const typeFieldMap = type2.getFields();
+        for (const ifaceField of Object.values(iface.getFields())) {
+          const fieldName = ifaceField.name;
+          const typeField = typeFieldMap[fieldName];
+          if (!typeField) {
+            context.reportError(
+              `Interface field ${iface.name}.${fieldName} expected but ${type2.name} does not provide it.`,
+              [ifaceField.astNode, type2.astNode, ...type2.extensionASTNodes]
+            );
+            continue;
+          }
+          if (
+            !isTypeSubTypeOf(context.schema, typeField.type, ifaceField.type)
+          ) {
+            var _ifaceField$astNode, _typeField$astNode;
+            context.reportError(
+              `Interface field ${
+                iface.name
+              }.${fieldName} expects type ${inspect$2(ifaceField.type)} but ${
+                type2.name
+              }.${fieldName} is type ${inspect$2(typeField.type)}.`,
+              [
+                (_ifaceField$astNode = ifaceField.astNode) === null ||
+                _ifaceField$astNode === void 0
+                  ? void 0
+                  : _ifaceField$astNode.type,
+                (_typeField$astNode = typeField.astNode) === null ||
+                _typeField$astNode === void 0
+                  ? void 0
+                  : _typeField$astNode.type,
+              ]
+            );
+          }
+          for (const ifaceArg of ifaceField.args) {
+            const argName = ifaceArg.name;
+            const typeArg = typeField.args.find((arg) => arg.name === argName);
+            if (!typeArg) {
+              context.reportError(
+                `Interface field argument ${iface.name}.${fieldName}(${argName}:) expected but ${type2.name}.${fieldName} does not provide it.`,
+                [ifaceArg.astNode, typeField.astNode]
+              );
+              continue;
+            }
+            if (!isEqualType(ifaceArg.type, typeArg.type)) {
+              var _ifaceArg$astNode, _typeArg$astNode;
+              context.reportError(
+                `Interface field argument ${
+                  iface.name
+                }.${fieldName}(${argName}:) expects type ${inspect$2(
+                  ifaceArg.type
+                )} but ${
+                  type2.name
+                }.${fieldName}(${argName}:) is type ${inspect$2(
+                  typeArg.type
+                )}.`,
+                [
+                  (_ifaceArg$astNode = ifaceArg.astNode) === null ||
+                  _ifaceArg$astNode === void 0
+                    ? void 0
+                    : _ifaceArg$astNode.type,
+                  (_typeArg$astNode = typeArg.astNode) === null ||
+                  _typeArg$astNode === void 0
+                    ? void 0
+                    : _typeArg$astNode.type,
+                ]
+              );
+            }
+          }
+          for (const typeArg of typeField.args) {
+            const argName = typeArg.name;
+            const ifaceArg = ifaceField.args.find(
+              (arg) => arg.name === argName
+            );
+            if (!ifaceArg && isRequiredArgument$1(typeArg)) {
+              context.reportError(
+                `Object field ${type2.name}.${fieldName} includes required argument ${argName} that is missing from the Interface field ${iface.name}.${fieldName}.`,
+                [typeArg.astNode, ifaceField.astNode]
+              );
+            }
+          }
+        }
+      }
+      function validateTypeImplementsAncestors(context, type2, iface) {
+        const ifaceInterfaces = type2.getInterfaces();
+        for (const transitive of iface.getInterfaces()) {
+          if (!ifaceInterfaces.includes(transitive)) {
+            context.reportError(
+              transitive === type2
+                ? `Type ${type2.name} cannot implement ${iface.name} because it would create a circular reference.`
+                : `Type ${type2.name} must implement ${transitive.name} because it is implemented by ${iface.name}.`,
+              [
+                ...getAllImplementsInterfaceNodes(iface, transitive),
+                ...getAllImplementsInterfaceNodes(type2, iface),
+              ]
+            );
+          }
+        }
+      }
+      function validateUnionMembers(context, union2) {
+        const memberTypes = union2.getTypes();
+        if (memberTypes.length === 0) {
+          context.reportError(
+            `Union type ${union2.name} must define one or more member types.`,
+            [union2.astNode, ...union2.extensionASTNodes]
+          );
+        }
+        const includedTypeNames = /* @__PURE__ */ Object.create(null);
+        for (const memberType of memberTypes) {
+          if (includedTypeNames[memberType.name]) {
+            context.reportError(
+              `Union type ${union2.name} can only include type ${memberType.name} once.`,
+              getUnionMemberTypeNodes(union2, memberType.name)
+            );
+            continue;
+          }
+          includedTypeNames[memberType.name] = true;
+          if (!isObjectType(memberType)) {
+            context.reportError(
+              `Union type ${
+                union2.name
+              } can only include Object types, it cannot include ${inspect$2(
+                memberType
+              )}.`,
+              getUnionMemberTypeNodes(union2, String(memberType))
+            );
+          }
+        }
+      }
+      function validateEnumValues(context, enumType) {
+        const enumValues = enumType.getValues();
+        if (enumValues.length === 0) {
+          context.reportError(
+            `Enum type ${enumType.name} must define one or more values.`,
+            [enumType.astNode, ...enumType.extensionASTNodes]
+          );
+        }
+        for (const enumValue of enumValues) {
+          validateName(context, enumValue);
+        }
+      }
+      function validateInputFields(context, inputObj) {
+        const fields = Object.values(inputObj.getFields());
+        if (fields.length === 0) {
+          context.reportError(
+            `Input Object type ${inputObj.name} must define one or more fields.`,
+            [inputObj.astNode, ...inputObj.extensionASTNodes]
+          );
+        }
+        for (const field of fields) {
+          validateName(context, field);
+          if (!isInputType(field.type)) {
+            var _field$astNode2;
+            context.reportError(
+              `The type of ${inputObj.name}.${
+                field.name
+              } must be Input Type but got: ${inspect$2(field.type)}.`,
+              (_field$astNode2 = field.astNode) === null ||
+                _field$astNode2 === void 0
+                ? void 0
+                : _field$astNode2.type
+            );
+          }
+          if (isRequiredInputField(field) && field.deprecationReason != null) {
+            var _field$astNode3;
+            context.reportError(
+              `Required input field ${inputObj.name}.${field.name} cannot be deprecated.`,
+              [
+                getDeprecatedDirectiveNode(field.astNode),
+                (_field$astNode3 = field.astNode) === null ||
+                _field$astNode3 === void 0
+                  ? void 0
+                  : _field$astNode3.type,
+              ]
+            );
+          }
+        }
+      }
+      function createInputObjectCircularRefsValidator(context) {
+        const visitedTypes = /* @__PURE__ */ Object.create(null);
+        const fieldPath = [];
+        const fieldPathIndexByTypeName = /* @__PURE__ */ Object.create(null);
+        return detectCycleRecursive;
+        function detectCycleRecursive(inputObj) {
+          if (visitedTypes[inputObj.name]) {
+            return;
+          }
+          visitedTypes[inputObj.name] = true;
+          fieldPathIndexByTypeName[inputObj.name] = fieldPath.length;
+          const fields = Object.values(inputObj.getFields());
+          for (const field of fields) {
+            if (
+              isNonNullType(field.type) &&
+              isInputObjectType(field.type.ofType)
+            ) {
+              const fieldType = field.type.ofType;
+              const cycleIndex = fieldPathIndexByTypeName[fieldType.name];
+              fieldPath.push(field);
+              if (cycleIndex === void 0) {
+                detectCycleRecursive(fieldType);
+              } else {
+                const cyclePath = fieldPath.slice(cycleIndex);
+                const pathStr = cyclePath
+                  .map((fieldObj) => fieldObj.name)
+                  .join(".");
+                context.reportError(
+                  `Cannot reference Input Object "${fieldType.name}" within itself through a series of non-null fields: "${pathStr}".`,
+                  cyclePath.map((fieldObj) => fieldObj.astNode)
+                );
+              }
+              fieldPath.pop();
+            }
+          }
+          fieldPathIndexByTypeName[inputObj.name] = void 0;
+        }
+      }
+      function getAllImplementsInterfaceNodes(type2, iface) {
+        const { astNode, extensionASTNodes } = type2;
+        const nodes =
+          astNode != null ? [astNode, ...extensionASTNodes] : extensionASTNodes;
+        return nodes
+          .flatMap((typeNode) => {
+            var _typeNode$interfaces;
+            return (_typeNode$interfaces = typeNode.interfaces) !== null &&
+              _typeNode$interfaces !== void 0
+              ? _typeNode$interfaces
+              : [];
+          })
+          .filter((ifaceNode) => ifaceNode.name.value === iface.name);
+      }
+      function getUnionMemberTypeNodes(union2, typeName) {
+        const { astNode, extensionASTNodes } = union2;
+        const nodes =
+          astNode != null ? [astNode, ...extensionASTNodes] : extensionASTNodes;
+        return nodes
+          .flatMap((unionNode) => {
+            var _unionNode$types;
+            return (_unionNode$types = unionNode.types) !== null &&
+              _unionNode$types !== void 0
+              ? _unionNode$types
+              : [];
+          })
+          .filter((typeNode) => typeNode.name.value === typeName);
+      }
+      function getDeprecatedDirectiveNode(definitionNode) {
+        var _definitionNode$direc;
+        return definitionNode === null || definitionNode === void 0
+          ? void 0
+          : (_definitionNode$direc = definitionNode.directives) === null ||
+            _definitionNode$direc === void 0
+          ? void 0
+          : _definitionNode$direc.find(
+              (node) => node.name.value === GraphQLDeprecatedDirective.name
+            );
+      }
+      function typeFromAST(schema, typeNode) {
+        switch (typeNode.kind) {
+          case Kind.LIST_TYPE: {
+            const innerType = typeFromAST(schema, typeNode.type);
+            return innerType && new GraphQLList(innerType);
+          }
+          case Kind.NON_NULL_TYPE: {
+            const innerType = typeFromAST(schema, typeNode.type);
+            return innerType && new GraphQLNonNull(innerType);
+          }
+          case Kind.NAMED_TYPE:
+            return schema.getType(typeNode.name.value);
+        }
+      }
+      class TypeInfo {
+        constructor(schema, initialType, getFieldDefFn) {
+          this._schema = schema;
+          this._typeStack = [];
+          this._parentTypeStack = [];
+          this._inputTypeStack = [];
+          this._fieldDefStack = [];
+          this._defaultValueStack = [];
+          this._directive = null;
+          this._argument = null;
+          this._enumValue = null;
+          this._getFieldDef =
+            getFieldDefFn !== null && getFieldDefFn !== void 0
+              ? getFieldDefFn
+              : getFieldDef$3;
+          if (initialType) {
+            if (isInputType(initialType)) {
+              this._inputTypeStack.push(initialType);
+            }
+            if (isCompositeType(initialType)) {
+              this._parentTypeStack.push(initialType);
+            }
+            if (isOutputType(initialType)) {
+              this._typeStack.push(initialType);
+            }
+          }
+        }
+        get [Symbol.toStringTag]() {
+          return "TypeInfo";
+        }
+        getType() {
+          if (this._typeStack.length > 0) {
+            return this._typeStack[this._typeStack.length - 1];
+          }
+        }
+        getParentType() {
+          if (this._parentTypeStack.length > 0) {
+            return this._parentTypeStack[this._parentTypeStack.length - 1];
+          }
+        }
+        getInputType() {
+          if (this._inputTypeStack.length > 0) {
+            return this._inputTypeStack[this._inputTypeStack.length - 1];
+          }
+        }
+        getParentInputType() {
+          if (this._inputTypeStack.length > 1) {
+            return this._inputTypeStack[this._inputTypeStack.length - 2];
+          }
+        }
+        getFieldDef() {
+          if (this._fieldDefStack.length > 0) {
+            return this._fieldDefStack[this._fieldDefStack.length - 1];
+          }
+        }
+        getDefaultValue() {
+          if (this._defaultValueStack.length > 0) {
+            return this._defaultValueStack[this._defaultValueStack.length - 1];
+          }
+        }
+        getDirective() {
+          return this._directive;
+        }
+        getArgument() {
+          return this._argument;
+        }
+        getEnumValue() {
+          return this._enumValue;
+        }
+        enter(node) {
+          const schema = this._schema;
+          switch (node.kind) {
+            case Kind.SELECTION_SET: {
+              const namedType = getNamedType(this.getType());
+              this._parentTypeStack.push(
+                isCompositeType(namedType) ? namedType : void 0
+              );
+              break;
+            }
+            case Kind.FIELD: {
+              const parentType = this.getParentType();
+              let fieldDef;
+              let fieldType;
+              if (parentType) {
+                fieldDef = this._getFieldDef(schema, parentType, node);
+                if (fieldDef) {
+                  fieldType = fieldDef.type;
+                }
+              }
+              this._fieldDefStack.push(fieldDef);
+              this._typeStack.push(
+                isOutputType(fieldType) ? fieldType : void 0
+              );
+              break;
+            }
+            case Kind.DIRECTIVE:
+              this._directive = schema.getDirective(node.name.value);
+              break;
+            case Kind.OPERATION_DEFINITION: {
+              const rootType = schema.getRootType(node.operation);
+              this._typeStack.push(isObjectType(rootType) ? rootType : void 0);
+              break;
+            }
+            case Kind.INLINE_FRAGMENT:
+            case Kind.FRAGMENT_DEFINITION: {
+              const typeConditionAST = node.typeCondition;
+              const outputType = typeConditionAST
+                ? typeFromAST(schema, typeConditionAST)
+                : getNamedType(this.getType());
+              this._typeStack.push(
+                isOutputType(outputType) ? outputType : void 0
+              );
+              break;
+            }
+            case Kind.VARIABLE_DEFINITION: {
+              const inputType = typeFromAST(schema, node.type);
+              this._inputTypeStack.push(
+                isInputType(inputType) ? inputType : void 0
+              );
+              break;
+            }
+            case Kind.ARGUMENT: {
+              var _this$getDirective;
+              let argDef;
+              let argType;
+              const fieldOrDirective =
+                (_this$getDirective = this.getDirective()) !== null &&
+                _this$getDirective !== void 0
+                  ? _this$getDirective
+                  : this.getFieldDef();
+              if (fieldOrDirective) {
+                argDef = fieldOrDirective.args.find(
+                  (arg) => arg.name === node.name.value
+                );
+                if (argDef) {
+                  argType = argDef.type;
+                }
+              }
+              this._argument = argDef;
+              this._defaultValueStack.push(
+                argDef ? argDef.defaultValue : void 0
+              );
+              this._inputTypeStack.push(
+                isInputType(argType) ? argType : void 0
+              );
+              break;
+            }
+            case Kind.LIST: {
+              const listType = getNullableType(this.getInputType());
+              const itemType = isListType(listType)
+                ? listType.ofType
+                : listType;
+              this._defaultValueStack.push(void 0);
+              this._inputTypeStack.push(
+                isInputType(itemType) ? itemType : void 0
+              );
+              break;
+            }
+            case Kind.OBJECT_FIELD: {
+              const objectType = getNamedType(this.getInputType());
+              let inputFieldType;
+              let inputField;
+              if (isInputObjectType(objectType)) {
+                inputField = objectType.getFields()[node.name.value];
+                if (inputField) {
+                  inputFieldType = inputField.type;
+                }
+              }
+              this._defaultValueStack.push(
+                inputField ? inputField.defaultValue : void 0
+              );
+              this._inputTypeStack.push(
+                isInputType(inputFieldType) ? inputFieldType : void 0
+              );
+              break;
+            }
+            case Kind.ENUM: {
+              const enumType = getNamedType(this.getInputType());
+              let enumValue;
+              if (isEnumType(enumType)) {
+                enumValue = enumType.getValue(node.value);
+              }
+              this._enumValue = enumValue;
+              break;
+            }
+          }
+        }
+        leave(node) {
+          switch (node.kind) {
+            case Kind.SELECTION_SET:
+              this._parentTypeStack.pop();
+              break;
+            case Kind.FIELD:
+              this._fieldDefStack.pop();
+              this._typeStack.pop();
+              break;
+            case Kind.DIRECTIVE:
+              this._directive = null;
+              break;
+            case Kind.OPERATION_DEFINITION:
+            case Kind.INLINE_FRAGMENT:
+            case Kind.FRAGMENT_DEFINITION:
+              this._typeStack.pop();
+              break;
+            case Kind.VARIABLE_DEFINITION:
+              this._inputTypeStack.pop();
+              break;
+            case Kind.ARGUMENT:
+              this._argument = null;
+              this._defaultValueStack.pop();
+              this._inputTypeStack.pop();
+              break;
+            case Kind.LIST:
+            case Kind.OBJECT_FIELD:
+              this._defaultValueStack.pop();
+              this._inputTypeStack.pop();
+              break;
+            case Kind.ENUM:
+              this._enumValue = null;
+              break;
+          }
+        }
+      }
+      function getFieldDef$3(schema, parentType, fieldNode) {
+        const name2 = fieldNode.name.value;
+        if (
+          name2 === SchemaMetaFieldDef$1.name &&
+          schema.getQueryType() === parentType
+        ) {
+          return SchemaMetaFieldDef$1;
+        }
+        if (
+          name2 === TypeMetaFieldDef$1.name &&
+          schema.getQueryType() === parentType
+        ) {
+          return TypeMetaFieldDef$1;
+        }
+        if (
+          name2 === TypeNameMetaFieldDef.name &&
+          isCompositeType(parentType)
+        ) {
+          return TypeNameMetaFieldDef;
+        }
+        if (isObjectType(parentType) || isInterfaceType(parentType)) {
+          return parentType.getFields()[name2];
+        }
+      }
+      function visitWithTypeInfo(typeInfo, visitor) {
+        return {
+          enter(...args) {
+            const node = args[0];
+            typeInfo.enter(node);
+            const fn = getEnterLeaveForKind(visitor, node.kind).enter;
+            if (fn) {
+              const result2 = fn.apply(visitor, args);
+              if (result2 !== void 0) {
+                typeInfo.leave(node);
+                if (isNode(result2)) {
+                  typeInfo.enter(result2);
+                }
+              }
+              return result2;
+            }
+          },
+          leave(...args) {
+            const node = args[0];
+            const fn = getEnterLeaveForKind(visitor, node.kind).leave;
+            let result2;
+            if (fn) {
+              result2 = fn.apply(visitor, args);
+            }
+            typeInfo.leave(node);
+            return result2;
+          },
+        };
+      }
+      function isDefinitionNode(node) {
+        return (
+          isExecutableDefinitionNode(node) ||
+          isTypeSystemDefinitionNode(node) ||
+          isTypeSystemExtensionNode(node)
+        );
+      }
+      function isExecutableDefinitionNode(node) {
+        return (
+          node.kind === Kind.OPERATION_DEFINITION ||
+          node.kind === Kind.FRAGMENT_DEFINITION
+        );
+      }
+      function isSelectionNode(node) {
+        return (
+          node.kind === Kind.FIELD ||
+          node.kind === Kind.FRAGMENT_SPREAD ||
+          node.kind === Kind.INLINE_FRAGMENT
+        );
+      }
+      function isValueNode(node) {
+        return (
+          node.kind === Kind.VARIABLE ||
+          node.kind === Kind.INT ||
+          node.kind === Kind.FLOAT ||
+          node.kind === Kind.STRING ||
+          node.kind === Kind.BOOLEAN ||
+          node.kind === Kind.NULL ||
+          node.kind === Kind.ENUM ||
+          node.kind === Kind.LIST ||
+          node.kind === Kind.OBJECT
+        );
+      }
+      function isConstValueNode(node) {
+        return (
+          isValueNode(node) &&
+          (node.kind === Kind.LIST
+            ? node.values.some(isConstValueNode)
+            : node.kind === Kind.OBJECT
+            ? node.fields.some((field) => isConstValueNode(field.value))
+            : node.kind !== Kind.VARIABLE)
+        );
+      }
+      function isTypeNode(node) {
+        return (
+          node.kind === Kind.NAMED_TYPE ||
+          node.kind === Kind.LIST_TYPE ||
+          node.kind === Kind.NON_NULL_TYPE
+        );
+      }
+      function isTypeSystemDefinitionNode(node) {
+        return (
+          node.kind === Kind.SCHEMA_DEFINITION ||
+          isTypeDefinitionNode(node) ||
+          node.kind === Kind.DIRECTIVE_DEFINITION
+        );
+      }
+      function isTypeDefinitionNode(node) {
+        return (
+          node.kind === Kind.SCALAR_TYPE_DEFINITION ||
+          node.kind === Kind.OBJECT_TYPE_DEFINITION ||
+          node.kind === Kind.INTERFACE_TYPE_DEFINITION ||
+          node.kind === Kind.UNION_TYPE_DEFINITION ||
+          node.kind === Kind.ENUM_TYPE_DEFINITION ||
+          node.kind === Kind.INPUT_OBJECT_TYPE_DEFINITION
+        );
+      }
+      function isTypeSystemExtensionNode(node) {
+        return node.kind === Kind.SCHEMA_EXTENSION || isTypeExtensionNode(node);
+      }
+      function isTypeExtensionNode(node) {
+        return (
+          node.kind === Kind.SCALAR_TYPE_EXTENSION ||
+          node.kind === Kind.OBJECT_TYPE_EXTENSION ||
+          node.kind === Kind.INTERFACE_TYPE_EXTENSION ||
+          node.kind === Kind.UNION_TYPE_EXTENSION ||
+          node.kind === Kind.ENUM_TYPE_EXTENSION ||
+          node.kind === Kind.INPUT_OBJECT_TYPE_EXTENSION
+        );
+      }
+      function ExecutableDefinitionsRule(context) {
+        return {
+          Document(node) {
+            for (const definition of node.definitions) {
+              if (!isExecutableDefinitionNode(definition)) {
+                const defName =
+                  definition.kind === Kind.SCHEMA_DEFINITION ||
+                  definition.kind === Kind.SCHEMA_EXTENSION
+                    ? "schema"
+                    : '"' + definition.name.value + '"';
+                context.reportError(
+                  new GraphQLError(
+                    `The ${defName} definition is not executable.`,
+                    {
+                      nodes: definition,
+                    }
+                  )
+                );
+              }
+            }
+            return false;
+          },
+        };
+      }
+      function FieldsOnCorrectTypeRule(context) {
+        return {
+          Field(node) {
+            const type2 = context.getParentType();
+            if (type2) {
+              const fieldDef = context.getFieldDef();
+              if (!fieldDef) {
+                const schema = context.getSchema();
+                const fieldName = node.name.value;
+                let suggestion = didYouMean$1(
+                  "to use an inline fragment on",
+                  getSuggestedTypeNames(schema, type2, fieldName)
+                );
+                if (suggestion === "") {
+                  suggestion = didYouMean$1(
+                    getSuggestedFieldNames(type2, fieldName)
+                  );
+                }
+                context.reportError(
+                  new GraphQLError(
+                    `Cannot query field "${fieldName}" on type "${type2.name}".` +
+                      suggestion,
+                    {
+                      nodes: node,
+                    }
+                  )
+                );
+              }
+            }
+          },
+        };
+      }
+      function getSuggestedTypeNames(schema, type2, fieldName) {
+        if (!isAbstractType(type2)) {
+          return [];
+        }
+        const suggestedTypes = /* @__PURE__ */ new Set();
+        const usageCount = /* @__PURE__ */ Object.create(null);
+        for (const possibleType of schema.getPossibleTypes(type2)) {
+          if (!possibleType.getFields()[fieldName]) {
+            continue;
+          }
+          suggestedTypes.add(possibleType);
+          usageCount[possibleType.name] = 1;
+          for (const possibleInterface of possibleType.getInterfaces()) {
+            var _usageCount$possibleI;
+            if (!possibleInterface.getFields()[fieldName]) {
+              continue;
+            }
+            suggestedTypes.add(possibleInterface);
+            usageCount[possibleInterface.name] =
+              ((_usageCount$possibleI = usageCount[possibleInterface.name]) !==
+                null && _usageCount$possibleI !== void 0
+                ? _usageCount$possibleI
+                : 0) + 1;
+          }
+        }
+        return [...suggestedTypes]
+          .sort((typeA, typeB) => {
+            const usageCountDiff =
+              usageCount[typeB.name] - usageCount[typeA.name];
+            if (usageCountDiff !== 0) {
+              return usageCountDiff;
+            }
+            if (isInterfaceType(typeA) && schema.isSubType(typeA, typeB)) {
+              return -1;
+            }
+            if (isInterfaceType(typeB) && schema.isSubType(typeB, typeA)) {
+              return 1;
+            }
+            return naturalCompare$1(typeA.name, typeB.name);
+          })
+          .map((x2) => x2.name);
+      }
+      function getSuggestedFieldNames(type2, fieldName) {
+        if (isObjectType(type2) || isInterfaceType(type2)) {
+          const possibleFieldNames = Object.keys(type2.getFields());
+          return suggestionList$1(fieldName, possibleFieldNames);
+        }
+        return [];
+      }
+      function FragmentsOnCompositeTypesRule(context) {
+        return {
+          InlineFragment(node) {
+            const typeCondition = node.typeCondition;
+            if (typeCondition) {
+              const type2 = typeFromAST(context.getSchema(), typeCondition);
+              if (type2 && !isCompositeType(type2)) {
+                const typeStr = print(typeCondition);
+                context.reportError(
+                  new GraphQLError(
+                    `Fragment cannot condition on non composite type "${typeStr}".`,
+                    {
+                      nodes: typeCondition,
+                    }
+                  )
+                );
+              }
+            }
+          },
+          FragmentDefinition(node) {
+            const type2 = typeFromAST(context.getSchema(), node.typeCondition);
+            if (type2 && !isCompositeType(type2)) {
+              const typeStr = print(node.typeCondition);
+              context.reportError(
+                new GraphQLError(
+                  `Fragment "${node.name.value}" cannot condition on non composite type "${typeStr}".`,
+                  {
+                    nodes: node.typeCondition,
+                  }
+                )
+              );
+            }
+          },
+        };
+      }
+      function KnownArgumentNamesRule(context) {
+        return __spreadProps(
+          __spreadValues({}, KnownArgumentNamesOnDirectivesRule(context)),
+          {
+            Argument(argNode) {
+              const argDef = context.getArgument();
+              const fieldDef = context.getFieldDef();
+              const parentType = context.getParentType();
+              if (!argDef && fieldDef && parentType) {
+                const argName = argNode.name.value;
+                const knownArgsNames = fieldDef.args.map((arg) => arg.name);
+                const suggestions = suggestionList$1(argName, knownArgsNames);
+                context.reportError(
+                  new GraphQLError(
+                    `Unknown argument "${argName}" on field "${parentType.name}.${fieldDef.name}".` +
+                      didYouMean$1(suggestions),
+                    {
+                      nodes: argNode,
+                    }
+                  )
+                );
+              }
+            },
+          }
+        );
+      }
+      function KnownArgumentNamesOnDirectivesRule(context) {
+        const directiveArgs = /* @__PURE__ */ Object.create(null);
+        const schema = context.getSchema();
+        const definedDirectives = schema
+          ? schema.getDirectives()
+          : specifiedDirectives;
+        for (const directive of definedDirectives) {
+          directiveArgs[directive.name] = directive.args.map((arg) => arg.name);
+        }
+        const astDefinitions = context.getDocument().definitions;
+        for (const def of astDefinitions) {
+          if (def.kind === Kind.DIRECTIVE_DEFINITION) {
+            var _def$arguments;
+            const argsNodes =
+              (_def$arguments = def.arguments) !== null &&
+              _def$arguments !== void 0
+                ? _def$arguments
+                : [];
+            directiveArgs[def.name.value] = argsNodes.map(
+              (arg) => arg.name.value
+            );
+          }
+        }
+        return {
+          Directive(directiveNode) {
+            const directiveName = directiveNode.name.value;
+            const knownArgs = directiveArgs[directiveName];
+            if (directiveNode.arguments && knownArgs) {
+              for (const argNode of directiveNode.arguments) {
+                const argName = argNode.name.value;
+                if (!knownArgs.includes(argName)) {
+                  const suggestions = suggestionList$1(argName, knownArgs);
+                  context.reportError(
+                    new GraphQLError(
+                      `Unknown argument "${argName}" on directive "@${directiveName}".` +
+                        didYouMean$1(suggestions),
+                      {
+                        nodes: argNode,
+                      }
+                    )
+                  );
+                }
+              }
+            }
+            return false;
+          },
+        };
+      }
+      function KnownDirectivesRule(context) {
+        const locationsMap = /* @__PURE__ */ Object.create(null);
+        const schema = context.getSchema();
+        const definedDirectives = schema
+          ? schema.getDirectives()
+          : specifiedDirectives;
+        for (const directive of definedDirectives) {
+          locationsMap[directive.name] = directive.locations;
+        }
+        const astDefinitions = context.getDocument().definitions;
+        for (const def of astDefinitions) {
+          if (def.kind === Kind.DIRECTIVE_DEFINITION) {
+            locationsMap[def.name.value] = def.locations.map(
+              (name2) => name2.value
+            );
+          }
+        }
+        return {
+          Directive(node, _key, _parent, _path, ancestors) {
+            const name2 = node.name.value;
+            const locations = locationsMap[name2];
+            if (!locations) {
+              context.reportError(
+                new GraphQLError(`Unknown directive "@${name2}".`, {
+                  nodes: node,
+                })
+              );
+              return;
+            }
+            const candidateLocation = getDirectiveLocationForASTPath(ancestors);
+            if (candidateLocation && !locations.includes(candidateLocation)) {
+              context.reportError(
+                new GraphQLError(
+                  `Directive "@${name2}" may not be used on ${candidateLocation}.`,
+                  {
+                    nodes: node,
+                  }
+                )
+              );
+            }
+          },
+        };
+      }
+      function getDirectiveLocationForASTPath(ancestors) {
+        const appliedTo = ancestors[ancestors.length - 1];
+        "kind" in appliedTo || invariant$2(false);
+        switch (appliedTo.kind) {
+          case Kind.OPERATION_DEFINITION:
+            return getDirectiveLocationForOperation(appliedTo.operation);
+          case Kind.FIELD:
+            return DirectiveLocation.FIELD;
+          case Kind.FRAGMENT_SPREAD:
+            return DirectiveLocation.FRAGMENT_SPREAD;
+          case Kind.INLINE_FRAGMENT:
+            return DirectiveLocation.INLINE_FRAGMENT;
+          case Kind.FRAGMENT_DEFINITION:
+            return DirectiveLocation.FRAGMENT_DEFINITION;
+          case Kind.VARIABLE_DEFINITION:
+            return DirectiveLocation.VARIABLE_DEFINITION;
+          case Kind.SCHEMA_DEFINITION:
+          case Kind.SCHEMA_EXTENSION:
+            return DirectiveLocation.SCHEMA;
+          case Kind.SCALAR_TYPE_DEFINITION:
+          case Kind.SCALAR_TYPE_EXTENSION:
+            return DirectiveLocation.SCALAR;
+          case Kind.OBJECT_TYPE_DEFINITION:
+          case Kind.OBJECT_TYPE_EXTENSION:
+            return DirectiveLocation.OBJECT;
+          case Kind.FIELD_DEFINITION:
+            return DirectiveLocation.FIELD_DEFINITION;
+          case Kind.INTERFACE_TYPE_DEFINITION:
+          case Kind.INTERFACE_TYPE_EXTENSION:
+            return DirectiveLocation.INTERFACE;
+          case Kind.UNION_TYPE_DEFINITION:
+          case Kind.UNION_TYPE_EXTENSION:
+            return DirectiveLocation.UNION;
+          case Kind.ENUM_TYPE_DEFINITION:
+          case Kind.ENUM_TYPE_EXTENSION:
+            return DirectiveLocation.ENUM;
+          case Kind.ENUM_VALUE_DEFINITION:
+            return DirectiveLocation.ENUM_VALUE;
+          case Kind.INPUT_OBJECT_TYPE_DEFINITION:
+          case Kind.INPUT_OBJECT_TYPE_EXTENSION:
+            return DirectiveLocation.INPUT_OBJECT;
+          case Kind.INPUT_VALUE_DEFINITION: {
+            const parentNode = ancestors[ancestors.length - 3];
+            "kind" in parentNode || invariant$2(false);
+            return parentNode.kind === Kind.INPUT_OBJECT_TYPE_DEFINITION
+              ? DirectiveLocation.INPUT_FIELD_DEFINITION
+              : DirectiveLocation.ARGUMENT_DEFINITION;
+          }
+          default:
+            invariant$2(false, "Unexpected kind: " + inspect$2(appliedTo.kind));
+        }
+      }
+      function getDirectiveLocationForOperation(operation) {
+        switch (operation) {
+          case OperationTypeNode.QUERY:
+            return DirectiveLocation.QUERY;
+          case OperationTypeNode.MUTATION:
+            return DirectiveLocation.MUTATION;
+          case OperationTypeNode.SUBSCRIPTION:
+            return DirectiveLocation.SUBSCRIPTION;
+        }
+      }
+      function KnownFragmentNamesRule(context) {
+        return {
+          FragmentSpread(node) {
+            const fragmentName = node.name.value;
+            const fragment = context.getFragment(fragmentName);
+            if (!fragment) {
+              context.reportError(
+                new GraphQLError(`Unknown fragment "${fragmentName}".`, {
+                  nodes: node.name,
+                })
+              );
+            }
+          },
+        };
+      }
+      function KnownTypeNamesRule(context) {
+        const schema = context.getSchema();
+        const existingTypesMap = schema
+          ? schema.getTypeMap()
+          : /* @__PURE__ */ Object.create(null);
+        const definedTypes = /* @__PURE__ */ Object.create(null);
+        for (const def of context.getDocument().definitions) {
+          if (isTypeDefinitionNode(def)) {
+            definedTypes[def.name.value] = true;
+          }
+        }
+        const typeNames = [
+          ...Object.keys(existingTypesMap),
+          ...Object.keys(definedTypes),
+        ];
+        return {
+          NamedType(node, _1, parent, _2, ancestors) {
+            const typeName = node.name.value;
+            if (!existingTypesMap[typeName] && !definedTypes[typeName]) {
+              var _ancestors$;
+              const definitionNode =
+                (_ancestors$ = ancestors[2]) !== null && _ancestors$ !== void 0
+                  ? _ancestors$
+                  : parent;
+              const isSDL = definitionNode != null && isSDLNode(definitionNode);
+              if (isSDL && standardTypeNames.includes(typeName)) {
+                return;
+              }
+              const suggestedTypes = suggestionList$1(
+                typeName,
+                isSDL ? standardTypeNames.concat(typeNames) : typeNames
+              );
+              context.reportError(
+                new GraphQLError(
+                  `Unknown type "${typeName}".` + didYouMean$1(suggestedTypes),
+                  {
+                    nodes: node,
+                  }
+                )
+              );
+            }
+          },
+        };
+      }
+      const standardTypeNames = [
+        ...specifiedScalarTypes,
+        ...introspectionTypes$1,
+      ].map((type2) => type2.name);
+      function isSDLNode(value) {
+        return (
+          "kind" in value &&
+          (isTypeSystemDefinitionNode(value) ||
+            isTypeSystemExtensionNode(value))
+        );
+      }
+      function LoneAnonymousOperationRule(context) {
+        let operationCount = 0;
+        return {
+          Document(node) {
+            operationCount = node.definitions.filter(
+              (definition) => definition.kind === Kind.OPERATION_DEFINITION
+            ).length;
+          },
+          OperationDefinition(node) {
+            if (!node.name && operationCount > 1) {
+              context.reportError(
+                new GraphQLError(
+                  "This anonymous operation must be the only defined operation.",
+                  {
+                    nodes: node,
+                  }
+                )
+              );
+            }
+          },
+        };
+      }
+      function LoneSchemaDefinitionRule(context) {
+        var _ref, _ref2, _oldSchema$astNode;
+        const oldSchema = context.getSchema();
+        const alreadyDefined =
+          (_ref =
+            (_ref2 =
+              (_oldSchema$astNode =
+                oldSchema === null || oldSchema === void 0
+                  ? void 0
+                  : oldSchema.astNode) !== null && _oldSchema$astNode !== void 0
+                ? _oldSchema$astNode
+                : oldSchema === null || oldSchema === void 0
+                ? void 0
+                : oldSchema.getQueryType()) !== null && _ref2 !== void 0
+              ? _ref2
+              : oldSchema === null || oldSchema === void 0
+              ? void 0
+              : oldSchema.getMutationType()) !== null && _ref !== void 0
+            ? _ref
+            : oldSchema === null || oldSchema === void 0
+            ? void 0
+            : oldSchema.getSubscriptionType();
+        let schemaDefinitionsCount = 0;
+        return {
+          SchemaDefinition(node) {
+            if (alreadyDefined) {
+              context.reportError(
+                new GraphQLError(
+                  "Cannot define a new schema within a schema extension.",
+                  {
+                    nodes: node,
+                  }
+                )
+              );
+              return;
+            }
+            if (schemaDefinitionsCount > 0) {
+              context.reportError(
+                new GraphQLError("Must provide only one schema definition.", {
+                  nodes: node,
+                })
+              );
+            }
+            ++schemaDefinitionsCount;
+          },
+        };
+      }
+      function NoFragmentCyclesRule(context) {
+        const visitedFrags = /* @__PURE__ */ Object.create(null);
+        const spreadPath = [];
+        const spreadPathIndexByName = /* @__PURE__ */ Object.create(null);
+        return {
+          OperationDefinition: () => false,
+          FragmentDefinition(node) {
+            detectCycleRecursive(node);
+            return false;
+          },
+        };
+        function detectCycleRecursive(fragment) {
+          if (visitedFrags[fragment.name.value]) {
+            return;
+          }
+          const fragmentName = fragment.name.value;
+          visitedFrags[fragmentName] = true;
+          const spreadNodes = context.getFragmentSpreads(fragment.selectionSet);
+          if (spreadNodes.length === 0) {
+            return;
+          }
+          spreadPathIndexByName[fragmentName] = spreadPath.length;
+          for (const spreadNode of spreadNodes) {
+            const spreadName = spreadNode.name.value;
+            const cycleIndex = spreadPathIndexByName[spreadName];
+            spreadPath.push(spreadNode);
+            if (cycleIndex === void 0) {
+              const spreadFragment = context.getFragment(spreadName);
+              if (spreadFragment) {
+                detectCycleRecursive(spreadFragment);
+              }
+            } else {
+              const cyclePath = spreadPath.slice(cycleIndex);
+              const viaPath = cyclePath
+                .slice(0, -1)
+                .map((s) => '"' + s.name.value + '"')
+                .join(", ");
+              context.reportError(
+                new GraphQLError(
+                  `Cannot spread fragment "${spreadName}" within itself` +
+                    (viaPath !== "" ? ` via ${viaPath}.` : "."),
+                  {
+                    nodes: cyclePath,
+                  }
+                )
+              );
+            }
+            spreadPath.pop();
+          }
+          spreadPathIndexByName[fragmentName] = void 0;
+        }
+      }
+      function NoUndefinedVariablesRule(context) {
+        let variableNameDefined = /* @__PURE__ */ Object.create(null);
+        return {
+          OperationDefinition: {
+            enter() {
+              variableNameDefined = /* @__PURE__ */ Object.create(null);
+            },
+            leave(operation) {
+              const usages = context.getRecursiveVariableUsages(operation);
+              for (const { node } of usages) {
+                const varName = node.name.value;
+                if (variableNameDefined[varName] !== true) {
+                  context.reportError(
+                    new GraphQLError(
+                      operation.name
+                        ? `Variable "$${varName}" is not defined by operation "${operation.name.value}".`
+                        : `Variable "$${varName}" is not defined.`,
+                      {
+                        nodes: [node, operation],
+                      }
+                    )
+                  );
+                }
+              }
+            },
+          },
+          VariableDefinition(node) {
+            variableNameDefined[node.variable.name.value] = true;
+          },
+        };
+      }
+      function NoUnusedFragmentsRule(context) {
+        const operationDefs = [];
+        const fragmentDefs = [];
+        return {
+          OperationDefinition(node) {
+            operationDefs.push(node);
+            return false;
+          },
+          FragmentDefinition(node) {
+            fragmentDefs.push(node);
+            return false;
+          },
+          Document: {
+            leave() {
+              const fragmentNameUsed = /* @__PURE__ */ Object.create(null);
+              for (const operation of operationDefs) {
+                for (const fragment of context.getRecursivelyReferencedFragments(
+                  operation
+                )) {
+                  fragmentNameUsed[fragment.name.value] = true;
+                }
+              }
+              for (const fragmentDef of fragmentDefs) {
+                const fragName = fragmentDef.name.value;
+                if (fragmentNameUsed[fragName] !== true) {
+                  context.reportError(
+                    new GraphQLError(`Fragment "${fragName}" is never used.`, {
+                      nodes: fragmentDef,
+                    })
+                  );
+                }
+              }
+            },
+          },
+        };
+      }
+      function NoUnusedVariablesRule(context) {
+        let variableDefs = [];
+        return {
+          OperationDefinition: {
+            enter() {
+              variableDefs = [];
+            },
+            leave(operation) {
+              const variableNameUsed = /* @__PURE__ */ Object.create(null);
+              const usages = context.getRecursiveVariableUsages(operation);
+              for (const { node } of usages) {
+                variableNameUsed[node.name.value] = true;
+              }
+              for (const variableDef of variableDefs) {
+                const variableName = variableDef.variable.name.value;
+                if (variableNameUsed[variableName] !== true) {
+                  context.reportError(
+                    new GraphQLError(
+                      operation.name
+                        ? `Variable "$${variableName}" is never used in operation "${operation.name.value}".`
+                        : `Variable "$${variableName}" is never used.`,
+                      {
+                        nodes: variableDef,
+                      }
+                    )
+                  );
+                }
+              }
+            },
+          },
+          VariableDefinition(def) {
+            variableDefs.push(def);
+          },
+        };
+      }
+      function sortValueNode(valueNode) {
+        switch (valueNode.kind) {
+          case Kind.OBJECT:
+            return __spreadProps(__spreadValues({}, valueNode), {
+              fields: sortFields(valueNode.fields),
+            });
+          case Kind.LIST:
+            return __spreadProps(__spreadValues({}, valueNode), {
+              values: valueNode.values.map(sortValueNode),
+            });
+          case Kind.INT:
+          case Kind.FLOAT:
+          case Kind.STRING:
+          case Kind.BOOLEAN:
+          case Kind.NULL:
+          case Kind.ENUM:
+          case Kind.VARIABLE:
+            return valueNode;
+        }
+      }
+      function sortFields(fields) {
+        return fields
+          .map((fieldNode) =>
+            __spreadProps(__spreadValues({}, fieldNode), {
+              value: sortValueNode(fieldNode.value),
+            })
+          )
+          .sort((fieldA, fieldB) =>
+            naturalCompare$1(fieldA.name.value, fieldB.name.value)
+          );
+      }
+      function reasonMessage(reason) {
+        if (Array.isArray(reason)) {
+          return reason
+            .map(
+              ([responseName, subReason]) =>
+                `subfields "${responseName}" conflict because ` +
+                reasonMessage(subReason)
+            )
+            .join(" and ");
+        }
+        return reason;
+      }
+      function OverlappingFieldsCanBeMergedRule(context) {
+        const comparedFragmentPairs = new PairSet();
+        const cachedFieldsAndFragmentNames = /* @__PURE__ */ new Map();
+        return {
+          SelectionSet(selectionSet) {
+            const conflicts = findConflictsWithinSelectionSet(
+              context,
+              cachedFieldsAndFragmentNames,
+              comparedFragmentPairs,
+              context.getParentType(),
+              selectionSet
+            );
+            for (const [
+              [responseName, reason],
+              fields1,
+              fields2,
+            ] of conflicts) {
+              const reasonMsg = reasonMessage(reason);
+              context.reportError(
+                new GraphQLError(
+                  `Fields "${responseName}" conflict because ${reasonMsg}. Use different aliases on the fields to fetch both if this was intentional.`,
+                  {
+                    nodes: fields1.concat(fields2),
+                  }
+                )
+              );
+            }
+          },
+        };
+      }
+      function findConflictsWithinSelectionSet(
+        context,
+        cachedFieldsAndFragmentNames,
+        comparedFragmentPairs,
+        parentType,
+        selectionSet
+      ) {
+        const conflicts = [];
+        const [fieldMap, fragmentNames] = getFieldsAndFragmentNames(
+          context,
+          cachedFieldsAndFragmentNames,
+          parentType,
+          selectionSet
+        );
+        collectConflictsWithin(
+          context,
+          conflicts,
+          cachedFieldsAndFragmentNames,
+          comparedFragmentPairs,
+          fieldMap
+        );
+        if (fragmentNames.length !== 0) {
+          for (let i = 0; i < fragmentNames.length; i++) {
+            collectConflictsBetweenFieldsAndFragment(
+              context,
+              conflicts,
+              cachedFieldsAndFragmentNames,
+              comparedFragmentPairs,
+              false,
+              fieldMap,
+              fragmentNames[i]
+            );
+            for (let j = i + 1; j < fragmentNames.length; j++) {
+              collectConflictsBetweenFragments(
+                context,
+                conflicts,
+                cachedFieldsAndFragmentNames,
+                comparedFragmentPairs,
+                false,
+                fragmentNames[i],
+                fragmentNames[j]
+              );
+            }
+          }
+        }
+        return conflicts;
+      }
+      function collectConflictsBetweenFieldsAndFragment(
+        context,
+        conflicts,
+        cachedFieldsAndFragmentNames,
+        comparedFragmentPairs,
+        areMutuallyExclusive,
+        fieldMap,
+        fragmentName
+      ) {
+        const fragment = context.getFragment(fragmentName);
+        if (!fragment) {
+          return;
+        }
+        const [fieldMap2, referencedFragmentNames] =
+          getReferencedFieldsAndFragmentNames(
+            context,
+            cachedFieldsAndFragmentNames,
+            fragment
+          );
+        if (fieldMap === fieldMap2) {
+          return;
+        }
+        collectConflictsBetween(
+          context,
+          conflicts,
+          cachedFieldsAndFragmentNames,
+          comparedFragmentPairs,
+          areMutuallyExclusive,
+          fieldMap,
+          fieldMap2
+        );
+        for (const referencedFragmentName of referencedFragmentNames) {
+          if (
+            comparedFragmentPairs.has(
+              referencedFragmentName,
+              fragmentName,
+              areMutuallyExclusive
+            )
+          ) {
+            continue;
+          }
+          comparedFragmentPairs.add(
+            referencedFragmentName,
+            fragmentName,
+            areMutuallyExclusive
+          );
+          collectConflictsBetweenFieldsAndFragment(
+            context,
+            conflicts,
+            cachedFieldsAndFragmentNames,
+            comparedFragmentPairs,
+            areMutuallyExclusive,
+            fieldMap,
+            referencedFragmentName
+          );
+        }
+      }
+      function collectConflictsBetweenFragments(
+        context,
+        conflicts,
+        cachedFieldsAndFragmentNames,
+        comparedFragmentPairs,
+        areMutuallyExclusive,
+        fragmentName1,
+        fragmentName2
+      ) {
+        if (fragmentName1 === fragmentName2) {
+          return;
+        }
+        if (
+          comparedFragmentPairs.has(
+            fragmentName1,
+            fragmentName2,
+            areMutuallyExclusive
+          )
+        ) {
+          return;
+        }
+        comparedFragmentPairs.add(
+          fragmentName1,
+          fragmentName2,
+          areMutuallyExclusive
+        );
+        const fragment1 = context.getFragment(fragmentName1);
+        const fragment2 = context.getFragment(fragmentName2);
+        if (!fragment1 || !fragment2) {
+          return;
+        }
+        const [fieldMap1, referencedFragmentNames1] =
+          getReferencedFieldsAndFragmentNames(
+            context,
+            cachedFieldsAndFragmentNames,
+            fragment1
+          );
+        const [fieldMap2, referencedFragmentNames2] =
+          getReferencedFieldsAndFragmentNames(
+            context,
+            cachedFieldsAndFragmentNames,
+            fragment2
+          );
+        collectConflictsBetween(
+          context,
+          conflicts,
+          cachedFieldsAndFragmentNames,
+          comparedFragmentPairs,
+          areMutuallyExclusive,
+          fieldMap1,
+          fieldMap2
+        );
+        for (const referencedFragmentName2 of referencedFragmentNames2) {
+          collectConflictsBetweenFragments(
+            context,
+            conflicts,
+            cachedFieldsAndFragmentNames,
+            comparedFragmentPairs,
+            areMutuallyExclusive,
+            fragmentName1,
+            referencedFragmentName2
+          );
+        }
+        for (const referencedFragmentName1 of referencedFragmentNames1) {
+          collectConflictsBetweenFragments(
+            context,
+            conflicts,
+            cachedFieldsAndFragmentNames,
+            comparedFragmentPairs,
+            areMutuallyExclusive,
+            referencedFragmentName1,
+            fragmentName2
+          );
+        }
+      }
+      function findConflictsBetweenSubSelectionSets(
+        context,
+        cachedFieldsAndFragmentNames,
+        comparedFragmentPairs,
+        areMutuallyExclusive,
+        parentType1,
+        selectionSet1,
+        parentType2,
+        selectionSet2
+      ) {
+        const conflicts = [];
+        const [fieldMap1, fragmentNames1] = getFieldsAndFragmentNames(
+          context,
+          cachedFieldsAndFragmentNames,
+          parentType1,
+          selectionSet1
+        );
+        const [fieldMap2, fragmentNames2] = getFieldsAndFragmentNames(
+          context,
+          cachedFieldsAndFragmentNames,
+          parentType2,
+          selectionSet2
+        );
+        collectConflictsBetween(
+          context,
+          conflicts,
+          cachedFieldsAndFragmentNames,
+          comparedFragmentPairs,
+          areMutuallyExclusive,
+          fieldMap1,
+          fieldMap2
+        );
+        for (const fragmentName2 of fragmentNames2) {
+          collectConflictsBetweenFieldsAndFragment(
+            context,
+            conflicts,
+            cachedFieldsAndFragmentNames,
+            comparedFragmentPairs,
+            areMutuallyExclusive,
+            fieldMap1,
+            fragmentName2
+          );
+        }
+        for (const fragmentName1 of fragmentNames1) {
+          collectConflictsBetweenFieldsAndFragment(
+            context,
+            conflicts,
+            cachedFieldsAndFragmentNames,
+            comparedFragmentPairs,
+            areMutuallyExclusive,
+            fieldMap2,
+            fragmentName1
+          );
+        }
+        for (const fragmentName1 of fragmentNames1) {
+          for (const fragmentName2 of fragmentNames2) {
+            collectConflictsBetweenFragments(
+              context,
+              conflicts,
+              cachedFieldsAndFragmentNames,
+              comparedFragmentPairs,
+              areMutuallyExclusive,
+              fragmentName1,
+              fragmentName2
+            );
+          }
+        }
+        return conflicts;
+      }
+      function collectConflictsWithin(
+        context,
+        conflicts,
+        cachedFieldsAndFragmentNames,
+        comparedFragmentPairs,
+        fieldMap
+      ) {
+        for (const [responseName, fields] of Object.entries(fieldMap)) {
+          if (fields.length > 1) {
+            for (let i = 0; i < fields.length; i++) {
+              for (let j = i + 1; j < fields.length; j++) {
+                const conflict = findConflict(
+                  context,
+                  cachedFieldsAndFragmentNames,
+                  comparedFragmentPairs,
+                  false,
+                  responseName,
+                  fields[i],
+                  fields[j]
+                );
+                if (conflict) {
+                  conflicts.push(conflict);
+                }
+              }
+            }
+          }
+        }
+      }
+      function collectConflictsBetween(
+        context,
+        conflicts,
+        cachedFieldsAndFragmentNames,
+        comparedFragmentPairs,
+        parentFieldsAreMutuallyExclusive,
+        fieldMap1,
+        fieldMap2
+      ) {
+        for (const [responseName, fields1] of Object.entries(fieldMap1)) {
+          const fields2 = fieldMap2[responseName];
+          if (fields2) {
+            for (const field1 of fields1) {
+              for (const field2 of fields2) {
+                const conflict = findConflict(
+                  context,
+                  cachedFieldsAndFragmentNames,
+                  comparedFragmentPairs,
+                  parentFieldsAreMutuallyExclusive,
+                  responseName,
+                  field1,
+                  field2
+                );
+                if (conflict) {
+                  conflicts.push(conflict);
+                }
+              }
+            }
+          }
+        }
+      }
+      function findConflict(
+        context,
+        cachedFieldsAndFragmentNames,
+        comparedFragmentPairs,
+        parentFieldsAreMutuallyExclusive,
+        responseName,
+        field1,
+        field2
+      ) {
+        const [parentType1, node1, def1] = field1;
+        const [parentType2, node2, def2] = field2;
+        const areMutuallyExclusive =
+          parentFieldsAreMutuallyExclusive ||
+          (parentType1 !== parentType2 &&
+            isObjectType(parentType1) &&
+            isObjectType(parentType2));
+        if (!areMutuallyExclusive) {
+          const name1 = node1.name.value;
+          const name2 = node2.name.value;
+          if (name1 !== name2) {
+            return [
+              [responseName, `"${name1}" and "${name2}" are different fields`],
+              [node1],
+              [node2],
+            ];
+          }
+          if (stringifyArguments(node1) !== stringifyArguments(node2)) {
+            return [
+              [responseName, "they have differing arguments"],
+              [node1],
+              [node2],
+            ];
+          }
+        }
+        const type1 = def1 === null || def1 === void 0 ? void 0 : def1.type;
+        const type2 = def2 === null || def2 === void 0 ? void 0 : def2.type;
+        if (type1 && type2 && doTypesConflict(type1, type2)) {
+          return [
+            [
+              responseName,
+              `they return conflicting types "${inspect$2(
+                type1
+              )}" and "${inspect$2(type2)}"`,
+            ],
+            [node1],
+            [node2],
+          ];
+        }
+        const selectionSet1 = node1.selectionSet;
+        const selectionSet2 = node2.selectionSet;
+        if (selectionSet1 && selectionSet2) {
+          const conflicts = findConflictsBetweenSubSelectionSets(
+            context,
+            cachedFieldsAndFragmentNames,
+            comparedFragmentPairs,
+            areMutuallyExclusive,
+            getNamedType(type1),
+            selectionSet1,
+            getNamedType(type2),
+            selectionSet2
+          );
+          return subfieldConflicts(conflicts, responseName, node1, node2);
+        }
+      }
+      function stringifyArguments(fieldNode) {
+        var _fieldNode$arguments;
+        const args =
+          (_fieldNode$arguments = fieldNode.arguments) !== null &&
+          _fieldNode$arguments !== void 0
+            ? _fieldNode$arguments
+            : [];
+        const inputObjectWithArgs = {
+          kind: Kind.OBJECT,
+          fields: args.map((argNode) => ({
+            kind: Kind.OBJECT_FIELD,
+            name: argNode.name,
+            value: argNode.value,
+          })),
+        };
+        return print(sortValueNode(inputObjectWithArgs));
+      }
+      function doTypesConflict(type1, type2) {
+        if (isListType(type1)) {
+          return isListType(type2)
+            ? doTypesConflict(type1.ofType, type2.ofType)
+            : true;
+        }
+        if (isListType(type2)) {
+          return true;
+        }
+        if (isNonNullType(type1)) {
+          return isNonNullType(type2)
+            ? doTypesConflict(type1.ofType, type2.ofType)
+            : true;
+        }
+        if (isNonNullType(type2)) {
+          return true;
+        }
+        if (isLeafType(type1) || isLeafType(type2)) {
+          return type1 !== type2;
+        }
+        return false;
+      }
+      function getFieldsAndFragmentNames(
+        context,
+        cachedFieldsAndFragmentNames,
+        parentType,
+        selectionSet
+      ) {
+        const cached = cachedFieldsAndFragmentNames.get(selectionSet);
+        if (cached) {
+          return cached;
+        }
+        const nodeAndDefs = /* @__PURE__ */ Object.create(null);
+        const fragmentNames = /* @__PURE__ */ Object.create(null);
+        _collectFieldsAndFragmentNames(
+          context,
+          parentType,
+          selectionSet,
+          nodeAndDefs,
+          fragmentNames
+        );
+        const result2 = [nodeAndDefs, Object.keys(fragmentNames)];
+        cachedFieldsAndFragmentNames.set(selectionSet, result2);
+        return result2;
+      }
+      function getReferencedFieldsAndFragmentNames(
+        context,
+        cachedFieldsAndFragmentNames,
+        fragment
+      ) {
+        const cached = cachedFieldsAndFragmentNames.get(fragment.selectionSet);
+        if (cached) {
+          return cached;
+        }
+        const fragmentType = typeFromAST(
+          context.getSchema(),
+          fragment.typeCondition
+        );
+        return getFieldsAndFragmentNames(
+          context,
+          cachedFieldsAndFragmentNames,
+          fragmentType,
+          fragment.selectionSet
+        );
+      }
+      function _collectFieldsAndFragmentNames(
+        context,
+        parentType,
+        selectionSet,
+        nodeAndDefs,
+        fragmentNames
+      ) {
+        for (const selection of selectionSet.selections) {
+          switch (selection.kind) {
+            case Kind.FIELD: {
+              const fieldName = selection.name.value;
+              let fieldDef;
+              if (isObjectType(parentType) || isInterfaceType(parentType)) {
+                fieldDef = parentType.getFields()[fieldName];
+              }
+              const responseName = selection.alias
+                ? selection.alias.value
+                : fieldName;
+              if (!nodeAndDefs[responseName]) {
+                nodeAndDefs[responseName] = [];
+              }
+              nodeAndDefs[responseName].push([parentType, selection, fieldDef]);
+              break;
+            }
+            case Kind.FRAGMENT_SPREAD:
+              fragmentNames[selection.name.value] = true;
+              break;
+            case Kind.INLINE_FRAGMENT: {
+              const typeCondition = selection.typeCondition;
+              const inlineFragmentType = typeCondition
+                ? typeFromAST(context.getSchema(), typeCondition)
+                : parentType;
+              _collectFieldsAndFragmentNames(
+                context,
+                inlineFragmentType,
+                selection.selectionSet,
+                nodeAndDefs,
+                fragmentNames
+              );
+              break;
+            }
+          }
+        }
+      }
+      function subfieldConflicts(conflicts, responseName, node1, node2) {
+        if (conflicts.length > 0) {
+          return [
+            [responseName, conflicts.map(([reason]) => reason)],
+            [node1, ...conflicts.map(([, fields1]) => fields1).flat()],
+            [node2, ...conflicts.map(([, , fields2]) => fields2).flat()],
+          ];
+        }
+      }
+      class PairSet {
+        constructor() {
+          this._data = /* @__PURE__ */ new Map();
+        }
+        has(a, b, areMutuallyExclusive) {
+          var _this$_data$get;
+          const [key1, key2] = a < b ? [a, b] : [b, a];
+          const result2 =
+            (_this$_data$get = this._data.get(key1)) === null ||
+            _this$_data$get === void 0
+              ? void 0
+              : _this$_data$get.get(key2);
+          if (result2 === void 0) {
+            return false;
+          }
+          return areMutuallyExclusive ? true : areMutuallyExclusive === result2;
+        }
+        add(a, b, areMutuallyExclusive) {
+          const [key1, key2] = a < b ? [a, b] : [b, a];
+          const map2 = this._data.get(key1);
+          if (map2 === void 0) {
+            this._data.set(
+              key1,
+              /* @__PURE__ */ new Map([[key2, areMutuallyExclusive]])
+            );
+          } else {
+            map2.set(key2, areMutuallyExclusive);
+          }
+        }
+      }
+      function PossibleFragmentSpreadsRule(context) {
+        return {
+          InlineFragment(node) {
+            const fragType = context.getType();
+            const parentType = context.getParentType();
+            if (
+              isCompositeType(fragType) &&
+              isCompositeType(parentType) &&
+              !doTypesOverlap(context.getSchema(), fragType, parentType)
+            ) {
+              const parentTypeStr = inspect$2(parentType);
+              const fragTypeStr = inspect$2(fragType);
+              context.reportError(
+                new GraphQLError(
+                  `Fragment cannot be spread here as objects of type "${parentTypeStr}" can never be of type "${fragTypeStr}".`,
+                  {
+                    nodes: node,
+                  }
+                )
+              );
+            }
+          },
+          FragmentSpread(node) {
+            const fragName = node.name.value;
+            const fragType = getFragmentType(context, fragName);
+            const parentType = context.getParentType();
+            if (
+              fragType &&
+              parentType &&
+              !doTypesOverlap(context.getSchema(), fragType, parentType)
+            ) {
+              const parentTypeStr = inspect$2(parentType);
+              const fragTypeStr = inspect$2(fragType);
+              context.reportError(
+                new GraphQLError(
+                  `Fragment "${fragName}" cannot be spread here as objects of type "${parentTypeStr}" can never be of type "${fragTypeStr}".`,
+                  {
+                    nodes: node,
+                  }
+                )
+              );
+            }
+          },
+        };
+      }
+      function getFragmentType(context, name2) {
+        const frag = context.getFragment(name2);
+        if (frag) {
+          const type2 = typeFromAST(context.getSchema(), frag.typeCondition);
+          if (isCompositeType(type2)) {
+            return type2;
+          }
+        }
+      }
+      function PossibleTypeExtensionsRule(context) {
+        const schema = context.getSchema();
+        const definedTypes = /* @__PURE__ */ Object.create(null);
+        for (const def of context.getDocument().definitions) {
+          if (isTypeDefinitionNode(def)) {
+            definedTypes[def.name.value] = def;
+          }
+        }
+        return {
+          ScalarTypeExtension: checkExtension,
+          ObjectTypeExtension: checkExtension,
+          InterfaceTypeExtension: checkExtension,
+          UnionTypeExtension: checkExtension,
+          EnumTypeExtension: checkExtension,
+          InputObjectTypeExtension: checkExtension,
+        };
+        function checkExtension(node) {
+          const typeName = node.name.value;
+          const defNode = definedTypes[typeName];
+          const existingType =
+            schema === null || schema === void 0
+              ? void 0
+              : schema.getType(typeName);
+          let expectedKind;
+          if (defNode) {
+            expectedKind = defKindToExtKind[defNode.kind];
+          } else if (existingType) {
+            expectedKind = typeToExtKind(existingType);
+          }
+          if (expectedKind) {
+            if (expectedKind !== node.kind) {
+              const kindStr = extensionKindToTypeName(node.kind);
+              context.reportError(
+                new GraphQLError(
+                  `Cannot extend non-${kindStr} type "${typeName}".`,
+                  {
+                    nodes: defNode ? [defNode, node] : node,
+                  }
+                )
+              );
+            }
+          } else {
+            const allTypeNames = Object.keys(
+              __spreadValues(
+                __spreadValues({}, definedTypes),
+                schema === null || schema === void 0
+                  ? void 0
+                  : schema.getTypeMap()
+              )
+            );
+            const suggestedTypes = suggestionList$1(typeName, allTypeNames);
+            context.reportError(
+              new GraphQLError(
+                `Cannot extend type "${typeName}" because it is not defined.` +
+                  didYouMean$1(suggestedTypes),
+                {
+                  nodes: node.name,
+                }
+              )
+            );
+          }
+        }
+      }
+      const defKindToExtKind = {
+        [Kind.SCALAR_TYPE_DEFINITION]: Kind.SCALAR_TYPE_EXTENSION,
+        [Kind.OBJECT_TYPE_DEFINITION]: Kind.OBJECT_TYPE_EXTENSION,
+        [Kind.INTERFACE_TYPE_DEFINITION]: Kind.INTERFACE_TYPE_EXTENSION,
+        [Kind.UNION_TYPE_DEFINITION]: Kind.UNION_TYPE_EXTENSION,
+        [Kind.ENUM_TYPE_DEFINITION]: Kind.ENUM_TYPE_EXTENSION,
+        [Kind.INPUT_OBJECT_TYPE_DEFINITION]: Kind.INPUT_OBJECT_TYPE_EXTENSION,
+      };
+      function typeToExtKind(type2) {
+        if (isScalarType(type2)) {
+          return Kind.SCALAR_TYPE_EXTENSION;
+        }
+        if (isObjectType(type2)) {
+          return Kind.OBJECT_TYPE_EXTENSION;
+        }
+        if (isInterfaceType(type2)) {
+          return Kind.INTERFACE_TYPE_EXTENSION;
+        }
+        if (isUnionType(type2)) {
+          return Kind.UNION_TYPE_EXTENSION;
+        }
+        if (isEnumType(type2)) {
+          return Kind.ENUM_TYPE_EXTENSION;
+        }
+        if (isInputObjectType(type2)) {
+          return Kind.INPUT_OBJECT_TYPE_EXTENSION;
+        }
+        invariant$2(false, "Unexpected type: " + inspect$2(type2));
+      }
+      function extensionKindToTypeName(kind2) {
+        switch (kind2) {
+          case Kind.SCALAR_TYPE_EXTENSION:
+            return "scalar";
+          case Kind.OBJECT_TYPE_EXTENSION:
+            return "object";
+          case Kind.INTERFACE_TYPE_EXTENSION:
+            return "interface";
+          case Kind.UNION_TYPE_EXTENSION:
+            return "union";
+          case Kind.ENUM_TYPE_EXTENSION:
+            return "enum";
+          case Kind.INPUT_OBJECT_TYPE_EXTENSION:
+            return "input object";
+          default:
+            invariant$2(false, "Unexpected kind: " + inspect$2(kind2));
+        }
+      }
+      function ProvidedRequiredArgumentsRule(context) {
+        return __spreadProps(
+          __spreadValues(
+            {},
+            ProvidedRequiredArgumentsOnDirectivesRule(context)
+          ),
+          {
+            Field: {
+              leave(fieldNode) {
+                var _fieldNode$arguments;
+                const fieldDef = context.getFieldDef();
+                if (!fieldDef) {
+                  return false;
+                }
+                const providedArgs = new Set(
+                  (_fieldNode$arguments = fieldNode.arguments) === null ||
+                  _fieldNode$arguments === void 0
+                    ? void 0
+                    : _fieldNode$arguments.map((arg) => arg.name.value)
+                );
+                for (const argDef of fieldDef.args) {
+                  if (
+                    !providedArgs.has(argDef.name) &&
+                    isRequiredArgument$1(argDef)
+                  ) {
+                    const argTypeStr = inspect$2(argDef.type);
+                    context.reportError(
+                      new GraphQLError(
+                        `Field "${fieldDef.name}" argument "${argDef.name}" of type "${argTypeStr}" is required, but it was not provided.`,
+                        {
+                          nodes: fieldNode,
+                        }
+                      )
+                    );
+                  }
+                }
+              },
+            },
+          }
+        );
+      }
+      function ProvidedRequiredArgumentsOnDirectivesRule(context) {
+        var _schema$getDirectives;
+        const requiredArgsMap = /* @__PURE__ */ Object.create(null);
+        const schema = context.getSchema();
+        const definedDirectives =
+          (_schema$getDirectives =
+            schema === null || schema === void 0
+              ? void 0
+              : schema.getDirectives()) !== null &&
+          _schema$getDirectives !== void 0
+            ? _schema$getDirectives
+            : specifiedDirectives;
+        for (const directive of definedDirectives) {
+          requiredArgsMap[directive.name] = keyMap$1(
+            directive.args.filter(isRequiredArgument$1),
+            (arg) => arg.name
+          );
+        }
+        const astDefinitions = context.getDocument().definitions;
+        for (const def of astDefinitions) {
+          if (def.kind === Kind.DIRECTIVE_DEFINITION) {
+            var _def$arguments;
+            const argNodes =
+              (_def$arguments = def.arguments) !== null &&
+              _def$arguments !== void 0
+                ? _def$arguments
+                : [];
+            requiredArgsMap[def.name.value] = keyMap$1(
+              argNodes.filter(isRequiredArgumentNode),
+              (arg) => arg.name.value
+            );
+          }
+        }
+        return {
+          Directive: {
+            leave(directiveNode) {
+              const directiveName = directiveNode.name.value;
+              const requiredArgs = requiredArgsMap[directiveName];
+              if (requiredArgs) {
+                var _directiveNode$argume;
+                const argNodes =
+                  (_directiveNode$argume = directiveNode.arguments) !== null &&
+                  _directiveNode$argume !== void 0
+                    ? _directiveNode$argume
+                    : [];
+                const argNodeMap = new Set(
+                  argNodes.map((arg) => arg.name.value)
+                );
+                for (const [argName, argDef] of Object.entries(requiredArgs)) {
+                  if (!argNodeMap.has(argName)) {
+                    const argType = isType(argDef.type)
+                      ? inspect$2(argDef.type)
+                      : print(argDef.type);
+                    context.reportError(
+                      new GraphQLError(
+                        `Directive "@${directiveName}" argument "${argName}" of type "${argType}" is required, but it was not provided.`,
+                        {
+                          nodes: directiveNode,
+                        }
+                      )
+                    );
+                  }
+                }
+              }
+            },
+          },
+        };
+      }
+      function isRequiredArgumentNode(arg) {
+        return arg.type.kind === Kind.NON_NULL_TYPE && arg.defaultValue == null;
+      }
+      function ScalarLeafsRule(context) {
+        return {
+          Field(node) {
+            const type2 = context.getType();
+            const selectionSet = node.selectionSet;
+            if (type2) {
+              if (isLeafType(getNamedType(type2))) {
+                if (selectionSet) {
+                  const fieldName = node.name.value;
+                  const typeStr = inspect$2(type2);
+                  context.reportError(
+                    new GraphQLError(
+                      `Field "${fieldName}" must not have a selection since type "${typeStr}" has no subfields.`,
+                      {
+                        nodes: selectionSet,
+                      }
+                    )
+                  );
+                }
+              } else if (!selectionSet) {
+                const fieldName = node.name.value;
+                const typeStr = inspect$2(type2);
+                context.reportError(
+                  new GraphQLError(
+                    `Field "${fieldName}" of type "${typeStr}" must have a selection of subfields. Did you mean "${fieldName} { ... }"?`,
+                    {
+                      nodes: node,
+                    }
+                  )
+                );
+              }
+            }
+          },
+        };
+      }
+      function printPathArray$1(path) {
+        return path
+          .map((key) =>
+            typeof key === "number" ? "[" + key.toString() + "]" : "." + key
+          )
+          .join("");
+      }
+      function addPath$1(prev, key, typename) {
+        return {
+          prev,
+          key,
+          typename,
+        };
+      }
+      function pathToArray$1(path) {
+        const flattened = [];
+        let curr = path;
+        while (curr) {
+          flattened.push(curr.key);
+          curr = curr.prev;
+        }
+        return flattened.reverse();
+      }
+      function coerceInputValue$1(
+        inputValue,
+        type2,
+        onError = defaultOnError$1
+      ) {
+        return coerceInputValueImpl$1(inputValue, type2, onError, void 0);
+      }
+      function defaultOnError$1(path, invalidValue, error2) {
+        let errorPrefix = "Invalid value " + inspect$2(invalidValue);
+        if (path.length > 0) {
+          errorPrefix += ` at "value${printPathArray$1(path)}"`;
+        }
+        error2.message = errorPrefix + ": " + error2.message;
+        throw error2;
+      }
+      function coerceInputValueImpl$1(inputValue, type2, onError, path) {
+        if (isNonNullType(type2)) {
+          if (inputValue != null) {
+            return coerceInputValueImpl$1(
+              inputValue,
+              type2.ofType,
+              onError,
+              path
+            );
+          }
+          onError(
+            pathToArray$1(path),
+            inputValue,
+            new GraphQLError(
+              `Expected non-nullable type "${inspect$2(type2)}" not to be null.`
+            )
+          );
+          return;
+        }
+        if (inputValue == null) {
+          return null;
+        }
+        if (isListType(type2)) {
+          const itemType = type2.ofType;
+          if (isIterableObject$1(inputValue)) {
+            return Array.from(inputValue, (itemValue, index) => {
+              const itemPath = addPath$1(path, index, void 0);
+              return coerceInputValueImpl$1(
+                itemValue,
+                itemType,
+                onError,
+                itemPath
+              );
+            });
+          }
+          return [coerceInputValueImpl$1(inputValue, itemType, onError, path)];
+        }
+        if (isInputObjectType(type2)) {
+          if (!isObjectLike$1(inputValue)) {
+            onError(
+              pathToArray$1(path),
+              inputValue,
+              new GraphQLError(`Expected type "${type2.name}" to be an object.`)
+            );
+            return;
+          }
+          const coercedValue = {};
+          const fieldDefs = type2.getFields();
+          for (const field of Object.values(fieldDefs)) {
+            const fieldValue = inputValue[field.name];
+            if (fieldValue === void 0) {
+              if (field.defaultValue !== void 0) {
+                coercedValue[field.name] = field.defaultValue;
+              } else if (isNonNullType(field.type)) {
+                const typeStr = inspect$2(field.type);
+                onError(
+                  pathToArray$1(path),
+                  inputValue,
+                  new GraphQLError(
+                    `Field "${field.name}" of required type "${typeStr}" was not provided.`
+                  )
+                );
+              }
+              continue;
+            }
+            coercedValue[field.name] = coerceInputValueImpl$1(
+              fieldValue,
+              field.type,
+              onError,
+              addPath$1(path, field.name, type2.name)
+            );
+          }
+          for (const fieldName of Object.keys(inputValue)) {
+            if (!fieldDefs[fieldName]) {
+              const suggestions = suggestionList$1(
+                fieldName,
+                Object.keys(type2.getFields())
+              );
+              onError(
+                pathToArray$1(path),
+                inputValue,
+                new GraphQLError(
+                  `Field "${fieldName}" is not defined by type "${type2.name}".` +
+                    didYouMean$1(suggestions)
+                )
+              );
+            }
+          }
+          return coercedValue;
+        }
+        if (isLeafType(type2)) {
+          let parseResult;
+          try {
+            parseResult = type2.parseValue(inputValue);
+          } catch (error2) {
+            if (error2 instanceof GraphQLError) {
+              onError(pathToArray$1(path), inputValue, error2);
+            } else {
+              onError(
+                pathToArray$1(path),
+                inputValue,
+                new GraphQLError(
+                  `Expected type "${type2.name}". ` + error2.message,
+                  {
+                    originalError: error2,
+                  }
+                )
+              );
+            }
+            return;
+          }
+          if (parseResult === void 0) {
+            onError(
+              pathToArray$1(path),
+              inputValue,
+              new GraphQLError(`Expected type "${type2.name}".`)
+            );
+          }
+          return parseResult;
+        }
+        invariant$2(false, "Unexpected input type: " + inspect$2(type2));
+      }
+      function valueFromAST$1(valueNode, type2, variables) {
+        if (!valueNode) {
+          return;
+        }
+        if (valueNode.kind === Kind.VARIABLE) {
+          const variableName = valueNode.name.value;
+          if (variables == null || variables[variableName] === void 0) {
+            return;
+          }
+          const variableValue = variables[variableName];
+          if (variableValue === null && isNonNullType(type2)) {
+            return;
+          }
+          return variableValue;
+        }
+        if (isNonNullType(type2)) {
+          if (valueNode.kind === Kind.NULL) {
+            return;
+          }
+          return valueFromAST$1(valueNode, type2.ofType, variables);
+        }
+        if (valueNode.kind === Kind.NULL) {
+          return null;
+        }
+        if (isListType(type2)) {
+          const itemType = type2.ofType;
+          if (valueNode.kind === Kind.LIST) {
+            const coercedValues = [];
+            for (const itemNode of valueNode.values) {
+              if (isMissingVariable$1(itemNode, variables)) {
+                if (isNonNullType(itemType)) {
+                  return;
+                }
+                coercedValues.push(null);
+              } else {
+                const itemValue = valueFromAST$1(itemNode, itemType, variables);
+                if (itemValue === void 0) {
+                  return;
+                }
+                coercedValues.push(itemValue);
+              }
+            }
+            return coercedValues;
+          }
+          const coercedValue = valueFromAST$1(valueNode, itemType, variables);
+          if (coercedValue === void 0) {
+            return;
+          }
+          return [coercedValue];
+        }
+        if (isInputObjectType(type2)) {
+          if (valueNode.kind !== Kind.OBJECT) {
+            return;
+          }
+          const coercedObj = /* @__PURE__ */ Object.create(null);
+          const fieldNodes = keyMap$1(
+            valueNode.fields,
+            (field) => field.name.value
+          );
+          for (const field of Object.values(type2.getFields())) {
+            const fieldNode = fieldNodes[field.name];
+            if (!fieldNode || isMissingVariable$1(fieldNode.value, variables)) {
+              if (field.defaultValue !== void 0) {
+                coercedObj[field.name] = field.defaultValue;
+              } else if (isNonNullType(field.type)) {
+                return;
+              }
+              continue;
+            }
+            const fieldValue = valueFromAST$1(
+              fieldNode.value,
+              field.type,
+              variables
+            );
+            if (fieldValue === void 0) {
+              return;
+            }
+            coercedObj[field.name] = fieldValue;
+          }
+          return coercedObj;
+        }
+        if (isLeafType(type2)) {
+          let result2;
+          try {
+            result2 = type2.parseLiteral(valueNode, variables);
+          } catch (_error) {
+            return;
+          }
+          if (result2 === void 0) {
+            return;
+          }
+          return result2;
+        }
+        invariant$2(false, "Unexpected input type: " + inspect$2(type2));
+      }
+      function isMissingVariable$1(valueNode, variables) {
+        return (
+          valueNode.kind === Kind.VARIABLE &&
+          (variables == null || variables[valueNode.name.value] === void 0)
+        );
+      }
+      function getVariableValues$1(schema, varDefNodes, inputs, options) {
+        const errors2 = [];
+        const maxErrors =
+          options === null || options === void 0 ? void 0 : options.maxErrors;
+        try {
+          const coerced = coerceVariableValues$1(
+            schema,
+            varDefNodes,
+            inputs,
+            (error2) => {
+              if (maxErrors != null && errors2.length >= maxErrors) {
+                throw new GraphQLError(
+                  "Too many errors processing variables, error limit reached. Execution aborted."
+                );
+              }
+              errors2.push(error2);
+            }
+          );
+          if (errors2.length === 0) {
+            return {
+              coerced,
+            };
+          }
+        } catch (error2) {
+          errors2.push(error2);
+        }
+        return {
+          errors: errors2,
+        };
+      }
+      function coerceVariableValues$1(schema, varDefNodes, inputs, onError) {
+        const coercedValues = {};
+        for (const varDefNode of varDefNodes) {
+          const varName = varDefNode.variable.name.value;
+          const varType = typeFromAST(schema, varDefNode.type);
+          if (!isInputType(varType)) {
+            const varTypeStr = print(varDefNode.type);
+            onError(
+              new GraphQLError(
+                `Variable "$${varName}" expected value of type "${varTypeStr}" which cannot be used as an input type.`,
+                {
+                  nodes: varDefNode.type,
+                }
+              )
+            );
+            continue;
+          }
+          if (!hasOwnProperty$2(inputs, varName)) {
+            if (varDefNode.defaultValue) {
+              coercedValues[varName] = valueFromAST$1(
+                varDefNode.defaultValue,
+                varType
+              );
+            } else if (isNonNullType(varType)) {
+              const varTypeStr = inspect$2(varType);
+              onError(
+                new GraphQLError(
+                  `Variable "$${varName}" of required type "${varTypeStr}" was not provided.`,
+                  {
+                    nodes: varDefNode,
+                  }
+                )
+              );
+            }
+            continue;
+          }
+          const value = inputs[varName];
+          if (value === null && isNonNullType(varType)) {
+            const varTypeStr = inspect$2(varType);
+            onError(
+              new GraphQLError(
+                `Variable "$${varName}" of non-null type "${varTypeStr}" must not be null.`,
+                {
+                  nodes: varDefNode,
+                }
+              )
+            );
+            continue;
+          }
+          coercedValues[varName] = coerceInputValue$1(
+            value,
+            varType,
+            (path, invalidValue, error2) => {
+              let prefix =
+                `Variable "$${varName}" got invalid value ` +
+                inspect$2(invalidValue);
+              if (path.length > 0) {
+                prefix += ` at "${varName}${printPathArray$1(path)}"`;
+              }
+              onError(
+                new GraphQLError(prefix + "; " + error2.message, {
+                  nodes: varDefNode,
+                  originalError: error2.originalError,
+                })
+              );
+            }
+          );
+        }
+        return coercedValues;
+      }
+      function getArgumentValues$1(def, node, variableValues) {
+        var _node$arguments;
+        const coercedValues = {};
+        const argumentNodes =
+          (_node$arguments = node.arguments) !== null &&
+          _node$arguments !== void 0
+            ? _node$arguments
+            : [];
+        const argNodeMap = keyMap$1(argumentNodes, (arg) => arg.name.value);
+        for (const argDef of def.args) {
+          const name2 = argDef.name;
+          const argType = argDef.type;
+          const argumentNode = argNodeMap[name2];
+          if (!argumentNode) {
+            if (argDef.defaultValue !== void 0) {
+              coercedValues[name2] = argDef.defaultValue;
+            } else if (isNonNullType(argType)) {
+              throw new GraphQLError(
+                `Argument "${name2}" of required type "${inspect$2(
+                  argType
+                )}" was not provided.`,
+                {
+                  nodes: node,
+                }
+              );
+            }
+            continue;
+          }
+          const valueNode = argumentNode.value;
+          let isNull = valueNode.kind === Kind.NULL;
+          if (valueNode.kind === Kind.VARIABLE) {
+            const variableName = valueNode.name.value;
+            if (
+              variableValues == null ||
+              !hasOwnProperty$2(variableValues, variableName)
+            ) {
+              if (argDef.defaultValue !== void 0) {
+                coercedValues[name2] = argDef.defaultValue;
+              } else if (isNonNullType(argType)) {
+                throw new GraphQLError(
+                  `Argument "${name2}" of required type "${inspect$2(
+                    argType
+                  )}" was provided the variable "$${variableName}" which was not provided a runtime value.`,
+                  {
+                    nodes: valueNode,
+                  }
+                );
+              }
+              continue;
+            }
+            isNull = variableValues[variableName] == null;
+          }
+          if (isNull && isNonNullType(argType)) {
+            throw new GraphQLError(
+              `Argument "${name2}" of non-null type "${inspect$2(
+                argType
+              )}" must not be null.`,
+              {
+                nodes: valueNode,
+              }
+            );
+          }
+          const coercedValue = valueFromAST$1(
+            valueNode,
+            argType,
+            variableValues
+          );
+          if (coercedValue === void 0) {
+            throw new GraphQLError(
+              `Argument "${name2}" has invalid value ${print(valueNode)}.`,
+              {
+                nodes: valueNode,
+              }
+            );
+          }
+          coercedValues[name2] = coercedValue;
+        }
+        return coercedValues;
+      }
+      function getDirectiveValues$1(directiveDef, node, variableValues) {
+        var _node$directives;
+        const directiveNode =
+          (_node$directives = node.directives) === null ||
+          _node$directives === void 0
+            ? void 0
+            : _node$directives.find(
+                (directive) => directive.name.value === directiveDef.name
+              );
+        if (directiveNode) {
+          return getArgumentValues$1(
+            directiveDef,
+            directiveNode,
+            variableValues
+          );
+        }
+      }
+      function hasOwnProperty$2(obj, prop2) {
+        return Object.prototype.hasOwnProperty.call(obj, prop2);
+      }
+      function collectFields$1(
+        schema,
+        fragments,
+        variableValues,
+        runtimeType,
+        selectionSet
+      ) {
+        const fields = /* @__PURE__ */ new Map();
+        collectFieldsImpl(
+          schema,
+          fragments,
+          variableValues,
+          runtimeType,
+          selectionSet,
+          fields,
+          /* @__PURE__ */ new Set()
+        );
+        return fields;
+      }
+      function collectSubfields$1(
+        schema,
+        fragments,
+        variableValues,
+        returnType,
+        fieldNodes
+      ) {
+        const subFieldNodes = /* @__PURE__ */ new Map();
+        const visitedFragmentNames = /* @__PURE__ */ new Set();
+        for (const node of fieldNodes) {
+          if (node.selectionSet) {
+            collectFieldsImpl(
+              schema,
+              fragments,
+              variableValues,
+              returnType,
+              node.selectionSet,
+              subFieldNodes,
+              visitedFragmentNames
+            );
+          }
+        }
+        return subFieldNodes;
+      }
+      function collectFieldsImpl(
+        schema,
+        fragments,
+        variableValues,
+        runtimeType,
+        selectionSet,
+        fields,
+        visitedFragmentNames
+      ) {
+        for (const selection of selectionSet.selections) {
+          switch (selection.kind) {
+            case Kind.FIELD: {
+              if (!shouldIncludeNode$1(variableValues, selection)) {
+                continue;
+              }
+              const name2 = getFieldEntryKey$1(selection);
+              const fieldList = fields.get(name2);
+              if (fieldList !== void 0) {
+                fieldList.push(selection);
+              } else {
+                fields.set(name2, [selection]);
+              }
+              break;
+            }
+            case Kind.INLINE_FRAGMENT: {
+              if (
+                !shouldIncludeNode$1(variableValues, selection) ||
+                !doesFragmentConditionMatch$1(schema, selection, runtimeType)
+              ) {
+                continue;
+              }
+              collectFieldsImpl(
+                schema,
+                fragments,
+                variableValues,
+                runtimeType,
+                selection.selectionSet,
+                fields,
+                visitedFragmentNames
+              );
+              break;
+            }
+            case Kind.FRAGMENT_SPREAD: {
+              const fragName = selection.name.value;
+              if (
+                visitedFragmentNames.has(fragName) ||
+                !shouldIncludeNode$1(variableValues, selection)
+              ) {
+                continue;
+              }
+              visitedFragmentNames.add(fragName);
+              const fragment = fragments[fragName];
+              if (
+                !fragment ||
+                !doesFragmentConditionMatch$1(schema, fragment, runtimeType)
+              ) {
+                continue;
+              }
+              collectFieldsImpl(
+                schema,
+                fragments,
+                variableValues,
+                runtimeType,
+                fragment.selectionSet,
+                fields,
+                visitedFragmentNames
+              );
+              break;
+            }
+          }
+        }
+      }
+      function shouldIncludeNode$1(variableValues, node) {
+        const skip2 = getDirectiveValues$1(
+          GraphQLSkipDirective,
+          node,
+          variableValues
+        );
+        if ((skip2 === null || skip2 === void 0 ? void 0 : skip2.if) === true) {
+          return false;
+        }
+        const include = getDirectiveValues$1(
+          GraphQLIncludeDirective,
+          node,
+          variableValues
+        );
+        if (
+          (include === null || include === void 0 ? void 0 : include.if) ===
+          false
+        ) {
+          return false;
+        }
+        return true;
+      }
+      function doesFragmentConditionMatch$1(schema, fragment, type2) {
+        const typeConditionNode = fragment.typeCondition;
+        if (!typeConditionNode) {
+          return true;
+        }
+        const conditionalType = typeFromAST(schema, typeConditionNode);
+        if (conditionalType === type2) {
+          return true;
+        }
+        if (isAbstractType(conditionalType)) {
+          return schema.isSubType(conditionalType, type2);
+        }
+        return false;
+      }
+      function getFieldEntryKey$1(node) {
+        return node.alias ? node.alias.value : node.name.value;
+      }
+      function SingleFieldSubscriptionsRule(context) {
+        return {
+          OperationDefinition(node) {
+            if (node.operation === "subscription") {
+              const schema = context.getSchema();
+              const subscriptionType = schema.getSubscriptionType();
+              if (subscriptionType) {
+                const operationName = node.name ? node.name.value : null;
+                const variableValues = /* @__PURE__ */ Object.create(null);
+                const document2 = context.getDocument();
+                const fragments = /* @__PURE__ */ Object.create(null);
+                for (const definition of document2.definitions) {
+                  if (definition.kind === Kind.FRAGMENT_DEFINITION) {
+                    fragments[definition.name.value] = definition;
+                  }
+                }
+                const fields = collectFields$1(
+                  schema,
+                  fragments,
+                  variableValues,
+                  subscriptionType,
+                  node.selectionSet
+                );
+                if (fields.size > 1) {
+                  const fieldSelectionLists = [...fields.values()];
+                  const extraFieldSelectionLists = fieldSelectionLists.slice(1);
+                  const extraFieldSelections = extraFieldSelectionLists.flat();
+                  context.reportError(
+                    new GraphQLError(
+                      operationName != null
+                        ? `Subscription "${operationName}" must select only one top level field.`
+                        : "Anonymous Subscription must select only one top level field.",
+                      {
+                        nodes: extraFieldSelections,
+                      }
+                    )
+                  );
+                }
+                for (const fieldNodes of fields.values()) {
+                  const field = fieldNodes[0];
+                  const fieldName = field.name.value;
+                  if (fieldName.startsWith("__")) {
+                    context.reportError(
+                      new GraphQLError(
+                        operationName != null
+                          ? `Subscription "${operationName}" must not select an introspection top level field.`
+                          : "Anonymous Subscription must not select an introspection top level field.",
+                        {
+                          nodes: fieldNodes,
+                        }
+                      )
+                    );
+                  }
+                }
+              }
+            }
+          },
+        };
+      }
+      function groupBy(list3, keyFn) {
+        const result2 = /* @__PURE__ */ new Map();
+        for (const item of list3) {
+          const key = keyFn(item);
+          const group = result2.get(key);
+          if (group === void 0) {
+            result2.set(key, [item]);
+          } else {
+            group.push(item);
+          }
+        }
+        return result2;
+      }
+      function UniqueArgumentDefinitionNamesRule(context) {
+        return {
+          DirectiveDefinition(directiveNode) {
+            var _directiveNode$argume;
+            const argumentNodes =
+              (_directiveNode$argume = directiveNode.arguments) !== null &&
+              _directiveNode$argume !== void 0
+                ? _directiveNode$argume
+                : [];
+            return checkArgUniqueness(
+              `@${directiveNode.name.value}`,
+              argumentNodes
+            );
+          },
+          InterfaceTypeDefinition: checkArgUniquenessPerField,
+          InterfaceTypeExtension: checkArgUniquenessPerField,
+          ObjectTypeDefinition: checkArgUniquenessPerField,
+          ObjectTypeExtension: checkArgUniquenessPerField,
+        };
+        function checkArgUniquenessPerField(typeNode) {
+          var _typeNode$fields;
+          const typeName = typeNode.name.value;
+          const fieldNodes =
+            (_typeNode$fields = typeNode.fields) !== null &&
+            _typeNode$fields !== void 0
+              ? _typeNode$fields
+              : [];
+          for (const fieldDef of fieldNodes) {
+            var _fieldDef$arguments;
+            const fieldName = fieldDef.name.value;
+            const argumentNodes =
+              (_fieldDef$arguments = fieldDef.arguments) !== null &&
+              _fieldDef$arguments !== void 0
+                ? _fieldDef$arguments
+                : [];
+            checkArgUniqueness(`${typeName}.${fieldName}`, argumentNodes);
+          }
+          return false;
+        }
+        function checkArgUniqueness(parentName, argumentNodes) {
+          const seenArgs = groupBy(argumentNodes, (arg) => arg.name.value);
+          for (const [argName, argNodes] of seenArgs) {
+            if (argNodes.length > 1) {
+              context.reportError(
+                new GraphQLError(
+                  `Argument "${parentName}(${argName}:)" can only be defined once.`,
+                  {
+                    nodes: argNodes.map((node) => node.name),
+                  }
+                )
+              );
+            }
+          }
+          return false;
+        }
+      }
+      function UniqueArgumentNamesRule(context) {
+        return {
+          Field: checkArgUniqueness,
+          Directive: checkArgUniqueness,
+        };
+        function checkArgUniqueness(parentNode) {
+          var _parentNode$arguments;
+          const argumentNodes =
+            (_parentNode$arguments = parentNode.arguments) !== null &&
+            _parentNode$arguments !== void 0
+              ? _parentNode$arguments
+              : [];
+          const seenArgs = groupBy(argumentNodes, (arg) => arg.name.value);
+          for (const [argName, argNodes] of seenArgs) {
+            if (argNodes.length > 1) {
+              context.reportError(
+                new GraphQLError(
+                  `There can be only one argument named "${argName}".`,
+                  {
+                    nodes: argNodes.map((node) => node.name),
+                  }
+                )
+              );
+            }
+          }
+        }
+      }
+      function UniqueDirectiveNamesRule(context) {
+        const knownDirectiveNames = /* @__PURE__ */ Object.create(null);
+        const schema = context.getSchema();
+        return {
+          DirectiveDefinition(node) {
+            const directiveName = node.name.value;
+            if (
+              schema !== null &&
+              schema !== void 0 &&
+              schema.getDirective(directiveName)
+            ) {
+              context.reportError(
+                new GraphQLError(
+                  `Directive "@${directiveName}" already exists in the schema. It cannot be redefined.`,
+                  {
+                    nodes: node.name,
+                  }
+                )
+              );
+              return;
+            }
+            if (knownDirectiveNames[directiveName]) {
+              context.reportError(
+                new GraphQLError(
+                  `There can be only one directive named "@${directiveName}".`,
+                  {
+                    nodes: [knownDirectiveNames[directiveName], node.name],
+                  }
+                )
+              );
+            } else {
+              knownDirectiveNames[directiveName] = node.name;
+            }
+            return false;
+          },
+        };
+      }
+      function UniqueDirectivesPerLocationRule(context) {
+        const uniqueDirectiveMap = /* @__PURE__ */ Object.create(null);
+        const schema = context.getSchema();
+        const definedDirectives = schema
+          ? schema.getDirectives()
+          : specifiedDirectives;
+        for (const directive of definedDirectives) {
+          uniqueDirectiveMap[directive.name] = !directive.isRepeatable;
+        }
+        const astDefinitions = context.getDocument().definitions;
+        for (const def of astDefinitions) {
+          if (def.kind === Kind.DIRECTIVE_DEFINITION) {
+            uniqueDirectiveMap[def.name.value] = !def.repeatable;
+          }
+        }
+        const schemaDirectives = /* @__PURE__ */ Object.create(null);
+        const typeDirectivesMap = /* @__PURE__ */ Object.create(null);
+        return {
+          enter(node) {
+            if (!("directives" in node) || !node.directives) {
+              return;
+            }
+            let seenDirectives;
+            if (
+              node.kind === Kind.SCHEMA_DEFINITION ||
+              node.kind === Kind.SCHEMA_EXTENSION
+            ) {
+              seenDirectives = schemaDirectives;
+            } else if (
+              isTypeDefinitionNode(node) ||
+              isTypeExtensionNode(node)
+            ) {
+              const typeName = node.name.value;
+              seenDirectives = typeDirectivesMap[typeName];
+              if (seenDirectives === void 0) {
+                typeDirectivesMap[typeName] = seenDirectives =
+                  /* @__PURE__ */ Object.create(null);
+              }
+            } else {
+              seenDirectives = /* @__PURE__ */ Object.create(null);
+            }
+            for (const directive of node.directives) {
+              const directiveName = directive.name.value;
+              if (uniqueDirectiveMap[directiveName]) {
+                if (seenDirectives[directiveName]) {
+                  context.reportError(
+                    new GraphQLError(
+                      `The directive "@${directiveName}" can only be used once at this location.`,
+                      {
+                        nodes: [seenDirectives[directiveName], directive],
+                      }
+                    )
+                  );
+                } else {
+                  seenDirectives[directiveName] = directive;
+                }
+              }
+            }
+          },
+        };
+      }
+      function UniqueEnumValueNamesRule(context) {
+        const schema = context.getSchema();
+        const existingTypeMap = schema
+          ? schema.getTypeMap()
+          : /* @__PURE__ */ Object.create(null);
+        const knownValueNames = /* @__PURE__ */ Object.create(null);
+        return {
+          EnumTypeDefinition: checkValueUniqueness,
+          EnumTypeExtension: checkValueUniqueness,
+        };
+        function checkValueUniqueness(node) {
+          var _node$values;
+          const typeName = node.name.value;
+          if (!knownValueNames[typeName]) {
+            knownValueNames[typeName] = /* @__PURE__ */ Object.create(null);
+          }
+          const valueNodes =
+            (_node$values = node.values) !== null && _node$values !== void 0
+              ? _node$values
+              : [];
+          const valueNames = knownValueNames[typeName];
+          for (const valueDef of valueNodes) {
+            const valueName = valueDef.name.value;
+            const existingType = existingTypeMap[typeName];
+            if (isEnumType(existingType) && existingType.getValue(valueName)) {
+              context.reportError(
+                new GraphQLError(
+                  `Enum value "${typeName}.${valueName}" already exists in the schema. It cannot also be defined in this type extension.`,
+                  {
+                    nodes: valueDef.name,
+                  }
+                )
+              );
+            } else if (valueNames[valueName]) {
+              context.reportError(
+                new GraphQLError(
+                  `Enum value "${typeName}.${valueName}" can only be defined once.`,
+                  {
+                    nodes: [valueNames[valueName], valueDef.name],
+                  }
+                )
+              );
+            } else {
+              valueNames[valueName] = valueDef.name;
+            }
+          }
+          return false;
+        }
+      }
+      function UniqueFieldDefinitionNamesRule(context) {
+        const schema = context.getSchema();
+        const existingTypeMap = schema
+          ? schema.getTypeMap()
+          : /* @__PURE__ */ Object.create(null);
+        const knownFieldNames = /* @__PURE__ */ Object.create(null);
+        return {
+          InputObjectTypeDefinition: checkFieldUniqueness,
+          InputObjectTypeExtension: checkFieldUniqueness,
+          InterfaceTypeDefinition: checkFieldUniqueness,
+          InterfaceTypeExtension: checkFieldUniqueness,
+          ObjectTypeDefinition: checkFieldUniqueness,
+          ObjectTypeExtension: checkFieldUniqueness,
+        };
+        function checkFieldUniqueness(node) {
+          var _node$fields;
+          const typeName = node.name.value;
+          if (!knownFieldNames[typeName]) {
+            knownFieldNames[typeName] = /* @__PURE__ */ Object.create(null);
+          }
+          const fieldNodes =
+            (_node$fields = node.fields) !== null && _node$fields !== void 0
+              ? _node$fields
+              : [];
+          const fieldNames = knownFieldNames[typeName];
+          for (const fieldDef of fieldNodes) {
+            const fieldName = fieldDef.name.value;
+            if (hasField(existingTypeMap[typeName], fieldName)) {
+              context.reportError(
+                new GraphQLError(
+                  `Field "${typeName}.${fieldName}" already exists in the schema. It cannot also be defined in this type extension.`,
+                  {
+                    nodes: fieldDef.name,
+                  }
+                )
+              );
+            } else if (fieldNames[fieldName]) {
+              context.reportError(
+                new GraphQLError(
+                  `Field "${typeName}.${fieldName}" can only be defined once.`,
+                  {
+                    nodes: [fieldNames[fieldName], fieldDef.name],
+                  }
+                )
+              );
+            } else {
+              fieldNames[fieldName] = fieldDef.name;
+            }
+          }
+          return false;
+        }
+      }
+      function hasField(type2, fieldName) {
+        if (
+          isObjectType(type2) ||
+          isInterfaceType(type2) ||
+          isInputObjectType(type2)
+        ) {
+          return type2.getFields()[fieldName] != null;
+        }
+        return false;
+      }
+      function UniqueFragmentNamesRule(context) {
+        const knownFragmentNames = /* @__PURE__ */ Object.create(null);
+        return {
+          OperationDefinition: () => false,
+          FragmentDefinition(node) {
+            const fragmentName = node.name.value;
+            if (knownFragmentNames[fragmentName]) {
+              context.reportError(
+                new GraphQLError(
+                  `There can be only one fragment named "${fragmentName}".`,
+                  {
+                    nodes: [knownFragmentNames[fragmentName], node.name],
+                  }
+                )
+              );
+            } else {
+              knownFragmentNames[fragmentName] = node.name;
+            }
+            return false;
+          },
+        };
+      }
+      function UniqueInputFieldNamesRule(context) {
+        const knownNameStack = [];
+        let knownNames = /* @__PURE__ */ Object.create(null);
+        return {
+          ObjectValue: {
+            enter() {
+              knownNameStack.push(knownNames);
+              knownNames = /* @__PURE__ */ Object.create(null);
+            },
+            leave() {
+              const prevKnownNames = knownNameStack.pop();
+              prevKnownNames || invariant$2(false);
+              knownNames = prevKnownNames;
+            },
+          },
+          ObjectField(node) {
+            const fieldName = node.name.value;
+            if (knownNames[fieldName]) {
+              context.reportError(
+                new GraphQLError(
+                  `There can be only one input field named "${fieldName}".`,
+                  {
+                    nodes: [knownNames[fieldName], node.name],
+                  }
+                )
+              );
+            } else {
+              knownNames[fieldName] = node.name;
+            }
+          },
+        };
+      }
+      function UniqueOperationNamesRule(context) {
+        const knownOperationNames = /* @__PURE__ */ Object.create(null);
+        return {
+          OperationDefinition(node) {
+            const operationName = node.name;
+            if (operationName) {
+              if (knownOperationNames[operationName.value]) {
+                context.reportError(
+                  new GraphQLError(
+                    `There can be only one operation named "${operationName.value}".`,
+                    {
+                      nodes: [
+                        knownOperationNames[operationName.value],
+                        operationName,
+                      ],
+                    }
+                  )
+                );
+              } else {
+                knownOperationNames[operationName.value] = operationName;
+              }
+            }
+            return false;
+          },
+          FragmentDefinition: () => false,
+        };
+      }
+      function UniqueOperationTypesRule(context) {
+        const schema = context.getSchema();
+        const definedOperationTypes = /* @__PURE__ */ Object.create(null);
+        const existingOperationTypes = schema
+          ? {
+              query: schema.getQueryType(),
+              mutation: schema.getMutationType(),
+              subscription: schema.getSubscriptionType(),
+            }
+          : {};
+        return {
+          SchemaDefinition: checkOperationTypes,
+          SchemaExtension: checkOperationTypes,
+        };
+        function checkOperationTypes(node) {
+          var _node$operationTypes;
+          const operationTypesNodes =
+            (_node$operationTypes = node.operationTypes) !== null &&
+            _node$operationTypes !== void 0
+              ? _node$operationTypes
+              : [];
+          for (const operationType of operationTypesNodes) {
+            const operation = operationType.operation;
+            const alreadyDefinedOperationType =
+              definedOperationTypes[operation];
+            if (existingOperationTypes[operation]) {
+              context.reportError(
+                new GraphQLError(
+                  `Type for ${operation} already defined in the schema. It cannot be redefined.`,
+                  {
+                    nodes: operationType,
+                  }
+                )
+              );
+            } else if (alreadyDefinedOperationType) {
+              context.reportError(
+                new GraphQLError(
+                  `There can be only one ${operation} type in schema.`,
+                  {
+                    nodes: [alreadyDefinedOperationType, operationType],
+                  }
+                )
+              );
+            } else {
+              definedOperationTypes[operation] = operationType;
+            }
+          }
+          return false;
+        }
+      }
+      function UniqueTypeNamesRule(context) {
+        const knownTypeNames = /* @__PURE__ */ Object.create(null);
+        const schema = context.getSchema();
+        return {
+          ScalarTypeDefinition: checkTypeName,
+          ObjectTypeDefinition: checkTypeName,
+          InterfaceTypeDefinition: checkTypeName,
+          UnionTypeDefinition: checkTypeName,
+          EnumTypeDefinition: checkTypeName,
+          InputObjectTypeDefinition: checkTypeName,
+        };
+        function checkTypeName(node) {
+          const typeName = node.name.value;
+          if (
+            schema !== null &&
+            schema !== void 0 &&
+            schema.getType(typeName)
+          ) {
+            context.reportError(
+              new GraphQLError(
+                `Type "${typeName}" already exists in the schema. It cannot also be defined in this type definition.`,
+                {
+                  nodes: node.name,
+                }
+              )
+            );
+            return;
+          }
+          if (knownTypeNames[typeName]) {
+            context.reportError(
+              new GraphQLError(
+                `There can be only one type named "${typeName}".`,
+                {
+                  nodes: [knownTypeNames[typeName], node.name],
+                }
+              )
+            );
+          } else {
+            knownTypeNames[typeName] = node.name;
+          }
+          return false;
+        }
+      }
+      function UniqueVariableNamesRule(context) {
+        return {
+          OperationDefinition(operationNode) {
+            var _operationNode$variab;
+            const variableDefinitions =
+              (_operationNode$variab = operationNode.variableDefinitions) !==
+                null && _operationNode$variab !== void 0
+                ? _operationNode$variab
+                : [];
+            const seenVariableDefinitions = groupBy(
+              variableDefinitions,
+              (node) => node.variable.name.value
+            );
+            for (const [
+              variableName,
+              variableNodes,
+            ] of seenVariableDefinitions) {
+              if (variableNodes.length > 1) {
+                context.reportError(
+                  new GraphQLError(
+                    `There can be only one variable named "$${variableName}".`,
+                    {
+                      nodes: variableNodes.map((node) => node.variable.name),
+                    }
+                  )
+                );
+              }
+            }
+          },
+        };
+      }
+      function ValuesOfCorrectTypeRule(context) {
+        return {
+          ListValue(node) {
+            const type2 = getNullableType(context.getParentInputType());
+            if (!isListType(type2)) {
+              isValidValueNode(context, node);
+              return false;
+            }
+          },
+          ObjectValue(node) {
+            const type2 = getNamedType(context.getInputType());
+            if (!isInputObjectType(type2)) {
+              isValidValueNode(context, node);
+              return false;
+            }
+            const fieldNodeMap = keyMap$1(
+              node.fields,
+              (field) => field.name.value
+            );
+            for (const fieldDef of Object.values(type2.getFields())) {
+              const fieldNode = fieldNodeMap[fieldDef.name];
+              if (!fieldNode && isRequiredInputField(fieldDef)) {
+                const typeStr = inspect$2(fieldDef.type);
+                context.reportError(
+                  new GraphQLError(
+                    `Field "${type2.name}.${fieldDef.name}" of required type "${typeStr}" was not provided.`,
+                    {
+                      nodes: node,
+                    }
+                  )
+                );
+              }
+            }
+          },
+          ObjectField(node) {
+            const parentType = getNamedType(context.getParentInputType());
+            const fieldType = context.getInputType();
+            if (!fieldType && isInputObjectType(parentType)) {
+              const suggestions = suggestionList$1(
+                node.name.value,
+                Object.keys(parentType.getFields())
+              );
+              context.reportError(
+                new GraphQLError(
+                  `Field "${node.name.value}" is not defined by type "${parentType.name}".` +
+                    didYouMean$1(suggestions),
+                  {
+                    nodes: node,
+                  }
+                )
+              );
+            }
+          },
+          NullValue(node) {
+            const type2 = context.getInputType();
+            if (isNonNullType(type2)) {
+              context.reportError(
+                new GraphQLError(
+                  `Expected value of type "${inspect$2(type2)}", found ${print(
+                    node
+                  )}.`,
+                  {
+                    nodes: node,
+                  }
+                )
+              );
+            }
+          },
+          EnumValue: (node) => isValidValueNode(context, node),
+          IntValue: (node) => isValidValueNode(context, node),
+          FloatValue: (node) => isValidValueNode(context, node),
+          StringValue: (node) => isValidValueNode(context, node),
+          BooleanValue: (node) => isValidValueNode(context, node),
+        };
+      }
+      function isValidValueNode(context, node) {
+        const locationType = context.getInputType();
+        if (!locationType) {
+          return;
+        }
+        const type2 = getNamedType(locationType);
+        if (!isLeafType(type2)) {
+          const typeStr = inspect$2(locationType);
+          context.reportError(
+            new GraphQLError(
+              `Expected value of type "${typeStr}", found ${print(node)}.`,
+              {
+                nodes: node,
+              }
+            )
+          );
+          return;
+        }
+        try {
+          const parseResult = type2.parseLiteral(node, void 0);
+          if (parseResult === void 0) {
+            const typeStr = inspect$2(locationType);
+            context.reportError(
+              new GraphQLError(
+                `Expected value of type "${typeStr}", found ${print(node)}.`,
+                {
+                  nodes: node,
+                }
+              )
+            );
+          }
+        } catch (error2) {
+          const typeStr = inspect$2(locationType);
+          if (error2 instanceof GraphQLError) {
+            context.reportError(error2);
+          } else {
+            context.reportError(
+              new GraphQLError(
+                `Expected value of type "${typeStr}", found ${print(node)}; ` +
+                  error2.message,
+                {
+                  nodes: node,
+                  originalError: error2,
+                }
+              )
+            );
+          }
+        }
+      }
+      function VariablesAreInputTypesRule(context) {
+        return {
+          VariableDefinition(node) {
+            const type2 = typeFromAST(context.getSchema(), node.type);
+            if (type2 !== void 0 && !isInputType(type2)) {
+              const variableName = node.variable.name.value;
+              const typeName = print(node.type);
+              context.reportError(
+                new GraphQLError(
+                  `Variable "$${variableName}" cannot be non-input type "${typeName}".`,
+                  {
+                    nodes: node.type,
+                  }
+                )
+              );
+            }
+          },
+        };
+      }
+      function VariablesInAllowedPositionRule(context) {
+        let varDefMap = /* @__PURE__ */ Object.create(null);
+        return {
+          OperationDefinition: {
+            enter() {
+              varDefMap = /* @__PURE__ */ Object.create(null);
+            },
+            leave(operation) {
+              const usages = context.getRecursiveVariableUsages(operation);
+              for (const {
+                node,
+                type: type2,
+                defaultValue: defaultValue2,
+              } of usages) {
+                const varName = node.name.value;
+                const varDef = varDefMap[varName];
+                if (varDef && type2) {
+                  const schema = context.getSchema();
+                  const varType = typeFromAST(schema, varDef.type);
+                  if (
+                    varType &&
+                    !allowedVariableUsage(
+                      schema,
+                      varType,
+                      varDef.defaultValue,
+                      type2,
+                      defaultValue2
+                    )
+                  ) {
+                    const varTypeStr = inspect$2(varType);
+                    const typeStr = inspect$2(type2);
+                    context.reportError(
+                      new GraphQLError(
+                        `Variable "$${varName}" of type "${varTypeStr}" used in position expecting type "${typeStr}".`,
+                        {
+                          nodes: [varDef, node],
+                        }
+                      )
+                    );
+                  }
+                }
+              }
+            },
+          },
+          VariableDefinition(node) {
+            varDefMap[node.variable.name.value] = node;
+          },
+        };
+      }
+      function allowedVariableUsage(
+        schema,
+        varType,
+        varDefaultValue,
+        locationType,
+        locationDefaultValue
+      ) {
+        if (isNonNullType(locationType) && !isNonNullType(varType)) {
+          const hasNonNullVariableDefaultValue =
+            varDefaultValue != null && varDefaultValue.kind !== Kind.NULL;
+          const hasLocationDefaultValue = locationDefaultValue !== void 0;
+          if (!hasNonNullVariableDefaultValue && !hasLocationDefaultValue) {
+            return false;
+          }
+          const nullableLocationType = locationType.ofType;
+          return isTypeSubTypeOf(schema, varType, nullableLocationType);
+        }
+        return isTypeSubTypeOf(schema, varType, locationType);
+      }
+      const specifiedRules = Object.freeze([
+        ExecutableDefinitionsRule,
+        UniqueOperationNamesRule,
+        LoneAnonymousOperationRule,
+        SingleFieldSubscriptionsRule,
+        KnownTypeNamesRule,
+        FragmentsOnCompositeTypesRule,
+        VariablesAreInputTypesRule,
+        ScalarLeafsRule,
+        FieldsOnCorrectTypeRule,
+        UniqueFragmentNamesRule,
+        KnownFragmentNamesRule,
+        NoUnusedFragmentsRule,
+        PossibleFragmentSpreadsRule,
+        NoFragmentCyclesRule,
+        UniqueVariableNamesRule,
+        NoUndefinedVariablesRule,
+        NoUnusedVariablesRule,
+        KnownDirectivesRule,
+        UniqueDirectivesPerLocationRule,
+        KnownArgumentNamesRule,
+        UniqueArgumentNamesRule,
+        ValuesOfCorrectTypeRule,
+        ProvidedRequiredArgumentsRule,
+        VariablesInAllowedPositionRule,
+        OverlappingFieldsCanBeMergedRule,
+        UniqueInputFieldNamesRule,
+      ]);
+      const specifiedSDLRules$1 = Object.freeze([
+        LoneSchemaDefinitionRule,
+        UniqueOperationTypesRule,
+        UniqueTypeNamesRule,
+        UniqueEnumValueNamesRule,
+        UniqueFieldDefinitionNamesRule,
+        UniqueArgumentDefinitionNamesRule,
+        UniqueDirectiveNamesRule,
+        KnownTypeNamesRule,
+        KnownDirectivesRule,
+        UniqueDirectivesPerLocationRule,
+        PossibleTypeExtensionsRule,
+        KnownArgumentNamesOnDirectivesRule,
+        UniqueArgumentNamesRule,
+        UniqueInputFieldNamesRule,
+        ProvidedRequiredArgumentsOnDirectivesRule,
+      ]);
+      class ASTValidationContext {
+        constructor(ast2, onError) {
+          this._ast = ast2;
+          this._fragments = void 0;
+          this._fragmentSpreads = /* @__PURE__ */ new Map();
+          this._recursivelyReferencedFragments = /* @__PURE__ */ new Map();
+          this._onError = onError;
+        }
+        get [Symbol.toStringTag]() {
+          return "ASTValidationContext";
+        }
+        reportError(error2) {
+          this._onError(error2);
+        }
+        getDocument() {
+          return this._ast;
+        }
+        getFragment(name2) {
+          let fragments;
+          if (this._fragments) {
+            fragments = this._fragments;
+          } else {
+            fragments = /* @__PURE__ */ Object.create(null);
+            for (const defNode of this.getDocument().definitions) {
+              if (defNode.kind === Kind.FRAGMENT_DEFINITION) {
+                fragments[defNode.name.value] = defNode;
+              }
+            }
+            this._fragments = fragments;
+          }
+          return fragments[name2];
+        }
+        getFragmentSpreads(node) {
+          let spreads = this._fragmentSpreads.get(node);
+          if (!spreads) {
+            spreads = [];
+            const setsToVisit = [node];
+            let set2;
+            while ((set2 = setsToVisit.pop())) {
+              for (const selection of set2.selections) {
+                if (selection.kind === Kind.FRAGMENT_SPREAD) {
+                  spreads.push(selection);
+                } else if (selection.selectionSet) {
+                  setsToVisit.push(selection.selectionSet);
+                }
+              }
+            }
+            this._fragmentSpreads.set(node, spreads);
+          }
+          return spreads;
+        }
+        getRecursivelyReferencedFragments(operation) {
+          let fragments = this._recursivelyReferencedFragments.get(operation);
+          if (!fragments) {
+            fragments = [];
+            const collectedNames = /* @__PURE__ */ Object.create(null);
+            const nodesToVisit = [operation.selectionSet];
+            let node;
+            while ((node = nodesToVisit.pop())) {
+              for (const spread of this.getFragmentSpreads(node)) {
+                const fragName = spread.name.value;
+                if (collectedNames[fragName] !== true) {
+                  collectedNames[fragName] = true;
+                  const fragment = this.getFragment(fragName);
+                  if (fragment) {
+                    fragments.push(fragment);
+                    nodesToVisit.push(fragment.selectionSet);
+                  }
+                }
+              }
+            }
+            this._recursivelyReferencedFragments.set(operation, fragments);
+          }
+          return fragments;
+        }
+      }
+      class SDLValidationContext extends ASTValidationContext {
+        constructor(ast2, schema, onError) {
+          super(ast2, onError);
+          this._schema = schema;
+        }
+        get [Symbol.toStringTag]() {
+          return "SDLValidationContext";
+        }
+        getSchema() {
+          return this._schema;
+        }
+      }
+      class ValidationContext extends ASTValidationContext {
+        constructor(schema, ast2, typeInfo, onError) {
+          super(ast2, onError);
+          this._schema = schema;
+          this._typeInfo = typeInfo;
+          this._variableUsages = /* @__PURE__ */ new Map();
+          this._recursiveVariableUsages = /* @__PURE__ */ new Map();
+        }
+        get [Symbol.toStringTag]() {
+          return "ValidationContext";
+        }
+        getSchema() {
+          return this._schema;
+        }
+        getVariableUsages(node) {
+          let usages = this._variableUsages.get(node);
+          if (!usages) {
+            const newUsages = [];
+            const typeInfo = new TypeInfo(this._schema);
+            visit(
+              node,
+              visitWithTypeInfo(typeInfo, {
+                VariableDefinition: () => false,
+                Variable(variable) {
+                  newUsages.push({
+                    node: variable,
+                    type: typeInfo.getInputType(),
+                    defaultValue: typeInfo.getDefaultValue(),
+                  });
+                },
+              })
+            );
+            usages = newUsages;
+            this._variableUsages.set(node, usages);
+          }
+          return usages;
+        }
+        getRecursiveVariableUsages(operation) {
+          let usages = this._recursiveVariableUsages.get(operation);
+          if (!usages) {
+            usages = this.getVariableUsages(operation);
+            for (const frag of this.getRecursivelyReferencedFragments(
+              operation
+            )) {
+              usages = usages.concat(this.getVariableUsages(frag));
+            }
+            this._recursiveVariableUsages.set(operation, usages);
+          }
+          return usages;
+        }
+        getType() {
+          return this._typeInfo.getType();
+        }
+        getParentType() {
+          return this._typeInfo.getParentType();
+        }
+        getInputType() {
+          return this._typeInfo.getInputType();
+        }
+        getParentInputType() {
+          return this._typeInfo.getParentInputType();
+        }
+        getFieldDef() {
+          return this._typeInfo.getFieldDef();
+        }
+        getDirective() {
+          return this._typeInfo.getDirective();
+        }
+        getArgument() {
+          return this._typeInfo.getArgument();
+        }
+        getEnumValue() {
+          return this._typeInfo.getEnumValue();
+        }
+      }
+      function validate(
+        schema,
+        documentAST,
+        rules = specifiedRules,
+        options,
+        typeInfo = new TypeInfo(schema)
+      ) {
+        var _options$maxErrors;
+        const maxErrors =
+          (_options$maxErrors =
+            options === null || options === void 0
+              ? void 0
+              : options.maxErrors) !== null && _options$maxErrors !== void 0
+            ? _options$maxErrors
+            : 100;
+        documentAST || devAssert$1(false, "Must provide document.");
+        assertValidSchema(schema);
+        const abortObj = Object.freeze({});
+        const errors2 = [];
+        const context = new ValidationContext(
+          schema,
+          documentAST,
+          typeInfo,
+          (error2) => {
+            if (errors2.length >= maxErrors) {
+              errors2.push(
+                new GraphQLError(
+                  "Too many validation errors, error limit reached. Validation aborted."
+                )
+              );
+              throw abortObj;
+            }
+            errors2.push(error2);
+          }
+        );
+        const visitor = visitInParallel(rules.map((rule) => rule(context)));
+        try {
+          visit(documentAST, visitWithTypeInfo(typeInfo, visitor));
+        } catch (e) {
+          if (e !== abortObj) {
+            throw e;
+          }
+        }
+        return errors2;
+      }
+      function validateSDL(
+        documentAST,
+        schemaToExtend,
+        rules = specifiedSDLRules$1
+      ) {
+        const errors2 = [];
+        const context = new SDLValidationContext(
+          documentAST,
+          schemaToExtend,
+          (error2) => {
+            errors2.push(error2);
+          }
+        );
+        const visitors = rules.map((rule) => rule(context));
+        visit(documentAST, visitInParallel(visitors));
+        return errors2;
+      }
+      function assertValidSDL(documentAST) {
+        const errors2 = validateSDL(documentAST);
+        if (errors2.length !== 0) {
+          throw new Error(errors2.map((error2) => error2.message).join("\n\n"));
+        }
+      }
+      function assertValidSDLExtension(documentAST, schema) {
+        const errors2 = validateSDL(documentAST, schema);
+        if (errors2.length !== 0) {
+          throw new Error(errors2.map((error2) => error2.message).join("\n\n"));
+        }
+      }
+      function memoize3(fn) {
+        let cache0;
+        return function memoized(a1, a2, a3) {
+          if (cache0 === void 0) {
+            cache0 = /* @__PURE__ */ new WeakMap();
+          }
+          let cache1 = cache0.get(a1);
+          if (cache1 === void 0) {
+            cache1 = /* @__PURE__ */ new WeakMap();
+            cache0.set(a1, cache1);
+          }
+          let cache2 = cache1.get(a2);
+          if (cache2 === void 0) {
+            cache2 = /* @__PURE__ */ new WeakMap();
+            cache1.set(a2, cache2);
+          }
+          let fnResult = cache2.get(a3);
+          if (fnResult === void 0) {
+            fnResult = fn(a1, a2, a3);
+            cache2.set(a3, fnResult);
+          }
+          return fnResult;
+        };
+      }
+      function promiseForObject(object) {
+        return Promise.all(Object.values(object)).then((resolvedValues) => {
+          const resolvedObject = /* @__PURE__ */ Object.create(null);
+          for (const [i, key] of Object.keys(object).entries()) {
+            resolvedObject[key] = resolvedValues[i];
+          }
+          return resolvedObject;
+        });
+      }
+      function promiseReduce$1(values, callbackFn, initialValue) {
+        let accumulator = initialValue;
+        for (const value of values) {
+          accumulator = isPromise$2(accumulator)
+            ? accumulator.then((resolved) => callbackFn(resolved, value))
+            : callbackFn(accumulator, value);
+        }
+        return accumulator;
+      }
+      function toError$1(thrownValue) {
+        return thrownValue instanceof Error
+          ? thrownValue
+          : new NonErrorThrown$1(thrownValue);
+      }
+      class NonErrorThrown$1 extends Error {
+        constructor(thrownValue) {
+          super("Unexpected error value: " + inspect$2(thrownValue));
+          this.name = "NonErrorThrown";
+          this.thrownValue = thrownValue;
+        }
+      }
+      function locatedError(rawOriginalError, nodes, path) {
+        var _nodes;
+        const originalError = toError$1(rawOriginalError);
+        if (isLocatedGraphQLError(originalError)) {
+          return originalError;
+        }
+        return new GraphQLError(originalError.message, {
+          nodes:
+            (_nodes = originalError.nodes) !== null && _nodes !== void 0
+              ? _nodes
+              : nodes,
+          source: originalError.source,
+          positions: originalError.positions,
+          path,
+          originalError,
+        });
+      }
+      function isLocatedGraphQLError(error2) {
+        return Array.isArray(error2.path);
+      }
+      const collectSubfields = memoize3((exeContext, returnType, fieldNodes) =>
+        collectSubfields$1(
+          exeContext.schema,
+          exeContext.fragments,
+          exeContext.variableValues,
+          returnType,
+          fieldNodes
+        )
+      );
+      function execute$1(args) {
+        arguments.length < 2 ||
+          devAssert$1(
+            false,
+            "graphql@16 dropped long-deprecated support for positional arguments, please pass an object instead."
+          );
+        const { schema, document: document2, variableValues, rootValue } = args;
+        assertValidExecutionArguments(schema, document2, variableValues);
+        const exeContext = buildExecutionContext(args);
+        if (!("schema" in exeContext)) {
+          return {
+            errors: exeContext,
+          };
+        }
+        try {
+          const { operation } = exeContext;
+          const result2 = executeOperation(exeContext, operation, rootValue);
+          if (isPromise$2(result2)) {
+            return result2.then(
+              (data) => buildResponse(data, exeContext.errors),
+              (error2) => {
+                exeContext.errors.push(error2);
+                return buildResponse(null, exeContext.errors);
+              }
+            );
+          }
+          return buildResponse(result2, exeContext.errors);
+        } catch (error2) {
+          exeContext.errors.push(error2);
+          return buildResponse(null, exeContext.errors);
+        }
+      }
+      function executeSync(args) {
+        const result2 = execute$1(args);
+        if (isPromise$2(result2)) {
+          throw new Error(
+            "GraphQL execution failed to complete synchronously."
+          );
+        }
+        return result2;
+      }
+      function buildResponse(data, errors2) {
+        return errors2.length === 0
+          ? {
+              data,
+            }
+          : {
+              errors: errors2,
+              data,
+            };
+      }
+      function assertValidExecutionArguments(
+        schema,
+        document2,
+        rawVariableValues
+      ) {
+        document2 || devAssert$1(false, "Must provide document.");
+        assertValidSchema(schema);
+        rawVariableValues == null ||
+          isObjectLike$1(rawVariableValues) ||
+          devAssert$1(
+            false,
+            "Variables must be provided as an Object where each property is a variable value. Perhaps look to see if an unparsed JSON string was provided."
+          );
+      }
+      function buildExecutionContext(args) {
+        var _definition$name, _operation$variableDe;
+        const {
+          schema,
+          document: document2,
+          rootValue,
+          contextValue,
+          variableValues: rawVariableValues,
+          operationName,
+          fieldResolver,
+          typeResolver,
+          subscribeFieldResolver,
+        } = args;
+        let operation;
+        const fragments = /* @__PURE__ */ Object.create(null);
+        for (const definition of document2.definitions) {
+          switch (definition.kind) {
+            case Kind.OPERATION_DEFINITION:
+              if (operationName == null) {
+                if (operation !== void 0) {
+                  return [
+                    new GraphQLError(
+                      "Must provide operation name if query contains multiple operations."
+                    ),
+                  ];
+                }
+                operation = definition;
+              } else if (
+                ((_definition$name = definition.name) === null ||
+                _definition$name === void 0
+                  ? void 0
+                  : _definition$name.value) === operationName
+              ) {
+                operation = definition;
+              }
+              break;
+            case Kind.FRAGMENT_DEFINITION:
+              fragments[definition.name.value] = definition;
+              break;
+          }
+        }
+        if (!operation) {
+          if (operationName != null) {
+            return [
+              new GraphQLError(`Unknown operation named "${operationName}".`),
+            ];
+          }
+          return [new GraphQLError("Must provide an operation.")];
+        }
+        const variableDefinitions =
+          (_operation$variableDe = operation.variableDefinitions) !== null &&
+          _operation$variableDe !== void 0
+            ? _operation$variableDe
+            : [];
+        const coercedVariableValues = getVariableValues$1(
+          schema,
+          variableDefinitions,
+          rawVariableValues !== null && rawVariableValues !== void 0
+            ? rawVariableValues
+            : {},
+          {
+            maxErrors: 50,
+          }
+        );
+        if (coercedVariableValues.errors) {
+          return coercedVariableValues.errors;
+        }
+        return {
+          schema,
+          fragments,
+          rootValue,
+          contextValue,
+          operation,
+          variableValues: coercedVariableValues.coerced,
+          fieldResolver:
+            fieldResolver !== null && fieldResolver !== void 0
+              ? fieldResolver
+              : defaultFieldResolver$1,
+          typeResolver:
+            typeResolver !== null && typeResolver !== void 0
+              ? typeResolver
+              : defaultTypeResolver$1,
+          subscribeFieldResolver:
+            subscribeFieldResolver !== null && subscribeFieldResolver !== void 0
+              ? subscribeFieldResolver
+              : defaultFieldResolver$1,
+          errors: [],
+        };
+      }
+      function executeOperation(exeContext, operation, rootValue) {
+        const rootType = exeContext.schema.getRootType(operation.operation);
+        if (rootType == null) {
+          throw new GraphQLError(
+            `Schema is not configured to execute ${operation.operation} operation.`,
+            {
+              nodes: operation,
+            }
+          );
+        }
+        const rootFields = collectFields$1(
+          exeContext.schema,
+          exeContext.fragments,
+          exeContext.variableValues,
+          rootType,
+          operation.selectionSet
+        );
+        const path = void 0;
+        switch (operation.operation) {
+          case OperationTypeNode.QUERY:
+            return executeFields(
+              exeContext,
+              rootType,
+              rootValue,
+              path,
+              rootFields
+            );
+          case OperationTypeNode.MUTATION:
+            return executeFieldsSerially(
+              exeContext,
+              rootType,
+              rootValue,
+              path,
+              rootFields
+            );
+          case OperationTypeNode.SUBSCRIPTION:
+            return executeFields(
+              exeContext,
+              rootType,
+              rootValue,
+              path,
+              rootFields
+            );
+        }
+      }
+      function executeFieldsSerially(
+        exeContext,
+        parentType,
+        sourceValue,
+        path,
+        fields
+      ) {
+        return promiseReduce$1(
+          fields.entries(),
+          (results, [responseName, fieldNodes]) => {
+            const fieldPath = addPath$1(path, responseName, parentType.name);
+            const result2 = executeField(
+              exeContext,
+              parentType,
+              sourceValue,
+              fieldNodes,
+              fieldPath
+            );
+            if (result2 === void 0) {
+              return results;
+            }
+            if (isPromise$2(result2)) {
+              return result2.then((resolvedResult) => {
+                results[responseName] = resolvedResult;
+                return results;
+              });
+            }
+            results[responseName] = result2;
+            return results;
+          },
+          /* @__PURE__ */ Object.create(null)
+        );
+      }
+      function executeFields(
+        exeContext,
+        parentType,
+        sourceValue,
+        path,
+        fields
+      ) {
+        const results = /* @__PURE__ */ Object.create(null);
+        let containsPromise = false;
+        for (const [responseName, fieldNodes] of fields.entries()) {
+          const fieldPath = addPath$1(path, responseName, parentType.name);
+          const result2 = executeField(
+            exeContext,
+            parentType,
+            sourceValue,
+            fieldNodes,
+            fieldPath
+          );
+          if (result2 !== void 0) {
+            results[responseName] = result2;
+            if (isPromise$2(result2)) {
+              containsPromise = true;
+            }
+          }
+        }
+        if (!containsPromise) {
+          return results;
+        }
+        return promiseForObject(results);
+      }
+      function executeField(exeContext, parentType, source, fieldNodes, path) {
+        var _fieldDef$resolve;
+        const fieldDef = getFieldDef$2(
+          exeContext.schema,
+          parentType,
+          fieldNodes[0]
+        );
+        if (!fieldDef) {
+          return;
+        }
+        const returnType = fieldDef.type;
+        const resolveFn =
+          (_fieldDef$resolve = fieldDef.resolve) !== null &&
+          _fieldDef$resolve !== void 0
+            ? _fieldDef$resolve
+            : exeContext.fieldResolver;
+        const info2 = buildResolveInfo(
+          exeContext,
+          fieldDef,
+          fieldNodes,
+          parentType,
+          path
+        );
+        try {
+          const args = getArgumentValues$1(
+            fieldDef,
+            fieldNodes[0],
+            exeContext.variableValues
+          );
+          const contextValue = exeContext.contextValue;
+          const result2 = resolveFn(source, args, contextValue, info2);
+          let completed;
+          if (isPromise$2(result2)) {
+            completed = result2.then((resolved) =>
+              completeValue(
+                exeContext,
+                returnType,
+                fieldNodes,
+                info2,
+                path,
+                resolved
+              )
+            );
+          } else {
+            completed = completeValue(
+              exeContext,
+              returnType,
+              fieldNodes,
+              info2,
+              path,
+              result2
+            );
+          }
+          if (isPromise$2(completed)) {
+            return completed.then(void 0, (rawError) => {
+              const error2 = locatedError(
+                rawError,
+                fieldNodes,
+                pathToArray$1(path)
+              );
+              return handleFieldError(error2, returnType, exeContext);
+            });
+          }
+          return completed;
+        } catch (rawError) {
+          const error2 = locatedError(
+            rawError,
+            fieldNodes,
+            pathToArray$1(path)
+          );
+          return handleFieldError(error2, returnType, exeContext);
+        }
+      }
+      function buildResolveInfo(
+        exeContext,
+        fieldDef,
+        fieldNodes,
+        parentType,
+        path
+      ) {
+        return {
+          fieldName: fieldDef.name,
+          fieldNodes,
+          returnType: fieldDef.type,
+          parentType,
+          path,
+          schema: exeContext.schema,
+          fragments: exeContext.fragments,
+          rootValue: exeContext.rootValue,
+          operation: exeContext.operation,
+          variableValues: exeContext.variableValues,
+        };
+      }
+      function handleFieldError(error2, returnType, exeContext) {
+        if (isNonNullType(returnType)) {
+          throw error2;
+        }
+        exeContext.errors.push(error2);
+        return null;
+      }
+      function completeValue(
+        exeContext,
+        returnType,
+        fieldNodes,
+        info2,
+        path,
+        result2
+      ) {
+        if (result2 instanceof Error) {
+          throw result2;
+        }
+        if (isNonNullType(returnType)) {
+          const completed = completeValue(
+            exeContext,
+            returnType.ofType,
+            fieldNodes,
+            info2,
+            path,
+            result2
+          );
+          if (completed === null) {
+            throw new Error(
+              `Cannot return null for non-nullable field ${info2.parentType.name}.${info2.fieldName}.`
+            );
+          }
+          return completed;
+        }
+        if (result2 == null) {
+          return null;
+        }
+        if (isListType(returnType)) {
+          return completeListValue(
+            exeContext,
+            returnType,
+            fieldNodes,
+            info2,
+            path,
+            result2
+          );
+        }
+        if (isLeafType(returnType)) {
+          return completeLeafValue(returnType, result2);
+        }
+        if (isAbstractType(returnType)) {
+          return completeAbstractValue(
+            exeContext,
+            returnType,
+            fieldNodes,
+            info2,
+            path,
+            result2
+          );
+        }
+        if (isObjectType(returnType)) {
+          return completeObjectValue(
+            exeContext,
+            returnType,
+            fieldNodes,
+            info2,
+            path,
+            result2
+          );
+        }
+        invariant$2(
+          false,
+          "Cannot complete value of unexpected output type: " +
+            inspect$2(returnType)
+        );
+      }
+      function completeListValue(
+        exeContext,
+        returnType,
+        fieldNodes,
+        info2,
+        path,
+        result2
+      ) {
+        if (!isIterableObject$1(result2)) {
+          throw new GraphQLError(
+            `Expected Iterable, but did not find one for field "${info2.parentType.name}.${info2.fieldName}".`
+          );
+        }
+        const itemType = returnType.ofType;
+        let containsPromise = false;
+        const completedResults = Array.from(result2, (item, index) => {
+          const itemPath = addPath$1(path, index, void 0);
+          try {
+            let completedItem;
+            if (isPromise$2(item)) {
+              completedItem = item.then((resolved) =>
+                completeValue(
+                  exeContext,
+                  itemType,
+                  fieldNodes,
+                  info2,
+                  itemPath,
+                  resolved
+                )
+              );
+            } else {
+              completedItem = completeValue(
+                exeContext,
+                itemType,
+                fieldNodes,
+                info2,
+                itemPath,
+                item
+              );
+            }
+            if (isPromise$2(completedItem)) {
+              containsPromise = true;
+              return completedItem.then(void 0, (rawError) => {
+                const error2 = locatedError(
+                  rawError,
+                  fieldNodes,
+                  pathToArray$1(itemPath)
+                );
+                return handleFieldError(error2, itemType, exeContext);
+              });
+            }
+            return completedItem;
+          } catch (rawError) {
+            const error2 = locatedError(
+              rawError,
+              fieldNodes,
+              pathToArray$1(itemPath)
+            );
+            return handleFieldError(error2, itemType, exeContext);
+          }
+        });
+        return containsPromise
+          ? Promise.all(completedResults)
+          : completedResults;
+      }
+      function completeLeafValue(returnType, result2) {
+        const serializedResult = returnType.serialize(result2);
+        if (serializedResult == null) {
+          throw new Error(
+            `Expected \`${inspect$2(returnType)}.serialize(${inspect$2(
+              result2
+            )})\` to return non-nullable value, returned: ${inspect$2(
+              serializedResult
+            )}`
+          );
+        }
+        return serializedResult;
+      }
+      function completeAbstractValue(
+        exeContext,
+        returnType,
+        fieldNodes,
+        info2,
+        path,
+        result2
+      ) {
+        var _returnType$resolveTy;
+        const resolveTypeFn =
+          (_returnType$resolveTy = returnType.resolveType) !== null &&
+          _returnType$resolveTy !== void 0
+            ? _returnType$resolveTy
+            : exeContext.typeResolver;
+        const contextValue = exeContext.contextValue;
+        const runtimeType = resolveTypeFn(
+          result2,
+          contextValue,
+          info2,
+          returnType
+        );
+        if (isPromise$2(runtimeType)) {
+          return runtimeType.then((resolvedRuntimeType) =>
+            completeObjectValue(
+              exeContext,
+              ensureValidRuntimeType(
+                resolvedRuntimeType,
+                exeContext,
+                returnType,
+                fieldNodes,
+                info2,
+                result2
+              ),
+              fieldNodes,
+              info2,
+              path,
+              result2
+            )
+          );
+        }
+        return completeObjectValue(
+          exeContext,
+          ensureValidRuntimeType(
+            runtimeType,
+            exeContext,
+            returnType,
+            fieldNodes,
+            info2,
+            result2
+          ),
+          fieldNodes,
+          info2,
+          path,
+          result2
+        );
+      }
+      function ensureValidRuntimeType(
+        runtimeTypeName,
+        exeContext,
+        returnType,
+        fieldNodes,
+        info2,
+        result2
+      ) {
+        if (runtimeTypeName == null) {
+          throw new GraphQLError(
+            `Abstract type "${returnType.name}" must resolve to an Object type at runtime for field "${info2.parentType.name}.${info2.fieldName}". Either the "${returnType.name}" type should provide a "resolveType" function or each possible type should provide an "isTypeOf" function.`,
+            fieldNodes
+          );
+        }
+        if (isObjectType(runtimeTypeName)) {
+          throw new GraphQLError(
+            "Support for returning GraphQLObjectType from resolveType was removed in graphql-js@16.0.0 please return type name instead."
+          );
+        }
+        if (typeof runtimeTypeName !== "string") {
+          throw new GraphQLError(
+            `Abstract type "${
+              returnType.name
+            }" must resolve to an Object type at runtime for field "${
+              info2.parentType.name
+            }.${info2.fieldName}" with value ${inspect$2(
+              result2
+            )}, received "${inspect$2(runtimeTypeName)}".`
+          );
+        }
+        const runtimeType = exeContext.schema.getType(runtimeTypeName);
+        if (runtimeType == null) {
+          throw new GraphQLError(
+            `Abstract type "${returnType.name}" was resolved to a type "${runtimeTypeName}" that does not exist inside the schema.`,
+            {
+              nodes: fieldNodes,
+            }
+          );
+        }
+        if (!isObjectType(runtimeType)) {
+          throw new GraphQLError(
+            `Abstract type "${returnType.name}" was resolved to a non-object type "${runtimeTypeName}".`,
+            {
+              nodes: fieldNodes,
+            }
+          );
+        }
+        if (!exeContext.schema.isSubType(returnType, runtimeType)) {
+          throw new GraphQLError(
+            `Runtime Object type "${runtimeType.name}" is not a possible type for "${returnType.name}".`,
+            {
+              nodes: fieldNodes,
+            }
+          );
+        }
+        return runtimeType;
+      }
+      function completeObjectValue(
+        exeContext,
+        returnType,
+        fieldNodes,
+        info2,
+        path,
+        result2
+      ) {
+        const subFieldNodes = collectSubfields(
+          exeContext,
+          returnType,
+          fieldNodes
+        );
+        if (returnType.isTypeOf) {
+          const isTypeOf = returnType.isTypeOf(
+            result2,
+            exeContext.contextValue,
+            info2
+          );
+          if (isPromise$2(isTypeOf)) {
+            return isTypeOf.then((resolvedIsTypeOf) => {
+              if (!resolvedIsTypeOf) {
+                throw invalidReturnTypeError(returnType, result2, fieldNodes);
+              }
+              return executeFields(
+                exeContext,
+                returnType,
+                result2,
+                path,
+                subFieldNodes
+              );
+            });
+          }
+          if (!isTypeOf) {
+            throw invalidReturnTypeError(returnType, result2, fieldNodes);
+          }
+        }
+        return executeFields(
+          exeContext,
+          returnType,
+          result2,
+          path,
+          subFieldNodes
+        );
+      }
+      function invalidReturnTypeError(returnType, result2, fieldNodes) {
+        return new GraphQLError(
+          `Expected value of type "${returnType.name}" but got: ${inspect$2(
+            result2
+          )}.`,
+          {
+            nodes: fieldNodes,
+          }
+        );
+      }
+      const defaultTypeResolver$1 = function (
+        value,
+        contextValue,
+        info2,
+        abstractType
+      ) {
+        if (isObjectLike$1(value) && typeof value.__typename === "string") {
+          return value.__typename;
+        }
+        const possibleTypes = info2.schema.getPossibleTypes(abstractType);
+        const promisedIsTypeOfResults = [];
+        for (let i = 0; i < possibleTypes.length; i++) {
+          const type2 = possibleTypes[i];
+          if (type2.isTypeOf) {
+            const isTypeOfResult = type2.isTypeOf(value, contextValue, info2);
+            if (isPromise$2(isTypeOfResult)) {
+              promisedIsTypeOfResults[i] = isTypeOfResult;
+            } else if (isTypeOfResult) {
+              return type2.name;
+            }
+          }
+        }
+        if (promisedIsTypeOfResults.length) {
+          return Promise.all(promisedIsTypeOfResults).then(
+            (isTypeOfResults) => {
+              for (let i = 0; i < isTypeOfResults.length; i++) {
+                if (isTypeOfResults[i]) {
+                  return possibleTypes[i].name;
+                }
+              }
+            }
+          );
+        }
+      };
+      const defaultFieldResolver$1 = function (
+        source,
+        args,
+        contextValue,
+        info2
+      ) {
+        if (isObjectLike$1(source) || typeof source === "function") {
+          const property = source[info2.fieldName];
+          if (typeof property === "function") {
+            return source[info2.fieldName](args, contextValue, info2);
+          }
+          return property;
+        }
+      };
+      function getFieldDef$2(schema, parentType, fieldNode) {
+        const fieldName = fieldNode.name.value;
+        if (
+          fieldName === SchemaMetaFieldDef$1.name &&
+          schema.getQueryType() === parentType
+        ) {
+          return SchemaMetaFieldDef$1;
+        } else if (
+          fieldName === TypeMetaFieldDef$1.name &&
+          schema.getQueryType() === parentType
+        ) {
+          return TypeMetaFieldDef$1;
+        } else if (fieldName === TypeNameMetaFieldDef.name) {
+          return TypeNameMetaFieldDef;
+        }
+        return parentType.getFields()[fieldName];
+      }
+      function graphql$1(args) {
+        return new Promise((resolve) => resolve(graphqlImpl(args)));
+      }
+      function graphqlSync(args) {
+        const result2 = graphqlImpl(args);
+        if (isPromise$2(result2)) {
+          throw new Error(
+            "GraphQL execution failed to complete synchronously."
+          );
+        }
+        return result2;
+      }
+      function graphqlImpl(args) {
+        arguments.length < 2 ||
+          devAssert$1(
+            false,
+            "graphql@16 dropped long-deprecated support for positional arguments, please pass an object instead."
+          );
+        const {
+          schema,
+          source,
+          rootValue,
+          contextValue,
+          variableValues,
+          operationName,
+          fieldResolver,
+          typeResolver,
+        } = args;
+        const schemaValidationErrors = validateSchema(schema);
+        if (schemaValidationErrors.length > 0) {
+          return {
+            errors: schemaValidationErrors,
+          };
+        }
+        let document2;
+        try {
+          document2 = parse$1(source);
+        } catch (syntaxError2) {
+          return {
+            errors: [syntaxError2],
+          };
+        }
+        const validationErrors = validate(schema, document2);
+        if (validationErrors.length > 0) {
+          return {
+            errors: validationErrors,
+          };
+        }
+        return execute$1({
+          schema,
+          document: document2,
+          rootValue,
+          contextValue,
+          variableValues,
+          operationName,
+          fieldResolver,
+          typeResolver,
+        });
+      }
+      function isAsyncIterable$3(maybeAsyncIterable) {
+        return (
+          typeof (maybeAsyncIterable === null || maybeAsyncIterable === void 0
+            ? void 0
+            : maybeAsyncIterable[Symbol.asyncIterator]) === "function"
+        );
+      }
+      function mapAsyncIterator$1(iterable, callback) {
+        const iterator = iterable[Symbol.asyncIterator]();
+        async function mapResult(result2) {
+          if (result2.done) {
+            return result2;
+          }
+          try {
+            return {
+              value: await callback(result2.value),
+              done: false,
+            };
+          } catch (error2) {
+            if (typeof iterator.return === "function") {
+              try {
+                await iterator.return();
+              } catch (_e) {}
+            }
+            throw error2;
+          }
+        }
+        return {
+          async next() {
+            return mapResult(await iterator.next());
+          },
+          async return() {
+            return typeof iterator.return === "function"
+              ? mapResult(await iterator.return())
+              : {
+                  value: void 0,
+                  done: true,
+                };
+          },
+          async throw(error2) {
+            if (typeof iterator.throw === "function") {
+              return mapResult(await iterator.throw(error2));
+            }
+            throw error2;
+          },
+          [Symbol.asyncIterator]() {
+            return this;
+          },
+        };
+      }
+      async function subscribe(args) {
+        arguments.length < 2 ||
+          devAssert$1(
+            false,
+            "graphql@16 dropped long-deprecated support for positional arguments, please pass an object instead."
+          );
+        const {
+          schema,
+          document: document2,
+          rootValue,
+          contextValue,
+          variableValues,
+          operationName,
+          fieldResolver,
+          subscribeFieldResolver,
+        } = args;
+        const resultOrStream = await createSourceEventStream(
+          schema,
+          document2,
+          rootValue,
+          contextValue,
+          variableValues,
+          operationName,
+          subscribeFieldResolver
+        );
+        if (!isAsyncIterable$3(resultOrStream)) {
+          return resultOrStream;
+        }
+        const mapSourceToResponse = (payload) =>
+          execute$1({
+            schema,
+            document: document2,
+            rootValue: payload,
+            contextValue,
+            variableValues,
+            operationName,
+            fieldResolver,
+          });
+        return mapAsyncIterator$1(resultOrStream, mapSourceToResponse);
+      }
+      async function createSourceEventStream(
+        schema,
+        document2,
+        rootValue,
+        contextValue,
+        variableValues,
+        operationName,
+        subscribeFieldResolver
+      ) {
+        assertValidExecutionArguments(schema, document2, variableValues);
+        const exeContext = buildExecutionContext({
+          schema,
+          document: document2,
+          rootValue,
+          contextValue,
+          variableValues,
+          operationName,
+          subscribeFieldResolver,
+        });
+        if (!("schema" in exeContext)) {
+          return {
+            errors: exeContext,
+          };
+        }
+        try {
+          const eventStream = await executeSubscription(exeContext);
+          if (!isAsyncIterable$3(eventStream)) {
+            throw new Error(
+              `Subscription field must return Async Iterable. Received: ${inspect$2(
+                eventStream
+              )}.`
+            );
+          }
+          return eventStream;
+        } catch (error2) {
+          if (error2 instanceof GraphQLError) {
+            return {
+              errors: [error2],
+            };
+          }
+          throw error2;
+        }
+      }
+      async function executeSubscription(exeContext) {
+        const { schema, fragments, operation, variableValues, rootValue } =
+          exeContext;
+        const rootType = schema.getSubscriptionType();
+        if (rootType == null) {
+          throw new GraphQLError(
+            "Schema is not configured to execute subscription operation.",
+            {
+              nodes: operation,
+            }
+          );
+        }
+        const rootFields = collectFields$1(
+          schema,
+          fragments,
+          variableValues,
+          rootType,
+          operation.selectionSet
+        );
+        const [responseName, fieldNodes] = [...rootFields.entries()][0];
+        const fieldDef = getFieldDef$2(schema, rootType, fieldNodes[0]);
+        if (!fieldDef) {
+          const fieldName = fieldNodes[0].name.value;
+          throw new GraphQLError(
+            `The subscription field "${fieldName}" is not defined.`,
+            {
+              nodes: fieldNodes,
+            }
+          );
+        }
+        const path = addPath$1(void 0, responseName, rootType.name);
+        const info2 = buildResolveInfo(
+          exeContext,
+          fieldDef,
+          fieldNodes,
+          rootType,
+          path
+        );
+        try {
+          var _fieldDef$subscribe;
+          const args = getArgumentValues$1(
+            fieldDef,
+            fieldNodes[0],
+            variableValues
+          );
+          const contextValue = exeContext.contextValue;
+          const resolveFn =
+            (_fieldDef$subscribe = fieldDef.subscribe) !== null &&
+            _fieldDef$subscribe !== void 0
+              ? _fieldDef$subscribe
+              : exeContext.subscribeFieldResolver;
+          const eventStream = await resolveFn(
+            rootValue,
+            args,
+            contextValue,
+            info2
+          );
+          if (eventStream instanceof Error) {
+            throw eventStream;
+          }
+          return eventStream;
+        } catch (error2) {
+          throw locatedError(error2, fieldNodes, pathToArray$1(path));
+        }
+      }
+      function NoDeprecatedCustomRule(context) {
+        return {
+          Field(node) {
+            const fieldDef = context.getFieldDef();
+            const deprecationReason =
+              fieldDef === null || fieldDef === void 0
+                ? void 0
+                : fieldDef.deprecationReason;
+            if (fieldDef && deprecationReason != null) {
+              const parentType = context.getParentType();
+              parentType != null || invariant$2(false);
+              context.reportError(
+                new GraphQLError(
+                  `The field ${parentType.name}.${fieldDef.name} is deprecated. ${deprecationReason}`,
+                  {
+                    nodes: node,
+                  }
+                )
+              );
+            }
+          },
+          Argument(node) {
+            const argDef = context.getArgument();
+            const deprecationReason =
+              argDef === null || argDef === void 0
+                ? void 0
+                : argDef.deprecationReason;
+            if (argDef && deprecationReason != null) {
+              const directiveDef = context.getDirective();
+              if (directiveDef != null) {
+                context.reportError(
+                  new GraphQLError(
+                    `Directive "@${directiveDef.name}" argument "${argDef.name}" is deprecated. ${deprecationReason}`,
+                    {
+                      nodes: node,
+                    }
+                  )
+                );
+              } else {
+                const parentType = context.getParentType();
+                const fieldDef = context.getFieldDef();
+                (parentType != null && fieldDef != null) || invariant$2(false);
+                context.reportError(
+                  new GraphQLError(
+                    `Field "${parentType.name}.${fieldDef.name}" argument "${argDef.name}" is deprecated. ${deprecationReason}`,
+                    {
+                      nodes: node,
+                    }
+                  )
+                );
+              }
+            }
+          },
+          ObjectField(node) {
+            const inputObjectDef = getNamedType(context.getParentInputType());
+            if (isInputObjectType(inputObjectDef)) {
+              const inputFieldDef = inputObjectDef.getFields()[node.name.value];
+              const deprecationReason =
+                inputFieldDef === null || inputFieldDef === void 0
+                  ? void 0
+                  : inputFieldDef.deprecationReason;
+              if (deprecationReason != null) {
+                context.reportError(
+                  new GraphQLError(
+                    `The input field ${inputObjectDef.name}.${inputFieldDef.name} is deprecated. ${deprecationReason}`,
+                    {
+                      nodes: node,
+                    }
+                  )
+                );
+              }
+            }
+          },
+          EnumValue(node) {
+            const enumValueDef = context.getEnumValue();
+            const deprecationReason =
+              enumValueDef === null || enumValueDef === void 0
+                ? void 0
+                : enumValueDef.deprecationReason;
+            if (enumValueDef && deprecationReason != null) {
+              const enumTypeDef = getNamedType(context.getInputType());
+              enumTypeDef != null || invariant$2(false);
+              context.reportError(
+                new GraphQLError(
+                  `The enum value "${enumTypeDef.name}.${enumValueDef.name}" is deprecated. ${deprecationReason}`,
+                  {
+                    nodes: node,
+                  }
+                )
+              );
+            }
+          },
+        };
+      }
+      function NoSchemaIntrospectionCustomRule(context) {
+        return {
+          Field(node) {
+            const type2 = getNamedType(context.getType());
+            if (type2 && isIntrospectionType(type2)) {
+              context.reportError(
+                new GraphQLError(
+                  `GraphQL introspection has been disabled, but the requested query contained the field "${node.name.value}".`,
+                  {
+                    nodes: node,
+                  }
+                )
+              );
+            }
+          },
+        };
+      }
+      function getIntrospectionQuery(options) {
+        const optionsWithDefault = __spreadValues(
+          {
+            descriptions: true,
+            specifiedByUrl: false,
+            directiveIsRepeatable: false,
+            schemaDescription: false,
+            inputValueDeprecation: false,
+          },
+          options
+        );
+        const descriptions = optionsWithDefault.descriptions
+          ? "description"
+          : "";
+        const specifiedByUrl = optionsWithDefault.specifiedByUrl
+          ? "specifiedByURL"
+          : "";
+        const directiveIsRepeatable = optionsWithDefault.directiveIsRepeatable
+          ? "isRepeatable"
+          : "";
+        const schemaDescription = optionsWithDefault.schemaDescription
+          ? descriptions
+          : "";
+        function inputDeprecation(str) {
+          return optionsWithDefault.inputValueDeprecation ? str : "";
+        }
+        return `
+    query IntrospectionQuery {
+      __schema {
+        ${schemaDescription}
+        queryType { name }
+        mutationType { name }
+        subscriptionType { name }
+        types {
+          ...FullType
+        }
+        directives {
+          name
+          ${descriptions}
+          ${directiveIsRepeatable}
+          locations
+          args${inputDeprecation("(includeDeprecated: true)")} {
+            ...InputValue
+          }
+        }
+      }
+    }
+
+    fragment FullType on __Type {
+      kind
+      name
+      ${descriptions}
+      ${specifiedByUrl}
+      fields(includeDeprecated: true) {
+        name
+        ${descriptions}
+        args${inputDeprecation("(includeDeprecated: true)")} {
+          ...InputValue
+        }
+        type {
+          ...TypeRef
+        }
+        isDeprecated
+        deprecationReason
+      }
+      inputFields${inputDeprecation("(includeDeprecated: true)")} {
+        ...InputValue
+      }
+      interfaces {
+        ...TypeRef
+      }
+      enumValues(includeDeprecated: true) {
+        name
+        ${descriptions}
+        isDeprecated
+        deprecationReason
+      }
+      possibleTypes {
+        ...TypeRef
+      }
+    }
+
+    fragment InputValue on __InputValue {
+      name
+      ${descriptions}
+      type { ...TypeRef }
+      defaultValue
+      ${inputDeprecation("isDeprecated")}
+      ${inputDeprecation("deprecationReason")}
+    }
+
+    fragment TypeRef on __Type {
+      kind
+      name
+      ofType {
+        kind
+        name
+        ofType {
+          kind
+          name
+          ofType {
+            kind
+            name
+            ofType {
+              kind
+              name
+              ofType {
+                kind
+                name
+                ofType {
+                  kind
+                  name
+                  ofType {
+                    kind
+                    name
+                  }
+                }
+              }
+            }
+          }
+        }
+      }
+    }
+  `;
+      }
+      function getOperationAST(documentAST, operationName) {
+        let operation = null;
+        for (const definition of documentAST.definitions) {
+          if (definition.kind === Kind.OPERATION_DEFINITION) {
+            var _definition$name;
+            if (operationName == null) {
+              if (operation) {
+                return null;
+              }
+              operation = definition;
+            } else if (
+              ((_definition$name = definition.name) === null ||
+              _definition$name === void 0
+                ? void 0
+                : _definition$name.value) === operationName
+            ) {
+              return definition;
+            }
+          }
+        }
+        return operation;
+      }
+      var getOperationAST$1 = /* @__PURE__ */ Object.freeze({
+        __proto__: null,
+        [Symbol.toStringTag]: "Module",
+        getOperationAST,
+      });
+      function getOperationRootType(schema, operation) {
+        if (operation.operation === "query") {
+          const queryType = schema.getQueryType();
+          if (!queryType) {
+            throw new GraphQLError(
+              "Schema does not define the required query root type.",
+              {
+                nodes: operation,
+              }
+            );
+          }
+          return queryType;
+        }
+        if (operation.operation === "mutation") {
+          const mutationType = schema.getMutationType();
+          if (!mutationType) {
+            throw new GraphQLError("Schema is not configured for mutations.", {
+              nodes: operation,
+            });
+          }
+          return mutationType;
+        }
+        if (operation.operation === "subscription") {
+          const subscriptionType = schema.getSubscriptionType();
+          if (!subscriptionType) {
+            throw new GraphQLError(
+              "Schema is not configured for subscriptions.",
+              {
+                nodes: operation,
+              }
+            );
+          }
+          return subscriptionType;
+        }
+        throw new GraphQLError(
+          "Can only have query, mutation and subscription operations.",
+          {
+            nodes: operation,
+          }
+        );
+      }
+      function introspectionFromSchema(schema, options) {
+        const optionsWithDefaults = __spreadValues(
+          {
+            specifiedByUrl: true,
+            directiveIsRepeatable: true,
+            schemaDescription: true,
+            inputValueDeprecation: true,
+          },
+          options
+        );
+        const document2 = parse$1(getIntrospectionQuery(optionsWithDefaults));
+        const result2 = executeSync({
+          schema,
+          document: document2,
+        });
+        (!result2.errors && result2.data) || invariant$2(false);
+        return result2.data;
+      }
+      function buildClientSchema(introspection2, options) {
+        (isObjectLike$1(introspection2) &&
+          isObjectLike$1(introspection2.__schema)) ||
+          devAssert$1(
+            false,
+            `Invalid or incomplete introspection result. Ensure that you are passing "data" property of introspection response and no "errors" was returned alongside: ${inspect$2(
+              introspection2
+            )}.`
+          );
+        const schemaIntrospection = introspection2.__schema;
+        const typeMap = keyValMap(
+          schemaIntrospection.types,
+          (typeIntrospection) => typeIntrospection.name,
+          (typeIntrospection) => buildType(typeIntrospection)
+        );
+        for (const stdType of [
+          ...specifiedScalarTypes,
+          ...introspectionTypes$1,
+        ]) {
+          if (typeMap[stdType.name]) {
+            typeMap[stdType.name] = stdType;
+          }
+        }
+        const queryType = schemaIntrospection.queryType
+          ? getObjectType(schemaIntrospection.queryType)
+          : null;
+        const mutationType = schemaIntrospection.mutationType
+          ? getObjectType(schemaIntrospection.mutationType)
+          : null;
+        const subscriptionType = schemaIntrospection.subscriptionType
+          ? getObjectType(schemaIntrospection.subscriptionType)
+          : null;
+        const directives = schemaIntrospection.directives
+          ? schemaIntrospection.directives.map(buildDirective)
+          : [];
+        return new GraphQLSchema({
+          description: schemaIntrospection.description,
+          query: queryType,
+          mutation: mutationType,
+          subscription: subscriptionType,
+          types: Object.values(typeMap),
+          directives,
+          assumeValid:
+            options === null || options === void 0
+              ? void 0
+              : options.assumeValid,
+        });
+        function getType(typeRef) {
+          if (typeRef.kind === TypeKind.LIST) {
+            const itemRef = typeRef.ofType;
+            if (!itemRef) {
+              throw new Error(
+                "Decorated type deeper than introspection query."
+              );
+            }
+            return new GraphQLList(getType(itemRef));
+          }
+          if (typeRef.kind === TypeKind.NON_NULL) {
+            const nullableRef = typeRef.ofType;
+            if (!nullableRef) {
+              throw new Error(
+                "Decorated type deeper than introspection query."
+              );
+            }
+            const nullableType = getType(nullableRef);
+            return new GraphQLNonNull(assertNullableType(nullableType));
+          }
+          return getNamedType2(typeRef);
+        }
+        function getNamedType2(typeRef) {
+          const typeName = typeRef.name;
+          if (!typeName) {
+            throw new Error(`Unknown type reference: ${inspect$2(typeRef)}.`);
+          }
+          const type2 = typeMap[typeName];
+          if (!type2) {
+            throw new Error(
+              `Invalid or incomplete schema, unknown type: ${typeName}. Ensure that a full introspection query is used in order to build a client schema.`
+            );
+          }
+          return type2;
+        }
+        function getObjectType(typeRef) {
+          return assertObjectType(getNamedType2(typeRef));
+        }
+        function getInterfaceType(typeRef) {
+          return assertInterfaceType(getNamedType2(typeRef));
+        }
+        function buildType(type2) {
+          if (type2 != null && type2.name != null && type2.kind != null) {
+            switch (type2.kind) {
+              case TypeKind.SCALAR:
+                return buildScalarDef(type2);
+              case TypeKind.OBJECT:
+                return buildObjectDef(type2);
+              case TypeKind.INTERFACE:
+                return buildInterfaceDef(type2);
+              case TypeKind.UNION:
+                return buildUnionDef(type2);
+              case TypeKind.ENUM:
+                return buildEnumDef(type2);
+              case TypeKind.INPUT_OBJECT:
+                return buildInputObjectDef(type2);
+            }
+          }
+          const typeStr = inspect$2(type2);
+          throw new Error(
+            `Invalid or incomplete introspection result. Ensure that a full introspection query is used in order to build a client schema: ${typeStr}.`
+          );
+        }
+        function buildScalarDef(scalarIntrospection) {
+          return new GraphQLScalarType({
+            name: scalarIntrospection.name,
+            description: scalarIntrospection.description,
+            specifiedByURL: scalarIntrospection.specifiedByURL,
+          });
+        }
+        function buildImplementationsList(implementingIntrospection) {
+          if (
+            implementingIntrospection.interfaces === null &&
+            implementingIntrospection.kind === TypeKind.INTERFACE
+          ) {
+            return [];
+          }
+          if (!implementingIntrospection.interfaces) {
+            const implementingIntrospectionStr = inspect$2(
+              implementingIntrospection
+            );
+            throw new Error(
+              `Introspection result missing interfaces: ${implementingIntrospectionStr}.`
+            );
+          }
+          return implementingIntrospection.interfaces.map(getInterfaceType);
+        }
+        function buildObjectDef(objectIntrospection) {
+          return new GraphQLObjectType({
+            name: objectIntrospection.name,
+            description: objectIntrospection.description,
+            interfaces: () => buildImplementationsList(objectIntrospection),
+            fields: () => buildFieldDefMap(objectIntrospection),
+          });
+        }
+        function buildInterfaceDef(interfaceIntrospection) {
+          return new GraphQLInterfaceType({
+            name: interfaceIntrospection.name,
+            description: interfaceIntrospection.description,
+            interfaces: () => buildImplementationsList(interfaceIntrospection),
+            fields: () => buildFieldDefMap(interfaceIntrospection),
+          });
+        }
+        function buildUnionDef(unionIntrospection) {
+          if (!unionIntrospection.possibleTypes) {
+            const unionIntrospectionStr = inspect$2(unionIntrospection);
+            throw new Error(
+              `Introspection result missing possibleTypes: ${unionIntrospectionStr}.`
+            );
+          }
+          return new GraphQLUnionType({
+            name: unionIntrospection.name,
+            description: unionIntrospection.description,
+            types: () => unionIntrospection.possibleTypes.map(getObjectType),
+          });
+        }
+        function buildEnumDef(enumIntrospection) {
+          if (!enumIntrospection.enumValues) {
+            const enumIntrospectionStr = inspect$2(enumIntrospection);
+            throw new Error(
+              `Introspection result missing enumValues: ${enumIntrospectionStr}.`
+            );
+          }
+          return new GraphQLEnumType({
+            name: enumIntrospection.name,
+            description: enumIntrospection.description,
+            values: keyValMap(
+              enumIntrospection.enumValues,
+              (valueIntrospection) => valueIntrospection.name,
+              (valueIntrospection) => ({
+                description: valueIntrospection.description,
+                deprecationReason: valueIntrospection.deprecationReason,
+              })
+            ),
+          });
+        }
+        function buildInputObjectDef(inputObjectIntrospection) {
+          if (!inputObjectIntrospection.inputFields) {
+            const inputObjectIntrospectionStr = inspect$2(
+              inputObjectIntrospection
+            );
+            throw new Error(
+              `Introspection result missing inputFields: ${inputObjectIntrospectionStr}.`
+            );
+          }
+          return new GraphQLInputObjectType({
+            name: inputObjectIntrospection.name,
+            description: inputObjectIntrospection.description,
+            fields: () =>
+              buildInputValueDefMap(inputObjectIntrospection.inputFields),
+          });
+        }
+        function buildFieldDefMap(typeIntrospection) {
+          if (!typeIntrospection.fields) {
+            throw new Error(
+              `Introspection result missing fields: ${inspect$2(
+                typeIntrospection
+              )}.`
+            );
+          }
+          return keyValMap(
+            typeIntrospection.fields,
+            (fieldIntrospection) => fieldIntrospection.name,
+            buildField
+          );
+        }
+        function buildField(fieldIntrospection) {
+          const type2 = getType(fieldIntrospection.type);
+          if (!isOutputType(type2)) {
+            const typeStr = inspect$2(type2);
+            throw new Error(
+              `Introspection must provide output type for fields, but received: ${typeStr}.`
+            );
+          }
+          if (!fieldIntrospection.args) {
+            const fieldIntrospectionStr = inspect$2(fieldIntrospection);
+            throw new Error(
+              `Introspection result missing field args: ${fieldIntrospectionStr}.`
+            );
+          }
+          return {
+            description: fieldIntrospection.description,
+            deprecationReason: fieldIntrospection.deprecationReason,
+            type: type2,
+            args: buildInputValueDefMap(fieldIntrospection.args),
+          };
+        }
+        function buildInputValueDefMap(inputValueIntrospections) {
+          return keyValMap(
+            inputValueIntrospections,
+            (inputValue) => inputValue.name,
+            buildInputValue
+          );
+        }
+        function buildInputValue(inputValueIntrospection) {
+          const type2 = getType(inputValueIntrospection.type);
+          if (!isInputType(type2)) {
+            const typeStr = inspect$2(type2);
+            throw new Error(
+              `Introspection must provide input type for arguments, but received: ${typeStr}.`
+            );
+          }
+          const defaultValue2 =
+            inputValueIntrospection.defaultValue != null
+              ? valueFromAST$1(
+                  parseValue$1(inputValueIntrospection.defaultValue),
+                  type2
+                )
+              : void 0;
+          return {
+            description: inputValueIntrospection.description,
+            type: type2,
+            defaultValue: defaultValue2,
+            deprecationReason: inputValueIntrospection.deprecationReason,
+          };
+        }
+        function buildDirective(directiveIntrospection) {
+          if (!directiveIntrospection.args) {
+            const directiveIntrospectionStr = inspect$2(directiveIntrospection);
+            throw new Error(
+              `Introspection result missing directive args: ${directiveIntrospectionStr}.`
+            );
+          }
+          if (!directiveIntrospection.locations) {
+            const directiveIntrospectionStr = inspect$2(directiveIntrospection);
+            throw new Error(
+              `Introspection result missing directive locations: ${directiveIntrospectionStr}.`
+            );
+          }
+          return new GraphQLDirective({
+            name: directiveIntrospection.name,
+            description: directiveIntrospection.description,
+            isRepeatable: directiveIntrospection.isRepeatable,
+            locations: directiveIntrospection.locations.slice(),
+            args: buildInputValueDefMap(directiveIntrospection.args),
+          });
+        }
+      }
+      function extendSchema(schema, documentAST, options) {
+        assertSchema(schema);
+        (documentAST != null && documentAST.kind === Kind.DOCUMENT) ||
+          devAssert$1(false, "Must provide valid Document AST.");
+        if (
+          (options === null || options === void 0
+            ? void 0
+            : options.assumeValid) !== true &&
+          (options === null || options === void 0
+            ? void 0
+            : options.assumeValidSDL) !== true
+        ) {
+          assertValidSDLExtension(documentAST, schema);
+        }
+        const schemaConfig = schema.toConfig();
+        const extendedConfig = extendSchemaImpl(
+          schemaConfig,
+          documentAST,
+          options
+        );
+        return schemaConfig === extendedConfig
+          ? schema
+          : new GraphQLSchema(extendedConfig);
+      }
+      function extendSchemaImpl(schemaConfig, documentAST, options) {
+        var _schemaDef,
+          _schemaDef$descriptio,
+          _schemaDef2,
+          _options$assumeValid;
+        const typeDefs = [];
+        const typeExtensionsMap = /* @__PURE__ */ Object.create(null);
+        const directiveDefs = [];
+        let schemaDef;
+        const schemaExtensions = [];
+        for (const def of documentAST.definitions) {
+          if (def.kind === Kind.SCHEMA_DEFINITION) {
+            schemaDef = def;
+          } else if (def.kind === Kind.SCHEMA_EXTENSION) {
+            schemaExtensions.push(def);
+          } else if (isTypeDefinitionNode(def)) {
+            typeDefs.push(def);
+          } else if (isTypeExtensionNode(def)) {
+            const extendedTypeName = def.name.value;
+            const existingTypeExtensions = typeExtensionsMap[extendedTypeName];
+            typeExtensionsMap[extendedTypeName] = existingTypeExtensions
+              ? existingTypeExtensions.concat([def])
+              : [def];
+          } else if (def.kind === Kind.DIRECTIVE_DEFINITION) {
+            directiveDefs.push(def);
+          }
+        }
+        if (
+          Object.keys(typeExtensionsMap).length === 0 &&
+          typeDefs.length === 0 &&
+          directiveDefs.length === 0 &&
+          schemaExtensions.length === 0 &&
+          schemaDef == null
+        ) {
+          return schemaConfig;
+        }
+        const typeMap = /* @__PURE__ */ Object.create(null);
+        for (const existingType of schemaConfig.types) {
+          typeMap[existingType.name] = extendNamedType(existingType);
+        }
+        for (const typeNode of typeDefs) {
+          var _stdTypeMap$name;
+          const name2 = typeNode.name.value;
+          typeMap[name2] =
+            (_stdTypeMap$name = stdTypeMap[name2]) !== null &&
+            _stdTypeMap$name !== void 0
+              ? _stdTypeMap$name
+              : buildType(typeNode);
+        }
+        const operationTypes = __spreadValues(
+          __spreadValues(
+            {
+              query: schemaConfig.query && replaceNamedType(schemaConfig.query),
+              mutation:
+                schemaConfig.mutation &&
+                replaceNamedType(schemaConfig.mutation),
+              subscription:
+                schemaConfig.subscription &&
+                replaceNamedType(schemaConfig.subscription),
+            },
+            schemaDef && getOperationTypes([schemaDef])
+          ),
+          getOperationTypes(schemaExtensions)
+        );
+        return __spreadProps(
+          __spreadValues(
+            {
+              description:
+                (_schemaDef = schemaDef) === null || _schemaDef === void 0
+                  ? void 0
+                  : (_schemaDef$descriptio = _schemaDef.description) === null ||
+                    _schemaDef$descriptio === void 0
+                  ? void 0
+                  : _schemaDef$descriptio.value,
+            },
+            operationTypes
+          ),
+          {
+            types: Object.values(typeMap),
+            directives: [
+              ...schemaConfig.directives.map(replaceDirective),
+              ...directiveDefs.map(buildDirective),
+            ],
+            extensions: /* @__PURE__ */ Object.create(null),
+            astNode:
+              (_schemaDef2 = schemaDef) !== null && _schemaDef2 !== void 0
+                ? _schemaDef2
+                : schemaConfig.astNode,
+            extensionASTNodes:
+              schemaConfig.extensionASTNodes.concat(schemaExtensions),
+            assumeValid:
+              (_options$assumeValid =
+                options === null || options === void 0
+                  ? void 0
+                  : options.assumeValid) !== null &&
+              _options$assumeValid !== void 0
+                ? _options$assumeValid
+                : false,
+          }
+        );
+        function replaceType(type2) {
+          if (isListType(type2)) {
+            return new GraphQLList(replaceType(type2.ofType));
+          }
+          if (isNonNullType(type2)) {
+            return new GraphQLNonNull(replaceType(type2.ofType));
+          }
+          return replaceNamedType(type2);
+        }
+        function replaceNamedType(type2) {
+          return typeMap[type2.name];
+        }
+        function replaceDirective(directive) {
+          const config2 = directive.toConfig();
+          return new GraphQLDirective(
+            __spreadProps(__spreadValues({}, config2), {
+              args: mapValue(config2.args, extendArg),
+            })
+          );
+        }
+        function extendNamedType(type2) {
+          if (isIntrospectionType(type2) || isSpecifiedScalarType(type2)) {
+            return type2;
+          }
+          if (isScalarType(type2)) {
+            return extendScalarType(type2);
+          }
+          if (isObjectType(type2)) {
+            return extendObjectType(type2);
+          }
+          if (isInterfaceType(type2)) {
+            return extendInterfaceType(type2);
+          }
+          if (isUnionType(type2)) {
+            return extendUnionType(type2);
+          }
+          if (isEnumType(type2)) {
+            return extendEnumType(type2);
+          }
+          if (isInputObjectType(type2)) {
+            return extendInputObjectType(type2);
+          }
+          invariant$2(false, "Unexpected type: " + inspect$2(type2));
+        }
+        function extendInputObjectType(type2) {
+          var _typeExtensionsMap$co;
+          const config2 = type2.toConfig();
+          const extensions =
+            (_typeExtensionsMap$co = typeExtensionsMap[config2.name]) !==
+              null && _typeExtensionsMap$co !== void 0
+              ? _typeExtensionsMap$co
+              : [];
+          return new GraphQLInputObjectType(
+            __spreadProps(__spreadValues({}, config2), {
+              fields: () =>
+                __spreadValues(
+                  __spreadValues(
+                    {},
+                    mapValue(config2.fields, (field) =>
+                      __spreadProps(__spreadValues({}, field), {
+                        type: replaceType(field.type),
+                      })
+                    )
+                  ),
+                  buildInputFieldMap(extensions)
+                ),
+              extensionASTNodes: config2.extensionASTNodes.concat(extensions),
+            })
+          );
+        }
+        function extendEnumType(type2) {
+          var _typeExtensionsMap$ty;
+          const config2 = type2.toConfig();
+          const extensions =
+            (_typeExtensionsMap$ty = typeExtensionsMap[type2.name]) !== null &&
+            _typeExtensionsMap$ty !== void 0
+              ? _typeExtensionsMap$ty
+              : [];
+          return new GraphQLEnumType(
+            __spreadProps(__spreadValues({}, config2), {
+              values: __spreadValues(
+                __spreadValues({}, config2.values),
+                buildEnumValueMap(extensions)
+              ),
+              extensionASTNodes: config2.extensionASTNodes.concat(extensions),
+            })
+          );
+        }
+        function extendScalarType(type2) {
+          var _typeExtensionsMap$co2;
+          const config2 = type2.toConfig();
+          const extensions =
+            (_typeExtensionsMap$co2 = typeExtensionsMap[config2.name]) !==
+              null && _typeExtensionsMap$co2 !== void 0
+              ? _typeExtensionsMap$co2
+              : [];
+          let specifiedByURL = config2.specifiedByURL;
+          for (const extensionNode of extensions) {
+            var _getSpecifiedByURL;
+            specifiedByURL =
+              (_getSpecifiedByURL = getSpecifiedByURL(extensionNode)) !==
+                null && _getSpecifiedByURL !== void 0
+                ? _getSpecifiedByURL
+                : specifiedByURL;
+          }
+          return new GraphQLScalarType(
+            __spreadProps(__spreadValues({}, config2), {
+              specifiedByURL,
+              extensionASTNodes: config2.extensionASTNodes.concat(extensions),
+            })
+          );
+        }
+        function extendObjectType(type2) {
+          var _typeExtensionsMap$co3;
+          const config2 = type2.toConfig();
+          const extensions =
+            (_typeExtensionsMap$co3 = typeExtensionsMap[config2.name]) !==
+              null && _typeExtensionsMap$co3 !== void 0
+              ? _typeExtensionsMap$co3
+              : [];
+          return new GraphQLObjectType(
+            __spreadProps(__spreadValues({}, config2), {
+              interfaces: () => [
+                ...type2.getInterfaces().map(replaceNamedType),
+                ...buildInterfaces(extensions),
+              ],
+              fields: () =>
+                __spreadValues(
+                  __spreadValues({}, mapValue(config2.fields, extendField)),
+                  buildFieldMap(extensions)
+                ),
+              extensionASTNodes: config2.extensionASTNodes.concat(extensions),
+            })
+          );
+        }
+        function extendInterfaceType(type2) {
+          var _typeExtensionsMap$co4;
+          const config2 = type2.toConfig();
+          const extensions =
+            (_typeExtensionsMap$co4 = typeExtensionsMap[config2.name]) !==
+              null && _typeExtensionsMap$co4 !== void 0
+              ? _typeExtensionsMap$co4
+              : [];
+          return new GraphQLInterfaceType(
+            __spreadProps(__spreadValues({}, config2), {
+              interfaces: () => [
+                ...type2.getInterfaces().map(replaceNamedType),
+                ...buildInterfaces(extensions),
+              ],
+              fields: () =>
+                __spreadValues(
+                  __spreadValues({}, mapValue(config2.fields, extendField)),
+                  buildFieldMap(extensions)
+                ),
+              extensionASTNodes: config2.extensionASTNodes.concat(extensions),
+            })
+          );
+        }
+        function extendUnionType(type2) {
+          var _typeExtensionsMap$co5;
+          const config2 = type2.toConfig();
+          const extensions =
+            (_typeExtensionsMap$co5 = typeExtensionsMap[config2.name]) !==
+              null && _typeExtensionsMap$co5 !== void 0
+              ? _typeExtensionsMap$co5
+              : [];
+          return new GraphQLUnionType(
+            __spreadProps(__spreadValues({}, config2), {
+              types: () => [
+                ...type2.getTypes().map(replaceNamedType),
+                ...buildUnionTypes(extensions),
+              ],
+              extensionASTNodes: config2.extensionASTNodes.concat(extensions),
+            })
+          );
+        }
+        function extendField(field) {
+          return __spreadProps(__spreadValues({}, field), {
+            type: replaceType(field.type),
+            args: field.args && mapValue(field.args, extendArg),
+          });
+        }
+        function extendArg(arg) {
+          return __spreadProps(__spreadValues({}, arg), {
+            type: replaceType(arg.type),
+          });
+        }
+        function getOperationTypes(nodes) {
+          const opTypes = {};
+          for (const node of nodes) {
+            var _node$operationTypes;
+            const operationTypesNodes =
+              (_node$operationTypes = node.operationTypes) !== null &&
+              _node$operationTypes !== void 0
+                ? _node$operationTypes
+                : [];
+            for (const operationType of operationTypesNodes) {
+              opTypes[operationType.operation] = getNamedType2(
+                operationType.type
+              );
+            }
+          }
+          return opTypes;
+        }
+        function getNamedType2(node) {
+          var _stdTypeMap$name2;
+          const name2 = node.name.value;
+          const type2 =
+            (_stdTypeMap$name2 = stdTypeMap[name2]) !== null &&
+            _stdTypeMap$name2 !== void 0
+              ? _stdTypeMap$name2
+              : typeMap[name2];
+          if (type2 === void 0) {
+            throw new Error(`Unknown type: "${name2}".`);
+          }
+          return type2;
+        }
+        function getWrappedType(node) {
+          if (node.kind === Kind.LIST_TYPE) {
+            return new GraphQLList(getWrappedType(node.type));
+          }
+          if (node.kind === Kind.NON_NULL_TYPE) {
+            return new GraphQLNonNull(getWrappedType(node.type));
+          }
+          return getNamedType2(node);
+        }
+        function buildDirective(node) {
+          var _node$description;
+          return new GraphQLDirective({
+            name: node.name.value,
+            description:
+              (_node$description = node.description) === null ||
+              _node$description === void 0
+                ? void 0
+                : _node$description.value,
+            locations: node.locations.map(({ value }) => value),
+            isRepeatable: node.repeatable,
+            args: buildArgumentMap(node.arguments),
+            astNode: node,
+          });
+        }
+        function buildFieldMap(nodes) {
+          const fieldConfigMap = /* @__PURE__ */ Object.create(null);
+          for (const node of nodes) {
+            var _node$fields;
+            const nodeFields =
+              (_node$fields = node.fields) !== null && _node$fields !== void 0
+                ? _node$fields
+                : [];
+            for (const field of nodeFields) {
+              var _field$description;
+              fieldConfigMap[field.name.value] = {
+                type: getWrappedType(field.type),
+                description:
+                  (_field$description = field.description) === null ||
+                  _field$description === void 0
+                    ? void 0
+                    : _field$description.value,
+                args: buildArgumentMap(field.arguments),
+                deprecationReason: getDeprecationReason(field),
+                astNode: field,
+              };
+            }
+          }
+          return fieldConfigMap;
+        }
+        function buildArgumentMap(args) {
+          const argsNodes = args !== null && args !== void 0 ? args : [];
+          const argConfigMap = /* @__PURE__ */ Object.create(null);
+          for (const arg of argsNodes) {
+            var _arg$description;
+            const type2 = getWrappedType(arg.type);
+            argConfigMap[arg.name.value] = {
+              type: type2,
+              description:
+                (_arg$description = arg.description) === null ||
+                _arg$description === void 0
+                  ? void 0
+                  : _arg$description.value,
+              defaultValue: valueFromAST$1(arg.defaultValue, type2),
+              deprecationReason: getDeprecationReason(arg),
+              astNode: arg,
+            };
+          }
+          return argConfigMap;
+        }
+        function buildInputFieldMap(nodes) {
+          const inputFieldMap = /* @__PURE__ */ Object.create(null);
+          for (const node of nodes) {
+            var _node$fields2;
+            const fieldsNodes =
+              (_node$fields2 = node.fields) !== null && _node$fields2 !== void 0
+                ? _node$fields2
+                : [];
+            for (const field of fieldsNodes) {
+              var _field$description2;
+              const type2 = getWrappedType(field.type);
+              inputFieldMap[field.name.value] = {
+                type: type2,
+                description:
+                  (_field$description2 = field.description) === null ||
+                  _field$description2 === void 0
+                    ? void 0
+                    : _field$description2.value,
+                defaultValue: valueFromAST$1(field.defaultValue, type2),
+                deprecationReason: getDeprecationReason(field),
+                astNode: field,
+              };
+            }
+          }
+          return inputFieldMap;
+        }
+        function buildEnumValueMap(nodes) {
+          const enumValueMap = /* @__PURE__ */ Object.create(null);
+          for (const node of nodes) {
+            var _node$values;
+            const valuesNodes =
+              (_node$values = node.values) !== null && _node$values !== void 0
+                ? _node$values
+                : [];
+            for (const value of valuesNodes) {
+              var _value$description;
+              enumValueMap[value.name.value] = {
+                description:
+                  (_value$description = value.description) === null ||
+                  _value$description === void 0
+                    ? void 0
+                    : _value$description.value,
+                deprecationReason: getDeprecationReason(value),
+                astNode: value,
+              };
+            }
+          }
+          return enumValueMap;
+        }
+        function buildInterfaces(nodes) {
+          return nodes.flatMap((node) => {
+            var _node$interfaces$map, _node$interfaces;
+            return (_node$interfaces$map =
+              (_node$interfaces = node.interfaces) === null ||
+              _node$interfaces === void 0
+                ? void 0
+                : _node$interfaces.map(getNamedType2)) !== null &&
+              _node$interfaces$map !== void 0
+              ? _node$interfaces$map
+              : [];
+          });
+        }
+        function buildUnionTypes(nodes) {
+          return nodes.flatMap((node) => {
+            var _node$types$map, _node$types;
+            return (_node$types$map =
+              (_node$types = node.types) === null || _node$types === void 0
+                ? void 0
+                : _node$types.map(getNamedType2)) !== null &&
+              _node$types$map !== void 0
+              ? _node$types$map
+              : [];
+          });
+        }
+        function buildType(astNode) {
+          var _typeExtensionsMap$na;
+          const name2 = astNode.name.value;
+          const extensionASTNodes =
+            (_typeExtensionsMap$na = typeExtensionsMap[name2]) !== null &&
+            _typeExtensionsMap$na !== void 0
+              ? _typeExtensionsMap$na
+              : [];
+          switch (astNode.kind) {
+            case Kind.OBJECT_TYPE_DEFINITION: {
+              var _astNode$description;
+              const allNodes = [astNode, ...extensionASTNodes];
+              return new GraphQLObjectType({
+                name: name2,
+                description:
+                  (_astNode$description = astNode.description) === null ||
+                  _astNode$description === void 0
+                    ? void 0
+                    : _astNode$description.value,
+                interfaces: () => buildInterfaces(allNodes),
+                fields: () => buildFieldMap(allNodes),
+                astNode,
+                extensionASTNodes,
+              });
+            }
+            case Kind.INTERFACE_TYPE_DEFINITION: {
+              var _astNode$description2;
+              const allNodes = [astNode, ...extensionASTNodes];
+              return new GraphQLInterfaceType({
+                name: name2,
+                description:
+                  (_astNode$description2 = astNode.description) === null ||
+                  _astNode$description2 === void 0
+                    ? void 0
+                    : _astNode$description2.value,
+                interfaces: () => buildInterfaces(allNodes),
+                fields: () => buildFieldMap(allNodes),
+                astNode,
+                extensionASTNodes,
+              });
+            }
+            case Kind.ENUM_TYPE_DEFINITION: {
+              var _astNode$description3;
+              const allNodes = [astNode, ...extensionASTNodes];
+              return new GraphQLEnumType({
+                name: name2,
+                description:
+                  (_astNode$description3 = astNode.description) === null ||
+                  _astNode$description3 === void 0
+                    ? void 0
+                    : _astNode$description3.value,
+                values: buildEnumValueMap(allNodes),
+                astNode,
+                extensionASTNodes,
+              });
+            }
+            case Kind.UNION_TYPE_DEFINITION: {
+              var _astNode$description4;
+              const allNodes = [astNode, ...extensionASTNodes];
+              return new GraphQLUnionType({
+                name: name2,
+                description:
+                  (_astNode$description4 = astNode.description) === null ||
+                  _astNode$description4 === void 0
+                    ? void 0
+                    : _astNode$description4.value,
+                types: () => buildUnionTypes(allNodes),
+                astNode,
+                extensionASTNodes,
+              });
+            }
+            case Kind.SCALAR_TYPE_DEFINITION: {
+              var _astNode$description5;
+              return new GraphQLScalarType({
+                name: name2,
+                description:
+                  (_astNode$description5 = astNode.description) === null ||
+                  _astNode$description5 === void 0
+                    ? void 0
+                    : _astNode$description5.value,
+                specifiedByURL: getSpecifiedByURL(astNode),
+                astNode,
+                extensionASTNodes,
+              });
+            }
+            case Kind.INPUT_OBJECT_TYPE_DEFINITION: {
+              var _astNode$description6;
+              const allNodes = [astNode, ...extensionASTNodes];
+              return new GraphQLInputObjectType({
+                name: name2,
+                description:
+                  (_astNode$description6 = astNode.description) === null ||
+                  _astNode$description6 === void 0
+                    ? void 0
+                    : _astNode$description6.value,
+                fields: () => buildInputFieldMap(allNodes),
+                astNode,
+                extensionASTNodes,
+              });
+            }
+          }
+        }
+      }
+      const stdTypeMap = keyMap$1(
+        [...specifiedScalarTypes, ...introspectionTypes$1],
+        (type2) => type2.name
+      );
+      function getDeprecationReason(node) {
+        const deprecated = getDirectiveValues$1(
+          GraphQLDeprecatedDirective,
+          node
+        );
+        return deprecated === null || deprecated === void 0
+          ? void 0
+          : deprecated.reason;
+      }
+      function getSpecifiedByURL(node) {
+        const specifiedBy = getDirectiveValues$1(
+          GraphQLSpecifiedByDirective,
+          node
+        );
+        return specifiedBy === null || specifiedBy === void 0
+          ? void 0
+          : specifiedBy.url;
+      }
+      function buildASTSchema(documentAST, options) {
+        (documentAST != null && documentAST.kind === Kind.DOCUMENT) ||
+          devAssert$1(false, "Must provide valid Document AST.");
+        if (
+          (options === null || options === void 0
+            ? void 0
+            : options.assumeValid) !== true &&
+          (options === null || options === void 0
+            ? void 0
+            : options.assumeValidSDL) !== true
+        ) {
+          assertValidSDL(documentAST);
+        }
+        const emptySchemaConfig = {
+          description: void 0,
+          types: [],
+          directives: [],
+          extensions: /* @__PURE__ */ Object.create(null),
+          extensionASTNodes: [],
+          assumeValid: false,
+        };
+        const config2 = extendSchemaImpl(
+          emptySchemaConfig,
+          documentAST,
+          options
+        );
+        if (config2.astNode == null) {
+          for (const type2 of config2.types) {
+            switch (type2.name) {
+              case "Query":
+                config2.query = type2;
+                break;
+              case "Mutation":
+                config2.mutation = type2;
+                break;
+              case "Subscription":
+                config2.subscription = type2;
+                break;
+            }
+          }
+        }
+        const directives = [
+          ...config2.directives,
+          ...specifiedDirectives.filter((stdDirective) =>
+            config2.directives.every(
+              (directive) => directive.name !== stdDirective.name
+            )
+          ),
+        ];
+        return new GraphQLSchema(
+          __spreadProps(__spreadValues({}, config2), { directives })
+        );
+      }
+      function buildSchema(source, options) {
+        const document2 = parse$1(source, {
+          noLocation:
+            options === null || options === void 0
+              ? void 0
+              : options.noLocation,
+          allowLegacyFragmentVariables:
+            options === null || options === void 0
+              ? void 0
+              : options.allowLegacyFragmentVariables,
+        });
+        return buildASTSchema(document2, {
+          assumeValidSDL:
+            options === null || options === void 0
+              ? void 0
+              : options.assumeValidSDL,
+          assumeValid:
+            options === null || options === void 0
+              ? void 0
+              : options.assumeValid,
+        });
+      }
+      function lexicographicSortSchema(schema) {
+        const schemaConfig = schema.toConfig();
+        const typeMap = keyValMap(
+          sortByName(schemaConfig.types),
+          (type2) => type2.name,
+          sortNamedType
+        );
+        return new GraphQLSchema(
+          __spreadProps(__spreadValues({}, schemaConfig), {
+            types: Object.values(typeMap),
+            directives: sortByName(schemaConfig.directives).map(sortDirective),
+            query: replaceMaybeType(schemaConfig.query),
+            mutation: replaceMaybeType(schemaConfig.mutation),
+            subscription: replaceMaybeType(schemaConfig.subscription),
+          })
+        );
+        function replaceType(type2) {
+          if (isListType(type2)) {
+            return new GraphQLList(replaceType(type2.ofType));
+          } else if (isNonNullType(type2)) {
+            return new GraphQLNonNull(replaceType(type2.ofType));
+          }
+          return replaceNamedType(type2);
+        }
+        function replaceNamedType(type2) {
+          return typeMap[type2.name];
+        }
+        function replaceMaybeType(maybeType) {
+          return maybeType && replaceNamedType(maybeType);
+        }
+        function sortDirective(directive) {
+          const config2 = directive.toConfig();
+          return new GraphQLDirective(
+            __spreadProps(__spreadValues({}, config2), {
+              locations: sortBy(config2.locations, (x2) => x2),
+              args: sortArgs(config2.args),
+            })
+          );
+        }
+        function sortArgs(args) {
+          return sortObjMap(args, (arg) =>
+            __spreadProps(__spreadValues({}, arg), {
+              type: replaceType(arg.type),
+            })
+          );
+        }
+        function sortFields2(fieldsMap) {
+          return sortObjMap(fieldsMap, (field) =>
+            __spreadProps(__spreadValues({}, field), {
+              type: replaceType(field.type),
+              args: field.args && sortArgs(field.args),
+            })
+          );
+        }
+        function sortInputFields(fieldsMap) {
+          return sortObjMap(fieldsMap, (field) =>
+            __spreadProps(__spreadValues({}, field), {
+              type: replaceType(field.type),
+            })
+          );
+        }
+        function sortTypes(array) {
+          return sortByName(array).map(replaceNamedType);
+        }
+        function sortNamedType(type2) {
+          if (isScalarType(type2) || isIntrospectionType(type2)) {
+            return type2;
+          }
+          if (isObjectType(type2)) {
+            const config2 = type2.toConfig();
+            return new GraphQLObjectType(
+              __spreadProps(__spreadValues({}, config2), {
+                interfaces: () => sortTypes(config2.interfaces),
+                fields: () => sortFields2(config2.fields),
+              })
+            );
+          }
+          if (isInterfaceType(type2)) {
+            const config2 = type2.toConfig();
+            return new GraphQLInterfaceType(
+              __spreadProps(__spreadValues({}, config2), {
+                interfaces: () => sortTypes(config2.interfaces),
+                fields: () => sortFields2(config2.fields),
+              })
+            );
+          }
+          if (isUnionType(type2)) {
+            const config2 = type2.toConfig();
+            return new GraphQLUnionType(
+              __spreadProps(__spreadValues({}, config2), {
+                types: () => sortTypes(config2.types),
+              })
+            );
+          }
+          if (isEnumType(type2)) {
+            const config2 = type2.toConfig();
+            return new GraphQLEnumType(
+              __spreadProps(__spreadValues({}, config2), {
+                values: sortObjMap(config2.values, (value) => value),
+              })
+            );
+          }
+          if (isInputObjectType(type2)) {
+            const config2 = type2.toConfig();
+            return new GraphQLInputObjectType(
+              __spreadProps(__spreadValues({}, config2), {
+                fields: () => sortInputFields(config2.fields),
+              })
+            );
+          }
+          invariant$2(false, "Unexpected type: " + inspect$2(type2));
+        }
+      }
+      function sortObjMap(map2, sortValueFn) {
+        const sortedMap = /* @__PURE__ */ Object.create(null);
+        for (const key of Object.keys(map2).sort(naturalCompare$1)) {
+          sortedMap[key] = sortValueFn(map2[key]);
+        }
+        return sortedMap;
+      }
+      function sortByName(array) {
+        return sortBy(array, (obj) => obj.name);
+      }
+      function sortBy(array, mapToKey) {
+        return array.slice().sort((obj1, obj2) => {
+          const key1 = mapToKey(obj1);
+          const key2 = mapToKey(obj2);
+          return naturalCompare$1(key1, key2);
+        });
+      }
+      function printSchema(schema) {
+        return printFilteredSchema(
+          schema,
+          (n2) => !isSpecifiedDirective(n2),
+          isDefinedType
+        );
+      }
+      function printIntrospectionSchema(schema) {
+        return printFilteredSchema(
+          schema,
+          isSpecifiedDirective,
+          isIntrospectionType
+        );
+      }
+      function isDefinedType(type2) {
+        return !isSpecifiedScalarType(type2) && !isIntrospectionType(type2);
+      }
+      function printFilteredSchema(schema, directiveFilter, typeFilter) {
+        const directives = schema.getDirectives().filter(directiveFilter);
+        const types = Object.values(schema.getTypeMap()).filter(typeFilter);
+        return [
+          printSchemaDefinition(schema),
+          ...directives.map((directive) => printDirective(directive)),
+          ...types.map((type2) => printType(type2)),
+        ]
+          .filter(Boolean)
+          .join("\n\n");
+      }
+      function printSchemaDefinition(schema) {
+        if (schema.description == null && isSchemaOfCommonNames(schema)) {
+          return;
+        }
+        const operationTypes = [];
+        const queryType = schema.getQueryType();
+        if (queryType) {
+          operationTypes.push(`  query: ${queryType.name}`);
+        }
+        const mutationType = schema.getMutationType();
+        if (mutationType) {
+          operationTypes.push(`  mutation: ${mutationType.name}`);
+        }
+        const subscriptionType = schema.getSubscriptionType();
+        if (subscriptionType) {
+          operationTypes.push(`  subscription: ${subscriptionType.name}`);
+        }
+        return (
+          printDescription(schema) +
+          `schema {
+${operationTypes.join("\n")}
+}`
+        );
+      }
+      function isSchemaOfCommonNames(schema) {
+        const queryType = schema.getQueryType();
+        if (queryType && queryType.name !== "Query") {
+          return false;
+        }
+        const mutationType = schema.getMutationType();
+        if (mutationType && mutationType.name !== "Mutation") {
+          return false;
+        }
+        const subscriptionType = schema.getSubscriptionType();
+        if (subscriptionType && subscriptionType.name !== "Subscription") {
+          return false;
+        }
+        return true;
+      }
+      function printType(type2) {
+        if (isScalarType(type2)) {
+          return printScalar(type2);
+        }
+        if (isObjectType(type2)) {
+          return printObject(type2);
+        }
+        if (isInterfaceType(type2)) {
+          return printInterface(type2);
+        }
+        if (isUnionType(type2)) {
+          return printUnion(type2);
+        }
+        if (isEnumType(type2)) {
+          return printEnum(type2);
+        }
+        if (isInputObjectType(type2)) {
+          return printInputObject(type2);
+        }
+        invariant$2(false, "Unexpected type: " + inspect$2(type2));
+      }
+      function printScalar(type2) {
+        return (
+          printDescription(type2) +
+          `scalar ${type2.name}` +
+          printSpecifiedByURL(type2)
+        );
+      }
+      function printImplementedInterfaces(type2) {
+        const interfaces = type2.getInterfaces();
+        return interfaces.length
+          ? " implements " + interfaces.map((i) => i.name).join(" & ")
+          : "";
+      }
+      function printObject(type2) {
+        return (
+          printDescription(type2) +
+          `type ${type2.name}` +
+          printImplementedInterfaces(type2) +
+          printFields(type2)
+        );
+      }
+      function printInterface(type2) {
+        return (
+          printDescription(type2) +
+          `interface ${type2.name}` +
+          printImplementedInterfaces(type2) +
+          printFields(type2)
+        );
+      }
+      function printUnion(type2) {
+        const types = type2.getTypes();
+        const possibleTypes = types.length ? " = " + types.join(" | ") : "";
+        return printDescription(type2) + "union " + type2.name + possibleTypes;
+      }
+      function printEnum(type2) {
+        const values = type2
+          .getValues()
+          .map(
+            (value, i) =>
+              printDescription(value, "  ", !i) +
+              "  " +
+              value.name +
+              printDeprecated(value.deprecationReason)
+          );
+        return (
+          printDescription(type2) + `enum ${type2.name}` + printBlock(values)
+        );
+      }
+      function printInputObject(type2) {
+        const fields = Object.values(type2.getFields()).map(
+          (f, i) => printDescription(f, "  ", !i) + "  " + printInputValue(f)
+        );
+        return (
+          printDescription(type2) + `input ${type2.name}` + printBlock(fields)
+        );
+      }
+      function printFields(type2) {
+        const fields = Object.values(type2.getFields()).map(
+          (f, i) =>
+            printDescription(f, "  ", !i) +
+            "  " +
+            f.name +
+            printArgs(f.args, "  ") +
+            ": " +
+            String(f.type) +
+            printDeprecated(f.deprecationReason)
+        );
+        return printBlock(fields);
+      }
+      function printBlock(items) {
+        return items.length !== 0 ? " {\n" + items.join("\n") + "\n}" : "";
+      }
+      function printArgs(args, indentation = "") {
+        if (args.length === 0) {
+          return "";
+        }
+        if (args.every((arg) => !arg.description)) {
+          return "(" + args.map(printInputValue).join(", ") + ")";
+        }
+        return (
+          "(\n" +
+          args
+            .map(
+              (arg, i) =>
+                printDescription(arg, "  " + indentation, !i) +
+                "  " +
+                indentation +
+                printInputValue(arg)
+            )
+            .join("\n") +
+          "\n" +
+          indentation +
+          ")"
+        );
+      }
+      function printInputValue(arg) {
+        const defaultAST = astFromValue(arg.defaultValue, arg.type);
+        let argDecl = arg.name + ": " + String(arg.type);
+        if (defaultAST) {
+          argDecl += ` = ${print(defaultAST)}`;
+        }
+        return argDecl + printDeprecated(arg.deprecationReason);
+      }
+      function printDirective(directive) {
+        return (
+          printDescription(directive) +
+          "directive @" +
+          directive.name +
+          printArgs(directive.args) +
+          (directive.isRepeatable ? " repeatable" : "") +
+          " on " +
+          directive.locations.join(" | ")
+        );
+      }
+      function printDeprecated(reason) {
+        if (reason == null) {
+          return "";
+        }
+        if (reason !== DEFAULT_DEPRECATION_REASON) {
+          const astValue = print({
+            kind: Kind.STRING,
+            value: reason,
+          });
+          return ` @deprecated(reason: ${astValue})`;
+        }
+        return " @deprecated";
+      }
+      function printSpecifiedByURL(scalar) {
+        if (scalar.specifiedByURL == null) {
+          return "";
+        }
+        const astValue = print({
+          kind: Kind.STRING,
+          value: scalar.specifiedByURL,
+        });
+        return ` @specifiedBy(url: ${astValue})`;
+      }
+      function printDescription(def, indentation = "", firstInBlock = true) {
+        const { description } = def;
+        if (description == null) {
+          return "";
+        }
+        const blockString = print({
+          kind: Kind.STRING,
+          value: description,
+          block: isPrintableAsBlockString(description),
+        });
+        const prefix =
+          indentation && !firstInBlock ? "\n" + indentation : indentation;
+        return prefix + blockString.replace(/\n/g, "\n" + indentation) + "\n";
+      }
+      function concatAST(documents) {
+        const definitions = [];
+        for (const doc of documents) {
+          definitions.push(...doc.definitions);
+        }
+        return {
+          kind: Kind.DOCUMENT,
+          definitions,
+        };
+      }
+      function separateOperations(documentAST) {
+        const operations = [];
+        const depGraph = /* @__PURE__ */ Object.create(null);
+        for (const definitionNode of documentAST.definitions) {
+          switch (definitionNode.kind) {
+            case Kind.OPERATION_DEFINITION:
+              operations.push(definitionNode);
+              break;
+            case Kind.FRAGMENT_DEFINITION:
+              depGraph[definitionNode.name.value] = collectDependencies(
+                definitionNode.selectionSet
+              );
+              break;
+          }
+        }
+        const separatedDocumentASTs = /* @__PURE__ */ Object.create(null);
+        for (const operation of operations) {
+          const dependencies = /* @__PURE__ */ new Set();
+          for (const fragmentName of collectDependencies(
+            operation.selectionSet
+          )) {
+            collectTransitiveDependencies(dependencies, depGraph, fragmentName);
+          }
+          const operationName = operation.name ? operation.name.value : "";
+          separatedDocumentASTs[operationName] = {
+            kind: Kind.DOCUMENT,
+            definitions: documentAST.definitions.filter(
+              (node) =>
+                node === operation ||
+                (node.kind === Kind.FRAGMENT_DEFINITION &&
+                  dependencies.has(node.name.value))
+            ),
+          };
+        }
+        return separatedDocumentASTs;
+      }
+      function collectTransitiveDependencies(collected, depGraph, fromName) {
+        if (!collected.has(fromName)) {
+          collected.add(fromName);
+          const immediateDeps = depGraph[fromName];
+          if (immediateDeps !== void 0) {
+            for (const toName of immediateDeps) {
+              collectTransitiveDependencies(collected, depGraph, toName);
+            }
+          }
+        }
+      }
+      function collectDependencies(selectionSet) {
+        const dependencies = [];
+        visit(selectionSet, {
+          FragmentSpread(node) {
+            dependencies.push(node.name.value);
+          },
+        });
+        return dependencies;
+      }
+      function stripIgnoredCharacters(source) {
+        const sourceObj = isSource(source) ? source : new Source(source);
+        const body = sourceObj.body;
+        const lexer = new Lexer(sourceObj);
+        let strippedBody = "";
+        let wasLastAddedTokenNonPunctuator = false;
+        while (lexer.advance().kind !== TokenKind.EOF) {
+          const currentToken = lexer.token;
+          const tokenKind = currentToken.kind;
+          const isNonPunctuator = !isPunctuatorTokenKind(currentToken.kind);
+          if (wasLastAddedTokenNonPunctuator) {
+            if (isNonPunctuator || currentToken.kind === TokenKind.SPREAD) {
+              strippedBody += " ";
+            }
+          }
+          const tokenBody = body.slice(currentToken.start, currentToken.end);
+          if (tokenKind === TokenKind.BLOCK_STRING) {
+            strippedBody += printBlockString$1(currentToken.value, {
+              minimize: true,
+            });
+          } else {
+            strippedBody += tokenBody;
+          }
+          wasLastAddedTokenNonPunctuator = isNonPunctuator;
+        }
+        return strippedBody;
+      }
+      function assertValidName(name2) {
+        const error2 = isValidNameError(name2);
+        if (error2) {
+          throw error2;
+        }
+        return name2;
+      }
+      function isValidNameError(name2) {
+        typeof name2 === "string" ||
+          devAssert$1(false, "Expected name to be a string.");
+        if (name2.startsWith("__")) {
+          return new GraphQLError(
+            `Name "${name2}" must not begin with "__", which is reserved by GraphQL introspection.`
+          );
+        }
+        try {
+          assertName(name2);
+        } catch (error2) {
+          return error2;
+        }
+      }
+      let BreakingChangeType;
+      (function (BreakingChangeType2) {
+        BreakingChangeType2["TYPE_REMOVED"] = "TYPE_REMOVED";
+        BreakingChangeType2["TYPE_CHANGED_KIND"] = "TYPE_CHANGED_KIND";
+        BreakingChangeType2["TYPE_REMOVED_FROM_UNION"] =
+          "TYPE_REMOVED_FROM_UNION";
+        BreakingChangeType2["VALUE_REMOVED_FROM_ENUM"] =
+          "VALUE_REMOVED_FROM_ENUM";
+        BreakingChangeType2["REQUIRED_INPUT_FIELD_ADDED"] =
+          "REQUIRED_INPUT_FIELD_ADDED";
+        BreakingChangeType2["IMPLEMENTED_INTERFACE_REMOVED"] =
+          "IMPLEMENTED_INTERFACE_REMOVED";
+        BreakingChangeType2["FIELD_REMOVED"] = "FIELD_REMOVED";
+        BreakingChangeType2["FIELD_CHANGED_KIND"] = "FIELD_CHANGED_KIND";
+        BreakingChangeType2["REQUIRED_ARG_ADDED"] = "REQUIRED_ARG_ADDED";
+        BreakingChangeType2["ARG_REMOVED"] = "ARG_REMOVED";
+        BreakingChangeType2["ARG_CHANGED_KIND"] = "ARG_CHANGED_KIND";
+        BreakingChangeType2["DIRECTIVE_REMOVED"] = "DIRECTIVE_REMOVED";
+        BreakingChangeType2["DIRECTIVE_ARG_REMOVED"] = "DIRECTIVE_ARG_REMOVED";
+        BreakingChangeType2["REQUIRED_DIRECTIVE_ARG_ADDED"] =
+          "REQUIRED_DIRECTIVE_ARG_ADDED";
+        BreakingChangeType2["DIRECTIVE_REPEATABLE_REMOVED"] =
+          "DIRECTIVE_REPEATABLE_REMOVED";
+        BreakingChangeType2["DIRECTIVE_LOCATION_REMOVED"] =
+          "DIRECTIVE_LOCATION_REMOVED";
+      })(BreakingChangeType || (BreakingChangeType = {}));
+      let DangerousChangeType;
+      (function (DangerousChangeType2) {
+        DangerousChangeType2["VALUE_ADDED_TO_ENUM"] = "VALUE_ADDED_TO_ENUM";
+        DangerousChangeType2["TYPE_ADDED_TO_UNION"] = "TYPE_ADDED_TO_UNION";
+        DangerousChangeType2["OPTIONAL_INPUT_FIELD_ADDED"] =
+          "OPTIONAL_INPUT_FIELD_ADDED";
+        DangerousChangeType2["OPTIONAL_ARG_ADDED"] = "OPTIONAL_ARG_ADDED";
+        DangerousChangeType2["IMPLEMENTED_INTERFACE_ADDED"] =
+          "IMPLEMENTED_INTERFACE_ADDED";
+        DangerousChangeType2["ARG_DEFAULT_VALUE_CHANGE"] =
+          "ARG_DEFAULT_VALUE_CHANGE";
+      })(DangerousChangeType || (DangerousChangeType = {}));
+      function findBreakingChanges(oldSchema, newSchema) {
+        return findSchemaChanges(oldSchema, newSchema).filter(
+          (change) => change.type in BreakingChangeType
+        );
+      }
+      function findDangerousChanges(oldSchema, newSchema) {
+        return findSchemaChanges(oldSchema, newSchema).filter(
+          (change) => change.type in DangerousChangeType
+        );
+      }
+      function findSchemaChanges(oldSchema, newSchema) {
+        return [
+          ...findTypeChanges(oldSchema, newSchema),
+          ...findDirectiveChanges(oldSchema, newSchema),
+        ];
+      }
+      function findDirectiveChanges(oldSchema, newSchema) {
+        const schemaChanges = [];
+        const directivesDiff = diff(
+          oldSchema.getDirectives(),
+          newSchema.getDirectives()
+        );
+        for (const oldDirective of directivesDiff.removed) {
+          schemaChanges.push({
+            type: BreakingChangeType.DIRECTIVE_REMOVED,
+            description: `${oldDirective.name} was removed.`,
+          });
+        }
+        for (const [oldDirective, newDirective] of directivesDiff.persisted) {
+          const argsDiff = diff(oldDirective.args, newDirective.args);
+          for (const newArg of argsDiff.added) {
+            if (isRequiredArgument$1(newArg)) {
+              schemaChanges.push({
+                type: BreakingChangeType.REQUIRED_DIRECTIVE_ARG_ADDED,
+                description: `A required arg ${newArg.name} on directive ${oldDirective.name} was added.`,
+              });
+            }
+          }
+          for (const oldArg of argsDiff.removed) {
+            schemaChanges.push({
+              type: BreakingChangeType.DIRECTIVE_ARG_REMOVED,
+              description: `${oldArg.name} was removed from ${oldDirective.name}.`,
+            });
+          }
+          if (oldDirective.isRepeatable && !newDirective.isRepeatable) {
+            schemaChanges.push({
+              type: BreakingChangeType.DIRECTIVE_REPEATABLE_REMOVED,
+              description: `Repeatable flag was removed from ${oldDirective.name}.`,
+            });
+          }
+          for (const location2 of oldDirective.locations) {
+            if (!newDirective.locations.includes(location2)) {
+              schemaChanges.push({
+                type: BreakingChangeType.DIRECTIVE_LOCATION_REMOVED,
+                description: `${location2} was removed from ${oldDirective.name}.`,
+              });
+            }
+          }
+        }
+        return schemaChanges;
+      }
+      function findTypeChanges(oldSchema, newSchema) {
+        const schemaChanges = [];
+        const typesDiff = diff(
+          Object.values(oldSchema.getTypeMap()),
+          Object.values(newSchema.getTypeMap())
+        );
+        for (const oldType of typesDiff.removed) {
+          schemaChanges.push({
+            type: BreakingChangeType.TYPE_REMOVED,
+            description: isSpecifiedScalarType(oldType)
+              ? `Standard scalar ${oldType.name} was removed because it is not referenced anymore.`
+              : `${oldType.name} was removed.`,
+          });
+        }
+        for (const [oldType, newType] of typesDiff.persisted) {
+          if (isEnumType(oldType) && isEnumType(newType)) {
+            schemaChanges.push(...findEnumTypeChanges(oldType, newType));
+          } else if (isUnionType(oldType) && isUnionType(newType)) {
+            schemaChanges.push(...findUnionTypeChanges(oldType, newType));
+          } else if (isInputObjectType(oldType) && isInputObjectType(newType)) {
+            schemaChanges.push(...findInputObjectTypeChanges(oldType, newType));
+          } else if (isObjectType(oldType) && isObjectType(newType)) {
+            schemaChanges.push(
+              ...findFieldChanges(oldType, newType),
+              ...findImplementedInterfacesChanges(oldType, newType)
+            );
+          } else if (isInterfaceType(oldType) && isInterfaceType(newType)) {
+            schemaChanges.push(
+              ...findFieldChanges(oldType, newType),
+              ...findImplementedInterfacesChanges(oldType, newType)
+            );
+          } else if (oldType.constructor !== newType.constructor) {
+            schemaChanges.push({
+              type: BreakingChangeType.TYPE_CHANGED_KIND,
+              description: `${oldType.name} changed from ${typeKindName(
+                oldType
+              )} to ${typeKindName(newType)}.`,
+            });
+          }
+        }
+        return schemaChanges;
+      }
+      function findInputObjectTypeChanges(oldType, newType) {
+        const schemaChanges = [];
+        const fieldsDiff = diff(
+          Object.values(oldType.getFields()),
+          Object.values(newType.getFields())
+        );
+        for (const newField of fieldsDiff.added) {
+          if (isRequiredInputField(newField)) {
+            schemaChanges.push({
+              type: BreakingChangeType.REQUIRED_INPUT_FIELD_ADDED,
+              description: `A required field ${newField.name} on input type ${oldType.name} was added.`,
+            });
+          } else {
+            schemaChanges.push({
+              type: DangerousChangeType.OPTIONAL_INPUT_FIELD_ADDED,
+              description: `An optional field ${newField.name} on input type ${oldType.name} was added.`,
+            });
+          }
+        }
+        for (const oldField of fieldsDiff.removed) {
+          schemaChanges.push({
+            type: BreakingChangeType.FIELD_REMOVED,
+            description: `${oldType.name}.${oldField.name} was removed.`,
+          });
+        }
+        for (const [oldField, newField] of fieldsDiff.persisted) {
+          const isSafe = isChangeSafeForInputObjectFieldOrFieldArg(
+            oldField.type,
+            newField.type
+          );
+          if (!isSafe) {
+            schemaChanges.push({
+              type: BreakingChangeType.FIELD_CHANGED_KIND,
+              description: `${oldType.name}.${
+                oldField.name
+              } changed type from ${String(oldField.type)} to ${String(
+                newField.type
+              )}.`,
+            });
+          }
+        }
+        return schemaChanges;
+      }
+      function findUnionTypeChanges(oldType, newType) {
+        const schemaChanges = [];
+        const possibleTypesDiff = diff(oldType.getTypes(), newType.getTypes());
+        for (const newPossibleType of possibleTypesDiff.added) {
+          schemaChanges.push({
+            type: DangerousChangeType.TYPE_ADDED_TO_UNION,
+            description: `${newPossibleType.name} was added to union type ${oldType.name}.`,
+          });
+        }
+        for (const oldPossibleType of possibleTypesDiff.removed) {
+          schemaChanges.push({
+            type: BreakingChangeType.TYPE_REMOVED_FROM_UNION,
+            description: `${oldPossibleType.name} was removed from union type ${oldType.name}.`,
+          });
+        }
+        return schemaChanges;
+      }
+      function findEnumTypeChanges(oldType, newType) {
+        const schemaChanges = [];
+        const valuesDiff = diff(oldType.getValues(), newType.getValues());
+        for (const newValue of valuesDiff.added) {
+          schemaChanges.push({
+            type: DangerousChangeType.VALUE_ADDED_TO_ENUM,
+            description: `${newValue.name} was added to enum type ${oldType.name}.`,
+          });
+        }
+        for (const oldValue of valuesDiff.removed) {
+          schemaChanges.push({
+            type: BreakingChangeType.VALUE_REMOVED_FROM_ENUM,
+            description: `${oldValue.name} was removed from enum type ${oldType.name}.`,
+          });
+        }
+        return schemaChanges;
+      }
+      function findImplementedInterfacesChanges(oldType, newType) {
+        const schemaChanges = [];
+        const interfacesDiff = diff(
+          oldType.getInterfaces(),
+          newType.getInterfaces()
+        );
+        for (const newInterface of interfacesDiff.added) {
+          schemaChanges.push({
+            type: DangerousChangeType.IMPLEMENTED_INTERFACE_ADDED,
+            description: `${newInterface.name} added to interfaces implemented by ${oldType.name}.`,
+          });
+        }
+        for (const oldInterface of interfacesDiff.removed) {
+          schemaChanges.push({
+            type: BreakingChangeType.IMPLEMENTED_INTERFACE_REMOVED,
+            description: `${oldType.name} no longer implements interface ${oldInterface.name}.`,
+          });
+        }
+        return schemaChanges;
+      }
+      function findFieldChanges(oldType, newType) {
+        const schemaChanges = [];
+        const fieldsDiff = diff(
+          Object.values(oldType.getFields()),
+          Object.values(newType.getFields())
+        );
+        for (const oldField of fieldsDiff.removed) {
+          schemaChanges.push({
+            type: BreakingChangeType.FIELD_REMOVED,
+            description: `${oldType.name}.${oldField.name} was removed.`,
+          });
+        }
+        for (const [oldField, newField] of fieldsDiff.persisted) {
+          schemaChanges.push(...findArgChanges(oldType, oldField, newField));
+          const isSafe = isChangeSafeForObjectOrInterfaceField(
+            oldField.type,
+            newField.type
+          );
+          if (!isSafe) {
+            schemaChanges.push({
+              type: BreakingChangeType.FIELD_CHANGED_KIND,
+              description: `${oldType.name}.${
+                oldField.name
+              } changed type from ${String(oldField.type)} to ${String(
+                newField.type
+              )}.`,
+            });
+          }
+        }
+        return schemaChanges;
+      }
+      function findArgChanges(oldType, oldField, newField) {
+        const schemaChanges = [];
+        const argsDiff = diff(oldField.args, newField.args);
+        for (const oldArg of argsDiff.removed) {
+          schemaChanges.push({
+            type: BreakingChangeType.ARG_REMOVED,
+            description: `${oldType.name}.${oldField.name} arg ${oldArg.name} was removed.`,
+          });
+        }
+        for (const [oldArg, newArg] of argsDiff.persisted) {
+          const isSafe = isChangeSafeForInputObjectFieldOrFieldArg(
+            oldArg.type,
+            newArg.type
+          );
+          if (!isSafe) {
+            schemaChanges.push({
+              type: BreakingChangeType.ARG_CHANGED_KIND,
+              description: `${oldType.name}.${oldField.name} arg ${
+                oldArg.name
+              } has changed type from ${String(oldArg.type)} to ${String(
+                newArg.type
+              )}.`,
+            });
+          } else if (oldArg.defaultValue !== void 0) {
+            if (newArg.defaultValue === void 0) {
+              schemaChanges.push({
+                type: DangerousChangeType.ARG_DEFAULT_VALUE_CHANGE,
+                description: `${oldType.name}.${oldField.name} arg ${oldArg.name} defaultValue was removed.`,
+              });
+            } else {
+              const oldValueStr = stringifyValue(
+                oldArg.defaultValue,
+                oldArg.type
+              );
+              const newValueStr = stringifyValue(
+                newArg.defaultValue,
+                newArg.type
+              );
+              if (oldValueStr !== newValueStr) {
+                schemaChanges.push({
+                  type: DangerousChangeType.ARG_DEFAULT_VALUE_CHANGE,
+                  description: `${oldType.name}.${oldField.name} arg ${oldArg.name} has changed defaultValue from ${oldValueStr} to ${newValueStr}.`,
+                });
+              }
+            }
+          }
+        }
+        for (const newArg of argsDiff.added) {
+          if (isRequiredArgument$1(newArg)) {
+            schemaChanges.push({
+              type: BreakingChangeType.REQUIRED_ARG_ADDED,
+              description: `A required arg ${newArg.name} on ${oldType.name}.${oldField.name} was added.`,
+            });
+          } else {
+            schemaChanges.push({
+              type: DangerousChangeType.OPTIONAL_ARG_ADDED,
+              description: `An optional arg ${newArg.name} on ${oldType.name}.${oldField.name} was added.`,
+            });
+          }
+        }
+        return schemaChanges;
+      }
+      function isChangeSafeForObjectOrInterfaceField(oldType, newType) {
+        if (isListType(oldType)) {
+          return (
+            (isListType(newType) &&
+              isChangeSafeForObjectOrInterfaceField(
+                oldType.ofType,
+                newType.ofType
+              )) ||
+            (isNonNullType(newType) &&
+              isChangeSafeForObjectOrInterfaceField(oldType, newType.ofType))
+          );
+        }
+        if (isNonNullType(oldType)) {
+          return (
+            isNonNullType(newType) &&
+            isChangeSafeForObjectOrInterfaceField(
+              oldType.ofType,
+              newType.ofType
+            )
+          );
+        }
+        return (
+          (isNamedType(newType) && oldType.name === newType.name) ||
+          (isNonNullType(newType) &&
+            isChangeSafeForObjectOrInterfaceField(oldType, newType.ofType))
+        );
+      }
+      function isChangeSafeForInputObjectFieldOrFieldArg(oldType, newType) {
+        if (isListType(oldType)) {
+          return (
+            isListType(newType) &&
+            isChangeSafeForInputObjectFieldOrFieldArg(
+              oldType.ofType,
+              newType.ofType
+            )
+          );
+        }
+        if (isNonNullType(oldType)) {
+          return (
+            (isNonNullType(newType) &&
+              isChangeSafeForInputObjectFieldOrFieldArg(
+                oldType.ofType,
+                newType.ofType
+              )) ||
+            (!isNonNullType(newType) &&
+              isChangeSafeForInputObjectFieldOrFieldArg(
+                oldType.ofType,
+                newType
+              ))
+          );
+        }
+        return isNamedType(newType) && oldType.name === newType.name;
+      }
+      function typeKindName(type2) {
+        if (isScalarType(type2)) {
+          return "a Scalar type";
+        }
+        if (isObjectType(type2)) {
+          return "an Object type";
+        }
+        if (isInterfaceType(type2)) {
+          return "an Interface type";
+        }
+        if (isUnionType(type2)) {
+          return "a Union type";
+        }
+        if (isEnumType(type2)) {
+          return "an Enum type";
+        }
+        if (isInputObjectType(type2)) {
+          return "an Input type";
+        }
+        invariant$2(false, "Unexpected type: " + inspect$2(type2));
+      }
+      function stringifyValue(value, type2) {
+        const ast2 = astFromValue(value, type2);
+        ast2 != null || invariant$2(false);
+        return print(sortValueNode(ast2));
+      }
+      function diff(oldArray, newArray) {
+        const added = [];
+        const removed = [];
+        const persisted = [];
+        const oldMap = keyMap$1(oldArray, ({ name: name2 }) => name2);
+        const newMap = keyMap$1(newArray, ({ name: name2 }) => name2);
+        for (const oldItem of oldArray) {
+          const newItem = newMap[oldItem.name];
+          if (newItem === void 0) {
+            removed.push(oldItem);
+          } else {
+            persisted.push([oldItem, newItem]);
+          }
+        }
+        for (const newItem of newArray) {
+          if (oldMap[newItem.name] === void 0) {
+            added.push(newItem);
+          }
+        }
+        return {
+          added,
+          persisted,
+          removed,
+        };
+      }
+      var graphql = /* @__PURE__ */ Object.freeze({
+        __proto__: null,
+        [Symbol.toStringTag]: "Module",
+        version,
+        versionInfo,
+        graphql: graphql$1,
+        graphqlSync,
+        resolveObjMapThunk,
+        resolveReadonlyArrayThunk,
+        GraphQLSchema,
+        GraphQLDirective,
+        GraphQLScalarType,
+        GraphQLObjectType,
+        GraphQLInterfaceType,
+        GraphQLUnionType,
+        GraphQLEnumType,
+        GraphQLInputObjectType,
+        GraphQLList,
+        GraphQLNonNull,
+        specifiedScalarTypes,
+        GraphQLInt,
+        GraphQLFloat,
+        GraphQLString,
+        GraphQLBoolean,
+        GraphQLID,
+        GRAPHQL_MAX_INT,
+        GRAPHQL_MIN_INT,
+        specifiedDirectives,
+        GraphQLIncludeDirective,
+        GraphQLSkipDirective,
+        GraphQLDeprecatedDirective,
+        GraphQLSpecifiedByDirective,
+        get TypeKind() {
+          return TypeKind;
+        },
+        DEFAULT_DEPRECATION_REASON,
+        introspectionTypes: introspectionTypes$1,
+        __Schema: __Schema$1,
+        __Directive: __Directive$1,
+        __DirectiveLocation,
+        __Type: __Type$1,
+        __Field: __Field$1,
+        __InputValue: __InputValue$1,
+        __EnumValue,
+        __TypeKind,
+        SchemaMetaFieldDef: SchemaMetaFieldDef$1,
+        TypeMetaFieldDef: TypeMetaFieldDef$1,
+        TypeNameMetaFieldDef,
+        isSchema,
+        isDirective,
+        isType,
+        isScalarType,
+        isObjectType,
+        isInterfaceType,
+        isUnionType,
+        isEnumType,
+        isInputObjectType,
+        isListType,
+        isNonNullType,
+        isInputType,
+        isOutputType,
+        isLeafType,
+        isCompositeType,
+        isAbstractType,
+        isWrappingType,
+        isNullableType,
+        isNamedType,
+        isRequiredArgument: isRequiredArgument$1,
+        isRequiredInputField,
+        isSpecifiedScalarType,
+        isIntrospectionType,
+        isSpecifiedDirective,
+        assertSchema,
+        assertDirective,
+        assertType,
+        assertScalarType,
+        assertObjectType,
+        assertInterfaceType,
+        assertUnionType,
+        assertEnumType,
+        assertInputObjectType,
+        assertListType,
+        assertNonNullType,
+        assertInputType,
+        assertOutputType,
+        assertLeafType,
+        assertCompositeType,
+        assertAbstractType,
+        assertWrappingType,
+        assertNullableType,
+        assertNamedType,
+        getNullableType,
+        getNamedType,
+        validateSchema,
+        assertValidSchema,
+        assertName,
+        assertEnumValueName,
+        Token: Token$4,
+        Source,
+        Location: Location$1,
+        get OperationTypeNode() {
+          return OperationTypeNode;
+        },
+        getLocation: getLocation$1,
+        printLocation,
+        printSourceLocation,
+        Lexer,
+        get TokenKind() {
+          return TokenKind;
+        },
+        parse: parse$1,
+        parseValue: parseValue$1,
+        parseConstValue,
+        parseType,
+        print,
+        visit,
+        visitInParallel,
+        getVisitFn,
+        getEnterLeaveForKind,
+        BREAK,
+        get Kind() {
+          return Kind;
+        },
+        get DirectiveLocation() {
+          return DirectiveLocation;
+        },
+        isDefinitionNode,
+        isExecutableDefinitionNode,
+        isSelectionNode,
+        isValueNode,
+        isConstValueNode,
+        isTypeNode,
+        isTypeSystemDefinitionNode,
+        isTypeDefinitionNode,
+        isTypeSystemExtensionNode,
+        isTypeExtensionNode,
+        execute: execute$1,
+        executeSync,
+        defaultFieldResolver: defaultFieldResolver$1,
+        defaultTypeResolver: defaultTypeResolver$1,
+        responsePathAsArray: pathToArray$1,
+        getArgumentValues: getArgumentValues$1,
+        getVariableValues: getVariableValues$1,
+        getDirectiveValues: getDirectiveValues$1,
+        subscribe,
+        createSourceEventStream,
+        validate,
+        ValidationContext,
+        specifiedRules,
+        ExecutableDefinitionsRule,
+        FieldsOnCorrectTypeRule,
+        FragmentsOnCompositeTypesRule,
+        KnownArgumentNamesRule,
+        KnownDirectivesRule,
+        KnownFragmentNamesRule,
+        KnownTypeNamesRule,
+        LoneAnonymousOperationRule,
+        NoFragmentCyclesRule,
+        NoUndefinedVariablesRule,
+        NoUnusedFragmentsRule,
+        NoUnusedVariablesRule,
+        OverlappingFieldsCanBeMergedRule,
+        PossibleFragmentSpreadsRule,
+        ProvidedRequiredArgumentsRule,
+        ScalarLeafsRule,
+        SingleFieldSubscriptionsRule,
+        UniqueArgumentNamesRule,
+        UniqueDirectivesPerLocationRule,
+        UniqueFragmentNamesRule,
+        UniqueInputFieldNamesRule,
+        UniqueOperationNamesRule,
+        UniqueVariableNamesRule,
+        ValuesOfCorrectTypeRule,
+        VariablesAreInputTypesRule,
+        VariablesInAllowedPositionRule,
+        LoneSchemaDefinitionRule,
+        UniqueOperationTypesRule,
+        UniqueTypeNamesRule,
+        UniqueEnumValueNamesRule,
+        UniqueFieldDefinitionNamesRule,
+        UniqueArgumentDefinitionNamesRule,
+        UniqueDirectiveNamesRule,
+        PossibleTypeExtensionsRule,
+        NoDeprecatedCustomRule,
+        NoSchemaIntrospectionCustomRule,
+        GraphQLError,
+        syntaxError: syntaxError$1,
+        locatedError,
+        printError,
+        formatError: formatError$1,
+        getIntrospectionQuery,
+        getOperationAST,
+        getOperationRootType,
+        introspectionFromSchema,
+        buildClientSchema,
+        buildASTSchema,
+        buildSchema,
+        extendSchema,
+        lexicographicSortSchema,
+        printSchema,
+        printType,
+        printIntrospectionSchema,
+        typeFromAST,
+        valueFromAST: valueFromAST$1,
+        valueFromASTUntyped,
+        astFromValue,
+        TypeInfo,
+        visitWithTypeInfo,
+        coerceInputValue: coerceInputValue$1,
+        concatAST,
+        separateOperations,
+        stripIgnoredCharacters,
+        isEqualType,
+        isTypeSubTypeOf,
+        doTypesOverlap,
+        assertValidName,
+        isValidNameError,
+        get BreakingChangeType() {
+          return BreakingChangeType;
+        },
+        get DangerousChangeType() {
+          return DangerousChangeType;
+        },
+        findBreakingChanges,
+        findDangerousChanges,
+      });
+      function getDefinitionState(tokenState) {
+        let definitionState;
+        forEachState$2(tokenState, (state) => {
+          switch (state.kind) {
+            case "Query":
+            case "ShortQuery":
+            case "Mutation":
+            case "Subscription":
+            case "FragmentDefinition":
+              definitionState = state;
+              break;
+          }
+        });
+        return definitionState;
+      }
+      function getFieldDef$1(schema, type2, fieldName) {
+        if (
+          fieldName === SchemaMetaFieldDef$1.name &&
+          schema.getQueryType() === type2
+        ) {
+          return SchemaMetaFieldDef$1;
+        }
+        if (
+          fieldName === TypeMetaFieldDef$1.name &&
+          schema.getQueryType() === type2
+        ) {
+          return TypeMetaFieldDef$1;
+        }
+        if (fieldName === TypeNameMetaFieldDef.name && isCompositeType(type2)) {
+          return TypeNameMetaFieldDef;
+        }
+        if ("getFields" in type2) {
+          return type2.getFields()[fieldName];
+        }
+        return null;
+      }
+      function forEachState$2(stack, fn) {
+        const reverseStateStack = [];
+        let state = stack;
+        while (state && state.kind) {
+          reverseStateStack.push(state);
+          state = state.prevState;
+        }
+        for (let i = reverseStateStack.length - 1; i >= 0; i--) {
+          fn(reverseStateStack[i]);
+        }
+      }
+      function objectValues(object) {
+        const keys = Object.keys(object);
+        const len = keys.length;
+        const values = new Array(len);
+        for (let i = 0; i < len; ++i) {
+          values[i] = object[keys[i]];
+        }
+        return values;
+      }
+      function hintList$2(token2, list3) {
+        return filterAndSortList$1(list3, normalizeText$1(token2.string));
+      }
+      function filterAndSortList$1(list3, text3) {
+        if (!text3) {
+          return filterNonEmpty$1(list3, (entry) => !entry.isDeprecated);
+        }
+        const byProximity = list3.map((entry) => ({
+          proximity: getProximity$1(normalizeText$1(entry.label), text3),
+          entry,
+        }));
+        return filterNonEmpty$1(
+          filterNonEmpty$1(byProximity, (pair) => pair.proximity <= 2),
+          (pair) => !pair.entry.isDeprecated
+        )
+          .sort(
+            (a, b) =>
+              (a.entry.isDeprecated ? 1 : 0) - (b.entry.isDeprecated ? 1 : 0) ||
+              a.proximity - b.proximity ||
+              a.entry.label.length - b.entry.label.length
+          )
+          .map((pair) => pair.entry);
+      }
+      function filterNonEmpty$1(array, predicate) {
+        const filtered = array.filter(predicate);
+        return filtered.length === 0 ? array : filtered;
+      }
+      function normalizeText$1(text3) {
+        return text3.toLowerCase().replace(/\W/g, "");
+      }
+      function getProximity$1(suggestion, text3) {
+        let proximity = lexicalDistance$1(text3, suggestion);
+        if (suggestion.length > text3.length) {
+          proximity -= suggestion.length - text3.length - 1;
+          proximity += suggestion.indexOf(text3) === 0 ? 0 : 0.5;
+        }
+        return proximity;
+      }
+      function lexicalDistance$1(a, b) {
+        let i;
+        let j;
+        const d = [];
+        const aLength = a.length;
+        const bLength = b.length;
+        for (i = 0; i <= aLength; i++) {
+          d[i] = [i];
+        }
+        for (j = 1; j <= bLength; j++) {
+          d[0][j] = j;
+        }
+        for (i = 1; i <= aLength; i++) {
+          for (j = 1; j <= bLength; j++) {
+            const cost = a[i - 1] === b[j - 1] ? 0 : 1;
+            d[i][j] = Math.min(
+              d[i - 1][j] + 1,
+              d[i][j - 1] + 1,
+              d[i - 1][j - 1] + cost
+            );
+            if (
+              i > 1 &&
+              j > 1 &&
+              a[i - 1] === b[j - 2] &&
+              a[i - 2] === b[j - 1]
+            ) {
+              d[i][j] = Math.min(d[i][j], d[i - 2][j - 2] + cost);
+            }
+          }
+        }
+        return d[aLength][bLength];
+      }
+      var integer;
+      (function (integer2) {
+        integer2.MIN_VALUE = -2147483648;
+        integer2.MAX_VALUE = 2147483647;
+      })(integer || (integer = {}));
+      var uinteger;
+      (function (uinteger2) {
+        uinteger2.MIN_VALUE = 0;
+        uinteger2.MAX_VALUE = 2147483647;
+      })(uinteger || (uinteger = {}));
+      var Position$1;
+      (function (Position2) {
+        function create(line, character) {
+          if (line === Number.MAX_VALUE) {
+            line = uinteger.MAX_VALUE;
+          }
+          if (character === Number.MAX_VALUE) {
+            character = uinteger.MAX_VALUE;
+          }
+          return { line, character };
+        }
+        Position2.create = create;
+        function is2(value) {
+          var candidate = value;
+          return (
+            Is.objectLiteral(candidate) &&
+            Is.uinteger(candidate.line) &&
+            Is.uinteger(candidate.character)
+          );
+        }
+        Position2.is = is2;
+      })(Position$1 || (Position$1 = {}));
+      var Range$1;
+      (function (Range2) {
+        function create(one, two, three, four) {
+          if (
+            Is.uinteger(one) &&
+            Is.uinteger(two) &&
+            Is.uinteger(three) &&
+            Is.uinteger(four)
+          ) {
+            return {
+              start: Position$1.create(one, two),
+              end: Position$1.create(three, four),
+            };
+          } else if (Position$1.is(one) && Position$1.is(two)) {
+            return { start: one, end: two };
+          } else {
+            throw new Error(
+              "Range#create called with invalid arguments[" +
+                one +
+                ", " +
+                two +
+                ", " +
+                three +
+                ", " +
+                four +
+                "]"
+            );
+          }
+        }
+        Range2.create = create;
+        function is2(value) {
+          var candidate = value;
+          return (
+            Is.objectLiteral(candidate) &&
+            Position$1.is(candidate.start) &&
+            Position$1.is(candidate.end)
+          );
+        }
+        Range2.is = is2;
+      })(Range$1 || (Range$1 = {}));
+      var Location;
+      (function (Location2) {
+        function create(uri, range2) {
+          return { uri, range: range2 };
+        }
+        Location2.create = create;
+        function is2(value) {
+          var candidate = value;
+          return (
+            Is.defined(candidate) &&
+            Range$1.is(candidate.range) &&
+            (Is.string(candidate.uri) || Is.undefined(candidate.uri))
+          );
+        }
+        Location2.is = is2;
+      })(Location || (Location = {}));
+      var LocationLink;
+      (function (LocationLink2) {
+        function create(
+          targetUri,
+          targetRange,
+          targetSelectionRange,
+          originSelectionRange
+        ) {
+          return {
+            targetUri,
+            targetRange,
+            targetSelectionRange,
+            originSelectionRange,
+          };
+        }
+        LocationLink2.create = create;
+        function is2(value) {
+          var candidate = value;
+          return (
+            Is.defined(candidate) &&
+            Range$1.is(candidate.targetRange) &&
+            Is.string(candidate.targetUri) &&
+            (Range$1.is(candidate.targetSelectionRange) ||
+              Is.undefined(candidate.targetSelectionRange)) &&
+            (Range$1.is(candidate.originSelectionRange) ||
+              Is.undefined(candidate.originSelectionRange))
+          );
+        }
+        LocationLink2.is = is2;
+      })(LocationLink || (LocationLink = {}));
+      var Color;
+      (function (Color2) {
+        function create(red, green, blue, alpha2) {
+          return {
+            red,
+            green,
+            blue,
+            alpha: alpha2,
+          };
+        }
+        Color2.create = create;
+        function is2(value) {
+          var candidate = value;
+          return (
+            Is.numberRange(candidate.red, 0, 1) &&
+            Is.numberRange(candidate.green, 0, 1) &&
+            Is.numberRange(candidate.blue, 0, 1) &&
+            Is.numberRange(candidate.alpha, 0, 1)
+          );
+        }
+        Color2.is = is2;
+      })(Color || (Color = {}));
+      var ColorInformation;
+      (function (ColorInformation2) {
+        function create(range2, color) {
+          return {
+            range: range2,
+            color,
+          };
+        }
+        ColorInformation2.create = create;
+        function is2(value) {
+          var candidate = value;
+          return Range$1.is(candidate.range) && Color.is(candidate.color);
+        }
+        ColorInformation2.is = is2;
+      })(ColorInformation || (ColorInformation = {}));
+      var ColorPresentation;
+      (function (ColorPresentation2) {
+        function create(label, textEdit, additionalTextEdits) {
+          return {
+            label,
+            textEdit,
+            additionalTextEdits,
+          };
+        }
+        ColorPresentation2.create = create;
+        function is2(value) {
+          var candidate = value;
+          return (
+            Is.string(candidate.label) &&
+            (Is.undefined(candidate.textEdit) || TextEdit.is(candidate)) &&
+            (Is.undefined(candidate.additionalTextEdits) ||
+              Is.typedArray(candidate.additionalTextEdits, TextEdit.is))
+          );
+        }
+        ColorPresentation2.is = is2;
+      })(ColorPresentation || (ColorPresentation = {}));
+      var FoldingRangeKind;
+      (function (FoldingRangeKind2) {
+        FoldingRangeKind2["Comment"] = "comment";
+        FoldingRangeKind2["Imports"] = "imports";
+        FoldingRangeKind2["Region"] = "region";
+      })(FoldingRangeKind || (FoldingRangeKind = {}));
+      var FoldingRange;
+      (function (FoldingRange2) {
+        function create(
+          startLine,
+          endLine,
+          startCharacter,
+          endCharacter,
+          kind2
+        ) {
+          var result2 = {
+            startLine,
+            endLine,
+          };
+          if (Is.defined(startCharacter)) {
+            result2.startCharacter = startCharacter;
+          }
+          if (Is.defined(endCharacter)) {
+            result2.endCharacter = endCharacter;
+          }
+          if (Is.defined(kind2)) {
+            result2.kind = kind2;
+          }
+          return result2;
+        }
+        FoldingRange2.create = create;
+        function is2(value) {
+          var candidate = value;
+          return (
+            Is.uinteger(candidate.startLine) &&
+            Is.uinteger(candidate.startLine) &&
+            (Is.undefined(candidate.startCharacter) ||
+              Is.uinteger(candidate.startCharacter)) &&
+            (Is.undefined(candidate.endCharacter) ||
+              Is.uinteger(candidate.endCharacter)) &&
+            (Is.undefined(candidate.kind) || Is.string(candidate.kind))
+          );
+        }
+        FoldingRange2.is = is2;
+      })(FoldingRange || (FoldingRange = {}));
+      var DiagnosticRelatedInformation;
+      (function (DiagnosticRelatedInformation2) {
+        function create(location2, message) {
+          return {
+            location: location2,
+            message,
+          };
+        }
+        DiagnosticRelatedInformation2.create = create;
+        function is2(value) {
+          var candidate = value;
+          return (
+            Is.defined(candidate) &&
+            Location.is(candidate.location) &&
+            Is.string(candidate.message)
+          );
+        }
+        DiagnosticRelatedInformation2.is = is2;
+      })(DiagnosticRelatedInformation || (DiagnosticRelatedInformation = {}));
+      var DiagnosticSeverity;
+      (function (DiagnosticSeverity2) {
+        DiagnosticSeverity2.Error = 1;
+        DiagnosticSeverity2.Warning = 2;
+        DiagnosticSeverity2.Information = 3;
+        DiagnosticSeverity2.Hint = 4;
+      })(DiagnosticSeverity || (DiagnosticSeverity = {}));
+      var DiagnosticTag;
+      (function (DiagnosticTag2) {
+        DiagnosticTag2.Unnecessary = 1;
+        DiagnosticTag2.Deprecated = 2;
+      })(DiagnosticTag || (DiagnosticTag = {}));
+      var CodeDescription;
+      (function (CodeDescription2) {
+        function is2(value) {
+          var candidate = value;
+          return (
+            candidate !== void 0 &&
+            candidate !== null &&
+            Is.string(candidate.href)
+          );
+        }
+        CodeDescription2.is = is2;
+      })(CodeDescription || (CodeDescription = {}));
+      var Diagnostic;
+      (function (Diagnostic2) {
+        function create(
+          range2,
+          message,
+          severity,
+          code3,
+          source,
+          relatedInformation
+        ) {
+          var result2 = { range: range2, message };
+          if (Is.defined(severity)) {
+            result2.severity = severity;
+          }
+          if (Is.defined(code3)) {
+            result2.code = code3;
+          }
+          if (Is.defined(source)) {
+            result2.source = source;
+          }
+          if (Is.defined(relatedInformation)) {
+            result2.relatedInformation = relatedInformation;
+          }
+          return result2;
+        }
+        Diagnostic2.create = create;
+        function is2(value) {
+          var _a2;
+          var candidate = value;
+          return (
+            Is.defined(candidate) &&
+            Range$1.is(candidate.range) &&
+            Is.string(candidate.message) &&
+            (Is.number(candidate.severity) ||
+              Is.undefined(candidate.severity)) &&
+            (Is.integer(candidate.code) ||
+              Is.string(candidate.code) ||
+              Is.undefined(candidate.code)) &&
+            (Is.undefined(candidate.codeDescription) ||
+              Is.string(
+                (_a2 = candidate.codeDescription) === null || _a2 === void 0
+                  ? void 0
+                  : _a2.href
+              )) &&
+            (Is.string(candidate.source) || Is.undefined(candidate.source)) &&
+            (Is.undefined(candidate.relatedInformation) ||
+              Is.typedArray(
+                candidate.relatedInformation,
+                DiagnosticRelatedInformation.is
+              ))
+          );
+        }
+        Diagnostic2.is = is2;
+      })(Diagnostic || (Diagnostic = {}));
+      var Command;
+      (function (Command2) {
+        function create(title, command) {
+          var args = [];
+          for (var _i = 2; _i < arguments.length; _i++) {
+            args[_i - 2] = arguments[_i];
+          }
+          var result2 = { title, command };
+          if (Is.defined(args) && args.length > 0) {
+            result2.arguments = args;
+          }
+          return result2;
+        }
+        Command2.create = create;
+        function is2(value) {
+          var candidate = value;
+          return (
+            Is.defined(candidate) &&
+            Is.string(candidate.title) &&
+            Is.string(candidate.command)
+          );
+        }
+        Command2.is = is2;
+      })(Command || (Command = {}));
+      var TextEdit;
+      (function (TextEdit2) {
+        function replace2(range2, newText) {
+          return { range: range2, newText };
+        }
+        TextEdit2.replace = replace2;
+        function insert(position, newText) {
+          return { range: { start: position, end: position }, newText };
+        }
+        TextEdit2.insert = insert;
+        function del(range2) {
+          return { range: range2, newText: "" };
+        }
+        TextEdit2.del = del;
+        function is2(value) {
+          var candidate = value;
+          return (
+            Is.objectLiteral(candidate) &&
+            Is.string(candidate.newText) &&
+            Range$1.is(candidate.range)
+          );
+        }
+        TextEdit2.is = is2;
+      })(TextEdit || (TextEdit = {}));
+      var ChangeAnnotation;
+      (function (ChangeAnnotation2) {
+        function create(label, needsConfirmation, description) {
+          var result2 = { label };
+          if (needsConfirmation !== void 0) {
+            result2.needsConfirmation = needsConfirmation;
+          }
+          if (description !== void 0) {
+            result2.description = description;
+          }
+          return result2;
+        }
+        ChangeAnnotation2.create = create;
+        function is2(value) {
+          var candidate = value;
+          return (
+            candidate !== void 0 &&
+            Is.objectLiteral(candidate) &&
+            Is.string(candidate.label) &&
+            (Is.boolean(candidate.needsConfirmation) ||
+              candidate.needsConfirmation === void 0) &&
+            (Is.string(candidate.description) ||
+              candidate.description === void 0)
+          );
+        }
+        ChangeAnnotation2.is = is2;
+      })(ChangeAnnotation || (ChangeAnnotation = {}));
+      var ChangeAnnotationIdentifier;
+      (function (ChangeAnnotationIdentifier2) {
+        function is2(value) {
+          var candidate = value;
+          return typeof candidate === "string";
+        }
+        ChangeAnnotationIdentifier2.is = is2;
+      })(ChangeAnnotationIdentifier || (ChangeAnnotationIdentifier = {}));
+      var AnnotatedTextEdit;
+      (function (AnnotatedTextEdit2) {
+        function replace2(range2, newText, annotation) {
+          return { range: range2, newText, annotationId: annotation };
+        }
+        AnnotatedTextEdit2.replace = replace2;
+        function insert(position, newText, annotation) {
+          return {
+            range: { start: position, end: position },
+            newText,
+            annotationId: annotation,
+          };
+        }
+        AnnotatedTextEdit2.insert = insert;
+        function del(range2, annotation) {
+          return { range: range2, newText: "", annotationId: annotation };
+        }
+        AnnotatedTextEdit2.del = del;
+        function is2(value) {
+          var candidate = value;
+          return (
+            TextEdit.is(candidate) &&
+            (ChangeAnnotation.is(candidate.annotationId) ||
+              ChangeAnnotationIdentifier.is(candidate.annotationId))
+          );
+        }
+        AnnotatedTextEdit2.is = is2;
+      })(AnnotatedTextEdit || (AnnotatedTextEdit = {}));
+      var TextDocumentEdit;
+      (function (TextDocumentEdit2) {
+        function create(textDocument, edits) {
+          return { textDocument, edits };
+        }
+        TextDocumentEdit2.create = create;
+        function is2(value) {
+          var candidate = value;
+          return (
+            Is.defined(candidate) &&
+            OptionalVersionedTextDocumentIdentifier.is(
+              candidate.textDocument
+            ) &&
+            Array.isArray(candidate.edits)
+          );
+        }
+        TextDocumentEdit2.is = is2;
+      })(TextDocumentEdit || (TextDocumentEdit = {}));
+      var CreateFile;
+      (function (CreateFile2) {
+        function create(uri, options, annotation) {
+          var result2 = {
+            kind: "create",
+            uri,
+          };
+          if (
+            options !== void 0 &&
+            (options.overwrite !== void 0 || options.ignoreIfExists !== void 0)
+          ) {
+            result2.options = options;
+          }
+          if (annotation !== void 0) {
+            result2.annotationId = annotation;
+          }
+          return result2;
+        }
+        CreateFile2.create = create;
+        function is2(value) {
+          var candidate = value;
+          return (
+            candidate &&
+            candidate.kind === "create" &&
+            Is.string(candidate.uri) &&
+            (candidate.options === void 0 ||
+              ((candidate.options.overwrite === void 0 ||
+                Is.boolean(candidate.options.overwrite)) &&
+                (candidate.options.ignoreIfExists === void 0 ||
+                  Is.boolean(candidate.options.ignoreIfExists)))) &&
+            (candidate.annotationId === void 0 ||
+              ChangeAnnotationIdentifier.is(candidate.annotationId))
+          );
+        }
+        CreateFile2.is = is2;
+      })(CreateFile || (CreateFile = {}));
+      var RenameFile;
+      (function (RenameFile2) {
+        function create(oldUri, newUri, options, annotation) {
+          var result2 = {
+            kind: "rename",
+            oldUri,
+            newUri,
+          };
+          if (
+            options !== void 0 &&
+            (options.overwrite !== void 0 || options.ignoreIfExists !== void 0)
+          ) {
+            result2.options = options;
+          }
+          if (annotation !== void 0) {
+            result2.annotationId = annotation;
+          }
+          return result2;
+        }
+        RenameFile2.create = create;
+        function is2(value) {
+          var candidate = value;
+          return (
+            candidate &&
+            candidate.kind === "rename" &&
+            Is.string(candidate.oldUri) &&
+            Is.string(candidate.newUri) &&
+            (candidate.options === void 0 ||
+              ((candidate.options.overwrite === void 0 ||
+                Is.boolean(candidate.options.overwrite)) &&
+                (candidate.options.ignoreIfExists === void 0 ||
+                  Is.boolean(candidate.options.ignoreIfExists)))) &&
+            (candidate.annotationId === void 0 ||
+              ChangeAnnotationIdentifier.is(candidate.annotationId))
+          );
+        }
+        RenameFile2.is = is2;
+      })(RenameFile || (RenameFile = {}));
+      var DeleteFile;
+      (function (DeleteFile2) {
+        function create(uri, options, annotation) {
+          var result2 = {
+            kind: "delete",
+            uri,
+          };
+          if (
+            options !== void 0 &&
+            (options.recursive !== void 0 ||
+              options.ignoreIfNotExists !== void 0)
+          ) {
+            result2.options = options;
+          }
+          if (annotation !== void 0) {
+            result2.annotationId = annotation;
+          }
+          return result2;
+        }
+        DeleteFile2.create = create;
+        function is2(value) {
+          var candidate = value;
+          return (
+            candidate &&
+            candidate.kind === "delete" &&
+            Is.string(candidate.uri) &&
+            (candidate.options === void 0 ||
+              ((candidate.options.recursive === void 0 ||
+                Is.boolean(candidate.options.recursive)) &&
+                (candidate.options.ignoreIfNotExists === void 0 ||
+                  Is.boolean(candidate.options.ignoreIfNotExists)))) &&
+            (candidate.annotationId === void 0 ||
+              ChangeAnnotationIdentifier.is(candidate.annotationId))
+          );
+        }
+        DeleteFile2.is = is2;
+      })(DeleteFile || (DeleteFile = {}));
+      var WorkspaceEdit;
+      (function (WorkspaceEdit2) {
+        function is2(value) {
+          var candidate = value;
+          return (
+            candidate &&
+            (candidate.changes !== void 0 ||
+              candidate.documentChanges !== void 0) &&
+            (candidate.documentChanges === void 0 ||
+              candidate.documentChanges.every(function (change) {
+                if (Is.string(change.kind)) {
+                  return (
+                    CreateFile.is(change) ||
+                    RenameFile.is(change) ||
+                    DeleteFile.is(change)
+                  );
+                } else {
+                  return TextDocumentEdit.is(change);
+                }
+              }))
+          );
+        }
+        WorkspaceEdit2.is = is2;
+      })(WorkspaceEdit || (WorkspaceEdit = {}));
+      var TextEditChangeImpl = (function () {
+        function TextEditChangeImpl2(edits, changeAnnotations) {
+          this.edits = edits;
+          this.changeAnnotations = changeAnnotations;
+        }
+        TextEditChangeImpl2.prototype.insert = function (
+          position,
+          newText,
+          annotation
+        ) {
+          var edit;
+          var id2;
+          if (annotation === void 0) {
+            edit = TextEdit.insert(position, newText);
+          } else if (ChangeAnnotationIdentifier.is(annotation)) {
+            id2 = annotation;
+            edit = AnnotatedTextEdit.insert(position, newText, annotation);
+          } else {
+            this.assertChangeAnnotations(this.changeAnnotations);
+            id2 = this.changeAnnotations.manage(annotation);
+            edit = AnnotatedTextEdit.insert(position, newText, id2);
+          }
+          this.edits.push(edit);
+          if (id2 !== void 0) {
+            return id2;
+          }
+        };
+        TextEditChangeImpl2.prototype.replace = function (
+          range2,
+          newText,
+          annotation
+        ) {
+          var edit;
+          var id2;
+          if (annotation === void 0) {
+            edit = TextEdit.replace(range2, newText);
+          } else if (ChangeAnnotationIdentifier.is(annotation)) {
+            id2 = annotation;
+            edit = AnnotatedTextEdit.replace(range2, newText, annotation);
+          } else {
+            this.assertChangeAnnotations(this.changeAnnotations);
+            id2 = this.changeAnnotations.manage(annotation);
+            edit = AnnotatedTextEdit.replace(range2, newText, id2);
+          }
+          this.edits.push(edit);
+          if (id2 !== void 0) {
+            return id2;
+          }
+        };
+        TextEditChangeImpl2.prototype.delete = function (range2, annotation) {
+          var edit;
+          var id2;
+          if (annotation === void 0) {
+            edit = TextEdit.del(range2);
+          } else if (ChangeAnnotationIdentifier.is(annotation)) {
+            id2 = annotation;
+            edit = AnnotatedTextEdit.del(range2, annotation);
+          } else {
+            this.assertChangeAnnotations(this.changeAnnotations);
+            id2 = this.changeAnnotations.manage(annotation);
+            edit = AnnotatedTextEdit.del(range2, id2);
+          }
+          this.edits.push(edit);
+          if (id2 !== void 0) {
+            return id2;
+          }
+        };
+        TextEditChangeImpl2.prototype.add = function (edit) {
+          this.edits.push(edit);
+        };
+        TextEditChangeImpl2.prototype.all = function () {
+          return this.edits;
+        };
+        TextEditChangeImpl2.prototype.clear = function () {
+          this.edits.splice(0, this.edits.length);
+        };
+        TextEditChangeImpl2.prototype.assertChangeAnnotations = function (
+          value
+        ) {
+          if (value === void 0) {
+            throw new Error(
+              "Text edit change is not configured to manage change annotations."
+            );
+          }
+        };
+        return TextEditChangeImpl2;
+      })();
+      var ChangeAnnotations = (function () {
+        function ChangeAnnotations2(annotations2) {
+          this._annotations =
+            annotations2 === void 0
+              ? /* @__PURE__ */ Object.create(null)
+              : annotations2;
+          this._counter = 0;
+          this._size = 0;
+        }
+        ChangeAnnotations2.prototype.all = function () {
+          return this._annotations;
+        };
+        Object.defineProperty(ChangeAnnotations2.prototype, "size", {
+          get: function () {
+            return this._size;
+          },
+          enumerable: false,
+          configurable: true,
+        });
+        ChangeAnnotations2.prototype.manage = function (
+          idOrAnnotation,
+          annotation
+        ) {
+          var id2;
+          if (ChangeAnnotationIdentifier.is(idOrAnnotation)) {
+            id2 = idOrAnnotation;
+          } else {
+            id2 = this.nextId();
+            annotation = idOrAnnotation;
+          }
+          if (this._annotations[id2] !== void 0) {
+            throw new Error("Id " + id2 + " is already in use.");
+          }
+          if (annotation === void 0) {
+            throw new Error("No annotation provided for id " + id2);
+          }
+          this._annotations[id2] = annotation;
+          this._size++;
+          return id2;
+        };
+        ChangeAnnotations2.prototype.nextId = function () {
+          this._counter++;
+          return this._counter.toString();
+        };
+        return ChangeAnnotations2;
+      })();
+      (function () {
+        function WorkspaceChange(workspaceEdit) {
+          var _this = this;
+          this._textEditChanges = /* @__PURE__ */ Object.create(null);
+          if (workspaceEdit !== void 0) {
+            this._workspaceEdit = workspaceEdit;
+            if (workspaceEdit.documentChanges) {
+              this._changeAnnotations = new ChangeAnnotations(
+                workspaceEdit.changeAnnotations
+              );
+              workspaceEdit.changeAnnotations = this._changeAnnotations.all();
+              workspaceEdit.documentChanges.forEach(function (change) {
+                if (TextDocumentEdit.is(change)) {
+                  var textEditChange = new TextEditChangeImpl(
+                    change.edits,
+                    _this._changeAnnotations
+                  );
+                  _this._textEditChanges[change.textDocument.uri] =
+                    textEditChange;
+                }
+              });
+            } else if (workspaceEdit.changes) {
+              Object.keys(workspaceEdit.changes).forEach(function (key) {
+                var textEditChange = new TextEditChangeImpl(
+                  workspaceEdit.changes[key]
+                );
+                _this._textEditChanges[key] = textEditChange;
+              });
+            }
+          } else {
+            this._workspaceEdit = {};
+          }
+        }
+        Object.defineProperty(WorkspaceChange.prototype, "edit", {
+          get: function () {
+            this.initDocumentChanges();
+            if (this._changeAnnotations !== void 0) {
+              if (this._changeAnnotations.size === 0) {
+                this._workspaceEdit.changeAnnotations = void 0;
+              } else {
+                this._workspaceEdit.changeAnnotations =
+                  this._changeAnnotations.all();
+              }
+            }
+            return this._workspaceEdit;
+          },
+          enumerable: false,
+          configurable: true,
+        });
+        WorkspaceChange.prototype.getTextEditChange = function (key) {
+          if (OptionalVersionedTextDocumentIdentifier.is(key)) {
+            this.initDocumentChanges();
+            if (this._workspaceEdit.documentChanges === void 0) {
+              throw new Error(
+                "Workspace edit is not configured for document changes."
+              );
+            }
+            var textDocument = { uri: key.uri, version: key.version };
+            var result2 = this._textEditChanges[textDocument.uri];
+            if (!result2) {
+              var edits = [];
+              var textDocumentEdit = {
+                textDocument,
+                edits,
+              };
+              this._workspaceEdit.documentChanges.push(textDocumentEdit);
+              result2 = new TextEditChangeImpl(edits, this._changeAnnotations);
+              this._textEditChanges[textDocument.uri] = result2;
+            }
+            return result2;
+          } else {
+            this.initChanges();
+            if (this._workspaceEdit.changes === void 0) {
+              throw new Error(
+                "Workspace edit is not configured for normal text edit changes."
+              );
+            }
+            var result2 = this._textEditChanges[key];
+            if (!result2) {
+              var edits = [];
+              this._workspaceEdit.changes[key] = edits;
+              result2 = new TextEditChangeImpl(edits);
+              this._textEditChanges[key] = result2;
+            }
+            return result2;
+          }
+        };
+        WorkspaceChange.prototype.initDocumentChanges = function () {
+          if (
+            this._workspaceEdit.documentChanges === void 0 &&
+            this._workspaceEdit.changes === void 0
+          ) {
+            this._changeAnnotations = new ChangeAnnotations();
+            this._workspaceEdit.documentChanges = [];
+            this._workspaceEdit.changeAnnotations =
+              this._changeAnnotations.all();
+          }
+        };
+        WorkspaceChange.prototype.initChanges = function () {
+          if (
+            this._workspaceEdit.documentChanges === void 0 &&
+            this._workspaceEdit.changes === void 0
+          ) {
+            this._workspaceEdit.changes = /* @__PURE__ */ Object.create(null);
+          }
+        };
+        WorkspaceChange.prototype.createFile = function (
+          uri,
+          optionsOrAnnotation,
+          options
+        ) {
+          this.initDocumentChanges();
+          if (this._workspaceEdit.documentChanges === void 0) {
+            throw new Error(
+              "Workspace edit is not configured for document changes."
+            );
+          }
+          var annotation;
+          if (
+            ChangeAnnotation.is(optionsOrAnnotation) ||
+            ChangeAnnotationIdentifier.is(optionsOrAnnotation)
+          ) {
+            annotation = optionsOrAnnotation;
+          } else {
+            options = optionsOrAnnotation;
+          }
+          var operation;
+          var id2;
+          if (annotation === void 0) {
+            operation = CreateFile.create(uri, options);
+          } else {
+            id2 = ChangeAnnotationIdentifier.is(annotation)
+              ? annotation
+              : this._changeAnnotations.manage(annotation);
+            operation = CreateFile.create(uri, options, id2);
+          }
+          this._workspaceEdit.documentChanges.push(operation);
+          if (id2 !== void 0) {
+            return id2;
+          }
+        };
+        WorkspaceChange.prototype.renameFile = function (
+          oldUri,
+          newUri,
+          optionsOrAnnotation,
+          options
+        ) {
+          this.initDocumentChanges();
+          if (this._workspaceEdit.documentChanges === void 0) {
+            throw new Error(
+              "Workspace edit is not configured for document changes."
+            );
+          }
+          var annotation;
+          if (
+            ChangeAnnotation.is(optionsOrAnnotation) ||
+            ChangeAnnotationIdentifier.is(optionsOrAnnotation)
+          ) {
+            annotation = optionsOrAnnotation;
+          } else {
+            options = optionsOrAnnotation;
+          }
+          var operation;
+          var id2;
+          if (annotation === void 0) {
+            operation = RenameFile.create(oldUri, newUri, options);
+          } else {
+            id2 = ChangeAnnotationIdentifier.is(annotation)
+              ? annotation
+              : this._changeAnnotations.manage(annotation);
+            operation = RenameFile.create(oldUri, newUri, options, id2);
+          }
+          this._workspaceEdit.documentChanges.push(operation);
+          if (id2 !== void 0) {
+            return id2;
+          }
+        };
+        WorkspaceChange.prototype.deleteFile = function (
+          uri,
+          optionsOrAnnotation,
+          options
+        ) {
+          this.initDocumentChanges();
+          if (this._workspaceEdit.documentChanges === void 0) {
+            throw new Error(
+              "Workspace edit is not configured for document changes."
+            );
+          }
+          var annotation;
+          if (
+            ChangeAnnotation.is(optionsOrAnnotation) ||
+            ChangeAnnotationIdentifier.is(optionsOrAnnotation)
+          ) {
+            annotation = optionsOrAnnotation;
+          } else {
+            options = optionsOrAnnotation;
+          }
+          var operation;
+          var id2;
+          if (annotation === void 0) {
+            operation = DeleteFile.create(uri, options);
+          } else {
+            id2 = ChangeAnnotationIdentifier.is(annotation)
+              ? annotation
+              : this._changeAnnotations.manage(annotation);
+            operation = DeleteFile.create(uri, options, id2);
+          }
+          this._workspaceEdit.documentChanges.push(operation);
+          if (id2 !== void 0) {
+            return id2;
+          }
+        };
+        return WorkspaceChange;
+      })();
+      var TextDocumentIdentifier;
+      (function (TextDocumentIdentifier2) {
+        function create(uri) {
+          return { uri };
+        }
+        TextDocumentIdentifier2.create = create;
+        function is2(value) {
+          var candidate = value;
+          return Is.defined(candidate) && Is.string(candidate.uri);
+        }
+        TextDocumentIdentifier2.is = is2;
+      })(TextDocumentIdentifier || (TextDocumentIdentifier = {}));
+      var VersionedTextDocumentIdentifier;
+      (function (VersionedTextDocumentIdentifier2) {
+        function create(uri, version2) {
+          return { uri, version: version2 };
+        }
+        VersionedTextDocumentIdentifier2.create = create;
+        function is2(value) {
+          var candidate = value;
+          return (
+            Is.defined(candidate) &&
+            Is.string(candidate.uri) &&
+            Is.integer(candidate.version)
+          );
+        }
+        VersionedTextDocumentIdentifier2.is = is2;
+      })(
+        VersionedTextDocumentIdentifier ||
+          (VersionedTextDocumentIdentifier = {})
+      );
+      var OptionalVersionedTextDocumentIdentifier;
+      (function (OptionalVersionedTextDocumentIdentifier2) {
+        function create(uri, version2) {
+          return { uri, version: version2 };
+        }
+        OptionalVersionedTextDocumentIdentifier2.create = create;
+        function is2(value) {
+          var candidate = value;
+          return (
+            Is.defined(candidate) &&
+            Is.string(candidate.uri) &&
+            (candidate.version === null || Is.integer(candidate.version))
+          );
+        }
+        OptionalVersionedTextDocumentIdentifier2.is = is2;
+      })(
+        OptionalVersionedTextDocumentIdentifier ||
+          (OptionalVersionedTextDocumentIdentifier = {})
+      );
+      var TextDocumentItem;
+      (function (TextDocumentItem2) {
+        function create(uri, languageId, version2, text3) {
+          return { uri, languageId, version: version2, text: text3 };
+        }
+        TextDocumentItem2.create = create;
+        function is2(value) {
+          var candidate = value;
+          return (
+            Is.defined(candidate) &&
+            Is.string(candidate.uri) &&
+            Is.string(candidate.languageId) &&
+            Is.integer(candidate.version) &&
+            Is.string(candidate.text)
+          );
+        }
+        TextDocumentItem2.is = is2;
+      })(TextDocumentItem || (TextDocumentItem = {}));
+      var MarkupKind;
+      (function (MarkupKind2) {
+        MarkupKind2.PlainText = "plaintext";
+        MarkupKind2.Markdown = "markdown";
+      })(MarkupKind || (MarkupKind = {}));
+      (function (MarkupKind2) {
+        function is2(value) {
+          var candidate = value;
+          return (
+            candidate === MarkupKind2.PlainText ||
+            candidate === MarkupKind2.Markdown
+          );
+        }
+        MarkupKind2.is = is2;
+      })(MarkupKind || (MarkupKind = {}));
+      var MarkupContent;
+      (function (MarkupContent2) {
+        function is2(value) {
+          var candidate = value;
+          return (
+            Is.objectLiteral(value) &&
+            MarkupKind.is(candidate.kind) &&
+            Is.string(candidate.value)
+          );
+        }
+        MarkupContent2.is = is2;
+      })(MarkupContent || (MarkupContent = {}));
+      var CompletionItemKind$1;
+      (function (CompletionItemKind2) {
+        CompletionItemKind2.Text = 1;
+        CompletionItemKind2.Method = 2;
+        CompletionItemKind2.Function = 3;
+        CompletionItemKind2.Constructor = 4;
+        CompletionItemKind2.Field = 5;
+        CompletionItemKind2.Variable = 6;
+        CompletionItemKind2.Class = 7;
+        CompletionItemKind2.Interface = 8;
+        CompletionItemKind2.Module = 9;
+        CompletionItemKind2.Property = 10;
+        CompletionItemKind2.Unit = 11;
+        CompletionItemKind2.Value = 12;
+        CompletionItemKind2.Enum = 13;
+        CompletionItemKind2.Keyword = 14;
+        CompletionItemKind2.Snippet = 15;
+        CompletionItemKind2.Color = 16;
+        CompletionItemKind2.File = 17;
+        CompletionItemKind2.Reference = 18;
+        CompletionItemKind2.Folder = 19;
+        CompletionItemKind2.EnumMember = 20;
+        CompletionItemKind2.Constant = 21;
+        CompletionItemKind2.Struct = 22;
+        CompletionItemKind2.Event = 23;
+        CompletionItemKind2.Operator = 24;
+        CompletionItemKind2.TypeParameter = 25;
+      })(CompletionItemKind$1 || (CompletionItemKind$1 = {}));
+      var InsertTextFormat;
+      (function (InsertTextFormat2) {
+        InsertTextFormat2.PlainText = 1;
+        InsertTextFormat2.Snippet = 2;
+      })(InsertTextFormat || (InsertTextFormat = {}));
+      var CompletionItemTag;
+      (function (CompletionItemTag2) {
+        CompletionItemTag2.Deprecated = 1;
+      })(CompletionItemTag || (CompletionItemTag = {}));
+      var InsertReplaceEdit;
+      (function (InsertReplaceEdit2) {
+        function create(newText, insert, replace2) {
+          return { newText, insert, replace: replace2 };
+        }
+        InsertReplaceEdit2.create = create;
+        function is2(value) {
+          var candidate = value;
+          return (
+            candidate &&
+            Is.string(candidate.newText) &&
+            Range$1.is(candidate.insert) &&
+            Range$1.is(candidate.replace)
+          );
+        }
+        InsertReplaceEdit2.is = is2;
+      })(InsertReplaceEdit || (InsertReplaceEdit = {}));
+      var InsertTextMode;
+      (function (InsertTextMode2) {
+        InsertTextMode2.asIs = 1;
+        InsertTextMode2.adjustIndentation = 2;
+      })(InsertTextMode || (InsertTextMode = {}));
+      var CompletionItem;
+      (function (CompletionItem2) {
+        function create(label) {
+          return { label };
+        }
+        CompletionItem2.create = create;
+      })(CompletionItem || (CompletionItem = {}));
+      var CompletionList;
+      (function (CompletionList2) {
+        function create(items, isIncomplete) {
+          return { items: items ? items : [], isIncomplete: !!isIncomplete };
+        }
+        CompletionList2.create = create;
+      })(CompletionList || (CompletionList = {}));
+      var MarkedString;
+      (function (MarkedString2) {
+        function fromPlainText(plainText) {
+          return plainText.replace(/[\\`*_{}[\]()#+\-.!]/g, "\\$&");
+        }
+        MarkedString2.fromPlainText = fromPlainText;
+        function is2(value) {
+          var candidate = value;
+          return (
+            Is.string(candidate) ||
+            (Is.objectLiteral(candidate) &&
+              Is.string(candidate.language) &&
+              Is.string(candidate.value))
+          );
+        }
+        MarkedString2.is = is2;
+      })(MarkedString || (MarkedString = {}));
+      var Hover;
+      (function (Hover2) {
+        function is2(value) {
+          var candidate = value;
+          return (
+            !!candidate &&
+            Is.objectLiteral(candidate) &&
+            (MarkupContent.is(candidate.contents) ||
+              MarkedString.is(candidate.contents) ||
+              Is.typedArray(candidate.contents, MarkedString.is)) &&
+            (value.range === void 0 || Range$1.is(value.range))
+          );
+        }
+        Hover2.is = is2;
+      })(Hover || (Hover = {}));
+      var ParameterInformation;
+      (function (ParameterInformation2) {
+        function create(label, documentation) {
+          return documentation ? { label, documentation } : { label };
+        }
+        ParameterInformation2.create = create;
+      })(ParameterInformation || (ParameterInformation = {}));
+      var SignatureInformation;
+      (function (SignatureInformation2) {
+        function create(label, documentation) {
+          var parameters = [];
+          for (var _i = 2; _i < arguments.length; _i++) {
+            parameters[_i - 2] = arguments[_i];
+          }
+          var result2 = { label };
+          if (Is.defined(documentation)) {
+            result2.documentation = documentation;
+          }
+          if (Is.defined(parameters)) {
+            result2.parameters = parameters;
+          } else {
+            result2.parameters = [];
+          }
+          return result2;
+        }
+        SignatureInformation2.create = create;
+      })(SignatureInformation || (SignatureInformation = {}));
+      var DocumentHighlightKind;
+      (function (DocumentHighlightKind2) {
+        DocumentHighlightKind2.Text = 1;
+        DocumentHighlightKind2.Read = 2;
+        DocumentHighlightKind2.Write = 3;
+      })(DocumentHighlightKind || (DocumentHighlightKind = {}));
+      var DocumentHighlight;
+      (function (DocumentHighlight2) {
+        function create(range2, kind2) {
+          var result2 = { range: range2 };
+          if (Is.number(kind2)) {
+            result2.kind = kind2;
+          }
+          return result2;
+        }
+        DocumentHighlight2.create = create;
+      })(DocumentHighlight || (DocumentHighlight = {}));
+      var SymbolKind;
+      (function (SymbolKind2) {
+        SymbolKind2.File = 1;
+        SymbolKind2.Module = 2;
+        SymbolKind2.Namespace = 3;
+        SymbolKind2.Package = 4;
+        SymbolKind2.Class = 5;
+        SymbolKind2.Method = 6;
+        SymbolKind2.Property = 7;
+        SymbolKind2.Field = 8;
+        SymbolKind2.Constructor = 9;
+        SymbolKind2.Enum = 10;
+        SymbolKind2.Interface = 11;
+        SymbolKind2.Function = 12;
+        SymbolKind2.Variable = 13;
+        SymbolKind2.Constant = 14;
+        SymbolKind2.String = 15;
+        SymbolKind2.Number = 16;
+        SymbolKind2.Boolean = 17;
+        SymbolKind2.Array = 18;
+        SymbolKind2.Object = 19;
+        SymbolKind2.Key = 20;
+        SymbolKind2.Null = 21;
+        SymbolKind2.EnumMember = 22;
+        SymbolKind2.Struct = 23;
+        SymbolKind2.Event = 24;
+        SymbolKind2.Operator = 25;
+        SymbolKind2.TypeParameter = 26;
+      })(SymbolKind || (SymbolKind = {}));
+      var SymbolTag;
+      (function (SymbolTag2) {
+        SymbolTag2.Deprecated = 1;
+      })(SymbolTag || (SymbolTag = {}));
+      var SymbolInformation;
+      (function (SymbolInformation2) {
+        function create(name2, kind2, range2, uri, containerName) {
+          var result2 = {
+            name: name2,
+            kind: kind2,
+            location: { uri, range: range2 },
+          };
+          if (containerName) {
+            result2.containerName = containerName;
+          }
+          return result2;
+        }
+        SymbolInformation2.create = create;
+      })(SymbolInformation || (SymbolInformation = {}));
+      var DocumentSymbol;
+      (function (DocumentSymbol2) {
+        function create(
+          name2,
+          detail,
+          kind2,
+          range2,
+          selectionRange,
+          children
+        ) {
+          var result2 = {
+            name: name2,
+            detail,
+            kind: kind2,
+            range: range2,
+            selectionRange,
+          };
+          if (children !== void 0) {
+            result2.children = children;
+          }
+          return result2;
+        }
+        DocumentSymbol2.create = create;
+        function is2(value) {
+          var candidate = value;
+          return (
+            candidate &&
+            Is.string(candidate.name) &&
+            Is.number(candidate.kind) &&
+            Range$1.is(candidate.range) &&
+            Range$1.is(candidate.selectionRange) &&
+            (candidate.detail === void 0 || Is.string(candidate.detail)) &&
+            (candidate.deprecated === void 0 ||
+              Is.boolean(candidate.deprecated)) &&
+            (candidate.children === void 0 ||
+              Array.isArray(candidate.children)) &&
+            (candidate.tags === void 0 || Array.isArray(candidate.tags))
+          );
+        }
+        DocumentSymbol2.is = is2;
+      })(DocumentSymbol || (DocumentSymbol = {}));
+      var CodeActionKind;
+      (function (CodeActionKind2) {
+        CodeActionKind2.Empty = "";
+        CodeActionKind2.QuickFix = "quickfix";
+        CodeActionKind2.Refactor = "refactor";
+        CodeActionKind2.RefactorExtract = "refactor.extract";
+        CodeActionKind2.RefactorInline = "refactor.inline";
+        CodeActionKind2.RefactorRewrite = "refactor.rewrite";
+        CodeActionKind2.Source = "source";
+        CodeActionKind2.SourceOrganizeImports = "source.organizeImports";
+        CodeActionKind2.SourceFixAll = "source.fixAll";
+      })(CodeActionKind || (CodeActionKind = {}));
+      var CodeActionContext;
+      (function (CodeActionContext2) {
+        function create(diagnostics, only) {
+          var result2 = { diagnostics };
+          if (only !== void 0 && only !== null) {
+            result2.only = only;
+          }
+          return result2;
+        }
+        CodeActionContext2.create = create;
+        function is2(value) {
+          var candidate = value;
+          return (
+            Is.defined(candidate) &&
+            Is.typedArray(candidate.diagnostics, Diagnostic.is) &&
+            (candidate.only === void 0 ||
+              Is.typedArray(candidate.only, Is.string))
+          );
+        }
+        CodeActionContext2.is = is2;
+      })(CodeActionContext || (CodeActionContext = {}));
+      var CodeAction;
+      (function (CodeAction2) {
+        function create(title, kindOrCommandOrEdit, kind2) {
+          var result2 = { title };
+          var checkKind = true;
+          if (typeof kindOrCommandOrEdit === "string") {
+            checkKind = false;
+            result2.kind = kindOrCommandOrEdit;
+          } else if (Command.is(kindOrCommandOrEdit)) {
+            result2.command = kindOrCommandOrEdit;
+          } else {
+            result2.edit = kindOrCommandOrEdit;
+          }
+          if (checkKind && kind2 !== void 0) {
+            result2.kind = kind2;
+          }
+          return result2;
+        }
+        CodeAction2.create = create;
+        function is2(value) {
+          var candidate = value;
+          return (
+            candidate &&
+            Is.string(candidate.title) &&
+            (candidate.diagnostics === void 0 ||
+              Is.typedArray(candidate.diagnostics, Diagnostic.is)) &&
+            (candidate.kind === void 0 || Is.string(candidate.kind)) &&
+            (candidate.edit !== void 0 || candidate.command !== void 0) &&
+            (candidate.command === void 0 || Command.is(candidate.command)) &&
+            (candidate.isPreferred === void 0 ||
+              Is.boolean(candidate.isPreferred)) &&
+            (candidate.edit === void 0 || WorkspaceEdit.is(candidate.edit))
+          );
+        }
+        CodeAction2.is = is2;
+      })(CodeAction || (CodeAction = {}));
+      var CodeLens;
+      (function (CodeLens2) {
+        function create(range2, data) {
+          var result2 = { range: range2 };
+          if (Is.defined(data)) {
+            result2.data = data;
+          }
+          return result2;
+        }
+        CodeLens2.create = create;
+        function is2(value) {
+          var candidate = value;
+          return (
+            Is.defined(candidate) &&
+            Range$1.is(candidate.range) &&
+            (Is.undefined(candidate.command) || Command.is(candidate.command))
+          );
+        }
+        CodeLens2.is = is2;
+      })(CodeLens || (CodeLens = {}));
+      var FormattingOptions;
+      (function (FormattingOptions2) {
+        function create(tabSize, insertSpaces) {
+          return { tabSize, insertSpaces };
+        }
+        FormattingOptions2.create = create;
+        function is2(value) {
+          var candidate = value;
+          return (
+            Is.defined(candidate) &&
+            Is.uinteger(candidate.tabSize) &&
+            Is.boolean(candidate.insertSpaces)
+          );
+        }
+        FormattingOptions2.is = is2;
+      })(FormattingOptions || (FormattingOptions = {}));
+      var DocumentLink;
+      (function (DocumentLink2) {
+        function create(range2, target2, data) {
+          return { range: range2, target: target2, data };
+        }
+        DocumentLink2.create = create;
+        function is2(value) {
+          var candidate = value;
+          return (
+            Is.defined(candidate) &&
+            Range$1.is(candidate.range) &&
+            (Is.undefined(candidate.target) || Is.string(candidate.target))
+          );
+        }
+        DocumentLink2.is = is2;
+      })(DocumentLink || (DocumentLink = {}));
+      var SelectionRange;
+      (function (SelectionRange2) {
+        function create(range2, parent) {
+          return { range: range2, parent };
+        }
+        SelectionRange2.create = create;
+        function is2(value) {
+          var candidate = value;
+          return (
+            candidate !== void 0 &&
+            Range$1.is(candidate.range) &&
+            (candidate.parent === void 0 ||
+              SelectionRange2.is(candidate.parent))
+          );
+        }
+        SelectionRange2.is = is2;
+      })(SelectionRange || (SelectionRange = {}));
+      var TextDocument;
+      (function (TextDocument2) {
+        function create(uri, languageId, version2, content) {
+          return new FullTextDocument(uri, languageId, version2, content);
+        }
+        TextDocument2.create = create;
+        function is2(value) {
+          var candidate = value;
+          return Is.defined(candidate) &&
+            Is.string(candidate.uri) &&
+            (Is.undefined(candidate.languageId) ||
+              Is.string(candidate.languageId)) &&
+            Is.uinteger(candidate.lineCount) &&
+            Is.func(candidate.getText) &&
+            Is.func(candidate.positionAt) &&
+            Is.func(candidate.offsetAt)
+            ? true
+            : false;
+        }
+        TextDocument2.is = is2;
+        function applyEdits(document2, edits) {
+          var text3 = document2.getText();
+          var sortedEdits = mergeSort(edits, function (a, b) {
+            var diff2 = a.range.start.line - b.range.start.line;
+            if (diff2 === 0) {
+              return a.range.start.character - b.range.start.character;
+            }
+            return diff2;
+          });
+          var lastModifiedOffset = text3.length;
+          for (var i = sortedEdits.length - 1; i >= 0; i--) {
+            var e = sortedEdits[i];
+            var startOffset = document2.offsetAt(e.range.start);
+            var endOffset = document2.offsetAt(e.range.end);
+            if (endOffset <= lastModifiedOffset) {
+              text3 =
+                text3.substring(0, startOffset) +
+                e.newText +
+                text3.substring(endOffset, text3.length);
+            } else {
+              throw new Error("Overlapping edit");
+            }
+            lastModifiedOffset = startOffset;
+          }
+          return text3;
+        }
+        TextDocument2.applyEdits = applyEdits;
+        function mergeSort(data, compare) {
+          if (data.length <= 1) {
+            return data;
+          }
+          var p2 = (data.length / 2) | 0;
+          var left = data.slice(0, p2);
+          var right = data.slice(p2);
+          mergeSort(left, compare);
+          mergeSort(right, compare);
+          var leftIdx = 0;
+          var rightIdx = 0;
+          var i = 0;
+          while (leftIdx < left.length && rightIdx < right.length) {
+            var ret = compare(left[leftIdx], right[rightIdx]);
+            if (ret <= 0) {
+              data[i++] = left[leftIdx++];
+            } else {
+              data[i++] = right[rightIdx++];
+            }
+          }
+          while (leftIdx < left.length) {
+            data[i++] = left[leftIdx++];
+          }
+          while (rightIdx < right.length) {
+            data[i++] = right[rightIdx++];
+          }
+          return data;
+        }
+      })(TextDocument || (TextDocument = {}));
+      var FullTextDocument = (function () {
+        function FullTextDocument2(uri, languageId, version2, content) {
+          this._uri = uri;
+          this._languageId = languageId;
+          this._version = version2;
+          this._content = content;
+          this._lineOffsets = void 0;
+        }
+        Object.defineProperty(FullTextDocument2.prototype, "uri", {
+          get: function () {
+            return this._uri;
+          },
+          enumerable: false,
+          configurable: true,
+        });
+        Object.defineProperty(FullTextDocument2.prototype, "languageId", {
+          get: function () {
+            return this._languageId;
+          },
+          enumerable: false,
+          configurable: true,
+        });
+        Object.defineProperty(FullTextDocument2.prototype, "version", {
+          get: function () {
+            return this._version;
+          },
+          enumerable: false,
+          configurable: true,
+        });
+        FullTextDocument2.prototype.getText = function (range2) {
+          if (range2) {
+            var start2 = this.offsetAt(range2.start);
+            var end2 = this.offsetAt(range2.end);
+            return this._content.substring(start2, end2);
+          }
+          return this._content;
+        };
+        FullTextDocument2.prototype.update = function (event, version2) {
+          this._content = event.text;
+          this._version = version2;
+          this._lineOffsets = void 0;
+        };
+        FullTextDocument2.prototype.getLineOffsets = function () {
+          if (this._lineOffsets === void 0) {
+            var lineOffsets = [];
+            var text3 = this._content;
+            var isLineStart = true;
+            for (var i = 0; i < text3.length; i++) {
+              if (isLineStart) {
+                lineOffsets.push(i);
+                isLineStart = false;
+              }
+              var ch2 = text3.charAt(i);
+              isLineStart = ch2 === "\r" || ch2 === "\n";
+              if (
+                ch2 === "\r" &&
+                i + 1 < text3.length &&
+                text3.charAt(i + 1) === "\n"
+              ) {
+                i++;
+              }
+            }
+            if (isLineStart && text3.length > 0) {
+              lineOffsets.push(text3.length);
+            }
+            this._lineOffsets = lineOffsets;
+          }
+          return this._lineOffsets;
+        };
+        FullTextDocument2.prototype.positionAt = function (offset) {
+          offset = Math.max(Math.min(offset, this._content.length), 0);
+          var lineOffsets = this.getLineOffsets();
+          var low = 0,
+            high = lineOffsets.length;
+          if (high === 0) {
+            return Position$1.create(0, offset);
+          }
+          while (low < high) {
+            var mid2 = Math.floor((low + high) / 2);
+            if (lineOffsets[mid2] > offset) {
+              high = mid2;
+            } else {
+              low = mid2 + 1;
+            }
+          }
+          var line = low - 1;
+          return Position$1.create(line, offset - lineOffsets[line]);
+        };
+        FullTextDocument2.prototype.offsetAt = function (position) {
+          var lineOffsets = this.getLineOffsets();
+          if (position.line >= lineOffsets.length) {
+            return this._content.length;
+          } else if (position.line < 0) {
+            return 0;
+          }
+          var lineOffset = lineOffsets[position.line];
+          var nextLineOffset =
+            position.line + 1 < lineOffsets.length
+              ? lineOffsets[position.line + 1]
+              : this._content.length;
+          return Math.max(
+            Math.min(lineOffset + position.character, nextLineOffset),
+            lineOffset
+          );
+        };
+        Object.defineProperty(FullTextDocument2.prototype, "lineCount", {
+          get: function () {
+            return this.getLineOffsets().length;
+          },
+          enumerable: false,
+          configurable: true,
+        });
+        return FullTextDocument2;
+      })();
+      var Is;
+      (function (Is2) {
+        var toString = Object.prototype.toString;
+        function defined(value) {
+          return typeof value !== "undefined";
+        }
+        Is2.defined = defined;
+        function undefined$1(value) {
+          return typeof value === "undefined";
+        }
+        Is2.undefined = undefined$1;
+        function boolean(value) {
+          return value === true || value === false;
+        }
+        Is2.boolean = boolean;
+        function string2(value) {
+          return toString.call(value) === "[object String]";
+        }
+        Is2.string = string2;
+        function number(value) {
+          return toString.call(value) === "[object Number]";
+        }
+        Is2.number = number;
+        function numberRange(value, min, max) {
+          return (
+            toString.call(value) === "[object Number]" &&
+            min <= value &&
+            value <= max
+          );
+        }
+        Is2.numberRange = numberRange;
+        function integer2(value) {
+          return (
+            toString.call(value) === "[object Number]" &&
+            -2147483648 <= value &&
+            value <= 2147483647
+          );
+        }
+        Is2.integer = integer2;
+        function uinteger2(value) {
+          return (
+            toString.call(value) === "[object Number]" &&
+            0 <= value &&
+            value <= 2147483647
+          );
+        }
+        Is2.uinteger = uinteger2;
+        function func(value) {
+          return toString.call(value) === "[object Function]";
+        }
+        Is2.func = func;
+        function objectLiteral(value) {
+          return value !== null && typeof value === "object";
+        }
+        Is2.objectLiteral = objectLiteral;
+        function typedArray(value, check2) {
+          return Array.isArray(value) && value.every(check2);
+        }
+        Is2.typedArray = typedArray;
+      })(Is || (Is = {}));
+      class CharacterStream {
+        constructor(sourceText) {
+          this.getStartOfToken = () => this._start;
+          this.getCurrentPosition = () => this._pos;
+          this.eol = () => this._sourceText.length === this._pos;
+          this.sol = () => this._pos === 0;
+          this.peek = () => {
+            return this._sourceText.charAt(this._pos)
+              ? this._sourceText.charAt(this._pos)
+              : null;
+          };
+          this.next = () => {
+            const char = this._sourceText.charAt(this._pos);
+            this._pos++;
+            return char;
+          };
+          this.eat = (pattern) => {
+            const isMatched = this._testNextCharacter(pattern);
+            if (isMatched) {
+              this._start = this._pos;
+              this._pos++;
+              return this._sourceText.charAt(this._pos - 1);
+            }
+            return void 0;
+          };
+          this.eatWhile = (match2) => {
+            let isMatched = this._testNextCharacter(match2);
+            let didEat = false;
+            if (isMatched) {
+              didEat = isMatched;
+              this._start = this._pos;
+            }
+            while (isMatched) {
+              this._pos++;
+              isMatched = this._testNextCharacter(match2);
+              didEat = true;
+            }
+            return didEat;
+          };
+          this.eatSpace = () => this.eatWhile(/[\s\u00a0]/);
+          this.skipToEnd = () => {
+            this._pos = this._sourceText.length;
+          };
+          this.skipTo = (position) => {
+            this._pos = position;
+          };
+          this.match = (pattern, consume = true, caseFold = false) => {
+            let token2 = null;
+            let match2 = null;
+            if (typeof pattern === "string") {
+              const regex2 = new RegExp(pattern, caseFold ? "i" : "g");
+              match2 = regex2.test(
+                this._sourceText.substr(this._pos, pattern.length)
+              );
+              token2 = pattern;
+            } else if (pattern instanceof RegExp) {
+              match2 = this._sourceText.slice(this._pos).match(pattern);
+              token2 = match2 && match2[0];
+            }
+            if (match2 != null) {
+              if (
+                typeof pattern === "string" ||
+                (match2 instanceof Array &&
+                  this._sourceText.startsWith(match2[0], this._pos))
+              ) {
+                if (consume) {
+                  this._start = this._pos;
+                  if (token2 && token2.length) {
+                    this._pos += token2.length;
+                  }
+                }
+                return match2;
+              }
+            }
+            return false;
+          };
+          this.backUp = (num2) => {
+            this._pos -= num2;
+          };
+          this.column = () => this._pos;
+          this.indentation = () => {
+            const match2 = this._sourceText.match(/\s*/);
+            let indent2 = 0;
+            if (match2 && match2.length !== 0) {
+              const whitespaces = match2[0];
+              let pos = 0;
+              while (whitespaces.length > pos) {
+                if (whitespaces.charCodeAt(pos) === 9) {
+                  indent2 += 2;
+                } else {
+                  indent2++;
+                }
+                pos++;
+              }
+            }
+            return indent2;
+          };
+          this.current = () => this._sourceText.slice(this._start, this._pos);
+          this._start = 0;
+          this._pos = 0;
+          this._sourceText = sourceText;
+        }
+        _testNextCharacter(pattern) {
+          const character = this._sourceText.charAt(this._pos);
+          let isMatched = false;
+          if (typeof pattern === "string") {
+            isMatched = character === pattern;
+          } else {
+            isMatched =
+              pattern instanceof RegExp
+                ? pattern.test(character)
+                : pattern(character);
+          }
+          return isMatched;
+        }
+      }
+      function opt(ofRule) {
+        return { ofRule };
+      }
+      function list$1(ofRule, separator2) {
+        return { ofRule, isList: true, separator: separator2 };
+      }
+      function butNot(rule, exclusions) {
+        const ruleMatch = rule.match;
+        rule.match = (token2) => {
+          let check2 = false;
+          if (ruleMatch) {
+            check2 = ruleMatch(token2);
+          }
+          return (
+            check2 &&
+            exclusions.every(
+              (exclusion) => exclusion.match && !exclusion.match(token2)
+            )
+          );
+        };
+        return rule;
+      }
+      function t(kind2, style) {
+        return { style, match: (token2) => token2.kind === kind2 };
+      }
+      function p(value, style) {
+        return {
+          style: style || "punctuation",
+          match: (token2) =>
+            token2.kind === "Punctuation" && token2.value === value,
+        };
+      }
+      const isIgnored = (ch2) =>
+        ch2 === " " ||
+        ch2 === "	" ||
+        ch2 === "," ||
+        ch2 === "\n" ||
+        ch2 === "\r" ||
+        ch2 === "\uFEFF" ||
+        ch2 === "\xA0";
+      const LexRules$2 = {
+        Name: /^[_A-Za-z][_0-9A-Za-z]*/,
+        Punctuation: /^(?:!|\$|\(|\)|\.\.\.|:|=|&|@|\[|]|\{|\||\})/,
+        Number: /^-?(?:0|(?:[1-9][0-9]*))(?:\.[0-9]*)?(?:[eE][+-]?[0-9]+)?/,
+        String:
+          /^(?:"""(?:\\"""|[^"]|"[^"]|""[^"])*(?:""")?|"(?:[^"\\]|\\(?:"|\/|\\|b|f|n|r|t|u[0-9a-fA-F]{4}))*"?)/,
+        Comment: /^#.*/,
+      };
+      const ParseRules$2 = {
+        Document: [list$1("Definition")],
+        Definition(token2) {
+          switch (token2.value) {
+            case "{":
+              return "ShortQuery";
+            case "query":
+              return "Query";
+            case "mutation":
+              return "Mutation";
+            case "subscription":
+              return "Subscription";
+            case "fragment":
+              return Kind.FRAGMENT_DEFINITION;
+            case "schema":
+              return "SchemaDef";
+            case "scalar":
+              return "ScalarDef";
+            case "type":
+              return "ObjectTypeDef";
+            case "interface":
+              return "InterfaceDef";
+            case "union":
+              return "UnionDef";
+            case "enum":
+              return "EnumDef";
+            case "input":
+              return "InputDef";
+            case "extend":
+              return "ExtendDef";
+            case "directive":
+              return "DirectiveDef";
+          }
+        },
+        ShortQuery: ["SelectionSet"],
+        Query: [
+          word("query"),
+          opt(name("def")),
+          opt("VariableDefinitions"),
+          list$1("Directive"),
+          "SelectionSet",
+        ],
+        Mutation: [
+          word("mutation"),
+          opt(name("def")),
+          opt("VariableDefinitions"),
+          list$1("Directive"),
+          "SelectionSet",
+        ],
+        Subscription: [
+          word("subscription"),
+          opt(name("def")),
+          opt("VariableDefinitions"),
+          list$1("Directive"),
+          "SelectionSet",
+        ],
+        VariableDefinitions: [p("("), list$1("VariableDefinition"), p(")")],
+        VariableDefinition: ["Variable", p(":"), "Type", opt("DefaultValue")],
+        Variable: [p("$", "variable"), name("variable")],
+        DefaultValue: [p("="), "Value"],
+        SelectionSet: [p("{"), list$1("Selection"), p("}")],
+        Selection(token2, stream) {
+          return token2.value === "..."
+            ? stream.match(/[\s\u00a0,]*(on\b|@|{)/, false)
+              ? "InlineFragment"
+              : "FragmentSpread"
+            : stream.match(/[\s\u00a0,]*:/, false)
+            ? "AliasedField"
+            : "Field";
+        },
+        AliasedField: [
+          name("property"),
+          p(":"),
+          name("qualifier"),
+          opt("Arguments"),
+          list$1("Directive"),
+          opt("SelectionSet"),
+        ],
+        Field: [
+          name("property"),
+          opt("Arguments"),
+          list$1("Directive"),
+          opt("SelectionSet"),
+        ],
+        Arguments: [p("("), list$1("Argument"), p(")")],
+        Argument: [name("attribute"), p(":"), "Value"],
+        FragmentSpread: [p("..."), name("def"), list$1("Directive")],
+        InlineFragment: [
+          p("..."),
+          opt("TypeCondition"),
+          list$1("Directive"),
+          "SelectionSet",
+        ],
+        FragmentDefinition: [
+          word("fragment"),
+          opt(butNot(name("def"), [word("on")])),
+          "TypeCondition",
+          list$1("Directive"),
+          "SelectionSet",
+        ],
+        TypeCondition: [word("on"), "NamedType"],
+        Value(token2) {
+          switch (token2.kind) {
+            case "Number":
+              return "NumberValue";
+            case "String":
+              return "StringValue";
+            case "Punctuation":
+              switch (token2.value) {
+                case "[":
+                  return "ListValue";
+                case "{":
+                  return "ObjectValue";
+                case "$":
+                  return "Variable";
+                case "&":
+                  return "NamedType";
+              }
+              return null;
+            case "Name":
+              switch (token2.value) {
+                case "true":
+                case "false":
+                  return "BooleanValue";
+              }
+              if (token2.value === "null") {
+                return "NullValue";
+              }
+              return "EnumValue";
+          }
+        },
+        NumberValue: [t("Number", "number")],
+        StringValue: [
+          {
+            style: "string",
+            match: (token2) => token2.kind === "String",
+            update(state, token2) {
+              if (token2.value.startsWith('"""')) {
+                state.inBlockstring = !token2.value.slice(3).endsWith('"""');
+              }
+            },
+          },
+        ],
+        BooleanValue: [t("Name", "builtin")],
+        NullValue: [t("Name", "keyword")],
+        EnumValue: [name("string-2")],
+        ListValue: [p("["), list$1("Value"), p("]")],
+        ObjectValue: [p("{"), list$1("ObjectField"), p("}")],
+        ObjectField: [name("attribute"), p(":"), "Value"],
+        Type(token2) {
+          return token2.value === "[" ? "ListType" : "NonNullType";
+        },
+        ListType: [p("["), "Type", p("]"), opt(p("!"))],
+        NonNullType: ["NamedType", opt(p("!"))],
+        NamedType: [type("atom")],
+        Directive: [p("@", "meta"), name("meta"), opt("Arguments")],
+        DirectiveDef: [
+          word("directive"),
+          p("@", "meta"),
+          name("meta"),
+          opt("ArgumentsDef"),
+          word("on"),
+          list$1("DirectiveLocation", p("|")),
+        ],
+        InterfaceDef: [
+          word("interface"),
+          name("atom"),
+          opt("Implements"),
+          list$1("Directive"),
+          p("{"),
+          list$1("FieldDef"),
+          p("}"),
+        ],
+        Implements: [word("implements"), list$1("NamedType", p("&"))],
+        DirectiveLocation: [name("string-2")],
+        SchemaDef: [
+          word("schema"),
+          list$1("Directive"),
+          p("{"),
+          list$1("OperationTypeDef"),
+          p("}"),
+        ],
+        OperationTypeDef: [name("keyword"), p(":"), name("atom")],
+        ScalarDef: [word("scalar"), name("atom"), list$1("Directive")],
+        ObjectTypeDef: [
+          word("type"),
+          name("atom"),
+          opt("Implements"),
+          list$1("Directive"),
+          p("{"),
+          list$1("FieldDef"),
+          p("}"),
+        ],
+        FieldDef: [
+          name("property"),
+          opt("ArgumentsDef"),
+          p(":"),
+          "Type",
+          list$1("Directive"),
+        ],
+        ArgumentsDef: [p("("), list$1("InputValueDef"), p(")")],
+        InputValueDef: [
+          name("attribute"),
+          p(":"),
+          "Type",
+          opt("DefaultValue"),
+          list$1("Directive"),
+        ],
+        UnionDef: [
+          word("union"),
+          name("atom"),
+          list$1("Directive"),
+          p("="),
+          list$1("UnionMember", p("|")),
+        ],
+        UnionMember: ["NamedType"],
+        EnumDef: [
+          word("enum"),
+          name("atom"),
+          list$1("Directive"),
+          p("{"),
+          list$1("EnumValueDef"),
+          p("}"),
+        ],
+        EnumValueDef: [name("string-2"), list$1("Directive")],
+        InputDef: [
+          word("input"),
+          name("atom"),
+          list$1("Directive"),
+          p("{"),
+          list$1("InputValueDef"),
+          p("}"),
+        ],
+        ExtendDef: [word("extend"), "ObjectTypeDef"],
+      };
+      function word(value) {
+        return {
+          style: "keyword",
+          match: (token2) => token2.kind === "Name" && token2.value === value,
+        };
+      }
+      function name(style) {
+        return {
+          style,
+          match: (token2) => token2.kind === "Name",
+          update(state, token2) {
+            state.name = token2.value;
+          },
+        };
+      }
+      function type(style) {
+        return {
+          style,
+          match: (token2) => token2.kind === "Name",
+          update(state, token2) {
+            if (state.prevState && state.prevState.prevState) {
+              state.name = token2.value;
+              state.prevState.prevState.type = token2.value;
+            }
+          },
+        };
+      }
+      function onlineParser(
+        options = {
+          eatWhitespace: (stream) => stream.eatWhile(isIgnored),
+          lexRules: LexRules$2,
+          parseRules: ParseRules$2,
+          editorConfig: {},
+        }
+      ) {
+        return {
+          startState() {
+            const initialState = {
+              level: 0,
+              step: 0,
+              name: null,
+              kind: null,
+              type: null,
+              rule: null,
+              needsSeperator: false,
+              prevState: null,
+            };
+            pushRule(options.parseRules, initialState, Kind.DOCUMENT);
+            return initialState;
+          },
+          token(stream, state) {
+            return getToken(stream, state, options);
+          },
+        };
+      }
+      function getToken(stream, state, options) {
+        if (state.inBlockstring) {
+          if (stream.match(/.*"""/)) {
+            state.inBlockstring = false;
+            return "string";
+          } else {
+            stream.skipToEnd();
+            return "string";
+          }
+        }
+        const { lexRules, parseRules, eatWhitespace, editorConfig } = options;
+        if (state.rule && state.rule.length === 0) {
+          popRule(state);
+        } else if (state.needsAdvance) {
+          state.needsAdvance = false;
+          advanceRule(state, true);
+        }
+        if (stream.sol()) {
+          const tabSize = (editorConfig && editorConfig.tabSize) || 2;
+          state.indentLevel = Math.floor(stream.indentation() / tabSize);
+        }
+        if (eatWhitespace(stream)) {
+          return "ws";
+        }
+        const token2 = lex$1(lexRules, stream);
+        if (!token2) {
+          const matchedSomething = stream.match(/\S+/);
+          if (!matchedSomething) {
+            stream.match(/\s/);
+          }
+          pushRule(SpecialParseRules, state, "Invalid");
+          return "invalidchar";
+        }
+        if (token2.kind === "Comment") {
+          pushRule(SpecialParseRules, state, "Comment");
+          return "comment";
+        }
+        const backupState = assign$2({}, state);
+        if (token2.kind === "Punctuation") {
+          if (/^[{([]/.test(token2.value)) {
+            if (state.indentLevel !== void 0) {
+              state.levels = (state.levels || []).concat(state.indentLevel + 1);
+            }
+          } else if (/^[})\]]/.test(token2.value)) {
+            const levels = (state.levels = (state.levels || []).slice(0, -1));
+            if (state.indentLevel) {
+              if (
+                levels.length > 0 &&
+                levels[levels.length - 1] < state.indentLevel
+              ) {
+                state.indentLevel = levels[levels.length - 1];
+              }
+            }
+          }
+        }
+        while (state.rule) {
+          let expected =
+            typeof state.rule === "function"
+              ? state.step === 0
+                ? state.rule(token2, stream)
+                : null
+              : state.rule[state.step];
+          if (state.needsSeperator) {
+            expected =
+              expected && (expected == null ? void 0 : expected.separator);
+          }
+          if (expected) {
+            if (expected.ofRule) {
+              expected = expected.ofRule;
+            }
+            if (typeof expected === "string") {
+              pushRule(parseRules, state, expected);
+              continue;
+            }
+            if (expected.match && expected.match(token2)) {
+              if (expected.update) {
+                expected.update(state, token2);
+              }
+              if (token2.kind === "Punctuation") {
+                advanceRule(state, true);
+              } else {
+                state.needsAdvance = true;
+              }
+              return expected.style;
+            }
+          }
+          unsuccessful(state);
+        }
+        assign$2(state, backupState);
+        pushRule(SpecialParseRules, state, "Invalid");
+        return "invalidchar";
+      }
+      function assign$2(to, from) {
+        const keys = Object.keys(from);
+        for (let i = 0; i < keys.length; i++) {
+          to[keys[i]] = from[keys[i]];
+        }
+        return to;
+      }
+      const SpecialParseRules = {
+        Invalid: [],
+        Comment: [],
+      };
+      function pushRule(rules, state, ruleKind) {
+        if (!rules[ruleKind]) {
+          throw new TypeError("Unknown rule: " + ruleKind);
+        }
+        state.prevState = __spreadValues({}, state);
+        state.kind = ruleKind;
+        state.name = null;
+        state.type = null;
+        state.rule = rules[ruleKind];
+        state.step = 0;
+        state.needsSeperator = false;
+      }
+      function popRule(state) {
+        if (!state.prevState) {
+          return;
+        }
+        state.kind = state.prevState.kind;
+        state.name = state.prevState.name;
+        state.type = state.prevState.type;
+        state.rule = state.prevState.rule;
+        state.step = state.prevState.step;
+        state.needsSeperator = state.prevState.needsSeperator;
+        state.prevState = state.prevState.prevState;
+      }
+      function advanceRule(state, successful) {
+        if (isList(state) && state.rule) {
+          const step = state.rule[state.step];
+          if (step.separator) {
+            const separator2 = step.separator;
+            state.needsSeperator = !state.needsSeperator;
+            if (!state.needsSeperator && separator2.ofRule) {
+              return;
+            }
+          }
+          if (successful) {
+            return;
+          }
+        }
+        state.needsSeperator = false;
+        state.step++;
+        while (
+          state.rule &&
+          !(Array.isArray(state.rule) && state.step < state.rule.length)
+        ) {
+          popRule(state);
+          if (state.rule) {
+            if (isList(state)) {
+              if (state.rule && state.rule[state.step].separator) {
+                state.needsSeperator = !state.needsSeperator;
+              }
+            } else {
+              state.needsSeperator = false;
+              state.step++;
+            }
+          }
+        }
+      }
+      function isList(state) {
+        const step =
+          Array.isArray(state.rule) &&
+          typeof state.rule[state.step] !== "string" &&
+          state.rule[state.step];
+        return step && step.isList;
+      }
+      function unsuccessful(state) {
+        while (
+          state.rule &&
+          !(Array.isArray(state.rule) && state.rule[state.step].ofRule)
+        ) {
+          popRule(state);
+        }
+        if (state.rule) {
+          advanceRule(state, false);
+        }
+      }
+      function lex$1(lexRules, stream) {
+        const kinds = Object.keys(lexRules);
+        for (let i = 0; i < kinds.length; i++) {
+          const match2 = stream.match(lexRules[kinds[i]]);
+          if (match2 && match2 instanceof Array) {
+            return { kind: kinds[i], value: match2[0] };
+          }
+        }
+      }
+      const AdditionalRuleKinds = {
+        ALIASED_FIELD: "AliasedField",
+        ARGUMENTS: "Arguments",
+        SHORT_QUERY: "ShortQuery",
+        QUERY: "Query",
+        MUTATION: "Mutation",
+        SUBSCRIPTION: "Subscription",
+        TYPE_CONDITION: "TypeCondition",
+        INVALID: "Invalid",
+        COMMENT: "Comment",
+        SCHEMA_DEF: "SchemaDef",
+        SCALAR_DEF: "ScalarDef",
+        OBJECT_TYPE_DEF: "ObjectTypeDef",
+        OBJECT_VALUE: "ObjectValue",
+        LIST_VALUE: "ListValue",
+        INTERFACE_DEF: "InterfaceDef",
+        UNION_DEF: "UnionDef",
+        ENUM_DEF: "EnumDef",
+        ENUM_VALUE: "EnumValue",
+        FIELD_DEF: "FieldDef",
+        INPUT_DEF: "InputDef",
+        INPUT_VALUE_DEF: "InputValueDef",
+        ARGUMENTS_DEF: "ArgumentsDef",
+        EXTEND_DEF: "ExtendDef",
+        DIRECTIVE_DEF: "DirectiveDef",
+        IMPLEMENTS: "Implements",
+        VARIABLE_DEFINITIONS: "VariableDefinitions",
+        TYPE: "Type",
+      };
+      const RuleKinds = __spreadValues(
+        __spreadValues({}, Kind),
+        AdditionalRuleKinds
+      );
+      const SuggestionCommand = {
+        command: "editor.action.triggerSuggest",
+        title: "Suggestions",
+      };
+      const collectFragmentDefs = (op) => {
+        const externalFragments = [];
+        if (op) {
+          visit(parse$1(op), {
+            FragmentDefinition(def) {
+              externalFragments.push(def);
+            },
+          });
+        }
+        return externalFragments;
+      };
+      function getAutocompleteSuggestions(
+        schema,
+        queryText,
+        cursor,
+        contextToken,
+        fragmentDefs,
+        options
+      ) {
+        var _a2;
+        const opts = __spreadProps(__spreadValues({}, options), {
+          schema,
+        });
+        const token2 = contextToken || getTokenAtPosition(queryText, cursor);
+        const state =
+          token2.state.kind === "Invalid"
+            ? token2.state.prevState
+            : token2.state;
+        if (!state) {
+          return [];
+        }
+        const kind2 = state.kind;
+        const step = state.step;
+        const typeInfo = getTypeInfo$3(schema, token2.state);
+        if (kind2 === RuleKinds.DOCUMENT) {
+          return hintList$2(token2, [
+            { label: "query", kind: CompletionItemKind$1.Function },
+            { label: "mutation", kind: CompletionItemKind$1.Function },
+            { label: "subscription", kind: CompletionItemKind$1.Function },
+            { label: "fragment", kind: CompletionItemKind$1.Function },
+            { label: "{", kind: CompletionItemKind$1.Constructor },
+          ]);
+        }
+        if (
+          kind2 === RuleKinds.IMPLEMENTS ||
+          (kind2 === RuleKinds.NAMED_TYPE &&
+            ((_a2 = state.prevState) == null ? void 0 : _a2.kind) ===
+              RuleKinds.IMPLEMENTS)
+        ) {
+          return getSuggestionsForImplements(
+            token2,
+            state,
+            schema,
+            queryText,
+            typeInfo
+          );
+        }
+        if (
+          kind2 === RuleKinds.SELECTION_SET ||
+          kind2 === RuleKinds.FIELD ||
+          kind2 === RuleKinds.ALIASED_FIELD
+        ) {
+          return getSuggestionsForFieldNames(token2, typeInfo, opts);
+        }
+        if (
+          kind2 === RuleKinds.ARGUMENTS ||
+          (kind2 === RuleKinds.ARGUMENT && step === 0)
+        ) {
+          const argDefs = typeInfo.argDefs;
+          if (argDefs) {
+            return hintList$2(
+              token2,
+              argDefs.map((argDef) => {
+                var _a3;
+                return {
+                  label: argDef.name,
+                  insertText: argDef.name + ": ",
+                  command: SuggestionCommand,
+                  detail: String(argDef.type),
+                  documentation:
+                    (_a3 = argDef.description) != null ? _a3 : void 0,
+                  kind: CompletionItemKind$1.Variable,
+                  type: argDef.type,
+                };
+              })
+            );
+          }
+        }
+        if (
+          kind2 === RuleKinds.OBJECT_VALUE ||
+          (kind2 === RuleKinds.OBJECT_FIELD && step === 0)
+        ) {
+          if (typeInfo.objectFieldDefs) {
+            const objectFields = objectValues(typeInfo.objectFieldDefs);
+            const completionKind =
+              kind2 === RuleKinds.OBJECT_VALUE
+                ? CompletionItemKind$1.Value
+                : CompletionItemKind$1.Field;
+            return hintList$2(
+              token2,
+              objectFields.map((field) => {
+                var _a3;
+                return {
+                  label: field.name,
+                  detail: String(field.type),
+                  documentation:
+                    (_a3 = field.description) != null ? _a3 : void 0,
+                  kind: completionKind,
+                  type: field.type,
+                };
+              })
+            );
+          }
+        }
+        if (
+          kind2 === RuleKinds.ENUM_VALUE ||
+          (kind2 === RuleKinds.LIST_VALUE && step === 1) ||
+          (kind2 === RuleKinds.OBJECT_FIELD && step === 2) ||
+          (kind2 === RuleKinds.ARGUMENT && step === 2)
+        ) {
+          return getSuggestionsForInputValues(
+            token2,
+            typeInfo,
+            queryText,
+            schema
+          );
+        }
+        if (kind2 === RuleKinds.VARIABLE && step === 1) {
+          const namedInputType = getNamedType(typeInfo.inputType);
+          const variableDefinitions = getVariableCompletions(
+            queryText,
+            schema,
+            token2
+          );
+          return hintList$2(
+            token2,
+            variableDefinitions.filter(
+              (v2) =>
+                v2.detail ===
+                (namedInputType == null ? void 0 : namedInputType.name)
+            )
+          );
+        }
+        if (
+          (kind2 === RuleKinds.TYPE_CONDITION && step === 1) ||
+          (kind2 === RuleKinds.NAMED_TYPE &&
+            state.prevState != null &&
+            state.prevState.kind === RuleKinds.TYPE_CONDITION)
+        ) {
+          return getSuggestionsForFragmentTypeConditions(
+            token2,
+            typeInfo,
+            schema
+          );
+        }
+        if (kind2 === RuleKinds.FRAGMENT_SPREAD && step === 1) {
+          return getSuggestionsForFragmentSpread(
+            token2,
+            typeInfo,
+            schema,
+            queryText,
+            Array.isArray(fragmentDefs)
+              ? fragmentDefs
+              : collectFragmentDefs(fragmentDefs)
+          );
+        }
+        if (
+          (kind2 === RuleKinds.VARIABLE_DEFINITION && step === 2) ||
+          (kind2 === RuleKinds.LIST_TYPE && step === 1) ||
+          (kind2 === RuleKinds.NAMED_TYPE &&
+            state.prevState &&
+            (state.prevState.kind === RuleKinds.VARIABLE_DEFINITION ||
+              state.prevState.kind === RuleKinds.LIST_TYPE ||
+              state.prevState.kind === RuleKinds.NON_NULL_TYPE))
+        ) {
+          return getSuggestionsForVariableDefinition(token2, schema);
+        }
+        if (kind2 === RuleKinds.DIRECTIVE) {
+          return getSuggestionsForDirective(token2, state, schema);
+        }
+        return [];
+      }
+      const insertSuffix = ` {
+  $1
+}`;
+      const getInsertText = (field) => {
+        const type2 = field.type;
+        if (isCompositeType(type2)) {
+          return insertSuffix;
+        }
+        if (isListType(type2) && isCompositeType(type2.ofType)) {
+          return insertSuffix;
+        }
+        if (isNonNullType(type2)) {
+          if (isCompositeType(type2.ofType)) {
+            return insertSuffix;
+          }
+          if (
+            isListType(type2.ofType) &&
+            isCompositeType(type2.ofType.ofType)
+          ) {
+            return insertSuffix;
+          }
+        }
+        return null;
+      };
+      function getSuggestionsForFieldNames(token2, typeInfo, options) {
+        var _a2;
+        if (typeInfo.parentType) {
+          const parentType = typeInfo.parentType;
+          let fields = [];
+          if ("getFields" in parentType) {
+            fields = objectValues(parentType.getFields());
+          }
+          if (isCompositeType(parentType)) {
+            fields.push(TypeNameMetaFieldDef);
+          }
+          if (
+            parentType ===
+            ((_a2 = options == null ? void 0 : options.schema) == null
+              ? void 0
+              : _a2.getQueryType())
+          ) {
+            fields.push(SchemaMetaFieldDef$1, TypeMetaFieldDef$1);
+          }
+          return hintList$2(
+            token2,
+            fields.map((field, index) => {
+              var _a3;
+              const suggestion = {
+                sortText: String(index) + field.name,
+                label: field.name,
+                detail: String(field.type),
+                documentation: (_a3 = field.description) != null ? _a3 : void 0,
+                deprecated: Boolean(field.deprecationReason),
+                isDeprecated: Boolean(field.deprecationReason),
+                deprecationReason: field.deprecationReason,
+                kind: CompletionItemKind$1.Field,
+                type: field.type,
+              };
+              const insertText = getInsertText(field);
+              if (insertText) {
+                suggestion.insertText = field.name + insertText;
+                suggestion.insertTextFormat = InsertTextFormat.Snippet;
+                suggestion.command = SuggestionCommand;
+              }
+              return suggestion;
+            })
+          );
+        }
+        return [];
+      }
+      function getSuggestionsForInputValues(
+        token2,
+        typeInfo,
+        queryText,
+        schema
+      ) {
+        const namedInputType = getNamedType(typeInfo.inputType);
+        const queryVariables = getVariableCompletions(
+          queryText,
+          schema,
+          token2
+        ).filter((v2) => v2.detail === namedInputType.name);
+        if (namedInputType instanceof GraphQLEnumType) {
+          const values = namedInputType.getValues();
+          return hintList$2(
+            token2,
+            values
+              .map((value) => {
+                var _a2;
+                return {
+                  label: value.name,
+                  detail: String(namedInputType),
+                  documentation:
+                    (_a2 = value.description) != null ? _a2 : void 0,
+                  deprecated: Boolean(value.deprecationReason),
+                  isDeprecated: Boolean(value.deprecationReason),
+                  deprecationReason: value.deprecationReason,
+                  kind: CompletionItemKind$1.EnumMember,
+                  type: namedInputType,
+                };
+              })
+              .concat(queryVariables)
+          );
+        } else if (namedInputType === GraphQLBoolean) {
+          return hintList$2(
+            token2,
+            queryVariables.concat([
+              {
+                label: "true",
+                detail: String(GraphQLBoolean),
+                documentation: "Not false.",
+                kind: CompletionItemKind$1.Variable,
+                type: GraphQLBoolean,
+              },
+              {
+                label: "false",
+                detail: String(GraphQLBoolean),
+                documentation: "Not true.",
+                kind: CompletionItemKind$1.Variable,
+                type: GraphQLBoolean,
+              },
+            ])
+          );
+        }
+        return queryVariables;
+      }
+      function getSuggestionsForImplements(
+        token2,
+        tokenState,
+        schema,
+        documentText,
+        typeInfo
+      ) {
+        if (tokenState.needsSeperator) {
+          return [];
+        }
+        const typeMap = schema.getTypeMap();
+        const schemaInterfaces = objectValues(typeMap).filter(isInterfaceType);
+        const schemaInterfaceNames = schemaInterfaces.map(
+          ({ name: name2 }) => name2
+        );
+        const inlineInterfaces = /* @__PURE__ */ new Set();
+        runOnlineParser(documentText, (_, state) => {
+          var _a2, _b, _c, _d, _e;
+          if (state.name) {
+            if (
+              state.kind === RuleKinds.INTERFACE_DEF &&
+              !schemaInterfaceNames.includes(state.name)
+            ) {
+              inlineInterfaces.add(state.name);
+            }
+            if (
+              state.kind === RuleKinds.NAMED_TYPE &&
+              ((_a2 = state.prevState) == null ? void 0 : _a2.kind) ===
+                RuleKinds.IMPLEMENTS
+            ) {
+              if (typeInfo.interfaceDef) {
+                const existingType =
+                  (_b = typeInfo.interfaceDef) == null
+                    ? void 0
+                    : _b
+                        .getInterfaces()
+                        .find(({ name: name2 }) => name2 === state.name);
+                if (existingType) {
+                  return;
+                }
+                const type2 = schema.getType(state.name);
+                const interfaceConfig =
+                  (_c = typeInfo.interfaceDef) == null ? void 0 : _c.toConfig();
+                typeInfo.interfaceDef = new GraphQLInterfaceType(
+                  __spreadProps(__spreadValues({}, interfaceConfig), {
+                    interfaces: [
+                      ...interfaceConfig.interfaces,
+                      type2 ||
+                        new GraphQLInterfaceType({
+                          name: state.name,
+                          fields: {},
+                        }),
+                    ],
+                  })
+                );
+              } else if (typeInfo.objectTypeDef) {
+                const existingType =
+                  (_d = typeInfo.objectTypeDef) == null
+                    ? void 0
+                    : _d
+                        .getInterfaces()
+                        .find(({ name: name2 }) => name2 === state.name);
+                if (existingType) {
+                  return;
+                }
+                const type2 = schema.getType(state.name);
+                const objectTypeConfig =
+                  (_e = typeInfo.objectTypeDef) == null
+                    ? void 0
+                    : _e.toConfig();
+                typeInfo.objectTypeDef = new GraphQLObjectType(
+                  __spreadProps(__spreadValues({}, objectTypeConfig), {
+                    interfaces: [
+                      ...objectTypeConfig.interfaces,
+                      type2 ||
+                        new GraphQLInterfaceType({
+                          name: state.name,
+                          fields: {},
+                        }),
+                    ],
+                  })
+                );
+              }
+            }
+          }
+        });
+        const currentTypeToExtend =
+          typeInfo.interfaceDef || typeInfo.objectTypeDef;
+        const siblingInterfaces =
+          (currentTypeToExtend == null
+            ? void 0
+            : currentTypeToExtend.getInterfaces()) || [];
+        const siblingInterfaceNames = siblingInterfaces.map(
+          ({ name: name2 }) => name2
+        );
+        const possibleInterfaces = schemaInterfaces
+          .concat([...inlineInterfaces].map((name2) => ({ name: name2 })))
+          .filter(
+            ({ name: name2 }) =>
+              name2 !==
+                (currentTypeToExtend == null
+                  ? void 0
+                  : currentTypeToExtend.name) &&
+              !siblingInterfaceNames.includes(name2)
+          );
+        return hintList$2(
+          token2,
+          possibleInterfaces.map((type2) => {
+            const result2 = {
+              label: type2.name,
+              kind: CompletionItemKind$1.Interface,
+              type: type2,
+            };
+            if (type2 == null ? void 0 : type2.description) {
+              result2.documentation = type2.description;
+            }
+            return result2;
+          })
+        );
+      }
+      function getSuggestionsForFragmentTypeConditions(
+        token2,
+        typeInfo,
+        schema,
+        _kind
+      ) {
+        let possibleTypes;
+        if (typeInfo.parentType) {
+          if (isAbstractType(typeInfo.parentType)) {
+            const abstractType = assertAbstractType(typeInfo.parentType);
+            const possibleObjTypes = schema.getPossibleTypes(abstractType);
+            const possibleIfaceMap = /* @__PURE__ */ Object.create(null);
+            possibleObjTypes.forEach((type2) => {
+              type2.getInterfaces().forEach((iface) => {
+                possibleIfaceMap[iface.name] = iface;
+              });
+            });
+            possibleTypes = possibleObjTypes.concat(
+              objectValues(possibleIfaceMap)
+            );
+          } else {
+            possibleTypes = [typeInfo.parentType];
+          }
+        } else {
+          const typeMap = schema.getTypeMap();
+          possibleTypes = objectValues(typeMap).filter(isCompositeType);
+        }
+        return hintList$2(
+          token2,
+          possibleTypes.map((type2) => {
+            const namedType = getNamedType(type2);
+            return {
+              label: String(type2),
+              documentation: (namedType && namedType.description) || "",
+              kind: CompletionItemKind$1.Field,
+            };
+          })
+        );
+      }
+      function getSuggestionsForFragmentSpread(
+        token2,
+        typeInfo,
+        schema,
+        queryText,
+        fragmentDefs
+      ) {
+        if (!queryText) {
+          return [];
+        }
+        const typeMap = schema.getTypeMap();
+        const defState = getDefinitionState(token2.state);
+        const fragments = getFragmentDefinitions(queryText);
+        if (fragmentDefs && fragmentDefs.length > 0) {
+          fragments.push(...fragmentDefs);
+        }
+        const relevantFrags = fragments.filter(
+          (frag) =>
+            typeMap[frag.typeCondition.name.value] &&
+            !(
+              defState &&
+              defState.kind === RuleKinds.FRAGMENT_DEFINITION &&
+              defState.name === frag.name.value
+            ) &&
+            isCompositeType(typeInfo.parentType) &&
+            isCompositeType(typeMap[frag.typeCondition.name.value]) &&
+            doTypesOverlap(
+              schema,
+              typeInfo.parentType,
+              typeMap[frag.typeCondition.name.value]
+            )
+        );
+        return hintList$2(
+          token2,
+          relevantFrags.map((frag) => ({
+            label: frag.name.value,
+            detail: String(typeMap[frag.typeCondition.name.value]),
+            documentation: `fragment ${frag.name.value} on ${frag.typeCondition.name.value}`,
+            kind: CompletionItemKind$1.Field,
+            type: typeMap[frag.typeCondition.name.value],
+          }))
+        );
+      }
+      const getParentDefinition = (state, kind2) => {
+        var _a2, _b, _c, _d, _e, _f, _g, _h, _i, _j;
+        if (((_a2 = state.prevState) == null ? void 0 : _a2.kind) === kind2) {
+          return state.prevState;
+        }
+        if (
+          ((_c = (_b = state.prevState) == null ? void 0 : _b.prevState) == null
+            ? void 0
+            : _c.kind) === kind2
+        ) {
+          return state.prevState.prevState;
+        }
+        if (
+          ((_f =
+            (_e = (_d = state.prevState) == null ? void 0 : _d.prevState) ==
+            null
+              ? void 0
+              : _e.prevState) == null
+            ? void 0
+            : _f.kind) === kind2
+        ) {
+          return state.prevState.prevState.prevState;
+        }
+        if (
+          ((_j =
+            (_i =
+              (_h = (_g = state.prevState) == null ? void 0 : _g.prevState) ==
+              null
+                ? void 0
+                : _h.prevState) == null
+              ? void 0
+              : _i.prevState) == null
+            ? void 0
+            : _j.kind) === kind2
+        ) {
+          return state.prevState.prevState.prevState.prevState;
+        }
+      };
+      function getVariableCompletions(queryText, schema, token2) {
+        let variableName = null;
+        let variableType;
+        const definitions = /* @__PURE__ */ Object.create({});
+        runOnlineParser(queryText, (_, state) => {
+          if (
+            (state == null ? void 0 : state.kind) === RuleKinds.VARIABLE &&
+            state.name
+          ) {
+            variableName = state.name;
+          }
+          if (
+            (state == null ? void 0 : state.kind) === RuleKinds.NAMED_TYPE &&
+            variableName
+          ) {
+            const parentDefinition = getParentDefinition(state, RuleKinds.TYPE);
+            if (parentDefinition == null ? void 0 : parentDefinition.type) {
+              variableType = schema.getType(
+                parentDefinition == null ? void 0 : parentDefinition.type
+              );
+            }
+          }
+          if (variableName && variableType) {
+            if (!definitions[variableName]) {
+              definitions[variableName] = {
+                detail: variableType.toString(),
+                insertText:
+                  token2.string === "$" ? variableName : "$" + variableName,
+                label: variableName,
+                type: variableType,
+                kind: CompletionItemKind$1.Variable,
+              };
+              variableName = null;
+              variableType = null;
+            }
+          }
+        });
+        return objectValues(definitions);
+      }
+      function getFragmentDefinitions(queryText) {
+        const fragmentDefs = [];
+        runOnlineParser(queryText, (_, state) => {
+          if (
+            state.kind === RuleKinds.FRAGMENT_DEFINITION &&
+            state.name &&
+            state.type
+          ) {
+            fragmentDefs.push({
+              kind: RuleKinds.FRAGMENT_DEFINITION,
+              name: {
+                kind: Kind.NAME,
+                value: state.name,
+              },
+              selectionSet: {
+                kind: RuleKinds.SELECTION_SET,
+                selections: [],
+              },
+              typeCondition: {
+                kind: RuleKinds.NAMED_TYPE,
+                name: {
+                  kind: Kind.NAME,
+                  value: state.type,
+                },
+              },
+            });
+          }
+        });
+        return fragmentDefs;
+      }
+      function getSuggestionsForVariableDefinition(token2, schema, _kind) {
+        const inputTypeMap = schema.getTypeMap();
+        const inputTypes = objectValues(inputTypeMap).filter(isInputType);
+        return hintList$2(
+          token2,
+          inputTypes.map((type2) => ({
+            label: type2.name,
+            documentation: type2.description,
+            kind: CompletionItemKind$1.Variable,
+          }))
+        );
+      }
+      function getSuggestionsForDirective(token2, state, schema, _kind) {
+        if (state.prevState && state.prevState.kind) {
+          const directives = schema
+            .getDirectives()
+            .filter((directive) => canUseDirective(state.prevState, directive));
+          return hintList$2(
+            token2,
+            directives.map((directive) => ({
+              label: directive.name,
+              documentation: directive.description || "",
+              kind: CompletionItemKind$1.Function,
+            }))
+          );
+        }
+        return [];
+      }
+      function getTokenAtPosition(queryText, cursor) {
+        let styleAtCursor = null;
+        let stateAtCursor = null;
+        let stringAtCursor = null;
+        const token2 = runOnlineParser(
+          queryText,
+          (stream, state, style, index) => {
+            if (index === cursor.line) {
+              if (stream.getCurrentPosition() >= cursor.character) {
+                styleAtCursor = style;
+                stateAtCursor = __spreadValues({}, state);
+                stringAtCursor = stream.current();
+                return "BREAK";
+              }
+            }
+          }
+        );
+        return {
+          start: token2.start,
+          end: token2.end,
+          string: stringAtCursor || token2.string,
+          state: stateAtCursor || token2.state,
+          style: styleAtCursor || token2.style,
+        };
+      }
+      function runOnlineParser(queryText, callback) {
+        const lines = queryText.split("\n");
+        const parser = onlineParser();
+        let state = parser.startState();
+        let style = "";
+        let stream = new CharacterStream("");
+        for (let i = 0; i < lines.length; i++) {
+          stream = new CharacterStream(lines[i]);
+          while (!stream.eol()) {
+            style = parser.token(stream, state);
+            const code3 = callback(stream, state, style, i);
+            if (code3 === "BREAK") {
+              break;
+            }
+          }
+          callback(stream, state, style, i);
+          if (!state.kind) {
+            state = parser.startState();
+          }
+        }
+        return {
+          start: stream.getStartOfToken(),
+          end: stream.getCurrentPosition(),
+          string: stream.current(),
+          state,
+          style,
+        };
+      }
+      function canUseDirective(state, directive) {
+        if (!state || !state.kind) {
+          return false;
+        }
+        const kind2 = state.kind;
+        const locations = directive.locations;
+        switch (kind2) {
+          case RuleKinds.QUERY:
+            return locations.indexOf(DirectiveLocation.QUERY) !== -1;
+          case RuleKinds.MUTATION:
+            return locations.indexOf(DirectiveLocation.MUTATION) !== -1;
+          case RuleKinds.SUBSCRIPTION:
+            return locations.indexOf(DirectiveLocation.SUBSCRIPTION) !== -1;
+          case RuleKinds.FIELD:
+          case RuleKinds.ALIASED_FIELD:
+            return locations.indexOf(DirectiveLocation.FIELD) !== -1;
+          case RuleKinds.FRAGMENT_DEFINITION:
+            return (
+              locations.indexOf(DirectiveLocation.FRAGMENT_DEFINITION) !== -1
+            );
+          case RuleKinds.FRAGMENT_SPREAD:
+            return locations.indexOf(DirectiveLocation.FRAGMENT_SPREAD) !== -1;
+          case RuleKinds.INLINE_FRAGMENT:
+            return locations.indexOf(DirectiveLocation.INLINE_FRAGMENT) !== -1;
+          case RuleKinds.SCHEMA_DEF:
+            return locations.indexOf(DirectiveLocation.SCHEMA) !== -1;
+          case RuleKinds.SCALAR_DEF:
+            return locations.indexOf(DirectiveLocation.SCALAR) !== -1;
+          case RuleKinds.OBJECT_TYPE_DEF:
+            return locations.indexOf(DirectiveLocation.OBJECT) !== -1;
+          case RuleKinds.FIELD_DEF:
+            return locations.indexOf(DirectiveLocation.FIELD_DEFINITION) !== -1;
+          case RuleKinds.INTERFACE_DEF:
+            return locations.indexOf(DirectiveLocation.INTERFACE) !== -1;
+          case RuleKinds.UNION_DEF:
+            return locations.indexOf(DirectiveLocation.UNION) !== -1;
+          case RuleKinds.ENUM_DEF:
+            return locations.indexOf(DirectiveLocation.ENUM) !== -1;
+          case RuleKinds.ENUM_VALUE:
+            return locations.indexOf(DirectiveLocation.ENUM_VALUE) !== -1;
+          case RuleKinds.INPUT_DEF:
+            return locations.indexOf(DirectiveLocation.INPUT_OBJECT) !== -1;
+          case RuleKinds.INPUT_VALUE_DEF:
+            const prevStateKind = state.prevState && state.prevState.kind;
+            switch (prevStateKind) {
+              case RuleKinds.ARGUMENTS_DEF:
+                return (
+                  locations.indexOf(DirectiveLocation.ARGUMENT_DEFINITION) !==
+                  -1
+                );
+              case RuleKinds.INPUT_DEF:
+                return (
+                  locations.indexOf(
+                    DirectiveLocation.INPUT_FIELD_DEFINITION
+                  ) !== -1
+                );
+            }
+        }
+        return false;
+      }
+      function getTypeInfo$3(schema, tokenState) {
+        let argDef;
+        let argDefs;
+        let directiveDef;
+        let enumValue;
+        let fieldDef;
+        let inputType;
+        let objectTypeDef;
+        let objectFieldDefs;
+        let parentType;
+        let type2;
+        let interfaceDef;
+        forEachState$2(tokenState, (state) => {
+          switch (state.kind) {
+            case RuleKinds.QUERY:
+            case "ShortQuery":
+              type2 = schema.getQueryType();
+              break;
+            case RuleKinds.MUTATION:
+              type2 = schema.getMutationType();
+              break;
+            case RuleKinds.SUBSCRIPTION:
+              type2 = schema.getSubscriptionType();
+              break;
+            case RuleKinds.INLINE_FRAGMENT:
+            case RuleKinds.FRAGMENT_DEFINITION:
+              if (state.type) {
+                type2 = schema.getType(state.type);
+              }
+              break;
+            case RuleKinds.FIELD:
+            case RuleKinds.ALIASED_FIELD: {
+              if (!type2 || !state.name) {
+                fieldDef = null;
+              } else {
+                fieldDef = parentType
+                  ? getFieldDef$1(schema, parentType, state.name)
+                  : null;
+                type2 = fieldDef ? fieldDef.type : null;
+              }
+              break;
+            }
+            case RuleKinds.SELECTION_SET:
+              parentType = getNamedType(type2);
+              break;
+            case RuleKinds.DIRECTIVE:
+              directiveDef = state.name
+                ? schema.getDirective(state.name)
+                : null;
+              break;
+            case RuleKinds.INTERFACE_DEF:
+              if (state.name) {
+                objectTypeDef = null;
+                interfaceDef = new GraphQLInterfaceType({
+                  name: state.name,
+                  interfaces: [],
+                  fields: {},
+                });
+              }
+              break;
+            case RuleKinds.OBJECT_TYPE_DEF:
+              if (state.name) {
+                interfaceDef = null;
+                objectTypeDef = new GraphQLObjectType({
+                  name: state.name,
+                  interfaces: [],
+                  fields: {},
+                });
+              }
+              break;
+            case RuleKinds.ARGUMENTS: {
+              if (!state.prevState) {
+                argDefs = null;
+              } else {
+                switch (state.prevState.kind) {
+                  case RuleKinds.FIELD:
+                    argDefs = fieldDef && fieldDef.args;
+                    break;
+                  case RuleKinds.DIRECTIVE:
+                    argDefs = directiveDef && directiveDef.args;
+                    break;
+                  case RuleKinds.ALIASED_FIELD: {
+                    const name2 = state.prevState && state.prevState.name;
+                    if (!name2) {
+                      argDefs = null;
+                      break;
+                    }
+                    const field = parentType
+                      ? getFieldDef$1(schema, parentType, name2)
+                      : null;
+                    if (!field) {
+                      argDefs = null;
+                      break;
+                    }
+                    argDefs = field.args;
+                    break;
+                  }
+                  default:
+                    argDefs = null;
+                    break;
+                }
+              }
+              break;
+            }
+            case RuleKinds.ARGUMENT:
+              if (argDefs) {
+                for (let i = 0; i < argDefs.length; i++) {
+                  if (argDefs[i].name === state.name) {
+                    argDef = argDefs[i];
+                    break;
+                  }
+                }
+              }
+              inputType = argDef && argDef.type;
+              break;
+            case RuleKinds.ENUM_VALUE:
+              const enumType = getNamedType(inputType);
+              enumValue =
+                enumType instanceof GraphQLEnumType
+                  ? enumType.getValues().find((val) => val.value === state.name)
+                  : null;
+              break;
+            case RuleKinds.LIST_VALUE:
+              const nullableType = getNullableType(inputType);
+              inputType =
+                nullableType instanceof GraphQLList
+                  ? nullableType.ofType
+                  : null;
+              break;
+            case RuleKinds.OBJECT_VALUE:
+              const objectType = getNamedType(inputType);
+              objectFieldDefs =
+                objectType instanceof GraphQLInputObjectType
+                  ? objectType.getFields()
+                  : null;
+              break;
+            case RuleKinds.OBJECT_FIELD:
+              const objectField =
+                state.name && objectFieldDefs
+                  ? objectFieldDefs[state.name]
+                  : null;
+              inputType = objectField && objectField.type;
+              break;
+            case RuleKinds.NAMED_TYPE:
+              if (state.name) {
+                type2 = schema.getType(state.name);
+              }
+              break;
+          }
+        });
+        return {
+          argDef,
+          argDefs,
+          directiveDef,
+          enumValue,
+          fieldDef,
+          inputType,
+          objectFieldDefs,
+          parentType,
+          type: type2,
+          interfaceDef,
+          objectTypeDef,
+        };
+      }
+      var nullthrows$2 = { exports: {} };
+      function nullthrows(x2, message) {
+        if (x2 != null) {
+          return x2;
+        }
+        var error2 = new Error(
+          message !== void 0 ? message : "Got unexpected " + x2
+        );
+        error2.framesToPop = 1;
+        throw error2;
+      }
+      nullthrows$2.exports = nullthrows;
+      nullthrows$2.exports.default = nullthrows;
+      Object.defineProperty(nullthrows$2.exports, "__esModule", {
+        value: true,
+      });
+      var nullthrows$1 = /* @__PURE__ */ getDefaultExportFromCjs(
+        nullthrows$2.exports
+      );
+      const getFragmentDependencies = (
+        operationString,
+        fragmentDefinitions
+      ) => {
+        if (!fragmentDefinitions) {
+          return [];
+        }
+        let parsedOperation;
+        try {
+          parsedOperation = parse$1(operationString);
+        } catch (error2) {
+          return [];
+        }
+        return getFragmentDependenciesForAST(
+          parsedOperation,
+          fragmentDefinitions
+        );
+      };
+      const getFragmentDependenciesForAST = (
+        parsedOperation,
+        fragmentDefinitions
+      ) => {
+        if (!fragmentDefinitions) {
+          return [];
+        }
+        const existingFrags = /* @__PURE__ */ new Map();
+        const referencedFragNames = /* @__PURE__ */ new Set();
+        visit(parsedOperation, {
+          FragmentDefinition(node) {
+            existingFrags.set(node.name.value, true);
+          },
+          FragmentSpread(node) {
+            if (!referencedFragNames.has(node.name.value)) {
+              referencedFragNames.add(node.name.value);
+            }
+          },
+        });
+        const asts = /* @__PURE__ */ new Set();
+        referencedFragNames.forEach((name2) => {
+          if (!existingFrags.has(name2) && fragmentDefinitions.has(name2)) {
+            asts.add(nullthrows$1(fragmentDefinitions.get(name2)));
+          }
+        });
+        const referencedFragments = [];
+        asts.forEach((ast2) => {
+          visit(ast2, {
+            FragmentSpread(node) {
+              if (
+                !referencedFragNames.has(node.name.value) &&
+                fragmentDefinitions.get(node.name.value)
+              ) {
+                asts.add(
+                  nullthrows$1(fragmentDefinitions.get(node.name.value))
+                );
+                referencedFragNames.add(node.name.value);
+              }
+            },
+          });
+          if (!existingFrags.has(ast2.name.value)) {
+            referencedFragments.push(ast2);
+          }
+        });
+        return referencedFragments;
+      };
+      function text$3(into, newText) {
+        into.push(newText);
+      }
+      function renderType$4(into, t2) {
+        if (isNonNullType(t2)) {
+          renderType$4(into, t2.ofType);
+          text$3(into, "!");
+        } else if (isListType(t2)) {
+          text$3(into, "[");
+          renderType$4(into, t2.ofType);
+          text$3(into, "]");
+        } else {
+          text$3(into, t2.name);
+        }
+      }
+      function renderTypeToString(t2, useMarkdown) {
+        const into = [];
+        if (useMarkdown) {
+          text$3(into, "```graphql\n");
+        }
+        renderType$4(into, t2);
+        if (useMarkdown) {
+          text$3(into, "\n```");
+        }
+        return into.join("");
+      }
+      const scalarTypesMap = {
+        Int: "integer",
+        String: "string",
+        Float: "number",
+        ID: "string",
+        Boolean: "boolean",
+        DateTime: "string",
+      };
+      function getJSONSchemaFromGraphQLType(type2, options) {
+        var _a2;
+        let required = false;
+        let definition = /* @__PURE__ */ Object.create(null);
+        const definitions = /* @__PURE__ */ Object.create(null);
+        if ("defaultValue" in type2 && type2.defaultValue !== void 0) {
+          definition.default = type2.defaultValue;
+        }
+        if (isEnumType(type2)) {
+          definition.type = "string";
+          definition.enum = type2.getValues().map((val) => val.name);
+        }
+        if (isScalarType(type2)) {
+          definition.type =
+            (_a2 = scalarTypesMap[type2.name]) != null ? _a2 : "any";
+        }
+        if (isListType(type2)) {
+          definition.type = "array";
+          const { definition: def, definitions: defs } =
+            getJSONSchemaFromGraphQLType(type2.ofType, options);
+          if (def.$ref) {
+            definition.items = { $ref: def.$ref };
+          } else {
+            definition.items = def;
+          }
+          if (defs) {
+            Object.keys(defs).forEach((defName) => {
+              definitions[defName] = defs[defName];
+            });
+          }
+        }
+        if (isNonNullType(type2)) {
+          required = true;
+          const { definition: def, definitions: defs } =
+            getJSONSchemaFromGraphQLType(type2.ofType, options);
+          definition = def;
+          if (defs) {
+            Object.keys(defs).forEach((defName) => {
+              definitions[defName] = defs[defName];
+            });
+          }
+        }
+        if (isInputObjectType(type2)) {
+          definition.$ref = `#/definitions/${type2.name}`;
+          const fields = type2.getFields();
+          const fieldDef = {
+            type: "object",
+            properties: {},
+            required: [],
+          };
+          if (type2.description) {
+            fieldDef.description =
+              type2.description +
+              `
+` +
+              renderTypeToString(type2);
+            if (options == null ? void 0 : options.useMarkdownDescription) {
+              fieldDef.markdownDescription =
+                type2.description +
+                `
+` +
+                renderTypeToString(type2, true);
+            }
+          } else {
+            fieldDef.description = renderTypeToString(type2);
+            if (options == null ? void 0 : options.useMarkdownDescription) {
+              fieldDef.markdownDescription = renderTypeToString(type2, true);
+            }
+          }
+          Object.keys(fields).forEach((fieldName) => {
+            const field = fields[fieldName];
+            const {
+              required: fieldRequired,
+              definition: typeDefinition,
+              definitions: typeDefinitions,
+            } = getJSONSchemaFromGraphQLType(field.type, options);
+            const { definition: fieldDefinition } =
+              getJSONSchemaFromGraphQLType(field, options);
+            fieldDef.properties[fieldName] = __spreadValues(
+              __spreadValues({}, typeDefinition),
+              fieldDefinition
+            );
+            const renderedField = renderTypeToString(field.type);
+            fieldDef.properties[fieldName].description = field.description
+              ? field.description + "\n" + renderedField
+              : renderedField;
+            if (options == null ? void 0 : options.useMarkdownDescription) {
+              const renderedFieldMarkdown = renderTypeToString(
+                field.type,
+                true
+              );
+              fieldDef.properties[fieldName].markdownDescription =
+                field.description
+                  ? field.description + "\n" + renderedFieldMarkdown
+                  : renderedFieldMarkdown;
+            }
+            if (fieldRequired) {
+              fieldDef.required.push(fieldName);
+            }
+            if (typeDefinitions) {
+              Object.keys(typeDefinitions).map((defName) => {
+                definitions[defName] = typeDefinitions[defName];
+              });
+            }
+          });
+          definitions[type2.name] = fieldDef;
+        }
+        if (
+          "description" in type2 &&
+          !isScalarType(type2) &&
+          type2.description &&
+          !definition.description
+        ) {
+          definition.description =
+            type2.description + "\n" + renderTypeToString(type2);
+          if (options == null ? void 0 : options.useMarkdownDescription) {
+            definition.markdownDescription =
+              type2.description + "\n" + renderTypeToString(type2, true);
+          }
+        } else {
+          definition.description = renderTypeToString(type2);
+          if (options == null ? void 0 : options.useMarkdownDescription) {
+            definition.markdownDescription = renderTypeToString(type2, true);
+          }
+        }
+        return { required, definition, definitions };
+      }
+      function getVariablesJSONSchema(variableToType, options) {
+        const jsonSchema = {
+          $schema: "https://json-schema.org/draft/2020-12/schema",
+          type: "object",
+          properties: {},
+          required: [],
+        };
+        if (variableToType) {
+          Object.entries(variableToType).forEach(([variableName, type2]) => {
+            var _a2;
+            const { definition, required, definitions } =
+              getJSONSchemaFromGraphQLType(type2, options);
+            jsonSchema.properties[variableName] = definition;
+            if (required) {
+              (_a2 = jsonSchema.required) == null
+                ? void 0
+                : _a2.push(variableName);
+            }
+            if (definitions) {
+              jsonSchema.definitions = __spreadValues(
+                __spreadValues(
+                  {},
+                  jsonSchema == null ? void 0 : jsonSchema.definitions
+                ),
+                definitions
+              );
+            }
+          });
+        }
+        return jsonSchema;
+      }
+      function getASTNodeAtPosition(query, ast2, point) {
+        const offset = pointToOffset(query, point);
+        let nodeContainingPosition;
+        visit(ast2, {
+          enter(node) {
+            if (
+              node.kind !== "Name" &&
+              node.loc &&
+              node.loc.start <= offset &&
+              offset <= node.loc.end
+            ) {
+              nodeContainingPosition = node;
+            } else {
+              return false;
+            }
+          },
+          leave(node) {
+            if (
+              node.loc &&
+              node.loc.start <= offset &&
+              offset <= node.loc.end
+            ) {
+              return false;
+            }
+          },
+        });
+        return nodeContainingPosition;
+      }
+      function pointToOffset(text3, point) {
+        const linesUntilPosition = text3.split("\n").slice(0, point.line);
+        return (
+          point.character +
+          linesUntilPosition
+            .map((line) => line.length + 1)
+            .reduce((a, b) => a + b, 0)
+        );
+      }
+      class Range {
+        constructor(start2, end2) {
+          this.containsPosition = (position) => {
+            if (this.start.line === position.line) {
+              return this.start.character <= position.character;
+            } else if (this.end.line === position.line) {
+              return this.end.character >= position.character;
+            } else {
+              return (
+                this.start.line <= position.line &&
+                this.end.line >= position.line
+              );
+            }
+          };
+          this.start = start2;
+          this.end = end2;
+        }
+        setStart(line, character) {
+          this.start = new Position(line, character);
+        }
+        setEnd(line, character) {
+          this.end = new Position(line, character);
+        }
+      }
+      class Position {
+        constructor(line, character) {
+          this.lessThanOrEqualTo = (position) =>
+            this.line < position.line ||
+            (this.line === position.line &&
+              this.character <= position.character);
+          this.line = line;
+          this.character = character;
+        }
+        setLine(line) {
+          this.line = line;
+        }
+        setCharacter(character) {
+          this.character = character;
+        }
+      }
+      function offsetToPosition(text3, loc) {
+        const EOL = "\n";
+        const buf = text3.slice(0, loc);
+        const lines = buf.split(EOL).length - 1;
+        const lastLineIndex = buf.lastIndexOf(EOL);
+        return new Position(lines, loc - lastLineIndex - 1);
+      }
+      function locToRange(text3, loc) {
+        const start2 = offsetToPosition(text3, loc.start);
+        const end2 = offsetToPosition(text3, loc.end);
+        return new Range(start2, end2);
+      }
+      const specifiedSDLRules = [
+        LoneSchemaDefinitionRule,
+        UniqueOperationTypesRule,
+        UniqueTypeNamesRule,
+        UniqueEnumValueNamesRule,
+        UniqueFieldDefinitionNamesRule,
+        UniqueDirectiveNamesRule,
+        KnownTypeNamesRule,
+        KnownDirectivesRule,
+        UniqueDirectivesPerLocationRule,
+        PossibleTypeExtensionsRule,
+        UniqueArgumentNamesRule,
+        UniqueInputFieldNamesRule,
+      ];
+      function validateWithCustomRules(
+        schema,
+        ast2,
+        customRules,
+        isRelayCompatMode,
+        isSchemaDocument
+      ) {
+        const rules = specifiedRules.filter((rule) => {
+          if (
+            rule === NoUnusedFragmentsRule ||
+            rule === ExecutableDefinitionsRule
+          ) {
+            return false;
+          }
+          if (isRelayCompatMode && rule === KnownFragmentNamesRule) {
+            return false;
+          }
+          return true;
+        });
+        if (customRules) {
+          Array.prototype.push.apply(rules, customRules);
+        }
+        if (isSchemaDocument) {
+          Array.prototype.push.apply(rules, specifiedSDLRules);
+        }
+        const errors2 = validate(schema, ast2, rules);
+        return errors2.filter((error2) => {
+          if (
+            error2.message.indexOf("Unknown directive") !== -1 &&
+            error2.nodes
+          ) {
+            const node = error2.nodes[0];
+            if (node && node.kind === Kind.DIRECTIVE) {
+              const name2 = node.name.value;
+              if (name2 === "arguments" || name2 === "argumentDefinitions") {
+                return false;
+              }
+            }
+          }
+          return true;
+        });
+      }
+      function collectVariables(schema, documentAST) {
+        const variableToType = /* @__PURE__ */ Object.create(null);
+        documentAST.definitions.forEach((definition) => {
+          if (definition.kind === "OperationDefinition") {
+            const variableDefinitions = definition.variableDefinitions;
+            if (variableDefinitions) {
+              variableDefinitions.forEach(({ variable, type: type2 }) => {
+                const inputType = typeFromAST(schema, type2);
+                if (inputType) {
+                  variableToType[variable.name.value] = inputType;
+                } else if (type2.kind === Kind.NAMED_TYPE) {
+                  if (type2.name.value === "Float") {
+                    variableToType[variable.name.value] = GraphQLFloat;
+                  }
+                }
+              });
+            }
+          }
+        });
+        return variableToType;
+      }
+      function getOperationASTFacts(documentAST, schema) {
+        const variableToType = schema
+          ? collectVariables(schema, documentAST)
+          : void 0;
+        const operations = [];
+        visit(documentAST, {
+          OperationDefinition(node) {
+            operations.push(node);
+          },
+        });
+        return { variableToType, operations };
+      }
+      function getOperationFacts(schema, documentString) {
+        if (!documentString) {
+          return;
+        }
+        try {
+          const documentAST = parse$1(documentString);
+          return __spreadProps(
+            __spreadValues({}, getOperationASTFacts(documentAST, schema)),
+            {
+              documentAST,
+            }
+          );
+        } catch {
+          return;
+        }
+      }
+      const getQueryFacts = getOperationFacts;
+      const LANGUAGE = "GraphQL";
+      function assert(value, message) {
+        if (!value) {
+          throw new Error(message);
+        }
+      }
+      function getRange$1(text3, node) {
+        const location2 = node.loc;
+        assert(location2, "Expected ASTNode to have a location.");
+        return locToRange(text3, location2);
+      }
+      function getPosition(text3, node) {
+        const location2 = node.loc;
+        assert(location2, "Expected ASTNode to have a location.");
+        return offsetToPosition(text3, location2.start);
+      }
+      async function getDefinitionQueryResultForNamedType(
+        text3,
+        node,
+        dependencies
+      ) {
+        const name2 = node.name.value;
+        const defNodes = dependencies.filter(
+          ({ definition }) => definition.name && definition.name.value === name2
+        );
+        if (defNodes.length === 0) {
+          throw Error(`Definition not found for GraphQL type ${name2}`);
+        }
+        const definitions = defNodes.map(({ filePath, content, definition }) =>
+          getDefinitionForNodeDefinition(filePath || "", content, definition)
+        );
+        return {
+          definitions,
+          queryRange: definitions.map((_) => getRange$1(text3, node)),
+        };
+      }
+      async function getDefinitionQueryResultForFragmentSpread(
+        text3,
+        fragment,
+        dependencies
+      ) {
+        const name2 = fragment.name.value;
+        const defNodes = dependencies.filter(
+          ({ definition }) => definition.name.value === name2
+        );
+        if (defNodes.length === 0) {
+          throw Error(`Definition not found for GraphQL fragment ${name2}`);
+        }
+        const definitions = defNodes.map(({ filePath, content, definition }) =>
+          getDefinitionForFragmentDefinition(
+            filePath || "",
+            content,
+            definition
+          )
+        );
+        return {
+          definitions,
+          queryRange: definitions.map((_) => getRange$1(text3, fragment)),
+        };
+      }
+      function getDefinitionQueryResultForDefinitionNode(
+        path,
+        text3,
+        definition
+      ) {
+        return {
+          definitions: [
+            getDefinitionForFragmentDefinition(path, text3, definition),
+          ],
+          queryRange: definition.name
+            ? [getRange$1(text3, definition.name)]
+            : [],
+        };
+      }
+      function getDefinitionForFragmentDefinition(path, text3, definition) {
+        const name2 = definition.name;
+        if (!name2) {
+          throw Error("Expected ASTNode to have a Name.");
+        }
+        return {
+          path,
+          position: getPosition(text3, definition),
+          range: getRange$1(text3, definition),
+          name: name2.value || "",
+          language: LANGUAGE,
+          projectRoot: path,
+        };
+      }
+      function getDefinitionForNodeDefinition(path, text3, definition) {
+        const name2 = definition.name;
+        assert(name2, "Expected ASTNode to have a Name.");
+        return {
+          path,
+          position: getPosition(text3, definition),
+          range: getRange$1(text3, definition),
+          name: name2.value || "",
+          language: LANGUAGE,
+          projectRoot: path,
+        };
+      }
+      const SEVERITY$1 = {
+        Error: "Error",
+        Warning: "Warning",
+        Information: "Information",
+        Hint: "Hint",
+      };
+      const DIAGNOSTIC_SEVERITY = {
+        [SEVERITY$1.Error]: 1,
+        [SEVERITY$1.Warning]: 2,
+        [SEVERITY$1.Information]: 3,
+        [SEVERITY$1.Hint]: 4,
+      };
+      const invariant$1 = (condition, message) => {
+        if (!condition) {
+          throw new Error(message);
+        }
+      };
+      function getDiagnostics(
+        query,
+        schema = null,
+        customRules,
+        isRelayCompatMode,
+        externalFragments
+      ) {
+        let ast2 = null;
+        if (externalFragments) {
+          if (typeof externalFragments === "string") {
+            query += "\n\n" + externalFragments;
+          } else {
+            query +=
+              "\n\n" +
+              externalFragments.reduce((agg, node) => {
+                agg += print(node) + "\n\n";
+                return agg;
+              }, "");
+          }
+        }
+        try {
+          ast2 = parse$1(query);
+        } catch (error2) {
+          const range2 = getRange(error2.locations[0], query);
+          return [
+            {
+              severity: DIAGNOSTIC_SEVERITY.Error,
+              message: error2.message,
+              source: "GraphQL: Syntax",
+              range: range2,
+            },
+          ];
+        }
+        return validateQuery(ast2, schema, customRules, isRelayCompatMode);
+      }
+      function validateQuery(
+        ast2,
+        schema = null,
+        customRules,
+        isRelayCompatMode
+      ) {
+        if (!schema) {
+          return [];
+        }
+        const validationErrorAnnotations = mapCat$1(
+          validateWithCustomRules(schema, ast2, customRules, isRelayCompatMode),
+          (error2) =>
+            annotations(error2, DIAGNOSTIC_SEVERITY.Error, "Validation")
+        );
+        const deprecationWarningAnnotations = mapCat$1(
+          validate(schema, ast2, [NoDeprecatedCustomRule]),
+          (error2) =>
+            annotations(error2, DIAGNOSTIC_SEVERITY.Warning, "Deprecation")
+        );
+        return validationErrorAnnotations.concat(deprecationWarningAnnotations);
+      }
+      function mapCat$1(array, mapper) {
+        return Array.prototype.concat.apply([], array.map(mapper));
+      }
+      function annotations(error2, severity, type2) {
+        if (!error2.nodes) {
+          return [];
+        }
+        const highlightedNodes = [];
+        error2.nodes.forEach((node) => {
+          const highlightNode =
+            node.kind !== "Variable" && "name" in node && node.name !== void 0
+              ? node.name
+              : "variable" in node && node.variable !== void 0
+              ? node.variable
+              : node;
+          if (highlightNode) {
+            invariant$1(
+              error2.locations,
+              "GraphQL validation error requires locations."
+            );
+            const loc = error2.locations[0];
+            const highlightLoc = getLocation(highlightNode);
+            const end2 = loc.column + (highlightLoc.end - highlightLoc.start);
+            highlightedNodes.push({
+              source: `GraphQL: ${type2}`,
+              message: error2.message,
+              severity,
+              range: new Range(
+                new Position(loc.line - 1, loc.column - 1),
+                new Position(loc.line - 1, end2)
+              ),
+            });
+          }
+        });
+        return highlightedNodes;
+      }
+      function getRange(location2, queryText) {
+        const parser = onlineParser();
+        const state = parser.startState();
+        const lines = queryText.split("\n");
+        invariant$1(
+          lines.length >= location2.line,
+          "Query text must have more lines than where the error happened"
+        );
+        let stream = null;
+        for (let i = 0; i < location2.line; i++) {
+          stream = new CharacterStream(lines[i]);
+          while (!stream.eol()) {
+            const style = parser.token(stream, state);
+            if (style === "invalidchar") {
+              break;
+            }
+          }
+        }
+        invariant$1(stream, "Expected Parser stream to be available.");
+        const line = location2.line - 1;
+        const start2 = stream.getStartOfToken();
+        const end2 = stream.getCurrentPosition();
+        return new Range(new Position(line, start2), new Position(line, end2));
+      }
+      function getLocation(node) {
+        const typeCastedNode = node;
+        const location2 = typeCastedNode.loc;
+        invariant$1(location2, "Expected ASTNode to have a location.");
+        return location2;
+      }
+      const { INLINE_FRAGMENT } = Kind;
+      function getOutline(documentText) {
+        let ast2;
+        try {
+          ast2 = parse$1(documentText);
+        } catch (error2) {
+          return null;
+        }
+        const visitorFns = outlineTreeConverter(documentText);
+        const outlineTrees = visit(ast2, {
+          leave(node) {
+            if (visitorFns !== void 0 && node.kind in visitorFns) {
+              return visitorFns[node.kind](node);
+            }
+            return null;
+          },
+        });
+        return { outlineTrees };
+      }
+      function outlineTreeConverter(docText) {
+        const meta = (node) => {
+          return {
+            representativeName: node.name,
+            startPosition: offsetToPosition(docText, node.loc.start),
+            endPosition: offsetToPosition(docText, node.loc.end),
+            kind: node.kind,
+            children:
+              node.selectionSet ||
+              node.fields ||
+              node.values ||
+              node.arguments ||
+              [],
+          };
+        };
+        return {
+          Field: (node) => {
+            const tokenizedText = node.alias
+              ? [buildToken("plain", node.alias), buildToken("plain", ": ")]
+              : [];
+            tokenizedText.push(buildToken("plain", node.name));
+            return __spreadValues({ tokenizedText }, meta(node));
+          },
+          OperationDefinition: (node) =>
+            __spreadValues(
+              {
+                tokenizedText: [
+                  buildToken("keyword", node.operation),
+                  buildToken("whitespace", " "),
+                  buildToken("class-name", node.name),
+                ],
+              },
+              meta(node)
+            ),
+          Document: (node) => node.definitions,
+          SelectionSet: (node) =>
+            concatMap(node.selections, (child) => {
+              return child.kind === INLINE_FRAGMENT
+                ? child.selectionSet
+                : child;
+            }),
+          Name: (node) => node.value,
+          FragmentDefinition: (node) =>
+            __spreadValues(
+              {
+                tokenizedText: [
+                  buildToken("keyword", "fragment"),
+                  buildToken("whitespace", " "),
+                  buildToken("class-name", node.name),
+                ],
+              },
+              meta(node)
+            ),
+          InterfaceTypeDefinition: (node) =>
+            __spreadValues(
+              {
+                tokenizedText: [
+                  buildToken("keyword", "interface"),
+                  buildToken("whitespace", " "),
+                  buildToken("class-name", node.name),
+                ],
+              },
+              meta(node)
+            ),
+          EnumTypeDefinition: (node) =>
+            __spreadValues(
+              {
+                tokenizedText: [
+                  buildToken("keyword", "enum"),
+                  buildToken("whitespace", " "),
+                  buildToken("class-name", node.name),
+                ],
+              },
+              meta(node)
+            ),
+          EnumValueDefinition: (node) =>
+            __spreadValues(
+              {
+                tokenizedText: [buildToken("plain", node.name)],
+              },
+              meta(node)
+            ),
+          ObjectTypeDefinition: (node) =>
+            __spreadValues(
+              {
+                tokenizedText: [
+                  buildToken("keyword", "type"),
+                  buildToken("whitespace", " "),
+                  buildToken("class-name", node.name),
+                ],
+              },
+              meta(node)
+            ),
+          InputObjectTypeDefinition: (node) =>
+            __spreadValues(
+              {
+                tokenizedText: [
+                  buildToken("keyword", "input"),
+                  buildToken("whitespace", " "),
+                  buildToken("class-name", node.name),
+                ],
+              },
+              meta(node)
+            ),
+          FragmentSpread: (node) =>
+            __spreadValues(
+              {
+                tokenizedText: [
+                  buildToken("plain", "..."),
+                  buildToken("class-name", node.name),
+                ],
+              },
+              meta(node)
+            ),
+          InputValueDefinition: (node) => {
+            return __spreadValues(
+              {
+                tokenizedText: [buildToken("plain", node.name)],
+              },
+              meta(node)
+            );
+          },
+          FieldDefinition: (node) => {
+            return __spreadValues(
+              {
+                tokenizedText: [buildToken("plain", node.name)],
+              },
+              meta(node)
+            );
+          },
+          InlineFragment: (node) => node.selectionSet,
+        };
+      }
+      function buildToken(kind2, value) {
+        return { kind: kind2, value };
+      }
+      function concatMap(arr, fn) {
+        const res = [];
+        for (let i = 0; i < arr.length; i++) {
+          const x2 = fn(arr[i], i);
+          if (Array.isArray(x2)) {
+            res.push(...x2);
+          } else {
+            res.push(x2);
+          }
+        }
+        return res;
+      }
+      function getHoverInformation(
+        schema,
+        queryText,
+        cursor,
+        contextToken,
+        config2
+      ) {
+        const token2 = contextToken || getTokenAtPosition(queryText, cursor);
+        if (!schema || !token2 || !token2.state) {
+          return "";
+        }
+        const state = token2.state;
+        const kind2 = state.kind;
+        const step = state.step;
+        const typeInfo = getTypeInfo$3(schema, token2.state);
+        const options = __spreadProps(__spreadValues({}, config2), { schema });
+        if (
+          (kind2 === "Field" && step === 0 && typeInfo.fieldDef) ||
+          (kind2 === "AliasedField" && step === 2 && typeInfo.fieldDef)
+        ) {
+          const into = [];
+          renderMdCodeStart(into, options);
+          renderField$1(into, typeInfo, options);
+          renderMdCodeEnd(into, options);
+          renderDescription$1(into, options, typeInfo.fieldDef);
+          return into.join("").trim();
+        } else if (
+          kind2 === "Directive" &&
+          step === 1 &&
+          typeInfo.directiveDef
+        ) {
+          const into = [];
+          renderMdCodeStart(into, options);
+          renderDirective$1(into, typeInfo);
+          renderMdCodeEnd(into, options);
+          renderDescription$1(into, options, typeInfo.directiveDef);
+          return into.join("").trim();
+        } else if (kind2 === "Argument" && step === 0 && typeInfo.argDef) {
+          const into = [];
+          renderMdCodeStart(into, options);
+          renderArg$1(into, typeInfo, options);
+          renderMdCodeEnd(into, options);
+          renderDescription$1(into, options, typeInfo.argDef);
+          return into.join("").trim();
+        } else if (
+          kind2 === "EnumValue" &&
+          typeInfo.enumValue &&
+          "description" in typeInfo.enumValue
+        ) {
+          const into = [];
+          renderMdCodeStart(into, options);
+          renderEnumValue$1(into, typeInfo, options);
+          renderMdCodeEnd(into, options);
+          renderDescription$1(into, options, typeInfo.enumValue);
+          return into.join("").trim();
+        } else if (
+          kind2 === "NamedType" &&
+          typeInfo.type &&
+          "description" in typeInfo.type
+        ) {
+          const into = [];
+          renderMdCodeStart(into, options);
+          renderType$3(into, typeInfo, options, typeInfo.type);
+          renderMdCodeEnd(into, options);
+          renderDescription$1(into, options, typeInfo.type);
+          return into.join("").trim();
+        }
+        return "";
+      }
+      function renderMdCodeStart(into, options) {
+        if (options.useMarkdown) {
+          text$2(into, "```graphql\n");
+        }
+      }
+      function renderMdCodeEnd(into, options) {
+        if (options.useMarkdown) {
+          text$2(into, "\n```");
+        }
+      }
+      function renderField$1(into, typeInfo, options) {
+        renderQualifiedField$1(into, typeInfo, options);
+        renderTypeAnnotation$1(into, typeInfo, options, typeInfo.type);
+      }
+      function renderQualifiedField$1(into, typeInfo, options) {
+        if (!typeInfo.fieldDef) {
+          return;
+        }
+        const fieldName = typeInfo.fieldDef.name;
+        if (fieldName.slice(0, 2) !== "__") {
+          renderType$3(into, typeInfo, options, typeInfo.parentType);
+          text$2(into, ".");
+        }
+        text$2(into, fieldName);
+      }
+      function renderDirective$1(into, typeInfo, _options) {
+        if (!typeInfo.directiveDef) {
+          return;
+        }
+        const name2 = "@" + typeInfo.directiveDef.name;
+        text$2(into, name2);
+      }
+      function renderArg$1(into, typeInfo, options) {
+        if (typeInfo.directiveDef) {
+          renderDirective$1(into, typeInfo);
+        } else if (typeInfo.fieldDef) {
+          renderQualifiedField$1(into, typeInfo, options);
+        }
+        if (!typeInfo.argDef) {
+          return;
+        }
+        const name2 = typeInfo.argDef.name;
+        text$2(into, "(");
+        text$2(into, name2);
+        renderTypeAnnotation$1(into, typeInfo, options, typeInfo.inputType);
+        text$2(into, ")");
+      }
+      function renderTypeAnnotation$1(into, typeInfo, options, t2) {
+        text$2(into, ": ");
+        renderType$3(into, typeInfo, options, t2);
+      }
+      function renderEnumValue$1(into, typeInfo, options) {
+        if (!typeInfo.enumValue) {
+          return;
+        }
+        const name2 = typeInfo.enumValue.name;
+        renderType$3(into, typeInfo, options, typeInfo.inputType);
+        text$2(into, ".");
+        text$2(into, name2);
+      }
+      function renderType$3(into, typeInfo, options, t2) {
+        if (!t2) {
+          return;
+        }
+        if (t2 instanceof GraphQLNonNull) {
+          renderType$3(into, typeInfo, options, t2.ofType);
+          text$2(into, "!");
+        } else if (t2 instanceof GraphQLList) {
+          text$2(into, "[");
+          renderType$3(into, typeInfo, options, t2.ofType);
+          text$2(into, "]");
+        } else {
+          text$2(into, t2.name);
+        }
+      }
+      function renderDescription$1(into, options, def) {
+        if (!def) {
+          return;
+        }
+        const description =
+          typeof def.description === "string" ? def.description : null;
+        if (description) {
+          text$2(into, "\n\n");
+          text$2(into, description);
+        }
+        renderDeprecation$1(into, options, def);
+      }
+      function renderDeprecation$1(into, _options, def) {
+        if (!def) {
+          return;
+        }
+        const reason = def.deprecationReason ? def.deprecationReason : null;
+        if (!reason) {
+          return;
+        }
+        text$2(into, "\n\n");
+        text$2(into, "Deprecated: ");
+        text$2(into, reason);
+      }
+      function text$2(into, content) {
+        into.push(content);
+      }
+      const FileChangeTypeKind = {
+        Created: 1,
+        Changed: 2,
+        Deleted: 3,
+      };
+      var CompletionItemKind;
+      (function (CompletionItemKind2) {
+        CompletionItemKind2.Text = 1;
+        CompletionItemKind2.Method = 2;
+        CompletionItemKind2.Function = 3;
+        CompletionItemKind2.Constructor = 4;
+        CompletionItemKind2.Field = 5;
+        CompletionItemKind2.Variable = 6;
+        CompletionItemKind2.Class = 7;
+        CompletionItemKind2.Interface = 8;
+        CompletionItemKind2.Module = 9;
+        CompletionItemKind2.Property = 10;
+        CompletionItemKind2.Unit = 11;
+        CompletionItemKind2.Value = 12;
+        CompletionItemKind2.Enum = 13;
+        CompletionItemKind2.Keyword = 14;
+        CompletionItemKind2.Snippet = 15;
+        CompletionItemKind2.Color = 16;
+        CompletionItemKind2.File = 17;
+        CompletionItemKind2.Reference = 18;
+        CompletionItemKind2.Folder = 19;
+        CompletionItemKind2.EnumMember = 20;
+        CompletionItemKind2.Constant = 21;
+        CompletionItemKind2.Struct = 22;
+        CompletionItemKind2.Event = 23;
+        CompletionItemKind2.Operator = 24;
+        CompletionItemKind2.TypeParameter = 25;
+      })(CompletionItemKind || (CompletionItemKind = {}));
+      var esm = /* @__PURE__ */ Object.freeze({
+        __proto__: null,
+        [Symbol.toStringTag]: "Module",
+        getAutocompleteSuggestions,
+        getDefinitionQueryResultForDefinitionNode,
+        getDefinitionQueryResultForFragmentSpread,
+        getDefinitionQueryResultForNamedType,
+        getDefinitionState,
+        getDiagnostics,
+        getFieldDef: getFieldDef$1,
+        getFragmentDefinitions,
+        getHoverInformation,
+        getOutline,
+        getRange,
+        getTokenAtPosition,
+        getTypeInfo: getTypeInfo$3,
+        getVariableCompletions,
+        SEVERITY: SEVERITY$1,
+        DIAGNOSTIC_SEVERITY,
+        canUseDirective,
+        SuggestionCommand,
+        validateQuery,
+        onlineParser,
+        ParseRules: ParseRules$2,
+        CharacterStream,
+        RuleKinds,
+        LexRules: LexRules$2,
+        isIgnored,
+        p,
+        list: list$1,
+        t,
+        opt,
+        get CompletionItemKind() {
+          return CompletionItemKind;
+        },
+        FileChangeTypeKind,
+        getASTNodeAtPosition,
+        getFragmentDependencies,
+        getFragmentDependenciesForAST,
+        getOperationASTFacts,
+        getOperationFacts,
+        getQueryFacts,
+        getVariablesJSONSchema,
+        offsetToPosition,
+        pointToOffset,
+        Position,
+        collectVariables,
+        validateWithCustomRules,
+        Range,
+      });
+      var __extends$f =
+        (globalThis && globalThis.__extends) ||
+        (function () {
+          var extendStatics = function (d, b) {
+            extendStatics =
+              Object.setPrototypeOf ||
+              ({ __proto__: [] } instanceof Array &&
+                function (d2, b2) {
+                  d2.__proto__ = b2;
+                }) ||
+              function (d2, b2) {
+                for (var p2 in b2)
+                  if (Object.prototype.hasOwnProperty.call(b2, p2))
+                    d2[p2] = b2[p2];
+              };
+            return extendStatics(d, b);
+          };
+          return function (d, b) {
+            extendStatics(d, b);
+            function __() {
+              this.constructor = d;
+            }
+            d.prototype =
+              b === null
+                ? Object.create(b)
+                : ((__.prototype = b.prototype), new __());
+          };
+        })();
+      var ExecuteButton = (function (_super2) {
+        __extends$f(ExecuteButton2, _super2);
+        function ExecuteButton2(props) {
+          var _this = _super2.call(this, props) || this;
+          _this._onClick = function () {
+            if (_this.props.isRunning) {
+              _this.props.onStop();
+            } else {
+              _this.props.onRun();
+            }
+          };
+          _this._onOptionSelected = function (operation) {
+            _this.setState({ optionsOpen: false });
+            _this.props.onRun(operation.name && operation.name.value);
+          };
+          _this._onOptionsOpen = function (downEvent) {
+            var initialPress = true;
+            var downTarget = downEvent.currentTarget;
+            _this.setState({ highlight: null, optionsOpen: true });
+            var onMouseUp = function (upEvent) {
+              var _a2;
+              if (initialPress && upEvent.target === downTarget) {
+                initialPress = false;
+              } else {
+                document.removeEventListener("mouseup", onMouseUp);
+                onMouseUp = null;
+                var isOptionsMenuClicked =
+                  upEvent.currentTarget &&
+                  ((_a2 = downTarget.parentNode) === null || _a2 === void 0
+                    ? void 0
+                    : _a2.compareDocumentPosition(upEvent.currentTarget)) &&
+                  Node.DOCUMENT_POSITION_CONTAINED_BY;
+                if (!isOptionsMenuClicked) {
+                  _this.setState({ optionsOpen: false });
+                }
+              }
+            };
+            document.addEventListener("mouseup", onMouseUp);
+          };
+          _this.state = {
+            optionsOpen: false,
+            highlight: null,
+          };
+          return _this;
+        }
+        ExecuteButton2.prototype.render = function () {
+          var _this = this;
+          var operations = this.props.operations || [];
+          var optionsOpen = this.state.optionsOpen;
+          var hasOptions = operations && operations.length > 1;
+          var options = null;
+          if (hasOptions && optionsOpen) {
+            var highlight_1 = this.state.highlight;
+            options = React$1.createElement(
+              "ul",
+              { className: "execute-options" },
+              operations.map(function (operation, i) {
+                var opName = operation.name
+                  ? operation.name.value
+                  : "<Unnamed " + operation.operation + ">";
+                return React$1.createElement(
+                  "li",
+                  {
+                    key: opName + "-" + i,
+                    className: operation === highlight_1 ? "selected" : void 0,
+                    onMouseOver: function () {
+                      return _this.setState({ highlight: operation });
+                    },
+                    onMouseOut: function () {
+                      return _this.setState({ highlight: null });
+                    },
+                    onMouseUp: function () {
+                      return _this._onOptionSelected(operation);
+                    },
+                  },
+                  opName
+                );
+              })
+            );
+          }
+          var onClick;
+          if (this.props.isRunning || !hasOptions) {
+            onClick = this._onClick;
+          }
+          var onMouseDown = function () {};
+          if (!this.props.isRunning && hasOptions && !optionsOpen) {
+            onMouseDown = this._onOptionsOpen;
+          }
+          var pathJSX = this.props.isRunning
+            ? React$1.createElement("path", {
+                d: "M 10 10 L 23 10 L 23 23 L 10 23 z",
+              })
+            : React$1.createElement("path", { d: "M 11 9 L 24 16 L 11 23 z" });
+          return React$1.createElement(
+            "div",
+            { className: "execute-button-wrap" },
+            React$1.createElement(
+              "button",
+              {
+                type: "button",
+                className: "execute-button",
+                onMouseDown,
+                onClick,
+                title: "Execute Query (Ctrl-Enter)",
+              },
+              React$1.createElement(
+                "svg",
+                { width: "34", height: "34" },
+                pathJSX
+              )
+            ),
+            options
+          );
+        };
+        return ExecuteButton2;
+      })(React$1.Component);
+      var __extends$e =
+        (globalThis && globalThis.__extends) ||
+        (function () {
+          var extendStatics = function (d, b) {
+            extendStatics =
+              Object.setPrototypeOf ||
+              ({ __proto__: [] } instanceof Array &&
+                function (d2, b2) {
+                  d2.__proto__ = b2;
+                }) ||
+              function (d2, b2) {
+                for (var p2 in b2)
+                  if (Object.prototype.hasOwnProperty.call(b2, p2))
+                    d2[p2] = b2[p2];
+              };
+            return extendStatics(d, b);
+          };
+          return function (d, b) {
+            extendStatics(d, b);
+            function __() {
+              this.constructor = d;
+            }
+            d.prototype =
+              b === null
+                ? Object.create(b)
+                : ((__.prototype = b.prototype), new __());
+          };
+        })();
+      function tokenToURL(token2) {
+        if (token2.type !== "string") {
+          return;
+        }
+        var value = token2.string.slice(1).slice(0, -1).trim();
+        try {
+          var location_1 = window.location;
+          return new URL(value, location_1.protocol + "//" + location_1.host);
+        } catch (err) {
+          return;
+        }
+      }
+      function isImageURL(url) {
+        return /(bmp|gif|jpeg|jpg|png|svg)$/.test(url.pathname);
+      }
+      var ImagePreview = (function (_super2) {
+        __extends$e(ImagePreview2, _super2);
+        function ImagePreview2() {
+          var _this =
+            (_super2 !== null && _super2.apply(this, arguments)) || this;
+          _this._node = null;
+          _this.state = {
+            width: null,
+            height: null,
+            src: null,
+            mime: null,
+          };
+          return _this;
+        }
+        ImagePreview2.shouldRender = function (token2) {
+          var url = tokenToURL(token2);
+          return url ? isImageURL(url) : false;
+        };
+        ImagePreview2.prototype.componentDidMount = function () {
+          this._updateMetadata();
+        };
+        ImagePreview2.prototype.componentDidUpdate = function () {
+          this._updateMetadata();
+        };
+        ImagePreview2.prototype.render = function () {
+          var _this = this;
+          var _a2;
+          var dims = null;
+          if (this.state.width !== null && this.state.height !== null) {
+            var dimensions = this.state.width + "x" + this.state.height;
+            if (this.state.mime !== null) {
+              dimensions += " " + this.state.mime;
+            }
+            dims = React$1.createElement("div", null, dimensions);
+          }
+          return React$1.createElement(
+            "div",
+            null,
+            React$1.createElement("img", {
+              onLoad: function () {
+                return _this._updateMetadata();
+              },
+              ref: function (node) {
+                _this._node = node;
+              },
+              src:
+                (_a2 = tokenToURL(this.props.token)) === null || _a2 === void 0
+                  ? void 0
+                  : _a2.href,
+            }),
+            dims
+          );
+        };
+        ImagePreview2.prototype._updateMetadata = function () {
+          var _this = this;
+          if (!this._node) {
+            return;
+          }
+          var width = this._node.naturalWidth;
+          var height = this._node.naturalHeight;
+          var src = this._node.src;
+          if (src !== this.state.src) {
+            this.setState({ src });
+            fetch(src, { method: "HEAD" }).then(function (response) {
+              _this.setState({
+                mime: response.headers.get("Content-Type"),
+              });
+            });
+          }
+          if (width !== this.state.width || height !== this.state.height) {
+            this.setState({ height, width });
+          }
+        };
+        return ImagePreview2;
+      })(React$1.Component);
+      var __extends$d =
+        (globalThis && globalThis.__extends) ||
+        (function () {
+          var extendStatics = function (d, b) {
+            extendStatics =
+              Object.setPrototypeOf ||
+              ({ __proto__: [] } instanceof Array &&
+                function (d2, b2) {
+                  d2.__proto__ = b2;
+                }) ||
+              function (d2, b2) {
+                for (var p2 in b2)
+                  if (Object.prototype.hasOwnProperty.call(b2, p2))
+                    d2[p2] = b2[p2];
+              };
+            return extendStatics(d, b);
+          };
+          return function (d, b) {
+            extendStatics(d, b);
+            function __() {
+              this.constructor = d;
+            }
+            d.prototype =
+              b === null
+                ? Object.create(b)
+                : ((__.prototype = b.prototype), new __());
+          };
+        })();
+      var ToolbarButton = (function (_super2) {
+        __extends$d(ToolbarButton2, _super2);
+        function ToolbarButton2(props) {
+          var _this = _super2.call(this, props) || this;
+          _this.handleClick = function () {
+            try {
+              _this.props.onClick();
+              _this.setState({ error: null });
+            } catch (error2) {
+              _this.setState({ error: error2 });
+            }
+          };
+          _this.state = { error: null };
+          return _this;
+        }
+        ToolbarButton2.prototype.render = function () {
+          var error2 = this.state.error;
+          return React$1.createElement(
+            "button",
+            {
+              className: "toolbar-button" + (error2 ? " error" : ""),
+              onClick: this.handleClick,
+              title: error2 ? error2.message : this.props.title,
+              "aria-invalid": error2 ? "true" : "false",
+            },
+            this.props.label
+          );
+        };
+        return ToolbarButton2;
+      })(React$1.Component);
+      function ToolbarGroup(_a2) {
+        var children = _a2.children;
+        return React$1.createElement(
+          "div",
+          { className: "toolbar-button-group" },
+          children
+        );
+      }
+      var __extends$c =
+        (globalThis && globalThis.__extends) ||
+        (function () {
+          var extendStatics = function (d, b) {
+            extendStatics =
+              Object.setPrototypeOf ||
+              ({ __proto__: [] } instanceof Array &&
+                function (d2, b2) {
+                  d2.__proto__ = b2;
+                }) ||
+              function (d2, b2) {
+                for (var p2 in b2)
+                  if (Object.prototype.hasOwnProperty.call(b2, p2))
+                    d2[p2] = b2[p2];
+              };
+            return extendStatics(d, b);
+          };
+          return function (d, b) {
+            extendStatics(d, b);
+            function __() {
+              this.constructor = d;
+            }
+            d.prototype =
+              b === null
+                ? Object.create(b)
+                : ((__.prototype = b.prototype), new __());
+          };
+        })();
+      var ToolbarMenu = (function (_super2) {
+        __extends$c(ToolbarMenu2, _super2);
+        function ToolbarMenu2(props) {
+          var _this = _super2.call(this, props) || this;
+          _this._node = null;
+          _this._listener = null;
+          _this.handleOpen = function (e) {
+            preventDefault$1(e);
+            _this.setState({ visible: true });
+            _this._subscribe();
+          };
+          _this.state = { visible: false };
+          return _this;
+        }
+        ToolbarMenu2.prototype.componentWillUnmount = function () {
+          this._release();
+        };
+        ToolbarMenu2.prototype.render = function () {
+          var _this = this;
+          var visible = this.state.visible;
+          return React$1.createElement(
+            "a",
+            {
+              className: "toolbar-menu toolbar-button",
+              onClick: this.handleOpen.bind(this),
+              onMouseDown: preventDefault$1,
+              ref: function (node) {
+                if (node) {
+                  _this._node = node;
+                }
+              },
+              title: this.props.title,
+            },
+            this.props.label,
+            React$1.createElement(
+              "svg",
+              { width: "14", height: "8" },
+              React$1.createElement("path", {
+                fill: "#666",
+                d: "M 5 1.5 L 14 1.5 L 9.5 7 z",
+              })
+            ),
+            React$1.createElement(
+              "ul",
+              { className: "toolbar-menu-items" + (visible ? " open" : "") },
+              this.props.children
+            )
+          );
+        };
+        ToolbarMenu2.prototype._subscribe = function () {
+          if (!this._listener) {
+            this._listener = this.handleClick.bind(this);
+            document.addEventListener("click", this._listener);
+          }
+        };
+        ToolbarMenu2.prototype._release = function () {
+          if (this._listener) {
+            document.removeEventListener("click", this._listener);
+            this._listener = null;
+          }
+        };
+        ToolbarMenu2.prototype.handleClick = function (e) {
+          if (this._node !== e.target) {
+            e.preventDefault();
+            this.setState({ visible: false });
+            this._release();
+          }
+        };
+        return ToolbarMenu2;
+      })(React$1.Component);
+      var ToolbarMenuItem = function (_a2) {
+        var onSelect = _a2.onSelect,
+          title = _a2.title,
+          label = _a2.label;
+        return React$1.createElement(
+          "li",
+          {
+            onMouseOver: function (e) {
+              e.currentTarget.className = "hover";
+            },
+            onMouseOut: function (e) {
+              e.currentTarget.className = "";
+            },
+            onMouseDown: preventDefault$1,
+            onMouseUp: onSelect,
+            title,
+          },
+          label
+        );
+      };
+      function preventDefault$1(e) {
+        e.preventDefault();
+      }
+      var utils$1 = {};
+      const Aacute = "\xC1";
+      const aacute = "\xE1";
+      const Abreve = "\u0102";
+      const abreve = "\u0103";
+      const ac = "\u223E";
+      const acd = "\u223F";
+      const acE = "\u223E\u0333";
+      const Acirc = "\xC2";
+      const acirc = "\xE2";
+      const acute = "\xB4";
+      const Acy = "\u0410";
+      const acy = "\u0430";
+      const AElig = "\xC6";
+      const aelig = "\xE6";
+      const af = "\u2061";
+      const Afr = "\u{1D504}";
+      const afr = "\u{1D51E}";
+      const Agrave = "\xC0";
+      const agrave = "\xE0";
+      const alefsym = "\u2135";
+      const aleph = "\u2135";
+      const Alpha = "\u0391";
+      const alpha = "\u03B1";
+      const Amacr = "\u0100";
+      const amacr = "\u0101";
+      const amalg = "\u2A3F";
+      const amp = "&";
+      const AMP = "&";
+      const andand = "\u2A55";
+      const And = "\u2A53";
+      const and = "\u2227";
+      const andd = "\u2A5C";
+      const andslope = "\u2A58";
+      const andv = "\u2A5A";
+      const ang = "\u2220";
+      const ange = "\u29A4";
+      const angle = "\u2220";
+      const angmsdaa = "\u29A8";
+      const angmsdab = "\u29A9";
+      const angmsdac = "\u29AA";
+      const angmsdad = "\u29AB";
+      const angmsdae = "\u29AC";
+      const angmsdaf = "\u29AD";
+      const angmsdag = "\u29AE";
+      const angmsdah = "\u29AF";
+      const angmsd = "\u2221";
+      const angrt = "\u221F";
+      const angrtvb = "\u22BE";
+      const angrtvbd = "\u299D";
+      const angsph = "\u2222";
+      const angst = "\xC5";
+      const angzarr = "\u237C";
+      const Aogon = "\u0104";
+      const aogon = "\u0105";
+      const Aopf = "\u{1D538}";
+      const aopf = "\u{1D552}";
+      const apacir = "\u2A6F";
+      const ap = "\u2248";
+      const apE = "\u2A70";
+      const ape = "\u224A";
+      const apid = "\u224B";
+      const apos = "'";
+      const ApplyFunction = "\u2061";
+      const approx = "\u2248";
+      const approxeq = "\u224A";
+      const Aring = "\xC5";
+      const aring = "\xE5";
+      const Ascr = "\u{1D49C}";
+      const ascr = "\u{1D4B6}";
+      const Assign = "\u2254";
+      const ast = "*";
+      const asymp = "\u2248";
+      const asympeq = "\u224D";
+      const Atilde = "\xC3";
+      const atilde = "\xE3";
+      const Auml = "\xC4";
+      const auml = "\xE4";
+      const awconint = "\u2233";
+      const awint = "\u2A11";
+      const backcong = "\u224C";
+      const backepsilon = "\u03F6";
+      const backprime = "\u2035";
+      const backsim = "\u223D";
+      const backsimeq = "\u22CD";
+      const Backslash = "\u2216";
+      const Barv = "\u2AE7";
+      const barvee = "\u22BD";
+      const barwed = "\u2305";
+      const Barwed = "\u2306";
+      const barwedge = "\u2305";
+      const bbrk = "\u23B5";
+      const bbrktbrk = "\u23B6";
+      const bcong = "\u224C";
+      const Bcy = "\u0411";
+      const bcy = "\u0431";
+      const bdquo = "\u201E";
+      const becaus = "\u2235";
+      const because = "\u2235";
+      const Because = "\u2235";
+      const bemptyv = "\u29B0";
+      const bepsi = "\u03F6";
+      const bernou = "\u212C";
+      const Bernoullis = "\u212C";
+      const Beta = "\u0392";
+      const beta = "\u03B2";
+      const beth = "\u2136";
+      const between = "\u226C";
+      const Bfr = "\u{1D505}";
+      const bfr = "\u{1D51F}";
+      const bigcap = "\u22C2";
+      const bigcirc = "\u25EF";
+      const bigcup = "\u22C3";
+      const bigodot = "\u2A00";
+      const bigoplus = "\u2A01";
+      const bigotimes = "\u2A02";
+      const bigsqcup = "\u2A06";
+      const bigstar = "\u2605";
+      const bigtriangledown = "\u25BD";
+      const bigtriangleup = "\u25B3";
+      const biguplus = "\u2A04";
+      const bigvee = "\u22C1";
+      const bigwedge = "\u22C0";
+      const bkarow = "\u290D";
+      const blacklozenge = "\u29EB";
+      const blacksquare = "\u25AA";
+      const blacktriangle = "\u25B4";
+      const blacktriangledown = "\u25BE";
+      const blacktriangleleft = "\u25C2";
+      const blacktriangleright = "\u25B8";
+      const blank = "\u2423";
+      const blk12 = "\u2592";
+      const blk14 = "\u2591";
+      const blk34 = "\u2593";
+      const block$2 = "\u2588";
+      const bne = "=\u20E5";
+      const bnequiv = "\u2261\u20E5";
+      const bNot = "\u2AED";
+      const bnot = "\u2310";
+      const Bopf = "\u{1D539}";
+      const bopf = "\u{1D553}";
+      const bot = "\u22A5";
+      const bottom = "\u22A5";
+      const bowtie = "\u22C8";
+      const boxbox = "\u29C9";
+      const boxdl = "\u2510";
+      const boxdL = "\u2555";
+      const boxDl = "\u2556";
+      const boxDL = "\u2557";
+      const boxdr = "\u250C";
+      const boxdR = "\u2552";
+      const boxDr = "\u2553";
+      const boxDR = "\u2554";
+      const boxh = "\u2500";
+      const boxH = "\u2550";
+      const boxhd = "\u252C";
+      const boxHd = "\u2564";
+      const boxhD = "\u2565";
+      const boxHD = "\u2566";
+      const boxhu = "\u2534";
+      const boxHu = "\u2567";
+      const boxhU = "\u2568";
+      const boxHU = "\u2569";
+      const boxminus = "\u229F";
+      const boxplus = "\u229E";
+      const boxtimes = "\u22A0";
+      const boxul = "\u2518";
+      const boxuL = "\u255B";
+      const boxUl = "\u255C";
+      const boxUL = "\u255D";
+      const boxur = "\u2514";
+      const boxuR = "\u2558";
+      const boxUr = "\u2559";
+      const boxUR = "\u255A";
+      const boxv = "\u2502";
+      const boxV = "\u2551";
+      const boxvh = "\u253C";
+      const boxvH = "\u256A";
+      const boxVh = "\u256B";
+      const boxVH = "\u256C";
+      const boxvl = "\u2524";
+      const boxvL = "\u2561";
+      const boxVl = "\u2562";
+      const boxVL = "\u2563";
+      const boxvr = "\u251C";
+      const boxvR = "\u255E";
+      const boxVr = "\u255F";
+      const boxVR = "\u2560";
+      const bprime = "\u2035";
+      const breve = "\u02D8";
+      const Breve = "\u02D8";
+      const brvbar = "\xA6";
+      const bscr = "\u{1D4B7}";
+      const Bscr = "\u212C";
+      const bsemi = "\u204F";
+      const bsim = "\u223D";
+      const bsime = "\u22CD";
+      const bsolb = "\u29C5";
+      const bsol = "\\";
+      const bsolhsub = "\u27C8";
+      const bull = "\u2022";
+      const bullet = "\u2022";
+      const bump = "\u224E";
+      const bumpE = "\u2AAE";
+      const bumpe = "\u224F";
+      const Bumpeq = "\u224E";
+      const bumpeq = "\u224F";
+      const Cacute = "\u0106";
+      const cacute = "\u0107";
+      const capand = "\u2A44";
+      const capbrcup = "\u2A49";
+      const capcap = "\u2A4B";
+      const cap = "\u2229";
+      const Cap = "\u22D2";
+      const capcup = "\u2A47";
+      const capdot = "\u2A40";
+      const CapitalDifferentialD = "\u2145";
+      const caps = "\u2229\uFE00";
+      const caret = "\u2041";
+      const caron = "\u02C7";
+      const Cayleys = "\u212D";
+      const ccaps = "\u2A4D";
+      const Ccaron = "\u010C";
+      const ccaron = "\u010D";
+      const Ccedil = "\xC7";
+      const ccedil = "\xE7";
+      const Ccirc = "\u0108";
+      const ccirc = "\u0109";
+      const Cconint = "\u2230";
+      const ccups = "\u2A4C";
+      const ccupssm = "\u2A50";
+      const Cdot = "\u010A";
+      const cdot = "\u010B";
+      const cedil = "\xB8";
+      const Cedilla = "\xB8";
+      const cemptyv = "\u29B2";
+      const cent = "\xA2";
+      const centerdot = "\xB7";
+      const CenterDot = "\xB7";
+      const cfr = "\u{1D520}";
+      const Cfr = "\u212D";
+      const CHcy = "\u0427";
+      const chcy = "\u0447";
+      const check = "\u2713";
+      const checkmark = "\u2713";
+      const Chi = "\u03A7";
+      const chi = "\u03C7";
+      const circ = "\u02C6";
+      const circeq = "\u2257";
+      const circlearrowleft = "\u21BA";
+      const circlearrowright = "\u21BB";
+      const circledast = "\u229B";
+      const circledcirc = "\u229A";
+      const circleddash = "\u229D";
+      const CircleDot = "\u2299";
+      const circledR = "\xAE";
+      const circledS = "\u24C8";
+      const CircleMinus = "\u2296";
+      const CirclePlus = "\u2295";
+      const CircleTimes = "\u2297";
+      const cir = "\u25CB";
+      const cirE = "\u29C3";
+      const cire = "\u2257";
+      const cirfnint = "\u2A10";
+      const cirmid = "\u2AEF";
+      const cirscir = "\u29C2";
+      const ClockwiseContourIntegral = "\u2232";
+      const CloseCurlyDoubleQuote = "\u201D";
+      const CloseCurlyQuote = "\u2019";
+      const clubs = "\u2663";
+      const clubsuit = "\u2663";
+      const colon = ":";
+      const Colon = "\u2237";
+      const Colone = "\u2A74";
+      const colone = "\u2254";
+      const coloneq = "\u2254";
+      const comma = ",";
+      const commat = "@";
+      const comp = "\u2201";
+      const compfn = "\u2218";
+      const complement = "\u2201";
+      const complexes = "\u2102";
+      const cong = "\u2245";
+      const congdot = "\u2A6D";
+      const Congruent = "\u2261";
+      const conint = "\u222E";
+      const Conint = "\u222F";
+      const ContourIntegral = "\u222E";
+      const copf = "\u{1D554}";
+      const Copf = "\u2102";
+      const coprod = "\u2210";
+      const Coproduct = "\u2210";
+      const copy = "\xA9";
+      const COPY = "\xA9";
+      const copysr = "\u2117";
+      const CounterClockwiseContourIntegral = "\u2233";
+      const crarr = "\u21B5";
+      const cross = "\u2717";
+      const Cross = "\u2A2F";
+      const Cscr = "\u{1D49E}";
+      const cscr = "\u{1D4B8}";
+      const csub = "\u2ACF";
+      const csube = "\u2AD1";
+      const csup = "\u2AD0";
+      const csupe = "\u2AD2";
+      const ctdot = "\u22EF";
+      const cudarrl = "\u2938";
+      const cudarrr = "\u2935";
+      const cuepr = "\u22DE";
+      const cuesc = "\u22DF";
+      const cularr = "\u21B6";
+      const cularrp = "\u293D";
+      const cupbrcap = "\u2A48";
+      const cupcap = "\u2A46";
+      const CupCap = "\u224D";
+      const cup = "\u222A";
+      const Cup = "\u22D3";
+      const cupcup = "\u2A4A";
+      const cupdot = "\u228D";
+      const cupor = "\u2A45";
+      const cups = "\u222A\uFE00";
+      const curarr = "\u21B7";
+      const curarrm = "\u293C";
+      const curlyeqprec = "\u22DE";
+      const curlyeqsucc = "\u22DF";
+      const curlyvee = "\u22CE";
+      const curlywedge = "\u22CF";
+      const curren = "\xA4";
+      const curvearrowleft = "\u21B6";
+      const curvearrowright = "\u21B7";
+      const cuvee = "\u22CE";
+      const cuwed = "\u22CF";
+      const cwconint = "\u2232";
+      const cwint = "\u2231";
+      const cylcty = "\u232D";
+      const dagger = "\u2020";
+      const Dagger = "\u2021";
+      const daleth = "\u2138";
+      const darr = "\u2193";
+      const Darr = "\u21A1";
+      const dArr = "\u21D3";
+      const dash = "\u2010";
+      const Dashv = "\u2AE4";
+      const dashv = "\u22A3";
+      const dbkarow = "\u290F";
+      const dblac = "\u02DD";
+      const Dcaron = "\u010E";
+      const dcaron = "\u010F";
+      const Dcy = "\u0414";
+      const dcy = "\u0434";
+      const ddagger = "\u2021";
+      const ddarr = "\u21CA";
+      const DD = "\u2145";
+      const dd = "\u2146";
+      const DDotrahd = "\u2911";
+      const ddotseq = "\u2A77";
+      const deg = "\xB0";
+      const Del = "\u2207";
+      const Delta = "\u0394";
+      const delta = "\u03B4";
+      const demptyv = "\u29B1";
+      const dfisht = "\u297F";
+      const Dfr = "\u{1D507}";
+      const dfr = "\u{1D521}";
+      const dHar = "\u2965";
+      const dharl = "\u21C3";
+      const dharr = "\u21C2";
+      const DiacriticalAcute = "\xB4";
+      const DiacriticalDot = "\u02D9";
+      const DiacriticalDoubleAcute = "\u02DD";
+      const DiacriticalGrave = "`";
+      const DiacriticalTilde = "\u02DC";
+      const diam = "\u22C4";
+      const diamond = "\u22C4";
+      const Diamond = "\u22C4";
+      const diamondsuit = "\u2666";
+      const diams = "\u2666";
+      const die = "\xA8";
+      const DifferentialD = "\u2146";
+      const digamma = "\u03DD";
+      const disin = "\u22F2";
+      const div = "\xF7";
+      const divide = "\xF7";
+      const divideontimes = "\u22C7";
+      const divonx = "\u22C7";
+      const DJcy = "\u0402";
+      const djcy = "\u0452";
+      const dlcorn = "\u231E";
+      const dlcrop = "\u230D";
+      const dollar = "$";
+      const Dopf = "\u{1D53B}";
+      const dopf = "\u{1D555}";
+      const Dot = "\xA8";
+      const dot = "\u02D9";
+      const DotDot = "\u20DC";
+      const doteq = "\u2250";
+      const doteqdot = "\u2251";
+      const DotEqual = "\u2250";
+      const dotminus = "\u2238";
+      const dotplus = "\u2214";
+      const dotsquare = "\u22A1";
+      const doublebarwedge = "\u2306";
+      const DoubleContourIntegral = "\u222F";
+      const DoubleDot = "\xA8";
+      const DoubleDownArrow = "\u21D3";
+      const DoubleLeftArrow = "\u21D0";
+      const DoubleLeftRightArrow = "\u21D4";
+      const DoubleLeftTee = "\u2AE4";
+      const DoubleLongLeftArrow = "\u27F8";
+      const DoubleLongLeftRightArrow = "\u27FA";
+      const DoubleLongRightArrow = "\u27F9";
+      const DoubleRightArrow = "\u21D2";
+      const DoubleRightTee = "\u22A8";
+      const DoubleUpArrow = "\u21D1";
+      const DoubleUpDownArrow = "\u21D5";
+      const DoubleVerticalBar = "\u2225";
+      const DownArrowBar = "\u2913";
+      const downarrow = "\u2193";
+      const DownArrow = "\u2193";
+      const Downarrow = "\u21D3";
+      const DownArrowUpArrow = "\u21F5";
+      const DownBreve = "\u0311";
+      const downdownarrows = "\u21CA";
+      const downharpoonleft = "\u21C3";
+      const downharpoonright = "\u21C2";
+      const DownLeftRightVector = "\u2950";
+      const DownLeftTeeVector = "\u295E";
+      const DownLeftVectorBar = "\u2956";
+      const DownLeftVector = "\u21BD";
+      const DownRightTeeVector = "\u295F";
+      const DownRightVectorBar = "\u2957";
+      const DownRightVector = "\u21C1";
+      const DownTeeArrow = "\u21A7";
+      const DownTee = "\u22A4";
+      const drbkarow = "\u2910";
+      const drcorn = "\u231F";
+      const drcrop = "\u230C";
+      const Dscr = "\u{1D49F}";
+      const dscr = "\u{1D4B9}";
+      const DScy = "\u0405";
+      const dscy = "\u0455";
+      const dsol = "\u29F6";
+      const Dstrok = "\u0110";
+      const dstrok = "\u0111";
+      const dtdot = "\u22F1";
+      const dtri = "\u25BF";
+      const dtrif = "\u25BE";
+      const duarr = "\u21F5";
+      const duhar = "\u296F";
+      const dwangle = "\u29A6";
+      const DZcy = "\u040F";
+      const dzcy = "\u045F";
+      const dzigrarr = "\u27FF";
+      const Eacute = "\xC9";
+      const eacute = "\xE9";
+      const easter = "\u2A6E";
+      const Ecaron = "\u011A";
+      const ecaron = "\u011B";
+      const Ecirc = "\xCA";
+      const ecirc = "\xEA";
+      const ecir = "\u2256";
+      const ecolon = "\u2255";
+      const Ecy = "\u042D";
+      const ecy = "\u044D";
+      const eDDot = "\u2A77";
+      const Edot = "\u0116";
+      const edot = "\u0117";
+      const eDot = "\u2251";
+      const ee = "\u2147";
+      const efDot = "\u2252";
+      const Efr = "\u{1D508}";
+      const efr = "\u{1D522}";
+      const eg = "\u2A9A";
+      const Egrave = "\xC8";
+      const egrave = "\xE8";
+      const egs = "\u2A96";
+      const egsdot = "\u2A98";
+      const el = "\u2A99";
+      const Element = "\u2208";
+      const elinters = "\u23E7";
+      const ell = "\u2113";
+      const els = "\u2A95";
+      const elsdot = "\u2A97";
+      const Emacr = "\u0112";
+      const emacr = "\u0113";
+      const empty = "\u2205";
+      const emptyset = "\u2205";
+      const EmptySmallSquare = "\u25FB";
+      const emptyv = "\u2205";
+      const EmptyVerySmallSquare = "\u25AB";
+      const emsp13 = "\u2004";
+      const emsp14 = "\u2005";
+      const emsp = "\u2003";
+      const ENG = "\u014A";
+      const eng = "\u014B";
+      const ensp = "\u2002";
+      const Eogon = "\u0118";
+      const eogon = "\u0119";
+      const Eopf = "\u{1D53C}";
+      const eopf = "\u{1D556}";
+      const epar = "\u22D5";
+      const eparsl = "\u29E3";
+      const eplus = "\u2A71";
+      const epsi = "\u03B5";
+      const Epsilon = "\u0395";
+      const epsilon = "\u03B5";
+      const epsiv = "\u03F5";
+      const eqcirc = "\u2256";
+      const eqcolon = "\u2255";
+      const eqsim = "\u2242";
+      const eqslantgtr = "\u2A96";
+      const eqslantless = "\u2A95";
+      const Equal = "\u2A75";
+      const equals = "=";
+      const EqualTilde = "\u2242";
+      const equest = "\u225F";
+      const Equilibrium = "\u21CC";
+      const equiv = "\u2261";
+      const equivDD = "\u2A78";
+      const eqvparsl = "\u29E5";
+      const erarr = "\u2971";
+      const erDot = "\u2253";
+      const escr = "\u212F";
+      const Escr = "\u2130";
+      const esdot = "\u2250";
+      const Esim = "\u2A73";
+      const esim = "\u2242";
+      const Eta = "\u0397";
+      const eta = "\u03B7";
+      const ETH = "\xD0";
+      const eth = "\xF0";
+      const Euml = "\xCB";
+      const euml = "\xEB";
+      const euro = "\u20AC";
+      const excl = "!";
+      const exist = "\u2203";
+      const Exists = "\u2203";
+      const expectation = "\u2130";
+      const exponentiale = "\u2147";
+      const ExponentialE = "\u2147";
+      const fallingdotseq = "\u2252";
+      const Fcy = "\u0424";
+      const fcy = "\u0444";
+      const female = "\u2640";
+      const ffilig = "\uFB03";
+      const fflig = "\uFB00";
+      const ffllig = "\uFB04";
+      const Ffr = "\u{1D509}";
+      const ffr = "\u{1D523}";
+      const filig = "\uFB01";
+      const FilledSmallSquare = "\u25FC";
+      const FilledVerySmallSquare = "\u25AA";
+      const fjlig = "fj";
+      const flat = "\u266D";
+      const fllig = "\uFB02";
+      const fltns = "\u25B1";
+      const fnof = "\u0192";
+      const Fopf = "\u{1D53D}";
+      const fopf = "\u{1D557}";
+      const forall = "\u2200";
+      const ForAll = "\u2200";
+      const fork = "\u22D4";
+      const forkv = "\u2AD9";
+      const Fouriertrf = "\u2131";
+      const fpartint = "\u2A0D";
+      const frac12 = "\xBD";
+      const frac13 = "\u2153";
+      const frac14 = "\xBC";
+      const frac15 = "\u2155";
+      const frac16 = "\u2159";
+      const frac18 = "\u215B";
+      const frac23 = "\u2154";
+      const frac25 = "\u2156";
+      const frac34 = "\xBE";
+      const frac35 = "\u2157";
+      const frac38 = "\u215C";
+      const frac45 = "\u2158";
+      const frac56 = "\u215A";
+      const frac58 = "\u215D";
+      const frac78 = "\u215E";
+      const frasl = "\u2044";
+      const frown = "\u2322";
+      const fscr = "\u{1D4BB}";
+      const Fscr = "\u2131";
+      const gacute = "\u01F5";
+      const Gamma = "\u0393";
+      const gamma = "\u03B3";
+      const Gammad = "\u03DC";
+      const gammad = "\u03DD";
+      const gap = "\u2A86";
+      const Gbreve = "\u011E";
+      const gbreve = "\u011F";
+      const Gcedil = "\u0122";
+      const Gcirc = "\u011C";
+      const gcirc = "\u011D";
+      const Gcy = "\u0413";
+      const gcy = "\u0433";
+      const Gdot = "\u0120";
+      const gdot = "\u0121";
+      const ge = "\u2265";
+      const gE = "\u2267";
+      const gEl = "\u2A8C";
+      const gel = "\u22DB";
+      const geq = "\u2265";
+      const geqq = "\u2267";
+      const geqslant = "\u2A7E";
+      const gescc = "\u2AA9";
+      const ges = "\u2A7E";
+      const gesdot = "\u2A80";
+      const gesdoto = "\u2A82";
+      const gesdotol = "\u2A84";
+      const gesl = "\u22DB\uFE00";
+      const gesles = "\u2A94";
+      const Gfr = "\u{1D50A}";
+      const gfr = "\u{1D524}";
+      const gg = "\u226B";
+      const Gg = "\u22D9";
+      const ggg = "\u22D9";
+      const gimel = "\u2137";
+      const GJcy = "\u0403";
+      const gjcy = "\u0453";
+      const gla = "\u2AA5";
+      const gl = "\u2277";
+      const glE = "\u2A92";
+      const glj = "\u2AA4";
+      const gnap = "\u2A8A";
+      const gnapprox = "\u2A8A";
+      const gne = "\u2A88";
+      const gnE = "\u2269";
+      const gneq = "\u2A88";
+      const gneqq = "\u2269";
+      const gnsim = "\u22E7";
+      const Gopf = "\u{1D53E}";
+      const gopf = "\u{1D558}";
+      const grave = "`";
+      const GreaterEqual = "\u2265";
+      const GreaterEqualLess = "\u22DB";
+      const GreaterFullEqual = "\u2267";
+      const GreaterGreater = "\u2AA2";
+      const GreaterLess = "\u2277";
+      const GreaterSlantEqual = "\u2A7E";
+      const GreaterTilde = "\u2273";
+      const Gscr = "\u{1D4A2}";
+      const gscr = "\u210A";
+      const gsim = "\u2273";
+      const gsime = "\u2A8E";
+      const gsiml = "\u2A90";
+      const gtcc = "\u2AA7";
+      const gtcir = "\u2A7A";
+      const gt = ">";
+      const GT = ">";
+      const Gt = "\u226B";
+      const gtdot = "\u22D7";
+      const gtlPar = "\u2995";
+      const gtquest = "\u2A7C";
+      const gtrapprox = "\u2A86";
+      const gtrarr = "\u2978";
+      const gtrdot = "\u22D7";
+      const gtreqless = "\u22DB";
+      const gtreqqless = "\u2A8C";
+      const gtrless = "\u2277";
+      const gtrsim = "\u2273";
+      const gvertneqq = "\u2269\uFE00";
+      const gvnE = "\u2269\uFE00";
+      const Hacek = "\u02C7";
+      const hairsp = "\u200A";
+      const half = "\xBD";
+      const hamilt = "\u210B";
+      const HARDcy = "\u042A";
+      const hardcy = "\u044A";
+      const harrcir = "\u2948";
+      const harr = "\u2194";
+      const hArr = "\u21D4";
+      const harrw = "\u21AD";
+      const Hat = "^";
+      const hbar = "\u210F";
+      const Hcirc = "\u0124";
+      const hcirc = "\u0125";
+      const hearts = "\u2665";
+      const heartsuit = "\u2665";
+      const hellip = "\u2026";
+      const hercon = "\u22B9";
+      const hfr = "\u{1D525}";
+      const Hfr = "\u210C";
+      const HilbertSpace = "\u210B";
+      const hksearow = "\u2925";
+      const hkswarow = "\u2926";
+      const hoarr = "\u21FF";
+      const homtht = "\u223B";
+      const hookleftarrow = "\u21A9";
+      const hookrightarrow = "\u21AA";
+      const hopf = "\u{1D559}";
+      const Hopf = "\u210D";
+      const horbar = "\u2015";
+      const HorizontalLine = "\u2500";
+      const hscr = "\u{1D4BD}";
+      const Hscr = "\u210B";
+      const hslash = "\u210F";
+      const Hstrok = "\u0126";
+      const hstrok = "\u0127";
+      const HumpDownHump = "\u224E";
+      const HumpEqual = "\u224F";
+      const hybull = "\u2043";
+      const hyphen = "\u2010";
+      const Iacute = "\xCD";
+      const iacute = "\xED";
+      const ic = "\u2063";
+      const Icirc = "\xCE";
+      const icirc = "\xEE";
+      const Icy = "\u0418";
+      const icy = "\u0438";
+      const Idot = "\u0130";
+      const IEcy = "\u0415";
+      const iecy = "\u0435";
+      const iexcl = "\xA1";
+      const iff = "\u21D4";
+      const ifr = "\u{1D526}";
+      const Ifr = "\u2111";
+      const Igrave = "\xCC";
+      const igrave = "\xEC";
+      const ii = "\u2148";
+      const iiiint = "\u2A0C";
+      const iiint = "\u222D";
+      const iinfin = "\u29DC";
+      const iiota = "\u2129";
+      const IJlig = "\u0132";
+      const ijlig = "\u0133";
+      const Imacr = "\u012A";
+      const imacr = "\u012B";
+      const image$1 = "\u2111";
+      const ImaginaryI = "\u2148";
+      const imagline = "\u2110";
+      const imagpart = "\u2111";
+      const imath = "\u0131";
+      const Im = "\u2111";
+      const imof = "\u22B7";
+      const imped = "\u01B5";
+      const Implies = "\u21D2";
+      const incare = "\u2105";
+      const infin = "\u221E";
+      const infintie = "\u29DD";
+      const inodot = "\u0131";
+      const intcal = "\u22BA";
+      const int = "\u222B";
+      const Int = "\u222C";
+      const integers = "\u2124";
+      const Integral = "\u222B";
+      const intercal = "\u22BA";
+      const Intersection = "\u22C2";
+      const intlarhk = "\u2A17";
+      const intprod = "\u2A3C";
+      const InvisibleComma = "\u2063";
+      const InvisibleTimes = "\u2062";
+      const IOcy = "\u0401";
+      const iocy = "\u0451";
+      const Iogon = "\u012E";
+      const iogon = "\u012F";
+      const Iopf = "\u{1D540}";
+      const iopf = "\u{1D55A}";
+      const Iota = "\u0399";
+      const iota = "\u03B9";
+      const iprod = "\u2A3C";
+      const iquest = "\xBF";
+      const iscr = "\u{1D4BE}";
+      const Iscr = "\u2110";
+      const isin = "\u2208";
+      const isindot = "\u22F5";
+      const isinE = "\u22F9";
+      const isins = "\u22F4";
+      const isinsv = "\u22F3";
+      const isinv = "\u2208";
+      const it = "\u2062";
+      const Itilde = "\u0128";
+      const itilde = "\u0129";
+      const Iukcy = "\u0406";
+      const iukcy = "\u0456";
+      const Iuml = "\xCF";
+      const iuml = "\xEF";
+      const Jcirc = "\u0134";
+      const jcirc = "\u0135";
+      const Jcy = "\u0419";
+      const jcy = "\u0439";
+      const Jfr = "\u{1D50D}";
+      const jfr = "\u{1D527}";
+      const jmath = "\u0237";
+      const Jopf = "\u{1D541}";
+      const jopf = "\u{1D55B}";
+      const Jscr = "\u{1D4A5}";
+      const jscr = "\u{1D4BF}";
+      const Jsercy = "\u0408";
+      const jsercy = "\u0458";
+      const Jukcy = "\u0404";
+      const jukcy = "\u0454";
+      const Kappa = "\u039A";
+      const kappa = "\u03BA";
+      const kappav = "\u03F0";
+      const Kcedil = "\u0136";
+      const kcedil = "\u0137";
+      const Kcy = "\u041A";
+      const kcy = "\u043A";
+      const Kfr = "\u{1D50E}";
+      const kfr = "\u{1D528}";
+      const kgreen = "\u0138";
+      const KHcy = "\u0425";
+      const khcy = "\u0445";
+      const KJcy = "\u040C";
+      const kjcy = "\u045C";
+      const Kopf = "\u{1D542}";
+      const kopf = "\u{1D55C}";
+      const Kscr = "\u{1D4A6}";
+      const kscr = "\u{1D4C0}";
+      const lAarr = "\u21DA";
+      const Lacute = "\u0139";
+      const lacute = "\u013A";
+      const laemptyv = "\u29B4";
+      const lagran = "\u2112";
+      const Lambda = "\u039B";
+      const lambda = "\u03BB";
+      const lang = "\u27E8";
+      const Lang = "\u27EA";
+      const langd = "\u2991";
+      const langle = "\u27E8";
+      const lap = "\u2A85";
+      const Laplacetrf = "\u2112";
+      const laquo = "\xAB";
+      const larrb = "\u21E4";
+      const larrbfs = "\u291F";
+      const larr = "\u2190";
+      const Larr = "\u219E";
+      const lArr = "\u21D0";
+      const larrfs = "\u291D";
+      const larrhk = "\u21A9";
+      const larrlp = "\u21AB";
+      const larrpl = "\u2939";
+      const larrsim = "\u2973";
+      const larrtl = "\u21A2";
+      const latail = "\u2919";
+      const lAtail = "\u291B";
+      const lat = "\u2AAB";
+      const late = "\u2AAD";
+      const lates = "\u2AAD\uFE00";
+      const lbarr = "\u290C";
+      const lBarr = "\u290E";
+      const lbbrk = "\u2772";
+      const lbrace = "{";
+      const lbrack = "[";
+      const lbrke = "\u298B";
+      const lbrksld = "\u298F";
+      const lbrkslu = "\u298D";
+      const Lcaron = "\u013D";
+      const lcaron = "\u013E";
+      const Lcedil = "\u013B";
+      const lcedil = "\u013C";
+      const lceil = "\u2308";
+      const lcub = "{";
+      const Lcy = "\u041B";
+      const lcy = "\u043B";
+      const ldca = "\u2936";
+      const ldquo = "\u201C";
+      const ldquor = "\u201E";
+      const ldrdhar = "\u2967";
+      const ldrushar = "\u294B";
+      const ldsh = "\u21B2";
+      const le = "\u2264";
+      const lE = "\u2266";
+      const LeftAngleBracket = "\u27E8";
+      const LeftArrowBar = "\u21E4";
+      const leftarrow = "\u2190";
+      const LeftArrow = "\u2190";
+      const Leftarrow = "\u21D0";
+      const LeftArrowRightArrow = "\u21C6";
+      const leftarrowtail = "\u21A2";
+      const LeftCeiling = "\u2308";
+      const LeftDoubleBracket = "\u27E6";
+      const LeftDownTeeVector = "\u2961";
+      const LeftDownVectorBar = "\u2959";
+      const LeftDownVector = "\u21C3";
+      const LeftFloor = "\u230A";
+      const leftharpoondown = "\u21BD";
+      const leftharpoonup = "\u21BC";
+      const leftleftarrows = "\u21C7";
+      const leftrightarrow = "\u2194";
+      const LeftRightArrow = "\u2194";
+      const Leftrightarrow = "\u21D4";
+      const leftrightarrows = "\u21C6";
+      const leftrightharpoons = "\u21CB";
+      const leftrightsquigarrow = "\u21AD";
+      const LeftRightVector = "\u294E";
+      const LeftTeeArrow = "\u21A4";
+      const LeftTee = "\u22A3";
+      const LeftTeeVector = "\u295A";
+      const leftthreetimes = "\u22CB";
+      const LeftTriangleBar = "\u29CF";
+      const LeftTriangle = "\u22B2";
+      const LeftTriangleEqual = "\u22B4";
+      const LeftUpDownVector = "\u2951";
+      const LeftUpTeeVector = "\u2960";
+      const LeftUpVectorBar = "\u2958";
+      const LeftUpVector = "\u21BF";
+      const LeftVectorBar = "\u2952";
+      const LeftVector = "\u21BC";
+      const lEg = "\u2A8B";
+      const leg = "\u22DA";
+      const leq = "\u2264";
+      const leqq = "\u2266";
+      const leqslant = "\u2A7D";
+      const lescc = "\u2AA8";
+      const les = "\u2A7D";
+      const lesdot = "\u2A7F";
+      const lesdoto = "\u2A81";
+      const lesdotor = "\u2A83";
+      const lesg = "\u22DA\uFE00";
+      const lesges = "\u2A93";
+      const lessapprox = "\u2A85";
+      const lessdot = "\u22D6";
+      const lesseqgtr = "\u22DA";
+      const lesseqqgtr = "\u2A8B";
+      const LessEqualGreater = "\u22DA";
+      const LessFullEqual = "\u2266";
+      const LessGreater = "\u2276";
+      const lessgtr = "\u2276";
+      const LessLess = "\u2AA1";
+      const lesssim = "\u2272";
+      const LessSlantEqual = "\u2A7D";
+      const LessTilde = "\u2272";
+      const lfisht = "\u297C";
+      const lfloor = "\u230A";
+      const Lfr = "\u{1D50F}";
+      const lfr = "\u{1D529}";
+      const lg = "\u2276";
+      const lgE = "\u2A91";
+      const lHar = "\u2962";
+      const lhard = "\u21BD";
+      const lharu = "\u21BC";
+      const lharul = "\u296A";
+      const lhblk = "\u2584";
+      const LJcy = "\u0409";
+      const ljcy = "\u0459";
+      const llarr = "\u21C7";
+      const ll = "\u226A";
+      const Ll = "\u22D8";
+      const llcorner = "\u231E";
+      const Lleftarrow = "\u21DA";
+      const llhard = "\u296B";
+      const lltri = "\u25FA";
+      const Lmidot = "\u013F";
+      const lmidot = "\u0140";
+      const lmoustache = "\u23B0";
+      const lmoust = "\u23B0";
+      const lnap = "\u2A89";
+      const lnapprox = "\u2A89";
+      const lne = "\u2A87";
+      const lnE = "\u2268";
+      const lneq = "\u2A87";
+      const lneqq = "\u2268";
+      const lnsim = "\u22E6";
+      const loang = "\u27EC";
+      const loarr = "\u21FD";
+      const lobrk = "\u27E6";
+      const longleftarrow = "\u27F5";
+      const LongLeftArrow = "\u27F5";
+      const Longleftarrow = "\u27F8";
+      const longleftrightarrow = "\u27F7";
+      const LongLeftRightArrow = "\u27F7";
+      const Longleftrightarrow = "\u27FA";
+      const longmapsto = "\u27FC";
+      const longrightarrow = "\u27F6";
+      const LongRightArrow = "\u27F6";
+      const Longrightarrow = "\u27F9";
+      const looparrowleft = "\u21AB";
+      const looparrowright = "\u21AC";
+      const lopar = "\u2985";
+      const Lopf = "\u{1D543}";
+      const lopf = "\u{1D55D}";
+      const loplus = "\u2A2D";
+      const lotimes = "\u2A34";
+      const lowast = "\u2217";
+      const lowbar = "_";
+      const LowerLeftArrow = "\u2199";
+      const LowerRightArrow = "\u2198";
+      const loz = "\u25CA";
+      const lozenge = "\u25CA";
+      const lozf = "\u29EB";
+      const lpar = "(";
+      const lparlt = "\u2993";
+      const lrarr = "\u21C6";
+      const lrcorner = "\u231F";
+      const lrhar = "\u21CB";
+      const lrhard = "\u296D";
+      const lrm = "\u200E";
+      const lrtri = "\u22BF";
+      const lsaquo = "\u2039";
+      const lscr = "\u{1D4C1}";
+      const Lscr = "\u2112";
+      const lsh = "\u21B0";
+      const Lsh = "\u21B0";
+      const lsim = "\u2272";
+      const lsime = "\u2A8D";
+      const lsimg = "\u2A8F";
+      const lsqb = "[";
+      const lsquo = "\u2018";
+      const lsquor = "\u201A";
+      const Lstrok = "\u0141";
+      const lstrok = "\u0142";
+      const ltcc = "\u2AA6";
+      const ltcir = "\u2A79";
+      const lt = "<";
+      const LT = "<";
+      const Lt = "\u226A";
+      const ltdot = "\u22D6";
+      const lthree = "\u22CB";
+      const ltimes = "\u22C9";
+      const ltlarr = "\u2976";
+      const ltquest = "\u2A7B";
+      const ltri = "\u25C3";
+      const ltrie = "\u22B4";
+      const ltrif = "\u25C2";
+      const ltrPar = "\u2996";
+      const lurdshar = "\u294A";
+      const luruhar = "\u2966";
+      const lvertneqq = "\u2268\uFE00";
+      const lvnE = "\u2268\uFE00";
+      const macr = "\xAF";
+      const male = "\u2642";
+      const malt = "\u2720";
+      const maltese = "\u2720";
+      const map$1 = "\u21A6";
+      const mapsto = "\u21A6";
+      const mapstodown = "\u21A7";
+      const mapstoleft = "\u21A4";
+      const mapstoup = "\u21A5";
+      const marker = "\u25AE";
+      const mcomma = "\u2A29";
+      const Mcy = "\u041C";
+      const mcy = "\u043C";
+      const mdash = "\u2014";
+      const mDDot = "\u223A";
+      const measuredangle = "\u2221";
+      const MediumSpace = "\u205F";
+      const Mellintrf = "\u2133";
+      const Mfr = "\u{1D510}";
+      const mfr = "\u{1D52A}";
+      const mho = "\u2127";
+      const micro = "\xB5";
+      const midast = "*";
+      const midcir = "\u2AF0";
+      const mid = "\u2223";
+      const middot = "\xB7";
+      const minusb = "\u229F";
+      const minus = "\u2212";
+      const minusd = "\u2238";
+      const minusdu = "\u2A2A";
+      const MinusPlus = "\u2213";
+      const mlcp = "\u2ADB";
+      const mldr = "\u2026";
+      const mnplus = "\u2213";
+      const models = "\u22A7";
+      const Mopf = "\u{1D544}";
+      const mopf = "\u{1D55E}";
+      const mp = "\u2213";
+      const mscr = "\u{1D4C2}";
+      const Mscr = "\u2133";
+      const mstpos = "\u223E";
+      const Mu = "\u039C";
+      const mu = "\u03BC";
+      const multimap = "\u22B8";
+      const mumap = "\u22B8";
+      const nabla = "\u2207";
+      const Nacute = "\u0143";
+      const nacute = "\u0144";
+      const nang = "\u2220\u20D2";
+      const nap = "\u2249";
+      const napE = "\u2A70\u0338";
+      const napid = "\u224B\u0338";
+      const napos = "\u0149";
+      const napprox = "\u2249";
+      const natural = "\u266E";
+      const naturals = "\u2115";
+      const natur = "\u266E";
+      const nbsp = "\xA0";
+      const nbump = "\u224E\u0338";
+      const nbumpe = "\u224F\u0338";
+      const ncap = "\u2A43";
+      const Ncaron = "\u0147";
+      const ncaron = "\u0148";
+      const Ncedil = "\u0145";
+      const ncedil = "\u0146";
+      const ncong = "\u2247";
+      const ncongdot = "\u2A6D\u0338";
+      const ncup = "\u2A42";
+      const Ncy = "\u041D";
+      const ncy = "\u043D";
+      const ndash = "\u2013";
+      const nearhk = "\u2924";
+      const nearr = "\u2197";
+      const neArr = "\u21D7";
+      const nearrow = "\u2197";
+      const ne = "\u2260";
+      const nedot = "\u2250\u0338";
+      const NegativeMediumSpace = "\u200B";
+      const NegativeThickSpace = "\u200B";
+      const NegativeThinSpace = "\u200B";
+      const NegativeVeryThinSpace = "\u200B";
+      const nequiv = "\u2262";
+      const nesear = "\u2928";
+      const nesim = "\u2242\u0338";
+      const NestedGreaterGreater = "\u226B";
+      const NestedLessLess = "\u226A";
+      const NewLine = "\n";
+      const nexist = "\u2204";
+      const nexists = "\u2204";
+      const Nfr = "\u{1D511}";
+      const nfr = "\u{1D52B}";
+      const ngE = "\u2267\u0338";
+      const nge = "\u2271";
+      const ngeq = "\u2271";
+      const ngeqq = "\u2267\u0338";
+      const ngeqslant = "\u2A7E\u0338";
+      const nges = "\u2A7E\u0338";
+      const nGg = "\u22D9\u0338";
+      const ngsim = "\u2275";
+      const nGt = "\u226B\u20D2";
+      const ngt = "\u226F";
+      const ngtr = "\u226F";
+      const nGtv = "\u226B\u0338";
+      const nharr = "\u21AE";
+      const nhArr = "\u21CE";
+      const nhpar = "\u2AF2";
+      const ni = "\u220B";
+      const nis = "\u22FC";
+      const nisd = "\u22FA";
+      const niv = "\u220B";
+      const NJcy = "\u040A";
+      const njcy = "\u045A";
+      const nlarr = "\u219A";
+      const nlArr = "\u21CD";
+      const nldr = "\u2025";
+      const nlE = "\u2266\u0338";
+      const nle = "\u2270";
+      const nleftarrow = "\u219A";
+      const nLeftarrow = "\u21CD";
+      const nleftrightarrow = "\u21AE";
+      const nLeftrightarrow = "\u21CE";
+      const nleq = "\u2270";
+      const nleqq = "\u2266\u0338";
+      const nleqslant = "\u2A7D\u0338";
+      const nles = "\u2A7D\u0338";
+      const nless = "\u226E";
+      const nLl = "\u22D8\u0338";
+      const nlsim = "\u2274";
+      const nLt = "\u226A\u20D2";
+      const nlt = "\u226E";
+      const nltri = "\u22EA";
+      const nltrie = "\u22EC";
+      const nLtv = "\u226A\u0338";
+      const nmid = "\u2224";
+      const NoBreak = "\u2060";
+      const NonBreakingSpace = "\xA0";
+      const nopf = "\u{1D55F}";
+      const Nopf = "\u2115";
+      const Not = "\u2AEC";
+      const not = "\xAC";
+      const NotCongruent = "\u2262";
+      const NotCupCap = "\u226D";
+      const NotDoubleVerticalBar = "\u2226";
+      const NotElement = "\u2209";
+      const NotEqual = "\u2260";
+      const NotEqualTilde = "\u2242\u0338";
+      const NotExists = "\u2204";
+      const NotGreater = "\u226F";
+      const NotGreaterEqual = "\u2271";
+      const NotGreaterFullEqual = "\u2267\u0338";
+      const NotGreaterGreater = "\u226B\u0338";
+      const NotGreaterLess = "\u2279";
+      const NotGreaterSlantEqual = "\u2A7E\u0338";
+      const NotGreaterTilde = "\u2275";
+      const NotHumpDownHump = "\u224E\u0338";
+      const NotHumpEqual = "\u224F\u0338";
+      const notin = "\u2209";
+      const notindot = "\u22F5\u0338";
+      const notinE = "\u22F9\u0338";
+      const notinva = "\u2209";
+      const notinvb = "\u22F7";
+      const notinvc = "\u22F6";
+      const NotLeftTriangleBar = "\u29CF\u0338";
+      const NotLeftTriangle = "\u22EA";
+      const NotLeftTriangleEqual = "\u22EC";
+      const NotLess = "\u226E";
+      const NotLessEqual = "\u2270";
+      const NotLessGreater = "\u2278";
+      const NotLessLess = "\u226A\u0338";
+      const NotLessSlantEqual = "\u2A7D\u0338";
+      const NotLessTilde = "\u2274";
+      const NotNestedGreaterGreater = "\u2AA2\u0338";
+      const NotNestedLessLess = "\u2AA1\u0338";
+      const notni = "\u220C";
+      const notniva = "\u220C";
+      const notnivb = "\u22FE";
+      const notnivc = "\u22FD";
+      const NotPrecedes = "\u2280";
+      const NotPrecedesEqual = "\u2AAF\u0338";
+      const NotPrecedesSlantEqual = "\u22E0";
+      const NotReverseElement = "\u220C";
+      const NotRightTriangleBar = "\u29D0\u0338";
+      const NotRightTriangle = "\u22EB";
+      const NotRightTriangleEqual = "\u22ED";
+      const NotSquareSubset = "\u228F\u0338";
+      const NotSquareSubsetEqual = "\u22E2";
+      const NotSquareSuperset = "\u2290\u0338";
+      const NotSquareSupersetEqual = "\u22E3";
+      const NotSubset = "\u2282\u20D2";
+      const NotSubsetEqual = "\u2288";
+      const NotSucceeds = "\u2281";
+      const NotSucceedsEqual = "\u2AB0\u0338";
+      const NotSucceedsSlantEqual = "\u22E1";
+      const NotSucceedsTilde = "\u227F\u0338";
+      const NotSuperset = "\u2283\u20D2";
+      const NotSupersetEqual = "\u2289";
+      const NotTilde = "\u2241";
+      const NotTildeEqual = "\u2244";
+      const NotTildeFullEqual = "\u2247";
+      const NotTildeTilde = "\u2249";
+      const NotVerticalBar = "\u2224";
+      const nparallel = "\u2226";
+      const npar = "\u2226";
+      const nparsl = "\u2AFD\u20E5";
+      const npart = "\u2202\u0338";
+      const npolint = "\u2A14";
+      const npr = "\u2280";
+      const nprcue = "\u22E0";
+      const nprec = "\u2280";
+      const npreceq = "\u2AAF\u0338";
+      const npre = "\u2AAF\u0338";
+      const nrarrc = "\u2933\u0338";
+      const nrarr = "\u219B";
+      const nrArr = "\u21CF";
+      const nrarrw = "\u219D\u0338";
+      const nrightarrow = "\u219B";
+      const nRightarrow = "\u21CF";
+      const nrtri = "\u22EB";
+      const nrtrie = "\u22ED";
+      const nsc = "\u2281";
+      const nsccue = "\u22E1";
+      const nsce = "\u2AB0\u0338";
+      const Nscr = "\u{1D4A9}";
+      const nscr = "\u{1D4C3}";
+      const nshortmid = "\u2224";
+      const nshortparallel = "\u2226";
+      const nsim = "\u2241";
+      const nsime = "\u2244";
+      const nsimeq = "\u2244";
+      const nsmid = "\u2224";
+      const nspar = "\u2226";
+      const nsqsube = "\u22E2";
+      const nsqsupe = "\u22E3";
+      const nsub = "\u2284";
+      const nsubE = "\u2AC5\u0338";
+      const nsube = "\u2288";
+      const nsubset = "\u2282\u20D2";
+      const nsubseteq = "\u2288";
+      const nsubseteqq = "\u2AC5\u0338";
+      const nsucc = "\u2281";
+      const nsucceq = "\u2AB0\u0338";
+      const nsup = "\u2285";
+      const nsupE = "\u2AC6\u0338";
+      const nsupe = "\u2289";
+      const nsupset = "\u2283\u20D2";
+      const nsupseteq = "\u2289";
+      const nsupseteqq = "\u2AC6\u0338";
+      const ntgl = "\u2279";
+      const Ntilde = "\xD1";
+      const ntilde = "\xF1";
+      const ntlg = "\u2278";
+      const ntriangleleft = "\u22EA";
+      const ntrianglelefteq = "\u22EC";
+      const ntriangleright = "\u22EB";
+      const ntrianglerighteq = "\u22ED";
+      const Nu = "\u039D";
+      const nu = "\u03BD";
+      const num = "#";
+      const numero = "\u2116";
+      const numsp = "\u2007";
+      const nvap = "\u224D\u20D2";
+      const nvdash = "\u22AC";
+      const nvDash = "\u22AD";
+      const nVdash = "\u22AE";
+      const nVDash = "\u22AF";
+      const nvge = "\u2265\u20D2";
+      const nvgt = ">\u20D2";
+      const nvHarr = "\u2904";
+      const nvinfin = "\u29DE";
+      const nvlArr = "\u2902";
+      const nvle = "\u2264\u20D2";
+      const nvlt = "<\u20D2";
+      const nvltrie = "\u22B4\u20D2";
+      const nvrArr = "\u2903";
+      const nvrtrie = "\u22B5\u20D2";
+      const nvsim = "\u223C\u20D2";
+      const nwarhk = "\u2923";
+      const nwarr = "\u2196";
+      const nwArr = "\u21D6";
+      const nwarrow = "\u2196";
+      const nwnear = "\u2927";
+      const Oacute = "\xD3";
+      const oacute = "\xF3";
+      const oast = "\u229B";
+      const Ocirc = "\xD4";
+      const ocirc = "\xF4";
+      const ocir = "\u229A";
+      const Ocy = "\u041E";
+      const ocy = "\u043E";
+      const odash = "\u229D";
+      const Odblac = "\u0150";
+      const odblac = "\u0151";
+      const odiv = "\u2A38";
+      const odot = "\u2299";
+      const odsold = "\u29BC";
+      const OElig = "\u0152";
+      const oelig = "\u0153";
+      const ofcir = "\u29BF";
+      const Ofr = "\u{1D512}";
+      const ofr = "\u{1D52C}";
+      const ogon = "\u02DB";
+      const Ograve = "\xD2";
+      const ograve = "\xF2";
+      const ogt = "\u29C1";
+      const ohbar = "\u29B5";
+      const ohm = "\u03A9";
+      const oint = "\u222E";
+      const olarr = "\u21BA";
+      const olcir = "\u29BE";
+      const olcross = "\u29BB";
+      const oline = "\u203E";
+      const olt = "\u29C0";
+      const Omacr = "\u014C";
+      const omacr = "\u014D";
+      const Omega = "\u03A9";
+      const omega = "\u03C9";
+      const Omicron = "\u039F";
+      const omicron = "\u03BF";
+      const omid = "\u29B6";
+      const ominus = "\u2296";
+      const Oopf = "\u{1D546}";
+      const oopf = "\u{1D560}";
+      const opar = "\u29B7";
+      const OpenCurlyDoubleQuote = "\u201C";
+      const OpenCurlyQuote = "\u2018";
+      const operp = "\u29B9";
+      const oplus = "\u2295";
+      const orarr = "\u21BB";
+      const Or = "\u2A54";
+      const or = "\u2228";
+      const ord = "\u2A5D";
+      const order = "\u2134";
+      const orderof = "\u2134";
+      const ordf = "\xAA";
+      const ordm = "\xBA";
+      const origof = "\u22B6";
+      const oror = "\u2A56";
+      const orslope = "\u2A57";
+      const orv = "\u2A5B";
+      const oS = "\u24C8";
+      const Oscr = "\u{1D4AA}";
+      const oscr = "\u2134";
+      const Oslash = "\xD8";
+      const oslash = "\xF8";
+      const osol = "\u2298";
+      const Otilde = "\xD5";
+      const otilde = "\xF5";
+      const otimesas = "\u2A36";
+      const Otimes = "\u2A37";
+      const otimes = "\u2297";
+      const Ouml = "\xD6";
+      const ouml = "\xF6";
+      const ovbar = "\u233D";
+      const OverBar = "\u203E";
+      const OverBrace = "\u23DE";
+      const OverBracket = "\u23B4";
+      const OverParenthesis = "\u23DC";
+      const para = "\xB6";
+      const parallel = "\u2225";
+      const par = "\u2225";
+      const parsim = "\u2AF3";
+      const parsl = "\u2AFD";
+      const part = "\u2202";
+      const PartialD = "\u2202";
+      const Pcy = "\u041F";
+      const pcy = "\u043F";
+      const percnt = "%";
+      const period = ".";
+      const permil = "\u2030";
+      const perp = "\u22A5";
+      const pertenk = "\u2031";
+      const Pfr = "\u{1D513}";
+      const pfr = "\u{1D52D}";
+      const Phi = "\u03A6";
+      const phi = "\u03C6";
+      const phiv = "\u03D5";
+      const phmmat = "\u2133";
+      const phone = "\u260E";
+      const Pi = "\u03A0";
+      const pi = "\u03C0";
+      const pitchfork = "\u22D4";
+      const piv = "\u03D6";
+      const planck = "\u210F";
+      const planckh = "\u210E";
+      const plankv = "\u210F";
+      const plusacir = "\u2A23";
+      const plusb = "\u229E";
+      const pluscir = "\u2A22";
+      const plus = "+";
+      const plusdo = "\u2214";
+      const plusdu = "\u2A25";
+      const pluse = "\u2A72";
+      const PlusMinus = "\xB1";
+      const plusmn = "\xB1";
+      const plussim = "\u2A26";
+      const plustwo = "\u2A27";
+      const pm = "\xB1";
+      const Poincareplane = "\u210C";
+      const pointint = "\u2A15";
+      const popf = "\u{1D561}";
+      const Popf = "\u2119";
+      const pound = "\xA3";
+      const prap = "\u2AB7";
+      const Pr = "\u2ABB";
+      const pr = "\u227A";
+      const prcue = "\u227C";
+      const precapprox = "\u2AB7";
+      const prec = "\u227A";
+      const preccurlyeq = "\u227C";
+      const Precedes = "\u227A";
+      const PrecedesEqual = "\u2AAF";
+      const PrecedesSlantEqual = "\u227C";
+      const PrecedesTilde = "\u227E";
+      const preceq = "\u2AAF";
+      const precnapprox = "\u2AB9";
+      const precneqq = "\u2AB5";
+      const precnsim = "\u22E8";
+      const pre = "\u2AAF";
+      const prE = "\u2AB3";
+      const precsim = "\u227E";
+      const prime = "\u2032";
+      const Prime = "\u2033";
+      const primes = "\u2119";
+      const prnap = "\u2AB9";
+      const prnE = "\u2AB5";
+      const prnsim = "\u22E8";
+      const prod = "\u220F";
+      const Product = "\u220F";
+      const profalar = "\u232E";
+      const profline = "\u2312";
+      const profsurf = "\u2313";
+      const prop = "\u221D";
+      const Proportional = "\u221D";
+      const Proportion = "\u2237";
+      const propto = "\u221D";
+      const prsim = "\u227E";
+      const prurel = "\u22B0";
+      const Pscr = "\u{1D4AB}";
+      const pscr = "\u{1D4C5}";
+      const Psi = "\u03A8";
+      const psi = "\u03C8";
+      const puncsp = "\u2008";
+      const Qfr = "\u{1D514}";
+      const qfr = "\u{1D52E}";
+      const qint = "\u2A0C";
+      const qopf = "\u{1D562}";
+      const Qopf = "\u211A";
+      const qprime = "\u2057";
+      const Qscr = "\u{1D4AC}";
+      const qscr = "\u{1D4C6}";
+      const quaternions = "\u210D";
+      const quatint = "\u2A16";
+      const quest = "?";
+      const questeq = "\u225F";
+      const quot = '"';
+      const QUOT = '"';
+      const rAarr = "\u21DB";
+      const race = "\u223D\u0331";
+      const Racute = "\u0154";
+      const racute = "\u0155";
+      const radic = "\u221A";
+      const raemptyv = "\u29B3";
+      const rang = "\u27E9";
+      const Rang = "\u27EB";
+      const rangd = "\u2992";
+      const range = "\u29A5";
+      const rangle = "\u27E9";
+      const raquo = "\xBB";
+      const rarrap = "\u2975";
+      const rarrb = "\u21E5";
+      const rarrbfs = "\u2920";
+      const rarrc = "\u2933";
+      const rarr = "\u2192";
+      const Rarr = "\u21A0";
+      const rArr = "\u21D2";
+      const rarrfs = "\u291E";
+      const rarrhk = "\u21AA";
+      const rarrlp = "\u21AC";
+      const rarrpl = "\u2945";
+      const rarrsim = "\u2974";
+      const Rarrtl = "\u2916";
+      const rarrtl = "\u21A3";
+      const rarrw = "\u219D";
+      const ratail = "\u291A";
+      const rAtail = "\u291C";
+      const ratio = "\u2236";
+      const rationals = "\u211A";
+      const rbarr = "\u290D";
+      const rBarr = "\u290F";
+      const RBarr = "\u2910";
+      const rbbrk = "\u2773";
+      const rbrace = "}";
+      const rbrack = "]";
+      const rbrke = "\u298C";
+      const rbrksld = "\u298E";
+      const rbrkslu = "\u2990";
+      const Rcaron = "\u0158";
+      const rcaron = "\u0159";
+      const Rcedil = "\u0156";
+      const rcedil = "\u0157";
+      const rceil = "\u2309";
+      const rcub = "}";
+      const Rcy = "\u0420";
+      const rcy = "\u0440";
+      const rdca = "\u2937";
+      const rdldhar = "\u2969";
+      const rdquo = "\u201D";
+      const rdquor = "\u201D";
+      const rdsh = "\u21B3";
+      const real = "\u211C";
+      const realine = "\u211B";
+      const realpart = "\u211C";
+      const reals = "\u211D";
+      const Re = "\u211C";
+      const rect = "\u25AD";
+      const reg = "\xAE";
+      const REG = "\xAE";
+      const ReverseElement = "\u220B";
+      const ReverseEquilibrium = "\u21CB";
+      const ReverseUpEquilibrium = "\u296F";
+      const rfisht = "\u297D";
+      const rfloor = "\u230B";
+      const rfr = "\u{1D52F}";
+      const Rfr = "\u211C";
+      const rHar = "\u2964";
+      const rhard = "\u21C1";
+      const rharu = "\u21C0";
+      const rharul = "\u296C";
+      const Rho = "\u03A1";
+      const rho = "\u03C1";
+      const rhov = "\u03F1";
+      const RightAngleBracket = "\u27E9";
+      const RightArrowBar = "\u21E5";
+      const rightarrow = "\u2192";
+      const RightArrow = "\u2192";
+      const Rightarrow = "\u21D2";
+      const RightArrowLeftArrow = "\u21C4";
+      const rightarrowtail = "\u21A3";
+      const RightCeiling = "\u2309";
+      const RightDoubleBracket = "\u27E7";
+      const RightDownTeeVector = "\u295D";
+      const RightDownVectorBar = "\u2955";
+      const RightDownVector = "\u21C2";
+      const RightFloor = "\u230B";
+      const rightharpoondown = "\u21C1";
+      const rightharpoonup = "\u21C0";
+      const rightleftarrows = "\u21C4";
+      const rightleftharpoons = "\u21CC";
+      const rightrightarrows = "\u21C9";
+      const rightsquigarrow = "\u219D";
+      const RightTeeArrow = "\u21A6";
+      const RightTee = "\u22A2";
+      const RightTeeVector = "\u295B";
+      const rightthreetimes = "\u22CC";
+      const RightTriangleBar = "\u29D0";
+      const RightTriangle = "\u22B3";
+      const RightTriangleEqual = "\u22B5";
+      const RightUpDownVector = "\u294F";
+      const RightUpTeeVector = "\u295C";
+      const RightUpVectorBar = "\u2954";
+      const RightUpVector = "\u21BE";
+      const RightVectorBar = "\u2953";
+      const RightVector = "\u21C0";
+      const ring = "\u02DA";
+      const risingdotseq = "\u2253";
+      const rlarr = "\u21C4";
+      const rlhar = "\u21CC";
+      const rlm = "\u200F";
+      const rmoustache = "\u23B1";
+      const rmoust = "\u23B1";
+      const rnmid = "\u2AEE";
+      const roang = "\u27ED";
+      const roarr = "\u21FE";
+      const robrk = "\u27E7";
+      const ropar = "\u2986";
+      const ropf = "\u{1D563}";
+      const Ropf = "\u211D";
+      const roplus = "\u2A2E";
+      const rotimes = "\u2A35";
+      const RoundImplies = "\u2970";
+      const rpar = ")";
+      const rpargt = "\u2994";
+      const rppolint = "\u2A12";
+      const rrarr = "\u21C9";
+      const Rrightarrow = "\u21DB";
+      const rsaquo = "\u203A";
+      const rscr = "\u{1D4C7}";
+      const Rscr = "\u211B";
+      const rsh = "\u21B1";
+      const Rsh = "\u21B1";
+      const rsqb = "]";
+      const rsquo = "\u2019";
+      const rsquor = "\u2019";
+      const rthree = "\u22CC";
+      const rtimes = "\u22CA";
+      const rtri = "\u25B9";
+      const rtrie = "\u22B5";
+      const rtrif = "\u25B8";
+      const rtriltri = "\u29CE";
+      const RuleDelayed = "\u29F4";
+      const ruluhar = "\u2968";
+      const rx = "\u211E";
+      const Sacute = "\u015A";
+      const sacute = "\u015B";
+      const sbquo = "\u201A";
+      const scap = "\u2AB8";
+      const Scaron = "\u0160";
+      const scaron = "\u0161";
+      const Sc = "\u2ABC";
+      const sc = "\u227B";
+      const sccue = "\u227D";
+      const sce = "\u2AB0";
+      const scE = "\u2AB4";
+      const Scedil = "\u015E";
+      const scedil = "\u015F";
+      const Scirc = "\u015C";
+      const scirc = "\u015D";
+      const scnap = "\u2ABA";
+      const scnE = "\u2AB6";
+      const scnsim = "\u22E9";
+      const scpolint = "\u2A13";
+      const scsim = "\u227F";
+      const Scy = "\u0421";
+      const scy = "\u0441";
+      const sdotb = "\u22A1";
+      const sdot = "\u22C5";
+      const sdote = "\u2A66";
+      const searhk = "\u2925";
+      const searr = "\u2198";
+      const seArr = "\u21D8";
+      const searrow = "\u2198";
+      const sect = "\xA7";
+      const semi = ";";
+      const seswar = "\u2929";
+      const setminus = "\u2216";
+      const setmn = "\u2216";
+      const sext = "\u2736";
+      const Sfr = "\u{1D516}";
+      const sfr = "\u{1D530}";
+      const sfrown = "\u2322";
+      const sharp = "\u266F";
+      const SHCHcy = "\u0429";
+      const shchcy = "\u0449";
+      const SHcy = "\u0428";
+      const shcy = "\u0448";
+      const ShortDownArrow = "\u2193";
+      const ShortLeftArrow = "\u2190";
+      const shortmid = "\u2223";
+      const shortparallel = "\u2225";
+      const ShortRightArrow = "\u2192";
+      const ShortUpArrow = "\u2191";
+      const shy = "\xAD";
+      const Sigma = "\u03A3";
+      const sigma = "\u03C3";
+      const sigmaf = "\u03C2";
+      const sigmav = "\u03C2";
+      const sim = "\u223C";
+      const simdot = "\u2A6A";
+      const sime = "\u2243";
+      const simeq = "\u2243";
+      const simg = "\u2A9E";
+      const simgE = "\u2AA0";
+      const siml = "\u2A9D";
+      const simlE = "\u2A9F";
+      const simne = "\u2246";
+      const simplus = "\u2A24";
+      const simrarr = "\u2972";
+      const slarr = "\u2190";
+      const SmallCircle = "\u2218";
+      const smallsetminus = "\u2216";
+      const smashp = "\u2A33";
+      const smeparsl = "\u29E4";
+      const smid = "\u2223";
+      const smile = "\u2323";
+      const smt = "\u2AAA";
+      const smte = "\u2AAC";
+      const smtes = "\u2AAC\uFE00";
+      const SOFTcy = "\u042C";
+      const softcy = "\u044C";
+      const solbar = "\u233F";
+      const solb = "\u29C4";
+      const sol = "/";
+      const Sopf = "\u{1D54A}";
+      const sopf = "\u{1D564}";
+      const spades = "\u2660";
+      const spadesuit = "\u2660";
+      const spar = "\u2225";
+      const sqcap = "\u2293";
+      const sqcaps = "\u2293\uFE00";
+      const sqcup = "\u2294";
+      const sqcups = "\u2294\uFE00";
+      const Sqrt = "\u221A";
+      const sqsub = "\u228F";
+      const sqsube = "\u2291";
+      const sqsubset = "\u228F";
+      const sqsubseteq = "\u2291";
+      const sqsup = "\u2290";
+      const sqsupe = "\u2292";
+      const sqsupset = "\u2290";
+      const sqsupseteq = "\u2292";
+      const square = "\u25A1";
+      const Square = "\u25A1";
+      const SquareIntersection = "\u2293";
+      const SquareSubset = "\u228F";
+      const SquareSubsetEqual = "\u2291";
+      const SquareSuperset = "\u2290";
+      const SquareSupersetEqual = "\u2292";
+      const SquareUnion = "\u2294";
+      const squarf = "\u25AA";
+      const squ = "\u25A1";
+      const squf = "\u25AA";
+      const srarr = "\u2192";
+      const Sscr = "\u{1D4AE}";
+      const sscr = "\u{1D4C8}";
+      const ssetmn = "\u2216";
+      const ssmile = "\u2323";
+      const sstarf = "\u22C6";
+      const Star = "\u22C6";
+      const star = "\u2606";
+      const starf = "\u2605";
+      const straightepsilon = "\u03F5";
+      const straightphi = "\u03D5";
+      const strns = "\xAF";
+      const sub = "\u2282";
+      const Sub = "\u22D0";
+      const subdot = "\u2ABD";
+      const subE = "\u2AC5";
+      const sube = "\u2286";
+      const subedot = "\u2AC3";
+      const submult = "\u2AC1";
+      const subnE = "\u2ACB";
+      const subne = "\u228A";
+      const subplus = "\u2ABF";
+      const subrarr = "\u2979";
+      const subset = "\u2282";
+      const Subset = "\u22D0";
+      const subseteq = "\u2286";
+      const subseteqq = "\u2AC5";
+      const SubsetEqual = "\u2286";
+      const subsetneq = "\u228A";
+      const subsetneqq = "\u2ACB";
+      const subsim = "\u2AC7";
+      const subsub = "\u2AD5";
+      const subsup = "\u2AD3";
+      const succapprox = "\u2AB8";
+      const succ = "\u227B";
+      const succcurlyeq = "\u227D";
+      const Succeeds = "\u227B";
+      const SucceedsEqual = "\u2AB0";
+      const SucceedsSlantEqual = "\u227D";
+      const SucceedsTilde = "\u227F";
+      const succeq = "\u2AB0";
+      const succnapprox = "\u2ABA";
+      const succneqq = "\u2AB6";
+      const succnsim = "\u22E9";
+      const succsim = "\u227F";
+      const SuchThat = "\u220B";
+      const sum = "\u2211";
+      const Sum = "\u2211";
+      const sung = "\u266A";
+      const sup1 = "\xB9";
+      const sup2 = "\xB2";
+      const sup3 = "\xB3";
+      const sup = "\u2283";
+      const Sup = "\u22D1";
+      const supdot = "\u2ABE";
+      const supdsub = "\u2AD8";
+      const supE = "\u2AC6";
+      const supe = "\u2287";
+      const supedot = "\u2AC4";
+      const Superset = "\u2283";
+      const SupersetEqual = "\u2287";
+      const suphsol = "\u27C9";
+      const suphsub = "\u2AD7";
+      const suplarr = "\u297B";
+      const supmult = "\u2AC2";
+      const supnE = "\u2ACC";
+      const supne = "\u228B";
+      const supplus = "\u2AC0";
+      const supset = "\u2283";
+      const Supset = "\u22D1";
+      const supseteq = "\u2287";
+      const supseteqq = "\u2AC6";
+      const supsetneq = "\u228B";
+      const supsetneqq = "\u2ACC";
+      const supsim = "\u2AC8";
+      const supsub = "\u2AD4";
+      const supsup = "\u2AD6";
+      const swarhk = "\u2926";
+      const swarr = "\u2199";
+      const swArr = "\u21D9";
+      const swarrow = "\u2199";
+      const swnwar = "\u292A";
+      const szlig = "\xDF";
+      const Tab$1 = "	";
+      const target = "\u2316";
+      const Tau = "\u03A4";
+      const tau = "\u03C4";
+      const tbrk = "\u23B4";
+      const Tcaron = "\u0164";
+      const tcaron = "\u0165";
+      const Tcedil = "\u0162";
+      const tcedil = "\u0163";
+      const Tcy = "\u0422";
+      const tcy = "\u0442";
+      const tdot = "\u20DB";
+      const telrec = "\u2315";
+      const Tfr = "\u{1D517}";
+      const tfr = "\u{1D531}";
+      const there4 = "\u2234";
+      const therefore = "\u2234";
+      const Therefore = "\u2234";
+      const Theta = "\u0398";
+      const theta = "\u03B8";
+      const thetasym = "\u03D1";
+      const thetav = "\u03D1";
+      const thickapprox = "\u2248";
+      const thicksim = "\u223C";
+      const ThickSpace = "\u205F\u200A";
+      const ThinSpace = "\u2009";
+      const thinsp = "\u2009";
+      const thkap = "\u2248";
+      const thksim = "\u223C";
+      const THORN = "\xDE";
+      const thorn = "\xFE";
+      const tilde = "\u02DC";
+      const Tilde = "\u223C";
+      const TildeEqual = "\u2243";
+      const TildeFullEqual = "\u2245";
+      const TildeTilde = "\u2248";
+      const timesbar = "\u2A31";
+      const timesb = "\u22A0";
+      const times = "\xD7";
+      const timesd = "\u2A30";
+      const tint = "\u222D";
+      const toea = "\u2928";
+      const topbot = "\u2336";
+      const topcir = "\u2AF1";
+      const top = "\u22A4";
+      const Topf = "\u{1D54B}";
+      const topf = "\u{1D565}";
+      const topfork = "\u2ADA";
+      const tosa = "\u2929";
+      const tprime = "\u2034";
+      const trade = "\u2122";
+      const TRADE = "\u2122";
+      const triangle = "\u25B5";
+      const triangledown = "\u25BF";
+      const triangleleft = "\u25C3";
+      const trianglelefteq = "\u22B4";
+      const triangleq = "\u225C";
+      const triangleright = "\u25B9";
+      const trianglerighteq = "\u22B5";
+      const tridot = "\u25EC";
+      const trie = "\u225C";
+      const triminus = "\u2A3A";
+      const TripleDot = "\u20DB";
+      const triplus = "\u2A39";
+      const trisb = "\u29CD";
+      const tritime = "\u2A3B";
+      const trpezium = "\u23E2";
+      const Tscr = "\u{1D4AF}";
+      const tscr = "\u{1D4C9}";
+      const TScy = "\u0426";
+      const tscy = "\u0446";
+      const TSHcy = "\u040B";
+      const tshcy = "\u045B";
+      const Tstrok = "\u0166";
+      const tstrok = "\u0167";
+      const twixt = "\u226C";
+      const twoheadleftarrow = "\u219E";
+      const twoheadrightarrow = "\u21A0";
+      const Uacute = "\xDA";
+      const uacute = "\xFA";
+      const uarr = "\u2191";
+      const Uarr = "\u219F";
+      const uArr = "\u21D1";
+      const Uarrocir = "\u2949";
+      const Ubrcy = "\u040E";
+      const ubrcy = "\u045E";
+      const Ubreve = "\u016C";
+      const ubreve = "\u016D";
+      const Ucirc = "\xDB";
+      const ucirc = "\xFB";
+      const Ucy = "\u0423";
+      const ucy = "\u0443";
+      const udarr = "\u21C5";
+      const Udblac = "\u0170";
+      const udblac = "\u0171";
+      const udhar = "\u296E";
+      const ufisht = "\u297E";
+      const Ufr = "\u{1D518}";
+      const ufr = "\u{1D532}";
+      const Ugrave = "\xD9";
+      const ugrave = "\xF9";
+      const uHar = "\u2963";
+      const uharl = "\u21BF";
+      const uharr = "\u21BE";
+      const uhblk = "\u2580";
+      const ulcorn = "\u231C";
+      const ulcorner = "\u231C";
+      const ulcrop = "\u230F";
+      const ultri = "\u25F8";
+      const Umacr = "\u016A";
+      const umacr = "\u016B";
+      const uml = "\xA8";
+      const UnderBar = "_";
+      const UnderBrace = "\u23DF";
+      const UnderBracket = "\u23B5";
+      const UnderParenthesis = "\u23DD";
+      const Union = "\u22C3";
+      const UnionPlus = "\u228E";
+      const Uogon = "\u0172";
+      const uogon = "\u0173";
+      const Uopf = "\u{1D54C}";
+      const uopf = "\u{1D566}";
+      const UpArrowBar = "\u2912";
+      const uparrow = "\u2191";
+      const UpArrow = "\u2191";
+      const Uparrow = "\u21D1";
+      const UpArrowDownArrow = "\u21C5";
+      const updownarrow = "\u2195";
+      const UpDownArrow = "\u2195";
+      const Updownarrow = "\u21D5";
+      const UpEquilibrium = "\u296E";
+      const upharpoonleft = "\u21BF";
+      const upharpoonright = "\u21BE";
+      const uplus = "\u228E";
+      const UpperLeftArrow = "\u2196";
+      const UpperRightArrow = "\u2197";
+      const upsi = "\u03C5";
+      const Upsi = "\u03D2";
+      const upsih = "\u03D2";
+      const Upsilon = "\u03A5";
+      const upsilon = "\u03C5";
+      const UpTeeArrow = "\u21A5";
+      const UpTee = "\u22A5";
+      const upuparrows = "\u21C8";
+      const urcorn = "\u231D";
+      const urcorner = "\u231D";
+      const urcrop = "\u230E";
+      const Uring = "\u016E";
+      const uring = "\u016F";
+      const urtri = "\u25F9";
+      const Uscr = "\u{1D4B0}";
+      const uscr = "\u{1D4CA}";
+      const utdot = "\u22F0";
+      const Utilde = "\u0168";
+      const utilde = "\u0169";
+      const utri = "\u25B5";
+      const utrif = "\u25B4";
+      const uuarr = "\u21C8";
+      const Uuml = "\xDC";
+      const uuml = "\xFC";
+      const uwangle = "\u29A7";
+      const vangrt = "\u299C";
+      const varepsilon = "\u03F5";
+      const varkappa = "\u03F0";
+      const varnothing = "\u2205";
+      const varphi = "\u03D5";
+      const varpi = "\u03D6";
+      const varpropto = "\u221D";
+      const varr = "\u2195";
+      const vArr = "\u21D5";
+      const varrho = "\u03F1";
+      const varsigma = "\u03C2";
+      const varsubsetneq = "\u228A\uFE00";
+      const varsubsetneqq = "\u2ACB\uFE00";
+      const varsupsetneq = "\u228B\uFE00";
+      const varsupsetneqq = "\u2ACC\uFE00";
+      const vartheta = "\u03D1";
+      const vartriangleleft = "\u22B2";
+      const vartriangleright = "\u22B3";
+      const vBar = "\u2AE8";
+      const Vbar = "\u2AEB";
+      const vBarv = "\u2AE9";
+      const Vcy = "\u0412";
+      const vcy = "\u0432";
+      const vdash = "\u22A2";
+      const vDash = "\u22A8";
+      const Vdash = "\u22A9";
+      const VDash = "\u22AB";
+      const Vdashl = "\u2AE6";
+      const veebar = "\u22BB";
+      const vee = "\u2228";
+      const Vee = "\u22C1";
+      const veeeq = "\u225A";
+      const vellip = "\u22EE";
+      const verbar = "|";
+      const Verbar = "\u2016";
+      const vert = "|";
+      const Vert = "\u2016";
+      const VerticalBar = "\u2223";
+      const VerticalLine = "|";
+      const VerticalSeparator = "\u2758";
+      const VerticalTilde = "\u2240";
+      const VeryThinSpace = "\u200A";
+      const Vfr = "\u{1D519}";
+      const vfr = "\u{1D533}";
+      const vltri = "\u22B2";
+      const vnsub = "\u2282\u20D2";
+      const vnsup = "\u2283\u20D2";
+      const Vopf = "\u{1D54D}";
+      const vopf = "\u{1D567}";
+      const vprop = "\u221D";
+      const vrtri = "\u22B3";
+      const Vscr = "\u{1D4B1}";
+      const vscr = "\u{1D4CB}";
+      const vsubnE = "\u2ACB\uFE00";
+      const vsubne = "\u228A\uFE00";
+      const vsupnE = "\u2ACC\uFE00";
+      const vsupne = "\u228B\uFE00";
+      const Vvdash = "\u22AA";
+      const vzigzag = "\u299A";
+      const Wcirc = "\u0174";
+      const wcirc = "\u0175";
+      const wedbar = "\u2A5F";
+      const wedge = "\u2227";
+      const Wedge = "\u22C0";
+      const wedgeq = "\u2259";
+      const weierp = "\u2118";
+      const Wfr = "\u{1D51A}";
+      const wfr = "\u{1D534}";
+      const Wopf = "\u{1D54E}";
+      const wopf = "\u{1D568}";
+      const wp = "\u2118";
+      const wr = "\u2240";
+      const wreath = "\u2240";
+      const Wscr = "\u{1D4B2}";
+      const wscr = "\u{1D4CC}";
+      const xcap = "\u22C2";
+      const xcirc = "\u25EF";
+      const xcup = "\u22C3";
+      const xdtri = "\u25BD";
+      const Xfr = "\u{1D51B}";
+      const xfr = "\u{1D535}";
+      const xharr = "\u27F7";
+      const xhArr = "\u27FA";
+      const Xi = "\u039E";
+      const xi = "\u03BE";
+      const xlarr = "\u27F5";
+      const xlArr = "\u27F8";
+      const xmap = "\u27FC";
+      const xnis = "\u22FB";
+      const xodot = "\u2A00";
+      const Xopf = "\u{1D54F}";
+      const xopf = "\u{1D569}";
+      const xoplus = "\u2A01";
+      const xotime = "\u2A02";
+      const xrarr = "\u27F6";
+      const xrArr = "\u27F9";
+      const Xscr = "\u{1D4B3}";
+      const xscr = "\u{1D4CD}";
+      const xsqcup = "\u2A06";
+      const xuplus = "\u2A04";
+      const xutri = "\u25B3";
+      const xvee = "\u22C1";
+      const xwedge = "\u22C0";
+      const Yacute = "\xDD";
+      const yacute = "\xFD";
+      const YAcy = "\u042F";
+      const yacy = "\u044F";
+      const Ycirc = "\u0176";
+      const ycirc = "\u0177";
+      const Ycy = "\u042B";
+      const ycy = "\u044B";
+      const yen = "\xA5";
+      const Yfr = "\u{1D51C}";
+      const yfr = "\u{1D536}";
+      const YIcy = "\u0407";
+      const yicy = "\u0457";
+      const Yopf = "\u{1D550}";
+      const yopf = "\u{1D56A}";
+      const Yscr = "\u{1D4B4}";
+      const yscr = "\u{1D4CE}";
+      const YUcy = "\u042E";
+      const yucy = "\u044E";
+      const yuml = "\xFF";
+      const Yuml = "\u0178";
+      const Zacute = "\u0179";
+      const zacute = "\u017A";
+      const Zcaron = "\u017D";
+      const zcaron = "\u017E";
+      const Zcy = "\u0417";
+      const zcy = "\u0437";
+      const Zdot = "\u017B";
+      const zdot = "\u017C";
+      const zeetrf = "\u2128";
+      const ZeroWidthSpace = "\u200B";
+      const Zeta = "\u0396";
+      const zeta = "\u03B6";
+      const zfr = "\u{1D537}";
+      const Zfr = "\u2128";
+      const ZHcy = "\u0416";
+      const zhcy = "\u0436";
+      const zigrarr = "\u21DD";
+      const zopf = "\u{1D56B}";
+      const Zopf = "\u2124";
+      const Zscr = "\u{1D4B5}";
+      const zscr = "\u{1D4CF}";
+      const zwj = "\u200D";
+      const zwnj = "\u200C";
+      var require$$0 = {
+        Aacute,
+        aacute,
+        Abreve,
+        abreve,
+        ac,
+        acd,
+        acE,
+        Acirc,
+        acirc,
+        acute,
+        Acy,
+        acy,
+        AElig,
+        aelig,
+        af,
+        Afr,
+        afr,
+        Agrave,
+        agrave,
+        alefsym,
+        aleph,
+        Alpha,
+        alpha,
+        Amacr,
+        amacr,
+        amalg,
+        amp,
+        AMP,
+        andand,
+        And,
+        and,
+        andd,
+        andslope,
+        andv,
+        ang,
+        ange,
+        angle,
+        angmsdaa,
+        angmsdab,
+        angmsdac,
+        angmsdad,
+        angmsdae,
+        angmsdaf,
+        angmsdag,
+        angmsdah,
+        angmsd,
+        angrt,
+        angrtvb,
+        angrtvbd,
+        angsph,
+        angst,
+        angzarr,
+        Aogon,
+        aogon,
+        Aopf,
+        aopf,
+        apacir,
+        ap,
+        apE,
+        ape,
+        apid,
+        apos,
+        ApplyFunction,
+        approx,
+        approxeq,
+        Aring,
+        aring,
+        Ascr,
+        ascr,
+        Assign,
+        ast,
+        asymp,
+        asympeq,
+        Atilde,
+        atilde,
+        Auml,
+        auml,
+        awconint,
+        awint,
+        backcong,
+        backepsilon,
+        backprime,
+        backsim,
+        backsimeq,
+        Backslash,
+        Barv,
+        barvee,
+        barwed,
+        Barwed,
+        barwedge,
+        bbrk,
+        bbrktbrk,
+        bcong,
+        Bcy,
+        bcy,
+        bdquo,
+        becaus,
+        because,
+        Because,
+        bemptyv,
+        bepsi,
+        bernou,
+        Bernoullis,
+        Beta,
+        beta,
+        beth,
+        between,
+        Bfr,
+        bfr,
+        bigcap,
+        bigcirc,
+        bigcup,
+        bigodot,
+        bigoplus,
+        bigotimes,
+        bigsqcup,
+        bigstar,
+        bigtriangledown,
+        bigtriangleup,
+        biguplus,
+        bigvee,
+        bigwedge,
+        bkarow,
+        blacklozenge,
+        blacksquare,
+        blacktriangle,
+        blacktriangledown,
+        blacktriangleleft,
+        blacktriangleright,
+        blank,
+        blk12,
+        blk14,
+        blk34,
+        block: block$2,
+        bne,
+        bnequiv,
+        bNot,
+        bnot,
+        Bopf,
+        bopf,
+        bot,
+        bottom,
+        bowtie,
+        boxbox,
+        boxdl,
+        boxdL,
+        boxDl,
+        boxDL,
+        boxdr,
+        boxdR,
+        boxDr,
+        boxDR,
+        boxh,
+        boxH,
+        boxhd,
+        boxHd,
+        boxhD,
+        boxHD,
+        boxhu,
+        boxHu,
+        boxhU,
+        boxHU,
+        boxminus,
+        boxplus,
+        boxtimes,
+        boxul,
+        boxuL,
+        boxUl,
+        boxUL,
+        boxur,
+        boxuR,
+        boxUr,
+        boxUR,
+        boxv,
+        boxV,
+        boxvh,
+        boxvH,
+        boxVh,
+        boxVH,
+        boxvl,
+        boxvL,
+        boxVl,
+        boxVL,
+        boxvr,
+        boxvR,
+        boxVr,
+        boxVR,
+        bprime,
+        breve,
+        Breve,
+        brvbar,
+        bscr,
+        Bscr,
+        bsemi,
+        bsim,
+        bsime,
+        bsolb,
+        bsol,
+        bsolhsub,
+        bull,
+        bullet,
+        bump,
+        bumpE,
+        bumpe,
+        Bumpeq,
+        bumpeq,
+        Cacute,
+        cacute,
+        capand,
+        capbrcup,
+        capcap,
+        cap,
+        Cap,
+        capcup,
+        capdot,
+        CapitalDifferentialD,
+        caps,
+        caret,
+        caron,
+        Cayleys,
+        ccaps,
+        Ccaron,
+        ccaron,
+        Ccedil,
+        ccedil,
+        Ccirc,
+        ccirc,
+        Cconint,
+        ccups,
+        ccupssm,
+        Cdot,
+        cdot,
+        cedil,
+        Cedilla,
+        cemptyv,
+        cent,
+        centerdot,
+        CenterDot,
+        cfr,
+        Cfr,
+        CHcy,
+        chcy,
+        check,
+        checkmark,
+        Chi,
+        chi,
+        circ,
+        circeq,
+        circlearrowleft,
+        circlearrowright,
+        circledast,
+        circledcirc,
+        circleddash,
+        CircleDot,
+        circledR,
+        circledS,
+        CircleMinus,
+        CirclePlus,
+        CircleTimes,
+        cir,
+        cirE,
+        cire,
+        cirfnint,
+        cirmid,
+        cirscir,
+        ClockwiseContourIntegral,
+        CloseCurlyDoubleQuote,
+        CloseCurlyQuote,
+        clubs,
+        clubsuit,
+        colon,
+        Colon,
+        Colone,
+        colone,
+        coloneq,
+        comma,
+        commat,
+        comp,
+        compfn,
+        complement,
+        complexes,
+        cong,
+        congdot,
+        Congruent,
+        conint,
+        Conint,
+        ContourIntegral,
+        copf,
+        Copf,
+        coprod,
+        Coproduct,
+        copy,
+        COPY,
+        copysr,
+        CounterClockwiseContourIntegral,
+        crarr,
+        cross,
+        Cross,
+        Cscr,
+        cscr,
+        csub,
+        csube,
+        csup,
+        csupe,
+        ctdot,
+        cudarrl,
+        cudarrr,
+        cuepr,
+        cuesc,
+        cularr,
+        cularrp,
+        cupbrcap,
+        cupcap,
+        CupCap,
+        cup,
+        Cup,
+        cupcup,
+        cupdot,
+        cupor,
+        cups,
+        curarr,
+        curarrm,
+        curlyeqprec,
+        curlyeqsucc,
+        curlyvee,
+        curlywedge,
+        curren,
+        curvearrowleft,
+        curvearrowright,
+        cuvee,
+        cuwed,
+        cwconint,
+        cwint,
+        cylcty,
+        dagger,
+        Dagger,
+        daleth,
+        darr,
+        Darr,
+        dArr,
+        dash,
+        Dashv,
+        dashv,
+        dbkarow,
+        dblac,
+        Dcaron,
+        dcaron,
+        Dcy,
+        dcy,
+        ddagger,
+        ddarr,
+        DD,
+        dd,
+        DDotrahd,
+        ddotseq,
+        deg,
+        Del,
+        Delta,
+        delta,
+        demptyv,
+        dfisht,
+        Dfr,
+        dfr,
+        dHar,
+        dharl,
+        dharr,
+        DiacriticalAcute,
+        DiacriticalDot,
+        DiacriticalDoubleAcute,
+        DiacriticalGrave,
+        DiacriticalTilde,
+        diam,
+        diamond,
+        Diamond,
+        diamondsuit,
+        diams,
+        die,
+        DifferentialD,
+        digamma,
+        disin,
+        div,
+        divide,
+        divideontimes,
+        divonx,
+        DJcy,
+        djcy,
+        dlcorn,
+        dlcrop,
+        dollar,
+        Dopf,
+        dopf,
+        Dot,
+        dot,
+        DotDot,
+        doteq,
+        doteqdot,
+        DotEqual,
+        dotminus,
+        dotplus,
+        dotsquare,
+        doublebarwedge,
+        DoubleContourIntegral,
+        DoubleDot,
+        DoubleDownArrow,
+        DoubleLeftArrow,
+        DoubleLeftRightArrow,
+        DoubleLeftTee,
+        DoubleLongLeftArrow,
+        DoubleLongLeftRightArrow,
+        DoubleLongRightArrow,
+        DoubleRightArrow,
+        DoubleRightTee,
+        DoubleUpArrow,
+        DoubleUpDownArrow,
+        DoubleVerticalBar,
+        DownArrowBar,
+        downarrow,
+        DownArrow,
+        Downarrow,
+        DownArrowUpArrow,
+        DownBreve,
+        downdownarrows,
+        downharpoonleft,
+        downharpoonright,
+        DownLeftRightVector,
+        DownLeftTeeVector,
+        DownLeftVectorBar,
+        DownLeftVector,
+        DownRightTeeVector,
+        DownRightVectorBar,
+        DownRightVector,
+        DownTeeArrow,
+        DownTee,
+        drbkarow,
+        drcorn,
+        drcrop,
+        Dscr,
+        dscr,
+        DScy,
+        dscy,
+        dsol,
+        Dstrok,
+        dstrok,
+        dtdot,
+        dtri,
+        dtrif,
+        duarr,
+        duhar,
+        dwangle,
+        DZcy,
+        dzcy,
+        dzigrarr,
+        Eacute,
+        eacute,
+        easter,
+        Ecaron,
+        ecaron,
+        Ecirc,
+        ecirc,
+        ecir,
+        ecolon,
+        Ecy,
+        ecy,
+        eDDot,
+        Edot,
+        edot,
+        eDot,
+        ee,
+        efDot,
+        Efr,
+        efr,
+        eg,
+        Egrave,
+        egrave,
+        egs,
+        egsdot,
+        el,
+        Element,
+        elinters,
+        ell,
+        els,
+        elsdot,
+        Emacr,
+        emacr,
+        empty,
+        emptyset,
+        EmptySmallSquare,
+        emptyv,
+        EmptyVerySmallSquare,
+        emsp13,
+        emsp14,
+        emsp,
+        ENG,
+        eng,
+        ensp,
+        Eogon,
+        eogon,
+        Eopf,
+        eopf,
+        epar,
+        eparsl,
+        eplus,
+        epsi,
+        Epsilon,
+        epsilon,
+        epsiv,
+        eqcirc,
+        eqcolon,
+        eqsim,
+        eqslantgtr,
+        eqslantless,
+        Equal,
+        equals,
+        EqualTilde,
+        equest,
+        Equilibrium,
+        equiv,
+        equivDD,
+        eqvparsl,
+        erarr,
+        erDot,
+        escr,
+        Escr,
+        esdot,
+        Esim,
+        esim,
+        Eta,
+        eta,
+        ETH,
+        eth,
+        Euml,
+        euml,
+        euro,
+        excl,
+        exist,
+        Exists,
+        expectation,
+        exponentiale,
+        ExponentialE,
+        fallingdotseq,
+        Fcy,
+        fcy,
+        female,
+        ffilig,
+        fflig,
+        ffllig,
+        Ffr,
+        ffr,
+        filig,
+        FilledSmallSquare,
+        FilledVerySmallSquare,
+        fjlig,
+        flat,
+        fllig,
+        fltns,
+        fnof,
+        Fopf,
+        fopf,
+        forall,
+        ForAll,
+        fork,
+        forkv,
+        Fouriertrf,
+        fpartint,
+        frac12,
+        frac13,
+        frac14,
+        frac15,
+        frac16,
+        frac18,
+        frac23,
+        frac25,
+        frac34,
+        frac35,
+        frac38,
+        frac45,
+        frac56,
+        frac58,
+        frac78,
+        frasl,
+        frown,
+        fscr,
+        Fscr,
+        gacute,
+        Gamma,
+        gamma,
+        Gammad,
+        gammad,
+        gap,
+        Gbreve,
+        gbreve,
+        Gcedil,
+        Gcirc,
+        gcirc,
+        Gcy,
+        gcy,
+        Gdot,
+        gdot,
+        ge,
+        gE,
+        gEl,
+        gel,
+        geq,
+        geqq,
+        geqslant,
+        gescc,
+        ges,
+        gesdot,
+        gesdoto,
+        gesdotol,
+        gesl,
+        gesles,
+        Gfr,
+        gfr,
+        gg,
+        Gg,
+        ggg,
+        gimel,
+        GJcy,
+        gjcy,
+        gla,
+        gl,
+        glE,
+        glj,
+        gnap,
+        gnapprox,
+        gne,
+        gnE,
+        gneq,
+        gneqq,
+        gnsim,
+        Gopf,
+        gopf,
+        grave,
+        GreaterEqual,
+        GreaterEqualLess,
+        GreaterFullEqual,
+        GreaterGreater,
+        GreaterLess,
+        GreaterSlantEqual,
+        GreaterTilde,
+        Gscr,
+        gscr,
+        gsim,
+        gsime,
+        gsiml,
+        gtcc,
+        gtcir,
+        gt,
+        GT,
+        Gt,
+        gtdot,
+        gtlPar,
+        gtquest,
+        gtrapprox,
+        gtrarr,
+        gtrdot,
+        gtreqless,
+        gtreqqless,
+        gtrless,
+        gtrsim,
+        gvertneqq,
+        gvnE,
+        Hacek,
+        hairsp,
+        half,
+        hamilt,
+        HARDcy,
+        hardcy,
+        harrcir,
+        harr,
+        hArr,
+        harrw,
+        Hat,
+        hbar,
+        Hcirc,
+        hcirc,
+        hearts,
+        heartsuit,
+        hellip,
+        hercon,
+        hfr,
+        Hfr,
+        HilbertSpace,
+        hksearow,
+        hkswarow,
+        hoarr,
+        homtht,
+        hookleftarrow,
+        hookrightarrow,
+        hopf,
+        Hopf,
+        horbar,
+        HorizontalLine,
+        hscr,
+        Hscr,
+        hslash,
+        Hstrok,
+        hstrok,
+        HumpDownHump,
+        HumpEqual,
+        hybull,
+        hyphen,
+        Iacute,
+        iacute,
+        ic,
+        Icirc,
+        icirc,
+        Icy,
+        icy,
+        Idot,
+        IEcy,
+        iecy,
+        iexcl,
+        iff,
+        ifr,
+        Ifr,
+        Igrave,
+        igrave,
+        ii,
+        iiiint,
+        iiint,
+        iinfin,
+        iiota,
+        IJlig,
+        ijlig,
+        Imacr,
+        imacr,
+        image: image$1,
+        ImaginaryI,
+        imagline,
+        imagpart,
+        imath,
+        Im,
+        imof,
+        imped,
+        Implies,
+        incare,
+        in: "\u2208",
+        infin,
+        infintie,
+        inodot,
+        intcal,
+        int,
+        Int,
+        integers,
+        Integral,
+        intercal,
+        Intersection,
+        intlarhk,
+        intprod,
+        InvisibleComma,
+        InvisibleTimes,
+        IOcy,
+        iocy,
+        Iogon,
+        iogon,
+        Iopf,
+        iopf,
+        Iota,
+        iota,
+        iprod,
+        iquest,
+        iscr,
+        Iscr,
+        isin,
+        isindot,
+        isinE,
+        isins,
+        isinsv,
+        isinv,
+        it,
+        Itilde,
+        itilde,
+        Iukcy,
+        iukcy,
+        Iuml,
+        iuml,
+        Jcirc,
+        jcirc,
+        Jcy,
+        jcy,
+        Jfr,
+        jfr,
+        jmath,
+        Jopf,
+        jopf,
+        Jscr,
+        jscr,
+        Jsercy,
+        jsercy,
+        Jukcy,
+        jukcy,
+        Kappa,
+        kappa,
+        kappav,
+        Kcedil,
+        kcedil,
+        Kcy,
+        kcy,
+        Kfr,
+        kfr,
+        kgreen,
+        KHcy,
+        khcy,
+        KJcy,
+        kjcy,
+        Kopf,
+        kopf,
+        Kscr,
+        kscr,
+        lAarr,
+        Lacute,
+        lacute,
+        laemptyv,
+        lagran,
+        Lambda,
+        lambda,
+        lang,
+        Lang,
+        langd,
+        langle,
+        lap,
+        Laplacetrf,
+        laquo,
+        larrb,
+        larrbfs,
+        larr,
+        Larr,
+        lArr,
+        larrfs,
+        larrhk,
+        larrlp,
+        larrpl,
+        larrsim,
+        larrtl,
+        latail,
+        lAtail,
+        lat,
+        late,
+        lates,
+        lbarr,
+        lBarr,
+        lbbrk,
+        lbrace,
+        lbrack,
+        lbrke,
+        lbrksld,
+        lbrkslu,
+        Lcaron,
+        lcaron,
+        Lcedil,
+        lcedil,
+        lceil,
+        lcub,
+        Lcy,
+        lcy,
+        ldca,
+        ldquo,
+        ldquor,
+        ldrdhar,
+        ldrushar,
+        ldsh,
+        le,
+        lE,
+        LeftAngleBracket,
+        LeftArrowBar,
+        leftarrow,
+        LeftArrow,
+        Leftarrow,
+        LeftArrowRightArrow,
+        leftarrowtail,
+        LeftCeiling,
+        LeftDoubleBracket,
+        LeftDownTeeVector,
+        LeftDownVectorBar,
+        LeftDownVector,
+        LeftFloor,
+        leftharpoondown,
+        leftharpoonup,
+        leftleftarrows,
+        leftrightarrow,
+        LeftRightArrow,
+        Leftrightarrow,
+        leftrightarrows,
+        leftrightharpoons,
+        leftrightsquigarrow,
+        LeftRightVector,
+        LeftTeeArrow,
+        LeftTee,
+        LeftTeeVector,
+        leftthreetimes,
+        LeftTriangleBar,
+        LeftTriangle,
+        LeftTriangleEqual,
+        LeftUpDownVector,
+        LeftUpTeeVector,
+        LeftUpVectorBar,
+        LeftUpVector,
+        LeftVectorBar,
+        LeftVector,
+        lEg,
+        leg,
+        leq,
+        leqq,
+        leqslant,
+        lescc,
+        les,
+        lesdot,
+        lesdoto,
+        lesdotor,
+        lesg,
+        lesges,
+        lessapprox,
+        lessdot,
+        lesseqgtr,
+        lesseqqgtr,
+        LessEqualGreater,
+        LessFullEqual,
+        LessGreater,
+        lessgtr,
+        LessLess,
+        lesssim,
+        LessSlantEqual,
+        LessTilde,
+        lfisht,
+        lfloor,
+        Lfr,
+        lfr,
+        lg,
+        lgE,
+        lHar,
+        lhard,
+        lharu,
+        lharul,
+        lhblk,
+        LJcy,
+        ljcy,
+        llarr,
+        ll,
+        Ll,
+        llcorner,
+        Lleftarrow,
+        llhard,
+        lltri,
+        Lmidot,
+        lmidot,
+        lmoustache,
+        lmoust,
+        lnap,
+        lnapprox,
+        lne,
+        lnE,
+        lneq,
+        lneqq,
+        lnsim,
+        loang,
+        loarr,
+        lobrk,
+        longleftarrow,
+        LongLeftArrow,
+        Longleftarrow,
+        longleftrightarrow,
+        LongLeftRightArrow,
+        Longleftrightarrow,
+        longmapsto,
+        longrightarrow,
+        LongRightArrow,
+        Longrightarrow,
+        looparrowleft,
+        looparrowright,
+        lopar,
+        Lopf,
+        lopf,
+        loplus,
+        lotimes,
+        lowast,
+        lowbar,
+        LowerLeftArrow,
+        LowerRightArrow,
+        loz,
+        lozenge,
+        lozf,
+        lpar,
+        lparlt,
+        lrarr,
+        lrcorner,
+        lrhar,
+        lrhard,
+        lrm,
+        lrtri,
+        lsaquo,
+        lscr,
+        Lscr,
+        lsh,
+        Lsh,
+        lsim,
+        lsime,
+        lsimg,
+        lsqb,
+        lsquo,
+        lsquor,
+        Lstrok,
+        lstrok,
+        ltcc,
+        ltcir,
+        lt,
+        LT,
+        Lt,
+        ltdot,
+        lthree,
+        ltimes,
+        ltlarr,
+        ltquest,
+        ltri,
+        ltrie,
+        ltrif,
+        ltrPar,
+        lurdshar,
+        luruhar,
+        lvertneqq,
+        lvnE,
+        macr,
+        male,
+        malt,
+        maltese,
+        Map: "\u2905",
+        map: map$1,
+        mapsto,
+        mapstodown,
+        mapstoleft,
+        mapstoup,
+        marker,
+        mcomma,
+        Mcy,
+        mcy,
+        mdash,
+        mDDot,
+        measuredangle,
+        MediumSpace,
+        Mellintrf,
+        Mfr,
+        mfr,
+        mho,
+        micro,
+        midast,
+        midcir,
+        mid,
+        middot,
+        minusb,
+        minus,
+        minusd,
+        minusdu,
+        MinusPlus,
+        mlcp,
+        mldr,
+        mnplus,
+        models,
+        Mopf,
+        mopf,
+        mp,
+        mscr,
+        Mscr,
+        mstpos,
+        Mu,
+        mu,
+        multimap,
+        mumap,
+        nabla,
+        Nacute,
+        nacute,
+        nang,
+        nap,
+        napE,
+        napid,
+        napos,
+        napprox,
+        natural,
+        naturals,
+        natur,
+        nbsp,
+        nbump,
+        nbumpe,
+        ncap,
+        Ncaron,
+        ncaron,
+        Ncedil,
+        ncedil,
+        ncong,
+        ncongdot,
+        ncup,
+        Ncy,
+        ncy,
+        ndash,
+        nearhk,
+        nearr,
+        neArr,
+        nearrow,
+        ne,
+        nedot,
+        NegativeMediumSpace,
+        NegativeThickSpace,
+        NegativeThinSpace,
+        NegativeVeryThinSpace,
+        nequiv,
+        nesear,
+        nesim,
+        NestedGreaterGreater,
+        NestedLessLess,
+        NewLine,
+        nexist,
+        nexists,
+        Nfr,
+        nfr,
+        ngE,
+        nge,
+        ngeq,
+        ngeqq,
+        ngeqslant,
+        nges,
+        nGg,
+        ngsim,
+        nGt,
+        ngt,
+        ngtr,
+        nGtv,
+        nharr,
+        nhArr,
+        nhpar,
+        ni,
+        nis,
+        nisd,
+        niv,
+        NJcy,
+        njcy,
+        nlarr,
+        nlArr,
+        nldr,
+        nlE,
+        nle,
+        nleftarrow,
+        nLeftarrow,
+        nleftrightarrow,
+        nLeftrightarrow,
+        nleq,
+        nleqq,
+        nleqslant,
+        nles,
+        nless,
+        nLl,
+        nlsim,
+        nLt,
+        nlt,
+        nltri,
+        nltrie,
+        nLtv,
+        nmid,
+        NoBreak,
+        NonBreakingSpace,
+        nopf,
+        Nopf,
+        Not,
+        not,
+        NotCongruent,
+        NotCupCap,
+        NotDoubleVerticalBar,
+        NotElement,
+        NotEqual,
+        NotEqualTilde,
+        NotExists,
+        NotGreater,
+        NotGreaterEqual,
+        NotGreaterFullEqual,
+        NotGreaterGreater,
+        NotGreaterLess,
+        NotGreaterSlantEqual,
+        NotGreaterTilde,
+        NotHumpDownHump,
+        NotHumpEqual,
+        notin,
+        notindot,
+        notinE,
+        notinva,
+        notinvb,
+        notinvc,
+        NotLeftTriangleBar,
+        NotLeftTriangle,
+        NotLeftTriangleEqual,
+        NotLess,
+        NotLessEqual,
+        NotLessGreater,
+        NotLessLess,
+        NotLessSlantEqual,
+        NotLessTilde,
+        NotNestedGreaterGreater,
+        NotNestedLessLess,
+        notni,
+        notniva,
+        notnivb,
+        notnivc,
+        NotPrecedes,
+        NotPrecedesEqual,
+        NotPrecedesSlantEqual,
+        NotReverseElement,
+        NotRightTriangleBar,
+        NotRightTriangle,
+        NotRightTriangleEqual,
+        NotSquareSubset,
+        NotSquareSubsetEqual,
+        NotSquareSuperset,
+        NotSquareSupersetEqual,
+        NotSubset,
+        NotSubsetEqual,
+        NotSucceeds,
+        NotSucceedsEqual,
+        NotSucceedsSlantEqual,
+        NotSucceedsTilde,
+        NotSuperset,
+        NotSupersetEqual,
+        NotTilde,
+        NotTildeEqual,
+        NotTildeFullEqual,
+        NotTildeTilde,
+        NotVerticalBar,
+        nparallel,
+        npar,
+        nparsl,
+        npart,
+        npolint,
+        npr,
+        nprcue,
+        nprec,
+        npreceq,
+        npre,
+        nrarrc,
+        nrarr,
+        nrArr,
+        nrarrw,
+        nrightarrow,
+        nRightarrow,
+        nrtri,
+        nrtrie,
+        nsc,
+        nsccue,
+        nsce,
+        Nscr,
+        nscr,
+        nshortmid,
+        nshortparallel,
+        nsim,
+        nsime,
+        nsimeq,
+        nsmid,
+        nspar,
+        nsqsube,
+        nsqsupe,
+        nsub,
+        nsubE,
+        nsube,
+        nsubset,
+        nsubseteq,
+        nsubseteqq,
+        nsucc,
+        nsucceq,
+        nsup,
+        nsupE,
+        nsupe,
+        nsupset,
+        nsupseteq,
+        nsupseteqq,
+        ntgl,
+        Ntilde,
+        ntilde,
+        ntlg,
+        ntriangleleft,
+        ntrianglelefteq,
+        ntriangleright,
+        ntrianglerighteq,
+        Nu,
+        nu,
+        num,
+        numero,
+        numsp,
+        nvap,
+        nvdash,
+        nvDash,
+        nVdash,
+        nVDash,
+        nvge,
+        nvgt,
+        nvHarr,
+        nvinfin,
+        nvlArr,
+        nvle,
+        nvlt,
+        nvltrie,
+        nvrArr,
+        nvrtrie,
+        nvsim,
+        nwarhk,
+        nwarr,
+        nwArr,
+        nwarrow,
+        nwnear,
+        Oacute,
+        oacute,
+        oast,
+        Ocirc,
+        ocirc,
+        ocir,
+        Ocy,
+        ocy,
+        odash,
+        Odblac,
+        odblac,
+        odiv,
+        odot,
+        odsold,
+        OElig,
+        oelig,
+        ofcir,
+        Ofr,
+        ofr,
+        ogon,
+        Ograve,
+        ograve,
+        ogt,
+        ohbar,
+        ohm,
+        oint,
+        olarr,
+        olcir,
+        olcross,
+        oline,
+        olt,
+        Omacr,
+        omacr,
+        Omega,
+        omega,
+        Omicron,
+        omicron,
+        omid,
+        ominus,
+        Oopf,
+        oopf,
+        opar,
+        OpenCurlyDoubleQuote,
+        OpenCurlyQuote,
+        operp,
+        oplus,
+        orarr,
+        Or,
+        or,
+        ord,
+        order,
+        orderof,
+        ordf,
+        ordm,
+        origof,
+        oror,
+        orslope,
+        orv,
+        oS,
+        Oscr,
+        oscr,
+        Oslash,
+        oslash,
+        osol,
+        Otilde,
+        otilde,
+        otimesas,
+        Otimes,
+        otimes,
+        Ouml,
+        ouml,
+        ovbar,
+        OverBar,
+        OverBrace,
+        OverBracket,
+        OverParenthesis,
+        para,
+        parallel,
+        par,
+        parsim,
+        parsl,
+        part,
+        PartialD,
+        Pcy,
+        pcy,
+        percnt,
+        period,
+        permil,
+        perp,
+        pertenk,
+        Pfr,
+        pfr,
+        Phi,
+        phi,
+        phiv,
+        phmmat,
+        phone,
+        Pi,
+        pi,
+        pitchfork,
+        piv,
+        planck,
+        planckh,
+        plankv,
+        plusacir,
+        plusb,
+        pluscir,
+        plus,
+        plusdo,
+        plusdu,
+        pluse,
+        PlusMinus,
+        plusmn,
+        plussim,
+        plustwo,
+        pm,
+        Poincareplane,
+        pointint,
+        popf,
+        Popf,
+        pound,
+        prap,
+        Pr,
+        pr,
+        prcue,
+        precapprox,
+        prec,
+        preccurlyeq,
+        Precedes,
+        PrecedesEqual,
+        PrecedesSlantEqual,
+        PrecedesTilde,
+        preceq,
+        precnapprox,
+        precneqq,
+        precnsim,
+        pre,
+        prE,
+        precsim,
+        prime,
+        Prime,
+        primes,
+        prnap,
+        prnE,
+        prnsim,
+        prod,
+        Product,
+        profalar,
+        profline,
+        profsurf,
+        prop,
+        Proportional,
+        Proportion,
+        propto,
+        prsim,
+        prurel,
+        Pscr,
+        pscr,
+        Psi,
+        psi,
+        puncsp,
+        Qfr,
+        qfr,
+        qint,
+        qopf,
+        Qopf,
+        qprime,
+        Qscr,
+        qscr,
+        quaternions,
+        quatint,
+        quest,
+        questeq,
+        quot,
+        QUOT,
+        rAarr,
+        race,
+        Racute,
+        racute,
+        radic,
+        raemptyv,
+        rang,
+        Rang,
+        rangd,
+        range,
+        rangle,
+        raquo,
+        rarrap,
+        rarrb,
+        rarrbfs,
+        rarrc,
+        rarr,
+        Rarr,
+        rArr,
+        rarrfs,
+        rarrhk,
+        rarrlp,
+        rarrpl,
+        rarrsim,
+        Rarrtl,
+        rarrtl,
+        rarrw,
+        ratail,
+        rAtail,
+        ratio,
+        rationals,
+        rbarr,
+        rBarr,
+        RBarr,
+        rbbrk,
+        rbrace,
+        rbrack,
+        rbrke,
+        rbrksld,
+        rbrkslu,
+        Rcaron,
+        rcaron,
+        Rcedil,
+        rcedil,
+        rceil,
+        rcub,
+        Rcy,
+        rcy,
+        rdca,
+        rdldhar,
+        rdquo,
+        rdquor,
+        rdsh,
+        real,
+        realine,
+        realpart,
+        reals,
+        Re,
+        rect,
+        reg,
+        REG,
+        ReverseElement,
+        ReverseEquilibrium,
+        ReverseUpEquilibrium,
+        rfisht,
+        rfloor,
+        rfr,
+        Rfr,
+        rHar,
+        rhard,
+        rharu,
+        rharul,
+        Rho,
+        rho,
+        rhov,
+        RightAngleBracket,
+        RightArrowBar,
+        rightarrow,
+        RightArrow,
+        Rightarrow,
+        RightArrowLeftArrow,
+        rightarrowtail,
+        RightCeiling,
+        RightDoubleBracket,
+        RightDownTeeVector,
+        RightDownVectorBar,
+        RightDownVector,
+        RightFloor,
+        rightharpoondown,
+        rightharpoonup,
+        rightleftarrows,
+        rightleftharpoons,
+        rightrightarrows,
+        rightsquigarrow,
+        RightTeeArrow,
+        RightTee,
+        RightTeeVector,
+        rightthreetimes,
+        RightTriangleBar,
+        RightTriangle,
+        RightTriangleEqual,
+        RightUpDownVector,
+        RightUpTeeVector,
+        RightUpVectorBar,
+        RightUpVector,
+        RightVectorBar,
+        RightVector,
+        ring,
+        risingdotseq,
+        rlarr,
+        rlhar,
+        rlm,
+        rmoustache,
+        rmoust,
+        rnmid,
+        roang,
+        roarr,
+        robrk,
+        ropar,
+        ropf,
+        Ropf,
+        roplus,
+        rotimes,
+        RoundImplies,
+        rpar,
+        rpargt,
+        rppolint,
+        rrarr,
+        Rrightarrow,
+        rsaquo,
+        rscr,
+        Rscr,
+        rsh,
+        Rsh,
+        rsqb,
+        rsquo,
+        rsquor,
+        rthree,
+        rtimes,
+        rtri,
+        rtrie,
+        rtrif,
+        rtriltri,
+        RuleDelayed,
+        ruluhar,
+        rx,
+        Sacute,
+        sacute,
+        sbquo,
+        scap,
+        Scaron,
+        scaron,
+        Sc,
+        sc,
+        sccue,
+        sce,
+        scE,
+        Scedil,
+        scedil,
+        Scirc,
+        scirc,
+        scnap,
+        scnE,
+        scnsim,
+        scpolint,
+        scsim,
+        Scy,
+        scy,
+        sdotb,
+        sdot,
+        sdote,
+        searhk,
+        searr,
+        seArr,
+        searrow,
+        sect,
+        semi,
+        seswar,
+        setminus,
+        setmn,
+        sext,
+        Sfr,
+        sfr,
+        sfrown,
+        sharp,
+        SHCHcy,
+        shchcy,
+        SHcy,
+        shcy,
+        ShortDownArrow,
+        ShortLeftArrow,
+        shortmid,
+        shortparallel,
+        ShortRightArrow,
+        ShortUpArrow,
+        shy,
+        Sigma,
+        sigma,
+        sigmaf,
+        sigmav,
+        sim,
+        simdot,
+        sime,
+        simeq,
+        simg,
+        simgE,
+        siml,
+        simlE,
+        simne,
+        simplus,
+        simrarr,
+        slarr,
+        SmallCircle,
+        smallsetminus,
+        smashp,
+        smeparsl,
+        smid,
+        smile,
+        smt,
+        smte,
+        smtes,
+        SOFTcy,
+        softcy,
+        solbar,
+        solb,
+        sol,
+        Sopf,
+        sopf,
+        spades,
+        spadesuit,
+        spar,
+        sqcap,
+        sqcaps,
+        sqcup,
+        sqcups,
+        Sqrt,
+        sqsub,
+        sqsube,
+        sqsubset,
+        sqsubseteq,
+        sqsup,
+        sqsupe,
+        sqsupset,
+        sqsupseteq,
+        square,
+        Square,
+        SquareIntersection,
+        SquareSubset,
+        SquareSubsetEqual,
+        SquareSuperset,
+        SquareSupersetEqual,
+        SquareUnion,
+        squarf,
+        squ,
+        squf,
+        srarr,
+        Sscr,
+        sscr,
+        ssetmn,
+        ssmile,
+        sstarf,
+        Star,
+        star,
+        starf,
+        straightepsilon,
+        straightphi,
+        strns,
+        sub,
+        Sub,
+        subdot,
+        subE,
+        sube,
+        subedot,
+        submult,
+        subnE,
+        subne,
+        subplus,
+        subrarr,
+        subset,
+        Subset,
+        subseteq,
+        subseteqq,
+        SubsetEqual,
+        subsetneq,
+        subsetneqq,
+        subsim,
+        subsub,
+        subsup,
+        succapprox,
+        succ,
+        succcurlyeq,
+        Succeeds,
+        SucceedsEqual,
+        SucceedsSlantEqual,
+        SucceedsTilde,
+        succeq,
+        succnapprox,
+        succneqq,
+        succnsim,
+        succsim,
+        SuchThat,
+        sum,
+        Sum,
+        sung,
+        sup1,
+        sup2,
+        sup3,
+        sup,
+        Sup,
+        supdot,
+        supdsub,
+        supE,
+        supe,
+        supedot,
+        Superset,
+        SupersetEqual,
+        suphsol,
+        suphsub,
+        suplarr,
+        supmult,
+        supnE,
+        supne,
+        supplus,
+        supset,
+        Supset,
+        supseteq,
+        supseteqq,
+        supsetneq,
+        supsetneqq,
+        supsim,
+        supsub,
+        supsup,
+        swarhk,
+        swarr,
+        swArr,
+        swarrow,
+        swnwar,
+        szlig,
+        Tab: Tab$1,
+        target,
+        Tau,
+        tau,
+        tbrk,
+        Tcaron,
+        tcaron,
+        Tcedil,
+        tcedil,
+        Tcy,
+        tcy,
+        tdot,
+        telrec,
+        Tfr,
+        tfr,
+        there4,
+        therefore,
+        Therefore,
+        Theta,
+        theta,
+        thetasym,
+        thetav,
+        thickapprox,
+        thicksim,
+        ThickSpace,
+        ThinSpace,
+        thinsp,
+        thkap,
+        thksim,
+        THORN,
+        thorn,
+        tilde,
+        Tilde,
+        TildeEqual,
+        TildeFullEqual,
+        TildeTilde,
+        timesbar,
+        timesb,
+        times,
+        timesd,
+        tint,
+        toea,
+        topbot,
+        topcir,
+        top,
+        Topf,
+        topf,
+        topfork,
+        tosa,
+        tprime,
+        trade,
+        TRADE,
+        triangle,
+        triangledown,
+        triangleleft,
+        trianglelefteq,
+        triangleq,
+        triangleright,
+        trianglerighteq,
+        tridot,
+        trie,
+        triminus,
+        TripleDot,
+        triplus,
+        trisb,
+        tritime,
+        trpezium,
+        Tscr,
+        tscr,
+        TScy,
+        tscy,
+        TSHcy,
+        tshcy,
+        Tstrok,
+        tstrok,
+        twixt,
+        twoheadleftarrow,
+        twoheadrightarrow,
+        Uacute,
+        uacute,
+        uarr,
+        Uarr,
+        uArr,
+        Uarrocir,
+        Ubrcy,
+        ubrcy,
+        Ubreve,
+        ubreve,
+        Ucirc,
+        ucirc,
+        Ucy,
+        ucy,
+        udarr,
+        Udblac,
+        udblac,
+        udhar,
+        ufisht,
+        Ufr,
+        ufr,
+        Ugrave,
+        ugrave,
+        uHar,
+        uharl,
+        uharr,
+        uhblk,
+        ulcorn,
+        ulcorner,
+        ulcrop,
+        ultri,
+        Umacr,
+        umacr,
+        uml,
+        UnderBar,
+        UnderBrace,
+        UnderBracket,
+        UnderParenthesis,
+        Union,
+        UnionPlus,
+        Uogon,
+        uogon,
+        Uopf,
+        uopf,
+        UpArrowBar,
+        uparrow,
+        UpArrow,
+        Uparrow,
+        UpArrowDownArrow,
+        updownarrow,
+        UpDownArrow,
+        Updownarrow,
+        UpEquilibrium,
+        upharpoonleft,
+        upharpoonright,
+        uplus,
+        UpperLeftArrow,
+        UpperRightArrow,
+        upsi,
+        Upsi,
+        upsih,
+        Upsilon,
+        upsilon,
+        UpTeeArrow,
+        UpTee,
+        upuparrows,
+        urcorn,
+        urcorner,
+        urcrop,
+        Uring,
+        uring,
+        urtri,
+        Uscr,
+        uscr,
+        utdot,
+        Utilde,
+        utilde,
+        utri,
+        utrif,
+        uuarr,
+        Uuml,
+        uuml,
+        uwangle,
+        vangrt,
+        varepsilon,
+        varkappa,
+        varnothing,
+        varphi,
+        varpi,
+        varpropto,
+        varr,
+        vArr,
+        varrho,
+        varsigma,
+        varsubsetneq,
+        varsubsetneqq,
+        varsupsetneq,
+        varsupsetneqq,
+        vartheta,
+        vartriangleleft,
+        vartriangleright,
+        vBar,
+        Vbar,
+        vBarv,
+        Vcy,
+        vcy,
+        vdash,
+        vDash,
+        Vdash,
+        VDash,
+        Vdashl,
+        veebar,
+        vee,
+        Vee,
+        veeeq,
+        vellip,
+        verbar,
+        Verbar,
+        vert,
+        Vert,
+        VerticalBar,
+        VerticalLine,
+        VerticalSeparator,
+        VerticalTilde,
+        VeryThinSpace,
+        Vfr,
+        vfr,
+        vltri,
+        vnsub,
+        vnsup,
+        Vopf,
+        vopf,
+        vprop,
+        vrtri,
+        Vscr,
+        vscr,
+        vsubnE,
+        vsubne,
+        vsupnE,
+        vsupne,
+        Vvdash,
+        vzigzag,
+        Wcirc,
+        wcirc,
+        wedbar,
+        wedge,
+        Wedge,
+        wedgeq,
+        weierp,
+        Wfr,
+        wfr,
+        Wopf,
+        wopf,
+        wp,
+        wr,
+        wreath,
+        Wscr,
+        wscr,
+        xcap,
+        xcirc,
+        xcup,
+        xdtri,
+        Xfr,
+        xfr,
+        xharr,
+        xhArr,
+        Xi,
+        xi,
+        xlarr,
+        xlArr,
+        xmap,
+        xnis,
+        xodot,
+        Xopf,
+        xopf,
+        xoplus,
+        xotime,
+        xrarr,
+        xrArr,
+        Xscr,
+        xscr,
+        xsqcup,
+        xuplus,
+        xutri,
+        xvee,
+        xwedge,
+        Yacute,
+        yacute,
+        YAcy,
+        yacy,
+        Ycirc,
+        ycirc,
+        Ycy,
+        ycy,
+        yen,
+        Yfr,
+        yfr,
+        YIcy,
+        yicy,
+        Yopf,
+        yopf,
+        Yscr,
+        yscr,
+        YUcy,
+        yucy,
+        yuml,
+        Yuml,
+        Zacute,
+        zacute,
+        Zcaron,
+        zcaron,
+        Zcy,
+        zcy,
+        Zdot,
+        zdot,
+        zeetrf,
+        ZeroWidthSpace,
+        Zeta,
+        zeta,
+        zfr,
+        Zfr,
+        ZHcy,
+        zhcy,
+        zigrarr,
+        zopf,
+        Zopf,
+        Zscr,
+        zscr,
+        zwj,
+        zwnj,
+      };
+      var entities$1 = require$$0;
+      var regex$4 =
+        /[!-#%-\*,-\/:;\?@\[-\]_\{\}\xA1\xA7\xAB\xB6\xB7\xBB\xBF\u037E\u0387\u055A-\u055F\u0589\u058A\u05BE\u05C0\u05C3\u05C6\u05F3\u05F4\u0609\u060A\u060C\u060D\u061B\u061E\u061F\u066A-\u066D\u06D4\u0700-\u070D\u07F7-\u07F9\u0830-\u083E\u085E\u0964\u0965\u0970\u09FD\u0A76\u0AF0\u0C84\u0DF4\u0E4F\u0E5A\u0E5B\u0F04-\u0F12\u0F14\u0F3A-\u0F3D\u0F85\u0FD0-\u0FD4\u0FD9\u0FDA\u104A-\u104F\u10FB\u1360-\u1368\u1400\u166D\u166E\u169B\u169C\u16EB-\u16ED\u1735\u1736\u17D4-\u17D6\u17D8-\u17DA\u1800-\u180A\u1944\u1945\u1A1E\u1A1F\u1AA0-\u1AA6\u1AA8-\u1AAD\u1B5A-\u1B60\u1BFC-\u1BFF\u1C3B-\u1C3F\u1C7E\u1C7F\u1CC0-\u1CC7\u1CD3\u2010-\u2027\u2030-\u2043\u2045-\u2051\u2053-\u205E\u207D\u207E\u208D\u208E\u2308-\u230B\u2329\u232A\u2768-\u2775\u27C5\u27C6\u27E6-\u27EF\u2983-\u2998\u29D8-\u29DB\u29FC\u29FD\u2CF9-\u2CFC\u2CFE\u2CFF\u2D70\u2E00-\u2E2E\u2E30-\u2E4E\u3001-\u3003\u3008-\u3011\u3014-\u301F\u3030\u303D\u30A0\u30FB\uA4FE\uA4FF\uA60D-\uA60F\uA673\uA67E\uA6F2-\uA6F7\uA874-\uA877\uA8CE\uA8CF\uA8F8-\uA8FA\uA8FC\uA92E\uA92F\uA95F\uA9C1-\uA9CD\uA9DE\uA9DF\uAA5C-\uAA5F\uAADE\uAADF\uAAF0\uAAF1\uABEB\uFD3E\uFD3F\uFE10-\uFE19\uFE30-\uFE52\uFE54-\uFE61\uFE63\uFE68\uFE6A\uFE6B\uFF01-\uFF03\uFF05-\uFF0A\uFF0C-\uFF0F\uFF1A\uFF1B\uFF1F\uFF20\uFF3B-\uFF3D\uFF3F\uFF5B\uFF5D\uFF5F-\uFF65]|\uD800[\uDD00-\uDD02\uDF9F\uDFD0]|\uD801\uDD6F|\uD802[\uDC57\uDD1F\uDD3F\uDE50-\uDE58\uDE7F\uDEF0-\uDEF6\uDF39-\uDF3F\uDF99-\uDF9C]|\uD803[\uDF55-\uDF59]|\uD804[\uDC47-\uDC4D\uDCBB\uDCBC\uDCBE-\uDCC1\uDD40-\uDD43\uDD74\uDD75\uDDC5-\uDDC8\uDDCD\uDDDB\uDDDD-\uDDDF\uDE38-\uDE3D\uDEA9]|\uD805[\uDC4B-\uDC4F\uDC5B\uDC5D\uDCC6\uDDC1-\uDDD7\uDE41-\uDE43\uDE60-\uDE6C\uDF3C-\uDF3E]|\uD806[\uDC3B\uDE3F-\uDE46\uDE9A-\uDE9C\uDE9E-\uDEA2]|\uD807[\uDC41-\uDC45\uDC70\uDC71\uDEF7\uDEF8]|\uD809[\uDC70-\uDC74]|\uD81A[\uDE6E\uDE6F\uDEF5\uDF37-\uDF3B\uDF44]|\uD81B[\uDE97-\uDE9A]|\uD82F\uDC9F|\uD836[\uDE87-\uDE8B]|\uD83A[\uDD5E\uDD5F]/;
+      var mdurl$1 = {};
+      var encodeCache = {};
+      function getEncodeCache(exclude) {
+        var i,
+          ch2,
+          cache = encodeCache[exclude];
+        if (cache) {
+          return cache;
+        }
+        cache = encodeCache[exclude] = [];
+        for (i = 0; i < 128; i++) {
+          ch2 = String.fromCharCode(i);
+          if (/^[0-9a-z]$/i.test(ch2)) {
+            cache.push(ch2);
+          } else {
+            cache.push("%" + ("0" + i.toString(16).toUpperCase()).slice(-2));
+          }
+        }
+        for (i = 0; i < exclude.length; i++) {
+          cache[exclude.charCodeAt(i)] = exclude[i];
+        }
+        return cache;
+      }
+      function encode$1(string2, exclude, keepEscaped) {
+        var i,
+          l2,
+          code3,
+          nextCode,
+          cache,
+          result2 = "";
+        if (typeof exclude !== "string") {
+          keepEscaped = exclude;
+          exclude = encode$1.defaultChars;
+        }
+        if (typeof keepEscaped === "undefined") {
+          keepEscaped = true;
+        }
+        cache = getEncodeCache(exclude);
+        for (i = 0, l2 = string2.length; i < l2; i++) {
+          code3 = string2.charCodeAt(i);
+          if (keepEscaped && code3 === 37 && i + 2 < l2) {
+            if (/^[0-9a-f]{2}$/i.test(string2.slice(i + 1, i + 3))) {
+              result2 += string2.slice(i, i + 3);
+              i += 2;
+              continue;
+            }
+          }
+          if (code3 < 128) {
+            result2 += cache[code3];
+            continue;
+          }
+          if (code3 >= 55296 && code3 <= 57343) {
+            if (code3 >= 55296 && code3 <= 56319 && i + 1 < l2) {
+              nextCode = string2.charCodeAt(i + 1);
+              if (nextCode >= 56320 && nextCode <= 57343) {
+                result2 += encodeURIComponent(string2[i] + string2[i + 1]);
+                i++;
+                continue;
+              }
+            }
+            result2 += "%EF%BF%BD";
+            continue;
+          }
+          result2 += encodeURIComponent(string2[i]);
+        }
+        return result2;
+      }
+      encode$1.defaultChars = ";/?:@&=+$,-_.!~*'()#";
+      encode$1.componentChars = "-_.!~*'()";
+      var encode_1 = encode$1;
+      var decodeCache = {};
+      function getDecodeCache(exclude) {
+        var i,
+          ch2,
+          cache = decodeCache[exclude];
+        if (cache) {
+          return cache;
+        }
+        cache = decodeCache[exclude] = [];
+        for (i = 0; i < 128; i++) {
+          ch2 = String.fromCharCode(i);
+          cache.push(ch2);
+        }
+        for (i = 0; i < exclude.length; i++) {
+          ch2 = exclude.charCodeAt(i);
+          cache[ch2] = "%" + ("0" + ch2.toString(16).toUpperCase()).slice(-2);
+        }
+        return cache;
+      }
+      function decode$1(string2, exclude) {
+        var cache;
+        if (typeof exclude !== "string") {
+          exclude = decode$1.defaultChars;
+        }
+        cache = getDecodeCache(exclude);
+        return string2.replace(/(%[a-f0-9]{2})+/gi, function (seq) {
+          var i,
+            l2,
+            b1,
+            b2,
+            b3,
+            b4,
+            chr,
+            result2 = "";
+          for (i = 0, l2 = seq.length; i < l2; i += 3) {
+            b1 = parseInt(seq.slice(i + 1, i + 3), 16);
+            if (b1 < 128) {
+              result2 += cache[b1];
+              continue;
+            }
+            if ((b1 & 224) === 192 && i + 3 < l2) {
+              b2 = parseInt(seq.slice(i + 4, i + 6), 16);
+              if ((b2 & 192) === 128) {
+                chr = ((b1 << 6) & 1984) | (b2 & 63);
+                if (chr < 128) {
+                  result2 += "\uFFFD\uFFFD";
+                } else {
+                  result2 += String.fromCharCode(chr);
+                }
+                i += 3;
+                continue;
+              }
+            }
+            if ((b1 & 240) === 224 && i + 6 < l2) {
+              b2 = parseInt(seq.slice(i + 4, i + 6), 16);
+              b3 = parseInt(seq.slice(i + 7, i + 9), 16);
+              if ((b2 & 192) === 128 && (b3 & 192) === 128) {
+                chr = ((b1 << 12) & 61440) | ((b2 << 6) & 4032) | (b3 & 63);
+                if (chr < 2048 || (chr >= 55296 && chr <= 57343)) {
+                  result2 += "\uFFFD\uFFFD\uFFFD";
+                } else {
+                  result2 += String.fromCharCode(chr);
+                }
+                i += 6;
+                continue;
+              }
+            }
+            if ((b1 & 248) === 240 && i + 9 < l2) {
+              b2 = parseInt(seq.slice(i + 4, i + 6), 16);
+              b3 = parseInt(seq.slice(i + 7, i + 9), 16);
+              b4 = parseInt(seq.slice(i + 10, i + 12), 16);
+              if (
+                (b2 & 192) === 128 &&
+                (b3 & 192) === 128 &&
+                (b4 & 192) === 128
+              ) {
+                chr =
+                  ((b1 << 18) & 1835008) |
+                  ((b2 << 12) & 258048) |
+                  ((b3 << 6) & 4032) |
+                  (b4 & 63);
+                if (chr < 65536 || chr > 1114111) {
+                  result2 += "\uFFFD\uFFFD\uFFFD\uFFFD";
+                } else {
+                  chr -= 65536;
+                  result2 += String.fromCharCode(
+                    55296 + (chr >> 10),
+                    56320 + (chr & 1023)
+                  );
+                }
+                i += 9;
+                continue;
+              }
+            }
+            result2 += "\uFFFD";
+          }
+          return result2;
+        });
+      }
+      decode$1.defaultChars = ";/?:@&=+$,#";
+      decode$1.componentChars = "";
+      var decode_1 = decode$1;
+      var format = function format2(url) {
+        var result2 = "";
+        result2 += url.protocol || "";
+        result2 += url.slashes ? "//" : "";
+        result2 += url.auth ? url.auth + "@" : "";
+        if (url.hostname && url.hostname.indexOf(":") !== -1) {
+          result2 += "[" + url.hostname + "]";
+        } else {
+          result2 += url.hostname || "";
+        }
+        result2 += url.port ? ":" + url.port : "";
+        result2 += url.pathname || "";
+        result2 += url.search || "";
+        result2 += url.hash || "";
+        return result2;
+      };
+      function Url() {
+        this.protocol = null;
+        this.slashes = null;
+        this.auth = null;
+        this.port = null;
+        this.hostname = null;
+        this.hash = null;
+        this.search = null;
+        this.pathname = null;
+      }
+      var protocolPattern = /^([a-z0-9.+-]+:)/i,
+        portPattern = /:[0-9]*$/,
+        simplePathPattern = /^(\/\/?(?!\/)[^\?\s]*)(\?[^\s]*)?$/,
+        delims = ["<", ">", '"', "`", " ", "\r", "\n", "	"],
+        unwise = ["{", "}", "|", "\\", "^", "`"].concat(delims),
+        autoEscape = ["'"].concat(unwise),
+        nonHostChars = ["%", "/", "?", ";", "#"].concat(autoEscape),
+        hostEndingChars = ["/", "?", "#"],
+        hostnameMaxLen = 255,
+        hostnamePartPattern = /^[+a-z0-9A-Z_-]{0,63}$/,
+        hostnamePartStart = /^([+a-z0-9A-Z_-]{0,63})(.*)$/,
+        hostlessProtocol = {
+          javascript: true,
+          "javascript:": true,
+        },
+        slashedProtocol = {
+          http: true,
+          https: true,
+          ftp: true,
+          gopher: true,
+          file: true,
+          "http:": true,
+          "https:": true,
+          "ftp:": true,
+          "gopher:": true,
+          "file:": true,
+        };
+      function urlParse(url, slashesDenoteHost) {
+        if (url && url instanceof Url) {
+          return url;
+        }
+        var u2 = new Url();
+        u2.parse(url, slashesDenoteHost);
+        return u2;
+      }
+      Url.prototype.parse = function (url, slashesDenoteHost) {
+        var i,
+          l2,
+          lowerProto,
+          hec,
+          slashes,
+          rest = url;
+        rest = rest.trim();
+        if (!slashesDenoteHost && url.split("#").length === 1) {
+          var simplePath = simplePathPattern.exec(rest);
+          if (simplePath) {
+            this.pathname = simplePath[1];
+            if (simplePath[2]) {
+              this.search = simplePath[2];
+            }
+            return this;
+          }
+        }
+        var proto = protocolPattern.exec(rest);
+        if (proto) {
+          proto = proto[0];
+          lowerProto = proto.toLowerCase();
+          this.protocol = proto;
+          rest = rest.substr(proto.length);
+        }
+        if (slashesDenoteHost || proto || rest.match(/^\/\/[^@\/]+@[^@\/]+/)) {
+          slashes = rest.substr(0, 2) === "//";
+          if (slashes && !(proto && hostlessProtocol[proto])) {
+            rest = rest.substr(2);
+            this.slashes = true;
+          }
+        }
+        if (
+          !hostlessProtocol[proto] &&
+          (slashes || (proto && !slashedProtocol[proto]))
+        ) {
+          var hostEnd = -1;
+          for (i = 0; i < hostEndingChars.length; i++) {
+            hec = rest.indexOf(hostEndingChars[i]);
+            if (hec !== -1 && (hostEnd === -1 || hec < hostEnd)) {
+              hostEnd = hec;
+            }
+          }
+          var auth, atSign;
+          if (hostEnd === -1) {
+            atSign = rest.lastIndexOf("@");
+          } else {
+            atSign = rest.lastIndexOf("@", hostEnd);
+          }
+          if (atSign !== -1) {
+            auth = rest.slice(0, atSign);
+            rest = rest.slice(atSign + 1);
+            this.auth = auth;
+          }
+          hostEnd = -1;
+          for (i = 0; i < nonHostChars.length; i++) {
+            hec = rest.indexOf(nonHostChars[i]);
+            if (hec !== -1 && (hostEnd === -1 || hec < hostEnd)) {
+              hostEnd = hec;
+            }
+          }
+          if (hostEnd === -1) {
+            hostEnd = rest.length;
+          }
+          if (rest[hostEnd - 1] === ":") {
+            hostEnd--;
+          }
+          var host = rest.slice(0, hostEnd);
+          rest = rest.slice(hostEnd);
+          this.parseHost(host);
+          this.hostname = this.hostname || "";
+          var ipv6Hostname =
+            this.hostname[0] === "[" &&
+            this.hostname[this.hostname.length - 1] === "]";
+          if (!ipv6Hostname) {
+            var hostparts = this.hostname.split(/\./);
+            for (i = 0, l2 = hostparts.length; i < l2; i++) {
+              var part2 = hostparts[i];
+              if (!part2) {
+                continue;
+              }
+              if (!part2.match(hostnamePartPattern)) {
+                var newpart = "";
+                for (var j = 0, k = part2.length; j < k; j++) {
+                  if (part2.charCodeAt(j) > 127) {
+                    newpart += "x";
+                  } else {
+                    newpart += part2[j];
+                  }
+                }
+                if (!newpart.match(hostnamePartPattern)) {
+                  var validParts = hostparts.slice(0, i);
+                  var notHost = hostparts.slice(i + 1);
+                  var bit = part2.match(hostnamePartStart);
+                  if (bit) {
+                    validParts.push(bit[1]);
+                    notHost.unshift(bit[2]);
+                  }
+                  if (notHost.length) {
+                    rest = notHost.join(".") + rest;
+                  }
+                  this.hostname = validParts.join(".");
+                  break;
+                }
+              }
+            }
+          }
+          if (this.hostname.length > hostnameMaxLen) {
+            this.hostname = "";
+          }
+          if (ipv6Hostname) {
+            this.hostname = this.hostname.substr(1, this.hostname.length - 2);
+          }
+        }
+        var hash = rest.indexOf("#");
+        if (hash !== -1) {
+          this.hash = rest.substr(hash);
+          rest = rest.slice(0, hash);
+        }
+        var qm = rest.indexOf("?");
+        if (qm !== -1) {
+          this.search = rest.substr(qm);
+          rest = rest.slice(0, qm);
+        }
+        if (rest) {
+          this.pathname = rest;
+        }
+        if (slashedProtocol[lowerProto] && this.hostname && !this.pathname) {
+          this.pathname = "";
+        }
+        return this;
+      };
+      Url.prototype.parseHost = function (host) {
+        var port = portPattern.exec(host);
+        if (port) {
+          port = port[0];
+          if (port !== ":") {
+            this.port = port.substr(1);
+          }
+          host = host.substr(0, host.length - port.length);
+        }
+        if (host) {
+          this.hostname = host;
+        }
+      };
+      var parse = urlParse;
+      mdurl$1.encode = encode_1;
+      mdurl$1.decode = decode_1;
+      mdurl$1.format = format;
+      mdurl$1.parse = parse;
+      var uc_micro = {};
+      var regex$3 =
+        /[\0-\uD7FF\uE000-\uFFFF]|[\uD800-\uDBFF][\uDC00-\uDFFF]|[\uD800-\uDBFF](?![\uDC00-\uDFFF])|(?:[^\uD800-\uDBFF]|^)[\uDC00-\uDFFF]/;
+      var regex$2 = /[\0-\x1F\x7F-\x9F]/;
+      var regex$1 =
+        /[\xAD\u0600-\u0605\u061C\u06DD\u070F\u08E2\u180E\u200B-\u200F\u202A-\u202E\u2060-\u2064\u2066-\u206F\uFEFF\uFFF9-\uFFFB]|\uD804[\uDCBD\uDCCD]|\uD82F[\uDCA0-\uDCA3]|\uD834[\uDD73-\uDD7A]|\uDB40[\uDC01\uDC20-\uDC7F]/;
+      var regex = /[ \xA0\u1680\u2000-\u200A\u2028\u2029\u202F\u205F\u3000]/;
+      uc_micro.Any = regex$3;
+      uc_micro.Cc = regex$2;
+      uc_micro.Cf = regex$1;
+      uc_micro.P = regex$4;
+      uc_micro.Z = regex;
+      (function (exports) {
+        function _class2(obj) {
+          return Object.prototype.toString.call(obj);
+        }
+        function isString2(obj) {
+          return _class2(obj) === "[object String]";
+        }
+        var _hasOwnProperty = Object.prototype.hasOwnProperty;
+        function has2(object, key) {
+          return _hasOwnProperty.call(object, key);
+        }
+        function assign2(obj) {
+          var sources = Array.prototype.slice.call(arguments, 1);
+          sources.forEach(function (source) {
+            if (!source) {
+              return;
+            }
+            if (typeof source !== "object") {
+              throw new TypeError(source + "must be object");
+            }
+            Object.keys(source).forEach(function (key) {
+              obj[key] = source[key];
+            });
+          });
+          return obj;
+        }
+        function arrayReplaceAt2(src, pos, newElements) {
+          return [].concat(src.slice(0, pos), newElements, src.slice(pos + 1));
+        }
+        function isValidEntityCode2(c) {
+          if (c >= 55296 && c <= 57343) {
+            return false;
+          }
+          if (c >= 64976 && c <= 65007) {
+            return false;
+          }
+          if ((c & 65535) === 65535 || (c & 65535) === 65534) {
+            return false;
+          }
+          if (c >= 0 && c <= 8) {
+            return false;
+          }
+          if (c === 11) {
+            return false;
+          }
+          if (c >= 14 && c <= 31) {
+            return false;
+          }
+          if (c >= 127 && c <= 159) {
+            return false;
+          }
+          if (c > 1114111) {
+            return false;
+          }
+          return true;
+        }
+        function fromCodePoint2(c) {
+          if (c > 65535) {
+            c -= 65536;
+            var surrogate1 = 55296 + (c >> 10),
+              surrogate2 = 56320 + (c & 1023);
+            return String.fromCharCode(surrogate1, surrogate2);
+          }
+          return String.fromCharCode(c);
+        }
+        var UNESCAPE_MD_RE = /\\([!"#$%&'()*+,\-.\/:;<=>?@[\\\]^_`{|}~])/g;
+        var ENTITY_RE = /&([a-z#][a-z0-9]{1,31});/gi;
+        var UNESCAPE_ALL_RE = new RegExp(
+          UNESCAPE_MD_RE.source + "|" + ENTITY_RE.source,
+          "gi"
+        );
+        var DIGITAL_ENTITY_TEST_RE = /^#((?:x[a-f0-9]{1,8}|[0-9]{1,8}))/i;
+        var entities2 = entities$1;
+        function replaceEntityPattern(match2, name2) {
+          var code3 = 0;
+          if (has2(entities2, name2)) {
+            return entities2[name2];
+          }
+          if (
+            name2.charCodeAt(0) === 35 &&
+            DIGITAL_ENTITY_TEST_RE.test(name2)
+          ) {
+            code3 =
+              name2[1].toLowerCase() === "x"
+                ? parseInt(name2.slice(2), 16)
+                : parseInt(name2.slice(1), 10);
+            if (isValidEntityCode2(code3)) {
+              return fromCodePoint2(code3);
+            }
+          }
+          return match2;
+        }
+        function unescapeMd(str) {
+          if (str.indexOf("\\") < 0) {
+            return str;
+          }
+          return str.replace(UNESCAPE_MD_RE, "$1");
+        }
+        function unescapeAll2(str) {
+          if (str.indexOf("\\") < 0 && str.indexOf("&") < 0) {
+            return str;
+          }
+          return str.replace(
+            UNESCAPE_ALL_RE,
+            function (match2, escaped, entity3) {
+              if (escaped) {
+                return escaped;
+              }
+              return replaceEntityPattern(match2, entity3);
+            }
+          );
+        }
+        var HTML_ESCAPE_TEST_RE = /[&<>"]/;
+        var HTML_ESCAPE_REPLACE_RE = /[&<>"]/g;
+        var HTML_REPLACEMENTS = {
+          "&": "&amp;",
+          "<": "&lt;",
+          ">": "&gt;",
+          '"': "&quot;",
+        };
+        function replaceUnsafeChar(ch2) {
+          return HTML_REPLACEMENTS[ch2];
+        }
+        function escapeHtml2(str) {
+          if (HTML_ESCAPE_TEST_RE.test(str)) {
+            return str.replace(HTML_ESCAPE_REPLACE_RE, replaceUnsafeChar);
+          }
+          return str;
+        }
+        var REGEXP_ESCAPE_RE = /[.?*+^$[\]\\(){}|-]/g;
+        function escapeRE2(str) {
+          return str.replace(REGEXP_ESCAPE_RE, "\\$&");
+        }
+        function isSpace2(code3) {
+          switch (code3) {
+            case 9:
+            case 32:
+              return true;
+          }
+          return false;
+        }
+        function isWhiteSpace2(code3) {
+          if (code3 >= 8192 && code3 <= 8202) {
+            return true;
+          }
+          switch (code3) {
+            case 9:
+            case 10:
+            case 11:
+            case 12:
+            case 13:
+            case 32:
+            case 160:
+            case 5760:
+            case 8239:
+            case 8287:
+            case 12288:
+              return true;
+          }
+          return false;
+        }
+        var UNICODE_PUNCT_RE = regex$4;
+        function isPunctChar2(ch2) {
+          return UNICODE_PUNCT_RE.test(ch2);
+        }
+        function isMdAsciiPunct2(ch2) {
+          switch (ch2) {
+            case 33:
+            case 34:
+            case 35:
+            case 36:
+            case 37:
+            case 38:
+            case 39:
+            case 40:
+            case 41:
+            case 42:
+            case 43:
+            case 44:
+            case 45:
+            case 46:
+            case 47:
+            case 58:
+            case 59:
+            case 60:
+            case 61:
+            case 62:
+            case 63:
+            case 64:
+            case 91:
+            case 92:
+            case 93:
+            case 94:
+            case 95:
+            case 96:
+            case 123:
+            case 124:
+            case 125:
+            case 126:
+              return true;
+            default:
+              return false;
+          }
+        }
+        function normalizeReference2(str) {
+          str = str.trim().replace(/\s+/g, " ");
+          if ("\u1E9E".toLowerCase() === "\u1E7E") {
+            str = str.replace(/ẞ/g, "\xDF");
+          }
+          return str.toLowerCase().toUpperCase();
+        }
+        exports.lib = {};
+        exports.lib.mdurl = mdurl$1;
+        exports.lib.ucmicro = uc_micro;
+        exports.assign = assign2;
+        exports.isString = isString2;
+        exports.has = has2;
+        exports.unescapeMd = unescapeMd;
+        exports.unescapeAll = unescapeAll2;
+        exports.isValidEntityCode = isValidEntityCode2;
+        exports.fromCodePoint = fromCodePoint2;
+        exports.escapeHtml = escapeHtml2;
+        exports.arrayReplaceAt = arrayReplaceAt2;
+        exports.isSpace = isSpace2;
+        exports.isWhiteSpace = isWhiteSpace2;
+        exports.isMdAsciiPunct = isMdAsciiPunct2;
+        exports.isPunctChar = isPunctChar2;
+        exports.escapeRE = escapeRE2;
+        exports.normalizeReference = normalizeReference2;
+      })(utils$1);
+      var helpers$1 = {};
+      var parse_link_label = function parseLinkLabel(
+        state,
+        start2,
+        disableNested
+      ) {
+        var level,
+          found,
+          marker2,
+          prevPos,
+          labelEnd = -1,
+          max = state.posMax,
+          oldPos = state.pos;
+        state.pos = start2 + 1;
+        level = 1;
+        while (state.pos < max) {
+          marker2 = state.src.charCodeAt(state.pos);
+          if (marker2 === 93) {
+            level--;
+            if (level === 0) {
+              found = true;
+              break;
+            }
+          }
+          prevPos = state.pos;
+          state.md.inline.skipToken(state);
+          if (marker2 === 91) {
+            if (prevPos === state.pos - 1) {
+              level++;
+            } else if (disableNested) {
+              state.pos = oldPos;
+              return -1;
+            }
+          }
+        }
+        if (found) {
+          labelEnd = state.pos;
+        }
+        state.pos = oldPos;
+        return labelEnd;
+      };
+      var unescapeAll$2 = utils$1.unescapeAll;
+      var parse_link_destination = function parseLinkDestination(
+        str,
+        pos,
+        max
+      ) {
+        var code3,
+          level,
+          lines = 0,
+          start2 = pos,
+          result2 = {
+            ok: false,
+            pos: 0,
+            lines: 0,
+            str: "",
+          };
+        if (str.charCodeAt(pos) === 60) {
+          pos++;
+          while (pos < max) {
+            code3 = str.charCodeAt(pos);
+            if (code3 === 10) {
+              return result2;
+            }
+            if (code3 === 60) {
+              return result2;
+            }
+            if (code3 === 62) {
+              result2.pos = pos + 1;
+              result2.str = unescapeAll$2(str.slice(start2 + 1, pos));
+              result2.ok = true;
+              return result2;
+            }
+            if (code3 === 92 && pos + 1 < max) {
+              pos += 2;
+              continue;
+            }
+            pos++;
+          }
+          return result2;
+        }
+        level = 0;
+        while (pos < max) {
+          code3 = str.charCodeAt(pos);
+          if (code3 === 32) {
+            break;
+          }
+          if (code3 < 32 || code3 === 127) {
+            break;
+          }
+          if (code3 === 92 && pos + 1 < max) {
+            if (str.charCodeAt(pos + 1) === 32) {
+              break;
+            }
+            pos += 2;
+            continue;
+          }
+          if (code3 === 40) {
+            level++;
+            if (level > 32) {
+              return result2;
+            }
+          }
+          if (code3 === 41) {
+            if (level === 0) {
+              break;
+            }
+            level--;
+          }
+          pos++;
+        }
+        if (start2 === pos) {
+          return result2;
+        }
+        if (level !== 0) {
+          return result2;
+        }
+        result2.str = unescapeAll$2(str.slice(start2, pos));
+        result2.lines = lines;
+        result2.pos = pos;
+        result2.ok = true;
+        return result2;
+      };
+      var unescapeAll$1 = utils$1.unescapeAll;
+      var parse_link_title = function parseLinkTitle(str, pos, max) {
+        var code3,
+          marker2,
+          lines = 0,
+          start2 = pos,
+          result2 = {
+            ok: false,
+            pos: 0,
+            lines: 0,
+            str: "",
+          };
+        if (pos >= max) {
+          return result2;
+        }
+        marker2 = str.charCodeAt(pos);
+        if (marker2 !== 34 && marker2 !== 39 && marker2 !== 40) {
+          return result2;
+        }
+        pos++;
+        if (marker2 === 40) {
+          marker2 = 41;
+        }
+        while (pos < max) {
+          code3 = str.charCodeAt(pos);
+          if (code3 === marker2) {
+            result2.pos = pos + 1;
+            result2.lines = lines;
+            result2.str = unescapeAll$1(str.slice(start2 + 1, pos));
+            result2.ok = true;
+            return result2;
+          } else if (code3 === 40 && marker2 === 41) {
+            return result2;
+          } else if (code3 === 10) {
+            lines++;
+          } else if (code3 === 92 && pos + 1 < max) {
+            pos++;
+            if (str.charCodeAt(pos) === 10) {
+              lines++;
+            }
+          }
+          pos++;
+        }
+        return result2;
+      };
+      helpers$1.parseLinkLabel = parse_link_label;
+      helpers$1.parseLinkDestination = parse_link_destination;
+      helpers$1.parseLinkTitle = parse_link_title;
+      var assign$1 = utils$1.assign;
+      var unescapeAll = utils$1.unescapeAll;
+      var escapeHtml$1 = utils$1.escapeHtml;
+      var default_rules = {};
+      default_rules.code_inline = function (tokens, idx, options, env, slf) {
+        var token2 = tokens[idx];
+        return (
+          "<code" +
+          slf.renderAttrs(token2) +
+          ">" +
+          escapeHtml$1(tokens[idx].content) +
+          "</code>"
+        );
+      };
+      default_rules.code_block = function (tokens, idx, options, env, slf) {
+        var token2 = tokens[idx];
+        return (
+          "<pre" +
+          slf.renderAttrs(token2) +
+          "><code>" +
+          escapeHtml$1(tokens[idx].content) +
+          "</code></pre>\n"
+        );
+      };
+      default_rules.fence = function (tokens, idx, options, env, slf) {
+        var token2 = tokens[idx],
+          info2 = token2.info ? unescapeAll(token2.info).trim() : "",
+          langName = "",
+          langAttrs = "",
+          highlighted,
+          i,
+          arr,
+          tmpAttrs,
+          tmpToken;
+        if (info2) {
+          arr = info2.split(/(\s+)/g);
+          langName = arr[0];
+          langAttrs = arr.slice(2).join("");
+        }
+        if (options.highlight) {
+          highlighted =
+            options.highlight(token2.content, langName, langAttrs) ||
+            escapeHtml$1(token2.content);
+        } else {
+          highlighted = escapeHtml$1(token2.content);
+        }
+        if (highlighted.indexOf("<pre") === 0) {
+          return highlighted + "\n";
+        }
+        if (info2) {
+          i = token2.attrIndex("class");
+          tmpAttrs = token2.attrs ? token2.attrs.slice() : [];
+          if (i < 0) {
+            tmpAttrs.push(["class", options.langPrefix + langName]);
+          } else {
+            tmpAttrs[i] = tmpAttrs[i].slice();
+            tmpAttrs[i][1] += " " + options.langPrefix + langName;
+          }
+          tmpToken = {
+            attrs: tmpAttrs,
+          };
+          return (
+            "<pre><code" +
+            slf.renderAttrs(tmpToken) +
+            ">" +
+            highlighted +
+            "</code></pre>\n"
+          );
+        }
+        return (
+          "<pre><code" +
+          slf.renderAttrs(token2) +
+          ">" +
+          highlighted +
+          "</code></pre>\n"
+        );
+      };
+      default_rules.image = function (tokens, idx, options, env, slf) {
+        var token2 = tokens[idx];
+        token2.attrs[token2.attrIndex("alt")][1] = slf.renderInlineAsText(
+          token2.children,
+          options,
+          env
+        );
+        return slf.renderToken(tokens, idx, options);
+      };
+      default_rules.hardbreak = function (tokens, idx, options) {
+        return options.xhtmlOut ? "<br />\n" : "<br>\n";
+      };
+      default_rules.softbreak = function (tokens, idx, options) {
+        return options.breaks
+          ? options.xhtmlOut
+            ? "<br />\n"
+            : "<br>\n"
+          : "\n";
+      };
+      default_rules.text = function (tokens, idx) {
+        return escapeHtml$1(tokens[idx].content);
+      };
+      default_rules.html_block = function (tokens, idx) {
+        return tokens[idx].content;
+      };
+      default_rules.html_inline = function (tokens, idx) {
+        return tokens[idx].content;
+      };
+      function Renderer$1() {
+        this.rules = assign$1({}, default_rules);
+      }
+      Renderer$1.prototype.renderAttrs = function renderAttrs(token2) {
+        var i, l2, result2;
+        if (!token2.attrs) {
+          return "";
+        }
+        result2 = "";
+        for (i = 0, l2 = token2.attrs.length; i < l2; i++) {
+          result2 +=
+            " " +
+            escapeHtml$1(token2.attrs[i][0]) +
+            '="' +
+            escapeHtml$1(token2.attrs[i][1]) +
+            '"';
+        }
+        return result2;
+      };
+      Renderer$1.prototype.renderToken = function renderToken(
+        tokens,
+        idx,
+        options
+      ) {
+        var nextToken,
+          result2 = "",
+          needLf = false,
+          token2 = tokens[idx];
+        if (token2.hidden) {
+          return "";
+        }
+        if (
+          token2.block &&
+          token2.nesting !== -1 &&
+          idx &&
+          tokens[idx - 1].hidden
+        ) {
+          result2 += "\n";
+        }
+        result2 += (token2.nesting === -1 ? "</" : "<") + token2.tag;
+        result2 += this.renderAttrs(token2);
+        if (token2.nesting === 0 && options.xhtmlOut) {
+          result2 += " /";
+        }
+        if (token2.block) {
+          needLf = true;
+          if (token2.nesting === 1) {
+            if (idx + 1 < tokens.length) {
+              nextToken = tokens[idx + 1];
+              if (nextToken.type === "inline" || nextToken.hidden) {
+                needLf = false;
+              } else if (
+                nextToken.nesting === -1 &&
+                nextToken.tag === token2.tag
+              ) {
+                needLf = false;
+              }
+            }
+          }
+        }
+        result2 += needLf ? ">\n" : ">";
+        return result2;
+      };
+      Renderer$1.prototype.renderInline = function (tokens, options, env) {
+        var type2,
+          result2 = "",
+          rules = this.rules;
+        for (var i = 0, len = tokens.length; i < len; i++) {
+          type2 = tokens[i].type;
+          if (typeof rules[type2] !== "undefined") {
+            result2 += rules[type2](tokens, i, options, env, this);
+          } else {
+            result2 += this.renderToken(tokens, i, options);
+          }
+        }
+        return result2;
+      };
+      Renderer$1.prototype.renderInlineAsText = function (
+        tokens,
+        options,
+        env
+      ) {
+        var result2 = "";
+        for (var i = 0, len = tokens.length; i < len; i++) {
+          if (tokens[i].type === "text") {
+            result2 += tokens[i].content;
+          } else if (tokens[i].type === "image") {
+            result2 += this.renderInlineAsText(
+              tokens[i].children,
+              options,
+              env
+            );
+          } else if (tokens[i].type === "softbreak") {
+            result2 += "\n";
+          }
+        }
+        return result2;
+      };
+      Renderer$1.prototype.render = function (tokens, options, env) {
+        var i,
+          len,
+          type2,
+          result2 = "",
+          rules = this.rules;
+        for (i = 0, len = tokens.length; i < len; i++) {
+          type2 = tokens[i].type;
+          if (type2 === "inline") {
+            result2 += this.renderInline(tokens[i].children, options, env);
+          } else if (typeof rules[type2] !== "undefined") {
+            result2 += rules[tokens[i].type](tokens, i, options, env, this);
+          } else {
+            result2 += this.renderToken(tokens, i, options, env);
+          }
+        }
+        return result2;
+      };
+      var renderer = Renderer$1;
+      function Ruler$3() {
+        this.__rules__ = [];
+        this.__cache__ = null;
+      }
+      Ruler$3.prototype.__find__ = function (name2) {
+        for (var i = 0; i < this.__rules__.length; i++) {
+          if (this.__rules__[i].name === name2) {
+            return i;
+          }
+        }
+        return -1;
+      };
+      Ruler$3.prototype.__compile__ = function () {
+        var self2 = this;
+        var chains = [""];
+        self2.__rules__.forEach(function (rule) {
+          if (!rule.enabled) {
+            return;
+          }
+          rule.alt.forEach(function (altName) {
+            if (chains.indexOf(altName) < 0) {
+              chains.push(altName);
+            }
+          });
+        });
+        self2.__cache__ = {};
+        chains.forEach(function (chain) {
+          self2.__cache__[chain] = [];
+          self2.__rules__.forEach(function (rule) {
+            if (!rule.enabled) {
+              return;
+            }
+            if (chain && rule.alt.indexOf(chain) < 0) {
+              return;
+            }
+            self2.__cache__[chain].push(rule.fn);
+          });
+        });
+      };
+      Ruler$3.prototype.at = function (name2, fn, options) {
+        var index = this.__find__(name2);
+        var opt2 = options || {};
+        if (index === -1) {
+          throw new Error("Parser rule not found: " + name2);
+        }
+        this.__rules__[index].fn = fn;
+        this.__rules__[index].alt = opt2.alt || [];
+        this.__cache__ = null;
+      };
+      Ruler$3.prototype.before = function (beforeName, ruleName, fn, options) {
+        var index = this.__find__(beforeName);
+        var opt2 = options || {};
+        if (index === -1) {
+          throw new Error("Parser rule not found: " + beforeName);
+        }
+        this.__rules__.splice(index, 0, {
+          name: ruleName,
+          enabled: true,
+          fn,
+          alt: opt2.alt || [],
+        });
+        this.__cache__ = null;
+      };
+      Ruler$3.prototype.after = function (afterName, ruleName, fn, options) {
+        var index = this.__find__(afterName);
+        var opt2 = options || {};
+        if (index === -1) {
+          throw new Error("Parser rule not found: " + afterName);
+        }
+        this.__rules__.splice(index + 1, 0, {
+          name: ruleName,
+          enabled: true,
+          fn,
+          alt: opt2.alt || [],
+        });
+        this.__cache__ = null;
+      };
+      Ruler$3.prototype.push = function (ruleName, fn, options) {
+        var opt2 = options || {};
+        this.__rules__.push({
+          name: ruleName,
+          enabled: true,
+          fn,
+          alt: opt2.alt || [],
+        });
+        this.__cache__ = null;
+      };
+      Ruler$3.prototype.enable = function (list3, ignoreInvalid) {
+        if (!Array.isArray(list3)) {
+          list3 = [list3];
+        }
+        var result2 = [];
+        list3.forEach(function (name2) {
+          var idx = this.__find__(name2);
+          if (idx < 0) {
+            if (ignoreInvalid) {
+              return;
+            }
+            throw new Error("Rules manager: invalid rule name " + name2);
+          }
+          this.__rules__[idx].enabled = true;
+          result2.push(name2);
+        }, this);
+        this.__cache__ = null;
+        return result2;
+      };
+      Ruler$3.prototype.enableOnly = function (list3, ignoreInvalid) {
+        if (!Array.isArray(list3)) {
+          list3 = [list3];
+        }
+        this.__rules__.forEach(function (rule) {
+          rule.enabled = false;
+        });
+        this.enable(list3, ignoreInvalid);
+      };
+      Ruler$3.prototype.disable = function (list3, ignoreInvalid) {
+        if (!Array.isArray(list3)) {
+          list3 = [list3];
+        }
+        var result2 = [];
+        list3.forEach(function (name2) {
+          var idx = this.__find__(name2);
+          if (idx < 0) {
+            if (ignoreInvalid) {
+              return;
+            }
+            throw new Error("Rules manager: invalid rule name " + name2);
+          }
+          this.__rules__[idx].enabled = false;
+          result2.push(name2);
+        }, this);
+        this.__cache__ = null;
+        return result2;
+      };
+      Ruler$3.prototype.getRules = function (chainName) {
+        if (this.__cache__ === null) {
+          this.__compile__();
+        }
+        return this.__cache__[chainName] || [];
+      };
+      var ruler = Ruler$3;
+      var NEWLINES_RE = /\r\n?|\n/g;
+      var NULL_RE = /\0/g;
+      var normalize = function normalize2(state) {
+        var str;
+        str = state.src.replace(NEWLINES_RE, "\n");
+        str = str.replace(NULL_RE, "\uFFFD");
+        state.src = str;
+      };
+      var block$1 = function block(state) {
+        var token2;
+        if (state.inlineMode) {
+          token2 = new state.Token("inline", "", 0);
+          token2.content = state.src;
+          token2.map = [0, 1];
+          token2.children = [];
+          state.tokens.push(token2);
+        } else {
+          state.md.block.parse(state.src, state.md, state.env, state.tokens);
+        }
+      };
+      var inline = function inline2(state) {
+        var tokens = state.tokens,
+          tok,
+          i,
+          l2;
+        for (i = 0, l2 = tokens.length; i < l2; i++) {
+          tok = tokens[i];
+          if (tok.type === "inline") {
+            state.md.inline.parse(
+              tok.content,
+              state.md,
+              state.env,
+              tok.children
+            );
+          }
+        }
+      };
+      var arrayReplaceAt = utils$1.arrayReplaceAt;
+      function isLinkOpen(str) {
+        return /^<a[>\s]/i.test(str);
+      }
+      function isLinkClose(str) {
+        return /^<\/a\s*>/i.test(str);
+      }
+      var linkify = function linkify2(state) {
+        var i,
+          j,
+          l2,
+          tokens,
+          token2,
+          currentToken,
+          nodes,
+          ln,
+          text3,
+          pos,
+          lastPos,
+          level,
+          htmlLinkLevel,
+          url,
+          fullUrl,
+          urlText,
+          blockTokens = state.tokens,
+          links;
+        if (!state.md.options.linkify) {
+          return;
+        }
+        for (j = 0, l2 = blockTokens.length; j < l2; j++) {
+          if (
+            blockTokens[j].type !== "inline" ||
+            !state.md.linkify.pretest(blockTokens[j].content)
+          ) {
+            continue;
+          }
+          tokens = blockTokens[j].children;
+          htmlLinkLevel = 0;
+          for (i = tokens.length - 1; i >= 0; i--) {
+            currentToken = tokens[i];
+            if (currentToken.type === "link_close") {
+              i--;
+              while (
+                tokens[i].level !== currentToken.level &&
+                tokens[i].type !== "link_open"
+              ) {
+                i--;
+              }
+              continue;
+            }
+            if (currentToken.type === "html_inline") {
+              if (isLinkOpen(currentToken.content) && htmlLinkLevel > 0) {
+                htmlLinkLevel--;
+              }
+              if (isLinkClose(currentToken.content)) {
+                htmlLinkLevel++;
+              }
+            }
+            if (htmlLinkLevel > 0) {
+              continue;
+            }
+            if (
+              currentToken.type === "text" &&
+              state.md.linkify.test(currentToken.content)
+            ) {
+              text3 = currentToken.content;
+              links = state.md.linkify.match(text3);
+              nodes = [];
+              level = currentToken.level;
+              lastPos = 0;
+              for (ln = 0; ln < links.length; ln++) {
+                url = links[ln].url;
+                fullUrl = state.md.normalizeLink(url);
+                if (!state.md.validateLink(fullUrl)) {
+                  continue;
+                }
+                urlText = links[ln].text;
+                if (!links[ln].schema) {
+                  urlText = state.md
+                    .normalizeLinkText("http://" + urlText)
+                    .replace(/^http:\/\//, "");
+                } else if (
+                  links[ln].schema === "mailto:" &&
+                  !/^mailto:/i.test(urlText)
+                ) {
+                  urlText = state.md
+                    .normalizeLinkText("mailto:" + urlText)
+                    .replace(/^mailto:/, "");
+                } else {
+                  urlText = state.md.normalizeLinkText(urlText);
+                }
+                pos = links[ln].index;
+                if (pos > lastPos) {
+                  token2 = new state.Token("text", "", 0);
+                  token2.content = text3.slice(lastPos, pos);
+                  token2.level = level;
+                  nodes.push(token2);
+                }
+                token2 = new state.Token("link_open", "a", 1);
+                token2.attrs = [["href", fullUrl]];
+                token2.level = level++;
+                token2.markup = "linkify";
+                token2.info = "auto";
+                nodes.push(token2);
+                token2 = new state.Token("text", "", 0);
+                token2.content = urlText;
+                token2.level = level;
+                nodes.push(token2);
+                token2 = new state.Token("link_close", "a", -1);
+                token2.level = --level;
+                token2.markup = "linkify";
+                token2.info = "auto";
+                nodes.push(token2);
+                lastPos = links[ln].lastIndex;
+              }
+              if (lastPos < text3.length) {
+                token2 = new state.Token("text", "", 0);
+                token2.content = text3.slice(lastPos);
+                token2.level = level;
+                nodes.push(token2);
+              }
+              blockTokens[j].children = tokens = arrayReplaceAt(
+                tokens,
+                i,
+                nodes
+              );
+            }
+          }
+        }
+      };
+      var RARE_RE = /\+-|\.\.|\?\?\?\?|!!!!|,,|--/;
+      var SCOPED_ABBR_TEST_RE = /\((c|tm|r|p)\)/i;
+      var SCOPED_ABBR_RE = /\((c|tm|r|p)\)/gi;
+      var SCOPED_ABBR = {
+        c: "\xA9",
+        r: "\xAE",
+        p: "\xA7",
+        tm: "\u2122",
+      };
+      function replaceFn(match2, name2) {
+        return SCOPED_ABBR[name2.toLowerCase()];
+      }
+      function replace_scoped(inlineTokens) {
+        var i,
+          token2,
+          inside_autolink = 0;
+        for (i = inlineTokens.length - 1; i >= 0; i--) {
+          token2 = inlineTokens[i];
+          if (token2.type === "text" && !inside_autolink) {
+            token2.content = token2.content.replace(SCOPED_ABBR_RE, replaceFn);
+          }
+          if (token2.type === "link_open" && token2.info === "auto") {
+            inside_autolink--;
+          }
+          if (token2.type === "link_close" && token2.info === "auto") {
+            inside_autolink++;
+          }
+        }
+      }
+      function replace_rare(inlineTokens) {
+        var i,
+          token2,
+          inside_autolink = 0;
+        for (i = inlineTokens.length - 1; i >= 0; i--) {
+          token2 = inlineTokens[i];
+          if (token2.type === "text" && !inside_autolink) {
+            if (RARE_RE.test(token2.content)) {
+              token2.content = token2.content
+                .replace(/\+-/g, "\xB1")
+                .replace(/\.{2,}/g, "\u2026")
+                .replace(/([?!])…/g, "$1..")
+                .replace(/([?!]){4,}/g, "$1$1$1")
+                .replace(/,{2,}/g, ",")
+                .replace(/(^|[^-])---(?=[^-]|$)/gm, "$1\u2014")
+                .replace(/(^|\s)--(?=\s|$)/gm, "$1\u2013")
+                .replace(/(^|[^-\s])--(?=[^-\s]|$)/gm, "$1\u2013");
+            }
+          }
+          if (token2.type === "link_open" && token2.info === "auto") {
+            inside_autolink--;
+          }
+          if (token2.type === "link_close" && token2.info === "auto") {
+            inside_autolink++;
+          }
+        }
+      }
+      var replacements = function replace(state) {
+        var blkIdx;
+        if (!state.md.options.typographer) {
+          return;
+        }
+        for (blkIdx = state.tokens.length - 1; blkIdx >= 0; blkIdx--) {
+          if (state.tokens[blkIdx].type !== "inline") {
+            continue;
+          }
+          if (SCOPED_ABBR_TEST_RE.test(state.tokens[blkIdx].content)) {
+            replace_scoped(state.tokens[blkIdx].children);
+          }
+          if (RARE_RE.test(state.tokens[blkIdx].content)) {
+            replace_rare(state.tokens[blkIdx].children);
+          }
+        }
+      };
+      var isWhiteSpace$1 = utils$1.isWhiteSpace;
+      var isPunctChar$1 = utils$1.isPunctChar;
+      var isMdAsciiPunct$1 = utils$1.isMdAsciiPunct;
+      var QUOTE_TEST_RE = /['"]/;
+      var QUOTE_RE = /['"]/g;
+      var APOSTROPHE = "\u2019";
+      function replaceAt(str, index, ch2) {
+        return str.substr(0, index) + ch2 + str.substr(index + 1);
+      }
+      function process_inlines(tokens, state) {
+        var i,
+          token2,
+          text3,
+          t2,
+          pos,
+          max,
+          thisLevel,
+          item,
+          lastChar,
+          nextChar,
+          isLastPunctChar,
+          isNextPunctChar,
+          isLastWhiteSpace,
+          isNextWhiteSpace,
+          canOpen,
+          canClose,
+          j,
+          isSingle,
+          stack,
+          openQuote,
+          closeQuote;
+        stack = [];
+        for (i = 0; i < tokens.length; i++) {
+          token2 = tokens[i];
+          thisLevel = tokens[i].level;
+          for (j = stack.length - 1; j >= 0; j--) {
+            if (stack[j].level <= thisLevel) {
+              break;
+            }
+          }
+          stack.length = j + 1;
+          if (token2.type !== "text") {
+            continue;
+          }
+          text3 = token2.content;
+          pos = 0;
+          max = text3.length;
+          OUTER: while (pos < max) {
+            QUOTE_RE.lastIndex = pos;
+            t2 = QUOTE_RE.exec(text3);
+            if (!t2) {
+              break;
+            }
+            canOpen = canClose = true;
+            pos = t2.index + 1;
+            isSingle = t2[0] === "'";
+            lastChar = 32;
+            if (t2.index - 1 >= 0) {
+              lastChar = text3.charCodeAt(t2.index - 1);
+            } else {
+              for (j = i - 1; j >= 0; j--) {
+                if (
+                  tokens[j].type === "softbreak" ||
+                  tokens[j].type === "hardbreak"
+                )
+                  break;
+                if (!tokens[j].content) continue;
+                lastChar = tokens[j].content.charCodeAt(
+                  tokens[j].content.length - 1
+                );
+                break;
+              }
+            }
+            nextChar = 32;
+            if (pos < max) {
+              nextChar = text3.charCodeAt(pos);
+            } else {
+              for (j = i + 1; j < tokens.length; j++) {
+                if (
+                  tokens[j].type === "softbreak" ||
+                  tokens[j].type === "hardbreak"
+                )
+                  break;
+                if (!tokens[j].content) continue;
+                nextChar = tokens[j].content.charCodeAt(0);
+                break;
+              }
+            }
+            isLastPunctChar =
+              isMdAsciiPunct$1(lastChar) ||
+              isPunctChar$1(String.fromCharCode(lastChar));
+            isNextPunctChar =
+              isMdAsciiPunct$1(nextChar) ||
+              isPunctChar$1(String.fromCharCode(nextChar));
+            isLastWhiteSpace = isWhiteSpace$1(lastChar);
+            isNextWhiteSpace = isWhiteSpace$1(nextChar);
+            if (isNextWhiteSpace) {
+              canOpen = false;
+            } else if (isNextPunctChar) {
+              if (!(isLastWhiteSpace || isLastPunctChar)) {
+                canOpen = false;
+              }
+            }
+            if (isLastWhiteSpace) {
+              canClose = false;
+            } else if (isLastPunctChar) {
+              if (!(isNextWhiteSpace || isNextPunctChar)) {
+                canClose = false;
+              }
+            }
+            if (nextChar === 34 && t2[0] === '"') {
+              if (lastChar >= 48 && lastChar <= 57) {
+                canClose = canOpen = false;
+              }
+            }
+            if (canOpen && canClose) {
+              canOpen = isLastPunctChar;
+              canClose = isNextPunctChar;
+            }
+            if (!canOpen && !canClose) {
+              if (isSingle) {
+                token2.content = replaceAt(
+                  token2.content,
+                  t2.index,
+                  APOSTROPHE
+                );
+              }
+              continue;
+            }
+            if (canClose) {
+              for (j = stack.length - 1; j >= 0; j--) {
+                item = stack[j];
+                if (stack[j].level < thisLevel) {
+                  break;
+                }
+                if (item.single === isSingle && stack[j].level === thisLevel) {
+                  item = stack[j];
+                  if (isSingle) {
+                    openQuote = state.md.options.quotes[2];
+                    closeQuote = state.md.options.quotes[3];
+                  } else {
+                    openQuote = state.md.options.quotes[0];
+                    closeQuote = state.md.options.quotes[1];
+                  }
+                  token2.content = replaceAt(
+                    token2.content,
+                    t2.index,
+                    closeQuote
+                  );
+                  tokens[item.token].content = replaceAt(
+                    tokens[item.token].content,
+                    item.pos,
+                    openQuote
+                  );
+                  pos += closeQuote.length - 1;
+                  if (item.token === i) {
+                    pos += openQuote.length - 1;
+                  }
+                  text3 = token2.content;
+                  max = text3.length;
+                  stack.length = j;
+                  continue OUTER;
+                }
+              }
+            }
+            if (canOpen) {
+              stack.push({
+                token: i,
+                pos: t2.index,
+                single: isSingle,
+                level: thisLevel,
+              });
+            } else if (canClose && isSingle) {
+              token2.content = replaceAt(token2.content, t2.index, APOSTROPHE);
+            }
+          }
+        }
+      }
+      var smartquotes = function smartquotes2(state) {
+        var blkIdx;
+        if (!state.md.options.typographer) {
+          return;
+        }
+        for (blkIdx = state.tokens.length - 1; blkIdx >= 0; blkIdx--) {
+          if (
+            state.tokens[blkIdx].type !== "inline" ||
+            !QUOTE_TEST_RE.test(state.tokens[blkIdx].content)
+          ) {
+            continue;
+          }
+          process_inlines(state.tokens[blkIdx].children, state);
+        }
+      };
+      function Token$3(type2, tag, nesting) {
+        this.type = type2;
+        this.tag = tag;
+        this.attrs = null;
+        this.map = null;
+        this.nesting = nesting;
+        this.level = 0;
+        this.children = null;
+        this.content = "";
+        this.markup = "";
+        this.info = "";
+        this.meta = null;
+        this.block = false;
+        this.hidden = false;
+      }
+      Token$3.prototype.attrIndex = function attrIndex(name2) {
+        var attrs, i, len;
+        if (!this.attrs) {
+          return -1;
+        }
+        attrs = this.attrs;
+        for (i = 0, len = attrs.length; i < len; i++) {
+          if (attrs[i][0] === name2) {
+            return i;
+          }
+        }
+        return -1;
+      };
+      Token$3.prototype.attrPush = function attrPush(attrData) {
+        if (this.attrs) {
+          this.attrs.push(attrData);
+        } else {
+          this.attrs = [attrData];
+        }
+      };
+      Token$3.prototype.attrSet = function attrSet(name2, value) {
+        var idx = this.attrIndex(name2),
+          attrData = [name2, value];
+        if (idx < 0) {
+          this.attrPush(attrData);
+        } else {
+          this.attrs[idx] = attrData;
+        }
+      };
+      Token$3.prototype.attrGet = function attrGet(name2) {
+        var idx = this.attrIndex(name2),
+          value = null;
+        if (idx >= 0) {
+          value = this.attrs[idx][1];
+        }
+        return value;
+      };
+      Token$3.prototype.attrJoin = function attrJoin(name2, value) {
+        var idx = this.attrIndex(name2);
+        if (idx < 0) {
+          this.attrPush([name2, value]);
+        } else {
+          this.attrs[idx][1] = this.attrs[idx][1] + " " + value;
+        }
+      };
+      var token = Token$3;
+      var Token$2 = token;
+      function StateCore(src, md2, env) {
+        this.src = src;
+        this.env = env;
+        this.tokens = [];
+        this.inlineMode = false;
+        this.md = md2;
+      }
+      StateCore.prototype.Token = Token$2;
+      var state_core = StateCore;
+      var Ruler$2 = ruler;
+      var _rules$2 = [
+        ["normalize", normalize],
+        ["block", block$1],
+        ["inline", inline],
+        ["linkify", linkify],
+        ["replacements", replacements],
+        ["smartquotes", smartquotes],
+      ];
+      function Core() {
+        this.ruler = new Ruler$2();
+        for (var i = 0; i < _rules$2.length; i++) {
+          this.ruler.push(_rules$2[i][0], _rules$2[i][1]);
+        }
+      }
+      Core.prototype.process = function (state) {
+        var i, l2, rules;
+        rules = this.ruler.getRules("");
+        for (i = 0, l2 = rules.length; i < l2; i++) {
+          rules[i](state);
+        }
+      };
+      Core.prototype.State = state_core;
+      var parser_core = Core;
+      var isSpace$a = utils$1.isSpace;
+      function getLine(state, line) {
+        var pos = state.bMarks[line] + state.tShift[line],
+          max = state.eMarks[line];
+        return state.src.substr(pos, max - pos);
+      }
+      function escapedSplit(str) {
+        var result2 = [],
+          pos = 0,
+          max = str.length,
+          ch2,
+          isEscaped = false,
+          lastPos = 0,
+          current = "";
+        ch2 = str.charCodeAt(pos);
+        while (pos < max) {
+          if (ch2 === 124) {
+            if (!isEscaped) {
+              result2.push(current + str.substring(lastPos, pos));
+              current = "";
+              lastPos = pos + 1;
+            } else {
+              current += str.substring(lastPos, pos - 1);
+              lastPos = pos;
+            }
+          }
+          isEscaped = ch2 === 92;
+          pos++;
+          ch2 = str.charCodeAt(pos);
+        }
+        result2.push(current + str.substring(lastPos));
+        return result2;
+      }
+      var table = function table2(state, startLine, endLine, silent) {
+        var ch2,
+          lineText,
+          pos,
+          i,
+          l2,
+          nextLine,
+          columns,
+          columnCount,
+          token2,
+          aligns,
+          t2,
+          tableLines,
+          tbodyLines,
+          oldParentType,
+          terminate,
+          terminatorRules,
+          firstCh,
+          secondCh;
+        if (startLine + 2 > endLine) {
+          return false;
+        }
+        nextLine = startLine + 1;
+        if (state.sCount[nextLine] < state.blkIndent) {
+          return false;
+        }
+        if (state.sCount[nextLine] - state.blkIndent >= 4) {
+          return false;
+        }
+        pos = state.bMarks[nextLine] + state.tShift[nextLine];
+        if (pos >= state.eMarks[nextLine]) {
+          return false;
+        }
+        firstCh = state.src.charCodeAt(pos++);
+        if (firstCh !== 124 && firstCh !== 45 && firstCh !== 58) {
+          return false;
+        }
+        if (pos >= state.eMarks[nextLine]) {
+          return false;
+        }
+        secondCh = state.src.charCodeAt(pos++);
+        if (
+          secondCh !== 124 &&
+          secondCh !== 45 &&
+          secondCh !== 58 &&
+          !isSpace$a(secondCh)
+        ) {
+          return false;
+        }
+        if (firstCh === 45 && isSpace$a(secondCh)) {
+          return false;
+        }
+        while (pos < state.eMarks[nextLine]) {
+          ch2 = state.src.charCodeAt(pos);
+          if (ch2 !== 124 && ch2 !== 45 && ch2 !== 58 && !isSpace$a(ch2)) {
+            return false;
+          }
+          pos++;
+        }
+        lineText = getLine(state, startLine + 1);
+        columns = lineText.split("|");
+        aligns = [];
+        for (i = 0; i < columns.length; i++) {
+          t2 = columns[i].trim();
+          if (!t2) {
+            if (i === 0 || i === columns.length - 1) {
+              continue;
+            } else {
+              return false;
+            }
+          }
+          if (!/^:?-+:?$/.test(t2)) {
+            return false;
+          }
+          if (t2.charCodeAt(t2.length - 1) === 58) {
+            aligns.push(t2.charCodeAt(0) === 58 ? "center" : "right");
+          } else if (t2.charCodeAt(0) === 58) {
+            aligns.push("left");
+          } else {
+            aligns.push("");
+          }
+        }
+        lineText = getLine(state, startLine).trim();
+        if (lineText.indexOf("|") === -1) {
+          return false;
+        }
+        if (state.sCount[startLine] - state.blkIndent >= 4) {
+          return false;
+        }
+        columns = escapedSplit(lineText);
+        if (columns.length && columns[0] === "") columns.shift();
+        if (columns.length && columns[columns.length - 1] === "") columns.pop();
+        columnCount = columns.length;
+        if (columnCount === 0 || columnCount !== aligns.length) {
+          return false;
+        }
+        if (silent) {
+          return true;
+        }
+        oldParentType = state.parentType;
+        state.parentType = "table";
+        terminatorRules = state.md.block.ruler.getRules("blockquote");
+        token2 = state.push("table_open", "table", 1);
+        token2.map = tableLines = [startLine, 0];
+        token2 = state.push("thead_open", "thead", 1);
+        token2.map = [startLine, startLine + 1];
+        token2 = state.push("tr_open", "tr", 1);
+        token2.map = [startLine, startLine + 1];
+        for (i = 0; i < columns.length; i++) {
+          token2 = state.push("th_open", "th", 1);
+          if (aligns[i]) {
+            token2.attrs = [["style", "text-align:" + aligns[i]]];
+          }
+          token2 = state.push("inline", "", 0);
+          token2.content = columns[i].trim();
+          token2.children = [];
+          token2 = state.push("th_close", "th", -1);
+        }
+        token2 = state.push("tr_close", "tr", -1);
+        token2 = state.push("thead_close", "thead", -1);
+        for (nextLine = startLine + 2; nextLine < endLine; nextLine++) {
+          if (state.sCount[nextLine] < state.blkIndent) {
+            break;
+          }
+          terminate = false;
+          for (i = 0, l2 = terminatorRules.length; i < l2; i++) {
+            if (terminatorRules[i](state, nextLine, endLine, true)) {
+              terminate = true;
+              break;
+            }
+          }
+          if (terminate) {
+            break;
+          }
+          lineText = getLine(state, nextLine).trim();
+          if (!lineText) {
+            break;
+          }
+          if (state.sCount[nextLine] - state.blkIndent >= 4) {
+            break;
+          }
+          columns = escapedSplit(lineText);
+          if (columns.length && columns[0] === "") columns.shift();
+          if (columns.length && columns[columns.length - 1] === "")
+            columns.pop();
+          if (nextLine === startLine + 2) {
+            token2 = state.push("tbody_open", "tbody", 1);
+            token2.map = tbodyLines = [startLine + 2, 0];
+          }
+          token2 = state.push("tr_open", "tr", 1);
+          token2.map = [nextLine, nextLine + 1];
+          for (i = 0; i < columnCount; i++) {
+            token2 = state.push("td_open", "td", 1);
+            if (aligns[i]) {
+              token2.attrs = [["style", "text-align:" + aligns[i]]];
+            }
+            token2 = state.push("inline", "", 0);
+            token2.content = columns[i] ? columns[i].trim() : "";
+            token2.children = [];
+            token2 = state.push("td_close", "td", -1);
+          }
+          token2 = state.push("tr_close", "tr", -1);
+        }
+        if (tbodyLines) {
+          token2 = state.push("tbody_close", "tbody", -1);
+          tbodyLines[1] = nextLine;
+        }
+        token2 = state.push("table_close", "table", -1);
+        tableLines[1] = nextLine;
+        state.parentType = oldParentType;
+        state.line = nextLine;
+        return true;
+      };
+      var code$2 = function code(state, startLine, endLine) {
+        var nextLine, last, token2;
+        if (state.sCount[startLine] - state.blkIndent < 4) {
+          return false;
+        }
+        last = nextLine = startLine + 1;
+        while (nextLine < endLine) {
+          if (state.isEmpty(nextLine)) {
+            nextLine++;
+            continue;
+          }
+          if (state.sCount[nextLine] - state.blkIndent >= 4) {
+            nextLine++;
+            last = nextLine;
+            continue;
+          }
+          break;
+        }
+        state.line = last;
+        token2 = state.push("code_block", "code", 0);
+        token2.content =
+          state.getLines(startLine, last, 4 + state.blkIndent, false) + "\n";
+        token2.map = [startLine, state.line];
+        return true;
+      };
+      var fence = function fence2(state, startLine, endLine, silent) {
+        var marker2,
+          len,
+          params,
+          nextLine,
+          mem,
+          token2,
+          markup,
+          haveEndMarker = false,
+          pos = state.bMarks[startLine] + state.tShift[startLine],
+          max = state.eMarks[startLine];
+        if (state.sCount[startLine] - state.blkIndent >= 4) {
+          return false;
+        }
+        if (pos + 3 > max) {
+          return false;
+        }
+        marker2 = state.src.charCodeAt(pos);
+        if (marker2 !== 126 && marker2 !== 96) {
+          return false;
+        }
+        mem = pos;
+        pos = state.skipChars(pos, marker2);
+        len = pos - mem;
+        if (len < 3) {
+          return false;
+        }
+        markup = state.src.slice(mem, pos);
+        params = state.src.slice(pos, max);
+        if (marker2 === 96) {
+          if (params.indexOf(String.fromCharCode(marker2)) >= 0) {
+            return false;
+          }
+        }
+        if (silent) {
+          return true;
+        }
+        nextLine = startLine;
+        for (;;) {
+          nextLine++;
+          if (nextLine >= endLine) {
+            break;
+          }
+          pos = mem = state.bMarks[nextLine] + state.tShift[nextLine];
+          max = state.eMarks[nextLine];
+          if (pos < max && state.sCount[nextLine] < state.blkIndent) {
+            break;
+          }
+          if (state.src.charCodeAt(pos) !== marker2) {
+            continue;
+          }
+          if (state.sCount[nextLine] - state.blkIndent >= 4) {
+            continue;
+          }
+          pos = state.skipChars(pos, marker2);
+          if (pos - mem < len) {
+            continue;
+          }
+          pos = state.skipSpaces(pos);
+          if (pos < max) {
+            continue;
+          }
+          haveEndMarker = true;
+          break;
+        }
+        len = state.sCount[startLine];
+        state.line = nextLine + (haveEndMarker ? 1 : 0);
+        token2 = state.push("fence", "code", 0);
+        token2.info = params;
+        token2.content = state.getLines(startLine + 1, nextLine, len, true);
+        token2.markup = markup;
+        token2.map = [startLine, state.line];
+        return true;
+      };
+      var isSpace$9 = utils$1.isSpace;
+      var blockquote = function blockquote2(state, startLine, endLine, silent) {
+        var adjustTab,
+          ch2,
+          i,
+          initial,
+          l2,
+          lastLineEmpty,
+          lines,
+          nextLine,
+          offset,
+          oldBMarks,
+          oldBSCount,
+          oldIndent,
+          oldParentType,
+          oldSCount,
+          oldTShift,
+          spaceAfterMarker,
+          terminate,
+          terminatorRules,
+          token2,
+          isOutdented,
+          oldLineMax = state.lineMax,
+          pos = state.bMarks[startLine] + state.tShift[startLine],
+          max = state.eMarks[startLine];
+        if (state.sCount[startLine] - state.blkIndent >= 4) {
+          return false;
+        }
+        if (state.src.charCodeAt(pos++) !== 62) {
+          return false;
+        }
+        if (silent) {
+          return true;
+        }
+        initial = offset = state.sCount[startLine] + 1;
+        if (state.src.charCodeAt(pos) === 32) {
+          pos++;
+          initial++;
+          offset++;
+          adjustTab = false;
+          spaceAfterMarker = true;
+        } else if (state.src.charCodeAt(pos) === 9) {
+          spaceAfterMarker = true;
+          if ((state.bsCount[startLine] + offset) % 4 === 3) {
+            pos++;
+            initial++;
+            offset++;
+            adjustTab = false;
+          } else {
+            adjustTab = true;
+          }
+        } else {
+          spaceAfterMarker = false;
+        }
+        oldBMarks = [state.bMarks[startLine]];
+        state.bMarks[startLine] = pos;
+        while (pos < max) {
+          ch2 = state.src.charCodeAt(pos);
+          if (isSpace$9(ch2)) {
+            if (ch2 === 9) {
+              offset +=
+                4 -
+                ((offset + state.bsCount[startLine] + (adjustTab ? 1 : 0)) % 4);
+            } else {
+              offset++;
+            }
+          } else {
+            break;
+          }
+          pos++;
+        }
+        oldBSCount = [state.bsCount[startLine]];
+        state.bsCount[startLine] =
+          state.sCount[startLine] + 1 + (spaceAfterMarker ? 1 : 0);
+        lastLineEmpty = pos >= max;
+        oldSCount = [state.sCount[startLine]];
+        state.sCount[startLine] = offset - initial;
+        oldTShift = [state.tShift[startLine]];
+        state.tShift[startLine] = pos - state.bMarks[startLine];
+        terminatorRules = state.md.block.ruler.getRules("blockquote");
+        oldParentType = state.parentType;
+        state.parentType = "blockquote";
+        for (nextLine = startLine + 1; nextLine < endLine; nextLine++) {
+          isOutdented = state.sCount[nextLine] < state.blkIndent;
+          pos = state.bMarks[nextLine] + state.tShift[nextLine];
+          max = state.eMarks[nextLine];
+          if (pos >= max) {
+            break;
+          }
+          if (state.src.charCodeAt(pos++) === 62 && !isOutdented) {
+            initial = offset = state.sCount[nextLine] + 1;
+            if (state.src.charCodeAt(pos) === 32) {
+              pos++;
+              initial++;
+              offset++;
+              adjustTab = false;
+              spaceAfterMarker = true;
+            } else if (state.src.charCodeAt(pos) === 9) {
+              spaceAfterMarker = true;
+              if ((state.bsCount[nextLine] + offset) % 4 === 3) {
+                pos++;
+                initial++;
+                offset++;
+                adjustTab = false;
+              } else {
+                adjustTab = true;
+              }
+            } else {
+              spaceAfterMarker = false;
+            }
+            oldBMarks.push(state.bMarks[nextLine]);
+            state.bMarks[nextLine] = pos;
+            while (pos < max) {
+              ch2 = state.src.charCodeAt(pos);
+              if (isSpace$9(ch2)) {
+                if (ch2 === 9) {
+                  offset +=
+                    4 -
+                    ((offset + state.bsCount[nextLine] + (adjustTab ? 1 : 0)) %
+                      4);
+                } else {
+                  offset++;
+                }
+              } else {
+                break;
+              }
+              pos++;
+            }
+            lastLineEmpty = pos >= max;
+            oldBSCount.push(state.bsCount[nextLine]);
+            state.bsCount[nextLine] =
+              state.sCount[nextLine] + 1 + (spaceAfterMarker ? 1 : 0);
+            oldSCount.push(state.sCount[nextLine]);
+            state.sCount[nextLine] = offset - initial;
+            oldTShift.push(state.tShift[nextLine]);
+            state.tShift[nextLine] = pos - state.bMarks[nextLine];
+            continue;
+          }
+          if (lastLineEmpty) {
+            break;
+          }
+          terminate = false;
+          for (i = 0, l2 = terminatorRules.length; i < l2; i++) {
+            if (terminatorRules[i](state, nextLine, endLine, true)) {
+              terminate = true;
+              break;
+            }
+          }
+          if (terminate) {
+            state.lineMax = nextLine;
+            if (state.blkIndent !== 0) {
+              oldBMarks.push(state.bMarks[nextLine]);
+              oldBSCount.push(state.bsCount[nextLine]);
+              oldTShift.push(state.tShift[nextLine]);
+              oldSCount.push(state.sCount[nextLine]);
+              state.sCount[nextLine] -= state.blkIndent;
+            }
+            break;
+          }
+          oldBMarks.push(state.bMarks[nextLine]);
+          oldBSCount.push(state.bsCount[nextLine]);
+          oldTShift.push(state.tShift[nextLine]);
+          oldSCount.push(state.sCount[nextLine]);
+          state.sCount[nextLine] = -1;
+        }
+        oldIndent = state.blkIndent;
+        state.blkIndent = 0;
+        token2 = state.push("blockquote_open", "blockquote", 1);
+        token2.markup = ">";
+        token2.map = lines = [startLine, 0];
+        state.md.block.tokenize(state, startLine, nextLine);
+        token2 = state.push("blockquote_close", "blockquote", -1);
+        token2.markup = ">";
+        state.lineMax = oldLineMax;
+        state.parentType = oldParentType;
+        lines[1] = state.line;
+        for (i = 0; i < oldTShift.length; i++) {
+          state.bMarks[i + startLine] = oldBMarks[i];
+          state.tShift[i + startLine] = oldTShift[i];
+          state.sCount[i + startLine] = oldSCount[i];
+          state.bsCount[i + startLine] = oldBSCount[i];
+        }
+        state.blkIndent = oldIndent;
+        return true;
+      };
+      var isSpace$8 = utils$1.isSpace;
+      var hr = function hr2(state, startLine, endLine, silent) {
+        var marker2,
+          cnt,
+          ch2,
+          token2,
+          pos = state.bMarks[startLine] + state.tShift[startLine],
+          max = state.eMarks[startLine];
+        if (state.sCount[startLine] - state.blkIndent >= 4) {
+          return false;
+        }
+        marker2 = state.src.charCodeAt(pos++);
+        if (marker2 !== 42 && marker2 !== 45 && marker2 !== 95) {
+          return false;
+        }
+        cnt = 1;
+        while (pos < max) {
+          ch2 = state.src.charCodeAt(pos++);
+          if (ch2 !== marker2 && !isSpace$8(ch2)) {
+            return false;
+          }
+          if (ch2 === marker2) {
+            cnt++;
+          }
+        }
+        if (cnt < 3) {
+          return false;
+        }
+        if (silent) {
+          return true;
+        }
+        state.line = startLine + 1;
+        token2 = state.push("hr", "hr", 0);
+        token2.map = [startLine, state.line];
+        token2.markup = Array(cnt + 1).join(String.fromCharCode(marker2));
+        return true;
+      };
+      var isSpace$7 = utils$1.isSpace;
+      function skipBulletListMarker(state, startLine) {
+        var marker2, pos, max, ch2;
+        pos = state.bMarks[startLine] + state.tShift[startLine];
+        max = state.eMarks[startLine];
+        marker2 = state.src.charCodeAt(pos++);
+        if (marker2 !== 42 && marker2 !== 45 && marker2 !== 43) {
+          return -1;
+        }
+        if (pos < max) {
+          ch2 = state.src.charCodeAt(pos);
+          if (!isSpace$7(ch2)) {
+            return -1;
+          }
+        }
+        return pos;
+      }
+      function skipOrderedListMarker(state, startLine) {
+        var ch2,
+          start2 = state.bMarks[startLine] + state.tShift[startLine],
+          pos = start2,
+          max = state.eMarks[startLine];
+        if (pos + 1 >= max) {
+          return -1;
+        }
+        ch2 = state.src.charCodeAt(pos++);
+        if (ch2 < 48 || ch2 > 57) {
+          return -1;
+        }
+        for (;;) {
+          if (pos >= max) {
+            return -1;
+          }
+          ch2 = state.src.charCodeAt(pos++);
+          if (ch2 >= 48 && ch2 <= 57) {
+            if (pos - start2 >= 10) {
+              return -1;
+            }
+            continue;
+          }
+          if (ch2 === 41 || ch2 === 46) {
+            break;
+          }
+          return -1;
+        }
+        if (pos < max) {
+          ch2 = state.src.charCodeAt(pos);
+          if (!isSpace$7(ch2)) {
+            return -1;
+          }
+        }
+        return pos;
+      }
+      function markTightParagraphs(state, idx) {
+        var i,
+          l2,
+          level = state.level + 2;
+        for (i = idx + 2, l2 = state.tokens.length - 2; i < l2; i++) {
+          if (
+            state.tokens[i].level === level &&
+            state.tokens[i].type === "paragraph_open"
+          ) {
+            state.tokens[i + 2].hidden = true;
+            state.tokens[i].hidden = true;
+            i += 2;
+          }
+        }
+      }
+      var list = function list2(state, startLine, endLine, silent) {
+        var ch2,
+          contentStart,
+          i,
+          indent2,
+          indentAfterMarker,
+          initial,
+          isOrdered,
+          itemLines,
+          l2,
+          listLines,
+          listTokIdx,
+          markerCharCode,
+          markerValue,
+          max,
+          nextLine,
+          offset,
+          oldListIndent,
+          oldParentType,
+          oldSCount,
+          oldTShift,
+          oldTight,
+          pos,
+          posAfterMarker,
+          prevEmptyEnd,
+          start2,
+          terminate,
+          terminatorRules,
+          token2,
+          isTerminatingParagraph = false,
+          tight = true;
+        if (state.sCount[startLine] - state.blkIndent >= 4) {
+          return false;
+        }
+        if (
+          state.listIndent >= 0 &&
+          state.sCount[startLine] - state.listIndent >= 4 &&
+          state.sCount[startLine] < state.blkIndent
+        ) {
+          return false;
+        }
+        if (silent && state.parentType === "paragraph") {
+          if (state.sCount[startLine] >= state.blkIndent) {
+            isTerminatingParagraph = true;
+          }
+        }
+        if ((posAfterMarker = skipOrderedListMarker(state, startLine)) >= 0) {
+          isOrdered = true;
+          start2 = state.bMarks[startLine] + state.tShift[startLine];
+          markerValue = Number(state.src.slice(start2, posAfterMarker - 1));
+          if (isTerminatingParagraph && markerValue !== 1) return false;
+        } else if (
+          (posAfterMarker = skipBulletListMarker(state, startLine)) >= 0
+        ) {
+          isOrdered = false;
+        } else {
+          return false;
+        }
+        if (isTerminatingParagraph) {
+          if (state.skipSpaces(posAfterMarker) >= state.eMarks[startLine])
+            return false;
+        }
+        markerCharCode = state.src.charCodeAt(posAfterMarker - 1);
+        if (silent) {
+          return true;
+        }
+        listTokIdx = state.tokens.length;
+        if (isOrdered) {
+          token2 = state.push("ordered_list_open", "ol", 1);
+          if (markerValue !== 1) {
+            token2.attrs = [["start", markerValue]];
+          }
+        } else {
+          token2 = state.push("bullet_list_open", "ul", 1);
+        }
+        token2.map = listLines = [startLine, 0];
+        token2.markup = String.fromCharCode(markerCharCode);
+        nextLine = startLine;
+        prevEmptyEnd = false;
+        terminatorRules = state.md.block.ruler.getRules("list");
+        oldParentType = state.parentType;
+        state.parentType = "list";
+        while (nextLine < endLine) {
+          pos = posAfterMarker;
+          max = state.eMarks[nextLine];
+          initial = offset =
+            state.sCount[nextLine] +
+            posAfterMarker -
+            (state.bMarks[startLine] + state.tShift[startLine]);
+          while (pos < max) {
+            ch2 = state.src.charCodeAt(pos);
+            if (ch2 === 9) {
+              offset += 4 - ((offset + state.bsCount[nextLine]) % 4);
+            } else if (ch2 === 32) {
+              offset++;
+            } else {
+              break;
+            }
+            pos++;
+          }
+          contentStart = pos;
+          if (contentStart >= max) {
+            indentAfterMarker = 1;
+          } else {
+            indentAfterMarker = offset - initial;
+          }
+          if (indentAfterMarker > 4) {
+            indentAfterMarker = 1;
+          }
+          indent2 = initial + indentAfterMarker;
+          token2 = state.push("list_item_open", "li", 1);
+          token2.markup = String.fromCharCode(markerCharCode);
+          token2.map = itemLines = [startLine, 0];
+          if (isOrdered) {
+            token2.info = state.src.slice(start2, posAfterMarker - 1);
+          }
+          oldTight = state.tight;
+          oldTShift = state.tShift[startLine];
+          oldSCount = state.sCount[startLine];
+          oldListIndent = state.listIndent;
+          state.listIndent = state.blkIndent;
+          state.blkIndent = indent2;
+          state.tight = true;
+          state.tShift[startLine] = contentStart - state.bMarks[startLine];
+          state.sCount[startLine] = offset;
+          if (contentStart >= max && state.isEmpty(startLine + 1)) {
+            state.line = Math.min(state.line + 2, endLine);
+          } else {
+            state.md.block.tokenize(state, startLine, endLine, true);
+          }
+          if (!state.tight || prevEmptyEnd) {
+            tight = false;
+          }
+          prevEmptyEnd =
+            state.line - startLine > 1 && state.isEmpty(state.line - 1);
+          state.blkIndent = state.listIndent;
+          state.listIndent = oldListIndent;
+          state.tShift[startLine] = oldTShift;
+          state.sCount[startLine] = oldSCount;
+          state.tight = oldTight;
+          token2 = state.push("list_item_close", "li", -1);
+          token2.markup = String.fromCharCode(markerCharCode);
+          nextLine = startLine = state.line;
+          itemLines[1] = nextLine;
+          contentStart = state.bMarks[startLine];
+          if (nextLine >= endLine) {
+            break;
+          }
+          if (state.sCount[nextLine] < state.blkIndent) {
+            break;
+          }
+          if (state.sCount[startLine] - state.blkIndent >= 4) {
+            break;
+          }
+          terminate = false;
+          for (i = 0, l2 = terminatorRules.length; i < l2; i++) {
+            if (terminatorRules[i](state, nextLine, endLine, true)) {
+              terminate = true;
+              break;
+            }
+          }
+          if (terminate) {
+            break;
+          }
+          if (isOrdered) {
+            posAfterMarker = skipOrderedListMarker(state, nextLine);
+            if (posAfterMarker < 0) {
+              break;
+            }
+            start2 = state.bMarks[nextLine] + state.tShift[nextLine];
+          } else {
+            posAfterMarker = skipBulletListMarker(state, nextLine);
+            if (posAfterMarker < 0) {
+              break;
+            }
+          }
+          if (markerCharCode !== state.src.charCodeAt(posAfterMarker - 1)) {
+            break;
+          }
+        }
+        if (isOrdered) {
+          token2 = state.push("ordered_list_close", "ol", -1);
+        } else {
+          token2 = state.push("bullet_list_close", "ul", -1);
+        }
+        token2.markup = String.fromCharCode(markerCharCode);
+        listLines[1] = nextLine;
+        state.line = nextLine;
+        state.parentType = oldParentType;
+        if (tight) {
+          markTightParagraphs(state, listTokIdx);
+        }
+        return true;
+      };
+      var normalizeReference$2 = utils$1.normalizeReference;
+      var isSpace$6 = utils$1.isSpace;
+      var reference = function reference2(state, startLine, _endLine, silent) {
+        var ch2,
+          destEndPos,
+          destEndLineNo,
+          endLine,
+          href,
+          i,
+          l2,
+          label,
+          labelEnd,
+          oldParentType,
+          res,
+          start2,
+          str,
+          terminate,
+          terminatorRules,
+          title,
+          lines = 0,
+          pos = state.bMarks[startLine] + state.tShift[startLine],
+          max = state.eMarks[startLine],
+          nextLine = startLine + 1;
+        if (state.sCount[startLine] - state.blkIndent >= 4) {
+          return false;
+        }
+        if (state.src.charCodeAt(pos) !== 91) {
+          return false;
+        }
+        while (++pos < max) {
+          if (
+            state.src.charCodeAt(pos) === 93 &&
+            state.src.charCodeAt(pos - 1) !== 92
+          ) {
+            if (pos + 1 === max) {
+              return false;
+            }
+            if (state.src.charCodeAt(pos + 1) !== 58) {
+              return false;
+            }
+            break;
+          }
+        }
+        endLine = state.lineMax;
+        terminatorRules = state.md.block.ruler.getRules("reference");
+        oldParentType = state.parentType;
+        state.parentType = "reference";
+        for (; nextLine < endLine && !state.isEmpty(nextLine); nextLine++) {
+          if (state.sCount[nextLine] - state.blkIndent > 3) {
+            continue;
+          }
+          if (state.sCount[nextLine] < 0) {
+            continue;
+          }
+          terminate = false;
+          for (i = 0, l2 = terminatorRules.length; i < l2; i++) {
+            if (terminatorRules[i](state, nextLine, endLine, true)) {
+              terminate = true;
+              break;
+            }
+          }
+          if (terminate) {
+            break;
+          }
+        }
+        str = state
+          .getLines(startLine, nextLine, state.blkIndent, false)
+          .trim();
+        max = str.length;
+        for (pos = 1; pos < max; pos++) {
+          ch2 = str.charCodeAt(pos);
+          if (ch2 === 91) {
+            return false;
+          } else if (ch2 === 93) {
+            labelEnd = pos;
+            break;
+          } else if (ch2 === 10) {
+            lines++;
+          } else if (ch2 === 92) {
+            pos++;
+            if (pos < max && str.charCodeAt(pos) === 10) {
+              lines++;
+            }
+          }
+        }
+        if (labelEnd < 0 || str.charCodeAt(labelEnd + 1) !== 58) {
+          return false;
+        }
+        for (pos = labelEnd + 2; pos < max; pos++) {
+          ch2 = str.charCodeAt(pos);
+          if (ch2 === 10) {
+            lines++;
+          } else if (isSpace$6(ch2));
+          else {
+            break;
+          }
+        }
+        res = state.md.helpers.parseLinkDestination(str, pos, max);
+        if (!res.ok) {
+          return false;
+        }
+        href = state.md.normalizeLink(res.str);
+        if (!state.md.validateLink(href)) {
+          return false;
+        }
+        pos = res.pos;
+        lines += res.lines;
+        destEndPos = pos;
+        destEndLineNo = lines;
+        start2 = pos;
+        for (; pos < max; pos++) {
+          ch2 = str.charCodeAt(pos);
+          if (ch2 === 10) {
+            lines++;
+          } else if (isSpace$6(ch2));
+          else {
+            break;
+          }
+        }
+        res = state.md.helpers.parseLinkTitle(str, pos, max);
+        if (pos < max && start2 !== pos && res.ok) {
+          title = res.str;
+          pos = res.pos;
+          lines += res.lines;
+        } else {
+          title = "";
+          pos = destEndPos;
+          lines = destEndLineNo;
+        }
+        while (pos < max) {
+          ch2 = str.charCodeAt(pos);
+          if (!isSpace$6(ch2)) {
+            break;
+          }
+          pos++;
+        }
+        if (pos < max && str.charCodeAt(pos) !== 10) {
+          if (title) {
+            title = "";
+            pos = destEndPos;
+            lines = destEndLineNo;
+            while (pos < max) {
+              ch2 = str.charCodeAt(pos);
+              if (!isSpace$6(ch2)) {
+                break;
+              }
+              pos++;
+            }
+          }
+        }
+        if (pos < max && str.charCodeAt(pos) !== 10) {
+          return false;
+        }
+        label = normalizeReference$2(str.slice(1, labelEnd));
+        if (!label) {
+          return false;
+        }
+        if (silent) {
+          return true;
+        }
+        if (typeof state.env.references === "undefined") {
+          state.env.references = {};
+        }
+        if (typeof state.env.references[label] === "undefined") {
+          state.env.references[label] = { title, href };
+        }
+        state.parentType = oldParentType;
+        state.line = startLine + lines + 1;
+        return true;
+      };
+      var html_blocks = [
+        "address",
+        "article",
+        "aside",
+        "base",
+        "basefont",
+        "blockquote",
+        "body",
+        "caption",
+        "center",
+        "col",
+        "colgroup",
+        "dd",
+        "details",
+        "dialog",
+        "dir",
+        "div",
+        "dl",
+        "dt",
+        "fieldset",
+        "figcaption",
+        "figure",
+        "footer",
+        "form",
+        "frame",
+        "frameset",
+        "h1",
+        "h2",
+        "h3",
+        "h4",
+        "h5",
+        "h6",
+        "head",
+        "header",
+        "hr",
+        "html",
+        "iframe",
+        "legend",
+        "li",
+        "link",
+        "main",
+        "menu",
+        "menuitem",
+        "nav",
+        "noframes",
+        "ol",
+        "optgroup",
+        "option",
+        "p",
+        "param",
+        "section",
+        "source",
+        "summary",
+        "table",
+        "tbody",
+        "td",
+        "tfoot",
+        "th",
+        "thead",
+        "title",
+        "tr",
+        "track",
+        "ul",
+      ];
+      var html_re = {};
+      var attr_name = "[a-zA-Z_:][a-zA-Z0-9:._-]*";
+      var unquoted = "[^\"'=<>`\\x00-\\x20]+";
+      var single_quoted = "'[^']*'";
+      var double_quoted = '"[^"]*"';
+      var attr_value =
+        "(?:" + unquoted + "|" + single_quoted + "|" + double_quoted + ")";
+      var attribute =
+        "(?:\\s+" + attr_name + "(?:\\s*=\\s*" + attr_value + ")?)";
+      var open_tag = "<[A-Za-z][A-Za-z0-9\\-]*" + attribute + "*\\s*\\/?>";
+      var close_tag = "<\\/[A-Za-z][A-Za-z0-9\\-]*\\s*>";
+      var comment$3 = "<!---->|<!--(?:-?[^>-])(?:-?[^-])*-->";
+      var processing = "<[?][\\s\\S]*?[?]>";
+      var declaration = "<![A-Z]+\\s+[^>]*>";
+      var cdata = "<!\\[CDATA\\[[\\s\\S]*?\\]\\]>";
+      var HTML_TAG_RE$1 = new RegExp(
+        "^(?:" +
+          open_tag +
+          "|" +
+          close_tag +
+          "|" +
+          comment$3 +
+          "|" +
+          processing +
+          "|" +
+          declaration +
+          "|" +
+          cdata +
+          ")"
+      );
+      var HTML_OPEN_CLOSE_TAG_RE$1 = new RegExp(
+        "^(?:" + open_tag + "|" + close_tag + ")"
+      );
+      html_re.HTML_TAG_RE = HTML_TAG_RE$1;
+      html_re.HTML_OPEN_CLOSE_TAG_RE = HTML_OPEN_CLOSE_TAG_RE$1;
+      var block_names = html_blocks;
+      var HTML_OPEN_CLOSE_TAG_RE = html_re.HTML_OPEN_CLOSE_TAG_RE;
+      var HTML_SEQUENCES = [
+        [
+          /^<(script|pre|style|textarea)(?=(\s|>|$))/i,
+          /<\/(script|pre|style|textarea)>/i,
+          true,
+        ],
+        [/^<!--/, /-->/, true],
+        [/^<\?/, /\?>/, true],
+        [/^<![A-Z]/, />/, true],
+        [/^<!\[CDATA\[/, /\]\]>/, true],
+        [
+          new RegExp("^</?(" + block_names.join("|") + ")(?=(\\s|/?>|$))", "i"),
+          /^$/,
+          true,
+        ],
+        [new RegExp(HTML_OPEN_CLOSE_TAG_RE.source + "\\s*$"), /^$/, false],
+      ];
+      var html_block = function html_block2(state, startLine, endLine, silent) {
+        var i,
+          nextLine,
+          token2,
+          lineText,
+          pos = state.bMarks[startLine] + state.tShift[startLine],
+          max = state.eMarks[startLine];
+        if (state.sCount[startLine] - state.blkIndent >= 4) {
+          return false;
+        }
+        if (!state.md.options.html) {
+          return false;
+        }
+        if (state.src.charCodeAt(pos) !== 60) {
+          return false;
+        }
+        lineText = state.src.slice(pos, max);
+        for (i = 0; i < HTML_SEQUENCES.length; i++) {
+          if (HTML_SEQUENCES[i][0].test(lineText)) {
+            break;
+          }
+        }
+        if (i === HTML_SEQUENCES.length) {
+          return false;
+        }
+        if (silent) {
+          return HTML_SEQUENCES[i][2];
+        }
+        nextLine = startLine + 1;
+        if (!HTML_SEQUENCES[i][1].test(lineText)) {
+          for (; nextLine < endLine; nextLine++) {
+            if (state.sCount[nextLine] < state.blkIndent) {
+              break;
+            }
+            pos = state.bMarks[nextLine] + state.tShift[nextLine];
+            max = state.eMarks[nextLine];
+            lineText = state.src.slice(pos, max);
+            if (HTML_SEQUENCES[i][1].test(lineText)) {
+              if (lineText.length !== 0) {
+                nextLine++;
+              }
+              break;
+            }
+          }
+        }
+        state.line = nextLine;
+        token2 = state.push("html_block", "", 0);
+        token2.map = [startLine, nextLine];
+        token2.content = state.getLines(
+          startLine,
+          nextLine,
+          state.blkIndent,
+          true
+        );
+        return true;
+      };
+      var isSpace$5 = utils$1.isSpace;
+      var heading = function heading2(state, startLine, endLine, silent) {
+        var ch2,
+          level,
+          tmp,
+          token2,
+          pos = state.bMarks[startLine] + state.tShift[startLine],
+          max = state.eMarks[startLine];
+        if (state.sCount[startLine] - state.blkIndent >= 4) {
+          return false;
+        }
+        ch2 = state.src.charCodeAt(pos);
+        if (ch2 !== 35 || pos >= max) {
+          return false;
+        }
+        level = 1;
+        ch2 = state.src.charCodeAt(++pos);
+        while (ch2 === 35 && pos < max && level <= 6) {
+          level++;
+          ch2 = state.src.charCodeAt(++pos);
+        }
+        if (level > 6 || (pos < max && !isSpace$5(ch2))) {
+          return false;
+        }
+        if (silent) {
+          return true;
+        }
+        max = state.skipSpacesBack(max, pos);
+        tmp = state.skipCharsBack(max, 35, pos);
+        if (tmp > pos && isSpace$5(state.src.charCodeAt(tmp - 1))) {
+          max = tmp;
+        }
+        state.line = startLine + 1;
+        token2 = state.push("heading_open", "h" + String(level), 1);
+        token2.markup = "########".slice(0, level);
+        token2.map = [startLine, state.line];
+        token2 = state.push("inline", "", 0);
+        token2.content = state.src.slice(pos, max).trim();
+        token2.map = [startLine, state.line];
+        token2.children = [];
+        token2 = state.push("heading_close", "h" + String(level), -1);
+        token2.markup = "########".slice(0, level);
+        return true;
+      };
+      var lheading = function lheading2(state, startLine, endLine) {
+        var content,
+          terminate,
+          i,
+          l2,
+          token2,
+          pos,
+          max,
+          level,
+          marker2,
+          nextLine = startLine + 1,
+          oldParentType,
+          terminatorRules = state.md.block.ruler.getRules("paragraph");
+        if (state.sCount[startLine] - state.blkIndent >= 4) {
+          return false;
+        }
+        oldParentType = state.parentType;
+        state.parentType = "paragraph";
+        for (; nextLine < endLine && !state.isEmpty(nextLine); nextLine++) {
+          if (state.sCount[nextLine] - state.blkIndent > 3) {
+            continue;
+          }
+          if (state.sCount[nextLine] >= state.blkIndent) {
+            pos = state.bMarks[nextLine] + state.tShift[nextLine];
+            max = state.eMarks[nextLine];
+            if (pos < max) {
+              marker2 = state.src.charCodeAt(pos);
+              if (marker2 === 45 || marker2 === 61) {
+                pos = state.skipChars(pos, marker2);
+                pos = state.skipSpaces(pos);
+                if (pos >= max) {
+                  level = marker2 === 61 ? 1 : 2;
+                  break;
+                }
+              }
+            }
+          }
+          if (state.sCount[nextLine] < 0) {
+            continue;
+          }
+          terminate = false;
+          for (i = 0, l2 = terminatorRules.length; i < l2; i++) {
+            if (terminatorRules[i](state, nextLine, endLine, true)) {
+              terminate = true;
+              break;
+            }
+          }
+          if (terminate) {
+            break;
+          }
+        }
+        if (!level) {
+          return false;
+        }
+        content = state
+          .getLines(startLine, nextLine, state.blkIndent, false)
+          .trim();
+        state.line = nextLine + 1;
+        token2 = state.push("heading_open", "h" + String(level), 1);
+        token2.markup = String.fromCharCode(marker2);
+        token2.map = [startLine, state.line];
+        token2 = state.push("inline", "", 0);
+        token2.content = content;
+        token2.map = [startLine, state.line - 1];
+        token2.children = [];
+        token2 = state.push("heading_close", "h" + String(level), -1);
+        token2.markup = String.fromCharCode(marker2);
+        state.parentType = oldParentType;
+        return true;
+      };
+      var paragraph = function paragraph2(state, startLine) {
+        var content,
+          terminate,
+          i,
+          l2,
+          token2,
+          oldParentType,
+          nextLine = startLine + 1,
+          terminatorRules = state.md.block.ruler.getRules("paragraph"),
+          endLine = state.lineMax;
+        oldParentType = state.parentType;
+        state.parentType = "paragraph";
+        for (; nextLine < endLine && !state.isEmpty(nextLine); nextLine++) {
+          if (state.sCount[nextLine] - state.blkIndent > 3) {
+            continue;
+          }
+          if (state.sCount[nextLine] < 0) {
+            continue;
+          }
+          terminate = false;
+          for (i = 0, l2 = terminatorRules.length; i < l2; i++) {
+            if (terminatorRules[i](state, nextLine, endLine, true)) {
+              terminate = true;
+              break;
+            }
+          }
+          if (terminate) {
+            break;
+          }
+        }
+        content = state
+          .getLines(startLine, nextLine, state.blkIndent, false)
+          .trim();
+        state.line = nextLine;
+        token2 = state.push("paragraph_open", "p", 1);
+        token2.map = [startLine, state.line];
+        token2 = state.push("inline", "", 0);
+        token2.content = content;
+        token2.map = [startLine, state.line];
+        token2.children = [];
+        token2 = state.push("paragraph_close", "p", -1);
+        state.parentType = oldParentType;
+        return true;
+      };
+      var Token$1 = token;
+      var isSpace$4 = utils$1.isSpace;
+      function StateBlock(src, md2, env, tokens) {
+        var ch2, s, start2, pos, len, indent2, offset, indent_found;
+        this.src = src;
+        this.md = md2;
+        this.env = env;
+        this.tokens = tokens;
+        this.bMarks = [];
+        this.eMarks = [];
+        this.tShift = [];
+        this.sCount = [];
+        this.bsCount = [];
+        this.blkIndent = 0;
+        this.line = 0;
+        this.lineMax = 0;
+        this.tight = false;
+        this.ddIndent = -1;
+        this.listIndent = -1;
+        this.parentType = "root";
+        this.level = 0;
+        this.result = "";
+        s = this.src;
+        indent_found = false;
+        for (
+          start2 = pos = indent2 = offset = 0, len = s.length;
+          pos < len;
+          pos++
+        ) {
+          ch2 = s.charCodeAt(pos);
+          if (!indent_found) {
+            if (isSpace$4(ch2)) {
+              indent2++;
+              if (ch2 === 9) {
+                offset += 4 - (offset % 4);
+              } else {
+                offset++;
+              }
+              continue;
+            } else {
+              indent_found = true;
+            }
+          }
+          if (ch2 === 10 || pos === len - 1) {
+            if (ch2 !== 10) {
+              pos++;
+            }
+            this.bMarks.push(start2);
+            this.eMarks.push(pos);
+            this.tShift.push(indent2);
+            this.sCount.push(offset);
+            this.bsCount.push(0);
+            indent_found = false;
+            indent2 = 0;
+            offset = 0;
+            start2 = pos + 1;
+          }
+        }
+        this.bMarks.push(s.length);
+        this.eMarks.push(s.length);
+        this.tShift.push(0);
+        this.sCount.push(0);
+        this.bsCount.push(0);
+        this.lineMax = this.bMarks.length - 1;
+      }
+      StateBlock.prototype.push = function (type2, tag, nesting) {
+        var token2 = new Token$1(type2, tag, nesting);
+        token2.block = true;
+        if (nesting < 0) this.level--;
+        token2.level = this.level;
+        if (nesting > 0) this.level++;
+        this.tokens.push(token2);
+        return token2;
+      };
+      StateBlock.prototype.isEmpty = function isEmpty(line) {
+        return this.bMarks[line] + this.tShift[line] >= this.eMarks[line];
+      };
+      StateBlock.prototype.skipEmptyLines = function skipEmptyLines(from) {
+        for (var max = this.lineMax; from < max; from++) {
+          if (this.bMarks[from] + this.tShift[from] < this.eMarks[from]) {
+            break;
+          }
+        }
+        return from;
+      };
+      StateBlock.prototype.skipSpaces = function skipSpaces(pos) {
+        var ch2;
+        for (var max = this.src.length; pos < max; pos++) {
+          ch2 = this.src.charCodeAt(pos);
+          if (!isSpace$4(ch2)) {
+            break;
+          }
+        }
+        return pos;
+      };
+      StateBlock.prototype.skipSpacesBack = function skipSpacesBack(pos, min) {
+        if (pos <= min) {
+          return pos;
+        }
+        while (pos > min) {
+          if (!isSpace$4(this.src.charCodeAt(--pos))) {
+            return pos + 1;
+          }
+        }
+        return pos;
+      };
+      StateBlock.prototype.skipChars = function skipChars(pos, code3) {
+        for (var max = this.src.length; pos < max; pos++) {
+          if (this.src.charCodeAt(pos) !== code3) {
+            break;
+          }
+        }
+        return pos;
+      };
+      StateBlock.prototype.skipCharsBack = function skipCharsBack(
+        pos,
+        code3,
+        min
+      ) {
+        if (pos <= min) {
+          return pos;
+        }
+        while (pos > min) {
+          if (code3 !== this.src.charCodeAt(--pos)) {
+            return pos + 1;
+          }
+        }
+        return pos;
+      };
+      StateBlock.prototype.getLines = function getLines(
+        begin,
+        end2,
+        indent2,
+        keepLastLF
+      ) {
+        var i,
+          lineIndent,
+          ch2,
+          first,
+          last,
+          queue,
+          lineStart,
+          line = begin;
+        if (begin >= end2) {
+          return "";
+        }
+        queue = new Array(end2 - begin);
+        for (i = 0; line < end2; line++, i++) {
+          lineIndent = 0;
+          lineStart = first = this.bMarks[line];
+          if (line + 1 < end2 || keepLastLF) {
+            last = this.eMarks[line] + 1;
+          } else {
+            last = this.eMarks[line];
+          }
+          while (first < last && lineIndent < indent2) {
+            ch2 = this.src.charCodeAt(first);
+            if (isSpace$4(ch2)) {
+              if (ch2 === 9) {
+                lineIndent += 4 - ((lineIndent + this.bsCount[line]) % 4);
+              } else {
+                lineIndent++;
+              }
+            } else if (first - lineStart < this.tShift[line]) {
+              lineIndent++;
+            } else {
+              break;
+            }
+            first++;
+          }
+          if (lineIndent > indent2) {
+            queue[i] =
+              new Array(lineIndent - indent2 + 1).join(" ") +
+              this.src.slice(first, last);
+          } else {
+            queue[i] = this.src.slice(first, last);
+          }
+        }
+        return queue.join("");
+      };
+      StateBlock.prototype.Token = Token$1;
+      var state_block = StateBlock;
+      var Ruler$1 = ruler;
+      var _rules$1 = [
+        ["table", table, ["paragraph", "reference"]],
+        ["code", code$2],
+        ["fence", fence, ["paragraph", "reference", "blockquote", "list"]],
+        [
+          "blockquote",
+          blockquote,
+          ["paragraph", "reference", "blockquote", "list"],
+        ],
+        ["hr", hr, ["paragraph", "reference", "blockquote", "list"]],
+        ["list", list, ["paragraph", "reference", "blockquote"]],
+        ["reference", reference],
+        ["html_block", html_block, ["paragraph", "reference", "blockquote"]],
+        ["heading", heading, ["paragraph", "reference", "blockquote"]],
+        ["lheading", lheading],
+        ["paragraph", paragraph],
+      ];
+      function ParserBlock$1() {
+        this.ruler = new Ruler$1();
+        for (var i = 0; i < _rules$1.length; i++) {
+          this.ruler.push(_rules$1[i][0], _rules$1[i][1], {
+            alt: (_rules$1[i][2] || []).slice(),
+          });
+        }
+      }
+      ParserBlock$1.prototype.tokenize = function (state, startLine, endLine) {
+        var ok2,
+          i,
+          rules = this.ruler.getRules(""),
+          len = rules.length,
+          line = startLine,
+          hasEmptyLines = false,
+          maxNesting = state.md.options.maxNesting;
+        while (line < endLine) {
+          state.line = line = state.skipEmptyLines(line);
+          if (line >= endLine) {
+            break;
+          }
+          if (state.sCount[line] < state.blkIndent) {
+            break;
+          }
+          if (state.level >= maxNesting) {
+            state.line = endLine;
+            break;
+          }
+          for (i = 0; i < len; i++) {
+            ok2 = rules[i](state, line, endLine, false);
+            if (ok2) {
+              break;
+            }
+          }
+          state.tight = !hasEmptyLines;
+          if (state.isEmpty(state.line - 1)) {
+            hasEmptyLines = true;
+          }
+          line = state.line;
+          if (line < endLine && state.isEmpty(line)) {
+            hasEmptyLines = true;
+            line++;
+            state.line = line;
+          }
+        }
+      };
+      ParserBlock$1.prototype.parse = function (src, md2, env, outTokens) {
+        var state;
+        if (!src) {
+          return;
+        }
+        state = new this.State(src, md2, env, outTokens);
+        this.tokenize(state, state.line, state.lineMax);
+      };
+      ParserBlock$1.prototype.State = state_block;
+      var parser_block = ParserBlock$1;
+      function isTerminatorChar(ch2) {
+        switch (ch2) {
+          case 10:
+          case 33:
+          case 35:
+          case 36:
+          case 37:
+          case 38:
+          case 42:
+          case 43:
+          case 45:
+          case 58:
+          case 60:
+          case 61:
+          case 62:
+          case 64:
+          case 91:
+          case 92:
+          case 93:
+          case 94:
+          case 95:
+          case 96:
+          case 123:
+          case 125:
+          case 126:
+            return true;
+          default:
+            return false;
+        }
+      }
+      var text$1 = function text(state, silent) {
+        var pos = state.pos;
+        while (
+          pos < state.posMax &&
+          !isTerminatorChar(state.src.charCodeAt(pos))
+        ) {
+          pos++;
+        }
+        if (pos === state.pos) {
+          return false;
+        }
+        if (!silent) {
+          state.pending += state.src.slice(state.pos, pos);
+        }
+        state.pos = pos;
+        return true;
+      };
+      var isSpace$3 = utils$1.isSpace;
+      var newline = function newline2(state, silent) {
+        var pmax,
+          max,
+          ws2,
+          pos = state.pos;
+        if (state.src.charCodeAt(pos) !== 10) {
+          return false;
+        }
+        pmax = state.pending.length - 1;
+        max = state.posMax;
+        if (!silent) {
+          if (pmax >= 0 && state.pending.charCodeAt(pmax) === 32) {
+            if (pmax >= 1 && state.pending.charCodeAt(pmax - 1) === 32) {
+              ws2 = pmax - 1;
+              while (ws2 >= 1 && state.pending.charCodeAt(ws2 - 1) === 32)
+                ws2--;
+              state.pending = state.pending.slice(0, ws2);
+              state.push("hardbreak", "br", 0);
+            } else {
+              state.pending = state.pending.slice(0, -1);
+              state.push("softbreak", "br", 0);
+            }
+          } else {
+            state.push("softbreak", "br", 0);
+          }
+        }
+        pos++;
+        while (pos < max && isSpace$3(state.src.charCodeAt(pos))) {
+          pos++;
+        }
+        state.pos = pos;
+        return true;
+      };
+      var isSpace$2 = utils$1.isSpace;
+      var ESCAPED = [];
+      for (var i$1 = 0; i$1 < 256; i$1++) {
+        ESCAPED.push(0);
+      }
+      "\\!\"#$%&'()*+,./:;<=>?@[]^_`{|}~-".split("").forEach(function (ch2) {
+        ESCAPED[ch2.charCodeAt(0)] = 1;
+      });
+      var _escape = function escape2(state, silent) {
+        var ch2,
+          pos = state.pos,
+          max = state.posMax;
+        if (state.src.charCodeAt(pos) !== 92) {
+          return false;
+        }
+        pos++;
+        if (pos < max) {
+          ch2 = state.src.charCodeAt(pos);
+          if (ch2 < 256 && ESCAPED[ch2] !== 0) {
+            if (!silent) {
+              state.pending += state.src[pos];
+            }
+            state.pos += 2;
+            return true;
+          }
+          if (ch2 === 10) {
+            if (!silent) {
+              state.push("hardbreak", "br", 0);
+            }
+            pos++;
+            while (pos < max) {
+              ch2 = state.src.charCodeAt(pos);
+              if (!isSpace$2(ch2)) {
+                break;
+              }
+              pos++;
+            }
+            state.pos = pos;
+            return true;
+          }
+        }
+        if (!silent) {
+          state.pending += "\\";
+        }
+        state.pos++;
+        return true;
+      };
+      var backticks = function backtick(state, silent) {
+        var start2,
+          max,
+          marker2,
+          token2,
+          matchStart,
+          matchEnd,
+          openerLength,
+          closerLength,
+          pos = state.pos,
+          ch2 = state.src.charCodeAt(pos);
+        if (ch2 !== 96) {
+          return false;
+        }
+        start2 = pos;
+        pos++;
+        max = state.posMax;
+        while (pos < max && state.src.charCodeAt(pos) === 96) {
+          pos++;
+        }
+        marker2 = state.src.slice(start2, pos);
+        openerLength = marker2.length;
+        if (
+          state.backticksScanned &&
+          (state.backticks[openerLength] || 0) <= start2
+        ) {
+          if (!silent) state.pending += marker2;
+          state.pos += openerLength;
+          return true;
+        }
+        matchStart = matchEnd = pos;
+        while ((matchStart = state.src.indexOf("`", matchEnd)) !== -1) {
+          matchEnd = matchStart + 1;
+          while (matchEnd < max && state.src.charCodeAt(matchEnd) === 96) {
+            matchEnd++;
+          }
+          closerLength = matchEnd - matchStart;
+          if (closerLength === openerLength) {
+            if (!silent) {
+              token2 = state.push("code_inline", "code", 0);
+              token2.markup = marker2;
+              token2.content = state.src
+                .slice(pos, matchStart)
+                .replace(/\n/g, " ")
+                .replace(/^ (.+) $/, "$1");
+            }
+            state.pos = matchEnd;
+            return true;
+          }
+          state.backticks[closerLength] = matchStart;
+        }
+        state.backticksScanned = true;
+        if (!silent) state.pending += marker2;
+        state.pos += openerLength;
+        return true;
+      };
+      var strikethrough = {};
+      strikethrough.tokenize = function strikethrough2(state, silent) {
+        var i,
+          scanned,
+          token2,
+          len,
+          ch2,
+          start2 = state.pos,
+          marker2 = state.src.charCodeAt(start2);
+        if (silent) {
+          return false;
+        }
+        if (marker2 !== 126) {
+          return false;
+        }
+        scanned = state.scanDelims(state.pos, true);
+        len = scanned.length;
+        ch2 = String.fromCharCode(marker2);
+        if (len < 2) {
+          return false;
+        }
+        if (len % 2) {
+          token2 = state.push("text", "", 0);
+          token2.content = ch2;
+          len--;
+        }
+        for (i = 0; i < len; i += 2) {
+          token2 = state.push("text", "", 0);
+          token2.content = ch2 + ch2;
+          state.delimiters.push({
+            marker: marker2,
+            length: 0,
+            token: state.tokens.length - 1,
+            end: -1,
+            open: scanned.can_open,
+            close: scanned.can_close,
+          });
+        }
+        state.pos += scanned.length;
+        return true;
+      };
+      function postProcess$1(state, delimiters) {
+        var i,
+          j,
+          startDelim,
+          endDelim,
+          token2,
+          loneMarkers = [],
+          max = delimiters.length;
+        for (i = 0; i < max; i++) {
+          startDelim = delimiters[i];
+          if (startDelim.marker !== 126) {
+            continue;
+          }
+          if (startDelim.end === -1) {
+            continue;
+          }
+          endDelim = delimiters[startDelim.end];
+          token2 = state.tokens[startDelim.token];
+          token2.type = "s_open";
+          token2.tag = "s";
+          token2.nesting = 1;
+          token2.markup = "~~";
+          token2.content = "";
+          token2 = state.tokens[endDelim.token];
+          token2.type = "s_close";
+          token2.tag = "s";
+          token2.nesting = -1;
+          token2.markup = "~~";
+          token2.content = "";
+          if (
+            state.tokens[endDelim.token - 1].type === "text" &&
+            state.tokens[endDelim.token - 1].content === "~"
+          ) {
+            loneMarkers.push(endDelim.token - 1);
+          }
+        }
+        while (loneMarkers.length) {
+          i = loneMarkers.pop();
+          j = i + 1;
+          while (
+            j < state.tokens.length &&
+            state.tokens[j].type === "s_close"
+          ) {
+            j++;
+          }
+          j--;
+          if (i !== j) {
+            token2 = state.tokens[j];
+            state.tokens[j] = state.tokens[i];
+            state.tokens[i] = token2;
+          }
+        }
+      }
+      strikethrough.postProcess = function strikethrough3(state) {
+        var curr,
+          tokens_meta = state.tokens_meta,
+          max = state.tokens_meta.length;
+        postProcess$1(state, state.delimiters);
+        for (curr = 0; curr < max; curr++) {
+          if (tokens_meta[curr] && tokens_meta[curr].delimiters) {
+            postProcess$1(state, tokens_meta[curr].delimiters);
+          }
+        }
+      };
+      var emphasis = {};
+      emphasis.tokenize = function emphasis2(state, silent) {
+        var i,
+          scanned,
+          token2,
+          start2 = state.pos,
+          marker2 = state.src.charCodeAt(start2);
+        if (silent) {
+          return false;
+        }
+        if (marker2 !== 95 && marker2 !== 42) {
+          return false;
+        }
+        scanned = state.scanDelims(state.pos, marker2 === 42);
+        for (i = 0; i < scanned.length; i++) {
+          token2 = state.push("text", "", 0);
+          token2.content = String.fromCharCode(marker2);
+          state.delimiters.push({
+            marker: marker2,
+            length: scanned.length,
+            token: state.tokens.length - 1,
+            end: -1,
+            open: scanned.can_open,
+            close: scanned.can_close,
+          });
+        }
+        state.pos += scanned.length;
+        return true;
+      };
+      function postProcess(state, delimiters) {
+        var i,
+          startDelim,
+          endDelim,
+          token2,
+          ch2,
+          isStrong,
+          max = delimiters.length;
+        for (i = max - 1; i >= 0; i--) {
+          startDelim = delimiters[i];
+          if (startDelim.marker !== 95 && startDelim.marker !== 42) {
+            continue;
+          }
+          if (startDelim.end === -1) {
+            continue;
+          }
+          endDelim = delimiters[startDelim.end];
+          isStrong =
+            i > 0 &&
+            delimiters[i - 1].end === startDelim.end + 1 &&
+            delimiters[i - 1].marker === startDelim.marker &&
+            delimiters[i - 1].token === startDelim.token - 1 &&
+            delimiters[startDelim.end + 1].token === endDelim.token + 1;
+          ch2 = String.fromCharCode(startDelim.marker);
+          token2 = state.tokens[startDelim.token];
+          token2.type = isStrong ? "strong_open" : "em_open";
+          token2.tag = isStrong ? "strong" : "em";
+          token2.nesting = 1;
+          token2.markup = isStrong ? ch2 + ch2 : ch2;
+          token2.content = "";
+          token2 = state.tokens[endDelim.token];
+          token2.type = isStrong ? "strong_close" : "em_close";
+          token2.tag = isStrong ? "strong" : "em";
+          token2.nesting = -1;
+          token2.markup = isStrong ? ch2 + ch2 : ch2;
+          token2.content = "";
+          if (isStrong) {
+            state.tokens[delimiters[i - 1].token].content = "";
+            state.tokens[delimiters[startDelim.end + 1].token].content = "";
+            i--;
+          }
+        }
+      }
+      emphasis.postProcess = function emphasis3(state) {
+        var curr,
+          tokens_meta = state.tokens_meta,
+          max = state.tokens_meta.length;
+        postProcess(state, state.delimiters);
+        for (curr = 0; curr < max; curr++) {
+          if (tokens_meta[curr] && tokens_meta[curr].delimiters) {
+            postProcess(state, tokens_meta[curr].delimiters);
+          }
+        }
+      };
+      var normalizeReference$1 = utils$1.normalizeReference;
+      var isSpace$1 = utils$1.isSpace;
+      var link = function link2(state, silent) {
+        var attrs,
+          code3,
+          label,
+          labelEnd,
+          labelStart,
+          pos,
+          res,
+          ref,
+          token2,
+          href = "",
+          title = "",
+          oldPos = state.pos,
+          max = state.posMax,
+          start2 = state.pos,
+          parseReference = true;
+        if (state.src.charCodeAt(state.pos) !== 91) {
+          return false;
+        }
+        labelStart = state.pos + 1;
+        labelEnd = state.md.helpers.parseLinkLabel(state, state.pos, true);
+        if (labelEnd < 0) {
+          return false;
+        }
+        pos = labelEnd + 1;
+        if (pos < max && state.src.charCodeAt(pos) === 40) {
+          parseReference = false;
+          pos++;
+          for (; pos < max; pos++) {
+            code3 = state.src.charCodeAt(pos);
+            if (!isSpace$1(code3) && code3 !== 10) {
+              break;
+            }
+          }
+          if (pos >= max) {
+            return false;
+          }
+          start2 = pos;
+          res = state.md.helpers.parseLinkDestination(
+            state.src,
+            pos,
+            state.posMax
+          );
+          if (res.ok) {
+            href = state.md.normalizeLink(res.str);
+            if (state.md.validateLink(href)) {
+              pos = res.pos;
+            } else {
+              href = "";
+            }
+            start2 = pos;
+            for (; pos < max; pos++) {
+              code3 = state.src.charCodeAt(pos);
+              if (!isSpace$1(code3) && code3 !== 10) {
+                break;
+              }
+            }
+            res = state.md.helpers.parseLinkTitle(state.src, pos, state.posMax);
+            if (pos < max && start2 !== pos && res.ok) {
+              title = res.str;
+              pos = res.pos;
+              for (; pos < max; pos++) {
+                code3 = state.src.charCodeAt(pos);
+                if (!isSpace$1(code3) && code3 !== 10) {
+                  break;
+                }
+              }
+            }
+          }
+          if (pos >= max || state.src.charCodeAt(pos) !== 41) {
+            parseReference = true;
+          }
+          pos++;
+        }
+        if (parseReference) {
+          if (typeof state.env.references === "undefined") {
+            return false;
+          }
+          if (pos < max && state.src.charCodeAt(pos) === 91) {
+            start2 = pos + 1;
+            pos = state.md.helpers.parseLinkLabel(state, pos);
+            if (pos >= 0) {
+              label = state.src.slice(start2, pos++);
+            } else {
+              pos = labelEnd + 1;
+            }
+          } else {
+            pos = labelEnd + 1;
+          }
+          if (!label) {
+            label = state.src.slice(labelStart, labelEnd);
+          }
+          ref = state.env.references[normalizeReference$1(label)];
+          if (!ref) {
+            state.pos = oldPos;
+            return false;
+          }
+          href = ref.href;
+          title = ref.title;
+        }
+        if (!silent) {
+          state.pos = labelStart;
+          state.posMax = labelEnd;
+          token2 = state.push("link_open", "a", 1);
+          token2.attrs = attrs = [["href", href]];
+          if (title) {
+            attrs.push(["title", title]);
+          }
+          state.md.inline.tokenize(state);
+          token2 = state.push("link_close", "a", -1);
+        }
+        state.pos = pos;
+        state.posMax = max;
+        return true;
+      };
+      var normalizeReference = utils$1.normalizeReference;
+      var isSpace = utils$1.isSpace;
+      var image = function image2(state, silent) {
+        var attrs,
+          code3,
+          content,
+          label,
+          labelEnd,
+          labelStart,
+          pos,
+          ref,
+          res,
+          title,
+          token2,
+          tokens,
+          start2,
+          href = "",
+          oldPos = state.pos,
+          max = state.posMax;
+        if (state.src.charCodeAt(state.pos) !== 33) {
+          return false;
+        }
+        if (state.src.charCodeAt(state.pos + 1) !== 91) {
+          return false;
+        }
+        labelStart = state.pos + 2;
+        labelEnd = state.md.helpers.parseLinkLabel(state, state.pos + 1, false);
+        if (labelEnd < 0) {
+          return false;
+        }
+        pos = labelEnd + 1;
+        if (pos < max && state.src.charCodeAt(pos) === 40) {
+          pos++;
+          for (; pos < max; pos++) {
+            code3 = state.src.charCodeAt(pos);
+            if (!isSpace(code3) && code3 !== 10) {
+              break;
+            }
+          }
+          if (pos >= max) {
+            return false;
+          }
+          start2 = pos;
+          res = state.md.helpers.parseLinkDestination(
+            state.src,
+            pos,
+            state.posMax
+          );
+          if (res.ok) {
+            href = state.md.normalizeLink(res.str);
+            if (state.md.validateLink(href)) {
+              pos = res.pos;
+            } else {
+              href = "";
+            }
+          }
+          start2 = pos;
+          for (; pos < max; pos++) {
+            code3 = state.src.charCodeAt(pos);
+            if (!isSpace(code3) && code3 !== 10) {
+              break;
+            }
+          }
+          res = state.md.helpers.parseLinkTitle(state.src, pos, state.posMax);
+          if (pos < max && start2 !== pos && res.ok) {
+            title = res.str;
+            pos = res.pos;
+            for (; pos < max; pos++) {
+              code3 = state.src.charCodeAt(pos);
+              if (!isSpace(code3) && code3 !== 10) {
+                break;
+              }
+            }
+          } else {
+            title = "";
+          }
+          if (pos >= max || state.src.charCodeAt(pos) !== 41) {
+            state.pos = oldPos;
+            return false;
+          }
+          pos++;
+        } else {
+          if (typeof state.env.references === "undefined") {
+            return false;
+          }
+          if (pos < max && state.src.charCodeAt(pos) === 91) {
+            start2 = pos + 1;
+            pos = state.md.helpers.parseLinkLabel(state, pos);
+            if (pos >= 0) {
+              label = state.src.slice(start2, pos++);
+            } else {
+              pos = labelEnd + 1;
+            }
+          } else {
+            pos = labelEnd + 1;
+          }
+          if (!label) {
+            label = state.src.slice(labelStart, labelEnd);
+          }
+          ref = state.env.references[normalizeReference(label)];
+          if (!ref) {
+            state.pos = oldPos;
+            return false;
+          }
+          href = ref.href;
+          title = ref.title;
+        }
+        if (!silent) {
+          content = state.src.slice(labelStart, labelEnd);
+          state.md.inline.parse(content, state.md, state.env, (tokens = []));
+          token2 = state.push("image", "img", 0);
+          token2.attrs = attrs = [
+            ["src", href],
+            ["alt", ""],
+          ];
+          token2.children = tokens;
+          token2.content = content;
+          if (title) {
+            attrs.push(["title", title]);
+          }
+        }
+        state.pos = pos;
+        state.posMax = max;
+        return true;
+      };
+      var EMAIL_RE =
+        /^([a-zA-Z0-9.!#$%&'*+\/=?^_`{|}~-]+@[a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?(?:\.[a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?)*)$/;
+      var AUTOLINK_RE = /^([a-zA-Z][a-zA-Z0-9+.\-]{1,31}):([^<>\x00-\x20]*)$/;
+      var autolink = function autolink2(state, silent) {
+        var url,
+          fullUrl,
+          token2,
+          ch2,
+          start2,
+          max,
+          pos = state.pos;
+        if (state.src.charCodeAt(pos) !== 60) {
+          return false;
+        }
+        start2 = state.pos;
+        max = state.posMax;
+        for (;;) {
+          if (++pos >= max) return false;
+          ch2 = state.src.charCodeAt(pos);
+          if (ch2 === 60) return false;
+          if (ch2 === 62) break;
+        }
+        url = state.src.slice(start2 + 1, pos);
+        if (AUTOLINK_RE.test(url)) {
+          fullUrl = state.md.normalizeLink(url);
+          if (!state.md.validateLink(fullUrl)) {
+            return false;
+          }
+          if (!silent) {
+            token2 = state.push("link_open", "a", 1);
+            token2.attrs = [["href", fullUrl]];
+            token2.markup = "autolink";
+            token2.info = "auto";
+            token2 = state.push("text", "", 0);
+            token2.content = state.md.normalizeLinkText(url);
+            token2 = state.push("link_close", "a", -1);
+            token2.markup = "autolink";
+            token2.info = "auto";
+          }
+          state.pos += url.length + 2;
+          return true;
+        }
+        if (EMAIL_RE.test(url)) {
+          fullUrl = state.md.normalizeLink("mailto:" + url);
+          if (!state.md.validateLink(fullUrl)) {
+            return false;
+          }
+          if (!silent) {
+            token2 = state.push("link_open", "a", 1);
+            token2.attrs = [["href", fullUrl]];
+            token2.markup = "autolink";
+            token2.info = "auto";
+            token2 = state.push("text", "", 0);
+            token2.content = state.md.normalizeLinkText(url);
+            token2 = state.push("link_close", "a", -1);
+            token2.markup = "autolink";
+            token2.info = "auto";
+          }
+          state.pos += url.length + 2;
+          return true;
+        }
+        return false;
+      };
+      var HTML_TAG_RE = html_re.HTML_TAG_RE;
+      function isLetter(ch2) {
+        var lc2 = ch2 | 32;
+        return lc2 >= 97 && lc2 <= 122;
+      }
+      var html_inline = function html_inline2(state, silent) {
+        var ch2,
+          match2,
+          max,
+          token2,
+          pos = state.pos;
+        if (!state.md.options.html) {
+          return false;
+        }
+        max = state.posMax;
+        if (state.src.charCodeAt(pos) !== 60 || pos + 2 >= max) {
+          return false;
+        }
+        ch2 = state.src.charCodeAt(pos + 1);
+        if (ch2 !== 33 && ch2 !== 63 && ch2 !== 47 && !isLetter(ch2)) {
+          return false;
+        }
+        match2 = state.src.slice(pos).match(HTML_TAG_RE);
+        if (!match2) {
+          return false;
+        }
+        if (!silent) {
+          token2 = state.push("html_inline", "", 0);
+          token2.content = state.src.slice(pos, pos + match2[0].length);
+        }
+        state.pos += match2[0].length;
+        return true;
+      };
+      var entities = entities$1;
+      var has = utils$1.has;
+      var isValidEntityCode = utils$1.isValidEntityCode;
+      var fromCodePoint = utils$1.fromCodePoint;
+      var DIGITAL_RE = /^&#((?:x[a-f0-9]{1,6}|[0-9]{1,7}));/i;
+      var NAMED_RE = /^&([a-z][a-z0-9]{1,31});/i;
+      var entity = function entity2(state, silent) {
+        var ch2,
+          code3,
+          match2,
+          pos = state.pos,
+          max = state.posMax;
+        if (state.src.charCodeAt(pos) !== 38) {
+          return false;
+        }
+        if (pos + 1 < max) {
+          ch2 = state.src.charCodeAt(pos + 1);
+          if (ch2 === 35) {
+            match2 = state.src.slice(pos).match(DIGITAL_RE);
+            if (match2) {
+              if (!silent) {
+                code3 =
+                  match2[1][0].toLowerCase() === "x"
+                    ? parseInt(match2[1].slice(1), 16)
+                    : parseInt(match2[1], 10);
+                state.pending += isValidEntityCode(code3)
+                  ? fromCodePoint(code3)
+                  : fromCodePoint(65533);
+              }
+              state.pos += match2[0].length;
+              return true;
+            }
+          } else {
+            match2 = state.src.slice(pos).match(NAMED_RE);
+            if (match2) {
+              if (has(entities, match2[1])) {
+                if (!silent) {
+                  state.pending += entities[match2[1]];
+                }
+                state.pos += match2[0].length;
+                return true;
+              }
+            }
+          }
+        }
+        if (!silent) {
+          state.pending += "&";
+        }
+        state.pos++;
+        return true;
+      };
+      function processDelimiters(state, delimiters) {
+        var closerIdx,
+          openerIdx,
+          closer,
+          opener,
+          minOpenerIdx,
+          newMinOpenerIdx,
+          isOddMatch,
+          lastJump,
+          openersBottom = {},
+          max = delimiters.length;
+        if (!max) return;
+        var headerIdx = 0;
+        var lastTokenIdx = -2;
+        var jumps = [];
+        for (closerIdx = 0; closerIdx < max; closerIdx++) {
+          closer = delimiters[closerIdx];
+          jumps.push(0);
+          if (
+            delimiters[headerIdx].marker !== closer.marker ||
+            lastTokenIdx !== closer.token - 1
+          ) {
+            headerIdx = closerIdx;
+          }
+          lastTokenIdx = closer.token;
+          closer.length = closer.length || 0;
+          if (!closer.close) continue;
+          if (!openersBottom.hasOwnProperty(closer.marker)) {
+            openersBottom[closer.marker] = [-1, -1, -1, -1, -1, -1];
+          }
+          minOpenerIdx =
+            openersBottom[closer.marker][
+              (closer.open ? 3 : 0) + (closer.length % 3)
+            ];
+          openerIdx = headerIdx - jumps[headerIdx] - 1;
+          newMinOpenerIdx = openerIdx;
+          for (; openerIdx > minOpenerIdx; openerIdx -= jumps[openerIdx] + 1) {
+            opener = delimiters[openerIdx];
+            if (opener.marker !== closer.marker) continue;
+            if (opener.open && opener.end < 0) {
+              isOddMatch = false;
+              if (opener.close || closer.open) {
+                if ((opener.length + closer.length) % 3 === 0) {
+                  if (opener.length % 3 !== 0 || closer.length % 3 !== 0) {
+                    isOddMatch = true;
+                  }
+                }
+              }
+              if (!isOddMatch) {
+                lastJump =
+                  openerIdx > 0 && !delimiters[openerIdx - 1].open
+                    ? jumps[openerIdx - 1] + 1
+                    : 0;
+                jumps[closerIdx] = closerIdx - openerIdx + lastJump;
+                jumps[openerIdx] = lastJump;
+                closer.open = false;
+                opener.end = closerIdx;
+                opener.close = false;
+                newMinOpenerIdx = -1;
+                lastTokenIdx = -2;
+                break;
+              }
+            }
+          }
+          if (newMinOpenerIdx !== -1) {
+            openersBottom[closer.marker][
+              (closer.open ? 3 : 0) + ((closer.length || 0) % 3)
+            ] = newMinOpenerIdx;
+          }
+        }
+      }
+      var balance_pairs = function link_pairs(state) {
+        var curr,
+          tokens_meta = state.tokens_meta,
+          max = state.tokens_meta.length;
+        processDelimiters(state, state.delimiters);
+        for (curr = 0; curr < max; curr++) {
+          if (tokens_meta[curr] && tokens_meta[curr].delimiters) {
+            processDelimiters(state, tokens_meta[curr].delimiters);
+          }
+        }
+      };
+      var text_collapse = function text_collapse2(state) {
+        var curr,
+          last,
+          level = 0,
+          tokens = state.tokens,
+          max = state.tokens.length;
+        for (curr = last = 0; curr < max; curr++) {
+          if (tokens[curr].nesting < 0) level--;
+          tokens[curr].level = level;
+          if (tokens[curr].nesting > 0) level++;
+          if (
+            tokens[curr].type === "text" &&
+            curr + 1 < max &&
+            tokens[curr + 1].type === "text"
+          ) {
+            tokens[curr + 1].content =
+              tokens[curr].content + tokens[curr + 1].content;
+          } else {
+            if (curr !== last) {
+              tokens[last] = tokens[curr];
+            }
+            last++;
+          }
+        }
+        if (curr !== last) {
+          tokens.length = last;
+        }
+      };
+      var Token = token;
+      var isWhiteSpace = utils$1.isWhiteSpace;
+      var isPunctChar = utils$1.isPunctChar;
+      var isMdAsciiPunct = utils$1.isMdAsciiPunct;
+      function StateInline(src, md2, env, outTokens) {
+        this.src = src;
+        this.env = env;
+        this.md = md2;
+        this.tokens = outTokens;
+        this.tokens_meta = Array(outTokens.length);
+        this.pos = 0;
+        this.posMax = this.src.length;
+        this.level = 0;
+        this.pending = "";
+        this.pendingLevel = 0;
+        this.cache = {};
+        this.delimiters = [];
+        this._prev_delimiters = [];
+        this.backticks = {};
+        this.backticksScanned = false;
+      }
+      StateInline.prototype.pushPending = function () {
+        var token2 = new Token("text", "", 0);
+        token2.content = this.pending;
+        token2.level = this.pendingLevel;
+        this.tokens.push(token2);
+        this.pending = "";
+        return token2;
+      };
+      StateInline.prototype.push = function (type2, tag, nesting) {
+        if (this.pending) {
+          this.pushPending();
+        }
+        var token2 = new Token(type2, tag, nesting);
+        var token_meta = null;
+        if (nesting < 0) {
+          this.level--;
+          this.delimiters = this._prev_delimiters.pop();
+        }
+        token2.level = this.level;
+        if (nesting > 0) {
+          this.level++;
+          this._prev_delimiters.push(this.delimiters);
+          this.delimiters = [];
+          token_meta = { delimiters: this.delimiters };
+        }
+        this.pendingLevel = this.level;
+        this.tokens.push(token2);
+        this.tokens_meta.push(token_meta);
+        return token2;
+      };
+      StateInline.prototype.scanDelims = function (start2, canSplitWord) {
+        var pos = start2,
+          lastChar,
+          nextChar,
+          count,
+          can_open,
+          can_close,
+          isLastWhiteSpace,
+          isLastPunctChar,
+          isNextWhiteSpace,
+          isNextPunctChar,
+          left_flanking = true,
+          right_flanking = true,
+          max = this.posMax,
+          marker2 = this.src.charCodeAt(start2);
+        lastChar = start2 > 0 ? this.src.charCodeAt(start2 - 1) : 32;
+        while (pos < max && this.src.charCodeAt(pos) === marker2) {
+          pos++;
+        }
+        count = pos - start2;
+        nextChar = pos < max ? this.src.charCodeAt(pos) : 32;
+        isLastPunctChar =
+          isMdAsciiPunct(lastChar) ||
+          isPunctChar(String.fromCharCode(lastChar));
+        isNextPunctChar =
+          isMdAsciiPunct(nextChar) ||
+          isPunctChar(String.fromCharCode(nextChar));
+        isLastWhiteSpace = isWhiteSpace(lastChar);
+        isNextWhiteSpace = isWhiteSpace(nextChar);
+        if (isNextWhiteSpace) {
+          left_flanking = false;
+        } else if (isNextPunctChar) {
+          if (!(isLastWhiteSpace || isLastPunctChar)) {
+            left_flanking = false;
+          }
+        }
+        if (isLastWhiteSpace) {
+          right_flanking = false;
+        } else if (isLastPunctChar) {
+          if (!(isNextWhiteSpace || isNextPunctChar)) {
+            right_flanking = false;
+          }
+        }
+        if (!canSplitWord) {
+          can_open = left_flanking && (!right_flanking || isLastPunctChar);
+          can_close = right_flanking && (!left_flanking || isNextPunctChar);
+        } else {
+          can_open = left_flanking;
+          can_close = right_flanking;
+        }
+        return {
+          can_open,
+          can_close,
+          length: count,
+        };
+      };
+      StateInline.prototype.Token = Token;
+      var state_inline = StateInline;
+      var Ruler = ruler;
+      var _rules = [
+        ["text", text$1],
+        ["newline", newline],
+        ["escape", _escape],
+        ["backticks", backticks],
+        ["strikethrough", strikethrough.tokenize],
+        ["emphasis", emphasis.tokenize],
+        ["link", link],
+        ["image", image],
+        ["autolink", autolink],
+        ["html_inline", html_inline],
+        ["entity", entity],
+      ];
+      var _rules2 = [
+        ["balance_pairs", balance_pairs],
+        ["strikethrough", strikethrough.postProcess],
+        ["emphasis", emphasis.postProcess],
+        ["text_collapse", text_collapse],
+      ];
+      function ParserInline$1() {
+        var i;
+        this.ruler = new Ruler();
+        for (i = 0; i < _rules.length; i++) {
+          this.ruler.push(_rules[i][0], _rules[i][1]);
+        }
+        this.ruler2 = new Ruler();
+        for (i = 0; i < _rules2.length; i++) {
+          this.ruler2.push(_rules2[i][0], _rules2[i][1]);
+        }
+      }
+      ParserInline$1.prototype.skipToken = function (state) {
+        var ok2,
+          i,
+          pos = state.pos,
+          rules = this.ruler.getRules(""),
+          len = rules.length,
+          maxNesting = state.md.options.maxNesting,
+          cache = state.cache;
+        if (typeof cache[pos] !== "undefined") {
+          state.pos = cache[pos];
+          return;
+        }
+        if (state.level < maxNesting) {
+          for (i = 0; i < len; i++) {
+            state.level++;
+            ok2 = rules[i](state, true);
+            state.level--;
+            if (ok2) {
+              break;
+            }
+          }
+        } else {
+          state.pos = state.posMax;
+        }
+        if (!ok2) {
+          state.pos++;
+        }
+        cache[pos] = state.pos;
+      };
+      ParserInline$1.prototype.tokenize = function (state) {
+        var ok2,
+          i,
+          rules = this.ruler.getRules(""),
+          len = rules.length,
+          end2 = state.posMax,
+          maxNesting = state.md.options.maxNesting;
+        while (state.pos < end2) {
+          if (state.level < maxNesting) {
+            for (i = 0; i < len; i++) {
+              ok2 = rules[i](state, false);
+              if (ok2) {
+                break;
+              }
+            }
+          }
+          if (ok2) {
+            if (state.pos >= end2) {
+              break;
+            }
+            continue;
+          }
+          state.pending += state.src[state.pos++];
+        }
+        if (state.pending) {
+          state.pushPending();
+        }
+      };
+      ParserInline$1.prototype.parse = function (str, md2, env, outTokens) {
+        var i, rules, len;
+        var state = new this.State(str, md2, env, outTokens);
+        this.tokenize(state);
+        rules = this.ruler2.getRules("");
+        len = rules.length;
+        for (i = 0; i < len; i++) {
+          rules[i](state);
+        }
+      };
+      ParserInline$1.prototype.State = state_inline;
+      var parser_inline = ParserInline$1;
+      var re = function (opts) {
+        var re2 = {};
+        re2.src_Any = regex$3.source;
+        re2.src_Cc = regex$2.source;
+        re2.src_Z = regex.source;
+        re2.src_P = regex$4.source;
+        re2.src_ZPCc = [re2.src_Z, re2.src_P, re2.src_Cc].join("|");
+        re2.src_ZCc = [re2.src_Z, re2.src_Cc].join("|");
+        var text_separators = "[><\uFF5C]";
+        re2.src_pseudo_letter =
+          "(?:(?!" +
+          text_separators +
+          "|" +
+          re2.src_ZPCc +
+          ")" +
+          re2.src_Any +
+          ")";
+        re2.src_ip4 =
+          "(?:(25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)\\.){3}(25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)";
+        re2.src_auth = "(?:(?:(?!" + re2.src_ZCc + "|[@/\\[\\]()]).)+@)?";
+        re2.src_port =
+          "(?::(?:6(?:[0-4]\\d{3}|5(?:[0-4]\\d{2}|5(?:[0-2]\\d|3[0-5])))|[1-5]?\\d{1,4}))?";
+        re2.src_host_terminator =
+          "(?=$|" +
+          text_separators +
+          "|" +
+          re2.src_ZPCc +
+          ")(?!-|_|:\\d|\\.-|\\.(?!$|" +
+          re2.src_ZPCc +
+          "))";
+        re2.src_path =
+          "(?:[/?#](?:(?!" +
+          re2.src_ZCc +
+          "|" +
+          text_separators +
+          `|[()[\\]{}.,"'?!\\-;]).|\\[(?:(?!` +
+          re2.src_ZCc +
+          "|\\]).)*\\]|\\((?:(?!" +
+          re2.src_ZCc +
+          "|[)]).)*\\)|\\{(?:(?!" +
+          re2.src_ZCc +
+          '|[}]).)*\\}|\\"(?:(?!' +
+          re2.src_ZCc +
+          `|["]).)+\\"|\\'(?:(?!` +
+          re2.src_ZCc +
+          "|[']).)+\\'|\\'(?=" +
+          re2.src_pseudo_letter +
+          "|[-]).|\\.{2,}[a-zA-Z0-9%/&]|\\.(?!" +
+          re2.src_ZCc +
+          "|[.]).|" +
+          (opts && opts["---"] ? "\\-(?!--(?:[^-]|$))(?:-*)|" : "\\-+|") +
+          ",(?!" +
+          re2.src_ZCc +
+          ").|;(?!" +
+          re2.src_ZCc +
+          ").|\\!+(?!" +
+          re2.src_ZCc +
+          "|[!]).|\\?(?!" +
+          re2.src_ZCc +
+          "|[?]).)+|\\/)?";
+        re2.src_email_name =
+          '[\\-;:&=\\+\\$,\\.a-zA-Z0-9_][\\-;:&=\\+\\$,\\"\\.a-zA-Z0-9_]*';
+        re2.src_xn = "xn--[a-z0-9\\-]{1,59}";
+        re2.src_domain_root =
+          "(?:" + re2.src_xn + "|" + re2.src_pseudo_letter + "{1,63})";
+        re2.src_domain =
+          "(?:" +
+          re2.src_xn +
+          "|(?:" +
+          re2.src_pseudo_letter +
+          ")|(?:" +
+          re2.src_pseudo_letter +
+          "(?:-|" +
+          re2.src_pseudo_letter +
+          "){0,61}" +
+          re2.src_pseudo_letter +
+          "))";
+        re2.src_host =
+          "(?:(?:(?:(?:" + re2.src_domain + ")\\.)*" + re2.src_domain + "))";
+        re2.tpl_host_fuzzy =
+          "(?:" +
+          re2.src_ip4 +
+          "|(?:(?:(?:" +
+          re2.src_domain +
+          ")\\.)+(?:%TLDS%)))";
+        re2.tpl_host_no_ip_fuzzy =
+          "(?:(?:(?:" + re2.src_domain + ")\\.)+(?:%TLDS%))";
+        re2.src_host_strict = re2.src_host + re2.src_host_terminator;
+        re2.tpl_host_fuzzy_strict =
+          re2.tpl_host_fuzzy + re2.src_host_terminator;
+        re2.src_host_port_strict =
+          re2.src_host + re2.src_port + re2.src_host_terminator;
+        re2.tpl_host_port_fuzzy_strict =
+          re2.tpl_host_fuzzy + re2.src_port + re2.src_host_terminator;
+        re2.tpl_host_port_no_ip_fuzzy_strict =
+          re2.tpl_host_no_ip_fuzzy + re2.src_port + re2.src_host_terminator;
+        re2.tpl_host_fuzzy_test =
+          "localhost|www\\.|\\.\\d{1,3}\\.|(?:\\.(?:%TLDS%)(?:" +
+          re2.src_ZPCc +
+          "|>|$))";
+        re2.tpl_email_fuzzy =
+          "(^|" +
+          text_separators +
+          '|"|\\(|' +
+          re2.src_ZCc +
+          ")(" +
+          re2.src_email_name +
+          "@" +
+          re2.tpl_host_fuzzy_strict +
+          ")";
+        re2.tpl_link_fuzzy =
+          "(^|(?![.:/\\-_@])(?:[$+<=>^`|\uFF5C]|" +
+          re2.src_ZPCc +
+          "))((?![$+<=>^`|\uFF5C])" +
+          re2.tpl_host_port_fuzzy_strict +
+          re2.src_path +
+          ")";
+        re2.tpl_link_no_ip_fuzzy =
+          "(^|(?![.:/\\-_@])(?:[$+<=>^`|\uFF5C]|" +
+          re2.src_ZPCc +
+          "))((?![$+<=>^`|\uFF5C])" +
+          re2.tpl_host_port_no_ip_fuzzy_strict +
+          re2.src_path +
+          ")";
+        return re2;
+      };
+      function assign(obj) {
+        var sources = Array.prototype.slice.call(arguments, 1);
+        sources.forEach(function (source) {
+          if (!source) {
+            return;
+          }
+          Object.keys(source).forEach(function (key) {
+            obj[key] = source[key];
+          });
+        });
+        return obj;
+      }
+      function _class(obj) {
+        return Object.prototype.toString.call(obj);
+      }
+      function isString$2(obj) {
+        return _class(obj) === "[object String]";
+      }
+      function isObject$6(obj) {
+        return _class(obj) === "[object Object]";
+      }
+      function isRegExp(obj) {
+        return _class(obj) === "[object RegExp]";
+      }
+      function isFunction(obj) {
+        return _class(obj) === "[object Function]";
+      }
+      function escapeRE(str) {
+        return str.replace(/[.?*+^$[\]\\(){}|-]/g, "\\$&");
+      }
+      var defaultOptions = {
+        fuzzyLink: true,
+        fuzzyEmail: true,
+        fuzzyIP: false,
+      };
+      function isOptionsObj(obj) {
+        return Object.keys(obj || {}).reduce(function (acc, k) {
+          return acc || defaultOptions.hasOwnProperty(k);
+        }, false);
+      }
+      var defaultSchemas = {
+        "http:": {
+          validate: function (text3, pos, self2) {
+            var tail = text3.slice(pos);
+            if (!self2.re.http) {
+              self2.re.http = new RegExp(
+                "^\\/\\/" +
+                  self2.re.src_auth +
+                  self2.re.src_host_port_strict +
+                  self2.re.src_path,
+                "i"
+              );
+            }
+            if (self2.re.http.test(tail)) {
+              return tail.match(self2.re.http)[0].length;
+            }
+            return 0;
+          },
+        },
+        "https:": "http:",
+        "ftp:": "http:",
+        "//": {
+          validate: function (text3, pos, self2) {
+            var tail = text3.slice(pos);
+            if (!self2.re.no_http) {
+              self2.re.no_http = new RegExp(
+                "^" +
+                  self2.re.src_auth +
+                  "(?:localhost|(?:(?:" +
+                  self2.re.src_domain +
+                  ")\\.)+" +
+                  self2.re.src_domain_root +
+                  ")" +
+                  self2.re.src_port +
+                  self2.re.src_host_terminator +
+                  self2.re.src_path,
+                "i"
+              );
+            }
+            if (self2.re.no_http.test(tail)) {
+              if (pos >= 3 && text3[pos - 3] === ":") {
+                return 0;
+              }
+              if (pos >= 3 && text3[pos - 3] === "/") {
+                return 0;
+              }
+              return tail.match(self2.re.no_http)[0].length;
+            }
+            return 0;
+          },
+        },
+        "mailto:": {
+          validate: function (text3, pos, self2) {
+            var tail = text3.slice(pos);
+            if (!self2.re.mailto) {
+              self2.re.mailto = new RegExp(
+                "^" + self2.re.src_email_name + "@" + self2.re.src_host_strict,
+                "i"
+              );
+            }
+            if (self2.re.mailto.test(tail)) {
+              return tail.match(self2.re.mailto)[0].length;
+            }
+            return 0;
+          },
+        },
+      };
+      var tlds_2ch_src_re =
+        "a[cdefgilmnoqrstuwxz]|b[abdefghijmnorstvwyz]|c[acdfghiklmnoruvwxyz]|d[ejkmoz]|e[cegrstu]|f[ijkmor]|g[abdefghilmnpqrstuwy]|h[kmnrtu]|i[delmnoqrst]|j[emop]|k[eghimnprwyz]|l[abcikrstuvy]|m[acdeghklmnopqrstuvwxyz]|n[acefgilopruz]|om|p[aefghklmnrstwy]|qa|r[eosuw]|s[abcdeghijklmnortuvxyz]|t[cdfghjklmnortvwz]|u[agksyz]|v[aceginu]|w[fs]|y[et]|z[amw]";
+      var tlds_default =
+        "biz|com|edu|gov|net|org|pro|web|xxx|aero|asia|coop|info|museum|name|shop|\u0440\u0444".split(
+          "|"
+        );
+      function resetScanCache(self2) {
+        self2.__index__ = -1;
+        self2.__text_cache__ = "";
+      }
+      function createValidator(re2) {
+        return function (text3, pos) {
+          var tail = text3.slice(pos);
+          if (re2.test(tail)) {
+            return tail.match(re2)[0].length;
+          }
+          return 0;
+        };
+      }
+      function createNormalizer() {
+        return function (match2, self2) {
+          self2.normalize(match2);
+        };
+      }
+      function compile(self2) {
+        var re$12 = (self2.re = re(self2.__opts__));
+        var tlds2 = self2.__tlds__.slice();
+        self2.onCompile();
+        if (!self2.__tlds_replaced__) {
+          tlds2.push(tlds_2ch_src_re);
+        }
+        tlds2.push(re$12.src_xn);
+        re$12.src_tlds = tlds2.join("|");
+        function untpl(tpl) {
+          return tpl.replace("%TLDS%", re$12.src_tlds);
+        }
+        re$12.email_fuzzy = RegExp(untpl(re$12.tpl_email_fuzzy), "i");
+        re$12.link_fuzzy = RegExp(untpl(re$12.tpl_link_fuzzy), "i");
+        re$12.link_no_ip_fuzzy = RegExp(untpl(re$12.tpl_link_no_ip_fuzzy), "i");
+        re$12.host_fuzzy_test = RegExp(untpl(re$12.tpl_host_fuzzy_test), "i");
+        var aliases = [];
+        self2.__compiled__ = {};
+        function schemaError(name2, val) {
+          throw new Error('(LinkifyIt) Invalid schema "' + name2 + '": ' + val);
+        }
+        Object.keys(self2.__schemas__).forEach(function (name2) {
+          var val = self2.__schemas__[name2];
+          if (val === null) {
+            return;
+          }
+          var compiled = { validate: null, link: null };
+          self2.__compiled__[name2] = compiled;
+          if (isObject$6(val)) {
+            if (isRegExp(val.validate)) {
+              compiled.validate = createValidator(val.validate);
+            } else if (isFunction(val.validate)) {
+              compiled.validate = val.validate;
+            } else {
+              schemaError(name2, val);
+            }
+            if (isFunction(val.normalize)) {
+              compiled.normalize = val.normalize;
+            } else if (!val.normalize) {
+              compiled.normalize = createNormalizer();
+            } else {
+              schemaError(name2, val);
+            }
+            return;
+          }
+          if (isString$2(val)) {
+            aliases.push(name2);
+            return;
+          }
+          schemaError(name2, val);
+        });
+        aliases.forEach(function (alias) {
+          if (!self2.__compiled__[self2.__schemas__[alias]]) {
+            return;
+          }
+          self2.__compiled__[alias].validate =
+            self2.__compiled__[self2.__schemas__[alias]].validate;
+          self2.__compiled__[alias].normalize =
+            self2.__compiled__[self2.__schemas__[alias]].normalize;
+        });
+        self2.__compiled__[""] = {
+          validate: null,
+          normalize: createNormalizer(),
+        };
+        var slist = Object.keys(self2.__compiled__)
+          .filter(function (name2) {
+            return name2.length > 0 && self2.__compiled__[name2];
+          })
+          .map(escapeRE)
+          .join("|");
+        self2.re.schema_test = RegExp(
+          "(^|(?!_)(?:[><\uFF5C]|" + re$12.src_ZPCc + "))(" + slist + ")",
+          "i"
+        );
+        self2.re.schema_search = RegExp(
+          "(^|(?!_)(?:[><\uFF5C]|" + re$12.src_ZPCc + "))(" + slist + ")",
+          "ig"
+        );
+        self2.re.pretest = RegExp(
+          "(" +
+            self2.re.schema_test.source +
+            ")|(" +
+            self2.re.host_fuzzy_test.source +
+            ")|@",
+          "i"
+        );
+        resetScanCache(self2);
+      }
+      function Match(self2, shift) {
+        var start2 = self2.__index__,
+          end2 = self2.__last_index__,
+          text3 = self2.__text_cache__.slice(start2, end2);
+        this.schema = self2.__schema__.toLowerCase();
+        this.index = start2 + shift;
+        this.lastIndex = end2 + shift;
+        this.raw = text3;
+        this.text = text3;
+        this.url = text3;
+      }
+      function createMatch(self2, shift) {
+        var match2 = new Match(self2, shift);
+        self2.__compiled__[match2.schema].normalize(match2, self2);
+        return match2;
+      }
+      function LinkifyIt$1(schemas, options) {
+        if (!(this instanceof LinkifyIt$1)) {
+          return new LinkifyIt$1(schemas, options);
+        }
+        if (!options) {
+          if (isOptionsObj(schemas)) {
+            options = schemas;
+            schemas = {};
+          }
+        }
+        this.__opts__ = assign({}, defaultOptions, options);
+        this.__index__ = -1;
+        this.__last_index__ = -1;
+        this.__schema__ = "";
+        this.__text_cache__ = "";
+        this.__schemas__ = assign({}, defaultSchemas, schemas);
+        this.__compiled__ = {};
+        this.__tlds__ = tlds_default;
+        this.__tlds_replaced__ = false;
+        this.re = {};
+        compile(this);
+      }
+      LinkifyIt$1.prototype.add = function add(schema, definition) {
+        this.__schemas__[schema] = definition;
+        compile(this);
+        return this;
+      };
+      LinkifyIt$1.prototype.set = function set(options) {
+        this.__opts__ = assign(this.__opts__, options);
+        return this;
+      };
+      LinkifyIt$1.prototype.test = function test(text3) {
+        this.__text_cache__ = text3;
+        this.__index__ = -1;
+        if (!text3.length) {
+          return false;
+        }
+        var m, ml, me2, len, shift, next, re2, tld_pos, at_pos;
+        if (this.re.schema_test.test(text3)) {
+          re2 = this.re.schema_search;
+          re2.lastIndex = 0;
+          while ((m = re2.exec(text3)) !== null) {
+            len = this.testSchemaAt(text3, m[2], re2.lastIndex);
+            if (len) {
+              this.__schema__ = m[2];
+              this.__index__ = m.index + m[1].length;
+              this.__last_index__ = m.index + m[0].length + len;
+              break;
+            }
+          }
+        }
+        if (this.__opts__.fuzzyLink && this.__compiled__["http:"]) {
+          tld_pos = text3.search(this.re.host_fuzzy_test);
+          if (tld_pos >= 0) {
+            if (this.__index__ < 0 || tld_pos < this.__index__) {
+              if (
+                (ml = text3.match(
+                  this.__opts__.fuzzyIP
+                    ? this.re.link_fuzzy
+                    : this.re.link_no_ip_fuzzy
+                )) !== null
+              ) {
+                shift = ml.index + ml[1].length;
+                if (this.__index__ < 0 || shift < this.__index__) {
+                  this.__schema__ = "";
+                  this.__index__ = shift;
+                  this.__last_index__ = ml.index + ml[0].length;
+                }
+              }
+            }
+          }
+        }
+        if (this.__opts__.fuzzyEmail && this.__compiled__["mailto:"]) {
+          at_pos = text3.indexOf("@");
+          if (at_pos >= 0) {
+            if ((me2 = text3.match(this.re.email_fuzzy)) !== null) {
+              shift = me2.index + me2[1].length;
+              next = me2.index + me2[0].length;
+              if (
+                this.__index__ < 0 ||
+                shift < this.__index__ ||
+                (shift === this.__index__ && next > this.__last_index__)
+              ) {
+                this.__schema__ = "mailto:";
+                this.__index__ = shift;
+                this.__last_index__ = next;
+              }
+            }
+          }
+        }
+        return this.__index__ >= 0;
+      };
+      LinkifyIt$1.prototype.pretest = function pretest(text3) {
+        return this.re.pretest.test(text3);
+      };
+      LinkifyIt$1.prototype.testSchemaAt = function testSchemaAt(
+        text3,
+        schema,
+        pos
+      ) {
+        if (!this.__compiled__[schema.toLowerCase()]) {
+          return 0;
+        }
+        return this.__compiled__[schema.toLowerCase()].validate(
+          text3,
+          pos,
+          this
+        );
+      };
+      LinkifyIt$1.prototype.match = function match(text3) {
+        var shift = 0,
+          result2 = [];
+        if (this.__index__ >= 0 && this.__text_cache__ === text3) {
+          result2.push(createMatch(this, shift));
+          shift = this.__last_index__;
+        }
+        var tail = shift ? text3.slice(shift) : text3;
+        while (this.test(tail)) {
+          result2.push(createMatch(this, shift));
+          tail = tail.slice(this.__last_index__);
+          shift += this.__last_index__;
+        }
+        if (result2.length) {
+          return result2;
+        }
+        return null;
+      };
+      LinkifyIt$1.prototype.tlds = function tlds(list3, keepOld) {
+        list3 = Array.isArray(list3) ? list3 : [list3];
+        if (!keepOld) {
+          this.__tlds__ = list3.slice();
+          this.__tlds_replaced__ = true;
+          compile(this);
+          return this;
+        }
+        this.__tlds__ = this.__tlds__
+          .concat(list3)
+          .sort()
+          .filter(function (el2, idx, arr) {
+            return el2 !== arr[idx - 1];
+          })
+          .reverse();
+        compile(this);
+        return this;
+      };
+      LinkifyIt$1.prototype.normalize = function normalize3(match2) {
+        if (!match2.schema) {
+          match2.url = "http://" + match2.url;
+        }
+        if (match2.schema === "mailto:" && !/^mailto:/i.test(match2.url)) {
+          match2.url = "mailto:" + match2.url;
+        }
+      };
+      LinkifyIt$1.prototype.onCompile = function onCompile() {};
+      var linkifyIt = LinkifyIt$1;
+      const maxInt = 2147483647;
+      const base = 36;
+      const tMin = 1;
+      const tMax = 26;
+      const skew = 38;
+      const damp = 700;
+      const initialBias = 72;
+      const initialN = 128;
+      const delimiter = "-";
+      const regexPunycode = /^xn--/;
+      const regexNonASCII = /[^\0-\x7E]/;
+      const regexSeparators = /[\x2E\u3002\uFF0E\uFF61]/g;
+      const errors = {
+        overflow: "Overflow: input needs wider integers to process",
+        "not-basic": "Illegal input >= 0x80 (not a basic code point)",
+        "invalid-input": "Invalid input",
+      };
+      const baseMinusTMin = base - tMin;
+      const floor = Math.floor;
+      const stringFromCharCode = String.fromCharCode;
+      function error(type2) {
+        throw new RangeError(errors[type2]);
+      }
+      function map(array, fn) {
+        const result2 = [];
+        let length = array.length;
+        while (length--) {
+          result2[length] = fn(array[length]);
+        }
+        return result2;
+      }
+      function mapDomain(string2, fn) {
+        const parts = string2.split("@");
+        let result2 = "";
+        if (parts.length > 1) {
+          result2 = parts[0] + "@";
+          string2 = parts[1];
+        }
+        string2 = string2.replace(regexSeparators, ".");
+        const labels = string2.split(".");
+        const encoded = map(labels, fn).join(".");
+        return result2 + encoded;
+      }
+      function ucs2decode(string2) {
+        const output = [];
+        let counter = 0;
+        const length = string2.length;
+        while (counter < length) {
+          const value = string2.charCodeAt(counter++);
+          if (value >= 55296 && value <= 56319 && counter < length) {
+            const extra = string2.charCodeAt(counter++);
+            if ((extra & 64512) == 56320) {
+              output.push(((value & 1023) << 10) + (extra & 1023) + 65536);
+            } else {
+              output.push(value);
+              counter--;
+            }
+          } else {
+            output.push(value);
+          }
+        }
+        return output;
+      }
+      const ucs2encode = (array) => String.fromCodePoint(...array);
+      const basicToDigit = function (codePoint) {
+        if (codePoint - 48 < 10) {
+          return codePoint - 22;
+        }
+        if (codePoint - 65 < 26) {
+          return codePoint - 65;
+        }
+        if (codePoint - 97 < 26) {
+          return codePoint - 97;
+        }
+        return base;
+      };
+      const digitToBasic = function (digit, flag) {
+        return digit + 22 + 75 * (digit < 26) - ((flag != 0) << 5);
+      };
+      const adapt = function (delta2, numPoints, firstTime) {
+        let k = 0;
+        delta2 = firstTime ? floor(delta2 / damp) : delta2 >> 1;
+        delta2 += floor(delta2 / numPoints);
+        for (; delta2 > (baseMinusTMin * tMax) >> 1; k += base) {
+          delta2 = floor(delta2 / baseMinusTMin);
+        }
+        return floor(k + ((baseMinusTMin + 1) * delta2) / (delta2 + skew));
+      };
+      const decode = function (input) {
+        const output = [];
+        const inputLength = input.length;
+        let i = 0;
+        let n2 = initialN;
+        let bias = initialBias;
+        let basic = input.lastIndexOf(delimiter);
+        if (basic < 0) {
+          basic = 0;
+        }
+        for (let j = 0; j < basic; ++j) {
+          if (input.charCodeAt(j) >= 128) {
+            error("not-basic");
+          }
+          output.push(input.charCodeAt(j));
+        }
+        for (let index = basic > 0 ? basic + 1 : 0; index < inputLength; ) {
+          let oldi = i;
+          for (let w2 = 1, k = base; ; k += base) {
+            if (index >= inputLength) {
+              error("invalid-input");
+            }
+            const digit = basicToDigit(input.charCodeAt(index++));
+            if (digit >= base || digit > floor((maxInt - i) / w2)) {
+              error("overflow");
+            }
+            i += digit * w2;
+            const t2 = k <= bias ? tMin : k >= bias + tMax ? tMax : k - bias;
+            if (digit < t2) {
+              break;
+            }
+            const baseMinusT = base - t2;
+            if (w2 > floor(maxInt / baseMinusT)) {
+              error("overflow");
+            }
+            w2 *= baseMinusT;
+          }
+          const out = output.length + 1;
+          bias = adapt(i - oldi, out, oldi == 0);
+          if (floor(i / out) > maxInt - n2) {
+            error("overflow");
+          }
+          n2 += floor(i / out);
+          i %= out;
+          output.splice(i++, 0, n2);
+        }
+        return String.fromCodePoint(...output);
+      };
+      const encode = function (input) {
+        const output = [];
+        input = ucs2decode(input);
+        let inputLength = input.length;
+        let n2 = initialN;
+        let delta2 = 0;
+        let bias = initialBias;
+        for (const currentValue of input) {
+          if (currentValue < 128) {
+            output.push(stringFromCharCode(currentValue));
+          }
+        }
+        let basicLength = output.length;
+        let handledCPCount = basicLength;
+        if (basicLength) {
+          output.push(delimiter);
+        }
+        while (handledCPCount < inputLength) {
+          let m = maxInt;
+          for (const currentValue of input) {
+            if (currentValue >= n2 && currentValue < m) {
+              m = currentValue;
+            }
+          }
+          const handledCPCountPlusOne = handledCPCount + 1;
+          if (m - n2 > floor((maxInt - delta2) / handledCPCountPlusOne)) {
+            error("overflow");
+          }
+          delta2 += (m - n2) * handledCPCountPlusOne;
+          n2 = m;
+          for (const currentValue of input) {
+            if (currentValue < n2 && ++delta2 > maxInt) {
+              error("overflow");
+            }
+            if (currentValue == n2) {
+              let q2 = delta2;
+              for (let k = base; ; k += base) {
+                const t2 =
+                  k <= bias ? tMin : k >= bias + tMax ? tMax : k - bias;
+                if (q2 < t2) {
+                  break;
+                }
+                const qMinusT = q2 - t2;
+                const baseMinusT = base - t2;
+                output.push(
+                  stringFromCharCode(
+                    digitToBasic(t2 + (qMinusT % baseMinusT), 0)
+                  )
+                );
+                q2 = floor(qMinusT / baseMinusT);
+              }
+              output.push(stringFromCharCode(digitToBasic(q2, 0)));
+              bias = adapt(
+                delta2,
+                handledCPCountPlusOne,
+                handledCPCount == basicLength
+              );
+              delta2 = 0;
+              ++handledCPCount;
+            }
+          }
+          ++delta2;
+          ++n2;
+        }
+        return output.join("");
+      };
+      const toUnicode = function (input) {
+        return mapDomain(input, function (string2) {
+          return regexPunycode.test(string2)
+            ? decode(string2.slice(4).toLowerCase())
+            : string2;
+        });
+      };
+      const toASCII = function (input) {
+        return mapDomain(input, function (string2) {
+          return regexNonASCII.test(string2)
+            ? "xn--" + encode(string2)
+            : string2;
+        });
+      };
+      const punycode$1 = {
+        version: "2.1.0",
+        ucs2: {
+          decode: ucs2decode,
+          encode: ucs2encode,
+        },
+        decode: decode,
+        encode: encode,
+        toASCII: toASCII,
+        toUnicode: toUnicode,
+      };
+      var punycode_es6 = /* @__PURE__ */ Object.freeze({
+        __proto__: null,
+        [Symbol.toStringTag]: "Module",
+        ucs2decode,
+        ucs2encode,
+        decode,
+        encode,
+        toASCII,
+        toUnicode,
+        default: punycode$1,
+      });
+      var require$$8 = /* @__PURE__ */ getAugmentedNamespace(punycode_es6);
+      var _default$1 = {
+        options: {
+          html: false,
+          xhtmlOut: false,
+          breaks: false,
+          langPrefix: "language-",
+          linkify: false,
+          typographer: false,
+          quotes: "\u201C\u201D\u2018\u2019",
+          highlight: null,
+          maxNesting: 100,
+        },
+        components: {
+          core: {},
+          block: {},
+          inline: {},
+        },
+      };
+      var zero = {
+        options: {
+          html: false,
+          xhtmlOut: false,
+          breaks: false,
+          langPrefix: "language-",
+          linkify: false,
+          typographer: false,
+          quotes: "\u201C\u201D\u2018\u2019",
+          highlight: null,
+          maxNesting: 20,
+        },
+        components: {
+          core: {
+            rules: ["normalize", "block", "inline"],
+          },
+          block: {
+            rules: ["paragraph"],
+          },
+          inline: {
+            rules: ["text"],
+            rules2: ["balance_pairs", "text_collapse"],
+          },
+        },
+      };
+      var commonmark = {
+        options: {
+          html: true,
+          xhtmlOut: true,
+          breaks: false,
+          langPrefix: "language-",
+          linkify: false,
+          typographer: false,
+          quotes: "\u201C\u201D\u2018\u2019",
+          highlight: null,
+          maxNesting: 20,
+        },
+        components: {
+          core: {
+            rules: ["normalize", "block", "inline"],
+          },
+          block: {
+            rules: [
+              "blockquote",
+              "code",
+              "fence",
+              "heading",
+              "hr",
+              "html_block",
+              "lheading",
+              "list",
+              "reference",
+              "paragraph",
+            ],
+          },
+          inline: {
+            rules: [
+              "autolink",
+              "backticks",
+              "emphasis",
+              "entity",
+              "escape",
+              "html_inline",
+              "image",
+              "link",
+              "newline",
+              "text",
+            ],
+            rules2: ["balance_pairs", "emphasis", "text_collapse"],
+          },
+        },
+      };
+      var utils = utils$1;
+      var helpers = helpers$1;
+      var Renderer = renderer;
+      var ParserCore = parser_core;
+      var ParserBlock = parser_block;
+      var ParserInline = parser_inline;
+      var LinkifyIt = linkifyIt;
+      var mdurl = mdurl$1;
+      var punycode = require$$8;
+      var config = {
+        default: _default$1,
+        zero,
+        commonmark,
+      };
+      var BAD_PROTO_RE = /^(vbscript|javascript|file|data):/;
+      var GOOD_DATA_RE = /^data:image\/(gif|png|jpeg|webp);/;
+      function validateLink(url) {
+        var str = url.trim().toLowerCase();
+        return BAD_PROTO_RE.test(str)
+          ? GOOD_DATA_RE.test(str)
+            ? true
+            : false
+          : true;
+      }
+      var RECODE_HOSTNAME_FOR = ["http:", "https:", "mailto:"];
+      function normalizeLink(url) {
+        var parsed = mdurl.parse(url, true);
+        if (parsed.hostname) {
+          if (
+            !parsed.protocol ||
+            RECODE_HOSTNAME_FOR.indexOf(parsed.protocol) >= 0
+          ) {
+            try {
+              parsed.hostname = punycode.toASCII(parsed.hostname);
+            } catch (er) {}
+          }
+        }
+        return mdurl.encode(mdurl.format(parsed));
+      }
+      function normalizeLinkText(url) {
+        var parsed = mdurl.parse(url, true);
+        if (parsed.hostname) {
+          if (
+            !parsed.protocol ||
+            RECODE_HOSTNAME_FOR.indexOf(parsed.protocol) >= 0
+          ) {
+            try {
+              parsed.hostname = punycode.toUnicode(parsed.hostname);
+            } catch (er) {}
+          }
+        }
+        return mdurl.decode(
+          mdurl.format(parsed),
+          mdurl.decode.defaultChars + "%"
+        );
+      }
+      function MarkdownIt(presetName, options) {
+        if (!(this instanceof MarkdownIt)) {
+          return new MarkdownIt(presetName, options);
+        }
+        if (!options) {
+          if (!utils.isString(presetName)) {
+            options = presetName || {};
+            presetName = "default";
+          }
+        }
+        this.inline = new ParserInline();
+        this.block = new ParserBlock();
+        this.core = new ParserCore();
+        this.renderer = new Renderer();
+        this.linkify = new LinkifyIt();
+        this.validateLink = validateLink;
+        this.normalizeLink = normalizeLink;
+        this.normalizeLinkText = normalizeLinkText;
+        this.utils = utils;
+        this.helpers = utils.assign({}, helpers);
+        this.options = {};
+        this.configure(presetName);
+        if (options) {
+          this.set(options);
+        }
+      }
+      MarkdownIt.prototype.set = function (options) {
+        utils.assign(this.options, options);
+        return this;
+      };
+      MarkdownIt.prototype.configure = function (presets) {
+        var self2 = this,
+          presetName;
+        if (utils.isString(presets)) {
+          presetName = presets;
+          presets = config[presetName];
+          if (!presets) {
+            throw new Error(
+              'Wrong `markdown-it` preset "' + presetName + '", check name'
+            );
+          }
+        }
+        if (!presets) {
+          throw new Error("Wrong `markdown-it` preset, can't be empty");
+        }
+        if (presets.options) {
+          self2.set(presets.options);
+        }
+        if (presets.components) {
+          Object.keys(presets.components).forEach(function (name2) {
+            if (presets.components[name2].rules) {
+              self2[name2].ruler.enableOnly(presets.components[name2].rules);
+            }
+            if (presets.components[name2].rules2) {
+              self2[name2].ruler2.enableOnly(presets.components[name2].rules2);
+            }
+          });
+        }
+        return this;
+      };
+      MarkdownIt.prototype.enable = function (list3, ignoreInvalid) {
+        var result2 = [];
+        if (!Array.isArray(list3)) {
+          list3 = [list3];
+        }
+        ["core", "block", "inline"].forEach(function (chain) {
+          result2 = result2.concat(this[chain].ruler.enable(list3, true));
+        }, this);
+        result2 = result2.concat(this.inline.ruler2.enable(list3, true));
+        var missed = list3.filter(function (name2) {
+          return result2.indexOf(name2) < 0;
+        });
+        if (missed.length && !ignoreInvalid) {
+          throw new Error(
+            "MarkdownIt. Failed to enable unknown rule(s): " + missed
+          );
+        }
+        return this;
+      };
+      MarkdownIt.prototype.disable = function (list3, ignoreInvalid) {
+        var result2 = [];
+        if (!Array.isArray(list3)) {
+          list3 = [list3];
+        }
+        ["core", "block", "inline"].forEach(function (chain) {
+          result2 = result2.concat(this[chain].ruler.disable(list3, true));
+        }, this);
+        result2 = result2.concat(this.inline.ruler2.disable(list3, true));
+        var missed = list3.filter(function (name2) {
+          return result2.indexOf(name2) < 0;
+        });
+        if (missed.length && !ignoreInvalid) {
+          throw new Error(
+            "MarkdownIt. Failed to disable unknown rule(s): " + missed
+          );
+        }
+        return this;
+      };
+      MarkdownIt.prototype.use = function (plugin) {
+        var args = [this].concat(Array.prototype.slice.call(arguments, 1));
+        plugin.apply(plugin, args);
+        return this;
+      };
+      MarkdownIt.prototype.parse = function (src, env) {
+        if (typeof src !== "string") {
+          throw new Error("Input data should be a String");
+        }
+        var state = new this.core.State(src, this, env);
+        this.core.process(state);
+        return state.tokens;
+      };
+      MarkdownIt.prototype.render = function (src, env) {
+        env = env || {};
+        return this.renderer.render(this.parse(src, env), this.options, env);
+      };
+      MarkdownIt.prototype.parseInline = function (src, env) {
+        var state = new this.core.State(src, this, env);
+        state.inlineMode = true;
+        this.core.process(state);
+        return state.tokens;
+      };
+      MarkdownIt.prototype.renderInline = function (src, env) {
+        env = env || {};
+        return this.renderer.render(
+          this.parseInline(src, env),
+          this.options,
+          env
+        );
+      };
+      var lib = MarkdownIt;
+      var markdownIt = lib;
+      var invalidCharacters = Array.from({ length: 11 }, function (_, i) {
+        return String.fromCharCode(8192 + i);
+      }).concat(["\u2028", "\u2029", "\u202F", "\xA0"]);
+      var sanitizeRegex = new RegExp(
+        "[" + invalidCharacters.join("") + "]",
+        "g"
+      );
+      function normalizeWhitespace(line) {
+        return line.replace(sanitizeRegex, " ");
+      }
+      /*!
+       * escape-html
+       * Copyright(c) 2012-2013 TJ Holowaychuk
+       * Copyright(c) 2015 Andreas Lubbe
+       * Copyright(c) 2015 Tiancheng "Timothy" Gu
+       * MIT Licensed
+       */
+      var matchHtmlRegExp = /["'&<>]/;
+      var escapeHtml_1 = escapeHtml;
+      function escapeHtml(string2) {
+        var str = "" + string2;
+        var match2 = matchHtmlRegExp.exec(str);
+        if (!match2) {
+          return str;
+        }
+        var escape3;
+        var html = "";
+        var index = 0;
+        var lastIndex = 0;
+        for (index = match2.index; index < str.length; index++) {
+          switch (str.charCodeAt(index)) {
+            case 34:
+              escape3 = "&quot;";
+              break;
+            case 38:
+              escape3 = "&amp;";
+              break;
+            case 39:
+              escape3 = "&#39;";
+              break;
+            case 60:
+              escape3 = "&lt;";
+              break;
+            case 62:
+              escape3 = "&gt;";
+              break;
+            default:
+              continue;
+          }
+          if (lastIndex !== index) {
+            html += str.substring(lastIndex, index);
+          }
+          lastIndex = index + 1;
+          html += escape3;
+        }
+        return lastIndex !== index
+          ? html + str.substring(lastIndex, index)
+          : html;
+      }
+      var md$2 = new markdownIt();
+      function onHasCompletion(_cm, data, onHintInformationRender) {
+        Promise.resolve()
+          .then(function () {
+            return codemirror$1;
+          })
+          .then(function (_a2) {
+            var CodeMirror = _a2.default;
+            var information;
+            var deprecation;
+            CodeMirror.on(data, "select", function (ctx, el2) {
+              if (!information) {
+                var hintsUl_1 = el2.parentNode;
+                information = document.createElement("div");
+                information.className = "CodeMirror-hint-information";
+                hintsUl_1.appendChild(information);
+                deprecation = document.createElement("div");
+                deprecation.className = "CodeMirror-hint-deprecation";
+                hintsUl_1.appendChild(deprecation);
+                var onRemoveFn_1;
+                hintsUl_1.addEventListener(
+                  "DOMNodeRemoved",
+                  (onRemoveFn_1 = function (event) {
+                    if (event.target === hintsUl_1) {
+                      hintsUl_1.removeEventListener(
+                        "DOMNodeRemoved",
+                        onRemoveFn_1
+                      );
+                      information = null;
+                      deprecation = null;
+                      onRemoveFn_1 = null;
+                    }
+                  })
+                );
+              }
+              var description = ctx.description
+                ? md$2.render(ctx.description)
+                : "Self descriptive.";
+              var type2 = ctx.type
+                ? '<span class="infoType">' + renderType$2(ctx.type) + "</span>"
+                : "";
+              information.innerHTML =
+                '<div class="content">' +
+                (description.slice(0, 3) === "<p>"
+                  ? "<p>" + type2 + description.slice(3)
+                  : type2 + description) +
+                "</div>";
+              if (ctx && deprecation && ctx.deprecationReason) {
+                var reason = ctx.deprecationReason
+                  ? md$2.render(ctx.deprecationReason)
+                  : "";
+                deprecation.innerHTML =
+                  '<span class="deprecation-label">Deprecated</span>' + reason;
+                deprecation.style.display = "block";
+              } else if (deprecation) {
+                deprecation.style.display = "none";
+              }
+              if (onHintInformationRender) {
+                onHintInformationRender(information);
+              }
+            });
+          });
+      }
+      function renderType$2(type2) {
+        if (type2 instanceof GraphQLNonNull) {
+          return renderType$2(type2.ofType) + "!";
+        }
+        if (type2 instanceof GraphQLList) {
+          return "[" + renderType$2(type2.ofType) + "]";
+        }
+        return '<a class="typeName">' + escapeHtml_1(type2.name) + "</a>";
+      }
+      var _a;
+      var isMacOs = false;
+      if (typeof window === "object") {
+        isMacOs = window.navigator.platform === "MacIntel";
+      }
+      var commonKeys =
+        ((_a = {}),
+        (_a[isMacOs ? "Cmd-F" : "Ctrl-F"] = "findPersistent"),
+        (_a["Cmd-G"] = "findPersistent"),
+        (_a["Ctrl-G"] = "findPersistent"),
+        (_a["Ctrl-Left"] = "goSubwordLeft"),
+        (_a["Ctrl-Right"] = "goSubwordRight"),
+        (_a["Alt-Left"] = "goGroupLeft"),
+        (_a["Alt-Right"] = "goGroupRight"),
+        _a);
+      var __awaiter$6 =
+        (globalThis && globalThis.__awaiter) ||
+        function (thisArg, _arguments, P2, generator) {
+          function adopt(value) {
+            return value instanceof P2
+              ? value
+              : new P2(function (resolve) {
+                  resolve(value);
+                });
+          }
+          return new (P2 || (P2 = Promise))(function (resolve, reject2) {
+            function fulfilled(value) {
+              try {
+                step(generator.next(value));
+              } catch (e) {
+                reject2(e);
+              }
+            }
+            function rejected(value) {
+              try {
+                step(generator["throw"](value));
+              } catch (e) {
+                reject2(e);
+              }
+            }
+            function step(result2) {
+              result2.done
+                ? resolve(result2.value)
+                : adopt(result2.value).then(fulfilled, rejected);
+            }
+            step(
+              (generator = generator.apply(thisArg, _arguments || [])).next()
+            );
+          });
+        };
+      var __generator$6 =
+        (globalThis && globalThis.__generator) ||
+        function (thisArg, body) {
+          var _ = {
+              label: 0,
+              sent: function () {
+                if (t2[0] & 1) throw t2[1];
+                return t2[1];
+              },
+              trys: [],
+              ops: [],
+            },
+            f,
+            y2,
+            t2,
+            g;
+          return (
+            (g = { next: verb(0), throw: verb(1), return: verb(2) }),
+            typeof Symbol === "function" &&
+              (g[Symbol.iterator] = function () {
+                return this;
+              }),
+            g
+          );
+          function verb(n2) {
+            return function (v2) {
+              return step([n2, v2]);
+            };
+          }
+          function step(op) {
+            if (f) throw new TypeError("Generator is already executing.");
+            while (_)
+              try {
+                if (
+                  ((f = 1),
+                  y2 &&
+                    (t2 =
+                      op[0] & 2
+                        ? y2["return"]
+                        : op[0]
+                        ? y2["throw"] || ((t2 = y2["return"]) && t2.call(y2), 0)
+                        : y2.next) &&
+                    !(t2 = t2.call(y2, op[1])).done)
+                )
+                  return t2;
+                if (((y2 = 0), t2)) op = [op[0] & 2, t2.value];
+                switch (op[0]) {
+                  case 0:
+                  case 1:
+                    t2 = op;
+                    break;
+                  case 4:
+                    _.label++;
+                    return { value: op[1], done: false };
+                  case 5:
+                    _.label++;
+                    y2 = op[1];
+                    op = [0];
+                    continue;
+                  case 7:
+                    op = _.ops.pop();
+                    _.trys.pop();
+                    continue;
+                  default:
+                    if (
+                      !((t2 = _.trys),
+                      (t2 = t2.length > 0 && t2[t2.length - 1])) &&
+                      (op[0] === 6 || op[0] === 2)
+                    ) {
+                      _ = 0;
+                      continue;
+                    }
+                    if (
+                      op[0] === 3 &&
+                      (!t2 || (op[1] > t2[0] && op[1] < t2[3]))
+                    ) {
+                      _.label = op[1];
+                      break;
+                    }
+                    if (op[0] === 6 && _.label < t2[1]) {
+                      _.label = t2[1];
+                      t2 = op;
+                      break;
+                    }
+                    if (t2 && _.label < t2[2]) {
+                      _.label = t2[2];
+                      _.ops.push(op);
+                      break;
+                    }
+                    if (t2[2]) _.ops.pop();
+                    _.trys.pop();
+                    continue;
+                }
+                op = body.call(thisArg, _);
+              } catch (e) {
+                op = [6, e];
+                y2 = 0;
+              } finally {
+                f = t2 = 0;
+              }
+            if (op[0] & 5) throw op[1];
+            return { value: op[0] ? op[1] : void 0, done: true };
+          }
+        };
+      var commonCodeMirrorAddons = [
+        Promise.resolve().then(function () {
+          return showHint$1;
+        }),
+        Promise.resolve().then(function () {
+          return matchbrackets$1;
+        }),
+        Promise.resolve().then(function () {
+          return closebrackets$1;
+        }),
+        Promise.resolve().then(function () {
+          return braceFold$1;
+        }),
+        Promise.resolve().then(function () {
+          return foldgutter$1;
+        }),
+        Promise.resolve().then(function () {
+          return lint$5;
+        }),
+        Promise.resolve().then(function () {
+          return searchcursor$1;
+        }),
+        Promise.resolve().then(function () {
+          return jumpToLine$1;
+        }),
+        Promise.resolve().then(function () {
+          return dialog$1;
+        }),
+        Promise.resolve().then(function () {
+          return sublime$1;
+        }),
+      ];
+      function importCodeMirror(addons, options) {
+        return __awaiter$6(this, void 0, void 0, function () {
+          var CodeMirror, allAddons;
+          return __generator$6(this, function (_a2) {
+            switch (_a2.label) {
+              case 0:
+                return [
+                  4,
+                  Promise.resolve().then(function () {
+                    return codemirror$1;
+                  }),
+                ];
+              case 1:
+                CodeMirror = _a2.sent().default;
+                allAddons =
+                  (options === null || options === void 0
+                    ? void 0
+                    : options.useCommonAddons) === false
+                    ? addons
+                    : commonCodeMirrorAddons.concat(addons);
+                return [
+                  4,
+                  Promise.all(
+                    allAddons.map(function (addon) {
+                      return addon;
+                    })
+                  ),
+                ];
+              case 2:
+                _a2.sent();
+                return [2, CodeMirror];
+            }
+          });
+        });
+      }
+      var __extends$b =
+        (globalThis && globalThis.__extends) ||
+        (function () {
+          var extendStatics = function (d, b) {
+            extendStatics =
+              Object.setPrototypeOf ||
+              ({ __proto__: [] } instanceof Array &&
+                function (d2, b2) {
+                  d2.__proto__ = b2;
+                }) ||
+              function (d2, b2) {
+                for (var p2 in b2)
+                  if (Object.prototype.hasOwnProperty.call(b2, p2))
+                    d2[p2] = b2[p2];
+              };
+            return extendStatics(d, b);
+          };
+          return function (d, b) {
+            extendStatics(d, b);
+            function __() {
+              this.constructor = d;
+            }
+            d.prototype =
+              b === null
+                ? Object.create(b)
+                : ((__.prototype = b.prototype), new __());
+          };
+        })();
+      var __assign$a =
+        (globalThis && globalThis.__assign) ||
+        function () {
+          __assign$a =
+            Object.assign ||
+            function (t2) {
+              for (var s, i = 1, n2 = arguments.length; i < n2; i++) {
+                s = arguments[i];
+                for (var p2 in s)
+                  if (Object.prototype.hasOwnProperty.call(s, p2))
+                    t2[p2] = s[p2];
+              }
+              return t2;
+            };
+          return __assign$a.apply(this, arguments);
+        };
+      var __awaiter$5 =
+        (globalThis && globalThis.__awaiter) ||
+        function (thisArg, _arguments, P2, generator) {
+          function adopt(value) {
+            return value instanceof P2
+              ? value
+              : new P2(function (resolve) {
+                  resolve(value);
+                });
+          }
+          return new (P2 || (P2 = Promise))(function (resolve, reject2) {
+            function fulfilled(value) {
+              try {
+                step(generator.next(value));
+              } catch (e) {
+                reject2(e);
+              }
+            }
+            function rejected(value) {
+              try {
+                step(generator["throw"](value));
+              } catch (e) {
+                reject2(e);
+              }
+            }
+            function step(result2) {
+              result2.done
+                ? resolve(result2.value)
+                : adopt(result2.value).then(fulfilled, rejected);
+            }
+            step(
+              (generator = generator.apply(thisArg, _arguments || [])).next()
+            );
+          });
+        };
+      var __generator$5 =
+        (globalThis && globalThis.__generator) ||
+        function (thisArg, body) {
+          var _ = {
+              label: 0,
+              sent: function () {
+                if (t2[0] & 1) throw t2[1];
+                return t2[1];
+              },
+              trys: [],
+              ops: [],
+            },
+            f,
+            y2,
+            t2,
+            g;
+          return (
+            (g = { next: verb(0), throw: verb(1), return: verb(2) }),
+            typeof Symbol === "function" &&
+              (g[Symbol.iterator] = function () {
+                return this;
+              }),
+            g
+          );
+          function verb(n2) {
+            return function (v2) {
+              return step([n2, v2]);
+            };
+          }
+          function step(op) {
+            if (f) throw new TypeError("Generator is already executing.");
+            while (_)
+              try {
+                if (
+                  ((f = 1),
+                  y2 &&
+                    (t2 =
+                      op[0] & 2
+                        ? y2["return"]
+                        : op[0]
+                        ? y2["throw"] || ((t2 = y2["return"]) && t2.call(y2), 0)
+                        : y2.next) &&
+                    !(t2 = t2.call(y2, op[1])).done)
+                )
+                  return t2;
+                if (((y2 = 0), t2)) op = [op[0] & 2, t2.value];
+                switch (op[0]) {
+                  case 0:
+                  case 1:
+                    t2 = op;
+                    break;
+                  case 4:
+                    _.label++;
+                    return { value: op[1], done: false };
+                  case 5:
+                    _.label++;
+                    y2 = op[1];
+                    op = [0];
+                    continue;
+                  case 7:
+                    op = _.ops.pop();
+                    _.trys.pop();
+                    continue;
+                  default:
+                    if (
+                      !((t2 = _.trys),
+                      (t2 = t2.length > 0 && t2[t2.length - 1])) &&
+                      (op[0] === 6 || op[0] === 2)
+                    ) {
+                      _ = 0;
+                      continue;
+                    }
+                    if (
+                      op[0] === 3 &&
+                      (!t2 || (op[1] > t2[0] && op[1] < t2[3]))
+                    ) {
+                      _.label = op[1];
+                      break;
+                    }
+                    if (op[0] === 6 && _.label < t2[1]) {
+                      _.label = t2[1];
+                      t2 = op;
+                      break;
+                    }
+                    if (t2 && _.label < t2[2]) {
+                      _.label = t2[2];
+                      _.ops.push(op);
+                      break;
+                    }
+                    if (t2[2]) _.ops.pop();
+                    _.trys.pop();
+                    continue;
+                }
+                op = body.call(thisArg, _);
+              } catch (e) {
+                op = [6, e];
+                y2 = 0;
+              } finally {
+                f = t2 = 0;
+              }
+            if (op[0] & 5) throw op[1];
+            return { value: op[0] ? op[1] : void 0, done: true };
+          }
+        };
+      var md$1 = new markdownIt();
+      var AUTO_COMPLETE_AFTER_KEY = /^[a-zA-Z0-9_@(]$/;
+      var QueryEditor = (function (_super2) {
+        __extends$b(QueryEditor2, _super2);
+        function QueryEditor2(props) {
+          var _this = _super2.call(this, props) || this;
+          _this.editor = null;
+          _this.ignoreChangeEvent = false;
+          _this._node = null;
+          _this.addonModules = function () {
+            return [
+              Promise.resolve().then(function () {
+                return comment$1;
+              }),
+              Promise.resolve().then(function () {
+                return search$1;
+              }),
+              Promise.resolve().then(function () {
+                return hint$2;
+              }),
+              Promise.resolve().then(function () {
+                return lint$2;
+              }),
+              Promise.resolve().then(function () {
+                return info;
+              }),
+              Promise.resolve().then(function () {
+                return jump;
+              }),
+              Promise.resolve().then(function () {
+                return mode$4;
+              }),
+            ];
+          };
+          _this._onKeyUp = function (_cm, event) {
+            if (AUTO_COMPLETE_AFTER_KEY.test(event.key) && _this.editor) {
+              _this.editor.execCommand("autocomplete");
+            }
+          };
+          _this._onEdit = function () {
+            if (!_this.ignoreChangeEvent && _this.editor) {
+              _this.cachedValue = _this.editor.getValue();
+              if (_this.props.onEdit) {
+                _this.props.onEdit(_this.cachedValue);
+              }
+            }
+          };
+          _this._onHasCompletion = function (cm, data) {
+            onHasCompletion(cm, data, _this.props.onHintInformationRender);
+          };
+          _this.cachedValue = props.value || "";
+          return _this;
+        }
+        QueryEditor2.prototype.componentDidMount = function () {
+          var _this = this;
+          this.initializeEditor()
+            .then(function (editor) {
+              if (editor) {
+                editor.on("change", _this._onEdit);
+                editor.on("keyup", _this._onKeyUp);
+                editor.on("hasCompletion", _this._onHasCompletion);
+                editor.on("beforeChange", _this._onBeforeChange);
+              }
+            })
+            .catch(console.error);
+        };
+        QueryEditor2.prototype.componentDidUpdate = function (prevProps) {
+          this.ignoreChangeEvent = true;
+          var signalChange = false;
+          if (this.props.schema !== prevProps.schema && this.editor) {
+            this.editor.options.lint.schema = this.props.schema;
+            this.editor.options.hintOptions.schema = this.props.schema;
+            this.editor.options.info.schema = this.props.schema;
+            this.editor.options.jump.schema = this.props.schema;
+            signalChange = true;
+          }
+          if (
+            this.props.externalFragments !== prevProps.externalFragments &&
+            this.editor
+          ) {
+            this.editor.options.lint.externalFragments =
+              this.props.externalFragments;
+            this.editor.options.hintOptions.externalFragments =
+              this.props.externalFragments;
+            signalChange = true;
+          }
+          if (signalChange) {
+            this.CodeMirror.signal(this.editor, "change", this.editor);
+          }
+          if (
+            this.props.value !== prevProps.value &&
+            this.props.value !== this.cachedValue &&
+            this.editor
+          ) {
+            this.cachedValue = this.props.value;
+            this.editor.setValue(this.props.value);
+          }
+          this.ignoreChangeEvent = false;
+        };
+        QueryEditor2.prototype.componentWillUnmount = function () {
+          if (this.editor) {
+            this.editor.off("change", this._onEdit);
+            this.editor.off("keyup", this._onKeyUp);
+            this.editor.off("hasCompletion", this._onHasCompletion);
+          }
+        };
+        QueryEditor2.prototype.render = function () {
+          var _this = this;
+          return React$1.createElement("section", {
+            className: "query-editor",
+            "aria-label": "Query Editor",
+            ref: function (node) {
+              _this._node = node;
+            },
+          });
+        };
+        QueryEditor2.prototype.initializeEditor = function () {
+          var _a2, _b, _c, _d;
+          return __awaiter$5(this, void 0, void 0, function () {
+            var CodeMirror, _e, editor;
+            var _this = this;
+            return __generator$5(this, function (_f) {
+              switch (_f.label) {
+                case 0:
+                  _e = this;
+                  return [4, importCodeMirror(this.addonModules())];
+                case 1:
+                  CodeMirror = _e.CodeMirror = _f.sent();
+                  editor = this.editor = CodeMirror(this._node, {
+                    value:
+                      (_a2 = this.props.value) !== null && _a2 !== void 0
+                        ? _a2
+                        : "",
+                    lineNumbers: true,
+                    tabSize: 2,
+                    foldGutter: {
+                      minFoldSize: 4,
+                    },
+                    mode: "graphql",
+                    theme: this.props.editorTheme || "graphiql",
+                    keyMap: "sublime",
+                    autoCloseBrackets: true,
+                    matchBrackets: true,
+                    showCursorWhenSelecting: true,
+                    readOnly: this.props.readOnly ? "nocursor" : false,
+                    lint: {
+                      schema: this.props.schema,
+                      validationRules:
+                        (_b = this.props.validationRules) !== null &&
+                        _b !== void 0
+                          ? _b
+                          : null,
+                      externalFragments:
+                        (_c = this.props) === null || _c === void 0
+                          ? void 0
+                          : _c.externalFragments,
+                    },
+                    hintOptions: {
+                      schema: this.props.schema,
+                      closeOnUnfocus: false,
+                      completeSingle: false,
+                      container: this._node,
+                      externalFragments:
+                        (_d = this.props) === null || _d === void 0
+                          ? void 0
+                          : _d.externalFragments,
+                    },
+                    info: {
+                      schema: this.props.schema,
+                      renderDescription: function (text3) {
+                        return md$1.render(text3);
+                      },
+                      onClick: function (reference3) {
+                        return (
+                          _this.props.onClickReference &&
+                          _this.props.onClickReference(reference3)
+                        );
+                      },
+                    },
+                    jump: {
+                      schema: this.props.schema,
+                      onClick: function (reference3) {
+                        return (
+                          _this.props.onClickReference &&
+                          _this.props.onClickReference(reference3)
+                        );
+                      },
+                    },
+                    gutters: [
+                      "CodeMirror-linenumbers",
+                      "CodeMirror-foldgutter",
+                    ],
+                    extraKeys: __assign$a(
+                      __assign$a(
+                        {
+                          "Cmd-Space": function () {
+                            return editor.showHint({
+                              completeSingle: true,
+                              container: _this._node,
+                            });
+                          },
+                          "Ctrl-Space": function () {
+                            return editor.showHint({
+                              completeSingle: true,
+                              container: _this._node,
+                            });
+                          },
+                          "Alt-Space": function () {
+                            return editor.showHint({
+                              completeSingle: true,
+                              container: _this._node,
+                            });
+                          },
+                          "Shift-Space": function () {
+                            return editor.showHint({
+                              completeSingle: true,
+                              container: _this._node,
+                            });
+                          },
+                          "Shift-Alt-Space": function () {
+                            return editor.showHint({
+                              completeSingle: true,
+                              container: _this._node,
+                            });
+                          },
+                          "Cmd-Enter": function () {
+                            if (_this.props.onRunQuery) {
+                              _this.props.onRunQuery();
+                            }
+                          },
+                          "Ctrl-Enter": function () {
+                            if (_this.props.onRunQuery) {
+                              _this.props.onRunQuery();
+                            }
+                          },
+                          "Shift-Ctrl-C": function () {
+                            if (_this.props.onCopyQuery) {
+                              _this.props.onCopyQuery();
+                            }
+                          },
+                          "Shift-Ctrl-P": function () {
+                            if (_this.props.onPrettifyQuery) {
+                              _this.props.onPrettifyQuery();
+                            }
+                          },
+                          "Shift-Ctrl-F": function () {
+                            if (_this.props.onPrettifyQuery) {
+                              _this.props.onPrettifyQuery();
+                            }
+                          },
+                          "Shift-Ctrl-M": function () {
+                            if (_this.props.onMergeQuery) {
+                              _this.props.onMergeQuery();
+                            }
+                          },
+                        },
+                        commonKeys
+                      ),
+                      {
+                        "Cmd-S": function () {
+                          if (_this.props.onRunQuery);
+                        },
+                        "Ctrl-S": function () {
+                          if (_this.props.onRunQuery);
+                        },
+                      }
+                    ),
+                  });
+                  return [2, editor];
+              }
+            });
+          });
+        };
+        QueryEditor2.prototype.getCodeMirror = function () {
+          return this.editor;
+        };
+        QueryEditor2.prototype.getClientHeight = function () {
+          return this._node && this._node.clientHeight;
+        };
+        QueryEditor2.prototype._onBeforeChange = function (_instance, change) {
+          if (change.origin === "paste") {
+            var text3 = change.text.map(normalizeWhitespace);
+            change.update(change.from, change.to, text3);
+          }
+        };
+        return QueryEditor2;
+      })(React$1.Component);
+      var __extends$a =
+        (globalThis && globalThis.__extends) ||
+        (function () {
+          var extendStatics = function (d, b) {
+            extendStatics =
+              Object.setPrototypeOf ||
+              ({ __proto__: [] } instanceof Array &&
+                function (d2, b2) {
+                  d2.__proto__ = b2;
+                }) ||
+              function (d2, b2) {
+                for (var p2 in b2)
+                  if (Object.prototype.hasOwnProperty.call(b2, p2))
+                    d2[p2] = b2[p2];
+              };
+            return extendStatics(d, b);
+          };
+          return function (d, b) {
+            extendStatics(d, b);
+            function __() {
+              this.constructor = d;
+            }
+            d.prototype =
+              b === null
+                ? Object.create(b)
+                : ((__.prototype = b.prototype), new __());
+          };
+        })();
+      var __assign$9 =
+        (globalThis && globalThis.__assign) ||
+        function () {
+          __assign$9 =
+            Object.assign ||
+            function (t2) {
+              for (var s, i = 1, n2 = arguments.length; i < n2; i++) {
+                s = arguments[i];
+                for (var p2 in s)
+                  if (Object.prototype.hasOwnProperty.call(s, p2))
+                    t2[p2] = s[p2];
+              }
+              return t2;
+            };
+          return __assign$9.apply(this, arguments);
+        };
+      var __awaiter$4 =
+        (globalThis && globalThis.__awaiter) ||
+        function (thisArg, _arguments, P2, generator) {
+          function adopt(value) {
+            return value instanceof P2
+              ? value
+              : new P2(function (resolve) {
+                  resolve(value);
+                });
+          }
+          return new (P2 || (P2 = Promise))(function (resolve, reject2) {
+            function fulfilled(value) {
+              try {
+                step(generator.next(value));
+              } catch (e) {
+                reject2(e);
+              }
+            }
+            function rejected(value) {
+              try {
+                step(generator["throw"](value));
+              } catch (e) {
+                reject2(e);
+              }
+            }
+            function step(result2) {
+              result2.done
+                ? resolve(result2.value)
+                : adopt(result2.value).then(fulfilled, rejected);
+            }
+            step(
+              (generator = generator.apply(thisArg, _arguments || [])).next()
+            );
+          });
+        };
+      var __generator$4 =
+        (globalThis && globalThis.__generator) ||
+        function (thisArg, body) {
+          var _ = {
+              label: 0,
+              sent: function () {
+                if (t2[0] & 1) throw t2[1];
+                return t2[1];
+              },
+              trys: [],
+              ops: [],
+            },
+            f,
+            y2,
+            t2,
+            g;
+          return (
+            (g = { next: verb(0), throw: verb(1), return: verb(2) }),
+            typeof Symbol === "function" &&
+              (g[Symbol.iterator] = function () {
+                return this;
+              }),
+            g
+          );
+          function verb(n2) {
+            return function (v2) {
+              return step([n2, v2]);
+            };
+          }
+          function step(op) {
+            if (f) throw new TypeError("Generator is already executing.");
+            while (_)
+              try {
+                if (
+                  ((f = 1),
+                  y2 &&
+                    (t2 =
+                      op[0] & 2
+                        ? y2["return"]
+                        : op[0]
+                        ? y2["throw"] || ((t2 = y2["return"]) && t2.call(y2), 0)
+                        : y2.next) &&
+                    !(t2 = t2.call(y2, op[1])).done)
+                )
+                  return t2;
+                if (((y2 = 0), t2)) op = [op[0] & 2, t2.value];
+                switch (op[0]) {
+                  case 0:
+                  case 1:
+                    t2 = op;
+                    break;
+                  case 4:
+                    _.label++;
+                    return { value: op[1], done: false };
+                  case 5:
+                    _.label++;
+                    y2 = op[1];
+                    op = [0];
+                    continue;
+                  case 7:
+                    op = _.ops.pop();
+                    _.trys.pop();
+                    continue;
+                  default:
+                    if (
+                      !((t2 = _.trys),
+                      (t2 = t2.length > 0 && t2[t2.length - 1])) &&
+                      (op[0] === 6 || op[0] === 2)
+                    ) {
+                      _ = 0;
+                      continue;
+                    }
+                    if (
+                      op[0] === 3 &&
+                      (!t2 || (op[1] > t2[0] && op[1] < t2[3]))
+                    ) {
+                      _.label = op[1];
+                      break;
+                    }
+                    if (op[0] === 6 && _.label < t2[1]) {
+                      _.label = t2[1];
+                      t2 = op;
+                      break;
+                    }
+                    if (t2 && _.label < t2[2]) {
+                      _.label = t2[2];
+                      _.ops.push(op);
+                      break;
+                    }
+                    if (t2[2]) _.ops.pop();
+                    _.trys.pop();
+                    continue;
+                }
+                op = body.call(thisArg, _);
+              } catch (e) {
+                op = [6, e];
+                y2 = 0;
+              } finally {
+                f = t2 = 0;
+              }
+            if (op[0] & 5) throw op[1];
+            return { value: op[0] ? op[1] : void 0, done: true };
+          }
+        };
+      var VariableEditor = (function (_super2) {
+        __extends$a(VariableEditor2, _super2);
+        function VariableEditor2(props) {
+          var _this = _super2.call(this, props) || this;
+          _this.editor = null;
+          _this._node = null;
+          _this.ignoreChangeEvent = false;
+          _this.addonModules = function () {
+            return [
+              Promise.resolve().then(function () {
+                return hint;
+              }),
+              Promise.resolve().then(function () {
+                return lint;
+              }),
+              Promise.resolve().then(function () {
+                return mode$2;
+              }),
+            ];
+          };
+          _this._onKeyUp = function (_cm, event) {
+            var code3 = event.keyCode;
+            if (!_this.editor) {
+              return;
+            }
+            if (
+              (code3 >= 65 && code3 <= 90) ||
+              (!event.shiftKey && code3 >= 48 && code3 <= 57) ||
+              (event.shiftKey && code3 === 189) ||
+              (event.shiftKey && code3 === 222)
+            ) {
+              _this.editor.execCommand("autocomplete");
+            }
+          };
+          _this._onEdit = function () {
+            if (!_this.editor) {
+              return;
+            }
+            if (!_this.ignoreChangeEvent) {
+              _this.cachedValue = _this.editor.getValue();
+              if (_this.props.onEdit) {
+                _this.props.onEdit(_this.cachedValue);
+              }
+            }
+          };
+          _this._onHasCompletion = function (instance, changeObj) {
+            onHasCompletion(
+              instance,
+              changeObj,
+              _this.props.onHintInformationRender
+            );
+          };
+          _this.cachedValue = props.value || "";
+          return _this;
+        }
+        VariableEditor2.prototype.componentDidMount = function () {
+          var _this = this;
+          this.initializeEditor()
+            .then(function (editor) {
+              editor.on("change", _this._onEdit);
+              editor.on("keyup", _this._onKeyUp);
+              editor.on("hasCompletion", _this._onHasCompletion);
+            })
+            .catch(console.error);
+        };
+        VariableEditor2.prototype.componentDidUpdate = function (prevProps) {
+          if (!this.editor) {
+            return;
+          }
+          if (!this.CodeMirror) {
+            return;
+          }
+          this.ignoreChangeEvent = true;
+          if (this.props.variableToType !== prevProps.variableToType) {
+            this.editor.options.lint.variableToType = this.props.variableToType;
+            this.editor.options.hintOptions.variableToType =
+              this.props.variableToType;
+            this.CodeMirror.signal(this.editor, "change", this.editor);
+          }
+          if (
+            this.props.value !== prevProps.value &&
+            this.props.value !== this.cachedValue
+          ) {
+            var thisValue = this.props.value || "";
+            this.cachedValue = thisValue;
+            this.editor.setValue(thisValue);
+          }
+          this.ignoreChangeEvent = false;
+        };
+        VariableEditor2.prototype.componentWillUnmount = function () {
+          if (!this.editor) {
+            return;
+          }
+          this.editor.off("change", this._onEdit);
+          this.editor.off("keyup", this._onKeyUp);
+          this.editor.off("hasCompletion", this._onHasCompletion);
+          this.editor = null;
+        };
+        VariableEditor2.prototype.render = function () {
+          var _this = this;
+          return React$1.createElement("div", {
+            className: "codemirrorWrap",
+            style: {
+              position: this.props.active ? "relative" : "absolute",
+              visibility: this.props.active ? "visible" : "hidden",
+            },
+            ref: function (node) {
+              _this._node = node;
+            },
+          });
+        };
+        VariableEditor2.prototype.initializeEditor = function () {
+          return __awaiter$4(this, void 0, void 0, function () {
+            var _a2, editor;
+            var _this = this;
+            return __generator$4(this, function (_b) {
+              switch (_b.label) {
+                case 0:
+                  _a2 = this;
+                  return [4, importCodeMirror(this.addonModules())];
+                case 1:
+                  _a2.CodeMirror = _b.sent();
+                  editor = this.editor = this.CodeMirror(this._node, {
+                    value: this.props.value || "",
+                    lineNumbers: true,
+                    tabSize: 2,
+                    mode: "graphql-variables",
+                    theme: this.props.editorTheme || "graphiql",
+                    keyMap: "sublime",
+                    autoCloseBrackets: true,
+                    matchBrackets: true,
+                    showCursorWhenSelecting: true,
+                    readOnly: this.props.readOnly ? "nocursor" : false,
+                    foldGutter: {
+                      minFoldSize: 4,
+                    },
+                    lint: {
+                      variableToType: this.props.variableToType,
+                    },
+                    hintOptions: {
+                      variableToType: this.props.variableToType,
+                      closeOnUnfocus: false,
+                      completeSingle: false,
+                      container: this._node,
+                    },
+                    gutters: [
+                      "CodeMirror-linenumbers",
+                      "CodeMirror-foldgutter",
+                    ],
+                    extraKeys: __assign$9(
+                      {
+                        "Cmd-Space": function () {
+                          return _this.editor.showHint({
+                            completeSingle: false,
+                            container: _this._node,
+                          });
+                        },
+                        "Ctrl-Space": function () {
+                          return _this.editor.showHint({
+                            completeSingle: false,
+                            container: _this._node,
+                          });
+                        },
+                        "Alt-Space": function () {
+                          return _this.editor.showHint({
+                            completeSingle: false,
+                            container: _this._node,
+                          });
+                        },
+                        "Shift-Space": function () {
+                          return _this.editor.showHint({
+                            completeSingle: false,
+                            container: _this._node,
+                          });
+                        },
+                        "Cmd-Enter": function () {
+                          if (_this.props.onRunQuery) {
+                            _this.props.onRunQuery();
+                          }
+                        },
+                        "Ctrl-Enter": function () {
+                          if (_this.props.onRunQuery) {
+                            _this.props.onRunQuery();
+                          }
+                        },
+                        "Shift-Ctrl-P": function () {
+                          if (_this.props.onPrettifyQuery) {
+                            _this.props.onPrettifyQuery();
+                          }
+                        },
+                        "Shift-Ctrl-M": function () {
+                          if (_this.props.onMergeQuery) {
+                            _this.props.onMergeQuery();
+                          }
+                        },
+                      },
+                      commonKeys
+                    ),
+                  });
+                  return [2, editor];
+              }
+            });
+          });
+        };
+        VariableEditor2.prototype.getCodeMirror = function () {
+          return this.editor;
+        };
+        VariableEditor2.prototype.getClientHeight = function () {
+          return this._node && this._node.clientHeight;
+        };
+        return VariableEditor2;
+      })(React$1.Component);
+      var __extends$9 =
+        (globalThis && globalThis.__extends) ||
+        (function () {
+          var extendStatics = function (d, b) {
+            extendStatics =
+              Object.setPrototypeOf ||
+              ({ __proto__: [] } instanceof Array &&
+                function (d2, b2) {
+                  d2.__proto__ = b2;
+                }) ||
+              function (d2, b2) {
+                for (var p2 in b2)
+                  if (Object.prototype.hasOwnProperty.call(b2, p2))
+                    d2[p2] = b2[p2];
+              };
+            return extendStatics(d, b);
+          };
+          return function (d, b) {
+            extendStatics(d, b);
+            function __() {
+              this.constructor = d;
+            }
+            d.prototype =
+              b === null
+                ? Object.create(b)
+                : ((__.prototype = b.prototype), new __());
+          };
+        })();
+      var __assign$8 =
+        (globalThis && globalThis.__assign) ||
+        function () {
+          __assign$8 =
+            Object.assign ||
+            function (t2) {
+              for (var s, i = 1, n2 = arguments.length; i < n2; i++) {
+                s = arguments[i];
+                for (var p2 in s)
+                  if (Object.prototype.hasOwnProperty.call(s, p2))
+                    t2[p2] = s[p2];
+              }
+              return t2;
+            };
+          return __assign$8.apply(this, arguments);
+        };
+      var __awaiter$3 =
+        (globalThis && globalThis.__awaiter) ||
+        function (thisArg, _arguments, P2, generator) {
+          function adopt(value) {
+            return value instanceof P2
+              ? value
+              : new P2(function (resolve) {
+                  resolve(value);
+                });
+          }
+          return new (P2 || (P2 = Promise))(function (resolve, reject2) {
+            function fulfilled(value) {
+              try {
+                step(generator.next(value));
+              } catch (e) {
+                reject2(e);
+              }
+            }
+            function rejected(value) {
+              try {
+                step(generator["throw"](value));
+              } catch (e) {
+                reject2(e);
+              }
+            }
+            function step(result2) {
+              result2.done
+                ? resolve(result2.value)
+                : adopt(result2.value).then(fulfilled, rejected);
+            }
+            step(
+              (generator = generator.apply(thisArg, _arguments || [])).next()
+            );
+          });
+        };
+      var __generator$3 =
+        (globalThis && globalThis.__generator) ||
+        function (thisArg, body) {
+          var _ = {
+              label: 0,
+              sent: function () {
+                if (t2[0] & 1) throw t2[1];
+                return t2[1];
+              },
+              trys: [],
+              ops: [],
+            },
+            f,
+            y2,
+            t2,
+            g;
+          return (
+            (g = { next: verb(0), throw: verb(1), return: verb(2) }),
+            typeof Symbol === "function" &&
+              (g[Symbol.iterator] = function () {
+                return this;
+              }),
+            g
+          );
+          function verb(n2) {
+            return function (v2) {
+              return step([n2, v2]);
+            };
+          }
+          function step(op) {
+            if (f) throw new TypeError("Generator is already executing.");
+            while (_)
+              try {
+                if (
+                  ((f = 1),
+                  y2 &&
+                    (t2 =
+                      op[0] & 2
+                        ? y2["return"]
+                        : op[0]
+                        ? y2["throw"] || ((t2 = y2["return"]) && t2.call(y2), 0)
+                        : y2.next) &&
+                    !(t2 = t2.call(y2, op[1])).done)
+                )
+                  return t2;
+                if (((y2 = 0), t2)) op = [op[0] & 2, t2.value];
+                switch (op[0]) {
+                  case 0:
+                  case 1:
+                    t2 = op;
+                    break;
+                  case 4:
+                    _.label++;
+                    return { value: op[1], done: false };
+                  case 5:
+                    _.label++;
+                    y2 = op[1];
+                    op = [0];
+                    continue;
+                  case 7:
+                    op = _.ops.pop();
+                    _.trys.pop();
+                    continue;
+                  default:
+                    if (
+                      !((t2 = _.trys),
+                      (t2 = t2.length > 0 && t2[t2.length - 1])) &&
+                      (op[0] === 6 || op[0] === 2)
+                    ) {
+                      _ = 0;
+                      continue;
+                    }
+                    if (
+                      op[0] === 3 &&
+                      (!t2 || (op[1] > t2[0] && op[1] < t2[3]))
+                    ) {
+                      _.label = op[1];
+                      break;
+                    }
+                    if (op[0] === 6 && _.label < t2[1]) {
+                      _.label = t2[1];
+                      t2 = op;
+                      break;
+                    }
+                    if (t2 && _.label < t2[2]) {
+                      _.label = t2[2];
+                      _.ops.push(op);
+                      break;
+                    }
+                    if (t2[2]) _.ops.pop();
+                    _.trys.pop();
+                    continue;
+                }
+                op = body.call(thisArg, _);
+              } catch (e) {
+                op = [6, e];
+                y2 = 0;
+              } finally {
+                f = t2 = 0;
+              }
+            if (op[0] & 5) throw op[1];
+            return { value: op[0] ? op[1] : void 0, done: true };
+          }
+        };
+      var HeaderEditor = (function (_super2) {
+        __extends$9(HeaderEditor2, _super2);
+        function HeaderEditor2(props) {
+          var _this = _super2.call(this, props) || this;
+          _this.editor = null;
+          _this._node = null;
+          _this.ignoreChangeEvent = false;
+          _this.addonModules = function () {
+            return [
+              Promise.resolve().then(function () {
+                return javascript$1;
+              }),
+            ];
+          };
+          _this._onKeyUp = function (_cm, event) {
+            var code3 = event.keyCode;
+            if (!_this.editor) {
+              return;
+            }
+            if (
+              (code3 >= 65 && code3 <= 90) ||
+              (!event.shiftKey && code3 >= 48 && code3 <= 57) ||
+              (event.shiftKey && code3 === 189) ||
+              (event.shiftKey && code3 === 222)
+            ) {
+              _this.editor.execCommand("autocomplete");
+            }
+          };
+          _this._onEdit = function () {
+            if (!_this.editor) {
+              return;
+            }
+            if (!_this.ignoreChangeEvent) {
+              _this.cachedValue = _this.editor.getValue();
+              if (_this.props.onEdit) {
+                _this.props.onEdit(_this.cachedValue);
+              }
+            }
+          };
+          _this._onHasCompletion = function (instance, changeObj) {
+            onHasCompletion(
+              instance,
+              changeObj,
+              _this.props.onHintInformationRender
+            );
+          };
+          _this.cachedValue = props.value || "";
+          return _this;
+        }
+        HeaderEditor2.prototype.componentDidMount = function () {
+          var _this = this;
+          this.initializeEditor()
+            .then(function (editor) {
+              editor.on("change", _this._onEdit);
+              editor.on("keyup", _this._onKeyUp);
+              editor.on("hasCompletion", _this._onHasCompletion);
+            })
+            .catch(console.error);
+        };
+        HeaderEditor2.prototype.componentDidUpdate = function (prevProps) {
+          if (!this.editor) {
+            return;
+          }
+          this.ignoreChangeEvent = true;
+          if (
+            this.props.value !== prevProps.value &&
+            this.props.value !== this.cachedValue
+          ) {
+            var thisValue = this.props.value || "";
+            this.cachedValue = thisValue;
+            this.editor.setValue(thisValue);
+          }
+          this.ignoreChangeEvent = false;
+        };
+        HeaderEditor2.prototype.componentWillUnmount = function () {
+          if (!this.editor) {
+            return;
+          }
+          this.editor.off("change", this._onEdit);
+          this.editor.off("keyup", this._onKeyUp);
+          this.editor.off("hasCompletion", this._onHasCompletion);
+          this.editor = null;
+        };
+        HeaderEditor2.prototype.render = function () {
+          var _this = this;
+          return React$1.createElement("div", {
+            className: "codemirrorWrap",
+            style: {
+              position: this.props.active ? "relative" : "absolute",
+              visibility: this.props.active ? "visible" : "hidden",
+            },
+            ref: function (node) {
+              _this._node = node;
+            },
+          });
+        };
+        HeaderEditor2.prototype.initializeEditor = function () {
+          return __awaiter$3(this, void 0, void 0, function () {
+            var _a2, editor;
+            var _this = this;
+            return __generator$3(this, function (_b) {
+              switch (_b.label) {
+                case 0:
+                  _a2 = this;
+                  return [4, importCodeMirror(this.addonModules())];
+                case 1:
+                  _a2.CodeMirror = _b.sent();
+                  editor = this.editor = this.CodeMirror(this._node, {
+                    value: this.props.value || "",
+                    lineNumbers: true,
+                    tabSize: 2,
+                    mode: { name: "javascript", json: true },
+                    theme: this.props.editorTheme || "graphiql",
+                    keyMap: "sublime",
+                    autoCloseBrackets: true,
+                    matchBrackets: true,
+                    showCursorWhenSelecting: true,
+                    readOnly: this.props.readOnly ? "nocursor" : false,
+                    foldGutter: {
+                      minFoldSize: 4,
+                    },
+                    gutters: [
+                      "CodeMirror-linenumbers",
+                      "CodeMirror-foldgutter",
+                    ],
+                    extraKeys: __assign$8(
+                      {
+                        "Cmd-Space": function () {
+                          return _this.editor.showHint({
+                            completeSingle: false,
+                            container: _this._node,
+                          });
+                        },
+                        "Ctrl-Space": function () {
+                          return _this.editor.showHint({
+                            completeSingle: false,
+                            container: _this._node,
+                          });
+                        },
+                        "Alt-Space": function () {
+                          return _this.editor.showHint({
+                            completeSingle: false,
+                            container: _this._node,
+                          });
+                        },
+                        "Shift-Space": function () {
+                          return _this.editor.showHint({
+                            completeSingle: false,
+                            container: _this._node,
+                          });
+                        },
+                        "Cmd-Enter": function () {
+                          if (_this.props.onRunQuery) {
+                            _this.props.onRunQuery();
+                          }
+                        },
+                        "Ctrl-Enter": function () {
+                          if (_this.props.onRunQuery) {
+                            _this.props.onRunQuery();
+                          }
+                        },
+                        "Shift-Ctrl-P": function () {
+                          if (_this.props.onPrettifyQuery) {
+                            _this.props.onPrettifyQuery();
+                          }
+                        },
+                        "Shift-Ctrl-M": function () {
+                          if (_this.props.onMergeQuery) {
+                            _this.props.onMergeQuery();
+                          }
+                        },
+                      },
+                      commonKeys
+                    ),
+                  });
+                  return [2, editor];
+              }
+            });
+          });
+        };
+        HeaderEditor2.prototype.getCodeMirror = function () {
+          return this.editor;
+        };
+        HeaderEditor2.prototype.getClientHeight = function () {
+          return this._node && this._node.clientHeight;
+        };
+        return HeaderEditor2;
+      })(React$1.Component);
+      var __extends$8 =
+        (globalThis && globalThis.__extends) ||
+        (function () {
+          var extendStatics = function (d, b) {
+            extendStatics =
+              Object.setPrototypeOf ||
+              ({ __proto__: [] } instanceof Array &&
+                function (d2, b2) {
+                  d2.__proto__ = b2;
+                }) ||
+              function (d2, b2) {
+                for (var p2 in b2)
+                  if (Object.prototype.hasOwnProperty.call(b2, p2))
+                    d2[p2] = b2[p2];
+              };
+            return extendStatics(d, b);
+          };
+          return function (d, b) {
+            extendStatics(d, b);
+            function __() {
+              this.constructor = d;
+            }
+            d.prototype =
+              b === null
+                ? Object.create(b)
+                : ((__.prototype = b.prototype), new __());
+          };
+        })();
+      var __awaiter$2 =
+        (globalThis && globalThis.__awaiter) ||
+        function (thisArg, _arguments, P2, generator) {
+          function adopt(value) {
+            return value instanceof P2
+              ? value
+              : new P2(function (resolve) {
+                  resolve(value);
+                });
+          }
+          return new (P2 || (P2 = Promise))(function (resolve, reject2) {
+            function fulfilled(value) {
+              try {
+                step(generator.next(value));
+              } catch (e) {
+                reject2(e);
+              }
+            }
+            function rejected(value) {
+              try {
+                step(generator["throw"](value));
+              } catch (e) {
+                reject2(e);
+              }
+            }
+            function step(result2) {
+              result2.done
+                ? resolve(result2.value)
+                : adopt(result2.value).then(fulfilled, rejected);
+            }
+            step(
+              (generator = generator.apply(thisArg, _arguments || [])).next()
+            );
+          });
+        };
+      var __generator$2 =
+        (globalThis && globalThis.__generator) ||
+        function (thisArg, body) {
+          var _ = {
+              label: 0,
+              sent: function () {
+                if (t2[0] & 1) throw t2[1];
+                return t2[1];
+              },
+              trys: [],
+              ops: [],
+            },
+            f,
+            y2,
+            t2,
+            g;
+          return (
+            (g = { next: verb(0), throw: verb(1), return: verb(2) }),
+            typeof Symbol === "function" &&
+              (g[Symbol.iterator] = function () {
+                return this;
+              }),
+            g
+          );
+          function verb(n2) {
+            return function (v2) {
+              return step([n2, v2]);
+            };
+          }
+          function step(op) {
+            if (f) throw new TypeError("Generator is already executing.");
+            while (_)
+              try {
+                if (
+                  ((f = 1),
+                  y2 &&
+                    (t2 =
+                      op[0] & 2
+                        ? y2["return"]
+                        : op[0]
+                        ? y2["throw"] || ((t2 = y2["return"]) && t2.call(y2), 0)
+                        : y2.next) &&
+                    !(t2 = t2.call(y2, op[1])).done)
+                )
+                  return t2;
+                if (((y2 = 0), t2)) op = [op[0] & 2, t2.value];
+                switch (op[0]) {
+                  case 0:
+                  case 1:
+                    t2 = op;
+                    break;
+                  case 4:
+                    _.label++;
+                    return { value: op[1], done: false };
+                  case 5:
+                    _.label++;
+                    y2 = op[1];
+                    op = [0];
+                    continue;
+                  case 7:
+                    op = _.ops.pop();
+                    _.trys.pop();
+                    continue;
+                  default:
+                    if (
+                      !((t2 = _.trys),
+                      (t2 = t2.length > 0 && t2[t2.length - 1])) &&
+                      (op[0] === 6 || op[0] === 2)
+                    ) {
+                      _ = 0;
+                      continue;
+                    }
+                    if (
+                      op[0] === 3 &&
+                      (!t2 || (op[1] > t2[0] && op[1] < t2[3]))
+                    ) {
+                      _.label = op[1];
+                      break;
+                    }
+                    if (op[0] === 6 && _.label < t2[1]) {
+                      _.label = t2[1];
+                      t2 = op;
+                      break;
+                    }
+                    if (t2 && _.label < t2[2]) {
+                      _.label = t2[2];
+                      _.ops.push(op);
+                      break;
+                    }
+                    if (t2[2]) _.ops.pop();
+                    _.trys.pop();
+                    continue;
+                }
+                op = body.call(thisArg, _);
+              } catch (e) {
+                op = [6, e];
+                y2 = 0;
+              } finally {
+                f = t2 = 0;
+              }
+            if (op[0] & 5) throw op[1];
+            return { value: op[0] ? op[1] : void 0, done: true };
+          }
+        };
+      var ResultViewer = (function (_super2) {
+        __extends$8(ResultViewer2, _super2);
+        function ResultViewer2() {
+          var _this =
+            (_super2 !== null && _super2.apply(this, arguments)) || this;
+          _this.viewer = null;
+          _this._node = null;
+          _this.allAddons = function () {
+            return [
+              Promise.resolve().then(function () {
+                return foldgutter$1;
+              }),
+              Promise.resolve().then(function () {
+                return braceFold$1;
+              }),
+              Promise.resolve().then(function () {
+                return dialog$1;
+              }),
+              Promise.resolve().then(function () {
+                return search$1;
+              }),
+              Promise.resolve().then(function () {
+                return searchcursor$1;
+              }),
+              Promise.resolve().then(function () {
+                return jumpToLine$1;
+              }),
+              Promise.resolve().then(function () {
+                return sublime$1;
+              }),
+              Promise.resolve().then(function () {
+                return mode;
+              }),
+            ];
+          };
+          return _this;
+        }
+        ResultViewer2.prototype.componentDidMount = function () {
+          this.initializeEditor();
+        };
+        ResultViewer2.prototype.shouldComponentUpdate = function (nextProps) {
+          return this.props.value !== nextProps.value;
+        };
+        ResultViewer2.prototype.componentDidUpdate = function () {
+          if (this.viewer) {
+            this.viewer.setValue(this.props.value || "");
+          }
+        };
+        ResultViewer2.prototype.componentWillUnmount = function () {
+          this.viewer = null;
+        };
+        ResultViewer2.prototype.render = function () {
+          var _this = this;
+          return React$1.createElement("section", {
+            className: "result-window",
+            "aria-label": "Result Window",
+            "aria-live": "polite",
+            "aria-atomic": "true",
+            ref: function (node) {
+              if (node) {
+                _this.props.registerRef(node);
+                _this._node = node;
+              }
+            },
+          });
+        };
+        ResultViewer2.prototype.initializeEditor = function () {
+          return __awaiter$2(this, void 0, void 0, function () {
+            var CodeMirror, Tooltip, ImagePreview2, tooltipDiv_1;
+            return __generator$2(this, function (_a2) {
+              switch (_a2.label) {
+                case 0:
+                  return [
+                    4,
+                    importCodeMirror(this.allAddons(), {
+                      useCommonAddons: false,
+                    }),
+                  ];
+                case 1:
+                  CodeMirror = _a2.sent();
+                  Tooltip = this.props.ResultsTooltip;
+                  ImagePreview2 = this.props.ImagePreview;
+                  if (!(Tooltip || ImagePreview2)) return [3, 3];
+                  return [
+                    4,
+                    Promise.resolve().then(function () {
+                      return infoAddon;
+                    }),
+                  ];
+                case 2:
+                  _a2.sent();
+                  tooltipDiv_1 = document.createElement("div");
+                  CodeMirror.registerHelper(
+                    "info",
+                    "graphql-results",
+                    function (token2, _options, _cm, pos) {
+                      var infoElements = [];
+                      if (Tooltip) {
+                        infoElements.push(
+                          React$1.createElement(Tooltip, { pos })
+                        );
+                      }
+                      if (
+                        ImagePreview2 &&
+                        typeof ImagePreview2.shouldRender === "function" &&
+                        ImagePreview2.shouldRender(token2)
+                      ) {
+                        infoElements.push(
+                          React$1.createElement(ImagePreview2, {
+                            token: token2,
+                          })
+                        );
+                      }
+                      if (!infoElements.length) {
+                        ReactDOM.unmountComponentAtNode(tooltipDiv_1);
+                        return null;
+                      }
+                      ReactDOM.render(
+                        React$1.createElement("div", null, infoElements),
+                        tooltipDiv_1
+                      );
+                      return tooltipDiv_1;
+                    }
+                  );
+                  _a2.label = 3;
+                case 3:
+                  this.viewer = CodeMirror(this._node, {
+                    lineWrapping: true,
+                    value: this.props.value || "",
+                    readOnly: true,
+                    theme: this.props.editorTheme || "graphiql",
+                    mode: "graphql-results",
+                    keyMap: "sublime",
+                    foldGutter: {
+                      minFoldSize: 4,
+                    },
+                    gutters: ["CodeMirror-foldgutter"],
+                    info: Boolean(
+                      this.props.ResultsTooltip || this.props.ImagePreview
+                    ),
+                    extraKeys: commonKeys,
+                  });
+                  return [2];
+              }
+            });
+          });
+        };
+        ResultViewer2.prototype.getCodeMirror = function () {
+          return this.viewer;
+        };
+        ResultViewer2.prototype.getClientHeight = function () {
+          return this._node && this._node.clientHeight;
+        };
+        return ResultViewer2;
+      })(React$1.Component);
+      function TypeLink(props) {
+        var onClick = props.onClick
+          ? props.onClick
+          : function () {
+              return null;
+            };
+        return renderType$1(props.type, onClick);
+      }
+      function renderType$1(type2, onClick) {
+        if (type2 instanceof GraphQLNonNull) {
+          return React$1.createElement(
+            "span",
+            null,
+            renderType$1(type2.ofType, onClick),
+            "!"
+          );
+        }
+        if (type2 instanceof GraphQLList) {
+          return React$1.createElement(
+            "span",
+            null,
+            "[",
+            renderType$1(type2.ofType, onClick),
+            "]"
+          );
+        }
+        return React$1.createElement(
+          "a",
+          {
+            className: "type-name",
+            onClick: function (event) {
+              event.preventDefault();
+              onClick(type2, event);
+            },
+            href: "#",
+          },
+          type2 === null || type2 === void 0 ? void 0 : type2.name
+        );
+      }
+      var printDefault = function (ast2) {
+        if (!ast2) {
+          return "";
+        }
+        return print(ast2);
+      };
+      function DefaultValue(_a2) {
+        var field = _a2.field;
+        if ("defaultValue" in field && field.defaultValue !== void 0) {
+          return React$1.createElement(
+            "span",
+            null,
+            " = ",
+            React$1.createElement(
+              "span",
+              { className: "arg-default-value" },
+              printDefault(astFromValue(field.defaultValue, field.type))
+            )
+          );
+        }
+        return null;
+      }
+      function Argument(_a2) {
+        var arg = _a2.arg,
+          onClickType = _a2.onClickType,
+          showDefaultValue = _a2.showDefaultValue;
+        return React$1.createElement(
+          "span",
+          { className: "arg" },
+          React$1.createElement("span", { className: "arg-name" }, arg.name),
+          ": ",
+          React$1.createElement(TypeLink, {
+            type: arg.type,
+            onClick: onClickType,
+          }),
+          showDefaultValue !== false &&
+            React$1.createElement(DefaultValue, { field: arg })
+        );
+      }
+      function Directive(_a2) {
+        var directive = _a2.directive;
+        return React$1.createElement(
+          "span",
+          { className: "doc-category-item", id: directive.name.value },
+          "@",
+          directive.name.value
+        );
+      }
+      var md = new markdownIt({
+        breaks: true,
+        linkify: true,
+      });
+      function MarkdownContent(_a2) {
+        var markdown = _a2.markdown,
+          className = _a2.className;
+        if (!markdown) {
+          return React$1.createElement("div", null);
+        }
+        return React$1.createElement("div", {
+          className,
+          dangerouslySetInnerHTML: { __html: md.render(markdown) },
+        });
+      }
+      var __read$5 =
+        (globalThis && globalThis.__read) ||
+        function (o, n2) {
+          var m = typeof Symbol === "function" && o[Symbol.iterator];
+          if (!m) return o;
+          var i = m.call(o),
+            r2,
+            ar = [],
+            e;
+          try {
+            while ((n2 === void 0 || n2-- > 0) && !(r2 = i.next()).done)
+              ar.push(r2.value);
+          } catch (error2) {
+            e = { error: error2 };
+          } finally {
+            try {
+              if (r2 && !r2.done && (m = i["return"])) m.call(i);
+            } finally {
+              if (e) throw e.error;
+            }
+          }
+          return ar;
+        };
+      function FieldDoc(_a2) {
+        var field = _a2.field,
+          onClickType = _a2.onClickType;
+        var _b = __read$5(React$1.useState(false), 2),
+          showDeprecated = _b[0],
+          handleShowDeprecated = _b[1];
+        var argsDef;
+        var deprecatedArgsDef;
+        if (field && "args" in field && field.args.length > 0) {
+          argsDef = React$1.createElement(
+            "div",
+            { id: "doc-args", className: "doc-category" },
+            React$1.createElement(
+              "div",
+              { className: "doc-category-title" },
+              "arguments"
+            ),
+            field.args
+              .filter(function (arg) {
+                return !arg.deprecationReason;
+              })
+              .map(function (arg) {
+                return React$1.createElement(
+                  "div",
+                  { key: arg.name, className: "doc-category-item" },
+                  React$1.createElement(
+                    "div",
+                    null,
+                    React$1.createElement(Argument, { arg, onClickType })
+                  ),
+                  React$1.createElement(MarkdownContent, {
+                    className: "doc-value-description",
+                    markdown: arg.description,
+                  }),
+                  arg &&
+                    "deprecationReason" in arg &&
+                    React$1.createElement(MarkdownContent, {
+                      className: "doc-deprecation",
+                      markdown:
+                        arg === null || arg === void 0
+                          ? void 0
+                          : arg.deprecationReason,
+                    })
+                );
+              })
+          );
+          var deprecatedArgs = field.args.filter(function (arg) {
+            return Boolean(arg.deprecationReason);
+          });
+          if (deprecatedArgs.length > 0) {
+            deprecatedArgsDef = React$1.createElement(
+              "div",
+              { id: "doc-deprecated-args", className: "doc-category" },
+              React$1.createElement(
+                "div",
+                { className: "doc-category-title" },
+                "deprecated arguments"
+              ),
+              !showDeprecated
+                ? React$1.createElement(
+                    "button",
+                    {
+                      className: "show-btn",
+                      onClick: function () {
+                        return handleShowDeprecated(!showDeprecated);
+                      },
+                    },
+                    "Show deprecated arguments..."
+                  )
+                : deprecatedArgs.map(function (arg, i) {
+                    return React$1.createElement(
+                      "div",
+                      { key: i },
+                      React$1.createElement(
+                        "div",
+                        null,
+                        React$1.createElement(Argument, { arg, onClickType })
+                      ),
+                      React$1.createElement(MarkdownContent, {
+                        className: "doc-value-description",
+                        markdown: arg.description,
+                      }),
+                      arg &&
+                        "deprecationReason" in arg &&
+                        React$1.createElement(MarkdownContent, {
+                          className: "doc-deprecation",
+                          markdown:
+                            arg === null || arg === void 0
+                              ? void 0
+                              : arg.deprecationReason,
+                        })
+                    );
+                  })
+            );
+          }
+        }
+        var directivesDef;
+        if (
+          field &&
+          field.astNode &&
+          field.astNode.directives &&
+          field.astNode.directives.length > 0
+        ) {
+          directivesDef = React$1.createElement(
+            "div",
+            { id: "doc-directives", className: "doc-category" },
+            React$1.createElement(
+              "div",
+              { className: "doc-category-title" },
+              "directives"
+            ),
+            field.astNode.directives.map(function (directive) {
+              return React$1.createElement(
+                "div",
+                { key: directive.name.value, className: "doc-category-item" },
+                React$1.createElement(
+                  "div",
+                  null,
+                  React$1.createElement(Directive, { directive })
+                )
+              );
+            })
+          );
+        }
+        return React$1.createElement(
+          "div",
+          null,
+          React$1.createElement(MarkdownContent, {
+            className: "doc-type-description",
+            markdown:
+              (field === null || field === void 0
+                ? void 0
+                : field.description) || "No Description",
+          }),
+          field &&
+            "deprecationReason" in field &&
+            React$1.createElement(MarkdownContent, {
+              className: "doc-deprecation",
+              markdown:
+                field === null || field === void 0
+                  ? void 0
+                  : field.deprecationReason,
+            }),
+          React$1.createElement(
+            "div",
+            { className: "doc-category" },
+            React$1.createElement(
+              "div",
+              { className: "doc-category-title" },
+              "type"
+            ),
+            React$1.createElement(TypeLink, {
+              type: field === null || field === void 0 ? void 0 : field.type,
+              onClick: onClickType,
+            })
+          ),
+          argsDef,
+          directivesDef,
+          deprecatedArgsDef
+        );
+      }
+      function SchemaDoc(_a2) {
+        var schema = _a2.schema,
+          onClickType = _a2.onClickType;
+        var queryType = schema.getQueryType();
+        var mutationType = schema.getMutationType && schema.getMutationType();
+        var subscriptionType =
+          schema.getSubscriptionType && schema.getSubscriptionType();
+        return React$1.createElement(
+          "div",
+          null,
+          React$1.createElement(MarkdownContent, {
+            className: "doc-type-description",
+            markdown:
+              schema.description ||
+              "A GraphQL schema provides a root type for each kind of operation.",
+          }),
+          React$1.createElement(
+            "div",
+            { className: "doc-category" },
+            React$1.createElement(
+              "div",
+              { className: "doc-category-title" },
+              "root types"
+            ),
+            React$1.createElement(
+              "div",
+              { className: "doc-category-item" },
+              React$1.createElement("span", { className: "keyword" }, "query"),
+              ": ",
+              React$1.createElement(TypeLink, {
+                type: queryType,
+                onClick: onClickType,
+              })
+            ),
+            mutationType &&
+              React$1.createElement(
+                "div",
+                { className: "doc-category-item" },
+                React$1.createElement(
+                  "span",
+                  { className: "keyword" },
+                  "mutation"
+                ),
+                ": ",
+                React$1.createElement(TypeLink, {
+                  type: mutationType,
+                  onClick: onClickType,
+                })
+              ),
+            subscriptionType &&
+              React$1.createElement(
+                "div",
+                { className: "doc-category-item" },
+                React$1.createElement(
+                  "span",
+                  { className: "keyword" },
+                  "subscription"
+                ),
+                ": ",
+                React$1.createElement(TypeLink, {
+                  type: subscriptionType,
+                  onClick: onClickType,
+                })
+              )
+          )
+        );
+      }
+      function debounce(duration, fn) {
+        var timeout;
+        return function () {
+          var _this = this;
+          var args = [];
+          for (var _i = 0; _i < arguments.length; _i++) {
+            args[_i] = arguments[_i];
+          }
+          if (timeout) {
+            window.clearTimeout(timeout);
+          }
+          timeout = window.setTimeout(function () {
+            timeout = null;
+            fn.apply(_this, args);
+          }, duration);
+        };
+      }
+      var __extends$7 =
+        (globalThis && globalThis.__extends) ||
+        (function () {
+          var extendStatics = function (d, b) {
+            extendStatics =
+              Object.setPrototypeOf ||
+              ({ __proto__: [] } instanceof Array &&
+                function (d2, b2) {
+                  d2.__proto__ = b2;
+                }) ||
+              function (d2, b2) {
+                for (var p2 in b2)
+                  if (Object.prototype.hasOwnProperty.call(b2, p2))
+                    d2[p2] = b2[p2];
+              };
+            return extendStatics(d, b);
+          };
+          return function (d, b) {
+            extendStatics(d, b);
+            function __() {
+              this.constructor = d;
+            }
+            d.prototype =
+              b === null
+                ? Object.create(b)
+                : ((__.prototype = b.prototype), new __());
+          };
+        })();
+      var SearchBox = (function (_super2) {
+        __extends$7(SearchBox2, _super2);
+        function SearchBox2(props) {
+          var _this = _super2.call(this, props) || this;
+          _this.handleChange = function (event) {
+            var value = event.currentTarget.value;
+            _this.setState({ value });
+            _this.debouncedOnSearch(value);
+          };
+          _this.handleClear = function () {
+            _this.setState({ value: "" });
+            _this.props.onSearch("");
+          };
+          _this.state = { value: props.value || "" };
+          _this.debouncedOnSearch = debounce(200, _this.props.onSearch);
+          return _this;
+        }
+        SearchBox2.prototype.render = function () {
+          return React$1.createElement(
+            "label",
+            { className: "search-box" },
+            React$1.createElement(
+              "div",
+              { className: "search-box-icon", "aria-hidden": "true" },
+              "\u26B2"
+            ),
+            React$1.createElement("input", {
+              value: this.state.value,
+              onChange: this.handleChange,
+              type: "text",
+              placeholder: this.props.placeholder,
+              "aria-label": this.props.placeholder,
+            }),
+            this.state.value &&
+              React$1.createElement(
+                "button",
+                {
+                  className: "search-box-clear",
+                  onClick: this.handleClear,
+                  "aria-label": "Clear search input",
+                },
+                "\u2715"
+              )
+          );
+        };
+        return SearchBox2;
+      })(React$1.Component);
+      var __extends$6 =
+        (globalThis && globalThis.__extends) ||
+        (function () {
+          var extendStatics = function (d, b) {
+            extendStatics =
+              Object.setPrototypeOf ||
+              ({ __proto__: [] } instanceof Array &&
+                function (d2, b2) {
+                  d2.__proto__ = b2;
+                }) ||
+              function (d2, b2) {
+                for (var p2 in b2)
+                  if (Object.prototype.hasOwnProperty.call(b2, p2))
+                    d2[p2] = b2[p2];
+              };
+            return extendStatics(d, b);
+          };
+          return function (d, b) {
+            extendStatics(d, b);
+            function __() {
+              this.constructor = d;
+            }
+            d.prototype =
+              b === null
+                ? Object.create(b)
+                : ((__.prototype = b.prototype), new __());
+          };
+        })();
+      var __values$3 =
+        (globalThis && globalThis.__values) ||
+        function (o) {
+          var s = typeof Symbol === "function" && Symbol.iterator,
+            m = s && o[s],
+            i = 0;
+          if (m) return m.call(o);
+          if (o && typeof o.length === "number")
+            return {
+              next: function () {
+                if (o && i >= o.length) o = void 0;
+                return { value: o && o[i++], done: !o };
+              },
+            };
+          throw new TypeError(
+            s ? "Object is not iterable." : "Symbol.iterator is not defined."
+          );
+        };
+      var SearchResults = (function (_super2) {
+        __extends$6(SearchResults2, _super2);
+        function SearchResults2() {
+          return (_super2 !== null && _super2.apply(this, arguments)) || this;
+        }
+        SearchResults2.prototype.shouldComponentUpdate = function (nextProps) {
+          return (
+            this.props.schema !== nextProps.schema ||
+            this.props.searchValue !== nextProps.searchValue
+          );
+        };
+        SearchResults2.prototype.render = function () {
+          var e_1, _a2;
+          var searchValue = this.props.searchValue;
+          var withinType = this.props.withinType;
+          var schema = this.props.schema;
+          var onClickType = this.props.onClickType;
+          var onClickField = this.props.onClickField;
+          var matchedWithin = [];
+          var matchedTypes = [];
+          var matchedFields = [];
+          var typeMap = schema.getTypeMap();
+          var typeNames = Object.keys(typeMap);
+          if (withinType) {
+            typeNames = typeNames.filter(function (n2) {
+              return n2 !== withinType.name;
+            });
+            typeNames.unshift(withinType.name);
+          }
+          var _loop_1 = function (typeName2) {
+            if (
+              matchedWithin.length +
+                matchedTypes.length +
+                matchedFields.length >=
+              100
+            ) {
+              return "break";
+            }
+            var type2 = typeMap[typeName2];
+            if (withinType !== type2 && isMatch(typeName2, searchValue)) {
+              matchedTypes.push(
+                React$1.createElement(
+                  "div",
+                  { className: "doc-category-item", key: typeName2 },
+                  React$1.createElement(TypeLink, {
+                    type: type2,
+                    onClick: onClickType,
+                  })
+                )
+              );
+            }
+            if (type2 && "getFields" in type2) {
+              var fields_1 = type2.getFields();
+              Object.keys(fields_1).forEach(function (fieldName) {
+                var field = fields_1[fieldName];
+                var matchingArgs;
+                if (!isMatch(fieldName, searchValue)) {
+                  if ("args" in field && field.args.length) {
+                    matchingArgs = field.args.filter(function (arg) {
+                      return isMatch(arg.name, searchValue);
+                    });
+                    if (matchingArgs.length === 0) {
+                      return;
+                    }
+                  } else {
+                    return;
+                  }
+                }
+                var match2 = React$1.createElement(
+                  "div",
+                  {
+                    className: "doc-category-item",
+                    key: typeName2 + "." + fieldName,
+                  },
+                  withinType !== type2 && [
+                    React$1.createElement(TypeLink, {
+                      key: "type",
+                      type: type2,
+                      onClick: onClickType,
+                    }),
+                    ".",
+                  ],
+                  React$1.createElement(
+                    "a",
+                    {
+                      className: "field-name",
+                      onClick: function (event) {
+                        return onClickField(field, type2, event);
+                      },
+                    },
+                    field.name
+                  ),
+                  matchingArgs && [
+                    "(",
+                    React$1.createElement(
+                      "span",
+                      { key: "args" },
+                      matchingArgs.map(function (arg) {
+                        return React$1.createElement(Argument, {
+                          key: arg.name,
+                          arg,
+                          onClickType,
+                          showDefaultValue: false,
+                        });
+                      })
+                    ),
+                    ")",
+                  ]
+                );
+                if (withinType === type2) {
+                  matchedWithin.push(match2);
+                } else {
+                  matchedFields.push(match2);
+                }
+              });
+            }
+          };
+          try {
+            for (
+              var typeNames_1 = __values$3(typeNames),
+                typeNames_1_1 = typeNames_1.next();
+              !typeNames_1_1.done;
+              typeNames_1_1 = typeNames_1.next()
+            ) {
+              var typeName = typeNames_1_1.value;
+              var state_1 = _loop_1(typeName);
+              if (state_1 === "break") break;
+            }
+          } catch (e_1_1) {
+            e_1 = { error: e_1_1 };
+          } finally {
+            try {
+              if (
+                typeNames_1_1 &&
+                !typeNames_1_1.done &&
+                (_a2 = typeNames_1.return)
+              )
+                _a2.call(typeNames_1);
+            } finally {
+              if (e_1) throw e_1.error;
+            }
+          }
+          if (
+            matchedWithin.length +
+              matchedTypes.length +
+              matchedFields.length ===
+            0
+          ) {
+            return React$1.createElement(
+              "span",
+              { className: "doc-alert-text" },
+              "No results found."
+            );
+          }
+          if (withinType && matchedTypes.length + matchedFields.length > 0) {
+            return React$1.createElement(
+              "div",
+              null,
+              matchedWithin,
+              React$1.createElement(
+                "div",
+                { className: "doc-category" },
+                React$1.createElement(
+                  "div",
+                  { className: "doc-category-title" },
+                  "other results"
+                ),
+                matchedTypes,
+                matchedFields
+              )
+            );
+          }
+          return React$1.createElement(
+            "div",
+            { className: "doc-search-items" },
+            matchedWithin,
+            matchedTypes,
+            matchedFields
+          );
+        };
+        return SearchResults2;
+      })(React$1.Component);
+      function isMatch(sourceText, searchValue) {
+        try {
+          var escaped = searchValue.replace(/[^_0-9A-Za-z]/g, function (ch2) {
+            return "\\" + ch2;
+          });
+          return sourceText.search(new RegExp(escaped, "i")) !== -1;
+        } catch (e) {
+          return (
+            sourceText.toLowerCase().indexOf(searchValue.toLowerCase()) !== -1
+          );
+        }
+      }
+      var __extends$5 =
+        (globalThis && globalThis.__extends) ||
+        (function () {
+          var extendStatics = function (d, b) {
+            extendStatics =
+              Object.setPrototypeOf ||
+              ({ __proto__: [] } instanceof Array &&
+                function (d2, b2) {
+                  d2.__proto__ = b2;
+                }) ||
+              function (d2, b2) {
+                for (var p2 in b2)
+                  if (Object.prototype.hasOwnProperty.call(b2, p2))
+                    d2[p2] = b2[p2];
+              };
+            return extendStatics(d, b);
+          };
+          return function (d, b) {
+            extendStatics(d, b);
+            function __() {
+              this.constructor = d;
+            }
+            d.prototype =
+              b === null
+                ? Object.create(b)
+                : ((__.prototype = b.prototype), new __());
+          };
+        })();
+      var TypeDoc = (function (_super2) {
+        __extends$5(TypeDoc2, _super2);
+        function TypeDoc2(props) {
+          var _this = _super2.call(this, props) || this;
+          _this.handleShowDeprecated = function () {
+            return _this.setState({ showDeprecated: true });
+          };
+          _this.state = { showDeprecated: false };
+          return _this;
+        }
+        TypeDoc2.prototype.shouldComponentUpdate = function (
+          nextProps,
+          nextState
+        ) {
+          return (
+            this.props.type !== nextProps.type ||
+            this.props.schema !== nextProps.schema ||
+            this.state.showDeprecated !== nextState.showDeprecated
+          );
+        };
+        TypeDoc2.prototype.render = function () {
+          var schema = this.props.schema;
+          var type2 = this.props.type;
+          var onClickType = this.props.onClickType;
+          var onClickField = this.props.onClickField;
+          var typesTitle = null;
+          var types = [];
+          if (type2 instanceof GraphQLUnionType) {
+            typesTitle = "possible types";
+            types = schema.getPossibleTypes(type2);
+          } else if (type2 instanceof GraphQLInterfaceType) {
+            typesTitle = "implementations";
+            types = schema.getPossibleTypes(type2);
+          } else if (type2 instanceof GraphQLObjectType) {
+            typesTitle = "implements";
+            types = type2.getInterfaces();
+          }
+          var typesDef;
+          if (types && types.length > 0) {
+            typesDef = React$1.createElement(
+              "div",
+              { id: "doc-types", className: "doc-category" },
+              React$1.createElement(
+                "div",
+                { className: "doc-category-title" },
+                typesTitle
+              ),
+              types.map(function (subtype) {
+                return React$1.createElement(
+                  "div",
+                  { key: subtype.name, className: "doc-category-item" },
+                  React$1.createElement(TypeLink, {
+                    type: subtype,
+                    onClick: onClickType,
+                  })
+                );
+              })
+            );
+          }
+          var fieldsDef;
+          var deprecatedFieldsDef;
+          if (type2 && "getFields" in type2) {
+            var fieldMap_1 = type2.getFields();
+            var fields = Object.keys(fieldMap_1).map(function (name2) {
+              return fieldMap_1[name2];
+            });
+            fieldsDef = React$1.createElement(
+              "div",
+              { id: "doc-fields", className: "doc-category" },
+              React$1.createElement(
+                "div",
+                { className: "doc-category-title" },
+                "fields"
+              ),
+              fields
+                .filter(function (field) {
+                  return !field.deprecationReason;
+                })
+                .map(function (field) {
+                  return React$1.createElement(Field, {
+                    key: field.name,
+                    type: type2,
+                    field,
+                    onClickType,
+                    onClickField,
+                  });
+                })
+            );
+            var deprecatedFields = fields.filter(function (field) {
+              return Boolean(field.deprecationReason);
+            });
+            if (deprecatedFields.length > 0) {
+              deprecatedFieldsDef = React$1.createElement(
+                "div",
+                { id: "doc-deprecated-fields", className: "doc-category" },
+                React$1.createElement(
+                  "div",
+                  { className: "doc-category-title" },
+                  "deprecated fields"
+                ),
+                !this.state.showDeprecated
+                  ? React$1.createElement(
+                      "button",
+                      {
+                        className: "show-btn",
+                        onClick: this.handleShowDeprecated,
+                      },
+                      "Show deprecated fields..."
+                    )
+                  : deprecatedFields.map(function (field) {
+                      return React$1.createElement(Field, {
+                        key: field.name,
+                        type: type2,
+                        field,
+                        onClickType,
+                        onClickField,
+                      });
+                    })
+              );
+            }
+          }
+          var valuesDef;
+          var deprecatedValuesDef;
+          if (type2 instanceof GraphQLEnumType) {
+            var values = type2.getValues();
+            valuesDef = React$1.createElement(
+              "div",
+              { className: "doc-category" },
+              React$1.createElement(
+                "div",
+                { className: "doc-category-title" },
+                "values"
+              ),
+              values
+                .filter(function (value) {
+                  return Boolean(!value.deprecationReason);
+                })
+                .map(function (value) {
+                  return React$1.createElement(EnumValue, {
+                    key: value.name,
+                    value,
+                  });
+                })
+            );
+            var deprecatedValues = values.filter(function (value) {
+              return Boolean(value.deprecationReason);
+            });
+            if (deprecatedValues.length > 0) {
+              deprecatedValuesDef = React$1.createElement(
+                "div",
+                { className: "doc-category" },
+                React$1.createElement(
+                  "div",
+                  { className: "doc-category-title" },
+                  "deprecated values"
+                ),
+                !this.state.showDeprecated
+                  ? React$1.createElement(
+                      "button",
+                      {
+                        className: "show-btn",
+                        onClick: this.handleShowDeprecated,
+                      },
+                      "Show deprecated values..."
+                    )
+                  : deprecatedValues.map(function (value) {
+                      return React$1.createElement(EnumValue, {
+                        key: value.name,
+                        value,
+                      });
+                    })
+              );
+            }
+          }
+          return React$1.createElement(
+            "div",
+            null,
+            React$1.createElement(MarkdownContent, {
+              className: "doc-type-description",
+              markdown:
+                ("description" in type2 && type2.description) ||
+                "No Description",
+            }),
+            type2 instanceof GraphQLObjectType && typesDef,
+            fieldsDef,
+            deprecatedFieldsDef,
+            valuesDef,
+            deprecatedValuesDef,
+            !(type2 instanceof GraphQLObjectType) && typesDef
+          );
+        };
+        return TypeDoc2;
+      })(React$1.Component);
+      function Field(_a2) {
+        var type2 = _a2.type,
+          field = _a2.field,
+          onClickType = _a2.onClickType,
+          onClickField = _a2.onClickField;
+        return React$1.createElement(
+          "div",
+          { className: "doc-category-item" },
+          React$1.createElement(
+            "a",
+            {
+              className: "field-name",
+              onClick: function (event) {
+                return onClickField(field, type2, event);
+              },
+            },
+            field.name
+          ),
+          "args" in field &&
+            field.args &&
+            field.args.length > 0 && [
+              "(",
+              React$1.createElement(
+                "span",
+                { key: "args" },
+                field.args
+                  .filter(function (arg) {
+                    return !arg.deprecationReason;
+                  })
+                  .map(function (arg) {
+                    return React$1.createElement(Argument, {
+                      key: arg.name,
+                      arg,
+                      onClickType,
+                    });
+                  })
+              ),
+              ")",
+            ],
+          ": ",
+          React$1.createElement(TypeLink, {
+            type: field.type,
+            onClick: onClickType,
+          }),
+          React$1.createElement(DefaultValue, { field }),
+          field.description &&
+            React$1.createElement(MarkdownContent, {
+              className: "field-short-description",
+              markdown: field.description,
+            }),
+          "deprecationReason" in field &&
+            field.deprecationReason &&
+            React$1.createElement(MarkdownContent, {
+              className: "doc-deprecation",
+              markdown: field.deprecationReason,
+            })
+        );
+      }
+      function EnumValue(_a2) {
+        var value = _a2.value;
+        return React$1.createElement(
+          "div",
+          { className: "doc-category-item" },
+          React$1.createElement("div", { className: "enum-value" }, value.name),
+          React$1.createElement(MarkdownContent, {
+            className: "doc-value-description",
+            markdown: value.description,
+          }),
+          value.deprecationReason &&
+            React$1.createElement(MarkdownContent, {
+              className: "doc-deprecation",
+              markdown: value.deprecationReason,
+            })
+        );
+      }
+      var __extends$4 =
+        (globalThis && globalThis.__extends) ||
+        (function () {
+          var extendStatics = function (d, b) {
+            extendStatics =
+              Object.setPrototypeOf ||
+              ({ __proto__: [] } instanceof Array &&
+                function (d2, b2) {
+                  d2.__proto__ = b2;
+                }) ||
+              function (d2, b2) {
+                for (var p2 in b2)
+                  if (Object.prototype.hasOwnProperty.call(b2, p2))
+                    d2[p2] = b2[p2];
+              };
+            return extendStatics(d, b);
+          };
+          return function (d, b) {
+            extendStatics(d, b);
+            function __() {
+              this.constructor = d;
+            }
+            d.prototype =
+              b === null
+                ? Object.create(b)
+                : ((__.prototype = b.prototype), new __());
+          };
+        })();
+      var __assign$7 =
+        (globalThis && globalThis.__assign) ||
+        function () {
+          __assign$7 =
+            Object.assign ||
+            function (t2) {
+              for (var s, i = 1, n2 = arguments.length; i < n2; i++) {
+                s = arguments[i];
+                for (var p2 in s)
+                  if (Object.prototype.hasOwnProperty.call(s, p2))
+                    t2[p2] = s[p2];
+              }
+              return t2;
+            };
+          return __assign$7.apply(this, arguments);
+        };
+      var initialNav = {
+        name: "Schema",
+        title: "Documentation Explorer",
+      };
+      var DocExplorer = (function (_super2) {
+        __extends$4(DocExplorer2, _super2);
+        function DocExplorer2(props) {
+          var _this = _super2.call(this, props) || this;
+          _this.handleNavBackClick = function () {
+            if (_this.state.navStack.length > 1) {
+              _this.setState({ navStack: _this.state.navStack.slice(0, -1) });
+            }
+          };
+          _this.handleClickType = function (type2) {
+            _this.showDoc(type2);
+          };
+          _this.handleClickField = function (field) {
+            _this.showDoc(field);
+          };
+          _this.handleSearch = function (value) {
+            _this.showSearch(value);
+          };
+          _this.state = { navStack: [initialNav] };
+          return _this;
+        }
+        DocExplorer2.prototype.shouldComponentUpdate = function (
+          nextProps,
+          nextState
+        ) {
+          return (
+            this.props.schema !== nextProps.schema ||
+            this.state.navStack !== nextState.navStack ||
+            this.props.schemaErrors !== nextProps.schemaErrors
+          );
+        };
+        DocExplorer2.prototype.render = function () {
+          var _a2 = this.props,
+            schema = _a2.schema,
+            schemaErrors = _a2.schemaErrors;
+          var navStack = this.state.navStack;
+          var navItem = navStack[navStack.length - 1];
+          var content;
+          if (schemaErrors) {
+            content = React$1.createElement(
+              "div",
+              { className: "error-container" },
+              "Error fetching schema"
+            );
+          } else if (schema === void 0) {
+            content = React$1.createElement(
+              "div",
+              { className: "spinner-container" },
+              React$1.createElement("div", { className: "spinner" })
+            );
+          } else if (!schema) {
+            content = React$1.createElement(
+              "div",
+              { className: "error-container" },
+              "No Schema Available"
+            );
+          } else if (navItem.search) {
+            content = React$1.createElement(SearchResults, {
+              searchValue: navItem.search,
+              withinType: navItem.def,
+              schema,
+              onClickType: this.handleClickType,
+              onClickField: this.handleClickField,
+            });
+          } else if (navStack.length === 1) {
+            content = React$1.createElement(SchemaDoc, {
+              schema,
+              onClickType: this.handleClickType,
+            });
+          } else if (isType(navItem.def)) {
+            content = React$1.createElement(TypeDoc, {
+              schema,
+              type: navItem.def,
+              onClickType: this.handleClickType,
+              onClickField: this.handleClickField,
+            });
+          } else {
+            content = React$1.createElement(FieldDoc, {
+              field: navItem.def,
+              onClickType: this.handleClickType,
+            });
+          }
+          var shouldSearchBoxAppear =
+            navStack.length === 1 ||
+            (isType(navItem.def) && "getFields" in navItem.def);
+          var prevName;
+          if (navStack.length > 1) {
+            prevName = navStack[navStack.length - 2].name;
+          }
+          return React$1.createElement(
+            "section",
+            {
+              className: "doc-explorer",
+              key: navItem.name,
+              "aria-label": "Documentation Explorer",
+            },
+            React$1.createElement(
+              "div",
+              { className: "doc-explorer-title-bar" },
+              prevName &&
+                React$1.createElement(
+                  "button",
+                  {
+                    className: "doc-explorer-back",
+                    onClick: this.handleNavBackClick,
+                    "aria-label": "Go back to " + prevName,
+                  },
+                  prevName
+                ),
+              React$1.createElement(
+                "div",
+                { className: "doc-explorer-title" },
+                navItem.title || navItem.name
+              ),
+              React$1.createElement(
+                "div",
+                { className: "doc-explorer-rhs" },
+                this.props.children
+              )
+            ),
+            React$1.createElement(
+              "div",
+              { className: "doc-explorer-contents" },
+              shouldSearchBoxAppear &&
+                React$1.createElement(SearchBox, {
+                  value: navItem.search,
+                  placeholder: "Search " + navItem.name + "...",
+                  onSearch: this.handleSearch,
+                }),
+              content
+            )
+          );
+        };
+        DocExplorer2.prototype.showDoc = function (typeOrField) {
+          var navStack = this.state.navStack;
+          var topNav = navStack[navStack.length - 1];
+          if (topNav.def !== typeOrField) {
+            this.setState({
+              navStack: navStack.concat([
+                {
+                  name: typeOrField.name,
+                  def: typeOrField,
+                },
+              ]),
+            });
+          }
+        };
+        DocExplorer2.prototype.showDocForReference = function (reference3) {
+          if (reference3 && reference3.kind === "Type") {
+            this.showDoc(reference3.type);
+          } else if (reference3.kind === "Field") {
+            this.showDoc(reference3.field);
+          } else if (reference3.kind === "Argument" && reference3.field) {
+            this.showDoc(reference3.field);
+          } else if (reference3.kind === "EnumValue" && reference3.type) {
+            this.showDoc(reference3.type);
+          }
+        };
+        DocExplorer2.prototype.showSearch = function (search2) {
+          var navStack = this.state.navStack.slice();
+          var topNav = navStack[navStack.length - 1];
+          navStack[navStack.length - 1] = __assign$7(__assign$7({}, topNav), {
+            search: search2,
+          });
+          this.setState({ navStack });
+        };
+        DocExplorer2.prototype.reset = function () {
+          this.setState({ navStack: [initialNav] });
+        };
+        return DocExplorer2;
+      })(React$1.Component);
+      var __extends$3 =
+        (globalThis && globalThis.__extends) ||
+        (function () {
+          var extendStatics = function (d, b) {
+            extendStatics =
+              Object.setPrototypeOf ||
+              ({ __proto__: [] } instanceof Array &&
+                function (d2, b2) {
+                  d2.__proto__ = b2;
+                }) ||
+              function (d2, b2) {
+                for (var p2 in b2)
+                  if (Object.prototype.hasOwnProperty.call(b2, p2))
+                    d2[p2] = b2[p2];
+              };
+            return extendStatics(d, b);
+          };
+          return function (d, b) {
+            extendStatics(d, b);
+            function __() {
+              this.constructor = d;
+            }
+            d.prototype =
+              b === null
+                ? Object.create(b)
+                : ((__.prototype = b.prototype), new __());
+          };
+        })();
+      var HistoryQuery = (function (_super2) {
+        __extends$3(HistoryQuery2, _super2);
+        function HistoryQuery2(props) {
+          var _this = _super2.call(this, props) || this;
+          _this.state = {
+            editable: false,
+          };
+          _this.editField = null;
+          return _this;
+        }
+        HistoryQuery2.prototype.render = function () {
+          var _this = this;
+          var _a2;
+          var displayName =
+            this.props.label ||
+            this.props.operationName ||
+            ((_a2 = this.props.query) === null || _a2 === void 0
+              ? void 0
+              : _a2
+                  .split("\n")
+                  .filter(function (line) {
+                    return line.indexOf("#") !== 0;
+                  })
+                  .join(""));
+          var starIcon = this.props.favorite ? "\u2605" : "\u2606";
+          return React$1.createElement(
+            "li",
+            { className: this.state.editable ? "editable" : void 0 },
+            this.state.editable
+              ? React$1.createElement("input", {
+                  type: "text",
+                  defaultValue: this.props.label,
+                  ref: function (c) {
+                    _this.editField = c;
+                  },
+                  onBlur: this.handleFieldBlur.bind(this),
+                  onKeyDown: this.handleFieldKeyDown.bind(this),
+                  placeholder: "Type a label",
+                })
+              : React$1.createElement(
+                  "button",
+                  {
+                    className: "history-label",
+                    onClick: this.handleClick.bind(this),
+                  },
+                  displayName
+                ),
+            React$1.createElement(
+              "button",
+              {
+                onClick: this.handleEditClick.bind(this),
+                "aria-label": "Edit label",
+              },
+              "\u270E"
+            ),
+            React$1.createElement(
+              "button",
+              {
+                className: this.props.favorite ? "favorited" : void 0,
+                onClick: this.handleStarClick.bind(this),
+                "aria-label": this.props.favorite
+                  ? "Remove favorite"
+                  : "Add favorite",
+              },
+              starIcon
+            )
+          );
+        };
+        HistoryQuery2.prototype.handleClick = function () {
+          this.props.onSelect(
+            this.props.query,
+            this.props.variables,
+            this.props.headers,
+            this.props.operationName,
+            this.props.label
+          );
+        };
+        HistoryQuery2.prototype.handleStarClick = function (e) {
+          e.stopPropagation();
+          this.props.handleToggleFavorite(
+            this.props.query,
+            this.props.variables,
+            this.props.headers,
+            this.props.operationName,
+            this.props.label,
+            this.props.favorite
+          );
+        };
+        HistoryQuery2.prototype.handleFieldBlur = function (e) {
+          e.stopPropagation();
+          this.setState({ editable: false });
+          this.props.handleEditLabel(
+            this.props.query,
+            this.props.variables,
+            this.props.headers,
+            this.props.operationName,
+            e.target.value,
+            this.props.favorite
+          );
+        };
+        HistoryQuery2.prototype.handleFieldKeyDown = function (e) {
+          if (e.keyCode === 13) {
+            e.stopPropagation();
+            this.setState({ editable: false });
+            this.props.handleEditLabel(
+              this.props.query,
+              this.props.variables,
+              this.props.headers,
+              this.props.operationName,
+              e.currentTarget.value,
+              this.props.favorite
+            );
+          }
+        };
+        HistoryQuery2.prototype.handleEditClick = function (e) {
+          var _this = this;
+          e.stopPropagation();
+          this.setState({ editable: true }, function () {
+            if (_this.editField) {
+              _this.editField.focus();
+            }
+          });
+        };
+        return HistoryQuery2;
+      })(React$1.Component);
+      var __read$4 =
+        (globalThis && globalThis.__read) ||
+        function (o, n2) {
+          var m = typeof Symbol === "function" && o[Symbol.iterator];
+          if (!m) return o;
+          var i = m.call(o),
+            r2,
+            ar = [],
+            e;
+          try {
+            while ((n2 === void 0 || n2-- > 0) && !(r2 = i.next()).done)
+              ar.push(r2.value);
+          } catch (error2) {
+            e = { error: error2 };
+          } finally {
+            try {
+              if (r2 && !r2.done && (m = i["return"])) m.call(i);
+            } finally {
+              if (e) throw e.error;
+            }
+          }
+          return ar;
+        };
+      var __spread$3 =
+        (globalThis && globalThis.__spread) ||
+        function () {
+          for (var ar = [], i = 0; i < arguments.length; i++)
+            ar = ar.concat(__read$4(arguments[i]));
+          return ar;
+        };
+      var QueryStore = (function () {
+        function QueryStore2(key, storage, maxSize) {
+          if (maxSize === void 0) {
+            maxSize = null;
+          }
+          this.key = key;
+          this.storage = storage;
+          this.maxSize = maxSize;
+          this.items = this.fetchAll();
+        }
+        Object.defineProperty(QueryStore2.prototype, "length", {
+          get: function () {
+            return this.items.length;
+          },
+          enumerable: false,
+          configurable: true,
+        });
+        QueryStore2.prototype.contains = function (item) {
+          return this.items.some(function (x2) {
+            return (
+              x2.query === item.query &&
+              x2.variables === item.variables &&
+              x2.headers === item.headers &&
+              x2.operationName === item.operationName
+            );
+          });
+        };
+        QueryStore2.prototype.edit = function (item) {
+          var itemIndex = this.items.findIndex(function (x2) {
+            return (
+              x2.query === item.query &&
+              x2.variables === item.variables &&
+              x2.headers === item.headers &&
+              x2.operationName === item.operationName
+            );
+          });
+          if (itemIndex !== -1) {
+            this.items.splice(itemIndex, 1, item);
+            this.save();
+          }
+        };
+        QueryStore2.prototype.delete = function (item) {
+          var itemIndex = this.items.findIndex(function (x2) {
+            return (
+              x2.query === item.query &&
+              x2.variables === item.variables &&
+              x2.headers === item.headers &&
+              x2.operationName === item.operationName
+            );
+          });
+          if (itemIndex !== -1) {
+            this.items.splice(itemIndex, 1);
+            this.save();
+          }
+        };
+        QueryStore2.prototype.fetchRecent = function () {
+          return this.items[this.items.length - 1];
+        };
+        QueryStore2.prototype.fetchAll = function () {
+          var raw = this.storage.get(this.key);
+          if (raw) {
+            return JSON.parse(raw)[this.key];
+          }
+          return [];
+        };
+        QueryStore2.prototype.push = function (item) {
+          var _a2;
+          var items = __spread$3(this.items, [item]);
+          if (this.maxSize && items.length > this.maxSize) {
+            items.shift();
+          }
+          for (var attempts = 0; attempts < 5; attempts++) {
+            var response = this.storage.set(
+              this.key,
+              JSON.stringify(((_a2 = {}), (_a2[this.key] = items), _a2))
+            );
+            if (!response || !response.error) {
+              this.items = items;
+            } else if (response.isQuotaError && this.maxSize) {
+              items.shift();
+            } else {
+              return;
+            }
+          }
+        };
+        QueryStore2.prototype.save = function () {
+          var _a2;
+          this.storage.set(
+            this.key,
+            JSON.stringify(((_a2 = {}), (_a2[this.key] = this.items), _a2))
+          );
+        };
+        return QueryStore2;
+      })();
+      var __assign$6 =
+        (globalThis && globalThis.__assign) ||
+        function () {
+          __assign$6 =
+            Object.assign ||
+            function (t2) {
+              for (var s, i = 1, n2 = arguments.length; i < n2; i++) {
+                s = arguments[i];
+                for (var p2 in s)
+                  if (Object.prototype.hasOwnProperty.call(s, p2))
+                    t2[p2] = s[p2];
+              }
+              return t2;
+            };
+          return __assign$6.apply(this, arguments);
+        };
+      var __read$3 =
+        (globalThis && globalThis.__read) ||
+        function (o, n2) {
+          var m = typeof Symbol === "function" && o[Symbol.iterator];
+          if (!m) return o;
+          var i = m.call(o),
+            r2,
+            ar = [],
+            e;
+          try {
+            while ((n2 === void 0 || n2-- > 0) && !(r2 = i.next()).done)
+              ar.push(r2.value);
+          } catch (error2) {
+            e = { error: error2 };
+          } finally {
+            try {
+              if (r2 && !r2.done && (m = i["return"])) m.call(i);
+            } finally {
+              if (e) throw e.error;
+            }
+          }
+          return ar;
+        };
+      var __spread$2 =
+        (globalThis && globalThis.__spread) ||
+        function () {
+          for (var ar = [], i = 0; i < arguments.length; i++)
+            ar = ar.concat(__read$3(arguments[i]));
+          return ar;
+        };
+      var MAX_QUERY_SIZE = 1e5;
+      var HistoryStore = (function () {
+        function HistoryStore2(storage, maxHistoryLength) {
+          var _this = this;
+          this.storage = storage;
+          this.maxHistoryLength = maxHistoryLength;
+          this.shouldSaveQuery = function (
+            query,
+            variables,
+            headers,
+            lastQuerySaved
+          ) {
+            if (!query) {
+              return false;
+            }
+            try {
+              parse$1(query);
+            } catch (e) {
+              return false;
+            }
+            if (query.length > MAX_QUERY_SIZE) {
+              return false;
+            }
+            if (!lastQuerySaved) {
+              return true;
+            }
+            if (
+              JSON.stringify(query) === JSON.stringify(lastQuerySaved.query)
+            ) {
+              if (
+                JSON.stringify(variables) ===
+                JSON.stringify(lastQuerySaved.variables)
+              ) {
+                if (
+                  JSON.stringify(headers) ===
+                  JSON.stringify(lastQuerySaved.headers)
+                ) {
+                  return false;
+                }
+                if (headers && !lastQuerySaved.headers) {
+                  return false;
+                }
+              }
+              if (variables && !lastQuerySaved.variables) {
+                return false;
+              }
+            }
+            return true;
+          };
+          this.fetchAllQueries = function () {
+            var historyQueries = _this.history.fetchAll();
+            var favoriteQueries = _this.favorite.fetchAll();
+            return historyQueries.concat(favoriteQueries);
+          };
+          this.updateHistory = function (
+            query,
+            variables,
+            headers,
+            operationName
+          ) {
+            if (
+              _this.shouldSaveQuery(
+                query,
+                variables,
+                headers,
+                _this.history.fetchRecent()
+              )
+            ) {
+              _this.history.push({
+                query,
+                variables,
+                headers,
+                operationName,
+              });
+              var historyQueries = _this.history.items;
+              var favoriteQueries = _this.favorite.items;
+              _this.queries = historyQueries.concat(favoriteQueries);
+            }
+          };
+          this.toggleFavorite = function (
+            query,
+            variables,
+            headers,
+            operationName,
+            label,
+            favorite
+          ) {
+            var item = {
+              query,
+              variables,
+              headers,
+              operationName,
+              label,
+            };
+            if (!_this.favorite.contains(item)) {
+              item.favorite = true;
+              _this.favorite.push(item);
+            } else if (favorite) {
+              item.favorite = false;
+              _this.favorite.delete(item);
+            }
+            _this.queries = __spread$2(
+              _this.history.items,
+              _this.favorite.items
+            );
+          };
+          this.editLabel = function (
+            query,
+            variables,
+            headers,
+            operationName,
+            label,
+            favorite
+          ) {
+            var item = {
+              query,
+              variables,
+              headers,
+              operationName,
+              label,
+            };
+            if (favorite) {
+              _this.favorite.edit(
+                __assign$6(__assign$6({}, item), { favorite })
+              );
+            } else {
+              _this.history.edit(item);
+            }
+            _this.queries = __spread$2(
+              _this.history.items,
+              _this.favorite.items
+            );
+          };
+          this.history = new QueryStore(
+            "queries",
+            this.storage,
+            this.maxHistoryLength
+          );
+          this.favorite = new QueryStore("favorites", this.storage, null);
+          this.queries = this.fetchAllQueries();
+        }
+        return HistoryStore2;
+      })();
+      var __extends$2 =
+        (globalThis && globalThis.__extends) ||
+        (function () {
+          var extendStatics = function (d, b) {
+            extendStatics =
+              Object.setPrototypeOf ||
+              ({ __proto__: [] } instanceof Array &&
+                function (d2, b2) {
+                  d2.__proto__ = b2;
+                }) ||
+              function (d2, b2) {
+                for (var p2 in b2)
+                  if (Object.prototype.hasOwnProperty.call(b2, p2))
+                    d2[p2] = b2[p2];
+              };
+            return extendStatics(d, b);
+          };
+          return function (d, b) {
+            extendStatics(d, b);
+            function __() {
+              this.constructor = d;
+            }
+            d.prototype =
+              b === null
+                ? Object.create(b)
+                : ((__.prototype = b.prototype), new __());
+          };
+        })();
+      var __assign$5 =
+        (globalThis && globalThis.__assign) ||
+        function () {
+          __assign$5 =
+            Object.assign ||
+            function (t2) {
+              for (var s, i = 1, n2 = arguments.length; i < n2; i++) {
+                s = arguments[i];
+                for (var p2 in s)
+                  if (Object.prototype.hasOwnProperty.call(s, p2))
+                    t2[p2] = s[p2];
+              }
+              return t2;
+            };
+          return __assign$5.apply(this, arguments);
+        };
+      var QueryHistory = (function (_super2) {
+        __extends$2(QueryHistory2, _super2);
+        function QueryHistory2(props) {
+          var _this = _super2.call(this, props) || this;
+          _this.onUpdateHistory = function (
+            query,
+            variables,
+            headers,
+            operationName
+          ) {
+            _this.historyStore.updateHistory(
+              query,
+              variables,
+              headers,
+              operationName
+            );
+            _this.setState({ queries: _this.historyStore.queries });
+          };
+          _this.onHandleEditLabel = function (
+            query,
+            variables,
+            headers,
+            operationName,
+            label,
+            favorite
+          ) {
+            _this.historyStore.editLabel(
+              query,
+              variables,
+              headers,
+              operationName,
+              label,
+              favorite
+            );
+            _this.setState({ queries: _this.historyStore.queries });
+          };
+          _this.onToggleFavorite = function (
+            query,
+            variables,
+            headers,
+            operationName,
+            label,
+            favorite
+          ) {
+            _this.historyStore.toggleFavorite(
+              query,
+              variables,
+              headers,
+              operationName,
+              label,
+              favorite
+            );
+            _this.setState({ queries: _this.historyStore.queries });
+          };
+          _this.historyStore = new HistoryStore(
+            _this.props.storage,
+            _this.props.maxHistoryLength
+          );
+          var queries = _this.historyStore.queries;
+          _this.state = { queries };
+          return _this;
+        }
+        QueryHistory2.prototype.render = function () {
+          var _this = this;
+          var queries = this.state.queries.slice().reverse();
+          var queryNodes = queries.map(function (query, i) {
+            return React$1.createElement(
+              HistoryQuery,
+              __assign$5(
+                {
+                  handleEditLabel: _this.onHandleEditLabel,
+                  handleToggleFavorite: _this.onToggleFavorite,
+                  key: i + ":" + (query.label || query.query),
+                  onSelect: _this.props.onSelectQuery,
+                },
+                query
+              )
+            );
+          });
+          return React$1.createElement(
+            "section",
+            { "aria-label": "History" },
+            React$1.createElement(
+              "div",
+              { className: "history-title-bar" },
+              React$1.createElement(
+                "div",
+                { className: "history-title" },
+                "History"
+              ),
+              React$1.createElement(
+                "div",
+                { className: "doc-explorer-rhs" },
+                this.props.children
+              )
+            ),
+            React$1.createElement(
+              "ul",
+              { className: "history-contents" },
+              queryNodes
+            )
+          );
+        };
+        return QueryHistory2;
+      })(React$1.Component);
+      var CodeMirrorSizer = (function () {
+        function CodeMirrorSizer2() {
+          this.sizes = [];
+        }
+        CodeMirrorSizer2.prototype.updateSizes = function (components) {
+          var _this = this;
+          components.forEach(function (component, i) {
+            if (component) {
+              var size = component.getClientHeight();
+              if (i <= _this.sizes.length && size !== _this.sizes[i]) {
+                var editor = component.getCodeMirror();
+                if (editor) {
+                  editor.setSize(null, null);
+                }
+              }
+              _this.sizes[i] = size;
+            }
+          });
+        };
+        return CodeMirrorSizer2;
+      })();
+      function isQuotaError(storage, e) {
+        return (
+          e instanceof DOMException &&
+          (e.code === 22 ||
+            e.code === 1014 ||
+            e.name === "QuotaExceededError" ||
+            e.name === "NS_ERROR_DOM_QUOTA_REACHED") &&
+          storage.length !== 0
+        );
+      }
+      var StorageAPI = (function () {
+        function StorageAPI2(storage) {
+          this.storage =
+            storage ||
+            (typeof window !== "undefined" ? window.localStorage : null);
+        }
+        StorageAPI2.prototype.get = function (name2) {
+          if (this.storage) {
+            var value = this.storage.getItem("graphiql:" + name2);
+            if (value === "null" || value === "undefined") {
+              this.storage.removeItem("graphiql:" + name2);
+              return null;
+            }
+            if (value) {
+              return value;
+            }
+          }
+          return null;
+        };
+        StorageAPI2.prototype.set = function (name2, value) {
+          var quotaError = false;
+          var error2 = null;
+          if (this.storage) {
+            var key = "graphiql:" + name2;
+            if (value) {
+              try {
+                this.storage.setItem(key, value);
+              } catch (e) {
+                error2 = e;
+                quotaError = isQuotaError(this.storage, e);
+              }
+            } else {
+              this.storage.removeItem(key);
+            }
+          }
+          return {
+            isQuotaError: quotaError,
+            error: error2,
+          };
+        };
+        return StorageAPI2;
+      })();
+      function getSelectedOperationName(
+        prevOperations,
+        prevSelectedOperationName,
+        operations
+      ) {
+        if (!operations || operations.length < 1) {
+          return;
+        }
+        var names = operations.map(function (op) {
+          return op.name && op.name.value;
+        });
+        if (
+          prevSelectedOperationName &&
+          names.indexOf(prevSelectedOperationName) !== -1
+        ) {
+          return prevSelectedOperationName;
+        }
+        if (prevSelectedOperationName && prevOperations) {
+          var prevNames = prevOperations.map(function (op) {
+            return op.name && op.name.value;
+          });
+          var prevIndex = prevNames.indexOf(prevSelectedOperationName);
+          if (prevIndex !== -1 && prevIndex < names.length) {
+            return names[prevIndex];
+          }
+        }
+        return names[0];
+      }
+      function find$1(list3, predicate) {
+        for (var i = 0; i < list3.length; i++) {
+          if (predicate(list3[i])) {
+            return list3[i];
+          }
+        }
+      }
+      function fillLeafs(schema, docString, getDefaultFieldNames) {
+        var insertions = [];
+        if (!schema || !docString) {
+          return { insertions, result: docString };
+        }
+        var ast2;
+        try {
+          ast2 = parse$1(docString);
+        } catch (error2) {
+          return { insertions, result: docString };
+        }
+        var fieldNameFn = getDefaultFieldNames || defaultGetDefaultFieldNames$1;
+        var typeInfo = new TypeInfo(schema);
+        visit(ast2, {
+          leave: function (node) {
+            typeInfo.leave(node);
+          },
+          enter: function (node) {
+            typeInfo.enter(node);
+            if (node.kind === "Field" && !node.selectionSet) {
+              var fieldType = typeInfo.getType();
+              var selectionSet = buildSelectionSet(
+                isFieldType(fieldType),
+                fieldNameFn
+              );
+              if (selectionSet && node.loc) {
+                var indent2 = getIndentation(docString, node.loc.start);
+                insertions.push({
+                  index: node.loc.end,
+                  string:
+                    " " + print(selectionSet).replace(/\n/g, "\n" + indent2),
+                });
+              }
+            }
+          },
+        });
+        return {
+          insertions,
+          result: withInsertions(docString, insertions),
+        };
+      }
+      function defaultGetDefaultFieldNames$1(type2) {
+        if (!("getFields" in type2)) {
+          return [];
+        }
+        var fields = type2.getFields();
+        if (fields.id) {
+          return ["id"];
+        }
+        if (fields.edges) {
+          return ["edges"];
+        }
+        if (fields.node) {
+          return ["node"];
+        }
+        var leafFieldNames = [];
+        Object.keys(fields).forEach(function (fieldName) {
+          if (isLeafType(fields[fieldName].type)) {
+            leafFieldNames.push(fieldName);
+          }
+        });
+        return leafFieldNames;
+      }
+      function buildSelectionSet(type2, getDefaultFieldNames) {
+        var namedType = getNamedType(type2);
+        if (!type2 || isLeafType(type2)) {
+          return;
+        }
+        var fieldNames = getDefaultFieldNames(namedType);
+        if (
+          !Array.isArray(fieldNames) ||
+          fieldNames.length === 0 ||
+          !("getFields" in namedType)
+        ) {
+          return;
+        }
+        return {
+          kind: Kind.SELECTION_SET,
+          selections: fieldNames.map(function (fieldName) {
+            var fieldDef = namedType.getFields()[fieldName];
+            var fieldType = fieldDef ? fieldDef.type : null;
+            return {
+              kind: Kind.FIELD,
+              name: {
+                kind: Kind.NAME,
+                value: fieldName,
+              },
+              selectionSet: buildSelectionSet(fieldType, getDefaultFieldNames),
+            };
+          }),
+        };
+      }
+      function withInsertions(initial, insertions) {
+        if (insertions.length === 0) {
+          return initial;
+        }
+        var edited = "";
+        var prevIndex = 0;
+        insertions.forEach(function (_a2) {
+          var index = _a2.index,
+            string2 = _a2.string;
+          edited += initial.slice(prevIndex, index) + string2;
+          prevIndex = index;
+        });
+        edited += initial.slice(prevIndex);
+        return edited;
+      }
+      function getIndentation(str, index) {
+        var indentStart = index;
+        var indentEnd = index;
+        while (indentStart) {
+          var c = str.charCodeAt(indentStart - 1);
+          if (c === 10 || c === 13 || c === 8232 || c === 8233) {
+            break;
+          }
+          indentStart--;
+          if (c !== 9 && c !== 11 && c !== 12 && c !== 32 && c !== 160) {
+            indentEnd = indentStart;
+          }
+        }
+        return str.substring(indentStart, indentEnd);
+      }
+      function isFieldType(fieldType) {
+        if (fieldType) {
+          return fieldType;
+        }
+      }
+      function getLeft(initialElem) {
+        var pt = 0;
+        var elem = initialElem;
+        while (elem.offsetParent) {
+          pt += elem.offsetLeft;
+          elem = elem.offsetParent;
+        }
+        return pt;
+      }
+      function getTop(initialElem) {
+        var pt = 0;
+        var elem = initialElem;
+        while (elem.offsetParent) {
+          pt += elem.offsetTop;
+          elem = elem.offsetParent;
+        }
+        return pt;
+      }
+      var __assign$4 =
+        (globalThis && globalThis.__assign) ||
+        function () {
+          __assign$4 =
+            Object.assign ||
+            function (t2) {
+              for (var s, i = 1, n2 = arguments.length; i < n2; i++) {
+                s = arguments[i];
+                for (var p2 in s)
+                  if (Object.prototype.hasOwnProperty.call(s, p2))
+                    t2[p2] = s[p2];
+              }
+              return t2;
+            };
+          return __assign$4.apply(this, arguments);
+        };
+      var __values$2 =
+        (globalThis && globalThis.__values) ||
+        function (o) {
+          var s = typeof Symbol === "function" && Symbol.iterator,
+            m = s && o[s],
+            i = 0;
+          if (m) return m.call(o);
+          if (o && typeof o.length === "number")
+            return {
+              next: function () {
+                if (o && i >= o.length) o = void 0;
+                return { value: o && o[i++], done: !o };
+              },
+            };
+          throw new TypeError(
+            s ? "Object is not iterable." : "Symbol.iterator is not defined."
+          );
+        };
+      var __read$2 =
+        (globalThis && globalThis.__read) ||
+        function (o, n2) {
+          var m = typeof Symbol === "function" && o[Symbol.iterator];
+          if (!m) return o;
+          var i = m.call(o),
+            r2,
+            ar = [],
+            e;
+          try {
+            while ((n2 === void 0 || n2-- > 0) && !(r2 = i.next()).done)
+              ar.push(r2.value);
+          } catch (error2) {
+            e = { error: error2 };
+          } finally {
+            try {
+              if (r2 && !r2.done && (m = i["return"])) m.call(i);
+            } finally {
+              if (e) throw e.error;
+            }
+          }
+          return ar;
+        };
+      var __spread$1 =
+        (globalThis && globalThis.__spread) ||
+        function () {
+          for (var ar = [], i = 0; i < arguments.length; i++)
+            ar = ar.concat(__read$2(arguments[i]));
+          return ar;
+        };
+      function uniqueBy(array, iteratee) {
+        var e_1, _a2;
+        var FilteredMap = /* @__PURE__ */ new Map();
+        var result2 = [];
+        try {
+          for (
+            var array_1 = __values$2(array), array_1_1 = array_1.next();
+            !array_1_1.done;
+            array_1_1 = array_1.next()
+          ) {
+            var item = array_1_1.value;
+            if (item.kind === "Field") {
+              var uniqueValue = iteratee(item);
+              var existing = FilteredMap.get(uniqueValue);
+              if (item.directives && item.directives.length) {
+                var itemClone = __assign$4({}, item);
+                result2.push(itemClone);
+              } else if (
+                existing &&
+                existing.selectionSet &&
+                item.selectionSet
+              ) {
+                existing.selectionSet.selections = __spread$1(
+                  existing.selectionSet.selections,
+                  item.selectionSet.selections
+                );
+              } else if (!existing) {
+                var itemClone = __assign$4({}, item);
+                FilteredMap.set(uniqueValue, itemClone);
+                result2.push(itemClone);
+              }
+            } else {
+              result2.push(item);
+            }
+          }
+        } catch (e_1_1) {
+          e_1 = { error: e_1_1 };
+        } finally {
+          try {
+            if (array_1_1 && !array_1_1.done && (_a2 = array_1.return))
+              _a2.call(array_1);
+          } finally {
+            if (e_1) throw e_1.error;
+          }
+        }
+        return result2;
+      }
+      function inlineRelevantFragmentSpreads(
+        fragmentDefinitions,
+        selections,
+        selectionSetType
+      ) {
+        var e_2, _a2;
+        var _b;
+        var selectionSetTypeName = selectionSetType
+          ? getNamedType(selectionSetType).name
+          : null;
+        var outputSelections = [];
+        var seenSpreads = [];
+        try {
+          for (
+            var selections_1 = __values$2(selections),
+              selections_1_1 = selections_1.next();
+            !selections_1_1.done;
+            selections_1_1 = selections_1.next()
+          ) {
+            var selection = selections_1_1.value;
+            if (selection.kind === "FragmentSpread") {
+              var fragmentName = selection.name.value;
+              if (!selection.directives || selection.directives.length === 0) {
+                if (seenSpreads.indexOf(fragmentName) >= 0) {
+                  continue;
+                } else {
+                  seenSpreads.push(fragmentName);
+                }
+              }
+              var fragmentDefinition =
+                fragmentDefinitions[selection.name.value];
+              if (fragmentDefinition) {
+                var typeCondition = fragmentDefinition.typeCondition,
+                  directives = fragmentDefinition.directives,
+                  selectionSet = fragmentDefinition.selectionSet;
+                selection = {
+                  kind: Kind.INLINE_FRAGMENT,
+                  typeCondition,
+                  directives,
+                  selectionSet,
+                };
+              }
+            }
+            if (
+              selection.kind === Kind.INLINE_FRAGMENT &&
+              (!selection.directives ||
+                ((_b = selection.directives) === null || _b === void 0
+                  ? void 0
+                  : _b.length) === 0)
+            ) {
+              var fragmentTypeName = selection.typeCondition
+                ? selection.typeCondition.name.value
+                : null;
+              if (
+                !fragmentTypeName ||
+                fragmentTypeName === selectionSetTypeName
+              ) {
+                outputSelections.push.apply(
+                  outputSelections,
+                  __spread$1(
+                    inlineRelevantFragmentSpreads(
+                      fragmentDefinitions,
+                      selection.selectionSet.selections,
+                      selectionSetType
+                    )
+                  )
+                );
+                continue;
+              }
+            }
+            outputSelections.push(selection);
+          }
+        } catch (e_2_1) {
+          e_2 = { error: e_2_1 };
+        } finally {
+          try {
+            if (
+              selections_1_1 &&
+              !selections_1_1.done &&
+              (_a2 = selections_1.return)
+            )
+              _a2.call(selections_1);
+          } finally {
+            if (e_2) throw e_2.error;
+          }
+        }
+        return outputSelections;
+      }
+      function mergeAST(documentAST, schema) {
+        var e_3, _a2;
+        var typeInfo = schema ? new TypeInfo(schema) : null;
+        var fragmentDefinitions = /* @__PURE__ */ Object.create(null);
+        try {
+          for (
+            var _b = __values$2(documentAST.definitions), _c = _b.next();
+            !_c.done;
+            _c = _b.next()
+          ) {
+            var definition = _c.value;
+            if (definition.kind === Kind.FRAGMENT_DEFINITION) {
+              fragmentDefinitions[definition.name.value] = definition;
+            }
+          }
+        } catch (e_3_1) {
+          e_3 = { error: e_3_1 };
+        } finally {
+          try {
+            if (_c && !_c.done && (_a2 = _b.return)) _a2.call(_b);
+          } finally {
+            if (e_3) throw e_3.error;
+          }
+        }
+        var visitors = {
+          SelectionSet: function (node) {
+            var selectionSetType = typeInfo ? typeInfo.getParentType() : null;
+            var selections = node.selections;
+            selections = inlineRelevantFragmentSpreads(
+              fragmentDefinitions,
+              selections,
+              selectionSetType
+            );
+            selections = uniqueBy(selections, function (selection) {
+              return selection.alias
+                ? selection.alias.value
+                : selection.name.value;
+            });
+            return __assign$4(__assign$4({}, node), { selections });
+          },
+          FragmentDefinition: function () {
+            return null;
+          },
+        };
+        return visit(
+          documentAST,
+          typeInfo ? visitWithTypeInfo(typeInfo, visitors) : visitors
+        );
+      }
+      var staticName = "IntrospectionQuery";
+      var introspectionQueryName = staticName;
+      /*!
+       * is-primitive <https://github.com/jonschlinkert/is-primitive>
+       *
+       * Copyright (c) 2014-present, Jon Schlinkert.
+       * Released under the MIT License.
+       */
+      var isPrimitive$1 = function isPrimitive(val) {
+        if (typeof val === "object") {
+          return val === null;
+        }
+        return typeof val !== "function";
+      };
+      /*!
+       * isobject <https://github.com/jonschlinkert/isobject>
+       *
+       * Copyright (c) 2014-2017, Jon Schlinkert.
+       * Released under the MIT License.
+       */
+      var isobject = function isObject(val) {
+        return (
+          val != null && typeof val === "object" && Array.isArray(val) === false
+        );
+      };
+      /*!
+       * is-plain-object <https://github.com/jonschlinkert/is-plain-object>
+       *
+       * Copyright (c) 2014-2017, Jon Schlinkert.
+       * Released under the MIT License.
+       */
+      var isObject$5 = isobject;
+      function isObjectObject(o) {
+        return (
+          isObject$5(o) === true &&
+          Object.prototype.toString.call(o) === "[object Object]"
+        );
+      }
+      var isPlainObject$1 = function isPlainObject(o) {
+        var ctor, prot;
+        if (isObjectObject(o) === false) return false;
+        ctor = o.constructor;
+        if (typeof ctor !== "function") return false;
+        prot = ctor.prototype;
+        if (isObjectObject(prot) === false) return false;
+        if (prot.hasOwnProperty("isPrototypeOf") === false) {
+          return false;
+        }
+        return true;
+      };
+      /*!
+       * set-value <https://github.com/jonschlinkert/set-value>
+       *
+       * Copyright (c) Jon Schlinkert (https://github.com/jonschlinkert).
+       * Released under the MIT License.
+       */
+      const { deleteProperty } = Reflect;
+      const isPrimitive2 = isPrimitive$1;
+      const isPlainObject2 = isPlainObject$1;
+      const isObject$4 = (value) => {
+        return (
+          (typeof value === "object" && value !== null) ||
+          typeof value === "function"
+        );
+      };
+      const isUnsafeKey = (key) => {
+        return (
+          key === "__proto__" || key === "constructor" || key === "prototype"
+        );
+      };
+      const validateKey = (key) => {
+        if (!isPrimitive2(key)) {
+          throw new TypeError("Object keys must be strings or symbols");
+        }
+        if (isUnsafeKey(key)) {
+          throw new Error(`Cannot set unsafe key: "${key}"`);
+        }
+      };
+      const toStringKey = (input) => {
+        return Array.isArray(input)
+          ? input.flat().map(String).join(",")
+          : input;
+      };
+      const createMemoKey = (input, options) => {
+        if (typeof input !== "string" || !options) return input;
+        let key = input + ";";
+        if (options.arrays !== void 0) key += `arrays=${options.arrays};`;
+        if (options.separator !== void 0)
+          key += `separator=${options.separator};`;
+        if (options.split !== void 0) key += `split=${options.split};`;
+        if (options.merge !== void 0) key += `merge=${options.merge};`;
+        if (options.preservePaths !== void 0)
+          key += `preservePaths=${options.preservePaths};`;
+        return key;
+      };
+      const memoize = (input, options, fn) => {
+        const key = toStringKey(
+          options ? createMemoKey(input, options) : input
+        );
+        validateKey(key);
+        const value = setValue.cache.get(key) || fn();
+        setValue.cache.set(key, value);
+        return value;
+      };
+      const splitString = (input, options = {}) => {
+        const sep = options.separator || ".";
+        const preserve = sep === "/" ? false : options.preservePaths;
+        if (
+          typeof input === "string" &&
+          preserve !== false &&
+          /\//.test(input)
+        ) {
+          return [input];
+        }
+        const parts = [];
+        let part2 = "";
+        const push2 = (part3) => {
+          let number;
+          if (
+            part3.trim() !== "" &&
+            Number.isInteger((number = Number(part3)))
+          ) {
+            parts.push(number);
+          } else {
+            parts.push(part3);
+          }
+        };
+        for (let i = 0; i < input.length; i++) {
+          const value = input[i];
+          if (value === "\\") {
+            part2 += input[++i];
+            continue;
+          }
+          if (value === sep) {
+            push2(part2);
+            part2 = "";
+            continue;
+          }
+          part2 += value;
+        }
+        if (part2) {
+          push2(part2);
+        }
+        return parts;
+      };
+      const split = (input, options) => {
+        if (options && typeof options.split === "function")
+          return options.split(input);
+        if (typeof input === "symbol") return [input];
+        if (Array.isArray(input)) return input;
+        return memoize(input, options, () => splitString(input, options));
+      };
+      const assignProp = (obj, prop2, value, options) => {
+        validateKey(prop2);
+        if (value === void 0) {
+          deleteProperty(obj, prop2);
+        } else if (options && options.merge) {
+          const merge2 =
+            options.merge === "function" ? options.merge : Object.assign;
+          if (merge2 && isPlainObject2(obj[prop2]) && isPlainObject2(value)) {
+            obj[prop2] = merge2(obj[prop2], value);
+          } else {
+            obj[prop2] = value;
+          }
+        } else {
+          obj[prop2] = value;
+        }
+        return obj;
+      };
+      const setValue = (target2, path, value, options) => {
+        if (!path || !isObject$4(target2)) return target2;
+        const keys = split(path, options);
+        let obj = target2;
+        for (let i = 0; i < keys.length; i++) {
+          const key = keys[i];
+          const next = keys[i + 1];
+          validateKey(key);
+          if (next === void 0) {
+            assignProp(obj, key, value, options);
+            break;
+          }
+          if (typeof next === "number" && !Array.isArray(obj[key])) {
+            obj = obj[key] = [];
+            continue;
+          }
+          if (!isObject$4(obj[key])) {
+            obj[key] = {};
+          }
+          obj = obj[key];
+        }
+        return target2;
+      };
+      setValue.split = split;
+      setValue.cache = /* @__PURE__ */ new Map();
+      setValue.clear = () => {
+        setValue.cache = /* @__PURE__ */ new Map();
+      };
+      var setValue_1 = setValue;
+      var __assign$3 =
+        (globalThis && globalThis.__assign) ||
+        function () {
+          __assign$3 =
+            Object.assign ||
+            function (t2) {
+              for (var s, i = 1, n2 = arguments.length; i < n2; i++) {
+                s = arguments[i];
+                for (var p2 in s)
+                  if (Object.prototype.hasOwnProperty.call(s, p2))
+                    t2[p2] = s[p2];
+              }
+              return t2;
+            };
+          return __assign$3.apply(this, arguments);
+        };
+      function TabCloseButton(props) {
+        return React$1.createElement("div", {
+          role: "button",
+          "aria-pressed": false,
+          className: "close",
+          "aria-label": "Close Tab",
+          title: "Close Tab",
+          onClick: function (ev) {
+            ev.stopPropagation();
+            props.onClick();
+          },
+        });
+      }
+      function Tab(props) {
+        return React$1.createElement(
+          "button",
+          __assign$3({}, props.tabProps, {
+            role: "tab",
+            type: "button",
+            "aria-selected": props.isActive,
+            title: props.title,
+            className: "tab" + (props.isActive ? " active" : ""),
+            onClick: props.onSelect,
+          }),
+          props.title,
+          props.isCloseable
+            ? React$1.createElement(TabCloseButton, {
+                onClick: function () {
+                  return props.onClose();
+                },
+              })
+            : null
+        );
+      }
+      function TabAddButton(props) {
+        return React$1.createElement(
+          "button",
+          {
+            onClick: props.onClick,
+            className: "tab-add",
+            title: "Create new tab",
+          },
+          React$1.createElement("span", null, "+")
+        );
+      }
+      function Tabs(props) {
+        return React$1.createElement(
+          "div",
+          __assign$3({ role: "tablist", className: "tabs" }, props.tabsProps),
+          props.children
+        );
+      }
+      function fuzzyExtractOperationTitle(str) {
+        var _a2;
+        var regex2 =
+          /^(?!.*#).*(query|subscription|mutation)\s+([a-zA-Z0-9_]+)/;
+        var match2 = regex2.exec(str);
+        return (_a2 =
+          match2 === null || match2 === void 0 ? void 0 : match2[2]) !== null &&
+          _a2 !== void 0
+          ? _a2
+          : "<untitled>";
+      }
+      function idFromTabContents(params) {
+        var _a2, _b, _c;
+        return [
+          (_a2 = params.query) !== null && _a2 !== void 0 ? _a2 : "",
+          (_b = params.variables) !== null && _b !== void 0 ? _b : "",
+          (_c = params.headers) !== null && _c !== void 0 ? _c : "",
+        ].join("|");
+      }
+      function guid() {
+        var s4 = function () {
+          return Math.floor((1 + Math.random()) * 65536)
+            .toString(16)
+            .substring(1);
+        };
+        return (
+          s4() +
+          s4() +
+          "-" +
+          s4() +
+          "-" +
+          s4() +
+          "-" +
+          s4() +
+          "-" +
+          s4() +
+          s4() +
+          s4()
+        );
+      }
+      var __extends$1 =
+        (globalThis && globalThis.__extends) ||
+        (function () {
+          var extendStatics = function (d, b) {
+            extendStatics =
+              Object.setPrototypeOf ||
+              ({ __proto__: [] } instanceof Array &&
+                function (d2, b2) {
+                  d2.__proto__ = b2;
+                }) ||
+              function (d2, b2) {
+                for (var p2 in b2)
+                  if (Object.prototype.hasOwnProperty.call(b2, p2))
+                    d2[p2] = b2[p2];
+              };
+            return extendStatics(d, b);
+          };
+          return function (d, b) {
+            extendStatics(d, b);
+            function __() {
+              this.constructor = d;
+            }
+            d.prototype =
+              b === null
+                ? Object.create(b)
+                : ((__.prototype = b.prototype), new __());
+          };
+        })();
+      var __assign$2 =
+        (globalThis && globalThis.__assign) ||
+        function () {
+          __assign$2 =
+            Object.assign ||
+            function (t2) {
+              for (var s, i = 1, n2 = arguments.length; i < n2; i++) {
+                s = arguments[i];
+                for (var p2 in s)
+                  if (Object.prototype.hasOwnProperty.call(s, p2))
+                    t2[p2] = s[p2];
+              }
+              return t2;
+            };
+          return __assign$2.apply(this, arguments);
+        };
+      var __awaiter$1 =
+        (globalThis && globalThis.__awaiter) ||
+        function (thisArg, _arguments, P2, generator) {
+          function adopt(value) {
+            return value instanceof P2
+              ? value
+              : new P2(function (resolve) {
+                  resolve(value);
+                });
+          }
+          return new (P2 || (P2 = Promise))(function (resolve, reject2) {
+            function fulfilled(value) {
+              try {
+                step(generator.next(value));
+              } catch (e) {
+                reject2(e);
+              }
+            }
+            function rejected(value) {
+              try {
+                step(generator["throw"](value));
+              } catch (e) {
+                reject2(e);
+              }
+            }
+            function step(result2) {
+              result2.done
+                ? resolve(result2.value)
+                : adopt(result2.value).then(fulfilled, rejected);
+            }
+            step(
+              (generator = generator.apply(thisArg, _arguments || [])).next()
+            );
+          });
+        };
+      var __generator$1 =
+        (globalThis && globalThis.__generator) ||
+        function (thisArg, body) {
+          var _ = {
+              label: 0,
+              sent: function () {
+                if (t2[0] & 1) throw t2[1];
+                return t2[1];
+              },
+              trys: [],
+              ops: [],
+            },
+            f,
+            y2,
+            t2,
+            g;
+          return (
+            (g = { next: verb(0), throw: verb(1), return: verb(2) }),
+            typeof Symbol === "function" &&
+              (g[Symbol.iterator] = function () {
+                return this;
+              }),
+            g
+          );
+          function verb(n2) {
+            return function (v2) {
+              return step([n2, v2]);
+            };
+          }
+          function step(op) {
+            if (f) throw new TypeError("Generator is already executing.");
+            while (_)
+              try {
+                if (
+                  ((f = 1),
+                  y2 &&
+                    (t2 =
+                      op[0] & 2
+                        ? y2["return"]
+                        : op[0]
+                        ? y2["throw"] || ((t2 = y2["return"]) && t2.call(y2), 0)
+                        : y2.next) &&
+                    !(t2 = t2.call(y2, op[1])).done)
+                )
+                  return t2;
+                if (((y2 = 0), t2)) op = [op[0] & 2, t2.value];
+                switch (op[0]) {
+                  case 0:
+                  case 1:
+                    t2 = op;
+                    break;
+                  case 4:
+                    _.label++;
+                    return { value: op[1], done: false };
+                  case 5:
+                    _.label++;
+                    y2 = op[1];
+                    op = [0];
+                    continue;
+                  case 7:
+                    op = _.ops.pop();
+                    _.trys.pop();
+                    continue;
+                  default:
+                    if (
+                      !((t2 = _.trys),
+                      (t2 = t2.length > 0 && t2[t2.length - 1])) &&
+                      (op[0] === 6 || op[0] === 2)
+                    ) {
+                      _ = 0;
+                      continue;
+                    }
+                    if (
+                      op[0] === 3 &&
+                      (!t2 || (op[1] > t2[0] && op[1] < t2[3]))
+                    ) {
+                      _.label = op[1];
+                      break;
+                    }
+                    if (op[0] === 6 && _.label < t2[1]) {
+                      _.label = t2[1];
+                      t2 = op;
+                      break;
+                    }
+                    if (t2 && _.label < t2[2]) {
+                      _.label = t2[2];
+                      _.ops.push(op);
+                      break;
+                    }
+                    if (t2[2]) _.ops.pop();
+                    _.trys.pop();
+                    continue;
+                }
+                op = body.call(thisArg, _);
+              } catch (e) {
+                op = [6, e];
+                y2 = 0;
+              } finally {
+                f = t2 = 0;
+              }
+            if (op[0] & 5) throw op[1];
+            return { value: op[0] ? op[1] : void 0, done: true };
+          }
+        };
+      var __rest =
+        (globalThis && globalThis.__rest) ||
+        function (s, e) {
+          var t2 = {};
+          for (var p2 in s)
+            if (
+              Object.prototype.hasOwnProperty.call(s, p2) &&
+              e.indexOf(p2) < 0
+            )
+              t2[p2] = s[p2];
+          if (s != null && typeof Object.getOwnPropertySymbols === "function")
+            for (
+              var i = 0, p2 = Object.getOwnPropertySymbols(s);
+              i < p2.length;
+              i++
+            ) {
+              if (
+                e.indexOf(p2[i]) < 0 &&
+                Object.prototype.propertyIsEnumerable.call(s, p2[i])
+              )
+                t2[p2[i]] = s[p2[i]];
+            }
+          return t2;
+        };
+      var __asyncValues$1 =
+        (globalThis && globalThis.__asyncValues) ||
+        function (o) {
+          if (!Symbol.asyncIterator)
+            throw new TypeError("Symbol.asyncIterator is not defined.");
+          var m = o[Symbol.asyncIterator],
+            i;
+          return m
+            ? m.call(o)
+            : ((o =
+                typeof __values$1 === "function"
+                  ? __values$1(o)
+                  : o[Symbol.iterator]()),
+              (i = {}),
+              verb("next"),
+              verb("throw"),
+              verb("return"),
+              (i[Symbol.asyncIterator] = function () {
+                return this;
+              }),
+              i);
+          function verb(n2) {
+            i[n2] =
+              o[n2] &&
+              function (v2) {
+                return new Promise(function (resolve, reject2) {
+                  (v2 = o[n2](v2)), settle(resolve, reject2, v2.done, v2.value);
+                });
+              };
+          }
+          function settle(resolve, reject2, d, v2) {
+            Promise.resolve(v2).then(function (v3) {
+              resolve({ value: v3, done: d });
+            }, reject2);
+          }
+        };
+      var __read$1 =
+        (globalThis && globalThis.__read) ||
+        function (o, n2) {
+          var m = typeof Symbol === "function" && o[Symbol.iterator];
+          if (!m) return o;
+          var i = m.call(o),
+            r2,
+            ar = [],
+            e;
+          try {
+            while ((n2 === void 0 || n2-- > 0) && !(r2 = i.next()).done)
+              ar.push(r2.value);
+          } catch (error2) {
+            e = { error: error2 };
+          } finally {
+            try {
+              if (r2 && !r2.done && (m = i["return"])) m.call(i);
+            } finally {
+              if (e) throw e.error;
+            }
+          }
+          return ar;
+        };
+      var __spread =
+        (globalThis && globalThis.__spread) ||
+        function () {
+          for (var ar = [], i = 0; i < arguments.length; i++)
+            ar = ar.concat(__read$1(arguments[i]));
+          return ar;
+        };
+      var __values$1 =
+        (globalThis && globalThis.__values) ||
+        function (o) {
+          var s = typeof Symbol === "function" && Symbol.iterator,
+            m = s && o[s],
+            i = 0;
+          if (m) return m.call(o);
+          if (o && typeof o.length === "number")
+            return {
+              next: function () {
+                if (o && i >= o.length) o = void 0;
+                return { value: o && o[i++], done: !o };
+              },
+            };
+          throw new TypeError(
+            s ? "Object is not iterable." : "Symbol.iterator is not defined."
+          );
+        };
+      var DEFAULT_DOC_EXPLORER_WIDTH = 350;
+      var majorVersion = parseInt(React$1.version.slice(0, 2), 10);
+      if (majorVersion < 16) {
+        throw Error(
+          [
+            "GraphiQL 0.18.0 and after is not compatible with React 15 or below.",
+            "If you are using a CDN source (jsdelivr, unpkg, etc), follow this example:",
+            "https://github.com/graphql/graphiql/blob/master/examples/graphiql-cdn/index.html#L49",
+          ].join("\n")
+        );
+      }
+      var stringify$1 = function (obj) {
+        return JSON.stringify(obj, null, 2);
+      };
+      var formatSingleError = function (error2) {
+        return __assign$2(__assign$2({}, error2), {
+          message: error2.message,
+          stack: error2.stack,
+        });
+      };
+      var handleSingleError = function (error2) {
+        if (error2 instanceof GraphQLError) {
+          return error2.toString();
+        }
+        if (error2 instanceof Error) {
+          return formatSingleError(error2);
+        }
+        return error2;
+      };
+      var GraphiQL = (function (_super2) {
+        __extends$1(GraphiQL2, _super2);
+        function GraphiQL2(props) {
+          var e_1, _a2, e_2, _b;
+          var _c, _d, _e, _f, _g, _h, _j;
+          var _this = _super2.call(this, props) || this;
+          _this._editorQueryID = 0;
+          _this.safeSetState = function (nextState, callback) {
+            _this.componentIsMounted && _this.setState(nextState, callback);
+          };
+          _this.persistTabsState = function () {
+            var _a3, _b2;
+            if (_this.props.tabs) {
+              _this._storage.set(
+                "tabState",
+                JSON.stringify(_this.state.tabs, function (key, value) {
+                  return key === "response" ||
+                    (_this.state.shouldPersistHeaders && key === "headers")
+                    ? void 0
+                    : value;
+                })
+              );
+              if (typeof _this.props.tabs === "object") {
+                (_b2 = (_a3 = _this.props.tabs).onTabChange) === null ||
+                _b2 === void 0
+                  ? void 0
+                  : _b2.call(_a3, _this.state.tabs);
+              }
+            }
+          };
+          _this.makeHandleOnSelectTab = function (index2) {
+            return function () {
+              _this.handleStopQuery();
+              _this.setState(function (state) {
+                return stateOnSelectTabReducer(index2, state);
+              }, _this.persistTabsState);
+            };
+          };
+          _this.makeHandleOnCloseTab = function (index2) {
+            return function () {
+              if (_this.state.tabs.activeTabIndex === index2) {
+                _this.handleStopQuery();
+              }
+              _this.setState(function (state) {
+                return stateOnCloseTabReducer(index2, state);
+              }, _this.persistTabsState);
+            };
+          };
+          _this.handleOnAddTab = function () {
+            _this.setState(function (state) {
+              return stateOnTabAddReducer(state);
+            }, _this.persistTabsState);
+          };
+          _this.handleClickReference = function (reference3) {
+            _this.setState({ docExplorerOpen: true }, function () {
+              if (_this.docExplorerComponent) {
+                _this.docExplorerComponent.showDocForReference(reference3);
+              }
+            });
+            _this._storage.set(
+              "docExplorerOpen",
+              JSON.stringify(_this.state.docExplorerOpen)
+            );
+          };
+          _this.handleRunQuery = function (selectedOperationName) {
+            return __awaiter$1(_this, void 0, void 0, function () {
+              var queryID,
+                editedQuery,
+                variables2,
+                headers2,
+                shouldPersistHeaders2,
+                operationName2,
+                fullResponse_1,
+                subscription,
+                error_1;
+              var _this2 = this;
+              return __generator$1(this, function (_a3) {
+                switch (_a3.label) {
+                  case 0:
+                    this._editorQueryID++;
+                    queryID = this._editorQueryID;
+                    editedQuery = this.autoCompleteLeafs() || this.state.query;
+                    variables2 = this.state.variables;
+                    headers2 = this.state.headers;
+                    shouldPersistHeaders2 = this.state.shouldPersistHeaders;
+                    operationName2 = this.state.operationName;
+                    if (
+                      selectedOperationName &&
+                      selectedOperationName !== operationName2
+                    ) {
+                      operationName2 = selectedOperationName;
+                      this.handleEditOperationName(operationName2);
+                    }
+                    _a3.label = 1;
+                  case 1:
+                    _a3.trys.push([1, 3, , 4]);
+                    this.setState({
+                      isWaitingForResponse: true,
+                      response: void 0,
+                      operationName: operationName2,
+                    });
+                    this._storage.set("operationName", operationName2);
+                    if (this._queryHistory) {
+                      this._queryHistory.onUpdateHistory(
+                        editedQuery,
+                        variables2,
+                        headers2,
+                        operationName2
+                      );
+                    } else {
+                      if (this._historyStore) {
+                        this._historyStore.updateHistory(
+                          editedQuery,
+                          variables2,
+                          headers2,
+                          operationName2
+                        );
+                      }
+                    }
+                    fullResponse_1 = { data: {} };
+                    return [
+                      4,
+                      this._fetchQuery(
+                        editedQuery,
+                        variables2,
+                        headers2,
+                        operationName2,
+                        shouldPersistHeaders2,
+                        function (result2) {
+                          var e_3, _a4;
+                          if (queryID === _this2._editorQueryID) {
+                            var maybeMultipart = Array.isArray(result2)
+                              ? result2
+                              : false;
+                            if (
+                              !maybeMultipart &&
+                              typeof result2 !== "string" &&
+                              result2 !== null &&
+                              "hasNext" in result2
+                            ) {
+                              maybeMultipart = [result2];
+                            }
+                            if (maybeMultipart) {
+                              var payload = { data: fullResponse_1.data };
+                              var maybeErrors = __spread(
+                                (fullResponse_1 === null ||
+                                fullResponse_1 === void 0
+                                  ? void 0
+                                  : fullResponse_1.errors) || [],
+                                maybeMultipart
+                                  .map(function (i) {
+                                    return i.errors;
+                                  })
+                                  .flat()
+                                  .filter(Boolean)
+                              );
+                              if (maybeErrors.length) {
+                                payload.errors = maybeErrors;
+                              }
+                              try {
+                                for (
+                                  var maybeMultipart_1 =
+                                      __values$1(maybeMultipart),
+                                    maybeMultipart_1_1 =
+                                      maybeMultipart_1.next();
+                                  !maybeMultipart_1_1.done;
+                                  maybeMultipart_1_1 = maybeMultipart_1.next()
+                                ) {
+                                  var part2 = maybeMultipart_1_1.value;
+                                  var path = part2.path,
+                                    data = part2.data,
+                                    _errors = part2.errors,
+                                    rest = __rest(part2, [
+                                      "path",
+                                      "data",
+                                      "errors",
+                                    ]);
+                                  if (path) {
+                                    if (!data) {
+                                      throw new Error(
+                                        "Expected part to contain a data property, but got " +
+                                          part2
+                                      );
+                                    }
+                                    setValue_1(payload.data, path, data, {
+                                      merge: true,
+                                    });
+                                  } else if (data) {
+                                    payload.data = part2.data;
+                                  }
+                                  fullResponse_1 = __assign$2(
+                                    __assign$2({}, payload),
+                                    rest
+                                  );
+                                }
+                              } catch (e_3_1) {
+                                e_3 = { error: e_3_1 };
+                              } finally {
+                                try {
+                                  if (
+                                    maybeMultipart_1_1 &&
+                                    !maybeMultipart_1_1.done &&
+                                    (_a4 = maybeMultipart_1.return)
+                                  )
+                                    _a4.call(maybeMultipart_1);
+                                } finally {
+                                  if (e_3) throw e_3.error;
+                                }
+                              }
+                              _this2.setState({
+                                isWaitingForResponse: false,
+                                response:
+                                  GraphiQL2.formatResult(fullResponse_1),
+                              });
+                            } else {
+                              var response_1 = GraphiQL2.formatResult(result2);
+                              _this2.setState(function (state) {
+                                return __assign$2(__assign$2({}, state), {
+                                  tabs: __assign$2(__assign$2({}, state.tabs), {
+                                    tabs: state.tabs.tabs.map(function (
+                                      tab2,
+                                      index2
+                                    ) {
+                                      if (
+                                        index2 !== state.tabs.activeTabIndex
+                                      ) {
+                                        return tab2;
+                                      }
+                                      return __assign$2(__assign$2({}, tab2), {
+                                        response: response_1,
+                                      });
+                                    }),
+                                  }),
+                                  isWaitingForResponse: false,
+                                  response: response_1,
+                                });
+                              }, _this2.persistTabsState);
+                            }
+                          }
+                        }
+                      ),
+                    ];
+                  case 2:
+                    subscription = _a3.sent();
+                    this.setState({ subscription });
+                    return [3, 4];
+                  case 3:
+                    error_1 = _a3.sent();
+                    this.setState({
+                      isWaitingForResponse: false,
+                      response: error_1.message,
+                    });
+                    return [3, 4];
+                  case 4:
+                    return [2];
+                }
+              });
+            });
+          };
+          _this.handleStopQuery = function () {
+            var subscription = _this.state.subscription;
+            _this.setState({
+              isWaitingForResponse: false,
+              subscription: null,
+            });
+            if (subscription) {
+              subscription.unsubscribe();
+            }
+          };
+          _this.handlePrettifyQuery = function () {
+            var _a3, _b2, _c2;
+            var editor = _this.getQueryEditor();
+            var editorContent =
+              (_a3 =
+                editor === null || editor === void 0
+                  ? void 0
+                  : editor.getValue()) !== null && _a3 !== void 0
+                ? _a3
+                : "";
+            var prettifiedEditorContent = print(parse$1(editorContent));
+            if (prettifiedEditorContent !== editorContent) {
+              editor === null || editor === void 0
+                ? void 0
+                : editor.setValue(prettifiedEditorContent);
+            }
+            var variableEditor = _this.getVariableEditor();
+            var variableEditorContent =
+              (_b2 =
+                variableEditor === null || variableEditor === void 0
+                  ? void 0
+                  : variableEditor.getValue()) !== null && _b2 !== void 0
+                ? _b2
+                : "";
+            try {
+              var prettifiedVariableEditorContent = JSON.stringify(
+                JSON.parse(variableEditorContent),
+                null,
+                2
+              );
+              if (prettifiedVariableEditorContent !== variableEditorContent) {
+                variableEditor === null || variableEditor === void 0
+                  ? void 0
+                  : variableEditor.setValue(prettifiedVariableEditorContent);
+              }
+            } catch (_d2) {}
+            var headerEditor = _this.getHeaderEditor();
+            var headerEditorContent =
+              (_c2 =
+                headerEditor === null || headerEditor === void 0
+                  ? void 0
+                  : headerEditor.getValue()) !== null && _c2 !== void 0
+                ? _c2
+                : "";
+            try {
+              var prettifiedHeaderEditorContent = JSON.stringify(
+                JSON.parse(headerEditorContent),
+                null,
+                2
+              );
+              if (prettifiedHeaderEditorContent !== headerEditorContent) {
+                headerEditor === null || headerEditor === void 0
+                  ? void 0
+                  : headerEditor.setValue(prettifiedHeaderEditorContent);
+              }
+            } catch (_e2) {}
+          };
+          _this.handleMergeQuery = function () {
+            var editor = _this.getQueryEditor();
+            var query2 = editor.getValue();
+            if (!query2) {
+              return;
+            }
+            var ast2 = _this.state.documentAST;
+            editor.setValue(print(mergeAST(ast2, _this.state.schema)));
+          };
+          _this.handleEditQuery = debounce(100, function (value) {
+            var queryFacts2 = _this._updateQueryFacts(
+              value,
+              _this.state.operationName,
+              _this.state.operations,
+              _this.state.schema
+            );
+            _this.setState(function (state) {
+              return __assign$2(
+                __assign$2(
+                  __assign$2(__assign$2({}, state), { query: value }),
+                  queryFacts2
+                ),
+                {
+                  tabs: tabsStateEditQueryReducer(
+                    value,
+                    state.tabs,
+                    queryFacts2 === null || queryFacts2 === void 0
+                      ? void 0
+                      : queryFacts2.operationName
+                  ),
+                }
+              );
+            }, _this.persistTabsState);
+            _this._storage.set("query", value);
+            if (_this.props.onEditQuery) {
+              return _this.props.onEditQuery(
+                value,
+                queryFacts2 === null || queryFacts2 === void 0
+                  ? void 0
+                  : queryFacts2.documentAST
+              );
+            }
+          });
+          _this.handleCopyQuery = function () {
+            var editor = _this.getQueryEditor();
+            var query2 = editor && editor.getValue();
+            if (!query2) {
+              return;
+            }
+            copyToClipboard(query2);
+            if (_this.props.onCopyQuery) {
+              return _this.props.onCopyQuery(query2);
+            }
+          };
+          _this._updateQueryFacts = function (
+            query2,
+            operationName2,
+            prevOperations,
+            schema2
+          ) {
+            var queryFacts2 = getOperationFacts(schema2, query2);
+            if (queryFacts2) {
+              var updatedOperationName = getSelectedOperationName(
+                prevOperations,
+                operationName2,
+                queryFacts2.operations
+              );
+              var onEditOperationName = _this.props.onEditOperationName;
+              if (
+                onEditOperationName &&
+                updatedOperationName &&
+                operationName2 !== updatedOperationName
+              ) {
+                onEditOperationName(updatedOperationName);
+              }
+              return __assign$2(
+                { operationName: updatedOperationName },
+                queryFacts2
+              );
+            }
+          };
+          _this.handleEditVariables = function (value) {
+            _this.setState(function (state) {
+              return __assign$2(__assign$2({}, state), {
+                variables: value,
+                tabs: tabsStateEditVariablesReducer(value, state.tabs),
+              });
+            }, _this.persistTabsState);
+            debounce(500, function () {
+              return _this._storage.set("variables", value);
+            })();
+            if (_this.props.onEditVariables) {
+              _this.props.onEditVariables(value);
+            }
+          };
+          _this.handleEditHeaders = function (value) {
+            _this.setState(function (state) {
+              return __assign$2(__assign$2({}, state), {
+                headers: value,
+                tabs: tabsStateEditHeadersReducer(value, state.tabs),
+              });
+            }, _this.persistTabsState);
+            _this.props.shouldPersistHeaders &&
+              debounce(500, function () {
+                return _this._storage.set("headers", value);
+              })();
+            if (_this.props.onEditHeaders) {
+              _this.props.onEditHeaders(value);
+            }
+          };
+          _this.handleEditOperationName = function (operationName2) {
+            var onEditOperationName = _this.props.onEditOperationName;
+            if (onEditOperationName) {
+              onEditOperationName(operationName2);
+            }
+          };
+          _this.handleHintInformationRender = function (elem) {
+            elem.addEventListener("click", _this._onClickHintInformation);
+            var onRemoveFn;
+            elem.addEventListener(
+              "DOMNodeRemoved",
+              (onRemoveFn = function () {
+                elem.removeEventListener("DOMNodeRemoved", onRemoveFn);
+                elem.removeEventListener(
+                  "click",
+                  _this._onClickHintInformation
+                );
+              })
+            );
+          };
+          _this.handleEditorRunQuery = function () {
+            _this._runQueryAtCursor();
+          };
+          _this._onClickHintInformation = function (event) {
+            if (
+              (event === null || event === void 0
+                ? void 0
+                : event.currentTarget) &&
+              "className" in event.currentTarget &&
+              event.currentTarget.className === "typeName"
+            ) {
+              var typeName = event.currentTarget.innerHTML;
+              var schema2 = _this.state.schema;
+              if (schema2) {
+                var type_1 = schema2.getType(typeName);
+                if (type_1) {
+                  _this.setState({ docExplorerOpen: true }, function () {
+                    if (_this.docExplorerComponent) {
+                      _this.docExplorerComponent.showDoc(type_1);
+                    }
+                  });
+                  debounce(500, function () {
+                    return _this._storage.set(
+                      "docExplorerOpen",
+                      JSON.stringify(_this.state.docExplorerOpen)
+                    );
+                  })();
+                }
+              }
+            }
+          };
+          _this.handleToggleDocs = function () {
+            if (typeof _this.props.onToggleDocs === "function") {
+              _this.props.onToggleDocs(!_this.state.docExplorerOpen);
+            }
+            _this._storage.set(
+              "docExplorerOpen",
+              JSON.stringify(!_this.state.docExplorerOpen)
+            );
+            _this.setState({ docExplorerOpen: !_this.state.docExplorerOpen });
+          };
+          _this.handleToggleHistory = function () {
+            if (typeof _this.props.onToggleHistory === "function") {
+              _this.props.onToggleHistory(!_this.state.historyPaneOpen);
+            }
+            _this._storage.set(
+              "historyPaneOpen",
+              JSON.stringify(!_this.state.historyPaneOpen)
+            );
+            _this.setState({ historyPaneOpen: !_this.state.historyPaneOpen });
+          };
+          _this.handleSelectHistoryQuery = function (
+            query2,
+            variables2,
+            headers2,
+            operationName2
+          ) {
+            if (query2) {
+              _this.handleEditQuery(query2);
+            }
+            if (variables2) {
+              _this.handleEditVariables(variables2);
+            }
+            if (headers2) {
+              _this.handleEditHeaders(headers2);
+            }
+            if (operationName2) {
+              _this.handleEditOperationName(operationName2);
+            }
+          };
+          _this.handleResizeStart = function (downEvent) {
+            if (!_this._didClickDragBar(downEvent)) {
+              return;
+            }
+            downEvent.preventDefault();
+            var offset = downEvent.clientX - getLeft(downEvent.target);
+            var onMouseMove = function (moveEvent) {
+              if (moveEvent.buttons === 0) {
+                return onMouseUp();
+              }
+              var editorBar = _this.editorBarComponent;
+              var leftSize = moveEvent.clientX - getLeft(editorBar) - offset;
+              var rightSize = editorBar.clientWidth - leftSize;
+              _this.setState({ editorFlex: leftSize / rightSize });
+              debounce(500, function () {
+                return _this._storage.set(
+                  "editorFlex",
+                  JSON.stringify(_this.state.editorFlex)
+                );
+              })();
+            };
+            var onMouseUp = function () {
+              document.removeEventListener("mousemove", onMouseMove);
+              document.removeEventListener("mouseup", onMouseUp);
+              onMouseMove = null;
+              onMouseUp = null;
+            };
+            document.addEventListener("mousemove", onMouseMove);
+            document.addEventListener("mouseup", onMouseUp);
+          };
+          _this.handleResetResize = function () {
+            _this.setState({ editorFlex: 1 });
+            _this._storage.set(
+              "editorFlex",
+              JSON.stringify(_this.state.editorFlex)
+            );
+          };
+          _this.handleDocsResizeStart = function (downEvent) {
+            downEvent.preventDefault();
+            var hadWidth = _this.state.docExplorerWidth;
+            var offset = downEvent.clientX - getLeft(downEvent.target);
+            var onMouseMove = function (moveEvent) {
+              if (moveEvent.buttons === 0) {
+                return onMouseUp();
+              }
+              var app = _this.graphiqlContainer;
+              var cursorPos = moveEvent.clientX - getLeft(app) - offset;
+              var docsSize = app.clientWidth - cursorPos;
+              if (docsSize < 100) {
+                if (typeof _this.props.onToggleDocs === "function") {
+                  _this.props.onToggleDocs(!_this.state.docExplorerOpen);
+                }
+                _this._storage.set(
+                  "docExplorerOpen",
+                  JSON.stringify(_this.state.docExplorerOpen)
+                );
+                _this.setState({ docExplorerOpen: false });
+              } else {
+                _this.setState({
+                  docExplorerOpen: true,
+                  docExplorerWidth: Math.min(docsSize, 650),
+                });
+                debounce(500, function () {
+                  return _this._storage.set(
+                    "docExplorerWidth",
+                    JSON.stringify(_this.state.docExplorerWidth)
+                  );
+                })();
+              }
+              _this._storage.set(
+                "docExplorerOpen",
+                JSON.stringify(_this.state.docExplorerOpen)
+              );
+            };
+            var onMouseUp = function () {
+              if (!_this.state.docExplorerOpen) {
+                _this.setState({ docExplorerWidth: hadWidth });
+                debounce(500, function () {
+                  return _this._storage.set(
+                    "docExplorerWidth",
+                    JSON.stringify(_this.state.docExplorerWidth)
+                  );
+                })();
+              }
+              document.removeEventListener("mousemove", onMouseMove);
+              document.removeEventListener("mouseup", onMouseUp);
+              onMouseMove = null;
+              onMouseUp = null;
+            };
+            document.addEventListener("mousemove", onMouseMove);
+            document.addEventListener("mouseup", onMouseUp);
+          };
+          _this.handleDocsResetResize = function () {
+            _this.setState({
+              docExplorerWidth: DEFAULT_DOC_EXPLORER_WIDTH,
+            });
+            debounce(500, function () {
+              return _this._storage.set(
+                "docExplorerWidth",
+                JSON.stringify(_this.state.docExplorerWidth)
+              );
+            })();
+          };
+          _this.handleTabClickPropogation = function (downEvent) {
+            downEvent.preventDefault();
+            downEvent.stopPropagation();
+          };
+          _this.handleOpenHeaderEditorTab = function (_clickEvent) {
+            _this.setState({
+              headerEditorActive: true,
+              variableEditorActive: false,
+              secondaryEditorOpen: true,
+            });
+          };
+          _this.handleOpenVariableEditorTab = function (_clickEvent) {
+            _this.setState({
+              headerEditorActive: false,
+              variableEditorActive: true,
+              secondaryEditorOpen: true,
+            });
+          };
+          _this.handleSecondaryEditorResizeStart = function (downEvent) {
+            downEvent.preventDefault();
+            var didMove = false;
+            var wasOpen = _this.state.secondaryEditorOpen;
+            var hadHeight = _this.state.secondaryEditorHeight;
+            var offset = downEvent.clientY - getTop(downEvent.target);
+            var onMouseMove = function (moveEvent) {
+              if (moveEvent.buttons === 0) {
+                return onMouseUp();
+              }
+              didMove = true;
+              var editorBar = _this.editorBarComponent;
+              var topSize = moveEvent.clientY - getTop(editorBar) - offset;
+              var bottomSize = editorBar.clientHeight - topSize;
+              if (bottomSize < 60) {
+                _this.setState({
+                  secondaryEditorOpen: false,
+                  secondaryEditorHeight: hadHeight,
+                });
+              } else {
+                _this.setState({
+                  secondaryEditorOpen: true,
+                  secondaryEditorHeight: bottomSize,
+                });
+              }
+              debounce(500, function () {
+                return _this._storage.set(
+                  "secondaryEditorHeight",
+                  JSON.stringify(_this.state.secondaryEditorHeight)
+                );
+              })();
+            };
+            var onMouseUp = function () {
+              if (!didMove) {
+                _this.setState({ secondaryEditorOpen: !wasOpen });
+              }
+              document.removeEventListener("mousemove", onMouseMove);
+              document.removeEventListener("mouseup", onMouseUp);
+              onMouseMove = null;
+              onMouseUp = null;
+            };
+            document.addEventListener("mousemove", onMouseMove);
+            document.addEventListener("mouseup", onMouseUp);
+          };
+          if (typeof props.fetcher !== "function") {
+            throw new TypeError("GraphiQL requires a fetcher function.");
+          }
+          _this._storage = new StorageAPI(props.storage);
+          var maxHistoryLength =
+            (_c = props.maxHistoryLength) !== null && _c !== void 0 ? _c : 20;
+          _this._historyStore = new HistoryStore(
+            _this._storage,
+            maxHistoryLength
+          );
+          _this.componentIsMounted = false;
+          var query =
+            props.query !== void 0
+              ? props.query
+              : _this._storage.get("query")
+              ? _this._storage.get("query")
+              : props.defaultQuery !== void 0
+              ? props.defaultQuery
+              : defaultQuery;
+          var queryFacts = getOperationFacts(props.schema, query);
+          var variables =
+            props.variables !== void 0
+              ? props.variables
+              : _this._storage.get("variables");
+          var headers =
+            props.headers !== void 0
+              ? props.headers
+              : _this._storage.get("headers");
+          var operationName =
+            props.operationName !== void 0
+              ? props.operationName
+              : getSelectedOperationName(
+                  void 0,
+                  _this._storage.get("operationName"),
+                  queryFacts && queryFacts.operations
+                );
+          var docExplorerOpen = props.docExplorerOpen || false;
+          if (_this._storage.get("docExplorerOpen")) {
+            docExplorerOpen = _this._storage.get("docExplorerOpen") === "true";
+          }
+          var secondaryEditorOpen;
+          if (props.defaultVariableEditorOpen !== void 0) {
+            secondaryEditorOpen = props.defaultVariableEditorOpen;
+          } else if (props.defaultSecondaryEditorOpen !== void 0) {
+            secondaryEditorOpen = props.defaultSecondaryEditorOpen;
+          } else {
+            secondaryEditorOpen = Boolean(variables || headers);
+          }
+          var headerEditorEnabled =
+            (_d = props.headerEditorEnabled) !== null && _d !== void 0
+              ? _d
+              : true;
+          var shouldPersistHeaders =
+            (_e = props.shouldPersistHeaders) !== null && _e !== void 0
+              ? _e
+              : false;
+          var schema = props.schema;
+          var response = props.response;
+          var schemaErrors = void 0;
+          if (schema && !_this.props.dangerouslyAssumeSchemaIsValid) {
+            var validationErrors = validateSchema(schema);
+            if (validationErrors && validationErrors.length > 0) {
+              response = GraphiQL2.formatError(validationErrors);
+              schema = void 0;
+              schemaErrors = validationErrors;
+            }
+          }
+          _this._introspectionQuery = getIntrospectionQuery({
+            schemaDescription:
+              (_f = props.schemaDescription) !== null && _f !== void 0
+                ? _f
+                : void 0,
+            inputValueDeprecation:
+              (_g = props.inputValueDeprecation) !== null && _g !== void 0
+                ? _g
+                : void 0,
+          });
+          _this._introspectionQueryName =
+            (_h = props.introspectionQueryName) !== null && _h !== void 0
+              ? _h
+              : introspectionQueryName;
+          _this._introspectionQuerySansSubscriptions =
+            _this._introspectionQuery.replace("subscriptionType { name }", "");
+          var initialTabHash = idFromTabContents({
+            query,
+            variables,
+            headers,
+          });
+          var initialTab = {
+            id: guid(),
+            hash: initialTabHash,
+            title:
+              operationName !== null && operationName !== void 0
+                ? operationName
+                : "<untitled>",
+            query,
+            variables,
+            headers,
+            operationName,
+            response: void 0,
+          };
+          var rawTabState = null;
+          if (_this.props.tabs) {
+            rawTabState = _this._storage.get("tabState");
+          }
+          var tabsState;
+          if (rawTabState === null) {
+            tabsState = {
+              activeTabIndex: 0,
+              tabs: [initialTab],
+            };
+          } else {
+            tabsState = JSON.parse(rawTabState);
+            var queryParameterOperationIsWithinTabs = false;
+            try {
+              for (
+                var _k = __values$1(tabsState.tabs), _l = _k.next();
+                !_l.done;
+                _l = _k.next()
+              ) {
+                var tab = _l.value;
+                tab.query = tab.query;
+                tab.variables = tab.variables;
+                tab.headers = shouldPersistHeaders ? tab.headers : void 0;
+                tab.response = void 0;
+                tab.operationName = void 0;
+                tab.id = guid();
+                tab.hash = idFromTabContents(tab);
+                if (tab.hash === initialTabHash) {
+                  queryParameterOperationIsWithinTabs = true;
+                }
+              }
+            } catch (e_1_1) {
+              e_1 = { error: e_1_1 };
+            } finally {
+              try {
+                if (_l && !_l.done && (_a2 = _k.return)) _a2.call(_k);
+              } finally {
+                if (e_1) throw e_1.error;
+              }
+            }
+            if (queryParameterOperationIsWithinTabs === false) {
+              tabsState.tabs.push(initialTab);
+              tabsState.activeTabIndex = tabsState.tabs.length - 1;
+            }
+          }
+          var activeTab = tabsState.tabs[0];
+          var index = 0;
+          try {
+            for (
+              var _m = __values$1(tabsState.tabs), _o = _m.next();
+              !_o.done;
+              _o = _m.next()
+            ) {
+              var tab = _o.value;
+              if (tab.hash === initialTabHash) {
+                tabsState.activeTabIndex = index;
+                activeTab = tab;
+                break;
+              }
+              index++;
+            }
+          } catch (e_2_1) {
+            e_2 = { error: e_2_1 };
+          } finally {
+            try {
+              if (_o && !_o.done && (_b = _m.return)) _b.call(_m);
+            } finally {
+              if (e_2) throw e_2.error;
+            }
+          }
+          _this.state = __assign$2(
+            {
+              tabs: tabsState,
+              schema,
+              query:
+                activeTab === null || activeTab === void 0
+                  ? void 0
+                  : activeTab.query,
+              variables:
+                activeTab === null || activeTab === void 0
+                  ? void 0
+                  : activeTab.variables,
+              headers:
+                activeTab === null || activeTab === void 0
+                  ? void 0
+                  : activeTab.headers,
+              operationName:
+                activeTab === null || activeTab === void 0
+                  ? void 0
+                  : activeTab.operationName,
+              response:
+                (_j =
+                  activeTab === null || activeTab === void 0
+                    ? void 0
+                    : activeTab.response) !== null && _j !== void 0
+                  ? _j
+                  : response,
+              docExplorerOpen,
+              schemaErrors,
+              editorFlex: Number(_this._storage.get("editorFlex")) || 1,
+              secondaryEditorOpen,
+              secondaryEditorHeight:
+                Number(_this._storage.get("secondaryEditorHeight")) || 200,
+              variableEditorActive:
+                _this._storage.get("variableEditorActive") === "true" ||
+                props.headerEditorEnabled
+                  ? _this._storage.get("headerEditorActive") !== "true"
+                  : true,
+              headerEditorActive:
+                _this._storage.get("headerEditorActive") === "true",
+              headerEditorEnabled,
+              shouldPersistHeaders,
+              historyPaneOpen:
+                _this._storage.get("historyPaneOpen") === "true" || false,
+              docExplorerWidth:
+                Number(_this._storage.get("docExplorerWidth")) ||
+                DEFAULT_DOC_EXPLORER_WIDTH,
+              isWaitingForResponse: false,
+              subscription: null,
+              maxHistoryLength,
+            },
+            queryFacts
+          );
+          return _this;
+        }
+        GraphiQL2.formatResult = function (result2) {
+          return JSON.stringify(result2, null, 2);
+        };
+        GraphiQL2.prototype.componentDidMount = function () {
+          this.componentIsMounted = true;
+          if (this.state.schema === void 0) {
+            this.fetchSchema();
+          }
+          this.codeMirrorSizer = new CodeMirrorSizer();
+          if (typeof window !== "undefined") {
+            window.g = this;
+          }
+        };
+        GraphiQL2.prototype.UNSAFE_componentWillMount = function () {
+          this.componentIsMounted = false;
+        };
+        GraphiQL2.prototype.UNSAFE_componentWillReceiveProps = function (
+          nextProps
+        ) {
+          var _this = this;
+          var nextSchema = this.state.schema;
+          var nextQuery = this.state.query;
+          var nextVariables = this.state.variables;
+          var nextHeaders = this.state.headers;
+          var nextOperationName = this.state.operationName;
+          var nextResponse = this.state.response;
+          if (nextProps.schema !== void 0) {
+            nextSchema = nextProps.schema;
+          }
+          if (
+            nextProps.query !== void 0 &&
+            this.props.query !== nextProps.query
+          ) {
+            nextQuery = nextProps.query;
+          }
+          if (
+            nextProps.variables !== void 0 &&
+            this.props.variables !== nextProps.variables
+          ) {
+            nextVariables = nextProps.variables;
+          }
+          if (
+            nextProps.headers !== void 0 &&
+            this.props.headers !== nextProps.headers
+          ) {
+            nextHeaders = nextProps.headers;
+          }
+          if (nextProps.operationName !== void 0) {
+            nextOperationName = nextProps.operationName;
+          }
+          if (nextProps.response !== void 0) {
+            nextResponse = nextProps.response;
+          }
+          if (
+            nextQuery &&
+            nextSchema &&
+            (nextSchema !== this.state.schema ||
+              nextQuery !== this.state.query ||
+              nextOperationName !== this.state.operationName)
+          ) {
+            if (!this.props.dangerouslyAssumeSchemaIsValid) {
+              var validationErrors = validateSchema(nextSchema);
+              if (validationErrors && validationErrors.length > 0) {
+                this.handleSchemaErrors(validationErrors);
+                nextSchema = void 0;
+              }
+            }
+            var updatedQueryAttributes = this._updateQueryFacts(
+              nextQuery,
+              nextOperationName,
+              this.state.operations,
+              nextSchema
+            );
+            if (updatedQueryAttributes !== void 0) {
+              nextOperationName = updatedQueryAttributes.operationName;
+              this.setState(updatedQueryAttributes);
+            }
+          }
+          if (
+            nextProps.schema === void 0 &&
+            nextProps.fetcher !== this.props.fetcher
+          ) {
+            nextSchema = void 0;
+          }
+          this._storage.set("operationName", nextOperationName);
+          this.setState(
+            {
+              schema: nextSchema,
+              query: nextQuery,
+              variables: nextVariables,
+              headers: nextHeaders,
+              operationName: nextOperationName,
+              response: nextResponse,
+            },
+            function () {
+              if (_this.state.schema === void 0) {
+                if (_this.docExplorerComponent) {
+                  _this.docExplorerComponent.reset();
+                }
+                _this.fetchSchema();
+              }
+            }
+          );
+        };
+        GraphiQL2.prototype.componentDidUpdate = function () {
+          this.codeMirrorSizer.updateSizes([
+            this.queryEditorComponent,
+            this.variableEditorComponent,
+            this.headerEditorComponent,
+            this.resultComponent,
+          ]);
+        };
+        GraphiQL2.prototype.render = function () {
+          var _this = this;
+          var _a2;
+          var children = React$1.Children.toArray(this.props.children);
+          var logo =
+            find$1(children, function (child) {
+              return isChildComponentType(child, GraphiQL2.Logo);
+            }) || React$1.createElement(GraphiQL2.Logo, null);
+          var toolbar =
+            find$1(children, function (child) {
+              return isChildComponentType(child, GraphiQL2.Toolbar);
+            }) ||
+            React$1.createElement(
+              GraphiQL2.Toolbar,
+              null,
+              React$1.createElement(ToolbarButton, {
+                onClick: this.handlePrettifyQuery,
+                title: "Prettify Query (Shift-Ctrl-P)",
+                label: "Prettify",
+              }),
+              React$1.createElement(ToolbarButton, {
+                onClick: this.handleMergeQuery,
+                title: "Merge Query (Shift-Ctrl-M)",
+                label: "Merge",
+              }),
+              React$1.createElement(ToolbarButton, {
+                onClick: this.handleCopyQuery,
+                title: "Copy Query (Shift-Ctrl-C)",
+                label: "Copy",
+              }),
+              React$1.createElement(ToolbarButton, {
+                onClick: this.handleToggleHistory,
+                title: "Show History",
+                label: "History",
+              }),
+              (
+                (_a2 = this.props.toolbar) === null || _a2 === void 0
+                  ? void 0
+                  : _a2.additionalContent
+              )
+                ? this.props.toolbar.additionalContent
+                : null
+            );
+          var footer = find$1(children, function (child) {
+            return isChildComponentType(child, GraphiQL2.Footer);
+          });
+          var queryWrapStyle = {
+            WebkitFlex: this.state.editorFlex,
+            flex: this.state.editorFlex,
+          };
+          var docWrapStyle = {
+            display: "block",
+            width: this.state.docExplorerWidth,
+          };
+          var docExplorerWrapClasses =
+            "docExplorerWrap" +
+            (this.state.docExplorerWidth < 200 ? " doc-explorer-narrow" : "");
+          var historyPaneStyle = {
+            display: this.state.historyPaneOpen ? "block" : "none",
+            width: "230px",
+            zIndex: 7,
+          };
+          var secondaryEditorOpen = this.state.secondaryEditorOpen;
+          var secondaryEditorStyle = {
+            height: secondaryEditorOpen
+              ? this.state.secondaryEditorHeight
+              : void 0,
+          };
+          var tabsState = this.state.tabs;
+          return React$1.createElement(
+            "div",
+            {
+              ref: function (n2) {
+                _this.graphiqlContainer = n2;
+              },
+              "data-testid": "graphiql-container",
+              className: "graphiql-container",
+            },
+            this.state.historyPaneOpen &&
+              React$1.createElement(
+                "div",
+                { className: "historyPaneWrap", style: historyPaneStyle },
+                React$1.createElement(
+                  QueryHistory,
+                  {
+                    ref: function (node) {
+                      _this._queryHistory = node;
+                    },
+                    operationName: this.state.operationName,
+                    query: this.state.query,
+                    variables: this.state.variables,
+                    onSelectQuery: this.handleSelectHistoryQuery,
+                    storage: this._storage,
+                    maxHistoryLength: this.state.maxHistoryLength,
+                    queryID: this._editorQueryID,
+                  },
+                  React$1.createElement(
+                    "button",
+                    {
+                      className: "docExplorerHide",
+                      onClick: this.handleToggleHistory,
+                      "aria-label": "Close History",
+                    },
+                    "\u2715"
+                  )
+                )
+              ),
+            React$1.createElement(
+              "div",
+              { className: "editorWrap" },
+              React$1.createElement(
+                "div",
+                { className: "topBarWrap" },
+                this.props.beforeTopBarContent,
+                React$1.createElement(
+                  "div",
+                  { className: "topBar" },
+                  logo,
+                  React$1.createElement(ExecuteButton, {
+                    isRunning: Boolean(this.state.subscription),
+                    onRun: this.handleRunQuery,
+                    onStop: this.handleStopQuery,
+                    operations: this.state.operations,
+                  }),
+                  toolbar
+                ),
+                !this.state.docExplorerOpen &&
+                  React$1.createElement(
+                    "button",
+                    {
+                      className: "docExplorerShow",
+                      onClick: this.handleToggleDocs,
+                      "aria-label": "Open Documentation Explorer",
+                    },
+                    "Docs"
+                  )
+              ),
+              this.props.tabs
+                ? React$1.createElement(
+                    Tabs,
+                    {
+                      tabsProps: {
+                        "aria-label": "Select active operation",
+                      },
+                    },
+                    tabsState.tabs.map(function (tab, index) {
+                      return React$1.createElement(Tab, {
+                        key: tab.id,
+                        isActive: index === tabsState.activeTabIndex,
+                        title: tab.title,
+                        isCloseable: tabsState.tabs.length > 1,
+                        onSelect: _this.makeHandleOnSelectTab(index),
+                        onClose: _this.makeHandleOnCloseTab(index),
+                        tabProps: {
+                          "aria-controls": "sessionWrap",
+                          id: "session-tab-" + index,
+                        },
+                      });
+                    }),
+                    React$1.createElement(TabAddButton, {
+                      onClick: this.handleOnAddTab,
+                    })
+                  )
+                : null,
+              React$1.createElement(
+                "div",
+                {
+                  ref: function (n2) {
+                    _this.editorBarComponent = n2;
+                  },
+                  role: "tabpanel",
+                  id: "sessionWrap",
+                  className: "editorBar",
+                  "aria-labelledby": "session-tab-" + tabsState.activeTabIndex,
+                  onDoubleClick: this.handleResetResize,
+                  onMouseDown: this.handleResizeStart,
+                },
+                React$1.createElement(
+                  "div",
+                  { className: "queryWrap", style: queryWrapStyle },
+                  React$1.createElement(QueryEditor, {
+                    ref: function (n2) {
+                      _this.queryEditorComponent = n2;
+                    },
+                    schema: this.state.schema,
+                    validationRules: this.props.validationRules,
+                    value: this.state.query,
+                    onEdit: this.handleEditQuery,
+                    onHintInformationRender: this.handleHintInformationRender,
+                    onClickReference: this.handleClickReference,
+                    onCopyQuery: this.handleCopyQuery,
+                    onPrettifyQuery: this.handlePrettifyQuery,
+                    onMergeQuery: this.handleMergeQuery,
+                    onRunQuery: this.handleEditorRunQuery,
+                    editorTheme: this.props.editorTheme,
+                    readOnly: this.props.readOnly,
+                    externalFragments: this.props.externalFragments,
+                  }),
+                  React$1.createElement(
+                    "section",
+                    {
+                      className: "variable-editor secondary-editor",
+                      style: secondaryEditorStyle,
+                      "aria-label": this.state.variableEditorActive
+                        ? "Query Variables"
+                        : "Request Headers",
+                    },
+                    React$1.createElement(
+                      "div",
+                      {
+                        className:
+                          "secondary-editor-title variable-editor-title",
+                        id: "secondary-editor-title",
+                        style: {
+                          cursor: secondaryEditorOpen
+                            ? "row-resize"
+                            : "n-resize",
+                        },
+                        onMouseDown: this.handleSecondaryEditorResizeStart,
+                      },
+                      React$1.createElement(
+                        "div",
+                        {
+                          className:
+                            "variable-editor-title-text" +
+                            (this.state.variableEditorActive ? " active" : ""),
+                          onClick: this.handleOpenVariableEditorTab,
+                          onMouseDown: this.handleTabClickPropogation,
+                        },
+                        "Query Variables"
+                      ),
+                      this.state.headerEditorEnabled &&
+                        React$1.createElement(
+                          "div",
+                          {
+                            style: {
+                              marginLeft: "20px",
+                            },
+                            className:
+                              "variable-editor-title-text" +
+                              (this.state.headerEditorActive ? " active" : ""),
+                            onClick: this.handleOpenHeaderEditorTab,
+                            onMouseDown: this.handleTabClickPropogation,
+                          },
+                          "Request Headers"
+                        )
+                    ),
+                    React$1.createElement(VariableEditor, {
+                      ref: function (n2) {
+                        _this.variableEditorComponent = n2;
+                      },
+                      value: this.state.variables,
+                      variableToType: this.state.variableToType,
+                      onEdit: this.handleEditVariables,
+                      onHintInformationRender: this.handleHintInformationRender,
+                      onPrettifyQuery: this.handlePrettifyQuery,
+                      onMergeQuery: this.handleMergeQuery,
+                      onRunQuery: this.handleEditorRunQuery,
+                      editorTheme: this.props.editorTheme,
+                      readOnly: this.props.readOnly,
+                      active: this.state.variableEditorActive,
+                    }),
+                    this.state.headerEditorEnabled &&
+                      React$1.createElement(HeaderEditor, {
+                        ref: function (n2) {
+                          _this.headerEditorComponent = n2;
+                        },
+                        value: this.state.headers,
+                        onEdit: this.handleEditHeaders,
+                        onHintInformationRender:
+                          this.handleHintInformationRender,
+                        onPrettifyQuery: this.handlePrettifyQuery,
+                        onMergeQuery: this.handleMergeQuery,
+                        onRunQuery: this.handleEditorRunQuery,
+                        editorTheme: this.props.editorTheme,
+                        readOnly: this.props.readOnly,
+                        active: this.state.headerEditorActive,
+                      })
+                  )
+                ),
+                React$1.createElement(
+                  "div",
+                  { className: "resultWrap" },
+                  this.state.isWaitingForResponse &&
+                    React$1.createElement(
+                      "div",
+                      { className: "spinner-container" },
+                      React$1.createElement("div", { className: "spinner" })
+                    ),
+                  React$1.createElement(ResultViewer, {
+                    registerRef: function (n2) {
+                      _this.resultViewerElement = n2;
+                    },
+                    ref: function (c) {
+                      _this.resultComponent = c;
+                    },
+                    value: this.state.response,
+                    editorTheme: this.props.editorTheme,
+                    ResultsTooltip: this.props.ResultsTooltip,
+                    ImagePreview,
+                  }),
+                  footer
+                )
+              )
+            ),
+            this.state.docExplorerOpen &&
+              React$1.createElement(
+                "div",
+                { className: docExplorerWrapClasses, style: docWrapStyle },
+                React$1.createElement("div", {
+                  className: "docExplorerResizer",
+                  onDoubleClick: this.handleDocsResetResize,
+                  onMouseDown: this.handleDocsResizeStart,
+                }),
+                React$1.createElement(
+                  DocExplorer,
+                  {
+                    ref: function (c) {
+                      _this.docExplorerComponent = c;
+                    },
+                    schemaErrors: this.state.schemaErrors,
+                    schema: this.state.schema,
+                  },
+                  React$1.createElement(
+                    "button",
+                    {
+                      className: "docExplorerHide",
+                      onClick: this.handleToggleDocs,
+                      "aria-label": "Close Documentation Explorer",
+                    },
+                    "\u2715"
+                  )
+                )
+              )
+          );
+        };
+        GraphiQL2.prototype.getQueryEditor = function () {
+          if (this.queryEditorComponent) {
+            return this.queryEditorComponent.getCodeMirror();
+          }
+        };
+        GraphiQL2.prototype.getVariableEditor = function () {
+          if (this.variableEditorComponent) {
+            return this.variableEditorComponent.getCodeMirror();
+          }
+          return null;
+        };
+        GraphiQL2.prototype.getHeaderEditor = function () {
+          if (this.headerEditorComponent) {
+            return this.headerEditorComponent.getCodeMirror();
+          }
+          return null;
+        };
+        GraphiQL2.prototype.refresh = function () {
+          if (this.queryEditorComponent) {
+            this.queryEditorComponent.getCodeMirror().refresh();
+          }
+          if (this.variableEditorComponent) {
+            this.variableEditorComponent.getCodeMirror().refresh();
+          }
+          if (this.headerEditorComponent) {
+            this.headerEditorComponent.getCodeMirror().refresh();
+          }
+          if (this.resultComponent) {
+            this.resultComponent.getCodeMirror().refresh();
+          }
+        };
+        GraphiQL2.prototype.autoCompleteLeafs = function () {
+          var _a2 = fillLeafs(
+              this.state.schema,
+              this.state.query,
+              this.props.getDefaultFieldNames
+            ),
+            insertions = _a2.insertions,
+            result2 = _a2.result;
+          if (insertions && insertions.length > 0) {
+            var editor_1 = this.getQueryEditor();
+            if (editor_1) {
+              editor_1.operation(function () {
+                var cursor = editor_1.getCursor();
+                var cursorIndex = editor_1.indexFromPos(cursor);
+                editor_1.setValue(result2 || "");
+                var added = 0;
+                var markers = insertions.map(function (_a3) {
+                  var index = _a3.index,
+                    string2 = _a3.string;
+                  return editor_1.markText(
+                    editor_1.posFromIndex(index + added),
+                    editor_1.posFromIndex(index + (added += string2.length)),
+                    {
+                      className: "autoInsertedLeaf",
+                      clearOnEnter: true,
+                      title: "Automatically added leaf fields",
+                    }
+                  );
+                });
+                setTimeout(function () {
+                  return markers.forEach(function (marker2) {
+                    return marker2.clear();
+                  });
+                }, 7e3);
+                var newCursorIndex = cursorIndex;
+                insertions.forEach(function (_a3) {
+                  var index = _a3.index,
+                    string2 = _a3.string;
+                  if (index < cursorIndex) {
+                    newCursorIndex += string2.length;
+                  }
+                });
+                editor_1.setCursor(editor_1.posFromIndex(newCursorIndex));
+              });
+            }
+          }
+          return result2;
+        };
+        GraphiQL2.prototype.fetchSchema = function () {
+          var _this = this;
+          var fetcher = this.props.fetcher;
+          var fetcherOpts = {
+            shouldPersistHeaders: Boolean(this.props.shouldPersistHeaders),
+            documentAST: this.state.documentAST,
+          };
+          try {
+            if (this.state.headers && this.state.headers.trim().length > 2) {
+              fetcherOpts.headers = JSON.parse(this.state.headers);
+            } else if (this.props.headers) {
+              fetcherOpts.headers = JSON.parse(this.props.headers);
+            }
+          } catch (err) {
+            this.setState({
+              response: "Introspection failed as headers are invalid.",
+            });
+            return;
+          }
+          var fetch2 = fetcherReturnToPromise(
+            fetcher(
+              {
+                query: this._introspectionQuery,
+                operationName: this._introspectionQueryName,
+              },
+              fetcherOpts
+            )
+          );
+          if (!isPromise$1(fetch2)) {
+            this.setState({
+              response: "Fetcher did not return a Promise for introspection.",
+            });
+            return;
+          }
+          fetch2
+            .then(function (result2) {
+              if (typeof result2 !== "string" && "data" in result2) {
+                return result2;
+              }
+              var fetch22 = fetcherReturnToPromise(
+                fetcher(
+                  {
+                    query: _this._introspectionQuerySansSubscriptions,
+                    operationName: _this._introspectionQueryName,
+                  },
+                  fetcherOpts
+                )
+              );
+              if (!isPromise$1(fetch2)) {
+                throw new Error(
+                  "Fetcher did not return a Promise for introspection."
+                );
+              }
+              return fetch22;
+            })
+            .then(function (result2) {
+              var _a2, _b;
+              if (_this.state.schema !== void 0) {
+                return;
+              }
+              if (
+                result2 &&
+                result2.data &&
+                "__schema" in
+                  (result2 === null || result2 === void 0
+                    ? void 0
+                    : result2.data)
+              ) {
+                var schema = buildClientSchema(result2.data);
+                if (!_this.props.dangerouslyAssumeSchemaIsValid) {
+                  var errors2 = validateSchema(schema);
+                  if (errors2 && errors2.length > 0) {
+                    schema = void 0;
+                    _this.handleSchemaErrors(errors2);
+                  }
+                }
+                if (schema) {
+                  var queryFacts = getOperationFacts(schema, _this.state.query);
+                  _this.safeSetState(
+                    __assign$2(__assign$2({ schema }, queryFacts), {
+                      schemaErrors: void 0,
+                    })
+                  );
+                  (_b = (_a2 = _this.props).onSchemaChange) === null ||
+                  _b === void 0
+                    ? void 0
+                    : _b.call(_a2, schema);
+                }
+              } else {
+                var responseString =
+                  typeof result2 === "string"
+                    ? result2
+                    : GraphiQL2.formatResult(result2);
+                _this.handleSchemaErrors([responseString]);
+              }
+            })
+            .catch(function (error2) {
+              _this.handleSchemaErrors([error2]);
+            });
+        };
+        GraphiQL2.prototype.handleSchemaErrors = function (schemaErrors) {
+          this.safeSetState({
+            response: schemaErrors
+              ? GraphiQL2.formatError(schemaErrors)
+              : void 0,
+            schema: void 0,
+            schemaErrors,
+          });
+        };
+        GraphiQL2.prototype._fetchQuery = function (
+          query,
+          variables,
+          headers,
+          operationName,
+          shouldPersistHeaders,
+          cb2
+        ) {
+          return __awaiter$1(this, void 0, void 0, function () {
+            var fetcher,
+              jsonVariables,
+              jsonHeaders,
+              externalFragments_1,
+              fragmentDependencies,
+              fetch2;
+            var _this = this;
+            return __generator$1(this, function (_a2) {
+              fetcher = this.props.fetcher;
+              jsonVariables = null;
+              jsonHeaders = null;
+              try {
+                jsonVariables =
+                  variables && variables.trim() !== ""
+                    ? JSON.parse(variables)
+                    : null;
+              } catch (error2) {
+                throw new Error(
+                  "Variables are invalid JSON: " + error2.message + "."
+                );
+              }
+              if (typeof jsonVariables !== "object") {
+                throw new Error("Variables are not a JSON object.");
+              }
+              try {
+                jsonHeaders =
+                  headers && headers.trim() !== "" ? JSON.parse(headers) : null;
+              } catch (error2) {
+                throw new Error(
+                  "Headers are invalid JSON: " + error2.message + "."
+                );
+              }
+              if (typeof jsonHeaders !== "object") {
+                throw new Error("Headers are not a JSON object.");
+              }
+              if (this.props.externalFragments) {
+                externalFragments_1 = /* @__PURE__ */ new Map();
+                if (Array.isArray(this.props.externalFragments)) {
+                  this.props.externalFragments.forEach(function (def) {
+                    externalFragments_1.set(def.name.value, def);
+                  });
+                } else {
+                  visit(parse$1(this.props.externalFragments, {}), {
+                    FragmentDefinition: function (def) {
+                      externalFragments_1.set(def.name.value, def);
+                    },
+                  });
+                }
+                fragmentDependencies = getFragmentDependenciesForAST(
+                  this.state.documentAST,
+                  externalFragments_1
+                );
+                if (fragmentDependencies.length > 0) {
+                  query +=
+                    "\n" +
+                    fragmentDependencies
+                      .map(function (node) {
+                        return print(node);
+                      })
+                      .join("\n");
+                }
+              }
+              fetch2 = fetcher(
+                {
+                  query,
+                  variables: jsonVariables,
+                  operationName,
+                },
+                {
+                  headers: jsonHeaders,
+                  shouldPersistHeaders,
+                  documentAST: this.state.documentAST,
+                }
+              );
+              return [
+                2,
+                Promise.resolve(fetch2)
+                  .then(function (value) {
+                    if (isObservable(value)) {
+                      var subscription = value.subscribe({
+                        next: cb2,
+                        error: function (error2) {
+                          _this.safeSetState({
+                            isWaitingForResponse: false,
+                            response: error2
+                              ? GraphiQL2.formatError(error2)
+                              : void 0,
+                            subscription: null,
+                          });
+                        },
+                        complete: function () {
+                          _this.safeSetState({
+                            isWaitingForResponse: false,
+                            subscription: null,
+                          });
+                        },
+                      });
+                      return subscription;
+                    } else if (isAsyncIterable$2(value)) {
+                      (function () {
+                        return __awaiter$1(_this, void 0, void 0, function () {
+                          var value_1, value_1_1, result2, e_4_1, error_2;
+                          var e_4, _a3;
+                          return __generator$1(this, function (_b) {
+                            switch (_b.label) {
+                              case 0:
+                                _b.trys.push([0, 13, , 14]);
+                                _b.label = 1;
+                              case 1:
+                                _b.trys.push([1, 6, 7, 12]);
+                                value_1 = __asyncValues$1(value);
+                                _b.label = 2;
+                              case 2:
+                                return [4, value_1.next()];
+                              case 3:
+                                if (!((value_1_1 = _b.sent()), !value_1_1.done))
+                                  return [3, 5];
+                                result2 = value_1_1.value;
+                                cb2(result2);
+                                _b.label = 4;
+                              case 4:
+                                return [3, 2];
+                              case 5:
+                                return [3, 12];
+                              case 6:
+                                e_4_1 = _b.sent();
+                                e_4 = { error: e_4_1 };
+                                return [3, 12];
+                              case 7:
+                                _b.trys.push([7, , 10, 11]);
+                                if (
+                                  !(
+                                    value_1_1 &&
+                                    !value_1_1.done &&
+                                    (_a3 = value_1.return)
+                                  )
+                                )
+                                  return [3, 9];
+                                return [4, _a3.call(value_1)];
+                              case 8:
+                                _b.sent();
+                                _b.label = 9;
+                              case 9:
+                                return [3, 11];
+                              case 10:
+                                if (e_4) throw e_4.error;
+                                return [7];
+                              case 11:
+                                return [7];
+                              case 12:
+                                this.safeSetState({
+                                  isWaitingForResponse: false,
+                                  subscription: null,
+                                });
+                                return [3, 14];
+                              case 13:
+                                error_2 = _b.sent();
+                                this.safeSetState({
+                                  isWaitingForResponse: false,
+                                  response: error_2
+                                    ? GraphiQL2.formatError(error_2)
+                                    : void 0,
+                                  subscription: null,
+                                });
+                                return [3, 14];
+                              case 14:
+                                return [2];
+                            }
+                          });
+                        });
+                      })();
+                      return {
+                        unsubscribe: function () {
+                          var _a3, _b;
+                          return (_b = (_a3 = value[Symbol.asyncIterator]())
+                            .return) === null || _b === void 0
+                            ? void 0
+                            : _b.call(_a3);
+                        },
+                      };
+                    } else {
+                      cb2(value);
+                      return null;
+                    }
+                  })
+                  .catch(function (error2) {
+                    _this.safeSetState({
+                      isWaitingForResponse: false,
+                      response: error2 ? GraphiQL2.formatError(error2) : void 0,
+                    });
+                    return null;
+                  }),
+              ];
+            });
+          });
+        };
+        GraphiQL2.prototype._runQueryAtCursor = function () {
+          if (this.state.subscription) {
+            this.handleStopQuery();
+            return;
+          }
+          var operationName;
+          var operations = this.state.operations;
+          if (operations) {
+            var editor = this.getQueryEditor();
+            if (editor && editor.hasFocus()) {
+              var cursor = editor.getCursor();
+              var cursorIndex = editor.indexFromPos(cursor);
+              for (var i = 0; i < operations.length; i++) {
+                var operation = operations[i];
+                if (
+                  operation.loc &&
+                  operation.loc.start <= cursorIndex &&
+                  operation.loc.end >= cursorIndex
+                ) {
+                  operationName = operation.name && operation.name.value;
+                  break;
+                }
+              }
+            }
+          }
+          this.handleRunQuery(operationName);
+        };
+        GraphiQL2.prototype._didClickDragBar = function (event) {
+          if (event.button !== 0 || event.ctrlKey) {
+            return false;
+          }
+          var target2 = event.target;
+          if (target2.className.indexOf("CodeMirror-gutter") !== 0) {
+            return false;
+          }
+          var resultWindow = this.resultViewerElement;
+          while (target2) {
+            if (target2 === resultWindow) {
+              return true;
+            }
+            target2 = target2.parentNode;
+          }
+          return false;
+        };
+        GraphiQL2.formatError = function (error2) {
+          if (Array.isArray(error2)) {
+            return stringify$1({
+              errors: error2.map(function (e) {
+                return handleSingleError(e);
+              }),
+            });
+          }
+          return stringify$1({ errors: handleSingleError(error2) });
+        };
+        GraphiQL2.Logo = GraphiQLLogo;
+        GraphiQL2.Toolbar = GraphiQLToolbar;
+        GraphiQL2.Footer = GraphiQLFooter;
+        GraphiQL2.QueryEditor = QueryEditor;
+        GraphiQL2.VariableEditor = VariableEditor;
+        GraphiQL2.HeaderEditor = HeaderEditor;
+        GraphiQL2.ResultViewer = ResultViewer;
+        GraphiQL2.Button = ToolbarButton;
+        GraphiQL2.ToolbarButton = ToolbarButton;
+        GraphiQL2.Group = ToolbarGroup;
+        GraphiQL2.Menu = ToolbarMenu;
+        GraphiQL2.MenuItem = ToolbarMenuItem;
+        return GraphiQL2;
+      })(React$1.Component);
+      function GraphiQLLogo(props) {
+        return React$1.createElement(
+          "div",
+          { className: "title" },
+          props.children ||
+            React$1.createElement(
+              "span",
+              null,
+              "Graph",
+              React$1.createElement("em", null, "i"),
+              "QL"
+            )
+        );
+      }
+      GraphiQLLogo.displayName = "GraphiQLLogo";
+      function GraphiQLToolbar(props) {
+        return React$1.createElement(
+          "div",
+          {
+            className: "toolbar",
+            role: "toolbar",
+            "aria-label": "Editor Commands",
+          },
+          props.children
+        );
+      }
+      GraphiQLToolbar.displayName = "GraphiQLToolbar";
+      function GraphiQLFooter(props) {
+        return React$1.createElement(
+          "div",
+          { className: "footer" },
+          props.children
+        );
+      }
+      GraphiQLFooter.displayName = "GraphiQLFooter";
+      var defaultQuery =
+        '# Welcome to GraphiQL\n#\n# GraphiQL is an in-browser tool for writing, validating, and\n# testing GraphQL queries.\n#\n# Type queries into this side of the screen, and you will see intelligent\n# typeaheads aware of the current GraphQL type schema and live syntax and\n# validation errors highlighted within the text.\n#\n# GraphQL queries typically start with a "{" character. Lines that start\n# with a # are ignored.\n#\n# An example GraphQL query might look like:\n#\n#     {\n#       field(arg: "value") {\n#         subField\n#       }\n#     }\n#\n# Keyboard shortcuts:\n#\n#  Prettify Query:  Shift-Ctrl-P (or press the prettify button above)\n#\n#     Merge Query:  Shift-Ctrl-M (or press the merge button above)\n#\n#       Run Query:  Ctrl-Enter (or press the play button above)\n#\n#   Auto Complete:  Ctrl-Space (or just start typing)\n#\n\n';
+      function isPromise$1(value) {
+        return typeof value === "object" && typeof value.then === "function";
+      }
+      function observableToPromise(observable) {
+        return new Promise(function (resolve, reject2) {
+          var subscription = observable.subscribe({
+            next: function (v2) {
+              resolve(v2);
+              subscription.unsubscribe();
+            },
+            error: reject2,
+            complete: function () {
+              reject2(new Error("no value resolved"));
+            },
+          });
+        });
+      }
+      function isObservable(value) {
+        return (
+          typeof value === "object" &&
+          "subscribe" in value &&
+          typeof value.subscribe === "function"
+        );
+      }
+      function isAsyncIterable$2(input) {
+        return (
+          typeof input === "object" &&
+          input !== null &&
+          (input[Symbol.toStringTag] === "AsyncGenerator" ||
+            Symbol.asyncIterator in input)
+        );
+      }
+      function asyncIterableToPromise(input) {
+        return new Promise(function (resolve, reject2) {
+          var _a2;
+          var iteratorReturn =
+            (_a2 = ("return" in input ? input : input[Symbol.asyncIterator]())
+              .return) === null || _a2 === void 0
+              ? void 0
+              : _a2.bind(input);
+          var iteratorNext = (
+            "next" in input ? input : input[Symbol.asyncIterator]()
+          ).next.bind(input);
+          iteratorNext()
+            .then(function (result2) {
+              resolve(result2.value);
+              iteratorReturn === null || iteratorReturn === void 0
+                ? void 0
+                : iteratorReturn();
+            })
+            .catch(function (err) {
+              reject2(err);
+            });
+        });
+      }
+      function fetcherReturnToPromise(fetcherResult) {
+        return Promise.resolve(fetcherResult).then(function (fetcherResult2) {
+          if (isAsyncIterable$2(fetcherResult2)) {
+            return asyncIterableToPromise(fetcherResult2);
+          } else if (isObservable(fetcherResult2)) {
+            return observableToPromise(fetcherResult2);
+          }
+          return fetcherResult2;
+        });
+      }
+      function isChildComponentType(child, component) {
+        var _a2;
+        if (
+          ((_a2 = child === null || child === void 0 ? void 0 : child.type) ===
+            null || _a2 === void 0
+            ? void 0
+            : _a2.displayName) &&
+          child.type.displayName === component.displayName
+        ) {
+          return true;
+        }
+        return child.type === component;
+      }
+      function tabsStateEditHeadersReducer(value, state) {
+        return __assign$2(__assign$2({}, state), {
+          tabs: state.tabs.map(function (tab, index) {
+            if (index !== state.activeTabIndex) {
+              return tab;
+            }
+            return __assign$2(__assign$2({}, tab), {
+              headers: value,
+              hash: idFromTabContents({
+                query: tab.query,
+                headers: value,
+                variables: tab.variables,
+              }),
+            });
+          }),
+        });
+      }
+      function tabsStateEditVariablesReducer(value, state) {
+        return __assign$2(__assign$2({}, state), {
+          tabs: state.tabs.map(function (tab, index) {
+            if (index !== state.activeTabIndex) {
+              return tab;
+            }
+            return __assign$2(__assign$2({}, tab), {
+              variables: value,
+              hash: idFromTabContents({
+                query: tab.query,
+                headers: tab.headers,
+                variables: value,
+              }),
+            });
+          }),
+        });
+      }
+      function tabsStateEditQueryReducer(value, state, operationName) {
+        return __assign$2(__assign$2({}, state), {
+          tabs: state.tabs.map(function (tab, index) {
+            if (index !== state.activeTabIndex) {
+              return tab;
+            }
+            return __assign$2(__assign$2({}, tab), {
+              title:
+                operationName !== null && operationName !== void 0
+                  ? operationName
+                  : fuzzyExtractOperationTitle(value),
+              query: value,
+              hash: idFromTabContents({
+                query: value,
+                headers: tab.headers,
+                variables: tab.variables,
+              }),
+            });
+          }),
+        });
+      }
+      function stateOnSelectTabReducer(index, state) {
+        var oldActiveTabIndex = state.tabs.activeTabIndex;
+        var tabs = state.tabs.tabs.map(function (currentTab, tabIndex) {
+          if (tabIndex !== oldActiveTabIndex) {
+            return currentTab;
+          }
+          return __assign$2(__assign$2({}, currentTab), {
+            query: state.query,
+            variables: state.variables,
+            operationName: state.operationName,
+            headers: state.headers,
+            response: state.response,
+            hash: idFromTabContents({
+              query: state.query,
+              variables: state.variables,
+              headers: state.headers,
+            }),
+          });
+        });
+        var newActiveTab = state.tabs.tabs[index];
+        return __assign$2(__assign$2({}, state), {
+          query: newActiveTab.query,
+          variables: newActiveTab.variables,
+          operationName: newActiveTab.operationName,
+          headers: newActiveTab.headers,
+          response: newActiveTab.response,
+          tabs: __assign$2(__assign$2({}, state.tabs), {
+            tabs,
+            activeTabIndex: index,
+          }),
+        });
+      }
+      function stateOnCloseTabReducer(index, state) {
+        var newActiveTabIndex =
+          state.tabs.activeTabIndex > 0 ? state.tabs.activeTabIndex - 1 : 0;
+        var newTabsState = __assign$2(__assign$2({}, state.tabs), {
+          activeTabIndex: newActiveTabIndex,
+          tabs: state.tabs.tabs.filter(function (_tab, i) {
+            return index !== i;
+          }),
+        });
+        var activeTab = newTabsState.tabs[newActiveTabIndex];
+        return __assign$2(__assign$2({}, state), {
+          query: activeTab.query,
+          variables: activeTab.variables,
+          operationName: activeTab.operationName,
+          headers: activeTab.headers,
+          response: activeTab.response,
+          tabs: newTabsState,
+        });
+      }
+      function stateOnTabAddReducer(state) {
+        var oldActiveTabIndex = state.tabs.activeTabIndex;
+        var newTab = {
+          id: guid(),
+          title: "<untitled>",
+          headers: "",
+          variables: "",
+          query: "",
+          operationName: "",
+          response: "",
+          hash: idFromTabContents({
+            query: "",
+            variables: "",
+            headers: "",
+          }),
+        };
+        var tabs = state.tabs.tabs.map(function (tab, index) {
+          if (index !== oldActiveTabIndex) {
+            return tab;
+          }
+          return __assign$2(__assign$2({}, tab), {
+            headers: state.headers,
+            variables: state.variables,
+            query: state.query,
+            operationName: state.operationName,
+            response: state.response,
+          });
+        });
+        return __assign$2(__assign$2({}, state), {
+          headers: newTab.headers,
+          variables: newTab.variables,
+          query: newTab.query,
+          operationName: newTab.operationName,
+          response: newTab.response,
+          tabs: __assign$2(__assign$2({}, state.tabs), {
+            activeTabIndex: state.tabs.tabs.length,
+            tabs: __spread(tabs, [newTab]),
+          }),
+        });
+      }
+      var __extends =
+        (globalThis && globalThis.__extends) ||
+        (function () {
+          var extendStatics = function (d, b) {
+            extendStatics =
+              Object.setPrototypeOf ||
+              ({ __proto__: [] } instanceof Array &&
+                function (d2, b2) {
+                  d2.__proto__ = b2;
+                }) ||
+              function (d2, b2) {
+                for (var p2 in b2)
+                  if (Object.prototype.hasOwnProperty.call(b2, p2))
+                    d2[p2] = b2[p2];
+              };
+            return extendStatics(d, b);
+          };
+          return function (d, b) {
+            extendStatics(d, b);
+            function __() {
+              this.constructor = d;
+            }
+            d.prototype =
+              b === null
+                ? Object.create(b)
+                : ((__.prototype = b.prototype), new __());
+          };
+        })();
+      var __assign$1 =
+        (globalThis && globalThis.__assign) ||
+        function () {
+          __assign$1 =
+            Object.assign ||
+            function (t2) {
+              for (var s, i = 1, n2 = arguments.length; i < n2; i++) {
+                s = arguments[i];
+                for (var p2 in s)
+                  if (Object.prototype.hasOwnProperty.call(s, p2))
+                    t2[p2] = s[p2];
+              }
+              return t2;
+            };
+          return __assign$1.apply(this, arguments);
+        };
+      function hasProps(child) {
+        if (!child || typeof child !== "object" || !("props" in child)) {
+          return false;
+        }
+        return true;
+      }
+      (function (_super2) {
+        __extends(ToolbarSelect, _super2);
+        function ToolbarSelect(props) {
+          var _this = _super2.call(this, props) || this;
+          _this._node = null;
+          _this._listener = null;
+          _this.handleOpen = function (e) {
+            preventDefault(e);
+            _this.setState({ visible: true });
+            _this._subscribe();
+          };
+          _this.state = { visible: false };
+          return _this;
+        }
+        ToolbarSelect.prototype.componentWillUnmount = function () {
+          this._release();
+        };
+        ToolbarSelect.prototype.render = function () {
+          var _this = this;
+          var selectedChild;
+          var visible = this.state.visible;
+          var optionChildren = React$1.Children.map(
+            this.props.children,
+            function (child, i) {
+              if (!hasProps(child)) {
+                return null;
+              }
+              if (!selectedChild || child.props.selected) {
+                selectedChild = child;
+              }
+              var onChildSelect =
+                child.props.onSelect ||
+                (_this.props.onSelect &&
+                  _this.props.onSelect.bind(null, child.props.value, i));
+              return React$1.createElement(
+                ToolbarSelectOption,
+                __assign$1({}, child.props, { onSelect: onChildSelect })
+              );
+            }
+          );
+          return React$1.createElement(
+            "a",
+            {
+              className: "toolbar-select toolbar-button",
+              onClick: this.handleOpen.bind(this),
+              onMouseDown: preventDefault,
+              ref: function (node) {
+                _this._node = node;
+              },
+              title: this.props.title,
+            },
+            selectedChild === null || selectedChild === void 0
+              ? void 0
+              : selectedChild.props.label,
+            React$1.createElement(
+              "svg",
+              { width: "13", height: "10" },
+              React$1.createElement("path", {
+                fill: "#666",
+                d: "M 5 5 L 13 5 L 9 1 z",
+              }),
+              React$1.createElement("path", {
+                fill: "#666",
+                d: "M 5 6 L 13 6 L 9 10 z",
+              })
+            ),
+            React$1.createElement(
+              "ul",
+              {
+                className: "toolbar-select-options" + (visible ? " open" : ""),
+              },
+              optionChildren
+            )
+          );
+        };
+        ToolbarSelect.prototype._subscribe = function () {
+          if (!this._listener) {
+            this._listener = this.handleClick.bind(this);
+            document.addEventListener("click", this._listener);
+          }
+        };
+        ToolbarSelect.prototype._release = function () {
+          if (this._listener) {
+            document.removeEventListener("click", this._listener);
+            this._listener = null;
+          }
+        };
+        ToolbarSelect.prototype.handleClick = function (e) {
+          if (this._node !== e.target) {
+            preventDefault(e);
+            this.setState({ visible: false });
+            this._release();
+          }
+        };
+        return ToolbarSelect;
+      })(React$1.Component);
+      function ToolbarSelectOption(_a2) {
+        var onSelect = _a2.onSelect,
+          label = _a2.label,
+          selected = _a2.selected;
+        return React$1.createElement(
+          "li",
+          {
+            onMouseOver: function (e) {
+              e.currentTarget.className = "hover";
+            },
+            onMouseOut: function (e) {
+              e.currentTarget.className = "";
+            },
+            onMouseDown: preventDefault,
+            onMouseUp: onSelect,
+          },
+          label,
+          selected &&
+            React$1.createElement(
+              "svg",
+              { width: "13", height: "13" },
+              React$1.createElement("polygon", {
+                points:
+                  "4.851,10.462 0,5.611 2.314,3.297 4.851,5.835\n    10.686,0 13,2.314 4.851,10.462",
+              })
+            )
+        );
+      }
+      function preventDefault(e) {
+        e.preventDefault();
+      }
+      let AggregateErrorImpl;
+      if (typeof AggregateError === "undefined") {
+        class AggregateErrorClass extends Error {
+          constructor(errors2, message = "") {
+            super(message);
+            this.errors = errors2;
+            this.name = "AggregateError";
+            Error.captureStackTrace(this, AggregateErrorClass);
+          }
+        }
+        AggregateErrorImpl = function (errors2, message) {
+          return new AggregateErrorClass(errors2, message);
+        };
+      } else {
+        AggregateErrorImpl = AggregateError;
+      }
+      function isAggregateError(error2) {
+        return "errors" in error2 && Array.isArray(error2["errors"]);
+      }
+      const MAX_RECURSIVE_DEPTH$1 = 3;
+      function inspect$1(value) {
+        return formatValue$1(value, []);
+      }
+      function formatValue$1(value, seenValues) {
+        switch (typeof value) {
+          case "string":
+            return JSON.stringify(value);
+          case "function":
+            return value.name ? `[function ${value.name}]` : "[function]";
+          case "object":
+            return formatObjectValue$1(value, seenValues);
+          default:
+            return String(value);
+        }
+      }
+      function formatError(value) {
+        if (value instanceof GraphQLError) {
+          return value.toString();
+        }
+        return `${value.name}: ${value.message};
+ ${value.stack}`;
+      }
+      function formatObjectValue$1(value, previouslySeenValues) {
+        if (value === null) {
+          return "null";
+        }
+        if (value instanceof Error) {
+          if (isAggregateError(value)) {
+            return (
+              formatError(value) +
+              "\n" +
+              formatArray$1(value.errors, previouslySeenValues)
+            );
+          }
+          return formatError(value);
+        }
+        if (previouslySeenValues.includes(value)) {
+          return "[Circular]";
+        }
+        const seenValues = [...previouslySeenValues, value];
+        if (isJSONable$1(value)) {
+          const jsonValue = value.toJSON();
+          if (jsonValue !== value) {
+            return typeof jsonValue === "string"
+              ? jsonValue
+              : formatValue$1(jsonValue, seenValues);
+          }
+        } else if (Array.isArray(value)) {
+          return formatArray$1(value, seenValues);
+        }
+        return formatObject$1(value, seenValues);
+      }
+      function isJSONable$1(value) {
+        return typeof value.toJSON === "function";
+      }
+      function formatObject$1(object, seenValues) {
+        const entries = Object.entries(object);
+        if (entries.length === 0) {
+          return "{}";
+        }
+        if (seenValues.length > MAX_RECURSIVE_DEPTH$1) {
+          return "[" + getObjectTag$1(object) + "]";
+        }
+        const properties = entries.map(
+          ([key, value]) => key + ": " + formatValue$1(value, seenValues)
+        );
+        return "{ " + properties.join(", ") + " }";
+      }
+      function formatArray$1(array, seenValues) {
+        if (array.length === 0) {
+          return "[]";
+        }
+        if (seenValues.length > MAX_RECURSIVE_DEPTH$1) {
+          return "[Array]";
+        }
+        const len = array.length;
+        const remaining = array.length;
+        const items = [];
+        for (let i = 0; i < len; ++i) {
+          items.push(formatValue$1(array[i], seenValues));
+        }
+        if (remaining === 1) {
+          items.push("... 1 more item");
+        } else if (remaining > 1) {
+          items.push(`... ${remaining} more items`);
+        }
+        return "[" + items.join(", ") + "]";
+      }
+      function getObjectTag$1(object) {
+        const tag = Object.prototype.toString
+          .call(object)
+          .replace(/^\[object /, "")
+          .replace(/]$/, "");
+        if (tag === "Object" && typeof object.constructor === "function") {
+          const name2 = object.constructor.name;
+          if (typeof name2 === "string" && name2 !== "") {
+            return name2;
+          }
+        }
+        return tag;
+      }
+      function astFromType(type2) {
+        if (isNonNullType(type2)) {
+          const innerType = astFromType(type2.ofType);
+          if (innerType.kind === Kind.NON_NULL_TYPE) {
+            throw new Error(
+              `Invalid type node ${inspect$1(
+                type2
+              )}. Inner type of non-null type cannot be a non-null type.`
+            );
+          }
+          return {
+            kind: Kind.NON_NULL_TYPE,
+            type: innerType,
+          };
+        } else if (isListType(type2)) {
+          return {
+            kind: Kind.LIST_TYPE,
+            type: astFromType(type2.ofType),
+          };
+        }
+        return {
+          kind: Kind.NAMED_TYPE,
+          name: {
+            kind: Kind.NAME,
+            value: type2.name,
+          },
+        };
+      }
+      function memoize1$1(fn) {
+        const memoize1cache = /* @__PURE__ */ new WeakMap();
+        return function memoized(a1) {
+          const cachedValue = memoize1cache.get(a1);
+          if (cachedValue === void 0) {
+            const newValue = fn(a1);
+            memoize1cache.set(a1, newValue);
+            return newValue;
+          }
+          return cachedValue;
+        };
+      }
+      function memoize2$1(fn) {
+        const memoize2cache = /* @__PURE__ */ new WeakMap();
+        return function memoized(a1, a2) {
+          let cache2 = memoize2cache.get(a1);
+          if (!cache2) {
+            cache2 = /* @__PURE__ */ new WeakMap();
+            memoize2cache.set(a1, cache2);
+            const newValue = fn(a1, a2);
+            cache2.set(a2, newValue);
+            return newValue;
+          }
+          const cachedValue = cache2.get(a2);
+          if (cachedValue === void 0) {
+            const newValue = fn(a1, a2);
+            cache2.set(a2, newValue);
+            return newValue;
+          }
+          return cachedValue;
+        };
+      }
+      const memoize2of4cache = /* @__PURE__ */ new WeakMap();
+      function memoize2of4(fn) {
+        return function memoized(a1, a2, a3, a4) {
+          let cache2 = memoize2of4cache.get(a1);
+          if (!cache2) {
+            cache2 = /* @__PURE__ */ new WeakMap();
+            memoize2of4cache.set(a1, cache2);
+            const newValue = fn(a1, a2, a3, a4);
+            cache2.set(a2, newValue);
+            return newValue;
+          }
+          const cachedValue = cache2.get(a2);
+          if (cachedValue === void 0) {
+            const newValue = fn(a1, a2, a3, a4);
+            cache2.set(a2, newValue);
+            return newValue;
+          }
+          return cachedValue;
+        };
+      }
+      function getDefinedRootType(schema, operation) {
+        const rootTypeMap = getRootTypeMap(schema);
+        const rootType = rootTypeMap.get(operation);
+        if (rootType == null) {
+          throw new Error(
+            `Root type for operation "${operation}" not defined by the given schema.`
+          );
+        }
+        return rootType;
+      }
+      const getRootTypeNames = memoize1$1(function getRootTypeNames2(schema) {
+        const rootTypes = getRootTypes(schema);
+        return new Set([...rootTypes].map((type2) => type2.name));
+      });
+      const getRootTypes = memoize1$1(function getRootTypes2(schema) {
+        const rootTypeMap = getRootTypeMap(schema);
+        return new Set(rootTypeMap.values());
+      });
+      const getRootTypeMap = memoize1$1(function getRootTypeMap2(schema) {
+        const rootTypeMap = /* @__PURE__ */ new Map();
+        const queryType = schema.getQueryType();
+        if (queryType) {
+          rootTypeMap.set("query", queryType);
+        }
+        const mutationType = schema.getMutationType();
+        if (mutationType) {
+          rootTypeMap.set("mutation", mutationType);
+        }
+        const subscriptionType = schema.getSubscriptionType();
+        if (subscriptionType) {
+          rootTypeMap.set("subscription", subscriptionType);
+        }
+        return rootTypeMap;
+      });
+      const MAX_LINE_LENGTH = 80;
+      let commentsRegistry = {};
+      function printComment(comment2) {
+        return "\n# " + comment2.replace(/\n/g, "\n# ");
+      }
+      function join(maybeArray, separator2) {
+        return maybeArray
+          ? maybeArray.filter((x2) => x2).join(separator2 || "")
+          : "";
+      }
+      function hasMultilineItems(maybeArray) {
+        var _a2;
+        return (_a2 =
+          maybeArray === null || maybeArray === void 0
+            ? void 0
+            : maybeArray.some((str) => str.includes("\n"))) !== null &&
+          _a2 !== void 0
+          ? _a2
+          : false;
+      }
+      function addDescription(cb2) {
+        return (node, _key, _parent, path, ancestors) => {
+          var _a2;
+          const keys = [];
+          const parent = path.reduce((prev, key2) => {
+            if (["fields", "arguments", "values"].includes(key2) && prev.name) {
+              keys.push(prev.name.value);
+            }
+            return prev[key2];
+          }, ancestors[0]);
+          const key = [
+            ...keys,
+            (_a2 =
+              parent === null || parent === void 0 ? void 0 : parent.name) ===
+              null || _a2 === void 0
+              ? void 0
+              : _a2.value,
+          ]
+            .filter(Boolean)
+            .join(".");
+          const items = [];
+          if (node.kind.includes("Definition") && commentsRegistry[key]) {
+            items.push(...commentsRegistry[key]);
+          }
+          return join(
+            [
+              ...items.map(printComment),
+              node.description,
+              cb2(node, _key, _parent, path, ancestors),
+            ],
+            "\n"
+          );
+        };
+      }
+      function indent$3(maybeString) {
+        return maybeString && `  ${maybeString.replace(/\n/g, "\n  ")}`;
+      }
+      function block2(array) {
+        return array && array.length !== 0
+          ? `{
+${indent$3(join(array, "\n"))}
+}`
+          : "";
+      }
+      function wrap(start2, maybeString, end2) {
+        return maybeString ? start2 + maybeString + (end2 || "") : "";
+      }
+      function printBlockString(value, isDescription = false) {
+        const escaped = value.replace(/"""/g, '\\"""');
+        return (value[0] === " " || value[0] === "	") &&
+          value.indexOf("\n") === -1
+          ? `"""${escaped.replace(/"$/, '"\n')}"""`
+          : `"""
+${isDescription ? escaped : indent$3(escaped)}
+"""`;
+      }
+      const printDocASTReducer = {
+        Name: { leave: (node) => node.value },
+        Variable: { leave: (node) => "$" + node.name },
+        Document: {
+          leave: (node) => join(node.definitions, "\n\n"),
+        },
+        OperationDefinition: {
+          leave: (node) => {
+            const varDefs = wrap(
+              "(",
+              join(node.variableDefinitions, ", "),
+              ")"
+            );
+            const prefix = join(
+              [
+                node.operation,
+                join([node.name, varDefs]),
+                join(node.directives, " "),
+              ],
+              " "
+            );
+            return prefix + " " + node.selectionSet;
+          },
+        },
+        VariableDefinition: {
+          leave: ({
+            variable,
+            type: type2,
+            defaultValue: defaultValue2,
+            directives,
+          }) =>
+            variable +
+            ": " +
+            type2 +
+            wrap(" = ", defaultValue2) +
+            wrap(" ", join(directives, " ")),
+        },
+        SelectionSet: { leave: ({ selections }) => block2(selections) },
+        Field: {
+          leave({
+            alias,
+            name: name2,
+            arguments: args,
+            directives,
+            selectionSet,
+          }) {
+            const prefix = wrap("", alias, ": ") + name2;
+            let argsLine = prefix + wrap("(", join(args, ", "), ")");
+            if (argsLine.length > MAX_LINE_LENGTH) {
+              argsLine =
+                prefix + wrap("(\n", indent$3(join(args, "\n")), "\n)");
+            }
+            return join([argsLine, join(directives, " "), selectionSet], " ");
+          },
+        },
+        Argument: { leave: ({ name: name2, value }) => name2 + ": " + value },
+        FragmentSpread: {
+          leave: ({ name: name2, directives }) =>
+            "..." + name2 + wrap(" ", join(directives, " ")),
+        },
+        InlineFragment: {
+          leave: ({ typeCondition, directives, selectionSet }) =>
+            join(
+              [
+                "...",
+                wrap("on ", typeCondition),
+                join(directives, " "),
+                selectionSet,
+              ],
+              " "
+            ),
+        },
+        FragmentDefinition: {
+          leave: ({
+            name: name2,
+            typeCondition,
+            variableDefinitions,
+            directives,
+            selectionSet,
+          }) =>
+            `fragment ${name2}${wrap(
+              "(",
+              join(variableDefinitions, ", "),
+              ")"
+            )} on ${typeCondition} ${wrap("", join(directives, " "), " ")}` +
+            selectionSet,
+        },
+        IntValue: { leave: ({ value }) => value },
+        FloatValue: { leave: ({ value }) => value },
+        StringValue: {
+          leave: ({ value, block: isBlockString }) => {
+            if (isBlockString) {
+              return printBlockString(value);
+            }
+            return JSON.stringify(value);
+          },
+        },
+        BooleanValue: { leave: ({ value }) => (value ? "true" : "false") },
+        NullValue: { leave: () => "null" },
+        EnumValue: { leave: ({ value }) => value },
+        ListValue: { leave: ({ values }) => "[" + join(values, ", ") + "]" },
+        ObjectValue: { leave: ({ fields }) => "{" + join(fields, ", ") + "}" },
+        ObjectField: {
+          leave: ({ name: name2, value }) => name2 + ": " + value,
+        },
+        Directive: {
+          leave: ({ name: name2, arguments: args }) =>
+            "@" + name2 + wrap("(", join(args, ", "), ")"),
+        },
+        NamedType: { leave: ({ name: name2 }) => name2 },
+        ListType: { leave: ({ type: type2 }) => "[" + type2 + "]" },
+        NonNullType: { leave: ({ type: type2 }) => type2 + "!" },
+        SchemaDefinition: {
+          leave: ({ directives, operationTypes }) =>
+            join(
+              ["schema", join(directives, " "), block2(operationTypes)],
+              " "
+            ),
+        },
+        OperationTypeDefinition: {
+          leave: ({ operation, type: type2 }) => operation + ": " + type2,
+        },
+        ScalarTypeDefinition: {
+          leave: ({ name: name2, directives }) =>
+            join(["scalar", name2, join(directives, " ")], " "),
+        },
+        ObjectTypeDefinition: {
+          leave: ({ name: name2, interfaces, directives, fields }) =>
+            join(
+              [
+                "type",
+                name2,
+                wrap("implements ", join(interfaces, " & ")),
+                join(directives, " "),
+                block2(fields),
+              ],
+              " "
+            ),
+        },
+        FieldDefinition: {
+          leave: ({ name: name2, arguments: args, type: type2, directives }) =>
+            name2 +
+            (hasMultilineItems(args)
+              ? wrap("(\n", indent$3(join(args, "\n")), "\n)")
+              : wrap("(", join(args, ", "), ")")) +
+            ": " +
+            type2 +
+            wrap(" ", join(directives, " ")),
+        },
+        InputValueDefinition: {
+          leave: ({
+            name: name2,
+            type: type2,
+            defaultValue: defaultValue2,
+            directives,
+          }) =>
+            join(
+              [
+                name2 + ": " + type2,
+                wrap("= ", defaultValue2),
+                join(directives, " "),
+              ],
+              " "
+            ),
+        },
+        InterfaceTypeDefinition: {
+          leave: ({ name: name2, interfaces, directives, fields }) =>
+            join(
+              [
+                "interface",
+                name2,
+                wrap("implements ", join(interfaces, " & ")),
+                join(directives, " "),
+                block2(fields),
+              ],
+              " "
+            ),
+        },
+        UnionTypeDefinition: {
+          leave: ({ name: name2, directives, types }) =>
+            join(
+              [
+                "union",
+                name2,
+                join(directives, " "),
+                wrap("= ", join(types, " | ")),
+              ],
+              " "
+            ),
+        },
+        EnumTypeDefinition: {
+          leave: ({ name: name2, directives, values }) =>
+            join(["enum", name2, join(directives, " "), block2(values)], " "),
+        },
+        EnumValueDefinition: {
+          leave: ({ name: name2, directives }) =>
+            join([name2, join(directives, " ")], " "),
+        },
+        InputObjectTypeDefinition: {
+          leave: ({ name: name2, directives, fields }) =>
+            join(["input", name2, join(directives, " "), block2(fields)], " "),
+        },
+        DirectiveDefinition: {
+          leave: ({ name: name2, arguments: args, repeatable, locations }) =>
+            "directive @" +
+            name2 +
+            (hasMultilineItems(args)
+              ? wrap("(\n", indent$3(join(args, "\n")), "\n)")
+              : wrap("(", join(args, ", "), ")")) +
+            (repeatable ? " repeatable" : "") +
+            " on " +
+            join(locations, " | "),
+        },
+        SchemaExtension: {
+          leave: ({ directives, operationTypes }) =>
+            join(
+              ["extend schema", join(directives, " "), block2(operationTypes)],
+              " "
+            ),
+        },
+        ScalarTypeExtension: {
+          leave: ({ name: name2, directives }) =>
+            join(["extend scalar", name2, join(directives, " ")], " "),
+        },
+        ObjectTypeExtension: {
+          leave: ({ name: name2, interfaces, directives, fields }) =>
+            join(
+              [
+                "extend type",
+                name2,
+                wrap("implements ", join(interfaces, " & ")),
+                join(directives, " "),
+                block2(fields),
+              ],
+              " "
+            ),
+        },
+        InterfaceTypeExtension: {
+          leave: ({ name: name2, interfaces, directives, fields }) =>
+            join(
+              [
+                "extend interface",
+                name2,
+                wrap("implements ", join(interfaces, " & ")),
+                join(directives, " "),
+                block2(fields),
+              ],
+              " "
+            ),
+        },
+        UnionTypeExtension: {
+          leave: ({ name: name2, directives, types }) =>
+            join(
+              [
+                "extend union",
+                name2,
+                join(directives, " "),
+                wrap("= ", join(types, " | ")),
+              ],
+              " "
+            ),
+        },
+        EnumTypeExtension: {
+          leave: ({ name: name2, directives, values }) =>
+            join(
+              ["extend enum", name2, join(directives, " "), block2(values)],
+              " "
+            ),
+        },
+        InputObjectTypeExtension: {
+          leave: ({ name: name2, directives, fields }) =>
+            join(
+              ["extend input", name2, join(directives, " "), block2(fields)],
+              " "
+            ),
+        },
+      };
+      Object.keys(printDocASTReducer).reduce(
+        (prev, key) =>
+          __spreadProps(__spreadValues({}, prev), {
+            [key]: {
+              leave: addDescription(printDocASTReducer[key].leave),
+            },
+          }),
+        {}
+      );
+      function getLeadingCommentBlock(node) {
+        const loc = node.loc;
+        if (!loc) {
+          return;
+        }
+        const comments = [];
+        let token2 = loc.startToken.prev;
+        while (
+          token2 != null &&
+          token2.kind === TokenKind.COMMENT &&
+          token2.next != null &&
+          token2.prev != null &&
+          token2.line + 1 === token2.next.line &&
+          token2.line !== token2.prev.line
+        ) {
+          const value = String(token2.value);
+          comments.push(value);
+          token2 = token2.prev;
+        }
+        return comments.length > 0 ? comments.reverse().join("\n") : void 0;
+      }
+      function dedentBlockStringValue(rawString) {
+        const lines = rawString.split(/\r\n|[\n\r]/g);
+        const commonIndent = getBlockStringIndentation(lines);
+        if (commonIndent !== 0) {
+          for (let i = 1; i < lines.length; i++) {
+            lines[i] = lines[i].slice(commonIndent);
+          }
+        }
+        while (lines.length > 0 && isBlank(lines[0])) {
+          lines.shift();
+        }
+        while (lines.length > 0 && isBlank(lines[lines.length - 1])) {
+          lines.pop();
+        }
+        return lines.join("\n");
+      }
+      function getBlockStringIndentation(lines) {
+        let commonIndent = null;
+        for (let i = 1; i < lines.length; i++) {
+          const line = lines[i];
+          const indent2 = leadingWhitespace(line);
+          if (indent2 === line.length) {
+            continue;
+          }
+          if (commonIndent === null || indent2 < commonIndent) {
+            commonIndent = indent2;
+            if (commonIndent === 0) {
+              break;
+            }
+          }
+        }
+        return commonIndent === null ? 0 : commonIndent;
+      }
+      function leadingWhitespace(str) {
+        let i = 0;
+        while (i < str.length && (str[i] === " " || str[i] === "	")) {
+          i++;
+        }
+        return i;
+      }
+      function isBlank(str) {
+        return leadingWhitespace(str) === str.length;
+      }
+      function parseGraphQLSDL(location2, rawSDL, options = {}) {
+        let document2;
+        try {
+          if (options.commentDescriptions && rawSDL.includes("#")) {
+            document2 = transformCommentsToDescriptions(rawSDL, options);
+            if (options.noLocation) {
+              document2 = parse$1(print(document2), options);
+            }
+          } else {
+            document2 = parse$1(new Source(rawSDL, location2), options);
+          }
+        } catch (e) {
+          if (
+            e.message.includes("EOF") &&
+            rawSDL.replace(/(\#[^*]*)/g, "").trim() === ""
+          ) {
+            document2 = {
+              kind: Kind.DOCUMENT,
+              definitions: [],
+            };
+          } else {
+            throw e;
+          }
+        }
+        return {
+          location: location2,
+          document: document2,
+        };
+      }
+      function transformCommentsToDescriptions(sourceSdl, options = {}) {
+        const parsedDoc = parse$1(
+          sourceSdl,
+          __spreadProps(__spreadValues({}, options), {
+            noLocation: false,
+          })
+        );
+        const modifiedDoc = visit(parsedDoc, {
+          leave: (node) => {
+            if (isDescribable(node)) {
+              const rawValue = getLeadingCommentBlock(node);
+              if (rawValue !== void 0) {
+                const commentsBlock = dedentBlockStringValue("\n" + rawValue);
+                const isBlock = commentsBlock.includes("\n");
+                if (!node.description) {
+                  return __spreadProps(__spreadValues({}, node), {
+                    description: {
+                      kind: Kind.STRING,
+                      value: commentsBlock,
+                      block: isBlock,
+                    },
+                  });
+                } else {
+                  return __spreadProps(__spreadValues({}, node), {
+                    description: __spreadProps(
+                      __spreadValues({}, node.description),
+                      {
+                        value: node.description.value + "\n" + commentsBlock,
+                        block: true,
+                      }
+                    ),
+                  });
+                }
+              }
+            }
+          },
+        });
+        return modifiedDoc;
+      }
+      function isDescribable(node) {
+        return (
+          isTypeSystemDefinitionNode(node) ||
+          node.kind === Kind.FIELD_DEFINITION ||
+          node.kind === Kind.INPUT_VALUE_DEFINITION ||
+          node.kind === Kind.ENUM_VALUE_DEFINITION
+        );
+      }
+      var MapperKind;
+      (function (MapperKind2) {
+        MapperKind2["TYPE"] = "MapperKind.TYPE";
+        MapperKind2["SCALAR_TYPE"] = "MapperKind.SCALAR_TYPE";
+        MapperKind2["ENUM_TYPE"] = "MapperKind.ENUM_TYPE";
+        MapperKind2["COMPOSITE_TYPE"] = "MapperKind.COMPOSITE_TYPE";
+        MapperKind2["OBJECT_TYPE"] = "MapperKind.OBJECT_TYPE";
+        MapperKind2["INPUT_OBJECT_TYPE"] = "MapperKind.INPUT_OBJECT_TYPE";
+        MapperKind2["ABSTRACT_TYPE"] = "MapperKind.ABSTRACT_TYPE";
+        MapperKind2["UNION_TYPE"] = "MapperKind.UNION_TYPE";
+        MapperKind2["INTERFACE_TYPE"] = "MapperKind.INTERFACE_TYPE";
+        MapperKind2["ROOT_OBJECT"] = "MapperKind.ROOT_OBJECT";
+        MapperKind2["QUERY"] = "MapperKind.QUERY";
+        MapperKind2["MUTATION"] = "MapperKind.MUTATION";
+        MapperKind2["SUBSCRIPTION"] = "MapperKind.SUBSCRIPTION";
+        MapperKind2["DIRECTIVE"] = "MapperKind.DIRECTIVE";
+        MapperKind2["FIELD"] = "MapperKind.FIELD";
+        MapperKind2["COMPOSITE_FIELD"] = "MapperKind.COMPOSITE_FIELD";
+        MapperKind2["OBJECT_FIELD"] = "MapperKind.OBJECT_FIELD";
+        MapperKind2["ROOT_FIELD"] = "MapperKind.ROOT_FIELD";
+        MapperKind2["QUERY_ROOT_FIELD"] = "MapperKind.QUERY_ROOT_FIELD";
+        MapperKind2["MUTATION_ROOT_FIELD"] = "MapperKind.MUTATION_ROOT_FIELD";
+        MapperKind2["SUBSCRIPTION_ROOT_FIELD"] =
+          "MapperKind.SUBSCRIPTION_ROOT_FIELD";
+        MapperKind2["INTERFACE_FIELD"] = "MapperKind.INTERFACE_FIELD";
+        MapperKind2["INPUT_OBJECT_FIELD"] = "MapperKind.INPUT_OBJECT_FIELD";
+        MapperKind2["ARGUMENT"] = "MapperKind.ARGUMENT";
+        MapperKind2["ENUM_VALUE"] = "MapperKind.ENUM_VALUE";
+      })(MapperKind || (MapperKind = {}));
+      function getObjectTypeFromTypeMap(typeMap, type2) {
+        if (type2) {
+          const maybeObjectType = typeMap[type2.name];
+          if (isObjectType(maybeObjectType)) {
+            return maybeObjectType;
+          }
+        }
+      }
+      function isNamedStub(type2) {
+        if ("getFields" in type2) {
+          const fields = type2.getFields();
+          for (const fieldName in fields) {
+            const field = fields[fieldName];
+            return field.name === "_fake";
+          }
+        }
+        return false;
+      }
+      function getBuiltInForStub(type2) {
+        switch (type2.name) {
+          case GraphQLInt.name:
+            return GraphQLInt;
+          case GraphQLFloat.name:
+            return GraphQLFloat;
+          case GraphQLString.name:
+            return GraphQLString;
+          case GraphQLBoolean.name:
+            return GraphQLBoolean;
+          case GraphQLID.name:
+            return GraphQLID;
+          default:
+            return type2;
+        }
+      }
+      function rewireTypes(originalTypeMap, directives) {
+        const referenceTypeMap = /* @__PURE__ */ Object.create(null);
+        for (const typeName in originalTypeMap) {
+          referenceTypeMap[typeName] = originalTypeMap[typeName];
+        }
+        const newTypeMap = /* @__PURE__ */ Object.create(null);
+        for (const typeName in referenceTypeMap) {
+          const namedType = referenceTypeMap[typeName];
+          if (namedType == null || typeName.startsWith("__")) {
+            continue;
+          }
+          const newName = namedType.name;
+          if (newName.startsWith("__")) {
+            continue;
+          }
+          if (newTypeMap[newName] != null) {
+            throw new Error(`Duplicate schema type name ${newName}`);
+          }
+          newTypeMap[newName] = namedType;
+        }
+        for (const typeName in newTypeMap) {
+          newTypeMap[typeName] = rewireNamedType(newTypeMap[typeName]);
+        }
+        const newDirectives = directives.map((directive) =>
+          rewireDirective(directive)
+        );
+        return {
+          typeMap: newTypeMap,
+          directives: newDirectives,
+        };
+        function rewireDirective(directive) {
+          if (isSpecifiedDirective(directive)) {
+            return directive;
+          }
+          const directiveConfig = directive.toConfig();
+          directiveConfig.args = rewireArgs(directiveConfig.args);
+          return new GraphQLDirective(directiveConfig);
+        }
+        function rewireArgs(args) {
+          const rewiredArgs = {};
+          for (const argName in args) {
+            const arg = args[argName];
+            const rewiredArgType = rewireType(arg.type);
+            if (rewiredArgType != null) {
+              arg.type = rewiredArgType;
+              rewiredArgs[argName] = arg;
+            }
+          }
+          return rewiredArgs;
+        }
+        function rewireNamedType(type2) {
+          if (isObjectType(type2)) {
+            const config2 = type2.toConfig();
+            const newConfig = __spreadProps(__spreadValues({}, config2), {
+              fields: () => rewireFields(config2.fields),
+              interfaces: () => rewireNamedTypes(config2.interfaces),
+            });
+            return new GraphQLObjectType(newConfig);
+          } else if (isInterfaceType(type2)) {
+            const config2 = type2.toConfig();
+            const newConfig = __spreadProps(__spreadValues({}, config2), {
+              fields: () => rewireFields(config2.fields),
+            });
+            if ("interfaces" in newConfig) {
+              newConfig.interfaces = () => rewireNamedTypes(config2.interfaces);
+            }
+            return new GraphQLInterfaceType(newConfig);
+          } else if (isUnionType(type2)) {
+            const config2 = type2.toConfig();
+            const newConfig = __spreadProps(__spreadValues({}, config2), {
+              types: () => rewireNamedTypes(config2.types),
+            });
+            return new GraphQLUnionType(newConfig);
+          } else if (isInputObjectType(type2)) {
+            const config2 = type2.toConfig();
+            const newConfig = __spreadProps(__spreadValues({}, config2), {
+              fields: () => rewireInputFields(config2.fields),
+            });
+            return new GraphQLInputObjectType(newConfig);
+          } else if (isEnumType(type2)) {
+            const enumConfig = type2.toConfig();
+            return new GraphQLEnumType(enumConfig);
+          } else if (isScalarType(type2)) {
+            if (isSpecifiedScalarType(type2)) {
+              return type2;
+            }
+            const scalarConfig = type2.toConfig();
+            return new GraphQLScalarType(scalarConfig);
+          }
+          throw new Error(`Unexpected schema type: ${type2}`);
+        }
+        function rewireFields(fields) {
+          const rewiredFields = {};
+          for (const fieldName in fields) {
+            const field = fields[fieldName];
+            const rewiredFieldType = rewireType(field.type);
+            if (rewiredFieldType != null && field.args) {
+              field.type = rewiredFieldType;
+              field.args = rewireArgs(field.args);
+              rewiredFields[fieldName] = field;
+            }
+          }
+          return rewiredFields;
+        }
+        function rewireInputFields(fields) {
+          const rewiredFields = {};
+          for (const fieldName in fields) {
+            const field = fields[fieldName];
+            const rewiredFieldType = rewireType(field.type);
+            if (rewiredFieldType != null) {
+              field.type = rewiredFieldType;
+              rewiredFields[fieldName] = field;
+            }
+          }
+          return rewiredFields;
+        }
+        function rewireNamedTypes(namedTypes) {
+          const rewiredTypes = [];
+          for (const namedType of namedTypes) {
+            const rewiredType = rewireType(namedType);
+            if (rewiredType != null) {
+              rewiredTypes.push(rewiredType);
+            }
+          }
+          return rewiredTypes;
+        }
+        function rewireType(type2) {
+          if (isListType(type2)) {
+            const rewiredType = rewireType(type2.ofType);
+            return rewiredType != null ? new GraphQLList(rewiredType) : null;
+          } else if (isNonNullType(type2)) {
+            const rewiredType = rewireType(type2.ofType);
+            return rewiredType != null ? new GraphQLNonNull(rewiredType) : null;
+          } else if (isNamedType(type2)) {
+            let rewiredType = referenceTypeMap[type2.name];
+            if (rewiredType === void 0) {
+              rewiredType = isNamedStub(type2)
+                ? getBuiltInForStub(type2)
+                : rewireNamedType(type2);
+              newTypeMap[rewiredType.name] = referenceTypeMap[type2.name] =
+                rewiredType;
+            }
+            return rewiredType != null ? newTypeMap[rewiredType.name] : null;
+          }
+          return null;
+        }
+      }
+      function transformInputValue(
+        type2,
+        value,
+        inputLeafValueTransformer = null,
+        inputObjectValueTransformer = null
+      ) {
+        if (value == null) {
+          return value;
+        }
+        const nullableType = getNullableType(type2);
+        if (isLeafType(nullableType)) {
+          return inputLeafValueTransformer != null
+            ? inputLeafValueTransformer(nullableType, value)
+            : value;
+        } else if (isListType(nullableType)) {
+          return value.map((listMember) =>
+            transformInputValue(
+              nullableType.ofType,
+              listMember,
+              inputLeafValueTransformer,
+              inputObjectValueTransformer
+            )
+          );
+        } else if (isInputObjectType(nullableType)) {
+          const fields = nullableType.getFields();
+          const newValue = {};
+          for (const key in value) {
+            const field = fields[key];
+            if (field != null) {
+              newValue[key] = transformInputValue(
+                field.type,
+                value[key],
+                inputLeafValueTransformer,
+                inputObjectValueTransformer
+              );
+            }
+          }
+          return inputObjectValueTransformer != null
+            ? inputObjectValueTransformer(nullableType, newValue)
+            : newValue;
+        }
+      }
+      function serializeInputValue(type2, value) {
+        return transformInputValue(type2, value, (t2, v2) => {
+          try {
+            return t2.serialize(v2);
+          } catch (_a2) {
+            return v2;
+          }
+        });
+      }
+      function parseInputValue(type2, value) {
+        return transformInputValue(type2, value, (t2, v2) => {
+          try {
+            return t2.parseValue(v2);
+          } catch (_a2) {
+            return v2;
+          }
+        });
+      }
+      function mapSchema(schema, schemaMapper = {}) {
+        const newTypeMap = mapArguments(
+          mapFields(
+            mapTypes(
+              mapDefaultValues(
+                mapEnumValues(
+                  mapTypes(
+                    mapDefaultValues(
+                      schema.getTypeMap(),
+                      schema,
+                      serializeInputValue
+                    ),
+                    schema,
+                    schemaMapper,
+                    (type2) => isLeafType(type2)
+                  ),
+                  schema,
+                  schemaMapper
+                ),
+                schema,
+                parseInputValue
+              ),
+              schema,
+              schemaMapper,
+              (type2) => !isLeafType(type2)
+            ),
+            schema,
+            schemaMapper
+          ),
+          schema,
+          schemaMapper
+        );
+        const originalDirectives = schema.getDirectives();
+        const newDirectives = mapDirectives(
+          originalDirectives,
+          schema,
+          schemaMapper
+        );
+        const { typeMap, directives } = rewireTypes(newTypeMap, newDirectives);
+        return new GraphQLSchema(
+          __spreadProps(__spreadValues({}, schema.toConfig()), {
+            query: getObjectTypeFromTypeMap(
+              typeMap,
+              getObjectTypeFromTypeMap(newTypeMap, schema.getQueryType())
+            ),
+            mutation: getObjectTypeFromTypeMap(
+              typeMap,
+              getObjectTypeFromTypeMap(newTypeMap, schema.getMutationType())
+            ),
+            subscription: getObjectTypeFromTypeMap(
+              typeMap,
+              getObjectTypeFromTypeMap(newTypeMap, schema.getSubscriptionType())
+            ),
+            types: Object.values(typeMap),
+            directives,
+          })
+        );
+      }
+      function mapTypes(
+        originalTypeMap,
+        schema,
+        schemaMapper,
+        testFn = () => true
+      ) {
+        const newTypeMap = {};
+        for (const typeName in originalTypeMap) {
+          if (!typeName.startsWith("__")) {
+            const originalType = originalTypeMap[typeName];
+            if (originalType == null || !testFn(originalType)) {
+              newTypeMap[typeName] = originalType;
+              continue;
+            }
+            const typeMapper = getTypeMapper(schema, schemaMapper, typeName);
+            if (typeMapper == null) {
+              newTypeMap[typeName] = originalType;
+              continue;
+            }
+            const maybeNewType = typeMapper(originalType, schema);
+            if (maybeNewType === void 0) {
+              newTypeMap[typeName] = originalType;
+              continue;
+            }
+            newTypeMap[typeName] = maybeNewType;
+          }
+        }
+        return newTypeMap;
+      }
+      function mapEnumValues(originalTypeMap, schema, schemaMapper) {
+        const enumValueMapper = getEnumValueMapper(schemaMapper);
+        if (!enumValueMapper) {
+          return originalTypeMap;
+        }
+        return mapTypes(
+          originalTypeMap,
+          schema,
+          {
+            [MapperKind.ENUM_TYPE]: (type2) => {
+              const config2 = type2.toConfig();
+              const originalEnumValueConfigMap = config2.values;
+              const newEnumValueConfigMap = {};
+              for (const externalValue in originalEnumValueConfigMap) {
+                const originalEnumValueConfig =
+                  originalEnumValueConfigMap[externalValue];
+                const mappedEnumValue = enumValueMapper(
+                  originalEnumValueConfig,
+                  type2.name,
+                  schema,
+                  externalValue
+                );
+                if (mappedEnumValue === void 0) {
+                  newEnumValueConfigMap[externalValue] =
+                    originalEnumValueConfig;
+                } else if (Array.isArray(mappedEnumValue)) {
+                  const [newExternalValue, newEnumValueConfig] =
+                    mappedEnumValue;
+                  newEnumValueConfigMap[newExternalValue] =
+                    newEnumValueConfig === void 0
+                      ? originalEnumValueConfig
+                      : newEnumValueConfig;
+                } else if (mappedEnumValue !== null) {
+                  newEnumValueConfigMap[externalValue] = mappedEnumValue;
+                }
+              }
+              return correctASTNodes(
+                new GraphQLEnumType(
+                  __spreadProps(__spreadValues({}, config2), {
+                    values: newEnumValueConfigMap,
+                  })
+                )
+              );
+            },
+          },
+          (type2) => isEnumType(type2)
+        );
+      }
+      function mapDefaultValues(originalTypeMap, schema, fn) {
+        const newTypeMap = mapArguments(originalTypeMap, schema, {
+          [MapperKind.ARGUMENT]: (argumentConfig) => {
+            if (argumentConfig.defaultValue === void 0) {
+              return argumentConfig;
+            }
+            const maybeNewType = getNewType(
+              originalTypeMap,
+              argumentConfig.type
+            );
+            if (maybeNewType != null) {
+              return __spreadProps(__spreadValues({}, argumentConfig), {
+                defaultValue: fn(maybeNewType, argumentConfig.defaultValue),
+              });
+            }
+          },
+        });
+        return mapFields(newTypeMap, schema, {
+          [MapperKind.INPUT_OBJECT_FIELD]: (inputFieldConfig) => {
+            if (inputFieldConfig.defaultValue === void 0) {
+              return inputFieldConfig;
+            }
+            const maybeNewType = getNewType(newTypeMap, inputFieldConfig.type);
+            if (maybeNewType != null) {
+              return __spreadProps(__spreadValues({}, inputFieldConfig), {
+                defaultValue: fn(maybeNewType, inputFieldConfig.defaultValue),
+              });
+            }
+          },
+        });
+      }
+      function getNewType(newTypeMap, type2) {
+        if (isListType(type2)) {
+          const newType = getNewType(newTypeMap, type2.ofType);
+          return newType != null ? new GraphQLList(newType) : null;
+        } else if (isNonNullType(type2)) {
+          const newType = getNewType(newTypeMap, type2.ofType);
+          return newType != null ? new GraphQLNonNull(newType) : null;
+        } else if (isNamedType(type2)) {
+          const newType = newTypeMap[type2.name];
+          return newType != null ? newType : null;
+        }
+        return null;
+      }
+      function mapFields(originalTypeMap, schema, schemaMapper) {
+        const newTypeMap = {};
+        for (const typeName in originalTypeMap) {
+          if (!typeName.startsWith("__")) {
+            const originalType = originalTypeMap[typeName];
+            if (
+              !isObjectType(originalType) &&
+              !isInterfaceType(originalType) &&
+              !isInputObjectType(originalType)
+            ) {
+              newTypeMap[typeName] = originalType;
+              continue;
+            }
+            const fieldMapper = getFieldMapper(schema, schemaMapper, typeName);
+            if (fieldMapper == null) {
+              newTypeMap[typeName] = originalType;
+              continue;
+            }
+            const config2 = originalType.toConfig();
+            const originalFieldConfigMap = config2.fields;
+            const newFieldConfigMap = {};
+            for (const fieldName in originalFieldConfigMap) {
+              const originalFieldConfig = originalFieldConfigMap[fieldName];
+              const mappedField = fieldMapper(
+                originalFieldConfig,
+                fieldName,
+                typeName,
+                schema
+              );
+              if (mappedField === void 0) {
+                newFieldConfigMap[fieldName] = originalFieldConfig;
+              } else if (Array.isArray(mappedField)) {
+                const [newFieldName, newFieldConfig] = mappedField;
+                if (newFieldConfig.astNode != null) {
+                  newFieldConfig.astNode = __spreadProps(
+                    __spreadValues({}, newFieldConfig.astNode),
+                    {
+                      name: __spreadProps(
+                        __spreadValues({}, newFieldConfig.astNode.name),
+                        {
+                          value: newFieldName,
+                        }
+                      ),
+                    }
+                  );
+                }
+                newFieldConfigMap[newFieldName] =
+                  newFieldConfig === void 0
+                    ? originalFieldConfig
+                    : newFieldConfig;
+              } else if (mappedField !== null) {
+                newFieldConfigMap[fieldName] = mappedField;
+              }
+            }
+            if (isObjectType(originalType)) {
+              newTypeMap[typeName] = correctASTNodes(
+                new GraphQLObjectType(
+                  __spreadProps(__spreadValues({}, config2), {
+                    fields: newFieldConfigMap,
+                  })
+                )
+              );
+            } else if (isInterfaceType(originalType)) {
+              newTypeMap[typeName] = correctASTNodes(
+                new GraphQLInterfaceType(
+                  __spreadProps(__spreadValues({}, config2), {
+                    fields: newFieldConfigMap,
+                  })
+                )
+              );
+            } else {
+              newTypeMap[typeName] = correctASTNodes(
+                new GraphQLInputObjectType(
+                  __spreadProps(__spreadValues({}, config2), {
+                    fields: newFieldConfigMap,
+                  })
+                )
+              );
+            }
+          }
+        }
+        return newTypeMap;
+      }
+      function mapArguments(originalTypeMap, schema, schemaMapper) {
+        const newTypeMap = {};
+        for (const typeName in originalTypeMap) {
+          if (!typeName.startsWith("__")) {
+            const originalType = originalTypeMap[typeName];
+            if (!isObjectType(originalType) && !isInterfaceType(originalType)) {
+              newTypeMap[typeName] = originalType;
+              continue;
+            }
+            const argumentMapper = getArgumentMapper(schemaMapper);
+            if (argumentMapper == null) {
+              newTypeMap[typeName] = originalType;
+              continue;
+            }
+            const config2 = originalType.toConfig();
+            const originalFieldConfigMap = config2.fields;
+            const newFieldConfigMap = {};
+            for (const fieldName in originalFieldConfigMap) {
+              const originalFieldConfig = originalFieldConfigMap[fieldName];
+              const originalArgumentConfigMap = originalFieldConfig.args;
+              if (originalArgumentConfigMap == null) {
+                newFieldConfigMap[fieldName] = originalFieldConfig;
+                continue;
+              }
+              const argumentNames = Object.keys(originalArgumentConfigMap);
+              if (!argumentNames.length) {
+                newFieldConfigMap[fieldName] = originalFieldConfig;
+                continue;
+              }
+              const newArgumentConfigMap = {};
+              for (const argumentName of argumentNames) {
+                const originalArgumentConfig =
+                  originalArgumentConfigMap[argumentName];
+                const mappedArgument = argumentMapper(
+                  originalArgumentConfig,
+                  fieldName,
+                  typeName,
+                  schema
+                );
+                if (mappedArgument === void 0) {
+                  newArgumentConfigMap[argumentName] = originalArgumentConfig;
+                } else if (Array.isArray(mappedArgument)) {
+                  const [newArgumentName, newArgumentConfig] = mappedArgument;
+                  newArgumentConfigMap[newArgumentName] = newArgumentConfig;
+                } else if (mappedArgument !== null) {
+                  newArgumentConfigMap[argumentName] = mappedArgument;
+                }
+              }
+              newFieldConfigMap[fieldName] = __spreadProps(
+                __spreadValues({}, originalFieldConfig),
+                {
+                  args: newArgumentConfigMap,
+                }
+              );
+            }
+            if (isObjectType(originalType)) {
+              newTypeMap[typeName] = new GraphQLObjectType(
+                __spreadProps(__spreadValues({}, config2), {
+                  fields: newFieldConfigMap,
+                })
+              );
+            } else if (isInterfaceType(originalType)) {
+              newTypeMap[typeName] = new GraphQLInterfaceType(
+                __spreadProps(__spreadValues({}, config2), {
+                  fields: newFieldConfigMap,
+                })
+              );
+            } else {
+              newTypeMap[typeName] = new GraphQLInputObjectType(
+                __spreadProps(__spreadValues({}, config2), {
+                  fields: newFieldConfigMap,
+                })
+              );
+            }
+          }
+        }
+        return newTypeMap;
+      }
+      function mapDirectives(originalDirectives, schema, schemaMapper) {
+        const directiveMapper = getDirectiveMapper(schemaMapper);
+        if (directiveMapper == null) {
+          return originalDirectives.slice();
+        }
+        const newDirectives = [];
+        for (const directive of originalDirectives) {
+          const mappedDirective = directiveMapper(directive, schema);
+          if (mappedDirective === void 0) {
+            newDirectives.push(directive);
+          } else if (mappedDirective !== null) {
+            newDirectives.push(mappedDirective);
+          }
+        }
+        return newDirectives;
+      }
+      function getTypeSpecifiers(schema, typeName) {
+        var _a2, _b, _c;
+        const type2 = schema.getType(typeName);
+        const specifiers = [MapperKind.TYPE];
+        if (isObjectType(type2)) {
+          specifiers.push(MapperKind.COMPOSITE_TYPE, MapperKind.OBJECT_TYPE);
+          if (
+            typeName ===
+            ((_a2 = schema.getQueryType()) === null || _a2 === void 0
+              ? void 0
+              : _a2.name)
+          ) {
+            specifiers.push(MapperKind.ROOT_OBJECT, MapperKind.QUERY);
+          } else if (
+            typeName ===
+            ((_b = schema.getMutationType()) === null || _b === void 0
+              ? void 0
+              : _b.name)
+          ) {
+            specifiers.push(MapperKind.ROOT_OBJECT, MapperKind.MUTATION);
+          } else if (
+            typeName ===
+            ((_c = schema.getSubscriptionType()) === null || _c === void 0
+              ? void 0
+              : _c.name)
+          ) {
+            specifiers.push(MapperKind.ROOT_OBJECT, MapperKind.SUBSCRIPTION);
+          }
+        } else if (isInputObjectType(type2)) {
+          specifiers.push(MapperKind.INPUT_OBJECT_TYPE);
+        } else if (isInterfaceType(type2)) {
+          specifiers.push(
+            MapperKind.COMPOSITE_TYPE,
+            MapperKind.ABSTRACT_TYPE,
+            MapperKind.INTERFACE_TYPE
+          );
+        } else if (isUnionType(type2)) {
+          specifiers.push(
+            MapperKind.COMPOSITE_TYPE,
+            MapperKind.ABSTRACT_TYPE,
+            MapperKind.UNION_TYPE
+          );
+        } else if (isEnumType(type2)) {
+          specifiers.push(MapperKind.ENUM_TYPE);
+        } else if (isScalarType(type2)) {
+          specifiers.push(MapperKind.SCALAR_TYPE);
+        }
+        return specifiers;
+      }
+      function getTypeMapper(schema, schemaMapper, typeName) {
+        const specifiers = getTypeSpecifiers(schema, typeName);
+        let typeMapper;
+        const stack = [...specifiers];
+        while (!typeMapper && stack.length > 0) {
+          const next = stack.pop();
+          typeMapper = schemaMapper[next];
+        }
+        return typeMapper != null ? typeMapper : null;
+      }
+      function getFieldSpecifiers(schema, typeName) {
+        var _a2, _b, _c;
+        const type2 = schema.getType(typeName);
+        const specifiers = [MapperKind.FIELD];
+        if (isObjectType(type2)) {
+          specifiers.push(MapperKind.COMPOSITE_FIELD, MapperKind.OBJECT_FIELD);
+          if (
+            typeName ===
+            ((_a2 = schema.getQueryType()) === null || _a2 === void 0
+              ? void 0
+              : _a2.name)
+          ) {
+            specifiers.push(MapperKind.ROOT_FIELD, MapperKind.QUERY_ROOT_FIELD);
+          } else if (
+            typeName ===
+            ((_b = schema.getMutationType()) === null || _b === void 0
+              ? void 0
+              : _b.name)
+          ) {
+            specifiers.push(
+              MapperKind.ROOT_FIELD,
+              MapperKind.MUTATION_ROOT_FIELD
+            );
+          } else if (
+            typeName ===
+            ((_c = schema.getSubscriptionType()) === null || _c === void 0
+              ? void 0
+              : _c.name)
+          ) {
+            specifiers.push(
+              MapperKind.ROOT_FIELD,
+              MapperKind.SUBSCRIPTION_ROOT_FIELD
+            );
+          }
+        } else if (isInterfaceType(type2)) {
+          specifiers.push(
+            MapperKind.COMPOSITE_FIELD,
+            MapperKind.INTERFACE_FIELD
+          );
+        } else if (isInputObjectType(type2)) {
+          specifiers.push(MapperKind.INPUT_OBJECT_FIELD);
+        }
+        return specifiers;
+      }
+      function getFieldMapper(schema, schemaMapper, typeName) {
+        const specifiers = getFieldSpecifiers(schema, typeName);
+        let fieldMapper;
+        const stack = [...specifiers];
+        while (!fieldMapper && stack.length > 0) {
+          const next = stack.pop();
+          fieldMapper = schemaMapper[next];
+        }
+        return fieldMapper !== null && fieldMapper !== void 0
+          ? fieldMapper
+          : null;
+      }
+      function getArgumentMapper(schemaMapper) {
+        const argumentMapper = schemaMapper[MapperKind.ARGUMENT];
+        return argumentMapper != null ? argumentMapper : null;
+      }
+      function getDirectiveMapper(schemaMapper) {
+        const directiveMapper = schemaMapper[MapperKind.DIRECTIVE];
+        return directiveMapper != null ? directiveMapper : null;
+      }
+      function getEnumValueMapper(schemaMapper) {
+        const enumValueMapper = schemaMapper[MapperKind.ENUM_VALUE];
+        return enumValueMapper != null ? enumValueMapper : null;
+      }
+      function correctASTNodes(type2) {
+        if (isObjectType(type2)) {
+          const config2 = type2.toConfig();
+          if (config2.astNode != null) {
+            const fields = [];
+            for (const fieldName in config2.fields) {
+              const fieldConfig = config2.fields[fieldName];
+              if (fieldConfig.astNode != null) {
+                fields.push(fieldConfig.astNode);
+              }
+            }
+            config2.astNode = __spreadProps(
+              __spreadValues({}, config2.astNode),
+              {
+                kind: Kind.OBJECT_TYPE_DEFINITION,
+                fields,
+              }
+            );
+          }
+          if (config2.extensionASTNodes != null) {
+            config2.extensionASTNodes = config2.extensionASTNodes.map((node) =>
+              __spreadProps(__spreadValues({}, node), {
+                kind: Kind.OBJECT_TYPE_EXTENSION,
+                fields: void 0,
+              })
+            );
+          }
+          return new GraphQLObjectType(config2);
+        } else if (isInterfaceType(type2)) {
+          const config2 = type2.toConfig();
+          if (config2.astNode != null) {
+            const fields = [];
+            for (const fieldName in config2.fields) {
+              const fieldConfig = config2.fields[fieldName];
+              if (fieldConfig.astNode != null) {
+                fields.push(fieldConfig.astNode);
+              }
+            }
+            config2.astNode = __spreadProps(
+              __spreadValues({}, config2.astNode),
+              {
+                kind: Kind.INTERFACE_TYPE_DEFINITION,
+                fields,
+              }
+            );
+          }
+          if (config2.extensionASTNodes != null) {
+            config2.extensionASTNodes = config2.extensionASTNodes.map((node) =>
+              __spreadProps(__spreadValues({}, node), {
+                kind: Kind.INTERFACE_TYPE_EXTENSION,
+                fields: void 0,
+              })
+            );
+          }
+          return new GraphQLInterfaceType(config2);
+        } else if (isInputObjectType(type2)) {
+          const config2 = type2.toConfig();
+          if (config2.astNode != null) {
+            const fields = [];
+            for (const fieldName in config2.fields) {
+              const fieldConfig = config2.fields[fieldName];
+              if (fieldConfig.astNode != null) {
+                fields.push(fieldConfig.astNode);
+              }
+            }
+            config2.astNode = __spreadProps(
+              __spreadValues({}, config2.astNode),
+              {
+                kind: Kind.INPUT_OBJECT_TYPE_DEFINITION,
+                fields,
+              }
+            );
+          }
+          if (config2.extensionASTNodes != null) {
+            config2.extensionASTNodes = config2.extensionASTNodes.map((node) =>
+              __spreadProps(__spreadValues({}, node), {
+                kind: Kind.INPUT_OBJECT_TYPE_EXTENSION,
+                fields: void 0,
+              })
+            );
+          }
+          return new GraphQLInputObjectType(config2);
+        } else if (isEnumType(type2)) {
+          const config2 = type2.toConfig();
+          if (config2.astNode != null) {
+            const values = [];
+            for (const enumKey in config2.values) {
+              const enumValueConfig = config2.values[enumKey];
+              if (enumValueConfig.astNode != null) {
+                values.push(enumValueConfig.astNode);
+              }
+            }
+            config2.astNode = __spreadProps(
+              __spreadValues({}, config2.astNode),
+              {
+                values,
+              }
+            );
+          }
+          if (config2.extensionASTNodes != null) {
+            config2.extensionASTNodes = config2.extensionASTNodes.map((node) =>
+              __spreadProps(__spreadValues({}, node), {
+                values: void 0,
+              })
+            );
+          }
+          return new GraphQLEnumType(config2);
+        } else {
+          return type2;
+        }
+      }
+      function getResponseKeyFromInfo(info2) {
+        return info2.fieldNodes[0].alias != null
+          ? info2.fieldNodes[0].alias.value
+          : info2.fieldName;
+      }
+      function mapAsyncIterator(iterator, callback, rejectCallback) {
+        let $return;
+        let abruptClose;
+        if (typeof iterator.return === "function") {
+          $return = iterator.return;
+          abruptClose = (error2) => {
+            const rethrow = () => Promise.reject(error2);
+            return $return.call(iterator).then(rethrow, rethrow);
+          };
+        }
+        function mapResult(result2) {
+          return result2.done
+            ? result2
+            : asyncMapValue(result2.value, callback).then(
+                iteratorResult,
+                abruptClose
+              );
+        }
+        let mapReject;
+        if (rejectCallback) {
+          const reject2 = rejectCallback;
+          mapReject = (error2) =>
+            asyncMapValue(error2, reject2).then(iteratorResult, abruptClose);
+        }
+        return {
+          next() {
+            return iterator.next().then(mapResult, mapReject);
+          },
+          return() {
+            return $return
+              ? $return.call(iterator).then(mapResult, mapReject)
+              : Promise.resolve({ value: void 0, done: true });
+          },
+          throw(error2) {
+            if (typeof iterator.throw === "function") {
+              return iterator.throw(error2).then(mapResult, mapReject);
+            }
+            return Promise.reject(error2).catch(abruptClose);
+          },
+          [Symbol.asyncIterator]() {
+            return this;
+          },
+        };
+      }
+      function asyncMapValue(value, callback) {
+        return new Promise((resolve) => resolve(callback(value)));
+      }
+      function iteratorResult(value) {
+        return { value, done: false };
+      }
+      function updateArgument(
+        argumentNodes,
+        variableDefinitionsMap,
+        variableValues,
+        argName,
+        varName,
+        type2,
+        value
+      ) {
+        argumentNodes[argName] = {
+          kind: Kind.ARGUMENT,
+          name: {
+            kind: Kind.NAME,
+            value: argName,
+          },
+          value: {
+            kind: Kind.VARIABLE,
+            name: {
+              kind: Kind.NAME,
+              value: varName,
+            },
+          },
+        };
+        variableDefinitionsMap[varName] = {
+          kind: Kind.VARIABLE_DEFINITION,
+          variable: {
+            kind: Kind.VARIABLE,
+            name: {
+              kind: Kind.NAME,
+              value: varName,
+            },
+          },
+          type: astFromType(type2),
+        };
+        if (value !== void 0) {
+          variableValues[varName] = value;
+          return;
+        }
+        if (varName in variableValues) {
+          delete variableValues[varName];
+        }
+      }
+      function createVariableNameGenerator(variableDefinitionMap) {
+        let varCounter = 0;
+        return (argName) => {
+          let varName;
+          do {
+            varName = `_v${(varCounter++).toString()}_${argName}`;
+          } while (varName in variableDefinitionMap);
+          return varName;
+        };
+      }
+      function implementsAbstractType(schema, typeA, typeB) {
+        if (typeB == null || typeA == null) {
+          return false;
+        } else if (typeA === typeB) {
+          return true;
+        } else if (isCompositeType(typeA) && isCompositeType(typeB)) {
+          return doTypesOverlap(schema, typeA, typeB);
+        }
+        return false;
+      }
+      function relocatedError(originalError, path) {
+        return new GraphQLError(
+          originalError.message,
+          originalError.nodes,
+          originalError.source,
+          originalError.positions,
+          path === null ? void 0 : path === void 0 ? originalError.path : path,
+          originalError.originalError,
+          originalError.extensions
+        );
+      }
+      function observableToAsyncIterable(observable) {
+        const pullQueue = [];
+        const pushQueue = [];
+        let listening = true;
+        const pushValue = (value) => {
+          if (pullQueue.length !== 0) {
+            pullQueue.shift()({ value, done: false });
+          } else {
+            pushQueue.push({ value, done: false });
+          }
+        };
+        const pushError = (error2) => {
+          if (pullQueue.length !== 0) {
+            pullQueue.shift()({ value: { errors: [error2] }, done: false });
+          } else {
+            pushQueue.push({ value: { errors: [error2] }, done: false });
+          }
+        };
+        const pushDone = () => {
+          if (pullQueue.length !== 0) {
+            pullQueue.shift()({ done: true });
+          } else {
+            pushQueue.push({ done: true });
+          }
+        };
+        const pullValue = () =>
+          new Promise((resolve) => {
+            if (pushQueue.length !== 0) {
+              const element = pushQueue.shift();
+              resolve(element);
+            } else {
+              pullQueue.push(resolve);
+            }
+          });
+        const subscription = observable.subscribe({
+          next(value) {
+            pushValue(value);
+          },
+          error(err) {
+            pushError(err);
+          },
+          complete() {
+            pushDone();
+          },
+        });
+        const emptyQueue = () => {
+          if (listening) {
+            listening = false;
+            subscription.unsubscribe();
+            for (const resolve of pullQueue) {
+              resolve({ value: void 0, done: true });
+            }
+            pullQueue.length = 0;
+            pushQueue.length = 0;
+          }
+        };
+        return {
+          next() {
+            return listening ? pullValue() : this.return();
+          },
+          return() {
+            emptyQueue();
+            return Promise.resolve({ value: void 0, done: true });
+          },
+          throw(error2) {
+            emptyQueue();
+            return Promise.reject(error2);
+          },
+          [Symbol.asyncIterator]() {
+            return this;
+          },
+        };
+      }
+      function getOperationASTFromDocument(documentNode, operationName) {
+        const doc = getOperationAST(documentNode, operationName);
+        if (!doc) {
+          throw new Error(`Cannot infer operation ${operationName || ""}`);
+        }
+        return doc;
+      }
+      const getOperationASTFromRequest = memoize1$1(
+        function getOperationASTFromRequest2(request) {
+          return getOperationASTFromDocument(
+            request.document,
+            request.operationName
+          );
+        }
+      );
+      function collectFields(
+        schema,
+        fragments,
+        variableValues,
+        runtimeType,
+        selectionSet,
+        fields,
+        visitedFragmentNames
+      ) {
+        for (const selection of selectionSet.selections) {
+          switch (selection.kind) {
+            case Kind.FIELD: {
+              if (!shouldIncludeNode(variableValues, selection)) {
+                continue;
+              }
+              const name2 = getFieldEntryKey(selection);
+              const fieldList = fields.get(name2);
+              if (fieldList !== void 0) {
+                fieldList.push(selection);
+              } else {
+                fields.set(name2, [selection]);
+              }
+              break;
+            }
+            case Kind.INLINE_FRAGMENT: {
+              if (
+                !shouldIncludeNode(variableValues, selection) ||
+                !doesFragmentConditionMatch(schema, selection, runtimeType)
+              ) {
+                continue;
+              }
+              collectFields(
+                schema,
+                fragments,
+                variableValues,
+                runtimeType,
+                selection.selectionSet,
+                fields,
+                visitedFragmentNames
+              );
+              break;
+            }
+            case Kind.FRAGMENT_SPREAD: {
+              const fragName = selection.name.value;
+              if (
+                visitedFragmentNames.has(fragName) ||
+                !shouldIncludeNode(variableValues, selection)
+              ) {
+                continue;
+              }
+              visitedFragmentNames.add(fragName);
+              const fragment = fragments[fragName];
+              if (
+                !fragment ||
+                !doesFragmentConditionMatch(schema, fragment, runtimeType)
+              ) {
+                continue;
+              }
+              collectFields(
+                schema,
+                fragments,
+                variableValues,
+                runtimeType,
+                fragment.selectionSet,
+                fields,
+                visitedFragmentNames
+              );
+              break;
+            }
+          }
+        }
+        return fields;
+      }
+      function shouldIncludeNode(variableValues, node) {
+        const skip2 = getDirectiveValues$1(
+          GraphQLSkipDirective,
+          node,
+          variableValues
+        );
+        if (
+          (skip2 === null || skip2 === void 0 ? void 0 : skip2["if"]) === true
+        ) {
+          return false;
+        }
+        const include = getDirectiveValues$1(
+          GraphQLIncludeDirective,
+          node,
+          variableValues
+        );
+        if (
+          (include === null || include === void 0 ? void 0 : include["if"]) ===
+          false
+        ) {
+          return false;
+        }
+        return true;
+      }
+      function doesFragmentConditionMatch(schema, fragment, type2) {
+        const typeConditionNode = fragment.typeCondition;
+        if (!typeConditionNode) {
+          return true;
+        }
+        const conditionalType = typeFromAST(schema, typeConditionNode);
+        if (conditionalType === type2) {
+          return true;
+        }
+        if (isAbstractType(conditionalType)) {
+          const possibleTypes = schema.getPossibleTypes(conditionalType);
+          return possibleTypes.includes(type2);
+        }
+        return false;
+      }
+      function getFieldEntryKey(node) {
+        return node.alias ? node.alias.value : node.name.value;
+      }
+      function isAsyncIterable$1(value) {
+        return (
+          typeof value === "object" &&
+          value != null &&
+          Symbol.asyncIterator in value &&
+          typeof value[Symbol.asyncIterator] === "function"
+        );
+      }
+      async function defaultAsyncIteratorReturn(value) {
+        return { value, done: true };
+      }
+      const proxyMethodFactory = memoize2$1(function proxyMethodFactory2(
+        target2,
+        targetMethod
+      ) {
+        return function proxyMethod(...args) {
+          return Reflect.apply(targetMethod, target2, args);
+        };
+      });
+      function getAsyncIteratorWithCancel(asyncIterator, onCancel) {
+        return new Proxy(asyncIterator, {
+          has(asyncIterator2, prop2) {
+            if (prop2 === "return") {
+              return true;
+            }
+            return Reflect.has(asyncIterator2, prop2);
+          },
+          get(asyncIterator2, prop2, receiver) {
+            const existingPropValue = Reflect.get(
+              asyncIterator2,
+              prop2,
+              receiver
+            );
+            if (prop2 === "return") {
+              const existingReturn =
+                existingPropValue || defaultAsyncIteratorReturn;
+              return async function returnWithCancel(value) {
+                const returnValue = await onCancel(value);
+                return Reflect.apply(existingReturn, asyncIterator2, [
+                  returnValue,
+                ]);
+              };
+            } else if (typeof existingPropValue === "function") {
+              return proxyMethodFactory(asyncIterator2, existingPropValue);
+            }
+            return existingPropValue;
+          },
+        });
+      }
+      function getAsyncIterableWithCancel(asyncIterable, onCancel) {
+        return new Proxy(asyncIterable, {
+          get(asyncIterable2, prop2, receiver) {
+            const existingPropValue = Reflect.get(
+              asyncIterable2,
+              prop2,
+              receiver
+            );
+            if (Symbol.asyncIterator === prop2) {
+              return function asyncIteratorFactory() {
+                const asyncIterator = Reflect.apply(
+                  existingPropValue,
+                  asyncIterable2,
+                  []
+                );
+                return getAsyncIteratorWithCancel(asyncIterator, onCancel);
+              };
+            } else if (typeof existingPropValue === "function") {
+              return proxyMethodFactory(asyncIterable2, existingPropValue);
+            }
+            return existingPropValue;
+          },
+        });
+      }
+      const GraphQLDeferDirective = new GraphQLDirective({
+        name: "defer",
+        description:
+          "Directs the executor to defer this fragment when the `if` argument is true or undefined.",
+        locations: [
+          DirectiveLocation.FRAGMENT_SPREAD,
+          DirectiveLocation.INLINE_FRAGMENT,
+        ],
+        args: {
+          if: {
+            type: GraphQLBoolean,
+            description: "Deferred when true or undefined.",
+          },
+          label: {
+            type: GraphQLString,
+            description: "Unique name",
+          },
+        },
+      });
+      const GraphQLStreamDirective = new GraphQLDirective({
+        name: "stream",
+        description:
+          "Directs the executor to stream plural fields when the `if` argument is true or undefined.",
+        locations: [DirectiveLocation.FIELD],
+        args: {
+          if: {
+            type: GraphQLBoolean,
+            description: "Stream when true or undefined.",
+          },
+          label: {
+            type: GraphQLString,
+            description: "Unique name",
+          },
+          initialCount: {
+            defaultValue: 0,
+            type: GraphQLInt,
+            description: "Number of items to return immediately",
+          },
+          maxChunkSize: {
+            defaultValue: 1,
+            type: GraphQLInt,
+            description:
+              "Maximum number of items to return within each payload",
+          },
+          maxInterval: {
+            type: GraphQLInt,
+            description:
+              "Maximum time in ms to wait to collect items for each payload, will wait indefinitely if undefined",
+          },
+          inParallel: {
+            defaultValue: false,
+            type: GraphQLBoolean,
+            description: "Stream items non-sequentially on completion if true",
+          },
+        },
+      });
+      const MAX_ARRAY_LENGTH = 10;
+      const MAX_RECURSIVE_DEPTH = 2;
+      function inspect(value) {
+        return formatValue(value, []);
+      }
+      function formatValue(value, seenValues) {
+        switch (typeof value) {
+          case "string":
+            return JSON.stringify(value);
+          case "function":
+            return value.name ? `[function ${value.name}]` : "[function]";
+          case "object":
+            return formatObjectValue(value, seenValues);
+          default:
+            return String(value);
+        }
+      }
+      function formatObjectValue(value, previouslySeenValues) {
+        if (value === null) {
+          return "null";
+        }
+        if (previouslySeenValues.includes(value)) {
+          return "[Circular]";
+        }
+        const seenValues = [...previouslySeenValues, value];
+        if (isJSONable(value)) {
+          const jsonValue = value.toJSON();
+          if (jsonValue !== value) {
+            return typeof jsonValue === "string"
+              ? jsonValue
+              : formatValue(jsonValue, seenValues);
+          }
+        } else if (Array.isArray(value)) {
+          return formatArray(value, seenValues);
+        }
+        return formatObject(value, seenValues);
+      }
+      function isJSONable(value) {
+        return typeof value.toJSON === "function";
+      }
+      function formatObject(object, seenValues) {
+        const entries = Object.entries(object);
+        if (entries.length === 0) {
+          return "{}";
+        }
+        if (seenValues.length > MAX_RECURSIVE_DEPTH) {
+          return "[" + getObjectTag(object) + "]";
+        }
+        const properties = entries.map(
+          ([key, value]) => key + ": " + formatValue(value, seenValues)
+        );
+        return "{ " + properties.join(", ") + " }";
+      }
+      function formatArray(array, seenValues) {
+        if (array.length === 0) {
+          return "[]";
+        }
+        if (seenValues.length > MAX_RECURSIVE_DEPTH) {
+          return "[Array]";
+        }
+        const len = Math.min(MAX_ARRAY_LENGTH, array.length);
+        const remaining = array.length - len;
+        const items = [];
+        for (let i = 0; i < len; ++i) {
+          items.push(formatValue(array[i], seenValues));
+        }
+        if (remaining === 1) {
+          items.push("... 1 more item");
+        } else if (remaining > 1) {
+          items.push(`... ${remaining} more items`);
+        }
+        return "[" + items.join(", ") + "]";
+      }
+      function getObjectTag(object) {
+        const tag = Object.prototype.toString
+          .call(object)
+          .replace(/^\[object /, "")
+          .replace(/]$/, "");
+        if (tag === "Object" && typeof object.constructor === "function") {
+          const name2 = object.constructor.name;
+          if (typeof name2 === "string" && name2 !== "") {
+            return name2;
+          }
+        }
+        return tag;
+      }
+      function invariant(condition, message) {
+        const booleanCondition = Boolean(condition);
+        if (!booleanCondition) {
+          throw new Error(
+            message != null ? message : "Unexpected invariant triggered."
+          );
+        }
+      }
+      function memoize1(fn) {
+        let cache0;
+        return function memoized(a1) {
+          if (cache0 === void 0) {
+            cache0 = /* @__PURE__ */ new WeakMap();
+          }
+          let fnResult = cache0.get(a1);
+          if (fnResult === void 0) {
+            fnResult = fn(a1);
+            cache0.set(a1, fnResult);
+          }
+          return fnResult;
+        };
+      }
+      const __Schema = new GraphQLObjectType({
+        name: "__Schema",
+        description:
+          "A GraphQL Schema defines the capabilities of a GraphQL server. It exposes all available types and directives on the server, as well as the entry points for query, mutation, and subscription operations.",
+        fields: () => ({
+          description: {
+            type: GraphQLString,
+            resolve: (executorSchema) => executorSchema.description,
+          },
+          types: {
+            description: "A list of all types supported by this server.",
+            type: new GraphQLNonNull(
+              new GraphQLList(new GraphQLNonNull(__Type))
+            ),
+            resolve: (executorSchema) => executorSchema.getNamedTypes(),
+          },
+          queryType: {
+            description: "The type that query operations will be rooted at.",
+            type: new GraphQLNonNull(__Type),
+            resolve: (executorSchema) => executorSchema.getRootType("query"),
+          },
+          mutationType: {
+            description:
+              "If this server supports mutation, the type that mutation operations will be rooted at.",
+            type: __Type,
+            resolve: (executorSchema) => executorSchema.getRootType("mutation"),
+          },
+          subscriptionType: {
+            description:
+              "If this server support subscription, the type that subscription operations will be rooted at.",
+            type: __Type,
+            resolve: (executorSchema) =>
+              executorSchema.getRootType("subscription"),
+          },
+          directives: {
+            description: "A list of all directives supported by this server.",
+            type: new GraphQLNonNull(
+              new GraphQLList(new GraphQLNonNull(__Directive))
+            ),
+            resolve: (executorSchema) => executorSchema.getDirectives(),
+          },
+        }),
+      });
+      const __Directive = new GraphQLObjectType({
+        name: "__Directive",
+        description:
+          "A Directive provides a way to describe alternate runtime execution and type validation behavior in a GraphQL document.\n\nIn some cases, you need to provide options to alter GraphQL's execution behavior in ways field arguments will not suffice, such as conditionally including or skipping a field. Directives provide this by describing additional information to the executor.",
+        fields: () => ({
+          name: {
+            type: new GraphQLNonNull(GraphQLString),
+            resolve: (directive) => directive.name,
+          },
+          description: {
+            type: GraphQLString,
+            resolve: (directive) => directive.description,
+          },
+          isRepeatable: {
+            type: new GraphQLNonNull(GraphQLBoolean),
+            resolve: (directive) => directive.isRepeatable,
+          },
+          locations: {
+            type: new GraphQLNonNull(
+              new GraphQLList(new GraphQLNonNull(__DirectiveLocation))
+            ),
+            resolve: (directive) => directive.locations,
+          },
+          args: {
+            type: new GraphQLNonNull(
+              new GraphQLList(new GraphQLNonNull(__InputValue))
+            ),
+            args: {
+              includeDeprecated: {
+                type: GraphQLBoolean,
+                defaultValue: false,
+              },
+            },
+            resolve(field, { includeDeprecated }) {
+              return includeDeprecated
+                ? field.args
+                : field.args.filter((arg) => arg.deprecationReason == null);
+            },
+          },
+        }),
+      });
+      const __Type = new GraphQLObjectType({
+        name: "__Type",
+        description:
+          "The fundamental unit of any GraphQL Schema is the type. There are many kinds of types in GraphQL as represented by the `__TypeKind` enum.\n\nDepending on the kind of a type, certain fields describe information about that type. Scalar types provide no information beyond a name, description and optional `specifiedByURL`, while Enum types provide their values. Object and Interface types provide the fields they describe. Abstract types, Union and Interface, provide the Object types possible at runtime. List and NonNull types compose other types.",
+        fields: () => ({
+          kind: {
+            type: new GraphQLNonNull(__TypeKind),
+            resolve(type2, _args, _context, { executorSchema }) {
+              if (executorSchema.isScalarType(type2)) {
+                return TypeKind.SCALAR;
+              }
+              if (executorSchema.isObjectType(type2)) {
+                return TypeKind.OBJECT;
+              }
+              if (executorSchema.isInterfaceType(type2)) {
+                return TypeKind.INTERFACE;
+              }
+              if (executorSchema.isUnionType(type2)) {
+                return TypeKind.UNION;
+              }
+              if (executorSchema.isEnumType(type2)) {
+                return TypeKind.ENUM;
+              }
+              if (executorSchema.isInputObjectType(type2)) {
+                return TypeKind.INPUT_OBJECT;
+              }
+              if (executorSchema.isListType(type2)) {
+                return TypeKind.LIST;
+              }
+              if (executorSchema.isNonNullType(type2)) {
+                return TypeKind.NON_NULL;
+              }
+              invariant(false, `Unexpected type: "${inspect(type2)}".`);
+            },
+          },
+          name: {
+            type: GraphQLString,
+            resolve: (type2) => ("name" in type2 ? type2.name : void 0),
+          },
+          description: {
+            type: GraphQLString,
+            resolve: (type2) =>
+              "description" in type2 ? type2.description : void 0,
+          },
+          specifiedByURL: {
+            type: GraphQLString,
+            resolve: (obj) =>
+              "specifiedByURL" in obj ? obj.specifiedByURL : void 0,
+          },
+          fields: {
+            type: new GraphQLList(new GraphQLNonNull(__Field)),
+            args: {
+              includeDeprecated: {
+                type: GraphQLBoolean,
+                defaultValue: false,
+              },
+            },
+            resolve(
+              type2,
+              { includeDeprecated },
+              _context,
+              { executorSchema }
+            ) {
+              if (
+                executorSchema.isObjectType(type2) ||
+                executorSchema.isInterfaceType(type2)
+              ) {
+                const fields = Object.values(type2.getFields());
+                return includeDeprecated
+                  ? fields
+                  : fields.filter((field) => field.deprecationReason == null);
+              }
+            },
+          },
+          interfaces: {
+            type: new GraphQLList(new GraphQLNonNull(__Type)),
+            resolve(type2) {
+              if ("getInterfaces" in type2) {
+                return type2.getInterfaces();
+              }
+            },
+          },
+          possibleTypes: {
+            type: new GraphQLList(new GraphQLNonNull(__Type)),
+            resolve(type2, _args, _context, { executorSchema }) {
+              if (executorSchema.isAbstractType(type2)) {
+                return executorSchema.getPossibleTypes(type2);
+              }
+            },
+          },
+          enumValues: {
+            type: new GraphQLList(new GraphQLNonNull(__EnumValue)),
+            args: {
+              includeDeprecated: {
+                type: GraphQLBoolean,
+                defaultValue: false,
+              },
+            },
+            resolve(
+              type2,
+              { includeDeprecated },
+              _context,
+              { executorSchema }
+            ) {
+              if (executorSchema.isEnumType(type2)) {
+                const values = type2.getValues();
+                return includeDeprecated
+                  ? values
+                  : values.filter((field) => field.deprecationReason == null);
+              }
+            },
+          },
+          inputFields: {
+            type: new GraphQLList(new GraphQLNonNull(__InputValue)),
+            args: {
+              includeDeprecated: {
+                type: GraphQLBoolean,
+                defaultValue: false,
+              },
+            },
+            resolve(
+              type2,
+              { includeDeprecated },
+              _context,
+              { executorSchema }
+            ) {
+              if (executorSchema.isInputObjectType(type2)) {
+                const values = Object.values(type2.getFields());
+                return includeDeprecated
+                  ? values
+                  : values.filter((field) => field.deprecationReason == null);
+              }
+            },
+          },
+          ofType: {
+            type: __Type,
+            resolve: (type2) => ("ofType" in type2 ? type2.ofType : void 0),
+          },
+        }),
+      });
+      const __Field = new GraphQLObjectType({
+        name: "__Field",
+        description:
+          "Object and Interface types are described by a list of Fields, each of which has a name, potentially a list of arguments, and a return type.",
+        fields: () => ({
+          name: {
+            type: new GraphQLNonNull(GraphQLString),
+            resolve: (field) => field.name,
+          },
+          description: {
+            type: GraphQLString,
+            resolve: (field) => field.description,
+          },
+          args: {
+            type: new GraphQLNonNull(
+              new GraphQLList(new GraphQLNonNull(__InputValue))
+            ),
+            args: {
+              includeDeprecated: {
+                type: GraphQLBoolean,
+                defaultValue: false,
+              },
+            },
+            resolve(field, { includeDeprecated }) {
+              return includeDeprecated
+                ? field.args
+                : field.args.filter((arg) => arg.deprecationReason == null);
+            },
+          },
+          type: {
+            type: new GraphQLNonNull(__Type),
+            resolve: (field) => field.type,
+          },
+          isDeprecated: {
+            type: new GraphQLNonNull(GraphQLBoolean),
+            resolve: (field) => field.deprecationReason != null,
+          },
+          deprecationReason: {
+            type: GraphQLString,
+            resolve: (field) => field.deprecationReason,
+          },
+        }),
+      });
+      const __InputValue = new GraphQLObjectType({
+        name: "__InputValue",
+        description:
+          "Arguments provided to Fields or Directives and the input fields of an InputObject are represented as Input Values which describe their type and optionally a default value.",
+        fields: () => ({
+          name: {
+            type: new GraphQLNonNull(GraphQLString),
+            resolve: (inputValue) => inputValue.name,
+          },
+          description: {
+            type: GraphQLString,
+            resolve: (inputValue) => inputValue.description,
+          },
+          type: {
+            type: new GraphQLNonNull(__Type),
+            resolve: (inputValue) => inputValue.type,
+          },
+          defaultValue: {
+            type: GraphQLString,
+            description:
+              "A GraphQL-formatted string representing the default value for this input value.",
+            resolve(inputValue) {
+              const { type: type2, defaultValue: defaultValue2 } = inputValue;
+              const valueAST = astFromValue(defaultValue2, type2);
+              return valueAST ? print(valueAST) : null;
+            },
+          },
+          isDeprecated: {
+            type: new GraphQLNonNull(GraphQLBoolean),
+            resolve: (field) => field.deprecationReason != null,
+          },
+          deprecationReason: {
+            type: GraphQLString,
+            resolve: (obj) => obj.deprecationReason,
+          },
+        }),
+      });
+      const SchemaMetaFieldDef = {
+        name: "__schema",
+        type: new GraphQLNonNull(__Schema),
+        description: "Access the current type schema of this server.",
+        args: [],
+        resolve: (_source, _args, _context, { executorSchema }) =>
+          executorSchema,
+        isDeprecated: false,
+        deprecationReason: void 0,
+        extensions: /* @__PURE__ */ Object.create(null),
+        astNode: void 0,
+      };
+      const nameArgument = {
+        name: "name",
+        description: void 0,
+        type: new GraphQLNonNull(GraphQLString),
+        defaultValue: void 0,
+        deprecationReason: void 0,
+        extensions: /* @__PURE__ */ Object.create(null),
+        astNode: void 0,
+      };
+      const TypeMetaFieldDef = {
+        name: "__type",
+        type: __Type,
+        description: "Request the type information of a single type.",
+        args: [nameArgument],
+        resolve: (_source, { name: name2 }, _context, { executorSchema }) =>
+          executorSchema.getNamedType(name2),
+        isDeprecated: false,
+        deprecationReason: void 0,
+        extensions: /* @__PURE__ */ Object.create(null),
+        astNode: void 0,
+      };
+      const DirectiveMetaFieldDef = {
+        name: "__directive",
+        type: __Directive,
+        description: "Request the directive information of a single directive.",
+        args: [nameArgument],
+        resolve: (_source, { name: name2 }, _context, { executorSchema }) =>
+          executorSchema.getDirective(name2),
+        isDeprecated: false,
+        deprecationReason: void 0,
+        extensions: /* @__PURE__ */ Object.create(null),
+        astNode: void 0,
+      };
+      const introspectionTypes = Object.freeze([
+        __Schema,
+        __Directive,
+        __DirectiveLocation,
+        __Type,
+        __Field,
+        __InputValue,
+        __EnumValue,
+        __TypeKind,
+      ]);
+      function getInputTypeInfo(isListType2, isNonNullType2, type2, wrapper) {
+        if (!isListType2(type2) && !isNonNullType2(type2)) {
+          return {
+            nonNullListWrappers: [],
+            nonNull: isNonNullType2(wrapper),
+            namedType: type2,
+          };
+        }
+        const inputTypeInfo = getInputTypeInfo(
+          isListType2,
+          isNonNullType2,
+          type2.ofType,
+          type2
+        );
+        if (isNonNullType2(type2)) {
+          return inputTypeInfo;
+        }
+        inputTypeInfo.nonNullListWrappers.push(isNonNullType2(wrapper));
+        return inputTypeInfo;
+      }
+      function getPossibleSequences(nonNullListWrappers) {
+        if (!nonNullListWrappers.length) {
+          return [[]];
+        }
+        const nonNull = nonNullListWrappers.pop();
+        if (nonNull) {
+          return getPossibleSequences(nonNullListWrappers).map((sequence) => [
+            true,
+            ...sequence,
+          ]);
+        }
+        return [
+          ...getPossibleSequences(nonNullListWrappers).map((sequence) => [
+            true,
+            ...sequence,
+          ]),
+          ...getPossibleSequences(nonNullListWrappers).map((sequence) => [
+            false,
+            ...sequence,
+          ]),
+        ];
+      }
+      function inputTypesFromSequences(sequences, inputType) {
+        return sequences.map((sequence) =>
+          sequence.reduce((acc, nonNull) => {
+            let wrapped = new GraphQLList(acc);
+            if (nonNull) {
+              wrapped = new GraphQLNonNull(wrapped);
+            }
+            return wrapped;
+          }, inputType)
+        );
+      }
+      function getPossibleInputTypes(isListType2, isNonNullType2, type2) {
+        const nullableOuterType = isNonNullType2(type2) ? type2.ofType : type2;
+        const { nonNullListWrappers, nonNull, namedType } = getInputTypeInfo(
+          isListType2,
+          isNonNullType2,
+          nullableOuterType
+        );
+        const sequences = getPossibleSequences(nonNullListWrappers);
+        const wrapped = new GraphQLNonNull(namedType);
+        if (nonNull) {
+          return inputTypesFromSequences(sequences, wrapped);
+        }
+        return [
+          ...inputTypesFromSequences(sequences, namedType),
+          ...inputTypesFromSequences(sequences, wrapped),
+        ];
+      }
+      class TypeTree {
+        constructor(isListType2, isNonNullType2) {
+          this._isListType = isListType2;
+          this._isNonNullType = isNonNullType2;
+          this._rootNode = {
+            [Kind.NAMED_TYPE]: /* @__PURE__ */ new Map(),
+          };
+          this._typeStrings = /* @__PURE__ */ new Set();
+        }
+        add(type2) {
+          this._add(type2, this._rootNode);
+          this._typeStrings.add(type2.toString());
+        }
+        get(typeNode) {
+          return this._get(typeNode, this._rootNode);
+        }
+        has(typeString) {
+          return this._typeStrings.has(typeString);
+        }
+        _get(typeNode, node) {
+          switch (typeNode.kind) {
+            case Kind.LIST_TYPE: {
+              const listNode = node[Kind.LIST_TYPE];
+              if (!listNode) {
+                return;
+              }
+              return this._get(typeNode.type, listNode);
+            }
+            case Kind.NON_NULL_TYPE: {
+              const nonNullNode = node[Kind.NON_NULL_TYPE];
+              if (!nonNullNode) {
+                return;
+              }
+              return this._get(typeNode.type, nonNullNode);
+            }
+            case Kind.NAMED_TYPE:
+              return node[Kind.NAMED_TYPE].get(typeNode.name.value);
+          }
+        }
+        _add(originalType, node, type2 = originalType) {
+          if (this._isListType(type2)) {
+            let listTypeNode = node[Kind.LIST_TYPE];
+            if (!listTypeNode) {
+              listTypeNode = node[Kind.LIST_TYPE] = {
+                [Kind.NAMED_TYPE]: /* @__PURE__ */ new Map(),
+              };
+            }
+            this._add(originalType, listTypeNode, type2.ofType);
+          } else if (this._isNonNullType(type2)) {
+            let nonNullTypeNode = node[Kind.NON_NULL_TYPE];
+            if (!nonNullTypeNode) {
+              nonNullTypeNode = node[Kind.NON_NULL_TYPE] = {
+                [Kind.NAMED_TYPE]: /* @__PURE__ */ new Map(),
+              };
+            }
+            this._add(originalType, nonNullTypeNode, type2.ofType);
+          } else {
+            node[Kind.NAMED_TYPE].set(type2.name, originalType);
+          }
+        }
+      }
+      function is(x2, type2) {
+        if (Object.prototype.toString.call(x2) === `[object ${type2}]`) {
+          return true;
+        }
+        const prototype = Object.getPrototypeOf(x2);
+        if (prototype == null) {
+          return false;
+        }
+        return is(prototype, type2);
+      }
+      function _isScalarType(type2) {
+        return is(type2, "GraphQLScalarType");
+      }
+      function _isObjectType(type2) {
+        return is(type2, "GraphQLObjectType");
+      }
+      function _isInterfaceType(type2) {
+        return is(type2, "GraphQLInterfaceType");
+      }
+      function _isUnionType(type2) {
+        return is(type2, "GraphQLUnionType");
+      }
+      function _isEnumType(type2) {
+        return is(type2, "GraphQLEnumType");
+      }
+      function _isInputObjectType(type2) {
+        return is(type2, "GraphQLInputObjectType");
+      }
+      function _isListType(type2) {
+        return Object.prototype.toString.call(type2) === "[object GraphQLList]";
+      }
+      function _isNonNullType(type2) {
+        return (
+          Object.prototype.toString.call(type2) === "[object GraphQLNonNull]"
+        );
+      }
+      function _toExecutorSchema(schema) {
+        const listTypes = /* @__PURE__ */ new Set();
+        const nonNullTypes = /* @__PURE__ */ new Set();
+        const namedTypes = /* @__PURE__ */ new Map();
+        const inputTypes = /* @__PURE__ */ new Set();
+        const leafTypes = /* @__PURE__ */ new Set();
+        const scalarTypes = /* @__PURE__ */ new Set();
+        const enumTypes = /* @__PURE__ */ new Set();
+        const abstractTypes = /* @__PURE__ */ new Set();
+        const interfaceTypes = /* @__PURE__ */ new Set();
+        const unionTypes = /* @__PURE__ */ new Set();
+        const objectTypes = /* @__PURE__ */ new Set();
+        const inputObjectTypes = /* @__PURE__ */ new Set();
+        const typeTree = new TypeTree(_isListType, _isNonNullType);
+        const subTypesMap = /* @__PURE__ */ new Map();
+        const possibleTypesMap = /* @__PURE__ */ new Map();
+        function addOutputType(type2) {
+          typeTree.add(type2);
+        }
+        function addInputType(type2) {
+          inputTypes.add(type2);
+          typeTree.add(type2);
+        }
+        function processType(type2) {
+          if (_isListType(type2) && !listTypes.has(type2)) {
+            listTypes.add(type2);
+            processType(type2.ofType);
+          } else if (_isNonNullType(type2) && !nonNullTypes.has(type2)) {
+            nonNullTypes.add(type2);
+            processType(type2.ofType);
+          } else if (_isScalarType(type2) && !namedTypes.get(type2.name)) {
+            namedTypes.set(type2.name, type2);
+            leafTypes.add(type2);
+            scalarTypes.add(type2);
+          } else if (_isObjectType(type2) && !namedTypes.get(type2.name)) {
+            namedTypes.set(type2.name, type2);
+            objectTypes.add(type2);
+            addOutputType(type2);
+            for (const iface of Object.values(type2.getInterfaces())) {
+              processType(iface);
+              let subTypes = subTypesMap.get(iface);
+              if (!subTypes) {
+                subTypes = /* @__PURE__ */ new Set();
+                subTypesMap.set(iface, subTypes);
+              }
+              subTypes.add(type2);
+              let possibleTypes = possibleTypesMap.get(iface);
+              if (!possibleTypes) {
+                possibleTypes = [];
+                possibleTypesMap.set(iface, possibleTypes);
+              }
+              possibleTypes.push(type2);
+            }
+            for (const field of Object.values(type2.getFields())) {
+              processType(field.type);
+              for (const arg of field.args) {
+                addInputType(arg.type);
+                processType(arg.type);
+              }
+            }
+          } else if (_isInterfaceType(type2) && !namedTypes.get(type2.name)) {
+            namedTypes.set(type2.name, type2);
+            abstractTypes.add(type2);
+            interfaceTypes.add(type2);
+            addOutputType(type2);
+            if ("getInterfaces" in type2) {
+              for (const iface of Object.values(type2.getInterfaces())) {
+                processType(iface);
+                let subTypes = subTypesMap.get(iface);
+                if (!subTypes) {
+                  subTypes = /* @__PURE__ */ new Set();
+                  subTypesMap.set(iface, subTypes);
+                }
+                subTypes.add(type2);
+              }
+            }
+            for (const field of Object.values(type2.getFields())) {
+              processType(field.type);
+              for (const arg of field.args) {
+                addInputType(arg.type);
+                processType(arg.type);
+              }
+            }
+          } else if (_isUnionType(type2) && !namedTypes.get(type2.name)) {
+            namedTypes.set(type2.name, type2);
+            abstractTypes.add(type2);
+            unionTypes.add(type2);
+            addOutputType(type2);
+            let subTypes = subTypesMap.get(type2);
+            if (!subTypes) {
+              subTypes = /* @__PURE__ */ new Set();
+              subTypesMap.set(type2, subTypes);
+            }
+            let possibleTypes = possibleTypesMap.get(type2);
+            if (!possibleTypes) {
+              possibleTypes = [];
+              possibleTypesMap.set(type2, possibleTypes);
+            }
+            for (const possibleType of type2.getTypes()) {
+              processType(possibleType);
+              subTypes.add(possibleType);
+              possibleTypes.push(possibleType);
+            }
+          } else if (_isEnumType(type2) && !namedTypes.get(type2.name)) {
+            namedTypes.set(type2.name, type2);
+            leafTypes.add(type2);
+            enumTypes.add(type2);
+          } else if (_isInputObjectType(type2) && !namedTypes.get(type2.name)) {
+            namedTypes.set(type2.name, type2);
+            inputObjectTypes.add(type2);
+            for (const field of Object.values(type2.getFields())) {
+              addInputType(field.type);
+              processType(field.type);
+            }
+          }
+        }
+        for (const type2 of Object.values(schema.getTypeMap())) {
+          if (!type2.name.startsWith("__")) {
+            processType(type2);
+          }
+        }
+        for (const directive of schema.getDirectives()) {
+          for (const arg of directive.args) {
+            addInputType(arg.type);
+            processType(arg.type);
+          }
+        }
+        for (const inputType of inputTypes.values()) {
+          const possibleInputTypes = getPossibleInputTypes(
+            _isListType,
+            _isNonNullType,
+            inputType
+          );
+          for (const possibleInputType of possibleInputTypes) {
+            const typeString = possibleInputType.toString();
+            if (!typeTree.has(typeString)) {
+              addInputType(possibleInputType);
+              processType(possibleInputType);
+            }
+          }
+        }
+        for (const type2 of introspectionTypes) {
+          processType(type2);
+        }
+        for (const fieldDef of [
+          SchemaMetaFieldDef,
+          TypeMetaFieldDef,
+          TypeNameMetaFieldDef,
+        ]) {
+          processType(fieldDef.type);
+          for (const arg of fieldDef.args) {
+            addInputType(arg.type);
+            processType(arg.type);
+          }
+        }
+        const queryType = schema.getQueryType();
+        const mutationType = schema.getMutationType();
+        const subscriptionType = schema.getSubscriptionType();
+        function isListType2(type2) {
+          return listTypes.has(type2);
+        }
+        function isNonNullType2(type2) {
+          return nonNullTypes.has(type2);
+        }
+        function isNamedType2(type2) {
+          return namedTypes.get(type2.name) !== void 0;
+        }
+        function isInputType2(type2) {
+          return inputTypes.has(type2);
+        }
+        function isLeafType2(type2) {
+          return leafTypes.has(type2);
+        }
+        function isScalarType2(type2) {
+          return scalarTypes.has(type2);
+        }
+        function isEnumType2(type2) {
+          return enumTypes.has(type2);
+        }
+        function isAbstractType2(type2) {
+          return abstractTypes.has(type2);
+        }
+        function isInterfaceType2(type2) {
+          return interfaceTypes.has(type2);
+        }
+        function isUnionType2(type2) {
+          return unionTypes.has(type2);
+        }
+        function isObjectType2(type2) {
+          return objectTypes.has(type2);
+        }
+        function isInputObjectType2(type2) {
+          return inputObjectTypes.has(type2);
+        }
+        function getDirectives() {
+          return schema.getDirectives();
+        }
+        function getDirective(directiveName) {
+          var _schema$getDirective;
+          return (_schema$getDirective = schema.getDirective(directiveName)) !==
+            null && _schema$getDirective !== void 0
+            ? _schema$getDirective
+            : void 0;
+        }
+        function getNamedTypes() {
+          return Array.from(namedTypes.values());
+        }
+        function getNamedType2(typeName) {
+          return namedTypes.get(typeName);
+        }
+        function getType(typeNode) {
+          return typeTree.get(typeNode);
+        }
+        function getRootType(operation) {
+          if (operation === "query") {
+            return queryType !== null && queryType !== void 0
+              ? queryType
+              : void 0;
+          } else if (operation === "mutation") {
+            return mutationType !== null && mutationType !== void 0
+              ? mutationType
+              : void 0;
+          } else if (operation === "subscription") {
+            return subscriptionType !== null && subscriptionType !== void 0
+              ? subscriptionType
+              : void 0;
+          }
+          invariant(false, "Unexpected operation type: " + inspect(operation));
+        }
+        function getPossibleTypes(abstractType) {
+          var _possibleTypesMap$get;
+          return (_possibleTypesMap$get =
+            possibleTypesMap.get(abstractType)) !== null &&
+            _possibleTypesMap$get !== void 0
+            ? _possibleTypesMap$get
+            : [];
+        }
+        function isSubType(abstractType, maybeSubType) {
+          var _subTypesMap$get$has, _subTypesMap$get;
+          return (_subTypesMap$get$has =
+            (_subTypesMap$get = subTypesMap.get(abstractType)) === null ||
+            _subTypesMap$get === void 0
+              ? void 0
+              : _subTypesMap$get.has(maybeSubType)) !== null &&
+            _subTypesMap$get$has !== void 0
+            ? _subTypesMap$get$has
+            : false;
+        }
+        return {
+          description: schema.description,
+          isListType: isListType2,
+          isNonNullType: isNonNullType2,
+          isNamedType: isNamedType2,
+          isInputType: isInputType2,
+          isLeafType: isLeafType2,
+          isScalarType: isScalarType2,
+          isEnumType: isEnumType2,
+          isAbstractType: isAbstractType2,
+          isInterfaceType: isInterfaceType2,
+          isUnionType: isUnionType2,
+          isObjectType: isObjectType2,
+          isInputObjectType: isInputObjectType2,
+          getDirectives,
+          getDirective,
+          getNamedTypes,
+          getNamedType: getNamedType2,
+          getType,
+          getRootType,
+          getPossibleTypes,
+          isSubType,
+        };
+      }
+      const toExecutorSchema = memoize1(_toExecutorSchema);
+      function addPath(prev, key, typename) {
+        return {
+          prev,
+          key,
+          typename,
+        };
+      }
+      function pathToArray(path) {
+        const flattened = [];
+        let curr = path;
+        while (curr) {
+          flattened.push(curr.key);
+          curr = curr.prev;
+        }
+        return flattened.reverse();
+      }
+      function memoize1and1(fn) {
+        let cache0;
+        return function memoized(a1, a2) {
+          if (cache0 === void 0) {
+            cache0 = /* @__PURE__ */ new WeakMap();
+          }
+          let cache1 = cache0.get(a1);
+          if (cache1 === void 0) {
+            cache1 = /* @__PURE__ */ new Map();
+            cache0.set(a1, cache1);
+          }
+          let fnResult = cache1.get(a2);
+          if (fnResult === void 0) {
+            fnResult = fn(a1, a2);
+            cache1.set(a2, fnResult);
+          }
+          return fnResult;
+        };
+      }
+      function memoize2(fn) {
+        let cache0;
+        return function memoized(a1, a2) {
+          if (cache0 === void 0) {
+            cache0 = /* @__PURE__ */ new WeakMap();
+          }
+          let cache1 = cache0.get(a1);
+          if (cache1 === void 0) {
+            cache1 = /* @__PURE__ */ new WeakMap();
+            cache0.set(a1, cache1);
+          }
+          let fnResult = cache1.get(a2);
+          if (fnResult === void 0) {
+            fnResult = fn(a1, a2);
+            cache1.set(a2, fnResult);
+          }
+          return fnResult;
+        };
+      }
+      function devAssert(condition, message) {
+        const booleanCondition = Boolean(condition);
+        if (!booleanCondition) {
+          throw new Error(message);
+        }
+      }
+      function isPromise(value) {
+        return (
+          typeof (value === null || value === void 0 ? void 0 : value.then) ===
+          "function"
+        );
+      }
+      function isObjectLike(value) {
+        return typeof value == "object" && value !== null;
+      }
+      function promiseReduce(values, callbackFn, initialValue) {
+        let accumulator = initialValue;
+        for (const value of values) {
+          accumulator = isPromise(accumulator)
+            ? accumulator.then((resolved) => callbackFn(resolved, value))
+            : callbackFn(accumulator, value);
+        }
+        return accumulator;
+      }
+      function isAsyncIterable(maybeAsyncIterable) {
+        return (
+          typeof (maybeAsyncIterable === null || maybeAsyncIterable === void 0
+            ? void 0
+            : maybeAsyncIterable[Symbol.asyncIterator]) === "function"
+        );
+      }
+      function isIterableObject(maybeIterable) {
+        return (
+          typeof maybeIterable === "object" &&
+          typeof (maybeIterable === null || maybeIterable === void 0
+            ? void 0
+            : maybeIterable[Symbol.iterator]) === "function"
+        );
+      }
+      function resolveAfterAll(result2, promises) {
+        return new Promise((resolve, reject2) => {
+          let rejected = false;
+          let reason;
+          let numPromises = promises.length;
+          const onFulfilled = () => {
+            numPromises--;
+            if (!numPromises) {
+              if (rejected) {
+                reject2(reason);
+              }
+              resolve(result2);
+            }
+          };
+          const onRejected = (_reason) => {
+            if (!rejected) {
+              rejected = true;
+              reason = _reason;
+            }
+            numPromises--;
+            if (!numPromises) {
+              reject2(reason);
+            }
+          };
+          for (const promise of promises) {
+            promise.then(onFulfilled, onRejected);
+          }
+        });
+      }
+      function toError(thrownValue) {
+        return thrownValue instanceof Error
+          ? thrownValue
+          : new NonErrorThrown(thrownValue);
+      }
+      class NonErrorThrown extends Error {
+        constructor(thrownValue) {
+          super("Unexpected error value: " + inspect(thrownValue));
+          this.name = "NonErrorThrown";
+          this.thrownValue = thrownValue;
+        }
+      }
+      function keyMap(list3, keyFn) {
+        const result2 = /* @__PURE__ */ Object.create(null);
+        for (const item of list3) {
+          result2[keyFn(item)] = item;
+        }
+        return result2;
+      }
+      function printPathArray(path) {
+        return path
+          .map((key) =>
+            typeof key === "number" ? "[" + key.toString() + "]" : "." + key
+          )
+          .join("");
+      }
+      const MAX_SUGGESTIONS = 5;
+      function didYouMean(firstArg, secondArg) {
+        const [subMessage, suggestionsArg] = secondArg
+          ? [firstArg, secondArg]
+          : [void 0, firstArg];
+        let message = " Did you mean ";
+        if (subMessage) {
+          message += subMessage + " ";
+        }
+        const suggestions = suggestionsArg.map((x2) => `"${x2}"`);
+        switch (suggestions.length) {
+          case 0:
+            return "";
+          case 1:
+            return message + suggestions[0] + "?";
+          case 2:
+            return message + suggestions[0] + " or " + suggestions[1] + "?";
+        }
+        const selected = suggestions.slice(0, MAX_SUGGESTIONS);
+        const lastItem = selected.pop();
+        return message + selected.join(", ") + ", or " + lastItem + "?";
+      }
+      function naturalCompare(aStr, bStr) {
+        let aIndex = 0;
+        let bIndex = 0;
+        while (aIndex < aStr.length && bIndex < bStr.length) {
+          let aChar = aStr.charCodeAt(aIndex);
+          let bChar = bStr.charCodeAt(bIndex);
+          if (isDigit(aChar) && isDigit(bChar)) {
+            let aNum = 0;
+            do {
+              ++aIndex;
+              aNum = aNum * 10 + aChar - DIGIT_0;
+              aChar = aStr.charCodeAt(aIndex);
+            } while (isDigit(aChar) && aNum > 0);
+            let bNum = 0;
+            do {
+              ++bIndex;
+              bNum = bNum * 10 + bChar - DIGIT_0;
+              bChar = bStr.charCodeAt(bIndex);
+            } while (isDigit(bChar) && bNum > 0);
+            if (aNum < bNum) {
+              return -1;
+            }
+            if (aNum > bNum) {
+              return 1;
+            }
+          } else {
+            if (aChar < bChar) {
+              return -1;
+            }
+            if (aChar > bChar) {
+              return 1;
+            }
+            ++aIndex;
+            ++bIndex;
+          }
+        }
+        return aStr.length - bStr.length;
+      }
+      const DIGIT_0 = 48;
+      const DIGIT_9 = 57;
+      function isDigit(code3) {
+        return !isNaN(code3) && DIGIT_0 <= code3 && code3 <= DIGIT_9;
+      }
+      function suggestionList(input, options) {
+        const optionsByDistance = /* @__PURE__ */ Object.create(null);
+        const lexicalDistance2 = new LexicalDistance(input);
+        const threshold = Math.floor(input.length * 0.4) + 1;
+        for (const option of options) {
+          const distance = lexicalDistance2.measure(option, threshold);
+          if (distance !== void 0) {
+            optionsByDistance[option] = distance;
+          }
+        }
+        return Object.keys(optionsByDistance).sort((a, b) => {
+          const distanceDiff = optionsByDistance[a] - optionsByDistance[b];
+          return distanceDiff !== 0 ? distanceDiff : naturalCompare(a, b);
+        });
+      }
+      class LexicalDistance {
+        constructor(input) {
+          this._input = input;
+          this._inputLowerCase = input.toLowerCase();
+          this._inputArray = stringToArray(this._inputLowerCase);
+          this._rows = [
+            new Array(input.length + 1).fill(0),
+            new Array(input.length + 1).fill(0),
+            new Array(input.length + 1).fill(0),
+          ];
+        }
+        measure(option, threshold) {
+          if (this._input === option) {
+            return 0;
+          }
+          const optionLowerCase = option.toLowerCase();
+          if (this._inputLowerCase === optionLowerCase) {
+            return 1;
+          }
+          let a = stringToArray(optionLowerCase);
+          let b = this._inputArray;
+          if (a.length < b.length) {
+            const tmp = a;
+            a = b;
+            b = tmp;
+          }
+          const aLength = a.length;
+          const bLength = b.length;
+          if (aLength - bLength > threshold) {
+            return void 0;
+          }
+          const rows = this._rows;
+          for (let j = 0; j <= bLength; j++) {
+            rows[0][j] = j;
+          }
+          for (let i = 1; i <= aLength; i++) {
+            const upRow = rows[(i - 1) % 3];
+            const currentRow = rows[i % 3];
+            let smallestCell = (currentRow[0] = i);
+            for (let j = 1; j <= bLength; j++) {
+              const cost = a[i - 1] === b[j - 1] ? 0 : 1;
+              let currentCell = Math.min(
+                upRow[j] + 1,
+                currentRow[j - 1] + 1,
+                upRow[j - 1] + cost
+              );
+              if (
+                i > 1 &&
+                j > 1 &&
+                a[i - 1] === b[j - 2] &&
+                a[i - 2] === b[j - 1]
+              ) {
+                const doubleDiagonalCell = rows[(i - 2) % 3][j - 2];
+                currentCell = Math.min(currentCell, doubleDiagonalCell + 1);
+              }
+              if (currentCell < smallestCell) {
+                smallestCell = currentCell;
+              }
+              currentRow[j] = currentCell;
+            }
+            if (smallestCell > threshold) {
+              return void 0;
+            }
+          }
+          const distance = rows[aLength % 3][bLength];
+          return distance <= threshold ? distance : void 0;
+        }
+      }
+      function stringToArray(str) {
+        const strLength = str.length;
+        const array = new Array(strLength);
+        for (let i = 0; i < strLength; ++i) {
+          array[i] = str.charCodeAt(i);
+        }
+        return array;
+      }
+      function isGraphQLError(error2) {
+        return error2.name === "GraphQLError";
+      }
+      function coerceInputValue(
+        executorSchema,
+        inputValue,
+        type2,
+        onError = defaultOnError
+      ) {
+        return coerceInputValueImpl(
+          executorSchema,
+          inputValue,
+          type2,
+          onError,
+          void 0
+        );
+      }
+      function defaultOnError(path, invalidValue, error2) {
+        let errorPrefix = "Invalid value " + inspect(invalidValue);
+        if (path.length > 0) {
+          errorPrefix += ` at "value${printPathArray(path)}"`;
+        }
+        error2.message = errorPrefix + ": " + error2.message;
+        throw error2;
+      }
+      function coerceInputValueImpl(
+        executorSchema,
+        inputValue,
+        type2,
+        onError,
+        path
+      ) {
+        if (executorSchema.isNonNullType(type2)) {
+          if (inputValue != null) {
+            return coerceInputValueImpl(
+              executorSchema,
+              inputValue,
+              type2.ofType,
+              onError,
+              path
+            );
+          }
+          onError(
+            pathToArray(path),
+            inputValue,
+            new GraphQLError(
+              `Expected non-nullable type "${inspect(type2)}" not to be null.`
+            )
+          );
+          return;
+        }
+        if (inputValue == null) {
+          return null;
+        }
+        if (executorSchema.isListType(type2)) {
+          const itemType = type2.ofType;
+          if (isIterableObject(inputValue)) {
+            return Array.from(inputValue, (itemValue, index) => {
+              const itemPath = addPath(path, index, void 0);
+              return coerceInputValueImpl(
+                executorSchema,
+                itemValue,
+                itemType,
+                onError,
+                itemPath
+              );
+            });
+          }
+          return [
+            coerceInputValueImpl(
+              executorSchema,
+              inputValue,
+              itemType,
+              onError,
+              path
+            ),
+          ];
+        }
+        if (executorSchema.isInputObjectType(type2)) {
+          if (!isObjectLike(inputValue)) {
+            onError(
+              pathToArray(path),
+              inputValue,
+              new GraphQLError(`Expected type "${type2.name}" to be an object.`)
+            );
+            return;
+          }
+          const coercedValue = {};
+          const fieldDefs = type2.getFields();
+          for (const field of Object.values(fieldDefs)) {
+            const fieldValue = inputValue[field.name];
+            if (fieldValue === void 0) {
+              if (field.defaultValue !== void 0) {
+                coercedValue[field.name] = field.defaultValue;
+              } else if (executorSchema.isNonNullType(field.type)) {
+                const typeStr = inspect(field.type);
+                onError(
+                  pathToArray(path),
+                  inputValue,
+                  new GraphQLError(
+                    `Field "${field.name}" of required type "${typeStr}" was not provided.`
+                  )
+                );
+              }
+              continue;
+            }
+            coercedValue[field.name] = coerceInputValueImpl(
+              executorSchema,
+              fieldValue,
+              field.type,
+              onError,
+              addPath(path, field.name, type2.name)
+            );
+          }
+          for (const fieldName of Object.keys(inputValue)) {
+            if (!fieldDefs[fieldName]) {
+              const suggestions = suggestionList(
+                fieldName,
+                Object.keys(type2.getFields())
+              );
+              onError(
+                pathToArray(path),
+                inputValue,
+                new GraphQLError(
+                  `Field "${fieldName}" is not defined by type "${type2.name}".` +
+                    didYouMean(suggestions)
+                )
+              );
+            }
+          }
+          return coercedValue;
+        }
+        if (executorSchema.isLeafType(type2)) {
+          let parseResult;
+          try {
+            parseResult = type2.parseValue(inputValue);
+          } catch (error2) {
+            if (isGraphQLError(error2)) {
+              onError(pathToArray(path), inputValue, error2);
+            } else {
+              onError(
+                pathToArray(path),
+                inputValue,
+                new GraphQLError(
+                  `Expected type "${type2.name}". ` + error2.message,
+                  void 0,
+                  void 0,
+                  void 0,
+                  void 0,
+                  error2
+                )
+              );
+            }
+            return;
+          }
+          if (parseResult === void 0) {
+            onError(
+              pathToArray(path),
+              inputValue,
+              new GraphQLError(`Expected type "${type2.name}".`)
+            );
+          }
+          return parseResult;
+        }
+        invariant(false, "Unexpected input type: " + inspect(type2));
+      }
+      function valueFromAST(executorSchema, valueNode, type2, variables) {
+        if (!valueNode) {
+          return;
+        }
+        if (valueNode.kind === Kind.VARIABLE) {
+          const variableName = valueNode.name.value;
+          if (variables == null || variables[variableName] === void 0) {
+            return;
+          }
+          const variableValue = variables[variableName];
+          if (variableValue === null && executorSchema.isNonNullType(type2)) {
+            return;
+          }
+          return variableValue;
+        }
+        if (executorSchema.isNonNullType(type2)) {
+          if (valueNode.kind === Kind.NULL) {
+            return;
+          }
+          return valueFromAST(
+            executorSchema,
+            valueNode,
+            type2.ofType,
+            variables
+          );
+        }
+        if (valueNode.kind === Kind.NULL) {
+          return null;
+        }
+        if (executorSchema.isListType(type2)) {
+          const itemType = type2.ofType;
+          if (valueNode.kind === Kind.LIST) {
+            const coercedValues = [];
+            for (const itemNode of valueNode.values) {
+              if (isMissingVariable(itemNode, variables)) {
+                if (executorSchema.isNonNullType(itemType)) {
+                  return;
+                }
+                coercedValues.push(null);
+              } else {
+                const itemValue = valueFromAST(
+                  executorSchema,
+                  itemNode,
+                  itemType,
+                  variables
+                );
+                if (itemValue === void 0) {
+                  return;
+                }
+                coercedValues.push(itemValue);
+              }
+            }
+            return coercedValues;
+          }
+          const coercedValue = valueFromAST(
+            executorSchema,
+            valueNode,
+            itemType,
+            variables
+          );
+          if (coercedValue === void 0) {
+            return;
+          }
+          return [coercedValue];
+        }
+        if (executorSchema.isInputObjectType(type2)) {
+          if (valueNode.kind !== Kind.OBJECT) {
+            return;
+          }
+          const coercedObj = /* @__PURE__ */ Object.create(null);
+          const fieldNodes = keyMap(
+            valueNode.fields,
+            (field) => field.name.value
+          );
+          for (const field of Object.values(type2.getFields())) {
+            const fieldNode = fieldNodes[field.name];
+            if (!fieldNode || isMissingVariable(fieldNode.value, variables)) {
+              if (field.defaultValue !== void 0) {
+                coercedObj[field.name] = field.defaultValue;
+              } else if (executorSchema.isNonNullType(field.type)) {
+                return;
+              }
+              continue;
+            }
+            const fieldValue = valueFromAST(
+              executorSchema,
+              fieldNode.value,
+              field.type,
+              variables
+            );
+            if (fieldValue === void 0) {
+              return;
+            }
+            coercedObj[field.name] = fieldValue;
+          }
+          return coercedObj;
+        }
+        if (executorSchema.isLeafType(type2)) {
+          let result2;
+          try {
+            result2 = type2.parseLiteral(valueNode, variables);
+          } catch (_error) {
+            return;
+          }
+          if (result2 === void 0) {
+            return;
+          }
+          return result2;
+        }
+        invariant(false, "Unexpected input type: " + inspect(type2));
+      }
+      function isMissingVariable(valueNode, variables) {
+        return (
+          valueNode.kind === Kind.VARIABLE &&
+          (variables == null || variables[valueNode.name.value] === void 0)
+        );
+      }
+      function getVariableValues(executorSchema, varDefNodes, inputs, options) {
+        const errors2 = [];
+        const maxErrors =
+          options === null || options === void 0 ? void 0 : options.maxErrors;
+        try {
+          const coerced = coerceVariableValues(
+            executorSchema,
+            varDefNodes,
+            inputs,
+            (error2) => {
+              if (maxErrors != null && errors2.length >= maxErrors) {
+                throw new GraphQLError(
+                  "Too many errors processing variables, error limit reached. Execution aborted."
+                );
+              }
+              errors2.push(error2);
+            }
+          );
+          if (errors2.length === 0) {
+            return {
+              coerced,
+            };
+          }
+        } catch (error2) {
+          errors2.push(error2);
+        }
+        return {
+          errors: errors2,
+        };
+      }
+      function coerceVariableValues(
+        executorSchema,
+        varDefNodes,
+        inputs,
+        onError
+      ) {
+        const coercedValues = {};
+        for (const varDefNode of varDefNodes) {
+          const varName = varDefNode.variable.name.value;
+          const varType = executorSchema.getType(varDefNode.type);
+          if (!varType || !executorSchema.isInputType(varType)) {
+            const varTypeStr = print(varDefNode.type);
+            onError(
+              new GraphQLError(
+                `Variable "$${varName}" expected value of type "${varTypeStr}" which cannot be used as an input type.`,
+                varDefNode.type
+              )
+            );
+            continue;
+          }
+          if (!hasOwnProperty$1(inputs, varName)) {
+            if (varDefNode.defaultValue) {
+              coercedValues[varName] = valueFromAST(
+                executorSchema,
+                varDefNode.defaultValue,
+                varType
+              );
+            } else if (executorSchema.isNonNullType(varType)) {
+              const varTypeStr = inspect(varType);
+              onError(
+                new GraphQLError(
+                  `Variable "$${varName}" of required type "${varTypeStr}" was not provided.`,
+                  varDefNode
+                )
+              );
+            }
+            continue;
+          }
+          const value = inputs[varName];
+          if (value === null && executorSchema.isNonNullType(varType)) {
+            const varTypeStr = inspect(varType);
+            onError(
+              new GraphQLError(
+                `Variable "$${varName}" of non-null type "${varTypeStr}" must not be null.`,
+                varDefNode
+              )
+            );
+            continue;
+          }
+          coercedValues[varName] = coerceInputValue(
+            executorSchema,
+            value,
+            varType,
+            (path, invalidValue, error2) => {
+              let prefix =
+                `Variable "$${varName}" got invalid value ` +
+                inspect(invalidValue);
+              if (path.length > 0) {
+                prefix += ` at "${varName}${printPathArray(path)}"`;
+              }
+              onError(
+                new GraphQLError(
+                  prefix + "; " + error2.message,
+                  varDefNode,
+                  void 0,
+                  void 0,
+                  void 0,
+                  error2.originalError
+                )
+              );
+            }
+          );
+        }
+        return coercedValues;
+      }
+      function getArgumentValues(executorSchema, def, node, variableValues) {
+        var _node$arguments;
+        const coercedValues = {};
+        const argumentNodes =
+          (_node$arguments = node.arguments) !== null &&
+          _node$arguments !== void 0
+            ? _node$arguments
+            : [];
+        const argNodeMap = keyMap(argumentNodes, (arg) => arg.name.value);
+        for (const argDef of def.args) {
+          const name2 = argDef.name;
+          const argType = argDef.type;
+          const argumentNode = argNodeMap[name2];
+          if (!argumentNode) {
+            if (argDef.defaultValue !== void 0) {
+              coercedValues[name2] = argDef.defaultValue;
+            } else if (executorSchema.isNonNullType(argType)) {
+              throw new GraphQLError(
+                `Argument "${name2}" of required type "${inspect(
+                  argType
+                )}" was not provided.`,
+                node
+              );
+            }
+            continue;
+          }
+          const valueNode = argumentNode.value;
+          let isNull = valueNode.kind === Kind.NULL;
+          if (valueNode.kind === Kind.VARIABLE) {
+            const variableName = valueNode.name.value;
+            if (
+              variableValues == null ||
+              !hasOwnProperty$1(variableValues, variableName)
+            ) {
+              if (argDef.defaultValue !== void 0) {
+                coercedValues[name2] = argDef.defaultValue;
+              } else if (executorSchema.isNonNullType(argType)) {
+                throw new GraphQLError(
+                  `Argument "${name2}" of required type "${inspect(
+                    argType
+                  )}" was provided the variable "$${variableName}" which was not provided a runtime value.`,
+                  valueNode
+                );
+              }
+              continue;
+            }
+            isNull = variableValues[variableName] == null;
+          }
+          if (isNull && executorSchema.isNonNullType(argType)) {
+            throw new GraphQLError(
+              `Argument "${name2}" of non-null type "${inspect(
+                argType
+              )}" must not be null.`,
+              valueNode
+            );
+          }
+          const coercedValue = valueFromAST(
+            executorSchema,
+            valueNode,
+            argType,
+            variableValues
+          );
+          if (coercedValue === void 0) {
+            throw new GraphQLError(
+              `Argument "${name2}" has invalid value ${print(valueNode)}.`,
+              valueNode
+            );
+          }
+          coercedValues[name2] = coercedValue;
+        }
+        return coercedValues;
+      }
+      function getDirectiveValues(
+        executorSchema,
+        directiveDef,
+        node,
+        variableValues
+      ) {
+        var _node$directives;
+        const directiveNode =
+          (_node$directives = node.directives) === null ||
+          _node$directives === void 0
+            ? void 0
+            : _node$directives.find(
+                (directive) => directive.name.value === directiveDef.name
+              );
+        if (directiveNode) {
+          return getArgumentValues(
+            executorSchema,
+            directiveDef,
+            directiveNode,
+            variableValues
+          );
+        }
+      }
+      function hasOwnProperty$1(obj, prop2) {
+        return Object.prototype.hasOwnProperty.call(obj, prop2);
+      }
+      class RepeaterOverflowError extends Error {
+        constructor(message) {
+          super(message);
+          Object.defineProperty(this, "name", {
+            value: "RepeaterOverflowError",
+            enumerable: false,
+          });
+          Object.setPrototypeOf(this, this.constructor.prototype);
+          if (typeof Error.captureStackTrace === "function") {
+            Error.captureStackTrace(this, this.constructor);
+          }
+        }
+      }
+      function swallow(value) {
+        if (value != null && typeof value.then === "function") {
+          value.then(NOOP, NOOP);
+        }
+      }
+      const Initial = 0;
+      const Started = 1;
+      const Stopped = 2;
+      const Done = 3;
+      const Rejected = 4;
+      const MAX_QUEUE_LENGTH = 1024;
+      const NOOP = () => void 0;
+      function consumeExecution(r2) {
+        const err = r2.err;
+        const execution = Promise.resolve(r2.execution).then((value) => {
+          if (err != null) {
+            throw err;
+          }
+          return value;
+        });
+        r2.err = void 0;
+        r2.execution = execution.then(
+          () => void 0,
+          () => void 0
+        );
+        return r2.pending === void 0
+          ? execution
+          : r2.pending.then(() => execution);
+      }
+      function createIteration(r2, value) {
+        const done = r2.state >= Done;
+        return Promise.resolve(value).then((resolvedValue) => {
+          if (!done && r2.state >= Rejected) {
+            return consumeExecution(r2).then((finalValue) => ({
+              value: finalValue,
+              done: true,
+            }));
+          }
+          return {
+            value: resolvedValue,
+            done,
+          };
+        });
+      }
+      function stop(r2, err) {
+        if (r2.state >= Stopped) {
+          return;
+        }
+        r2.state = Stopped;
+        r2.onnext();
+        r2.onstop();
+        if (r2.err == null) {
+          r2.err = err;
+        }
+        if (
+          r2.pushes.length === 0 &&
+          (typeof r2.buffer === "undefined" || r2.buffer.empty)
+        ) {
+          finish(r2);
+        } else {
+          for (const p2 of r2.pushes) {
+            p2.resolve();
+          }
+        }
+      }
+      function finish(r2) {
+        if (r2.state >= Done) {
+          return;
+        }
+        if (r2.state < Stopped) {
+          stop(r2);
+        }
+        r2.state = Done;
+        r2.buffer = void 0;
+        for (const next of r2.nexts) {
+          const execution =
+            r2.pending === void 0
+              ? consumeExecution(r2)
+              : r2.pending.then(() => consumeExecution(r2));
+          next.resolve(createIteration(r2, execution));
+        }
+        r2.pushes = [];
+        r2.nexts = [];
+      }
+      function reject(r2) {
+        if (r2.state >= Rejected) {
+          return;
+        }
+        if (r2.state < Done) {
+          finish(r2);
+        }
+        r2.state = Rejected;
+      }
+      function push(r2, value) {
+        swallow(value);
+        if (r2.pushes.length >= MAX_QUEUE_LENGTH) {
+          throw new RepeaterOverflowError(
+            `No more than ${MAX_QUEUE_LENGTH} pending calls to push are allowed on a single repeater.`
+          );
+        } else if (r2.state >= Stopped) {
+          return Promise.resolve(void 0);
+        }
+        let valueP =
+          r2.pending === void 0
+            ? Promise.resolve(value)
+            : r2.pending.then(() => value);
+        valueP = valueP.catch((err) => {
+          if (r2.state < Stopped) {
+            r2.err = err;
+          }
+          reject(r2);
+          return void 0;
+        });
+        let nextP;
+        if (r2.nexts.length) {
+          const next2 = r2.nexts.shift();
+          next2.resolve(createIteration(r2, valueP));
+          if (r2.nexts.length) {
+            nextP = Promise.resolve(r2.nexts[0].value);
+          } else {
+            nextP = new Promise((resolve) => (r2.onnext = resolve));
+          }
+        } else if (typeof r2.buffer !== "undefined" && !r2.buffer.full) {
+          r2.buffer.add(valueP);
+          nextP = Promise.resolve(void 0);
+        } else {
+          nextP = new Promise((resolve) =>
+            r2.pushes.push({
+              resolve,
+              value: valueP,
+            })
+          );
+        }
+        let floating = true;
+        const next = {};
+        const unhandled = nextP.catch((err) => {
+          if (floating) {
+            throw err;
+          }
+          return void 0;
+        });
+        next.then = (onfulfilled, onrejected) => {
+          floating = false;
+          return Promise.prototype.then.call(nextP, onfulfilled, onrejected);
+        };
+        next.catch = (onrejected) => {
+          floating = false;
+          return Promise.prototype.catch.call(nextP, onrejected);
+        };
+        next.finally = nextP.finally.bind(nextP);
+        r2.pending = valueP
+          .then(() => unhandled)
+          .catch((err) => {
+            r2.err = err;
+            reject(r2);
+          });
+        return next;
+      }
+      function createStop(r2) {
+        const stop1 = stop.bind(null, r2);
+        const stopP = new Promise((resolve) => (r2.onstop = resolve));
+        stop1.then = stopP.then.bind(stopP);
+        stop1.catch = stopP.catch.bind(stopP);
+        stop1.finally = stopP.finally.bind(stopP);
+        return stop1;
+      }
+      function execute(r2) {
+        r2.state = Started;
+        const push1 = push.bind(null, r2);
+        const stop1 = createStop(r2);
+        r2.execution = new Promise((resolve) =>
+          resolve(r2.executor(push1, stop1))
+        );
+        r2.execution.catch(() => stop(r2));
+      }
+      const records = /* @__PURE__ */ new WeakMap();
+      class Repeater {
+        constructor(executor, buffer2) {
+          records.set(this, {
+            executor,
+            buffer: buffer2,
+            err: void 0,
+            state: Initial,
+            pushes: [],
+            nexts: [],
+            pending: void 0,
+            execution: void 0,
+            onnext: NOOP,
+            onstop: NOOP,
+          });
+        }
+        next(value) {
+          swallow(value);
+          const r2 = records.get(this);
+          if (r2 === void 0) {
+            throw new Error("WeakMap error");
+          }
+          if (r2.nexts.length >= MAX_QUEUE_LENGTH) {
+            throw new RepeaterOverflowError(
+              `No more than ${MAX_QUEUE_LENGTH} pending calls to next are allowed on a single repeater.`
+            );
+          }
+          if (r2.state <= Initial) {
+            execute(r2);
+          }
+          r2.onnext(value);
+          if (typeof r2.buffer !== "undefined" && !r2.buffer.empty) {
+            const result2 = createIteration(r2, r2.buffer.remove());
+            if (r2.pushes.length) {
+              const p2 = r2.pushes.shift();
+              r2.buffer.add(p2.value);
+              r2.onnext = p2.resolve;
+            }
+            return result2;
+          } else if (r2.pushes.length) {
+            const p2 = r2.pushes.shift();
+            r2.onnext = p2.resolve;
+            return createIteration(r2, p2.value);
+          } else if (r2.state >= Stopped) {
+            finish(r2);
+            return createIteration(r2, consumeExecution(r2));
+          }
+          return new Promise((resolve) =>
+            r2.nexts.push({
+              resolve,
+              value,
+            })
+          );
+        }
+        return(value) {
+          swallow(value);
+          const r2 = records.get(this);
+          if (r2 === void 0) {
+            throw new Error("WeakMap error");
+          }
+          finish(r2);
+          r2.execution = Promise.resolve(r2.execution).then(() => value);
+          return createIteration(r2, consumeExecution(r2));
+        }
+        throw(err) {
+          const r2 = records.get(this);
+          if (r2 === void 0) {
+            throw new Error("WeakMap error");
+          }
+          if (
+            r2.state <= Initial ||
+            r2.state >= Stopped ||
+            (typeof r2.buffer !== "undefined" && !r2.buffer.empty)
+          ) {
+            finish(r2);
+            if (r2.err == null) {
+              r2.err = err;
+            }
+            return createIteration(r2, consumeExecution(r2));
+          }
+          return this.next(Promise.reject(err));
+        }
+        [Symbol.asyncIterator]() {
+          return this;
+        }
+      }
+      class Publisher {
+        constructor({
+          payloadFromSource = (source) => source,
+          onReady,
+          hasNext = () => true,
+          onStop,
+        } = {}) {
+          this._payloadFromSource = payloadFromSource;
+          this._onReady = onReady;
+          this._hasNext = hasNext;
+          this._buffer = [];
+          this._stopped = false;
+          this._trigger = new Promise((resolve) => {
+            this._resolve = resolve;
+          });
+          this._pushed = /* @__PURE__ */ new WeakMap();
+          this._pending = /* @__PURE__ */ new WeakMap();
+          this._repeater = new Repeater(async (push2, stop2) => {
+            if (onStop) {
+              stop2.then(onStop);
+            }
+            while (true) {
+              await this._trigger;
+              while (this._buffer.length) {
+                const payload = this._buffer.shift();
+                await push2(payload);
+              }
+              if (this._stopped) {
+                stop2();
+                break;
+              }
+              this._trigger = new Promise((resolve) => {
+                this._resolve = resolve;
+              });
+            }
+          });
+        }
+        emit(keys, payload) {
+          for (const key of keys) {
+            this._pushed.set(key, true);
+          }
+          this._buffer.push(payload);
+          for (const key of keys) {
+            const dependents = this._pending.get(key);
+            if (dependents) {
+              this._pushMany(dependents);
+            }
+            this._pending.delete(key);
+          }
+          this._resolve();
+        }
+        stop(finalPayload) {
+          if (finalPayload !== void 0) {
+            this._buffer.push(finalPayload);
+          }
+          this._stopped = true;
+          this._resolve();
+        }
+        queue(keys, source, parentKey) {
+          if (this._pushed.get(parentKey)) {
+            this._pushOne({
+              keys,
+              source,
+            });
+            return;
+          }
+          const dependents = this._pending.get(parentKey);
+          if (dependents) {
+            dependents.push({
+              keys,
+              source,
+            });
+            return;
+          }
+          this._pending.set(parentKey, [
+            {
+              keys,
+              source,
+            },
+          ]);
+        }
+        _pushOne(context) {
+          const hasNext = this._pushOneImpl(context);
+          if (!hasNext) {
+            this.stop();
+          }
+        }
+        _pushOneImpl({ keys, source }) {
+          var _this$_onReady;
+          (_this$_onReady = this._onReady) === null || _this$_onReady === void 0
+            ? void 0
+            : _this$_onReady.call(this);
+          const hasNext = this._hasNext();
+          const payload = this._payloadFromSource(source, hasNext);
+          this.emit(keys, payload);
+          return hasNext;
+        }
+        _pushMany(contexts) {
+          let hasNext = false;
+          for (const context of contexts) {
+            hasNext = this._pushOneImpl(context);
+          }
+          if (!hasNext) {
+            this.stop();
+          }
+        }
+        subscribe() {
+          return this._repeater;
+        }
+      }
+      class Bundler {
+        constructor({
+          initialIndex,
+          maxBundleSize,
+          maxInterval,
+          createDataBundleContext,
+          createErrorBundleContext,
+          onSubsequentData,
+          onSubsequentError,
+          onDataBundle,
+          onErrorBundle,
+        }) {
+          this._maxBundleSize = maxBundleSize;
+          this._createDataBundleContext = createDataBundleContext;
+          this._createErrorBundleContext = createErrorBundleContext;
+          this._onSubsequentData = onSubsequentData;
+          this._onSubsequentError = onSubsequentError;
+          this._onDataBundle = onDataBundle;
+          this._onErrorBundle = onErrorBundle;
+          if (maxInterval != null) {
+            this._timingContext = {
+              maxInterval,
+              timeout: void 0,
+              lastTime: Date.now(),
+            };
+          }
+          this._currentBundleSize = 0;
+          this._count = initialIndex;
+        }
+        queueData(index, result2) {
+          const context = this._updateDataContext(index, result2);
+          this._currentBundleSize++;
+          this._count++;
+          if (this._count === this._total) {
+            this._onDataBundle(context);
+            if (this._timingContext) {
+              this._clearCurrentTimer(this._timingContext);
+            }
+            return;
+          }
+          if (this._currentBundleSize === this._maxBundleSize) {
+            this._onDataBundle(context);
+            this._currentContext = void 0;
+            if (this._timingContext) {
+              this._restartTimer(this._timingContext);
+            }
+            return;
+          }
+          if (
+            this._timingContext &&
+            Date.now() - this._timingContext.lastTime >
+              this._timingContext.maxInterval
+          ) {
+            this._onDataBundle(context);
+            this._currentContext = void 0;
+            this._startNewTimer(this._timingContext);
+          }
+        }
+        queueError(index, result2) {
+          const context = this._updateErrorContext(index, result2);
+          this._currentBundleSize++;
+          this._count++;
+          if (this._count === this._total) {
+            this._onErrorBundle(context);
+            if (this._timingContext) {
+              this._clearCurrentTimer(this._timingContext);
+            }
+            return;
+          }
+          if (this._currentBundleSize === this._maxBundleSize) {
+            this._onErrorBundle(context);
+            this._currentContext = void 0;
+            if (this._timingContext) {
+              this._restartTimer(this._timingContext);
+            }
+          }
+          if (
+            this._timingContext &&
+            Date.now() - this._timingContext.lastTime >
+              this._timingContext.maxInterval
+          ) {
+            this._onErrorBundle(context);
+            this._currentContext = void 0;
+            this._startNewTimer(this._timingContext);
+          }
+        }
+        setTotal(total) {
+          if (this._count < total) {
+            this._total = total;
+            return;
+          }
+          if (this._currentContext) {
+            this._onBundle(this._currentContext);
+            if (this._timingContext) {
+              this._clearCurrentTimer(this._timingContext);
+            }
+          }
+        }
+        _clearCurrentTimer(timingContext) {
+          const timeout = timingContext.timeout;
+          if (timeout) {
+            clearTimeout(timeout);
+          }
+        }
+        _startNewTimer(timingContext) {
+          timingContext.timeout = setTimeout(
+            () => this._flushCurrentBundle(timingContext),
+            timingContext.maxInterval
+          );
+          timingContext.lastTime = Date.now();
+        }
+        _flushCurrentBundle(timingContext) {
+          if (this._currentContext) {
+            this._onBundle(this._currentContext);
+            this._currentContext = void 0;
+            this._restartTimer(timingContext);
+            this._startNewTimer(timingContext);
+          }
+        }
+        _restartTimer(timingContext) {
+          this._clearCurrentTimer(timingContext);
+          this._startNewTimer(timingContext);
+        }
+        _updateDataContext(index, result2) {
+          if (this._currentContext === void 0) {
+            return this._getNewDataContext(index, result2);
+          } else if (!this._currentContext.isData) {
+            this._onErrorBundle(this._currentContext.context);
+            return this._getNewDataContext(index, result2);
+          }
+          this._onSubsequentData(index, result2, this._currentContext.context);
+          return this._currentContext.context;
+        }
+        _getNewDataContext(index, result2) {
+          this._currentBundleSize = 0;
+          const context = this._createDataBundleContext(index, result2);
+          this._currentContext = {
+            isData: true,
+            context,
+          };
+          if (this._timingContext) {
+            const timingContext = this._timingContext;
+            timingContext.timeout = setTimeout(
+              () => this._flushCurrentBundle(timingContext),
+              timingContext.maxInterval
+            );
+          }
+          return context;
+        }
+        _updateErrorContext(index, result2) {
+          if (this._currentContext === void 0) {
+            return this._getNewErrorContext(index, result2);
+          } else if (this._currentContext.isData) {
+            this._onDataBundle(this._currentContext.context);
+            return this._getNewErrorContext(index, result2);
+          }
+          this._onSubsequentError(index, result2, this._currentContext.context);
+          return this._currentContext.context;
+        }
+        _getNewErrorContext(index, result2) {
+          this._currentBundleSize = 0;
+          const context = this._createErrorBundleContext(index, result2);
+          this._currentContext = {
+            isData: false,
+            context,
+          };
+          if (this._timingContext) {
+            const timingContext = this._timingContext;
+            timingContext.timeout = setTimeout(
+              () => this._flushCurrentBundle(timingContext),
+              timingContext.maxInterval
+            );
+          }
+          return context;
+        }
+        _onBundle(bundleContext) {
+          if (bundleContext.isData) {
+            this._onDataBundle(bundleContext.context);
+            return;
+          }
+          this._onErrorBundle(bundleContext.context);
+        }
+      }
+      function getSequentialBundler(initialIndex, bundler) {
+        const dataResultMap = /* @__PURE__ */ new Map();
+        const errorResultMap = /* @__PURE__ */ new Map();
+        let count = initialIndex;
+        return {
+          queueData: (index, result2) => {
+            if (count !== index) {
+              dataResultMap.set(index, result2);
+              return;
+            }
+            bundler.queueData(index, result2);
+            count++;
+            processPending();
+          },
+          queueError: (index, result2) => {
+            if (count !== index) {
+              errorResultMap.set(index, result2);
+              return;
+            }
+            bundler.queueError(index, result2);
+            count++;
+            processPending();
+          },
+          setTotal: (total) => bundler.setTotal(total),
+        };
+        function processPending() {
+          while (true) {
+            const dataResult = dataResultMap.get(count);
+            if (dataResult !== void 0) {
+              dataResultMap.delete(count);
+              bundler.queueData(count, dataResult);
+              count++;
+              continue;
+            }
+            const errorResult = errorResultMap.get(count);
+            if (errorResult !== void 0) {
+              errorResultMap.delete(count);
+              bundler.queueError(count, errorResult);
+              count++;
+              continue;
+            }
+            break;
+          }
+        }
+      }
+      function mapAsyncIterable(iterable, fn) {
+        return new Repeater(async (push2, stop2) => {
+          const iter = iterable[Symbol.asyncIterator]();
+          let finalIteration;
+          stop2.then(() => {
+            finalIteration =
+              typeof iter.return === "function" ? iter.return() : true;
+          });
+          while (!finalIteration) {
+            const iteration = await iter.next();
+            if (iteration.done) {
+              stop2();
+              break;
+            }
+            await push2(fn(iteration.value));
+          }
+          if (isPromise(finalIteration)) {
+            await finalIteration;
+          }
+        });
+      }
+      function flattenAsyncIterable(iterable) {
+        return new Repeater(async (push2, stop2) => {
+          const iter = iterable[Symbol.asyncIterator]();
+          let childIterator;
+          let finalIteration;
+          stop2.then(() => {
+            const childReturned =
+              childIterator &&
+              typeof childIterator.return === "function" &&
+              childIterator.return();
+            const returned = typeof iter.return === "function" && iter.return();
+            if (isPromise(childReturned)) {
+              finalIteration = isPromise(returned)
+                ? Promise.all([childReturned, returned])
+                : true;
+            } else if (isPromise(returned)) {
+              finalIteration = returned;
+            } else {
+              finalIteration = true;
+            }
+          });
+          while (!finalIteration) {
+            const iteration = await iter.next();
+            if (iteration.done) {
+              stop2();
+              break;
+            }
+            const value = iteration.value;
+            if (isAsyncIterable(value)) {
+              childIterator = value[Symbol.asyncIterator]();
+              await pushChildIterations(childIterator, push2, finalIteration);
+              childIterator = void 0;
+              continue;
+            }
+            await push2(value);
+          }
+          if (isPromise(finalIteration)) {
+            await finalIteration;
+          }
+        });
+      }
+      async function pushChildIterations(iter, push2, finalIteration) {
+        while (!finalIteration) {
+          const iteration = await iter.next();
+          if (iteration.done) {
+            return;
+          }
+          await push2(iteration.value);
+        }
+      }
+      function _defineProperty$1(obj, key, value) {
+        if (key in obj) {
+          Object.defineProperty(obj, key, {
+            value,
+            enumerable: true,
+            configurable: true,
+            writable: true,
+          });
+        } else {
+          obj[key] = value;
+        }
+        return obj;
+      }
+      class Executor {
+        constructor(executorArgs) {
+          _defineProperty$1(
+            this,
+            "splitDefinitions",
+            memoize1((document2) => this._splitDefinitions(document2))
+          );
+          _defineProperty$1(
+            this,
+            "selectOperation",
+            memoize1and1((operations, operationName) =>
+              this._selectOperation(operations, operationName)
+            )
+          );
+          _defineProperty$1(
+            this,
+            "getFieldContext",
+            memoize2((parentType, fieldNodes) =>
+              this._getFieldContext(parentType, fieldNodes)
+            )
+          );
+          _defineProperty$1(
+            this,
+            "getValueCompleter",
+            memoize1((returnType) => this._getValueCompleter(returnType))
+          );
+          _defineProperty$1(
+            this,
+            "createFieldList",
+            memoize1((node) => [node])
+          );
+          _defineProperty$1(
+            this,
+            "updateFieldList",
+            memoize2((fieldList, node) => [...fieldList, node])
+          );
+          _defineProperty$1(
+            this,
+            "buildFieldResolver",
+            (resolverKey, defaultResolver) =>
+              (exeContext, fieldContext, source, info2) => {
+                var _fieldDef$resolverKey;
+                const { fieldDef, initialFieldNode } = fieldContext;
+                const resolveFn =
+                  (_fieldDef$resolverKey = fieldDef[resolverKey]) !== null &&
+                  _fieldDef$resolverKey !== void 0
+                    ? _fieldDef$resolverKey
+                    : defaultResolver;
+                const { contextValue, variableValues } = exeContext;
+                const args = exeContext.getArgumentValues(
+                  fieldDef,
+                  initialFieldNode,
+                  variableValues
+                );
+                return resolveFn(source, args, contextValue, info2);
+              }
+          );
+          _defineProperty$1(
+            this,
+            "buildRootFieldCollector",
+            (fragments, variableValues, getDeferValues) =>
+              (runtimeType, operation) => {
+                const fields = /* @__PURE__ */ new Map();
+                const patches = [];
+                this.collectFieldsImpl(
+                  fragments,
+                  variableValues,
+                  getDeferValues,
+                  runtimeType,
+                  operation.selectionSet,
+                  fields,
+                  patches,
+                  /* @__PURE__ */ new Set()
+                );
+                return {
+                  fields,
+                  patches,
+                };
+              }
+          );
+          _defineProperty$1(
+            this,
+            "buildSubFieldCollector",
+            (fragments, variableValues, getDeferValues) =>
+              memoize2((returnType, fieldNodes) => {
+                const subFieldNodes = /* @__PURE__ */ new Map();
+                const visitedFragmentNames = /* @__PURE__ */ new Set();
+                const subPatches = [];
+                const subFieldsAndPatches = {
+                  fields: subFieldNodes,
+                  patches: subPatches,
+                };
+                for (const node of fieldNodes) {
+                  if (node.selectionSet) {
+                    this.collectFieldsImpl(
+                      fragments,
+                      variableValues,
+                      getDeferValues,
+                      returnType,
+                      node.selectionSet,
+                      subFieldNodes,
+                      subPatches,
+                      visitedFragmentNames
+                    );
+                  }
+                }
+                return subFieldsAndPatches;
+              })
+          );
+          const { schema, executorSchema } = executorArgs;
+          schema || devAssert(false, "Must provide schema.");
+          this._schema = schema;
+          this._executorSchema =
+            executorSchema !== null && executorSchema !== void 0
+              ? executorSchema
+              : toExecutorSchema(schema);
+        }
+        execute(args) {
+          const exeContext = this.buildExecutionContext(args);
+          if (!("fragments" in exeContext)) {
+            return {
+              errors: exeContext,
+            };
+          }
+          const { operation, forceQueryAlgorithm } = exeContext;
+          if (forceQueryAlgorithm) {
+            return this.executeQueryImpl(exeContext);
+          }
+          switch (operation.operation) {
+            case "query":
+              return this.executeQueryImpl(exeContext);
+            case "mutation":
+              return this.executeMutationImpl(exeContext);
+            default:
+              return this.executeSubscriptionImpl(exeContext);
+          }
+        }
+        async createSourceEventStream(args) {
+          const exeContext = this.buildExecutionContext(args);
+          if (!("fragments" in exeContext)) {
+            return {
+              errors: exeContext,
+            };
+          }
+          return this.createSourceEventStreamImpl(exeContext);
+        }
+        executeQueryImpl(exeContext) {
+          return this.executeOperationImpl(
+            exeContext,
+            this.executeFields.bind(this),
+            this.buildResponse.bind(this)
+          );
+        }
+        executeMutationImpl(exeContext) {
+          return this.executeOperationImpl(
+            exeContext,
+            this.executeFieldsSerially.bind(this),
+            this.buildResponse.bind(this)
+          );
+        }
+        executeOperationImpl(exeContext, rootFieldsExecutor, responseBuilder) {
+          let data;
+          try {
+            const { rootValue, rootResponseNode } = exeContext;
+            const {
+              rootType,
+              fieldsAndPatches: { fields, patches },
+            } = this.getRootContext(exeContext);
+            const path = void 0;
+            data = rootFieldsExecutor(
+              exeContext,
+              rootType,
+              rootValue,
+              path,
+              fields,
+              rootResponseNode
+            );
+            this.addPatches(
+              exeContext,
+              patches,
+              rootType,
+              rootValue,
+              path,
+              rootResponseNode
+            );
+          } catch (error2) {
+            exeContext.rootResponseNode.errors.push(error2);
+            data = null;
+          }
+          if (isPromise(data)) {
+            return data.then(
+              (resolvedData) => responseBuilder(exeContext, resolvedData),
+              (error2) => {
+                exeContext.rootResponseNode.errors.push(error2);
+                return responseBuilder(exeContext, null);
+              }
+            );
+          }
+          return responseBuilder(exeContext, data);
+        }
+        buildResponse(exeContext, data) {
+          const rootResponseNode = exeContext.rootResponseNode;
+          const errors2 = rootResponseNode.errors;
+          const initialResult =
+            errors2.length === 0
+              ? {
+                  data,
+                }
+              : {
+                  errors: errors2,
+                  data,
+                };
+          if (this.hasNext(exeContext.state)) {
+            const publisher = exeContext.publisher;
+            publisher.emit(
+              [rootResponseNode],
+              __spreadProps(__spreadValues({}, initialResult), {
+                hasNext: true,
+              })
+            );
+            return publisher.subscribe();
+          }
+          return initialResult;
+        }
+        assertValidExecutionArguments(document2, rawVariableValues) {
+          document2 || devAssert(false, "Must provide document.");
+          rawVariableValues == null ||
+            isObjectLike(rawVariableValues) ||
+            devAssert(
+              false,
+              "Variables must be provided as an Object where each property is a variable value. Perhaps look to see if an unparsed JSON string was provided."
+            );
+        }
+        _splitDefinitions(document2) {
+          const operations = [];
+          const fragments = /* @__PURE__ */ Object.create(null);
+          for (const definition of document2.definitions) {
+            switch (definition.kind) {
+              case Kind.OPERATION_DEFINITION:
+                operations.push(definition);
+                break;
+              case Kind.FRAGMENT_DEFINITION:
+                fragments[definition.name.value] = definition;
+                break;
+            }
+          }
+          return {
+            operations,
+            fragments,
+          };
+        }
+        _selectOperation(operations, operationName) {
+          let operation;
+          for (const possibleOperation of operations) {
+            var _possibleOperation$na;
+            if (operationName == null) {
+              if (operation !== void 0) {
+                return [
+                  new GraphQLError(
+                    "Must provide operation name if query contains multiple operations."
+                  ),
+                ];
+              }
+              operation = possibleOperation;
+            } else if (
+              ((_possibleOperation$na = possibleOperation.name) === null ||
+              _possibleOperation$na === void 0
+                ? void 0
+                : _possibleOperation$na.value) === operationName
+            ) {
+              operation = possibleOperation;
+            }
+          }
+          if (!operation) {
+            if (operationName != null) {
+              return [
+                new GraphQLError(`Unknown operation named "${operationName}".`),
+              ];
+            }
+            return [new GraphQLError("Must provide an operation.")];
+          }
+          return operation;
+        }
+        createPublisher(state) {
+          return new Publisher({
+            payloadFromSource: (result2, hasNext) => {
+              const { responseContext, data, path, atIndex, atIndices, label } =
+                result2;
+              const errors2 = [];
+              for (const responseNode of responseContext.responseNodes) {
+                errors2.push(...responseNode.errors);
+              }
+              const value = {
+                data,
+                path: path ? pathToArray(path) : [],
+                hasNext,
+              };
+              if (atIndex != null) {
+                value.atIndex = atIndex;
+              } else if (atIndices != null) {
+                value.atIndices = atIndices;
+              }
+              if (label != null) {
+                value.label = label;
+              }
+              if (errors2.length > 0) {
+                value.errors = errors2;
+              }
+              return value;
+            },
+            onReady: () => state.pendingPushes--,
+            hasNext: () => this.hasNext(state),
+            onStop: () =>
+              Promise.all(
+                Array.from(state.iterators.values()).map((iterator) => {
+                  var _iterator$return;
+                  return (_iterator$return = iterator.return) === null ||
+                    _iterator$return === void 0
+                    ? void 0
+                    : _iterator$return.call(iterator);
+                })
+              ),
+          });
+        }
+        buildExecutionContext(args) {
+          var _operation$variableDe;
+          const {
+            document: document2,
+            rootValue,
+            contextValue,
+            variableValues: rawVariableValues,
+            operationName,
+            fieldResolver,
+            typeResolver,
+            subscribeFieldResolver,
+            forceQueryAlgorithm,
+            enableIncremental,
+          } = args;
+          this.assertValidExecutionArguments(document2, rawVariableValues);
+          const { operations, fragments } = this.splitDefinitions(document2);
+          const operation = this.selectOperation(operations, operationName);
+          if ("length" in operation) {
+            return operation;
+          }
+          const variableDefinitions =
+            (_operation$variableDe = operation.variableDefinitions) !== null &&
+            _operation$variableDe !== void 0
+              ? _operation$variableDe
+              : [];
+          const coercedVariableValues = getVariableValues(
+            this._executorSchema,
+            variableDefinitions,
+            rawVariableValues !== null && rawVariableValues !== void 0
+              ? rawVariableValues
+              : {},
+            {
+              maxErrors: 50,
+            }
+          );
+          if (coercedVariableValues.errors) {
+            return coercedVariableValues.errors;
+          }
+          const enableIncrementalFlagValue =
+            enableIncremental !== null && enableIncremental !== void 0
+              ? enableIncremental
+              : true;
+          const defaultResolveFieldValueFn =
+            fieldResolver !== null && fieldResolver !== void 0
+              ? fieldResolver
+              : defaultFieldResolver;
+          const getDeferValues = enableIncrementalFlagValue
+            ? this.getDeferValues.bind(this)
+            : () => void 0;
+          const coercedVariableValuesValues = coercedVariableValues.coerced;
+          const state = {
+            pendingPushes: 0,
+            pendingStreamResults: 0,
+            iterators: /* @__PURE__ */ new Set(),
+          };
+          return {
+            fragments,
+            rootValue,
+            contextValue,
+            operation,
+            variableValues: coercedVariableValues.coerced,
+            fieldResolver: defaultResolveFieldValueFn,
+            typeResolver:
+              typeResolver !== null && typeResolver !== void 0
+                ? typeResolver
+                : defaultTypeResolver,
+            forceQueryAlgorithm:
+              forceQueryAlgorithm !== null && forceQueryAlgorithm !== void 0
+                ? forceQueryAlgorithm
+                : false,
+            enableIncremental: enableIncrementalFlagValue,
+            getArgumentValues: memoize2((def, node) =>
+              getArgumentValues(
+                this._executorSchema,
+                def,
+                node,
+                coercedVariableValuesValues
+              )
+            ),
+            getDeferValues,
+            getStreamValues: enableIncrementalFlagValue
+              ? this.getStreamValues.bind(this)
+              : () => void 0,
+            rootFieldCollector: this.buildRootFieldCollector(
+              fragments,
+              coercedVariableValuesValues,
+              getDeferValues
+            ),
+            subFieldCollector: this.buildSubFieldCollector(
+              fragments,
+              coercedVariableValuesValues,
+              getDeferValues
+            ),
+            resolveField:
+              operation.operation === "subscription" && !forceQueryAlgorithm
+                ? this.buildFieldResolver(
+                    "subscribe",
+                    subscribeFieldResolver !== null &&
+                      subscribeFieldResolver !== void 0
+                      ? subscribeFieldResolver
+                      : defaultFieldResolver
+                  )
+                : this.buildFieldResolver(
+                    "resolve",
+                    defaultResolveFieldValueFn
+                  ),
+            rootResponseNode: {
+              errors: [],
+            },
+            state,
+            publisher: this.createPublisher(state),
+          };
+        }
+        buildPerPayloadExecutionContext(exeContext, payload) {
+          const state = {
+            pendingPushes: 0,
+            pendingStreamResults: 0,
+            iterators: /* @__PURE__ */ new Set(),
+          };
+          return __spreadProps(__spreadValues({}, exeContext), {
+            rootValue: payload,
+            forceQueryAlgorithm: true,
+            resolveField: this.buildFieldResolver(
+              "resolve",
+              exeContext.fieldResolver
+            ),
+            rootResponseNode: {
+              errors: [],
+            },
+            state,
+            publisher: this.createPublisher(state),
+          });
+        }
+        getRootContext(exeContext) {
+          const { operation, rootFieldCollector } = exeContext;
+          const rootType = this._executorSchema.getRootType(
+            operation.operation
+          );
+          if (rootType == null) {
+            throw new GraphQLError(
+              `Schema is not configured to execute ${operation.operation} operation.`,
+              operation
+            );
+          }
+          const fieldsAndPatches = rootFieldCollector(rootType, operation);
+          return {
+            rootType,
+            fieldsAndPatches,
+          };
+        }
+        executeFieldsSerially(
+          exeContext,
+          parentType,
+          sourceValue,
+          path,
+          fields
+        ) {
+          const parentTypeName = parentType.name;
+          return promiseReduce(
+            fields.entries(),
+            (results, [responseName, fieldNodes]) => {
+              const fieldPath = addPath(path, responseName, parentTypeName);
+              const result2 = this.executeField(
+                exeContext,
+                parentType,
+                sourceValue,
+                fieldNodes,
+                fieldPath,
+                exeContext.rootResponseNode
+              );
+              if (result2 === void 0) {
+                return results;
+              }
+              if (isPromise(result2)) {
+                return result2.then((resolvedResult) => {
+                  results[responseName] = resolvedResult;
+                  return results;
+                });
+              }
+              results[responseName] = result2;
+              return results;
+            },
+            /* @__PURE__ */ Object.create(null)
+          );
+        }
+        executeFields(
+          exeContext,
+          parentType,
+          sourceValue,
+          path,
+          fields,
+          responseNode
+        ) {
+          const results = /* @__PURE__ */ Object.create(null);
+          const promises = [];
+          const parentTypeName = parentType.name;
+          for (const [responseName, fieldNodes] of fields.entries()) {
+            const fieldPath = addPath(path, responseName, parentTypeName);
+            const result2 = this.executeField(
+              exeContext,
+              parentType,
+              sourceValue,
+              fieldNodes,
+              fieldPath,
+              responseNode
+            );
+            if (result2 !== void 0) {
+              if (isPromise(result2)) {
+                results[responseName] = void 0;
+                const promise = result2.then((resolved) => {
+                  results[responseName] = resolved;
+                });
+                promises.push(promise);
+              } else {
+                results[responseName] = result2;
+              }
+            }
+          }
+          if (!promises.length) {
+            return results;
+          }
+          return resolveAfterAll(results, promises);
+        }
+        executeField(
+          exeContext,
+          parentType,
+          source,
+          fieldNodes,
+          path,
+          responseNode
+        ) {
+          const fieldContext = this.getFieldContext(parentType, fieldNodes);
+          if (!fieldContext) {
+            return;
+          }
+          const returnType = fieldContext.returnType;
+          const info2 = this.buildResolveInfo(exeContext, fieldContext, path);
+          try {
+            const result2 = exeContext.resolveField(
+              exeContext,
+              fieldContext,
+              source,
+              info2
+            );
+            let completed;
+            const valueCompleter = this.getValueCompleter(returnType);
+            if (isPromise(result2)) {
+              completed = result2.then((resolved) =>
+                valueCompleter(
+                  exeContext,
+                  fieldContext,
+                  info2,
+                  path,
+                  resolved,
+                  responseNode
+                )
+              );
+            } else {
+              completed = valueCompleter(
+                exeContext,
+                fieldContext,
+                info2,
+                path,
+                result2,
+                responseNode
+              );
+            }
+            if (isPromise(completed)) {
+              return completed.then(void 0, (rawError) =>
+                this.handleRawError(
+                  rawError,
+                  fieldNodes,
+                  path,
+                  returnType,
+                  responseNode.errors
+                )
+              );
+            }
+            return completed;
+          } catch (rawError) {
+            return this.handleRawError(
+              rawError,
+              fieldNodes,
+              path,
+              returnType,
+              responseNode.errors
+            );
+          }
+        }
+        buildResolveInfo(exeContext, fieldContext, path) {
+          const { fieldName, fieldNodes, returnType, parentType } =
+            fieldContext;
+          const { _schema: schema, _executorSchema: executorSchema } = this;
+          const { fragments, rootValue, operation, variableValues } =
+            exeContext;
+          return {
+            fieldName,
+            fieldNodes,
+            returnType,
+            parentType,
+            path,
+            schema,
+            executorSchema,
+            fragments,
+            rootValue,
+            operation,
+            variableValues,
+          };
+        }
+        toLocatedError(rawError, fieldNodes, path) {
+          return locatedError(toError(rawError), fieldNodes, pathToArray(path));
+        }
+        handleRawError(rawError, fieldNodes, path, returnType, errors2) {
+          const error2 = this.toLocatedError(rawError, fieldNodes, path);
+          if (this._executorSchema.isNonNullType(returnType)) {
+            throw error2;
+          }
+          errors2.push(error2);
+          return null;
+        }
+        buildNullableValueCompleter(valueCompleter) {
+          return (
+            exeContext,
+            fieldContext,
+            info2,
+            path,
+            result2,
+            responseNode
+          ) => {
+            if (result2 instanceof Error) {
+              throw result2;
+            }
+            if (result2 == null) {
+              return null;
+            }
+            return valueCompleter(
+              exeContext,
+              fieldContext,
+              info2,
+              path,
+              result2,
+              responseNode
+            );
+          };
+        }
+        _getValueCompleter(returnType) {
+          if (this._executorSchema.isNonNullType(returnType)) {
+            return (
+              exeContext,
+              fieldContext,
+              info2,
+              path,
+              result2,
+              responseNode
+            ) => {
+              const innerValueCompleter = this.getValueCompleter(
+                returnType.ofType
+              );
+              const completed = innerValueCompleter(
+                exeContext,
+                fieldContext,
+                info2,
+                path,
+                result2,
+                responseNode
+              );
+              if (completed === null) {
+                throw new Error(
+                  `Cannot return null for non-nullable field ${info2.parentType.name}.${info2.fieldName}.`
+                );
+              }
+              return completed;
+            };
+          }
+          if (this._executorSchema.isListType(returnType)) {
+            return this.buildNullableValueCompleter(
+              (exeContext, fieldContext, info2, path, result2, responseNode) =>
+                this.completeListValue(
+                  exeContext,
+                  returnType,
+                  fieldContext,
+                  info2,
+                  path,
+                  result2,
+                  responseNode
+                )
+            );
+          }
+          if (this._executorSchema.isLeafType(returnType)) {
+            return this.buildNullableValueCompleter(
+              (
+                _exeContext,
+                _fieldContext,
+                _info,
+                _path,
+                result2,
+                _responseNode
+              ) => this.completeLeafValue(returnType, result2)
+            );
+          }
+          if (this._executorSchema.isAbstractType(returnType)) {
+            return this.buildNullableValueCompleter(
+              (exeContext, fieldContext, info2, path, result2, responseNode) =>
+                this.completeAbstractValue(
+                  exeContext,
+                  returnType,
+                  fieldContext,
+                  info2,
+                  path,
+                  result2,
+                  responseNode
+                )
+            );
+          }
+          if (this._executorSchema.isObjectType(returnType)) {
+            return this.buildNullableValueCompleter(
+              (exeContext, fieldContext, info2, path, result2, responseNode) =>
+                this.completeObjectValue(
+                  exeContext,
+                  returnType,
+                  fieldContext,
+                  info2,
+                  path,
+                  result2,
+                  responseNode
+                )
+            );
+          }
+          invariant(
+            false,
+            "Cannot complete value of unexpected output type: " +
+              inspect(returnType)
+          );
+        }
+        completeListValue(
+          exeContext,
+          returnType,
+          fieldContext,
+          info2,
+          path,
+          result2,
+          responseNode
+        ) {
+          const itemType = returnType.ofType;
+          const valueCompleter = this.getValueCompleter(itemType);
+          const completedResults = [];
+          const promises = [];
+          const stream = exeContext.getStreamValues(
+            exeContext.variableValues,
+            fieldContext
+          );
+          if (isAsyncIterable(result2)) {
+            const iterator2 = result2[Symbol.asyncIterator]();
+            return this.completeAsyncIteratorValue(
+              exeContext,
+              itemType,
+              fieldContext,
+              info2,
+              valueCompleter,
+              path,
+              iterator2,
+              responseNode,
+              stream,
+              completedResults,
+              promises
+            );
+          }
+          if (!isIterableObject(result2)) {
+            throw new GraphQLError(
+              `Expected Iterable, but did not find one for field "${info2.parentType.name}.${info2.fieldName}".`
+            );
+          }
+          const iterator = result2[Symbol.iterator]();
+          this.completeIteratorValue(
+            exeContext,
+            itemType,
+            fieldContext,
+            info2,
+            valueCompleter,
+            path,
+            iterator,
+            responseNode,
+            stream,
+            completedResults,
+            promises
+          );
+          return promises.length
+            ? resolveAfterAll(completedResults, promises)
+            : completedResults;
+        }
+        getStreamValues(variableValues, fieldContext) {
+          const stream = getDirectiveValues(
+            this._executorSchema,
+            GraphQLStreamDirective,
+            fieldContext.initialFieldNode,
+            variableValues
+          );
+          if (!stream) {
+            return;
+          }
+          if (stream.if === false) {
+            return;
+          }
+          const { initialCount, maxChunkSize, maxInterval, inParallel, label } =
+            stream;
+          typeof initialCount === "number" ||
+            invariant(false, "initialCount must be a number");
+          initialCount >= 0 ||
+            invariant(
+              false,
+              "initialCount must be an integer greater than or equal to zero"
+            );
+          typeof maxChunkSize === "number" ||
+            invariant(false, "maxChunkSize must be a number");
+          maxChunkSize >= 1 ||
+            invariant(
+              false,
+              "maxChunkSize must be an integer greater than or equal to one"
+            );
+          if (maxInterval != null) {
+            typeof maxInterval === "number" ||
+              invariant(false, "maxInterval must be a number");
+            maxInterval >= 0 ||
+              invariant(
+                false,
+                "maxInterval must be an integer greater than or equal to zero"
+              );
+          }
+          return {
+            initialCount,
+            maxChunkSize,
+            maxInterval,
+            inParallel: inParallel === true,
+            label: typeof label === "string" ? label : void 0,
+          };
+        }
+        completeIteratorValue(
+          exeContext,
+          itemType,
+          fieldContext,
+          info2,
+          valueCompleter,
+          path,
+          iterator,
+          responseNode,
+          stream,
+          completedResults,
+          promises
+        ) {
+          if (stream) {
+            this.completeIteratorValueWithStream(
+              exeContext,
+              itemType,
+              fieldContext,
+              info2,
+              valueCompleter,
+              path,
+              iterator,
+              responseNode,
+              stream,
+              completedResults,
+              0,
+              promises
+            );
+            return;
+          }
+          this.completeIteratorValueWithoutStream(
+            exeContext,
+            itemType,
+            fieldContext,
+            info2,
+            valueCompleter,
+            path,
+            iterator,
+            responseNode,
+            completedResults,
+            0,
+            promises
+          );
+        }
+        onNewBundleContext(state, context, responseNode) {
+          state.pendingPushes++;
+          state.pendingStreamResults--;
+          context.responseNodes.push(responseNode);
+          return context;
+        }
+        onSubsequentResponseNode(state, context, responseNode) {
+          state.pendingStreamResults--;
+          context.responseNodes.push(responseNode);
+        }
+        createBundler(
+          exeContext,
+          parentResponseNode,
+          initialCount,
+          maxChunkSize,
+          maxInterval,
+          resultToNewDataContext,
+          indexToNewErrorContext,
+          onSubsequentData,
+          onSubsequentError,
+          dataContextToIncrementalResult,
+          errorContextToIncrementalResult
+        ) {
+          return new Bundler({
+            initialIndex: initialCount,
+            maxBundleSize: maxChunkSize,
+            maxInterval,
+            createDataBundleContext: (index, result2) =>
+              this.onNewBundleContext(
+                exeContext.state,
+                resultToNewDataContext(index, result2),
+                result2.responseNode
+              ),
+            createErrorBundleContext: (index, responseNode) =>
+              this.onNewBundleContext(
+                exeContext.state,
+                indexToNewErrorContext(index),
+                responseNode
+              ),
+            onSubsequentData: (index, result2, context) => {
+              this.onSubsequentResponseNode(
+                exeContext.state,
+                context,
+                result2.responseNode
+              );
+              onSubsequentData(index, result2, context);
+            },
+            onSubsequentError: (index, responseNode, context) => {
+              this.onSubsequentResponseNode(
+                exeContext.state,
+                context,
+                responseNode
+              );
+              onSubsequentError(index, context);
+            },
+            onDataBundle: (context) =>
+              exeContext.publisher.queue(
+                context.responseNodes,
+                dataContextToIncrementalResult(context),
+                parentResponseNode
+              ),
+            onErrorBundle: (context) =>
+              exeContext.publisher.queue(
+                context.responseNodes,
+                errorContextToIncrementalResult(context),
+                parentResponseNode
+              ),
+          });
+        }
+        createStreamContext(
+          exeContext,
+          initialCount,
+          maxChunkSize,
+          maxInterval,
+          inParallel,
+          path,
+          label,
+          parentResponseNode
+        ) {
+          if (maxChunkSize === 1) {
+            const bundler = this.createBundler(
+              exeContext,
+              parentResponseNode,
+              initialCount,
+              maxChunkSize,
+              maxInterval,
+              (index, result2) => ({
+                responseNodes: [],
+                parentResponseNode,
+                result: result2.data,
+                atIndex: index,
+              }),
+              (index) => ({
+                responseNodes: [],
+                parentResponseNode,
+                atIndex: index,
+              }),
+              () => {},
+              () => {},
+              (context) => ({
+                responseContext: context,
+                data: context.result,
+                path: addPath(path, context.atIndex, void 0),
+                label,
+              }),
+              (context) => ({
+                responseContext: context,
+                data: null,
+                path: addPath(path, context.atIndex, void 0),
+                label,
+              })
+            );
+            return {
+              initialCount,
+              path,
+              bundler: inParallel
+                ? bundler
+                : getSequentialBundler(initialCount, bundler),
+            };
+          }
+          if (inParallel) {
+            return {
+              initialCount,
+              path,
+              bundler: this.createBundler(
+                exeContext,
+                parentResponseNode,
+                initialCount,
+                maxChunkSize,
+                maxInterval,
+                (index, result2) => ({
+                  responseNodes: [],
+                  parentResponseNode,
+                  atIndices: [index],
+                  results: [result2.data],
+                }),
+                (index) => ({
+                  responseNodes: [],
+                  parentResponseNode,
+                  atIndices: [index],
+                }),
+                (index, result2, context) => {
+                  context.results.push(result2.data);
+                  context.atIndices.push(index);
+                },
+                (index, context) => {
+                  context.atIndices.push(index);
+                },
+                (context) => ({
+                  responseContext: context,
+                  data: context.results,
+                  path,
+                  atIndices: context.atIndices,
+                  label,
+                }),
+                (context) => ({
+                  responseContext: context,
+                  data: null,
+                  path,
+                  atIndices: context.atIndices,
+                  label,
+                })
+              ),
+            };
+          }
+          return {
+            initialCount,
+            path,
+            bundler: getSequentialBundler(
+              initialCount,
+              this.createBundler(
+                exeContext,
+                parentResponseNode,
+                initialCount,
+                maxChunkSize,
+                maxInterval,
+                (index, result2) => ({
+                  responseNodes: [],
+                  parentResponseNode,
+                  atIndex: index,
+                  results: [result2.data],
+                }),
+                (index) => ({
+                  responseNodes: [],
+                  parentResponseNode,
+                  atIndex: index,
+                }),
+                (_index, result2, context) => {
+                  context.results.push(result2.data);
+                },
+                () => {},
+                (context) => ({
+                  responseContext: context,
+                  data: context.results,
+                  path,
+                  atIndex: context.atIndex,
+                  label,
+                }),
+                (context) => ({
+                  responseContext: context,
+                  data: null,
+                  path,
+                  atIndex: context.atIndex,
+                  label,
+                })
+              )
+            ),
+          };
+        }
+        completeIteratorValueWithStream(
+          exeContext,
+          itemType,
+          fieldContext,
+          info2,
+          valueCompleter,
+          path,
+          iterator,
+          responseNode,
+          stream,
+          completedResults,
+          _index,
+          promises
+        ) {
+          const initialCount = stream.initialCount;
+          let index = _index;
+          while (true) {
+            if (index >= initialCount) {
+              const { maxChunkSize, maxInterval, inParallel, label } = stream;
+              const streamContext = this.createStreamContext(
+                exeContext,
+                initialCount,
+                maxChunkSize,
+                maxInterval,
+                inParallel,
+                path,
+                label,
+                responseNode
+              );
+              const nextIndex = this.addIteratorValue(
+                index,
+                iterator,
+                exeContext,
+                itemType,
+                fieldContext,
+                info2,
+                valueCompleter,
+                streamContext
+              );
+              streamContext.bundler.setTotal(nextIndex);
+              break;
+            }
+            const iteration = iterator.next();
+            if (iteration.done) {
+              return;
+            }
+            const itemPath = addPath(path, index, void 0);
+            this.completeListItemValue(
+              completedResults,
+              index,
+              promises,
+              iteration.value,
+              exeContext,
+              itemType,
+              valueCompleter,
+              fieldContext,
+              info2,
+              itemPath,
+              responseNode
+            );
+            index++;
+          }
+        }
+        completeIteratorValueWithoutStream(
+          exeContext,
+          itemType,
+          fieldContext,
+          info2,
+          valueCompleter,
+          path,
+          iterator,
+          responseNode,
+          completedResults,
+          _index,
+          promises
+        ) {
+          let index = _index;
+          while (true) {
+            const iteration = iterator.next();
+            if (iteration.done) {
+              return index;
+            }
+            const itemPath = addPath(path, index, void 0);
+            this.completeListItemValue(
+              completedResults,
+              index,
+              promises,
+              iteration.value,
+              exeContext,
+              itemType,
+              valueCompleter,
+              fieldContext,
+              info2,
+              itemPath,
+              responseNode
+            );
+            index++;
+          }
+        }
+        async completeAsyncIteratorValue(
+          exeContext,
+          itemType,
+          fieldContext,
+          info2,
+          valueCompleter,
+          path,
+          iterator,
+          responseNode,
+          stream,
+          completedResults,
+          promises
+        ) {
+          if (stream) {
+            await this.completeAsyncIteratorValueWithStream(
+              exeContext,
+              itemType,
+              fieldContext,
+              info2,
+              valueCompleter,
+              path,
+              iterator,
+              responseNode,
+              stream,
+              completedResults,
+              promises
+            );
+          } else {
+            await this.completeAsyncIteratorValueWithoutStream(
+              exeContext,
+              itemType,
+              fieldContext,
+              info2,
+              valueCompleter,
+              path,
+              iterator,
+              responseNode,
+              completedResults,
+              promises
+            );
+          }
+          return promises.length
+            ? resolveAfterAll(completedResults, promises)
+            : completedResults;
+        }
+        async completeAsyncIteratorValueWithStream(
+          exeContext,
+          itemType,
+          fieldContext,
+          info2,
+          valueCompleter,
+          path,
+          iterator,
+          responseNode,
+          stream,
+          completedResults,
+          promises
+        ) {
+          const initialCount = stream.initialCount;
+          let index = 0;
+          try {
+            while (true) {
+              if (index >= initialCount) {
+                const { maxChunkSize, maxInterval, inParallel, label } = stream;
+                const streamContext = this.createStreamContext(
+                  exeContext,
+                  initialCount,
+                  maxChunkSize,
+                  maxInterval,
+                  inParallel,
+                  path,
+                  label,
+                  responseNode
+                );
+                this.addAsyncIteratorValue(
+                  index,
+                  iterator,
+                  exeContext,
+                  itemType,
+                  fieldContext,
+                  info2,
+                  valueCompleter,
+                  streamContext
+                );
+                return;
+              }
+              const iteration = await iterator.next();
+              if (iteration.done) {
+                break;
+              }
+              const itemPath = addPath(path, index, void 0);
+              this.completeListItemValue(
+                completedResults,
+                index,
+                promises,
+                iteration.value,
+                exeContext,
+                itemType,
+                valueCompleter,
+                fieldContext,
+                info2,
+                itemPath,
+                responseNode
+              );
+              index++;
+            }
+          } catch (rawError) {
+            const itemPath = addPath(path, index, void 0);
+            completedResults.push(
+              this.handleRawError(
+                rawError,
+                fieldContext.fieldNodes,
+                itemPath,
+                itemType,
+                responseNode.errors
+              )
+            );
+          }
+        }
+        async completeAsyncIteratorValueWithoutStream(
+          exeContext,
+          itemType,
+          fieldContext,
+          info2,
+          valueCompleter,
+          path,
+          iterator,
+          responseNode,
+          completedResults,
+          promises
+        ) {
+          let index = 0;
+          try {
+            while (true) {
+              const iteration = await iterator.next();
+              if (iteration.done) {
+                break;
+              }
+              const itemPath = addPath(path, index, void 0);
+              this.completeListItemValue(
+                completedResults,
+                index,
+                promises,
+                iteration.value,
+                exeContext,
+                itemType,
+                valueCompleter,
+                fieldContext,
+                info2,
+                itemPath,
+                responseNode
+              );
+              index++;
+            }
+          } catch (rawError) {
+            const itemPath = addPath(path, index, void 0);
+            completedResults.push(
+              this.handleRawError(
+                rawError,
+                fieldContext.fieldNodes,
+                itemPath,
+                itemType,
+                responseNode.errors
+              )
+            );
+          }
+        }
+        completeListItemValue(
+          completedResults,
+          index,
+          promises,
+          item,
+          exeContext,
+          itemType,
+          valueCompleter,
+          fieldContext,
+          info2,
+          itemPath,
+          responseNode
+        ) {
+          try {
+            let completedItem;
+            if (isPromise(item)) {
+              completedItem = item.then((resolved) =>
+                valueCompleter(
+                  exeContext,
+                  fieldContext,
+                  info2,
+                  itemPath,
+                  resolved,
+                  responseNode
+                )
+              );
+            } else {
+              completedItem = valueCompleter(
+                exeContext,
+                fieldContext,
+                info2,
+                itemPath,
+                item,
+                responseNode
+              );
+            }
+            completedResults[index] = completedItem;
+            if (!isPromise(completedItem)) {
+              return;
+            }
+            const promise = completedItem
+              .then(void 0, (rawError) =>
+                this.handleRawError(
+                  rawError,
+                  fieldContext.fieldNodes,
+                  itemPath,
+                  itemType,
+                  responseNode.errors
+                )
+              )
+              .then((resolved) => {
+                completedResults[index] = resolved;
+              });
+            promises.push(promise);
+          } catch (rawError) {
+            completedResults[index] = this.handleRawError(
+              rawError,
+              fieldContext.fieldNodes,
+              itemPath,
+              itemType,
+              responseNode.errors
+            );
+          }
+        }
+        completeLeafValue(returnType, result2) {
+          const serializedResult = returnType.serialize(result2);
+          if (serializedResult == null) {
+            throw new Error(
+              `Expected \`${inspect(returnType)}.serialize(${inspect(
+                result2
+              )})\` to return non-nullable value, returned: ${inspect(
+                serializedResult
+              )}`
+            );
+          }
+          return serializedResult;
+        }
+        completeAbstractValue(
+          exeContext,
+          returnType,
+          fieldContext,
+          info2,
+          path,
+          result2,
+          responseNode
+        ) {
+          var _returnType$resolveTy;
+          const resolveTypeFn =
+            (_returnType$resolveTy = returnType.resolveType) !== null &&
+            _returnType$resolveTy !== void 0
+              ? _returnType$resolveTy
+              : exeContext.typeResolver;
+          const contextValue = exeContext.contextValue;
+          const runtimeType = resolveTypeFn(
+            result2,
+            contextValue,
+            info2,
+            returnType
+          );
+          if (isPromise(runtimeType)) {
+            return runtimeType.then((resolvedRuntimeType) =>
+              this.completeObjectValue(
+                exeContext,
+                this.ensureValidRuntimeType(
+                  resolvedRuntimeType,
+                  returnType,
+                  fieldContext,
+                  result2
+                ),
+                fieldContext,
+                info2,
+                path,
+                result2,
+                responseNode
+              )
+            );
+          }
+          return this.completeObjectValue(
+            exeContext,
+            this.ensureValidRuntimeType(
+              runtimeType,
+              returnType,
+              fieldContext,
+              result2
+            ),
+            fieldContext,
+            info2,
+            path,
+            result2,
+            responseNode
+          );
+        }
+        ensureValidRuntimeType(
+          runtimeTypeOrName,
+          returnType,
+          fieldContext,
+          result2
+        ) {
+          if (runtimeTypeOrName == null) {
+            throw new GraphQLError(
+              `Abstract type "${returnType.name}" must resolve to an Object type at runtime for field "${fieldContext.parentType.name}.${fieldContext.fieldName}". Either the "${returnType.name}" type should provide a "resolveType" function or each possible type should provide an "isTypeOf" function.`,
+              fieldContext.fieldNodes
+            );
+          }
+          const runtimeTypeName =
+            typeof runtimeTypeOrName === "object" &&
+            this._executorSchema.isNamedType(runtimeTypeOrName)
+              ? runtimeTypeOrName.name
+              : runtimeTypeOrName;
+          if (typeof runtimeTypeName !== "string") {
+            throw new GraphQLError(
+              `Abstract type "${
+                returnType.name
+              }" must resolve to an Object type at runtime for field "${
+                fieldContext.parentType.name
+              }.${fieldContext.fieldName}" with value ${inspect(
+                result2
+              )}, received "${inspect(runtimeTypeName)}".`
+            );
+          }
+          const runtimeType =
+            this._executorSchema.getNamedType(runtimeTypeName);
+          if (runtimeType == null) {
+            throw new GraphQLError(
+              `Abstract type "${returnType.name}" was resolved to a type "${runtimeTypeName}" that does not exist inside the schema.`,
+              fieldContext.fieldNodes
+            );
+          }
+          if (!this._executorSchema.isObjectType(runtimeType)) {
+            throw new GraphQLError(
+              `Abstract type "${returnType.name}" was resolved to a non-object type "${runtimeTypeName}".`,
+              fieldContext.fieldNodes
+            );
+          }
+          if (!this._executorSchema.isSubType(returnType, runtimeType)) {
+            throw new GraphQLError(
+              `Runtime Object type "${runtimeType.name}" is not a possible type for "${returnType.name}".`,
+              fieldContext.fieldNodes
+            );
+          }
+          return runtimeType;
+        }
+        completeObjectValue(
+          exeContext,
+          returnType,
+          fieldContext,
+          info2,
+          path,
+          result2,
+          responseNode
+        ) {
+          if (returnType.isTypeOf) {
+            const isTypeOf = returnType.isTypeOf(
+              result2,
+              exeContext.contextValue,
+              info2
+            );
+            if (isPromise(isTypeOf)) {
+              return isTypeOf.then((resolvedIsTypeOf) => {
+                if (!resolvedIsTypeOf) {
+                  throw this.invalidReturnTypeError(
+                    returnType,
+                    result2,
+                    fieldContext.fieldNodes
+                  );
+                }
+                return this.collectAndExecuteSubfields(
+                  exeContext,
+                  returnType,
+                  fieldContext,
+                  path,
+                  result2,
+                  responseNode
+                );
+              });
+            }
+            if (!isTypeOf) {
+              throw this.invalidReturnTypeError(
+                returnType,
+                result2,
+                fieldContext.fieldNodes
+              );
+            }
+          }
+          return this.collectAndExecuteSubfields(
+            exeContext,
+            returnType,
+            fieldContext,
+            path,
+            result2,
+            responseNode
+          );
+        }
+        invalidReturnTypeError(returnType, result2, fieldNodes) {
+          return new GraphQLError(
+            `Expected value of type "${returnType.name}" but got: ${inspect(
+              result2
+            )}.`,
+            fieldNodes
+          );
+        }
+        collectAndExecuteSubfields(
+          exeContext,
+          returnType,
+          fieldContext,
+          path,
+          result2,
+          responseNode
+        ) {
+          const { subFieldCollector } = exeContext;
+          const { fields: subFieldNodes, patches: subPatches } =
+            subFieldCollector(returnType, fieldContext.fieldNodes);
+          const subFields = this.executeFields(
+            exeContext,
+            returnType,
+            result2,
+            path,
+            subFieldNodes,
+            responseNode
+          );
+          this.addPatches(
+            exeContext,
+            subPatches,
+            returnType,
+            result2,
+            path,
+            responseNode
+          );
+          return subFields;
+        }
+        _getFieldDef(fieldName, parentType) {
+          const fieldDef = parentType.getFields()[fieldName];
+          if (fieldDef) {
+            return fieldDef;
+          }
+          if (
+            fieldName === SchemaMetaFieldDef.name &&
+            this._executorSchema.getRootType("query") === parentType
+          ) {
+            return SchemaMetaFieldDef;
+          } else if (
+            fieldName === TypeMetaFieldDef.name &&
+            this._executorSchema.getRootType("query") === parentType
+          ) {
+            return TypeMetaFieldDef;
+          } else if (
+            fieldName === DirectiveMetaFieldDef.name &&
+            this._executorSchema.getRootType("query") === parentType
+          ) {
+            return DirectiveMetaFieldDef;
+          } else if (fieldName === TypeNameMetaFieldDef.name) {
+            return TypeNameMetaFieldDef;
+          }
+        }
+        _getFieldContext(parentType, fieldNodes) {
+          const initialFieldNode = fieldNodes[0];
+          const fieldName = initialFieldNode.name.value;
+          const fieldDef = this._getFieldDef(fieldName, parentType);
+          if (!fieldDef) {
+            return;
+          }
+          return {
+            fieldDef,
+            initialFieldNode,
+            fieldName: fieldDef.name,
+            fieldNodes,
+            returnType: fieldDef.type,
+            parentType,
+          };
+        }
+        async executeSubscriptionImpl(exeContext) {
+          return this.executeOperationImpl(
+            exeContext,
+            this.executeRootSubscriptionFields.bind(this),
+            this.buildSubscribeResponse.bind(this)
+          );
+        }
+        async executeRootSubscriptionFields(
+          exeContext,
+          parentType,
+          sourceValue,
+          path,
+          fields,
+          responseNode
+        ) {
+          const [responseName, fieldNodes] = [...fields.entries()][0];
+          const fieldPath = addPath(path, responseName, parentType.name);
+          return this.executeRootSubscriptionField(
+            exeContext,
+            parentType,
+            sourceValue,
+            fieldNodes,
+            fieldPath,
+            responseNode
+          );
+        }
+        buildCreateSourceEventStreamResponse(exeContext, eventStream) {
+          const { rootResponseNode } = exeContext;
+          const errors2 = rootResponseNode.errors;
+          if (errors2.length) {
+            return {
+              errors: errors2,
+            };
+          }
+          if (!isAsyncIterable(eventStream)) {
+            throw new Error(
+              `Subscription field must return Async Iterable. Received: ${inspect(
+                eventStream
+              )}.`
+            );
+          }
+          return eventStream;
+        }
+        buildSubscribeResponse(exeContext, _eventStream) {
+          const eventStream = this.buildCreateSourceEventStreamResponse(
+            exeContext,
+            _eventStream
+          );
+          if (!isAsyncIterable(eventStream)) {
+            return eventStream;
+          }
+          const mapSourceToResponse = (payload) => {
+            const perPayloadExecutionContext =
+              this.buildPerPayloadExecutionContext(exeContext, payload);
+            return this.executeQueryImpl(perPayloadExecutionContext);
+          };
+          return flattenAsyncIterable(
+            mapAsyncIterable(eventStream, mapSourceToResponse)
+          );
+        }
+        async createSourceEventStreamImpl(exeContext) {
+          return this.executeOperationImpl(
+            exeContext,
+            this.executeRootSubscriptionFields.bind(this),
+            this.buildCreateSourceEventStreamResponse.bind(this)
+          );
+        }
+        async executeRootSubscriptionField(
+          exeContext,
+          parentType,
+          sourceValue,
+          fieldNodes,
+          fieldPath,
+          responseNode
+        ) {
+          const fieldContext = this.getFieldContext(parentType, fieldNodes);
+          if (!fieldContext) {
+            const fieldName = fieldNodes[0].name.value;
+            responseNode.errors.push(
+              new GraphQLError(
+                `The subscription field "${fieldName}" is not defined.`,
+                fieldNodes
+              )
+            );
+            return null;
+          }
+          const info2 = this.buildResolveInfo(
+            exeContext,
+            fieldContext,
+            fieldPath
+          );
+          try {
+            const eventStream = await exeContext.resolveField(
+              exeContext,
+              fieldContext,
+              sourceValue,
+              info2
+            );
+            if (eventStream instanceof Error) {
+              throw eventStream;
+            }
+            return eventStream;
+          } catch (rawError) {
+            responseNode.errors.push(
+              this.toLocatedError(rawError, fieldNodes, fieldPath)
+            );
+            return null;
+          }
+        }
+        addPatches(
+          exeContext,
+          patches,
+          parentType,
+          source,
+          path,
+          parentResponseNode
+        ) {
+          const { state, publisher } = exeContext;
+          for (const patch of patches) {
+            state.pendingPushes++;
+            const { label, fields: patchFields } = patch;
+            const errors2 = [];
+            const responseNode = {
+              errors: errors2,
+            };
+            const responseContext = {
+              responseNodes: [responseNode],
+              parentResponseNode,
+            };
+            Promise.resolve(source)
+              .then(() =>
+                this.executeFields(
+                  exeContext,
+                  parentType,
+                  source,
+                  path,
+                  patchFields,
+                  responseNode
+                )
+              )
+              .then(
+                (data) =>
+                  publisher.queue(
+                    responseContext.responseNodes,
+                    {
+                      responseContext,
+                      data,
+                      path,
+                      label,
+                    },
+                    responseContext.parentResponseNode
+                  ),
+                (error2) => {
+                  errors2.push(error2);
+                  publisher.queue(
+                    responseContext.responseNodes,
+                    {
+                      responseContext,
+                      data: null,
+                      path,
+                      label,
+                    },
+                    responseContext.parentResponseNode
+                  );
+                }
+              );
+          }
+        }
+        addIteratorValue(
+          initialIndex,
+          iterator,
+          exeContext,
+          itemType,
+          fieldContext,
+          info2,
+          valueCompleter,
+          streamContext
+        ) {
+          let index = initialIndex;
+          let iteration = iterator.next();
+          while (!iteration.done) {
+            this.addValue(
+              iteration.value,
+              exeContext,
+              itemType,
+              fieldContext,
+              info2,
+              valueCompleter,
+              index,
+              streamContext
+            );
+            index++;
+            iteration = iterator.next();
+          }
+          return index;
+        }
+        async addAsyncIteratorValue(
+          initialIndex,
+          iterator,
+          exeContext,
+          itemType,
+          fieldContext,
+          info2,
+          valueCompleter,
+          streamContext
+        ) {
+          exeContext.state.iterators.add(iterator);
+          let index = initialIndex;
+          try {
+            let iteration = await iterator.next();
+            while (!iteration.done) {
+              this.addValue(
+                iteration.value,
+                exeContext,
+                itemType,
+                fieldContext,
+                info2,
+                valueCompleter,
+                index,
+                streamContext
+              );
+              index++;
+              iteration = await iterator.next();
+            }
+            streamContext.bundler.setTotal(index);
+          } catch (rawError) {
+            exeContext.state.pendingStreamResults++;
+            this.handleRawStreamError(
+              fieldContext,
+              itemType,
+              streamContext,
+              rawError,
+              index
+            );
+            streamContext.bundler.setTotal(index + 1);
+          }
+          this.closeAsyncIterator(exeContext, iterator);
+        }
+        handleRawStreamError(
+          fieldContext,
+          itemType,
+          streamContext,
+          rawError,
+          index
+        ) {
+          const { path } = streamContext;
+          const itemPath = addPath(path, index, void 0);
+          const error2 = this.toLocatedError(
+            rawError,
+            fieldContext.fieldNodes,
+            itemPath
+          );
+          if (this._executorSchema.isNonNullType(itemType)) {
+            streamContext.bundler.queueError(index, {
+              errors: [error2],
+            });
+          } else {
+            streamContext.bundler.queueData(index, {
+              responseNode: {
+                errors: [error2],
+              },
+              data: null,
+            });
+          }
+        }
+        addValue(
+          value,
+          exeContext,
+          itemType,
+          fieldContext,
+          info2,
+          valueCompleter,
+          index,
+          streamContext
+        ) {
+          const itemPath = addPath(streamContext.path, index, void 0);
+          const responseNode = {
+            errors: [],
+          };
+          exeContext.state.pendingStreamResults++;
+          Promise.resolve(value)
+            .then((resolved) =>
+              valueCompleter(
+                exeContext,
+                fieldContext,
+                info2,
+                itemPath,
+                resolved,
+                responseNode
+              )
+            )
+            .then(
+              (data) =>
+                streamContext.bundler.queueData(index, {
+                  responseNode,
+                  data,
+                }),
+              (rawError) =>
+                this.handleRawStreamError(
+                  fieldContext,
+                  itemType,
+                  streamContext,
+                  rawError,
+                  index
+                )
+            );
+        }
+        closeAsyncIterator(exeContext, iterator) {
+          const { state, publisher } = exeContext;
+          state.iterators.delete(iterator);
+          if (!this.hasNext(exeContext.state)) {
+            publisher.stop({
+              hasNext: false,
+            });
+          }
+        }
+        hasNext(state) {
+          return (
+            state.pendingPushes > 0 ||
+            state.pendingStreamResults > 0 ||
+            state.iterators.size > 0
+          );
+        }
+        collectFieldsImpl(
+          fragments,
+          variableValues,
+          getDeferValues,
+          runtimeType,
+          selectionSet,
+          fields,
+          patches,
+          visitedFragmentNames
+        ) {
+          for (const selection of selectionSet.selections) {
+            switch (selection.kind) {
+              case Kind.FIELD: {
+                if (!this.shouldIncludeNode(variableValues, selection)) {
+                  continue;
+                }
+                const name2 = this.getFieldEntryKey(selection);
+                const fieldList = fields.get(name2);
+                if (fieldList !== void 0) {
+                  fields.set(name2, this.updateFieldList(fieldList, selection));
+                } else {
+                  fields.set(name2, this.createFieldList(selection));
+                }
+                break;
+              }
+              case Kind.INLINE_FRAGMENT: {
+                if (
+                  !this.shouldIncludeNode(variableValues, selection) ||
+                  !this.doesFragmentConditionMatch(selection, runtimeType)
+                ) {
+                  continue;
+                }
+                const defer = getDeferValues(variableValues, selection);
+                if (defer) {
+                  const patchFields = /* @__PURE__ */ new Map();
+                  this.collectFieldsImpl(
+                    fragments,
+                    variableValues,
+                    getDeferValues,
+                    runtimeType,
+                    selection.selectionSet,
+                    patchFields,
+                    patches,
+                    visitedFragmentNames
+                  );
+                  patches.push({
+                    label: defer.label,
+                    fields: patchFields,
+                  });
+                } else {
+                  this.collectFieldsImpl(
+                    fragments,
+                    variableValues,
+                    getDeferValues,
+                    runtimeType,
+                    selection.selectionSet,
+                    fields,
+                    patches,
+                    visitedFragmentNames
+                  );
+                }
+                break;
+              }
+              case Kind.FRAGMENT_SPREAD: {
+                const fragName = selection.name.value;
+                if (!this.shouldIncludeNode(variableValues, selection)) {
+                  continue;
+                }
+                const defer = getDeferValues(variableValues, selection);
+                if (visitedFragmentNames.has(fragName) && !defer) {
+                  continue;
+                }
+                const fragment = fragments[fragName];
+                if (
+                  !fragment ||
+                  !this.doesFragmentConditionMatch(fragment, runtimeType)
+                ) {
+                  continue;
+                }
+                if (defer) {
+                  const patchFields = /* @__PURE__ */ new Map();
+                  this.collectFieldsImpl(
+                    fragments,
+                    variableValues,
+                    getDeferValues,
+                    runtimeType,
+                    fragment.selectionSet,
+                    patchFields,
+                    patches,
+                    visitedFragmentNames
+                  );
+                  patches.push({
+                    label: defer.label,
+                    fields: patchFields,
+                  });
+                } else {
+                  visitedFragmentNames.add(fragName);
+                  this.collectFieldsImpl(
+                    fragments,
+                    variableValues,
+                    getDeferValues,
+                    runtimeType,
+                    fragment.selectionSet,
+                    fields,
+                    patches,
+                    visitedFragmentNames
+                  );
+                }
+                break;
+              }
+            }
+          }
+        }
+        getDeferValues(variableValues, node) {
+          const defer = getDirectiveValues(
+            this._executorSchema,
+            GraphQLDeferDirective,
+            node,
+            variableValues
+          );
+          if (!defer) {
+            return;
+          }
+          if (defer.if === false) {
+            return;
+          }
+          return {
+            label: typeof defer.label === "string" ? defer.label : void 0,
+          };
+        }
+        shouldIncludeNode(variableValues, node) {
+          const skip2 = getDirectiveValues(
+            this._executorSchema,
+            GraphQLSkipDirective,
+            node,
+            variableValues
+          );
+          if (
+            (skip2 === null || skip2 === void 0 ? void 0 : skip2.if) === true
+          ) {
+            return false;
+          }
+          const include = getDirectiveValues(
+            this._executorSchema,
+            GraphQLIncludeDirective,
+            node,
+            variableValues
+          );
+          if (
+            (include === null || include === void 0 ? void 0 : include.if) ===
+            false
+          ) {
+            return false;
+          }
+          return true;
+        }
+        doesFragmentConditionMatch(fragment, type2) {
+          const typeConditionNode = fragment.typeCondition;
+          if (!typeConditionNode) {
+            return true;
+          }
+          const conditionalType =
+            this._executorSchema.getType(typeConditionNode);
+          if (conditionalType === type2) {
+            return true;
+          }
+          if (
+            conditionalType &&
+            this._executorSchema.isAbstractType(conditionalType)
+          ) {
+            return this._executorSchema.isSubType(conditionalType, type2);
+          }
+          return false;
+        }
+        getFieldEntryKey(node) {
+          return node.alias ? node.alias.value : node.name.value;
+        }
+      }
+      const defaultFieldResolver = function (
+        source,
+        args,
+        contextValue,
+        info2
+      ) {
+        if (isObjectLike(source) || typeof source === "function") {
+          const property = source[info2.fieldName];
+          if (typeof property === "function") {
+            return source[info2.fieldName](args, contextValue, info2);
+          }
+          return property;
+        }
+      };
+      const defaultTypeResolver = function (
+        value,
+        contextValue,
+        info2,
+        abstractType
+      ) {
+        if (isObjectLike(value) && typeof value.__typename === "string") {
+          return value.__typename;
+        }
+        const possibleTypes =
+          info2.executorSchema.getPossibleTypes(abstractType);
+        const promisedIsTypeOfResults = [];
+        for (let i = 0; i < possibleTypes.length; i++) {
+          const type2 = possibleTypes[i];
+          if (type2.isTypeOf) {
+            const isTypeOfResult = type2.isTypeOf(value, contextValue, info2);
+            if (isPromise(isTypeOfResult)) {
+              promisedIsTypeOfResults[i] = isTypeOfResult;
+            } else if (isTypeOfResult) {
+              return type2.name;
+            }
+          }
+        }
+        if (promisedIsTypeOfResults.length) {
+          return Promise.all(promisedIsTypeOfResults).then(
+            (isTypeOfResults) => {
+              for (let i = 0; i < isTypeOfResults.length; i++) {
+                if (isTypeOfResults[i]) {
+                  return possibleTypes[i].name;
+                }
+              }
+            }
+          );
+        }
+      };
+      function isPromiseLike$1(object) {
+        return object != null && typeof object.then === "function";
+      }
+      const defaultOnRejectedFn = (reason) => {
+        throw reason;
+      };
+      class ValueOrPromise {
+        constructor(executor) {
+          let value;
+          try {
+            value = executor();
+          } catch (reason) {
+            this.state = { status: "rejected", value: reason };
+            return;
+          }
+          if (isPromiseLike$1(value)) {
+            this.state = { status: "pending", value };
+            return;
+          }
+          this.state = { status: "fulfilled", value };
+        }
+        then(onFulfilled, onRejected) {
+          const state = this.state;
+          if (state.status === "pending") {
+            return new ValueOrPromise(() =>
+              state.value.then(onFulfilled, onRejected)
+            );
+          }
+          const onRejectedFn =
+            typeof onRejected === "function" ? onRejected : defaultOnRejectedFn;
+          if (state.status === "rejected") {
+            return new ValueOrPromise(() => onRejectedFn(state.value));
+          }
+          try {
+            const onFulfilledFn =
+              typeof onFulfilled === "function" ? onFulfilled : void 0;
+            return onFulfilledFn === void 0
+              ? new ValueOrPromise(() => state.value)
+              : new ValueOrPromise(() => onFulfilledFn(state.value));
+          } catch (e) {
+            return new ValueOrPromise(() => onRejectedFn(e));
+          }
+        }
+        catch(onRejected) {
+          return this.then(void 0, onRejected);
+        }
+        resolve() {
+          const state = this.state;
+          if (state.status === "pending") {
+            return Promise.resolve(state.value);
+          }
+          if (state.status === "rejected") {
+            throw state.value;
+          }
+          return state.value;
+        }
+        static all(valueOrPromises) {
+          let containsPromise = false;
+          const values = [];
+          for (const valueOrPromise of valueOrPromises) {
+            const state = valueOrPromise.state;
+            if (state.status === "rejected") {
+              return new ValueOrPromise(() => {
+                throw state.value;
+              });
+            }
+            if (state.status === "pending") {
+              containsPromise = true;
+            }
+            values.push(state.value);
+          }
+          if (containsPromise) {
+            return new ValueOrPromise(() => Promise.all(values));
+          }
+          return new ValueOrPromise(() => values);
+        }
+      }
+      var DataLoader = /* @__PURE__ */ (function () {
+        function DataLoader2(batchLoadFn, options) {
+          if (typeof batchLoadFn !== "function") {
+            throw new TypeError(
+              "DataLoader must be constructed with a function which accepts " +
+                ("Array<key> and returns Promise<Array<value>>, but got: " +
+                  batchLoadFn +
+                  ".")
+            );
+          }
+          this._batchLoadFn = batchLoadFn;
+          this._maxBatchSize = getValidMaxBatchSize(options);
+          this._batchScheduleFn = getValidBatchScheduleFn(options);
+          this._cacheKeyFn = getValidCacheKeyFn(options);
+          this._cacheMap = getValidCacheMap(options);
+          this._batch = null;
+        }
+        var _proto = DataLoader2.prototype;
+        _proto.load = function load(key) {
+          if (key === null || key === void 0) {
+            throw new TypeError(
+              "The loader.load() function must be called with a value, " +
+                ("but got: " + String(key) + ".")
+            );
+          }
+          var batch = getCurrentBatch(this);
+          var cacheMap = this._cacheMap;
+          var cacheKey = this._cacheKeyFn(key);
+          if (cacheMap) {
+            var cachedPromise = cacheMap.get(cacheKey);
+            if (cachedPromise) {
+              var cacheHits = batch.cacheHits || (batch.cacheHits = []);
+              return new Promise(function (resolve) {
+                cacheHits.push(function () {
+                  resolve(cachedPromise);
+                });
+              });
+            }
+          }
+          batch.keys.push(key);
+          var promise = new Promise(function (resolve, reject2) {
+            batch.callbacks.push({
+              resolve,
+              reject: reject2,
+            });
+          });
+          if (cacheMap) {
+            cacheMap.set(cacheKey, promise);
+          }
+          return promise;
+        };
+        _proto.loadMany = function loadMany(keys) {
+          if (!isArrayLike(keys)) {
+            throw new TypeError(
+              "The loader.loadMany() function must be called with Array<key> " +
+                ("but got: " + keys + ".")
+            );
+          }
+          var loadPromises = [];
+          for (var i = 0; i < keys.length; i++) {
+            loadPromises.push(
+              this.load(keys[i])["catch"](function (error2) {
+                return error2;
+              })
+            );
+          }
+          return Promise.all(loadPromises);
+        };
+        _proto.clear = function clear(key) {
+          var cacheMap = this._cacheMap;
+          if (cacheMap) {
+            var cacheKey = this._cacheKeyFn(key);
+            cacheMap["delete"](cacheKey);
+          }
+          return this;
+        };
+        _proto.clearAll = function clearAll() {
+          var cacheMap = this._cacheMap;
+          if (cacheMap) {
+            cacheMap.clear();
+          }
+          return this;
+        };
+        _proto.prime = function prime2(key, value) {
+          var cacheMap = this._cacheMap;
+          if (cacheMap) {
+            var cacheKey = this._cacheKeyFn(key);
+            if (cacheMap.get(cacheKey) === void 0) {
+              var promise;
+              if (value instanceof Error) {
+                promise = Promise.reject(value);
+                promise["catch"](function () {});
+              } else {
+                promise = Promise.resolve(value);
+              }
+              cacheMap.set(cacheKey, promise);
+            }
+          }
+          return this;
+        };
+        return DataLoader2;
+      })();
+      var enqueuePostPromiseJob =
+        typeof process === "object" && typeof process.nextTick === "function"
+          ? function (fn) {
+              if (!resolvedPromise) {
+                resolvedPromise = Promise.resolve();
+              }
+              resolvedPromise.then(function () {
+                process.nextTick(fn);
+              });
+            }
+          : typeof setImmediate === "function"
+          ? function (fn) {
+              setImmediate(fn);
+            }
+          : function (fn) {
+              setTimeout(fn);
+            };
+      var resolvedPromise;
+      function getCurrentBatch(loader) {
+        var existingBatch = loader._batch;
+        if (
+          existingBatch !== null &&
+          !existingBatch.hasDispatched &&
+          existingBatch.keys.length < loader._maxBatchSize &&
+          (!existingBatch.cacheHits ||
+            existingBatch.cacheHits.length < loader._maxBatchSize)
+        ) {
+          return existingBatch;
+        }
+        var newBatch = {
+          hasDispatched: false,
+          keys: [],
+          callbacks: [],
+        };
+        loader._batch = newBatch;
+        loader._batchScheduleFn(function () {
+          dispatchBatch(loader, newBatch);
+        });
+        return newBatch;
+      }
+      function dispatchBatch(loader, batch) {
+        batch.hasDispatched = true;
+        if (batch.keys.length === 0) {
+          resolveCacheHits(batch);
+          return;
+        }
+        var batchPromise = loader._batchLoadFn(batch.keys);
+        if (!batchPromise || typeof batchPromise.then !== "function") {
+          return failedDispatch(
+            loader,
+            batch,
+            new TypeError(
+              "DataLoader must be constructed with a function which accepts Array<key> and returns Promise<Array<value>>, but the function did " +
+                ("not return a Promise: " + String(batchPromise) + ".")
+            )
+          );
+        }
+        batchPromise
+          .then(function (values) {
+            if (!isArrayLike(values)) {
+              throw new TypeError(
+                "DataLoader must be constructed with a function which accepts Array<key> and returns Promise<Array<value>>, but the function did " +
+                  ("not return a Promise of an Array: " + String(values) + ".")
+              );
+            }
+            if (values.length !== batch.keys.length) {
+              throw new TypeError(
+                "DataLoader must be constructed with a function which accepts Array<key> and returns Promise<Array<value>>, but the function did not return a Promise of an Array of the same length as the Array of keys." +
+                  ("\n\nKeys:\n" + String(batch.keys)) +
+                  ("\n\nValues:\n" + String(values))
+              );
+            }
+            resolveCacheHits(batch);
+            for (var i = 0; i < batch.callbacks.length; i++) {
+              var value = values[i];
+              if (value instanceof Error) {
+                batch.callbacks[i].reject(value);
+              } else {
+                batch.callbacks[i].resolve(value);
+              }
+            }
+          })
+          ["catch"](function (error2) {
+            failedDispatch(loader, batch, error2);
+          });
+      }
+      function failedDispatch(loader, batch, error2) {
+        resolveCacheHits(batch);
+        for (var i = 0; i < batch.keys.length; i++) {
+          loader.clear(batch.keys[i]);
+          batch.callbacks[i].reject(error2);
+        }
+      }
+      function resolveCacheHits(batch) {
+        if (batch.cacheHits) {
+          for (var i = 0; i < batch.cacheHits.length; i++) {
+            batch.cacheHits[i]();
+          }
+        }
+      }
+      function getValidMaxBatchSize(options) {
+        var shouldBatch = !options || options.batch !== false;
+        if (!shouldBatch) {
+          return 1;
+        }
+        var maxBatchSize = options && options.maxBatchSize;
+        if (maxBatchSize === void 0) {
+          return Infinity;
+        }
+        if (typeof maxBatchSize !== "number" || maxBatchSize < 1) {
+          throw new TypeError(
+            "maxBatchSize must be a positive number: " + maxBatchSize
+          );
+        }
+        return maxBatchSize;
+      }
+      function getValidBatchScheduleFn(options) {
+        var batchScheduleFn = options && options.batchScheduleFn;
+        if (batchScheduleFn === void 0) {
+          return enqueuePostPromiseJob;
+        }
+        if (typeof batchScheduleFn !== "function") {
+          throw new TypeError(
+            "batchScheduleFn must be a function: " + batchScheduleFn
+          );
+        }
+        return batchScheduleFn;
+      }
+      function getValidCacheKeyFn(options) {
+        var cacheKeyFn = options && options.cacheKeyFn;
+        if (cacheKeyFn === void 0) {
+          return function (key) {
+            return key;
+          };
+        }
+        if (typeof cacheKeyFn !== "function") {
+          throw new TypeError("cacheKeyFn must be a function: " + cacheKeyFn);
+        }
+        return cacheKeyFn;
+      }
+      function getValidCacheMap(options) {
+        var shouldCache = !options || options.cache !== false;
+        if (!shouldCache) {
+          return null;
+        }
+        var cacheMap = options && options.cacheMap;
+        if (cacheMap === void 0) {
+          return /* @__PURE__ */ new Map();
+        }
+        if (cacheMap !== null) {
+          var cacheFunctions = ["get", "set", "delete", "clear"];
+          var missingFunctions = cacheFunctions.filter(function (fnName) {
+            return cacheMap && typeof cacheMap[fnName] !== "function";
+          });
+          if (missingFunctions.length !== 0) {
+            throw new TypeError(
+              "Custom cacheMap missing methods: " + missingFunctions.join(", ")
+            );
+          }
+        }
+        return cacheMap;
+      }
+      function isArrayLike(x2) {
+        return (
+          typeof x2 === "object" &&
+          x2 !== null &&
+          typeof x2.length === "number" &&
+          (x2.length === 0 ||
+            (x2.length > 0 &&
+              Object.prototype.hasOwnProperty.call(x2, x2.length - 1)))
+        );
+      }
+      var dataloader = DataLoader;
+      function createPrefix(index) {
+        return `_${index}_`;
+      }
+      function parseKey(prefixedKey) {
+        const match2 = /^_([\d]+)_(.*)$/.exec(prefixedKey);
+        if (
+          match2 &&
+          match2.length === 3 &&
+          !isNaN(Number(match2[1])) &&
+          match2[2]
+        ) {
+          return { index: Number(match2[1]), originalKey: match2[2] };
+        }
+        throw new Error(`Key ${prefixedKey} is not correctly prefixed`);
+      }
+      function mergeRequests(requests, extensionsReducer) {
+        var _a2, _b, _c, _d, _e;
+        const mergedVariables = /* @__PURE__ */ Object.create(null);
+        const mergedVariableDefinitions = [];
+        const mergedSelections = [];
+        const mergedFragmentDefinitions = [];
+        let mergedExtensions = /* @__PURE__ */ Object.create(null);
+        for (const index in requests) {
+          const request = requests[index];
+          const prefixedRequests = prefixRequest(createPrefix(index), request);
+          for (const def of prefixedRequests.document.definitions) {
+            if (isOperationDefinition(def)) {
+              mergedSelections.push(...def.selectionSet.selections);
+              if (def.variableDefinitions) {
+                mergedVariableDefinitions.push(...def.variableDefinitions);
+              }
+            }
+            if (isFragmentDefinition(def)) {
+              mergedFragmentDefinitions.push(def);
+            }
+          }
+          Object.assign(mergedVariables, prefixedRequests.variables);
+          mergedExtensions = extensionsReducer(mergedExtensions, request);
+        }
+        const firstRequest = requests[0];
+        const operationType =
+          (_a2 = firstRequest.operationType) !== null && _a2 !== void 0
+            ? _a2
+            : getOperationASTFromRequest(firstRequest).operation;
+        const mergedOperationDefinition = {
+          kind: Kind.OPERATION_DEFINITION,
+          operation: operationType,
+          variableDefinitions: mergedVariableDefinitions,
+          selectionSet: {
+            kind: Kind.SELECTION_SET,
+            selections: mergedSelections,
+          },
+        };
+        const operationName =
+          (_b = firstRequest.operationName) !== null && _b !== void 0
+            ? _b
+            : (_e =
+                (_d =
+                  (_c = firstRequest.info) === null || _c === void 0
+                    ? void 0
+                    : _c.operation) === null || _d === void 0
+                  ? void 0
+                  : _d.name) === null || _e === void 0
+            ? void 0
+            : _e.value;
+        if (operationName) {
+          mergedOperationDefinition.name = {
+            kind: Kind.NAME,
+            value: operationName,
+          };
+        }
+        return {
+          document: {
+            kind: Kind.DOCUMENT,
+            definitions: [
+              mergedOperationDefinition,
+              ...mergedFragmentDefinitions,
+            ],
+          },
+          variables: mergedVariables,
+          extensions: mergedExtensions,
+          context: requests[0].context,
+          info: requests[0].info,
+          operationType,
+        };
+      }
+      function prefixRequest(prefix, request) {
+        var _a2;
+        const executionVariables =
+          (_a2 = request.variables) !== null && _a2 !== void 0 ? _a2 : {};
+        function prefixNode(node) {
+          return prefixNodeName(node, prefix);
+        }
+        let prefixedDocument = aliasTopLevelFields(prefix, request.document);
+        const executionVariableNames = Object.keys(executionVariables);
+        const hasFragmentDefinitions = request.document.definitions.some(
+          (def) => isFragmentDefinition(def)
+        );
+        const fragmentSpreadImpl = {};
+        if (executionVariableNames.length > 0 || hasFragmentDefinitions) {
+          prefixedDocument = visit(prefixedDocument, {
+            [Kind.VARIABLE]: prefixNode,
+            [Kind.FRAGMENT_DEFINITION]: prefixNode,
+            [Kind.FRAGMENT_SPREAD]: (node) => {
+              node = prefixNodeName(node, prefix);
+              fragmentSpreadImpl[node.name.value] = true;
+              return node;
+            },
+          });
+        }
+        const prefixedVariables = {};
+        for (const variableName of executionVariableNames) {
+          prefixedVariables[prefix + variableName] =
+            executionVariables[variableName];
+        }
+        if (hasFragmentDefinitions) {
+          prefixedDocument = __spreadProps(
+            __spreadValues({}, prefixedDocument),
+            {
+              definitions: prefixedDocument.definitions.filter((def) => {
+                return (
+                  !isFragmentDefinition(def) ||
+                  fragmentSpreadImpl[def.name.value]
+                );
+              }),
+            }
+          );
+        }
+        return {
+          document: prefixedDocument,
+          variables: prefixedVariables,
+        };
+      }
+      function aliasTopLevelFields(prefix, document2) {
+        const transformer = {
+          [Kind.OPERATION_DEFINITION]: (def) => {
+            const { selections } = def.selectionSet;
+            return __spreadProps(__spreadValues({}, def), {
+              selectionSet: __spreadProps(
+                __spreadValues({}, def.selectionSet),
+                {
+                  selections: aliasFieldsInSelection(
+                    prefix,
+                    selections,
+                    document2
+                  ),
+                }
+              ),
+            });
+          },
+        };
+        return visit(document2, transformer, {
+          [Kind.DOCUMENT]: [`definitions`],
+        });
+      }
+      function aliasFieldsInSelection(prefix, selections, document2) {
+        return selections.map((selection) => {
+          switch (selection.kind) {
+            case Kind.INLINE_FRAGMENT:
+              return aliasFieldsInInlineFragment(prefix, selection, document2);
+            case Kind.FRAGMENT_SPREAD: {
+              const inlineFragment = inlineFragmentSpread(selection, document2);
+              return aliasFieldsInInlineFragment(
+                prefix,
+                inlineFragment,
+                document2
+              );
+            }
+            case Kind.FIELD:
+            default:
+              return aliasField(selection, prefix);
+          }
+        });
+      }
+      function aliasFieldsInInlineFragment(prefix, fragment, document2) {
+        const { selections } = fragment.selectionSet;
+        return __spreadProps(__spreadValues({}, fragment), {
+          selectionSet: __spreadProps(
+            __spreadValues({}, fragment.selectionSet),
+            {
+              selections: aliasFieldsInSelection(prefix, selections, document2),
+            }
+          ),
+        });
+      }
+      function inlineFragmentSpread(spread, document2) {
+        const fragment = document2.definitions.find(
+          (def) =>
+            isFragmentDefinition(def) && def.name.value === spread.name.value
+        );
+        if (!fragment) {
+          throw new Error(`Fragment ${spread.name.value} does not exist`);
+        }
+        const { typeCondition, selectionSet } = fragment;
+        return {
+          kind: Kind.INLINE_FRAGMENT,
+          typeCondition,
+          selectionSet,
+          directives: spread.directives,
+        };
+      }
+      function prefixNodeName(namedNode, prefix) {
+        return __spreadProps(__spreadValues({}, namedNode), {
+          name: __spreadProps(__spreadValues({}, namedNode.name), {
+            value: prefix + namedNode.name.value,
+          }),
+        });
+      }
+      function aliasField(field, aliasPrefix) {
+        const aliasNode = field.alias ? field.alias : field.name;
+        return __spreadProps(__spreadValues({}, field), {
+          alias: __spreadProps(__spreadValues({}, aliasNode), {
+            value: aliasPrefix + aliasNode.value,
+          }),
+        });
+      }
+      function isOperationDefinition(def) {
+        return def.kind === Kind.OPERATION_DEFINITION;
+      }
+      function isFragmentDefinition(def) {
+        return def.kind === Kind.FRAGMENT_DEFINITION;
+      }
+      function splitResult({ data, errors: errors2 }, numResults) {
+        const splitResults = [];
+        for (let i = 0; i < numResults; i++) {
+          splitResults.push({});
+        }
+        if (data) {
+          for (const prefixedKey in data) {
+            const { index, originalKey } = parseKey(prefixedKey);
+            const result2 = splitResults[index];
+            if (result2 == null) {
+              continue;
+            }
+            if (result2.data == null) {
+              result2.data = { [originalKey]: data[prefixedKey] };
+            } else {
+              result2.data[originalKey] = data[prefixedKey];
+            }
+          }
+        }
+        if (errors2) {
+          for (const error2 of errors2) {
+            if (error2.path) {
+              const parsedKey = parseKey(error2.path[0]);
+              const { index, originalKey } = parsedKey;
+              const newError = relocatedError(error2, [
+                originalKey,
+                ...error2.path.slice(1),
+              ]);
+              const resultErrors = (splitResults[index].errors =
+                splitResults[index].errors || []);
+              resultErrors.push(newError);
+            } else {
+              splitResults.forEach((result2) => {
+                const resultErrors = (result2.errors = result2.errors || []);
+                resultErrors.push(new GraphQLError(error2.message));
+              });
+            }
+          }
+        }
+        return splitResults;
+      }
+      function createBatchingExecutor(
+        executor,
+        dataLoaderOptions,
+        extensionsReducer = defaultExtensionsReducer
+      ) {
+        const loadFn = createLoadFn(executor, extensionsReducer);
+        const loader = new dataloader(loadFn, dataLoaderOptions);
+        return function batchingExecutor(request) {
+          const operationAst = getOperationASTFromRequest(request);
+          return operationAst.operation === "subscription"
+            ? executor(request)
+            : loader.load(request);
+        };
+      }
+      function createLoadFn(executor, extensionsReducer) {
+        return async function batchExecuteLoadFn(requests) {
+          const execBatches = [];
+          let index = 0;
+          const request = requests[index];
+          let currentBatch = [request];
+          execBatches.push(currentBatch);
+          const operationAst = getOperationASTFromRequest(request);
+          const operationType = operationAst.operation;
+          if (operationType == null) {
+            throw new Error("could not identify operation type of document");
+          }
+          while (++index < requests.length) {
+            const currentRequest = requests[index];
+            const currentOperationAST =
+              getOperationASTFromRequest(currentRequest);
+            const currentOperationType = currentOperationAST.operation;
+            if (operationType === currentOperationType) {
+              currentBatch.push(currentRequest);
+            } else {
+              currentBatch = [currentRequest];
+              execBatches.push(currentBatch);
+            }
+          }
+          const results = await Promise.all(
+            execBatches.map(async (execBatch) => {
+              const mergedRequests = mergeRequests(
+                execBatch,
+                extensionsReducer
+              );
+              const resultBatches = await executor(mergedRequests);
+              return splitResult(resultBatches, execBatch.length);
+            })
+          );
+          return results.flat();
+        };
+      }
+      function defaultExtensionsReducer(mergedExtensions, request) {
+        const newExtensions = request.extensions;
+        if (newExtensions != null) {
+          Object.assign(mergedExtensions, newExtensions);
+        }
+        return mergedExtensions;
+      }
+      const getBatchingExecutor = memoize2of4(function getBatchingExecutor2(
+        _context,
+        executor,
+        dataLoaderOptions,
+        extensionsReducer
+      ) {
+        return createBatchingExecutor(
+          executor,
+          dataLoaderOptions,
+          extensionsReducer
+        );
+      });
+      function applySchemaTransforms(
+        originalWrappingSchema,
+        subschemaConfig,
+        transformedSchema
+      ) {
+        const schemaTransforms = subschemaConfig.transforms;
+        if (schemaTransforms == null) {
+          return originalWrappingSchema;
+        }
+        return schemaTransforms.reduce(
+          (schema, transform) =>
+            transform.transformSchema != null
+              ? transform.transformSchema(
+                  schema,
+                  subschemaConfig,
+                  transformedSchema
+                )
+              : schema,
+          originalWrappingSchema
+        );
+      }
+      class Subschema {
+        constructor(config2) {
+          var _a2;
+          this.schema = config2.schema;
+          this.executor = config2.executor;
+          this.batch = config2.batch;
+          this.batchingOptions = config2.batchingOptions;
+          this.createProxyingResolver = config2.createProxyingResolver;
+          this.transforms =
+            (_a2 = config2.transforms) !== null && _a2 !== void 0 ? _a2 : [];
+          this.transformedSchema = applySchemaTransforms(this.schema, config2);
+          this.merge = config2.merge;
+        }
+      }
+      function getDocumentMetadata(document2) {
+        const operations = [];
+        const fragments = [];
+        const fragmentNames = /* @__PURE__ */ new Set();
+        for (let i = 0; i < document2.definitions.length; i++) {
+          const def = document2.definitions[i];
+          if (def.kind === Kind.FRAGMENT_DEFINITION) {
+            fragments.push(def);
+            fragmentNames.add(def.name.value);
+          } else if (def.kind === Kind.OPERATION_DEFINITION) {
+            operations.push(def);
+          }
+        }
+        return {
+          operations,
+          fragments,
+          fragmentNames,
+        };
+      }
+      function prepareGatewayDocument(
+        originalDocument,
+        transformedSchema,
+        returnType,
+        infoSchema
+      ) {
+        const wrappedConcreteTypesDocument = wrapConcreteTypes(
+          returnType,
+          transformedSchema,
+          originalDocument
+        );
+        if (infoSchema == null) {
+          return wrappedConcreteTypesDocument;
+        }
+        const {
+          possibleTypesMap,
+          reversePossibleTypesMap: reversePossibleTypesMap2,
+          interfaceExtensionsMap,
+          fieldNodesByType,
+          fieldNodesByField,
+          dynamicSelectionSetsByField,
+        } = getSchemaMetaData(infoSchema, transformedSchema);
+        const { operations, fragments, fragmentNames } = getDocumentMetadata(
+          wrappedConcreteTypesDocument
+        );
+        const { expandedFragments, fragmentReplacements } =
+          getExpandedFragments(fragments, fragmentNames, possibleTypesMap);
+        const typeInfo = new TypeInfo(transformedSchema);
+        const expandedDocument = {
+          kind: Kind.DOCUMENT,
+          definitions: [...operations, ...fragments, ...expandedFragments],
+        };
+        const visitorKeyMap = {
+          Document: ["definitions"],
+          OperationDefinition: ["selectionSet"],
+          SelectionSet: ["selections"],
+          Field: ["selectionSet"],
+          InlineFragment: ["selectionSet"],
+          FragmentDefinition: ["selectionSet"],
+        };
+        return visit(
+          expandedDocument,
+          visitWithTypeInfo(typeInfo, {
+            [Kind.SELECTION_SET]: (node) =>
+              visitSelectionSet(
+                node,
+                fragmentReplacements,
+                transformedSchema,
+                typeInfo,
+                possibleTypesMap,
+                reversePossibleTypesMap2,
+                interfaceExtensionsMap,
+                fieldNodesByType,
+                fieldNodesByField,
+                dynamicSelectionSetsByField
+              ),
+          }),
+          visitorKeyMap
+        );
+      }
+      function visitSelectionSet(
+        node,
+        fragmentReplacements,
+        schema,
+        typeInfo,
+        possibleTypesMap,
+        reversePossibleTypesMap2,
+        interfaceExtensionsMap,
+        fieldNodesByType,
+        fieldNodesByField,
+        dynamicSelectionSetsByField
+      ) {
+        var _a2, _b;
+        const newSelections = /* @__PURE__ */ new Set();
+        const maybeType = typeInfo.getParentType();
+        if (maybeType != null) {
+          const parentType = getNamedType(maybeType);
+          const parentTypeName = parentType.name;
+          const fieldNodes = fieldNodesByType[parentTypeName];
+          if (fieldNodes) {
+            for (const fieldNode of fieldNodes) {
+              newSelections.add(fieldNode);
+            }
+          }
+          const interfaceExtensions = interfaceExtensionsMap[parentType.name];
+          const interfaceExtensionFields = [];
+          for (const selection of node.selections) {
+            if (selection.kind === Kind.INLINE_FRAGMENT) {
+              if (selection.typeCondition != null) {
+                const possibleTypes =
+                  possibleTypesMap[selection.typeCondition.name.value];
+                if (possibleTypes == null) {
+                  newSelections.add(selection);
+                  continue;
+                }
+                for (const possibleTypeName of possibleTypes) {
+                  const maybePossibleType = schema.getType(possibleTypeName);
+                  if (
+                    maybePossibleType != null &&
+                    implementsAbstractType(
+                      schema,
+                      parentType,
+                      maybePossibleType
+                    )
+                  ) {
+                    newSelections.add(
+                      generateInlineFragment(
+                        possibleTypeName,
+                        selection.selectionSet
+                      )
+                    );
+                  }
+                }
+              }
+            } else if (selection.kind === Kind.FRAGMENT_SPREAD) {
+              const fragmentName = selection.name.value;
+              if (!fragmentReplacements[fragmentName]) {
+                newSelections.add(selection);
+                continue;
+              }
+              for (const replacement of fragmentReplacements[fragmentName]) {
+                const typeName = replacement.typeName;
+                const maybeReplacementType = schema.getType(typeName);
+                if (
+                  maybeReplacementType != null &&
+                  implementsAbstractType(schema, parentType, maybeType)
+                ) {
+                  newSelections.add({
+                    kind: Kind.FRAGMENT_SPREAD,
+                    name: {
+                      kind: Kind.NAME,
+                      value: replacement.fragmentName,
+                    },
+                  });
+                }
+              }
+            } else {
+              const fieldName = selection.name.value;
+              const fieldNodes2 =
+                (_a2 = fieldNodesByField[parentTypeName]) === null ||
+                _a2 === void 0
+                  ? void 0
+                  : _a2[fieldName];
+              if (fieldNodes2 != null) {
+                for (const fieldNode of fieldNodes2) {
+                  newSelections.add(fieldNode);
+                }
+              }
+              const dynamicSelectionSets =
+                (_b = dynamicSelectionSetsByField[parentTypeName]) === null ||
+                _b === void 0
+                  ? void 0
+                  : _b[fieldName];
+              if (dynamicSelectionSets != null) {
+                for (const selectionSetFn of dynamicSelectionSets) {
+                  const selectionSet = selectionSetFn(selection);
+                  if (selectionSet != null) {
+                    for (const selection2 of selectionSet.selections) {
+                      newSelections.add(selection2);
+                    }
+                  }
+                }
+              }
+              if (
+                interfaceExtensions === null || interfaceExtensions === void 0
+                  ? void 0
+                  : interfaceExtensions[fieldName]
+              ) {
+                interfaceExtensionFields.push(selection);
+              } else {
+                newSelections.add(selection);
+              }
+            }
+          }
+          if (reversePossibleTypesMap2[parentType.name]) {
+            newSelections.add({
+              kind: Kind.FIELD,
+              name: {
+                kind: Kind.NAME,
+                value: "__typename",
+              },
+            });
+          }
+          if (interfaceExtensionFields.length) {
+            const possibleTypes = possibleTypesMap[parentType.name];
+            if (possibleTypes != null) {
+              for (const possibleType of possibleTypes) {
+                newSelections.add(
+                  generateInlineFragment(possibleType, {
+                    kind: Kind.SELECTION_SET,
+                    selections: interfaceExtensionFields,
+                  })
+                );
+              }
+            }
+          }
+          return __spreadProps(__spreadValues({}, node), {
+            selections: Array.from(newSelections),
+          });
+        }
+        return node;
+      }
+      function generateInlineFragment(typeName, selectionSet) {
+        return {
+          kind: Kind.INLINE_FRAGMENT,
+          typeCondition: {
+            kind: Kind.NAMED_TYPE,
+            name: {
+              kind: Kind.NAME,
+              value: typeName,
+            },
+          },
+          selectionSet,
+        };
+      }
+      const getSchemaMetaData = memoize2$1((sourceSchema, targetSchema) => {
+        var _a2, _b, _c, _d;
+        const typeMap = sourceSchema.getTypeMap();
+        const targetTypeMap = targetSchema.getTypeMap();
+        const possibleTypesMap = /* @__PURE__ */ Object.create(null);
+        const interfaceExtensionsMap = /* @__PURE__ */ Object.create(null);
+        for (const typeName in typeMap) {
+          const type2 = typeMap[typeName];
+          if (isAbstractType(type2)) {
+            const targetType = targetTypeMap[typeName];
+            if (isInterfaceType(type2) && isInterfaceType(targetType)) {
+              const targetTypeFields = targetType.getFields();
+              const sourceTypeFields = type2.getFields();
+              const extensionFields = /* @__PURE__ */ Object.create(null);
+              let isExtensionFieldsEmpty = true;
+              for (const fieldName in sourceTypeFields) {
+                if (!targetTypeFields[fieldName]) {
+                  extensionFields[fieldName] = true;
+                  isExtensionFieldsEmpty = false;
+                }
+              }
+              if (!isExtensionFieldsEmpty) {
+                interfaceExtensionsMap[typeName] = extensionFields;
+              }
+            }
+            if (
+              interfaceExtensionsMap[typeName] ||
+              !isAbstractType(targetType)
+            ) {
+              const implementations = sourceSchema.getPossibleTypes(type2);
+              possibleTypesMap[typeName] = [];
+              for (const impl of implementations) {
+                if (targetTypeMap[impl.name]) {
+                  possibleTypesMap[typeName].push(impl.name);
+                }
+              }
+            }
+          }
+        }
+        const stitchingInfo =
+          (_a2 = sourceSchema.extensions) === null || _a2 === void 0
+            ? void 0
+            : _a2["stitchingInfo"];
+        return {
+          possibleTypesMap,
+          reversePossibleTypesMap: reversePossibleTypesMap(possibleTypesMap),
+          interfaceExtensionsMap,
+          fieldNodesByType:
+            (_b =
+              stitchingInfo === null || stitchingInfo === void 0
+                ? void 0
+                : stitchingInfo.fieldNodesByType) !== null && _b !== void 0
+              ? _b
+              : {},
+          fieldNodesByField:
+            (_c =
+              stitchingInfo === null || stitchingInfo === void 0
+                ? void 0
+                : stitchingInfo.fieldNodesByField) !== null && _c !== void 0
+              ? _c
+              : {},
+          dynamicSelectionSetsByField:
+            (_d =
+              stitchingInfo === null || stitchingInfo === void 0
+                ? void 0
+                : stitchingInfo.dynamicSelectionSetsByField) !== null &&
+            _d !== void 0
+              ? _d
+              : {},
+        };
+      });
+      function reversePossibleTypesMap(possibleTypesMap) {
+        const result2 = /* @__PURE__ */ Object.create(null);
+        for (const typeName in possibleTypesMap) {
+          const toTypeNames = possibleTypesMap[typeName];
+          for (const toTypeName of toTypeNames) {
+            if (!result2[toTypeName]) {
+              result2[toTypeName] = [];
+            }
+            result2[toTypeName].push(typeName);
+          }
+        }
+        return result2;
+      }
+      function getExpandedFragments(
+        fragments,
+        fragmentNames,
+        possibleTypesMap
+      ) {
+        let fragmentCounter = 0;
+        function generateFragmentName(typeName) {
+          let fragmentName;
+          do {
+            fragmentName = `_${typeName}_Fragment${fragmentCounter.toString()}`;
+            fragmentCounter++;
+          } while (fragmentNames.has(fragmentName));
+          return fragmentName;
+        }
+        const expandedFragments = [];
+        const fragmentReplacements = /* @__PURE__ */ Object.create(null);
+        for (const fragment of fragments) {
+          const possibleTypes =
+            possibleTypesMap[fragment.typeCondition.name.value];
+          if (possibleTypes != null) {
+            const fragmentName = fragment.name.value;
+            fragmentReplacements[fragmentName] = [];
+            for (const possibleTypeName of possibleTypes) {
+              const name2 = generateFragmentName(possibleTypeName);
+              fragmentNames.add(name2);
+              expandedFragments.push({
+                kind: Kind.FRAGMENT_DEFINITION,
+                name: {
+                  kind: Kind.NAME,
+                  value: name2,
+                },
+                typeCondition: {
+                  kind: Kind.NAMED_TYPE,
+                  name: {
+                    kind: Kind.NAME,
+                    value: possibleTypeName,
+                  },
+                },
+                selectionSet: fragment.selectionSet,
+              });
+              fragmentReplacements[fragmentName].push({
+                fragmentName: name2,
+                typeName: possibleTypeName,
+              });
+            }
+          }
+        }
+        return {
+          expandedFragments,
+          fragmentReplacements,
+        };
+      }
+      function wrapConcreteTypes(returnType, targetSchema, document2) {
+        const namedType = getNamedType(returnType);
+        if (!isObjectType(namedType)) {
+          return document2;
+        }
+        const rootTypeNames = getRootTypeNames(targetSchema);
+        const typeInfo = new TypeInfo(targetSchema);
+        const visitorKeys = {
+          Document: ["definitions"],
+          OperationDefinition: ["selectionSet"],
+          SelectionSet: ["selections"],
+          InlineFragment: ["selectionSet"],
+          FragmentDefinition: ["selectionSet"],
+        };
+        return visit(
+          document2,
+          visitWithTypeInfo(typeInfo, {
+            [Kind.FRAGMENT_DEFINITION]: (node) => {
+              const typeName = node.typeCondition.name.value;
+              if (!rootTypeNames.has(typeName)) {
+                return false;
+              }
+            },
+            [Kind.FIELD]: (node) => {
+              const type2 = typeInfo.getType();
+              if (type2 != null && isAbstractType(getNamedType(type2))) {
+                return __spreadProps(__spreadValues({}, node), {
+                  selectionSet: {
+                    kind: Kind.SELECTION_SET,
+                    selections: [
+                      {
+                        kind: Kind.INLINE_FRAGMENT,
+                        typeCondition: {
+                          kind: Kind.NAMED_TYPE,
+                          name: {
+                            kind: Kind.NAME,
+                            value: namedType.name,
+                          },
+                        },
+                        selectionSet: node.selectionSet,
+                      },
+                    ],
+                  },
+                });
+              }
+            },
+          }),
+          visitorKeys
+        );
+      }
+      function finalizeGatewayDocument(targetSchema, fragments, operations) {
+        var _a2;
+        let usedVariables = [];
+        let usedFragments = [];
+        const newOperations = [];
+        let newFragments = [];
+        const validFragments = [];
+        const validFragmentsWithType = /* @__PURE__ */ Object.create(null);
+        for (const fragment of fragments) {
+          const typeName = fragment.typeCondition.name.value;
+          const type2 = targetSchema.getType(typeName);
+          if (type2 != null) {
+            validFragments.push(fragment);
+            validFragmentsWithType[fragment.name.value] = type2;
+          }
+        }
+        let fragmentSet = /* @__PURE__ */ Object.create(null);
+        for (const operation of operations) {
+          const type2 = getDefinedRootType(targetSchema, operation.operation);
+          const {
+            selectionSet,
+            usedFragments: operationUsedFragments,
+            usedVariables: operationUsedVariables,
+          } = finalizeSelectionSet(
+            targetSchema,
+            type2,
+            validFragmentsWithType,
+            operation.selectionSet
+          );
+          usedFragments = union(usedFragments, operationUsedFragments);
+          const {
+            usedVariables: collectedUsedVariables,
+            newFragments: collectedNewFragments,
+            fragmentSet: collectedFragmentSet,
+          } = collectFragmentVariables(
+            targetSchema,
+            fragmentSet,
+            validFragments,
+            validFragmentsWithType,
+            usedFragments
+          );
+          const operationOrFragmentVariables = union(
+            operationUsedVariables,
+            collectedUsedVariables
+          );
+          usedVariables = union(usedVariables, operationOrFragmentVariables);
+          newFragments = collectedNewFragments;
+          fragmentSet = collectedFragmentSet;
+          const variableDefinitions = (
+            (_a2 = operation.variableDefinitions) !== null && _a2 !== void 0
+              ? _a2
+              : []
+          ).filter(
+            (variable) =>
+              operationOrFragmentVariables.indexOf(
+                variable.variable.name.value
+              ) !== -1
+          );
+          newOperations.push({
+            kind: Kind.OPERATION_DEFINITION,
+            operation: operation.operation,
+            name: operation.name,
+            directives: operation.directives,
+            variableDefinitions,
+            selectionSet,
+          });
+        }
+        const newDocument = {
+          kind: Kind.DOCUMENT,
+          definitions: [...newOperations, ...newFragments],
+        };
+        return {
+          usedVariables,
+          newDocument,
+        };
+      }
+      function finalizeGatewayRequest(originalRequest, delegationContext) {
+        let { document: document2, variables } = originalRequest;
+        let { operations, fragments } = getDocumentMetadata(document2);
+        const { targetSchema, args } = delegationContext;
+        if (args) {
+          const requestWithNewVariables = addVariablesToRootFields(
+            targetSchema,
+            operations,
+            args
+          );
+          operations = requestWithNewVariables.newOperations;
+          variables = Object.assign(
+            {},
+            variables !== null && variables !== void 0 ? variables : {},
+            requestWithNewVariables.newVariables
+          );
+        }
+        const { usedVariables, newDocument } = finalizeGatewayDocument(
+          targetSchema,
+          fragments,
+          operations
+        );
+        const newVariables = {};
+        if (variables != null) {
+          for (const variableName of usedVariables) {
+            const variableValue = variables[variableName];
+            if (variableValue !== void 0) {
+              newVariables[variableName] = variableValue;
+            }
+          }
+        }
+        return __spreadProps(__spreadValues({}, originalRequest), {
+          document: newDocument,
+          variables: newVariables,
+        });
+      }
+      function addVariablesToRootFields(targetSchema, operations, args) {
+        const newVariables = /* @__PURE__ */ Object.create(null);
+        const newOperations = operations.map((operation) => {
+          var _a2, _b;
+          const variableDefinitionMap = (
+            (_a2 = operation.variableDefinitions) !== null && _a2 !== void 0
+              ? _a2
+              : []
+          ).reduce(
+            (prev, def) =>
+              __spreadProps(__spreadValues({}, prev), {
+                [def.variable.name.value]: def,
+              }),
+            {}
+          );
+          const type2 = getDefinedRootType(targetSchema, operation.operation);
+          const newSelections = [];
+          for (const selection of operation.selectionSet.selections) {
+            if (selection.kind === Kind.FIELD) {
+              const argumentNodes =
+                (_b = selection.arguments) !== null && _b !== void 0 ? _b : [];
+              const argumentNodeMap = argumentNodes.reduce(
+                (prev, argument) =>
+                  __spreadProps(__spreadValues({}, prev), {
+                    [argument.name.value]: argument,
+                  }),
+                {}
+              );
+              const targetField = type2.getFields()[selection.name.value];
+              if (targetField != null) {
+                updateArguments(
+                  targetField,
+                  argumentNodeMap,
+                  variableDefinitionMap,
+                  newVariables,
+                  args
+                );
+              }
+              newSelections.push(
+                __spreadProps(__spreadValues({}, selection), {
+                  arguments: Object.values(argumentNodeMap),
+                })
+              );
+            } else {
+              newSelections.push(selection);
+            }
+          }
+          const newSelectionSet = {
+            kind: Kind.SELECTION_SET,
+            selections: newSelections,
+          };
+          return __spreadProps(__spreadValues({}, operation), {
+            variableDefinitions: Object.values(variableDefinitionMap),
+            selectionSet: newSelectionSet,
+          });
+        });
+        return {
+          newOperations,
+          newVariables,
+        };
+      }
+      function updateArguments(
+        targetField,
+        argumentNodeMap,
+        variableDefinitionMap,
+        variableValues,
+        newArgs
+      ) {
+        const generateVariableName = createVariableNameGenerator(
+          variableDefinitionMap
+        );
+        for (const argument of targetField.args) {
+          const argName = argument.name;
+          const argType = argument.type;
+          if (argName in newArgs) {
+            updateArgument(
+              argumentNodeMap,
+              variableDefinitionMap,
+              variableValues,
+              argName,
+              generateVariableName(argName),
+              argType,
+              serializeInputValue(argType, newArgs[argName])
+            );
+          }
+        }
+      }
+      function collectFragmentVariables(
+        targetSchema,
+        fragmentSet,
+        validFragments,
+        validFragmentsWithType,
+        usedFragments
+      ) {
+        let remainingFragments = usedFragments.slice();
+        let usedVariables = [];
+        const newFragments = [];
+        while (remainingFragments.length !== 0) {
+          const nextFragmentName = remainingFragments.pop();
+          const fragment = validFragments.find(
+            (fr) => fr.name.value === nextFragmentName
+          );
+          if (fragment != null) {
+            const name2 = nextFragmentName;
+            const typeName = fragment.typeCondition.name.value;
+            const type2 = targetSchema.getType(typeName);
+            if (type2 == null) {
+              throw new Error(
+                `Fragment reference type "${typeName}", but the type is not contained within the target schema.`
+              );
+            }
+            const {
+              selectionSet,
+              usedFragments: fragmentUsedFragments,
+              usedVariables: fragmentUsedVariables,
+            } = finalizeSelectionSet(
+              targetSchema,
+              type2,
+              validFragmentsWithType,
+              fragment.selectionSet
+            );
+            remainingFragments = union(
+              remainingFragments,
+              fragmentUsedFragments
+            );
+            usedVariables = union(usedVariables, fragmentUsedVariables);
+            if (name2 && !(name2 in fragmentSet)) {
+              fragmentSet[name2] = true;
+              newFragments.push({
+                kind: Kind.FRAGMENT_DEFINITION,
+                name: {
+                  kind: Kind.NAME,
+                  value: name2,
+                },
+                typeCondition: fragment.typeCondition,
+                selectionSet,
+              });
+            }
+          }
+        }
+        return {
+          usedVariables,
+          newFragments,
+          fragmentSet,
+        };
+      }
+      const filteredSelectionSetVisitorKeys = {
+        SelectionSet: ["selections"],
+        Field: ["selectionSet"],
+        InlineFragment: ["selectionSet"],
+        FragmentDefinition: ["selectionSet"],
+      };
+      const variablesVisitorKeys = {
+        SelectionSet: ["selections"],
+        Field: ["arguments", "directives", "selectionSet"],
+        Argument: ["value"],
+        InlineFragment: ["directives", "selectionSet"],
+        FragmentSpread: ["directives"],
+        FragmentDefinition: ["selectionSet"],
+        ObjectValue: ["fields"],
+        ObjectField: ["name", "value"],
+        Directive: ["arguments"],
+        ListValue: ["values"],
+      };
+      function finalizeSelectionSet(
+        schema,
+        type2,
+        validFragments,
+        selectionSet
+      ) {
+        const usedFragments = [];
+        const usedVariables = [];
+        const typeInfo =
+          versionInfo.major < 16
+            ? new TypeInfo(schema, void 0, type2)
+            : new TypeInfo(schema, type2);
+        const filteredSelectionSet = visit(
+          selectionSet,
+          visitWithTypeInfo(typeInfo, {
+            [Kind.FIELD]: {
+              enter: (node) => {
+                const parentType = typeInfo.getParentType();
+                if (isObjectType(parentType) || isInterfaceType(parentType)) {
+                  const fields = parentType.getFields();
+                  const field =
+                    node.name.value === "__typename"
+                      ? TypeNameMetaFieldDef
+                      : fields[node.name.value];
+                  if (!field) {
+                    return null;
+                  }
+                  const args = field.args != null ? field.args : [];
+                  const argsMap = /* @__PURE__ */ Object.create(null);
+                  for (const arg of args) {
+                    argsMap[arg.name] = arg;
+                  }
+                  if (node.arguments != null) {
+                    const newArgs = [];
+                    for (const arg of node.arguments) {
+                      if (arg.name.value in argsMap) {
+                        newArgs.push(arg);
+                      }
+                    }
+                    if (newArgs.length !== node.arguments.length) {
+                      return __spreadProps(__spreadValues({}, node), {
+                        arguments: newArgs,
+                      });
+                    }
+                  }
+                }
+              },
+              leave: (node) => {
+                const type3 = typeInfo.getType();
+                if (type3 == null) {
+                  throw new Error(
+                    `No type was found for field node ${inspect$1(node)}.`
+                  );
+                }
+                const namedType = getNamedType(type3);
+                if (!schema.getType(namedType.name) == null) {
+                  return null;
+                }
+                if (isObjectType(namedType) || isInterfaceType(namedType)) {
+                  const selections =
+                    node.selectionSet != null
+                      ? node.selectionSet.selections
+                      : null;
+                  if (selections == null || selections.length === 0) {
+                    return null;
+                  }
+                }
+              },
+            },
+            [Kind.FRAGMENT_SPREAD]: {
+              enter: (node) => {
+                if (!(node.name.value in validFragments)) {
+                  return null;
+                }
+                const parentType = typeInfo.getParentType();
+                const innerType = validFragments[node.name.value];
+                if (!implementsAbstractType(schema, parentType, innerType)) {
+                  return null;
+                }
+                usedFragments.push(node.name.value);
+              },
+            },
+            [Kind.INLINE_FRAGMENT]: {
+              enter: (node) => {
+                if (node.typeCondition != null) {
+                  const parentType = typeInfo.getParentType();
+                  const innerType = schema.getType(
+                    node.typeCondition.name.value
+                  );
+                  if (!implementsAbstractType(schema, parentType, innerType)) {
+                    return null;
+                  }
+                }
+              },
+            },
+            [Kind.SELECTION_SET]: {
+              leave: (node) => {
+                const parentType = typeInfo.getParentType();
+                if (parentType != null && isAbstractType(parentType)) {
+                  const selections = node.selections.concat([
+                    {
+                      kind: Kind.FIELD,
+                      name: {
+                        kind: Kind.NAME,
+                        value: "__typename",
+                      },
+                    },
+                  ]);
+                  return __spreadProps(__spreadValues({}, node), {
+                    selections,
+                  });
+                }
+              },
+            },
+          }),
+          filteredSelectionSetVisitorKeys
+        );
+        visit(
+          filteredSelectionSet,
+          {
+            [Kind.VARIABLE]: (variableNode) => {
+              usedVariables.push(variableNode.name.value);
+            },
+          },
+          variablesVisitorKeys
+        );
+        return {
+          selectionSet: filteredSelectionSet,
+          usedFragments,
+          usedVariables,
+        };
+      }
+      function union(...arrays) {
+        const cache = /* @__PURE__ */ Object.create(null);
+        const result2 = [];
+        for (const array of arrays) {
+          for (const item of array) {
+            if (!(item in cache)) {
+              cache[item] = true;
+              result2.push(item);
+            }
+          }
+        }
+        return result2;
+      }
+      const UNPATHED_ERRORS_SYMBOL = Symbol("subschemaErrors");
+      const OBJECT_SUBSCHEMA_SYMBOL = Symbol("initialSubschema");
+      const FIELD_SUBSCHEMA_MAP_SYMBOL = Symbol("subschemaMap");
+      function isExternalObject(data) {
+        return data[UNPATHED_ERRORS_SYMBOL] !== void 0;
+      }
+      function annotateExternalObject(
+        object,
+        errors2,
+        subschema,
+        subschemaMap
+      ) {
+        Object.defineProperties(object, {
+          [OBJECT_SUBSCHEMA_SYMBOL]: { value: subschema },
+          [FIELD_SUBSCHEMA_MAP_SYMBOL]: { value: subschemaMap },
+          [UNPATHED_ERRORS_SYMBOL]: { value: errors2 },
+        });
+        return object;
+      }
+      function getSubschema(object, responseKey) {
+        var _a2;
+        return (_a2 = object[FIELD_SUBSCHEMA_MAP_SYMBOL][responseKey]) !==
+          null && _a2 !== void 0
+          ? _a2
+          : object[OBJECT_SUBSCHEMA_SYMBOL];
+      }
+      function getUnpathedErrors(object) {
+        return object[UNPATHED_ERRORS_SYMBOL];
+      }
+      const EMPTY_ARRAY = [];
+      const EMPTY_OBJECT = /* @__PURE__ */ Object.create(null);
+      async function mergeFields(
+        mergedTypeInfo,
+        object,
+        sourceSubschema,
+        context,
+        info2
+      ) {
+        var _a2;
+        const delegationMaps = mergedTypeInfo.delegationPlanBuilder(
+          info2.schema,
+          sourceSubschema,
+          info2.variableValues != null &&
+            Object.keys(info2.variableValues).length > 0
+            ? info2.variableValues
+            : EMPTY_OBJECT,
+          info2.fragments != null && Object.keys(info2.fragments).length > 0
+            ? info2.fragments
+            : EMPTY_OBJECT,
+          (
+            (_a2 = info2.fieldNodes) === null || _a2 === void 0
+              ? void 0
+              : _a2.length
+          )
+            ? info2.fieldNodes
+            : EMPTY_ARRAY
+        );
+        for (const delegationMap of delegationMaps) {
+          await executeDelegationStage(
+            mergedTypeInfo,
+            delegationMap,
+            object,
+            context,
+            info2
+          );
+        }
+        return object;
+      }
+      async function executeDelegationStage(
+        mergedTypeInfo,
+        delegationMap,
+        object,
+        context,
+        info2
+      ) {
+        const combinedErrors = object[UNPATHED_ERRORS_SYMBOL];
+        const path = pathToArray$1(info2.path);
+        const combinedFieldSubschemaMap = object[FIELD_SUBSCHEMA_MAP_SYMBOL];
+        await Promise.all(
+          [...delegationMap.entries()].map(
+            async ([subschema, selectionSet]) => {
+              var _a2;
+              const schema = subschema.transformedSchema || info2.schema;
+              const type2 = schema.getType(object.__typename);
+              const resolver = mergedTypeInfo.resolvers.get(subschema);
+              if (resolver) {
+                let source;
+                try {
+                  source = await resolver(
+                    object,
+                    context,
+                    info2,
+                    subschema,
+                    selectionSet,
+                    void 0,
+                    type2
+                  );
+                } catch (error2) {
+                  source = error2;
+                }
+                if (source instanceof Error || source == null) {
+                  const fieldNodeResponseKeyMap = collectFields(
+                    schema,
+                    EMPTY_OBJECT,
+                    EMPTY_OBJECT,
+                    type2,
+                    selectionSet,
+                    /* @__PURE__ */ new Map(),
+                    /* @__PURE__ */ new Set()
+                  );
+                  const nullResult = {};
+                  for (const [
+                    responseKey,
+                    fieldNodes,
+                  ] of fieldNodeResponseKeyMap) {
+                    const combinedPath = [...path, responseKey];
+                    if (source instanceof GraphQLError) {
+                      nullResult[responseKey] = relocatedError(
+                        source,
+                        combinedPath
+                      );
+                    } else if (source instanceof Error) {
+                      nullResult[responseKey] = locatedError(
+                        source,
+                        fieldNodes,
+                        combinedPath
+                      );
+                    } else {
+                      nullResult[responseKey] = null;
+                    }
+                  }
+                  source = nullResult;
+                } else {
+                  if (source[UNPATHED_ERRORS_SYMBOL]) {
+                    combinedErrors.push(...source[UNPATHED_ERRORS_SYMBOL]);
+                  }
+                }
+                const objectSubschema = source[OBJECT_SUBSCHEMA_SYMBOL];
+                const fieldSubschemaMap = source[FIELD_SUBSCHEMA_MAP_SYMBOL];
+                for (const responseKey in source) {
+                  object[responseKey] = source[responseKey];
+                  combinedFieldSubschemaMap[responseKey] =
+                    (_a2 =
+                      fieldSubschemaMap === null || fieldSubschemaMap === void 0
+                        ? void 0
+                        : fieldSubschemaMap[responseKey]) !== null &&
+                    _a2 !== void 0
+                      ? _a2
+                      : objectSubschema;
+                }
+              }
+            }
+          )
+        );
+      }
+      function resolveExternalValue(
+        result2,
+        unpathedErrors,
+        subschema,
+        context,
+        info2,
+        returnType = getReturnType(info2),
+        skipTypeMerging
+      ) {
+        const type2 = getNullableType(returnType);
+        if (result2 instanceof Error) {
+          return result2;
+        }
+        if (result2 == null) {
+          return reportUnpathedErrorsViaNull(unpathedErrors);
+        }
+        if ("parseValue" in type2) {
+          return type2.parseValue(result2);
+        } else if (isCompositeType(type2)) {
+          return resolveExternalObject(
+            type2,
+            result2,
+            unpathedErrors,
+            subschema,
+            context,
+            info2,
+            skipTypeMerging
+          );
+        } else if (isListType(type2)) {
+          return resolveExternalList(
+            type2,
+            result2,
+            unpathedErrors,
+            subschema,
+            context,
+            info2,
+            skipTypeMerging
+          );
+        }
+      }
+      function resolveExternalObject(
+        type2,
+        object,
+        unpathedErrors,
+        subschema,
+        context,
+        info2,
+        skipTypeMerging
+      ) {
+        var _a2;
+        if (!isExternalObject(object)) {
+          annotateExternalObject(
+            object,
+            unpathedErrors,
+            subschema,
+            /* @__PURE__ */ Object.create(null)
+          );
+        }
+        if (skipTypeMerging || info2 == null) {
+          return object;
+        }
+        const stitchingInfo =
+          (_a2 = info2.schema.extensions) === null || _a2 === void 0
+            ? void 0
+            : _a2["stitchingInfo"];
+        if (stitchingInfo == null) {
+          return object;
+        }
+        const typeName = isAbstractType(type2) ? object.__typename : type2.name;
+        const mergedTypeInfo = stitchingInfo.mergedTypes[typeName];
+        let targetSubschemas;
+        if (mergedTypeInfo != null) {
+          targetSubschemas = mergedTypeInfo.targetSubschemas.get(subschema);
+        }
+        if (!targetSubschemas || !targetSubschemas.length) {
+          return object;
+        }
+        return mergeFields(mergedTypeInfo, object, subschema, context, info2);
+      }
+      function resolveExternalList(
+        type2,
+        list3,
+        unpathedErrors,
+        subschema,
+        context,
+        info2,
+        skipTypeMerging
+      ) {
+        return list3.map((listMember) =>
+          resolveExternalListMember(
+            getNullableType(type2.ofType),
+            listMember,
+            unpathedErrors,
+            subschema,
+            context,
+            info2,
+            skipTypeMerging
+          )
+        );
+      }
+      function resolveExternalListMember(
+        type2,
+        listMember,
+        unpathedErrors,
+        subschema,
+        context,
+        info2,
+        skipTypeMerging
+      ) {
+        if (listMember instanceof Error) {
+          return listMember;
+        }
+        if (listMember == null) {
+          return reportUnpathedErrorsViaNull(unpathedErrors);
+        }
+        if ("parseValue" in type2) {
+          return type2.parseValue(listMember);
+        } else if (isCompositeType(type2)) {
+          return resolveExternalObject(
+            type2,
+            listMember,
+            unpathedErrors,
+            subschema,
+            context,
+            info2,
+            skipTypeMerging
+          );
+        } else if (isListType(type2)) {
+          return resolveExternalList(
+            type2,
+            listMember,
+            unpathedErrors,
+            subschema,
+            context,
+            info2,
+            skipTypeMerging
+          );
+        }
+      }
+      const reportedErrors = /* @__PURE__ */ new WeakMap();
+      function reportUnpathedErrorsViaNull(unpathedErrors) {
+        if (unpathedErrors.length) {
+          const unreportedErrors = [];
+          for (const error2 of unpathedErrors) {
+            if (!reportedErrors.has(error2)) {
+              unreportedErrors.push(error2);
+              reportedErrors.set(error2, true);
+            }
+          }
+          if (unreportedErrors.length) {
+            if (unreportedErrors.length === 1) {
+              return unreportedErrors[0];
+            }
+            const combinedError = new AggregateErrorImpl(
+              unreportedErrors,
+              unreportedErrors.map((error2) => error2.message).join(", \n")
+            );
+            return locatedError(
+              combinedError,
+              void 0,
+              unreportedErrors[0].path
+            );
+          }
+        }
+        return null;
+      }
+      function getReturnType(info2) {
+        if (info2 == null) {
+          throw new Error(
+            `Return type cannot be inferred without a source schema.`
+          );
+        }
+        return info2.returnType;
+      }
+      function checkResultAndHandleErrors(result2, delegationContext) {
+        const {
+          context,
+          info: info2,
+          fieldName: responseKey = getResponseKey(info2),
+          subschema,
+          returnType = getReturnType$1(info2),
+          skipTypeMerging,
+          onLocatedError,
+        } = delegationContext;
+        const { data, unpathedErrors } = mergeDataAndErrors(
+          result2.data == null ? void 0 : result2.data[responseKey],
+          result2.errors == null ? [] : result2.errors,
+          info2 != null && info2.path ? pathToArray$1(info2.path) : void 0,
+          onLocatedError
+        );
+        return resolveExternalValue(
+          data,
+          unpathedErrors,
+          subschema,
+          context,
+          info2,
+          returnType,
+          skipTypeMerging
+        );
+      }
+      function mergeDataAndErrors(
+        data,
+        errors2,
+        path,
+        onLocatedError,
+        index = 1
+      ) {
+        var _a2;
+        if (data == null) {
+          if (!errors2.length) {
+            return { data: null, unpathedErrors: [] };
+          }
+          if (errors2.length === 1) {
+            const error2 = onLocatedError
+              ? onLocatedError(errors2[0])
+              : errors2[0];
+            const newPath =
+              path === void 0
+                ? error2.path
+                : error2.path === void 0
+                ? path
+                : path.concat(error2.path.slice(1));
+            return {
+              data: relocatedError(errors2[0], newPath),
+              unpathedErrors: [],
+            };
+          }
+          const combinedError = new AggregateErrorImpl(
+            errors2,
+            errors2.map((error2) => error2.message).join(", \n")
+          );
+          const newError = locatedError(combinedError, void 0, path);
+          return { data: newError, unpathedErrors: [] };
+        }
+        if (!errors2.length) {
+          return { data, unpathedErrors: [] };
+        }
+        const unpathedErrors = [];
+        const errorMap = /* @__PURE__ */ new Map();
+        for (const error2 of errors2) {
+          const pathSegment =
+            (_a2 = error2.path) === null || _a2 === void 0
+              ? void 0
+              : _a2[index];
+          if (pathSegment != null) {
+            let pathSegmentErrors = errorMap.get(pathSegment);
+            if (pathSegmentErrors === void 0) {
+              pathSegmentErrors = [error2];
+              errorMap.set(pathSegment, pathSegmentErrors);
+            } else {
+              pathSegmentErrors.push(error2);
+            }
+          } else {
+            unpathedErrors.push(error2);
+          }
+        }
+        for (const [pathSegment, pathSegmentErrors] of errorMap) {
+          if (data[pathSegment] !== void 0) {
+            const { data: newData, unpathedErrors: newErrors } =
+              mergeDataAndErrors(
+                data[pathSegment],
+                pathSegmentErrors,
+                path,
+                onLocatedError,
+                index + 1
+              );
+            data[pathSegment] = newData;
+            unpathedErrors.push(...newErrors);
+          } else {
+            unpathedErrors.push(...pathSegmentErrors);
+          }
+        }
+        return { data, unpathedErrors };
+      }
+      function getResponseKey(info2) {
+        if (info2 == null) {
+          throw new Error(
+            `Data cannot be extracted from result without an explicit key or source schema.`
+          );
+        }
+        return getResponseKeyFromInfo(info2);
+      }
+      function getReturnType$1(info2) {
+        if (info2 == null) {
+          throw new Error(
+            `Return type cannot be inferred without a source schema.`
+          );
+        }
+        return info2.returnType;
+      }
+      class Transformer {
+        constructor(context) {
+          this.transformations = [];
+          this.delegationContext = context;
+          const transforms = context.transforms;
+          const delegationTransforms = transforms.slice().reverse();
+          for (const transform of delegationTransforms) {
+            this.addTransform(transform, {});
+          }
+        }
+        addTransform(transform, context = {}) {
+          this.transformations.push({ transform, context });
+        }
+        transformRequest(originalRequest) {
+          var _a2;
+          let request = __spreadProps(__spreadValues({}, originalRequest), {
+            document: prepareGatewayDocument(
+              originalRequest.document,
+              this.delegationContext.transformedSchema,
+              this.delegationContext.returnType,
+              (_a2 = this.delegationContext.info) === null || _a2 === void 0
+                ? void 0
+                : _a2.schema
+            ),
+          });
+          for (const transformation of this.transformations) {
+            if (transformation.transform.transformRequest) {
+              request = transformation.transform.transformRequest(
+                request,
+                this.delegationContext,
+                transformation.context
+              );
+            }
+          }
+          return finalizeGatewayRequest(request, this.delegationContext);
+        }
+        transformResult(originalResult) {
+          let result2 = originalResult;
+          for (let i = this.transformations.length - 1; i >= 0; i--) {
+            const transformation = this.transformations[i];
+            if (transformation.transform.transformResult) {
+              result2 = transformation.transform.transformResult(
+                result2,
+                this.delegationContext,
+                transformation.context
+              );
+            }
+          }
+          return checkResultAndHandleErrors(result2, this.delegationContext);
+        }
+      }
+      function getDelegatingOperation(parentType, schema) {
+        if (parentType === schema.getMutationType()) {
+          return "mutation";
+        } else if (parentType === schema.getSubscriptionType()) {
+          return "subscription";
+        }
+        return "query";
+      }
+      function createRequest({
+        sourceSchema,
+        sourceParentType,
+        sourceFieldName,
+        fragments,
+        variableDefinitions,
+        variableValues,
+        targetRootValue,
+        targetOperationName,
+        targetOperation,
+        targetFieldName,
+        selectionSet,
+        fieldNodes,
+        context,
+        info: info2,
+      }) {
+        var _a2, _b;
+        let newSelectionSet;
+        const argumentNodeMap = /* @__PURE__ */ Object.create(null);
+        if (selectionSet != null) {
+          newSelectionSet = selectionSet;
+        } else {
+          const selections = [];
+          for (const fieldNode of fieldNodes || []) {
+            if (fieldNode.selectionSet) {
+              for (const selection of fieldNode.selectionSet.selections) {
+                selections.push(selection);
+              }
+            }
+          }
+          newSelectionSet = selections.length
+            ? {
+                kind: Kind.SELECTION_SET,
+                selections,
+              }
+            : void 0;
+          const args =
+            (_a2 =
+              fieldNodes === null || fieldNodes === void 0
+                ? void 0
+                : fieldNodes[0]) === null || _a2 === void 0
+              ? void 0
+              : _a2.arguments;
+          if (args) {
+            for (const argNode of args) {
+              argumentNodeMap[argNode.name.value] = argNode;
+            }
+          }
+        }
+        const newVariables = /* @__PURE__ */ Object.create(null);
+        const variableDefinitionMap = /* @__PURE__ */ Object.create(null);
+        if (sourceSchema != null && variableDefinitions != null) {
+          for (const def of variableDefinitions) {
+            const varName = def.variable.name.value;
+            variableDefinitionMap[varName] = def;
+            const varType = typeFromAST(sourceSchema, def.type);
+            const serializedValue = serializeInputValue(
+              varType,
+              variableValues === null || variableValues === void 0
+                ? void 0
+                : variableValues[varName]
+            );
+            if (serializedValue !== void 0) {
+              newVariables[varName] = serializedValue;
+            }
+          }
+        }
+        if (sourceParentType != null && sourceFieldName != null) {
+          updateArgumentsWithDefaults(
+            sourceParentType,
+            sourceFieldName,
+            argumentNodeMap,
+            variableDefinitionMap,
+            newVariables
+          );
+        }
+        const rootFieldName =
+          targetFieldName !== null && targetFieldName !== void 0
+            ? targetFieldName
+            : (_b =
+                fieldNodes === null || fieldNodes === void 0
+                  ? void 0
+                  : fieldNodes[0]) === null || _b === void 0
+            ? void 0
+            : _b.name.value;
+        if (rootFieldName === void 0) {
+          throw new Error(
+            `Either "targetFieldName" or a non empty "fieldNodes" array must be provided.`
+          );
+        }
+        const rootfieldNode = {
+          kind: Kind.FIELD,
+          arguments: Object.values(argumentNodeMap),
+          name: {
+            kind: Kind.NAME,
+            value: rootFieldName,
+          },
+          selectionSet: newSelectionSet,
+        };
+        const operationName = targetOperationName
+          ? {
+              kind: Kind.NAME,
+              value: targetOperationName,
+            }
+          : void 0;
+        const operationDefinition = {
+          kind: Kind.OPERATION_DEFINITION,
+          name: operationName,
+          operation: targetOperation,
+          variableDefinitions: Object.values(variableDefinitionMap),
+          selectionSet: {
+            kind: Kind.SELECTION_SET,
+            selections: [rootfieldNode],
+          },
+        };
+        const definitions = [operationDefinition];
+        if (fragments != null) {
+          for (const fragmentName in fragments) {
+            const fragment = fragments[fragmentName];
+            definitions.push(fragment);
+          }
+        }
+        const document2 = {
+          kind: Kind.DOCUMENT,
+          definitions,
+        };
+        return {
+          document: document2,
+          variables: newVariables,
+          rootValue: targetRootValue,
+          operationName: targetOperationName,
+          context,
+          info: info2,
+          operationType: targetOperation,
+        };
+      }
+      function updateArgumentsWithDefaults(
+        sourceParentType,
+        sourceFieldName,
+        argumentNodeMap,
+        variableDefinitionMap,
+        variableValues
+      ) {
+        const generateVariableName = createVariableNameGenerator(
+          variableDefinitionMap
+        );
+        const sourceField = sourceParentType.getFields()[sourceFieldName];
+        for (const argument of sourceField.args) {
+          const argName = argument.name;
+          const sourceArgType = argument.type;
+          if (argumentNodeMap[argName] === void 0) {
+            const defaultValue2 = argument.defaultValue;
+            if (defaultValue2 !== void 0) {
+              updateArgument(
+                argumentNodeMap,
+                variableDefinitionMap,
+                variableValues,
+                argName,
+                generateVariableName(argName),
+                sourceArgType,
+                serializeInputValue(sourceArgType, defaultValue2)
+              );
+            }
+          }
+        }
+      }
+      function defaultMergedResolver(parent, args, context, info2) {
+        if (!parent) {
+          return null;
+        }
+        const responseKey = getResponseKeyFromInfo(info2);
+        if (!isExternalObject(parent)) {
+          return defaultFieldResolver$1(parent, args, context, info2);
+        }
+        const data = parent[responseKey];
+        const unpathedErrors = getUnpathedErrors(parent);
+        const subschema = getSubschema(parent, responseKey);
+        return resolveExternalValue(
+          data,
+          unpathedErrors,
+          subschema,
+          context,
+          info2
+        );
+      }
+      function isSubschemaConfig(value) {
+        return Boolean(
+          value === null || value === void 0 ? void 0 : value.schema
+        );
+      }
+      function delegateToSchema(options) {
+        var _a2, _b;
+        const {
+          info: info2,
+          schema,
+          rootValue = (_a2 = schema.rootValue) !== null && _a2 !== void 0
+            ? _a2
+            : info2.rootValue,
+          operationName = (_b = info2.operation.name) === null || _b === void 0
+            ? void 0
+            : _b.value,
+          operation = getDelegatingOperation(info2.parentType, info2.schema),
+          fieldName = info2.fieldName,
+          selectionSet,
+          fieldNodes = info2.fieldNodes,
+          context,
+        } = options;
+        const request = createRequest({
+          sourceSchema: info2.schema,
+          sourceParentType: info2.parentType,
+          sourceFieldName: info2.fieldName,
+          fragments: info2.fragments,
+          variableDefinitions: info2.operation.variableDefinitions,
+          variableValues: info2.variableValues,
+          targetRootValue: rootValue,
+          targetOperationName: operationName,
+          targetOperation: operation,
+          targetFieldName: fieldName,
+          selectionSet,
+          fieldNodes,
+          context,
+          info: info2,
+        });
+        return delegateRequest(
+          __spreadProps(__spreadValues({}, options), {
+            request,
+          })
+        );
+      }
+      function getDelegationReturnType(targetSchema, operation, fieldName) {
+        const rootType = getDefinedRootType(targetSchema, operation);
+        return rootType.getFields()[fieldName].type;
+      }
+      function delegateRequest(options) {
+        const delegationContext = getDelegationContext(options);
+        const transformer = new Transformer(delegationContext);
+        const processedRequest = transformer.transformRequest(options.request);
+        if (options.validateRequest) {
+          validateRequest(delegationContext, processedRequest.document);
+        }
+        const executor = getExecutor(delegationContext);
+        return new ValueOrPromise(() => executor(processedRequest))
+          .then((originalResult) => {
+            if (isAsyncIterable$1(originalResult)) {
+              const iterator = originalResult[Symbol.asyncIterator]();
+              return mapAsyncIterator(iterator, (result2) =>
+                transformer.transformResult(result2)
+              );
+            }
+            return transformer.transformResult(originalResult);
+          })
+          .resolve();
+      }
+      function getDelegationContext({
+        request,
+        schema,
+        fieldName,
+        returnType,
+        args,
+        info: info2,
+        transforms = [],
+        transformedSchema,
+        skipTypeMerging = false,
+      }) {
+        var _a2, _b, _c, _d;
+        const operationDefinition = getOperationASTFromRequest(request);
+        let targetFieldName;
+        if (fieldName == null) {
+          targetFieldName =
+            operationDefinition.selectionSet.selections[0].name.value;
+        } else {
+          targetFieldName = fieldName;
+        }
+        const stitchingInfo =
+          (_a2 =
+            info2 === null || info2 === void 0
+              ? void 0
+              : info2.schema.extensions) === null || _a2 === void 0
+            ? void 0
+            : _a2["stitchingInfo"];
+        const subschemaOrSubschemaConfig =
+          (_b =
+            stitchingInfo === null || stitchingInfo === void 0
+              ? void 0
+              : stitchingInfo.subschemaMap.get(schema)) !== null &&
+          _b !== void 0
+            ? _b
+            : schema;
+        const operation = operationDefinition.operation;
+        if (isSubschemaConfig(subschemaOrSubschemaConfig)) {
+          const targetSchema = subschemaOrSubschemaConfig.schema;
+          return {
+            subschema: schema,
+            subschemaConfig: subschemaOrSubschemaConfig,
+            targetSchema,
+            operation,
+            fieldName: targetFieldName,
+            args,
+            context: request.context,
+            info: info2,
+            returnType:
+              (_c =
+                returnType !== null && returnType !== void 0
+                  ? returnType
+                  : info2 === null || info2 === void 0
+                  ? void 0
+                  : info2.returnType) !== null && _c !== void 0
+                ? _c
+                : getDelegationReturnType(
+                    targetSchema,
+                    operation,
+                    targetFieldName
+                  ),
+            transforms:
+              subschemaOrSubschemaConfig.transforms != null
+                ? subschemaOrSubschemaConfig.transforms.concat(transforms)
+                : transforms,
+            transformedSchema:
+              transformedSchema !== null && transformedSchema !== void 0
+                ? transformedSchema
+                : subschemaOrSubschemaConfig instanceof Subschema
+                ? subschemaOrSubschemaConfig.transformedSchema
+                : targetSchema,
+            skipTypeMerging,
+          };
+        }
+        return {
+          subschema: schema,
+          subschemaConfig: void 0,
+          targetSchema: subschemaOrSubschemaConfig,
+          operation,
+          fieldName: targetFieldName,
+          args,
+          context: request.context,
+          info: info2,
+          returnType:
+            (_d =
+              returnType !== null && returnType !== void 0
+                ? returnType
+                : info2 === null || info2 === void 0
+                ? void 0
+                : info2.returnType) !== null && _d !== void 0
+              ? _d
+              : getDelegationReturnType(
+                  subschemaOrSubschemaConfig,
+                  operation,
+                  targetFieldName
+                ),
+          transforms,
+          transformedSchema:
+            transformedSchema !== null && transformedSchema !== void 0
+              ? transformedSchema
+              : subschemaOrSubschemaConfig,
+          skipTypeMerging,
+        };
+      }
+      function validateRequest(delegationContext, document2) {
+        const errors2 = validate(delegationContext.targetSchema, document2);
+        if (errors2.length > 0) {
+          if (errors2.length > 1) {
+            const combinedError = new AggregateErrorImpl(
+              errors2,
+              errors2.map((error3) => error3.message).join(", \n")
+            );
+            throw combinedError;
+          }
+          const error2 = errors2[0];
+          throw error2.originalError || error2;
+        }
+      }
+      const GLOBAL_CONTEXT = {};
+      function getExecutor(delegationContext) {
+        const { subschemaConfig, targetSchema, context } = delegationContext;
+        let executor =
+          (subschemaConfig === null || subschemaConfig === void 0
+            ? void 0
+            : subschemaConfig.executor) || createDefaultExecutor(targetSchema);
+        if (
+          subschemaConfig === null || subschemaConfig === void 0
+            ? void 0
+            : subschemaConfig.batch
+        ) {
+          const batchingOptions =
+            subschemaConfig === null || subschemaConfig === void 0
+              ? void 0
+              : subschemaConfig.batchingOptions;
+          executor = getBatchingExecutor(
+            context !== null && context !== void 0 ? context : GLOBAL_CONTEXT,
+            executor,
+            batchingOptions === null || batchingOptions === void 0
+              ? void 0
+              : batchingOptions.dataLoaderOptions,
+            batchingOptions === null || batchingOptions === void 0
+              ? void 0
+              : batchingOptions.extensionsReducer
+          );
+        }
+        return executor;
+      }
+      const createDefaultExecutor = memoize1$1(function createDefaultExecutor2(
+        schema
+      ) {
+        const executorInstance = new Executor({ schema });
+        return function defaultExecutor(request) {
+          const executionArgs = {
+            document: request.document,
+            rootValue: request.rootValue,
+            contextValue: request.context,
+            variableValues: request.variables,
+            operationName: request.operationName,
+          };
+          return executorInstance.execute(executionArgs);
+        };
+      });
+      function generateProxyingResolvers(subschemaConfig) {
+        var _a2;
+        const targetSchema = subschemaConfig.schema;
+        const createProxyingResolver =
+          (_a2 = subschemaConfig.createProxyingResolver) !== null &&
+          _a2 !== void 0
+            ? _a2
+            : defaultCreateProxyingResolver;
+        const transformedSchema = applySchemaTransforms(
+          targetSchema,
+          subschemaConfig
+        );
+        const rootTypeMap = getRootTypeMap(targetSchema);
+        const resolvers = {};
+        for (const [operation, rootType] of rootTypeMap.entries()) {
+          const typeName = rootType.name;
+          const fields = rootType.getFields();
+          resolvers[typeName] = {};
+          for (const fieldName in fields) {
+            const proxyingResolver = createProxyingResolver({
+              subschemaConfig,
+              transformedSchema,
+              operation,
+              fieldName,
+            });
+            const finalResolver = createPossiblyNestedProxyingResolver(
+              subschemaConfig,
+              proxyingResolver
+            );
+            if (operation === "subscription") {
+              resolvers[typeName][fieldName] = {
+                subscribe: finalResolver,
+                resolve: identical,
+              };
+            } else {
+              resolvers[typeName][fieldName] = {
+                resolve: finalResolver,
+              };
+            }
+          }
+        }
+        return resolvers;
+      }
+      function identical(value) {
+        return value;
+      }
+      function createPossiblyNestedProxyingResolver(
+        subschemaConfig,
+        proxyingResolver
+      ) {
+        return function possiblyNestedProxyingResolver(
+          parent,
+          args,
+          context,
+          info2
+        ) {
+          if (parent != null) {
+            const responseKey = getResponseKeyFromInfo(info2);
+            if (isExternalObject(parent)) {
+              const unpathedErrors = getUnpathedErrors(parent);
+              const subschema = getSubschema(parent, responseKey);
+              if (
+                subschemaConfig === subschema &&
+                parent[responseKey] !== void 0
+              ) {
+                return resolveExternalValue(
+                  parent[responseKey],
+                  unpathedErrors,
+                  subschema,
+                  context,
+                  info2
+                );
+              }
+            }
+          }
+          return proxyingResolver(parent, args, context, info2);
+        };
+      }
+      function defaultCreateProxyingResolver({
+        subschemaConfig,
+        operation,
+        transformedSchema,
+      }) {
+        return function proxyingResolver(_parent, _args, context, info2) {
+          return delegateToSchema({
+            schema: subschemaConfig,
+            operation,
+            context,
+            info: info2,
+            transformedSchema,
+          });
+        };
+      }
+      function wrapSchema(subschemaConfig) {
+        const targetSchema = subschemaConfig.schema;
+        const proxyingResolvers = generateProxyingResolvers(subschemaConfig);
+        const schema = createWrappingSchema(targetSchema, proxyingResolvers);
+        const transformedSchema = applySchemaTransforms(
+          schema,
+          subschemaConfig
+        );
+        return applySchemaTransforms(
+          schema,
+          subschemaConfig,
+          transformedSchema
+        );
+      }
+      function createWrappingSchema(schema, proxyingResolvers) {
+        return mapSchema(schema, {
+          [MapperKind.ROOT_OBJECT]: (type2) => {
+            var _a2;
+            const config2 = type2.toConfig();
+            const fieldConfigMap = config2.fields;
+            for (const fieldName in fieldConfigMap) {
+              const field = fieldConfigMap[fieldName];
+              if (field == null) {
+                continue;
+              }
+              fieldConfigMap[fieldName] = __spreadValues(
+                __spreadValues({}, field),
+                (_a2 = proxyingResolvers[type2.name]) === null || _a2 === void 0
+                  ? void 0
+                  : _a2[fieldName]
+              );
+            }
+            return new GraphQLObjectType(config2);
+          },
+          [MapperKind.OBJECT_TYPE]: (type2) => {
+            const config2 = type2.toConfig();
+            config2.isTypeOf = void 0;
+            for (const fieldName in config2.fields) {
+              const field = config2.fields[fieldName];
+              if (field == null) {
+                continue;
+              }
+              field.resolve = defaultMergedResolver;
+              field.subscribe = void 0;
+            }
+            return new GraphQLObjectType(config2);
+          },
+          [MapperKind.INTERFACE_TYPE]: (type2) => {
+            const config2 = type2.toConfig();
+            delete config2.resolveType;
+            return new GraphQLInterfaceType(config2);
+          },
+          [MapperKind.UNION_TYPE]: (type2) => {
+            const config2 = type2.toConfig();
+            delete config2.resolveType;
+            return new GraphQLUnionType(config2);
+          },
+        });
+      }
+      function getSchemaFromIntrospection(introspectionResult, options) {
+        var _a2;
+        if (
+          (_a2 =
+            introspectionResult === null || introspectionResult === void 0
+              ? void 0
+              : introspectionResult.data) === null || _a2 === void 0
+            ? void 0
+            : _a2.__schema
+        ) {
+          return buildClientSchema(introspectionResult.data, options);
+        }
+        throw new Error(
+          "Could not obtain introspection result, received: " +
+            JSON.stringify(introspectionResult)
+        );
+      }
+      function introspectSchema(executor, context, options) {
+        const parsedIntrospectionQuery = parse$1(
+          getIntrospectionQuery(options),
+          options
+        );
+        return new ValueOrPromise(() =>
+          executor({
+            document: parsedIntrospectionQuery,
+            context,
+          })
+        )
+          .then((introspection2) => {
+            if (isAsyncIterable$1(introspection2)) {
+              const iterator = introspection2[Symbol.asyncIterator]();
+              return iterator.next().then(({ value }) => value);
+            }
+            return introspection2;
+          })
+          .then((introspection2) =>
+            getSchemaFromIntrospection(introspection2, options)
+          )
+          .resolve();
+      }
+      const baseHasOwnProperty = Object.prototype.hasOwnProperty;
+      function isObject$3(val) {
+        return typeof val === "object" && val !== null;
+      }
+      function areGraphQLErrors(obj) {
+        return (
+          Array.isArray(obj) &&
+          obj.length > 0 &&
+          obj.every((ob2) => "message" in ob2)
+        );
+      }
+      function hasOwnProperty(obj, prop2) {
+        return baseHasOwnProperty.call(obj, prop2);
+      }
+      function hasOwnObjectProperty(obj, prop2) {
+        return baseHasOwnProperty.call(obj, prop2) && isObject$3(obj[prop2]);
+      }
+      function hasOwnStringProperty(obj, prop2) {
+        return (
+          baseHasOwnProperty.call(obj, prop2) && typeof obj[prop2] === "string"
+        );
+      }
+      function limitCloseReason(reason, whenTooLong) {
+        return reason.length < 124 ? reason : whenTooLong;
+      }
+      const GRAPHQL_TRANSPORT_WS_PROTOCOL = "graphql-transport-ws";
+      var CloseCode;
+      (function (CloseCode2) {
+        CloseCode2[(CloseCode2["InternalServerError"] = 4500)] =
+          "InternalServerError";
+        CloseCode2[(CloseCode2["InternalClientError"] = 4005)] =
+          "InternalClientError";
+        CloseCode2[(CloseCode2["BadRequest"] = 4400)] = "BadRequest";
+        CloseCode2[(CloseCode2["BadResponse"] = 4004)] = "BadResponse";
+        CloseCode2[(CloseCode2["Unauthorized"] = 4401)] = "Unauthorized";
+        CloseCode2[(CloseCode2["Forbidden"] = 4403)] = "Forbidden";
+        CloseCode2[(CloseCode2["SubprotocolNotAcceptable"] = 4406)] =
+          "SubprotocolNotAcceptable";
+        CloseCode2[(CloseCode2["ConnectionInitialisationTimeout"] = 4408)] =
+          "ConnectionInitialisationTimeout";
+        CloseCode2[(CloseCode2["ConnectionAcknowledgementTimeout"] = 4504)] =
+          "ConnectionAcknowledgementTimeout";
+        CloseCode2[(CloseCode2["SubscriberAlreadyExists"] = 4409)] =
+          "SubscriberAlreadyExists";
+        CloseCode2[(CloseCode2["TooManyInitialisationRequests"] = 4429)] =
+          "TooManyInitialisationRequests";
+      })(CloseCode || (CloseCode = {}));
+      var MessageType;
+      (function (MessageType2) {
+        MessageType2["ConnectionInit"] = "connection_init";
+        MessageType2["ConnectionAck"] = "connection_ack";
+        MessageType2["Ping"] = "ping";
+        MessageType2["Pong"] = "pong";
+        MessageType2["Subscribe"] = "subscribe";
+        MessageType2["Next"] = "next";
+        MessageType2["Error"] = "error";
+        MessageType2["Complete"] = "complete";
+      })(MessageType || (MessageType = {}));
+      function isMessage(val) {
+        if (isObject$3(val)) {
+          if (!hasOwnStringProperty(val, "type")) {
+            return false;
+          }
+          switch (val.type) {
+            case MessageType.ConnectionInit:
+              return (
+                !hasOwnProperty(val, "payload") ||
+                val.payload === void 0 ||
+                isObject$3(val.payload)
+              );
+            case MessageType.ConnectionAck:
+            case MessageType.Ping:
+            case MessageType.Pong:
+              return (
+                !hasOwnProperty(val, "payload") ||
+                val.payload === void 0 ||
+                isObject$3(val.payload)
+              );
+            case MessageType.Subscribe:
+              return (
+                hasOwnStringProperty(val, "id") &&
+                hasOwnObjectProperty(val, "payload") &&
+                (!hasOwnProperty(val.payload, "operationName") ||
+                  val.payload.operationName === void 0 ||
+                  val.payload.operationName === null ||
+                  typeof val.payload.operationName === "string") &&
+                hasOwnStringProperty(val.payload, "query") &&
+                (!hasOwnProperty(val.payload, "variables") ||
+                  val.payload.variables === void 0 ||
+                  val.payload.variables === null ||
+                  hasOwnObjectProperty(val.payload, "variables")) &&
+                (!hasOwnProperty(val.payload, "extensions") ||
+                  val.payload.extensions === void 0 ||
+                  val.payload.extensions === null ||
+                  hasOwnObjectProperty(val.payload, "extensions"))
+              );
+            case MessageType.Next:
+              return (
+                hasOwnStringProperty(val, "id") &&
+                hasOwnObjectProperty(val, "payload")
+              );
+            case MessageType.Error:
+              return (
+                hasOwnStringProperty(val, "id") && areGraphQLErrors(val.payload)
+              );
+            case MessageType.Complete:
+              return hasOwnStringProperty(val, "id");
+            default:
+              return false;
+          }
+        }
+        return false;
+      }
+      function parseMessage(data, reviver) {
+        if (isMessage(data)) {
+          return data;
+        }
+        if (typeof data !== "string") {
+          throw new Error("Message not parsable");
+        }
+        const message = JSON.parse(data, reviver);
+        if (!isMessage(message)) {
+          throw new Error("Invalid message");
+        }
+        return message;
+      }
+      function stringifyMessage(msg, replacer) {
+        if (!isMessage(msg)) {
+          throw new Error("Cannot stringify invalid message");
+        }
+        return JSON.stringify(msg, replacer);
+      }
+      function createClient$1(options) {
+        const {
+          url,
+          connectionParams,
+          lazy = true,
+          onNonLazyError = console.error,
+          lazyCloseTimeout = 0,
+          keepAlive = 0,
+          disablePong,
+          connectionAckWaitTimeout = 0,
+          retryAttempts = 5,
+          retryWait = async function randomisedExponentialBackoff(retries2) {
+            let retryDelay = 1e3;
+            for (let i = 0; i < retries2; i++) {
+              retryDelay *= 2;
+            }
+            await new Promise((resolve) =>
+              setTimeout(
+                resolve,
+                retryDelay + Math.floor(Math.random() * (3e3 - 300) + 300)
+              )
+            );
+          },
+          isFatalConnectionProblem = (errOrCloseEvent) =>
+            !isLikeCloseEvent(errOrCloseEvent),
+          on,
+          webSocketImpl,
+          generateID = function generateUUID() {
+            return "xxxxxxxx-xxxx-4xxx-yxxx-xxxxxxxxxxxx".replace(
+              /[xy]/g,
+              (c) => {
+                const r2 = (Math.random() * 16) | 0,
+                  v2 = c == "x" ? r2 : (r2 & 3) | 8;
+                return v2.toString(16);
+              }
+            );
+          },
+          jsonMessageReplacer: replacer,
+          jsonMessageReviver: reviver,
+        } = options;
+        let ws2;
+        if (webSocketImpl) {
+          if (!isWebSocket(webSocketImpl)) {
+            throw new Error("Invalid WebSocket implementation provided");
+          }
+          ws2 = webSocketImpl;
+        } else if (typeof WebSocket !== "undefined") {
+          ws2 = WebSocket;
+        } else if (typeof global !== "undefined") {
+          ws2 = global.WebSocket || global.MozWebSocket;
+        } else if (typeof window !== "undefined") {
+          ws2 = window.WebSocket || window.MozWebSocket;
+        }
+        if (!ws2)
+          throw new Error(
+            "WebSocket implementation missing; on Node you can `import WebSocket from 'ws';` and pass `webSocketImpl: WebSocket` to `createClient`"
+          );
+        const WebSocketImpl = ws2;
+        const emitter = (() => {
+          const message = (() => {
+            const listeners3 = {};
+            return {
+              on(id2, listener) {
+                listeners3[id2] = listener;
+                return () => {
+                  delete listeners3[id2];
+                };
+              },
+              emit(message2) {
+                var _a2;
+                if ("id" in message2)
+                  (_a2 = listeners3[message2.id]) === null || _a2 === void 0
+                    ? void 0
+                    : _a2.call(listeners3, message2);
+              },
+            };
+          })();
+          const listeners2 = {
+            connecting: (on === null || on === void 0 ? void 0 : on.connecting)
+              ? [on.connecting]
+              : [],
+            opened: (on === null || on === void 0 ? void 0 : on.opened)
+              ? [on.opened]
+              : [],
+            connected: (on === null || on === void 0 ? void 0 : on.connected)
+              ? [on.connected]
+              : [],
+            ping: (on === null || on === void 0 ? void 0 : on.ping)
+              ? [on.ping]
+              : [],
+            pong: (on === null || on === void 0 ? void 0 : on.pong)
+              ? [on.pong]
+              : [],
+            message: (on === null || on === void 0 ? void 0 : on.message)
+              ? [message.emit, on.message]
+              : [message.emit],
+            closed: (on === null || on === void 0 ? void 0 : on.closed)
+              ? [on.closed]
+              : [],
+            error: (on === null || on === void 0 ? void 0 : on.error)
+              ? [on.error]
+              : [],
+          };
+          return {
+            onMessage: message.on,
+            on(event, listener) {
+              const l2 = listeners2[event];
+              l2.push(listener);
+              return () => {
+                l2.splice(l2.indexOf(listener), 1);
+              };
+            },
+            emit(event, ...args) {
+              for (const listener of [...listeners2[event]]) {
+                listener(...args);
+              }
+            },
+          };
+        })();
+        function errorOrClosed(cb2) {
+          const listening = [
+            emitter.on("error", (err) => {
+              listening.forEach((unlisten) => unlisten());
+              cb2(err);
+            }),
+            emitter.on("closed", (event) => {
+              listening.forEach((unlisten) => unlisten());
+              cb2(event);
+            }),
+          ];
+        }
+        let connecting,
+          locks = 0,
+          retrying = false,
+          retries = 0,
+          disposed = false;
+        async function connect2() {
+          const [socket, throwOnClose] = await (connecting !== null &&
+          connecting !== void 0
+            ? connecting
+            : (connecting = new Promise((connected, denied) =>
+                (async () => {
+                  if (retrying) {
+                    await retryWait(retries);
+                    if (!locks) {
+                      connecting = void 0;
+                      return denied({
+                        code: 1e3,
+                        reason: "All Subscriptions Gone",
+                      });
+                    }
+                    retries++;
+                  }
+                  emitter.emit("connecting");
+                  const socket2 = new WebSocketImpl(
+                    typeof url === "function" ? await url() : url,
+                    GRAPHQL_TRANSPORT_WS_PROTOCOL
+                  );
+                  let connectionAckTimeout, queuedPing;
+                  function enqueuePing() {
+                    if (isFinite(keepAlive) && keepAlive > 0) {
+                      clearTimeout(queuedPing);
+                      queuedPing = setTimeout(() => {
+                        if (socket2.readyState === WebSocketImpl.OPEN) {
+                          socket2.send(
+                            stringifyMessage({ type: MessageType.Ping })
+                          );
+                          emitter.emit("ping", false, void 0);
+                        }
+                      }, keepAlive);
+                    }
+                  }
+                  errorOrClosed((errOrEvent) => {
+                    connecting = void 0;
+                    clearTimeout(connectionAckTimeout);
+                    clearTimeout(queuedPing);
+                    denied(errOrEvent);
+                    if (
+                      isLikeCloseEvent(errOrEvent) &&
+                      errOrEvent.code === 4499
+                    ) {
+                      socket2.close(4499, "Terminated");
+                      socket2.onerror = null;
+                      socket2.onclose = null;
+                    }
+                  });
+                  socket2.onerror = (err) => emitter.emit("error", err);
+                  socket2.onclose = (event) => emitter.emit("closed", event);
+                  socket2.onopen = async () => {
+                    try {
+                      emitter.emit("opened", socket2);
+                      const payload =
+                        typeof connectionParams === "function"
+                          ? await connectionParams()
+                          : connectionParams;
+                      if (socket2.readyState !== WebSocketImpl.OPEN) return;
+                      socket2.send(
+                        stringifyMessage(
+                          payload
+                            ? {
+                                type: MessageType.ConnectionInit,
+                                payload,
+                              }
+                            : {
+                                type: MessageType.ConnectionInit,
+                              },
+                          replacer
+                        )
+                      );
+                      if (
+                        isFinite(connectionAckWaitTimeout) &&
+                        connectionAckWaitTimeout > 0
+                      ) {
+                        connectionAckTimeout = setTimeout(() => {
+                          socket2.close(
+                            CloseCode.ConnectionAcknowledgementTimeout,
+                            "Connection acknowledgement timeout"
+                          );
+                        }, connectionAckWaitTimeout);
+                      }
+                      enqueuePing();
+                    } catch (err) {
+                      emitter.emit("error", err);
+                      socket2.close(
+                        CloseCode.InternalClientError,
+                        limitCloseReason(
+                          err instanceof Error
+                            ? err.message
+                            : new Error(err).message,
+                          "Internal client error"
+                        )
+                      );
+                    }
+                  };
+                  let acknowledged = false;
+                  socket2.onmessage = ({ data }) => {
+                    try {
+                      const message = parseMessage(data, reviver);
+                      emitter.emit("message", message);
+                      if (message.type === "ping" || message.type === "pong") {
+                        emitter.emit(message.type, true, message.payload);
+                        if (message.type === "pong") {
+                          enqueuePing();
+                        } else if (!disablePong) {
+                          socket2.send(
+                            stringifyMessage(
+                              message.payload
+                                ? {
+                                    type: MessageType.Pong,
+                                    payload: message.payload,
+                                  }
+                                : {
+                                    type: MessageType.Pong,
+                                  }
+                            )
+                          );
+                          emitter.emit("pong", false, message.payload);
+                        }
+                        return;
+                      }
+                      if (acknowledged) return;
+                      if (message.type !== MessageType.ConnectionAck)
+                        throw new Error(
+                          `First message cannot be of type ${message.type}`
+                        );
+                      clearTimeout(connectionAckTimeout);
+                      acknowledged = true;
+                      emitter.emit("connected", socket2, message.payload);
+                      retrying = false;
+                      retries = 0;
+                      connected([
+                        socket2,
+                        new Promise((_, reject2) => errorOrClosed(reject2)),
+                      ]);
+                    } catch (err) {
+                      socket2.onmessage = null;
+                      emitter.emit("error", err);
+                      socket2.close(
+                        CloseCode.BadResponse,
+                        limitCloseReason(
+                          err instanceof Error
+                            ? err.message
+                            : new Error(err).message,
+                          "Bad response"
+                        )
+                      );
+                    }
+                  };
+                })()
+              )));
+          if (socket.readyState === WebSocketImpl.CLOSING) await throwOnClose;
+          let release = () => {};
+          const released = new Promise((resolve) => (release = resolve));
+          return [
+            socket,
+            release,
+            Promise.race([
+              released.then(() => {
+                if (!locks) {
+                  const complete = () => socket.close(1e3, "Normal Closure");
+                  if (isFinite(lazyCloseTimeout) && lazyCloseTimeout > 0) {
+                    setTimeout(() => {
+                      if (!locks && socket.readyState === WebSocketImpl.OPEN)
+                        complete();
+                    }, lazyCloseTimeout);
+                  } else {
+                    complete();
+                  }
+                }
+              }),
+              throwOnClose,
+            ]),
+          ];
+        }
+        function shouldRetryConnectOrThrow(errOrCloseEvent) {
+          if (
+            isLikeCloseEvent(errOrCloseEvent) &&
+            (isFatalInternalCloseCode(errOrCloseEvent.code) ||
+              [
+                CloseCode.InternalServerError,
+                CloseCode.InternalClientError,
+                CloseCode.BadRequest,
+                CloseCode.BadResponse,
+                CloseCode.Unauthorized,
+                CloseCode.SubprotocolNotAcceptable,
+                CloseCode.SubscriberAlreadyExists,
+                CloseCode.TooManyInitialisationRequests,
+              ].includes(errOrCloseEvent.code))
+          )
+            throw errOrCloseEvent;
+          if (disposed) return false;
+          if (isLikeCloseEvent(errOrCloseEvent) && errOrCloseEvent.code === 1e3)
+            return locks > 0;
+          if (!retryAttempts || retries >= retryAttempts) throw errOrCloseEvent;
+          if (isFatalConnectionProblem(errOrCloseEvent)) throw errOrCloseEvent;
+          return (retrying = true);
+        }
+        if (!lazy) {
+          (async () => {
+            locks++;
+            for (;;) {
+              try {
+                const [, , throwOnClose] = await connect2();
+                await throwOnClose;
+              } catch (errOrCloseEvent) {
+                try {
+                  if (!shouldRetryConnectOrThrow(errOrCloseEvent)) return;
+                } catch (errOrCloseEvent2) {
+                  return onNonLazyError === null || onNonLazyError === void 0
+                    ? void 0
+                    : onNonLazyError(errOrCloseEvent2);
+                }
+              }
+            }
+          })();
+        }
+        return {
+          on: emitter.on,
+          subscribe(payload, sink) {
+            const id2 = generateID();
+            let done = false,
+              errored = false,
+              releaser = () => {
+                locks--;
+                done = true;
+              };
+            (async () => {
+              locks++;
+              for (;;) {
+                try {
+                  const [socket, release, waitForReleaseOrThrowOnClose] =
+                    await connect2();
+                  if (done) return release();
+                  const unlisten = emitter.onMessage(id2, (message) => {
+                    switch (message.type) {
+                      case MessageType.Next: {
+                        sink.next(message.payload);
+                        return;
+                      }
+                      case MessageType.Error: {
+                        (errored = true), (done = true);
+                        sink.error(message.payload);
+                        releaser();
+                        return;
+                      }
+                      case MessageType.Complete: {
+                        done = true;
+                        releaser();
+                        return;
+                      }
+                    }
+                  });
+                  socket.send(
+                    stringifyMessage(
+                      {
+                        id: id2,
+                        type: MessageType.Subscribe,
+                        payload,
+                      },
+                      replacer
+                    )
+                  );
+                  releaser = () => {
+                    if (!done && socket.readyState === WebSocketImpl.OPEN)
+                      socket.send(
+                        stringifyMessage(
+                          {
+                            id: id2,
+                            type: MessageType.Complete,
+                          },
+                          replacer
+                        )
+                      );
+                    locks--;
+                    done = true;
+                    release();
+                  };
+                  await waitForReleaseOrThrowOnClose.finally(unlisten);
+                  return;
+                } catch (errOrCloseEvent) {
+                  if (!shouldRetryConnectOrThrow(errOrCloseEvent)) return;
+                }
+              }
+            })()
+              .then(() => {
+                if (!errored) sink.complete();
+              })
+              .catch((err) => {
+                sink.error(err);
+              });
+            return () => {
+              if (!done) releaser();
+            };
+          },
+          async dispose() {
+            disposed = true;
+            if (connecting) {
+              const [socket] = await connecting;
+              socket.close(1e3, "Normal Closure");
+            }
+          },
+          terminate() {
+            if (connecting) {
+              emitter.emit("closed", {
+                code: 4499,
+                reason: "Terminated",
+                wasClean: false,
+              });
+            }
+          },
+        };
+      }
+      function isLikeCloseEvent(val) {
+        return isObject$3(val) && "code" in val && "reason" in val;
+      }
+      function isFatalInternalCloseCode(code3) {
+        if ([1e3, 1001, 1006, 1005, 1012, 1013, 1013].includes(code3))
+          return false;
+        return code3 >= 1e3 && code3 <= 1999;
+      }
+      function isWebSocket(val) {
+        return (
+          typeof val === "function" &&
+          "constructor" in val &&
+          "CLOSED" in val &&
+          "CLOSING" in val &&
+          "CONNECTING" in val &&
+          "OPEN" in val
+        );
+      }
+      const TOKEN_HEADER_KEY = "x-graphql-event-stream-token";
+      function validateStreamEvent(e) {
+        e = e;
+        if (e !== "next" && e !== "complete")
+          throw new Error(`Invalid stream event "${e}"`);
+        return e;
+      }
+      function parseStreamData(e, data) {
+        if (data) {
+          try {
+            data = JSON.parse(data);
+          } catch (_a2) {
+            throw new Error("Invalid stream data");
+          }
+        }
+        if (e === "next" && !data)
+          throw new Error('Stream data must be an object for "next" events');
+        return data || null;
+      }
+      function isObject$2(val) {
+        return typeof val === "object" && val !== null;
+      }
+      var ControlChars;
+      (function (ControlChars2) {
+        ControlChars2[(ControlChars2["NewLine"] = 10)] = "NewLine";
+        ControlChars2[(ControlChars2["CchunkiageReturn"] = 13)] =
+          "CchunkiageReturn";
+        ControlChars2[(ControlChars2["Space"] = 32)] = "Space";
+        ControlChars2[(ControlChars2["Colon"] = 58)] = "Colon";
+      })(ControlChars || (ControlChars = {}));
+      function createParser() {
+        let buffer2;
+        let position;
+        let fieldLength;
+        let discardTrailingNewline = false;
+        let message = { event: "", data: "" };
+        let pending = [];
+        const decoder2 = new TextDecoder();
+        return function parse2(chunk) {
+          if (buffer2 === void 0) {
+            buffer2 = chunk;
+            position = 0;
+            fieldLength = -1;
+          } else {
+            const concat2 = new Uint8Array(buffer2.length + chunk.length);
+            concat2.set(buffer2);
+            concat2.set(chunk, buffer2.length);
+            buffer2 = concat2;
+          }
+          const bufLength = buffer2.length;
+          let lineStart = 0;
+          while (position < bufLength) {
+            if (discardTrailingNewline) {
+              if (buffer2[position] === ControlChars.NewLine) {
+                lineStart = ++position;
+              }
+              discardTrailingNewline = false;
+            }
+            let lineEnd = -1;
+            for (; position < bufLength && lineEnd === -1; ++position) {
+              switch (buffer2[position]) {
+                case ControlChars.Colon:
+                  if (fieldLength === -1) {
+                    fieldLength = position - lineStart;
+                  }
+                  break;
+                case ControlChars.CchunkiageReturn:
+                  discardTrailingNewline = true;
+                case ControlChars.NewLine:
+                  lineEnd = position;
+                  break;
+              }
+            }
+            if (lineEnd === -1) {
+              break;
+            } else if (lineStart === lineEnd) {
+              if (message.event || message.data) {
+                if (!message.event) throw new Error("Missing message event");
+                const event = validateStreamEvent(message.event);
+                const data = parseStreamData(event, message.data);
+                pending.push({
+                  event,
+                  data,
+                });
+                message = { event: "", data: "" };
+              }
+            } else if (fieldLength > 0) {
+              const line = buffer2.subarray(lineStart, lineEnd);
+              const field = decoder2.decode(line.subarray(0, fieldLength));
+              const valueOffset =
+                fieldLength +
+                (line[fieldLength + 1] === ControlChars.Space ? 2 : 1);
+              const value = decoder2.decode(line.subarray(valueOffset));
+              switch (field) {
+                case "event":
+                  message.event = value;
+                  break;
+                case "data":
+                  message.data = message.data
+                    ? message.data + "\n" + value
+                    : value;
+                  break;
+              }
+            }
+            lineStart = position;
+            fieldLength = -1;
+          }
+          if (lineStart === bufLength) {
+            buffer2 = void 0;
+            const messages = [...pending];
+            pending = [];
+            return messages;
+          } else if (lineStart !== 0) {
+            buffer2 = buffer2.subarray(lineStart);
+            position -= lineStart;
+          }
+        };
+      }
+      var __asyncValues =
+        (globalThis && globalThis.__asyncValues) ||
+        function (o) {
+          if (!Symbol.asyncIterator)
+            throw new TypeError("Symbol.asyncIterator is not defined.");
+          var m = o[Symbol.asyncIterator],
+            i;
+          return m
+            ? m.call(o)
+            : ((o =
+                typeof __values === "function"
+                  ? __values(o)
+                  : o[Symbol.iterator]()),
+              (i = {}),
+              verb("next"),
+              verb("throw"),
+              verb("return"),
+              (i[Symbol.asyncIterator] = function () {
+                return this;
+              }),
+              i);
+          function verb(n2) {
+            i[n2] =
+              o[n2] &&
+              function (v2) {
+                return new Promise(function (resolve, reject2) {
+                  (v2 = o[n2](v2)), settle(resolve, reject2, v2.done, v2.value);
+                });
+              };
+          }
+          function settle(resolve, reject2, d, v2) {
+            Promise.resolve(v2).then(function (v3) {
+              resolve({ value: v3, done: d });
+            }, reject2);
+          }
+        };
+      var __await =
+        (globalThis && globalThis.__await) ||
+        function (v2) {
+          return this instanceof __await
+            ? ((this.v = v2), this)
+            : new __await(v2);
+        };
+      var __asyncGenerator =
+        (globalThis && globalThis.__asyncGenerator) ||
+        function (thisArg, _arguments, generator) {
+          if (!Symbol.asyncIterator)
+            throw new TypeError("Symbol.asyncIterator is not defined.");
+          var g = generator.apply(thisArg, _arguments || []),
+            i,
+            q2 = [];
+          return (
+            (i = {}),
+            verb("next"),
+            verb("throw"),
+            verb("return"),
+            (i[Symbol.asyncIterator] = function () {
+              return this;
+            }),
+            i
+          );
+          function verb(n2) {
+            if (g[n2])
+              i[n2] = function (v2) {
+                return new Promise(function (a, b) {
+                  q2.push([n2, v2, a, b]) > 1 || resume(n2, v2);
+                });
+              };
+          }
+          function resume(n2, v2) {
+            try {
+              step(g[n2](v2));
+            } catch (e) {
+              settle(q2[0][3], e);
+            }
+          }
+          function step(r2) {
+            r2.value instanceof __await
+              ? Promise.resolve(r2.value.v).then(fulfill, reject2)
+              : settle(q2[0][2], r2);
+          }
+          function fulfill(value) {
+            resume("next", value);
+          }
+          function reject2(value) {
+            resume("throw", value);
+          }
+          function settle(f, v2) {
+            if ((f(v2), q2.shift(), q2.length)) resume(q2[0][0], q2[0][1]);
+          }
+        };
+      function createClient(options) {
+        const {
+          singleConnection = false,
+          lazy = true,
+          onNonLazyError = console.error,
+          generateID = function generateUUID() {
+            return "xxxxxxxx-xxxx-4xxx-yxxx-xxxxxxxxxxxx".replace(
+              /[xy]/g,
+              (c) => {
+                const r2 = (Math.random() * 16) | 0,
+                  v2 = c == "x" ? r2 : (r2 & 3) | 8;
+                return v2.toString(16);
+              }
+            );
+          },
+          retryAttempts = 5,
+          retry = async function randomisedExponentialBackoff(retries2) {
+            let retryDelay = 1e3;
+            for (let i = 0; i < retries2; i++) {
+              retryDelay *= 2;
+            }
+            await new Promise((resolve) =>
+              setTimeout(
+                resolve,
+                retryDelay + Math.floor(Math.random() * (3e3 - 300) + 300)
+              )
+            );
+          },
+        } = options;
+        const fetchFn = options.fetchFn || fetch;
+        const AbortControllerImpl =
+          options.abortControllerImpl || AbortController;
+        const client2 = (() => {
+          let disposed = false;
+          const listeners2 = [];
+          return {
+            get disposed() {
+              return disposed;
+            },
+            onDispose(cb2) {
+              if (disposed) {
+                setTimeout(() => cb2(), 0);
+                return () => {};
+              }
+              listeners2.push(cb2);
+              return () => {
+                listeners2.splice(listeners2.indexOf(cb2), 1);
+              };
+            },
+            dispose() {
+              if (disposed) return;
+              disposed = true;
+              for (const listener of [...listeners2]) {
+                listener();
+              }
+            },
+          };
+        })();
+        let connCtrl,
+          conn,
+          locks = 0,
+          retryingErr = null,
+          retries = 0;
+        async function getOrConnect() {
+          try {
+            if (client2.disposed) throw new Error("Client has been disposed");
+            return await (conn !== null && conn !== void 0
+              ? conn
+              : (conn = (async () => {
+                  var _a2;
+                  if (retryingErr) {
+                    await retry(retries);
+                    if (connCtrl.signal.aborted)
+                      throw new Error("Connection aborted by the client");
+                    retries++;
+                  }
+                  connCtrl = new AbortControllerImpl();
+                  const unlistenDispose = client2.onDispose(() =>
+                    connCtrl.abort()
+                  );
+                  connCtrl.signal.addEventListener("abort", () => {
+                    unlistenDispose();
+                    conn = void 0;
+                  });
+                  const url =
+                    typeof options.url === "function"
+                      ? await options.url()
+                      : options.url;
+                  if (connCtrl.signal.aborted)
+                    throw new Error("Connection aborted by the client");
+                  const headers =
+                    typeof options.headers === "function"
+                      ? await options.headers()
+                      : (_a2 = options.headers) !== null && _a2 !== void 0
+                      ? _a2
+                      : {};
+                  if (connCtrl.signal.aborted)
+                    throw new Error("Connection aborted by the client");
+                  let res;
+                  try {
+                    res = await fetchFn(url, {
+                      signal: connCtrl.signal,
+                      method: "PUT",
+                      headers,
+                    });
+                  } catch (err) {
+                    throw new NetworkError(err);
+                  }
+                  if (res.status !== 201) throw new NetworkError(res);
+                  const token2 = await res.text();
+                  headers[TOKEN_HEADER_KEY] = token2;
+                  const connected = await connect({
+                    signal: connCtrl.signal,
+                    headers,
+                    url,
+                    fetchFn,
+                  });
+                  retryingErr = null;
+                  retries = 0;
+                  connected.waitForThrow().catch(() => (conn = void 0));
+                  return connected;
+                })()));
+          } catch (err) {
+            conn = void 0;
+            throw err;
+          }
+        }
+        if (singleConnection && !lazy) {
+          (async () => {
+            locks++;
+            for (;;) {
+              try {
+                const { waitForThrow } = await getOrConnect();
+                await waitForThrow();
+              } catch (err) {
+                if (client2.disposed) return;
+                if (!(err instanceof NetworkError))
+                  return onNonLazyError === null || onNonLazyError === void 0
+                    ? void 0
+                    : onNonLazyError(err);
+                if (!retryAttempts || retries >= retryAttempts)
+                  return onNonLazyError === null || onNonLazyError === void 0
+                    ? void 0
+                    : onNonLazyError(err);
+                retryingErr = err;
+              }
+            }
+          })();
+        }
+        return {
+          subscribe(request, sink) {
+            if (!singleConnection) {
+              const control2 = new AbortControllerImpl();
+              const unlisten2 = client2.onDispose(() => {
+                unlisten2();
+                control2.abort();
+              });
+              (async () => {
+                var e_1, _a2;
+                var _b;
+                let retryingErr2 = null,
+                  retries2 = 0;
+                for (;;) {
+                  try {
+                    if (retryingErr2) {
+                      await retry(retries2);
+                      if (control2.signal.aborted)
+                        throw new Error("Connection aborted by the client");
+                      retries2++;
+                    }
+                    const url =
+                      typeof options.url === "function"
+                        ? await options.url()
+                        : options.url;
+                    if (control2.signal.aborted)
+                      throw new Error("Connection aborted by the client");
+                    const headers =
+                      typeof options.headers === "function"
+                        ? await options.headers()
+                        : (_b = options.headers) !== null && _b !== void 0
+                        ? _b
+                        : {};
+                    if (control2.signal.aborted)
+                      throw new Error("Connection aborted by the client");
+                    const { getResults } = await connect({
+                      signal: control2.signal,
+                      headers,
+                      url,
+                      body: JSON.stringify(request),
+                      fetchFn,
+                    });
+                    retryingErr2 = null;
+                    retries2 = 0;
+                    try {
+                      for (
+                        var _c = ((e_1 = void 0), __asyncValues(getResults())),
+                          _d;
+                        (_d = await _c.next()), !_d.done;
+
+                      ) {
+                        const result2 = _d.value;
+                        sink.next(result2);
+                      }
+                    } catch (e_1_1) {
+                      e_1 = { error: e_1_1 };
+                    } finally {
+                      try {
+                        if (_d && !_d.done && (_a2 = _c.return))
+                          await _a2.call(_c);
+                      } finally {
+                        if (e_1) throw e_1.error;
+                      }
+                    }
+                    return control2.abort();
+                  } catch (err) {
+                    if (control2.signal.aborted) return;
+                    if (!(err instanceof NetworkError)) throw err;
+                    if (!retryAttempts || retries2 >= retryAttempts) throw err;
+                    retryingErr2 = err;
+                  }
+                }
+              })()
+                .then(() => sink.complete())
+                .catch((err) => sink.error(err));
+              return () => control2.abort();
+            }
+            locks++;
+            const control = new AbortControllerImpl();
+            const unlisten = client2.onDispose(() => {
+              unlisten();
+              control.abort();
+            });
+            (async () => {
+              var e_2, _a2;
+              const operationId = generateID();
+              request = Object.assign(Object.assign({}, request), {
+                extensions: Object.assign(
+                  Object.assign({}, request.extensions),
+                  { operationId }
+                ),
+              });
+              let complete = null;
+              for (;;) {
+                complete = null;
+                try {
+                  const { url, headers, getResults } = await getOrConnect();
+                  let res;
+                  try {
+                    res = await fetchFn(url, {
+                      signal: control.signal,
+                      method: "POST",
+                      headers,
+                      body: JSON.stringify(request),
+                    });
+                  } catch (err) {
+                    throw new NetworkError(err);
+                  }
+                  if (res.status !== 202) throw new NetworkError(res);
+                  complete = async () => {
+                    let res2;
+                    try {
+                      const control2 = new AbortControllerImpl();
+                      const unlisten2 = client2.onDispose(() => {
+                        unlisten2();
+                        control2.abort();
+                      });
+                      res2 = await fetchFn(
+                        url + "?operationId=" + operationId,
+                        {
+                          signal: control2.signal,
+                          method: "DELETE",
+                          headers,
+                        }
+                      );
+                    } catch (err) {
+                      throw new NetworkError(err);
+                    }
+                    if (res2.status !== 200) throw new NetworkError(res2);
+                  };
+                  try {
+                    for (
+                      var _b =
+                          ((e_2 = void 0),
+                          __asyncValues(
+                            getResults({
+                              signal: control.signal,
+                              operationId,
+                            })
+                          )),
+                        _c;
+                      (_c = await _b.next()), !_c.done;
+
+                    ) {
+                      const result2 = _c.value;
+                      sink.next(result2);
+                    }
+                  } catch (e_2_1) {
+                    e_2 = { error: e_2_1 };
+                  } finally {
+                    try {
+                      if (_c && !_c.done && (_a2 = _b.return))
+                        await _a2.call(_b);
+                    } finally {
+                      if (e_2) throw e_2.error;
+                    }
+                  }
+                  complete = null;
+                  return control.abort();
+                } catch (err) {
+                  if (control.signal.aborted)
+                    return await (complete === null || complete === void 0
+                      ? void 0
+                      : complete());
+                  if (!(err instanceof NetworkError)) throw err;
+                  if (!retryAttempts || retries >= retryAttempts) throw err;
+                  retryingErr = err;
+                } finally {
+                  if (control.signal.aborted && --locks === 0) connCtrl.abort();
+                }
+              }
+            })()
+              .then(() => sink.complete())
+              .catch((err) => sink.error(err));
+            return () => control.abort();
+          },
+          dispose() {
+            client2.dispose();
+          },
+        };
+      }
+      class NetworkError extends Error {
+        constructor(msgOrErrOrResponse) {
+          let message, response;
+          if (isResponseLike(msgOrErrOrResponse)) {
+            response = msgOrErrOrResponse;
+            message =
+              "Server responded with " +
+              msgOrErrOrResponse.status +
+              ": " +
+              msgOrErrOrResponse.statusText;
+          } else if (msgOrErrOrResponse instanceof Error)
+            message = msgOrErrOrResponse.message;
+          else message = String(msgOrErrOrResponse);
+          super(message);
+          this.name = this.constructor.name;
+          this.response = response;
+        }
+      }
+      function isResponseLike(val) {
+        return (
+          isObject$2(val) &&
+          typeof val["ok"] === "boolean" &&
+          typeof val["status"] === "number" &&
+          typeof val["statusText"] === "string"
+        );
+      }
+      async function connect(options) {
+        const { signal, url, headers, body, fetchFn } = options;
+        const waiting = {};
+        const queue = {};
+        let res;
+        try {
+          res = await fetchFn(url, {
+            signal,
+            method: body ? "POST" : "GET",
+            headers: Object.assign(Object.assign({}, headers), {
+              accept: "text/event-stream",
+            }),
+            body,
+          });
+        } catch (err) {
+          throw new NetworkError(err);
+        }
+        if (!res.ok) throw new NetworkError(res);
+        if (!res.body) throw new Error("Missing response body");
+        let error2 = null;
+        let waitingForThrow = null;
+        (async () => {
+          var e_3, _a2;
+          var _b;
+          try {
+            const parse2 = createParser();
+            try {
+              for (
+                var _c = __asyncValues(toAsyncIterator(res.body)), _d;
+                (_d = await _c.next()), !_d.done;
+
+              ) {
+                const chunk = _d.value;
+                if (typeof chunk === "string")
+                  throw new Error(`Unexpected string chunk "${chunk}"`);
+                const msgs = parse2(chunk);
+                if (!msgs) continue;
+                for (const msg of msgs) {
+                  const operationId =
+                    msg.data && "id" in msg.data ? msg.data.id : "";
+                  if (!(operationId in queue)) queue[operationId] = [];
+                  switch (msg.event) {
+                    case "next":
+                      if (operationId)
+                        queue[operationId].push(msg.data.payload);
+                      else queue[operationId].push(msg.data);
+                      break;
+                    case "complete":
+                      queue[operationId].push("complete");
+                      break;
+                    default:
+                      throw new Error(
+                        `Unexpected message event "${msg.event}"`
+                      );
+                  }
+                  (_b = waiting[operationId]) === null || _b === void 0
+                    ? void 0
+                    : _b.proceed();
+                }
+              }
+            } catch (e_3_1) {
+              e_3 = { error: e_3_1 };
+            } finally {
+              try {
+                if (_d && !_d.done && (_a2 = _c.return)) await _a2.call(_c);
+              } finally {
+                if (e_3) throw e_3.error;
+              }
+            }
+          } catch (err) {
+            error2 = err;
+            if (waitingForThrow) waitingForThrow(err);
+          } finally {
+            Object.values(waiting).forEach(({ proceed }) => proceed());
+          }
+        })();
+        return {
+          url,
+          headers,
+          waitForThrow: () =>
+            new Promise((_, reject2) => {
+              if (error2) return reject2(error2);
+              waitingForThrow = reject2;
+            }),
+          getResults(options2) {
+            var _a2;
+            return __asyncGenerator(this, arguments, function* getResults_1() {
+              const { signal: signal2, operationId = "" } =
+                options2 !== null && options2 !== void 0 ? options2 : {};
+              try {
+                for (;;) {
+                  while (
+                    (_a2 = queue[operationId]) === null || _a2 === void 0
+                      ? void 0
+                      : _a2.length
+                  ) {
+                    const result2 = queue[operationId].shift();
+                    if (result2 === "complete") return yield __await(void 0);
+                    yield yield __await(result2);
+                  }
+                  if (error2) throw error2;
+                  if (
+                    signal2 === null || signal2 === void 0
+                      ? void 0
+                      : signal2.aborted
+                  )
+                    throw new Error("Getting results aborted by the client");
+                  yield __await(
+                    new Promise((resolve) => {
+                      const proceed = () => {
+                        signal2 === null || signal2 === void 0
+                          ? void 0
+                          : signal2.removeEventListener("abort", proceed);
+                        delete waiting[operationId];
+                        resolve();
+                      };
+                      signal2 === null || signal2 === void 0
+                        ? void 0
+                        : signal2.addEventListener("abort", proceed);
+                      waiting[operationId] = { proceed };
+                    })
+                  );
+                }
+              } finally {
+                delete queue[operationId];
+              }
+            });
+          },
+        };
+      }
+      function toAsyncIterator(val) {
+        if (typeof Object(val)[Symbol.asyncIterator] === "function") {
+          val = val;
+          return val[Symbol.asyncIterator]();
+        }
+        return (function () {
+          return __asyncGenerator(this, arguments, function* () {
+            val = val;
+            const reader = val.getReader();
+            for (;;) {
+              const { value, done } = yield __await(reader.read());
+              if (done) return yield __await(value);
+              yield yield __await(value);
+            }
+          });
+        })();
+      }
+      var ws = null;
+      if (typeof WebSocket !== "undefined") {
+        ws = WebSocket;
+      } else if (typeof MozWebSocket !== "undefined") {
+        ws = MozWebSocket;
+      } else if (typeof commonjsGlobal !== "undefined") {
+        ws = commonjsGlobal.WebSocket || commonjsGlobal.MozWebSocket;
+      } else if (typeof window !== "undefined") {
+        ws = window.WebSocket || window.MozWebSocket;
+      } else if (typeof self !== "undefined") {
+        ws = self.WebSocket || self.MozWebSocket;
+      }
+      var browser$1 = ws;
+      var ReactNativeFile_1 = class ReactNativeFile {
+        constructor({ uri, name: name2, type: type2 }) {
+          this.uri = uri;
+          this.name = name2;
+          this.type = type2;
+        }
+      };
+      const ReactNativeFile2 = ReactNativeFile_1;
+      var isExtractableFile = function isExtractableFile2(value) {
+        return (
+          (typeof File !== "undefined" && value instanceof File) ||
+          (typeof Blob !== "undefined" && value instanceof Blob) ||
+          value instanceof ReactNativeFile2
+        );
+      };
+      var isExtractableFile$1 = isExtractableFile;
+      const defaultIsExtractableFile = isExtractableFile;
+      var extractFiles = function extractFiles2(
+        value,
+        path = "",
+        isExtractableFile3 = defaultIsExtractableFile
+      ) {
+        const files = /* @__PURE__ */ new Map();
+        const clones = /* @__PURE__ */ new Map();
+        function recurse(value2, path2, recursed) {
+          let clone = value2;
+          if (isExtractableFile3(value2)) {
+            clone = null;
+            const filePaths = files.get(value2);
+            filePaths ? filePaths.push(path2) : files.set(value2, [path2]);
+          } else {
+            const isList2 =
+              Array.isArray(value2) ||
+              (typeof FileList !== "undefined" && value2 instanceof FileList);
+            const isObject3 = value2 && value2.constructor === Object;
+            if (isList2 || isObject3) {
+              const hasClone = clones.has(value2);
+              if (hasClone) clone = clones.get(value2);
+              else {
+                clone = isList2 ? [] : {};
+                clones.set(value2, clone);
+              }
+              if (!recursed.has(value2)) {
+                const pathPrefix = path2 ? `${path2}.` : "";
+                const recursedDeeper = new Set(recursed).add(value2);
+                if (isList2) {
+                  let index = 0;
+                  for (const item of value2) {
+                    const itemClone = recurse(
+                      item,
+                      pathPrefix + index++,
+                      recursedDeeper
+                    );
+                    if (!hasClone) clone.push(itemClone);
+                  }
+                } else
+                  for (const key in value2) {
+                    const propertyClone = recurse(
+                      value2[key],
+                      pathPrefix + key,
+                      recursedDeeper
+                    );
+                    if (!hasClone) clone[key] = propertyClone;
+                  }
+              }
+            }
+          }
+          return clone;
+        }
+        return {
+          clone: recurse(value, path, /* @__PURE__ */ new Set()),
+          files,
+        };
+      };
+      var extractFiles$1 = extractFiles;
+      var client = {};
+      var backo2 = Backoff$1;
+      function Backoff$1(opts) {
+        opts = opts || {};
+        this.ms = opts.min || 100;
+        this.max = opts.max || 1e4;
+        this.factor = opts.factor || 2;
+        this.jitter = opts.jitter > 0 && opts.jitter <= 1 ? opts.jitter : 0;
+        this.attempts = 0;
+      }
+      Backoff$1.prototype.duration = function () {
+        var ms = this.ms * Math.pow(this.factor, this.attempts++);
+        if (this.jitter) {
+          var rand = Math.random();
+          var deviation = Math.floor(rand * this.jitter * ms);
+          ms =
+            (Math.floor(rand * 10) & 1) == 0 ? ms - deviation : ms + deviation;
+        }
+        return Math.min(ms, this.max) | 0;
+      };
+      Backoff$1.prototype.reset = function () {
+        this.attempts = 0;
+      };
+      Backoff$1.prototype.setMin = function (min) {
+        this.ms = min;
+      };
+      Backoff$1.prototype.setMax = function (max) {
+        this.max = max;
+      };
+      Backoff$1.prototype.setJitter = function (jitter) {
+        this.jitter = jitter;
+      };
+      var eventemitter3 = { exports: {} };
+      (function (module2) {
+        var has2 = Object.prototype.hasOwnProperty,
+          prefix = "~";
+        function Events() {}
+        if (Object.create) {
+          Events.prototype = /* @__PURE__ */ Object.create(null);
+          if (!new Events().__proto__) prefix = false;
+        }
+        function EE(fn, context, once) {
+          this.fn = fn;
+          this.context = context;
+          this.once = once || false;
+        }
+        function addListener(emitter, event, fn, context, once) {
+          if (typeof fn !== "function") {
+            throw new TypeError("The listener must be a function");
+          }
+          var listener = new EE(fn, context || emitter, once),
+            evt = prefix ? prefix + event : event;
+          if (!emitter._events[evt])
+            (emitter._events[evt] = listener), emitter._eventsCount++;
+          else if (!emitter._events[evt].fn)
+            emitter._events[evt].push(listener);
+          else emitter._events[evt] = [emitter._events[evt], listener];
+          return emitter;
+        }
+        function clearEvent(emitter, evt) {
+          if (--emitter._eventsCount === 0) emitter._events = new Events();
+          else delete emitter._events[evt];
+        }
+        function EventEmitter() {
+          this._events = new Events();
+          this._eventsCount = 0;
+        }
+        EventEmitter.prototype.eventNames = function eventNames() {
+          var names = [],
+            events,
+            name2;
+          if (this._eventsCount === 0) return names;
+          for (name2 in (events = this._events)) {
+            if (has2.call(events, name2))
+              names.push(prefix ? name2.slice(1) : name2);
+          }
+          if (Object.getOwnPropertySymbols) {
+            return names.concat(Object.getOwnPropertySymbols(events));
+          }
+          return names;
+        };
+        EventEmitter.prototype.listeners = function listeners2(event) {
+          var evt = prefix ? prefix + event : event,
+            handlers = this._events[evt];
+          if (!handlers) return [];
+          if (handlers.fn) return [handlers.fn];
+          for (
+            var i = 0, l2 = handlers.length, ee2 = new Array(l2);
+            i < l2;
+            i++
+          ) {
+            ee2[i] = handlers[i].fn;
+          }
+          return ee2;
+        };
+        EventEmitter.prototype.listenerCount = function listenerCount(event) {
+          var evt = prefix ? prefix + event : event,
+            listeners2 = this._events[evt];
+          if (!listeners2) return 0;
+          if (listeners2.fn) return 1;
+          return listeners2.length;
+        };
+        EventEmitter.prototype.emit = function emit(event, a1, a2, a3, a4, a5) {
+          var evt = prefix ? prefix + event : event;
+          if (!this._events[evt]) return false;
+          var listeners2 = this._events[evt],
+            len = arguments.length,
+            args,
+            i;
+          if (listeners2.fn) {
+            if (listeners2.once)
+              this.removeListener(event, listeners2.fn, void 0, true);
+            switch (len) {
+              case 1:
+                return listeners2.fn.call(listeners2.context), true;
+              case 2:
+                return listeners2.fn.call(listeners2.context, a1), true;
+              case 3:
+                return listeners2.fn.call(listeners2.context, a1, a2), true;
+              case 4:
+                return listeners2.fn.call(listeners2.context, a1, a2, a3), true;
+              case 5:
+                return (
+                  listeners2.fn.call(listeners2.context, a1, a2, a3, a4), true
+                );
+              case 6:
+                return (
+                  listeners2.fn.call(listeners2.context, a1, a2, a3, a4, a5),
+                  true
+                );
+            }
+            for (i = 1, args = new Array(len - 1); i < len; i++) {
+              args[i - 1] = arguments[i];
+            }
+            listeners2.fn.apply(listeners2.context, args);
+          } else {
+            var length = listeners2.length,
+              j;
+            for (i = 0; i < length; i++) {
+              if (listeners2[i].once)
+                this.removeListener(event, listeners2[i].fn, void 0, true);
+              switch (len) {
+                case 1:
+                  listeners2[i].fn.call(listeners2[i].context);
+                  break;
+                case 2:
+                  listeners2[i].fn.call(listeners2[i].context, a1);
+                  break;
+                case 3:
+                  listeners2[i].fn.call(listeners2[i].context, a1, a2);
+                  break;
+                case 4:
+                  listeners2[i].fn.call(listeners2[i].context, a1, a2, a3);
+                  break;
+                default:
+                  if (!args)
+                    for (j = 1, args = new Array(len - 1); j < len; j++) {
+                      args[j - 1] = arguments[j];
+                    }
+                  listeners2[i].fn.apply(listeners2[i].context, args);
+              }
+            }
+          }
+          return true;
+        };
+        EventEmitter.prototype.on = function on(event, fn, context) {
+          return addListener(this, event, fn, context, false);
+        };
+        EventEmitter.prototype.once = function once(event, fn, context) {
+          return addListener(this, event, fn, context, true);
+        };
+        EventEmitter.prototype.removeListener = function removeListener(
+          event,
+          fn,
+          context,
+          once
+        ) {
+          var evt = prefix ? prefix + event : event;
+          if (!this._events[evt]) return this;
+          if (!fn) {
+            clearEvent(this, evt);
+            return this;
+          }
+          var listeners2 = this._events[evt];
+          if (listeners2.fn) {
+            if (
+              listeners2.fn === fn &&
+              (!once || listeners2.once) &&
+              (!context || listeners2.context === context)
+            ) {
+              clearEvent(this, evt);
+            }
+          } else {
+            for (
+              var i = 0, events = [], length = listeners2.length;
+              i < length;
+              i++
+            ) {
+              if (
+                listeners2[i].fn !== fn ||
+                (once && !listeners2[i].once) ||
+                (context && listeners2[i].context !== context)
+              ) {
+                events.push(listeners2[i]);
+              }
+            }
+            if (events.length)
+              this._events[evt] = events.length === 1 ? events[0] : events;
+            else clearEvent(this, evt);
+          }
+          return this;
+        };
+        EventEmitter.prototype.removeAllListeners = function removeAllListeners(
+          event
+        ) {
+          var evt;
+          if (event) {
+            evt = prefix ? prefix + event : event;
+            if (this._events[evt]) clearEvent(this, evt);
+          } else {
+            this._events = new Events();
+            this._eventsCount = 0;
+          }
+          return this;
+        };
+        EventEmitter.prototype.off = EventEmitter.prototype.removeListener;
+        EventEmitter.prototype.addListener = EventEmitter.prototype.on;
+        EventEmitter.prefixed = prefix;
+        EventEmitter.EventEmitter = EventEmitter;
+        {
+          module2.exports = EventEmitter;
+        }
+      })(eventemitter3);
+      var isString$1 = {};
+      Object.defineProperty(isString$1, "__esModule", { value: true });
+      function isString(value) {
+        return typeof value === "string";
+      }
+      isString$1.default = isString;
+      var isObject$1 = {};
+      Object.defineProperty(isObject$1, "__esModule", { value: true });
+      function isObject2(value) {
+        return value !== null && typeof value === "object";
+      }
+      isObject$1.default = isObject2;
+      var require$$4 = /* @__PURE__ */ getAugmentedNamespace(printer);
+      var require$$5 = /* @__PURE__ */ getAugmentedNamespace(getOperationAST$1);
+      function symbolObservablePonyfill(root2) {
+        var result2;
+        var Symbol2 = root2.Symbol;
+        if (typeof Symbol2 === "function") {
+          if (Symbol2.observable) {
+            result2 = Symbol2.observable;
+          } else {
+            result2 = Symbol2("observable");
+            Symbol2.observable = result2;
+          }
+        } else {
+          result2 = "@@observable";
+        }
+        return result2;
+      }
+      var root;
+      if (typeof self !== "undefined") {
+        root = self;
+      } else if (typeof window !== "undefined") {
+        root = window;
+      } else if (typeof global !== "undefined") {
+        root = global;
+      } else if (typeof module !== "undefined") {
+        root = module;
+      } else {
+        root = Function("return this")();
+      }
+      var result = symbolObservablePonyfill(root);
+      var es = /* @__PURE__ */ Object.freeze({
+        __proto__: null,
+        [Symbol.toStringTag]: "Module",
+        default: result,
+      });
+      var require$$6 = /* @__PURE__ */ getAugmentedNamespace(es);
+      var protocol = {};
+      Object.defineProperty(protocol, "__esModule", { value: true });
+      protocol.GRAPHQL_SUBSCRIPTIONS = protocol.GRAPHQL_WS = void 0;
+      var GRAPHQL_WS = "graphql-ws";
+      protocol.GRAPHQL_WS = GRAPHQL_WS;
+      var GRAPHQL_SUBSCRIPTIONS = "graphql-subscriptions";
+      protocol.GRAPHQL_SUBSCRIPTIONS = GRAPHQL_SUBSCRIPTIONS;
+      var defaults = {};
+      Object.defineProperty(defaults, "__esModule", { value: true });
+      defaults.WS_TIMEOUT = defaults.MIN_WS_TIMEOUT = void 0;
+      var MIN_WS_TIMEOUT = 1e3;
+      defaults.MIN_WS_TIMEOUT = MIN_WS_TIMEOUT;
+      var WS_TIMEOUT = 3e4;
+      defaults.WS_TIMEOUT = WS_TIMEOUT;
+      var messageTypes = {};
+      Object.defineProperty(messageTypes, "__esModule", { value: true });
+      var MessageTypes = (function () {
+        function MessageTypes2() {
+          throw new Error("Static Class");
+        }
+        MessageTypes2.GQL_CONNECTION_INIT = "connection_init";
+        MessageTypes2.GQL_CONNECTION_ACK = "connection_ack";
+        MessageTypes2.GQL_CONNECTION_ERROR = "connection_error";
+        MessageTypes2.GQL_CONNECTION_KEEP_ALIVE = "ka";
+        MessageTypes2.GQL_CONNECTION_TERMINATE = "connection_terminate";
+        MessageTypes2.GQL_START = "start";
+        MessageTypes2.GQL_DATA = "data";
+        MessageTypes2.GQL_ERROR = "error";
+        MessageTypes2.GQL_COMPLETE = "complete";
+        MessageTypes2.GQL_STOP = "stop";
+        MessageTypes2.SUBSCRIPTION_START = "subscription_start";
+        MessageTypes2.SUBSCRIPTION_DATA = "subscription_data";
+        MessageTypes2.SUBSCRIPTION_SUCCESS = "subscription_success";
+        MessageTypes2.SUBSCRIPTION_FAIL = "subscription_fail";
+        MessageTypes2.SUBSCRIPTION_END = "subscription_end";
+        MessageTypes2.INIT = "init";
+        MessageTypes2.INIT_SUCCESS = "init_success";
+        MessageTypes2.INIT_FAIL = "init_fail";
+        MessageTypes2.KEEP_ALIVE = "keepalive";
+        return MessageTypes2;
+      })();
+      messageTypes.default = MessageTypes;
+      var __assign =
+        (commonjsGlobal && commonjsGlobal.__assign) ||
+        function () {
+          __assign =
+            Object.assign ||
+            function (t2) {
+              for (var s, i = 1, n2 = arguments.length; i < n2; i++) {
+                s = arguments[i];
+                for (var p2 in s)
+                  if (Object.prototype.hasOwnProperty.call(s, p2))
+                    t2[p2] = s[p2];
+              }
+              return t2;
+            };
+          return __assign.apply(this, arguments);
+        };
+      var __awaiter =
+        (commonjsGlobal && commonjsGlobal.__awaiter) ||
+        function (thisArg, _arguments, P2, generator) {
+          function adopt(value) {
+            return value instanceof P2
+              ? value
+              : new P2(function (resolve) {
+                  resolve(value);
+                });
+          }
+          return new (P2 || (P2 = Promise))(function (resolve, reject2) {
+            function fulfilled(value) {
+              try {
+                step(generator.next(value));
+              } catch (e) {
+                reject2(e);
+              }
+            }
+            function rejected(value) {
+              try {
+                step(generator["throw"](value));
+              } catch (e) {
+                reject2(e);
+              }
+            }
+            function step(result2) {
+              result2.done
+                ? resolve(result2.value)
+                : adopt(result2.value).then(fulfilled, rejected);
+            }
+            step(
+              (generator = generator.apply(thisArg, _arguments || [])).next()
+            );
+          });
+        };
+      var __generator =
+        (commonjsGlobal && commonjsGlobal.__generator) ||
+        function (thisArg, body) {
+          var _ = {
+              label: 0,
+              sent: function () {
+                if (t2[0] & 1) throw t2[1];
+                return t2[1];
+              },
+              trys: [],
+              ops: [],
+            },
+            f,
+            y2,
+            t2,
+            g;
+          return (
+            (g = { next: verb(0), throw: verb(1), return: verb(2) }),
+            typeof Symbol === "function" &&
+              (g[Symbol.iterator] = function () {
+                return this;
+              }),
+            g
+          );
+          function verb(n2) {
+            return function (v2) {
+              return step([n2, v2]);
+            };
+          }
+          function step(op) {
+            if (f) throw new TypeError("Generator is already executing.");
+            while (_)
+              try {
+                if (
+                  ((f = 1),
+                  y2 &&
+                    (t2 =
+                      op[0] & 2
+                        ? y2["return"]
+                        : op[0]
+                        ? y2["throw"] || ((t2 = y2["return"]) && t2.call(y2), 0)
+                        : y2.next) &&
+                    !(t2 = t2.call(y2, op[1])).done)
+                )
+                  return t2;
+                if (((y2 = 0), t2)) op = [op[0] & 2, t2.value];
+                switch (op[0]) {
+                  case 0:
+                  case 1:
+                    t2 = op;
+                    break;
+                  case 4:
+                    _.label++;
+                    return { value: op[1], done: false };
+                  case 5:
+                    _.label++;
+                    y2 = op[1];
+                    op = [0];
+                    continue;
+                  case 7:
+                    op = _.ops.pop();
+                    _.trys.pop();
+                    continue;
+                  default:
+                    if (
+                      !((t2 = _.trys),
+                      (t2 = t2.length > 0 && t2[t2.length - 1])) &&
+                      (op[0] === 6 || op[0] === 2)
+                    ) {
+                      _ = 0;
+                      continue;
+                    }
+                    if (
+                      op[0] === 3 &&
+                      (!t2 || (op[1] > t2[0] && op[1] < t2[3]))
+                    ) {
+                      _.label = op[1];
+                      break;
+                    }
+                    if (op[0] === 6 && _.label < t2[1]) {
+                      _.label = t2[1];
+                      t2 = op;
+                      break;
+                    }
+                    if (t2 && _.label < t2[2]) {
+                      _.label = t2[2];
+                      _.ops.push(op);
+                      break;
+                    }
+                    if (t2[2]) _.ops.pop();
+                    _.trys.pop();
+                    continue;
+                }
+                op = body.call(thisArg, _);
+              } catch (e) {
+                op = [6, e];
+                y2 = 0;
+              } finally {
+                f = t2 = 0;
+              }
+            if (op[0] & 5) throw op[1];
+            return { value: op[0] ? op[1] : void 0, done: true };
+          }
+        };
+      var __spreadArray =
+        (commonjsGlobal && commonjsGlobal.__spreadArray) ||
+        function (to, from, pack) {
+          if (pack || arguments.length === 2)
+            for (var i = 0, l2 = from.length, ar; i < l2; i++) {
+              if (ar || !(i in from)) {
+                if (!ar) ar = Array.prototype.slice.call(from, 0, i);
+                ar[i] = from[i];
+              }
+            }
+          return to.concat(ar || Array.prototype.slice.call(from));
+        };
+      Object.defineProperty(client, "__esModule", { value: true });
+      var SubscriptionClient_1 = (client.SubscriptionClient = void 0);
+      var _global =
+        typeof commonjsGlobal !== "undefined"
+          ? commonjsGlobal
+          : typeof window !== "undefined"
+          ? window
+          : {};
+      var NativeWebSocket = _global.WebSocket || _global.MozWebSocket;
+      var Backoff = backo2;
+      var eventemitter3_1 = eventemitter3.exports;
+      var is_string_1 = isString$1;
+      var is_object_1 = isObject$1;
+      var printer_1 = require$$4;
+      var getOperationAST_1 = require$$5;
+      var symbol_observable_1 = require$$6;
+      var protocol_1 = protocol;
+      var defaults_1 = defaults;
+      var message_types_1 = messageTypes;
+      var SubscriptionClient = (function () {
+        function SubscriptionClient2(
+          url,
+          options,
+          webSocketImpl,
+          webSocketProtocols
+        ) {
+          var _a2 = options || {},
+            _b = _a2.connectionCallback,
+            connectionCallback = _b === void 0 ? void 0 : _b,
+            _c = _a2.connectionParams,
+            connectionParams = _c === void 0 ? {} : _c,
+            _d = _a2.minTimeout,
+            minTimeout = _d === void 0 ? defaults_1.MIN_WS_TIMEOUT : _d,
+            _e = _a2.timeout,
+            timeout = _e === void 0 ? defaults_1.WS_TIMEOUT : _e,
+            _f = _a2.reconnect,
+            reconnect = _f === void 0 ? false : _f,
+            _g = _a2.reconnectionAttempts,
+            reconnectionAttempts = _g === void 0 ? Infinity : _g,
+            _h = _a2.lazy,
+            lazy = _h === void 0 ? false : _h,
+            _j = _a2.inactivityTimeout,
+            inactivityTimeout = _j === void 0 ? 0 : _j,
+            _k = _a2.wsOptionArguments,
+            wsOptionArguments = _k === void 0 ? [] : _k;
+          this.wsImpl = webSocketImpl || NativeWebSocket;
+          if (!this.wsImpl) {
+            throw new Error(
+              "Unable to find native implementation, or alternative implementation for WebSocket!"
+            );
+          }
+          this.wsProtocols = webSocketProtocols || protocol_1.GRAPHQL_WS;
+          this.connectionCallback = connectionCallback;
+          this.url = url;
+          this.operations = {};
+          this.nextOperationId = 0;
+          this.minWsTimeout = minTimeout;
+          this.wsTimeout = timeout;
+          this.unsentMessagesQueue = [];
+          this.reconnect = reconnect;
+          this.reconnecting = false;
+          this.reconnectionAttempts = reconnectionAttempts;
+          this.lazy = !!lazy;
+          this.inactivityTimeout = inactivityTimeout;
+          this.closedByUser = false;
+          this.backoff = new Backoff({ jitter: 0.5 });
+          this.eventEmitter = new eventemitter3_1.EventEmitter();
+          this.middlewares = [];
+          this.client = null;
+          this.maxConnectTimeGenerator = this.createMaxConnectTimeGenerator();
+          this.connectionParams = this.getConnectionParams(connectionParams);
+          this.wsOptionArguments = wsOptionArguments;
+          if (!this.lazy) {
+            this.connect();
+          }
+        }
+        Object.defineProperty(SubscriptionClient2.prototype, "status", {
+          get: function () {
+            if (this.client === null) {
+              return this.wsImpl.CLOSED;
+            }
+            return this.client.readyState;
+          },
+          enumerable: false,
+          configurable: true,
+        });
+        SubscriptionClient2.prototype.close = function (
+          isForced,
+          closedByUser
+        ) {
+          if (isForced === void 0) {
+            isForced = true;
+          }
+          if (closedByUser === void 0) {
+            closedByUser = true;
+          }
+          this.clearInactivityTimeout();
+          if (this.client !== null) {
+            this.closedByUser = closedByUser;
+            if (isForced) {
+              this.clearCheckConnectionInterval();
+              this.clearMaxConnectTimeout();
+              this.clearTryReconnectTimeout();
+              this.unsubscribeAll();
+              this.sendMessage(
+                void 0,
+                message_types_1.default.GQL_CONNECTION_TERMINATE,
+                null
+              );
+            }
+            this.client.close();
+            this.client.onopen = null;
+            this.client.onclose = null;
+            this.client.onerror = null;
+            this.client.onmessage = null;
+            this.client = null;
+            this.eventEmitter.emit("disconnected");
+            if (!isForced) {
+              this.tryReconnect();
+            }
+          }
+        };
+        SubscriptionClient2.prototype.request = function (request) {
+          var _a2;
+          var getObserver = this.getObserver.bind(this);
+          var executeOperation2 = this.executeOperation.bind(this);
+          var unsubscribe = this.unsubscribe.bind(this);
+          var opId;
+          this.clearInactivityTimeout();
+          return (
+            (_a2 = {}),
+            (_a2[symbol_observable_1.default] = function () {
+              return this;
+            }),
+            (_a2.subscribe = function (observerOrNext, onError, onComplete) {
+              var observer = getObserver(observerOrNext, onError, onComplete);
+              opId = executeOperation2(request, function (error2, result2) {
+                if (error2 === null && result2 === null) {
+                  if (observer.complete) {
+                    observer.complete();
+                  }
+                } else if (error2) {
+                  if (observer.error) {
+                    observer.error(error2[0]);
+                  }
+                } else {
+                  if (observer.next) {
+                    observer.next(result2);
+                  }
+                }
+              });
+              return {
+                unsubscribe: function () {
+                  if (opId) {
+                    unsubscribe(opId);
+                    opId = null;
+                  }
+                },
+              };
+            }),
+            _a2
+          );
+        };
+        SubscriptionClient2.prototype.on = function (
+          eventName,
+          callback,
+          context
+        ) {
+          var handler = this.eventEmitter.on(eventName, callback, context);
+          return function () {
+            handler.off(eventName, callback, context);
+          };
+        };
+        SubscriptionClient2.prototype.onConnected = function (
+          callback,
+          context
+        ) {
+          return this.on("connected", callback, context);
+        };
+        SubscriptionClient2.prototype.onConnecting = function (
+          callback,
+          context
+        ) {
+          return this.on("connecting", callback, context);
+        };
+        SubscriptionClient2.prototype.onDisconnected = function (
+          callback,
+          context
+        ) {
+          return this.on("disconnected", callback, context);
+        };
+        SubscriptionClient2.prototype.onReconnected = function (
+          callback,
+          context
+        ) {
+          return this.on("reconnected", callback, context);
+        };
+        SubscriptionClient2.prototype.onReconnecting = function (
+          callback,
+          context
+        ) {
+          return this.on("reconnecting", callback, context);
+        };
+        SubscriptionClient2.prototype.onError = function (callback, context) {
+          return this.on("error", callback, context);
+        };
+        SubscriptionClient2.prototype.unsubscribeAll = function () {
+          var _this = this;
+          Object.keys(this.operations).forEach(function (subId) {
+            _this.unsubscribe(subId);
+          });
+        };
+        SubscriptionClient2.prototype.applyMiddlewares = function (options) {
+          var _this = this;
+          return new Promise(function (resolve, reject2) {
+            var queue = function (funcs, scope) {
+              var next = function (error2) {
+                if (error2) {
+                  reject2(error2);
+                } else {
+                  if (funcs.length > 0) {
+                    var f = funcs.shift();
+                    if (f) {
+                      f.applyMiddleware.apply(scope, [options, next]);
+                    }
+                  } else {
+                    resolve(options);
+                  }
+                }
+              };
+              next();
+            };
+            queue(__spreadArray([], _this.middlewares, true), _this);
+          });
+        };
+        SubscriptionClient2.prototype.use = function (middlewares) {
+          var _this = this;
+          middlewares.map(function (middleware) {
+            if (typeof middleware.applyMiddleware === "function") {
+              _this.middlewares.push(middleware);
+            } else {
+              throw new Error(
+                "Middleware must implement the applyMiddleware function."
+              );
+            }
+          });
+          return this;
+        };
+        SubscriptionClient2.prototype.getConnectionParams = function (
+          connectionParams
+        ) {
+          return function () {
+            return new Promise(function (resolve, reject2) {
+              if (typeof connectionParams === "function") {
+                try {
+                  return resolve(connectionParams.call(null));
+                } catch (error2) {
+                  return reject2(error2);
+                }
+              }
+              resolve(connectionParams);
+            });
+          };
+        };
+        SubscriptionClient2.prototype.executeOperation = function (
+          options,
+          handler
+        ) {
+          var _this = this;
+          if (this.client === null) {
+            this.connect();
+          }
+          var opId = this.generateOperationId();
+          this.operations[opId] = { options, handler };
+          this.applyMiddlewares(options)
+            .then(function (processedOptions) {
+              _this.checkOperationOptions(processedOptions, handler);
+              if (_this.operations[opId]) {
+                _this.operations[opId] = { options: processedOptions, handler };
+                _this.sendMessage(
+                  opId,
+                  message_types_1.default.GQL_START,
+                  processedOptions
+                );
+              }
+            })
+            .catch(function (error2) {
+              _this.unsubscribe(opId);
+              handler(_this.formatErrors(error2));
+            });
+          return opId;
+        };
+        SubscriptionClient2.prototype.getObserver = function (
+          observerOrNext,
+          error2,
+          complete
+        ) {
+          if (typeof observerOrNext === "function") {
+            return {
+              next: function (v2) {
+                return observerOrNext(v2);
+              },
+              error: function (e) {
+                return error2 && error2(e);
+              },
+              complete: function () {
+                return complete && complete();
+              },
+            };
+          }
+          return observerOrNext;
+        };
+        SubscriptionClient2.prototype.createMaxConnectTimeGenerator =
+          function () {
+            var minValue = this.minWsTimeout;
+            var maxValue = this.wsTimeout;
+            return new Backoff({
+              min: minValue,
+              max: maxValue,
+              factor: 1.2,
+            });
+          };
+        SubscriptionClient2.prototype.clearCheckConnectionInterval =
+          function () {
+            if (this.checkConnectionIntervalId) {
+              clearInterval(this.checkConnectionIntervalId);
+              this.checkConnectionIntervalId = null;
+            }
+          };
+        SubscriptionClient2.prototype.clearMaxConnectTimeout = function () {
+          if (this.maxConnectTimeoutId) {
+            clearTimeout(this.maxConnectTimeoutId);
+            this.maxConnectTimeoutId = null;
+          }
+        };
+        SubscriptionClient2.prototype.clearTryReconnectTimeout = function () {
+          if (this.tryReconnectTimeoutId) {
+            clearTimeout(this.tryReconnectTimeoutId);
+            this.tryReconnectTimeoutId = null;
+          }
+        };
+        SubscriptionClient2.prototype.clearInactivityTimeout = function () {
+          if (this.inactivityTimeoutId) {
+            clearTimeout(this.inactivityTimeoutId);
+            this.inactivityTimeoutId = null;
+          }
+        };
+        SubscriptionClient2.prototype.setInactivityTimeout = function () {
+          var _this = this;
+          if (
+            this.inactivityTimeout > 0 &&
+            Object.keys(this.operations).length === 0
+          ) {
+            this.inactivityTimeoutId = setTimeout(function () {
+              if (Object.keys(_this.operations).length === 0) {
+                _this.close();
+              }
+            }, this.inactivityTimeout);
+          }
+        };
+        SubscriptionClient2.prototype.checkOperationOptions = function (
+          options,
+          handler
+        ) {
+          var query = options.query,
+            variables = options.variables,
+            operationName = options.operationName;
+          if (!query) {
+            throw new Error("Must provide a query.");
+          }
+          if (!handler) {
+            throw new Error("Must provide an handler.");
+          }
+          if (
+            (!(0, is_string_1.default)(query) &&
+              !(0, getOperationAST_1.getOperationAST)(query, operationName)) ||
+            (operationName && !(0, is_string_1.default)(operationName)) ||
+            (variables && !(0, is_object_1.default)(variables))
+          ) {
+            throw new Error(
+              "Incorrect option types. query must be a string or a document,`operationName` must be a string, and `variables` must be an object."
+            );
+          }
+        };
+        SubscriptionClient2.prototype.buildMessage = function (
+          id2,
+          type2,
+          payload
+        ) {
+          var payloadToReturn =
+            payload && payload.query
+              ? __assign(__assign({}, payload), {
+                  query:
+                    typeof payload.query === "string"
+                      ? payload.query
+                      : (0, printer_1.print)(payload.query),
+                })
+              : payload;
+          return {
+            id: id2,
+            type: type2,
+            payload: payloadToReturn,
+          };
+        };
+        SubscriptionClient2.prototype.formatErrors = function (errors2) {
+          if (Array.isArray(errors2)) {
+            return errors2;
+          }
+          if (errors2 && errors2.errors) {
+            return this.formatErrors(errors2.errors);
+          }
+          if (errors2 && errors2.message) {
+            return [errors2];
+          }
+          return [
+            {
+              name: "FormatedError",
+              message: "Unknown error",
+              originalError: errors2,
+            },
+          ];
+        };
+        SubscriptionClient2.prototype.sendMessage = function (
+          id2,
+          type2,
+          payload
+        ) {
+          this.sendMessageRaw(this.buildMessage(id2, type2, payload));
+        };
+        SubscriptionClient2.prototype.sendMessageRaw = function (message) {
+          switch (this.status) {
+            case this.wsImpl.OPEN:
+              var serializedMessage = JSON.stringify(message);
+              try {
+                JSON.parse(serializedMessage);
+              } catch (e) {
+                this.eventEmitter.emit(
+                  "error",
+                  new Error(
+                    "Message must be JSON-serializable. Got: " + message
+                  )
+                );
+              }
+              this.client.send(serializedMessage);
+              break;
+            case this.wsImpl.CONNECTING:
+              this.unsentMessagesQueue.push(message);
+              break;
+            default:
+              if (!this.reconnecting) {
+                this.eventEmitter.emit(
+                  "error",
+                  new Error(
+                    "A message was not sent because socket is not connected, is closing or is already closed. Message was: " +
+                      JSON.stringify(message)
+                  )
+                );
+              }
+          }
+        };
+        SubscriptionClient2.prototype.generateOperationId = function () {
+          return String(++this.nextOperationId);
+        };
+        SubscriptionClient2.prototype.tryReconnect = function () {
+          var _this = this;
+          if (
+            !this.reconnect ||
+            this.backoff.attempts >= this.reconnectionAttempts
+          ) {
+            return;
+          }
+          if (!this.reconnecting) {
+            Object.keys(this.operations).forEach(function (key) {
+              _this.unsentMessagesQueue.push(
+                _this.buildMessage(
+                  key,
+                  message_types_1.default.GQL_START,
+                  _this.operations[key].options
+                )
+              );
+            });
+            this.reconnecting = true;
+          }
+          this.clearTryReconnectTimeout();
+          var delay = this.backoff.duration();
+          this.tryReconnectTimeoutId = setTimeout(function () {
+            _this.connect();
+          }, delay);
+        };
+        SubscriptionClient2.prototype.flushUnsentMessagesQueue = function () {
+          var _this = this;
+          this.unsentMessagesQueue.forEach(function (message) {
+            _this.sendMessageRaw(message);
+          });
+          this.unsentMessagesQueue = [];
+        };
+        SubscriptionClient2.prototype.checkConnection = function () {
+          if (this.wasKeepAliveReceived) {
+            this.wasKeepAliveReceived = false;
+            return;
+          }
+          if (!this.reconnecting) {
+            this.close(false, true);
+          }
+        };
+        SubscriptionClient2.prototype.checkMaxConnectTimeout = function () {
+          var _this = this;
+          this.clearMaxConnectTimeout();
+          this.maxConnectTimeoutId = setTimeout(function () {
+            if (_this.status !== _this.wsImpl.OPEN) {
+              _this.reconnecting = true;
+              _this.close(false, true);
+            }
+          }, this.maxConnectTimeGenerator.duration());
+        };
+        SubscriptionClient2.prototype.connect = function () {
+          var _a2;
+          var _this = this;
+          this.client = new ((_a2 = this.wsImpl).bind.apply(
+            _a2,
+            __spreadArray(
+              [void 0, this.url, this.wsProtocols],
+              this.wsOptionArguments,
+              false
+            )
+          ))();
+          this.checkMaxConnectTimeout();
+          this.client.onopen = function () {
+            return __awaiter(_this, void 0, void 0, function () {
+              var connectionParams, error_1;
+              return __generator(this, function (_a3) {
+                switch (_a3.label) {
+                  case 0:
+                    if (!(this.status === this.wsImpl.OPEN)) return [3, 4];
+                    this.clearMaxConnectTimeout();
+                    this.closedByUser = false;
+                    this.eventEmitter.emit(
+                      this.reconnecting ? "reconnecting" : "connecting"
+                    );
+                    _a3.label = 1;
+                  case 1:
+                    _a3.trys.push([1, 3, , 4]);
+                    return [4, this.connectionParams()];
+                  case 2:
+                    connectionParams = _a3.sent();
+                    this.sendMessage(
+                      void 0,
+                      message_types_1.default.GQL_CONNECTION_INIT,
+                      connectionParams
+                    );
+                    this.flushUnsentMessagesQueue();
+                    return [3, 4];
+                  case 3:
+                    error_1 = _a3.sent();
+                    this.sendMessage(
+                      void 0,
+                      message_types_1.default.GQL_CONNECTION_ERROR,
+                      error_1
+                    );
+                    this.flushUnsentMessagesQueue();
+                    return [3, 4];
+                  case 4:
+                    return [2];
+                }
+              });
+            });
+          };
+          this.client.onclose = function () {
+            if (!_this.closedByUser) {
+              _this.close(false, false);
+            }
+          };
+          this.client.onerror = function (err) {
+            _this.eventEmitter.emit("error", err);
+          };
+          this.client.onmessage = function (_a3) {
+            var data = _a3.data;
+            _this.processReceivedData(data);
+          };
+        };
+        SubscriptionClient2.prototype.processReceivedData = function (
+          receivedData
+        ) {
+          var parsedMessage;
+          var opId;
+          try {
+            parsedMessage = JSON.parse(receivedData);
+            opId = parsedMessage.id;
+          } catch (e) {
+            throw new Error(
+              "Message must be JSON-parseable. Got: " + receivedData
+            );
+          }
+          if (
+            [
+              message_types_1.default.GQL_DATA,
+              message_types_1.default.GQL_COMPLETE,
+              message_types_1.default.GQL_ERROR,
+            ].indexOf(parsedMessage.type) !== -1 &&
+            !this.operations[opId]
+          ) {
+            this.unsubscribe(opId);
+            return;
+          }
+          switch (parsedMessage.type) {
+            case message_types_1.default.GQL_CONNECTION_ERROR:
+              if (this.connectionCallback) {
+                this.connectionCallback(parsedMessage.payload);
+              }
+              break;
+            case message_types_1.default.GQL_CONNECTION_ACK:
+              this.eventEmitter.emit(
+                this.reconnecting ? "reconnected" : "connected",
+                parsedMessage.payload
+              );
+              this.reconnecting = false;
+              this.backoff.reset();
+              this.maxConnectTimeGenerator.reset();
+              if (this.connectionCallback) {
+                this.connectionCallback();
+              }
+              break;
+            case message_types_1.default.GQL_COMPLETE:
+              var handler = this.operations[opId].handler;
+              delete this.operations[opId];
+              handler.call(this, null, null);
+              break;
+            case message_types_1.default.GQL_ERROR:
+              this.operations[opId].handler(
+                this.formatErrors(parsedMessage.payload),
+                null
+              );
+              delete this.operations[opId];
+              break;
+            case message_types_1.default.GQL_DATA:
+              var parsedPayload = !parsedMessage.payload.errors
+                ? parsedMessage.payload
+                : __assign(__assign({}, parsedMessage.payload), {
+                    errors: this.formatErrors(parsedMessage.payload.errors),
+                  });
+              this.operations[opId].handler(null, parsedPayload);
+              break;
+            case message_types_1.default.GQL_CONNECTION_KEEP_ALIVE:
+              var firstKA = typeof this.wasKeepAliveReceived === "undefined";
+              this.wasKeepAliveReceived = true;
+              if (firstKA) {
+                this.checkConnection();
+              }
+              if (this.checkConnectionIntervalId) {
+                clearInterval(this.checkConnectionIntervalId);
+                this.checkConnection();
+              }
+              this.checkConnectionIntervalId = setInterval(
+                this.checkConnection.bind(this),
+                this.wsTimeout
+              );
+              break;
+            default:
+              throw new Error("Invalid message type!");
+          }
+        };
+        SubscriptionClient2.prototype.unsubscribe = function (opId) {
+          if (this.operations[opId]) {
+            delete this.operations[opId];
+            this.setInactivityTimeout();
+            this.sendMessage(opId, message_types_1.default.GQL_STOP, void 0);
+          }
+        };
+        return SubscriptionClient2;
+      })();
+      SubscriptionClient_1 = client.SubscriptionClient = SubscriptionClient;
+      const GraphQLLiveDirective = new GraphQLDirective({
+        name: "live",
+        description:
+          "Instruction for establishing a live connection that is updated once the underlying data changes.",
+        locations: [DirectiveLocation.QUERY],
+        args: {
+          if: {
+            type: GraphQLBoolean,
+            defaultValue: true,
+            description: "Whether the query should be live or not.",
+          },
+          throttle: {
+            type: GraphQLInt,
+            description:
+              'Propose a desired throttle interval ot the server in order to receive updates to at most once per "throttle" milliseconds. The server must not accept this value.',
+          },
+        },
+      });
+      const isNone = (input) => input == null;
+      const getLiveDirectiveNode = (input) => {
+        var _a2;
+        if (
+          input.kind !== "OperationDefinition" ||
+          input.operation !== "query"
+        ) {
+          return null;
+        }
+        const liveDirective =
+          (_a2 = input.directives) === null || _a2 === void 0
+            ? void 0
+            : _a2.find((d) => d.name.value === "live");
+        if (isNone(liveDirective)) {
+          return null;
+        }
+        return liveDirective;
+      };
+      const getLiveDirectiveArgumentValues = (node, variableValues) => {
+        var _a2;
+        const values = getDirectiveValues$1(
+          GraphQLLiveDirective,
+          { directives: [node] },
+          variableValues
+        );
+        return {
+          isLive:
+            (values === null || values === void 0 ? void 0 : values["if"]) ===
+            true,
+          throttleValue:
+            (_a2 =
+              values === null || values === void 0
+                ? void 0
+                : values["throttle"]) !== null && _a2 !== void 0
+              ? _a2
+              : null,
+        };
+      };
+      const isLiveQueryOperationDefinitionNode = (input, variables) => {
+        const liveDirectiveNode = getLiveDirectiveNode(input);
+        if (isNone(liveDirectiveNode)) {
+          return false;
+        }
+        return getLiveDirectiveArgumentValues(liveDirectiveNode, variables)
+          .isLive;
+      };
+      var fetch$1 = globalThis.fetch;
+      var FormData = globalThis.FormData;
+      var AbortController$1 = globalThis.AbortController;
+      var File$1 = globalThis.File;
+      var buffer = {};
+      var base64Js = {};
+      base64Js.byteLength = byteLength;
+      base64Js.toByteArray = toByteArray;
+      base64Js.fromByteArray = fromByteArray;
+      var lookup = [];
+      var revLookup = [];
+      var Arr = typeof Uint8Array !== "undefined" ? Uint8Array : Array;
+      var code$1 =
+        "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
+      for (var i = 0, len = code$1.length; i < len; ++i) {
+        lookup[i] = code$1[i];
+        revLookup[code$1.charCodeAt(i)] = i;
+      }
+      revLookup["-".charCodeAt(0)] = 62;
+      revLookup["_".charCodeAt(0)] = 63;
+      function getLens(b64) {
+        var len = b64.length;
+        if (len % 4 > 0) {
+          throw new Error("Invalid string. Length must be a multiple of 4");
+        }
+        var validLen = b64.indexOf("=");
+        if (validLen === -1) validLen = len;
+        var placeHoldersLen = validLen === len ? 0 : 4 - (validLen % 4);
+        return [validLen, placeHoldersLen];
+      }
+      function byteLength(b64) {
+        var lens = getLens(b64);
+        var validLen = lens[0];
+        var placeHoldersLen = lens[1];
+        return ((validLen + placeHoldersLen) * 3) / 4 - placeHoldersLen;
+      }
+      function _byteLength(b64, validLen, placeHoldersLen) {
+        return ((validLen + placeHoldersLen) * 3) / 4 - placeHoldersLen;
+      }
+      function toByteArray(b64) {
+        var tmp;
+        var lens = getLens(b64);
+        var validLen = lens[0];
+        var placeHoldersLen = lens[1];
+        var arr = new Arr(_byteLength(b64, validLen, placeHoldersLen));
+        var curByte = 0;
+        var len = placeHoldersLen > 0 ? validLen - 4 : validLen;
+        var i;
+        for (i = 0; i < len; i += 4) {
+          tmp =
+            (revLookup[b64.charCodeAt(i)] << 18) |
+            (revLookup[b64.charCodeAt(i + 1)] << 12) |
+            (revLookup[b64.charCodeAt(i + 2)] << 6) |
+            revLookup[b64.charCodeAt(i + 3)];
+          arr[curByte++] = (tmp >> 16) & 255;
+          arr[curByte++] = (tmp >> 8) & 255;
+          arr[curByte++] = tmp & 255;
+        }
+        if (placeHoldersLen === 2) {
+          tmp =
+            (revLookup[b64.charCodeAt(i)] << 2) |
+            (revLookup[b64.charCodeAt(i + 1)] >> 4);
+          arr[curByte++] = tmp & 255;
+        }
+        if (placeHoldersLen === 1) {
+          tmp =
+            (revLookup[b64.charCodeAt(i)] << 10) |
+            (revLookup[b64.charCodeAt(i + 1)] << 4) |
+            (revLookup[b64.charCodeAt(i + 2)] >> 2);
+          arr[curByte++] = (tmp >> 8) & 255;
+          arr[curByte++] = tmp & 255;
+        }
+        return arr;
+      }
+      function tripletToBase64(num2) {
+        return (
+          lookup[(num2 >> 18) & 63] +
+          lookup[(num2 >> 12) & 63] +
+          lookup[(num2 >> 6) & 63] +
+          lookup[num2 & 63]
+        );
+      }
+      function encodeChunk(uint8, start2, end2) {
+        var tmp;
+        var output = [];
+        for (var i = start2; i < end2; i += 3) {
+          tmp =
+            ((uint8[i] << 16) & 16711680) +
+            ((uint8[i + 1] << 8) & 65280) +
+            (uint8[i + 2] & 255);
+          output.push(tripletToBase64(tmp));
+        }
+        return output.join("");
+      }
+      function fromByteArray(uint8) {
+        var tmp;
+        var len = uint8.length;
+        var extraBytes = len % 3;
+        var parts = [];
+        var maxChunkLength = 16383;
+        for (
+          var i = 0, len2 = len - extraBytes;
+          i < len2;
+          i += maxChunkLength
+        ) {
+          parts.push(
+            encodeChunk(
+              uint8,
+              i,
+              i + maxChunkLength > len2 ? len2 : i + maxChunkLength
+            )
+          );
+        }
+        if (extraBytes === 1) {
+          tmp = uint8[len - 1];
+          parts.push(lookup[tmp >> 2] + lookup[(tmp << 4) & 63] + "==");
+        } else if (extraBytes === 2) {
+          tmp = (uint8[len - 2] << 8) + uint8[len - 1];
+          parts.push(
+            lookup[tmp >> 10] +
+              lookup[(tmp >> 4) & 63] +
+              lookup[(tmp << 2) & 63] +
+              "="
+          );
+        }
+        return parts.join("");
+      }
+      var ieee754 = {};
+      /*! ieee754. BSD-3-Clause License. Feross Aboukhadijeh <https://feross.org/opensource> */
+      ieee754.read = function (buffer2, offset, isLE, mLen, nBytes) {
+        var e, m;
+        var eLen = nBytes * 8 - mLen - 1;
+        var eMax = (1 << eLen) - 1;
+        var eBias = eMax >> 1;
+        var nBits = -7;
+        var i = isLE ? nBytes - 1 : 0;
+        var d = isLE ? -1 : 1;
+        var s = buffer2[offset + i];
+        i += d;
+        e = s & ((1 << -nBits) - 1);
+        s >>= -nBits;
+        nBits += eLen;
+        for (
+          ;
+          nBits > 0;
+          e = e * 256 + buffer2[offset + i], i += d, nBits -= 8
+        ) {}
+        m = e & ((1 << -nBits) - 1);
+        e >>= -nBits;
+        nBits += mLen;
+        for (
+          ;
+          nBits > 0;
+          m = m * 256 + buffer2[offset + i], i += d, nBits -= 8
+        ) {}
+        if (e === 0) {
+          e = 1 - eBias;
+        } else if (e === eMax) {
+          return m ? NaN : (s ? -1 : 1) * Infinity;
+        } else {
+          m = m + Math.pow(2, mLen);
+          e = e - eBias;
+        }
+        return (s ? -1 : 1) * m * Math.pow(2, e - mLen);
+      };
+      ieee754.write = function (buffer2, value, offset, isLE, mLen, nBytes) {
+        var e, m, c;
+        var eLen = nBytes * 8 - mLen - 1;
+        var eMax = (1 << eLen) - 1;
+        var eBias = eMax >> 1;
+        var rt = mLen === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0;
+        var i = isLE ? 0 : nBytes - 1;
+        var d = isLE ? 1 : -1;
+        var s = value < 0 || (value === 0 && 1 / value < 0) ? 1 : 0;
+        value = Math.abs(value);
+        if (isNaN(value) || value === Infinity) {
+          m = isNaN(value) ? 1 : 0;
+          e = eMax;
+        } else {
+          e = Math.floor(Math.log(value) / Math.LN2);
+          if (value * (c = Math.pow(2, -e)) < 1) {
+            e--;
+            c *= 2;
+          }
+          if (e + eBias >= 1) {
+            value += rt / c;
+          } else {
+            value += rt * Math.pow(2, 1 - eBias);
+          }
+          if (value * c >= 2) {
+            e++;
+            c /= 2;
+          }
+          if (e + eBias >= eMax) {
+            m = 0;
+            e = eMax;
+          } else if (e + eBias >= 1) {
+            m = (value * c - 1) * Math.pow(2, mLen);
+            e = e + eBias;
+          } else {
+            m = value * Math.pow(2, eBias - 1) * Math.pow(2, mLen);
+            e = 0;
+          }
+        }
+        for (
+          ;
+          mLen >= 8;
+          buffer2[offset + i] = m & 255, i += d, m /= 256, mLen -= 8
+        ) {}
+        e = (e << mLen) | m;
+        eLen += mLen;
+        for (
+          ;
+          eLen > 0;
+          buffer2[offset + i] = e & 255, i += d, e /= 256, eLen -= 8
+        ) {}
+        buffer2[offset + i - d] |= s * 128;
+      };
+      /*!
+       * The buffer module from node.js, for the browser.
+       *
+       * @author   Feross Aboukhadijeh <https://feross.org>
+       * @license  MIT
+       */
+      (function (exports) {
+        var base64 = base64Js;
+        var ieee754$1 = ieee754;
+        var customInspectSymbol =
+          typeof Symbol === "function" && typeof Symbol["for"] === "function"
+            ? Symbol["for"]("nodejs.util.inspect.custom")
+            : null;
+        exports.Buffer = Buffer2;
+        exports.SlowBuffer = SlowBuffer;
+        exports.INSPECT_MAX_BYTES = 50;
+        var K_MAX_LENGTH = 2147483647;
+        exports.kMaxLength = K_MAX_LENGTH;
+        Buffer2.TYPED_ARRAY_SUPPORT = typedArraySupport();
+        if (
+          !Buffer2.TYPED_ARRAY_SUPPORT &&
+          typeof console !== "undefined" &&
+          typeof console.error === "function"
+        ) {
+          console.error(
+            "This browser lacks typed array (Uint8Array) support which is required by `buffer` v5.x. Use `buffer` v4.x if you require old browser support."
+          );
+        }
+        function typedArraySupport() {
+          try {
+            var arr = new Uint8Array(1);
+            var proto = {
+              foo: function () {
+                return 42;
+              },
+            };
+            Object.setPrototypeOf(proto, Uint8Array.prototype);
+            Object.setPrototypeOf(arr, proto);
+            return arr.foo() === 42;
+          } catch (e) {
+            return false;
+          }
+        }
+        Object.defineProperty(Buffer2.prototype, "parent", {
+          enumerable: true,
+          get: function () {
+            if (!Buffer2.isBuffer(this)) return void 0;
+            return this.buffer;
+          },
+        });
+        Object.defineProperty(Buffer2.prototype, "offset", {
+          enumerable: true,
+          get: function () {
+            if (!Buffer2.isBuffer(this)) return void 0;
+            return this.byteOffset;
+          },
+        });
+        function createBuffer(length) {
+          if (length > K_MAX_LENGTH) {
+            throw new RangeError(
+              'The value "' + length + '" is invalid for option "size"'
+            );
+          }
+          var buf = new Uint8Array(length);
+          Object.setPrototypeOf(buf, Buffer2.prototype);
+          return buf;
+        }
+        function Buffer2(arg, encodingOrOffset, length) {
+          if (typeof arg === "number") {
+            if (typeof encodingOrOffset === "string") {
+              throw new TypeError(
+                'The "string" argument must be of type string. Received type number'
+              );
+            }
+            return allocUnsafe(arg);
+          }
+          return from(arg, encodingOrOffset, length);
+        }
+        Buffer2.poolSize = 8192;
+        function from(value, encodingOrOffset, length) {
+          if (typeof value === "string") {
+            return fromString(value, encodingOrOffset);
+          }
+          if (ArrayBuffer.isView(value)) {
+            return fromArrayView(value);
+          }
+          if (value == null) {
+            throw new TypeError(
+              "The first argument must be one of type string, Buffer, ArrayBuffer, Array, or Array-like Object. Received type " +
+                typeof value
+            );
+          }
+          if (
+            isInstance(value, ArrayBuffer) ||
+            (value && isInstance(value.buffer, ArrayBuffer))
+          ) {
+            return fromArrayBuffer(value, encodingOrOffset, length);
+          }
+          if (
+            typeof SharedArrayBuffer !== "undefined" &&
+            (isInstance(value, SharedArrayBuffer) ||
+              (value && isInstance(value.buffer, SharedArrayBuffer)))
+          ) {
+            return fromArrayBuffer(value, encodingOrOffset, length);
+          }
+          if (typeof value === "number") {
+            throw new TypeError(
+              'The "value" argument must not be of type number. Received type number'
+            );
+          }
+          var valueOf = value.valueOf && value.valueOf();
+          if (valueOf != null && valueOf !== value) {
+            return Buffer2.from(valueOf, encodingOrOffset, length);
+          }
+          var b = fromObject(value);
+          if (b) return b;
+          if (
+            typeof Symbol !== "undefined" &&
+            Symbol.toPrimitive != null &&
+            typeof value[Symbol.toPrimitive] === "function"
+          ) {
+            return Buffer2.from(
+              value[Symbol.toPrimitive]("string"),
+              encodingOrOffset,
+              length
+            );
+          }
+          throw new TypeError(
+            "The first argument must be one of type string, Buffer, ArrayBuffer, Array, or Array-like Object. Received type " +
+              typeof value
+          );
+        }
+        Buffer2.from = function (value, encodingOrOffset, length) {
+          return from(value, encodingOrOffset, length);
+        };
+        Object.setPrototypeOf(Buffer2.prototype, Uint8Array.prototype);
+        Object.setPrototypeOf(Buffer2, Uint8Array);
+        function assertSize(size) {
+          if (typeof size !== "number") {
+            throw new TypeError('"size" argument must be of type number');
+          } else if (size < 0) {
+            throw new RangeError(
+              'The value "' + size + '" is invalid for option "size"'
+            );
+          }
+        }
+        function alloc(size, fill, encoding) {
+          assertSize(size);
+          if (size <= 0) {
+            return createBuffer(size);
+          }
+          if (fill !== void 0) {
+            return typeof encoding === "string"
+              ? createBuffer(size).fill(fill, encoding)
+              : createBuffer(size).fill(fill);
+          }
+          return createBuffer(size);
+        }
+        Buffer2.alloc = function (size, fill, encoding) {
+          return alloc(size, fill, encoding);
+        };
+        function allocUnsafe(size) {
+          assertSize(size);
+          return createBuffer(size < 0 ? 0 : checked(size) | 0);
+        }
+        Buffer2.allocUnsafe = function (size) {
+          return allocUnsafe(size);
+        };
+        Buffer2.allocUnsafeSlow = function (size) {
+          return allocUnsafe(size);
+        };
+        function fromString(string2, encoding) {
+          if (typeof encoding !== "string" || encoding === "") {
+            encoding = "utf8";
+          }
+          if (!Buffer2.isEncoding(encoding)) {
+            throw new TypeError("Unknown encoding: " + encoding);
+          }
+          var length = byteLength2(string2, encoding) | 0;
+          var buf = createBuffer(length);
+          var actual = buf.write(string2, encoding);
+          if (actual !== length) {
+            buf = buf.slice(0, actual);
+          }
+          return buf;
+        }
+        function fromArrayLike(array) {
+          var length = array.length < 0 ? 0 : checked(array.length) | 0;
+          var buf = createBuffer(length);
+          for (var i = 0; i < length; i += 1) {
+            buf[i] = array[i] & 255;
+          }
+          return buf;
+        }
+        function fromArrayView(arrayView) {
+          if (isInstance(arrayView, Uint8Array)) {
+            var copy2 = new Uint8Array(arrayView);
+            return fromArrayBuffer(
+              copy2.buffer,
+              copy2.byteOffset,
+              copy2.byteLength
+            );
+          }
+          return fromArrayLike(arrayView);
+        }
+        function fromArrayBuffer(array, byteOffset, length) {
+          if (byteOffset < 0 || array.byteLength < byteOffset) {
+            throw new RangeError('"offset" is outside of buffer bounds');
+          }
+          if (array.byteLength < byteOffset + (length || 0)) {
+            throw new RangeError('"length" is outside of buffer bounds');
+          }
+          var buf;
+          if (byteOffset === void 0 && length === void 0) {
+            buf = new Uint8Array(array);
+          } else if (length === void 0) {
+            buf = new Uint8Array(array, byteOffset);
+          } else {
+            buf = new Uint8Array(array, byteOffset, length);
+          }
+          Object.setPrototypeOf(buf, Buffer2.prototype);
+          return buf;
+        }
+        function fromObject(obj) {
+          if (Buffer2.isBuffer(obj)) {
+            var len = checked(obj.length) | 0;
+            var buf = createBuffer(len);
+            if (buf.length === 0) {
+              return buf;
+            }
+            obj.copy(buf, 0, 0, len);
+            return buf;
+          }
+          if (obj.length !== void 0) {
+            if (typeof obj.length !== "number" || numberIsNaN(obj.length)) {
+              return createBuffer(0);
+            }
+            return fromArrayLike(obj);
+          }
+          if (obj.type === "Buffer" && Array.isArray(obj.data)) {
+            return fromArrayLike(obj.data);
+          }
+        }
+        function checked(length) {
+          if (length >= K_MAX_LENGTH) {
+            throw new RangeError(
+              "Attempt to allocate Buffer larger than maximum size: 0x" +
+                K_MAX_LENGTH.toString(16) +
+                " bytes"
+            );
+          }
+          return length | 0;
+        }
+        function SlowBuffer(length) {
+          if (+length != length) {
+            length = 0;
+          }
+          return Buffer2.alloc(+length);
+        }
+        Buffer2.isBuffer = function isBuffer(b) {
+          return b != null && b._isBuffer === true && b !== Buffer2.prototype;
+        };
+        Buffer2.compare = function compare(a, b) {
+          if (isInstance(a, Uint8Array))
+            a = Buffer2.from(a, a.offset, a.byteLength);
+          if (isInstance(b, Uint8Array))
+            b = Buffer2.from(b, b.offset, b.byteLength);
+          if (!Buffer2.isBuffer(a) || !Buffer2.isBuffer(b)) {
+            throw new TypeError(
+              'The "buf1", "buf2" arguments must be one of type Buffer or Uint8Array'
+            );
+          }
+          if (a === b) return 0;
+          var x2 = a.length;
+          var y2 = b.length;
+          for (var i = 0, len = Math.min(x2, y2); i < len; ++i) {
+            if (a[i] !== b[i]) {
+              x2 = a[i];
+              y2 = b[i];
+              break;
+            }
+          }
+          if (x2 < y2) return -1;
+          if (y2 < x2) return 1;
+          return 0;
+        };
+        Buffer2.isEncoding = function isEncoding(encoding) {
+          switch (String(encoding).toLowerCase()) {
+            case "hex":
+            case "utf8":
+            case "utf-8":
+            case "ascii":
+            case "latin1":
+            case "binary":
+            case "base64":
+            case "ucs2":
+            case "ucs-2":
+            case "utf16le":
+            case "utf-16le":
+              return true;
+            default:
+              return false;
+          }
+        };
+        Buffer2.concat = function concat2(list3, length) {
+          if (!Array.isArray(list3)) {
+            throw new TypeError('"list" argument must be an Array of Buffers');
+          }
+          if (list3.length === 0) {
+            return Buffer2.alloc(0);
+          }
+          var i;
+          if (length === void 0) {
+            length = 0;
+            for (i = 0; i < list3.length; ++i) {
+              length += list3[i].length;
+            }
+          }
+          var buffer2 = Buffer2.allocUnsafe(length);
+          var pos = 0;
+          for (i = 0; i < list3.length; ++i) {
+            var buf = list3[i];
+            if (isInstance(buf, Uint8Array)) {
+              if (pos + buf.length > buffer2.length) {
+                Buffer2.from(buf).copy(buffer2, pos);
+              } else {
+                Uint8Array.prototype.set.call(buffer2, buf, pos);
+              }
+            } else if (!Buffer2.isBuffer(buf)) {
+              throw new TypeError(
+                '"list" argument must be an Array of Buffers'
+              );
+            } else {
+              buf.copy(buffer2, pos);
+            }
+            pos += buf.length;
+          }
+          return buffer2;
+        };
+        function byteLength2(string2, encoding) {
+          if (Buffer2.isBuffer(string2)) {
+            return string2.length;
+          }
+          if (ArrayBuffer.isView(string2) || isInstance(string2, ArrayBuffer)) {
+            return string2.byteLength;
+          }
+          if (typeof string2 !== "string") {
+            throw new TypeError(
+              'The "string" argument must be one of type string, Buffer, or ArrayBuffer. Received type ' +
+                typeof string2
+            );
+          }
+          var len = string2.length;
+          var mustMatch = arguments.length > 2 && arguments[2] === true;
+          if (!mustMatch && len === 0) return 0;
+          var loweredCase = false;
+          for (;;) {
+            switch (encoding) {
+              case "ascii":
+              case "latin1":
+              case "binary":
+                return len;
+              case "utf8":
+              case "utf-8":
+                return utf8ToBytes(string2).length;
+              case "ucs2":
+              case "ucs-2":
+              case "utf16le":
+              case "utf-16le":
+                return len * 2;
+              case "hex":
+                return len >>> 1;
+              case "base64":
+                return base64ToBytes(string2).length;
+              default:
+                if (loweredCase) {
+                  return mustMatch ? -1 : utf8ToBytes(string2).length;
+                }
+                encoding = ("" + encoding).toLowerCase();
+                loweredCase = true;
+            }
+          }
+        }
+        Buffer2.byteLength = byteLength2;
+        function slowToString(encoding, start2, end2) {
+          var loweredCase = false;
+          if (start2 === void 0 || start2 < 0) {
+            start2 = 0;
+          }
+          if (start2 > this.length) {
+            return "";
+          }
+          if (end2 === void 0 || end2 > this.length) {
+            end2 = this.length;
+          }
+          if (end2 <= 0) {
+            return "";
+          }
+          end2 >>>= 0;
+          start2 >>>= 0;
+          if (end2 <= start2) {
+            return "";
+          }
+          if (!encoding) encoding = "utf8";
+          while (true) {
+            switch (encoding) {
+              case "hex":
+                return hexSlice(this, start2, end2);
+              case "utf8":
+              case "utf-8":
+                return utf8Slice(this, start2, end2);
+              case "ascii":
+                return asciiSlice(this, start2, end2);
+              case "latin1":
+              case "binary":
+                return latin1Slice(this, start2, end2);
+              case "base64":
+                return base64Slice(this, start2, end2);
+              case "ucs2":
+              case "ucs-2":
+              case "utf16le":
+              case "utf-16le":
+                return utf16leSlice(this, start2, end2);
+              default:
+                if (loweredCase)
+                  throw new TypeError("Unknown encoding: " + encoding);
+                encoding = (encoding + "").toLowerCase();
+                loweredCase = true;
+            }
+          }
+        }
+        Buffer2.prototype._isBuffer = true;
+        function swap(b, n2, m) {
+          var i = b[n2];
+          b[n2] = b[m];
+          b[m] = i;
+        }
+        Buffer2.prototype.swap16 = function swap16() {
+          var len = this.length;
+          if (len % 2 !== 0) {
+            throw new RangeError("Buffer size must be a multiple of 16-bits");
+          }
+          for (var i = 0; i < len; i += 2) {
+            swap(this, i, i + 1);
+          }
+          return this;
+        };
+        Buffer2.prototype.swap32 = function swap32() {
+          var len = this.length;
+          if (len % 4 !== 0) {
+            throw new RangeError("Buffer size must be a multiple of 32-bits");
+          }
+          for (var i = 0; i < len; i += 4) {
+            swap(this, i, i + 3);
+            swap(this, i + 1, i + 2);
+          }
+          return this;
+        };
+        Buffer2.prototype.swap64 = function swap64() {
+          var len = this.length;
+          if (len % 8 !== 0) {
+            throw new RangeError("Buffer size must be a multiple of 64-bits");
+          }
+          for (var i = 0; i < len; i += 8) {
+            swap(this, i, i + 7);
+            swap(this, i + 1, i + 6);
+            swap(this, i + 2, i + 5);
+            swap(this, i + 3, i + 4);
+          }
+          return this;
+        };
+        Buffer2.prototype.toString = function toString() {
+          var length = this.length;
+          if (length === 0) return "";
+          if (arguments.length === 0) return utf8Slice(this, 0, length);
+          return slowToString.apply(this, arguments);
+        };
+        Buffer2.prototype.toLocaleString = Buffer2.prototype.toString;
+        Buffer2.prototype.equals = function equals2(b) {
+          if (!Buffer2.isBuffer(b))
+            throw new TypeError("Argument must be a Buffer");
+          if (this === b) return true;
+          return Buffer2.compare(this, b) === 0;
+        };
+        Buffer2.prototype.inspect = function inspect2() {
+          var str = "";
+          var max = exports.INSPECT_MAX_BYTES;
+          str = this.toString("hex", 0, max)
+            .replace(/(.{2})/g, "$1 ")
+            .trim();
+          if (this.length > max) str += " ... ";
+          return "<Buffer " + str + ">";
+        };
+        if (customInspectSymbol) {
+          Buffer2.prototype[customInspectSymbol] = Buffer2.prototype.inspect;
+        }
+        Buffer2.prototype.compare = function compare(
+          target2,
+          start2,
+          end2,
+          thisStart,
+          thisEnd
+        ) {
+          if (isInstance(target2, Uint8Array)) {
+            target2 = Buffer2.from(target2, target2.offset, target2.byteLength);
+          }
+          if (!Buffer2.isBuffer(target2)) {
+            throw new TypeError(
+              'The "target" argument must be one of type Buffer or Uint8Array. Received type ' +
+                typeof target2
+            );
+          }
+          if (start2 === void 0) {
+            start2 = 0;
+          }
+          if (end2 === void 0) {
+            end2 = target2 ? target2.length : 0;
+          }
+          if (thisStart === void 0) {
+            thisStart = 0;
+          }
+          if (thisEnd === void 0) {
+            thisEnd = this.length;
+          }
+          if (
+            start2 < 0 ||
+            end2 > target2.length ||
+            thisStart < 0 ||
+            thisEnd > this.length
+          ) {
+            throw new RangeError("out of range index");
+          }
+          if (thisStart >= thisEnd && start2 >= end2) {
+            return 0;
+          }
+          if (thisStart >= thisEnd) {
+            return -1;
+          }
+          if (start2 >= end2) {
+            return 1;
+          }
+          start2 >>>= 0;
+          end2 >>>= 0;
+          thisStart >>>= 0;
+          thisEnd >>>= 0;
+          if (this === target2) return 0;
+          var x2 = thisEnd - thisStart;
+          var y2 = end2 - start2;
+          var len = Math.min(x2, y2);
+          var thisCopy = this.slice(thisStart, thisEnd);
+          var targetCopy = target2.slice(start2, end2);
+          for (var i = 0; i < len; ++i) {
+            if (thisCopy[i] !== targetCopy[i]) {
+              x2 = thisCopy[i];
+              y2 = targetCopy[i];
+              break;
+            }
+          }
+          if (x2 < y2) return -1;
+          if (y2 < x2) return 1;
+          return 0;
+        };
+        function bidirectionalIndexOf(buffer2, val, byteOffset, encoding, dir) {
+          if (buffer2.length === 0) return -1;
+          if (typeof byteOffset === "string") {
+            encoding = byteOffset;
+            byteOffset = 0;
+          } else if (byteOffset > 2147483647) {
+            byteOffset = 2147483647;
+          } else if (byteOffset < -2147483648) {
+            byteOffset = -2147483648;
+          }
+          byteOffset = +byteOffset;
+          if (numberIsNaN(byteOffset)) {
+            byteOffset = dir ? 0 : buffer2.length - 1;
+          }
+          if (byteOffset < 0) byteOffset = buffer2.length + byteOffset;
+          if (byteOffset >= buffer2.length) {
+            if (dir) return -1;
+            else byteOffset = buffer2.length - 1;
+          } else if (byteOffset < 0) {
+            if (dir) byteOffset = 0;
+            else return -1;
+          }
+          if (typeof val === "string") {
+            val = Buffer2.from(val, encoding);
+          }
+          if (Buffer2.isBuffer(val)) {
+            if (val.length === 0) {
+              return -1;
+            }
+            return arrayIndexOf(buffer2, val, byteOffset, encoding, dir);
+          } else if (typeof val === "number") {
+            val = val & 255;
+            if (typeof Uint8Array.prototype.indexOf === "function") {
+              if (dir) {
+                return Uint8Array.prototype.indexOf.call(
+                  buffer2,
+                  val,
+                  byteOffset
+                );
+              } else {
+                return Uint8Array.prototype.lastIndexOf.call(
+                  buffer2,
+                  val,
+                  byteOffset
+                );
+              }
+            }
+            return arrayIndexOf(buffer2, [val], byteOffset, encoding, dir);
+          }
+          throw new TypeError("val must be string, number or Buffer");
+        }
+        function arrayIndexOf(arr, val, byteOffset, encoding, dir) {
+          var indexSize = 1;
+          var arrLength = arr.length;
+          var valLength = val.length;
+          if (encoding !== void 0) {
+            encoding = String(encoding).toLowerCase();
+            if (
+              encoding === "ucs2" ||
+              encoding === "ucs-2" ||
+              encoding === "utf16le" ||
+              encoding === "utf-16le"
+            ) {
+              if (arr.length < 2 || val.length < 2) {
+                return -1;
+              }
+              indexSize = 2;
+              arrLength /= 2;
+              valLength /= 2;
+              byteOffset /= 2;
+            }
+          }
+          function read(buf, i2) {
+            if (indexSize === 1) {
+              return buf[i2];
+            } else {
+              return buf.readUInt16BE(i2 * indexSize);
+            }
+          }
+          var i;
+          if (dir) {
+            var foundIndex = -1;
+            for (i = byteOffset; i < arrLength; i++) {
+              if (
+                read(arr, i) ===
+                read(val, foundIndex === -1 ? 0 : i - foundIndex)
+              ) {
+                if (foundIndex === -1) foundIndex = i;
+                if (i - foundIndex + 1 === valLength)
+                  return foundIndex * indexSize;
+              } else {
+                if (foundIndex !== -1) i -= i - foundIndex;
+                foundIndex = -1;
+              }
+            }
+          } else {
+            if (byteOffset + valLength > arrLength)
+              byteOffset = arrLength - valLength;
+            for (i = byteOffset; i >= 0; i--) {
+              var found = true;
+              for (var j = 0; j < valLength; j++) {
+                if (read(arr, i + j) !== read(val, j)) {
+                  found = false;
+                  break;
+                }
+              }
+              if (found) return i;
+            }
+          }
+          return -1;
+        }
+        Buffer2.prototype.includes = function includes(
+          val,
+          byteOffset,
+          encoding
+        ) {
+          return this.indexOf(val, byteOffset, encoding) !== -1;
+        };
+        Buffer2.prototype.indexOf = function indexOf(
+          val,
+          byteOffset,
+          encoding
+        ) {
+          return bidirectionalIndexOf(this, val, byteOffset, encoding, true);
+        };
+        Buffer2.prototype.lastIndexOf = function lastIndexOf(
+          val,
+          byteOffset,
+          encoding
+        ) {
+          return bidirectionalIndexOf(this, val, byteOffset, encoding, false);
+        };
+        function hexWrite(buf, string2, offset, length) {
+          offset = Number(offset) || 0;
+          var remaining = buf.length - offset;
+          if (!length) {
+            length = remaining;
+          } else {
+            length = Number(length);
+            if (length > remaining) {
+              length = remaining;
+            }
+          }
+          var strLen2 = string2.length;
+          if (length > strLen2 / 2) {
+            length = strLen2 / 2;
+          }
+          for (var i = 0; i < length; ++i) {
+            var parsed = parseInt(string2.substr(i * 2, 2), 16);
+            if (numberIsNaN(parsed)) return i;
+            buf[offset + i] = parsed;
+          }
+          return i;
+        }
+        function utf8Write(buf, string2, offset, length) {
+          return blitBuffer(
+            utf8ToBytes(string2, buf.length - offset),
+            buf,
+            offset,
+            length
+          );
+        }
+        function asciiWrite(buf, string2, offset, length) {
+          return blitBuffer(asciiToBytes(string2), buf, offset, length);
+        }
+        function base64Write(buf, string2, offset, length) {
+          return blitBuffer(base64ToBytes(string2), buf, offset, length);
+        }
+        function ucs2Write(buf, string2, offset, length) {
+          return blitBuffer(
+            utf16leToBytes(string2, buf.length - offset),
+            buf,
+            offset,
+            length
+          );
+        }
+        Buffer2.prototype.write = function write(
+          string2,
+          offset,
+          length,
+          encoding
+        ) {
+          if (offset === void 0) {
+            encoding = "utf8";
+            length = this.length;
+            offset = 0;
+          } else if (length === void 0 && typeof offset === "string") {
+            encoding = offset;
+            length = this.length;
+            offset = 0;
+          } else if (isFinite(offset)) {
+            offset = offset >>> 0;
+            if (isFinite(length)) {
+              length = length >>> 0;
+              if (encoding === void 0) encoding = "utf8";
+            } else {
+              encoding = length;
+              length = void 0;
+            }
+          } else {
+            throw new Error(
+              "Buffer.write(string, encoding, offset[, length]) is no longer supported"
+            );
+          }
+          var remaining = this.length - offset;
+          if (length === void 0 || length > remaining) length = remaining;
+          if (
+            (string2.length > 0 && (length < 0 || offset < 0)) ||
+            offset > this.length
+          ) {
+            throw new RangeError("Attempt to write outside buffer bounds");
+          }
+          if (!encoding) encoding = "utf8";
+          var loweredCase = false;
+          for (;;) {
+            switch (encoding) {
+              case "hex":
+                return hexWrite(this, string2, offset, length);
+              case "utf8":
+              case "utf-8":
+                return utf8Write(this, string2, offset, length);
+              case "ascii":
+              case "latin1":
+              case "binary":
+                return asciiWrite(this, string2, offset, length);
+              case "base64":
+                return base64Write(this, string2, offset, length);
+              case "ucs2":
+              case "ucs-2":
+              case "utf16le":
+              case "utf-16le":
+                return ucs2Write(this, string2, offset, length);
+              default:
+                if (loweredCase)
+                  throw new TypeError("Unknown encoding: " + encoding);
+                encoding = ("" + encoding).toLowerCase();
+                loweredCase = true;
+            }
+          }
+        };
+        Buffer2.prototype.toJSON = function toJSON() {
+          return {
+            type: "Buffer",
+            data: Array.prototype.slice.call(this._arr || this, 0),
+          };
+        };
+        function base64Slice(buf, start2, end2) {
+          if (start2 === 0 && end2 === buf.length) {
+            return base64.fromByteArray(buf);
+          } else {
+            return base64.fromByteArray(buf.slice(start2, end2));
+          }
+        }
+        function utf8Slice(buf, start2, end2) {
+          end2 = Math.min(buf.length, end2);
+          var res = [];
+          var i = start2;
+          while (i < end2) {
+            var firstByte = buf[i];
+            var codePoint = null;
+            var bytesPerSequence =
+              firstByte > 239
+                ? 4
+                : firstByte > 223
+                ? 3
+                : firstByte > 191
+                ? 2
+                : 1;
+            if (i + bytesPerSequence <= end2) {
+              var secondByte, thirdByte, fourthByte, tempCodePoint;
+              switch (bytesPerSequence) {
+                case 1:
+                  if (firstByte < 128) {
+                    codePoint = firstByte;
+                  }
+                  break;
+                case 2:
+                  secondByte = buf[i + 1];
+                  if ((secondByte & 192) === 128) {
+                    tempCodePoint = ((firstByte & 31) << 6) | (secondByte & 63);
+                    if (tempCodePoint > 127) {
+                      codePoint = tempCodePoint;
+                    }
+                  }
+                  break;
+                case 3:
+                  secondByte = buf[i + 1];
+                  thirdByte = buf[i + 2];
+                  if ((secondByte & 192) === 128 && (thirdByte & 192) === 128) {
+                    tempCodePoint =
+                      ((firstByte & 15) << 12) |
+                      ((secondByte & 63) << 6) |
+                      (thirdByte & 63);
+                    if (
+                      tempCodePoint > 2047 &&
+                      (tempCodePoint < 55296 || tempCodePoint > 57343)
+                    ) {
+                      codePoint = tempCodePoint;
+                    }
+                  }
+                  break;
+                case 4:
+                  secondByte = buf[i + 1];
+                  thirdByte = buf[i + 2];
+                  fourthByte = buf[i + 3];
+                  if (
+                    (secondByte & 192) === 128 &&
+                    (thirdByte & 192) === 128 &&
+                    (fourthByte & 192) === 128
+                  ) {
+                    tempCodePoint =
+                      ((firstByte & 15) << 18) |
+                      ((secondByte & 63) << 12) |
+                      ((thirdByte & 63) << 6) |
+                      (fourthByte & 63);
+                    if (tempCodePoint > 65535 && tempCodePoint < 1114112) {
+                      codePoint = tempCodePoint;
+                    }
+                  }
+              }
+            }
+            if (codePoint === null) {
+              codePoint = 65533;
+              bytesPerSequence = 1;
+            } else if (codePoint > 65535) {
+              codePoint -= 65536;
+              res.push(((codePoint >>> 10) & 1023) | 55296);
+              codePoint = 56320 | (codePoint & 1023);
+            }
+            res.push(codePoint);
+            i += bytesPerSequence;
+          }
+          return decodeCodePointsArray(res);
+        }
+        var MAX_ARGUMENTS_LENGTH = 4096;
+        function decodeCodePointsArray(codePoints) {
+          var len = codePoints.length;
+          if (len <= MAX_ARGUMENTS_LENGTH) {
+            return String.fromCharCode.apply(String, codePoints);
+          }
+          var res = "";
+          var i = 0;
+          while (i < len) {
+            res += String.fromCharCode.apply(
+              String,
+              codePoints.slice(i, (i += MAX_ARGUMENTS_LENGTH))
+            );
+          }
+          return res;
+        }
+        function asciiSlice(buf, start2, end2) {
+          var ret = "";
+          end2 = Math.min(buf.length, end2);
+          for (var i = start2; i < end2; ++i) {
+            ret += String.fromCharCode(buf[i] & 127);
+          }
+          return ret;
+        }
+        function latin1Slice(buf, start2, end2) {
+          var ret = "";
+          end2 = Math.min(buf.length, end2);
+          for (var i = start2; i < end2; ++i) {
+            ret += String.fromCharCode(buf[i]);
+          }
+          return ret;
+        }
+        function hexSlice(buf, start2, end2) {
+          var len = buf.length;
+          if (!start2 || start2 < 0) start2 = 0;
+          if (!end2 || end2 < 0 || end2 > len) end2 = len;
+          var out = "";
+          for (var i = start2; i < end2; ++i) {
+            out += hexSliceLookupTable[buf[i]];
+          }
+          return out;
+        }
+        function utf16leSlice(buf, start2, end2) {
+          var bytes = buf.slice(start2, end2);
+          var res = "";
+          for (var i = 0; i < bytes.length - 1; i += 2) {
+            res += String.fromCharCode(bytes[i] + bytes[i + 1] * 256);
+          }
+          return res;
+        }
+        Buffer2.prototype.slice = function slice(start2, end2) {
+          var len = this.length;
+          start2 = ~~start2;
+          end2 = end2 === void 0 ? len : ~~end2;
+          if (start2 < 0) {
+            start2 += len;
+            if (start2 < 0) start2 = 0;
+          } else if (start2 > len) {
+            start2 = len;
+          }
+          if (end2 < 0) {
+            end2 += len;
+            if (end2 < 0) end2 = 0;
+          } else if (end2 > len) {
+            end2 = len;
+          }
+          if (end2 < start2) end2 = start2;
+          var newBuf = this.subarray(start2, end2);
+          Object.setPrototypeOf(newBuf, Buffer2.prototype);
+          return newBuf;
+        };
+        function checkOffset(offset, ext, length) {
+          if (offset % 1 !== 0 || offset < 0)
+            throw new RangeError("offset is not uint");
+          if (offset + ext > length)
+            throw new RangeError("Trying to access beyond buffer length");
+        }
+        Buffer2.prototype.readUintLE = Buffer2.prototype.readUIntLE =
+          function readUIntLE(offset, byteLength3, noAssert) {
+            offset = offset >>> 0;
+            byteLength3 = byteLength3 >>> 0;
+            if (!noAssert) checkOffset(offset, byteLength3, this.length);
+            var val = this[offset];
+            var mul = 1;
+            var i = 0;
+            while (++i < byteLength3 && (mul *= 256)) {
+              val += this[offset + i] * mul;
+            }
+            return val;
+          };
+        Buffer2.prototype.readUintBE = Buffer2.prototype.readUIntBE =
+          function readUIntBE(offset, byteLength3, noAssert) {
+            offset = offset >>> 0;
+            byteLength3 = byteLength3 >>> 0;
+            if (!noAssert) {
+              checkOffset(offset, byteLength3, this.length);
+            }
+            var val = this[offset + --byteLength3];
+            var mul = 1;
+            while (byteLength3 > 0 && (mul *= 256)) {
+              val += this[offset + --byteLength3] * mul;
+            }
+            return val;
+          };
+        Buffer2.prototype.readUint8 = Buffer2.prototype.readUInt8 =
+          function readUInt8(offset, noAssert) {
+            offset = offset >>> 0;
+            if (!noAssert) checkOffset(offset, 1, this.length);
+            return this[offset];
+          };
+        Buffer2.prototype.readUint16LE = Buffer2.prototype.readUInt16LE =
+          function readUInt16LE(offset, noAssert) {
+            offset = offset >>> 0;
+            if (!noAssert) checkOffset(offset, 2, this.length);
+            return this[offset] | (this[offset + 1] << 8);
+          };
+        Buffer2.prototype.readUint16BE = Buffer2.prototype.readUInt16BE =
+          function readUInt16BE(offset, noAssert) {
+            offset = offset >>> 0;
+            if (!noAssert) checkOffset(offset, 2, this.length);
+            return (this[offset] << 8) | this[offset + 1];
+          };
+        Buffer2.prototype.readUint32LE = Buffer2.prototype.readUInt32LE =
+          function readUInt32LE(offset, noAssert) {
+            offset = offset >>> 0;
+            if (!noAssert) checkOffset(offset, 4, this.length);
+            return (
+              (this[offset] |
+                (this[offset + 1] << 8) |
+                (this[offset + 2] << 16)) +
+              this[offset + 3] * 16777216
+            );
+          };
+        Buffer2.prototype.readUint32BE = Buffer2.prototype.readUInt32BE =
+          function readUInt32BE(offset, noAssert) {
+            offset = offset >>> 0;
+            if (!noAssert) checkOffset(offset, 4, this.length);
+            return (
+              this[offset] * 16777216 +
+              ((this[offset + 1] << 16) |
+                (this[offset + 2] << 8) |
+                this[offset + 3])
+            );
+          };
+        Buffer2.prototype.readIntLE = function readIntLE(
+          offset,
+          byteLength3,
+          noAssert
+        ) {
+          offset = offset >>> 0;
+          byteLength3 = byteLength3 >>> 0;
+          if (!noAssert) checkOffset(offset, byteLength3, this.length);
+          var val = this[offset];
+          var mul = 1;
+          var i = 0;
+          while (++i < byteLength3 && (mul *= 256)) {
+            val += this[offset + i] * mul;
+          }
+          mul *= 128;
+          if (val >= mul) val -= Math.pow(2, 8 * byteLength3);
+          return val;
+        };
+        Buffer2.prototype.readIntBE = function readIntBE(
+          offset,
+          byteLength3,
+          noAssert
+        ) {
+          offset = offset >>> 0;
+          byteLength3 = byteLength3 >>> 0;
+          if (!noAssert) checkOffset(offset, byteLength3, this.length);
+          var i = byteLength3;
+          var mul = 1;
+          var val = this[offset + --i];
+          while (i > 0 && (mul *= 256)) {
+            val += this[offset + --i] * mul;
+          }
+          mul *= 128;
+          if (val >= mul) val -= Math.pow(2, 8 * byteLength3);
+          return val;
+        };
+        Buffer2.prototype.readInt8 = function readInt8(offset, noAssert) {
+          offset = offset >>> 0;
+          if (!noAssert) checkOffset(offset, 1, this.length);
+          if (!(this[offset] & 128)) return this[offset];
+          return (255 - this[offset] + 1) * -1;
+        };
+        Buffer2.prototype.readInt16LE = function readInt16LE(offset, noAssert) {
+          offset = offset >>> 0;
+          if (!noAssert) checkOffset(offset, 2, this.length);
+          var val = this[offset] | (this[offset + 1] << 8);
+          return val & 32768 ? val | 4294901760 : val;
+        };
+        Buffer2.prototype.readInt16BE = function readInt16BE(offset, noAssert) {
+          offset = offset >>> 0;
+          if (!noAssert) checkOffset(offset, 2, this.length);
+          var val = this[offset + 1] | (this[offset] << 8);
+          return val & 32768 ? val | 4294901760 : val;
+        };
+        Buffer2.prototype.readInt32LE = function readInt32LE(offset, noAssert) {
+          offset = offset >>> 0;
+          if (!noAssert) checkOffset(offset, 4, this.length);
+          return (
+            this[offset] |
+            (this[offset + 1] << 8) |
+            (this[offset + 2] << 16) |
+            (this[offset + 3] << 24)
+          );
+        };
+        Buffer2.prototype.readInt32BE = function readInt32BE(offset, noAssert) {
+          offset = offset >>> 0;
+          if (!noAssert) checkOffset(offset, 4, this.length);
+          return (
+            (this[offset] << 24) |
+            (this[offset + 1] << 16) |
+            (this[offset + 2] << 8) |
+            this[offset + 3]
+          );
+        };
+        Buffer2.prototype.readFloatLE = function readFloatLE(offset, noAssert) {
+          offset = offset >>> 0;
+          if (!noAssert) checkOffset(offset, 4, this.length);
+          return ieee754$1.read(this, offset, true, 23, 4);
+        };
+        Buffer2.prototype.readFloatBE = function readFloatBE(offset, noAssert) {
+          offset = offset >>> 0;
+          if (!noAssert) checkOffset(offset, 4, this.length);
+          return ieee754$1.read(this, offset, false, 23, 4);
+        };
+        Buffer2.prototype.readDoubleLE = function readDoubleLE(
+          offset,
+          noAssert
+        ) {
+          offset = offset >>> 0;
+          if (!noAssert) checkOffset(offset, 8, this.length);
+          return ieee754$1.read(this, offset, true, 52, 8);
+        };
+        Buffer2.prototype.readDoubleBE = function readDoubleBE(
+          offset,
+          noAssert
+        ) {
+          offset = offset >>> 0;
+          if (!noAssert) checkOffset(offset, 8, this.length);
+          return ieee754$1.read(this, offset, false, 52, 8);
+        };
+        function checkInt(buf, value, offset, ext, max, min) {
+          if (!Buffer2.isBuffer(buf))
+            throw new TypeError('"buffer" argument must be a Buffer instance');
+          if (value > max || value < min)
+            throw new RangeError('"value" argument is out of bounds');
+          if (offset + ext > buf.length)
+            throw new RangeError("Index out of range");
+        }
+        Buffer2.prototype.writeUintLE = Buffer2.prototype.writeUIntLE =
+          function writeUIntLE(value, offset, byteLength3, noAssert) {
+            value = +value;
+            offset = offset >>> 0;
+            byteLength3 = byteLength3 >>> 0;
+            if (!noAssert) {
+              var maxBytes = Math.pow(2, 8 * byteLength3) - 1;
+              checkInt(this, value, offset, byteLength3, maxBytes, 0);
+            }
+            var mul = 1;
+            var i = 0;
+            this[offset] = value & 255;
+            while (++i < byteLength3 && (mul *= 256)) {
+              this[offset + i] = (value / mul) & 255;
+            }
+            return offset + byteLength3;
+          };
+        Buffer2.prototype.writeUintBE = Buffer2.prototype.writeUIntBE =
+          function writeUIntBE(value, offset, byteLength3, noAssert) {
+            value = +value;
+            offset = offset >>> 0;
+            byteLength3 = byteLength3 >>> 0;
+            if (!noAssert) {
+              var maxBytes = Math.pow(2, 8 * byteLength3) - 1;
+              checkInt(this, value, offset, byteLength3, maxBytes, 0);
+            }
+            var i = byteLength3 - 1;
+            var mul = 1;
+            this[offset + i] = value & 255;
+            while (--i >= 0 && (mul *= 256)) {
+              this[offset + i] = (value / mul) & 255;
+            }
+            return offset + byteLength3;
+          };
+        Buffer2.prototype.writeUint8 = Buffer2.prototype.writeUInt8 =
+          function writeUInt8(value, offset, noAssert) {
+            value = +value;
+            offset = offset >>> 0;
+            if (!noAssert) checkInt(this, value, offset, 1, 255, 0);
+            this[offset] = value & 255;
+            return offset + 1;
+          };
+        Buffer2.prototype.writeUint16LE = Buffer2.prototype.writeUInt16LE =
+          function writeUInt16LE(value, offset, noAssert) {
+            value = +value;
+            offset = offset >>> 0;
+            if (!noAssert) checkInt(this, value, offset, 2, 65535, 0);
+            this[offset] = value & 255;
+            this[offset + 1] = value >>> 8;
+            return offset + 2;
+          };
+        Buffer2.prototype.writeUint16BE = Buffer2.prototype.writeUInt16BE =
+          function writeUInt16BE(value, offset, noAssert) {
+            value = +value;
+            offset = offset >>> 0;
+            if (!noAssert) checkInt(this, value, offset, 2, 65535, 0);
+            this[offset] = value >>> 8;
+            this[offset + 1] = value & 255;
+            return offset + 2;
+          };
+        Buffer2.prototype.writeUint32LE = Buffer2.prototype.writeUInt32LE =
+          function writeUInt32LE(value, offset, noAssert) {
+            value = +value;
+            offset = offset >>> 0;
+            if (!noAssert) checkInt(this, value, offset, 4, 4294967295, 0);
+            this[offset + 3] = value >>> 24;
+            this[offset + 2] = value >>> 16;
+            this[offset + 1] = value >>> 8;
+            this[offset] = value & 255;
+            return offset + 4;
+          };
+        Buffer2.prototype.writeUint32BE = Buffer2.prototype.writeUInt32BE =
+          function writeUInt32BE(value, offset, noAssert) {
+            value = +value;
+            offset = offset >>> 0;
+            if (!noAssert) checkInt(this, value, offset, 4, 4294967295, 0);
+            this[offset] = value >>> 24;
+            this[offset + 1] = value >>> 16;
+            this[offset + 2] = value >>> 8;
+            this[offset + 3] = value & 255;
+            return offset + 4;
+          };
+        Buffer2.prototype.writeIntLE = function writeIntLE(
+          value,
+          offset,
+          byteLength3,
+          noAssert
+        ) {
+          value = +value;
+          offset = offset >>> 0;
+          if (!noAssert) {
+            var limit = Math.pow(2, 8 * byteLength3 - 1);
+            checkInt(this, value, offset, byteLength3, limit - 1, -limit);
+          }
+          var i = 0;
+          var mul = 1;
+          var sub2 = 0;
+          this[offset] = value & 255;
+          while (++i < byteLength3 && (mul *= 256)) {
+            if (value < 0 && sub2 === 0 && this[offset + i - 1] !== 0) {
+              sub2 = 1;
+            }
+            this[offset + i] = (((value / mul) >> 0) - sub2) & 255;
+          }
+          return offset + byteLength3;
+        };
+        Buffer2.prototype.writeIntBE = function writeIntBE(
+          value,
+          offset,
+          byteLength3,
+          noAssert
+        ) {
+          value = +value;
+          offset = offset >>> 0;
+          if (!noAssert) {
+            var limit = Math.pow(2, 8 * byteLength3 - 1);
+            checkInt(this, value, offset, byteLength3, limit - 1, -limit);
+          }
+          var i = byteLength3 - 1;
+          var mul = 1;
+          var sub2 = 0;
+          this[offset + i] = value & 255;
+          while (--i >= 0 && (mul *= 256)) {
+            if (value < 0 && sub2 === 0 && this[offset + i + 1] !== 0) {
+              sub2 = 1;
+            }
+            this[offset + i] = (((value / mul) >> 0) - sub2) & 255;
+          }
+          return offset + byteLength3;
+        };
+        Buffer2.prototype.writeInt8 = function writeInt8(
+          value,
+          offset,
+          noAssert
+        ) {
+          value = +value;
+          offset = offset >>> 0;
+          if (!noAssert) checkInt(this, value, offset, 1, 127, -128);
+          if (value < 0) value = 255 + value + 1;
+          this[offset] = value & 255;
+          return offset + 1;
+        };
+        Buffer2.prototype.writeInt16LE = function writeInt16LE(
+          value,
+          offset,
+          noAssert
+        ) {
+          value = +value;
+          offset = offset >>> 0;
+          if (!noAssert) checkInt(this, value, offset, 2, 32767, -32768);
+          this[offset] = value & 255;
+          this[offset + 1] = value >>> 8;
+          return offset + 2;
+        };
+        Buffer2.prototype.writeInt16BE = function writeInt16BE(
+          value,
+          offset,
+          noAssert
+        ) {
+          value = +value;
+          offset = offset >>> 0;
+          if (!noAssert) checkInt(this, value, offset, 2, 32767, -32768);
+          this[offset] = value >>> 8;
+          this[offset + 1] = value & 255;
+          return offset + 2;
+        };
+        Buffer2.prototype.writeInt32LE = function writeInt32LE(
+          value,
+          offset,
+          noAssert
+        ) {
+          value = +value;
+          offset = offset >>> 0;
+          if (!noAssert)
+            checkInt(this, value, offset, 4, 2147483647, -2147483648);
+          this[offset] = value & 255;
+          this[offset + 1] = value >>> 8;
+          this[offset + 2] = value >>> 16;
+          this[offset + 3] = value >>> 24;
+          return offset + 4;
+        };
+        Buffer2.prototype.writeInt32BE = function writeInt32BE(
+          value,
+          offset,
+          noAssert
+        ) {
+          value = +value;
+          offset = offset >>> 0;
+          if (!noAssert)
+            checkInt(this, value, offset, 4, 2147483647, -2147483648);
+          if (value < 0) value = 4294967295 + value + 1;
+          this[offset] = value >>> 24;
+          this[offset + 1] = value >>> 16;
+          this[offset + 2] = value >>> 8;
+          this[offset + 3] = value & 255;
+          return offset + 4;
+        };
+        function checkIEEE754(buf, value, offset, ext, max, min) {
+          if (offset + ext > buf.length)
+            throw new RangeError("Index out of range");
+          if (offset < 0) throw new RangeError("Index out of range");
+        }
+        function writeFloat(buf, value, offset, littleEndian, noAssert) {
+          value = +value;
+          offset = offset >>> 0;
+          if (!noAssert) {
+            checkIEEE754(buf, value, offset, 4);
+          }
+          ieee754$1.write(buf, value, offset, littleEndian, 23, 4);
+          return offset + 4;
+        }
+        Buffer2.prototype.writeFloatLE = function writeFloatLE(
+          value,
+          offset,
+          noAssert
+        ) {
+          return writeFloat(this, value, offset, true, noAssert);
+        };
+        Buffer2.prototype.writeFloatBE = function writeFloatBE(
+          value,
+          offset,
+          noAssert
+        ) {
+          return writeFloat(this, value, offset, false, noAssert);
+        };
+        function writeDouble(buf, value, offset, littleEndian, noAssert) {
+          value = +value;
+          offset = offset >>> 0;
+          if (!noAssert) {
+            checkIEEE754(buf, value, offset, 8);
+          }
+          ieee754$1.write(buf, value, offset, littleEndian, 52, 8);
+          return offset + 8;
+        }
+        Buffer2.prototype.writeDoubleLE = function writeDoubleLE(
+          value,
+          offset,
+          noAssert
+        ) {
+          return writeDouble(this, value, offset, true, noAssert);
+        };
+        Buffer2.prototype.writeDoubleBE = function writeDoubleBE(
+          value,
+          offset,
+          noAssert
+        ) {
+          return writeDouble(this, value, offset, false, noAssert);
+        };
+        Buffer2.prototype.copy = function copy2(
+          target2,
+          targetStart,
+          start2,
+          end2
+        ) {
+          if (!Buffer2.isBuffer(target2))
+            throw new TypeError("argument should be a Buffer");
+          if (!start2) start2 = 0;
+          if (!end2 && end2 !== 0) end2 = this.length;
+          if (targetStart >= target2.length) targetStart = target2.length;
+          if (!targetStart) targetStart = 0;
+          if (end2 > 0 && end2 < start2) end2 = start2;
+          if (end2 === start2) return 0;
+          if (target2.length === 0 || this.length === 0) return 0;
+          if (targetStart < 0) {
+            throw new RangeError("targetStart out of bounds");
+          }
+          if (start2 < 0 || start2 >= this.length)
+            throw new RangeError("Index out of range");
+          if (end2 < 0) throw new RangeError("sourceEnd out of bounds");
+          if (end2 > this.length) end2 = this.length;
+          if (target2.length - targetStart < end2 - start2) {
+            end2 = target2.length - targetStart + start2;
+          }
+          var len = end2 - start2;
+          if (
+            this === target2 &&
+            typeof Uint8Array.prototype.copyWithin === "function"
+          ) {
+            this.copyWithin(targetStart, start2, end2);
+          } else {
+            Uint8Array.prototype.set.call(
+              target2,
+              this.subarray(start2, end2),
+              targetStart
+            );
+          }
+          return len;
+        };
+        Buffer2.prototype.fill = function fill(val, start2, end2, encoding) {
+          if (typeof val === "string") {
+            if (typeof start2 === "string") {
+              encoding = start2;
+              start2 = 0;
+              end2 = this.length;
+            } else if (typeof end2 === "string") {
+              encoding = end2;
+              end2 = this.length;
+            }
+            if (encoding !== void 0 && typeof encoding !== "string") {
+              throw new TypeError("encoding must be a string");
+            }
+            if (typeof encoding === "string" && !Buffer2.isEncoding(encoding)) {
+              throw new TypeError("Unknown encoding: " + encoding);
+            }
+            if (val.length === 1) {
+              var code3 = val.charCodeAt(0);
+              if (
+                (encoding === "utf8" && code3 < 128) ||
+                encoding === "latin1"
+              ) {
+                val = code3;
+              }
+            }
+          } else if (typeof val === "number") {
+            val = val & 255;
+          } else if (typeof val === "boolean") {
+            val = Number(val);
+          }
+          if (start2 < 0 || this.length < start2 || this.length < end2) {
+            throw new RangeError("Out of range index");
+          }
+          if (end2 <= start2) {
+            return this;
+          }
+          start2 = start2 >>> 0;
+          end2 = end2 === void 0 ? this.length : end2 >>> 0;
+          if (!val) val = 0;
+          var i;
+          if (typeof val === "number") {
+            for (i = start2; i < end2; ++i) {
+              this[i] = val;
+            }
+          } else {
+            var bytes = Buffer2.isBuffer(val)
+              ? val
+              : Buffer2.from(val, encoding);
+            var len = bytes.length;
+            if (len === 0) {
+              throw new TypeError(
+                'The value "' + val + '" is invalid for argument "value"'
+              );
+            }
+            for (i = 0; i < end2 - start2; ++i) {
+              this[i + start2] = bytes[i % len];
+            }
+          }
+          return this;
+        };
+        var INVALID_BASE64_RE = /[^+/0-9A-Za-z-_]/g;
+        function base64clean(str) {
+          str = str.split("=")[0];
+          str = str.trim().replace(INVALID_BASE64_RE, "");
+          if (str.length < 2) return "";
+          while (str.length % 4 !== 0) {
+            str = str + "=";
+          }
+          return str;
+        }
+        function utf8ToBytes(string2, units) {
+          units = units || Infinity;
+          var codePoint;
+          var length = string2.length;
+          var leadSurrogate = null;
+          var bytes = [];
+          for (var i = 0; i < length; ++i) {
+            codePoint = string2.charCodeAt(i);
+            if (codePoint > 55295 && codePoint < 57344) {
+              if (!leadSurrogate) {
+                if (codePoint > 56319) {
+                  if ((units -= 3) > -1) bytes.push(239, 191, 189);
+                  continue;
+                } else if (i + 1 === length) {
+                  if ((units -= 3) > -1) bytes.push(239, 191, 189);
+                  continue;
+                }
+                leadSurrogate = codePoint;
+                continue;
+              }
+              if (codePoint < 56320) {
+                if ((units -= 3) > -1) bytes.push(239, 191, 189);
+                leadSurrogate = codePoint;
+                continue;
+              }
+              codePoint =
+                (((leadSurrogate - 55296) << 10) | (codePoint - 56320)) + 65536;
+            } else if (leadSurrogate) {
+              if ((units -= 3) > -1) bytes.push(239, 191, 189);
+            }
+            leadSurrogate = null;
+            if (codePoint < 128) {
+              if ((units -= 1) < 0) break;
+              bytes.push(codePoint);
+            } else if (codePoint < 2048) {
+              if ((units -= 2) < 0) break;
+              bytes.push((codePoint >> 6) | 192, (codePoint & 63) | 128);
+            } else if (codePoint < 65536) {
+              if ((units -= 3) < 0) break;
+              bytes.push(
+                (codePoint >> 12) | 224,
+                ((codePoint >> 6) & 63) | 128,
+                (codePoint & 63) | 128
+              );
+            } else if (codePoint < 1114112) {
+              if ((units -= 4) < 0) break;
+              bytes.push(
+                (codePoint >> 18) | 240,
+                ((codePoint >> 12) & 63) | 128,
+                ((codePoint >> 6) & 63) | 128,
+                (codePoint & 63) | 128
+              );
+            } else {
+              throw new Error("Invalid code point");
+            }
+          }
+          return bytes;
+        }
+        function asciiToBytes(str) {
+          var byteArray = [];
+          for (var i = 0; i < str.length; ++i) {
+            byteArray.push(str.charCodeAt(i) & 255);
+          }
+          return byteArray;
+        }
+        function utf16leToBytes(str, units) {
+          var c, hi2, lo;
+          var byteArray = [];
+          for (var i = 0; i < str.length; ++i) {
+            if ((units -= 2) < 0) break;
+            c = str.charCodeAt(i);
+            hi2 = c >> 8;
+            lo = c % 256;
+            byteArray.push(lo);
+            byteArray.push(hi2);
+          }
+          return byteArray;
+        }
+        function base64ToBytes(str) {
+          return base64.toByteArray(base64clean(str));
+        }
+        function blitBuffer(src, dst, offset, length) {
+          for (var i = 0; i < length; ++i) {
+            if (i + offset >= dst.length || i >= src.length) break;
+            dst[i + offset] = src[i];
+          }
+          return i;
+        }
+        function isInstance(obj, type2) {
+          return (
+            obj instanceof type2 ||
+            (obj != null &&
+              obj.constructor != null &&
+              obj.constructor.name != null &&
+              obj.constructor.name === type2.name)
+          );
+        }
+        function numberIsNaN(obj) {
+          return obj !== obj;
+        }
+        var hexSliceLookupTable = (function () {
+          var alphabet = "0123456789abcdef";
+          var table3 = new Array(256);
+          for (var i = 0; i < 16; ++i) {
+            var i16 = i * 16;
+            for (var j = 0; j < 16; ++j) {
+              table3[i16 + j] = alphabet[i] + alphabet[j];
+            }
+          }
+          return table3;
+        })();
+      })(buffer);
+      const { Buffer: Buffer$1 } = buffer;
+      function syncFetch(...args) {
+        const [url, opts] = parseArgs(...args);
+        const xhr = new XMLHttpRequest();
+        xhr.withCredentials = opts.credentials === "include";
+        xhr.timeout = opts.timeout;
+        xhr.open(opts.method || "GET", url, false);
+        try {
+          xhr.responseType = "arraybuffer";
+        } catch (e) {}
+        for (const header of opts.headers) {
+          xhr.setRequestHeader(...header);
+        }
+        xhr.send(opts.body || null);
+        let headers = xhr.getAllResponseHeaders();
+        headers =
+          headers &&
+          headers
+            .split("\r\n")
+            .filter(Boolean)
+            .map((header) => header.split(": ", 2));
+        return new syncFetch.Response(xhr.response, {
+          url: xhr.responseURL,
+          status: xhr.status,
+          statusText: xhr.statusText,
+          headers,
+          redirected: xhr.responseURL !== url,
+        });
+      }
+      function parseArgs(resource, init) {
+        const request = [];
+        if (resource instanceof syncFetch.Request) {
+          request.push(resource.url);
+          request.push({
+            method: resource.method,
+            headers: resource.headers,
+            body: resource.body,
+          });
+        } else {
+          request.push(resource, {});
+        }
+        Object.assign(request[1], init);
+        request[1].headers = new syncFetch.Headers(request[1].headers || {});
+        return request;
+      }
+      const INTERNALS = Symbol("SyncFetch Internals");
+      class SyncRequest extends Request {
+        constructor(resource, init = {}, body = init.body) {
+          super(resource, init);
+          this[INTERNALS] = {
+            body: body ? Buffer$1.from(body) : null,
+          };
+        }
+        clone() {
+          checkBody(this);
+          return new SyncRequest(this.url, this);
+        }
+      }
+      class SyncResponse extends Response {
+        constructor(body, init = {}) {
+          body = body ? Buffer$1.from(body) : null;
+          super(createStream(body), init);
+          this[INTERNALS] = {
+            url: init.url,
+            redirected: init.redirected,
+            body,
+          };
+        }
+        get url() {
+          return this[INTERNALS].url;
+        }
+        get redirected() {
+          return this[INTERNALS].redirected;
+        }
+        clone() {
+          checkBody(this);
+          return new SyncResponse(this[INTERNALS].body, {
+            url: this.url,
+            headers: this.headers,
+            status: this.status,
+            statusText: this.statusText,
+            redirected: this.redirected,
+          });
+        }
+      }
+      class Body {
+        constructor(body) {
+          this[INTERNALS] = {
+            body: Buffer$1.from(body),
+          };
+        }
+        static mixin(prototype) {
+          for (const name2 of Object.getOwnPropertyNames(Body.prototype)) {
+            if (name2 === "constructor") {
+              continue;
+            }
+            const desc = Object.getOwnPropertyDescriptor(Body.prototype, name2);
+            Object.defineProperty(
+              prototype,
+              name2,
+              __spreadProps(__spreadValues({}, desc), { enumerable: true })
+            );
+          }
+        }
+        arrayBuffer() {
+          checkBody(this);
+          const buffer2 = consumeBody(this);
+          return buffer2.buffer.slice(
+            buffer2.byteOffset,
+            buffer2.byteOffset + buffer2.byteLength
+          );
+        }
+        blob() {
+          checkBody(this);
+          const type2 = this.headers && this.headers.get("content-type");
+          return new Blob([consumeBody(this)], type2 && { type: type2 });
+        }
+        text() {
+          checkBody(this);
+          return consumeBody(this).toString();
+        }
+        json() {
+          checkBody(this);
+          try {
+            return JSON.parse(consumeBody(this).toString());
+          } catch (err) {
+            throw new TypeError(
+              `invalid json response body at ${this.url} reason: ${err.message}`,
+              "invalid-json"
+            );
+          }
+        }
+        buffer() {
+          checkBody(this);
+          return consumeBody(this).clone();
+        }
+      }
+      function checkBody(body) {
+        if (body.bodyUsed) {
+          throw new TypeError(`body used already for: ${body.url}`);
+        }
+      }
+      function consumeBody(body) {
+        _super(body, "arrayBuffer")();
+        return body[INTERNALS].body || Buffer$1.alloc(0);
+      }
+      function _super(self2, method) {
+        return Object.getPrototypeOf(Object.getPrototypeOf(self2))[method].bind(
+          self2
+        );
+      }
+      function createStream(body) {
+        return new ReadableStream({
+          start(controller) {
+            controller.enqueue(body);
+            controller.close();
+          },
+        });
+      }
+      Body.mixin(SyncRequest.prototype);
+      Body.mixin(SyncResponse.prototype);
+      syncFetch.Headers = self.Headers;
+      syncFetch.Request = SyncRequest;
+      syncFetch.Response = SyncResponse;
+      var browser = syncFetch;
+      const separator$1 = "\r\n\r\n";
+      async function* generate$1(stream, boundary, options) {
+        const len_boundary = Buffer.byteLength(boundary),
+          is_eager = !options || !options.multiple;
+        let buffer2 = Buffer.alloc(0),
+          is_preamble = true,
+          payloads = [];
+        outer: for await (const chunk of stream) {
+          let idx_boundary = buffer2.byteLength;
+          buffer2 = Buffer.concat([buffer2, chunk]);
+          const idx_chunk = chunk.indexOf(boundary);
+          if (!!~idx_chunk) {
+            idx_boundary += idx_chunk;
+          } else {
+            idx_boundary = buffer2.indexOf(boundary);
+          }
+          payloads = [];
+          while (!!~idx_boundary) {
+            const current = buffer2.slice(0, idx_boundary);
+            const next = buffer2.slice(idx_boundary + len_boundary);
+            if (is_preamble) {
+              is_preamble = false;
+            } else {
+              const headers = {};
+              const idx_headers = current.indexOf(separator$1);
+              const arr_headers = buffer2
+                .slice(0, idx_headers)
+                .toString()
+                .trim()
+                .split(/\r\n/);
+              let tmp;
+              while ((tmp = arr_headers.shift())) {
+                tmp = tmp.split(": ");
+                headers[tmp.shift().toLowerCase()] = tmp.join(": ");
+              }
+              let body = current.slice(
+                idx_headers + separator$1.length,
+                current.lastIndexOf("\r\n")
+              );
+              let is_json = false;
+              tmp = headers["content-type"];
+              if (tmp && !!~tmp.indexOf("application/json")) {
+                try {
+                  body = JSON.parse(body.toString());
+                  is_json = true;
+                } catch (_) {}
+              }
+              tmp = { headers, body, json: is_json };
+              is_eager ? yield tmp : payloads.push(tmp);
+              if (next.slice(0, 2).toString() === "--") break outer;
+            }
+            buffer2 = next;
+            idx_boundary = buffer2.indexOf(boundary);
+          }
+          if (payloads.length) yield payloads;
+        }
+        if (payloads.length) yield payloads;
+      }
+      async function meros$1(response, options) {
+        const ctype = response.headers["content-type"];
+        if (!ctype || !~ctype.indexOf("multipart/mixed")) return response;
+        const idx_boundary = ctype.indexOf("boundary=");
+        return generate$1(
+          response,
+          `--${
+            !!~idx_boundary
+              ? ctype
+                  .substring(idx_boundary + 9)
+                  .trim()
+                  .replace(/['"]/g, "")
+              : "-"
+          }`,
+          options
+        );
+      }
+      const separator = "\r\n\r\n";
+      const decoder = new TextDecoder();
+      async function* generate(stream, boundary, options) {
+        const reader = stream.getReader(),
+          is_eager = !options || !options.multiple;
+        let buffer2 = "",
+          is_preamble = true,
+          payloads = [];
+        try {
+          let result2;
+          outer: while (!(result2 = await reader.read()).done) {
+            const chunk = decoder.decode(result2.value);
+            const idx_chunk = chunk.indexOf(boundary);
+            let idx_boundary = buffer2.length;
+            buffer2 += chunk;
+            if (!!~idx_chunk) {
+              idx_boundary += idx_chunk;
+            } else {
+              idx_boundary = buffer2.indexOf(boundary);
+            }
+            payloads = [];
+            while (!!~idx_boundary) {
+              const current = buffer2.substring(0, idx_boundary);
+              const next = buffer2.substring(idx_boundary + boundary.length);
+              if (is_preamble) {
+                is_preamble = false;
+              } else {
+                const headers = {};
+                const idx_headers = current.indexOf(separator);
+                const arr_headers = buffer2
+                  .slice(0, idx_headers)
+                  .toString()
+                  .trim()
+                  .split(/\r\n/);
+                let tmp;
+                while ((tmp = arr_headers.shift())) {
+                  tmp = tmp.split(": ");
+                  headers[tmp.shift().toLowerCase()] = tmp.join(": ");
+                }
+                let body = current.substring(
+                  idx_headers + separator.length,
+                  current.lastIndexOf("\r\n")
+                );
+                let is_json = false;
+                tmp = headers["content-type"];
+                if (tmp && !!~tmp.indexOf("application/json")) {
+                  try {
+                    body = JSON.parse(body);
+                    is_json = true;
+                  } catch (_) {}
+                }
+                tmp = { headers, body, json: is_json };
+                is_eager ? yield tmp : payloads.push(tmp);
+                if (next.substring(0, 2) === "--") break outer;
+              }
+              buffer2 = next;
+              idx_boundary = buffer2.indexOf(boundary);
+            }
+            if (payloads.length) yield payloads;
+          }
+        } finally {
+          if (payloads.length) yield payloads;
+          reader.releaseLock();
+        }
+      }
+      async function meros(response, options) {
+        if (!response.ok || !response.body || response.bodyUsed)
+          return response;
+        const ctype = response.headers.get("content-type");
+        if (!ctype || !~ctype.indexOf("multipart/mixed")) return response;
+        const idx_boundary = ctype.indexOf("boundary=");
+        return generate(
+          response.body,
+          `--${
+            !!~idx_boundary
+              ? ctype
+                  .substring(idx_boundary + 9)
+                  .trim()
+                  .replace(/['"]/g, "")
+              : "-"
+          }`,
+          options
+        );
+      }
+      function merge(a, b, k) {
+        if (typeof a === "object" && typeof b === "object") {
+          if (Array.isArray(a) && Array.isArray(b)) {
+            for (k = 0; k < b.length; k++) {
+              a[k] = merge(a[k], b[k]);
+            }
+          } else {
+            for (k in b) {
+              a[k] = merge(a[k], b[k]);
+            }
+          }
+          return a;
+        }
+        return b;
+      }
+      function dset(obj, keys, val) {
+        keys.split && (keys = keys.split("."));
+        var i = 0,
+          l2 = keys.length,
+          t2 = obj,
+          x2,
+          k;
+        while (i < l2) {
+          k = keys[i++];
+          if (k === "__proto__" || k === "constructor" || k === "prototype")
+            break;
+          t2 = t2[k] =
+            i === l2
+              ? merge(t2[k], val)
+              : typeof (x2 = t2[k]) === typeof keys
+              ? x2
+              : keys[i] * 0 !== 0 || !!~("" + keys[i]).indexOf(".")
+              ? {}
+              : [];
+        }
+      }
+      const defaultAsyncFetch = async (input, init) => {
+        return fetch$1(input, init);
+      };
+      const defaultSyncFetch = (input, init) => {
+        if (typeof input === "string") {
+          init === null || init === void 0 ? true : delete init.signal;
+        } else {
+          delete input.signal;
+        }
+        return browser(input, init);
+      };
+      function isIncomingMessage(body) {
+        return body != null && typeof body === "object" && "pipe" in body;
+      }
+      async function handleMultipartMixedResponse(response) {
+        const body = await response.body;
+        const contentType = response.headers.get("content-type") || "";
+        let asyncIterator;
+        if (isIncomingMessage(body)) {
+          body.headers = {
+            "content-type": contentType,
+          };
+          asyncIterator = await meros$1(body);
+        } else {
+          asyncIterator = await meros(response);
+        }
+        const executionResult = {};
+        return mapAsyncIterator(asyncIterator, (part2) => {
+          if (part2.json) {
+            const chunk = part2.body;
+            if (chunk.path) {
+              if (chunk.data) {
+                const path = ["data"];
+                dset(executionResult, path.concat(chunk.path), chunk.data);
+              }
+              if (chunk.errors) {
+                executionResult.errors = (executionResult.errors || []).concat(
+                  chunk.errors
+                );
+              }
+            } else {
+              if (chunk.data) {
+                executionResult.data = chunk.data;
+              }
+              if (chunk.errors) {
+                executionResult.errors = chunk.errors;
+              }
+            }
+            return executionResult;
+          }
+        });
+      }
+      async function* handleReadable(readable) {
+        const decoder2 = new TextDecoder();
+        outer: for await (const chunk of readable) {
+          const chunkStr =
+            typeof chunk === "string" ? chunk : decoder2.decode(chunk);
+          for (const part2 of chunkStr.split("\n\n")) {
+            if (part2) {
+              const eventStr = part2.split("event: ")[1];
+              const dataStr = part2.split("data: ")[1];
+              if (eventStr === "complete") {
+                break outer;
+              }
+              if (dataStr) {
+                const data = JSON.parse(dataStr);
+                yield data.payload || data;
+              }
+            }
+          }
+        }
+      }
+      async function* handleReadableStream(stream) {
+        const decoder2 = new TextDecoder();
+        const reader = stream.getReader();
+        let buffer2;
+        let position = 0;
+        let fieldLength = -1;
+        let discardTrailingNewline = false;
+        try {
+          let result2;
+          let message = {
+            data: "",
+            event: "",
+            id: "",
+            retry: void 0,
+          };
+          while (!(result2 = await reader.read()).done) {
+            const arr = result2.value;
+            if (buffer2 === void 0) {
+              buffer2 = arr;
+              position = 0;
+              fieldLength = -1;
+            } else {
+              buffer2 = concat(buffer2, arr);
+            }
+            const bufLength = buffer2.length;
+            let lineStart = 0;
+            while (position < bufLength) {
+              if (discardTrailingNewline) {
+                if (buffer2[position] === 10) {
+                  lineStart = ++position;
+                }
+                discardTrailingNewline = false;
+              }
+              let lineEnd = -1;
+              for (; position < bufLength && lineEnd === -1; ++position) {
+                switch (buffer2[position]) {
+                  case 58: {
+                    if (fieldLength === -1) {
+                      fieldLength = position - lineStart;
+                    }
+                    break;
+                  }
+                  case 13: {
+                    discardTrailingNewline = true;
+                    break;
+                  }
+                  case 10: {
+                    lineEnd = position;
+                    break;
+                  }
+                }
+              }
+              if (lineEnd === -1) {
+                break;
+              }
+              const line = buffer2.subarray(lineStart, lineEnd);
+              if (line.length === 0) {
+                if (message.event || message.data) {
+                  yield JSON.parse(message.data);
+                  message = {
+                    data: "",
+                    event: "",
+                    id: "",
+                    retry: void 0,
+                  };
+                }
+              } else if (fieldLength > 0) {
+                const field = decoder2.decode(line.subarray(0, fieldLength));
+                const valueOffset =
+                  fieldLength + (line[fieldLength + 1] === 32 ? 2 : 1);
+                const value = decoder2.decode(line.subarray(valueOffset));
+                switch (field) {
+                  case "data":
+                    message.data = message.data
+                      ? message.data + "\n" + value
+                      : value;
+                    break;
+                  case "event":
+                    message.event = value;
+                    break;
+                  case "id":
+                    message.id = value;
+                    break;
+                  case "retry": {
+                    const retry = parseInt(value, 10);
+                    message.retry = retry;
+                    break;
+                  }
+                }
+              }
+              lineStart = position;
+              fieldLength = -1;
+            }
+            if (lineStart === bufLength) {
+              buffer2 = void 0;
+            } else if (lineStart !== 0) {
+              buffer2 = buffer2.subarray(lineStart);
+              position -= lineStart;
+            }
+          }
+        } finally {
+          reader.releaseLock();
+        }
+      }
+      function concat(a, b) {
+        const res = new Uint8Array(a.length + b.length);
+        res.set(a);
+        res.set(b, a.length);
+        return res;
+      }
+      async function handleEventStreamResponse(response) {
+        const body = await response.body;
+        if (body) {
+          if (isAsyncIterable$1(body)) {
+            return handleReadable(body);
+          }
+          return handleReadableStream(body);
+        }
+        throw new Error(
+          "Response body is expected to be a readable stream but got; " +
+            inspect$1(body)
+        );
+      }
+      function addCancelToResponseStream(resultStream, controller) {
+        return getAsyncIterableWithCancel(resultStream, () => {
+          if (!controller.signal.aborted) {
+            controller.abort();
+          }
+        });
+      }
+      function isBlob(obj) {
+        return typeof obj.arrayBuffer === "function";
+      }
+      function isGraphQLUpload(upload) {
+        return typeof upload.createReadStream === "function";
+      }
+      function isPromiseLike(obj) {
+        return typeof obj.then === "function";
+      }
+      const asyncImport = (moduleName) => import(moduleName);
+      const syncImport = (moduleName) => require(moduleName);
+      var SubscriptionProtocol;
+      (function (SubscriptionProtocol2) {
+        SubscriptionProtocol2["WS"] = "WS";
+        SubscriptionProtocol2["LEGACY_WS"] = "LEGACY_WS";
+        SubscriptionProtocol2["SSE"] = "SSE";
+        SubscriptionProtocol2["GRAPHQL_SSE"] = "GRAPHQL_SSE";
+      })(SubscriptionProtocol || (SubscriptionProtocol = {}));
+      function isCompatibleUri(uri) {
+        try {
+          new URL(uri);
+          return true;
+        } catch (_a2) {
+          return false;
+        }
+      }
+      class UrlLoader {
+        createFormDataFromVariables({
+          query,
+          variables,
+          operationName,
+          extensions,
+        }) {
+          const vars = Object.assign({}, variables);
+          const { clone, files } = extractFiles$1(
+            vars,
+            "variables",
+            (v2) =>
+              isExtractableFile$1(v2) ||
+              (v2 === null || v2 === void 0 ? void 0 : v2.promise) ||
+              isAsyncIterable$1(v2) ||
+              (v2 === null || v2 === void 0 ? void 0 : v2.then) ||
+              typeof (v2 === null || v2 === void 0
+                ? void 0
+                : v2.arrayBuffer) === "function"
+          );
+          const map2 = {};
+          const uploads = [];
+          let currIndex = 0;
+          for (const [file, curr] of files) {
+            map2[currIndex] = curr;
+            uploads[currIndex] = file;
+            currIndex++;
+          }
+          const form = new FormData();
+          form.append(
+            "operations",
+            JSON.stringify({
+              query,
+              variables: clone,
+              operationName,
+              extensions,
+            })
+          );
+          form.append("map", JSON.stringify(map2));
+          function handleUpload(upload, i) {
+            const indexStr = i.toString();
+            if (upload != null) {
+              const filename =
+                upload.filename ||
+                upload.name ||
+                upload.path ||
+                `blob-${indexStr}`;
+              if (isPromiseLike(upload)) {
+                return upload.then((resolvedUpload) =>
+                  handleUpload(resolvedUpload, i)
+                );
+              } else if (isBlob(upload)) {
+                return upload.arrayBuffer().then((arrayBuffer) => {
+                  form.append(
+                    indexStr,
+                    new File$1([arrayBuffer], filename, { type: upload.type }),
+                    filename
+                  );
+                });
+              } else if (isGraphQLUpload(upload)) {
+                const stream = upload.createReadStream();
+                const chunks = [];
+                return Promise.resolve().then(async () => {
+                  for await (const chunk of stream) {
+                    if (chunk) {
+                      chunks.push(...chunk);
+                    }
+                  }
+                  const blobPart = new Uint8Array(chunks);
+                  form.append(
+                    indexStr,
+                    new File$1([blobPart], filename, { type: upload.mimetype }),
+                    filename
+                  );
+                });
+              } else {
+                form.append(indexStr, new File$1([upload], filename), filename);
+              }
+            }
+          }
+          return ValueOrPromise.all(
+            uploads.map(
+              (upload, i) => new ValueOrPromise(() => handleUpload(upload, i))
+            )
+          )
+            .then(() => form)
+            .resolve();
+        }
+        prepareGETUrl({
+          baseUrl,
+          query,
+          variables,
+          operationName,
+          extensions,
+        }) {
+          const HTTP_URL = switchProtocols(baseUrl, {
+            wss: "https",
+            ws: "http",
+          });
+          const dummyHostname = "https://dummyhostname.com";
+          const validUrl = HTTP_URL.startsWith("http")
+            ? HTTP_URL
+            : HTTP_URL.startsWith("/")
+            ? `${dummyHostname}${HTTP_URL}`
+            : `${dummyHostname}/${HTTP_URL}`;
+          const urlObj = new URL(validUrl);
+          urlObj.searchParams.set("query", query);
+          if (variables && Object.keys(variables).length > 0) {
+            urlObj.searchParams.set("variables", JSON.stringify(variables));
+          }
+          if (operationName) {
+            urlObj.searchParams.set("operationName", operationName);
+          }
+          if (extensions) {
+            urlObj.searchParams.set("extensions", JSON.stringify(extensions));
+          }
+          const finalUrl = urlObj.toString().replace(dummyHostname, "");
+          return finalUrl;
+        }
+        buildHTTPExecutor(initialEndpoint, fetch2, options) {
+          const defaultMethod = this.getDefaultMethodFromOptions(
+            options === null || options === void 0 ? void 0 : options.method,
+            "POST"
+          );
+          const HTTP_URL = switchProtocols(initialEndpoint, {
+            wss: "https",
+            ws: "http",
+          });
+          const executor = (request) => {
+            var _a2, _b;
+            const controller = new AbortController$1();
+            let method = defaultMethod;
+            if (
+              options === null || options === void 0
+                ? void 0
+                : options.useGETForQueries
+            ) {
+              const operationAst = getOperationASTFromRequest(request);
+              const operationType = operationAst.operation;
+              if (operationType === "query") {
+                method = "GET";
+              }
+            }
+            const endpoint =
+              ((_a2 = request.extensions) === null || _a2 === void 0
+                ? void 0
+                : _a2.endpoint) || HTTP_URL;
+            const headers = Object.assign(
+              {},
+              options === null || options === void 0 ? void 0 : options.headers,
+              ((_b = request.extensions) === null || _b === void 0
+                ? void 0
+                : _b.headers) || {}
+            );
+            const acceptedProtocols = [`application/json`];
+            if (
+              method === "GET" &&
+              (options === null || options === void 0
+                ? void 0
+                : options.subscriptionsProtocol) === SubscriptionProtocol.SSE
+            ) {
+              acceptedProtocols.push("text/event-stream");
+            } else {
+              acceptedProtocols.push("multipart/mixed");
+            }
+            const accept = acceptedProtocols.join(", ");
+            const query = print(request.document);
+            const requestBody = {
+              query,
+              variables: request.variables,
+              operationName: request.operationName,
+              extensions: request.extensions,
+            };
+            let timeoutId;
+            if (
+              options === null || options === void 0 ? void 0 : options.timeout
+            ) {
+              timeoutId = setTimeout(() => {
+                if (!controller.signal.aborted) {
+                  controller.abort();
+                }
+              }, options.timeout);
+            }
+            const credentials =
+              (options === null || options === void 0
+                ? void 0
+                : options.credentials) || "same-origin";
+            return new ValueOrPromise(() => {
+              switch (method) {
+                case "GET":
+                  const finalUrl = this.prepareGETUrl(
+                    __spreadValues(
+                      {
+                        baseUrl: endpoint,
+                      },
+                      requestBody
+                    )
+                  );
+                  return fetch2(finalUrl, {
+                    method: "GET",
+                    credentials,
+                    headers: __spreadValues(
+                      {
+                        accept,
+                      },
+                      headers
+                    ),
+                    signal: controller.signal,
+                  });
+                case "POST":
+                  if (
+                    options === null || options === void 0
+                      ? void 0
+                      : options.multipart
+                  ) {
+                    return new ValueOrPromise(() =>
+                      this.createFormDataFromVariables(requestBody)
+                    )
+                      .then((form) =>
+                        fetch2(endpoint, {
+                          method: "POST",
+                          credentials,
+                          body: form,
+                          headers: __spreadValues(
+                            {
+                              accept,
+                            },
+                            headers
+                          ),
+                          signal: controller.signal,
+                        })
+                      )
+                      .resolve();
+                  } else {
+                    return fetch2(endpoint, {
+                      method: "POST",
+                      credentials,
+                      body: JSON.stringify(requestBody),
+                      headers: __spreadValues(
+                        {
+                          accept,
+                          "content-type": "application/json",
+                        },
+                        headers
+                      ),
+                      signal: controller.signal,
+                    });
+                  }
+              }
+            })
+              .then((fetchResult) => {
+                if (timeoutId != null) {
+                  clearTimeout(timeoutId);
+                }
+                if (
+                  (options === null || options === void 0
+                    ? void 0
+                    : options.retry) != null &&
+                  !fetchResult.status.toString().startsWith("2")
+                ) {
+                  throw new Error(
+                    fetchResult.statusText ||
+                      `HTTP Error: ${fetchResult.status}`
+                  );
+                }
+                const contentType = fetchResult.headers.get("content-type");
+                if (
+                  contentType === null || contentType === void 0
+                    ? void 0
+                    : contentType.includes("text/event-stream")
+                ) {
+                  return handleEventStreamResponse(fetchResult).then(
+                    (resultStream) =>
+                      addCancelToResponseStream(resultStream, controller)
+                  );
+                } else if (
+                  contentType === null || contentType === void 0
+                    ? void 0
+                    : contentType.includes("multipart/mixed")
+                ) {
+                  return handleMultipartMixedResponse(fetchResult).then(
+                    (resultStream) =>
+                      addCancelToResponseStream(resultStream, controller)
+                  );
+                }
+                return fetchResult.text();
+              })
+              .then((result2) => {
+                if (typeof result2 === "string") {
+                  return JSON.parse(result2);
+                } else {
+                  return result2;
+                }
+              })
+              .resolve();
+          };
+          if (
+            (options === null || options === void 0 ? void 0 : options.retry) !=
+            null
+          ) {
+            return function retryExecutor(request) {
+              let result2;
+              let error2;
+              let attempt = 0;
+              function retryAttempt() {
+                attempt++;
+                if (attempt > options.retry) {
+                  if (result2 != null) {
+                    return result2;
+                  }
+                  if (error2 != null) {
+                    throw error2;
+                  }
+                  throw new Error("No result");
+                }
+                return new ValueOrPromise(() => executor(request))
+                  .then((res) => {
+                    var _a2;
+                    result2 = res;
+                    if (
+                      (_a2 =
+                        result2 === null || result2 === void 0
+                          ? void 0
+                          : result2.errors) === null || _a2 === void 0
+                        ? void 0
+                        : _a2.length
+                    ) {
+                      return retryAttempt();
+                    }
+                    return result2;
+                  })
+                  .catch((e) => {
+                    error2 = e;
+                    return retryAttempt();
+                  })
+                  .resolve();
+              }
+              return retryAttempt();
+            };
+          }
+          return executor;
+        }
+        buildWSExecutor(
+          subscriptionsEndpoint,
+          webSocketImpl,
+          connectionParams
+        ) {
+          const WS_URL = switchProtocols(subscriptionsEndpoint, {
+            https: "wss",
+            http: "ws",
+          });
+          const subscriptionClient = createClient$1({
+            url: WS_URL,
+            webSocketImpl,
+            connectionParams,
+            lazy: true,
+          });
+          return ({
+            document: document2,
+            variables,
+            operationName,
+            extensions,
+          }) => {
+            const query = print(document2);
+            return observableToAsyncIterable({
+              subscribe: (observer) => {
+                const unsubscribe = subscriptionClient.subscribe(
+                  {
+                    query,
+                    variables,
+                    operationName,
+                    extensions,
+                  },
+                  observer
+                );
+                return {
+                  unsubscribe,
+                };
+              },
+            });
+          };
+        }
+        buildWSLegacyExecutor(
+          subscriptionsEndpoint,
+          webSocketImpl,
+          connectionParams
+        ) {
+          const WS_URL = switchProtocols(subscriptionsEndpoint, {
+            https: "wss",
+            http: "ws",
+          });
+          const subscriptionClient = new SubscriptionClient_1(
+            WS_URL,
+            {
+              connectionParams,
+              lazy: true,
+            },
+            webSocketImpl
+          );
+          return ({ document: document2, variables, operationName }) => {
+            return observableToAsyncIterable(
+              subscriptionClient.request({
+                query: document2,
+                variables,
+                operationName,
+              })
+            );
+          };
+        }
+        buildGraphQLSSEExecutor(endpoint, fetch2, options = {}) {
+          const { headers } = options;
+          const client2 = createClient(
+            __spreadProps(__spreadValues({}, options.graphqlSseOptions), {
+              url: endpoint,
+              fetchFn: fetch2,
+              abortControllerImpl: AbortController$1,
+              headers,
+            })
+          );
+          return async ({
+            document: document2,
+            variables,
+            operationName,
+            extensions,
+          }) => {
+            return observableToAsyncIterable({
+              subscribe: (observer) => {
+                const unsubscribe = client2.subscribe(
+                  {
+                    query: document2,
+                    variables,
+                    operationName,
+                    extensions,
+                  },
+                  observer
+                );
+                return {
+                  unsubscribe,
+                };
+              },
+            });
+          };
+        }
+        getFetch(customFetch, importFn) {
+          if (customFetch) {
+            if (typeof customFetch === "string") {
+              const [moduleName, fetchFnName] = customFetch.split("#");
+              return new ValueOrPromise(() => importFn(moduleName))
+                .then((module2) =>
+                  fetchFnName ? module2[fetchFnName] : module2
+                )
+                .resolve();
+            } else if (typeof customFetch === "function") {
+              return customFetch;
+            }
+          }
+          if (importFn === asyncImport) {
+            return defaultAsyncFetch;
+          } else {
+            return defaultSyncFetch;
+          }
+        }
+        getDefaultMethodFromOptions(method, defaultMethod) {
+          if (method) {
+            defaultMethod = method;
+          }
+          return defaultMethod;
+        }
+        getWebSocketImpl(importFn, options) {
+          if (
+            typeof (options === null || options === void 0
+              ? void 0
+              : options.webSocketImpl) === "string"
+          ) {
+            const [moduleName, webSocketImplName] =
+              options.webSocketImpl.split("#");
+            return new ValueOrPromise(() => importFn(moduleName))
+              .then((importedModule) =>
+                webSocketImplName
+                  ? importedModule[webSocketImplName]
+                  : importedModule
+              )
+              .resolve();
+          } else {
+            const websocketImpl =
+              (options === null || options === void 0
+                ? void 0
+                : options.webSocketImpl) || browser$1;
+            return websocketImpl;
+          }
+        }
+        buildSubscriptionExecutor(
+          subscriptionsEndpoint,
+          fetch2,
+          importFn,
+          options
+        ) {
+          if (
+            (options === null || options === void 0
+              ? void 0
+              : options.subscriptionsProtocol) === SubscriptionProtocol.SSE
+          ) {
+            return this.buildHTTPExecutor(
+              subscriptionsEndpoint,
+              fetch2,
+              __spreadProps(__spreadValues({}, options), {
+                method: "GET",
+              })
+            );
+          } else if (
+            (options === null || options === void 0
+              ? void 0
+              : options.subscriptionsProtocol) ===
+            SubscriptionProtocol.GRAPHQL_SSE
+          ) {
+            if (
+              !(options === null || options === void 0
+                ? void 0
+                : options.subscriptionsEndpoint)
+            ) {
+              subscriptionsEndpoint += "/stream";
+            }
+            return this.buildGraphQLSSEExecutor(
+              subscriptionsEndpoint,
+              fetch2,
+              options
+            );
+          } else {
+            const webSocketImpl$ = new ValueOrPromise(() =>
+              this.getWebSocketImpl(importFn, options)
+            );
+            const connectionParams = () => ({
+              headers:
+                options === null || options === void 0
+                  ? void 0
+                  : options.headers,
+            });
+            const executor$ = webSocketImpl$.then((webSocketImpl) => {
+              if (
+                (options === null || options === void 0
+                  ? void 0
+                  : options.subscriptionsProtocol) ===
+                SubscriptionProtocol.LEGACY_WS
+              ) {
+                return this.buildWSLegacyExecutor(
+                  subscriptionsEndpoint,
+                  webSocketImpl,
+                  connectionParams
+                );
+              } else {
+                return this.buildWSExecutor(
+                  subscriptionsEndpoint,
+                  webSocketImpl,
+                  connectionParams
+                );
+              }
+            });
+            return (request) =>
+              executor$.then((executor) => executor(request)).resolve();
+          }
+        }
+        getExecutor(endpoint, importFn, options) {
+          const fetch$ = new ValueOrPromise(() =>
+            this.getFetch(
+              options === null || options === void 0
+                ? void 0
+                : options.customFetch,
+              importFn
+            )
+          );
+          const httpExecutor$ = fetch$.then((fetch2) => {
+            return this.buildHTTPExecutor(endpoint, fetch2, options);
+          });
+          const subscriptionExecutor$ = fetch$.then((fetch2) => {
+            const subscriptionsEndpoint =
+              (options === null || options === void 0
+                ? void 0
+                : options.subscriptionsEndpoint) || endpoint;
+            return this.buildSubscriptionExecutor(
+              subscriptionsEndpoint,
+              fetch2,
+              importFn,
+              options
+            );
+          });
+          function getExecutorByRequest(request) {
+            const operationAst = getOperationASTFromRequest(request);
+            if (
+              operationAst.operation === "subscription" ||
+              isLiveQueryOperationDefinitionNode(
+                operationAst,
+                request.variables
+              )
+            ) {
+              return subscriptionExecutor$;
+            } else {
+              return httpExecutor$;
+            }
+          }
+          return (request) =>
+            getExecutorByRequest(request)
+              .then((executor) => executor(request))
+              .resolve();
+        }
+        getExecutorAsync(endpoint, options) {
+          return this.getExecutor(endpoint, asyncImport, options);
+        }
+        getExecutorSync(endpoint, options) {
+          return this.getExecutor(endpoint, syncImport, options);
+        }
+        handleSDL(pointer, fetch2, options) {
+          const defaultMethod = this.getDefaultMethodFromOptions(
+            options === null || options === void 0 ? void 0 : options.method,
+            "GET"
+          );
+          return new ValueOrPromise(() =>
+            fetch2(pointer, {
+              method: defaultMethod,
+              headers: options.headers,
+            })
+          )
+            .then((response) => response.text())
+            .then((schemaString) =>
+              parseGraphQLSDL(pointer, schemaString, options)
+            )
+            .resolve();
+        }
+        async load(pointer, options) {
+          if (!isCompatibleUri(pointer)) {
+            return [];
+          }
+          let source = {
+            location: pointer,
+          };
+          let executor;
+          if (
+            (options === null || options === void 0
+              ? void 0
+              : options.handleAsSDL) ||
+            pointer.endsWith(".graphql") ||
+            pointer.endsWith(".graphqls")
+          ) {
+            const fetch2 = await this.getFetch(
+              options === null || options === void 0
+                ? void 0
+                : options.customFetch,
+              asyncImport
+            );
+            source = await this.handleSDL(pointer, fetch2, options);
+            if (!source.schema && !source.document && !source.rawSDL) {
+              throw new Error(`Invalid SDL response`);
+            }
+            source.schema =
+              source.schema ||
+              (source.document
+                ? buildASTSchema(source.document, options)
+                : source.rawSDL
+                ? buildSchema(source.rawSDL, options)
+                : void 0);
+          } else {
+            executor = this.getExecutorAsync(pointer, options);
+            source.schema = await introspectSchema(executor, {}, options);
+          }
+          if (!source.schema) {
+            throw new Error(`Invalid introspected schema`);
+          }
+          if (
+            options === null || options === void 0 ? void 0 : options.endpoint
+          ) {
+            executor = this.getExecutorAsync(options.endpoint, options);
+          }
+          if (executor) {
+            source.schema = wrapSchema({
+              schema: source.schema,
+              executor,
+            });
+          }
+          return [source];
+        }
+        loadSync(pointer, options) {
+          if (!isCompatibleUri(pointer)) {
+            return [];
+          }
+          let source = {
+            location: pointer,
+          };
+          let executor;
+          if (
+            (options === null || options === void 0
+              ? void 0
+              : options.handleAsSDL) ||
+            pointer.endsWith(".graphql") ||
+            pointer.endsWith(".graphqls")
+          ) {
+            const fetch2 = this.getFetch(
+              options === null || options === void 0
+                ? void 0
+                : options.customFetch,
+              syncImport
+            );
+            source = this.handleSDL(pointer, fetch2, options);
+            if (!source.schema && !source.document && !source.rawSDL) {
+              throw new Error(`Invalid SDL response`);
+            }
+            source.schema =
+              source.schema ||
+              (source.document
+                ? buildASTSchema(source.document, options)
+                : source.rawSDL
+                ? buildSchema(source.rawSDL, options)
+                : void 0);
+          } else {
+            executor = this.getExecutorSync(pointer, options);
+            source.schema = introspectSchema(executor, {}, options);
+          }
+          if (!source.schema) {
+            throw new Error(`Invalid introspected schema`);
+          }
+          if (
+            options === null || options === void 0 ? void 0 : options.endpoint
+          ) {
+            executor = this.getExecutorSync(options.endpoint, options);
+          }
+          if (executor) {
+            source.schema = wrapSchema({
+              schema: source.schema,
+              executor,
+            });
+          }
+          return [source];
+        }
+      }
+      function switchProtocols(pointer, protocolMap) {
+        return Object.entries(protocolMap).reduce(
+          (prev, [source, target2]) =>
+            prev
+              .replace(`${source}://`, `${target2}://`)
+              .replace(`${source}:\\`, `${target2}:\\`),
+          pointer
+        );
+      }
+      var dist = {};
+      var Explorer$1 = {};
+      var require$$1$2 = /* @__PURE__ */ getAugmentedNamespace(graphql);
+      Object.defineProperty(Explorer$1, "__esModule", {
+        value: true,
+      });
+      var _typeof =
+        typeof Symbol === "function" && typeof Symbol.iterator === "symbol"
+          ? function (obj) {
+              return typeof obj;
+            }
+          : function (obj) {
+              return obj &&
+                typeof Symbol === "function" &&
+                obj.constructor === Symbol &&
+                obj !== Symbol.prototype
+                ? "symbol"
+                : typeof obj;
+            };
+      var _slicedToArray = (function () {
+        function sliceIterator(arr, i) {
+          var _arr = [];
+          var _n = true;
+          var _d = false;
+          var _e = void 0;
+          try {
+            for (
+              var _i = arr[Symbol.iterator](), _s;
+              !(_n = (_s = _i.next()).done);
+              _n = true
+            ) {
+              _arr.push(_s.value);
+              if (i && _arr.length === i) break;
+            }
+          } catch (err) {
+            _d = true;
+            _e = err;
+          } finally {
+            try {
+              if (!_n && _i["return"]) _i["return"]();
+            } finally {
+              if (_d) throw _e;
+            }
+          }
+          return _arr;
+        }
+        return function (arr, i) {
+          if (Array.isArray(arr)) {
+            return arr;
+          } else if (Symbol.iterator in Object(arr)) {
+            return sliceIterator(arr, i);
+          } else {
+            throw new TypeError(
+              "Invalid attempt to destructure non-iterable instance"
+            );
+          }
+        };
+      })();
+      var _extends =
+        Object.assign ||
+        function (target2) {
+          for (var i = 1; i < arguments.length; i++) {
+            var source = arguments[i];
+            for (var key in source) {
+              if (Object.prototype.hasOwnProperty.call(source, key)) {
+                target2[key] = source[key];
+              }
+            }
+          }
+          return target2;
+        };
+      var _createClass = (function () {
+        function defineProperties(target2, props) {
+          for (var i = 0; i < props.length; i++) {
+            var descriptor = props[i];
+            descriptor.enumerable = descriptor.enumerable || false;
+            descriptor.configurable = true;
+            if ("value" in descriptor) descriptor.writable = true;
+            Object.defineProperty(target2, descriptor.key, descriptor);
+          }
+        }
+        return function (Constructor, protoProps, staticProps) {
+          if (protoProps) defineProperties(Constructor.prototype, protoProps);
+          if (staticProps) defineProperties(Constructor, staticProps);
+          return Constructor;
+        };
+      })();
+      Explorer$1.defaultValue = defaultValue;
+      var _react = react.exports;
+      var React = _interopRequireWildcard(_react);
+      var _graphql = require$$1$2;
+      function _interopRequireWildcard(obj) {
+        if (obj && obj.__esModule) {
+          return obj;
+        } else {
+          var newObj = {};
+          if (obj != null) {
+            for (var key in obj) {
+              if (Object.prototype.hasOwnProperty.call(obj, key))
+                newObj[key] = obj[key];
+            }
+          }
+          newObj.default = obj;
+          return newObj;
+        }
+      }
+      function _defineProperty(obj, key, value) {
+        if (key in obj) {
+          Object.defineProperty(obj, key, {
+            value,
+            enumerable: true,
+            configurable: true,
+            writable: true,
+          });
+        } else {
+          obj[key] = value;
+        }
+        return obj;
+      }
+      function _toConsumableArray(arr) {
+        if (Array.isArray(arr)) {
+          for (var i = 0, arr2 = Array(arr.length); i < arr.length; i++) {
+            arr2[i] = arr[i];
+          }
+          return arr2;
+        } else {
+          return Array.from(arr);
+        }
+      }
+      function _classCallCheck(instance, Constructor) {
+        if (!(instance instanceof Constructor)) {
+          throw new TypeError("Cannot call a class as a function");
+        }
+      }
+      function _possibleConstructorReturn(self2, call) {
+        if (!self2) {
+          throw new ReferenceError(
+            "this hasn't been initialised - super() hasn't been called"
+          );
+        }
+        return call && (typeof call === "object" || typeof call === "function")
+          ? call
+          : self2;
+      }
+      function _inherits(subClass, superClass) {
+        if (typeof superClass !== "function" && superClass !== null) {
+          throw new TypeError(
+            "Super expression must either be null or a function, not " +
+              typeof superClass
+          );
+        }
+        subClass.prototype = Object.create(superClass && superClass.prototype, {
+          constructor: {
+            value: subClass,
+            enumerable: false,
+            writable: true,
+            configurable: true,
+          },
+        });
+        if (superClass)
+          Object.setPrototypeOf
+            ? Object.setPrototypeOf(subClass, superClass)
+            : (subClass.__proto__ = superClass);
+      }
+      function capitalize(string2) {
+        return string2.charAt(0).toUpperCase() + string2.slice(1);
+      }
+      var defaultColors = {
+        keyword: "#B11A04",
+        def: "#D2054E",
+        property: "#1F61A0",
+        qualifier: "#1C92A9",
+        attribute: "#8B2BB9",
+        number: "#2882F9",
+        string: "#D64292",
+        builtin: "#D47509",
+        string2: "#0B7FC7",
+        variable: "#397D13",
+        atom: "#CA9800",
+      };
+      var defaultArrowOpen = React.createElement(
+        "svg",
+        { width: "12", height: "9" },
+        React.createElement("path", {
+          fill: "#666",
+          d: "M 0 2 L 9 2 L 4.5 7.5 z",
+        })
+      );
+      var defaultArrowClosed = React.createElement(
+        "svg",
+        { width: "12", height: "9" },
+        React.createElement("path", {
+          fill: "#666",
+          d: "M 0 0 L 0 9 L 5.5 4.5 z",
+        })
+      );
+      var defaultCheckboxChecked = React.createElement(
+        "svg",
+        {
+          style: { marginRight: "3px", marginLeft: "-3px" },
+          width: "12",
+          height: "12",
+          viewBox: "0 0 18 18",
+          fill: "none",
+          xmlns: "http://www.w3.org/2000/svg",
+        },
+        React.createElement("path", {
+          d: "M16 0H2C0.9 0 0 0.9 0 2V16C0 17.1 0.9 18 2 18H16C17.1 18 18 17.1 18 16V2C18 0.9 17.1 0 16 0ZM16 16H2V2H16V16ZM14.99 6L13.58 4.58L6.99 11.17L4.41 8.6L2.99 10.01L6.99 14L14.99 6Z",
+          fill: "#666",
+        })
+      );
+      var defaultCheckboxUnchecked = React.createElement(
+        "svg",
+        {
+          style: { marginRight: "3px", marginLeft: "-3px" },
+          width: "12",
+          height: "12",
+          viewBox: "0 0 18 18",
+          fill: "none",
+          xmlns: "http://www.w3.org/2000/svg",
+        },
+        React.createElement("path", {
+          d: "M16 2V16H2V2H16ZM16 0H2C0.9 0 0 0.9 0 2V16C0 17.1 0.9 18 2 18H16C17.1 18 18 17.1 18 16V2C18 0.9 17.1 0 16 0Z",
+          fill: "#CCC",
+        })
+      );
+      function Checkbox(props) {
+        return props.checked
+          ? props.styleConfig.checkboxChecked
+          : props.styleConfig.checkboxUnchecked;
+      }
+      function defaultGetDefaultFieldNames(type2) {
+        var fields = type2.getFields();
+        if (fields["id"]) {
+          var res = ["id"];
+          if (fields["email"]) {
+            res.push("email");
+          } else if (fields["name"]) {
+            res.push("name");
+          }
+          return res;
+        }
+        if (fields["edges"]) {
+          return ["edges"];
+        }
+        if (fields["node"]) {
+          return ["node"];
+        }
+        if (fields["nodes"]) {
+          return ["nodes"];
+        }
+        var leafFieldNames = [];
+        Object.keys(fields).forEach(function (fieldName) {
+          if ((0, _graphql.isLeafType)(fields[fieldName].type)) {
+            leafFieldNames.push(fieldName);
+          }
+        });
+        if (!leafFieldNames.length) {
+          return ["__typename"];
+        }
+        return leafFieldNames.slice(0, 2);
+      }
+      function isRequiredArgument(arg) {
+        return (
+          (0, _graphql.isNonNullType)(arg.type) && arg.defaultValue === void 0
+        );
+      }
+      function unwrapOutputType(outputType) {
+        var unwrappedType = outputType;
+        while ((0, _graphql.isWrappingType)(unwrappedType)) {
+          unwrappedType = unwrappedType.ofType;
+        }
+        return unwrappedType;
+      }
+      function unwrapInputType(inputType) {
+        var unwrappedType = inputType;
+        while ((0, _graphql.isWrappingType)(unwrappedType)) {
+          unwrappedType = unwrappedType.ofType;
+        }
+        return unwrappedType;
+      }
+      function coerceArgValue(argType, value) {
+        if (typeof value !== "string" && value.kind === "VariableDefinition") {
+          return value.variable;
+        } else if ((0, _graphql.isScalarType)(argType)) {
+          try {
+            switch (argType.name) {
+              case "String":
+                return {
+                  kind: "StringValue",
+                  value: String(argType.parseValue(value)),
+                };
+              case "Float":
+                return {
+                  kind: "FloatValue",
+                  value: String(argType.parseValue(parseFloat(value))),
+                };
+              case "Int":
+                return {
+                  kind: "IntValue",
+                  value: String(argType.parseValue(parseInt(value, 10))),
+                };
+              case "Boolean":
+                try {
+                  var parsed = JSON.parse(value);
+                  if (typeof parsed === "boolean") {
+                    return { kind: "BooleanValue", value: parsed };
+                  } else {
+                    return { kind: "BooleanValue", value: false };
+                  }
+                } catch (e) {
+                  return {
+                    kind: "BooleanValue",
+                    value: false,
+                  };
+                }
+              default:
+                return {
+                  kind: "StringValue",
+                  value: String(argType.parseValue(value)),
+                };
+            }
+          } catch (e) {
+            console.error("error coercing arg value", e, value);
+            return { kind: "StringValue", value };
+          }
+        } else {
+          try {
+            var parsedValue = argType.parseValue(value);
+            if (parsedValue) {
+              return { kind: "EnumValue", value: String(parsedValue) };
+            } else {
+              return { kind: "EnumValue", value: argType.getValues()[0].name };
+            }
+          } catch (e) {
+            return { kind: "EnumValue", value: argType.getValues()[0].name };
+          }
+        }
+      }
+      var InputArgView = (function (_React$PureComponent) {
+        _inherits(InputArgView2, _React$PureComponent);
+        function InputArgView2() {
+          var _ref;
+          var _temp, _this, _ret;
+          _classCallCheck(this, InputArgView2);
+          for (
+            var _len = arguments.length, args = Array(_len), _key = 0;
+            _key < _len;
+            _key++
+          ) {
+            args[_key] = arguments[_key];
+          }
+          return (
+            (_ret =
+              ((_temp =
+                ((_this = _possibleConstructorReturn(
+                  this,
+                  (_ref =
+                    InputArgView2.__proto__ ||
+                    Object.getPrototypeOf(InputArgView2)).call.apply(
+                    _ref,
+                    [this].concat(args)
+                  )
+                )),
+                _this)),
+              (_this._getArgSelection = function () {
+                return _this.props.selection.fields.find(function (field) {
+                  return field.name.value === _this.props.arg.name;
+                });
+              }),
+              (_this._removeArg = function () {
+                var selection = _this.props.selection;
+                var argSelection = _this._getArgSelection();
+                _this._previousArgSelection = argSelection;
+                _this.props.modifyFields(
+                  selection.fields.filter(function (field) {
+                    return field !== argSelection;
+                  }),
+                  true
+                );
+              }),
+              (_this._addArg = function () {
+                var _this$props = _this.props,
+                  selection = _this$props.selection,
+                  arg = _this$props.arg,
+                  getDefaultScalarArgValue =
+                    _this$props.getDefaultScalarArgValue,
+                  parentField = _this$props.parentField,
+                  makeDefaultArg = _this$props.makeDefaultArg;
+                var argType = unwrapInputType(arg.type);
+                var argSelection = null;
+                if (_this._previousArgSelection) {
+                  argSelection = _this._previousArgSelection;
+                } else if ((0, _graphql.isInputObjectType)(argType)) {
+                  var _fields = argType.getFields();
+                  argSelection = {
+                    kind: "ObjectField",
+                    name: { kind: "Name", value: arg.name },
+                    value: {
+                      kind: "ObjectValue",
+                      fields: defaultInputObjectFields(
+                        getDefaultScalarArgValue,
+                        makeDefaultArg,
+                        parentField,
+                        Object.keys(_fields).map(function (k) {
+                          return _fields[k];
+                        })
+                      ),
+                    },
+                  };
+                } else if ((0, _graphql.isLeafType)(argType)) {
+                  argSelection = {
+                    kind: "ObjectField",
+                    name: { kind: "Name", value: arg.name },
+                    value: getDefaultScalarArgValue(parentField, arg, argType),
+                  };
+                }
+                if (!argSelection) {
+                  console.error("Unable to add arg for argType", argType);
+                } else {
+                  return _this.props.modifyFields(
+                    [].concat(_toConsumableArray(selection.fields || []), [
+                      argSelection,
+                    ]),
+                    true
+                  );
+                }
+              }),
+              (_this._setArgValue = function (event, options) {
+                var settingToNull = false;
+                var settingToVariable = false;
+                var settingToLiteralValue = false;
+                try {
+                  if (event.kind === "VariableDefinition") {
+                    settingToVariable = true;
+                  } else if (event === null || typeof event === "undefined") {
+                    settingToNull = true;
+                  } else if (typeof event.kind === "string") {
+                    settingToLiteralValue = true;
+                  }
+                } catch (e) {}
+                var selection = _this.props.selection;
+                var argSelection = _this._getArgSelection();
+                if (!argSelection) {
+                  console.error("missing arg selection when setting arg value");
+                  return;
+                }
+                var argType = unwrapInputType(_this.props.arg.type);
+                var handleable =
+                  (0, _graphql.isLeafType)(argType) ||
+                  settingToVariable ||
+                  settingToNull ||
+                  settingToLiteralValue;
+                if (!handleable) {
+                  console.warn(
+                    "Unable to handle non leaf types in InputArgView.setArgValue",
+                    event
+                  );
+                  return;
+                }
+                var targetValue = void 0;
+                var value = void 0;
+                if (event === null || typeof event === "undefined") {
+                  value = null;
+                } else if (
+                  !event.target &&
+                  !!event.kind &&
+                  event.kind === "VariableDefinition"
+                ) {
+                  targetValue = event;
+                  value = targetValue.variable;
+                } else if (typeof event.kind === "string") {
+                  value = event;
+                } else if (
+                  event.target &&
+                  typeof event.target.value === "string"
+                ) {
+                  targetValue = event.target.value;
+                  value = coerceArgValue(argType, targetValue);
+                }
+                var newDoc = _this.props.modifyFields(
+                  (selection.fields || []).map(function (field) {
+                    var isTarget = field === argSelection;
+                    var newField = isTarget
+                      ? _extends({}, field, {
+                          value,
+                        })
+                      : field;
+                    return newField;
+                  }),
+                  options
+                );
+                return newDoc;
+              }),
+              (_this._modifyChildFields = function (fields) {
+                return _this.props.modifyFields(
+                  _this.props.selection.fields.map(function (field) {
+                    return field.name.value === _this.props.arg.name
+                      ? _extends({}, field, {
+                          value: {
+                            kind: "ObjectValue",
+                            fields,
+                          },
+                        })
+                      : field;
+                  }),
+                  true
+                );
+              }),
+              _temp)),
+            _possibleConstructorReturn(_this, _ret)
+          );
+        }
+        _createClass(InputArgView2, [
+          {
+            key: "render",
+            value: function render() {
+              var _props = this.props,
+                arg = _props.arg,
+                parentField = _props.parentField;
+              var argSelection = this._getArgSelection();
+              return React.createElement(AbstractArgView, {
+                argValue: argSelection ? argSelection.value : null,
+                arg,
+                parentField,
+                addArg: this._addArg,
+                removeArg: this._removeArg,
+                setArgFields: this._modifyChildFields,
+                setArgValue: this._setArgValue,
+                getDefaultScalarArgValue: this.props.getDefaultScalarArgValue,
+                makeDefaultArg: this.props.makeDefaultArg,
+                onRunOperation: this.props.onRunOperation,
+                styleConfig: this.props.styleConfig,
+                onCommit: this.props.onCommit,
+                definition: this.props.definition,
+              });
+            },
+          },
+        ]);
+        return InputArgView2;
+      })(React.PureComponent);
+      function defaultValue(argType) {
+        if ((0, _graphql.isEnumType)(argType)) {
+          return { kind: "EnumValue", value: argType.getValues()[0].name };
+        } else {
+          switch (argType.name) {
+            case "String":
+              return { kind: "StringValue", value: "" };
+            case "Float":
+              return { kind: "FloatValue", value: "1.5" };
+            case "Int":
+              return { kind: "IntValue", value: "10" };
+            case "Boolean":
+              return { kind: "BooleanValue", value: false };
+            default:
+              return { kind: "StringValue", value: "" };
+          }
+        }
+      }
+      function defaultGetDefaultScalarArgValue(parentField, arg, argType) {
+        return defaultValue(argType);
+      }
+      var ArgView = (function (_React$PureComponent2) {
+        _inherits(ArgView2, _React$PureComponent2);
+        function ArgView2() {
+          var _ref2;
+          var _temp2, _this2, _ret2;
+          _classCallCheck(this, ArgView2);
+          for (
+            var _len2 = arguments.length, args = Array(_len2), _key2 = 0;
+            _key2 < _len2;
+            _key2++
+          ) {
+            args[_key2] = arguments[_key2];
+          }
+          return (
+            (_ret2 =
+              ((_temp2 =
+                ((_this2 = _possibleConstructorReturn(
+                  this,
+                  (_ref2 =
+                    ArgView2.__proto__ ||
+                    Object.getPrototypeOf(ArgView2)).call.apply(
+                    _ref2,
+                    [this].concat(args)
+                  )
+                )),
+                _this2)),
+              (_this2._getArgSelection = function () {
+                var selection = _this2.props.selection;
+                return (selection.arguments || []).find(function (arg) {
+                  return arg.name.value === _this2.props.arg.name;
+                });
+              }),
+              (_this2._removeArg = function (commit) {
+                var selection = _this2.props.selection;
+                var argSelection = _this2._getArgSelection();
+                _this2._previousArgSelection = argSelection;
+                return _this2.props.modifyArguments(
+                  (selection.arguments || []).filter(function (arg) {
+                    return arg !== argSelection;
+                  }),
+                  commit
+                );
+              }),
+              (_this2._addArg = function (commit) {
+                var _this2$props = _this2.props,
+                  selection = _this2$props.selection,
+                  getDefaultScalarArgValue =
+                    _this2$props.getDefaultScalarArgValue,
+                  makeDefaultArg = _this2$props.makeDefaultArg,
+                  parentField = _this2$props.parentField,
+                  arg = _this2$props.arg;
+                var argType = unwrapInputType(arg.type);
+                var argSelection = null;
+                if (_this2._previousArgSelection) {
+                  argSelection = _this2._previousArgSelection;
+                } else if ((0, _graphql.isInputObjectType)(argType)) {
+                  var _fields2 = argType.getFields();
+                  argSelection = {
+                    kind: "Argument",
+                    name: { kind: "Name", value: arg.name },
+                    value: {
+                      kind: "ObjectValue",
+                      fields: defaultInputObjectFields(
+                        getDefaultScalarArgValue,
+                        makeDefaultArg,
+                        parentField,
+                        Object.keys(_fields2).map(function (k) {
+                          return _fields2[k];
+                        })
+                      ),
+                    },
+                  };
+                } else if ((0, _graphql.isLeafType)(argType)) {
+                  argSelection = {
+                    kind: "Argument",
+                    name: { kind: "Name", value: arg.name },
+                    value: getDefaultScalarArgValue(parentField, arg, argType),
+                  };
+                }
+                if (!argSelection) {
+                  console.error("Unable to add arg for argType", argType);
+                  return null;
+                } else {
+                  return _this2.props.modifyArguments(
+                    [].concat(_toConsumableArray(selection.arguments || []), [
+                      argSelection,
+                    ]),
+                    commit
+                  );
+                }
+              }),
+              (_this2._setArgValue = function (event, options) {
+                var settingToNull = false;
+                var settingToVariable = false;
+                var settingToLiteralValue = false;
+                try {
+                  if (event.kind === "VariableDefinition") {
+                    settingToVariable = true;
+                  } else if (event === null || typeof event === "undefined") {
+                    settingToNull = true;
+                  } else if (typeof event.kind === "string") {
+                    settingToLiteralValue = true;
+                  }
+                } catch (e) {}
+                var selection = _this2.props.selection;
+                var argSelection = _this2._getArgSelection();
+                if (!argSelection && !settingToVariable) {
+                  console.error("missing arg selection when setting arg value");
+                  return;
+                }
+                var argType = unwrapInputType(_this2.props.arg.type);
+                var handleable =
+                  (0, _graphql.isLeafType)(argType) ||
+                  settingToVariable ||
+                  settingToNull ||
+                  settingToLiteralValue;
+                if (!handleable) {
+                  console.warn(
+                    "Unable to handle non leaf types in ArgView._setArgValue"
+                  );
+                  return;
+                }
+                var targetValue = void 0;
+                var value = void 0;
+                if (event === null || typeof event === "undefined") {
+                  value = null;
+                } else if (
+                  event.target &&
+                  typeof event.target.value === "string"
+                ) {
+                  targetValue = event.target.value;
+                  value = coerceArgValue(argType, targetValue);
+                } else if (
+                  !event.target &&
+                  event.kind === "VariableDefinition"
+                ) {
+                  targetValue = event;
+                  value = targetValue.variable;
+                } else if (typeof event.kind === "string") {
+                  value = event;
+                }
+                return _this2.props.modifyArguments(
+                  (selection.arguments || []).map(function (a) {
+                    return a === argSelection
+                      ? _extends({}, a, {
+                          value,
+                        })
+                      : a;
+                  }),
+                  options
+                );
+              }),
+              (_this2._setArgFields = function (fields, commit) {
+                var selection = _this2.props.selection;
+                var argSelection = _this2._getArgSelection();
+                if (!argSelection) {
+                  console.error("missing arg selection when setting arg value");
+                  return;
+                }
+                return _this2.props.modifyArguments(
+                  (selection.arguments || []).map(function (a) {
+                    return a === argSelection
+                      ? _extends({}, a, {
+                          value: {
+                            kind: "ObjectValue",
+                            fields,
+                          },
+                        })
+                      : a;
+                  }),
+                  commit
+                );
+              }),
+              _temp2)),
+            _possibleConstructorReturn(_this2, _ret2)
+          );
+        }
+        _createClass(ArgView2, [
+          {
+            key: "render",
+            value: function render() {
+              var _props2 = this.props,
+                arg = _props2.arg,
+                parentField = _props2.parentField;
+              var argSelection = this._getArgSelection();
+              return React.createElement(AbstractArgView, {
+                argValue: argSelection ? argSelection.value : null,
+                arg,
+                parentField,
+                addArg: this._addArg,
+                removeArg: this._removeArg,
+                setArgFields: this._setArgFields,
+                setArgValue: this._setArgValue,
+                getDefaultScalarArgValue: this.props.getDefaultScalarArgValue,
+                makeDefaultArg: this.props.makeDefaultArg,
+                onRunOperation: this.props.onRunOperation,
+                styleConfig: this.props.styleConfig,
+                onCommit: this.props.onCommit,
+                definition: this.props.definition,
+              });
+            },
+          },
+        ]);
+        return ArgView2;
+      })(React.PureComponent);
+      function isRunShortcut(event) {
+        return event.ctrlKey && event.key === "Enter";
+      }
+      function canRunOperation(operationName) {
+        return operationName !== "FragmentDefinition";
+      }
+      var ScalarInput = (function (_React$PureComponent3) {
+        _inherits(ScalarInput2, _React$PureComponent3);
+        function ScalarInput2() {
+          var _ref3;
+          var _temp3, _this3, _ret3;
+          _classCallCheck(this, ScalarInput2);
+          for (
+            var _len3 = arguments.length, args = Array(_len3), _key3 = 0;
+            _key3 < _len3;
+            _key3++
+          ) {
+            args[_key3] = arguments[_key3];
+          }
+          return (
+            (_ret3 =
+              ((_temp3 =
+                ((_this3 = _possibleConstructorReturn(
+                  this,
+                  (_ref3 =
+                    ScalarInput2.__proto__ ||
+                    Object.getPrototypeOf(ScalarInput2)).call.apply(
+                    _ref3,
+                    [this].concat(args)
+                  )
+                )),
+                _this3)),
+              (_this3._handleChange = function (event) {
+                _this3.props.setArgValue(event, true);
+              }),
+              _temp3)),
+            _possibleConstructorReturn(_this3, _ret3)
+          );
+        }
+        _createClass(ScalarInput2, [
+          {
+            key: "componentDidMount",
+            value: function componentDidMount() {
+              var input = this._ref;
+              var activeElement = document.activeElement;
+              if (
+                input &&
+                activeElement &&
+                !(activeElement instanceof HTMLTextAreaElement)
+              ) {
+                input.focus();
+                input.setSelectionRange(0, input.value.length);
+              }
+            },
+          },
+          {
+            key: "render",
+            value: function render() {
+              var _this4 = this;
+              var _props3 = this.props,
+                arg = _props3.arg,
+                argValue = _props3.argValue,
+                styleConfig = _props3.styleConfig;
+              var argType = unwrapInputType(arg.type);
+              var value =
+                typeof argValue.value === "string" ? argValue.value : "";
+              var color =
+                this.props.argValue.kind === "StringValue"
+                  ? styleConfig.colors.string
+                  : styleConfig.colors.number;
+              return React.createElement(
+                "span",
+                { style: { color } },
+                argType.name === "String" ? '"' : "",
+                React.createElement("input", {
+                  style: {
+                    border: "none",
+                    borderBottom: "1px solid #888",
+                    outline: "none",
+                    width: Math.max(1, Math.min(15, value.length)) + "ch",
+                    color,
+                  },
+                  ref: function ref(_ref4) {
+                    _this4._ref = _ref4;
+                  },
+                  type: "text",
+                  onChange: this._handleChange,
+                  value,
+                }),
+                argType.name === "String" ? '"' : ""
+              );
+            },
+          },
+        ]);
+        return ScalarInput2;
+      })(React.PureComponent);
+      var AbstractArgView = (function (_React$PureComponent4) {
+        _inherits(AbstractArgView2, _React$PureComponent4);
+        function AbstractArgView2() {
+          var _ref5;
+          var _temp4, _this5, _ret4;
+          _classCallCheck(this, AbstractArgView2);
+          for (
+            var _len4 = arguments.length, args = Array(_len4), _key4 = 0;
+            _key4 < _len4;
+            _key4++
+          ) {
+            args[_key4] = arguments[_key4];
+          }
+          return (
+            (_ret4 =
+              ((_temp4 =
+                ((_this5 = _possibleConstructorReturn(
+                  this,
+                  (_ref5 =
+                    AbstractArgView2.__proto__ ||
+                    Object.getPrototypeOf(AbstractArgView2)).call.apply(
+                    _ref5,
+                    [this].concat(args)
+                  )
+                )),
+                _this5)),
+              (_this5.state = { displayArgActions: false }),
+              _temp4)),
+            _possibleConstructorReturn(_this5, _ret4)
+          );
+        }
+        _createClass(AbstractArgView2, [
+          {
+            key: "render",
+            value: function render() {
+              var _this6 = this;
+              var _props4 = this.props,
+                argValue = _props4.argValue,
+                arg = _props4.arg,
+                styleConfig = _props4.styleConfig;
+              var argType = unwrapInputType(arg.type);
+              var input = null;
+              if (argValue) {
+                if (argValue.kind === "Variable") {
+                  input = React.createElement(
+                    "span",
+                    { style: { color: styleConfig.colors.variable } },
+                    "$",
+                    argValue.name.value
+                  );
+                } else if ((0, _graphql.isScalarType)(argType)) {
+                  if (argType.name === "Boolean") {
+                    input = React.createElement(
+                      "select",
+                      {
+                        style: {
+                          color: styleConfig.colors.builtin,
+                        },
+                        onChange: this.props.setArgValue,
+                        value:
+                          argValue.kind === "BooleanValue"
+                            ? argValue.value
+                            : void 0,
+                      },
+                      React.createElement(
+                        "option",
+                        { key: "true", value: "true" },
+                        "true"
+                      ),
+                      React.createElement(
+                        "option",
+                        { key: "false", value: "false" },
+                        "false"
+                      )
+                    );
+                  } else {
+                    input = React.createElement(ScalarInput, {
+                      setArgValue: this.props.setArgValue,
+                      arg,
+                      argValue,
+                      onRunOperation: this.props.onRunOperation,
+                      styleConfig: this.props.styleConfig,
+                    });
+                  }
+                } else if ((0, _graphql.isEnumType)(argType)) {
+                  if (argValue.kind === "EnumValue") {
+                    input = React.createElement(
+                      "select",
+                      {
+                        style: {
+                          backgroundColor: "white",
+                          color: styleConfig.colors.string2,
+                        },
+                        onChange: this.props.setArgValue,
+                        value: argValue.value,
+                      },
+                      argType.getValues().map(function (value) {
+                        return React.createElement(
+                          "option",
+                          { key: value.name, value: value.name },
+                          value.name
+                        );
+                      })
+                    );
+                  } else {
+                    console.error(
+                      "arg mismatch between arg and selection",
+                      argType,
+                      argValue
+                    );
+                  }
+                } else if ((0, _graphql.isInputObjectType)(argType)) {
+                  if (argValue.kind === "ObjectValue") {
+                    var _fields3 = argType.getFields();
+                    input = React.createElement(
+                      "div",
+                      { style: { marginLeft: 16 } },
+                      Object.keys(_fields3)
+                        .sort()
+                        .map(function (fieldName) {
+                          return React.createElement(InputArgView, {
+                            key: fieldName,
+                            arg: _fields3[fieldName],
+                            parentField: _this6.props.parentField,
+                            selection: argValue,
+                            modifyFields: _this6.props.setArgFields,
+                            getDefaultScalarArgValue:
+                              _this6.props.getDefaultScalarArgValue,
+                            makeDefaultArg: _this6.props.makeDefaultArg,
+                            onRunOperation: _this6.props.onRunOperation,
+                            styleConfig: _this6.props.styleConfig,
+                            onCommit: _this6.props.onCommit,
+                            definition: _this6.props.definition,
+                          });
+                        })
+                    );
+                  } else {
+                    console.error(
+                      "arg mismatch between arg and selection",
+                      argType,
+                      argValue
+                    );
+                  }
+                }
+              }
+              var variablize = function variablize2() {
+                var baseVariableName = arg.name;
+                var conflictingNameCount = (
+                  _this6.props.definition.variableDefinitions || []
+                ).filter(function (varDef) {
+                  return varDef.variable.name.value.startsWith(
+                    baseVariableName
+                  );
+                }).length;
+                var variableName = void 0;
+                if (conflictingNameCount > 0) {
+                  variableName = "" + baseVariableName + conflictingNameCount;
+                } else {
+                  variableName = baseVariableName;
+                }
+                var argPrintedType = arg.type.toString();
+                var argType2 = (0, _graphql.parseType)(argPrintedType);
+                var base2 = {
+                  kind: "VariableDefinition",
+                  variable: {
+                    kind: "Variable",
+                    name: {
+                      kind: "Name",
+                      value: variableName,
+                    },
+                  },
+                  type: argType2,
+                  directives: [],
+                };
+                var variableDefinitionByName =
+                  function variableDefinitionByName2(name2) {
+                    return (
+                      _this6.props.definition.variableDefinitions || []
+                    ).find(function (varDef) {
+                      return varDef.variable.name.value === name2;
+                    });
+                  };
+                var variable = void 0;
+                var subVariableUsageCountByName = {};
+                if (typeof argValue !== "undefined" && argValue !== null) {
+                  var cleanedDefaultValue = (0, _graphql.visit)(argValue, {
+                    Variable: function Variable(node) {
+                      var varName = node.name.value;
+                      var varDef = variableDefinitionByName(varName);
+                      subVariableUsageCountByName[varName] =
+                        subVariableUsageCountByName[varName] + 1 || 1;
+                      if (!varDef) {
+                        return;
+                      }
+                      return varDef.defaultValue;
+                    },
+                  });
+                  var isNonNullable = base2.type.kind === "NonNullType";
+                  var unwrappedBase = isNonNullable
+                    ? _extends({}, base2, { type: base2.type.type })
+                    : base2;
+                  variable = _extends({}, unwrappedBase, {
+                    defaultValue: cleanedDefaultValue,
+                  });
+                } else {
+                  variable = base2;
+                }
+                var newlyUnusedVariables = Object.entries(
+                  subVariableUsageCountByName
+                )
+                  .filter(function (_ref6) {
+                    var _ref7 = _slicedToArray(_ref6, 2);
+                    _ref7[0];
+                    var usageCount = _ref7[1];
+                    return usageCount < 2;
+                  })
+                  .map(function (_ref8) {
+                    var _ref9 = _slicedToArray(_ref8, 2),
+                      varName = _ref9[0];
+                    _ref9[1];
+                    return varName;
+                  });
+                if (variable) {
+                  var _newDoc = _this6.props.setArgValue(variable, false);
+                  if (_newDoc) {
+                    var targetOperation = _newDoc.definitions.find(function (
+                      definition
+                    ) {
+                      if (
+                        !!definition.operation &&
+                        !!definition.name &&
+                        !!definition.name.value &&
+                        !!_this6.props.definition.name &&
+                        !!_this6.props.definition.name.value
+                      ) {
+                        return (
+                          definition.name.value ===
+                          _this6.props.definition.name.value
+                        );
+                      } else {
+                        return false;
+                      }
+                    });
+                    var newVariableDefinitions = []
+                      .concat(
+                        _toConsumableArray(
+                          targetOperation.variableDefinitions || []
+                        ),
+                        [variable]
+                      )
+                      .filter(function (varDef) {
+                        return (
+                          newlyUnusedVariables.indexOf(
+                            varDef.variable.name.value
+                          ) === -1
+                        );
+                      });
+                    var newOperation = _extends({}, targetOperation, {
+                      variableDefinitions: newVariableDefinitions,
+                    });
+                    var existingDefs = _newDoc.definitions;
+                    var newDefinitions = existingDefs.map(function (
+                      existingOperation
+                    ) {
+                      if (targetOperation === existingOperation) {
+                        return newOperation;
+                      } else {
+                        return existingOperation;
+                      }
+                    });
+                    var finalDoc = _extends({}, _newDoc, {
+                      definitions: newDefinitions,
+                    });
+                    _this6.props.onCommit(finalDoc);
+                  }
+                }
+              };
+              var devariablize = function devariablize2() {
+                if (!argValue || !argValue.name || !argValue.name.value) {
+                  return;
+                }
+                var variableName = argValue.name.value;
+                var variableDefinition = (
+                  _this6.props.definition.variableDefinitions || []
+                ).find(function (varDef) {
+                  return varDef.variable.name.value === variableName;
+                });
+                if (!variableDefinition) {
+                  return;
+                }
+                var defaultValue2 = variableDefinition.defaultValue;
+                var newDoc = _this6.props.setArgValue(defaultValue2, {
+                  commit: false,
+                });
+                if (newDoc) {
+                  var targetOperation = newDoc.definitions.find(function (
+                    definition
+                  ) {
+                    return (
+                      definition.name.value ===
+                      _this6.props.definition.name.value
+                    );
+                  });
+                  if (!targetOperation) {
+                    return;
+                  }
+                  var variableUseCount = 0;
+                  (0, _graphql.visit)(targetOperation, {
+                    Variable: function Variable(node) {
+                      if (node.name.value === variableName) {
+                        variableUseCount = variableUseCount + 1;
+                      }
+                    },
+                  });
+                  var newVariableDefinitions =
+                    targetOperation.variableDefinitions || [];
+                  if (variableUseCount < 2) {
+                    newVariableDefinitions = newVariableDefinitions.filter(
+                      function (varDef) {
+                        return varDef.variable.name.value !== variableName;
+                      }
+                    );
+                  }
+                  var newOperation = _extends({}, targetOperation, {
+                    variableDefinitions: newVariableDefinitions,
+                  });
+                  var existingDefs = newDoc.definitions;
+                  var newDefinitions = existingDefs.map(function (
+                    existingOperation
+                  ) {
+                    if (targetOperation === existingOperation) {
+                      return newOperation;
+                    } else {
+                      return existingOperation;
+                    }
+                  });
+                  var finalDoc = _extends({}, newDoc, {
+                    definitions: newDefinitions,
+                  });
+                  _this6.props.onCommit(finalDoc);
+                }
+              };
+              var isArgValueVariable = argValue && argValue.kind === "Variable";
+              var variablizeActionButton = !this.state.displayArgActions
+                ? null
+                : React.createElement(
+                    "button",
+                    {
+                      type: "submit",
+                      className: "toolbar-button",
+                      title: isArgValueVariable
+                        ? "Remove the variable"
+                        : "Extract the current value into a GraphQL variable",
+                      onClick: function onClick(event) {
+                        event.preventDefault();
+                        event.stopPropagation();
+                        if (isArgValueVariable) {
+                          devariablize();
+                        } else {
+                          variablize();
+                        }
+                      },
+                      style: styleConfig.styles.actionButtonStyle,
+                    },
+                    React.createElement(
+                      "span",
+                      { style: { color: styleConfig.colors.variable } },
+                      "$"
+                    )
+                  );
+              return React.createElement(
+                "div",
+                {
+                  style: {
+                    cursor: "pointer",
+                    minHeight: "16px",
+                    WebkitUserSelect: "none",
+                    userSelect: "none",
+                  },
+                  "data-arg-name": arg.name,
+                  "data-arg-type": argType.name,
+                  className: "graphiql-explorer-" + arg.name,
+                },
+                React.createElement(
+                  "span",
+                  {
+                    style: { cursor: "pointer" },
+                    onClick: function onClick(event) {
+                      var shouldAdd = !argValue;
+                      if (shouldAdd) {
+                        _this6.props.addArg(true);
+                      } else {
+                        _this6.props.removeArg(true);
+                      }
+                      _this6.setState({ displayArgActions: shouldAdd });
+                    },
+                  },
+                  (0, _graphql.isInputObjectType)(argType)
+                    ? React.createElement(
+                        "span",
+                        null,
+                        !!argValue
+                          ? this.props.styleConfig.arrowOpen
+                          : this.props.styleConfig.arrowClosed
+                      )
+                    : React.createElement(Checkbox, {
+                        checked: !!argValue,
+                        styleConfig: this.props.styleConfig,
+                      }),
+                  React.createElement(
+                    "span",
+                    {
+                      style: { color: styleConfig.colors.attribute },
+                      title: arg.description,
+                      onMouseEnter: function onMouseEnter() {
+                        if (
+                          argValue !== null &&
+                          typeof argValue !== "undefined"
+                        ) {
+                          _this6.setState({ displayArgActions: true });
+                        }
+                      },
+                      onMouseLeave: function onMouseLeave() {
+                        return _this6.setState({ displayArgActions: false });
+                      },
+                    },
+                    arg.name,
+                    isRequiredArgument(arg) ? "*" : "",
+                    ": ",
+                    variablizeActionButton,
+                    " "
+                  ),
+                  " "
+                ),
+                input || React.createElement("span", null),
+                " "
+              );
+            },
+          },
+        ]);
+        return AbstractArgView2;
+      })(React.PureComponent);
+      var AbstractView = (function (_React$PureComponent5) {
+        _inherits(AbstractView2, _React$PureComponent5);
+        function AbstractView2() {
+          var _ref10;
+          var _temp5, _this7, _ret5;
+          _classCallCheck(this, AbstractView2);
+          for (
+            var _len5 = arguments.length, args = Array(_len5), _key5 = 0;
+            _key5 < _len5;
+            _key5++
+          ) {
+            args[_key5] = arguments[_key5];
+          }
+          return (
+            (_ret5 =
+              ((_temp5 =
+                ((_this7 = _possibleConstructorReturn(
+                  this,
+                  (_ref10 =
+                    AbstractView2.__proto__ ||
+                    Object.getPrototypeOf(AbstractView2)).call.apply(
+                    _ref10,
+                    [this].concat(args)
+                  )
+                )),
+                _this7)),
+              (_this7._addFragment = function () {
+                _this7.props.modifySelections(
+                  [].concat(_toConsumableArray(_this7.props.selections), [
+                    _this7._previousSelection || {
+                      kind: "InlineFragment",
+                      typeCondition: {
+                        kind: "NamedType",
+                        name: {
+                          kind: "Name",
+                          value: _this7.props.implementingType.name,
+                        },
+                      },
+                      selectionSet: {
+                        kind: "SelectionSet",
+                        selections: _this7.props
+                          .getDefaultFieldNames(_this7.props.implementingType)
+                          .map(function (fieldName) {
+                            return {
+                              kind: "Field",
+                              name: { kind: "Name", value: fieldName },
+                            };
+                          }),
+                      },
+                    },
+                  ])
+                );
+              }),
+              (_this7._removeFragment = function () {
+                var thisSelection = _this7._getSelection();
+                _this7._previousSelection = thisSelection;
+                _this7.props.modifySelections(
+                  _this7.props.selections.filter(function (s) {
+                    return s !== thisSelection;
+                  })
+                );
+              }),
+              (_this7._getSelection = function () {
+                var selection = _this7.props.selections.find(function (
+                  selection2
+                ) {
+                  return (
+                    selection2.kind === "InlineFragment" &&
+                    selection2.typeCondition &&
+                    _this7.props.implementingType.name ===
+                      selection2.typeCondition.name.value
+                  );
+                });
+                if (!selection) {
+                  return null;
+                }
+                if (selection.kind === "InlineFragment") {
+                  return selection;
+                }
+              }),
+              (_this7._modifyChildSelections = function (selections, options) {
+                var thisSelection = _this7._getSelection();
+                return _this7.props.modifySelections(
+                  _this7.props.selections.map(function (selection) {
+                    if (selection === thisSelection) {
+                      return {
+                        directives: selection.directives,
+                        kind: "InlineFragment",
+                        typeCondition: {
+                          kind: "NamedType",
+                          name: {
+                            kind: "Name",
+                            value: _this7.props.implementingType.name,
+                          },
+                        },
+                        selectionSet: {
+                          kind: "SelectionSet",
+                          selections,
+                        },
+                      };
+                    }
+                    return selection;
+                  }),
+                  options
+                );
+              }),
+              _temp5)),
+            _possibleConstructorReturn(_this7, _ret5)
+          );
+        }
+        _createClass(AbstractView2, [
+          {
+            key: "render",
+            value: function render() {
+              var _this8 = this;
+              var _props5 = this.props,
+                implementingType = _props5.implementingType,
+                schema = _props5.schema,
+                getDefaultFieldNames = _props5.getDefaultFieldNames,
+                styleConfig = _props5.styleConfig;
+              var selection = this._getSelection();
+              var fields = implementingType.getFields();
+              var childSelections = selection
+                ? selection.selectionSet
+                  ? selection.selectionSet.selections
+                  : []
+                : [];
+              return React.createElement(
+                "div",
+                { className: "graphiql-explorer-" + implementingType.name },
+                React.createElement(
+                  "span",
+                  {
+                    style: { cursor: "pointer" },
+                    onClick: selection
+                      ? this._removeFragment
+                      : this._addFragment,
+                  },
+                  React.createElement(Checkbox, {
+                    checked: !!selection,
+                    styleConfig: this.props.styleConfig,
+                  }),
+                  React.createElement(
+                    "span",
+                    { style: { color: styleConfig.colors.atom } },
+                    this.props.implementingType.name
+                  )
+                ),
+                selection
+                  ? React.createElement(
+                      "div",
+                      { style: { marginLeft: 16 } },
+                      Object.keys(fields)
+                        .sort()
+                        .map(function (fieldName) {
+                          return React.createElement(FieldView, {
+                            key: fieldName,
+                            field: fields[fieldName],
+                            selections: childSelections,
+                            modifySelections: _this8._modifyChildSelections,
+                            schema,
+                            getDefaultFieldNames,
+                            getDefaultScalarArgValue:
+                              _this8.props.getDefaultScalarArgValue,
+                            makeDefaultArg: _this8.props.makeDefaultArg,
+                            onRunOperation: _this8.props.onRunOperation,
+                            onCommit: _this8.props.onCommit,
+                            styleConfig: _this8.props.styleConfig,
+                            definition: _this8.props.definition,
+                            availableFragments: _this8.props.availableFragments,
+                          });
+                        })
+                    )
+                  : null
+              );
+            },
+          },
+        ]);
+        return AbstractView2;
+      })(React.PureComponent);
+      var FragmentView = (function (_React$PureComponent6) {
+        _inherits(FragmentView2, _React$PureComponent6);
+        function FragmentView2() {
+          var _ref11;
+          var _temp6, _this9, _ret6;
+          _classCallCheck(this, FragmentView2);
+          for (
+            var _len6 = arguments.length, args = Array(_len6), _key6 = 0;
+            _key6 < _len6;
+            _key6++
+          ) {
+            args[_key6] = arguments[_key6];
+          }
+          return (
+            (_ret6 =
+              ((_temp6 =
+                ((_this9 = _possibleConstructorReturn(
+                  this,
+                  (_ref11 =
+                    FragmentView2.__proto__ ||
+                    Object.getPrototypeOf(FragmentView2)).call.apply(
+                    _ref11,
+                    [this].concat(args)
+                  )
+                )),
+                _this9)),
+              (_this9._addFragment = function () {
+                _this9.props.modifySelections(
+                  [].concat(_toConsumableArray(_this9.props.selections), [
+                    _this9._previousSelection || {
+                      kind: "FragmentSpread",
+                      name: _this9.props.fragment.name,
+                    },
+                  ])
+                );
+              }),
+              (_this9._removeFragment = function () {
+                var thisSelection = _this9._getSelection();
+                _this9._previousSelection = thisSelection;
+                _this9.props.modifySelections(
+                  _this9.props.selections.filter(function (s) {
+                    var isTargetSelection =
+                      s.kind === "FragmentSpread" &&
+                      s.name.value === _this9.props.fragment.name.value;
+                    return !isTargetSelection;
+                  })
+                );
+              }),
+              (_this9._getSelection = function () {
+                var selection = _this9.props.selections.find(function (
+                  selection2
+                ) {
+                  return (
+                    selection2.kind === "FragmentSpread" &&
+                    selection2.name.value === _this9.props.fragment.name.value
+                  );
+                });
+                return selection;
+              }),
+              _temp6)),
+            _possibleConstructorReturn(_this9, _ret6)
+          );
+        }
+        _createClass(FragmentView2, [
+          {
+            key: "render",
+            value: function render() {
+              var styleConfig = this.props.styleConfig;
+              var selection = this._getSelection();
+              return React.createElement(
+                "div",
+                {
+                  className:
+                    "graphiql-explorer-" + this.props.fragment.name.value,
+                },
+                React.createElement(
+                  "span",
+                  {
+                    style: { cursor: "pointer" },
+                    onClick: selection
+                      ? this._removeFragment
+                      : this._addFragment,
+                  },
+                  React.createElement(Checkbox, {
+                    checked: !!selection,
+                    styleConfig: this.props.styleConfig,
+                  }),
+                  React.createElement(
+                    "span",
+                    {
+                      style: { color: styleConfig.colors.def },
+                      className:
+                        "graphiql-explorer-" + this.props.fragment.name.value,
+                    },
+                    this.props.fragment.name.value
+                  )
+                )
+              );
+            },
+          },
+        ]);
+        return FragmentView2;
+      })(React.PureComponent);
+      function defaultInputObjectFields(
+        getDefaultScalarArgValue,
+        makeDefaultArg,
+        parentField,
+        fields
+      ) {
+        var nodes = [];
+        var _iteratorNormalCompletion = true;
+        var _didIteratorError = false;
+        var _iteratorError = void 0;
+        try {
+          for (
+            var _iterator = fields[Symbol.iterator](), _step;
+            !(_iteratorNormalCompletion = (_step = _iterator.next()).done);
+            _iteratorNormalCompletion = true
+          ) {
+            var _field = _step.value;
+            if (
+              (0, _graphql.isRequiredInputField)(_field) ||
+              (makeDefaultArg && makeDefaultArg(parentField, _field))
+            ) {
+              var fieldType = unwrapInputType(_field.type);
+              if ((0, _graphql.isInputObjectType)(fieldType)) {
+                (function () {
+                  var fields2 = fieldType.getFields();
+                  nodes.push({
+                    kind: "ObjectField",
+                    name: { kind: "Name", value: _field.name },
+                    value: {
+                      kind: "ObjectValue",
+                      fields: defaultInputObjectFields(
+                        getDefaultScalarArgValue,
+                        makeDefaultArg,
+                        parentField,
+                        Object.keys(fields2).map(function (k) {
+                          return fields2[k];
+                        })
+                      ),
+                    },
+                  });
+                })();
+              } else if ((0, _graphql.isLeafType)(fieldType)) {
+                nodes.push({
+                  kind: "ObjectField",
+                  name: { kind: "Name", value: _field.name },
+                  value: getDefaultScalarArgValue(
+                    parentField,
+                    _field,
+                    fieldType
+                  ),
+                });
+              }
+            }
+          }
+        } catch (err) {
+          _didIteratorError = true;
+          _iteratorError = err;
+        } finally {
+          try {
+            if (!_iteratorNormalCompletion && _iterator.return) {
+              _iterator.return();
+            }
+          } finally {
+            if (_didIteratorError) {
+              throw _iteratorError;
+            }
+          }
+        }
+        return nodes;
+      }
+      function defaultArgs(getDefaultScalarArgValue, makeDefaultArg, field) {
+        var args = [];
+        var _iteratorNormalCompletion2 = true;
+        var _didIteratorError2 = false;
+        var _iteratorError2 = void 0;
+        try {
+          for (
+            var _iterator2 = field.args[Symbol.iterator](), _step2;
+            !(_iteratorNormalCompletion2 = (_step2 = _iterator2.next()).done);
+            _iteratorNormalCompletion2 = true
+          ) {
+            var _arg = _step2.value;
+            if (
+              isRequiredArgument(_arg) ||
+              (makeDefaultArg && makeDefaultArg(field, _arg))
+            ) {
+              var argType = unwrapInputType(_arg.type);
+              if ((0, _graphql.isInputObjectType)(argType)) {
+                (function () {
+                  var fields = argType.getFields();
+                  args.push({
+                    kind: "Argument",
+                    name: { kind: "Name", value: _arg.name },
+                    value: {
+                      kind: "ObjectValue",
+                      fields: defaultInputObjectFields(
+                        getDefaultScalarArgValue,
+                        makeDefaultArg,
+                        field,
+                        Object.keys(fields).map(function (k) {
+                          return fields[k];
+                        })
+                      ),
+                    },
+                  });
+                })();
+              } else if ((0, _graphql.isLeafType)(argType)) {
+                args.push({
+                  kind: "Argument",
+                  name: { kind: "Name", value: _arg.name },
+                  value: getDefaultScalarArgValue(field, _arg, argType),
+                });
+              }
+            }
+          }
+        } catch (err) {
+          _didIteratorError2 = true;
+          _iteratorError2 = err;
+        } finally {
+          try {
+            if (!_iteratorNormalCompletion2 && _iterator2.return) {
+              _iterator2.return();
+            }
+          } finally {
+            if (_didIteratorError2) {
+              throw _iteratorError2;
+            }
+          }
+        }
+        return args;
+      }
+      var FieldView = (function (_React$PureComponent7) {
+        _inherits(FieldView2, _React$PureComponent7);
+        function FieldView2() {
+          var _ref12;
+          var _temp7, _this10, _ret9;
+          _classCallCheck(this, FieldView2);
+          for (
+            var _len7 = arguments.length, args = Array(_len7), _key7 = 0;
+            _key7 < _len7;
+            _key7++
+          ) {
+            args[_key7] = arguments[_key7];
+          }
+          return (
+            (_ret9 =
+              ((_temp7 =
+                ((_this10 = _possibleConstructorReturn(
+                  this,
+                  (_ref12 =
+                    FieldView2.__proto__ ||
+                    Object.getPrototypeOf(FieldView2)).call.apply(
+                    _ref12,
+                    [this].concat(args)
+                  )
+                )),
+                _this10)),
+              (_this10.state = { displayFieldActions: false }),
+              (_this10._addAllFieldsToSelections = function (rawSubfields) {
+                var subFields = !!rawSubfields
+                  ? Object.keys(rawSubfields).map(function (fieldName) {
+                      return {
+                        kind: "Field",
+                        name: { kind: "Name", value: fieldName },
+                        arguments: [],
+                      };
+                    })
+                  : [];
+                var subSelectionSet = {
+                  kind: "SelectionSet",
+                  selections: subFields,
+                };
+                var nextSelections = [].concat(
+                  _toConsumableArray(
+                    _this10.props.selections.filter(function (selection) {
+                      if (selection.kind === "InlineFragment") {
+                        return true;
+                      } else {
+                        return (
+                          selection.name.value !== _this10.props.field.name
+                        );
+                      }
+                    })
+                  ),
+                  [
+                    {
+                      kind: "Field",
+                      name: { kind: "Name", value: _this10.props.field.name },
+                      arguments: defaultArgs(
+                        _this10.props.getDefaultScalarArgValue,
+                        _this10.props.makeDefaultArg,
+                        _this10.props.field
+                      ),
+                      selectionSet: subSelectionSet,
+                    },
+                  ]
+                );
+                _this10.props.modifySelections(nextSelections);
+              }),
+              (_this10._addFieldToSelections = function (rawSubfields) {
+                var nextSelections = [].concat(
+                  _toConsumableArray(_this10.props.selections),
+                  [
+                    _this10._previousSelection || {
+                      kind: "Field",
+                      name: { kind: "Name", value: _this10.props.field.name },
+                      arguments: defaultArgs(
+                        _this10.props.getDefaultScalarArgValue,
+                        _this10.props.makeDefaultArg,
+                        _this10.props.field
+                      ),
+                    },
+                  ]
+                );
+                _this10.props.modifySelections(nextSelections);
+              }),
+              (_this10._handleUpdateSelections = function (event) {
+                var selection = _this10._getSelection();
+                if (selection && !event.altKey) {
+                  _this10._removeFieldFromSelections();
+                } else {
+                  var fieldType = (0, _graphql.getNamedType)(
+                    _this10.props.field.type
+                  );
+                  var rawSubfields =
+                    (0, _graphql.isObjectType)(fieldType) &&
+                    fieldType.getFields();
+                  var shouldSelectAllSubfields = !!rawSubfields && event.altKey;
+                  shouldSelectAllSubfields
+                    ? _this10._addAllFieldsToSelections(rawSubfields)
+                    : _this10._addFieldToSelections(rawSubfields);
+                }
+              }),
+              (_this10._removeFieldFromSelections = function () {
+                var previousSelection = _this10._getSelection();
+                _this10._previousSelection = previousSelection;
+                _this10.props.modifySelections(
+                  _this10.props.selections.filter(function (selection) {
+                    return selection !== previousSelection;
+                  })
+                );
+              }),
+              (_this10._getSelection = function () {
+                var selection = _this10.props.selections.find(function (
+                  selection2
+                ) {
+                  return (
+                    selection2.kind === "Field" &&
+                    _this10.props.field.name === selection2.name.value
+                  );
+                });
+                if (!selection) {
+                  return null;
+                }
+                if (selection.kind === "Field") {
+                  return selection;
+                }
+              }),
+              (_this10._setArguments = function (argumentNodes, options) {
+                var selection = _this10._getSelection();
+                if (!selection) {
+                  console.error(
+                    "Missing selection when setting arguments",
+                    argumentNodes
+                  );
+                  return;
+                }
+                return _this10.props.modifySelections(
+                  _this10.props.selections.map(function (s) {
+                    return s === selection
+                      ? {
+                          alias: selection.alias,
+                          arguments: argumentNodes,
+                          directives: selection.directives,
+                          kind: "Field",
+                          name: selection.name,
+                          selectionSet: selection.selectionSet,
+                        }
+                      : s;
+                  }),
+                  options
+                );
+              }),
+              (_this10._modifyChildSelections = function (selections, options) {
+                return _this10.props.modifySelections(
+                  _this10.props.selections.map(function (selection) {
+                    if (
+                      selection.kind === "Field" &&
+                      _this10.props.field.name === selection.name.value
+                    ) {
+                      if (selection.kind !== "Field") {
+                        throw new Error("invalid selection");
+                      }
+                      return {
+                        alias: selection.alias,
+                        arguments: selection.arguments,
+                        directives: selection.directives,
+                        kind: "Field",
+                        name: selection.name,
+                        selectionSet: {
+                          kind: "SelectionSet",
+                          selections,
+                        },
+                      };
+                    }
+                    return selection;
+                  }),
+                  options
+                );
+              }),
+              _temp7)),
+            _possibleConstructorReturn(_this10, _ret9)
+          );
+        }
+        _createClass(FieldView2, [
+          {
+            key: "render",
+            value: function render() {
+              var _this11 = this;
+              var _props6 = this.props,
+                field = _props6.field,
+                schema = _props6.schema,
+                getDefaultFieldNames = _props6.getDefaultFieldNames,
+                styleConfig = _props6.styleConfig;
+              var selection = this._getSelection();
+              var type2 = unwrapOutputType(field.type);
+              var args = field.args.sort(function (a, b) {
+                return a.name.localeCompare(b.name);
+              });
+              var className =
+                "graphiql-explorer-node graphiql-explorer-" + field.name;
+              if (field.isDeprecated) {
+                className += " graphiql-explorer-deprecated";
+              }
+              var applicableFragments =
+                (0, _graphql.isObjectType)(type2) ||
+                (0, _graphql.isInterfaceType)(type2) ||
+                (0, _graphql.isUnionType)(type2)
+                  ? this.props.availableFragments &&
+                    this.props.availableFragments[type2.name]
+                  : null;
+              var node = React.createElement(
+                "div",
+                { className },
+                React.createElement(
+                  "span",
+                  {
+                    title: field.description,
+                    style: {
+                      cursor: "pointer",
+                      display: "inline-flex",
+                      alignItems: "center",
+                      minHeight: "16px",
+                      WebkitUserSelect: "none",
+                      userSelect: "none",
+                    },
+                    "data-field-name": field.name,
+                    "data-field-type": type2.name,
+                    onClick: this._handleUpdateSelections,
+                    onMouseEnter: function onMouseEnter() {
+                      var containsMeaningfulSubselection =
+                        (0, _graphql.isObjectType)(type2) &&
+                        selection &&
+                        selection.selectionSet &&
+                        selection.selectionSet.selections.filter(function (
+                          selection2
+                        ) {
+                          return selection2.kind !== "FragmentSpread";
+                        }).length > 0;
+                      if (containsMeaningfulSubselection) {
+                        _this11.setState({ displayFieldActions: true });
+                      }
+                    },
+                    onMouseLeave: function onMouseLeave() {
+                      return _this11.setState({ displayFieldActions: false });
+                    },
+                  },
+                  (0, _graphql.isObjectType)(type2)
+                    ? React.createElement(
+                        "span",
+                        null,
+                        !!selection
+                          ? this.props.styleConfig.arrowOpen
+                          : this.props.styleConfig.arrowClosed
+                      )
+                    : null,
+                  (0, _graphql.isObjectType)(type2)
+                    ? null
+                    : React.createElement(Checkbox, {
+                        checked: !!selection,
+                        styleConfig: this.props.styleConfig,
+                      }),
+                  React.createElement(
+                    "span",
+                    {
+                      style: { color: styleConfig.colors.property },
+                      className: "graphiql-explorer-field-view",
+                    },
+                    field.name
+                  ),
+                  !this.state.displayFieldActions
+                    ? null
+                    : React.createElement(
+                        "button",
+                        {
+                          type: "submit",
+                          className: "toolbar-button",
+                          title:
+                            "Extract selections into a new reusable fragment",
+                          onClick: function onClick(event) {
+                            event.preventDefault();
+                            event.stopPropagation();
+                            var typeName = type2.name;
+                            var newFragmentName = typeName + "Fragment";
+                            var conflictingNameCount = (
+                              applicableFragments || []
+                            ).filter(function (fragment) {
+                              return fragment.name.value.startsWith(
+                                newFragmentName
+                              );
+                            }).length;
+                            if (conflictingNameCount > 0) {
+                              newFragmentName =
+                                "" + newFragmentName + conflictingNameCount;
+                            }
+                            var childSelections2 = selection
+                              ? selection.selectionSet
+                                ? selection.selectionSet.selections
+                                : []
+                              : [];
+                            var nextSelections = [
+                              {
+                                kind: "FragmentSpread",
+                                name: {
+                                  kind: "Name",
+                                  value: newFragmentName,
+                                },
+                                directives: [],
+                              },
+                            ];
+                            var newFragmentDefinition = {
+                              kind: "FragmentDefinition",
+                              name: {
+                                kind: "Name",
+                                value: newFragmentName,
+                              },
+                              typeCondition: {
+                                kind: "NamedType",
+                                name: {
+                                  kind: "Name",
+                                  value: type2.name,
+                                },
+                              },
+                              directives: [],
+                              selectionSet: {
+                                kind: "SelectionSet",
+                                selections: childSelections2,
+                              },
+                            };
+                            var newDoc = _this11._modifyChildSelections(
+                              nextSelections,
+                              false
+                            );
+                            if (newDoc) {
+                              var newDocWithFragment = _extends({}, newDoc, {
+                                definitions: [].concat(
+                                  _toConsumableArray(newDoc.definitions),
+                                  [newFragmentDefinition]
+                                ),
+                              });
+                              _this11.props.onCommit(newDocWithFragment);
+                            } else {
+                              console.warn(
+                                "Unable to complete extractFragment operation"
+                              );
+                            }
+                          },
+                          style: _extends(
+                            {},
+                            styleConfig.styles.actionButtonStyle
+                          ),
+                        },
+                        React.createElement("span", null, "\u2026")
+                      )
+                ),
+                selection && args.length
+                  ? React.createElement(
+                      "div",
+                      {
+                        style: { marginLeft: 16 },
+                        className: "graphiql-explorer-graphql-arguments",
+                      },
+                      args.map(function (arg) {
+                        return React.createElement(ArgView, {
+                          key: arg.name,
+                          parentField: field,
+                          arg,
+                          selection,
+                          modifyArguments: _this11._setArguments,
+                          getDefaultScalarArgValue:
+                            _this11.props.getDefaultScalarArgValue,
+                          makeDefaultArg: _this11.props.makeDefaultArg,
+                          onRunOperation: _this11.props.onRunOperation,
+                          styleConfig: _this11.props.styleConfig,
+                          onCommit: _this11.props.onCommit,
+                          definition: _this11.props.definition,
+                        });
+                      })
+                    )
+                  : null
+              );
+              if (
+                selection &&
+                ((0, _graphql.isObjectType)(type2) ||
+                  (0, _graphql.isInterfaceType)(type2) ||
+                  (0, _graphql.isUnionType)(type2))
+              ) {
+                var _fields4 = (0, _graphql.isUnionType)(type2)
+                  ? {}
+                  : type2.getFields();
+                var childSelections = selection
+                  ? selection.selectionSet
+                    ? selection.selectionSet.selections
+                    : []
+                  : [];
+                return React.createElement(
+                  "div",
+                  { className: "graphiql-explorer-" + field.name },
+                  node,
+                  React.createElement(
+                    "div",
+                    { style: { marginLeft: 16 } },
+                    !!applicableFragments
+                      ? applicableFragments.map(function (fragment) {
+                          var type3 = schema.getType(
+                            fragment.typeCondition.name.value
+                          );
+                          var fragmentName = fragment.name.value;
+                          return !type3
+                            ? null
+                            : React.createElement(FragmentView, {
+                                key: fragmentName,
+                                fragment,
+                                selections: childSelections,
+                                modifySelections:
+                                  _this11._modifyChildSelections,
+                                schema,
+                                styleConfig: _this11.props.styleConfig,
+                                onCommit: _this11.props.onCommit,
+                              });
+                        })
+                      : null,
+                    Object.keys(_fields4)
+                      .sort()
+                      .map(function (fieldName) {
+                        return React.createElement(FieldView2, {
+                          key: fieldName,
+                          field: _fields4[fieldName],
+                          selections: childSelections,
+                          modifySelections: _this11._modifyChildSelections,
+                          schema,
+                          getDefaultFieldNames,
+                          getDefaultScalarArgValue:
+                            _this11.props.getDefaultScalarArgValue,
+                          makeDefaultArg: _this11.props.makeDefaultArg,
+                          onRunOperation: _this11.props.onRunOperation,
+                          styleConfig: _this11.props.styleConfig,
+                          onCommit: _this11.props.onCommit,
+                          definition: _this11.props.definition,
+                          availableFragments: _this11.props.availableFragments,
+                        });
+                      }),
+                    (0, _graphql.isInterfaceType)(type2) ||
+                      (0, _graphql.isUnionType)(type2)
+                      ? schema.getPossibleTypes(type2).map(function (type3) {
+                          return React.createElement(AbstractView, {
+                            key: type3.name,
+                            implementingType: type3,
+                            selections: childSelections,
+                            modifySelections: _this11._modifyChildSelections,
+                            schema,
+                            getDefaultFieldNames,
+                            getDefaultScalarArgValue:
+                              _this11.props.getDefaultScalarArgValue,
+                            makeDefaultArg: _this11.props.makeDefaultArg,
+                            onRunOperation: _this11.props.onRunOperation,
+                            styleConfig: _this11.props.styleConfig,
+                            onCommit: _this11.props.onCommit,
+                            definition: _this11.props.definition,
+                          });
+                        })
+                      : null
+                  )
+                );
+              }
+              return node;
+            },
+          },
+        ]);
+        return FieldView2;
+      })(React.PureComponent);
+      function parseQuery(text3) {
+        try {
+          if (!text3.trim()) {
+            return null;
+          }
+          return (0, _graphql.parse)(text3, { noLocation: true });
+        } catch (e) {
+          return new Error(e);
+        }
+      }
+      var DEFAULT_OPERATION = {
+        kind: "OperationDefinition",
+        operation: "query",
+        variableDefinitions: [],
+        name: { kind: "Name", value: "MyQuery" },
+        directives: [],
+        selectionSet: {
+          kind: "SelectionSet",
+          selections: [],
+        },
+      };
+      var DEFAULT_DOCUMENT = {
+        kind: "Document",
+        definitions: [DEFAULT_OPERATION],
+      };
+      var parseQueryMemoize = null;
+      function memoizeParseQuery(query) {
+        if (parseQueryMemoize && parseQueryMemoize[0] === query) {
+          return parseQueryMemoize[1];
+        } else {
+          var result2 = parseQuery(query);
+          if (!result2) {
+            return DEFAULT_DOCUMENT;
+          } else if (result2 instanceof Error) {
+            if (parseQueryMemoize) {
+              return parseQueryMemoize[1];
+            } else {
+              return DEFAULT_DOCUMENT;
+            }
+          } else {
+            parseQueryMemoize = [query, result2];
+            return result2;
+          }
+        }
+      }
+      var defaultStyles = {
+        buttonStyle: {
+          fontSize: "1.2em",
+          padding: "0px",
+          backgroundColor: "white",
+          border: "none",
+          margin: "5px 0px",
+          height: "40px",
+          width: "100%",
+          display: "block",
+          maxWidth: "none",
+        },
+        actionButtonStyle: {
+          padding: "0px",
+          backgroundColor: "white",
+          border: "none",
+          margin: "0px",
+          maxWidth: "none",
+          height: "15px",
+          width: "15px",
+          display: "inline-block",
+          fontSize: "smaller",
+        },
+        explorerActionsStyle: {
+          margin: "4px -8px -8px",
+          paddingLeft: "8px",
+          bottom: "0px",
+          width: "100%",
+          textAlign: "center",
+          background: "none",
+          borderTop: "none",
+          borderBottom: "none",
+        },
+      };
+      var RootView = (function (_React$PureComponent8) {
+        _inherits(RootView2, _React$PureComponent8);
+        function RootView2() {
+          var _ref13;
+          var _temp8, _this12, _ret10;
+          _classCallCheck(this, RootView2);
+          for (
+            var _len8 = arguments.length, args = Array(_len8), _key8 = 0;
+            _key8 < _len8;
+            _key8++
+          ) {
+            args[_key8] = arguments[_key8];
+          }
+          return (
+            (_ret10 =
+              ((_temp8 =
+                ((_this12 = _possibleConstructorReturn(
+                  this,
+                  (_ref13 =
+                    RootView2.__proto__ ||
+                    Object.getPrototypeOf(RootView2)).call.apply(
+                    _ref13,
+                    [this].concat(args)
+                  )
+                )),
+                _this12)),
+              (_this12.state = {
+                newOperationType: "query",
+                displayTitleActions: false,
+              }),
+              (_this12._modifySelections = function (selections, options) {
+                var operationDef = _this12.props.definition;
+                if (
+                  operationDef.selectionSet.selections.length === 0 &&
+                  _this12._previousOperationDef
+                ) {
+                  operationDef = _this12._previousOperationDef;
+                }
+                var newOperationDef = void 0;
+                if (operationDef.kind === "FragmentDefinition") {
+                  newOperationDef = _extends({}, operationDef, {
+                    selectionSet: _extends({}, operationDef.selectionSet, {
+                      selections,
+                    }),
+                  });
+                } else if (operationDef.kind === "OperationDefinition") {
+                  var cleanedSelections = selections.filter(function (
+                    selection
+                  ) {
+                    return !(
+                      selection.kind === "Field" &&
+                      selection.name.value === "__typename"
+                    );
+                  });
+                  if (cleanedSelections.length === 0) {
+                    cleanedSelections = [
+                      {
+                        kind: "Field",
+                        name: {
+                          kind: "Name",
+                          value: "__typename ## Placeholder value",
+                        },
+                      },
+                    ];
+                  }
+                  newOperationDef = _extends({}, operationDef, {
+                    selectionSet: _extends({}, operationDef.selectionSet, {
+                      selections: cleanedSelections,
+                    }),
+                  });
+                }
+                return _this12.props.onEdit(newOperationDef, options);
+              }),
+              (_this12._onOperationRename = function (event) {
+                return _this12.props.onOperationRename(event.target.value);
+              }),
+              (_this12._handlePotentialRun = function (event) {
+                if (
+                  isRunShortcut(event) &&
+                  canRunOperation(_this12.props.definition.kind)
+                ) {
+                  _this12.props.onRunOperation(_this12.props.name);
+                }
+              }),
+              (_this12._rootViewElId = function () {
+                var _this12$props = _this12.props,
+                  operationType = _this12$props.operationType,
+                  name2 = _this12$props.name;
+                var rootViewElId = operationType + "-" + (name2 || "unknown");
+                return rootViewElId;
+              }),
+              _temp8)),
+            _possibleConstructorReturn(_this12, _ret10)
+          );
+        }
+        _createClass(RootView2, [
+          {
+            key: "componentDidMount",
+            value: function componentDidMount() {
+              var rootViewElId = this._rootViewElId();
+              this.props.onMount(rootViewElId);
+            },
+          },
+          {
+            key: "render",
+            value: function render() {
+              var _this13 = this;
+              var _props7 = this.props,
+                operationType = _props7.operationType,
+                definition = _props7.definition,
+                schema = _props7.schema,
+                getDefaultFieldNames = _props7.getDefaultFieldNames,
+                styleConfig = _props7.styleConfig;
+              var rootViewElId = this._rootViewElId();
+              var fields = this.props.fields || {};
+              var operationDef = definition;
+              var selections = operationDef.selectionSet.selections;
+              var operationDisplayName =
+                this.props.name || capitalize(operationType) + " Name";
+              return React.createElement(
+                "div",
+                {
+                  id: rootViewElId,
+                  tabIndex: "0",
+                  onKeyDown: this._handlePotentialRun,
+                  style: {
+                    borderBottom: this.props.isLast
+                      ? "none"
+                      : "1px solid #d6d6d6",
+                    marginBottom: "0em",
+                    paddingBottom: "1em",
+                  },
+                },
+                React.createElement(
+                  "div",
+                  {
+                    style: {
+                      color: styleConfig.colors.keyword,
+                      paddingBottom: 4,
+                    },
+                    className: "graphiql-operation-title-bar",
+                    onMouseEnter: function onMouseEnter() {
+                      return _this13.setState({ displayTitleActions: true });
+                    },
+                    onMouseLeave: function onMouseLeave() {
+                      return _this13.setState({ displayTitleActions: false });
+                    },
+                  },
+                  operationType,
+                  " ",
+                  React.createElement(
+                    "span",
+                    { style: { color: styleConfig.colors.def } },
+                    React.createElement("input", {
+                      style: {
+                        color: styleConfig.colors.def,
+                        border: "none",
+                        borderBottom: "1px solid #888",
+                        outline: "none",
+                        width: Math.max(4, operationDisplayName.length) + "ch",
+                      },
+                      autoComplete: "false",
+                      placeholder: capitalize(operationType) + " Name",
+                      value: this.props.name,
+                      onKeyDown: this._handlePotentialRun,
+                      onChange: this._onOperationRename,
+                    })
+                  ),
+                  !!this.props.onTypeName
+                    ? React.createElement(
+                        "span",
+                        null,
+                        React.createElement("br", null),
+                        "on " + this.props.onTypeName
+                      )
+                    : "",
+                  !!this.state.displayTitleActions
+                    ? React.createElement(
+                        React.Fragment,
+                        null,
+                        React.createElement(
+                          "button",
+                          {
+                            type: "submit",
+                            className: "toolbar-button",
+                            onClick: function onClick() {
+                              return _this13.props.onOperationDestroy();
+                            },
+                            style: _extends(
+                              {},
+                              styleConfig.styles.actionButtonStyle
+                            ),
+                          },
+                          React.createElement("span", null, "\u2715")
+                        ),
+                        React.createElement(
+                          "button",
+                          {
+                            type: "submit",
+                            className: "toolbar-button",
+                            onClick: function onClick() {
+                              return _this13.props.onOperationClone();
+                            },
+                            style: _extends(
+                              {},
+                              styleConfig.styles.actionButtonStyle
+                            ),
+                          },
+                          React.createElement("span", null, "\u2398")
+                        )
+                      )
+                    : ""
+                ),
+                Object.keys(fields)
+                  .sort()
+                  .map(function (fieldName) {
+                    return React.createElement(FieldView, {
+                      key: fieldName,
+                      field: fields[fieldName],
+                      selections,
+                      modifySelections: _this13._modifySelections,
+                      schema,
+                      getDefaultFieldNames,
+                      getDefaultScalarArgValue:
+                        _this13.props.getDefaultScalarArgValue,
+                      makeDefaultArg: _this13.props.makeDefaultArg,
+                      onRunOperation: _this13.props.onRunOperation,
+                      styleConfig: _this13.props.styleConfig,
+                      onCommit: _this13.props.onCommit,
+                      definition: _this13.props.definition,
+                      availableFragments: _this13.props.availableFragments,
+                    });
+                  })
+              );
+            },
+          },
+        ]);
+        return RootView2;
+      })(React.PureComponent);
+      function Attribution() {
+        return React.createElement(
+          "div",
+          {
+            style: {
+              fontFamily: "sans-serif",
+              display: "flex",
+              flexDirection: "column",
+              alignItems: "center",
+              margin: "1em",
+              marginTop: 0,
+              flexGrow: 1,
+              justifyContent: "flex-end",
+            },
+          },
+          React.createElement(
+            "div",
+            {
+              style: {
+                borderTop: "1px solid #d6d6d6",
+                paddingTop: "1em",
+                width: "100%",
+                textAlign: "center",
+              },
+            },
+            "GraphiQL Explorer by ",
+            React.createElement(
+              "a",
+              { href: "https://www.onegraph.com" },
+              "OneGraph"
+            )
+          ),
+          React.createElement(
+            "div",
+            null,
+            "Contribute on",
+            " ",
+            React.createElement(
+              "a",
+              { href: "https://github.com/OneGraph/graphiql-explorer" },
+              "GitHub"
+            )
+          )
+        );
+      }
+      var Explorer = (function (_React$PureComponent9) {
+        _inherits(Explorer2, _React$PureComponent9);
+        function Explorer2() {
+          var _ref14;
+          var _temp9, _this14, _ret11;
+          _classCallCheck(this, Explorer2);
+          for (
+            var _len9 = arguments.length, args = Array(_len9), _key9 = 0;
+            _key9 < _len9;
+            _key9++
+          ) {
+            args[_key9] = arguments[_key9];
+          }
+          return (
+            (_ret11 =
+              ((_temp9 =
+                ((_this14 = _possibleConstructorReturn(
+                  this,
+                  (_ref14 =
+                    Explorer2.__proto__ ||
+                    Object.getPrototypeOf(Explorer2)).call.apply(
+                    _ref14,
+                    [this].concat(args)
+                  )
+                )),
+                _this14)),
+              (_this14.state = {
+                newOperationType: "query",
+                operation: null,
+                operationToScrollTo: null,
+              }),
+              (_this14._resetScroll = function () {
+                var container = _this14._ref;
+                if (container) {
+                  container.scrollLeft = 0;
+                }
+              }),
+              (_this14._onEdit = function (query) {
+                return _this14.props.onEdit(query);
+              }),
+              (_this14._setAddOperationType = function (value) {
+                _this14.setState({ newOperationType: value });
+              }),
+              (_this14._handleRootViewMount = function (rootViewElId) {
+                if (
+                  !!_this14.state.operationToScrollTo &&
+                  _this14.state.operationToScrollTo === rootViewElId
+                ) {
+                  var selector = ".graphiql-explorer-root #" + rootViewElId;
+                  var el2 = document.querySelector(selector);
+                  el2 && el2.scrollIntoView();
+                }
+              }),
+              _temp9)),
+            _possibleConstructorReturn(_this14, _ret11)
+          );
+        }
+        _createClass(Explorer2, [
+          {
+            key: "componentDidMount",
+            value: function componentDidMount() {
+              this._resetScroll();
+            },
+          },
+          {
+            key: "render",
+            value: function render() {
+              var _this15 = this;
+              var _props8 = this.props,
+                schema = _props8.schema,
+                query = _props8.query,
+                makeDefaultArg = _props8.makeDefaultArg;
+              if (!schema) {
+                return React.createElement(
+                  "div",
+                  {
+                    style: { fontFamily: "sans-serif" },
+                    className: "error-container",
+                  },
+                  "No Schema Available"
+                );
+              }
+              var styleConfig = {
+                colors: this.props.colors || defaultColors,
+                checkboxChecked:
+                  this.props.checkboxChecked || defaultCheckboxChecked,
+                checkboxUnchecked:
+                  this.props.checkboxUnchecked || defaultCheckboxUnchecked,
+                arrowClosed: this.props.arrowClosed || defaultArrowClosed,
+                arrowOpen: this.props.arrowOpen || defaultArrowOpen,
+                styles: this.props.styles
+                  ? _extends({}, defaultStyles, this.props.styles)
+                  : defaultStyles,
+              };
+              var queryType = schema.getQueryType();
+              var mutationType = schema.getMutationType();
+              var subscriptionType = schema.getSubscriptionType();
+              if (!queryType && !mutationType && !subscriptionType) {
+                return React.createElement("div", null, "Missing query type");
+              }
+              var queryFields = queryType && queryType.getFields();
+              var mutationFields = mutationType && mutationType.getFields();
+              var subscriptionFields =
+                subscriptionType && subscriptionType.getFields();
+              var parsedQuery = memoizeParseQuery(query);
+              var getDefaultFieldNames =
+                this.props.getDefaultFieldNames || defaultGetDefaultFieldNames;
+              var getDefaultScalarArgValue =
+                this.props.getDefaultScalarArgValue ||
+                defaultGetDefaultScalarArgValue;
+              var definitions = parsedQuery.definitions;
+              var _relevantOperations = definitions
+                .map(function (definition) {
+                  if (definition.kind === "FragmentDefinition") {
+                    return definition;
+                  } else if (definition.kind === "OperationDefinition") {
+                    return definition;
+                  } else {
+                    return null;
+                  }
+                })
+                .filter(Boolean);
+              var relevantOperations =
+                _relevantOperations.length === 0
+                  ? DEFAULT_DOCUMENT.definitions
+                  : _relevantOperations;
+              var renameOperation = function renameOperation2(
+                targetOperation,
+                name2
+              ) {
+                var newName =
+                  name2 == null || name2 === ""
+                    ? null
+                    : { kind: "Name", value: name2, loc: void 0 };
+                var newOperation = _extends({}, targetOperation, {
+                  name: newName,
+                });
+                var existingDefs = parsedQuery.definitions;
+                var newDefinitions = existingDefs.map(function (
+                  existingOperation
+                ) {
+                  if (targetOperation === existingOperation) {
+                    return newOperation;
+                  } else {
+                    return existingOperation;
+                  }
+                });
+                return _extends({}, parsedQuery, {
+                  definitions: newDefinitions,
+                });
+              };
+              var cloneOperation = function cloneOperation2(targetOperation) {
+                var kind2 = void 0;
+                if (targetOperation.kind === "FragmentDefinition") {
+                  kind2 = "fragment";
+                } else {
+                  kind2 = targetOperation.operation;
+                }
+                var newOperationName =
+                  ((targetOperation.name && targetOperation.name.value) || "") +
+                  "Copy";
+                var newName = {
+                  kind: "Name",
+                  value: newOperationName,
+                  loc: void 0,
+                };
+                var newOperation = _extends({}, targetOperation, {
+                  name: newName,
+                });
+                var existingDefs = parsedQuery.definitions;
+                var newDefinitions = [].concat(
+                  _toConsumableArray(existingDefs),
+                  [newOperation]
+                );
+                _this15.setState({
+                  operationToScrollTo: kind2 + "-" + newOperationName,
+                });
+                return _extends({}, parsedQuery, {
+                  definitions: newDefinitions,
+                });
+              };
+              var destroyOperation = function destroyOperation2(
+                targetOperation
+              ) {
+                var existingDefs = parsedQuery.definitions;
+                var newDefinitions = existingDefs.filter(function (
+                  existingOperation
+                ) {
+                  if (targetOperation === existingOperation) {
+                    return false;
+                  } else {
+                    return true;
+                  }
+                });
+                return _extends({}, parsedQuery, {
+                  definitions: newDefinitions,
+                });
+              };
+              var addOperation = function addOperation2(kind2) {
+                var existingDefs = parsedQuery.definitions;
+                var viewingDefaultOperation =
+                  parsedQuery.definitions.length === 1 &&
+                  parsedQuery.definitions[0] ===
+                    DEFAULT_DOCUMENT.definitions[0];
+                var MySiblingDefs = viewingDefaultOperation
+                  ? []
+                  : existingDefs.filter(function (def) {
+                      if (def.kind === "OperationDefinition") {
+                        return def.operation === kind2;
+                      } else {
+                        return false;
+                      }
+                    });
+                var newOperationName =
+                  "My" +
+                  capitalize(kind2) +
+                  (MySiblingDefs.length === 0 ? "" : MySiblingDefs.length + 1);
+                var firstFieldName = "__typename # Placeholder value";
+                var selectionSet = {
+                  kind: "SelectionSet",
+                  selections: [
+                    {
+                      kind: "Field",
+                      name: {
+                        kind: "Name",
+                        value: firstFieldName,
+                        loc: null,
+                      },
+                      arguments: [],
+                      directives: [],
+                      selectionSet: null,
+                      loc: null,
+                    },
+                  ],
+                  loc: null,
+                };
+                var newDefinition = {
+                  kind: "OperationDefinition",
+                  operation: kind2,
+                  name: { kind: "Name", value: newOperationName },
+                  variableDefinitions: [],
+                  directives: [],
+                  selectionSet,
+                  loc: null,
+                };
+                var newDefinitions = viewingDefaultOperation
+                  ? [newDefinition]
+                  : [].concat(_toConsumableArray(parsedQuery.definitions), [
+                      newDefinition,
+                    ]);
+                var newOperationDef = _extends({}, parsedQuery, {
+                  definitions: newDefinitions,
+                });
+                _this15.setState({
+                  operationToScrollTo: kind2 + "-" + newOperationName,
+                });
+                _this15.props.onEdit((0, _graphql.print)(newOperationDef));
+              };
+              var actionsOptions = [
+                !!queryFields
+                  ? React.createElement(
+                      "option",
+                      {
+                        key: "query",
+                        className: "toolbar-button",
+                        style: styleConfig.styles.buttonStyle,
+                        type: "link",
+                        value: "query",
+                      },
+                      "Query"
+                    )
+                  : null,
+                !!mutationFields
+                  ? React.createElement(
+                      "option",
+                      {
+                        key: "mutation",
+                        className: "toolbar-button",
+                        style: styleConfig.styles.buttonStyle,
+                        type: "link",
+                        value: "mutation",
+                      },
+                      "Mutation"
+                    )
+                  : null,
+                !!subscriptionFields
+                  ? React.createElement(
+                      "option",
+                      {
+                        key: "subscription",
+                        className: "toolbar-button",
+                        style: styleConfig.styles.buttonStyle,
+                        type: "link",
+                        value: "subscription",
+                      },
+                      "Subscription"
+                    )
+                  : null,
+              ].filter(Boolean);
+              var actionsEl =
+                actionsOptions.length === 0 || this.props.hideActions
+                  ? null
+                  : React.createElement(
+                      "div",
+                      {
+                        style: {
+                          minHeight: "50px",
+                          maxHeight: "50px",
+                          overflow: "none",
+                        },
+                      },
+                      React.createElement(
+                        "form",
+                        {
+                          className:
+                            "variable-editor-title graphiql-explorer-actions",
+                          style: _extends(
+                            {},
+                            styleConfig.styles.explorerActionsStyle,
+                            {
+                              display: "flex",
+                              flexDirection: "row",
+                              alignItems: "center",
+                              borderTop: "1px solid rgb(214, 214, 214)",
+                            }
+                          ),
+                          onSubmit: function onSubmit(event) {
+                            return event.preventDefault();
+                          },
+                        },
+                        React.createElement(
+                          "span",
+                          {
+                            style: {
+                              display: "inline-block",
+                              flexGrow: "0",
+                              textAlign: "right",
+                            },
+                          },
+                          "Add new",
+                          " "
+                        ),
+                        React.createElement(
+                          "select",
+                          {
+                            onChange: function onChange(event) {
+                              return _this15._setAddOperationType(
+                                event.target.value
+                              );
+                            },
+                            value: this.state.newOperationType,
+                            style: { flexGrow: "2" },
+                          },
+                          actionsOptions
+                        ),
+                        React.createElement(
+                          "button",
+                          {
+                            type: "submit",
+                            className: "toolbar-button",
+                            onClick: function onClick() {
+                              return _this15.state.newOperationType
+                                ? addOperation(_this15.state.newOperationType)
+                                : null;
+                            },
+                            style: _extends(
+                              {},
+                              styleConfig.styles.buttonStyle,
+                              {
+                                height: "22px",
+                                width: "22px",
+                              }
+                            ),
+                          },
+                          React.createElement("span", null, "+")
+                        )
+                      )
+                    );
+              var externalFragments =
+                this.props.externalFragments &&
+                this.props.externalFragments.reduce(function (acc, fragment) {
+                  if (fragment.kind === "FragmentDefinition") {
+                    var fragmentTypeName = fragment.typeCondition.name.value;
+                    var existingFragmentsForType = acc[fragmentTypeName] || [];
+                    var newFragmentsForType = []
+                      .concat(_toConsumableArray(existingFragmentsForType), [
+                        fragment,
+                      ])
+                      .sort(function (a, b) {
+                        return a.name.value.localeCompare(b.name.value);
+                      });
+                    return _extends(
+                      {},
+                      acc,
+                      _defineProperty({}, fragmentTypeName, newFragmentsForType)
+                    );
+                  }
+                  return acc;
+                }, {});
+              var documentFragments = relevantOperations.reduce(function (
+                acc,
+                operation
+              ) {
+                if (operation.kind === "FragmentDefinition") {
+                  var fragmentTypeName = operation.typeCondition.name.value;
+                  var existingFragmentsForType = acc[fragmentTypeName] || [];
+                  var newFragmentsForType = []
+                    .concat(_toConsumableArray(existingFragmentsForType), [
+                      operation,
+                    ])
+                    .sort(function (a, b) {
+                      return a.name.value.localeCompare(b.name.value);
+                    });
+                  return _extends(
+                    {},
+                    acc,
+                    _defineProperty({}, fragmentTypeName, newFragmentsForType)
+                  );
+                }
+                return acc;
+              },
+              {});
+              var availableFragments = _extends(
+                {},
+                documentFragments,
+                externalFragments
+              );
+              var attribution = this.props.showAttribution
+                ? React.createElement(Attribution, null)
+                : null;
+              return React.createElement(
+                "div",
+                {
+                  ref: function ref(_ref15) {
+                    _this15._ref = _ref15;
+                  },
+                  style: {
+                    fontSize: 12,
+                    textOverflow: "ellipsis",
+                    whiteSpace: "nowrap",
+                    margin: 0,
+                    padding: 8,
+                    fontFamily:
+                      'Consolas, Inconsolata, "Droid Sans Mono", Monaco, monospace',
+                    display: "flex",
+                    flexDirection: "column",
+                    height: "100%",
+                  },
+                  className: "graphiql-explorer-root",
+                },
+                React.createElement(
+                  "div",
+                  {
+                    style: {
+                      flexGrow: "1",
+                      overflow: "scroll",
+                    },
+                  },
+                  relevantOperations.map(function (operation, index) {
+                    var operationName =
+                      operation && operation.name && operation.name.value;
+                    var operationType =
+                      operation.kind === "FragmentDefinition"
+                        ? "fragment"
+                        : (operation && operation.operation) || "query";
+                    var onOperationRename = function onOperationRename2(
+                      newName
+                    ) {
+                      var newOperationDef = renameOperation(operation, newName);
+                      _this15.props.onEdit(
+                        (0, _graphql.print)(newOperationDef)
+                      );
+                    };
+                    var onOperationClone = function onOperationClone2() {
+                      var newOperationDef = cloneOperation(operation);
+                      _this15.props.onEdit(
+                        (0, _graphql.print)(newOperationDef)
+                      );
+                    };
+                    var onOperationDestroy = function onOperationDestroy2() {
+                      var newOperationDef = destroyOperation(operation);
+                      _this15.props.onEdit(
+                        (0, _graphql.print)(newOperationDef)
+                      );
+                    };
+                    var fragmentType =
+                      operation.kind === "FragmentDefinition" &&
+                      operation.typeCondition.kind === "NamedType" &&
+                      schema.getType(operation.typeCondition.name.value);
+                    var fragmentFields =
+                      fragmentType instanceof _graphql.GraphQLObjectType
+                        ? fragmentType.getFields()
+                        : null;
+                    var fields =
+                      operationType === "query"
+                        ? queryFields
+                        : operationType === "mutation"
+                        ? mutationFields
+                        : operationType === "subscription"
+                        ? subscriptionFields
+                        : operation.kind === "FragmentDefinition"
+                        ? fragmentFields
+                        : null;
+                    var fragmentTypeName =
+                      operation.kind === "FragmentDefinition"
+                        ? operation.typeCondition.name.value
+                        : null;
+                    var onCommit = function onCommit2(parsedDocument) {
+                      var textualNewDocument = (0, _graphql.print)(
+                        parsedDocument
+                      );
+                      _this15.props.onEdit(textualNewDocument);
+                    };
+                    return React.createElement(RootView, {
+                      key: index,
+                      isLast: index === relevantOperations.length - 1,
+                      fields,
+                      operationType,
+                      name: operationName,
+                      definition: operation,
+                      onOperationRename,
+                      onOperationDestroy,
+                      onOperationClone,
+                      onTypeName: fragmentTypeName,
+                      onMount: _this15._handleRootViewMount,
+                      onCommit,
+                      onEdit: function onEdit(newDefinition, options) {
+                        var commit = void 0;
+                        if (
+                          (typeof options === "undefined"
+                            ? "undefined"
+                            : _typeof(options)) === "object" &&
+                          typeof options.commit !== "undefined"
+                        ) {
+                          commit = options.commit;
+                        } else {
+                          commit = true;
+                        }
+                        if (!!newDefinition) {
+                          var newQuery = _extends({}, parsedQuery, {
+                            definitions: parsedQuery.definitions.map(function (
+                              existingDefinition
+                            ) {
+                              return existingDefinition === operation
+                                ? newDefinition
+                                : existingDefinition;
+                            }),
+                          });
+                          if (commit) {
+                            onCommit(newQuery);
+                            return newQuery;
+                          } else {
+                            return newQuery;
+                          }
+                        } else {
+                          return parsedQuery;
+                        }
+                      },
+                      schema,
+                      getDefaultFieldNames,
+                      getDefaultScalarArgValue,
+                      makeDefaultArg,
+                      onRunOperation: function onRunOperation() {
+                        if (!!_this15.props.onRunOperation) {
+                          _this15.props.onRunOperation(operationName);
+                        }
+                      },
+                      styleConfig,
+                      availableFragments,
+                    });
+                  }),
+                  attribution
+                ),
+                actionsEl
+              );
+            },
+          },
+        ]);
+        return Explorer2;
+      })(React.PureComponent);
+      Explorer.defaultProps = {
+        getDefaultFieldNames: defaultGetDefaultFieldNames,
+        getDefaultScalarArgValue: defaultGetDefaultScalarArgValue,
+      };
+      var ErrorBoundary = (function (_React$Component) {
+        _inherits(ErrorBoundary2, _React$Component);
+        function ErrorBoundary2() {
+          var _ref16;
+          var _temp10, _this16, _ret12;
+          _classCallCheck(this, ErrorBoundary2);
+          for (
+            var _len10 = arguments.length, args = Array(_len10), _key10 = 0;
+            _key10 < _len10;
+            _key10++
+          ) {
+            args[_key10] = arguments[_key10];
+          }
+          return (
+            (_ret12 =
+              ((_temp10 =
+                ((_this16 = _possibleConstructorReturn(
+                  this,
+                  (_ref16 =
+                    ErrorBoundary2.__proto__ ||
+                    Object.getPrototypeOf(ErrorBoundary2)).call.apply(
+                    _ref16,
+                    [this].concat(args)
+                  )
+                )),
+                _this16)),
+              (_this16.state = {
+                hasError: false,
+                error: null,
+                errorInfo: null,
+              }),
+              _temp10)),
+            _possibleConstructorReturn(_this16, _ret12)
+          );
+        }
+        _createClass(ErrorBoundary2, [
+          {
+            key: "componentDidCatch",
+            value: function componentDidCatch(error2, errorInfo) {
+              this.setState({ hasError: true, error: error2, errorInfo });
+              console.error("Error in component", error2, errorInfo);
+            },
+          },
+          {
+            key: "render",
+            value: function render() {
+              if (this.state.hasError) {
+                return React.createElement(
+                  "div",
+                  { style: { padding: 18, fontFamily: "sans-serif" } },
+                  React.createElement("div", null, "Something went wrong"),
+                  React.createElement(
+                    "details",
+                    { style: { whiteSpace: "pre-wrap" } },
+                    this.state.error ? this.state.error.toString() : null,
+                    React.createElement("br", null),
+                    this.state.errorInfo
+                      ? this.state.errorInfo.componentStack
+                      : null
+                  )
+                );
+              }
+              return this.props.children;
+            },
+          },
+        ]);
+        return ErrorBoundary2;
+      })(React.Component);
+      var ExplorerWrapper = (function (_React$PureComponent10) {
+        _inherits(ExplorerWrapper2, _React$PureComponent10);
+        function ExplorerWrapper2() {
+          _classCallCheck(this, ExplorerWrapper2);
+          return _possibleConstructorReturn(
+            this,
+            (
+              ExplorerWrapper2.__proto__ ||
+              Object.getPrototypeOf(ExplorerWrapper2)
+            ).apply(this, arguments)
+          );
+        }
+        _createClass(ExplorerWrapper2, [
+          {
+            key: "render",
+            value: function render() {
+              return React.createElement(
+                "div",
+                {
+                  className: "docExplorerWrap",
+                  style: {
+                    height: "100%",
+                    width: this.props.width,
+                    minWidth: this.props.width,
+                    zIndex: 7,
+                    display: this.props.explorerIsOpen ? "flex" : "none",
+                    flexDirection: "column",
+                    overflow: "hidden",
+                  },
+                },
+                React.createElement(
+                  "section",
+                  {
+                    className: "doc-explorer",
+                  },
+                  React.createElement(
+                    "div",
+                    { className: "doc-explorer-title-bar" },
+                    React.createElement(
+                      "div",
+                      { className: "doc-explorer-title" },
+                      this.props.title
+                    ),
+                    React.createElement(
+                      "div",
+                      { className: "doc-explorer-rhs" },
+                      React.createElement(
+                        "div",
+                        {
+                          className: "docExplorerHide",
+                          onClick: this.props.onToggleExplorer,
+                        },
+                        "\u2715"
+                      )
+                    )
+                  ),
+                  React.createElement(
+                    "div",
+                    {
+                      className: "doc-explorer-contents",
+                      style: {
+                        padding: "0px",
+                        overflowY: "unset",
+                      },
+                    },
+                    React.createElement(
+                      ErrorBoundary,
+                      null,
+                      React.createElement(Explorer, this.props)
+                    )
+                  )
+                )
+              );
+            },
+          },
+        ]);
+        return ExplorerWrapper2;
+      })(React.PureComponent);
+      ExplorerWrapper.defaultValue = defaultValue;
+      ExplorerWrapper.defaultProps = {
+        width: 320,
+        title: "Explorer",
+      };
+      Explorer$1.default = ExplorerWrapper;
+      Object.defineProperty(dist, "__esModule", {
+        value: true,
+      });
+      dist.Explorer = void 0;
+      var _Explorer = Explorer$1;
+      var _Explorer2 = _interopRequireDefault(_Explorer);
+      function _interopRequireDefault(obj) {
+        return obj && obj.__esModule ? obj : { default: obj };
+      }
+      dist.Explorer = _Explorer2.default;
+      var _default = (dist.default = _Explorer2.default);
+      var graphiql = "";
+      var styles = "";
+      var darkMode = "";
+      const YogaLogo = () =>
+        /* @__PURE__ */ React$1.createElement(
+          "svg",
+          {
+            width: "22px",
+            height: "28px",
+            viewBox: "0 0 22 28",
+            version: "1.1",
+            xmlns: "http://www.w3.org/2000/svg",
+          },
+          " ",
+          /* @__PURE__ */ React$1.createElement("title", null, "Fill 19"),
+          " ",
+          /* @__PURE__ */ React$1.createElement(
+            "desc",
+            null,
+            "Created with Sketch."
+          ),
+          " ",
+          /* @__PURE__ */ React$1.createElement(
+            "g",
+            {
+              id: "Symbols",
+              stroke: "none",
+              "stroke-width": "1",
+              fill: "none",
+              "fill-rule": "evenodd",
+            },
+            " ",
+            /* @__PURE__ */ React$1.createElement(
+              "g",
+              {
+                id: "Menu-/-not-signed-in",
+                transform: "translate(-88.000000, -52.000000)",
+                fill: "white",
+              },
+              " ",
+              /* @__PURE__ */ React$1.createElement("path", {
+                d: "M97.3333019,67.5555032 C93.8969498,67.5555032 91.1111006,64.7698425 91.1111006,61.3333019 C91.1111006,57.8967613 93.8969498,55.1111006 97.3333019,55.1111006 C100.769843,55.1111006 103.555503,57.8967613 103.555503,61.3333019 C103.555503,64.7698425 100.769843,67.5555032 97.3333019,67.5555032 M97.3333019,52 C102.487924,52 106.666604,56.1786795 106.666604,61.3333019 C106.666604,66.4879243 102.487924,70.6666038 97.3333019,70.6666038 C92.1786795,70.6666038 88,66.4879243 88,61.3333019 C88,56.1786795 92.1786795,52 97.3333019,52 Z M106.211063,71.1221444 C106.818576,71.7296575 106.818576,72.7144622 106.211063,73.3219753 L99.9886734,79.5443652 C99.3811603,80.1518783 98.3963556,80.1518783 97.7888425,79.5443652 C97.1813294,78.9368521 97.1813294,77.9520473 97.7888425,77.3445342 L104.011232,71.1221444 C104.618745,70.5146313 105.60355,70.5146313 106.211063,71.1221444 Z M109.777704,53.5555503 C109.777704,54.4147797 109.081384,55.1111006 108.222343,55.1111006 C107.363113,55.1111006 106.666792,54.4147797 106.666792,53.5555503 C106.666792,52.6963209 107.363113,52 108.222343,52 C109.081384,52 109.777704,52.6963209 109.777704,53.5555503 Z",
+                id: "Fill-19",
+              }),
+              " "
+            ),
+            " "
+          )
+        );
+      const noop = function () {};
+      const listeners = {
+        popstate: [],
+      };
+      let mockWindow = {
+        URL: function URL2() {
+          return {
+            searchParams: {
+              set: noop,
+              append: noop,
+              delete: noop,
+            },
+          };
+        },
+        location: {
+          href: "",
+          search: "",
+        },
+        history: {
+          pushState: noop,
+        },
+        fireEvent: function (eventName) {
+          listeners[eventName].forEach((listener) => {
+            listener();
+          });
+        },
+        addEventListener: function (eventName, listener) {
+          listeners[eventName].push(listener);
+        },
+        removeEventListener: function (eventName, listener) {
+          const eventListeners = listeners[eventName];
+          const i = eventListeners.findIndex((l2) => l2 === listener);
+          eventListeners.splice(i, 1);
+        },
+      };
+      function getWindow() {
+        if (typeof window !== "undefined") return window;
+        return mockWindow;
+      }
+      const SUPPORTED_PARAMS_TYPES = [Number, String, Boolean, Date];
+      function setQueryToCurrentUrl(params) {
+        const { URL: URL3 } = getWindow();
+        const url = new URL3(getWindow().location.href);
+        Object.keys(params).forEach((key) => {
+          const value = params[key];
+          if (value !== null && value !== void 0) {
+            if (Array.isArray(value)) {
+              url.searchParams.delete(key);
+              value.forEach((valueItem) => {
+                url.searchParams.append(key, valueItem);
+              });
+            } else if (value instanceof Date) {
+              if (!isNaN(value.getTime())) {
+                url.searchParams.set(key, value.toISOString());
+              }
+            } else if (typeof value === "object") {
+              url.searchParams.set(key, JSON.stringify(value));
+            } else {
+              url.searchParams.set(key, value);
+            }
+          } else {
+            url.searchParams.delete(key);
+          }
+        });
+        return url;
+      }
+      function isNoneEmptyPrimitiveArray(input) {
+        return (
+          Array.isArray(input) &&
+          input.length > 0 &&
+          input.every(
+            (item) =>
+              typeof item === "number" ||
+              typeof item === "string" ||
+              typeof item === "boolean"
+          )
+        );
+      }
+      function validateTypes(types = {}) {
+        const isValidTypes = Object.values(types).every(
+          (type2) =>
+            SUPPORTED_PARAMS_TYPES.includes(type2) ||
+            isNoneEmptyPrimitiveArray(type2) ||
+            typeof type2 === "function"
+        );
+        if (!isValidTypes) {
+          throw new Error(
+            `Unsupported param types. Must be one of [${SUPPORTED_PARAMS_TYPES.map(
+              (item) => item.name
+            ).join(", ")}]`
+          );
+        }
+      }
+      function useUrlSearchParams(initial = {}, types = {}, replace2 = false) {
+        if (types) validateTypes(types);
+        const [, forceUpdate] = react.exports.useState();
+        const locationSearch = getWindow().location.search;
+        const urlSearchParams = react.exports.useMemo(() => {
+          return new URLSearchParams(locationSearch);
+        }, [locationSearch]);
+        const params = react.exports.useMemo(() => {
+          let result2 = [];
+          urlSearchParams.forEach((value, key) => {
+            result2.push({
+              key,
+              value,
+            });
+          });
+          result2 = result2.reduce((acc, val) => {
+            (acc[val.key] = acc[val.key] || []).push(val);
+            return acc;
+          }, {});
+          result2 = Object.keys(result2).map((key) => {
+            const valueGroup = result2[key];
+            if (valueGroup.length === 1) {
+              return [key, valueGroup[0].value];
+            } else {
+              return [key, valueGroup.map(({ value }) => value)];
+            }
+          });
+          const params2 = Object.assign({}, initial);
+          result2.forEach(([key, value]) => {
+            params2[key] = parseValue(key, value, types, initial);
+          });
+          return params2;
+        }, [urlSearchParams]);
+        function redirectToNewSearchParams(params2) {
+          const url = setQueryToCurrentUrl(params2);
+          if (getWindow().location.search !== url.search) {
+            if (replace2) {
+              getWindow().history.replaceState({}, "", url.toString());
+            } else {
+              getWindow().history.pushState({}, "", url.toString());
+            }
+          }
+          if (urlSearchParams.toString() !== url.searchParams.toString()) {
+            forceUpdate({});
+          }
+        }
+        react.exports.useEffect(() => {
+          redirectToNewSearchParams(
+            Object.assign(Object.assign({}, initial), params)
+          );
+        }, [params]);
+        const setParams = (params2) => {
+          redirectToNewSearchParams(params2);
+        };
+        react.exports.useEffect(() => {
+          const onPopState = () => {
+            forceUpdate({});
+          };
+          getWindow().addEventListener("popstate", onPopState);
+          return () => {
+            getWindow().removeEventListener("popstate", onPopState);
+          };
+        }, []);
+        return [params, setParams];
+      }
+      const booleanValues = {
+        true: true,
+        false: false,
+      };
+      function parseValue(key, _value, types, defaultParams) {
+        if (!types) return _value;
+        const type2 = types[key];
+        const value = _value === void 0 ? defaultParams[key] : _value;
+        if (type2 === Number) {
+          return Number(value);
+        }
+        if (type2 === Boolean) {
+          return booleanValues[value];
+        }
+        if (type2 === Date) {
+          return new Date(value);
+        }
+        if (Array.isArray(type2)) {
+          return type2.find((item) => item == value) || defaultParams[key];
+        }
+        if (typeof type2 === "function") {
+          return type2(value);
+        }
+        return value;
+      }
+      var JSON$1 = {};
+      const stringify = (...args) => JSON$1.stringify(...args);
+      (function () {
+        var escapable =
+            /[\\\"\x00-\x1f\x7f-\x9f\u00ad\u0600-\u0604\u070f\u17b4\u17b5\u200c-\u200f\u2028-\u202f\u2060-\u206f\ufeff\ufff0-\uffff]/g,
+          gap2,
+          indent2,
+          meta = {
+            "\b": "\\b",
+            "	": "\\t",
+            "\n": "\\n",
+            "\f": "\\f",
+            "\r": "\\r",
+            '"': '\\"',
+            "\\": "\\\\",
+          },
+          rep;
+        function quote(string2) {
+          escapable.lastIndex = 0;
+          return escapable.test(string2)
+            ? '"' +
+                string2.replace(escapable, function (a) {
+                  var c = meta[a];
+                  return typeof c === "string"
+                    ? c
+                    : "\\u" + ("0000" + a.charCodeAt(0).toString(16)).slice(-4);
+                }) +
+                '"'
+            : '"' + string2 + '"';
+        }
+        function str(key, holder) {
+          var i,
+            k,
+            v2,
+            length,
+            mind = gap2,
+            partial,
+            value = holder[key];
+          if (
+            value &&
+            typeof value === "object" &&
+            typeof value.toJSON === "function"
+          ) {
+            value = value.toJSON(key);
+          }
+          if (typeof rep === "function") {
+            value = rep.call(holder, key, value);
+          }
+          switch (typeof value) {
+            case "string":
+              return quote(value);
+            case "number":
+              return isFinite(value) ? String(value) : "null";
+            case "bigint":
+            case "boolean":
+            case "null":
+              return String(value);
+            case "object":
+              if (!value) {
+                return "null";
+              }
+              gap2 += indent2;
+              partial = [];
+              if (Object.prototype.toString.apply(value) === "[object Array]") {
+                length = value.length;
+                for (i = 0; i < length; i += 1) {
+                  partial[i] = str(i, value) || "null";
+                }
+                v2 =
+                  partial.length === 0
+                    ? "[]"
+                    : gap2
+                    ? "[\n" +
+                      gap2 +
+                      partial.join(",\n" + gap2) +
+                      "\n" +
+                      mind +
+                      "]"
+                    : "[" + partial.join(",") + "]";
+                gap2 = mind;
+                return v2;
+              }
+              if (rep && typeof rep === "object") {
+                length = rep.length;
+                for (i = 0; i < length; i += 1) {
+                  if (typeof rep[i] === "string") {
+                    k = rep[i];
+                    v2 = str(k, value);
+                    if (v2) {
+                      partial.push(quote(k) + (gap2 ? ": " : ":") + v2);
+                    }
+                  }
+                }
+              } else {
+                Object.keys(value).forEach(function (k2) {
+                  var v3 = str(k2, value);
+                  if (v3) {
+                    partial.push(quote(k2) + (gap2 ? ": " : ":") + v3);
+                  }
+                });
+              }
+              v2 =
+                partial.length === 0
+                  ? "{}"
+                  : gap2
+                  ? "{\n" +
+                    gap2 +
+                    partial.join(",\n" + gap2) +
+                    "\n" +
+                    mind +
+                    "}"
+                  : "{" + partial.join(",") + "}";
+              gap2 = mind;
+              return v2;
+          }
+        }
+        if (typeof JSON$1.stringify !== "function") {
+          JSON$1.stringify = function (value, replacer, space) {
+            var i;
+            gap2 = "";
+            indent2 = "";
+            if (typeof space === "number") {
+              for (i = 0; i < space; i += 1) {
+                indent2 += " ";
+              }
+            } else if (typeof space === "string") {
+              indent2 = space;
+            }
+            rep = replacer;
+            if (
+              replacer &&
+              typeof replacer !== "function" &&
+              (typeof replacer !== "object" ||
+                typeof replacer.length !== "number")
+            ) {
+              throw new Error("JSON.stringify");
+            }
+            return str("", { "": value });
+          };
+        }
+      })();
+      function json_parse(options) {
+        var _options = {
+          strict: false,
+          storeAsString: false,
+        };
+        if (options !== void 0 && options !== null) {
+          if (options.strict === true) {
+            _options.strict = true;
+          }
+          if (options.storeAsString === true) {
+            _options.storeAsString = true;
+          }
+        }
+        var at,
+          ch2,
+          escapee = {
+            '"': '"',
+            "\\": "\\",
+            "/": "/",
+            b: "\b",
+            f: "\f",
+            n: "\n",
+            r: "\r",
+            t: "	",
+          },
+          text3,
+          error2 = function (m) {
+            throw {
+              name: "SyntaxError",
+              message: m,
+              at,
+              text: text3,
+            };
+          },
+          next = function (c) {
+            if (c && c !== ch2) {
+              error2("Expected '" + c + "' instead of '" + ch2 + "'");
+            }
+            ch2 = text3.charAt(at);
+            at += 1;
+            return ch2;
+          },
+          number = function () {
+            var string3 = "";
+            if (ch2 === "-") {
+              string3 = "-";
+              next("-");
+            }
+            while (ch2 >= "0" && ch2 <= "9") {
+              string3 += ch2;
+              next();
+            }
+            if (ch2 === ".") {
+              string3 += ".";
+              while (next() && ch2 >= "0" && ch2 <= "9") {
+                string3 += ch2;
+              }
+            }
+            if (ch2 === "e" || ch2 === "E") {
+              string3 += ch2;
+              next();
+              if (ch2 === "-" || ch2 === "+") {
+                string3 += ch2;
+                next();
+              }
+              while (ch2 >= "0" && ch2 <= "9") {
+                string3 += ch2;
+                next();
+              }
+            }
+            if (!isFinite(Number(string3))) {
+              error2("Bad number");
+            } else {
+              const nonBigIntNum = Number(string3);
+              if (
+                Number.isInteger(nonBigIntNum) &&
+                !Number.isSafeInteger(nonBigIntNum)
+              )
+                return _options.storeAsString === true
+                  ? string3
+                  : BigInt(string3);
+              return nonBigIntNum;
+            }
+          },
+          string2 = function () {
+            var hex,
+              i,
+              string3 = "",
+              uffff;
+            if (ch2 === '"') {
+              while (next()) {
+                if (ch2 === '"') {
+                  next();
+                  return string3;
+                }
+                if (ch2 === "\\") {
+                  next();
+                  if (ch2 === "u") {
+                    uffff = 0;
+                    for (i = 0; i < 4; i += 1) {
+                      hex = parseInt(next(), 16);
+                      if (!isFinite(hex)) {
+                        break;
+                      }
+                      uffff = uffff * 16 + hex;
+                    }
+                    string3 += String.fromCharCode(uffff);
+                  } else if (typeof escapee[ch2] === "string") {
+                    string3 += escapee[ch2];
+                  } else {
+                    break;
+                  }
+                } else {
+                  string3 += ch2;
+                }
+              }
+            }
+            error2("Bad string");
+          },
+          white = function () {
+            while (ch2 && ch2 <= " ") {
+              next();
+            }
+          },
+          word2 = function () {
+            switch (ch2) {
+              case "t":
+                next("t");
+                next("r");
+                next("u");
+                next("e");
+                return true;
+              case "f":
+                next("f");
+                next("a");
+                next("l");
+                next("s");
+                next("e");
+                return false;
+              case "n":
+                next("n");
+                next("u");
+                next("l");
+                next("l");
+                return null;
+            }
+            error2("Unexpected '" + ch2 + "'");
+          },
+          value,
+          array = function () {
+            var array2 = [];
+            if (ch2 === "[") {
+              next("[");
+              white();
+              if (ch2 === "]") {
+                next("]");
+                return array2;
+              }
+              while (ch2) {
+                array2.push(value());
+                white();
+                if (ch2 === "]") {
+                  next("]");
+                  return array2;
+                }
+                next(",");
+                white();
+              }
+            }
+            error2("Bad array");
+          },
+          object = function () {
+            var key,
+              object2 = {};
+            if (ch2 === "{") {
+              next("{");
+              white();
+              if (ch2 === "}") {
+                next("}");
+                return object2;
+              }
+              while (ch2) {
+                key = string2();
+                white();
+                next(":");
+                if (
+                  _options.strict === true &&
+                  Object.hasOwnProperty.call(object2, key)
+                ) {
+                  error2('Duplicate key "' + key + '"');
+                }
+                object2[key] = value();
+                white();
+                if (ch2 === "}") {
+                  next("}");
+                  return object2;
+                }
+                next(",");
+                white();
+              }
+            }
+            error2("Bad object");
+          };
+        value = function () {
+          white();
+          switch (ch2) {
+            case "{":
+              return object();
+            case "[":
+              return array();
+            case '"':
+              return string2();
+            case "-":
+              return number();
+            default:
+              return ch2 >= "0" && ch2 <= "9" ? number() : word2();
+          }
+        };
+        return function (source, reviver) {
+          var result2;
+          text3 = source + "";
+          at = 0;
+          ch2 = " ";
+          result2 = value();
+          white();
+          if (ch2) {
+            error2("Syntax error");
+          }
+          return typeof reviver === "function"
+            ? (function walk(holder, key) {
+                var v2,
+                  value2 = holder[key];
+                if (value2 && typeof value2 === "object") {
+                  Object.keys(value2).forEach(function (k) {
+                    v2 = walk(value2, k);
+                    if (v2 !== void 0) {
+                      value2[k] = v2;
+                    } else {
+                      delete value2[k];
+                    }
+                  });
+                }
+                return reviver.call(holder, key, value2);
+              })({ "": result2 }, "")
+            : result2;
+        };
+      }
+      let globalObj;
+      if (typeof globalThis !== "undefined") {
+        globalObj = globalThis;
+      } else if (typeof self !== "undefined") {
+        globalObj = self;
+      } else if (typeof window !== "undefined") {
+        globalObj = window;
+      } else if (typeof commonjsGlobal !== "undefined") {
+        globalObj = commonjsGlobal;
+      }
+      globalObj.BigInt.prototype.toJSON = function () {
+        return this;
+      };
+      globalObj.JSON.parse = json_parse();
+      globalObj.JSON.stringify = stringify;
+      const getOperationWithFragments = (document2, operationName) => {
+        const definitions = document2.definitions.filter((definition) => {
+          var _a2;
+          if (definition.kind === Kind.OPERATION_DEFINITION) {
+            if (operationName) {
+              if (
+                ((_a2 = definition.name) == null ? void 0 : _a2.value) !==
+                operationName
+              ) {
+                return false;
+              }
+            }
+          }
+          return true;
+        });
+        return {
+          kind: Kind.DOCUMENT,
+          definitions,
+        };
+      };
+      function YogaGraphiQL(props) {
+        var _a2;
+        const initialQuery = `
+    #
+    # Welcome to The GraphiQL
+    #
+    # GraphiQL is an in-browser tool for writing, validating, and
+    # testing GraphQL queries.
+    #
+    # Type queries into this side of the screen, and you will see intelligent
+    # typeaheads aware of the current GraphQL type schema and live syntax and
+    # validation errors highlighted within the text.
+    #
+    # GraphQL queries typically start with a "{" character. Lines that start
+    # with a # are ignored.
+    #
+    # An example GraphQL query might look like:
+    #
+    #     {
+    #       field(arg: "value") {
+    #         subField
+    #       }
+    #     }
+    #
+    # Keyboard shortcuts:
+    #
+    #  Prettify Query:  Shift-Ctrl-P (or press the prettify button above)
+    #
+    #     Merge Query:  Shift-Ctrl-M (or press the merge button above)
+    #
+    #       Run Query:  Ctrl-Enter (or press the play button above)
+    #
+    #   Auto Complete:  Ctrl-Space (or just start typing)
+    #
+  `;
+        const endpoint = new URL(
+          (_a2 = props.endpoint) != null ? _a2 : location.pathname,
+          location.href
+        ).toString();
+        const graphiqlRef = React$1.useRef(null);
+        const urlLoader = react.exports.useMemo(() => new UrlLoader(), []);
+        const fetcher = react.exports.useMemo(() => {
+          const executor = urlLoader.getExecutorAsync(
+            endpoint,
+            __spreadProps(
+              __spreadValues(
+                {
+                  subscriptionsProtocol: SubscriptionProtocol.SSE,
+                  credentials: "same-origin",
+                  specifiedByUrl: true,
+                  directiveIsRepeatable: true,
+                  schemaDescription: true,
+                },
+                props
+              ),
+              {
+                headers: {},
+              }
+            )
+          );
+          return function fetcher2(graphQLParams, opts) {
+            const document2 = getOperationWithFragments(
+              parse$1(graphQLParams.query),
+              graphQLParams.operationName
+            );
+            return executor({
+              document: document2,
+              operationName: graphQLParams.operationName,
+              variables: graphQLParams.variables,
+              extensions: {
+                headers: opts == null ? void 0 : opts.headers,
+              },
+            });
+          };
+        }, [urlLoader, endpoint]);
+        const [showExplorer, setShowExplorer] = React$1.useState(false);
+        const [schema, setSchema] = React$1.useState(null);
+        const types = {
+          query: String,
+        };
+        const [params, setParams] = useUrlSearchParams(
+          {
+            query: props.defaultQuery || initialQuery,
+          },
+          types,
+          false
+        );
+        const [showDocs, setShowDocs] = React$1.useState(false);
+        return /* @__PURE__ */ React$1.createElement(
+          "div",
+          {
+            className: "graphiql-container",
+          },
+          schema && (params == null ? void 0 : params.query) != null
+            ? /* @__PURE__ */ React$1.createElement(_default, {
+                schema,
+                query: params.query.toString(),
+                onEdit: (query) => {
+                  setParams({
+                    query,
+                  });
+                },
+                explorerIsOpen: showExplorer,
+                onToggleExplorer: () => setShowExplorer((isOpen) => !isOpen),
+                colors: {
+                  keyword: "#FF6D5D",
+                  def: "#9F51D9",
+                  property: "#0083c7",
+                  qualifier: "#008AED",
+                  attribute: "#00b8ff",
+                  number: "#97b1aa",
+                  string: "#00917D",
+                  string2: "#146574",
+                  builtin: "#da8aff",
+                  variable: "#FF6D5D",
+                  atom: "#ff9f4c",
+                },
+              })
+            : null,
+          (params == null ? void 0 : params.query) != null
+            ? /* @__PURE__ */ React$1.createElement(
+                GraphiQL,
+                __spreadValues(
+                  {
+                    ref: graphiqlRef,
+                    fetcher,
+                    headerEditorEnabled: true,
+                    defaultVariableEditorOpen: true,
+                    docExplorerOpen: showDocs,
+                    onToggleDocs: () => setShowDocs((isOpen) => !isOpen),
+                    tabs: true,
+                    toolbar: {
+                      additionalContent: /* @__PURE__ */ React$1.createElement(
+                        React$1.Fragment,
+                        null,
+                        /* @__PURE__ */ React$1.createElement(
+                          "button",
+                          {
+                            className: "toolbar-button",
+                            onClick: () => {
+                              var _a3;
+                              const state =
+                                (_a3 = graphiqlRef.current) == null
+                                  ? void 0
+                                  : _a3.state;
+                              copyToClipboard(
+                                urlLoader.prepareGETUrl({
+                                  baseUrl: window.location.href,
+                                  query:
+                                    (state == null ? void 0 : state.query) ||
+                                    "",
+                                  variables:
+                                    state == null ? void 0 : state.variables,
+                                  operationName:
+                                    state == null
+                                      ? void 0
+                                      : state.operationName,
+                                })
+                              );
+                            },
+                          },
+                          "Copy Link"
+                        )
+                      ),
+                    },
+                    onSchemaChange: (schema2) => {
+                      setSchema(schema2);
+                    },
+                    query: params.query.toString(),
+                    onEditQuery: (query) =>
+                      setParams({
+                        query,
+                      }),
+                    beforeTopBarContent: schema
+                      ? showExplorer
+                        ? null
+                        : /* @__PURE__ */ React$1.createElement(
+                            "button",
+                            {
+                              className:
+                                "docExplorerShow docExplorerShowReverse",
+                              onClick: () =>
+                                setShowExplorer((isOpen) => !isOpen),
+                            },
+                            "Explorer"
+                          )
+                      : null,
+                  },
+                  props
+                ),
+                /* @__PURE__ */ React$1.createElement(
+                  GraphiQL.Logo,
+                  null,
+                  /* @__PURE__ */ React$1.createElement(
+                    "div",
+                    {
+                      style: { display: "flex", alignItems: "center" },
+                    },
+                    /* @__PURE__ */ React$1.createElement(
+                      "div",
+                      {
+                        style: { width: 40, display: "flex" },
+                      },
+                      /* @__PURE__ */ React$1.createElement(YogaLogo, null)
+                    ),
+                    /* @__PURE__ */ React$1.createElement(
+                      "span",
+                      null,
+                      (props == null ? void 0 : props.title)
+                        ? props.title
+                        : /* @__PURE__ */ React$1.createElement(
+                            React$1.Fragment,
+                            null,
+                            "The Graph",
+                            /* @__PURE__ */ React$1.createElement(
+                              "em",
+                              null,
+                              "i"
+                            ),
+                            "QL"
+                          )
+                    )
+                  )
+                )
+              )
+            : null
+        );
+      }
+      function renderYogaGraphiQL(element, opts) {
+        ReactDOM.render(
+          /* @__PURE__ */ React$1.createElement(
+            YogaGraphiQL,
+            __spreadValues({}, opts)
+          ),
+          element
+        );
+      }
+      var codemirror$2 = { exports: {} };
+      (function (module2, exports) {
+        (function (global2, factory) {
+          module2.exports = factory();
+        })(commonjsGlobal, function () {
+          var userAgent = navigator.userAgent;
+          var platform = navigator.platform;
+          var gecko = /gecko\/\d/i.test(userAgent);
+          var ie_upto10 = /MSIE \d/.test(userAgent);
+          var ie_11up = /Trident\/(?:[7-9]|\d{2,})\..*rv:(\d+)/.exec(userAgent);
+          var edge = /Edge\/(\d+)/.exec(userAgent);
+          var ie2 = ie_upto10 || ie_11up || edge;
+          var ie_version =
+            ie2 &&
+            (ie_upto10 ? document.documentMode || 6 : +(edge || ie_11up)[1]);
+          var webkit = !edge && /WebKit\//.test(userAgent);
+          var qtwebkit = webkit && /Qt\/\d+\.\d+/.test(userAgent);
+          var chrome = !edge && /Chrome\//.test(userAgent);
+          var presto = /Opera\//.test(userAgent);
+          var safari = /Apple Computer/.test(navigator.vendor);
+          var mac_geMountainLion = /Mac OS X 1\d\D([8-9]|\d\d)\D/.test(
+            userAgent
+          );
+          var phantom = /PhantomJS/.test(userAgent);
+          var ios =
+            safari &&
+            (/Mobile\/\w+/.test(userAgent) || navigator.maxTouchPoints > 2);
+          var android = /Android/.test(userAgent);
+          var mobile =
+            ios ||
+            android ||
+            /webOS|BlackBerry|Opera Mini|Opera Mobi|IEMobile/i.test(userAgent);
+          var mac = ios || /Mac/.test(platform);
+          var chromeOS = /\bCrOS\b/.test(userAgent);
+          var windows = /win/i.test(platform);
+          var presto_version = presto && userAgent.match(/Version\/(\d*\.\d*)/);
+          if (presto_version) {
+            presto_version = Number(presto_version[1]);
+          }
+          if (presto_version && presto_version >= 15) {
+            presto = false;
+            webkit = true;
+          }
+          var flipCtrlCmd =
+            mac &&
+            (qtwebkit ||
+              (presto && (presto_version == null || presto_version < 12.11)));
+          var captureRightClick = gecko || (ie2 && ie_version >= 9);
+          function classTest(cls) {
+            return new RegExp("(^|\\s)" + cls + "(?:$|\\s)\\s*");
+          }
+          var rmClass = function (node, cls) {
+            var current = node.className;
+            var match2 = classTest(cls).exec(current);
+            if (match2) {
+              var after = current.slice(match2.index + match2[0].length);
+              node.className =
+                current.slice(0, match2.index) +
+                (after ? match2[1] + after : "");
+            }
+          };
+          function removeChildren(e) {
+            for (var count = e.childNodes.length; count > 0; --count) {
+              e.removeChild(e.firstChild);
+            }
+            return e;
+          }
+          function removeChildrenAndAdd(parent, e) {
+            return removeChildren(parent).appendChild(e);
+          }
+          function elt(tag, content, className, style) {
+            var e = document.createElement(tag);
+            if (className) {
+              e.className = className;
+            }
+            if (style) {
+              e.style.cssText = style;
+            }
+            if (typeof content == "string") {
+              e.appendChild(document.createTextNode(content));
+            } else if (content) {
+              for (var i2 = 0; i2 < content.length; ++i2) {
+                e.appendChild(content[i2]);
+              }
+            }
+            return e;
+          }
+          function eltP(tag, content, className, style) {
+            var e = elt(tag, content, className, style);
+            e.setAttribute("role", "presentation");
+            return e;
+          }
+          var range2;
+          if (document.createRange) {
+            range2 = function (node, start2, end2, endNode) {
+              var r2 = document.createRange();
+              r2.setEnd(endNode || node, end2);
+              r2.setStart(node, start2);
+              return r2;
+            };
+          } else {
+            range2 = function (node, start2, end2) {
+              var r2 = document.body.createTextRange();
+              try {
+                r2.moveToElementText(node.parentNode);
+              } catch (e) {
+                return r2;
+              }
+              r2.collapse(true);
+              r2.moveEnd("character", end2);
+              r2.moveStart("character", start2);
+              return r2;
+            };
+          }
+          function contains(parent, child) {
+            if (child.nodeType == 3) {
+              child = child.parentNode;
+            }
+            if (parent.contains) {
+              return parent.contains(child);
+            }
+            do {
+              if (child.nodeType == 11) {
+                child = child.host;
+              }
+              if (child == parent) {
+                return true;
+              }
+            } while ((child = child.parentNode));
+          }
+          function activeElt() {
+            var activeElement;
+            try {
+              activeElement = document.activeElement;
+            } catch (e) {
+              activeElement = document.body || null;
+            }
+            while (
+              activeElement &&
+              activeElement.shadowRoot &&
+              activeElement.shadowRoot.activeElement
+            ) {
+              activeElement = activeElement.shadowRoot.activeElement;
+            }
+            return activeElement;
+          }
+          function addClass(node, cls) {
+            var current = node.className;
+            if (!classTest(cls).test(current)) {
+              node.className += (current ? " " : "") + cls;
+            }
+          }
+          function joinClasses(a, b) {
+            var as = a.split(" ");
+            for (var i2 = 0; i2 < as.length; i2++) {
+              if (as[i2] && !classTest(as[i2]).test(b)) {
+                b += " " + as[i2];
+              }
+            }
+            return b;
+          }
+          var selectInput = function (node) {
+            node.select();
+          };
+          if (ios) {
+            selectInput = function (node) {
+              node.selectionStart = 0;
+              node.selectionEnd = node.value.length;
+            };
+          } else if (ie2) {
+            selectInput = function (node) {
+              try {
+                node.select();
+              } catch (_e) {}
+            };
+          }
+          function bind(f) {
+            var args = Array.prototype.slice.call(arguments, 1);
+            return function () {
+              return f.apply(null, args);
+            };
+          }
+          function copyObj(obj, target2, overwrite) {
+            if (!target2) {
+              target2 = {};
+            }
+            for (var prop3 in obj) {
+              if (
+                obj.hasOwnProperty(prop3) &&
+                (overwrite !== false || !target2.hasOwnProperty(prop3))
+              ) {
+                target2[prop3] = obj[prop3];
+              }
+            }
+            return target2;
+          }
+          function countColumn(string2, end2, tabSize, startIndex, startValue) {
+            if (end2 == null) {
+              end2 = string2.search(/[^\s\u00a0]/);
+              if (end2 == -1) {
+                end2 = string2.length;
+              }
+            }
+            for (var i2 = startIndex || 0, n2 = startValue || 0; ; ) {
+              var nextTab = string2.indexOf("	", i2);
+              if (nextTab < 0 || nextTab >= end2) {
+                return n2 + (end2 - i2);
+              }
+              n2 += nextTab - i2;
+              n2 += tabSize - (n2 % tabSize);
+              i2 = nextTab + 1;
+            }
+          }
+          var Delayed = function () {
+            this.id = null;
+            this.f = null;
+            this.time = 0;
+            this.handler = bind(this.onTimeout, this);
+          };
+          Delayed.prototype.onTimeout = function (self2) {
+            self2.id = 0;
+            if (self2.time <= +new Date()) {
+              self2.f();
+            } else {
+              setTimeout(self2.handler, self2.time - +new Date());
+            }
+          };
+          Delayed.prototype.set = function (ms, f) {
+            this.f = f;
+            var time = +new Date() + ms;
+            if (!this.id || time < this.time) {
+              clearTimeout(this.id);
+              this.id = setTimeout(this.handler, ms);
+              this.time = time;
+            }
+          };
+          function indexOf(array, elt2) {
+            for (var i2 = 0; i2 < array.length; ++i2) {
+              if (array[i2] == elt2) {
+                return i2;
+              }
+            }
+            return -1;
+          }
+          var scrollerGap = 50;
+          var Pass = {
+            toString: function () {
+              return "CodeMirror.Pass";
+            },
+          };
+          var sel_dontScroll = { scroll: false },
+            sel_mouse = { origin: "*mouse" },
+            sel_move = { origin: "+move" };
+          function findColumn(string2, goal, tabSize) {
+            for (var pos = 0, col = 0; ; ) {
+              var nextTab = string2.indexOf("	", pos);
+              if (nextTab == -1) {
+                nextTab = string2.length;
+              }
+              var skipped = nextTab - pos;
+              if (nextTab == string2.length || col + skipped >= goal) {
+                return pos + Math.min(skipped, goal - col);
+              }
+              col += nextTab - pos;
+              col += tabSize - (col % tabSize);
+              pos = nextTab + 1;
+              if (col >= goal) {
+                return pos;
+              }
+            }
+          }
+          var spaceStrs = [""];
+          function spaceStr(n2) {
+            while (spaceStrs.length <= n2) {
+              spaceStrs.push(lst(spaceStrs) + " ");
+            }
+            return spaceStrs[n2];
+          }
+          function lst(arr) {
+            return arr[arr.length - 1];
+          }
+          function map2(array, f) {
+            var out = [];
+            for (var i2 = 0; i2 < array.length; i2++) {
+              out[i2] = f(array[i2], i2);
+            }
+            return out;
+          }
+          function insertSorted(array, value, score) {
+            var pos = 0,
+              priority = score(value);
+            while (pos < array.length && score(array[pos]) <= priority) {
+              pos++;
+            }
+            array.splice(pos, 0, value);
+          }
+          function nothing() {}
+          function createObj(base2, props) {
+            var inst;
+            if (Object.create) {
+              inst = Object.create(base2);
+            } else {
+              nothing.prototype = base2;
+              inst = new nothing();
+            }
+            if (props) {
+              copyObj(props, inst);
+            }
+            return inst;
+          }
+          var nonASCIISingleCaseWordChar =
+            /[\u00df\u0587\u0590-\u05f4\u0600-\u06ff\u3040-\u309f\u30a0-\u30ff\u3400-\u4db5\u4e00-\u9fcc\uac00-\ud7af]/;
+          function isWordCharBasic(ch2) {
+            return (
+              /\w/.test(ch2) ||
+              (ch2 > "\x80" &&
+                (ch2.toUpperCase() != ch2.toLowerCase() ||
+                  nonASCIISingleCaseWordChar.test(ch2)))
+            );
+          }
+          function isWordChar(ch2, helper) {
+            if (!helper) {
+              return isWordCharBasic(ch2);
+            }
+            if (helper.source.indexOf("\\w") > -1 && isWordCharBasic(ch2)) {
+              return true;
+            }
+            return helper.test(ch2);
+          }
+          function isEmpty2(obj) {
+            for (var n2 in obj) {
+              if (obj.hasOwnProperty(n2) && obj[n2]) {
+                return false;
+              }
+            }
+            return true;
+          }
+          var extendingChars =
+            /[\u0300-\u036f\u0483-\u0489\u0591-\u05bd\u05bf\u05c1\u05c2\u05c4\u05c5\u05c7\u0610-\u061a\u064b-\u065e\u0670\u06d6-\u06dc\u06de-\u06e4\u06e7\u06e8\u06ea-\u06ed\u0711\u0730-\u074a\u07a6-\u07b0\u07eb-\u07f3\u0816-\u0819\u081b-\u0823\u0825-\u0827\u0829-\u082d\u0900-\u0902\u093c\u0941-\u0948\u094d\u0951-\u0955\u0962\u0963\u0981\u09bc\u09be\u09c1-\u09c4\u09cd\u09d7\u09e2\u09e3\u0a01\u0a02\u0a3c\u0a41\u0a42\u0a47\u0a48\u0a4b-\u0a4d\u0a51\u0a70\u0a71\u0a75\u0a81\u0a82\u0abc\u0ac1-\u0ac5\u0ac7\u0ac8\u0acd\u0ae2\u0ae3\u0b01\u0b3c\u0b3e\u0b3f\u0b41-\u0b44\u0b4d\u0b56\u0b57\u0b62\u0b63\u0b82\u0bbe\u0bc0\u0bcd\u0bd7\u0c3e-\u0c40\u0c46-\u0c48\u0c4a-\u0c4d\u0c55\u0c56\u0c62\u0c63\u0cbc\u0cbf\u0cc2\u0cc6\u0ccc\u0ccd\u0cd5\u0cd6\u0ce2\u0ce3\u0d3e\u0d41-\u0d44\u0d4d\u0d57\u0d62\u0d63\u0dca\u0dcf\u0dd2-\u0dd4\u0dd6\u0ddf\u0e31\u0e34-\u0e3a\u0e47-\u0e4e\u0eb1\u0eb4-\u0eb9\u0ebb\u0ebc\u0ec8-\u0ecd\u0f18\u0f19\u0f35\u0f37\u0f39\u0f71-\u0f7e\u0f80-\u0f84\u0f86\u0f87\u0f90-\u0f97\u0f99-\u0fbc\u0fc6\u102d-\u1030\u1032-\u1037\u1039\u103a\u103d\u103e\u1058\u1059\u105e-\u1060\u1071-\u1074\u1082\u1085\u1086\u108d\u109d\u135f\u1712-\u1714\u1732-\u1734\u1752\u1753\u1772\u1773\u17b7-\u17bd\u17c6\u17c9-\u17d3\u17dd\u180b-\u180d\u18a9\u1920-\u1922\u1927\u1928\u1932\u1939-\u193b\u1a17\u1a18\u1a56\u1a58-\u1a5e\u1a60\u1a62\u1a65-\u1a6c\u1a73-\u1a7c\u1a7f\u1b00-\u1b03\u1b34\u1b36-\u1b3a\u1b3c\u1b42\u1b6b-\u1b73\u1b80\u1b81\u1ba2-\u1ba5\u1ba8\u1ba9\u1c2c-\u1c33\u1c36\u1c37\u1cd0-\u1cd2\u1cd4-\u1ce0\u1ce2-\u1ce8\u1ced\u1dc0-\u1de6\u1dfd-\u1dff\u200c\u200d\u20d0-\u20f0\u2cef-\u2cf1\u2de0-\u2dff\u302a-\u302f\u3099\u309a\ua66f-\ua672\ua67c\ua67d\ua6f0\ua6f1\ua802\ua806\ua80b\ua825\ua826\ua8c4\ua8e0-\ua8f1\ua926-\ua92d\ua947-\ua951\ua980-\ua982\ua9b3\ua9b6-\ua9b9\ua9bc\uaa29-\uaa2e\uaa31\uaa32\uaa35\uaa36\uaa43\uaa4c\uaab0\uaab2-\uaab4\uaab7\uaab8\uaabe\uaabf\uaac1\uabe5\uabe8\uabed\udc00-\udfff\ufb1e\ufe00-\ufe0f\ufe20-\ufe26\uff9e\uff9f]/;
+          function isExtendingChar(ch2) {
+            return ch2.charCodeAt(0) >= 768 && extendingChars.test(ch2);
+          }
+          function skipExtendingChars(str, pos, dir) {
+            while (
+              (dir < 0 ? pos > 0 : pos < str.length) &&
+              isExtendingChar(str.charAt(pos))
+            ) {
+              pos += dir;
+            }
+            return pos;
+          }
+          function findFirst(pred, from, to) {
+            var dir = from > to ? -1 : 1;
+            for (;;) {
+              if (from == to) {
+                return from;
+              }
+              var midF = (from + to) / 2,
+                mid2 = dir < 0 ? Math.ceil(midF) : Math.floor(midF);
+              if (mid2 == from) {
+                return pred(mid2) ? from : to;
+              }
+              if (pred(mid2)) {
+                to = mid2;
+              } else {
+                from = mid2 + dir;
+              }
+            }
+          }
+          function iterateBidiSections(order2, from, to, f) {
+            if (!order2) {
+              return f(from, to, "ltr", 0);
+            }
+            var found = false;
+            for (var i2 = 0; i2 < order2.length; ++i2) {
+              var part2 = order2[i2];
+              if (
+                (part2.from < to && part2.to > from) ||
+                (from == to && part2.to == from)
+              ) {
+                f(
+                  Math.max(part2.from, from),
+                  Math.min(part2.to, to),
+                  part2.level == 1 ? "rtl" : "ltr",
+                  i2
+                );
+                found = true;
+              }
+            }
+            if (!found) {
+              f(from, to, "ltr");
+            }
+          }
+          var bidiOther = null;
+          function getBidiPartAt(order2, ch2, sticky) {
+            var found;
+            bidiOther = null;
+            for (var i2 = 0; i2 < order2.length; ++i2) {
+              var cur = order2[i2];
+              if (cur.from < ch2 && cur.to > ch2) {
+                return i2;
+              }
+              if (cur.to == ch2) {
+                if (cur.from != cur.to && sticky == "before") {
+                  found = i2;
+                } else {
+                  bidiOther = i2;
+                }
+              }
+              if (cur.from == ch2) {
+                if (cur.from != cur.to && sticky != "before") {
+                  found = i2;
+                } else {
+                  bidiOther = i2;
+                }
+              }
+            }
+            return found != null ? found : bidiOther;
+          }
+          var bidiOrdering = (function () {
+            var lowTypes =
+              "bbbbbbbbbtstwsbbbbbbbbbbbbbbssstwNN%%%NNNNNN,N,N1111111111NNNNNNNLLLLLLLLLLLLLLLLLLLLLLLLLLNNNNNNLLLLLLLLLLLLLLLLLLLLLLLLLLNNNNbbbbbbsbbbbbbbbbbbbbbbbbbbbbbbbbb,N%%%%NNNNLNNNNN%%11NLNNN1LNNNNNLLLLLLLLLLLLLLLLLLLLLLLNLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLN";
+            var arabicTypes =
+              "nnnnnnNNr%%r,rNNmmmmmmmmmmmrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrmmmmmmmmmmmmmmmmmmmmmnnnnnnnnnn%nnrrrmrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrmmmmmmmnNmmmmmmrrmmNmmmmrr1111111111";
+            function charType(code3) {
+              if (code3 <= 247) {
+                return lowTypes.charAt(code3);
+              } else if (1424 <= code3 && code3 <= 1524) {
+                return "R";
+              } else if (1536 <= code3 && code3 <= 1785) {
+                return arabicTypes.charAt(code3 - 1536);
+              } else if (1774 <= code3 && code3 <= 2220) {
+                return "r";
+              } else if (8192 <= code3 && code3 <= 8203) {
+                return "w";
+              } else if (code3 == 8204) {
+                return "b";
+              } else {
+                return "L";
+              }
+            }
+            var bidiRE = /[\u0590-\u05f4\u0600-\u06ff\u0700-\u08ac]/;
+            var isNeutral = /[stwN]/,
+              isStrong = /[LRr]/,
+              countsAsLeft = /[Lb1n]/,
+              countsAsNum = /[1n]/;
+            function BidiSpan(level, from, to) {
+              this.level = level;
+              this.from = from;
+              this.to = to;
+            }
+            return function (str, direction) {
+              var outerType = direction == "ltr" ? "L" : "R";
+              if (
+                str.length == 0 ||
+                (direction == "ltr" && !bidiRE.test(str))
+              ) {
+                return false;
+              }
+              var len = str.length,
+                types = [];
+              for (var i2 = 0; i2 < len; ++i2) {
+                types.push(charType(str.charCodeAt(i2)));
+              }
+              for (var i$12 = 0, prev = outerType; i$12 < len; ++i$12) {
+                var type2 = types[i$12];
+                if (type2 == "m") {
+                  types[i$12] = prev;
+                } else {
+                  prev = type2;
+                }
+              }
+              for (var i$22 = 0, cur = outerType; i$22 < len; ++i$22) {
+                var type$1 = types[i$22];
+                if (type$1 == "1" && cur == "r") {
+                  types[i$22] = "n";
+                } else if (isStrong.test(type$1)) {
+                  cur = type$1;
+                  if (type$1 == "r") {
+                    types[i$22] = "R";
+                  }
+                }
+              }
+              for (var i$3 = 1, prev$1 = types[0]; i$3 < len - 1; ++i$3) {
+                var type$2 = types[i$3];
+                if (type$2 == "+" && prev$1 == "1" && types[i$3 + 1] == "1") {
+                  types[i$3] = "1";
+                } else if (
+                  type$2 == "," &&
+                  prev$1 == types[i$3 + 1] &&
+                  (prev$1 == "1" || prev$1 == "n")
+                ) {
+                  types[i$3] = prev$1;
+                }
+                prev$1 = type$2;
+              }
+              for (var i$4 = 0; i$4 < len; ++i$4) {
+                var type$3 = types[i$4];
+                if (type$3 == ",") {
+                  types[i$4] = "N";
+                } else if (type$3 == "%") {
+                  var end2 = void 0;
+                  for (
+                    end2 = i$4 + 1;
+                    end2 < len && types[end2] == "%";
+                    ++end2
+                  ) {}
+                  var replace2 =
+                    (i$4 && types[i$4 - 1] == "!") ||
+                    (end2 < len && types[end2] == "1")
+                      ? "1"
+                      : "N";
+                  for (var j = i$4; j < end2; ++j) {
+                    types[j] = replace2;
+                  }
+                  i$4 = end2 - 1;
+                }
+              }
+              for (var i$5 = 0, cur$1 = outerType; i$5 < len; ++i$5) {
+                var type$4 = types[i$5];
+                if (cur$1 == "L" && type$4 == "1") {
+                  types[i$5] = "L";
+                } else if (isStrong.test(type$4)) {
+                  cur$1 = type$4;
+                }
+              }
+              for (var i$6 = 0; i$6 < len; ++i$6) {
+                if (isNeutral.test(types[i$6])) {
+                  var end$1 = void 0;
+                  for (
+                    end$1 = i$6 + 1;
+                    end$1 < len && isNeutral.test(types[end$1]);
+                    ++end$1
+                  ) {}
+                  var before = (i$6 ? types[i$6 - 1] : outerType) == "L";
+                  var after = (end$1 < len ? types[end$1] : outerType) == "L";
+                  var replace$1 =
+                    before == after ? (before ? "L" : "R") : outerType;
+                  for (var j$1 = i$6; j$1 < end$1; ++j$1) {
+                    types[j$1] = replace$1;
+                  }
+                  i$6 = end$1 - 1;
+                }
+              }
+              var order2 = [],
+                m;
+              for (var i$7 = 0; i$7 < len; ) {
+                if (countsAsLeft.test(types[i$7])) {
+                  var start2 = i$7;
+                  for (
+                    ++i$7;
+                    i$7 < len && countsAsLeft.test(types[i$7]);
+                    ++i$7
+                  ) {}
+                  order2.push(new BidiSpan(0, start2, i$7));
+                } else {
+                  var pos = i$7,
+                    at = order2.length,
+                    isRTL = direction == "rtl" ? 1 : 0;
+                  for (++i$7; i$7 < len && types[i$7] != "L"; ++i$7) {}
+                  for (var j$2 = pos; j$2 < i$7; ) {
+                    if (countsAsNum.test(types[j$2])) {
+                      if (pos < j$2) {
+                        order2.splice(at, 0, new BidiSpan(1, pos, j$2));
+                        at += isRTL;
+                      }
+                      var nstart = j$2;
+                      for (
+                        ++j$2;
+                        j$2 < i$7 && countsAsNum.test(types[j$2]);
+                        ++j$2
+                      ) {}
+                      order2.splice(at, 0, new BidiSpan(2, nstart, j$2));
+                      at += isRTL;
+                      pos = j$2;
+                    } else {
+                      ++j$2;
+                    }
+                  }
+                  if (pos < i$7) {
+                    order2.splice(at, 0, new BidiSpan(1, pos, i$7));
+                  }
+                }
+              }
+              if (direction == "ltr") {
+                if (order2[0].level == 1 && (m = str.match(/^\s+/))) {
+                  order2[0].from = m[0].length;
+                  order2.unshift(new BidiSpan(0, 0, m[0].length));
+                }
+                if (lst(order2).level == 1 && (m = str.match(/\s+$/))) {
+                  lst(order2).to -= m[0].length;
+                  order2.push(new BidiSpan(0, len - m[0].length, len));
+                }
+              }
+              return direction == "rtl" ? order2.reverse() : order2;
+            };
+          })();
+          function getOrder(line, direction) {
+            var order2 = line.order;
+            if (order2 == null) {
+              order2 = line.order = bidiOrdering(line.text, direction);
+            }
+            return order2;
+          }
+          var noHandlers = [];
+          var on = function (emitter, type2, f) {
+            if (emitter.addEventListener) {
+              emitter.addEventListener(type2, f, false);
+            } else if (emitter.attachEvent) {
+              emitter.attachEvent("on" + type2, f);
+            } else {
+              var map3 = emitter._handlers || (emitter._handlers = {});
+              map3[type2] = (map3[type2] || noHandlers).concat(f);
+            }
+          };
+          function getHandlers(emitter, type2) {
+            return (
+              (emitter._handlers && emitter._handlers[type2]) || noHandlers
+            );
+          }
+          function off(emitter, type2, f) {
+            if (emitter.removeEventListener) {
+              emitter.removeEventListener(type2, f, false);
+            } else if (emitter.detachEvent) {
+              emitter.detachEvent("on" + type2, f);
+            } else {
+              var map3 = emitter._handlers,
+                arr = map3 && map3[type2];
+              if (arr) {
+                var index = indexOf(arr, f);
+                if (index > -1) {
+                  map3[type2] = arr
+                    .slice(0, index)
+                    .concat(arr.slice(index + 1));
+                }
+              }
+            }
+          }
+          function signal(emitter, type2) {
+            var handlers = getHandlers(emitter, type2);
+            if (!handlers.length) {
+              return;
+            }
+            var args = Array.prototype.slice.call(arguments, 2);
+            for (var i2 = 0; i2 < handlers.length; ++i2) {
+              handlers[i2].apply(null, args);
+            }
+          }
+          function signalDOMEvent(cm, e, override) {
+            if (typeof e == "string") {
+              e = {
+                type: e,
+                preventDefault: function () {
+                  this.defaultPrevented = true;
+                },
+              };
+            }
+            signal(cm, override || e.type, cm, e);
+            return e_defaultPrevented(e) || e.codemirrorIgnore;
+          }
+          function signalCursorActivity(cm) {
+            var arr = cm._handlers && cm._handlers.cursorActivity;
+            if (!arr) {
+              return;
+            }
+            var set2 =
+              cm.curOp.cursorActivityHandlers ||
+              (cm.curOp.cursorActivityHandlers = []);
+            for (var i2 = 0; i2 < arr.length; ++i2) {
+              if (indexOf(set2, arr[i2]) == -1) {
+                set2.push(arr[i2]);
+              }
+            }
+          }
+          function hasHandler(emitter, type2) {
+            return getHandlers(emitter, type2).length > 0;
+          }
+          function eventMixin(ctor) {
+            ctor.prototype.on = function (type2, f) {
+              on(this, type2, f);
+            };
+            ctor.prototype.off = function (type2, f) {
+              off(this, type2, f);
+            };
+          }
+          function e_preventDefault(e) {
+            if (e.preventDefault) {
+              e.preventDefault();
+            } else {
+              e.returnValue = false;
+            }
+          }
+          function e_stopPropagation(e) {
+            if (e.stopPropagation) {
+              e.stopPropagation();
+            } else {
+              e.cancelBubble = true;
+            }
+          }
+          function e_defaultPrevented(e) {
+            return e.defaultPrevented != null
+              ? e.defaultPrevented
+              : e.returnValue == false;
+          }
+          function e_stop(e) {
+            e_preventDefault(e);
+            e_stopPropagation(e);
+          }
+          function e_target(e) {
+            return e.target || e.srcElement;
+          }
+          function e_button(e) {
+            var b = e.which;
+            if (b == null) {
+              if (e.button & 1) {
+                b = 1;
+              } else if (e.button & 2) {
+                b = 3;
+              } else if (e.button & 4) {
+                b = 2;
+              }
+            }
+            if (mac && e.ctrlKey && b == 1) {
+              b = 3;
+            }
+            return b;
+          }
+          var dragAndDrop = (function () {
+            if (ie2 && ie_version < 9) {
+              return false;
+            }
+            var div2 = elt("div");
+            return "draggable" in div2 || "dragDrop" in div2;
+          })();
+          var zwspSupported;
+          function zeroWidthElement(measure) {
+            if (zwspSupported == null) {
+              var test2 = elt("span", "\u200B");
+              removeChildrenAndAdd(
+                measure,
+                elt("span", [test2, document.createTextNode("x")])
+              );
+              if (measure.firstChild.offsetHeight != 0) {
+                zwspSupported =
+                  test2.offsetWidth <= 1 &&
+                  test2.offsetHeight > 2 &&
+                  !(ie2 && ie_version < 8);
+              }
+            }
+            var node = zwspSupported
+              ? elt("span", "\u200B")
+              : elt(
+                  "span",
+                  "\xA0",
+                  null,
+                  "display: inline-block; width: 1px; margin-right: -1px"
+                );
+            node.setAttribute("cm-text", "");
+            return node;
+          }
+          var badBidiRects;
+          function hasBadBidiRects(measure) {
+            if (badBidiRects != null) {
+              return badBidiRects;
+            }
+            var txt = removeChildrenAndAdd(
+              measure,
+              document.createTextNode("A\u062EA")
+            );
+            var r0 = range2(txt, 0, 1).getBoundingClientRect();
+            var r1 = range2(txt, 1, 2).getBoundingClientRect();
+            removeChildren(measure);
+            if (!r0 || r0.left == r0.right) {
+              return false;
+            }
+            return (badBidiRects = r1.right - r0.right < 3);
+          }
+          var splitLinesAuto =
+            "\n\nb".split(/\n/).length != 3
+              ? function (string2) {
+                  var pos = 0,
+                    result2 = [],
+                    l2 = string2.length;
+                  while (pos <= l2) {
+                    var nl = string2.indexOf("\n", pos);
+                    if (nl == -1) {
+                      nl = string2.length;
+                    }
+                    var line = string2.slice(
+                      pos,
+                      string2.charAt(nl - 1) == "\r" ? nl - 1 : nl
+                    );
+                    var rt = line.indexOf("\r");
+                    if (rt != -1) {
+                      result2.push(line.slice(0, rt));
+                      pos += rt + 1;
+                    } else {
+                      result2.push(line);
+                      pos = nl + 1;
+                    }
+                  }
+                  return result2;
+                }
+              : function (string2) {
+                  return string2.split(/\r\n?|\n/);
+                };
+          var hasSelection = window.getSelection
+            ? function (te) {
+                try {
+                  return te.selectionStart != te.selectionEnd;
+                } catch (e) {
+                  return false;
+                }
+              }
+            : function (te) {
+                var range3;
+                try {
+                  range3 = te.ownerDocument.selection.createRange();
+                } catch (e) {}
+                if (!range3 || range3.parentElement() != te) {
+                  return false;
+                }
+                return range3.compareEndPoints("StartToEnd", range3) != 0;
+              };
+          var hasCopyEvent = (function () {
+            var e = elt("div");
+            if ("oncopy" in e) {
+              return true;
+            }
+            e.setAttribute("oncopy", "return;");
+            return typeof e.oncopy == "function";
+          })();
+          var badZoomedRects = null;
+          function hasBadZoomedRects(measure) {
+            if (badZoomedRects != null) {
+              return badZoomedRects;
+            }
+            var node = removeChildrenAndAdd(measure, elt("span", "x"));
+            var normal = node.getBoundingClientRect();
+            var fromRange = range2(node, 0, 1).getBoundingClientRect();
+            return (badZoomedRects =
+              Math.abs(normal.left - fromRange.left) > 1);
+          }
+          var modes = {},
+            mimeModes = {};
+          function defineMode(name2, mode2) {
+            if (arguments.length > 2) {
+              mode2.dependencies = Array.prototype.slice.call(arguments, 2);
+            }
+            modes[name2] = mode2;
+          }
+          function defineMIME(mime, spec) {
+            mimeModes[mime] = spec;
+          }
+          function resolveMode(spec) {
+            if (typeof spec == "string" && mimeModes.hasOwnProperty(spec)) {
+              spec = mimeModes[spec];
+            } else if (
+              spec &&
+              typeof spec.name == "string" &&
+              mimeModes.hasOwnProperty(spec.name)
+            ) {
+              var found = mimeModes[spec.name];
+              if (typeof found == "string") {
+                found = { name: found };
+              }
+              spec = createObj(found, spec);
+              spec.name = found.name;
+            } else if (
+              typeof spec == "string" &&
+              /^[\w\-]+\/[\w\-]+\+xml$/.test(spec)
+            ) {
+              return resolveMode("application/xml");
+            } else if (
+              typeof spec == "string" &&
+              /^[\w\-]+\/[\w\-]+\+json$/.test(spec)
+            ) {
+              return resolveMode("application/json");
+            }
+            if (typeof spec == "string") {
+              return { name: spec };
+            } else {
+              return spec || { name: "null" };
+            }
+          }
+          function getMode(options, spec) {
+            spec = resolveMode(spec);
+            var mfactory = modes[spec.name];
+            if (!mfactory) {
+              return getMode(options, "text/plain");
+            }
+            var modeObj = mfactory(options, spec);
+            if (modeExtensions.hasOwnProperty(spec.name)) {
+              var exts = modeExtensions[spec.name];
+              for (var prop3 in exts) {
+                if (!exts.hasOwnProperty(prop3)) {
+                  continue;
+                }
+                if (modeObj.hasOwnProperty(prop3)) {
+                  modeObj["_" + prop3] = modeObj[prop3];
+                }
+                modeObj[prop3] = exts[prop3];
+              }
+            }
+            modeObj.name = spec.name;
+            if (spec.helperType) {
+              modeObj.helperType = spec.helperType;
+            }
+            if (spec.modeProps) {
+              for (var prop$1 in spec.modeProps) {
+                modeObj[prop$1] = spec.modeProps[prop$1];
+              }
+            }
+            return modeObj;
+          }
+          var modeExtensions = {};
+          function extendMode(mode2, properties) {
+            var exts = modeExtensions.hasOwnProperty(mode2)
+              ? modeExtensions[mode2]
+              : (modeExtensions[mode2] = {});
+            copyObj(properties, exts);
+          }
+          function copyState(mode2, state) {
+            if (state === true) {
+              return state;
+            }
+            if (mode2.copyState) {
+              return mode2.copyState(state);
+            }
+            var nstate = {};
+            for (var n2 in state) {
+              var val = state[n2];
+              if (val instanceof Array) {
+                val = val.concat([]);
+              }
+              nstate[n2] = val;
+            }
+            return nstate;
+          }
+          function innerMode(mode2, state) {
+            var info2;
+            while (mode2.innerMode) {
+              info2 = mode2.innerMode(state);
+              if (!info2 || info2.mode == mode2) {
+                break;
+              }
+              state = info2.state;
+              mode2 = info2.mode;
+            }
+            return info2 || { mode: mode2, state };
+          }
+          function startState(mode2, a1, a2) {
+            return mode2.startState ? mode2.startState(a1, a2) : true;
+          }
+          var StringStream = function (string2, tabSize, lineOracle) {
+            this.pos = this.start = 0;
+            this.string = string2;
+            this.tabSize = tabSize || 8;
+            this.lastColumnPos = this.lastColumnValue = 0;
+            this.lineStart = 0;
+            this.lineOracle = lineOracle;
+          };
+          StringStream.prototype.eol = function () {
+            return this.pos >= this.string.length;
+          };
+          StringStream.prototype.sol = function () {
+            return this.pos == this.lineStart;
+          };
+          StringStream.prototype.peek = function () {
+            return this.string.charAt(this.pos) || void 0;
+          };
+          StringStream.prototype.next = function () {
+            if (this.pos < this.string.length) {
+              return this.string.charAt(this.pos++);
+            }
+          };
+          StringStream.prototype.eat = function (match2) {
+            var ch2 = this.string.charAt(this.pos);
+            var ok2;
+            if (typeof match2 == "string") {
+              ok2 = ch2 == match2;
+            } else {
+              ok2 = ch2 && (match2.test ? match2.test(ch2) : match2(ch2));
+            }
+            if (ok2) {
+              ++this.pos;
+              return ch2;
+            }
+          };
+          StringStream.prototype.eatWhile = function (match2) {
+            var start2 = this.pos;
+            while (this.eat(match2)) {}
+            return this.pos > start2;
+          };
+          StringStream.prototype.eatSpace = function () {
+            var start2 = this.pos;
+            while (/[\s\u00a0]/.test(this.string.charAt(this.pos))) {
+              ++this.pos;
+            }
+            return this.pos > start2;
+          };
+          StringStream.prototype.skipToEnd = function () {
+            this.pos = this.string.length;
+          };
+          StringStream.prototype.skipTo = function (ch2) {
+            var found = this.string.indexOf(ch2, this.pos);
+            if (found > -1) {
+              this.pos = found;
+              return true;
+            }
+          };
+          StringStream.prototype.backUp = function (n2) {
+            this.pos -= n2;
+          };
+          StringStream.prototype.column = function () {
+            if (this.lastColumnPos < this.start) {
+              this.lastColumnValue = countColumn(
+                this.string,
+                this.start,
+                this.tabSize,
+                this.lastColumnPos,
+                this.lastColumnValue
+              );
+              this.lastColumnPos = this.start;
+            }
+            return (
+              this.lastColumnValue -
+              (this.lineStart
+                ? countColumn(this.string, this.lineStart, this.tabSize)
+                : 0)
+            );
+          };
+          StringStream.prototype.indentation = function () {
+            return (
+              countColumn(this.string, null, this.tabSize) -
+              (this.lineStart
+                ? countColumn(this.string, this.lineStart, this.tabSize)
+                : 0)
+            );
+          };
+          StringStream.prototype.match = function (
+            pattern,
+            consume,
+            caseInsensitive
+          ) {
+            if (typeof pattern == "string") {
+              var cased = function (str) {
+                return caseInsensitive ? str.toLowerCase() : str;
+              };
+              var substr = this.string.substr(this.pos, pattern.length);
+              if (cased(substr) == cased(pattern)) {
+                if (consume !== false) {
+                  this.pos += pattern.length;
+                }
+                return true;
+              }
+            } else {
+              var match2 = this.string.slice(this.pos).match(pattern);
+              if (match2 && match2.index > 0) {
+                return null;
+              }
+              if (match2 && consume !== false) {
+                this.pos += match2[0].length;
+              }
+              return match2;
+            }
+          };
+          StringStream.prototype.current = function () {
+            return this.string.slice(this.start, this.pos);
+          };
+          StringStream.prototype.hideFirstChars = function (n2, inner) {
+            this.lineStart += n2;
+            try {
+              return inner();
+            } finally {
+              this.lineStart -= n2;
+            }
+          };
+          StringStream.prototype.lookAhead = function (n2) {
+            var oracle = this.lineOracle;
+            return oracle && oracle.lookAhead(n2);
+          };
+          StringStream.prototype.baseToken = function () {
+            var oracle = this.lineOracle;
+            return oracle && oracle.baseToken(this.pos);
+          };
+          function getLine2(doc, n2) {
+            n2 -= doc.first;
+            if (n2 < 0 || n2 >= doc.size) {
+              throw new Error(
+                "There is no line " + (n2 + doc.first) + " in the document."
+              );
+            }
+            var chunk = doc;
+            while (!chunk.lines) {
+              for (var i2 = 0; ; ++i2) {
+                var child = chunk.children[i2],
+                  sz = child.chunkSize();
+                if (n2 < sz) {
+                  chunk = child;
+                  break;
+                }
+                n2 -= sz;
+              }
+            }
+            return chunk.lines[n2];
+          }
+          function getBetween(doc, start2, end2) {
+            var out = [],
+              n2 = start2.line;
+            doc.iter(start2.line, end2.line + 1, function (line) {
+              var text3 = line.text;
+              if (n2 == end2.line) {
+                text3 = text3.slice(0, end2.ch);
+              }
+              if (n2 == start2.line) {
+                text3 = text3.slice(start2.ch);
+              }
+              out.push(text3);
+              ++n2;
+            });
+            return out;
+          }
+          function getLines2(doc, from, to) {
+            var out = [];
+            doc.iter(from, to, function (line) {
+              out.push(line.text);
+            });
+            return out;
+          }
+          function updateLineHeight(line, height) {
+            var diff2 = height - line.height;
+            if (diff2) {
+              for (var n2 = line; n2; n2 = n2.parent) {
+                n2.height += diff2;
+              }
+            }
+          }
+          function lineNo(line) {
+            if (line.parent == null) {
+              return null;
+            }
+            var cur = line.parent,
+              no = indexOf(cur.lines, line);
+            for (
+              var chunk = cur.parent;
+              chunk;
+              cur = chunk, chunk = chunk.parent
+            ) {
+              for (var i2 = 0; ; ++i2) {
+                if (chunk.children[i2] == cur) {
+                  break;
+                }
+                no += chunk.children[i2].chunkSize();
+              }
+            }
+            return no + cur.first;
+          }
+          function lineAtHeight(chunk, h) {
+            var n2 = chunk.first;
+            outer: do {
+              for (var i$12 = 0; i$12 < chunk.children.length; ++i$12) {
+                var child = chunk.children[i$12],
+                  ch2 = child.height;
+                if (h < ch2) {
+                  chunk = child;
+                  continue outer;
+                }
+                h -= ch2;
+                n2 += child.chunkSize();
+              }
+              return n2;
+            } while (!chunk.lines);
+            var i2 = 0;
+            for (; i2 < chunk.lines.length; ++i2) {
+              var line = chunk.lines[i2],
+                lh2 = line.height;
+              if (h < lh2) {
+                break;
+              }
+              h -= lh2;
+            }
+            return n2 + i2;
+          }
+          function isLine(doc, l2) {
+            return l2 >= doc.first && l2 < doc.first + doc.size;
+          }
+          function lineNumberFor(options, i2) {
+            return String(
+              options.lineNumberFormatter(i2 + options.firstLineNumber)
+            );
+          }
+          function Pos(line, ch2, sticky) {
+            if (sticky === void 0) sticky = null;
+            if (!(this instanceof Pos)) {
+              return new Pos(line, ch2, sticky);
+            }
+            this.line = line;
+            this.ch = ch2;
+            this.sticky = sticky;
+          }
+          function cmp(a, b) {
+            return a.line - b.line || a.ch - b.ch;
+          }
+          function equalCursorPos(a, b) {
+            return a.sticky == b.sticky && cmp(a, b) == 0;
+          }
+          function copyPos(x2) {
+            return Pos(x2.line, x2.ch);
+          }
+          function maxPos(a, b) {
+            return cmp(a, b) < 0 ? b : a;
+          }
+          function minPos(a, b) {
+            return cmp(a, b) < 0 ? a : b;
+          }
+          function clipLine(doc, n2) {
+            return Math.max(doc.first, Math.min(n2, doc.first + doc.size - 1));
+          }
+          function clipPos(doc, pos) {
+            if (pos.line < doc.first) {
+              return Pos(doc.first, 0);
+            }
+            var last = doc.first + doc.size - 1;
+            if (pos.line > last) {
+              return Pos(last, getLine2(doc, last).text.length);
+            }
+            return clipToLen(pos, getLine2(doc, pos.line).text.length);
+          }
+          function clipToLen(pos, linelen) {
+            var ch2 = pos.ch;
+            if (ch2 == null || ch2 > linelen) {
+              return Pos(pos.line, linelen);
+            } else if (ch2 < 0) {
+              return Pos(pos.line, 0);
+            } else {
+              return pos;
+            }
+          }
+          function clipPosArray(doc, array) {
+            var out = [];
+            for (var i2 = 0; i2 < array.length; i2++) {
+              out[i2] = clipPos(doc, array[i2]);
+            }
+            return out;
+          }
+          var SavedContext = function (state, lookAhead) {
+            this.state = state;
+            this.lookAhead = lookAhead;
+          };
+          var Context = function (doc, state, line, lookAhead) {
+            this.state = state;
+            this.doc = doc;
+            this.line = line;
+            this.maxLookAhead = lookAhead || 0;
+            this.baseTokens = null;
+            this.baseTokenPos = 1;
+          };
+          Context.prototype.lookAhead = function (n2) {
+            var line = this.doc.getLine(this.line + n2);
+            if (line != null && n2 > this.maxLookAhead) {
+              this.maxLookAhead = n2;
+            }
+            return line;
+          };
+          Context.prototype.baseToken = function (n2) {
+            if (!this.baseTokens) {
+              return null;
+            }
+            while (this.baseTokens[this.baseTokenPos] <= n2) {
+              this.baseTokenPos += 2;
+            }
+            var type2 = this.baseTokens[this.baseTokenPos + 1];
+            return {
+              type: type2 && type2.replace(/( |^)overlay .*/, ""),
+              size: this.baseTokens[this.baseTokenPos] - n2,
+            };
+          };
+          Context.prototype.nextLine = function () {
+            this.line++;
+            if (this.maxLookAhead > 0) {
+              this.maxLookAhead--;
+            }
+          };
+          Context.fromSaved = function (doc, saved, line) {
+            if (saved instanceof SavedContext) {
+              return new Context(
+                doc,
+                copyState(doc.mode, saved.state),
+                line,
+                saved.lookAhead
+              );
+            } else {
+              return new Context(doc, copyState(doc.mode, saved), line);
+            }
+          };
+          Context.prototype.save = function (copy2) {
+            var state =
+              copy2 !== false
+                ? copyState(this.doc.mode, this.state)
+                : this.state;
+            return this.maxLookAhead > 0
+              ? new SavedContext(state, this.maxLookAhead)
+              : state;
+          };
+          function highlightLine(cm, line, context, forceToEnd) {
+            var st = [cm.state.modeGen],
+              lineClasses = {};
+            runMode(
+              cm,
+              line.text,
+              cm.doc.mode,
+              context,
+              function (end2, style) {
+                return st.push(end2, style);
+              },
+              lineClasses,
+              forceToEnd
+            );
+            var state = context.state;
+            var loop = function (o2) {
+              context.baseTokens = st;
+              var overlay = cm.state.overlays[o2],
+                i2 = 1,
+                at = 0;
+              context.state = true;
+              runMode(
+                cm,
+                line.text,
+                overlay.mode,
+                context,
+                function (end2, style) {
+                  var start2 = i2;
+                  while (at < end2) {
+                    var i_end = st[i2];
+                    if (i_end > end2) {
+                      st.splice(i2, 1, end2, st[i2 + 1], i_end);
+                    }
+                    i2 += 2;
+                    at = Math.min(end2, i_end);
+                  }
+                  if (!style) {
+                    return;
+                  }
+                  if (overlay.opaque) {
+                    st.splice(start2, i2 - start2, end2, "overlay " + style);
+                    i2 = start2 + 2;
+                  } else {
+                    for (; start2 < i2; start2 += 2) {
+                      var cur = st[start2 + 1];
+                      st[start2 + 1] =
+                        (cur ? cur + " " : "") + "overlay " + style;
+                    }
+                  }
+                },
+                lineClasses
+              );
+              context.state = state;
+              context.baseTokens = null;
+              context.baseTokenPos = 1;
+            };
+            for (var o = 0; o < cm.state.overlays.length; ++o) loop(o);
+            return {
+              styles: st,
+              classes:
+                lineClasses.bgClass || lineClasses.textClass
+                  ? lineClasses
+                  : null,
+            };
+          }
+          function getLineStyles(cm, line, updateFrontier) {
+            if (!line.styles || line.styles[0] != cm.state.modeGen) {
+              var context = getContextBefore(cm, lineNo(line));
+              var resetState =
+                line.text.length > cm.options.maxHighlightLength &&
+                copyState(cm.doc.mode, context.state);
+              var result2 = highlightLine(cm, line, context);
+              if (resetState) {
+                context.state = resetState;
+              }
+              line.stateAfter = context.save(!resetState);
+              line.styles = result2.styles;
+              if (result2.classes) {
+                line.styleClasses = result2.classes;
+              } else if (line.styleClasses) {
+                line.styleClasses = null;
+              }
+              if (updateFrontier === cm.doc.highlightFrontier) {
+                cm.doc.modeFrontier = Math.max(
+                  cm.doc.modeFrontier,
+                  ++cm.doc.highlightFrontier
+                );
+              }
+            }
+            return line.styles;
+          }
+          function getContextBefore(cm, n2, precise) {
+            var doc = cm.doc,
+              display = cm.display;
+            if (!doc.mode.startState) {
+              return new Context(doc, true, n2);
+            }
+            var start2 = findStartLine(cm, n2, precise);
+            var saved =
+              start2 > doc.first && getLine2(doc, start2 - 1).stateAfter;
+            var context = saved
+              ? Context.fromSaved(doc, saved, start2)
+              : new Context(doc, startState(doc.mode), start2);
+            doc.iter(start2, n2, function (line) {
+              processLine(cm, line.text, context);
+              var pos = context.line;
+              line.stateAfter =
+                pos == n2 - 1 ||
+                pos % 5 == 0 ||
+                (pos >= display.viewFrom && pos < display.viewTo)
+                  ? context.save()
+                  : null;
+              context.nextLine();
+            });
+            if (precise) {
+              doc.modeFrontier = context.line;
+            }
+            return context;
+          }
+          function processLine(cm, text3, context, startAt) {
+            var mode2 = cm.doc.mode;
+            var stream = new StringStream(text3, cm.options.tabSize, context);
+            stream.start = stream.pos = startAt || 0;
+            if (text3 == "") {
+              callBlankLine(mode2, context.state);
+            }
+            while (!stream.eol()) {
+              readToken(mode2, stream, context.state);
+              stream.start = stream.pos;
+            }
+          }
+          function callBlankLine(mode2, state) {
+            if (mode2.blankLine) {
+              return mode2.blankLine(state);
+            }
+            if (!mode2.innerMode) {
+              return;
+            }
+            var inner = innerMode(mode2, state);
+            if (inner.mode.blankLine) {
+              return inner.mode.blankLine(inner.state);
+            }
+          }
+          function readToken(mode2, stream, state, inner) {
+            for (var i2 = 0; i2 < 10; i2++) {
+              if (inner) {
+                inner[0] = innerMode(mode2, state).mode;
+              }
+              var style = mode2.token(stream, state);
+              if (stream.pos > stream.start) {
+                return style;
+              }
+            }
+            throw new Error(
+              "Mode " + mode2.name + " failed to advance stream."
+            );
+          }
+          var Token2 = function (stream, type2, state) {
+            this.start = stream.start;
+            this.end = stream.pos;
+            this.string = stream.current();
+            this.type = type2 || null;
+            this.state = state;
+          };
+          function takeToken(cm, pos, precise, asArray) {
+            var doc = cm.doc,
+              mode2 = doc.mode,
+              style;
+            pos = clipPos(doc, pos);
+            var line = getLine2(doc, pos.line),
+              context = getContextBefore(cm, pos.line, precise);
+            var stream = new StringStream(
+                line.text,
+                cm.options.tabSize,
+                context
+              ),
+              tokens;
+            if (asArray) {
+              tokens = [];
+            }
+            while ((asArray || stream.pos < pos.ch) && !stream.eol()) {
+              stream.start = stream.pos;
+              style = readToken(mode2, stream, context.state);
+              if (asArray) {
+                tokens.push(
+                  new Token2(stream, style, copyState(doc.mode, context.state))
+                );
+              }
+            }
+            return asArray ? tokens : new Token2(stream, style, context.state);
+          }
+          function extractLineClasses(type2, output) {
+            if (type2) {
+              for (;;) {
+                var lineClass = type2.match(
+                  /(?:^|\s+)line-(background-)?(\S+)/
+                );
+                if (!lineClass) {
+                  break;
+                }
+                type2 =
+                  type2.slice(0, lineClass.index) +
+                  type2.slice(lineClass.index + lineClass[0].length);
+                var prop3 = lineClass[1] ? "bgClass" : "textClass";
+                if (output[prop3] == null) {
+                  output[prop3] = lineClass[2];
+                } else if (
+                  !new RegExp("(?:^|\\s)" + lineClass[2] + "(?:$|\\s)").test(
+                    output[prop3]
+                  )
+                ) {
+                  output[prop3] += " " + lineClass[2];
+                }
+              }
+            }
+            return type2;
+          }
+          function runMode(
+            cm,
+            text3,
+            mode2,
+            context,
+            f,
+            lineClasses,
+            forceToEnd
+          ) {
+            var flattenSpans = mode2.flattenSpans;
+            if (flattenSpans == null) {
+              flattenSpans = cm.options.flattenSpans;
+            }
+            var curStart = 0,
+              curStyle = null;
+            var stream = new StringStream(text3, cm.options.tabSize, context),
+              style;
+            var inner = cm.options.addModeClass && [null];
+            if (text3 == "") {
+              extractLineClasses(
+                callBlankLine(mode2, context.state),
+                lineClasses
+              );
+            }
+            while (!stream.eol()) {
+              if (stream.pos > cm.options.maxHighlightLength) {
+                flattenSpans = false;
+                if (forceToEnd) {
+                  processLine(cm, text3, context, stream.pos);
+                }
+                stream.pos = text3.length;
+                style = null;
+              } else {
+                style = extractLineClasses(
+                  readToken(mode2, stream, context.state, inner),
+                  lineClasses
+                );
+              }
+              if (inner) {
+                var mName = inner[0].name;
+                if (mName) {
+                  style = "m-" + (style ? mName + " " + style : mName);
+                }
+              }
+              if (!flattenSpans || curStyle != style) {
+                while (curStart < stream.start) {
+                  curStart = Math.min(stream.start, curStart + 5e3);
+                  f(curStart, curStyle);
+                }
+                curStyle = style;
+              }
+              stream.start = stream.pos;
+            }
+            while (curStart < stream.pos) {
+              var pos = Math.min(stream.pos, curStart + 5e3);
+              f(pos, curStyle);
+              curStart = pos;
+            }
+          }
+          function findStartLine(cm, n2, precise) {
+            var minindent,
+              minline,
+              doc = cm.doc;
+            var lim = precise ? -1 : n2 - (cm.doc.mode.innerMode ? 1e3 : 100);
+            for (var search2 = n2; search2 > lim; --search2) {
+              if (search2 <= doc.first) {
+                return doc.first;
+              }
+              var line = getLine2(doc, search2 - 1),
+                after = line.stateAfter;
+              if (
+                after &&
+                (!precise ||
+                  search2 +
+                    (after instanceof SavedContext ? after.lookAhead : 0) <=
+                    doc.modeFrontier)
+              ) {
+                return search2;
+              }
+              var indented = countColumn(line.text, null, cm.options.tabSize);
+              if (minline == null || minindent > indented) {
+                minline = search2 - 1;
+                minindent = indented;
+              }
+            }
+            return minline;
+          }
+          function retreatFrontier(doc, n2) {
+            doc.modeFrontier = Math.min(doc.modeFrontier, n2);
+            if (doc.highlightFrontier < n2 - 10) {
+              return;
+            }
+            var start2 = doc.first;
+            for (var line = n2 - 1; line > start2; line--) {
+              var saved = getLine2(doc, line).stateAfter;
+              if (
+                saved &&
+                (!(saved instanceof SavedContext) ||
+                  line + saved.lookAhead < n2)
+              ) {
+                start2 = line + 1;
+                break;
+              }
+            }
+            doc.highlightFrontier = Math.min(doc.highlightFrontier, start2);
+          }
+          var sawReadOnlySpans = false,
+            sawCollapsedSpans = false;
+          function seeReadOnlySpans() {
+            sawReadOnlySpans = true;
+          }
+          function seeCollapsedSpans() {
+            sawCollapsedSpans = true;
+          }
+          function MarkedSpan(marker2, from, to) {
+            this.marker = marker2;
+            this.from = from;
+            this.to = to;
+          }
+          function getMarkedSpanFor(spans, marker2) {
+            if (spans) {
+              for (var i2 = 0; i2 < spans.length; ++i2) {
+                var span = spans[i2];
+                if (span.marker == marker2) {
+                  return span;
+                }
+              }
+            }
+          }
+          function removeMarkedSpan(spans, span) {
+            var r2;
+            for (var i2 = 0; i2 < spans.length; ++i2) {
+              if (spans[i2] != span) {
+                (r2 || (r2 = [])).push(spans[i2]);
+              }
+            }
+            return r2;
+          }
+          function addMarkedSpan(line, span, op) {
+            var inThisOp =
+              op &&
+              window.WeakSet &&
+              (op.markedSpans ||
+                (op.markedSpans = /* @__PURE__ */ new WeakSet()));
+            if (inThisOp && inThisOp.has(line.markedSpans)) {
+              line.markedSpans.push(span);
+            } else {
+              line.markedSpans = line.markedSpans
+                ? line.markedSpans.concat([span])
+                : [span];
+              if (inThisOp) {
+                inThisOp.add(line.markedSpans);
+              }
+            }
+            span.marker.attachLine(line);
+          }
+          function markedSpansBefore(old, startCh, isInsert) {
+            var nw;
+            if (old) {
+              for (var i2 = 0; i2 < old.length; ++i2) {
+                var span = old[i2],
+                  marker2 = span.marker;
+                var startsBefore =
+                  span.from == null ||
+                  (marker2.inclusiveLeft
+                    ? span.from <= startCh
+                    : span.from < startCh);
+                if (
+                  startsBefore ||
+                  (span.from == startCh &&
+                    marker2.type == "bookmark" &&
+                    (!isInsert || !span.marker.insertLeft))
+                ) {
+                  var endsAfter =
+                    span.to == null ||
+                    (marker2.inclusiveRight
+                      ? span.to >= startCh
+                      : span.to > startCh);
+                  (nw || (nw = [])).push(
+                    new MarkedSpan(
+                      marker2,
+                      span.from,
+                      endsAfter ? null : span.to
+                    )
+                  );
+                }
+              }
+            }
+            return nw;
+          }
+          function markedSpansAfter(old, endCh, isInsert) {
+            var nw;
+            if (old) {
+              for (var i2 = 0; i2 < old.length; ++i2) {
+                var span = old[i2],
+                  marker2 = span.marker;
+                var endsAfter =
+                  span.to == null ||
+                  (marker2.inclusiveRight ? span.to >= endCh : span.to > endCh);
+                if (
+                  endsAfter ||
+                  (span.from == endCh &&
+                    marker2.type == "bookmark" &&
+                    (!isInsert || span.marker.insertLeft))
+                ) {
+                  var startsBefore =
+                    span.from == null ||
+                    (marker2.inclusiveLeft
+                      ? span.from <= endCh
+                      : span.from < endCh);
+                  (nw || (nw = [])).push(
+                    new MarkedSpan(
+                      marker2,
+                      startsBefore ? null : span.from - endCh,
+                      span.to == null ? null : span.to - endCh
+                    )
+                  );
+                }
+              }
+            }
+            return nw;
+          }
+          function stretchSpansOverChange(doc, change) {
+            if (change.full) {
+              return null;
+            }
+            var oldFirst =
+              isLine(doc, change.from.line) &&
+              getLine2(doc, change.from.line).markedSpans;
+            var oldLast =
+              isLine(doc, change.to.line) &&
+              getLine2(doc, change.to.line).markedSpans;
+            if (!oldFirst && !oldLast) {
+              return null;
+            }
+            var startCh = change.from.ch,
+              endCh = change.to.ch,
+              isInsert = cmp(change.from, change.to) == 0;
+            var first = markedSpansBefore(oldFirst, startCh, isInsert);
+            var last = markedSpansAfter(oldLast, endCh, isInsert);
+            var sameLine = change.text.length == 1,
+              offset = lst(change.text).length + (sameLine ? startCh : 0);
+            if (first) {
+              for (var i2 = 0; i2 < first.length; ++i2) {
+                var span = first[i2];
+                if (span.to == null) {
+                  var found = getMarkedSpanFor(last, span.marker);
+                  if (!found) {
+                    span.to = startCh;
+                  } else if (sameLine) {
+                    span.to = found.to == null ? null : found.to + offset;
+                  }
+                }
+              }
+            }
+            if (last) {
+              for (var i$12 = 0; i$12 < last.length; ++i$12) {
+                var span$1 = last[i$12];
+                if (span$1.to != null) {
+                  span$1.to += offset;
+                }
+                if (span$1.from == null) {
+                  var found$1 = getMarkedSpanFor(first, span$1.marker);
+                  if (!found$1) {
+                    span$1.from = offset;
+                    if (sameLine) {
+                      (first || (first = [])).push(span$1);
+                    }
+                  }
+                } else {
+                  span$1.from += offset;
+                  if (sameLine) {
+                    (first || (first = [])).push(span$1);
+                  }
+                }
+              }
+            }
+            if (first) {
+              first = clearEmptySpans(first);
+            }
+            if (last && last != first) {
+              last = clearEmptySpans(last);
+            }
+            var newMarkers = [first];
+            if (!sameLine) {
+              var gap2 = change.text.length - 2,
+                gapMarkers;
+              if (gap2 > 0 && first) {
+                for (var i$22 = 0; i$22 < first.length; ++i$22) {
+                  if (first[i$22].to == null) {
+                    (gapMarkers || (gapMarkers = [])).push(
+                      new MarkedSpan(first[i$22].marker, null, null)
+                    );
+                  }
+                }
+              }
+              for (var i$3 = 0; i$3 < gap2; ++i$3) {
+                newMarkers.push(gapMarkers);
+              }
+              newMarkers.push(last);
+            }
+            return newMarkers;
+          }
+          function clearEmptySpans(spans) {
+            for (var i2 = 0; i2 < spans.length; ++i2) {
+              var span = spans[i2];
+              if (
+                span.from != null &&
+                span.from == span.to &&
+                span.marker.clearWhenEmpty !== false
+              ) {
+                spans.splice(i2--, 1);
+              }
+            }
+            if (!spans.length) {
+              return null;
+            }
+            return spans;
+          }
+          function removeReadOnlyRanges(doc, from, to) {
+            var markers = null;
+            doc.iter(from.line, to.line + 1, function (line) {
+              if (line.markedSpans) {
+                for (var i3 = 0; i3 < line.markedSpans.length; ++i3) {
+                  var mark = line.markedSpans[i3].marker;
+                  if (
+                    mark.readOnly &&
+                    (!markers || indexOf(markers, mark) == -1)
+                  ) {
+                    (markers || (markers = [])).push(mark);
+                  }
+                }
+              }
+            });
+            if (!markers) {
+              return null;
+            }
+            var parts = [{ from, to }];
+            for (var i2 = 0; i2 < markers.length; ++i2) {
+              var mk2 = markers[i2],
+                m = mk2.find(0);
+              for (var j = 0; j < parts.length; ++j) {
+                var p2 = parts[j];
+                if (cmp(p2.to, m.from) < 0 || cmp(p2.from, m.to) > 0) {
+                  continue;
+                }
+                var newParts = [j, 1],
+                  dfrom = cmp(p2.from, m.from),
+                  dto = cmp(p2.to, m.to);
+                if (dfrom < 0 || (!mk2.inclusiveLeft && !dfrom)) {
+                  newParts.push({ from: p2.from, to: m.from });
+                }
+                if (dto > 0 || (!mk2.inclusiveRight && !dto)) {
+                  newParts.push({ from: m.to, to: p2.to });
+                }
+                parts.splice.apply(parts, newParts);
+                j += newParts.length - 3;
+              }
+            }
+            return parts;
+          }
+          function detachMarkedSpans(line) {
+            var spans = line.markedSpans;
+            if (!spans) {
+              return;
+            }
+            for (var i2 = 0; i2 < spans.length; ++i2) {
+              spans[i2].marker.detachLine(line);
+            }
+            line.markedSpans = null;
+          }
+          function attachMarkedSpans(line, spans) {
+            if (!spans) {
+              return;
+            }
+            for (var i2 = 0; i2 < spans.length; ++i2) {
+              spans[i2].marker.attachLine(line);
+            }
+            line.markedSpans = spans;
+          }
+          function extraLeft(marker2) {
+            return marker2.inclusiveLeft ? -1 : 0;
+          }
+          function extraRight(marker2) {
+            return marker2.inclusiveRight ? 1 : 0;
+          }
+          function compareCollapsedMarkers(a, b) {
+            var lenDiff = a.lines.length - b.lines.length;
+            if (lenDiff != 0) {
+              return lenDiff;
+            }
+            var aPos = a.find(),
+              bPos = b.find();
+            var fromCmp =
+              cmp(aPos.from, bPos.from) || extraLeft(a) - extraLeft(b);
+            if (fromCmp) {
+              return -fromCmp;
+            }
+            var toCmp = cmp(aPos.to, bPos.to) || extraRight(a) - extraRight(b);
+            if (toCmp) {
+              return toCmp;
+            }
+            return b.id - a.id;
+          }
+          function collapsedSpanAtSide(line, start2) {
+            var sps = sawCollapsedSpans && line.markedSpans,
+              found;
+            if (sps) {
+              for (var sp = void 0, i2 = 0; i2 < sps.length; ++i2) {
+                sp = sps[i2];
+                if (
+                  sp.marker.collapsed &&
+                  (start2 ? sp.from : sp.to) == null &&
+                  (!found || compareCollapsedMarkers(found, sp.marker) < 0)
+                ) {
+                  found = sp.marker;
+                }
+              }
+            }
+            return found;
+          }
+          function collapsedSpanAtStart(line) {
+            return collapsedSpanAtSide(line, true);
+          }
+          function collapsedSpanAtEnd(line) {
+            return collapsedSpanAtSide(line, false);
+          }
+          function collapsedSpanAround(line, ch2) {
+            var sps = sawCollapsedSpans && line.markedSpans,
+              found;
+            if (sps) {
+              for (var i2 = 0; i2 < sps.length; ++i2) {
+                var sp = sps[i2];
+                if (
+                  sp.marker.collapsed &&
+                  (sp.from == null || sp.from < ch2) &&
+                  (sp.to == null || sp.to > ch2) &&
+                  (!found || compareCollapsedMarkers(found, sp.marker) < 0)
+                ) {
+                  found = sp.marker;
+                }
+              }
+            }
+            return found;
+          }
+          function conflictingCollapsedRange(doc, lineNo2, from, to, marker2) {
+            var line = getLine2(doc, lineNo2);
+            var sps = sawCollapsedSpans && line.markedSpans;
+            if (sps) {
+              for (var i2 = 0; i2 < sps.length; ++i2) {
+                var sp = sps[i2];
+                if (!sp.marker.collapsed) {
+                  continue;
+                }
+                var found = sp.marker.find(0);
+                var fromCmp =
+                  cmp(found.from, from) ||
+                  extraLeft(sp.marker) - extraLeft(marker2);
+                var toCmp =
+                  cmp(found.to, to) ||
+                  extraRight(sp.marker) - extraRight(marker2);
+                if (
+                  (fromCmp >= 0 && toCmp <= 0) ||
+                  (fromCmp <= 0 && toCmp >= 0)
+                ) {
+                  continue;
+                }
+                if (
+                  (fromCmp <= 0 &&
+                    (sp.marker.inclusiveRight && marker2.inclusiveLeft
+                      ? cmp(found.to, from) >= 0
+                      : cmp(found.to, from) > 0)) ||
+                  (fromCmp >= 0 &&
+                    (sp.marker.inclusiveRight && marker2.inclusiveLeft
+                      ? cmp(found.from, to) <= 0
+                      : cmp(found.from, to) < 0))
+                ) {
+                  return true;
+                }
+              }
+            }
+          }
+          function visualLine(line) {
+            var merged;
+            while ((merged = collapsedSpanAtStart(line))) {
+              line = merged.find(-1, true).line;
+            }
+            return line;
+          }
+          function visualLineEnd(line) {
+            var merged;
+            while ((merged = collapsedSpanAtEnd(line))) {
+              line = merged.find(1, true).line;
+            }
+            return line;
+          }
+          function visualLineContinued(line) {
+            var merged, lines;
+            while ((merged = collapsedSpanAtEnd(line))) {
+              line = merged.find(1, true).line;
+              (lines || (lines = [])).push(line);
+            }
+            return lines;
+          }
+          function visualLineNo(doc, lineN) {
+            var line = getLine2(doc, lineN),
+              vis = visualLine(line);
+            if (line == vis) {
+              return lineN;
+            }
+            return lineNo(vis);
+          }
+          function visualLineEndNo(doc, lineN) {
+            if (lineN > doc.lastLine()) {
+              return lineN;
+            }
+            var line = getLine2(doc, lineN),
+              merged;
+            if (!lineIsHidden(doc, line)) {
+              return lineN;
+            }
+            while ((merged = collapsedSpanAtEnd(line))) {
+              line = merged.find(1, true).line;
+            }
+            return lineNo(line) + 1;
+          }
+          function lineIsHidden(doc, line) {
+            var sps = sawCollapsedSpans && line.markedSpans;
+            if (sps) {
+              for (var sp = void 0, i2 = 0; i2 < sps.length; ++i2) {
+                sp = sps[i2];
+                if (!sp.marker.collapsed) {
+                  continue;
+                }
+                if (sp.from == null) {
+                  return true;
+                }
+                if (sp.marker.widgetNode) {
+                  continue;
+                }
+                if (
+                  sp.from == 0 &&
+                  sp.marker.inclusiveLeft &&
+                  lineIsHiddenInner(doc, line, sp)
+                ) {
+                  return true;
+                }
+              }
+            }
+          }
+          function lineIsHiddenInner(doc, line, span) {
+            if (span.to == null) {
+              var end2 = span.marker.find(1, true);
+              return lineIsHiddenInner(
+                doc,
+                end2.line,
+                getMarkedSpanFor(end2.line.markedSpans, span.marker)
+              );
+            }
+            if (span.marker.inclusiveRight && span.to == line.text.length) {
+              return true;
+            }
+            for (var sp = void 0, i2 = 0; i2 < line.markedSpans.length; ++i2) {
+              sp = line.markedSpans[i2];
+              if (
+                sp.marker.collapsed &&
+                !sp.marker.widgetNode &&
+                sp.from == span.to &&
+                (sp.to == null || sp.to != span.from) &&
+                (sp.marker.inclusiveLeft || span.marker.inclusiveRight) &&
+                lineIsHiddenInner(doc, line, sp)
+              ) {
+                return true;
+              }
+            }
+          }
+          function heightAtLine(lineObj) {
+            lineObj = visualLine(lineObj);
+            var h = 0,
+              chunk = lineObj.parent;
+            for (var i2 = 0; i2 < chunk.lines.length; ++i2) {
+              var line = chunk.lines[i2];
+              if (line == lineObj) {
+                break;
+              } else {
+                h += line.height;
+              }
+            }
+            for (var p2 = chunk.parent; p2; chunk = p2, p2 = chunk.parent) {
+              for (var i$12 = 0; i$12 < p2.children.length; ++i$12) {
+                var cur = p2.children[i$12];
+                if (cur == chunk) {
+                  break;
+                } else {
+                  h += cur.height;
+                }
+              }
+            }
+            return h;
+          }
+          function lineLength(line) {
+            if (line.height == 0) {
+              return 0;
+            }
+            var len = line.text.length,
+              merged,
+              cur = line;
+            while ((merged = collapsedSpanAtStart(cur))) {
+              var found = merged.find(0, true);
+              cur = found.from.line;
+              len += found.from.ch - found.to.ch;
+            }
+            cur = line;
+            while ((merged = collapsedSpanAtEnd(cur))) {
+              var found$1 = merged.find(0, true);
+              len -= cur.text.length - found$1.from.ch;
+              cur = found$1.to.line;
+              len += cur.text.length - found$1.to.ch;
+            }
+            return len;
+          }
+          function findMaxLine(cm) {
+            var d = cm.display,
+              doc = cm.doc;
+            d.maxLine = getLine2(doc, doc.first);
+            d.maxLineLength = lineLength(d.maxLine);
+            d.maxLineChanged = true;
+            doc.iter(function (line) {
+              var len = lineLength(line);
+              if (len > d.maxLineLength) {
+                d.maxLineLength = len;
+                d.maxLine = line;
+              }
+            });
+          }
+          var Line = function (text3, markedSpans, estimateHeight2) {
+            this.text = text3;
+            attachMarkedSpans(this, markedSpans);
+            this.height = estimateHeight2 ? estimateHeight2(this) : 1;
+          };
+          Line.prototype.lineNo = function () {
+            return lineNo(this);
+          };
+          eventMixin(Line);
+          function updateLine(line, text3, markedSpans, estimateHeight2) {
+            line.text = text3;
+            if (line.stateAfter) {
+              line.stateAfter = null;
+            }
+            if (line.styles) {
+              line.styles = null;
+            }
+            if (line.order != null) {
+              line.order = null;
+            }
+            detachMarkedSpans(line);
+            attachMarkedSpans(line, markedSpans);
+            var estHeight = estimateHeight2 ? estimateHeight2(line) : 1;
+            if (estHeight != line.height) {
+              updateLineHeight(line, estHeight);
+            }
+          }
+          function cleanUpLine(line) {
+            line.parent = null;
+            detachMarkedSpans(line);
+          }
+          var styleToClassCache = {},
+            styleToClassCacheWithMode = {};
+          function interpretTokenStyle(style, options) {
+            if (!style || /^\s*$/.test(style)) {
+              return null;
+            }
+            var cache = options.addModeClass
+              ? styleToClassCacheWithMode
+              : styleToClassCache;
+            return (
+              cache[style] || (cache[style] = style.replace(/\S+/g, "cm-$&"))
+            );
+          }
+          function buildLineContent(cm, lineView) {
+            var content = eltP(
+              "span",
+              null,
+              null,
+              webkit ? "padding-right: .1px" : null
+            );
+            var builder = {
+              pre: eltP("pre", [content], "CodeMirror-line"),
+              content,
+              col: 0,
+              pos: 0,
+              cm,
+              trailingSpace: false,
+              splitSpaces: cm.getOption("lineWrapping"),
+            };
+            lineView.measure = {};
+            for (
+              var i2 = 0;
+              i2 <= (lineView.rest ? lineView.rest.length : 0);
+              i2++
+            ) {
+              var line = i2 ? lineView.rest[i2 - 1] : lineView.line,
+                order2 = void 0;
+              builder.pos = 0;
+              builder.addToken = buildToken2;
+              if (
+                hasBadBidiRects(cm.display.measure) &&
+                (order2 = getOrder(line, cm.doc.direction))
+              ) {
+                builder.addToken = buildTokenBadBidi(builder.addToken, order2);
+              }
+              builder.map = [];
+              var allowFrontierUpdate =
+                lineView != cm.display.externalMeasured && lineNo(line);
+              insertLineContent(
+                line,
+                builder,
+                getLineStyles(cm, line, allowFrontierUpdate)
+              );
+              if (line.styleClasses) {
+                if (line.styleClasses.bgClass) {
+                  builder.bgClass = joinClasses(
+                    line.styleClasses.bgClass,
+                    builder.bgClass || ""
+                  );
+                }
+                if (line.styleClasses.textClass) {
+                  builder.textClass = joinClasses(
+                    line.styleClasses.textClass,
+                    builder.textClass || ""
+                  );
+                }
+              }
+              if (builder.map.length == 0) {
+                builder.map.push(
+                  0,
+                  0,
+                  builder.content.appendChild(
+                    zeroWidthElement(cm.display.measure)
+                  )
+                );
+              }
+              if (i2 == 0) {
+                lineView.measure.map = builder.map;
+                lineView.measure.cache = {};
+              } else {
+                (lineView.measure.maps || (lineView.measure.maps = [])).push(
+                  builder.map
+                );
+                (
+                  lineView.measure.caches || (lineView.measure.caches = [])
+                ).push({});
+              }
+            }
+            if (webkit) {
+              var last = builder.content.lastChild;
+              if (
+                /\bcm-tab\b/.test(last.className) ||
+                (last.querySelector && last.querySelector(".cm-tab"))
+              ) {
+                builder.content.className = "cm-tab-wrap-hack";
+              }
+            }
+            signal(cm, "renderLine", cm, lineView.line, builder.pre);
+            if (builder.pre.className) {
+              builder.textClass = joinClasses(
+                builder.pre.className,
+                builder.textClass || ""
+              );
+            }
+            return builder;
+          }
+          function defaultSpecialCharPlaceholder(ch2) {
+            var token2 = elt("span", "\u2022", "cm-invalidchar");
+            token2.title = "\\u" + ch2.charCodeAt(0).toString(16);
+            token2.setAttribute("aria-label", token2.title);
+            return token2;
+          }
+          function buildToken2(
+            builder,
+            text3,
+            style,
+            startStyle,
+            endStyle,
+            css,
+            attributes
+          ) {
+            if (!text3) {
+              return;
+            }
+            var displayText = builder.splitSpaces
+              ? splitSpaces(text3, builder.trailingSpace)
+              : text3;
+            var special = builder.cm.state.specialChars,
+              mustWrap = false;
+            var content;
+            if (!special.test(text3)) {
+              builder.col += text3.length;
+              content = document.createTextNode(displayText);
+              builder.map.push(
+                builder.pos,
+                builder.pos + text3.length,
+                content
+              );
+              if (ie2 && ie_version < 9) {
+                mustWrap = true;
+              }
+              builder.pos += text3.length;
+            } else {
+              content = document.createDocumentFragment();
+              var pos = 0;
+              while (true) {
+                special.lastIndex = pos;
+                var m = special.exec(text3);
+                var skipped = m ? m.index - pos : text3.length - pos;
+                if (skipped) {
+                  var txt = document.createTextNode(
+                    displayText.slice(pos, pos + skipped)
+                  );
+                  if (ie2 && ie_version < 9) {
+                    content.appendChild(elt("span", [txt]));
+                  } else {
+                    content.appendChild(txt);
+                  }
+                  builder.map.push(builder.pos, builder.pos + skipped, txt);
+                  builder.col += skipped;
+                  builder.pos += skipped;
+                }
+                if (!m) {
+                  break;
+                }
+                pos += skipped + 1;
+                var txt$1 = void 0;
+                if (m[0] == "	") {
+                  var tabSize = builder.cm.options.tabSize,
+                    tabWidth = tabSize - (builder.col % tabSize);
+                  txt$1 = content.appendChild(
+                    elt("span", spaceStr(tabWidth), "cm-tab")
+                  );
+                  txt$1.setAttribute("role", "presentation");
+                  txt$1.setAttribute("cm-text", "	");
+                  builder.col += tabWidth;
+                } else if (m[0] == "\r" || m[0] == "\n") {
+                  txt$1 = content.appendChild(
+                    elt(
+                      "span",
+                      m[0] == "\r" ? "\u240D" : "\u2424",
+                      "cm-invalidchar"
+                    )
+                  );
+                  txt$1.setAttribute("cm-text", m[0]);
+                  builder.col += 1;
+                } else {
+                  txt$1 = builder.cm.options.specialCharPlaceholder(m[0]);
+                  txt$1.setAttribute("cm-text", m[0]);
+                  if (ie2 && ie_version < 9) {
+                    content.appendChild(elt("span", [txt$1]));
+                  } else {
+                    content.appendChild(txt$1);
+                  }
+                  builder.col += 1;
+                }
+                builder.map.push(builder.pos, builder.pos + 1, txt$1);
+                builder.pos++;
+              }
+            }
+            builder.trailingSpace =
+              displayText.charCodeAt(text3.length - 1) == 32;
+            if (
+              style ||
+              startStyle ||
+              endStyle ||
+              mustWrap ||
+              css ||
+              attributes
+            ) {
+              var fullStyle = style || "";
+              if (startStyle) {
+                fullStyle += startStyle;
+              }
+              if (endStyle) {
+                fullStyle += endStyle;
+              }
+              var token2 = elt("span", [content], fullStyle, css);
+              if (attributes) {
+                for (var attr in attributes) {
+                  if (
+                    attributes.hasOwnProperty(attr) &&
+                    attr != "style" &&
+                    attr != "class"
+                  ) {
+                    token2.setAttribute(attr, attributes[attr]);
+                  }
+                }
+              }
+              return builder.content.appendChild(token2);
+            }
+            builder.content.appendChild(content);
+          }
+          function splitSpaces(text3, trailingBefore) {
+            if (text3.length > 1 && !/  /.test(text3)) {
+              return text3;
+            }
+            var spaceBefore = trailingBefore,
+              result2 = "";
+            for (var i2 = 0; i2 < text3.length; i2++) {
+              var ch2 = text3.charAt(i2);
+              if (
+                ch2 == " " &&
+                spaceBefore &&
+                (i2 == text3.length - 1 || text3.charCodeAt(i2 + 1) == 32)
+              ) {
+                ch2 = "\xA0";
+              }
+              result2 += ch2;
+              spaceBefore = ch2 == " ";
+            }
+            return result2;
+          }
+          function buildTokenBadBidi(inner, order2) {
+            return function (
+              builder,
+              text3,
+              style,
+              startStyle,
+              endStyle,
+              css,
+              attributes
+            ) {
+              style = style ? style + " cm-force-border" : "cm-force-border";
+              var start2 = builder.pos,
+                end2 = start2 + text3.length;
+              for (;;) {
+                var part2 = void 0;
+                for (var i2 = 0; i2 < order2.length; i2++) {
+                  part2 = order2[i2];
+                  if (part2.to > start2 && part2.from <= start2) {
+                    break;
+                  }
+                }
+                if (part2.to >= end2) {
+                  return inner(
+                    builder,
+                    text3,
+                    style,
+                    startStyle,
+                    endStyle,
+                    css,
+                    attributes
+                  );
+                }
+                inner(
+                  builder,
+                  text3.slice(0, part2.to - start2),
+                  style,
+                  startStyle,
+                  null,
+                  css,
+                  attributes
+                );
+                startStyle = null;
+                text3 = text3.slice(part2.to - start2);
+                start2 = part2.to;
+              }
+            };
+          }
+          function buildCollapsedSpan(builder, size, marker2, ignoreWidget) {
+            var widget = !ignoreWidget && marker2.widgetNode;
+            if (widget) {
+              builder.map.push(builder.pos, builder.pos + size, widget);
+            }
+            if (
+              !ignoreWidget &&
+              builder.cm.display.input.needsContentAttribute
+            ) {
+              if (!widget) {
+                widget = builder.content.appendChild(
+                  document.createElement("span")
+                );
+              }
+              widget.setAttribute("cm-marker", marker2.id);
+            }
+            if (widget) {
+              builder.cm.display.input.setUneditable(widget);
+              builder.content.appendChild(widget);
+            }
+            builder.pos += size;
+            builder.trailingSpace = false;
+          }
+          function insertLineContent(line, builder, styles2) {
+            var spans = line.markedSpans,
+              allText = line.text,
+              at = 0;
+            if (!spans) {
+              for (var i$12 = 1; i$12 < styles2.length; i$12 += 2) {
+                builder.addToken(
+                  builder,
+                  allText.slice(at, (at = styles2[i$12])),
+                  interpretTokenStyle(styles2[i$12 + 1], builder.cm.options)
+                );
+              }
+              return;
+            }
+            var len = allText.length,
+              pos = 0,
+              i2 = 1,
+              text3 = "",
+              style,
+              css;
+            var nextChange = 0,
+              spanStyle,
+              spanEndStyle,
+              spanStartStyle,
+              collapsed,
+              attributes;
+            for (;;) {
+              if (nextChange == pos) {
+                spanStyle = spanEndStyle = spanStartStyle = css = "";
+                attributes = null;
+                collapsed = null;
+                nextChange = Infinity;
+                var foundBookmarks = [],
+                  endStyles = void 0;
+                for (var j = 0; j < spans.length; ++j) {
+                  var sp = spans[j],
+                    m = sp.marker;
+                  if (m.type == "bookmark" && sp.from == pos && m.widgetNode) {
+                    foundBookmarks.push(m);
+                  } else if (
+                    sp.from <= pos &&
+                    (sp.to == null ||
+                      sp.to > pos ||
+                      (m.collapsed && sp.to == pos && sp.from == pos))
+                  ) {
+                    if (sp.to != null && sp.to != pos && nextChange > sp.to) {
+                      nextChange = sp.to;
+                      spanEndStyle = "";
+                    }
+                    if (m.className) {
+                      spanStyle += " " + m.className;
+                    }
+                    if (m.css) {
+                      css = (css ? css + ";" : "") + m.css;
+                    }
+                    if (m.startStyle && sp.from == pos) {
+                      spanStartStyle += " " + m.startStyle;
+                    }
+                    if (m.endStyle && sp.to == nextChange) {
+                      (endStyles || (endStyles = [])).push(m.endStyle, sp.to);
+                    }
+                    if (m.title) {
+                      (attributes || (attributes = {})).title = m.title;
+                    }
+                    if (m.attributes) {
+                      for (var attr in m.attributes) {
+                        (attributes || (attributes = {}))[attr] =
+                          m.attributes[attr];
+                      }
+                    }
+                    if (
+                      m.collapsed &&
+                      (!collapsed ||
+                        compareCollapsedMarkers(collapsed.marker, m) < 0)
+                    ) {
+                      collapsed = sp;
+                    }
+                  } else if (sp.from > pos && nextChange > sp.from) {
+                    nextChange = sp.from;
+                  }
+                }
+                if (endStyles) {
+                  for (var j$1 = 0; j$1 < endStyles.length; j$1 += 2) {
+                    if (endStyles[j$1 + 1] == nextChange) {
+                      spanEndStyle += " " + endStyles[j$1];
+                    }
+                  }
+                }
+                if (!collapsed || collapsed.from == pos) {
+                  for (var j$2 = 0; j$2 < foundBookmarks.length; ++j$2) {
+                    buildCollapsedSpan(builder, 0, foundBookmarks[j$2]);
+                  }
+                }
+                if (collapsed && (collapsed.from || 0) == pos) {
+                  buildCollapsedSpan(
+                    builder,
+                    (collapsed.to == null ? len + 1 : collapsed.to) - pos,
+                    collapsed.marker,
+                    collapsed.from == null
+                  );
+                  if (collapsed.to == null) {
+                    return;
+                  }
+                  if (collapsed.to == pos) {
+                    collapsed = false;
+                  }
+                }
+              }
+              if (pos >= len) {
+                break;
+              }
+              var upto = Math.min(len, nextChange);
+              while (true) {
+                if (text3) {
+                  var end2 = pos + text3.length;
+                  if (!collapsed) {
+                    var tokenText =
+                      end2 > upto ? text3.slice(0, upto - pos) : text3;
+                    builder.addToken(
+                      builder,
+                      tokenText,
+                      style ? style + spanStyle : spanStyle,
+                      spanStartStyle,
+                      pos + tokenText.length == nextChange ? spanEndStyle : "",
+                      css,
+                      attributes
+                    );
+                  }
+                  if (end2 >= upto) {
+                    text3 = text3.slice(upto - pos);
+                    pos = upto;
+                    break;
+                  }
+                  pos = end2;
+                  spanStartStyle = "";
+                }
+                text3 = allText.slice(at, (at = styles2[i2++]));
+                style = interpretTokenStyle(styles2[i2++], builder.cm.options);
+              }
+            }
+          }
+          function LineView(doc, line, lineN) {
+            this.line = line;
+            this.rest = visualLineContinued(line);
+            this.size = this.rest ? lineNo(lst(this.rest)) - lineN + 1 : 1;
+            this.node = this.text = null;
+            this.hidden = lineIsHidden(doc, line);
+          }
+          function buildViewArray(cm, from, to) {
+            var array = [],
+              nextPos;
+            for (var pos = from; pos < to; pos = nextPos) {
+              var view = new LineView(cm.doc, getLine2(cm.doc, pos), pos);
+              nextPos = pos + view.size;
+              array.push(view);
+            }
+            return array;
+          }
+          var operationGroup = null;
+          function pushOperation(op) {
+            if (operationGroup) {
+              operationGroup.ops.push(op);
+            } else {
+              op.ownsGroup = operationGroup = {
+                ops: [op],
+                delayedCallbacks: [],
+              };
+            }
+          }
+          function fireCallbacksForOps(group) {
+            var callbacks = group.delayedCallbacks,
+              i2 = 0;
+            do {
+              for (; i2 < callbacks.length; i2++) {
+                callbacks[i2].call(null);
+              }
+              for (var j = 0; j < group.ops.length; j++) {
+                var op = group.ops[j];
+                if (op.cursorActivityHandlers) {
+                  while (
+                    op.cursorActivityCalled < op.cursorActivityHandlers.length
+                  ) {
+                    op.cursorActivityHandlers[op.cursorActivityCalled++].call(
+                      null,
+                      op.cm
+                    );
+                  }
+                }
+              }
+            } while (i2 < callbacks.length);
+          }
+          function finishOperation(op, endCb) {
+            var group = op.ownsGroup;
+            if (!group) {
+              return;
+            }
+            try {
+              fireCallbacksForOps(group);
+            } finally {
+              operationGroup = null;
+              endCb(group);
+            }
+          }
+          var orphanDelayedCallbacks = null;
+          function signalLater(emitter, type2) {
+            var arr = getHandlers(emitter, type2);
+            if (!arr.length) {
+              return;
+            }
+            var args = Array.prototype.slice.call(arguments, 2),
+              list3;
+            if (operationGroup) {
+              list3 = operationGroup.delayedCallbacks;
+            } else if (orphanDelayedCallbacks) {
+              list3 = orphanDelayedCallbacks;
+            } else {
+              list3 = orphanDelayedCallbacks = [];
+              setTimeout(fireOrphanDelayed, 0);
+            }
+            var loop = function (i3) {
+              list3.push(function () {
+                return arr[i3].apply(null, args);
+              });
+            };
+            for (var i2 = 0; i2 < arr.length; ++i2) loop(i2);
+          }
+          function fireOrphanDelayed() {
+            var delayed = orphanDelayedCallbacks;
+            orphanDelayedCallbacks = null;
+            for (var i2 = 0; i2 < delayed.length; ++i2) {
+              delayed[i2]();
+            }
+          }
+          function updateLineForChanges(cm, lineView, lineN, dims) {
+            for (var j = 0; j < lineView.changes.length; j++) {
+              var type2 = lineView.changes[j];
+              if (type2 == "text") {
+                updateLineText(cm, lineView);
+              } else if (type2 == "gutter") {
+                updateLineGutter(cm, lineView, lineN, dims);
+              } else if (type2 == "class") {
+                updateLineClasses(cm, lineView);
+              } else if (type2 == "widget") {
+                updateLineWidgets(cm, lineView, dims);
+              }
+            }
+            lineView.changes = null;
+          }
+          function ensureLineWrapped(lineView) {
+            if (lineView.node == lineView.text) {
+              lineView.node = elt("div", null, null, "position: relative");
+              if (lineView.text.parentNode) {
+                lineView.text.parentNode.replaceChild(
+                  lineView.node,
+                  lineView.text
+                );
+              }
+              lineView.node.appendChild(lineView.text);
+              if (ie2 && ie_version < 8) {
+                lineView.node.style.zIndex = 2;
+              }
+            }
+            return lineView.node;
+          }
+          function updateLineBackground(cm, lineView) {
+            var cls = lineView.bgClass
+              ? lineView.bgClass + " " + (lineView.line.bgClass || "")
+              : lineView.line.bgClass;
+            if (cls) {
+              cls += " CodeMirror-linebackground";
+            }
+            if (lineView.background) {
+              if (cls) {
+                lineView.background.className = cls;
+              } else {
+                lineView.background.parentNode.removeChild(lineView.background);
+                lineView.background = null;
+              }
+            } else if (cls) {
+              var wrap2 = ensureLineWrapped(lineView);
+              lineView.background = wrap2.insertBefore(
+                elt("div", null, cls),
+                wrap2.firstChild
+              );
+              cm.display.input.setUneditable(lineView.background);
+            }
+          }
+          function getLineContent(cm, lineView) {
+            var ext = cm.display.externalMeasured;
+            if (ext && ext.line == lineView.line) {
+              cm.display.externalMeasured = null;
+              lineView.measure = ext.measure;
+              return ext.built;
+            }
+            return buildLineContent(cm, lineView);
+          }
+          function updateLineText(cm, lineView) {
+            var cls = lineView.text.className;
+            var built = getLineContent(cm, lineView);
+            if (lineView.text == lineView.node) {
+              lineView.node = built.pre;
+            }
+            lineView.text.parentNode.replaceChild(built.pre, lineView.text);
+            lineView.text = built.pre;
+            if (
+              built.bgClass != lineView.bgClass ||
+              built.textClass != lineView.textClass
+            ) {
+              lineView.bgClass = built.bgClass;
+              lineView.textClass = built.textClass;
+              updateLineClasses(cm, lineView);
+            } else if (cls) {
+              lineView.text.className = cls;
+            }
+          }
+          function updateLineClasses(cm, lineView) {
+            updateLineBackground(cm, lineView);
+            if (lineView.line.wrapClass) {
+              ensureLineWrapped(lineView).className = lineView.line.wrapClass;
+            } else if (lineView.node != lineView.text) {
+              lineView.node.className = "";
+            }
+            var textClass = lineView.textClass
+              ? lineView.textClass + " " + (lineView.line.textClass || "")
+              : lineView.line.textClass;
+            lineView.text.className = textClass || "";
+          }
+          function updateLineGutter(cm, lineView, lineN, dims) {
+            if (lineView.gutter) {
+              lineView.node.removeChild(lineView.gutter);
+              lineView.gutter = null;
+            }
+            if (lineView.gutterBackground) {
+              lineView.node.removeChild(lineView.gutterBackground);
+              lineView.gutterBackground = null;
+            }
+            if (lineView.line.gutterClass) {
+              var wrap2 = ensureLineWrapped(lineView);
+              lineView.gutterBackground = elt(
+                "div",
+                null,
+                "CodeMirror-gutter-background " + lineView.line.gutterClass,
+                "left: " +
+                  (cm.options.fixedGutter
+                    ? dims.fixedPos
+                    : -dims.gutterTotalWidth) +
+                  "px; width: " +
+                  dims.gutterTotalWidth +
+                  "px"
+              );
+              cm.display.input.setUneditable(lineView.gutterBackground);
+              wrap2.insertBefore(lineView.gutterBackground, lineView.text);
+            }
+            var markers = lineView.line.gutterMarkers;
+            if (cm.options.lineNumbers || markers) {
+              var wrap$12 = ensureLineWrapped(lineView);
+              var gutterWrap = (lineView.gutter = elt(
+                "div",
+                null,
+                "CodeMirror-gutter-wrapper",
+                "left: " +
+                  (cm.options.fixedGutter
+                    ? dims.fixedPos
+                    : -dims.gutterTotalWidth) +
+                  "px"
+              ));
+              gutterWrap.setAttribute("aria-hidden", "true");
+              cm.display.input.setUneditable(gutterWrap);
+              wrap$12.insertBefore(gutterWrap, lineView.text);
+              if (lineView.line.gutterClass) {
+                gutterWrap.className += " " + lineView.line.gutterClass;
+              }
+              if (
+                cm.options.lineNumbers &&
+                (!markers || !markers["CodeMirror-linenumbers"])
+              ) {
+                lineView.lineNumber = gutterWrap.appendChild(
+                  elt(
+                    "div",
+                    lineNumberFor(cm.options, lineN),
+                    "CodeMirror-linenumber CodeMirror-gutter-elt",
+                    "left: " +
+                      dims.gutterLeft["CodeMirror-linenumbers"] +
+                      "px; width: " +
+                      cm.display.lineNumInnerWidth +
+                      "px"
+                  )
+                );
+              }
+              if (markers) {
+                for (var k = 0; k < cm.display.gutterSpecs.length; ++k) {
+                  var id2 = cm.display.gutterSpecs[k].className,
+                    found = markers.hasOwnProperty(id2) && markers[id2];
+                  if (found) {
+                    gutterWrap.appendChild(
+                      elt(
+                        "div",
+                        [found],
+                        "CodeMirror-gutter-elt",
+                        "left: " +
+                          dims.gutterLeft[id2] +
+                          "px; width: " +
+                          dims.gutterWidth[id2] +
+                          "px"
+                      )
+                    );
+                  }
+                }
+              }
+            }
+          }
+          function updateLineWidgets(cm, lineView, dims) {
+            if (lineView.alignable) {
+              lineView.alignable = null;
+            }
+            var isWidget = classTest("CodeMirror-linewidget");
+            for (
+              var node = lineView.node.firstChild, next = void 0;
+              node;
+              node = next
+            ) {
+              next = node.nextSibling;
+              if (isWidget.test(node.className)) {
+                lineView.node.removeChild(node);
+              }
+            }
+            insertLineWidgets(cm, lineView, dims);
+          }
+          function buildLineElement(cm, lineView, lineN, dims) {
+            var built = getLineContent(cm, lineView);
+            lineView.text = lineView.node = built.pre;
+            if (built.bgClass) {
+              lineView.bgClass = built.bgClass;
+            }
+            if (built.textClass) {
+              lineView.textClass = built.textClass;
+            }
+            updateLineClasses(cm, lineView);
+            updateLineGutter(cm, lineView, lineN, dims);
+            insertLineWidgets(cm, lineView, dims);
+            return lineView.node;
+          }
+          function insertLineWidgets(cm, lineView, dims) {
+            insertLineWidgetsFor(cm, lineView.line, lineView, dims, true);
+            if (lineView.rest) {
+              for (var i2 = 0; i2 < lineView.rest.length; i2++) {
+                insertLineWidgetsFor(
+                  cm,
+                  lineView.rest[i2],
+                  lineView,
+                  dims,
+                  false
+                );
+              }
+            }
+          }
+          function insertLineWidgetsFor(cm, line, lineView, dims, allowAbove) {
+            if (!line.widgets) {
+              return;
+            }
+            var wrap2 = ensureLineWrapped(lineView);
+            for (var i2 = 0, ws2 = line.widgets; i2 < ws2.length; ++i2) {
+              var widget = ws2[i2],
+                node = elt(
+                  "div",
+                  [widget.node],
+                  "CodeMirror-linewidget" +
+                    (widget.className ? " " + widget.className : "")
+                );
+              if (!widget.handleMouseEvents) {
+                node.setAttribute("cm-ignore-events", "true");
+              }
+              positionLineWidget(widget, node, lineView, dims);
+              cm.display.input.setUneditable(node);
+              if (allowAbove && widget.above) {
+                wrap2.insertBefore(node, lineView.gutter || lineView.text);
+              } else {
+                wrap2.appendChild(node);
+              }
+              signalLater(widget, "redraw");
+            }
+          }
+          function positionLineWidget(widget, node, lineView, dims) {
+            if (widget.noHScroll) {
+              (lineView.alignable || (lineView.alignable = [])).push(node);
+              var width = dims.wrapperWidth;
+              node.style.left = dims.fixedPos + "px";
+              if (!widget.coverGutter) {
+                width -= dims.gutterTotalWidth;
+                node.style.paddingLeft = dims.gutterTotalWidth + "px";
+              }
+              node.style.width = width + "px";
+            }
+            if (widget.coverGutter) {
+              node.style.zIndex = 5;
+              node.style.position = "relative";
+              if (!widget.noHScroll) {
+                node.style.marginLeft = -dims.gutterTotalWidth + "px";
+              }
+            }
+          }
+          function widgetHeight(widget) {
+            if (widget.height != null) {
+              return widget.height;
+            }
+            var cm = widget.doc.cm;
+            if (!cm) {
+              return 0;
+            }
+            if (!contains(document.body, widget.node)) {
+              var parentStyle = "position: relative;";
+              if (widget.coverGutter) {
+                parentStyle +=
+                  "margin-left: -" + cm.display.gutters.offsetWidth + "px;";
+              }
+              if (widget.noHScroll) {
+                parentStyle +=
+                  "width: " + cm.display.wrapper.clientWidth + "px;";
+              }
+              removeChildrenAndAdd(
+                cm.display.measure,
+                elt("div", [widget.node], null, parentStyle)
+              );
+            }
+            return (widget.height = widget.node.parentNode.offsetHeight);
+          }
+          function eventInWidget(display, e) {
+            for (
+              var n2 = e_target(e);
+              n2 != display.wrapper;
+              n2 = n2.parentNode
+            ) {
+              if (
+                !n2 ||
+                (n2.nodeType == 1 &&
+                  n2.getAttribute("cm-ignore-events") == "true") ||
+                (n2.parentNode == display.sizer && n2 != display.mover)
+              ) {
+                return true;
+              }
+            }
+          }
+          function paddingTop(display) {
+            return display.lineSpace.offsetTop;
+          }
+          function paddingVert(display) {
+            return display.mover.offsetHeight - display.lineSpace.offsetHeight;
+          }
+          function paddingH(display) {
+            if (display.cachedPaddingH) {
+              return display.cachedPaddingH;
+            }
+            var e = removeChildrenAndAdd(
+              display.measure,
+              elt("pre", "x", "CodeMirror-line-like")
+            );
+            var style = window.getComputedStyle
+              ? window.getComputedStyle(e)
+              : e.currentStyle;
+            var data = {
+              left: parseInt(style.paddingLeft),
+              right: parseInt(style.paddingRight),
+            };
+            if (!isNaN(data.left) && !isNaN(data.right)) {
+              display.cachedPaddingH = data;
+            }
+            return data;
+          }
+          function scrollGap(cm) {
+            return scrollerGap - cm.display.nativeBarWidth;
+          }
+          function displayWidth(cm) {
+            return (
+              cm.display.scroller.clientWidth -
+              scrollGap(cm) -
+              cm.display.barWidth
+            );
+          }
+          function displayHeight(cm) {
+            return (
+              cm.display.scroller.clientHeight -
+              scrollGap(cm) -
+              cm.display.barHeight
+            );
+          }
+          function ensureLineHeights(cm, lineView, rect2) {
+            var wrapping = cm.options.lineWrapping;
+            var curWidth = wrapping && displayWidth(cm);
+            if (
+              !lineView.measure.heights ||
+              (wrapping && lineView.measure.width != curWidth)
+            ) {
+              var heights = (lineView.measure.heights = []);
+              if (wrapping) {
+                lineView.measure.width = curWidth;
+                var rects = lineView.text.firstChild.getClientRects();
+                for (var i2 = 0; i2 < rects.length - 1; i2++) {
+                  var cur = rects[i2],
+                    next = rects[i2 + 1];
+                  if (Math.abs(cur.bottom - next.bottom) > 2) {
+                    heights.push((cur.bottom + next.top) / 2 - rect2.top);
+                  }
+                }
+              }
+              heights.push(rect2.bottom - rect2.top);
+            }
+          }
+          function mapFromLineView(lineView, line, lineN) {
+            if (lineView.line == line) {
+              return {
+                map: lineView.measure.map,
+                cache: lineView.measure.cache,
+              };
+            }
+            if (lineView.rest) {
+              for (var i2 = 0; i2 < lineView.rest.length; i2++) {
+                if (lineView.rest[i2] == line) {
+                  return {
+                    map: lineView.measure.maps[i2],
+                    cache: lineView.measure.caches[i2],
+                  };
+                }
+              }
+              for (var i$12 = 0; i$12 < lineView.rest.length; i$12++) {
+                if (lineNo(lineView.rest[i$12]) > lineN) {
+                  return {
+                    map: lineView.measure.maps[i$12],
+                    cache: lineView.measure.caches[i$12],
+                    before: true,
+                  };
+                }
+              }
+            }
+          }
+          function updateExternalMeasurement(cm, line) {
+            line = visualLine(line);
+            var lineN = lineNo(line);
+            var view = (cm.display.externalMeasured = new LineView(
+              cm.doc,
+              line,
+              lineN
+            ));
+            view.lineN = lineN;
+            var built = (view.built = buildLineContent(cm, view));
+            view.text = built.pre;
+            removeChildrenAndAdd(cm.display.lineMeasure, built.pre);
+            return view;
+          }
+          function measureChar(cm, line, ch2, bias) {
+            return measureCharPrepared(
+              cm,
+              prepareMeasureForLine(cm, line),
+              ch2,
+              bias
+            );
+          }
+          function findViewForLine(cm, lineN) {
+            if (lineN >= cm.display.viewFrom && lineN < cm.display.viewTo) {
+              return cm.display.view[findViewIndex(cm, lineN)];
+            }
+            var ext = cm.display.externalMeasured;
+            if (ext && lineN >= ext.lineN && lineN < ext.lineN + ext.size) {
+              return ext;
+            }
+          }
+          function prepareMeasureForLine(cm, line) {
+            var lineN = lineNo(line);
+            var view = findViewForLine(cm, lineN);
+            if (view && !view.text) {
+              view = null;
+            } else if (view && view.changes) {
+              updateLineForChanges(cm, view, lineN, getDimensions(cm));
+              cm.curOp.forceUpdate = true;
+            }
+            if (!view) {
+              view = updateExternalMeasurement(cm, line);
+            }
+            var info2 = mapFromLineView(view, line, lineN);
+            return {
+              line,
+              view,
+              rect: null,
+              map: info2.map,
+              cache: info2.cache,
+              before: info2.before,
+              hasHeights: false,
+            };
+          }
+          function measureCharPrepared(cm, prepared, ch2, bias, varHeight) {
+            if (prepared.before) {
+              ch2 = -1;
+            }
+            var key = ch2 + (bias || ""),
+              found;
+            if (prepared.cache.hasOwnProperty(key)) {
+              found = prepared.cache[key];
+            } else {
+              if (!prepared.rect) {
+                prepared.rect = prepared.view.text.getBoundingClientRect();
+              }
+              if (!prepared.hasHeights) {
+                ensureLineHeights(cm, prepared.view, prepared.rect);
+                prepared.hasHeights = true;
+              }
+              found = measureCharInner(cm, prepared, ch2, bias);
+              if (!found.bogus) {
+                prepared.cache[key] = found;
+              }
+            }
+            return {
+              left: found.left,
+              right: found.right,
+              top: varHeight ? found.rtop : found.top,
+              bottom: varHeight ? found.rbottom : found.bottom,
+            };
+          }
+          var nullRect = { left: 0, right: 0, top: 0, bottom: 0 };
+          function nodeAndOffsetInLineMap(map3, ch2, bias) {
+            var node, start2, end2, collapse, mStart, mEnd;
+            for (var i2 = 0; i2 < map3.length; i2 += 3) {
+              mStart = map3[i2];
+              mEnd = map3[i2 + 1];
+              if (ch2 < mStart) {
+                start2 = 0;
+                end2 = 1;
+                collapse = "left";
+              } else if (ch2 < mEnd) {
+                start2 = ch2 - mStart;
+                end2 = start2 + 1;
+              } else if (
+                i2 == map3.length - 3 ||
+                (ch2 == mEnd && map3[i2 + 3] > ch2)
+              ) {
+                end2 = mEnd - mStart;
+                start2 = end2 - 1;
+                if (ch2 >= mEnd) {
+                  collapse = "right";
+                }
+              }
+              if (start2 != null) {
+                node = map3[i2 + 2];
+                if (
+                  mStart == mEnd &&
+                  bias == (node.insertLeft ? "left" : "right")
+                ) {
+                  collapse = bias;
+                }
+                if (bias == "left" && start2 == 0) {
+                  while (
+                    i2 &&
+                    map3[i2 - 2] == map3[i2 - 3] &&
+                    map3[i2 - 1].insertLeft
+                  ) {
+                    node = map3[(i2 -= 3) + 2];
+                    collapse = "left";
+                  }
+                }
+                if (bias == "right" && start2 == mEnd - mStart) {
+                  while (
+                    i2 < map3.length - 3 &&
+                    map3[i2 + 3] == map3[i2 + 4] &&
+                    !map3[i2 + 5].insertLeft
+                  ) {
+                    node = map3[(i2 += 3) + 2];
+                    collapse = "right";
+                  }
+                }
+                break;
+              }
+            }
+            return {
+              node,
+              start: start2,
+              end: end2,
+              collapse,
+              coverStart: mStart,
+              coverEnd: mEnd,
+            };
+          }
+          function getUsefulRect(rects, bias) {
+            var rect2 = nullRect;
+            if (bias == "left") {
+              for (var i2 = 0; i2 < rects.length; i2++) {
+                if ((rect2 = rects[i2]).left != rect2.right) {
+                  break;
+                }
+              }
+            } else {
+              for (var i$12 = rects.length - 1; i$12 >= 0; i$12--) {
+                if ((rect2 = rects[i$12]).left != rect2.right) {
+                  break;
+                }
+              }
+            }
+            return rect2;
+          }
+          function measureCharInner(cm, prepared, ch2, bias) {
+            var place = nodeAndOffsetInLineMap(prepared.map, ch2, bias);
+            var node = place.node,
+              start2 = place.start,
+              end2 = place.end,
+              collapse = place.collapse;
+            var rect2;
+            if (node.nodeType == 3) {
+              for (var i$12 = 0; i$12 < 4; i$12++) {
+                while (
+                  start2 &&
+                  isExtendingChar(
+                    prepared.line.text.charAt(place.coverStart + start2)
+                  )
+                ) {
+                  --start2;
+                }
+                while (
+                  place.coverStart + end2 < place.coverEnd &&
+                  isExtendingChar(
+                    prepared.line.text.charAt(place.coverStart + end2)
+                  )
+                ) {
+                  ++end2;
+                }
+                if (
+                  ie2 &&
+                  ie_version < 9 &&
+                  start2 == 0 &&
+                  end2 == place.coverEnd - place.coverStart
+                ) {
+                  rect2 = node.parentNode.getBoundingClientRect();
+                } else {
+                  rect2 = getUsefulRect(
+                    range2(node, start2, end2).getClientRects(),
+                    bias
+                  );
+                }
+                if (rect2.left || rect2.right || start2 == 0) {
+                  break;
+                }
+                end2 = start2;
+                start2 = start2 - 1;
+                collapse = "right";
+              }
+              if (ie2 && ie_version < 11) {
+                rect2 = maybeUpdateRectForZooming(cm.display.measure, rect2);
+              }
+            } else {
+              if (start2 > 0) {
+                collapse = bias = "right";
+              }
+              var rects;
+              if (
+                cm.options.lineWrapping &&
+                (rects = node.getClientRects()).length > 1
+              ) {
+                rect2 = rects[bias == "right" ? rects.length - 1 : 0];
+              } else {
+                rect2 = node.getBoundingClientRect();
+              }
+            }
+            if (
+              ie2 &&
+              ie_version < 9 &&
+              !start2 &&
+              (!rect2 || (!rect2.left && !rect2.right))
+            ) {
+              var rSpan = node.parentNode.getClientRects()[0];
+              if (rSpan) {
+                rect2 = {
+                  left: rSpan.left,
+                  right: rSpan.left + charWidth(cm.display),
+                  top: rSpan.top,
+                  bottom: rSpan.bottom,
+                };
+              } else {
+                rect2 = nullRect;
+              }
+            }
+            var rtop = rect2.top - prepared.rect.top,
+              rbot = rect2.bottom - prepared.rect.top;
+            var mid2 = (rtop + rbot) / 2;
+            var heights = prepared.view.measure.heights;
+            var i2 = 0;
+            for (; i2 < heights.length - 1; i2++) {
+              if (mid2 < heights[i2]) {
+                break;
+              }
+            }
+            var top2 = i2 ? heights[i2 - 1] : 0,
+              bot2 = heights[i2];
+            var result2 = {
+              left:
+                (collapse == "right" ? rect2.right : rect2.left) -
+                prepared.rect.left,
+              right:
+                (collapse == "left" ? rect2.left : rect2.right) -
+                prepared.rect.left,
+              top: top2,
+              bottom: bot2,
+            };
+            if (!rect2.left && !rect2.right) {
+              result2.bogus = true;
+            }
+            if (!cm.options.singleCursorHeightPerLine) {
+              result2.rtop = rtop;
+              result2.rbottom = rbot;
+            }
+            return result2;
+          }
+          function maybeUpdateRectForZooming(measure, rect2) {
+            if (
+              !window.screen ||
+              screen.logicalXDPI == null ||
+              screen.logicalXDPI == screen.deviceXDPI ||
+              !hasBadZoomedRects(measure)
+            ) {
+              return rect2;
+            }
+            var scaleX = screen.logicalXDPI / screen.deviceXDPI;
+            var scaleY = screen.logicalYDPI / screen.deviceYDPI;
+            return {
+              left: rect2.left * scaleX,
+              right: rect2.right * scaleX,
+              top: rect2.top * scaleY,
+              bottom: rect2.bottom * scaleY,
+            };
+          }
+          function clearLineMeasurementCacheFor(lineView) {
+            if (lineView.measure) {
+              lineView.measure.cache = {};
+              lineView.measure.heights = null;
+              if (lineView.rest) {
+                for (var i2 = 0; i2 < lineView.rest.length; i2++) {
+                  lineView.measure.caches[i2] = {};
+                }
+              }
+            }
+          }
+          function clearLineMeasurementCache(cm) {
+            cm.display.externalMeasure = null;
+            removeChildren(cm.display.lineMeasure);
+            for (var i2 = 0; i2 < cm.display.view.length; i2++) {
+              clearLineMeasurementCacheFor(cm.display.view[i2]);
+            }
+          }
+          function clearCaches(cm) {
+            clearLineMeasurementCache(cm);
+            cm.display.cachedCharWidth =
+              cm.display.cachedTextHeight =
+              cm.display.cachedPaddingH =
+                null;
+            if (!cm.options.lineWrapping) {
+              cm.display.maxLineChanged = true;
+            }
+            cm.display.lineNumChars = null;
+          }
+          function pageScrollX() {
+            if (chrome && android) {
+              return -(
+                document.body.getBoundingClientRect().left -
+                parseInt(getComputedStyle(document.body).marginLeft)
+              );
+            }
+            return (
+              window.pageXOffset ||
+              (document.documentElement || document.body).scrollLeft
+            );
+          }
+          function pageScrollY() {
+            if (chrome && android) {
+              return -(
+                document.body.getBoundingClientRect().top -
+                parseInt(getComputedStyle(document.body).marginTop)
+              );
+            }
+            return (
+              window.pageYOffset ||
+              (document.documentElement || document.body).scrollTop
+            );
+          }
+          function widgetTopHeight(lineObj) {
+            var ref = visualLine(lineObj);
+            var widgets = ref.widgets;
+            var height = 0;
+            if (widgets) {
+              for (var i2 = 0; i2 < widgets.length; ++i2) {
+                if (widgets[i2].above) {
+                  height += widgetHeight(widgets[i2]);
+                }
+              }
+            }
+            return height;
+          }
+          function intoCoordSystem(
+            cm,
+            lineObj,
+            rect2,
+            context,
+            includeWidgets
+          ) {
+            if (!includeWidgets) {
+              var height = widgetTopHeight(lineObj);
+              rect2.top += height;
+              rect2.bottom += height;
+            }
+            if (context == "line") {
+              return rect2;
+            }
+            if (!context) {
+              context = "local";
+            }
+            var yOff = heightAtLine(lineObj);
+            if (context == "local") {
+              yOff += paddingTop(cm.display);
+            } else {
+              yOff -= cm.display.viewOffset;
+            }
+            if (context == "page" || context == "window") {
+              var lOff = cm.display.lineSpace.getBoundingClientRect();
+              yOff += lOff.top + (context == "window" ? 0 : pageScrollY());
+              var xOff = lOff.left + (context == "window" ? 0 : pageScrollX());
+              rect2.left += xOff;
+              rect2.right += xOff;
+            }
+            rect2.top += yOff;
+            rect2.bottom += yOff;
+            return rect2;
+          }
+          function fromCoordSystem(cm, coords, context) {
+            if (context == "div") {
+              return coords;
+            }
+            var left = coords.left,
+              top2 = coords.top;
+            if (context == "page") {
+              left -= pageScrollX();
+              top2 -= pageScrollY();
+            } else if (context == "local" || !context) {
+              var localBox = cm.display.sizer.getBoundingClientRect();
+              left += localBox.left;
+              top2 += localBox.top;
+            }
+            var lineSpaceBox = cm.display.lineSpace.getBoundingClientRect();
+            return {
+              left: left - lineSpaceBox.left,
+              top: top2 - lineSpaceBox.top,
+            };
+          }
+          function charCoords(cm, pos, context, lineObj, bias) {
+            if (!lineObj) {
+              lineObj = getLine2(cm.doc, pos.line);
+            }
+            return intoCoordSystem(
+              cm,
+              lineObj,
+              measureChar(cm, lineObj, pos.ch, bias),
+              context
+            );
+          }
+          function cursorCoords(
+            cm,
+            pos,
+            context,
+            lineObj,
+            preparedMeasure,
+            varHeight
+          ) {
+            lineObj = lineObj || getLine2(cm.doc, pos.line);
+            if (!preparedMeasure) {
+              preparedMeasure = prepareMeasureForLine(cm, lineObj);
+            }
+            function get(ch3, right) {
+              var m = measureCharPrepared(
+                cm,
+                preparedMeasure,
+                ch3,
+                right ? "right" : "left",
+                varHeight
+              );
+              if (right) {
+                m.left = m.right;
+              } else {
+                m.right = m.left;
+              }
+              return intoCoordSystem(cm, lineObj, m, context);
+            }
+            var order2 = getOrder(lineObj, cm.doc.direction),
+              ch2 = pos.ch,
+              sticky = pos.sticky;
+            if (ch2 >= lineObj.text.length) {
+              ch2 = lineObj.text.length;
+              sticky = "before";
+            } else if (ch2 <= 0) {
+              ch2 = 0;
+              sticky = "after";
+            }
+            if (!order2) {
+              return get(
+                sticky == "before" ? ch2 - 1 : ch2,
+                sticky == "before"
+              );
+            }
+            function getBidi(ch3, partPos2, invert) {
+              var part2 = order2[partPos2],
+                right = part2.level == 1;
+              return get(invert ? ch3 - 1 : ch3, right != invert);
+            }
+            var partPos = getBidiPartAt(order2, ch2, sticky);
+            var other = bidiOther;
+            var val = getBidi(ch2, partPos, sticky == "before");
+            if (other != null) {
+              val.other = getBidi(ch2, other, sticky != "before");
+            }
+            return val;
+          }
+          function estimateCoords(cm, pos) {
+            var left = 0;
+            pos = clipPos(cm.doc, pos);
+            if (!cm.options.lineWrapping) {
+              left = charWidth(cm.display) * pos.ch;
+            }
+            var lineObj = getLine2(cm.doc, pos.line);
+            var top2 = heightAtLine(lineObj) + paddingTop(cm.display);
+            return {
+              left,
+              right: left,
+              top: top2,
+              bottom: top2 + lineObj.height,
+            };
+          }
+          function PosWithInfo(line, ch2, sticky, outside, xRel) {
+            var pos = Pos(line, ch2, sticky);
+            pos.xRel = xRel;
+            if (outside) {
+              pos.outside = outside;
+            }
+            return pos;
+          }
+          function coordsChar(cm, x2, y2) {
+            var doc = cm.doc;
+            y2 += cm.display.viewOffset;
+            if (y2 < 0) {
+              return PosWithInfo(doc.first, 0, null, -1, -1);
+            }
+            var lineN = lineAtHeight(doc, y2),
+              last = doc.first + doc.size - 1;
+            if (lineN > last) {
+              return PosWithInfo(
+                doc.first + doc.size - 1,
+                getLine2(doc, last).text.length,
+                null,
+                1,
+                1
+              );
+            }
+            if (x2 < 0) {
+              x2 = 0;
+            }
+            var lineObj = getLine2(doc, lineN);
+            for (;;) {
+              var found = coordsCharInner(cm, lineObj, lineN, x2, y2);
+              var collapsed = collapsedSpanAround(
+                lineObj,
+                found.ch + (found.xRel > 0 || found.outside > 0 ? 1 : 0)
+              );
+              if (!collapsed) {
+                return found;
+              }
+              var rangeEnd = collapsed.find(1);
+              if (rangeEnd.line == lineN) {
+                return rangeEnd;
+              }
+              lineObj = getLine2(doc, (lineN = rangeEnd.line));
+            }
+          }
+          function wrappedLineExtent(cm, lineObj, preparedMeasure, y2) {
+            y2 -= widgetTopHeight(lineObj);
+            var end2 = lineObj.text.length;
+            var begin = findFirst(
+              function (ch2) {
+                return (
+                  measureCharPrepared(cm, preparedMeasure, ch2 - 1).bottom <= y2
+                );
+              },
+              end2,
+              0
+            );
+            end2 = findFirst(
+              function (ch2) {
+                return measureCharPrepared(cm, preparedMeasure, ch2).top > y2;
+              },
+              begin,
+              end2
+            );
+            return { begin, end: end2 };
+          }
+          function wrappedLineExtentChar(
+            cm,
+            lineObj,
+            preparedMeasure,
+            target2
+          ) {
+            if (!preparedMeasure) {
+              preparedMeasure = prepareMeasureForLine(cm, lineObj);
+            }
+            var targetTop = intoCoordSystem(
+              cm,
+              lineObj,
+              measureCharPrepared(cm, preparedMeasure, target2),
+              "line"
+            ).top;
+            return wrappedLineExtent(cm, lineObj, preparedMeasure, targetTop);
+          }
+          function boxIsAfter(box, x2, y2, left) {
+            return box.bottom <= y2
+              ? false
+              : box.top > y2
+              ? true
+              : (left ? box.left : box.right) > x2;
+          }
+          function coordsCharInner(cm, lineObj, lineNo2, x2, y2) {
+            y2 -= heightAtLine(lineObj);
+            var preparedMeasure = prepareMeasureForLine(cm, lineObj);
+            var widgetHeight2 = widgetTopHeight(lineObj);
+            var begin = 0,
+              end2 = lineObj.text.length,
+              ltr = true;
+            var order2 = getOrder(lineObj, cm.doc.direction);
+            if (order2) {
+              var part2 = (
+                cm.options.lineWrapping ? coordsBidiPartWrapped : coordsBidiPart
+              )(cm, lineObj, lineNo2, preparedMeasure, order2, x2, y2);
+              ltr = part2.level != 1;
+              begin = ltr ? part2.from : part2.to - 1;
+              end2 = ltr ? part2.to : part2.from - 1;
+            }
+            var chAround = null,
+              boxAround = null;
+            var ch2 = findFirst(
+              function (ch3) {
+                var box = measureCharPrepared(cm, preparedMeasure, ch3);
+                box.top += widgetHeight2;
+                box.bottom += widgetHeight2;
+                if (!boxIsAfter(box, x2, y2, false)) {
+                  return false;
+                }
+                if (box.top <= y2 && box.left <= x2) {
+                  chAround = ch3;
+                  boxAround = box;
+                }
+                return true;
+              },
+              begin,
+              end2
+            );
+            var baseX,
+              sticky,
+              outside = false;
+            if (boxAround) {
+              var atLeft = x2 - boxAround.left < boxAround.right - x2,
+                atStart = atLeft == ltr;
+              ch2 = chAround + (atStart ? 0 : 1);
+              sticky = atStart ? "after" : "before";
+              baseX = atLeft ? boxAround.left : boxAround.right;
+            } else {
+              if (!ltr && (ch2 == end2 || ch2 == begin)) {
+                ch2++;
+              }
+              sticky =
+                ch2 == 0
+                  ? "after"
+                  : ch2 == lineObj.text.length
+                  ? "before"
+                  : measureCharPrepared(
+                      cm,
+                      preparedMeasure,
+                      ch2 - (ltr ? 1 : 0)
+                    ).bottom +
+                      widgetHeight2 <=
+                      y2 ==
+                    ltr
+                  ? "after"
+                  : "before";
+              var coords = cursorCoords(
+                cm,
+                Pos(lineNo2, ch2, sticky),
+                "line",
+                lineObj,
+                preparedMeasure
+              );
+              baseX = coords.left;
+              outside = y2 < coords.top ? -1 : y2 >= coords.bottom ? 1 : 0;
+            }
+            ch2 = skipExtendingChars(lineObj.text, ch2, 1);
+            return PosWithInfo(lineNo2, ch2, sticky, outside, x2 - baseX);
+          }
+          function coordsBidiPart(
+            cm,
+            lineObj,
+            lineNo2,
+            preparedMeasure,
+            order2,
+            x2,
+            y2
+          ) {
+            var index = findFirst(
+              function (i2) {
+                var part3 = order2[i2],
+                  ltr2 = part3.level != 1;
+                return boxIsAfter(
+                  cursorCoords(
+                    cm,
+                    Pos(
+                      lineNo2,
+                      ltr2 ? part3.to : part3.from,
+                      ltr2 ? "before" : "after"
+                    ),
+                    "line",
+                    lineObj,
+                    preparedMeasure
+                  ),
+                  x2,
+                  y2,
+                  true
+                );
+              },
+              0,
+              order2.length - 1
+            );
+            var part2 = order2[index];
+            if (index > 0) {
+              var ltr = part2.level != 1;
+              var start2 = cursorCoords(
+                cm,
+                Pos(
+                  lineNo2,
+                  ltr ? part2.from : part2.to,
+                  ltr ? "after" : "before"
+                ),
+                "line",
+                lineObj,
+                preparedMeasure
+              );
+              if (boxIsAfter(start2, x2, y2, true) && start2.top > y2) {
+                part2 = order2[index - 1];
+              }
+            }
+            return part2;
+          }
+          function coordsBidiPartWrapped(
+            cm,
+            lineObj,
+            _lineNo,
+            preparedMeasure,
+            order2,
+            x2,
+            y2
+          ) {
+            var ref = wrappedLineExtent(cm, lineObj, preparedMeasure, y2);
+            var begin = ref.begin;
+            var end2 = ref.end;
+            if (/\s/.test(lineObj.text.charAt(end2 - 1))) {
+              end2--;
+            }
+            var part2 = null,
+              closestDist = null;
+            for (var i2 = 0; i2 < order2.length; i2++) {
+              var p2 = order2[i2];
+              if (p2.from >= end2 || p2.to <= begin) {
+                continue;
+              }
+              var ltr = p2.level != 1;
+              var endX = measureCharPrepared(
+                cm,
+                preparedMeasure,
+                ltr ? Math.min(end2, p2.to) - 1 : Math.max(begin, p2.from)
+              ).right;
+              var dist2 = endX < x2 ? x2 - endX + 1e9 : endX - x2;
+              if (!part2 || closestDist > dist2) {
+                part2 = p2;
+                closestDist = dist2;
+              }
+            }
+            if (!part2) {
+              part2 = order2[order2.length - 1];
+            }
+            if (part2.from < begin) {
+              part2 = { from: begin, to: part2.to, level: part2.level };
+            }
+            if (part2.to > end2) {
+              part2 = { from: part2.from, to: end2, level: part2.level };
+            }
+            return part2;
+          }
+          var measureText;
+          function textHeight(display) {
+            if (display.cachedTextHeight != null) {
+              return display.cachedTextHeight;
+            }
+            if (measureText == null) {
+              measureText = elt("pre", null, "CodeMirror-line-like");
+              for (var i2 = 0; i2 < 49; ++i2) {
+                measureText.appendChild(document.createTextNode("x"));
+                measureText.appendChild(elt("br"));
+              }
+              measureText.appendChild(document.createTextNode("x"));
+            }
+            removeChildrenAndAdd(display.measure, measureText);
+            var height = measureText.offsetHeight / 50;
+            if (height > 3) {
+              display.cachedTextHeight = height;
+            }
+            removeChildren(display.measure);
+            return height || 1;
+          }
+          function charWidth(display) {
+            if (display.cachedCharWidth != null) {
+              return display.cachedCharWidth;
+            }
+            var anchor = elt("span", "xxxxxxxxxx");
+            var pre2 = elt("pre", [anchor], "CodeMirror-line-like");
+            removeChildrenAndAdd(display.measure, pre2);
+            var rect2 = anchor.getBoundingClientRect(),
+              width = (rect2.right - rect2.left) / 10;
+            if (width > 2) {
+              display.cachedCharWidth = width;
+            }
+            return width || 10;
+          }
+          function getDimensions(cm) {
+            var d = cm.display,
+              left = {},
+              width = {};
+            var gutterLeft = d.gutters.clientLeft;
+            for (
+              var n2 = d.gutters.firstChild, i2 = 0;
+              n2;
+              n2 = n2.nextSibling, ++i2
+            ) {
+              var id2 = cm.display.gutterSpecs[i2].className;
+              left[id2] = n2.offsetLeft + n2.clientLeft + gutterLeft;
+              width[id2] = n2.clientWidth;
+            }
+            return {
+              fixedPos: compensateForHScroll(d),
+              gutterTotalWidth: d.gutters.offsetWidth,
+              gutterLeft: left,
+              gutterWidth: width,
+              wrapperWidth: d.wrapper.clientWidth,
+            };
+          }
+          function compensateForHScroll(display) {
+            return (
+              display.scroller.getBoundingClientRect().left -
+              display.sizer.getBoundingClientRect().left
+            );
+          }
+          function estimateHeight(cm) {
+            var th2 = textHeight(cm.display),
+              wrapping = cm.options.lineWrapping;
+            var perLine =
+              wrapping &&
+              Math.max(
+                5,
+                cm.display.scroller.clientWidth / charWidth(cm.display) - 3
+              );
+            return function (line) {
+              if (lineIsHidden(cm.doc, line)) {
+                return 0;
+              }
+              var widgetsHeight = 0;
+              if (line.widgets) {
+                for (var i2 = 0; i2 < line.widgets.length; i2++) {
+                  if (line.widgets[i2].height) {
+                    widgetsHeight += line.widgets[i2].height;
+                  }
+                }
+              }
+              if (wrapping) {
+                return (
+                  widgetsHeight +
+                  (Math.ceil(line.text.length / perLine) || 1) * th2
+                );
+              } else {
+                return widgetsHeight + th2;
+              }
+            };
+          }
+          function estimateLineHeights(cm) {
+            var doc = cm.doc,
+              est = estimateHeight(cm);
+            doc.iter(function (line) {
+              var estHeight = est(line);
+              if (estHeight != line.height) {
+                updateLineHeight(line, estHeight);
+              }
+            });
+          }
+          function posFromMouse(cm, e, liberal, forRect) {
+            var display = cm.display;
+            if (
+              !liberal &&
+              e_target(e).getAttribute("cm-not-content") == "true"
+            ) {
+              return null;
+            }
+            var x2,
+              y2,
+              space = display.lineSpace.getBoundingClientRect();
+            try {
+              x2 = e.clientX - space.left;
+              y2 = e.clientY - space.top;
+            } catch (e$1) {
+              return null;
+            }
+            var coords = coordsChar(cm, x2, y2),
+              line;
+            if (
+              forRect &&
+              coords.xRel > 0 &&
+              (line = getLine2(cm.doc, coords.line).text).length == coords.ch
+            ) {
+              var colDiff =
+                countColumn(line, line.length, cm.options.tabSize) -
+                line.length;
+              coords = Pos(
+                coords.line,
+                Math.max(
+                  0,
+                  Math.round(
+                    (x2 - paddingH(cm.display).left) / charWidth(cm.display)
+                  ) - colDiff
+                )
+              );
+            }
+            return coords;
+          }
+          function findViewIndex(cm, n2) {
+            if (n2 >= cm.display.viewTo) {
+              return null;
+            }
+            n2 -= cm.display.viewFrom;
+            if (n2 < 0) {
+              return null;
+            }
+            var view = cm.display.view;
+            for (var i2 = 0; i2 < view.length; i2++) {
+              n2 -= view[i2].size;
+              if (n2 < 0) {
+                return i2;
+              }
+            }
+          }
+          function regChange(cm, from, to, lendiff) {
+            if (from == null) {
+              from = cm.doc.first;
+            }
+            if (to == null) {
+              to = cm.doc.first + cm.doc.size;
+            }
+            if (!lendiff) {
+              lendiff = 0;
+            }
+            var display = cm.display;
+            if (
+              lendiff &&
+              to < display.viewTo &&
+              (display.updateLineNumbers == null ||
+                display.updateLineNumbers > from)
+            ) {
+              display.updateLineNumbers = from;
+            }
+            cm.curOp.viewChanged = true;
+            if (from >= display.viewTo) {
+              if (
+                sawCollapsedSpans &&
+                visualLineNo(cm.doc, from) < display.viewTo
+              ) {
+                resetView(cm);
+              }
+            } else if (to <= display.viewFrom) {
+              if (
+                sawCollapsedSpans &&
+                visualLineEndNo(cm.doc, to + lendiff) > display.viewFrom
+              ) {
+                resetView(cm);
+              } else {
+                display.viewFrom += lendiff;
+                display.viewTo += lendiff;
+              }
+            } else if (from <= display.viewFrom && to >= display.viewTo) {
+              resetView(cm);
+            } else if (from <= display.viewFrom) {
+              var cut = viewCuttingPoint(cm, to, to + lendiff, 1);
+              if (cut) {
+                display.view = display.view.slice(cut.index);
+                display.viewFrom = cut.lineN;
+                display.viewTo += lendiff;
+              } else {
+                resetView(cm);
+              }
+            } else if (to >= display.viewTo) {
+              var cut$1 = viewCuttingPoint(cm, from, from, -1);
+              if (cut$1) {
+                display.view = display.view.slice(0, cut$1.index);
+                display.viewTo = cut$1.lineN;
+              } else {
+                resetView(cm);
+              }
+            } else {
+              var cutTop = viewCuttingPoint(cm, from, from, -1);
+              var cutBot = viewCuttingPoint(cm, to, to + lendiff, 1);
+              if (cutTop && cutBot) {
+                display.view = display.view
+                  .slice(0, cutTop.index)
+                  .concat(buildViewArray(cm, cutTop.lineN, cutBot.lineN))
+                  .concat(display.view.slice(cutBot.index));
+                display.viewTo += lendiff;
+              } else {
+                resetView(cm);
+              }
+            }
+            var ext = display.externalMeasured;
+            if (ext) {
+              if (to < ext.lineN) {
+                ext.lineN += lendiff;
+              } else if (from < ext.lineN + ext.size) {
+                display.externalMeasured = null;
+              }
+            }
+          }
+          function regLineChange(cm, line, type2) {
+            cm.curOp.viewChanged = true;
+            var display = cm.display,
+              ext = cm.display.externalMeasured;
+            if (ext && line >= ext.lineN && line < ext.lineN + ext.size) {
+              display.externalMeasured = null;
+            }
+            if (line < display.viewFrom || line >= display.viewTo) {
+              return;
+            }
+            var lineView = display.view[findViewIndex(cm, line)];
+            if (lineView.node == null) {
+              return;
+            }
+            var arr = lineView.changes || (lineView.changes = []);
+            if (indexOf(arr, type2) == -1) {
+              arr.push(type2);
+            }
+          }
+          function resetView(cm) {
+            cm.display.viewFrom = cm.display.viewTo = cm.doc.first;
+            cm.display.view = [];
+            cm.display.viewOffset = 0;
+          }
+          function viewCuttingPoint(cm, oldN, newN, dir) {
+            var index = findViewIndex(cm, oldN),
+              diff2,
+              view = cm.display.view;
+            if (!sawCollapsedSpans || newN == cm.doc.first + cm.doc.size) {
+              return { index, lineN: newN };
+            }
+            var n2 = cm.display.viewFrom;
+            for (var i2 = 0; i2 < index; i2++) {
+              n2 += view[i2].size;
+            }
+            if (n2 != oldN) {
+              if (dir > 0) {
+                if (index == view.length - 1) {
+                  return null;
+                }
+                diff2 = n2 + view[index].size - oldN;
+                index++;
+              } else {
+                diff2 = n2 - oldN;
+              }
+              oldN += diff2;
+              newN += diff2;
+            }
+            while (visualLineNo(cm.doc, newN) != newN) {
+              if (index == (dir < 0 ? 0 : view.length - 1)) {
+                return null;
+              }
+              newN += dir * view[index - (dir < 0 ? 1 : 0)].size;
+              index += dir;
+            }
+            return { index, lineN: newN };
+          }
+          function adjustView(cm, from, to) {
+            var display = cm.display,
+              view = display.view;
+            if (
+              view.length == 0 ||
+              from >= display.viewTo ||
+              to <= display.viewFrom
+            ) {
+              display.view = buildViewArray(cm, from, to);
+              display.viewFrom = from;
+            } else {
+              if (display.viewFrom > from) {
+                display.view = buildViewArray(
+                  cm,
+                  from,
+                  display.viewFrom
+                ).concat(display.view);
+              } else if (display.viewFrom < from) {
+                display.view = display.view.slice(findViewIndex(cm, from));
+              }
+              display.viewFrom = from;
+              if (display.viewTo < to) {
+                display.view = display.view.concat(
+                  buildViewArray(cm, display.viewTo, to)
+                );
+              } else if (display.viewTo > to) {
+                display.view = display.view.slice(0, findViewIndex(cm, to));
+              }
+            }
+            display.viewTo = to;
+          }
+          function countDirtyView(cm) {
+            var view = cm.display.view,
+              dirty = 0;
+            for (var i2 = 0; i2 < view.length; i2++) {
+              var lineView = view[i2];
+              if (!lineView.hidden && (!lineView.node || lineView.changes)) {
+                ++dirty;
+              }
+            }
+            return dirty;
+          }
+          function updateSelection(cm) {
+            cm.display.input.showSelection(cm.display.input.prepareSelection());
+          }
+          function prepareSelection(cm, primary) {
+            if (primary === void 0) primary = true;
+            var doc = cm.doc,
+              result2 = {};
+            var curFragment = (result2.cursors =
+              document.createDocumentFragment());
+            var selFragment = (result2.selection =
+              document.createDocumentFragment());
+            var customCursor = cm.options.$customCursor;
+            if (customCursor) {
+              primary = true;
+            }
+            for (var i2 = 0; i2 < doc.sel.ranges.length; i2++) {
+              if (!primary && i2 == doc.sel.primIndex) {
+                continue;
+              }
+              var range3 = doc.sel.ranges[i2];
+              if (
+                range3.from().line >= cm.display.viewTo ||
+                range3.to().line < cm.display.viewFrom
+              ) {
+                continue;
+              }
+              var collapsed = range3.empty();
+              if (customCursor) {
+                var head = customCursor(cm, range3);
+                if (head) {
+                  drawSelectionCursor(cm, head, curFragment);
+                }
+              } else if (collapsed || cm.options.showCursorWhenSelecting) {
+                drawSelectionCursor(cm, range3.head, curFragment);
+              }
+              if (!collapsed) {
+                drawSelectionRange(cm, range3, selFragment);
+              }
+            }
+            return result2;
+          }
+          function drawSelectionCursor(cm, head, output) {
+            var pos = cursorCoords(
+              cm,
+              head,
+              "div",
+              null,
+              null,
+              !cm.options.singleCursorHeightPerLine
+            );
+            var cursor = output.appendChild(
+              elt("div", "\xA0", "CodeMirror-cursor")
+            );
+            cursor.style.left = pos.left + "px";
+            cursor.style.top = pos.top + "px";
+            cursor.style.height =
+              Math.max(0, pos.bottom - pos.top) * cm.options.cursorHeight +
+              "px";
+            if (/\bcm-fat-cursor\b/.test(cm.getWrapperElement().className)) {
+              var charPos = charCoords(cm, head, "div", null, null);
+              var width = charPos.right - charPos.left;
+              cursor.style.width =
+                (width > 0 ? width : cm.defaultCharWidth()) + "px";
+            }
+            if (pos.other) {
+              var otherCursor = output.appendChild(
+                elt(
+                  "div",
+                  "\xA0",
+                  "CodeMirror-cursor CodeMirror-secondarycursor"
+                )
+              );
+              otherCursor.style.display = "";
+              otherCursor.style.left = pos.other.left + "px";
+              otherCursor.style.top = pos.other.top + "px";
+              otherCursor.style.height =
+                (pos.other.bottom - pos.other.top) * 0.85 + "px";
+            }
+          }
+          function cmpCoords(a, b) {
+            return a.top - b.top || a.left - b.left;
+          }
+          function drawSelectionRange(cm, range3, output) {
+            var display = cm.display,
+              doc = cm.doc;
+            var fragment = document.createDocumentFragment();
+            var padding = paddingH(cm.display),
+              leftSide = padding.left;
+            var rightSide =
+              Math.max(
+                display.sizerWidth,
+                displayWidth(cm) - display.sizer.offsetLeft
+              ) - padding.right;
+            var docLTR = doc.direction == "ltr";
+            function add2(left, top2, width, bottom2) {
+              if (top2 < 0) {
+                top2 = 0;
+              }
+              top2 = Math.round(top2);
+              bottom2 = Math.round(bottom2);
+              fragment.appendChild(
+                elt(
+                  "div",
+                  null,
+                  "CodeMirror-selected",
+                  "position: absolute; left: " +
+                    left +
+                    "px;\n                             top: " +
+                    top2 +
+                    "px; width: " +
+                    (width == null ? rightSide - left : width) +
+                    "px;\n                             height: " +
+                    (bottom2 - top2) +
+                    "px"
+                )
+              );
+            }
+            function drawForLine(line, fromArg, toArg) {
+              var lineObj = getLine2(doc, line);
+              var lineLen = lineObj.text.length;
+              var start2, end2;
+              function coords(ch2, bias) {
+                return charCoords(cm, Pos(line, ch2), "div", lineObj, bias);
+              }
+              function wrapX(pos, dir, side) {
+                var extent = wrappedLineExtentChar(cm, lineObj, null, pos);
+                var prop3 =
+                  (dir == "ltr") == (side == "after") ? "left" : "right";
+                var ch2 =
+                  side == "after"
+                    ? extent.begin
+                    : extent.end -
+                      (/\s/.test(lineObj.text.charAt(extent.end - 1)) ? 2 : 1);
+                return coords(ch2, prop3)[prop3];
+              }
+              var order2 = getOrder(lineObj, doc.direction);
+              iterateBidiSections(
+                order2,
+                fromArg || 0,
+                toArg == null ? lineLen : toArg,
+                function (from, to, dir, i2) {
+                  var ltr = dir == "ltr";
+                  var fromPos = coords(from, ltr ? "left" : "right");
+                  var toPos = coords(to - 1, ltr ? "right" : "left");
+                  var openStart = fromArg == null && from == 0,
+                    openEnd = toArg == null && to == lineLen;
+                  var first = i2 == 0,
+                    last = !order2 || i2 == order2.length - 1;
+                  if (toPos.top - fromPos.top <= 3) {
+                    var openLeft = (docLTR ? openStart : openEnd) && first;
+                    var openRight = (docLTR ? openEnd : openStart) && last;
+                    var left = openLeft
+                      ? leftSide
+                      : (ltr ? fromPos : toPos).left;
+                    var right = openRight
+                      ? rightSide
+                      : (ltr ? toPos : fromPos).right;
+                    add2(left, fromPos.top, right - left, fromPos.bottom);
+                  } else {
+                    var topLeft, topRight, botLeft, botRight;
+                    if (ltr) {
+                      topLeft =
+                        docLTR && openStart && first ? leftSide : fromPos.left;
+                      topRight = docLTR
+                        ? rightSide
+                        : wrapX(from, dir, "before");
+                      botLeft = docLTR ? leftSide : wrapX(to, dir, "after");
+                      botRight =
+                        docLTR && openEnd && last ? rightSide : toPos.right;
+                    } else {
+                      topLeft = !docLTR ? leftSide : wrapX(from, dir, "before");
+                      topRight =
+                        !docLTR && openStart && first
+                          ? rightSide
+                          : fromPos.right;
+                      botLeft =
+                        !docLTR && openEnd && last ? leftSide : toPos.left;
+                      botRight = !docLTR ? rightSide : wrapX(to, dir, "after");
+                    }
+                    add2(
+                      topLeft,
+                      fromPos.top,
+                      topRight - topLeft,
+                      fromPos.bottom
+                    );
+                    if (fromPos.bottom < toPos.top) {
+                      add2(leftSide, fromPos.bottom, null, toPos.top);
+                    }
+                    add2(botLeft, toPos.top, botRight - botLeft, toPos.bottom);
+                  }
+                  if (!start2 || cmpCoords(fromPos, start2) < 0) {
+                    start2 = fromPos;
+                  }
+                  if (cmpCoords(toPos, start2) < 0) {
+                    start2 = toPos;
+                  }
+                  if (!end2 || cmpCoords(fromPos, end2) < 0) {
+                    end2 = fromPos;
+                  }
+                  if (cmpCoords(toPos, end2) < 0) {
+                    end2 = toPos;
+                  }
+                }
+              );
+              return { start: start2, end: end2 };
+            }
+            var sFrom = range3.from(),
+              sTo = range3.to();
+            if (sFrom.line == sTo.line) {
+              drawForLine(sFrom.line, sFrom.ch, sTo.ch);
+            } else {
+              var fromLine = getLine2(doc, sFrom.line),
+                toLine = getLine2(doc, sTo.line);
+              var singleVLine = visualLine(fromLine) == visualLine(toLine);
+              var leftEnd = drawForLine(
+                sFrom.line,
+                sFrom.ch,
+                singleVLine ? fromLine.text.length + 1 : null
+              ).end;
+              var rightStart = drawForLine(
+                sTo.line,
+                singleVLine ? 0 : null,
+                sTo.ch
+              ).start;
+              if (singleVLine) {
+                if (leftEnd.top < rightStart.top - 2) {
+                  add2(leftEnd.right, leftEnd.top, null, leftEnd.bottom);
+                  add2(
+                    leftSide,
+                    rightStart.top,
+                    rightStart.left,
+                    rightStart.bottom
+                  );
+                } else {
+                  add2(
+                    leftEnd.right,
+                    leftEnd.top,
+                    rightStart.left - leftEnd.right,
+                    leftEnd.bottom
+                  );
+                }
+              }
+              if (leftEnd.bottom < rightStart.top) {
+                add2(leftSide, leftEnd.bottom, null, rightStart.top);
+              }
+            }
+            output.appendChild(fragment);
+          }
+          function restartBlink(cm) {
+            if (!cm.state.focused) {
+              return;
+            }
+            var display = cm.display;
+            clearInterval(display.blinker);
+            var on2 = true;
+            display.cursorDiv.style.visibility = "";
+            if (cm.options.cursorBlinkRate > 0) {
+              display.blinker = setInterval(function () {
+                if (!cm.hasFocus()) {
+                  onBlur(cm);
+                }
+                display.cursorDiv.style.visibility = (on2 = !on2)
+                  ? ""
+                  : "hidden";
+              }, cm.options.cursorBlinkRate);
+            } else if (cm.options.cursorBlinkRate < 0) {
+              display.cursorDiv.style.visibility = "hidden";
+            }
+          }
+          function ensureFocus(cm) {
+            if (!cm.hasFocus()) {
+              cm.display.input.focus();
+              if (!cm.state.focused) {
+                onFocus(cm);
+              }
+            }
+          }
+          function delayBlurEvent(cm) {
+            cm.state.delayingBlurEvent = true;
+            setTimeout(function () {
+              if (cm.state.delayingBlurEvent) {
+                cm.state.delayingBlurEvent = false;
+                if (cm.state.focused) {
+                  onBlur(cm);
+                }
+              }
+            }, 100);
+          }
+          function onFocus(cm, e) {
+            if (cm.state.delayingBlurEvent && !cm.state.draggingText) {
+              cm.state.delayingBlurEvent = false;
+            }
+            if (cm.options.readOnly == "nocursor") {
+              return;
+            }
+            if (!cm.state.focused) {
+              signal(cm, "focus", cm, e);
+              cm.state.focused = true;
+              addClass(cm.display.wrapper, "CodeMirror-focused");
+              if (!cm.curOp && cm.display.selForContextMenu != cm.doc.sel) {
+                cm.display.input.reset();
+                if (webkit) {
+                  setTimeout(function () {
+                    return cm.display.input.reset(true);
+                  }, 20);
+                }
+              }
+              cm.display.input.receivedFocus();
+            }
+            restartBlink(cm);
+          }
+          function onBlur(cm, e) {
+            if (cm.state.delayingBlurEvent) {
+              return;
+            }
+            if (cm.state.focused) {
+              signal(cm, "blur", cm, e);
+              cm.state.focused = false;
+              rmClass(cm.display.wrapper, "CodeMirror-focused");
+            }
+            clearInterval(cm.display.blinker);
+            setTimeout(function () {
+              if (!cm.state.focused) {
+                cm.display.shift = false;
+              }
+            }, 150);
+          }
+          function updateHeightsInViewport(cm) {
+            var display = cm.display;
+            var prevBottom = display.lineDiv.offsetTop;
+            var viewTop = Math.max(
+              0,
+              display.scroller.getBoundingClientRect().top
+            );
+            var oldHeight = display.lineDiv.getBoundingClientRect().top;
+            var mustScroll = 0;
+            for (var i2 = 0; i2 < display.view.length; i2++) {
+              var cur = display.view[i2],
+                wrapping = cm.options.lineWrapping;
+              var height = void 0,
+                width = 0;
+              if (cur.hidden) {
+                continue;
+              }
+              oldHeight += cur.line.height;
+              if (ie2 && ie_version < 8) {
+                var bot2 = cur.node.offsetTop + cur.node.offsetHeight;
+                height = bot2 - prevBottom;
+                prevBottom = bot2;
+              } else {
+                var box = cur.node.getBoundingClientRect();
+                height = box.bottom - box.top;
+                if (!wrapping && cur.text.firstChild) {
+                  width =
+                    cur.text.firstChild.getBoundingClientRect().right -
+                    box.left -
+                    1;
+                }
+              }
+              var diff2 = cur.line.height - height;
+              if (diff2 > 5e-3 || diff2 < -5e-3) {
+                if (oldHeight < viewTop) {
+                  mustScroll -= diff2;
+                }
+                updateLineHeight(cur.line, height);
+                updateWidgetHeight(cur.line);
+                if (cur.rest) {
+                  for (var j = 0; j < cur.rest.length; j++) {
+                    updateWidgetHeight(cur.rest[j]);
+                  }
+                }
+              }
+              if (width > cm.display.sizerWidth) {
+                var chWidth = Math.ceil(width / charWidth(cm.display));
+                if (chWidth > cm.display.maxLineLength) {
+                  cm.display.maxLineLength = chWidth;
+                  cm.display.maxLine = cur.line;
+                  cm.display.maxLineChanged = true;
+                }
+              }
+            }
+            if (Math.abs(mustScroll) > 2) {
+              display.scroller.scrollTop += mustScroll;
+            }
+          }
+          function updateWidgetHeight(line) {
+            if (line.widgets) {
+              for (var i2 = 0; i2 < line.widgets.length; ++i2) {
+                var w2 = line.widgets[i2],
+                  parent = w2.node.parentNode;
+                if (parent) {
+                  w2.height = parent.offsetHeight;
+                }
+              }
+            }
+          }
+          function visibleLines(display, doc, viewport) {
+            var top2 =
+              viewport && viewport.top != null
+                ? Math.max(0, viewport.top)
+                : display.scroller.scrollTop;
+            top2 = Math.floor(top2 - paddingTop(display));
+            var bottom2 =
+              viewport && viewport.bottom != null
+                ? viewport.bottom
+                : top2 + display.wrapper.clientHeight;
+            var from = lineAtHeight(doc, top2),
+              to = lineAtHeight(doc, bottom2);
+            if (viewport && viewport.ensure) {
+              var ensureFrom = viewport.ensure.from.line,
+                ensureTo = viewport.ensure.to.line;
+              if (ensureFrom < from) {
+                from = ensureFrom;
+                to = lineAtHeight(
+                  doc,
+                  heightAtLine(getLine2(doc, ensureFrom)) +
+                    display.wrapper.clientHeight
+                );
+              } else if (Math.min(ensureTo, doc.lastLine()) >= to) {
+                from = lineAtHeight(
+                  doc,
+                  heightAtLine(getLine2(doc, ensureTo)) -
+                    display.wrapper.clientHeight
+                );
+                to = ensureTo;
+              }
+            }
+            return { from, to: Math.max(to, from + 1) };
+          }
+          function maybeScrollWindow(cm, rect2) {
+            if (signalDOMEvent(cm, "scrollCursorIntoView")) {
+              return;
+            }
+            var display = cm.display,
+              box = display.sizer.getBoundingClientRect(),
+              doScroll = null;
+            if (rect2.top + box.top < 0) {
+              doScroll = true;
+            } else if (
+              rect2.bottom + box.top >
+              (window.innerHeight || document.documentElement.clientHeight)
+            ) {
+              doScroll = false;
+            }
+            if (doScroll != null && !phantom) {
+              var scrollNode = elt(
+                "div",
+                "\u200B",
+                null,
+                "position: absolute;\n                         top: " +
+                  (rect2.top - display.viewOffset - paddingTop(cm.display)) +
+                  "px;\n                         height: " +
+                  (rect2.bottom -
+                    rect2.top +
+                    scrollGap(cm) +
+                    display.barHeight) +
+                  "px;\n                         left: " +
+                  rect2.left +
+                  "px; width: " +
+                  Math.max(2, rect2.right - rect2.left) +
+                  "px;"
+              );
+              cm.display.lineSpace.appendChild(scrollNode);
+              scrollNode.scrollIntoView(doScroll);
+              cm.display.lineSpace.removeChild(scrollNode);
+            }
+          }
+          function scrollPosIntoView(cm, pos, end2, margin) {
+            if (margin == null) {
+              margin = 0;
+            }
+            var rect2;
+            if (!cm.options.lineWrapping && pos == end2) {
+              end2 =
+                pos.sticky == "before"
+                  ? Pos(pos.line, pos.ch + 1, "before")
+                  : pos;
+              pos = pos.ch
+                ? Pos(
+                    pos.line,
+                    pos.sticky == "before" ? pos.ch - 1 : pos.ch,
+                    "after"
+                  )
+                : pos;
+            }
+            for (var limit = 0; limit < 5; limit++) {
+              var changed = false;
+              var coords = cursorCoords(cm, pos);
+              var endCoords =
+                !end2 || end2 == pos ? coords : cursorCoords(cm, end2);
+              rect2 = {
+                left: Math.min(coords.left, endCoords.left),
+                top: Math.min(coords.top, endCoords.top) - margin,
+                right: Math.max(coords.left, endCoords.left),
+                bottom: Math.max(coords.bottom, endCoords.bottom) + margin,
+              };
+              var scrollPos = calculateScrollPos(cm, rect2);
+              var startTop = cm.doc.scrollTop,
+                startLeft = cm.doc.scrollLeft;
+              if (scrollPos.scrollTop != null) {
+                updateScrollTop(cm, scrollPos.scrollTop);
+                if (Math.abs(cm.doc.scrollTop - startTop) > 1) {
+                  changed = true;
+                }
+              }
+              if (scrollPos.scrollLeft != null) {
+                setScrollLeft(cm, scrollPos.scrollLeft);
+                if (Math.abs(cm.doc.scrollLeft - startLeft) > 1) {
+                  changed = true;
+                }
+              }
+              if (!changed) {
+                break;
+              }
+            }
+            return rect2;
+          }
+          function scrollIntoView(cm, rect2) {
+            var scrollPos = calculateScrollPos(cm, rect2);
+            if (scrollPos.scrollTop != null) {
+              updateScrollTop(cm, scrollPos.scrollTop);
+            }
+            if (scrollPos.scrollLeft != null) {
+              setScrollLeft(cm, scrollPos.scrollLeft);
+            }
+          }
+          function calculateScrollPos(cm, rect2) {
+            var display = cm.display,
+              snapMargin = textHeight(cm.display);
+            if (rect2.top < 0) {
+              rect2.top = 0;
+            }
+            var screentop =
+              cm.curOp && cm.curOp.scrollTop != null
+                ? cm.curOp.scrollTop
+                : display.scroller.scrollTop;
+            var screen2 = displayHeight(cm),
+              result2 = {};
+            if (rect2.bottom - rect2.top > screen2) {
+              rect2.bottom = rect2.top + screen2;
+            }
+            var docBottom = cm.doc.height + paddingVert(display);
+            var atTop = rect2.top < snapMargin,
+              atBottom = rect2.bottom > docBottom - snapMargin;
+            if (rect2.top < screentop) {
+              result2.scrollTop = atTop ? 0 : rect2.top;
+            } else if (rect2.bottom > screentop + screen2) {
+              var newTop = Math.min(
+                rect2.top,
+                (atBottom ? docBottom : rect2.bottom) - screen2
+              );
+              if (newTop != screentop) {
+                result2.scrollTop = newTop;
+              }
+            }
+            var gutterSpace = cm.options.fixedGutter
+              ? 0
+              : display.gutters.offsetWidth;
+            var screenleft =
+              cm.curOp && cm.curOp.scrollLeft != null
+                ? cm.curOp.scrollLeft
+                : display.scroller.scrollLeft - gutterSpace;
+            var screenw = displayWidth(cm) - display.gutters.offsetWidth;
+            var tooWide = rect2.right - rect2.left > screenw;
+            if (tooWide) {
+              rect2.right = rect2.left + screenw;
+            }
+            if (rect2.left < 10) {
+              result2.scrollLeft = 0;
+            } else if (rect2.left < screenleft) {
+              result2.scrollLeft = Math.max(
+                0,
+                rect2.left + gutterSpace - (tooWide ? 0 : 10)
+              );
+            } else if (rect2.right > screenw + screenleft - 3) {
+              result2.scrollLeft = rect2.right + (tooWide ? 0 : 10) - screenw;
+            }
+            return result2;
+          }
+          function addToScrollTop(cm, top2) {
+            if (top2 == null) {
+              return;
+            }
+            resolveScrollToPos(cm);
+            cm.curOp.scrollTop =
+              (cm.curOp.scrollTop == null
+                ? cm.doc.scrollTop
+                : cm.curOp.scrollTop) + top2;
+          }
+          function ensureCursorVisible(cm) {
+            resolveScrollToPos(cm);
+            var cur = cm.getCursor();
+            cm.curOp.scrollToPos = {
+              from: cur,
+              to: cur,
+              margin: cm.options.cursorScrollMargin,
+            };
+          }
+          function scrollToCoords(cm, x2, y2) {
+            if (x2 != null || y2 != null) {
+              resolveScrollToPos(cm);
+            }
+            if (x2 != null) {
+              cm.curOp.scrollLeft = x2;
+            }
+            if (y2 != null) {
+              cm.curOp.scrollTop = y2;
+            }
+          }
+          function scrollToRange(cm, range3) {
+            resolveScrollToPos(cm);
+            cm.curOp.scrollToPos = range3;
+          }
+          function resolveScrollToPos(cm) {
+            var range3 = cm.curOp.scrollToPos;
+            if (range3) {
+              cm.curOp.scrollToPos = null;
+              var from = estimateCoords(cm, range3.from),
+                to = estimateCoords(cm, range3.to);
+              scrollToCoordsRange(cm, from, to, range3.margin);
+            }
+          }
+          function scrollToCoordsRange(cm, from, to, margin) {
+            var sPos = calculateScrollPos(cm, {
+              left: Math.min(from.left, to.left),
+              top: Math.min(from.top, to.top) - margin,
+              right: Math.max(from.right, to.right),
+              bottom: Math.max(from.bottom, to.bottom) + margin,
+            });
+            scrollToCoords(cm, sPos.scrollLeft, sPos.scrollTop);
+          }
+          function updateScrollTop(cm, val) {
+            if (Math.abs(cm.doc.scrollTop - val) < 2) {
+              return;
+            }
+            if (!gecko) {
+              updateDisplaySimple(cm, { top: val });
+            }
+            setScrollTop(cm, val, true);
+            if (gecko) {
+              updateDisplaySimple(cm);
+            }
+            startWorker(cm, 100);
+          }
+          function setScrollTop(cm, val, forceScroll) {
+            val = Math.max(
+              0,
+              Math.min(
+                cm.display.scroller.scrollHeight -
+                  cm.display.scroller.clientHeight,
+                val
+              )
+            );
+            if (cm.display.scroller.scrollTop == val && !forceScroll) {
+              return;
+            }
+            cm.doc.scrollTop = val;
+            cm.display.scrollbars.setScrollTop(val);
+            if (cm.display.scroller.scrollTop != val) {
+              cm.display.scroller.scrollTop = val;
+            }
+          }
+          function setScrollLeft(cm, val, isScroller, forceScroll) {
+            val = Math.max(
+              0,
+              Math.min(
+                val,
+                cm.display.scroller.scrollWidth -
+                  cm.display.scroller.clientWidth
+              )
+            );
+            if (
+              (isScroller
+                ? val == cm.doc.scrollLeft
+                : Math.abs(cm.doc.scrollLeft - val) < 2) &&
+              !forceScroll
+            ) {
+              return;
+            }
+            cm.doc.scrollLeft = val;
+            alignHorizontally(cm);
+            if (cm.display.scroller.scrollLeft != val) {
+              cm.display.scroller.scrollLeft = val;
+            }
+            cm.display.scrollbars.setScrollLeft(val);
+          }
+          function measureForScrollbars(cm) {
+            var d = cm.display,
+              gutterW = d.gutters.offsetWidth;
+            var docH = Math.round(cm.doc.height + paddingVert(cm.display));
+            return {
+              clientHeight: d.scroller.clientHeight,
+              viewHeight: d.wrapper.clientHeight,
+              scrollWidth: d.scroller.scrollWidth,
+              clientWidth: d.scroller.clientWidth,
+              viewWidth: d.wrapper.clientWidth,
+              barLeft: cm.options.fixedGutter ? gutterW : 0,
+              docHeight: docH,
+              scrollHeight: docH + scrollGap(cm) + d.barHeight,
+              nativeBarWidth: d.nativeBarWidth,
+              gutterWidth: gutterW,
+            };
+          }
+          var NativeScrollbars = function (place, scroll, cm) {
+            this.cm = cm;
+            var vert2 = (this.vert = elt(
+              "div",
+              [elt("div", null, null, "min-width: 1px")],
+              "CodeMirror-vscrollbar"
+            ));
+            var horiz = (this.horiz = elt(
+              "div",
+              [elt("div", null, null, "height: 100%; min-height: 1px")],
+              "CodeMirror-hscrollbar"
+            ));
+            vert2.tabIndex = horiz.tabIndex = -1;
+            place(vert2);
+            place(horiz);
+            on(vert2, "scroll", function () {
+              if (vert2.clientHeight) {
+                scroll(vert2.scrollTop, "vertical");
+              }
+            });
+            on(horiz, "scroll", function () {
+              if (horiz.clientWidth) {
+                scroll(horiz.scrollLeft, "horizontal");
+              }
+            });
+            this.checkedZeroWidth = false;
+            if (ie2 && ie_version < 8) {
+              this.horiz.style.minHeight = this.vert.style.minWidth = "18px";
+            }
+          };
+          NativeScrollbars.prototype.update = function (measure) {
+            var needsH = measure.scrollWidth > measure.clientWidth + 1;
+            var needsV = measure.scrollHeight > measure.clientHeight + 1;
+            var sWidth = measure.nativeBarWidth;
+            if (needsV) {
+              this.vert.style.display = "block";
+              this.vert.style.bottom = needsH ? sWidth + "px" : "0";
+              var totalHeight = measure.viewHeight - (needsH ? sWidth : 0);
+              this.vert.firstChild.style.height =
+                Math.max(
+                  0,
+                  measure.scrollHeight - measure.clientHeight + totalHeight
+                ) + "px";
+            } else {
+              this.vert.scrollTop = 0;
+              this.vert.style.display = "";
+              this.vert.firstChild.style.height = "0";
+            }
+            if (needsH) {
+              this.horiz.style.display = "block";
+              this.horiz.style.right = needsV ? sWidth + "px" : "0";
+              this.horiz.style.left = measure.barLeft + "px";
+              var totalWidth =
+                measure.viewWidth - measure.barLeft - (needsV ? sWidth : 0);
+              this.horiz.firstChild.style.width =
+                Math.max(
+                  0,
+                  measure.scrollWidth - measure.clientWidth + totalWidth
+                ) + "px";
+            } else {
+              this.horiz.style.display = "";
+              this.horiz.firstChild.style.width = "0";
+            }
+            if (!this.checkedZeroWidth && measure.clientHeight > 0) {
+              if (sWidth == 0) {
+                this.zeroWidthHack();
+              }
+              this.checkedZeroWidth = true;
+            }
+            return { right: needsV ? sWidth : 0, bottom: needsH ? sWidth : 0 };
+          };
+          NativeScrollbars.prototype.setScrollLeft = function (pos) {
+            if (this.horiz.scrollLeft != pos) {
+              this.horiz.scrollLeft = pos;
+            }
+            if (this.disableHoriz) {
+              this.enableZeroWidthBar(this.horiz, this.disableHoriz, "horiz");
+            }
+          };
+          NativeScrollbars.prototype.setScrollTop = function (pos) {
+            if (this.vert.scrollTop != pos) {
+              this.vert.scrollTop = pos;
+            }
+            if (this.disableVert) {
+              this.enableZeroWidthBar(this.vert, this.disableVert, "vert");
+            }
+          };
+          NativeScrollbars.prototype.zeroWidthHack = function () {
+            var w2 = mac && !mac_geMountainLion ? "12px" : "18px";
+            this.horiz.style.height = this.vert.style.width = w2;
+            this.horiz.style.pointerEvents = this.vert.style.pointerEvents =
+              "none";
+            this.disableHoriz = new Delayed();
+            this.disableVert = new Delayed();
+          };
+          NativeScrollbars.prototype.enableZeroWidthBar = function (
+            bar,
+            delay,
+            type2
+          ) {
+            bar.style.pointerEvents = "auto";
+            function maybeDisable() {
+              var box = bar.getBoundingClientRect();
+              var elt2 =
+                type2 == "vert"
+                  ? document.elementFromPoint(
+                      box.right - 1,
+                      (box.top + box.bottom) / 2
+                    )
+                  : document.elementFromPoint(
+                      (box.right + box.left) / 2,
+                      box.bottom - 1
+                    );
+              if (elt2 != bar) {
+                bar.style.pointerEvents = "none";
+              } else {
+                delay.set(1e3, maybeDisable);
+              }
+            }
+            delay.set(1e3, maybeDisable);
+          };
+          NativeScrollbars.prototype.clear = function () {
+            var parent = this.horiz.parentNode;
+            parent.removeChild(this.horiz);
+            parent.removeChild(this.vert);
+          };
+          var NullScrollbars = function () {};
+          NullScrollbars.prototype.update = function () {
+            return { bottom: 0, right: 0 };
+          };
+          NullScrollbars.prototype.setScrollLeft = function () {};
+          NullScrollbars.prototype.setScrollTop = function () {};
+          NullScrollbars.prototype.clear = function () {};
+          function updateScrollbars(cm, measure) {
+            if (!measure) {
+              measure = measureForScrollbars(cm);
+            }
+            var startWidth = cm.display.barWidth,
+              startHeight = cm.display.barHeight;
+            updateScrollbarsInner(cm, measure);
+            for (
+              var i2 = 0;
+              (i2 < 4 && startWidth != cm.display.barWidth) ||
+              startHeight != cm.display.barHeight;
+              i2++
+            ) {
+              if (
+                startWidth != cm.display.barWidth &&
+                cm.options.lineWrapping
+              ) {
+                updateHeightsInViewport(cm);
+              }
+              updateScrollbarsInner(cm, measureForScrollbars(cm));
+              startWidth = cm.display.barWidth;
+              startHeight = cm.display.barHeight;
+            }
+          }
+          function updateScrollbarsInner(cm, measure) {
+            var d = cm.display;
+            var sizes = d.scrollbars.update(measure);
+            d.sizer.style.paddingRight = (d.barWidth = sizes.right) + "px";
+            d.sizer.style.paddingBottom = (d.barHeight = sizes.bottom) + "px";
+            d.heightForcer.style.borderBottom =
+              sizes.bottom + "px solid transparent";
+            if (sizes.right && sizes.bottom) {
+              d.scrollbarFiller.style.display = "block";
+              d.scrollbarFiller.style.height = sizes.bottom + "px";
+              d.scrollbarFiller.style.width = sizes.right + "px";
+            } else {
+              d.scrollbarFiller.style.display = "";
+            }
+            if (
+              sizes.bottom &&
+              cm.options.coverGutterNextToScrollbar &&
+              cm.options.fixedGutter
+            ) {
+              d.gutterFiller.style.display = "block";
+              d.gutterFiller.style.height = sizes.bottom + "px";
+              d.gutterFiller.style.width = measure.gutterWidth + "px";
+            } else {
+              d.gutterFiller.style.display = "";
+            }
+          }
+          var scrollbarModel = {
+            native: NativeScrollbars,
+            null: NullScrollbars,
+          };
+          function initScrollbars(cm) {
+            if (cm.display.scrollbars) {
+              cm.display.scrollbars.clear();
+              if (cm.display.scrollbars.addClass) {
+                rmClass(cm.display.wrapper, cm.display.scrollbars.addClass);
+              }
+            }
+            cm.display.scrollbars = new scrollbarModel[
+              cm.options.scrollbarStyle
+            ](
+              function (node) {
+                cm.display.wrapper.insertBefore(
+                  node,
+                  cm.display.scrollbarFiller
+                );
+                on(node, "mousedown", function () {
+                  if (cm.state.focused) {
+                    setTimeout(function () {
+                      return cm.display.input.focus();
+                    }, 0);
+                  }
+                });
+                node.setAttribute("cm-not-content", "true");
+              },
+              function (pos, axis) {
+                if (axis == "horizontal") {
+                  setScrollLeft(cm, pos);
+                } else {
+                  updateScrollTop(cm, pos);
+                }
+              },
+              cm
+            );
+            if (cm.display.scrollbars.addClass) {
+              addClass(cm.display.wrapper, cm.display.scrollbars.addClass);
+            }
+          }
+          var nextOpId = 0;
+          function startOperation(cm) {
+            cm.curOp = {
+              cm,
+              viewChanged: false,
+              startHeight: cm.doc.height,
+              forceUpdate: false,
+              updateInput: 0,
+              typing: false,
+              changeObjs: null,
+              cursorActivityHandlers: null,
+              cursorActivityCalled: 0,
+              selectionChanged: false,
+              updateMaxLine: false,
+              scrollLeft: null,
+              scrollTop: null,
+              scrollToPos: null,
+              focus: false,
+              id: ++nextOpId,
+              markArrays: null,
+            };
+            pushOperation(cm.curOp);
+          }
+          function endOperation(cm) {
+            var op = cm.curOp;
+            if (op) {
+              finishOperation(op, function (group) {
+                for (var i2 = 0; i2 < group.ops.length; i2++) {
+                  group.ops[i2].cm.curOp = null;
+                }
+                endOperations(group);
+              });
+            }
+          }
+          function endOperations(group) {
+            var ops = group.ops;
+            for (var i2 = 0; i2 < ops.length; i2++) {
+              endOperation_R1(ops[i2]);
+            }
+            for (var i$12 = 0; i$12 < ops.length; i$12++) {
+              endOperation_W1(ops[i$12]);
+            }
+            for (var i$22 = 0; i$22 < ops.length; i$22++) {
+              endOperation_R2(ops[i$22]);
+            }
+            for (var i$3 = 0; i$3 < ops.length; i$3++) {
+              endOperation_W2(ops[i$3]);
+            }
+            for (var i$4 = 0; i$4 < ops.length; i$4++) {
+              endOperation_finish(ops[i$4]);
+            }
+          }
+          function endOperation_R1(op) {
+            var cm = op.cm,
+              display = cm.display;
+            maybeClipScrollbars(cm);
+            if (op.updateMaxLine) {
+              findMaxLine(cm);
+            }
+            op.mustUpdate =
+              op.viewChanged ||
+              op.forceUpdate ||
+              op.scrollTop != null ||
+              (op.scrollToPos &&
+                (op.scrollToPos.from.line < display.viewFrom ||
+                  op.scrollToPos.to.line >= display.viewTo)) ||
+              (display.maxLineChanged && cm.options.lineWrapping);
+            op.update =
+              op.mustUpdate &&
+              new DisplayUpdate(
+                cm,
+                op.mustUpdate && { top: op.scrollTop, ensure: op.scrollToPos },
+                op.forceUpdate
+              );
+          }
+          function endOperation_W1(op) {
+            op.updatedDisplay =
+              op.mustUpdate && updateDisplayIfNeeded(op.cm, op.update);
+          }
+          function endOperation_R2(op) {
+            var cm = op.cm,
+              display = cm.display;
+            if (op.updatedDisplay) {
+              updateHeightsInViewport(cm);
+            }
+            op.barMeasure = measureForScrollbars(cm);
+            if (display.maxLineChanged && !cm.options.lineWrapping) {
+              op.adjustWidthTo =
+                measureChar(cm, display.maxLine, display.maxLine.text.length)
+                  .left + 3;
+              cm.display.sizerWidth = op.adjustWidthTo;
+              op.barMeasure.scrollWidth = Math.max(
+                display.scroller.clientWidth,
+                display.sizer.offsetLeft +
+                  op.adjustWidthTo +
+                  scrollGap(cm) +
+                  cm.display.barWidth
+              );
+              op.maxScrollLeft = Math.max(
+                0,
+                display.sizer.offsetLeft + op.adjustWidthTo - displayWidth(cm)
+              );
+            }
+            if (op.updatedDisplay || op.selectionChanged) {
+              op.preparedSelection = display.input.prepareSelection();
+            }
+          }
+          function endOperation_W2(op) {
+            var cm = op.cm;
+            if (op.adjustWidthTo != null) {
+              cm.display.sizer.style.minWidth = op.adjustWidthTo + "px";
+              if (op.maxScrollLeft < cm.doc.scrollLeft) {
+                setScrollLeft(
+                  cm,
+                  Math.min(cm.display.scroller.scrollLeft, op.maxScrollLeft),
+                  true
+                );
+              }
+              cm.display.maxLineChanged = false;
+            }
+            var takeFocus = op.focus && op.focus == activeElt();
+            if (op.preparedSelection) {
+              cm.display.input.showSelection(op.preparedSelection, takeFocus);
+            }
+            if (op.updatedDisplay || op.startHeight != cm.doc.height) {
+              updateScrollbars(cm, op.barMeasure);
+            }
+            if (op.updatedDisplay) {
+              setDocumentHeight(cm, op.barMeasure);
+            }
+            if (op.selectionChanged) {
+              restartBlink(cm);
+            }
+            if (cm.state.focused && op.updateInput) {
+              cm.display.input.reset(op.typing);
+            }
+            if (takeFocus) {
+              ensureFocus(op.cm);
+            }
+          }
+          function endOperation_finish(op) {
+            var cm = op.cm,
+              display = cm.display,
+              doc = cm.doc;
+            if (op.updatedDisplay) {
+              postUpdateDisplay(cm, op.update);
+            }
+            if (
+              display.wheelStartX != null &&
+              (op.scrollTop != null || op.scrollLeft != null || op.scrollToPos)
+            ) {
+              display.wheelStartX = display.wheelStartY = null;
+            }
+            if (op.scrollTop != null) {
+              setScrollTop(cm, op.scrollTop, op.forceScroll);
+            }
+            if (op.scrollLeft != null) {
+              setScrollLeft(cm, op.scrollLeft, true, true);
+            }
+            if (op.scrollToPos) {
+              var rect2 = scrollPosIntoView(
+                cm,
+                clipPos(doc, op.scrollToPos.from),
+                clipPos(doc, op.scrollToPos.to),
+                op.scrollToPos.margin
+              );
+              maybeScrollWindow(cm, rect2);
+            }
+            var hidden = op.maybeHiddenMarkers,
+              unhidden = op.maybeUnhiddenMarkers;
+            if (hidden) {
+              for (var i2 = 0; i2 < hidden.length; ++i2) {
+                if (!hidden[i2].lines.length) {
+                  signal(hidden[i2], "hide");
+                }
+              }
+            }
+            if (unhidden) {
+              for (var i$12 = 0; i$12 < unhidden.length; ++i$12) {
+                if (unhidden[i$12].lines.length) {
+                  signal(unhidden[i$12], "unhide");
+                }
+              }
+            }
+            if (display.wrapper.offsetHeight) {
+              doc.scrollTop = cm.display.scroller.scrollTop;
+            }
+            if (op.changeObjs) {
+              signal(cm, "changes", cm, op.changeObjs);
+            }
+            if (op.update) {
+              op.update.finish();
+            }
+          }
+          function runInOp(cm, f) {
+            if (cm.curOp) {
+              return f();
+            }
+            startOperation(cm);
+            try {
+              return f();
+            } finally {
+              endOperation(cm);
+            }
+          }
+          function operation(cm, f) {
+            return function () {
+              if (cm.curOp) {
+                return f.apply(cm, arguments);
+              }
+              startOperation(cm);
+              try {
+                return f.apply(cm, arguments);
+              } finally {
+                endOperation(cm);
+              }
+            };
+          }
+          function methodOp(f) {
+            return function () {
+              if (this.curOp) {
+                return f.apply(this, arguments);
+              }
+              startOperation(this);
+              try {
+                return f.apply(this, arguments);
+              } finally {
+                endOperation(this);
+              }
+            };
+          }
+          function docMethodOp(f) {
+            return function () {
+              var cm = this.cm;
+              if (!cm || cm.curOp) {
+                return f.apply(this, arguments);
+              }
+              startOperation(cm);
+              try {
+                return f.apply(this, arguments);
+              } finally {
+                endOperation(cm);
+              }
+            };
+          }
+          function startWorker(cm, time) {
+            if (cm.doc.highlightFrontier < cm.display.viewTo) {
+              cm.state.highlight.set(time, bind(highlightWorker, cm));
+            }
+          }
+          function highlightWorker(cm) {
+            var doc = cm.doc;
+            if (doc.highlightFrontier >= cm.display.viewTo) {
+              return;
+            }
+            var end2 = +new Date() + cm.options.workTime;
+            var context = getContextBefore(cm, doc.highlightFrontier);
+            var changedLines = [];
+            doc.iter(
+              context.line,
+              Math.min(doc.first + doc.size, cm.display.viewTo + 500),
+              function (line) {
+                if (context.line >= cm.display.viewFrom) {
+                  var oldStyles = line.styles;
+                  var resetState =
+                    line.text.length > cm.options.maxHighlightLength
+                      ? copyState(doc.mode, context.state)
+                      : null;
+                  var highlighted = highlightLine(cm, line, context, true);
+                  if (resetState) {
+                    context.state = resetState;
+                  }
+                  line.styles = highlighted.styles;
+                  var oldCls = line.styleClasses,
+                    newCls = highlighted.classes;
+                  if (newCls) {
+                    line.styleClasses = newCls;
+                  } else if (oldCls) {
+                    line.styleClasses = null;
+                  }
+                  var ischange =
+                    !oldStyles ||
+                    oldStyles.length != line.styles.length ||
+                    (oldCls != newCls &&
+                      (!oldCls ||
+                        !newCls ||
+                        oldCls.bgClass != newCls.bgClass ||
+                        oldCls.textClass != newCls.textClass));
+                  for (var i2 = 0; !ischange && i2 < oldStyles.length; ++i2) {
+                    ischange = oldStyles[i2] != line.styles[i2];
+                  }
+                  if (ischange) {
+                    changedLines.push(context.line);
+                  }
+                  line.stateAfter = context.save();
+                  context.nextLine();
+                } else {
+                  if (line.text.length <= cm.options.maxHighlightLength) {
+                    processLine(cm, line.text, context);
+                  }
+                  line.stateAfter =
+                    context.line % 5 == 0 ? context.save() : null;
+                  context.nextLine();
+                }
+                if (+new Date() > end2) {
+                  startWorker(cm, cm.options.workDelay);
+                  return true;
+                }
+              }
+            );
+            doc.highlightFrontier = context.line;
+            doc.modeFrontier = Math.max(doc.modeFrontier, context.line);
+            if (changedLines.length) {
+              runInOp(cm, function () {
+                for (var i2 = 0; i2 < changedLines.length; i2++) {
+                  regLineChange(cm, changedLines[i2], "text");
+                }
+              });
+            }
+          }
+          var DisplayUpdate = function (cm, viewport, force) {
+            var display = cm.display;
+            this.viewport = viewport;
+            this.visible = visibleLines(display, cm.doc, viewport);
+            this.editorIsHidden = !display.wrapper.offsetWidth;
+            this.wrapperHeight = display.wrapper.clientHeight;
+            this.wrapperWidth = display.wrapper.clientWidth;
+            this.oldDisplayWidth = displayWidth(cm);
+            this.force = force;
+            this.dims = getDimensions(cm);
+            this.events = [];
+          };
+          DisplayUpdate.prototype.signal = function (emitter, type2) {
+            if (hasHandler(emitter, type2)) {
+              this.events.push(arguments);
+            }
+          };
+          DisplayUpdate.prototype.finish = function () {
+            for (var i2 = 0; i2 < this.events.length; i2++) {
+              signal.apply(null, this.events[i2]);
+            }
+          };
+          function maybeClipScrollbars(cm) {
+            var display = cm.display;
+            if (!display.scrollbarsClipped && display.scroller.offsetWidth) {
+              display.nativeBarWidth =
+                display.scroller.offsetWidth - display.scroller.clientWidth;
+              display.heightForcer.style.height = scrollGap(cm) + "px";
+              display.sizer.style.marginBottom = -display.nativeBarWidth + "px";
+              display.sizer.style.borderRightWidth = scrollGap(cm) + "px";
+              display.scrollbarsClipped = true;
+            }
+          }
+          function selectionSnapshot(cm) {
+            if (cm.hasFocus()) {
+              return null;
+            }
+            var active = activeElt();
+            if (!active || !contains(cm.display.lineDiv, active)) {
+              return null;
+            }
+            var result2 = { activeElt: active };
+            if (window.getSelection) {
+              var sel = window.getSelection();
+              if (
+                sel.anchorNode &&
+                sel.extend &&
+                contains(cm.display.lineDiv, sel.anchorNode)
+              ) {
+                result2.anchorNode = sel.anchorNode;
+                result2.anchorOffset = sel.anchorOffset;
+                result2.focusNode = sel.focusNode;
+                result2.focusOffset = sel.focusOffset;
+              }
+            }
+            return result2;
+          }
+          function restoreSelection(snapshot) {
+            if (
+              !snapshot ||
+              !snapshot.activeElt ||
+              snapshot.activeElt == activeElt()
+            ) {
+              return;
+            }
+            snapshot.activeElt.focus();
+            if (
+              !/^(INPUT|TEXTAREA)$/.test(snapshot.activeElt.nodeName) &&
+              snapshot.anchorNode &&
+              contains(document.body, snapshot.anchorNode) &&
+              contains(document.body, snapshot.focusNode)
+            ) {
+              var sel = window.getSelection(),
+                range3 = document.createRange();
+              range3.setEnd(snapshot.anchorNode, snapshot.anchorOffset);
+              range3.collapse(false);
+              sel.removeAllRanges();
+              sel.addRange(range3);
+              sel.extend(snapshot.focusNode, snapshot.focusOffset);
+            }
+          }
+          function updateDisplayIfNeeded(cm, update) {
+            var display = cm.display,
+              doc = cm.doc;
+            if (update.editorIsHidden) {
+              resetView(cm);
+              return false;
+            }
+            if (
+              !update.force &&
+              update.visible.from >= display.viewFrom &&
+              update.visible.to <= display.viewTo &&
+              (display.updateLineNumbers == null ||
+                display.updateLineNumbers >= display.viewTo) &&
+              display.renderedView == display.view &&
+              countDirtyView(cm) == 0
+            ) {
+              return false;
+            }
+            if (maybeUpdateLineNumberWidth(cm)) {
+              resetView(cm);
+              update.dims = getDimensions(cm);
+            }
+            var end2 = doc.first + doc.size;
+            var from = Math.max(
+              update.visible.from - cm.options.viewportMargin,
+              doc.first
+            );
+            var to = Math.min(
+              end2,
+              update.visible.to + cm.options.viewportMargin
+            );
+            if (display.viewFrom < from && from - display.viewFrom < 20) {
+              from = Math.max(doc.first, display.viewFrom);
+            }
+            if (display.viewTo > to && display.viewTo - to < 20) {
+              to = Math.min(end2, display.viewTo);
+            }
+            if (sawCollapsedSpans) {
+              from = visualLineNo(cm.doc, from);
+              to = visualLineEndNo(cm.doc, to);
+            }
+            var different =
+              from != display.viewFrom ||
+              to != display.viewTo ||
+              display.lastWrapHeight != update.wrapperHeight ||
+              display.lastWrapWidth != update.wrapperWidth;
+            adjustView(cm, from, to);
+            display.viewOffset = heightAtLine(
+              getLine2(cm.doc, display.viewFrom)
+            );
+            cm.display.mover.style.top = display.viewOffset + "px";
+            var toUpdate = countDirtyView(cm);
+            if (
+              !different &&
+              toUpdate == 0 &&
+              !update.force &&
+              display.renderedView == display.view &&
+              (display.updateLineNumbers == null ||
+                display.updateLineNumbers >= display.viewTo)
+            ) {
+              return false;
+            }
+            var selSnapshot = selectionSnapshot(cm);
+            if (toUpdate > 4) {
+              display.lineDiv.style.display = "none";
+            }
+            patchDisplay(cm, display.updateLineNumbers, update.dims);
+            if (toUpdate > 4) {
+              display.lineDiv.style.display = "";
+            }
+            display.renderedView = display.view;
+            restoreSelection(selSnapshot);
+            removeChildren(display.cursorDiv);
+            removeChildren(display.selectionDiv);
+            display.gutters.style.height = display.sizer.style.minHeight = 0;
+            if (different) {
+              display.lastWrapHeight = update.wrapperHeight;
+              display.lastWrapWidth = update.wrapperWidth;
+              startWorker(cm, 400);
+            }
+            display.updateLineNumbers = null;
+            return true;
+          }
+          function postUpdateDisplay(cm, update) {
+            var viewport = update.viewport;
+            for (var first = true; ; first = false) {
+              if (
+                !first ||
+                !cm.options.lineWrapping ||
+                update.oldDisplayWidth == displayWidth(cm)
+              ) {
+                if (viewport && viewport.top != null) {
+                  viewport = {
+                    top: Math.min(
+                      cm.doc.height +
+                        paddingVert(cm.display) -
+                        displayHeight(cm),
+                      viewport.top
+                    ),
+                  };
+                }
+                update.visible = visibleLines(cm.display, cm.doc, viewport);
+                if (
+                  update.visible.from >= cm.display.viewFrom &&
+                  update.visible.to <= cm.display.viewTo
+                ) {
+                  break;
+                }
+              } else if (first) {
+                update.visible = visibleLines(cm.display, cm.doc, viewport);
+              }
+              if (!updateDisplayIfNeeded(cm, update)) {
+                break;
+              }
+              updateHeightsInViewport(cm);
+              var barMeasure = measureForScrollbars(cm);
+              updateSelection(cm);
+              updateScrollbars(cm, barMeasure);
+              setDocumentHeight(cm, barMeasure);
+              update.force = false;
+            }
+            update.signal(cm, "update", cm);
+            if (
+              cm.display.viewFrom != cm.display.reportedViewFrom ||
+              cm.display.viewTo != cm.display.reportedViewTo
+            ) {
+              update.signal(
+                cm,
+                "viewportChange",
+                cm,
+                cm.display.viewFrom,
+                cm.display.viewTo
+              );
+              cm.display.reportedViewFrom = cm.display.viewFrom;
+              cm.display.reportedViewTo = cm.display.viewTo;
+            }
+          }
+          function updateDisplaySimple(cm, viewport) {
+            var update = new DisplayUpdate(cm, viewport);
+            if (updateDisplayIfNeeded(cm, update)) {
+              updateHeightsInViewport(cm);
+              postUpdateDisplay(cm, update);
+              var barMeasure = measureForScrollbars(cm);
+              updateSelection(cm);
+              updateScrollbars(cm, barMeasure);
+              setDocumentHeight(cm, barMeasure);
+              update.finish();
+            }
+          }
+          function patchDisplay(cm, updateNumbersFrom, dims) {
+            var display = cm.display,
+              lineNumbers = cm.options.lineNumbers;
+            var container = display.lineDiv,
+              cur = container.firstChild;
+            function rm(node2) {
+              var next = node2.nextSibling;
+              if (webkit && mac && cm.display.currentWheelTarget == node2) {
+                node2.style.display = "none";
+              } else {
+                node2.parentNode.removeChild(node2);
+              }
+              return next;
+            }
+            var view = display.view,
+              lineN = display.viewFrom;
+            for (var i2 = 0; i2 < view.length; i2++) {
+              var lineView = view[i2];
+              if (lineView.hidden);
+              else if (
+                !lineView.node ||
+                lineView.node.parentNode != container
+              ) {
+                var node = buildLineElement(cm, lineView, lineN, dims);
+                container.insertBefore(node, cur);
+              } else {
+                while (cur != lineView.node) {
+                  cur = rm(cur);
+                }
+                var updateNumber =
+                  lineNumbers &&
+                  updateNumbersFrom != null &&
+                  updateNumbersFrom <= lineN &&
+                  lineView.lineNumber;
+                if (lineView.changes) {
+                  if (indexOf(lineView.changes, "gutter") > -1) {
+                    updateNumber = false;
+                  }
+                  updateLineForChanges(cm, lineView, lineN, dims);
+                }
+                if (updateNumber) {
+                  removeChildren(lineView.lineNumber);
+                  lineView.lineNumber.appendChild(
+                    document.createTextNode(lineNumberFor(cm.options, lineN))
+                  );
+                }
+                cur = lineView.node.nextSibling;
+              }
+              lineN += lineView.size;
+            }
+            while (cur) {
+              cur = rm(cur);
+            }
+          }
+          function updateGutterSpace(display) {
+            var width = display.gutters.offsetWidth;
+            display.sizer.style.marginLeft = width + "px";
+            signalLater(display, "gutterChanged", display);
+          }
+          function setDocumentHeight(cm, measure) {
+            cm.display.sizer.style.minHeight = measure.docHeight + "px";
+            cm.display.heightForcer.style.top = measure.docHeight + "px";
+            cm.display.gutters.style.height =
+              measure.docHeight + cm.display.barHeight + scrollGap(cm) + "px";
+          }
+          function alignHorizontally(cm) {
+            var display = cm.display,
+              view = display.view;
+            if (
+              !display.alignWidgets &&
+              (!display.gutters.firstChild || !cm.options.fixedGutter)
+            ) {
+              return;
+            }
+            var comp2 =
+              compensateForHScroll(display) -
+              display.scroller.scrollLeft +
+              cm.doc.scrollLeft;
+            var gutterW = display.gutters.offsetWidth,
+              left = comp2 + "px";
+            for (var i2 = 0; i2 < view.length; i2++) {
+              if (!view[i2].hidden) {
+                if (cm.options.fixedGutter) {
+                  if (view[i2].gutter) {
+                    view[i2].gutter.style.left = left;
+                  }
+                  if (view[i2].gutterBackground) {
+                    view[i2].gutterBackground.style.left = left;
+                  }
+                }
+                var align = view[i2].alignable;
+                if (align) {
+                  for (var j = 0; j < align.length; j++) {
+                    align[j].style.left = left;
+                  }
+                }
+              }
+            }
+            if (cm.options.fixedGutter) {
+              display.gutters.style.left = comp2 + gutterW + "px";
+            }
+          }
+          function maybeUpdateLineNumberWidth(cm) {
+            if (!cm.options.lineNumbers) {
+              return false;
+            }
+            var doc = cm.doc,
+              last = lineNumberFor(cm.options, doc.first + doc.size - 1),
+              display = cm.display;
+            if (last.length != display.lineNumChars) {
+              var test2 = display.measure.appendChild(
+                elt(
+                  "div",
+                  [elt("div", last)],
+                  "CodeMirror-linenumber CodeMirror-gutter-elt"
+                )
+              );
+              var innerW = test2.firstChild.offsetWidth,
+                padding = test2.offsetWidth - innerW;
+              display.lineGutter.style.width = "";
+              display.lineNumInnerWidth =
+                Math.max(innerW, display.lineGutter.offsetWidth - padding) + 1;
+              display.lineNumWidth = display.lineNumInnerWidth + padding;
+              display.lineNumChars = display.lineNumInnerWidth
+                ? last.length
+                : -1;
+              display.lineGutter.style.width = display.lineNumWidth + "px";
+              updateGutterSpace(cm.display);
+              return true;
+            }
+            return false;
+          }
+          function getGutters(gutters, lineNumbers) {
+            var result2 = [],
+              sawLineNumbers = false;
+            for (var i2 = 0; i2 < gutters.length; i2++) {
+              var name2 = gutters[i2],
+                style = null;
+              if (typeof name2 != "string") {
+                style = name2.style;
+                name2 = name2.className;
+              }
+              if (name2 == "CodeMirror-linenumbers") {
+                if (!lineNumbers) {
+                  continue;
+                } else {
+                  sawLineNumbers = true;
+                }
+              }
+              result2.push({ className: name2, style });
+            }
+            if (lineNumbers && !sawLineNumbers) {
+              result2.push({
+                className: "CodeMirror-linenumbers",
+                style: null,
+              });
+            }
+            return result2;
+          }
+          function renderGutters(display) {
+            var gutters = display.gutters,
+              specs = display.gutterSpecs;
+            removeChildren(gutters);
+            display.lineGutter = null;
+            for (var i2 = 0; i2 < specs.length; ++i2) {
+              var ref = specs[i2];
+              var className = ref.className;
+              var style = ref.style;
+              var gElt = gutters.appendChild(
+                elt("div", null, "CodeMirror-gutter " + className)
+              );
+              if (style) {
+                gElt.style.cssText = style;
+              }
+              if (className == "CodeMirror-linenumbers") {
+                display.lineGutter = gElt;
+                gElt.style.width = (display.lineNumWidth || 1) + "px";
+              }
+            }
+            gutters.style.display = specs.length ? "" : "none";
+            updateGutterSpace(display);
+          }
+          function updateGutters(cm) {
+            renderGutters(cm.display);
+            regChange(cm);
+            alignHorizontally(cm);
+          }
+          function Display(place, doc, input, options) {
+            var d = this;
+            this.input = input;
+            d.scrollbarFiller = elt("div", null, "CodeMirror-scrollbar-filler");
+            d.scrollbarFiller.setAttribute("cm-not-content", "true");
+            d.gutterFiller = elt("div", null, "CodeMirror-gutter-filler");
+            d.gutterFiller.setAttribute("cm-not-content", "true");
+            d.lineDiv = eltP("div", null, "CodeMirror-code");
+            d.selectionDiv = elt(
+              "div",
+              null,
+              null,
+              "position: relative; z-index: 1"
+            );
+            d.cursorDiv = elt("div", null, "CodeMirror-cursors");
+            d.measure = elt("div", null, "CodeMirror-measure");
+            d.lineMeasure = elt("div", null, "CodeMirror-measure");
+            d.lineSpace = eltP(
+              "div",
+              [
+                d.measure,
+                d.lineMeasure,
+                d.selectionDiv,
+                d.cursorDiv,
+                d.lineDiv,
+              ],
+              null,
+              "position: relative; outline: none"
+            );
+            var lines = eltP("div", [d.lineSpace], "CodeMirror-lines");
+            d.mover = elt("div", [lines], null, "position: relative");
+            d.sizer = elt("div", [d.mover], "CodeMirror-sizer");
+            d.sizerWidth = null;
+            d.heightForcer = elt(
+              "div",
+              null,
+              null,
+              "position: absolute; height: " + scrollerGap + "px; width: 1px;"
+            );
+            d.gutters = elt("div", null, "CodeMirror-gutters");
+            d.lineGutter = null;
+            d.scroller = elt(
+              "div",
+              [d.sizer, d.heightForcer, d.gutters],
+              "CodeMirror-scroll"
+            );
+            d.scroller.setAttribute("tabIndex", "-1");
+            d.wrapper = elt(
+              "div",
+              [d.scrollbarFiller, d.gutterFiller, d.scroller],
+              "CodeMirror"
+            );
+            d.wrapper.setAttribute("translate", "no");
+            if (ie2 && ie_version < 8) {
+              d.gutters.style.zIndex = -1;
+              d.scroller.style.paddingRight = 0;
+            }
+            if (!webkit && !(gecko && mobile)) {
+              d.scroller.draggable = true;
+            }
+            if (place) {
+              if (place.appendChild) {
+                place.appendChild(d.wrapper);
+              } else {
+                place(d.wrapper);
+              }
+            }
+            d.viewFrom = d.viewTo = doc.first;
+            d.reportedViewFrom = d.reportedViewTo = doc.first;
+            d.view = [];
+            d.renderedView = null;
+            d.externalMeasured = null;
+            d.viewOffset = 0;
+            d.lastWrapHeight = d.lastWrapWidth = 0;
+            d.updateLineNumbers = null;
+            d.nativeBarWidth = d.barHeight = d.barWidth = 0;
+            d.scrollbarsClipped = false;
+            d.lineNumWidth = d.lineNumInnerWidth = d.lineNumChars = null;
+            d.alignWidgets = false;
+            d.cachedCharWidth = d.cachedTextHeight = d.cachedPaddingH = null;
+            d.maxLine = null;
+            d.maxLineLength = 0;
+            d.maxLineChanged = false;
+            d.wheelDX = d.wheelDY = d.wheelStartX = d.wheelStartY = null;
+            d.shift = false;
+            d.selForContextMenu = null;
+            d.activeTouch = null;
+            d.gutterSpecs = getGutters(options.gutters, options.lineNumbers);
+            renderGutters(d);
+            input.init(d);
+          }
+          var wheelSamples = 0,
+            wheelPixelsPerUnit = null;
+          if (ie2) {
+            wheelPixelsPerUnit = -0.53;
+          } else if (gecko) {
+            wheelPixelsPerUnit = 15;
+          } else if (chrome) {
+            wheelPixelsPerUnit = -0.7;
+          } else if (safari) {
+            wheelPixelsPerUnit = -1 / 3;
+          }
+          function wheelEventDelta(e) {
+            var dx = e.wheelDeltaX,
+              dy = e.wheelDeltaY;
+            if (dx == null && e.detail && e.axis == e.HORIZONTAL_AXIS) {
+              dx = e.detail;
+            }
+            if (dy == null && e.detail && e.axis == e.VERTICAL_AXIS) {
+              dy = e.detail;
+            } else if (dy == null) {
+              dy = e.wheelDelta;
+            }
+            return { x: dx, y: dy };
+          }
+          function wheelEventPixels(e) {
+            var delta2 = wheelEventDelta(e);
+            delta2.x *= wheelPixelsPerUnit;
+            delta2.y *= wheelPixelsPerUnit;
+            return delta2;
+          }
+          function onScrollWheel(cm, e) {
+            var delta2 = wheelEventDelta(e),
+              dx = delta2.x,
+              dy = delta2.y;
+            var pixelsPerUnit = wheelPixelsPerUnit;
+            if (e.deltaMode === 0) {
+              dx = e.deltaX;
+              dy = e.deltaY;
+              pixelsPerUnit = 1;
+            }
+            var display = cm.display,
+              scroll = display.scroller;
+            var canScrollX = scroll.scrollWidth > scroll.clientWidth;
+            var canScrollY = scroll.scrollHeight > scroll.clientHeight;
+            if (!((dx && canScrollX) || (dy && canScrollY))) {
+              return;
+            }
+            if (dy && mac && webkit) {
+              outer: for (
+                var cur = e.target, view = display.view;
+                cur != scroll;
+                cur = cur.parentNode
+              ) {
+                for (var i2 = 0; i2 < view.length; i2++) {
+                  if (view[i2].node == cur) {
+                    cm.display.currentWheelTarget = cur;
+                    break outer;
+                  }
+                }
+              }
+            }
+            if (dx && !gecko && !presto && pixelsPerUnit != null) {
+              if (dy && canScrollY) {
+                updateScrollTop(
+                  cm,
+                  Math.max(0, scroll.scrollTop + dy * pixelsPerUnit)
+                );
+              }
+              setScrollLeft(
+                cm,
+                Math.max(0, scroll.scrollLeft + dx * pixelsPerUnit)
+              );
+              if (!dy || (dy && canScrollY)) {
+                e_preventDefault(e);
+              }
+              display.wheelStartX = null;
+              return;
+            }
+            if (dy && pixelsPerUnit != null) {
+              var pixels = dy * pixelsPerUnit;
+              var top2 = cm.doc.scrollTop,
+                bot2 = top2 + display.wrapper.clientHeight;
+              if (pixels < 0) {
+                top2 = Math.max(0, top2 + pixels - 50);
+              } else {
+                bot2 = Math.min(cm.doc.height, bot2 + pixels + 50);
+              }
+              updateDisplaySimple(cm, { top: top2, bottom: bot2 });
+            }
+            if (wheelSamples < 20 && e.deltaMode !== 0) {
+              if (display.wheelStartX == null) {
+                display.wheelStartX = scroll.scrollLeft;
+                display.wheelStartY = scroll.scrollTop;
+                display.wheelDX = dx;
+                display.wheelDY = dy;
+                setTimeout(function () {
+                  if (display.wheelStartX == null) {
+                    return;
+                  }
+                  var movedX = scroll.scrollLeft - display.wheelStartX;
+                  var movedY = scroll.scrollTop - display.wheelStartY;
+                  var sample =
+                    (movedY && display.wheelDY && movedY / display.wheelDY) ||
+                    (movedX && display.wheelDX && movedX / display.wheelDX);
+                  display.wheelStartX = display.wheelStartY = null;
+                  if (!sample) {
+                    return;
+                  }
+                  wheelPixelsPerUnit =
+                    (wheelPixelsPerUnit * wheelSamples + sample) /
+                    (wheelSamples + 1);
+                  ++wheelSamples;
+                }, 200);
+              } else {
+                display.wheelDX += dx;
+                display.wheelDY += dy;
+              }
+            }
+          }
+          var Selection = function (ranges, primIndex) {
+            this.ranges = ranges;
+            this.primIndex = primIndex;
+          };
+          Selection.prototype.primary = function () {
+            return this.ranges[this.primIndex];
+          };
+          Selection.prototype.equals = function (other) {
+            if (other == this) {
+              return true;
+            }
+            if (
+              other.primIndex != this.primIndex ||
+              other.ranges.length != this.ranges.length
+            ) {
+              return false;
+            }
+            for (var i2 = 0; i2 < this.ranges.length; i2++) {
+              var here = this.ranges[i2],
+                there = other.ranges[i2];
+              if (
+                !equalCursorPos(here.anchor, there.anchor) ||
+                !equalCursorPos(here.head, there.head)
+              ) {
+                return false;
+              }
+            }
+            return true;
+          };
+          Selection.prototype.deepCopy = function () {
+            var out = [];
+            for (var i2 = 0; i2 < this.ranges.length; i2++) {
+              out[i2] = new Range2(
+                copyPos(this.ranges[i2].anchor),
+                copyPos(this.ranges[i2].head)
+              );
+            }
+            return new Selection(out, this.primIndex);
+          };
+          Selection.prototype.somethingSelected = function () {
+            for (var i2 = 0; i2 < this.ranges.length; i2++) {
+              if (!this.ranges[i2].empty()) {
+                return true;
+              }
+            }
+            return false;
+          };
+          Selection.prototype.contains = function (pos, end2) {
+            if (!end2) {
+              end2 = pos;
+            }
+            for (var i2 = 0; i2 < this.ranges.length; i2++) {
+              var range3 = this.ranges[i2];
+              if (cmp(end2, range3.from()) >= 0 && cmp(pos, range3.to()) <= 0) {
+                return i2;
+              }
+            }
+            return -1;
+          };
+          var Range2 = function (anchor, head) {
+            this.anchor = anchor;
+            this.head = head;
+          };
+          Range2.prototype.from = function () {
+            return minPos(this.anchor, this.head);
+          };
+          Range2.prototype.to = function () {
+            return maxPos(this.anchor, this.head);
+          };
+          Range2.prototype.empty = function () {
+            return (
+              this.head.line == this.anchor.line &&
+              this.head.ch == this.anchor.ch
+            );
+          };
+          function normalizeSelection(cm, ranges, primIndex) {
+            var mayTouch = cm && cm.options.selectionsMayTouch;
+            var prim = ranges[primIndex];
+            ranges.sort(function (a, b) {
+              return cmp(a.from(), b.from());
+            });
+            primIndex = indexOf(ranges, prim);
+            for (var i2 = 1; i2 < ranges.length; i2++) {
+              var cur = ranges[i2],
+                prev = ranges[i2 - 1];
+              var diff2 = cmp(prev.to(), cur.from());
+              if (mayTouch && !cur.empty() ? diff2 > 0 : diff2 >= 0) {
+                var from = minPos(prev.from(), cur.from()),
+                  to = maxPos(prev.to(), cur.to());
+                var inv = prev.empty()
+                  ? cur.from() == cur.head
+                  : prev.from() == prev.head;
+                if (i2 <= primIndex) {
+                  --primIndex;
+                }
+                ranges.splice(
+                  --i2,
+                  2,
+                  new Range2(inv ? to : from, inv ? from : to)
+                );
+              }
+            }
+            return new Selection(ranges, primIndex);
+          }
+          function simpleSelection(anchor, head) {
+            return new Selection([new Range2(anchor, head || anchor)], 0);
+          }
+          function changeEnd(change) {
+            if (!change.text) {
+              return change.to;
+            }
+            return Pos(
+              change.from.line + change.text.length - 1,
+              lst(change.text).length +
+                (change.text.length == 1 ? change.from.ch : 0)
+            );
+          }
+          function adjustForChange(pos, change) {
+            if (cmp(pos, change.from) < 0) {
+              return pos;
+            }
+            if (cmp(pos, change.to) <= 0) {
+              return changeEnd(change);
+            }
+            var line =
+                pos.line +
+                change.text.length -
+                (change.to.line - change.from.line) -
+                1,
+              ch2 = pos.ch;
+            if (pos.line == change.to.line) {
+              ch2 += changeEnd(change).ch - change.to.ch;
+            }
+            return Pos(line, ch2);
+          }
+          function computeSelAfterChange(doc, change) {
+            var out = [];
+            for (var i2 = 0; i2 < doc.sel.ranges.length; i2++) {
+              var range3 = doc.sel.ranges[i2];
+              out.push(
+                new Range2(
+                  adjustForChange(range3.anchor, change),
+                  adjustForChange(range3.head, change)
+                )
+              );
+            }
+            return normalizeSelection(doc.cm, out, doc.sel.primIndex);
+          }
+          function offsetPos(pos, old, nw) {
+            if (pos.line == old.line) {
+              return Pos(nw.line, pos.ch - old.ch + nw.ch);
+            } else {
+              return Pos(nw.line + (pos.line - old.line), pos.ch);
+            }
+          }
+          function computeReplacedSel(doc, changes, hint2) {
+            var out = [];
+            var oldPrev = Pos(doc.first, 0),
+              newPrev = oldPrev;
+            for (var i2 = 0; i2 < changes.length; i2++) {
+              var change = changes[i2];
+              var from = offsetPos(change.from, oldPrev, newPrev);
+              var to = offsetPos(changeEnd(change), oldPrev, newPrev);
+              oldPrev = change.to;
+              newPrev = to;
+              if (hint2 == "around") {
+                var range3 = doc.sel.ranges[i2],
+                  inv = cmp(range3.head, range3.anchor) < 0;
+                out[i2] = new Range2(inv ? to : from, inv ? from : to);
+              } else {
+                out[i2] = new Range2(from, from);
+              }
+            }
+            return new Selection(out, doc.sel.primIndex);
+          }
+          function loadMode(cm) {
+            cm.doc.mode = getMode(cm.options, cm.doc.modeOption);
+            resetModeState(cm);
+          }
+          function resetModeState(cm) {
+            cm.doc.iter(function (line) {
+              if (line.stateAfter) {
+                line.stateAfter = null;
+              }
+              if (line.styles) {
+                line.styles = null;
+              }
+            });
+            cm.doc.modeFrontier = cm.doc.highlightFrontier = cm.doc.first;
+            startWorker(cm, 100);
+            cm.state.modeGen++;
+            if (cm.curOp) {
+              regChange(cm);
+            }
+          }
+          function isWholeLineUpdate(doc, change) {
+            return (
+              change.from.ch == 0 &&
+              change.to.ch == 0 &&
+              lst(change.text) == "" &&
+              (!doc.cm || doc.cm.options.wholeLineUpdateBefore)
+            );
+          }
+          function updateDoc(doc, change, markedSpans, estimateHeight2) {
+            function spansFor(n2) {
+              return markedSpans ? markedSpans[n2] : null;
+            }
+            function update(line, text4, spans) {
+              updateLine(line, text4, spans, estimateHeight2);
+              signalLater(line, "change", line, change);
+            }
+            function linesFor(start2, end2) {
+              var result2 = [];
+              for (var i2 = start2; i2 < end2; ++i2) {
+                result2.push(
+                  new Line(text3[i2], spansFor(i2), estimateHeight2)
+                );
+              }
+              return result2;
+            }
+            var from = change.from,
+              to = change.to,
+              text3 = change.text;
+            var firstLine = getLine2(doc, from.line),
+              lastLine = getLine2(doc, to.line);
+            var lastText = lst(text3),
+              lastSpans = spansFor(text3.length - 1),
+              nlines = to.line - from.line;
+            if (change.full) {
+              doc.insert(0, linesFor(0, text3.length));
+              doc.remove(text3.length, doc.size - text3.length);
+            } else if (isWholeLineUpdate(doc, change)) {
+              var added = linesFor(0, text3.length - 1);
+              update(lastLine, lastLine.text, lastSpans);
+              if (nlines) {
+                doc.remove(from.line, nlines);
+              }
+              if (added.length) {
+                doc.insert(from.line, added);
+              }
+            } else if (firstLine == lastLine) {
+              if (text3.length == 1) {
+                update(
+                  firstLine,
+                  firstLine.text.slice(0, from.ch) +
+                    lastText +
+                    firstLine.text.slice(to.ch),
+                  lastSpans
+                );
+              } else {
+                var added$1 = linesFor(1, text3.length - 1);
+                added$1.push(
+                  new Line(
+                    lastText + firstLine.text.slice(to.ch),
+                    lastSpans,
+                    estimateHeight2
+                  )
+                );
+                update(
+                  firstLine,
+                  firstLine.text.slice(0, from.ch) + text3[0],
+                  spansFor(0)
+                );
+                doc.insert(from.line + 1, added$1);
+              }
+            } else if (text3.length == 1) {
+              update(
+                firstLine,
+                firstLine.text.slice(0, from.ch) +
+                  text3[0] +
+                  lastLine.text.slice(to.ch),
+                spansFor(0)
+              );
+              doc.remove(from.line + 1, nlines);
+            } else {
+              update(
+                firstLine,
+                firstLine.text.slice(0, from.ch) + text3[0],
+                spansFor(0)
+              );
+              update(
+                lastLine,
+                lastText + lastLine.text.slice(to.ch),
+                lastSpans
+              );
+              var added$2 = linesFor(1, text3.length - 1);
+              if (nlines > 1) {
+                doc.remove(from.line + 1, nlines - 1);
+              }
+              doc.insert(from.line + 1, added$2);
+            }
+            signalLater(doc, "change", doc, change);
+          }
+          function linkedDocs(doc, f, sharedHistOnly) {
+            function propagate(doc2, skip2, sharedHist) {
+              if (doc2.linked) {
+                for (var i2 = 0; i2 < doc2.linked.length; ++i2) {
+                  var rel = doc2.linked[i2];
+                  if (rel.doc == skip2) {
+                    continue;
+                  }
+                  var shared = sharedHist && rel.sharedHist;
+                  if (sharedHistOnly && !shared) {
+                    continue;
+                  }
+                  f(rel.doc, shared);
+                  propagate(rel.doc, doc2, shared);
+                }
+              }
+            }
+            propagate(doc, null, true);
+          }
+          function attachDoc(cm, doc) {
+            if (doc.cm) {
+              throw new Error("This document is already in use.");
+            }
+            cm.doc = doc;
+            doc.cm = cm;
+            estimateLineHeights(cm);
+            loadMode(cm);
+            setDirectionClass(cm);
+            cm.options.direction = doc.direction;
+            if (!cm.options.lineWrapping) {
+              findMaxLine(cm);
+            }
+            cm.options.mode = doc.modeOption;
+            regChange(cm);
+          }
+          function setDirectionClass(cm) {
+            (cm.doc.direction == "rtl"
+              ? addClass
+              : rmClass)(cm.display.lineDiv, "CodeMirror-rtl");
+          }
+          function directionChanged(cm) {
+            runInOp(cm, function () {
+              setDirectionClass(cm);
+              regChange(cm);
+            });
+          }
+          function History(prev) {
+            this.done = [];
+            this.undone = [];
+            this.undoDepth = prev ? prev.undoDepth : Infinity;
+            this.lastModTime = this.lastSelTime = 0;
+            this.lastOp = this.lastSelOp = null;
+            this.lastOrigin = this.lastSelOrigin = null;
+            this.generation = this.maxGeneration = prev
+              ? prev.maxGeneration
+              : 1;
+          }
+          function historyChangeFromChange(doc, change) {
+            var histChange = {
+              from: copyPos(change.from),
+              to: changeEnd(change),
+              text: getBetween(doc, change.from, change.to),
+            };
+            attachLocalSpans(
+              doc,
+              histChange,
+              change.from.line,
+              change.to.line + 1
+            );
+            linkedDocs(
+              doc,
+              function (doc2) {
+                return attachLocalSpans(
+                  doc2,
+                  histChange,
+                  change.from.line,
+                  change.to.line + 1
+                );
+              },
+              true
+            );
+            return histChange;
+          }
+          function clearSelectionEvents(array) {
+            while (array.length) {
+              var last = lst(array);
+              if (last.ranges) {
+                array.pop();
+              } else {
+                break;
+              }
+            }
+          }
+          function lastChangeEvent(hist, force) {
+            if (force) {
+              clearSelectionEvents(hist.done);
+              return lst(hist.done);
+            } else if (hist.done.length && !lst(hist.done).ranges) {
+              return lst(hist.done);
+            } else if (
+              hist.done.length > 1 &&
+              !hist.done[hist.done.length - 2].ranges
+            ) {
+              hist.done.pop();
+              return lst(hist.done);
+            }
+          }
+          function addChangeToHistory(doc, change, selAfter, opId) {
+            var hist = doc.history;
+            hist.undone.length = 0;
+            var time = +new Date(),
+              cur;
+            var last;
+            if (
+              (hist.lastOp == opId ||
+                (hist.lastOrigin == change.origin &&
+                  change.origin &&
+                  ((change.origin.charAt(0) == "+" &&
+                    hist.lastModTime >
+                      time -
+                        (doc.cm ? doc.cm.options.historyEventDelay : 500)) ||
+                    change.origin.charAt(0) == "*"))) &&
+              (cur = lastChangeEvent(hist, hist.lastOp == opId))
+            ) {
+              last = lst(cur.changes);
+              if (
+                cmp(change.from, change.to) == 0 &&
+                cmp(change.from, last.to) == 0
+              ) {
+                last.to = changeEnd(change);
+              } else {
+                cur.changes.push(historyChangeFromChange(doc, change));
+              }
+            } else {
+              var before = lst(hist.done);
+              if (!before || !before.ranges) {
+                pushSelectionToHistory(doc.sel, hist.done);
+              }
+              cur = {
+                changes: [historyChangeFromChange(doc, change)],
+                generation: hist.generation,
+              };
+              hist.done.push(cur);
+              while (hist.done.length > hist.undoDepth) {
+                hist.done.shift();
+                if (!hist.done[0].ranges) {
+                  hist.done.shift();
+                }
+              }
+            }
+            hist.done.push(selAfter);
+            hist.generation = ++hist.maxGeneration;
+            hist.lastModTime = hist.lastSelTime = time;
+            hist.lastOp = hist.lastSelOp = opId;
+            hist.lastOrigin = hist.lastSelOrigin = change.origin;
+            if (!last) {
+              signal(doc, "historyAdded");
+            }
+          }
+          function selectionEventCanBeMerged(doc, origin, prev, sel) {
+            var ch2 = origin.charAt(0);
+            return (
+              ch2 == "*" ||
+              (ch2 == "+" &&
+                prev.ranges.length == sel.ranges.length &&
+                prev.somethingSelected() == sel.somethingSelected() &&
+                new Date() - doc.history.lastSelTime <=
+                  (doc.cm ? doc.cm.options.historyEventDelay : 500))
+            );
+          }
+          function addSelectionToHistory(doc, sel, opId, options) {
+            var hist = doc.history,
+              origin = options && options.origin;
+            if (
+              opId == hist.lastSelOp ||
+              (origin &&
+                hist.lastSelOrigin == origin &&
+                ((hist.lastModTime == hist.lastSelTime &&
+                  hist.lastOrigin == origin) ||
+                  selectionEventCanBeMerged(doc, origin, lst(hist.done), sel)))
+            ) {
+              hist.done[hist.done.length - 1] = sel;
+            } else {
+              pushSelectionToHistory(sel, hist.done);
+            }
+            hist.lastSelTime = +new Date();
+            hist.lastSelOrigin = origin;
+            hist.lastSelOp = opId;
+            if (options && options.clearRedo !== false) {
+              clearSelectionEvents(hist.undone);
+            }
+          }
+          function pushSelectionToHistory(sel, dest) {
+            var top2 = lst(dest);
+            if (!(top2 && top2.ranges && top2.equals(sel))) {
+              dest.push(sel);
+            }
+          }
+          function attachLocalSpans(doc, change, from, to) {
+            var existing = change["spans_" + doc.id],
+              n2 = 0;
+            doc.iter(
+              Math.max(doc.first, from),
+              Math.min(doc.first + doc.size, to),
+              function (line) {
+                if (line.markedSpans) {
+                  (existing || (existing = change["spans_" + doc.id] = {}))[
+                    n2
+                  ] = line.markedSpans;
+                }
+                ++n2;
+              }
+            );
+          }
+          function removeClearedSpans(spans) {
+            if (!spans) {
+              return null;
+            }
+            var out;
+            for (var i2 = 0; i2 < spans.length; ++i2) {
+              if (spans[i2].marker.explicitlyCleared) {
+                if (!out) {
+                  out = spans.slice(0, i2);
+                }
+              } else if (out) {
+                out.push(spans[i2]);
+              }
+            }
+            return !out ? spans : out.length ? out : null;
+          }
+          function getOldSpans(doc, change) {
+            var found = change["spans_" + doc.id];
+            if (!found) {
+              return null;
+            }
+            var nw = [];
+            for (var i2 = 0; i2 < change.text.length; ++i2) {
+              nw.push(removeClearedSpans(found[i2]));
+            }
+            return nw;
+          }
+          function mergeOldSpans(doc, change) {
+            var old = getOldSpans(doc, change);
+            var stretched = stretchSpansOverChange(doc, change);
+            if (!old) {
+              return stretched;
+            }
+            if (!stretched) {
+              return old;
+            }
+            for (var i2 = 0; i2 < old.length; ++i2) {
+              var oldCur = old[i2],
+                stretchCur = stretched[i2];
+              if (oldCur && stretchCur) {
+                spans: for (var j = 0; j < stretchCur.length; ++j) {
+                  var span = stretchCur[j];
+                  for (var k = 0; k < oldCur.length; ++k) {
+                    if (oldCur[k].marker == span.marker) {
+                      continue spans;
+                    }
+                  }
+                  oldCur.push(span);
+                }
+              } else if (stretchCur) {
+                old[i2] = stretchCur;
+              }
+            }
+            return old;
+          }
+          function copyHistoryArray(events, newGroup, instantiateSel) {
+            var copy2 = [];
+            for (var i2 = 0; i2 < events.length; ++i2) {
+              var event = events[i2];
+              if (event.ranges) {
+                copy2.push(
+                  instantiateSel
+                    ? Selection.prototype.deepCopy.call(event)
+                    : event
+                );
+                continue;
+              }
+              var changes = event.changes,
+                newChanges = [];
+              copy2.push({ changes: newChanges });
+              for (var j = 0; j < changes.length; ++j) {
+                var change = changes[j],
+                  m = void 0;
+                newChanges.push({
+                  from: change.from,
+                  to: change.to,
+                  text: change.text,
+                });
+                if (newGroup) {
+                  for (var prop3 in change) {
+                    if ((m = prop3.match(/^spans_(\d+)$/))) {
+                      if (indexOf(newGroup, Number(m[1])) > -1) {
+                        lst(newChanges)[prop3] = change[prop3];
+                        delete change[prop3];
+                      }
+                    }
+                  }
+                }
+              }
+            }
+            return copy2;
+          }
+          function extendRange(range3, head, other, extend) {
+            if (extend) {
+              var anchor = range3.anchor;
+              if (other) {
+                var posBefore = cmp(head, anchor) < 0;
+                if (posBefore != cmp(other, anchor) < 0) {
+                  anchor = head;
+                  head = other;
+                } else if (posBefore != cmp(head, other) < 0) {
+                  head = other;
+                }
+              }
+              return new Range2(anchor, head);
+            } else {
+              return new Range2(other || head, head);
+            }
+          }
+          function extendSelection(doc, head, other, options, extend) {
+            if (extend == null) {
+              extend = doc.cm && (doc.cm.display.shift || doc.extend);
+            }
+            setSelection(
+              doc,
+              new Selection(
+                [extendRange(doc.sel.primary(), head, other, extend)],
+                0
+              ),
+              options
+            );
+          }
+          function extendSelections(doc, heads, options) {
+            var out = [];
+            var extend = doc.cm && (doc.cm.display.shift || doc.extend);
+            for (var i2 = 0; i2 < doc.sel.ranges.length; i2++) {
+              out[i2] = extendRange(
+                doc.sel.ranges[i2],
+                heads[i2],
+                null,
+                extend
+              );
+            }
+            var newSel = normalizeSelection(doc.cm, out, doc.sel.primIndex);
+            setSelection(doc, newSel, options);
+          }
+          function replaceOneSelection(doc, i2, range3, options) {
+            var ranges = doc.sel.ranges.slice(0);
+            ranges[i2] = range3;
+            setSelection(
+              doc,
+              normalizeSelection(doc.cm, ranges, doc.sel.primIndex),
+              options
+            );
+          }
+          function setSimpleSelection(doc, anchor, head, options) {
+            setSelection(doc, simpleSelection(anchor, head), options);
+          }
+          function filterSelectionChange(doc, sel, options) {
+            var obj = {
+              ranges: sel.ranges,
+              update: function (ranges) {
+                this.ranges = [];
+                for (var i2 = 0; i2 < ranges.length; i2++) {
+                  this.ranges[i2] = new Range2(
+                    clipPos(doc, ranges[i2].anchor),
+                    clipPos(doc, ranges[i2].head)
+                  );
+                }
+              },
+              origin: options && options.origin,
+            };
+            signal(doc, "beforeSelectionChange", doc, obj);
+            if (doc.cm) {
+              signal(doc.cm, "beforeSelectionChange", doc.cm, obj);
+            }
+            if (obj.ranges != sel.ranges) {
+              return normalizeSelection(
+                doc.cm,
+                obj.ranges,
+                obj.ranges.length - 1
+              );
+            } else {
+              return sel;
+            }
+          }
+          function setSelectionReplaceHistory(doc, sel, options) {
+            var done = doc.history.done,
+              last = lst(done);
+            if (last && last.ranges) {
+              done[done.length - 1] = sel;
+              setSelectionNoUndo(doc, sel, options);
+            } else {
+              setSelection(doc, sel, options);
+            }
+          }
+          function setSelection(doc, sel, options) {
+            setSelectionNoUndo(doc, sel, options);
+            addSelectionToHistory(
+              doc,
+              doc.sel,
+              doc.cm ? doc.cm.curOp.id : NaN,
+              options
+            );
+          }
+          function setSelectionNoUndo(doc, sel, options) {
+            if (
+              hasHandler(doc, "beforeSelectionChange") ||
+              (doc.cm && hasHandler(doc.cm, "beforeSelectionChange"))
+            ) {
+              sel = filterSelectionChange(doc, sel, options);
+            }
+            var bias =
+              (options && options.bias) ||
+              (cmp(sel.primary().head, doc.sel.primary().head) < 0 ? -1 : 1);
+            setSelectionInner(doc, skipAtomicInSelection(doc, sel, bias, true));
+            if (
+              !(options && options.scroll === false) &&
+              doc.cm &&
+              doc.cm.getOption("readOnly") != "nocursor"
+            ) {
+              ensureCursorVisible(doc.cm);
+            }
+          }
+          function setSelectionInner(doc, sel) {
+            if (sel.equals(doc.sel)) {
+              return;
+            }
+            doc.sel = sel;
+            if (doc.cm) {
+              doc.cm.curOp.updateInput = 1;
+              doc.cm.curOp.selectionChanged = true;
+              signalCursorActivity(doc.cm);
+            }
+            signalLater(doc, "cursorActivity", doc);
+          }
+          function reCheckSelection(doc) {
+            setSelectionInner(
+              doc,
+              skipAtomicInSelection(doc, doc.sel, null, false)
+            );
+          }
+          function skipAtomicInSelection(doc, sel, bias, mayClear) {
+            var out;
+            for (var i2 = 0; i2 < sel.ranges.length; i2++) {
+              var range3 = sel.ranges[i2];
+              var old =
+                sel.ranges.length == doc.sel.ranges.length &&
+                doc.sel.ranges[i2];
+              var newAnchor = skipAtomic(
+                doc,
+                range3.anchor,
+                old && old.anchor,
+                bias,
+                mayClear
+              );
+              var newHead = skipAtomic(
+                doc,
+                range3.head,
+                old && old.head,
+                bias,
+                mayClear
+              );
+              if (out || newAnchor != range3.anchor || newHead != range3.head) {
+                if (!out) {
+                  out = sel.ranges.slice(0, i2);
+                }
+                out[i2] = new Range2(newAnchor, newHead);
+              }
+            }
+            return out ? normalizeSelection(doc.cm, out, sel.primIndex) : sel;
+          }
+          function skipAtomicInner(doc, pos, oldPos, dir, mayClear) {
+            var line = getLine2(doc, pos.line);
+            if (line.markedSpans) {
+              for (var i2 = 0; i2 < line.markedSpans.length; ++i2) {
+                var sp = line.markedSpans[i2],
+                  m = sp.marker;
+                var preventCursorLeft =
+                  "selectLeft" in m ? !m.selectLeft : m.inclusiveLeft;
+                var preventCursorRight =
+                  "selectRight" in m ? !m.selectRight : m.inclusiveRight;
+                if (
+                  (sp.from == null ||
+                    (preventCursorLeft
+                      ? sp.from <= pos.ch
+                      : sp.from < pos.ch)) &&
+                  (sp.to == null ||
+                    (preventCursorRight ? sp.to >= pos.ch : sp.to > pos.ch))
+                ) {
+                  if (mayClear) {
+                    signal(m, "beforeCursorEnter");
+                    if (m.explicitlyCleared) {
+                      if (!line.markedSpans) {
+                        break;
+                      } else {
+                        --i2;
+                        continue;
+                      }
+                    }
+                  }
+                  if (!m.atomic) {
+                    continue;
+                  }
+                  if (oldPos) {
+                    var near = m.find(dir < 0 ? 1 : -1),
+                      diff2 = void 0;
+                    if (dir < 0 ? preventCursorRight : preventCursorLeft) {
+                      near = movePos(
+                        doc,
+                        near,
+                        -dir,
+                        near && near.line == pos.line ? line : null
+                      );
+                    }
+                    if (
+                      near &&
+                      near.line == pos.line &&
+                      (diff2 = cmp(near, oldPos)) &&
+                      (dir < 0 ? diff2 < 0 : diff2 > 0)
+                    ) {
+                      return skipAtomicInner(doc, near, pos, dir, mayClear);
+                    }
+                  }
+                  var far = m.find(dir < 0 ? -1 : 1);
+                  if (dir < 0 ? preventCursorLeft : preventCursorRight) {
+                    far = movePos(
+                      doc,
+                      far,
+                      dir,
+                      far.line == pos.line ? line : null
+                    );
+                  }
+                  return far
+                    ? skipAtomicInner(doc, far, pos, dir, mayClear)
+                    : null;
+                }
+              }
+            }
+            return pos;
+          }
+          function skipAtomic(doc, pos, oldPos, bias, mayClear) {
+            var dir = bias || 1;
+            var found =
+              skipAtomicInner(doc, pos, oldPos, dir, mayClear) ||
+              (!mayClear && skipAtomicInner(doc, pos, oldPos, dir, true)) ||
+              skipAtomicInner(doc, pos, oldPos, -dir, mayClear) ||
+              (!mayClear && skipAtomicInner(doc, pos, oldPos, -dir, true));
+            if (!found) {
+              doc.cantEdit = true;
+              return Pos(doc.first, 0);
+            }
+            return found;
+          }
+          function movePos(doc, pos, dir, line) {
+            if (dir < 0 && pos.ch == 0) {
+              if (pos.line > doc.first) {
+                return clipPos(doc, Pos(pos.line - 1));
+              } else {
+                return null;
+              }
+            } else if (
+              dir > 0 &&
+              pos.ch == (line || getLine2(doc, pos.line)).text.length
+            ) {
+              if (pos.line < doc.first + doc.size - 1) {
+                return Pos(pos.line + 1, 0);
+              } else {
+                return null;
+              }
+            } else {
+              return new Pos(pos.line, pos.ch + dir);
+            }
+          }
+          function selectAll(cm) {
+            cm.setSelection(
+              Pos(cm.firstLine(), 0),
+              Pos(cm.lastLine()),
+              sel_dontScroll
+            );
+          }
+          function filterChange(doc, change, update) {
+            var obj = {
+              canceled: false,
+              from: change.from,
+              to: change.to,
+              text: change.text,
+              origin: change.origin,
+              cancel: function () {
+                return (obj.canceled = true);
+              },
+            };
+            if (update) {
+              obj.update = function (from, to, text3, origin) {
+                if (from) {
+                  obj.from = clipPos(doc, from);
+                }
+                if (to) {
+                  obj.to = clipPos(doc, to);
+                }
+                if (text3) {
+                  obj.text = text3;
+                }
+                if (origin !== void 0) {
+                  obj.origin = origin;
+                }
+              };
+            }
+            signal(doc, "beforeChange", doc, obj);
+            if (doc.cm) {
+              signal(doc.cm, "beforeChange", doc.cm, obj);
+            }
+            if (obj.canceled) {
+              if (doc.cm) {
+                doc.cm.curOp.updateInput = 2;
+              }
+              return null;
+            }
+            return {
+              from: obj.from,
+              to: obj.to,
+              text: obj.text,
+              origin: obj.origin,
+            };
+          }
+          function makeChange(doc, change, ignoreReadOnly) {
+            if (doc.cm) {
+              if (!doc.cm.curOp) {
+                return operation(doc.cm, makeChange)(
+                  doc,
+                  change,
+                  ignoreReadOnly
+                );
+              }
+              if (doc.cm.state.suppressEdits) {
+                return;
+              }
+            }
+            if (
+              hasHandler(doc, "beforeChange") ||
+              (doc.cm && hasHandler(doc.cm, "beforeChange"))
+            ) {
+              change = filterChange(doc, change, true);
+              if (!change) {
+                return;
+              }
+            }
+            var split2 =
+              sawReadOnlySpans &&
+              !ignoreReadOnly &&
+              removeReadOnlyRanges(doc, change.from, change.to);
+            if (split2) {
+              for (var i2 = split2.length - 1; i2 >= 0; --i2) {
+                makeChangeInner(doc, {
+                  from: split2[i2].from,
+                  to: split2[i2].to,
+                  text: i2 ? [""] : change.text,
+                  origin: change.origin,
+                });
+              }
+            } else {
+              makeChangeInner(doc, change);
+            }
+          }
+          function makeChangeInner(doc, change) {
+            if (
+              change.text.length == 1 &&
+              change.text[0] == "" &&
+              cmp(change.from, change.to) == 0
+            ) {
+              return;
+            }
+            var selAfter = computeSelAfterChange(doc, change);
+            addChangeToHistory(
+              doc,
+              change,
+              selAfter,
+              doc.cm ? doc.cm.curOp.id : NaN
+            );
+            makeChangeSingleDoc(
+              doc,
+              change,
+              selAfter,
+              stretchSpansOverChange(doc, change)
+            );
+            var rebased = [];
+            linkedDocs(doc, function (doc2, sharedHist) {
+              if (!sharedHist && indexOf(rebased, doc2.history) == -1) {
+                rebaseHist(doc2.history, change);
+                rebased.push(doc2.history);
+              }
+              makeChangeSingleDoc(
+                doc2,
+                change,
+                null,
+                stretchSpansOverChange(doc2, change)
+              );
+            });
+          }
+          function makeChangeFromHistory(doc, type2, allowSelectionOnly) {
+            var suppress = doc.cm && doc.cm.state.suppressEdits;
+            if (suppress && !allowSelectionOnly) {
+              return;
+            }
+            var hist = doc.history,
+              event,
+              selAfter = doc.sel;
+            var source = type2 == "undo" ? hist.done : hist.undone,
+              dest = type2 == "undo" ? hist.undone : hist.done;
+            var i2 = 0;
+            for (; i2 < source.length; i2++) {
+              event = source[i2];
+              if (
+                allowSelectionOnly
+                  ? event.ranges && !event.equals(doc.sel)
+                  : !event.ranges
+              ) {
+                break;
+              }
+            }
+            if (i2 == source.length) {
+              return;
+            }
+            hist.lastOrigin = hist.lastSelOrigin = null;
+            for (;;) {
+              event = source.pop();
+              if (event.ranges) {
+                pushSelectionToHistory(event, dest);
+                if (allowSelectionOnly && !event.equals(doc.sel)) {
+                  setSelection(doc, event, { clearRedo: false });
+                  return;
+                }
+                selAfter = event;
+              } else if (suppress) {
+                source.push(event);
+                return;
+              } else {
+                break;
+              }
+            }
+            var antiChanges = [];
+            pushSelectionToHistory(selAfter, dest);
+            dest.push({ changes: antiChanges, generation: hist.generation });
+            hist.generation = event.generation || ++hist.maxGeneration;
+            var filter =
+              hasHandler(doc, "beforeChange") ||
+              (doc.cm && hasHandler(doc.cm, "beforeChange"));
+            var loop = function (i3) {
+              var change = event.changes[i3];
+              change.origin = type2;
+              if (filter && !filterChange(doc, change, false)) {
+                source.length = 0;
+                return {};
+              }
+              antiChanges.push(historyChangeFromChange(doc, change));
+              var after = i3 ? computeSelAfterChange(doc, change) : lst(source);
+              makeChangeSingleDoc(
+                doc,
+                change,
+                after,
+                mergeOldSpans(doc, change)
+              );
+              if (!i3 && doc.cm) {
+                doc.cm.scrollIntoView({
+                  from: change.from,
+                  to: changeEnd(change),
+                });
+              }
+              var rebased = [];
+              linkedDocs(doc, function (doc2, sharedHist) {
+                if (!sharedHist && indexOf(rebased, doc2.history) == -1) {
+                  rebaseHist(doc2.history, change);
+                  rebased.push(doc2.history);
+                }
+                makeChangeSingleDoc(
+                  doc2,
+                  change,
+                  null,
+                  mergeOldSpans(doc2, change)
+                );
+              });
+            };
+            for (var i$12 = event.changes.length - 1; i$12 >= 0; --i$12) {
+              var returned = loop(i$12);
+              if (returned) return returned.v;
+            }
+          }
+          function shiftDoc(doc, distance) {
+            if (distance == 0) {
+              return;
+            }
+            doc.first += distance;
+            doc.sel = new Selection(
+              map2(doc.sel.ranges, function (range3) {
+                return new Range2(
+                  Pos(range3.anchor.line + distance, range3.anchor.ch),
+                  Pos(range3.head.line + distance, range3.head.ch)
+                );
+              }),
+              doc.sel.primIndex
+            );
+            if (doc.cm) {
+              regChange(doc.cm, doc.first, doc.first - distance, distance);
+              for (
+                var d = doc.cm.display, l2 = d.viewFrom;
+                l2 < d.viewTo;
+                l2++
+              ) {
+                regLineChange(doc.cm, l2, "gutter");
+              }
+            }
+          }
+          function makeChangeSingleDoc(doc, change, selAfter, spans) {
+            if (doc.cm && !doc.cm.curOp) {
+              return operation(doc.cm, makeChangeSingleDoc)(
+                doc,
+                change,
+                selAfter,
+                spans
+              );
+            }
+            if (change.to.line < doc.first) {
+              shiftDoc(
+                doc,
+                change.text.length - 1 - (change.to.line - change.from.line)
+              );
+              return;
+            }
+            if (change.from.line > doc.lastLine()) {
+              return;
+            }
+            if (change.from.line < doc.first) {
+              var shift =
+                change.text.length - 1 - (doc.first - change.from.line);
+              shiftDoc(doc, shift);
+              change = {
+                from: Pos(doc.first, 0),
+                to: Pos(change.to.line + shift, change.to.ch),
+                text: [lst(change.text)],
+                origin: change.origin,
+              };
+            }
+            var last = doc.lastLine();
+            if (change.to.line > last) {
+              change = {
+                from: change.from,
+                to: Pos(last, getLine2(doc, last).text.length),
+                text: [change.text[0]],
+                origin: change.origin,
+              };
+            }
+            change.removed = getBetween(doc, change.from, change.to);
+            if (!selAfter) {
+              selAfter = computeSelAfterChange(doc, change);
+            }
+            if (doc.cm) {
+              makeChangeSingleDocInEditor(doc.cm, change, spans);
+            } else {
+              updateDoc(doc, change, spans);
+            }
+            setSelectionNoUndo(doc, selAfter, sel_dontScroll);
+            if (doc.cantEdit && skipAtomic(doc, Pos(doc.firstLine(), 0))) {
+              doc.cantEdit = false;
+            }
+          }
+          function makeChangeSingleDocInEditor(cm, change, spans) {
+            var doc = cm.doc,
+              display = cm.display,
+              from = change.from,
+              to = change.to;
+            var recomputeMaxLength = false,
+              checkWidthStart = from.line;
+            if (!cm.options.lineWrapping) {
+              checkWidthStart = lineNo(visualLine(getLine2(doc, from.line)));
+              doc.iter(checkWidthStart, to.line + 1, function (line) {
+                if (line == display.maxLine) {
+                  recomputeMaxLength = true;
+                  return true;
+                }
+              });
+            }
+            if (doc.sel.contains(change.from, change.to) > -1) {
+              signalCursorActivity(cm);
+            }
+            updateDoc(doc, change, spans, estimateHeight(cm));
+            if (!cm.options.lineWrapping) {
+              doc.iter(
+                checkWidthStart,
+                from.line + change.text.length,
+                function (line) {
+                  var len = lineLength(line);
+                  if (len > display.maxLineLength) {
+                    display.maxLine = line;
+                    display.maxLineLength = len;
+                    display.maxLineChanged = true;
+                    recomputeMaxLength = false;
+                  }
+                }
+              );
+              if (recomputeMaxLength) {
+                cm.curOp.updateMaxLine = true;
+              }
+            }
+            retreatFrontier(doc, from.line);
+            startWorker(cm, 400);
+            var lendiff = change.text.length - (to.line - from.line) - 1;
+            if (change.full) {
+              regChange(cm);
+            } else if (
+              from.line == to.line &&
+              change.text.length == 1 &&
+              !isWholeLineUpdate(cm.doc, change)
+            ) {
+              regLineChange(cm, from.line, "text");
+            } else {
+              regChange(cm, from.line, to.line + 1, lendiff);
+            }
+            var changesHandler = hasHandler(cm, "changes"),
+              changeHandler = hasHandler(cm, "change");
+            if (changeHandler || changesHandler) {
+              var obj = {
+                from,
+                to,
+                text: change.text,
+                removed: change.removed,
+                origin: change.origin,
+              };
+              if (changeHandler) {
+                signalLater(cm, "change", cm, obj);
+              }
+              if (changesHandler) {
+                (cm.curOp.changeObjs || (cm.curOp.changeObjs = [])).push(obj);
+              }
+            }
+            cm.display.selForContextMenu = null;
+          }
+          function replaceRange(doc, code3, from, to, origin) {
+            var assign2;
+            if (!to) {
+              to = from;
+            }
+            if (cmp(to, from) < 0) {
+              (assign2 = [to, from]), (from = assign2[0]), (to = assign2[1]);
+            }
+            if (typeof code3 == "string") {
+              code3 = doc.splitLines(code3);
+            }
+            makeChange(doc, { from, to, text: code3, origin });
+          }
+          function rebaseHistSelSingle(pos, from, to, diff2) {
+            if (to < pos.line) {
+              pos.line += diff2;
+            } else if (from < pos.line) {
+              pos.line = from;
+              pos.ch = 0;
+            }
+          }
+          function rebaseHistArray(array, from, to, diff2) {
+            for (var i2 = 0; i2 < array.length; ++i2) {
+              var sub2 = array[i2],
+                ok2 = true;
+              if (sub2.ranges) {
+                if (!sub2.copied) {
+                  sub2 = array[i2] = sub2.deepCopy();
+                  sub2.copied = true;
+                }
+                for (var j = 0; j < sub2.ranges.length; j++) {
+                  rebaseHistSelSingle(sub2.ranges[j].anchor, from, to, diff2);
+                  rebaseHistSelSingle(sub2.ranges[j].head, from, to, diff2);
+                }
+                continue;
+              }
+              for (var j$1 = 0; j$1 < sub2.changes.length; ++j$1) {
+                var cur = sub2.changes[j$1];
+                if (to < cur.from.line) {
+                  cur.from = Pos(cur.from.line + diff2, cur.from.ch);
+                  cur.to = Pos(cur.to.line + diff2, cur.to.ch);
+                } else if (from <= cur.to.line) {
+                  ok2 = false;
+                  break;
+                }
+              }
+              if (!ok2) {
+                array.splice(0, i2 + 1);
+                i2 = 0;
+              }
+            }
+          }
+          function rebaseHist(hist, change) {
+            var from = change.from.line,
+              to = change.to.line,
+              diff2 = change.text.length - (to - from) - 1;
+            rebaseHistArray(hist.done, from, to, diff2);
+            rebaseHistArray(hist.undone, from, to, diff2);
+          }
+          function changeLine(doc, handle, changeType, op) {
+            var no = handle,
+              line = handle;
+            if (typeof handle == "number") {
+              line = getLine2(doc, clipLine(doc, handle));
+            } else {
+              no = lineNo(handle);
+            }
+            if (no == null) {
+              return null;
+            }
+            if (op(line, no) && doc.cm) {
+              regLineChange(doc.cm, no, changeType);
+            }
+            return line;
+          }
+          function LeafChunk(lines) {
+            this.lines = lines;
+            this.parent = null;
+            var height = 0;
+            for (var i2 = 0; i2 < lines.length; ++i2) {
+              lines[i2].parent = this;
+              height += lines[i2].height;
+            }
+            this.height = height;
+          }
+          LeafChunk.prototype = {
+            chunkSize: function () {
+              return this.lines.length;
+            },
+            removeInner: function (at, n2) {
+              for (var i2 = at, e = at + n2; i2 < e; ++i2) {
+                var line = this.lines[i2];
+                this.height -= line.height;
+                cleanUpLine(line);
+                signalLater(line, "delete");
+              }
+              this.lines.splice(at, n2);
+            },
+            collapse: function (lines) {
+              lines.push.apply(lines, this.lines);
+            },
+            insertInner: function (at, lines, height) {
+              this.height += height;
+              this.lines = this.lines
+                .slice(0, at)
+                .concat(lines)
+                .concat(this.lines.slice(at));
+              for (var i2 = 0; i2 < lines.length; ++i2) {
+                lines[i2].parent = this;
+              }
+            },
+            iterN: function (at, n2, op) {
+              for (var e = at + n2; at < e; ++at) {
+                if (op(this.lines[at])) {
+                  return true;
+                }
+              }
+            },
+          };
+          function BranchChunk(children) {
+            this.children = children;
+            var size = 0,
+              height = 0;
+            for (var i2 = 0; i2 < children.length; ++i2) {
+              var ch2 = children[i2];
+              size += ch2.chunkSize();
+              height += ch2.height;
+              ch2.parent = this;
+            }
+            this.size = size;
+            this.height = height;
+            this.parent = null;
+          }
+          BranchChunk.prototype = {
+            chunkSize: function () {
+              return this.size;
+            },
+            removeInner: function (at, n2) {
+              this.size -= n2;
+              for (var i2 = 0; i2 < this.children.length; ++i2) {
+                var child = this.children[i2],
+                  sz = child.chunkSize();
+                if (at < sz) {
+                  var rm = Math.min(n2, sz - at),
+                    oldHeight = child.height;
+                  child.removeInner(at, rm);
+                  this.height -= oldHeight - child.height;
+                  if (sz == rm) {
+                    this.children.splice(i2--, 1);
+                    child.parent = null;
+                  }
+                  if ((n2 -= rm) == 0) {
+                    break;
+                  }
+                  at = 0;
+                } else {
+                  at -= sz;
+                }
+              }
+              if (
+                this.size - n2 < 25 &&
+                (this.children.length > 1 ||
+                  !(this.children[0] instanceof LeafChunk))
+              ) {
+                var lines = [];
+                this.collapse(lines);
+                this.children = [new LeafChunk(lines)];
+                this.children[0].parent = this;
+              }
+            },
+            collapse: function (lines) {
+              for (var i2 = 0; i2 < this.children.length; ++i2) {
+                this.children[i2].collapse(lines);
+              }
+            },
+            insertInner: function (at, lines, height) {
+              this.size += lines.length;
+              this.height += height;
+              for (var i2 = 0; i2 < this.children.length; ++i2) {
+                var child = this.children[i2],
+                  sz = child.chunkSize();
+                if (at <= sz) {
+                  child.insertInner(at, lines, height);
+                  if (child.lines && child.lines.length > 50) {
+                    var remaining = (child.lines.length % 25) + 25;
+                    for (var pos = remaining; pos < child.lines.length; ) {
+                      var leaf = new LeafChunk(
+                        child.lines.slice(pos, (pos += 25))
+                      );
+                      child.height -= leaf.height;
+                      this.children.splice(++i2, 0, leaf);
+                      leaf.parent = this;
+                    }
+                    child.lines = child.lines.slice(0, remaining);
+                    this.maybeSpill();
+                  }
+                  break;
+                }
+                at -= sz;
+              }
+            },
+            maybeSpill: function () {
+              if (this.children.length <= 10) {
+                return;
+              }
+              var me2 = this;
+              do {
+                var spilled = me2.children.splice(me2.children.length - 5, 5);
+                var sibling = new BranchChunk(spilled);
+                if (!me2.parent) {
+                  var copy2 = new BranchChunk(me2.children);
+                  copy2.parent = me2;
+                  me2.children = [copy2, sibling];
+                  me2 = copy2;
+                } else {
+                  me2.size -= sibling.size;
+                  me2.height -= sibling.height;
+                  var myIndex = indexOf(me2.parent.children, me2);
+                  me2.parent.children.splice(myIndex + 1, 0, sibling);
+                }
+                sibling.parent = me2.parent;
+              } while (me2.children.length > 10);
+              me2.parent.maybeSpill();
+            },
+            iterN: function (at, n2, op) {
+              for (var i2 = 0; i2 < this.children.length; ++i2) {
+                var child = this.children[i2],
+                  sz = child.chunkSize();
+                if (at < sz) {
+                  var used = Math.min(n2, sz - at);
+                  if (child.iterN(at, used, op)) {
+                    return true;
+                  }
+                  if ((n2 -= used) == 0) {
+                    break;
+                  }
+                  at = 0;
+                } else {
+                  at -= sz;
+                }
+              }
+            },
+          };
+          var LineWidget = function (doc, node, options) {
+            if (options) {
+              for (var opt2 in options) {
+                if (options.hasOwnProperty(opt2)) {
+                  this[opt2] = options[opt2];
+                }
+              }
+            }
+            this.doc = doc;
+            this.node = node;
+          };
+          LineWidget.prototype.clear = function () {
+            var cm = this.doc.cm,
+              ws2 = this.line.widgets,
+              line = this.line,
+              no = lineNo(line);
+            if (no == null || !ws2) {
+              return;
+            }
+            for (var i2 = 0; i2 < ws2.length; ++i2) {
+              if (ws2[i2] == this) {
+                ws2.splice(i2--, 1);
+              }
+            }
+            if (!ws2.length) {
+              line.widgets = null;
+            }
+            var height = widgetHeight(this);
+            updateLineHeight(line, Math.max(0, line.height - height));
+            if (cm) {
+              runInOp(cm, function () {
+                adjustScrollWhenAboveVisible(cm, line, -height);
+                regLineChange(cm, no, "widget");
+              });
+              signalLater(cm, "lineWidgetCleared", cm, this, no);
+            }
+          };
+          LineWidget.prototype.changed = function () {
+            var this$1$1 = this;
+            var oldH = this.height,
+              cm = this.doc.cm,
+              line = this.line;
+            this.height = null;
+            var diff2 = widgetHeight(this) - oldH;
+            if (!diff2) {
+              return;
+            }
+            if (!lineIsHidden(this.doc, line)) {
+              updateLineHeight(line, line.height + diff2);
+            }
+            if (cm) {
+              runInOp(cm, function () {
+                cm.curOp.forceUpdate = true;
+                adjustScrollWhenAboveVisible(cm, line, diff2);
+                signalLater(
+                  cm,
+                  "lineWidgetChanged",
+                  cm,
+                  this$1$1,
+                  lineNo(line)
+                );
+              });
+            }
+          };
+          eventMixin(LineWidget);
+          function adjustScrollWhenAboveVisible(cm, line, diff2) {
+            if (
+              heightAtLine(line) <
+              ((cm.curOp && cm.curOp.scrollTop) || cm.doc.scrollTop)
+            ) {
+              addToScrollTop(cm, diff2);
+            }
+          }
+          function addLineWidget(doc, handle, node, options) {
+            var widget = new LineWidget(doc, node, options);
+            var cm = doc.cm;
+            if (cm && widget.noHScroll) {
+              cm.display.alignWidgets = true;
+            }
+            changeLine(doc, handle, "widget", function (line) {
+              var widgets = line.widgets || (line.widgets = []);
+              if (widget.insertAt == null) {
+                widgets.push(widget);
+              } else {
+                widgets.splice(
+                  Math.min(widgets.length, Math.max(0, widget.insertAt)),
+                  0,
+                  widget
+                );
+              }
+              widget.line = line;
+              if (cm && !lineIsHidden(doc, line)) {
+                var aboveVisible = heightAtLine(line) < doc.scrollTop;
+                updateLineHeight(line, line.height + widgetHeight(widget));
+                if (aboveVisible) {
+                  addToScrollTop(cm, widget.height);
+                }
+                cm.curOp.forceUpdate = true;
+              }
+              return true;
+            });
+            if (cm) {
+              signalLater(
+                cm,
+                "lineWidgetAdded",
+                cm,
+                widget,
+                typeof handle == "number" ? handle : lineNo(handle)
+              );
+            }
+            return widget;
+          }
+          var nextMarkerId = 0;
+          var TextMarker = function (doc, type2) {
+            this.lines = [];
+            this.type = type2;
+            this.doc = doc;
+            this.id = ++nextMarkerId;
+          };
+          TextMarker.prototype.clear = function () {
+            if (this.explicitlyCleared) {
+              return;
+            }
+            var cm = this.doc.cm,
+              withOp = cm && !cm.curOp;
+            if (withOp) {
+              startOperation(cm);
+            }
+            if (hasHandler(this, "clear")) {
+              var found = this.find();
+              if (found) {
+                signalLater(this, "clear", found.from, found.to);
+              }
+            }
+            var min = null,
+              max = null;
+            for (var i2 = 0; i2 < this.lines.length; ++i2) {
+              var line = this.lines[i2];
+              var span = getMarkedSpanFor(line.markedSpans, this);
+              if (cm && !this.collapsed) {
+                regLineChange(cm, lineNo(line), "text");
+              } else if (cm) {
+                if (span.to != null) {
+                  max = lineNo(line);
+                }
+                if (span.from != null) {
+                  min = lineNo(line);
+                }
+              }
+              line.markedSpans = removeMarkedSpan(line.markedSpans, span);
+              if (
+                span.from == null &&
+                this.collapsed &&
+                !lineIsHidden(this.doc, line) &&
+                cm
+              ) {
+                updateLineHeight(line, textHeight(cm.display));
+              }
+            }
+            if (cm && this.collapsed && !cm.options.lineWrapping) {
+              for (var i$12 = 0; i$12 < this.lines.length; ++i$12) {
+                var visual = visualLine(this.lines[i$12]),
+                  len = lineLength(visual);
+                if (len > cm.display.maxLineLength) {
+                  cm.display.maxLine = visual;
+                  cm.display.maxLineLength = len;
+                  cm.display.maxLineChanged = true;
+                }
+              }
+            }
+            if (min != null && cm && this.collapsed) {
+              regChange(cm, min, max + 1);
+            }
+            this.lines.length = 0;
+            this.explicitlyCleared = true;
+            if (this.atomic && this.doc.cantEdit) {
+              this.doc.cantEdit = false;
+              if (cm) {
+                reCheckSelection(cm.doc);
+              }
+            }
+            if (cm) {
+              signalLater(cm, "markerCleared", cm, this, min, max);
+            }
+            if (withOp) {
+              endOperation(cm);
+            }
+            if (this.parent) {
+              this.parent.clear();
+            }
+          };
+          TextMarker.prototype.find = function (side, lineObj) {
+            if (side == null && this.type == "bookmark") {
+              side = 1;
+            }
+            var from, to;
+            for (var i2 = 0; i2 < this.lines.length; ++i2) {
+              var line = this.lines[i2];
+              var span = getMarkedSpanFor(line.markedSpans, this);
+              if (span.from != null) {
+                from = Pos(lineObj ? line : lineNo(line), span.from);
+                if (side == -1) {
+                  return from;
+                }
+              }
+              if (span.to != null) {
+                to = Pos(lineObj ? line : lineNo(line), span.to);
+                if (side == 1) {
+                  return to;
+                }
+              }
+            }
+            return from && { from, to };
+          };
+          TextMarker.prototype.changed = function () {
+            var this$1$1 = this;
+            var pos = this.find(-1, true),
+              widget = this,
+              cm = this.doc.cm;
+            if (!pos || !cm) {
+              return;
+            }
+            runInOp(cm, function () {
+              var line = pos.line,
+                lineN = lineNo(pos.line);
+              var view = findViewForLine(cm, lineN);
+              if (view) {
+                clearLineMeasurementCacheFor(view);
+                cm.curOp.selectionChanged = cm.curOp.forceUpdate = true;
+              }
+              cm.curOp.updateMaxLine = true;
+              if (!lineIsHidden(widget.doc, line) && widget.height != null) {
+                var oldHeight = widget.height;
+                widget.height = null;
+                var dHeight = widgetHeight(widget) - oldHeight;
+                if (dHeight) {
+                  updateLineHeight(line, line.height + dHeight);
+                }
+              }
+              signalLater(cm, "markerChanged", cm, this$1$1);
+            });
+          };
+          TextMarker.prototype.attachLine = function (line) {
+            if (!this.lines.length && this.doc.cm) {
+              var op = this.doc.cm.curOp;
+              if (
+                !op.maybeHiddenMarkers ||
+                indexOf(op.maybeHiddenMarkers, this) == -1
+              ) {
+                (
+                  op.maybeUnhiddenMarkers || (op.maybeUnhiddenMarkers = [])
+                ).push(this);
+              }
+            }
+            this.lines.push(line);
+          };
+          TextMarker.prototype.detachLine = function (line) {
+            this.lines.splice(indexOf(this.lines, line), 1);
+            if (!this.lines.length && this.doc.cm) {
+              var op = this.doc.cm.curOp;
+              (op.maybeHiddenMarkers || (op.maybeHiddenMarkers = [])).push(
+                this
+              );
+            }
+          };
+          eventMixin(TextMarker);
+          function markText(doc, from, to, options, type2) {
+            if (options && options.shared) {
+              return markTextShared(doc, from, to, options, type2);
+            }
+            if (doc.cm && !doc.cm.curOp) {
+              return operation(doc.cm, markText)(doc, from, to, options, type2);
+            }
+            var marker2 = new TextMarker(doc, type2),
+              diff2 = cmp(from, to);
+            if (options) {
+              copyObj(options, marker2, false);
+            }
+            if (diff2 > 0 || (diff2 == 0 && marker2.clearWhenEmpty !== false)) {
+              return marker2;
+            }
+            if (marker2.replacedWith) {
+              marker2.collapsed = true;
+              marker2.widgetNode = eltP(
+                "span",
+                [marker2.replacedWith],
+                "CodeMirror-widget"
+              );
+              if (!options.handleMouseEvents) {
+                marker2.widgetNode.setAttribute("cm-ignore-events", "true");
+              }
+              if (options.insertLeft) {
+                marker2.widgetNode.insertLeft = true;
+              }
+            }
+            if (marker2.collapsed) {
+              if (
+                conflictingCollapsedRange(doc, from.line, from, to, marker2) ||
+                (from.line != to.line &&
+                  conflictingCollapsedRange(doc, to.line, from, to, marker2))
+              ) {
+                throw new Error(
+                  "Inserting collapsed marker partially overlapping an existing one"
+                );
+              }
+              seeCollapsedSpans();
+            }
+            if (marker2.addToHistory) {
+              addChangeToHistory(
+                doc,
+                { from, to, origin: "markText" },
+                doc.sel,
+                NaN
+              );
+            }
+            var curLine = from.line,
+              cm = doc.cm,
+              updateMaxLine;
+            doc.iter(curLine, to.line + 1, function (line) {
+              if (
+                cm &&
+                marker2.collapsed &&
+                !cm.options.lineWrapping &&
+                visualLine(line) == cm.display.maxLine
+              ) {
+                updateMaxLine = true;
+              }
+              if (marker2.collapsed && curLine != from.line) {
+                updateLineHeight(line, 0);
+              }
+              addMarkedSpan(
+                line,
+                new MarkedSpan(
+                  marker2,
+                  curLine == from.line ? from.ch : null,
+                  curLine == to.line ? to.ch : null
+                ),
+                doc.cm && doc.cm.curOp
+              );
+              ++curLine;
+            });
+            if (marker2.collapsed) {
+              doc.iter(from.line, to.line + 1, function (line) {
+                if (lineIsHidden(doc, line)) {
+                  updateLineHeight(line, 0);
+                }
+              });
+            }
+            if (marker2.clearOnEnter) {
+              on(marker2, "beforeCursorEnter", function () {
+                return marker2.clear();
+              });
+            }
+            if (marker2.readOnly) {
+              seeReadOnlySpans();
+              if (doc.history.done.length || doc.history.undone.length) {
+                doc.clearHistory();
+              }
+            }
+            if (marker2.collapsed) {
+              marker2.id = ++nextMarkerId;
+              marker2.atomic = true;
+            }
+            if (cm) {
+              if (updateMaxLine) {
+                cm.curOp.updateMaxLine = true;
+              }
+              if (marker2.collapsed) {
+                regChange(cm, from.line, to.line + 1);
+              } else if (
+                marker2.className ||
+                marker2.startStyle ||
+                marker2.endStyle ||
+                marker2.css ||
+                marker2.attributes ||
+                marker2.title
+              ) {
+                for (var i2 = from.line; i2 <= to.line; i2++) {
+                  regLineChange(cm, i2, "text");
+                }
+              }
+              if (marker2.atomic) {
+                reCheckSelection(cm.doc);
+              }
+              signalLater(cm, "markerAdded", cm, marker2);
+            }
+            return marker2;
+          }
+          var SharedTextMarker = function (markers, primary) {
+            this.markers = markers;
+            this.primary = primary;
+            for (var i2 = 0; i2 < markers.length; ++i2) {
+              markers[i2].parent = this;
+            }
+          };
+          SharedTextMarker.prototype.clear = function () {
+            if (this.explicitlyCleared) {
+              return;
+            }
+            this.explicitlyCleared = true;
+            for (var i2 = 0; i2 < this.markers.length; ++i2) {
+              this.markers[i2].clear();
+            }
+            signalLater(this, "clear");
+          };
+          SharedTextMarker.prototype.find = function (side, lineObj) {
+            return this.primary.find(side, lineObj);
+          };
+          eventMixin(SharedTextMarker);
+          function markTextShared(doc, from, to, options, type2) {
+            options = copyObj(options);
+            options.shared = false;
+            var markers = [markText(doc, from, to, options, type2)],
+              primary = markers[0];
+            var widget = options.widgetNode;
+            linkedDocs(doc, function (doc2) {
+              if (widget) {
+                options.widgetNode = widget.cloneNode(true);
+              }
+              markers.push(
+                markText(
+                  doc2,
+                  clipPos(doc2, from),
+                  clipPos(doc2, to),
+                  options,
+                  type2
+                )
+              );
+              for (var i2 = 0; i2 < doc2.linked.length; ++i2) {
+                if (doc2.linked[i2].isParent) {
+                  return;
+                }
+              }
+              primary = lst(markers);
+            });
+            return new SharedTextMarker(markers, primary);
+          }
+          function findSharedMarkers(doc) {
+            return doc.findMarks(
+              Pos(doc.first, 0),
+              doc.clipPos(Pos(doc.lastLine())),
+              function (m) {
+                return m.parent;
+              }
+            );
+          }
+          function copySharedMarkers(doc, markers) {
+            for (var i2 = 0; i2 < markers.length; i2++) {
+              var marker2 = markers[i2],
+                pos = marker2.find();
+              var mFrom = doc.clipPos(pos.from),
+                mTo = doc.clipPos(pos.to);
+              if (cmp(mFrom, mTo)) {
+                var subMark = markText(
+                  doc,
+                  mFrom,
+                  mTo,
+                  marker2.primary,
+                  marker2.primary.type
+                );
+                marker2.markers.push(subMark);
+                subMark.parent = marker2;
+              }
+            }
+          }
+          function detachSharedMarkers(markers) {
+            var loop = function (i3) {
+              var marker2 = markers[i3],
+                linked = [marker2.primary.doc];
+              linkedDocs(marker2.primary.doc, function (d) {
+                return linked.push(d);
+              });
+              for (var j = 0; j < marker2.markers.length; j++) {
+                var subMarker = marker2.markers[j];
+                if (indexOf(linked, subMarker.doc) == -1) {
+                  subMarker.parent = null;
+                  marker2.markers.splice(j--, 1);
+                }
+              }
+            };
+            for (var i2 = 0; i2 < markers.length; i2++) loop(i2);
+          }
+          var nextDocId = 0;
+          var Doc = function (text3, mode2, firstLine, lineSep, direction) {
+            if (!(this instanceof Doc)) {
+              return new Doc(text3, mode2, firstLine, lineSep, direction);
+            }
+            if (firstLine == null) {
+              firstLine = 0;
+            }
+            BranchChunk.call(this, [new LeafChunk([new Line("", null)])]);
+            this.first = firstLine;
+            this.scrollTop = this.scrollLeft = 0;
+            this.cantEdit = false;
+            this.cleanGeneration = 1;
+            this.modeFrontier = this.highlightFrontier = firstLine;
+            var start2 = Pos(firstLine, 0);
+            this.sel = simpleSelection(start2);
+            this.history = new History(null);
+            this.id = ++nextDocId;
+            this.modeOption = mode2;
+            this.lineSep = lineSep;
+            this.direction = direction == "rtl" ? "rtl" : "ltr";
+            this.extend = false;
+            if (typeof text3 == "string") {
+              text3 = this.splitLines(text3);
+            }
+            updateDoc(this, { from: start2, to: start2, text: text3 });
+            setSelection(this, simpleSelection(start2), sel_dontScroll);
+          };
+          Doc.prototype = createObj(BranchChunk.prototype, {
+            constructor: Doc,
+            iter: function (from, to, op) {
+              if (op) {
+                this.iterN(from - this.first, to - from, op);
+              } else {
+                this.iterN(this.first, this.first + this.size, from);
+              }
+            },
+            insert: function (at, lines) {
+              var height = 0;
+              for (var i2 = 0; i2 < lines.length; ++i2) {
+                height += lines[i2].height;
+              }
+              this.insertInner(at - this.first, lines, height);
+            },
+            remove: function (at, n2) {
+              this.removeInner(at - this.first, n2);
+            },
+            getValue: function (lineSep) {
+              var lines = getLines2(this, this.first, this.first + this.size);
+              if (lineSep === false) {
+                return lines;
+              }
+              return lines.join(lineSep || this.lineSeparator());
+            },
+            setValue: docMethodOp(function (code3) {
+              var top2 = Pos(this.first, 0),
+                last = this.first + this.size - 1;
+              makeChange(
+                this,
+                {
+                  from: top2,
+                  to: Pos(last, getLine2(this, last).text.length),
+                  text: this.splitLines(code3),
+                  origin: "setValue",
+                  full: true,
+                },
+                true
+              );
+              if (this.cm) {
+                scrollToCoords(this.cm, 0, 0);
+              }
+              setSelection(this, simpleSelection(top2), sel_dontScroll);
+            }),
+            replaceRange: function (code3, from, to, origin) {
+              from = clipPos(this, from);
+              to = to ? clipPos(this, to) : from;
+              replaceRange(this, code3, from, to, origin);
+            },
+            getRange: function (from, to, lineSep) {
+              var lines = getBetween(
+                this,
+                clipPos(this, from),
+                clipPos(this, to)
+              );
+              if (lineSep === false) {
+                return lines;
+              }
+              if (lineSep === "") {
+                return lines.join("");
+              }
+              return lines.join(lineSep || this.lineSeparator());
+            },
+            getLine: function (line) {
+              var l2 = this.getLineHandle(line);
+              return l2 && l2.text;
+            },
+            getLineHandle: function (line) {
+              if (isLine(this, line)) {
+                return getLine2(this, line);
+              }
+            },
+            getLineNumber: function (line) {
+              return lineNo(line);
+            },
+            getLineHandleVisualStart: function (line) {
+              if (typeof line == "number") {
+                line = getLine2(this, line);
+              }
+              return visualLine(line);
+            },
+            lineCount: function () {
+              return this.size;
+            },
+            firstLine: function () {
+              return this.first;
+            },
+            lastLine: function () {
+              return this.first + this.size - 1;
+            },
+            clipPos: function (pos) {
+              return clipPos(this, pos);
+            },
+            getCursor: function (start2) {
+              var range3 = this.sel.primary(),
+                pos;
+              if (start2 == null || start2 == "head") {
+                pos = range3.head;
+              } else if (start2 == "anchor") {
+                pos = range3.anchor;
+              } else if (
+                start2 == "end" ||
+                start2 == "to" ||
+                start2 === false
+              ) {
+                pos = range3.to();
+              } else {
+                pos = range3.from();
+              }
+              return pos;
+            },
+            listSelections: function () {
+              return this.sel.ranges;
+            },
+            somethingSelected: function () {
+              return this.sel.somethingSelected();
+            },
+            setCursor: docMethodOp(function (line, ch2, options) {
+              setSimpleSelection(
+                this,
+                clipPos(
+                  this,
+                  typeof line == "number" ? Pos(line, ch2 || 0) : line
+                ),
+                null,
+                options
+              );
+            }),
+            setSelection: docMethodOp(function (anchor, head, options) {
+              setSimpleSelection(
+                this,
+                clipPos(this, anchor),
+                clipPos(this, head || anchor),
+                options
+              );
+            }),
+            extendSelection: docMethodOp(function (head, other, options) {
+              extendSelection(
+                this,
+                clipPos(this, head),
+                other && clipPos(this, other),
+                options
+              );
+            }),
+            extendSelections: docMethodOp(function (heads, options) {
+              extendSelections(this, clipPosArray(this, heads), options);
+            }),
+            extendSelectionsBy: docMethodOp(function (f, options) {
+              var heads = map2(this.sel.ranges, f);
+              extendSelections(this, clipPosArray(this, heads), options);
+            }),
+            setSelections: docMethodOp(function (ranges, primary, options) {
+              if (!ranges.length) {
+                return;
+              }
+              var out = [];
+              for (var i2 = 0; i2 < ranges.length; i2++) {
+                out[i2] = new Range2(
+                  clipPos(this, ranges[i2].anchor),
+                  clipPos(this, ranges[i2].head || ranges[i2].anchor)
+                );
+              }
+              if (primary == null) {
+                primary = Math.min(ranges.length - 1, this.sel.primIndex);
+              }
+              setSelection(
+                this,
+                normalizeSelection(this.cm, out, primary),
+                options
+              );
+            }),
+            addSelection: docMethodOp(function (anchor, head, options) {
+              var ranges = this.sel.ranges.slice(0);
+              ranges.push(
+                new Range2(clipPos(this, anchor), clipPos(this, head || anchor))
+              );
+              setSelection(
+                this,
+                normalizeSelection(this.cm, ranges, ranges.length - 1),
+                options
+              );
+            }),
+            getSelection: function (lineSep) {
+              var ranges = this.sel.ranges,
+                lines;
+              for (var i2 = 0; i2 < ranges.length; i2++) {
+                var sel = getBetween(this, ranges[i2].from(), ranges[i2].to());
+                lines = lines ? lines.concat(sel) : sel;
+              }
+              if (lineSep === false) {
+                return lines;
+              } else {
+                return lines.join(lineSep || this.lineSeparator());
+              }
+            },
+            getSelections: function (lineSep) {
+              var parts = [],
+                ranges = this.sel.ranges;
+              for (var i2 = 0; i2 < ranges.length; i2++) {
+                var sel = getBetween(this, ranges[i2].from(), ranges[i2].to());
+                if (lineSep !== false) {
+                  sel = sel.join(lineSep || this.lineSeparator());
+                }
+                parts[i2] = sel;
+              }
+              return parts;
+            },
+            replaceSelection: function (code3, collapse, origin) {
+              var dup = [];
+              for (var i2 = 0; i2 < this.sel.ranges.length; i2++) {
+                dup[i2] = code3;
+              }
+              this.replaceSelections(dup, collapse, origin || "+input");
+            },
+            replaceSelections: docMethodOp(function (code3, collapse, origin) {
+              var changes = [],
+                sel = this.sel;
+              for (var i2 = 0; i2 < sel.ranges.length; i2++) {
+                var range3 = sel.ranges[i2];
+                changes[i2] = {
+                  from: range3.from(),
+                  to: range3.to(),
+                  text: this.splitLines(code3[i2]),
+                  origin,
+                };
+              }
+              var newSel =
+                collapse &&
+                collapse != "end" &&
+                computeReplacedSel(this, changes, collapse);
+              for (var i$12 = changes.length - 1; i$12 >= 0; i$12--) {
+                makeChange(this, changes[i$12]);
+              }
+              if (newSel) {
+                setSelectionReplaceHistory(this, newSel);
+              } else if (this.cm) {
+                ensureCursorVisible(this.cm);
+              }
+            }),
+            undo: docMethodOp(function () {
+              makeChangeFromHistory(this, "undo");
+            }),
+            redo: docMethodOp(function () {
+              makeChangeFromHistory(this, "redo");
+            }),
+            undoSelection: docMethodOp(function () {
+              makeChangeFromHistory(this, "undo", true);
+            }),
+            redoSelection: docMethodOp(function () {
+              makeChangeFromHistory(this, "redo", true);
+            }),
+            setExtending: function (val) {
+              this.extend = val;
+            },
+            getExtending: function () {
+              return this.extend;
+            },
+            historySize: function () {
+              var hist = this.history,
+                done = 0,
+                undone = 0;
+              for (var i2 = 0; i2 < hist.done.length; i2++) {
+                if (!hist.done[i2].ranges) {
+                  ++done;
+                }
+              }
+              for (var i$12 = 0; i$12 < hist.undone.length; i$12++) {
+                if (!hist.undone[i$12].ranges) {
+                  ++undone;
+                }
+              }
+              return { undo: done, redo: undone };
+            },
+            clearHistory: function () {
+              var this$1$1 = this;
+              this.history = new History(this.history);
+              linkedDocs(
+                this,
+                function (doc) {
+                  return (doc.history = this$1$1.history);
+                },
+                true
+              );
+            },
+            markClean: function () {
+              this.cleanGeneration = this.changeGeneration(true);
+            },
+            changeGeneration: function (forceSplit) {
+              if (forceSplit) {
+                this.history.lastOp =
+                  this.history.lastSelOp =
+                  this.history.lastOrigin =
+                    null;
+              }
+              return this.history.generation;
+            },
+            isClean: function (gen) {
+              return this.history.generation == (gen || this.cleanGeneration);
+            },
+            getHistory: function () {
+              return {
+                done: copyHistoryArray(this.history.done),
+                undone: copyHistoryArray(this.history.undone),
+              };
+            },
+            setHistory: function (histData) {
+              var hist = (this.history = new History(this.history));
+              hist.done = copyHistoryArray(histData.done.slice(0), null, true);
+              hist.undone = copyHistoryArray(
+                histData.undone.slice(0),
+                null,
+                true
+              );
+            },
+            setGutterMarker: docMethodOp(function (line, gutterID, value) {
+              return changeLine(this, line, "gutter", function (line2) {
+                var markers = line2.gutterMarkers || (line2.gutterMarkers = {});
+                markers[gutterID] = value;
+                if (!value && isEmpty2(markers)) {
+                  line2.gutterMarkers = null;
+                }
+                return true;
+              });
+            }),
+            clearGutter: docMethodOp(function (gutterID) {
+              var this$1$1 = this;
+              this.iter(function (line) {
+                if (line.gutterMarkers && line.gutterMarkers[gutterID]) {
+                  changeLine(this$1$1, line, "gutter", function () {
+                    line.gutterMarkers[gutterID] = null;
+                    if (isEmpty2(line.gutterMarkers)) {
+                      line.gutterMarkers = null;
+                    }
+                    return true;
+                  });
+                }
+              });
+            }),
+            lineInfo: function (line) {
+              var n2;
+              if (typeof line == "number") {
+                if (!isLine(this, line)) {
+                  return null;
+                }
+                n2 = line;
+                line = getLine2(this, line);
+                if (!line) {
+                  return null;
+                }
+              } else {
+                n2 = lineNo(line);
+                if (n2 == null) {
+                  return null;
+                }
+              }
+              return {
+                line: n2,
+                handle: line,
+                text: line.text,
+                gutterMarkers: line.gutterMarkers,
+                textClass: line.textClass,
+                bgClass: line.bgClass,
+                wrapClass: line.wrapClass,
+                widgets: line.widgets,
+              };
+            },
+            addLineClass: docMethodOp(function (handle, where, cls) {
+              return changeLine(
+                this,
+                handle,
+                where == "gutter" ? "gutter" : "class",
+                function (line) {
+                  var prop3 =
+                    where == "text"
+                      ? "textClass"
+                      : where == "background"
+                      ? "bgClass"
+                      : where == "gutter"
+                      ? "gutterClass"
+                      : "wrapClass";
+                  if (!line[prop3]) {
+                    line[prop3] = cls;
+                  } else if (classTest(cls).test(line[prop3])) {
+                    return false;
+                  } else {
+                    line[prop3] += " " + cls;
+                  }
+                  return true;
+                }
+              );
+            }),
+            removeLineClass: docMethodOp(function (handle, where, cls) {
+              return changeLine(
+                this,
+                handle,
+                where == "gutter" ? "gutter" : "class",
+                function (line) {
+                  var prop3 =
+                    where == "text"
+                      ? "textClass"
+                      : where == "background"
+                      ? "bgClass"
+                      : where == "gutter"
+                      ? "gutterClass"
+                      : "wrapClass";
+                  var cur = line[prop3];
+                  if (!cur) {
+                    return false;
+                  } else if (cls == null) {
+                    line[prop3] = null;
+                  } else {
+                    var found = cur.match(classTest(cls));
+                    if (!found) {
+                      return false;
+                    }
+                    var end2 = found.index + found[0].length;
+                    line[prop3] =
+                      cur.slice(0, found.index) +
+                        (!found.index || end2 == cur.length ? "" : " ") +
+                        cur.slice(end2) || null;
+                  }
+                  return true;
+                }
+              );
+            }),
+            addLineWidget: docMethodOp(function (handle, node, options) {
+              return addLineWidget(this, handle, node, options);
+            }),
+            removeLineWidget: function (widget) {
+              widget.clear();
+            },
+            markText: function (from, to, options) {
+              return markText(
+                this,
+                clipPos(this, from),
+                clipPos(this, to),
+                options,
+                (options && options.type) || "range"
+              );
+            },
+            setBookmark: function (pos, options) {
+              var realOpts = {
+                replacedWith:
+                  options &&
+                  (options.nodeType == null ? options.widget : options),
+                insertLeft: options && options.insertLeft,
+                clearWhenEmpty: false,
+                shared: options && options.shared,
+                handleMouseEvents: options && options.handleMouseEvents,
+              };
+              pos = clipPos(this, pos);
+              return markText(this, pos, pos, realOpts, "bookmark");
+            },
+            findMarksAt: function (pos) {
+              pos = clipPos(this, pos);
+              var markers = [],
+                spans = getLine2(this, pos.line).markedSpans;
+              if (spans) {
+                for (var i2 = 0; i2 < spans.length; ++i2) {
+                  var span = spans[i2];
+                  if (
+                    (span.from == null || span.from <= pos.ch) &&
+                    (span.to == null || span.to >= pos.ch)
+                  ) {
+                    markers.push(span.marker.parent || span.marker);
+                  }
+                }
+              }
+              return markers;
+            },
+            findMarks: function (from, to, filter) {
+              from = clipPos(this, from);
+              to = clipPos(this, to);
+              var found = [],
+                lineNo2 = from.line;
+              this.iter(from.line, to.line + 1, function (line) {
+                var spans = line.markedSpans;
+                if (spans) {
+                  for (var i2 = 0; i2 < spans.length; i2++) {
+                    var span = spans[i2];
+                    if (
+                      !(
+                        (span.to != null &&
+                          lineNo2 == from.line &&
+                          from.ch >= span.to) ||
+                        (span.from == null && lineNo2 != from.line) ||
+                        (span.from != null &&
+                          lineNo2 == to.line &&
+                          span.from >= to.ch)
+                      ) &&
+                      (!filter || filter(span.marker))
+                    ) {
+                      found.push(span.marker.parent || span.marker);
+                    }
+                  }
+                }
+                ++lineNo2;
+              });
+              return found;
+            },
+            getAllMarks: function () {
+              var markers = [];
+              this.iter(function (line) {
+                var sps = line.markedSpans;
+                if (sps) {
+                  for (var i2 = 0; i2 < sps.length; ++i2) {
+                    if (sps[i2].from != null) {
+                      markers.push(sps[i2].marker);
+                    }
+                  }
+                }
+              });
+              return markers;
+            },
+            posFromIndex: function (off2) {
+              var ch2,
+                lineNo2 = this.first,
+                sepSize = this.lineSeparator().length;
+              this.iter(function (line) {
+                var sz = line.text.length + sepSize;
+                if (sz > off2) {
+                  ch2 = off2;
+                  return true;
+                }
+                off2 -= sz;
+                ++lineNo2;
+              });
+              return clipPos(this, Pos(lineNo2, ch2));
+            },
+            indexFromPos: function (coords) {
+              coords = clipPos(this, coords);
+              var index = coords.ch;
+              if (coords.line < this.first || coords.ch < 0) {
+                return 0;
+              }
+              var sepSize = this.lineSeparator().length;
+              this.iter(this.first, coords.line, function (line) {
+                index += line.text.length + sepSize;
+              });
+              return index;
+            },
+            copy: function (copyHistory) {
+              var doc = new Doc(
+                getLines2(this, this.first, this.first + this.size),
+                this.modeOption,
+                this.first,
+                this.lineSep,
+                this.direction
+              );
+              doc.scrollTop = this.scrollTop;
+              doc.scrollLeft = this.scrollLeft;
+              doc.sel = this.sel;
+              doc.extend = false;
+              if (copyHistory) {
+                doc.history.undoDepth = this.history.undoDepth;
+                doc.setHistory(this.getHistory());
+              }
+              return doc;
+            },
+            linkedDoc: function (options) {
+              if (!options) {
+                options = {};
+              }
+              var from = this.first,
+                to = this.first + this.size;
+              if (options.from != null && options.from > from) {
+                from = options.from;
+              }
+              if (options.to != null && options.to < to) {
+                to = options.to;
+              }
+              var copy2 = new Doc(
+                getLines2(this, from, to),
+                options.mode || this.modeOption,
+                from,
+                this.lineSep,
+                this.direction
+              );
+              if (options.sharedHist) {
+                copy2.history = this.history;
+              }
+              (this.linked || (this.linked = [])).push({
+                doc: copy2,
+                sharedHist: options.sharedHist,
+              });
+              copy2.linked = [
+                { doc: this, isParent: true, sharedHist: options.sharedHist },
+              ];
+              copySharedMarkers(copy2, findSharedMarkers(this));
+              return copy2;
+            },
+            unlinkDoc: function (other) {
+              if (other instanceof CodeMirror) {
+                other = other.doc;
+              }
+              if (this.linked) {
+                for (var i2 = 0; i2 < this.linked.length; ++i2) {
+                  var link3 = this.linked[i2];
+                  if (link3.doc != other) {
+                    continue;
+                  }
+                  this.linked.splice(i2, 1);
+                  other.unlinkDoc(this);
+                  detachSharedMarkers(findSharedMarkers(this));
+                  break;
+                }
+              }
+              if (other.history == this.history) {
+                var splitIds = [other.id];
+                linkedDocs(
+                  other,
+                  function (doc) {
+                    return splitIds.push(doc.id);
+                  },
+                  true
+                );
+                other.history = new History(null);
+                other.history.done = copyHistoryArray(
+                  this.history.done,
+                  splitIds
+                );
+                other.history.undone = copyHistoryArray(
+                  this.history.undone,
+                  splitIds
+                );
+              }
+            },
+            iterLinkedDocs: function (f) {
+              linkedDocs(this, f);
+            },
+            getMode: function () {
+              return this.mode;
+            },
+            getEditor: function () {
+              return this.cm;
+            },
+            splitLines: function (str) {
+              if (this.lineSep) {
+                return str.split(this.lineSep);
+              }
+              return splitLinesAuto(str);
+            },
+            lineSeparator: function () {
+              return this.lineSep || "\n";
+            },
+            setDirection: docMethodOp(function (dir) {
+              if (dir != "rtl") {
+                dir = "ltr";
+              }
+              if (dir == this.direction) {
+                return;
+              }
+              this.direction = dir;
+              this.iter(function (line) {
+                return (line.order = null);
+              });
+              if (this.cm) {
+                directionChanged(this.cm);
+              }
+            }),
+          });
+          Doc.prototype.eachLine = Doc.prototype.iter;
+          var lastDrop = 0;
+          function onDrop(e) {
+            var cm = this;
+            clearDragCursor(cm);
+            if (signalDOMEvent(cm, e) || eventInWidget(cm.display, e)) {
+              return;
+            }
+            e_preventDefault(e);
+            if (ie2) {
+              lastDrop = +new Date();
+            }
+            var pos = posFromMouse(cm, e, true),
+              files = e.dataTransfer.files;
+            if (!pos || cm.isReadOnly()) {
+              return;
+            }
+            if (files && files.length && window.FileReader && window.File) {
+              var n2 = files.length,
+                text3 = Array(n2),
+                read = 0;
+              var markAsReadAndPasteIfAllFilesAreRead = function () {
+                if (++read == n2) {
+                  operation(cm, function () {
+                    pos = clipPos(cm.doc, pos);
+                    var change = {
+                      from: pos,
+                      to: pos,
+                      text: cm.doc.splitLines(
+                        text3
+                          .filter(function (t2) {
+                            return t2 != null;
+                          })
+                          .join(cm.doc.lineSeparator())
+                      ),
+                      origin: "paste",
+                    };
+                    makeChange(cm.doc, change);
+                    setSelectionReplaceHistory(
+                      cm.doc,
+                      simpleSelection(
+                        clipPos(cm.doc, pos),
+                        clipPos(cm.doc, changeEnd(change))
+                      )
+                    );
+                  })();
+                }
+              };
+              var readTextFromFile = function (file, i3) {
+                if (
+                  cm.options.allowDropFileTypes &&
+                  indexOf(cm.options.allowDropFileTypes, file.type) == -1
+                ) {
+                  markAsReadAndPasteIfAllFilesAreRead();
+                  return;
+                }
+                var reader = new FileReader();
+                reader.onerror = function () {
+                  return markAsReadAndPasteIfAllFilesAreRead();
+                };
+                reader.onload = function () {
+                  var content = reader.result;
+                  if (/[\x00-\x08\x0e-\x1f]{2}/.test(content)) {
+                    markAsReadAndPasteIfAllFilesAreRead();
+                    return;
+                  }
+                  text3[i3] = content;
+                  markAsReadAndPasteIfAllFilesAreRead();
+                };
+                reader.readAsText(file);
+              };
+              for (var i2 = 0; i2 < files.length; i2++) {
+                readTextFromFile(files[i2], i2);
+              }
+            } else {
+              if (cm.state.draggingText && cm.doc.sel.contains(pos) > -1) {
+                cm.state.draggingText(e);
+                setTimeout(function () {
+                  return cm.display.input.focus();
+                }, 20);
+                return;
+              }
+              try {
+                var text$12 = e.dataTransfer.getData("Text");
+                if (text$12) {
+                  var selected;
+                  if (cm.state.draggingText && !cm.state.draggingText.copy) {
+                    selected = cm.listSelections();
+                  }
+                  setSelectionNoUndo(cm.doc, simpleSelection(pos, pos));
+                  if (selected) {
+                    for (var i$12 = 0; i$12 < selected.length; ++i$12) {
+                      replaceRange(
+                        cm.doc,
+                        "",
+                        selected[i$12].anchor,
+                        selected[i$12].head,
+                        "drag"
+                      );
+                    }
+                  }
+                  cm.replaceSelection(text$12, "around", "paste");
+                  cm.display.input.focus();
+                }
+              } catch (e$1) {}
+            }
+          }
+          function onDragStart(cm, e) {
+            if (
+              ie2 &&
+              (!cm.state.draggingText || +new Date() - lastDrop < 100)
+            ) {
+              e_stop(e);
+              return;
+            }
+            if (signalDOMEvent(cm, e) || eventInWidget(cm.display, e)) {
+              return;
+            }
+            e.dataTransfer.setData("Text", cm.getSelection());
+            e.dataTransfer.effectAllowed = "copyMove";
+            if (e.dataTransfer.setDragImage && !safari) {
+              var img = elt(
+                "img",
+                null,
+                null,
+                "position: fixed; left: 0; top: 0;"
+              );
+              img.src =
+                "data:image/gif;base64,R0lGODlhAQABAAAAACH5BAEKAAEALAAAAAABAAEAAAICTAEAOw==";
+              if (presto) {
+                img.width = img.height = 1;
+                cm.display.wrapper.appendChild(img);
+                img._top = img.offsetTop;
+              }
+              e.dataTransfer.setDragImage(img, 0, 0);
+              if (presto) {
+                img.parentNode.removeChild(img);
+              }
+            }
+          }
+          function onDragOver(cm, e) {
+            var pos = posFromMouse(cm, e);
+            if (!pos) {
+              return;
+            }
+            var frag = document.createDocumentFragment();
+            drawSelectionCursor(cm, pos, frag);
+            if (!cm.display.dragCursor) {
+              cm.display.dragCursor = elt(
+                "div",
+                null,
+                "CodeMirror-cursors CodeMirror-dragcursors"
+              );
+              cm.display.lineSpace.insertBefore(
+                cm.display.dragCursor,
+                cm.display.cursorDiv
+              );
+            }
+            removeChildrenAndAdd(cm.display.dragCursor, frag);
+          }
+          function clearDragCursor(cm) {
+            if (cm.display.dragCursor) {
+              cm.display.lineSpace.removeChild(cm.display.dragCursor);
+              cm.display.dragCursor = null;
+            }
+          }
+          function forEachCodeMirror(f) {
+            if (!document.getElementsByClassName) {
+              return;
+            }
+            var byClass = document.getElementsByClassName("CodeMirror"),
+              editors = [];
+            for (var i2 = 0; i2 < byClass.length; i2++) {
+              var cm = byClass[i2].CodeMirror;
+              if (cm) {
+                editors.push(cm);
+              }
+            }
+            if (editors.length) {
+              editors[0].operation(function () {
+                for (var i3 = 0; i3 < editors.length; i3++) {
+                  f(editors[i3]);
+                }
+              });
+            }
+          }
+          var globalsRegistered = false;
+          function ensureGlobalHandlers() {
+            if (globalsRegistered) {
+              return;
+            }
+            registerGlobalHandlers();
+            globalsRegistered = true;
+          }
+          function registerGlobalHandlers() {
+            var resizeTimer;
+            on(window, "resize", function () {
+              if (resizeTimer == null) {
+                resizeTimer = setTimeout(function () {
+                  resizeTimer = null;
+                  forEachCodeMirror(onResize);
+                }, 100);
+              }
+            });
+            on(window, "blur", function () {
+              return forEachCodeMirror(onBlur);
+            });
+          }
+          function onResize(cm) {
+            var d = cm.display;
+            d.cachedCharWidth = d.cachedTextHeight = d.cachedPaddingH = null;
+            d.scrollbarsClipped = false;
+            cm.setSize();
+          }
+          var keyNames = {
+            3: "Pause",
+            8: "Backspace",
+            9: "Tab",
+            13: "Enter",
+            16: "Shift",
+            17: "Ctrl",
+            18: "Alt",
+            19: "Pause",
+            20: "CapsLock",
+            27: "Esc",
+            32: "Space",
+            33: "PageUp",
+            34: "PageDown",
+            35: "End",
+            36: "Home",
+            37: "Left",
+            38: "Up",
+            39: "Right",
+            40: "Down",
+            44: "PrintScrn",
+            45: "Insert",
+            46: "Delete",
+            59: ";",
+            61: "=",
+            91: "Mod",
+            92: "Mod",
+            93: "Mod",
+            106: "*",
+            107: "=",
+            109: "-",
+            110: ".",
+            111: "/",
+            145: "ScrollLock",
+            173: "-",
+            186: ";",
+            187: "=",
+            188: ",",
+            189: "-",
+            190: ".",
+            191: "/",
+            192: "`",
+            219: "[",
+            220: "\\",
+            221: "]",
+            222: "'",
+            224: "Mod",
+            63232: "Up",
+            63233: "Down",
+            63234: "Left",
+            63235: "Right",
+            63272: "Delete",
+            63273: "Home",
+            63275: "End",
+            63276: "PageUp",
+            63277: "PageDown",
+            63302: "Insert",
+          };
+          for (var i = 0; i < 10; i++) {
+            keyNames[i + 48] = keyNames[i + 96] = String(i);
+          }
+          for (var i$1 = 65; i$1 <= 90; i$1++) {
+            keyNames[i$1] = String.fromCharCode(i$1);
+          }
+          for (var i$2 = 1; i$2 <= 12; i$2++) {
+            keyNames[i$2 + 111] = keyNames[i$2 + 63235] = "F" + i$2;
+          }
+          var keyMap2 = {};
+          keyMap2.basic = {
+            Left: "goCharLeft",
+            Right: "goCharRight",
+            Up: "goLineUp",
+            Down: "goLineDown",
+            End: "goLineEnd",
+            Home: "goLineStartSmart",
+            PageUp: "goPageUp",
+            PageDown: "goPageDown",
+            Delete: "delCharAfter",
+            Backspace: "delCharBefore",
+            "Shift-Backspace": "delCharBefore",
+            Tab: "defaultTab",
+            "Shift-Tab": "indentAuto",
+            Enter: "newlineAndIndent",
+            Insert: "toggleOverwrite",
+            Esc: "singleSelection",
+          };
+          keyMap2.pcDefault = {
+            "Ctrl-A": "selectAll",
+            "Ctrl-D": "deleteLine",
+            "Ctrl-Z": "undo",
+            "Shift-Ctrl-Z": "redo",
+            "Ctrl-Y": "redo",
+            "Ctrl-Home": "goDocStart",
+            "Ctrl-End": "goDocEnd",
+            "Ctrl-Up": "goLineUp",
+            "Ctrl-Down": "goLineDown",
+            "Ctrl-Left": "goGroupLeft",
+            "Ctrl-Right": "goGroupRight",
+            "Alt-Left": "goLineStart",
+            "Alt-Right": "goLineEnd",
+            "Ctrl-Backspace": "delGroupBefore",
+            "Ctrl-Delete": "delGroupAfter",
+            "Ctrl-S": "save",
+            "Ctrl-F": "find",
+            "Ctrl-G": "findNext",
+            "Shift-Ctrl-G": "findPrev",
+            "Shift-Ctrl-F": "replace",
+            "Shift-Ctrl-R": "replaceAll",
+            "Ctrl-[": "indentLess",
+            "Ctrl-]": "indentMore",
+            "Ctrl-U": "undoSelection",
+            "Shift-Ctrl-U": "redoSelection",
+            "Alt-U": "redoSelection",
+            fallthrough: "basic",
+          };
+          keyMap2.emacsy = {
+            "Ctrl-F": "goCharRight",
+            "Ctrl-B": "goCharLeft",
+            "Ctrl-P": "goLineUp",
+            "Ctrl-N": "goLineDown",
+            "Ctrl-A": "goLineStart",
+            "Ctrl-E": "goLineEnd",
+            "Ctrl-V": "goPageDown",
+            "Shift-Ctrl-V": "goPageUp",
+            "Ctrl-D": "delCharAfter",
+            "Ctrl-H": "delCharBefore",
+            "Alt-Backspace": "delWordBefore",
+            "Ctrl-K": "killLine",
+            "Ctrl-T": "transposeChars",
+            "Ctrl-O": "openLine",
+          };
+          keyMap2.macDefault = {
+            "Cmd-A": "selectAll",
+            "Cmd-D": "deleteLine",
+            "Cmd-Z": "undo",
+            "Shift-Cmd-Z": "redo",
+            "Cmd-Y": "redo",
+            "Cmd-Home": "goDocStart",
+            "Cmd-Up": "goDocStart",
+            "Cmd-End": "goDocEnd",
+            "Cmd-Down": "goDocEnd",
+            "Alt-Left": "goGroupLeft",
+            "Alt-Right": "goGroupRight",
+            "Cmd-Left": "goLineLeft",
+            "Cmd-Right": "goLineRight",
+            "Alt-Backspace": "delGroupBefore",
+            "Ctrl-Alt-Backspace": "delGroupAfter",
+            "Alt-Delete": "delGroupAfter",
+            "Cmd-S": "save",
+            "Cmd-F": "find",
+            "Cmd-G": "findNext",
+            "Shift-Cmd-G": "findPrev",
+            "Cmd-Alt-F": "replace",
+            "Shift-Cmd-Alt-F": "replaceAll",
+            "Cmd-[": "indentLess",
+            "Cmd-]": "indentMore",
+            "Cmd-Backspace": "delWrappedLineLeft",
+            "Cmd-Delete": "delWrappedLineRight",
+            "Cmd-U": "undoSelection",
+            "Shift-Cmd-U": "redoSelection",
+            "Ctrl-Up": "goDocStart",
+            "Ctrl-Down": "goDocEnd",
+            fallthrough: ["basic", "emacsy"],
+          };
+          keyMap2["default"] = mac ? keyMap2.macDefault : keyMap2.pcDefault;
+          function normalizeKeyName(name2) {
+            var parts = name2.split(/-(?!$)/);
+            name2 = parts[parts.length - 1];
+            var alt, ctrl, shift, cmd;
+            for (var i2 = 0; i2 < parts.length - 1; i2++) {
+              var mod = parts[i2];
+              if (/^(cmd|meta|m)$/i.test(mod)) {
+                cmd = true;
+              } else if (/^a(lt)?$/i.test(mod)) {
+                alt = true;
+              } else if (/^(c|ctrl|control)$/i.test(mod)) {
+                ctrl = true;
+              } else if (/^s(hift)?$/i.test(mod)) {
+                shift = true;
+              } else {
+                throw new Error("Unrecognized modifier name: " + mod);
+              }
+            }
+            if (alt) {
+              name2 = "Alt-" + name2;
+            }
+            if (ctrl) {
+              name2 = "Ctrl-" + name2;
+            }
+            if (cmd) {
+              name2 = "Cmd-" + name2;
+            }
+            if (shift) {
+              name2 = "Shift-" + name2;
+            }
+            return name2;
+          }
+          function normalizeKeyMap(keymap) {
+            var copy2 = {};
+            for (var keyname in keymap) {
+              if (keymap.hasOwnProperty(keyname)) {
+                var value = keymap[keyname];
+                if (/^(name|fallthrough|(de|at)tach)$/.test(keyname)) {
+                  continue;
+                }
+                if (value == "...") {
+                  delete keymap[keyname];
+                  continue;
+                }
+                var keys = map2(keyname.split(" "), normalizeKeyName);
+                for (var i2 = 0; i2 < keys.length; i2++) {
+                  var val = void 0,
+                    name2 = void 0;
+                  if (i2 == keys.length - 1) {
+                    name2 = keys.join(" ");
+                    val = value;
+                  } else {
+                    name2 = keys.slice(0, i2 + 1).join(" ");
+                    val = "...";
+                  }
+                  var prev = copy2[name2];
+                  if (!prev) {
+                    copy2[name2] = val;
+                  } else if (prev != val) {
+                    throw new Error("Inconsistent bindings for " + name2);
+                  }
+                }
+                delete keymap[keyname];
+              }
+            }
+            for (var prop3 in copy2) {
+              keymap[prop3] = copy2[prop3];
+            }
+            return keymap;
+          }
+          function lookupKey(key, map3, handle, context) {
+            map3 = getKeyMap(map3);
+            var found = map3.call ? map3.call(key, context) : map3[key];
+            if (found === false) {
+              return "nothing";
+            }
+            if (found === "...") {
+              return "multi";
+            }
+            if (found != null && handle(found)) {
+              return "handled";
+            }
+            if (map3.fallthrough) {
+              if (
+                Object.prototype.toString.call(map3.fallthrough) !=
+                "[object Array]"
+              ) {
+                return lookupKey(key, map3.fallthrough, handle, context);
+              }
+              for (var i2 = 0; i2 < map3.fallthrough.length; i2++) {
+                var result2 = lookupKey(
+                  key,
+                  map3.fallthrough[i2],
+                  handle,
+                  context
+                );
+                if (result2) {
+                  return result2;
+                }
+              }
+            }
+          }
+          function isModifierKey(value) {
+            var name2 =
+              typeof value == "string" ? value : keyNames[value.keyCode];
+            return (
+              name2 == "Ctrl" ||
+              name2 == "Alt" ||
+              name2 == "Shift" ||
+              name2 == "Mod"
+            );
+          }
+          function addModifierNames(name2, event, noShift) {
+            var base2 = name2;
+            if (event.altKey && base2 != "Alt") {
+              name2 = "Alt-" + name2;
+            }
+            if (
+              (flipCtrlCmd ? event.metaKey : event.ctrlKey) &&
+              base2 != "Ctrl"
+            ) {
+              name2 = "Ctrl-" + name2;
+            }
+            if (
+              (flipCtrlCmd ? event.ctrlKey : event.metaKey) &&
+              base2 != "Mod"
+            ) {
+              name2 = "Cmd-" + name2;
+            }
+            if (!noShift && event.shiftKey && base2 != "Shift") {
+              name2 = "Shift-" + name2;
+            }
+            return name2;
+          }
+          function keyName(event, noShift) {
+            if (presto && event.keyCode == 34 && event["char"]) {
+              return false;
+            }
+            var name2 = keyNames[event.keyCode];
+            if (name2 == null || event.altGraphKey) {
+              return false;
+            }
+            if (event.keyCode == 3 && event.code) {
+              name2 = event.code;
+            }
+            return addModifierNames(name2, event, noShift);
+          }
+          function getKeyMap(val) {
+            return typeof val == "string" ? keyMap2[val] : val;
+          }
+          function deleteNearSelection(cm, compute) {
+            var ranges = cm.doc.sel.ranges,
+              kill = [];
+            for (var i2 = 0; i2 < ranges.length; i2++) {
+              var toKill = compute(ranges[i2]);
+              while (kill.length && cmp(toKill.from, lst(kill).to) <= 0) {
+                var replaced = kill.pop();
+                if (cmp(replaced.from, toKill.from) < 0) {
+                  toKill.from = replaced.from;
+                  break;
+                }
+              }
+              kill.push(toKill);
+            }
+            runInOp(cm, function () {
+              for (var i3 = kill.length - 1; i3 >= 0; i3--) {
+                replaceRange(cm.doc, "", kill[i3].from, kill[i3].to, "+delete");
+              }
+              ensureCursorVisible(cm);
+            });
+          }
+          function moveCharLogically(line, ch2, dir) {
+            var target2 = skipExtendingChars(line.text, ch2 + dir, dir);
+            return target2 < 0 || target2 > line.text.length ? null : target2;
+          }
+          function moveLogically(line, start2, dir) {
+            var ch2 = moveCharLogically(line, start2.ch, dir);
+            return ch2 == null
+              ? null
+              : new Pos(start2.line, ch2, dir < 0 ? "after" : "before");
+          }
+          function endOfLine(visually, cm, lineObj, lineNo2, dir) {
+            if (visually) {
+              if (cm.doc.direction == "rtl") {
+                dir = -dir;
+              }
+              var order2 = getOrder(lineObj, cm.doc.direction);
+              if (order2) {
+                var part2 = dir < 0 ? lst(order2) : order2[0];
+                var moveInStorageOrder = dir < 0 == (part2.level == 1);
+                var sticky = moveInStorageOrder ? "after" : "before";
+                var ch2;
+                if (part2.level > 0 || cm.doc.direction == "rtl") {
+                  var prep = prepareMeasureForLine(cm, lineObj);
+                  ch2 = dir < 0 ? lineObj.text.length - 1 : 0;
+                  var targetTop = measureCharPrepared(cm, prep, ch2).top;
+                  ch2 = findFirst(
+                    function (ch3) {
+                      return (
+                        measureCharPrepared(cm, prep, ch3).top == targetTop
+                      );
+                    },
+                    dir < 0 == (part2.level == 1) ? part2.from : part2.to - 1,
+                    ch2
+                  );
+                  if (sticky == "before") {
+                    ch2 = moveCharLogically(lineObj, ch2, 1);
+                  }
+                } else {
+                  ch2 = dir < 0 ? part2.to : part2.from;
+                }
+                return new Pos(lineNo2, ch2, sticky);
+              }
+            }
+            return new Pos(
+              lineNo2,
+              dir < 0 ? lineObj.text.length : 0,
+              dir < 0 ? "before" : "after"
+            );
+          }
+          function moveVisually(cm, line, start2, dir) {
+            var bidi = getOrder(line, cm.doc.direction);
+            if (!bidi) {
+              return moveLogically(line, start2, dir);
+            }
+            if (start2.ch >= line.text.length) {
+              start2.ch = line.text.length;
+              start2.sticky = "before";
+            } else if (start2.ch <= 0) {
+              start2.ch = 0;
+              start2.sticky = "after";
+            }
+            var partPos = getBidiPartAt(bidi, start2.ch, start2.sticky),
+              part2 = bidi[partPos];
+            if (
+              cm.doc.direction == "ltr" &&
+              part2.level % 2 == 0 &&
+              (dir > 0 ? part2.to > start2.ch : part2.from < start2.ch)
+            ) {
+              return moveLogically(line, start2, dir);
+            }
+            var mv = function (pos, dir2) {
+              return moveCharLogically(
+                line,
+                pos instanceof Pos ? pos.ch : pos,
+                dir2
+              );
+            };
+            var prep;
+            var getWrappedLineExtent = function (ch3) {
+              if (!cm.options.lineWrapping) {
+                return { begin: 0, end: line.text.length };
+              }
+              prep = prep || prepareMeasureForLine(cm, line);
+              return wrappedLineExtentChar(cm, line, prep, ch3);
+            };
+            var wrappedLineExtent2 = getWrappedLineExtent(
+              start2.sticky == "before" ? mv(start2, -1) : start2.ch
+            );
+            if (cm.doc.direction == "rtl" || part2.level == 1) {
+              var moveInStorageOrder = (part2.level == 1) == dir < 0;
+              var ch2 = mv(start2, moveInStorageOrder ? 1 : -1);
+              if (
+                ch2 != null &&
+                (!moveInStorageOrder
+                  ? ch2 >= part2.from && ch2 >= wrappedLineExtent2.begin
+                  : ch2 <= part2.to && ch2 <= wrappedLineExtent2.end)
+              ) {
+                var sticky = moveInStorageOrder ? "before" : "after";
+                return new Pos(start2.line, ch2, sticky);
+              }
+            }
+            var searchInVisualLine = function (
+              partPos2,
+              dir2,
+              wrappedLineExtent3
+            ) {
+              var getRes = function (ch4, moveInStorageOrder3) {
+                return moveInStorageOrder3
+                  ? new Pos(start2.line, mv(ch4, 1), "before")
+                  : new Pos(start2.line, ch4, "after");
+              };
+              for (
+                ;
+                partPos2 >= 0 && partPos2 < bidi.length;
+                partPos2 += dir2
+              ) {
+                var part3 = bidi[partPos2];
+                var moveInStorageOrder2 = dir2 > 0 == (part3.level != 1);
+                var ch3 = moveInStorageOrder2
+                  ? wrappedLineExtent3.begin
+                  : mv(wrappedLineExtent3.end, -1);
+                if (part3.from <= ch3 && ch3 < part3.to) {
+                  return getRes(ch3, moveInStorageOrder2);
+                }
+                ch3 = moveInStorageOrder2 ? part3.from : mv(part3.to, -1);
+                if (
+                  wrappedLineExtent3.begin <= ch3 &&
+                  ch3 < wrappedLineExtent3.end
+                ) {
+                  return getRes(ch3, moveInStorageOrder2);
+                }
+              }
+            };
+            var res = searchInVisualLine(
+              partPos + dir,
+              dir,
+              wrappedLineExtent2
+            );
+            if (res) {
+              return res;
+            }
+            var nextCh =
+              dir > 0
+                ? wrappedLineExtent2.end
+                : mv(wrappedLineExtent2.begin, -1);
+            if (nextCh != null && !(dir > 0 && nextCh == line.text.length)) {
+              res = searchInVisualLine(
+                dir > 0 ? 0 : bidi.length - 1,
+                dir,
+                getWrappedLineExtent(nextCh)
+              );
+              if (res) {
+                return res;
+              }
+            }
+            return null;
+          }
+          var commands = {
+            selectAll,
+            singleSelection: function (cm) {
+              return cm.setSelection(
+                cm.getCursor("anchor"),
+                cm.getCursor("head"),
+                sel_dontScroll
+              );
+            },
+            killLine: function (cm) {
+              return deleteNearSelection(cm, function (range3) {
+                if (range3.empty()) {
+                  var len = getLine2(cm.doc, range3.head.line).text.length;
+                  if (
+                    range3.head.ch == len &&
+                    range3.head.line < cm.lastLine()
+                  ) {
+                    return {
+                      from: range3.head,
+                      to: Pos(range3.head.line + 1, 0),
+                    };
+                  } else {
+                    return {
+                      from: range3.head,
+                      to: Pos(range3.head.line, len),
+                    };
+                  }
+                } else {
+                  return { from: range3.from(), to: range3.to() };
+                }
+              });
+            },
+            deleteLine: function (cm) {
+              return deleteNearSelection(cm, function (range3) {
+                return {
+                  from: Pos(range3.from().line, 0),
+                  to: clipPos(cm.doc, Pos(range3.to().line + 1, 0)),
+                };
+              });
+            },
+            delLineLeft: function (cm) {
+              return deleteNearSelection(cm, function (range3) {
+                return {
+                  from: Pos(range3.from().line, 0),
+                  to: range3.from(),
+                };
+              });
+            },
+            delWrappedLineLeft: function (cm) {
+              return deleteNearSelection(cm, function (range3) {
+                var top2 = cm.charCoords(range3.head, "div").top + 5;
+                var leftPos = cm.coordsChar({ left: 0, top: top2 }, "div");
+                return { from: leftPos, to: range3.from() };
+              });
+            },
+            delWrappedLineRight: function (cm) {
+              return deleteNearSelection(cm, function (range3) {
+                var top2 = cm.charCoords(range3.head, "div").top + 5;
+                var rightPos = cm.coordsChar(
+                  { left: cm.display.lineDiv.offsetWidth + 100, top: top2 },
+                  "div"
+                );
+                return { from: range3.from(), to: rightPos };
+              });
+            },
+            undo: function (cm) {
+              return cm.undo();
+            },
+            redo: function (cm) {
+              return cm.redo();
+            },
+            undoSelection: function (cm) {
+              return cm.undoSelection();
+            },
+            redoSelection: function (cm) {
+              return cm.redoSelection();
+            },
+            goDocStart: function (cm) {
+              return cm.extendSelection(Pos(cm.firstLine(), 0));
+            },
+            goDocEnd: function (cm) {
+              return cm.extendSelection(Pos(cm.lastLine()));
+            },
+            goLineStart: function (cm) {
+              return cm.extendSelectionsBy(
+                function (range3) {
+                  return lineStart(cm, range3.head.line);
+                },
+                { origin: "+move", bias: 1 }
+              );
+            },
+            goLineStartSmart: function (cm) {
+              return cm.extendSelectionsBy(
+                function (range3) {
+                  return lineStartSmart(cm, range3.head);
+                },
+                { origin: "+move", bias: 1 }
+              );
+            },
+            goLineEnd: function (cm) {
+              return cm.extendSelectionsBy(
+                function (range3) {
+                  return lineEnd(cm, range3.head.line);
+                },
+                { origin: "+move", bias: -1 }
+              );
+            },
+            goLineRight: function (cm) {
+              return cm.extendSelectionsBy(function (range3) {
+                var top2 = cm.cursorCoords(range3.head, "div").top + 5;
+                return cm.coordsChar(
+                  { left: cm.display.lineDiv.offsetWidth + 100, top: top2 },
+                  "div"
+                );
+              }, sel_move);
+            },
+            goLineLeft: function (cm) {
+              return cm.extendSelectionsBy(function (range3) {
+                var top2 = cm.cursorCoords(range3.head, "div").top + 5;
+                return cm.coordsChar({ left: 0, top: top2 }, "div");
+              }, sel_move);
+            },
+            goLineLeftSmart: function (cm) {
+              return cm.extendSelectionsBy(function (range3) {
+                var top2 = cm.cursorCoords(range3.head, "div").top + 5;
+                var pos = cm.coordsChar({ left: 0, top: top2 }, "div");
+                if (pos.ch < cm.getLine(pos.line).search(/\S/)) {
+                  return lineStartSmart(cm, range3.head);
+                }
+                return pos;
+              }, sel_move);
+            },
+            goLineUp: function (cm) {
+              return cm.moveV(-1, "line");
+            },
+            goLineDown: function (cm) {
+              return cm.moveV(1, "line");
+            },
+            goPageUp: function (cm) {
+              return cm.moveV(-1, "page");
+            },
+            goPageDown: function (cm) {
+              return cm.moveV(1, "page");
+            },
+            goCharLeft: function (cm) {
+              return cm.moveH(-1, "char");
+            },
+            goCharRight: function (cm) {
+              return cm.moveH(1, "char");
+            },
+            goColumnLeft: function (cm) {
+              return cm.moveH(-1, "column");
+            },
+            goColumnRight: function (cm) {
+              return cm.moveH(1, "column");
+            },
+            goWordLeft: function (cm) {
+              return cm.moveH(-1, "word");
+            },
+            goGroupRight: function (cm) {
+              return cm.moveH(1, "group");
+            },
+            goGroupLeft: function (cm) {
+              return cm.moveH(-1, "group");
+            },
+            goWordRight: function (cm) {
+              return cm.moveH(1, "word");
+            },
+            delCharBefore: function (cm) {
+              return cm.deleteH(-1, "codepoint");
+            },
+            delCharAfter: function (cm) {
+              return cm.deleteH(1, "char");
+            },
+            delWordBefore: function (cm) {
+              return cm.deleteH(-1, "word");
+            },
+            delWordAfter: function (cm) {
+              return cm.deleteH(1, "word");
+            },
+            delGroupBefore: function (cm) {
+              return cm.deleteH(-1, "group");
+            },
+            delGroupAfter: function (cm) {
+              return cm.deleteH(1, "group");
+            },
+            indentAuto: function (cm) {
+              return cm.indentSelection("smart");
+            },
+            indentMore: function (cm) {
+              return cm.indentSelection("add");
+            },
+            indentLess: function (cm) {
+              return cm.indentSelection("subtract");
+            },
+            insertTab: function (cm) {
+              return cm.replaceSelection("	");
+            },
+            insertSoftTab: function (cm) {
+              var spaces = [],
+                ranges = cm.listSelections(),
+                tabSize = cm.options.tabSize;
+              for (var i2 = 0; i2 < ranges.length; i2++) {
+                var pos = ranges[i2].from();
+                var col = countColumn(cm.getLine(pos.line), pos.ch, tabSize);
+                spaces.push(spaceStr(tabSize - (col % tabSize)));
+              }
+              cm.replaceSelections(spaces);
+            },
+            defaultTab: function (cm) {
+              if (cm.somethingSelected()) {
+                cm.indentSelection("add");
+              } else {
+                cm.execCommand("insertTab");
+              }
+            },
+            transposeChars: function (cm) {
+              return runInOp(cm, function () {
+                var ranges = cm.listSelections(),
+                  newSel = [];
+                for (var i2 = 0; i2 < ranges.length; i2++) {
+                  if (!ranges[i2].empty()) {
+                    continue;
+                  }
+                  var cur = ranges[i2].head,
+                    line = getLine2(cm.doc, cur.line).text;
+                  if (line) {
+                    if (cur.ch == line.length) {
+                      cur = new Pos(cur.line, cur.ch - 1);
+                    }
+                    if (cur.ch > 0) {
+                      cur = new Pos(cur.line, cur.ch + 1);
+                      cm.replaceRange(
+                        line.charAt(cur.ch - 1) + line.charAt(cur.ch - 2),
+                        Pos(cur.line, cur.ch - 2),
+                        cur,
+                        "+transpose"
+                      );
+                    } else if (cur.line > cm.doc.first) {
+                      var prev = getLine2(cm.doc, cur.line - 1).text;
+                      if (prev) {
+                        cur = new Pos(cur.line, 1);
+                        cm.replaceRange(
+                          line.charAt(0) +
+                            cm.doc.lineSeparator() +
+                            prev.charAt(prev.length - 1),
+                          Pos(cur.line - 1, prev.length - 1),
+                          cur,
+                          "+transpose"
+                        );
+                      }
+                    }
+                  }
+                  newSel.push(new Range2(cur, cur));
+                }
+                cm.setSelections(newSel);
+              });
+            },
+            newlineAndIndent: function (cm) {
+              return runInOp(cm, function () {
+                var sels = cm.listSelections();
+                for (var i2 = sels.length - 1; i2 >= 0; i2--) {
+                  cm.replaceRange(
+                    cm.doc.lineSeparator(),
+                    sels[i2].anchor,
+                    sels[i2].head,
+                    "+input"
+                  );
+                }
+                sels = cm.listSelections();
+                for (var i$12 = 0; i$12 < sels.length; i$12++) {
+                  cm.indentLine(sels[i$12].from().line, null, true);
+                }
+                ensureCursorVisible(cm);
+              });
+            },
+            openLine: function (cm) {
+              return cm.replaceSelection("\n", "start");
+            },
+            toggleOverwrite: function (cm) {
+              return cm.toggleOverwrite();
+            },
+          };
+          function lineStart(cm, lineN) {
+            var line = getLine2(cm.doc, lineN);
+            var visual = visualLine(line);
+            if (visual != line) {
+              lineN = lineNo(visual);
+            }
+            return endOfLine(true, cm, visual, lineN, 1);
+          }
+          function lineEnd(cm, lineN) {
+            var line = getLine2(cm.doc, lineN);
+            var visual = visualLineEnd(line);
+            if (visual != line) {
+              lineN = lineNo(visual);
+            }
+            return endOfLine(true, cm, line, lineN, -1);
+          }
+          function lineStartSmart(cm, pos) {
+            var start2 = lineStart(cm, pos.line);
+            var line = getLine2(cm.doc, start2.line);
+            var order2 = getOrder(line, cm.doc.direction);
+            if (!order2 || order2[0].level == 0) {
+              var firstNonWS = Math.max(start2.ch, line.text.search(/\S/));
+              var inWS =
+                pos.line == start2.line && pos.ch <= firstNonWS && pos.ch;
+              return Pos(start2.line, inWS ? 0 : firstNonWS, start2.sticky);
+            }
+            return start2;
+          }
+          function doHandleBinding(cm, bound, dropShift) {
+            if (typeof bound == "string") {
+              bound = commands[bound];
+              if (!bound) {
+                return false;
+              }
+            }
+            cm.display.input.ensurePolled();
+            var prevShift = cm.display.shift,
+              done = false;
+            try {
+              if (cm.isReadOnly()) {
+                cm.state.suppressEdits = true;
+              }
+              if (dropShift) {
+                cm.display.shift = false;
+              }
+              done = bound(cm) != Pass;
+            } finally {
+              cm.display.shift = prevShift;
+              cm.state.suppressEdits = false;
+            }
+            return done;
+          }
+          function lookupKeyForEditor(cm, name2, handle) {
+            for (var i2 = 0; i2 < cm.state.keyMaps.length; i2++) {
+              var result2 = lookupKey(name2, cm.state.keyMaps[i2], handle, cm);
+              if (result2) {
+                return result2;
+              }
+            }
+            return (
+              (cm.options.extraKeys &&
+                lookupKey(name2, cm.options.extraKeys, handle, cm)) ||
+              lookupKey(name2, cm.options.keyMap, handle, cm)
+            );
+          }
+          var stopSeq = new Delayed();
+          function dispatchKey(cm, name2, e, handle) {
+            var seq = cm.state.keySeq;
+            if (seq) {
+              if (isModifierKey(name2)) {
+                return "handled";
+              }
+              if (/\'$/.test(name2)) {
+                cm.state.keySeq = null;
+              } else {
+                stopSeq.set(50, function () {
+                  if (cm.state.keySeq == seq) {
+                    cm.state.keySeq = null;
+                    cm.display.input.reset();
+                  }
+                });
+              }
+              if (dispatchKeyInner(cm, seq + " " + name2, e, handle)) {
+                return true;
+              }
+            }
+            return dispatchKeyInner(cm, name2, e, handle);
+          }
+          function dispatchKeyInner(cm, name2, e, handle) {
+            var result2 = lookupKeyForEditor(cm, name2, handle);
+            if (result2 == "multi") {
+              cm.state.keySeq = name2;
+            }
+            if (result2 == "handled") {
+              signalLater(cm, "keyHandled", cm, name2, e);
+            }
+            if (result2 == "handled" || result2 == "multi") {
+              e_preventDefault(e);
+              restartBlink(cm);
+            }
+            return !!result2;
+          }
+          function handleKeyBinding(cm, e) {
+            var name2 = keyName(e, true);
+            if (!name2) {
+              return false;
+            }
+            if (e.shiftKey && !cm.state.keySeq) {
+              return (
+                dispatchKey(cm, "Shift-" + name2, e, function (b) {
+                  return doHandleBinding(cm, b, true);
+                }) ||
+                dispatchKey(cm, name2, e, function (b) {
+                  if (typeof b == "string" ? /^go[A-Z]/.test(b) : b.motion) {
+                    return doHandleBinding(cm, b);
+                  }
+                })
+              );
+            } else {
+              return dispatchKey(cm, name2, e, function (b) {
+                return doHandleBinding(cm, b);
+              });
+            }
+          }
+          function handleCharBinding(cm, e, ch2) {
+            return dispatchKey(cm, "'" + ch2 + "'", e, function (b) {
+              return doHandleBinding(cm, b, true);
+            });
+          }
+          var lastStoppedKey = null;
+          function onKeyDown2(e) {
+            var cm = this;
+            if (e.target && e.target != cm.display.input.getField()) {
+              return;
+            }
+            cm.curOp.focus = activeElt();
+            if (signalDOMEvent(cm, e)) {
+              return;
+            }
+            if (ie2 && ie_version < 11 && e.keyCode == 27) {
+              e.returnValue = false;
+            }
+            var code3 = e.keyCode;
+            cm.display.shift = code3 == 16 || e.shiftKey;
+            var handled = handleKeyBinding(cm, e);
+            if (presto) {
+              lastStoppedKey = handled ? code3 : null;
+              if (
+                !handled &&
+                code3 == 88 &&
+                !hasCopyEvent &&
+                (mac ? e.metaKey : e.ctrlKey)
+              ) {
+                cm.replaceSelection("", null, "cut");
+              }
+            }
+            if (
+              gecko &&
+              !mac &&
+              !handled &&
+              code3 == 46 &&
+              e.shiftKey &&
+              !e.ctrlKey &&
+              document.execCommand
+            ) {
+              document.execCommand("cut");
+            }
+            if (
+              code3 == 18 &&
+              !/\bCodeMirror-crosshair\b/.test(cm.display.lineDiv.className)
+            ) {
+              showCrossHair(cm);
+            }
+          }
+          function showCrossHair(cm) {
+            var lineDiv = cm.display.lineDiv;
+            addClass(lineDiv, "CodeMirror-crosshair");
+            function up(e) {
+              if (e.keyCode == 18 || !e.altKey) {
+                rmClass(lineDiv, "CodeMirror-crosshair");
+                off(document, "keyup", up);
+                off(document, "mouseover", up);
+              }
+            }
+            on(document, "keyup", up);
+            on(document, "mouseover", up);
+          }
+          function onKeyUp(e) {
+            if (e.keyCode == 16) {
+              this.doc.sel.shift = false;
+            }
+            signalDOMEvent(this, e);
+          }
+          function onKeyPress(e) {
+            var cm = this;
+            if (e.target && e.target != cm.display.input.getField()) {
+              return;
+            }
+            if (
+              eventInWidget(cm.display, e) ||
+              signalDOMEvent(cm, e) ||
+              (e.ctrlKey && !e.altKey) ||
+              (mac && e.metaKey)
+            ) {
+              return;
+            }
+            var keyCode = e.keyCode,
+              charCode = e.charCode;
+            if (presto && keyCode == lastStoppedKey) {
+              lastStoppedKey = null;
+              e_preventDefault(e);
+              return;
+            }
+            if (
+              presto &&
+              (!e.which || e.which < 10) &&
+              handleKeyBinding(cm, e)
+            ) {
+              return;
+            }
+            var ch2 = String.fromCharCode(
+              charCode == null ? keyCode : charCode
+            );
+            if (ch2 == "\b") {
+              return;
+            }
+            if (handleCharBinding(cm, e, ch2)) {
+              return;
+            }
+            cm.display.input.onKeyPress(e);
+          }
+          var DOUBLECLICK_DELAY = 400;
+          var PastClick = function (time, pos, button) {
+            this.time = time;
+            this.pos = pos;
+            this.button = button;
+          };
+          PastClick.prototype.compare = function (time, pos, button) {
+            return (
+              this.time + DOUBLECLICK_DELAY > time &&
+              cmp(pos, this.pos) == 0 &&
+              button == this.button
+            );
+          };
+          var lastClick, lastDoubleClick;
+          function clickRepeat(pos, button) {
+            var now = +new Date();
+            if (lastDoubleClick && lastDoubleClick.compare(now, pos, button)) {
+              lastClick = lastDoubleClick = null;
+              return "triple";
+            } else if (lastClick && lastClick.compare(now, pos, button)) {
+              lastDoubleClick = new PastClick(now, pos, button);
+              lastClick = null;
+              return "double";
+            } else {
+              lastClick = new PastClick(now, pos, button);
+              lastDoubleClick = null;
+              return "single";
+            }
+          }
+          function onMouseDown(e) {
+            var cm = this,
+              display = cm.display;
+            if (
+              signalDOMEvent(cm, e) ||
+              (display.activeTouch && display.input.supportsTouch())
+            ) {
+              return;
+            }
+            display.input.ensurePolled();
+            display.shift = e.shiftKey;
+            if (eventInWidget(display, e)) {
+              if (!webkit) {
+                display.scroller.draggable = false;
+                setTimeout(function () {
+                  return (display.scroller.draggable = true);
+                }, 100);
+              }
+              return;
+            }
+            if (clickInGutter(cm, e)) {
+              return;
+            }
+            var pos = posFromMouse(cm, e),
+              button = e_button(e),
+              repeat = pos ? clickRepeat(pos, button) : "single";
+            window.focus();
+            if (button == 1 && cm.state.selectingText) {
+              cm.state.selectingText(e);
+            }
+            if (pos && handleMappedButton(cm, button, pos, repeat, e)) {
+              return;
+            }
+            if (button == 1) {
+              if (pos) {
+                leftButtonDown(cm, pos, repeat, e);
+              } else if (e_target(e) == display.scroller) {
+                e_preventDefault(e);
+              }
+            } else if (button == 2) {
+              if (pos) {
+                extendSelection(cm.doc, pos);
+              }
+              setTimeout(function () {
+                return display.input.focus();
+              }, 20);
+            } else if (button == 3) {
+              if (captureRightClick) {
+                cm.display.input.onContextMenu(e);
+              } else {
+                delayBlurEvent(cm);
+              }
+            }
+          }
+          function handleMappedButton(cm, button, pos, repeat, event) {
+            var name2 = "Click";
+            if (repeat == "double") {
+              name2 = "Double" + name2;
+            } else if (repeat == "triple") {
+              name2 = "Triple" + name2;
+            }
+            name2 =
+              (button == 1 ? "Left" : button == 2 ? "Middle" : "Right") + name2;
+            return dispatchKey(
+              cm,
+              addModifierNames(name2, event),
+              event,
+              function (bound) {
+                if (typeof bound == "string") {
+                  bound = commands[bound];
+                }
+                if (!bound) {
+                  return false;
+                }
+                var done = false;
+                try {
+                  if (cm.isReadOnly()) {
+                    cm.state.suppressEdits = true;
+                  }
+                  done = bound(cm, pos) != Pass;
+                } finally {
+                  cm.state.suppressEdits = false;
+                }
+                return done;
+              }
+            );
+          }
+          function configureMouse(cm, repeat, event) {
+            var option = cm.getOption("configureMouse");
+            var value = option ? option(cm, repeat, event) : {};
+            if (value.unit == null) {
+              var rect2 = chromeOS
+                ? event.shiftKey && event.metaKey
+                : event.altKey;
+              value.unit = rect2
+                ? "rectangle"
+                : repeat == "single"
+                ? "char"
+                : repeat == "double"
+                ? "word"
+                : "line";
+            }
+            if (value.extend == null || cm.doc.extend) {
+              value.extend = cm.doc.extend || event.shiftKey;
+            }
+            if (value.addNew == null) {
+              value.addNew = mac ? event.metaKey : event.ctrlKey;
+            }
+            if (value.moveOnDrag == null) {
+              value.moveOnDrag = !(mac ? event.altKey : event.ctrlKey);
+            }
+            return value;
+          }
+          function leftButtonDown(cm, pos, repeat, event) {
+            if (ie2) {
+              setTimeout(bind(ensureFocus, cm), 0);
+            } else {
+              cm.curOp.focus = activeElt();
+            }
+            var behavior = configureMouse(cm, repeat, event);
+            var sel = cm.doc.sel,
+              contained;
+            if (
+              cm.options.dragDrop &&
+              dragAndDrop &&
+              !cm.isReadOnly() &&
+              repeat == "single" &&
+              (contained = sel.contains(pos)) > -1 &&
+              (cmp((contained = sel.ranges[contained]).from(), pos) < 0 ||
+                pos.xRel > 0) &&
+              (cmp(contained.to(), pos) > 0 || pos.xRel < 0)
+            ) {
+              leftButtonStartDrag(cm, event, pos, behavior);
+            } else {
+              leftButtonSelect(cm, event, pos, behavior);
+            }
+          }
+          function leftButtonStartDrag(cm, event, pos, behavior) {
+            var display = cm.display,
+              moved = false;
+            var dragEnd = operation(cm, function (e) {
+              if (webkit) {
+                display.scroller.draggable = false;
+              }
+              cm.state.draggingText = false;
+              if (cm.state.delayingBlurEvent) {
+                if (cm.hasFocus()) {
+                  cm.state.delayingBlurEvent = false;
+                } else {
+                  delayBlurEvent(cm);
+                }
+              }
+              off(display.wrapper.ownerDocument, "mouseup", dragEnd);
+              off(display.wrapper.ownerDocument, "mousemove", mouseMove);
+              off(display.scroller, "dragstart", dragStart);
+              off(display.scroller, "drop", dragEnd);
+              if (!moved) {
+                e_preventDefault(e);
+                if (!behavior.addNew) {
+                  extendSelection(cm.doc, pos, null, null, behavior.extend);
+                }
+                if ((webkit && !safari) || (ie2 && ie_version == 9)) {
+                  setTimeout(function () {
+                    display.wrapper.ownerDocument.body.focus({
+                      preventScroll: true,
+                    });
+                    display.input.focus();
+                  }, 20);
+                } else {
+                  display.input.focus();
+                }
+              }
+            });
+            var mouseMove = function (e2) {
+              moved =
+                moved ||
+                Math.abs(event.clientX - e2.clientX) +
+                  Math.abs(event.clientY - e2.clientY) >=
+                  10;
+            };
+            var dragStart = function () {
+              return (moved = true);
+            };
+            if (webkit) {
+              display.scroller.draggable = true;
+            }
+            cm.state.draggingText = dragEnd;
+            dragEnd.copy = !behavior.moveOnDrag;
+            on(display.wrapper.ownerDocument, "mouseup", dragEnd);
+            on(display.wrapper.ownerDocument, "mousemove", mouseMove);
+            on(display.scroller, "dragstart", dragStart);
+            on(display.scroller, "drop", dragEnd);
+            cm.state.delayingBlurEvent = true;
+            setTimeout(function () {
+              return display.input.focus();
+            }, 20);
+            if (display.scroller.dragDrop) {
+              display.scroller.dragDrop();
+            }
+          }
+          function rangeForUnit(cm, pos, unit) {
+            if (unit == "char") {
+              return new Range2(pos, pos);
+            }
+            if (unit == "word") {
+              return cm.findWordAt(pos);
+            }
+            if (unit == "line") {
+              return new Range2(
+                Pos(pos.line, 0),
+                clipPos(cm.doc, Pos(pos.line + 1, 0))
+              );
+            }
+            var result2 = unit(cm, pos);
+            return new Range2(result2.from, result2.to);
+          }
+          function leftButtonSelect(cm, event, start2, behavior) {
+            if (ie2) {
+              delayBlurEvent(cm);
+            }
+            var display = cm.display,
+              doc = cm.doc;
+            e_preventDefault(event);
+            var ourRange,
+              ourIndex,
+              startSel = doc.sel,
+              ranges = startSel.ranges;
+            if (behavior.addNew && !behavior.extend) {
+              ourIndex = doc.sel.contains(start2);
+              if (ourIndex > -1) {
+                ourRange = ranges[ourIndex];
+              } else {
+                ourRange = new Range2(start2, start2);
+              }
+            } else {
+              ourRange = doc.sel.primary();
+              ourIndex = doc.sel.primIndex;
+            }
+            if (behavior.unit == "rectangle") {
+              if (!behavior.addNew) {
+                ourRange = new Range2(start2, start2);
+              }
+              start2 = posFromMouse(cm, event, true, true);
+              ourIndex = -1;
+            } else {
+              var range3 = rangeForUnit(cm, start2, behavior.unit);
+              if (behavior.extend) {
+                ourRange = extendRange(
+                  ourRange,
+                  range3.anchor,
+                  range3.head,
+                  behavior.extend
+                );
+              } else {
+                ourRange = range3;
+              }
+            }
+            if (!behavior.addNew) {
+              ourIndex = 0;
+              setSelection(doc, new Selection([ourRange], 0), sel_mouse);
+              startSel = doc.sel;
+            } else if (ourIndex == -1) {
+              ourIndex = ranges.length;
+              setSelection(
+                doc,
+                normalizeSelection(cm, ranges.concat([ourRange]), ourIndex),
+                { scroll: false, origin: "*mouse" }
+              );
+            } else if (
+              ranges.length > 1 &&
+              ranges[ourIndex].empty() &&
+              behavior.unit == "char" &&
+              !behavior.extend
+            ) {
+              setSelection(
+                doc,
+                normalizeSelection(
+                  cm,
+                  ranges.slice(0, ourIndex).concat(ranges.slice(ourIndex + 1)),
+                  0
+                ),
+                { scroll: false, origin: "*mouse" }
+              );
+              startSel = doc.sel;
+            } else {
+              replaceOneSelection(doc, ourIndex, ourRange, sel_mouse);
+            }
+            var lastPos = start2;
+            function extendTo(pos) {
+              if (cmp(lastPos, pos) == 0) {
+                return;
+              }
+              lastPos = pos;
+              if (behavior.unit == "rectangle") {
+                var ranges2 = [],
+                  tabSize = cm.options.tabSize;
+                var startCol = countColumn(
+                  getLine2(doc, start2.line).text,
+                  start2.ch,
+                  tabSize
+                );
+                var posCol = countColumn(
+                  getLine2(doc, pos.line).text,
+                  pos.ch,
+                  tabSize
+                );
+                var left = Math.min(startCol, posCol),
+                  right = Math.max(startCol, posCol);
+                for (
+                  var line = Math.min(start2.line, pos.line),
+                    end2 = Math.min(
+                      cm.lastLine(),
+                      Math.max(start2.line, pos.line)
+                    );
+                  line <= end2;
+                  line++
+                ) {
+                  var text3 = getLine2(doc, line).text,
+                    leftPos = findColumn(text3, left, tabSize);
+                  if (left == right) {
+                    ranges2.push(
+                      new Range2(Pos(line, leftPos), Pos(line, leftPos))
+                    );
+                  } else if (text3.length > leftPos) {
+                    ranges2.push(
+                      new Range2(
+                        Pos(line, leftPos),
+                        Pos(line, findColumn(text3, right, tabSize))
+                      )
+                    );
+                  }
+                }
+                if (!ranges2.length) {
+                  ranges2.push(new Range2(start2, start2));
+                }
+                setSelection(
+                  doc,
+                  normalizeSelection(
+                    cm,
+                    startSel.ranges.slice(0, ourIndex).concat(ranges2),
+                    ourIndex
+                  ),
+                  { origin: "*mouse", scroll: false }
+                );
+                cm.scrollIntoView(pos);
+              } else {
+                var oldRange = ourRange;
+                var range4 = rangeForUnit(cm, pos, behavior.unit);
+                var anchor = oldRange.anchor,
+                  head;
+                if (cmp(range4.anchor, anchor) > 0) {
+                  head = range4.head;
+                  anchor = minPos(oldRange.from(), range4.anchor);
+                } else {
+                  head = range4.anchor;
+                  anchor = maxPos(oldRange.to(), range4.head);
+                }
+                var ranges$1 = startSel.ranges.slice(0);
+                ranges$1[ourIndex] = bidiSimplify(
+                  cm,
+                  new Range2(clipPos(doc, anchor), head)
+                );
+                setSelection(
+                  doc,
+                  normalizeSelection(cm, ranges$1, ourIndex),
+                  sel_mouse
+                );
+              }
+            }
+            var editorSize = display.wrapper.getBoundingClientRect();
+            var counter = 0;
+            function extend(e) {
+              var curCount = ++counter;
+              var cur = posFromMouse(cm, e, true, behavior.unit == "rectangle");
+              if (!cur) {
+                return;
+              }
+              if (cmp(cur, lastPos) != 0) {
+                cm.curOp.focus = activeElt();
+                extendTo(cur);
+                var visible = visibleLines(display, doc);
+                if (cur.line >= visible.to || cur.line < visible.from) {
+                  setTimeout(
+                    operation(cm, function () {
+                      if (counter == curCount) {
+                        extend(e);
+                      }
+                    }),
+                    150
+                  );
+                }
+              } else {
+                var outside =
+                  e.clientY < editorSize.top
+                    ? -20
+                    : e.clientY > editorSize.bottom
+                    ? 20
+                    : 0;
+                if (outside) {
+                  setTimeout(
+                    operation(cm, function () {
+                      if (counter != curCount) {
+                        return;
+                      }
+                      display.scroller.scrollTop += outside;
+                      extend(e);
+                    }),
+                    50
+                  );
+                }
+              }
+            }
+            function done(e) {
+              cm.state.selectingText = false;
+              counter = Infinity;
+              if (e) {
+                e_preventDefault(e);
+                display.input.focus();
+              }
+              off(display.wrapper.ownerDocument, "mousemove", move);
+              off(display.wrapper.ownerDocument, "mouseup", up);
+              doc.history.lastSelOrigin = null;
+            }
+            var move = operation(cm, function (e) {
+              if (e.buttons === 0 || !e_button(e)) {
+                done(e);
+              } else {
+                extend(e);
+              }
+            });
+            var up = operation(cm, done);
+            cm.state.selectingText = up;
+            on(display.wrapper.ownerDocument, "mousemove", move);
+            on(display.wrapper.ownerDocument, "mouseup", up);
+          }
+          function bidiSimplify(cm, range3) {
+            var anchor = range3.anchor;
+            var head = range3.head;
+            var anchorLine = getLine2(cm.doc, anchor.line);
+            if (cmp(anchor, head) == 0 && anchor.sticky == head.sticky) {
+              return range3;
+            }
+            var order2 = getOrder(anchorLine);
+            if (!order2) {
+              return range3;
+            }
+            var index = getBidiPartAt(order2, anchor.ch, anchor.sticky),
+              part2 = order2[index];
+            if (part2.from != anchor.ch && part2.to != anchor.ch) {
+              return range3;
+            }
+            var boundary =
+              index + ((part2.from == anchor.ch) == (part2.level != 1) ? 0 : 1);
+            if (boundary == 0 || boundary == order2.length) {
+              return range3;
+            }
+            var leftSide;
+            if (head.line != anchor.line) {
+              leftSide =
+                (head.line - anchor.line) *
+                  (cm.doc.direction == "ltr" ? 1 : -1) >
+                0;
+            } else {
+              var headIndex = getBidiPartAt(order2, head.ch, head.sticky);
+              var dir =
+                headIndex - index ||
+                (head.ch - anchor.ch) * (part2.level == 1 ? -1 : 1);
+              if (headIndex == boundary - 1 || headIndex == boundary) {
+                leftSide = dir < 0;
+              } else {
+                leftSide = dir > 0;
+              }
+            }
+            var usePart = order2[boundary + (leftSide ? -1 : 0)];
+            var from = leftSide == (usePart.level == 1);
+            var ch2 = from ? usePart.from : usePart.to,
+              sticky = from ? "after" : "before";
+            return anchor.ch == ch2 && anchor.sticky == sticky
+              ? range3
+              : new Range2(new Pos(anchor.line, ch2, sticky), head);
+          }
+          function gutterEvent(cm, e, type2, prevent) {
+            var mX, mY;
+            if (e.touches) {
+              mX = e.touches[0].clientX;
+              mY = e.touches[0].clientY;
+            } else {
+              try {
+                mX = e.clientX;
+                mY = e.clientY;
+              } catch (e$1) {
+                return false;
+              }
+            }
+            if (
+              mX >= Math.floor(cm.display.gutters.getBoundingClientRect().right)
+            ) {
+              return false;
+            }
+            if (prevent) {
+              e_preventDefault(e);
+            }
+            var display = cm.display;
+            var lineBox = display.lineDiv.getBoundingClientRect();
+            if (mY > lineBox.bottom || !hasHandler(cm, type2)) {
+              return e_defaultPrevented(e);
+            }
+            mY -= lineBox.top - display.viewOffset;
+            for (var i2 = 0; i2 < cm.display.gutterSpecs.length; ++i2) {
+              var g = display.gutters.childNodes[i2];
+              if (g && g.getBoundingClientRect().right >= mX) {
+                var line = lineAtHeight(cm.doc, mY);
+                var gutter = cm.display.gutterSpecs[i2];
+                signal(cm, type2, cm, line, gutter.className, e);
+                return e_defaultPrevented(e);
+              }
+            }
+          }
+          function clickInGutter(cm, e) {
+            return gutterEvent(cm, e, "gutterClick", true);
+          }
+          function onContextMenu(cm, e) {
+            if (eventInWidget(cm.display, e) || contextMenuInGutter(cm, e)) {
+              return;
+            }
+            if (signalDOMEvent(cm, e, "contextmenu")) {
+              return;
+            }
+            if (!captureRightClick) {
+              cm.display.input.onContextMenu(e);
+            }
+          }
+          function contextMenuInGutter(cm, e) {
+            if (!hasHandler(cm, "gutterContextMenu")) {
+              return false;
+            }
+            return gutterEvent(cm, e, "gutterContextMenu", false);
+          }
+          function themeChanged(cm) {
+            cm.display.wrapper.className =
+              cm.display.wrapper.className.replace(/\s*cm-s-\S+/g, "") +
+              cm.options.theme.replace(/(^|\s)\s*/g, " cm-s-");
+            clearCaches(cm);
+          }
+          var Init = {
+            toString: function () {
+              return "CodeMirror.Init";
+            },
+          };
+          var defaults2 = {};
+          var optionHandlers = {};
+          function defineOptions(CodeMirror2) {
+            var optionHandlers2 = CodeMirror2.optionHandlers;
+            function option(name2, deflt, handle, notOnInit) {
+              CodeMirror2.defaults[name2] = deflt;
+              if (handle) {
+                optionHandlers2[name2] = notOnInit
+                  ? function (cm, val, old) {
+                      if (old != Init) {
+                        handle(cm, val, old);
+                      }
+                    }
+                  : handle;
+              }
+            }
+            CodeMirror2.defineOption = option;
+            CodeMirror2.Init = Init;
+            option(
+              "value",
+              "",
+              function (cm, val) {
+                return cm.setValue(val);
+              },
+              true
+            );
+            option(
+              "mode",
+              null,
+              function (cm, val) {
+                cm.doc.modeOption = val;
+                loadMode(cm);
+              },
+              true
+            );
+            option("indentUnit", 2, loadMode, true);
+            option("indentWithTabs", false);
+            option("smartIndent", true);
+            option(
+              "tabSize",
+              4,
+              function (cm) {
+                resetModeState(cm);
+                clearCaches(cm);
+                regChange(cm);
+              },
+              true
+            );
+            option("lineSeparator", null, function (cm, val) {
+              cm.doc.lineSep = val;
+              if (!val) {
+                return;
+              }
+              var newBreaks = [],
+                lineNo2 = cm.doc.first;
+              cm.doc.iter(function (line) {
+                for (var pos = 0; ; ) {
+                  var found = line.text.indexOf(val, pos);
+                  if (found == -1) {
+                    break;
+                  }
+                  pos = found + val.length;
+                  newBreaks.push(Pos(lineNo2, found));
+                }
+                lineNo2++;
+              });
+              for (var i2 = newBreaks.length - 1; i2 >= 0; i2--) {
+                replaceRange(
+                  cm.doc,
+                  val,
+                  newBreaks[i2],
+                  Pos(newBreaks[i2].line, newBreaks[i2].ch + val.length)
+                );
+              }
+            });
+            option(
+              "specialChars",
+              /[\u0000-\u001f\u007f-\u009f\u00ad\u061c\u200b\u200e\u200f\u2028\u2029\ufeff\ufff9-\ufffc]/g,
+              function (cm, val, old) {
+                cm.state.specialChars = new RegExp(
+                  val.source + (val.test("	") ? "" : "|	"),
+                  "g"
+                );
+                if (old != Init) {
+                  cm.refresh();
+                }
+              }
+            );
+            option(
+              "specialCharPlaceholder",
+              defaultSpecialCharPlaceholder,
+              function (cm) {
+                return cm.refresh();
+              },
+              true
+            );
+            option("electricChars", true);
+            option(
+              "inputStyle",
+              mobile ? "contenteditable" : "textarea",
+              function () {
+                throw new Error(
+                  "inputStyle can not (yet) be changed in a running editor"
+                );
+              },
+              true
+            );
+            option(
+              "spellcheck",
+              false,
+              function (cm, val) {
+                return (cm.getInputField().spellcheck = val);
+              },
+              true
+            );
+            option(
+              "autocorrect",
+              false,
+              function (cm, val) {
+                return (cm.getInputField().autocorrect = val);
+              },
+              true
+            );
+            option(
+              "autocapitalize",
+              false,
+              function (cm, val) {
+                return (cm.getInputField().autocapitalize = val);
+              },
+              true
+            );
+            option("rtlMoveVisually", !windows);
+            option("wholeLineUpdateBefore", true);
+            option(
+              "theme",
+              "default",
+              function (cm) {
+                themeChanged(cm);
+                updateGutters(cm);
+              },
+              true
+            );
+            option("keyMap", "default", function (cm, val, old) {
+              var next = getKeyMap(val);
+              var prev = old != Init && getKeyMap(old);
+              if (prev && prev.detach) {
+                prev.detach(cm, next);
+              }
+              if (next.attach) {
+                next.attach(cm, prev || null);
+              }
+            });
+            option("extraKeys", null);
+            option("configureMouse", null);
+            option("lineWrapping", false, wrappingChanged, true);
+            option(
+              "gutters",
+              [],
+              function (cm, val) {
+                cm.display.gutterSpecs = getGutters(
+                  val,
+                  cm.options.lineNumbers
+                );
+                updateGutters(cm);
+              },
+              true
+            );
+            option(
+              "fixedGutter",
+              true,
+              function (cm, val) {
+                cm.display.gutters.style.left = val
+                  ? compensateForHScroll(cm.display) + "px"
+                  : "0";
+                cm.refresh();
+              },
+              true
+            );
+            option(
+              "coverGutterNextToScrollbar",
+              false,
+              function (cm) {
+                return updateScrollbars(cm);
+              },
+              true
+            );
+            option(
+              "scrollbarStyle",
+              "native",
+              function (cm) {
+                initScrollbars(cm);
+                updateScrollbars(cm);
+                cm.display.scrollbars.setScrollTop(cm.doc.scrollTop);
+                cm.display.scrollbars.setScrollLeft(cm.doc.scrollLeft);
+              },
+              true
+            );
+            option(
+              "lineNumbers",
+              false,
+              function (cm, val) {
+                cm.display.gutterSpecs = getGutters(cm.options.gutters, val);
+                updateGutters(cm);
+              },
+              true
+            );
+            option("firstLineNumber", 1, updateGutters, true);
+            option(
+              "lineNumberFormatter",
+              function (integer2) {
+                return integer2;
+              },
+              updateGutters,
+              true
+            );
+            option("showCursorWhenSelecting", false, updateSelection, true);
+            option("resetSelectionOnContextMenu", true);
+            option("lineWiseCopyCut", true);
+            option("pasteLinesPerSelection", true);
+            option("selectionsMayTouch", false);
+            option("readOnly", false, function (cm, val) {
+              if (val == "nocursor") {
+                onBlur(cm);
+                cm.display.input.blur();
+              }
+              cm.display.input.readOnlyChanged(val);
+            });
+            option("screenReaderLabel", null, function (cm, val) {
+              val = val === "" ? null : val;
+              cm.display.input.screenReaderLabelChanged(val);
+            });
+            option(
+              "disableInput",
+              false,
+              function (cm, val) {
+                if (!val) {
+                  cm.display.input.reset();
+                }
+              },
+              true
+            );
+            option("dragDrop", true, dragDropChanged);
+            option("allowDropFileTypes", null);
+            option("cursorBlinkRate", 530);
+            option("cursorScrollMargin", 0);
+            option("cursorHeight", 1, updateSelection, true);
+            option("singleCursorHeightPerLine", true, updateSelection, true);
+            option("workTime", 100);
+            option("workDelay", 100);
+            option("flattenSpans", true, resetModeState, true);
+            option("addModeClass", false, resetModeState, true);
+            option("pollInterval", 100);
+            option("undoDepth", 200, function (cm, val) {
+              return (cm.doc.history.undoDepth = val);
+            });
+            option("historyEventDelay", 1250);
+            option(
+              "viewportMargin",
+              10,
+              function (cm) {
+                return cm.refresh();
+              },
+              true
+            );
+            option("maxHighlightLength", 1e4, resetModeState, true);
+            option("moveInputWithCursor", true, function (cm, val) {
+              if (!val) {
+                cm.display.input.resetPosition();
+              }
+            });
+            option("tabindex", null, function (cm, val) {
+              return (cm.display.input.getField().tabIndex = val || "");
+            });
+            option("autofocus", null);
+            option(
+              "direction",
+              "ltr",
+              function (cm, val) {
+                return cm.doc.setDirection(val);
+              },
+              true
+            );
+            option("phrases", null);
+          }
+          function dragDropChanged(cm, value, old) {
+            var wasOn = old && old != Init;
+            if (!value != !wasOn) {
+              var funcs = cm.display.dragFunctions;
+              var toggle = value ? on : off;
+              toggle(cm.display.scroller, "dragstart", funcs.start);
+              toggle(cm.display.scroller, "dragenter", funcs.enter);
+              toggle(cm.display.scroller, "dragover", funcs.over);
+              toggle(cm.display.scroller, "dragleave", funcs.leave);
+              toggle(cm.display.scroller, "drop", funcs.drop);
+            }
+          }
+          function wrappingChanged(cm) {
+            if (cm.options.lineWrapping) {
+              addClass(cm.display.wrapper, "CodeMirror-wrap");
+              cm.display.sizer.style.minWidth = "";
+              cm.display.sizerWidth = null;
+            } else {
+              rmClass(cm.display.wrapper, "CodeMirror-wrap");
+              findMaxLine(cm);
+            }
+            estimateLineHeights(cm);
+            regChange(cm);
+            clearCaches(cm);
+            setTimeout(function () {
+              return updateScrollbars(cm);
+            }, 100);
+          }
+          function CodeMirror(place, options) {
+            var this$1$1 = this;
+            if (!(this instanceof CodeMirror)) {
+              return new CodeMirror(place, options);
+            }
+            this.options = options = options ? copyObj(options) : {};
+            copyObj(defaults2, options, false);
+            var doc = options.value;
+            if (typeof doc == "string") {
+              doc = new Doc(
+                doc,
+                options.mode,
+                null,
+                options.lineSeparator,
+                options.direction
+              );
+            } else if (options.mode) {
+              doc.modeOption = options.mode;
+            }
+            this.doc = doc;
+            var input = new CodeMirror.inputStyles[options.inputStyle](this);
+            var display = (this.display = new Display(
+              place,
+              doc,
+              input,
+              options
+            ));
+            display.wrapper.CodeMirror = this;
+            themeChanged(this);
+            if (options.lineWrapping) {
+              this.display.wrapper.className += " CodeMirror-wrap";
+            }
+            initScrollbars(this);
+            this.state = {
+              keyMaps: [],
+              overlays: [],
+              modeGen: 0,
+              overwrite: false,
+              delayingBlurEvent: false,
+              focused: false,
+              suppressEdits: false,
+              pasteIncoming: -1,
+              cutIncoming: -1,
+              selectingText: false,
+              draggingText: false,
+              highlight: new Delayed(),
+              keySeq: null,
+              specialChars: null,
+            };
+            if (options.autofocus && !mobile) {
+              display.input.focus();
+            }
+            if (ie2 && ie_version < 11) {
+              setTimeout(function () {
+                return this$1$1.display.input.reset(true);
+              }, 20);
+            }
+            registerEventHandlers(this);
+            ensureGlobalHandlers();
+            startOperation(this);
+            this.curOp.forceUpdate = true;
+            attachDoc(this, doc);
+            if ((options.autofocus && !mobile) || this.hasFocus()) {
+              setTimeout(function () {
+                if (this$1$1.hasFocus() && !this$1$1.state.focused) {
+                  onFocus(this$1$1);
+                }
+              }, 20);
+            } else {
+              onBlur(this);
+            }
+            for (var opt2 in optionHandlers) {
+              if (optionHandlers.hasOwnProperty(opt2)) {
+                optionHandlers[opt2](this, options[opt2], Init);
+              }
+            }
+            maybeUpdateLineNumberWidth(this);
+            if (options.finishInit) {
+              options.finishInit(this);
+            }
+            for (var i2 = 0; i2 < initHooks.length; ++i2) {
+              initHooks[i2](this);
+            }
+            endOperation(this);
+            if (
+              webkit &&
+              options.lineWrapping &&
+              getComputedStyle(display.lineDiv).textRendering ==
+                "optimizelegibility"
+            ) {
+              display.lineDiv.style.textRendering = "auto";
+            }
+          }
+          CodeMirror.defaults = defaults2;
+          CodeMirror.optionHandlers = optionHandlers;
+          function registerEventHandlers(cm) {
+            var d = cm.display;
+            on(d.scroller, "mousedown", operation(cm, onMouseDown));
+            if (ie2 && ie_version < 11) {
+              on(
+                d.scroller,
+                "dblclick",
+                operation(cm, function (e) {
+                  if (signalDOMEvent(cm, e)) {
+                    return;
+                  }
+                  var pos = posFromMouse(cm, e);
+                  if (
+                    !pos ||
+                    clickInGutter(cm, e) ||
+                    eventInWidget(cm.display, e)
+                  ) {
+                    return;
+                  }
+                  e_preventDefault(e);
+                  var word2 = cm.findWordAt(pos);
+                  extendSelection(cm.doc, word2.anchor, word2.head);
+                })
+              );
+            } else {
+              on(d.scroller, "dblclick", function (e) {
+                return signalDOMEvent(cm, e) || e_preventDefault(e);
+              });
+            }
+            on(d.scroller, "contextmenu", function (e) {
+              return onContextMenu(cm, e);
+            });
+            on(d.input.getField(), "contextmenu", function (e) {
+              if (!d.scroller.contains(e.target)) {
+                onContextMenu(cm, e);
+              }
+            });
+            var touchFinished,
+              prevTouch = { end: 0 };
+            function finishTouch() {
+              if (d.activeTouch) {
+                touchFinished = setTimeout(function () {
+                  return (d.activeTouch = null);
+                }, 1e3);
+                prevTouch = d.activeTouch;
+                prevTouch.end = +new Date();
+              }
+            }
+            function isMouseLikeTouchEvent(e) {
+              if (e.touches.length != 1) {
+                return false;
+              }
+              var touch = e.touches[0];
+              return touch.radiusX <= 1 && touch.radiusY <= 1;
+            }
+            function farAway(touch, other) {
+              if (other.left == null) {
+                return true;
+              }
+              var dx = other.left - touch.left,
+                dy = other.top - touch.top;
+              return dx * dx + dy * dy > 20 * 20;
+            }
+            on(d.scroller, "touchstart", function (e) {
+              if (
+                !signalDOMEvent(cm, e) &&
+                !isMouseLikeTouchEvent(e) &&
+                !clickInGutter(cm, e)
+              ) {
+                d.input.ensurePolled();
+                clearTimeout(touchFinished);
+                var now = +new Date();
+                d.activeTouch = {
+                  start: now,
+                  moved: false,
+                  prev: now - prevTouch.end <= 300 ? prevTouch : null,
+                };
+                if (e.touches.length == 1) {
+                  d.activeTouch.left = e.touches[0].pageX;
+                  d.activeTouch.top = e.touches[0].pageY;
+                }
+              }
+            });
+            on(d.scroller, "touchmove", function () {
+              if (d.activeTouch) {
+                d.activeTouch.moved = true;
+              }
+            });
+            on(d.scroller, "touchend", function (e) {
+              var touch = d.activeTouch;
+              if (
+                touch &&
+                !eventInWidget(d, e) &&
+                touch.left != null &&
+                !touch.moved &&
+                new Date() - touch.start < 300
+              ) {
+                var pos = cm.coordsChar(d.activeTouch, "page"),
+                  range3;
+                if (!touch.prev || farAway(touch, touch.prev)) {
+                  range3 = new Range2(pos, pos);
+                } else if (
+                  !touch.prev.prev ||
+                  farAway(touch, touch.prev.prev)
+                ) {
+                  range3 = cm.findWordAt(pos);
+                } else {
+                  range3 = new Range2(
+                    Pos(pos.line, 0),
+                    clipPos(cm.doc, Pos(pos.line + 1, 0))
+                  );
+                }
+                cm.setSelection(range3.anchor, range3.head);
+                cm.focus();
+                e_preventDefault(e);
+              }
+              finishTouch();
+            });
+            on(d.scroller, "touchcancel", finishTouch);
+            on(d.scroller, "scroll", function () {
+              if (d.scroller.clientHeight) {
+                updateScrollTop(cm, d.scroller.scrollTop);
+                setScrollLeft(cm, d.scroller.scrollLeft, true);
+                signal(cm, "scroll", cm);
+              }
+            });
+            on(d.scroller, "mousewheel", function (e) {
+              return onScrollWheel(cm, e);
+            });
+            on(d.scroller, "DOMMouseScroll", function (e) {
+              return onScrollWheel(cm, e);
+            });
+            on(d.wrapper, "scroll", function () {
+              return (d.wrapper.scrollTop = d.wrapper.scrollLeft = 0);
+            });
+            d.dragFunctions = {
+              enter: function (e) {
+                if (!signalDOMEvent(cm, e)) {
+                  e_stop(e);
+                }
+              },
+              over: function (e) {
+                if (!signalDOMEvent(cm, e)) {
+                  onDragOver(cm, e);
+                  e_stop(e);
+                }
+              },
+              start: function (e) {
+                return onDragStart(cm, e);
+              },
+              drop: operation(cm, onDrop),
+              leave: function (e) {
+                if (!signalDOMEvent(cm, e)) {
+                  clearDragCursor(cm);
+                }
+              },
+            };
+            var inp = d.input.getField();
+            on(inp, "keyup", function (e) {
+              return onKeyUp.call(cm, e);
+            });
+            on(inp, "keydown", operation(cm, onKeyDown2));
+            on(inp, "keypress", operation(cm, onKeyPress));
+            on(inp, "focus", function (e) {
+              return onFocus(cm, e);
+            });
+            on(inp, "blur", function (e) {
+              return onBlur(cm, e);
+            });
+          }
+          var initHooks = [];
+          CodeMirror.defineInitHook = function (f) {
+            return initHooks.push(f);
+          };
+          function indentLine(cm, n2, how, aggressive) {
+            var doc = cm.doc,
+              state;
+            if (how == null) {
+              how = "add";
+            }
+            if (how == "smart") {
+              if (!doc.mode.indent) {
+                how = "prev";
+              } else {
+                state = getContextBefore(cm, n2).state;
+              }
+            }
+            var tabSize = cm.options.tabSize;
+            var line = getLine2(doc, n2),
+              curSpace = countColumn(line.text, null, tabSize);
+            if (line.stateAfter) {
+              line.stateAfter = null;
+            }
+            var curSpaceString = line.text.match(/^\s*/)[0],
+              indentation;
+            if (!aggressive && !/\S/.test(line.text)) {
+              indentation = 0;
+              how = "not";
+            } else if (how == "smart") {
+              indentation = doc.mode.indent(
+                state,
+                line.text.slice(curSpaceString.length),
+                line.text
+              );
+              if (indentation == Pass || indentation > 150) {
+                if (!aggressive) {
+                  return;
+                }
+                how = "prev";
+              }
+            }
+            if (how == "prev") {
+              if (n2 > doc.first) {
+                indentation = countColumn(
+                  getLine2(doc, n2 - 1).text,
+                  null,
+                  tabSize
+                );
+              } else {
+                indentation = 0;
+              }
+            } else if (how == "add") {
+              indentation = curSpace + cm.options.indentUnit;
+            } else if (how == "subtract") {
+              indentation = curSpace - cm.options.indentUnit;
+            } else if (typeof how == "number") {
+              indentation = curSpace + how;
+            }
+            indentation = Math.max(0, indentation);
+            var indentString = "",
+              pos = 0;
+            if (cm.options.indentWithTabs) {
+              for (var i2 = Math.floor(indentation / tabSize); i2; --i2) {
+                pos += tabSize;
+                indentString += "	";
+              }
+            }
+            if (pos < indentation) {
+              indentString += spaceStr(indentation - pos);
+            }
+            if (indentString != curSpaceString) {
+              replaceRange(
+                doc,
+                indentString,
+                Pos(n2, 0),
+                Pos(n2, curSpaceString.length),
+                "+input"
+              );
+              line.stateAfter = null;
+              return true;
+            } else {
+              for (var i$12 = 0; i$12 < doc.sel.ranges.length; i$12++) {
+                var range3 = doc.sel.ranges[i$12];
+                if (
+                  range3.head.line == n2 &&
+                  range3.head.ch < curSpaceString.length
+                ) {
+                  var pos$1 = Pos(n2, curSpaceString.length);
+                  replaceOneSelection(doc, i$12, new Range2(pos$1, pos$1));
+                  break;
+                }
+              }
+            }
+          }
+          var lastCopied = null;
+          function setLastCopied(newLastCopied) {
+            lastCopied = newLastCopied;
+          }
+          function applyTextInput(cm, inserted, deleted, sel, origin) {
+            var doc = cm.doc;
+            cm.display.shift = false;
+            if (!sel) {
+              sel = doc.sel;
+            }
+            var recent = +new Date() - 200;
+            var paste = origin == "paste" || cm.state.pasteIncoming > recent;
+            var textLines = splitLinesAuto(inserted),
+              multiPaste = null;
+            if (paste && sel.ranges.length > 1) {
+              if (lastCopied && lastCopied.text.join("\n") == inserted) {
+                if (sel.ranges.length % lastCopied.text.length == 0) {
+                  multiPaste = [];
+                  for (var i2 = 0; i2 < lastCopied.text.length; i2++) {
+                    multiPaste.push(doc.splitLines(lastCopied.text[i2]));
+                  }
+                }
+              } else if (
+                textLines.length == sel.ranges.length &&
+                cm.options.pasteLinesPerSelection
+              ) {
+                multiPaste = map2(textLines, function (l2) {
+                  return [l2];
+                });
+              }
+            }
+            var updateInput = cm.curOp.updateInput;
+            for (var i$12 = sel.ranges.length - 1; i$12 >= 0; i$12--) {
+              var range3 = sel.ranges[i$12];
+              var from = range3.from(),
+                to = range3.to();
+              if (range3.empty()) {
+                if (deleted && deleted > 0) {
+                  from = Pos(from.line, from.ch - deleted);
+                } else if (cm.state.overwrite && !paste) {
+                  to = Pos(
+                    to.line,
+                    Math.min(
+                      getLine2(doc, to.line).text.length,
+                      to.ch + lst(textLines).length
+                    )
+                  );
+                } else if (
+                  paste &&
+                  lastCopied &&
+                  lastCopied.lineWise &&
+                  lastCopied.text.join("\n") == textLines.join("\n")
+                ) {
+                  from = to = Pos(from.line, 0);
+                }
+              }
+              var changeEvent = {
+                from,
+                to,
+                text: multiPaste
+                  ? multiPaste[i$12 % multiPaste.length]
+                  : textLines,
+                origin:
+                  origin ||
+                  (paste
+                    ? "paste"
+                    : cm.state.cutIncoming > recent
+                    ? "cut"
+                    : "+input"),
+              };
+              makeChange(cm.doc, changeEvent);
+              signalLater(cm, "inputRead", cm, changeEvent);
+            }
+            if (inserted && !paste) {
+              triggerElectric(cm, inserted);
+            }
+            ensureCursorVisible(cm);
+            if (cm.curOp.updateInput < 2) {
+              cm.curOp.updateInput = updateInput;
+            }
+            cm.curOp.typing = true;
+            cm.state.pasteIncoming = cm.state.cutIncoming = -1;
+          }
+          function handlePaste(e, cm) {
+            var pasted = e.clipboardData && e.clipboardData.getData("Text");
+            if (pasted) {
+              e.preventDefault();
+              if (!cm.isReadOnly() && !cm.options.disableInput) {
+                runInOp(cm, function () {
+                  return applyTextInput(cm, pasted, 0, null, "paste");
+                });
+              }
+              return true;
+            }
+          }
+          function triggerElectric(cm, inserted) {
+            if (!cm.options.electricChars || !cm.options.smartIndent) {
+              return;
+            }
+            var sel = cm.doc.sel;
+            for (var i2 = sel.ranges.length - 1; i2 >= 0; i2--) {
+              var range3 = sel.ranges[i2];
+              if (
+                range3.head.ch > 100 ||
+                (i2 && sel.ranges[i2 - 1].head.line == range3.head.line)
+              ) {
+                continue;
+              }
+              var mode2 = cm.getModeAt(range3.head);
+              var indented = false;
+              if (mode2.electricChars) {
+                for (var j = 0; j < mode2.electricChars.length; j++) {
+                  if (inserted.indexOf(mode2.electricChars.charAt(j)) > -1) {
+                    indented = indentLine(cm, range3.head.line, "smart");
+                    break;
+                  }
+                }
+              } else if (mode2.electricInput) {
+                if (
+                  mode2.electricInput.test(
+                    getLine2(cm.doc, range3.head.line).text.slice(
+                      0,
+                      range3.head.ch
+                    )
+                  )
+                ) {
+                  indented = indentLine(cm, range3.head.line, "smart");
+                }
+              }
+              if (indented) {
+                signalLater(cm, "electricInput", cm, range3.head.line);
+              }
+            }
+          }
+          function copyableRanges(cm) {
+            var text3 = [],
+              ranges = [];
+            for (var i2 = 0; i2 < cm.doc.sel.ranges.length; i2++) {
+              var line = cm.doc.sel.ranges[i2].head.line;
+              var lineRange = { anchor: Pos(line, 0), head: Pos(line + 1, 0) };
+              ranges.push(lineRange);
+              text3.push(cm.getRange(lineRange.anchor, lineRange.head));
+            }
+            return { text: text3, ranges };
+          }
+          function disableBrowserMagic(
+            field,
+            spellcheck,
+            autocorrect,
+            autocapitalize
+          ) {
+            field.setAttribute("autocorrect", autocorrect ? "" : "off");
+            field.setAttribute("autocapitalize", autocapitalize ? "" : "off");
+            field.setAttribute("spellcheck", !!spellcheck);
+          }
+          function hiddenTextarea() {
+            var te = elt(
+              "textarea",
+              null,
+              null,
+              "position: absolute; bottom: -1em; padding: 0; width: 1px; height: 1em; min-height: 1em; outline: none"
+            );
+            var div2 = elt(
+              "div",
+              [te],
+              null,
+              "overflow: hidden; position: relative; width: 3px; height: 0px;"
+            );
+            if (webkit) {
+              te.style.width = "1000px";
+            } else {
+              te.setAttribute("wrap", "off");
+            }
+            if (ios) {
+              te.style.border = "1px solid black";
+            }
+            disableBrowserMagic(te);
+            return div2;
+          }
+          function addEditorMethods(CodeMirror2) {
+            var optionHandlers2 = CodeMirror2.optionHandlers;
+            var helpers2 = (CodeMirror2.helpers = {});
+            CodeMirror2.prototype = {
+              constructor: CodeMirror2,
+              focus: function () {
+                window.focus();
+                this.display.input.focus();
+              },
+              setOption: function (option, value) {
+                var options = this.options,
+                  old = options[option];
+                if (options[option] == value && option != "mode") {
+                  return;
+                }
+                options[option] = value;
+                if (optionHandlers2.hasOwnProperty(option)) {
+                  operation(this, optionHandlers2[option])(this, value, old);
+                }
+                signal(this, "optionChange", this, option);
+              },
+              getOption: function (option) {
+                return this.options[option];
+              },
+              getDoc: function () {
+                return this.doc;
+              },
+              addKeyMap: function (map3, bottom2) {
+                this.state.keyMaps[bottom2 ? "push" : "unshift"](
+                  getKeyMap(map3)
+                );
+              },
+              removeKeyMap: function (map3) {
+                var maps = this.state.keyMaps;
+                for (var i2 = 0; i2 < maps.length; ++i2) {
+                  if (maps[i2] == map3 || maps[i2].name == map3) {
+                    maps.splice(i2, 1);
+                    return true;
+                  }
+                }
+              },
+              addOverlay: methodOp(function (spec, options) {
+                var mode2 = spec.token
+                  ? spec
+                  : CodeMirror2.getMode(this.options, spec);
+                if (mode2.startState) {
+                  throw new Error("Overlays may not be stateful.");
+                }
+                insertSorted(
+                  this.state.overlays,
+                  {
+                    mode: mode2,
+                    modeSpec: spec,
+                    opaque: options && options.opaque,
+                    priority: (options && options.priority) || 0,
+                  },
+                  function (overlay) {
+                    return overlay.priority;
+                  }
+                );
+                this.state.modeGen++;
+                regChange(this);
+              }),
+              removeOverlay: methodOp(function (spec) {
+                var overlays = this.state.overlays;
+                for (var i2 = 0; i2 < overlays.length; ++i2) {
+                  var cur = overlays[i2].modeSpec;
+                  if (
+                    cur == spec ||
+                    (typeof spec == "string" && cur.name == spec)
+                  ) {
+                    overlays.splice(i2, 1);
+                    this.state.modeGen++;
+                    regChange(this);
+                    return;
+                  }
+                }
+              }),
+              indentLine: methodOp(function (n2, dir, aggressive) {
+                if (typeof dir != "string" && typeof dir != "number") {
+                  if (dir == null) {
+                    dir = this.options.smartIndent ? "smart" : "prev";
+                  } else {
+                    dir = dir ? "add" : "subtract";
+                  }
+                }
+                if (isLine(this.doc, n2)) {
+                  indentLine(this, n2, dir, aggressive);
+                }
+              }),
+              indentSelection: methodOp(function (how) {
+                var ranges = this.doc.sel.ranges,
+                  end2 = -1;
+                for (var i2 = 0; i2 < ranges.length; i2++) {
+                  var range3 = ranges[i2];
+                  if (!range3.empty()) {
+                    var from = range3.from(),
+                      to = range3.to();
+                    var start2 = Math.max(end2, from.line);
+                    end2 =
+                      Math.min(this.lastLine(), to.line - (to.ch ? 0 : 1)) + 1;
+                    for (var j = start2; j < end2; ++j) {
+                      indentLine(this, j, how);
+                    }
+                    var newRanges = this.doc.sel.ranges;
+                    if (
+                      from.ch == 0 &&
+                      ranges.length == newRanges.length &&
+                      newRanges[i2].from().ch > 0
+                    ) {
+                      replaceOneSelection(
+                        this.doc,
+                        i2,
+                        new Range2(from, newRanges[i2].to()),
+                        sel_dontScroll
+                      );
+                    }
+                  } else if (range3.head.line > end2) {
+                    indentLine(this, range3.head.line, how, true);
+                    end2 = range3.head.line;
+                    if (i2 == this.doc.sel.primIndex) {
+                      ensureCursorVisible(this);
+                    }
+                  }
+                }
+              }),
+              getTokenAt: function (pos, precise) {
+                return takeToken(this, pos, precise);
+              },
+              getLineTokens: function (line, precise) {
+                return takeToken(this, Pos(line), precise, true);
+              },
+              getTokenTypeAt: function (pos) {
+                pos = clipPos(this.doc, pos);
+                var styles2 = getLineStyles(this, getLine2(this.doc, pos.line));
+                var before = 0,
+                  after = (styles2.length - 1) / 2,
+                  ch2 = pos.ch;
+                var type2;
+                if (ch2 == 0) {
+                  type2 = styles2[2];
+                } else {
+                  for (;;) {
+                    var mid2 = (before + after) >> 1;
+                    if ((mid2 ? styles2[mid2 * 2 - 1] : 0) >= ch2) {
+                      after = mid2;
+                    } else if (styles2[mid2 * 2 + 1] < ch2) {
+                      before = mid2 + 1;
+                    } else {
+                      type2 = styles2[mid2 * 2 + 2];
+                      break;
+                    }
+                  }
+                }
+                var cut = type2 ? type2.indexOf("overlay ") : -1;
+                return cut < 0
+                  ? type2
+                  : cut == 0
+                  ? null
+                  : type2.slice(0, cut - 1);
+              },
+              getModeAt: function (pos) {
+                var mode2 = this.doc.mode;
+                if (!mode2.innerMode) {
+                  return mode2;
+                }
+                return CodeMirror2.innerMode(mode2, this.getTokenAt(pos).state)
+                  .mode;
+              },
+              getHelper: function (pos, type2) {
+                return this.getHelpers(pos, type2)[0];
+              },
+              getHelpers: function (pos, type2) {
+                var found = [];
+                if (!helpers2.hasOwnProperty(type2)) {
+                  return found;
+                }
+                var help = helpers2[type2],
+                  mode2 = this.getModeAt(pos);
+                if (typeof mode2[type2] == "string") {
+                  if (help[mode2[type2]]) {
+                    found.push(help[mode2[type2]]);
+                  }
+                } else if (mode2[type2]) {
+                  for (var i2 = 0; i2 < mode2[type2].length; i2++) {
+                    var val = help[mode2[type2][i2]];
+                    if (val) {
+                      found.push(val);
+                    }
+                  }
+                } else if (mode2.helperType && help[mode2.helperType]) {
+                  found.push(help[mode2.helperType]);
+                } else if (help[mode2.name]) {
+                  found.push(help[mode2.name]);
+                }
+                for (var i$12 = 0; i$12 < help._global.length; i$12++) {
+                  var cur = help._global[i$12];
+                  if (cur.pred(mode2, this) && indexOf(found, cur.val) == -1) {
+                    found.push(cur.val);
+                  }
+                }
+                return found;
+              },
+              getStateAfter: function (line, precise) {
+                var doc = this.doc;
+                line = clipLine(
+                  doc,
+                  line == null ? doc.first + doc.size - 1 : line
+                );
+                return getContextBefore(this, line + 1, precise).state;
+              },
+              cursorCoords: function (start2, mode2) {
+                var pos,
+                  range3 = this.doc.sel.primary();
+                if (start2 == null) {
+                  pos = range3.head;
+                } else if (typeof start2 == "object") {
+                  pos = clipPos(this.doc, start2);
+                } else {
+                  pos = start2 ? range3.from() : range3.to();
+                }
+                return cursorCoords(this, pos, mode2 || "page");
+              },
+              charCoords: function (pos, mode2) {
+                return charCoords(
+                  this,
+                  clipPos(this.doc, pos),
+                  mode2 || "page"
+                );
+              },
+              coordsChar: function (coords, mode2) {
+                coords = fromCoordSystem(this, coords, mode2 || "page");
+                return coordsChar(this, coords.left, coords.top);
+              },
+              lineAtHeight: function (height, mode2) {
+                height = fromCoordSystem(
+                  this,
+                  { top: height, left: 0 },
+                  mode2 || "page"
+                ).top;
+                return lineAtHeight(this.doc, height + this.display.viewOffset);
+              },
+              heightAtLine: function (line, mode2, includeWidgets) {
+                var end2 = false,
+                  lineObj;
+                if (typeof line == "number") {
+                  var last = this.doc.first + this.doc.size - 1;
+                  if (line < this.doc.first) {
+                    line = this.doc.first;
+                  } else if (line > last) {
+                    line = last;
+                    end2 = true;
+                  }
+                  lineObj = getLine2(this.doc, line);
+                } else {
+                  lineObj = line;
+                }
+                return (
+                  intoCoordSystem(
+                    this,
+                    lineObj,
+                    { top: 0, left: 0 },
+                    mode2 || "page",
+                    includeWidgets || end2
+                  ).top + (end2 ? this.doc.height - heightAtLine(lineObj) : 0)
+                );
+              },
+              defaultTextHeight: function () {
+                return textHeight(this.display);
+              },
+              defaultCharWidth: function () {
+                return charWidth(this.display);
+              },
+              getViewport: function () {
+                return { from: this.display.viewFrom, to: this.display.viewTo };
+              },
+              addWidget: function (pos, node, scroll, vert2, horiz) {
+                var display = this.display;
+                pos = cursorCoords(this, clipPos(this.doc, pos));
+                var top2 = pos.bottom,
+                  left = pos.left;
+                node.style.position = "absolute";
+                node.setAttribute("cm-ignore-events", "true");
+                this.display.input.setUneditable(node);
+                display.sizer.appendChild(node);
+                if (vert2 == "over") {
+                  top2 = pos.top;
+                } else if (vert2 == "above" || vert2 == "near") {
+                  var vspace = Math.max(
+                      display.wrapper.clientHeight,
+                      this.doc.height
+                    ),
+                    hspace = Math.max(
+                      display.sizer.clientWidth,
+                      display.lineSpace.clientWidth
+                    );
+                  if (
+                    (vert2 == "above" ||
+                      pos.bottom + node.offsetHeight > vspace) &&
+                    pos.top > node.offsetHeight
+                  ) {
+                    top2 = pos.top - node.offsetHeight;
+                  } else if (pos.bottom + node.offsetHeight <= vspace) {
+                    top2 = pos.bottom;
+                  }
+                  if (left + node.offsetWidth > hspace) {
+                    left = hspace - node.offsetWidth;
+                  }
+                }
+                node.style.top = top2 + "px";
+                node.style.left = node.style.right = "";
+                if (horiz == "right") {
+                  left = display.sizer.clientWidth - node.offsetWidth;
+                  node.style.right = "0px";
+                } else {
+                  if (horiz == "left") {
+                    left = 0;
+                  } else if (horiz == "middle") {
+                    left = (display.sizer.clientWidth - node.offsetWidth) / 2;
+                  }
+                  node.style.left = left + "px";
+                }
+                if (scroll) {
+                  scrollIntoView(this, {
+                    left,
+                    top: top2,
+                    right: left + node.offsetWidth,
+                    bottom: top2 + node.offsetHeight,
+                  });
+                }
+              },
+              triggerOnKeyDown: methodOp(onKeyDown2),
+              triggerOnKeyPress: methodOp(onKeyPress),
+              triggerOnKeyUp: onKeyUp,
+              triggerOnMouseDown: methodOp(onMouseDown),
+              execCommand: function (cmd) {
+                if (commands.hasOwnProperty(cmd)) {
+                  return commands[cmd].call(null, this);
+                }
+              },
+              triggerElectric: methodOp(function (text3) {
+                triggerElectric(this, text3);
+              }),
+              findPosH: function (from, amount, unit, visually) {
+                var dir = 1;
+                if (amount < 0) {
+                  dir = -1;
+                  amount = -amount;
+                }
+                var cur = clipPos(this.doc, from);
+                for (var i2 = 0; i2 < amount; ++i2) {
+                  cur = findPosH(this.doc, cur, dir, unit, visually);
+                  if (cur.hitSide) {
+                    break;
+                  }
+                }
+                return cur;
+              },
+              moveH: methodOp(function (dir, unit) {
+                var this$1$1 = this;
+                this.extendSelectionsBy(function (range3) {
+                  if (
+                    this$1$1.display.shift ||
+                    this$1$1.doc.extend ||
+                    range3.empty()
+                  ) {
+                    return findPosH(
+                      this$1$1.doc,
+                      range3.head,
+                      dir,
+                      unit,
+                      this$1$1.options.rtlMoveVisually
+                    );
+                  } else {
+                    return dir < 0 ? range3.from() : range3.to();
+                  }
+                }, sel_move);
+              }),
+              deleteH: methodOp(function (dir, unit) {
+                var sel = this.doc.sel,
+                  doc = this.doc;
+                if (sel.somethingSelected()) {
+                  doc.replaceSelection("", null, "+delete");
+                } else {
+                  deleteNearSelection(this, function (range3) {
+                    var other = findPosH(doc, range3.head, dir, unit, false);
+                    return dir < 0
+                      ? { from: other, to: range3.head }
+                      : { from: range3.head, to: other };
+                  });
+                }
+              }),
+              findPosV: function (from, amount, unit, goalColumn) {
+                var dir = 1,
+                  x2 = goalColumn;
+                if (amount < 0) {
+                  dir = -1;
+                  amount = -amount;
+                }
+                var cur = clipPos(this.doc, from);
+                for (var i2 = 0; i2 < amount; ++i2) {
+                  var coords = cursorCoords(this, cur, "div");
+                  if (x2 == null) {
+                    x2 = coords.left;
+                  } else {
+                    coords.left = x2;
+                  }
+                  cur = findPosV(this, coords, dir, unit);
+                  if (cur.hitSide) {
+                    break;
+                  }
+                }
+                return cur;
+              },
+              moveV: methodOp(function (dir, unit) {
+                var this$1$1 = this;
+                var doc = this.doc,
+                  goals = [];
+                var collapse =
+                  !this.display.shift &&
+                  !doc.extend &&
+                  doc.sel.somethingSelected();
+                doc.extendSelectionsBy(function (range3) {
+                  if (collapse) {
+                    return dir < 0 ? range3.from() : range3.to();
+                  }
+                  var headPos = cursorCoords(this$1$1, range3.head, "div");
+                  if (range3.goalColumn != null) {
+                    headPos.left = range3.goalColumn;
+                  }
+                  goals.push(headPos.left);
+                  var pos = findPosV(this$1$1, headPos, dir, unit);
+                  if (unit == "page" && range3 == doc.sel.primary()) {
+                    addToScrollTop(
+                      this$1$1,
+                      charCoords(this$1$1, pos, "div").top - headPos.top
+                    );
+                  }
+                  return pos;
+                }, sel_move);
+                if (goals.length) {
+                  for (var i2 = 0; i2 < doc.sel.ranges.length; i2++) {
+                    doc.sel.ranges[i2].goalColumn = goals[i2];
+                  }
+                }
+              }),
+              findWordAt: function (pos) {
+                var doc = this.doc,
+                  line = getLine2(doc, pos.line).text;
+                var start2 = pos.ch,
+                  end2 = pos.ch;
+                if (line) {
+                  var helper = this.getHelper(pos, "wordChars");
+                  if (
+                    (pos.sticky == "before" || end2 == line.length) &&
+                    start2
+                  ) {
+                    --start2;
+                  } else {
+                    ++end2;
+                  }
+                  var startChar = line.charAt(start2);
+                  var check2 = isWordChar(startChar, helper)
+                    ? function (ch2) {
+                        return isWordChar(ch2, helper);
+                      }
+                    : /\s/.test(startChar)
+                    ? function (ch2) {
+                        return /\s/.test(ch2);
+                      }
+                    : function (ch2) {
+                        return !/\s/.test(ch2) && !isWordChar(ch2);
+                      };
+                  while (start2 > 0 && check2(line.charAt(start2 - 1))) {
+                    --start2;
+                  }
+                  while (end2 < line.length && check2(line.charAt(end2))) {
+                    ++end2;
+                  }
+                }
+                return new Range2(Pos(pos.line, start2), Pos(pos.line, end2));
+              },
+              toggleOverwrite: function (value) {
+                if (value != null && value == this.state.overwrite) {
+                  return;
+                }
+                if ((this.state.overwrite = !this.state.overwrite)) {
+                  addClass(this.display.cursorDiv, "CodeMirror-overwrite");
+                } else {
+                  rmClass(this.display.cursorDiv, "CodeMirror-overwrite");
+                }
+                signal(this, "overwriteToggle", this, this.state.overwrite);
+              },
+              hasFocus: function () {
+                return this.display.input.getField() == activeElt();
+              },
+              isReadOnly: function () {
+                return !!(this.options.readOnly || this.doc.cantEdit);
+              },
+              scrollTo: methodOp(function (x2, y2) {
+                scrollToCoords(this, x2, y2);
+              }),
+              getScrollInfo: function () {
+                var scroller = this.display.scroller;
+                return {
+                  left: scroller.scrollLeft,
+                  top: scroller.scrollTop,
+                  height:
+                    scroller.scrollHeight -
+                    scrollGap(this) -
+                    this.display.barHeight,
+                  width:
+                    scroller.scrollWidth -
+                    scrollGap(this) -
+                    this.display.barWidth,
+                  clientHeight: displayHeight(this),
+                  clientWidth: displayWidth(this),
+                };
+              },
+              scrollIntoView: methodOp(function (range3, margin) {
+                if (range3 == null) {
+                  range3 = { from: this.doc.sel.primary().head, to: null };
+                  if (margin == null) {
+                    margin = this.options.cursorScrollMargin;
+                  }
+                } else if (typeof range3 == "number") {
+                  range3 = { from: Pos(range3, 0), to: null };
+                } else if (range3.from == null) {
+                  range3 = { from: range3, to: null };
+                }
+                if (!range3.to) {
+                  range3.to = range3.from;
+                }
+                range3.margin = margin || 0;
+                if (range3.from.line != null) {
+                  scrollToRange(this, range3);
+                } else {
+                  scrollToCoordsRange(
+                    this,
+                    range3.from,
+                    range3.to,
+                    range3.margin
+                  );
+                }
+              }),
+              setSize: methodOp(function (width, height) {
+                var this$1$1 = this;
+                var interpret = function (val) {
+                  return typeof val == "number" || /^\d+$/.test(String(val))
+                    ? val + "px"
+                    : val;
+                };
+                if (width != null) {
+                  this.display.wrapper.style.width = interpret(width);
+                }
+                if (height != null) {
+                  this.display.wrapper.style.height = interpret(height);
+                }
+                if (this.options.lineWrapping) {
+                  clearLineMeasurementCache(this);
+                }
+                var lineNo2 = this.display.viewFrom;
+                this.doc.iter(lineNo2, this.display.viewTo, function (line) {
+                  if (line.widgets) {
+                    for (var i2 = 0; i2 < line.widgets.length; i2++) {
+                      if (line.widgets[i2].noHScroll) {
+                        regLineChange(this$1$1, lineNo2, "widget");
+                        break;
+                      }
+                    }
+                  }
+                  ++lineNo2;
+                });
+                this.curOp.forceUpdate = true;
+                signal(this, "refresh", this);
+              }),
+              operation: function (f) {
+                return runInOp(this, f);
+              },
+              startOperation: function () {
+                return startOperation(this);
+              },
+              endOperation: function () {
+                return endOperation(this);
+              },
+              refresh: methodOp(function () {
+                var oldHeight = this.display.cachedTextHeight;
+                regChange(this);
+                this.curOp.forceUpdate = true;
+                clearCaches(this);
+                scrollToCoords(this, this.doc.scrollLeft, this.doc.scrollTop);
+                updateGutterSpace(this.display);
+                if (
+                  oldHeight == null ||
+                  Math.abs(oldHeight - textHeight(this.display)) > 0.5 ||
+                  this.options.lineWrapping
+                ) {
+                  estimateLineHeights(this);
+                }
+                signal(this, "refresh", this);
+              }),
+              swapDoc: methodOp(function (doc) {
+                var old = this.doc;
+                old.cm = null;
+                if (this.state.selectingText) {
+                  this.state.selectingText();
+                }
+                attachDoc(this, doc);
+                clearCaches(this);
+                this.display.input.reset();
+                scrollToCoords(this, doc.scrollLeft, doc.scrollTop);
+                this.curOp.forceScroll = true;
+                signalLater(this, "swapDoc", this, old);
+                return old;
+              }),
+              phrase: function (phraseText) {
+                var phrases = this.options.phrases;
+                return phrases &&
+                  Object.prototype.hasOwnProperty.call(phrases, phraseText)
+                  ? phrases[phraseText]
+                  : phraseText;
+              },
+              getInputField: function () {
+                return this.display.input.getField();
+              },
+              getWrapperElement: function () {
+                return this.display.wrapper;
+              },
+              getScrollerElement: function () {
+                return this.display.scroller;
+              },
+              getGutterElement: function () {
+                return this.display.gutters;
+              },
+            };
+            eventMixin(CodeMirror2);
+            CodeMirror2.registerHelper = function (type2, name2, value) {
+              if (!helpers2.hasOwnProperty(type2)) {
+                helpers2[type2] = CodeMirror2[type2] = { _global: [] };
+              }
+              helpers2[type2][name2] = value;
+            };
+            CodeMirror2.registerGlobalHelper = function (
+              type2,
+              name2,
+              predicate,
+              value
+            ) {
+              CodeMirror2.registerHelper(type2, name2, value);
+              helpers2[type2]._global.push({ pred: predicate, val: value });
+            };
+          }
+          function findPosH(doc, pos, dir, unit, visually) {
+            var oldPos = pos;
+            var origDir = dir;
+            var lineObj = getLine2(doc, pos.line);
+            var lineDir = visually && doc.direction == "rtl" ? -dir : dir;
+            function findNextLine() {
+              var l2 = pos.line + lineDir;
+              if (l2 < doc.first || l2 >= doc.first + doc.size) {
+                return false;
+              }
+              pos = new Pos(l2, pos.ch, pos.sticky);
+              return (lineObj = getLine2(doc, l2));
+            }
+            function moveOnce(boundToLine) {
+              var next;
+              if (unit == "codepoint") {
+                var ch2 = lineObj.text.charCodeAt(pos.ch + (dir > 0 ? 0 : -1));
+                if (isNaN(ch2)) {
+                  next = null;
+                } else {
+                  var astral =
+                    dir > 0
+                      ? ch2 >= 55296 && ch2 < 56320
+                      : ch2 >= 56320 && ch2 < 57343;
+                  next = new Pos(
+                    pos.line,
+                    Math.max(
+                      0,
+                      Math.min(
+                        lineObj.text.length,
+                        pos.ch + dir * (astral ? 2 : 1)
+                      )
+                    ),
+                    -dir
+                  );
+                }
+              } else if (visually) {
+                next = moveVisually(doc.cm, lineObj, pos, dir);
+              } else {
+                next = moveLogically(lineObj, pos, dir);
+              }
+              if (next == null) {
+                if (!boundToLine && findNextLine()) {
+                  pos = endOfLine(visually, doc.cm, lineObj, pos.line, lineDir);
+                } else {
+                  return false;
+                }
+              } else {
+                pos = next;
+              }
+              return true;
+            }
+            if (unit == "char" || unit == "codepoint") {
+              moveOnce();
+            } else if (unit == "column") {
+              moveOnce(true);
+            } else if (unit == "word" || unit == "group") {
+              var sawType = null,
+                group = unit == "group";
+              var helper = doc.cm && doc.cm.getHelper(pos, "wordChars");
+              for (var first = true; ; first = false) {
+                if (dir < 0 && !moveOnce(!first)) {
+                  break;
+                }
+                var cur = lineObj.text.charAt(pos.ch) || "\n";
+                var type2 = isWordChar(cur, helper)
+                  ? "w"
+                  : group && cur == "\n"
+                  ? "n"
+                  : !group || /\s/.test(cur)
+                  ? null
+                  : "p";
+                if (group && !first && !type2) {
+                  type2 = "s";
+                }
+                if (sawType && sawType != type2) {
+                  if (dir < 0) {
+                    dir = 1;
+                    moveOnce();
+                    pos.sticky = "after";
+                  }
+                  break;
+                }
+                if (type2) {
+                  sawType = type2;
+                }
+                if (dir > 0 && !moveOnce(!first)) {
+                  break;
+                }
+              }
+            }
+            var result2 = skipAtomic(doc, pos, oldPos, origDir, true);
+            if (equalCursorPos(oldPos, result2)) {
+              result2.hitSide = true;
+            }
+            return result2;
+          }
+          function findPosV(cm, pos, dir, unit) {
+            var doc = cm.doc,
+              x2 = pos.left,
+              y2;
+            if (unit == "page") {
+              var pageSize = Math.min(
+                cm.display.wrapper.clientHeight,
+                window.innerHeight || document.documentElement.clientHeight
+              );
+              var moveAmount = Math.max(
+                pageSize - 0.5 * textHeight(cm.display),
+                3
+              );
+              y2 = (dir > 0 ? pos.bottom : pos.top) + dir * moveAmount;
+            } else if (unit == "line") {
+              y2 = dir > 0 ? pos.bottom + 3 : pos.top - 3;
+            }
+            var target2;
+            for (;;) {
+              target2 = coordsChar(cm, x2, y2);
+              if (!target2.outside) {
+                break;
+              }
+              if (dir < 0 ? y2 <= 0 : y2 >= doc.height) {
+                target2.hitSide = true;
+                break;
+              }
+              y2 += dir * 5;
+            }
+            return target2;
+          }
+          var ContentEditableInput = function (cm) {
+            this.cm = cm;
+            this.lastAnchorNode =
+              this.lastAnchorOffset =
+              this.lastFocusNode =
+              this.lastFocusOffset =
+                null;
+            this.polling = new Delayed();
+            this.composing = null;
+            this.gracePeriod = false;
+            this.readDOMTimeout = null;
+          };
+          ContentEditableInput.prototype.init = function (display) {
+            var this$1$1 = this;
+            var input = this,
+              cm = input.cm;
+            var div2 = (input.div = display.lineDiv);
+            div2.contentEditable = true;
+            disableBrowserMagic(
+              div2,
+              cm.options.spellcheck,
+              cm.options.autocorrect,
+              cm.options.autocapitalize
+            );
+            function belongsToInput(e) {
+              for (var t2 = e.target; t2; t2 = t2.parentNode) {
+                if (t2 == div2) {
+                  return true;
+                }
+                if (/\bCodeMirror-(?:line)?widget\b/.test(t2.className)) {
+                  break;
+                }
+              }
+              return false;
+            }
+            on(div2, "paste", function (e) {
+              if (
+                !belongsToInput(e) ||
+                signalDOMEvent(cm, e) ||
+                handlePaste(e, cm)
+              ) {
+                return;
+              }
+              if (ie_version <= 11) {
+                setTimeout(
+                  operation(cm, function () {
+                    return this$1$1.updateFromDOM();
+                  }),
+                  20
+                );
+              }
+            });
+            on(div2, "compositionstart", function (e) {
+              this$1$1.composing = { data: e.data, done: false };
+            });
+            on(div2, "compositionupdate", function (e) {
+              if (!this$1$1.composing) {
+                this$1$1.composing = { data: e.data, done: false };
+              }
+            });
+            on(div2, "compositionend", function (e) {
+              if (this$1$1.composing) {
+                if (e.data != this$1$1.composing.data) {
+                  this$1$1.readFromDOMSoon();
+                }
+                this$1$1.composing.done = true;
+              }
+            });
+            on(div2, "touchstart", function () {
+              return input.forceCompositionEnd();
+            });
+            on(div2, "input", function () {
+              if (!this$1$1.composing) {
+                this$1$1.readFromDOMSoon();
+              }
+            });
+            function onCopyCut(e) {
+              if (!belongsToInput(e) || signalDOMEvent(cm, e)) {
+                return;
+              }
+              if (cm.somethingSelected()) {
+                setLastCopied({ lineWise: false, text: cm.getSelections() });
+                if (e.type == "cut") {
+                  cm.replaceSelection("", null, "cut");
+                }
+              } else if (!cm.options.lineWiseCopyCut) {
+                return;
+              } else {
+                var ranges = copyableRanges(cm);
+                setLastCopied({ lineWise: true, text: ranges.text });
+                if (e.type == "cut") {
+                  cm.operation(function () {
+                    cm.setSelections(ranges.ranges, 0, sel_dontScroll);
+                    cm.replaceSelection("", null, "cut");
+                  });
+                }
+              }
+              if (e.clipboardData) {
+                e.clipboardData.clearData();
+                var content = lastCopied.text.join("\n");
+                e.clipboardData.setData("Text", content);
+                if (e.clipboardData.getData("Text") == content) {
+                  e.preventDefault();
+                  return;
+                }
+              }
+              var kludge = hiddenTextarea(),
+                te = kludge.firstChild;
+              cm.display.lineSpace.insertBefore(
+                kludge,
+                cm.display.lineSpace.firstChild
+              );
+              te.value = lastCopied.text.join("\n");
+              var hadFocus = activeElt();
+              selectInput(te);
+              setTimeout(function () {
+                cm.display.lineSpace.removeChild(kludge);
+                hadFocus.focus();
+                if (hadFocus == div2) {
+                  input.showPrimarySelection();
+                }
+              }, 50);
+            }
+            on(div2, "copy", onCopyCut);
+            on(div2, "cut", onCopyCut);
+          };
+          ContentEditableInput.prototype.screenReaderLabelChanged = function (
+            label
+          ) {
+            if (label) {
+              this.div.setAttribute("aria-label", label);
+            } else {
+              this.div.removeAttribute("aria-label");
+            }
+          };
+          ContentEditableInput.prototype.prepareSelection = function () {
+            var result2 = prepareSelection(this.cm, false);
+            result2.focus = activeElt() == this.div;
+            return result2;
+          };
+          ContentEditableInput.prototype.showSelection = function (
+            info2,
+            takeFocus
+          ) {
+            if (!info2 || !this.cm.display.view.length) {
+              return;
+            }
+            if (info2.focus || takeFocus) {
+              this.showPrimarySelection();
+            }
+            this.showMultipleSelections(info2);
+          };
+          ContentEditableInput.prototype.getSelection = function () {
+            return this.cm.display.wrapper.ownerDocument.getSelection();
+          };
+          ContentEditableInput.prototype.showPrimarySelection = function () {
+            var sel = this.getSelection(),
+              cm = this.cm,
+              prim = cm.doc.sel.primary();
+            var from = prim.from(),
+              to = prim.to();
+            if (
+              cm.display.viewTo == cm.display.viewFrom ||
+              from.line >= cm.display.viewTo ||
+              to.line < cm.display.viewFrom
+            ) {
+              sel.removeAllRanges();
+              return;
+            }
+            var curAnchor = domToPos(cm, sel.anchorNode, sel.anchorOffset);
+            var curFocus = domToPos(cm, sel.focusNode, sel.focusOffset);
+            if (
+              curAnchor &&
+              !curAnchor.bad &&
+              curFocus &&
+              !curFocus.bad &&
+              cmp(minPos(curAnchor, curFocus), from) == 0 &&
+              cmp(maxPos(curAnchor, curFocus), to) == 0
+            ) {
+              return;
+            }
+            var view = cm.display.view;
+            var start2 = (from.line >= cm.display.viewFrom &&
+              posToDOM(cm, from)) || {
+              node: view[0].measure.map[2],
+              offset: 0,
+            };
+            var end2 = to.line < cm.display.viewTo && posToDOM(cm, to);
+            if (!end2) {
+              var measure = view[view.length - 1].measure;
+              var map3 = measure.maps
+                ? measure.maps[measure.maps.length - 1]
+                : measure.map;
+              end2 = {
+                node: map3[map3.length - 1],
+                offset: map3[map3.length - 2] - map3[map3.length - 3],
+              };
+            }
+            if (!start2 || !end2) {
+              sel.removeAllRanges();
+              return;
+            }
+            var old = sel.rangeCount && sel.getRangeAt(0),
+              rng;
+            try {
+              rng = range2(start2.node, start2.offset, end2.offset, end2.node);
+            } catch (e) {}
+            if (rng) {
+              if (!gecko && cm.state.focused) {
+                sel.collapse(start2.node, start2.offset);
+                if (!rng.collapsed) {
+                  sel.removeAllRanges();
+                  sel.addRange(rng);
+                }
+              } else {
+                sel.removeAllRanges();
+                sel.addRange(rng);
+              }
+              if (old && sel.anchorNode == null) {
+                sel.addRange(old);
+              } else if (gecko) {
+                this.startGracePeriod();
+              }
+            }
+            this.rememberSelection();
+          };
+          ContentEditableInput.prototype.startGracePeriod = function () {
+            var this$1$1 = this;
+            clearTimeout(this.gracePeriod);
+            this.gracePeriod = setTimeout(function () {
+              this$1$1.gracePeriod = false;
+              if (this$1$1.selectionChanged()) {
+                this$1$1.cm.operation(function () {
+                  return (this$1$1.cm.curOp.selectionChanged = true);
+                });
+              }
+            }, 20);
+          };
+          ContentEditableInput.prototype.showMultipleSelections = function (
+            info2
+          ) {
+            removeChildrenAndAdd(this.cm.display.cursorDiv, info2.cursors);
+            removeChildrenAndAdd(this.cm.display.selectionDiv, info2.selection);
+          };
+          ContentEditableInput.prototype.rememberSelection = function () {
+            var sel = this.getSelection();
+            this.lastAnchorNode = sel.anchorNode;
+            this.lastAnchorOffset = sel.anchorOffset;
+            this.lastFocusNode = sel.focusNode;
+            this.lastFocusOffset = sel.focusOffset;
+          };
+          ContentEditableInput.prototype.selectionInEditor = function () {
+            var sel = this.getSelection();
+            if (!sel.rangeCount) {
+              return false;
+            }
+            var node = sel.getRangeAt(0).commonAncestorContainer;
+            return contains(this.div, node);
+          };
+          ContentEditableInput.prototype.focus = function () {
+            if (this.cm.options.readOnly != "nocursor") {
+              if (!this.selectionInEditor() || activeElt() != this.div) {
+                this.showSelection(this.prepareSelection(), true);
+              }
+              this.div.focus();
+            }
+          };
+          ContentEditableInput.prototype.blur = function () {
+            this.div.blur();
+          };
+          ContentEditableInput.prototype.getField = function () {
+            return this.div;
+          };
+          ContentEditableInput.prototype.supportsTouch = function () {
+            return true;
+          };
+          ContentEditableInput.prototype.receivedFocus = function () {
+            var this$1$1 = this;
+            var input = this;
+            if (this.selectionInEditor()) {
+              setTimeout(function () {
+                return this$1$1.pollSelection();
+              }, 20);
+            } else {
+              runInOp(this.cm, function () {
+                return (input.cm.curOp.selectionChanged = true);
+              });
+            }
+            function poll() {
+              if (input.cm.state.focused) {
+                input.pollSelection();
+                input.polling.set(input.cm.options.pollInterval, poll);
+              }
+            }
+            this.polling.set(this.cm.options.pollInterval, poll);
+          };
+          ContentEditableInput.prototype.selectionChanged = function () {
+            var sel = this.getSelection();
+            return (
+              sel.anchorNode != this.lastAnchorNode ||
+              sel.anchorOffset != this.lastAnchorOffset ||
+              sel.focusNode != this.lastFocusNode ||
+              sel.focusOffset != this.lastFocusOffset
+            );
+          };
+          ContentEditableInput.prototype.pollSelection = function () {
+            if (
+              this.readDOMTimeout != null ||
+              this.gracePeriod ||
+              !this.selectionChanged()
+            ) {
+              return;
+            }
+            var sel = this.getSelection(),
+              cm = this.cm;
+            if (
+              android &&
+              chrome &&
+              this.cm.display.gutterSpecs.length &&
+              isInGutter(sel.anchorNode)
+            ) {
+              this.cm.triggerOnKeyDown({
+                type: "keydown",
+                keyCode: 8,
+                preventDefault: Math.abs,
+              });
+              this.blur();
+              this.focus();
+              return;
+            }
+            if (this.composing) {
+              return;
+            }
+            this.rememberSelection();
+            var anchor = domToPos(cm, sel.anchorNode, sel.anchorOffset);
+            var head = domToPos(cm, sel.focusNode, sel.focusOffset);
+            if (anchor && head) {
+              runInOp(cm, function () {
+                setSelection(
+                  cm.doc,
+                  simpleSelection(anchor, head),
+                  sel_dontScroll
+                );
+                if (anchor.bad || head.bad) {
+                  cm.curOp.selectionChanged = true;
+                }
+              });
+            }
+          };
+          ContentEditableInput.prototype.pollContent = function () {
+            if (this.readDOMTimeout != null) {
+              clearTimeout(this.readDOMTimeout);
+              this.readDOMTimeout = null;
+            }
+            var cm = this.cm,
+              display = cm.display,
+              sel = cm.doc.sel.primary();
+            var from = sel.from(),
+              to = sel.to();
+            if (from.ch == 0 && from.line > cm.firstLine()) {
+              from = Pos(from.line - 1, getLine2(cm.doc, from.line - 1).length);
+            }
+            if (
+              to.ch == getLine2(cm.doc, to.line).text.length &&
+              to.line < cm.lastLine()
+            ) {
+              to = Pos(to.line + 1, 0);
+            }
+            if (from.line < display.viewFrom || to.line > display.viewTo - 1) {
+              return false;
+            }
+            var fromIndex, fromLine, fromNode;
+            if (
+              from.line == display.viewFrom ||
+              (fromIndex = findViewIndex(cm, from.line)) == 0
+            ) {
+              fromLine = lineNo(display.view[0].line);
+              fromNode = display.view[0].node;
+            } else {
+              fromLine = lineNo(display.view[fromIndex].line);
+              fromNode = display.view[fromIndex - 1].node.nextSibling;
+            }
+            var toIndex = findViewIndex(cm, to.line);
+            var toLine, toNode;
+            if (toIndex == display.view.length - 1) {
+              toLine = display.viewTo - 1;
+              toNode = display.lineDiv.lastChild;
+            } else {
+              toLine = lineNo(display.view[toIndex + 1].line) - 1;
+              toNode = display.view[toIndex + 1].node.previousSibling;
+            }
+            if (!fromNode) {
+              return false;
+            }
+            var newText = cm.doc.splitLines(
+              domTextBetween(cm, fromNode, toNode, fromLine, toLine)
+            );
+            var oldText = getBetween(
+              cm.doc,
+              Pos(fromLine, 0),
+              Pos(toLine, getLine2(cm.doc, toLine).text.length)
+            );
+            while (newText.length > 1 && oldText.length > 1) {
+              if (lst(newText) == lst(oldText)) {
+                newText.pop();
+                oldText.pop();
+                toLine--;
+              } else if (newText[0] == oldText[0]) {
+                newText.shift();
+                oldText.shift();
+                fromLine++;
+              } else {
+                break;
+              }
+            }
+            var cutFront = 0,
+              cutEnd = 0;
+            var newTop = newText[0],
+              oldTop = oldText[0],
+              maxCutFront = Math.min(newTop.length, oldTop.length);
+            while (
+              cutFront < maxCutFront &&
+              newTop.charCodeAt(cutFront) == oldTop.charCodeAt(cutFront)
+            ) {
+              ++cutFront;
+            }
+            var newBot = lst(newText),
+              oldBot = lst(oldText);
+            var maxCutEnd = Math.min(
+              newBot.length - (newText.length == 1 ? cutFront : 0),
+              oldBot.length - (oldText.length == 1 ? cutFront : 0)
+            );
+            while (
+              cutEnd < maxCutEnd &&
+              newBot.charCodeAt(newBot.length - cutEnd - 1) ==
+                oldBot.charCodeAt(oldBot.length - cutEnd - 1)
+            ) {
+              ++cutEnd;
+            }
+            if (
+              newText.length == 1 &&
+              oldText.length == 1 &&
+              fromLine == from.line
+            ) {
+              while (
+                cutFront &&
+                cutFront > from.ch &&
+                newBot.charCodeAt(newBot.length - cutEnd - 1) ==
+                  oldBot.charCodeAt(oldBot.length - cutEnd - 1)
+              ) {
+                cutFront--;
+                cutEnd++;
+              }
+            }
+            newText[newText.length - 1] = newBot
+              .slice(0, newBot.length - cutEnd)
+              .replace(/^\u200b+/, "");
+            newText[0] = newText[0].slice(cutFront).replace(/\u200b+$/, "");
+            var chFrom = Pos(fromLine, cutFront);
+            var chTo = Pos(
+              toLine,
+              oldText.length ? lst(oldText).length - cutEnd : 0
+            );
+            if (newText.length > 1 || newText[0] || cmp(chFrom, chTo)) {
+              replaceRange(cm.doc, newText, chFrom, chTo, "+input");
+              return true;
+            }
+          };
+          ContentEditableInput.prototype.ensurePolled = function () {
+            this.forceCompositionEnd();
+          };
+          ContentEditableInput.prototype.reset = function () {
+            this.forceCompositionEnd();
+          };
+          ContentEditableInput.prototype.forceCompositionEnd = function () {
+            if (!this.composing) {
+              return;
+            }
+            clearTimeout(this.readDOMTimeout);
+            this.composing = null;
+            this.updateFromDOM();
+            this.div.blur();
+            this.div.focus();
+          };
+          ContentEditableInput.prototype.readFromDOMSoon = function () {
+            var this$1$1 = this;
+            if (this.readDOMTimeout != null) {
+              return;
+            }
+            this.readDOMTimeout = setTimeout(function () {
+              this$1$1.readDOMTimeout = null;
+              if (this$1$1.composing) {
+                if (this$1$1.composing.done) {
+                  this$1$1.composing = null;
+                } else {
+                  return;
+                }
+              }
+              this$1$1.updateFromDOM();
+            }, 80);
+          };
+          ContentEditableInput.prototype.updateFromDOM = function () {
+            var this$1$1 = this;
+            if (this.cm.isReadOnly() || !this.pollContent()) {
+              runInOp(this.cm, function () {
+                return regChange(this$1$1.cm);
+              });
+            }
+          };
+          ContentEditableInput.prototype.setUneditable = function (node) {
+            node.contentEditable = "false";
+          };
+          ContentEditableInput.prototype.onKeyPress = function (e) {
+            if (e.charCode == 0 || this.composing) {
+              return;
+            }
+            e.preventDefault();
+            if (!this.cm.isReadOnly()) {
+              operation(this.cm, applyTextInput)(
+                this.cm,
+                String.fromCharCode(
+                  e.charCode == null ? e.keyCode : e.charCode
+                ),
+                0
+              );
+            }
+          };
+          ContentEditableInput.prototype.readOnlyChanged = function (val) {
+            this.div.contentEditable = String(val != "nocursor");
+          };
+          ContentEditableInput.prototype.onContextMenu = function () {};
+          ContentEditableInput.prototype.resetPosition = function () {};
+          ContentEditableInput.prototype.needsContentAttribute = true;
+          function posToDOM(cm, pos) {
+            var view = findViewForLine(cm, pos.line);
+            if (!view || view.hidden) {
+              return null;
+            }
+            var line = getLine2(cm.doc, pos.line);
+            var info2 = mapFromLineView(view, line, pos.line);
+            var order2 = getOrder(line, cm.doc.direction),
+              side = "left";
+            if (order2) {
+              var partPos = getBidiPartAt(order2, pos.ch);
+              side = partPos % 2 ? "right" : "left";
+            }
+            var result2 = nodeAndOffsetInLineMap(info2.map, pos.ch, side);
+            result2.offset =
+              result2.collapse == "right" ? result2.end : result2.start;
+            return result2;
+          }
+          function isInGutter(node) {
+            for (var scan = node; scan; scan = scan.parentNode) {
+              if (/CodeMirror-gutter-wrapper/.test(scan.className)) {
+                return true;
+              }
+            }
+            return false;
+          }
+          function badPos(pos, bad) {
+            if (bad) {
+              pos.bad = true;
+            }
+            return pos;
+          }
+          function domTextBetween(cm, from, to, fromLine, toLine) {
+            var text3 = "",
+              closing = false,
+              lineSep = cm.doc.lineSeparator(),
+              extraLinebreak = false;
+            function recognizeMarker(id2) {
+              return function (marker2) {
+                return marker2.id == id2;
+              };
+            }
+            function close() {
+              if (closing) {
+                text3 += lineSep;
+                if (extraLinebreak) {
+                  text3 += lineSep;
+                }
+                closing = extraLinebreak = false;
+              }
+            }
+            function addText(str) {
+              if (str) {
+                close();
+                text3 += str;
+              }
+            }
+            function walk(node) {
+              if (node.nodeType == 1) {
+                var cmText = node.getAttribute("cm-text");
+                if (cmText) {
+                  addText(cmText);
+                  return;
+                }
+                var markerID = node.getAttribute("cm-marker"),
+                  range3;
+                if (markerID) {
+                  var found = cm.findMarks(
+                    Pos(fromLine, 0),
+                    Pos(toLine + 1, 0),
+                    recognizeMarker(+markerID)
+                  );
+                  if (found.length && (range3 = found[0].find(0))) {
+                    addText(
+                      getBetween(cm.doc, range3.from, range3.to).join(lineSep)
+                    );
+                  }
+                  return;
+                }
+                if (node.getAttribute("contenteditable") == "false") {
+                  return;
+                }
+                var isBlock = /^(pre|div|p|li|table|br)$/i.test(node.nodeName);
+                if (
+                  !/^br$/i.test(node.nodeName) &&
+                  node.textContent.length == 0
+                ) {
+                  return;
+                }
+                if (isBlock) {
+                  close();
+                }
+                for (var i2 = 0; i2 < node.childNodes.length; i2++) {
+                  walk(node.childNodes[i2]);
+                }
+                if (/^(pre|p)$/i.test(node.nodeName)) {
+                  extraLinebreak = true;
+                }
+                if (isBlock) {
+                  closing = true;
+                }
+              } else if (node.nodeType == 3) {
+                addText(
+                  node.nodeValue.replace(/\u200b/g, "").replace(/\u00a0/g, " ")
+                );
+              }
+            }
+            for (;;) {
+              walk(from);
+              if (from == to) {
+                break;
+              }
+              from = from.nextSibling;
+              extraLinebreak = false;
+            }
+            return text3;
+          }
+          function domToPos(cm, node, offset) {
+            var lineNode;
+            if (node == cm.display.lineDiv) {
+              lineNode = cm.display.lineDiv.childNodes[offset];
+              if (!lineNode) {
+                return badPos(cm.clipPos(Pos(cm.display.viewTo - 1)), true);
+              }
+              node = null;
+              offset = 0;
+            } else {
+              for (lineNode = node; ; lineNode = lineNode.parentNode) {
+                if (!lineNode || lineNode == cm.display.lineDiv) {
+                  return null;
+                }
+                if (
+                  lineNode.parentNode &&
+                  lineNode.parentNode == cm.display.lineDiv
+                ) {
+                  break;
+                }
+              }
+            }
+            for (var i2 = 0; i2 < cm.display.view.length; i2++) {
+              var lineView = cm.display.view[i2];
+              if (lineView.node == lineNode) {
+                return locateNodeInLineView(lineView, node, offset);
+              }
+            }
+          }
+          function locateNodeInLineView(lineView, node, offset) {
+            var wrapper = lineView.text.firstChild,
+              bad = false;
+            if (!node || !contains(wrapper, node)) {
+              return badPos(Pos(lineNo(lineView.line), 0), true);
+            }
+            if (node == wrapper) {
+              bad = true;
+              node = wrapper.childNodes[offset];
+              offset = 0;
+              if (!node) {
+                var line = lineView.rest ? lst(lineView.rest) : lineView.line;
+                return badPos(Pos(lineNo(line), line.text.length), bad);
+              }
+            }
+            var textNode = node.nodeType == 3 ? node : null,
+              topNode = node;
+            if (
+              !textNode &&
+              node.childNodes.length == 1 &&
+              node.firstChild.nodeType == 3
+            ) {
+              textNode = node.firstChild;
+              if (offset) {
+                offset = textNode.nodeValue.length;
+              }
+            }
+            while (topNode.parentNode != wrapper) {
+              topNode = topNode.parentNode;
+            }
+            var measure = lineView.measure,
+              maps = measure.maps;
+            function find2(textNode2, topNode2, offset2) {
+              for (var i2 = -1; i2 < (maps ? maps.length : 0); i2++) {
+                var map3 = i2 < 0 ? measure.map : maps[i2];
+                for (var j = 0; j < map3.length; j += 3) {
+                  var curNode = map3[j + 2];
+                  if (curNode == textNode2 || curNode == topNode2) {
+                    var line2 = lineNo(
+                      i2 < 0 ? lineView.line : lineView.rest[i2]
+                    );
+                    var ch2 = map3[j] + offset2;
+                    if (offset2 < 0 || curNode != textNode2) {
+                      ch2 = map3[j + (offset2 ? 1 : 0)];
+                    }
+                    return Pos(line2, ch2);
+                  }
+                }
+              }
+            }
+            var found = find2(textNode, topNode, offset);
+            if (found) {
+              return badPos(found, bad);
+            }
+            for (
+              var after = topNode.nextSibling,
+                dist2 = textNode ? textNode.nodeValue.length - offset : 0;
+              after;
+              after = after.nextSibling
+            ) {
+              found = find2(after, after.firstChild, 0);
+              if (found) {
+                return badPos(Pos(found.line, found.ch - dist2), bad);
+              } else {
+                dist2 += after.textContent.length;
+              }
+            }
+            for (
+              var before = topNode.previousSibling, dist$1 = offset;
+              before;
+              before = before.previousSibling
+            ) {
+              found = find2(before, before.firstChild, -1);
+              if (found) {
+                return badPos(Pos(found.line, found.ch + dist$1), bad);
+              } else {
+                dist$1 += before.textContent.length;
+              }
+            }
+          }
+          var TextareaInput = function (cm) {
+            this.cm = cm;
+            this.prevInput = "";
+            this.pollingFast = false;
+            this.polling = new Delayed();
+            this.hasSelection = false;
+            this.composing = null;
+          };
+          TextareaInput.prototype.init = function (display) {
+            var this$1$1 = this;
+            var input = this,
+              cm = this.cm;
+            this.createField(display);
+            var te = this.textarea;
+            display.wrapper.insertBefore(
+              this.wrapper,
+              display.wrapper.firstChild
+            );
+            if (ios) {
+              te.style.width = "0px";
+            }
+            on(te, "input", function () {
+              if (ie2 && ie_version >= 9 && this$1$1.hasSelection) {
+                this$1$1.hasSelection = null;
+              }
+              input.poll();
+            });
+            on(te, "paste", function (e) {
+              if (signalDOMEvent(cm, e) || handlePaste(e, cm)) {
+                return;
+              }
+              cm.state.pasteIncoming = +new Date();
+              input.fastPoll();
+            });
+            function prepareCopyCut(e) {
+              if (signalDOMEvent(cm, e)) {
+                return;
+              }
+              if (cm.somethingSelected()) {
+                setLastCopied({ lineWise: false, text: cm.getSelections() });
+              } else if (!cm.options.lineWiseCopyCut) {
+                return;
+              } else {
+                var ranges = copyableRanges(cm);
+                setLastCopied({ lineWise: true, text: ranges.text });
+                if (e.type == "cut") {
+                  cm.setSelections(ranges.ranges, null, sel_dontScroll);
+                } else {
+                  input.prevInput = "";
+                  te.value = ranges.text.join("\n");
+                  selectInput(te);
+                }
+              }
+              if (e.type == "cut") {
+                cm.state.cutIncoming = +new Date();
+              }
+            }
+            on(te, "cut", prepareCopyCut);
+            on(te, "copy", prepareCopyCut);
+            on(display.scroller, "paste", function (e) {
+              if (eventInWidget(display, e) || signalDOMEvent(cm, e)) {
+                return;
+              }
+              if (!te.dispatchEvent) {
+                cm.state.pasteIncoming = +new Date();
+                input.focus();
+                return;
+              }
+              var event = new Event("paste");
+              event.clipboardData = e.clipboardData;
+              te.dispatchEvent(event);
+            });
+            on(display.lineSpace, "selectstart", function (e) {
+              if (!eventInWidget(display, e)) {
+                e_preventDefault(e);
+              }
+            });
+            on(te, "compositionstart", function () {
+              var start2 = cm.getCursor("from");
+              if (input.composing) {
+                input.composing.range.clear();
+              }
+              input.composing = {
+                start: start2,
+                range: cm.markText(start2, cm.getCursor("to"), {
+                  className: "CodeMirror-composing",
+                }),
+              };
+            });
+            on(te, "compositionend", function () {
+              if (input.composing) {
+                input.poll();
+                input.composing.range.clear();
+                input.composing = null;
+              }
+            });
+          };
+          TextareaInput.prototype.createField = function (_display) {
+            this.wrapper = hiddenTextarea();
+            this.textarea = this.wrapper.firstChild;
+          };
+          TextareaInput.prototype.screenReaderLabelChanged = function (label) {
+            if (label) {
+              this.textarea.setAttribute("aria-label", label);
+            } else {
+              this.textarea.removeAttribute("aria-label");
+            }
+          };
+          TextareaInput.prototype.prepareSelection = function () {
+            var cm = this.cm,
+              display = cm.display,
+              doc = cm.doc;
+            var result2 = prepareSelection(cm);
+            if (cm.options.moveInputWithCursor) {
+              var headPos = cursorCoords(cm, doc.sel.primary().head, "div");
+              var wrapOff = display.wrapper.getBoundingClientRect(),
+                lineOff = display.lineDiv.getBoundingClientRect();
+              result2.teTop = Math.max(
+                0,
+                Math.min(
+                  display.wrapper.clientHeight - 10,
+                  headPos.top + lineOff.top - wrapOff.top
+                )
+              );
+              result2.teLeft = Math.max(
+                0,
+                Math.min(
+                  display.wrapper.clientWidth - 10,
+                  headPos.left + lineOff.left - wrapOff.left
+                )
+              );
+            }
+            return result2;
+          };
+          TextareaInput.prototype.showSelection = function (drawn) {
+            var cm = this.cm,
+              display = cm.display;
+            removeChildrenAndAdd(display.cursorDiv, drawn.cursors);
+            removeChildrenAndAdd(display.selectionDiv, drawn.selection);
+            if (drawn.teTop != null) {
+              this.wrapper.style.top = drawn.teTop + "px";
+              this.wrapper.style.left = drawn.teLeft + "px";
+            }
+          };
+          TextareaInput.prototype.reset = function (typing) {
+            if (this.contextMenuPending || this.composing) {
+              return;
+            }
+            var cm = this.cm;
+            if (cm.somethingSelected()) {
+              this.prevInput = "";
+              var content = cm.getSelection();
+              this.textarea.value = content;
+              if (cm.state.focused) {
+                selectInput(this.textarea);
+              }
+              if (ie2 && ie_version >= 9) {
+                this.hasSelection = content;
+              }
+            } else if (!typing) {
+              this.prevInput = this.textarea.value = "";
+              if (ie2 && ie_version >= 9) {
+                this.hasSelection = null;
+              }
+            }
+          };
+          TextareaInput.prototype.getField = function () {
+            return this.textarea;
+          };
+          TextareaInput.prototype.supportsTouch = function () {
+            return false;
+          };
+          TextareaInput.prototype.focus = function () {
+            if (
+              this.cm.options.readOnly != "nocursor" &&
+              (!mobile || activeElt() != this.textarea)
+            ) {
+              try {
+                this.textarea.focus();
+              } catch (e) {}
+            }
+          };
+          TextareaInput.prototype.blur = function () {
+            this.textarea.blur();
+          };
+          TextareaInput.prototype.resetPosition = function () {
+            this.wrapper.style.top = this.wrapper.style.left = 0;
+          };
+          TextareaInput.prototype.receivedFocus = function () {
+            this.slowPoll();
+          };
+          TextareaInput.prototype.slowPoll = function () {
+            var this$1$1 = this;
+            if (this.pollingFast) {
+              return;
+            }
+            this.polling.set(this.cm.options.pollInterval, function () {
+              this$1$1.poll();
+              if (this$1$1.cm.state.focused) {
+                this$1$1.slowPoll();
+              }
+            });
+          };
+          TextareaInput.prototype.fastPoll = function () {
+            var missed = false,
+              input = this;
+            input.pollingFast = true;
+            function p2() {
+              var changed = input.poll();
+              if (!changed && !missed) {
+                missed = true;
+                input.polling.set(60, p2);
+              } else {
+                input.pollingFast = false;
+                input.slowPoll();
+              }
+            }
+            input.polling.set(20, p2);
+          };
+          TextareaInput.prototype.poll = function () {
+            var this$1$1 = this;
+            var cm = this.cm,
+              input = this.textarea,
+              prevInput = this.prevInput;
+            if (
+              this.contextMenuPending ||
+              !cm.state.focused ||
+              (hasSelection(input) && !prevInput && !this.composing) ||
+              cm.isReadOnly() ||
+              cm.options.disableInput ||
+              cm.state.keySeq
+            ) {
+              return false;
+            }
+            var text3 = input.value;
+            if (text3 == prevInput && !cm.somethingSelected()) {
+              return false;
+            }
+            if (
+              (ie2 && ie_version >= 9 && this.hasSelection === text3) ||
+              (mac && /[\uf700-\uf7ff]/.test(text3))
+            ) {
+              cm.display.input.reset();
+              return false;
+            }
+            if (cm.doc.sel == cm.display.selForContextMenu) {
+              var first = text3.charCodeAt(0);
+              if (first == 8203 && !prevInput) {
+                prevInput = "\u200B";
+              }
+              if (first == 8666) {
+                this.reset();
+                return this.cm.execCommand("undo");
+              }
+            }
+            var same = 0,
+              l2 = Math.min(prevInput.length, text3.length);
+            while (
+              same < l2 &&
+              prevInput.charCodeAt(same) == text3.charCodeAt(same)
+            ) {
+              ++same;
+            }
+            runInOp(cm, function () {
+              applyTextInput(
+                cm,
+                text3.slice(same),
+                prevInput.length - same,
+                null,
+                this$1$1.composing ? "*compose" : null
+              );
+              if (text3.length > 1e3 || text3.indexOf("\n") > -1) {
+                input.value = this$1$1.prevInput = "";
+              } else {
+                this$1$1.prevInput = text3;
+              }
+              if (this$1$1.composing) {
+                this$1$1.composing.range.clear();
+                this$1$1.composing.range = cm.markText(
+                  this$1$1.composing.start,
+                  cm.getCursor("to"),
+                  { className: "CodeMirror-composing" }
+                );
+              }
+            });
+            return true;
+          };
+          TextareaInput.prototype.ensurePolled = function () {
+            if (this.pollingFast && this.poll()) {
+              this.pollingFast = false;
+            }
+          };
+          TextareaInput.prototype.onKeyPress = function () {
+            if (ie2 && ie_version >= 9) {
+              this.hasSelection = null;
+            }
+            this.fastPoll();
+          };
+          TextareaInput.prototype.onContextMenu = function (e) {
+            var input = this,
+              cm = input.cm,
+              display = cm.display,
+              te = input.textarea;
+            if (input.contextMenuPending) {
+              input.contextMenuPending();
+            }
+            var pos = posFromMouse(cm, e),
+              scrollPos = display.scroller.scrollTop;
+            if (!pos || presto) {
+              return;
+            }
+            var reset = cm.options.resetSelectionOnContextMenu;
+            if (reset && cm.doc.sel.contains(pos) == -1) {
+              operation(cm, setSelection)(
+                cm.doc,
+                simpleSelection(pos),
+                sel_dontScroll
+              );
+            }
+            var oldCSS = te.style.cssText,
+              oldWrapperCSS = input.wrapper.style.cssText;
+            var wrapperBox = input.wrapper.offsetParent.getBoundingClientRect();
+            input.wrapper.style.cssText = "position: static";
+            te.style.cssText =
+              "position: absolute; width: 30px; height: 30px;\n      top: " +
+              (e.clientY - wrapperBox.top - 5) +
+              "px; left: " +
+              (e.clientX - wrapperBox.left - 5) +
+              "px;\n      z-index: 1000; background: " +
+              (ie2 ? "rgba(255, 255, 255, .05)" : "transparent") +
+              ";\n      outline: none; border-width: 0; outline: none; overflow: hidden; opacity: .05; filter: alpha(opacity=5);";
+            var oldScrollY;
+            if (webkit) {
+              oldScrollY = window.scrollY;
+            }
+            display.input.focus();
+            if (webkit) {
+              window.scrollTo(null, oldScrollY);
+            }
+            display.input.reset();
+            if (!cm.somethingSelected()) {
+              te.value = input.prevInput = " ";
+            }
+            input.contextMenuPending = rehide;
+            display.selForContextMenu = cm.doc.sel;
+            clearTimeout(display.detectingSelectAll);
+            function prepareSelectAllHack() {
+              if (te.selectionStart != null) {
+                var selected = cm.somethingSelected();
+                var extval = "\u200B" + (selected ? te.value : "");
+                te.value = "\u21DA";
+                te.value = extval;
+                input.prevInput = selected ? "" : "\u200B";
+                te.selectionStart = 1;
+                te.selectionEnd = extval.length;
+                display.selForContextMenu = cm.doc.sel;
+              }
+            }
+            function rehide() {
+              if (input.contextMenuPending != rehide) {
+                return;
+              }
+              input.contextMenuPending = false;
+              input.wrapper.style.cssText = oldWrapperCSS;
+              te.style.cssText = oldCSS;
+              if (ie2 && ie_version < 9) {
+                display.scrollbars.setScrollTop(
+                  (display.scroller.scrollTop = scrollPos)
+                );
+              }
+              if (te.selectionStart != null) {
+                if (!ie2 || (ie2 && ie_version < 9)) {
+                  prepareSelectAllHack();
+                }
+                var i2 = 0,
+                  poll = function () {
+                    if (
+                      display.selForContextMenu == cm.doc.sel &&
+                      te.selectionStart == 0 &&
+                      te.selectionEnd > 0 &&
+                      input.prevInput == "\u200B"
+                    ) {
+                      operation(cm, selectAll)(cm);
+                    } else if (i2++ < 10) {
+                      display.detectingSelectAll = setTimeout(poll, 500);
+                    } else {
+                      display.selForContextMenu = null;
+                      display.input.reset();
+                    }
+                  };
+                display.detectingSelectAll = setTimeout(poll, 200);
+              }
+            }
+            if (ie2 && ie_version >= 9) {
+              prepareSelectAllHack();
+            }
+            if (captureRightClick) {
+              e_stop(e);
+              var mouseup = function () {
+                off(window, "mouseup", mouseup);
+                setTimeout(rehide, 20);
+              };
+              on(window, "mouseup", mouseup);
+            } else {
+              setTimeout(rehide, 50);
+            }
+          };
+          TextareaInput.prototype.readOnlyChanged = function (val) {
+            if (!val) {
+              this.reset();
+            }
+            this.textarea.disabled = val == "nocursor";
+            this.textarea.readOnly = !!val;
+          };
+          TextareaInput.prototype.setUneditable = function () {};
+          TextareaInput.prototype.needsContentAttribute = false;
+          function fromTextArea(textarea, options) {
+            options = options ? copyObj(options) : {};
+            options.value = textarea.value;
+            if (!options.tabindex && textarea.tabIndex) {
+              options.tabindex = textarea.tabIndex;
+            }
+            if (!options.placeholder && textarea.placeholder) {
+              options.placeholder = textarea.placeholder;
+            }
+            if (options.autofocus == null) {
+              var hasFocus = activeElt();
+              options.autofocus =
+                hasFocus == textarea ||
+                (textarea.getAttribute("autofocus") != null &&
+                  hasFocus == document.body);
+            }
+            function save() {
+              textarea.value = cm.getValue();
+            }
+            var realSubmit;
+            if (textarea.form) {
+              on(textarea.form, "submit", save);
+              if (!options.leaveSubmitMethodAlone) {
+                var form = textarea.form;
+                realSubmit = form.submit;
+                try {
+                  var wrappedSubmit = (form.submit = function () {
+                    save();
+                    form.submit = realSubmit;
+                    form.submit();
+                    form.submit = wrappedSubmit;
+                  });
+                } catch (e) {}
+              }
+            }
+            options.finishInit = function (cm2) {
+              cm2.save = save;
+              cm2.getTextArea = function () {
+                return textarea;
+              };
+              cm2.toTextArea = function () {
+                cm2.toTextArea = isNaN;
+                save();
+                textarea.parentNode.removeChild(cm2.getWrapperElement());
+                textarea.style.display = "";
+                if (textarea.form) {
+                  off(textarea.form, "submit", save);
+                  if (
+                    !options.leaveSubmitMethodAlone &&
+                    typeof textarea.form.submit == "function"
+                  ) {
+                    textarea.form.submit = realSubmit;
+                  }
+                }
+              };
+            };
+            textarea.style.display = "none";
+            var cm = CodeMirror(function (node) {
+              return textarea.parentNode.insertBefore(
+                node,
+                textarea.nextSibling
+              );
+            }, options);
+            return cm;
+          }
+          function addLegacyProps(CodeMirror2) {
+            CodeMirror2.off = off;
+            CodeMirror2.on = on;
+            CodeMirror2.wheelEventPixels = wheelEventPixels;
+            CodeMirror2.Doc = Doc;
+            CodeMirror2.splitLines = splitLinesAuto;
+            CodeMirror2.countColumn = countColumn;
+            CodeMirror2.findColumn = findColumn;
+            CodeMirror2.isWordChar = isWordCharBasic;
+            CodeMirror2.Pass = Pass;
+            CodeMirror2.signal = signal;
+            CodeMirror2.Line = Line;
+            CodeMirror2.changeEnd = changeEnd;
+            CodeMirror2.scrollbarModel = scrollbarModel;
+            CodeMirror2.Pos = Pos;
+            CodeMirror2.cmpPos = cmp;
+            CodeMirror2.modes = modes;
+            CodeMirror2.mimeModes = mimeModes;
+            CodeMirror2.resolveMode = resolveMode;
+            CodeMirror2.getMode = getMode;
+            CodeMirror2.modeExtensions = modeExtensions;
+            CodeMirror2.extendMode = extendMode;
+            CodeMirror2.copyState = copyState;
+            CodeMirror2.startState = startState;
+            CodeMirror2.innerMode = innerMode;
+            CodeMirror2.commands = commands;
+            CodeMirror2.keyMap = keyMap2;
+            CodeMirror2.keyName = keyName;
+            CodeMirror2.isModifierKey = isModifierKey;
+            CodeMirror2.lookupKey = lookupKey;
+            CodeMirror2.normalizeKeyMap = normalizeKeyMap;
+            CodeMirror2.StringStream = StringStream;
+            CodeMirror2.SharedTextMarker = SharedTextMarker;
+            CodeMirror2.TextMarker = TextMarker;
+            CodeMirror2.LineWidget = LineWidget;
+            CodeMirror2.e_preventDefault = e_preventDefault;
+            CodeMirror2.e_stopPropagation = e_stopPropagation;
+            CodeMirror2.e_stop = e_stop;
+            CodeMirror2.addClass = addClass;
+            CodeMirror2.contains = contains;
+            CodeMirror2.rmClass = rmClass;
+            CodeMirror2.keyNames = keyNames;
+          }
+          defineOptions(CodeMirror);
+          addEditorMethods(CodeMirror);
+          var dontDelegate =
+            "iter insert remove copy getEditor constructor".split(" ");
+          for (var prop2 in Doc.prototype) {
+            if (
+              Doc.prototype.hasOwnProperty(prop2) &&
+              indexOf(dontDelegate, prop2) < 0
+            ) {
+              CodeMirror.prototype[prop2] = (function (method) {
+                return function () {
+                  return method.apply(this.doc, arguments);
+                };
+              })(Doc.prototype[prop2]);
+            }
+          }
+          eventMixin(Doc);
+          CodeMirror.inputStyles = {
+            textarea: TextareaInput,
+            contenteditable: ContentEditableInput,
+          };
+          CodeMirror.defineMode = function (name2) {
+            if (!CodeMirror.defaults.mode && name2 != "null") {
+              CodeMirror.defaults.mode = name2;
+            }
+            defineMode.apply(this, arguments);
+          };
+          CodeMirror.defineMIME = defineMIME;
+          CodeMirror.defineMode("null", function () {
+            return {
+              token: function (stream) {
+                return stream.skipToEnd();
+              },
+            };
+          });
+          CodeMirror.defineMIME("text/plain", "null");
+          CodeMirror.defineExtension = function (name2, func) {
+            CodeMirror.prototype[name2] = func;
+          };
+          CodeMirror.defineDocExtension = function (name2, func) {
+            Doc.prototype[name2] = func;
+          };
+          CodeMirror.fromTextArea = fromTextArea;
+          addLegacyProps(CodeMirror);
+          CodeMirror.version = "5.65.1";
+          return CodeMirror;
+        });
+      })(codemirror$2);
+      var codemirror = codemirror$2.exports;
+      var codemirror$1 = /* @__PURE__ */ Object.freeze(
+        /* @__PURE__ */ _mergeNamespaces(
+          {
+            __proto__: null,
+            [Symbol.toStringTag]: "Module",
+            default: codemirror,
+          },
+          [codemirror$2.exports]
+        )
+      );
+      var showHint$2 = { exports: {} };
+      (function (module2, exports) {
+        (function (mod) {
+          mod(codemirror$2.exports);
+        })(function (CodeMirror) {
+          var HINT_ELEMENT_CLASS = "CodeMirror-hint";
+          var ACTIVE_HINT_ELEMENT_CLASS = "CodeMirror-hint-active";
+          CodeMirror.showHint = function (cm, getHints, options) {
+            if (!getHints) return cm.showHint(options);
+            if (options && options.async) getHints.async = true;
+            var newOpts = { hint: getHints };
+            if (options)
+              for (var prop2 in options) newOpts[prop2] = options[prop2];
+            return cm.showHint(newOpts);
+          };
+          CodeMirror.defineExtension("showHint", function (options) {
+            options = parseOptions(this, this.getCursor("start"), options);
+            var selections = this.listSelections();
+            if (selections.length > 1) return;
+            if (this.somethingSelected()) {
+              if (!options.hint.supportsSelection) return;
+              for (var i = 0; i < selections.length; i++)
+                if (selections[i].head.line != selections[i].anchor.line)
+                  return;
+            }
+            if (this.state.completionActive)
+              this.state.completionActive.close();
+            var completion = (this.state.completionActive = new Completion(
+              this,
+              options
+            ));
+            if (!completion.options.hint) return;
+            CodeMirror.signal(this, "startCompletion", this);
+            completion.update(true);
+          });
+          CodeMirror.defineExtension("closeHint", function () {
+            if (this.state.completionActive)
+              this.state.completionActive.close();
+          });
+          function Completion(cm, options) {
+            this.cm = cm;
+            this.options = options;
+            this.widget = null;
+            this.debounce = 0;
+            this.tick = 0;
+            this.startPos = this.cm.getCursor("start");
+            this.startLen =
+              this.cm.getLine(this.startPos.line).length -
+              this.cm.getSelection().length;
+            if (this.options.updateOnCursorActivity) {
+              var self2 = this;
+              cm.on(
+                "cursorActivity",
+                (this.activityFunc = function () {
+                  self2.cursorActivity();
+                })
+              );
+            }
+          }
+          var requestAnimationFrame =
+            window.requestAnimationFrame ||
+            function (fn) {
+              return setTimeout(fn, 1e3 / 60);
+            };
+          var cancelAnimationFrame =
+            window.cancelAnimationFrame || clearTimeout;
+          Completion.prototype = {
+            close: function () {
+              if (!this.active()) return;
+              this.cm.state.completionActive = null;
+              this.tick = null;
+              if (this.options.updateOnCursorActivity) {
+                this.cm.off("cursorActivity", this.activityFunc);
+              }
+              if (this.widget && this.data)
+                CodeMirror.signal(this.data, "close");
+              if (this.widget) this.widget.close();
+              CodeMirror.signal(this.cm, "endCompletion", this.cm);
+            },
+            active: function () {
+              return this.cm.state.completionActive == this;
+            },
+            pick: function (data, i) {
+              var completion = data.list[i],
+                self2 = this;
+              this.cm.operation(function () {
+                if (completion.hint)
+                  completion.hint(self2.cm, data, completion);
+                else
+                  self2.cm.replaceRange(
+                    getText(completion),
+                    completion.from || data.from,
+                    completion.to || data.to,
+                    "complete"
+                  );
+                CodeMirror.signal(data, "pick", completion);
+                self2.cm.scrollIntoView();
+              });
+              if (this.options.closeOnPick) {
+                this.close();
+              }
+            },
+            cursorActivity: function () {
+              if (this.debounce) {
+                cancelAnimationFrame(this.debounce);
+                this.debounce = 0;
+              }
+              var identStart = this.startPos;
+              if (this.data) {
+                identStart = this.data.from;
+              }
+              var pos = this.cm.getCursor(),
+                line = this.cm.getLine(pos.line);
+              if (
+                pos.line != this.startPos.line ||
+                line.length - pos.ch != this.startLen - this.startPos.ch ||
+                pos.ch < identStart.ch ||
+                this.cm.somethingSelected() ||
+                !pos.ch ||
+                this.options.closeCharacters.test(line.charAt(pos.ch - 1))
+              ) {
+                this.close();
+              } else {
+                var self2 = this;
+                this.debounce = requestAnimationFrame(function () {
+                  self2.update();
+                });
+                if (this.widget) this.widget.disable();
+              }
+            },
+            update: function (first) {
+              if (this.tick == null) return;
+              var self2 = this,
+                myTick = ++this.tick;
+              fetchHints(
+                this.options.hint,
+                this.cm,
+                this.options,
+                function (data) {
+                  if (self2.tick == myTick) self2.finishUpdate(data, first);
+                }
+              );
+            },
+            finishUpdate: function (data, first) {
+              if (this.data) CodeMirror.signal(this.data, "update");
+              var picked =
+                (this.widget && this.widget.picked) ||
+                (first && this.options.completeSingle);
+              if (this.widget) this.widget.close();
+              this.data = data;
+              if (data && data.list.length) {
+                if (picked && data.list.length == 1) {
+                  this.pick(data, 0);
+                } else {
+                  this.widget = new Widget(this, data);
+                  CodeMirror.signal(data, "shown");
+                }
+              }
+            },
+          };
+          function parseOptions(cm, pos, options) {
+            var editor = cm.options.hintOptions;
+            var out = {};
+            for (var prop2 in defaultOptions2)
+              out[prop2] = defaultOptions2[prop2];
+            if (editor) {
+              for (var prop2 in editor)
+                if (editor[prop2] !== void 0) out[prop2] = editor[prop2];
+            }
+            if (options) {
+              for (var prop2 in options)
+                if (options[prop2] !== void 0) out[prop2] = options[prop2];
+            }
+            if (out.hint.resolve) out.hint = out.hint.resolve(cm, pos);
+            return out;
+          }
+          function getText(completion) {
+            if (typeof completion == "string") return completion;
+            else return completion.text;
+          }
+          function buildKeyMap(completion, handle) {
+            var baseMap = {
+              Up: function () {
+                handle.moveFocus(-1);
+              },
+              Down: function () {
+                handle.moveFocus(1);
+              },
+              PageUp: function () {
+                handle.moveFocus(-handle.menuSize() + 1, true);
+              },
+              PageDown: function () {
+                handle.moveFocus(handle.menuSize() - 1, true);
+              },
+              Home: function () {
+                handle.setFocus(0);
+              },
+              End: function () {
+                handle.setFocus(handle.length - 1);
+              },
+              Enter: handle.pick,
+              Tab: handle.pick,
+              Esc: handle.close,
+            };
+            var mac = /Mac/.test(navigator.platform);
+            if (mac) {
+              baseMap["Ctrl-P"] = function () {
+                handle.moveFocus(-1);
+              };
+              baseMap["Ctrl-N"] = function () {
+                handle.moveFocus(1);
+              };
+            }
+            var custom = completion.options.customKeys;
+            var ourMap = custom ? {} : baseMap;
+            function addBinding(key2, val) {
+              var bound;
+              if (typeof val != "string")
+                bound = function (cm) {
+                  return val(cm, handle);
+                };
+              else if (baseMap.hasOwnProperty(val)) bound = baseMap[val];
+              else bound = val;
+              ourMap[key2] = bound;
+            }
+            if (custom) {
+              for (var key in custom)
+                if (custom.hasOwnProperty(key)) addBinding(key, custom[key]);
+            }
+            var extra = completion.options.extraKeys;
+            if (extra) {
+              for (var key in extra)
+                if (extra.hasOwnProperty(key)) addBinding(key, extra[key]);
+            }
+            return ourMap;
+          }
+          function getHintElement(hintsElement, el2) {
+            while (el2 && el2 != hintsElement) {
+              if (
+                el2.nodeName.toUpperCase() === "LI" &&
+                el2.parentNode == hintsElement
+              )
+                return el2;
+              el2 = el2.parentNode;
+            }
+          }
+          function Widget(completion, data) {
+            this.id = "cm-complete-" + Math.floor(Math.random(1e6));
+            this.completion = completion;
+            this.data = data;
+            this.picked = false;
+            var widget = this,
+              cm = completion.cm;
+            var ownerDocument = cm.getInputField().ownerDocument;
+            var parentWindow =
+              ownerDocument.defaultView || ownerDocument.parentWindow;
+            var hints = (this.hints = ownerDocument.createElement("ul"));
+            hints.setAttribute("role", "listbox");
+            hints.setAttribute("aria-expanded", "true");
+            hints.id = this.id;
+            var theme = completion.cm.options.theme;
+            hints.className = "CodeMirror-hints " + theme;
+            this.selectedHint = data.selectedHint || 0;
+            var completions = data.list;
+            for (var i = 0; i < completions.length; ++i) {
+              var elt = hints.appendChild(ownerDocument.createElement("li")),
+                cur = completions[i];
+              var className =
+                HINT_ELEMENT_CLASS +
+                (i != this.selectedHint ? "" : " " + ACTIVE_HINT_ELEMENT_CLASS);
+              if (cur.className != null)
+                className = cur.className + " " + className;
+              elt.className = className;
+              if (i == this.selectedHint)
+                elt.setAttribute("aria-selected", "true");
+              elt.id = this.id + "-" + i;
+              elt.setAttribute("role", "option");
+              if (cur.render) cur.render(elt, data, cur);
+              else
+                elt.appendChild(
+                  ownerDocument.createTextNode(cur.displayText || getText(cur))
+                );
+              elt.hintId = i;
+            }
+            var container = completion.options.container || ownerDocument.body;
+            var pos = cm.cursorCoords(
+              completion.options.alignWithWord ? data.from : null
+            );
+            var left = pos.left,
+              top2 = pos.bottom,
+              below = true;
+            var offsetLeft = 0,
+              offsetTop = 0;
+            if (container !== ownerDocument.body) {
+              var isContainerPositioned =
+                ["absolute", "relative", "fixed"].indexOf(
+                  parentWindow.getComputedStyle(container).position
+                ) !== -1;
+              var offsetParent = isContainerPositioned
+                ? container
+                : container.offsetParent;
+              var offsetParentPosition = offsetParent.getBoundingClientRect();
+              var bodyPosition = ownerDocument.body.getBoundingClientRect();
+              offsetLeft =
+                offsetParentPosition.left -
+                bodyPosition.left -
+                offsetParent.scrollLeft;
+              offsetTop =
+                offsetParentPosition.top -
+                bodyPosition.top -
+                offsetParent.scrollTop;
+            }
+            hints.style.left = left - offsetLeft + "px";
+            hints.style.top = top2 - offsetTop + "px";
+            var winW =
+              parentWindow.innerWidth ||
+              Math.max(
+                ownerDocument.body.offsetWidth,
+                ownerDocument.documentElement.offsetWidth
+              );
+            var winH =
+              parentWindow.innerHeight ||
+              Math.max(
+                ownerDocument.body.offsetHeight,
+                ownerDocument.documentElement.offsetHeight
+              );
+            container.appendChild(hints);
+            cm.getInputField().setAttribute("aria-autocomplete", "list");
+            cm.getInputField().setAttribute("aria-owns", this.id);
+            cm.getInputField().setAttribute(
+              "aria-activedescendant",
+              this.id + "-" + this.selectedHint
+            );
+            var box = completion.options.moveOnOverlap
+              ? hints.getBoundingClientRect()
+              : new DOMRect();
+            var scrolls = completion.options.paddingForScrollbar
+              ? hints.scrollHeight > hints.clientHeight + 1
+              : false;
+            var startScroll;
+            setTimeout(function () {
+              startScroll = cm.getScrollInfo();
+            });
+            var overlapY = box.bottom - winH;
+            if (overlapY > 0) {
+              var height = box.bottom - box.top,
+                curTop = pos.top - (pos.bottom - box.top);
+              if (curTop - height > 0) {
+                hints.style.top = (top2 = pos.top - height - offsetTop) + "px";
+                below = false;
+              } else if (height > winH) {
+                hints.style.height = winH - 5 + "px";
+                hints.style.top =
+                  (top2 = pos.bottom - box.top - offsetTop) + "px";
+                var cursor = cm.getCursor();
+                if (data.from.ch != cursor.ch) {
+                  pos = cm.cursorCoords(cursor);
+                  hints.style.left = (left = pos.left - offsetLeft) + "px";
+                  box = hints.getBoundingClientRect();
+                }
+              }
+            }
+            var overlapX = box.right - winW;
+            if (scrolls) overlapX += cm.display.nativeBarWidth;
+            if (overlapX > 0) {
+              if (box.right - box.left > winW) {
+                hints.style.width = winW - 5 + "px";
+                overlapX -= box.right - box.left - winW;
+              }
+              hints.style.left =
+                (left = pos.left - overlapX - offsetLeft) + "px";
+            }
+            if (scrolls)
+              for (var node = hints.firstChild; node; node = node.nextSibling)
+                node.style.paddingRight = cm.display.nativeBarWidth + "px";
+            cm.addKeyMap(
+              (this.keyMap = buildKeyMap(completion, {
+                moveFocus: function (n2, avoidWrap) {
+                  widget.changeActive(widget.selectedHint + n2, avoidWrap);
+                },
+                setFocus: function (n2) {
+                  widget.changeActive(n2);
+                },
+                menuSize: function () {
+                  return widget.screenAmount();
+                },
+                length: completions.length,
+                close: function () {
+                  completion.close();
+                },
+                pick: function () {
+                  widget.pick();
+                },
+                data,
+              }))
+            );
+            if (completion.options.closeOnUnfocus) {
+              var closingOnBlur;
+              cm.on(
+                "blur",
+                (this.onBlur = function () {
+                  closingOnBlur = setTimeout(function () {
+                    completion.close();
+                  }, 100);
+                })
+              );
+              cm.on(
+                "focus",
+                (this.onFocus = function () {
+                  clearTimeout(closingOnBlur);
+                })
+              );
+            }
+            cm.on(
+              "scroll",
+              (this.onScroll = function () {
+                var curScroll = cm.getScrollInfo(),
+                  editor = cm.getWrapperElement().getBoundingClientRect();
+                if (!startScroll) startScroll = cm.getScrollInfo();
+                var newTop = top2 + startScroll.top - curScroll.top;
+                var point =
+                  newTop -
+                  (parentWindow.pageYOffset ||
+                    (ownerDocument.documentElement || ownerDocument.body)
+                      .scrollTop);
+                if (!below) point += hints.offsetHeight;
+                if (point <= editor.top || point >= editor.bottom)
+                  return completion.close();
+                hints.style.top = newTop + "px";
+                hints.style.left =
+                  left + startScroll.left - curScroll.left + "px";
+              })
+            );
+            CodeMirror.on(hints, "dblclick", function (e) {
+              var t2 = getHintElement(hints, e.target || e.srcElement);
+              if (t2 && t2.hintId != null) {
+                widget.changeActive(t2.hintId);
+                widget.pick();
+              }
+            });
+            CodeMirror.on(hints, "click", function (e) {
+              var t2 = getHintElement(hints, e.target || e.srcElement);
+              if (t2 && t2.hintId != null) {
+                widget.changeActive(t2.hintId);
+                if (completion.options.completeOnSingleClick) widget.pick();
+              }
+            });
+            CodeMirror.on(hints, "mousedown", function () {
+              setTimeout(function () {
+                cm.focus();
+              }, 20);
+            });
+            var selectedHintRange = this.getSelectedHintRange();
+            if (selectedHintRange.from !== 0 || selectedHintRange.to !== 0) {
+              this.scrollToActive();
+            }
+            CodeMirror.signal(
+              data,
+              "select",
+              completions[this.selectedHint],
+              hints.childNodes[this.selectedHint]
+            );
+            return true;
+          }
+          Widget.prototype = {
+            close: function () {
+              if (this.completion.widget != this) return;
+              this.completion.widget = null;
+              if (this.hints.parentNode)
+                this.hints.parentNode.removeChild(this.hints);
+              this.completion.cm.removeKeyMap(this.keyMap);
+              var input = this.completion.cm.getInputField();
+              input.removeAttribute("aria-activedescendant");
+              input.removeAttribute("aria-owns");
+              var cm = this.completion.cm;
+              if (this.completion.options.closeOnUnfocus) {
+                cm.off("blur", this.onBlur);
+                cm.off("focus", this.onFocus);
+              }
+              cm.off("scroll", this.onScroll);
+            },
+            disable: function () {
+              this.completion.cm.removeKeyMap(this.keyMap);
+              var widget = this;
+              this.keyMap = {
+                Enter: function () {
+                  widget.picked = true;
+                },
+              };
+              this.completion.cm.addKeyMap(this.keyMap);
+            },
+            pick: function () {
+              this.completion.pick(this.data, this.selectedHint);
+            },
+            changeActive: function (i, avoidWrap) {
+              if (i >= this.data.list.length)
+                i = avoidWrap ? this.data.list.length - 1 : 0;
+              else if (i < 0) i = avoidWrap ? 0 : this.data.list.length - 1;
+              if (this.selectedHint == i) return;
+              var node = this.hints.childNodes[this.selectedHint];
+              if (node) {
+                node.className = node.className.replace(
+                  " " + ACTIVE_HINT_ELEMENT_CLASS,
+                  ""
+                );
+                node.removeAttribute("aria-selected");
+              }
+              node = this.hints.childNodes[(this.selectedHint = i)];
+              node.className += " " + ACTIVE_HINT_ELEMENT_CLASS;
+              node.setAttribute("aria-selected", "true");
+              this.completion.cm
+                .getInputField()
+                .setAttribute("aria-activedescendant", node.id);
+              this.scrollToActive();
+              CodeMirror.signal(
+                this.data,
+                "select",
+                this.data.list[this.selectedHint],
+                node
+              );
+            },
+            scrollToActive: function () {
+              var selectedHintRange = this.getSelectedHintRange();
+              var node1 = this.hints.childNodes[selectedHintRange.from];
+              var node2 = this.hints.childNodes[selectedHintRange.to];
+              var firstNode = this.hints.firstChild;
+              if (node1.offsetTop < this.hints.scrollTop)
+                this.hints.scrollTop = node1.offsetTop - firstNode.offsetTop;
+              else if (
+                node2.offsetTop + node2.offsetHeight >
+                this.hints.scrollTop + this.hints.clientHeight
+              )
+                this.hints.scrollTop =
+                  node2.offsetTop +
+                  node2.offsetHeight -
+                  this.hints.clientHeight +
+                  firstNode.offsetTop;
+            },
+            screenAmount: function () {
+              return (
+                Math.floor(
+                  this.hints.clientHeight / this.hints.firstChild.offsetHeight
+                ) || 1
+              );
+            },
+            getSelectedHintRange: function () {
+              var margin = this.completion.options.scrollMargin || 0;
+              return {
+                from: Math.max(0, this.selectedHint - margin),
+                to: Math.min(
+                  this.data.list.length - 1,
+                  this.selectedHint + margin
+                ),
+              };
+            },
+          };
+          function applicableHelpers(cm, helpers2) {
+            if (!cm.somethingSelected()) return helpers2;
+            var result2 = [];
+            for (var i = 0; i < helpers2.length; i++)
+              if (helpers2[i].supportsSelection) result2.push(helpers2[i]);
+            return result2;
+          }
+          function fetchHints(hint2, cm, options, callback) {
+            if (hint2.async) {
+              hint2(cm, callback, options);
+            } else {
+              var result2 = hint2(cm, options);
+              if (result2 && result2.then) result2.then(callback);
+              else callback(result2);
+            }
+          }
+          function resolveAutoHints(cm, pos) {
+            var helpers2 = cm.getHelpers(pos, "hint"),
+              words;
+            if (helpers2.length) {
+              var resolved = function (cm2, callback, options) {
+                var app = applicableHelpers(cm2, helpers2);
+                function run(i) {
+                  if (i == app.length) return callback(null);
+                  fetchHints(app[i], cm2, options, function (result2) {
+                    if (result2 && result2.list.length > 0) callback(result2);
+                    else run(i + 1);
+                  });
+                }
+                run(0);
+              };
+              resolved.async = true;
+              resolved.supportsSelection = true;
+              return resolved;
+            } else if ((words = cm.getHelper(cm.getCursor(), "hintWords"))) {
+              return function (cm2) {
+                return CodeMirror.hint.fromList(cm2, { words });
+              };
+            } else if (CodeMirror.hint.anyword) {
+              return function (cm2, options) {
+                return CodeMirror.hint.anyword(cm2, options);
+              };
+            } else {
+              return function () {};
+            }
+          }
+          CodeMirror.registerHelper("hint", "auto", {
+            resolve: resolveAutoHints,
+          });
+          CodeMirror.registerHelper("hint", "fromList", function (cm, options) {
+            var cur = cm.getCursor(),
+              token2 = cm.getTokenAt(cur);
+            var term,
+              from = CodeMirror.Pos(cur.line, token2.start),
+              to = cur;
+            if (
+              token2.start < cur.ch &&
+              /\w/.test(token2.string.charAt(cur.ch - token2.start - 1))
+            ) {
+              term = token2.string.substr(0, cur.ch - token2.start);
+            } else {
+              term = "";
+              from = cur;
+            }
+            var found = [];
+            for (var i = 0; i < options.words.length; i++) {
+              var word2 = options.words[i];
+              if (word2.slice(0, term.length) == term) found.push(word2);
+            }
+            if (found.length) return { list: found, from, to };
+          });
+          CodeMirror.commands.autocomplete = CodeMirror.showHint;
+          var defaultOptions2 = {
+            hint: CodeMirror.hint.auto,
+            completeSingle: true,
+            alignWithWord: true,
+            closeCharacters: /[\s()\[\]{};:>,]/,
+            closeOnPick: true,
+            closeOnUnfocus: true,
+            updateOnCursorActivity: true,
+            completeOnSingleClick: true,
+            container: null,
+            customKeys: null,
+            extraKeys: null,
+            paddingForScrollbar: true,
+            moveOnOverlap: true,
+          };
+          CodeMirror.defineOption("hintOptions", null);
+        });
+      })();
+      var showHint = showHint$2.exports;
+      var showHint$1 = /* @__PURE__ */ Object.freeze(
+        /* @__PURE__ */ _mergeNamespaces(
+          {
+            __proto__: null,
+            [Symbol.toStringTag]: "Module",
+            default: showHint,
+          },
+          [showHint$2.exports]
+        )
+      );
+      var matchbrackets$2 = { exports: {} };
+      (function (module2, exports) {
+        (function (mod) {
+          mod(codemirror$2.exports);
+        })(function (CodeMirror) {
+          var ie_lt8 =
+            /MSIE \d/.test(navigator.userAgent) &&
+            (document.documentMode == null || document.documentMode < 8);
+          var Pos = CodeMirror.Pos;
+          var matching = {
+            "(": ")>",
+            ")": "(<",
+            "[": "]>",
+            "]": "[<",
+            "{": "}>",
+            "}": "{<",
+            "<": ">>",
+            ">": "<<",
+          };
+          function bracketRegex(config2) {
+            return (config2 && config2.bracketRegex) || /[(){}[\]]/;
+          }
+          function findMatchingBracket(cm, where, config2) {
+            var line = cm.getLineHandle(where.line),
+              pos = where.ch - 1;
+            var afterCursor = config2 && config2.afterCursor;
+            if (afterCursor == null)
+              afterCursor = /(^| )cm-fat-cursor($| )/.test(
+                cm.getWrapperElement().className
+              );
+            var re2 = bracketRegex(config2);
+            var match2 =
+              (!afterCursor &&
+                pos >= 0 &&
+                re2.test(line.text.charAt(pos)) &&
+                matching[line.text.charAt(pos)]) ||
+              (re2.test(line.text.charAt(pos + 1)) &&
+                matching[line.text.charAt(++pos)]);
+            if (!match2) return null;
+            var dir = match2.charAt(1) == ">" ? 1 : -1;
+            if (config2 && config2.strict && dir > 0 != (pos == where.ch))
+              return null;
+            var style = cm.getTokenTypeAt(Pos(where.line, pos + 1));
+            var found = scanForBracket(
+              cm,
+              Pos(where.line, pos + (dir > 0 ? 1 : 0)),
+              dir,
+              style,
+              config2
+            );
+            if (found == null) return null;
+            return {
+              from: Pos(where.line, pos),
+              to: found && found.pos,
+              match: found && found.ch == match2.charAt(0),
+              forward: dir > 0,
+            };
+          }
+          function scanForBracket(cm, where, dir, style, config2) {
+            var maxScanLen = (config2 && config2.maxScanLineLength) || 1e4;
+            var maxScanLines = (config2 && config2.maxScanLines) || 1e3;
+            var stack = [];
+            var re2 = bracketRegex(config2);
+            var lineEnd =
+              dir > 0
+                ? Math.min(where.line + maxScanLines, cm.lastLine() + 1)
+                : Math.max(cm.firstLine() - 1, where.line - maxScanLines);
+            for (var lineNo = where.line; lineNo != lineEnd; lineNo += dir) {
+              var line = cm.getLine(lineNo);
+              if (!line) continue;
+              var pos = dir > 0 ? 0 : line.length - 1,
+                end2 = dir > 0 ? line.length : -1;
+              if (line.length > maxScanLen) continue;
+              if (lineNo == where.line) pos = where.ch - (dir < 0 ? 1 : 0);
+              for (; pos != end2; pos += dir) {
+                var ch2 = line.charAt(pos);
+                if (
+                  re2.test(ch2) &&
+                  (style === void 0 ||
+                    (cm.getTokenTypeAt(Pos(lineNo, pos + 1)) || "") ==
+                      (style || ""))
+                ) {
+                  var match2 = matching[ch2];
+                  if (match2 && (match2.charAt(1) == ">") == dir > 0)
+                    stack.push(ch2);
+                  else if (!stack.length)
+                    return { pos: Pos(lineNo, pos), ch: ch2 };
+                  else stack.pop();
+                }
+              }
+            }
+            return lineNo - dir == (dir > 0 ? cm.lastLine() : cm.firstLine())
+              ? false
+              : null;
+          }
+          function matchBrackets(cm, autoclear, config2) {
+            var maxHighlightLen =
+                cm.state.matchBrackets.maxHighlightLineLength || 1e3,
+              highlightNonMatching = config2 && config2.highlightNonMatching;
+            var marks = [],
+              ranges = cm.listSelections();
+            for (var i = 0; i < ranges.length; i++) {
+              var match2 =
+                ranges[i].empty() &&
+                findMatchingBracket(cm, ranges[i].head, config2);
+              if (
+                match2 &&
+                (match2.match || highlightNonMatching !== false) &&
+                cm.getLine(match2.from.line).length <= maxHighlightLen
+              ) {
+                var style = match2.match
+                  ? "CodeMirror-matchingbracket"
+                  : "CodeMirror-nonmatchingbracket";
+                marks.push(
+                  cm.markText(
+                    match2.from,
+                    Pos(match2.from.line, match2.from.ch + 1),
+                    { className: style }
+                  )
+                );
+                if (
+                  match2.to &&
+                  cm.getLine(match2.to.line).length <= maxHighlightLen
+                )
+                  marks.push(
+                    cm.markText(
+                      match2.to,
+                      Pos(match2.to.line, match2.to.ch + 1),
+                      { className: style }
+                    )
+                  );
+              }
+            }
+            if (marks.length) {
+              if (ie_lt8 && cm.state.focused) cm.focus();
+              var clear = function () {
+                cm.operation(function () {
+                  for (var i2 = 0; i2 < marks.length; i2++) marks[i2].clear();
+                });
+              };
+              if (autoclear) setTimeout(clear, 800);
+              else return clear;
+            }
+          }
+          function doMatchBrackets(cm) {
+            cm.operation(function () {
+              if (cm.state.matchBrackets.currentlyHighlighted) {
+                cm.state.matchBrackets.currentlyHighlighted();
+                cm.state.matchBrackets.currentlyHighlighted = null;
+              }
+              cm.state.matchBrackets.currentlyHighlighted = matchBrackets(
+                cm,
+                false,
+                cm.state.matchBrackets
+              );
+            });
+          }
+          function clearHighlighted(cm) {
+            if (
+              cm.state.matchBrackets &&
+              cm.state.matchBrackets.currentlyHighlighted
+            ) {
+              cm.state.matchBrackets.currentlyHighlighted();
+              cm.state.matchBrackets.currentlyHighlighted = null;
+            }
+          }
+          CodeMirror.defineOption(
+            "matchBrackets",
+            false,
+            function (cm, val, old) {
+              if (old && old != CodeMirror.Init) {
+                cm.off("cursorActivity", doMatchBrackets);
+                cm.off("focus", doMatchBrackets);
+                cm.off("blur", clearHighlighted);
+                clearHighlighted(cm);
+              }
+              if (val) {
+                cm.state.matchBrackets = typeof val == "object" ? val : {};
+                cm.on("cursorActivity", doMatchBrackets);
+                cm.on("focus", doMatchBrackets);
+                cm.on("blur", clearHighlighted);
+              }
+            }
+          );
+          CodeMirror.defineExtension("matchBrackets", function () {
+            matchBrackets(this, true);
+          });
+          CodeMirror.defineExtension(
+            "findMatchingBracket",
+            function (pos, config2, oldConfig) {
+              if (oldConfig || typeof config2 == "boolean") {
+                if (!oldConfig) {
+                  config2 = config2 ? { strict: true } : null;
+                } else {
+                  oldConfig.strict = config2;
+                  config2 = oldConfig;
+                }
+              }
+              return findMatchingBracket(this, pos, config2);
+            }
+          );
+          CodeMirror.defineExtension(
+            "scanForBracket",
+            function (pos, dir, style, config2) {
+              return scanForBracket(this, pos, dir, style, config2);
+            }
+          );
+        });
+      })();
+      var matchbrackets = matchbrackets$2.exports;
+      var matchbrackets$1 = /* @__PURE__ */ Object.freeze(
+        /* @__PURE__ */ _mergeNamespaces(
+          {
+            __proto__: null,
+            [Symbol.toStringTag]: "Module",
+            default: matchbrackets,
+          },
+          [matchbrackets$2.exports]
+        )
+      );
+      var closebrackets$2 = { exports: {} };
+      (function (module2, exports) {
+        (function (mod) {
+          mod(codemirror$2.exports);
+        })(function (CodeMirror) {
+          var defaults2 = {
+            pairs: `()[]{}''""`,
+            closeBefore: `)]}'":;>`,
+            triples: "",
+            explode: "[]{}",
+          };
+          var Pos = CodeMirror.Pos;
+          CodeMirror.defineOption(
+            "autoCloseBrackets",
+            false,
+            function (cm, val, old) {
+              if (old && old != CodeMirror.Init) {
+                cm.removeKeyMap(keyMap2);
+                cm.state.closeBrackets = null;
+              }
+              if (val) {
+                ensureBound(getOption(val, "pairs"));
+                cm.state.closeBrackets = val;
+                cm.addKeyMap(keyMap2);
+              }
+            }
+          );
+          function getOption(conf, name2) {
+            if (name2 == "pairs" && typeof conf == "string") return conf;
+            if (typeof conf == "object" && conf[name2] != null)
+              return conf[name2];
+            return defaults2[name2];
+          }
+          var keyMap2 = { Backspace: handleBackspace, Enter: handleEnter };
+          function ensureBound(chars) {
+            for (var i = 0; i < chars.length; i++) {
+              var ch2 = chars.charAt(i),
+                key = "'" + ch2 + "'";
+              if (!keyMap2[key]) keyMap2[key] = handler(ch2);
+            }
+          }
+          ensureBound(defaults2.pairs + "`");
+          function handler(ch2) {
+            return function (cm) {
+              return handleChar(cm, ch2);
+            };
+          }
+          function getConfig(cm) {
+            var deflt = cm.state.closeBrackets;
+            if (!deflt || deflt.override) return deflt;
+            var mode2 = cm.getModeAt(cm.getCursor());
+            return mode2.closeBrackets || deflt;
+          }
+          function handleBackspace(cm) {
+            var conf = getConfig(cm);
+            if (!conf || cm.getOption("disableInput")) return CodeMirror.Pass;
+            var pairs = getOption(conf, "pairs");
+            var ranges = cm.listSelections();
+            for (var i = 0; i < ranges.length; i++) {
+              if (!ranges[i].empty()) return CodeMirror.Pass;
+              var around = charsAround(cm, ranges[i].head);
+              if (!around || pairs.indexOf(around) % 2 != 0)
+                return CodeMirror.Pass;
+            }
+            for (var i = ranges.length - 1; i >= 0; i--) {
+              var cur = ranges[i].head;
+              cm.replaceRange(
+                "",
+                Pos(cur.line, cur.ch - 1),
+                Pos(cur.line, cur.ch + 1),
+                "+delete"
+              );
+            }
+          }
+          function handleEnter(cm) {
+            var conf = getConfig(cm);
+            var explode = conf && getOption(conf, "explode");
+            if (!explode || cm.getOption("disableInput"))
+              return CodeMirror.Pass;
+            var ranges = cm.listSelections();
+            for (var i = 0; i < ranges.length; i++) {
+              if (!ranges[i].empty()) return CodeMirror.Pass;
+              var around = charsAround(cm, ranges[i].head);
+              if (!around || explode.indexOf(around) % 2 != 0)
+                return CodeMirror.Pass;
+            }
+            cm.operation(function () {
+              var linesep = cm.lineSeparator() || "\n";
+              cm.replaceSelection(linesep + linesep, null);
+              moveSel(cm, -1);
+              ranges = cm.listSelections();
+              for (var i2 = 0; i2 < ranges.length; i2++) {
+                var line = ranges[i2].head.line;
+                cm.indentLine(line, null, true);
+                cm.indentLine(line + 1, null, true);
+              }
+            });
+          }
+          function moveSel(cm, dir) {
+            var newRanges = [],
+              ranges = cm.listSelections(),
+              primary = 0;
+            for (var i = 0; i < ranges.length; i++) {
+              var range2 = ranges[i];
+              if (range2.head == cm.getCursor()) primary = i;
+              var pos =
+                range2.head.ch || dir > 0
+                  ? { line: range2.head.line, ch: range2.head.ch + dir }
+                  : { line: range2.head.line - 1 };
+              newRanges.push({ anchor: pos, head: pos });
+            }
+            cm.setSelections(newRanges, primary);
+          }
+          function contractSelection(sel) {
+            var inverted = CodeMirror.cmpPos(sel.anchor, sel.head) > 0;
+            return {
+              anchor: new Pos(
+                sel.anchor.line,
+                sel.anchor.ch + (inverted ? -1 : 1)
+              ),
+              head: new Pos(sel.head.line, sel.head.ch + (inverted ? 1 : -1)),
+            };
+          }
+          function handleChar(cm, ch2) {
+            var conf = getConfig(cm);
+            if (!conf || cm.getOption("disableInput")) return CodeMirror.Pass;
+            var pairs = getOption(conf, "pairs");
+            var pos = pairs.indexOf(ch2);
+            if (pos == -1) return CodeMirror.Pass;
+            var closeBefore = getOption(conf, "closeBefore");
+            var triples = getOption(conf, "triples");
+            var identical2 = pairs.charAt(pos + 1) == ch2;
+            var ranges = cm.listSelections();
+            var opening = pos % 2 == 0;
+            var type2;
+            for (var i = 0; i < ranges.length; i++) {
+              var range2 = ranges[i],
+                cur = range2.head,
+                curType;
+              var next = cm.getRange(cur, Pos(cur.line, cur.ch + 1));
+              if (opening && !range2.empty()) {
+                curType = "surround";
+              } else if ((identical2 || !opening) && next == ch2) {
+                if (identical2 && stringStartsAfter(cm, cur)) curType = "both";
+                else if (
+                  triples.indexOf(ch2) >= 0 &&
+                  cm.getRange(cur, Pos(cur.line, cur.ch + 3)) == ch2 + ch2 + ch2
+                )
+                  curType = "skipThree";
+                else curType = "skip";
+              } else if (
+                identical2 &&
+                cur.ch > 1 &&
+                triples.indexOf(ch2) >= 0 &&
+                cm.getRange(Pos(cur.line, cur.ch - 2), cur) == ch2 + ch2
+              ) {
+                if (
+                  cur.ch > 2 &&
+                  /\bstring/.test(cm.getTokenTypeAt(Pos(cur.line, cur.ch - 2)))
+                )
+                  return CodeMirror.Pass;
+                curType = "addFour";
+              } else if (identical2) {
+                var prev =
+                  cur.ch == 0
+                    ? " "
+                    : cm.getRange(Pos(cur.line, cur.ch - 1), cur);
+                if (
+                  !CodeMirror.isWordChar(next) &&
+                  prev != ch2 &&
+                  !CodeMirror.isWordChar(prev)
+                )
+                  curType = "both";
+                else return CodeMirror.Pass;
+              } else if (
+                opening &&
+                (next.length === 0 ||
+                  /\s/.test(next) ||
+                  closeBefore.indexOf(next) > -1)
+              ) {
+                curType = "both";
+              } else {
+                return CodeMirror.Pass;
+              }
+              if (!type2) type2 = curType;
+              else if (type2 != curType) return CodeMirror.Pass;
+            }
+            var left = pos % 2 ? pairs.charAt(pos - 1) : ch2;
+            var right = pos % 2 ? ch2 : pairs.charAt(pos + 1);
+            cm.operation(function () {
+              if (type2 == "skip") {
+                moveSel(cm, 1);
+              } else if (type2 == "skipThree") {
+                moveSel(cm, 3);
+              } else if (type2 == "surround") {
+                var sels = cm.getSelections();
+                for (var i2 = 0; i2 < sels.length; i2++)
+                  sels[i2] = left + sels[i2] + right;
+                cm.replaceSelections(sels, "around");
+                sels = cm.listSelections().slice();
+                for (var i2 = 0; i2 < sels.length; i2++)
+                  sels[i2] = contractSelection(sels[i2]);
+                cm.setSelections(sels);
+              } else if (type2 == "both") {
+                cm.replaceSelection(left + right, null);
+                cm.triggerElectric(left + right);
+                moveSel(cm, -1);
+              } else if (type2 == "addFour") {
+                cm.replaceSelection(left + left + left + left, "before");
+                moveSel(cm, 1);
+              }
+            });
+          }
+          function charsAround(cm, pos) {
+            var str = cm.getRange(
+              Pos(pos.line, pos.ch - 1),
+              Pos(pos.line, pos.ch + 1)
+            );
+            return str.length == 2 ? str : null;
+          }
+          function stringStartsAfter(cm, pos) {
+            var token2 = cm.getTokenAt(Pos(pos.line, pos.ch + 1));
+            return (
+              /\bstring/.test(token2.type) &&
+              token2.start == pos.ch &&
+              (pos.ch == 0 || !/\bstring/.test(cm.getTokenTypeAt(pos)))
+            );
+          }
+        });
+      })();
+      var closebrackets = closebrackets$2.exports;
+      var closebrackets$1 = /* @__PURE__ */ Object.freeze(
+        /* @__PURE__ */ _mergeNamespaces(
+          {
+            __proto__: null,
+            [Symbol.toStringTag]: "Module",
+            default: closebrackets,
+          },
+          [closebrackets$2.exports]
+        )
+      );
+      var braceFold$2 = { exports: {} };
+      (function (module2, exports) {
+        (function (mod) {
+          mod(codemirror$2.exports);
+        })(function (CodeMirror) {
+          function bracketFolding(pairs) {
+            return function (cm, start2) {
+              var line = start2.line,
+                lineText = cm.getLine(line);
+              function findOpening(pair) {
+                var tokenType;
+                for (var at = start2.ch, pass = 0; ; ) {
+                  var found2 =
+                    at <= 0 ? -1 : lineText.lastIndexOf(pair[0], at - 1);
+                  if (found2 == -1) {
+                    if (pass == 1) break;
+                    pass = 1;
+                    at = lineText.length;
+                    continue;
+                  }
+                  if (pass == 1 && found2 < start2.ch) break;
+                  tokenType = cm.getTokenTypeAt(
+                    CodeMirror.Pos(line, found2 + 1)
+                  );
+                  if (!/^(comment|string)/.test(tokenType))
+                    return { ch: found2 + 1, tokenType, pair };
+                  at = found2 - 1;
+                }
+              }
+              function findRange(found2) {
+                var count = 1,
+                  lastLine = cm.lastLine(),
+                  end2,
+                  startCh = found2.ch,
+                  endCh;
+                outer: for (var i2 = line; i2 <= lastLine; ++i2) {
+                  var text3 = cm.getLine(i2),
+                    pos = i2 == line ? startCh : 0;
+                  for (;;) {
+                    var nextOpen = text3.indexOf(found2.pair[0], pos),
+                      nextClose = text3.indexOf(found2.pair[1], pos);
+                    if (nextOpen < 0) nextOpen = text3.length;
+                    if (nextClose < 0) nextClose = text3.length;
+                    pos = Math.min(nextOpen, nextClose);
+                    if (pos == text3.length) break;
+                    if (
+                      cm.getTokenTypeAt(CodeMirror.Pos(i2, pos + 1)) ==
+                      found2.tokenType
+                    ) {
+                      if (pos == nextOpen) ++count;
+                      else if (!--count) {
+                        end2 = i2;
+                        endCh = pos;
+                        break outer;
+                      }
+                    }
+                    ++pos;
+                  }
+                }
+                if (end2 == null || line == end2) return null;
+                return {
+                  from: CodeMirror.Pos(line, startCh),
+                  to: CodeMirror.Pos(end2, endCh),
+                };
+              }
+              var found = [];
+              for (var i = 0; i < pairs.length; i++) {
+                var open = findOpening(pairs[i]);
+                if (open) found.push(open);
+              }
+              found.sort(function (a, b) {
+                return a.ch - b.ch;
+              });
+              for (var i = 0; i < found.length; i++) {
+                var range2 = findRange(found[i]);
+                if (range2) return range2;
+              }
+              return null;
+            };
+          }
+          CodeMirror.registerHelper(
+            "fold",
+            "brace",
+            bracketFolding([
+              ["{", "}"],
+              ["[", "]"],
+            ])
+          );
+          CodeMirror.registerHelper(
+            "fold",
+            "brace-paren",
+            bracketFolding([
+              ["{", "}"],
+              ["[", "]"],
+              ["(", ")"],
+            ])
+          );
+          CodeMirror.registerHelper("fold", "import", function (cm, start2) {
+            function hasImport(line) {
+              if (line < cm.firstLine() || line > cm.lastLine()) return null;
+              var start3 = cm.getTokenAt(CodeMirror.Pos(line, 1));
+              if (!/\S/.test(start3.string))
+                start3 = cm.getTokenAt(CodeMirror.Pos(line, start3.end + 1));
+              if (start3.type != "keyword" || start3.string != "import")
+                return null;
+              for (
+                var i = line, e = Math.min(cm.lastLine(), line + 10);
+                i <= e;
+                ++i
+              ) {
+                var text3 = cm.getLine(i),
+                  semi2 = text3.indexOf(";");
+                if (semi2 != -1)
+                  return { startCh: start3.end, end: CodeMirror.Pos(i, semi2) };
+              }
+            }
+            var startLine = start2.line,
+              has2 = hasImport(startLine),
+              prev;
+            if (
+              !has2 ||
+              hasImport(startLine - 1) ||
+              ((prev = hasImport(startLine - 2)) &&
+                prev.end.line == startLine - 1)
+            )
+              return null;
+            for (var end2 = has2.end; ; ) {
+              var next = hasImport(end2.line + 1);
+              if (next == null) break;
+              end2 = next.end;
+            }
+            return {
+              from: cm.clipPos(CodeMirror.Pos(startLine, has2.startCh + 1)),
+              to: end2,
+            };
+          });
+          CodeMirror.registerHelper("fold", "include", function (cm, start2) {
+            function hasInclude(line) {
+              if (line < cm.firstLine() || line > cm.lastLine()) return null;
+              var start3 = cm.getTokenAt(CodeMirror.Pos(line, 1));
+              if (!/\S/.test(start3.string))
+                start3 = cm.getTokenAt(CodeMirror.Pos(line, start3.end + 1));
+              if (
+                start3.type == "meta" &&
+                start3.string.slice(0, 8) == "#include"
+              )
+                return start3.start + 8;
+            }
+            var startLine = start2.line,
+              has2 = hasInclude(startLine);
+            if (has2 == null || hasInclude(startLine - 1) != null) return null;
+            for (var end2 = startLine; ; ) {
+              var next = hasInclude(end2 + 1);
+              if (next == null) break;
+              ++end2;
+            }
+            return {
+              from: CodeMirror.Pos(startLine, has2 + 1),
+              to: cm.clipPos(CodeMirror.Pos(end2)),
+            };
+          });
+        });
+      })();
+      var braceFold = braceFold$2.exports;
+      var braceFold$1 = /* @__PURE__ */ Object.freeze(
+        /* @__PURE__ */ _mergeNamespaces(
+          {
+            __proto__: null,
+            [Symbol.toStringTag]: "Module",
+            default: braceFold,
+          },
+          [braceFold$2.exports]
+        )
+      );
+      var foldgutter$2 = { exports: {} };
+      var foldcode = { exports: {} };
+      (function (module2, exports) {
+        (function (mod) {
+          mod(codemirror$2.exports);
+        })(function (CodeMirror) {
+          function doFold(cm, pos, options, force) {
+            if (options && options.call) {
+              var finder = options;
+              options = null;
+            } else {
+              var finder = getOption(cm, options, "rangeFinder");
+            }
+            if (typeof pos == "number") pos = CodeMirror.Pos(pos, 0);
+            var minSize = getOption(cm, options, "minFoldSize");
+            function getRange2(allowFolded) {
+              var range3 = finder(cm, pos);
+              if (!range3 || range3.to.line - range3.from.line < minSize)
+                return null;
+              if (force === "fold") return range3;
+              var marks = cm.findMarksAt(range3.from);
+              for (var i = 0; i < marks.length; ++i) {
+                if (marks[i].__isFold) {
+                  if (!allowFolded) return null;
+                  range3.cleared = true;
+                  marks[i].clear();
+                }
+              }
+              return range3;
+            }
+            var range2 = getRange2(true);
+            if (getOption(cm, options, "scanUp"))
+              while (!range2 && pos.line > cm.firstLine()) {
+                pos = CodeMirror.Pos(pos.line - 1, 0);
+                range2 = getRange2(false);
+              }
+            if (!range2 || range2.cleared || force === "unfold") return;
+            var myWidget = makeWidget(cm, options, range2);
+            CodeMirror.on(myWidget, "mousedown", function (e) {
+              myRange.clear();
+              CodeMirror.e_preventDefault(e);
+            });
+            var myRange = cm.markText(range2.from, range2.to, {
+              replacedWith: myWidget,
+              clearOnEnter: getOption(cm, options, "clearOnEnter"),
+              __isFold: true,
+            });
+            myRange.on("clear", function (from, to) {
+              CodeMirror.signal(cm, "unfold", cm, from, to);
+            });
+            CodeMirror.signal(cm, "fold", cm, range2.from, range2.to);
+          }
+          function makeWidget(cm, options, range2) {
+            var widget = getOption(cm, options, "widget");
+            if (typeof widget == "function") {
+              widget = widget(range2.from, range2.to);
+            }
+            if (typeof widget == "string") {
+              var text3 = document.createTextNode(widget);
+              widget = document.createElement("span");
+              widget.appendChild(text3);
+              widget.className = "CodeMirror-foldmarker";
+            } else if (widget) {
+              widget = widget.cloneNode(true);
+            }
+            return widget;
+          }
+          CodeMirror.newFoldFunction = function (rangeFinder, widget) {
+            return function (cm, pos) {
+              doFold(cm, pos, { rangeFinder, widget });
+            };
+          };
+          CodeMirror.defineExtension(
+            "foldCode",
+            function (pos, options, force) {
+              doFold(this, pos, options, force);
+            }
+          );
+          CodeMirror.defineExtension("isFolded", function (pos) {
+            var marks = this.findMarksAt(pos);
+            for (var i = 0; i < marks.length; ++i)
+              if (marks[i].__isFold) return true;
+          });
+          CodeMirror.commands.toggleFold = function (cm) {
+            cm.foldCode(cm.getCursor());
+          };
+          CodeMirror.commands.fold = function (cm) {
+            cm.foldCode(cm.getCursor(), null, "fold");
+          };
+          CodeMirror.commands.unfold = function (cm) {
+            cm.foldCode(cm.getCursor(), { scanUp: false }, "unfold");
+          };
+          CodeMirror.commands.foldAll = function (cm) {
+            cm.operation(function () {
+              for (var i = cm.firstLine(), e = cm.lastLine(); i <= e; i++)
+                cm.foldCode(CodeMirror.Pos(i, 0), { scanUp: false }, "fold");
+            });
+          };
+          CodeMirror.commands.unfoldAll = function (cm) {
+            cm.operation(function () {
+              for (var i = cm.firstLine(), e = cm.lastLine(); i <= e; i++)
+                cm.foldCode(CodeMirror.Pos(i, 0), { scanUp: false }, "unfold");
+            });
+          };
+          CodeMirror.registerHelper("fold", "combine", function () {
+            var funcs = Array.prototype.slice.call(arguments, 0);
+            return function (cm, start2) {
+              for (var i = 0; i < funcs.length; ++i) {
+                var found = funcs[i](cm, start2);
+                if (found) return found;
+              }
+            };
+          });
+          CodeMirror.registerHelper("fold", "auto", function (cm, start2) {
+            var helpers2 = cm.getHelpers(start2, "fold");
+            for (var i = 0; i < helpers2.length; i++) {
+              var cur = helpers2[i](cm, start2);
+              if (cur) return cur;
+            }
+          });
+          var defaultOptions2 = {
+            rangeFinder: CodeMirror.fold.auto,
+            widget: "\u2194",
+            minFoldSize: 0,
+            scanUp: false,
+            clearOnEnter: true,
+          };
+          CodeMirror.defineOption("foldOptions", null);
+          function getOption(cm, options, name2) {
+            if (options && options[name2] !== void 0) return options[name2];
+            var editorOptions = cm.options.foldOptions;
+            if (editorOptions && editorOptions[name2] !== void 0)
+              return editorOptions[name2];
+            return defaultOptions2[name2];
+          }
+          CodeMirror.defineExtension("foldOption", function (options, name2) {
+            return getOption(this, options, name2);
+          });
+        });
+      })();
+      (function (module2, exports) {
+        (function (mod) {
+          mod(codemirror$2.exports, foldcode.exports);
+        })(function (CodeMirror) {
+          CodeMirror.defineOption("foldGutter", false, function (cm, val, old) {
+            if (old && old != CodeMirror.Init) {
+              cm.clearGutter(cm.state.foldGutter.options.gutter);
+              cm.state.foldGutter = null;
+              cm.off("gutterClick", onGutterClick);
+              cm.off("changes", onChange);
+              cm.off("viewportChange", onViewportChange);
+              cm.off("fold", onFold);
+              cm.off("unfold", onFold);
+              cm.off("swapDoc", onChange);
+            }
+            if (val) {
+              cm.state.foldGutter = new State(parseOptions(val));
+              updateInViewport(cm);
+              cm.on("gutterClick", onGutterClick);
+              cm.on("changes", onChange);
+              cm.on("viewportChange", onViewportChange);
+              cm.on("fold", onFold);
+              cm.on("unfold", onFold);
+              cm.on("swapDoc", onChange);
+            }
+          });
+          var Pos = CodeMirror.Pos;
+          function State(options) {
+            this.options = options;
+            this.from = this.to = 0;
+          }
+          function parseOptions(opts) {
+            if (opts === true) opts = {};
+            if (opts.gutter == null) opts.gutter = "CodeMirror-foldgutter";
+            if (opts.indicatorOpen == null)
+              opts.indicatorOpen = "CodeMirror-foldgutter-open";
+            if (opts.indicatorFolded == null)
+              opts.indicatorFolded = "CodeMirror-foldgutter-folded";
+            return opts;
+          }
+          function isFolded(cm, line) {
+            var marks = cm.findMarks(Pos(line, 0), Pos(line + 1, 0));
+            for (var i = 0; i < marks.length; ++i) {
+              if (marks[i].__isFold) {
+                var fromPos = marks[i].find(-1);
+                if (fromPos && fromPos.line === line) return marks[i];
+              }
+            }
+          }
+          function marker2(spec) {
+            if (typeof spec == "string") {
+              var elt = document.createElement("div");
+              elt.className = spec + " CodeMirror-guttermarker-subtle";
+              return elt;
+            } else {
+              return spec.cloneNode(true);
+            }
+          }
+          function updateFoldInfo(cm, from, to) {
+            var opts = cm.state.foldGutter.options,
+              cur = from - 1;
+            var minSize = cm.foldOption(opts, "minFoldSize");
+            var func = cm.foldOption(opts, "rangeFinder");
+            var clsFolded =
+              typeof opts.indicatorFolded == "string" &&
+              classTest(opts.indicatorFolded);
+            var clsOpen =
+              typeof opts.indicatorOpen == "string" &&
+              classTest(opts.indicatorOpen);
+            cm.eachLine(from, to, function (line) {
+              ++cur;
+              var mark = null;
+              var old = line.gutterMarkers;
+              if (old) old = old[opts.gutter];
+              if (isFolded(cm, cur)) {
+                if (clsFolded && old && clsFolded.test(old.className)) return;
+                mark = marker2(opts.indicatorFolded);
+              } else {
+                var pos = Pos(cur, 0);
+                var range2 = func && func(cm, pos);
+                if (range2 && range2.to.line - range2.from.line >= minSize) {
+                  if (clsOpen && old && clsOpen.test(old.className)) return;
+                  mark = marker2(opts.indicatorOpen);
+                }
+              }
+              if (!mark && !old) return;
+              cm.setGutterMarker(line, opts.gutter, mark);
+            });
+          }
+          function classTest(cls) {
+            return new RegExp("(^|\\s)" + cls + "(?:$|\\s)\\s*");
+          }
+          function updateInViewport(cm) {
+            var vp = cm.getViewport(),
+              state = cm.state.foldGutter;
+            if (!state) return;
+            cm.operation(function () {
+              updateFoldInfo(cm, vp.from, vp.to);
+            });
+            state.from = vp.from;
+            state.to = vp.to;
+          }
+          function onGutterClick(cm, line, gutter) {
+            var state = cm.state.foldGutter;
+            if (!state) return;
+            var opts = state.options;
+            if (gutter != opts.gutter) return;
+            var folded = isFolded(cm, line);
+            if (folded) folded.clear();
+            else cm.foldCode(Pos(line, 0), opts);
+          }
+          function onChange(cm) {
+            var state = cm.state.foldGutter;
+            if (!state) return;
+            var opts = state.options;
+            state.from = state.to = 0;
+            clearTimeout(state.changeUpdate);
+            state.changeUpdate = setTimeout(function () {
+              updateInViewport(cm);
+            }, opts.foldOnChangeTimeSpan || 600);
+          }
+          function onViewportChange(cm) {
+            var state = cm.state.foldGutter;
+            if (!state) return;
+            var opts = state.options;
+            clearTimeout(state.changeUpdate);
+            state.changeUpdate = setTimeout(function () {
+              var vp = cm.getViewport();
+              if (
+                state.from == state.to ||
+                vp.from - state.to > 20 ||
+                state.from - vp.to > 20
+              ) {
+                updateInViewport(cm);
+              } else {
+                cm.operation(function () {
+                  if (vp.from < state.from) {
+                    updateFoldInfo(cm, vp.from, state.from);
+                    state.from = vp.from;
+                  }
+                  if (vp.to > state.to) {
+                    updateFoldInfo(cm, state.to, vp.to);
+                    state.to = vp.to;
+                  }
+                });
+              }
+            }, opts.updateViewportTimeSpan || 400);
+          }
+          function onFold(cm, from) {
+            var state = cm.state.foldGutter;
+            if (!state) return;
+            var line = from.line;
+            if (line >= state.from && line < state.to)
+              updateFoldInfo(cm, line, line + 1);
+          }
+        });
+      })();
+      var foldgutter = foldgutter$2.exports;
+      var foldgutter$1 = /* @__PURE__ */ Object.freeze(
+        /* @__PURE__ */ _mergeNamespaces(
+          {
+            __proto__: null,
+            [Symbol.toStringTag]: "Module",
+            default: foldgutter,
+          },
+          [foldgutter$2.exports]
+        )
+      );
+      var lint$6 = { exports: {} };
+      (function (module2, exports) {
+        (function (mod) {
+          mod(codemirror$2.exports);
+        })(function (CodeMirror) {
+          var GUTTER_ID = "CodeMirror-lint-markers";
+          var LINT_LINE_ID = "CodeMirror-lint-line-";
+          function showTooltip(cm, e, content) {
+            var tt = document.createElement("div");
+            tt.className = "CodeMirror-lint-tooltip cm-s-" + cm.options.theme;
+            tt.appendChild(content.cloneNode(true));
+            if (cm.state.lint.options.selfContain)
+              cm.getWrapperElement().appendChild(tt);
+            else document.body.appendChild(tt);
+            function position(e2) {
+              if (!tt.parentNode)
+                return CodeMirror.off(document, "mousemove", position);
+              tt.style.top =
+                Math.max(0, e2.clientY - tt.offsetHeight - 5) + "px";
+              tt.style.left = e2.clientX + 5 + "px";
+            }
+            CodeMirror.on(document, "mousemove", position);
+            position(e);
+            if (tt.style.opacity != null) tt.style.opacity = 1;
+            return tt;
+          }
+          function rm(elt) {
+            if (elt.parentNode) elt.parentNode.removeChild(elt);
+          }
+          function hideTooltip(tt) {
+            if (!tt.parentNode) return;
+            if (tt.style.opacity == null) rm(tt);
+            tt.style.opacity = 0;
+            setTimeout(function () {
+              rm(tt);
+            }, 600);
+          }
+          function showTooltipFor(cm, e, content, node) {
+            var tooltip = showTooltip(cm, e, content);
+            function hide() {
+              CodeMirror.off(node, "mouseout", hide);
+              if (tooltip) {
+                hideTooltip(tooltip);
+                tooltip = null;
+              }
+            }
+            var poll = setInterval(function () {
+              if (tooltip)
+                for (var n2 = node; ; n2 = n2.parentNode) {
+                  if (n2 && n2.nodeType == 11) n2 = n2.host;
+                  if (n2 == document.body) return;
+                  if (!n2) {
+                    hide();
+                    break;
+                  }
+                }
+              if (!tooltip) return clearInterval(poll);
+            }, 400);
+            CodeMirror.on(node, "mouseout", hide);
+          }
+          function LintState(cm, conf, hasGutter) {
+            this.marked = [];
+            if (conf instanceof Function) conf = { getAnnotations: conf };
+            if (!conf || conf === true) conf = {};
+            this.options = {};
+            this.linterOptions = conf.options || {};
+            for (var prop2 in defaults2) this.options[prop2] = defaults2[prop2];
+            for (var prop2 in conf) {
+              if (defaults2.hasOwnProperty(prop2)) {
+                if (conf[prop2] != null) this.options[prop2] = conf[prop2];
+              } else if (!conf.options) {
+                this.linterOptions[prop2] = conf[prop2];
+              }
+            }
+            this.timeout = null;
+            this.hasGutter = hasGutter;
+            this.onMouseOver = function (e) {
+              onMouseOver2(cm, e);
+            };
+            this.waitingFor = 0;
+          }
+          var defaults2 = {
+            highlightLines: false,
+            tooltips: true,
+            delay: 500,
+            lintOnChange: true,
+            getAnnotations: null,
+            async: false,
+            selfContain: null,
+            formatAnnotation: null,
+            onUpdateLinting: null,
+          };
+          function clearMarks(cm) {
+            var state = cm.state.lint;
+            if (state.hasGutter) cm.clearGutter(GUTTER_ID);
+            if (state.options.highlightLines) clearErrorLines(cm);
+            for (var i = 0; i < state.marked.length; ++i)
+              state.marked[i].clear();
+            state.marked.length = 0;
+          }
+          function clearErrorLines(cm) {
+            cm.eachLine(function (line) {
+              var has2 =
+                line.wrapClass &&
+                /\bCodeMirror-lint-line-\w+\b/.exec(line.wrapClass);
+              if (has2) cm.removeLineClass(line, "wrap", has2[0]);
+            });
+          }
+          function makeMarker(cm, labels, severity, multiple, tooltips) {
+            var marker2 = document.createElement("div"),
+              inner = marker2;
+            marker2.className =
+              "CodeMirror-lint-marker CodeMirror-lint-marker-" + severity;
+            if (multiple) {
+              inner = marker2.appendChild(document.createElement("div"));
+              inner.className =
+                "CodeMirror-lint-marker CodeMirror-lint-marker-multiple";
+            }
+            if (tooltips != false)
+              CodeMirror.on(inner, "mouseover", function (e) {
+                showTooltipFor(cm, e, labels, inner);
+              });
+            return marker2;
+          }
+          function getMaxSeverity(a, b) {
+            if (a == "error") return a;
+            else return b;
+          }
+          function groupByLine(annotations2) {
+            var lines = [];
+            for (var i = 0; i < annotations2.length; ++i) {
+              var ann = annotations2[i],
+                line = ann.from.line;
+              (lines[line] || (lines[line] = [])).push(ann);
+            }
+            return lines;
+          }
+          function annotationTooltip(ann) {
+            var severity = ann.severity;
+            if (!severity) severity = "error";
+            var tip = document.createElement("div");
+            tip.className =
+              "CodeMirror-lint-message CodeMirror-lint-message-" + severity;
+            if (typeof ann.messageHTML != "undefined") {
+              tip.innerHTML = ann.messageHTML;
+            } else {
+              tip.appendChild(document.createTextNode(ann.message));
+            }
+            return tip;
+          }
+          function lintAsync(cm, getAnnotations) {
+            var state = cm.state.lint;
+            var id2 = ++state.waitingFor;
+            function abort() {
+              id2 = -1;
+              cm.off("change", abort);
+            }
+            cm.on("change", abort);
+            getAnnotations(
+              cm.getValue(),
+              function (annotations2, arg2) {
+                cm.off("change", abort);
+                if (state.waitingFor != id2) return;
+                if (arg2 && annotations2 instanceof CodeMirror)
+                  annotations2 = arg2;
+                cm.operation(function () {
+                  updateLinting(cm, annotations2);
+                });
+              },
+              state.linterOptions,
+              cm
+            );
+          }
+          function startLinting(cm) {
+            var state = cm.state.lint;
+            if (!state) return;
+            var options = state.options;
+            var getAnnotations =
+              options.getAnnotations ||
+              cm.getHelper(CodeMirror.Pos(0, 0), "lint");
+            if (!getAnnotations) return;
+            if (options.async || getAnnotations.async) {
+              lintAsync(cm, getAnnotations);
+            } else {
+              var annotations2 = getAnnotations(
+                cm.getValue(),
+                state.linterOptions,
+                cm
+              );
+              if (!annotations2) return;
+              if (annotations2.then)
+                annotations2.then(function (issues) {
+                  cm.operation(function () {
+                    updateLinting(cm, issues);
+                  });
+                });
+              else
+                cm.operation(function () {
+                  updateLinting(cm, annotations2);
+                });
+            }
+          }
+          function updateLinting(cm, annotationsNotSorted) {
+            var state = cm.state.lint;
+            if (!state) return;
+            var options = state.options;
+            clearMarks(cm);
+            var annotations2 = groupByLine(annotationsNotSorted);
+            for (var line = 0; line < annotations2.length; ++line) {
+              var anns = annotations2[line];
+              if (!anns) continue;
+              var message = [];
+              anns = anns.filter(function (item) {
+                return message.indexOf(item.message) > -1
+                  ? false
+                  : message.push(item.message);
+              });
+              var maxSeverity = null;
+              var tipLabel =
+                state.hasGutter && document.createDocumentFragment();
+              for (var i = 0; i < anns.length; ++i) {
+                var ann = anns[i];
+                var severity = ann.severity;
+                if (!severity) severity = "error";
+                maxSeverity = getMaxSeverity(maxSeverity, severity);
+                if (options.formatAnnotation)
+                  ann = options.formatAnnotation(ann);
+                if (state.hasGutter)
+                  tipLabel.appendChild(annotationTooltip(ann));
+                if (ann.to)
+                  state.marked.push(
+                    cm.markText(ann.from, ann.to, {
+                      className:
+                        "CodeMirror-lint-mark CodeMirror-lint-mark-" + severity,
+                      __annotation: ann,
+                    })
+                  );
+              }
+              if (state.hasGutter)
+                cm.setGutterMarker(
+                  line,
+                  GUTTER_ID,
+                  makeMarker(
+                    cm,
+                    tipLabel,
+                    maxSeverity,
+                    annotations2[line].length > 1,
+                    options.tooltips
+                  )
+                );
+              if (options.highlightLines)
+                cm.addLineClass(line, "wrap", LINT_LINE_ID + maxSeverity);
+            }
+            if (options.onUpdateLinting)
+              options.onUpdateLinting(annotationsNotSorted, annotations2, cm);
+          }
+          function onChange(cm) {
+            var state = cm.state.lint;
+            if (!state) return;
+            clearTimeout(state.timeout);
+            state.timeout = setTimeout(function () {
+              startLinting(cm);
+            }, state.options.delay);
+          }
+          function popupTooltips(cm, annotations2, e) {
+            var target2 = e.target || e.srcElement;
+            var tooltip = document.createDocumentFragment();
+            for (var i = 0; i < annotations2.length; i++) {
+              var ann = annotations2[i];
+              tooltip.appendChild(annotationTooltip(ann));
+            }
+            showTooltipFor(cm, e, tooltip, target2);
+          }
+          function onMouseOver2(cm, e) {
+            var target2 = e.target || e.srcElement;
+            if (!/\bCodeMirror-lint-mark-/.test(target2.className)) return;
+            var box = target2.getBoundingClientRect(),
+              x2 = (box.left + box.right) / 2,
+              y2 = (box.top + box.bottom) / 2;
+            var spans = cm.findMarksAt(
+              cm.coordsChar({ left: x2, top: y2 }, "client")
+            );
+            var annotations2 = [];
+            for (var i = 0; i < spans.length; ++i) {
+              var ann = spans[i].__annotation;
+              if (ann) annotations2.push(ann);
+            }
+            if (annotations2.length) popupTooltips(cm, annotations2, e);
+          }
+          CodeMirror.defineOption("lint", false, function (cm, val, old) {
+            if (old && old != CodeMirror.Init) {
+              clearMarks(cm);
+              if (cm.state.lint.options.lintOnChange !== false)
+                cm.off("change", onChange);
+              CodeMirror.off(
+                cm.getWrapperElement(),
+                "mouseover",
+                cm.state.lint.onMouseOver
+              );
+              clearTimeout(cm.state.lint.timeout);
+              delete cm.state.lint;
+            }
+            if (val) {
+              var gutters = cm.getOption("gutters"),
+                hasLintGutter = false;
+              for (var i = 0; i < gutters.length; ++i)
+                if (gutters[i] == GUTTER_ID) hasLintGutter = true;
+              var state = (cm.state.lint = new LintState(
+                cm,
+                val,
+                hasLintGutter
+              ));
+              if (state.options.lintOnChange) cm.on("change", onChange);
+              if (
+                state.options.tooltips != false &&
+                state.options.tooltips != "gutter"
+              )
+                CodeMirror.on(
+                  cm.getWrapperElement(),
+                  "mouseover",
+                  state.onMouseOver
+                );
+              startLinting(cm);
+            }
+          });
+          CodeMirror.defineExtension("performLint", function () {
+            startLinting(this);
+          });
+        });
+      })();
+      var lint$4 = lint$6.exports;
+      var lint$5 = /* @__PURE__ */ Object.freeze(
+        /* @__PURE__ */ _mergeNamespaces(
+          {
+            __proto__: null,
+            [Symbol.toStringTag]: "Module",
+            default: lint$4,
+          },
+          [lint$6.exports]
+        )
+      );
+      var searchcursor$2 = { exports: {} };
+      (function (module2, exports) {
+        (function (mod) {
+          mod(codemirror$2.exports);
+        })(function (CodeMirror) {
+          var Pos = CodeMirror.Pos;
+          function regexpFlags(regexp) {
+            var flags = regexp.flags;
+            return flags != null
+              ? flags
+              : (regexp.ignoreCase ? "i" : "") +
+                  (regexp.global ? "g" : "") +
+                  (regexp.multiline ? "m" : "");
+          }
+          function ensureFlags(regexp, flags) {
+            var current = regexpFlags(regexp),
+              target2 = current;
+            for (var i = 0; i < flags.length; i++)
+              if (target2.indexOf(flags.charAt(i)) == -1)
+                target2 += flags.charAt(i);
+            return current == target2
+              ? regexp
+              : new RegExp(regexp.source, target2);
+          }
+          function maybeMultiline(regexp) {
+            return /\\s|\\n|\n|\\W|\\D|\[\^/.test(regexp.source);
+          }
+          function searchRegexpForward(doc, regexp, start2) {
+            regexp = ensureFlags(regexp, "g");
+            for (
+              var line = start2.line, ch2 = start2.ch, last = doc.lastLine();
+              line <= last;
+              line++, ch2 = 0
+            ) {
+              regexp.lastIndex = ch2;
+              var string2 = doc.getLine(line),
+                match2 = regexp.exec(string2);
+              if (match2)
+                return {
+                  from: Pos(line, match2.index),
+                  to: Pos(line, match2.index + match2[0].length),
+                  match: match2,
+                };
+            }
+          }
+          function searchRegexpForwardMultiline(doc, regexp, start2) {
+            if (!maybeMultiline(regexp))
+              return searchRegexpForward(doc, regexp, start2);
+            regexp = ensureFlags(regexp, "gm");
+            var string2,
+              chunk = 1;
+            for (
+              var line = start2.line, last = doc.lastLine();
+              line <= last;
+
+            ) {
+              for (var i = 0; i < chunk; i++) {
+                if (line > last) break;
+                var curLine = doc.getLine(line++);
+                string2 = string2 == null ? curLine : string2 + "\n" + curLine;
+              }
+              chunk = chunk * 2;
+              regexp.lastIndex = start2.ch;
+              var match2 = regexp.exec(string2);
+              if (match2) {
+                var before = string2.slice(0, match2.index).split("\n"),
+                  inside = match2[0].split("\n");
+                var startLine = start2.line + before.length - 1,
+                  startCh = before[before.length - 1].length;
+                return {
+                  from: Pos(startLine, startCh),
+                  to: Pos(
+                    startLine + inside.length - 1,
+                    inside.length == 1
+                      ? startCh + inside[0].length
+                      : inside[inside.length - 1].length
+                  ),
+                  match: match2,
+                };
+              }
+            }
+          }
+          function lastMatchIn(string2, regexp, endMargin) {
+            var match2,
+              from = 0;
+            while (from <= string2.length) {
+              regexp.lastIndex = from;
+              var newMatch = regexp.exec(string2);
+              if (!newMatch) break;
+              var end2 = newMatch.index + newMatch[0].length;
+              if (end2 > string2.length - endMargin) break;
+              if (!match2 || end2 > match2.index + match2[0].length)
+                match2 = newMatch;
+              from = newMatch.index + 1;
+            }
+            return match2;
+          }
+          function searchRegexpBackward(doc, regexp, start2) {
+            regexp = ensureFlags(regexp, "g");
+            for (
+              var line = start2.line, ch2 = start2.ch, first = doc.firstLine();
+              line >= first;
+              line--, ch2 = -1
+            ) {
+              var string2 = doc.getLine(line);
+              var match2 = lastMatchIn(
+                string2,
+                regexp,
+                ch2 < 0 ? 0 : string2.length - ch2
+              );
+              if (match2)
+                return {
+                  from: Pos(line, match2.index),
+                  to: Pos(line, match2.index + match2[0].length),
+                  match: match2,
+                };
+            }
+          }
+          function searchRegexpBackwardMultiline(doc, regexp, start2) {
+            if (!maybeMultiline(regexp))
+              return searchRegexpBackward(doc, regexp, start2);
+            regexp = ensureFlags(regexp, "gm");
+            var string2,
+              chunkSize = 1,
+              endMargin = doc.getLine(start2.line).length - start2.ch;
+            for (
+              var line = start2.line, first = doc.firstLine();
+              line >= first;
+
+            ) {
+              for (var i = 0; i < chunkSize && line >= first; i++) {
+                var curLine = doc.getLine(line--);
+                string2 = string2 == null ? curLine : curLine + "\n" + string2;
+              }
+              chunkSize *= 2;
+              var match2 = lastMatchIn(string2, regexp, endMargin);
+              if (match2) {
+                var before = string2.slice(0, match2.index).split("\n"),
+                  inside = match2[0].split("\n");
+                var startLine = line + before.length,
+                  startCh = before[before.length - 1].length;
+                return {
+                  from: Pos(startLine, startCh),
+                  to: Pos(
+                    startLine + inside.length - 1,
+                    inside.length == 1
+                      ? startCh + inside[0].length
+                      : inside[inside.length - 1].length
+                  ),
+                  match: match2,
+                };
+              }
+            }
+          }
+          var doFold, noFold;
+          if (String.prototype.normalize) {
+            doFold = function (str) {
+              return str.normalize("NFD").toLowerCase();
+            };
+            noFold = function (str) {
+              return str.normalize("NFD");
+            };
+          } else {
+            doFold = function (str) {
+              return str.toLowerCase();
+            };
+            noFold = function (str) {
+              return str;
+            };
+          }
+          function adjustPos(orig, folded, pos, foldFunc) {
+            if (orig.length == folded.length) return pos;
+            for (
+              var min = 0, max = pos + Math.max(0, orig.length - folded.length);
+              ;
+
+            ) {
+              if (min == max) return min;
+              var mid2 = (min + max) >> 1;
+              var len = foldFunc(orig.slice(0, mid2)).length;
+              if (len == pos) return mid2;
+              else if (len > pos) max = mid2;
+              else min = mid2 + 1;
+            }
+          }
+          function searchStringForward(doc, query, start2, caseFold) {
+            if (!query.length) return null;
+            var fold = caseFold ? doFold : noFold;
+            var lines = fold(query).split(/\r|\n\r?/);
+            search: for (
+              var line = start2.line,
+                ch2 = start2.ch,
+                last = doc.lastLine() + 1 - lines.length;
+              line <= last;
+              line++, ch2 = 0
+            ) {
+              var orig = doc.getLine(line).slice(ch2),
+                string2 = fold(orig);
+              if (lines.length == 1) {
+                var found = string2.indexOf(lines[0]);
+                if (found == -1) continue search;
+                var start2 = adjustPos(orig, string2, found, fold) + ch2;
+                return {
+                  from: Pos(line, adjustPos(orig, string2, found, fold) + ch2),
+                  to: Pos(
+                    line,
+                    adjustPos(orig, string2, found + lines[0].length, fold) +
+                      ch2
+                  ),
+                };
+              } else {
+                var cutFrom = string2.length - lines[0].length;
+                if (string2.slice(cutFrom) != lines[0]) continue search;
+                for (var i = 1; i < lines.length - 1; i++)
+                  if (fold(doc.getLine(line + i)) != lines[i]) continue search;
+                var end2 = doc.getLine(line + lines.length - 1),
+                  endString = fold(end2),
+                  lastLine = lines[lines.length - 1];
+                if (endString.slice(0, lastLine.length) != lastLine)
+                  continue search;
+                return {
+                  from: Pos(
+                    line,
+                    adjustPos(orig, string2, cutFrom, fold) + ch2
+                  ),
+                  to: Pos(
+                    line + lines.length - 1,
+                    adjustPos(end2, endString, lastLine.length, fold)
+                  ),
+                };
+              }
+            }
+          }
+          function searchStringBackward(doc, query, start2, caseFold) {
+            if (!query.length) return null;
+            var fold = caseFold ? doFold : noFold;
+            var lines = fold(query).split(/\r|\n\r?/);
+            search: for (
+              var line = start2.line,
+                ch2 = start2.ch,
+                first = doc.firstLine() - 1 + lines.length;
+              line >= first;
+              line--, ch2 = -1
+            ) {
+              var orig = doc.getLine(line);
+              if (ch2 > -1) orig = orig.slice(0, ch2);
+              var string2 = fold(orig);
+              if (lines.length == 1) {
+                var found = string2.lastIndexOf(lines[0]);
+                if (found == -1) continue search;
+                return {
+                  from: Pos(line, adjustPos(orig, string2, found, fold)),
+                  to: Pos(
+                    line,
+                    adjustPos(orig, string2, found + lines[0].length, fold)
+                  ),
+                };
+              } else {
+                var lastLine = lines[lines.length - 1];
+                if (string2.slice(0, lastLine.length) != lastLine)
+                  continue search;
+                for (
+                  var i = 1, start2 = line - lines.length + 1;
+                  i < lines.length - 1;
+                  i++
+                )
+                  if (fold(doc.getLine(start2 + i)) != lines[i])
+                    continue search;
+                var top2 = doc.getLine(line + 1 - lines.length),
+                  topString = fold(top2);
+                if (
+                  topString.slice(topString.length - lines[0].length) !=
+                  lines[0]
+                )
+                  continue search;
+                return {
+                  from: Pos(
+                    line + 1 - lines.length,
+                    adjustPos(
+                      top2,
+                      topString,
+                      top2.length - lines[0].length,
+                      fold
+                    )
+                  ),
+                  to: Pos(
+                    line,
+                    adjustPos(orig, string2, lastLine.length, fold)
+                  ),
+                };
+              }
+            }
+          }
+          function SearchCursor(doc, query, pos, options) {
+            this.atOccurrence = false;
+            this.afterEmptyMatch = false;
+            this.doc = doc;
+            pos = pos ? doc.clipPos(pos) : Pos(0, 0);
+            this.pos = { from: pos, to: pos };
+            var caseFold;
+            if (typeof options == "object") {
+              caseFold = options.caseFold;
+            } else {
+              caseFold = options;
+              options = null;
+            }
+            if (typeof query == "string") {
+              if (caseFold == null) caseFold = false;
+              this.matches = function (reverse, pos2) {
+                return (reverse ? searchStringBackward : searchStringForward)(
+                  doc,
+                  query,
+                  pos2,
+                  caseFold
+                );
+              };
+            } else {
+              query = ensureFlags(query, "gm");
+              if (!options || options.multiline !== false)
+                this.matches = function (reverse, pos2) {
+                  return (
+                    reverse
+                      ? searchRegexpBackwardMultiline
+                      : searchRegexpForwardMultiline
+                  )(doc, query, pos2);
+                };
+              else
+                this.matches = function (reverse, pos2) {
+                  return (reverse ? searchRegexpBackward : searchRegexpForward)(
+                    doc,
+                    query,
+                    pos2
+                  );
+                };
+            }
+          }
+          SearchCursor.prototype = {
+            findNext: function () {
+              return this.find(false);
+            },
+            findPrevious: function () {
+              return this.find(true);
+            },
+            find: function (reverse) {
+              var head = this.doc.clipPos(
+                reverse ? this.pos.from : this.pos.to
+              );
+              if (this.afterEmptyMatch && this.atOccurrence) {
+                head = Pos(head.line, head.ch);
+                if (reverse) {
+                  head.ch--;
+                  if (head.ch < 0) {
+                    head.line--;
+                    head.ch = (this.doc.getLine(head.line) || "").length;
+                  }
+                } else {
+                  head.ch++;
+                  if (head.ch > (this.doc.getLine(head.line) || "").length) {
+                    head.ch = 0;
+                    head.line++;
+                  }
+                }
+                if (CodeMirror.cmpPos(head, this.doc.clipPos(head)) != 0) {
+                  return (this.atOccurrence = false);
+                }
+              }
+              var result2 = this.matches(reverse, head);
+              this.afterEmptyMatch =
+                result2 && CodeMirror.cmpPos(result2.from, result2.to) == 0;
+              if (result2) {
+                this.pos = result2;
+                this.atOccurrence = true;
+                return this.pos.match || true;
+              } else {
+                var end2 = Pos(
+                  reverse ? this.doc.firstLine() : this.doc.lastLine() + 1,
+                  0
+                );
+                this.pos = { from: end2, to: end2 };
+                return (this.atOccurrence = false);
+              }
+            },
+            from: function () {
+              if (this.atOccurrence) return this.pos.from;
+            },
+            to: function () {
+              if (this.atOccurrence) return this.pos.to;
+            },
+            replace: function (newText, origin) {
+              if (!this.atOccurrence) return;
+              var lines = CodeMirror.splitLines(newText);
+              this.doc.replaceRange(lines, this.pos.from, this.pos.to, origin);
+              this.pos.to = Pos(
+                this.pos.from.line + lines.length - 1,
+                lines[lines.length - 1].length +
+                  (lines.length == 1 ? this.pos.from.ch : 0)
+              );
+            },
+          };
+          CodeMirror.defineExtension(
+            "getSearchCursor",
+            function (query, pos, caseFold) {
+              return new SearchCursor(this.doc, query, pos, caseFold);
+            }
+          );
+          CodeMirror.defineDocExtension(
+            "getSearchCursor",
+            function (query, pos, caseFold) {
+              return new SearchCursor(this, query, pos, caseFold);
+            }
+          );
+          CodeMirror.defineExtension(
+            "selectMatches",
+            function (query, caseFold) {
+              var ranges = [];
+              var cur = this.getSearchCursor(
+                query,
+                this.getCursor("from"),
+                caseFold
+              );
+              while (cur.findNext()) {
+                if (CodeMirror.cmpPos(cur.to(), this.getCursor("to")) > 0)
+                  break;
+                ranges.push({ anchor: cur.from(), head: cur.to() });
+              }
+              if (ranges.length) this.setSelections(ranges, 0);
+            }
+          );
+        });
+      })();
+      var searchcursor = searchcursor$2.exports;
+      var searchcursor$1 = /* @__PURE__ */ Object.freeze(
+        /* @__PURE__ */ _mergeNamespaces(
+          {
+            __proto__: null,
+            [Symbol.toStringTag]: "Module",
+            default: searchcursor,
+          },
+          [searchcursor$2.exports]
+        )
+      );
+      var jumpToLine$2 = { exports: {} };
+      var dialog$2 = { exports: {} };
+      (function (module2, exports) {
+        (function (mod) {
+          mod(codemirror$2.exports);
+        })(function (CodeMirror) {
+          function dialogDiv(cm, template, bottom2) {
+            var wrap2 = cm.getWrapperElement();
+            var dialog2;
+            dialog2 = wrap2.appendChild(document.createElement("div"));
+            if (bottom2)
+              dialog2.className = "CodeMirror-dialog CodeMirror-dialog-bottom";
+            else dialog2.className = "CodeMirror-dialog CodeMirror-dialog-top";
+            if (typeof template == "string") {
+              dialog2.innerHTML = template;
+            } else {
+              dialog2.appendChild(template);
+            }
+            CodeMirror.addClass(wrap2, "dialog-opened");
+            return dialog2;
+          }
+          function closeNotification(cm, newVal) {
+            if (cm.state.currentNotificationClose)
+              cm.state.currentNotificationClose();
+            cm.state.currentNotificationClose = newVal;
+          }
+          CodeMirror.defineExtension(
+            "openDialog",
+            function (template, callback, options) {
+              if (!options) options = {};
+              closeNotification(this, null);
+              var dialog2 = dialogDiv(this, template, options.bottom);
+              var closed = false,
+                me2 = this;
+              function close(newVal) {
+                if (typeof newVal == "string") {
+                  inp.value = newVal;
+                } else {
+                  if (closed) return;
+                  closed = true;
+                  CodeMirror.rmClass(dialog2.parentNode, "dialog-opened");
+                  dialog2.parentNode.removeChild(dialog2);
+                  me2.focus();
+                  if (options.onClose) options.onClose(dialog2);
+                }
+              }
+              var inp = dialog2.getElementsByTagName("input")[0],
+                button;
+              if (inp) {
+                inp.focus();
+                if (options.value) {
+                  inp.value = options.value;
+                  if (options.selectValueOnOpen !== false) {
+                    inp.select();
+                  }
+                }
+                if (options.onInput)
+                  CodeMirror.on(inp, "input", function (e) {
+                    options.onInput(e, inp.value, close);
+                  });
+                if (options.onKeyUp)
+                  CodeMirror.on(inp, "keyup", function (e) {
+                    options.onKeyUp(e, inp.value, close);
+                  });
+                CodeMirror.on(inp, "keydown", function (e) {
+                  if (
+                    options &&
+                    options.onKeyDown &&
+                    options.onKeyDown(e, inp.value, close)
+                  ) {
+                    return;
+                  }
+                  if (
+                    e.keyCode == 27 ||
+                    (options.closeOnEnter !== false && e.keyCode == 13)
+                  ) {
+                    inp.blur();
+                    CodeMirror.e_stop(e);
+                    close();
+                  }
+                  if (e.keyCode == 13) callback(inp.value, e);
+                });
+                if (options.closeOnBlur !== false)
+                  CodeMirror.on(dialog2, "focusout", function (evt) {
+                    if (evt.relatedTarget !== null) close();
+                  });
+              } else if ((button = dialog2.getElementsByTagName("button")[0])) {
+                CodeMirror.on(button, "click", function () {
+                  close();
+                  me2.focus();
+                });
+                if (options.closeOnBlur !== false)
+                  CodeMirror.on(button, "blur", close);
+                button.focus();
+              }
+              return close;
+            }
+          );
+          CodeMirror.defineExtension(
+            "openConfirm",
+            function (template, callbacks, options) {
+              closeNotification(this, null);
+              var dialog2 = dialogDiv(
+                this,
+                template,
+                options && options.bottom
+              );
+              var buttons = dialog2.getElementsByTagName("button");
+              var closed = false,
+                me2 = this,
+                blurring = 1;
+              function close() {
+                if (closed) return;
+                closed = true;
+                CodeMirror.rmClass(dialog2.parentNode, "dialog-opened");
+                dialog2.parentNode.removeChild(dialog2);
+                me2.focus();
+              }
+              buttons[0].focus();
+              for (var i = 0; i < buttons.length; ++i) {
+                var b = buttons[i];
+                (function (callback) {
+                  CodeMirror.on(b, "click", function (e) {
+                    CodeMirror.e_preventDefault(e);
+                    close();
+                    if (callback) callback(me2);
+                  });
+                })(callbacks[i]);
+                CodeMirror.on(b, "blur", function () {
+                  --blurring;
+                  setTimeout(function () {
+                    if (blurring <= 0) close();
+                  }, 200);
+                });
+                CodeMirror.on(b, "focus", function () {
+                  ++blurring;
+                });
+              }
+            }
+          );
+          CodeMirror.defineExtension(
+            "openNotification",
+            function (template, options) {
+              closeNotification(this, close);
+              var dialog2 = dialogDiv(
+                this,
+                template,
+                options && options.bottom
+              );
+              var closed = false,
+                doneTimer;
+              var duration =
+                options && typeof options.duration !== "undefined"
+                  ? options.duration
+                  : 5e3;
+              function close() {
+                if (closed) return;
+                closed = true;
+                clearTimeout(doneTimer);
+                CodeMirror.rmClass(dialog2.parentNode, "dialog-opened");
+                dialog2.parentNode.removeChild(dialog2);
+              }
+              CodeMirror.on(dialog2, "click", function (e) {
+                CodeMirror.e_preventDefault(e);
+                close();
+              });
+              if (duration) doneTimer = setTimeout(close, duration);
+              return close;
+            }
+          );
+        });
+      })();
+      var dialog = dialog$2.exports;
+      var dialog$1 = /* @__PURE__ */ Object.freeze(
+        /* @__PURE__ */ _mergeNamespaces(
+          {
+            __proto__: null,
+            [Symbol.toStringTag]: "Module",
+            default: dialog,
+          },
+          [dialog$2.exports]
+        )
+      );
+      (function (module2, exports) {
+        (function (mod) {
+          mod(codemirror$2.exports, dialog$2.exports);
+        })(function (CodeMirror) {
+          CodeMirror.defineOption("search", { bottom: false });
+          function dialog2(cm, text3, shortText, deflt, f) {
+            if (cm.openDialog)
+              cm.openDialog(text3, f, {
+                value: deflt,
+                selectValueOnOpen: true,
+                bottom: cm.options.search.bottom,
+              });
+            else f(prompt(shortText, deflt));
+          }
+          function getJumpDialog(cm) {
+            return (
+              cm.phrase("Jump to line:") +
+              ' <input type="text" style="width: 10em" class="CodeMirror-search-field"/> <span style="color: #888" class="CodeMirror-search-hint">' +
+              cm.phrase("(Use line:column or scroll% syntax)") +
+              "</span>"
+            );
+          }
+          function interpretLine(cm, string2) {
+            var num2 = Number(string2);
+            if (/^[-+]/.test(string2)) return cm.getCursor().line + num2;
+            else return num2 - 1;
+          }
+          CodeMirror.commands.jumpToLine = function (cm) {
+            var cur = cm.getCursor();
+            dialog2(
+              cm,
+              getJumpDialog(cm),
+              cm.phrase("Jump to line:"),
+              cur.line + 1 + ":" + cur.ch,
+              function (posStr) {
+                if (!posStr) return;
+                var match2;
+                if (
+                  (match2 = /^\s*([\+\-]?\d+)\s*\:\s*(\d+)\s*$/.exec(posStr))
+                ) {
+                  cm.setCursor(interpretLine(cm, match2[1]), Number(match2[2]));
+                } else if (
+                  (match2 = /^\s*([\+\-]?\d+(\.\d+)?)\%\s*/.exec(posStr))
+                ) {
+                  var line = Math.round(
+                    (cm.lineCount() * Number(match2[1])) / 100
+                  );
+                  if (/^[-+]/.test(match2[1])) line = cur.line + line + 1;
+                  cm.setCursor(line - 1, cur.ch);
+                } else if (
+                  (match2 = /^\s*\:?\s*([\+\-]?\d+)\s*/.exec(posStr))
+                ) {
+                  cm.setCursor(interpretLine(cm, match2[1]), cur.ch);
+                }
+              }
+            );
+          };
+          CodeMirror.keyMap["default"]["Alt-G"] = "jumpToLine";
+        });
+      })();
+      var jumpToLine = jumpToLine$2.exports;
+      var jumpToLine$1 = /* @__PURE__ */ Object.freeze(
+        /* @__PURE__ */ _mergeNamespaces(
+          {
+            __proto__: null,
+            [Symbol.toStringTag]: "Module",
+            default: jumpToLine,
+          },
+          [jumpToLine$2.exports]
+        )
+      );
+      var sublime$2 = { exports: {} };
+      (function (module2, exports) {
+        (function (mod) {
+          mod(
+            codemirror$2.exports,
+            searchcursor$2.exports,
+            matchbrackets$2.exports
+          );
+        })(function (CodeMirror) {
+          var cmds = CodeMirror.commands;
+          var Pos = CodeMirror.Pos;
+          function findPosSubword(doc, start2, dir) {
+            if (dir < 0 && start2.ch == 0)
+              return doc.clipPos(Pos(start2.line - 1));
+            var line = doc.getLine(start2.line);
+            if (dir > 0 && start2.ch >= line.length)
+              return doc.clipPos(Pos(start2.line + 1, 0));
+            var state = "start",
+              type2,
+              startPos = start2.ch;
+            for (
+              var pos = startPos, e = dir < 0 ? 0 : line.length, i = 0;
+              pos != e;
+              pos += dir, i++
+            ) {
+              var next = line.charAt(dir < 0 ? pos - 1 : pos);
+              var cat = next != "_" && CodeMirror.isWordChar(next) ? "w" : "o";
+              if (cat == "w" && next.toUpperCase() == next) cat = "W";
+              if (state == "start") {
+                if (cat != "o") {
+                  state = "in";
+                  type2 = cat;
+                } else startPos = pos + dir;
+              } else if (state == "in") {
+                if (type2 != cat) {
+                  if (type2 == "w" && cat == "W" && dir < 0) pos--;
+                  if (type2 == "W" && cat == "w" && dir > 0) {
+                    if (pos == startPos + 1) {
+                      type2 = "w";
+                      continue;
+                    } else pos--;
+                  }
+                  break;
+                }
+              }
+            }
+            return Pos(start2.line, pos);
+          }
+          function moveSubword(cm, dir) {
+            cm.extendSelectionsBy(function (range2) {
+              if (cm.display.shift || cm.doc.extend || range2.empty())
+                return findPosSubword(cm.doc, range2.head, dir);
+              else return dir < 0 ? range2.from() : range2.to();
+            });
+          }
+          cmds.goSubwordLeft = function (cm) {
+            moveSubword(cm, -1);
+          };
+          cmds.goSubwordRight = function (cm) {
+            moveSubword(cm, 1);
+          };
+          cmds.scrollLineUp = function (cm) {
+            var info2 = cm.getScrollInfo();
+            if (!cm.somethingSelected()) {
+              var visibleBottomLine = cm.lineAtHeight(
+                info2.top + info2.clientHeight,
+                "local"
+              );
+              if (cm.getCursor().line >= visibleBottomLine)
+                cm.execCommand("goLineUp");
+            }
+            cm.scrollTo(null, info2.top - cm.defaultTextHeight());
+          };
+          cmds.scrollLineDown = function (cm) {
+            var info2 = cm.getScrollInfo();
+            if (!cm.somethingSelected()) {
+              var visibleTopLine = cm.lineAtHeight(info2.top, "local") + 1;
+              if (cm.getCursor().line <= visibleTopLine)
+                cm.execCommand("goLineDown");
+            }
+            cm.scrollTo(null, info2.top + cm.defaultTextHeight());
+          };
+          cmds.splitSelectionByLine = function (cm) {
+            var ranges = cm.listSelections(),
+              lineRanges = [];
+            for (var i = 0; i < ranges.length; i++) {
+              var from = ranges[i].from(),
+                to = ranges[i].to();
+              for (var line = from.line; line <= to.line; ++line)
+                if (!(to.line > from.line && line == to.line && to.ch == 0))
+                  lineRanges.push({
+                    anchor: line == from.line ? from : Pos(line, 0),
+                    head: line == to.line ? to : Pos(line),
+                  });
+            }
+            cm.setSelections(lineRanges, 0);
+          };
+          cmds.singleSelectionTop = function (cm) {
+            var range2 = cm.listSelections()[0];
+            cm.setSelection(range2.anchor, range2.head, { scroll: false });
+          };
+          cmds.selectLine = function (cm) {
+            var ranges = cm.listSelections(),
+              extended = [];
+            for (var i = 0; i < ranges.length; i++) {
+              var range2 = ranges[i];
+              extended.push({
+                anchor: Pos(range2.from().line, 0),
+                head: Pos(range2.to().line + 1, 0),
+              });
+            }
+            cm.setSelections(extended);
+          };
+          function insertLine(cm, above) {
+            if (cm.isReadOnly()) return CodeMirror.Pass;
+            cm.operation(function () {
+              var len = cm.listSelections().length,
+                newSelection = [],
+                last = -1;
+              for (var i = 0; i < len; i++) {
+                var head = cm.listSelections()[i].head;
+                if (head.line <= last) continue;
+                var at = Pos(head.line + (above ? 0 : 1), 0);
+                cm.replaceRange("\n", at, null, "+insertLine");
+                cm.indentLine(at.line, null, true);
+                newSelection.push({ head: at, anchor: at });
+                last = head.line + 1;
+              }
+              cm.setSelections(newSelection);
+            });
+            cm.execCommand("indentAuto");
+          }
+          cmds.insertLineAfter = function (cm) {
+            return insertLine(cm, false);
+          };
+          cmds.insertLineBefore = function (cm) {
+            return insertLine(cm, true);
+          };
+          function wordAt(cm, pos) {
+            var start2 = pos.ch,
+              end2 = start2,
+              line = cm.getLine(pos.line);
+            while (start2 && CodeMirror.isWordChar(line.charAt(start2 - 1)))
+              --start2;
+            while (
+              end2 < line.length &&
+              CodeMirror.isWordChar(line.charAt(end2))
+            )
+              ++end2;
+            return {
+              from: Pos(pos.line, start2),
+              to: Pos(pos.line, end2),
+              word: line.slice(start2, end2),
+            };
+          }
+          cmds.selectNextOccurrence = function (cm) {
+            var from = cm.getCursor("from"),
+              to = cm.getCursor("to");
+            var fullWord = cm.state.sublimeFindFullWord == cm.doc.sel;
+            if (CodeMirror.cmpPos(from, to) == 0) {
+              var word2 = wordAt(cm, from);
+              if (!word2.word) return;
+              cm.setSelection(word2.from, word2.to);
+              fullWord = true;
+            } else {
+              var text3 = cm.getRange(from, to);
+              var query = fullWord ? new RegExp("\\b" + text3 + "\\b") : text3;
+              var cur = cm.getSearchCursor(query, to);
+              var found = cur.findNext();
+              if (!found) {
+                cur = cm.getSearchCursor(query, Pos(cm.firstLine(), 0));
+                found = cur.findNext();
+              }
+              if (
+                !found ||
+                isSelectedRange(cm.listSelections(), cur.from(), cur.to())
+              )
+                return;
+              cm.addSelection(cur.from(), cur.to());
+            }
+            if (fullWord) cm.state.sublimeFindFullWord = cm.doc.sel;
+          };
+          cmds.skipAndSelectNextOccurrence = function (cm) {
+            var prevAnchor = cm.getCursor("anchor"),
+              prevHead = cm.getCursor("head");
+            cmds.selectNextOccurrence(cm);
+            if (CodeMirror.cmpPos(prevAnchor, prevHead) != 0) {
+              cm.doc.setSelections(
+                cm.doc.listSelections().filter(function (sel) {
+                  return sel.anchor != prevAnchor || sel.head != prevHead;
+                })
+              );
+            }
+          };
+          function addCursorToSelection(cm, dir) {
+            var ranges = cm.listSelections(),
+              newRanges = [];
+            for (var i = 0; i < ranges.length; i++) {
+              var range2 = ranges[i];
+              var newAnchor = cm.findPosV(
+                range2.anchor,
+                dir,
+                "line",
+                range2.anchor.goalColumn
+              );
+              var newHead = cm.findPosV(
+                range2.head,
+                dir,
+                "line",
+                range2.head.goalColumn
+              );
+              newAnchor.goalColumn =
+                range2.anchor.goalColumn != null
+                  ? range2.anchor.goalColumn
+                  : cm.cursorCoords(range2.anchor, "div").left;
+              newHead.goalColumn =
+                range2.head.goalColumn != null
+                  ? range2.head.goalColumn
+                  : cm.cursorCoords(range2.head, "div").left;
+              var newRange = { anchor: newAnchor, head: newHead };
+              newRanges.push(range2);
+              newRanges.push(newRange);
+            }
+            cm.setSelections(newRanges);
+          }
+          cmds.addCursorToPrevLine = function (cm) {
+            addCursorToSelection(cm, -1);
+          };
+          cmds.addCursorToNextLine = function (cm) {
+            addCursorToSelection(cm, 1);
+          };
+          function isSelectedRange(ranges, from, to) {
+            for (var i = 0; i < ranges.length; i++)
+              if (
+                CodeMirror.cmpPos(ranges[i].from(), from) == 0 &&
+                CodeMirror.cmpPos(ranges[i].to(), to) == 0
+              )
+                return true;
+            return false;
+          }
+          var mirror = "(){}[]";
+          function selectBetweenBrackets(cm) {
+            var ranges = cm.listSelections(),
+              newRanges = [];
+            for (var i = 0; i < ranges.length; i++) {
+              var range2 = ranges[i],
+                pos = range2.head,
+                opening = cm.scanForBracket(pos, -1);
+              if (!opening) return false;
+              for (;;) {
+                var closing = cm.scanForBracket(pos, 1);
+                if (!closing) return false;
+                if (
+                  closing.ch == mirror.charAt(mirror.indexOf(opening.ch) + 1)
+                ) {
+                  var startPos = Pos(opening.pos.line, opening.pos.ch + 1);
+                  if (
+                    CodeMirror.cmpPos(startPos, range2.from()) == 0 &&
+                    CodeMirror.cmpPos(closing.pos, range2.to()) == 0
+                  ) {
+                    opening = cm.scanForBracket(opening.pos, -1);
+                    if (!opening) return false;
+                  } else {
+                    newRanges.push({ anchor: startPos, head: closing.pos });
+                    break;
+                  }
+                }
+                pos = Pos(closing.pos.line, closing.pos.ch + 1);
+              }
+            }
+            cm.setSelections(newRanges);
+            return true;
+          }
+          cmds.selectScope = function (cm) {
+            selectBetweenBrackets(cm) || cm.execCommand("selectAll");
+          };
+          cmds.selectBetweenBrackets = function (cm) {
+            if (!selectBetweenBrackets(cm)) return CodeMirror.Pass;
+          };
+          function puncType(type2) {
+            return !type2
+              ? null
+              : /\bpunctuation\b/.test(type2)
+              ? type2
+              : void 0;
+          }
+          cmds.goToBracket = function (cm) {
+            cm.extendSelectionsBy(function (range2) {
+              var next = cm.scanForBracket(
+                range2.head,
+                1,
+                puncType(cm.getTokenTypeAt(range2.head))
+              );
+              if (next && CodeMirror.cmpPos(next.pos, range2.head) != 0)
+                return next.pos;
+              var prev = cm.scanForBracket(
+                range2.head,
+                -1,
+                puncType(
+                  cm.getTokenTypeAt(Pos(range2.head.line, range2.head.ch + 1))
+                )
+              );
+              return (
+                (prev && Pos(prev.pos.line, prev.pos.ch + 1)) || range2.head
+              );
+            });
+          };
+          cmds.swapLineUp = function (cm) {
+            if (cm.isReadOnly()) return CodeMirror.Pass;
+            var ranges = cm.listSelections(),
+              linesToMove = [],
+              at = cm.firstLine() - 1,
+              newSels = [];
+            for (var i = 0; i < ranges.length; i++) {
+              var range2 = ranges[i],
+                from = range2.from().line - 1,
+                to = range2.to().line;
+              newSels.push({
+                anchor: Pos(range2.anchor.line - 1, range2.anchor.ch),
+                head: Pos(range2.head.line - 1, range2.head.ch),
+              });
+              if (range2.to().ch == 0 && !range2.empty()) --to;
+              if (from > at) linesToMove.push(from, to);
+              else if (linesToMove.length)
+                linesToMove[linesToMove.length - 1] = to;
+              at = to;
+            }
+            cm.operation(function () {
+              for (var i2 = 0; i2 < linesToMove.length; i2 += 2) {
+                var from2 = linesToMove[i2],
+                  to2 = linesToMove[i2 + 1];
+                var line = cm.getLine(from2);
+                cm.replaceRange(
+                  "",
+                  Pos(from2, 0),
+                  Pos(from2 + 1, 0),
+                  "+swapLine"
+                );
+                if (to2 > cm.lastLine())
+                  cm.replaceRange(
+                    "\n" + line,
+                    Pos(cm.lastLine()),
+                    null,
+                    "+swapLine"
+                  );
+                else
+                  cm.replaceRange(line + "\n", Pos(to2, 0), null, "+swapLine");
+              }
+              cm.setSelections(newSels);
+              cm.scrollIntoView();
+            });
+          };
+          cmds.swapLineDown = function (cm) {
+            if (cm.isReadOnly()) return CodeMirror.Pass;
+            var ranges = cm.listSelections(),
+              linesToMove = [],
+              at = cm.lastLine() + 1;
+            for (var i = ranges.length - 1; i >= 0; i--) {
+              var range2 = ranges[i],
+                from = range2.to().line + 1,
+                to = range2.from().line;
+              if (range2.to().ch == 0 && !range2.empty()) from--;
+              if (from < at) linesToMove.push(from, to);
+              else if (linesToMove.length)
+                linesToMove[linesToMove.length - 1] = to;
+              at = to;
+            }
+            cm.operation(function () {
+              for (var i2 = linesToMove.length - 2; i2 >= 0; i2 -= 2) {
+                var from2 = linesToMove[i2],
+                  to2 = linesToMove[i2 + 1];
+                var line = cm.getLine(from2);
+                if (from2 == cm.lastLine())
+                  cm.replaceRange("", Pos(from2 - 1), Pos(from2), "+swapLine");
+                else
+                  cm.replaceRange(
+                    "",
+                    Pos(from2, 0),
+                    Pos(from2 + 1, 0),
+                    "+swapLine"
+                  );
+                cm.replaceRange(line + "\n", Pos(to2, 0), null, "+swapLine");
+              }
+              cm.scrollIntoView();
+            });
+          };
+          cmds.toggleCommentIndented = function (cm) {
+            cm.toggleComment({ indent: true });
+          };
+          cmds.joinLines = function (cm) {
+            var ranges = cm.listSelections(),
+              joined = [];
+            for (var i = 0; i < ranges.length; i++) {
+              var range2 = ranges[i],
+                from = range2.from();
+              var start2 = from.line,
+                end2 = range2.to().line;
+              while (i < ranges.length - 1 && ranges[i + 1].from().line == end2)
+                end2 = ranges[++i].to().line;
+              joined.push({
+                start: start2,
+                end: end2,
+                anchor: !range2.empty() && from,
+              });
+            }
+            cm.operation(function () {
+              var offset = 0,
+                ranges2 = [];
+              for (var i2 = 0; i2 < joined.length; i2++) {
+                var obj = joined[i2];
+                var anchor =
+                    obj.anchor && Pos(obj.anchor.line - offset, obj.anchor.ch),
+                  head;
+                for (var line = obj.start; line <= obj.end; line++) {
+                  var actual = line - offset;
+                  if (line == obj.end)
+                    head = Pos(actual, cm.getLine(actual).length + 1);
+                  if (actual < cm.lastLine()) {
+                    cm.replaceRange(
+                      " ",
+                      Pos(actual),
+                      Pos(
+                        actual + 1,
+                        /^\s*/.exec(cm.getLine(actual + 1))[0].length
+                      )
+                    );
+                    ++offset;
+                  }
+                }
+                ranges2.push({ anchor: anchor || head, head });
+              }
+              cm.setSelections(ranges2, 0);
+            });
+          };
+          cmds.duplicateLine = function (cm) {
+            cm.operation(function () {
+              var rangeCount = cm.listSelections().length;
+              for (var i = 0; i < rangeCount; i++) {
+                var range2 = cm.listSelections()[i];
+                if (range2.empty())
+                  cm.replaceRange(
+                    cm.getLine(range2.head.line) + "\n",
+                    Pos(range2.head.line, 0)
+                  );
+                else
+                  cm.replaceRange(
+                    cm.getRange(range2.from(), range2.to()),
+                    range2.from()
+                  );
+              }
+              cm.scrollIntoView();
+            });
+          };
+          function sortLines(cm, caseSensitive, direction) {
+            if (cm.isReadOnly()) return CodeMirror.Pass;
+            var ranges = cm.listSelections(),
+              toSort = [],
+              selected;
+            for (var i = 0; i < ranges.length; i++) {
+              var range2 = ranges[i];
+              if (range2.empty()) continue;
+              var from = range2.from().line,
+                to = range2.to().line;
+              while (i < ranges.length - 1 && ranges[i + 1].from().line == to)
+                to = ranges[++i].to().line;
+              if (!ranges[i].to().ch) to--;
+              toSort.push(from, to);
+            }
+            if (toSort.length) selected = true;
+            else toSort.push(cm.firstLine(), cm.lastLine());
+            cm.operation(function () {
+              var ranges2 = [];
+              for (var i2 = 0; i2 < toSort.length; i2 += 2) {
+                var from2 = toSort[i2],
+                  to2 = toSort[i2 + 1];
+                var start2 = Pos(from2, 0),
+                  end2 = Pos(to2);
+                var lines = cm.getRange(start2, end2, false);
+                if (caseSensitive)
+                  lines.sort(function (a, b) {
+                    return a < b ? -direction : a == b ? 0 : direction;
+                  });
+                else
+                  lines.sort(function (a, b) {
+                    var au = a.toUpperCase(),
+                      bu = b.toUpperCase();
+                    if (au != bu) {
+                      a = au;
+                      b = bu;
+                    }
+                    return a < b ? -direction : a == b ? 0 : direction;
+                  });
+                cm.replaceRange(lines, start2, end2);
+                if (selected)
+                  ranges2.push({ anchor: start2, head: Pos(to2 + 1, 0) });
+              }
+              if (selected) cm.setSelections(ranges2, 0);
+            });
+          }
+          cmds.sortLines = function (cm) {
+            sortLines(cm, true, 1);
+          };
+          cmds.reverseSortLines = function (cm) {
+            sortLines(cm, true, -1);
+          };
+          cmds.sortLinesInsensitive = function (cm) {
+            sortLines(cm, false, 1);
+          };
+          cmds.reverseSortLinesInsensitive = function (cm) {
+            sortLines(cm, false, -1);
+          };
+          cmds.nextBookmark = function (cm) {
+            var marks = cm.state.sublimeBookmarks;
+            if (marks)
+              while (marks.length) {
+                var current = marks.shift();
+                var found = current.find();
+                if (found) {
+                  marks.push(current);
+                  return cm.setSelection(found.from, found.to);
+                }
+              }
+          };
+          cmds.prevBookmark = function (cm) {
+            var marks = cm.state.sublimeBookmarks;
+            if (marks)
+              while (marks.length) {
+                marks.unshift(marks.pop());
+                var found = marks[marks.length - 1].find();
+                if (!found) marks.pop();
+                else return cm.setSelection(found.from, found.to);
+              }
+          };
+          cmds.toggleBookmark = function (cm) {
+            var ranges = cm.listSelections();
+            var marks =
+              cm.state.sublimeBookmarks || (cm.state.sublimeBookmarks = []);
+            for (var i = 0; i < ranges.length; i++) {
+              var from = ranges[i].from(),
+                to = ranges[i].to();
+              var found = ranges[i].empty()
+                ? cm.findMarksAt(from)
+                : cm.findMarks(from, to);
+              for (var j = 0; j < found.length; j++) {
+                if (found[j].sublimeBookmark) {
+                  found[j].clear();
+                  for (var k = 0; k < marks.length; k++)
+                    if (marks[k] == found[j]) marks.splice(k--, 1);
+                  break;
+                }
+              }
+              if (j == found.length)
+                marks.push(
+                  cm.markText(from, to, {
+                    sublimeBookmark: true,
+                    clearWhenEmpty: false,
+                  })
+                );
+            }
+          };
+          cmds.clearBookmarks = function (cm) {
+            var marks = cm.state.sublimeBookmarks;
+            if (marks) for (var i = 0; i < marks.length; i++) marks[i].clear();
+            marks.length = 0;
+          };
+          cmds.selectBookmarks = function (cm) {
+            var marks = cm.state.sublimeBookmarks,
+              ranges = [];
+            if (marks)
+              for (var i = 0; i < marks.length; i++) {
+                var found = marks[i].find();
+                if (!found) marks.splice(i--, 0);
+                else ranges.push({ anchor: found.from, head: found.to });
+              }
+            if (ranges.length) cm.setSelections(ranges, 0);
+          };
+          function modifyWordOrSelection(cm, mod) {
+            cm.operation(function () {
+              var ranges = cm.listSelections(),
+                indices = [],
+                replacements2 = [];
+              for (var i = 0; i < ranges.length; i++) {
+                var range2 = ranges[i];
+                if (range2.empty()) {
+                  indices.push(i);
+                  replacements2.push("");
+                } else
+                  replacements2.push(
+                    mod(cm.getRange(range2.from(), range2.to()))
+                  );
+              }
+              cm.replaceSelections(replacements2, "around", "case");
+              for (var i = indices.length - 1, at; i >= 0; i--) {
+                var range2 = ranges[indices[i]];
+                if (at && CodeMirror.cmpPos(range2.head, at) > 0) continue;
+                var word2 = wordAt(cm, range2.head);
+                at = word2.from;
+                cm.replaceRange(mod(word2.word), word2.from, word2.to);
+              }
+            });
+          }
+          cmds.smartBackspace = function (cm) {
+            if (cm.somethingSelected()) return CodeMirror.Pass;
+            cm.operation(function () {
+              var cursors = cm.listSelections();
+              var indentUnit = cm.getOption("indentUnit");
+              for (var i = cursors.length - 1; i >= 0; i--) {
+                var cursor = cursors[i].head;
+                var toStartOfLine = cm.getRange(
+                  { line: cursor.line, ch: 0 },
+                  cursor
+                );
+                var column = CodeMirror.countColumn(
+                  toStartOfLine,
+                  null,
+                  cm.getOption("tabSize")
+                );
+                var deletePos = cm.findPosH(cursor, -1, "char", false);
+                if (
+                  toStartOfLine &&
+                  !/\S/.test(toStartOfLine) &&
+                  column % indentUnit == 0
+                ) {
+                  var prevIndent = new Pos(
+                    cursor.line,
+                    CodeMirror.findColumn(
+                      toStartOfLine,
+                      column - indentUnit,
+                      indentUnit
+                    )
+                  );
+                  if (prevIndent.ch != cursor.ch) deletePos = prevIndent;
+                }
+                cm.replaceRange("", deletePos, cursor, "+delete");
+              }
+            });
+          };
+          cmds.delLineRight = function (cm) {
+            cm.operation(function () {
+              var ranges = cm.listSelections();
+              for (var i = ranges.length - 1; i >= 0; i--)
+                cm.replaceRange(
+                  "",
+                  ranges[i].anchor,
+                  Pos(ranges[i].to().line),
+                  "+delete"
+                );
+              cm.scrollIntoView();
+            });
+          };
+          cmds.upcaseAtCursor = function (cm) {
+            modifyWordOrSelection(cm, function (str) {
+              return str.toUpperCase();
+            });
+          };
+          cmds.downcaseAtCursor = function (cm) {
+            modifyWordOrSelection(cm, function (str) {
+              return str.toLowerCase();
+            });
+          };
+          cmds.setSublimeMark = function (cm) {
+            if (cm.state.sublimeMark) cm.state.sublimeMark.clear();
+            cm.state.sublimeMark = cm.setBookmark(cm.getCursor());
+          };
+          cmds.selectToSublimeMark = function (cm) {
+            var found = cm.state.sublimeMark && cm.state.sublimeMark.find();
+            if (found) cm.setSelection(cm.getCursor(), found);
+          };
+          cmds.deleteToSublimeMark = function (cm) {
+            var found = cm.state.sublimeMark && cm.state.sublimeMark.find();
+            if (found) {
+              var from = cm.getCursor(),
+                to = found;
+              if (CodeMirror.cmpPos(from, to) > 0) {
+                var tmp = to;
+                to = from;
+                from = tmp;
+              }
+              cm.state.sublimeKilled = cm.getRange(from, to);
+              cm.replaceRange("", from, to);
+            }
+          };
+          cmds.swapWithSublimeMark = function (cm) {
+            var found = cm.state.sublimeMark && cm.state.sublimeMark.find();
+            if (found) {
+              cm.state.sublimeMark.clear();
+              cm.state.sublimeMark = cm.setBookmark(cm.getCursor());
+              cm.setCursor(found);
+            }
+          };
+          cmds.sublimeYank = function (cm) {
+            if (cm.state.sublimeKilled != null)
+              cm.replaceSelection(cm.state.sublimeKilled, null, "paste");
+          };
+          cmds.showInCenter = function (cm) {
+            var pos = cm.cursorCoords(null, "local");
+            cm.scrollTo(
+              null,
+              (pos.top + pos.bottom) / 2 - cm.getScrollInfo().clientHeight / 2
+            );
+          };
+          function getTarget(cm) {
+            var from = cm.getCursor("from"),
+              to = cm.getCursor("to");
+            if (CodeMirror.cmpPos(from, to) == 0) {
+              var word2 = wordAt(cm, from);
+              if (!word2.word) return;
+              from = word2.from;
+              to = word2.to;
+            }
+            return { from, to, query: cm.getRange(from, to), word: word2 };
+          }
+          function findAndGoTo(cm, forward) {
+            var target2 = getTarget(cm);
+            if (!target2) return;
+            var query = target2.query;
+            var cur = cm.getSearchCursor(
+              query,
+              forward ? target2.to : target2.from
+            );
+            if (forward ? cur.findNext() : cur.findPrevious()) {
+              cm.setSelection(cur.from(), cur.to());
+            } else {
+              cur = cm.getSearchCursor(
+                query,
+                forward
+                  ? Pos(cm.firstLine(), 0)
+                  : cm.clipPos(Pos(cm.lastLine()))
+              );
+              if (forward ? cur.findNext() : cur.findPrevious())
+                cm.setSelection(cur.from(), cur.to());
+              else if (target2.word) cm.setSelection(target2.from, target2.to);
+            }
+          }
+          cmds.findUnder = function (cm) {
+            findAndGoTo(cm, true);
+          };
+          cmds.findUnderPrevious = function (cm) {
+            findAndGoTo(cm, false);
+          };
+          cmds.findAllUnder = function (cm) {
+            var target2 = getTarget(cm);
+            if (!target2) return;
+            var cur = cm.getSearchCursor(target2.query);
+            var matches = [];
+            var primaryIndex = -1;
+            while (cur.findNext()) {
+              matches.push({ anchor: cur.from(), head: cur.to() });
+              if (
+                cur.from().line <= target2.from.line &&
+                cur.from().ch <= target2.from.ch
+              )
+                primaryIndex++;
+            }
+            cm.setSelections(matches, primaryIndex);
+          };
+          var keyMap2 = CodeMirror.keyMap;
+          keyMap2.macSublime = {
+            "Cmd-Left": "goLineStartSmart",
+            "Shift-Tab": "indentLess",
+            "Shift-Ctrl-K": "deleteLine",
+            "Alt-Q": "wrapLines",
+            "Ctrl-Left": "goSubwordLeft",
+            "Ctrl-Right": "goSubwordRight",
+            "Ctrl-Alt-Up": "scrollLineUp",
+            "Ctrl-Alt-Down": "scrollLineDown",
+            "Cmd-L": "selectLine",
+            "Shift-Cmd-L": "splitSelectionByLine",
+            Esc: "singleSelectionTop",
+            "Cmd-Enter": "insertLineAfter",
+            "Shift-Cmd-Enter": "insertLineBefore",
+            "Cmd-D": "selectNextOccurrence",
+            "Shift-Cmd-Space": "selectScope",
+            "Shift-Cmd-M": "selectBetweenBrackets",
+            "Cmd-M": "goToBracket",
+            "Cmd-Ctrl-Up": "swapLineUp",
+            "Cmd-Ctrl-Down": "swapLineDown",
+            "Cmd-/": "toggleCommentIndented",
+            "Cmd-J": "joinLines",
+            "Shift-Cmd-D": "duplicateLine",
+            F5: "sortLines",
+            "Shift-F5": "reverseSortLines",
+            "Cmd-F5": "sortLinesInsensitive",
+            "Shift-Cmd-F5": "reverseSortLinesInsensitive",
+            F2: "nextBookmark",
+            "Shift-F2": "prevBookmark",
+            "Cmd-F2": "toggleBookmark",
+            "Shift-Cmd-F2": "clearBookmarks",
+            "Alt-F2": "selectBookmarks",
+            Backspace: "smartBackspace",
+            "Cmd-K Cmd-D": "skipAndSelectNextOccurrence",
+            "Cmd-K Cmd-K": "delLineRight",
+            "Cmd-K Cmd-U": "upcaseAtCursor",
+            "Cmd-K Cmd-L": "downcaseAtCursor",
+            "Cmd-K Cmd-Space": "setSublimeMark",
+            "Cmd-K Cmd-A": "selectToSublimeMark",
+            "Cmd-K Cmd-W": "deleteToSublimeMark",
+            "Cmd-K Cmd-X": "swapWithSublimeMark",
+            "Cmd-K Cmd-Y": "sublimeYank",
+            "Cmd-K Cmd-C": "showInCenter",
+            "Cmd-K Cmd-G": "clearBookmarks",
+            "Cmd-K Cmd-Backspace": "delLineLeft",
+            "Cmd-K Cmd-1": "foldAll",
+            "Cmd-K Cmd-0": "unfoldAll",
+            "Cmd-K Cmd-J": "unfoldAll",
+            "Ctrl-Shift-Up": "addCursorToPrevLine",
+            "Ctrl-Shift-Down": "addCursorToNextLine",
+            "Cmd-F3": "findUnder",
+            "Shift-Cmd-F3": "findUnderPrevious",
+            "Alt-F3": "findAllUnder",
+            "Shift-Cmd-[": "fold",
+            "Shift-Cmd-]": "unfold",
+            "Cmd-I": "findIncremental",
+            "Shift-Cmd-I": "findIncrementalReverse",
+            "Cmd-H": "replace",
+            F3: "findNext",
+            "Shift-F3": "findPrev",
+            fallthrough: "macDefault",
+          };
+          CodeMirror.normalizeKeyMap(keyMap2.macSublime);
+          keyMap2.pcSublime = {
+            "Shift-Tab": "indentLess",
+            "Shift-Ctrl-K": "deleteLine",
+            "Alt-Q": "wrapLines",
+            "Ctrl-T": "transposeChars",
+            "Alt-Left": "goSubwordLeft",
+            "Alt-Right": "goSubwordRight",
+            "Ctrl-Up": "scrollLineUp",
+            "Ctrl-Down": "scrollLineDown",
+            "Ctrl-L": "selectLine",
+            "Shift-Ctrl-L": "splitSelectionByLine",
+            Esc: "singleSelectionTop",
+            "Ctrl-Enter": "insertLineAfter",
+            "Shift-Ctrl-Enter": "insertLineBefore",
+            "Ctrl-D": "selectNextOccurrence",
+            "Shift-Ctrl-Space": "selectScope",
+            "Shift-Ctrl-M": "selectBetweenBrackets",
+            "Ctrl-M": "goToBracket",
+            "Shift-Ctrl-Up": "swapLineUp",
+            "Shift-Ctrl-Down": "swapLineDown",
+            "Ctrl-/": "toggleCommentIndented",
+            "Ctrl-J": "joinLines",
+            "Shift-Ctrl-D": "duplicateLine",
+            F9: "sortLines",
+            "Shift-F9": "reverseSortLines",
+            "Ctrl-F9": "sortLinesInsensitive",
+            "Shift-Ctrl-F9": "reverseSortLinesInsensitive",
+            F2: "nextBookmark",
+            "Shift-F2": "prevBookmark",
+            "Ctrl-F2": "toggleBookmark",
+            "Shift-Ctrl-F2": "clearBookmarks",
+            "Alt-F2": "selectBookmarks",
+            Backspace: "smartBackspace",
+            "Ctrl-K Ctrl-D": "skipAndSelectNextOccurrence",
+            "Ctrl-K Ctrl-K": "delLineRight",
+            "Ctrl-K Ctrl-U": "upcaseAtCursor",
+            "Ctrl-K Ctrl-L": "downcaseAtCursor",
+            "Ctrl-K Ctrl-Space": "setSublimeMark",
+            "Ctrl-K Ctrl-A": "selectToSublimeMark",
+            "Ctrl-K Ctrl-W": "deleteToSublimeMark",
+            "Ctrl-K Ctrl-X": "swapWithSublimeMark",
+            "Ctrl-K Ctrl-Y": "sublimeYank",
+            "Ctrl-K Ctrl-C": "showInCenter",
+            "Ctrl-K Ctrl-G": "clearBookmarks",
+            "Ctrl-K Ctrl-Backspace": "delLineLeft",
+            "Ctrl-K Ctrl-1": "foldAll",
+            "Ctrl-K Ctrl-0": "unfoldAll",
+            "Ctrl-K Ctrl-J": "unfoldAll",
+            "Ctrl-Alt-Up": "addCursorToPrevLine",
+            "Ctrl-Alt-Down": "addCursorToNextLine",
+            "Ctrl-F3": "findUnder",
+            "Shift-Ctrl-F3": "findUnderPrevious",
+            "Alt-F3": "findAllUnder",
+            "Shift-Ctrl-[": "fold",
+            "Shift-Ctrl-]": "unfold",
+            "Ctrl-I": "findIncremental",
+            "Shift-Ctrl-I": "findIncrementalReverse",
+            "Ctrl-H": "replace",
+            F3: "findNext",
+            "Shift-F3": "findPrev",
+            fallthrough: "pcDefault",
+          };
+          CodeMirror.normalizeKeyMap(keyMap2.pcSublime);
+          var mac = keyMap2.default == keyMap2.macDefault;
+          keyMap2.sublime = mac ? keyMap2.macSublime : keyMap2.pcSublime;
+        });
+      })();
+      var sublime = sublime$2.exports;
+      var sublime$1 = /* @__PURE__ */ Object.freeze(
+        /* @__PURE__ */ _mergeNamespaces(
+          {
+            __proto__: null,
+            [Symbol.toStringTag]: "Module",
+            default: sublime,
+          },
+          [sublime$2.exports]
+        )
+      );
+      var comment$2 = { exports: {} };
+      (function (module2, exports) {
+        (function (mod) {
+          mod(codemirror$2.exports);
+        })(function (CodeMirror) {
+          var noOptions = {};
+          var nonWS = /[^\s\u00a0]/;
+          var Pos = CodeMirror.Pos,
+            cmp = CodeMirror.cmpPos;
+          function firstNonWS(str) {
+            var found = str.search(nonWS);
+            return found == -1 ? 0 : found;
+          }
+          CodeMirror.commands.toggleComment = function (cm) {
+            cm.toggleComment();
+          };
+          CodeMirror.defineExtension("toggleComment", function (options) {
+            if (!options) options = noOptions;
+            var cm = this;
+            var minLine = Infinity,
+              ranges = this.listSelections(),
+              mode2 = null;
+            for (var i = ranges.length - 1; i >= 0; i--) {
+              var from = ranges[i].from(),
+                to = ranges[i].to();
+              if (from.line >= minLine) continue;
+              if (to.line >= minLine) to = Pos(minLine, 0);
+              minLine = from.line;
+              if (mode2 == null) {
+                if (cm.uncomment(from, to, options)) mode2 = "un";
+                else {
+                  cm.lineComment(from, to, options);
+                  mode2 = "line";
+                }
+              } else if (mode2 == "un") {
+                cm.uncomment(from, to, options);
+              } else {
+                cm.lineComment(from, to, options);
+              }
+            }
+          });
+          function probablyInsideString(cm, pos, line) {
+            return (
+              /\bstring\b/.test(cm.getTokenTypeAt(Pos(pos.line, 0))) &&
+              !/^[\'\"\`]/.test(line)
+            );
+          }
+          function getMode(cm, pos) {
+            var mode2 = cm.getMode();
+            return mode2.useInnerComments === false || !mode2.innerMode
+              ? mode2
+              : cm.getModeAt(pos);
+          }
+          CodeMirror.defineExtension(
+            "lineComment",
+            function (from, to, options) {
+              if (!options) options = noOptions;
+              var self2 = this,
+                mode2 = getMode(self2, from);
+              var firstLine = self2.getLine(from.line);
+              if (
+                firstLine == null ||
+                probablyInsideString(self2, from, firstLine)
+              )
+                return;
+              var commentString = options.lineComment || mode2.lineComment;
+              if (!commentString) {
+                if (options.blockCommentStart || mode2.blockCommentStart) {
+                  options.fullLines = true;
+                  self2.blockComment(from, to, options);
+                }
+                return;
+              }
+              var end2 = Math.min(
+                to.ch != 0 || to.line == from.line ? to.line + 1 : to.line,
+                self2.lastLine() + 1
+              );
+              var pad = options.padding == null ? " " : options.padding;
+              var blankLines =
+                options.commentBlankLines || from.line == to.line;
+              self2.operation(function () {
+                if (options.indent) {
+                  var baseString = null;
+                  for (var i = from.line; i < end2; ++i) {
+                    var line = self2.getLine(i);
+                    var whitespace = line.slice(0, firstNonWS(line));
+                    if (
+                      baseString == null ||
+                      baseString.length > whitespace.length
+                    ) {
+                      baseString = whitespace;
+                    }
+                  }
+                  for (var i = from.line; i < end2; ++i) {
+                    var line = self2.getLine(i),
+                      cut = baseString.length;
+                    if (!blankLines && !nonWS.test(line)) continue;
+                    if (line.slice(0, cut) != baseString)
+                      cut = firstNonWS(line);
+                    self2.replaceRange(
+                      baseString + commentString + pad,
+                      Pos(i, 0),
+                      Pos(i, cut)
+                    );
+                  }
+                } else {
+                  for (var i = from.line; i < end2; ++i) {
+                    if (blankLines || nonWS.test(self2.getLine(i)))
+                      self2.replaceRange(commentString + pad, Pos(i, 0));
+                  }
+                }
+              });
+            }
+          );
+          CodeMirror.defineExtension(
+            "blockComment",
+            function (from, to, options) {
+              if (!options) options = noOptions;
+              var self2 = this,
+                mode2 = getMode(self2, from);
+              var startString =
+                options.blockCommentStart || mode2.blockCommentStart;
+              var endString = options.blockCommentEnd || mode2.blockCommentEnd;
+              if (!startString || !endString) {
+                if (
+                  (options.lineComment || mode2.lineComment) &&
+                  options.fullLines != false
+                )
+                  self2.lineComment(from, to, options);
+                return;
+              }
+              if (/\bcomment\b/.test(self2.getTokenTypeAt(Pos(from.line, 0))))
+                return;
+              var end2 = Math.min(to.line, self2.lastLine());
+              if (
+                end2 != from.line &&
+                to.ch == 0 &&
+                nonWS.test(self2.getLine(end2))
+              )
+                --end2;
+              var pad = options.padding == null ? " " : options.padding;
+              if (from.line > end2) return;
+              self2.operation(function () {
+                if (options.fullLines != false) {
+                  var lastLineHasText = nonWS.test(self2.getLine(end2));
+                  self2.replaceRange(pad + endString, Pos(end2));
+                  self2.replaceRange(startString + pad, Pos(from.line, 0));
+                  var lead = options.blockCommentLead || mode2.blockCommentLead;
+                  if (lead != null) {
+                    for (var i = from.line + 1; i <= end2; ++i)
+                      if (i != end2 || lastLineHasText)
+                        self2.replaceRange(lead + pad, Pos(i, 0));
+                  }
+                } else {
+                  var atCursor = cmp(self2.getCursor("to"), to) == 0,
+                    empty2 = !self2.somethingSelected();
+                  self2.replaceRange(endString, to);
+                  if (atCursor)
+                    self2.setSelection(
+                      empty2 ? to : self2.getCursor("from"),
+                      to
+                    );
+                  self2.replaceRange(startString, from);
+                }
+              });
+            }
+          );
+          CodeMirror.defineExtension("uncomment", function (from, to, options) {
+            if (!options) options = noOptions;
+            var self2 = this,
+              mode2 = getMode(self2, from);
+            var end2 = Math.min(
+                to.ch != 0 || to.line == from.line ? to.line : to.line - 1,
+                self2.lastLine()
+              ),
+              start2 = Math.min(from.line, end2);
+            var lineString = options.lineComment || mode2.lineComment,
+              lines = [];
+            var pad = options.padding == null ? " " : options.padding,
+              didSomething;
+            lineComment: {
+              if (!lineString) break lineComment;
+              for (var i = start2; i <= end2; ++i) {
+                var line = self2.getLine(i);
+                var found = line.indexOf(lineString);
+                if (
+                  found > -1 &&
+                  !/comment/.test(self2.getTokenTypeAt(Pos(i, found + 1)))
+                )
+                  found = -1;
+                if (found == -1 && nonWS.test(line)) break lineComment;
+                if (found > -1 && nonWS.test(line.slice(0, found)))
+                  break lineComment;
+                lines.push(line);
+              }
+              self2.operation(function () {
+                for (var i2 = start2; i2 <= end2; ++i2) {
+                  var line2 = lines[i2 - start2];
+                  var pos = line2.indexOf(lineString),
+                    endPos = pos + lineString.length;
+                  if (pos < 0) continue;
+                  if (line2.slice(endPos, endPos + pad.length) == pad)
+                    endPos += pad.length;
+                  didSomething = true;
+                  self2.replaceRange("", Pos(i2, pos), Pos(i2, endPos));
+                }
+              });
+              if (didSomething) return true;
+            }
+            var startString =
+              options.blockCommentStart || mode2.blockCommentStart;
+            var endString = options.blockCommentEnd || mode2.blockCommentEnd;
+            if (!startString || !endString) return false;
+            var lead = options.blockCommentLead || mode2.blockCommentLead;
+            var startLine = self2.getLine(start2),
+              open = startLine.indexOf(startString);
+            if (open == -1) return false;
+            var endLine = end2 == start2 ? startLine : self2.getLine(end2);
+            var close = endLine.indexOf(
+              endString,
+              end2 == start2 ? open + startString.length : 0
+            );
+            var insideStart = Pos(start2, open + 1),
+              insideEnd = Pos(end2, close + 1);
+            if (
+              close == -1 ||
+              !/comment/.test(self2.getTokenTypeAt(insideStart)) ||
+              !/comment/.test(self2.getTokenTypeAt(insideEnd)) ||
+              self2.getRange(insideStart, insideEnd, "\n").indexOf(endString) >
+                -1
+            )
+              return false;
+            var lastStart = startLine.lastIndexOf(startString, from.ch);
+            var firstEnd =
+              lastStart == -1
+                ? -1
+                : startLine
+                    .slice(0, from.ch)
+                    .indexOf(endString, lastStart + startString.length);
+            if (
+              lastStart != -1 &&
+              firstEnd != -1 &&
+              firstEnd + endString.length != from.ch
+            )
+              return false;
+            firstEnd = endLine.indexOf(endString, to.ch);
+            var almostLastStart = endLine
+              .slice(to.ch)
+              .lastIndexOf(startString, firstEnd - to.ch);
+            lastStart =
+              firstEnd == -1 || almostLastStart == -1
+                ? -1
+                : to.ch + almostLastStart;
+            if (firstEnd != -1 && lastStart != -1 && lastStart != to.ch)
+              return false;
+            self2.operation(function () {
+              self2.replaceRange(
+                "",
+                Pos(
+                  end2,
+                  close -
+                    (pad && endLine.slice(close - pad.length, close) == pad
+                      ? pad.length
+                      : 0)
+                ),
+                Pos(end2, close + endString.length)
+              );
+              var openEnd = open + startString.length;
+              if (pad && startLine.slice(openEnd, openEnd + pad.length) == pad)
+                openEnd += pad.length;
+              self2.replaceRange("", Pos(start2, open), Pos(start2, openEnd));
+              if (lead)
+                for (var i2 = start2 + 1; i2 <= end2; ++i2) {
+                  var line2 = self2.getLine(i2),
+                    found2 = line2.indexOf(lead);
+                  if (found2 == -1 || nonWS.test(line2.slice(0, found2)))
+                    continue;
+                  var foundEnd = found2 + lead.length;
+                  if (
+                    pad &&
+                    line2.slice(foundEnd, foundEnd + pad.length) == pad
+                  )
+                    foundEnd += pad.length;
+                  self2.replaceRange("", Pos(i2, found2), Pos(i2, foundEnd));
+                }
+            });
+            return true;
+          });
+        });
+      })();
+      var comment = comment$2.exports;
+      var comment$1 = /* @__PURE__ */ Object.freeze(
+        /* @__PURE__ */ _mergeNamespaces(
+          {
+            __proto__: null,
+            [Symbol.toStringTag]: "Module",
+            default: comment,
+          },
+          [comment$2.exports]
+        )
+      );
+      var search$2 = { exports: {} };
+      (function (module2, exports) {
+        (function (mod) {
+          mod(codemirror$2.exports, searchcursor$2.exports, dialog$2.exports);
+        })(function (CodeMirror) {
+          CodeMirror.defineOption("search", { bottom: false });
+          function searchOverlay(query, caseInsensitive) {
+            if (typeof query == "string")
+              query = new RegExp(
+                query.replace(/[\-\[\]\/\{\}\(\)\*\+\?\.\\\^\$\|]/g, "\\$&"),
+                caseInsensitive ? "gi" : "g"
+              );
+            else if (!query.global)
+              query = new RegExp(query.source, query.ignoreCase ? "gi" : "g");
+            return {
+              token: function (stream) {
+                query.lastIndex = stream.pos;
+                var match2 = query.exec(stream.string);
+                if (match2 && match2.index == stream.pos) {
+                  stream.pos += match2[0].length || 1;
+                  return "searching";
+                } else if (match2) {
+                  stream.pos = match2.index;
+                } else {
+                  stream.skipToEnd();
+                }
+              },
+            };
+          }
+          function SearchState() {
+            this.posFrom = this.posTo = this.lastQuery = this.query = null;
+            this.overlay = null;
+          }
+          function getSearchState(cm) {
+            return cm.state.search || (cm.state.search = new SearchState());
+          }
+          function queryCaseInsensitive(query) {
+            return typeof query == "string" && query == query.toLowerCase();
+          }
+          function getSearchCursor(cm, query, pos) {
+            return cm.getSearchCursor(query, pos, {
+              caseFold: queryCaseInsensitive(query),
+              multiline: true,
+            });
+          }
+          function persistentDialog(cm, text3, deflt, onEnter, onKeyDown2) {
+            cm.openDialog(text3, onEnter, {
+              value: deflt,
+              selectValueOnOpen: true,
+              closeOnEnter: false,
+              onClose: function () {
+                clearSearch(cm);
+              },
+              onKeyDown: onKeyDown2,
+              bottom: cm.options.search.bottom,
+            });
+          }
+          function dialog2(cm, text3, shortText, deflt, f) {
+            if (cm.openDialog)
+              cm.openDialog(text3, f, {
+                value: deflt,
+                selectValueOnOpen: true,
+                bottom: cm.options.search.bottom,
+              });
+            else f(prompt(shortText, deflt));
+          }
+          function confirmDialog(cm, text3, shortText, fs) {
+            if (cm.openConfirm) cm.openConfirm(text3, fs);
+            else if (confirm(shortText)) fs[0]();
+          }
+          function parseString(string2) {
+            return string2.replace(/\\([nrt\\])/g, function (match2, ch2) {
+              if (ch2 == "n") return "\n";
+              if (ch2 == "r") return "\r";
+              if (ch2 == "t") return "	";
+              if (ch2 == "\\") return "\\";
+              return match2;
+            });
+          }
+          function parseQuery2(query) {
+            var isRE = query.match(/^\/(.*)\/([a-z]*)$/);
+            if (isRE) {
+              try {
+                query = new RegExp(
+                  isRE[1],
+                  isRE[2].indexOf("i") == -1 ? "" : "i"
+                );
+              } catch (e) {}
+            } else {
+              query = parseString(query);
+            }
+            if (typeof query == "string" ? query == "" : query.test(""))
+              query = /x^/;
+            return query;
+          }
+          function startSearch(cm, state, query) {
+            state.queryText = query;
+            state.query = parseQuery2(query);
+            cm.removeOverlay(state.overlay, queryCaseInsensitive(state.query));
+            state.overlay = searchOverlay(
+              state.query,
+              queryCaseInsensitive(state.query)
+            );
+            cm.addOverlay(state.overlay);
+            if (cm.showMatchesOnScrollbar) {
+              if (state.annotate) {
+                state.annotate.clear();
+                state.annotate = null;
+              }
+              state.annotate = cm.showMatchesOnScrollbar(
+                state.query,
+                queryCaseInsensitive(state.query)
+              );
+            }
+          }
+          function doSearch(cm, rev, persistent, immediate) {
+            var state = getSearchState(cm);
+            if (state.query) return findNext(cm, rev);
+            var q2 = cm.getSelection() || state.lastQuery;
+            if (q2 instanceof RegExp && q2.source == "x^") q2 = null;
+            if (persistent && cm.openDialog) {
+              var hiding = null;
+              var searchNext = function (query, event) {
+                CodeMirror.e_stop(event);
+                if (!query) return;
+                if (query != state.queryText) {
+                  startSearch(cm, state, query);
+                  state.posFrom = state.posTo = cm.getCursor();
+                }
+                if (hiding) hiding.style.opacity = 1;
+                findNext(cm, event.shiftKey, function (_, to) {
+                  var dialog3;
+                  if (
+                    to.line < 3 &&
+                    document.querySelector &&
+                    (dialog3 =
+                      cm.display.wrapper.querySelector(".CodeMirror-dialog")) &&
+                    dialog3.getBoundingClientRect().bottom - 4 >
+                      cm.cursorCoords(to, "window").top
+                  )
+                    (hiding = dialog3).style.opacity = 0.4;
+                });
+              };
+              persistentDialog(
+                cm,
+                getQueryDialog(cm),
+                q2,
+                searchNext,
+                function (event, query) {
+                  var keyName = CodeMirror.keyName(event);
+                  var extra = cm.getOption("extraKeys"),
+                    cmd =
+                      (extra && extra[keyName]) ||
+                      CodeMirror.keyMap[cm.getOption("keyMap")][keyName];
+                  if (
+                    cmd == "findNext" ||
+                    cmd == "findPrev" ||
+                    cmd == "findPersistentNext" ||
+                    cmd == "findPersistentPrev"
+                  ) {
+                    CodeMirror.e_stop(event);
+                    startSearch(cm, getSearchState(cm), query);
+                    cm.execCommand(cmd);
+                  } else if (cmd == "find" || cmd == "findPersistent") {
+                    CodeMirror.e_stop(event);
+                    searchNext(query, event);
+                  }
+                }
+              );
+              if (immediate && q2) {
+                startSearch(cm, state, q2);
+                findNext(cm, rev);
+              }
+            } else {
+              dialog2(
+                cm,
+                getQueryDialog(cm),
+                "Search for:",
+                q2,
+                function (query) {
+                  if (query && !state.query)
+                    cm.operation(function () {
+                      startSearch(cm, state, query);
+                      state.posFrom = state.posTo = cm.getCursor();
+                      findNext(cm, rev);
+                    });
+                }
+              );
+            }
+          }
+          function findNext(cm, rev, callback) {
+            cm.operation(function () {
+              var state = getSearchState(cm);
+              var cursor = getSearchCursor(
+                cm,
+                state.query,
+                rev ? state.posFrom : state.posTo
+              );
+              if (!cursor.find(rev)) {
+                cursor = getSearchCursor(
+                  cm,
+                  state.query,
+                  rev
+                    ? CodeMirror.Pos(cm.lastLine())
+                    : CodeMirror.Pos(cm.firstLine(), 0)
+                );
+                if (!cursor.find(rev)) return;
+              }
+              cm.setSelection(cursor.from(), cursor.to());
+              cm.scrollIntoView({ from: cursor.from(), to: cursor.to() }, 20);
+              state.posFrom = cursor.from();
+              state.posTo = cursor.to();
+              if (callback) callback(cursor.from(), cursor.to());
+            });
+          }
+          function clearSearch(cm) {
+            cm.operation(function () {
+              var state = getSearchState(cm);
+              state.lastQuery = state.query;
+              if (!state.query) return;
+              state.query = state.queryText = null;
+              cm.removeOverlay(state.overlay);
+              if (state.annotate) {
+                state.annotate.clear();
+                state.annotate = null;
+              }
+            });
+          }
+          function el2(tag, attrs) {
+            var element = tag
+              ? document.createElement(tag)
+              : document.createDocumentFragment();
+            for (var key in attrs) {
+              element[key] = attrs[key];
+            }
+            for (var i = 2; i < arguments.length; i++) {
+              var child = arguments[i];
+              element.appendChild(
+                typeof child == "string"
+                  ? document.createTextNode(child)
+                  : child
+              );
+            }
+            return element;
+          }
+          function getQueryDialog(cm) {
+            return el2(
+              "",
+              null,
+              el2(
+                "span",
+                { className: "CodeMirror-search-label" },
+                cm.phrase("Search:")
+              ),
+              " ",
+              el2("input", {
+                type: "text",
+                style: "width: 10em",
+                className: "CodeMirror-search-field",
+              }),
+              " ",
+              el2(
+                "span",
+                { style: "color: #888", className: "CodeMirror-search-hint" },
+                cm.phrase("(Use /re/ syntax for regexp search)")
+              )
+            );
+          }
+          function getReplaceQueryDialog(cm) {
+            return el2(
+              "",
+              null,
+              " ",
+              el2("input", {
+                type: "text",
+                style: "width: 10em",
+                className: "CodeMirror-search-field",
+              }),
+              " ",
+              el2(
+                "span",
+                { style: "color: #888", className: "CodeMirror-search-hint" },
+                cm.phrase("(Use /re/ syntax for regexp search)")
+              )
+            );
+          }
+          function getReplacementQueryDialog(cm) {
+            return el2(
+              "",
+              null,
+              el2(
+                "span",
+                { className: "CodeMirror-search-label" },
+                cm.phrase("With:")
+              ),
+              " ",
+              el2("input", {
+                type: "text",
+                style: "width: 10em",
+                className: "CodeMirror-search-field",
+              })
+            );
+          }
+          function getDoReplaceConfirm(cm) {
+            return el2(
+              "",
+              null,
+              el2(
+                "span",
+                { className: "CodeMirror-search-label" },
+                cm.phrase("Replace?")
+              ),
+              " ",
+              el2("button", {}, cm.phrase("Yes")),
+              " ",
+              el2("button", {}, cm.phrase("No")),
+              " ",
+              el2("button", {}, cm.phrase("All")),
+              " ",
+              el2("button", {}, cm.phrase("Stop"))
+            );
+          }
+          function replaceAll(cm, query, text3) {
+            cm.operation(function () {
+              for (
+                var cursor = getSearchCursor(cm, query);
+                cursor.findNext();
+
+              ) {
+                if (typeof query != "string") {
+                  var match2 = cm
+                    .getRange(cursor.from(), cursor.to())
+                    .match(query);
+                  cursor.replace(
+                    text3.replace(/\$(\d)/g, function (_, i) {
+                      return match2[i];
+                    })
+                  );
+                } else cursor.replace(text3);
+              }
+            });
+          }
+          function replace2(cm, all) {
+            if (cm.getOption("readOnly")) return;
+            var query = cm.getSelection() || getSearchState(cm).lastQuery;
+            var dialogText = all
+              ? cm.phrase("Replace all:")
+              : cm.phrase("Replace:");
+            var fragment = el2(
+              "",
+              null,
+              el2("span", { className: "CodeMirror-search-label" }, dialogText),
+              getReplaceQueryDialog(cm)
+            );
+            dialog2(cm, fragment, dialogText, query, function (query2) {
+              if (!query2) return;
+              query2 = parseQuery2(query2);
+              dialog2(
+                cm,
+                getReplacementQueryDialog(cm),
+                cm.phrase("Replace with:"),
+                "",
+                function (text3) {
+                  text3 = parseString(text3);
+                  if (all) {
+                    replaceAll(cm, query2, text3);
+                  } else {
+                    clearSearch(cm);
+                    var cursor = getSearchCursor(
+                      cm,
+                      query2,
+                      cm.getCursor("from")
+                    );
+                    var advance = function () {
+                      var start2 = cursor.from(),
+                        match2;
+                      if (!(match2 = cursor.findNext())) {
+                        cursor = getSearchCursor(cm, query2);
+                        if (
+                          !(match2 = cursor.findNext()) ||
+                          (start2 &&
+                            cursor.from().line == start2.line &&
+                            cursor.from().ch == start2.ch)
+                        )
+                          return;
+                      }
+                      cm.setSelection(cursor.from(), cursor.to());
+                      cm.scrollIntoView({
+                        from: cursor.from(),
+                        to: cursor.to(),
+                      });
+                      confirmDialog(
+                        cm,
+                        getDoReplaceConfirm(cm),
+                        cm.phrase("Replace?"),
+                        [
+                          function () {
+                            doReplace(match2);
+                          },
+                          advance,
+                          function () {
+                            replaceAll(cm, query2, text3);
+                          },
+                        ]
+                      );
+                    };
+                    var doReplace = function (match2) {
+                      cursor.replace(
+                        typeof query2 == "string"
+                          ? text3
+                          : text3.replace(/\$(\d)/g, function (_, i) {
+                              return match2[i];
+                            })
+                      );
+                      advance();
+                    };
+                    advance();
+                  }
+                }
+              );
+            });
+          }
+          CodeMirror.commands.find = function (cm) {
+            clearSearch(cm);
+            doSearch(cm);
+          };
+          CodeMirror.commands.findPersistent = function (cm) {
+            clearSearch(cm);
+            doSearch(cm, false, true);
+          };
+          CodeMirror.commands.findPersistentNext = function (cm) {
+            doSearch(cm, false, true, true);
+          };
+          CodeMirror.commands.findPersistentPrev = function (cm) {
+            doSearch(cm, true, true, true);
+          };
+          CodeMirror.commands.findNext = doSearch;
+          CodeMirror.commands.findPrev = function (cm) {
+            doSearch(cm, true);
+          };
+          CodeMirror.commands.clearSearch = clearSearch;
+          CodeMirror.commands.replace = replace2;
+          CodeMirror.commands.replaceAll = function (cm) {
+            replace2(cm, true);
+          };
+        });
+      })();
+      var search = search$2.exports;
+      var search$1 = /* @__PURE__ */ Object.freeze(
+        /* @__PURE__ */ _mergeNamespaces(
+          {
+            __proto__: null,
+            [Symbol.toStringTag]: "Module",
+            default: search,
+          },
+          [search$2.exports]
+        )
+      );
+      var hint$3 = {};
+      var require$$1$1 = /* @__PURE__ */ getAugmentedNamespace(esm);
+      var __importDefault$c =
+        (commonjsGlobal && commonjsGlobal.__importDefault) ||
+        function (mod) {
+          return mod && mod.__esModule ? mod : { default: mod };
+        };
+      Object.defineProperty(hint$3, "__esModule", { value: true });
+      var codemirror_1$a = __importDefault$c(codemirror$2.exports);
+      var graphql_language_service_1$4 = require$$1$1;
+      codemirror_1$a.default.registerHelper(
+        "hint",
+        "graphql",
+        function (editor, options) {
+          var schema = options.schema;
+          if (!schema) {
+            return;
+          }
+          var cur = editor.getCursor();
+          var token2 = editor.getTokenAt(cur);
+          var tokenStart =
+            token2.type !== null && /"|\w/.test(token2.string[0])
+              ? token2.start
+              : token2.end;
+          var position = new graphql_language_service_1$4.Position(
+            cur.line,
+            tokenStart
+          );
+          var rawResults =
+            graphql_language_service_1$4.getAutocompleteSuggestions(
+              schema,
+              editor.getValue(),
+              position,
+              token2,
+              options.externalFragments
+            );
+          var results = {
+            list: rawResults.map(function (item) {
+              return {
+                text: item.label,
+                type: item.type,
+                description: item.documentation,
+                isDeprecated: item.isDeprecated,
+                deprecationReason: item.deprecationReason,
+              };
+            }),
+            from: { line: cur.line, ch: tokenStart },
+            to: { line: cur.line, ch: token2.end },
+          };
+          if (results && results.list && results.list.length > 0) {
+            results.from = codemirror_1$a.default.Pos(
+              results.from.line,
+              results.from.ch
+            );
+            results.to = codemirror_1$a.default.Pos(
+              results.to.line,
+              results.to.ch
+            );
+            codemirror_1$a.default.signal(
+              editor,
+              "hasCompletion",
+              editor,
+              results,
+              token2
+            );
+          }
+          return results;
+        }
+      );
+      var hint$2 = /* @__PURE__ */ Object.freeze(
+        /* @__PURE__ */ _mergeNamespaces(
+          {
+            __proto__: null,
+            [Symbol.toStringTag]: "Module",
+            default: hint$3,
+          },
+          [hint$3]
+        )
+      );
+      var lint$3 = {};
+      var __importDefault$b =
+        (commonjsGlobal && commonjsGlobal.__importDefault) ||
+        function (mod) {
+          return mod && mod.__esModule ? mod : { default: mod };
+        };
+      Object.defineProperty(lint$3, "__esModule", { value: true });
+      var codemirror_1$9 = __importDefault$b(codemirror$2.exports);
+      var graphql_language_service_1$3 = require$$1$1;
+      var SEVERITY = ["error", "warning", "information", "hint"];
+      var TYPE = {
+        "GraphQL: Validation": "validation",
+        "GraphQL: Deprecation": "deprecation",
+        "GraphQL: Syntax": "syntax",
+      };
+      codemirror_1$9.default.registerHelper(
+        "lint",
+        "graphql",
+        function (text3, options) {
+          var schema = options.schema;
+          var rawResults = graphql_language_service_1$3.getDiagnostics(
+            text3,
+            schema,
+            options.validationRules,
+            void 0,
+            options.externalFragments
+          );
+          var results = rawResults.map(function (error2) {
+            return {
+              message: error2.message,
+              severity: error2.severity
+                ? SEVERITY[error2.severity - 1]
+                : SEVERITY[0],
+              type: error2.source ? TYPE[error2.source] : void 0,
+              from: codemirror_1$9.default.Pos(
+                error2.range.start.line,
+                error2.range.start.character
+              ),
+              to: codemirror_1$9.default.Pos(
+                error2.range.end.line,
+                error2.range.end.character
+              ),
+            };
+          });
+          return results;
+        }
+      );
+      var lint$2 = /* @__PURE__ */ Object.freeze(
+        /* @__PURE__ */ _mergeNamespaces(
+          {
+            __proto__: null,
+            [Symbol.toStringTag]: "Module",
+            default: lint$3,
+          },
+          [lint$3]
+        )
+      );
+      var info$1 = {};
+      var getTypeInfo$2 = {};
+      var require$$1 = /* @__PURE__ */ getAugmentedNamespace(introspection);
+      var forEachState$1 = {};
+      Object.defineProperty(forEachState$1, "__esModule", { value: true });
+      function forEachState(stack, fn) {
+        var reverseStateStack = [];
+        var state = stack;
+        while (state && state.kind) {
+          reverseStateStack.push(state);
+          state = state.prevState;
+        }
+        for (var i = reverseStateStack.length - 1; i >= 0; i--) {
+          fn(reverseStateStack[i]);
+        }
+      }
+      forEachState$1.default = forEachState;
+      var __importDefault$a =
+        (commonjsGlobal && commonjsGlobal.__importDefault) ||
+        function (mod) {
+          return mod && mod.__esModule ? mod : { default: mod };
+        };
+      Object.defineProperty(getTypeInfo$2, "__esModule", { value: true });
+      var graphql_1$4 = require$$1$2;
+      var introspection_1 = require$$1;
+      var forEachState_1$1 = __importDefault$a(forEachState$1);
+      function getTypeInfo$1(schema, tokenState) {
+        var info2 = {
+          schema,
+          type: null,
+          parentType: null,
+          inputType: null,
+          directiveDef: null,
+          fieldDef: null,
+          argDef: null,
+          argDefs: null,
+          objectFieldDefs: null,
+        };
+        forEachState_1$1.default(tokenState, function (state) {
+          switch (state.kind) {
+            case "Query":
+            case "ShortQuery":
+              info2.type = schema.getQueryType();
+              break;
+            case "Mutation":
+              info2.type = schema.getMutationType();
+              break;
+            case "Subscription":
+              info2.type = schema.getSubscriptionType();
+              break;
+            case "InlineFragment":
+            case "FragmentDefinition":
+              if (state.type) {
+                info2.type = schema.getType(state.type);
+              }
+              break;
+            case "Field":
+            case "AliasedField":
+              info2.fieldDef =
+                info2.type && state.name
+                  ? getFieldDef(schema, info2.parentType, state.name)
+                  : null;
+              info2.type = info2.fieldDef && info2.fieldDef.type;
+              break;
+            case "SelectionSet":
+              info2.parentType = info2.type
+                ? graphql_1$4.getNamedType(info2.type)
+                : null;
+              break;
+            case "Directive":
+              info2.directiveDef = state.name
+                ? schema.getDirective(state.name)
+                : null;
+              break;
+            case "Arguments":
+              var parentDef = state.prevState
+                ? state.prevState.kind === "Field"
+                  ? info2.fieldDef
+                  : state.prevState.kind === "Directive"
+                  ? info2.directiveDef
+                  : state.prevState.kind === "AliasedField"
+                  ? state.prevState.name &&
+                    getFieldDef(schema, info2.parentType, state.prevState.name)
+                  : null
+                : null;
+              info2.argDefs = parentDef ? parentDef.args : null;
+              break;
+            case "Argument":
+              info2.argDef = null;
+              if (info2.argDefs) {
+                for (var i = 0; i < info2.argDefs.length; i++) {
+                  if (info2.argDefs[i].name === state.name) {
+                    info2.argDef = info2.argDefs[i];
+                    break;
+                  }
+                }
+              }
+              info2.inputType = info2.argDef && info2.argDef.type;
+              break;
+            case "EnumValue":
+              var enumType = info2.inputType
+                ? graphql_1$4.getNamedType(info2.inputType)
+                : null;
+              info2.enumValue =
+                enumType instanceof graphql_1$4.GraphQLEnumType
+                  ? find(enumType.getValues(), function (val) {
+                      return val.value === state.name;
+                    })
+                  : null;
+              break;
+            case "ListValue":
+              var nullableType = info2.inputType
+                ? graphql_1$4.getNullableType(info2.inputType)
+                : null;
+              info2.inputType =
+                nullableType instanceof graphql_1$4.GraphQLList
+                  ? nullableType.ofType
+                  : null;
+              break;
+            case "ObjectValue":
+              var objectType = info2.inputType
+                ? graphql_1$4.getNamedType(info2.inputType)
+                : null;
+              info2.objectFieldDefs =
+                objectType instanceof graphql_1$4.GraphQLInputObjectType
+                  ? objectType.getFields()
+                  : null;
+              break;
+            case "ObjectField":
+              var objectField =
+                state.name && info2.objectFieldDefs
+                  ? info2.objectFieldDefs[state.name]
+                  : null;
+              info2.inputType = objectField && objectField.type;
+              break;
+            case "NamedType":
+              info2.type = state.name ? schema.getType(state.name) : null;
+              break;
+          }
+        });
+        return info2;
+      }
+      getTypeInfo$2.default = getTypeInfo$1;
+      function getFieldDef(schema, type2, fieldName) {
+        if (
+          fieldName === introspection_1.SchemaMetaFieldDef.name &&
+          schema.getQueryType() === type2
+        ) {
+          return introspection_1.SchemaMetaFieldDef;
+        }
+        if (
+          fieldName === introspection_1.TypeMetaFieldDef.name &&
+          schema.getQueryType() === type2
+        ) {
+          return introspection_1.TypeMetaFieldDef;
+        }
+        if (
+          fieldName === introspection_1.TypeNameMetaFieldDef.name &&
+          graphql_1$4.isCompositeType(type2)
+        ) {
+          return introspection_1.TypeNameMetaFieldDef;
+        }
+        if (type2 && type2.getFields) {
+          return type2.getFields()[fieldName];
+        }
+      }
+      function find(array, predicate) {
+        for (var i = 0; i < array.length; i++) {
+          if (predicate(array[i])) {
+            return array[i];
+          }
+        }
+      }
+      var SchemaReference = {};
+      Object.defineProperty(SchemaReference, "__esModule", { value: true });
+      SchemaReference.getTypeReference =
+        SchemaReference.getEnumValueReference =
+        SchemaReference.getArgumentReference =
+        SchemaReference.getDirectiveReference =
+        SchemaReference.getFieldReference =
+          void 0;
+      var graphql_1$3 = require$$1$2;
+      function getFieldReference(typeInfo) {
+        return {
+          kind: "Field",
+          schema: typeInfo.schema,
+          field: typeInfo.fieldDef,
+          type: isMetaField(typeInfo.fieldDef) ? null : typeInfo.parentType,
+        };
+      }
+      SchemaReference.getFieldReference = getFieldReference;
+      function getDirectiveReference(typeInfo) {
+        return {
+          kind: "Directive",
+          schema: typeInfo.schema,
+          directive: typeInfo.directiveDef,
+        };
+      }
+      SchemaReference.getDirectiveReference = getDirectiveReference;
+      function getArgumentReference(typeInfo) {
+        return typeInfo.directiveDef
+          ? {
+              kind: "Argument",
+              schema: typeInfo.schema,
+              argument: typeInfo.argDef,
+              directive: typeInfo.directiveDef,
+            }
+          : {
+              kind: "Argument",
+              schema: typeInfo.schema,
+              argument: typeInfo.argDef,
+              field: typeInfo.fieldDef,
+              type: isMetaField(typeInfo.fieldDef) ? null : typeInfo.parentType,
+            };
+      }
+      SchemaReference.getArgumentReference = getArgumentReference;
+      function getEnumValueReference(typeInfo) {
+        return {
+          kind: "EnumValue",
+          value: typeInfo.enumValue || void 0,
+          type: typeInfo.inputType
+            ? graphql_1$3.getNamedType(typeInfo.inputType)
+            : void 0,
+        };
+      }
+      SchemaReference.getEnumValueReference = getEnumValueReference;
+      function getTypeReference(typeInfo, type2) {
+        return {
+          kind: "Type",
+          schema: typeInfo.schema,
+          type: type2 || typeInfo.type,
+        };
+      }
+      SchemaReference.getTypeReference = getTypeReference;
+      function isMetaField(fieldDef) {
+        return fieldDef.name.slice(0, 2) === "__";
+      }
+      var infoAddon$1 = {};
+      var __importDefault$9 =
+        (commonjsGlobal && commonjsGlobal.__importDefault) ||
+        function (mod) {
+          return mod && mod.__esModule ? mod : { default: mod };
+        };
+      Object.defineProperty(infoAddon$1, "__esModule", { value: true });
+      var codemirror_1$8 = __importDefault$9(codemirror$2.exports);
+      codemirror_1$8.default.defineOption(
+        "info",
+        false,
+        function (cm, options, old) {
+          if (old && old !== codemirror_1$8.default.Init) {
+            var oldOnMouseOver = cm.state.info.onMouseOver;
+            codemirror_1$8.default.off(
+              cm.getWrapperElement(),
+              "mouseover",
+              oldOnMouseOver
+            );
+            clearTimeout(cm.state.info.hoverTimeout);
+            delete cm.state.info;
+          }
+          if (options) {
+            var state = (cm.state.info = createState(options));
+            state.onMouseOver = onMouseOver$1.bind(null, cm);
+            codemirror_1$8.default.on(
+              cm.getWrapperElement(),
+              "mouseover",
+              state.onMouseOver
+            );
+          }
+        }
+      );
+      function createState(options) {
+        return {
+          options:
+            options instanceof Function
+              ? { render: options }
+              : options === true
+              ? {}
+              : options,
+        };
+      }
+      function getHoverTime(cm) {
+        var options = cm.state.info.options;
+        return (options && options.hoverTime) || 500;
+      }
+      function onMouseOver$1(cm, e) {
+        var state = cm.state.info;
+        var target2 = e.target || e.srcElement;
+        if (!(target2 instanceof HTMLElement)) {
+          return;
+        }
+        if (target2.nodeName !== "SPAN" || state.hoverTimeout !== void 0) {
+          return;
+        }
+        var box = target2.getBoundingClientRect();
+        var onMouseMove = function () {
+          clearTimeout(state.hoverTimeout);
+          state.hoverTimeout = setTimeout(onHover, hoverTime);
+        };
+        var onMouseOut2 = function () {
+          codemirror_1$8.default.off(document, "mousemove", onMouseMove);
+          codemirror_1$8.default.off(
+            cm.getWrapperElement(),
+            "mouseout",
+            onMouseOut2
+          );
+          clearTimeout(state.hoverTimeout);
+          state.hoverTimeout = void 0;
+        };
+        var onHover = function () {
+          codemirror_1$8.default.off(document, "mousemove", onMouseMove);
+          codemirror_1$8.default.off(
+            cm.getWrapperElement(),
+            "mouseout",
+            onMouseOut2
+          );
+          state.hoverTimeout = void 0;
+          onMouseHover(cm, box);
+        };
+        var hoverTime = getHoverTime(cm);
+        state.hoverTimeout = setTimeout(onHover, hoverTime);
+        codemirror_1$8.default.on(document, "mousemove", onMouseMove);
+        codemirror_1$8.default.on(
+          cm.getWrapperElement(),
+          "mouseout",
+          onMouseOut2
+        );
+      }
+      function onMouseHover(cm, box) {
+        var pos = cm.coordsChar({
+          left: (box.left + box.right) / 2,
+          top: (box.top + box.bottom) / 2,
+        });
+        var state = cm.state.info;
+        var options = state.options;
+        var render = options.render || cm.getHelper(pos, "info");
+        if (render) {
+          var token2 = cm.getTokenAt(pos, true);
+          if (token2) {
+            var info2 = render(token2, options, cm, pos);
+            if (info2) {
+              showPopup(cm, box, info2);
+            }
+          }
+        }
+      }
+      function showPopup(cm, box, info2) {
+        var popup = document.createElement("div");
+        popup.className = "CodeMirror-info";
+        popup.appendChild(info2);
+        document.body.appendChild(popup);
+        var popupBox = popup.getBoundingClientRect();
+        var popupStyle = window.getComputedStyle(popup);
+        var popupWidth =
+          popupBox.right -
+          popupBox.left +
+          parseFloat(popupStyle.marginLeft) +
+          parseFloat(popupStyle.marginRight);
+        var popupHeight =
+          popupBox.bottom -
+          popupBox.top +
+          parseFloat(popupStyle.marginTop) +
+          parseFloat(popupStyle.marginBottom);
+        var topPos = box.bottom;
+        if (
+          popupHeight > window.innerHeight - box.bottom - 15 &&
+          box.top > window.innerHeight - box.bottom
+        ) {
+          topPos = box.top - popupHeight;
+        }
+        if (topPos < 0) {
+          topPos = box.bottom;
+        }
+        var leftPos = Math.max(0, window.innerWidth - popupWidth - 15);
+        if (leftPos > box.left) {
+          leftPos = box.left;
+        }
+        popup.style.opacity = "1";
+        popup.style.top = topPos + "px";
+        popup.style.left = leftPos + "px";
+        var popupTimeout;
+        var onMouseOverPopup = function () {
+          clearTimeout(popupTimeout);
+        };
+        var onMouseOut2 = function () {
+          clearTimeout(popupTimeout);
+          popupTimeout = setTimeout(hidePopup, 200);
+        };
+        var hidePopup = function () {
+          codemirror_1$8.default.off(popup, "mouseover", onMouseOverPopup);
+          codemirror_1$8.default.off(popup, "mouseout", onMouseOut2);
+          codemirror_1$8.default.off(
+            cm.getWrapperElement(),
+            "mouseout",
+            onMouseOut2
+          );
+          if (popup.style.opacity) {
+            popup.style.opacity = "0";
+            setTimeout(function () {
+              if (popup.parentNode) {
+                popup.parentNode.removeChild(popup);
+              }
+            }, 600);
+          } else if (popup.parentNode) {
+            popup.parentNode.removeChild(popup);
+          }
+        };
+        codemirror_1$8.default.on(popup, "mouseover", onMouseOverPopup);
+        codemirror_1$8.default.on(popup, "mouseout", onMouseOut2);
+        codemirror_1$8.default.on(
+          cm.getWrapperElement(),
+          "mouseout",
+          onMouseOut2
+        );
+      }
+      var infoAddon = /* @__PURE__ */ Object.freeze(
+        /* @__PURE__ */ _mergeNamespaces(
+          {
+            __proto__: null,
+            [Symbol.toStringTag]: "Module",
+            default: infoAddon$1,
+          },
+          [infoAddon$1]
+        )
+      );
+      var __importDefault$8 =
+        (commonjsGlobal && commonjsGlobal.__importDefault) ||
+        function (mod) {
+          return mod && mod.__esModule ? mod : { default: mod };
+        };
+      Object.defineProperty(info$1, "__esModule", { value: true });
+      var graphql_1$2 = require$$1$2;
+      var codemirror_1$7 = __importDefault$8(codemirror$2.exports);
+      var getTypeInfo_1$1 = __importDefault$8(getTypeInfo$2);
+      var SchemaReference_1$1 = SchemaReference;
+      codemirror_1$7.default.registerHelper(
+        "info",
+        "graphql",
+        function (token2, options) {
+          if (!options.schema || !token2.state) {
+            return;
+          }
+          var state = token2.state;
+          var kind2 = state.kind;
+          var step = state.step;
+          var typeInfo = getTypeInfo_1$1.default(options.schema, token2.state);
+          if (
+            (kind2 === "Field" && step === 0 && typeInfo.fieldDef) ||
+            (kind2 === "AliasedField" && step === 2 && typeInfo.fieldDef)
+          ) {
+            var into = document.createElement("div");
+            renderField(into, typeInfo, options);
+            renderDescription(into, options, typeInfo.fieldDef);
+            return into;
+          } else if (
+            kind2 === "Directive" &&
+            step === 1 &&
+            typeInfo.directiveDef
+          ) {
+            var into = document.createElement("div");
+            renderDirective(into, typeInfo, options);
+            renderDescription(into, options, typeInfo.directiveDef);
+            return into;
+          } else if (kind2 === "Argument" && step === 0 && typeInfo.argDef) {
+            var into = document.createElement("div");
+            renderArg(into, typeInfo, options);
+            renderDescription(into, options, typeInfo.argDef);
+            return into;
+          } else if (
+            kind2 === "EnumValue" &&
+            typeInfo.enumValue &&
+            typeInfo.enumValue.description
+          ) {
+            var into = document.createElement("div");
+            renderEnumValue(into, typeInfo, options);
+            renderDescription(into, options, typeInfo.enumValue);
+            return into;
+          } else if (
+            kind2 === "NamedType" &&
+            typeInfo.type &&
+            typeInfo.type.description
+          ) {
+            var into = document.createElement("div");
+            renderType(into, typeInfo, options, typeInfo.type);
+            renderDescription(into, options, typeInfo.type);
+            return into;
+          }
+        }
+      );
+      function renderField(into, typeInfo, options) {
+        renderQualifiedField(into, typeInfo, options);
+        renderTypeAnnotation(into, typeInfo, options, typeInfo.type);
+      }
+      function renderQualifiedField(into, typeInfo, options) {
+        var _a2;
+        var fieldName =
+          ((_a2 = typeInfo.fieldDef) === null || _a2 === void 0
+            ? void 0
+            : _a2.name) || "";
+        if (fieldName.slice(0, 2) !== "__") {
+          renderType(into, typeInfo, options, typeInfo.parentType);
+          text2(into, ".");
+        }
+        text2(
+          into,
+          fieldName,
+          "field-name",
+          options,
+          SchemaReference_1$1.getFieldReference(typeInfo)
+        );
+      }
+      function renderDirective(into, typeInfo, options) {
+        var _a2;
+        var name2 =
+          "@" +
+          (((_a2 = typeInfo.directiveDef) === null || _a2 === void 0
+            ? void 0
+            : _a2.name) || "");
+        text2(
+          into,
+          name2,
+          "directive-name",
+          options,
+          SchemaReference_1$1.getDirectiveReference(typeInfo)
+        );
+      }
+      function renderArg(into, typeInfo, options) {
+        var _a2;
+        if (typeInfo.directiveDef) {
+          renderDirective(into, typeInfo, options);
+        } else if (typeInfo.fieldDef) {
+          renderQualifiedField(into, typeInfo, options);
+        }
+        var name2 =
+          ((_a2 = typeInfo.argDef) === null || _a2 === void 0
+            ? void 0
+            : _a2.name) || "";
+        text2(into, "(");
+        text2(
+          into,
+          name2,
+          "arg-name",
+          options,
+          SchemaReference_1$1.getArgumentReference(typeInfo)
+        );
+        renderTypeAnnotation(into, typeInfo, options, typeInfo.inputType);
+        text2(into, ")");
+      }
+      function renderTypeAnnotation(into, typeInfo, options, t2) {
+        text2(into, ": ");
+        renderType(into, typeInfo, options, t2);
+      }
+      function renderEnumValue(into, typeInfo, options) {
+        var _a2;
+        var name2 =
+          ((_a2 = typeInfo.enumValue) === null || _a2 === void 0
+            ? void 0
+            : _a2.name) || "";
+        renderType(into, typeInfo, options, typeInfo.inputType);
+        text2(into, ".");
+        text2(
+          into,
+          name2,
+          "enum-value",
+          options,
+          SchemaReference_1$1.getEnumValueReference(typeInfo)
+        );
+      }
+      function renderType(into, typeInfo, options, t2) {
+        if (t2 instanceof graphql_1$2.GraphQLNonNull) {
+          renderType(into, typeInfo, options, t2.ofType);
+          text2(into, "!");
+        } else if (t2 instanceof graphql_1$2.GraphQLList) {
+          text2(into, "[");
+          renderType(into, typeInfo, options, t2.ofType);
+          text2(into, "]");
+        } else {
+          text2(
+            into,
+            (t2 === null || t2 === void 0 ? void 0 : t2.name) || "",
+            "type-name",
+            options,
+            SchemaReference_1$1.getTypeReference(typeInfo, t2)
+          );
+        }
+      }
+      function renderDescription(into, options, def) {
+        var description = def.description;
+        if (description) {
+          var descriptionDiv = document.createElement("div");
+          descriptionDiv.className = "info-description";
+          if (options.renderDescription) {
+            descriptionDiv.innerHTML = options.renderDescription(description);
+          } else {
+            descriptionDiv.appendChild(document.createTextNode(description));
+          }
+          into.appendChild(descriptionDiv);
+        }
+        renderDeprecation(into, options, def);
+      }
+      function renderDeprecation(into, options, def) {
+        var reason = def.deprecationReason;
+        if (reason) {
+          var deprecationDiv = document.createElement("div");
+          deprecationDiv.className = "info-deprecation";
+          if (options.renderDescription) {
+            deprecationDiv.innerHTML = options.renderDescription(reason);
+          } else {
+            deprecationDiv.appendChild(document.createTextNode(reason));
+          }
+          var label = document.createElement("span");
+          label.className = "info-deprecation-label";
+          label.appendChild(document.createTextNode("Deprecated: "));
+          deprecationDiv.insertBefore(label, deprecationDiv.firstChild);
+          into.appendChild(deprecationDiv);
+        }
+      }
+      function text2(into, content, className, options, ref) {
+        if (className === void 0) {
+          className = "";
+        }
+        if (options === void 0) {
+          options = { onClick: null };
+        }
+        if (ref === void 0) {
+          ref = null;
+        }
+        if (className) {
+          var onClick_1 = options.onClick;
+          var node = void 0;
+          if (onClick_1) {
+            node = document.createElement("a");
+            node.href = "javascript:void 0";
+            node.addEventListener("click", function (e) {
+              onClick_1(ref, e);
+            });
+          } else {
+            node = document.createElement("span");
+          }
+          node.className = className;
+          node.appendChild(document.createTextNode(content));
+          into.appendChild(node);
+        } else {
+          into.appendChild(document.createTextNode(content));
+        }
+      }
+      var info = /* @__PURE__ */ Object.freeze(
+        /* @__PURE__ */ _mergeNamespaces(
+          {
+            __proto__: null,
+            [Symbol.toStringTag]: "Module",
+            default: info$1,
+          },
+          [info$1]
+        )
+      );
+      var jump$1 = {};
+      var jumpAddon = {};
+      var __importDefault$7 =
+        (commonjsGlobal && commonjsGlobal.__importDefault) ||
+        function (mod) {
+          return mod && mod.__esModule ? mod : { default: mod };
+        };
+      Object.defineProperty(jumpAddon, "__esModule", { value: true });
+      var codemirror_1$6 = __importDefault$7(codemirror$2.exports);
+      codemirror_1$6.default.defineOption(
+        "jump",
+        false,
+        function (cm, options, old) {
+          if (old && old !== codemirror_1$6.default.Init) {
+            var oldOnMouseOver = cm.state.jump.onMouseOver;
+            codemirror_1$6.default.off(
+              cm.getWrapperElement(),
+              "mouseover",
+              oldOnMouseOver
+            );
+            var oldOnMouseOut = cm.state.jump.onMouseOut;
+            codemirror_1$6.default.off(
+              cm.getWrapperElement(),
+              "mouseout",
+              oldOnMouseOut
+            );
+            codemirror_1$6.default.off(
+              document,
+              "keydown",
+              cm.state.jump.onKeyDown
+            );
+            delete cm.state.jump;
+          }
+          if (options) {
+            var state = (cm.state.jump = {
+              options,
+              onMouseOver: onMouseOver.bind(null, cm),
+              onMouseOut: onMouseOut.bind(null, cm),
+              onKeyDown: onKeyDown.bind(null, cm),
+            });
+            codemirror_1$6.default.on(
+              cm.getWrapperElement(),
+              "mouseover",
+              state.onMouseOver
+            );
+            codemirror_1$6.default.on(
+              cm.getWrapperElement(),
+              "mouseout",
+              state.onMouseOut
+            );
+            codemirror_1$6.default.on(document, "keydown", state.onKeyDown);
+          }
+        }
+      );
+      function onMouseOver(cm, event) {
+        var target2 = event.target || event.srcElement;
+        if (!(target2 instanceof HTMLElement)) {
+          return;
+        }
+        if (
+          (target2 === null || target2 === void 0
+            ? void 0
+            : target2.nodeName) !== "SPAN"
+        ) {
+          return;
+        }
+        var box = target2.getBoundingClientRect();
+        var cursor = {
+          left: (box.left + box.right) / 2,
+          top: (box.top + box.bottom) / 2,
+        };
+        cm.state.jump.cursor = cursor;
+        if (cm.state.jump.isHoldingModifier) {
+          enableJumpMode(cm);
+        }
+      }
+      function onMouseOut(cm) {
+        if (!cm.state.jump.isHoldingModifier && cm.state.jump.cursor) {
+          cm.state.jump.cursor = null;
+          return;
+        }
+        if (cm.state.jump.isHoldingModifier && cm.state.jump.marker) {
+          disableJumpMode(cm);
+        }
+      }
+      function onKeyDown(cm, event) {
+        if (cm.state.jump.isHoldingModifier || !isJumpModifier(event.key)) {
+          return;
+        }
+        cm.state.jump.isHoldingModifier = true;
+        if (cm.state.jump.cursor) {
+          enableJumpMode(cm);
+        }
+        var onKeyUp = function (upEvent) {
+          if (upEvent.code !== event.code) {
+            return;
+          }
+          cm.state.jump.isHoldingModifier = false;
+          if (cm.state.jump.marker) {
+            disableJumpMode(cm);
+          }
+          codemirror_1$6.default.off(document, "keyup", onKeyUp);
+          codemirror_1$6.default.off(document, "click", onClick);
+          cm.off("mousedown", onMouseDown);
+        };
+        var onClick = function (clickEvent) {
+          var destination = cm.state.jump.destination;
+          if (destination) {
+            cm.state.jump.options.onClick(destination, clickEvent);
+          }
+        };
+        var onMouseDown = function (_, downEvent) {
+          if (cm.state.jump.destination) {
+            downEvent.codemirrorIgnore = true;
+          }
+        };
+        codemirror_1$6.default.on(document, "keyup", onKeyUp);
+        codemirror_1$6.default.on(document, "click", onClick);
+        cm.on("mousedown", onMouseDown);
+      }
+      var isMac =
+        typeof navigator !== "undefined" &&
+        navigator &&
+        navigator.appVersion.indexOf("Mac") !== -1;
+      function isJumpModifier(key) {
+        return key === (isMac ? "Meta" : "Control");
+      }
+      function enableJumpMode(cm) {
+        if (cm.state.jump.marker) {
+          return;
+        }
+        var cursor = cm.state.jump.cursor;
+        var pos = cm.coordsChar(cursor);
+        var token2 = cm.getTokenAt(pos, true);
+        var options = cm.state.jump.options;
+        var getDestination =
+          options.getDestination || cm.getHelper(pos, "jump");
+        if (getDestination) {
+          var destination = getDestination(token2, options, cm);
+          if (destination) {
+            var marker2 = cm.markText(
+              { line: pos.line, ch: token2.start },
+              { line: pos.line, ch: token2.end },
+              { className: "CodeMirror-jump-token" }
+            );
+            cm.state.jump.marker = marker2;
+            cm.state.jump.destination = destination;
+          }
+        }
+      }
+      function disableJumpMode(cm) {
+        var marker2 = cm.state.jump.marker;
+        cm.state.jump.marker = null;
+        cm.state.jump.destination = null;
+        marker2.clear();
+      }
+      var __importDefault$6 =
+        (commonjsGlobal && commonjsGlobal.__importDefault) ||
+        function (mod) {
+          return mod && mod.__esModule ? mod : { default: mod };
+        };
+      Object.defineProperty(jump$1, "__esModule", { value: true });
+      var codemirror_1$5 = __importDefault$6(codemirror$2.exports);
+      var getTypeInfo_1 = __importDefault$6(getTypeInfo$2);
+      var SchemaReference_1 = SchemaReference;
+      codemirror_1$5.default.registerHelper(
+        "jump",
+        "graphql",
+        function (token2, options) {
+          if (!options.schema || !options.onClick || !token2.state) {
+            return;
+          }
+          var state = token2.state;
+          var kind2 = state.kind;
+          var step = state.step;
+          var typeInfo = getTypeInfo_1.default(options.schema, state);
+          if (
+            (kind2 === "Field" && step === 0 && typeInfo.fieldDef) ||
+            (kind2 === "AliasedField" && step === 2 && typeInfo.fieldDef)
+          ) {
+            return SchemaReference_1.getFieldReference(typeInfo);
+          } else if (
+            kind2 === "Directive" &&
+            step === 1 &&
+            typeInfo.directiveDef
+          ) {
+            return SchemaReference_1.getDirectiveReference(typeInfo);
+          } else if (kind2 === "Argument" && step === 0 && typeInfo.argDef) {
+            return SchemaReference_1.getArgumentReference(typeInfo);
+          } else if (kind2 === "EnumValue" && typeInfo.enumValue) {
+            return SchemaReference_1.getEnumValueReference(typeInfo);
+          } else if (kind2 === "NamedType" && typeInfo.type) {
+            return SchemaReference_1.getTypeReference(typeInfo);
+          }
+        }
+      );
+      var jump = /* @__PURE__ */ Object.freeze(
+        /* @__PURE__ */ _mergeNamespaces(
+          {
+            __proto__: null,
+            [Symbol.toStringTag]: "Module",
+            default: jump$1,
+          },
+          [jump$1]
+        )
+      );
+      var mode$5 = {};
+      var modeFactory = {};
+      var modeIndent = {};
+      Object.defineProperty(modeIndent, "__esModule", { value: true });
+      function indent$2(state, textAfter) {
+        var _a2, _b;
+        var levels = state.levels;
+        var level =
+          !levels || levels.length === 0
+            ? state.indentLevel
+            : levels[levels.length - 1] -
+              ((
+                (_a2 = this.electricInput) === null || _a2 === void 0
+                  ? void 0
+                  : _a2.test(textAfter)
+              )
+                ? 1
+                : 0);
+        return (
+          (level || 0) *
+          (((_b = this.config) === null || _b === void 0
+            ? void 0
+            : _b.indentUnit) || 0)
+        );
+      }
+      modeIndent.default = indent$2;
+      var __importDefault$5 =
+        (commonjsGlobal && commonjsGlobal.__importDefault) ||
+        function (mod) {
+          return mod && mod.__esModule ? mod : { default: mod };
+        };
+      Object.defineProperty(modeFactory, "__esModule", { value: true });
+      var graphql_language_service_1$2 = require$$1$1;
+      var mode_indent_1 = __importDefault$5(modeIndent);
+      var graphqlModeFactory = function (config2) {
+        var parser = graphql_language_service_1$2.onlineParser({
+          eatWhitespace: function (stream) {
+            return stream.eatWhile(graphql_language_service_1$2.isIgnored);
+          },
+          lexRules: graphql_language_service_1$2.LexRules,
+          parseRules: graphql_language_service_1$2.ParseRules,
+          editorConfig: { tabSize: config2.tabSize },
+        });
+        return {
+          config: config2,
+          startState: parser.startState,
+          token: parser.token,
+          indent: mode_indent_1.default,
+          electricInput: /^\s*[})\]]/,
+          fold: "brace",
+          lineComment: "#",
+          closeBrackets: {
+            pairs: '()[]{}""',
+            explode: "()[]{}",
+          },
+        };
+      };
+      modeFactory.default = graphqlModeFactory;
+      var __importDefault$4 =
+        (commonjsGlobal && commonjsGlobal.__importDefault) ||
+        function (mod) {
+          return mod && mod.__esModule ? mod : { default: mod };
+        };
+      Object.defineProperty(mode$5, "__esModule", { value: true });
+      var codemirror_1$4 = __importDefault$4(codemirror$2.exports);
+      var mode_factory_1 = __importDefault$4(modeFactory);
+      codemirror_1$4.default.defineMode("graphql", mode_factory_1.default);
+      var mode$4 = /* @__PURE__ */ Object.freeze(
+        /* @__PURE__ */ _mergeNamespaces(
+          {
+            __proto__: null,
+            [Symbol.toStringTag]: "Module",
+            default: mode$5,
+          },
+          [mode$5]
+        )
+      );
+      var hint$1 = {};
+      var hintList$1 = {};
+      Object.defineProperty(hintList$1, "__esModule", { value: true });
+      function hintList(cursor, token2, list3) {
+        var hints = filterAndSortList(list3, normalizeText(token2.string));
+        if (!hints) {
+          return;
+        }
+        var tokenStart =
+          token2.type !== null && /"|\w/.test(token2.string[0])
+            ? token2.start
+            : token2.end;
+        return {
+          list: hints,
+          from: { line: cursor.line, ch: tokenStart },
+          to: { line: cursor.line, ch: token2.end },
+        };
+      }
+      hintList$1.default = hintList;
+      function filterAndSortList(list3, text3) {
+        if (!text3) {
+          return filterNonEmpty(list3, function (entry) {
+            return !entry.isDeprecated;
+          });
+        }
+        var byProximity = list3.map(function (entry) {
+          return {
+            proximity: getProximity(normalizeText(entry.text), text3),
+            entry,
+          };
+        });
+        var conciseMatches = filterNonEmpty(
+          filterNonEmpty(byProximity, function (pair) {
+            return pair.proximity <= 2;
+          }),
+          function (pair) {
+            return !pair.entry.isDeprecated;
+          }
+        );
+        var sortedMatches = conciseMatches.sort(function (a, b) {
+          return (
+            (a.entry.isDeprecated ? 1 : 0) - (b.entry.isDeprecated ? 1 : 0) ||
+            a.proximity - b.proximity ||
+            a.entry.text.length - b.entry.text.length
+          );
+        });
+        return sortedMatches.map(function (pair) {
+          return pair.entry;
+        });
+      }
+      function filterNonEmpty(array, predicate) {
+        var filtered = array.filter(predicate);
+        return filtered.length === 0 ? array : filtered;
+      }
+      function normalizeText(text3) {
+        return text3.toLowerCase().replace(/\W/g, "");
+      }
+      function getProximity(suggestion, text3) {
+        var proximity = lexicalDistance(text3, suggestion);
+        if (suggestion.length > text3.length) {
+          proximity -= suggestion.length - text3.length - 1;
+          proximity += suggestion.indexOf(text3) === 0 ? 0 : 0.5;
+        }
+        return proximity;
+      }
+      function lexicalDistance(a, b) {
+        var i;
+        var j;
+        var d = [];
+        var aLength = a.length;
+        var bLength = b.length;
+        for (i = 0; i <= aLength; i++) {
+          d[i] = [i];
+        }
+        for (j = 1; j <= bLength; j++) {
+          d[0][j] = j;
+        }
+        for (i = 1; i <= aLength; i++) {
+          for (j = 1; j <= bLength; j++) {
+            var cost = a[i - 1] === b[j - 1] ? 0 : 1;
+            d[i][j] = Math.min(
+              d[i - 1][j] + 1,
+              d[i][j - 1] + 1,
+              d[i - 1][j - 1] + cost
+            );
+            if (
+              i > 1 &&
+              j > 1 &&
+              a[i - 1] === b[j - 2] &&
+              a[i - 2] === b[j - 1]
+            ) {
+              d[i][j] = Math.min(d[i][j], d[i - 2][j - 2] + cost);
+            }
+          }
+        }
+        return d[aLength][bLength];
+      }
+      var __importDefault$3 =
+        (commonjsGlobal && commonjsGlobal.__importDefault) ||
+        function (mod) {
+          return mod && mod.__esModule ? mod : { default: mod };
+        };
+      Object.defineProperty(hint$1, "__esModule", { value: true });
+      var codemirror_1$3 = __importDefault$3(codemirror$2.exports);
+      var graphql_1$1 = require$$1$2;
+      var forEachState_1 = __importDefault$3(forEachState$1);
+      var hintList_1 = __importDefault$3(hintList$1);
+      codemirror_1$3.default.registerHelper(
+        "hint",
+        "graphql-variables",
+        function (editor, options) {
+          var cur = editor.getCursor();
+          var token2 = editor.getTokenAt(cur);
+          var results = getVariablesHint(cur, token2, options);
+          if (results && results.list && results.list.length > 0) {
+            results.from = codemirror_1$3.default.Pos(
+              results.from.line,
+              results.from.ch
+            );
+            results.to = codemirror_1$3.default.Pos(
+              results.to.line,
+              results.to.ch
+            );
+            codemirror_1$3.default.signal(
+              editor,
+              "hasCompletion",
+              editor,
+              results,
+              token2
+            );
+          }
+          return results;
+        }
+      );
+      function getVariablesHint(cur, token2, options) {
+        var state =
+          token2.state.kind === "Invalid"
+            ? token2.state.prevState
+            : token2.state;
+        var kind2 = state.kind;
+        var step = state.step;
+        if (kind2 === "Document" && step === 0) {
+          return hintList_1.default(cur, token2, [{ text: "{" }]);
+        }
+        var variableToType = options.variableToType;
+        if (!variableToType) {
+          return;
+        }
+        var typeInfo = getTypeInfo(variableToType, token2.state);
+        if (kind2 === "Document" || (kind2 === "Variable" && step === 0)) {
+          var variableNames = Object.keys(variableToType);
+          return hintList_1.default(
+            cur,
+            token2,
+            variableNames.map(function (name2) {
+              return {
+                text: '"' + name2 + '": ',
+                type: variableToType[name2],
+              };
+            })
+          );
+        }
+        if (
+          kind2 === "ObjectValue" ||
+          (kind2 === "ObjectField" && step === 0)
+        ) {
+          if (typeInfo.fields) {
+            var inputFields = Object.keys(typeInfo.fields).map(function (
+              fieldName
+            ) {
+              return typeInfo.fields[fieldName];
+            });
+            return hintList_1.default(
+              cur,
+              token2,
+              inputFields.map(function (field) {
+                return {
+                  text: '"' + field.name + '": ',
+                  type: field.type,
+                  description: field.description,
+                };
+              })
+            );
+          }
+        }
+        if (
+          kind2 === "StringValue" ||
+          kind2 === "NumberValue" ||
+          kind2 === "BooleanValue" ||
+          kind2 === "NullValue" ||
+          (kind2 === "ListValue" && step === 1) ||
+          (kind2 === "ObjectField" && step === 2) ||
+          (kind2 === "Variable" && step === 2)
+        ) {
+          var namedInputType_1 = typeInfo.type
+            ? graphql_1$1.getNamedType(typeInfo.type)
+            : void 0;
+          if (namedInputType_1 instanceof graphql_1$1.GraphQLInputObjectType) {
+            return hintList_1.default(cur, token2, [{ text: "{" }]);
+          } else if (namedInputType_1 instanceof graphql_1$1.GraphQLEnumType) {
+            var values = namedInputType_1.getValues();
+            return hintList_1.default(
+              cur,
+              token2,
+              values.map(function (value) {
+                return {
+                  text: '"' + value.name + '"',
+                  type: namedInputType_1,
+                  description: value.description,
+                };
+              })
+            );
+          } else if (namedInputType_1 === graphql_1$1.GraphQLBoolean) {
+            return hintList_1.default(cur, token2, [
+              {
+                text: "true",
+                type: graphql_1$1.GraphQLBoolean,
+                description: "Not false.",
+              },
+              {
+                text: "false",
+                type: graphql_1$1.GraphQLBoolean,
+                description: "Not true.",
+              },
+            ]);
+          }
+        }
+      }
+      function getTypeInfo(variableToType, tokenState) {
+        var info2 = {
+          type: null,
+          fields: null,
+        };
+        forEachState_1.default(tokenState, function (state) {
+          if (state.kind === "Variable") {
+            info2.type = variableToType[state.name];
+          } else if (state.kind === "ListValue") {
+            var nullableType = info2.type
+              ? graphql_1$1.getNullableType(info2.type)
+              : void 0;
+            info2.type =
+              nullableType instanceof graphql_1$1.GraphQLList
+                ? nullableType.ofType
+                : null;
+          } else if (state.kind === "ObjectValue") {
+            var objectType = info2.type
+              ? graphql_1$1.getNamedType(info2.type)
+              : void 0;
+            info2.fields =
+              objectType instanceof graphql_1$1.GraphQLInputObjectType
+                ? objectType.getFields()
+                : null;
+          } else if (state.kind === "ObjectField") {
+            var objectField =
+              state.name && info2.fields ? info2.fields[state.name] : null;
+            info2.type = objectField && objectField.type;
+          }
+        });
+        return info2;
+      }
+      var hint = /* @__PURE__ */ Object.freeze(
+        /* @__PURE__ */ _mergeNamespaces(
+          {
+            __proto__: null,
+            [Symbol.toStringTag]: "Module",
+            default: hint$1,
+          },
+          [hint$1]
+        )
+      );
+      var lint$1 = {};
+      var jsonParse$1 = {};
+      Object.defineProperty(jsonParse$1, "__esModule", { value: true });
+      function jsonParse(str) {
+        string = str;
+        strLen = str.length;
+        start = end = lastEnd = -1;
+        ch();
+        lex();
+        var ast2 = parseObj();
+        expect("EOF");
+        return ast2;
+      }
+      jsonParse$1.default = jsonParse;
+      var string;
+      var strLen;
+      var start;
+      var end;
+      var lastEnd;
+      var code2;
+      var kind;
+      function parseObj() {
+        var nodeStart = start;
+        var members = [];
+        expect("{");
+        if (!skip("}")) {
+          do {
+            members.push(parseMember());
+          } while (skip(","));
+          expect("}");
+        }
+        return {
+          kind: "Object",
+          start: nodeStart,
+          end: lastEnd,
+          members,
+        };
+      }
+      function parseMember() {
+        var nodeStart = start;
+        var key = kind === "String" ? curToken() : null;
+        expect("String");
+        expect(":");
+        var value = parseVal();
+        return {
+          kind: "Member",
+          start: nodeStart,
+          end: lastEnd,
+          key,
+          value,
+        };
+      }
+      function parseArr() {
+        var nodeStart = start;
+        var values = [];
+        expect("[");
+        if (!skip("]")) {
+          do {
+            values.push(parseVal());
+          } while (skip(","));
+          expect("]");
+        }
+        return {
+          kind: "Array",
+          start: nodeStart,
+          end: lastEnd,
+          values,
+        };
+      }
+      function parseVal() {
+        switch (kind) {
+          case "[":
+            return parseArr();
+          case "{":
+            return parseObj();
+          case "String":
+          case "Number":
+          case "Boolean":
+          case "Null":
+            var token2 = curToken();
+            lex();
+            return token2;
+        }
+        expect("Value");
+      }
+      function curToken() {
+        return {
+          kind,
+          start,
+          end,
+          value: JSON.parse(string.slice(start, end)),
+        };
+      }
+      function expect(str) {
+        if (kind === str) {
+          lex();
+          return;
+        }
+        var found;
+        if (kind === "EOF") {
+          found = "[end of file]";
+        } else if (end - start > 1) {
+          found = "`" + string.slice(start, end) + "`";
+        } else {
+          var match2 = string.slice(start).match(/^.+?\b/);
+          found = "`" + (match2 ? match2[0] : string[start]) + "`";
+        }
+        throw syntaxError("Expected " + str + " but found " + found + ".");
+      }
+      function syntaxError(message) {
+        return { message, start, end };
+      }
+      function skip(k) {
+        if (kind === k) {
+          lex();
+          return true;
+        }
+      }
+      function ch() {
+        if (end < strLen) {
+          end++;
+          code2 = end === strLen ? 0 : string.charCodeAt(end);
+        }
+        return code2;
+      }
+      function lex() {
+        lastEnd = end;
+        while (code2 === 9 || code2 === 10 || code2 === 13 || code2 === 32) {
+          ch();
+        }
+        if (code2 === 0) {
+          kind = "EOF";
+          return;
+        }
+        start = end;
+        switch (code2) {
+          case 34:
+            kind = "String";
+            return readString();
+          case 45:
+          case 48:
+          case 49:
+          case 50:
+          case 51:
+          case 52:
+          case 53:
+          case 54:
+          case 55:
+          case 56:
+          case 57:
+            kind = "Number";
+            return readNumber();
+          case 102:
+            if (string.slice(start, start + 5) !== "false") {
+              break;
+            }
+            end += 4;
+            ch();
+            kind = "Boolean";
+            return;
+          case 110:
+            if (string.slice(start, start + 4) !== "null") {
+              break;
+            }
+            end += 3;
+            ch();
+            kind = "Null";
+            return;
+          case 116:
+            if (string.slice(start, start + 4) !== "true") {
+              break;
+            }
+            end += 3;
+            ch();
+            kind = "Boolean";
+            return;
+        }
+        kind = string[start];
+        ch();
+      }
+      function readString() {
+        ch();
+        while (code2 !== 34 && code2 > 31) {
+          if (code2 === 92) {
+            code2 = ch();
+            switch (code2) {
+              case 34:
+              case 47:
+              case 92:
+              case 98:
+              case 102:
+              case 110:
+              case 114:
+              case 116:
+                ch();
+                break;
+              case 117:
+                ch();
+                readHex();
+                readHex();
+                readHex();
+                readHex();
+                break;
+              default:
+                throw syntaxError("Bad character escape sequence.");
+            }
+          } else if (end === strLen) {
+            throw syntaxError("Unterminated string.");
+          } else {
+            ch();
+          }
+        }
+        if (code2 === 34) {
+          ch();
+          return;
+        }
+        throw syntaxError("Unterminated string.");
+      }
+      function readHex() {
+        if (
+          (code2 >= 48 && code2 <= 57) ||
+          (code2 >= 65 && code2 <= 70) ||
+          (code2 >= 97 && code2 <= 102)
+        ) {
+          return ch();
+        }
+        throw syntaxError("Expected hexadecimal digit.");
+      }
+      function readNumber() {
+        if (code2 === 45) {
+          ch();
+        }
+        if (code2 === 48) {
+          ch();
+        } else {
+          readDigits();
+        }
+        if (code2 === 46) {
+          ch();
+          readDigits();
+        }
+        if (code2 === 69 || code2 === 101) {
+          code2 = ch();
+          if (code2 === 43 || code2 === 45) {
+            ch();
+          }
+          readDigits();
+        }
+      }
+      function readDigits() {
+        if (code2 < 48 || code2 > 57) {
+          throw syntaxError("Expected decimal digit.");
+        }
+        do {
+          ch();
+        } while (code2 >= 48 && code2 <= 57);
+      }
+      var __read =
+        (commonjsGlobal && commonjsGlobal.__read) ||
+        function (o, n2) {
+          var m = typeof Symbol === "function" && o[Symbol.iterator];
+          if (!m) return o;
+          var i = m.call(o),
+            r2,
+            ar = [],
+            e;
+          try {
+            while ((n2 === void 0 || n2-- > 0) && !(r2 = i.next()).done)
+              ar.push(r2.value);
+          } catch (error2) {
+            e = { error: error2 };
+          } finally {
+            try {
+              if (r2 && !r2.done && (m = i["return"])) m.call(i);
+            } finally {
+              if (e) throw e.error;
+            }
+          }
+          return ar;
+        };
+      var __importDefault$2 =
+        (commonjsGlobal && commonjsGlobal.__importDefault) ||
+        function (mod) {
+          return mod && mod.__esModule ? mod : { default: mod };
+        };
+      Object.defineProperty(lint$1, "__esModule", { value: true });
+      var codemirror_1$2 = __importDefault$2(codemirror$2.exports);
+      var graphql_1 = require$$1$2;
+      var jsonParse_1 = __importDefault$2(jsonParse$1);
+      codemirror_1$2.default.registerHelper(
+        "lint",
+        "graphql-variables",
+        function (text3, options, editor) {
+          if (!text3) {
+            return [];
+          }
+          var ast2;
+          try {
+            ast2 = jsonParse_1.default(text3);
+          } catch (syntaxError2) {
+            if (syntaxError2.stack) {
+              throw syntaxError2;
+            }
+            return [lintError(editor, syntaxError2, syntaxError2.message)];
+          }
+          var variableToType = options.variableToType;
+          if (!variableToType) {
+            return [];
+          }
+          return validateVariables(editor, variableToType, ast2);
+        }
+      );
+      function validateVariables(editor, variableToType, variablesAST) {
+        var errors2 = [];
+        variablesAST.members.forEach(function (member) {
+          var _a2;
+          if (member) {
+            var variableName =
+              (_a2 = member.key) === null || _a2 === void 0
+                ? void 0
+                : _a2.value;
+            var type2 = variableToType[variableName];
+            if (!type2) {
+              errors2.push(
+                lintError(
+                  editor,
+                  member.key,
+                  'Variable "$' +
+                    variableName +
+                    '" does not appear in any GraphQL query.'
+                )
+              );
+            } else {
+              validateValue(type2, member.value).forEach(function (_a3) {
+                var _b = __read(_a3, 2),
+                  node = _b[0],
+                  message = _b[1];
+                errors2.push(lintError(editor, node, message));
+              });
+            }
+          }
+        });
+        return errors2;
+      }
+      function validateValue(type2, valueAST) {
+        if (!type2 || !valueAST) {
+          return [];
+        }
+        if (type2 instanceof graphql_1.GraphQLNonNull) {
+          if (valueAST.kind === "Null") {
+            return [
+              [
+                valueAST,
+                'Type "' + type2 + '" is non-nullable and cannot be null.',
+              ],
+            ];
+          }
+          return validateValue(type2.ofType, valueAST);
+        }
+        if (valueAST.kind === "Null") {
+          return [];
+        }
+        if (type2 instanceof graphql_1.GraphQLList) {
+          var itemType_1 = type2.ofType;
+          if (valueAST.kind === "Array") {
+            var values = valueAST.values || [];
+            return mapCat(values, function (item) {
+              return validateValue(itemType_1, item);
+            });
+          }
+          return validateValue(itemType_1, valueAST);
+        }
+        if (type2 instanceof graphql_1.GraphQLInputObjectType) {
+          if (valueAST.kind !== "Object") {
+            return [[valueAST, 'Type "' + type2 + '" must be an Object.']];
+          }
+          var providedFields_1 = /* @__PURE__ */ Object.create(null);
+          var fieldErrors_1 = mapCat(valueAST.members, function (member) {
+            var _a2;
+            var fieldName =
+              (_a2 =
+                member === null || member === void 0 ? void 0 : member.key) ===
+                null || _a2 === void 0
+                ? void 0
+                : _a2.value;
+            providedFields_1[fieldName] = true;
+            var inputField = type2.getFields()[fieldName];
+            if (!inputField) {
+              return [
+                [
+                  member.key,
+                  'Type "' +
+                    type2 +
+                    '" does not have a field "' +
+                    fieldName +
+                    '".',
+                ],
+              ];
+            }
+            var fieldType = inputField ? inputField.type : void 0;
+            return validateValue(fieldType, member.value);
+          });
+          Object.keys(type2.getFields()).forEach(function (fieldName) {
+            if (!providedFields_1[fieldName]) {
+              var fieldType = type2.getFields()[fieldName].type;
+              if (fieldType instanceof graphql_1.GraphQLNonNull) {
+                fieldErrors_1.push([
+                  valueAST,
+                  'Object of type "' +
+                    type2 +
+                    '" is missing required field "' +
+                    fieldName +
+                    '".',
+                ]);
+              }
+            }
+          });
+          return fieldErrors_1;
+        }
+        if (
+          (type2.name === "Boolean" && valueAST.kind !== "Boolean") ||
+          (type2.name === "String" && valueAST.kind !== "String") ||
+          (type2.name === "ID" &&
+            valueAST.kind !== "Number" &&
+            valueAST.kind !== "String") ||
+          (type2.name === "Float" && valueAST.kind !== "Number") ||
+          (type2.name === "Int" &&
+            (valueAST.kind !== "Number" ||
+              (valueAST.value | 0) !== valueAST.value))
+        ) {
+          return [[valueAST, 'Expected value of type "' + type2 + '".']];
+        }
+        if (
+          type2 instanceof graphql_1.GraphQLEnumType ||
+          type2 instanceof graphql_1.GraphQLScalarType
+        ) {
+          if (
+            (valueAST.kind !== "String" &&
+              valueAST.kind !== "Number" &&
+              valueAST.kind !== "Boolean" &&
+              valueAST.kind !== "Null") ||
+            isNullish(type2.parseValue(valueAST.value))
+          ) {
+            return [[valueAST, 'Expected value of type "' + type2 + '".']];
+          }
+        }
+        return [];
+      }
+      function lintError(editor, node, message) {
+        return {
+          message,
+          severity: "error",
+          type: "validation",
+          from: editor.posFromIndex(node.start),
+          to: editor.posFromIndex(node.end),
+        };
+      }
+      function isNullish(value) {
+        return value === null || value === void 0 || value !== value;
+      }
+      function mapCat(array, mapper) {
+        return Array.prototype.concat.apply([], array.map(mapper));
+      }
+      var lint = /* @__PURE__ */ Object.freeze(
+        /* @__PURE__ */ _mergeNamespaces(
+          {
+            __proto__: null,
+            [Symbol.toStringTag]: "Module",
+            default: lint$1,
+          },
+          [lint$1]
+        )
+      );
+      var mode$3 = {};
+      var __importDefault$1 =
+        (commonjsGlobal && commonjsGlobal.__importDefault) ||
+        function (mod) {
+          return mod && mod.__esModule ? mod : { default: mod };
+        };
+      Object.defineProperty(mode$3, "__esModule", { value: true });
+      var codemirror_1$1 = __importDefault$1(codemirror$2.exports);
+      var graphql_language_service_1$1 = require$$1$1;
+      codemirror_1$1.default.defineMode(
+        "graphql-variables",
+        function (config2) {
+          var parser = graphql_language_service_1$1.onlineParser({
+            eatWhitespace: function (stream) {
+              return stream.eatSpace();
+            },
+            lexRules: LexRules$1,
+            parseRules: ParseRules$1,
+            editorConfig: { tabSize: config2.tabSize },
+          });
+          return {
+            config: config2,
+            startState: parser.startState,
+            token: parser.token,
+            indent: indent$1,
+            electricInput: /^\s*[}\]]/,
+            fold: "brace",
+            closeBrackets: {
+              pairs: '[]{}""',
+              explode: "[]{}",
+            },
+          };
+        }
+      );
+      function indent$1(state, textAfter) {
+        var _a2, _b;
+        var levels = state.levels;
+        var level =
+          !levels || levels.length === 0
+            ? state.indentLevel
+            : levels[levels.length - 1] -
+              ((
+                (_a2 = this.electricInput) === null || _a2 === void 0
+                  ? void 0
+                  : _a2.test(textAfter)
+              )
+                ? 1
+                : 0);
+        return (
+          (level || 0) *
+          (((_b = this.config) === null || _b === void 0
+            ? void 0
+            : _b.indentUnit) || 0)
+        );
+      }
+      var LexRules$1 = {
+        Punctuation: /^\[|]|\{|\}|:|,/,
+        Number: /^-?(?:0|(?:[1-9][0-9]*))(?:\.[0-9]*)?(?:[eE][+-]?[0-9]+)?/,
+        String: /^"(?:[^"\\]|\\(?:"|\/|\\|b|f|n|r|t|u[0-9a-fA-F]{4}))*"?/,
+        Keyword: /^true|false|null/,
+      };
+      var ParseRules$1 = {
+        Document: [
+          graphql_language_service_1$1.p("{"),
+          graphql_language_service_1$1.list(
+            "Variable",
+            graphql_language_service_1$1.opt(
+              graphql_language_service_1$1.p(",")
+            )
+          ),
+          graphql_language_service_1$1.p("}"),
+        ],
+        Variable: [
+          namedKey("variable"),
+          graphql_language_service_1$1.p(":"),
+          "Value",
+        ],
+        Value: function (token2) {
+          switch (token2.kind) {
+            case "Number":
+              return "NumberValue";
+            case "String":
+              return "StringValue";
+            case "Punctuation":
+              switch (token2.value) {
+                case "[":
+                  return "ListValue";
+                case "{":
+                  return "ObjectValue";
+              }
+              return null;
+            case "Keyword":
+              switch (token2.value) {
+                case "true":
+                case "false":
+                  return "BooleanValue";
+                case "null":
+                  return "NullValue";
+              }
+              return null;
+          }
+        },
+        NumberValue: [graphql_language_service_1$1.t("Number", "number")],
+        StringValue: [graphql_language_service_1$1.t("String", "string")],
+        BooleanValue: [graphql_language_service_1$1.t("Keyword", "builtin")],
+        NullValue: [graphql_language_service_1$1.t("Keyword", "keyword")],
+        ListValue: [
+          graphql_language_service_1$1.p("["),
+          graphql_language_service_1$1.list(
+            "Value",
+            graphql_language_service_1$1.opt(
+              graphql_language_service_1$1.p(",")
+            )
+          ),
+          graphql_language_service_1$1.p("]"),
+        ],
+        ObjectValue: [
+          graphql_language_service_1$1.p("{"),
+          graphql_language_service_1$1.list(
+            "ObjectField",
+            graphql_language_service_1$1.opt(
+              graphql_language_service_1$1.p(",")
+            )
+          ),
+          graphql_language_service_1$1.p("}"),
+        ],
+        ObjectField: [
+          namedKey("attribute"),
+          graphql_language_service_1$1.p(":"),
+          "Value",
+        ],
+      };
+      function namedKey(style) {
+        return {
+          style,
+          match: function (token2) {
+            return token2.kind === "String";
+          },
+          update: function (state, token2) {
+            state.name = token2.value.slice(1, -1);
+          },
+        };
+      }
+      var mode$2 = /* @__PURE__ */ Object.freeze(
+        /* @__PURE__ */ _mergeNamespaces(
+          {
+            __proto__: null,
+            [Symbol.toStringTag]: "Module",
+            default: mode$3,
+          },
+          [mode$3]
+        )
+      );
+      var javascript$2 = { exports: {} };
+      (function (module2, exports) {
+        (function (mod) {
+          mod(codemirror$2.exports);
+        })(function (CodeMirror) {
+          CodeMirror.defineMode("javascript", function (config2, parserConfig) {
+            var indentUnit = config2.indentUnit;
+            var statementIndent = parserConfig.statementIndent;
+            var jsonldMode = parserConfig.jsonld;
+            var jsonMode = parserConfig.json || jsonldMode;
+            var trackScope = parserConfig.trackScope !== false;
+            var isTS = parserConfig.typescript;
+            var wordRE = parserConfig.wordCharacters || /[\w$\xa1-\uffff]/;
+            var keywords = (function () {
+              function kw(type3) {
+                return { type: type3, style: "keyword" };
+              }
+              var A2 = kw("keyword a"),
+                B2 = kw("keyword b"),
+                C2 = kw("keyword c"),
+                D2 = kw("keyword d");
+              var operator = kw("operator"),
+                atom = { type: "atom", style: "atom" };
+              return {
+                if: kw("if"),
+                while: A2,
+                with: A2,
+                else: B2,
+                do: B2,
+                try: B2,
+                finally: B2,
+                return: D2,
+                break: D2,
+                continue: D2,
+                new: kw("new"),
+                delete: C2,
+                void: C2,
+                throw: C2,
+                debugger: kw("debugger"),
+                var: kw("var"),
+                const: kw("var"),
+                let: kw("var"),
+                function: kw("function"),
+                catch: kw("catch"),
+                for: kw("for"),
+                switch: kw("switch"),
+                case: kw("case"),
+                default: kw("default"),
+                in: operator,
+                typeof: operator,
+                instanceof: operator,
+                true: atom,
+                false: atom,
+                null: atom,
+                undefined: atom,
+                NaN: atom,
+                Infinity: atom,
+                this: kw("this"),
+                class: kw("class"),
+                super: kw("atom"),
+                yield: C2,
+                export: kw("export"),
+                import: kw("import"),
+                extends: C2,
+                await: C2,
+              };
+            })();
+            var isOperatorChar = /[+\-*&%=<>!?|~^@]/;
+            var isJsonldKeyword =
+              /^@(context|id|value|language|type|container|list|set|reverse|index|base|vocab|graph)"/;
+            function readRegexp(stream) {
+              var escaped = false,
+                next,
+                inSet = false;
+              while ((next = stream.next()) != null) {
+                if (!escaped) {
+                  if (next == "/" && !inSet) return;
+                  if (next == "[") inSet = true;
+                  else if (inSet && next == "]") inSet = false;
+                }
+                escaped = !escaped && next == "\\";
+              }
+            }
+            var type2, content;
+            function ret(tp, style, cont2) {
+              type2 = tp;
+              content = cont2;
+              return style;
+            }
+            function tokenBase(stream, state) {
+              var ch2 = stream.next();
+              if (ch2 == '"' || ch2 == "'") {
+                state.tokenize = tokenString(ch2);
+                return state.tokenize(stream, state);
+              } else if (
+                ch2 == "." &&
+                stream.match(/^\d[\d_]*(?:[eE][+\-]?[\d_]+)?/)
+              ) {
+                return ret("number", "number");
+              } else if (ch2 == "." && stream.match("..")) {
+                return ret("spread", "meta");
+              } else if (/[\[\]{}\(\),;\:\.]/.test(ch2)) {
+                return ret(ch2);
+              } else if (ch2 == "=" && stream.eat(">")) {
+                return ret("=>", "operator");
+              } else if (
+                ch2 == "0" &&
+                stream.match(/^(?:x[\dA-Fa-f_]+|o[0-7_]+|b[01_]+)n?/)
+              ) {
+                return ret("number", "number");
+              } else if (/\d/.test(ch2)) {
+                stream.match(
+                  /^[\d_]*(?:n|(?:\.[\d_]*)?(?:[eE][+\-]?[\d_]+)?)?/
+                );
+                return ret("number", "number");
+              } else if (ch2 == "/") {
+                if (stream.eat("*")) {
+                  state.tokenize = tokenComment;
+                  return tokenComment(stream, state);
+                } else if (stream.eat("/")) {
+                  stream.skipToEnd();
+                  return ret("comment", "comment");
+                } else if (expressionAllowed(stream, state, 1)) {
+                  readRegexp(stream);
+                  stream.match(/^\b(([gimyus])(?![gimyus]*\2))+\b/);
+                  return ret("regexp", "string-2");
+                } else {
+                  stream.eat("=");
+                  return ret("operator", "operator", stream.current());
+                }
+              } else if (ch2 == "`") {
+                state.tokenize = tokenQuasi;
+                return tokenQuasi(stream, state);
+              } else if (ch2 == "#" && stream.peek() == "!") {
+                stream.skipToEnd();
+                return ret("meta", "meta");
+              } else if (ch2 == "#" && stream.eatWhile(wordRE)) {
+                return ret("variable", "property");
+              } else if (
+                (ch2 == "<" && stream.match("!--")) ||
+                (ch2 == "-" &&
+                  stream.match("->") &&
+                  !/\S/.test(stream.string.slice(0, stream.start)))
+              ) {
+                stream.skipToEnd();
+                return ret("comment", "comment");
+              } else if (isOperatorChar.test(ch2)) {
+                if (ch2 != ">" || !state.lexical || state.lexical.type != ">") {
+                  if (stream.eat("=")) {
+                    if (ch2 == "!" || ch2 == "=") stream.eat("=");
+                  } else if (/[<>*+\-|&?]/.test(ch2)) {
+                    stream.eat(ch2);
+                    if (ch2 == ">") stream.eat(ch2);
+                  }
+                }
+                if (ch2 == "?" && stream.eat(".")) return ret(".");
+                return ret("operator", "operator", stream.current());
+              } else if (wordRE.test(ch2)) {
+                stream.eatWhile(wordRE);
+                var word2 = stream.current();
+                if (state.lastType != ".") {
+                  if (keywords.propertyIsEnumerable(word2)) {
+                    var kw = keywords[word2];
+                    return ret(kw.type, kw.style, word2);
+                  }
+                  if (
+                    word2 == "async" &&
+                    stream.match(
+                      /^(\s|\/\*([^*]|\*(?!\/))*?\*\/)*[\[\(\w]/,
+                      false
+                    )
+                  )
+                    return ret("async", "keyword", word2);
+                }
+                return ret("variable", "variable", word2);
+              }
+            }
+            function tokenString(quote) {
+              return function (stream, state) {
+                var escaped = false,
+                  next;
+                if (
+                  jsonldMode &&
+                  stream.peek() == "@" &&
+                  stream.match(isJsonldKeyword)
+                ) {
+                  state.tokenize = tokenBase;
+                  return ret("jsonld-keyword", "meta");
+                }
+                while ((next = stream.next()) != null) {
+                  if (next == quote && !escaped) break;
+                  escaped = !escaped && next == "\\";
+                }
+                if (!escaped) state.tokenize = tokenBase;
+                return ret("string", "string");
+              };
+            }
+            function tokenComment(stream, state) {
+              var maybeEnd = false,
+                ch2;
+              while ((ch2 = stream.next())) {
+                if (ch2 == "/" && maybeEnd) {
+                  state.tokenize = tokenBase;
+                  break;
+                }
+                maybeEnd = ch2 == "*";
+              }
+              return ret("comment", "comment");
+            }
+            function tokenQuasi(stream, state) {
+              var escaped = false,
+                next;
+              while ((next = stream.next()) != null) {
+                if (
+                  !escaped &&
+                  (next == "`" || (next == "$" && stream.eat("{")))
+                ) {
+                  state.tokenize = tokenBase;
+                  break;
+                }
+                escaped = !escaped && next == "\\";
+              }
+              return ret("quasi", "string-2", stream.current());
+            }
+            var brackets = "([{}])";
+            function findFatArrow(stream, state) {
+              if (state.fatArrowAt) state.fatArrowAt = null;
+              var arrow = stream.string.indexOf("=>", stream.start);
+              if (arrow < 0) return;
+              if (isTS) {
+                var m = /:\s*(?:\w+(?:<[^>]*>|\[\])?|\{[^}]*\})\s*$/.exec(
+                  stream.string.slice(stream.start, arrow)
+                );
+                if (m) arrow = m.index;
+              }
+              var depth = 0,
+                sawSomething = false;
+              for (var pos = arrow - 1; pos >= 0; --pos) {
+                var ch2 = stream.string.charAt(pos);
+                var bracket = brackets.indexOf(ch2);
+                if (bracket >= 0 && bracket < 3) {
+                  if (!depth) {
+                    ++pos;
+                    break;
+                  }
+                  if (--depth == 0) {
+                    if (ch2 == "(") sawSomething = true;
+                    break;
+                  }
+                } else if (bracket >= 3 && bracket < 6) {
+                  ++depth;
+                } else if (wordRE.test(ch2)) {
+                  sawSomething = true;
+                } else if (/["'\/`]/.test(ch2)) {
+                  for (; ; --pos) {
+                    if (pos == 0) return;
+                    var next = stream.string.charAt(pos - 1);
+                    if (next == ch2 && stream.string.charAt(pos - 2) != "\\") {
+                      pos--;
+                      break;
+                    }
+                  }
+                } else if (sawSomething && !depth) {
+                  ++pos;
+                  break;
+                }
+              }
+              if (sawSomething && !depth) state.fatArrowAt = pos;
+            }
+            var atomicTypes = {
+              atom: true,
+              number: true,
+              variable: true,
+              string: true,
+              regexp: true,
+              this: true,
+              import: true,
+              "jsonld-keyword": true,
+            };
+            function JSLexical(indented, column, type3, align, prev, info2) {
+              this.indented = indented;
+              this.column = column;
+              this.type = type3;
+              this.prev = prev;
+              this.info = info2;
+              if (align != null) this.align = align;
+            }
+            function inScope(state, varname) {
+              if (!trackScope) return false;
+              for (var v2 = state.localVars; v2; v2 = v2.next)
+                if (v2.name == varname) return true;
+              for (var cx2 = state.context; cx2; cx2 = cx2.prev) {
+                for (var v2 = cx2.vars; v2; v2 = v2.next)
+                  if (v2.name == varname) return true;
+              }
+            }
+            function parseJS(state, style, type3, content2, stream) {
+              var cc2 = state.cc;
+              cx.state = state;
+              cx.stream = stream;
+              (cx.marked = null), (cx.cc = cc2);
+              cx.style = style;
+              if (!state.lexical.hasOwnProperty("align"))
+                state.lexical.align = true;
+              while (true) {
+                var combinator = cc2.length
+                  ? cc2.pop()
+                  : jsonMode
+                  ? expression
+                  : statement;
+                if (combinator(type3, content2)) {
+                  while (cc2.length && cc2[cc2.length - 1].lex) cc2.pop()();
+                  if (cx.marked) return cx.marked;
+                  if (type3 == "variable" && inScope(state, content2))
+                    return "variable-2";
+                  return style;
+                }
+              }
+            }
+            var cx = { state: null, column: null, marked: null, cc: null };
+            function pass() {
+              for (var i = arguments.length - 1; i >= 0; i--)
+                cx.cc.push(arguments[i]);
+            }
+            function cont() {
+              pass.apply(null, arguments);
+              return true;
+            }
+            function inList(name2, list3) {
+              for (var v2 = list3; v2; v2 = v2.next)
+                if (v2.name == name2) return true;
+              return false;
+            }
+            function register(varname) {
+              var state = cx.state;
+              cx.marked = "def";
+              if (!trackScope) return;
+              if (state.context) {
+                if (
+                  state.lexical.info == "var" &&
+                  state.context &&
+                  state.context.block
+                ) {
+                  var newContext = registerVarScoped(varname, state.context);
+                  if (newContext != null) {
+                    state.context = newContext;
+                    return;
+                  }
+                } else if (!inList(varname, state.localVars)) {
+                  state.localVars = new Var(varname, state.localVars);
+                  return;
+                }
+              }
+              if (parserConfig.globalVars && !inList(varname, state.globalVars))
+                state.globalVars = new Var(varname, state.globalVars);
+            }
+            function registerVarScoped(varname, context) {
+              if (!context) {
+                return null;
+              } else if (context.block) {
+                var inner = registerVarScoped(varname, context.prev);
+                if (!inner) return null;
+                if (inner == context.prev) return context;
+                return new Context(inner, context.vars, true);
+              } else if (inList(varname, context.vars)) {
+                return context;
+              } else {
+                return new Context(
+                  context.prev,
+                  new Var(varname, context.vars),
+                  false
+                );
+              }
+            }
+            function isModifier(name2) {
+              return (
+                name2 == "public" ||
+                name2 == "private" ||
+                name2 == "protected" ||
+                name2 == "abstract" ||
+                name2 == "readonly"
+              );
+            }
+            function Context(prev, vars, block4) {
+              this.prev = prev;
+              this.vars = vars;
+              this.block = block4;
+            }
+            function Var(name2, next) {
+              this.name = name2;
+              this.next = next;
+            }
+            var defaultVars = new Var("this", new Var("arguments", null));
+            function pushcontext() {
+              cx.state.context = new Context(
+                cx.state.context,
+                cx.state.localVars,
+                false
+              );
+              cx.state.localVars = defaultVars;
+            }
+            function pushblockcontext() {
+              cx.state.context = new Context(
+                cx.state.context,
+                cx.state.localVars,
+                true
+              );
+              cx.state.localVars = null;
+            }
+            pushcontext.lex = pushblockcontext.lex = true;
+            function popcontext() {
+              cx.state.localVars = cx.state.context.vars;
+              cx.state.context = cx.state.context.prev;
+            }
+            popcontext.lex = true;
+            function pushlex(type3, info2) {
+              var result2 = function () {
+                var state = cx.state,
+                  indent2 = state.indented;
+                if (state.lexical.type == "stat")
+                  indent2 = state.lexical.indented;
+                else
+                  for (
+                    var outer = state.lexical;
+                    outer && outer.type == ")" && outer.align;
+                    outer = outer.prev
+                  )
+                    indent2 = outer.indented;
+                state.lexical = new JSLexical(
+                  indent2,
+                  cx.stream.column(),
+                  type3,
+                  null,
+                  state.lexical,
+                  info2
+                );
+              };
+              result2.lex = true;
+              return result2;
+            }
+            function poplex() {
+              var state = cx.state;
+              if (state.lexical.prev) {
+                if (state.lexical.type == ")")
+                  state.indented = state.lexical.indented;
+                state.lexical = state.lexical.prev;
+              }
+            }
+            poplex.lex = true;
+            function expect2(wanted) {
+              function exp(type3) {
+                if (type3 == wanted) return cont();
+                else if (
+                  wanted == ";" ||
+                  type3 == "}" ||
+                  type3 == ")" ||
+                  type3 == "]"
+                )
+                  return pass();
+                else return cont(exp);
+              }
+              return exp;
+            }
+            function statement(type3, value) {
+              if (type3 == "var")
+                return cont(
+                  pushlex("vardef", value),
+                  vardef,
+                  expect2(";"),
+                  poplex
+                );
+              if (type3 == "keyword a")
+                return cont(pushlex("form"), parenExpr, statement, poplex);
+              if (type3 == "keyword b")
+                return cont(pushlex("form"), statement, poplex);
+              if (type3 == "keyword d")
+                return cx.stream.match(/^\s*$/, false)
+                  ? cont()
+                  : cont(
+                      pushlex("stat"),
+                      maybeexpression,
+                      expect2(";"),
+                      poplex
+                    );
+              if (type3 == "debugger") return cont(expect2(";"));
+              if (type3 == "{")
+                return cont(
+                  pushlex("}"),
+                  pushblockcontext,
+                  block3,
+                  poplex,
+                  popcontext
+                );
+              if (type3 == ";") return cont();
+              if (type3 == "if") {
+                if (
+                  cx.state.lexical.info == "else" &&
+                  cx.state.cc[cx.state.cc.length - 1] == poplex
+                )
+                  cx.state.cc.pop()();
+                return cont(
+                  pushlex("form"),
+                  parenExpr,
+                  statement,
+                  poplex,
+                  maybeelse
+                );
+              }
+              if (type3 == "function") return cont(functiondef);
+              if (type3 == "for")
+                return cont(
+                  pushlex("form"),
+                  pushblockcontext,
+                  forspec,
+                  statement,
+                  popcontext,
+                  poplex
+                );
+              if (type3 == "class" || (isTS && value == "interface")) {
+                cx.marked = "keyword";
+                return cont(
+                  pushlex("form", type3 == "class" ? type3 : value),
+                  className,
+                  poplex
+                );
+              }
+              if (type3 == "variable") {
+                if (isTS && value == "declare") {
+                  cx.marked = "keyword";
+                  return cont(statement);
+                } else if (
+                  isTS &&
+                  (value == "module" || value == "enum" || value == "type") &&
+                  cx.stream.match(/^\s*\w/, false)
+                ) {
+                  cx.marked = "keyword";
+                  if (value == "enum") return cont(enumdef);
+                  else if (value == "type")
+                    return cont(
+                      typename,
+                      expect2("operator"),
+                      typeexpr,
+                      expect2(";")
+                    );
+                  else
+                    return cont(
+                      pushlex("form"),
+                      pattern,
+                      expect2("{"),
+                      pushlex("}"),
+                      block3,
+                      poplex,
+                      poplex
+                    );
+                } else if (isTS && value == "namespace") {
+                  cx.marked = "keyword";
+                  return cont(pushlex("form"), expression, statement, poplex);
+                } else if (isTS && value == "abstract") {
+                  cx.marked = "keyword";
+                  return cont(statement);
+                } else {
+                  return cont(pushlex("stat"), maybelabel);
+                }
+              }
+              if (type3 == "switch")
+                return cont(
+                  pushlex("form"),
+                  parenExpr,
+                  expect2("{"),
+                  pushlex("}", "switch"),
+                  pushblockcontext,
+                  block3,
+                  poplex,
+                  poplex,
+                  popcontext
+                );
+              if (type3 == "case") return cont(expression, expect2(":"));
+              if (type3 == "default") return cont(expect2(":"));
+              if (type3 == "catch")
+                return cont(
+                  pushlex("form"),
+                  pushcontext,
+                  maybeCatchBinding,
+                  statement,
+                  poplex,
+                  popcontext
+                );
+              if (type3 == "export")
+                return cont(pushlex("stat"), afterExport, poplex);
+              if (type3 == "import")
+                return cont(pushlex("stat"), afterImport, poplex);
+              if (type3 == "async") return cont(statement);
+              if (value == "@") return cont(expression, statement);
+              return pass(pushlex("stat"), expression, expect2(";"), poplex);
+            }
+            function maybeCatchBinding(type3) {
+              if (type3 == "(") return cont(funarg, expect2(")"));
+            }
+            function expression(type3, value) {
+              return expressionInner(type3, value, false);
+            }
+            function expressionNoComma(type3, value) {
+              return expressionInner(type3, value, true);
+            }
+            function parenExpr(type3) {
+              if (type3 != "(") return pass();
+              return cont(pushlex(")"), maybeexpression, expect2(")"), poplex);
+            }
+            function expressionInner(type3, value, noComma) {
+              if (cx.state.fatArrowAt == cx.stream.start) {
+                var body = noComma ? arrowBodyNoComma : arrowBody;
+                if (type3 == "(")
+                  return cont(
+                    pushcontext,
+                    pushlex(")"),
+                    commasep(funarg, ")"),
+                    poplex,
+                    expect2("=>"),
+                    body,
+                    popcontext
+                  );
+                else if (type3 == "variable")
+                  return pass(
+                    pushcontext,
+                    pattern,
+                    expect2("=>"),
+                    body,
+                    popcontext
+                  );
+              }
+              var maybeop = noComma ? maybeoperatorNoComma : maybeoperatorComma;
+              if (atomicTypes.hasOwnProperty(type3)) return cont(maybeop);
+              if (type3 == "function") return cont(functiondef, maybeop);
+              if (type3 == "class" || (isTS && value == "interface")) {
+                cx.marked = "keyword";
+                return cont(pushlex("form"), classExpression, poplex);
+              }
+              if (type3 == "keyword c" || type3 == "async")
+                return cont(noComma ? expressionNoComma : expression);
+              if (type3 == "(")
+                return cont(
+                  pushlex(")"),
+                  maybeexpression,
+                  expect2(")"),
+                  poplex,
+                  maybeop
+                );
+              if (type3 == "operator" || type3 == "spread")
+                return cont(noComma ? expressionNoComma : expression);
+              if (type3 == "[")
+                return cont(pushlex("]"), arrayLiteral, poplex, maybeop);
+              if (type3 == "{")
+                return contCommasep(objprop, "}", null, maybeop);
+              if (type3 == "quasi") return pass(quasi, maybeop);
+              if (type3 == "new") return cont(maybeTarget(noComma));
+              return cont();
+            }
+            function maybeexpression(type3) {
+              if (type3.match(/[;\}\)\],]/)) return pass();
+              return pass(expression);
+            }
+            function maybeoperatorComma(type3, value) {
+              if (type3 == ",") return cont(maybeexpression);
+              return maybeoperatorNoComma(type3, value, false);
+            }
+            function maybeoperatorNoComma(type3, value, noComma) {
+              var me2 =
+                noComma == false ? maybeoperatorComma : maybeoperatorNoComma;
+              var expr = noComma == false ? expression : expressionNoComma;
+              if (type3 == "=>")
+                return cont(
+                  pushcontext,
+                  noComma ? arrowBodyNoComma : arrowBody,
+                  popcontext
+                );
+              if (type3 == "operator") {
+                if (/\+\+|--/.test(value) || (isTS && value == "!"))
+                  return cont(me2);
+                if (
+                  isTS &&
+                  value == "<" &&
+                  cx.stream.match(/^([^<>]|<[^<>]*>)*>\s*\(/, false)
+                )
+                  return cont(
+                    pushlex(">"),
+                    commasep(typeexpr, ">"),
+                    poplex,
+                    me2
+                  );
+                if (value == "?") return cont(expression, expect2(":"), expr);
+                return cont(expr);
+              }
+              if (type3 == "quasi") {
+                return pass(quasi, me2);
+              }
+              if (type3 == ";") return;
+              if (type3 == "(")
+                return contCommasep(expressionNoComma, ")", "call", me2);
+              if (type3 == ".") return cont(property, me2);
+              if (type3 == "[")
+                return cont(
+                  pushlex("]"),
+                  maybeexpression,
+                  expect2("]"),
+                  poplex,
+                  me2
+                );
+              if (isTS && value == "as") {
+                cx.marked = "keyword";
+                return cont(typeexpr, me2);
+              }
+              if (type3 == "regexp") {
+                cx.state.lastType = cx.marked = "operator";
+                cx.stream.backUp(cx.stream.pos - cx.stream.start - 1);
+                return cont(expr);
+              }
+            }
+            function quasi(type3, value) {
+              if (type3 != "quasi") return pass();
+              if (value.slice(value.length - 2) != "${") return cont(quasi);
+              return cont(maybeexpression, continueQuasi);
+            }
+            function continueQuasi(type3) {
+              if (type3 == "}") {
+                cx.marked = "string-2";
+                cx.state.tokenize = tokenQuasi;
+                return cont(quasi);
+              }
+            }
+            function arrowBody(type3) {
+              findFatArrow(cx.stream, cx.state);
+              return pass(type3 == "{" ? statement : expression);
+            }
+            function arrowBodyNoComma(type3) {
+              findFatArrow(cx.stream, cx.state);
+              return pass(type3 == "{" ? statement : expressionNoComma);
+            }
+            function maybeTarget(noComma) {
+              return function (type3) {
+                if (type3 == ".")
+                  return cont(noComma ? targetNoComma : target2);
+                else if (type3 == "variable" && isTS)
+                  return cont(
+                    maybeTypeArgs,
+                    noComma ? maybeoperatorNoComma : maybeoperatorComma
+                  );
+                else return pass(noComma ? expressionNoComma : expression);
+              };
+            }
+            function target2(_, value) {
+              if (value == "target") {
+                cx.marked = "keyword";
+                return cont(maybeoperatorComma);
+              }
+            }
+            function targetNoComma(_, value) {
+              if (value == "target") {
+                cx.marked = "keyword";
+                return cont(maybeoperatorNoComma);
+              }
+            }
+            function maybelabel(type3) {
+              if (type3 == ":") return cont(poplex, statement);
+              return pass(maybeoperatorComma, expect2(";"), poplex);
+            }
+            function property(type3) {
+              if (type3 == "variable") {
+                cx.marked = "property";
+                return cont();
+              }
+            }
+            function objprop(type3, value) {
+              if (type3 == "async") {
+                cx.marked = "property";
+                return cont(objprop);
+              } else if (type3 == "variable" || cx.style == "keyword") {
+                cx.marked = "property";
+                if (value == "get" || value == "set") return cont(getterSetter);
+                var m;
+                if (
+                  isTS &&
+                  cx.state.fatArrowAt == cx.stream.start &&
+                  (m = cx.stream.match(/^\s*:\s*/, false))
+                )
+                  cx.state.fatArrowAt = cx.stream.pos + m[0].length;
+                return cont(afterprop);
+              } else if (type3 == "number" || type3 == "string") {
+                cx.marked = jsonldMode ? "property" : cx.style + " property";
+                return cont(afterprop);
+              } else if (type3 == "jsonld-keyword") {
+                return cont(afterprop);
+              } else if (isTS && isModifier(value)) {
+                cx.marked = "keyword";
+                return cont(objprop);
+              } else if (type3 == "[") {
+                return cont(expression, maybetype, expect2("]"), afterprop);
+              } else if (type3 == "spread") {
+                return cont(expressionNoComma, afterprop);
+              } else if (value == "*") {
+                cx.marked = "keyword";
+                return cont(objprop);
+              } else if (type3 == ":") {
+                return pass(afterprop);
+              }
+            }
+            function getterSetter(type3) {
+              if (type3 != "variable") return pass(afterprop);
+              cx.marked = "property";
+              return cont(functiondef);
+            }
+            function afterprop(type3) {
+              if (type3 == ":") return cont(expressionNoComma);
+              if (type3 == "(") return pass(functiondef);
+            }
+            function commasep(what, end2, sep) {
+              function proceed(type3, value) {
+                if (sep ? sep.indexOf(type3) > -1 : type3 == ",") {
+                  var lex2 = cx.state.lexical;
+                  if (lex2.info == "call") lex2.pos = (lex2.pos || 0) + 1;
+                  return cont(function (type4, value2) {
+                    if (type4 == end2 || value2 == end2) return pass();
+                    return pass(what);
+                  }, proceed);
+                }
+                if (type3 == end2 || value == end2) return cont();
+                if (sep && sep.indexOf(";") > -1) return pass(what);
+                return cont(expect2(end2));
+              }
+              return function (type3, value) {
+                if (type3 == end2 || value == end2) return cont();
+                return pass(what, proceed);
+              };
+            }
+            function contCommasep(what, end2, info2) {
+              for (var i = 3; i < arguments.length; i++)
+                cx.cc.push(arguments[i]);
+              return cont(pushlex(end2, info2), commasep(what, end2), poplex);
+            }
+            function block3(type3) {
+              if (type3 == "}") return cont();
+              return pass(statement, block3);
+            }
+            function maybetype(type3, value) {
+              if (isTS) {
+                if (type3 == ":") return cont(typeexpr);
+                if (value == "?") return cont(maybetype);
+              }
+            }
+            function maybetypeOrIn(type3, value) {
+              if (isTS && (type3 == ":" || value == "in"))
+                return cont(typeexpr);
+            }
+            function mayberettype(type3) {
+              if (isTS && type3 == ":") {
+                if (cx.stream.match(/^\s*\w+\s+is\b/, false))
+                  return cont(expression, isKW, typeexpr);
+                else return cont(typeexpr);
+              }
+            }
+            function isKW(_, value) {
+              if (value == "is") {
+                cx.marked = "keyword";
+                return cont();
+              }
+            }
+            function typeexpr(type3, value) {
+              if (
+                value == "keyof" ||
+                value == "typeof" ||
+                value == "infer" ||
+                value == "readonly"
+              ) {
+                cx.marked = "keyword";
+                return cont(value == "typeof" ? expressionNoComma : typeexpr);
+              }
+              if (type3 == "variable" || value == "void") {
+                cx.marked = "type";
+                return cont(afterType);
+              }
+              if (value == "|" || value == "&") return cont(typeexpr);
+              if (type3 == "string" || type3 == "number" || type3 == "atom")
+                return cont(afterType);
+              if (type3 == "[")
+                return cont(
+                  pushlex("]"),
+                  commasep(typeexpr, "]", ","),
+                  poplex,
+                  afterType
+                );
+              if (type3 == "{")
+                return cont(pushlex("}"), typeprops, poplex, afterType);
+              if (type3 == "(")
+                return cont(commasep(typearg, ")"), maybeReturnType, afterType);
+              if (type3 == "<") return cont(commasep(typeexpr, ">"), typeexpr);
+              if (type3 == "quasi") {
+                return pass(quasiType, afterType);
+              }
+            }
+            function maybeReturnType(type3) {
+              if (type3 == "=>") return cont(typeexpr);
+            }
+            function typeprops(type3) {
+              if (type3.match(/[\}\)\]]/)) return cont();
+              if (type3 == "," || type3 == ";") return cont(typeprops);
+              return pass(typeprop, typeprops);
+            }
+            function typeprop(type3, value) {
+              if (type3 == "variable" || cx.style == "keyword") {
+                cx.marked = "property";
+                return cont(typeprop);
+              } else if (
+                value == "?" ||
+                type3 == "number" ||
+                type3 == "string"
+              ) {
+                return cont(typeprop);
+              } else if (type3 == ":") {
+                return cont(typeexpr);
+              } else if (type3 == "[") {
+                return cont(
+                  expect2("variable"),
+                  maybetypeOrIn,
+                  expect2("]"),
+                  typeprop
+                );
+              } else if (type3 == "(") {
+                return pass(functiondecl, typeprop);
+              } else if (!type3.match(/[;\}\)\],]/)) {
+                return cont();
+              }
+            }
+            function quasiType(type3, value) {
+              if (type3 != "quasi") return pass();
+              if (value.slice(value.length - 2) != "${") return cont(quasiType);
+              return cont(typeexpr, continueQuasiType);
+            }
+            function continueQuasiType(type3) {
+              if (type3 == "}") {
+                cx.marked = "string-2";
+                cx.state.tokenize = tokenQuasi;
+                return cont(quasiType);
+              }
+            }
+            function typearg(type3, value) {
+              if (
+                (type3 == "variable" && cx.stream.match(/^\s*[?:]/, false)) ||
+                value == "?"
+              )
+                return cont(typearg);
+              if (type3 == ":") return cont(typeexpr);
+              if (type3 == "spread") return cont(typearg);
+              return pass(typeexpr);
+            }
+            function afterType(type3, value) {
+              if (value == "<")
+                return cont(
+                  pushlex(">"),
+                  commasep(typeexpr, ">"),
+                  poplex,
+                  afterType
+                );
+              if (value == "|" || type3 == "." || value == "&")
+                return cont(typeexpr);
+              if (type3 == "[") return cont(typeexpr, expect2("]"), afterType);
+              if (value == "extends" || value == "implements") {
+                cx.marked = "keyword";
+                return cont(typeexpr);
+              }
+              if (value == "?") return cont(typeexpr, expect2(":"), typeexpr);
+            }
+            function maybeTypeArgs(_, value) {
+              if (value == "<")
+                return cont(
+                  pushlex(">"),
+                  commasep(typeexpr, ">"),
+                  poplex,
+                  afterType
+                );
+            }
+            function typeparam() {
+              return pass(typeexpr, maybeTypeDefault);
+            }
+            function maybeTypeDefault(_, value) {
+              if (value == "=") return cont(typeexpr);
+            }
+            function vardef(_, value) {
+              if (value == "enum") {
+                cx.marked = "keyword";
+                return cont(enumdef);
+              }
+              return pass(pattern, maybetype, maybeAssign, vardefCont);
+            }
+            function pattern(type3, value) {
+              if (isTS && isModifier(value)) {
+                cx.marked = "keyword";
+                return cont(pattern);
+              }
+              if (type3 == "variable") {
+                register(value);
+                return cont();
+              }
+              if (type3 == "spread") return cont(pattern);
+              if (type3 == "[") return contCommasep(eltpattern, "]");
+              if (type3 == "{") return contCommasep(proppattern, "}");
+            }
+            function proppattern(type3, value) {
+              if (type3 == "variable" && !cx.stream.match(/^\s*:/, false)) {
+                register(value);
+                return cont(maybeAssign);
+              }
+              if (type3 == "variable") cx.marked = "property";
+              if (type3 == "spread") return cont(pattern);
+              if (type3 == "}") return pass();
+              if (type3 == "[")
+                return cont(
+                  expression,
+                  expect2("]"),
+                  expect2(":"),
+                  proppattern
+                );
+              return cont(expect2(":"), pattern, maybeAssign);
+            }
+            function eltpattern() {
+              return pass(pattern, maybeAssign);
+            }
+            function maybeAssign(_type, value) {
+              if (value == "=") return cont(expressionNoComma);
+            }
+            function vardefCont(type3) {
+              if (type3 == ",") return cont(vardef);
+            }
+            function maybeelse(type3, value) {
+              if (type3 == "keyword b" && value == "else")
+                return cont(pushlex("form", "else"), statement, poplex);
+            }
+            function forspec(type3, value) {
+              if (value == "await") return cont(forspec);
+              if (type3 == "(") return cont(pushlex(")"), forspec1, poplex);
+            }
+            function forspec1(type3) {
+              if (type3 == "var") return cont(vardef, forspec2);
+              if (type3 == "variable") return cont(forspec2);
+              return pass(forspec2);
+            }
+            function forspec2(type3, value) {
+              if (type3 == ")") return cont();
+              if (type3 == ";") return cont(forspec2);
+              if (value == "in" || value == "of") {
+                cx.marked = "keyword";
+                return cont(expression, forspec2);
+              }
+              return pass(expression, forspec2);
+            }
+            function functiondef(type3, value) {
+              if (value == "*") {
+                cx.marked = "keyword";
+                return cont(functiondef);
+              }
+              if (type3 == "variable") {
+                register(value);
+                return cont(functiondef);
+              }
+              if (type3 == "(")
+                return cont(
+                  pushcontext,
+                  pushlex(")"),
+                  commasep(funarg, ")"),
+                  poplex,
+                  mayberettype,
+                  statement,
+                  popcontext
+                );
+              if (isTS && value == "<")
+                return cont(
+                  pushlex(">"),
+                  commasep(typeparam, ">"),
+                  poplex,
+                  functiondef
+                );
+            }
+            function functiondecl(type3, value) {
+              if (value == "*") {
+                cx.marked = "keyword";
+                return cont(functiondecl);
+              }
+              if (type3 == "variable") {
+                register(value);
+                return cont(functiondecl);
+              }
+              if (type3 == "(")
+                return cont(
+                  pushcontext,
+                  pushlex(")"),
+                  commasep(funarg, ")"),
+                  poplex,
+                  mayberettype,
+                  popcontext
+                );
+              if (isTS && value == "<")
+                return cont(
+                  pushlex(">"),
+                  commasep(typeparam, ">"),
+                  poplex,
+                  functiondecl
+                );
+            }
+            function typename(type3, value) {
+              if (type3 == "keyword" || type3 == "variable") {
+                cx.marked = "type";
+                return cont(typename);
+              } else if (value == "<") {
+                return cont(pushlex(">"), commasep(typeparam, ">"), poplex);
+              }
+            }
+            function funarg(type3, value) {
+              if (value == "@") cont(expression, funarg);
+              if (type3 == "spread") return cont(funarg);
+              if (isTS && isModifier(value)) {
+                cx.marked = "keyword";
+                return cont(funarg);
+              }
+              if (isTS && type3 == "this") return cont(maybetype, maybeAssign);
+              return pass(pattern, maybetype, maybeAssign);
+            }
+            function classExpression(type3, value) {
+              if (type3 == "variable") return className(type3, value);
+              return classNameAfter(type3, value);
+            }
+            function className(type3, value) {
+              if (type3 == "variable") {
+                register(value);
+                return cont(classNameAfter);
+              }
+            }
+            function classNameAfter(type3, value) {
+              if (value == "<")
+                return cont(
+                  pushlex(">"),
+                  commasep(typeparam, ">"),
+                  poplex,
+                  classNameAfter
+                );
+              if (
+                value == "extends" ||
+                value == "implements" ||
+                (isTS && type3 == ",")
+              ) {
+                if (value == "implements") cx.marked = "keyword";
+                return cont(isTS ? typeexpr : expression, classNameAfter);
+              }
+              if (type3 == "{") return cont(pushlex("}"), classBody, poplex);
+            }
+            function classBody(type3, value) {
+              if (
+                type3 == "async" ||
+                (type3 == "variable" &&
+                  (value == "static" ||
+                    value == "get" ||
+                    value == "set" ||
+                    (isTS && isModifier(value))) &&
+                  cx.stream.match(/^\s+[\w$\xa1-\uffff]/, false))
+              ) {
+                cx.marked = "keyword";
+                return cont(classBody);
+              }
+              if (type3 == "variable" || cx.style == "keyword") {
+                cx.marked = "property";
+                return cont(classfield, classBody);
+              }
+              if (type3 == "number" || type3 == "string")
+                return cont(classfield, classBody);
+              if (type3 == "[")
+                return cont(
+                  expression,
+                  maybetype,
+                  expect2("]"),
+                  classfield,
+                  classBody
+                );
+              if (value == "*") {
+                cx.marked = "keyword";
+                return cont(classBody);
+              }
+              if (isTS && type3 == "(") return pass(functiondecl, classBody);
+              if (type3 == ";" || type3 == ",") return cont(classBody);
+              if (type3 == "}") return cont();
+              if (value == "@") return cont(expression, classBody);
+            }
+            function classfield(type3, value) {
+              if (value == "!") return cont(classfield);
+              if (value == "?") return cont(classfield);
+              if (type3 == ":") return cont(typeexpr, maybeAssign);
+              if (value == "=") return cont(expressionNoComma);
+              var context = cx.state.lexical.prev,
+                isInterface = context && context.info == "interface";
+              return pass(isInterface ? functiondecl : functiondef);
+            }
+            function afterExport(type3, value) {
+              if (value == "*") {
+                cx.marked = "keyword";
+                return cont(maybeFrom, expect2(";"));
+              }
+              if (value == "default") {
+                cx.marked = "keyword";
+                return cont(expression, expect2(";"));
+              }
+              if (type3 == "{")
+                return cont(
+                  commasep(exportField, "}"),
+                  maybeFrom,
+                  expect2(";")
+                );
+              return pass(statement);
+            }
+            function exportField(type3, value) {
+              if (value == "as") {
+                cx.marked = "keyword";
+                return cont(expect2("variable"));
+              }
+              if (type3 == "variable")
+                return pass(expressionNoComma, exportField);
+            }
+            function afterImport(type3) {
+              if (type3 == "string") return cont();
+              if (type3 == "(") return pass(expression);
+              if (type3 == ".") return pass(maybeoperatorComma);
+              return pass(importSpec, maybeMoreImports, maybeFrom);
+            }
+            function importSpec(type3, value) {
+              if (type3 == "{") return contCommasep(importSpec, "}");
+              if (type3 == "variable") register(value);
+              if (value == "*") cx.marked = "keyword";
+              return cont(maybeAs);
+            }
+            function maybeMoreImports(type3) {
+              if (type3 == ",") return cont(importSpec, maybeMoreImports);
+            }
+            function maybeAs(_type, value) {
+              if (value == "as") {
+                cx.marked = "keyword";
+                return cont(importSpec);
+              }
+            }
+            function maybeFrom(_type, value) {
+              if (value == "from") {
+                cx.marked = "keyword";
+                return cont(expression);
+              }
+            }
+            function arrayLiteral(type3) {
+              if (type3 == "]") return cont();
+              return pass(commasep(expressionNoComma, "]"));
+            }
+            function enumdef() {
+              return pass(
+                pushlex("form"),
+                pattern,
+                expect2("{"),
+                pushlex("}"),
+                commasep(enummember, "}"),
+                poplex,
+                poplex
+              );
+            }
+            function enummember() {
+              return pass(pattern, maybeAssign);
+            }
+            function isContinuedStatement(state, textAfter) {
+              return (
+                state.lastType == "operator" ||
+                state.lastType == "," ||
+                isOperatorChar.test(textAfter.charAt(0)) ||
+                /[,.]/.test(textAfter.charAt(0))
+              );
+            }
+            function expressionAllowed(stream, state, backUp) {
+              return (
+                (state.tokenize == tokenBase &&
+                  /^(?:operator|sof|keyword [bcd]|case|new|export|default|spread|[\[{}\(,;:]|=>)$/.test(
+                    state.lastType
+                  )) ||
+                (state.lastType == "quasi" &&
+                  /\{\s*$/.test(
+                    stream.string.slice(0, stream.pos - (backUp || 0))
+                  ))
+              );
+            }
+            return {
+              startState: function (basecolumn) {
+                var state = {
+                  tokenize: tokenBase,
+                  lastType: "sof",
+                  cc: [],
+                  lexical: new JSLexical(
+                    (basecolumn || 0) - indentUnit,
+                    0,
+                    "block",
+                    false
+                  ),
+                  localVars: parserConfig.localVars,
+                  context:
+                    parserConfig.localVars && new Context(null, null, false),
+                  indented: basecolumn || 0,
+                };
+                if (
+                  parserConfig.globalVars &&
+                  typeof parserConfig.globalVars == "object"
+                )
+                  state.globalVars = parserConfig.globalVars;
+                return state;
+              },
+              token: function (stream, state) {
+                if (stream.sol()) {
+                  if (!state.lexical.hasOwnProperty("align"))
+                    state.lexical.align = false;
+                  state.indented = stream.indentation();
+                  findFatArrow(stream, state);
+                }
+                if (state.tokenize != tokenComment && stream.eatSpace())
+                  return null;
+                var style = state.tokenize(stream, state);
+                if (type2 == "comment") return style;
+                state.lastType =
+                  type2 == "operator" && (content == "++" || content == "--")
+                    ? "incdec"
+                    : type2;
+                return parseJS(state, style, type2, content, stream);
+              },
+              indent: function (state, textAfter) {
+                if (
+                  state.tokenize == tokenComment ||
+                  state.tokenize == tokenQuasi
+                )
+                  return CodeMirror.Pass;
+                if (state.tokenize != tokenBase) return 0;
+                var firstChar = textAfter && textAfter.charAt(0),
+                  lexical = state.lexical,
+                  top2;
+                if (!/^\s*else\b/.test(textAfter))
+                  for (var i = state.cc.length - 1; i >= 0; --i) {
+                    var c = state.cc[i];
+                    if (c == poplex) lexical = lexical.prev;
+                    else if (c != maybeelse && c != popcontext) break;
+                  }
+                while (
+                  (lexical.type == "stat" || lexical.type == "form") &&
+                  (firstChar == "}" ||
+                    ((top2 = state.cc[state.cc.length - 1]) &&
+                      (top2 == maybeoperatorComma ||
+                        top2 == maybeoperatorNoComma) &&
+                      !/^[,\.=+\-*:?[\(]/.test(textAfter)))
+                )
+                  lexical = lexical.prev;
+                if (
+                  statementIndent &&
+                  lexical.type == ")" &&
+                  lexical.prev.type == "stat"
+                )
+                  lexical = lexical.prev;
+                var type3 = lexical.type,
+                  closing = firstChar == type3;
+                if (type3 == "vardef")
+                  return (
+                    lexical.indented +
+                    (state.lastType == "operator" || state.lastType == ","
+                      ? lexical.info.length + 1
+                      : 0)
+                  );
+                else if (type3 == "form" && firstChar == "{")
+                  return lexical.indented;
+                else if (type3 == "form") return lexical.indented + indentUnit;
+                else if (type3 == "stat")
+                  return (
+                    lexical.indented +
+                    (isContinuedStatement(state, textAfter)
+                      ? statementIndent || indentUnit
+                      : 0)
+                  );
+                else if (
+                  lexical.info == "switch" &&
+                  !closing &&
+                  parserConfig.doubleIndentSwitch != false
+                )
+                  return (
+                    lexical.indented +
+                    (/^(?:case|default)\b/.test(textAfter)
+                      ? indentUnit
+                      : 2 * indentUnit)
+                  );
+                else if (lexical.align)
+                  return lexical.column + (closing ? 0 : 1);
+                else return lexical.indented + (closing ? 0 : indentUnit);
+              },
+              electricInput: /^\s*(?:case .*?:|default:|\{|\})$/,
+              blockCommentStart: jsonMode ? null : "/*",
+              blockCommentEnd: jsonMode ? null : "*/",
+              blockCommentContinue: jsonMode ? null : " * ",
+              lineComment: jsonMode ? null : "//",
+              fold: "brace",
+              closeBrackets: "()[]{}''\"\"``",
+              helperType: jsonMode ? "json" : "javascript",
+              jsonldMode,
+              jsonMode,
+              expressionAllowed,
+              skipExpression: function (state) {
+                parseJS(
+                  state,
+                  "atom",
+                  "atom",
+                  "true",
+                  new CodeMirror.StringStream("", 2, null)
+                );
+              },
+            };
+          });
+          CodeMirror.registerHelper("wordChars", "javascript", /[\w$]/);
+          CodeMirror.defineMIME("text/javascript", "javascript");
+          CodeMirror.defineMIME("text/ecmascript", "javascript");
+          CodeMirror.defineMIME("application/javascript", "javascript");
+          CodeMirror.defineMIME("application/x-javascript", "javascript");
+          CodeMirror.defineMIME("application/ecmascript", "javascript");
+          CodeMirror.defineMIME("application/json", {
+            name: "javascript",
+            json: true,
+          });
+          CodeMirror.defineMIME("application/x-json", {
+            name: "javascript",
+            json: true,
+          });
+          CodeMirror.defineMIME("application/manifest+json", {
+            name: "javascript",
+            json: true,
+          });
+          CodeMirror.defineMIME("application/ld+json", {
+            name: "javascript",
+            jsonld: true,
+          });
+          CodeMirror.defineMIME("text/typescript", {
+            name: "javascript",
+            typescript: true,
+          });
+          CodeMirror.defineMIME("application/typescript", {
+            name: "javascript",
+            typescript: true,
+          });
+        });
+      })();
+      var javascript = javascript$2.exports;
+      var javascript$1 = /* @__PURE__ */ Object.freeze(
+        /* @__PURE__ */ _mergeNamespaces(
+          {
+            __proto__: null,
+            [Symbol.toStringTag]: "Module",
+            default: javascript,
+          },
+          [javascript$2.exports]
+        )
+      );
+      var mode$1 = {};
+      var __importDefault =
+        (commonjsGlobal && commonjsGlobal.__importDefault) ||
+        function (mod) {
+          return mod && mod.__esModule ? mod : { default: mod };
+        };
+      Object.defineProperty(mode$1, "__esModule", { value: true });
+      var codemirror_1 = __importDefault(codemirror$2.exports);
+      var graphql_language_service_1 = require$$1$1;
+      codemirror_1.default.defineMode("graphql-results", function (config2) {
+        var parser = graphql_language_service_1.onlineParser({
+          eatWhitespace: function (stream) {
+            return stream.eatSpace();
+          },
+          lexRules: LexRules,
+          parseRules: ParseRules,
+          editorConfig: { tabSize: config2.tabSize },
+        });
+        return {
+          config: config2,
+          startState: parser.startState,
+          token: parser.token,
+          indent,
+          electricInput: /^\s*[}\]]/,
+          fold: "brace",
+          closeBrackets: {
+            pairs: '[]{}""',
+            explode: "[]{}",
+          },
+        };
+      });
+      function indent(state, textAfter) {
+        var _a2, _b;
+        var levels = state.levels;
+        var level =
+          !levels || levels.length === 0
+            ? state.indentLevel
+            : levels[levels.length - 1] -
+              ((
+                (_a2 = this.electricInput) === null || _a2 === void 0
+                  ? void 0
+                  : _a2.test(textAfter)
+              )
+                ? 1
+                : 0);
+        return (
+          (level || 0) *
+          (((_b = this.config) === null || _b === void 0
+            ? void 0
+            : _b.indentUnit) || 0)
+        );
+      }
+      var LexRules = {
+        Punctuation: /^\[|]|\{|\}|:|,/,
+        Number: /^-?(?:0|(?:[1-9][0-9]*))(?:\.[0-9]*)?(?:[eE][+-]?[0-9]+)?/,
+        String: /^"(?:[^"\\]|\\(?:"|\/|\\|b|f|n|r|t|u[0-9a-fA-F]{4}))*"?/,
+        Keyword: /^true|false|null/,
+      };
+      var ParseRules = {
+        Document: [
+          graphql_language_service_1.p("{"),
+          graphql_language_service_1.list(
+            "Entry",
+            graphql_language_service_1.p(",")
+          ),
+          graphql_language_service_1.p("}"),
+        ],
+        Entry: [
+          graphql_language_service_1.t("String", "def"),
+          graphql_language_service_1.p(":"),
+          "Value",
+        ],
+        Value: function (token2) {
+          switch (token2.kind) {
+            case "Number":
+              return "NumberValue";
+            case "String":
+              return "StringValue";
+            case "Punctuation":
+              switch (token2.value) {
+                case "[":
+                  return "ListValue";
+                case "{":
+                  return "ObjectValue";
+              }
+              return null;
+            case "Keyword":
+              switch (token2.value) {
+                case "true":
+                case "false":
+                  return "BooleanValue";
+                case "null":
+                  return "NullValue";
+              }
+              return null;
+          }
+        },
+        NumberValue: [graphql_language_service_1.t("Number", "number")],
+        StringValue: [graphql_language_service_1.t("String", "string")],
+        BooleanValue: [graphql_language_service_1.t("Keyword", "builtin")],
+        NullValue: [graphql_language_service_1.t("Keyword", "keyword")],
+        ListValue: [
+          graphql_language_service_1.p("["),
+          graphql_language_service_1.list(
+            "Value",
+            graphql_language_service_1.p(",")
+          ),
+          graphql_language_service_1.p("]"),
+        ],
+        ObjectValue: [
+          graphql_language_service_1.p("{"),
+          graphql_language_service_1.list(
+            "ObjectField",
+            graphql_language_service_1.p(",")
+          ),
+          graphql_language_service_1.p("}"),
+        ],
+        ObjectField: [
+          graphql_language_service_1.t("String", "property"),
+          graphql_language_service_1.p(":"),
+          "Value",
+        ],
+      };
+      var mode = /* @__PURE__ */ Object.freeze(
+        /* @__PURE__ */ _mergeNamespaces(
+          {
+            __proto__: null,
+            [Symbol.toStringTag]: "Module",
+            default: mode$1,
+          },
+          [mode$1]
+        )
+      );
+      export { renderYogaGraphiQL };
+
+      var endpoint = window.location.pathname.substring(
+        0,
+        window.location.pathname.length - "/graphql".length
+      );
+
+      renderYogaGraphiQL(window.document.querySelector("#root"), {
+        endpoint,
+      });
+    </script>
+  </body>
+</html>
diff --git a/server/http/src/lib.rs b/server/http/src/lib.rs
new file mode 100644
index 0000000..c5621bc
--- /dev/null
+++ b/server/http/src/lib.rs
@@ -0,0 +1,18 @@
+extern crate futures;
+extern crate graph;
+extern crate graph_graphql;
+#[cfg(test)]
+extern crate graph_mock;
+extern crate graphql_parser;
+extern crate http;
+extern crate hyper;
+extern crate serde;
+
+mod request;
+mod server;
+mod service;
+
+pub use self::server::GraphQLServer;
+pub use self::service::{GraphQLService, GraphQLServiceResponse};
+
+pub mod test_utils;
diff --git a/server/http/src/request.rs b/server/http/src/request.rs
new file mode 100644
index 0000000..05a7b08
--- /dev/null
+++ b/server/http/src/request.rs
@@ -0,0 +1,169 @@
+use graph::prelude::serde_json;
+use hyper::body::Bytes;
+
+use graph::components::server::query::GraphQLServerError;
+use graph::prelude::*;
+
+pub fn parse_graphql_request(body: &Bytes) -> Result<Query, GraphQLServerError> {
+    // Parse request body as JSON
+    let json: serde_json::Value = serde_json::from_slice(body)
+        .map_err(|e| GraphQLServerError::ClientError(format!("{}", e)))?;
+
+    // Ensure the JSON data is an object
+    let obj = json.as_object().ok_or_else(|| {
+        GraphQLServerError::ClientError(String::from("Request data is not an object"))
+    })?;
+
+    // Ensure the JSON data has a "query" field
+    let query_value = obj.get("query").ok_or_else(|| {
+        GraphQLServerError::ClientError(String::from(
+            "The \"query\" field is missing in request data",
+        ))
+    })?;
+
+    // Ensure the "query" field is a string
+    let query_string = query_value.as_str().ok_or_else(|| {
+        GraphQLServerError::ClientError(String::from("The \"query\" field is not a string"))
+    })?;
+
+    // Parse the "query" field of the JSON body
+    let document = graphql_parser::parse_query(query_string)
+        .map_err(|e| GraphQLServerError::from(QueryError::ParseError(Arc::new(e.into()))))?
+        .into_static();
+
+    // Parse the "variables" field of the JSON body, if present
+    let variables = match obj.get("variables") {
+        None | Some(serde_json::Value::Null) => Ok(None),
+        Some(variables @ serde_json::Value::Object(_)) => serde_json::from_value(variables.clone())
+            .map_err(|e| GraphQLServerError::ClientError(e.to_string()))
+            .map(Some),
+        _ => Err(GraphQLServerError::ClientError(
+            "Invalid query variables provided".to_string(),
+        )),
+    }?;
+
+    Ok(Query::new(document, variables))
+}
+
+#[cfg(test)]
+mod tests {
+    use graphql_parser;
+    use hyper;
+    use std::collections::HashMap;
+
+    use graph::{
+        data::{query::QueryTarget, value::Object},
+        prelude::*,
+    };
+
+    use super::parse_graphql_request;
+
+    lazy_static! {
+        static ref TARGET: QueryTarget = QueryTarget::Name(
+            SubgraphName::new("test/request").unwrap(),
+            Default::default()
+        );
+    }
+
+    #[test]
+    fn rejects_invalid_json() {
+        let request = parse_graphql_request(&hyper::body::Bytes::from("!@#)%"));
+        request.expect_err("Should reject invalid JSON");
+    }
+
+    #[test]
+    fn rejects_json_without_query_field() {
+        let request = parse_graphql_request(&hyper::body::Bytes::from("{}"));
+        request.expect_err("Should reject JSON without query field");
+    }
+
+    #[test]
+    fn rejects_json_with_non_string_query_field() {
+        let request = parse_graphql_request(&hyper::body::Bytes::from("{\"query\": 5}"));
+        request.expect_err("Should reject JSON with a non-string query field");
+    }
+
+    #[test]
+    fn rejects_broken_queries() {
+        let request = parse_graphql_request(&hyper::body::Bytes::from("{\"query\": \"foo\"}"));
+        request.expect_err("Should reject broken queries");
+    }
+
+    #[test]
+    fn accepts_valid_queries() {
+        let request = parse_graphql_request(&hyper::body::Bytes::from(
+            "{\"query\": \"{ user { name } }\"}",
+        ));
+        let query = request.expect("Should accept valid queries");
+        assert_eq!(
+            query.document,
+            graphql_parser::parse_query("{ user { name } }")
+                .unwrap()
+                .into_static()
+        );
+    }
+
+    #[test]
+    fn accepts_null_variables() {
+        let request = parse_graphql_request(&hyper::body::Bytes::from(
+            "\
+                 {\
+                 \"query\": \"{ user { name } }\", \
+                 \"variables\": null \
+                 }",
+        ));
+        let query = request.expect("Should accept null variables");
+
+        let expected_query = graphql_parser::parse_query("{ user { name } }")
+            .unwrap()
+            .into_static();
+        assert_eq!(query.document, expected_query);
+        assert_eq!(query.variables, None);
+    }
+
+    #[test]
+    fn rejects_non_map_variables() {
+        let request = parse_graphql_request(&hyper::body::Bytes::from(
+            "\
+                 {\
+                 \"query\": \"{ user { name } }\", \
+                 \"variables\": 5 \
+                 }",
+        ));
+        request.expect_err("Should reject non-map variables");
+    }
+
+    #[test]
+    fn parses_variables() {
+        let request = parse_graphql_request(&hyper::body::Bytes::from(
+            "\
+                 {\
+                 \"query\": \"{ user { name } }\", \
+                 \"variables\": { \
+                 \"string\": \"s\", \"map\": {\"k\": \"v\"}, \"int\": 5 \
+                 } \
+                 }",
+        ));
+        let query = request.expect("Should accept valid queries");
+
+        let expected_query = graphql_parser::parse_query("{ user { name } }")
+            .unwrap()
+            .into_static();
+        let expected_variables = QueryVariables::new(HashMap::from_iter(
+            vec![
+                (String::from("string"), r::Value::String(String::from("s"))),
+                (
+                    String::from("map"),
+                    r::Value::Object(Object::from_iter(
+                        vec![(String::from("k"), r::Value::String(String::from("v")))].into_iter(),
+                    )),
+                ),
+                (String::from("int"), r::Value::Int(5)),
+            ]
+            .into_iter(),
+        ));
+
+        assert_eq!(query.document, expected_query);
+        assert_eq!(query.variables, Some(expected_variables));
+    }
+}
diff --git a/server/http/src/server.rs b/server/http/src/server.rs
new file mode 100644
index 0000000..a99e8ba
--- /dev/null
+++ b/server/http/src/server.rs
@@ -0,0 +1,84 @@
+use std::net::{Ipv4Addr, SocketAddrV4};
+
+use hyper::service::make_service_fn;
+use hyper::Server;
+
+use crate::service::GraphQLService;
+use graph::prelude::{GraphQLServer as GraphQLServerTrait, *};
+use thiserror::Error;
+
+/// Errors that may occur when starting the server.
+#[derive(Debug, Error)]
+pub enum GraphQLServeError {
+    #[error("Bind error: {0}")]
+    BindError(#[from] hyper::Error),
+}
+
+/// A GraphQL server based on Hyper.
+pub struct GraphQLServer<Q> {
+    logger: Logger,
+    graphql_runner: Arc<Q>,
+    node_id: NodeId,
+}
+
+impl<Q> GraphQLServer<Q> {
+    /// Creates a new GraphQL server.
+    pub fn new(logger_factory: &LoggerFactory, graphql_runner: Arc<Q>, node_id: NodeId) -> Self {
+        let logger = logger_factory.component_logger(
+            "GraphQLServer",
+            Some(ComponentLoggerConfig {
+                elastic: Some(ElasticComponentLoggerConfig {
+                    index: String::from("graphql-server-logs"),
+                }),
+            }),
+        );
+        GraphQLServer {
+            logger,
+            graphql_runner,
+            node_id,
+        }
+    }
+}
+
+impl<Q> GraphQLServerTrait for GraphQLServer<Q>
+where
+    Q: GraphQlRunner,
+{
+    type ServeError = GraphQLServeError;
+
+    fn serve(
+        &mut self,
+        port: u16,
+        ws_port: u16,
+    ) -> Result<Box<dyn Future<Item = (), Error = ()> + Send>, Self::ServeError> {
+        let logger = self.logger.clone();
+
+        info!(
+            logger,
+            "Starting GraphQL HTTP server at: http://localhost:{}", port
+        );
+
+        let addr = SocketAddrV4::new(Ipv4Addr::new(0, 0, 0, 0), port);
+
+        // On every incoming request, launch a new GraphQL service that writes
+        // incoming queries to the query sink.
+        let logger_for_service = self.logger.clone();
+        let graphql_runner = self.graphql_runner.clone();
+        let node_id = self.node_id.clone();
+        let new_service = make_service_fn(move |_| {
+            futures03::future::ok::<_, Error>(GraphQLService::new(
+                logger_for_service.clone(),
+                graphql_runner.clone(),
+                ws_port,
+                node_id.clone(),
+            ))
+        });
+
+        // Create a task to run the server and handle HTTP requests
+        let task = Server::try_bind(&addr.into())?
+            .serve(new_service)
+            .map_err(move |e| error!(logger, "Server error"; "error" => format!("{}", e)));
+
+        Ok(Box::new(task.compat()))
+    }
+}
diff --git a/server/http/src/service.rs b/server/http/src/service.rs
new file mode 100644
index 0000000..cfc5604
--- /dev/null
+++ b/server/http/src/service.rs
@@ -0,0 +1,480 @@
+use std::convert::TryFrom;
+use std::pin::Pin;
+use std::task::Context;
+use std::task::Poll;
+use std::time::Instant;
+
+use graph::prelude::*;
+use graph::semver::VersionReq;
+use graph::{components::server::query::GraphQLServerError, data::query::QueryTarget};
+use http::header;
+use http::header::{
+    ACCESS_CONTROL_ALLOW_HEADERS, ACCESS_CONTROL_ALLOW_METHODS, ACCESS_CONTROL_ALLOW_ORIGIN,
+    CONTENT_TYPE, LOCATION,
+};
+use hyper::service::Service;
+use hyper::{Body, Method, Request, Response, StatusCode};
+
+use crate::request::parse_graphql_request;
+
+pub type GraphQLServiceResult = Result<Response<Body>, GraphQLServerError>;
+/// An asynchronous response to a GraphQL request.
+pub type GraphQLServiceResponse =
+    Pin<Box<dyn std::future::Future<Output = GraphQLServiceResult> + Send>>;
+
+/// A Hyper Service that serves GraphQL over a POST / endpoint.
+#[derive(Debug)]
+pub struct GraphQLService<Q> {
+    logger: Logger,
+    graphql_runner: Arc<Q>,
+    ws_port: u16,
+    node_id: NodeId,
+}
+
+impl<Q> Clone for GraphQLService<Q> {
+    fn clone(&self) -> Self {
+        Self {
+            logger: self.logger.clone(),
+            graphql_runner: self.graphql_runner.clone(),
+            ws_port: self.ws_port,
+            node_id: self.node_id.clone(),
+        }
+    }
+}
+
+impl<Q> GraphQLService<Q>
+where
+    Q: GraphQlRunner,
+{
+    /// Creates a new GraphQL service.
+    pub fn new(logger: Logger, graphql_runner: Arc<Q>, ws_port: u16, node_id: NodeId) -> Self {
+        GraphQLService {
+            logger,
+            graphql_runner,
+            ws_port,
+            node_id,
+        }
+    }
+
+    fn graphiql_html(&self) -> String {
+        include_str!("../assets/index.html")
+            .replace("__WS_PORT__", format!("{}", self.ws_port).as_str())
+    }
+
+    async fn index(self) -> GraphQLServiceResult {
+        Ok(Response::builder()
+            .status(200)
+            .header(ACCESS_CONTROL_ALLOW_ORIGIN, "*")
+            .header(CONTENT_TYPE, "text/plain")
+            .body(Body::from(String::from(
+                "Access deployed subgraphs by deployment ID at \
+                /subgraphs/id/<ID> or by name at /subgraphs/name/<NAME>",
+            )))
+            .unwrap())
+    }
+
+    /// Serves a dynamically created file.
+    fn serve_dynamic_file(&self, contents: String) -> GraphQLServiceResponse {
+        async {
+            Ok(Response::builder()
+                .status(200)
+                .header(ACCESS_CONTROL_ALLOW_ORIGIN, "*")
+                .header(CONTENT_TYPE, "text/html")
+                .body(Body::from(contents))
+                .unwrap())
+        }
+        .boxed()
+    }
+
+    fn handle_graphiql(&self) -> GraphQLServiceResponse {
+        self.serve_dynamic_file(self.graphiql_html())
+    }
+
+    fn resolve_api_version(
+        &self,
+        request: &Request<Body>,
+    ) -> Result<ApiVersion, GraphQLServerError> {
+        let mut version = ApiVersion::default();
+
+        if let Some(query) = request.uri().query() {
+            let potential_version_requirement = query.split("&").find_map(|pair| {
+                if pair.starts_with("api-version=") {
+                    if let Some(version_requirement) = pair.split("=").nth(1) {
+                        return Some(version_requirement);
+                    }
+                }
+                return None;
+            });
+
+            if let Some(version_requirement) = potential_version_requirement {
+                version = ApiVersion::new(
+                    &VersionReq::parse(version_requirement)
+                        .map_err(|error| GraphQLServerError::ClientError(error.to_string()))?,
+                )
+                .map_err(|error| GraphQLServerError::ClientError(error))?;
+            }
+        }
+
+        Ok(version)
+    }
+
+    async fn handle_graphql_query_by_name(
+        self,
+        subgraph_name: String,
+        request: Request<Body>,
+    ) -> GraphQLServiceResult {
+        let version = self.resolve_api_version(&request)?;
+        let subgraph_name = SubgraphName::new(subgraph_name.as_str()).map_err(|()| {
+            GraphQLServerError::ClientError(format!("Invalid subgraph name {:?}", subgraph_name))
+        })?;
+
+        self.handle_graphql_query(
+            QueryTarget::Name(subgraph_name, version),
+            request.into_body(),
+        )
+        .await
+    }
+
+    fn handle_graphql_query_by_id(
+        self,
+        id: String,
+        request: Request<Body>,
+    ) -> GraphQLServiceResponse {
+        let res = DeploymentHash::new(id)
+            .map_err(|id| GraphQLServerError::ClientError(format!("Invalid subgraph id `{}`", id)))
+            .and_then(|id| match self.resolve_api_version(&request) {
+                Ok(version) => Ok((id, version)),
+                Err(error) => Err(error),
+            });
+
+        match res {
+            Err(_) => self.handle_not_found(),
+            Ok((id, version)) => self
+                .handle_graphql_query(QueryTarget::Deployment(id, version), request.into_body())
+                .boxed(),
+        }
+    }
+
+    async fn handle_graphql_query(
+        self,
+        target: QueryTarget,
+        request_body: Body,
+    ) -> GraphQLServiceResult {
+        let service = self.clone();
+
+        let start = Instant::now();
+        let body = hyper::body::to_bytes(request_body)
+            .map_err(|_| GraphQLServerError::InternalError("Failed to read request body".into()))
+            .await?;
+        let query = parse_graphql_request(&body);
+        let query_parsing_time = start.elapsed();
+
+        let result = match query {
+            Ok(query) => service.graphql_runner.run_query(query, target).await,
+            Err(GraphQLServerError::QueryError(e)) => QueryResult::from(e).into(),
+            Err(e) => return Err(e),
+        };
+
+        self.graphql_runner
+            .metrics()
+            .observe_query_parsing(query_parsing_time, &result);
+        self.graphql_runner
+            .metrics()
+            .observe_query_execution(start.elapsed(), &result);
+
+        Ok(result.as_http_response())
+    }
+
+    // Handles OPTIONS requests
+    fn handle_graphql_options(&self, _request: Request<Body>) -> GraphQLServiceResponse {
+        async {
+            Ok(Response::builder()
+                .status(200)
+                .header(ACCESS_CONTROL_ALLOW_ORIGIN, "*")
+                .header(ACCESS_CONTROL_ALLOW_HEADERS, "Content-Type, User-Agent")
+                .header(ACCESS_CONTROL_ALLOW_METHODS, "GET, OPTIONS, POST")
+                .header(CONTENT_TYPE, "text/html")
+                .body(Body::from(""))
+                .unwrap())
+        }
+        .boxed()
+    }
+
+    /// Handles 302 redirects
+    async fn handle_temp_redirect(self, destination: String) -> GraphQLServiceResult {
+        header::HeaderValue::try_from(destination)
+            .map_err(|_| {
+                GraphQLServerError::ClientError("invalid characters in redirect URL".into())
+            })
+            .map(|loc_header_val| {
+                Response::builder()
+                    .status(StatusCode::FOUND)
+                    .header(ACCESS_CONTROL_ALLOW_ORIGIN, "*")
+                    .header(LOCATION, loc_header_val)
+                    .header(CONTENT_TYPE, "text/plain")
+                    .body(Body::from("Redirecting..."))
+                    .unwrap()
+            })
+    }
+
+    /// Handles 404s.
+    fn handle_not_found(&self) -> GraphQLServiceResponse {
+        async {
+            Ok(Response::builder()
+                .status(StatusCode::NOT_FOUND)
+                .header(CONTENT_TYPE, "text/plain")
+                .header(ACCESS_CONTROL_ALLOW_ORIGIN, "*")
+                .body(Body::from("Not found"))
+                .unwrap())
+        }
+        .boxed()
+    }
+
+    fn handle_call(self, req: Request<Body>) -> GraphQLServiceResponse {
+        let method = req.method().clone();
+
+        let path = req.uri().path().to_owned();
+        let path_segments = {
+            let mut segments = path.split('/');
+
+            // Remove leading '/'
+            assert_eq!(segments.next(), Some(""));
+
+            segments.collect::<Vec<_>>()
+        };
+
+        match (method, path_segments.as_slice()) {
+            (Method::GET, [""]) => self.index().boxed(),
+            (Method::GET, &["subgraphs", "id", _, "graphql"])
+            | (Method::GET, &["subgraphs", "name", _, "graphql"])
+            | (Method::GET, &["subgraphs", "name", _, _, "graphql"])
+            | (Method::GET, &["subgraphs", "network", _, _, "graphql"])
+            | (Method::GET, &["subgraphs", "graphql"]) => self.handle_graphiql(),
+
+            (Method::GET, path @ ["subgraphs", "id", _])
+            | (Method::GET, path @ ["subgraphs", "name", _])
+            | (Method::GET, path @ ["subgraphs", "name", _, _])
+            | (Method::GET, path @ ["subgraphs", "network", _, _])
+            | (Method::GET, path @ ["subgraphs"]) => {
+                let dest = format!("/{}/graphql", path.join("/"));
+                self.handle_temp_redirect(dest).boxed()
+            }
+
+            (Method::POST, &["subgraphs", "id", subgraph_id]) => {
+                self.handle_graphql_query_by_id(subgraph_id.to_owned(), req)
+            }
+            (Method::OPTIONS, ["subgraphs", "id", _]) => self.handle_graphql_options(req),
+            (Method::POST, &["subgraphs", "name", subgraph_name]) => self
+                .handle_graphql_query_by_name(subgraph_name.to_owned(), req)
+                .boxed(),
+            (Method::POST, ["subgraphs", "name", subgraph_name_part1, subgraph_name_part2]) => {
+                let subgraph_name = format!("{}/{}", subgraph_name_part1, subgraph_name_part2);
+                self.handle_graphql_query_by_name(subgraph_name, req)
+                    .boxed()
+            }
+            (Method::POST, ["subgraphs", "network", subgraph_name_part1, subgraph_name_part2]) => {
+                let subgraph_name =
+                    format!("network/{}/{}", subgraph_name_part1, subgraph_name_part2);
+                self.handle_graphql_query_by_name(subgraph_name, req)
+                    .boxed()
+            }
+
+            (Method::OPTIONS, ["subgraphs", "name", _])
+            | (Method::OPTIONS, ["subgraphs", "name", _, _])
+            | (Method::OPTIONS, ["subgraphs", "network", _, _]) => self.handle_graphql_options(req),
+
+            _ => self.handle_not_found(),
+        }
+    }
+}
+
+impl<Q> Service<Request<Body>> for GraphQLService<Q>
+where
+    Q: GraphQlRunner,
+{
+    type Response = Response<Body>;
+    type Error = GraphQLServerError;
+    type Future = GraphQLServiceResponse;
+
+    fn poll_ready(&mut self, _: &mut Context<'_>) -> Poll<Result<(), Self::Error>> {
+        Poll::Ready(Ok(()))
+    }
+
+    fn call(&mut self, req: Request<Body>) -> Self::Future {
+        let logger = self.logger.clone();
+        let service = self.clone();
+
+        // Returning Err here will prevent the client from receiving any response.
+        // Instead, we generate a Response with an error code and return Ok
+        Box::pin(async move {
+            let result = service.handle_call(req).await;
+            match result {
+                Ok(response) => Ok(response),
+                Err(err @ GraphQLServerError::ClientError(_)) => Ok(Response::builder()
+                    .status(400)
+                    .header(CONTENT_TYPE, "text/plain")
+                    .header(ACCESS_CONTROL_ALLOW_ORIGIN, "*")
+                    .body(Body::from(err.to_string()))
+                    .unwrap()),
+                Err(err @ GraphQLServerError::QueryError(_)) => {
+                    error!(logger, "GraphQLService call failed: {}", err);
+
+                    Ok(Response::builder()
+                        .status(400)
+                        .header(CONTENT_TYPE, "text/plain")
+                        .header(ACCESS_CONTROL_ALLOW_ORIGIN, "*")
+                        .body(Body::from(format!("Query error: {}", err)))
+                        .unwrap())
+                }
+                Err(err @ GraphQLServerError::InternalError(_)) => {
+                    error!(logger, "GraphQLService call failed: {}", err);
+
+                    Ok(Response::builder()
+                        .status(500)
+                        .header(CONTENT_TYPE, "text/plain")
+                        .header(ACCESS_CONTROL_ALLOW_ORIGIN, "*")
+                        .body(Body::from(format!("Internal server error: {}", err)))
+                        .unwrap())
+                }
+            }
+        })
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    use graph::data::value::Object;
+    use http::status::StatusCode;
+    use hyper::service::Service;
+    use hyper::{Body, Method, Request};
+
+    use graph::data::{
+        graphql::effort::LoadManager,
+        query::{QueryResults, QueryTarget},
+    };
+    use graph::prelude::*;
+
+    use crate::test_utils;
+
+    use super::GraphQLService;
+
+    /// A simple stupid query runner for testing.
+    pub struct TestGraphQlRunner;
+
+    pub struct TestGraphQLMetrics;
+
+    lazy_static! {
+        static ref USERS: DeploymentHash = DeploymentHash::new("users").unwrap();
+    }
+
+    impl GraphQLMetrics for TestGraphQLMetrics {
+        fn observe_query_execution(&self, _duration: Duration, _results: &QueryResults) {}
+        fn observe_query_parsing(&self, _duration: Duration, _results: &QueryResults) {}
+        fn observe_query_validation(&self, _duration: Duration, _id: &DeploymentHash) {}
+    }
+
+    #[async_trait]
+    impl GraphQlRunner for TestGraphQlRunner {
+        async fn run_query_with_complexity(
+            self: Arc<Self>,
+            _query: Query,
+            _target: QueryTarget,
+            _complexity: Option<u64>,
+            _max_depth: Option<u8>,
+            _max_first: Option<u32>,
+            _max_skip: Option<u32>,
+        ) -> QueryResults {
+            unimplemented!();
+        }
+
+        async fn run_query(self: Arc<Self>, _query: Query, _target: QueryTarget) -> QueryResults {
+            QueryResults::from(Object::from_iter(
+                vec![(
+                    String::from("name"),
+                    r::Value::String(String::from("Jordi")),
+                )]
+                .into_iter(),
+            ))
+        }
+
+        async fn run_subscription(
+            self: Arc<Self>,
+            _subscription: Subscription,
+            _target: QueryTarget,
+        ) -> Result<SubscriptionResult, SubscriptionError> {
+            unreachable!();
+        }
+
+        fn load_manager(&self) -> Arc<LoadManager> {
+            unimplemented!()
+        }
+
+        fn metrics(&self) -> Arc<dyn GraphQLMetrics> {
+            Arc::new(TestGraphQLMetrics)
+        }
+    }
+
+    #[test]
+    fn posting_invalid_query_yields_error_response() {
+        let logger = Logger::root(slog::Discard, o!());
+        let subgraph_id = USERS.clone();
+        let graphql_runner = Arc::new(TestGraphQlRunner);
+
+        let node_id = NodeId::new("test").unwrap();
+        let mut service = GraphQLService::new(logger, graphql_runner, 8001, node_id);
+
+        let request = Request::builder()
+            .method(Method::POST)
+            .uri(format!(
+                "http://localhost:8000/subgraphs/id/{}",
+                subgraph_id
+            ))
+            .body(Body::from("{}"))
+            .unwrap();
+
+        let response =
+            futures03::executor::block_on(service.call(request)).expect("Should return a response");
+        let errors = test_utils::assert_error_response(response, StatusCode::BAD_REQUEST, false);
+
+        let message = errors[0].as_str().expect("Error message is not a string");
+
+        assert_eq!(
+            message,
+            "GraphQL server error (client error): The \"query\" field is missing in request data"
+        );
+    }
+
+    #[tokio::test(flavor = "multi_thread")]
+    async fn posting_valid_queries_yields_result_response() {
+        let logger = Logger::root(slog::Discard, o!());
+        let subgraph_id = USERS.clone();
+        let graphql_runner = Arc::new(TestGraphQlRunner);
+
+        let node_id = NodeId::new("test").unwrap();
+        let mut service = GraphQLService::new(logger, graphql_runner, 8001, node_id);
+
+        let request = Request::builder()
+            .method(Method::POST)
+            .uri(format!(
+                "http://localhost:8000/subgraphs/id/{}",
+                subgraph_id
+            ))
+            .body(Body::from("{\"query\": \"{ name }\"}"))
+            .unwrap();
+
+        // The response must be a 200
+        let response = tokio::spawn(service.call(request))
+            .await
+            .unwrap()
+            .expect("Should return a response");
+        let data = test_utils::assert_successful_response(response);
+
+        // The body should match the simulated query result
+        let name = data
+            .get("name")
+            .expect("Query result data has no \"name\" field")
+            .as_str()
+            .expect("Query result field \"name\" is not a string");
+        assert_eq!(name, "Jordi".to_string());
+    }
+}
diff --git a/server/http/src/test_utils.rs b/server/http/src/test_utils.rs
new file mode 100644
index 0000000..2293559
--- /dev/null
+++ b/server/http/src/test_utils.rs
@@ -0,0 +1,72 @@
+use graph::prelude::serde_json;
+use graph::prelude::*;
+use http::StatusCode;
+use hyper::{header::ACCESS_CONTROL_ALLOW_ORIGIN, Body, Response};
+
+/// Asserts that the response is a successful GraphQL response; returns its `"data"` field.
+pub fn assert_successful_response(
+    response: Response<Body>,
+) -> serde_json::Map<String, serde_json::Value> {
+    assert_eq!(response.status(), StatusCode::OK);
+    assert_expected_headers(&response);
+    futures03::executor::block_on(
+        hyper::body::to_bytes(response.into_body())
+            .map_ok(|chunk| {
+                let json: serde_json::Value =
+                    serde_json::from_slice(&chunk).expect("GraphQL response is not valid JSON");
+
+                json.as_object()
+                    .expect("GraphQL response must be an object")
+                    .get("data")
+                    .expect("GraphQL response must contain a \"data\" field")
+                    .as_object()
+                    .expect("GraphQL \"data\" field must be an object")
+                    .clone()
+            })
+            .map_err(|e| panic!("Truncated response body {:?}", e)),
+    )
+    .unwrap()
+}
+
+/// Asserts that the response is a failed GraphQL response; returns its `"errors"` field.
+pub fn assert_error_response(
+    response: Response<Body>,
+    expected_status: StatusCode,
+    graphql_response: bool,
+) -> Vec<serde_json::Value> {
+    assert_eq!(response.status(), expected_status);
+    assert_expected_headers(&response);
+    let body = String::from_utf8(
+        futures03::executor::block_on(hyper::body::to_bytes(response.into_body()))
+            .unwrap()
+            .to_vec(),
+    )
+    .unwrap();
+
+    // In case of a non-graphql response, return the body.
+    if !graphql_response {
+        return vec![serde_json::Value::String(body)];
+    }
+
+    let json: serde_json::Value =
+        serde_json::from_str(&body).expect("GraphQL response is not valid JSON");
+
+    json.as_object()
+        .expect("GraphQL response must be an object")
+        .get("errors")
+        .expect("GraphQL error response must contain an \"errors\" field")
+        .as_array()
+        .expect("GraphQL \"errors\" field must be a vector")
+        .clone()
+}
+
+#[track_caller]
+pub fn assert_expected_headers(response: &Response<Body>) {
+    assert_eq!(
+        response
+            .headers()
+            .get(ACCESS_CONTROL_ALLOW_ORIGIN)
+            .expect("Missing CORS Header"),
+        &"*"
+    );
+}
diff --git a/server/http/tests/response.rs b/server/http/tests/response.rs
new file mode 100644
index 0000000..64b1ae0
--- /dev/null
+++ b/server/http/tests/response.rs
@@ -0,0 +1,87 @@
+use graph::data::value::Object;
+use graph::data::{graphql::object, query::QueryResults};
+use graph::prelude::*;
+use graph_server_http::test_utils;
+
+#[test]
+fn generates_200_for_query_results() {
+    let data = Object::from_iter([]);
+    let query_result = QueryResults::from(data).as_http_response();
+    test_utils::assert_expected_headers(&query_result);
+    test_utils::assert_successful_response(query_result);
+}
+
+#[test]
+fn generates_valid_json_for_an_empty_result() {
+    let data = Object::from_iter([]);
+    let query_result = QueryResults::from(data).as_http_response();
+    test_utils::assert_expected_headers(&query_result);
+    let data = test_utils::assert_successful_response(query_result);
+    assert!(data.is_empty());
+}
+
+#[test]
+fn canonical_serialization() {
+    macro_rules! assert_resp {
+        ($exp: expr, $obj: expr) => {{
+            {
+                // This match is solely there to make sure these tests
+                // get amended if q::Value ever gets more variants
+                // The order of the variants should be the same as the
+                // order of the tests below
+                use r::Value::*;
+                let _ = match $obj {
+                    Object(_) | List(_) | Enum(_) | Null | Int(_) | Float(_) | String(_)
+                    | Boolean(_) => (),
+                };
+            }
+            let res = QueryResult::try_from($obj).unwrap();
+            assert_eq!($exp, serde_json::to_string(&res).unwrap());
+        }};
+    }
+    assert_resp!(r#"{"data":{"id":"12345"}}"#, object! { id: "12345" });
+
+    // Value::Variable: nothing to check, not used in a response
+
+    // Value::Object: Insertion order of keys matters
+    let first_second = r#"{"data":{"first":"first","second":"second"}}"#;
+    let second_first = r#"{"data":{"second":"second","first":"first"}}"#;
+    assert_resp!(first_second, object! { first: "first", second: "second" });
+    assert_resp!(second_first, object! { second: "second", first: "first" });
+
+    // Value::List
+    assert_resp!(r#"{"data":{"ary":[1,2]}}"#, object! { ary: vec![1,2] });
+
+    // Value::Enum
+    assert_resp!(
+        r#"{"data":{"enum_field":"enum"}}"#,
+        object! { enum_field:  r::Value::Enum("enum".to_owned())}
+    );
+
+    // Value::Null
+    assert_resp!(
+        r#"{"data":{"nothing":null}}"#,
+        object! { nothing:  r::Value::Null}
+    );
+
+    // Value::Int
+    assert_resp!(
+        r#"{"data":{"int32":17,"neg32":-314}}"#,
+        object! { int32: 17, neg32: -314 }
+    );
+
+    // Value::Float
+    assert_resp!(r#"{"data":{"float":3.14159}}"#, object! { float: 3.14159 });
+
+    // Value::String
+    assert_resp!(
+        r#"{"data":{"text":"Ünïcödë with spaceß"}}"#,
+        object! { text: "Ünïcödë with spaceß" }
+    );
+
+    // Value::Boolean
+    assert_resp!(
+        r#"{"data":{"no":false,"yes":true}}"#,
+        object! { no: false, yes: true }
+    );
+}
diff --git a/server/http/tests/server.rs b/server/http/tests/server.rs
new file mode 100644
index 0000000..856a4e9
--- /dev/null
+++ b/server/http/tests/server.rs
@@ -0,0 +1,321 @@
+use http::StatusCode;
+use hyper::{Body, Client, Request};
+use std::time::Duration;
+
+use graph::data::{
+    graphql::effort::LoadManager,
+    query::{QueryResults, QueryTarget},
+    value::Object,
+};
+use graph::prelude::*;
+
+use graph_server_http::test_utils;
+use graph_server_http::GraphQLServer as HyperGraphQLServer;
+
+use tokio::time::sleep;
+
+pub struct TestGraphQLMetrics;
+
+impl GraphQLMetrics for TestGraphQLMetrics {
+    fn observe_query_execution(&self, _duration: Duration, _results: &QueryResults) {}
+    fn observe_query_parsing(&self, _duration: Duration, _results: &QueryResults) {}
+    fn observe_query_validation(&self, _duration: Duration, _id: &DeploymentHash) {}
+}
+
+/// A simple stupid query runner for testing.
+pub struct TestGraphQlRunner;
+
+#[async_trait]
+impl GraphQlRunner for TestGraphQlRunner {
+    async fn run_query_with_complexity(
+        self: Arc<Self>,
+        _query: Query,
+        _target: QueryTarget,
+        _complexity: Option<u64>,
+        _max_depth: Option<u8>,
+        _max_first: Option<u32>,
+        _max_skip: Option<u32>,
+    ) -> QueryResults {
+        unimplemented!();
+    }
+
+    async fn run_query(self: Arc<Self>, query: Query, _target: QueryTarget) -> QueryResults {
+        if query.variables.is_some()
+            && query
+                .variables
+                .as_ref()
+                .unwrap()
+                .get(&String::from("equals"))
+                .is_some()
+            && query
+                .variables
+                .unwrap()
+                .get(&String::from("equals"))
+                .unwrap()
+                == &r::Value::String(String::from("John"))
+        {
+            Object::from_iter(
+                vec![(String::from("name"), r::Value::String(String::from("John")))].into_iter(),
+            )
+        } else {
+            Object::from_iter(
+                vec![(
+                    String::from("name"),
+                    r::Value::String(String::from("Jordi")),
+                )]
+                .into_iter(),
+            )
+        }
+        .into()
+    }
+
+    async fn run_subscription(
+        self: Arc<Self>,
+        _subscription: Subscription,
+        _target: QueryTarget,
+    ) -> Result<SubscriptionResult, SubscriptionError> {
+        unreachable!();
+    }
+
+    fn load_manager(&self) -> Arc<LoadManager> {
+        unimplemented!()
+    }
+
+    fn metrics(&self) -> Arc<dyn GraphQLMetrics> {
+        Arc::new(TestGraphQLMetrics)
+    }
+}
+
+#[cfg(test)]
+mod test {
+    use super::*;
+
+    lazy_static! {
+        static ref USERS: DeploymentHash = DeploymentHash::new("users").unwrap();
+    }
+
+    #[test]
+    fn rejects_empty_json() {
+        let runtime = tokio::runtime::Runtime::new().unwrap();
+        runtime
+            .block_on(async {
+                let logger = Logger::root(slog::Discard, o!());
+                let logger_factory = LoggerFactory::new(logger, None);
+                let id = USERS.clone();
+                let query_runner = Arc::new(TestGraphQlRunner);
+                let node_id = NodeId::new("test").unwrap();
+                let mut server = HyperGraphQLServer::new(&logger_factory, query_runner, node_id);
+                let http_server = server
+                    .serve(8007, 8008)
+                    .expect("Failed to start GraphQL server");
+
+                // Launch the server to handle a single request
+                tokio::spawn(http_server.fuse().compat());
+                // Give some time for the server to start.
+                sleep(Duration::from_secs(2))
+                    .then(move |()| {
+                        // Send an empty JSON POST request
+                        let client = Client::new();
+                        let request =
+                            Request::post(format!("http://localhost:8007/subgraphs/id/{}", id))
+                                .body(Body::from("{}"))
+                                .unwrap();
+
+                        // The response must be a query error
+                        client.request(request)
+                    })
+                    .map_ok(|response| {
+                        let errors =
+                            test_utils::assert_error_response(response, StatusCode::BAD_REQUEST, false);
+
+                        let message = errors[0]
+                            .as_str()
+                            .expect("Error message is not a string");
+                        assert_eq!(message, "GraphQL server error (client error): The \"query\" field is missing in request data");
+                    }).await.unwrap()
+            })
+    }
+
+    #[test]
+    fn rejects_invalid_queries() {
+        let runtime = tokio::runtime::Runtime::new().unwrap();
+        runtime.block_on(async {
+            let logger = Logger::root(slog::Discard, o!());
+            let logger_factory = LoggerFactory::new(logger, None);
+            let id = USERS.clone();
+            let query_runner = Arc::new(TestGraphQlRunner);
+            let node_id = NodeId::new("test").unwrap();
+            let mut server = HyperGraphQLServer::new(&logger_factory, query_runner, node_id);
+            let http_server = server
+                .serve(8002, 8003)
+                .expect("Failed to start GraphQL server");
+
+            // Launch the server to handle a single request
+            tokio::spawn(http_server.fuse().compat());
+            // Give some time for the server to start.
+            sleep(Duration::from_secs(2))
+                .then(move |()| {
+                    // Send an broken query request
+                    let client = Client::new();
+                    let request =
+                        Request::post(format!("http://localhost:8002/subgraphs/id/{}", id))
+                            .body(Body::from("{\"query\": \"<L<G<>M>\"}"))
+                            .unwrap();
+
+                    // The response must be a query error
+                    client.request(request)
+                })
+                .map_ok(|response| {
+                    let errors = test_utils::assert_error_response(response, StatusCode::OK, true);
+
+                    let message = errors[0]
+                        .as_object()
+                        .expect("Query error is not an object")
+                        .get("message")
+                        .expect("Error contains no message")
+                        .as_str()
+                        .expect("Error message is not a string");
+
+                    assert_eq!(
+                        message,
+                        "Unexpected `unexpected character \
+                         \'<\'`\nExpected `{`, `query`, `mutation`, \
+                         `subscription` or `fragment`"
+                    );
+
+                    let locations = errors[0]
+                        .as_object()
+                        .expect("Query error is not an object")
+                        .get("locations")
+                        .expect("Query error contains not locations")
+                        .as_array()
+                        .expect("Query error \"locations\" field is not an array");
+
+                    let location = locations[0]
+                        .as_object()
+                        .expect("Query error location is not an object");
+
+                    let line = location
+                        .get("line")
+                        .expect("Query error location is missing a \"line\" field")
+                        .as_u64()
+                        .expect("Query error location \"line\" field is not a u64");
+
+                    assert_eq!(line, 1);
+
+                    let column = location
+                        .get("column")
+                        .expect("Query error location is missing a \"column\" field")
+                        .as_u64()
+                        .expect("Query error location \"column\" field is not a u64");
+
+                    assert_eq!(column, 1);
+                })
+                .await
+                .unwrap()
+        })
+    }
+
+    #[test]
+    fn accepts_valid_queries() {
+        let runtime = tokio::runtime::Runtime::new().unwrap();
+        runtime.block_on(async {
+            let logger = Logger::root(slog::Discard, o!());
+            let logger_factory = LoggerFactory::new(logger, None);
+            let id = USERS.clone();
+            let query_runner = Arc::new(TestGraphQlRunner);
+            let node_id = NodeId::new("test").unwrap();
+            let mut server = HyperGraphQLServer::new(&logger_factory, query_runner, node_id);
+            let http_server = server
+                .serve(8003, 8004)
+                .expect("Failed to start GraphQL server");
+
+            // Launch the server to handle a single request
+            tokio::spawn(http_server.fuse().compat());
+            // Give some time for the server to start.
+            sleep(Duration::from_secs(2))
+                .then(move |()| {
+                    // Send a valid example query
+                    let client = Client::new();
+                    let request =
+                        Request::post(format!("http://localhost:8003/subgraphs/id/{}", id))
+                            .body(Body::from("{\"query\": \"{ name }\"}"))
+                            .unwrap();
+
+                    // The response must be a 200
+                    client.request(request)
+                })
+                .map_ok(|response| {
+                    let data = test_utils::assert_successful_response(response);
+
+                    // The JSON response should match the simulated query result
+                    let name = data
+                        .get("name")
+                        .expect("Query result data has no \"name\" field")
+                        .as_str()
+                        .expect("Query result field \"name\" is not a string");
+                    assert_eq!(name, "Jordi".to_string());
+                })
+                .await
+                .unwrap()
+        });
+    }
+
+    #[test]
+    fn accepts_valid_queries_with_variables() {
+        let runtime = tokio::runtime::Runtime::new().unwrap();
+        let _ = runtime.block_on(async {
+            let logger = Logger::root(slog::Discard, o!());
+            let logger_factory = LoggerFactory::new(logger, None);
+            let id = USERS.clone();
+            let query_runner = Arc::new(TestGraphQlRunner);
+            let node_id = NodeId::new("test").unwrap();
+            let mut server = HyperGraphQLServer::new(&logger_factory, query_runner, node_id);
+            let http_server = server
+                .serve(8005, 8006)
+                .expect("Failed to start GraphQL server");
+
+            // Launch the server to handle a single request
+            tokio::spawn(http_server.fuse().compat());
+            // Give some time for the server to start.
+            sleep(Duration::from_secs(2))
+                .then(move |()| {
+                    // Send a valid example query
+                    let client = Client::new();
+                    let request =
+                        Request::post(format!("http://localhost:8005/subgraphs/id/{}", id))
+                            .body(Body::from(
+                                "
+                            {
+                              \"query\": \" \
+                                query name($equals: String!) { \
+                                  name(equals: $equals) \
+                                } \
+                              \",
+                              \"variables\": { \"equals\": \"John\" }
+                            }
+                            ",
+                            ))
+                            .unwrap();
+
+                    // The response must be a 200
+                    client.request(request)
+                })
+                .map_ok(|response| {
+                    async {
+                        let data = test_utils::assert_successful_response(response);
+
+                        // The JSON response should match the simulated query result
+                        let name = data
+                            .get("name")
+                            .expect("Query result data has no \"name\" field")
+                            .as_str()
+                            .expect("Query result field \"name\" is not a string");
+                        assert_eq!(name, "John".to_string());
+                    }
+                })
+                .await
+                .unwrap()
+        });
+    }
+}
diff --git a/server/index-node/Cargo.toml b/server/index-node/Cargo.toml
new file mode 100644
index 0000000..1594369
--- /dev/null
+++ b/server/index-node/Cargo.toml
@@ -0,0 +1,20 @@
+[package]
+name = "graph-server-index-node"
+version = "0.27.0"
+edition = "2021"
+
+[dependencies]
+blake3 = "1.0"
+either = "1.8.0"
+futures = "0.3.4"
+graph = { path = "../../graph" }
+graph-graphql = { path = "../../graphql" }
+graph-chain-arweave = { path = "../../chain/arweave" }
+graph-chain-ethereum = { path = "../../chain/ethereum" }
+graph-chain-near = { path = "../../chain/near" }
+graph-chain-cosmos = { path = "../../chain/cosmos" }
+graphql-parser = "0.4.0"
+http = "0.2"
+hyper = "0.14"
+lazy_static = "1.2.0"
+serde = "1.0"
diff --git a/server/index-node/assets/graphiql.css b/server/index-node/assets/graphiql.css
new file mode 100644
index 0000000..222e806
--- /dev/null
+++ b/server/index-node/assets/graphiql.css
@@ -0,0 +1,1741 @@
+.graphiql-container,
+.graphiql-container button,
+.graphiql-container input {
+  color: #141823;
+  font-family:
+    system,
+    -apple-system,
+    'San Francisco',
+    '.SFNSDisplay-Regular',
+    'Segoe UI',
+    Segoe,
+    'Segoe WP',
+    'Helvetica Neue',
+    helvetica,
+    'Lucida Grande',
+    arial,
+    sans-serif;
+  font-size: 14px;
+}
+
+.graphiql-container {
+  display: -webkit-box;
+  display: -ms-flexbox;
+  display: flex;
+  -webkit-box-orient: horizontal;
+  -webkit-box-direction: normal;
+      -ms-flex-direction: row;
+          flex-direction: row;
+  height: 100%;
+  margin: 0;
+  overflow: hidden;
+  width: 100%;
+}
+
+.graphiql-container .editorWrap {
+  display: -webkit-box;
+  display: -ms-flexbox;
+  display: flex;
+  -webkit-box-orient: vertical;
+  -webkit-box-direction: normal;
+      -ms-flex-direction: column;
+          flex-direction: column;
+  -webkit-box-flex: 1;
+      -ms-flex: 1;
+          flex: 1;
+  overflow-x: hidden;
+}
+
+.graphiql-container .title {
+  font-size: 18px;
+}
+
+.graphiql-container .title em {
+  font-family: georgia;
+  font-size: 19px;
+}
+
+.graphiql-container .topBarWrap {
+  display: -webkit-box;
+  display: -ms-flexbox;
+  display: flex;
+  -webkit-box-orient: horizontal;
+  -webkit-box-direction: normal;
+      -ms-flex-direction: row;
+          flex-direction: row;
+}
+
+.graphiql-container .topBar {
+  -webkit-box-align: center;
+      -ms-flex-align: center;
+          align-items: center;
+  background: -webkit-gradient(linear, left top, left bottom, from(#f7f7f7), to(#e2e2e2));
+  background: linear-gradient(#f7f7f7, #e2e2e2);
+  border-bottom: 1px solid #d0d0d0;
+  cursor: default;
+  display: -webkit-box;
+  display: -ms-flexbox;
+  display: flex;
+  -webkit-box-orient: horizontal;
+  -webkit-box-direction: normal;
+      -ms-flex-direction: row;
+          flex-direction: row;
+  -webkit-box-flex: 1;
+      -ms-flex: 1;
+          flex: 1;
+  height: 34px;
+  overflow-y: visible;
+  padding: 7px 14px 6px;
+  -webkit-user-select: none;
+     -moz-user-select: none;
+      -ms-user-select: none;
+          user-select: none;
+}
+
+.graphiql-container .toolbar {
+  overflow-x: visible;
+  display: -webkit-box;
+  display: -ms-flexbox;
+  display: flex;
+}
+
+.graphiql-container .docExplorerShow,
+.graphiql-container .historyShow {
+  background: -webkit-gradient(linear, left top, left bottom, from(#f7f7f7), to(#e2e2e2));
+  background: linear-gradient(#f7f7f7, #e2e2e2);
+  border-radius: 0;
+  border-bottom: 1px solid #d0d0d0;
+  border-right: none;
+  border-top: none;
+  color: #3B5998;
+  cursor: pointer;
+  font-size: 14px;
+  margin: 0;
+  outline: 0;
+  padding: 2px 20px 0 18px;
+}
+
+.graphiql-container .docExplorerShow {
+  border-left: 1px solid rgba(0, 0, 0, 0.2);
+}
+
+.graphiql-container .historyShow {
+  border-right: 1px solid rgba(0, 0, 0, 0.2);
+  border-left: 0;
+}
+
+.graphiql-container .docExplorerShow:before {
+  border-left: 2px solid #3B5998;
+  border-top: 2px solid #3B5998;
+  content: '';
+  display: inline-block;
+  height: 9px;
+  margin: 0 3px -1px 0;
+  position: relative;
+  -webkit-transform: rotate(-45deg);
+          transform: rotate(-45deg);
+  width: 9px;
+}
+
+.graphiql-container .editorBar {
+  display: -webkit-box;
+  display: -ms-flexbox;
+  display: flex;
+  -webkit-box-orient: horizontal;
+  -webkit-box-direction: normal;
+      -ms-flex-direction: row;
+          flex-direction: row;
+  -webkit-box-flex: 1;
+      -ms-flex: 1;
+          flex: 1;
+}
+
+.graphiql-container .queryWrap {
+  display: -webkit-box;
+  display: -ms-flexbox;
+  display: flex;
+  -webkit-box-orient: vertical;
+  -webkit-box-direction: normal;
+      -ms-flex-direction: column;
+          flex-direction: column;
+  -webkit-box-flex: 1;
+      -ms-flex: 1;
+          flex: 1;
+}
+
+.graphiql-container .resultWrap {
+  border-left: solid 1px #e0e0e0;
+  display: -webkit-box;
+  display: -ms-flexbox;
+  display: flex;
+  -webkit-box-orient: vertical;
+  -webkit-box-direction: normal;
+      -ms-flex-direction: column;
+          flex-direction: column;
+  -webkit-box-flex: 1;
+      -ms-flex: 1;
+          flex: 1;
+  position: relative;
+}
+
+.graphiql-container .docExplorerWrap,
+.graphiql-container .historyPaneWrap {
+  background: white;
+  -webkit-box-shadow: 0 0 8px rgba(0, 0, 0, 0.15);
+          box-shadow: 0 0 8px rgba(0, 0, 0, 0.15);
+  position: relative;
+  z-index: 3;
+}
+
+.graphiql-container .historyPaneWrap {
+  min-width: 230px;
+  z-index: 5;
+}
+
+.graphiql-container .docExplorerResizer {
+  cursor: col-resize;
+  height: 100%;
+  left: -5px;
+  position: absolute;
+  top: 0;
+  width: 10px;
+  z-index: 10;
+}
+
+.graphiql-container .docExplorerHide {
+  cursor: pointer;
+  font-size: 18px;
+  margin: -7px -8px -6px 0;
+  padding: 18px 16px 15px 12px;
+}
+
+.graphiql-container div .query-editor {
+  -webkit-box-flex: 1;
+      -ms-flex: 1;
+          flex: 1;
+  position: relative;
+}
+
+.graphiql-container .variable-editor {
+  display: -webkit-box;
+  display: -ms-flexbox;
+  display: flex;
+  -webkit-box-orient: vertical;
+  -webkit-box-direction: normal;
+      -ms-flex-direction: column;
+          flex-direction: column;
+  height: 29px;
+  position: relative;
+}
+
+.graphiql-container .variable-editor-title {
+  background: #eeeeee;
+  border-bottom: 1px solid #d6d6d6;
+  border-top: 1px solid #e0e0e0;
+  color: #777;
+  font-variant: small-caps;
+  font-weight: bold;
+  letter-spacing: 1px;
+  line-height: 14px;
+  padding: 6px 0 8px 43px;
+  text-transform: lowercase;
+  -webkit-user-select: none;
+     -moz-user-select: none;
+      -ms-user-select: none;
+          user-select: none;
+}
+
+.graphiql-container .codemirrorWrap {
+  -webkit-box-flex: 1;
+      -ms-flex: 1;
+          flex: 1;
+  height: 100%;
+  position: relative;
+}
+
+.graphiql-container .result-window {
+  -webkit-box-flex: 1;
+      -ms-flex: 1;
+          flex: 1;
+  height: 100%;
+  position: relative;
+}
+
+.graphiql-container .footer {
+  background: #f6f7f8;
+  border-left: 1px solid #e0e0e0;
+  border-top: 1px solid #e0e0e0;
+  margin-left: 12px;
+  position: relative;
+}
+
+.graphiql-container .footer:before {
+  background: #eeeeee;
+  bottom: 0;
+  content: " ";
+  left: -13px;
+  position: absolute;
+  top: -1px;
+  width: 12px;
+}
+
+/* No `.graphiql-container` here so themes can overwrite */
+.result-window .CodeMirror {
+  background: #f6f7f8;
+}
+
+.graphiql-container .result-window .CodeMirror-gutters {
+  background-color: #eeeeee;
+  border-color: #e0e0e0;
+  cursor: col-resize;
+}
+
+.graphiql-container .result-window .CodeMirror-foldgutter,
+.graphiql-container .result-window .CodeMirror-foldgutter-open:after,
+.graphiql-container .result-window .CodeMirror-foldgutter-folded:after {
+  padding-left: 3px;
+}
+
+.graphiql-container .toolbar-button {
+  background: #fdfdfd;
+  background: -webkit-gradient(linear, left top, left bottom, from(#f9f9f9), to(#ececec));
+  background: linear-gradient(#f9f9f9, #ececec);
+  border-radius: 3px;
+  -webkit-box-shadow:
+    inset 0 0 0 1px rgba(0,0,0,0.20),
+    0 1px 0 rgba(255,255,255, 0.7),
+    inset 0 1px #fff;
+          box-shadow:
+    inset 0 0 0 1px rgba(0,0,0,0.20),
+    0 1px 0 rgba(255,255,255, 0.7),
+    inset 0 1px #fff;
+  color: #555;
+  cursor: pointer;
+  display: inline-block;
+  margin: 0 5px;
+  padding: 3px 11px 5px;
+  text-decoration: none;
+  text-overflow: ellipsis;
+  white-space: nowrap;
+  max-width: 150px;
+}
+
+.graphiql-container .toolbar-button:active {
+  background: -webkit-gradient(linear, left top, left bottom, from(#ececec), to(#d5d5d5));
+  background: linear-gradient(#ececec, #d5d5d5);
+  -webkit-box-shadow:
+    0 1px 0 rgba(255, 255, 255, 0.7),
+    inset 0 0 0 1px rgba(0,0,0,0.10),
+    inset 0 1px 1px 1px rgba(0, 0, 0, 0.12),
+    inset 0 0 5px rgba(0, 0, 0, 0.1);
+          box-shadow:
+    0 1px 0 rgba(255, 255, 255, 0.7),
+    inset 0 0 0 1px rgba(0,0,0,0.10),
+    inset 0 1px 1px 1px rgba(0, 0, 0, 0.12),
+    inset 0 0 5px rgba(0, 0, 0, 0.1);
+}
+
+.graphiql-container .toolbar-button.error {
+  background: -webkit-gradient(linear, left top, left bottom, from(#fdf3f3), to(#e6d6d7));
+  background: linear-gradient(#fdf3f3, #e6d6d7);
+  color: #b00;
+}
+
+.graphiql-container .toolbar-button-group {
+  margin: 0 5px;
+  white-space: nowrap;
+}
+
+.graphiql-container .toolbar-button-group > * {
+  margin: 0;
+}
+
+.graphiql-container .toolbar-button-group > *:not(:last-child) {
+  border-top-right-radius: 0;
+  border-bottom-right-radius: 0;
+}
+
+.graphiql-container .toolbar-button-group > *:not(:first-child) {
+  border-top-left-radius: 0;
+  border-bottom-left-radius: 0;
+  margin-left: -1px;
+}
+
+.graphiql-container .execute-button-wrap {
+  height: 34px;
+  margin: 0 14px 0 28px;
+  position: relative;
+}
+
+.graphiql-container .execute-button {
+  background: -webkit-gradient(linear, left top, left bottom, from(#fdfdfd), to(#d2d3d6));
+  background: linear-gradient(#fdfdfd, #d2d3d6);
+  border-radius: 17px;
+  border: 1px solid rgba(0,0,0,0.25);
+  -webkit-box-shadow: 0 1px 0 #fff;
+          box-shadow: 0 1px 0 #fff;
+  cursor: pointer;
+  fill: #444;
+  height: 34px;
+  margin: 0;
+  padding: 0;
+  width: 34px;
+}
+
+.graphiql-container .execute-button svg {
+  pointer-events: none;
+}
+
+.graphiql-container .execute-button:active {
+  background: -webkit-gradient(linear, left top, left bottom, from(#e6e6e6), to(#c3c3c3));
+  background: linear-gradient(#e6e6e6, #c3c3c3);
+  -webkit-box-shadow:
+    0 1px 0 #fff,
+    inset 0 0 2px rgba(0, 0, 0, 0.2),
+    inset 0 0 6px rgba(0, 0, 0, 0.1);
+          box-shadow:
+    0 1px 0 #fff,
+    inset 0 0 2px rgba(0, 0, 0, 0.2),
+    inset 0 0 6px rgba(0, 0, 0, 0.1);
+}
+
+.graphiql-container .execute-button:focus {
+  outline: 0;
+}
+
+.graphiql-container .toolbar-menu,
+.graphiql-container .toolbar-select {
+  position: relative;
+}
+
+.graphiql-container .execute-options,
+.graphiql-container .toolbar-menu-items,
+.graphiql-container .toolbar-select-options {
+  background: #fff;
+  -webkit-box-shadow:
+    0 0 0 1px rgba(0,0,0,0.1),
+    0 2px 4px rgba(0,0,0,0.25);
+          box-shadow:
+    0 0 0 1px rgba(0,0,0,0.1),
+    0 2px 4px rgba(0,0,0,0.25);
+  margin: 0;
+  padding: 6px 0;
+  position: absolute;
+  z-index: 100;
+}
+
+.graphiql-container .execute-options {
+  min-width: 100px;
+  top: 37px;
+  left: -1px;
+}
+
+.graphiql-container .toolbar-menu-items {
+  left: 1px;
+  margin-top: -1px;
+  min-width: 110%;
+  top: 100%;
+  visibility: hidden;
+}
+
+.graphiql-container .toolbar-menu-items.open {
+  visibility: visible;
+}
+
+.graphiql-container .toolbar-select-options {
+  left: 0;
+  min-width: 100%;
+  top: -5px;
+  visibility: hidden;
+}
+
+.graphiql-container .toolbar-select-options.open {
+  visibility: visible;
+}
+
+.graphiql-container .execute-options > li,
+.graphiql-container .toolbar-menu-items > li,
+.graphiql-container .toolbar-select-options > li {
+  cursor: pointer;
+  display: block;
+  margin: none;
+  max-width: 300px;
+  overflow: hidden;
+  padding: 2px 20px 4px 11px;
+  text-overflow: ellipsis;
+  white-space: nowrap;
+}
+
+.graphiql-container .execute-options > li.selected,
+.graphiql-container .toolbar-menu-items > li.hover,
+.graphiql-container .toolbar-menu-items > li:active,
+.graphiql-container .toolbar-menu-items > li:hover,
+.graphiql-container .toolbar-select-options > li.hover,
+.graphiql-container .toolbar-select-options > li:active,
+.graphiql-container .toolbar-select-options > li:hover,
+.graphiql-container .history-contents > p:hover,
+.graphiql-container .history-contents > p:active {
+  background: #e10098;
+  color: #fff;
+}
+
+.graphiql-container .toolbar-select-options > li > svg {
+  display: inline;
+  fill: #666;
+  margin: 0 -6px 0 6px;
+  pointer-events: none;
+  vertical-align: middle;
+}
+
+.graphiql-container .toolbar-select-options > li.hover > svg,
+.graphiql-container .toolbar-select-options > li:active > svg,
+.graphiql-container .toolbar-select-options > li:hover > svg {
+  fill: #fff;
+}
+
+.graphiql-container .CodeMirror-scroll {
+  overflow-scrolling: touch;
+}
+
+.graphiql-container .CodeMirror {
+  color: #141823;
+  font-family:
+    'Consolas',
+    'Inconsolata',
+    'Droid Sans Mono',
+    'Monaco',
+    monospace;
+  font-size: 13px;
+  height: 100%;
+  left: 0;
+  position: absolute;
+  top: 0;
+  width: 100%;
+}
+
+.graphiql-container .CodeMirror-lines {
+  padding: 20px 0;
+}
+
+.CodeMirror-hint-information .content {
+  box-orient: vertical;
+  color: #141823;
+  display: -webkit-box;
+  display: -ms-flexbox;
+  display: flex;
+  font-family: system, -apple-system, 'San Francisco', '.SFNSDisplay-Regular', 'Segoe UI', Segoe, 'Segoe WP', 'Helvetica Neue', helvetica, 'Lucida Grande', arial, sans-serif;
+  font-size: 13px;
+  line-clamp: 3;
+  line-height: 16px;
+  max-height: 48px;
+  overflow: hidden;
+  text-overflow: -o-ellipsis-lastline;
+}
+
+.CodeMirror-hint-information .content p:first-child {
+  margin-top: 0;
+}
+
+.CodeMirror-hint-information .content p:last-child {
+  margin-bottom: 0;
+}
+
+.CodeMirror-hint-information .infoType {
+  color: #CA9800;
+  cursor: pointer;
+  display: inline;
+  margin-right: 0.5em;
+}
+
+.autoInsertedLeaf.cm-property {
+  -webkit-animation-duration: 6s;
+          animation-duration: 6s;
+  -webkit-animation-name: insertionFade;
+          animation-name: insertionFade;
+  border-bottom: 2px solid rgba(255, 255, 255, 0);
+  border-radius: 2px;
+  margin: -2px -4px -1px;
+  padding: 2px 4px 1px;
+}
+
+@-webkit-keyframes insertionFade {
+  from, to {
+    background: rgba(255, 255, 255, 0);
+    border-color: rgba(255, 255, 255, 0);
+  }
+
+  15%, 85% {
+    background: #fbffc9;
+    border-color: #f0f3c0;
+  }
+}
+
+@keyframes insertionFade {
+  from, to {
+    background: rgba(255, 255, 255, 0);
+    border-color: rgba(255, 255, 255, 0);
+  }
+
+  15%, 85% {
+    background: #fbffc9;
+    border-color: #f0f3c0;
+  }
+}
+
+div.CodeMirror-lint-tooltip {
+  background-color: white;
+  border-radius: 2px;
+  border: 0;
+  color: #141823;
+  -webkit-box-shadow: 0 1px 3px rgba(0, 0, 0, 0.45);
+          box-shadow: 0 1px 3px rgba(0, 0, 0, 0.45);
+  font-family:
+    system,
+    -apple-system,
+    'San Francisco',
+    '.SFNSDisplay-Regular',
+    'Segoe UI',
+    Segoe,
+    'Segoe WP',
+    'Helvetica Neue',
+    helvetica,
+    'Lucida Grande',
+    arial,
+    sans-serif;
+  font-size: 13px;
+  line-height: 16px;
+  max-width: 430px;
+  opacity: 0;
+  padding: 8px 10px;
+  -webkit-transition: opacity 0.15s;
+  transition: opacity 0.15s;
+  white-space: pre-wrap;
+}
+
+div.CodeMirror-lint-tooltip > * {
+  padding-left: 23px;
+}
+
+div.CodeMirror-lint-tooltip > * + * {
+  margin-top: 12px;
+}
+
+/* COLORS */
+
+.graphiql-container .CodeMirror-foldmarker {
+  border-radius: 4px;
+  background: #08f;
+  background: -webkit-gradient(linear, left top, left bottom, from(#43A8FF), to(#0F83E8));
+  background: linear-gradient(#43A8FF, #0F83E8);
+  -webkit-box-shadow:
+    0 1px 1px rgba(0, 0, 0, 0.2),
+    inset 0 0 0 1px rgba(0, 0, 0, 0.1);
+          box-shadow:
+    0 1px 1px rgba(0, 0, 0, 0.2),
+    inset 0 0 0 1px rgba(0, 0, 0, 0.1);
+  color: white;
+  font-family: arial;
+  font-size: 12px;
+  line-height: 0;
+  margin: 0 3px;
+  padding: 0px 4px 1px;
+  text-shadow: 0 -1px rgba(0, 0, 0, 0.1);
+}
+
+.graphiql-container div.CodeMirror span.CodeMirror-matchingbracket {
+  color: #555;
+  text-decoration: underline;
+}
+
+.graphiql-container div.CodeMirror span.CodeMirror-nonmatchingbracket {
+  color: #f00;
+}
+
+/* Comment */
+.cm-comment {
+  color: #999;
+}
+
+/* Punctuation */
+.cm-punctuation {
+  color: #555;
+}
+
+/* Keyword */
+.cm-keyword {
+  color: #B11A04;
+}
+
+/* OperationName, FragmentName */
+.cm-def {
+  color: #D2054E;
+}
+
+/* FieldName */
+.cm-property {
+  color: #1F61A0;
+}
+
+/* FieldAlias */
+.cm-qualifier {
+  color: #1C92A9;
+}
+
+/* ArgumentName and ObjectFieldName */
+.cm-attribute {
+  color: #8B2BB9;
+}
+
+/* Number */
+.cm-number {
+  color: #2882F9;
+}
+
+/* String */
+.cm-string {
+  color: #D64292;
+}
+
+/* Boolean */
+.cm-builtin {
+  color: #D47509;
+}
+
+/* EnumValue */
+.cm-string-2 {
+  color: #0B7FC7;
+}
+
+/* Variable */
+.cm-variable {
+  color: #397D13;
+}
+
+/* Directive */
+.cm-meta {
+  color: #B33086;
+}
+
+/* Type */
+.cm-atom {
+  color: #CA9800;
+}
+/* BASICS */
+
+.CodeMirror {
+  /* Set height, width, borders, and global font properties here */
+  color: black;
+  font-family: monospace;
+  height: 300px;
+}
+
+/* PADDING */
+
+.CodeMirror-lines {
+  padding: 4px 0; /* Vertical padding around content */
+}
+.CodeMirror pre {
+  padding: 0 4px; /* Horizontal padding of content */
+}
+
+.CodeMirror-scrollbar-filler, .CodeMirror-gutter-filler {
+  background-color: white; /* The little square between H and V scrollbars */
+}
+
+/* GUTTER */
+
+.CodeMirror-gutters {
+  border-right: 1px solid #ddd;
+  background-color: #f7f7f7;
+  white-space: nowrap;
+}
+.CodeMirror-linenumbers {}
+.CodeMirror-linenumber {
+  color: #999;
+  min-width: 20px;
+  padding: 0 3px 0 5px;
+  text-align: right;
+  white-space: nowrap;
+}
+
+.CodeMirror-guttermarker { color: black; }
+.CodeMirror-guttermarker-subtle { color: #999; }
+
+/* CURSOR */
+
+.CodeMirror .CodeMirror-cursor {
+  border-left: 1px solid black;
+}
+/* Shown when moving in bi-directional text */
+.CodeMirror div.CodeMirror-secondarycursor {
+  border-left: 1px solid silver;
+}
+.CodeMirror.cm-fat-cursor div.CodeMirror-cursor {
+  background: #7e7;
+  border: 0;
+  width: auto;
+}
+.CodeMirror.cm-fat-cursor div.CodeMirror-cursors {
+  z-index: 1;
+}
+
+.cm-animate-fat-cursor {
+  -webkit-animation: blink 1.06s steps(1) infinite;
+          animation: blink 1.06s steps(1) infinite;
+  border: 0;
+  width: auto;
+}
+@-webkit-keyframes blink {
+  0% { background: #7e7; }
+  50% { background: none; }
+  100% { background: #7e7; }
+}
+@keyframes blink {
+  0% { background: #7e7; }
+  50% { background: none; }
+  100% { background: #7e7; }
+}
+
+/* Can style cursor different in overwrite (non-insert) mode */
+div.CodeMirror-overwrite div.CodeMirror-cursor {}
+
+.cm-tab { display: inline-block; text-decoration: inherit; }
+
+.CodeMirror-ruler {
+  border-left: 1px solid #ccc;
+  position: absolute;
+}
+
+/* DEFAULT THEME */
+
+.cm-s-default .cm-keyword {color: #708;}
+.cm-s-default .cm-atom {color: #219;}
+.cm-s-default .cm-number {color: #164;}
+.cm-s-default .cm-def {color: #00f;}
+.cm-s-default .cm-variable,
+.cm-s-default .cm-punctuation,
+.cm-s-default .cm-property,
+.cm-s-default .cm-operator {}
+.cm-s-default .cm-variable-2 {color: #05a;}
+.cm-s-default .cm-variable-3 {color: #085;}
+.cm-s-default .cm-comment {color: #a50;}
+.cm-s-default .cm-string {color: #a11;}
+.cm-s-default .cm-string-2 {color: #f50;}
+.cm-s-default .cm-meta {color: #555;}
+.cm-s-default .cm-qualifier {color: #555;}
+.cm-s-default .cm-builtin {color: #30a;}
+.cm-s-default .cm-bracket {color: #997;}
+.cm-s-default .cm-tag {color: #170;}
+.cm-s-default .cm-attribute {color: #00c;}
+.cm-s-default .cm-header {color: blue;}
+.cm-s-default .cm-quote {color: #090;}
+.cm-s-default .cm-hr {color: #999;}
+.cm-s-default .cm-link {color: #00c;}
+
+.cm-negative {color: #d44;}
+.cm-positive {color: #292;}
+.cm-header, .cm-strong {font-weight: bold;}
+.cm-em {font-style: italic;}
+.cm-link {text-decoration: underline;}
+.cm-strikethrough {text-decoration: line-through;}
+
+.cm-s-default .cm-error {color: #f00;}
+.cm-invalidchar {color: #f00;}
+
+.CodeMirror-composing { border-bottom: 2px solid; }
+
+/* Default styles for common addons */
+
+div.CodeMirror span.CodeMirror-matchingbracket {color: #0f0;}
+div.CodeMirror span.CodeMirror-nonmatchingbracket {color: #f22;}
+.CodeMirror-matchingtag { background: rgba(255, 150, 0, .3); }
+.CodeMirror-activeline-background {background: #e8f2ff;}
+
+/* STOP */
+
+/* The rest of this file contains styles related to the mechanics of
+   the editor. You probably shouldn't touch them. */
+
+.CodeMirror {
+  background: white;
+  overflow: hidden;
+  position: relative;
+}
+
+.CodeMirror-scroll {
+  height: 100%;
+  /* 30px is the magic margin used to hide the element's real scrollbars */
+  /* See overflow: hidden in .CodeMirror */
+  margin-bottom: -30px; margin-right: -30px;
+  outline: none; /* Prevent dragging from highlighting the element */
+  overflow: scroll !important; /* Things will break if this is overridden */
+  padding-bottom: 30px;
+  position: relative;
+}
+.CodeMirror-sizer {
+  border-right: 30px solid transparent;
+  position: relative;
+}
+
+/* The fake, visible scrollbars. Used to force redraw during scrolling
+   before actual scrolling happens, thus preventing shaking and
+   flickering artifacts. */
+.CodeMirror-vscrollbar, .CodeMirror-hscrollbar, .CodeMirror-scrollbar-filler, .CodeMirror-gutter-filler {
+  display: none;
+  position: absolute;
+  z-index: 6;
+}
+.CodeMirror-vscrollbar {
+  overflow-x: hidden;
+  overflow-y: scroll;
+  right: 0; top: 0;
+}
+.CodeMirror-hscrollbar {
+  bottom: 0; left: 0;
+  overflow-x: scroll;
+  overflow-y: hidden;
+}
+.CodeMirror-scrollbar-filler {
+  right: 0; bottom: 0;
+}
+.CodeMirror-gutter-filler {
+  left: 0; bottom: 0;
+}
+
+.CodeMirror-gutters {
+  min-height: 100%;
+  position: absolute; left: 0; top: 0;
+  z-index: 3;
+}
+.CodeMirror-gutter {
+  display: inline-block;
+  height: 100%;
+  margin-bottom: -30px;
+  vertical-align: top;
+  white-space: normal;
+  /* Hack to make IE7 behave */
+  *zoom:1;
+  *display:inline;
+}
+.CodeMirror-gutter-wrapper {
+  background: none !important;
+  border: none !important;
+  position: absolute;
+  z-index: 4;
+}
+.CodeMirror-gutter-background {
+  position: absolute;
+  top: 0; bottom: 0;
+  z-index: 4;
+}
+.CodeMirror-gutter-elt {
+  cursor: default;
+  position: absolute;
+  z-index: 4;
+}
+.CodeMirror-gutter-wrapper {
+  -webkit-user-select: none;
+     -moz-user-select: none;
+      -ms-user-select: none;
+          user-select: none;
+}
+
+.CodeMirror-lines {
+  cursor: text;
+  min-height: 1px; /* prevents collapsing before first draw */
+}
+.CodeMirror pre {
+  -webkit-tap-highlight-color: transparent;
+  /* Reset some styles that the rest of the page might have set */
+  background: transparent;
+  border-radius: 0;
+  border-width: 0;
+  color: inherit;
+  font-family: inherit;
+  font-size: inherit;
+  -webkit-font-variant-ligatures: none;
+          font-variant-ligatures: none;
+  line-height: inherit;
+  margin: 0;
+  overflow: visible;
+  position: relative;
+  white-space: pre;
+  word-wrap: normal;
+  z-index: 2;
+}
+.CodeMirror-wrap pre {
+  word-wrap: break-word;
+  white-space: pre-wrap;
+  word-break: normal;
+}
+
+.CodeMirror-linebackground {
+  position: absolute;
+  left: 0; right: 0; top: 0; bottom: 0;
+  z-index: 0;
+}
+
+.CodeMirror-linewidget {
+  overflow: auto;
+  position: relative;
+  z-index: 2;
+}
+
+.CodeMirror-widget {}
+
+.CodeMirror-code {
+  outline: none;
+}
+
+/* Force content-box sizing for the elements where we expect it */
+.CodeMirror-scroll,
+.CodeMirror-sizer,
+.CodeMirror-gutter,
+.CodeMirror-gutters,
+.CodeMirror-linenumber {
+  -webkit-box-sizing: content-box;
+          box-sizing: content-box;
+}
+
+.CodeMirror-measure {
+  height: 0;
+  overflow: hidden;
+  position: absolute;
+  visibility: hidden;
+  width: 100%;
+}
+
+.CodeMirror-cursor { position: absolute; }
+.CodeMirror-measure pre { position: static; }
+
+div.CodeMirror-cursors {
+  position: relative;
+  visibility: hidden;
+  z-index: 3;
+}
+div.CodeMirror-dragcursors {
+  visibility: visible;
+}
+
+.CodeMirror-focused div.CodeMirror-cursors {
+  visibility: visible;
+}
+
+.CodeMirror-selected { background: #d9d9d9; }
+.CodeMirror-focused .CodeMirror-selected { background: #d7d4f0; }
+.CodeMirror-crosshair { cursor: crosshair; }
+.CodeMirror-line::-moz-selection, .CodeMirror-line > span::-moz-selection, .CodeMirror-line > span > span::-moz-selection { background: #d7d4f0; }
+.CodeMirror-line::selection, .CodeMirror-line > span::selection, .CodeMirror-line > span > span::selection { background: #d7d4f0; }
+.CodeMirror-line::-moz-selection, .CodeMirror-line > span::-moz-selection, .CodeMirror-line > span > span::-moz-selection { background: #d7d4f0; }
+
+.cm-searching {
+  background: #ffa;
+  background: rgba(255, 255, 0, .4);
+}
+
+/* IE7 hack to prevent it from returning funny offsetTops on the spans */
+.CodeMirror span { *vertical-align: text-bottom; }
+
+/* Used to force a border model for a node */
+.cm-force-border { padding-right: .1px; }
+
+@media print {
+  /* Hide the cursor when printing */
+  .CodeMirror div.CodeMirror-cursors {
+    visibility: hidden;
+  }
+}
+
+/* See issue #2901 */
+.cm-tab-wrap-hack:after { content: ''; }
+
+/* Help users use markselection to safely style text background */
+span.CodeMirror-selectedtext { background: none; }
+
+.CodeMirror-dialog {
+  background: inherit;
+  color: inherit;
+  left: 0; right: 0;
+  overflow: hidden;
+  padding: .1em .8em;
+  position: absolute;
+  z-index: 15;
+}
+
+.CodeMirror-dialog-top {
+  border-bottom: 1px solid #eee;
+  top: 0;
+}
+
+.CodeMirror-dialog-bottom {
+  border-top: 1px solid #eee;
+  bottom: 0;
+}
+
+.CodeMirror-dialog input {
+  background: transparent;
+  border: 1px solid #d3d6db;
+  color: inherit;
+  font-family: monospace;
+  outline: none;
+  width: 20em;
+}
+
+.CodeMirror-dialog button {
+  font-size: 70%;
+}
+.graphiql-container .doc-explorer {
+  background: white;
+}
+
+.graphiql-container .doc-explorer-title-bar,
+.graphiql-container .history-title-bar {
+  cursor: default;
+  display: -webkit-box;
+  display: -ms-flexbox;
+  display: flex;
+  height: 34px;
+  line-height: 14px;
+  padding: 8px 8px 5px;
+  position: relative;
+  -webkit-user-select: none;
+     -moz-user-select: none;
+      -ms-user-select: none;
+          user-select: none;
+}
+
+.graphiql-container .doc-explorer-title,
+.graphiql-container .history-title {
+  -webkit-box-flex: 1;
+      -ms-flex: 1;
+          flex: 1;
+  font-weight: bold;
+  overflow-x: hidden;
+  padding: 10px 0 10px 10px;
+  text-align: center;
+  text-overflow: ellipsis;
+  -webkit-user-select: initial;
+     -moz-user-select: initial;
+      -ms-user-select: initial;
+          user-select: initial;
+  white-space: nowrap;
+}
+
+.graphiql-container .doc-explorer-back {
+  color: #3B5998;
+  cursor: pointer;
+  margin: -7px 0 -6px -8px;
+  overflow-x: hidden;
+  padding: 17px 12px 16px 16px;
+  text-overflow: ellipsis;
+  white-space: nowrap;
+}
+
+.doc-explorer-narrow .doc-explorer-back {
+  width: 0;
+}
+
+.graphiql-container .doc-explorer-back:before {
+  border-left: 2px solid #3B5998;
+  border-top: 2px solid #3B5998;
+  content: '';
+  display: inline-block;
+  height: 9px;
+  margin: 0 3px -1px 0;
+  position: relative;
+  -webkit-transform: rotate(-45deg);
+          transform: rotate(-45deg);
+  width: 9px;
+}
+
+.graphiql-container .doc-explorer-rhs {
+  position: relative;
+}
+
+.graphiql-container .doc-explorer-contents,
+.graphiql-container .history-contents {
+  background-color: #ffffff;
+  border-top: 1px solid #d6d6d6;
+  bottom: 0;
+  left: 0;
+  overflow-y: auto;
+  padding: 20px 15px;
+  position: absolute;
+  right: 0;
+  top: 47px;
+}
+
+.graphiql-container .doc-explorer-contents {
+  min-width: 300px;
+}
+
+.graphiql-container .doc-type-description p:first-child ,
+.graphiql-container .doc-type-description blockquote:first-child {
+  margin-top: 0;
+}
+
+.graphiql-container .doc-explorer-contents a {
+  cursor: pointer;
+  text-decoration: none;
+}
+
+.graphiql-container .doc-explorer-contents a:hover {
+  text-decoration: underline;
+}
+
+.graphiql-container .doc-value-description > :first-child {
+  margin-top: 4px;
+}
+
+.graphiql-container .doc-value-description > :last-child {
+  margin-bottom: 4px;
+}
+
+.graphiql-container .doc-category {
+  margin: 20px 0;
+}
+
+.graphiql-container .doc-category-title {
+  border-bottom: 1px solid #e0e0e0;
+  color: #777;
+  cursor: default;
+  font-size: 14px;
+  font-variant: small-caps;
+  font-weight: bold;
+  letter-spacing: 1px;
+  margin: 0 -15px 10px 0;
+  padding: 10px 0;
+  -webkit-user-select: none;
+     -moz-user-select: none;
+      -ms-user-select: none;
+          user-select: none;
+}
+
+.graphiql-container .doc-category-item {
+  margin: 12px 0;
+  color: #555;
+}
+
+.graphiql-container .keyword {
+  color: #B11A04;
+}
+
+.graphiql-container .type-name {
+  color: #CA9800;
+}
+
+.graphiql-container .field-name {
+  color: #1F61A0;
+}
+
+.graphiql-container .field-short-description {
+  color: #999;
+  margin-left: 5px;
+  overflow: hidden;
+  text-overflow: ellipsis;
+}
+
+.graphiql-container .enum-value {
+  color: #0B7FC7;
+}
+
+.graphiql-container .arg-name {
+  color: #8B2BB9;
+}
+
+.graphiql-container .arg {
+  display: block;
+  margin-left: 1em;
+}
+
+.graphiql-container .arg:first-child:last-child,
+.graphiql-container .arg:first-child:nth-last-child(2),
+.graphiql-container .arg:first-child:nth-last-child(2) ~ .arg {
+  display: inherit;
+  margin: inherit;
+}
+
+.graphiql-container .arg:first-child:nth-last-child(2):after {
+  content: ', ';
+}
+
+.graphiql-container .arg-default-value {
+  color: #43A047;
+}
+
+.graphiql-container .doc-deprecation {
+  background: #fffae8;
+  -webkit-box-shadow: inset 0 0 1px #bfb063;
+          box-shadow: inset 0 0 1px #bfb063;
+  color: #867F70;
+  line-height: 16px;
+  margin: 8px -8px;
+  max-height: 80px;
+  overflow: hidden;
+  padding: 8px;
+  border-radius: 3px;
+}
+
+.graphiql-container .doc-deprecation:before {
+  content: 'Deprecated:';
+  color: #c79b2e;
+  cursor: default;
+  display: block;
+  font-size: 9px;
+  font-weight: bold;
+  letter-spacing: 1px;
+  line-height: 1;
+  padding-bottom: 5px;
+  text-transform: uppercase;
+  -webkit-user-select: none;
+     -moz-user-select: none;
+      -ms-user-select: none;
+          user-select: none;
+}
+
+.graphiql-container .doc-deprecation > :first-child {
+  margin-top: 0;
+}
+
+.graphiql-container .doc-deprecation > :last-child {
+  margin-bottom: 0;
+}
+
+.graphiql-container .show-btn {
+  -webkit-appearance: initial;
+  display: block;
+  border-radius: 3px;
+  border: solid 1px #ccc;
+  text-align: center;
+  padding: 8px 12px 10px;
+  width: 100%;
+  -webkit-box-sizing: border-box;
+          box-sizing: border-box;
+  background: #fbfcfc;
+  color: #555;
+  cursor: pointer;
+}
+
+.graphiql-container .search-box {
+  border-bottom: 1px solid #d3d6db;
+  display: block;
+  font-size: 14px;
+  margin: -15px -15px 12px 0;
+  position: relative;
+}
+
+.graphiql-container .search-box:before {
+  content: '\26b2';
+  cursor: pointer;
+  display: block;
+  font-size: 24px;
+  position: absolute;
+  top: -2px;
+  -webkit-transform: rotate(-45deg);
+          transform: rotate(-45deg);
+  -webkit-user-select: none;
+     -moz-user-select: none;
+      -ms-user-select: none;
+          user-select: none;
+}
+
+.graphiql-container .search-box .search-box-clear {
+  background-color: #d0d0d0;
+  border-radius: 12px;
+  color: #fff;
+  cursor: pointer;
+  font-size: 11px;
+  padding: 1px 5px 2px;
+  position: absolute;
+  right: 3px;
+  top: 8px;
+  -webkit-user-select: none;
+     -moz-user-select: none;
+      -ms-user-select: none;
+          user-select: none;
+}
+
+.graphiql-container .search-box .search-box-clear:hover {
+  background-color: #b9b9b9;
+}
+
+.graphiql-container .search-box > input {
+  border: none;
+  -webkit-box-sizing: border-box;
+          box-sizing: border-box;
+  font-size: 14px;
+  outline: none;
+  padding: 6px 24px 8px 20px;
+  width: 100%;
+}
+
+.graphiql-container .error-container {
+  font-weight: bold;
+  left: 0;
+  letter-spacing: 1px;
+  opacity: 0.5;
+  position: absolute;
+  right: 0;
+  text-align: center;
+  text-transform: uppercase;
+  top: 50%;
+  -webkit-transform: translate(0, -50%);
+          transform: translate(0, -50%);
+}
+.CodeMirror-foldmarker {
+  color: blue;
+  cursor: pointer;
+  font-family: arial;
+  line-height: .3;
+  text-shadow: #b9f 1px 1px 2px, #b9f -1px -1px 2px, #b9f 1px -1px 2px, #b9f -1px 1px 2px;
+}
+.CodeMirror-foldgutter {
+  width: .7em;
+}
+.CodeMirror-foldgutter-open,
+.CodeMirror-foldgutter-folded {
+  cursor: pointer;
+}
+.CodeMirror-foldgutter-open:after {
+  content: "\25BE";
+}
+.CodeMirror-foldgutter-folded:after {
+  content: "\25B8";
+}
+.graphiql-container .history-contents {
+  font-family: 'Consolas', 'Inconsolata', 'Droid Sans Mono', 'Monaco', monospace;
+  padding: 0;
+}
+
+.graphiql-container .history-contents p {
+  font-size: 12px;
+  overflow: hidden;
+  text-overflow: ellipsis;
+  white-space: nowrap;
+  margin: 0;
+  padding: 8px;
+  border-bottom: 1px solid #e0e0e0;
+}
+
+.graphiql-container .history-contents p:hover {
+  cursor: pointer;
+}
+.CodeMirror-info {
+  background: white;
+  border-radius: 2px;
+  -webkit-box-shadow: 0 1px 3px rgba(0, 0, 0, 0.45);
+          box-shadow: 0 1px 3px rgba(0, 0, 0, 0.45);
+  -webkit-box-sizing: border-box;
+          box-sizing: border-box;
+  color: #555;
+  font-family:
+    system,
+    -apple-system,
+    'San Francisco',
+    '.SFNSDisplay-Regular',
+    'Segoe UI',
+    Segoe,
+    'Segoe WP',
+    'Helvetica Neue',
+    helvetica,
+    'Lucida Grande',
+    arial,
+    sans-serif;
+  font-size: 13px;
+  line-height: 16px;
+  margin: 8px -8px;
+  max-width: 400px;
+  opacity: 0;
+  overflow: hidden;
+  padding: 8px 8px;
+  position: fixed;
+  -webkit-transition: opacity 0.15s;
+  transition: opacity 0.15s;
+  z-index: 50;
+}
+
+.CodeMirror-info :first-child {
+  margin-top: 0;
+}
+
+.CodeMirror-info :last-child {
+  margin-bottom: 0;
+}
+
+.CodeMirror-info p {
+  margin: 1em 0;
+}
+
+.CodeMirror-info .info-description {
+  color: #777;
+  line-height: 16px;
+  margin-top: 1em;
+  max-height: 80px;
+  overflow: hidden;
+}
+
+.CodeMirror-info .info-deprecation {
+  background: #fffae8;
+  -webkit-box-shadow: inset 0 1px 1px -1px #bfb063;
+          box-shadow: inset 0 1px 1px -1px #bfb063;
+  color: #867F70;
+  line-height: 16px;
+  margin: -8px;
+  margin-top: 8px;
+  max-height: 80px;
+  overflow: hidden;
+  padding: 8px;
+}
+
+.CodeMirror-info .info-deprecation-label {
+  color: #c79b2e;
+  cursor: default;
+  display: block;
+  font-size: 9px;
+  font-weight: bold;
+  letter-spacing: 1px;
+  line-height: 1;
+  padding-bottom: 5px;
+  text-transform: uppercase;
+  -webkit-user-select: none;
+     -moz-user-select: none;
+      -ms-user-select: none;
+          user-select: none;
+}
+
+.CodeMirror-info .info-deprecation-label + * {
+  margin-top: 0;
+}
+
+.CodeMirror-info a {
+  text-decoration: none;
+}
+
+.CodeMirror-info a:hover {
+  text-decoration: underline;
+}
+
+.CodeMirror-info .type-name {
+  color: #CA9800;
+}
+
+.CodeMirror-info .field-name {
+  color: #1F61A0;
+}
+
+.CodeMirror-info .enum-value {
+  color: #0B7FC7;
+}
+
+.CodeMirror-info .arg-name {
+  color: #8B2BB9;
+}
+
+.CodeMirror-info .directive-name {
+  color: #B33086;
+}
+.CodeMirror-jump-token {
+  text-decoration: underline;
+  cursor: pointer;
+}
+/* The lint marker gutter */
+.CodeMirror-lint-markers {
+  width: 16px;
+}
+
+.CodeMirror-lint-tooltip {
+  background-color: infobackground;
+  border-radius: 4px 4px 4px 4px;
+  border: 1px solid black;
+  color: infotext;
+  font-family: monospace;
+  font-size: 10pt;
+  max-width: 600px;
+  opacity: 0;
+  overflow: hidden;
+  padding: 2px 5px;
+  position: fixed;
+  -webkit-transition: opacity .4s;
+  transition: opacity .4s;
+  white-space: pre-wrap;
+  z-index: 100;
+}
+
+.CodeMirror-lint-mark-error, .CodeMirror-lint-mark-warning {
+  background-position: left bottom;
+  background-repeat: repeat-x;
+}
+
+.CodeMirror-lint-mark-error {
+  background-image:
+  url("data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAAQAAAADCAYAAAC09K7GAAAAAXNSR0IArs4c6QAAAAZiS0dEAP8A/wD/oL2nkwAAAAlwSFlzAAALEwAACxMBAJqcGAAAAAd0SU1FB9sJDw4cOCW1/KIAAAAZdEVYdENvbW1lbnQAQ3JlYXRlZCB3aXRoIEdJTVBXgQ4XAAAAHElEQVQI12NggIL/DAz/GdA5/xkY/qPKMDAwAADLZwf5rvm+LQAAAABJRU5ErkJggg==")
+  ;
+}
+
+.CodeMirror-lint-mark-warning {
+  background-image: url("data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAAQAAAADCAYAAAC09K7GAAAAAXNSR0IArs4c6QAAAAZiS0dEAP8A/wD/oL2nkwAAAAlwSFlzAAALEwAACxMBAJqcGAAAAAd0SU1FB9sJFhQXEbhTg7YAAAAZdEVYdENvbW1lbnQAQ3JlYXRlZCB3aXRoIEdJTVBXgQ4XAAAAMklEQVQI12NkgIIvJ3QXMjAwdDN+OaEbysDA4MPAwNDNwMCwiOHLCd1zX07o6kBVGQEAKBANtobskNMAAAAASUVORK5CYII=");
+}
+
+.CodeMirror-lint-marker-error, .CodeMirror-lint-marker-warning {
+  background-position: center center;
+  background-repeat: no-repeat;
+  cursor: pointer;
+  display: inline-block;
+  height: 16px;
+  position: relative;
+  vertical-align: middle;
+  width: 16px;
+}
+
+.CodeMirror-lint-message-error, .CodeMirror-lint-message-warning {
+  background-position: top left;
+  background-repeat: no-repeat;
+  padding-left: 18px;
+}
+
+.CodeMirror-lint-marker-error, .CodeMirror-lint-message-error {
+  background-image: url("data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAABAAAAAQCAMAAAAoLQ9TAAAAHlBMVEW7AAC7AACxAAC7AAC7AAAAAAC4AAC5AAD///+7AAAUdclpAAAABnRSTlMXnORSiwCK0ZKSAAAATUlEQVR42mWPOQ7AQAgDuQLx/z8csYRmPRIFIwRGnosRrpamvkKi0FTIiMASR3hhKW+hAN6/tIWhu9PDWiTGNEkTtIOucA5Oyr9ckPgAWm0GPBog6v4AAAAASUVORK5CYII=");
+}
+
+.CodeMirror-lint-marker-warning, .CodeMirror-lint-message-warning {
+  background-image: url("data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAABAAAAAQCAMAAAAoLQ9TAAAANlBMVEX/uwDvrwD/uwD/uwD/uwD/uwD/uwD/uwD/uwD6twD/uwAAAADurwD2tQD7uAD+ugAAAAD/uwDhmeTRAAAADHRSTlMJ8mN1EYcbmiixgACm7WbuAAAAVklEQVR42n3PUQqAIBBFUU1LLc3u/jdbOJoW1P08DA9Gba8+YWJ6gNJoNYIBzAA2chBth5kLmG9YUoG0NHAUwFXwO9LuBQL1giCQb8gC9Oro2vp5rncCIY8L8uEx5ZkAAAAASUVORK5CYII=");
+}
+
+.CodeMirror-lint-marker-multiple {
+  background-image: url("data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAAcAAAAHCAMAAADzjKfhAAAACVBMVEUAAAAAAAC/v7914kyHAAAAAXRSTlMAQObYZgAAACNJREFUeNo1ioEJAAAIwmz/H90iFFSGJgFMe3gaLZ0od+9/AQZ0ADosbYraAAAAAElFTkSuQmCC");
+  background-position: right bottom;
+  background-repeat: no-repeat;
+  width: 100%; height: 100%;
+}
+.graphiql-container .spinner-container {
+  height: 36px;
+  left: 50%;
+  position: absolute;
+  top: 50%;
+  -webkit-transform: translate(-50%, -50%);
+          transform: translate(-50%, -50%);
+  width: 36px;
+  z-index: 10;
+}
+
+.graphiql-container .spinner {
+  -webkit-animation: rotation .6s infinite linear;
+          animation: rotation .6s infinite linear;
+  border-bottom: 6px solid rgba(150, 150, 150, .15);
+  border-left: 6px solid rgba(150, 150, 150, .15);
+  border-radius: 100%;
+  border-right: 6px solid rgba(150, 150, 150, .15);
+  border-top: 6px solid rgba(150, 150, 150, .8);
+  display: inline-block;
+  height: 24px;
+  position: absolute;
+  vertical-align: middle;
+  width: 24px;
+}
+
+@-webkit-keyframes rotation {
+  from { -webkit-transform: rotate(0deg); transform: rotate(0deg); }
+  to { -webkit-transform: rotate(359deg); transform: rotate(359deg); }
+}
+
+@keyframes rotation {
+  from { -webkit-transform: rotate(0deg); transform: rotate(0deg); }
+  to { -webkit-transform: rotate(359deg); transform: rotate(359deg); }
+}
+.CodeMirror-hints {
+  background: white;
+  -webkit-box-shadow: 0 1px 3px rgba(0, 0, 0, 0.45);
+          box-shadow: 0 1px 3px rgba(0, 0, 0, 0.45);
+  font-family: 'Consolas', 'Inconsolata', 'Droid Sans Mono', 'Monaco', monospace;
+  font-size: 13px;
+  list-style: none;
+  margin-left: -6px;
+  margin: 0;
+  max-height: 14.5em;
+  overflow-y: auto;
+  overflow: hidden;
+  padding: 0;
+  position: absolute;
+  z-index: 10;
+}
+
+.CodeMirror-hint {
+  border-top: solid 1px #f7f7f7;
+  color: #141823;
+  cursor: pointer;
+  margin: 0;
+  max-width: 300px;
+  overflow: hidden;
+  padding: 2px 6px;
+  white-space: pre;
+}
+
+li.CodeMirror-hint-active {
+  background-color: #08f;
+  border-top-color: white;
+  color: white;
+}
+
+.CodeMirror-hint-information {
+  border-top: solid 1px #c0c0c0;
+  max-width: 300px;
+  padding: 4px 6px;
+  position: relative;
+  z-index: 1;
+}
+
+.CodeMirror-hint-information:first-child {
+  border-bottom: solid 1px #c0c0c0;
+  border-top: none;
+  margin-bottom: -1px;
+}
+
+.CodeMirror-hint-deprecation {
+  background: #fffae8;
+  -webkit-box-shadow: inset 0 1px 1px -1px #bfb063;
+          box-shadow: inset 0 1px 1px -1px #bfb063;
+  color: #867F70;
+  font-family:
+    system,
+    -apple-system,
+    'San Francisco',
+    '.SFNSDisplay-Regular',
+    'Segoe UI',
+    Segoe,
+    'Segoe WP',
+    'Helvetica Neue',
+    helvetica,
+    'Lucida Grande',
+    arial,
+    sans-serif;
+  font-size: 13px;
+  line-height: 16px;
+  margin-top: 4px;
+  max-height: 80px;
+  overflow: hidden;
+  padding: 6px;
+}
+
+.CodeMirror-hint-deprecation .deprecation-label {
+  color: #c79b2e;
+  cursor: default;
+  display: block;
+  font-size: 9px;
+  font-weight: bold;
+  letter-spacing: 1px;
+  line-height: 1;
+  padding-bottom: 5px;
+  text-transform: uppercase;
+  -webkit-user-select: none;
+     -moz-user-select: none;
+      -ms-user-select: none;
+          user-select: none;
+}
+
+.CodeMirror-hint-deprecation .deprecation-label + * {
+  margin-top: 0;
+}
+
+.CodeMirror-hint-deprecation :last-child {
+  margin-bottom: 0;
+}
diff --git a/server/index-node/assets/graphiql.min.js b/server/index-node/assets/graphiql.min.js
new file mode 100644
index 0000000..fd7b158
--- /dev/null
+++ b/server/index-node/assets/graphiql.min.js
@@ -0,0 +1 @@
+!function(f){if("object"==typeof exports&&"undefined"!=typeof module)module.exports=f();else if("function"==typeof define&&define.amd)define([],f);else{("undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof self?self:this).GraphiQL=f()}}(function(){return function e(t,n,r){function s(o,u){if(!n[o]){if(!t[o]){var a="function"==typeof require&&require;if(!u&&a)return a(o,!0);if(i)return i(o,!0);var f=new Error("Cannot find module '"+o+"'");throw f.code="MODULE_NOT_FOUND",f}var l=n[o]={exports:{}};t[o][0].call(l.exports,function(e){var n=t[o][1][e];return s(n||e)},l,l.exports,e,t,n,r)}return n[o].exports}for(var i="function"==typeof require&&require,o=0;o<r.length;o++)s(r[o]);return s}({1:[function(require,module,exports){(function(global){"use strict";function _interopRequireDefault(e){return e&&e.__esModule?e:{default:e}}function _classCallCheck(e,t){if(!(e instanceof t))throw new TypeError("Cannot call a class as a function")}function _possibleConstructorReturn(e,t){if(!e)throw new ReferenceError("this hasn't been initialised - super() hasn't been called");return!t||"object"!=typeof t&&"function"!=typeof t?e:t}function _inherits(e,t){if("function"!=typeof t&&null!==t)throw new TypeError("Super expression must either be null or a function, not "+typeof t);e.prototype=Object.create(t&&t.prototype,{constructor:{value:e,enumerable:!1,writable:!0,configurable:!0}}),t&&(Object.setPrototypeOf?Object.setPrototypeOf(e,t):e.__proto__=t)}Object.defineProperty(exports,"__esModule",{value:!0}),exports.DocExplorer=void 0;var _extends=Object.assign||function(e){for(var t=1;t<arguments.length;t++){var a=arguments[t];for(var r in a)Object.prototype.hasOwnProperty.call(a,r)&&(e[r]=a[r])}return e},_createClass=function(){function e(e,t){for(var a=0;a<t.length;a++){var r=t[a];r.enumerable=r.enumerable||!1,r.configurable=!0,"value"in r&&(r.writable=!0),Object.defineProperty(e,r.key,r)}}return function(t,a,r){return a&&e(t.prototype,a),r&&e(t,r),t}}(),_react2=_interopRequireDefault("undefined"!=typeof window?window.React:void 0!==global?global.React:null),_propTypes2=_interopRequireDefault(require("prop-types")),_graphql=require("graphql"),_FieldDoc2=_interopRequireDefault(require("./DocExplorer/FieldDoc")),_SchemaDoc2=_interopRequireDefault(require("./DocExplorer/SchemaDoc")),_SearchBox2=_interopRequireDefault(require("./DocExplorer/SearchBox")),_SearchResults2=_interopRequireDefault(require("./DocExplorer/SearchResults")),_TypeDoc2=_interopRequireDefault(require("./DocExplorer/TypeDoc")),initialNav={name:"Schema",title:"Documentation Explorer"};(exports.DocExplorer=function(e){function t(){_classCallCheck(this,t);var e=_possibleConstructorReturn(this,(t.__proto__||Object.getPrototypeOf(t)).call(this));return e.handleNavBackClick=function(){e.state.navStack.length>1&&e.setState({navStack:e.state.navStack.slice(0,-1)})},e.handleClickTypeOrField=function(t){e.showDoc(t)},e.handleSearch=function(t){e.showSearch(t)},e.state={navStack:[initialNav]},e}return _inherits(t,e),_createClass(t,[{key:"shouldComponentUpdate",value:function(e,t){return this.props.schema!==e.schema||this.state.navStack!==t.navStack}},{key:"render",value:function(){var e=this.props.schema,t=this.state.navStack,a=t[t.length-1],r=void 0;r=void 0===e?_react2.default.createElement("div",{className:"spinner-container"},_react2.default.createElement("div",{className:"spinner"})):e?a.search?_react2.default.createElement(_SearchResults2.default,{searchValue:a.search,withinType:a.def,schema:e,onClickType:this.handleClickTypeOrField,onClickField:this.handleClickTypeOrField}):1===t.length?_react2.default.createElement(_SchemaDoc2.default,{schema:e,onClickType:this.handleClickTypeOrField}):(0,_graphql.isType)(a.def)?_react2.default.createElement(_TypeDoc2.default,{schema:e,type:a.def,onClickType:this.handleClickTypeOrField,onClickField:this.handleClickTypeOrField}):_react2.default.createElement(_FieldDoc2.default,{field:a.def,onClickType:this.handleClickTypeOrField}):_react2.default.createElement("div",{className:"error-container"},"No Schema Available");var c=1===t.length||(0,_graphql.isType)(a.def)&&a.def.getFields,l=void 0;return t.length>1&&(l=t[t.length-2].name),_react2.default.createElement("div",{className:"doc-explorer",key:a.name},_react2.default.createElement("div",{className:"doc-explorer-title-bar"},l&&_react2.default.createElement("div",{className:"doc-explorer-back",onClick:this.handleNavBackClick},l),_react2.default.createElement("div",{className:"doc-explorer-title"},a.title||a.name),_react2.default.createElement("div",{className:"doc-explorer-rhs"},this.props.children)),_react2.default.createElement("div",{className:"doc-explorer-contents"},c&&_react2.default.createElement(_SearchBox2.default,{value:a.search,placeholder:"Search "+a.name+"...",onSearch:this.handleSearch}),r))}},{key:"showDoc",value:function(e){var t=this.state.navStack;t[t.length-1].def!==e&&this.setState({navStack:t.concat([{name:e.name,def:e}])})}},{key:"showDocForReference",value:function(e){"Type"===e.kind?this.showDoc(e.type):"Field"===e.kind?this.showDoc(e.field):"Argument"===e.kind&&e.field?this.showDoc(e.field):"EnumValue"===e.kind&&e.type&&this.showDoc(e.type)}},{key:"showSearch",value:function(e){var t=this.state.navStack.slice(),a=t[t.length-1];t[t.length-1]=_extends({},a,{search:e}),this.setState({navStack:t})}},{key:"reset",value:function(){this.setState({navStack:[initialNav]})}}]),t}(_react2.default.Component)).propTypes={schema:_propTypes2.default.instanceOf(_graphql.GraphQLSchema)}}).call(this,"undefined"!=typeof global?global:"undefined"!=typeof self?self:"undefined"!=typeof window?window:{})},{"./DocExplorer/FieldDoc":4,"./DocExplorer/SchemaDoc":6,"./DocExplorer/SearchBox":7,"./DocExplorer/SearchResults":8,"./DocExplorer/TypeDoc":9,graphql:95,"prop-types":233}],2:[function(require,module,exports){(function(global){"use strict";function _interopRequireDefault(e){return e&&e.__esModule?e:{default:e}}function Argument(e){var t=e.arg,r=e.onClickType,a=e.showDefaultValue;return _react2.default.createElement("span",{className:"arg"},_react2.default.createElement("span",{className:"arg-name"},t.name),": ",_react2.default.createElement(_TypeLink2.default,{type:t.type,onClick:r}),!1!==a&&_react2.default.createElement(_DefaultValue2.default,{field:t}))}Object.defineProperty(exports,"__esModule",{value:!0}),exports.default=Argument;var _react2=_interopRequireDefault("undefined"!=typeof window?window.React:void 0!==global?global.React:null),_propTypes2=_interopRequireDefault(require("prop-types")),_TypeLink2=_interopRequireDefault(require("./TypeLink")),_DefaultValue2=_interopRequireDefault(require("./DefaultValue"));Argument.propTypes={arg:_propTypes2.default.object.isRequired,onClickType:_propTypes2.default.func.isRequired,showDefaultValue:_propTypes2.default.bool}}).call(this,"undefined"!=typeof global?global:"undefined"!=typeof self?self:"undefined"!=typeof window?window:{})},{"./DefaultValue":3,"./TypeLink":10,"prop-types":233}],3:[function(require,module,exports){(function(global){"use strict";function _interopRequireDefault(e){return e&&e.__esModule?e:{default:e}}function DefaultValue(e){var r=e.field,t=r.type,a=r.defaultValue;return void 0!==a?_react2.default.createElement("span",null," = ",_react2.default.createElement("span",{className:"arg-default-value"},(0,_graphql.print)((0,_graphql.astFromValue)(a,t)))):null}Object.defineProperty(exports,"__esModule",{value:!0}),exports.default=DefaultValue;var _react2=_interopRequireDefault("undefined"!=typeof window?window.React:void 0!==global?global.React:null),_propTypes2=_interopRequireDefault(require("prop-types")),_graphql=require("graphql");DefaultValue.propTypes={field:_propTypes2.default.object.isRequired}}).call(this,"undefined"!=typeof global?global:"undefined"!=typeof self?self:"undefined"!=typeof window?window:{})},{graphql:95,"prop-types":233}],4:[function(require,module,exports){(function(global){"use strict";function _interopRequireDefault(e){return e&&e.__esModule?e:{default:e}}function _classCallCheck(e,t){if(!(e instanceof t))throw new TypeError("Cannot call a class as a function")}function _possibleConstructorReturn(e,t){if(!e)throw new ReferenceError("this hasn't been initialised - super() hasn't been called");return!t||"object"!=typeof t&&"function"!=typeof t?e:t}function _inherits(e,t){if("function"!=typeof t&&null!==t)throw new TypeError("Super expression must either be null or a function, not "+typeof t);e.prototype=Object.create(t&&t.prototype,{constructor:{value:e,enumerable:!1,writable:!0,configurable:!0}}),t&&(Object.setPrototypeOf?Object.setPrototypeOf(e,t):e.__proto__=t)}Object.defineProperty(exports,"__esModule",{value:!0});var _createClass=function(){function e(e,t){for(var r=0;r<t.length;r++){var n=t[r];n.enumerable=n.enumerable||!1,n.configurable=!0,"value"in n&&(n.writable=!0),Object.defineProperty(e,n.key,n)}}return function(t,r,n){return r&&e(t.prototype,r),n&&e(t,n),t}}(),_react2=_interopRequireDefault("undefined"!=typeof window?window.React:void 0!==global?global.React:null),_propTypes2=_interopRequireDefault(require("prop-types")),_Argument2=_interopRequireDefault(require("./Argument")),_MarkdownContent2=_interopRequireDefault(require("./MarkdownContent")),_TypeLink2=_interopRequireDefault(require("./TypeLink")),FieldDoc=function(e){function t(){return _classCallCheck(this,t),_possibleConstructorReturn(this,(t.__proto__||Object.getPrototypeOf(t)).apply(this,arguments))}return _inherits(t,e),_createClass(t,[{key:"shouldComponentUpdate",value:function(e){return this.props.field!==e.field}},{key:"render",value:function(){var e=this,t=this.props.field,r=void 0;return t.args&&t.args.length>0&&(r=_react2.default.createElement("div",{className:"doc-category"},_react2.default.createElement("div",{className:"doc-category-title"},"arguments"),t.args.map(function(t){return _react2.default.createElement("div",{key:t.name,className:"doc-category-item"},_react2.default.createElement("div",null,_react2.default.createElement(_Argument2.default,{arg:t,onClickType:e.props.onClickType})),_react2.default.createElement(_MarkdownContent2.default,{className:"doc-value-description",markdown:t.description}))}))),_react2.default.createElement("div",null,_react2.default.createElement(_MarkdownContent2.default,{className:"doc-type-description",markdown:t.description||"No Description"}),t.deprecationReason&&_react2.default.createElement(_MarkdownContent2.default,{className:"doc-deprecation",markdown:t.deprecationReason}),_react2.default.createElement("div",{className:"doc-category"},_react2.default.createElement("div",{className:"doc-category-title"},"type"),_react2.default.createElement(_TypeLink2.default,{type:t.type,onClick:this.props.onClickType})),r)}}]),t}(_react2.default.Component);FieldDoc.propTypes={field:_propTypes2.default.object,onClickType:_propTypes2.default.func},exports.default=FieldDoc}).call(this,"undefined"!=typeof global?global:"undefined"!=typeof self?self:"undefined"!=typeof window?window:{})},{"./Argument":2,"./MarkdownContent":5,"./TypeLink":10,"prop-types":233}],5:[function(require,module,exports){(function(global){"use strict";function _interopRequireDefault(e){return e&&e.__esModule?e:{default:e}}function _classCallCheck(e,t){if(!(e instanceof t))throw new TypeError("Cannot call a class as a function")}function _possibleConstructorReturn(e,t){if(!e)throw new ReferenceError("this hasn't been initialised - super() hasn't been called");return!t||"object"!=typeof t&&"function"!=typeof t?e:t}function _inherits(e,t){if("function"!=typeof t&&null!==t)throw new TypeError("Super expression must either be null or a function, not "+typeof t);e.prototype=Object.create(t&&t.prototype,{constructor:{value:e,enumerable:!1,writable:!0,configurable:!0}}),t&&(Object.setPrototypeOf?Object.setPrototypeOf(e,t):e.__proto__=t)}Object.defineProperty(exports,"__esModule",{value:!0});var _createClass=function(){function e(e,t){for(var r=0;r<t.length;r++){var n=t[r];n.enumerable=n.enumerable||!1,n.configurable=!0,"value"in n&&(n.writable=!0),Object.defineProperty(e,n.key,n)}}return function(t,r,n){return r&&e(t.prototype,r),n&&e(t,n),t}}(),_react2=_interopRequireDefault("undefined"!=typeof window?window.React:void 0!==global?global.React:null),_propTypes2=_interopRequireDefault(require("prop-types")),md=new(_interopRequireDefault(require("markdown-it")).default),MarkdownContent=function(e){function t(){return _classCallCheck(this,t),_possibleConstructorReturn(this,(t.__proto__||Object.getPrototypeOf(t)).apply(this,arguments))}return _inherits(t,e),_createClass(t,[{key:"shouldComponentUpdate",value:function(e){return this.props.markdown!==e.markdown}},{key:"render",value:function(){var e=this.props.markdown;return e?_react2.default.createElement("div",{className:this.props.className,dangerouslySetInnerHTML:{__html:md.render(e)}}):_react2.default.createElement("div",null)}}]),t}(_react2.default.Component);MarkdownContent.propTypes={markdown:_propTypes2.default.string,className:_propTypes2.default.string},exports.default=MarkdownContent}).call(this,"undefined"!=typeof global?global:"undefined"!=typeof self?self:"undefined"!=typeof window?window:{})},{"markdown-it":172,"prop-types":233}],6:[function(require,module,exports){(function(global){"use strict";function _interopRequireDefault(e){return e&&e.__esModule?e:{default:e}}function _classCallCheck(e,t){if(!(e instanceof t))throw new TypeError("Cannot call a class as a function")}function _possibleConstructorReturn(e,t){if(!e)throw new ReferenceError("this hasn't been initialised - super() hasn't been called");return!t||"object"!=typeof t&&"function"!=typeof t?e:t}function _inherits(e,t){if("function"!=typeof t&&null!==t)throw new TypeError("Super expression must either be null or a function, not "+typeof t);e.prototype=Object.create(t&&t.prototype,{constructor:{value:e,enumerable:!1,writable:!0,configurable:!0}}),t&&(Object.setPrototypeOf?Object.setPrototypeOf(e,t):e.__proto__=t)}Object.defineProperty(exports,"__esModule",{value:!0});var _createClass=function(){function e(e,t){for(var r=0;r<t.length;r++){var a=t[r];a.enumerable=a.enumerable||!1,a.configurable=!0,"value"in a&&(a.writable=!0),Object.defineProperty(e,a.key,a)}}return function(t,r,a){return r&&e(t.prototype,r),a&&e(t,a),t}}(),_react2=_interopRequireDefault("undefined"!=typeof window?window.React:void 0!==global?global.React:null),_propTypes2=_interopRequireDefault(require("prop-types")),_TypeLink2=_interopRequireDefault(require("./TypeLink")),_MarkdownContent2=_interopRequireDefault(require("./MarkdownContent")),SchemaDoc=function(e){function t(){return _classCallCheck(this,t),_possibleConstructorReturn(this,(t.__proto__||Object.getPrototypeOf(t)).apply(this,arguments))}return _inherits(t,e),_createClass(t,[{key:"shouldComponentUpdate",value:function(e){return this.props.schema!==e.schema}},{key:"render",value:function(){var e=this.props.schema,t=e.getQueryType(),r=e.getMutationType&&e.getMutationType(),a=e.getSubscriptionType&&e.getSubscriptionType();return _react2.default.createElement("div",null,_react2.default.createElement(_MarkdownContent2.default,{className:"doc-type-description",markdown:"A GraphQL schema provides a root type for each kind of operation."}),_react2.default.createElement("div",{className:"doc-category"},_react2.default.createElement("div",{className:"doc-category-title"},"root types"),_react2.default.createElement("div",{className:"doc-category-item"},_react2.default.createElement("span",{className:"keyword"},"query"),": ",_react2.default.createElement(_TypeLink2.default,{type:t,onClick:this.props.onClickType})),r&&_react2.default.createElement("div",{className:"doc-category-item"},_react2.default.createElement("span",{className:"keyword"},"mutation"),": ",_react2.default.createElement(_TypeLink2.default,{type:r,onClick:this.props.onClickType})),a&&_react2.default.createElement("div",{className:"doc-category-item"},_react2.default.createElement("span",{className:"keyword"},"subscription"),": ",_react2.default.createElement(_TypeLink2.default,{type:a,onClick:this.props.onClickType}))))}}]),t}(_react2.default.Component);SchemaDoc.propTypes={schema:_propTypes2.default.object,onClickType:_propTypes2.default.func},exports.default=SchemaDoc}).call(this,"undefined"!=typeof global?global:"undefined"!=typeof self?self:"undefined"!=typeof window?window:{})},{"./MarkdownContent":5,"./TypeLink":10,"prop-types":233}],7:[function(require,module,exports){(function(global){"use strict";function _interopRequireDefault(e){return e&&e.__esModule?e:{default:e}}function _classCallCheck(e,t){if(!(e instanceof t))throw new TypeError("Cannot call a class as a function")}function _possibleConstructorReturn(e,t){if(!e)throw new ReferenceError("this hasn't been initialised - super() hasn't been called");return!t||"object"!=typeof t&&"function"!=typeof t?e:t}function _inherits(e,t){if("function"!=typeof t&&null!==t)throw new TypeError("Super expression must either be null or a function, not "+typeof t);e.prototype=Object.create(t&&t.prototype,{constructor:{value:e,enumerable:!1,writable:!0,configurable:!0}}),t&&(Object.setPrototypeOf?Object.setPrototypeOf(e,t):e.__proto__=t)}Object.defineProperty(exports,"__esModule",{value:!0});var _createClass=function(){function e(e,t){for(var r=0;r<t.length;r++){var n=t[r];n.enumerable=n.enumerable||!1,n.configurable=!0,"value"in n&&(n.writable=!0),Object.defineProperty(e,n.key,n)}}return function(t,r,n){return r&&e(t.prototype,r),n&&e(t,n),t}}(),_react2=_interopRequireDefault("undefined"!=typeof window?window.React:void 0!==global?global.React:null),_propTypes2=_interopRequireDefault(require("prop-types")),_debounce2=_interopRequireDefault(require("../../utility/debounce")),SearchBox=function(e){function t(e){_classCallCheck(this,t);var r=_possibleConstructorReturn(this,(t.__proto__||Object.getPrototypeOf(t)).call(this,e));return r.handleChange=function(e){var t=e.target.value;r.setState({value:t}),r.debouncedOnSearch(t)},r.handleClear=function(){r.setState({value:""}),r.props.onSearch("")},r.state={value:e.value||""},r.debouncedOnSearch=(0,_debounce2.default)(200,r.props.onSearch),r}return _inherits(t,e),_createClass(t,[{key:"render",value:function(){return _react2.default.createElement("label",{className:"search-box"},_react2.default.createElement("input",{value:this.state.value,onChange:this.handleChange,type:"text",placeholder:this.props.placeholder}),this.state.value&&_react2.default.createElement("div",{className:"search-box-clear",onClick:this.handleClear},"✕"))}}]),t}(_react2.default.Component);SearchBox.propTypes={value:_propTypes2.default.string,placeholder:_propTypes2.default.string,onSearch:_propTypes2.default.func},exports.default=SearchBox}).call(this,"undefined"!=typeof global?global:"undefined"!=typeof self?self:"undefined"!=typeof window?window:{})},{"../../utility/debounce":26,"prop-types":233}],8:[function(require,module,exports){(function(global){"use strict";function _interopRequireDefault(e){return e&&e.__esModule?e:{default:e}}function _classCallCheck(e,t){if(!(e instanceof t))throw new TypeError("Cannot call a class as a function")}function _possibleConstructorReturn(e,t){if(!e)throw new ReferenceError("this hasn't been initialised - super() hasn't been called");return!t||"object"!=typeof t&&"function"!=typeof t?e:t}function _inherits(e,t){if("function"!=typeof t&&null!==t)throw new TypeError("Super expression must either be null or a function, not "+typeof t);e.prototype=Object.create(t&&t.prototype,{constructor:{value:e,enumerable:!1,writable:!0,configurable:!0}}),t&&(Object.setPrototypeOf?Object.setPrototypeOf(e,t):e.__proto__=t)}function isMatch(e,t){try{var r=t.replace(/[^_0-9A-Za-z]/g,function(e){return"\\"+e});return-1!==e.search(new RegExp(r,"i"))}catch(r){return-1!==e.toLowerCase().indexOf(t.toLowerCase())}}Object.defineProperty(exports,"__esModule",{value:!0});var _createClass=function(){function e(e,t){for(var r=0;r<t.length;r++){var n=t[r];n.enumerable=n.enumerable||!1,n.configurable=!0,"value"in n&&(n.writable=!0),Object.defineProperty(e,n.key,n)}}return function(t,r,n){return r&&e(t.prototype,r),n&&e(t,n),t}}(),_react2=_interopRequireDefault("undefined"!=typeof window?window.React:void 0!==global?global.React:null),_propTypes2=_interopRequireDefault(require("prop-types")),_Argument2=_interopRequireDefault(require("./Argument")),_TypeLink2=_interopRequireDefault(require("./TypeLink")),SearchResults=function(e){function t(){return _classCallCheck(this,t),_possibleConstructorReturn(this,(t.__proto__||Object.getPrototypeOf(t)).apply(this,arguments))}return _inherits(t,e),_createClass(t,[{key:"shouldComponentUpdate",value:function(e){return this.props.schema!==e.schema||this.props.searchValue!==e.searchValue}},{key:"render",value:function(){var e=this.props.searchValue,t=this.props.withinType,r=this.props.schema,n=this.props.onClickType,a=this.props.onClickField,o=[],l=[],u=[],c=r.getTypeMap(),i=Object.keys(c);t&&(i=i.filter(function(e){return e!==t.name})).unshift(t.name);var s=!0,p=!1,f=void 0;try{for(var h,_=i[Symbol.iterator]();!(s=(h=_.next()).done)&&"break"!==function(){var r=h.value;if(o.length+l.length+u.length>=100)return"break";var i=c[r];if(t!==i&&isMatch(r,e)&&l.push(_react2.default.createElement("div",{className:"doc-category-item",key:r},_react2.default.createElement(_TypeLink2.default,{type:i,onClick:n}))),i.getFields){var s=i.getFields();Object.keys(s).forEach(function(l){var c=s[l],p=void 0;if(!isMatch(l,e)){if(!c.args||!c.args.length)return;if(0===(p=c.args.filter(function(t){return isMatch(t.name,e)})).length)return}var f=_react2.default.createElement("div",{className:"doc-category-item",key:r+"."+l},t!==i&&[_react2.default.createElement(_TypeLink2.default,{key:"type",type:i,onClick:n}),"."],_react2.default.createElement("a",{className:"field-name",onClick:function(e){return a(c,i,e)}},c.name),p&&["(",_react2.default.createElement("span",{key:"args"},p.map(function(e){return _react2.default.createElement(_Argument2.default,{key:e.name,arg:e,onClickType:n,showDefaultValue:!1})})),")"]);t===i?o.push(f):u.push(f)})}}();s=!0);}catch(e){p=!0,f=e}finally{try{!s&&_.return&&_.return()}finally{if(p)throw f}}return o.length+l.length+u.length===0?_react2.default.createElement("span",{className:"doc-alert-text"},"No results found."):t&&l.length+u.length>0?_react2.default.createElement("div",null,o,_react2.default.createElement("div",{className:"doc-category"},_react2.default.createElement("div",{className:"doc-category-title"},"other results"),l,u)):_react2.default.createElement("div",null,o,l,u)}}]),t}(_react2.default.Component);SearchResults.propTypes={schema:_propTypes2.default.object,withinType:_propTypes2.default.object,searchValue:_propTypes2.default.string,onClickType:_propTypes2.default.func,onClickField:_propTypes2.default.func},exports.default=SearchResults}).call(this,"undefined"!=typeof global?global:"undefined"!=typeof self?self:"undefined"!=typeof window?window:{})},{"./Argument":2,"./TypeLink":10,"prop-types":233}],9:[function(require,module,exports){(function(global){"use strict";function _interopRequireDefault(e){return e&&e.__esModule?e:{default:e}}function _classCallCheck(e,t){if(!(e instanceof t))throw new TypeError("Cannot call a class as a function")}function _possibleConstructorReturn(e,t){if(!e)throw new ReferenceError("this hasn't been initialised - super() hasn't been called");return!t||"object"!=typeof t&&"function"!=typeof t?e:t}function _inherits(e,t){if("function"!=typeof t&&null!==t)throw new TypeError("Super expression must either be null or a function, not "+typeof t);e.prototype=Object.create(t&&t.prototype,{constructor:{value:e,enumerable:!1,writable:!0,configurable:!0}}),t&&(Object.setPrototypeOf?Object.setPrototypeOf(e,t):e.__proto__=t)}function Field(e){var t=e.type,a=e.field,r=e.onClickType,n=e.onClickField;return _react2.default.createElement("div",{className:"doc-category-item"},_react2.default.createElement("a",{className:"field-name",onClick:function(e){return n(a,t,e)}},a.name),a.args&&a.args.length>0&&["(",_react2.default.createElement("span",{key:"args"},a.args.map(function(e){return _react2.default.createElement(_Argument2.default,{key:e.name,arg:e,onClickType:r})})),")"],": ",_react2.default.createElement(_TypeLink2.default,{type:a.type,onClick:r}),_react2.default.createElement(_DefaultValue2.default,{field:a}),a.description&&_react2.default.createElement(_MarkdownContent2.default,{className:"field-short-description",markdown:a.description}),a.deprecationReason&&_react2.default.createElement(_MarkdownContent2.default,{className:"doc-deprecation",markdown:a.deprecationReason}))}function EnumValue(e){var t=e.value;return _react2.default.createElement("div",{className:"doc-category-item"},_react2.default.createElement("div",{className:"enum-value"},t.name),_react2.default.createElement(_MarkdownContent2.default,{className:"doc-value-description",markdown:t.description}),t.deprecationReason&&_react2.default.createElement(_MarkdownContent2.default,{className:"doc-deprecation",markdown:t.deprecationReason}))}Object.defineProperty(exports,"__esModule",{value:!0});var _createClass=function(){function e(e,t){for(var a=0;a<t.length;a++){var r=t[a];r.enumerable=r.enumerable||!1,r.configurable=!0,"value"in r&&(r.writable=!0),Object.defineProperty(e,r.key,r)}}return function(t,a,r){return a&&e(t.prototype,a),r&&e(t,r),t}}(),_react2=_interopRequireDefault("undefined"!=typeof window?window.React:void 0!==global?global.React:null),_propTypes2=_interopRequireDefault(require("prop-types")),_graphql=require("graphql"),_Argument2=_interopRequireDefault(require("./Argument")),_MarkdownContent2=_interopRequireDefault(require("./MarkdownContent")),_TypeLink2=_interopRequireDefault(require("./TypeLink")),_DefaultValue2=_interopRequireDefault(require("./DefaultValue")),TypeDoc=function(e){function t(e){_classCallCheck(this,t);var a=_possibleConstructorReturn(this,(t.__proto__||Object.getPrototypeOf(t)).call(this,e));return a.handleShowDeprecated=function(){return a.setState({showDeprecated:!0})},a.state={showDeprecated:!1},a}return _inherits(t,e),_createClass(t,[{key:"shouldComponentUpdate",value:function(e,t){return this.props.type!==e.type||this.props.schema!==e.schema||this.state.showDeprecated!==t.showDeprecated}},{key:"render",value:function(){var e=this.props.schema,t=this.props.type,a=this.props.onClickType,r=this.props.onClickField,n=void 0,c=void 0;t instanceof _graphql.GraphQLUnionType?(n="possible types",c=e.getPossibleTypes(t)):t instanceof _graphql.GraphQLInterfaceType?(n="implementations",c=e.getPossibleTypes(t)):t instanceof _graphql.GraphQLObjectType&&(n="implements",c=t.getInterfaces());var l=void 0;c&&c.length>0&&(l=_react2.default.createElement("div",{className:"doc-category"},_react2.default.createElement("div",{className:"doc-category-title"},n),c.map(function(e){return _react2.default.createElement("div",{key:e.name,className:"doc-category-item"},_react2.default.createElement(_TypeLink2.default,{type:e,onClick:a}))})));var o=void 0,i=void 0;if(t.getFields){var u=t.getFields(),p=Object.keys(u).map(function(e){return u[e]});o=_react2.default.createElement("div",{className:"doc-category"},_react2.default.createElement("div",{className:"doc-category-title"},"fields"),p.filter(function(e){return!e.isDeprecated}).map(function(e){return _react2.default.createElement(Field,{key:e.name,type:t,field:e,onClickType:a,onClickField:r})}));var s=p.filter(function(e){return e.isDeprecated});s.length>0&&(i=_react2.default.createElement("div",{className:"doc-category"},_react2.default.createElement("div",{className:"doc-category-title"},"deprecated fields"),this.state.showDeprecated?s.map(function(e){return _react2.default.createElement(Field,{key:e.name,type:t,field:e,onClickType:a,onClickField:r})}):_react2.default.createElement("button",{className:"show-btn",onClick:this.handleShowDeprecated},"Show deprecated fields...")))}var d=void 0,f=void 0;if(t instanceof _graphql.GraphQLEnumType){var m=t.getValues();d=_react2.default.createElement("div",{className:"doc-category"},_react2.default.createElement("div",{className:"doc-category-title"},"values"),m.filter(function(e){return!e.isDeprecated}).map(function(e){return _react2.default.createElement(EnumValue,{key:e.name,value:e})}));var _=m.filter(function(e){return e.isDeprecated});_.length>0&&(f=_react2.default.createElement("div",{className:"doc-category"},_react2.default.createElement("div",{className:"doc-category-title"},"deprecated values"),this.state.showDeprecated?_.map(function(e){return _react2.default.createElement(EnumValue,{key:e.name,value:e})}):_react2.default.createElement("button",{className:"show-btn",onClick:this.handleShowDeprecated},"Show deprecated values...")))}return _react2.default.createElement("div",null,_react2.default.createElement(_MarkdownContent2.default,{className:"doc-type-description",markdown:t.description||"No Description"}),t instanceof _graphql.GraphQLObjectType&&l,o,i,d,f,!(t instanceof _graphql.GraphQLObjectType)&&l)}}]),t}(_react2.default.Component);TypeDoc.propTypes={schema:_propTypes2.default.instanceOf(_graphql.GraphQLSchema),type:_propTypes2.default.object,onClickType:_propTypes2.default.func,onClickField:_propTypes2.default.func},exports.default=TypeDoc,Field.propTypes={type:_propTypes2.default.object,field:_propTypes2.default.object,onClickType:_propTypes2.default.func,onClickField:_propTypes2.default.func},EnumValue.propTypes={value:_propTypes2.default.object}}).call(this,"undefined"!=typeof global?global:"undefined"!=typeof self?self:"undefined"!=typeof window?window:{})},{"./Argument":2,"./DefaultValue":3,"./MarkdownContent":5,"./TypeLink":10,graphql:95,"prop-types":233}],10:[function(require,module,exports){(function(global){"use strict";function _interopRequireDefault(e){return e&&e.__esModule?e:{default:e}}function _classCallCheck(e,t){if(!(e instanceof t))throw new TypeError("Cannot call a class as a function")}function _possibleConstructorReturn(e,t){if(!e)throw new ReferenceError("this hasn't been initialised - super() hasn't been called");return!t||"object"!=typeof t&&"function"!=typeof t?e:t}function _inherits(e,t){if("function"!=typeof t&&null!==t)throw new TypeError("Super expression must either be null or a function, not "+typeof t);e.prototype=Object.create(t&&t.prototype,{constructor:{value:e,enumerable:!1,writable:!0,configurable:!0}}),t&&(Object.setPrototypeOf?Object.setPrototypeOf(e,t):e.__proto__=t)}function renderType(e,t){return e instanceof _graphql.GraphQLNonNull?_react2.default.createElement("span",null,renderType(e.ofType,t),"!"):e instanceof _graphql.GraphQLList?_react2.default.createElement("span",null,"[",renderType(e.ofType,t),"]"):_react2.default.createElement("a",{className:"type-name",onClick:function(r){return t(e,r)}},e.name)}Object.defineProperty(exports,"__esModule",{value:!0});var _createClass=function(){function e(e,t){for(var r=0;r<t.length;r++){var n=t[r];n.enumerable=n.enumerable||!1,n.configurable=!0,"value"in n&&(n.writable=!0),Object.defineProperty(e,n.key,n)}}return function(t,r,n){return r&&e(t.prototype,r),n&&e(t,n),t}}(),_react2=_interopRequireDefault("undefined"!=typeof window?window.React:void 0!==global?global.React:null),_propTypes2=_interopRequireDefault(require("prop-types")),_graphql=require("graphql"),TypeLink=function(e){function t(){return _classCallCheck(this,t),_possibleConstructorReturn(this,(t.__proto__||Object.getPrototypeOf(t)).apply(this,arguments))}return _inherits(t,e),_createClass(t,[{key:"shouldComponentUpdate",value:function(e){return this.props.type!==e.type}},{key:"render",value:function(){return renderType(this.props.type,this.props.onClick)}}]),t}(_react2.default.Component);TypeLink.propTypes={type:_propTypes2.default.object,onClick:_propTypes2.default.func},exports.default=TypeLink}).call(this,"undefined"!=typeof global?global:"undefined"!=typeof self?self:"undefined"!=typeof window?window:{})},{graphql:95,"prop-types":233}],11:[function(require,module,exports){(function(global){"use strict";function _interopRequireDefault(e){return e&&e.__esModule?e:{default:e}}function _classCallCheck(e,t){if(!(e instanceof t))throw new TypeError("Cannot call a class as a function")}function _possibleConstructorReturn(e,t){if(!e)throw new ReferenceError("this hasn't been initialised - super() hasn't been called");return!t||"object"!=typeof t&&"function"!=typeof t?e:t}function _inherits(e,t){if("function"!=typeof t&&null!==t)throw new TypeError("Super expression must either be null or a function, not "+typeof t);e.prototype=Object.create(t&&t.prototype,{constructor:{value:e,enumerable:!1,writable:!0,configurable:!0}}),t&&(Object.setPrototypeOf?Object.setPrototypeOf(e,t):e.__proto__=t)}Object.defineProperty(exports,"__esModule",{value:!0}),exports.ExecuteButton=void 0;var _createClass=function(){function e(e,t){for(var n=0;n<t.length;n++){var o=t[n];o.enumerable=o.enumerable||!1,o.configurable=!0,"value"in o&&(o.writable=!0),Object.defineProperty(e,o.key,o)}}return function(t,n,o){return n&&e(t.prototype,n),o&&e(t,o),t}}(),_react2=_interopRequireDefault("undefined"!=typeof window?window.React:void 0!==global?global.React:null),_propTypes2=_interopRequireDefault(require("prop-types"));(exports.ExecuteButton=function(e){function t(e){_classCallCheck(this,t);var n=_possibleConstructorReturn(this,(t.__proto__||Object.getPrototypeOf(t)).call(this,e));return n._onClick=function(){n.props.isRunning?n.props.onStop():n.props.onRun()},n._onOptionSelected=function(e){n.setState({optionsOpen:!1}),n.props.onRun(e.name&&e.name.value)},n._onOptionsOpen=function(e){var t=!0,o=e.target;n.setState({highlight:null,optionsOpen:!0});var r=function(e){t&&e.target===o?t=!1:(document.removeEventListener("mouseup",r),r=null,o.parentNode.compareDocumentPosition(e.target)&Node.DOCUMENT_POSITION_CONTAINED_BY||n.setState({optionsOpen:!1}))};document.addEventListener("mouseup",r)},n.state={optionsOpen:!1,highlight:null},n}return _inherits(t,e),_createClass(t,[{key:"render",value:function(){var e=this,t=this.props.operations,n=this.state.optionsOpen,o=t&&t.length>1,r=null;if(o&&n){var u=this.state.highlight;r=_react2.default.createElement("ul",{className:"execute-options"},t.map(function(t){return _react2.default.createElement("li",{key:t.name?t.name.value:"*",className:t===u&&"selected"||null,onMouseOver:function(){return e.setState({highlight:t})},onMouseOut:function(){return e.setState({highlight:null})},onMouseUp:function(){return e._onOptionSelected(t)}},t.name?t.name.value:"<Unnamed>")}))}var a=void 0;!this.props.isRunning&&o||(a=this._onClick);var i=void 0;this.props.isRunning||!o||n||(i=this._onOptionsOpen);var s=this.props.isRunning?_react2.default.createElement("path",{d:"M 10 10 L 23 10 L 23 23 L 10 23 z"}):_react2.default.createElement("path",{d:"M 11 9 L 24 16 L 11 23 z"});return _react2.default.createElement("div",{className:"execute-button-wrap"},_react2.default.createElement("button",{type:"button",className:"execute-button",onMouseDown:i,onClick:a,title:"Execute Query (Ctrl-Enter)"},_react2.default.createElement("svg",{width:"34",height:"34"},s)),r)}}]),t}(_react2.default.Component)).propTypes={onRun:_propTypes2.default.func,onStop:_propTypes2.default.func,isRunning:_propTypes2.default.bool,operations:_propTypes2.default.array}}).call(this,"undefined"!=typeof global?global:"undefined"!=typeof self?self:"undefined"!=typeof window?window:{})},{"prop-types":233}],12:[function(require,module,exports){(function(global){"use strict";function _interopRequireDefault(e){return e&&e.__esModule?e:{default:e}}function _classCallCheck(e,t){if(!(e instanceof t))throw new TypeError("Cannot call a class as a function")}function _possibleConstructorReturn(e,t){if(!e)throw new ReferenceError("this hasn't been initialised - super() hasn't been called");return!t||"object"!=typeof t&&"function"!=typeof t?e:t}function _inherits(e,t){if("function"!=typeof t&&null!==t)throw new TypeError("Super expression must either be null or a function, not "+typeof t);e.prototype=Object.create(t&&t.prototype,{constructor:{value:e,enumerable:!1,writable:!0,configurable:!0}}),t&&(Object.setPrototypeOf?Object.setPrototypeOf(e,t):e.__proto__=t)}function isPromise(e){return"object"===(void 0===e?"undefined":_typeof(e))&&"function"==typeof e.then}function observableToPromise(e){return isObservable(e)?new Promise(function(t,r){var o=e.subscribe(function(e){t(e),o.unsubscribe()},r,function(){r(new Error("no value resolved"))})}):e}function isObservable(e){return"object"===(void 0===e?"undefined":_typeof(e))&&"function"==typeof e.subscribe}Object.defineProperty(exports,"__esModule",{value:!0}),exports.GraphiQL=void 0;var _typeof="function"==typeof Symbol&&"symbol"==typeof Symbol.iterator?function(e){return typeof e}:function(e){return e&&"function"==typeof Symbol&&e.constructor===Symbol&&e!==Symbol.prototype?"symbol":typeof e},_extends=Object.assign||function(e){for(var t=1;t<arguments.length;t++){var r=arguments[t];for(var o in r)Object.prototype.hasOwnProperty.call(r,o)&&(e[o]=r[o])}return e},_createClass=function(){function e(e,t){for(var r=0;r<t.length;r++){var o=t[r];o.enumerable=o.enumerable||!1,o.configurable=!0,"value"in o&&(o.writable=!0),Object.defineProperty(e,o.key,o)}}return function(t,r,o){return r&&e(t.prototype,r),o&&e(t,o),t}}(),_react2=_interopRequireDefault("undefined"!=typeof window?window.React:void 0!==global?global.React:null),_propTypes2=_interopRequireDefault(require("prop-types")),_reactDom2=_interopRequireDefault("undefined"!=typeof window?window.ReactDOM:void 0!==global?global.ReactDOM:null),_graphql=require("graphql"),_ExecuteButton=require("./ExecuteButton"),_ToolbarButton=require("./ToolbarButton"),_ToolbarGroup=require("./ToolbarGroup"),_ToolbarMenu=require("./ToolbarMenu"),_ToolbarSelect=require("./ToolbarSelect"),_QueryEditor=require("./QueryEditor"),_VariableEditor=require("./VariableEditor"),_ResultViewer=require("./ResultViewer"),_DocExplorer=require("./DocExplorer"),_QueryHistory=require("./QueryHistory"),_CodeMirrorSizer2=_interopRequireDefault(require("../utility/CodeMirrorSizer")),_StorageAPI2=_interopRequireDefault(require("../utility/StorageAPI")),_getQueryFacts2=_interopRequireDefault(require("../utility/getQueryFacts")),_getSelectedOperationName2=_interopRequireDefault(require("../utility/getSelectedOperationName")),_debounce2=_interopRequireDefault(require("../utility/debounce")),_find2=_interopRequireDefault(require("../utility/find")),_fillLeafs2=require("../utility/fillLeafs"),_elementPosition=require("../utility/elementPosition"),_introspectionQueries=require("../utility/introspectionQueries"),DEFAULT_DOC_EXPLORER_WIDTH=350,GraphiQL=exports.GraphiQL=function(e){function t(e){_classCallCheck(this,t);var r=_possibleConstructorReturn(this,(t.__proto__||Object.getPrototypeOf(t)).call(this,e));if(_initialiseProps.call(r),"function"!=typeof e.fetcher)throw new TypeError("GraphiQL requires a fetcher function.");r._storage=new _StorageAPI2.default(e.storage);var o=void 0!==e.query?e.query:null!==r._storage.get("query")?r._storage.get("query"):void 0!==e.defaultQuery?e.defaultQuery:defaultQuery,i=(0,_getQueryFacts2.default)(e.schema,o),n=void 0!==e.variables?e.variables:r._storage.get("variables"),a=void 0!==e.operationName?e.operationName:(0,_getSelectedOperationName2.default)(null,r._storage.get("operationName"),i&&i.operations);return r.state=_extends({schema:e.schema,query:o,variables:n,operationName:a,response:e.response,editorFlex:Number(r._storage.get("editorFlex"))||1,variableEditorOpen:Boolean(n),variableEditorHeight:Number(r._storage.get("variableEditorHeight"))||200,docExplorerOpen:"true"===r._storage.get("docExplorerOpen")||!1,historyPaneOpen:"true"===r._storage.get("historyPaneOpen")||!1,docExplorerWidth:Number(r._storage.get("docExplorerWidth"))||DEFAULT_DOC_EXPLORER_WIDTH,isWaitingForResponse:!1,subscription:null},i),r._editorQueryID=0,"object"===("undefined"==typeof window?"undefined":_typeof(window))&&window.addEventListener("beforeunload",function(){return r.componentWillUnmount()}),r}return _inherits(t,e),_createClass(t,[{key:"componentDidMount",value:function(){void 0===this.state.schema&&this._fetchSchema(),this.codeMirrorSizer=new _CodeMirrorSizer2.default,global.g=this}},{key:"componentWillReceiveProps",value:function(e){var t=this,r=this.state.schema,o=this.state.query,i=this.state.variables,n=this.state.operationName,a=this.state.response;if(void 0!==e.schema&&(r=e.schema),void 0!==e.query&&(o=e.query),void 0!==e.variables&&(i=e.variables),void 0!==e.operationName&&(n=e.operationName),void 0!==e.response&&(a=e.response),r!==this.state.schema||o!==this.state.query||n!==this.state.operationName){var s=this._updateQueryFacts(o,n,this.state.operations,r);void 0!==s&&(n=s.operationName,this.setState(s))}void 0===e.schema&&e.fetcher!==this.props.fetcher&&(r=void 0),this.setState({schema:r,query:o,variables:i,operationName:n,response:a},function(){void 0===t.state.schema&&(t.docExplorerComponent.reset(),t._fetchSchema())})}},{key:"componentDidUpdate",value:function(){this.codeMirrorSizer.updateSizes([this.queryEditorComponent,this.variableEditorComponent,this.resultComponent])}},{key:"componentWillUnmount",value:function(){this._storage.set("query",this.state.query),this._storage.set("variables",this.state.variables),this._storage.set("operationName",this.state.operationName),this._storage.set("editorFlex",this.state.editorFlex),this._storage.set("variableEditorHeight",this.state.variableEditorHeight),this._storage.set("docExplorerWidth",this.state.docExplorerWidth),this._storage.set("docExplorerOpen",this.state.docExplorerOpen),this._storage.set("historyPaneOpen",this.state.historyPaneOpen)}},{key:"render",value:function(){var e=this,r=_react2.default.Children.toArray(this.props.children),o=(0,_find2.default)(r,function(e){return e.type===t.Logo})||_react2.default.createElement(t.Logo,null),i=(0,_find2.default)(r,function(e){return e.type===t.Toolbar})||_react2.default.createElement(t.Toolbar,null,_react2.default.createElement(_ToolbarButton.ToolbarButton,{onClick:this.handlePrettifyQuery,title:"Prettify Query (Shift-Ctrl-P)",label:"Prettify"}),_react2.default.createElement(_ToolbarButton.ToolbarButton,{onClick:this.handleToggleHistory,title:"Show History",label:"History"})),n=(0,_find2.default)(r,function(e){return e.type===t.Footer}),a={WebkitFlex:this.state.editorFlex,flex:this.state.editorFlex},s={display:this.state.docExplorerOpen?"block":"none",width:this.state.docExplorerWidth},l="docExplorerWrap"+(this.state.docExplorerWidth<200?" doc-explorer-narrow":""),u={display:this.state.historyPaneOpen?"block":"none",width:"230px",zIndex:"7"},c=this.state.variableEditorOpen,d={height:c?this.state.variableEditorHeight:null};return _react2.default.createElement("div",{className:"graphiql-container"},_react2.default.createElement("div",{className:"historyPaneWrap",style:u},_react2.default.createElement(_QueryHistory.QueryHistory,{operationName:this.state.operationName,query:this.state.query,variables:this.state.variables,onSelectQuery:this.handleSelectHistoryQuery,storage:this._storage,queryID:this._editorQueryID},_react2.default.createElement("div",{className:"docExplorerHide",onClick:this.handleToggleHistory},"✕"))),_react2.default.createElement("div",{className:"editorWrap"},_react2.default.createElement("div",{className:"topBarWrap"},_react2.default.createElement("div",{className:"topBar"},o,_react2.default.createElement(_ExecuteButton.ExecuteButton,{isRunning:Boolean(this.state.subscription),onRun:this.handleRunQuery,onStop:this.handleStopQuery,operations:this.state.operations}),i),!this.state.docExplorerOpen&&_react2.default.createElement("button",{className:"docExplorerShow",onClick:this.handleToggleDocs},"Docs")),_react2.default.createElement("div",{ref:function(t){e.editorBarComponent=t},className:"editorBar",onDoubleClick:this.handleResetResize,onMouseDown:this.handleResizeStart},_react2.default.createElement("div",{className:"queryWrap",style:a},_react2.default.createElement(_QueryEditor.QueryEditor,{ref:function(t){e.queryEditorComponent=t},schema:this.state.schema,value:this.state.query,onEdit:this.handleEditQuery,onHintInformationRender:this.handleHintInformationRender,onClickReference:this.handleClickReference,onPrettifyQuery:this.handlePrettifyQuery,onRunQuery:this.handleEditorRunQuery,editorTheme:this.props.editorTheme}),_react2.default.createElement("div",{className:"variable-editor",style:d},_react2.default.createElement("div",{className:"variable-editor-title",style:{cursor:c?"row-resize":"n-resize"},onMouseDown:this.handleVariableResizeStart},"Query Variables"),_react2.default.createElement(_VariableEditor.VariableEditor,{ref:function(t){e.variableEditorComponent=t},value:this.state.variables,variableToType:this.state.variableToType,onEdit:this.handleEditVariables,onHintInformationRender:this.handleHintInformationRender,onPrettifyQuery:this.handlePrettifyQuery,onRunQuery:this.handleEditorRunQuery,editorTheme:this.props.editorTheme}))),_react2.default.createElement("div",{className:"resultWrap"},this.state.isWaitingForResponse&&_react2.default.createElement("div",{className:"spinner-container"},_react2.default.createElement("div",{className:"spinner"})),_react2.default.createElement(_ResultViewer.ResultViewer,{ref:function(t){e.resultComponent=t},value:this.state.response,editorTheme:this.props.editorTheme,ResultsTooltip:this.props.ResultsTooltip}),n))),_react2.default.createElement("div",{className:l,style:s},_react2.default.createElement("div",{className:"docExplorerResizer",onDoubleClick:this.handleDocsResetResize,onMouseDown:this.handleDocsResizeStart}),_react2.default.createElement(_DocExplorer.DocExplorer,{ref:function(t){e.docExplorerComponent=t},schema:this.state.schema},_react2.default.createElement("div",{className:"docExplorerHide",onClick:this.handleToggleDocs},"✕"))))}},{key:"getQueryEditor",value:function(){return this.queryEditorComponent.getCodeMirror()}},{key:"getVariableEditor",value:function(){return this.variableEditorComponent.getCodeMirror()}},{key:"refresh",value:function(){this.queryEditorComponent.getCodeMirror().refresh(),this.variableEditorComponent.getCodeMirror().refresh(),this.resultComponent.getCodeMirror().refresh()}},{key:"autoCompleteLeafs",value:function(){var e=(0,_fillLeafs2.fillLeafs)(this.state.schema,this.state.query,this.props.getDefaultFieldNames),t=e.insertions,r=e.result;if(t&&t.length>0){var o=this.getQueryEditor();o.operation(function(){var e=o.getCursor(),i=o.indexFromPos(e);o.setValue(r);var n=0,a=t.map(function(e){var t=e.index,r=e.string;return o.markText(o.posFromIndex(t+n),o.posFromIndex(t+(n+=r.length)),{className:"autoInsertedLeaf",clearOnEnter:!0,title:"Automatically added leaf fields"})});setTimeout(function(){return a.forEach(function(e){return e.clear()})},7e3);var s=i;t.forEach(function(e){var t=e.index,r=e.string;t<i&&(s+=r.length)}),o.setCursor(o.posFromIndex(s))})}return r}},{key:"_fetchSchema",value:function(){var e=this,t=this.props.fetcher,r=observableToPromise(t({query:_introspectionQueries.introspectionQuery}));isPromise(r)?r.then(function(e){if(e.data)return e;var o=observableToPromise(t({query:_introspectionQueries.introspectionQuerySansSubscriptions}));if(!isPromise(r))throw new Error("Fetcher did not return a Promise for introspection.");return o}).then(function(t){if(void 0===e.state.schema)if(t&&t.data){var r=(0,_graphql.buildClientSchema)(t.data),o=(0,_getQueryFacts2.default)(r,e.state.query);e.setState(_extends({schema:r},o))}else{var i="string"==typeof t?t:JSON.stringify(t,null,2);e.setState({schema:null,response:i})}}).catch(function(t){e.setState({schema:null,response:t&&String(t.stack||t)})}):this.setState({response:"Fetcher did not return a Promise for introspection."})}},{key:"_fetchQuery",value:function(e,t,r,o){var i=this,n=this.props.fetcher,a=null;try{a=t&&""!==t.trim()?JSON.parse(t):null}catch(e){throw new Error("Variables are invalid JSON: "+e.message+".")}if("object"!==(void 0===a?"undefined":_typeof(a)))throw new Error("Variables are not a JSON object.");var s=n({query:e,variables:a,operationName:r});if(!isPromise(s)){if(isObservable(s))return s.subscribe({next:o,error:function(e){i.setState({isWaitingForResponse:!1,response:e&&String(e.stack||e),subscription:null})},complete:function(){i.setState({isWaitingForResponse:!1,subscription:null})}});throw new Error("Fetcher did not return Promise or Observable.")}s.then(o).catch(function(e){i.setState({isWaitingForResponse:!1,response:e&&String(e.stack||e)})})}},{key:"_runQueryAtCursor",value:function(){if(this.state.subscription)this.handleStopQuery();else{var e=void 0,t=this.state.operations;if(t){var r=this.getQueryEditor();if(r.hasFocus())for(var o=r.getCursor(),i=r.indexFromPos(o),n=0;n<t.length;n++){var a=t[n];if(a.loc.start<=i&&a.loc.end>=i){e=a.name&&a.name.value;break}}}this.handleRunQuery(e)}}},{key:"_didClickDragBar",value:function(e){if(0!==e.button||e.ctrlKey)return!1;var t=e.target;if(0!==t.className.indexOf("CodeMirror-gutter"))return!1;for(var r=_reactDom2.default.findDOMNode(this.resultComponent);t;){if(t===r)return!0;t=t.parentNode}return!1}}]),t}(_react2.default.Component);GraphiQL.propTypes={fetcher:_propTypes2.default.func.isRequired,schema:_propTypes2.default.instanceOf(_graphql.GraphQLSchema),query:_propTypes2.default.string,variables:_propTypes2.default.string,operationName:_propTypes2.default.string,response:_propTypes2.default.string,storage:_propTypes2.default.shape({getItem:_propTypes2.default.func,setItem:_propTypes2.default.func,removeItem:_propTypes2.default.func}),defaultQuery:_propTypes2.default.string,onEditQuery:_propTypes2.default.func,onEditVariables:_propTypes2.default.func,onEditOperationName:_propTypes2.default.func,onToggleDocs:_propTypes2.default.func,getDefaultFieldNames:_propTypes2.default.func,editorTheme:_propTypes2.default.string,onToggleHistory:_propTypes2.default.func,ResultsTooltip:_propTypes2.default.any};var _initialiseProps=function(){var e=this;this.handleClickReference=function(t){e.setState({docExplorerOpen:!0},function(){e.docExplorerComponent.showDocForReference(t)})},this.handleRunQuery=function(t){var r=++e._editorQueryID,o=e.autoCompleteLeafs()||e.state.query,i=e.state.variables,n=e.state.operationName;t&&t!==n&&(n=t,e.handleEditOperationName(n));try{e.setState({isWaitingForResponse:!0,response:null,operationName:n});var a=e._fetchQuery(o,i,n,function(t){r===e._editorQueryID&&e.setState({isWaitingForResponse:!1,response:JSON.stringify(t,null,2)})});e.setState({subscription:a})}catch(t){e.setState({isWaitingForResponse:!1,response:t.message})}},this.handleStopQuery=function(){var t=e.state.subscription;e.setState({isWaitingForResponse:!1,subscription:null}),t&&t.unsubscribe()},this.handlePrettifyQuery=function(){var t=e.getQueryEditor();t.setValue((0,_graphql.print)((0,_graphql.parse)(t.getValue())))},this.handleEditQuery=(0,_debounce2.default)(100,function(t){var r=e._updateQueryFacts(t,e.state.operationName,e.state.operations,e.state.schema);if(e.setState(_extends({query:t},r)),e.props.onEditQuery)return e.props.onEditQuery(t)}),this._updateQueryFacts=function(t,r,o,i){var n=(0,_getQueryFacts2.default)(i,t);if(n){var a=(0,_getSelectedOperationName2.default)(o,r,n.operations),s=e.props.onEditOperationName;return s&&r!==a&&s(a),_extends({operationName:a},n)}},this.handleEditVariables=function(t){e.setState({variables:t}),e.props.onEditVariables&&e.props.onEditVariables(t)},this.handleEditOperationName=function(t){var r=e.props.onEditOperationName;r&&r(t)},this.handleHintInformationRender=function(t){t.addEventListener("click",e._onClickHintInformation);var r=void 0;t.addEventListener("DOMNodeRemoved",r=function(){t.removeEventListener("DOMNodeRemoved",r),t.removeEventListener("click",e._onClickHintInformation)})},this.handleEditorRunQuery=function(){e._runQueryAtCursor()},this._onClickHintInformation=function(t){if("typeName"===t.target.className){var r=t.target.innerHTML,o=e.state.schema;if(o){var i=o.getType(r);i&&e.setState({docExplorerOpen:!0},function(){e.docExplorerComponent.showDoc(i)})}}},this.handleToggleDocs=function(){"function"==typeof e.props.onToggleDocs&&e.props.onToggleDocs(!e.state.docExplorerOpen),e.setState({docExplorerOpen:!e.state.docExplorerOpen})},this.handleToggleHistory=function(){"function"==typeof e.props.onToggleHistory&&e.props.onToggleHistory(!e.state.historyPaneOpen),e.setState({historyPaneOpen:!e.state.historyPaneOpen})},this.handleSelectHistoryQuery=function(t,r,o){e.handleEditQuery(t),e.handleEditVariables(r),e.handleEditOperationName(o)},this.handleResizeStart=function(t){if(e._didClickDragBar(t)){t.preventDefault();var r=t.clientX-(0,_elementPosition.getLeft)(t.target),o=function(t){if(0===t.buttons)return i();var o=_reactDom2.default.findDOMNode(e.editorBarComponent),n=t.clientX-(0,_elementPosition.getLeft)(o)-r,a=o.clientWidth-n;e.setState({editorFlex:n/a})},i=function(e){function t(){return e.apply(this,arguments)}return t.toString=function(){return e.toString()},t}(function(){document.removeEventListener("mousemove",o),document.removeEventListener("mouseup",i),o=null,i=null});document.addEventListener("mousemove",o),document.addEventListener("mouseup",i)}},this.handleResetResize=function(){e.setState({editorFlex:1})},this.handleDocsResizeStart=function(t){t.preventDefault();var r=e.state.docExplorerWidth,o=t.clientX-(0,_elementPosition.getLeft)(t.target),i=function(t){if(0===t.buttons)return n();var r=_reactDom2.default.findDOMNode(e),i=t.clientX-(0,_elementPosition.getLeft)(r)-o,a=r.clientWidth-i;a<100?e.setState({docExplorerOpen:!1}):e.setState({docExplorerOpen:!0,docExplorerWidth:Math.min(a,650)})},n=function(e){function t(){return e.apply(this,arguments)}return t.toString=function(){return e.toString()},t}(function(){e.state.docExplorerOpen||e.setState({docExplorerWidth:r}),document.removeEventListener("mousemove",i),document.removeEventListener("mouseup",n),i=null,n=null});document.addEventListener("mousemove",i),document.addEventListener("mouseup",n)},this.handleDocsResetResize=function(){e.setState({docExplorerWidth:DEFAULT_DOC_EXPLORER_WIDTH})},this.handleVariableResizeStart=function(t){t.preventDefault();var r=!1,o=e.state.variableEditorOpen,i=e.state.variableEditorHeight,n=t.clientY-(0,_elementPosition.getTop)(t.target),a=function(t){if(0===t.buttons)return s();r=!0;var o=_reactDom2.default.findDOMNode(e.editorBarComponent),a=t.clientY-(0,_elementPosition.getTop)(o)-n,l=o.clientHeight-a;l<60?e.setState({variableEditorOpen:!1,variableEditorHeight:i}):e.setState({variableEditorOpen:!0,variableEditorHeight:l})},s=function(e){function t(){return e.apply(this,arguments)}return t.toString=function(){return e.toString()},t}(function(){r||e.setState({variableEditorOpen:!o}),document.removeEventListener("mousemove",a),document.removeEventListener("mouseup",s),a=null,s=null});document.addEventListener("mousemove",a),document.addEventListener("mouseup",s)}};GraphiQL.Logo=function(e){return _react2.default.createElement("div",{className:"title"},e.children||_react2.default.createElement("span",null,"Graph",_react2.default.createElement("em",null,"i"),"QL"))},GraphiQL.Toolbar=function(e){return _react2.default.createElement("div",{className:"toolbar"},e.children)},GraphiQL.QueryEditor=_QueryEditor.QueryEditor,GraphiQL.VariableEditor=_VariableEditor.VariableEditor,GraphiQL.ResultViewer=_ResultViewer.ResultViewer,GraphiQL.Button=_ToolbarButton.ToolbarButton,GraphiQL.ToolbarButton=_ToolbarButton.ToolbarButton,GraphiQL.Group=_ToolbarGroup.ToolbarGroup,GraphiQL.Menu=_ToolbarMenu.ToolbarMenu,GraphiQL.MenuItem=_ToolbarMenu.ToolbarMenuItem,GraphiQL.Select=_ToolbarSelect.ToolbarSelect,GraphiQL.SelectOption=_ToolbarSelect.ToolbarSelectOption,GraphiQL.Footer=function(e){return _react2.default.createElement("div",{className:"footer"},e.children)};var defaultQuery='# Welcome to GraphiQL\n#\n# GraphiQL is an in-browser tool for writing, validating, and\n# testing GraphQL queries.\n#\n# Type queries into this side of the screen, and you will see intelligent\n# typeaheads aware of the current GraphQL type schema and live syntax and\n# validation errors highlighted within the text.\n#\n# GraphQL queries typically start with a "{" character. Lines that starts\n# with a # are ignored.\n#\n# An example GraphQL query might look like:\n#\n#     {\n#       field(arg: "value") {\n#         subField\n#       }\n#     }\n#\n# Keyboard shortcuts:\n#\n#  Prettify Query:  Shift-Ctrl-P (or press the prettify button above)\n#\n#       Run Query:  Ctrl-Enter (or press the play button above)\n#\n#   Auto Complete:  Ctrl-Space (or just start typing)\n#\n\n'}).call(this,"undefined"!=typeof global?global:"undefined"!=typeof self?self:"undefined"!=typeof window?window:{})},{"../utility/CodeMirrorSizer":23,"../utility/StorageAPI":25,"../utility/debounce":26,"../utility/elementPosition":27,"../utility/fillLeafs":28,"../utility/find":29,"../utility/getQueryFacts":30,"../utility/getSelectedOperationName":31,"../utility/introspectionQueries":32,"./DocExplorer":1,"./ExecuteButton":11,"./QueryEditor":14,"./QueryHistory":15,"./ResultViewer":16,"./ToolbarButton":17,"./ToolbarGroup":18,"./ToolbarMenu":19,"./ToolbarSelect":20,"./VariableEditor":21,graphql:95,"prop-types":233}],13:[function(require,module,exports){(function(global){"use strict";function _interopRequireDefault(e){return e&&e.__esModule?e:{default:e}}function _classCallCheck(e,t){if(!(e instanceof t))throw new TypeError("Cannot call a class as a function")}function _possibleConstructorReturn(e,t){if(!e)throw new ReferenceError("this hasn't been initialised - super() hasn't been called");return!t||"object"!=typeof t&&"function"!=typeof t?e:t}function _inherits(e,t){if("function"!=typeof t&&null!==t)throw new TypeError("Super expression must either be null or a function, not "+typeof t);e.prototype=Object.create(t&&t.prototype,{constructor:{value:e,enumerable:!1,writable:!0,configurable:!0}}),t&&(Object.setPrototypeOf?Object.setPrototypeOf(e,t):e.__proto__=t)}Object.defineProperty(exports,"__esModule",{value:!0});var _createClass=function(){function e(e,t){for(var r=0;r<t.length;r++){var i=t[r];i.enumerable=i.enumerable||!1,i.configurable=!0,"value"in i&&(i.writable=!0),Object.defineProperty(e,i.key,i)}}return function(t,r,i){return r&&e(t.prototype,r),i&&e(t,i),t}}(),_react2=_interopRequireDefault("undefined"!=typeof window?window.React:void 0!==global?global.React:null),_propTypes2=_interopRequireDefault(require("prop-types")),HistoryQuery=function(e){function t(e){_classCallCheck(this,t);var r=_possibleConstructorReturn(this,(t.__proto__||Object.getPrototypeOf(t)).call(this,e)),i=r.props.favorite?"visible":"hidden";return r.state={starVisibility:i},r}return _inherits(t,e),_createClass(t,[{key:"render",value:function(){this.props.favorite&&"hidden"===this.state.starVisibility&&this.setState({starVisibility:"visible"});var e={float:"right",visibility:this.state.starVisibility},t=this.props.operationName||this.props.query.split("\n").filter(function(e){return 0!==e.indexOf("#")}).join(""),r=this.props.favorite?"★":"☆";return _react2.default.createElement("p",{onClick:this.handleClick.bind(this),onMouseEnter:this.handleMouseEnter.bind(this),onMouseLeave:this.handleMouseLeave.bind(this)},_react2.default.createElement("span",null,t),_react2.default.createElement("span",{onClick:this.handleStarClick.bind(this),style:e},r))}},{key:"handleMouseEnter",value:function(){this.props.favorite||this.setState({starVisibility:"visible"})}},{key:"handleMouseLeave",value:function(){this.props.favorite||this.setState({starVisibility:"hidden"})}},{key:"handleClick",value:function(){this.props.onSelect(this.props.query,this.props.variables,this.props.operationName)}},{key:"handleStarClick",value:function(e){e.stopPropagation(),this.props.handleToggleFavorite(this.props.query,this.props.variables,this.props.operationName,this.props.favorite)}}]),t}(_react2.default.Component);HistoryQuery.propTypes={favorite:_propTypes2.default.bool,favoriteSize:_propTypes2.default.number,handleToggleFavorite:_propTypes2.default.func,operationName:_propTypes2.default.string,onSelect:_propTypes2.default.func,query:_propTypes2.default.string,variables:_propTypes2.default.string},exports.default=HistoryQuery}).call(this,"undefined"!=typeof global?global:"undefined"!=typeof self?self:"undefined"!=typeof window?window:{})},{"prop-types":233}],14:[function(require,module,exports){(function(global){"use strict";function _interopRequireDefault(e){return e&&e.__esModule?e:{default:e}}function _classCallCheck(e,r){if(!(e instanceof r))throw new TypeError("Cannot call a class as a function")}function _possibleConstructorReturn(e,r){if(!e)throw new ReferenceError("this hasn't been initialised - super() hasn't been called");return!r||"object"!=typeof r&&"function"!=typeof r?e:r}function _inherits(e,r){if("function"!=typeof r&&null!==r)throw new TypeError("Super expression must either be null or a function, not "+typeof r);e.prototype=Object.create(r&&r.prototype,{constructor:{value:e,enumerable:!1,writable:!0,configurable:!0}}),r&&(Object.setPrototypeOf?Object.setPrototypeOf(e,r):e.__proto__=r)}Object.defineProperty(exports,"__esModule",{value:!0}),exports.QueryEditor=void 0;var _createClass=function(){function e(e,r){for(var o=0;o<r.length;o++){var t=r[o];t.enumerable=t.enumerable||!1,t.configurable=!0,"value"in t&&(t.writable=!0),Object.defineProperty(e,t.key,t)}}return function(r,o,t){return o&&e(r.prototype,o),t&&e(r,t),r}}(),_react2=_interopRequireDefault("undefined"!=typeof window?window.React:void 0!==global?global.React:null),_propTypes2=_interopRequireDefault(require("prop-types")),_graphql=require("graphql"),_markdownIt2=_interopRequireDefault(require("markdown-it")),_normalizeWhitespace=require("../utility/normalizeWhitespace"),_onHasCompletion2=_interopRequireDefault(require("../utility/onHasCompletion")),md=new _markdownIt2.default,AUTO_COMPLETE_AFTER_KEY=/^[a-zA-Z0-9_@(]$/;(exports.QueryEditor=function(e){function r(e){_classCallCheck(this,r);var o=_possibleConstructorReturn(this,(r.__proto__||Object.getPrototypeOf(r)).call(this));return o._onKeyUp=function(e,r){AUTO_COMPLETE_AFTER_KEY.test(r.key)&&o.editor.execCommand("autocomplete")},o._onEdit=function(){o.ignoreChangeEvent||(o.cachedValue=o.editor.getValue(),o.props.onEdit&&o.props.onEdit(o.cachedValue))},o._onHasCompletion=function(e,r){(0,_onHasCompletion2.default)(e,r,o.props.onHintInformationRender)},o.cachedValue=e.value||"",o}return _inherits(r,e),_createClass(r,[{key:"componentDidMount",value:function(){var e=this,r=require("codemirror");require("codemirror/addon/hint/show-hint"),require("codemirror/addon/comment/comment"),require("codemirror/addon/edit/matchbrackets"),require("codemirror/addon/edit/closebrackets"),require("codemirror/addon/fold/foldgutter"),require("codemirror/addon/fold/brace-fold"),require("codemirror/addon/search/search"),require("codemirror/addon/search/searchcursor"),require("codemirror/addon/search/jump-to-line"),require("codemirror/addon/dialog/dialog"),require("codemirror/addon/lint/lint"),require("codemirror/keymap/sublime"),require("codemirror-graphql/hint"),require("codemirror-graphql/lint"),require("codemirror-graphql/info"),require("codemirror-graphql/jump"),require("codemirror-graphql/mode"),this.editor=r(this._node,{value:this.props.value||"",lineNumbers:!0,tabSize:2,mode:"graphql",theme:this.props.editorTheme||"graphiql",keyMap:"sublime",autoCloseBrackets:!0,matchBrackets:!0,showCursorWhenSelecting:!0,readOnly:!!this.props.readOnly&&"nocursor",foldGutter:{minFoldSize:4},lint:{schema:this.props.schema},hintOptions:{schema:this.props.schema,closeOnUnfocus:!1,completeSingle:!1},info:{schema:this.props.schema,renderDescription:function(e){return md.render(e)},onClick:function(r){return e.props.onClickReference(r)}},jump:{schema:this.props.schema,onClick:function(r){return e.props.onClickReference(r)}},gutters:["CodeMirror-linenumbers","CodeMirror-foldgutter"],extraKeys:{"Cmd-Space":function(){return e.editor.showHint({completeSingle:!0})},"Ctrl-Space":function(){return e.editor.showHint({completeSingle:!0})},"Alt-Space":function(){return e.editor.showHint({completeSingle:!0})},"Shift-Space":function(){return e.editor.showHint({completeSingle:!0})},"Cmd-Enter":function(){e.props.onRunQuery&&e.props.onRunQuery()},"Ctrl-Enter":function(){e.props.onRunQuery&&e.props.onRunQuery()},"Shift-Ctrl-P":function(){e.props.onPrettifyQuery&&e.props.onPrettifyQuery()},"Cmd-F":"findPersistent","Ctrl-F":"findPersistent","Ctrl-Left":"goSubwordLeft","Ctrl-Right":"goSubwordRight","Alt-Left":"goGroupLeft","Alt-Right":"goGroupRight"}}),this.editor.on("change",this._onEdit),this.editor.on("keyup",this._onKeyUp),this.editor.on("hasCompletion",this._onHasCompletion),this.editor.on("beforeChange",this._onBeforeChange)}},{key:"componentDidUpdate",value:function(e){var r=require("codemirror");this.ignoreChangeEvent=!0,this.props.schema!==e.schema&&(this.editor.options.lint.schema=this.props.schema,this.editor.options.hintOptions.schema=this.props.schema,this.editor.options.info.schema=this.props.schema,this.editor.options.jump.schema=this.props.schema,r.signal(this.editor,"change",this.editor)),this.props.value!==e.value&&this.props.value!==this.cachedValue&&(this.cachedValue=this.props.value,this.editor.setValue(this.props.value)),this.ignoreChangeEvent=!1}},{key:"componentWillUnmount",value:function(){this.editor.off("change",this._onEdit),this.editor.off("keyup",this._onKeyUp),this.editor.off("hasCompletion",this._onHasCompletion),this.editor=null}},{key:"render",value:function(){var e=this;return _react2.default.createElement("div",{className:"query-editor",ref:function(r){e._node=r}})}},{key:"getCodeMirror",value:function(){return this.editor}},{key:"getClientHeight",value:function(){return this._node&&this._node.clientHeight}},{key:"_onBeforeChange",value:function(e,r){if("paste"===r.origin){var o=r.text.map(_normalizeWhitespace.normalizeWhitespace);r.update(r.from,r.to,o)}}}]),r}(_react2.default.Component)).propTypes={schema:_propTypes2.default.instanceOf(_graphql.GraphQLSchema),value:_propTypes2.default.string,onEdit:_propTypes2.default.func,readOnly:_propTypes2.default.bool,onHintInformationRender:_propTypes2.default.func,onClickReference:_propTypes2.default.func,onPrettifyQuery:_propTypes2.default.func,onRunQuery:_propTypes2.default.func,editorTheme:_propTypes2.default.string}}).call(this,"undefined"!=typeof global?global:"undefined"!=typeof self?self:"undefined"!=typeof window?window:{})},{"../utility/normalizeWhitespace":33,"../utility/onHasCompletion":34,codemirror:65,"codemirror-graphql/hint":36,"codemirror-graphql/info":37,"codemirror-graphql/jump":38,"codemirror-graphql/lint":39,"codemirror-graphql/mode":40,"codemirror/addon/comment/comment":52,"codemirror/addon/dialog/dialog":53,"codemirror/addon/edit/closebrackets":54,"codemirror/addon/edit/matchbrackets":55,"codemirror/addon/fold/brace-fold":56,"codemirror/addon/fold/foldgutter":58,"codemirror/addon/hint/show-hint":59,"codemirror/addon/lint/lint":60,"codemirror/addon/search/jump-to-line":61,"codemirror/addon/search/search":62,"codemirror/addon/search/searchcursor":63,"codemirror/keymap/sublime":64,graphql:95,"markdown-it":172,"prop-types":233}],15:[function(require,module,exports){(function(global){"use strict";function _interopRequireDefault(e){return e&&e.__esModule?e:{default:e}}function _classCallCheck(e,t){if(!(e instanceof t))throw new TypeError("Cannot call a class as a function")}function _possibleConstructorReturn(e,t){if(!e)throw new ReferenceError("this hasn't been initialised - super() hasn't been called");return!t||"object"!=typeof t&&"function"!=typeof t?e:t}function _inherits(e,t){if("function"!=typeof t&&null!==t)throw new TypeError("Super expression must either be null or a function, not "+typeof t);e.prototype=Object.create(t&&t.prototype,{constructor:{value:e,enumerable:!1,writable:!0,configurable:!0}}),t&&(Object.setPrototypeOf?Object.setPrototypeOf(e,t):e.__proto__=t)}Object.defineProperty(exports,"__esModule",{value:!0}),exports.QueryHistory=void 0;var _extends=Object.assign||function(e){for(var t=1;t<arguments.length;t++){var r=arguments[t];for(var o in r)Object.prototype.hasOwnProperty.call(r,o)&&(e[o]=r[o])}return e},_createClass=function(){function e(e,t){for(var r=0;r<t.length;r++){var o=t[r];o.enumerable=o.enumerable||!1,o.configurable=!0,"value"in o&&(o.writable=!0),Object.defineProperty(e,o.key,o)}}return function(t,r,o){return r&&e(t.prototype,r),o&&e(t,o),t}}(),_graphql=require("graphql"),_react2=_interopRequireDefault("undefined"!=typeof window?window.React:void 0!==global?global.React:null),_propTypes2=_interopRequireDefault(require("prop-types")),_QueryStore2=_interopRequireDefault(require("../utility/QueryStore")),_HistoryQuery2=_interopRequireDefault(require("./HistoryQuery")),shouldSaveQuery=function(e,t,r){if(e.queryID===t.queryID)return!1;try{(0,_graphql.parse)(e.query)}catch(e){return!1}if(!r)return!0;if(JSON.stringify(e.query)===JSON.stringify(r.query)){if(JSON.stringify(e.variables)===JSON.stringify(r.variables))return!1;if(!e.variables&&!r.variables)return!1}return!0};(exports.QueryHistory=function(e){function t(e){_classCallCheck(this,t);var r=_possibleConstructorReturn(this,(t.__proto__||Object.getPrototypeOf(t)).call(this,e));_initialiseProps.call(r),r.historyStore=new _QueryStore2.default("queries",e.storage),r.favoriteStore=new _QueryStore2.default("favorites",e.storage);var o=r.historyStore.fetchAll(),i=r.favoriteStore.fetchAll(),a=o.concat(i);return r.state={queries:a},r}return _inherits(t,e),_createClass(t,[{key:"componentWillReceiveProps",value:function(e){if(shouldSaveQuery(e,this.props,this.historyStore.fetchRecent())){var t={query:e.query,variables:e.variables,operationName:e.operationName};this.historyStore.push(t),this.historyStore.length>20&&this.historyStore.shift();var r=this.historyStore.items,o=this.favoriteStore.items,i=r.concat(o);this.setState({queries:i})}}},{key:"render",value:function(){var e=this,t=this.state.queries.slice().reverse().map(function(t,r){return _react2.default.createElement(_HistoryQuery2.default,_extends({handleToggleFavorite:e.toggleFavorite,key:r,onSelect:e.props.onSelectQuery},t))});return _react2.default.createElement("div",null,_react2.default.createElement("div",{className:"history-title-bar"},_react2.default.createElement("div",{className:"history-title"},"History"),_react2.default.createElement("div",{className:"doc-explorer-rhs"},this.props.children)),_react2.default.createElement("div",{className:"history-contents"},t))}}]),t}(_react2.default.Component)).propTypes={query:_propTypes2.default.string,variables:_propTypes2.default.string,operationName:_propTypes2.default.string,queryID:_propTypes2.default.number,onSelectQuery:_propTypes2.default.func,storage:_propTypes2.default.object};var _initialiseProps=function(){var e=this;this.toggleFavorite=function(t,r,o,i){var a={query:t,variables:r,operationName:o};e.favoriteStore.contains(a)?i&&(a.favorite=!1,e.favoriteStore.delete(a)):(a.favorite=!0,e.favoriteStore.push(a));var s=e.historyStore.items,n=e.favoriteStore.items,u=s.concat(n);e.setState({queries:u})}}}).call(this,"undefined"!=typeof global?global:"undefined"!=typeof self?self:"undefined"!=typeof window?window:{})},{"../utility/QueryStore":24,"./HistoryQuery":13,graphql:95,"prop-types":233}],16:[function(require,module,exports){(function(global){"use strict";function _interopRequireDefault(e){return e&&e.__esModule?e:{default:e}}function _classCallCheck(e,r){if(!(e instanceof r))throw new TypeError("Cannot call a class as a function")}function _possibleConstructorReturn(e,r){if(!e)throw new ReferenceError("this hasn't been initialised - super() hasn't been called");return!r||"object"!=typeof r&&"function"!=typeof r?e:r}function _inherits(e,r){if("function"!=typeof r&&null!==r)throw new TypeError("Super expression must either be null or a function, not "+typeof r);e.prototype=Object.create(r&&r.prototype,{constructor:{value:e,enumerable:!1,writable:!0,configurable:!0}}),r&&(Object.setPrototypeOf?Object.setPrototypeOf(e,r):e.__proto__=r)}Object.defineProperty(exports,"__esModule",{value:!0}),exports.ResultViewer=void 0;var _createClass=function(){function e(e,r){for(var t=0;t<r.length;t++){var o=r[t];o.enumerable=o.enumerable||!1,o.configurable=!0,"value"in o&&(o.writable=!0),Object.defineProperty(e,o.key,o)}}return function(r,t,o){return t&&e(r.prototype,t),o&&e(r,o),r}}(),_react2=_interopRequireDefault("undefined"!=typeof window?window.React:void 0!==global?global.React:null),_reactDom2=_interopRequireDefault("undefined"!=typeof window?window.ReactDOM:void 0!==global?global.ReactDOM:null),_propTypes2=_interopRequireDefault(require("prop-types"));(exports.ResultViewer=function(e){function r(){return _classCallCheck(this,r),_possibleConstructorReturn(this,(r.__proto__||Object.getPrototypeOf(r)).call(this))}return _inherits(r,e),_createClass(r,[{key:"componentDidMount",value:function(){var e=this,r=require("codemirror");if(require("codemirror/addon/fold/foldgutter"),require("codemirror/addon/fold/brace-fold"),require("codemirror/addon/dialog/dialog"),require("codemirror/addon/search/search"),require("codemirror/addon/search/searchcursor"),require("codemirror/addon/search/jump-to-line"),require("codemirror/keymap/sublime"),require("codemirror-graphql/results/mode"),this.props.ResultsTooltip){require("codemirror-graphql/utils/info-addon");var t=document.createElement("div");r.registerHelper("info","graphql-results",function(r,o,i,n){var u=e.props.ResultsTooltip;return _reactDom2.default.render(_react2.default.createElement(u,{pos:n}),t),t})}this.viewer=r(this._node,{lineWrapping:!0,value:this.props.value||"",readOnly:!0,theme:this.props.editorTheme||"graphiql",mode:"graphql-results",keyMap:"sublime",foldGutter:{minFoldSize:4},gutters:["CodeMirror-foldgutter"],info:Boolean(this.props.ResultsTooltip),extraKeys:{"Cmd-F":"findPersistent","Ctrl-F":"findPersistent","Ctrl-Left":"goSubwordLeft","Ctrl-Right":"goSubwordRight","Alt-Left":"goGroupLeft","Alt-Right":"goGroupRight"}})}},{key:"shouldComponentUpdate",value:function(e){return this.props.value!==e.value}},{key:"componentDidUpdate",value:function(){this.viewer.setValue(this.props.value||"")}},{key:"componentWillUnmount",value:function(){this.viewer=null}},{key:"render",value:function(){var e=this;return _react2.default.createElement("div",{className:"result-window",ref:function(r){e._node=r}})}},{key:"getCodeMirror",value:function(){return this.viewer}},{key:"getClientHeight",value:function(){return this._node&&this._node.clientHeight}}]),r}(_react2.default.Component)).propTypes={value:_propTypes2.default.string,editorTheme:_propTypes2.default.string,ResultsTooltip:_propTypes2.default.any}}).call(this,"undefined"!=typeof global?global:"undefined"!=typeof self?self:"undefined"!=typeof window?window:{})},{codemirror:65,"codemirror-graphql/results/mode":41,"codemirror-graphql/utils/info-addon":46,"codemirror/addon/dialog/dialog":53,"codemirror/addon/fold/brace-fold":56,"codemirror/addon/fold/foldgutter":58,"codemirror/addon/search/jump-to-line":61,"codemirror/addon/search/search":62,"codemirror/addon/search/searchcursor":63,"codemirror/keymap/sublime":64,"prop-types":233}],17:[function(require,module,exports){(function(global){"use strict";function _interopRequireDefault(e){return e&&e.__esModule?e:{default:e}}function _classCallCheck(e,t){if(!(e instanceof t))throw new TypeError("Cannot call a class as a function")}function _possibleConstructorReturn(e,t){if(!e)throw new ReferenceError("this hasn't been initialised - super() hasn't been called");return!t||"object"!=typeof t&&"function"!=typeof t?e:t}function _inherits(e,t){if("function"!=typeof t&&null!==t)throw new TypeError("Super expression must either be null or a function, not "+typeof t);e.prototype=Object.create(t&&t.prototype,{constructor:{value:e,enumerable:!1,writable:!0,configurable:!0}}),t&&(Object.setPrototypeOf?Object.setPrototypeOf(e,t):e.__proto__=t)}function preventDefault(e){e.preventDefault()}Object.defineProperty(exports,"__esModule",{value:!0}),exports.ToolbarButton=void 0;var _createClass=function(){function e(e,t){for(var r=0;r<t.length;r++){var o=t[r];o.enumerable=o.enumerable||!1,o.configurable=!0,"value"in o&&(o.writable=!0),Object.defineProperty(e,o.key,o)}}return function(t,r,o){return r&&e(t.prototype,r),o&&e(t,o),t}}(),_react2=_interopRequireDefault("undefined"!=typeof window?window.React:void 0!==global?global.React:null),_propTypes2=_interopRequireDefault(require("prop-types"));(exports.ToolbarButton=function(e){function t(e){_classCallCheck(this,t);var r=_possibleConstructorReturn(this,(t.__proto__||Object.getPrototypeOf(t)).call(this,e));return r.handleClick=function(e){e.preventDefault();try{r.props.onClick(),r.setState({error:null})}catch(e){r.setState({error:e})}},r.state={error:null},r}return _inherits(t,e),_createClass(t,[{key:"render",value:function(){var e=this.state.error;return _react2.default.createElement("a",{className:"toolbar-button"+(e?" error":""),onMouseDown:preventDefault,onClick:this.handleClick,title:e?e.message:this.props.title},this.props.label)}}]),t}(_react2.default.Component)).propTypes={onClick:_propTypes2.default.func,title:_propTypes2.default.string,label:_propTypes2.default.string}}).call(this,"undefined"!=typeof global?global:"undefined"!=typeof self?self:"undefined"!=typeof window?window:{})},{"prop-types":233}],18:[function(require,module,exports){(function(global){"use strict";Object.defineProperty(exports,"__esModule",{value:!0}),exports.ToolbarGroup=function(e){var r=e.children;return _react2.default.createElement("div",{className:"toolbar-button-group"},r)};var _react2=function(e){return e&&e.__esModule?e:{default:e}}("undefined"!=typeof window?window.React:void 0!==global?global.React:null)}).call(this,"undefined"!=typeof global?global:"undefined"!=typeof self?self:"undefined"!=typeof window?window:{})},{}],19:[function(require,module,exports){(function(global){"use strict";function _interopRequireDefault(e){return e&&e.__esModule?e:{default:e}}function _classCallCheck(e,t){if(!(e instanceof t))throw new TypeError("Cannot call a class as a function")}function _possibleConstructorReturn(e,t){if(!e)throw new ReferenceError("this hasn't been initialised - super() hasn't been called");return!t||"object"!=typeof t&&"function"!=typeof t?e:t}function _inherits(e,t){if("function"!=typeof t&&null!==t)throw new TypeError("Super expression must either be null or a function, not "+typeof t);e.prototype=Object.create(t&&t.prototype,{constructor:{value:e,enumerable:!1,writable:!0,configurable:!0}}),t&&(Object.setPrototypeOf?Object.setPrototypeOf(e,t):e.__proto__=t)}function ToolbarMenuItem(e){var t=e.onSelect,n=e.title,r=e.label;return _react2.default.createElement("li",{onMouseOver:function(e){e.target.className="hover"},onMouseOut:function(e){e.target.className=null},onMouseDown:preventDefault,onMouseUp:t,title:n},r)}function preventDefault(e){e.preventDefault()}Object.defineProperty(exports,"__esModule",{value:!0}),exports.ToolbarMenu=void 0;var _createClass=function(){function e(e,t){for(var n=0;n<t.length;n++){var r=t[n];r.enumerable=r.enumerable||!1,r.configurable=!0,"value"in r&&(r.writable=!0),Object.defineProperty(e,r.key,r)}}return function(t,n,r){return n&&e(t.prototype,n),r&&e(t,r),t}}();exports.ToolbarMenuItem=ToolbarMenuItem;var _react2=_interopRequireDefault("undefined"!=typeof window?window.React:void 0!==global?global.React:null),_propTypes2=_interopRequireDefault(require("prop-types"));(exports.ToolbarMenu=function(e){function t(e){_classCallCheck(this,t);var n=_possibleConstructorReturn(this,(t.__proto__||Object.getPrototypeOf(t)).call(this,e));return n.handleOpen=function(e){preventDefault(e),n.setState({visible:!0}),n._subscribe()},n.state={visible:!1},n}return _inherits(t,e),_createClass(t,[{key:"componentWillUnmount",value:function(){this._release()}},{key:"render",value:function(){var e=this,t=this.state.visible;return _react2.default.createElement("a",{className:"toolbar-menu toolbar-button",onClick:this.handleOpen.bind(this),onMouseDown:preventDefault,ref:function(t){e._node=t},title:this.props.title},this.props.label,_react2.default.createElement("svg",{width:"14",height:"8"},_react2.default.createElement("path",{fill:"#666",d:"M 5 1.5 L 14 1.5 L 9.5 7 z"})),_react2.default.createElement("ul",{className:"toolbar-menu-items"+(t?" open":"")},this.props.children))}},{key:"_subscribe",value:function(){this._listener||(this._listener=this.handleClick.bind(this),document.addEventListener("click",this._listener))}},{key:"_release",value:function(){this._listener&&(document.removeEventListener("click",this._listener),this._listener=null)}},{key:"handleClick",value:function(e){this._node!==e.target&&(preventDefault(e),this.setState({visible:!1}),this._release())}}]),t}(_react2.default.Component)).propTypes={title:_propTypes2.default.string,label:_propTypes2.default.string},ToolbarMenuItem.propTypes={onSelect:_propTypes2.default.func,title:_propTypes2.default.string,label:_propTypes2.default.string}}).call(this,"undefined"!=typeof global?global:"undefined"!=typeof self?self:"undefined"!=typeof window?window:{})},{"prop-types":233}],20:[function(require,module,exports){(function(global){"use strict";function _interopRequireDefault(e){return e&&e.__esModule?e:{default:e}}function _classCallCheck(e,t){if(!(e instanceof t))throw new TypeError("Cannot call a class as a function")}function _possibleConstructorReturn(e,t){if(!e)throw new ReferenceError("this hasn't been initialised - super() hasn't been called");return!t||"object"!=typeof t&&"function"!=typeof t?e:t}function _inherits(e,t){if("function"!=typeof t&&null!==t)throw new TypeError("Super expression must either be null or a function, not "+typeof t);e.prototype=Object.create(t&&t.prototype,{constructor:{value:e,enumerable:!1,writable:!0,configurable:!0}}),t&&(Object.setPrototypeOf?Object.setPrototypeOf(e,t):e.__proto__=t)}function ToolbarSelectOption(e){var t=e.onSelect,r=e.label,n=e.selected;return _react2.default.createElement("li",{onMouseOver:function(e){e.target.className="hover"},onMouseOut:function(e){e.target.className=null},onMouseDown:preventDefault,onMouseUp:t},r,n&&_react2.default.createElement("svg",{width:"13",height:"13"},_react2.default.createElement("polygon",{points:"4.851,10.462 0,5.611 2.314,3.297 4.851,5.835 10.686,0 13,2.314 4.851,10.462"})))}function preventDefault(e){e.preventDefault()}Object.defineProperty(exports,"__esModule",{value:!0}),exports.ToolbarSelect=void 0;var _extends=Object.assign||function(e){for(var t=1;t<arguments.length;t++){var r=arguments[t];for(var n in r)Object.prototype.hasOwnProperty.call(r,n)&&(e[n]=r[n])}return e},_createClass=function(){function e(e,t){for(var r=0;r<t.length;r++){var n=t[r];n.enumerable=n.enumerable||!1,n.configurable=!0,"value"in n&&(n.writable=!0),Object.defineProperty(e,n.key,n)}}return function(t,r,n){return r&&e(t.prototype,r),n&&e(t,n),t}}();exports.ToolbarSelectOption=ToolbarSelectOption;var _react2=_interopRequireDefault("undefined"!=typeof window?window.React:void 0!==global?global.React:null),_propTypes2=_interopRequireDefault(require("prop-types"));(exports.ToolbarSelect=function(e){function t(e){_classCallCheck(this,t);var r=_possibleConstructorReturn(this,(t.__proto__||Object.getPrototypeOf(t)).call(this,e));return r.handleOpen=function(e){preventDefault(e),r.setState({visible:!0}),r._subscribe()},r.state={visible:!1},r}return _inherits(t,e),_createClass(t,[{key:"componentWillUnmount",value:function(){this._release()}},{key:"render",value:function(){var e=this,t=void 0,r=this.state.visible,n=_react2.default.Children.map(this.props.children,function(r,n){t&&!r.props.selected||(t=r);var o=r.props.onSelect||e.props.onSelect&&e.props.onSelect.bind(null,r.props.value,n);return _react2.default.createElement(ToolbarSelectOption,_extends({},r.props,{onSelect:o}))});return _react2.default.createElement("a",{className:"toolbar-select toolbar-button",onClick:this.handleOpen.bind(this),onMouseDown:preventDefault,ref:function(t){e._node=t},title:this.props.title},t.props.label,_react2.default.createElement("svg",{width:"13",height:"10"},_react2.default.createElement("path",{fill:"#666",d:"M 5 5 L 13 5 L 9 1 z"}),_react2.default.createElement("path",{fill:"#666",d:"M 5 6 L 13 6 L 9 10 z"})),_react2.default.createElement("ul",{className:"toolbar-select-options"+(r?" open":"")},n))}},{key:"_subscribe",value:function(){this._listener||(this._listener=this.handleClick.bind(this),document.addEventListener("click",this._listener))}},{key:"_release",value:function(){this._listener&&(document.removeEventListener("click",this._listener),this._listener=null)}},{key:"handleClick",value:function(e){this._node!==e.target&&(preventDefault(e),this.setState({visible:!1}),this._release())}}]),t}(_react2.default.Component)).propTypes={title:_propTypes2.default.string,label:_propTypes2.default.string,onSelect:_propTypes2.default.func},ToolbarSelectOption.propTypes={onSelect:_propTypes2.default.func,selected:_propTypes2.default.bool,label:_propTypes2.default.string,value:_propTypes2.default.any}}).call(this,"undefined"!=typeof global?global:"undefined"!=typeof self?self:"undefined"!=typeof window?window:{})},{"prop-types":233}],21:[function(require,module,exports){(function(global){"use strict";function _interopRequireDefault(e){return e&&e.__esModule?e:{default:e}}function _classCallCheck(e,r){if(!(e instanceof r))throw new TypeError("Cannot call a class as a function")}function _possibleConstructorReturn(e,r){if(!e)throw new ReferenceError("this hasn't been initialised - super() hasn't been called");return!r||"object"!=typeof r&&"function"!=typeof r?e:r}function _inherits(e,r){if("function"!=typeof r&&null!==r)throw new TypeError("Super expression must either be null or a function, not "+typeof r);e.prototype=Object.create(r&&r.prototype,{constructor:{value:e,enumerable:!1,writable:!0,configurable:!0}}),r&&(Object.setPrototypeOf?Object.setPrototypeOf(e,r):e.__proto__=r)}Object.defineProperty(exports,"__esModule",{value:!0}),exports.VariableEditor=void 0;var _createClass=function(){function e(e,r){for(var o=0;o<r.length;o++){var t=r[o];t.enumerable=t.enumerable||!1,t.configurable=!0,"value"in t&&(t.writable=!0),Object.defineProperty(e,t.key,t)}}return function(r,o,t){return o&&e(r.prototype,o),t&&e(r,t),r}}(),_react2=_interopRequireDefault("undefined"!=typeof window?window.React:void 0!==global?global.React:null),_propTypes2=_interopRequireDefault(require("prop-types")),_onHasCompletion2=_interopRequireDefault(require("../utility/onHasCompletion"));(exports.VariableEditor=function(e){function r(e){_classCallCheck(this,r);var o=_possibleConstructorReturn(this,(r.__proto__||Object.getPrototypeOf(r)).call(this));return o._onKeyUp=function(e,r){var t=r.keyCode;(t>=65&&t<=90||!r.shiftKey&&t>=48&&t<=57||r.shiftKey&&189===t||r.shiftKey&&222===t)&&o.editor.execCommand("autocomplete")},o._onEdit=function(){o.ignoreChangeEvent||(o.cachedValue=o.editor.getValue(),o.props.onEdit&&o.props.onEdit(o.cachedValue))},o._onHasCompletion=function(e,r){(0,_onHasCompletion2.default)(e,r,o.props.onHintInformationRender)},o.cachedValue=e.value||"",o}return _inherits(r,e),_createClass(r,[{key:"componentDidMount",value:function(){var e=this,r=require("codemirror");require("codemirror/addon/hint/show-hint"),require("codemirror/addon/edit/matchbrackets"),require("codemirror/addon/edit/closebrackets"),require("codemirror/addon/fold/brace-fold"),require("codemirror/addon/fold/foldgutter"),require("codemirror/addon/lint/lint"),require("codemirror/addon/search/searchcursor"),require("codemirror/addon/search/jump-to-line"),require("codemirror/addon/dialog/dialog"),require("codemirror/keymap/sublime"),require("codemirror-graphql/variables/hint"),require("codemirror-graphql/variables/lint"),require("codemirror-graphql/variables/mode"),this.editor=r(this._node,{value:this.props.value||"",lineNumbers:!0,tabSize:2,mode:"graphql-variables",theme:this.props.editorTheme||"graphiql",keyMap:"sublime",autoCloseBrackets:!0,matchBrackets:!0,showCursorWhenSelecting:!0,readOnly:!!this.props.readOnly&&"nocursor",foldGutter:{minFoldSize:4},lint:{variableToType:this.props.variableToType},hintOptions:{variableToType:this.props.variableToType,closeOnUnfocus:!1,completeSingle:!1},gutters:["CodeMirror-linenumbers","CodeMirror-foldgutter"],extraKeys:{"Cmd-Space":function(){return e.editor.showHint({completeSingle:!1})},"Ctrl-Space":function(){return e.editor.showHint({completeSingle:!1})},"Alt-Space":function(){return e.editor.showHint({completeSingle:!1})},"Shift-Space":function(){return e.editor.showHint({completeSingle:!1})},"Cmd-Enter":function(){e.props.onRunQuery&&e.props.onRunQuery()},"Ctrl-Enter":function(){e.props.onRunQuery&&e.props.onRunQuery()},"Shift-Ctrl-P":function(){e.props.onPrettifyQuery&&e.props.onPrettifyQuery()},"Cmd-F":"findPersistent","Ctrl-F":"findPersistent","Ctrl-Left":"goSubwordLeft","Ctrl-Right":"goSubwordRight","Alt-Left":"goGroupLeft","Alt-Right":"goGroupRight"}}),this.editor.on("change",this._onEdit),this.editor.on("keyup",this._onKeyUp),this.editor.on("hasCompletion",this._onHasCompletion)}},{key:"componentDidUpdate",value:function(e){var r=require("codemirror");this.ignoreChangeEvent=!0,this.props.variableToType!==e.variableToType&&(this.editor.options.lint.variableToType=this.props.variableToType,this.editor.options.hintOptions.variableToType=this.props.variableToType,r.signal(this.editor,"change",this.editor)),this.props.value!==e.value&&this.props.value!==this.cachedValue&&(this.cachedValue=this.props.value,this.editor.setValue(this.props.value)),this.ignoreChangeEvent=!1}},{key:"componentWillUnmount",value:function(){this.editor.off("change",this._onEdit),this.editor.off("keyup",this._onKeyUp),this.editor.off("hasCompletion",this._onHasCompletion),this.editor=null}},{key:"render",value:function(){var e=this;return _react2.default.createElement("div",{className:"codemirrorWrap",ref:function(r){e._node=r}})}},{key:"getCodeMirror",value:function(){return this.editor}},{key:"getClientHeight",value:function(){return this._node&&this._node.clientHeight}}]),r}(_react2.default.Component)).propTypes={variableToType:_propTypes2.default.object,value:_propTypes2.default.string,onEdit:_propTypes2.default.func,readOnly:_propTypes2.default.bool,onHintInformationRender:_propTypes2.default.func,onPrettifyQuery:_propTypes2.default.func,onRunQuery:_propTypes2.default.func,editorTheme:_propTypes2.default.string}}).call(this,"undefined"!=typeof global?global:"undefined"!=typeof self?self:"undefined"!=typeof window?window:{})},{"../utility/onHasCompletion":34,codemirror:65,"codemirror-graphql/variables/hint":49,"codemirror-graphql/variables/lint":50,"codemirror-graphql/variables/mode":51,"codemirror/addon/dialog/dialog":53,"codemirror/addon/edit/closebrackets":54,"codemirror/addon/edit/matchbrackets":55,"codemirror/addon/fold/brace-fold":56,"codemirror/addon/fold/foldgutter":58,"codemirror/addon/hint/show-hint":59,"codemirror/addon/lint/lint":60,"codemirror/addon/search/jump-to-line":61,"codemirror/addon/search/searchcursor":63,"codemirror/keymap/sublime":64,"prop-types":233}],22:[function(require,module,exports){"use strict";module.exports=require("./components/GraphiQL").GraphiQL},{"./components/GraphiQL":12}],23:[function(require,module,exports){"use strict";function _classCallCheck(e,r){if(!(e instanceof r))throw new TypeError("Cannot call a class as a function")}Object.defineProperty(exports,"__esModule",{value:!0});var _createClass=function(){function e(e,r){for(var t=0;t<r.length;t++){var n=r[t];n.enumerable=n.enumerable||!1,n.configurable=!0,"value"in n&&(n.writable=!0),Object.defineProperty(e,n.key,n)}}return function(r,t,n){return t&&e(r.prototype,t),n&&e(r,n),r}}(),CodeMirrorSizer=function(){function e(){_classCallCheck(this,e),this.sizes=[]}return _createClass(e,[{key:"updateSizes",value:function(e){var r=this;e.forEach(function(e,t){var n=e.getClientHeight();t<=r.sizes.length&&n!==r.sizes[t]&&e.getCodeMirror().setSize(),r.sizes[t]=n})}}]),e}();exports.default=CodeMirrorSizer},{}],24:[function(require,module,exports){"use strict";function _defineProperty(e,t,i){return t in e?Object.defineProperty(e,t,{value:i,enumerable:!0,configurable:!0,writable:!0}):e[t]=i,e}function _classCallCheck(e,t){if(!(e instanceof t))throw new TypeError("Cannot call a class as a function")}Object.defineProperty(exports,"__esModule",{value:!0});var _createClass=function(){function e(e,t){for(var i=0;i<t.length;i++){var n=t[i];n.enumerable=n.enumerable||!1,n.configurable=!0,"value"in n&&(n.writable=!0),Object.defineProperty(e,n.key,n)}}return function(t,i,n){return i&&e(t.prototype,i),n&&e(t,n),t}}(),QueryStore=function(){function e(t,i){_classCallCheck(this,e),this.key=t,this.storage=i,this.items=this.fetchAll()}return _createClass(e,[{key:"contains",value:function(e){return this.items.some(function(t){return t.query===e.query&&t.variables===e.variables&&t.operationName===e.operationName})}},{key:"delete",value:function(e){var t=this.items.findIndex(function(t){return t.query===e.query&&t.variables===e.variables&&t.operationName===e.operationName});-1!==t&&(this.items.splice(t,1),this.save())}},{key:"fetchRecent",value:function(){return this.items[this.items.length-1]}},{key:"fetchAll",value:function(){var e=this.storage.get(this.key);return e?JSON.parse(e)[this.key]:[]}},{key:"push",value:function(e){this.items.push(e),this.save()}},{key:"shift",value:function(){this.items.shift(),this.save()}},{key:"save",value:function(){this.storage.set(this.key,JSON.stringify(_defineProperty({},this.key,this.items)))}},{key:"length",get:function(){return this.items.length}}]),e}();exports.default=QueryStore},{}],25:[function(require,module,exports){"use strict";function _classCallCheck(e,t){if(!(e instanceof t))throw new TypeError("Cannot call a class as a function")}function isStorageAvailable(e,t,r){try{return e.setItem(t,r),!0}catch(t){return t instanceof DOMException&&(22===t.code||1014===t.code||"QuotaExceededError"===t.name||"NS_ERROR_DOM_QUOTA_REACHED"===t.name)&&0!==e.length}}Object.defineProperty(exports,"__esModule",{value:!0});var _createClass=function(){function e(e,t){for(var r=0;r<t.length;r++){var a=t[r];a.enumerable=a.enumerable||!1,a.configurable=!0,"value"in a&&(a.writable=!0),Object.defineProperty(e,a.key,a)}}return function(t,r,a){return r&&e(t.prototype,r),a&&e(t,a),t}}(),StorageAPI=function(){function e(t){_classCallCheck(this,e),this.storage=t||window.localStorage}return _createClass(e,[{key:"get",value:function(e){if(this.storage){var t=this.storage.getItem("graphiql:"+e);if("null"!==t&&"undefined"!==t)return t;this.storage.removeItem("graphiql:"+e)}}},{key:"set",value:function(e,t){if(this.storage){var r="graphiql:"+e;t?isStorageAvailable(this.storage,r,t)&&this.storage.setItem(r,t):this.storage.removeItem(r)}}}]),e}();exports.default=StorageAPI},{}],26:[function(require,module,exports){"use strict";Object.defineProperty(exports,"__esModule",{value:!0}),exports.default=function(e,t){var u=void 0;return function(){var o=this,n=arguments;clearTimeout(u),u=setTimeout(function(){u=null,t.apply(o,n)},e)}}},{}],27:[function(require,module,exports){"use strict";Object.defineProperty(exports,"__esModule",{value:!0}),exports.getLeft=function(e){for(var t=0,f=e;f.offsetParent;)t+=f.offsetLeft,f=f.offsetParent;return t},exports.getTop=function(e){for(var t=0,f=e;f.offsetParent;)t+=f.offsetTop,f=f.offsetParent;return t}},{}],28:[function(require,module,exports){"use strict";function defaultGetDefaultFieldNames(e){if(!e.getFields)return[];var t=e.getFields();if(t.id)return["id"];if(t.edges)return["edges"];if(t.node)return["node"];var r=[];return Object.keys(t).forEach(function(e){(0,_graphql.isLeafType)(t[e].type)&&r.push(e)}),r}function buildSelectionSet(e,t){var r=(0,_graphql.getNamedType)(e);if(e&&!(0,_graphql.isLeafType)(e)){var n=t(r);if(Array.isArray(n)&&0!==n.length)return{kind:"SelectionSet",selections:n.map(function(e){var n=r.getFields()[e];return{kind:"Field",name:{kind:"Name",value:e},selectionSet:buildSelectionSet(n?n.type:null,t)}})}}}function withInsertions(e,t){if(0===t.length)return e;var r="",n=0;return t.forEach(function(t){var i=t.index,a=t.string;r+=e.slice(n,i)+a,n=i}),r+=e.slice(n)}function getIndentation(e,t){for(var r=t,n=t;r;){var i=e.charCodeAt(r-1);if(10===i||13===i||8232===i||8233===i)break;r--,9!==i&&11!==i&&12!==i&&32!==i&&160!==i&&(n=r)}return e.substring(r,n)}Object.defineProperty(exports,"__esModule",{value:!0}),exports.fillLeafs=function(e,t,r){var n=[];if(!e)return{insertions:n,result:t};var i=void 0;try{i=(0,_graphql.parse)(t)}catch(e){return{insertions:n,result:t}}var a=r||defaultGetDefaultFieldNames,l=new _graphql.TypeInfo(e);return(0,_graphql.visit)(i,{leave:function(e){l.leave(e)},enter:function(e){if(l.enter(e),"Field"===e.kind&&!e.selectionSet){var r=buildSelectionSet(l.getType(),a);if(r){var i=getIndentation(t,e.loc.start);n.push({index:e.loc.end,string:" "+(0,_graphql.print)(r).replace(/\n/g,"\n"+i)})}}}}),{insertions:n,result:withInsertions(t,n)}};var _graphql=require("graphql")},{graphql:95}],29:[function(require,module,exports){"use strict";Object.defineProperty(exports,"__esModule",{value:!0}),exports.default=function(e,t){for(var r=0;r<e.length;r++)if(t(e[r]))return e[r]}},{}],30:[function(require,module,exports){"use strict";function collectVariables(e,r){var a=Object.create(null);return r.definitions.forEach(function(r){if("OperationDefinition"===r.kind){var i=r.variableDefinitions;i&&i.forEach(function(r){var i=r.variable,t=r.type,n=(0,_graphql.typeFromAST)(e,t);n&&(a[i.name.value]=n)})}}),a}Object.defineProperty(exports,"__esModule",{value:!0}),exports.default=function(e,r){if(r){var a=void 0;try{a=(0,_graphql.parse)(r)}catch(e){return}var i=e?collectVariables(e,a):null,t=[];return a.definitions.forEach(function(e){"OperationDefinition"===e.kind&&t.push(e)}),{variableToType:i,operations:t}}},exports.collectVariables=collectVariables;var _graphql=require("graphql")},{graphql:95}],31:[function(require,module,exports){"use strict";Object.defineProperty(exports,"__esModule",{value:!0}),exports.default=function(e,t,n){if(n&&!(n.length<1)){var r=n.map(function(e){return e.name&&e.name.value});if(t&&-1!==r.indexOf(t))return t;if(t&&e){var a=e.map(function(e){return e.name&&e.name.value}).indexOf(t);if(-1!==a&&a<r.length)return r[a]}return r[0]}}},{}],32:[function(require,module,exports){"use strict";Object.defineProperty(exports,"__esModule",{value:!0});var _graphql=require("graphql");Object.defineProperty(exports,"introspectionQuery",{enumerable:!0,get:function(){return _graphql.introspectionQuery}});exports.introspectionQuerySansSubscriptions="\n  query IntrospectionQuery {\n    __schema {\n      queryType { name }\n      mutationType { name }\n      types {\n        ...FullType\n      }\n      directives {\n        name\n        description\n        locations\n        args {\n          ...InputValue\n        }\n      }\n    }\n  }\n\n  fragment FullType on __Type {\n    kind\n    name\n    description\n    fields(includeDeprecated: true) {\n      name\n      description\n      args {\n        ...InputValue\n      }\n      type {\n        ...TypeRef\n      }\n      isDeprecated\n      deprecationReason\n    }\n    inputFields {\n      ...InputValue\n    }\n    interfaces {\n      ...TypeRef\n    }\n    enumValues(includeDeprecated: true) {\n      name\n      description\n      isDeprecated\n      deprecationReason\n    }\n    possibleTypes {\n      ...TypeRef\n    }\n  }\n\n  fragment InputValue on __InputValue {\n    name\n    description\n    type { ...TypeRef }\n    defaultValue\n  }\n\n  fragment TypeRef on __Type {\n    kind\n    name\n    ofType {\n      kind\n      name\n      ofType {\n        kind\n        name\n        ofType {\n          kind\n          name\n          ofType {\n            kind\n            name\n            ofType {\n              kind\n              name\n              ofType {\n                kind\n                name\n                ofType {\n                  kind\n                  name\n                }\n              }\n            }\n          }\n        }\n      }\n    }\n  }\n"},{graphql:95}],33:[function(require,module,exports){"use strict";Object.defineProperty(exports,"__esModule",{value:!0}),exports.normalizeWhitespace=function(e){return e.replace(sanitizeRegex," ")};var invalidCharacters=exports.invalidCharacters=Array.from({length:11},function(e,r){return String.fromCharCode(8192+r)}).concat(["\u2028","\u2029"," "]),sanitizeRegex=new RegExp("["+invalidCharacters.join("|")+"]","g")},{}],34:[function(require,module,exports){"use strict";function renderType(e){return e instanceof _graphql.GraphQLNonNull?renderType(e.ofType)+"!":e instanceof _graphql.GraphQLList?"["+renderType(e.ofType)+"]":'<a class="typeName">'+e.name+"</a>"}Object.defineProperty(exports,"__esModule",{value:!0}),exports.default=function(e,n,r){var t=void 0,a=void 0;require("codemirror").on(n,"select",function(e,n){if(!t){var o=n.parentNode;(t=document.createElement("div")).className="CodeMirror-hint-information",o.appendChild(t),(a=document.createElement("div")).className="CodeMirror-hint-deprecation",o.appendChild(a);var i=void 0;o.addEventListener("DOMNodeRemoved",i=function(e){e.target===o&&(o.removeEventListener("DOMNodeRemoved",i),t=null,a=null,i=null)})}var d=e.description?md.render(e.description):"Self descriptive.",p=e.type?'<span class="infoType">'+renderType(e.type)+"</span>":"";if(t.innerHTML='<div class="content">'+("<p>"===d.slice(0,3)?"<p>"+p+d.slice(3):p+d)+"</div>",e.isDeprecated){var l=e.deprecationReason?md.render(e.deprecationReason):"";a.innerHTML='<span class="deprecation-label">Deprecated</span>'+l,a.style.display="block"}else a.style.display="none";r&&r(t)})};var _graphql=require("graphql"),md=new(function(e){return e&&e.__esModule?e:{default:e}}(require("markdown-it")).default)},{codemirror:65,graphql:95,"markdown-it":172}],35:[function(require,module,exports){(function(global){"use strict";function compare(a,b){if(a===b)return 0;for(var x=a.length,y=b.length,i=0,len=Math.min(x,y);i<len;++i)if(a[i]!==b[i]){x=a[i],y=b[i];break}return x<y?-1:y<x?1:0}function isBuffer(b){return global.Buffer&&"function"==typeof global.Buffer.isBuffer?global.Buffer.isBuffer(b):!(null==b||!b._isBuffer)}function pToString(obj){return Object.prototype.toString.call(obj)}function isView(arrbuf){return!isBuffer(arrbuf)&&("function"==typeof global.ArrayBuffer&&("function"==typeof ArrayBuffer.isView?ArrayBuffer.isView(arrbuf):!!arrbuf&&(arrbuf instanceof DataView||!!(arrbuf.buffer&&arrbuf.buffer instanceof ArrayBuffer))))}function getName(func){if(util.isFunction(func)){if(functionsHaveNames)return func.name;var match=func.toString().match(regex);return match&&match[1]}}function truncate(s,n){return"string"==typeof s?s.length<n?s:s.slice(0,n):s}function inspect(something){if(functionsHaveNames||!util.isFunction(something))return util.inspect(something);var rawname=getName(something);return"[Function"+(rawname?": "+rawname:"")+"]"}function getMessage(self){return truncate(inspect(self.actual),128)+" "+self.operator+" "+truncate(inspect(self.expected),128)}function fail(actual,expected,message,operator,stackStartFunction){throw new assert.AssertionError({message:message,actual:actual,expected:expected,operator:operator,stackStartFunction:stackStartFunction})}function ok(value,message){value||fail(value,!0,message,"==",assert.ok)}function _deepEqual(actual,expected,strict,memos){if(actual===expected)return!0;if(isBuffer(actual)&&isBuffer(expected))return 0===compare(actual,expected);if(util.isDate(actual)&&util.isDate(expected))return actual.getTime()===expected.getTime();if(util.isRegExp(actual)&&util.isRegExp(expected))return actual.source===expected.source&&actual.global===expected.global&&actual.multiline===expected.multiline&&actual.lastIndex===expected.lastIndex&&actual.ignoreCase===expected.ignoreCase;if(null!==actual&&"object"==typeof actual||null!==expected&&"object"==typeof expected){if(isView(actual)&&isView(expected)&&pToString(actual)===pToString(expected)&&!(actual instanceof Float32Array||actual instanceof Float64Array))return 0===compare(new Uint8Array(actual.buffer),new Uint8Array(expected.buffer));if(isBuffer(actual)!==isBuffer(expected))return!1;var actualIndex=(memos=memos||{actual:[],expected:[]}).actual.indexOf(actual);return-1!==actualIndex&&actualIndex===memos.expected.indexOf(expected)||(memos.actual.push(actual),memos.expected.push(expected),objEquiv(actual,expected,strict,memos))}return strict?actual===expected:actual==expected}function isArguments(object){return"[object Arguments]"==Object.prototype.toString.call(object)}function objEquiv(a,b,strict,actualVisitedObjects){if(null===a||void 0===a||null===b||void 0===b)return!1;if(util.isPrimitive(a)||util.isPrimitive(b))return a===b;if(strict&&Object.getPrototypeOf(a)!==Object.getPrototypeOf(b))return!1;var aIsArgs=isArguments(a),bIsArgs=isArguments(b);if(aIsArgs&&!bIsArgs||!aIsArgs&&bIsArgs)return!1;if(aIsArgs)return a=pSlice.call(a),b=pSlice.call(b),_deepEqual(a,b,strict);var key,i,ka=objectKeys(a),kb=objectKeys(b);if(ka.length!==kb.length)return!1;for(ka.sort(),kb.sort(),i=ka.length-1;i>=0;i--)if(ka[i]!==kb[i])return!1;for(i=ka.length-1;i>=0;i--)if(key=ka[i],!_deepEqual(a[key],b[key],strict,actualVisitedObjects))return!1;return!0}function notDeepStrictEqual(actual,expected,message){_deepEqual(actual,expected,!0)&&fail(actual,expected,message,"notDeepStrictEqual",notDeepStrictEqual)}function expectedException(actual,expected){if(!actual||!expected)return!1;if("[object RegExp]"==Object.prototype.toString.call(expected))return expected.test(actual);try{if(actual instanceof expected)return!0}catch(e){}return!Error.isPrototypeOf(expected)&&!0===expected.call({},actual)}function _tryBlock(block){var error;try{block()}catch(e){error=e}return error}function _throws(shouldThrow,block,expected,message){var actual;if("function"!=typeof block)throw new TypeError('"block" argument must be a function');"string"==typeof expected&&(message=expected,expected=null),actual=_tryBlock(block),message=(expected&&expected.name?" ("+expected.name+").":".")+(message?" "+message:"."),shouldThrow&&!actual&&fail(actual,expected,"Missing expected exception"+message);var userProvidedMessage="string"==typeof message,isUnwantedException=!shouldThrow&&util.isError(actual),isUnexpectedException=!shouldThrow&&actual&&!expected;if((isUnwantedException&&userProvidedMessage&&expectedException(actual,expected)||isUnexpectedException)&&fail(actual,expected,"Got unwanted exception"+message),shouldThrow&&actual&&expected&&!expectedException(actual,expected)||!shouldThrow&&actual)throw actual}var util=require("util/"),hasOwn=Object.prototype.hasOwnProperty,pSlice=Array.prototype.slice,functionsHaveNames="foo"===function(){}.name,assert=module.exports=ok,regex=/\s*function\s+([^\(\s]*)\s*/;assert.AssertionError=function(options){this.name="AssertionError",this.actual=options.actual,this.expected=options.expected,this.operator=options.operator,options.message?(this.message=options.message,this.generatedMessage=!1):(this.message=getMessage(this),this.generatedMessage=!0);var stackStartFunction=options.stackStartFunction||fail;if(Error.captureStackTrace)Error.captureStackTrace(this,stackStartFunction);else{var err=new Error;if(err.stack){var out=err.stack,fn_name=getName(stackStartFunction),idx=out.indexOf("\n"+fn_name);if(idx>=0){var next_line=out.indexOf("\n",idx+1);out=out.substring(next_line+1)}this.stack=out}}},util.inherits(assert.AssertionError,Error),assert.fail=fail,assert.ok=ok,assert.equal=function(actual,expected,message){actual!=expected&&fail(actual,expected,message,"==",assert.equal)},assert.notEqual=function(actual,expected,message){actual==expected&&fail(actual,expected,message,"!=",assert.notEqual)},assert.deepEqual=function(actual,expected,message){_deepEqual(actual,expected,!1)||fail(actual,expected,message,"deepEqual",assert.deepEqual)},assert.deepStrictEqual=function(actual,expected,message){_deepEqual(actual,expected,!0)||fail(actual,expected,message,"deepStrictEqual",assert.deepStrictEqual)},assert.notDeepEqual=function(actual,expected,message){_deepEqual(actual,expected,!1)&&fail(actual,expected,message,"notDeepEqual",assert.notDeepEqual)},assert.notDeepStrictEqual=notDeepStrictEqual,assert.strictEqual=function(actual,expected,message){actual!==expected&&fail(actual,expected,message,"===",assert.strictEqual)},assert.notStrictEqual=function(actual,expected,message){actual===expected&&fail(actual,expected,message,"!==",assert.notStrictEqual)},assert.throws=function(block,error,message){_throws(!0,block,error,message)},assert.doesNotThrow=function(block,error,message){_throws(!1,block,error,message)},assert.ifError=function(err){if(err)throw err};var objectKeys=Object.keys||function(obj){var keys=[];for(var key in obj)hasOwn.call(obj,key)&&keys.push(key);return keys}}).call(this,"undefined"!=typeof global?global:"undefined"!=typeof self?self:"undefined"!=typeof window?window:{})},{"util/":244}],36:[function(require,module,exports){"use strict";var _codemirror2=function(obj){return obj&&obj.__esModule?obj:{default:obj}}(require("codemirror")),_graphqlLanguageServiceInterface=require("graphql-language-service-interface");_codemirror2.default.registerHelper("hint","graphql",function(editor,options){var schema=options.schema;if(schema){var cur=editor.getCursor(),token=editor.getTokenAt(cur),rawResults=(0,_graphqlLanguageServiceInterface.getAutocompleteSuggestions)(schema,editor.getValue(),cur,token),tokenStart=null!==token.type&&/"|\w/.test(token.string[0])?token.start:token.end,results={list:rawResults.map(function(item){return{text:item.label,type:schema.getType(item.detail),description:item.documentation,isDeprecated:item.isDeprecated,deprecationReason:item.deprecationReason}}),from:{line:cur.line,column:tokenStart},to:{line:cur.line,column:token.end}};return results&&results.list&&results.list.length>0&&(results.from=_codemirror2.default.Pos(results.from.line,results.from.column),results.to=_codemirror2.default.Pos(results.to.line,results.to.column),_codemirror2.default.signal(editor,"hasCompletion",editor,results,token)),results}})},{codemirror:65,"graphql-language-service-interface":76}],37:[function(require,module,exports){"use strict";function _interopRequireDefault(obj){return obj&&obj.__esModule?obj:{default:obj}}function renderField(into,typeInfo,options){renderQualifiedField(into,typeInfo,options),renderTypeAnnotation(into,typeInfo,options,typeInfo.type)}function renderQualifiedField(into,typeInfo,options){var fieldName=typeInfo.fieldDef.name;"__"!==fieldName.slice(0,2)&&(renderType(into,typeInfo,options,typeInfo.parentType),text(into,".")),text(into,fieldName,"field-name",options,(0,_SchemaReference.getFieldReference)(typeInfo))}function renderDirective(into,typeInfo,options){text(into,"@"+typeInfo.directiveDef.name,"directive-name",options,(0,_SchemaReference.getDirectiveReference)(typeInfo))}function renderArg(into,typeInfo,options){typeInfo.directiveDef?renderDirective(into,typeInfo,options):typeInfo.fieldDef&&renderQualifiedField(into,typeInfo,options);var name=typeInfo.argDef.name;text(into,"("),text(into,name,"arg-name",options,(0,_SchemaReference.getArgumentReference)(typeInfo)),renderTypeAnnotation(into,typeInfo,options,typeInfo.inputType),text(into,")")}function renderTypeAnnotation(into,typeInfo,options,t){text(into,": "),renderType(into,typeInfo,options,t)}function renderEnumValue(into,typeInfo,options){var name=typeInfo.enumValue.name;renderType(into,typeInfo,options,typeInfo.inputType),text(into,"."),text(into,name,"enum-value",options,(0,_SchemaReference.getEnumValueReference)(typeInfo))}function renderType(into,typeInfo,options,t){t instanceof _graphql.GraphQLNonNull?(renderType(into,typeInfo,options,t.ofType),text(into,"!")):t instanceof _graphql.GraphQLList?(text(into,"["),renderType(into,typeInfo,options,t.ofType),text(into,"]")):text(into,t.name,"type-name",options,(0,_SchemaReference.getTypeReference)(typeInfo,t))}function renderDescription(into,options,def){var description=def.description;if(description){var descriptionDiv=document.createElement("div");descriptionDiv.className="info-description",options.renderDescription?descriptionDiv.innerHTML=options.renderDescription(description):descriptionDiv.appendChild(document.createTextNode(description)),into.appendChild(descriptionDiv)}renderDeprecation(into,options,def)}function renderDeprecation(into,options,def){var reason=def.deprecationReason;if(reason){var deprecationDiv=document.createElement("div");deprecationDiv.className="info-deprecation",options.renderDescription?deprecationDiv.innerHTML=options.renderDescription(reason):deprecationDiv.appendChild(document.createTextNode(reason));var label=document.createElement("span");label.className="info-deprecation-label",label.appendChild(document.createTextNode("Deprecated: ")),deprecationDiv.insertBefore(label,deprecationDiv.firstChild),into.appendChild(deprecationDiv)}}function text(into,content,className,options,ref){if(className){var onClick=options.onClick,node=document.createElement(onClick?"a":"span");onClick&&(node.href="javascript:void 0",node.addEventListener("click",function(e){onClick(ref,e)})),node.className=className,node.appendChild(document.createTextNode(content)),into.appendChild(node)}else into.appendChild(document.createTextNode(content))}var _graphql=require("graphql"),_codemirror2=_interopRequireDefault(require("codemirror")),_getTypeInfo2=_interopRequireDefault(require("./utils/getTypeInfo")),_SchemaReference=require("./utils/SchemaReference");require("./utils/info-addon"),_codemirror2.default.registerHelper("info","graphql",function(token,options){if(options.schema&&token.state){var state=token.state,kind=state.kind,step=state.step,typeInfo=(0,_getTypeInfo2.default)(options.schema,token.state);if("Field"===kind&&0===step&&typeInfo.fieldDef||"AliasedField"===kind&&2===step&&typeInfo.fieldDef){var into=document.createElement("div");return renderField(into,typeInfo,options),renderDescription(into,options,typeInfo.fieldDef),into}if("Directive"===kind&&1===step&&typeInfo.directiveDef){var _into=document.createElement("div");return renderDirective(_into,typeInfo,options),renderDescription(_into,options,typeInfo.directiveDef),_into}if("Argument"===kind&&0===step&&typeInfo.argDef){var _into2=document.createElement("div");return renderArg(_into2,typeInfo,options),renderDescription(_into2,options,typeInfo.argDef),_into2}if("EnumValue"===kind&&typeInfo.enumValue&&typeInfo.enumValue.description){var _into3=document.createElement("div");return renderEnumValue(_into3,typeInfo,options),renderDescription(_into3,options,typeInfo.enumValue),_into3}if("NamedType"===kind&&typeInfo.type&&typeInfo.type.description){var _into4=document.createElement("div");return renderType(_into4,typeInfo,options,typeInfo.type),renderDescription(_into4,options,typeInfo.type),_into4}}})},{"./utils/SchemaReference":42,"./utils/getTypeInfo":44,"./utils/info-addon":46,codemirror:65,graphql:95}],38:[function(require,module,exports){"use strict";function _interopRequireDefault(obj){return obj&&obj.__esModule?obj:{default:obj}}var _codemirror2=_interopRequireDefault(require("codemirror")),_getTypeInfo2=_interopRequireDefault(require("./utils/getTypeInfo")),_SchemaReference=require("./utils/SchemaReference");require("./utils/jump-addon"),_codemirror2.default.registerHelper("jump","graphql",function(token,options){if(options.schema&&options.onClick&&token.state){var state=token.state,kind=state.kind,step=state.step,typeInfo=(0,_getTypeInfo2.default)(options.schema,state);return"Field"===kind&&0===step&&typeInfo.fieldDef||"AliasedField"===kind&&2===step&&typeInfo.fieldDef?(0,_SchemaReference.getFieldReference)(typeInfo):"Directive"===kind&&1===step&&typeInfo.directiveDef?(0,_SchemaReference.getDirectiveReference)(typeInfo):"Argument"===kind&&0===step&&typeInfo.argDef?(0,_SchemaReference.getArgumentReference)(typeInfo):"EnumValue"===kind&&typeInfo.enumValue?(0,_SchemaReference.getEnumValueReference)(typeInfo):"NamedType"===kind&&typeInfo.type?(0,_SchemaReference.getTypeReference)(typeInfo):void 0}})},{"./utils/SchemaReference":42,"./utils/getTypeInfo":44,"./utils/jump-addon":48,codemirror:65}],39:[function(require,module,exports){"use strict";var _codemirror2=function(obj){return obj&&obj.__esModule?obj:{default:obj}}(require("codemirror")),_graphqlLanguageServiceInterface=require("graphql-language-service-interface"),SEVERITY=["error","warning","information","hint"],TYPE={"GraphQL: Validation":"validation","GraphQL: Deprecation":"deprecation","GraphQL: Syntax":"syntax"};_codemirror2.default.registerHelper("lint","graphql",function(text,options){var schema=options.schema;return(0,_graphqlLanguageServiceInterface.getDiagnostics)(text,schema).map(function(error){return{message:error.message,severity:SEVERITY[error.severity-1],type:TYPE[error.source],from:_codemirror2.default.Pos(error.range.start.line,error.range.start.character),to:_codemirror2.default.Pos(error.range.end.line,error.range.end.character)}})})},{codemirror:65,"graphql-language-service-interface":76}],40:[function(require,module,exports){"use strict";function indent(state,textAfter){var levels=state.levels;return(levels&&0!==levels.length?levels[levels.length-1]-(this.electricInput.test(textAfter)?1:0):state.indentLevel)*this.config.indentUnit}var _codemirror2=function(obj){return obj&&obj.__esModule?obj:{default:obj}}(require("codemirror")),_graphqlLanguageServiceParser=require("graphql-language-service-parser");_codemirror2.default.defineMode("graphql",function(config){var parser=(0,_graphqlLanguageServiceParser.onlineParser)({eatWhitespace:function(stream){return stream.eatWhile(_graphqlLanguageServiceParser.isIgnored)},lexRules:_graphqlLanguageServiceParser.LexRules,parseRules:_graphqlLanguageServiceParser.ParseRules,editorConfig:{tabSize:config.tabSize}});return{config:config,startState:parser.startState,token:parser.token,indent:indent,electricInput:/^\s*[})\]]/,fold:"brace",lineComment:"#",closeBrackets:{pairs:'()[]{}""',explode:"()[]{}"}}})},{codemirror:65,"graphql-language-service-parser":80}],41:[function(require,module,exports){"use strict";function indent(state,textAfter){var levels=state.levels;return(levels&&0!==levels.length?levels[levels.length-1]-(this.electricInput.test(textAfter)?1:0):state.indentLevel)*this.config.indentUnit}var _codemirror2=function(obj){return obj&&obj.__esModule?obj:{default:obj}}(require("codemirror")),_graphqlLanguageServiceParser=require("graphql-language-service-parser");_codemirror2.default.defineMode("graphql-results",function(config){var parser=(0,_graphqlLanguageServiceParser.onlineParser)({eatWhitespace:function(stream){return stream.eatSpace()},lexRules:LexRules,parseRules:ParseRules,editorConfig:{tabSize:config.tabSize}});return{config:config,startState:parser.startState,token:parser.token,indent:indent,electricInput:/^\s*[}\]]/,fold:"brace",closeBrackets:{pairs:'[]{}""',explode:"[]{}"}}});var LexRules={Punctuation:/^\[|]|\{|\}|:|,/,Number:/^-?(?:0|(?:[1-9][0-9]*))(?:\.[0-9]*)?(?:[eE][+-]?[0-9]+)?/,String:/^"(?:[^"\\]|\\(?:"|\/|\\|b|f|n|r|t|u[0-9a-fA-F]{4}))*"?/,Keyword:/^true|false|null/},ParseRules={Document:[(0,_graphqlLanguageServiceParser.p)("{"),(0,_graphqlLanguageServiceParser.list)("Entry",(0,_graphqlLanguageServiceParser.p)(",")),(0,_graphqlLanguageServiceParser.p)("}")],Entry:[(0,_graphqlLanguageServiceParser.t)("String","def"),(0,_graphqlLanguageServiceParser.p)(":"),"Value"],Value:function(token){switch(token.kind){case"Number":return"NumberValue";case"String":return"StringValue";case"Punctuation":switch(token.value){case"[":return"ListValue";case"{":return"ObjectValue"}return null;case"Keyword":switch(token.value){case"true":case"false":return"BooleanValue";case"null":return"NullValue"}return null}},NumberValue:[(0,_graphqlLanguageServiceParser.t)("Number","number")],StringValue:[(0,_graphqlLanguageServiceParser.t)("String","string")],BooleanValue:[(0,_graphqlLanguageServiceParser.t)("Keyword","builtin")],NullValue:[(0,_graphqlLanguageServiceParser.t)("Keyword","keyword")],ListValue:[(0,_graphqlLanguageServiceParser.p)("["),(0,_graphqlLanguageServiceParser.list)("Value",(0,_graphqlLanguageServiceParser.p)(",")),(0,_graphqlLanguageServiceParser.p)("]")],ObjectValue:[(0,_graphqlLanguageServiceParser.p)("{"),(0,_graphqlLanguageServiceParser.list)("ObjectField",(0,_graphqlLanguageServiceParser.p)(",")),(0,_graphqlLanguageServiceParser.p)("}")],ObjectField:[(0,_graphqlLanguageServiceParser.t)("String","property"),(0,_graphqlLanguageServiceParser.p)(":"),"Value"]}},{codemirror:65,"graphql-language-service-parser":80}],42:[function(require,module,exports){"use strict";function isMetaField(fieldDef){return"__"===fieldDef.name.slice(0,2)}Object.defineProperty(exports,"__esModule",{value:!0}),exports.getFieldReference=function(typeInfo){return{kind:"Field",schema:typeInfo.schema,field:typeInfo.fieldDef,type:isMetaField(typeInfo.fieldDef)?null:typeInfo.parentType}},exports.getDirectiveReference=function(typeInfo){return{kind:"Directive",schema:typeInfo.schema,directive:typeInfo.directiveDef}},exports.getArgumentReference=function(typeInfo){return typeInfo.directiveDef?{kind:"Argument",schema:typeInfo.schema,argument:typeInfo.argDef,directive:typeInfo.directiveDef}:{kind:"Argument",schema:typeInfo.schema,argument:typeInfo.argDef,field:typeInfo.fieldDef,type:isMetaField(typeInfo.fieldDef)?null:typeInfo.parentType}},exports.getEnumValueReference=function(typeInfo){return{kind:"EnumValue",value:typeInfo.enumValue,type:(0,_graphql.getNamedType)(typeInfo.inputType)}},exports.getTypeReference=function(typeInfo,type){return{kind:"Type",schema:typeInfo.schema,type:type||typeInfo.type}};var _graphql=require("graphql")},{graphql:95}],43:[function(require,module,exports){"use strict";Object.defineProperty(exports,"__esModule",{value:!0}),exports.default=function(stack,fn){for(var reverseStateStack=[],state=stack;state&&state.kind;)reverseStateStack.push(state),state=state.prevState;for(var i=reverseStateStack.length-1;i>=0;i--)fn(reverseStateStack[i])}},{}],44:[function(require,module,exports){"use strict";function getFieldDef(schema,type,fieldName){return fieldName===_introspection.SchemaMetaFieldDef.name&&schema.getQueryType()===type?_introspection.SchemaMetaFieldDef:fieldName===_introspection.TypeMetaFieldDef.name&&schema.getQueryType()===type?_introspection.TypeMetaFieldDef:fieldName===_introspection.TypeNameMetaFieldDef.name&&(0,_graphql.isCompositeType)(type)?_introspection.TypeNameMetaFieldDef:type.getFields?type.getFields()[fieldName]:void 0}function find(array,predicate){for(var i=0;i<array.length;i++)if(predicate(array[i]))return array[i]}Object.defineProperty(exports,"__esModule",{value:!0}),exports.default=function(schema,tokenState){var info={schema:schema,type:null,parentType:null,inputType:null,directiveDef:null,fieldDef:null,argDef:null,argDefs:null,objectFieldDefs:null};return(0,_forEachState2.default)(tokenState,function(state){switch(state.kind){case"Query":case"ShortQuery":info.type=schema.getQueryType();break;case"Mutation":info.type=schema.getMutationType();break;case"Subscription":info.type=schema.getSubscriptionType();break;case"InlineFragment":case"FragmentDefinition":state.type&&(info.type=schema.getType(state.type));break;case"Field":case"AliasedField":info.fieldDef=info.type&&state.name?getFieldDef(schema,info.parentType,state.name):null,info.type=info.fieldDef&&info.fieldDef.type;break;case"SelectionSet":info.parentType=(0,_graphql.getNamedType)(info.type);break;case"Directive":info.directiveDef=state.name&&schema.getDirective(state.name);break;case"Arguments":var parentDef="Field"===state.prevState.kind?info.fieldDef:"Directive"===state.prevState.kind?info.directiveDef:"AliasedField"===state.prevState.kind?state.prevState.name&&getFieldDef(schema,info.parentType,state.prevState.name):null;info.argDefs=parentDef&&parentDef.args;break;case"Argument":if(info.argDef=null,info.argDefs)for(var i=0;i<info.argDefs.length;i++)if(info.argDefs[i].name===state.name){info.argDef=info.argDefs[i];break}info.inputType=info.argDef&&info.argDef.type;break;case"EnumValue":var enumType=(0,_graphql.getNamedType)(info.inputType);info.enumValue=enumType instanceof _graphql.GraphQLEnumType?find(enumType.getValues(),function(val){return val.value===state.name}):null;break;case"ListValue":var nullableType=(0,_graphql.getNullableType)(info.inputType);info.inputType=nullableType instanceof _graphql.GraphQLList?nullableType.ofType:null;break;case"ObjectValue":var objectType=(0,_graphql.getNamedType)(info.inputType);info.objectFieldDefs=objectType instanceof _graphql.GraphQLInputObjectType?objectType.getFields():null;break;case"ObjectField":var objectField=state.name&&info.objectFieldDefs?info.objectFieldDefs[state.name]:null;info.inputType=objectField&&objectField.type;break;case"NamedType":info.type=schema.getType(state.name)}}),info};var _graphql=require("graphql"),_introspection=require("graphql/type/introspection"),_forEachState2=function(obj){return obj&&obj.__esModule?obj:{default:obj}}(require("./forEachState"))},{"./forEachState":43,graphql:95,"graphql/type/introspection":118}],45:[function(require,module,exports){"use strict";function filterAndSortList(list,text){return text?filterNonEmpty(filterNonEmpty(list.map(function(entry){return{proximity:getProximity(normalizeText(entry.text),text),entry:entry}}),function(pair){return pair.proximity<=2}),function(pair){return!pair.entry.isDeprecated}).sort(function(a,b){return(a.entry.isDeprecated?1:0)-(b.entry.isDeprecated?1:0)||a.proximity-b.proximity||a.entry.text.length-b.entry.text.length}).map(function(pair){return pair.entry}):filterNonEmpty(list,function(entry){return!entry.isDeprecated})}function filterNonEmpty(array,predicate){var filtered=array.filter(predicate);return 0===filtered.length?array:filtered}function normalizeText(text){return text.toLowerCase().replace(/\W/g,"")}function getProximity(suggestion,text){var proximity=lexicalDistance(text,suggestion);return suggestion.length>text.length&&(proximity-=suggestion.length-text.length-1,proximity+=0===suggestion.indexOf(text)?0:.5),proximity}function lexicalDistance(a,b){var i=void 0,j=void 0,d=[],aLength=a.length,bLength=b.length;for(i=0;i<=aLength;i++)d[i]=[i];for(j=1;j<=bLength;j++)d[0][j]=j;for(i=1;i<=aLength;i++)for(j=1;j<=bLength;j++){var cost=a[i-1]===b[j-1]?0:1;d[i][j]=Math.min(d[i-1][j]+1,d[i][j-1]+1,d[i-1][j-1]+cost),i>1&&j>1&&a[i-1]===b[j-2]&&a[i-2]===b[j-1]&&(d[i][j]=Math.min(d[i][j],d[i-2][j-2]+cost))}return d[aLength][bLength]}Object.defineProperty(exports,"__esModule",{value:!0}),exports.default=function(cursor,token,list){var hints=filterAndSortList(list,normalizeText(token.string));if(hints){var tokenStart=null!==token.type&&/"|\w/.test(token.string[0])?token.start:token.end;return{list:hints,from:{line:cursor.line,column:tokenStart},to:{line:cursor.line,column:token.end}}}}},{}],46:[function(require,module,exports){"use strict";function createState(options){return{options:options instanceof Function?{render:options}:!0===options?{}:options}}function getHoverTime(cm){var options=cm.state.info.options;return options&&options.hoverTime||500}function onMouseOver(cm,e){var state=cm.state.info,target=e.target||e.srcElement;if("SPAN"===target.nodeName&&void 0===state.hoverTimeout){var box=target.getBoundingClientRect(),hoverTime=getHoverTime(cm);state.hoverTimeout=setTimeout(onHover,hoverTime);var onMouseMove=function(){clearTimeout(state.hoverTimeout),state.hoverTimeout=setTimeout(onHover,hoverTime)},onMouseOut=function onMouseOut(){_codemirror2.default.off(document,"mousemove",onMouseMove),_codemirror2.default.off(cm.getWrapperElement(),"mouseout",onMouseOut),clearTimeout(state.hoverTimeout),state.hoverTimeout=void 0},onHover=function(){_codemirror2.default.off(document,"mousemove",onMouseMove),_codemirror2.default.off(cm.getWrapperElement(),"mouseout",onMouseOut),state.hoverTimeout=void 0,onMouseHover(cm,box)};_codemirror2.default.on(document,"mousemove",onMouseMove),_codemirror2.default.on(cm.getWrapperElement(),"mouseout",onMouseOut)}}function onMouseHover(cm,box){var pos=cm.coordsChar({left:(box.left+box.right)/2,top:(box.top+box.bottom)/2}),options=cm.state.info.options,render=options.render||cm.getHelper(pos,"info");if(render){var token=cm.getTokenAt(pos,!0);if(token){var info=render(token,options,cm);info&&showPopup(cm,box,info)}}}function showPopup(cm,box,info){var popup=document.createElement("div");popup.className="CodeMirror-info",popup.appendChild(info),document.body.appendChild(popup);var popupBox=popup.getBoundingClientRect(),popupStyle=popup.currentStyle||window.getComputedStyle(popup),popupWidth=popupBox.right-popupBox.left+parseFloat(popupStyle.marginLeft)+parseFloat(popupStyle.marginRight),popupHeight=popupBox.bottom-popupBox.top+parseFloat(popupStyle.marginTop)+parseFloat(popupStyle.marginBottom),topPos=box.bottom;popupHeight>window.innerHeight-box.bottom-15&&box.top>window.innerHeight-box.bottom&&(topPos=box.top-popupHeight),topPos<0&&(topPos=box.bottom);var leftPos=Math.max(0,window.innerWidth-popupWidth-15);leftPos>box.left&&(leftPos=box.left),popup.style.opacity=1,popup.style.top=topPos+"px",popup.style.left=leftPos+"px";var popupTimeout=void 0,onMouseOverPopup=function(){clearTimeout(popupTimeout)},onMouseOut=function(){clearTimeout(popupTimeout),popupTimeout=setTimeout(hidePopup,200)},hidePopup=function(){_codemirror2.default.off(popup,"mouseover",onMouseOverPopup),_codemirror2.default.off(popup,"mouseout",onMouseOut),_codemirror2.default.off(cm.getWrapperElement(),"mouseout",onMouseOut),popup.style.opacity?(popup.style.opacity=0,setTimeout(function(){popup.parentNode&&popup.parentNode.removeChild(popup)},600)):popup.parentNode&&popup.parentNode.removeChild(popup)};_codemirror2.default.on(popup,"mouseover",onMouseOverPopup),_codemirror2.default.on(popup,"mouseout",onMouseOut),_codemirror2.default.on(cm.getWrapperElement(),"mouseout",onMouseOut)}var _codemirror2=function(obj){return obj&&obj.__esModule?obj:{default:obj}}(require("codemirror"));_codemirror2.default.defineOption("info",!1,function(cm,options,old){if(old&&old!==_codemirror2.default.Init){var oldOnMouseOver=cm.state.info.onMouseOver;_codemirror2.default.off(cm.getWrapperElement(),"mouseover",oldOnMouseOver),clearTimeout(cm.state.info.hoverTimeout),delete cm.state.info}if(options){var state=cm.state.info=createState(options);state.onMouseOver=onMouseOver.bind(null,cm),_codemirror2.default.on(cm.getWrapperElement(),"mouseover",state.onMouseOver)}})},{codemirror:65}],47:[function(require,module,exports){"use strict";function parseObj(){var nodeStart=start,members=[];if(expect("{"),!skip("}")){do{members.push(parseMember())}while(skip(","));expect("}")}return{kind:"Object",start:nodeStart,end:lastEnd,members:members}}function parseMember(){var nodeStart=start,key="String"===kind?curToken():null;expect("String"),expect(":");var value=parseVal();return{kind:"Member",start:nodeStart,end:lastEnd,key:key,value:value}}function parseArr(){var nodeStart=start,values=[];if(expect("["),!skip("]")){do{values.push(parseVal())}while(skip(","));expect("]")}return{kind:"Array",start:nodeStart,end:lastEnd,values:values}}function parseVal(){switch(kind){case"[":return parseArr();case"{":return parseObj();case"String":case"Number":case"Boolean":case"Null":var token=curToken();return lex(),token}return expect("Value")}function curToken(){return{kind:kind,start:start,end:end,value:JSON.parse(string.slice(start,end))}}function expect(str){if(kind!==str){var found=void 0;if("EOF"===kind)found="[end of file]";else if(end-start>1)found="`"+string.slice(start,end)+"`";else{var match=string.slice(start).match(/^.+?\b/);found="`"+(match?match[0]:string[start])+"`"}throw syntaxError("Expected "+str+" but found "+found+".")}lex()}function syntaxError(message){return{message:message,start:start,end:end}}function skip(k){if(kind===k)return lex(),!0}function ch(){end<strLen&&(code=++end===strLen?0:string.charCodeAt(end))}function lex(){for(lastEnd=end;9===code||10===code||13===code||32===code;)ch();if(0!==code){switch(start=end,code){case 34:return kind="String",readString();case 45:case 48:case 49:case 50:case 51:case 52:case 53:case 54:case 55:case 56:case 57:return kind="Number",readNumber();case 102:if("false"!==string.slice(start,start+5))break;return end+=4,ch(),void(kind="Boolean");case 110:if("null"!==string.slice(start,start+4))break;return end+=3,ch(),void(kind="Null");case 116:if("true"!==string.slice(start,start+4))break;return end+=3,ch(),void(kind="Boolean")}kind=string[start],ch()}else kind="EOF"}function readString(){for(ch();34!==code&&code>31;)if(92===code)switch(ch(),code){case 34:case 47:case 92:case 98:case 102:case 110:case 114:case 116:ch();break;case 117:ch(),readHex(),readHex(),readHex(),readHex();break;default:throw syntaxError("Bad character escape sequence.")}else{if(end===strLen)throw syntaxError("Unterminated string.");ch()}if(34!==code)throw syntaxError("Unterminated string.");ch()}function readHex(){if(code>=48&&code<=57||code>=65&&code<=70||code>=97&&code<=102)return ch();throw syntaxError("Expected hexadecimal digit.")}function readNumber(){45===code&&ch(),48===code?ch():readDigits(),46===code&&(ch(),readDigits()),69!==code&&101!==code||(ch(),43!==code&&45!==code||ch(),readDigits())}function readDigits(){if(code<48||code>57)throw syntaxError("Expected decimal digit.");do{ch()}while(code>=48&&code<=57)}Object.defineProperty(exports,"__esModule",{value:!0}),exports.default=function(str){string=str,strLen=str.length,start=end=lastEnd=-1,ch(),lex();var ast=parseObj();return expect("EOF"),ast};var string=void 0,strLen=void 0,start=void 0,end=void 0,lastEnd=void 0,code=void 0,kind=void 0},{}],48:[function(require,module,exports){"use strict";function onMouseOver(cm,event){var target=event.target||event.srcElement;if("SPAN"===target.nodeName){var box=target.getBoundingClientRect(),cursor={left:(box.left+box.right)/2,top:(box.top+box.bottom)/2};cm.state.jump.cursor=cursor,cm.state.jump.isHoldingModifier&&enableJumpMode(cm)}}function onMouseOut(cm){cm.state.jump.isHoldingModifier||!cm.state.jump.cursor?cm.state.jump.isHoldingModifier&&cm.state.jump.marker&&disableJumpMode(cm):cm.state.jump.cursor=null}function onKeyDown(cm,event){if(!cm.state.jump.isHoldingModifier&&isJumpModifier(event.key)){cm.state.jump.isHoldingModifier=!0,cm.state.jump.cursor&&enableJumpMode(cm);var onClick=function(clickEvent){var destination=cm.state.jump.destination;destination&&cm.state.jump.options.onClick(destination,clickEvent)},onMouseDown=function(_,downEvent){cm.state.jump.destination&&(downEvent.codemirrorIgnore=!0)};_codemirror2.default.on(document,"keyup",function onKeyUp(upEvent){upEvent.code===event.code&&(cm.state.jump.isHoldingModifier=!1,cm.state.jump.marker&&disableJumpMode(cm),_codemirror2.default.off(document,"keyup",onKeyUp),_codemirror2.default.off(document,"click",onClick),cm.off("mousedown",onMouseDown))}),_codemirror2.default.on(document,"click",onClick),cm.on("mousedown",onMouseDown)}}function isJumpModifier(key){return key===(isMac?"Meta":"Control")}function enableJumpMode(cm){if(!cm.state.jump.marker){var cursor=cm.state.jump.cursor,pos=cm.coordsChar(cursor),token=cm.getTokenAt(pos,!0),options=cm.state.jump.options,getDestination=options.getDestination||cm.getHelper(pos,"jump");if(getDestination){var destination=getDestination(token,options,cm);if(destination){var marker=cm.markText({line:pos.line,ch:token.start},{line:pos.line,ch:token.end},{className:"CodeMirror-jump-token"});cm.state.jump.marker=marker,cm.state.jump.destination=destination}}}}function disableJumpMode(cm){var marker=cm.state.jump.marker;cm.state.jump.marker=null,cm.state.jump.destination=null,marker.clear()}var _codemirror2=function(obj){return obj&&obj.__esModule?obj:{default:obj}}(require("codemirror"));_codemirror2.default.defineOption("jump",!1,function(cm,options,old){if(old&&old!==_codemirror2.default.Init){var oldOnMouseOver=cm.state.jump.onMouseOver;_codemirror2.default.off(cm.getWrapperElement(),"mouseover",oldOnMouseOver);var oldOnMouseOut=cm.state.jump.onMouseOut;_codemirror2.default.off(cm.getWrapperElement(),"mouseout",oldOnMouseOut),_codemirror2.default.off(document,"keydown",cm.state.jump.onKeyDown),delete cm.state.jump}if(options){var state=cm.state.jump={options:options,onMouseOver:onMouseOver.bind(null,cm),onMouseOut:onMouseOut.bind(null,cm),onKeyDown:onKeyDown.bind(null,cm)};_codemirror2.default.on(cm.getWrapperElement(),"mouseover",state.onMouseOver),_codemirror2.default.on(cm.getWrapperElement(),"mouseout",state.onMouseOut),_codemirror2.default.on(document,"keydown",state.onKeyDown)}});var isMac=navigator&&-1!==navigator.appVersion.indexOf("Mac")},{codemirror:65}],49:[function(require,module,exports){"use strict";function _interopRequireDefault(obj){return obj&&obj.__esModule?obj:{default:obj}}function getVariablesHint(cur,token,options){var state="Invalid"===token.state.kind?token.state.prevState:token.state,kind=state.kind,step=state.step;if("Document"===kind&&0===step)return(0,_hintList2.default)(cur,token,[{text:"{"}]);var variableToType=options.variableToType;if(variableToType){var typeInfo=getTypeInfo(variableToType,token.state);if("Document"===kind||"Variable"===kind&&0===step){var variableNames=Object.keys(variableToType);return(0,_hintList2.default)(cur,token,variableNames.map(function(name){return{text:'"'+name+'": ',type:variableToType[name]}}))}if(("ObjectValue"===kind||"ObjectField"===kind&&0===step)&&typeInfo.fields){var inputFields=Object.keys(typeInfo.fields).map(function(fieldName){return typeInfo.fields[fieldName]});return(0,_hintList2.default)(cur,token,inputFields.map(function(field){return{text:'"'+field.name+'": ',type:field.type,description:field.description}}))}if("StringValue"===kind||"NumberValue"===kind||"BooleanValue"===kind||"NullValue"===kind||"ListValue"===kind&&1===step||"ObjectField"===kind&&2===step||"Variable"===kind&&2===step){var namedInputType=(0,_graphql.getNamedType)(typeInfo.type);if(namedInputType instanceof _graphql.GraphQLInputObjectType)return(0,_hintList2.default)(cur,token,[{text:"{"}]);if(namedInputType instanceof _graphql.GraphQLEnumType){var valueMap=namedInputType.getValues(),values=Object.keys(valueMap).map(function(name){return valueMap[name]});return(0,_hintList2.default)(cur,token,values.map(function(value){return{text:'"'+value.name+'"',type:namedInputType,description:value.description}}))}if(namedInputType===_graphql.GraphQLBoolean)return(0,_hintList2.default)(cur,token,[{text:"true",type:_graphql.GraphQLBoolean,description:"Not false."},{text:"false",type:_graphql.GraphQLBoolean,description:"Not true."}])}}}function getTypeInfo(variableToType,tokenState){var info={type:null,fields:null};return(0,_forEachState2.default)(tokenState,function(state){if("Variable"===state.kind)info.type=variableToType[state.name];else if("ListValue"===state.kind){var nullableType=(0,_graphql.getNullableType)(info.type);info.type=nullableType instanceof _graphql.GraphQLList?nullableType.ofType:null}else if("ObjectValue"===state.kind){var objectType=(0,_graphql.getNamedType)(info.type);info.fields=objectType instanceof _graphql.GraphQLInputObjectType?objectType.getFields():null}else if("ObjectField"===state.kind){var objectField=state.name&&info.fields?info.fields[state.name]:null;info.type=objectField&&objectField.type}}),info}var _codemirror2=_interopRequireDefault(require("codemirror")),_graphql=require("graphql"),_forEachState2=_interopRequireDefault(require("../utils/forEachState")),_hintList2=_interopRequireDefault(require("../utils/hintList"));_codemirror2.default.registerHelper("hint","graphql-variables",function(editor,options){var cur=editor.getCursor(),token=editor.getTokenAt(cur),results=getVariablesHint(cur,token,options);return results&&results.list&&results.list.length>0&&(results.from=_codemirror2.default.Pos(results.from.line,results.from.column),results.to=_codemirror2.default.Pos(results.to.line,results.to.column),_codemirror2.default.signal(editor,"hasCompletion",editor,results,token)),results})},{"../utils/forEachState":43,"../utils/hintList":45,codemirror:65,graphql:95}],50:[function(require,module,exports){"use strict";function _interopRequireDefault(obj){return obj&&obj.__esModule?obj:{default:obj}}function validateVariables(editor,variableToType,variablesAST){var errors=[];return variablesAST.members.forEach(function(member){var variableName=member.key.value,type=variableToType[variableName];type?validateValue(type,member.value).forEach(function(_ref){var node=_ref[0],message=_ref[1];errors.push(lintError(editor,node,message))}):errors.push(lintError(editor,member.key,'Variable "$'+variableName+'" does not appear in any GraphQL query.'))}),errors}function validateValue(type,valueAST){if(type instanceof _graphql.GraphQLNonNull)return"Null"===valueAST.kind?[[valueAST,'Type "'+type+'" is non-nullable and cannot be null.']]:validateValue(type.ofType,valueAST);if("Null"===valueAST.kind)return[];if(type instanceof _graphql.GraphQLList){var itemType=type.ofType;return"Array"===valueAST.kind?mapCat(valueAST.values,function(item){return validateValue(itemType,item)}):validateValue(itemType,valueAST)}if(type instanceof _graphql.GraphQLInputObjectType){if("Object"!==valueAST.kind)return[[valueAST,'Type "'+type+'" must be an Object.']];var providedFields=Object.create(null),fieldErrors=mapCat(valueAST.members,function(member){var fieldName=member.key.value;providedFields[fieldName]=!0;var inputField=type.getFields()[fieldName];return inputField?validateValue(inputField?inputField.type:void 0,member.value):[[member.key,'Type "'+type+'" does not have a field "'+fieldName+'".']]});return Object.keys(type.getFields()).forEach(function(fieldName){providedFields[fieldName]||type.getFields()[fieldName].type instanceof _graphql.GraphQLNonNull&&fieldErrors.push([valueAST,'Object of type "'+type+'" is missing required field "'+fieldName+'".'])}),fieldErrors}return"Boolean"===type.name&&"Boolean"!==valueAST.kind||"String"===type.name&&"String"!==valueAST.kind||"ID"===type.name&&"Number"!==valueAST.kind&&"String"!==valueAST.kind||"Float"===type.name&&"Number"!==valueAST.kind||"Int"===type.name&&("Number"!==valueAST.kind||(0|valueAST.value)!==valueAST.value)?[[valueAST,'Expected value of type "'+type+'".']]:(type instanceof _graphql.GraphQLEnumType||type instanceof _graphql.GraphQLScalarType)&&("String"!==valueAST.kind&&"Number"!==valueAST.kind&&"Boolean"!==valueAST.kind&&"Null"!==valueAST.kind||isNullish(type.parseValue(valueAST.value)))?[[valueAST,'Expected value of type "'+type+'".']]:[]}function lintError(editor,node,message){return{message:message,severity:"error",type:"validation",from:editor.posFromIndex(node.start),to:editor.posFromIndex(node.end)}}function isNullish(value){return null===value||void 0===value||value!==value}function mapCat(array,mapper){return Array.prototype.concat.apply([],array.map(mapper))}var _codemirror2=_interopRequireDefault(require("codemirror")),_graphql=require("graphql"),_jsonParse2=_interopRequireDefault(require("../utils/jsonParse"));_codemirror2.default.registerHelper("lint","graphql-variables",function(text,options,editor){if(!text)return[];var ast=void 0;try{ast=(0,_jsonParse2.default)(text)}catch(syntaxError){if(syntaxError.stack)throw syntaxError;return[lintError(editor,syntaxError,syntaxError.message)]}var variableToType=options.variableToType;return variableToType?validateVariables(editor,variableToType,ast):[]})},{"../utils/jsonParse":47,codemirror:65,graphql:95}],51:[function(require,module,exports){"use strict";function indent(state,textAfter){var levels=state.levels;return(levels&&0!==levels.length?levels[levels.length-1]-(this.electricInput.test(textAfter)?1:0):state.indentLevel)*this.config.indentUnit}function namedKey(style){return{style:style,match:function(token){return"String"===token.kind},update:function(state,token){state.name=token.value.slice(1,-1)}}}var _codemirror2=function(obj){return obj&&obj.__esModule?obj:{default:obj}}(require("codemirror")),_graphqlLanguageServiceParser=require("graphql-language-service-parser");_codemirror2.default.defineMode("graphql-variables",function(config){var parser=(0,_graphqlLanguageServiceParser.onlineParser)({eatWhitespace:function(stream){return stream.eatSpace()},lexRules:LexRules,parseRules:ParseRules,editorConfig:{tabSize:config.tabSize}});return{config:config,startState:parser.startState,token:parser.token,indent:indent,electricInput:/^\s*[}\]]/,fold:"brace",closeBrackets:{pairs:'[]{}""',explode:"[]{}"}}});var LexRules={Punctuation:/^\[|]|\{|\}|:|,/,Number:/^-?(?:0|(?:[1-9][0-9]*))(?:\.[0-9]*)?(?:[eE][+-]?[0-9]+)?/,String:/^"(?:[^"\\]|\\(?:"|\/|\\|b|f|n|r|t|u[0-9a-fA-F]{4}))*"?/,Keyword:/^true|false|null/},ParseRules={Document:[(0,_graphqlLanguageServiceParser.p)("{"),(0,_graphqlLanguageServiceParser.list)("Variable",(0,_graphqlLanguageServiceParser.opt)((0,_graphqlLanguageServiceParser.p)(","))),(0,_graphqlLanguageServiceParser.p)("}")],Variable:[namedKey("variable"),(0,_graphqlLanguageServiceParser.p)(":"),"Value"],Value:function(token){switch(token.kind){case"Number":return"NumberValue";case"String":return"StringValue";case"Punctuation":switch(token.value){case"[":return"ListValue";case"{":return"ObjectValue"}return null;case"Keyword":switch(token.value){case"true":case"false":return"BooleanValue";case"null":return"NullValue"}return null}},NumberValue:[(0,_graphqlLanguageServiceParser.t)("Number","number")],StringValue:[(0,_graphqlLanguageServiceParser.t)("String","string")],BooleanValue:[(0,_graphqlLanguageServiceParser.t)("Keyword","builtin")],NullValue:[(0,_graphqlLanguageServiceParser.t)("Keyword","keyword")],ListValue:[(0,_graphqlLanguageServiceParser.p)("["),(0,_graphqlLanguageServiceParser.list)("Value",(0,_graphqlLanguageServiceParser.opt)((0,_graphqlLanguageServiceParser.p)(","))),(0,_graphqlLanguageServiceParser.p)("]")],ObjectValue:[(0,_graphqlLanguageServiceParser.p)("{"),(0,_graphqlLanguageServiceParser.list)("ObjectField",(0,_graphqlLanguageServiceParser.opt)((0,_graphqlLanguageServiceParser.p)(","))),(0,_graphqlLanguageServiceParser.p)("}")],ObjectField:[namedKey("attribute"),(0,_graphqlLanguageServiceParser.p)(":"),"Value"]}},{codemirror:65,"graphql-language-service-parser":80}],52:[function(require,module,exports){!function(mod){mod("object"==typeof exports&&"object"==typeof module?require("../../lib/codemirror"):CodeMirror)}(function(CodeMirror){"use strict";function firstNonWS(str){var found=str.search(nonWS);return-1==found?0:found}function probablyInsideString(cm,pos,line){return/\bstring\b/.test(cm.getTokenTypeAt(Pos(pos.line,0)))&&!/^[\'\"\`]/.test(line)}function getMode(cm,pos){var mode=cm.getMode();return!1!==mode.useInnerComments&&mode.innerMode?cm.getModeAt(pos):mode}var noOptions={},nonWS=/[^\s\u00a0]/,Pos=CodeMirror.Pos;CodeMirror.commands.toggleComment=function(cm){cm.toggleComment()},CodeMirror.defineExtension("toggleComment",function(options){options||(options=noOptions);for(var cm=this,minLine=1/0,ranges=this.listSelections(),mode=null,i=ranges.length-1;i>=0;i--){var from=ranges[i].from(),to=ranges[i].to();from.line>=minLine||(to.line>=minLine&&(to=Pos(minLine,0)),minLine=from.line,null==mode?cm.uncomment(from,to,options)?mode="un":(cm.lineComment(from,to,options),mode="line"):"un"==mode?cm.uncomment(from,to,options):cm.lineComment(from,to,options))}}),CodeMirror.defineExtension("lineComment",function(from,to,options){options||(options=noOptions);var self=this,mode=getMode(self,from),firstLine=self.getLine(from.line);if(null!=firstLine&&!probablyInsideString(self,from,firstLine)){var commentString=options.lineComment||mode.lineComment;if(commentString){var end=Math.min(0!=to.ch||to.line==from.line?to.line+1:to.line,self.lastLine()+1),pad=null==options.padding?" ":options.padding,blankLines=options.commentBlankLines||from.line==to.line;self.operation(function(){if(options.indent){for(var baseString=null,i=from.line;i<end;++i){var whitespace=(line=self.getLine(i)).slice(0,firstNonWS(line));(null==baseString||baseString.length>whitespace.length)&&(baseString=whitespace)}for(i=from.line;i<end;++i){var line=self.getLine(i),cut=baseString.length;(blankLines||nonWS.test(line))&&(line.slice(0,cut)!=baseString&&(cut=firstNonWS(line)),self.replaceRange(baseString+commentString+pad,Pos(i,0),Pos(i,cut)))}}else for(i=from.line;i<end;++i)(blankLines||nonWS.test(self.getLine(i)))&&self.replaceRange(commentString+pad,Pos(i,0))})}else(options.blockCommentStart||mode.blockCommentStart)&&(options.fullLines=!0,self.blockComment(from,to,options))}}),CodeMirror.defineExtension("blockComment",function(from,to,options){options||(options=noOptions);var self=this,mode=getMode(self,from),startString=options.blockCommentStart||mode.blockCommentStart,endString=options.blockCommentEnd||mode.blockCommentEnd;if(startString&&endString){if(!/\bcomment\b/.test(self.getTokenTypeAt(Pos(from.line,0)))){var end=Math.min(to.line,self.lastLine());end!=from.line&&0==to.ch&&nonWS.test(self.getLine(end))&&--end;var pad=null==options.padding?" ":options.padding;from.line>end||self.operation(function(){if(0!=options.fullLines){var lastLineHasText=nonWS.test(self.getLine(end));self.replaceRange(pad+endString,Pos(end)),self.replaceRange(startString+pad,Pos(from.line,0));var lead=options.blockCommentLead||mode.blockCommentLead;if(null!=lead)for(var i=from.line+1;i<=end;++i)(i!=end||lastLineHasText)&&self.replaceRange(lead+pad,Pos(i,0))}else self.replaceRange(endString,to),self.replaceRange(startString,from)})}}else(options.lineComment||mode.lineComment)&&0!=options.fullLines&&self.lineComment(from,to,options)}),CodeMirror.defineExtension("uncomment",function(from,to,options){options||(options=noOptions);var didSomething,self=this,mode=getMode(self,from),end=Math.min(0!=to.ch||to.line==from.line?to.line:to.line-1,self.lastLine()),start=Math.min(from.line,end),lineString=options.lineComment||mode.lineComment,lines=[],pad=null==options.padding?" ":options.padding;lineComment:if(lineString){for(var i=start;i<=end;++i){var line=self.getLine(i),found=line.indexOf(lineString);if(found>-1&&!/comment/.test(self.getTokenTypeAt(Pos(i,found+1)))&&(found=-1),-1==found&&nonWS.test(line))break lineComment;if(found>-1&&nonWS.test(line.slice(0,found)))break lineComment;lines.push(line)}if(self.operation(function(){for(var i=start;i<=end;++i){var line=lines[i-start],pos=line.indexOf(lineString),endPos=pos+lineString.length;pos<0||(line.slice(endPos,endPos+pad.length)==pad&&(endPos+=pad.length),didSomething=!0,self.replaceRange("",Pos(i,pos),Pos(i,endPos)))}}),didSomething)return!0}var startString=options.blockCommentStart||mode.blockCommentStart,endString=options.blockCommentEnd||mode.blockCommentEnd;if(!startString||!endString)return!1;var lead=options.blockCommentLead||mode.blockCommentLead,startLine=self.getLine(start),open=startLine.indexOf(startString);if(-1==open)return!1;var endLine=end==start?startLine:self.getLine(end),close=endLine.indexOf(endString,end==start?open+startString.length:0);-1==close&&start!=end&&(endLine=self.getLine(--end),close=endLine.indexOf(endString));var insideStart=Pos(start,open+1),insideEnd=Pos(end,close+1);if(-1==close||!/comment/.test(self.getTokenTypeAt(insideStart))||!/comment/.test(self.getTokenTypeAt(insideEnd))||self.getRange(insideStart,insideEnd,"\n").indexOf(endString)>-1)return!1;var lastStart=startLine.lastIndexOf(startString,from.ch),firstEnd=-1==lastStart?-1:startLine.slice(0,from.ch).indexOf(endString,lastStart+startString.length);if(-1!=lastStart&&-1!=firstEnd&&firstEnd+endString.length!=from.ch)return!1;firstEnd=endLine.indexOf(endString,to.ch);var almostLastStart=endLine.slice(to.ch).lastIndexOf(startString,firstEnd-to.ch);return lastStart=-1==firstEnd||-1==almostLastStart?-1:to.ch+almostLastStart,(-1==firstEnd||-1==lastStart||lastStart==to.ch)&&(self.operation(function(){self.replaceRange("",Pos(end,close-(pad&&endLine.slice(close-pad.length,close)==pad?pad.length:0)),Pos(end,close+endString.length));var openEnd=open+startString.length;if(pad&&startLine.slice(openEnd,openEnd+pad.length)==pad&&(openEnd+=pad.length),self.replaceRange("",Pos(start,open),Pos(start,openEnd)),lead)for(var i=start+1;i<=end;++i){var line=self.getLine(i),found=line.indexOf(lead);if(-1!=found&&!nonWS.test(line.slice(0,found))){var foundEnd=found+lead.length;pad&&line.slice(foundEnd,foundEnd+pad.length)==pad&&(foundEnd+=pad.length),self.replaceRange("",Pos(i,found),Pos(i,foundEnd))}}}),!0)})})},{"../../lib/codemirror":65}],53:[function(require,module,exports){!function(mod){mod("object"==typeof exports&&"object"==typeof module?require("../../lib/codemirror"):CodeMirror)}(function(CodeMirror){function dialogDiv(cm,template,bottom){var dialog;return dialog=cm.getWrapperElement().appendChild(document.createElement("div")),dialog.className=bottom?"CodeMirror-dialog CodeMirror-dialog-bottom":"CodeMirror-dialog CodeMirror-dialog-top","string"==typeof template?dialog.innerHTML=template:dialog.appendChild(template),dialog}function closeNotification(cm,newVal){cm.state.currentNotificationClose&&cm.state.currentNotificationClose(),cm.state.currentNotificationClose=newVal}CodeMirror.defineExtension("openDialog",function(template,callback,options){function close(newVal){if("string"==typeof newVal)inp.value=newVal;else{if(closed)return;closed=!0,dialog.parentNode.removeChild(dialog),me.focus(),options.onClose&&options.onClose(dialog)}}options||(options={}),closeNotification(this,null);var button,dialog=dialogDiv(this,template,options.bottom),closed=!1,me=this,inp=dialog.getElementsByTagName("input")[0];return inp?(inp.focus(),options.value&&(inp.value=options.value,!1!==options.selectValueOnOpen&&inp.select()),options.onInput&&CodeMirror.on(inp,"input",function(e){options.onInput(e,inp.value,close)}),options.onKeyUp&&CodeMirror.on(inp,"keyup",function(e){options.onKeyUp(e,inp.value,close)}),CodeMirror.on(inp,"keydown",function(e){options&&options.onKeyDown&&options.onKeyDown(e,inp.value,close)||((27==e.keyCode||!1!==options.closeOnEnter&&13==e.keyCode)&&(inp.blur(),CodeMirror.e_stop(e),close()),13==e.keyCode&&callback(inp.value,e))}),!1!==options.closeOnBlur&&CodeMirror.on(inp,"blur",close)):(button=dialog.getElementsByTagName("button")[0])&&(CodeMirror.on(button,"click",function(){close(),me.focus()}),!1!==options.closeOnBlur&&CodeMirror.on(button,"blur",close),button.focus()),close}),CodeMirror.defineExtension("openConfirm",function(template,callbacks,options){function close(){closed||(closed=!0,dialog.parentNode.removeChild(dialog),me.focus())}closeNotification(this,null);var dialog=dialogDiv(this,template,options&&options.bottom),buttons=dialog.getElementsByTagName("button"),closed=!1,me=this,blurring=1;buttons[0].focus();for(var i=0;i<buttons.length;++i){var b=buttons[i];!function(callback){CodeMirror.on(b,"click",function(e){CodeMirror.e_preventDefault(e),close(),callback&&callback(me)})}(callbacks[i]),CodeMirror.on(b,"blur",function(){--blurring,setTimeout(function(){blurring<=0&&close()},200)}),CodeMirror.on(b,"focus",function(){++blurring})}}),CodeMirror.defineExtension("openNotification",function(template,options){function close(){closed||(closed=!0,clearTimeout(doneTimer),dialog.parentNode.removeChild(dialog))}closeNotification(this,close);var doneTimer,dialog=dialogDiv(this,template,options&&options.bottom),closed=!1,duration=options&&void 0!==options.duration?options.duration:5e3;return CodeMirror.on(dialog,"click",function(e){CodeMirror.e_preventDefault(e),close()}),duration&&(doneTimer=setTimeout(close,duration)),close})})},{"../../lib/codemirror":65}],54:[function(require,module,exports){!function(mod){mod("object"==typeof exports&&"object"==typeof module?require("../../lib/codemirror"):CodeMirror)}(function(CodeMirror){function getOption(conf,name){return"pairs"==name&&"string"==typeof conf?conf:"object"==typeof conf&&null!=conf[name]?conf[name]:defaults[name]}function getConfig(cm){var deflt=cm.state.closeBrackets;return!deflt||deflt.override?deflt:cm.getModeAt(cm.getCursor()).closeBrackets||deflt}function contractSelection(sel){var inverted=CodeMirror.cmpPos(sel.anchor,sel.head)>0;return{anchor:new Pos(sel.anchor.line,sel.anchor.ch+(inverted?-1:1)),head:new Pos(sel.head.line,sel.head.ch+(inverted?1:-1))}}function handleChar(cm,ch){var conf=getConfig(cm);if(!conf||cm.getOption("disableInput"))return CodeMirror.Pass;var pairs=getOption(conf,"pairs"),pos=pairs.indexOf(ch);if(-1==pos)return CodeMirror.Pass;for(var type,triples=getOption(conf,"triples"),identical=pairs.charAt(pos+1)==ch,ranges=cm.listSelections(),opening=pos%2==0,i=0;i<ranges.length;i++){var curType,range=ranges[i],cur=range.head,next=cm.getRange(cur,Pos(cur.line,cur.ch+1));if(opening&&!range.empty())curType="surround";else if(!identical&&opening||next!=ch)if(identical&&cur.ch>1&&triples.indexOf(ch)>=0&&cm.getRange(Pos(cur.line,cur.ch-2),cur)==ch+ch&&(cur.ch<=2||cm.getRange(Pos(cur.line,cur.ch-3),Pos(cur.line,cur.ch-2))!=ch))curType="addFour";else if(identical){if(CodeMirror.isWordChar(next)||!enteringString(cm,cur,ch))return CodeMirror.Pass;curType="both"}else{if(!opening||cm.getLine(cur.line).length!=cur.ch&&!isClosingBracket(next,pairs)&&!/\s/.test(next))return CodeMirror.Pass;curType="both"}else curType=identical&&stringStartsAfter(cm,cur)?"both":triples.indexOf(ch)>=0&&cm.getRange(cur,Pos(cur.line,cur.ch+3))==ch+ch+ch?"skipThree":"skip";if(type){if(type!=curType)return CodeMirror.Pass}else type=curType}var left=pos%2?pairs.charAt(pos-1):ch,right=pos%2?ch:pairs.charAt(pos+1);cm.operation(function(){if("skip"==type)cm.execCommand("goCharRight");else if("skipThree"==type)for(i=0;i<3;i++)cm.execCommand("goCharRight");else if("surround"==type){for(var sels=cm.getSelections(),i=0;i<sels.length;i++)sels[i]=left+sels[i]+right;cm.replaceSelections(sels,"around"),sels=cm.listSelections().slice();for(i=0;i<sels.length;i++)sels[i]=contractSelection(sels[i]);cm.setSelections(sels)}else"both"==type?(cm.replaceSelection(left+right,null),cm.triggerElectric(left+right),cm.execCommand("goCharLeft")):"addFour"==type&&(cm.replaceSelection(left+left+left+left,"before"),cm.execCommand("goCharRight"))})}function isClosingBracket(ch,pairs){var pos=pairs.lastIndexOf(ch);return pos>-1&&pos%2==1}function charsAround(cm,pos){var str=cm.getRange(Pos(pos.line,pos.ch-1),Pos(pos.line,pos.ch+1));return 2==str.length?str:null}function enteringString(cm,pos,ch){var line=cm.getLine(pos.line),token=cm.getTokenAt(pos);if(/\bstring2?\b/.test(token.type)||stringStartsAfter(cm,pos))return!1;var stream=new CodeMirror.StringStream(line.slice(0,pos.ch)+ch+line.slice(pos.ch),4);for(stream.pos=stream.start=token.start;;){var type1=cm.getMode().token(stream,token.state);if(stream.pos>=pos.ch+1)return/\bstring2?\b/.test(type1);stream.start=stream.pos}}function stringStartsAfter(cm,pos){var token=cm.getTokenAt(Pos(pos.line,pos.ch+1));return/\bstring/.test(token.type)&&token.start==pos.ch}var defaults={pairs:"()[]{}''\"\"",triples:"",explode:"[]{}"},Pos=CodeMirror.Pos;CodeMirror.defineOption("autoCloseBrackets",!1,function(cm,val,old){old&&old!=CodeMirror.Init&&(cm.removeKeyMap(keyMap),cm.state.closeBrackets=null),val&&(cm.state.closeBrackets=val,cm.addKeyMap(keyMap))});for(var bind=defaults.pairs+"`",keyMap={Backspace:function(cm){var conf=getConfig(cm);if(!conf||cm.getOption("disableInput"))return CodeMirror.Pass;for(var pairs=getOption(conf,"pairs"),ranges=cm.listSelections(),i=0;i<ranges.length;i++){if(!ranges[i].empty())return CodeMirror.Pass;var around=charsAround(cm,ranges[i].head);if(!around||pairs.indexOf(around)%2!=0)return CodeMirror.Pass}for(i=ranges.length-1;i>=0;i--){var cur=ranges[i].head;cm.replaceRange("",Pos(cur.line,cur.ch-1),Pos(cur.line,cur.ch+1),"+delete")}},Enter:function(cm){var conf=getConfig(cm),explode=conf&&getOption(conf,"explode");if(!explode||cm.getOption("disableInput"))return CodeMirror.Pass;for(var ranges=cm.listSelections(),i=0;i<ranges.length;i++){if(!ranges[i].empty())return CodeMirror.Pass;var around=charsAround(cm,ranges[i].head);if(!around||explode.indexOf(around)%2!=0)return CodeMirror.Pass}cm.operation(function(){cm.replaceSelection("\n\n",null),cm.execCommand("goCharLeft"),ranges=cm.listSelections();for(var i=0;i<ranges.length;i++){var line=ranges[i].head.line;cm.indentLine(line,null,!0),cm.indentLine(line+1,null,!0)}})}},i=0;i<bind.length;i++)keyMap["'"+bind.charAt(i)+"'"]=function(ch){return function(cm){return handleChar(cm,ch)}}(bind.charAt(i))})},{"../../lib/codemirror":65}],55:[function(require,module,exports){!function(mod){mod("object"==typeof exports&&"object"==typeof module?require("../../lib/codemirror"):CodeMirror)}(function(CodeMirror){function findMatchingBracket(cm,where,config){var line=cm.getLineHandle(where.line),pos=where.ch-1,afterCursor=config&&config.afterCursor;null==afterCursor&&(afterCursor=/(^| )cm-fat-cursor($| )/.test(cm.getWrapperElement().className));var match=!afterCursor&&pos>=0&&matching[line.text.charAt(pos)]||matching[line.text.charAt(++pos)];if(!match)return null;var dir=">"==match.charAt(1)?1:-1;if(config&&config.strict&&dir>0!=(pos==where.ch))return null;var style=cm.getTokenTypeAt(Pos(where.line,pos+1)),found=scanForBracket(cm,Pos(where.line,pos+(dir>0?1:0)),dir,style||null,config);return null==found?null:{from:Pos(where.line,pos),to:found&&found.pos,match:found&&found.ch==match.charAt(0),forward:dir>0}}function scanForBracket(cm,where,dir,style,config){for(var maxScanLen=config&&config.maxScanLineLength||1e4,maxScanLines=config&&config.maxScanLines||1e3,stack=[],re=config&&config.bracketRegex?config.bracketRegex:/[(){}[\]]/,lineEnd=dir>0?Math.min(where.line+maxScanLines,cm.lastLine()+1):Math.max(cm.firstLine()-1,where.line-maxScanLines),lineNo=where.line;lineNo!=lineEnd;lineNo+=dir){var line=cm.getLine(lineNo);if(line){var pos=dir>0?0:line.length-1,end=dir>0?line.length:-1;if(!(line.length>maxScanLen))for(lineNo==where.line&&(pos=where.ch-(dir<0?1:0));pos!=end;pos+=dir){var ch=line.charAt(pos);if(re.test(ch)&&(void 0===style||cm.getTokenTypeAt(Pos(lineNo,pos+1))==style))if(">"==matching[ch].charAt(1)==dir>0)stack.push(ch);else{if(!stack.length)return{pos:Pos(lineNo,pos),ch:ch};stack.pop()}}}}return lineNo-dir!=(dir>0?cm.lastLine():cm.firstLine())&&null}function matchBrackets(cm,autoclear,config){for(var maxHighlightLen=cm.state.matchBrackets.maxHighlightLineLength||1e3,marks=[],ranges=cm.listSelections(),i=0;i<ranges.length;i++){var match=ranges[i].empty()&&findMatchingBracket(cm,ranges[i].head,config);if(match&&cm.getLine(match.from.line).length<=maxHighlightLen){var style=match.match?"CodeMirror-matchingbracket":"CodeMirror-nonmatchingbracket";marks.push(cm.markText(match.from,Pos(match.from.line,match.from.ch+1),{className:style})),match.to&&cm.getLine(match.to.line).length<=maxHighlightLen&&marks.push(cm.markText(match.to,Pos(match.to.line,match.to.ch+1),{className:style}))}}if(marks.length){ie_lt8&&cm.state.focused&&cm.focus();var clear=function(){cm.operation(function(){for(var i=0;i<marks.length;i++)marks[i].clear()})};if(!autoclear)return clear;setTimeout(clear,800)}}function doMatchBrackets(cm){cm.operation(function(){currentlyHighlighted&&(currentlyHighlighted(),currentlyHighlighted=null),currentlyHighlighted=matchBrackets(cm,!1,cm.state.matchBrackets)})}var ie_lt8=/MSIE \d/.test(navigator.userAgent)&&(null==document.documentMode||document.documentMode<8),Pos=CodeMirror.Pos,matching={"(":")>",")":"(<","[":"]>","]":"[<","{":"}>","}":"{<"},currentlyHighlighted=null;CodeMirror.defineOption("matchBrackets",!1,function(cm,val,old){old&&old!=CodeMirror.Init&&(cm.off("cursorActivity",doMatchBrackets),currentlyHighlighted&&(currentlyHighlighted(),currentlyHighlighted=null)),val&&(cm.state.matchBrackets="object"==typeof val?val:{},cm.on("cursorActivity",doMatchBrackets))}),CodeMirror.defineExtension("matchBrackets",function(){matchBrackets(this,!0)}),CodeMirror.defineExtension("findMatchingBracket",function(pos,config,oldConfig){return(oldConfig||"boolean"==typeof config)&&(oldConfig?(oldConfig.strict=config,config=oldConfig):config=config?{strict:!0}:null),findMatchingBracket(this,pos,config)}),CodeMirror.defineExtension("scanForBracket",function(pos,dir,style,config){return scanForBracket(this,pos,dir,style,config)})})},{"../../lib/codemirror":65}],56:[function(require,module,exports){!function(mod){mod("object"==typeof exports&&"object"==typeof module?require("../../lib/codemirror"):CodeMirror)}(function(CodeMirror){"use strict";CodeMirror.registerHelper("fold","brace",function(cm,start){function findOpening(openCh){for(var at=start.ch,pass=0;;){var found=at<=0?-1:lineText.lastIndexOf(openCh,at-1);if(-1!=found){if(1==pass&&found<start.ch)break;if(tokenType=cm.getTokenTypeAt(CodeMirror.Pos(line,found+1)),!/^(comment|string)/.test(tokenType))return found+1;at=found-1}else{if(1==pass)break;pass=1,at=lineText.length}}}var tokenType,line=start.line,lineText=cm.getLine(line),startToken="{",endToken="}",startCh=findOpening("{");if(null==startCh&&(startToken="[",endToken="]",startCh=findOpening("[")),null!=startCh){var end,endCh,count=1,lastLine=cm.lastLine();outer:for(var i=line;i<=lastLine;++i)for(var text=cm.getLine(i),pos=i==line?startCh:0;;){var nextOpen=text.indexOf(startToken,pos),nextClose=text.indexOf(endToken,pos);if(nextOpen<0&&(nextOpen=text.length),nextClose<0&&(nextClose=text.length),(pos=Math.min(nextOpen,nextClose))==text.length)break;if(cm.getTokenTypeAt(CodeMirror.Pos(i,pos+1))==tokenType)if(pos==nextOpen)++count;else if(!--count){end=i,endCh=pos;break outer}++pos}if(null!=end&&(line!=end||endCh!=startCh))return{from:CodeMirror.Pos(line,startCh),to:CodeMirror.Pos(end,endCh)}}}),CodeMirror.registerHelper("fold","import",function(cm,start){function hasImport(line){if(line<cm.firstLine()||line>cm.lastLine())return null;var start=cm.getTokenAt(CodeMirror.Pos(line,1));if(/\S/.test(start.string)||(start=cm.getTokenAt(CodeMirror.Pos(line,start.end+1))),"keyword"!=start.type||"import"!=start.string)return null;for(var i=line,e=Math.min(cm.lastLine(),line+10);i<=e;++i){var semi=cm.getLine(i).indexOf(";");if(-1!=semi)return{startCh:start.end,end:CodeMirror.Pos(i,semi)}}}var prev,startLine=start.line,has=hasImport(startLine);if(!has||hasImport(startLine-1)||(prev=hasImport(startLine-2))&&prev.end.line==startLine-1)return null;for(var end=has.end;;){var next=hasImport(end.line+1);if(null==next)break;end=next.end}return{from:cm.clipPos(CodeMirror.Pos(startLine,has.startCh+1)),to:end}}),CodeMirror.registerHelper("fold","include",function(cm,start){function hasInclude(line){if(line<cm.firstLine()||line>cm.lastLine())return null;var start=cm.getTokenAt(CodeMirror.Pos(line,1));return/\S/.test(start.string)||(start=cm.getTokenAt(CodeMirror.Pos(line,start.end+1))),"meta"==start.type&&"#include"==start.string.slice(0,8)?start.start+8:void 0}var startLine=start.line,has=hasInclude(startLine);if(null==has||null!=hasInclude(startLine-1))return null;for(var end=startLine;null!=hasInclude(end+1);)++end;return{from:CodeMirror.Pos(startLine,has+1),to:cm.clipPos(CodeMirror.Pos(end))}})})},{"../../lib/codemirror":65}],57:[function(require,module,exports){!function(mod){mod("object"==typeof exports&&"object"==typeof module?require("../../lib/codemirror"):CodeMirror)}(function(CodeMirror){"use strict";function doFold(cm,pos,options,force){function getRange(allowFolded){var range=finder(cm,pos);if(!range||range.to.line-range.from.line<minSize)return null;for(var marks=cm.findMarksAt(range.from),i=0;i<marks.length;++i)if(marks[i].__isFold&&"fold"!==force){if(!allowFolded)return null;range.cleared=!0,marks[i].clear()}return range}if(options&&options.call){finder=options;options=null}else var finder=getOption(cm,options,"rangeFinder");"number"==typeof pos&&(pos=CodeMirror.Pos(pos,0));var minSize=getOption(cm,options,"minFoldSize"),range=getRange(!0);if(getOption(cm,options,"scanUp"))for(;!range&&pos.line>cm.firstLine();)pos=CodeMirror.Pos(pos.line-1,0),range=getRange(!1);if(range&&!range.cleared&&"unfold"!==force){var myWidget=makeWidget(cm,options);CodeMirror.on(myWidget,"mousedown",function(e){myRange.clear(),CodeMirror.e_preventDefault(e)});var myRange=cm.markText(range.from,range.to,{replacedWith:myWidget,clearOnEnter:getOption(cm,options,"clearOnEnter"),__isFold:!0});myRange.on("clear",function(from,to){CodeMirror.signal(cm,"unfold",cm,from,to)}),CodeMirror.signal(cm,"fold",cm,range.from,range.to)}}function makeWidget(cm,options){var widget=getOption(cm,options,"widget");if("string"==typeof widget){var text=document.createTextNode(widget);(widget=document.createElement("span")).appendChild(text),widget.className="CodeMirror-foldmarker"}return widget}function getOption(cm,options,name){if(options&&void 0!==options[name])return options[name];var editorOptions=cm.options.foldOptions;return editorOptions&&void 0!==editorOptions[name]?editorOptions[name]:defaultOptions[name]}CodeMirror.newFoldFunction=function(rangeFinder,widget){return function(cm,pos){doFold(cm,pos,{rangeFinder:rangeFinder,widget:widget})}},CodeMirror.defineExtension("foldCode",function(pos,options,force){doFold(this,pos,options,force)}),CodeMirror.defineExtension("isFolded",function(pos){for(var marks=this.findMarksAt(pos),i=0;i<marks.length;++i)if(marks[i].__isFold)return!0}),CodeMirror.commands.toggleFold=function(cm){cm.foldCode(cm.getCursor())},CodeMirror.commands.fold=function(cm){cm.foldCode(cm.getCursor(),null,"fold")},CodeMirror.commands.unfold=function(cm){cm.foldCode(cm.getCursor(),null,"unfold")},CodeMirror.commands.foldAll=function(cm){cm.operation(function(){for(var i=cm.firstLine(),e=cm.lastLine();i<=e;i++)cm.foldCode(CodeMirror.Pos(i,0),null,"fold")})},CodeMirror.commands.unfoldAll=function(cm){cm.operation(function(){for(var i=cm.firstLine(),e=cm.lastLine();i<=e;i++)cm.foldCode(CodeMirror.Pos(i,0),null,"unfold")})},CodeMirror.registerHelper("fold","combine",function(){var funcs=Array.prototype.slice.call(arguments,0);return function(cm,start){for(var i=0;i<funcs.length;++i){var found=funcs[i](cm,start);if(found)return found}}}),CodeMirror.registerHelper("fold","auto",function(cm,start){for(var helpers=cm.getHelpers(start,"fold"),i=0;i<helpers.length;i++){var cur=helpers[i](cm,start);if(cur)return cur}});var defaultOptions={rangeFinder:CodeMirror.fold.auto,widget:"↔",minFoldSize:0,scanUp:!1,clearOnEnter:!0};CodeMirror.defineOption("foldOptions",null),CodeMirror.defineExtension("foldOption",function(options,name){return getOption(this,options,name)})})},{"../../lib/codemirror":65}],58:[function(require,module,exports){!function(mod){"object"==typeof exports&&"object"==typeof module?mod(require("../../lib/codemirror"),require("./foldcode")):mod(CodeMirror)}(function(CodeMirror){"use strict";function State(options){this.options=options,this.from=this.to=0}function parseOptions(opts){return!0===opts&&(opts={}),null==opts.gutter&&(opts.gutter="CodeMirror-foldgutter"),null==opts.indicatorOpen&&(opts.indicatorOpen="CodeMirror-foldgutter-open"),null==opts.indicatorFolded&&(opts.indicatorFolded="CodeMirror-foldgutter-folded"),opts}function isFolded(cm,line){for(var marks=cm.findMarks(Pos(line,0),Pos(line+1,0)),i=0;i<marks.length;++i)if(marks[i].__isFold&&marks[i].find().from.line==line)return marks[i]}function marker(spec){if("string"==typeof spec){var elt=document.createElement("div");return elt.className=spec+" CodeMirror-guttermarker-subtle",elt}return spec.cloneNode(!0)}function updateFoldInfo(cm,from,to){var opts=cm.state.foldGutter.options,cur=from,minSize=cm.foldOption(opts,"minFoldSize"),func=cm.foldOption(opts,"rangeFinder");cm.eachLine(from,to,function(line){var mark=null;if(isFolded(cm,cur))mark=marker(opts.indicatorFolded);else{var pos=Pos(cur,0),range=func&&func(cm,pos);range&&range.to.line-range.from.line>=minSize&&(mark=marker(opts.indicatorOpen))}cm.setGutterMarker(line,opts.gutter,mark),++cur})}function updateInViewport(cm){var vp=cm.getViewport(),state=cm.state.foldGutter;state&&(cm.operation(function(){updateFoldInfo(cm,vp.from,vp.to)}),state.from=vp.from,state.to=vp.to)}function onGutterClick(cm,line,gutter){var state=cm.state.foldGutter;if(state){var opts=state.options;if(gutter==opts.gutter){var folded=isFolded(cm,line);folded?folded.clear():cm.foldCode(Pos(line,0),opts.rangeFinder)}}}function onChange(cm){var state=cm.state.foldGutter;if(state){var opts=state.options;state.from=state.to=0,clearTimeout(state.changeUpdate),state.changeUpdate=setTimeout(function(){updateInViewport(cm)},opts.foldOnChangeTimeSpan||600)}}function onViewportChange(cm){var state=cm.state.foldGutter;if(state){var opts=state.options;clearTimeout(state.changeUpdate),state.changeUpdate=setTimeout(function(){var vp=cm.getViewport();state.from==state.to||vp.from-state.to>20||state.from-vp.to>20?updateInViewport(cm):cm.operation(function(){vp.from<state.from&&(updateFoldInfo(cm,vp.from,state.from),state.from=vp.from),vp.to>state.to&&(updateFoldInfo(cm,state.to,vp.to),state.to=vp.to)})},opts.updateViewportTimeSpan||400)}}function onFold(cm,from){var state=cm.state.foldGutter;if(state){var line=from.line;line>=state.from&&line<state.to&&updateFoldInfo(cm,line,line+1)}}CodeMirror.defineOption("foldGutter",!1,function(cm,val,old){old&&old!=CodeMirror.Init&&(cm.clearGutter(cm.state.foldGutter.options.gutter),cm.state.foldGutter=null,cm.off("gutterClick",onGutterClick),cm.off("change",onChange),cm.off("viewportChange",onViewportChange),cm.off("fold",onFold),cm.off("unfold",onFold),cm.off("swapDoc",onChange)),val&&(cm.state.foldGutter=new State(parseOptions(val)),updateInViewport(cm),cm.on("gutterClick",onGutterClick),cm.on("change",onChange),cm.on("viewportChange",onViewportChange),cm.on("fold",onFold),cm.on("unfold",onFold),cm.on("swapDoc",onChange))});var Pos=CodeMirror.Pos})},{"../../lib/codemirror":65,"./foldcode":57}],59:[function(require,module,exports){!function(mod){mod("object"==typeof exports&&"object"==typeof module?require("../../lib/codemirror"):CodeMirror)}(function(CodeMirror){"use strict";function Completion(cm,options){this.cm=cm,this.options=options,this.widget=null,this.debounce=0,this.tick=0,this.startPos=this.cm.getCursor("start"),this.startLen=this.cm.getLine(this.startPos.line).length-this.cm.getSelection().length;var self=this;cm.on("cursorActivity",this.activityFunc=function(){self.cursorActivity()})}function isNewCompletion(old,nw){return CodeMirror.cmpPos(nw.from,old.from)>0&&old.to.ch-old.from.ch!=nw.to.ch-nw.from.ch}function parseOptions(cm,pos,options){var editor=cm.options.hintOptions,out={};for(var prop in defaultOptions)out[prop]=defaultOptions[prop];if(editor)for(var prop in editor)void 0!==editor[prop]&&(out[prop]=editor[prop]);if(options)for(var prop in options)void 0!==options[prop]&&(out[prop]=options[prop]);return out.hint.resolve&&(out.hint=out.hint.resolve(cm,pos)),out}function getText(completion){return"string"==typeof completion?completion:completion.text}function buildKeyMap(completion,handle){function addBinding(key,val){var bound;bound="string"!=typeof val?function(cm){return val(cm,handle)}:baseMap.hasOwnProperty(val)?baseMap[val]:val,ourMap[key]=bound}var baseMap={Up:function(){handle.moveFocus(-1)},Down:function(){handle.moveFocus(1)},PageUp:function(){handle.moveFocus(1-handle.menuSize(),!0)},PageDown:function(){handle.moveFocus(handle.menuSize()-1,!0)},Home:function(){handle.setFocus(0)},End:function(){handle.setFocus(handle.length-1)},Enter:handle.pick,Tab:handle.pick,Esc:handle.close},custom=completion.options.customKeys,ourMap=custom?{}:baseMap;if(custom)for(var key in custom)custom.hasOwnProperty(key)&&addBinding(key,custom[key]);var extra=completion.options.extraKeys;if(extra)for(var key in extra)extra.hasOwnProperty(key)&&addBinding(key,extra[key]);return ourMap}function getHintElement(hintsElement,el){for(;el&&el!=hintsElement;){if("LI"===el.nodeName.toUpperCase()&&el.parentNode==hintsElement)return el;el=el.parentNode}}function Widget(completion,data){this.completion=completion,this.data=data,this.picked=!1;var widget=this,cm=completion.cm,hints=this.hints=document.createElement("ul");hints.className="CodeMirror-hints",this.selectedHint=data.selectedHint||0;for(var completions=data.list,i=0;i<completions.length;++i){var elt=hints.appendChild(document.createElement("li")),cur=completions[i],className=HINT_ELEMENT_CLASS+(i!=this.selectedHint?"":" "+ACTIVE_HINT_ELEMENT_CLASS);null!=cur.className&&(className=cur.className+" "+className),elt.className=className,cur.render?cur.render(elt,data,cur):elt.appendChild(document.createTextNode(cur.displayText||getText(cur))),elt.hintId=i}var pos=cm.cursorCoords(completion.options.alignWithWord?data.from:null),left=pos.left,top=pos.bottom,below=!0;hints.style.left=left+"px",hints.style.top=top+"px";var winW=window.innerWidth||Math.max(document.body.offsetWidth,document.documentElement.offsetWidth),winH=window.innerHeight||Math.max(document.body.offsetHeight,document.documentElement.offsetHeight);(completion.options.container||document.body).appendChild(hints);var box=hints.getBoundingClientRect(),overlapY=box.bottom-winH,scrolls=hints.scrollHeight>hints.clientHeight+1,startScroll=cm.getScrollInfo();if(overlapY>0){var height=box.bottom-box.top;if(pos.top-(pos.bottom-box.top)-height>0)hints.style.top=(top=pos.top-height)+"px",below=!1;else if(height>winH){hints.style.height=winH-5+"px",hints.style.top=(top=pos.bottom-box.top)+"px";var cursor=cm.getCursor();data.from.ch!=cursor.ch&&(pos=cm.cursorCoords(cursor),hints.style.left=(left=pos.left)+"px",box=hints.getBoundingClientRect())}}var overlapX=box.right-winW;if(overlapX>0&&(box.right-box.left>winW&&(hints.style.width=winW-5+"px",overlapX-=box.right-box.left-winW),hints.style.left=(left=pos.left-overlapX)+"px"),scrolls)for(var node=hints.firstChild;node;node=node.nextSibling)node.style.paddingRight=cm.display.nativeBarWidth+"px";if(cm.addKeyMap(this.keyMap=buildKeyMap(completion,{moveFocus:function(n,avoidWrap){widget.changeActive(widget.selectedHint+n,avoidWrap)},setFocus:function(n){widget.changeActive(n)},menuSize:function(){return widget.screenAmount()},length:completions.length,close:function(){completion.close()},pick:function(){widget.pick()},data:data})),completion.options.closeOnUnfocus){var closingOnBlur;cm.on("blur",this.onBlur=function(){closingOnBlur=setTimeout(function(){completion.close()},100)}),cm.on("focus",this.onFocus=function(){clearTimeout(closingOnBlur)})}return cm.on("scroll",this.onScroll=function(){var curScroll=cm.getScrollInfo(),editor=cm.getWrapperElement().getBoundingClientRect(),newTop=top+startScroll.top-curScroll.top,point=newTop-(window.pageYOffset||(document.documentElement||document.body).scrollTop);if(below||(point+=hints.offsetHeight),point<=editor.top||point>=editor.bottom)return completion.close();hints.style.top=newTop+"px",hints.style.left=left+startScroll.left-curScroll.left+"px"}),CodeMirror.on(hints,"dblclick",function(e){var t=getHintElement(hints,e.target||e.srcElement);t&&null!=t.hintId&&(widget.changeActive(t.hintId),widget.pick())}),CodeMirror.on(hints,"click",function(e){var t=getHintElement(hints,e.target||e.srcElement);t&&null!=t.hintId&&(widget.changeActive(t.hintId),completion.options.completeOnSingleClick&&widget.pick())}),CodeMirror.on(hints,"mousedown",function(){setTimeout(function(){cm.focus()},20)}),CodeMirror.signal(data,"select",completions[0],hints.firstChild),!0}function applicableHelpers(cm,helpers){if(!cm.somethingSelected())return helpers;for(var result=[],i=0;i<helpers.length;i++)helpers[i].supportsSelection&&result.push(helpers[i]);return result}function fetchHints(hint,cm,options,callback){if(hint.async)hint(cm,callback,options);else{var result=hint(cm,options);result&&result.then?result.then(callback):callback(result)}}var HINT_ELEMENT_CLASS="CodeMirror-hint",ACTIVE_HINT_ELEMENT_CLASS="CodeMirror-hint-active";CodeMirror.showHint=function(cm,getHints,options){if(!getHints)return cm.showHint(options);options&&options.async&&(getHints.async=!0);var newOpts={hint:getHints};if(options)for(var prop in options)newOpts[prop]=options[prop];return cm.showHint(newOpts)},CodeMirror.defineExtension("showHint",function(options){options=parseOptions(this,this.getCursor("start"),options);var selections=this.listSelections();if(!(selections.length>1)){if(this.somethingSelected()){if(!options.hint.supportsSelection)return;for(var i=0;i<selections.length;i++)if(selections[i].head.line!=selections[i].anchor.line)return}this.state.completionActive&&this.state.completionActive.close();var completion=this.state.completionActive=new Completion(this,options);completion.options.hint&&(CodeMirror.signal(this,"startCompletion",this),completion.update(!0))}});var requestAnimationFrame=window.requestAnimationFrame||function(fn){return setTimeout(fn,1e3/60)},cancelAnimationFrame=window.cancelAnimationFrame||clearTimeout;Completion.prototype={close:function(){this.active()&&(this.cm.state.completionActive=null,this.tick=null,this.cm.off("cursorActivity",this.activityFunc),this.widget&&this.data&&CodeMirror.signal(this.data,"close"),this.widget&&this.widget.close(),CodeMirror.signal(this.cm,"endCompletion",this.cm))},active:function(){return this.cm.state.completionActive==this},pick:function(data,i){var completion=data.list[i];completion.hint?completion.hint(this.cm,data,completion):this.cm.replaceRange(getText(completion),completion.from||data.from,completion.to||data.to,"complete"),CodeMirror.signal(data,"pick",completion),this.close()},cursorActivity:function(){this.debounce&&(cancelAnimationFrame(this.debounce),this.debounce=0);var pos=this.cm.getCursor(),line=this.cm.getLine(pos.line);if(pos.line!=this.startPos.line||line.length-pos.ch!=this.startLen-this.startPos.ch||pos.ch<this.startPos.ch||this.cm.somethingSelected()||pos.ch&&this.options.closeCharacters.test(line.charAt(pos.ch-1)))this.close();else{var self=this;this.debounce=requestAnimationFrame(function(){self.update()}),this.widget&&this.widget.disable()}},update:function(first){if(null!=this.tick){var self=this,myTick=++this.tick;fetchHints(this.options.hint,this.cm,this.options,function(data){self.tick==myTick&&self.finishUpdate(data,first)})}},finishUpdate:function(data,first){this.data&&CodeMirror.signal(this.data,"update");var picked=this.widget&&this.widget.picked||first&&this.options.completeSingle;this.widget&&this.widget.close(),data&&this.data&&isNewCompletion(this.data,data)||(this.data=data,data&&data.list.length&&(picked&&1==data.list.length?this.pick(data,0):(this.widget=new Widget(this,data),CodeMirror.signal(data,"shown"))))}},Widget.prototype={close:function(){if(this.completion.widget==this){this.completion.widget=null,this.hints.parentNode.removeChild(this.hints),this.completion.cm.removeKeyMap(this.keyMap);var cm=this.completion.cm;this.completion.options.closeOnUnfocus&&(cm.off("blur",this.onBlur),cm.off("focus",this.onFocus)),cm.off("scroll",this.onScroll)}},disable:function(){this.completion.cm.removeKeyMap(this.keyMap);var widget=this;this.keyMap={Enter:function(){widget.picked=!0}},this.completion.cm.addKeyMap(this.keyMap)},pick:function(){this.completion.pick(this.data,this.selectedHint)},changeActive:function(i,avoidWrap){if(i>=this.data.list.length?i=avoidWrap?this.data.list.length-1:0:i<0&&(i=avoidWrap?0:this.data.list.length-1),this.selectedHint!=i){var node=this.hints.childNodes[this.selectedHint];node.className=node.className.replace(" "+ACTIVE_HINT_ELEMENT_CLASS,""),(node=this.hints.childNodes[this.selectedHint=i]).className+=" "+ACTIVE_HINT_ELEMENT_CLASS,node.offsetTop<this.hints.scrollTop?this.hints.scrollTop=node.offsetTop-3:node.offsetTop+node.offsetHeight>this.hints.scrollTop+this.hints.clientHeight&&(this.hints.scrollTop=node.offsetTop+node.offsetHeight-this.hints.clientHeight+3),CodeMirror.signal(this.data,"select",this.data.list[this.selectedHint],node)}},screenAmount:function(){return Math.floor(this.hints.clientHeight/this.hints.firstChild.offsetHeight)||1}},CodeMirror.registerHelper("hint","auto",{resolve:function(cm,pos){var words,helpers=cm.getHelpers(pos,"hint");if(helpers.length){var resolved=function(cm,callback,options){function run(i){if(i==app.length)return callback(null);fetchHints(app[i],cm,options,function(result){result&&result.list.length>0?callback(result):run(i+1)})}var app=applicableHelpers(cm,helpers);run(0)};return resolved.async=!0,resolved.supportsSelection=!0,resolved}return(words=cm.getHelper(cm.getCursor(),"hintWords"))?function(cm){return CodeMirror.hint.fromList(cm,{words:words})}:CodeMirror.hint.anyword?function(cm,options){return CodeMirror.hint.anyword(cm,options)}:function(){}}}),CodeMirror.registerHelper("hint","fromList",function(cm,options){var cur=cm.getCursor(),token=cm.getTokenAt(cur),to=CodeMirror.Pos(cur.line,token.end);if(token.string&&/\w/.test(token.string[token.string.length-1]))var term=token.string,from=CodeMirror.Pos(cur.line,token.start);else var term="",from=to;for(var found=[],i=0;i<options.words.length;i++){var word=options.words[i];word.slice(0,term.length)==term&&found.push(word)}if(found.length)return{list:found,from:from,to:to}}),CodeMirror.commands.autocomplete=CodeMirror.showHint;var defaultOptions={hint:CodeMirror.hint.auto,completeSingle:!0,alignWithWord:!0,closeCharacters:/[\s()\[\]{};:>,]/,closeOnUnfocus:!0,completeOnSingleClick:!0,container:null,customKeys:null,extraKeys:null};CodeMirror.defineOption("hintOptions",null)})},{"../../lib/codemirror":65}],60:[function(require,module,exports){!function(mod){mod("object"==typeof exports&&"object"==typeof module?require("../../lib/codemirror"):CodeMirror)}(function(CodeMirror){"use strict";function showTooltip(e,content){function position(e){if(!tt.parentNode)return CodeMirror.off(document,"mousemove",position);tt.style.top=Math.max(0,e.clientY-tt.offsetHeight-5)+"px",tt.style.left=e.clientX+5+"px"}var tt=document.createElement("div");return tt.className="CodeMirror-lint-tooltip",tt.appendChild(content.cloneNode(!0)),document.body.appendChild(tt),CodeMirror.on(document,"mousemove",position),position(e),null!=tt.style.opacity&&(tt.style.opacity=1),tt}function rm(elt){elt.parentNode&&elt.parentNode.removeChild(elt)}function hideTooltip(tt){tt.parentNode&&(null==tt.style.opacity&&rm(tt),tt.style.opacity=0,setTimeout(function(){rm(tt)},600))}function showTooltipFor(e,content,node){function hide(){CodeMirror.off(node,"mouseout",hide),tooltip&&(hideTooltip(tooltip),tooltip=null)}var tooltip=showTooltip(e,content),poll=setInterval(function(){if(tooltip)for(var n=node;;n=n.parentNode){if(n&&11==n.nodeType&&(n=n.host),n==document.body)return;if(!n){hide();break}}if(!tooltip)return clearInterval(poll)},400);CodeMirror.on(node,"mouseout",hide)}function LintState(cm,options,hasGutter){this.marked=[],this.options=options,this.timeout=null,this.hasGutter=hasGutter,this.onMouseOver=function(e){onMouseOver(cm,e)},this.waitingFor=0}function parseOptions(_cm,options){return options instanceof Function?{getAnnotations:options}:(options&&!0!==options||(options={}),options)}function clearMarks(cm){var state=cm.state.lint;state.hasGutter&&cm.clearGutter(GUTTER_ID);for(var i=0;i<state.marked.length;++i)state.marked[i].clear();state.marked.length=0}function makeMarker(labels,severity,multiple,tooltips){var marker=document.createElement("div"),inner=marker;return marker.className="CodeMirror-lint-marker-"+severity,multiple&&((inner=marker.appendChild(document.createElement("div"))).className="CodeMirror-lint-marker-multiple"),0!=tooltips&&CodeMirror.on(inner,"mouseover",function(e){showTooltipFor(e,labels,inner)}),marker}function getMaxSeverity(a,b){return"error"==a?a:b}function groupByLine(annotations){for(var lines=[],i=0;i<annotations.length;++i){var ann=annotations[i],line=ann.from.line;(lines[line]||(lines[line]=[])).push(ann)}return lines}function annotationTooltip(ann){var severity=ann.severity;severity||(severity="error");var tip=document.createElement("div");return tip.className="CodeMirror-lint-message-"+severity,tip.appendChild(document.createTextNode(ann.message)),tip}function lintAsync(cm,getAnnotations,passOptions){function abort(){id=-1,cm.off("change",abort)}var state=cm.state.lint,id=++state.waitingFor;cm.on("change",abort),getAnnotations(cm.getValue(),function(annotations,arg2){cm.off("change",abort),state.waitingFor==id&&(arg2&&annotations instanceof CodeMirror&&(annotations=arg2),updateLinting(cm,annotations))},passOptions,cm)}function startLinting(cm){var options=cm.state.lint.options,passOptions=options.options||options,getAnnotations=options.getAnnotations||cm.getHelper(CodeMirror.Pos(0,0),"lint");if(getAnnotations)if(options.async||getAnnotations.async)lintAsync(cm,getAnnotations,passOptions);else{var annotations=getAnnotations(cm.getValue(),passOptions,cm);if(!annotations)return;annotations.then?annotations.then(function(issues){updateLinting(cm,issues)}):updateLinting(cm,annotations)}}function updateLinting(cm,annotationsNotSorted){clearMarks(cm);for(var state=cm.state.lint,options=state.options,annotations=groupByLine(annotationsNotSorted),line=0;line<annotations.length;++line){var anns=annotations[line];if(anns){for(var maxSeverity=null,tipLabel=state.hasGutter&&document.createDocumentFragment(),i=0;i<anns.length;++i){var ann=anns[i],severity=ann.severity;severity||(severity="error"),maxSeverity=getMaxSeverity(maxSeverity,severity),options.formatAnnotation&&(ann=options.formatAnnotation(ann)),state.hasGutter&&tipLabel.appendChild(annotationTooltip(ann)),ann.to&&state.marked.push(cm.markText(ann.from,ann.to,{className:"CodeMirror-lint-mark-"+severity,__annotation:ann}))}state.hasGutter&&cm.setGutterMarker(line,GUTTER_ID,makeMarker(tipLabel,maxSeverity,anns.length>1,state.options.tooltips))}}options.onUpdateLinting&&options.onUpdateLinting(annotationsNotSorted,annotations,cm)}function onChange(cm){var state=cm.state.lint;state&&(clearTimeout(state.timeout),state.timeout=setTimeout(function(){startLinting(cm)},state.options.delay||500))}function popupTooltips(annotations,e){for(var target=e.target||e.srcElement,tooltip=document.createDocumentFragment(),i=0;i<annotations.length;i++){var ann=annotations[i];tooltip.appendChild(annotationTooltip(ann))}showTooltipFor(e,tooltip,target)}function onMouseOver(cm,e){var target=e.target||e.srcElement;if(/\bCodeMirror-lint-mark-/.test(target.className)){for(var box=target.getBoundingClientRect(),x=(box.left+box.right)/2,y=(box.top+box.bottom)/2,spans=cm.findMarksAt(cm.coordsChar({left:x,top:y},"client")),annotations=[],i=0;i<spans.length;++i){var ann=spans[i].__annotation;ann&&annotations.push(ann)}annotations.length&&popupTooltips(annotations,e)}}var GUTTER_ID="CodeMirror-lint-markers";CodeMirror.defineOption("lint",!1,function(cm,val,old){if(old&&old!=CodeMirror.Init&&(clearMarks(cm),!1!==cm.state.lint.options.lintOnChange&&cm.off("change",onChange),CodeMirror.off(cm.getWrapperElement(),"mouseover",cm.state.lint.onMouseOver),clearTimeout(cm.state.lint.timeout),delete cm.state.lint),val){for(var gutters=cm.getOption("gutters"),hasLintGutter=!1,i=0;i<gutters.length;++i)gutters[i]==GUTTER_ID&&(hasLintGutter=!0);var state=cm.state.lint=new LintState(cm,parseOptions(0,val),hasLintGutter);!1!==state.options.lintOnChange&&cm.on("change",onChange),0!=state.options.tooltips&&"gutter"!=state.options.tooltips&&CodeMirror.on(cm.getWrapperElement(),"mouseover",state.onMouseOver),startLinting(cm)}}),CodeMirror.defineExtension("performLint",function(){this.state.lint&&startLinting(this)})})},{"../../lib/codemirror":65}],61:[function(require,module,exports){!function(mod){"object"==typeof exports&&"object"==typeof module?mod(require("../../lib/codemirror"),require("../dialog/dialog")):mod(CodeMirror)}(function(CodeMirror){"use strict";function dialog(cm,text,shortText,deflt,f){cm.openDialog?cm.openDialog(text,f,{value:deflt,selectValueOnOpen:!0}):f(prompt(shortText,deflt))}function interpretLine(cm,string){var num=Number(string);return/^[-+]/.test(string)?cm.getCursor().line+num:num-1}CodeMirror.commands.jumpToLine=function(cm){var cur=cm.getCursor();dialog(cm,'Jump to line: <input type="text" style="width: 10em" class="CodeMirror-search-field"/> <span style="color: #888" class="CodeMirror-search-hint">(Use line:column or scroll% syntax)</span>',"Jump to line:",cur.line+1+":"+cur.ch,function(posStr){if(posStr){var match;if(match=/^\s*([\+\-]?\d+)\s*\:\s*(\d+)\s*$/.exec(posStr))cm.setCursor(interpretLine(cm,match[1]),Number(match[2]));else if(match=/^\s*([\+\-]?\d+(\.\d+)?)\%\s*/.exec(posStr)){var line=Math.round(cm.lineCount()*Number(match[1])/100);/^[-+]/.test(match[1])&&(line=cur.line+line+1),cm.setCursor(line-1,cur.ch)}else(match=/^\s*\:?\s*([\+\-]?\d+)\s*/.exec(posStr))&&cm.setCursor(interpretLine(cm,match[1]),cur.ch)}})},CodeMirror.keyMap.default["Alt-G"]="jumpToLine"})},{"../../lib/codemirror":65,"../dialog/dialog":53}],62:[function(require,module,exports){!function(mod){"object"==typeof exports&&"object"==typeof module?mod(require("../../lib/codemirror"),require("./searchcursor"),require("../dialog/dialog")):mod(CodeMirror)}(function(CodeMirror){"use strict";function searchOverlay(query,caseInsensitive){return"string"==typeof query?query=new RegExp(query.replace(/[\-\[\]\/\{\}\(\)\*\+\?\.\\\^\$\|]/g,"\\$&"),caseInsensitive?"gi":"g"):query.global||(query=new RegExp(query.source,query.ignoreCase?"gi":"g")),{token:function(stream){query.lastIndex=stream.pos;var match=query.exec(stream.string);if(match&&match.index==stream.pos)return stream.pos+=match[0].length||1,"searching";match?stream.pos=match.index:stream.skipToEnd()}}}function SearchState(){this.posFrom=this.posTo=this.lastQuery=this.query=null,this.overlay=null}function getSearchState(cm){return cm.state.search||(cm.state.search=new SearchState)}function queryCaseInsensitive(query){return"string"==typeof query&&query==query.toLowerCase()}function getSearchCursor(cm,query,pos){return cm.getSearchCursor(query,pos,{caseFold:queryCaseInsensitive(query),multiline:!0})}function persistentDialog(cm,text,deflt,onEnter,onKeyDown){cm.openDialog(text,onEnter,{value:deflt,selectValueOnOpen:!0,closeOnEnter:!1,onClose:function(){clearSearch(cm)},onKeyDown:onKeyDown})}function dialog(cm,text,shortText,deflt,f){cm.openDialog?cm.openDialog(text,f,{value:deflt,selectValueOnOpen:!0}):f(prompt(shortText,deflt))}function confirmDialog(cm,text,shortText,fs){cm.openConfirm?cm.openConfirm(text,fs):confirm(shortText)&&fs[0]()}function parseString(string){return string.replace(/\\(.)/g,function(_,ch){return"n"==ch?"\n":"r"==ch?"\r":ch})}function parseQuery(query){var isRE=query.match(/^\/(.*)\/([a-z]*)$/);if(isRE)try{query=new RegExp(isRE[1],-1==isRE[2].indexOf("i")?"":"i")}catch(e){}else query=parseString(query);return("string"==typeof query?""==query:query.test(""))&&(query=/x^/),query}function startSearch(cm,state,query){state.queryText=query,state.query=parseQuery(query),cm.removeOverlay(state.overlay,queryCaseInsensitive(state.query)),state.overlay=searchOverlay(state.query,queryCaseInsensitive(state.query)),cm.addOverlay(state.overlay),cm.showMatchesOnScrollbar&&(state.annotate&&(state.annotate.clear(),state.annotate=null),state.annotate=cm.showMatchesOnScrollbar(state.query,queryCaseInsensitive(state.query)))}function doSearch(cm,rev,persistent,immediate){var state=getSearchState(cm);if(state.query)return findNext(cm,rev);var q=cm.getSelection()||state.lastQuery;if(persistent&&cm.openDialog){var hiding=null,searchNext=function(query,event){CodeMirror.e_stop(event),query&&(query!=state.queryText&&(startSearch(cm,state,query),state.posFrom=state.posTo=cm.getCursor()),hiding&&(hiding.style.opacity=1),findNext(cm,event.shiftKey,function(_,to){var dialog;to.line<3&&document.querySelector&&(dialog=cm.display.wrapper.querySelector(".CodeMirror-dialog"))&&dialog.getBoundingClientRect().bottom-4>cm.cursorCoords(to,"window").top&&((hiding=dialog).style.opacity=.4)}))};persistentDialog(cm,queryDialog,q,searchNext,function(event,query){var keyName=CodeMirror.keyName(event),cmd=CodeMirror.keyMap[cm.getOption("keyMap")][keyName];cmd||(cmd=cm.getOption("extraKeys")[keyName]),"findNext"==cmd||"findPrev"==cmd||"findPersistentNext"==cmd||"findPersistentPrev"==cmd?(CodeMirror.e_stop(event),startSearch(cm,getSearchState(cm),query),cm.execCommand(cmd)):"find"!=cmd&&"findPersistent"!=cmd||(CodeMirror.e_stop(event),searchNext(query,event))}),immediate&&q&&(startSearch(cm,state,q),findNext(cm,rev))}else dialog(cm,queryDialog,"Search for:",q,function(query){query&&!state.query&&cm.operation(function(){startSearch(cm,state,query),state.posFrom=state.posTo=cm.getCursor(),findNext(cm,rev)})})}function findNext(cm,rev,callback){cm.operation(function(){var state=getSearchState(cm),cursor=getSearchCursor(cm,state.query,rev?state.posFrom:state.posTo);(cursor.find(rev)||(cursor=getSearchCursor(cm,state.query,rev?CodeMirror.Pos(cm.lastLine()):CodeMirror.Pos(cm.firstLine(),0))).find(rev))&&(cm.setSelection(cursor.from(),cursor.to()),cm.scrollIntoView({from:cursor.from(),to:cursor.to()},20),state.posFrom=cursor.from(),state.posTo=cursor.to(),callback&&callback(cursor.from(),cursor.to()))})}function clearSearch(cm){cm.operation(function(){var state=getSearchState(cm);state.lastQuery=state.query,state.query&&(state.query=state.queryText=null,cm.removeOverlay(state.overlay),state.annotate&&(state.annotate.clear(),state.annotate=null))})}function replaceAll(cm,query,text){cm.operation(function(){for(var cursor=getSearchCursor(cm,query);cursor.findNext();)if("string"!=typeof query){var match=cm.getRange(cursor.from(),cursor.to()).match(query);cursor.replace(text.replace(/\$(\d)/g,function(_,i){return match[i]}))}else cursor.replace(text)})}function replace(cm,all){if(!cm.getOption("readOnly")){var query=cm.getSelection()||getSearchState(cm).lastQuery,dialogText='<span class="CodeMirror-search-label">'+(all?"Replace all:":"Replace:")+"</span>";dialog(cm,dialogText+replaceQueryDialog,dialogText,query,function(query){query&&(query=parseQuery(query),dialog(cm,replacementQueryDialog,"Replace with:","",function(text){if(text=parseString(text),all)replaceAll(cm,query,text);else{clearSearch(cm);var cursor=getSearchCursor(cm,query,cm.getCursor("from")),advance=function(){var match,start=cursor.from();!(match=cursor.findNext())&&(cursor=getSearchCursor(cm,query),!(match=cursor.findNext())||start&&cursor.from().line==start.line&&cursor.from().ch==start.ch)||(cm.setSelection(cursor.from(),cursor.to()),cm.scrollIntoView({from:cursor.from(),to:cursor.to()}),confirmDialog(cm,doReplaceConfirm,"Replace?",[function(){doReplace(match)},advance,function(){replaceAll(cm,query,text)}]))},doReplace=function(match){cursor.replace("string"==typeof query?text:text.replace(/\$(\d)/g,function(_,i){return match[i]})),advance()};advance()}}))})}}var queryDialog='<span class="CodeMirror-search-label">Search:</span> <input type="text" style="width: 10em" class="CodeMirror-search-field"/> <span style="color: #888" class="CodeMirror-search-hint">(Use /re/ syntax for regexp search)</span>',replaceQueryDialog=' <input type="text" style="width: 10em" class="CodeMirror-search-field"/> <span style="color: #888" class="CodeMirror-search-hint">(Use /re/ syntax for regexp search)</span>',replacementQueryDialog='<span class="CodeMirror-search-label">With:</span> <input type="text" style="width: 10em" class="CodeMirror-search-field"/>',doReplaceConfirm='<span class="CodeMirror-search-label">Replace?</span> <button>Yes</button> <button>No</button> <button>All</button> <button>Stop</button>';CodeMirror.commands.find=function(cm){clearSearch(cm),doSearch(cm)},CodeMirror.commands.findPersistent=function(cm){clearSearch(cm),doSearch(cm,!1,!0)},CodeMirror.commands.findPersistentNext=function(cm){doSearch(cm,!1,!0,!0)},CodeMirror.commands.findPersistentPrev=function(cm){doSearch(cm,!0,!0,!0)},CodeMirror.commands.findNext=doSearch,CodeMirror.commands.findPrev=function(cm){doSearch(cm,!0)},CodeMirror.commands.clearSearch=clearSearch,CodeMirror.commands.replace=replace,CodeMirror.commands.replaceAll=function(cm){replace(cm,!0)}})},{"../../lib/codemirror":65,"../dialog/dialog":53,"./searchcursor":63}],63:[function(require,module,exports){!function(mod){mod("object"==typeof exports&&"object"==typeof module?require("../../lib/codemirror"):CodeMirror)}(function(CodeMirror){"use strict";function regexpFlags(regexp){var flags=regexp.flags;return null!=flags?flags:(regexp.ignoreCase?"i":"")+(regexp.global?"g":"")+(regexp.multiline?"m":"")}function ensureGlobal(regexp){return regexp.global?regexp:new RegExp(regexp.source,regexpFlags(regexp)+"g")}function maybeMultiline(regexp){return/\\s|\\n|\n|\\W|\\D|\[\^/.test(regexp.source)}function searchRegexpForward(doc,regexp,start){regexp=ensureGlobal(regexp);for(var line=start.line,ch=start.ch,last=doc.lastLine();line<=last;line++,ch=0){regexp.lastIndex=ch;var string=doc.getLine(line),match=regexp.exec(string);if(match)return{from:Pos(line,match.index),to:Pos(line,match.index+match[0].length),match:match}}}function searchRegexpForwardMultiline(doc,regexp,start){if(!maybeMultiline(regexp))return searchRegexpForward(doc,regexp,start);regexp=ensureGlobal(regexp);for(var string,chunk=1,line=start.line,last=doc.lastLine();line<=last;){for(var i=0;i<chunk;i++){var curLine=doc.getLine(line++);string=null==string?curLine:string+"\n"+curLine}chunk*=2,regexp.lastIndex=start.ch;var match=regexp.exec(string);if(match){var before=string.slice(0,match.index).split("\n"),inside=match[0].split("\n"),startLine=start.line+before.length-1,startCh=before[before.length-1].length;return{from:Pos(startLine,startCh),to:Pos(startLine+inside.length-1,1==inside.length?startCh+inside[0].length:inside[inside.length-1].length),match:match}}}}function lastMatchIn(string,regexp){for(var match,cutOff=0;;){regexp.lastIndex=cutOff;var newMatch=regexp.exec(string);if(!newMatch)return match;if(match=newMatch,(cutOff=match.index+(match[0].length||1))==string.length)return match}}function searchRegexpBackward(doc,regexp,start){regexp=ensureGlobal(regexp);for(var line=start.line,ch=start.ch,first=doc.firstLine();line>=first;line--,ch=-1){var string=doc.getLine(line);ch>-1&&(string=string.slice(0,ch));var match=lastMatchIn(string,regexp);if(match)return{from:Pos(line,match.index),to:Pos(line,match.index+match[0].length),match:match}}}function searchRegexpBackwardMultiline(doc,regexp,start){regexp=ensureGlobal(regexp);for(var string,chunk=1,line=start.line,first=doc.firstLine();line>=first;){for(var i=0;i<chunk;i++){var curLine=doc.getLine(line--);string=null==string?curLine.slice(0,start.ch):curLine+"\n"+string}chunk*=2;var match=lastMatchIn(string,regexp);if(match){var before=string.slice(0,match.index).split("\n"),inside=match[0].split("\n"),startLine=line+before.length,startCh=before[before.length-1].length;return{from:Pos(startLine,startCh),to:Pos(startLine+inside.length-1,1==inside.length?startCh+inside[0].length:inside[inside.length-1].length),match:match}}}}function adjustPos(orig,folded,pos){if(orig.length==folded.length)return pos;for(var pos1=Math.min(pos,orig.length);;){var len1=orig.slice(0,pos1).toLowerCase().length;if(len1<pos)++pos1;else{if(!(len1>pos))return pos1;--pos1}}}function searchStringForward(doc,query,start,caseFold){if(!query.length)return null;var fold=caseFold?doFold:noFold,lines=fold(query).split(/\r|\n\r?/);search:for(var line=start.line,ch=start.ch,last=doc.lastLine()+1-lines.length;line<=last;line++,ch=0){var orig=doc.getLine(line).slice(ch),string=fold(orig);if(1==lines.length){var found=string.indexOf(lines[0]);if(-1==found)continue search;var start=adjustPos(orig,string,found)+ch;return{from:Pos(line,adjustPos(orig,string,found)+ch),to:Pos(line,adjustPos(orig,string,found+lines[0].length)+ch)}}var cutFrom=string.length-lines[0].length;if(string.slice(cutFrom)==lines[0]){for(var i=1;i<lines.length-1;i++)if(fold(doc.getLine(line+i))!=lines[i])continue search;var end=doc.getLine(line+lines.length-1),endString=fold(end),lastLine=lines[lines.length-1];if(end.slice(0,lastLine.length)==lastLine)return{from:Pos(line,adjustPos(orig,string,cutFrom)+ch),to:Pos(line+lines.length-1,adjustPos(end,endString,lastLine.length))}}}}function searchStringBackward(doc,query,start,caseFold){if(!query.length)return null;var fold=caseFold?doFold:noFold,lines=fold(query).split(/\r|\n\r?/);search:for(var line=start.line,ch=start.ch,first=doc.firstLine()-1+lines.length;line>=first;line--,ch=-1){var orig=doc.getLine(line);ch>-1&&(orig=orig.slice(0,ch));var string=fold(orig);if(1==lines.length){var found=string.lastIndexOf(lines[0]);if(-1==found)continue search;return{from:Pos(line,adjustPos(orig,string,found)),to:Pos(line,adjustPos(orig,string,found+lines[0].length))}}var lastLine=lines[lines.length-1];if(string.slice(0,lastLine.length)==lastLine){for(var i=1,start=line-lines.length+1;i<lines.length-1;i++)if(fold(doc.getLine(start+i))!=lines[i])continue search;var top=doc.getLine(line+1-lines.length),topString=fold(top);if(topString.slice(topString.length-lines[0].length)==lines[0])return{from:Pos(line+1-lines.length,adjustPos(top,topString,top.length-lines[0].length)),to:Pos(line,adjustPos(orig,string,lastLine.length))}}}}function SearchCursor(doc,query,pos,options){this.atOccurrence=!1,this.doc=doc,pos=pos?doc.clipPos(pos):Pos(0,0),this.pos={from:pos,to:pos};var caseFold;"object"==typeof options?caseFold=options.caseFold:(caseFold=options,options=null),"string"==typeof query?(null==caseFold&&(caseFold=!1),this.matches=function(reverse,pos){return(reverse?searchStringBackward:searchStringForward)(doc,query,pos,caseFold)}):(query=ensureGlobal(query),options&&!1===options.multiline?this.matches=function(reverse,pos){return(reverse?searchRegexpBackward:searchRegexpForward)(doc,query,pos)}:this.matches=function(reverse,pos){return(reverse?searchRegexpBackwardMultiline:searchRegexpForwardMultiline)(doc,query,pos)})}var doFold,noFold,Pos=CodeMirror.Pos;String.prototype.normalize?(doFold=function(str){return str.normalize("NFD").toLowerCase()},noFold=function(str){return str.normalize("NFD")}):(doFold=function(str){return str.toLowerCase()},noFold=function(str){return str}),SearchCursor.prototype={findNext:function(){return this.find(!1)},findPrevious:function(){return this.find(!0)},find:function(reverse){for(var result=this.matches(reverse,this.doc.clipPos(reverse?this.pos.from:this.pos.to));result&&0==CodeMirror.cmpPos(result.from,result.to);)reverse?result.from.ch?result.from=Pos(result.from.line,result.from.ch-1):result=result.from.line==this.doc.firstLine()?null:this.matches(reverse,this.doc.clipPos(Pos(result.from.line-1))):result.to.ch<this.doc.getLine(result.to.line).length?result.to=Pos(result.to.line,result.to.ch+1):result=result.to.line==this.doc.lastLine()?null:this.matches(reverse,Pos(result.to.line+1,0));if(result)return this.pos=result,this.atOccurrence=!0,this.pos.match||!0;var end=Pos(reverse?this.doc.firstLine():this.doc.lastLine()+1,0);return this.pos={from:end,to:end},this.atOccurrence=!1},from:function(){if(this.atOccurrence)return this.pos.from},to:function(){if(this.atOccurrence)return this.pos.to},replace:function(newText,origin){if(this.atOccurrence){var lines=CodeMirror.splitLines(newText);this.doc.replaceRange(lines,this.pos.from,this.pos.to,origin),this.pos.to=Pos(this.pos.from.line+lines.length-1,lines[lines.length-1].length+(1==lines.length?this.pos.from.ch:0))}}},CodeMirror.defineExtension("getSearchCursor",function(query,pos,caseFold){return new SearchCursor(this.doc,query,pos,caseFold)}),CodeMirror.defineDocExtension("getSearchCursor",function(query,pos,caseFold){return new SearchCursor(this,query,pos,caseFold)}),CodeMirror.defineExtension("selectMatches",function(query,caseFold){for(var ranges=[],cur=this.getSearchCursor(query,this.getCursor("from"),caseFold);cur.findNext()&&!(CodeMirror.cmpPos(cur.to(),this.getCursor("to"))>0);)ranges.push({anchor:cur.from(),head:cur.to()});ranges.length&&this.setSelections(ranges,0)})})},{"../../lib/codemirror":65}],64:[function(require,module,exports){!function(mod){"object"==typeof exports&&"object"==typeof module?mod(require("../lib/codemirror"),require("../addon/search/searchcursor"),require("../addon/edit/matchbrackets")):mod(CodeMirror)}(function(CodeMirror){"use strict";function findPosSubword(doc,start,dir){if(dir<0&&0==start.ch)return doc.clipPos(Pos(start.line-1));var line=doc.getLine(start.line);if(dir>0&&start.ch>=line.length)return doc.clipPos(Pos(start.line+1,0));for(var type,state="start",pos=start.ch,e=dir<0?0:line.length,i=0;pos!=e;pos+=dir,i++){var next=line.charAt(dir<0?pos-1:pos),cat="_"!=next&&CodeMirror.isWordChar(next)?"w":"o";if("w"==cat&&next.toUpperCase()==next&&(cat="W"),"start"==state)"o"!=cat&&(state="in",type=cat);else if("in"==state&&type!=cat){if("w"==type&&"W"==cat&&dir<0&&pos--,"W"==type&&"w"==cat&&dir>0){type="w";continue}break}}return Pos(start.line,pos)}function moveSubword(cm,dir){cm.extendSelectionsBy(function(range){return cm.display.shift||cm.doc.extend||range.empty()?findPosSubword(cm.doc,range.head,dir):dir<0?range.from():range.to()})}function insertLine(cm,above){if(cm.isReadOnly())return CodeMirror.Pass;cm.operation(function(){for(var len=cm.listSelections().length,newSelection=[],last=-1,i=0;i<len;i++){var head=cm.listSelections()[i].head;if(!(head.line<=last)){var at=Pos(head.line+(above?0:1),0);cm.replaceRange("\n",at,null,"+insertLine"),cm.indentLine(at.line,null,!0),newSelection.push({head:at,anchor:at}),last=head.line+1}}cm.setSelections(newSelection)}),cm.execCommand("indentAuto")}function wordAt(cm,pos){for(var start=pos.ch,end=start,line=cm.getLine(pos.line);start&&CodeMirror.isWordChar(line.charAt(start-1));)--start;for(;end<line.length&&CodeMirror.isWordChar(line.charAt(end));)++end;return{from:Pos(pos.line,start),to:Pos(pos.line,end),word:line.slice(start,end)}}function isSelectedRange(ranges,from,to){for(var i=0;i<ranges.length;i++)if(ranges[i].from()==from&&ranges[i].to()==to)return!0;return!1}function selectBetweenBrackets(cm){for(var ranges=cm.listSelections(),newRanges=[],i=0;i<ranges.length;i++){var pos=ranges[i].head,opening=cm.scanForBracket(pos,-1);if(!opening)return!1;for(;;){var closing=cm.scanForBracket(pos,1);if(!closing)return!1;if(closing.ch==mirror.charAt(mirror.indexOf(opening.ch)+1)){newRanges.push({anchor:Pos(opening.pos.line,opening.pos.ch+1),head:closing.pos});break}pos=Pos(closing.pos.line,closing.pos.ch+1)}}return cm.setSelections(newRanges),!0}function sortLines(cm,caseSensitive){if(cm.isReadOnly())return CodeMirror.Pass;for(var selected,ranges=cm.listSelections(),toSort=[],i=0;i<ranges.length;i++){var range=ranges[i];if(!range.empty()){for(var from=range.from().line,to=range.to().line;i<ranges.length-1&&ranges[i+1].from().line==to;)to=ranges[++i].to().line;ranges[i].to().ch||to--,toSort.push(from,to)}}toSort.length?selected=!0:toSort.push(cm.firstLine(),cm.lastLine()),cm.operation(function(){for(var ranges=[],i=0;i<toSort.length;i+=2){var from=toSort[i],to=toSort[i+1],start=Pos(from,0),end=Pos(to),lines=cm.getRange(start,end,!1);caseSensitive?lines.sort():lines.sort(function(a,b){var au=a.toUpperCase(),bu=b.toUpperCase();return au!=bu&&(a=au,b=bu),a<b?-1:a==b?0:1}),cm.replaceRange(lines,start,end),selected&&ranges.push({anchor:start,head:Pos(to+1,0)})}selected&&cm.setSelections(ranges,0)})}function modifyWordOrSelection(cm,mod){cm.operation(function(){for(var ranges=cm.listSelections(),indices=[],replacements=[],i=0;i<ranges.length;i++)(range=ranges[i]).empty()?(indices.push(i),replacements.push("")):replacements.push(mod(cm.getRange(range.from(),range.to())));cm.replaceSelections(replacements,"around","case");for(var at,i=indices.length-1;i>=0;i--){var range=ranges[indices[i]];if(!(at&&CodeMirror.cmpPos(range.head,at)>0)){var word=wordAt(cm,range.head);at=word.from,cm.replaceRange(mod(word.word),word.from,word.to)}}})}function getTarget(cm){var from=cm.getCursor("from"),to=cm.getCursor("to");if(0==CodeMirror.cmpPos(from,to)){var word=wordAt(cm,from);if(!word.word)return;from=word.from,to=word.to}return{from:from,to:to,query:cm.getRange(from,to),word:word}}function findAndGoTo(cm,forward){var target=getTarget(cm);if(target){var query=target.query,cur=cm.getSearchCursor(query,forward?target.to:target.from);(forward?cur.findNext():cur.findPrevious())?cm.setSelection(cur.from(),cur.to()):(cur=cm.getSearchCursor(query,forward?Pos(cm.firstLine(),0):cm.clipPos(Pos(cm.lastLine()))),(forward?cur.findNext():cur.findPrevious())?cm.setSelection(cur.from(),cur.to()):target.word&&cm.setSelection(target.from,target.to))}}var map=CodeMirror.keyMap.sublime={fallthrough:"default"},cmds=CodeMirror.commands,Pos=CodeMirror.Pos,mac=CodeMirror.keyMap.default==CodeMirror.keyMap.macDefault,ctrl=mac?"Cmd-":"Ctrl-",goSubwordCombo=mac?"Ctrl-":"Alt-";cmds[map[goSubwordCombo+"Left"]="goSubwordLeft"]=function(cm){moveSubword(cm,-1)},cmds[map[goSubwordCombo+"Right"]="goSubwordRight"]=function(cm){moveSubword(cm,1)},mac&&(map["Cmd-Left"]="goLineStartSmart");var scrollLineCombo=mac?"Ctrl-Alt-":"Ctrl-";cmds[map[scrollLineCombo+"Up"]="scrollLineUp"]=function(cm){var info=cm.getScrollInfo();if(!cm.somethingSelected()){var visibleBottomLine=cm.lineAtHeight(info.top+info.clientHeight,"local");cm.getCursor().line>=visibleBottomLine&&cm.execCommand("goLineUp")}cm.scrollTo(null,info.top-cm.defaultTextHeight())},cmds[map[scrollLineCombo+"Down"]="scrollLineDown"]=function(cm){var info=cm.getScrollInfo();if(!cm.somethingSelected()){var visibleTopLine=cm.lineAtHeight(info.top,"local")+1;cm.getCursor().line<=visibleTopLine&&cm.execCommand("goLineDown")}cm.scrollTo(null,info.top+cm.defaultTextHeight())},cmds[map["Shift-"+ctrl+"L"]="splitSelectionByLine"]=function(cm){for(var ranges=cm.listSelections(),lineRanges=[],i=0;i<ranges.length;i++)for(var from=ranges[i].from(),to=ranges[i].to(),line=from.line;line<=to.line;++line)to.line>from.line&&line==to.line&&0==to.ch||lineRanges.push({anchor:line==from.line?from:Pos(line,0),head:line==to.line?to:Pos(line)});cm.setSelections(lineRanges,0)},map["Shift-Tab"]="indentLess",cmds[map.Esc="singleSelectionTop"]=function(cm){var range=cm.listSelections()[0];cm.setSelection(range.anchor,range.head,{scroll:!1})},cmds[map[ctrl+"L"]="selectLine"]=function(cm){for(var ranges=cm.listSelections(),extended=[],i=0;i<ranges.length;i++){var range=ranges[i];extended.push({anchor:Pos(range.from().line,0),head:Pos(range.to().line+1,0)})}cm.setSelections(extended)},map["Shift-Ctrl-K"]="deleteLine",cmds[map[ctrl+"Enter"]="insertLineAfter"]=function(cm){return insertLine(cm,!1)},cmds[map["Shift-"+ctrl+"Enter"]="insertLineBefore"]=function(cm){return insertLine(cm,!0)},cmds[map[ctrl+"D"]="selectNextOccurrence"]=function(cm){var from=cm.getCursor("from"),to=cm.getCursor("to"),fullWord=cm.state.sublimeFindFullWord==cm.doc.sel;if(0==CodeMirror.cmpPos(from,to)){var word=wordAt(cm,from);if(!word.word)return;cm.setSelection(word.from,word.to),fullWord=!0}else{var text=cm.getRange(from,to),query=fullWord?new RegExp("\\b"+text+"\\b"):text,cur=cm.getSearchCursor(query,to),found=cur.findNext();if(found||(found=(cur=cm.getSearchCursor(query,Pos(cm.firstLine(),0))).findNext()),!found||isSelectedRange(cm.listSelections(),cur.from(),cur.to()))return CodeMirror.Pass;cm.addSelection(cur.from(),cur.to())}fullWord&&(cm.state.sublimeFindFullWord=cm.doc.sel)};var mirror="(){}[]";cmds[map["Shift-"+ctrl+"Space"]="selectScope"]=function(cm){selectBetweenBrackets(cm)||cm.execCommand("selectAll")},cmds[map["Shift-"+ctrl+"M"]="selectBetweenBrackets"]=function(cm){if(!selectBetweenBrackets(cm))return CodeMirror.Pass},cmds[map[ctrl+"M"]="goToBracket"]=function(cm){cm.extendSelectionsBy(function(range){var next=cm.scanForBracket(range.head,1);if(next&&0!=CodeMirror.cmpPos(next.pos,range.head))return next.pos;var prev=cm.scanForBracket(range.head,-1);return prev&&Pos(prev.pos.line,prev.pos.ch+1)||range.head})};var swapLineCombo=mac?"Cmd-Ctrl-":"Shift-Ctrl-";cmds[map[swapLineCombo+"Up"]="swapLineUp"]=function(cm){if(cm.isReadOnly())return CodeMirror.Pass;for(var ranges=cm.listSelections(),linesToMove=[],at=cm.firstLine()-1,newSels=[],i=0;i<ranges.length;i++){var range=ranges[i],from=range.from().line-1,to=range.to().line;newSels.push({anchor:Pos(range.anchor.line-1,range.anchor.ch),head:Pos(range.head.line-1,range.head.ch)}),0!=range.to().ch||range.empty()||--to,from>at?linesToMove.push(from,to):linesToMove.length&&(linesToMove[linesToMove.length-1]=to),at=to}cm.operation(function(){for(var i=0;i<linesToMove.length;i+=2){var from=linesToMove[i],to=linesToMove[i+1],line=cm.getLine(from);cm.replaceRange("",Pos(from,0),Pos(from+1,0),"+swapLine"),to>cm.lastLine()?cm.replaceRange("\n"+line,Pos(cm.lastLine()),null,"+swapLine"):cm.replaceRange(line+"\n",Pos(to,0),null,"+swapLine")}cm.setSelections(newSels),cm.scrollIntoView()})},cmds[map[swapLineCombo+"Down"]="swapLineDown"]=function(cm){if(cm.isReadOnly())return CodeMirror.Pass;for(var ranges=cm.listSelections(),linesToMove=[],at=cm.lastLine()+1,i=ranges.length-1;i>=0;i--){var range=ranges[i],from=range.to().line+1,to=range.from().line;0!=range.to().ch||range.empty()||from--,from<at?linesToMove.push(from,to):linesToMove.length&&(linesToMove[linesToMove.length-1]=to),at=to}cm.operation(function(){for(var i=linesToMove.length-2;i>=0;i-=2){var from=linesToMove[i],to=linesToMove[i+1],line=cm.getLine(from);from==cm.lastLine()?cm.replaceRange("",Pos(from-1),Pos(from),"+swapLine"):cm.replaceRange("",Pos(from,0),Pos(from+1,0),"+swapLine"),cm.replaceRange(line+"\n",Pos(to,0),null,"+swapLine")}cm.scrollIntoView()})},cmds[map[ctrl+"/"]="toggleCommentIndented"]=function(cm){cm.toggleComment({indent:!0})},cmds[map[ctrl+"J"]="joinLines"]=function(cm){for(var ranges=cm.listSelections(),joined=[],i=0;i<ranges.length;i++){for(var range=ranges[i],from=range.from(),start=from.line,end=range.to().line;i<ranges.length-1&&ranges[i+1].from().line==end;)end=ranges[++i].to().line;joined.push({start:start,end:end,anchor:!range.empty()&&from})}cm.operation(function(){for(var offset=0,ranges=[],i=0;i<joined.length;i++){for(var head,obj=joined[i],anchor=obj.anchor&&Pos(obj.anchor.line-offset,obj.anchor.ch),line=obj.start;line<=obj.end;line++){var actual=line-offset;line==obj.end&&(head=Pos(actual,cm.getLine(actual).length+1)),actual<cm.lastLine()&&(cm.replaceRange(" ",Pos(actual),Pos(actual+1,/^\s*/.exec(cm.getLine(actual+1))[0].length)),++offset)}ranges.push({anchor:anchor||head,head:head})}cm.setSelections(ranges,0)})},cmds[map["Shift-"+ctrl+"D"]="duplicateLine"]=function(cm){cm.operation(function(){for(var rangeCount=cm.listSelections().length,i=0;i<rangeCount;i++){var range=cm.listSelections()[i];range.empty()?cm.replaceRange(cm.getLine(range.head.line)+"\n",Pos(range.head.line,0)):cm.replaceRange(cm.getRange(range.from(),range.to()),range.from())}cm.scrollIntoView()})},mac||(map[ctrl+"T"]="transposeChars"),cmds[map.F9="sortLines"]=function(cm){sortLines(cm,!0)},cmds[map[ctrl+"F9"]="sortLinesInsensitive"]=function(cm){sortLines(cm,!1)},cmds[map.F2="nextBookmark"]=function(cm){var marks=cm.state.sublimeBookmarks;if(marks)for(;marks.length;){var current=marks.shift(),found=current.find();if(found)return marks.push(current),cm.setSelection(found.from,found.to)}},cmds[map["Shift-F2"]="prevBookmark"]=function(cm){var marks=cm.state.sublimeBookmarks;if(marks)for(;marks.length;){marks.unshift(marks.pop());var found=marks[marks.length-1].find();if(found)return cm.setSelection(found.from,found.to);marks.pop()}},cmds[map[ctrl+"F2"]="toggleBookmark"]=function(cm){for(var ranges=cm.listSelections(),marks=cm.state.sublimeBookmarks||(cm.state.sublimeBookmarks=[]),i=0;i<ranges.length;i++){for(var from=ranges[i].from(),to=ranges[i].to(),found=cm.findMarks(from,to),j=0;j<found.length;j++)if(found[j].sublimeBookmark){found[j].clear();for(var k=0;k<marks.length;k++)marks[k]==found[j]&&marks.splice(k--,1);break}j==found.length&&marks.push(cm.markText(from,to,{sublimeBookmark:!0,clearWhenEmpty:!1}))}},cmds[map["Shift-"+ctrl+"F2"]="clearBookmarks"]=function(cm){var marks=cm.state.sublimeBookmarks;if(marks)for(var i=0;i<marks.length;i++)marks[i].clear();marks.length=0},cmds[map["Alt-F2"]="selectBookmarks"]=function(cm){var marks=cm.state.sublimeBookmarks,ranges=[];if(marks)for(var i=0;i<marks.length;i++){var found=marks[i].find();found?ranges.push({anchor:found.from,head:found.to}):marks.splice(i--,0)}ranges.length&&cm.setSelections(ranges,0)},map["Alt-Q"]="wrapLines";var cK=ctrl+"K ";map[cK+ctrl+"Backspace"]="delLineLeft",cmds[map.Backspace="smartBackspace"]=function(cm){if(cm.somethingSelected())return CodeMirror.Pass;cm.operation(function(){for(var cursors=cm.listSelections(),indentUnit=cm.getOption("indentUnit"),i=cursors.length-1;i>=0;i--){var cursor=cursors[i].head,toStartOfLine=cm.getRange({line:cursor.line,ch:0},cursor),column=CodeMirror.countColumn(toStartOfLine,null,cm.getOption("tabSize")),deletePos=cm.findPosH(cursor,-1,"char",!1);if(toStartOfLine&&!/\S/.test(toStartOfLine)&&column%indentUnit==0){var prevIndent=new Pos(cursor.line,CodeMirror.findColumn(toStartOfLine,column-indentUnit,indentUnit));prevIndent.ch!=cursor.ch&&(deletePos=prevIndent)}cm.replaceRange("",deletePos,cursor,"+delete")}})},cmds[map[cK+ctrl+"K"]="delLineRight"]=function(cm){cm.operation(function(){for(var ranges=cm.listSelections(),i=ranges.length-1;i>=0;i--)cm.replaceRange("",ranges[i].anchor,Pos(ranges[i].to().line),"+delete");cm.scrollIntoView()})},cmds[map[cK+ctrl+"U"]="upcaseAtCursor"]=function(cm){modifyWordOrSelection(cm,function(str){return str.toUpperCase()})},cmds[map[cK+ctrl+"L"]="downcaseAtCursor"]=function(cm){modifyWordOrSelection(cm,function(str){return str.toLowerCase()})},cmds[map[cK+ctrl+"Space"]="setSublimeMark"]=function(cm){cm.state.sublimeMark&&cm.state.sublimeMark.clear(),cm.state.sublimeMark=cm.setBookmark(cm.getCursor())},cmds[map[cK+ctrl+"A"]="selectToSublimeMark"]=function(cm){var found=cm.state.sublimeMark&&cm.state.sublimeMark.find();found&&cm.setSelection(cm.getCursor(),found)},cmds[map[cK+ctrl+"W"]="deleteToSublimeMark"]=function(cm){var found=cm.state.sublimeMark&&cm.state.sublimeMark.find();if(found){var from=cm.getCursor(),to=found;if(CodeMirror.cmpPos(from,to)>0){var tmp=to;to=from,from=tmp}cm.state.sublimeKilled=cm.getRange(from,to),cm.replaceRange("",from,to)}},cmds[map[cK+ctrl+"X"]="swapWithSublimeMark"]=function(cm){var found=cm.state.sublimeMark&&cm.state.sublimeMark.find();found&&(cm.state.sublimeMark.clear(),cm.state.sublimeMark=cm.setBookmark(cm.getCursor()),cm.setCursor(found))},cmds[map[cK+ctrl+"Y"]="sublimeYank"]=function(cm){null!=cm.state.sublimeKilled&&cm.replaceSelection(cm.state.sublimeKilled,null,"paste")},map[cK+ctrl+"G"]="clearBookmarks",cmds[map[cK+ctrl+"C"]="showInCenter"]=function(cm){var pos=cm.cursorCoords(null,"local");cm.scrollTo(null,(pos.top+pos.bottom)/2-cm.getScrollInfo().clientHeight/2)};var selectLinesCombo=mac?"Ctrl-Shift-":"Ctrl-Alt-";cmds[map[selectLinesCombo+"Up"]="selectLinesUpward"]=function(cm){cm.operation(function(){for(var ranges=cm.listSelections(),i=0;i<ranges.length;i++){var range=ranges[i];range.head.line>cm.firstLine()&&cm.addSelection(Pos(range.head.line-1,range.head.ch))}})},cmds[map[selectLinesCombo+"Down"]="selectLinesDownward"]=function(cm){cm.operation(function(){for(var ranges=cm.listSelections(),i=0;i<ranges.length;i++){var range=ranges[i];range.head.line<cm.lastLine()&&cm.addSelection(Pos(range.head.line+1,range.head.ch))}})},cmds[map[ctrl+"F3"]="findUnder"]=function(cm){findAndGoTo(cm,!0)},cmds[map["Shift-"+ctrl+"F3"]="findUnderPrevious"]=function(cm){findAndGoTo(cm,!1)},cmds[map["Alt-F3"]="findAllUnder"]=function(cm){var target=getTarget(cm);if(target){for(var cur=cm.getSearchCursor(target.query),matches=[],primaryIndex=-1;cur.findNext();)matches.push({anchor:cur.from(),head:cur.to()}),cur.from().line<=target.from.line&&cur.from().ch<=target.from.ch&&primaryIndex++;cm.setSelections(matches,primaryIndex)}},map["Shift-"+ctrl+"["]="fold",map["Shift-"+ctrl+"]"]="unfold",map[cK+ctrl+"0"]=map[cK+ctrl+"J"]="unfoldAll",map[ctrl+"I"]="findIncremental",map["Shift-"+ctrl+"I"]="findIncrementalReverse",map[ctrl+"H"]="replace",map.F3="findNext",map["Shift-F3"]="findPrev",CodeMirror.normalizeKeyMap(map)})},{"../addon/edit/matchbrackets":55,"../addon/search/searchcursor":63,"../lib/codemirror":65}],65:[function(require,module,exports){!function(global,factory){"object"==typeof exports&&void 0!==module?module.exports=factory():global.CodeMirror=factory()}(this,function(){"use strict";function classTest(cls){return new RegExp("(^|\\s)"+cls+"(?:$|\\s)\\s*")}function removeChildren(e){for(var count=e.childNodes.length;count>0;--count)e.removeChild(e.firstChild);return e}function removeChildrenAndAdd(parent,e){return removeChildren(parent).appendChild(e)}function elt(tag,content,className,style){var e=document.createElement(tag);if(className&&(e.className=className),style&&(e.style.cssText=style),"string"==typeof content)e.appendChild(document.createTextNode(content));else if(content)for(var i=0;i<content.length;++i)e.appendChild(content[i]);return e}function eltP(tag,content,className,style){var e=elt(tag,content,className,style);return e.setAttribute("role","presentation"),e}function contains(parent,child){if(3==child.nodeType&&(child=child.parentNode),parent.contains)return parent.contains(child);do{if(11==child.nodeType&&(child=child.host),child==parent)return!0}while(child=child.parentNode)}function activeElt(){var activeElement;try{activeElement=document.activeElement}catch(e){activeElement=document.body||null}for(;activeElement&&activeElement.shadowRoot&&activeElement.shadowRoot.activeElement;)activeElement=activeElement.shadowRoot.activeElement;return activeElement}function addClass(node,cls){var current=node.className;classTest(cls).test(current)||(node.className+=(current?" ":"")+cls)}function joinClasses(a,b){for(var as=a.split(" "),i=0;i<as.length;i++)as[i]&&!classTest(as[i]).test(b)&&(b+=" "+as[i]);return b}function bind(f){var args=Array.prototype.slice.call(arguments,1);return function(){return f.apply(null,args)}}function copyObj(obj,target,overwrite){target||(target={});for(var prop in obj)!obj.hasOwnProperty(prop)||!1===overwrite&&target.hasOwnProperty(prop)||(target[prop]=obj[prop]);return target}function countColumn(string,end,tabSize,startIndex,startValue){null==end&&-1==(end=string.search(/[^\s\u00a0]/))&&(end=string.length);for(var i=startIndex||0,n=startValue||0;;){var nextTab=string.indexOf("\t",i);if(nextTab<0||nextTab>=end)return n+(end-i);n+=nextTab-i,n+=tabSize-n%tabSize,i=nextTab+1}}function indexOf(array,elt){for(var i=0;i<array.length;++i)if(array[i]==elt)return i;return-1}function findColumn(string,goal,tabSize){for(var pos=0,col=0;;){var nextTab=string.indexOf("\t",pos);-1==nextTab&&(nextTab=string.length);var skipped=nextTab-pos;if(nextTab==string.length||col+skipped>=goal)return pos+Math.min(skipped,goal-col);if(col+=nextTab-pos,col+=tabSize-col%tabSize,pos=nextTab+1,col>=goal)return pos}}function spaceStr(n){for(;spaceStrs.length<=n;)spaceStrs.push(lst(spaceStrs)+" ");return spaceStrs[n]}function lst(arr){return arr[arr.length-1]}function map(array,f){for(var out=[],i=0;i<array.length;i++)out[i]=f(array[i],i);return out}function insertSorted(array,value,score){for(var pos=0,priority=score(value);pos<array.length&&score(array[pos])<=priority;)pos++;array.splice(pos,0,value)}function nothing(){}function createObj(base,props){var inst;return Object.create?inst=Object.create(base):(nothing.prototype=base,inst=new nothing),props&&copyObj(props,inst),inst}function isWordCharBasic(ch){return/\w/.test(ch)||ch>"€"&&(ch.toUpperCase()!=ch.toLowerCase()||nonASCIISingleCaseWordChar.test(ch))}function isWordChar(ch,helper){return helper?!!(helper.source.indexOf("\\w")>-1&&isWordCharBasic(ch))||helper.test(ch):isWordCharBasic(ch)}function isEmpty(obj){for(var n in obj)if(obj.hasOwnProperty(n)&&obj[n])return!1;return!0}function isExtendingChar(ch){return ch.charCodeAt(0)>=768&&extendingChars.test(ch)}function skipExtendingChars(str,pos,dir){for(;(dir<0?pos>0:pos<str.length)&&isExtendingChar(str.charAt(pos));)pos+=dir;return pos}function findFirst(pred,from,to){for(;;){if(Math.abs(from-to)<=1)return pred(from)?from:to;var mid=Math.floor((from+to)/2);pred(mid)?to=mid:from=mid}}function Display(place,doc,input){var d=this;this.input=input,d.scrollbarFiller=elt("div",null,"CodeMirror-scrollbar-filler"),d.scrollbarFiller.setAttribute("cm-not-content","true"),d.gutterFiller=elt("div",null,"CodeMirror-gutter-filler"),d.gutterFiller.setAttribute("cm-not-content","true"),d.lineDiv=eltP("div",null,"CodeMirror-code"),d.selectionDiv=elt("div",null,null,"position: relative; z-index: 1"),d.cursorDiv=elt("div",null,"CodeMirror-cursors"),d.measure=elt("div",null,"CodeMirror-measure"),d.lineMeasure=elt("div",null,"CodeMirror-measure"),d.lineSpace=eltP("div",[d.measure,d.lineMeasure,d.selectionDiv,d.cursorDiv,d.lineDiv],null,"position: relative; outline: none");var lines=eltP("div",[d.lineSpace],"CodeMirror-lines");d.mover=elt("div",[lines],null,"position: relative"),d.sizer=elt("div",[d.mover],"CodeMirror-sizer"),d.sizerWidth=null,d.heightForcer=elt("div",null,null,"position: absolute; height: "+scrollerGap+"px; width: 1px;"),d.gutters=elt("div",null,"CodeMirror-gutters"),d.lineGutter=null,d.scroller=elt("div",[d.sizer,d.heightForcer,d.gutters],"CodeMirror-scroll"),d.scroller.setAttribute("tabIndex","-1"),d.wrapper=elt("div",[d.scrollbarFiller,d.gutterFiller,d.scroller],"CodeMirror"),ie&&ie_version<8&&(d.gutters.style.zIndex=-1,d.scroller.style.paddingRight=0),webkit||gecko&&mobile||(d.scroller.draggable=!0),place&&(place.appendChild?place.appendChild(d.wrapper):place(d.wrapper)),d.viewFrom=d.viewTo=doc.first,d.reportedViewFrom=d.reportedViewTo=doc.first,d.view=[],d.renderedView=null,d.externalMeasured=null,d.viewOffset=0,d.lastWrapHeight=d.lastWrapWidth=0,d.updateLineNumbers=null,d.nativeBarWidth=d.barHeight=d.barWidth=0,d.scrollbarsClipped=!1,d.lineNumWidth=d.lineNumInnerWidth=d.lineNumChars=null,d.alignWidgets=!1,d.cachedCharWidth=d.cachedTextHeight=d.cachedPaddingH=null,d.maxLine=null,d.maxLineLength=0,d.maxLineChanged=!1,d.wheelDX=d.wheelDY=d.wheelStartX=d.wheelStartY=null,d.shift=!1,d.selForContextMenu=null,d.activeTouch=null,input.init(d)}function getLine(doc,n){if((n-=doc.first)<0||n>=doc.size)throw new Error("There is no line "+(n+doc.first)+" in the document.");for(var chunk=doc;!chunk.lines;)for(var i=0;;++i){var child=chunk.children[i],sz=child.chunkSize();if(n<sz){chunk=child;break}n-=sz}return chunk.lines[n]}function getBetween(doc,start,end){var out=[],n=start.line;return doc.iter(start.line,end.line+1,function(line){var text=line.text;n==end.line&&(text=text.slice(0,end.ch)),n==start.line&&(text=text.slice(start.ch)),out.push(text),++n}),out}function getLines(doc,from,to){var out=[];return doc.iter(from,to,function(line){out.push(line.text)}),out}function updateLineHeight(line,height){var diff=height-line.height;if(diff)for(var n=line;n;n=n.parent)n.height+=diff}function lineNo(line){if(null==line.parent)return null;for(var cur=line.parent,no=indexOf(cur.lines,line),chunk=cur.parent;chunk;cur=chunk,chunk=chunk.parent)for(var i=0;chunk.children[i]!=cur;++i)no+=chunk.children[i].chunkSize();return no+cur.first}function lineAtHeight(chunk,h){var n=chunk.first;outer:do{for(var i$1=0;i$1<chunk.children.length;++i$1){var child=chunk.children[i$1],ch=child.height;if(h<ch){chunk=child;continue outer}h-=ch,n+=child.chunkSize()}return n}while(!chunk.lines);for(var i=0;i<chunk.lines.length;++i){var lh=chunk.lines[i].height;if(h<lh)break;h-=lh}return n+i}function isLine(doc,l){return l>=doc.first&&l<doc.first+doc.size}function lineNumberFor(options,i){return String(options.lineNumberFormatter(i+options.firstLineNumber))}function Pos(line,ch,sticky){if(void 0===sticky&&(sticky=null),!(this instanceof Pos))return new Pos(line,ch,sticky);this.line=line,this.ch=ch,this.sticky=sticky}function cmp(a,b){return a.line-b.line||a.ch-b.ch}function equalCursorPos(a,b){return a.sticky==b.sticky&&0==cmp(a,b)}function copyPos(x){return Pos(x.line,x.ch)}function maxPos(a,b){return cmp(a,b)<0?b:a}function minPos(a,b){return cmp(a,b)<0?a:b}function clipLine(doc,n){return Math.max(doc.first,Math.min(n,doc.first+doc.size-1))}function clipPos(doc,pos){if(pos.line<doc.first)return Pos(doc.first,0);var last=doc.first+doc.size-1;return pos.line>last?Pos(last,getLine(doc,last).text.length):clipToLen(pos,getLine(doc,pos.line).text.length)}function clipToLen(pos,linelen){var ch=pos.ch;return null==ch||ch>linelen?Pos(pos.line,linelen):ch<0?Pos(pos.line,0):pos}function clipPosArray(doc,array){for(var out=[],i=0;i<array.length;i++)out[i]=clipPos(doc,array[i]);return out}function seeReadOnlySpans(){sawReadOnlySpans=!0}function seeCollapsedSpans(){sawCollapsedSpans=!0}function MarkedSpan(marker,from,to){this.marker=marker,this.from=from,this.to=to}function getMarkedSpanFor(spans,marker){if(spans)for(var i=0;i<spans.length;++i){var span=spans[i];if(span.marker==marker)return span}}function removeMarkedSpan(spans,span){for(var r,i=0;i<spans.length;++i)spans[i]!=span&&(r||(r=[])).push(spans[i]);return r}function addMarkedSpan(line,span){line.markedSpans=line.markedSpans?line.markedSpans.concat([span]):[span],span.marker.attachLine(line)}function markedSpansBefore(old,startCh,isInsert){var nw;if(old)for(var i=0;i<old.length;++i){var span=old[i],marker=span.marker;if(null==span.from||(marker.inclusiveLeft?span.from<=startCh:span.from<startCh)||span.from==startCh&&"bookmark"==marker.type&&(!isInsert||!span.marker.insertLeft)){var endsAfter=null==span.to||(marker.inclusiveRight?span.to>=startCh:span.to>startCh);(nw||(nw=[])).push(new MarkedSpan(marker,span.from,endsAfter?null:span.to))}}return nw}function markedSpansAfter(old,endCh,isInsert){var nw;if(old)for(var i=0;i<old.length;++i){var span=old[i],marker=span.marker;if(null==span.to||(marker.inclusiveRight?span.to>=endCh:span.to>endCh)||span.from==endCh&&"bookmark"==marker.type&&(!isInsert||span.marker.insertLeft)){var startsBefore=null==span.from||(marker.inclusiveLeft?span.from<=endCh:span.from<endCh);(nw||(nw=[])).push(new MarkedSpan(marker,startsBefore?null:span.from-endCh,null==span.to?null:span.to-endCh))}}return nw}function stretchSpansOverChange(doc,change){if(change.full)return null;var oldFirst=isLine(doc,change.from.line)&&getLine(doc,change.from.line).markedSpans,oldLast=isLine(doc,change.to.line)&&getLine(doc,change.to.line).markedSpans;if(!oldFirst&&!oldLast)return null;var startCh=change.from.ch,endCh=change.to.ch,isInsert=0==cmp(change.from,change.to),first=markedSpansBefore(oldFirst,startCh,isInsert),last=markedSpansAfter(oldLast,endCh,isInsert),sameLine=1==change.text.length,offset=lst(change.text).length+(sameLine?startCh:0);if(first)for(var i=0;i<first.length;++i){var span=first[i];if(null==span.to){var found=getMarkedSpanFor(last,span.marker);found?sameLine&&(span.to=null==found.to?null:found.to+offset):span.to=startCh}}if(last)for(var i$1=0;i$1<last.length;++i$1){var span$1=last[i$1];null!=span$1.to&&(span$1.to+=offset),null==span$1.from?getMarkedSpanFor(first,span$1.marker)||(span$1.from=offset,sameLine&&(first||(first=[])).push(span$1)):(span$1.from+=offset,sameLine&&(first||(first=[])).push(span$1))}first&&(first=clearEmptySpans(first)),last&&last!=first&&(last=clearEmptySpans(last));var newMarkers=[first];if(!sameLine){var gapMarkers,gap=change.text.length-2;if(gap>0&&first)for(var i$2=0;i$2<first.length;++i$2)null==first[i$2].to&&(gapMarkers||(gapMarkers=[])).push(new MarkedSpan(first[i$2].marker,null,null));for(var i$3=0;i$3<gap;++i$3)newMarkers.push(gapMarkers);newMarkers.push(last)}return newMarkers}function clearEmptySpans(spans){for(var i=0;i<spans.length;++i){var span=spans[i];null!=span.from&&span.from==span.to&&!1!==span.marker.clearWhenEmpty&&spans.splice(i--,1)}return spans.length?spans:null}function removeReadOnlyRanges(doc,from,to){var markers=null;if(doc.iter(from.line,to.line+1,function(line){if(line.markedSpans)for(var i=0;i<line.markedSpans.length;++i){var mark=line.markedSpans[i].marker;!mark.readOnly||markers&&-1!=indexOf(markers,mark)||(markers||(markers=[])).push(mark)}}),!markers)return null;for(var parts=[{from:from,to:to}],i=0;i<markers.length;++i)for(var mk=markers[i],m=mk.find(0),j=0;j<parts.length;++j){var p=parts[j];if(!(cmp(p.to,m.from)<0||cmp(p.from,m.to)>0)){var newParts=[j,1],dfrom=cmp(p.from,m.from),dto=cmp(p.to,m.to);(dfrom<0||!mk.inclusiveLeft&&!dfrom)&&newParts.push({from:p.from,to:m.from}),(dto>0||!mk.inclusiveRight&&!dto)&&newParts.push({from:m.to,to:p.to}),parts.splice.apply(parts,newParts),j+=newParts.length-3}}return parts}function detachMarkedSpans(line){var spans=line.markedSpans;if(spans){for(var i=0;i<spans.length;++i)spans[i].marker.detachLine(line);line.markedSpans=null}}function attachMarkedSpans(line,spans){if(spans){for(var i=0;i<spans.length;++i)spans[i].marker.attachLine(line);line.markedSpans=spans}}function extraLeft(marker){return marker.inclusiveLeft?-1:0}function extraRight(marker){return marker.inclusiveRight?1:0}function compareCollapsedMarkers(a,b){var lenDiff=a.lines.length-b.lines.length;if(0!=lenDiff)return lenDiff;var aPos=a.find(),bPos=b.find(),fromCmp=cmp(aPos.from,bPos.from)||extraLeft(a)-extraLeft(b);if(fromCmp)return-fromCmp;var toCmp=cmp(aPos.to,bPos.to)||extraRight(a)-extraRight(b);return toCmp||b.id-a.id}function collapsedSpanAtSide(line,start){var found,sps=sawCollapsedSpans&&line.markedSpans;if(sps)for(var sp=void 0,i=0;i<sps.length;++i)(sp=sps[i]).marker.collapsed&&null==(start?sp.from:sp.to)&&(!found||compareCollapsedMarkers(found,sp.marker)<0)&&(found=sp.marker);return found}function collapsedSpanAtStart(line){return collapsedSpanAtSide(line,!0)}function collapsedSpanAtEnd(line){return collapsedSpanAtSide(line,!1)}function conflictingCollapsedRange(doc,lineNo$$1,from,to,marker){var line=getLine(doc,lineNo$$1),sps=sawCollapsedSpans&&line.markedSpans;if(sps)for(var i=0;i<sps.length;++i){var sp=sps[i];if(sp.marker.collapsed){var found=sp.marker.find(0),fromCmp=cmp(found.from,from)||extraLeft(sp.marker)-extraLeft(marker),toCmp=cmp(found.to,to)||extraRight(sp.marker)-extraRight(marker);if(!(fromCmp>=0&&toCmp<=0||fromCmp<=0&&toCmp>=0)&&(fromCmp<=0&&(sp.marker.inclusiveRight&&marker.inclusiveLeft?cmp(found.to,from)>=0:cmp(found.to,from)>0)||fromCmp>=0&&(sp.marker.inclusiveRight&&marker.inclusiveLeft?cmp(found.from,to)<=0:cmp(found.from,to)<0)))return!0}}}function visualLine(line){for(var merged;merged=collapsedSpanAtStart(line);)line=merged.find(-1,!0).line;return line}function visualLineEnd(line){for(var merged;merged=collapsedSpanAtEnd(line);)line=merged.find(1,!0).line;return line}function visualLineContinued(line){for(var merged,lines;merged=collapsedSpanAtEnd(line);)line=merged.find(1,!0).line,(lines||(lines=[])).push(line);return lines}function visualLineNo(doc,lineN){var line=getLine(doc,lineN),vis=visualLine(line);return line==vis?lineN:lineNo(vis)}function visualLineEndNo(doc,lineN){if(lineN>doc.lastLine())return lineN;var merged,line=getLine(doc,lineN);if(!lineIsHidden(doc,line))return lineN;for(;merged=collapsedSpanAtEnd(line);)line=merged.find(1,!0).line;return lineNo(line)+1}function lineIsHidden(doc,line){var sps=sawCollapsedSpans&&line.markedSpans;if(sps)for(var sp=void 0,i=0;i<sps.length;++i)if((sp=sps[i]).marker.collapsed){if(null==sp.from)return!0;if(!sp.marker.widgetNode&&0==sp.from&&sp.marker.inclusiveLeft&&lineIsHiddenInner(doc,line,sp))return!0}}function lineIsHiddenInner(doc,line,span){if(null==span.to){var end=span.marker.find(1,!0);return lineIsHiddenInner(doc,end.line,getMarkedSpanFor(end.line.markedSpans,span.marker))}if(span.marker.inclusiveRight&&span.to==line.text.length)return!0;for(var sp=void 0,i=0;i<line.markedSpans.length;++i)if((sp=line.markedSpans[i]).marker.collapsed&&!sp.marker.widgetNode&&sp.from==span.to&&(null==sp.to||sp.to!=span.from)&&(sp.marker.inclusiveLeft||span.marker.inclusiveRight)&&lineIsHiddenInner(doc,line,sp))return!0}function heightAtLine(lineObj){for(var h=0,chunk=(lineObj=visualLine(lineObj)).parent,i=0;i<chunk.lines.length;++i){var line=chunk.lines[i];if(line==lineObj)break;h+=line.height}for(var p=chunk.parent;p;chunk=p,p=chunk.parent)for(var i$1=0;i$1<p.children.length;++i$1){var cur=p.children[i$1];if(cur==chunk)break;h+=cur.height}return h}function lineLength(line){if(0==line.height)return 0;for(var merged,len=line.text.length,cur=line;merged=collapsedSpanAtStart(cur);){var found=merged.find(0,!0);cur=found.from.line,len+=found.from.ch-found.to.ch}for(cur=line;merged=collapsedSpanAtEnd(cur);){var found$1=merged.find(0,!0);len-=cur.text.length-found$1.from.ch,len+=(cur=found$1.to.line).text.length-found$1.to.ch}return len}function findMaxLine(cm){var d=cm.display,doc=cm.doc;d.maxLine=getLine(doc,doc.first),d.maxLineLength=lineLength(d.maxLine),d.maxLineChanged=!0,doc.iter(function(line){var len=lineLength(line);len>d.maxLineLength&&(d.maxLineLength=len,d.maxLine=line)})}function iterateBidiSections(order,from,to,f){if(!order)return f(from,to,"ltr");for(var found=!1,i=0;i<order.length;++i){var part=order[i];(part.from<to&&part.to>from||from==to&&part.to==from)&&(f(Math.max(part.from,from),Math.min(part.to,to),1==part.level?"rtl":"ltr"),found=!0)}found||f(from,to,"ltr")}function getBidiPartAt(order,ch,sticky){var found;bidiOther=null;for(var i=0;i<order.length;++i){var cur=order[i];if(cur.from<ch&&cur.to>ch)return i;cur.to==ch&&(cur.from!=cur.to&&"before"==sticky?found=i:bidiOther=i),cur.from==ch&&(cur.from!=cur.to&&"before"!=sticky?found=i:bidiOther=i)}return null!=found?found:bidiOther}function getOrder(line,direction){var order=line.order;return null==order&&(order=line.order=bidiOrdering(line.text,direction)),order}function moveCharLogically(line,ch,dir){var target=skipExtendingChars(line.text,ch+dir,dir);return target<0||target>line.text.length?null:target}function moveLogically(line,start,dir){var ch=moveCharLogically(line,start.ch,dir);return null==ch?null:new Pos(start.line,ch,dir<0?"after":"before")}function endOfLine(visually,cm,lineObj,lineNo,dir){if(visually){var order=getOrder(lineObj,cm.doc.direction);if(order){var ch,part=dir<0?lst(order):order[0],sticky=dir<0==(1==part.level)?"after":"before";if(part.level>0){var prep=prepareMeasureForLine(cm,lineObj);ch=dir<0?lineObj.text.length-1:0;var targetTop=measureCharPrepared(cm,prep,ch).top;ch=findFirst(function(ch){return measureCharPrepared(cm,prep,ch).top==targetTop},dir<0==(1==part.level)?part.from:part.to-1,ch),"before"==sticky&&(ch=moveCharLogically(lineObj,ch,1))}else ch=dir<0?part.to:part.from;return new Pos(lineNo,ch,sticky)}}return new Pos(lineNo,dir<0?lineObj.text.length:0,dir<0?"before":"after")}function moveVisually(cm,line,start,dir){var bidi=getOrder(line,cm.doc.direction);if(!bidi)return moveLogically(line,start,dir);start.ch>=line.text.length?(start.ch=line.text.length,start.sticky="before"):start.ch<=0&&(start.ch=0,start.sticky="after");var partPos=getBidiPartAt(bidi,start.ch,start.sticky),part=bidi[partPos];if("ltr"==cm.doc.direction&&part.level%2==0&&(dir>0?part.to>start.ch:part.from<start.ch))return moveLogically(line,start,dir);var prep,mv=function(pos,dir){return moveCharLogically(line,pos instanceof Pos?pos.ch:pos,dir)},getWrappedLineExtent=function(ch){return cm.options.lineWrapping?(prep=prep||prepareMeasureForLine(cm,line),wrappedLineExtentChar(cm,line,prep,ch)):{begin:0,end:line.text.length}},wrappedLineExtent=getWrappedLineExtent("before"==start.sticky?mv(start,-1):start.ch);if("rtl"==cm.doc.direction||1==part.level){var moveInStorageOrder=1==part.level==dir<0,ch=mv(start,moveInStorageOrder?1:-1);if(null!=ch&&(moveInStorageOrder?ch<=part.to&&ch<=wrappedLineExtent.end:ch>=part.from&&ch>=wrappedLineExtent.begin)){var sticky=moveInStorageOrder?"before":"after";return new Pos(start.line,ch,sticky)}}var searchInVisualLine=function(partPos,dir,wrappedLineExtent){for(var getRes=function(ch,moveInStorageOrder){return moveInStorageOrder?new Pos(start.line,mv(ch,1),"before"):new Pos(start.line,ch,"after")};partPos>=0&&partPos<bidi.length;partPos+=dir){var part=bidi[partPos],moveInStorageOrder=dir>0==(1!=part.level),ch=moveInStorageOrder?wrappedLineExtent.begin:mv(wrappedLineExtent.end,-1);if(part.from<=ch&&ch<part.to)return getRes(ch,moveInStorageOrder);if(ch=moveInStorageOrder?part.from:mv(part.to,-1),wrappedLineExtent.begin<=ch&&ch<wrappedLineExtent.end)return getRes(ch,moveInStorageOrder)}},res=searchInVisualLine(partPos+dir,dir,wrappedLineExtent);if(res)return res;var nextCh=dir>0?wrappedLineExtent.end:mv(wrappedLineExtent.begin,-1);return null==nextCh||dir>0&&nextCh==line.text.length||!(res=searchInVisualLine(dir>0?0:bidi.length-1,dir,getWrappedLineExtent(nextCh)))?null:res}function getHandlers(emitter,type){return emitter._handlers&&emitter._handlers[type]||noHandlers}function off(emitter,type,f){if(emitter.removeEventListener)emitter.removeEventListener(type,f,!1);else if(emitter.detachEvent)emitter.detachEvent("on"+type,f);else{var map$$1=emitter._handlers,arr=map$$1&&map$$1[type];if(arr){var index=indexOf(arr,f);index>-1&&(map$$1[type]=arr.slice(0,index).concat(arr.slice(index+1)))}}}function signal(emitter,type){var handlers=getHandlers(emitter,type);if(handlers.length)for(var args=Array.prototype.slice.call(arguments,2),i=0;i<handlers.length;++i)handlers[i].apply(null,args)}function signalDOMEvent(cm,e,override){return"string"==typeof e&&(e={type:e,preventDefault:function(){this.defaultPrevented=!0}}),signal(cm,override||e.type,cm,e),e_defaultPrevented(e)||e.codemirrorIgnore}function signalCursorActivity(cm){var arr=cm._handlers&&cm._handlers.cursorActivity;if(arr)for(var set=cm.curOp.cursorActivityHandlers||(cm.curOp.cursorActivityHandlers=[]),i=0;i<arr.length;++i)-1==indexOf(set,arr[i])&&set.push(arr[i])}function hasHandler(emitter,type){return getHandlers(emitter,type).length>0}function eventMixin(ctor){ctor.prototype.on=function(type,f){on(this,type,f)},ctor.prototype.off=function(type,f){off(this,type,f)}}function e_preventDefault(e){e.preventDefault?e.preventDefault():e.returnValue=!1}function e_stopPropagation(e){e.stopPropagation?e.stopPropagation():e.cancelBubble=!0}function e_defaultPrevented(e){return null!=e.defaultPrevented?e.defaultPrevented:0==e.returnValue}function e_stop(e){e_preventDefault(e),e_stopPropagation(e)}function e_target(e){return e.target||e.srcElement}function e_button(e){var b=e.which;return null==b&&(1&e.button?b=1:2&e.button?b=3:4&e.button&&(b=2)),mac&&e.ctrlKey&&1==b&&(b=3),b}function zeroWidthElement(measure){if(null==zwspSupported){var test=elt("span","​");removeChildrenAndAdd(measure,elt("span",[test,document.createTextNode("x")])),0!=measure.firstChild.offsetHeight&&(zwspSupported=test.offsetWidth<=1&&test.offsetHeight>2&&!(ie&&ie_version<8))}var node=zwspSupported?elt("span","​"):elt("span"," ",null,"display: inline-block; width: 1px; margin-right: -1px");return node.setAttribute("cm-text",""),node}function hasBadBidiRects(measure){if(null!=badBidiRects)return badBidiRects;var txt=removeChildrenAndAdd(measure,document.createTextNode("AخA")),r0=range(txt,0,1).getBoundingClientRect(),r1=range(txt,1,2).getBoundingClientRect();return removeChildren(measure),!(!r0||r0.left==r0.right)&&(badBidiRects=r1.right-r0.right<3)}function hasBadZoomedRects(measure){if(null!=badZoomedRects)return badZoomedRects;var node=removeChildrenAndAdd(measure,elt("span","x")),normal=node.getBoundingClientRect(),fromRange=range(node,0,1).getBoundingClientRect();return badZoomedRects=Math.abs(normal.left-fromRange.left)>1}function defineMode(name,mode){arguments.length>2&&(mode.dependencies=Array.prototype.slice.call(arguments,2)),modes[name]=mode}function resolveMode(spec){if("string"==typeof spec&&mimeModes.hasOwnProperty(spec))spec=mimeModes[spec];else if(spec&&"string"==typeof spec.name&&mimeModes.hasOwnProperty(spec.name)){var found=mimeModes[spec.name];"string"==typeof found&&(found={name:found}),(spec=createObj(found,spec)).name=found.name}else{if("string"==typeof spec&&/^[\w\-]+\/[\w\-]+\+xml$/.test(spec))return resolveMode("application/xml");if("string"==typeof spec&&/^[\w\-]+\/[\w\-]+\+json$/.test(spec))return resolveMode("application/json")}return"string"==typeof spec?{name:spec}:spec||{name:"null"}}function getMode(options,spec){spec=resolveMode(spec);var mfactory=modes[spec.name];if(!mfactory)return getMode(options,"text/plain");var modeObj=mfactory(options,spec);if(modeExtensions.hasOwnProperty(spec.name)){var exts=modeExtensions[spec.name];for(var prop in exts)exts.hasOwnProperty(prop)&&(modeObj.hasOwnProperty(prop)&&(modeObj["_"+prop]=modeObj[prop]),modeObj[prop]=exts[prop])}if(modeObj.name=spec.name,spec.helperType&&(modeObj.helperType=spec.helperType),spec.modeProps)for(var prop$1 in spec.modeProps)modeObj[prop$1]=spec.modeProps[prop$1];return modeObj}function extendMode(mode,properties){copyObj(properties,modeExtensions.hasOwnProperty(mode)?modeExtensions[mode]:modeExtensions[mode]={})}function copyState(mode,state){if(!0===state)return state;if(mode.copyState)return mode.copyState(state);var nstate={};for(var n in state){var val=state[n];val instanceof Array&&(val=val.concat([])),nstate[n]=val}return nstate}function innerMode(mode,state){for(var info;mode.innerMode&&(info=mode.innerMode(state))&&info.mode!=mode;)state=info.state,mode=info.mode;return info||{mode:mode,state:state}}function startState(mode,a1,a2){return!mode.startState||mode.startState(a1,a2)}function highlightLine(cm,line,context,forceToEnd){var st=[cm.state.modeGen],lineClasses={};runMode(cm,line.text,cm.doc.mode,context,function(end,style){return st.push(end,style)},lineClasses,forceToEnd);for(var state=context.state,o=0;o<cm.state.overlays.length;++o)!function(o){var overlay=cm.state.overlays[o],i=1,at=0;context.state=!0,runMode(cm,line.text,overlay.mode,context,function(end,style){for(var start=i;at<end;){var i_end=st[i];i_end>end&&st.splice(i,1,end,st[i+1],i_end),i+=2,at=Math.min(end,i_end)}if(style)if(overlay.opaque)st.splice(start,i-start,end,"overlay "+style),i=start+2;else for(;start<i;start+=2){var cur=st[start+1];st[start+1]=(cur?cur+" ":"")+"overlay "+style}},lineClasses)}(o);return context.state=state,{styles:st,classes:lineClasses.bgClass||lineClasses.textClass?lineClasses:null}}function getLineStyles(cm,line,updateFrontier){if(!line.styles||line.styles[0]!=cm.state.modeGen){var context=getContextBefore(cm,lineNo(line)),resetState=line.text.length>cm.options.maxHighlightLength&&copyState(cm.doc.mode,context.state),result=highlightLine(cm,line,context);resetState&&(context.state=resetState),line.stateAfter=context.save(!resetState),line.styles=result.styles,result.classes?line.styleClasses=result.classes:line.styleClasses&&(line.styleClasses=null),updateFrontier===cm.doc.highlightFrontier&&(cm.doc.modeFrontier=Math.max(cm.doc.modeFrontier,++cm.doc.highlightFrontier))}return line.styles}function getContextBefore(cm,n,precise){var doc=cm.doc,display=cm.display;if(!doc.mode.startState)return new Context(doc,!0,n);var start=findStartLine(cm,n,precise),saved=start>doc.first&&getLine(doc,start-1).stateAfter,context=saved?Context.fromSaved(doc,saved,start):new Context(doc,startState(doc.mode),start);return doc.iter(start,n,function(line){processLine(cm,line.text,context);var pos=context.line;line.stateAfter=pos==n-1||pos%5==0||pos>=display.viewFrom&&pos<display.viewTo?context.save():null,context.nextLine()}),precise&&(doc.modeFrontier=context.line),context}function processLine(cm,text,context,startAt){var mode=cm.doc.mode,stream=new StringStream(text,cm.options.tabSize,context);for(stream.start=stream.pos=startAt||0,""==text&&callBlankLine(mode,context.state);!stream.eol();)readToken(mode,stream,context.state),stream.start=stream.pos}function callBlankLine(mode,state){if(mode.blankLine)return mode.blankLine(state);if(mode.innerMode){var inner=innerMode(mode,state);return inner.mode.blankLine?inner.mode.blankLine(inner.state):void 0}}function readToken(mode,stream,state,inner){for(var i=0;i<10;i++){inner&&(inner[0]=innerMode(mode,state).mode);var style=mode.token(stream,state);if(stream.pos>stream.start)return style}throw new Error("Mode "+mode.name+" failed to advance stream.")}function takeToken(cm,pos,precise,asArray){var style,tokens,doc=cm.doc,mode=doc.mode,line=getLine(doc,(pos=clipPos(doc,pos)).line),context=getContextBefore(cm,pos.line,precise),stream=new StringStream(line.text,cm.options.tabSize,context);for(asArray&&(tokens=[]);(asArray||stream.pos<pos.ch)&&!stream.eol();)stream.start=stream.pos,style=readToken(mode,stream,context.state),asArray&&tokens.push(new Token(stream,style,copyState(doc.mode,context.state)));return asArray?tokens:new Token(stream,style,context.state)}function extractLineClasses(type,output){if(type)for(;;){var lineClass=type.match(/(?:^|\s+)line-(background-)?(\S+)/);if(!lineClass)break;type=type.slice(0,lineClass.index)+type.slice(lineClass.index+lineClass[0].length);var prop=lineClass[1]?"bgClass":"textClass";null==output[prop]?output[prop]=lineClass[2]:new RegExp("(?:^|s)"+lineClass[2]+"(?:$|s)").test(output[prop])||(output[prop]+=" "+lineClass[2])}return type}function runMode(cm,text,mode,context,f,lineClasses,forceToEnd){var flattenSpans=mode.flattenSpans;null==flattenSpans&&(flattenSpans=cm.options.flattenSpans);var style,curStart=0,curStyle=null,stream=new StringStream(text,cm.options.tabSize,context),inner=cm.options.addModeClass&&[null];for(""==text&&extractLineClasses(callBlankLine(mode,context.state),lineClasses);!stream.eol();){if(stream.pos>cm.options.maxHighlightLength?(flattenSpans=!1,forceToEnd&&processLine(cm,text,context,stream.pos),stream.pos=text.length,style=null):style=extractLineClasses(readToken(mode,stream,context.state,inner),lineClasses),inner){var mName=inner[0].name;mName&&(style="m-"+(style?mName+" "+style:mName))}if(!flattenSpans||curStyle!=style){for(;curStart<stream.start;)f(curStart=Math.min(stream.start,curStart+5e3),curStyle);curStyle=style}stream.start=stream.pos}for(;curStart<stream.pos;){var pos=Math.min(stream.pos,curStart+5e3);f(pos,curStyle),curStart=pos}}function findStartLine(cm,n,precise){for(var minindent,minline,doc=cm.doc,lim=precise?-1:n-(cm.doc.mode.innerMode?1e3:100),search=n;search>lim;--search){if(search<=doc.first)return doc.first;var line=getLine(doc,search-1),after=line.stateAfter;if(after&&(!precise||search+(after instanceof SavedContext?after.lookAhead:0)<=doc.modeFrontier))return search;var indented=countColumn(line.text,null,cm.options.tabSize);(null==minline||minindent>indented)&&(minline=search-1,minindent=indented)}return minline}function retreatFrontier(doc,n){if(doc.modeFrontier=Math.min(doc.modeFrontier,n),!(doc.highlightFrontier<n-10)){for(var start=doc.first,line=n-1;line>start;line--){var saved=getLine(doc,line).stateAfter;if(saved&&(!(saved instanceof SavedContext)||line+saved.lookAhead<n)){start=line+1;break}}doc.highlightFrontier=Math.min(doc.highlightFrontier,start)}}function updateLine(line,text,markedSpans,estimateHeight){line.text=text,line.stateAfter&&(line.stateAfter=null),line.styles&&(line.styles=null),null!=line.order&&(line.order=null),detachMarkedSpans(line),attachMarkedSpans(line,markedSpans);var estHeight=estimateHeight?estimateHeight(line):1;estHeight!=line.height&&updateLineHeight(line,estHeight)}function cleanUpLine(line){line.parent=null,detachMarkedSpans(line)}function interpretTokenStyle(style,options){if(!style||/^\s*$/.test(style))return null;var cache=options.addModeClass?styleToClassCacheWithMode:styleToClassCache;return cache[style]||(cache[style]=style.replace(/\S+/g,"cm-$&"))}function buildLineContent(cm,lineView){var content=eltP("span",null,null,webkit?"padding-right: .1px":null),builder={pre:eltP("pre",[content],"CodeMirror-line"),content:content,col:0,pos:0,cm:cm,trailingSpace:!1,splitSpaces:(ie||webkit)&&cm.getOption("lineWrapping")};lineView.measure={};for(var i=0;i<=(lineView.rest?lineView.rest.length:0);i++){var line=i?lineView.rest[i-1]:lineView.line,order=void 0;builder.pos=0,builder.addToken=buildToken,hasBadBidiRects(cm.display.measure)&&(order=getOrder(line,cm.doc.direction))&&(builder.addToken=buildTokenBadBidi(builder.addToken,order)),builder.map=[],insertLineContent(line,builder,getLineStyles(cm,line,lineView!=cm.display.externalMeasured&&lineNo(line))),line.styleClasses&&(line.styleClasses.bgClass&&(builder.bgClass=joinClasses(line.styleClasses.bgClass,builder.bgClass||"")),line.styleClasses.textClass&&(builder.textClass=joinClasses(line.styleClasses.textClass,builder.textClass||""))),0==builder.map.length&&builder.map.push(0,0,builder.content.appendChild(zeroWidthElement(cm.display.measure))),0==i?(lineView.measure.map=builder.map,lineView.measure.cache={}):((lineView.measure.maps||(lineView.measure.maps=[])).push(builder.map),(lineView.measure.caches||(lineView.measure.caches=[])).push({}))}if(webkit){var last=builder.content.lastChild;(/\bcm-tab\b/.test(last.className)||last.querySelector&&last.querySelector(".cm-tab"))&&(builder.content.className="cm-tab-wrap-hack")}return signal(cm,"renderLine",cm,lineView.line,builder.pre),builder.pre.className&&(builder.textClass=joinClasses(builder.pre.className,builder.textClass||"")),builder}function defaultSpecialCharPlaceholder(ch){var token=elt("span","•","cm-invalidchar");return token.title="\\u"+ch.charCodeAt(0).toString(16),token.setAttribute("aria-label",token.title),token}function buildToken(builder,text,style,startStyle,endStyle,title,css){if(text){var content,displayText=builder.splitSpaces?splitSpaces(text,builder.trailingSpace):text,special=builder.cm.state.specialChars,mustWrap=!1;if(special.test(text)){content=document.createDocumentFragment();for(var pos=0;;){special.lastIndex=pos;var m=special.exec(text),skipped=m?m.index-pos:text.length-pos;if(skipped){var txt=document.createTextNode(displayText.slice(pos,pos+skipped));ie&&ie_version<9?content.appendChild(elt("span",[txt])):content.appendChild(txt),builder.map.push(builder.pos,builder.pos+skipped,txt),builder.col+=skipped,builder.pos+=skipped}if(!m)break;pos+=skipped+1;var txt$1=void 0;if("\t"==m[0]){var tabSize=builder.cm.options.tabSize,tabWidth=tabSize-builder.col%tabSize;(txt$1=content.appendChild(elt("span",spaceStr(tabWidth),"cm-tab"))).setAttribute("role","presentation"),txt$1.setAttribute("cm-text","\t"),builder.col+=tabWidth}else"\r"==m[0]||"\n"==m[0]?((txt$1=content.appendChild(elt("span","\r"==m[0]?"␍":"␤","cm-invalidchar"))).setAttribute("cm-text",m[0]),builder.col+=1):((txt$1=builder.cm.options.specialCharPlaceholder(m[0])).setAttribute("cm-text",m[0]),ie&&ie_version<9?content.appendChild(elt("span",[txt$1])):content.appendChild(txt$1),builder.col+=1);builder.map.push(builder.pos,builder.pos+1,txt$1),builder.pos++}}else builder.col+=text.length,content=document.createTextNode(displayText),builder.map.push(builder.pos,builder.pos+text.length,content),ie&&ie_version<9&&(mustWrap=!0),builder.pos+=text.length;if(builder.trailingSpace=32==displayText.charCodeAt(text.length-1),style||startStyle||endStyle||mustWrap||css){var fullStyle=style||"";startStyle&&(fullStyle+=startStyle),endStyle&&(fullStyle+=endStyle);var token=elt("span",[content],fullStyle,css);return title&&(token.title=title),builder.content.appendChild(token)}builder.content.appendChild(content)}}function splitSpaces(text,trailingBefore){if(text.length>1&&!/  /.test(text))return text;for(var spaceBefore=trailingBefore,result="",i=0;i<text.length;i++){var ch=text.charAt(i);" "!=ch||!spaceBefore||i!=text.length-1&&32!=text.charCodeAt(i+1)||(ch=" "),result+=ch,spaceBefore=" "==ch}return result}function buildTokenBadBidi(inner,order){return function(builder,text,style,startStyle,endStyle,title,css){style=style?style+" cm-force-border":"cm-force-border";for(var start=builder.pos,end=start+text.length;;){for(var part=void 0,i=0;i<order.length&&!((part=order[i]).to>start&&part.from<=start);i++);if(part.to>=end)return inner(builder,text,style,startStyle,endStyle,title,css);inner(builder,text.slice(0,part.to-start),style,startStyle,null,title,css),startStyle=null,text=text.slice(part.to-start),start=part.to}}}function buildCollapsedSpan(builder,size,marker,ignoreWidget){var widget=!ignoreWidget&&marker.widgetNode;widget&&builder.map.push(builder.pos,builder.pos+size,widget),!ignoreWidget&&builder.cm.display.input.needsContentAttribute&&(widget||(widget=builder.content.appendChild(document.createElement("span"))),widget.setAttribute("cm-marker",marker.id)),widget&&(builder.cm.display.input.setUneditable(widget),builder.content.appendChild(widget)),builder.pos+=size,builder.trailingSpace=!1}function insertLineContent(line,builder,styles){var spans=line.markedSpans,allText=line.text,at=0;if(spans)for(var style,css,spanStyle,spanEndStyle,spanStartStyle,title,collapsed,len=allText.length,pos=0,i=1,text="",nextChange=0;;){if(nextChange==pos){spanStyle=spanEndStyle=spanStartStyle=title=css="",collapsed=null,nextChange=1/0;for(var foundBookmarks=[],endStyles=void 0,j=0;j<spans.length;++j){var sp=spans[j],m=sp.marker;"bookmark"==m.type&&sp.from==pos&&m.widgetNode?foundBookmarks.push(m):sp.from<=pos&&(null==sp.to||sp.to>pos||m.collapsed&&sp.to==pos&&sp.from==pos)?(null!=sp.to&&sp.to!=pos&&nextChange>sp.to&&(nextChange=sp.to,spanEndStyle=""),m.className&&(spanStyle+=" "+m.className),m.css&&(css=(css?css+";":"")+m.css),m.startStyle&&sp.from==pos&&(spanStartStyle+=" "+m.startStyle),m.endStyle&&sp.to==nextChange&&(endStyles||(endStyles=[])).push(m.endStyle,sp.to),m.title&&!title&&(title=m.title),m.collapsed&&(!collapsed||compareCollapsedMarkers(collapsed.marker,m)<0)&&(collapsed=sp)):sp.from>pos&&nextChange>sp.from&&(nextChange=sp.from)}if(endStyles)for(var j$1=0;j$1<endStyles.length;j$1+=2)endStyles[j$1+1]==nextChange&&(spanEndStyle+=" "+endStyles[j$1]);if(!collapsed||collapsed.from==pos)for(var j$2=0;j$2<foundBookmarks.length;++j$2)buildCollapsedSpan(builder,0,foundBookmarks[j$2]);if(collapsed&&(collapsed.from||0)==pos){if(buildCollapsedSpan(builder,(null==collapsed.to?len+1:collapsed.to)-pos,collapsed.marker,null==collapsed.from),null==collapsed.to)return;collapsed.to==pos&&(collapsed=!1)}}if(pos>=len)break;for(var upto=Math.min(len,nextChange);;){if(text){var end=pos+text.length;if(!collapsed){var tokenText=end>upto?text.slice(0,upto-pos):text;builder.addToken(builder,tokenText,style?style+spanStyle:spanStyle,spanStartStyle,pos+tokenText.length==nextChange?spanEndStyle:"",title,css)}if(end>=upto){text=text.slice(upto-pos),pos=upto;break}pos=end,spanStartStyle=""}text=allText.slice(at,at=styles[i++]),style=interpretTokenStyle(styles[i++],builder.cm.options)}}else for(var i$1=1;i$1<styles.length;i$1+=2)builder.addToken(builder,allText.slice(at,at=styles[i$1]),interpretTokenStyle(styles[i$1+1],builder.cm.options))}function LineView(doc,line,lineN){this.line=line,this.rest=visualLineContinued(line),this.size=this.rest?lineNo(lst(this.rest))-lineN+1:1,this.node=this.text=null,this.hidden=lineIsHidden(doc,line)}function buildViewArray(cm,from,to){for(var nextPos,array=[],pos=from;pos<to;pos=nextPos){var view=new LineView(cm.doc,getLine(cm.doc,pos),pos);nextPos=pos+view.size,array.push(view)}return array}function pushOperation(op){operationGroup?operationGroup.ops.push(op):op.ownsGroup=operationGroup={ops:[op],delayedCallbacks:[]}}function fireCallbacksForOps(group){var callbacks=group.delayedCallbacks,i=0;do{for(;i<callbacks.length;i++)callbacks[i].call(null);for(var j=0;j<group.ops.length;j++){var op=group.ops[j];if(op.cursorActivityHandlers)for(;op.cursorActivityCalled<op.cursorActivityHandlers.length;)op.cursorActivityHandlers[op.cursorActivityCalled++].call(null,op.cm)}}while(i<callbacks.length)}function finishOperation(op,endCb){var group=op.ownsGroup;if(group)try{fireCallbacksForOps(group)}finally{operationGroup=null,endCb(group)}}function signalLater(emitter,type){var arr=getHandlers(emitter,type);if(arr.length){var list,args=Array.prototype.slice.call(arguments,2);operationGroup?list=operationGroup.delayedCallbacks:orphanDelayedCallbacks?list=orphanDelayedCallbacks:(list=orphanDelayedCallbacks=[],setTimeout(fireOrphanDelayed,0));for(var i=0;i<arr.length;++i)!function(i){list.push(function(){return arr[i].apply(null,args)})}(i)}}function fireOrphanDelayed(){var delayed=orphanDelayedCallbacks;orphanDelayedCallbacks=null;for(var i=0;i<delayed.length;++i)delayed[i]()}function updateLineForChanges(cm,lineView,lineN,dims){for(var j=0;j<lineView.changes.length;j++){var type=lineView.changes[j];"text"==type?updateLineText(cm,lineView):"gutter"==type?updateLineGutter(cm,lineView,lineN,dims):"class"==type?updateLineClasses(cm,lineView):"widget"==type&&updateLineWidgets(cm,lineView,dims)}lineView.changes=null}function ensureLineWrapped(lineView){return lineView.node==lineView.text&&(lineView.node=elt("div",null,null,"position: relative"),lineView.text.parentNode&&lineView.text.parentNode.replaceChild(lineView.node,lineView.text),lineView.node.appendChild(lineView.text),ie&&ie_version<8&&(lineView.node.style.zIndex=2)),lineView.node}function updateLineBackground(cm,lineView){var cls=lineView.bgClass?lineView.bgClass+" "+(lineView.line.bgClass||""):lineView.line.bgClass;if(cls&&(cls+=" CodeMirror-linebackground"),lineView.background)cls?lineView.background.className=cls:(lineView.background.parentNode.removeChild(lineView.background),lineView.background=null);else if(cls){var wrap=ensureLineWrapped(lineView);lineView.background=wrap.insertBefore(elt("div",null,cls),wrap.firstChild),cm.display.input.setUneditable(lineView.background)}}function getLineContent(cm,lineView){var ext=cm.display.externalMeasured;return ext&&ext.line==lineView.line?(cm.display.externalMeasured=null,lineView.measure=ext.measure,ext.built):buildLineContent(cm,lineView)}function updateLineText(cm,lineView){var cls=lineView.text.className,built=getLineContent(cm,lineView);lineView.text==lineView.node&&(lineView.node=built.pre),lineView.text.parentNode.replaceChild(built.pre,lineView.text),lineView.text=built.pre,built.bgClass!=lineView.bgClass||built.textClass!=lineView.textClass?(lineView.bgClass=built.bgClass,lineView.textClass=built.textClass,updateLineClasses(cm,lineView)):cls&&(lineView.text.className=cls)}function updateLineClasses(cm,lineView){updateLineBackground(cm,lineView),lineView.line.wrapClass?ensureLineWrapped(lineView).className=lineView.line.wrapClass:lineView.node!=lineView.text&&(lineView.node.className="");var textClass=lineView.textClass?lineView.textClass+" "+(lineView.line.textClass||""):lineView.line.textClass;lineView.text.className=textClass||""}function updateLineGutter(cm,lineView,lineN,dims){if(lineView.gutter&&(lineView.node.removeChild(lineView.gutter),lineView.gutter=null),lineView.gutterBackground&&(lineView.node.removeChild(lineView.gutterBackground),lineView.gutterBackground=null),lineView.line.gutterClass){var wrap=ensureLineWrapped(lineView);lineView.gutterBackground=elt("div",null,"CodeMirror-gutter-background "+lineView.line.gutterClass,"left: "+(cm.options.fixedGutter?dims.fixedPos:-dims.gutterTotalWidth)+"px; width: "+dims.gutterTotalWidth+"px"),cm.display.input.setUneditable(lineView.gutterBackground),wrap.insertBefore(lineView.gutterBackground,lineView.text)}var markers=lineView.line.gutterMarkers;if(cm.options.lineNumbers||markers){var wrap$1=ensureLineWrapped(lineView),gutterWrap=lineView.gutter=elt("div",null,"CodeMirror-gutter-wrapper","left: "+(cm.options.fixedGutter?dims.fixedPos:-dims.gutterTotalWidth)+"px");if(cm.display.input.setUneditable(gutterWrap),wrap$1.insertBefore(gutterWrap,lineView.text),lineView.line.gutterClass&&(gutterWrap.className+=" "+lineView.line.gutterClass),!cm.options.lineNumbers||markers&&markers["CodeMirror-linenumbers"]||(lineView.lineNumber=gutterWrap.appendChild(elt("div",lineNumberFor(cm.options,lineN),"CodeMirror-linenumber CodeMirror-gutter-elt","left: "+dims.gutterLeft["CodeMirror-linenumbers"]+"px; width: "+cm.display.lineNumInnerWidth+"px"))),markers)for(var k=0;k<cm.options.gutters.length;++k){var id=cm.options.gutters[k],found=markers.hasOwnProperty(id)&&markers[id];found&&gutterWrap.appendChild(elt("div",[found],"CodeMirror-gutter-elt","left: "+dims.gutterLeft[id]+"px; width: "+dims.gutterWidth[id]+"px"))}}}function updateLineWidgets(cm,lineView,dims){lineView.alignable&&(lineView.alignable=null);for(var node=lineView.node.firstChild,next=void 0;node;node=next)next=node.nextSibling,"CodeMirror-linewidget"==node.className&&lineView.node.removeChild(node);insertLineWidgets(cm,lineView,dims)}function buildLineElement(cm,lineView,lineN,dims){var built=getLineContent(cm,lineView);return lineView.text=lineView.node=built.pre,built.bgClass&&(lineView.bgClass=built.bgClass),built.textClass&&(lineView.textClass=built.textClass),updateLineClasses(cm,lineView),updateLineGutter(cm,lineView,lineN,dims),insertLineWidgets(cm,lineView,dims),lineView.node}function insertLineWidgets(cm,lineView,dims){if(insertLineWidgetsFor(cm,lineView.line,lineView,dims,!0),lineView.rest)for(var i=0;i<lineView.rest.length;i++)insertLineWidgetsFor(cm,lineView.rest[i],lineView,dims,!1)}function insertLineWidgetsFor(cm,line,lineView,dims,allowAbove){if(line.widgets)for(var wrap=ensureLineWrapped(lineView),i=0,ws=line.widgets;i<ws.length;++i){var widget=ws[i],node=elt("div",[widget.node],"CodeMirror-linewidget");widget.handleMouseEvents||node.setAttribute("cm-ignore-events","true"),positionLineWidget(widget,node,lineView,dims),cm.display.input.setUneditable(node),allowAbove&&widget.above?wrap.insertBefore(node,lineView.gutter||lineView.text):wrap.appendChild(node),signalLater(widget,"redraw")}}function positionLineWidget(widget,node,lineView,dims){if(widget.noHScroll){(lineView.alignable||(lineView.alignable=[])).push(node);var width=dims.wrapperWidth;node.style.left=dims.fixedPos+"px",widget.coverGutter||(width-=dims.gutterTotalWidth,node.style.paddingLeft=dims.gutterTotalWidth+"px"),node.style.width=width+"px"}widget.coverGutter&&(node.style.zIndex=5,node.style.position="relative",widget.noHScroll||(node.style.marginLeft=-dims.gutterTotalWidth+"px"))}function widgetHeight(widget){if(null!=widget.height)return widget.height;var cm=widget.doc.cm;if(!cm)return 0;if(!contains(document.body,widget.node)){var parentStyle="position: relative;";widget.coverGutter&&(parentStyle+="margin-left: -"+cm.display.gutters.offsetWidth+"px;"),widget.noHScroll&&(parentStyle+="width: "+cm.display.wrapper.clientWidth+"px;"),removeChildrenAndAdd(cm.display.measure,elt("div",[widget.node],null,parentStyle))}return widget.height=widget.node.parentNode.offsetHeight}function eventInWidget(display,e){for(var n=e_target(e);n!=display.wrapper;n=n.parentNode)if(!n||1==n.nodeType&&"true"==n.getAttribute("cm-ignore-events")||n.parentNode==display.sizer&&n!=display.mover)return!0}function paddingTop(display){return display.lineSpace.offsetTop}function paddingVert(display){return display.mover.offsetHeight-display.lineSpace.offsetHeight}function paddingH(display){if(display.cachedPaddingH)return display.cachedPaddingH;var e=removeChildrenAndAdd(display.measure,elt("pre","x")),style=window.getComputedStyle?window.getComputedStyle(e):e.currentStyle,data={left:parseInt(style.paddingLeft),right:parseInt(style.paddingRight)};return isNaN(data.left)||isNaN(data.right)||(display.cachedPaddingH=data),data}function scrollGap(cm){return scrollerGap-cm.display.nativeBarWidth}function displayWidth(cm){return cm.display.scroller.clientWidth-scrollGap(cm)-cm.display.barWidth}function displayHeight(cm){return cm.display.scroller.clientHeight-scrollGap(cm)-cm.display.barHeight}function ensureLineHeights(cm,lineView,rect){var wrapping=cm.options.lineWrapping,curWidth=wrapping&&displayWidth(cm);if(!lineView.measure.heights||wrapping&&lineView.measure.width!=curWidth){var heights=lineView.measure.heights=[];if(wrapping){lineView.measure.width=curWidth;for(var rects=lineView.text.firstChild.getClientRects(),i=0;i<rects.length-1;i++){var cur=rects[i],next=rects[i+1];Math.abs(cur.bottom-next.bottom)>2&&heights.push((cur.bottom+next.top)/2-rect.top)}}heights.push(rect.bottom-rect.top)}}function mapFromLineView(lineView,line,lineN){if(lineView.line==line)return{map:lineView.measure.map,cache:lineView.measure.cache};for(var i=0;i<lineView.rest.length;i++)if(lineView.rest[i]==line)return{map:lineView.measure.maps[i],cache:lineView.measure.caches[i]};for(var i$1=0;i$1<lineView.rest.length;i$1++)if(lineNo(lineView.rest[i$1])>lineN)return{map:lineView.measure.maps[i$1],cache:lineView.measure.caches[i$1],before:!0}}function updateExternalMeasurement(cm,line){var lineN=lineNo(line=visualLine(line)),view=cm.display.externalMeasured=new LineView(cm.doc,line,lineN);view.lineN=lineN;var built=view.built=buildLineContent(cm,view);return view.text=built.pre,removeChildrenAndAdd(cm.display.lineMeasure,built.pre),view}function measureChar(cm,line,ch,bias){return measureCharPrepared(cm,prepareMeasureForLine(cm,line),ch,bias)}function findViewForLine(cm,lineN){if(lineN>=cm.display.viewFrom&&lineN<cm.display.viewTo)return cm.display.view[findViewIndex(cm,lineN)];var ext=cm.display.externalMeasured;return ext&&lineN>=ext.lineN&&lineN<ext.lineN+ext.size?ext:void 0}function prepareMeasureForLine(cm,line){var lineN=lineNo(line),view=findViewForLine(cm,lineN);view&&!view.text?view=null:view&&view.changes&&(updateLineForChanges(cm,view,lineN,getDimensions(cm)),cm.curOp.forceUpdate=!0),view||(view=updateExternalMeasurement(cm,line));var info=mapFromLineView(view,line,lineN);return{line:line,view:view,rect:null,map:info.map,cache:info.cache,before:info.before,hasHeights:!1}}function measureCharPrepared(cm,prepared,ch,bias,varHeight){prepared.before&&(ch=-1);var found,key=ch+(bias||"");return prepared.cache.hasOwnProperty(key)?found=prepared.cache[key]:(prepared.rect||(prepared.rect=prepared.view.text.getBoundingClientRect()),prepared.hasHeights||(ensureLineHeights(cm,prepared.view,prepared.rect),prepared.hasHeights=!0),(found=measureCharInner(cm,prepared,ch,bias)).bogus||(prepared.cache[key]=found)),{left:found.left,right:found.right,top:varHeight?found.rtop:found.top,bottom:varHeight?found.rbottom:found.bottom}}function nodeAndOffsetInLineMap(map$$1,ch,bias){for(var node,start,end,collapse,mStart,mEnd,i=0;i<map$$1.length;i+=3)if(mStart=map$$1[i],mEnd=map$$1[i+1],ch<mStart?(start=0,end=1,collapse="left"):ch<mEnd?end=(start=ch-mStart)+1:(i==map$$1.length-3||ch==mEnd&&map$$1[i+3]>ch)&&(start=(end=mEnd-mStart)-1,ch>=mEnd&&(collapse="right")),null!=start){if(node=map$$1[i+2],mStart==mEnd&&bias==(node.insertLeft?"left":"right")&&(collapse=bias),"left"==bias&&0==start)for(;i&&map$$1[i-2]==map$$1[i-3]&&map$$1[i-1].insertLeft;)node=map$$1[2+(i-=3)],collapse="left";if("right"==bias&&start==mEnd-mStart)for(;i<map$$1.length-3&&map$$1[i+3]==map$$1[i+4]&&!map$$1[i+5].insertLeft;)node=map$$1[(i+=3)+2],collapse="right";break}return{node:node,start:start,end:end,collapse:collapse,coverStart:mStart,coverEnd:mEnd}}function getUsefulRect(rects,bias){var rect=nullRect;if("left"==bias)for(var i=0;i<rects.length&&(rect=rects[i]).left==rect.right;i++);else for(var i$1=rects.length-1;i$1>=0&&(rect=rects[i$1]).left==rect.right;i$1--);return rect}function measureCharInner(cm,prepared,ch,bias){var rect,place=nodeAndOffsetInLineMap(prepared.map,ch,bias),node=place.node,start=place.start,end=place.end,collapse=place.collapse;if(3==node.nodeType){for(var i$1=0;i$1<4;i$1++){for(;start&&isExtendingChar(prepared.line.text.charAt(place.coverStart+start));)--start;for(;place.coverStart+end<place.coverEnd&&isExtendingChar(prepared.line.text.charAt(place.coverStart+end));)++end;if((rect=ie&&ie_version<9&&0==start&&end==place.coverEnd-place.coverStart?node.parentNode.getBoundingClientRect():getUsefulRect(range(node,start,end).getClientRects(),bias)).left||rect.right||0==start)break;end=start,start-=1,collapse="right"}ie&&ie_version<11&&(rect=maybeUpdateRectForZooming(cm.display.measure,rect))}else{start>0&&(collapse=bias="right");var rects;rect=cm.options.lineWrapping&&(rects=node.getClientRects()).length>1?rects["right"==bias?rects.length-1:0]:node.getBoundingClientRect()}if(ie&&ie_version<9&&!start&&(!rect||!rect.left&&!rect.right)){var rSpan=node.parentNode.getClientRects()[0];rect=rSpan?{left:rSpan.left,right:rSpan.left+charWidth(cm.display),top:rSpan.top,bottom:rSpan.bottom}:nullRect}for(var rtop=rect.top-prepared.rect.top,rbot=rect.bottom-prepared.rect.top,mid=(rtop+rbot)/2,heights=prepared.view.measure.heights,i=0;i<heights.length-1&&!(mid<heights[i]);i++);var top=i?heights[i-1]:0,bot=heights[i],result={left:("right"==collapse?rect.right:rect.left)-prepared.rect.left,right:("left"==collapse?rect.left:rect.right)-prepared.rect.left,top:top,bottom:bot};return rect.left||rect.right||(result.bogus=!0),cm.options.singleCursorHeightPerLine||(result.rtop=rtop,result.rbottom=rbot),result}function maybeUpdateRectForZooming(measure,rect){if(!window.screen||null==screen.logicalXDPI||screen.logicalXDPI==screen.deviceXDPI||!hasBadZoomedRects(measure))return rect;var scaleX=screen.logicalXDPI/screen.deviceXDPI,scaleY=screen.logicalYDPI/screen.deviceYDPI;return{left:rect.left*scaleX,right:rect.right*scaleX,top:rect.top*scaleY,bottom:rect.bottom*scaleY}}function clearLineMeasurementCacheFor(lineView){if(lineView.measure&&(lineView.measure.cache={},lineView.measure.heights=null,lineView.rest))for(var i=0;i<lineView.rest.length;i++)lineView.measure.caches[i]={}}function clearLineMeasurementCache(cm){cm.display.externalMeasure=null,removeChildren(cm.display.lineMeasure);for(var i=0;i<cm.display.view.length;i++)clearLineMeasurementCacheFor(cm.display.view[i])}function clearCaches(cm){clearLineMeasurementCache(cm),cm.display.cachedCharWidth=cm.display.cachedTextHeight=cm.display.cachedPaddingH=null,cm.options.lineWrapping||(cm.display.maxLineChanged=!0),cm.display.lineNumChars=null}function pageScrollX(){return chrome&&android?-(document.body.getBoundingClientRect().left-parseInt(getComputedStyle(document.body).marginLeft)):window.pageXOffset||(document.documentElement||document.body).scrollLeft}function pageScrollY(){return chrome&&android?-(document.body.getBoundingClientRect().top-parseInt(getComputedStyle(document.body).marginTop)):window.pageYOffset||(document.documentElement||document.body).scrollTop}function intoCoordSystem(cm,lineObj,rect,context,includeWidgets){if(!includeWidgets&&lineObj.widgets)for(var i=0;i<lineObj.widgets.length;++i)if(lineObj.widgets[i].above){var size=widgetHeight(lineObj.widgets[i]);rect.top+=size,rect.bottom+=size}if("line"==context)return rect;context||(context="local");var yOff=heightAtLine(lineObj);if("local"==context?yOff+=paddingTop(cm.display):yOff-=cm.display.viewOffset,"page"==context||"window"==context){var lOff=cm.display.lineSpace.getBoundingClientRect();yOff+=lOff.top+("window"==context?0:pageScrollY());var xOff=lOff.left+("window"==context?0:pageScrollX());rect.left+=xOff,rect.right+=xOff}return rect.top+=yOff,rect.bottom+=yOff,rect}function fromCoordSystem(cm,coords,context){if("div"==context)return coords;var left=coords.left,top=coords.top;if("page"==context)left-=pageScrollX(),top-=pageScrollY();else if("local"==context||!context){var localBox=cm.display.sizer.getBoundingClientRect();left+=localBox.left,top+=localBox.top}var lineSpaceBox=cm.display.lineSpace.getBoundingClientRect();return{left:left-lineSpaceBox.left,top:top-lineSpaceBox.top}}function charCoords(cm,pos,context,lineObj,bias){return lineObj||(lineObj=getLine(cm.doc,pos.line)),intoCoordSystem(cm,lineObj,measureChar(cm,lineObj,pos.ch,bias),context)}function cursorCoords(cm,pos,context,lineObj,preparedMeasure,varHeight){function get(ch,right){var m=measureCharPrepared(cm,preparedMeasure,ch,right?"right":"left",varHeight);return right?m.left=m.right:m.right=m.left,intoCoordSystem(cm,lineObj,m,context)}function getBidi(ch,partPos,invert){var right=order[partPos].level%2!=0;return get(invert?ch-1:ch,right!=invert)}lineObj=lineObj||getLine(cm.doc,pos.line),preparedMeasure||(preparedMeasure=prepareMeasureForLine(cm,lineObj));var order=getOrder(lineObj,cm.doc.direction),ch=pos.ch,sticky=pos.sticky;if(ch>=lineObj.text.length?(ch=lineObj.text.length,sticky="before"):ch<=0&&(ch=0,sticky="after"),!order)return get("before"==sticky?ch-1:ch,"before"==sticky);var partPos=getBidiPartAt(order,ch,sticky),other=bidiOther,val=getBidi(ch,partPos,"before"==sticky);return null!=other&&(val.other=getBidi(ch,other,"before"!=sticky)),val}function estimateCoords(cm,pos){var left=0;pos=clipPos(cm.doc,pos),cm.options.lineWrapping||(left=charWidth(cm.display)*pos.ch);var lineObj=getLine(cm.doc,pos.line),top=heightAtLine(lineObj)+paddingTop(cm.display);return{left:left,right:left,top:top,bottom:top+lineObj.height}}function PosWithInfo(line,ch,sticky,outside,xRel){var pos=Pos(line,ch,sticky);return pos.xRel=xRel,outside&&(pos.outside=!0),pos}function coordsChar(cm,x,y){var doc=cm.doc;if((y+=cm.display.viewOffset)<0)return PosWithInfo(doc.first,0,null,!0,-1);var lineN=lineAtHeight(doc,y),last=doc.first+doc.size-1;if(lineN>last)return PosWithInfo(doc.first+doc.size-1,getLine(doc,last).text.length,null,!0,1);x<0&&(x=0);for(var lineObj=getLine(doc,lineN);;){var found=coordsCharInner(cm,lineObj,lineN,x,y),merged=collapsedSpanAtEnd(lineObj),mergedPos=merged&&merged.find(0,!0);if(!merged||!(found.ch>mergedPos.from.ch||found.ch==mergedPos.from.ch&&found.xRel>0))return found;lineN=lineNo(lineObj=mergedPos.to.line)}}function wrappedLineExtent(cm,lineObj,preparedMeasure,y){var measure=function(ch){return intoCoordSystem(cm,lineObj,measureCharPrepared(cm,preparedMeasure,ch),"line")},end=lineObj.text.length,begin=findFirst(function(ch){return measure(ch-1).bottom<=y},end,0);return end=findFirst(function(ch){return measure(ch).top>y},begin,end),{begin:begin,end:end}}function wrappedLineExtentChar(cm,lineObj,preparedMeasure,target){return wrappedLineExtent(cm,lineObj,preparedMeasure,intoCoordSystem(cm,lineObj,measureCharPrepared(cm,preparedMeasure,target),"line").top)}function coordsCharInner(cm,lineObj,lineNo$$1,x,y){y-=heightAtLine(lineObj);var pos,begin=0,end=lineObj.text.length,preparedMeasure=prepareMeasureForLine(cm,lineObj);if(getOrder(lineObj,cm.doc.direction)){if(cm.options.lineWrapping){var assign;begin=(assign=wrappedLineExtent(cm,lineObj,preparedMeasure,y)).begin,end=assign.end}pos=new Pos(lineNo$$1,Math.floor(begin+(end-begin)/2));var prevDiff,prevPos,beginLeft=cursorCoords(cm,pos,"line",lineObj,preparedMeasure).left,dir=beginLeft<x?1:-1,diff=beginLeft-x,steps=Math.ceil((end-begin)/4);outer:do{prevDiff=diff,prevPos=pos;for(var i=0;i<steps;++i){var prevPos$1=pos;if(null==(pos=moveVisually(cm,lineObj,pos,dir))||pos.ch<begin||end<=("before"==pos.sticky?pos.ch-1:pos.ch)){pos=prevPos$1;break outer}}if(diff=cursorCoords(cm,pos,"line",lineObj,preparedMeasure).left-x,steps>1){var diff_change_per_step=Math.abs(diff-prevDiff)/steps;steps=Math.min(steps,Math.ceil(Math.abs(diff)/diff_change_per_step)),dir=diff<0?1:-1}}while(0!=diff&&(steps>1||dir<0!=diff<0&&Math.abs(diff)<=Math.abs(prevDiff)));if(Math.abs(diff)>Math.abs(prevDiff)){if(diff<0==prevDiff<0)throw new Error("Broke out of infinite loop in coordsCharInner");pos=prevPos}}else{var ch=findFirst(function(ch){var box=intoCoordSystem(cm,lineObj,measureCharPrepared(cm,preparedMeasure,ch),"line");return box.top>y?(end=Math.min(ch,end),!0):!(box.bottom<=y)&&(box.left>x||!(box.right<x)&&x-box.left<box.right-x)},begin,end);pos=new Pos(lineNo$$1,ch=skipExtendingChars(lineObj.text,ch,1),ch==end?"before":"after")}var coords=cursorCoords(cm,pos,"line",lineObj,preparedMeasure);return(y<coords.top||coords.bottom<y)&&(pos.outside=!0),pos.xRel=x<coords.left?-1:x>coords.right?1:0,pos}function textHeight(display){if(null!=display.cachedTextHeight)return display.cachedTextHeight;if(null==measureText){measureText=elt("pre");for(var i=0;i<49;++i)measureText.appendChild(document.createTextNode("x")),measureText.appendChild(elt("br"));measureText.appendChild(document.createTextNode("x"))}removeChildrenAndAdd(display.measure,measureText);var height=measureText.offsetHeight/50;return height>3&&(display.cachedTextHeight=height),removeChildren(display.measure),height||1}function charWidth(display){if(null!=display.cachedCharWidth)return display.cachedCharWidth;var anchor=elt("span","xxxxxxxxxx"),pre=elt("pre",[anchor]);removeChildrenAndAdd(display.measure,pre);var rect=anchor.getBoundingClientRect(),width=(rect.right-rect.left)/10;return width>2&&(display.cachedCharWidth=width),width||10}function getDimensions(cm){for(var d=cm.display,left={},width={},gutterLeft=d.gutters.clientLeft,n=d.gutters.firstChild,i=0;n;n=n.nextSibling,++i)left[cm.options.gutters[i]]=n.offsetLeft+n.clientLeft+gutterLeft,width[cm.options.gutters[i]]=n.clientWidth;return{fixedPos:compensateForHScroll(d),gutterTotalWidth:d.gutters.offsetWidth,gutterLeft:left,gutterWidth:width,wrapperWidth:d.wrapper.clientWidth}}function compensateForHScroll(display){return display.scroller.getBoundingClientRect().left-display.sizer.getBoundingClientRect().left}function estimateHeight(cm){var th=textHeight(cm.display),wrapping=cm.options.lineWrapping,perLine=wrapping&&Math.max(5,cm.display.scroller.clientWidth/charWidth(cm.display)-3);return function(line){if(lineIsHidden(cm.doc,line))return 0;var widgetsHeight=0;if(line.widgets)for(var i=0;i<line.widgets.length;i++)line.widgets[i].height&&(widgetsHeight+=line.widgets[i].height);return wrapping?widgetsHeight+(Math.ceil(line.text.length/perLine)||1)*th:widgetsHeight+th}}function estimateLineHeights(cm){var doc=cm.doc,est=estimateHeight(cm);doc.iter(function(line){var estHeight=est(line);estHeight!=line.height&&updateLineHeight(line,estHeight)})}function posFromMouse(cm,e,liberal,forRect){var display=cm.display;if(!liberal&&"true"==e_target(e).getAttribute("cm-not-content"))return null;var x,y,space=display.lineSpace.getBoundingClientRect();try{x=e.clientX-space.left,y=e.clientY-space.top}catch(e){return null}var line,coords=coordsChar(cm,x,y);if(forRect&&1==coords.xRel&&(line=getLine(cm.doc,coords.line).text).length==coords.ch){var colDiff=countColumn(line,line.length,cm.options.tabSize)-line.length;coords=Pos(coords.line,Math.max(0,Math.round((x-paddingH(cm.display).left)/charWidth(cm.display))-colDiff))}return coords}function findViewIndex(cm,n){if(n>=cm.display.viewTo)return null;if((n-=cm.display.viewFrom)<0)return null;for(var view=cm.display.view,i=0;i<view.length;i++)if((n-=view[i].size)<0)return i}function updateSelection(cm){cm.display.input.showSelection(cm.display.input.prepareSelection())}function prepareSelection(cm,primary){for(var doc=cm.doc,result={},curFragment=result.cursors=document.createDocumentFragment(),selFragment=result.selection=document.createDocumentFragment(),i=0;i<doc.sel.ranges.length;i++)if(!1!==primary||i!=doc.sel.primIndex){var range$$1=doc.sel.ranges[i];if(!(range$$1.from().line>=cm.display.viewTo||range$$1.to().line<cm.display.viewFrom)){var collapsed=range$$1.empty();(collapsed||cm.options.showCursorWhenSelecting)&&drawSelectionCursor(cm,range$$1.head,curFragment),collapsed||drawSelectionRange(cm,range$$1,selFragment)}}return result}function drawSelectionCursor(cm,head,output){var pos=cursorCoords(cm,head,"div",null,null,!cm.options.singleCursorHeightPerLine),cursor=output.appendChild(elt("div"," ","CodeMirror-cursor"));if(cursor.style.left=pos.left+"px",cursor.style.top=pos.top+"px",cursor.style.height=Math.max(0,pos.bottom-pos.top)*cm.options.cursorHeight+"px",pos.other){var otherCursor=output.appendChild(elt("div"," ","CodeMirror-cursor CodeMirror-secondarycursor"));otherCursor.style.display="",otherCursor.style.left=pos.other.left+"px",otherCursor.style.top=pos.other.top+"px",otherCursor.style.height=.85*(pos.other.bottom-pos.other.top)+"px"}}function drawSelectionRange(cm,range$$1,output){function add(left,top,width,bottom){top<0&&(top=0),top=Math.round(top),bottom=Math.round(bottom),fragment.appendChild(elt("div",null,"CodeMirror-selected","position: absolute; left: "+left+"px;\n                             top: "+top+"px; width: "+(null==width?rightSide-left:width)+"px;\n                             height: "+(bottom-top)+"px"))}function drawForLine(line,fromArg,toArg){function coords(ch,bias){return charCoords(cm,Pos(line,ch),"div",lineObj,bias)}var start,end,lineObj=getLine(doc,line),lineLen=lineObj.text.length;return iterateBidiSections(getOrder(lineObj,doc.direction),fromArg||0,null==toArg?lineLen:toArg,function(from,to,dir){var rightPos,left,right,leftPos=coords(from,"left");if(from==to)rightPos=leftPos,left=right=leftPos.left;else{if(rightPos=coords(to-1,"right"),"rtl"==dir){var tmp=leftPos;leftPos=rightPos,rightPos=tmp}left=leftPos.left,right=rightPos.right}null==fromArg&&0==from&&(left=leftSide),rightPos.top-leftPos.top>3&&(add(left,leftPos.top,null,leftPos.bottom),left=leftSide,leftPos.bottom<rightPos.top&&add(left,leftPos.bottom,null,rightPos.top)),null==toArg&&to==lineLen&&(right=rightSide),(!start||leftPos.top<start.top||leftPos.top==start.top&&leftPos.left<start.left)&&(start=leftPos),(!end||rightPos.bottom>end.bottom||rightPos.bottom==end.bottom&&rightPos.right>end.right)&&(end=rightPos),left<leftSide+1&&(left=leftSide),add(left,rightPos.top,right-left,rightPos.bottom)}),{start:start,end:end}}var display=cm.display,doc=cm.doc,fragment=document.createDocumentFragment(),padding=paddingH(cm.display),leftSide=padding.left,rightSide=Math.max(display.sizerWidth,displayWidth(cm)-display.sizer.offsetLeft)-padding.right,sFrom=range$$1.from(),sTo=range$$1.to();if(sFrom.line==sTo.line)drawForLine(sFrom.line,sFrom.ch,sTo.ch);else{var fromLine=getLine(doc,sFrom.line),toLine=getLine(doc,sTo.line),singleVLine=visualLine(fromLine)==visualLine(toLine),leftEnd=drawForLine(sFrom.line,sFrom.ch,singleVLine?fromLine.text.length+1:null).end,rightStart=drawForLine(sTo.line,singleVLine?0:null,sTo.ch).start;singleVLine&&(leftEnd.top<rightStart.top-2?(add(leftEnd.right,leftEnd.top,null,leftEnd.bottom),add(leftSide,rightStart.top,rightStart.left,rightStart.bottom)):add(leftEnd.right,leftEnd.top,rightStart.left-leftEnd.right,leftEnd.bottom)),leftEnd.bottom<rightStart.top&&add(leftSide,leftEnd.bottom,null,rightStart.top)}output.appendChild(fragment)}function restartBlink(cm){if(cm.state.focused){var display=cm.display;clearInterval(display.blinker);var on=!0;display.cursorDiv.style.visibility="",cm.options.cursorBlinkRate>0?display.blinker=setInterval(function(){return display.cursorDiv.style.visibility=(on=!on)?"":"hidden"},cm.options.cursorBlinkRate):cm.options.cursorBlinkRate<0&&(display.cursorDiv.style.visibility="hidden")}}function ensureFocus(cm){cm.state.focused||(cm.display.input.focus(),onFocus(cm))}function delayBlurEvent(cm){cm.state.delayingBlurEvent=!0,setTimeout(function(){cm.state.delayingBlurEvent&&(cm.state.delayingBlurEvent=!1,onBlur(cm))},100)}function onFocus(cm,e){cm.state.delayingBlurEvent&&(cm.state.delayingBlurEvent=!1),"nocursor"!=cm.options.readOnly&&(cm.state.focused||(signal(cm,"focus",cm,e),cm.state.focused=!0,addClass(cm.display.wrapper,"CodeMirror-focused"),cm.curOp||cm.display.selForContextMenu==cm.doc.sel||(cm.display.input.reset(),webkit&&setTimeout(function(){return cm.display.input.reset(!0)},20)),cm.display.input.receivedFocus()),restartBlink(cm))}function onBlur(cm,e){cm.state.delayingBlurEvent||(cm.state.focused&&(signal(cm,"blur",cm,e),cm.state.focused=!1,rmClass(cm.display.wrapper,"CodeMirror-focused")),clearInterval(cm.display.blinker),setTimeout(function(){cm.state.focused||(cm.display.shift=!1)},150))}function updateHeightsInViewport(cm){for(var display=cm.display,prevBottom=display.lineDiv.offsetTop,i=0;i<display.view.length;i++){var cur=display.view[i],height=void 0;if(!cur.hidden){if(ie&&ie_version<8){var bot=cur.node.offsetTop+cur.node.offsetHeight;height=bot-prevBottom,prevBottom=bot}else{var box=cur.node.getBoundingClientRect();height=box.bottom-box.top}var diff=cur.line.height-height;if(height<2&&(height=textHeight(display)),(diff>.001||diff<-.001)&&(updateLineHeight(cur.line,height),updateWidgetHeight(cur.line),cur.rest))for(var j=0;j<cur.rest.length;j++)updateWidgetHeight(cur.rest[j])}}}function updateWidgetHeight(line){if(line.widgets)for(var i=0;i<line.widgets.length;++i)line.widgets[i].height=line.widgets[i].node.parentNode.offsetHeight}function visibleLines(display,doc,viewport){var top=viewport&&null!=viewport.top?Math.max(0,viewport.top):display.scroller.scrollTop;top=Math.floor(top-paddingTop(display));var bottom=viewport&&null!=viewport.bottom?viewport.bottom:top+display.wrapper.clientHeight,from=lineAtHeight(doc,top),to=lineAtHeight(doc,bottom);if(viewport&&viewport.ensure){var ensureFrom=viewport.ensure.from.line,ensureTo=viewport.ensure.to.line;ensureFrom<from?(from=ensureFrom,to=lineAtHeight(doc,heightAtLine(getLine(doc,ensureFrom))+display.wrapper.clientHeight)):Math.min(ensureTo,doc.lastLine())>=to&&(from=lineAtHeight(doc,heightAtLine(getLine(doc,ensureTo))-display.wrapper.clientHeight),to=ensureTo)}return{from:from,to:Math.max(to,from+1)}}function alignHorizontally(cm){var display=cm.display,view=display.view;if(display.alignWidgets||display.gutters.firstChild&&cm.options.fixedGutter){for(var comp=compensateForHScroll(display)-display.scroller.scrollLeft+cm.doc.scrollLeft,gutterW=display.gutters.offsetWidth,left=comp+"px",i=0;i<view.length;i++)if(!view[i].hidden){cm.options.fixedGutter&&(view[i].gutter&&(view[i].gutter.style.left=left),view[i].gutterBackground&&(view[i].gutterBackground.style.left=left));var align=view[i].alignable;if(align)for(var j=0;j<align.length;j++)align[j].style.left=left}cm.options.fixedGutter&&(display.gutters.style.left=comp+gutterW+"px")}}function maybeUpdateLineNumberWidth(cm){if(!cm.options.lineNumbers)return!1;var doc=cm.doc,last=lineNumberFor(cm.options,doc.first+doc.size-1),display=cm.display;if(last.length!=display.lineNumChars){var test=display.measure.appendChild(elt("div",[elt("div",last)],"CodeMirror-linenumber CodeMirror-gutter-elt")),innerW=test.firstChild.offsetWidth,padding=test.offsetWidth-innerW;return display.lineGutter.style.width="",display.lineNumInnerWidth=Math.max(innerW,display.lineGutter.offsetWidth-padding)+1,display.lineNumWidth=display.lineNumInnerWidth+padding,display.lineNumChars=display.lineNumInnerWidth?last.length:-1,display.lineGutter.style.width=display.lineNumWidth+"px",updateGutterSpace(cm),!0}return!1}function maybeScrollWindow(cm,rect){if(!signalDOMEvent(cm,"scrollCursorIntoView")){var display=cm.display,box=display.sizer.getBoundingClientRect(),doScroll=null;if(rect.top+box.top<0?doScroll=!0:rect.bottom+box.top>(window.innerHeight||document.documentElement.clientHeight)&&(doScroll=!1),null!=doScroll&&!phantom){var scrollNode=elt("div","​",null,"position: absolute;\n                         top: "+(rect.top-display.viewOffset-paddingTop(cm.display))+"px;\n                         height: "+(rect.bottom-rect.top+scrollGap(cm)+display.barHeight)+"px;\n                         left: "+rect.left+"px; width: "+Math.max(2,rect.right-rect.left)+"px;");cm.display.lineSpace.appendChild(scrollNode),scrollNode.scrollIntoView(doScroll),cm.display.lineSpace.removeChild(scrollNode)}}}function scrollPosIntoView(cm,pos,end,margin){null==margin&&(margin=0);for(var rect,limit=0;limit<5;limit++){var changed=!1,coords=cursorCoords(cm,pos),endCoords=end&&end!=pos?cursorCoords(cm,end):coords,scrollPos=calculateScrollPos(cm,rect={left:Math.min(coords.left,endCoords.left),top:Math.min(coords.top,endCoords.top)-margin,right:Math.max(coords.left,endCoords.left),bottom:Math.max(coords.bottom,endCoords.bottom)+margin}),startTop=cm.doc.scrollTop,startLeft=cm.doc.scrollLeft;if(null!=scrollPos.scrollTop&&(updateScrollTop(cm,scrollPos.scrollTop),Math.abs(cm.doc.scrollTop-startTop)>1&&(changed=!0)),null!=scrollPos.scrollLeft&&(setScrollLeft(cm,scrollPos.scrollLeft),Math.abs(cm.doc.scrollLeft-startLeft)>1&&(changed=!0)),!changed)break}return rect}function scrollIntoView(cm,rect){var scrollPos=calculateScrollPos(cm,rect);null!=scrollPos.scrollTop&&updateScrollTop(cm,scrollPos.scrollTop),null!=scrollPos.scrollLeft&&setScrollLeft(cm,scrollPos.scrollLeft)}function calculateScrollPos(cm,rect){var display=cm.display,snapMargin=textHeight(cm.display);rect.top<0&&(rect.top=0);var screentop=cm.curOp&&null!=cm.curOp.scrollTop?cm.curOp.scrollTop:display.scroller.scrollTop,screen=displayHeight(cm),result={};rect.bottom-rect.top>screen&&(rect.bottom=rect.top+screen);var docBottom=cm.doc.height+paddingVert(display),atTop=rect.top<snapMargin,atBottom=rect.bottom>docBottom-snapMargin;if(rect.top<screentop)result.scrollTop=atTop?0:rect.top;else if(rect.bottom>screentop+screen){var newTop=Math.min(rect.top,(atBottom?docBottom:rect.bottom)-screen);newTop!=screentop&&(result.scrollTop=newTop)}var screenleft=cm.curOp&&null!=cm.curOp.scrollLeft?cm.curOp.scrollLeft:display.scroller.scrollLeft,screenw=displayWidth(cm)-(cm.options.fixedGutter?display.gutters.offsetWidth:0),tooWide=rect.right-rect.left>screenw;return tooWide&&(rect.right=rect.left+screenw),rect.left<10?result.scrollLeft=0:rect.left<screenleft?result.scrollLeft=Math.max(0,rect.left-(tooWide?0:10)):rect.right>screenw+screenleft-3&&(result.scrollLeft=rect.right+(tooWide?0:10)-screenw),result}function addToScrollTop(cm,top){null!=top&&(resolveScrollToPos(cm),cm.curOp.scrollTop=(null==cm.curOp.scrollTop?cm.doc.scrollTop:cm.curOp.scrollTop)+top)}function ensureCursorVisible(cm){resolveScrollToPos(cm);var cur=cm.getCursor(),from=cur,to=cur;cm.options.lineWrapping||(from=cur.ch?Pos(cur.line,cur.ch-1):cur,to=Pos(cur.line,cur.ch+1)),cm.curOp.scrollToPos={from:from,to:to,margin:cm.options.cursorScrollMargin}}function scrollToCoords(cm,x,y){null==x&&null==y||resolveScrollToPos(cm),null!=x&&(cm.curOp.scrollLeft=x),null!=y&&(cm.curOp.scrollTop=y)}function scrollToRange(cm,range$$1){resolveScrollToPos(cm),cm.curOp.scrollToPos=range$$1}function resolveScrollToPos(cm){var range$$1=cm.curOp.scrollToPos;range$$1&&(cm.curOp.scrollToPos=null,scrollToCoordsRange(cm,estimateCoords(cm,range$$1.from),estimateCoords(cm,range$$1.to),range$$1.margin))}function scrollToCoordsRange(cm,from,to,margin){var sPos=calculateScrollPos(cm,{left:Math.min(from.left,to.left),top:Math.min(from.top,to.top)-margin,right:Math.max(from.right,to.right),bottom:Math.max(from.bottom,to.bottom)+margin});scrollToCoords(cm,sPos.scrollLeft,sPos.scrollTop)}function updateScrollTop(cm,val){Math.abs(cm.doc.scrollTop-val)<2||(gecko||updateDisplaySimple(cm,{top:val}),setScrollTop(cm,val,!0),gecko&&updateDisplaySimple(cm),startWorker(cm,100))}function setScrollTop(cm,val,forceScroll){val=Math.min(cm.display.scroller.scrollHeight-cm.display.scroller.clientHeight,val),(cm.display.scroller.scrollTop!=val||forceScroll)&&(cm.doc.scrollTop=val,cm.display.scrollbars.setScrollTop(val),cm.display.scroller.scrollTop!=val&&(cm.display.scroller.scrollTop=val))}function setScrollLeft(cm,val,isScroller,forceScroll){val=Math.min(val,cm.display.scroller.scrollWidth-cm.display.scroller.clientWidth),(isScroller?val==cm.doc.scrollLeft:Math.abs(cm.doc.scrollLeft-val)<2)&&!forceScroll||(cm.doc.scrollLeft=val,alignHorizontally(cm),cm.display.scroller.scrollLeft!=val&&(cm.display.scroller.scrollLeft=val),cm.display.scrollbars.setScrollLeft(val))}function measureForScrollbars(cm){var d=cm.display,gutterW=d.gutters.offsetWidth,docH=Math.round(cm.doc.height+paddingVert(cm.display));return{clientHeight:d.scroller.clientHeight,viewHeight:d.wrapper.clientHeight,scrollWidth:d.scroller.scrollWidth,clientWidth:d.scroller.clientWidth,viewWidth:d.wrapper.clientWidth,barLeft:cm.options.fixedGutter?gutterW:0,docHeight:docH,scrollHeight:docH+scrollGap(cm)+d.barHeight,nativeBarWidth:d.nativeBarWidth,gutterWidth:gutterW}}function updateScrollbars(cm,measure){measure||(measure=measureForScrollbars(cm));var startWidth=cm.display.barWidth,startHeight=cm.display.barHeight;updateScrollbarsInner(cm,measure);for(var i=0;i<4&&startWidth!=cm.display.barWidth||startHeight!=cm.display.barHeight;i++)startWidth!=cm.display.barWidth&&cm.options.lineWrapping&&updateHeightsInViewport(cm),updateScrollbarsInner(cm,measureForScrollbars(cm)),startWidth=cm.display.barWidth,startHeight=cm.display.barHeight}function updateScrollbarsInner(cm,measure){var d=cm.display,sizes=d.scrollbars.update(measure);d.sizer.style.paddingRight=(d.barWidth=sizes.right)+"px",d.sizer.style.paddingBottom=(d.barHeight=sizes.bottom)+"px",d.heightForcer.style.borderBottom=sizes.bottom+"px solid transparent",sizes.right&&sizes.bottom?(d.scrollbarFiller.style.display="block",d.scrollbarFiller.style.height=sizes.bottom+"px",d.scrollbarFiller.style.width=sizes.right+"px"):d.scrollbarFiller.style.display="",sizes.bottom&&cm.options.coverGutterNextToScrollbar&&cm.options.fixedGutter?(d.gutterFiller.style.display="block",d.gutterFiller.style.height=sizes.bottom+"px",d.gutterFiller.style.width=measure.gutterWidth+"px"):d.gutterFiller.style.display=""}function initScrollbars(cm){cm.display.scrollbars&&(cm.display.scrollbars.clear(),cm.display.scrollbars.addClass&&rmClass(cm.display.wrapper,cm.display.scrollbars.addClass)),cm.display.scrollbars=new scrollbarModel[cm.options.scrollbarStyle](function(node){cm.display.wrapper.insertBefore(node,cm.display.scrollbarFiller),on(node,"mousedown",function(){cm.state.focused&&setTimeout(function(){return cm.display.input.focus()},0)}),node.setAttribute("cm-not-content","true")},function(pos,axis){"horizontal"==axis?setScrollLeft(cm,pos):updateScrollTop(cm,pos)},cm),cm.display.scrollbars.addClass&&addClass(cm.display.wrapper,cm.display.scrollbars.addClass)}function startOperation(cm){cm.curOp={cm:cm,viewChanged:!1,startHeight:cm.doc.height,forceUpdate:!1,updateInput:null,typing:!1,changeObjs:null,cursorActivityHandlers:null,cursorActivityCalled:0,selectionChanged:!1,updateMaxLine:!1,scrollLeft:null,scrollTop:null,scrollToPos:null,focus:!1,id:++nextOpId},pushOperation(cm.curOp)}function endOperation(cm){finishOperation(cm.curOp,function(group){for(var i=0;i<group.ops.length;i++)group.ops[i].cm.curOp=null;endOperations(group)})}function endOperations(group){for(var ops=group.ops,i=0;i<ops.length;i++)endOperation_R1(ops[i]);for(var i$1=0;i$1<ops.length;i$1++)endOperation_W1(ops[i$1]);for(var i$2=0;i$2<ops.length;i$2++)endOperation_R2(ops[i$2]);for(var i$3=0;i$3<ops.length;i$3++)endOperation_W2(ops[i$3]);for(var i$4=0;i$4<ops.length;i$4++)endOperation_finish(ops[i$4])}function endOperation_R1(op){var cm=op.cm,display=cm.display;maybeClipScrollbars(cm),op.updateMaxLine&&findMaxLine(cm),op.mustUpdate=op.viewChanged||op.forceUpdate||null!=op.scrollTop||op.scrollToPos&&(op.scrollToPos.from.line<display.viewFrom||op.scrollToPos.to.line>=display.viewTo)||display.maxLineChanged&&cm.options.lineWrapping,op.update=op.mustUpdate&&new DisplayUpdate(cm,op.mustUpdate&&{top:op.scrollTop,ensure:op.scrollToPos},op.forceUpdate)}function endOperation_W1(op){op.updatedDisplay=op.mustUpdate&&updateDisplayIfNeeded(op.cm,op.update)}function endOperation_R2(op){var cm=op.cm,display=cm.display;op.updatedDisplay&&updateHeightsInViewport(cm),op.barMeasure=measureForScrollbars(cm),display.maxLineChanged&&!cm.options.lineWrapping&&(op.adjustWidthTo=measureChar(cm,display.maxLine,display.maxLine.text.length).left+3,cm.display.sizerWidth=op.adjustWidthTo,op.barMeasure.scrollWidth=Math.max(display.scroller.clientWidth,display.sizer.offsetLeft+op.adjustWidthTo+scrollGap(cm)+cm.display.barWidth),op.maxScrollLeft=Math.max(0,display.sizer.offsetLeft+op.adjustWidthTo-displayWidth(cm))),(op.updatedDisplay||op.selectionChanged)&&(op.preparedSelection=display.input.prepareSelection(op.focus))}function endOperation_W2(op){var cm=op.cm;null!=op.adjustWidthTo&&(cm.display.sizer.style.minWidth=op.adjustWidthTo+"px",op.maxScrollLeft<cm.doc.scrollLeft&&setScrollLeft(cm,Math.min(cm.display.scroller.scrollLeft,op.maxScrollLeft),!0),cm.display.maxLineChanged=!1);var takeFocus=op.focus&&op.focus==activeElt()&&(!document.hasFocus||document.hasFocus());op.preparedSelection&&cm.display.input.showSelection(op.preparedSelection,takeFocus),(op.updatedDisplay||op.startHeight!=cm.doc.height)&&updateScrollbars(cm,op.barMeasure),op.updatedDisplay&&setDocumentHeight(cm,op.barMeasure),op.selectionChanged&&restartBlink(cm),cm.state.focused&&op.updateInput&&cm.display.input.reset(op.typing),takeFocus&&ensureFocus(op.cm)}function endOperation_finish(op){var cm=op.cm,display=cm.display,doc=cm.doc;op.updatedDisplay&&postUpdateDisplay(cm,op.update),null==display.wheelStartX||null==op.scrollTop&&null==op.scrollLeft&&!op.scrollToPos||(display.wheelStartX=display.wheelStartY=null),null!=op.scrollTop&&setScrollTop(cm,op.scrollTop,op.forceScroll),null!=op.scrollLeft&&setScrollLeft(cm,op.scrollLeft,!0,!0),op.scrollToPos&&maybeScrollWindow(cm,scrollPosIntoView(cm,clipPos(doc,op.scrollToPos.from),clipPos(doc,op.scrollToPos.to),op.scrollToPos.margin));var hidden=op.maybeHiddenMarkers,unhidden=op.maybeUnhiddenMarkers;if(hidden)for(var i=0;i<hidden.length;++i)hidden[i].lines.length||signal(hidden[i],"hide");if(unhidden)for(var i$1=0;i$1<unhidden.length;++i$1)unhidden[i$1].lines.length&&signal(unhidden[i$1],"unhide");display.wrapper.offsetHeight&&(doc.scrollTop=cm.display.scroller.scrollTop),op.changeObjs&&signal(cm,"changes",cm,op.changeObjs),op.update&&op.update.finish()}function runInOp(cm,f){if(cm.curOp)return f();startOperation(cm);try{return f()}finally{endOperation(cm)}}function operation(cm,f){return function(){if(cm.curOp)return f.apply(cm,arguments);startOperation(cm);try{return f.apply(cm,arguments)}finally{endOperation(cm)}}}function methodOp(f){return function(){if(this.curOp)return f.apply(this,arguments);startOperation(this);try{return f.apply(this,arguments)}finally{endOperation(this)}}}function docMethodOp(f){return function(){var cm=this.cm;if(!cm||cm.curOp)return f.apply(this,arguments);startOperation(cm);try{return f.apply(this,arguments)}finally{endOperation(cm)}}}function regChange(cm,from,to,lendiff){null==from&&(from=cm.doc.first),null==to&&(to=cm.doc.first+cm.doc.size),lendiff||(lendiff=0);var display=cm.display;if(lendiff&&to<display.viewTo&&(null==display.updateLineNumbers||display.updateLineNumbers>from)&&(display.updateLineNumbers=from),cm.curOp.viewChanged=!0,from>=display.viewTo)sawCollapsedSpans&&visualLineNo(cm.doc,from)<display.viewTo&&resetView(cm);else if(to<=display.viewFrom)sawCollapsedSpans&&visualLineEndNo(cm.doc,to+lendiff)>display.viewFrom?resetView(cm):(display.viewFrom+=lendiff,display.viewTo+=lendiff);else if(from<=display.viewFrom&&to>=display.viewTo)resetView(cm);else if(from<=display.viewFrom){var cut=viewCuttingPoint(cm,to,to+lendiff,1);cut?(display.view=display.view.slice(cut.index),display.viewFrom=cut.lineN,display.viewTo+=lendiff):resetView(cm)}else if(to>=display.viewTo){var cut$1=viewCuttingPoint(cm,from,from,-1);cut$1?(display.view=display.view.slice(0,cut$1.index),display.viewTo=cut$1.lineN):resetView(cm)}else{var cutTop=viewCuttingPoint(cm,from,from,-1),cutBot=viewCuttingPoint(cm,to,to+lendiff,1);cutTop&&cutBot?(display.view=display.view.slice(0,cutTop.index).concat(buildViewArray(cm,cutTop.lineN,cutBot.lineN)).concat(display.view.slice(cutBot.index)),display.viewTo+=lendiff):resetView(cm)}var ext=display.externalMeasured;ext&&(to<ext.lineN?ext.lineN+=lendiff:from<ext.lineN+ext.size&&(display.externalMeasured=null))}function regLineChange(cm,line,type){cm.curOp.viewChanged=!0;var display=cm.display,ext=cm.display.externalMeasured;if(ext&&line>=ext.lineN&&line<ext.lineN+ext.size&&(display.externalMeasured=null),!(line<display.viewFrom||line>=display.viewTo)){var lineView=display.view[findViewIndex(cm,line)];if(null!=lineView.node){var arr=lineView.changes||(lineView.changes=[]);-1==indexOf(arr,type)&&arr.push(type)}}}function resetView(cm){cm.display.viewFrom=cm.display.viewTo=cm.doc.first,cm.display.view=[],cm.display.viewOffset=0}function viewCuttingPoint(cm,oldN,newN,dir){var diff,index=findViewIndex(cm,oldN),view=cm.display.view;if(!sawCollapsedSpans||newN==cm.doc.first+cm.doc.size)return{index:index,lineN:newN};for(var n=cm.display.viewFrom,i=0;i<index;i++)n+=view[i].size;if(n!=oldN){if(dir>0){if(index==view.length-1)return null;diff=n+view[index].size-oldN,index++}else diff=n-oldN;oldN+=diff,newN+=diff}for(;visualLineNo(cm.doc,newN)!=newN;){if(index==(dir<0?0:view.length-1))return null;newN+=dir*view[index-(dir<0?1:0)].size,index+=dir}return{index:index,lineN:newN}}function adjustView(cm,from,to){var display=cm.display;0==display.view.length||from>=display.viewTo||to<=display.viewFrom?(display.view=buildViewArray(cm,from,to),display.viewFrom=from):(display.viewFrom>from?display.view=buildViewArray(cm,from,display.viewFrom).concat(display.view):display.viewFrom<from&&(display.view=display.view.slice(findViewIndex(cm,from))),display.viewFrom=from,display.viewTo<to?display.view=display.view.concat(buildViewArray(cm,display.viewTo,to)):display.viewTo>to&&(display.view=display.view.slice(0,findViewIndex(cm,to)))),display.viewTo=to}function countDirtyView(cm){for(var view=cm.display.view,dirty=0,i=0;i<view.length;i++){var lineView=view[i];lineView.hidden||lineView.node&&!lineView.changes||++dirty}return dirty}function startWorker(cm,time){cm.doc.highlightFrontier<cm.display.viewTo&&cm.state.highlight.set(time,bind(highlightWorker,cm))}function highlightWorker(cm){var doc=cm.doc;if(!(doc.highlightFrontier>=cm.display.viewTo)){var end=+new Date+cm.options.workTime,context=getContextBefore(cm,doc.highlightFrontier),changedLines=[];doc.iter(context.line,Math.min(doc.first+doc.size,cm.display.viewTo+500),function(line){if(context.line>=cm.display.viewFrom){var oldStyles=line.styles,resetState=line.text.length>cm.options.maxHighlightLength?copyState(doc.mode,context.state):null,highlighted=highlightLine(cm,line,context,!0);resetState&&(context.state=resetState),line.styles=highlighted.styles;var oldCls=line.styleClasses,newCls=highlighted.classes;newCls?line.styleClasses=newCls:oldCls&&(line.styleClasses=null);for(var ischange=!oldStyles||oldStyles.length!=line.styles.length||oldCls!=newCls&&(!oldCls||!newCls||oldCls.bgClass!=newCls.bgClass||oldCls.textClass!=newCls.textClass),i=0;!ischange&&i<oldStyles.length;++i)ischange=oldStyles[i]!=line.styles[i];ischange&&changedLines.push(context.line),line.stateAfter=context.save(),context.nextLine()}else line.text.length<=cm.options.maxHighlightLength&&processLine(cm,line.text,context),line.stateAfter=context.line%5==0?context.save():null,context.nextLine();if(+new Date>end)return startWorker(cm,cm.options.workDelay),!0}),doc.highlightFrontier=context.line,doc.modeFrontier=Math.max(doc.modeFrontier,context.line),changedLines.length&&runInOp(cm,function(){for(var i=0;i<changedLines.length;i++)regLineChange(cm,changedLines[i],"text")})}}function maybeClipScrollbars(cm){var display=cm.display;!display.scrollbarsClipped&&display.scroller.offsetWidth&&(display.nativeBarWidth=display.scroller.offsetWidth-display.scroller.clientWidth,display.heightForcer.style.height=scrollGap(cm)+"px",display.sizer.style.marginBottom=-display.nativeBarWidth+"px",display.sizer.style.borderRightWidth=scrollGap(cm)+"px",display.scrollbarsClipped=!0)}function selectionSnapshot(cm){if(cm.hasFocus())return null;var active=activeElt();if(!active||!contains(cm.display.lineDiv,active))return null;var result={activeElt:active};if(window.getSelection){var sel=window.getSelection();sel.anchorNode&&sel.extend&&contains(cm.display.lineDiv,sel.anchorNode)&&(result.anchorNode=sel.anchorNode,result.anchorOffset=sel.anchorOffset,result.focusNode=sel.focusNode,result.focusOffset=sel.focusOffset)}return result}function restoreSelection(snapshot){if(snapshot&&snapshot.activeElt&&snapshot.activeElt!=activeElt()&&(snapshot.activeElt.focus(),snapshot.anchorNode&&contains(document.body,snapshot.anchorNode)&&contains(document.body,snapshot.focusNode))){var sel=window.getSelection(),range$$1=document.createRange();range$$1.setEnd(snapshot.anchorNode,snapshot.anchorOffset),range$$1.collapse(!1),sel.removeAllRanges(),sel.addRange(range$$1),sel.extend(snapshot.focusNode,snapshot.focusOffset)}}function updateDisplayIfNeeded(cm,update){var display=cm.display,doc=cm.doc;if(update.editorIsHidden)return resetView(cm),!1;if(!update.force&&update.visible.from>=display.viewFrom&&update.visible.to<=display.viewTo&&(null==display.updateLineNumbers||display.updateLineNumbers>=display.viewTo)&&display.renderedView==display.view&&0==countDirtyView(cm))return!1;maybeUpdateLineNumberWidth(cm)&&(resetView(cm),update.dims=getDimensions(cm));var end=doc.first+doc.size,from=Math.max(update.visible.from-cm.options.viewportMargin,doc.first),to=Math.min(end,update.visible.to+cm.options.viewportMargin);display.viewFrom<from&&from-display.viewFrom<20&&(from=Math.max(doc.first,display.viewFrom)),display.viewTo>to&&display.viewTo-to<20&&(to=Math.min(end,display.viewTo)),sawCollapsedSpans&&(from=visualLineNo(cm.doc,from),to=visualLineEndNo(cm.doc,to));var different=from!=display.viewFrom||to!=display.viewTo||display.lastWrapHeight!=update.wrapperHeight||display.lastWrapWidth!=update.wrapperWidth;adjustView(cm,from,to),display.viewOffset=heightAtLine(getLine(cm.doc,display.viewFrom)),cm.display.mover.style.top=display.viewOffset+"px";var toUpdate=countDirtyView(cm);if(!different&&0==toUpdate&&!update.force&&display.renderedView==display.view&&(null==display.updateLineNumbers||display.updateLineNumbers>=display.viewTo))return!1;var selSnapshot=selectionSnapshot(cm);return toUpdate>4&&(display.lineDiv.style.display="none"),patchDisplay(cm,display.updateLineNumbers,update.dims),toUpdate>4&&(display.lineDiv.style.display=""),display.renderedView=display.view,restoreSelection(selSnapshot),removeChildren(display.cursorDiv),removeChildren(display.selectionDiv),display.gutters.style.height=display.sizer.style.minHeight=0,different&&(display.lastWrapHeight=update.wrapperHeight,display.lastWrapWidth=update.wrapperWidth,startWorker(cm,400)),display.updateLineNumbers=null,!0}function postUpdateDisplay(cm,update){for(var viewport=update.viewport,first=!0;(first&&cm.options.lineWrapping&&update.oldDisplayWidth!=displayWidth(cm)||(viewport&&null!=viewport.top&&(viewport={top:Math.min(cm.doc.height+paddingVert(cm.display)-displayHeight(cm),viewport.top)}),update.visible=visibleLines(cm.display,cm.doc,viewport),!(update.visible.from>=cm.display.viewFrom&&update.visible.to<=cm.display.viewTo)))&&updateDisplayIfNeeded(cm,update);first=!1){updateHeightsInViewport(cm);var barMeasure=measureForScrollbars(cm);updateSelection(cm),updateScrollbars(cm,barMeasure),setDocumentHeight(cm,barMeasure),update.force=!1}update.signal(cm,"update",cm),cm.display.viewFrom==cm.display.reportedViewFrom&&cm.display.viewTo==cm.display.reportedViewTo||(update.signal(cm,"viewportChange",cm,cm.display.viewFrom,cm.display.viewTo),cm.display.reportedViewFrom=cm.display.viewFrom,cm.display.reportedViewTo=cm.display.viewTo)}function updateDisplaySimple(cm,viewport){var update=new DisplayUpdate(cm,viewport);if(updateDisplayIfNeeded(cm,update)){updateHeightsInViewport(cm),postUpdateDisplay(cm,update);var barMeasure=measureForScrollbars(cm);updateSelection(cm),updateScrollbars(cm,barMeasure),setDocumentHeight(cm,barMeasure),update.finish()}}function patchDisplay(cm,updateNumbersFrom,dims){function rm(node){var next=node.nextSibling;return webkit&&mac&&cm.display.currentWheelTarget==node?node.style.display="none":node.parentNode.removeChild(node),next}for(var display=cm.display,lineNumbers=cm.options.lineNumbers,container=display.lineDiv,cur=container.firstChild,view=display.view,lineN=display.viewFrom,i=0;i<view.length;i++){var lineView=view[i];if(lineView.hidden);else if(lineView.node&&lineView.node.parentNode==container){for(;cur!=lineView.node;)cur=rm(cur);var updateNumber=lineNumbers&&null!=updateNumbersFrom&&updateNumbersFrom<=lineN&&lineView.lineNumber;lineView.changes&&(indexOf(lineView.changes,"gutter")>-1&&(updateNumber=!1),updateLineForChanges(cm,lineView,lineN,dims)),updateNumber&&(removeChildren(lineView.lineNumber),lineView.lineNumber.appendChild(document.createTextNode(lineNumberFor(cm.options,lineN)))),cur=lineView.node.nextSibling}else{var node=buildLineElement(cm,lineView,lineN,dims);container.insertBefore(node,cur)}lineN+=lineView.size}for(;cur;)cur=rm(cur)}function updateGutterSpace(cm){var width=cm.display.gutters.offsetWidth;cm.display.sizer.style.marginLeft=width+"px"}function setDocumentHeight(cm,measure){cm.display.sizer.style.minHeight=measure.docHeight+"px",cm.display.heightForcer.style.top=measure.docHeight+"px",cm.display.gutters.style.height=measure.docHeight+cm.display.barHeight+scrollGap(cm)+"px"}function updateGutters(cm){var gutters=cm.display.gutters,specs=cm.options.gutters;removeChildren(gutters);for(var i=0;i<specs.length;++i){var gutterClass=specs[i],gElt=gutters.appendChild(elt("div",null,"CodeMirror-gutter "+gutterClass));"CodeMirror-linenumbers"==gutterClass&&(cm.display.lineGutter=gElt,gElt.style.width=(cm.display.lineNumWidth||1)+"px")}gutters.style.display=i?"":"none",updateGutterSpace(cm)}function setGuttersForLineNumbers(options){var found=indexOf(options.gutters,"CodeMirror-linenumbers");-1==found&&options.lineNumbers?options.gutters=options.gutters.concat(["CodeMirror-linenumbers"]):found>-1&&!options.lineNumbers&&(options.gutters=options.gutters.slice(0),options.gutters.splice(found,1))}function wheelEventDelta(e){var dx=e.wheelDeltaX,dy=e.wheelDeltaY;return null==dx&&e.detail&&e.axis==e.HORIZONTAL_AXIS&&(dx=e.detail),null==dy&&e.detail&&e.axis==e.VERTICAL_AXIS?dy=e.detail:null==dy&&(dy=e.wheelDelta),{x:dx,y:dy}}function wheelEventPixels(e){var delta=wheelEventDelta(e);return delta.x*=wheelPixelsPerUnit,delta.y*=wheelPixelsPerUnit,delta}function onScrollWheel(cm,e){var delta=wheelEventDelta(e),dx=delta.x,dy=delta.y,display=cm.display,scroll=display.scroller,canScrollX=scroll.scrollWidth>scroll.clientWidth,canScrollY=scroll.scrollHeight>scroll.clientHeight;if(dx&&canScrollX||dy&&canScrollY){if(dy&&mac&&webkit)outer:for(var cur=e.target,view=display.view;cur!=scroll;cur=cur.parentNode)for(var i=0;i<view.length;i++)if(view[i].node==cur){cm.display.currentWheelTarget=cur;break outer}if(dx&&!gecko&&!presto&&null!=wheelPixelsPerUnit)return dy&&canScrollY&&updateScrollTop(cm,Math.max(0,scroll.scrollTop+dy*wheelPixelsPerUnit)),setScrollLeft(cm,Math.max(0,scroll.scrollLeft+dx*wheelPixelsPerUnit)),(!dy||dy&&canScrollY)&&e_preventDefault(e),void(display.wheelStartX=null);if(dy&&null!=wheelPixelsPerUnit){var pixels=dy*wheelPixelsPerUnit,top=cm.doc.scrollTop,bot=top+display.wrapper.clientHeight;pixels<0?top=Math.max(0,top+pixels-50):bot=Math.min(cm.doc.height,bot+pixels+50),updateDisplaySimple(cm,{top:top,bottom:bot})}wheelSamples<20&&(null==display.wheelStartX?(display.wheelStartX=scroll.scrollLeft,display.wheelStartY=scroll.scrollTop,display.wheelDX=dx,display.wheelDY=dy,setTimeout(function(){if(null!=display.wheelStartX){var movedX=scroll.scrollLeft-display.wheelStartX,movedY=scroll.scrollTop-display.wheelStartY,sample=movedY&&display.wheelDY&&movedY/display.wheelDY||movedX&&display.wheelDX&&movedX/display.wheelDX;display.wheelStartX=display.wheelStartY=null,sample&&(wheelPixelsPerUnit=(wheelPixelsPerUnit*wheelSamples+sample)/(wheelSamples+1),++wheelSamples)}},200)):(display.wheelDX+=dx,display.wheelDY+=dy))}}function normalizeSelection(ranges,primIndex){var prim=ranges[primIndex];ranges.sort(function(a,b){return cmp(a.from(),b.from())}),primIndex=indexOf(ranges,prim);for(var i=1;i<ranges.length;i++){var cur=ranges[i],prev=ranges[i-1];if(cmp(prev.to(),cur.from())>=0){var from=minPos(prev.from(),cur.from()),to=maxPos(prev.to(),cur.to()),inv=prev.empty()?cur.from()==cur.head:prev.from()==prev.head;i<=primIndex&&--primIndex,ranges.splice(--i,2,new Range(inv?to:from,inv?from:to))}}return new Selection(ranges,primIndex)}function simpleSelection(anchor,head){return new Selection([new Range(anchor,head||anchor)],0)}function changeEnd(change){return change.text?Pos(change.from.line+change.text.length-1,lst(change.text).length+(1==change.text.length?change.from.ch:0)):change.to}function adjustForChange(pos,change){if(cmp(pos,change.from)<0)return pos;if(cmp(pos,change.to)<=0)return changeEnd(change);var line=pos.line+change.text.length-(change.to.line-change.from.line)-1,ch=pos.ch;return pos.line==change.to.line&&(ch+=changeEnd(change).ch-change.to.ch),Pos(line,ch)}function computeSelAfterChange(doc,change){for(var out=[],i=0;i<doc.sel.ranges.length;i++){var range=doc.sel.ranges[i];out.push(new Range(adjustForChange(range.anchor,change),adjustForChange(range.head,change)))}return normalizeSelection(out,doc.sel.primIndex)}function offsetPos(pos,old,nw){return pos.line==old.line?Pos(nw.line,pos.ch-old.ch+nw.ch):Pos(nw.line+(pos.line-old.line),pos.ch)}function computeReplacedSel(doc,changes,hint){for(var out=[],oldPrev=Pos(doc.first,0),newPrev=oldPrev,i=0;i<changes.length;i++){var change=changes[i],from=offsetPos(change.from,oldPrev,newPrev),to=offsetPos(changeEnd(change),oldPrev,newPrev);if(oldPrev=change.to,newPrev=to,"around"==hint){var range=doc.sel.ranges[i],inv=cmp(range.head,range.anchor)<0;out[i]=new Range(inv?to:from,inv?from:to)}else out[i]=new Range(from,from)}return new Selection(out,doc.sel.primIndex)}function loadMode(cm){cm.doc.mode=getMode(cm.options,cm.doc.modeOption),resetModeState(cm)}function resetModeState(cm){cm.doc.iter(function(line){line.stateAfter&&(line.stateAfter=null),line.styles&&(line.styles=null)}),cm.doc.modeFrontier=cm.doc.highlightFrontier=cm.doc.first,startWorker(cm,100),cm.state.modeGen++,cm.curOp&&regChange(cm)}function isWholeLineUpdate(doc,change){return 0==change.from.ch&&0==change.to.ch&&""==lst(change.text)&&(!doc.cm||doc.cm.options.wholeLineUpdateBefore)}function updateDoc(doc,change,markedSpans,estimateHeight$$1){function spansFor(n){return markedSpans?markedSpans[n]:null}function update(line,text,spans){updateLine(line,text,spans,estimateHeight$$1),signalLater(line,"change",line,change)}function linesFor(start,end){for(var result=[],i=start;i<end;++i)result.push(new Line(text[i],spansFor(i),estimateHeight$$1));return result}var from=change.from,to=change.to,text=change.text,firstLine=getLine(doc,from.line),lastLine=getLine(doc,to.line),lastText=lst(text),lastSpans=spansFor(text.length-1),nlines=to.line-from.line;if(change.full)doc.insert(0,linesFor(0,text.length)),doc.remove(text.length,doc.size-text.length);else if(isWholeLineUpdate(doc,change)){var added=linesFor(0,text.length-1);update(lastLine,lastLine.text,lastSpans),nlines&&doc.remove(from.line,nlines),added.length&&doc.insert(from.line,added)}else if(firstLine==lastLine)if(1==text.length)update(firstLine,firstLine.text.slice(0,from.ch)+lastText+firstLine.text.slice(to.ch),lastSpans);else{var added$1=linesFor(1,text.length-1);added$1.push(new Line(lastText+firstLine.text.slice(to.ch),lastSpans,estimateHeight$$1)),update(firstLine,firstLine.text.slice(0,from.ch)+text[0],spansFor(0)),doc.insert(from.line+1,added$1)}else if(1==text.length)update(firstLine,firstLine.text.slice(0,from.ch)+text[0]+lastLine.text.slice(to.ch),spansFor(0)),doc.remove(from.line+1,nlines);else{update(firstLine,firstLine.text.slice(0,from.ch)+text[0],spansFor(0)),update(lastLine,lastText+lastLine.text.slice(to.ch),lastSpans);var added$2=linesFor(1,text.length-1);nlines>1&&doc.remove(from.line+1,nlines-1),doc.insert(from.line+1,added$2)}signalLater(doc,"change",doc,change)}function linkedDocs(doc,f,sharedHistOnly){function propagate(doc,skip,sharedHist){if(doc.linked)for(var i=0;i<doc.linked.length;++i){var rel=doc.linked[i];if(rel.doc!=skip){var shared=sharedHist&&rel.sharedHist;sharedHistOnly&&!shared||(f(rel.doc,shared),propagate(rel.doc,doc,shared))}}}propagate(doc,null,!0)}function attachDoc(cm,doc){if(doc.cm)throw new Error("This document is already in use.");cm.doc=doc,doc.cm=cm,estimateLineHeights(cm),loadMode(cm),setDirectionClass(cm),cm.options.lineWrapping||findMaxLine(cm),cm.options.mode=doc.modeOption,regChange(cm)}function setDirectionClass(cm){("rtl"==cm.doc.direction?addClass:rmClass)(cm.display.lineDiv,"CodeMirror-rtl")}function directionChanged(cm){runInOp(cm,function(){setDirectionClass(cm),regChange(cm)})}function History(startGen){this.done=[],this.undone=[],this.undoDepth=1/0,this.lastModTime=this.lastSelTime=0,this.lastOp=this.lastSelOp=null,this.lastOrigin=this.lastSelOrigin=null,this.generation=this.maxGeneration=startGen||1}function historyChangeFromChange(doc,change){var histChange={from:copyPos(change.from),to:changeEnd(change),text:getBetween(doc,change.from,change.to)};return attachLocalSpans(doc,histChange,change.from.line,change.to.line+1),linkedDocs(doc,function(doc){return attachLocalSpans(doc,histChange,change.from.line,change.to.line+1)},!0),histChange}function clearSelectionEvents(array){for(;array.length&&lst(array).ranges;)array.pop()}function lastChangeEvent(hist,force){return force?(clearSelectionEvents(hist.done),lst(hist.done)):hist.done.length&&!lst(hist.done).ranges?lst(hist.done):hist.done.length>1&&!hist.done[hist.done.length-2].ranges?(hist.done.pop(),lst(hist.done)):void 0}function addChangeToHistory(doc,change,selAfter,opId){var hist=doc.history;hist.undone.length=0;var cur,last,time=+new Date;if((hist.lastOp==opId||hist.lastOrigin==change.origin&&change.origin&&("+"==change.origin.charAt(0)&&doc.cm&&hist.lastModTime>time-doc.cm.options.historyEventDelay||"*"==change.origin.charAt(0)))&&(cur=lastChangeEvent(hist,hist.lastOp==opId)))last=lst(cur.changes),0==cmp(change.from,change.to)&&0==cmp(change.from,last.to)?last.to=changeEnd(change):cur.changes.push(historyChangeFromChange(doc,change));else{var before=lst(hist.done);for(before&&before.ranges||pushSelectionToHistory(doc.sel,hist.done),cur={changes:[historyChangeFromChange(doc,change)],generation:hist.generation},hist.done.push(cur);hist.done.length>hist.undoDepth;)hist.done.shift(),hist.done[0].ranges||hist.done.shift()}hist.done.push(selAfter),hist.generation=++hist.maxGeneration,hist.lastModTime=hist.lastSelTime=time,hist.lastOp=hist.lastSelOp=opId,hist.lastOrigin=hist.lastSelOrigin=change.origin,last||signal(doc,"historyAdded")}function selectionEventCanBeMerged(doc,origin,prev,sel){var ch=origin.charAt(0);return"*"==ch||"+"==ch&&prev.ranges.length==sel.ranges.length&&prev.somethingSelected()==sel.somethingSelected()&&new Date-doc.history.lastSelTime<=(doc.cm?doc.cm.options.historyEventDelay:500)}function addSelectionToHistory(doc,sel,opId,options){var hist=doc.history,origin=options&&options.origin;opId==hist.lastSelOp||origin&&hist.lastSelOrigin==origin&&(hist.lastModTime==hist.lastSelTime&&hist.lastOrigin==origin||selectionEventCanBeMerged(doc,origin,lst(hist.done),sel))?hist.done[hist.done.length-1]=sel:pushSelectionToHistory(sel,hist.done),hist.lastSelTime=+new Date,hist.lastSelOrigin=origin,hist.lastSelOp=opId,options&&!1!==options.clearRedo&&clearSelectionEvents(hist.undone)}function pushSelectionToHistory(sel,dest){var top=lst(dest);top&&top.ranges&&top.equals(sel)||dest.push(sel)}function attachLocalSpans(doc,change,from,to){var existing=change["spans_"+doc.id],n=0;doc.iter(Math.max(doc.first,from),Math.min(doc.first+doc.size,to),function(line){line.markedSpans&&((existing||(existing=change["spans_"+doc.id]={}))[n]=line.markedSpans),++n})}function removeClearedSpans(spans){if(!spans)return null;for(var out,i=0;i<spans.length;++i)spans[i].marker.explicitlyCleared?out||(out=spans.slice(0,i)):out&&out.push(spans[i]);return out?out.length?out:null:spans}function getOldSpans(doc,change){var found=change["spans_"+doc.id];if(!found)return null;for(var nw=[],i=0;i<change.text.length;++i)nw.push(removeClearedSpans(found[i]));return nw}function mergeOldSpans(doc,change){var old=getOldSpans(doc,change),stretched=stretchSpansOverChange(doc,change);if(!old)return stretched;if(!stretched)return old;for(var i=0;i<old.length;++i){var oldCur=old[i],stretchCur=stretched[i];if(oldCur&&stretchCur)spans:for(var j=0;j<stretchCur.length;++j){for(var span=stretchCur[j],k=0;k<oldCur.length;++k)if(oldCur[k].marker==span.marker)continue spans;oldCur.push(span)}else stretchCur&&(old[i]=stretchCur)}return old}function copyHistoryArray(events,newGroup,instantiateSel){for(var copy=[],i=0;i<events.length;++i){var event=events[i];if(event.ranges)copy.push(instantiateSel?Selection.prototype.deepCopy.call(event):event);else{var changes=event.changes,newChanges=[];copy.push({changes:newChanges});for(var j=0;j<changes.length;++j){var change=changes[j],m=void 0;if(newChanges.push({from:change.from,to:change.to,text:change.text}),newGroup)for(var prop in change)(m=prop.match(/^spans_(\d+)$/))&&indexOf(newGroup,Number(m[1]))>-1&&(lst(newChanges)[prop]=change[prop],delete change[prop])}}}return copy}function extendRange(range,head,other,extend){if(extend){var anchor=range.anchor;if(other){var posBefore=cmp(head,anchor)<0;posBefore!=cmp(other,anchor)<0?(anchor=head,head=other):posBefore!=cmp(head,other)<0&&(head=other)}return new Range(anchor,head)}return new Range(other||head,head)}function extendSelection(doc,head,other,options,extend){null==extend&&(extend=doc.cm&&(doc.cm.display.shift||doc.extend)),setSelection(doc,new Selection([extendRange(doc.sel.primary(),head,other,extend)],0),options)}function extendSelections(doc,heads,options){for(var out=[],extend=doc.cm&&(doc.cm.display.shift||doc.extend),i=0;i<doc.sel.ranges.length;i++)out[i]=extendRange(doc.sel.ranges[i],heads[i],null,extend);setSelection(doc,normalizeSelection(out,doc.sel.primIndex),options)}function replaceOneSelection(doc,i,range,options){var ranges=doc.sel.ranges.slice(0);ranges[i]=range,setSelection(doc,normalizeSelection(ranges,doc.sel.primIndex),options)}function setSimpleSelection(doc,anchor,head,options){setSelection(doc,simpleSelection(anchor,head),options)}function filterSelectionChange(doc,sel,options){var obj={ranges:sel.ranges,update:function(ranges){var this$1=this;this.ranges=[];for(var i=0;i<ranges.length;i++)this$1.ranges[i]=new Range(clipPos(doc,ranges[i].anchor),clipPos(doc,ranges[i].head))},origin:options&&options.origin};return signal(doc,"beforeSelectionChange",doc,obj),doc.cm&&signal(doc.cm,"beforeSelectionChange",doc.cm,obj),obj.ranges!=sel.ranges?normalizeSelection(obj.ranges,obj.ranges.length-1):sel}function setSelectionReplaceHistory(doc,sel,options){var done=doc.history.done,last=lst(done);last&&last.ranges?(done[done.length-1]=sel,setSelectionNoUndo(doc,sel,options)):setSelection(doc,sel,options)}function setSelection(doc,sel,options){setSelectionNoUndo(doc,sel,options),addSelectionToHistory(doc,doc.sel,doc.cm?doc.cm.curOp.id:NaN,options)}function setSelectionNoUndo(doc,sel,options){(hasHandler(doc,"beforeSelectionChange")||doc.cm&&hasHandler(doc.cm,"beforeSelectionChange"))&&(sel=filterSelectionChange(doc,sel,options)),setSelectionInner(doc,skipAtomicInSelection(doc,sel,options&&options.bias||(cmp(sel.primary().head,doc.sel.primary().head)<0?-1:1),!0)),options&&!1===options.scroll||!doc.cm||ensureCursorVisible(doc.cm)}function setSelectionInner(doc,sel){sel.equals(doc.sel)||(doc.sel=sel,doc.cm&&(doc.cm.curOp.updateInput=doc.cm.curOp.selectionChanged=!0,signalCursorActivity(doc.cm)),signalLater(doc,"cursorActivity",doc))}function reCheckSelection(doc){setSelectionInner(doc,skipAtomicInSelection(doc,doc.sel,null,!1))}function skipAtomicInSelection(doc,sel,bias,mayClear){for(var out,i=0;i<sel.ranges.length;i++){var range=sel.ranges[i],old=sel.ranges.length==doc.sel.ranges.length&&doc.sel.ranges[i],newAnchor=skipAtomic(doc,range.anchor,old&&old.anchor,bias,mayClear),newHead=skipAtomic(doc,range.head,old&&old.head,bias,mayClear);(out||newAnchor!=range.anchor||newHead!=range.head)&&(out||(out=sel.ranges.slice(0,i)),out[i]=new Range(newAnchor,newHead))}return out?normalizeSelection(out,sel.primIndex):sel}function skipAtomicInner(doc,pos,oldPos,dir,mayClear){var line=getLine(doc,pos.line);if(line.markedSpans)for(var i=0;i<line.markedSpans.length;++i){var sp=line.markedSpans[i],m=sp.marker;if((null==sp.from||(m.inclusiveLeft?sp.from<=pos.ch:sp.from<pos.ch))&&(null==sp.to||(m.inclusiveRight?sp.to>=pos.ch:sp.to>pos.ch))){if(mayClear&&(signal(m,"beforeCursorEnter"),m.explicitlyCleared)){if(line.markedSpans){--i;continue}break}if(!m.atomic)continue;if(oldPos){var near=m.find(dir<0?1:-1),diff=void 0;if((dir<0?m.inclusiveRight:m.inclusiveLeft)&&(near=movePos(doc,near,-dir,near&&near.line==pos.line?line:null)),near&&near.line==pos.line&&(diff=cmp(near,oldPos))&&(dir<0?diff<0:diff>0))return skipAtomicInner(doc,near,pos,dir,mayClear)}var far=m.find(dir<0?-1:1);return(dir<0?m.inclusiveLeft:m.inclusiveRight)&&(far=movePos(doc,far,dir,far.line==pos.line?line:null)),far?skipAtomicInner(doc,far,pos,dir,mayClear):null}}return pos}function skipAtomic(doc,pos,oldPos,bias,mayClear){var dir=bias||1,found=skipAtomicInner(doc,pos,oldPos,dir,mayClear)||!mayClear&&skipAtomicInner(doc,pos,oldPos,dir,!0)||skipAtomicInner(doc,pos,oldPos,-dir,mayClear)||!mayClear&&skipAtomicInner(doc,pos,oldPos,-dir,!0);return found||(doc.cantEdit=!0,Pos(doc.first,0))}function movePos(doc,pos,dir,line){return dir<0&&0==pos.ch?pos.line>doc.first?clipPos(doc,Pos(pos.line-1)):null:dir>0&&pos.ch==(line||getLine(doc,pos.line)).text.length?pos.line<doc.first+doc.size-1?Pos(pos.line+1,0):null:new Pos(pos.line,pos.ch+dir)}function selectAll(cm){cm.setSelection(Pos(cm.firstLine(),0),Pos(cm.lastLine()),sel_dontScroll)}function filterChange(doc,change,update){var obj={canceled:!1,from:change.from,to:change.to,text:change.text,origin:change.origin,cancel:function(){return obj.canceled=!0}};return update&&(obj.update=function(from,to,text,origin){from&&(obj.from=clipPos(doc,from)),to&&(obj.to=clipPos(doc,to)),text&&(obj.text=text),void 0!==origin&&(obj.origin=origin)}),signal(doc,"beforeChange",doc,obj),doc.cm&&signal(doc.cm,"beforeChange",doc.cm,obj),obj.canceled?null:{from:obj.from,to:obj.to,text:obj.text,origin:obj.origin}}function makeChange(doc,change,ignoreReadOnly){if(doc.cm){if(!doc.cm.curOp)return operation(doc.cm,makeChange)(doc,change,ignoreReadOnly);if(doc.cm.state.suppressEdits)return}if(!(hasHandler(doc,"beforeChange")||doc.cm&&hasHandler(doc.cm,"beforeChange"))||(change=filterChange(doc,change,!0))){var split=sawReadOnlySpans&&!ignoreReadOnly&&removeReadOnlyRanges(doc,change.from,change.to);if(split)for(var i=split.length-1;i>=0;--i)makeChangeInner(doc,{from:split[i].from,to:split[i].to,text:i?[""]:change.text});else makeChangeInner(doc,change)}}function makeChangeInner(doc,change){if(1!=change.text.length||""!=change.text[0]||0!=cmp(change.from,change.to)){var selAfter=computeSelAfterChange(doc,change);addChangeToHistory(doc,change,selAfter,doc.cm?doc.cm.curOp.id:NaN),makeChangeSingleDoc(doc,change,selAfter,stretchSpansOverChange(doc,change));var rebased=[];linkedDocs(doc,function(doc,sharedHist){sharedHist||-1!=indexOf(rebased,doc.history)||(rebaseHist(doc.history,change),rebased.push(doc.history)),makeChangeSingleDoc(doc,change,null,stretchSpansOverChange(doc,change))})}}function makeChangeFromHistory(doc,type,allowSelectionOnly){if(!doc.cm||!doc.cm.state.suppressEdits||allowSelectionOnly){for(var event,hist=doc.history,selAfter=doc.sel,source="undo"==type?hist.done:hist.undone,dest="undo"==type?hist.undone:hist.done,i=0;i<source.length&&(event=source[i],allowSelectionOnly?!event.ranges||event.equals(doc.sel):event.ranges);i++);if(i!=source.length){for(hist.lastOrigin=hist.lastSelOrigin=null;(event=source.pop()).ranges;){if(pushSelectionToHistory(event,dest),allowSelectionOnly&&!event.equals(doc.sel))return void setSelection(doc,event,{clearRedo:!1});selAfter=event}var antiChanges=[];pushSelectionToHistory(selAfter,dest),dest.push({changes:antiChanges,generation:hist.generation}),hist.generation=event.generation||++hist.maxGeneration;for(var filter=hasHandler(doc,"beforeChange")||doc.cm&&hasHandler(doc.cm,"beforeChange"),i$1=event.changes.length-1;i$1>=0;--i$1){var returned=function(i){var change=event.changes[i];if(change.origin=type,filter&&!filterChange(doc,change,!1))return source.length=0,{};antiChanges.push(historyChangeFromChange(doc,change));var after=i?computeSelAfterChange(doc,change):lst(source);makeChangeSingleDoc(doc,change,after,mergeOldSpans(doc,change)),!i&&doc.cm&&doc.cm.scrollIntoView({from:change.from,to:changeEnd(change)});var rebased=[];linkedDocs(doc,function(doc,sharedHist){sharedHist||-1!=indexOf(rebased,doc.history)||(rebaseHist(doc.history,change),rebased.push(doc.history)),makeChangeSingleDoc(doc,change,null,mergeOldSpans(doc,change))})}(i$1);if(returned)return returned.v}}}}function shiftDoc(doc,distance){if(0!=distance&&(doc.first+=distance,doc.sel=new Selection(map(doc.sel.ranges,function(range){return new Range(Pos(range.anchor.line+distance,range.anchor.ch),Pos(range.head.line+distance,range.head.ch))}),doc.sel.primIndex),doc.cm)){regChange(doc.cm,doc.first,doc.first-distance,distance);for(var d=doc.cm.display,l=d.viewFrom;l<d.viewTo;l++)regLineChange(doc.cm,l,"gutter")}}function makeChangeSingleDoc(doc,change,selAfter,spans){if(doc.cm&&!doc.cm.curOp)return operation(doc.cm,makeChangeSingleDoc)(doc,change,selAfter,spans);if(change.to.line<doc.first)shiftDoc(doc,change.text.length-1-(change.to.line-change.from.line));else if(!(change.from.line>doc.lastLine())){if(change.from.line<doc.first){var shift=change.text.length-1-(doc.first-change.from.line);shiftDoc(doc,shift),change={from:Pos(doc.first,0),to:Pos(change.to.line+shift,change.to.ch),text:[lst(change.text)],origin:change.origin}}var last=doc.lastLine();change.to.line>last&&(change={from:change.from,to:Pos(last,getLine(doc,last).text.length),text:[change.text[0]],origin:change.origin}),change.removed=getBetween(doc,change.from,change.to),selAfter||(selAfter=computeSelAfterChange(doc,change)),doc.cm?makeChangeSingleDocInEditor(doc.cm,change,spans):updateDoc(doc,change,spans),setSelectionNoUndo(doc,selAfter,sel_dontScroll)}}function makeChangeSingleDocInEditor(cm,change,spans){var doc=cm.doc,display=cm.display,from=change.from,to=change.to,recomputeMaxLength=!1,checkWidthStart=from.line;cm.options.lineWrapping||(checkWidthStart=lineNo(visualLine(getLine(doc,from.line))),doc.iter(checkWidthStart,to.line+1,function(line){if(line==display.maxLine)return recomputeMaxLength=!0,!0})),doc.sel.contains(change.from,change.to)>-1&&signalCursorActivity(cm),updateDoc(doc,change,spans,estimateHeight(cm)),cm.options.lineWrapping||(doc.iter(checkWidthStart,from.line+change.text.length,function(line){var len=lineLength(line);len>display.maxLineLength&&(display.maxLine=line,display.maxLineLength=len,display.maxLineChanged=!0,recomputeMaxLength=!1)}),recomputeMaxLength&&(cm.curOp.updateMaxLine=!0)),retreatFrontier(doc,from.line),startWorker(cm,400);var lendiff=change.text.length-(to.line-from.line)-1;change.full?regChange(cm):from.line!=to.line||1!=change.text.length||isWholeLineUpdate(cm.doc,change)?regChange(cm,from.line,to.line+1,lendiff):regLineChange(cm,from.line,"text");var changesHandler=hasHandler(cm,"changes"),changeHandler=hasHandler(cm,"change");if(changeHandler||changesHandler){var obj={from:from,to:to,text:change.text,removed:change.removed,origin:change.origin};changeHandler&&signalLater(cm,"change",cm,obj),changesHandler&&(cm.curOp.changeObjs||(cm.curOp.changeObjs=[])).push(obj)}cm.display.selForContextMenu=null}function replaceRange(doc,code,from,to,origin){if(to||(to=from),cmp(to,from)<0){var tmp=to;to=from,from=tmp}"string"==typeof code&&(code=doc.splitLines(code)),makeChange(doc,{from:from,to:to,text:code,origin:origin})}function rebaseHistSelSingle(pos,from,to,diff){to<pos.line?pos.line+=diff:from<pos.line&&(pos.line=from,pos.ch=0)}function rebaseHistArray(array,from,to,diff){for(var i=0;i<array.length;++i){var sub=array[i],ok=!0;if(sub.ranges){sub.copied||((sub=array[i]=sub.deepCopy()).copied=!0);for(var j=0;j<sub.ranges.length;j++)rebaseHistSelSingle(sub.ranges[j].anchor,from,to,diff),rebaseHistSelSingle(sub.ranges[j].head,from,to,diff)}else{for(var j$1=0;j$1<sub.changes.length;++j$1){var cur=sub.changes[j$1];if(to<cur.from.line)cur.from=Pos(cur.from.line+diff,cur.from.ch),cur.to=Pos(cur.to.line+diff,cur.to.ch);else if(from<=cur.to.line){ok=!1;break}}ok||(array.splice(0,i+1),i=0)}}}function rebaseHist(hist,change){var from=change.from.line,to=change.to.line,diff=change.text.length-(to-from)-1;rebaseHistArray(hist.done,from,to,diff),rebaseHistArray(hist.undone,from,to,diff)}function changeLine(doc,handle,changeType,op){var no=handle,line=handle;return"number"==typeof handle?line=getLine(doc,clipLine(doc,handle)):no=lineNo(handle),null==no?null:(op(line,no)&&doc.cm&&regLineChange(doc.cm,no,changeType),line)}function LeafChunk(lines){var this$1=this;this.lines=lines,this.parent=null;for(var height=0,i=0;i<lines.length;++i)lines[i].parent=this$1,height+=lines[i].height;this.height=height}function BranchChunk(children){var this$1=this;this.children=children;for(var size=0,height=0,i=0;i<children.length;++i){var ch=children[i];size+=ch.chunkSize(),height+=ch.height,ch.parent=this$1}this.size=size,this.height=height,this.parent=null}function adjustScrollWhenAboveVisible(cm,line,diff){heightAtLine(line)<(cm.curOp&&cm.curOp.scrollTop||cm.doc.scrollTop)&&addToScrollTop(cm,diff)}function addLineWidget(doc,handle,node,options){var widget=new LineWidget(doc,node,options),cm=doc.cm;return cm&&widget.noHScroll&&(cm.display.alignWidgets=!0),changeLine(doc,handle,"widget",function(line){var widgets=line.widgets||(line.widgets=[]);if(null==widget.insertAt?widgets.push(widget):widgets.splice(Math.min(widgets.length-1,Math.max(0,widget.insertAt)),0,widget),widget.line=line,cm&&!lineIsHidden(doc,line)){var aboveVisible=heightAtLine(line)<doc.scrollTop;updateLineHeight(line,line.height+widgetHeight(widget)),aboveVisible&&addToScrollTop(cm,widget.height),cm.curOp.forceUpdate=!0}return!0}),signalLater(cm,"lineWidgetAdded",cm,widget,"number"==typeof handle?handle:lineNo(handle)),widget}function markText(doc,from,to,options,type){if(options&&options.shared)return markTextShared(doc,from,to,options,type);if(doc.cm&&!doc.cm.curOp)return operation(doc.cm,markText)(doc,from,to,options,type);var marker=new TextMarker(doc,type),diff=cmp(from,to);if(options&&copyObj(options,marker,!1),diff>0||0==diff&&!1!==marker.clearWhenEmpty)return marker;if(marker.replacedWith&&(marker.collapsed=!0,marker.widgetNode=eltP("span",[marker.replacedWith],"CodeMirror-widget"),options.handleMouseEvents||marker.widgetNode.setAttribute("cm-ignore-events","true"),options.insertLeft&&(marker.widgetNode.insertLeft=!0)),marker.collapsed){if(conflictingCollapsedRange(doc,from.line,from,to,marker)||from.line!=to.line&&conflictingCollapsedRange(doc,to.line,from,to,marker))throw new Error("Inserting collapsed marker partially overlapping an existing one");seeCollapsedSpans()}marker.addToHistory&&addChangeToHistory(doc,{from:from,to:to,origin:"markText"},doc.sel,NaN);var updateMaxLine,curLine=from.line,cm=doc.cm;if(doc.iter(curLine,to.line+1,function(line){cm&&marker.collapsed&&!cm.options.lineWrapping&&visualLine(line)==cm.display.maxLine&&(updateMaxLine=!0),marker.collapsed&&curLine!=from.line&&updateLineHeight(line,0),addMarkedSpan(line,new MarkedSpan(marker,curLine==from.line?from.ch:null,curLine==to.line?to.ch:null)),++curLine}),marker.collapsed&&doc.iter(from.line,to.line+1,function(line){lineIsHidden(doc,line)&&updateLineHeight(line,0)}),marker.clearOnEnter&&on(marker,"beforeCursorEnter",function(){return marker.clear()}),marker.readOnly&&(seeReadOnlySpans(),(doc.history.done.length||doc.history.undone.length)&&doc.clearHistory()),marker.collapsed&&(marker.id=++nextMarkerId,marker.atomic=!0),cm){if(updateMaxLine&&(cm.curOp.updateMaxLine=!0),marker.collapsed)regChange(cm,from.line,to.line+1);else if(marker.className||marker.title||marker.startStyle||marker.endStyle||marker.css)for(var i=from.line;i<=to.line;i++)regLineChange(cm,i,"text");marker.atomic&&reCheckSelection(cm.doc),signalLater(cm,"markerAdded",cm,marker)}return marker}function markTextShared(doc,from,to,options,type){(options=copyObj(options)).shared=!1;var markers=[markText(doc,from,to,options,type)],primary=markers[0],widget=options.widgetNode;return linkedDocs(doc,function(doc){widget&&(options.widgetNode=widget.cloneNode(!0)),markers.push(markText(doc,clipPos(doc,from),clipPos(doc,to),options,type));for(var i=0;i<doc.linked.length;++i)if(doc.linked[i].isParent)return;primary=lst(markers)}),new SharedTextMarker(markers,primary)}function findSharedMarkers(doc){return doc.findMarks(Pos(doc.first,0),doc.clipPos(Pos(doc.lastLine())),function(m){return m.parent})}function copySharedMarkers(doc,markers){for(var i=0;i<markers.length;i++){var marker=markers[i],pos=marker.find(),mFrom=doc.clipPos(pos.from),mTo=doc.clipPos(pos.to);if(cmp(mFrom,mTo)){var subMark=markText(doc,mFrom,mTo,marker.primary,marker.primary.type);marker.markers.push(subMark),subMark.parent=marker}}}function detachSharedMarkers(markers){for(var i=0;i<markers.length;i++)!function(i){var marker=markers[i],linked=[marker.primary.doc];linkedDocs(marker.primary.doc,function(d){return linked.push(d)});for(var j=0;j<marker.markers.length;j++){var subMarker=marker.markers[j];-1==indexOf(linked,subMarker.doc)&&(subMarker.parent=null,marker.markers.splice(j--,1))}}(i)}function onDrop(e){var cm=this;if(clearDragCursor(cm),!signalDOMEvent(cm,e)&&!eventInWidget(cm.display,e)){e_preventDefault(e),ie&&(lastDrop=+new Date);var pos=posFromMouse(cm,e,!0),files=e.dataTransfer.files;if(pos&&!cm.isReadOnly())if(files&&files.length&&window.FileReader&&window.File)for(var n=files.length,text=Array(n),read=0,i=0;i<n;++i)!function(file,i){if(!cm.options.allowDropFileTypes||-1!=indexOf(cm.options.allowDropFileTypes,file.type)){var reader=new FileReader;reader.onload=operation(cm,function(){var content=reader.result;if(/[\x00-\x08\x0e-\x1f]{2}/.test(content)&&(content=""),text[i]=content,++read==n){var change={from:pos=clipPos(cm.doc,pos),to:pos,text:cm.doc.splitLines(text.join(cm.doc.lineSeparator())),origin:"paste"};makeChange(cm.doc,change),setSelectionReplaceHistory(cm.doc,simpleSelection(pos,changeEnd(change)))}}),reader.readAsText(file)}}(files[i],i);else{if(cm.state.draggingText&&cm.doc.sel.contains(pos)>-1)return cm.state.draggingText(e),void setTimeout(function(){return cm.display.input.focus()},20);try{var text$1=e.dataTransfer.getData("Text");if(text$1){var selected;if(cm.state.draggingText&&!cm.state.draggingText.copy&&(selected=cm.listSelections()),setSelectionNoUndo(cm.doc,simpleSelection(pos,pos)),selected)for(var i$1=0;i$1<selected.length;++i$1)replaceRange(cm.doc,"",selected[i$1].anchor,selected[i$1].head,"drag");cm.replaceSelection(text$1,"around","paste"),cm.display.input.focus()}}catch(e){}}}}function onDragStart(cm,e){if(ie&&(!cm.state.draggingText||+new Date-lastDrop<100))e_stop(e);else if(!signalDOMEvent(cm,e)&&!eventInWidget(cm.display,e)&&(e.dataTransfer.setData("Text",cm.getSelection()),e.dataTransfer.effectAllowed="copyMove",e.dataTransfer.setDragImage&&!safari)){var img=elt("img",null,null,"position: fixed; left: 0; top: 0;");img.src="data:image/gif;base64,R0lGODlhAQABAAAAACH5BAEKAAEALAAAAAABAAEAAAICTAEAOw==",presto&&(img.width=img.height=1,cm.display.wrapper.appendChild(img),img._top=img.offsetTop),e.dataTransfer.setDragImage(img,0,0),presto&&img.parentNode.removeChild(img)}}function onDragOver(cm,e){var pos=posFromMouse(cm,e);if(pos){var frag=document.createDocumentFragment();drawSelectionCursor(cm,pos,frag),cm.display.dragCursor||(cm.display.dragCursor=elt("div",null,"CodeMirror-cursors CodeMirror-dragcursors"),cm.display.lineSpace.insertBefore(cm.display.dragCursor,cm.display.cursorDiv)),removeChildrenAndAdd(cm.display.dragCursor,frag)}}function clearDragCursor(cm){cm.display.dragCursor&&(cm.display.lineSpace.removeChild(cm.display.dragCursor),cm.display.dragCursor=null)}function forEachCodeMirror(f){if(document.getElementsByClassName)for(var byClass=document.getElementsByClassName("CodeMirror"),i=0;i<byClass.length;i++){var cm=byClass[i].CodeMirror;cm&&f(cm)}}function ensureGlobalHandlers(){globalsRegistered||(registerGlobalHandlers(),globalsRegistered=!0)}function registerGlobalHandlers(){var resizeTimer;on(window,"resize",function(){null==resizeTimer&&(resizeTimer=setTimeout(function(){resizeTimer=null,forEachCodeMirror(onResize)},100))}),on(window,"blur",function(){return forEachCodeMirror(onBlur)})}function onResize(cm){var d=cm.display;d.lastWrapHeight==d.wrapper.clientHeight&&d.lastWrapWidth==d.wrapper.clientWidth||(d.cachedCharWidth=d.cachedTextHeight=d.cachedPaddingH=null,d.scrollbarsClipped=!1,cm.setSize())}function normalizeKeyName(name){var parts=name.split(/-(?!$)/);name=parts[parts.length-1];for(var alt,ctrl,shift,cmd,i=0;i<parts.length-1;i++){var mod=parts[i];if(/^(cmd|meta|m)$/i.test(mod))cmd=!0;else if(/^a(lt)?$/i.test(mod))alt=!0;else if(/^(c|ctrl|control)$/i.test(mod))ctrl=!0;else{if(!/^s(hift)?$/i.test(mod))throw new Error("Unrecognized modifier name: "+mod);shift=!0}}return alt&&(name="Alt-"+name),ctrl&&(name="Ctrl-"+name),cmd&&(name="Cmd-"+name),shift&&(name="Shift-"+name),name}function normalizeKeyMap(keymap){var copy={};for(var keyname in keymap)if(keymap.hasOwnProperty(keyname)){var value=keymap[keyname];if(/^(name|fallthrough|(de|at)tach)$/.test(keyname))continue;if("..."==value){delete keymap[keyname];continue}for(var keys=map(keyname.split(" "),normalizeKeyName),i=0;i<keys.length;i++){var val=void 0,name=void 0;i==keys.length-1?(name=keys.join(" "),val=value):(name=keys.slice(0,i+1).join(" "),val="...");var prev=copy[name];if(prev){if(prev!=val)throw new Error("Inconsistent bindings for "+name)}else copy[name]=val}delete keymap[keyname]}for(var prop in copy)keymap[prop]=copy[prop];return keymap}function lookupKey(key,map$$1,handle,context){var found=(map$$1=getKeyMap(map$$1)).call?map$$1.call(key,context):map$$1[key];if(!1===found)return"nothing";if("..."===found)return"multi";if(null!=found&&handle(found))return"handled";if(map$$1.fallthrough){if("[object Array]"!=Object.prototype.toString.call(map$$1.fallthrough))return lookupKey(key,map$$1.fallthrough,handle,context);for(var i=0;i<map$$1.fallthrough.length;i++){var result=lookupKey(key,map$$1.fallthrough[i],handle,context);if(result)return result}}}function isModifierKey(value){var name="string"==typeof value?value:keyNames[value.keyCode];return"Ctrl"==name||"Alt"==name||"Shift"==name||"Mod"==name}function addModifierNames(name,event,noShift){var base=name;return event.altKey&&"Alt"!=base&&(name="Alt-"+name),(flipCtrlCmd?event.metaKey:event.ctrlKey)&&"Ctrl"!=base&&(name="Ctrl-"+name),(flipCtrlCmd?event.ctrlKey:event.metaKey)&&"Cmd"!=base&&(name="Cmd-"+name),!noShift&&event.shiftKey&&"Shift"!=base&&(name="Shift-"+name),name}function keyName(event,noShift){if(presto&&34==event.keyCode&&event.char)return!1;var name=keyNames[event.keyCode];return null!=name&&!event.altGraphKey&&addModifierNames(name,event,noShift)}function getKeyMap(val){return"string"==typeof val?keyMap[val]:val}function deleteNearSelection(cm,compute){for(var ranges=cm.doc.sel.ranges,kill=[],i=0;i<ranges.length;i++){for(var toKill=compute(ranges[i]);kill.length&&cmp(toKill.from,lst(kill).to)<=0;){var replaced=kill.pop();if(cmp(replaced.from,toKill.from)<0){toKill.from=replaced.from;break}}kill.push(toKill)}runInOp(cm,function(){for(var i=kill.length-1;i>=0;i--)replaceRange(cm.doc,"",kill[i].from,kill[i].to,"+delete");ensureCursorVisible(cm)})}function lineStart(cm,lineN){var line=getLine(cm.doc,lineN),visual=visualLine(line);return visual!=line&&(lineN=lineNo(visual)),endOfLine(!0,cm,visual,lineN,1)}function lineEnd(cm,lineN){var line=getLine(cm.doc,lineN),visual=visualLineEnd(line);return visual!=line&&(lineN=lineNo(visual)),endOfLine(!0,cm,line,lineN,-1)}function lineStartSmart(cm,pos){var start=lineStart(cm,pos.line),line=getLine(cm.doc,start.line),order=getOrder(line,cm.doc.direction);if(!order||0==order[0].level){var firstNonWS=Math.max(0,line.text.search(/\S/)),inWS=pos.line==start.line&&pos.ch<=firstNonWS&&pos.ch;return Pos(start.line,inWS?0:firstNonWS,start.sticky)}return start}function doHandleBinding(cm,bound,dropShift){if("string"==typeof bound&&!(bound=commands[bound]))return!1;cm.display.input.ensurePolled();var prevShift=cm.display.shift,done=!1;try{cm.isReadOnly()&&(cm.state.suppressEdits=!0),dropShift&&(cm.display.shift=!1),done=bound(cm)!=Pass}finally{cm.display.shift=prevShift,cm.state.suppressEdits=!1}return done}function lookupKeyForEditor(cm,name,handle){for(var i=0;i<cm.state.keyMaps.length;i++){var result=lookupKey(name,cm.state.keyMaps[i],handle,cm);if(result)return result}return cm.options.extraKeys&&lookupKey(name,cm.options.extraKeys,handle,cm)||lookupKey(name,cm.options.keyMap,handle,cm)}function dispatchKey(cm,name,e,handle){var seq=cm.state.keySeq;if(seq){if(isModifierKey(name))return"handled";stopSeq.set(50,function(){cm.state.keySeq==seq&&(cm.state.keySeq=null,cm.display.input.reset())}),name=seq+" "+name}var result=lookupKeyForEditor(cm,name,handle);return"multi"==result&&(cm.state.keySeq=name),"handled"==result&&signalLater(cm,"keyHandled",cm,name,e),"handled"!=result&&"multi"!=result||(e_preventDefault(e),restartBlink(cm)),seq&&!result&&/\'$/.test(name)?(e_preventDefault(e),!0):!!result}function handleKeyBinding(cm,e){var name=keyName(e,!0);return!!name&&(e.shiftKey&&!cm.state.keySeq?dispatchKey(cm,"Shift-"+name,e,function(b){return doHandleBinding(cm,b,!0)})||dispatchKey(cm,name,e,function(b){if("string"==typeof b?/^go[A-Z]/.test(b):b.motion)return doHandleBinding(cm,b)}):dispatchKey(cm,name,e,function(b){return doHandleBinding(cm,b)}))}function handleCharBinding(cm,e,ch){return dispatchKey(cm,"'"+ch+"'",e,function(b){return doHandleBinding(cm,b,!0)})}function onKeyDown(e){var cm=this;if(cm.curOp.focus=activeElt(),!signalDOMEvent(cm,e)){ie&&ie_version<11&&27==e.keyCode&&(e.returnValue=!1);var code=e.keyCode;cm.display.shift=16==code||e.shiftKey;var handled=handleKeyBinding(cm,e);presto&&(lastStoppedKey=handled?code:null,!handled&&88==code&&!hasCopyEvent&&(mac?e.metaKey:e.ctrlKey)&&cm.replaceSelection("",null,"cut")),18!=code||/\bCodeMirror-crosshair\b/.test(cm.display.lineDiv.className)||showCrossHair(cm)}}function showCrossHair(cm){function up(e){18!=e.keyCode&&e.altKey||(rmClass(lineDiv,"CodeMirror-crosshair"),off(document,"keyup",up),off(document,"mouseover",up))}var lineDiv=cm.display.lineDiv;addClass(lineDiv,"CodeMirror-crosshair"),on(document,"keyup",up),on(document,"mouseover",up)}function onKeyUp(e){16==e.keyCode&&(this.doc.sel.shift=!1),signalDOMEvent(this,e)}function onKeyPress(e){var cm=this;if(!(eventInWidget(cm.display,e)||signalDOMEvent(cm,e)||e.ctrlKey&&!e.altKey||mac&&e.metaKey)){var keyCode=e.keyCode,charCode=e.charCode;if(presto&&keyCode==lastStoppedKey)return lastStoppedKey=null,void e_preventDefault(e);if(!presto||e.which&&!(e.which<10)||!handleKeyBinding(cm,e)){var ch=String.fromCharCode(null==charCode?keyCode:charCode);"\b"!=ch&&(handleCharBinding(cm,e,ch)||cm.display.input.onKeyPress(e))}}}function clickRepeat(pos,button){var now=+new Date;return lastDoubleClick&&lastDoubleClick.compare(now,pos,button)?(lastClick=lastDoubleClick=null,"triple"):lastClick&&lastClick.compare(now,pos,button)?(lastDoubleClick=new PastClick(now,pos,button),lastClick=null,"double"):(lastClick=new PastClick(now,pos,button),lastDoubleClick=null,"single")}function onMouseDown(e){var cm=this,display=cm.display;if(!(signalDOMEvent(cm,e)||display.activeTouch&&display.input.supportsTouch()))if(display.input.ensurePolled(),display.shift=e.shiftKey,eventInWidget(display,e))webkit||(display.scroller.draggable=!1,setTimeout(function(){return display.scroller.draggable=!0},100));else if(!clickInGutter(cm,e)){var pos=posFromMouse(cm,e),button=e_button(e),repeat=pos?clickRepeat(pos,button):"single";window.focus(),1==button&&cm.state.selectingText&&cm.state.selectingText(e),pos&&handleMappedButton(cm,button,pos,repeat,e)||(1==button?pos?leftButtonDown(cm,pos,repeat,e):e_target(e)==display.scroller&&e_preventDefault(e):2==button?(pos&&extendSelection(cm.doc,pos),setTimeout(function(){return display.input.focus()},20)):3==button&&(captureRightClick?onContextMenu(cm,e):delayBlurEvent(cm)))}}function handleMappedButton(cm,button,pos,repeat,event){var name="Click";return"double"==repeat?name="Double"+name:"triple"==repeat&&(name="Triple"+name),name=(1==button?"Left":2==button?"Middle":"Right")+name,dispatchKey(cm,addModifierNames(name,event),event,function(bound){if("string"==typeof bound&&(bound=commands[bound]),!bound)return!1;var done=!1;try{cm.isReadOnly()&&(cm.state.suppressEdits=!0),done=bound(cm,pos)!=Pass}finally{cm.state.suppressEdits=!1}return done})}function configureMouse(cm,repeat,event){var option=cm.getOption("configureMouse"),value=option?option(cm,repeat,event):{};if(null==value.unit){var rect=chromeOS?event.shiftKey&&event.metaKey:event.altKey;value.unit=rect?"rectangle":"single"==repeat?"char":"double"==repeat?"word":"line"}return(null==value.extend||cm.doc.extend)&&(value.extend=cm.doc.extend||event.shiftKey),null==value.addNew&&(value.addNew=mac?event.metaKey:event.ctrlKey),null==value.moveOnDrag&&(value.moveOnDrag=!(mac?event.altKey:event.ctrlKey)),value}function leftButtonDown(cm,pos,repeat,event){ie?setTimeout(bind(ensureFocus,cm),0):cm.curOp.focus=activeElt();var contained,behavior=configureMouse(cm,repeat,event),sel=cm.doc.sel;cm.options.dragDrop&&dragAndDrop&&!cm.isReadOnly()&&"single"==repeat&&(contained=sel.contains(pos))>-1&&(cmp((contained=sel.ranges[contained]).from(),pos)<0||pos.xRel>0)&&(cmp(contained.to(),pos)>0||pos.xRel<0)?leftButtonStartDrag(cm,event,pos,behavior):leftButtonSelect(cm,event,pos,behavior)}function leftButtonStartDrag(cm,event,pos,behavior){var display=cm.display,moved=!1,dragEnd=operation(cm,function(e){webkit&&(display.scroller.draggable=!1),cm.state.draggingText=!1,off(document,"mouseup",dragEnd),off(document,"mousemove",mouseMove),off(display.scroller,"dragstart",dragStart),off(display.scroller,"drop",dragEnd),moved||(e_preventDefault(e),behavior.addNew||extendSelection(cm.doc,pos,null,null,behavior.extend),webkit||ie&&9==ie_version?setTimeout(function(){document.body.focus(),display.input.focus()},20):display.input.focus())}),mouseMove=function(e2){moved=moved||Math.abs(event.clientX-e2.clientX)+Math.abs(event.clientY-e2.clientY)>=10},dragStart=function(){return moved=!0};webkit&&(display.scroller.draggable=!0),cm.state.draggingText=dragEnd,dragEnd.copy=!behavior.moveOnDrag,display.scroller.dragDrop&&display.scroller.dragDrop(),on(document,"mouseup",dragEnd),on(document,"mousemove",mouseMove),on(display.scroller,"dragstart",dragStart),on(display.scroller,"drop",dragEnd),delayBlurEvent(cm),setTimeout(function(){return display.input.focus()},20)}function rangeForUnit(cm,pos,unit){if("char"==unit)return new Range(pos,pos);if("word"==unit)return cm.findWordAt(pos);if("line"==unit)return new Range(Pos(pos.line,0),clipPos(cm.doc,Pos(pos.line+1,0)));var result=unit(cm,pos);return new Range(result.from,result.to)}function leftButtonSelect(cm,event,start,behavior){function extendTo(pos){if(0!=cmp(lastPos,pos))if(lastPos=pos,"rectangle"==behavior.unit){for(var ranges=[],tabSize=cm.options.tabSize,startCol=countColumn(getLine(doc,start.line).text,start.ch,tabSize),posCol=countColumn(getLine(doc,pos.line).text,pos.ch,tabSize),left=Math.min(startCol,posCol),right=Math.max(startCol,posCol),line=Math.min(start.line,pos.line),end=Math.min(cm.lastLine(),Math.max(start.line,pos.line));line<=end;line++){var text=getLine(doc,line).text,leftPos=findColumn(text,left,tabSize);left==right?ranges.push(new Range(Pos(line,leftPos),Pos(line,leftPos))):text.length>leftPos&&ranges.push(new Range(Pos(line,leftPos),Pos(line,findColumn(text,right,tabSize))))}ranges.length||ranges.push(new Range(start,start)),setSelection(doc,normalizeSelection(startSel.ranges.slice(0,ourIndex).concat(ranges),ourIndex),{origin:"*mouse",scroll:!1}),cm.scrollIntoView(pos)}else{var head,oldRange=ourRange,range$$1=rangeForUnit(cm,pos,behavior.unit),anchor=oldRange.anchor;cmp(range$$1.anchor,anchor)>0?(head=range$$1.head,anchor=minPos(oldRange.from(),range$$1.anchor)):(head=range$$1.anchor,anchor=maxPos(oldRange.to(),range$$1.head));var ranges$1=startSel.ranges.slice(0);ranges$1[ourIndex]=new Range(clipPos(doc,anchor),head),setSelection(doc,normalizeSelection(ranges$1,ourIndex),sel_mouse)}}function extend(e){var curCount=++counter,cur=posFromMouse(cm,e,!0,"rectangle"==behavior.unit);if(cur)if(0!=cmp(cur,lastPos)){cm.curOp.focus=activeElt(),extendTo(cur);var visible=visibleLines(display,doc);(cur.line>=visible.to||cur.line<visible.from)&&setTimeout(operation(cm,function(){counter==curCount&&extend(e)}),150)}else{var outside=e.clientY<editorSize.top?-20:e.clientY>editorSize.bottom?20:0;outside&&setTimeout(operation(cm,function(){counter==curCount&&(display.scroller.scrollTop+=outside,extend(e))}),50)}}function done(e){cm.state.selectingText=!1,counter=1/0,e_preventDefault(e),display.input.focus(),off(document,"mousemove",move),off(document,"mouseup",up),doc.history.lastSelOrigin=null}var display=cm.display,doc=cm.doc;e_preventDefault(event);var ourRange,ourIndex,startSel=doc.sel,ranges=startSel.ranges;if(behavior.addNew&&!behavior.extend?(ourIndex=doc.sel.contains(start),ourRange=ourIndex>-1?ranges[ourIndex]:new Range(start,start)):(ourRange=doc.sel.primary(),ourIndex=doc.sel.primIndex),"rectangle"==behavior.unit)behavior.addNew||(ourRange=new Range(start,start)),start=posFromMouse(cm,event,!0,!0),ourIndex=-1;else{var range$$1=rangeForUnit(cm,start,behavior.unit);ourRange=behavior.extend?extendRange(ourRange,range$$1.anchor,range$$1.head,behavior.extend):range$$1}behavior.addNew?-1==ourIndex?(ourIndex=ranges.length,setSelection(doc,normalizeSelection(ranges.concat([ourRange]),ourIndex),{scroll:!1,origin:"*mouse"})):ranges.length>1&&ranges[ourIndex].empty()&&"char"==behavior.unit&&!behavior.extend?(setSelection(doc,normalizeSelection(ranges.slice(0,ourIndex).concat(ranges.slice(ourIndex+1)),0),{scroll:!1,origin:"*mouse"}),startSel=doc.sel):replaceOneSelection(doc,ourIndex,ourRange,sel_mouse):(ourIndex=0,setSelection(doc,new Selection([ourRange],0),sel_mouse),startSel=doc.sel);var lastPos=start,editorSize=display.wrapper.getBoundingClientRect(),counter=0,move=operation(cm,function(e){e_button(e)?extend(e):done(e)}),up=operation(cm,done);cm.state.selectingText=up,on(document,"mousemove",move),on(document,"mouseup",up)}function gutterEvent(cm,e,type,prevent){var mX,mY;try{mX=e.clientX,mY=e.clientY}catch(e){return!1}if(mX>=Math.floor(cm.display.gutters.getBoundingClientRect().right))return!1;prevent&&e_preventDefault(e);var display=cm.display,lineBox=display.lineDiv.getBoundingClientRect();if(mY>lineBox.bottom||!hasHandler(cm,type))return e_defaultPrevented(e);mY-=lineBox.top-display.viewOffset;for(var i=0;i<cm.options.gutters.length;++i){var g=display.gutters.childNodes[i];if(g&&g.getBoundingClientRect().right>=mX)return signal(cm,type,cm,lineAtHeight(cm.doc,mY),cm.options.gutters[i],e),e_defaultPrevented(e)}}function clickInGutter(cm,e){return gutterEvent(cm,e,"gutterClick",!0)}function onContextMenu(cm,e){eventInWidget(cm.display,e)||contextMenuInGutter(cm,e)||signalDOMEvent(cm,e,"contextmenu")||cm.display.input.onContextMenu(e)}function contextMenuInGutter(cm,e){return!!hasHandler(cm,"gutterContextMenu")&&gutterEvent(cm,e,"gutterContextMenu",!1)}function themeChanged(cm){cm.display.wrapper.className=cm.display.wrapper.className.replace(/\s*cm-s-\S+/g,"")+cm.options.theme.replace(/(^|\s)\s*/g," cm-s-"),clearCaches(cm)}function guttersChanged(cm){updateGutters(cm),regChange(cm),alignHorizontally(cm)}function dragDropChanged(cm,value,old){if(!value!=!(old&&old!=Init)){var funcs=cm.display.dragFunctions,toggle=value?on:off;toggle(cm.display.scroller,"dragstart",funcs.start),toggle(cm.display.scroller,"dragenter",funcs.enter),toggle(cm.display.scroller,"dragover",funcs.over),toggle(cm.display.scroller,"dragleave",funcs.leave),toggle(cm.display.scroller,"drop",funcs.drop)}}function wrappingChanged(cm){cm.options.lineWrapping?(addClass(cm.display.wrapper,"CodeMirror-wrap"),cm.display.sizer.style.minWidth="",cm.display.sizerWidth=null):(rmClass(cm.display.wrapper,"CodeMirror-wrap"),findMaxLine(cm)),estimateLineHeights(cm),regChange(cm),clearCaches(cm),setTimeout(function(){return updateScrollbars(cm)},100)}function CodeMirror$1(place,options){var this$1=this;if(!(this instanceof CodeMirror$1))return new CodeMirror$1(place,options);this.options=options=options?copyObj(options):{},copyObj(defaults,options,!1),setGuttersForLineNumbers(options);var doc=options.value;"string"==typeof doc&&(doc=new Doc(doc,options.mode,null,options.lineSeparator,options.direction)),this.doc=doc;var input=new CodeMirror$1.inputStyles[options.inputStyle](this),display=this.display=new Display(place,doc,input);display.wrapper.CodeMirror=this,updateGutters(this),themeChanged(this),options.lineWrapping&&(this.display.wrapper.className+=" CodeMirror-wrap"),initScrollbars(this),this.state={keyMaps:[],overlays:[],modeGen:0,overwrite:!1,delayingBlurEvent:!1,focused:!1,suppressEdits:!1,pasteIncoming:!1,cutIncoming:!1,selectingText:!1,draggingText:!1,highlight:new Delayed,keySeq:null,specialChars:null},options.autofocus&&!mobile&&display.input.focus(),ie&&ie_version<11&&setTimeout(function(){return this$1.display.input.reset(!0)},20),registerEventHandlers(this),ensureGlobalHandlers(),startOperation(this),this.curOp.forceUpdate=!0,attachDoc(this,doc),options.autofocus&&!mobile||this.hasFocus()?setTimeout(bind(onFocus,this),20):onBlur(this);for(var opt in optionHandlers)optionHandlers.hasOwnProperty(opt)&&optionHandlers[opt](this$1,options[opt],Init);maybeUpdateLineNumberWidth(this),options.finishInit&&options.finishInit(this);for(var i=0;i<initHooks.length;++i)initHooks[i](this$1);endOperation(this),webkit&&options.lineWrapping&&"optimizelegibility"==getComputedStyle(display.lineDiv).textRendering&&(display.lineDiv.style.textRendering="auto")}function registerEventHandlers(cm){function finishTouch(){d.activeTouch&&(touchFinished=setTimeout(function(){return d.activeTouch=null},1e3),(prevTouch=d.activeTouch).end=+new Date)}function isMouseLikeTouchEvent(e){if(1!=e.touches.length)return!1;var touch=e.touches[0];return touch.radiusX<=1&&touch.radiusY<=1}function farAway(touch,other){if(null==other.left)return!0;var dx=other.left-touch.left,dy=other.top-touch.top;return dx*dx+dy*dy>400}var d=cm.display;on(d.scroller,"mousedown",operation(cm,onMouseDown)),ie&&ie_version<11?on(d.scroller,"dblclick",operation(cm,function(e){if(!signalDOMEvent(cm,e)){var pos=posFromMouse(cm,e);if(pos&&!clickInGutter(cm,e)&&!eventInWidget(cm.display,e)){e_preventDefault(e);var word=cm.findWordAt(pos);extendSelection(cm.doc,word.anchor,word.head)}}})):on(d.scroller,"dblclick",function(e){return signalDOMEvent(cm,e)||e_preventDefault(e)}),captureRightClick||on(d.scroller,"contextmenu",function(e){return onContextMenu(cm,e)});var touchFinished,prevTouch={end:0};on(d.scroller,"touchstart",function(e){if(!signalDOMEvent(cm,e)&&!isMouseLikeTouchEvent(e)){d.input.ensurePolled(),clearTimeout(touchFinished);var now=+new Date;d.activeTouch={start:now,moved:!1,prev:now-prevTouch.end<=300?prevTouch:null},1==e.touches.length&&(d.activeTouch.left=e.touches[0].pageX,d.activeTouch.top=e.touches[0].pageY)}}),on(d.scroller,"touchmove",function(){d.activeTouch&&(d.activeTouch.moved=!0)}),on(d.scroller,"touchend",function(e){var touch=d.activeTouch;if(touch&&!eventInWidget(d,e)&&null!=touch.left&&!touch.moved&&new Date-touch.start<300){var range,pos=cm.coordsChar(d.activeTouch,"page");range=!touch.prev||farAway(touch,touch.prev)?new Range(pos,pos):!touch.prev.prev||farAway(touch,touch.prev.prev)?cm.findWordAt(pos):new Range(Pos(pos.line,0),clipPos(cm.doc,Pos(pos.line+1,0))),cm.setSelection(range.anchor,range.head),cm.focus(),e_preventDefault(e)}finishTouch()}),on(d.scroller,"touchcancel",finishTouch),on(d.scroller,"scroll",function(){d.scroller.clientHeight&&(updateScrollTop(cm,d.scroller.scrollTop),setScrollLeft(cm,d.scroller.scrollLeft,!0),signal(cm,"scroll",cm))}),on(d.scroller,"mousewheel",function(e){return onScrollWheel(cm,e)}),on(d.scroller,"DOMMouseScroll",function(e){return onScrollWheel(cm,e)}),on(d.wrapper,"scroll",function(){return d.wrapper.scrollTop=d.wrapper.scrollLeft=0}),d.dragFunctions={enter:function(e){signalDOMEvent(cm,e)||e_stop(e)},over:function(e){signalDOMEvent(cm,e)||(onDragOver(cm,e),e_stop(e))},start:function(e){return onDragStart(cm,e)},drop:operation(cm,onDrop),leave:function(e){signalDOMEvent(cm,e)||clearDragCursor(cm)}};var inp=d.input.getField();on(inp,"keyup",function(e){return onKeyUp.call(cm,e)}),on(inp,"keydown",operation(cm,onKeyDown)),on(inp,"keypress",operation(cm,onKeyPress)),on(inp,"focus",function(e){return onFocus(cm,e)}),on(inp,"blur",function(e){return onBlur(cm,e)})}function indentLine(cm,n,how,aggressive){var state,doc=cm.doc;null==how&&(how="add"),"smart"==how&&(doc.mode.indent?state=getContextBefore(cm,n).state:how="prev");var tabSize=cm.options.tabSize,line=getLine(doc,n),curSpace=countColumn(line.text,null,tabSize);line.stateAfter&&(line.stateAfter=null);var indentation,curSpaceString=line.text.match(/^\s*/)[0];if(aggressive||/\S/.test(line.text)){if("smart"==how&&((indentation=doc.mode.indent(state,line.text.slice(curSpaceString.length),line.text))==Pass||indentation>150)){if(!aggressive)return;how="prev"}}else indentation=0,how="not";"prev"==how?indentation=n>doc.first?countColumn(getLine(doc,n-1).text,null,tabSize):0:"add"==how?indentation=curSpace+cm.options.indentUnit:"subtract"==how?indentation=curSpace-cm.options.indentUnit:"number"==typeof how&&(indentation=curSpace+how),indentation=Math.max(0,indentation);var indentString="",pos=0;if(cm.options.indentWithTabs)for(var i=Math.floor(indentation/tabSize);i;--i)pos+=tabSize,indentString+="\t";if(pos<indentation&&(indentString+=spaceStr(indentation-pos)),indentString!=curSpaceString)return replaceRange(doc,indentString,Pos(n,0),Pos(n,curSpaceString.length),"+input"),line.stateAfter=null,!0;for(var i$1=0;i$1<doc.sel.ranges.length;i$1++){var range=doc.sel.ranges[i$1];if(range.head.line==n&&range.head.ch<curSpaceString.length){var pos$1=Pos(n,curSpaceString.length);replaceOneSelection(doc,i$1,new Range(pos$1,pos$1));break}}}function setLastCopied(newLastCopied){lastCopied=newLastCopied}function applyTextInput(cm,inserted,deleted,sel,origin){var doc=cm.doc;cm.display.shift=!1,sel||(sel=doc.sel);var paste=cm.state.pasteIncoming||"paste"==origin,textLines=splitLinesAuto(inserted),multiPaste=null;if(paste&&sel.ranges.length>1)if(lastCopied&&lastCopied.text.join("\n")==inserted){if(sel.ranges.length%lastCopied.text.length==0){multiPaste=[];for(var i=0;i<lastCopied.text.length;i++)multiPaste.push(doc.splitLines(lastCopied.text[i]))}}else textLines.length==sel.ranges.length&&cm.options.pasteLinesPerSelection&&(multiPaste=map(textLines,function(l){return[l]}));for(var updateInput,i$1=sel.ranges.length-1;i$1>=0;i$1--){var range$$1=sel.ranges[i$1],from=range$$1.from(),to=range$$1.to();range$$1.empty()&&(deleted&&deleted>0?from=Pos(from.line,from.ch-deleted):cm.state.overwrite&&!paste?to=Pos(to.line,Math.min(getLine(doc,to.line).text.length,to.ch+lst(textLines).length)):lastCopied&&lastCopied.lineWise&&lastCopied.text.join("\n")==inserted&&(from=to=Pos(from.line,0))),updateInput=cm.curOp.updateInput;var changeEvent={from:from,to:to,text:multiPaste?multiPaste[i$1%multiPaste.length]:textLines,origin:origin||(paste?"paste":cm.state.cutIncoming?"cut":"+input")};makeChange(cm.doc,changeEvent),signalLater(cm,"inputRead",cm,changeEvent)}inserted&&!paste&&triggerElectric(cm,inserted),ensureCursorVisible(cm),cm.curOp.updateInput=updateInput,cm.curOp.typing=!0,cm.state.pasteIncoming=cm.state.cutIncoming=!1}function handlePaste(e,cm){var pasted=e.clipboardData&&e.clipboardData.getData("Text");if(pasted)return e.preventDefault(),cm.isReadOnly()||cm.options.disableInput||runInOp(cm,function(){return applyTextInput(cm,pasted,0,null,"paste")}),!0}function triggerElectric(cm,inserted){if(cm.options.electricChars&&cm.options.smartIndent)for(var sel=cm.doc.sel,i=sel.ranges.length-1;i>=0;i--){var range$$1=sel.ranges[i];if(!(range$$1.head.ch>100||i&&sel.ranges[i-1].head.line==range$$1.head.line)){var mode=cm.getModeAt(range$$1.head),indented=!1;if(mode.electricChars){for(var j=0;j<mode.electricChars.length;j++)if(inserted.indexOf(mode.electricChars.charAt(j))>-1){indented=indentLine(cm,range$$1.head.line,"smart");break}}else mode.electricInput&&mode.electricInput.test(getLine(cm.doc,range$$1.head.line).text.slice(0,range$$1.head.ch))&&(indented=indentLine(cm,range$$1.head.line,"smart"));indented&&signalLater(cm,"electricInput",cm,range$$1.head.line)}}}function copyableRanges(cm){for(var text=[],ranges=[],i=0;i<cm.doc.sel.ranges.length;i++){var line=cm.doc.sel.ranges[i].head.line,lineRange={anchor:Pos(line,0),head:Pos(line+1,0)};ranges.push(lineRange),text.push(cm.getRange(lineRange.anchor,lineRange.head))}return{text:text,ranges:ranges}}function disableBrowserMagic(field,spellcheck){field.setAttribute("autocorrect","off"),field.setAttribute("autocapitalize","off"),field.setAttribute("spellcheck",!!spellcheck)}function hiddenTextarea(){var te=elt("textarea",null,null,"position: absolute; bottom: -1em; padding: 0; width: 1px; height: 1em; outline: none"),div=elt("div",[te],null,"overflow: hidden; position: relative; width: 3px; height: 0px;");return webkit?te.style.width="1000px":te.setAttribute("wrap","off"),ios&&(te.style.border="1px solid black"),disableBrowserMagic(te),div}function findPosH(doc,pos,dir,unit,visually){function findNextLine(){var l=pos.line+dir;return!(l<doc.first||l>=doc.first+doc.size)&&(pos=new Pos(l,pos.ch,pos.sticky),lineObj=getLine(doc,l))}function moveOnce(boundToLine){var next;if(null==(next=visually?moveVisually(doc.cm,lineObj,pos,dir):moveLogically(lineObj,pos,dir))){if(boundToLine||!findNextLine())return!1;pos=endOfLine(visually,doc.cm,lineObj,pos.line,dir)}else pos=next;return!0}var oldPos=pos,origDir=dir,lineObj=getLine(doc,pos.line);if("char"==unit)moveOnce();else if("column"==unit)moveOnce(!0);else if("word"==unit||"group"==unit)for(var sawType=null,group="group"==unit,helper=doc.cm&&doc.cm.getHelper(pos,"wordChars"),first=!0;!(dir<0)||moveOnce(!first);first=!1){var cur=lineObj.text.charAt(pos.ch)||"\n",type=isWordChar(cur,helper)?"w":group&&"\n"==cur?"n":!group||/\s/.test(cur)?null:"p";if(!group||first||type||(type="s"),sawType&&sawType!=type){dir<0&&(dir=1,moveOnce(),pos.sticky="after");break}if(type&&(sawType=type),dir>0&&!moveOnce(!first))break}var result=skipAtomic(doc,pos,oldPos,origDir,!0);return equalCursorPos(oldPos,result)&&(result.hitSide=!0),result}function findPosV(cm,pos,dir,unit){var y,doc=cm.doc,x=pos.left;if("page"==unit){var pageSize=Math.min(cm.display.wrapper.clientHeight,window.innerHeight||document.documentElement.clientHeight),moveAmount=Math.max(pageSize-.5*textHeight(cm.display),3);y=(dir>0?pos.bottom:pos.top)+dir*moveAmount}else"line"==unit&&(y=dir>0?pos.bottom+3:pos.top-3);for(var target;(target=coordsChar(cm,x,y)).outside;){if(dir<0?y<=0:y>=doc.height){target.hitSide=!0;break}y+=5*dir}return target}function posToDOM(cm,pos){var view=findViewForLine(cm,pos.line);if(!view||view.hidden)return null;var line=getLine(cm.doc,pos.line),info=mapFromLineView(view,line,pos.line),order=getOrder(line,cm.doc.direction),side="left";order&&(side=getBidiPartAt(order,pos.ch)%2?"right":"left");var result=nodeAndOffsetInLineMap(info.map,pos.ch,side);return result.offset="right"==result.collapse?result.end:result.start,result}function isInGutter(node){for(var scan=node;scan;scan=scan.parentNode)if(/CodeMirror-gutter-wrapper/.test(scan.className))return!0;return!1}function badPos(pos,bad){return bad&&(pos.bad=!0),pos}function domTextBetween(cm,from,to,fromLine,toLine){function recognizeMarker(id){return function(marker){return marker.id==id}}function close(){closing&&(text+=lineSep,closing=!1)}function addText(str){str&&(close(),text+=str)}function walk(node){if(1==node.nodeType){var cmText=node.getAttribute("cm-text");if(null!=cmText)return void addText(cmText||node.textContent.replace(/\u200b/g,""));var range$$1,markerID=node.getAttribute("cm-marker");if(markerID){var found=cm.findMarks(Pos(fromLine,0),Pos(toLine+1,0),recognizeMarker(+markerID));return void(found.length&&(range$$1=found[0].find())&&addText(getBetween(cm.doc,range$$1.from,range$$1.to).join(lineSep)))}if("false"==node.getAttribute("contenteditable"))return;var isBlock=/^(pre|div|p)$/i.test(node.nodeName);isBlock&&close();for(var i=0;i<node.childNodes.length;i++)walk(node.childNodes[i]);isBlock&&(closing=!0)}else 3==node.nodeType&&addText(node.nodeValue)}for(var text="",closing=!1,lineSep=cm.doc.lineSeparator();walk(from),from!=to;)from=from.nextSibling;return text}function domToPos(cm,node,offset){var lineNode;if(node==cm.display.lineDiv){if(!(lineNode=cm.display.lineDiv.childNodes[offset]))return badPos(cm.clipPos(Pos(cm.display.viewTo-1)),!0);node=null,offset=0}else for(lineNode=node;;lineNode=lineNode.parentNode){if(!lineNode||lineNode==cm.display.lineDiv)return null;if(lineNode.parentNode&&lineNode.parentNode==cm.display.lineDiv)break}for(var i=0;i<cm.display.view.length;i++){var lineView=cm.display.view[i];if(lineView.node==lineNode)return locateNodeInLineView(lineView,node,offset)}}function locateNodeInLineView(lineView,node,offset){function find(textNode,topNode,offset){for(var i=-1;i<(maps?maps.length:0);i++)for(var map$$1=i<0?measure.map:maps[i],j=0;j<map$$1.length;j+=3){var curNode=map$$1[j+2];if(curNode==textNode||curNode==topNode){var line=lineNo(i<0?lineView.line:lineView.rest[i]),ch=map$$1[j]+offset;return(offset<0||curNode!=textNode)&&(ch=map$$1[j+(offset?1:0)]),Pos(line,ch)}}}var wrapper=lineView.text.firstChild,bad=!1;if(!node||!contains(wrapper,node))return badPos(Pos(lineNo(lineView.line),0),!0);if(node==wrapper&&(bad=!0,node=wrapper.childNodes[offset],offset=0,!node)){var line=lineView.rest?lst(lineView.rest):lineView.line;return badPos(Pos(lineNo(line),line.text.length),bad)}var textNode=3==node.nodeType?node:null,topNode=node;for(textNode||1!=node.childNodes.length||3!=node.firstChild.nodeType||(textNode=node.firstChild,offset&&(offset=textNode.nodeValue.length));topNode.parentNode!=wrapper;)topNode=topNode.parentNode;var measure=lineView.measure,maps=measure.maps,found=find(textNode,topNode,offset);if(found)return badPos(found,bad);for(var after=topNode.nextSibling,dist=textNode?textNode.nodeValue.length-offset:0;after;after=after.nextSibling){if(found=find(after,after.firstChild,0))return badPos(Pos(found.line,found.ch-dist),bad);dist+=after.textContent.length}for(var before=topNode.previousSibling,dist$1=offset;before;before=before.previousSibling){if(found=find(before,before.firstChild,-1))return badPos(Pos(found.line,found.ch+dist$1),bad);dist$1+=before.textContent.length}}var userAgent=navigator.userAgent,platform=navigator.platform,gecko=/gecko\/\d/i.test(userAgent),ie_upto10=/MSIE \d/.test(userAgent),ie_11up=/Trident\/(?:[7-9]|\d{2,})\..*rv:(\d+)/.exec(userAgent),edge=/Edge\/(\d+)/.exec(userAgent),ie=ie_upto10||ie_11up||edge,ie_version=ie&&(ie_upto10?document.documentMode||6:+(edge||ie_11up)[1]),webkit=!edge&&/WebKit\//.test(userAgent),qtwebkit=webkit&&/Qt\/\d+\.\d+/.test(userAgent),chrome=!edge&&/Chrome\//.test(userAgent),presto=/Opera\//.test(userAgent),safari=/Apple Computer/.test(navigator.vendor),mac_geMountainLion=/Mac OS X 1\d\D([8-9]|\d\d)\D/.test(userAgent),phantom=/PhantomJS/.test(userAgent),ios=!edge&&/AppleWebKit/.test(userAgent)&&/Mobile\/\w+/.test(userAgent),android=/Android/.test(userAgent),mobile=ios||android||/webOS|BlackBerry|Opera Mini|Opera Mobi|IEMobile/i.test(userAgent),mac=ios||/Mac/.test(platform),chromeOS=/\bCrOS\b/.test(userAgent),windows=/win/i.test(platform),presto_version=presto&&userAgent.match(/Version\/(\d*\.\d*)/);presto_version&&(presto_version=Number(presto_version[1])),presto_version&&presto_version>=15&&(presto=!1,webkit=!0);var range,flipCtrlCmd=mac&&(qtwebkit||presto&&(null==presto_version||presto_version<12.11)),captureRightClick=gecko||ie&&ie_version>=9,rmClass=function(node,cls){var current=node.className,match=classTest(cls).exec(current);if(match){var after=current.slice(match.index+match[0].length);node.className=current.slice(0,match.index)+(after?match[1]+after:"")}};range=document.createRange?function(node,start,end,endNode){var r=document.createRange();return r.setEnd(endNode||node,end),r.setStart(node,start),r}:function(node,start,end){var r=document.body.createTextRange();try{r.moveToElementText(node.parentNode)}catch(e){return r}return r.collapse(!0),r.moveEnd("character",end),r.moveStart("character",start),r};var selectInput=function(node){node.select()};ios?selectInput=function(node){node.selectionStart=0,node.selectionEnd=node.value.length}:ie&&(selectInput=function(node){try{node.select()}catch(_e){}});var Delayed=function(){this.id=null};Delayed.prototype.set=function(ms,f){clearTimeout(this.id),this.id=setTimeout(f,ms)};var zwspSupported,badBidiRects,scrollerGap=30,Pass={toString:function(){return"CodeMirror.Pass"}},sel_dontScroll={scroll:!1},sel_mouse={origin:"*mouse"},sel_move={origin:"+move"},spaceStrs=[""],nonASCIISingleCaseWordChar=/[\u00df\u0587\u0590-\u05f4\u0600-\u06ff\u3040-\u309f\u30a0-\u30ff\u3400-\u4db5\u4e00-\u9fcc\uac00-\ud7af]/,extendingChars=/[\u0300-\u036f\u0483-\u0489\u0591-\u05bd\u05bf\u05c1\u05c2\u05c4\u05c5\u05c7\u0610-\u061a\u064b-\u065e\u0670\u06d6-\u06dc\u06de-\u06e4\u06e7\u06e8\u06ea-\u06ed\u0711\u0730-\u074a\u07a6-\u07b0\u07eb-\u07f3\u0816-\u0819\u081b-\u0823\u0825-\u0827\u0829-\u082d\u0900-\u0902\u093c\u0941-\u0948\u094d\u0951-\u0955\u0962\u0963\u0981\u09bc\u09be\u09c1-\u09c4\u09cd\u09d7\u09e2\u09e3\u0a01\u0a02\u0a3c\u0a41\u0a42\u0a47\u0a48\u0a4b-\u0a4d\u0a51\u0a70\u0a71\u0a75\u0a81\u0a82\u0abc\u0ac1-\u0ac5\u0ac7\u0ac8\u0acd\u0ae2\u0ae3\u0b01\u0b3c\u0b3e\u0b3f\u0b41-\u0b44\u0b4d\u0b56\u0b57\u0b62\u0b63\u0b82\u0bbe\u0bc0\u0bcd\u0bd7\u0c3e-\u0c40\u0c46-\u0c48\u0c4a-\u0c4d\u0c55\u0c56\u0c62\u0c63\u0cbc\u0cbf\u0cc2\u0cc6\u0ccc\u0ccd\u0cd5\u0cd6\u0ce2\u0ce3\u0d3e\u0d41-\u0d44\u0d4d\u0d57\u0d62\u0d63\u0dca\u0dcf\u0dd2-\u0dd4\u0dd6\u0ddf\u0e31\u0e34-\u0e3a\u0e47-\u0e4e\u0eb1\u0eb4-\u0eb9\u0ebb\u0ebc\u0ec8-\u0ecd\u0f18\u0f19\u0f35\u0f37\u0f39\u0f71-\u0f7e\u0f80-\u0f84\u0f86\u0f87\u0f90-\u0f97\u0f99-\u0fbc\u0fc6\u102d-\u1030\u1032-\u1037\u1039\u103a\u103d\u103e\u1058\u1059\u105e-\u1060\u1071-\u1074\u1082\u1085\u1086\u108d\u109d\u135f\u1712-\u1714\u1732-\u1734\u1752\u1753\u1772\u1773\u17b7-\u17bd\u17c6\u17c9-\u17d3\u17dd\u180b-\u180d\u18a9\u1920-\u1922\u1927\u1928\u1932\u1939-\u193b\u1a17\u1a18\u1a56\u1a58-\u1a5e\u1a60\u1a62\u1a65-\u1a6c\u1a73-\u1a7c\u1a7f\u1b00-\u1b03\u1b34\u1b36-\u1b3a\u1b3c\u1b42\u1b6b-\u1b73\u1b80\u1b81\u1ba2-\u1ba5\u1ba8\u1ba9\u1c2c-\u1c33\u1c36\u1c37\u1cd0-\u1cd2\u1cd4-\u1ce0\u1ce2-\u1ce8\u1ced\u1dc0-\u1de6\u1dfd-\u1dff\u200c\u200d\u20d0-\u20f0\u2cef-\u2cf1\u2de0-\u2dff\u302a-\u302f\u3099\u309a\ua66f-\ua672\ua67c\ua67d\ua6f0\ua6f1\ua802\ua806\ua80b\ua825\ua826\ua8c4\ua8e0-\ua8f1\ua926-\ua92d\ua947-\ua951\ua980-\ua982\ua9b3\ua9b6-\ua9b9\ua9bc\uaa29-\uaa2e\uaa31\uaa32\uaa35\uaa36\uaa43\uaa4c\uaab0\uaab2-\uaab4\uaab7\uaab8\uaabe\uaabf\uaac1\uabe5\uabe8\uabed\udc00-\udfff\ufb1e\ufe00-\ufe0f\ufe20-\ufe26\uff9e\uff9f]/,sawReadOnlySpans=!1,sawCollapsedSpans=!1,bidiOther=null,bidiOrdering=function(){function charType(code){return code<=247?lowTypes.charAt(code):1424<=code&&code<=1524?"R":1536<=code&&code<=1785?arabicTypes.charAt(code-1536):1774<=code&&code<=2220?"r":8192<=code&&code<=8203?"w":8204==code?"b":"L"}function BidiSpan(level,from,to){this.level=level,this.from=from,this.to=to}var lowTypes="bbbbbbbbbtstwsbbbbbbbbbbbbbbssstwNN%%%NNNNNN,N,N1111111111NNNNNNNLLLLLLLLLLLLLLLLLLLLLLLLLLNNNNNNLLLLLLLLLLLLLLLLLLLLLLLLLLNNNNbbbbbbsbbbbbbbbbbbbbbbbbbbbbbbbbb,N%%%%NNNNLNNNNN%%11NLNNN1LNNNNNLLLLLLLLLLLLLLLLLLLLLLLNLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLN",arabicTypes="nnnnnnNNr%%r,rNNmmmmmmmmmmmrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrmmmmmmmmmmmmmmmmmmmmmnnnnnnnnnn%nnrrrmrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrmmmmmmmnNmmmmmmrrmmNmmmmrr1111111111",bidiRE=/[\u0590-\u05f4\u0600-\u06ff\u0700-\u08ac]/,isNeutral=/[stwN]/,isStrong=/[LRr]/,countsAsLeft=/[Lb1n]/,countsAsNum=/[1n]/;return function(str,direction){var outerType="ltr"==direction?"L":"R";if(0==str.length||"ltr"==direction&&!bidiRE.test(str))return!1;for(var len=str.length,types=[],i=0;i<len;++i)types.push(charType(str.charCodeAt(i)));for(var i$1=0,prev=outerType;i$1<len;++i$1){var type=types[i$1];"m"==type?types[i$1]=prev:prev=type}for(var i$2=0,cur=outerType;i$2<len;++i$2){var type$1=types[i$2];"1"==type$1&&"r"==cur?types[i$2]="n":isStrong.test(type$1)&&(cur=type$1,"r"==type$1&&(types[i$2]="R"))}for(var i$3=1,prev$1=types[0];i$3<len-1;++i$3){var type$2=types[i$3];"+"==type$2&&"1"==prev$1&&"1"==types[i$3+1]?types[i$3]="1":","!=type$2||prev$1!=types[i$3+1]||"1"!=prev$1&&"n"!=prev$1||(types[i$3]=prev$1),prev$1=type$2}for(var i$4=0;i$4<len;++i$4){var type$3=types[i$4];if(","==type$3)types[i$4]="N";else if("%"==type$3){var end=void 0;for(end=i$4+1;end<len&&"%"==types[end];++end);for(var replace=i$4&&"!"==types[i$4-1]||end<len&&"1"==types[end]?"1":"N",j=i$4;j<end;++j)types[j]=replace;i$4=end-1}}for(var i$5=0,cur$1=outerType;i$5<len;++i$5){var type$4=types[i$5];"L"==cur$1&&"1"==type$4?types[i$5]="L":isStrong.test(type$4)&&(cur$1=type$4)}for(var i$6=0;i$6<len;++i$6)if(isNeutral.test(types[i$6])){var end$1=void 0;for(end$1=i$6+1;end$1<len&&isNeutral.test(types[end$1]);++end$1);for(var before="L"==(i$6?types[i$6-1]:outerType),replace$1=before==("L"==(end$1<len?types[end$1]:outerType))?before?"L":"R":outerType,j$1=i$6;j$1<end$1;++j$1)types[j$1]=replace$1;i$6=end$1-1}for(var m,order=[],i$7=0;i$7<len;)if(countsAsLeft.test(types[i$7])){var start=i$7;for(++i$7;i$7<len&&countsAsLeft.test(types[i$7]);++i$7);order.push(new BidiSpan(0,start,i$7))}else{var pos=i$7,at=order.length;for(++i$7;i$7<len&&"L"!=types[i$7];++i$7);for(var j$2=pos;j$2<i$7;)if(countsAsNum.test(types[j$2])){pos<j$2&&order.splice(at,0,new BidiSpan(1,pos,j$2));var nstart=j$2;for(++j$2;j$2<i$7&&countsAsNum.test(types[j$2]);++j$2);order.splice(at,0,new BidiSpan(2,nstart,j$2)),pos=j$2}else++j$2;pos<i$7&&order.splice(at,0,new BidiSpan(1,pos,i$7))}return 1==order[0].level&&(m=str.match(/^\s+/))&&(order[0].from=m[0].length,order.unshift(new BidiSpan(0,0,m[0].length))),1==lst(order).level&&(m=str.match(/\s+$/))&&(lst(order).to-=m[0].length,order.push(new BidiSpan(0,len-m[0].length,len))),"rtl"==direction?order.reverse():order}}(),noHandlers=[],on=function(emitter,type,f){if(emitter.addEventListener)emitter.addEventListener(type,f,!1);else if(emitter.attachEvent)emitter.attachEvent("on"+type,f);else{var map$$1=emitter._handlers||(emitter._handlers={});map$$1[type]=(map$$1[type]||noHandlers).concat(f)}},dragAndDrop=function(){if(ie&&ie_version<9)return!1;var div=elt("div");return"draggable"in div||"dragDrop"in div}(),splitLinesAuto=3!="\n\nb".split(/\n/).length?function(string){for(var pos=0,result=[],l=string.length;pos<=l;){var nl=string.indexOf("\n",pos);-1==nl&&(nl=string.length);var line=string.slice(pos,"\r"==string.charAt(nl-1)?nl-1:nl),rt=line.indexOf("\r");-1!=rt?(result.push(line.slice(0,rt)),pos+=rt+1):(result.push(line),pos=nl+1)}return result}:function(string){return string.split(/\r\n?|\n/)},hasSelection=window.getSelection?function(te){try{return te.selectionStart!=te.selectionEnd}catch(e){return!1}}:function(te){var range$$1;try{range$$1=te.ownerDocument.selection.createRange()}catch(e){}return!(!range$$1||range$$1.parentElement()!=te)&&0!=range$$1.compareEndPoints("StartToEnd",range$$1)},hasCopyEvent=function(){var e=elt("div");return"oncopy"in e||(e.setAttribute("oncopy","return;"),"function"==typeof e.oncopy)}(),badZoomedRects=null,modes={},mimeModes={},modeExtensions={},StringStream=function(string,tabSize,lineOracle){this.pos=this.start=0,this.string=string,this.tabSize=tabSize||8,this.lastColumnPos=this.lastColumnValue=0,this.lineStart=0,this.lineOracle=lineOracle};StringStream.prototype.eol=function(){return this.pos>=this.string.length},StringStream.prototype.sol=function(){return this.pos==this.lineStart},StringStream.prototype.peek=function(){return this.string.charAt(this.pos)||void 0},StringStream.prototype.next=function(){if(this.pos<this.string.length)return this.string.charAt(this.pos++)},StringStream.prototype.eat=function(match){var ch=this.string.charAt(this.pos);if("string"==typeof match?ch==match:ch&&(match.test?match.test(ch):match(ch)))return++this.pos,ch},StringStream.prototype.eatWhile=function(match){for(var start=this.pos;this.eat(match););return this.pos>start},StringStream.prototype.eatSpace=function(){for(var this$1=this,start=this.pos;/[\s\u00a0]/.test(this.string.charAt(this.pos));)++this$1.pos;return this.pos>start},StringStream.prototype.skipToEnd=function(){this.pos=this.string.length},StringStream.prototype.skipTo=function(ch){var found=this.string.indexOf(ch,this.pos);if(found>-1)return this.pos=found,!0},StringStream.prototype.backUp=function(n){this.pos-=n},StringStream.prototype.column=function(){return this.lastColumnPos<this.start&&(this.lastColumnValue=countColumn(this.string,this.start,this.tabSize,this.lastColumnPos,this.lastColumnValue),this.lastColumnPos=this.start),this.lastColumnValue-(this.lineStart?countColumn(this.string,this.lineStart,this.tabSize):0)},StringStream.prototype.indentation=function(){return countColumn(this.string,null,this.tabSize)-(this.lineStart?countColumn(this.string,this.lineStart,this.tabSize):0)},StringStream.prototype.match=function(pattern,consume,caseInsensitive){if("string"!=typeof pattern){var match=this.string.slice(this.pos).match(pattern);return match&&match.index>0?null:(match&&!1!==consume&&(this.pos+=match[0].length),match)}var cased=function(str){return caseInsensitive?str.toLowerCase():str};if(cased(this.string.substr(this.pos,pattern.length))==cased(pattern))return!1!==consume&&(this.pos+=pattern.length),!0},StringStream.prototype.current=function(){return this.string.slice(this.start,this.pos)},StringStream.prototype.hideFirstChars=function(n,inner){this.lineStart+=n;try{return inner()}finally{this.lineStart-=n}},StringStream.prototype.lookAhead=function(n){var oracle=this.lineOracle;return oracle&&oracle.lookAhead(n)};var SavedContext=function(state,lookAhead){this.state=state,this.lookAhead=lookAhead},Context=function(doc,state,line,lookAhead){this.state=state,this.doc=doc,this.line=line,this.maxLookAhead=lookAhead||0};Context.prototype.lookAhead=function(n){var line=this.doc.getLine(this.line+n);return null!=line&&n>this.maxLookAhead&&(this.maxLookAhead=n),line},Context.prototype.nextLine=function(){this.line++,this.maxLookAhead>0&&this.maxLookAhead--},Context.fromSaved=function(doc,saved,line){return saved instanceof SavedContext?new Context(doc,copyState(doc.mode,saved.saved),line,saved.lookAhead):new Context(doc,copyState(doc.mode,saved),line)},Context.prototype.save=function(copy){var state=!1!==copy?copyState(this.doc.mode,this.state):this.state;return this.maxLookAhead>0?new SavedContext(state,this.maxLookAhead):state};var Token=function(stream,type,state){this.start=stream.start,this.end=stream.pos,this.string=stream.current(),this.type=type||null,this.state=state},Line=function(text,markedSpans,estimateHeight){this.text=text,attachMarkedSpans(this,markedSpans),this.height=estimateHeight?estimateHeight(this):1};Line.prototype.lineNo=function(){return lineNo(this)},eventMixin(Line);var measureText,styleToClassCache={},styleToClassCacheWithMode={},operationGroup=null,orphanDelayedCallbacks=null,nullRect={left:0,right:0,top:0,bottom:0},NativeScrollbars=function(place,scroll,cm){this.cm=cm;var vert=this.vert=elt("div",[elt("div",null,null,"min-width: 1px")],"CodeMirror-vscrollbar"),horiz=this.horiz=elt("div",[elt("div",null,null,"height: 100%; min-height: 1px")],"CodeMirror-hscrollbar");place(vert),place(horiz),on(vert,"scroll",function(){vert.clientHeight&&scroll(vert.scrollTop,"vertical")}),on(horiz,"scroll",function(){horiz.clientWidth&&scroll(horiz.scrollLeft,"horizontal")}),this.checkedZeroWidth=!1,ie&&ie_version<8&&(this.horiz.style.minHeight=this.vert.style.minWidth="18px")};NativeScrollbars.prototype.update=function(measure){var needsH=measure.scrollWidth>measure.clientWidth+1,needsV=measure.scrollHeight>measure.clientHeight+1,sWidth=measure.nativeBarWidth;if(needsV){this.vert.style.display="block",this.vert.style.bottom=needsH?sWidth+"px":"0";var totalHeight=measure.viewHeight-(needsH?sWidth:0);this.vert.firstChild.style.height=Math.max(0,measure.scrollHeight-measure.clientHeight+totalHeight)+"px"}else this.vert.style.display="",this.vert.firstChild.style.height="0";if(needsH){this.horiz.style.display="block",this.horiz.style.right=needsV?sWidth+"px":"0",this.horiz.style.left=measure.barLeft+"px";var totalWidth=measure.viewWidth-measure.barLeft-(needsV?sWidth:0);this.horiz.firstChild.style.width=Math.max(0,measure.scrollWidth-measure.clientWidth+totalWidth)+"px"}else this.horiz.style.display="",this.horiz.firstChild.style.width="0";return!this.checkedZeroWidth&&measure.clientHeight>0&&(0==sWidth&&this.zeroWidthHack(),this.checkedZeroWidth=!0),{right:needsV?sWidth:0,bottom:needsH?sWidth:0}},NativeScrollbars.prototype.setScrollLeft=function(pos){this.horiz.scrollLeft!=pos&&(this.horiz.scrollLeft=pos),this.disableHoriz&&this.enableZeroWidthBar(this.horiz,this.disableHoriz,"horiz")},NativeScrollbars.prototype.setScrollTop=function(pos){this.vert.scrollTop!=pos&&(this.vert.scrollTop=pos),this.disableVert&&this.enableZeroWidthBar(this.vert,this.disableVert,"vert")},NativeScrollbars.prototype.zeroWidthHack=function(){var w=mac&&!mac_geMountainLion?"12px":"18px";this.horiz.style.height=this.vert.style.width=w,this.horiz.style.pointerEvents=this.vert.style.pointerEvents="none",this.disableHoriz=new Delayed,this.disableVert=new Delayed},NativeScrollbars.prototype.enableZeroWidthBar=function(bar,delay,type){function maybeDisable(){var box=bar.getBoundingClientRect();("vert"==type?document.elementFromPoint(box.right-1,(box.top+box.bottom)/2):document.elementFromPoint((box.right+box.left)/2,box.bottom-1))!=bar?bar.style.pointerEvents="none":delay.set(1e3,maybeDisable)}bar.style.pointerEvents="auto",delay.set(1e3,maybeDisable)},NativeScrollbars.prototype.clear=function(){var parent=this.horiz.parentNode;parent.removeChild(this.horiz),parent.removeChild(this.vert)};var NullScrollbars=function(){};NullScrollbars.prototype.update=function(){return{bottom:0,right:0}},NullScrollbars.prototype.setScrollLeft=function(){},NullScrollbars.prototype.setScrollTop=function(){},NullScrollbars.prototype.clear=function(){};var scrollbarModel={native:NativeScrollbars,null:NullScrollbars},nextOpId=0,DisplayUpdate=function(cm,viewport,force){var display=cm.display;this.viewport=viewport,this.visible=visibleLines(display,cm.doc,viewport),this.editorIsHidden=!display.wrapper.offsetWidth,this.wrapperHeight=display.wrapper.clientHeight,this.wrapperWidth=display.wrapper.clientWidth,this.oldDisplayWidth=displayWidth(cm),this.force=force,this.dims=getDimensions(cm),this.events=[]};DisplayUpdate.prototype.signal=function(emitter,type){hasHandler(emitter,type)&&this.events.push(arguments)},DisplayUpdate.prototype.finish=function(){for(var this$1=this,i=0;i<this.events.length;i++)signal.apply(null,this$1.events[i])};var wheelSamples=0,wheelPixelsPerUnit=null;ie?wheelPixelsPerUnit=-.53:gecko?wheelPixelsPerUnit=15:chrome?wheelPixelsPerUnit=-.7:safari&&(wheelPixelsPerUnit=-1/3);var Selection=function(ranges,primIndex){this.ranges=ranges,this.primIndex=primIndex};Selection.prototype.primary=function(){return this.ranges[this.primIndex]},Selection.prototype.equals=function(other){var this$1=this;if(other==this)return!0;if(other.primIndex!=this.primIndex||other.ranges.length!=this.ranges.length)return!1;for(var i=0;i<this.ranges.length;i++){var here=this$1.ranges[i],there=other.ranges[i];if(!equalCursorPos(here.anchor,there.anchor)||!equalCursorPos(here.head,there.head))return!1}return!0},Selection.prototype.deepCopy=function(){for(var this$1=this,out=[],i=0;i<this.ranges.length;i++)out[i]=new Range(copyPos(this$1.ranges[i].anchor),copyPos(this$1.ranges[i].head));return new Selection(out,this.primIndex)},Selection.prototype.somethingSelected=function(){for(var this$1=this,i=0;i<this.ranges.length;i++)if(!this$1.ranges[i].empty())return!0;return!1},Selection.prototype.contains=function(pos,end){var this$1=this;end||(end=pos);for(var i=0;i<this.ranges.length;i++){var range=this$1.ranges[i];if(cmp(end,range.from())>=0&&cmp(pos,range.to())<=0)return i}return-1};var Range=function(anchor,head){this.anchor=anchor,this.head=head};Range.prototype.from=function(){return minPos(this.anchor,this.head)},Range.prototype.to=function(){return maxPos(this.anchor,this.head)},Range.prototype.empty=function(){return this.head.line==this.anchor.line&&this.head.ch==this.anchor.ch},LeafChunk.prototype={chunkSize:function(){return this.lines.length},removeInner:function(at,n){for(var this$1=this,i=at,e=at+n;i<e;++i){var line=this$1.lines[i];this$1.height-=line.height,cleanUpLine(line),signalLater(line,"delete")}this.lines.splice(at,n)},collapse:function(lines){lines.push.apply(lines,this.lines)},insertInner:function(at,lines,height){var this$1=this;this.height+=height,this.lines=this.lines.slice(0,at).concat(lines).concat(this.lines.slice(at));for(var i=0;i<lines.length;++i)lines[i].parent=this$1},iterN:function(at,n,op){for(var this$1=this,e=at+n;at<e;++at)if(op(this$1.lines[at]))return!0}},BranchChunk.prototype={chunkSize:function(){return this.size},removeInner:function(at,n){var this$1=this;this.size-=n;for(var i=0;i<this.children.length;++i){var child=this$1.children[i],sz=child.chunkSize();if(at<sz){var rm=Math.min(n,sz-at),oldHeight=child.height;if(child.removeInner(at,rm),this$1.height-=oldHeight-child.height,sz==rm&&(this$1.children.splice(i--,1),child.parent=null),0==(n-=rm))break;at=0}else at-=sz}if(this.size-n<25&&(this.children.length>1||!(this.children[0]instanceof LeafChunk))){var lines=[];this.collapse(lines),this.children=[new LeafChunk(lines)],this.children[0].parent=this}},collapse:function(lines){for(var this$1=this,i=0;i<this.children.length;++i)this$1.children[i].collapse(lines)},insertInner:function(at,lines,height){var this$1=this;this.size+=lines.length,this.height+=height;for(var i=0;i<this.children.length;++i){var child=this$1.children[i],sz=child.chunkSize();if(at<=sz){if(child.insertInner(at,lines,height),child.lines&&child.lines.length>50){for(var remaining=child.lines.length%25+25,pos=remaining;pos<child.lines.length;){var leaf=new LeafChunk(child.lines.slice(pos,pos+=25));child.height-=leaf.height,this$1.children.splice(++i,0,leaf),leaf.parent=this$1}child.lines=child.lines.slice(0,remaining),this$1.maybeSpill()}break}at-=sz}},maybeSpill:function(){if(!(this.children.length<=10)){var me=this;do{var sibling=new BranchChunk(me.children.splice(me.children.length-5,5));if(me.parent){me.size-=sibling.size,me.height-=sibling.height;var myIndex=indexOf(me.parent.children,me);me.parent.children.splice(myIndex+1,0,sibling)}else{var copy=new BranchChunk(me.children);copy.parent=me,me.children=[copy,sibling],me=copy}sibling.parent=me.parent}while(me.children.length>10);me.parent.maybeSpill()}},iterN:function(at,n,op){for(var this$1=this,i=0;i<this.children.length;++i){var child=this$1.children[i],sz=child.chunkSize();if(at<sz){var used=Math.min(n,sz-at);if(child.iterN(at,used,op))return!0;if(0==(n-=used))break;at=0}else at-=sz}}};var LineWidget=function(doc,node,options){var this$1=this;if(options)for(var opt in options)options.hasOwnProperty(opt)&&(this$1[opt]=options[opt]);this.doc=doc,this.node=node};LineWidget.prototype.clear=function(){var this$1=this,cm=this.doc.cm,ws=this.line.widgets,line=this.line,no=lineNo(line);if(null!=no&&ws){for(var i=0;i<ws.length;++i)ws[i]==this$1&&ws.splice(i--,1);ws.length||(line.widgets=null);var height=widgetHeight(this);updateLineHeight(line,Math.max(0,line.height-height)),cm&&(runInOp(cm,function(){adjustScrollWhenAboveVisible(cm,line,-height),regLineChange(cm,no,"widget")}),signalLater(cm,"lineWidgetCleared",cm,this,no))}},LineWidget.prototype.changed=function(){var this$1=this,oldH=this.height,cm=this.doc.cm,line=this.line;this.height=null;var diff=widgetHeight(this)-oldH;diff&&(updateLineHeight(line,line.height+diff),cm&&runInOp(cm,function(){cm.curOp.forceUpdate=!0,adjustScrollWhenAboveVisible(cm,line,diff),signalLater(cm,"lineWidgetChanged",cm,this$1,lineNo(line))}))},eventMixin(LineWidget);var nextMarkerId=0,TextMarker=function(doc,type){this.lines=[],this.type=type,this.doc=doc,this.id=++nextMarkerId};TextMarker.prototype.clear=function(){var this$1=this;if(!this.explicitlyCleared){var cm=this.doc.cm,withOp=cm&&!cm.curOp;if(withOp&&startOperation(cm),hasHandler(this,"clear")){var found=this.find();found&&signalLater(this,"clear",found.from,found.to)}for(var min=null,max=null,i=0;i<this.lines.length;++i){var line=this$1.lines[i],span=getMarkedSpanFor(line.markedSpans,this$1);cm&&!this$1.collapsed?regLineChange(cm,lineNo(line),"text"):cm&&(null!=span.to&&(max=lineNo(line)),null!=span.from&&(min=lineNo(line))),line.markedSpans=removeMarkedSpan(line.markedSpans,span),null==span.from&&this$1.collapsed&&!lineIsHidden(this$1.doc,line)&&cm&&updateLineHeight(line,textHeight(cm.display))}if(cm&&this.collapsed&&!cm.options.lineWrapping)for(var i$1=0;i$1<this.lines.length;++i$1){var visual=visualLine(this$1.lines[i$1]),len=lineLength(visual);len>cm.display.maxLineLength&&(cm.display.maxLine=visual,cm.display.maxLineLength=len,cm.display.maxLineChanged=!0)}null!=min&&cm&&this.collapsed&&regChange(cm,min,max+1),this.lines.length=0,this.explicitlyCleared=!0,this.atomic&&this.doc.cantEdit&&(this.doc.cantEdit=!1,cm&&reCheckSelection(cm.doc)),cm&&signalLater(cm,"markerCleared",cm,this,min,max),withOp&&endOperation(cm),this.parent&&this.parent.clear()}},TextMarker.prototype.find=function(side,lineObj){var this$1=this;null==side&&"bookmark"==this.type&&(side=1);for(var from,to,i=0;i<this.lines.length;++i){var line=this$1.lines[i],span=getMarkedSpanFor(line.markedSpans,this$1);if(null!=span.from&&(from=Pos(lineObj?line:lineNo(line),span.from),-1==side))return from;if(null!=span.to&&(to=Pos(lineObj?line:lineNo(line),span.to),1==side))return to}return from&&{from:from,to:to}},TextMarker.prototype.changed=function(){var this$1=this,pos=this.find(-1,!0),widget=this,cm=this.doc.cm;pos&&cm&&runInOp(cm,function(){var line=pos.line,lineN=lineNo(pos.line),view=findViewForLine(cm,lineN);if(view&&(clearLineMeasurementCacheFor(view),cm.curOp.selectionChanged=cm.curOp.forceUpdate=!0),cm.curOp.updateMaxLine=!0,!lineIsHidden(widget.doc,line)&&null!=widget.height){var oldHeight=widget.height;widget.height=null;var dHeight=widgetHeight(widget)-oldHeight;dHeight&&updateLineHeight(line,line.height+dHeight)}signalLater(cm,"markerChanged",cm,this$1)})},TextMarker.prototype.attachLine=function(line){if(!this.lines.length&&this.doc.cm){var op=this.doc.cm.curOp;op.maybeHiddenMarkers&&-1!=indexOf(op.maybeHiddenMarkers,this)||(op.maybeUnhiddenMarkers||(op.maybeUnhiddenMarkers=[])).push(this)}this.lines.push(line)},TextMarker.prototype.detachLine=function(line){if(this.lines.splice(indexOf(this.lines,line),1),!this.lines.length&&this.doc.cm){var op=this.doc.cm.curOp;(op.maybeHiddenMarkers||(op.maybeHiddenMarkers=[])).push(this)}},eventMixin(TextMarker);var SharedTextMarker=function(markers,primary){var this$1=this;this.markers=markers,this.primary=primary;for(var i=0;i<markers.length;++i)markers[i].parent=this$1};SharedTextMarker.prototype.clear=function(){var this$1=this;if(!this.explicitlyCleared){this.explicitlyCleared=!0;for(var i=0;i<this.markers.length;++i)this$1.markers[i].clear();signalLater(this,"clear")}},SharedTextMarker.prototype.find=function(side,lineObj){return this.primary.find(side,lineObj)},eventMixin(SharedTextMarker);var nextDocId=0,Doc=function(text,mode,firstLine,lineSep,direction){if(!(this instanceof Doc))return new Doc(text,mode,firstLine,lineSep,direction);null==firstLine&&(firstLine=0),BranchChunk.call(this,[new LeafChunk([new Line("",null)])]),this.first=firstLine,this.scrollTop=this.scrollLeft=0,this.cantEdit=!1,this.cleanGeneration=1,this.modeFrontier=this.highlightFrontier=firstLine;var start=Pos(firstLine,0);this.sel=simpleSelection(start),this.history=new History(null),this.id=++nextDocId,this.modeOption=mode,this.lineSep=lineSep,this.direction="rtl"==direction?"rtl":"ltr",this.extend=!1,"string"==typeof text&&(text=this.splitLines(text)),updateDoc(this,{from:start,to:start,text:text}),setSelection(this,simpleSelection(start),sel_dontScroll)};Doc.prototype=createObj(BranchChunk.prototype,{constructor:Doc,iter:function(from,to,op){op?this.iterN(from-this.first,to-from,op):this.iterN(this.first,this.first+this.size,from)},insert:function(at,lines){for(var height=0,i=0;i<lines.length;++i)height+=lines[i].height;this.insertInner(at-this.first,lines,height)},remove:function(at,n){this.removeInner(at-this.first,n)},getValue:function(lineSep){var lines=getLines(this,this.first,this.first+this.size);return!1===lineSep?lines:lines.join(lineSep||this.lineSeparator())},setValue:docMethodOp(function(code){var top=Pos(this.first,0),last=this.first+this.size-1;makeChange(this,{from:top,to:Pos(last,getLine(this,last).text.length),text:this.splitLines(code),origin:"setValue",full:!0},!0),this.cm&&scrollToCoords(this.cm,0,0),setSelection(this,simpleSelection(top),sel_dontScroll)}),replaceRange:function(code,from,to,origin){replaceRange(this,code,from=clipPos(this,from),to=to?clipPos(this,to):from,origin)},getRange:function(from,to,lineSep){var lines=getBetween(this,clipPos(this,from),clipPos(this,to));return!1===lineSep?lines:lines.join(lineSep||this.lineSeparator())},getLine:function(line){var l=this.getLineHandle(line);return l&&l.text},getLineHandle:function(line){if(isLine(this,line))return getLine(this,line)},getLineNumber:function(line){return lineNo(line)},getLineHandleVisualStart:function(line){return"number"==typeof line&&(line=getLine(this,line)),visualLine(line)},lineCount:function(){return this.size},firstLine:function(){return this.first},lastLine:function(){return this.first+this.size-1},clipPos:function(pos){return clipPos(this,pos)},getCursor:function(start){var range$$1=this.sel.primary();return null==start||"head"==start?range$$1.head:"anchor"==start?range$$1.anchor:"end"==start||"to"==start||!1===start?range$$1.to():range$$1.from()},listSelections:function(){return this.sel.ranges},somethingSelected:function(){return this.sel.somethingSelected()},setCursor:docMethodOp(function(line,ch,options){setSimpleSelection(this,clipPos(this,"number"==typeof line?Pos(line,ch||0):line),null,options)}),setSelection:docMethodOp(function(anchor,head,options){setSimpleSelection(this,clipPos(this,anchor),clipPos(this,head||anchor),options)}),extendSelection:docMethodOp(function(head,other,options){extendSelection(this,clipPos(this,head),other&&clipPos(this,other),options)}),extendSelections:docMethodOp(function(heads,options){extendSelections(this,clipPosArray(this,heads),options)}),extendSelectionsBy:docMethodOp(function(f,options){extendSelections(this,clipPosArray(this,map(this.sel.ranges,f)),options)}),setSelections:docMethodOp(function(ranges,primary,options){var this$1=this;if(ranges.length){for(var out=[],i=0;i<ranges.length;i++)out[i]=new Range(clipPos(this$1,ranges[i].anchor),clipPos(this$1,ranges[i].head));null==primary&&(primary=Math.min(ranges.length-1,this.sel.primIndex)),setSelection(this,normalizeSelection(out,primary),options)}}),addSelection:docMethodOp(function(anchor,head,options){var ranges=this.sel.ranges.slice(0);ranges.push(new Range(clipPos(this,anchor),clipPos(this,head||anchor))),setSelection(this,normalizeSelection(ranges,ranges.length-1),options)}),getSelection:function(lineSep){for(var lines,this$1=this,ranges=this.sel.ranges,i=0;i<ranges.length;i++){var sel=getBetween(this$1,ranges[i].from(),ranges[i].to());lines=lines?lines.concat(sel):sel}return!1===lineSep?lines:lines.join(lineSep||this.lineSeparator())},getSelections:function(lineSep){for(var this$1=this,parts=[],ranges=this.sel.ranges,i=0;i<ranges.length;i++){var sel=getBetween(this$1,ranges[i].from(),ranges[i].to());!1!==lineSep&&(sel=sel.join(lineSep||this$1.lineSeparator())),parts[i]=sel}return parts},replaceSelection:function(code,collapse,origin){for(var dup=[],i=0;i<this.sel.ranges.length;i++)dup[i]=code;this.replaceSelections(dup,collapse,origin||"+input")},replaceSelections:docMethodOp(function(code,collapse,origin){for(var this$1=this,changes=[],sel=this.sel,i=0;i<sel.ranges.length;i++){var range$$1=sel.ranges[i];changes[i]={from:range$$1.from(),to:range$$1.to(),text:this$1.splitLines(code[i]),origin:origin}}for(var newSel=collapse&&"end"!=collapse&&computeReplacedSel(this,changes,collapse),i$1=changes.length-1;i$1>=0;i$1--)makeChange(this$1,changes[i$1]);newSel?setSelectionReplaceHistory(this,newSel):this.cm&&ensureCursorVisible(this.cm)}),undo:docMethodOp(function(){makeChangeFromHistory(this,"undo")}),redo:docMethodOp(function(){makeChangeFromHistory(this,"redo")}),undoSelection:docMethodOp(function(){makeChangeFromHistory(this,"undo",!0)}),redoSelection:docMethodOp(function(){makeChangeFromHistory(this,"redo",!0)}),setExtending:function(val){this.extend=val},getExtending:function(){return this.extend},historySize:function(){for(var hist=this.history,done=0,undone=0,i=0;i<hist.done.length;i++)hist.done[i].ranges||++done;for(var i$1=0;i$1<hist.undone.length;i$1++)hist.undone[i$1].ranges||++undone;return{undo:done,redo:undone}},clearHistory:function(){this.history=new History(this.history.maxGeneration)},markClean:function(){this.cleanGeneration=this.changeGeneration(!0)},changeGeneration:function(forceSplit){return forceSplit&&(this.history.lastOp=this.history.lastSelOp=this.history.lastOrigin=null),this.history.generation},isClean:function(gen){return this.history.generation==(gen||this.cleanGeneration)},getHistory:function(){return{done:copyHistoryArray(this.history.done),undone:copyHistoryArray(this.history.undone)}},setHistory:function(histData){var hist=this.history=new History(this.history.maxGeneration);hist.done=copyHistoryArray(histData.done.slice(0),null,!0),hist.undone=copyHistoryArray(histData.undone.slice(0),null,!0)},setGutterMarker:docMethodOp(function(line,gutterID,value){return changeLine(this,line,"gutter",function(line){var markers=line.gutterMarkers||(line.gutterMarkers={});return markers[gutterID]=value,!value&&isEmpty(markers)&&(line.gutterMarkers=null),!0})}),clearGutter:docMethodOp(function(gutterID){var this$1=this;this.iter(function(line){line.gutterMarkers&&line.gutterMarkers[gutterID]&&changeLine(this$1,line,"gutter",function(){return line.gutterMarkers[gutterID]=null,isEmpty(line.gutterMarkers)&&(line.gutterMarkers=null),!0})})}),lineInfo:function(line){var n;if("number"==typeof line){if(!isLine(this,line))return null;if(n=line,!(line=getLine(this,line)))return null}else if(null==(n=lineNo(line)))return null;return{line:n,handle:line,text:line.text,gutterMarkers:line.gutterMarkers,textClass:line.textClass,bgClass:line.bgClass,wrapClass:line.wrapClass,widgets:line.widgets}},addLineClass:docMethodOp(function(handle,where,cls){return changeLine(this,handle,"gutter"==where?"gutter":"class",function(line){var prop="text"==where?"textClass":"background"==where?"bgClass":"gutter"==where?"gutterClass":"wrapClass";if(line[prop]){if(classTest(cls).test(line[prop]))return!1;line[prop]+=" "+cls}else line[prop]=cls;return!0})}),removeLineClass:docMethodOp(function(handle,where,cls){return changeLine(this,handle,"gutter"==where?"gutter":"class",function(line){var prop="text"==where?"textClass":"background"==where?"bgClass":"gutter"==where?"gutterClass":"wrapClass",cur=line[prop];if(!cur)return!1;if(null==cls)line[prop]=null;else{var found=cur.match(classTest(cls));if(!found)return!1;var end=found.index+found[0].length;line[prop]=cur.slice(0,found.index)+(found.index&&end!=cur.length?" ":"")+cur.slice(end)||null}return!0})}),addLineWidget:docMethodOp(function(handle,node,options){return addLineWidget(this,handle,node,options)}),removeLineWidget:function(widget){widget.clear()},markText:function(from,to,options){return markText(this,clipPos(this,from),clipPos(this,to),options,options&&options.type||"range")},setBookmark:function(pos,options){var realOpts={replacedWith:options&&(null==options.nodeType?options.widget:options),insertLeft:options&&options.insertLeft,clearWhenEmpty:!1,shared:options&&options.shared,handleMouseEvents:options&&options.handleMouseEvents};return pos=clipPos(this,pos),markText(this,pos,pos,realOpts,"bookmark")},findMarksAt:function(pos){var markers=[],spans=getLine(this,(pos=clipPos(this,pos)).line).markedSpans;if(spans)for(var i=0;i<spans.length;++i){var span=spans[i];(null==span.from||span.from<=pos.ch)&&(null==span.to||span.to>=pos.ch)&&markers.push(span.marker.parent||span.marker)}return markers},findMarks:function(from,to,filter){from=clipPos(this,from),to=clipPos(this,to);var found=[],lineNo$$1=from.line;return this.iter(from.line,to.line+1,function(line){var spans=line.markedSpans;if(spans)for(var i=0;i<spans.length;i++){var span=spans[i];null!=span.to&&lineNo$$1==from.line&&from.ch>=span.to||null==span.from&&lineNo$$1!=from.line||null!=span.from&&lineNo$$1==to.line&&span.from>=to.ch||filter&&!filter(span.marker)||found.push(span.marker.parent||span.marker)}++lineNo$$1}),found},getAllMarks:function(){var markers=[];return this.iter(function(line){var sps=line.markedSpans;if(sps)for(var i=0;i<sps.length;++i)null!=sps[i].from&&markers.push(sps[i].marker)}),markers},posFromIndex:function(off){var ch,lineNo$$1=this.first,sepSize=this.lineSeparator().length;return this.iter(function(line){var sz=line.text.length+sepSize;if(sz>off)return ch=off,!0;off-=sz,++lineNo$$1}),clipPos(this,Pos(lineNo$$1,ch))},indexFromPos:function(coords){var index=(coords=clipPos(this,coords)).ch;if(coords.line<this.first||coords.ch<0)return 0;var sepSize=this.lineSeparator().length;return this.iter(this.first,coords.line,function(line){index+=line.text.length+sepSize}),index},copy:function(copyHistory){var doc=new Doc(getLines(this,this.first,this.first+this.size),this.modeOption,this.first,this.lineSep,this.direction);return doc.scrollTop=this.scrollTop,doc.scrollLeft=this.scrollLeft,doc.sel=this.sel,doc.extend=!1,copyHistory&&(doc.history.undoDepth=this.history.undoDepth,doc.setHistory(this.getHistory())),doc},linkedDoc:function(options){options||(options={});var from=this.first,to=this.first+this.size;null!=options.from&&options.from>from&&(from=options.from),null!=options.to&&options.to<to&&(to=options.to);var copy=new Doc(getLines(this,from,to),options.mode||this.modeOption,from,this.lineSep,this.direction);return options.sharedHist&&(copy.history=this.history),(this.linked||(this.linked=[])).push({doc:copy,sharedHist:options.sharedHist}),copy.linked=[{doc:this,isParent:!0,sharedHist:options.sharedHist}],copySharedMarkers(copy,findSharedMarkers(this)),copy},unlinkDoc:function(other){var this$1=this;if(other instanceof CodeMirror$1&&(other=other.doc),this.linked)for(var i=0;i<this.linked.length;++i)if(this$1.linked[i].doc==other){this$1.linked.splice(i,1),other.unlinkDoc(this$1),detachSharedMarkers(findSharedMarkers(this$1));break}if(other.history==this.history){var splitIds=[other.id];linkedDocs(other,function(doc){return splitIds.push(doc.id)},!0),other.history=new History(null),other.history.done=copyHistoryArray(this.history.done,splitIds),other.history.undone=copyHistoryArray(this.history.undone,splitIds)}},iterLinkedDocs:function(f){linkedDocs(this,f)},getMode:function(){return this.mode},getEditor:function(){return this.cm},splitLines:function(str){return this.lineSep?str.split(this.lineSep):splitLinesAuto(str)},lineSeparator:function(){return this.lineSep||"\n"},setDirection:docMethodOp(function(dir){"rtl"!=dir&&(dir="ltr"),dir!=this.direction&&(this.direction=dir,this.iter(function(line){return line.order=null}),this.cm&&directionChanged(this.cm))})}),Doc.prototype.eachLine=Doc.prototype.iter;for(var lastDrop=0,globalsRegistered=!1,keyNames={3:"Enter",8:"Backspace",9:"Tab",13:"Enter",16:"Shift",17:"Ctrl",18:"Alt",19:"Pause",20:"CapsLock",27:"Esc",32:"Space",33:"PageUp",34:"PageDown",35:"End",36:"Home",37:"Left",38:"Up",39:"Right",40:"Down",44:"PrintScrn",45:"Insert",46:"Delete",59:";",61:"=",91:"Mod",92:"Mod",93:"Mod",106:"*",107:"=",109:"-",110:".",111:"/",127:"Delete",173:"-",186:";",187:"=",188:",",189:"-",190:".",191:"/",192:"`",219:"[",220:"\\",221:"]",222:"'",63232:"Up",63233:"Down",63234:"Left",63235:"Right",63272:"Delete",63273:"Home",63275:"End",63276:"PageUp",63277:"PageDown",63302:"Insert"},i=0;i<10;i++)keyNames[i+48]=keyNames[i+96]=String(i);for(var i$1=65;i$1<=90;i$1++)keyNames[i$1]=String.fromCharCode(i$1);for(var i$2=1;i$2<=12;i$2++)keyNames[i$2+111]=keyNames[i$2+63235]="F"+i$2;var keyMap={};keyMap.basic={Left:"goCharLeft",Right:"goCharRight",Up:"goLineUp",Down:"goLineDown",End:"goLineEnd",Home:"goLineStartSmart",PageUp:"goPageUp",PageDown:"goPageDown",Delete:"delCharAfter",Backspace:"delCharBefore","Shift-Backspace":"delCharBefore",Tab:"defaultTab","Shift-Tab":"indentAuto",Enter:"newlineAndIndent",Insert:"toggleOverwrite",Esc:"singleSelection"},keyMap.pcDefault={"Ctrl-A":"selectAll","Ctrl-D":"deleteLine","Ctrl-Z":"undo","Shift-Ctrl-Z":"redo","Ctrl-Y":"redo","Ctrl-Home":"goDocStart","Ctrl-End":"goDocEnd","Ctrl-Up":"goLineUp","Ctrl-Down":"goLineDown","Ctrl-Left":"goGroupLeft","Ctrl-Right":"goGroupRight","Alt-Left":"goLineStart","Alt-Right":"goLineEnd","Ctrl-Backspace":"delGroupBefore","Ctrl-Delete":"delGroupAfter","Ctrl-S":"save","Ctrl-F":"find","Ctrl-G":"findNext","Shift-Ctrl-G":"findPrev","Shift-Ctrl-F":"replace","Shift-Ctrl-R":"replaceAll","Ctrl-[":"indentLess","Ctrl-]":"indentMore","Ctrl-U":"undoSelection","Shift-Ctrl-U":"redoSelection","Alt-U":"redoSelection",fallthrough:"basic"},keyMap.emacsy={"Ctrl-F":"goCharRight","Ctrl-B":"goCharLeft","Ctrl-P":"goLineUp","Ctrl-N":"goLineDown","Alt-F":"goWordRight","Alt-B":"goWordLeft","Ctrl-A":"goLineStart","Ctrl-E":"goLineEnd","Ctrl-V":"goPageDown","Shift-Ctrl-V":"goPageUp","Ctrl-D":"delCharAfter","Ctrl-H":"delCharBefore","Alt-D":"delWordAfter","Alt-Backspace":"delWordBefore","Ctrl-K":"killLine","Ctrl-T":"transposeChars","Ctrl-O":"openLine"},keyMap.macDefault={"Cmd-A":"selectAll","Cmd-D":"deleteLine","Cmd-Z":"undo","Shift-Cmd-Z":"redo","Cmd-Y":"redo","Cmd-Home":"goDocStart","Cmd-Up":"goDocStart","Cmd-End":"goDocEnd","Cmd-Down":"goDocEnd","Alt-Left":"goGroupLeft","Alt-Right":"goGroupRight","Cmd-Left":"goLineLeft","Cmd-Right":"goLineRight","Alt-Backspace":"delGroupBefore","Ctrl-Alt-Backspace":"delGroupAfter","Alt-Delete":"delGroupAfter","Cmd-S":"save","Cmd-F":"find","Cmd-G":"findNext","Shift-Cmd-G":"findPrev","Cmd-Alt-F":"replace","Shift-Cmd-Alt-F":"replaceAll","Cmd-[":"indentLess","Cmd-]":"indentMore","Cmd-Backspace":"delWrappedLineLeft","Cmd-Delete":"delWrappedLineRight","Cmd-U":"undoSelection","Shift-Cmd-U":"redoSelection","Ctrl-Up":"goDocStart","Ctrl-Down":"goDocEnd",fallthrough:["basic","emacsy"]},keyMap.default=mac?keyMap.macDefault:keyMap.pcDefault;var commands={selectAll:selectAll,singleSelection:function(cm){return cm.setSelection(cm.getCursor("anchor"),cm.getCursor("head"),sel_dontScroll)},killLine:function(cm){return deleteNearSelection(cm,function(range){if(range.empty()){var len=getLine(cm.doc,range.head.line).text.length;return range.head.ch==len&&range.head.line<cm.lastLine()?{from:range.head,to:Pos(range.head.line+1,0)}:{from:range.head,to:Pos(range.head.line,len)}}return{from:range.from(),to:range.to()}})},deleteLine:function(cm){return deleteNearSelection(cm,function(range){return{from:Pos(range.from().line,0),to:clipPos(cm.doc,Pos(range.to().line+1,0))}})},delLineLeft:function(cm){return deleteNearSelection(cm,function(range){return{from:Pos(range.from().line,0),to:range.from()}})},delWrappedLineLeft:function(cm){return deleteNearSelection(cm,function(range){var top=cm.charCoords(range.head,"div").top+5;return{from:cm.coordsChar({left:0,top:top},"div"),to:range.from()}})},delWrappedLineRight:function(cm){return deleteNearSelection(cm,function(range){var top=cm.charCoords(range.head,"div").top+5,rightPos=cm.coordsChar({left:cm.display.lineDiv.offsetWidth+100,top:top},"div");return{from:range.from(),to:rightPos}})},undo:function(cm){return cm.undo()},redo:function(cm){return cm.redo()},undoSelection:function(cm){return cm.undoSelection()},redoSelection:function(cm){return cm.redoSelection()},goDocStart:function(cm){return cm.extendSelection(Pos(cm.firstLine(),0))},goDocEnd:function(cm){return cm.extendSelection(Pos(cm.lastLine()))},goLineStart:function(cm){return cm.extendSelectionsBy(function(range){return lineStart(cm,range.head.line)},{origin:"+move",bias:1})},goLineStartSmart:function(cm){return cm.extendSelectionsBy(function(range){return lineStartSmart(cm,range.head)},{origin:"+move",bias:1})},goLineEnd:function(cm){return cm.extendSelectionsBy(function(range){return lineEnd(cm,range.head.line)},{origin:"+move",bias:-1})},goLineRight:function(cm){return cm.extendSelectionsBy(function(range){var top=cm.charCoords(range.head,"div").top+5;return cm.coordsChar({left:cm.display.lineDiv.offsetWidth+100,top:top},"div")},sel_move)},goLineLeft:function(cm){return cm.extendSelectionsBy(function(range){var top=cm.charCoords(range.head,"div").top+5;return cm.coordsChar({left:0,top:top},"div")},sel_move)},goLineLeftSmart:function(cm){return cm.extendSelectionsBy(function(range){var top=cm.charCoords(range.head,"div").top+5,pos=cm.coordsChar({left:0,top:top},"div");return pos.ch<cm.getLine(pos.line).search(/\S/)?lineStartSmart(cm,range.head):pos},sel_move)},goLineUp:function(cm){return cm.moveV(-1,"line")},goLineDown:function(cm){return cm.moveV(1,"line")},goPageUp:function(cm){return cm.moveV(-1,"page")},goPageDown:function(cm){return cm.moveV(1,"page")},goCharLeft:function(cm){return cm.moveH(-1,"char")},goCharRight:function(cm){return cm.moveH(1,"char")},goColumnLeft:function(cm){return cm.moveH(-1,"column")},goColumnRight:function(cm){return cm.moveH(1,"column")},goWordLeft:function(cm){return cm.moveH(-1,"word")},goGroupRight:function(cm){return cm.moveH(1,"group")},goGroupLeft:function(cm){return cm.moveH(-1,"group")},goWordRight:function(cm){return cm.moveH(1,"word")},delCharBefore:function(cm){return cm.deleteH(-1,"char")},delCharAfter:function(cm){return cm.deleteH(1,"char")},delWordBefore:function(cm){return cm.deleteH(-1,"word")},delWordAfter:function(cm){return cm.deleteH(1,"word")},delGroupBefore:function(cm){return cm.deleteH(-1,"group")},delGroupAfter:function(cm){return cm.deleteH(1,"group")},indentAuto:function(cm){return cm.indentSelection("smart")},indentMore:function(cm){return cm.indentSelection("add")},indentLess:function(cm){return cm.indentSelection("subtract")},insertTab:function(cm){return cm.replaceSelection("\t")},insertSoftTab:function(cm){for(var spaces=[],ranges=cm.listSelections(),tabSize=cm.options.tabSize,i=0;i<ranges.length;i++){var pos=ranges[i].from(),col=countColumn(cm.getLine(pos.line),pos.ch,tabSize);spaces.push(spaceStr(tabSize-col%tabSize))}cm.replaceSelections(spaces)},defaultTab:function(cm){cm.somethingSelected()?cm.indentSelection("add"):cm.execCommand("insertTab")},transposeChars:function(cm){return runInOp(cm,function(){for(var ranges=cm.listSelections(),newSel=[],i=0;i<ranges.length;i++)if(ranges[i].empty()){var cur=ranges[i].head,line=getLine(cm.doc,cur.line).text;if(line)if(cur.ch==line.length&&(cur=new Pos(cur.line,cur.ch-1)),cur.ch>0)cur=new Pos(cur.line,cur.ch+1),cm.replaceRange(line.charAt(cur.ch-1)+line.charAt(cur.ch-2),Pos(cur.line,cur.ch-2),cur,"+transpose");else if(cur.line>cm.doc.first){var prev=getLine(cm.doc,cur.line-1).text;prev&&(cur=new Pos(cur.line,1),cm.replaceRange(line.charAt(0)+cm.doc.lineSeparator()+prev.charAt(prev.length-1),Pos(cur.line-1,prev.length-1),cur,"+transpose"))}newSel.push(new Range(cur,cur))}cm.setSelections(newSel)})},newlineAndIndent:function(cm){return runInOp(cm,function(){for(var sels=cm.listSelections(),i=sels.length-1;i>=0;i--)cm.replaceRange(cm.doc.lineSeparator(),sels[i].anchor,sels[i].head,"+input");sels=cm.listSelections();for(var i$1=0;i$1<sels.length;i$1++)cm.indentLine(sels[i$1].from().line,null,!0);ensureCursorVisible(cm)})},openLine:function(cm){return cm.replaceSelection("\n","start")},toggleOverwrite:function(cm){return cm.toggleOverwrite()}},stopSeq=new Delayed,lastStoppedKey=null,PastClick=function(time,pos,button){this.time=time,this.pos=pos,this.button=button};PastClick.prototype.compare=function(time,pos,button){return this.time+400>time&&0==cmp(pos,this.pos)&&button==this.button};var lastClick,lastDoubleClick,Init={toString:function(){return"CodeMirror.Init"}},defaults={},optionHandlers={};CodeMirror$1.defaults=defaults,CodeMirror$1.optionHandlers=optionHandlers;var initHooks=[];CodeMirror$1.defineInitHook=function(f){return initHooks.push(f)};var lastCopied=null,ContentEditableInput=function(cm){this.cm=cm,this.lastAnchorNode=this.lastAnchorOffset=this.lastFocusNode=this.lastFocusOffset=null,this.polling=new Delayed,this.composing=null,this.gracePeriod=!1,this.readDOMTimeout=null};ContentEditableInput.prototype.init=function(display){function onCopyCut(e){if(!signalDOMEvent(cm,e)){if(cm.somethingSelected())setLastCopied({lineWise:!1,text:cm.getSelections()}),"cut"==e.type&&cm.replaceSelection("",null,"cut");else{if(!cm.options.lineWiseCopyCut)return;var ranges=copyableRanges(cm);setLastCopied({lineWise:!0,text:ranges.text}),"cut"==e.type&&cm.operation(function(){cm.setSelections(ranges.ranges,0,sel_dontScroll),cm.replaceSelection("",null,"cut")})}if(e.clipboardData){e.clipboardData.clearData();var content=lastCopied.text.join("\n");if(e.clipboardData.setData("Text",content),e.clipboardData.getData("Text")==content)return void e.preventDefault()}var kludge=hiddenTextarea(),te=kludge.firstChild;cm.display.lineSpace.insertBefore(kludge,cm.display.lineSpace.firstChild),te.value=lastCopied.text.join("\n");var hadFocus=document.activeElement;selectInput(te),setTimeout(function(){cm.display.lineSpace.removeChild(kludge),hadFocus.focus(),hadFocus==div&&input.showPrimarySelection()},50)}}var this$1=this,input=this,cm=input.cm,div=input.div=display.lineDiv;disableBrowserMagic(div,cm.options.spellcheck),on(div,"paste",function(e){signalDOMEvent(cm,e)||handlePaste(e,cm)||ie_version<=11&&setTimeout(operation(cm,function(){return this$1.updateFromDOM()}),20)}),on(div,"compositionstart",function(e){this$1.composing={data:e.data,done:!1}}),on(div,"compositionupdate",function(e){this$1.composing||(this$1.composing={data:e.data,done:!1})}),on(div,"compositionend",function(e){this$1.composing&&(e.data!=this$1.composing.data&&this$1.readFromDOMSoon(),this$1.composing.done=!0)}),on(div,"touchstart",function(){return input.forceCompositionEnd()}),on(div,"input",function(){this$1.composing||this$1.readFromDOMSoon()}),on(div,"copy",onCopyCut),on(div,"cut",onCopyCut)},ContentEditableInput.prototype.prepareSelection=function(){var result=prepareSelection(this.cm,!1);return result.focus=this.cm.state.focused,result},ContentEditableInput.prototype.showSelection=function(info,takeFocus){info&&this.cm.display.view.length&&((info.focus||takeFocus)&&this.showPrimarySelection(),this.showMultipleSelections(info))},ContentEditableInput.prototype.showPrimarySelection=function(){var sel=window.getSelection(),cm=this.cm,prim=cm.doc.sel.primary(),from=prim.from(),to=prim.to();if(cm.display.viewTo==cm.display.viewFrom||from.line>=cm.display.viewTo||to.line<cm.display.viewFrom)sel.removeAllRanges();else{var curAnchor=domToPos(cm,sel.anchorNode,sel.anchorOffset),curFocus=domToPos(cm,sel.focusNode,sel.focusOffset);if(!curAnchor||curAnchor.bad||!curFocus||curFocus.bad||0!=cmp(minPos(curAnchor,curFocus),from)||0!=cmp(maxPos(curAnchor,curFocus),to)){var view=cm.display.view,start=from.line>=cm.display.viewFrom&&posToDOM(cm,from)||{node:view[0].measure.map[2],offset:0},end=to.line<cm.display.viewTo&&posToDOM(cm,to);if(!end){var measure=view[view.length-1].measure,map$$1=measure.maps?measure.maps[measure.maps.length-1]:measure.map;end={node:map$$1[map$$1.length-1],offset:map$$1[map$$1.length-2]-map$$1[map$$1.length-3]}}if(start&&end){var rng,old=sel.rangeCount&&sel.getRangeAt(0);try{rng=range(start.node,start.offset,end.offset,end.node)}catch(e){}rng&&(!gecko&&cm.state.focused?(sel.collapse(start.node,start.offset),rng.collapsed||(sel.removeAllRanges(),sel.addRange(rng))):(sel.removeAllRanges(),sel.addRange(rng)),old&&null==sel.anchorNode?sel.addRange(old):gecko&&this.startGracePeriod()),this.rememberSelection()}else sel.removeAllRanges()}}},ContentEditableInput.prototype.startGracePeriod=function(){var this$1=this;clearTimeout(this.gracePeriod),this.gracePeriod=setTimeout(function(){this$1.gracePeriod=!1,this$1.selectionChanged()&&this$1.cm.operation(function(){return this$1.cm.curOp.selectionChanged=!0})},20)},ContentEditableInput.prototype.showMultipleSelections=function(info){removeChildrenAndAdd(this.cm.display.cursorDiv,info.cursors),removeChildrenAndAdd(this.cm.display.selectionDiv,info.selection)},ContentEditableInput.prototype.rememberSelection=function(){var sel=window.getSelection();this.lastAnchorNode=sel.anchorNode,this.lastAnchorOffset=sel.anchorOffset,this.lastFocusNode=sel.focusNode,this.lastFocusOffset=sel.focusOffset},ContentEditableInput.prototype.selectionInEditor=function(){var sel=window.getSelection();if(!sel.rangeCount)return!1;var node=sel.getRangeAt(0).commonAncestorContainer;return contains(this.div,node)},ContentEditableInput.prototype.focus=function(){"nocursor"!=this.cm.options.readOnly&&(this.selectionInEditor()||this.showSelection(this.prepareSelection(),!0),this.div.focus())},ContentEditableInput.prototype.blur=function(){this.div.blur()},ContentEditableInput.prototype.getField=function(){return this.div},ContentEditableInput.prototype.supportsTouch=function(){return!0},ContentEditableInput.prototype.receivedFocus=function(){function poll(){input.cm.state.focused&&(input.pollSelection(),input.polling.set(input.cm.options.pollInterval,poll))}var input=this;this.selectionInEditor()?this.pollSelection():runInOp(this.cm,function(){return input.cm.curOp.selectionChanged=!0}),this.polling.set(this.cm.options.pollInterval,poll)},ContentEditableInput.prototype.selectionChanged=function(){var sel=window.getSelection();return sel.anchorNode!=this.lastAnchorNode||sel.anchorOffset!=this.lastAnchorOffset||sel.focusNode!=this.lastFocusNode||sel.focusOffset!=this.lastFocusOffset},ContentEditableInput.prototype.pollSelection=function(){if(null==this.readDOMTimeout&&!this.gracePeriod&&this.selectionChanged()){var sel=window.getSelection(),cm=this.cm;if(android&&chrome&&this.cm.options.gutters.length&&isInGutter(sel.anchorNode))return this.cm.triggerOnKeyDown({type:"keydown",keyCode:8,preventDefault:Math.abs}),this.blur(),void this.focus();if(!this.composing){this.rememberSelection();var anchor=domToPos(cm,sel.anchorNode,sel.anchorOffset),head=domToPos(cm,sel.focusNode,sel.focusOffset);anchor&&head&&runInOp(cm,function(){setSelection(cm.doc,simpleSelection(anchor,head),sel_dontScroll),(anchor.bad||head.bad)&&(cm.curOp.selectionChanged=!0)})}}},ContentEditableInput.prototype.pollContent=function(){null!=this.readDOMTimeout&&(clearTimeout(this.readDOMTimeout),this.readDOMTimeout=null);var cm=this.cm,display=cm.display,sel=cm.doc.sel.primary(),from=sel.from(),to=sel.to();if(0==from.ch&&from.line>cm.firstLine()&&(from=Pos(from.line-1,getLine(cm.doc,from.line-1).length)),to.ch==getLine(cm.doc,to.line).text.length&&to.line<cm.lastLine()&&(to=Pos(to.line+1,0)),from.line<display.viewFrom||to.line>display.viewTo-1)return!1;var fromIndex,fromLine,fromNode;from.line==display.viewFrom||0==(fromIndex=findViewIndex(cm,from.line))?(fromLine=lineNo(display.view[0].line),fromNode=display.view[0].node):(fromLine=lineNo(display.view[fromIndex].line),fromNode=display.view[fromIndex-1].node.nextSibling);var toLine,toNode,toIndex=findViewIndex(cm,to.line);if(toIndex==display.view.length-1?(toLine=display.viewTo-1,toNode=display.lineDiv.lastChild):(toLine=lineNo(display.view[toIndex+1].line)-1,toNode=display.view[toIndex+1].node.previousSibling),!fromNode)return!1;for(var newText=cm.doc.splitLines(domTextBetween(cm,fromNode,toNode,fromLine,toLine)),oldText=getBetween(cm.doc,Pos(fromLine,0),Pos(toLine,getLine(cm.doc,toLine).text.length));newText.length>1&&oldText.length>1;)if(lst(newText)==lst(oldText))newText.pop(),oldText.pop(),toLine--;else{if(newText[0]!=oldText[0])break;newText.shift(),oldText.shift(),fromLine++}for(var cutFront=0,cutEnd=0,newTop=newText[0],oldTop=oldText[0],maxCutFront=Math.min(newTop.length,oldTop.length);cutFront<maxCutFront&&newTop.charCodeAt(cutFront)==oldTop.charCodeAt(cutFront);)++cutFront;for(var newBot=lst(newText),oldBot=lst(oldText),maxCutEnd=Math.min(newBot.length-(1==newText.length?cutFront:0),oldBot.length-(1==oldText.length?cutFront:0));cutEnd<maxCutEnd&&newBot.charCodeAt(newBot.length-cutEnd-1)==oldBot.charCodeAt(oldBot.length-cutEnd-1);)++cutEnd;if(1==newText.length&&1==oldText.length&&fromLine==from.line)for(;cutFront&&cutFront>from.ch&&newBot.charCodeAt(newBot.length-cutEnd-1)==oldBot.charCodeAt(oldBot.length-cutEnd-1);)cutFront--,cutEnd++;newText[newText.length-1]=newBot.slice(0,newBot.length-cutEnd).replace(/^\u200b+/,""),newText[0]=newText[0].slice(cutFront).replace(/\u200b+$/,"");var chFrom=Pos(fromLine,cutFront),chTo=Pos(toLine,oldText.length?lst(oldText).length-cutEnd:0);return newText.length>1||newText[0]||cmp(chFrom,chTo)?(replaceRange(cm.doc,newText,chFrom,chTo,"+input"),!0):void 0},ContentEditableInput.prototype.ensurePolled=function(){this.forceCompositionEnd()},ContentEditableInput.prototype.reset=function(){this.forceCompositionEnd()},ContentEditableInput.prototype.forceCompositionEnd=function(){this.composing&&(clearTimeout(this.readDOMTimeout),this.composing=null,this.updateFromDOM(),this.div.blur(),this.div.focus())},ContentEditableInput.prototype.readFromDOMSoon=function(){var this$1=this;null==this.readDOMTimeout&&(this.readDOMTimeout=setTimeout(function(){if(this$1.readDOMTimeout=null,this$1.composing){if(!this$1.composing.done)return;this$1.composing=null}this$1.updateFromDOM()},80))},ContentEditableInput.prototype.updateFromDOM=function(){var this$1=this;!this.cm.isReadOnly()&&this.pollContent()||runInOp(this.cm,function(){return regChange(this$1.cm)})},ContentEditableInput.prototype.setUneditable=function(node){node.contentEditable="false"},ContentEditableInput.prototype.onKeyPress=function(e){0!=e.charCode&&(e.preventDefault(),this.cm.isReadOnly()||operation(this.cm,applyTextInput)(this.cm,String.fromCharCode(null==e.charCode?e.keyCode:e.charCode),0))},ContentEditableInput.prototype.readOnlyChanged=function(val){this.div.contentEditable=String("nocursor"!=val)},ContentEditableInput.prototype.onContextMenu=function(){},ContentEditableInput.prototype.resetPosition=function(){},ContentEditableInput.prototype.needsContentAttribute=!0;var TextareaInput=function(cm){this.cm=cm,this.prevInput="",this.pollingFast=!1,this.polling=new Delayed,this.inaccurateSelection=!1,this.hasSelection=!1,this.composing=null};TextareaInput.prototype.init=function(display){function prepareCopyCut(e){if(!signalDOMEvent(cm,e)){if(cm.somethingSelected())setLastCopied({lineWise:!1,text:cm.getSelections()}),input.inaccurateSelection&&(input.prevInput="",input.inaccurateSelection=!1,te.value=lastCopied.text.join("\n"),selectInput(te));else{if(!cm.options.lineWiseCopyCut)return;var ranges=copyableRanges(cm);setLastCopied({lineWise:!0,text:ranges.text}),"cut"==e.type?cm.setSelections(ranges.ranges,null,sel_dontScroll):(input.prevInput="",te.value=ranges.text.join("\n"),selectInput(te))}"cut"==e.type&&(cm.state.cutIncoming=!0)}}var this$1=this,input=this,cm=this.cm,div=this.wrapper=hiddenTextarea(),te=this.textarea=div.firstChild;display.wrapper.insertBefore(div,display.wrapper.firstChild),ios&&(te.style.width="0px"),on(te,"input",function(){ie&&ie_version>=9&&this$1.hasSelection&&(this$1.hasSelection=null),input.poll()}),on(te,"paste",function(e){signalDOMEvent(cm,e)||handlePaste(e,cm)||(cm.state.pasteIncoming=!0,input.fastPoll())}),on(te,"cut",prepareCopyCut),on(te,"copy",prepareCopyCut),on(display.scroller,"paste",function(e){eventInWidget(display,e)||signalDOMEvent(cm,e)||(cm.state.pasteIncoming=!0,input.focus())}),on(display.lineSpace,"selectstart",function(e){eventInWidget(display,e)||e_preventDefault(e)}),on(te,"compositionstart",function(){var start=cm.getCursor("from");input.composing&&input.composing.range.clear(),input.composing={start:start,range:cm.markText(start,cm.getCursor("to"),{className:"CodeMirror-composing"})}}),on(te,"compositionend",function(){input.composing&&(input.poll(),input.composing.range.clear(),input.composing=null)})},TextareaInput.prototype.prepareSelection=function(){var cm=this.cm,display=cm.display,doc=cm.doc,result=prepareSelection(cm);if(cm.options.moveInputWithCursor){var headPos=cursorCoords(cm,doc.sel.primary().head,"div"),wrapOff=display.wrapper.getBoundingClientRect(),lineOff=display.lineDiv.getBoundingClientRect();result.teTop=Math.max(0,Math.min(display.wrapper.clientHeight-10,headPos.top+lineOff.top-wrapOff.top)),result.teLeft=Math.max(0,Math.min(display.wrapper.clientWidth-10,headPos.left+lineOff.left-wrapOff.left))}return result},TextareaInput.prototype.showSelection=function(drawn){var display=this.cm.display;removeChildrenAndAdd(display.cursorDiv,drawn.cursors),removeChildrenAndAdd(display.selectionDiv,drawn.selection),null!=drawn.teTop&&(this.wrapper.style.top=drawn.teTop+"px",this.wrapper.style.left=drawn.teLeft+"px")},TextareaInput.prototype.reset=function(typing){if(!this.contextMenuPending&&!this.composing){var minimal,selected,cm=this.cm,doc=cm.doc;if(cm.somethingSelected()){this.prevInput="";var range$$1=doc.sel.primary(),content=(minimal=hasCopyEvent&&(range$$1.to().line-range$$1.from().line>100||(selected=cm.getSelection()).length>1e3))?"-":selected||cm.getSelection();this.textarea.value=content,cm.state.focused&&selectInput(this.textarea),ie&&ie_version>=9&&(this.hasSelection=content)}else typing||(this.prevInput=this.textarea.value="",ie&&ie_version>=9&&(this.hasSelection=null));this.inaccurateSelection=minimal}},TextareaInput.prototype.getField=function(){return this.textarea},TextareaInput.prototype.supportsTouch=function(){return!1},TextareaInput.prototype.focus=function(){if("nocursor"!=this.cm.options.readOnly&&(!mobile||activeElt()!=this.textarea))try{this.textarea.focus()}catch(e){}},TextareaInput.prototype.blur=function(){this.textarea.blur()},TextareaInput.prototype.resetPosition=function(){this.wrapper.style.top=this.wrapper.style.left=0},TextareaInput.prototype.receivedFocus=function(){this.slowPoll()},TextareaInput.prototype.slowPoll=function(){var this$1=this;this.pollingFast||this.polling.set(this.cm.options.pollInterval,function(){this$1.poll(),this$1.cm.state.focused&&this$1.slowPoll()})},TextareaInput.prototype.fastPoll=function(){function p(){input.poll()||missed?(input.pollingFast=!1,input.slowPoll()):(missed=!0,input.polling.set(60,p))}var missed=!1,input=this;input.pollingFast=!0,input.polling.set(20,p)},TextareaInput.prototype.poll=function(){var this$1=this,cm=this.cm,input=this.textarea,prevInput=this.prevInput;if(this.contextMenuPending||!cm.state.focused||hasSelection(input)&&!prevInput&&!this.composing||cm.isReadOnly()||cm.options.disableInput||cm.state.keySeq)return!1;var text=input.value;if(text==prevInput&&!cm.somethingSelected())return!1;if(ie&&ie_version>=9&&this.hasSelection===text||mac&&/[\uf700-\uf7ff]/.test(text))return cm.display.input.reset(),!1;if(cm.doc.sel==cm.display.selForContextMenu){var first=text.charCodeAt(0);if(8203!=first||prevInput||(prevInput="​"),8666==first)return this.reset(),this.cm.execCommand("undo")}for(var same=0,l=Math.min(prevInput.length,text.length);same<l&&prevInput.charCodeAt(same)==text.charCodeAt(same);)++same;return runInOp(cm,function(){applyTextInput(cm,text.slice(same),prevInput.length-same,null,this$1.composing?"*compose":null),text.length>1e3||text.indexOf("\n")>-1?input.value=this$1.prevInput="":this$1.prevInput=text,this$1.composing&&(this$1.composing.range.clear(),this$1.composing.range=cm.markText(this$1.composing.start,cm.getCursor("to"),{className:"CodeMirror-composing"}))}),!0},TextareaInput.prototype.ensurePolled=function(){this.pollingFast&&this.poll()&&(this.pollingFast=!1)},TextareaInput.prototype.onKeyPress=function(){ie&&ie_version>=9&&(this.hasSelection=null),this.fastPoll()},TextareaInput.prototype.onContextMenu=function(e){function prepareSelectAllHack(){if(null!=te.selectionStart){var selected=cm.somethingSelected(),extval="​"+(selected?te.value:"");te.value="⇚",te.value=extval,input.prevInput=selected?"":"​",te.selectionStart=1,te.selectionEnd=extval.length,display.selForContextMenu=cm.doc.sel}}function rehide(){if(input.contextMenuPending=!1,input.wrapper.style.cssText=oldWrapperCSS,te.style.cssText=oldCSS,ie&&ie_version<9&&display.scrollbars.setScrollTop(display.scroller.scrollTop=scrollPos),null!=te.selectionStart){(!ie||ie&&ie_version<9)&&prepareSelectAllHack();var i=0,poll=function(){display.selForContextMenu==cm.doc.sel&&0==te.selectionStart&&te.selectionEnd>0&&"​"==input.prevInput?operation(cm,selectAll)(cm):i++<10?display.detectingSelectAll=setTimeout(poll,500):(display.selForContextMenu=null,display.input.reset())};display.detectingSelectAll=setTimeout(poll,200)}}var input=this,cm=input.cm,display=cm.display,te=input.textarea,pos=posFromMouse(cm,e),scrollPos=display.scroller.scrollTop;if(pos&&!presto){cm.options.resetSelectionOnContextMenu&&-1==cm.doc.sel.contains(pos)&&operation(cm,setSelection)(cm.doc,simpleSelection(pos),sel_dontScroll);var oldCSS=te.style.cssText,oldWrapperCSS=input.wrapper.style.cssText;input.wrapper.style.cssText="position: absolute";var wrapperBox=input.wrapper.getBoundingClientRect();te.style.cssText="position: absolute; width: 30px; height: 30px;\n      top: "+(e.clientY-wrapperBox.top-5)+"px; left: "+(e.clientX-wrapperBox.left-5)+"px;\n      z-index: 1000; background: "+(ie?"rgba(255, 255, 255, .05)":"transparent")+";\n      outline: none; border-width: 0; outline: none; overflow: hidden; opacity: .05; filter: alpha(opacity=5);";var oldScrollY;if(webkit&&(oldScrollY=window.scrollY),display.input.focus(),webkit&&window.scrollTo(null,oldScrollY),display.input.reset(),cm.somethingSelected()||(te.value=input.prevInput=" "),input.contextMenuPending=!0,display.selForContextMenu=cm.doc.sel,clearTimeout(display.detectingSelectAll),ie&&ie_version>=9&&prepareSelectAllHack(),captureRightClick){e_stop(e);var mouseup=function(){off(window,"mouseup",mouseup),setTimeout(rehide,20)};on(window,"mouseup",mouseup)}else setTimeout(rehide,50)}},TextareaInput.prototype.readOnlyChanged=function(val){val||this.reset(),this.textarea.disabled="nocursor"==val},TextareaInput.prototype.setUneditable=function(){},TextareaInput.prototype.needsContentAttribute=!1,function(CodeMirror){function option(name,deflt,handle,notOnInit){CodeMirror.defaults[name]=deflt,handle&&(optionHandlers[name]=notOnInit?function(cm,val,old){old!=Init&&handle(cm,val,old)}:handle)}var optionHandlers=CodeMirror.optionHandlers;CodeMirror.defineOption=option,CodeMirror.Init=Init,option("value","",function(cm,val){return cm.setValue(val)},!0),option("mode",null,function(cm,val){cm.doc.modeOption=val,loadMode(cm)},!0),option("indentUnit",2,loadMode,!0),option("indentWithTabs",!1),option("smartIndent",!0),option("tabSize",4,function(cm){resetModeState(cm),clearCaches(cm),regChange(cm)},!0),option("lineSeparator",null,function(cm,val){if(cm.doc.lineSep=val,val){var newBreaks=[],lineNo=cm.doc.first;cm.doc.iter(function(line){for(var pos=0;;){var found=line.text.indexOf(val,pos);if(-1==found)break;pos=found+val.length,newBreaks.push(Pos(lineNo,found))}lineNo++});for(var i=newBreaks.length-1;i>=0;i--)replaceRange(cm.doc,val,newBreaks[i],Pos(newBreaks[i].line,newBreaks[i].ch+val.length))}}),option("specialChars",/[\u0000-\u001f\u007f-\u009f\u00ad\u061c\u200b-\u200f\u2028\u2029\ufeff]/g,function(cm,val,old){cm.state.specialChars=new RegExp(val.source+(val.test("\t")?"":"|\t"),"g"),old!=Init&&cm.refresh()}),option("specialCharPlaceholder",defaultSpecialCharPlaceholder,function(cm){return cm.refresh()},!0),option("electricChars",!0),option("inputStyle",mobile?"contenteditable":"textarea",function(){throw new Error("inputStyle can not (yet) be changed in a running editor")},!0),option("spellcheck",!1,function(cm,val){return cm.getInputField().spellcheck=val},!0),option("rtlMoveVisually",!windows),option("wholeLineUpdateBefore",!0),option("theme","default",function(cm){themeChanged(cm),guttersChanged(cm)},!0),option("keyMap","default",function(cm,val,old){var next=getKeyMap(val),prev=old!=Init&&getKeyMap(old);prev&&prev.detach&&prev.detach(cm,next),next.attach&&next.attach(cm,prev||null)}),option("extraKeys",null),option("configureMouse",null),option("lineWrapping",!1,wrappingChanged,!0),option("gutters",[],function(cm){setGuttersForLineNumbers(cm.options),guttersChanged(cm)},!0),option("fixedGutter",!0,function(cm,val){cm.display.gutters.style.left=val?compensateForHScroll(cm.display)+"px":"0",cm.refresh()},!0),option("coverGutterNextToScrollbar",!1,function(cm){return updateScrollbars(cm)},!0),option("scrollbarStyle","native",function(cm){initScrollbars(cm),updateScrollbars(cm),cm.display.scrollbars.setScrollTop(cm.doc.scrollTop),cm.display.scrollbars.setScrollLeft(cm.doc.scrollLeft)},!0),option("lineNumbers",!1,function(cm){setGuttersForLineNumbers(cm.options),guttersChanged(cm)},!0),option("firstLineNumber",1,guttersChanged,!0),option("lineNumberFormatter",function(integer){return integer},guttersChanged,!0),option("showCursorWhenSelecting",!1,updateSelection,!0),option("resetSelectionOnContextMenu",!0),option("lineWiseCopyCut",!0),option("pasteLinesPerSelection",!0),option("readOnly",!1,function(cm,val){"nocursor"==val&&(onBlur(cm),cm.display.input.blur()),cm.display.input.readOnlyChanged(val)}),option("disableInput",!1,function(cm,val){val||cm.display.input.reset()},!0),option("dragDrop",!0,dragDropChanged),option("allowDropFileTypes",null),option("cursorBlinkRate",530),option("cursorScrollMargin",0),option("cursorHeight",1,updateSelection,!0),option("singleCursorHeightPerLine",!0,updateSelection,!0),option("workTime",100),option("workDelay",100),option("flattenSpans",!0,resetModeState,!0),option("addModeClass",!1,resetModeState,!0),option("pollInterval",100),option("undoDepth",200,function(cm,val){return cm.doc.history.undoDepth=val}),option("historyEventDelay",1250),option("viewportMargin",10,function(cm){return cm.refresh()},!0),option("maxHighlightLength",1e4,resetModeState,!0),option("moveInputWithCursor",!0,function(cm,val){val||cm.display.input.resetPosition()}),option("tabindex",null,function(cm,val){return cm.display.input.getField().tabIndex=val||""}),option("autofocus",null),option("direction","ltr",function(cm,val){return cm.doc.setDirection(val)},!0)}(CodeMirror$1),function(CodeMirror){var optionHandlers=CodeMirror.optionHandlers,helpers=CodeMirror.helpers={};CodeMirror.prototype={constructor:CodeMirror,focus:function(){window.focus(),this.display.input.focus()},setOption:function(option,value){var options=this.options,old=options[option];options[option]==value&&"mode"!=option||(options[option]=value,optionHandlers.hasOwnProperty(option)&&operation(this,optionHandlers[option])(this,value,old),signal(this,"optionChange",this,option))},getOption:function(option){return this.options[option]},getDoc:function(){return this.doc},addKeyMap:function(map$$1,bottom){this.state.keyMaps[bottom?"push":"unshift"](getKeyMap(map$$1))},removeKeyMap:function(map$$1){for(var maps=this.state.keyMaps,i=0;i<maps.length;++i)if(maps[i]==map$$1||maps[i].name==map$$1)return maps.splice(i,1),!0},addOverlay:methodOp(function(spec,options){var mode=spec.token?spec:CodeMirror.getMode(this.options,spec);if(mode.startState)throw new Error("Overlays may not be stateful.");insertSorted(this.state.overlays,{mode:mode,modeSpec:spec,opaque:options&&options.opaque,priority:options&&options.priority||0},function(overlay){return overlay.priority}),this.state.modeGen++,regChange(this)}),removeOverlay:methodOp(function(spec){for(var this$1=this,overlays=this.state.overlays,i=0;i<overlays.length;++i){var cur=overlays[i].modeSpec;if(cur==spec||"string"==typeof spec&&cur.name==spec)return overlays.splice(i,1),this$1.state.modeGen++,void regChange(this$1)}}),indentLine:methodOp(function(n,dir,aggressive){"string"!=typeof dir&&"number"!=typeof dir&&(dir=null==dir?this.options.smartIndent?"smart":"prev":dir?"add":"subtract"),isLine(this.doc,n)&&indentLine(this,n,dir,aggressive)}),indentSelection:methodOp(function(how){for(var this$1=this,ranges=this.doc.sel.ranges,end=-1,i=0;i<ranges.length;i++){var range$$1=ranges[i];if(range$$1.empty())range$$1.head.line>end&&(indentLine(this$1,range$$1.head.line,how,!0),end=range$$1.head.line,i==this$1.doc.sel.primIndex&&ensureCursorVisible(this$1));else{var from=range$$1.from(),to=range$$1.to(),start=Math.max(end,from.line);end=Math.min(this$1.lastLine(),to.line-(to.ch?0:1))+1;for(var j=start;j<end;++j)indentLine(this$1,j,how);var newRanges=this$1.doc.sel.ranges;0==from.ch&&ranges.length==newRanges.length&&newRanges[i].from().ch>0&&replaceOneSelection(this$1.doc,i,new Range(from,newRanges[i].to()),sel_dontScroll)}}}),getTokenAt:function(pos,precise){return takeToken(this,pos,precise)},getLineTokens:function(line,precise){return takeToken(this,Pos(line),precise,!0)},getTokenTypeAt:function(pos){pos=clipPos(this.doc,pos);var type,styles=getLineStyles(this,getLine(this.doc,pos.line)),before=0,after=(styles.length-1)/2,ch=pos.ch;if(0==ch)type=styles[2];else for(;;){var mid=before+after>>1;if((mid?styles[2*mid-1]:0)>=ch)after=mid;else{if(!(styles[2*mid+1]<ch)){type=styles[2*mid+2];break}before=mid+1}}var cut=type?type.indexOf("overlay "):-1;return cut<0?type:0==cut?null:type.slice(0,cut-1)},getModeAt:function(pos){var mode=this.doc.mode;return mode.innerMode?CodeMirror.innerMode(mode,this.getTokenAt(pos).state).mode:mode},getHelper:function(pos,type){return this.getHelpers(pos,type)[0]},getHelpers:function(pos,type){var this$1=this,found=[];if(!helpers.hasOwnProperty(type))return found;var help=helpers[type],mode=this.getModeAt(pos);if("string"==typeof mode[type])help[mode[type]]&&found.push(help[mode[type]]);else if(mode[type])for(var i=0;i<mode[type].length;i++){var val=help[mode[type][i]];val&&found.push(val)}else mode.helperType&&help[mode.helperType]?found.push(help[mode.helperType]):help[mode.name]&&found.push(help[mode.name]);for(var i$1=0;i$1<help._global.length;i$1++){var cur=help._global[i$1];cur.pred(mode,this$1)&&-1==indexOf(found,cur.val)&&found.push(cur.val)}return found},getStateAfter:function(line,precise){var doc=this.doc;return line=clipLine(doc,null==line?doc.first+doc.size-1:line),getContextBefore(this,line+1,precise).state},cursorCoords:function(start,mode){var pos,range$$1=this.doc.sel.primary();return pos=null==start?range$$1.head:"object"==typeof start?clipPos(this.doc,start):start?range$$1.from():range$$1.to(),cursorCoords(this,pos,mode||"page")},charCoords:function(pos,mode){return charCoords(this,clipPos(this.doc,pos),mode||"page")},coordsChar:function(coords,mode){return coords=fromCoordSystem(this,coords,mode||"page"),coordsChar(this,coords.left,coords.top)},lineAtHeight:function(height,mode){return height=fromCoordSystem(this,{top:height,left:0},mode||"page").top,lineAtHeight(this.doc,height+this.display.viewOffset)},heightAtLine:function(line,mode,includeWidgets){var lineObj,end=!1;if("number"==typeof line){var last=this.doc.first+this.doc.size-1;line<this.doc.first?line=this.doc.first:line>last&&(line=last,end=!0),lineObj=getLine(this.doc,line)}else lineObj=line;return intoCoordSystem(this,lineObj,{top:0,left:0},mode||"page",includeWidgets||end).top+(end?this.doc.height-heightAtLine(lineObj):0)},defaultTextHeight:function(){return textHeight(this.display)},defaultCharWidth:function(){return charWidth(this.display)},getViewport:function(){return{from:this.display.viewFrom,to:this.display.viewTo}},addWidget:function(pos,node,scroll,vert,horiz){var display=this.display,top=(pos=cursorCoords(this,clipPos(this.doc,pos))).bottom,left=pos.left;if(node.style.position="absolute",node.setAttribute("cm-ignore-events","true"),this.display.input.setUneditable(node),display.sizer.appendChild(node),"over"==vert)top=pos.top;else if("above"==vert||"near"==vert){var vspace=Math.max(display.wrapper.clientHeight,this.doc.height),hspace=Math.max(display.sizer.clientWidth,display.lineSpace.clientWidth);("above"==vert||pos.bottom+node.offsetHeight>vspace)&&pos.top>node.offsetHeight?top=pos.top-node.offsetHeight:pos.bottom+node.offsetHeight<=vspace&&(top=pos.bottom),left+node.offsetWidth>hspace&&(left=hspace-node.offsetWidth)}node.style.top=top+"px",node.style.left=node.style.right="","right"==horiz?(left=display.sizer.clientWidth-node.offsetWidth,node.style.right="0px"):("left"==horiz?left=0:"middle"==horiz&&(left=(display.sizer.clientWidth-node.offsetWidth)/2),node.style.left=left+"px"),scroll&&scrollIntoView(this,{left:left,top:top,right:left+node.offsetWidth,bottom:top+node.offsetHeight})},triggerOnKeyDown:methodOp(onKeyDown),triggerOnKeyPress:methodOp(onKeyPress),triggerOnKeyUp:onKeyUp,triggerOnMouseDown:methodOp(onMouseDown),execCommand:function(cmd){if(commands.hasOwnProperty(cmd))return commands[cmd].call(null,this)},triggerElectric:methodOp(function(text){triggerElectric(this,text)}),findPosH:function(from,amount,unit,visually){var this$1=this,dir=1;amount<0&&(dir=-1,amount=-amount);for(var cur=clipPos(this.doc,from),i=0;i<amount&&!(cur=findPosH(this$1.doc,cur,dir,unit,visually)).hitSide;++i);return cur},moveH:methodOp(function(dir,unit){var this$1=this;this.extendSelectionsBy(function(range$$1){return this$1.display.shift||this$1.doc.extend||range$$1.empty()?findPosH(this$1.doc,range$$1.head,dir,unit,this$1.options.rtlMoveVisually):dir<0?range$$1.from():range$$1.to()},sel_move)}),deleteH:methodOp(function(dir,unit){var sel=this.doc.sel,doc=this.doc;sel.somethingSelected()?doc.replaceSelection("",null,"+delete"):deleteNearSelection(this,function(range$$1){var other=findPosH(doc,range$$1.head,dir,unit,!1);return dir<0?{from:other,to:range$$1.head}:{from:range$$1.head,to:other}})}),findPosV:function(from,amount,unit,goalColumn){var this$1=this,dir=1,x=goalColumn;amount<0&&(dir=-1,amount=-amount);for(var cur=clipPos(this.doc,from),i=0;i<amount;++i){var coords=cursorCoords(this$1,cur,"div");if(null==x?x=coords.left:coords.left=x,(cur=findPosV(this$1,coords,dir,unit)).hitSide)break}return cur},moveV:methodOp(function(dir,unit){var this$1=this,doc=this.doc,goals=[],collapse=!this.display.shift&&!doc.extend&&doc.sel.somethingSelected();if(doc.extendSelectionsBy(function(range$$1){if(collapse)return dir<0?range$$1.from():range$$1.to();var headPos=cursorCoords(this$1,range$$1.head,"div");null!=range$$1.goalColumn&&(headPos.left=range$$1.goalColumn),goals.push(headPos.left);var pos=findPosV(this$1,headPos,dir,unit);return"page"==unit&&range$$1==doc.sel.primary()&&addToScrollTop(this$1,charCoords(this$1,pos,"div").top-headPos.top),pos},sel_move),goals.length)for(var i=0;i<doc.sel.ranges.length;i++)doc.sel.ranges[i].goalColumn=goals[i]}),findWordAt:function(pos){var line=getLine(this.doc,pos.line).text,start=pos.ch,end=pos.ch;if(line){var helper=this.getHelper(pos,"wordChars");"before"!=pos.sticky&&end!=line.length||!start?++end:--start;for(var startChar=line.charAt(start),check=isWordChar(startChar,helper)?function(ch){return isWordChar(ch,helper)}:/\s/.test(startChar)?function(ch){return/\s/.test(ch)}:function(ch){return!/\s/.test(ch)&&!isWordChar(ch)};start>0&&check(line.charAt(start-1));)--start;for(;end<line.length&&check(line.charAt(end));)++end}return new Range(Pos(pos.line,start),Pos(pos.line,end))},toggleOverwrite:function(value){null!=value&&value==this.state.overwrite||((this.state.overwrite=!this.state.overwrite)?addClass(this.display.cursorDiv,"CodeMirror-overwrite"):rmClass(this.display.cursorDiv,"CodeMirror-overwrite"),signal(this,"overwriteToggle",this,this.state.overwrite))},hasFocus:function(){return this.display.input.getField()==activeElt()},isReadOnly:function(){return!(!this.options.readOnly&&!this.doc.cantEdit)},scrollTo:methodOp(function(x,y){scrollToCoords(this,x,y)}),getScrollInfo:function(){var scroller=this.display.scroller;return{left:scroller.scrollLeft,top:scroller.scrollTop,height:scroller.scrollHeight-scrollGap(this)-this.display.barHeight,width:scroller.scrollWidth-scrollGap(this)-this.display.barWidth,clientHeight:displayHeight(this),clientWidth:displayWidth(this)}},scrollIntoView:methodOp(function(range$$1,margin){null==range$$1?(range$$1={from:this.doc.sel.primary().head,to:null},null==margin&&(margin=this.options.cursorScrollMargin)):"number"==typeof range$$1?range$$1={from:Pos(range$$1,0),to:null}:null==range$$1.from&&(range$$1={from:range$$1,to:null}),range$$1.to||(range$$1.to=range$$1.from),range$$1.margin=margin||0,null!=range$$1.from.line?scrollToRange(this,range$$1):scrollToCoordsRange(this,range$$1.from,range$$1.to,range$$1.margin)}),setSize:methodOp(function(width,height){var this$1=this,interpret=function(val){return"number"==typeof val||/^\d+$/.test(String(val))?val+"px":val};null!=width&&(this.display.wrapper.style.width=interpret(width)),null!=height&&(this.display.wrapper.style.height=interpret(height)),this.options.lineWrapping&&clearLineMeasurementCache(this);var lineNo$$1=this.display.viewFrom;this.doc.iter(lineNo$$1,this.display.viewTo,function(line){if(line.widgets)for(var i=0;i<line.widgets.length;i++)if(line.widgets[i].noHScroll){regLineChange(this$1,lineNo$$1,"widget");break}++lineNo$$1}),this.curOp.forceUpdate=!0,signal(this,"refresh",this)}),operation:function(f){return runInOp(this,f)},refresh:methodOp(function(){var oldHeight=this.display.cachedTextHeight;regChange(this),this.curOp.forceUpdate=!0,clearCaches(this),scrollToCoords(this,this.doc.scrollLeft,this.doc.scrollTop),updateGutterSpace(this),(null==oldHeight||Math.abs(oldHeight-textHeight(this.display))>.5)&&estimateLineHeights(this),signal(this,"refresh",this)}),swapDoc:methodOp(function(doc){var old=this.doc;return old.cm=null,attachDoc(this,doc),clearCaches(this),this.display.input.reset(),scrollToCoords(this,doc.scrollLeft,doc.scrollTop),this.curOp.forceScroll=!0,signalLater(this,"swapDoc",this,old),old}),getInputField:function(){return this.display.input.getField()},getWrapperElement:function(){return this.display.wrapper},getScrollerElement:function(){return this.display.scroller},getGutterElement:function(){return this.display.gutters}},eventMixin(CodeMirror),CodeMirror.registerHelper=function(type,name,value){helpers.hasOwnProperty(type)||(helpers[type]=CodeMirror[type]={_global:[]}),helpers[type][name]=value},CodeMirror.registerGlobalHelper=function(type,name,predicate,value){CodeMirror.registerHelper(type,name,value),helpers[type]._global.push({pred:predicate,val:value})}}(CodeMirror$1);var dontDelegate="iter insert remove copy getEditor constructor".split(" ");for(var prop in Doc.prototype)Doc.prototype.hasOwnProperty(prop)&&indexOf(dontDelegate,prop)<0&&(CodeMirror$1.prototype[prop]=function(method){return function(){return method.apply(this.doc,arguments)}}(Doc.prototype[prop]));return eventMixin(Doc),CodeMirror$1.inputStyles={textarea:TextareaInput,contenteditable:ContentEditableInput},CodeMirror$1.defineMode=function(name){CodeMirror$1.defaults.mode||"null"==name||(CodeMirror$1.defaults.mode=name),defineMode.apply(this,arguments)},CodeMirror$1.defineMIME=function(mime,spec){mimeModes[mime]=spec},CodeMirror$1.defineMode("null",function(){return{token:function(stream){return stream.skipToEnd()}}}),CodeMirror$1.defineMIME("text/plain","null"),CodeMirror$1.defineExtension=function(name,func){CodeMirror$1.prototype[name]=func},CodeMirror$1.defineDocExtension=function(name,func){Doc.prototype[name]=func},CodeMirror$1.fromTextArea=function(textarea,options){function save(){textarea.value=cm.getValue()}if(options=options?copyObj(options):{},options.value=textarea.value,!options.tabindex&&textarea.tabIndex&&(options.tabindex=textarea.tabIndex),!options.placeholder&&textarea.placeholder&&(options.placeholder=textarea.placeholder),null==options.autofocus){var hasFocus=activeElt();options.autofocus=hasFocus==textarea||null!=textarea.getAttribute("autofocus")&&hasFocus==document.body}var realSubmit;if(textarea.form&&(on(textarea.form,"submit",save),!options.leaveSubmitMethodAlone)){var form=textarea.form;realSubmit=form.submit;try{var wrappedSubmit=form.submit=function(){save(),form.submit=realSubmit,form.submit(),form.submit=wrappedSubmit}}catch(e){}}options.finishInit=function(cm){cm.save=save,cm.getTextArea=function(){return textarea},cm.toTextArea=function(){cm.toTextArea=isNaN,save(),textarea.parentNode.removeChild(cm.getWrapperElement()),textarea.style.display="",textarea.form&&(off(textarea.form,"submit",save),"function"==typeof textarea.form.submit&&(textarea.form.submit=realSubmit))}},textarea.style.display="none";var cm=CodeMirror$1(function(node){return textarea.parentNode.insertBefore(node,textarea.nextSibling)},options);return cm},function(CodeMirror){CodeMirror.off=off,CodeMirror.on=on,CodeMirror.wheelEventPixels=wheelEventPixels,CodeMirror.Doc=Doc,CodeMirror.splitLines=splitLinesAuto,CodeMirror.countColumn=countColumn,CodeMirror.findColumn=findColumn,CodeMirror.isWordChar=isWordCharBasic,CodeMirror.Pass=Pass,CodeMirror.signal=signal,CodeMirror.Line=Line,CodeMirror.changeEnd=changeEnd,CodeMirror.scrollbarModel=scrollbarModel,CodeMirror.Pos=Pos,CodeMirror.cmpPos=cmp,CodeMirror.modes=modes,CodeMirror.mimeModes=mimeModes,CodeMirror.resolveMode=resolveMode,CodeMirror.getMode=getMode,CodeMirror.modeExtensions=modeExtensions,CodeMirror.extendMode=extendMode,CodeMirror.copyState=copyState,CodeMirror.startState=startState,CodeMirror.innerMode=innerMode,CodeMirror.commands=commands,CodeMirror.keyMap=keyMap,CodeMirror.keyName=keyName,CodeMirror.isModifierKey=isModifierKey,CodeMirror.lookupKey=lookupKey,CodeMirror.normalizeKeyMap=normalizeKeyMap,CodeMirror.StringStream=StringStream,CodeMirror.SharedTextMarker=SharedTextMarker,CodeMirror.TextMarker=TextMarker,CodeMirror.LineWidget=LineWidget,CodeMirror.e_preventDefault=e_preventDefault,CodeMirror.e_stopPropagation=e_stopPropagation,CodeMirror.e_stop=e_stop,CodeMirror.addClass=addClass,CodeMirror.contains=contains,CodeMirror.rmClass=rmClass,CodeMirror.keyNames=keyNames}(CodeMirror$1),CodeMirror$1.version="5.27.2",CodeMirror$1})},{}],66:[function(require,module,exports){module.exports={Aacute:"Á",aacute:"á",Abreve:"Ă",abreve:"ă",ac:"∾",acd:"∿",acE:"∾̳",Acirc:"Â",acirc:"â",acute:"´",Acy:"А",acy:"а",AElig:"Æ",aelig:"æ",af:"⁡",Afr:"𝔄",afr:"𝔞",Agrave:"À",agrave:"à",alefsym:"ℵ",aleph:"ℵ",Alpha:"Α",alpha:"α",Amacr:"Ā",amacr:"ā",amalg:"⨿",amp:"&",AMP:"&",andand:"⩕",And:"⩓",and:"∧",andd:"⩜",andslope:"⩘",andv:"⩚",ang:"∠",ange:"⦤",angle:"∠",angmsdaa:"⦨",angmsdab:"⦩",angmsdac:"⦪",angmsdad:"⦫",angmsdae:"⦬",angmsdaf:"⦭",angmsdag:"⦮",angmsdah:"⦯",angmsd:"∡",angrt:"∟",angrtvb:"⊾",angrtvbd:"⦝",angsph:"∢",angst:"Å",angzarr:"⍼",Aogon:"Ą",aogon:"ą",Aopf:"𝔸",aopf:"𝕒",apacir:"⩯",ap:"≈",apE:"⩰",ape:"≊",apid:"≋",apos:"'",ApplyFunction:"⁡",approx:"≈",approxeq:"≊",Aring:"Å",aring:"å",Ascr:"𝒜",ascr:"𝒶",Assign:"≔",ast:"*",asymp:"≈",asympeq:"≍",Atilde:"Ã",atilde:"ã",Auml:"Ä",auml:"ä",awconint:"∳",awint:"⨑",backcong:"≌",backepsilon:"϶",backprime:"‵",backsim:"∽",backsimeq:"⋍",Backslash:"∖",Barv:"⫧",barvee:"⊽",barwed:"⌅",Barwed:"⌆",barwedge:"⌅",bbrk:"⎵",bbrktbrk:"⎶",bcong:"≌",Bcy:"Б",bcy:"б",bdquo:"„",becaus:"∵",because:"∵",Because:"∵",bemptyv:"⦰",bepsi:"϶",bernou:"ℬ",Bernoullis:"ℬ",Beta:"Β",beta:"β",beth:"ℶ",between:"≬",Bfr:"𝔅",bfr:"𝔟",bigcap:"⋂",bigcirc:"◯",bigcup:"⋃",bigodot:"⨀",bigoplus:"⨁",bigotimes:"⨂",bigsqcup:"⨆",bigstar:"★",bigtriangledown:"▽",bigtriangleup:"△",biguplus:"⨄",bigvee:"⋁",bigwedge:"⋀",bkarow:"⤍",blacklozenge:"⧫",blacksquare:"▪",blacktriangle:"▴",blacktriangledown:"▾",blacktriangleleft:"◂",blacktriangleright:"▸",blank:"␣",blk12:"▒",blk14:"░",blk34:"▓",block:"█",bne:"=⃥",bnequiv:"≡⃥",bNot:"⫭",bnot:"⌐",Bopf:"𝔹",bopf:"𝕓",bot:"⊥",bottom:"⊥",bowtie:"⋈",boxbox:"⧉",boxdl:"┐",boxdL:"╕",boxDl:"╖",boxDL:"╗",boxdr:"┌",boxdR:"╒",boxDr:"╓",boxDR:"╔",boxh:"─",boxH:"═",boxhd:"┬",boxHd:"╤",boxhD:"╥",boxHD:"╦",boxhu:"┴",boxHu:"╧",boxhU:"╨",boxHU:"╩",boxminus:"⊟",boxplus:"⊞",boxtimes:"⊠",boxul:"┘",boxuL:"╛",boxUl:"╜",boxUL:"╝",boxur:"└",boxuR:"╘",boxUr:"╙",boxUR:"╚",boxv:"│",boxV:"║",boxvh:"┼",boxvH:"╪",boxVh:"╫",boxVH:"╬",boxvl:"┤",boxvL:"╡",boxVl:"╢",boxVL:"╣",boxvr:"├",boxvR:"╞",boxVr:"╟",boxVR:"╠",bprime:"‵",breve:"˘",Breve:"˘",brvbar:"¦",bscr:"𝒷",Bscr:"ℬ",bsemi:"⁏",bsim:"∽",bsime:"⋍",bsolb:"⧅",bsol:"\\",bsolhsub:"⟈",bull:"•",bullet:"•",bump:"≎",bumpE:"⪮",bumpe:"≏",Bumpeq:"≎",bumpeq:"≏",Cacute:"Ć",cacute:"ć",capand:"⩄",capbrcup:"⩉",capcap:"⩋",cap:"∩",Cap:"⋒",capcup:"⩇",capdot:"⩀",CapitalDifferentialD:"ⅅ",caps:"∩︀",caret:"⁁",caron:"ˇ",Cayleys:"ℭ",ccaps:"⩍",Ccaron:"Č",ccaron:"č",Ccedil:"Ç",ccedil:"ç",Ccirc:"Ĉ",ccirc:"ĉ",Cconint:"∰",ccups:"⩌",ccupssm:"⩐",Cdot:"Ċ",cdot:"ċ",cedil:"¸",Cedilla:"¸",cemptyv:"⦲",cent:"¢",centerdot:"·",CenterDot:"·",cfr:"𝔠",Cfr:"ℭ",CHcy:"Ч",chcy:"ч",check:"✓",checkmark:"✓",Chi:"Χ",chi:"χ",circ:"ˆ",circeq:"≗",circlearrowleft:"↺",circlearrowright:"↻",circledast:"⊛",circledcirc:"⊚",circleddash:"⊝",CircleDot:"⊙",circledR:"®",circledS:"Ⓢ",CircleMinus:"⊖",CirclePlus:"⊕",CircleTimes:"⊗",cir:"○",cirE:"⧃",cire:"≗",cirfnint:"⨐",cirmid:"⫯",cirscir:"⧂",ClockwiseContourIntegral:"∲",CloseCurlyDoubleQuote:"”",CloseCurlyQuote:"’",clubs:"♣",clubsuit:"♣",colon:":",Colon:"∷",Colone:"⩴",colone:"≔",coloneq:"≔",comma:",",commat:"@",comp:"∁",compfn:"∘",complement:"∁",complexes:"ℂ",cong:"≅",congdot:"⩭",Congruent:"≡",conint:"∮",Conint:"∯",ContourIntegral:"∮",copf:"𝕔",Copf:"ℂ",coprod:"∐",Coproduct:"∐",copy:"©",COPY:"©",copysr:"℗",CounterClockwiseContourIntegral:"∳",crarr:"↵",cross:"✗",Cross:"⨯",Cscr:"𝒞",cscr:"𝒸",csub:"⫏",csube:"⫑",csup:"⫐",csupe:"⫒",ctdot:"⋯",cudarrl:"⤸",cudarrr:"⤵",cuepr:"⋞",cuesc:"⋟",cularr:"↶",cularrp:"⤽",cupbrcap:"⩈",cupcap:"⩆",CupCap:"≍",cup:"∪",Cup:"⋓",cupcup:"⩊",cupdot:"⊍",cupor:"⩅",cups:"∪︀",curarr:"↷",curarrm:"⤼",curlyeqprec:"⋞",curlyeqsucc:"⋟",curlyvee:"⋎",curlywedge:"⋏",curren:"¤",curvearrowleft:"↶",curvearrowright:"↷",cuvee:"⋎",cuwed:"⋏",cwconint:"∲",cwint:"∱",cylcty:"⌭",dagger:"†",Dagger:"‡",daleth:"ℸ",darr:"↓",Darr:"↡",dArr:"⇓",dash:"‐",Dashv:"⫤",dashv:"⊣",dbkarow:"⤏",dblac:"˝",Dcaron:"Ď",dcaron:"ď",Dcy:"Д",dcy:"д",ddagger:"‡",ddarr:"⇊",DD:"ⅅ",dd:"ⅆ",DDotrahd:"⤑",ddotseq:"⩷",deg:"°",Del:"∇",Delta:"Δ",delta:"δ",demptyv:"⦱",dfisht:"⥿",Dfr:"𝔇",dfr:"𝔡",dHar:"⥥",dharl:"⇃",dharr:"⇂",DiacriticalAcute:"´",DiacriticalDot:"˙",DiacriticalDoubleAcute:"˝",DiacriticalGrave:"`",DiacriticalTilde:"˜",diam:"⋄",diamond:"⋄",Diamond:"⋄",diamondsuit:"♦",diams:"♦",die:"¨",DifferentialD:"ⅆ",digamma:"ϝ",disin:"⋲",div:"÷",divide:"÷",divideontimes:"⋇",divonx:"⋇",DJcy:"Ђ",djcy:"ђ",dlcorn:"⌞",dlcrop:"⌍",dollar:"$",Dopf:"𝔻",dopf:"𝕕",Dot:"¨",dot:"˙",DotDot:"⃜",doteq:"≐",doteqdot:"≑",DotEqual:"≐",dotminus:"∸",dotplus:"∔",dotsquare:"⊡",doublebarwedge:"⌆",DoubleContourIntegral:"∯",DoubleDot:"¨",DoubleDownArrow:"⇓",DoubleLeftArrow:"⇐",DoubleLeftRightArrow:"⇔",DoubleLeftTee:"⫤",DoubleLongLeftArrow:"⟸",DoubleLongLeftRightArrow:"⟺",DoubleLongRightArrow:"⟹",DoubleRightArrow:"⇒",DoubleRightTee:"⊨",DoubleUpArrow:"⇑",DoubleUpDownArrow:"⇕",DoubleVerticalBar:"∥",DownArrowBar:"⤓",downarrow:"↓",DownArrow:"↓",Downarrow:"⇓",DownArrowUpArrow:"⇵",DownBreve:"̑",downdownarrows:"⇊",downharpoonleft:"⇃",downharpoonright:"⇂",DownLeftRightVector:"⥐",DownLeftTeeVector:"⥞",DownLeftVectorBar:"⥖",DownLeftVector:"↽",DownRightTeeVector:"⥟",DownRightVectorBar:"⥗",DownRightVector:"⇁",DownTeeArrow:"↧",DownTee:"⊤",drbkarow:"⤐",drcorn:"⌟",drcrop:"⌌",Dscr:"𝒟",dscr:"𝒹",DScy:"Ѕ",dscy:"ѕ",dsol:"⧶",Dstrok:"Đ",dstrok:"đ",dtdot:"⋱",dtri:"▿",dtrif:"▾",duarr:"⇵",duhar:"⥯",dwangle:"⦦",DZcy:"Џ",dzcy:"џ",dzigrarr:"⟿",Eacute:"É",eacute:"é",easter:"⩮",Ecaron:"Ě",ecaron:"ě",Ecirc:"Ê",ecirc:"ê",ecir:"≖",ecolon:"≕",Ecy:"Э",ecy:"э",eDDot:"⩷",Edot:"Ė",edot:"ė",eDot:"≑",ee:"ⅇ",efDot:"≒",Efr:"𝔈",efr:"𝔢",eg:"⪚",Egrave:"È",egrave:"è",egs:"⪖",egsdot:"⪘",el:"⪙",Element:"∈",elinters:"⏧",ell:"ℓ",els:"⪕",elsdot:"⪗",Emacr:"Ē",emacr:"ē",empty:"∅",emptyset:"∅",EmptySmallSquare:"◻",emptyv:"∅",EmptyVerySmallSquare:"▫",emsp13:" ",emsp14:" ",emsp:" ",ENG:"Ŋ",eng:"ŋ",ensp:" ",Eogon:"Ę",eogon:"ę",Eopf:"𝔼",eopf:"𝕖",epar:"⋕",eparsl:"⧣",eplus:"⩱",epsi:"ε",Epsilon:"Ε",epsilon:"ε",epsiv:"ϵ",eqcirc:"≖",eqcolon:"≕",eqsim:"≂",eqslantgtr:"⪖",eqslantless:"⪕",Equal:"⩵",equals:"=",EqualTilde:"≂",equest:"≟",Equilibrium:"⇌",equiv:"≡",equivDD:"⩸",eqvparsl:"⧥",erarr:"⥱",erDot:"≓",escr:"ℯ",Escr:"ℰ",esdot:"≐",Esim:"⩳",esim:"≂",Eta:"Η",eta:"η",ETH:"Ð",eth:"ð",Euml:"Ë",euml:"ë",euro:"€",excl:"!",exist:"∃",Exists:"∃",expectation:"ℰ",exponentiale:"ⅇ",ExponentialE:"ⅇ",fallingdotseq:"≒",Fcy:"Ф",fcy:"ф",female:"♀",ffilig:"ffi",fflig:"ff",ffllig:"ffl",Ffr:"𝔉",ffr:"𝔣",filig:"fi",FilledSmallSquare:"◼",FilledVerySmallSquare:"▪",fjlig:"fj",flat:"♭",fllig:"fl",fltns:"▱",fnof:"ƒ",Fopf:"𝔽",fopf:"𝕗",forall:"∀",ForAll:"∀",fork:"⋔",forkv:"⫙",Fouriertrf:"ℱ",fpartint:"⨍",frac12:"½",frac13:"⅓",frac14:"¼",frac15:"⅕",frac16:"⅙",frac18:"⅛",frac23:"⅔",frac25:"⅖",frac34:"¾",frac35:"⅗",frac38:"⅜",frac45:"⅘",frac56:"⅚",frac58:"⅝",frac78:"⅞",frasl:"⁄",frown:"⌢",fscr:"𝒻",Fscr:"ℱ",gacute:"ǵ",Gamma:"Γ",gamma:"γ",Gammad:"Ϝ",gammad:"ϝ",gap:"⪆",Gbreve:"Ğ",gbreve:"ğ",Gcedil:"Ģ",Gcirc:"Ĝ",gcirc:"ĝ",Gcy:"Г",gcy:"г",Gdot:"Ġ",gdot:"ġ",ge:"≥",gE:"≧",gEl:"⪌",gel:"⋛",geq:"≥",geqq:"≧",geqslant:"⩾",gescc:"⪩",ges:"⩾",gesdot:"⪀",gesdoto:"⪂",gesdotol:"⪄",gesl:"⋛︀",gesles:"⪔",Gfr:"𝔊",gfr:"𝔤",gg:"≫",Gg:"⋙",ggg:"⋙",gimel:"ℷ",GJcy:"Ѓ",gjcy:"ѓ",gla:"⪥",gl:"≷",glE:"⪒",glj:"⪤",gnap:"⪊",gnapprox:"⪊",gne:"⪈",gnE:"≩",gneq:"⪈",gneqq:"≩",gnsim:"⋧",Gopf:"𝔾",gopf:"𝕘",grave:"`",GreaterEqual:"≥",GreaterEqualLess:"⋛",GreaterFullEqual:"≧",GreaterGreater:"⪢",GreaterLess:"≷",GreaterSlantEqual:"⩾",GreaterTilde:"≳",Gscr:"𝒢",gscr:"ℊ",gsim:"≳",gsime:"⪎",gsiml:"⪐",gtcc:"⪧",gtcir:"⩺",gt:">",GT:">",Gt:"≫",gtdot:"⋗",gtlPar:"⦕",gtquest:"⩼",gtrapprox:"⪆",gtrarr:"⥸",gtrdot:"⋗",gtreqless:"⋛",gtreqqless:"⪌",gtrless:"≷",gtrsim:"≳",gvertneqq:"≩︀",gvnE:"≩︀",Hacek:"ˇ",hairsp:" ",half:"½",hamilt:"ℋ",HARDcy:"Ъ",hardcy:"ъ",harrcir:"⥈",harr:"↔",hArr:"⇔",harrw:"↭",Hat:"^",hbar:"ℏ",Hcirc:"Ĥ",hcirc:"ĥ",hearts:"♥",heartsuit:"♥",hellip:"…",hercon:"⊹",hfr:"𝔥",Hfr:"ℌ",HilbertSpace:"ℋ",hksearow:"⤥",hkswarow:"⤦",hoarr:"⇿",homtht:"∻",hookleftarrow:"↩",hookrightarrow:"↪",hopf:"𝕙",Hopf:"ℍ",horbar:"―",HorizontalLine:"─",hscr:"𝒽",Hscr:"ℋ",hslash:"ℏ",Hstrok:"Ħ",hstrok:"ħ",HumpDownHump:"≎",HumpEqual:"≏",hybull:"⁃",hyphen:"‐",Iacute:"Í",iacute:"í",ic:"⁣",Icirc:"Î",icirc:"î",Icy:"И",icy:"и",Idot:"İ",IEcy:"Е",iecy:"е",iexcl:"¡",iff:"⇔",ifr:"𝔦",Ifr:"ℑ",Igrave:"Ì",igrave:"ì",ii:"ⅈ",iiiint:"⨌",iiint:"∭",iinfin:"⧜",iiota:"℩",IJlig:"IJ",ijlig:"ij",Imacr:"Ī",imacr:"ī",image:"ℑ",ImaginaryI:"ⅈ",imagline:"ℐ",imagpart:"ℑ",imath:"ı",Im:"ℑ",imof:"⊷",imped:"Ƶ",Implies:"⇒",incare:"℅",in:"∈",infin:"∞",infintie:"⧝",inodot:"ı",intcal:"⊺",int:"∫",Int:"∬",integers:"ℤ",Integral:"∫",intercal:"⊺",Intersection:"⋂",intlarhk:"⨗",intprod:"⨼",InvisibleComma:"⁣",InvisibleTimes:"⁢",IOcy:"Ё",iocy:"ё",Iogon:"Į",iogon:"į",Iopf:"𝕀",iopf:"𝕚",Iota:"Ι",iota:"ι",iprod:"⨼",iquest:"¿",iscr:"𝒾",Iscr:"ℐ",isin:"∈",isindot:"⋵",isinE:"⋹",isins:"⋴",isinsv:"⋳",isinv:"∈",it:"⁢",Itilde:"Ĩ",itilde:"ĩ",Iukcy:"І",iukcy:"і",Iuml:"Ï",iuml:"ï",Jcirc:"Ĵ",jcirc:"ĵ",Jcy:"Й",jcy:"й",Jfr:"𝔍",jfr:"𝔧",jmath:"ȷ",Jopf:"𝕁",jopf:"𝕛",Jscr:"𝒥",jscr:"𝒿",Jsercy:"Ј",jsercy:"ј",Jukcy:"Є",jukcy:"є",Kappa:"Κ",kappa:"κ",kappav:"ϰ",Kcedil:"Ķ",kcedil:"ķ",Kcy:"К",kcy:"к",Kfr:"𝔎",kfr:"𝔨",kgreen:"ĸ",KHcy:"Х",khcy:"х",KJcy:"Ќ",kjcy:"ќ",Kopf:"𝕂",kopf:"𝕜",Kscr:"𝒦",kscr:"𝓀",lAarr:"⇚",Lacute:"Ĺ",lacute:"ĺ",laemptyv:"⦴",lagran:"ℒ",Lambda:"Λ",lambda:"λ",lang:"⟨",Lang:"⟪",langd:"⦑",langle:"⟨",lap:"⪅",Laplacetrf:"ℒ",laquo:"«",larrb:"⇤",larrbfs:"⤟",larr:"←",Larr:"↞",lArr:"⇐",larrfs:"⤝",larrhk:"↩",larrlp:"↫",larrpl:"⤹",larrsim:"⥳",larrtl:"↢",latail:"⤙",lAtail:"⤛",lat:"⪫",late:"⪭",lates:"⪭︀",lbarr:"⤌",lBarr:"⤎",lbbrk:"❲",lbrace:"{",lbrack:"[",lbrke:"⦋",lbrksld:"⦏",lbrkslu:"⦍",Lcaron:"Ľ",lcaron:"ľ",Lcedil:"Ļ",lcedil:"ļ",lceil:"⌈",lcub:"{",Lcy:"Л",lcy:"л",ldca:"⤶",ldquo:"“",ldquor:"„",ldrdhar:"⥧",ldrushar:"⥋",ldsh:"↲",le:"≤",lE:"≦",LeftAngleBracket:"⟨",LeftArrowBar:"⇤",leftarrow:"←",LeftArrow:"←",Leftarrow:"⇐",LeftArrowRightArrow:"⇆",leftarrowtail:"↢",LeftCeiling:"⌈",LeftDoubleBracket:"⟦",LeftDownTeeVector:"⥡",LeftDownVectorBar:"⥙",LeftDownVector:"⇃",LeftFloor:"⌊",leftharpoondown:"↽",leftharpoonup:"↼",leftleftarrows:"⇇",leftrightarrow:"↔",LeftRightArrow:"↔",Leftrightarrow:"⇔",leftrightarrows:"⇆",leftrightharpoons:"⇋",leftrightsquigarrow:"↭",LeftRightVector:"⥎",LeftTeeArrow:"↤",LeftTee:"⊣",LeftTeeVector:"⥚",leftthreetimes:"⋋",LeftTriangleBar:"⧏",LeftTriangle:"⊲",LeftTriangleEqual:"⊴",LeftUpDownVector:"⥑",LeftUpTeeVector:"⥠",LeftUpVectorBar:"⥘",LeftUpVector:"↿",LeftVectorBar:"⥒",LeftVector:"↼",lEg:"⪋",leg:"⋚",leq:"≤",leqq:"≦",leqslant:"⩽",lescc:"⪨",les:"⩽",lesdot:"⩿",lesdoto:"⪁",lesdotor:"⪃",lesg:"⋚︀",lesges:"⪓",lessapprox:"⪅",lessdot:"⋖",lesseqgtr:"⋚",lesseqqgtr:"⪋",LessEqualGreater:"⋚",LessFullEqual:"≦",LessGreater:"≶",lessgtr:"≶",LessLess:"⪡",lesssim:"≲",LessSlantEqual:"⩽",LessTilde:"≲",lfisht:"⥼",lfloor:"⌊",Lfr:"𝔏",lfr:"𝔩",lg:"≶",lgE:"⪑",lHar:"⥢",lhard:"↽",lharu:"↼",lharul:"⥪",lhblk:"▄",LJcy:"Љ",ljcy:"љ",llarr:"⇇",ll:"≪",Ll:"⋘",llcorner:"⌞",Lleftarrow:"⇚",llhard:"⥫",lltri:"◺",Lmidot:"Ŀ",lmidot:"ŀ",lmoustache:"⎰",lmoust:"⎰",lnap:"⪉",lnapprox:"⪉",lne:"⪇",lnE:"≨",lneq:"⪇",lneqq:"≨",lnsim:"⋦",loang:"⟬",loarr:"⇽",lobrk:"⟦",longleftarrow:"⟵",LongLeftArrow:"⟵",Longleftarrow:"⟸",longleftrightarrow:"⟷",LongLeftRightArrow:"⟷",Longleftrightarrow:"⟺",longmapsto:"⟼",longrightarrow:"⟶",LongRightArrow:"⟶",Longrightarrow:"⟹",looparrowleft:"↫",looparrowright:"↬",lopar:"⦅",Lopf:"𝕃",lopf:"𝕝",loplus:"⨭",lotimes:"⨴",lowast:"∗",lowbar:"_",LowerLeftArrow:"↙",LowerRightArrow:"↘",loz:"◊",lozenge:"◊",lozf:"⧫",lpar:"(",lparlt:"⦓",lrarr:"⇆",lrcorner:"⌟",lrhar:"⇋",lrhard:"⥭",lrm:"‎",lrtri:"⊿",lsaquo:"‹",lscr:"𝓁",Lscr:"ℒ",lsh:"↰",Lsh:"↰",lsim:"≲",lsime:"⪍",lsimg:"⪏",lsqb:"[",lsquo:"‘",lsquor:"‚",Lstrok:"Ł",lstrok:"ł",ltcc:"⪦",ltcir:"⩹",lt:"<",LT:"<",Lt:"≪",ltdot:"⋖",lthree:"⋋",ltimes:"⋉",ltlarr:"⥶",ltquest:"⩻",ltri:"◃",ltrie:"⊴",ltrif:"◂",ltrPar:"⦖",lurdshar:"⥊",luruhar:"⥦",lvertneqq:"≨︀",lvnE:"≨︀",macr:"¯",male:"♂",malt:"✠",maltese:"✠",Map:"⤅",map:"↦",mapsto:"↦",mapstodown:"↧",mapstoleft:"↤",mapstoup:"↥",marker:"▮",mcomma:"⨩",Mcy:"М",mcy:"м",mdash:"—",mDDot:"∺",measuredangle:"∡",MediumSpace:" ",Mellintrf:"ℳ",Mfr:"𝔐",mfr:"𝔪",mho:"℧",micro:"µ",midast:"*",midcir:"⫰",mid:"∣",middot:"·",minusb:"⊟",minus:"−",minusd:"∸",minusdu:"⨪",MinusPlus:"∓",mlcp:"⫛",mldr:"…",mnplus:"∓",models:"⊧",Mopf:"𝕄",mopf:"𝕞",mp:"∓",mscr:"𝓂",Mscr:"ℳ",mstpos:"∾",Mu:"Μ",mu:"μ",multimap:"⊸",mumap:"⊸",nabla:"∇",Nacute:"Ń",nacute:"ń",nang:"∠⃒",nap:"≉",napE:"⩰̸",napid:"≋̸",napos:"ʼn",napprox:"≉",natural:"♮",naturals:"ℕ",natur:"♮",nbsp:" ",nbump:"≎̸",nbumpe:"≏̸",ncap:"⩃",Ncaron:"Ň",ncaron:"ň",Ncedil:"Ņ",ncedil:"ņ",ncong:"≇",ncongdot:"⩭̸",ncup:"⩂",Ncy:"Н",ncy:"н",ndash:"–",nearhk:"⤤",nearr:"↗",neArr:"⇗",nearrow:"↗",ne:"≠",nedot:"≐̸",NegativeMediumSpace:"​",NegativeThickSpace:"​",NegativeThinSpace:"​",NegativeVeryThinSpace:"​",nequiv:"≢",nesear:"⤨",nesim:"≂̸",NestedGreaterGreater:"≫",NestedLessLess:"≪",NewLine:"\n",nexist:"∄",nexists:"∄",Nfr:"𝔑",nfr:"𝔫",ngE:"≧̸",nge:"≱",ngeq:"≱",ngeqq:"≧̸",ngeqslant:"⩾̸",nges:"⩾̸",nGg:"⋙̸",ngsim:"≵",nGt:"≫⃒",ngt:"≯",ngtr:"≯",nGtv:"≫̸",nharr:"↮",nhArr:"⇎",nhpar:"⫲",ni:"∋",nis:"⋼",nisd:"⋺",niv:"∋",NJcy:"Њ",njcy:"њ",nlarr:"↚",nlArr:"⇍",nldr:"‥",nlE:"≦̸",nle:"≰",nleftarrow:"↚",nLeftarrow:"⇍",nleftrightarrow:"↮",nLeftrightarrow:"⇎",nleq:"≰",nleqq:"≦̸",nleqslant:"⩽̸",nles:"⩽̸",nless:"≮",nLl:"⋘̸",nlsim:"≴",nLt:"≪⃒",nlt:"≮",nltri:"⋪",nltrie:"⋬",nLtv:"≪̸",nmid:"∤",NoBreak:"⁠",NonBreakingSpace:" ",nopf:"𝕟",Nopf:"ℕ",Not:"⫬",not:"¬",NotCongruent:"≢",NotCupCap:"≭",NotDoubleVerticalBar:"∦",NotElement:"∉",NotEqual:"≠",NotEqualTilde:"≂̸",NotExists:"∄",NotGreater:"≯",NotGreaterEqual:"≱",NotGreaterFullEqual:"≧̸",NotGreaterGreater:"≫̸",NotGreaterLess:"≹",NotGreaterSlantEqual:"⩾̸",NotGreaterTilde:"≵",NotHumpDownHump:"≎̸",NotHumpEqual:"≏̸",notin:"∉",notindot:"⋵̸",notinE:"⋹̸",notinva:"∉",notinvb:"⋷",notinvc:"⋶",NotLeftTriangleBar:"⧏̸",NotLeftTriangle:"⋪",NotLeftTriangleEqual:"⋬",NotLess:"≮",NotLessEqual:"≰",NotLessGreater:"≸",NotLessLess:"≪̸",NotLessSlantEqual:"⩽̸",NotLessTilde:"≴",NotNestedGreaterGreater:"⪢̸",NotNestedLessLess:"⪡̸",notni:"∌",notniva:"∌",notnivb:"⋾",notnivc:"⋽",NotPrecedes:"⊀",NotPrecedesEqual:"⪯̸",NotPrecedesSlantEqual:"⋠",NotReverseElement:"∌",NotRightTriangleBar:"⧐̸",NotRightTriangle:"⋫",NotRightTriangleEqual:"⋭",NotSquareSubset:"⊏̸",NotSquareSubsetEqual:"⋢",NotSquareSuperset:"⊐̸",NotSquareSupersetEqual:"⋣",NotSubset:"⊂⃒",NotSubsetEqual:"⊈",NotSucceeds:"⊁",NotSucceedsEqual:"⪰̸",NotSucceedsSlantEqual:"⋡",NotSucceedsTilde:"≿̸",NotSuperset:"⊃⃒",NotSupersetEqual:"⊉",NotTilde:"≁",NotTildeEqual:"≄",NotTildeFullEqual:"≇",NotTildeTilde:"≉",NotVerticalBar:"∤",nparallel:"∦",npar:"∦",nparsl:"⫽⃥",npart:"∂̸",npolint:"⨔",npr:"⊀",nprcue:"⋠",nprec:"⊀",npreceq:"⪯̸",npre:"⪯̸",nrarrc:"⤳̸",nrarr:"↛",nrArr:"⇏",nrarrw:"↝̸",nrightarrow:"↛",nRightarrow:"⇏",nrtri:"⋫",nrtrie:"⋭",nsc:"⊁",nsccue:"⋡",nsce:"⪰̸",Nscr:"𝒩",nscr:"𝓃",nshortmid:"∤",nshortparallel:"∦",nsim:"≁",nsime:"≄",nsimeq:"≄",nsmid:"∤",nspar:"∦",nsqsube:"⋢",nsqsupe:"⋣",nsub:"⊄",nsubE:"⫅̸",nsube:"⊈",nsubset:"⊂⃒",nsubseteq:"⊈",nsubseteqq:"⫅̸",nsucc:"⊁",nsucceq:"⪰̸",nsup:"⊅",nsupE:"⫆̸",nsupe:"⊉",nsupset:"⊃⃒",nsupseteq:"⊉",nsupseteqq:"⫆̸",ntgl:"≹",Ntilde:"Ñ",ntilde:"ñ",ntlg:"≸",ntriangleleft:"⋪",ntrianglelefteq:"⋬",ntriangleright:"⋫",ntrianglerighteq:"⋭",Nu:"Ν",nu:"ν",num:"#",numero:"№",numsp:" ",nvap:"≍⃒",nvdash:"⊬",nvDash:"⊭",nVdash:"⊮",nVDash:"⊯",nvge:"≥⃒",nvgt:">⃒",nvHarr:"⤄",nvinfin:"⧞",nvlArr:"⤂",nvle:"≤⃒",nvlt:"<⃒",nvltrie:"⊴⃒",nvrArr:"⤃",nvrtrie:"⊵⃒",nvsim:"∼⃒",nwarhk:"⤣",nwarr:"↖",nwArr:"⇖",nwarrow:"↖",nwnear:"⤧",Oacute:"Ó",oacute:"ó",oast:"⊛",Ocirc:"Ô",ocirc:"ô",ocir:"⊚",Ocy:"О",ocy:"о",odash:"⊝",Odblac:"Ő",odblac:"ő",odiv:"⨸",odot:"⊙",odsold:"⦼",OElig:"Œ",oelig:"œ",ofcir:"⦿",Ofr:"𝔒",ofr:"𝔬",ogon:"˛",Ograve:"Ò",ograve:"ò",ogt:"⧁",ohbar:"⦵",ohm:"Ω",oint:"∮",olarr:"↺",olcir:"⦾",olcross:"⦻",oline:"‾",olt:"⧀",Omacr:"Ō",omacr:"ō",Omega:"Ω",omega:"ω",Omicron:"Ο",omicron:"ο",omid:"⦶",ominus:"⊖",Oopf:"𝕆",oopf:"𝕠",opar:"⦷",OpenCurlyDoubleQuote:"“",OpenCurlyQuote:"‘",operp:"⦹",oplus:"⊕",orarr:"↻",Or:"⩔",or:"∨",ord:"⩝",order:"ℴ",orderof:"ℴ",ordf:"ª",ordm:"º",origof:"⊶",oror:"⩖",orslope:"⩗",orv:"⩛",oS:"Ⓢ",Oscr:"𝒪",oscr:"ℴ",Oslash:"Ø",oslash:"ø",osol:"⊘",Otilde:"Õ",otilde:"õ",otimesas:"⨶",Otimes:"⨷",otimes:"⊗",Ouml:"Ö",ouml:"ö",ovbar:"⌽",OverBar:"‾",OverBrace:"⏞",OverBracket:"⎴",OverParenthesis:"⏜",para:"¶",parallel:"∥",par:"∥",parsim:"⫳",parsl:"⫽",part:"∂",PartialD:"∂",Pcy:"П",pcy:"п",percnt:"%",period:".",permil:"‰",perp:"⊥",pertenk:"‱",Pfr:"𝔓",pfr:"𝔭",Phi:"Φ",phi:"φ",phiv:"ϕ",phmmat:"ℳ",phone:"☎",Pi:"Π",pi:"π",pitchfork:"⋔",piv:"ϖ",planck:"ℏ",planckh:"ℎ",plankv:"ℏ",plusacir:"⨣",plusb:"⊞",pluscir:"⨢",plus:"+",plusdo:"∔",plusdu:"⨥",pluse:"⩲",PlusMinus:"±",plusmn:"±",plussim:"⨦",plustwo:"⨧",pm:"±",Poincareplane:"ℌ",pointint:"⨕",popf:"𝕡",Popf:"ℙ",pound:"£",prap:"⪷",Pr:"⪻",pr:"≺",prcue:"≼",precapprox:"⪷",prec:"≺",preccurlyeq:"≼",Precedes:"≺",PrecedesEqual:"⪯",PrecedesSlantEqual:"≼",PrecedesTilde:"≾",preceq:"⪯",precnapprox:"⪹",precneqq:"⪵",precnsim:"⋨",pre:"⪯",prE:"⪳",precsim:"≾",prime:"′",Prime:"″",primes:"ℙ",prnap:"⪹",prnE:"⪵",prnsim:"⋨",prod:"∏",Product:"∏",profalar:"⌮",profline:"⌒",profsurf:"⌓",prop:"∝",Proportional:"∝",Proportion:"∷",propto:"∝",prsim:"≾",prurel:"⊰",Pscr:"𝒫",pscr:"𝓅",Psi:"Ψ",psi:"ψ",puncsp:" ",Qfr:"𝔔",qfr:"𝔮",qint:"⨌",qopf:"𝕢",Qopf:"ℚ",qprime:"⁗",Qscr:"𝒬",qscr:"𝓆",quaternions:"ℍ",quatint:"⨖",quest:"?",questeq:"≟",quot:'"',QUOT:'"',rAarr:"⇛",race:"∽̱",Racute:"Ŕ",racute:"ŕ",radic:"√",raemptyv:"⦳",rang:"⟩",Rang:"⟫",rangd:"⦒",range:"⦥",rangle:"⟩",raquo:"»",rarrap:"⥵",rarrb:"⇥",rarrbfs:"⤠",rarrc:"⤳",rarr:"→",Rarr:"↠",rArr:"⇒",rarrfs:"⤞",rarrhk:"↪",rarrlp:"↬",rarrpl:"⥅",rarrsim:"⥴",Rarrtl:"⤖",rarrtl:"↣",rarrw:"↝",ratail:"⤚",rAtail:"⤜",ratio:"∶",rationals:"ℚ",rbarr:"⤍",rBarr:"⤏",RBarr:"⤐",rbbrk:"❳",rbrace:"}",rbrack:"]",rbrke:"⦌",rbrksld:"⦎",rbrkslu:"⦐",Rcaron:"Ř",rcaron:"ř",Rcedil:"Ŗ",rcedil:"ŗ",rceil:"⌉",rcub:"}",Rcy:"Р",rcy:"р",rdca:"⤷",rdldhar:"⥩",rdquo:"”",rdquor:"”",rdsh:"↳",real:"ℜ",realine:"ℛ",realpart:"ℜ",reals:"ℝ",Re:"ℜ",rect:"▭",reg:"®",REG:"®",ReverseElement:"∋",ReverseEquilibrium:"⇋",ReverseUpEquilibrium:"⥯",rfisht:"⥽",rfloor:"⌋",rfr:"𝔯",Rfr:"ℜ",rHar:"⥤",rhard:"⇁",rharu:"⇀",rharul:"⥬",Rho:"Ρ",rho:"ρ",rhov:"ϱ",RightAngleBracket:"⟩",RightArrowBar:"⇥",rightarrow:"→",RightArrow:"→",Rightarrow:"⇒",RightArrowLeftArrow:"⇄",rightarrowtail:"↣",RightCeiling:"⌉",RightDoubleBracket:"⟧",RightDownTeeVector:"⥝",RightDownVectorBar:"⥕",RightDownVector:"⇂",RightFloor:"⌋",rightharpoondown:"⇁",rightharpoonup:"⇀",rightleftarrows:"⇄",rightleftharpoons:"⇌",rightrightarrows:"⇉",rightsquigarrow:"↝",RightTeeArrow:"↦",RightTee:"⊢",RightTeeVector:"⥛",rightthreetimes:"⋌",RightTriangleBar:"⧐",RightTriangle:"⊳",RightTriangleEqual:"⊵",RightUpDownVector:"⥏",RightUpTeeVector:"⥜",RightUpVectorBar:"⥔",RightUpVector:"↾",RightVectorBar:"⥓",RightVector:"⇀",ring:"˚",risingdotseq:"≓",rlarr:"⇄",rlhar:"⇌",rlm:"‏",rmoustache:"⎱",rmoust:"⎱",rnmid:"⫮",roang:"⟭",roarr:"⇾",robrk:"⟧",ropar:"⦆",ropf:"𝕣",Ropf:"ℝ",roplus:"⨮",rotimes:"⨵",RoundImplies:"⥰",rpar:")",rpargt:"⦔",rppolint:"⨒",rrarr:"⇉",Rrightarrow:"⇛",rsaquo:"›",rscr:"𝓇",Rscr:"ℛ",rsh:"↱",Rsh:"↱",rsqb:"]",rsquo:"’",rsquor:"’",rthree:"⋌",rtimes:"⋊",rtri:"▹",rtrie:"⊵",rtrif:"▸",rtriltri:"⧎",RuleDelayed:"⧴",ruluhar:"⥨",rx:"℞",Sacute:"Ś",sacute:"ś",sbquo:"‚",scap:"⪸",Scaron:"Š",scaron:"š",Sc:"⪼",sc:"≻",sccue:"≽",sce:"⪰",scE:"⪴",Scedil:"Ş",scedil:"ş",Scirc:"Ŝ",scirc:"ŝ",scnap:"⪺",scnE:"⪶",scnsim:"⋩",scpolint:"⨓",scsim:"≿",Scy:"С",scy:"с",sdotb:"⊡",sdot:"⋅",sdote:"⩦",searhk:"⤥",searr:"↘",seArr:"⇘",searrow:"↘",sect:"§",semi:";",seswar:"⤩",setminus:"∖",setmn:"∖",sext:"✶",Sfr:"𝔖",sfr:"𝔰",sfrown:"⌢",sharp:"♯",SHCHcy:"Щ",shchcy:"щ",SHcy:"Ш",shcy:"ш",ShortDownArrow:"↓",ShortLeftArrow:"←",shortmid:"∣",shortparallel:"∥",ShortRightArrow:"→",ShortUpArrow:"↑",shy:"­",Sigma:"Σ",sigma:"σ",sigmaf:"ς",sigmav:"ς",sim:"∼",simdot:"⩪",sime:"≃",simeq:"≃",simg:"⪞",simgE:"⪠",siml:"⪝",simlE:"⪟",simne:"≆",simplus:"⨤",simrarr:"⥲",slarr:"←",SmallCircle:"∘",smallsetminus:"∖",smashp:"⨳",smeparsl:"⧤",smid:"∣",smile:"⌣",smt:"⪪",smte:"⪬",smtes:"⪬︀",SOFTcy:"Ь",softcy:"ь",solbar:"⌿",solb:"⧄",sol:"/",Sopf:"𝕊",sopf:"𝕤",spades:"♠",spadesuit:"♠",spar:"∥",sqcap:"⊓",sqcaps:"⊓︀",sqcup:"⊔",sqcups:"⊔︀",Sqrt:"√",sqsub:"⊏",sqsube:"⊑",sqsubset:"⊏",sqsubseteq:"⊑",sqsup:"⊐",sqsupe:"⊒",sqsupset:"⊐",sqsupseteq:"⊒",square:"□",Square:"□",SquareIntersection:"⊓",SquareSubset:"⊏",SquareSubsetEqual:"⊑",SquareSuperset:"⊐",SquareSupersetEqual:"⊒",SquareUnion:"⊔",squarf:"▪",squ:"□",squf:"▪",srarr:"→",Sscr:"𝒮",sscr:"𝓈",ssetmn:"∖",ssmile:"⌣",sstarf:"⋆",Star:"⋆",star:"☆",starf:"★",straightepsilon:"ϵ",straightphi:"ϕ",strns:"¯",sub:"⊂",Sub:"⋐",subdot:"⪽",subE:"⫅",sube:"⊆",subedot:"⫃",submult:"⫁",subnE:"⫋",subne:"⊊",subplus:"⪿",subrarr:"⥹",subset:"⊂",Subset:"⋐",subseteq:"⊆",subseteqq:"⫅",SubsetEqual:"⊆",subsetneq:"⊊",subsetneqq:"⫋",subsim:"⫇",subsub:"⫕",subsup:"⫓",succapprox:"⪸",succ:"≻",succcurlyeq:"≽",Succeeds:"≻",SucceedsEqual:"⪰",SucceedsSlantEqual:"≽",SucceedsTilde:"≿",succeq:"⪰",succnapprox:"⪺",succneqq:"⪶",succnsim:"⋩",succsim:"≿",SuchThat:"∋",sum:"∑",Sum:"∑",sung:"♪",sup1:"¹",sup2:"²",sup3:"³",sup:"⊃",Sup:"⋑",supdot:"⪾",supdsub:"⫘",supE:"⫆",supe:"⊇",supedot:"⫄",Superset:"⊃",SupersetEqual:"⊇",suphsol:"⟉",suphsub:"⫗",suplarr:"⥻",supmult:"⫂",supnE:"⫌",supne:"⊋",supplus:"⫀",supset:"⊃",Supset:"⋑",supseteq:"⊇",supseteqq:"⫆",supsetneq:"⊋",supsetneqq:"⫌",supsim:"⫈",supsub:"⫔",supsup:"⫖",swarhk:"⤦",swarr:"↙",swArr:"⇙",swarrow:"↙",swnwar:"⤪",szlig:"ß",Tab:"\t",target:"⌖",Tau:"Τ",tau:"τ",tbrk:"⎴",Tcaron:"Ť",tcaron:"ť",Tcedil:"Ţ",tcedil:"ţ",Tcy:"Т",tcy:"т",tdot:"⃛",telrec:"⌕",Tfr:"𝔗",tfr:"𝔱",there4:"∴",therefore:"∴",Therefore:"∴",Theta:"Θ",theta:"θ",thetasym:"ϑ",thetav:"ϑ",thickapprox:"≈",thicksim:"∼",ThickSpace:"  ",ThinSpace:" ",thinsp:" ",thkap:"≈",thksim:"∼",THORN:"Þ",thorn:"þ",tilde:"˜",Tilde:"∼",TildeEqual:"≃",TildeFullEqual:"≅",TildeTilde:"≈",timesbar:"⨱",timesb:"⊠",times:"×",timesd:"⨰",tint:"∭",toea:"⤨",topbot:"⌶",topcir:"⫱",top:"⊤",Topf:"𝕋",topf:"𝕥",topfork:"⫚",tosa:"⤩",tprime:"‴",trade:"™",TRADE:"™",triangle:"▵",triangledown:"▿",triangleleft:"◃",trianglelefteq:"⊴",triangleq:"≜",triangleright:"▹",trianglerighteq:"⊵",tridot:"◬",trie:"≜",triminus:"⨺",TripleDot:"⃛",triplus:"⨹",trisb:"⧍",tritime:"⨻",trpezium:"⏢",Tscr:"𝒯",tscr:"𝓉",TScy:"Ц",tscy:"ц",TSHcy:"Ћ",tshcy:"ћ",Tstrok:"Ŧ",tstrok:"ŧ",twixt:"≬",twoheadleftarrow:"↞",twoheadrightarrow:"↠",Uacute:"Ú",uacute:"ú",uarr:"↑",Uarr:"↟",uArr:"⇑",Uarrocir:"⥉",Ubrcy:"Ў",ubrcy:"ў",Ubreve:"Ŭ",ubreve:"ŭ",Ucirc:"Û",ucirc:"û",Ucy:"У",ucy:"у",udarr:"⇅",Udblac:"Ű",udblac:"ű",udhar:"⥮",ufisht:"⥾",Ufr:"𝔘",ufr:"𝔲",Ugrave:"Ù",ugrave:"ù",uHar:"⥣",uharl:"↿",uharr:"↾",uhblk:"▀",ulcorn:"⌜",ulcorner:"⌜",ulcrop:"⌏",ultri:"◸",Umacr:"Ū",umacr:"ū",uml:"¨",UnderBar:"_",UnderBrace:"⏟",UnderBracket:"⎵",UnderParenthesis:"⏝",Union:"⋃",UnionPlus:"⊎",Uogon:"Ų",uogon:"ų",Uopf:"𝕌",uopf:"𝕦",UpArrowBar:"⤒",uparrow:"↑",UpArrow:"↑",Uparrow:"⇑",UpArrowDownArrow:"⇅",updownarrow:"↕",UpDownArrow:"↕",Updownarrow:"⇕",UpEquilibrium:"⥮",upharpoonleft:"↿",upharpoonright:"↾",uplus:"⊎",UpperLeftArrow:"↖",UpperRightArrow:"↗",upsi:"υ",Upsi:"ϒ",upsih:"ϒ",Upsilon:"Υ",upsilon:"υ",UpTeeArrow:"↥",UpTee:"⊥",upuparrows:"⇈",urcorn:"⌝",urcorner:"⌝",urcrop:"⌎",Uring:"Ů",uring:"ů",urtri:"◹",Uscr:"𝒰",uscr:"𝓊",utdot:"⋰",Utilde:"Ũ",utilde:"ũ",utri:"▵",utrif:"▴",uuarr:"⇈",Uuml:"Ü",uuml:"ü",uwangle:"⦧",vangrt:"⦜",varepsilon:"ϵ",varkappa:"ϰ",varnothing:"∅",varphi:"ϕ",varpi:"ϖ",varpropto:"∝",varr:"↕",vArr:"⇕",varrho:"ϱ",varsigma:"ς",varsubsetneq:"⊊︀",varsubsetneqq:"⫋︀",varsupsetneq:"⊋︀",varsupsetneqq:"⫌︀",vartheta:"ϑ",vartriangleleft:"⊲",vartriangleright:"⊳",vBar:"⫨",Vbar:"⫫",vBarv:"⫩",Vcy:"В",vcy:"в",vdash:"⊢",vDash:"⊨",Vdash:"⊩",VDash:"⊫",Vdashl:"⫦",veebar:"⊻",vee:"∨",Vee:"⋁",veeeq:"≚",vellip:"⋮",verbar:"|",Verbar:"‖",vert:"|",Vert:"‖",VerticalBar:"∣",VerticalLine:"|",VerticalSeparator:"❘",VerticalTilde:"≀",VeryThinSpace:" ",Vfr:"𝔙",vfr:"𝔳",vltri:"⊲",vnsub:"⊂⃒",vnsup:"⊃⃒",Vopf:"𝕍",vopf:"𝕧",vprop:"∝",vrtri:"⊳",Vscr:"𝒱",vscr:"𝓋",vsubnE:"⫋︀",vsubne:"⊊︀",vsupnE:"⫌︀",vsupne:"⊋︀",Vvdash:"⊪",vzigzag:"⦚",Wcirc:"Ŵ",wcirc:"ŵ",wedbar:"⩟",wedge:"∧",Wedge:"⋀",wedgeq:"≙",weierp:"℘",Wfr:"𝔚",wfr:"𝔴",Wopf:"𝕎",wopf:"𝕨",wp:"℘",wr:"≀",wreath:"≀",Wscr:"𝒲",wscr:"𝓌",xcap:"⋂",xcirc:"◯",xcup:"⋃",xdtri:"▽",Xfr:"𝔛",xfr:"𝔵",xharr:"⟷",xhArr:"⟺",Xi:"Ξ",xi:"ξ",xlarr:"⟵",xlArr:"⟸",xmap:"⟼",xnis:"⋻",xodot:"⨀",Xopf:"𝕏",xopf:"𝕩",xoplus:"⨁",xotime:"⨂",xrarr:"⟶",xrArr:"⟹",Xscr:"𝒳",xscr:"𝓍",xsqcup:"⨆",xuplus:"⨄",xutri:"△",xvee:"⋁",xwedge:"⋀",Yacute:"Ý",yacute:"ý",YAcy:"Я",yacy:"я",Ycirc:"Ŷ",ycirc:"ŷ",Ycy:"Ы",ycy:"ы",yen:"¥",Yfr:"𝔜",yfr:"𝔶",YIcy:"Ї",yicy:"ї",Yopf:"𝕐",yopf:"𝕪",Yscr:"𝒴",yscr:"𝓎",YUcy:"Ю",yucy:"ю",yuml:"ÿ",Yuml:"Ÿ",Zacute:"Ź",zacute:"ź",Zcaron:"Ž",zcaron:"ž",Zcy:"З",zcy:"з",Zdot:"Ż",zdot:"ż",zeetrf:"ℨ",ZeroWidthSpace:"​",Zeta:"Ζ",zeta:"ζ",zfr:"𝔷",Zfr:"ℨ",ZHcy:"Ж",zhcy:"ж",zigrarr:"⇝",zopf:"𝕫",Zopf:"ℤ",Zscr:"𝒵",zscr:"𝓏",zwj:"‍",zwnj:"‌"}},{}],67:[function(require,module,exports){"use strict";function makeEmptyFunction(arg){return function(){return arg}}var emptyFunction=function(){};emptyFunction.thatReturns=makeEmptyFunction,emptyFunction.thatReturnsFalse=makeEmptyFunction(!1),emptyFunction.thatReturnsTrue=makeEmptyFunction(!0),emptyFunction.thatReturnsNull=makeEmptyFunction(null),emptyFunction.thatReturnsThis=function(){return this},emptyFunction.thatReturnsArgument=function(arg){return arg},module.exports=emptyFunction},{}],68:[function(require,module,exports){(function(process){"use strict";var validateFormat=function(format){};"production"!==process.env.NODE_ENV&&(validateFormat=function(format){if(void 0===format)throw new Error("invariant requires an error message argument")}),module.exports=function(condition,format,a,b,c,d,e,f){if(validateFormat(format),!condition){var error;if(void 0===format)error=new Error("Minified exception occurred; use the non-minified dev environment for the full error message and additional helpful warnings.");else{var args=[a,b,c,d,e,f],argIndex=0;(error=new Error(format.replace(/%s/g,function(){return args[argIndex++]}))).name="Invariant Violation"}throw error.framesToPop=1,error}}}).call(this,require("_process"))},{_process:229}],69:[function(require,module,exports){(function(process){"use strict";var warning=require("./emptyFunction");"production"!==process.env.NODE_ENV&&function(){var printWarning=function(format){for(var _len=arguments.length,args=Array(_len>1?_len-1:0),_key=1;_key<_len;_key++)args[_key-1]=arguments[_key];var argIndex=0,message="Warning: "+format.replace(/%s/g,function(){return args[argIndex++]});"undefined"!=typeof console&&console.error(message);try{throw new Error(message)}catch(x){}};warning=function(condition,format){if(void 0===format)throw new Error("`warning(condition, format, ...args)` requires a warning message argument");if(0!==format.indexOf("Failed Composite propType: ")&&!condition){for(var _len2=arguments.length,args=Array(_len2>2?_len2-2:0),_key2=2;_key2<_len2;_key2++)args[_key2-2]=arguments[_key2];printWarning.apply(void 0,[format].concat(args))}}}(),module.exports=warning}).call(this,require("_process"))},{"./emptyFunction":67,_process:229}],70:[function(require,module,exports){"use strict";function _classCallCheck(instance,Constructor){if(!(instance instanceof Constructor))throw new TypeError("Cannot call a class as a function")}Object.defineProperty(exports,"__esModule",{value:!0}),exports.GraphQLLanguageService=void 0;var _kinds=require("graphql/language/kinds"),_graphql=require("graphql"),_getAutocompleteSuggestions2=require("./getAutocompleteSuggestions"),_getDiagnostics=require("./getDiagnostics"),_getDefinition=require("./getDefinition"),_graphqlLanguageServiceUtils=require("graphql-language-service-utils");exports.GraphQLLanguageService=function(){function GraphQLLanguageService(cache){_classCallCheck(this,GraphQLLanguageService),this._graphQLCache=cache,this._graphQLConfig=cache.getGraphQLConfig()}return GraphQLLanguageService.prototype.getDiagnostics=function(query,uri){var source,appName,schema,customRules,fragmentDefinitions,fragmentDependencies,dependenciesSource,customRulesModulePath,rulesPath;return regeneratorRuntime.async(function(_context){for(;;)switch(_context.prev=_context.next){case 0:if(source=query,appName=this._graphQLConfig.getAppConfigNameByFilePath(uri),schema=void 0,customRules=void 0,!this._graphQLConfig.getSchemaPath(appName)){_context.next=18;break}return _context.next=7,regeneratorRuntime.awrap(this._graphQLCache.getSchema(this._graphQLConfig.getSchemaPath(appName)));case 7:return schema=_context.sent,_context.next=10,regeneratorRuntime.awrap(this._graphQLCache.getFragmentDefinitions(this._graphQLConfig,appName));case 10:return fragmentDefinitions=_context.sent,_context.next=13,regeneratorRuntime.awrap(this._graphQLCache.getFragmentDependencies(query,fragmentDefinitions));case 13:fragmentDependencies=_context.sent,dependenciesSource=fragmentDependencies.reduce(function(prev,cur){return prev+" "+(0,_graphql.print)(cur.definition)},""),source=source+" "+dependenciesSource,(customRulesModulePath=this._graphQLConfig.getCustomValidationRulesModulePath(appName))&&(rulesPath=require.resolve(""+customRulesModulePath))&&(customRules=require(""+rulesPath)(this._graphQLConfig));case 18:return _context.abrupt("return",(0,_getDiagnostics.getDiagnostics)(source,schema,customRules));case 19:case"end":return _context.stop()}},null,this)},GraphQLLanguageService.prototype.getAutocompleteSuggestions=function(query,position,filePath){var appName,schema;return regeneratorRuntime.async(function(_context2){for(;;)switch(_context2.prev=_context2.next){case 0:if(appName=this._graphQLConfig.getAppConfigNameByFilePath(filePath),schema=void 0,!this._graphQLConfig.getSchemaPath(appName)){_context2.next=8;break}return _context2.next=5,regeneratorRuntime.awrap(this._graphQLCache.getSchema(this._graphQLConfig.getSchemaPath(appName)));case 5:if(!(schema=_context2.sent)){_context2.next=8;break}return _context2.abrupt("return",(0,_getAutocompleteSuggestions2.getAutocompleteSuggestions)(schema,query,position));case 8:return _context2.abrupt("return",[]);case 9:case"end":return _context2.stop()}},null,this)},GraphQLLanguageService.prototype.getDefinition=function(query,position,filePath){var appName,ast,node;return regeneratorRuntime.async(function(_context3){for(;;)switch(_context3.prev=_context3.next){case 0:appName=this._graphQLConfig.getAppConfigNameByFilePath(filePath),ast=void 0,_context3.prev=2,ast=(0,_graphql.parse)(query),_context3.next=9;break;case 6:return _context3.prev=6,_context3.t0=_context3.catch(2),_context3.abrupt("return",null);case 9:if(!(node=(0,_graphqlLanguageServiceUtils.getASTNodeAtPosition)(query,ast,position))){_context3.next=16;break}_context3.t1=node.kind,_context3.next=_context3.t1===_kinds.FRAGMENT_SPREAD?14:_context3.t1===_kinds.FRAGMENT_DEFINITION?15:_context3.t1===_kinds.OPERATION_DEFINITION?15:16;break;case 14:return _context3.abrupt("return",this._getDefinitionForFragmentSpread(query,ast,node,filePath,this._graphQLConfig,appName));case 15:return _context3.abrupt("return",(0,_getDefinition.getDefinitionQueryResultForDefinitionNode)(filePath,query,node));case 16:return _context3.abrupt("return",null);case 17:case"end":return _context3.stop()}},null,this,[[2,6]])},GraphQLLanguageService.prototype._getDefinitionForFragmentSpread=function(query,ast,node,filePath,graphQLConfig,appName){var fragmentDefinitions,dependencies,localFragDefinitions,typeCastedDefs,localFragInfos,result;return regeneratorRuntime.async(function(_context4){for(;;)switch(_context4.prev=_context4.next){case 0:return _context4.next=2,regeneratorRuntime.awrap(this._graphQLCache.getFragmentDefinitions(graphQLConfig,appName));case 2:return fragmentDefinitions=_context4.sent,_context4.next=5,regeneratorRuntime.awrap(this._graphQLCache.getFragmentDependenciesForAST(ast,fragmentDefinitions));case 5:return dependencies=_context4.sent,localFragDefinitions=ast.definitions.filter(function(definition){return definition.kind===_kinds.FRAGMENT_DEFINITION}),typeCastedDefs=localFragDefinitions,localFragInfos=typeCastedDefs.map(function(definition){return{filePath:filePath,content:query,definition:definition}}),_context4.next=11,regeneratorRuntime.awrap((0,_getDefinition.getDefinitionQueryResultForFragmentSpread)(query,node,dependencies.concat(localFragInfos)));case 11:return result=_context4.sent,_context4.abrupt("return",result);case 13:case"end":return _context4.stop()}},null,this)},GraphQLLanguageService}()},{"./getAutocompleteSuggestions":72,"./getDefinition":73,"./getDiagnostics":74,graphql:95,"graphql-language-service-utils":84,"graphql/language/kinds":105}],71:[function(require,module,exports){"use strict";function forEachState(stack,fn){for(var reverseStateStack=[],state=stack;state&&state.kind;)reverseStateStack.push(state),state=state.prevState;for(var i=reverseStateStack.length-1;i>=0;i--)fn(reverseStateStack[i])}function filterAndSortList(list,text){return text?filterNonEmpty(filterNonEmpty(list.map(function(entry){return{proximity:getProximity(normalizeText(entry.label),text),entry:entry}}),function(pair){return pair.proximity<=2}),function(pair){return!pair.entry.isDeprecated}).sort(function(a,b){return(a.entry.isDeprecated?1:0)-(b.entry.isDeprecated?1:0)||a.proximity-b.proximity||a.entry.label.length-b.entry.label.length}).map(function(pair){return pair.entry}):filterNonEmpty(list,function(entry){return!entry.isDeprecated})}function filterNonEmpty(array,predicate){var filtered=array.filter(predicate);return 0===filtered.length?array:filtered}function normalizeText(text){return text.toLowerCase().replace(/\W/g,"")}function getProximity(suggestion,text){var proximity=lexicalDistance(text,suggestion);return suggestion.length>text.length&&(proximity-=suggestion.length-text.length-1,proximity+=0===suggestion.indexOf(text)?0:.5),proximity}function lexicalDistance(a,b){var i=void 0,j=void 0,d=[],aLength=a.length,bLength=b.length;for(i=0;i<=aLength;i++)d[i]=[i];for(j=1;j<=bLength;j++)d[0][j]=j;for(i=1;i<=aLength;i++)for(j=1;j<=bLength;j++){var cost=a[i-1]===b[j-1]?0:1;d[i][j]=Math.min(d[i-1][j]+1,d[i][j-1]+1,d[i-1][j-1]+cost),i>1&&j>1&&a[i-1]===b[j-2]&&a[i-2]===b[j-1]&&(d[i][j]=Math.min(d[i][j],d[i-2][j-2]+cost))}return d[aLength][bLength]}Object.defineProperty(exports,"__esModule",{value:!0}),exports.getDefinitionState=function(tokenState){var definitionState=void 0;return forEachState(tokenState,function(state){switch(state.kind){case"Query":case"ShortQuery":case"Mutation":case"Subscription":case"FragmentDefinition":definitionState=state}}),definitionState},exports.getFieldDef=function(schema,type,fieldName){return fieldName===_introspection.SchemaMetaFieldDef.name&&schema.getQueryType()===type?_introspection.SchemaMetaFieldDef:fieldName===_introspection.TypeMetaFieldDef.name&&schema.getQueryType()===type?_introspection.TypeMetaFieldDef:fieldName===_introspection.TypeNameMetaFieldDef.name&&(0,_graphql.isCompositeType)(type)?_introspection.TypeNameMetaFieldDef:type.getFields&&"function"==typeof type.getFields?type.getFields()[fieldName]:null},exports.forEachState=forEachState,exports.objectValues=function(object){for(var keys=Object.keys(object),len=keys.length,values=new Array(len),i=0;i<len;++i)values[i]=object[keys[i]];return values},exports.hintList=function(token,list){return filterAndSortList(list,normalizeText(token.string))};var _graphql=require("graphql"),_introspection=require("graphql/type/introspection")},{graphql:95,"graphql/type/introspection":118}],72:[function(require,module,exports){"use strict";function getSuggestionsForFieldNames(token,typeInfo,schema){if(typeInfo.parentType){var parentType=typeInfo.parentType,fields=parentType.getFields instanceof Function?(0,_autocompleteUtils.objectValues)(parentType.getFields()):[];return(0,_graphql.isAbstractType)(parentType)&&fields.push(_graphql.TypeNameMetaFieldDef),parentType===schema.getQueryType()&&fields.push(_graphql.SchemaMetaFieldDef,_graphql.TypeMetaFieldDef),(0,_autocompleteUtils.hintList)(token,fields.map(function(field){return{label:field.name,detail:String(field.type),documentation:field.description,isDeprecated:field.isDeprecated,deprecationReason:field.deprecationReason}}))}return[]}function getSuggestionsForInputValues(token,typeInfo){var namedInputType=(0,_graphql.getNamedType)(typeInfo.inputType);if(namedInputType instanceof _graphql.GraphQLEnumType){var values=namedInputType.getValues();return(0,_autocompleteUtils.hintList)(token,values.map(function(value){return{label:value.name,detail:String(namedInputType),documentation:value.description,isDeprecated:value.isDeprecated,deprecationReason:value.deprecationReason}}))}return namedInputType===_graphql.GraphQLBoolean?(0,_autocompleteUtils.hintList)(token,[{label:"true",detail:String(_graphql.GraphQLBoolean),documentation:"Not false."},{label:"false",detail:String(_graphql.GraphQLBoolean),documentation:"Not true."}]):[]}function getSuggestionsForFragmentTypeConditions(token,typeInfo,schema){var possibleTypes=void 0;if(typeInfo.parentType)if((0,_graphql.isAbstractType)(typeInfo.parentType)){var abstractType=(0,_graphql.assertAbstractType)(typeInfo.parentType),possibleObjTypes=schema.getPossibleTypes(abstractType),possibleIfaceMap=Object.create(null);possibleObjTypes.forEach(function(type){type.getInterfaces().forEach(function(iface){possibleIfaceMap[iface.name]=iface})}),possibleTypes=possibleObjTypes.concat((0,_autocompleteUtils.objectValues)(possibleIfaceMap))}else possibleTypes=[typeInfo.parentType];else{var typeMap=schema.getTypeMap();possibleTypes=(0,_autocompleteUtils.objectValues)(typeMap).filter(_graphql.isCompositeType)}return(0,_autocompleteUtils.hintList)(token,possibleTypes.map(function(type){var namedType=(0,_graphql.getNamedType)(type);return{label:String(type),documentation:namedType&&namedType.description||""}}))}function getSuggestionsForFragmentSpread(token,typeInfo,schema,queryText){var typeMap=schema.getTypeMap(),defState=(0,_autocompleteUtils.getDefinitionState)(token.state),relevantFrags=getFragmentDefinitions(queryText).filter(function(frag){return typeMap[frag.typeCondition.name.value]&&!(defState&&"FragmentDefinition"===defState.kind&&defState.name===frag.name.value)&&(0,_graphql.isCompositeType)(typeInfo.parentType)&&(0,_graphql.isCompositeType)(typeMap[frag.typeCondition.name.value])&&(0,_graphql.doTypesOverlap)(schema,typeInfo.parentType,typeMap[frag.typeCondition.name.value])});return(0,_autocompleteUtils.hintList)(token,relevantFrags.map(function(frag){return{label:frag.name.value,detail:String(typeMap[frag.typeCondition.name.value]),documentation:"fragment "+frag.name.value+" on "+frag.typeCondition.name.value}}))}function getFragmentDefinitions(queryText){var fragmentDefs=[];return runOnlineParser(queryText,function(_,state){"FragmentDefinition"===state.kind&&state.name&&state.type&&fragmentDefs.push({kind:"FragmentDefinition",name:{kind:"Name",value:state.name},selectionSet:{kind:"SelectionSet",selections:[]},typeCondition:{kind:"NamedType",name:{kind:"Name",value:state.type}}})}),fragmentDefs}function getSuggestionsForVariableDefinition(token,schema){var inputTypeMap=schema.getTypeMap(),inputTypes=(0,_autocompleteUtils.objectValues)(inputTypeMap).filter(_graphql.isInputType);return(0,_autocompleteUtils.hintList)(token,inputTypes.map(function(type){return{label:type.name,documentation:type.description}}))}function getSuggestionsForDirective(token,state,schema){if(state.prevState&&state.prevState.kind){var directives=schema.getDirectives().filter(function(directive){return canUseDirective(state.prevState,directive)});return(0,_autocompleteUtils.hintList)(token,directives.map(function(directive){return{label:directive.name,documentation:directive.description||""}}))}return[]}function getTokenAtPosition(queryText,cursor){var styleAtCursor=null,stateAtCursor=null,stringAtCursor=null,token=runOnlineParser(queryText,function(stream,state,style,index){if(index===cursor.line&&stream.getCurrentPosition()>=cursor.character)return styleAtCursor=style,stateAtCursor=_extends({},state),stringAtCursor=stream.current(),"BREAK"});return{start:token.start,end:token.end,string:stringAtCursor||token.string,state:stateAtCursor||token.state,style:styleAtCursor||token.style}}function runOnlineParser(queryText,callback){for(var lines=queryText.split("\n"),parser=(0,_graphqlLanguageServiceParser.onlineParser)(),state=parser.startState(),style="",stream=new _graphqlLanguageServiceParser.CharacterStream(""),i=0;i<lines.length;i++){for(stream=new _graphqlLanguageServiceParser.CharacterStream(lines[i]);!stream.eol()&&"BREAK"!==callback(stream,state,style=parser.token(stream,state),i););callback(stream,state,style,i),state.kind||(state=parser.startState())}return{start:stream.getStartOfToken(),end:stream.getCurrentPosition(),string:stream.current(),state:state,style:style}}function canUseDirective(state,directive){if(!state||!state.kind)return!1;var kind=state.kind,locations=directive.locations;switch(kind){case"Query":return-1!==locations.indexOf("QUERY");case"Mutation":return-1!==locations.indexOf("MUTATION");case"Subscription":return-1!==locations.indexOf("SUBSCRIPTION");case"Field":case"AliasedField":return-1!==locations.indexOf("FIELD");case"FragmentDefinition":return-1!==locations.indexOf("FRAGMENT_DEFINITION");case"FragmentSpread":return-1!==locations.indexOf("FRAGMENT_SPREAD");case"InlineFragment":return-1!==locations.indexOf("INLINE_FRAGMENT");case"SchemaDef":return-1!==locations.indexOf("SCHEMA");case"ScalarDef":return-1!==locations.indexOf("SCALAR");case"ObjectTypeDef":return-1!==locations.indexOf("OBJECT");case"FieldDef":return-1!==locations.indexOf("FIELD_DEFINITION");case"InterfaceDef":return-1!==locations.indexOf("INTERFACE");case"UnionDef":return-1!==locations.indexOf("UNION");case"EnumDef":return-1!==locations.indexOf("ENUM");case"EnumValue":return-1!==locations.indexOf("ENUM_VALUE");case"InputDef":return-1!==locations.indexOf("INPUT_OBJECT");case"InputValueDef":switch(state.prevState&&state.prevState.kind){case"ArgumentsDef":return-1!==locations.indexOf("ARGUMENT_DEFINITION");case"InputDef":return-1!==locations.indexOf("INPUT_FIELD_DEFINITION")}}return!1}function getTypeInfo(schema,tokenState){var argDef=void 0,argDefs=void 0,directiveDef=void 0,enumValue=void 0,fieldDef=void 0,inputType=void 0,objectFieldDefs=void 0,parentType=void 0,type=void 0;return(0,_autocompleteUtils.forEachState)(tokenState,function(state){switch(state.kind){case"Query":case"ShortQuery":type=schema.getQueryType();break;case"Mutation":type=schema.getMutationType();break;case"Subscription":type=schema.getSubscriptionType();break;case"InlineFragment":case"FragmentDefinition":state.type&&(type=schema.getType(state.type));break;case"Field":case"AliasedField":type&&state.name?(fieldDef=parentType?(0,_autocompleteUtils.getFieldDef)(schema,parentType,state.name):null,type=fieldDef?fieldDef.type:null):fieldDef=null;break;case"SelectionSet":parentType=(0,_graphql.getNamedType)(type);break;case"Directive":directiveDef=state.name?schema.getDirective(state.name):null;break;case"Arguments":if(state.prevState)switch(state.prevState.kind){case"Field":argDefs=fieldDef&&fieldDef.args;break;case"Directive":argDefs=directiveDef&&directiveDef.args;break;case"AliasedField":var name=state.prevState&&state.prevState.name;if(!name){argDefs=null;break}var field=parentType?(0,_autocompleteUtils.getFieldDef)(schema,parentType,name):null;if(!field){argDefs=null;break}argDefs=field.args;break;default:argDefs=null}else argDefs=null;break;case"Argument":if(argDefs)for(var i=0;i<argDefs.length;i++)if(argDefs[i].name===state.name){argDef=argDefs[i];break}inputType=argDef&&argDef.type;break;case"EnumValue":var enumType=(0,_graphql.getNamedType)(inputType);enumValue=enumType instanceof _graphql.GraphQLEnumType?find(enumType.getValues(),function(val){return val.value===state.name}):null;break;case"ListValue":var nullableType=(0,_graphql.getNullableType)(inputType);inputType=nullableType instanceof _graphql.GraphQLList?nullableType.ofType:null;break;case"ObjectValue":var objectType=(0,_graphql.getNamedType)(inputType);objectFieldDefs=objectType instanceof _graphql.GraphQLInputObjectType?objectType.getFields():null;break;case"ObjectField":var objectField=state.name&&objectFieldDefs?objectFieldDefs[state.name]:null;inputType=objectField&&objectField.type;break;case"NamedType":state.name&&(type=schema.getType(state.name))}}),{argDef:argDef,argDefs:argDefs,directiveDef:directiveDef,enumValue:enumValue,fieldDef:fieldDef,inputType:inputType,objectFieldDefs:objectFieldDefs,parentType:parentType,type:type}}function find(array,predicate){for(var i=0;i<array.length;i++)if(predicate(array[i]))return array[i];return null}Object.defineProperty(exports,"__esModule",{value:!0});var _extends=Object.assign||function(target){for(var i=1;i<arguments.length;i++){var source=arguments[i];for(var key in source)Object.prototype.hasOwnProperty.call(source,key)&&(target[key]=source[key])}return target};exports.getAutocompleteSuggestions=function(schema,queryText,cursor,contextToken){var token=contextToken||getTokenAtPosition(queryText,cursor),state="Invalid"===token.state.kind?token.state.prevState:token.state;if(!state)return[];var kind=state.kind,step=state.step,typeInfo=getTypeInfo(schema,token.state);if("Document"===kind)return(0,_autocompleteUtils.hintList)(token,[{label:"query"},{label:"mutation"},{label:"subscription"},{label:"fragment"},{label:"{"}]);if("SelectionSet"===kind||"Field"===kind||"AliasedField"===kind)return getSuggestionsForFieldNames(token,typeInfo,schema);if("Arguments"===kind||"Argument"===kind&&0===step){var argDefs=typeInfo.argDefs;if(argDefs)return(0,_autocompleteUtils.hintList)(token,argDefs.map(function(argDef){return{label:argDef.name,detail:String(argDef.type),documentation:argDef.description}}))}if(("ObjectValue"===kind||"ObjectField"===kind&&0===step)&&typeInfo.objectFieldDefs){var objectFields=(0,_autocompleteUtils.objectValues)(typeInfo.objectFieldDefs);return(0,_autocompleteUtils.hintList)(token,objectFields.map(function(field){return{label:field.name,detail:String(field.type),documentation:field.description}}))}return"EnumValue"===kind||"ListValue"===kind&&1===step||"ObjectField"===kind&&2===step||"Argument"===kind&&2===step?getSuggestionsForInputValues(token,typeInfo):"TypeCondition"===kind&&1===step||"NamedType"===kind&&null!=state.prevState&&"TypeCondition"===state.prevState.kind?getSuggestionsForFragmentTypeConditions(token,typeInfo,schema):"FragmentSpread"===kind&&1===step?getSuggestionsForFragmentSpread(token,typeInfo,schema,queryText):"VariableDefinition"===kind&&2===step||"ListType"===kind&&1===step||"NamedType"===kind&&state.prevState&&("VariableDefinition"===state.prevState.kind||"ListType"===state.prevState.kind)?getSuggestionsForVariableDefinition(token,schema):"Directive"===kind?getSuggestionsForDirective(token,state,schema):[]};var _graphql=require("graphql"),_graphqlLanguageServiceParser=require("graphql-language-service-parser"),_autocompleteUtils=require("./autocompleteUtils")},{"./autocompleteUtils":71,graphql:95,"graphql-language-service-parser":80}],73:[function(require,module,exports){(function(process){"use strict";function getRange(text,node){var location=node.loc;return(0,_assert2.default)(location,"Expected ASTNode to have a location."),(0,_graphqlLanguageServiceUtils.locToRange)(text,location)}function getPosition(text,node){var location=node.loc;return(0,_assert2.default)(location,"Expected ASTNode to have a location."),(0,_graphqlLanguageServiceUtils.offsetToPosition)(text,location.start)}function getDefinitionForFragmentDefinition(path,text,definition){var name=definition.name;return(0,_assert2.default)(name,"Expected ASTNode to have a Name."),{path:path,position:getPosition(text,name),range:getRange(text,definition),name:name.value||"",language:LANGUAGE,projectRoot:path}}Object.defineProperty(exports,"__esModule",{value:!0}),exports.LANGUAGE=void 0,exports.getDefinitionQueryResultForFragmentSpread=function(text,fragment,dependencies){var name,defNodes,definitions;return regeneratorRuntime.async(function(_context){for(;;)switch(_context.prev=_context.next){case 0:if(name=fragment.name.value,0!==(defNodes=dependencies.filter(function(_ref){return _ref.definition.name.value===name})).length){_context.next=5;break}return process.stderr.write("Definition not found for GraphQL fragment "+name),_context.abrupt("return",{queryRange:[],definitions:[]});case 5:return definitions=defNodes.map(function(_ref2){var filePath=_ref2.filePath,content=_ref2.content,definition=_ref2.definition;return getDefinitionForFragmentDefinition(filePath||"",content,definition)}),_context.abrupt("return",{definitions:definitions,queryRange:definitions.map(function(_){return getRange(text,fragment)})});case 7:case"end":return _context.stop()}},null,this)},exports.getDefinitionQueryResultForDefinitionNode=function(path,text,definition){return{definitions:[getDefinitionForFragmentDefinition(path,text,definition)],queryRange:definition.name?[getRange(text,definition.name)]:[]}};var _graphqlLanguageServiceUtils=require("graphql-language-service-utils"),_assert2=function(obj){return obj&&obj.__esModule?obj:{default:obj}}(require("assert")),LANGUAGE=exports.LANGUAGE="GraphQL"}).call(this,require("_process"))},{_process:229,assert:35,"graphql-language-service-utils":84}],74:[function(require,module,exports){"use strict";function mapCat(array,mapper){return Array.prototype.concat.apply([],array.map(mapper))}function annotations(error,severity,type){return error.nodes?error.nodes.map(function(node){var highlightNode="Variable"!==node.kind&&node.name?node.name:node.variable?node.variable:node;(0,_assert2.default)(error.locations,"GraphQL validation error requires locations.");var loc=error.locations[0],highlightLoc=getLocation(highlightNode),end=loc.column+(highlightLoc.end-highlightLoc.start);return{source:"GraphQL: "+type,message:error.message,severity:severity,range:new _graphqlLanguageServiceUtils.Range(new _graphqlLanguageServiceUtils.Position(loc.line-1,loc.column-1),new _graphqlLanguageServiceUtils.Position(loc.line-1,end))}}):[]}function getLocation(node){var location=node.loc;return(0,_assert2.default)(location,"Expected ASTNode to have a location."),location}function getRange(location,queryText){var parser=(0,_graphqlLanguageServiceParser.onlineParser)(),state=parser.startState(),lines=queryText.split("\n");(0,_assert2.default)(lines.length>=location.line,"Query text must have more lines than where the error happened");for(var stream=null,i=0;i<location.line;i++)for(stream=new _graphqlLanguageServiceParser.CharacterStream(lines[i]);!stream.eol()&&"invalidchar"!==parser.token(stream,state););(0,_assert2.default)(stream,"Expected Parser stream to be available.");var line=location.line-1,start=stream.getStartOfToken(),end=stream.getCurrentPosition();return new _graphqlLanguageServiceUtils.Range(new _graphqlLanguageServiceUtils.Position(line,start),new _graphqlLanguageServiceUtils.Position(line,end))}Object.defineProperty(exports,"__esModule",{value:!0}),exports.SEVERITY=void 0,exports.getDiagnostics=function(queryText){var schema=arguments.length>1&&void 0!==arguments[1]?arguments[1]:null,customRules=arguments[2],ast=null;try{ast=(0,_graphql.parse)(queryText)}catch(error){var range=getRange(error.locations[0],queryText);return[{severity:SEVERITY.ERROR,message:error.message,source:"GraphQL: Syntax",range:range}]}if(!schema)return[];var validationErrorAnnotations=mapCat((0,_graphqlLanguageServiceUtils.validateWithCustomRules)(schema,ast,customRules),function(error){return annotations(error,SEVERITY.ERROR,"Validation")}),deprecationWarningAnnotations=_graphql.findDeprecatedUsages?mapCat((0,_graphql.findDeprecatedUsages)(schema,ast),function(error){return annotations(error,SEVERITY.WARNING,"Deprecation")}):[];return validationErrorAnnotations.concat(deprecationWarningAnnotations)};var _assert2=function(obj){return obj&&obj.__esModule?obj:{default:obj}}(require("assert")),_graphql=require("graphql"),_graphqlLanguageServiceParser=require("graphql-language-service-parser"),_graphqlLanguageServiceUtils=require("graphql-language-service-utils"),SEVERITY=exports.SEVERITY={ERROR:1,WARNING:2,INFORMATION:3,HINT:4}},{assert:35,graphql:95,"graphql-language-service-parser":80,"graphql-language-service-utils":84}],75:[function(require,module,exports){"use strict";function outlineTreeConverter(docText){var meta=function(node){return{representativeName:node.name,startPosition:(0,_graphqlLanguageServiceUtils.offsetToPosition)(docText,node.loc.start),endPosition:(0,_graphqlLanguageServiceUtils.offsetToPosition)(docText,node.loc.end),children:node.selectionSet||[]}};return{Field:function(node){var tokenizedText=node.alias?[buildToken("plain",node.alias),buildToken("plain",": ")]:[];return tokenizedText.push(buildToken("plain",node.name)),_extends({tokenizedText:tokenizedText},meta(node))},OperationDefinition:function(node){return _extends({tokenizedText:[buildToken("keyword",node.operation),buildToken("whitespace"," "),buildToken("class-name",node.name)]},meta(node))},Document:function(node){return node.definitions},SelectionSet:function(node){return concatMap(node.selections,function(child){return child.kind===_kinds.INLINE_FRAGMENT?child.selectionSet:child})},Name:function(node){return node.value},FragmentDefinition:function(node){return _extends({tokenizedText:[buildToken("keyword","fragment"),buildToken("whitespace"," "),buildToken("class-name",node.name)]},meta(node))},FragmentSpread:function(node){return _extends({tokenizedText:[buildToken("plain","..."),buildToken("class-name",node.name)]},meta(node))},InlineFragment:function(node){return node.selectionSet}}}function buildToken(kind,value){return{kind:kind,value:value}}function concatMap(arr,fn){for(var res=[],i=0;i<arr.length;i++){var x=fn(arr[i],i);Array.isArray(x)?res.push.apply(res,x):res.push(x)}return res}Object.defineProperty(exports,"__esModule",{value:!0});var _extends=Object.assign||function(target){for(var i=1;i<arguments.length;i++){var source=arguments[i];for(var key in source)Object.prototype.hasOwnProperty.call(source,key)&&(target[key]=source[key])}return target};exports.getOutline=function(queryText){var ast=void 0;try{ast=(0,_graphql.parse)(queryText)}catch(error){return null}var visitorFns=outlineTreeConverter(queryText);return{outlineTrees:(0,_graphql.visit)(ast,{leave:function(node){return OUTLINEABLE_KINDS[node.kind]&&visitorFns[node.kind]?visitorFns[node.kind](node):null}})}};var _graphql=require("graphql"),_kinds=require("graphql/language/kinds"),_graphqlLanguageServiceUtils=require("graphql-language-service-utils"),OUTLINEABLE_KINDS={Field:!0,OperationDefinition:!0,Document:!0,SelectionSet:!0,Name:!0,FragmentDefinition:!0,FragmentSpread:!0,InlineFragment:!0}},{graphql:95,"graphql-language-service-utils":84,"graphql/language/kinds":105}],76:[function(require,module,exports){"use strict";Object.defineProperty(exports,"__esModule",{value:!0});var _autocompleteUtils=require("./autocompleteUtils");Object.defineProperty(exports,"getDefinitionState",{enumerable:!0,get:function(){return _autocompleteUtils.getDefinitionState}}),Object.defineProperty(exports,"getFieldDef",{enumerable:!0,get:function(){return _autocompleteUtils.getFieldDef}}),Object.defineProperty(exports,"forEachState",{enumerable:!0,get:function(){return _autocompleteUtils.forEachState}}),Object.defineProperty(exports,"objectValues",{enumerable:!0,get:function(){return _autocompleteUtils.objectValues}}),Object.defineProperty(exports,"hintList",{enumerable:!0,get:function(){return _autocompleteUtils.hintList}});var _getAutocompleteSuggestions=require("./getAutocompleteSuggestions");Object.defineProperty(exports,"getAutocompleteSuggestions",{enumerable:!0,get:function(){return _getAutocompleteSuggestions.getAutocompleteSuggestions}});var _getDefinition=require("./getDefinition");Object.defineProperty(exports,"LANGUAGE",{enumerable:!0,get:function(){return _getDefinition.LANGUAGE}}),Object.defineProperty(exports,"getDefinitionQueryResultForFragmentSpread",{enumerable:!0,get:function(){return _getDefinition.getDefinitionQueryResultForFragmentSpread}}),Object.defineProperty(exports,"getDefinitionQueryResultForDefinitionNode",{enumerable:!0,get:function(){return _getDefinition.getDefinitionQueryResultForDefinitionNode}});var _getDiagnostics=require("./getDiagnostics");Object.defineProperty(exports,"getDiagnostics",{enumerable:!0,get:function(){return _getDiagnostics.getDiagnostics}});var _getOutline=require("./getOutline");Object.defineProperty(exports,"getOutline",{enumerable:!0,get:function(){return _getOutline.getOutline}});var _GraphQLLanguageService=require("./GraphQLLanguageService");Object.defineProperty(exports,"GraphQLLanguageService",{enumerable:!0,get:function(){return _GraphQLLanguageService.GraphQLLanguageService}})},{"./GraphQLLanguageService":70,"./autocompleteUtils":71,"./getAutocompleteSuggestions":72,"./getDefinition":73,"./getDiagnostics":74,"./getOutline":75}],77:[function(require,module,exports){"use strict";function _classCallCheck(instance,Constructor){if(!(instance instanceof Constructor))throw new TypeError("Cannot call a class as a function")}Object.defineProperty(exports,"__esModule",{value:!0});var CharacterStream=function(){function CharacterStream(sourceText){var _this=this;_classCallCheck(this,CharacterStream),this.getStartOfToken=function(){return _this._start},this.getCurrentPosition=function(){return _this._pos},this.eol=function(){return _this._sourceText.length===_this._pos},this.sol=function(){return 0===_this._pos},this.peek=function(){return _this._sourceText.charAt(_this._pos)?_this._sourceText.charAt(_this._pos):null},this.next=function(){var char=_this._sourceText.charAt(_this._pos);return _this._pos++,char},this.eat=function(pattern){if(_this._testNextCharacter(pattern))return _this._start=_this._pos,_this._pos++,_this._sourceText.charAt(_this._pos-1)},this.eatWhile=function(match){var isMatched=_this._testNextCharacter(match),didEat=!1;for(isMatched&&(didEat=isMatched,_this._start=_this._pos);isMatched;)_this._pos++,isMatched=_this._testNextCharacter(match),didEat=!0;return didEat},this.eatSpace=function(){return _this.eatWhile(/[\s\u00a0]/)},this.skipToEnd=function(){_this._pos=_this._sourceText.length},this.skipTo=function(position){_this._pos=position},this.match=function(pattern){var consume=!(arguments.length>1&&void 0!==arguments[1])||arguments[1],caseFold=arguments.length>2&&void 0!==arguments[2]&&arguments[2],token=null,match=null;return"string"==typeof pattern?(match=new RegExp(pattern,caseFold?"i":"g").test(_this._sourceText.substr(_this._pos,pattern.length)),token=pattern):pattern instanceof RegExp&&(token=(match=_this._sourceText.slice(_this._pos).match(pattern))&&match[0]),!(null==match||!("string"==typeof pattern||match instanceof Array&&_this._sourceText.startsWith(match[0],_this._pos)))&&(consume&&(_this._start=_this._pos,token&&token.length&&(_this._pos+=token.length)),match)},this.backUp=function(num){_this._pos-=num},this.column=function(){return _this._pos},this.indentation=function(){var match=_this._sourceText.match(/\s*/),indent=0;if(match&&0===match.length)for(var whitespaces=match[0],pos=0;whitespaces.length>pos;)9===whitespaces.charCodeAt(pos)?indent+=2:indent++,pos++;return indent},this.current=function(){return _this._sourceText.slice(_this._start,_this._pos)},this._start=0,this._pos=0,this._sourceText=sourceText}return CharacterStream.prototype._testNextCharacter=function(pattern){var character=this._sourceText.charAt(this._pos);return"string"==typeof pattern?character===pattern:pattern instanceof RegExp?pattern.test(character):pattern(character)},CharacterStream}();exports.default=CharacterStream},{}],78:[function(require,module,exports){"use strict";Object.defineProperty(exports,"__esModule",{value:!0}),exports.opt=function(ofRule){return{ofRule:ofRule}},exports.list=function(ofRule,separator){return{ofRule:ofRule,isList:!0,separator:separator}},exports.butNot=function(rule,exclusions){var ruleMatch=rule.match;return rule.match=function(token){var check=!1;return ruleMatch&&(check=ruleMatch(token)),check&&exclusions.every(function(exclusion){return exclusion.match&&!exclusion.match(token)})},rule},exports.t=function(kind,style){return{style:style,match:function(token){return token.kind===kind}}},exports.p=function(value,style){return{style:style||"punctuation",match:function(token){return"Punctuation"===token.kind&&token.value===value}}}},{}],79:[function(require,module,exports){"use strict";function word(value){return{style:"keyword",match:function(token){return"Name"===token.kind&&token.value===value}}}function name(style){return{style:style,match:function(token){return"Name"===token.kind},update:function(state,token){state.name=token.value}}}Object.defineProperty(exports,"__esModule",{value:!0}),exports.ParseRules=exports.LexRules=exports.isIgnored=void 0;var _RuleHelpers=require("./RuleHelpers");exports.isIgnored=function(ch){return" "===ch||"\t"===ch||","===ch||"\n"===ch||"\r"===ch||"\ufeff"===ch},exports.LexRules={Name:/^[_A-Za-z][_0-9A-Za-z]*/,Punctuation:/^(?:!|\$|\(|\)|\.\.\.|:|=|@|\[|]|\{|\||\})/,Number:/^-?(?:0|(?:[1-9][0-9]*))(?:\.[0-9]*)?(?:[eE][+-]?[0-9]+)?/,String:/^"(?:[^"\\]|\\(?:"|\/|\\|b|f|n|r|t|u[0-9a-fA-F]{4}))*"?/,Comment:/^#.*/},exports.ParseRules={Document:[(0,_RuleHelpers.list)("Definition")],Definition:function(token){switch(token.value){case"{":return"ShortQuery";case"query":return"Query";case"mutation":return"Mutation";case"subscription":return"Subscription";case"fragment":return"FragmentDefinition";case"schema":return"SchemaDef";case"scalar":return"ScalarDef";case"type":return"ObjectTypeDef";case"interface":return"InterfaceDef";case"union":return"UnionDef";case"enum":return"EnumDef";case"input":return"InputDef";case"extend":return"ExtendDef";case"directive":return"DirectiveDef"}},ShortQuery:["SelectionSet"],Query:[word("query"),(0,_RuleHelpers.opt)(name("def")),(0,_RuleHelpers.opt)("VariableDefinitions"),(0,_RuleHelpers.list)("Directive"),"SelectionSet"],Mutation:[word("mutation"),(0,_RuleHelpers.opt)(name("def")),(0,_RuleHelpers.opt)("VariableDefinitions"),(0,_RuleHelpers.list)("Directive"),"SelectionSet"],Subscription:[word("subscription"),(0,_RuleHelpers.opt)(name("def")),(0,_RuleHelpers.opt)("VariableDefinitions"),(0,_RuleHelpers.list)("Directive"),"SelectionSet"],VariableDefinitions:[(0,_RuleHelpers.p)("("),(0,_RuleHelpers.list)("VariableDefinition"),(0,_RuleHelpers.p)(")")],VariableDefinition:["Variable",(0,_RuleHelpers.p)(":"),"Type",(0,_RuleHelpers.opt)("DefaultValue")],Variable:[(0,_RuleHelpers.p)("$","variable"),name("variable")],DefaultValue:[(0,_RuleHelpers.p)("="),"Value"],SelectionSet:[(0,_RuleHelpers.p)("{"),(0,_RuleHelpers.list)("Selection"),(0,_RuleHelpers.p)("}")],Selection:function(token,stream){return"..."===token.value?stream.match(/[\s\u00a0,]*(on\b|@|{)/,!1)?"InlineFragment":"FragmentSpread":stream.match(/[\s\u00a0,]*:/,!1)?"AliasedField":"Field"},AliasedField:[name("property"),(0,_RuleHelpers.p)(":"),name("qualifier"),(0,_RuleHelpers.opt)("Arguments"),(0,_RuleHelpers.list)("Directive"),(0,_RuleHelpers.opt)("SelectionSet")],Field:[name("property"),(0,_RuleHelpers.opt)("Arguments"),(0,_RuleHelpers.list)("Directive"),(0,_RuleHelpers.opt)("SelectionSet")],Arguments:[(0,_RuleHelpers.p)("("),(0,_RuleHelpers.list)("Argument"),(0,_RuleHelpers.p)(")")],Argument:[name("attribute"),(0,_RuleHelpers.p)(":"),"Value"],FragmentSpread:[(0,_RuleHelpers.p)("..."),name("def"),(0,_RuleHelpers.list)("Directive")],InlineFragment:[(0,_RuleHelpers.p)("..."),(0,_RuleHelpers.opt)("TypeCondition"),(0,_RuleHelpers.list)("Directive"),"SelectionSet"],FragmentDefinition:[word("fragment"),(0,_RuleHelpers.opt)((0,_RuleHelpers.butNot)(name("def"),[word("on")])),"TypeCondition",(0,_RuleHelpers.list)("Directive"),"SelectionSet"],TypeCondition:[word("on"),"NamedType"],Value:function(token){switch(token.kind){case"Number":return"NumberValue";case"String":return"StringValue";case"Punctuation":switch(token.value){case"[":return"ListValue";case"{":return"ObjectValue";case"$":return"Variable"}return null;case"Name":switch(token.value){case"true":case"false":return"BooleanValue"}return"null"===token.value?"NullValue":"EnumValue"}},NumberValue:[(0,_RuleHelpers.t)("Number","number")],StringValue:[(0,_RuleHelpers.t)("String","string")],BooleanValue:[(0,_RuleHelpers.t)("Name","builtin")],NullValue:[(0,_RuleHelpers.t)("Name","keyword")],EnumValue:[name("string-2")],ListValue:[(0,_RuleHelpers.p)("["),(0,_RuleHelpers.list)("Value"),(0,_RuleHelpers.p)("]")],ObjectValue:[(0,_RuleHelpers.p)("{"),(0,_RuleHelpers.list)("ObjectField"),(0,_RuleHelpers.p)("}")],ObjectField:[name("attribute"),(0,_RuleHelpers.p)(":"),"Value"],Type:function(token){return"["===token.value?"ListType":"NonNullType"},ListType:[(0,_RuleHelpers.p)("["),"Type",(0,_RuleHelpers.p)("]"),(0,_RuleHelpers.opt)((0,_RuleHelpers.p)("!"))],NonNullType:["NamedType",(0,_RuleHelpers.opt)((0,_RuleHelpers.p)("!"))],NamedType:[{style:"atom",match:function(token){return"Name"===token.kind},update:function(state,token){state.prevState&&state.prevState.prevState&&(state.name=token.value,state.prevState.prevState.type=token.value)}}],Directive:[(0,_RuleHelpers.p)("@","meta"),name("meta"),(0,_RuleHelpers.opt)("Arguments")],SchemaDef:[word("schema"),(0,_RuleHelpers.list)("Directive"),(0,_RuleHelpers.p)("{"),(0,_RuleHelpers.list)("OperationTypeDef"),(0,_RuleHelpers.p)("}")],OperationTypeDef:[name("keyword"),(0,_RuleHelpers.p)(":"),name("atom")],ScalarDef:[word("scalar"),name("atom"),(0,_RuleHelpers.list)("Directive")],ObjectTypeDef:[word("type"),name("atom"),(0,_RuleHelpers.opt)("Implements"),(0,_RuleHelpers.list)("Directive"),(0,_RuleHelpers.p)("{"),(0,_RuleHelpers.list)("FieldDef"),(0,_RuleHelpers.p)("}")],Implements:[word("implements"),(0,_RuleHelpers.list)("NamedType")],FieldDef:[name("property"),(0,_RuleHelpers.opt)("ArgumentsDef"),(0,_RuleHelpers.p)(":"),"Type",(0,_RuleHelpers.list)("Directive")],ArgumentsDef:[(0,_RuleHelpers.p)("("),(0,_RuleHelpers.list)("InputValueDef"),(0,_RuleHelpers.p)(")")],InputValueDef:[name("attribute"),(0,_RuleHelpers.p)(":"),"Type",(0,_RuleHelpers.opt)("DefaultValue"),(0,_RuleHelpers.list)("Directive")],InterfaceDef:[word("interface"),name("atom"),(0,_RuleHelpers.list)("Directive"),(0,_RuleHelpers.p)("{"),(0,_RuleHelpers.list)("FieldDef"),(0,_RuleHelpers.p)("}")],UnionDef:[word("union"),name("atom"),(0,_RuleHelpers.list)("Directive"),(0,_RuleHelpers.p)("="),(0,_RuleHelpers.list)("UnionMember",(0,_RuleHelpers.p)("|"))],UnionMember:["NamedType"],EnumDef:[word("enum"),name("atom"),(0,_RuleHelpers.list)("Directive"),(0,_RuleHelpers.p)("{"),(0,_RuleHelpers.list)("EnumValueDef"),(0,_RuleHelpers.p)("}")],EnumValueDef:[name("string-2"),(0,_RuleHelpers.list)("Directive")],InputDef:[word("input"),name("atom"),(0,_RuleHelpers.list)("Directive"),(0,_RuleHelpers.p)("{"),(0,_RuleHelpers.list)("InputValueDef"),(0,_RuleHelpers.p)("}")],ExtendDef:[word("extend"),"ObjectTypeDef"],DirectiveDef:[word("directive"),(0,_RuleHelpers.p)("@","meta"),name("meta"),(0,_RuleHelpers.opt)("ArgumentsDef"),word("on"),(0,_RuleHelpers.list)("DirectiveLocation",(0,_RuleHelpers.p)("|"))],DirectiveLocation:[name("string-2")]}},{"./RuleHelpers":78}],80:[function(require,module,exports){"use strict";function _interopRequireDefault(obj){return obj&&obj.__esModule?obj:{default:obj}}Object.defineProperty(exports,"__esModule",{value:!0});var _CharacterStream=require("./CharacterStream");Object.defineProperty(exports,"CharacterStream",{enumerable:!0,get:function(){return _interopRequireDefault(_CharacterStream).default}});var _Rules=require("./Rules");Object.defineProperty(exports,"LexRules",{enumerable:!0,get:function(){return _Rules.LexRules}}),Object.defineProperty(exports,"ParseRules",{enumerable:!0,get:function(){return _Rules.ParseRules}}),Object.defineProperty(exports,"isIgnored",{enumerable:!0,get:function(){return _Rules.isIgnored}});var _RuleHelpers=require("./RuleHelpers");Object.defineProperty(exports,"butNot",{enumerable:!0,get:function(){return _RuleHelpers.butNot}}),Object.defineProperty(exports,"list",{enumerable:!0,get:function(){return _RuleHelpers.list}}),Object.defineProperty(exports,"opt",{enumerable:!0,get:function(){return _RuleHelpers.opt}}),Object.defineProperty(exports,"p",{enumerable:!0,get:function(){return _RuleHelpers.p}}),Object.defineProperty(exports,"t",{enumerable:!0,get:function(){return _RuleHelpers.t}});var _onlineParser=require("./onlineParser");Object.defineProperty(exports,"onlineParser",{enumerable:!0,get:function(){return _interopRequireDefault(_onlineParser).default}})},{"./CharacterStream":77,"./RuleHelpers":78,"./Rules":79,"./onlineParser":81}],81:[function(require,module,exports){"use strict";function getToken(stream,state,options){var lexRules=options.lexRules,parseRules=options.parseRules,eatWhitespace=options.eatWhitespace,editorConfig=options.editorConfig;if(state.rule&&0===state.rule.length?popRule(state):state.needsAdvance&&(state.needsAdvance=!1,advanceRule(state,!0)),stream.sol()){var tabSize=editorConfig&&editorConfig.tabSize||2;state.indentLevel=Math.floor(stream.indentation()/tabSize)}if(eatWhitespace(stream))return"ws";var token=lex(lexRules,stream);if(!token)return stream.match(/\S+/),pushRule(SpecialParseRules,state,"Invalid"),"invalidchar";if("Comment"===token.kind)return pushRule(SpecialParseRules,state,"Comment"),"comment";var backupState=assign({},state);if("Punctuation"===token.kind)if(/^[{([]/.test(token.value))state.levels=(state.levels||[]).concat(state.indentLevel+1);else if(/^[})\]]/.test(token.value)){var levels=state.levels=(state.levels||[]).slice(0,-1);state.indentLevel&&levels.length>0&&levels[levels.length-1]<state.indentLevel&&(state.indentLevel=levels[levels.length-1])}for(;state.rule;){var expected="function"==typeof state.rule?0===state.step?state.rule(token,stream):null:state.rule[state.step];if(state.needsSeperator&&(expected=expected&&expected.separator),expected){if(expected.ofRule&&(expected=expected.ofRule),"string"==typeof expected){pushRule(parseRules,state,expected);continue}if(expected.match&&expected.match(token))return expected.update&&expected.update(state,token),"Punctuation"===token.kind?advanceRule(state,!0):state.needsAdvance=!0,expected.style}unsuccessful(state)}return assign(state,backupState),pushRule(SpecialParseRules,state,"Invalid"),"invalidchar"}function assign(to,from){for(var keys=Object.keys(from),i=0;i<keys.length;i++)to[keys[i]]=from[keys[i]];return to}function pushRule(rules,state,ruleKind){if(!rules[ruleKind])throw new TypeError("Unknown rule: "+ruleKind);state.prevState=_extends({},state),state.kind=ruleKind,state.name=null,state.type=null,state.rule=rules[ruleKind],state.step=0,state.needsSeperator=!1}function popRule(state){state.prevState&&(state.kind=state.prevState.kind,state.name=state.prevState.name,state.type=state.prevState.type,state.rule=state.prevState.rule,state.step=state.prevState.step,state.needsSeperator=state.prevState.needsSeperator,state.prevState=state.prevState.prevState)}function advanceRule(state,successful){if(isList(state)){if(state.rule&&state.rule[state.step].separator){var separator=state.rule[state.step].separator;if(state.needsSeperator=!state.needsSeperator,!state.needsSeperator&&separator.ofRule)return}if(successful)return}for(state.needsSeperator=!1,state.step++;state.rule&&!(Array.isArray(state.rule)&&state.step<state.rule.length);)popRule(state),state.rule&&(isList(state)?state.rule&&state.rule[state.step].separator&&(state.needsSeperator=!state.needsSeperator):(state.needsSeperator=!1,state.step++))}function isList(state){return Array.isArray(state.rule)&&"string"!=typeof state.rule[state.step]&&state.rule[state.step].isList}function unsuccessful(state){for(;state.rule&&(!Array.isArray(state.rule)||!state.rule[state.step].ofRule);)popRule(state);state.rule&&advanceRule(state,!1)}function lex(lexRules,stream){for(var kinds=Object.keys(lexRules),i=0;i<kinds.length;i++){var match=stream.match(lexRules[kinds[i]]);if(match&&match instanceof Array)return{kind:kinds[i],value:match[0]}}}Object.defineProperty(exports,"__esModule",{value:!0});var _extends=Object.assign||function(target){for(var i=1;i<arguments.length;i++){var source=arguments[i];for(var key in source)Object.prototype.hasOwnProperty.call(source,key)&&(target[key]=source[key])}return target};exports.default=function(){var options=arguments.length>0&&void 0!==arguments[0]?arguments[0]:{eatWhitespace:function(stream){return stream.eatWhile(_Rules.isIgnored)},lexRules:_Rules.LexRules,parseRules:_Rules.ParseRules,editorConfig:{}};return{startState:function(){var initialState={level:0,step:0,name:null,kind:null,type:null,rule:null,needsSeperator:!1,prevState:null};return pushRule(options.parseRules,initialState,"Document"),initialState},token:function(stream,state){return getToken(stream,state,options)}}};var _Rules=require("./Rules"),SpecialParseRules={Invalid:[],Comment:[]}},{"./Rules":79}],82:[function(require,module,exports){"use strict";function _classCallCheck(instance,Constructor){if(!(instance instanceof Constructor))throw new TypeError("Cannot call a class as a function")}function offsetToPosition(text,loc){var buf=text.slice(0,loc),lines=buf.split("\n").length-1,lastLineIndex=buf.lastIndexOf("\n");return new Position(lines,loc-lastLineIndex-1)}Object.defineProperty(exports,"__esModule",{value:!0}),exports.offsetToPosition=offsetToPosition,exports.locToRange=function(text,loc){var start=offsetToPosition(text,loc.start),end=offsetToPosition(text,loc.end);return new Range(start,end)};var Range=exports.Range=function(){function Range(start,end){var _this=this;_classCallCheck(this,Range),this.containsPosition=function(position){return _this.start.line===position.line?_this.start.character<=position.character:_this.end.line===position.line?_this.end.character>=position.character:_this.start.line<=position.line&&_this.end.line>=position.line},this.start=start,this.end=end}return Range.prototype.setStart=function(line,character){this.start=new Position(line,character)},Range.prototype.setEnd=function(line,character){this.end=new Position(line,character)},Range}(),Position=exports.Position=function(){function Position(line,character){var _this2=this;_classCallCheck(this,Position),this.lessThanOrEqualTo=function(position){return _this2.line<position.line||_this2.line===position.line&&_this2.character<=position.character},this.line=line,this.character=character}return Position.prototype.setLine=function(line){this.line=line},Position.prototype.setCharacter=function(character){this.character=character},Position}()},{}],83:[function(require,module,exports){"use strict";function pointToOffset(text,point){var linesUntilPosition=text.split("\n").slice(0,point.line);return point.character+linesUntilPosition.map(function(line){return line.length+1}).reduce(function(a,b){return a+b},0)}Object.defineProperty(exports,"__esModule",{value:!0}),exports.getASTNodeAtPosition=function(query,ast,point){var offset=pointToOffset(query,point),nodeContainingPosition=void 0;return(0,_graphql.visit)(ast,{enter:function(node){if(!("Name"!==node.kind&&node.loc.start<=offset&&offset<=node.loc.end))return!1;nodeContainingPosition=node},leave:function(node){if(node.loc.start<=offset&&offset<=node.loc.end)return!1}}),nodeContainingPosition},exports.pointToOffset=pointToOffset;require("./Range");var _graphql=require("graphql")},{"./Range":82,graphql:95}],84:[function(require,module,exports){"use strict";Object.defineProperty(exports,"__esModule",{value:!0});var _getASTNodeAtPosition=require("./getASTNodeAtPosition");Object.defineProperty(exports,"getASTNodeAtPosition",{enumerable:!0,get:function(){return _getASTNodeAtPosition.getASTNodeAtPosition}}),Object.defineProperty(exports,"pointToOffset",{enumerable:!0,get:function(){return _getASTNodeAtPosition.pointToOffset}});var _Range=require("./Range");Object.defineProperty(exports,"Position",{enumerable:!0,get:function(){return _Range.Position}}),Object.defineProperty(exports,"Range",{enumerable:!0,get:function(){return _Range.Range}}),Object.defineProperty(exports,"locToRange",{enumerable:!0,get:function(){return _Range.locToRange}}),Object.defineProperty(exports,"offsetToPosition",{enumerable:!0,get:function(){return _Range.offsetToPosition}});var _validateWithCustomRules=require("./validateWithCustomRules");Object.defineProperty(exports,"validateWithCustomRules",{enumerable:!0,get:function(){return _validateWithCustomRules.validateWithCustomRules}})},{"./Range":82,"./getASTNodeAtPosition":83,"./validateWithCustomRules":85}],85:[function(require,module,exports){"use strict";Object.defineProperty(exports,"__esModule",{value:!0}),exports.validateWithCustomRules=function(schema,ast,customRules){var NoUnusedFragments=require("graphql/validation/rules/NoUnusedFragments").NoUnusedFragments,rules=_graphql.specifiedRules.filter(function(rule){return rule!==NoUnusedFragments}),typeInfo=new _graphql.TypeInfo(schema);customRules&&Array.prototype.push.apply(rules,customRules);var errors=(0,_graphql.validate)(schema,ast,rules,typeInfo);return errors.length>0?errors:[]};var _graphql=require("graphql")},{graphql:95,"graphql/validation/rules/NoUnusedFragments":152}],86:[function(require,module,exports){"use strict";function GraphQLError(message,nodes,source,positions,path,originalError){var _source=source;if(!_source&&nodes&&nodes.length>0){var node=nodes[0];_source=node&&node.loc&&node.loc.source}var _positions=positions;!_positions&&nodes&&(_positions=nodes.filter(function(node){return Boolean(node.loc)}).map(function(node){return node.loc.start})),_positions&&0===_positions.length&&(_positions=void 0);var _locations=void 0,_source2=_source;_source2&&_positions&&(_locations=_positions.map(function(pos){return(0,_location.getLocation)(_source2,pos)})),Object.defineProperties(this,{message:{value:message,enumerable:!0,writable:!0},locations:{value:_locations||void 0,enumerable:!0},path:{value:path||void 0,enumerable:!0},nodes:{value:nodes||void 0},source:{value:_source||void 0},positions:{value:_positions||void 0},originalError:{value:originalError}}),originalError&&originalError.stack?Object.defineProperty(this,"stack",{value:originalError.stack,writable:!0,configurable:!0}):Error.captureStackTrace?Error.captureStackTrace(this,GraphQLError):Object.defineProperty(this,"stack",{value:Error().stack,writable:!0,configurable:!0})}Object.defineProperty(exports,"__esModule",{value:!0}),exports.GraphQLError=GraphQLError;var _location=require("../language/location");GraphQLError.prototype=Object.create(Error.prototype,{constructor:{value:GraphQLError},name:{value:"GraphQLError"}})},{"../language/location":107}],87:[function(require,module,exports){"use strict";Object.defineProperty(exports,"__esModule",{value:!0}),exports.formatError=function(error){return(0,_invariant2.default)(error,"Received null or undefined error."),{message:error.message,locations:error.locations,path:error.path}};var _invariant2=function(obj){return obj&&obj.__esModule?obj:{default:obj}}(require("../jsutils/invariant"))},{"../jsutils/invariant":97}],88:[function(require,module,exports){"use strict";Object.defineProperty(exports,"__esModule",{value:!0});var _GraphQLError=require("./GraphQLError");Object.defineProperty(exports,"GraphQLError",{enumerable:!0,get:function(){return _GraphQLError.GraphQLError}});var _syntaxError=require("./syntaxError");Object.defineProperty(exports,"syntaxError",{enumerable:!0,get:function(){return _syntaxError.syntaxError}});var _locatedError=require("./locatedError");Object.defineProperty(exports,"locatedError",{enumerable:!0,get:function(){return _locatedError.locatedError}});var _formatError=require("./formatError");Object.defineProperty(exports,"formatError",{enumerable:!0,get:function(){return _formatError.formatError}})},{"./GraphQLError":86,"./formatError":87,"./locatedError":89,"./syntaxError":90}],89:[function(require,module,exports){"use strict";Object.defineProperty(exports,"__esModule",{value:!0}),exports.locatedError=function(originalError,nodes,path){if(originalError&&originalError.path)return originalError;var message=originalError?originalError.message||String(originalError):"An unknown error occurred.";return new _GraphQLError.GraphQLError(message,originalError&&originalError.nodes||nodes,originalError&&originalError.source,originalError&&originalError.positions,path,originalError)};var _GraphQLError=require("./GraphQLError")},{"./GraphQLError":86}],90:[function(require,module,exports){"use strict";function highlightSourceAtLocation(source,location){var line=location.line,prevLineNum=(line-1).toString(),lineNum=line.toString(),nextLineNum=(line+1).toString(),padLen=nextLineNum.length,lines=source.body.split(/\r\n|[\n\r]/g);return(line>=2?lpad(padLen,prevLineNum)+": "+lines[line-2]+"\n":"")+lpad(padLen,lineNum)+": "+lines[line-1]+"\n"+Array(2+padLen+location.column).join(" ")+"^\n"+(line<lines.length?lpad(padLen,nextLineNum)+": "+lines[line]+"\n":"")}function lpad(len,str){return Array(len-str.length+1).join(" ")+str}Object.defineProperty(exports,"__esModule",{value:!0}),exports.syntaxError=function(source,position,description){var location=(0,_location.getLocation)(source,position);return new _GraphQLError.GraphQLError("Syntax Error "+source.name+" ("+location.line+":"+location.column+") "+description+"\n\n"+highlightSourceAtLocation(source,location),void 0,source,[position])};var _location=require("../language/location"),_GraphQLError=require("./GraphQLError")},{"../language/location":107,"./GraphQLError":86}],91:[function(require,module,exports){"use strict";function _interopRequireDefault(obj){return obj&&obj.__esModule?obj:{default:obj}}function executeImpl(schema,document,rootValue,contextValue,variableValues,operationName,fieldResolver){assertValidExecutionArguments(schema,document,variableValues);var context=void 0;try{context=buildExecutionContext(schema,document,rootValue,contextValue,variableValues,operationName,fieldResolver)}catch(error){return Promise.resolve({errors:[error]})}return Promise.resolve(executeOperation(context,context.operation,rootValue)).then(function(data){return 0===context.errors.length?{data:data}:{errors:context.errors,data:data}})}function responsePathAsArray(path){for(var flattened=[],curr=path;curr;)flattened.push(curr.key),curr=curr.prev;return flattened.reverse()}function addPath(prev,key){return{prev:prev,key:key}}function assertValidExecutionArguments(schema,document,rawVariableValues){(0,_invariant2.default)(schema,"Must provide schema"),(0,_invariant2.default)(document,"Must provide document"),(0,_invariant2.default)(schema instanceof _schema.GraphQLSchema,"Schema must be an instance of GraphQLSchema. Also ensure that there are not multiple versions of GraphQL installed in your node_modules directory."),(0,_invariant2.default)(!rawVariableValues||"object"==typeof rawVariableValues,"Variables must be provided as an Object where each property is a variable value. Perhaps look to see if an unparsed JSON string was provided.")}function buildExecutionContext(schema,document,rootValue,contextValue,rawVariableValues,operationName,fieldResolver){var errors=[],operation=void 0,fragments=Object.create(null);if(document.definitions.forEach(function(definition){switch(definition.kind){case Kind.OPERATION_DEFINITION:if(!operationName&&operation)throw new _error.GraphQLError("Must provide operation name if query contains multiple operations.");(!operationName||definition.name&&definition.name.value===operationName)&&(operation=definition);break;case Kind.FRAGMENT_DEFINITION:fragments[definition.name.value]=definition;break;default:throw new _error.GraphQLError("GraphQL cannot execute a request containing a "+definition.kind+".",[definition])}}),!operation)throw operationName?new _error.GraphQLError('Unknown operation named "'+operationName+'".'):new _error.GraphQLError("Must provide an operation.");var variableValues=(0,_values.getVariableValues)(schema,operation.variableDefinitions||[],rawVariableValues||{});return{schema:schema,fragments:fragments,rootValue:rootValue,contextValue:contextValue,operation:operation,variableValues:variableValues,fieldResolver:fieldResolver||defaultFieldResolver,errors:errors}}function executeOperation(exeContext,operation,rootValue){var type=getOperationRootType(exeContext.schema,operation),fields=collectFields(exeContext,type,operation.selectionSet,Object.create(null),Object.create(null));try{var result="mutation"===operation.operation?executeFieldsSerially(exeContext,type,rootValue,void 0,fields):executeFields(exeContext,type,rootValue,void 0,fields),promise=getPromise(result);return promise?promise.then(void 0,function(error){return exeContext.errors.push(error),Promise.resolve(null)}):result}catch(error){return exeContext.errors.push(error),null}}function getOperationRootType(schema,operation){switch(operation.operation){case"query":return schema.getQueryType();case"mutation":var mutationType=schema.getMutationType();if(!mutationType)throw new _error.GraphQLError("Schema is not configured for mutations",[operation]);return mutationType;case"subscription":var subscriptionType=schema.getSubscriptionType();if(!subscriptionType)throw new _error.GraphQLError("Schema is not configured for subscriptions",[operation]);return subscriptionType;default:throw new _error.GraphQLError("Can only execute queries, mutations and subscriptions",[operation])}}function executeFieldsSerially(exeContext,parentType,sourceValue,path,fields){return Object.keys(fields).reduce(function(prevPromise,responseName){return prevPromise.then(function(results){var fieldNodes=fields[responseName],fieldPath=addPath(path,responseName),result=resolveField(exeContext,parentType,sourceValue,fieldNodes,fieldPath);if(void 0===result)return results;var promise=getPromise(result);return promise?promise.then(function(resolvedResult){return results[responseName]=resolvedResult,results}):(results[responseName]=result,results)})},Promise.resolve({}))}function executeFields(exeContext,parentType,sourceValue,path,fields){var containsPromise=!1,finalResults=Object.keys(fields).reduce(function(results,responseName){var fieldNodes=fields[responseName],fieldPath=addPath(path,responseName),result=resolveField(exeContext,parentType,sourceValue,fieldNodes,fieldPath);return void 0===result?results:(results[responseName]=result,getPromise(result)&&(containsPromise=!0),results)},Object.create(null));return containsPromise?promiseForObject(finalResults):finalResults}function collectFields(exeContext,runtimeType,selectionSet,fields,visitedFragmentNames){for(var i=0;i<selectionSet.selections.length;i++){var selection=selectionSet.selections[i];switch(selection.kind){case Kind.FIELD:if(!shouldIncludeNode(exeContext,selection))continue;var _name=getFieldEntryKey(selection);fields[_name]||(fields[_name]=[]),fields[_name].push(selection);break;case Kind.INLINE_FRAGMENT:if(!shouldIncludeNode(exeContext,selection)||!doesFragmentConditionMatch(exeContext,selection,runtimeType))continue;collectFields(exeContext,runtimeType,selection.selectionSet,fields,visitedFragmentNames);break;case Kind.FRAGMENT_SPREAD:var fragName=selection.name.value;if(visitedFragmentNames[fragName]||!shouldIncludeNode(exeContext,selection))continue;visitedFragmentNames[fragName]=!0;var fragment=exeContext.fragments[fragName];if(!fragment||!doesFragmentConditionMatch(exeContext,fragment,runtimeType))continue;collectFields(exeContext,runtimeType,fragment.selectionSet,fields,visitedFragmentNames)}}return fields}function shouldIncludeNode(exeContext,node){var skip=(0,_values.getDirectiveValues)(_directives.GraphQLSkipDirective,node,exeContext.variableValues);if(skip&&!0===skip.if)return!1;var include=(0,_values.getDirectiveValues)(_directives.GraphQLIncludeDirective,node,exeContext.variableValues);return!include||!1!==include.if}function doesFragmentConditionMatch(exeContext,fragment,type){var typeConditionNode=fragment.typeCondition;if(!typeConditionNode)return!0;var conditionalType=(0,_typeFromAST.typeFromAST)(exeContext.schema,typeConditionNode);return conditionalType===type||!!(0,_definition.isAbstractType)(conditionalType)&&exeContext.schema.isPossibleType(conditionalType,type)}function promiseForObject(object){var keys=Object.keys(object),valuesAndPromises=keys.map(function(name){return object[name]});return Promise.all(valuesAndPromises).then(function(values){return values.reduce(function(resolvedObject,value,i){return resolvedObject[keys[i]]=value,resolvedObject},Object.create(null))})}function getFieldEntryKey(node){return node.alias?node.alias.value:node.name.value}function resolveField(exeContext,parentType,source,fieldNodes,path){var fieldName=fieldNodes[0].name.value,fieldDef=getFieldDef(exeContext.schema,parentType,fieldName);if(fieldDef){var resolveFn=fieldDef.resolve||exeContext.fieldResolver,info=buildResolveInfo(exeContext,fieldDef,fieldNodes,parentType,path),result=resolveFieldValueOrError(exeContext,fieldDef,fieldNodes,resolveFn,source,info);return completeValueCatchingError(exeContext,fieldDef.type,fieldNodes,info,path,result)}}function buildResolveInfo(exeContext,fieldDef,fieldNodes,parentType,path){return{fieldName:fieldNodes[0].name.value,fieldNodes:fieldNodes,returnType:fieldDef.type,parentType:parentType,path:path,schema:exeContext.schema,fragments:exeContext.fragments,rootValue:exeContext.rootValue,operation:exeContext.operation,variableValues:exeContext.variableValues}}function resolveFieldValueOrError(exeContext,fieldDef,fieldNodes,resolveFn,source,info){try{return resolveFn(source,(0,_values.getArgumentValues)(fieldDef,fieldNodes[0],exeContext.variableValues),exeContext.contextValue,info)}catch(error){return error instanceof Error?error:new Error(error)}}function completeValueCatchingError(exeContext,returnType,fieldNodes,info,path,result){if(returnType instanceof _definition.GraphQLNonNull)return completeValueWithLocatedError(exeContext,returnType,fieldNodes,info,path,result);try{var completed=completeValueWithLocatedError(exeContext,returnType,fieldNodes,info,path,result),promise=getPromise(completed);return promise?promise.then(void 0,function(error){return exeContext.errors.push(error),Promise.resolve(null)}):completed}catch(error){return exeContext.errors.push(error),null}}function completeValueWithLocatedError(exeContext,returnType,fieldNodes,info,path,result){try{var completed=completeValue(exeContext,returnType,fieldNodes,info,path,result),promise=getPromise(completed);return promise?promise.then(void 0,function(error){return Promise.reject((0,_error.locatedError)(error,fieldNodes,responsePathAsArray(path)))}):completed}catch(error){throw(0,_error.locatedError)(error,fieldNodes,responsePathAsArray(path))}}function completeValue(exeContext,returnType,fieldNodes,info,path,result){var promise=getPromise(result);if(promise)return promise.then(function(resolved){return completeValue(exeContext,returnType,fieldNodes,info,path,resolved)});if(result instanceof Error)throw result;if(returnType instanceof _definition.GraphQLNonNull){var completed=completeValue(exeContext,returnType.ofType,fieldNodes,info,path,result);if(null===completed)throw new Error("Cannot return null for non-nullable field "+info.parentType.name+"."+info.fieldName+".");return completed}if((0,_isNullish2.default)(result))return null;if(returnType instanceof _definition.GraphQLList)return completeListValue(exeContext,returnType,fieldNodes,info,path,result);if((0,_definition.isLeafType)(returnType))return completeLeafValue(returnType,result);if((0,_definition.isAbstractType)(returnType))return completeAbstractValue(exeContext,returnType,fieldNodes,info,path,result);if(returnType instanceof _definition.GraphQLObjectType)return completeObjectValue(exeContext,returnType,fieldNodes,info,path,result);throw new Error('Cannot complete value of unexpected type "'+String(returnType)+'".')}function completeListValue(exeContext,returnType,fieldNodes,info,path,result){(0,_invariant2.default)((0,_iterall.isCollection)(result),"Expected Iterable, but did not find one for field "+info.parentType.name+"."+info.fieldName+".");var itemType=returnType.ofType,containsPromise=!1,completedResults=[];return(0,_iterall.forEach)(result,function(item,index){var fieldPath=addPath(path,index),completedItem=completeValueCatchingError(exeContext,itemType,fieldNodes,info,fieldPath,item);!containsPromise&&getPromise(completedItem)&&(containsPromise=!0),completedResults.push(completedItem)}),containsPromise?Promise.all(completedResults):completedResults}function completeLeafValue(returnType,result){(0,_invariant2.default)(returnType.serialize,"Missing serialize method on type");var serializedResult=returnType.serialize(result);if((0,_isNullish2.default)(serializedResult))throw new Error('Expected a value of type "'+String(returnType)+'" but received: '+String(result));return serializedResult}function completeAbstractValue(exeContext,returnType,fieldNodes,info,path,result){var runtimeType=returnType.resolveType?returnType.resolveType(result,exeContext.contextValue,info):defaultResolveTypeFn(result,exeContext.contextValue,info,returnType),promise=getPromise(runtimeType);return promise?promise.then(function(resolvedRuntimeType){return completeObjectValue(exeContext,ensureValidRuntimeType(resolvedRuntimeType,exeContext,returnType,fieldNodes,info,result),fieldNodes,info,path,result)}):completeObjectValue(exeContext,ensureValidRuntimeType(runtimeType,exeContext,returnType,fieldNodes,info,result),fieldNodes,info,path,result)}function ensureValidRuntimeType(runtimeTypeOrName,exeContext,returnType,fieldNodes,info,result){var runtimeType="string"==typeof runtimeTypeOrName?exeContext.schema.getType(runtimeTypeOrName):runtimeTypeOrName;if(!(runtimeType instanceof _definition.GraphQLObjectType))throw new _error.GraphQLError("Abstract type "+returnType.name+" must resolve to an Object type at runtime for field "+info.parentType.name+"."+info.fieldName+' with value "'+String(result)+'", received "'+String(runtimeType)+'".',fieldNodes);if(!exeContext.schema.isPossibleType(returnType,runtimeType))throw new _error.GraphQLError('Runtime Object type "'+runtimeType.name+'" is not a possible type for "'+returnType.name+'".',fieldNodes);return runtimeType}function completeObjectValue(exeContext,returnType,fieldNodes,info,path,result){if(returnType.isTypeOf){var isTypeOf=returnType.isTypeOf(result,exeContext.contextValue,info),promise=getPromise(isTypeOf);if(promise)return promise.then(function(isTypeOfResult){if(!isTypeOfResult)throw invalidReturnTypeError(returnType,result,fieldNodes);return collectAndExecuteSubfields(exeContext,returnType,fieldNodes,info,path,result)});if(!isTypeOf)throw invalidReturnTypeError(returnType,result,fieldNodes)}return collectAndExecuteSubfields(exeContext,returnType,fieldNodes,info,path,result)}function invalidReturnTypeError(returnType,result,fieldNodes){return new _error.GraphQLError('Expected value of type "'+returnType.name+'" but got: '+String(result)+".",fieldNodes)}function collectAndExecuteSubfields(exeContext,returnType,fieldNodes,info,path,result){for(var subFieldNodes=Object.create(null),visitedFragmentNames=Object.create(null),i=0;i<fieldNodes.length;i++){var selectionSet=fieldNodes[i].selectionSet;selectionSet&&(subFieldNodes=collectFields(exeContext,returnType,selectionSet,subFieldNodes,visitedFragmentNames))}return executeFields(exeContext,returnType,result,path,subFieldNodes)}function defaultResolveTypeFn(value,context,info,abstractType){for(var possibleTypes=info.schema.getPossibleTypes(abstractType),promisedIsTypeOfResults=[],i=0;i<possibleTypes.length;i++){var type=possibleTypes[i];if(type.isTypeOf){var isTypeOfResult=type.isTypeOf(value,context,info),promise=getPromise(isTypeOfResult);if(promise)promisedIsTypeOfResults[i]=promise;else if(isTypeOfResult)return type}}if(promisedIsTypeOfResults.length)return Promise.all(promisedIsTypeOfResults).then(function(isTypeOfResults){for(var _i=0;_i<isTypeOfResults.length;_i++)if(isTypeOfResults[_i])return possibleTypes[_i]})}function getPromise(value){if("object"==typeof value&&null!==value&&"function"==typeof value.then)return value}function getFieldDef(schema,parentType,fieldName){return fieldName===_introspection.SchemaMetaFieldDef.name&&schema.getQueryType()===parentType?_introspection.SchemaMetaFieldDef:fieldName===_introspection.TypeMetaFieldDef.name&&schema.getQueryType()===parentType?_introspection.TypeMetaFieldDef:fieldName===_introspection.TypeNameMetaFieldDef.name?_introspection.TypeNameMetaFieldDef:parentType.getFields()[fieldName]}Object.defineProperty(exports,"__esModule",{value:!0}),exports.defaultFieldResolver=void 0,exports.execute=function(argsOrSchema,document,rootValue,contextValue,variableValues,operationName,fieldResolver){var args=1===arguments.length?argsOrSchema:void 0,schema=args?args.schema:argsOrSchema;return args?executeImpl(schema,args.document,args.rootValue,args.contextValue,args.variableValues,args.operationName,args.fieldResolver):executeImpl(schema,document,rootValue,contextValue,variableValues,operationName,fieldResolver)},exports.responsePathAsArray=responsePathAsArray,exports.addPath=addPath,exports.assertValidExecutionArguments=assertValidExecutionArguments,exports.buildExecutionContext=buildExecutionContext,exports.getOperationRootType=getOperationRootType,exports.collectFields=collectFields,exports.buildResolveInfo=buildResolveInfo,exports.resolveFieldValueOrError=resolveFieldValueOrError,exports.getFieldDef=getFieldDef;var _iterall=require("iterall"),_error=require("../error"),_invariant2=_interopRequireDefault(require("../jsutils/invariant")),_isNullish2=_interopRequireDefault(require("../jsutils/isNullish")),_typeFromAST=require("../utilities/typeFromAST"),Kind=function(obj){if(obj&&obj.__esModule)return obj;var newObj={};if(null!=obj)for(var key in obj)Object.prototype.hasOwnProperty.call(obj,key)&&(newObj[key]=obj[key]);return newObj.default=obj,newObj}(require("../language/kinds")),_values=require("./values"),_definition=require("../type/definition"),_schema=require("../type/schema"),_introspection=require("../type/introspection"),_directives=require("../type/directives"),defaultFieldResolver=exports.defaultFieldResolver=function(source,args,context,info){if("object"==typeof source||"function"==typeof source){var property=source[info.fieldName];return"function"==typeof property?source[info.fieldName](args,context,info):property}}},{"../error":88,"../jsutils/invariant":97,"../jsutils/isNullish":99,"../language/kinds":105,"../type/definition":115,"../type/directives":116,"../type/introspection":118,"../type/schema":120,"../utilities/typeFromAST":138,"./values":93,iterall:169}],92:[function(require,module,exports){"use strict";Object.defineProperty(exports,"__esModule",{value:!0});var _execute=require("./execute");Object.defineProperty(exports,"execute",{enumerable:!0,get:function(){return _execute.execute}}),Object.defineProperty(exports,"defaultFieldResolver",{enumerable:!0,get:function(){return _execute.defaultFieldResolver}}),Object.defineProperty(exports,"responsePathAsArray",{enumerable:!0,get:function(){return _execute.responsePathAsArray}});var _values=require("./values");Object.defineProperty(exports,"getDirectiveValues",{enumerable:!0,get:function(){return _values.getDirectiveValues}})},{"./execute":91,"./values":93}],93:[function(require,module,exports){"use strict";function _interopRequireDefault(obj){return obj&&obj.__esModule?obj:{default:obj}}function getArgumentValues(def,node,variableValues){var argDefs=def.args,argNodes=node.arguments;if(!argDefs||!argNodes)return{};for(var coercedValues=Object.create(null),argNodeMap=(0,_keyMap2.default)(argNodes,function(arg){return arg.name.value}),i=0;i<argDefs.length;i++){var argDef=argDefs[i],name=argDef.name,argType=argDef.type,argumentNode=argNodeMap[name],defaultValue=argDef.defaultValue;if(argumentNode)if(argumentNode.value.kind===Kind.VARIABLE){var variableName=argumentNode.value.name.value;if(variableValues&&!(0,_isInvalid2.default)(variableValues[variableName]))coercedValues[name]=variableValues[variableName];else if((0,_isInvalid2.default)(defaultValue)){if(argType instanceof _definition.GraphQLNonNull)throw new _error.GraphQLError('Argument "'+name+'" of required type "'+String(argType)+'" was provided the variable "$'+variableName+'" which was not provided a runtime value.',[argumentNode.value])}else coercedValues[name]=defaultValue}else{var valueNode=argumentNode.value,coercedValue=(0,_valueFromAST.valueFromAST)(valueNode,argType,variableValues);if((0,_isInvalid2.default)(coercedValue)){var errors=(0,_isValidLiteralValue.isValidLiteralValue)(argType,valueNode),message=errors?"\n"+errors.join("\n"):"";throw new _error.GraphQLError('Argument "'+name+'" got invalid value '+(0,_printer.print)(valueNode)+"."+message,[argumentNode.value])}coercedValues[name]=coercedValue}else if((0,_isInvalid2.default)(defaultValue)){if(argType instanceof _definition.GraphQLNonNull)throw new _error.GraphQLError('Argument "'+name+'" of required type "'+String(argType)+'" was not provided.',[node])}else coercedValues[name]=defaultValue}return coercedValues}function coerceValue(type,value){var _value=value;if(!(0,_isInvalid2.default)(_value)){if(type instanceof _definition.GraphQLNonNull){if(null===_value)return;return coerceValue(type.ofType,_value)}if(null===_value)return null;if(type instanceof _definition.GraphQLList){var itemType=type.ofType;if((0,_iterall.isCollection)(_value)){var coercedValues=[],valueIter=(0,_iterall.createIterator)(_value);if(!valueIter)return;for(var step=void 0;!(step=valueIter.next()).done;){var itemValue=coerceValue(itemType,step.value);if((0,_isInvalid2.default)(itemValue))return;coercedValues.push(itemValue)}return coercedValues}var coercedValue=coerceValue(itemType,_value);if((0,_isInvalid2.default)(coercedValue))return;return[coerceValue(itemType,_value)]}if(type instanceof _definition.GraphQLInputObjectType){if("object"!=typeof _value)return;for(var coercedObj=Object.create(null),fields=type.getFields(),fieldNames=Object.keys(fields),i=0;i<fieldNames.length;i++){var fieldName=fieldNames[i],field=fields[fieldName];if((0,_isInvalid2.default)(_value[fieldName]))if((0,_isInvalid2.default)(field.defaultValue)){if(field.type instanceof _definition.GraphQLNonNull)return}else coercedObj[fieldName]=field.defaultValue;else{var fieldValue=coerceValue(field.type,_value[fieldName]);if((0,_isInvalid2.default)(fieldValue))return;coercedObj[fieldName]=fieldValue}}return coercedObj}(0,_invariant2.default)(type instanceof _definition.GraphQLScalarType||type instanceof _definition.GraphQLEnumType,"Must be input type");var parsed=type.parseValue(_value);if(!(0,_isNullish2.default)(parsed))return parsed}}Object.defineProperty(exports,"__esModule",{value:!0}),exports.getVariableValues=function(schema,varDefNodes,inputs){for(var coercedValues=Object.create(null),i=0;i<varDefNodes.length;i++){var varDefNode=varDefNodes[i],varName=varDefNode.variable.name.value,varType=(0,_typeFromAST.typeFromAST)(schema,varDefNode.type);if(!(0,_definition.isInputType)(varType))throw new _error.GraphQLError('Variable "$'+varName+'" expected value of type "'+(0,_printer.print)(varDefNode.type)+'" which cannot be used as an input type.',[varDefNode.type]);var value=inputs[varName];if((0,_isInvalid2.default)(value)){var defaultValue=varDefNode.defaultValue;if(defaultValue&&(coercedValues[varName]=(0,_valueFromAST.valueFromAST)(defaultValue,varType)),varType instanceof _definition.GraphQLNonNull)throw new _error.GraphQLError('Variable "$'+varName+'" of required type "'+String(varType)+'" was not provided.',[varDefNode])}else{var errors=(0,_isValidJSValue.isValidJSValue)(value,varType);if(errors.length){var message=errors?"\n"+errors.join("\n"):"";throw new _error.GraphQLError('Variable "$'+varName+'" got invalid value '+JSON.stringify(value)+"."+message,[varDefNode])}var coercedValue=coerceValue(varType,value);(0,_invariant2.default)(!(0,_isInvalid2.default)(coercedValue),"Should have reported error."),coercedValues[varName]=coercedValue}}return coercedValues},exports.getArgumentValues=getArgumentValues,exports.getDirectiveValues=function(directiveDef,node,variableValues){var directiveNode=node.directives&&(0,_find2.default)(node.directives,function(directive){return directive.name.value===directiveDef.name});if(directiveNode)return getArgumentValues(directiveDef,directiveNode,variableValues)};var _iterall=require("iterall"),_error=require("../error"),_find2=_interopRequireDefault(require("../jsutils/find")),_invariant2=_interopRequireDefault(require("../jsutils/invariant")),_isNullish2=_interopRequireDefault(require("../jsutils/isNullish")),_isInvalid2=_interopRequireDefault(require("../jsutils/isInvalid")),_keyMap2=_interopRequireDefault(require("../jsutils/keyMap")),_typeFromAST=require("../utilities/typeFromAST"),_valueFromAST=require("../utilities/valueFromAST"),_isValidJSValue=require("../utilities/isValidJSValue"),_isValidLiteralValue=require("../utilities/isValidLiteralValue"),Kind=function(obj){if(obj&&obj.__esModule)return obj;var newObj={};if(null!=obj)for(var key in obj)Object.prototype.hasOwnProperty.call(obj,key)&&(newObj[key]=obj[key]);return newObj.default=obj,newObj}(require("../language/kinds")),_printer=require("../language/printer"),_definition=require("../type/definition")},{"../error":88,"../jsutils/find":96,"../jsutils/invariant":97,"../jsutils/isInvalid":98,"../jsutils/isNullish":99,"../jsutils/keyMap":100,"../language/kinds":105,"../language/printer":109,"../type/definition":115,"../utilities/isValidJSValue":133,"../utilities/isValidLiteralValue":134,"../utilities/typeFromAST":138,"../utilities/valueFromAST":139,iterall:169}],94:[function(require,module,exports){"use strict";function graphqlImpl(schema,source,rootValue,contextValue,variableValues,operationName,fieldResolver){return new Promise(function(resolve){var document=void 0;try{document=(0,_parser.parse)(source)}catch(syntaxError){return resolve({errors:[syntaxError]})}var validationErrors=(0,_validate.validate)(schema,document);if(validationErrors.length>0)return resolve({errors:validationErrors});resolve((0,_execute.execute)(schema,document,rootValue,contextValue,variableValues,operationName,fieldResolver))})}Object.defineProperty(exports,"__esModule",{value:!0}),exports.graphql=function(argsOrSchema,source,rootValue,contextValue,variableValues,operationName,fieldResolver){var args=1===arguments.length?argsOrSchema:void 0,schema=args?args.schema:argsOrSchema;return args?graphqlImpl(schema,args.source,args.rootValue,args.contextValue,args.variableValues,args.operationName,args.fieldResolver):graphqlImpl(schema,source,rootValue,contextValue,variableValues,operationName,fieldResolver)};var _parser=require("./language/parser"),_validate=require("./validation/validate"),_execute=require("./execution/execute")},{"./execution/execute":91,"./language/parser":108,"./validation/validate":168}],95:[function(require,module,exports){"use strict";Object.defineProperty(exports,"__esModule",{value:!0});var _graphql=require("./graphql");Object.defineProperty(exports,"graphql",{enumerable:!0,get:function(){return _graphql.graphql}});var _type=require("./type");Object.defineProperty(exports,"GraphQLSchema",{enumerable:!0,get:function(){return _type.GraphQLSchema}}),Object.defineProperty(exports,"GraphQLScalarType",{enumerable:!0,get:function(){return _type.GraphQLScalarType}}),Object.defineProperty(exports,"GraphQLObjectType",{enumerable:!0,get:function(){return _type.GraphQLObjectType}}),Object.defineProperty(exports,"GraphQLInterfaceType",{enumerable:!0,get:function(){return _type.GraphQLInterfaceType}}),Object.defineProperty(exports,"GraphQLUnionType",{enumerable:!0,get:function(){return _type.GraphQLUnionType}}),Object.defineProperty(exports,"GraphQLEnumType",{enumerable:!0,get:function(){return _type.GraphQLEnumType}}),Object.defineProperty(exports,"GraphQLInputObjectType",{enumerable:!0,get:function(){return _type.GraphQLInputObjectType}}),Object.defineProperty(exports,"GraphQLList",{enumerable:!0,get:function(){return _type.GraphQLList}}),Object.defineProperty(exports,"GraphQLNonNull",{enumerable:!0,get:function(){return _type.GraphQLNonNull}}),Object.defineProperty(exports,"GraphQLDirective",{enumerable:!0,get:function(){return _type.GraphQLDirective}}),Object.defineProperty(exports,"TypeKind",{enumerable:!0,get:function(){return _type.TypeKind}}),Object.defineProperty(exports,"DirectiveLocation",{enumerable:!0,get:function(){return _type.DirectiveLocation}}),Object.defineProperty(exports,"GraphQLInt",{enumerable:!0,get:function(){return _type.GraphQLInt}}),Object.defineProperty(exports,"GraphQLFloat",{enumerable:!0,get:function(){return _type.GraphQLFloat}}),Object.defineProperty(exports,"GraphQLString",{enumerable:!0,get:function(){return _type.GraphQLString}}),Object.defineProperty(exports,"GraphQLBoolean",{enumerable:!0,get:function(){return _type.GraphQLBoolean}}),Object.defineProperty(exports,"GraphQLID",{enumerable:!0,get:function(){return _type.GraphQLID}}),Object.defineProperty(exports,"specifiedDirectives",{enumerable:!0,get:function(){return _type.specifiedDirectives}}),Object.defineProperty(exports,"GraphQLIncludeDirective",{enumerable:!0,get:function(){return _type.GraphQLIncludeDirective}}),Object.defineProperty(exports,"GraphQLSkipDirective",{enumerable:!0,get:function(){return _type.GraphQLSkipDirective}}),Object.defineProperty(exports,"GraphQLDeprecatedDirective",{enumerable:!0,get:function(){return _type.GraphQLDeprecatedDirective}}),Object.defineProperty(exports,"DEFAULT_DEPRECATION_REASON",{enumerable:!0,get:function(){return _type.DEFAULT_DEPRECATION_REASON}}),Object.defineProperty(exports,"SchemaMetaFieldDef",{enumerable:!0,get:function(){return _type.SchemaMetaFieldDef}}),Object.defineProperty(exports,"TypeMetaFieldDef",{enumerable:!0,get:function(){return _type.TypeMetaFieldDef}}),Object.defineProperty(exports,"TypeNameMetaFieldDef",{enumerable:!0,get:function(){return _type.TypeNameMetaFieldDef}}),Object.defineProperty(exports,"__Schema",{enumerable:!0,get:function(){return _type.__Schema}}),Object.defineProperty(exports,"__Directive",{enumerable:!0,get:function(){return _type.__Directive}}),Object.defineProperty(exports,"__DirectiveLocation",{enumerable:!0,get:function(){return _type.__DirectiveLocation}}),Object.defineProperty(exports,"__Type",{enumerable:!0,get:function(){return _type.__Type}}),Object.defineProperty(exports,"__Field",{enumerable:!0,get:function(){return _type.__Field}}),Object.defineProperty(exports,"__InputValue",{enumerable:!0,get:function(){return _type.__InputValue}}),Object.defineProperty(exports,"__EnumValue",{enumerable:!0,get:function(){return _type.__EnumValue}}),Object.defineProperty(exports,"__TypeKind",{enumerable:!0,get:function(){return _type.__TypeKind}}),Object.defineProperty(exports,"isType",{enumerable:!0,get:function(){return _type.isType}}),Object.defineProperty(exports,"isInputType",{enumerable:!0,get:function(){return _type.isInputType}}),Object.defineProperty(exports,"isOutputType",{enumerable:!0,get:function(){return _type.isOutputType}}),Object.defineProperty(exports,"isLeafType",{enumerable:!0,get:function(){return _type.isLeafType}}),Object.defineProperty(exports,"isCompositeType",{enumerable:!0,get:function(){return _type.isCompositeType}}),Object.defineProperty(exports,"isAbstractType",{enumerable:!0,get:function(){return _type.isAbstractType}}),Object.defineProperty(exports,"isNamedType",{enumerable:!0,get:function(){return _type.isNamedType}}),Object.defineProperty(exports,"assertType",{enumerable:!0,get:function(){return _type.assertType}}),Object.defineProperty(exports,"assertInputType",{enumerable:!0,get:function(){return _type.assertInputType}}),Object.defineProperty(exports,"assertOutputType",{enumerable:!0,get:function(){return _type.assertOutputType}}),Object.defineProperty(exports,"assertLeafType",{enumerable:!0,get:function(){return _type.assertLeafType}}),Object.defineProperty(exports,"assertCompositeType",{enumerable:!0,get:function(){return _type.assertCompositeType}}),Object.defineProperty(exports,"assertAbstractType",{enumerable:!0,get:function(){return _type.assertAbstractType}}),Object.defineProperty(exports,"assertNamedType",{enumerable:!0,get:function(){return _type.assertNamedType}}),Object.defineProperty(exports,"getNullableType",{enumerable:!0,get:function(){return _type.getNullableType}}),Object.defineProperty(exports,"getNamedType",{enumerable:!0,get:function(){return _type.getNamedType}});var _language=require("./language");Object.defineProperty(exports,"Source",{enumerable:!0,get:function(){return _language.Source}}),Object.defineProperty(exports,"getLocation",{enumerable:!0,get:function(){return _language.getLocation}}),Object.defineProperty(exports,"parse",{enumerable:!0,get:function(){return _language.parse}}),Object.defineProperty(exports,"parseValue",{enumerable:!0,get:function(){return _language.parseValue}}),Object.defineProperty(exports,"parseType",{enumerable:!0,get:function(){return _language.parseType}}),Object.defineProperty(exports,"print",{enumerable:!0,get:function(){return _language.print}}),Object.defineProperty(exports,"visit",{enumerable:!0,get:function(){return _language.visit}}),Object.defineProperty(exports,"visitInParallel",{enumerable:!0,get:function(){return _language.visitInParallel}}),Object.defineProperty(exports,"visitWithTypeInfo",{enumerable:!0,get:function(){return _language.visitWithTypeInfo}}),Object.defineProperty(exports,"getVisitFn",{enumerable:!0,get:function(){return _language.getVisitFn}}),Object.defineProperty(exports,"Kind",{enumerable:!0,get:function(){return _language.Kind}}),Object.defineProperty(exports,"TokenKind",{enumerable:!0,get:function(){return _language.TokenKind}}),Object.defineProperty(exports,"BREAK",{enumerable:!0,get:function(){return _language.BREAK}});var _execution=require("./execution");Object.defineProperty(exports,"execute",{enumerable:!0,get:function(){return _execution.execute}}),Object.defineProperty(exports,"defaultFieldResolver",{enumerable:!0,get:function(){return _execution.defaultFieldResolver}}),Object.defineProperty(exports,"responsePathAsArray",{enumerable:!0,get:function(){return _execution.responsePathAsArray}}),Object.defineProperty(exports,"getDirectiveValues",{enumerable:!0,get:function(){return _execution.getDirectiveValues}});var _subscription=require("./subscription");Object.defineProperty(exports,"subscribe",{enumerable:!0,get:function(){return _subscription.subscribe}}),Object.defineProperty(exports,"createSourceEventStream",{enumerable:!0,get:function(){return _subscription.createSourceEventStream}});var _validation=require("./validation");Object.defineProperty(exports,"validate",{enumerable:!0,get:function(){return _validation.validate}}),Object.defineProperty(exports,"ValidationContext",{enumerable:!0,get:function(){return _validation.ValidationContext}}),Object.defineProperty(exports,"specifiedRules",{enumerable:!0,get:function(){return _validation.specifiedRules}}),Object.defineProperty(exports,"ArgumentsOfCorrectTypeRule",{enumerable:!0,get:function(){return _validation.ArgumentsOfCorrectTypeRule}}),Object.defineProperty(exports,"DefaultValuesOfCorrectTypeRule",{enumerable:!0,get:function(){return _validation.DefaultValuesOfCorrectTypeRule}}),Object.defineProperty(exports,"FieldsOnCorrectTypeRule",{enumerable:!0,get:function(){return _validation.FieldsOnCorrectTypeRule}}),Object.defineProperty(exports,"FragmentsOnCompositeTypesRule",{enumerable:!0,get:function(){return _validation.FragmentsOnCompositeTypesRule}}),Object.defineProperty(exports,"KnownArgumentNamesRule",{enumerable:!0,get:function(){return _validation.KnownArgumentNamesRule}}),Object.defineProperty(exports,"KnownDirectivesRule",{enumerable:!0,get:function(){return _validation.KnownDirectivesRule}}),Object.defineProperty(exports,"KnownFragmentNamesRule",{enumerable:!0,get:function(){return _validation.KnownFragmentNamesRule}}),Object.defineProperty(exports,"KnownTypeNamesRule",{enumerable:!0,get:function(){return _validation.KnownTypeNamesRule}}),Object.defineProperty(exports,"LoneAnonymousOperationRule",{enumerable:!0,get:function(){return _validation.LoneAnonymousOperationRule}}),Object.defineProperty(exports,"NoFragmentCyclesRule",{enumerable:!0,get:function(){return _validation.NoFragmentCyclesRule}}),Object.defineProperty(exports,"NoUndefinedVariablesRule",{enumerable:!0,get:function(){return _validation.NoUndefinedVariablesRule}}),Object.defineProperty(exports,"NoUnusedFragmentsRule",{enumerable:!0,get:function(){return _validation.NoUnusedFragmentsRule}}),Object.defineProperty(exports,"NoUnusedVariablesRule",{enumerable:!0,get:function(){return _validation.NoUnusedVariablesRule}}),Object.defineProperty(exports,"OverlappingFieldsCanBeMergedRule",{enumerable:!0,get:function(){return _validation.OverlappingFieldsCanBeMergedRule}}),Object.defineProperty(exports,"PossibleFragmentSpreadsRule",{enumerable:!0,get:function(){return _validation.PossibleFragmentSpreadsRule}}),Object.defineProperty(exports,"ProvidedNonNullArgumentsRule",{enumerable:!0,get:function(){return _validation.ProvidedNonNullArgumentsRule}}),Object.defineProperty(exports,"ScalarLeafsRule",{enumerable:!0,get:function(){return _validation.ScalarLeafsRule}}),Object.defineProperty(exports,"SingleFieldSubscriptionsRule",{enumerable:!0,get:function(){return _validation.SingleFieldSubscriptionsRule}}),Object.defineProperty(exports,"UniqueArgumentNamesRule",{enumerable:!0,get:function(){return _validation.UniqueArgumentNamesRule}}),Object.defineProperty(exports,"UniqueDirectivesPerLocationRule",{enumerable:!0,get:function(){return _validation.UniqueDirectivesPerLocationRule}}),Object.defineProperty(exports,"UniqueFragmentNamesRule",{enumerable:!0,get:function(){return _validation.UniqueFragmentNamesRule}}),Object.defineProperty(exports,"UniqueInputFieldNamesRule",{enumerable:!0,get:function(){return _validation.UniqueInputFieldNamesRule}}),Object.defineProperty(exports,"UniqueOperationNamesRule",{enumerable:!0,get:function(){return _validation.UniqueOperationNamesRule}}),Object.defineProperty(exports,"UniqueVariableNamesRule",{enumerable:!0,get:function(){return _validation.UniqueVariableNamesRule}}),Object.defineProperty(exports,"VariablesAreInputTypesRule",{enumerable:!0,get:function(){return _validation.VariablesAreInputTypesRule}}),Object.defineProperty(exports,"VariablesInAllowedPositionRule",{enumerable:!0,get:function(){return _validation.VariablesInAllowedPositionRule}});var _error=require("./error");Object.defineProperty(exports,"GraphQLError",{enumerable:!0,get:function(){return _error.GraphQLError}}),Object.defineProperty(exports,"formatError",{enumerable:!0,get:function(){return _error.formatError}});var _utilities=require("./utilities");Object.defineProperty(exports,"introspectionQuery",{enumerable:!0,get:function(){return _utilities.introspectionQuery}}),Object.defineProperty(exports,"getOperationAST",{enumerable:!0,get:function(){return _utilities.getOperationAST}}),Object.defineProperty(exports,"buildClientSchema",{enumerable:!0,get:function(){return _utilities.buildClientSchema}}),Object.defineProperty(exports,"buildASTSchema",{enumerable:!0,get:function(){return _utilities.buildASTSchema}}),Object.defineProperty(exports,"buildSchema",{enumerable:!0,get:function(){return _utilities.buildSchema}}),Object.defineProperty(exports,"extendSchema",{enumerable:!0,get:function(){return _utilities.extendSchema}}),Object.defineProperty(exports,"printSchema",{enumerable:!0,get:function(){return _utilities.printSchema}}),Object.defineProperty(exports,"printIntrospectionSchema",{enumerable:!0,get:function(){return _utilities.printIntrospectionSchema}}),Object.defineProperty(exports,"printType",{enumerable:!0,get:function(){return _utilities.printType}}),Object.defineProperty(exports,"typeFromAST",{enumerable:!0,get:function(){return _utilities.typeFromAST}}),Object.defineProperty(exports,"valueFromAST",{enumerable:!0,get:function(){return _utilities.valueFromAST}}),Object.defineProperty(exports,"astFromValue",{enumerable:!0,get:function(){return _utilities.astFromValue}}),Object.defineProperty(exports,"TypeInfo",{enumerable:!0,get:function(){return _utilities.TypeInfo}}),Object.defineProperty(exports,"isValidJSValue",{enumerable:!0,get:function(){return _utilities.isValidJSValue}}),Object.defineProperty(exports,"isValidLiteralValue",{enumerable:!0,get:function(){return _utilities.isValidLiteralValue}}),Object.defineProperty(exports,"concatAST",{enumerable:!0,get:function(){return _utilities.concatAST}}),Object.defineProperty(exports,"separateOperations",{enumerable:!0,get:function(){return _utilities.separateOperations}}),Object.defineProperty(exports,"isEqualType",{enumerable:!0,get:function(){return _utilities.isEqualType}}),Object.defineProperty(exports,"isTypeSubTypeOf",{enumerable:!0,get:function(){return _utilities.isTypeSubTypeOf}}),Object.defineProperty(exports,"doTypesOverlap",{enumerable:!0,get:function(){return _utilities.doTypesOverlap}}),Object.defineProperty(exports,"assertValidName",{enumerable:!0,get:function(){return _utilities.assertValidName}}),Object.defineProperty(exports,"findBreakingChanges",{enumerable:!0,get:function(){return _utilities.findBreakingChanges}}),Object.defineProperty(exports,"BreakingChangeType",{enumerable:!0,get:function(){return _utilities.BreakingChangeType}}),Object.defineProperty(exports,"DangerousChangeType",{enumerable:!0,get:function(){return _utilities.DangerousChangeType}}),Object.defineProperty(exports,"findDeprecatedUsages",{enumerable:!0,get:function(){return _utilities.findDeprecatedUsages}})},{"./error":88,"./execution":92,"./graphql":94,"./language":104,"./subscription":112,"./type":117,"./utilities":131,"./validation":140}],96:[function(require,module,exports){"use strict";Object.defineProperty(exports,"__esModule",{value:!0}),exports.default=function(list,predicate){for(var i=0;i<list.length;i++)if(predicate(list[i]))return list[i]}},{}],97:[function(require,module,exports){"use strict";Object.defineProperty(exports,"__esModule",{value:!0}),exports.default=function(condition,message){if(!condition)throw new Error(message)}},{}],98:[function(require,module,exports){"use strict";Object.defineProperty(exports,"__esModule",{value:!0}),exports.default=function(value){return void 0===value||value!==value}},{}],99:[function(require,module,exports){"use strict";Object.defineProperty(exports,"__esModule",{value:!0}),exports.default=function(value){return null===value||void 0===value||value!==value}},{}],100:[function(require,module,exports){"use strict";Object.defineProperty(exports,"__esModule",{value:!0}),exports.default=function(list,keyFn){return list.reduce(function(map,item){return map[keyFn(item)]=item,map},Object.create(null))}},{}],101:[function(require,module,exports){"use strict";Object.defineProperty(exports,"__esModule",{value:!0}),exports.default=function(list,keyFn,valFn){return list.reduce(function(map,item){return map[keyFn(item)]=valFn(item),map},Object.create(null))}},{}],102:[function(require,module,exports){"use strict";Object.defineProperty(exports,"__esModule",{value:!0}),exports.default=function(items){var selected=items.slice(0,MAX_LENGTH);return selected.map(function(item){return'"'+item+'"'}).reduce(function(list,quoted,index){return list+(selected.length>2?", ":" ")+(index===selected.length-1?"or ":"")+quoted})};var MAX_LENGTH=5},{}],103:[function(require,module,exports){"use strict";function lexicalDistance(a,b){var i=void 0,j=void 0,d=[],aLength=a.length,bLength=b.length;for(i=0;i<=aLength;i++)d[i]=[i];for(j=1;j<=bLength;j++)d[0][j]=j;for(i=1;i<=aLength;i++)for(j=1;j<=bLength;j++){var cost=a[i-1]===b[j-1]?0:1;d[i][j]=Math.min(d[i-1][j]+1,d[i][j-1]+1,d[i-1][j-1]+cost),i>1&&j>1&&a[i-1]===b[j-2]&&a[i-2]===b[j-1]&&(d[i][j]=Math.min(d[i][j],d[i-2][j-2]+cost))}return d[aLength][bLength]}Object.defineProperty(exports,"__esModule",{value:!0}),exports.default=function(input,options){for(var optionsByDistance=Object.create(null),oLength=options.length,inputThreshold=input.length/2,i=0;i<oLength;i++){var distance=lexicalDistance(input,options[i]);distance<=Math.max(inputThreshold,options[i].length/2,1)&&(optionsByDistance[options[i]]=distance)}return Object.keys(optionsByDistance).sort(function(a,b){return optionsByDistance[a]-optionsByDistance[b]})}},{}],104:[function(require,module,exports){"use strict";Object.defineProperty(exports,"__esModule",{value:!0}),exports.BREAK=exports.getVisitFn=exports.visitWithTypeInfo=exports.visitInParallel=exports.visit=exports.Source=exports.print=exports.parseType=exports.parseValue=exports.parse=exports.TokenKind=exports.createLexer=exports.Kind=exports.getLocation=void 0;var _location=require("./location");Object.defineProperty(exports,"getLocation",{enumerable:!0,get:function(){return _location.getLocation}});var _lexer=require("./lexer");Object.defineProperty(exports,"createLexer",{enumerable:!0,get:function(){return _lexer.createLexer}}),Object.defineProperty(exports,"TokenKind",{enumerable:!0,get:function(){return _lexer.TokenKind}});var _parser=require("./parser");Object.defineProperty(exports,"parse",{enumerable:!0,get:function(){return _parser.parse}}),Object.defineProperty(exports,"parseValue",{enumerable:!0,get:function(){return _parser.parseValue}}),Object.defineProperty(exports,"parseType",{enumerable:!0,get:function(){return _parser.parseType}});var _printer=require("./printer");Object.defineProperty(exports,"print",{enumerable:!0,get:function(){return _printer.print}});var _source=require("./source");Object.defineProperty(exports,"Source",{enumerable:!0,get:function(){return _source.Source}});var _visitor=require("./visitor");Object.defineProperty(exports,"visit",{enumerable:!0,get:function(){return _visitor.visit}}),Object.defineProperty(exports,"visitInParallel",{enumerable:!0,get:function(){return _visitor.visitInParallel}}),Object.defineProperty(exports,"visitWithTypeInfo",{enumerable:!0,get:function(){return _visitor.visitWithTypeInfo}}),Object.defineProperty(exports,"getVisitFn",{enumerable:!0,get:function(){return _visitor.getVisitFn}}),Object.defineProperty(exports,"BREAK",{enumerable:!0,get:function(){return _visitor.BREAK}});var Kind=function(obj){if(obj&&obj.__esModule)return obj;var newObj={};if(null!=obj)for(var key in obj)Object.prototype.hasOwnProperty.call(obj,key)&&(newObj[key]=obj[key]);return newObj.default=obj,newObj}(require("./kinds"));exports.Kind=Kind},{"./kinds":105,"./lexer":106,"./location":107,"./parser":108,"./printer":109,"./source":110,"./visitor":111}],105:[function(require,module,exports){"use strict";Object.defineProperty(exports,"__esModule",{value:!0});exports.NAME="Name",exports.DOCUMENT="Document",exports.OPERATION_DEFINITION="OperationDefinition",exports.VARIABLE_DEFINITION="VariableDefinition",exports.VARIABLE="Variable",exports.SELECTION_SET="SelectionSet",exports.FIELD="Field",exports.ARGUMENT="Argument",exports.FRAGMENT_SPREAD="FragmentSpread",exports.INLINE_FRAGMENT="InlineFragment",exports.FRAGMENT_DEFINITION="FragmentDefinition",exports.INT="IntValue",exports.FLOAT="FloatValue",exports.STRING="StringValue",exports.BOOLEAN="BooleanValue",exports.NULL="NullValue",exports.ENUM="EnumValue",exports.LIST="ListValue",exports.OBJECT="ObjectValue",exports.OBJECT_FIELD="ObjectField",exports.DIRECTIVE="Directive",exports.NAMED_TYPE="NamedType",exports.LIST_TYPE="ListType",exports.NON_NULL_TYPE="NonNullType",exports.SCHEMA_DEFINITION="SchemaDefinition",exports.OPERATION_TYPE_DEFINITION="OperationTypeDefinition",exports.SCALAR_TYPE_DEFINITION="ScalarTypeDefinition",exports.OBJECT_TYPE_DEFINITION="ObjectTypeDefinition",exports.FIELD_DEFINITION="FieldDefinition",exports.INPUT_VALUE_DEFINITION="InputValueDefinition",exports.INTERFACE_TYPE_DEFINITION="InterfaceTypeDefinition",exports.UNION_TYPE_DEFINITION="UnionTypeDefinition",exports.ENUM_TYPE_DEFINITION="EnumTypeDefinition",exports.ENUM_VALUE_DEFINITION="EnumValueDefinition",exports.INPUT_OBJECT_TYPE_DEFINITION="InputObjectTypeDefinition",exports.TYPE_EXTENSION_DEFINITION="TypeExtensionDefinition",exports.DIRECTIVE_DEFINITION="DirectiveDefinition"},{}],106:[function(require,module,exports){"use strict";function advanceLexer(){var token=this.lastToken=this.token;if(token.kind!==EOF){do{token=token.next=readToken(this,token)}while(token.kind===COMMENT);this.token=token}return token}function Tok(kind,start,end,line,column,prev,value){this.kind=kind,this.start=start,this.end=end,this.line=line,this.column=column,this.value=value,this.prev=prev,this.next=null}function printCharCode(code){return isNaN(code)?EOF:code<127?JSON.stringify(String.fromCharCode(code)):'"\\u'+("00"+code.toString(16).toUpperCase()).slice(-4)+'"'}function readToken(lexer,prev){var source=lexer.source,body=source.body,bodyLength=body.length,position=positionAfterWhitespace(body,prev.end,lexer),line=lexer.line,col=1+position-lexer.lineStart;if(position>=bodyLength)return new Tok(EOF,bodyLength,bodyLength,line,col,prev);var code=charCodeAt.call(body,position);if(code<32&&9!==code&&10!==code&&13!==code)throw(0,_error.syntaxError)(source,position,"Cannot contain the invalid character "+printCharCode(code)+".");switch(code){case 33:return new Tok(BANG,position,position+1,line,col,prev);case 35:return readComment(source,position,line,col,prev);case 36:return new Tok(DOLLAR,position,position+1,line,col,prev);case 40:return new Tok(PAREN_L,position,position+1,line,col,prev);case 41:return new Tok(PAREN_R,position,position+1,line,col,prev);case 46:if(46===charCodeAt.call(body,position+1)&&46===charCodeAt.call(body,position+2))return new Tok(SPREAD,position,position+3,line,col,prev);break;case 58:return new Tok(COLON,position,position+1,line,col,prev);case 61:return new Tok(EQUALS,position,position+1,line,col,prev);case 64:return new Tok(AT,position,position+1,line,col,prev);case 91:return new Tok(BRACKET_L,position,position+1,line,col,prev);case 93:return new Tok(BRACKET_R,position,position+1,line,col,prev);case 123:return new Tok(BRACE_L,position,position+1,line,col,prev);case 124:return new Tok(PIPE,position,position+1,line,col,prev);case 125:return new Tok(BRACE_R,position,position+1,line,col,prev);case 65:case 66:case 67:case 68:case 69:case 70:case 71:case 72:case 73:case 74:case 75:case 76:case 77:case 78:case 79:case 80:case 81:case 82:case 83:case 84:case 85:case 86:case 87:case 88:case 89:case 90:case 95:case 97:case 98:case 99:case 100:case 101:case 102:case 103:case 104:case 105:case 106:case 107:case 108:case 109:case 110:case 111:case 112:case 113:case 114:case 115:case 116:case 117:case 118:case 119:case 120:case 121:case 122:return readName(source,position,line,col,prev);case 45:case 48:case 49:case 50:case 51:case 52:case 53:case 54:case 55:case 56:case 57:return readNumber(source,position,code,line,col,prev);case 34:return readString(source,position,line,col,prev)}throw(0,_error.syntaxError)(source,position,unexpectedCharacterMessage(code))}function unexpectedCharacterMessage(code){return 39===code?"Unexpected single quote character ('), did you mean to use a double quote (\")?":"Cannot parse the unexpected character "+printCharCode(code)+"."}function positionAfterWhitespace(body,startPosition,lexer){for(var bodyLength=body.length,position=startPosition;position<bodyLength;){var code=charCodeAt.call(body,position);if(9===code||32===code||44===code||65279===code)++position;else if(10===code)++position,++lexer.line,lexer.lineStart=position;else{if(13!==code)break;10===charCodeAt.call(body,position+1)?position+=2:++position,++lexer.line,lexer.lineStart=position}}return position}function readComment(source,start,line,col,prev){var body=source.body,code=void 0,position=start;do{code=charCodeAt.call(body,++position)}while(null!==code&&(code>31||9===code));return new Tok(COMMENT,start,position,line,col,prev,slice.call(body,start+1,position))}function readNumber(source,start,firstCode,line,col,prev){var body=source.body,code=firstCode,position=start,isFloat=!1;if(45===code&&(code=charCodeAt.call(body,++position)),48===code){if((code=charCodeAt.call(body,++position))>=48&&code<=57)throw(0,_error.syntaxError)(source,position,"Invalid number, unexpected digit after 0: "+printCharCode(code)+".")}else position=readDigits(source,position,code),code=charCodeAt.call(body,position);return 46===code&&(isFloat=!0,code=charCodeAt.call(body,++position),position=readDigits(source,position,code),code=charCodeAt.call(body,position)),69!==code&&101!==code||(isFloat=!0,43!==(code=charCodeAt.call(body,++position))&&45!==code||(code=charCodeAt.call(body,++position)),position=readDigits(source,position,code)),new Tok(isFloat?FLOAT:INT,start,position,line,col,prev,slice.call(body,start,position))}function readDigits(source,start,firstCode){var body=source.body,position=start,code=firstCode;if(code>=48&&code<=57){do{code=charCodeAt.call(body,++position)}while(code>=48&&code<=57);return position}throw(0,_error.syntaxError)(source,position,"Invalid number, expected digit but got: "+printCharCode(code)+".")}function readString(source,start,line,col,prev){for(var body=source.body,position=start+1,chunkStart=position,code=0,value="";position<body.length&&null!==(code=charCodeAt.call(body,position))&&10!==code&&13!==code&&34!==code;){if(code<32&&9!==code)throw(0,_error.syntaxError)(source,position,"Invalid character within String: "+printCharCode(code)+".");if(++position,92===code){switch(value+=slice.call(body,chunkStart,position-1),code=charCodeAt.call(body,position)){case 34:value+='"';break;case 47:value+="/";break;case 92:value+="\\";break;case 98:value+="\b";break;case 102:value+="\f";break;case 110:value+="\n";break;case 114:value+="\r";break;case 116:value+="\t";break;case 117:var charCode=uniCharCode(charCodeAt.call(body,position+1),charCodeAt.call(body,position+2),charCodeAt.call(body,position+3),charCodeAt.call(body,position+4));if(charCode<0)throw(0,_error.syntaxError)(source,position,"Invalid character escape sequence: \\u"+body.slice(position+1,position+5)+".");value+=String.fromCharCode(charCode),position+=4;break;default:throw(0,_error.syntaxError)(source,position,"Invalid character escape sequence: \\"+String.fromCharCode(code)+".")}chunkStart=++position}}if(34!==code)throw(0,_error.syntaxError)(source,position,"Unterminated string.");return value+=slice.call(body,chunkStart,position),new Tok(STRING,start,position+1,line,col,prev,value)}function uniCharCode(a,b,c,d){return char2hex(a)<<12|char2hex(b)<<8|char2hex(c)<<4|char2hex(d)}function char2hex(a){return a>=48&&a<=57?a-48:a>=65&&a<=70?a-55:a>=97&&a<=102?a-87:-1}function readName(source,position,line,col,prev){for(var body=source.body,bodyLength=body.length,end=position+1,code=0;end!==bodyLength&&null!==(code=charCodeAt.call(body,end))&&(95===code||code>=48&&code<=57||code>=65&&code<=90||code>=97&&code<=122);)++end;return new Tok(NAME,position,end,line,col,prev,slice.call(body,position,end))}Object.defineProperty(exports,"__esModule",{value:!0}),exports.TokenKind=void 0,exports.createLexer=function(source,options){var startOfFileToken=new Tok(SOF,0,0,0,0,null);return{source:source,options:options,lastToken:startOfFileToken,token:startOfFileToken,line:1,lineStart:0,advance:advanceLexer}},exports.getTokenDesc=function(token){var value=token.value;return value?token.kind+' "'+value+'"':token.kind};var _error=require("../error"),SOF="<SOF>",EOF="<EOF>",BANG="!",DOLLAR="$",PAREN_L="(",PAREN_R=")",SPREAD="...",COLON=":",EQUALS="=",AT="@",BRACKET_L="[",BRACKET_R="]",BRACE_L="{",PIPE="|",BRACE_R="}",NAME="Name",INT="Int",FLOAT="Float",STRING="String",COMMENT="Comment",charCodeAt=(exports.TokenKind={SOF:SOF,EOF:EOF,BANG:BANG,DOLLAR:DOLLAR,PAREN_L:PAREN_L,PAREN_R:PAREN_R,SPREAD:SPREAD,COLON:COLON,EQUALS:EQUALS,AT:AT,BRACKET_L:BRACKET_L,BRACKET_R:BRACKET_R,BRACE_L:BRACE_L,PIPE:PIPE,BRACE_R:BRACE_R,NAME:NAME,INT:INT,FLOAT:FLOAT,STRING:STRING,COMMENT:COMMENT},String.prototype.charCodeAt),slice=String.prototype.slice;Tok.prototype.toJSON=Tok.prototype.inspect=function(){return{kind:this.kind,value:this.value,line:this.line,column:this.column}}},{"../error":88}],107:[function(require,module,exports){"use strict";Object.defineProperty(exports,"__esModule",{value:!0}),exports.getLocation=function(source,position){for(var lineRegexp=/\r\n|[\n\r]/g,line=1,column=position+1,match=void 0;(match=lineRegexp.exec(source.body))&&match.index<position;)line+=1,column=position+1-(match.index+match[0].length);return{line:line,column:column}}},{}],108:[function(require,module,exports){"use strict";function parseName(lexer){var token=expect(lexer,_lexer.TokenKind.NAME);return{kind:_kinds.NAME,value:token.value,loc:loc(lexer,token)}}function parseDocument(lexer){var start=lexer.token;expect(lexer,_lexer.TokenKind.SOF);var definitions=[];do{definitions.push(parseDefinition(lexer))}while(!skip(lexer,_lexer.TokenKind.EOF));return{kind:_kinds.DOCUMENT,definitions:definitions,loc:loc(lexer,start)}}function parseDefinition(lexer){if(peek(lexer,_lexer.TokenKind.BRACE_L))return parseOperationDefinition(lexer);if(peek(lexer,_lexer.TokenKind.NAME))switch(lexer.token.value){case"query":case"mutation":case"subscription":return parseOperationDefinition(lexer);case"fragment":return parseFragmentDefinition(lexer);case"schema":case"scalar":case"type":case"interface":case"union":case"enum":case"input":case"extend":case"directive":return parseTypeSystemDefinition(lexer)}throw unexpected(lexer)}function parseOperationDefinition(lexer){var start=lexer.token;if(peek(lexer,_lexer.TokenKind.BRACE_L))return{kind:_kinds.OPERATION_DEFINITION,operation:"query",name:null,variableDefinitions:null,directives:[],selectionSet:parseSelectionSet(lexer),loc:loc(lexer,start)};var operation=parseOperationType(lexer),name=void 0;return peek(lexer,_lexer.TokenKind.NAME)&&(name=parseName(lexer)),{kind:_kinds.OPERATION_DEFINITION,operation:operation,name:name,variableDefinitions:parseVariableDefinitions(lexer),directives:parseDirectives(lexer),selectionSet:parseSelectionSet(lexer),loc:loc(lexer,start)}}function parseOperationType(lexer){var operationToken=expect(lexer,_lexer.TokenKind.NAME);switch(operationToken.value){case"query":return"query";case"mutation":return"mutation";case"subscription":return"subscription"}throw unexpected(lexer,operationToken)}function parseVariableDefinitions(lexer){return peek(lexer,_lexer.TokenKind.PAREN_L)?many(lexer,_lexer.TokenKind.PAREN_L,parseVariableDefinition,_lexer.TokenKind.PAREN_R):[]}function parseVariableDefinition(lexer){var start=lexer.token;return{kind:_kinds.VARIABLE_DEFINITION,variable:parseVariable(lexer),type:(expect(lexer,_lexer.TokenKind.COLON),parseTypeReference(lexer)),defaultValue:skip(lexer,_lexer.TokenKind.EQUALS)?parseValueLiteral(lexer,!0):null,loc:loc(lexer,start)}}function parseVariable(lexer){var start=lexer.token;return expect(lexer,_lexer.TokenKind.DOLLAR),{kind:_kinds.VARIABLE,name:parseName(lexer),loc:loc(lexer,start)}}function parseSelectionSet(lexer){var start=lexer.token;return{kind:_kinds.SELECTION_SET,selections:many(lexer,_lexer.TokenKind.BRACE_L,parseSelection,_lexer.TokenKind.BRACE_R),loc:loc(lexer,start)}}function parseSelection(lexer){return peek(lexer,_lexer.TokenKind.SPREAD)?parseFragment(lexer):parseField(lexer)}function parseField(lexer){var start=lexer.token,nameOrAlias=parseName(lexer),alias=void 0,name=void 0;return skip(lexer,_lexer.TokenKind.COLON)?(alias=nameOrAlias,name=parseName(lexer)):(alias=null,name=nameOrAlias),{kind:_kinds.FIELD,alias:alias,name:name,arguments:parseArguments(lexer),directives:parseDirectives(lexer),selectionSet:peek(lexer,_lexer.TokenKind.BRACE_L)?parseSelectionSet(lexer):null,loc:loc(lexer,start)}}function parseArguments(lexer){return peek(lexer,_lexer.TokenKind.PAREN_L)?many(lexer,_lexer.TokenKind.PAREN_L,parseArgument,_lexer.TokenKind.PAREN_R):[]}function parseArgument(lexer){var start=lexer.token;return{kind:_kinds.ARGUMENT,name:parseName(lexer),value:(expect(lexer,_lexer.TokenKind.COLON),parseValueLiteral(lexer,!1)),loc:loc(lexer,start)}}function parseFragment(lexer){var start=lexer.token;if(expect(lexer,_lexer.TokenKind.SPREAD),peek(lexer,_lexer.TokenKind.NAME)&&"on"!==lexer.token.value)return{kind:_kinds.FRAGMENT_SPREAD,name:parseFragmentName(lexer),directives:parseDirectives(lexer),loc:loc(lexer,start)};var typeCondition=null;return"on"===lexer.token.value&&(lexer.advance(),typeCondition=parseNamedType(lexer)),{kind:_kinds.INLINE_FRAGMENT,typeCondition:typeCondition,directives:parseDirectives(lexer),selectionSet:parseSelectionSet(lexer),loc:loc(lexer,start)}}function parseFragmentDefinition(lexer){var start=lexer.token;return expectKeyword(lexer,"fragment"),{kind:_kinds.FRAGMENT_DEFINITION,name:parseFragmentName(lexer),typeCondition:(expectKeyword(lexer,"on"),parseNamedType(lexer)),directives:parseDirectives(lexer),selectionSet:parseSelectionSet(lexer),loc:loc(lexer,start)}}function parseFragmentName(lexer){if("on"===lexer.token.value)throw unexpected(lexer);return parseName(lexer)}function parseValueLiteral(lexer,isConst){var token=lexer.token;switch(token.kind){case _lexer.TokenKind.BRACKET_L:return parseList(lexer,isConst);case _lexer.TokenKind.BRACE_L:return parseObject(lexer,isConst);case _lexer.TokenKind.INT:return lexer.advance(),{kind:_kinds.INT,value:token.value,loc:loc(lexer,token)};case _lexer.TokenKind.FLOAT:return lexer.advance(),{kind:_kinds.FLOAT,value:token.value,loc:loc(lexer,token)};case _lexer.TokenKind.STRING:return lexer.advance(),{kind:_kinds.STRING,value:token.value,loc:loc(lexer,token)};case _lexer.TokenKind.NAME:return"true"===token.value||"false"===token.value?(lexer.advance(),{kind:_kinds.BOOLEAN,value:"true"===token.value,loc:loc(lexer,token)}):"null"===token.value?(lexer.advance(),{kind:_kinds.NULL,loc:loc(lexer,token)}):(lexer.advance(),{kind:_kinds.ENUM,value:token.value,loc:loc(lexer,token)});case _lexer.TokenKind.DOLLAR:if(!isConst)return parseVariable(lexer)}throw unexpected(lexer)}function parseConstValue(lexer){return parseValueLiteral(lexer,!0)}function parseValueValue(lexer){return parseValueLiteral(lexer,!1)}function parseList(lexer,isConst){var start=lexer.token,item=isConst?parseConstValue:parseValueValue;return{kind:_kinds.LIST,values:any(lexer,_lexer.TokenKind.BRACKET_L,item,_lexer.TokenKind.BRACKET_R),loc:loc(lexer,start)}}function parseObject(lexer,isConst){var start=lexer.token;expect(lexer,_lexer.TokenKind.BRACE_L);for(var fields=[];!skip(lexer,_lexer.TokenKind.BRACE_R);)fields.push(parseObjectField(lexer,isConst));return{kind:_kinds.OBJECT,fields:fields,loc:loc(lexer,start)}}function parseObjectField(lexer,isConst){var start=lexer.token;return{kind:_kinds.OBJECT_FIELD,name:parseName(lexer),value:(expect(lexer,_lexer.TokenKind.COLON),parseValueLiteral(lexer,isConst)),loc:loc(lexer,start)}}function parseDirectives(lexer){for(var directives=[];peek(lexer,_lexer.TokenKind.AT);)directives.push(parseDirective(lexer));return directives}function parseDirective(lexer){var start=lexer.token;return expect(lexer,_lexer.TokenKind.AT),{kind:_kinds.DIRECTIVE,name:parseName(lexer),arguments:parseArguments(lexer),loc:loc(lexer,start)}}function parseTypeReference(lexer){var start=lexer.token,type=void 0;return skip(lexer,_lexer.TokenKind.BRACKET_L)?(type=parseTypeReference(lexer),expect(lexer,_lexer.TokenKind.BRACKET_R),type={kind:_kinds.LIST_TYPE,type:type,loc:loc(lexer,start)}):type=parseNamedType(lexer),skip(lexer,_lexer.TokenKind.BANG)?{kind:_kinds.NON_NULL_TYPE,type:type,loc:loc(lexer,start)}:type}function parseNamedType(lexer){var start=lexer.token;return{kind:_kinds.NAMED_TYPE,name:parseName(lexer),loc:loc(lexer,start)}}function parseTypeSystemDefinition(lexer){if(peek(lexer,_lexer.TokenKind.NAME))switch(lexer.token.value){case"schema":return parseSchemaDefinition(lexer);case"scalar":return parseScalarTypeDefinition(lexer);case"type":return parseObjectTypeDefinition(lexer);case"interface":return parseInterfaceTypeDefinition(lexer);case"union":return parseUnionTypeDefinition(lexer);case"enum":return parseEnumTypeDefinition(lexer);case"input":return parseInputObjectTypeDefinition(lexer);case"extend":return parseTypeExtensionDefinition(lexer);case"directive":return parseDirectiveDefinition(lexer)}throw unexpected(lexer)}function parseSchemaDefinition(lexer){var start=lexer.token;expectKeyword(lexer,"schema");var directives=parseDirectives(lexer),operationTypes=many(lexer,_lexer.TokenKind.BRACE_L,parseOperationTypeDefinition,_lexer.TokenKind.BRACE_R);return{kind:_kinds.SCHEMA_DEFINITION,directives:directives,operationTypes:operationTypes,loc:loc(lexer,start)}}function parseOperationTypeDefinition(lexer){var start=lexer.token,operation=parseOperationType(lexer);expect(lexer,_lexer.TokenKind.COLON);var type=parseNamedType(lexer);return{kind:_kinds.OPERATION_TYPE_DEFINITION,operation:operation,type:type,loc:loc(lexer,start)}}function parseScalarTypeDefinition(lexer){var start=lexer.token;expectKeyword(lexer,"scalar");var name=parseName(lexer),directives=parseDirectives(lexer);return{kind:_kinds.SCALAR_TYPE_DEFINITION,name:name,directives:directives,loc:loc(lexer,start)}}function parseObjectTypeDefinition(lexer){var start=lexer.token;expectKeyword(lexer,"type");var name=parseName(lexer),interfaces=parseImplementsInterfaces(lexer),directives=parseDirectives(lexer),fields=any(lexer,_lexer.TokenKind.BRACE_L,parseFieldDefinition,_lexer.TokenKind.BRACE_R);return{kind:_kinds.OBJECT_TYPE_DEFINITION,name:name,interfaces:interfaces,directives:directives,fields:fields,loc:loc(lexer,start)}}function parseImplementsInterfaces(lexer){var types=[];if("implements"===lexer.token.value){lexer.advance();do{types.push(parseNamedType(lexer))}while(peek(lexer,_lexer.TokenKind.NAME))}return types}function parseFieldDefinition(lexer){var start=lexer.token,name=parseName(lexer),args=parseArgumentDefs(lexer);expect(lexer,_lexer.TokenKind.COLON);var type=parseTypeReference(lexer),directives=parseDirectives(lexer);return{kind:_kinds.FIELD_DEFINITION,name:name,arguments:args,type:type,directives:directives,loc:loc(lexer,start)}}function parseArgumentDefs(lexer){return peek(lexer,_lexer.TokenKind.PAREN_L)?many(lexer,_lexer.TokenKind.PAREN_L,parseInputValueDef,_lexer.TokenKind.PAREN_R):[]}function parseInputValueDef(lexer){var start=lexer.token,name=parseName(lexer);expect(lexer,_lexer.TokenKind.COLON);var type=parseTypeReference(lexer),defaultValue=null;skip(lexer,_lexer.TokenKind.EQUALS)&&(defaultValue=parseConstValue(lexer));var directives=parseDirectives(lexer);return{kind:_kinds.INPUT_VALUE_DEFINITION,name:name,type:type,defaultValue:defaultValue,directives:directives,loc:loc(lexer,start)}}function parseInterfaceTypeDefinition(lexer){var start=lexer.token;expectKeyword(lexer,"interface");var name=parseName(lexer),directives=parseDirectives(lexer),fields=any(lexer,_lexer.TokenKind.BRACE_L,parseFieldDefinition,_lexer.TokenKind.BRACE_R);return{kind:_kinds.INTERFACE_TYPE_DEFINITION,name:name,directives:directives,fields:fields,loc:loc(lexer,start)}}function parseUnionTypeDefinition(lexer){var start=lexer.token;expectKeyword(lexer,"union");var name=parseName(lexer),directives=parseDirectives(lexer);expect(lexer,_lexer.TokenKind.EQUALS);var types=parseUnionMembers(lexer);return{kind:_kinds.UNION_TYPE_DEFINITION,name:name,directives:directives,types:types,loc:loc(lexer,start)}}function parseUnionMembers(lexer){skip(lexer,_lexer.TokenKind.PIPE);var members=[];do{members.push(parseNamedType(lexer))}while(skip(lexer,_lexer.TokenKind.PIPE));return members}function parseEnumTypeDefinition(lexer){var start=lexer.token;expectKeyword(lexer,"enum");var name=parseName(lexer),directives=parseDirectives(lexer),values=many(lexer,_lexer.TokenKind.BRACE_L,parseEnumValueDefinition,_lexer.TokenKind.BRACE_R);return{kind:_kinds.ENUM_TYPE_DEFINITION,name:name,directives:directives,values:values,loc:loc(lexer,start)}}function parseEnumValueDefinition(lexer){var start=lexer.token,name=parseName(lexer),directives=parseDirectives(lexer);return{kind:_kinds.ENUM_VALUE_DEFINITION,name:name,directives:directives,loc:loc(lexer,start)}}function parseInputObjectTypeDefinition(lexer){var start=lexer.token;expectKeyword(lexer,"input");var name=parseName(lexer),directives=parseDirectives(lexer),fields=any(lexer,_lexer.TokenKind.BRACE_L,parseInputValueDef,_lexer.TokenKind.BRACE_R);return{kind:_kinds.INPUT_OBJECT_TYPE_DEFINITION,name:name,directives:directives,fields:fields,loc:loc(lexer,start)}}function parseTypeExtensionDefinition(lexer){var start=lexer.token;expectKeyword(lexer,"extend");var definition=parseObjectTypeDefinition(lexer);return{kind:_kinds.TYPE_EXTENSION_DEFINITION,definition:definition,loc:loc(lexer,start)}}function parseDirectiveDefinition(lexer){var start=lexer.token;expectKeyword(lexer,"directive"),expect(lexer,_lexer.TokenKind.AT);var name=parseName(lexer),args=parseArgumentDefs(lexer);expectKeyword(lexer,"on");var locations=parseDirectiveLocations(lexer);return{kind:_kinds.DIRECTIVE_DEFINITION,name:name,arguments:args,locations:locations,loc:loc(lexer,start)}}function parseDirectiveLocations(lexer){skip(lexer,_lexer.TokenKind.PIPE);var locations=[];do{locations.push(parseName(lexer))}while(skip(lexer,_lexer.TokenKind.PIPE));return locations}function loc(lexer,startToken){if(!lexer.options.noLocation)return new Loc(startToken,lexer.lastToken,lexer.source)}function Loc(startToken,endToken,source){this.start=startToken.start,this.end=endToken.end,this.startToken=startToken,this.endToken=endToken,this.source=source}function peek(lexer,kind){return lexer.token.kind===kind}function skip(lexer,kind){var match=lexer.token.kind===kind;return match&&lexer.advance(),match}function expect(lexer,kind){var token=lexer.token;if(token.kind===kind)return lexer.advance(),token;throw(0,_error.syntaxError)(lexer.source,token.start,"Expected "+kind+", found "+(0,_lexer.getTokenDesc)(token))}function expectKeyword(lexer,value){var token=lexer.token;if(token.kind===_lexer.TokenKind.NAME&&token.value===value)return lexer.advance(),token;throw(0,_error.syntaxError)(lexer.source,token.start,'Expected "'+value+'", found '+(0,_lexer.getTokenDesc)(token))}function unexpected(lexer,atToken){var token=atToken||lexer.token;return(0,_error.syntaxError)(lexer.source,token.start,"Unexpected "+(0,_lexer.getTokenDesc)(token))}function any(lexer,openKind,parseFn,closeKind){expect(lexer,openKind);for(var nodes=[];!skip(lexer,closeKind);)nodes.push(parseFn(lexer));return nodes}function many(lexer,openKind,parseFn,closeKind){expect(lexer,openKind);for(var nodes=[parseFn(lexer)];!skip(lexer,closeKind);)nodes.push(parseFn(lexer));return nodes}Object.defineProperty(exports,"__esModule",{value:!0}),exports.parse=function(source,options){var sourceObj="string"==typeof source?new _source.Source(source):source;if(!(sourceObj instanceof _source.Source))throw new TypeError("Must provide Source. Received: "+String(sourceObj));return parseDocument((0,_lexer.createLexer)(sourceObj,options||{}))},exports.parseValue=function(source,options){var sourceObj="string"==typeof source?new _source.Source(source):source,lexer=(0,_lexer.createLexer)(sourceObj,options||{});expect(lexer,_lexer.TokenKind.SOF);var value=parseValueLiteral(lexer,!1);return expect(lexer,_lexer.TokenKind.EOF),value},exports.parseType=function(source,options){var sourceObj="string"==typeof source?new _source.Source(source):source,lexer=(0,_lexer.createLexer)(sourceObj,options||{});expect(lexer,_lexer.TokenKind.SOF);var type=parseTypeReference(lexer);return expect(lexer,_lexer.TokenKind.EOF),type},exports.parseConstValue=parseConstValue,exports.parseTypeReference=parseTypeReference,exports.parseNamedType=parseNamedType;var _source=require("./source"),_error=require("../error"),_lexer=require("./lexer"),_kinds=require("./kinds");Loc.prototype.toJSON=Loc.prototype.inspect=function(){return{start:this.start,end:this.end}}},{"../error":88,"./kinds":105,"./lexer":106,"./source":110}],109:[function(require,module,exports){"use strict";function join(maybeArray,separator){return maybeArray?maybeArray.filter(function(x){return x}).join(separator||""):""}function block(array){return array&&0!==array.length?indent("{\n"+join(array,"\n"))+"\n}":"{}"}function wrap(start,maybeString,end){return maybeString?start+maybeString+(end||""):""}function indent(maybeString){return maybeString&&maybeString.replace(/\n/g,"\n  ")}Object.defineProperty(exports,"__esModule",{value:!0}),exports.print=function(ast){return(0,_visitor.visit)(ast,{leave:printDocASTReducer})};var _visitor=require("./visitor"),printDocASTReducer={Name:function(node){return node.value},Variable:function(node){return"$"+node.name},Document:function(node){return join(node.definitions,"\n\n")+"\n"},OperationDefinition:function(node){var op=node.operation,name=node.name,varDefs=wrap("(",join(node.variableDefinitions,", "),")"),directives=join(node.directives," "),selectionSet=node.selectionSet;return name||directives||varDefs||"query"!==op?join([op,join([name,varDefs]),directives,selectionSet]," "):selectionSet},VariableDefinition:function(_ref){return _ref.variable+": "+_ref.type+wrap(" = ",_ref.defaultValue)},SelectionSet:function(_ref2){return block(_ref2.selections)},Field:function(_ref3){var alias=_ref3.alias,name=_ref3.name,args=_ref3.arguments,directives=_ref3.directives,selectionSet=_ref3.selectionSet;return join([wrap("",alias,": ")+name+wrap("(",join(args,", "),")"),join(directives," "),selectionSet]," ")},Argument:function(_ref4){return _ref4.name+": "+_ref4.value},FragmentSpread:function(_ref5){return"..."+_ref5.name+wrap(" ",join(_ref5.directives," "))},InlineFragment:function(_ref6){var typeCondition=_ref6.typeCondition,directives=_ref6.directives,selectionSet=_ref6.selectionSet;return join(["...",wrap("on ",typeCondition),join(directives," "),selectionSet]," ")},FragmentDefinition:function(_ref7){var name=_ref7.name,typeCondition=_ref7.typeCondition,directives=_ref7.directives,selectionSet=_ref7.selectionSet;return"fragment "+name+" on "+typeCondition+" "+wrap("",join(directives," ")," ")+selectionSet},IntValue:function(_ref8){return _ref8.value},FloatValue:function(_ref9){return _ref9.value},StringValue:function(_ref10){var value=_ref10.value;return JSON.stringify(value)},BooleanValue:function(_ref11){var value=_ref11.value;return JSON.stringify(value)},NullValue:function(){return"null"},EnumValue:function(_ref12){return _ref12.value},ListValue:function(_ref13){return"["+join(_ref13.values,", ")+"]"},ObjectValue:function(_ref14){return"{"+join(_ref14.fields,", ")+"}"},ObjectField:function(_ref15){return _ref15.name+": "+_ref15.value},Directive:function(_ref16){return"@"+_ref16.name+wrap("(",join(_ref16.arguments,", "),")")},NamedType:function(_ref17){return _ref17.name},ListType:function(_ref18){return"["+_ref18.type+"]"},NonNullType:function(_ref19){return _ref19.type+"!"},SchemaDefinition:function(_ref20){var directives=_ref20.directives,operationTypes=_ref20.operationTypes;return join(["schema",join(directives," "),block(operationTypes)]," ")},OperationTypeDefinition:function(_ref21){return _ref21.operation+": "+_ref21.type},ScalarTypeDefinition:function(_ref22){return join(["scalar",_ref22.name,join(_ref22.directives," ")]," ")},ObjectTypeDefinition:function(_ref23){var name=_ref23.name,interfaces=_ref23.interfaces,directives=_ref23.directives,fields=_ref23.fields;return join(["type",name,wrap("implements ",join(interfaces,", ")),join(directives," "),block(fields)]," ")},FieldDefinition:function(_ref24){var name=_ref24.name,args=_ref24.arguments,type=_ref24.type,directives=_ref24.directives;return name+wrap("(",join(args,", "),")")+": "+type+wrap(" ",join(directives," "))},InputValueDefinition:function(_ref25){var name=_ref25.name,type=_ref25.type,defaultValue=_ref25.defaultValue,directives=_ref25.directives;return join([name+": "+type,wrap("= ",defaultValue),join(directives," ")]," ")},InterfaceTypeDefinition:function(_ref26){var name=_ref26.name,directives=_ref26.directives,fields=_ref26.fields;return join(["interface",name,join(directives," "),block(fields)]," ")},UnionTypeDefinition:function(_ref27){var name=_ref27.name,directives=_ref27.directives,types=_ref27.types;return join(["union",name,join(directives," "),"= "+join(types," | ")]," ")},EnumTypeDefinition:function(_ref28){var name=_ref28.name,directives=_ref28.directives,values=_ref28.values;return join(["enum",name,join(directives," "),block(values)]," ")},EnumValueDefinition:function(_ref29){return join([_ref29.name,join(_ref29.directives," ")]," ")},InputObjectTypeDefinition:function(_ref30){var name=_ref30.name,directives=_ref30.directives,fields=_ref30.fields;return join(["input",name,join(directives," "),block(fields)]," ")},TypeExtensionDefinition:function(_ref31){return"extend "+_ref31.definition},DirectiveDefinition:function(_ref32){var name=_ref32.name,args=_ref32.arguments,locations=_ref32.locations;return"directive @"+name+wrap("(",join(args,", "),")")+" on "+join(locations," | ")}}},{"./visitor":111}],110:[function(require,module,exports){"use strict";function _classCallCheck(instance,Constructor){if(!(instance instanceof Constructor))throw new TypeError("Cannot call a class as a function")}Object.defineProperty(exports,"__esModule",{value:!0});exports.Source=function Source(body,name){_classCallCheck(this,Source),this.body=body,this.name=name||"GraphQL request"}},{}],111:[function(require,module,exports){"use strict";function isNode(maybeNode){return maybeNode&&"string"==typeof maybeNode.kind}function getVisitFn(visitor,kind,isLeaving){var kindVisitor=visitor[kind];if(kindVisitor){if(!isLeaving&&"function"==typeof kindVisitor)return kindVisitor;var kindSpecificVisitor=isLeaving?kindVisitor.leave:kindVisitor.enter;if("function"==typeof kindSpecificVisitor)return kindSpecificVisitor}else{var specificVisitor=isLeaving?visitor.leave:visitor.enter;if(specificVisitor){if("function"==typeof specificVisitor)return specificVisitor;var specificKindVisitor=specificVisitor[kind];if("function"==typeof specificKindVisitor)return specificKindVisitor}}}Object.defineProperty(exports,"__esModule",{value:!0}),exports.visit=function(root,visitor,keyMap){var visitorKeys=keyMap||QueryDocumentKeys,stack=void 0,inArray=Array.isArray(root),keys=[root],index=-1,edits=[],parent=void 0,path=[],ancestors=[],newRoot=root;do{var isLeaving=++index===keys.length,key=void 0,node=void 0,isEdited=isLeaving&&0!==edits.length;if(isLeaving){if(key=0===ancestors.length?void 0:path.pop(),node=parent,parent=ancestors.pop(),isEdited){if(inArray)node=node.slice();else{var clone={};for(var k in node)node.hasOwnProperty(k)&&(clone[k]=node[k]);node=clone}for(var editOffset=0,ii=0;ii<edits.length;ii++){var editKey=edits[ii][0],editValue=edits[ii][1];inArray&&(editKey-=editOffset),inArray&&null===editValue?(node.splice(editKey,1),editOffset++):node[editKey]=editValue}}index=stack.index,keys=stack.keys,edits=stack.edits,inArray=stack.inArray,stack=stack.prev}else{if(key=parent?inArray?index:keys[index]:void 0,null===(node=parent?parent[key]:newRoot)||void 0===node)continue;parent&&path.push(key)}var result=void 0;if(!Array.isArray(node)){if(!isNode(node))throw new Error("Invalid AST Node: "+JSON.stringify(node));var visitFn=getVisitFn(visitor,node.kind,isLeaving);if(visitFn){if((result=visitFn.call(visitor,node,key,parent,path,ancestors))===BREAK)break;if(!1===result){if(!isLeaving){path.pop();continue}}else if(void 0!==result&&(edits.push([key,result]),!isLeaving)){if(!isNode(result)){path.pop();continue}node=result}}}void 0===result&&isEdited&&edits.push([key,node]),isLeaving||(stack={inArray:inArray,index:index,keys:keys,edits:edits,prev:stack},keys=(inArray=Array.isArray(node))?node:visitorKeys[node.kind]||[],index=-1,edits=[],parent&&ancestors.push(parent),parent=node)}while(void 0!==stack);return 0!==edits.length&&(newRoot=edits[edits.length-1][1]),newRoot},exports.visitInParallel=function(visitors){var skipping=new Array(visitors.length);return{enter:function(node){for(var i=0;i<visitors.length;i++)if(!skipping[i]){var fn=getVisitFn(visitors[i],node.kind,!1);if(fn){var result=fn.apply(visitors[i],arguments);if(!1===result)skipping[i]=node;else if(result===BREAK)skipping[i]=BREAK;else if(void 0!==result)return result}}},leave:function(node){for(var i=0;i<visitors.length;i++)if(skipping[i])skipping[i]===node&&(skipping[i]=null);else{var fn=getVisitFn(visitors[i],node.kind,!0);if(fn){var result=fn.apply(visitors[i],arguments);if(result===BREAK)skipping[i]=BREAK;else if(void 0!==result&&!1!==result)return result}}}}},exports.visitWithTypeInfo=function(typeInfo,visitor){return{enter:function(node){typeInfo.enter(node);var fn=getVisitFn(visitor,node.kind,!1);if(fn){var result=fn.apply(visitor,arguments);return void 0!==result&&(typeInfo.leave(node),isNode(result)&&typeInfo.enter(result)),result}},leave:function(node){var fn=getVisitFn(visitor,node.kind,!0),result=void 0;return fn&&(result=fn.apply(visitor,arguments)),typeInfo.leave(node),result}}},exports.getVisitFn=getVisitFn;var QueryDocumentKeys=exports.QueryDocumentKeys={Name:[],Document:["definitions"],OperationDefinition:["name","variableDefinitions","directives","selectionSet"],VariableDefinition:["variable","type","defaultValue"],Variable:["name"],SelectionSet:["selections"],Field:["alias","name","arguments","directives","selectionSet"],Argument:["name","value"],FragmentSpread:["name","directives"],InlineFragment:["typeCondition","directives","selectionSet"],FragmentDefinition:["name","typeCondition","directives","selectionSet"],IntValue:[],FloatValue:[],StringValue:[],BooleanValue:[],NullValue:[],EnumValue:[],ListValue:["values"],ObjectValue:["fields"],ObjectField:["name","value"],Directive:["name","arguments"],NamedType:["name"],ListType:["type"],NonNullType:["type"],SchemaDefinition:["directives","operationTypes"],OperationTypeDefinition:["type"],ScalarTypeDefinition:["name","directives"],ObjectTypeDefinition:["name","interfaces","directives","fields"],FieldDefinition:["name","arguments","type","directives"],InputValueDefinition:["name","type","defaultValue","directives"],InterfaceTypeDefinition:["name","directives","fields"],UnionTypeDefinition:["name","directives","types"],EnumTypeDefinition:["name","directives","values"],EnumValueDefinition:["name","directives"],InputObjectTypeDefinition:["name","directives","fields"],TypeExtensionDefinition:["definition"],DirectiveDefinition:["name","arguments","locations"]},BREAK=exports.BREAK={}},{}],112:[function(require,module,exports){"use strict";Object.defineProperty(exports,"__esModule",{value:!0});var _subscribe=require("./subscribe");Object.defineProperty(exports,"subscribe",{enumerable:!0,get:function(){return _subscribe.subscribe}}),Object.defineProperty(exports,"createSourceEventStream",{enumerable:!0,get:function(){return _subscribe.createSourceEventStream}})},{"./subscribe":114}],113:[function(require,module,exports){"use strict";function _defineProperty(obj,key,value){return key in obj?Object.defineProperty(obj,key,{value:value,enumerable:!0,configurable:!0,writable:!0}):obj[key]=value,obj}function asyncMapValue(value,callback){return new Promise(function(resolve){return resolve(callback(value))})}function iteratorResult(value){return{value:value,done:!1}}Object.defineProperty(exports,"__esModule",{value:!0}),exports.default=function(iterable,callback){function mapResult(result){return result.done?result:asyncMapValue(result.value,callback).then(iteratorResult,abruptClose)}var iterator=(0,_iterall.getAsyncIterator)(iterable),$return=void 0,abruptClose=void 0;return"function"==typeof iterator.return&&($return=iterator.return,abruptClose=function(error){var rethrow=function(){return Promise.reject(error)};return $return.call(iterator).then(rethrow,rethrow)}),_defineProperty({next:function(){return iterator.next().then(mapResult)},return:function(){return $return?$return.call(iterator).then(mapResult):Promise.resolve({value:void 0,done:!0})},throw:function(error){return"function"==typeof iterator.throw?iterator.throw(error).then(mapResult):Promise.reject(error).catch(abruptClose)}},_iterall.$$asyncIterator,function(){return this})};var _iterall=require("iterall")},{iterall:169}],114:[function(require,module,exports){"use strict";function _interopRequireDefault(obj){return obj&&obj.__esModule?obj:{default:obj}}function subscribeImpl(schema,document,rootValue,contextValue,variableValues,operationName,fieldResolver,subscribeFieldResolver){var subscription=createSourceEventStream(schema,document,rootValue,contextValue,variableValues,operationName,subscribeFieldResolver);return(0,_mapAsyncIterator2.default)(subscription,function(payload){return(0,_execute.execute)(schema,document,payload,contextValue,variableValues,operationName,fieldResolver)})}function createSourceEventStream(schema,document,rootValue,contextValue,variableValues,operationName,fieldResolver){(0,_execute.assertValidExecutionArguments)(schema,document,variableValues);var exeContext=(0,_execute.buildExecutionContext)(schema,document,rootValue,contextValue,variableValues,operationName,fieldResolver),type=(0,_execute.getOperationRootType)(schema,exeContext.operation),fields=(0,_execute.collectFields)(exeContext,type,exeContext.operation.selectionSet,Object.create(null),Object.create(null)),responseName=Object.keys(fields)[0],fieldNodes=fields[responseName],fieldNode=fieldNodes[0],fieldDef=(0,_execute.getFieldDef)(schema,type,fieldNode.name.value);(0,_invariant2.default)(fieldDef,"This subscription is not defined by the schema.");var resolveFn=fieldDef.subscribe||exeContext.fieldResolver,info=(0,_execute.buildResolveInfo)(exeContext,fieldDef,fieldNodes,type,(0,_execute.addPath)(void 0,responseName)),subscription=(0,_execute.resolveFieldValueOrError)(exeContext,fieldDef,fieldNodes,resolveFn,rootValue,info);if(subscription instanceof Error)throw subscription;if(!(0,_iterall.isAsyncIterable)(subscription))throw new Error("Subscription must return Async Iterable. Received: "+String(subscription));return subscription}Object.defineProperty(exports,"__esModule",{value:!0}),exports.subscribe=function(argsOrSchema,document,rootValue,contextValue,variableValues,operationName,fieldResolver,subscribeFieldResolver){var args=1===arguments.length?argsOrSchema:void 0,schema=args?args.schema:argsOrSchema;return args?subscribeImpl(schema,args.document,args.rootValue,args.contextValue,args.variableValues,args.operationName,args.fieldResolver,args.subscribeFieldResolver):subscribeImpl(schema,document,rootValue,contextValue,variableValues,operationName,fieldResolver,subscribeFieldResolver)},exports.createSourceEventStream=createSourceEventStream;var _iterall=require("iterall"),_execute=require("../execution/execute"),_invariant2=(require("../type/schema"),_interopRequireDefault(require("../jsutils/invariant"))),_mapAsyncIterator2=_interopRequireDefault(require("./mapAsyncIterator"))},{"../execution/execute":91,"../jsutils/invariant":97,"../type/schema":120,"./mapAsyncIterator":113,iterall:169}],115:[function(require,module,exports){"use strict";function _interopRequireDefault(obj){return obj&&obj.__esModule?obj:{default:obj}}function _classCallCheck(instance,Constructor){if(!(instance instanceof Constructor))throw new TypeError("Cannot call a class as a function")}function isType(type){return type instanceof GraphQLScalarType||type instanceof GraphQLObjectType||type instanceof GraphQLInterfaceType||type instanceof GraphQLUnionType||type instanceof GraphQLEnumType||type instanceof GraphQLInputObjectType||type instanceof GraphQLList||type instanceof GraphQLNonNull}function isInputType(type){return type instanceof GraphQLScalarType||type instanceof GraphQLEnumType||type instanceof GraphQLInputObjectType||type instanceof GraphQLNonNull&&isInputType(type.ofType)||type instanceof GraphQLList&&isInputType(type.ofType)}function isOutputType(type){return type instanceof GraphQLScalarType||type instanceof GraphQLObjectType||type instanceof GraphQLInterfaceType||type instanceof GraphQLUnionType||type instanceof GraphQLEnumType||type instanceof GraphQLNonNull&&isOutputType(type.ofType)||type instanceof GraphQLList&&isOutputType(type.ofType)}function isLeafType(type){return type instanceof GraphQLScalarType||type instanceof GraphQLEnumType}function isCompositeType(type){return type instanceof GraphQLObjectType||type instanceof GraphQLInterfaceType||type instanceof GraphQLUnionType}function isAbstractType(type){return type instanceof GraphQLInterfaceType||type instanceof GraphQLUnionType}function isNamedType(type){return type instanceof GraphQLScalarType||type instanceof GraphQLObjectType||type instanceof GraphQLInterfaceType||type instanceof GraphQLUnionType||type instanceof GraphQLEnumType||type instanceof GraphQLInputObjectType}function resolveThunk(thunk){return"function"==typeof thunk?thunk():thunk}function defineInterfaces(type,interfacesThunk){var interfaces=resolveThunk(interfacesThunk);if(!interfaces)return[];(0,_invariant2.default)(Array.isArray(interfaces),type.name+" interfaces must be an Array or a function which returns an Array.");var implementedTypeNames=Object.create(null);return interfaces.forEach(function(iface){(0,_invariant2.default)(iface instanceof GraphQLInterfaceType,type.name+" may only implement Interface types, it cannot implement: "+String(iface)+"."),(0,_invariant2.default)(!implementedTypeNames[iface.name],type.name+" may declare it implements "+iface.name+" only once."),implementedTypeNames[iface.name]=!0,"function"!=typeof iface.resolveType&&(0,_invariant2.default)("function"==typeof type.isTypeOf,"Interface Type "+iface.name+' does not provide a "resolveType" function and implementing Type '+type.name+' does not provide a "isTypeOf" function. There is no way to resolve this implementing type during execution.')}),interfaces}function defineFieldMap(type,fieldsThunk){var fieldMap=resolveThunk(fieldsThunk);(0,_invariant2.default)(isPlainObj(fieldMap),type.name+" fields must be an object with field names as keys or a function which returns such an object.");var fieldNames=Object.keys(fieldMap);(0,_invariant2.default)(fieldNames.length>0,type.name+" fields must be an object with field names as keys or a function which returns such an object.");var resultFieldMap=Object.create(null);return fieldNames.forEach(function(fieldName){(0,_assertValidName.assertValidName)(fieldName);var fieldConfig=fieldMap[fieldName];(0,_invariant2.default)(isPlainObj(fieldConfig),type.name+"."+fieldName+" field config must be an object"),(0,_invariant2.default)(!fieldConfig.hasOwnProperty("isDeprecated"),type.name+"."+fieldName+' should provide "deprecationReason" instead of "isDeprecated".');var field=_extends({},fieldConfig,{isDeprecated:Boolean(fieldConfig.deprecationReason),name:fieldName});(0,_invariant2.default)(isOutputType(field.type),type.name+"."+fieldName+" field type must be Output Type but got: "+String(field.type)+"."),(0,_invariant2.default)(isValidResolver(field.resolve),type.name+"."+fieldName+" field resolver must be a function if provided, but got: "+String(field.resolve)+".");var argsConfig=fieldConfig.args;argsConfig?((0,_invariant2.default)(isPlainObj(argsConfig),type.name+"."+fieldName+" args must be an object with argument names as keys."),field.args=Object.keys(argsConfig).map(function(argName){(0,_assertValidName.assertValidName)(argName);var arg=argsConfig[argName];return(0,_invariant2.default)(isInputType(arg.type),type.name+"."+fieldName+"("+argName+":) argument type must be Input Type but got: "+String(arg.type)+"."),{name:argName,description:void 0===arg.description?null:arg.description,type:arg.type,defaultValue:arg.defaultValue}})):field.args=[],resultFieldMap[fieldName]=field}),resultFieldMap}function isPlainObj(obj){return obj&&"object"==typeof obj&&!Array.isArray(obj)}function isValidResolver(resolver){return null==resolver||"function"==typeof resolver}function defineTypes(unionType,typesThunk){var types=resolveThunk(typesThunk);(0,_invariant2.default)(Array.isArray(types)&&types.length>0,"Must provide Array of types or a function which returns such an array for Union "+unionType.name+".");var includedTypeNames=Object.create(null);return types.forEach(function(objType){(0,_invariant2.default)(objType instanceof GraphQLObjectType,unionType.name+" may only contain Object types, it cannot contain: "+String(objType)+"."),(0,_invariant2.default)(!includedTypeNames[objType.name],unionType.name+" can include "+objType.name+" type only once."),includedTypeNames[objType.name]=!0,"function"!=typeof unionType.resolveType&&(0,_invariant2.default)("function"==typeof objType.isTypeOf,'Union type "'+unionType.name+'" does not provide a "resolveType" function and possible type "'+objType.name+'" does not provide an "isTypeOf" function. There is no way to resolve this possible type during execution.')}),types}function defineEnumValues(type,valueMap){(0,_invariant2.default)(isPlainObj(valueMap),type.name+" values must be an object with value names as keys.");var valueNames=Object.keys(valueMap);return(0,_invariant2.default)(valueNames.length>0,type.name+" values must be an object with value names as keys."),valueNames.map(function(valueName){(0,_assertValidName.assertValidName)(valueName),(0,_invariant2.default)(-1===["true","false","null"].indexOf(valueName),'Name "'+valueName+'" can not be used as an Enum value.');var value=valueMap[valueName];return(0,_invariant2.default)(isPlainObj(value),type.name+"."+valueName+' must refer to an object with a "value" key representing an internal value but got: '+String(value)+"."),(0,_invariant2.default)(!value.hasOwnProperty("isDeprecated"),type.name+"."+valueName+' should provide "deprecationReason" instead of "isDeprecated".'),{name:valueName,description:value.description,isDeprecated:Boolean(value.deprecationReason),deprecationReason:value.deprecationReason,value:value.hasOwnProperty("value")?value.value:valueName}})}Object.defineProperty(exports,"__esModule",{value:!0}),exports.GraphQLNonNull=exports.GraphQLList=exports.GraphQLInputObjectType=exports.GraphQLEnumType=exports.GraphQLUnionType=exports.GraphQLInterfaceType=exports.GraphQLObjectType=exports.GraphQLScalarType=void 0;var _extends=Object.assign||function(target){for(var i=1;i<arguments.length;i++){var source=arguments[i];for(var key in source)Object.prototype.hasOwnProperty.call(source,key)&&(target[key]=source[key])}return target};exports.isType=isType,exports.assertType=function(type){return(0,_invariant2.default)(isType(type),"Expected "+String(type)+" to be a GraphQL type."),type},exports.isInputType=isInputType,exports.assertInputType=function(type){return(0,_invariant2.default)(isInputType(type),"Expected "+String(type)+" to be a GraphQL input type."),type},exports.isOutputType=isOutputType,exports.assertOutputType=function(type){return(0,_invariant2.default)(isOutputType(type),"Expected "+String(type)+" to be a GraphQL output type."),type},exports.isLeafType=isLeafType,exports.assertLeafType=function(type){return(0,_invariant2.default)(isLeafType(type),"Expected "+String(type)+" to be a GraphQL leaf type."),type},exports.isCompositeType=isCompositeType,exports.assertCompositeType=function(type){return(0,_invariant2.default)(isCompositeType(type),"Expected "+String(type)+" to be a GraphQL composite type."),type},exports.isAbstractType=isAbstractType,exports.assertAbstractType=function(type){return(0,_invariant2.default)(isAbstractType(type),"Expected "+String(type)+" to be a GraphQL abstract type."),type},exports.getNullableType=function(type){return type instanceof GraphQLNonNull?type.ofType:type},exports.isNamedType=isNamedType,exports.assertNamedType=function(type){return(0,_invariant2.default)(isNamedType(type),"Expected "+String(type)+" to be a GraphQL named type."),type},exports.getNamedType=function(type){if(type){for(var unmodifiedType=type;unmodifiedType instanceof GraphQLList||unmodifiedType instanceof GraphQLNonNull;)unmodifiedType=unmodifiedType.ofType;return unmodifiedType}};var _invariant2=_interopRequireDefault(require("../jsutils/invariant")),_isNullish2=_interopRequireDefault(require("../jsutils/isNullish")),Kind=function(obj){if(obj&&obj.__esModule)return obj;var newObj={};if(null!=obj)for(var key in obj)Object.prototype.hasOwnProperty.call(obj,key)&&(newObj[key]=obj[key]);return newObj.default=obj,newObj}(require("../language/kinds")),_assertValidName=require("../utilities/assertValidName"),GraphQLScalarType=exports.GraphQLScalarType=function(){function GraphQLScalarType(config){_classCallCheck(this,GraphQLScalarType),(0,_assertValidName.assertValidName)(config.name),this.name=config.name,this.description=config.description,(0,_invariant2.default)("function"==typeof config.serialize,this.name+' must provide "serialize" function. If this custom Scalar is also used as an input type, ensure "parseValue" and "parseLiteral" functions are also provided.'),(config.parseValue||config.parseLiteral)&&(0,_invariant2.default)("function"==typeof config.parseValue&&"function"==typeof config.parseLiteral,this.name+' must provide both "parseValue" and "parseLiteral" functions.'),this._scalarConfig=config}return GraphQLScalarType.prototype.serialize=function(value){return(0,this._scalarConfig.serialize)(value)},GraphQLScalarType.prototype.isValidValue=function(value){return!(0,_isNullish2.default)(this.parseValue(value))},GraphQLScalarType.prototype.parseValue=function(value){var parser=this._scalarConfig.parseValue;return parser&&!(0,_isNullish2.default)(value)?parser(value):void 0},GraphQLScalarType.prototype.isValidLiteral=function(valueNode){return!(0,_isNullish2.default)(this.parseLiteral(valueNode))},GraphQLScalarType.prototype.parseLiteral=function(valueNode){var parser=this._scalarConfig.parseLiteral;return parser?parser(valueNode):void 0},GraphQLScalarType.prototype.toString=function(){return this.name},GraphQLScalarType}();GraphQLScalarType.prototype.toJSON=GraphQLScalarType.prototype.inspect=GraphQLScalarType.prototype.toString;var GraphQLObjectType=exports.GraphQLObjectType=function(){function GraphQLObjectType(config){_classCallCheck(this,GraphQLObjectType),(0,_assertValidName.assertValidName)(config.name,config.isIntrospection),this.name=config.name,this.description=config.description,config.isTypeOf&&(0,_invariant2.default)("function"==typeof config.isTypeOf,this.name+' must provide "isTypeOf" as a function.'),this.isTypeOf=config.isTypeOf,this._typeConfig=config}return GraphQLObjectType.prototype.getFields=function(){return this._fields||(this._fields=defineFieldMap(this,this._typeConfig.fields))},GraphQLObjectType.prototype.getInterfaces=function(){return this._interfaces||(this._interfaces=defineInterfaces(this,this._typeConfig.interfaces))},GraphQLObjectType.prototype.toString=function(){return this.name},GraphQLObjectType}();GraphQLObjectType.prototype.toJSON=GraphQLObjectType.prototype.inspect=GraphQLObjectType.prototype.toString;var GraphQLInterfaceType=exports.GraphQLInterfaceType=function(){function GraphQLInterfaceType(config){_classCallCheck(this,GraphQLInterfaceType),(0,_assertValidName.assertValidName)(config.name),this.name=config.name,this.description=config.description,config.resolveType&&(0,_invariant2.default)("function"==typeof config.resolveType,this.name+' must provide "resolveType" as a function.'),this.resolveType=config.resolveType,this._typeConfig=config}return GraphQLInterfaceType.prototype.getFields=function(){return this._fields||(this._fields=defineFieldMap(this,this._typeConfig.fields))},GraphQLInterfaceType.prototype.toString=function(){return this.name},GraphQLInterfaceType}();GraphQLInterfaceType.prototype.toJSON=GraphQLInterfaceType.prototype.inspect=GraphQLInterfaceType.prototype.toString;var GraphQLUnionType=exports.GraphQLUnionType=function(){function GraphQLUnionType(config){_classCallCheck(this,GraphQLUnionType),(0,_assertValidName.assertValidName)(config.name),this.name=config.name,this.description=config.description,config.resolveType&&(0,_invariant2.default)("function"==typeof config.resolveType,this.name+' must provide "resolveType" as a function.'),this.resolveType=config.resolveType,this._typeConfig=config}return GraphQLUnionType.prototype.getTypes=function(){return this._types||(this._types=defineTypes(this,this._typeConfig.types))},GraphQLUnionType.prototype.toString=function(){return this.name},GraphQLUnionType}();GraphQLUnionType.prototype.toJSON=GraphQLUnionType.prototype.inspect=GraphQLUnionType.prototype.toString;var GraphQLEnumType=exports.GraphQLEnumType=function(){function GraphQLEnumType(config){_classCallCheck(this,GraphQLEnumType),this.name=config.name,(0,_assertValidName.assertValidName)(config.name,config.isIntrospection),this.description=config.description,this._values=defineEnumValues(this,config.values),this._enumConfig=config}return GraphQLEnumType.prototype.getValues=function(){return this._values},GraphQLEnumType.prototype.getValue=function(name){return this._getNameLookup()[name]},GraphQLEnumType.prototype.serialize=function(value){var enumValue=this._getValueLookup().get(value);return enumValue?enumValue.name:null},GraphQLEnumType.prototype.isValidValue=function(value){return"string"==typeof value&&void 0!==this._getNameLookup()[value]},GraphQLEnumType.prototype.parseValue=function(value){if("string"==typeof value){var enumValue=this._getNameLookup()[value];if(enumValue)return enumValue.value}},GraphQLEnumType.prototype.isValidLiteral=function(valueNode){return valueNode.kind===Kind.ENUM&&void 0!==this._getNameLookup()[valueNode.value]},GraphQLEnumType.prototype.parseLiteral=function(valueNode){if(valueNode.kind===Kind.ENUM){var enumValue=this._getNameLookup()[valueNode.value];if(enumValue)return enumValue.value}},GraphQLEnumType.prototype._getValueLookup=function(){if(!this._valueLookup){var lookup=new Map;this.getValues().forEach(function(value){lookup.set(value.value,value)}),this._valueLookup=lookup}return this._valueLookup},GraphQLEnumType.prototype._getNameLookup=function(){if(!this._nameLookup){var lookup=Object.create(null);this.getValues().forEach(function(value){lookup[value.name]=value}),this._nameLookup=lookup}return this._nameLookup},GraphQLEnumType.prototype.toString=function(){return this.name},GraphQLEnumType}();GraphQLEnumType.prototype.toJSON=GraphQLEnumType.prototype.inspect=GraphQLEnumType.prototype.toString;var GraphQLInputObjectType=exports.GraphQLInputObjectType=function(){function GraphQLInputObjectType(config){_classCallCheck(this,GraphQLInputObjectType),(0,_assertValidName.assertValidName)(config.name),this.name=config.name,this.description=config.description,this._typeConfig=config}return GraphQLInputObjectType.prototype.getFields=function(){return this._fields||(this._fields=this._defineFieldMap())},GraphQLInputObjectType.prototype._defineFieldMap=function(){var _this=this,fieldMap=resolveThunk(this._typeConfig.fields);(0,_invariant2.default)(isPlainObj(fieldMap),this.name+" fields must be an object with field names as keys or a function which returns such an object.");var fieldNames=Object.keys(fieldMap);(0,_invariant2.default)(fieldNames.length>0,this.name+" fields must be an object with field names as keys or a function which returns such an object.");var resultFieldMap=Object.create(null);return fieldNames.forEach(function(fieldName){(0,_assertValidName.assertValidName)(fieldName);var field=_extends({},fieldMap[fieldName],{name:fieldName});(0,_invariant2.default)(isInputType(field.type),_this.name+"."+fieldName+" field type must be Input Type but got: "+String(field.type)+"."),(0,_invariant2.default)(null==field.resolve,_this.name+"."+fieldName+" field type has a resolve property, but Input Types cannot define resolvers."),resultFieldMap[fieldName]=field}),resultFieldMap},GraphQLInputObjectType.prototype.toString=function(){return this.name},GraphQLInputObjectType}();GraphQLInputObjectType.prototype.toJSON=GraphQLInputObjectType.prototype.inspect=GraphQLInputObjectType.prototype.toString;var GraphQLList=exports.GraphQLList=function(){function GraphQLList(type){_classCallCheck(this,GraphQLList),(0,_invariant2.default)(isType(type),"Can only create List of a GraphQLType but got: "+String(type)+"."),this.ofType=type}return GraphQLList.prototype.toString=function(){return"["+String(this.ofType)+"]"},GraphQLList}();GraphQLList.prototype.toJSON=GraphQLList.prototype.inspect=GraphQLList.prototype.toString;var GraphQLNonNull=exports.GraphQLNonNull=function(){function GraphQLNonNull(type){_classCallCheck(this,GraphQLNonNull),(0,_invariant2.default)(isType(type)&&!(type instanceof GraphQLNonNull),"Can only create NonNull of a Nullable GraphQLType but got: "+String(type)+"."),this.ofType=type}return GraphQLNonNull.prototype.toString=function(){return this.ofType.toString()+"!"},GraphQLNonNull}();GraphQLNonNull.prototype.toJSON=GraphQLNonNull.prototype.inspect=GraphQLNonNull.prototype.toString},{"../jsutils/invariant":97,"../jsutils/isNullish":99,"../language/kinds":105,"../utilities/assertValidName":122}],116:[function(require,module,exports){"use strict";function _classCallCheck(instance,Constructor){if(!(instance instanceof Constructor))throw new TypeError("Cannot call a class as a function")}Object.defineProperty(exports,"__esModule",{value:!0}),exports.specifiedDirectives=exports.GraphQLDeprecatedDirective=exports.DEFAULT_DEPRECATION_REASON=exports.GraphQLSkipDirective=exports.GraphQLIncludeDirective=exports.GraphQLDirective=exports.DirectiveLocation=void 0;var _definition=require("./definition"),_scalars=require("./scalars"),_invariant2=function(obj){return obj&&obj.__esModule?obj:{default:obj}}(require("../jsutils/invariant")),_assertValidName=require("../utilities/assertValidName"),DirectiveLocation=exports.DirectiveLocation={QUERY:"QUERY",MUTATION:"MUTATION",SUBSCRIPTION:"SUBSCRIPTION",FIELD:"FIELD",FRAGMENT_DEFINITION:"FRAGMENT_DEFINITION",FRAGMENT_SPREAD:"FRAGMENT_SPREAD",INLINE_FRAGMENT:"INLINE_FRAGMENT",SCHEMA:"SCHEMA",SCALAR:"SCALAR",OBJECT:"OBJECT",FIELD_DEFINITION:"FIELD_DEFINITION",ARGUMENT_DEFINITION:"ARGUMENT_DEFINITION",INTERFACE:"INTERFACE",UNION:"UNION",ENUM:"ENUM",ENUM_VALUE:"ENUM_VALUE",INPUT_OBJECT:"INPUT_OBJECT",INPUT_FIELD_DEFINITION:"INPUT_FIELD_DEFINITION"},GraphQLDirective=exports.GraphQLDirective=function GraphQLDirective(config){_classCallCheck(this,GraphQLDirective),(0,_invariant2.default)(config.name,"Directive must be named."),(0,_assertValidName.assertValidName)(config.name),(0,_invariant2.default)(Array.isArray(config.locations),"Must provide locations for directive."),this.name=config.name,this.description=config.description,this.locations=config.locations;var args=config.args;args?((0,_invariant2.default)(!Array.isArray(args),"@"+config.name+" args must be an object with argument names as keys."),this.args=Object.keys(args).map(function(argName){(0,_assertValidName.assertValidName)(argName);var arg=args[argName];return(0,_invariant2.default)((0,_definition.isInputType)(arg.type),"@"+config.name+"("+argName+":) argument type must be Input Type but got: "+String(arg.type)+"."),{name:argName,description:void 0===arg.description?null:arg.description,type:arg.type,defaultValue:arg.defaultValue}})):this.args=[]},GraphQLIncludeDirective=exports.GraphQLIncludeDirective=new GraphQLDirective({name:"include",description:"Directs the executor to include this field or fragment only when the `if` argument is true.",locations:[DirectiveLocation.FIELD,DirectiveLocation.FRAGMENT_SPREAD,DirectiveLocation.INLINE_FRAGMENT],args:{if:{type:new _definition.GraphQLNonNull(_scalars.GraphQLBoolean),description:"Included when true."}}}),GraphQLSkipDirective=exports.GraphQLSkipDirective=new GraphQLDirective({name:"skip",description:"Directs the executor to skip this field or fragment when the `if` argument is true.",locations:[DirectiveLocation.FIELD,DirectiveLocation.FRAGMENT_SPREAD,DirectiveLocation.INLINE_FRAGMENT],args:{if:{type:new _definition.GraphQLNonNull(_scalars.GraphQLBoolean),description:"Skipped when true."}}}),DEFAULT_DEPRECATION_REASON=exports.DEFAULT_DEPRECATION_REASON="No longer supported",GraphQLDeprecatedDirective=exports.GraphQLDeprecatedDirective=new GraphQLDirective({name:"deprecated",description:"Marks an element of a GraphQL schema as no longer supported.",locations:[DirectiveLocation.FIELD_DEFINITION,DirectiveLocation.ENUM_VALUE],args:{reason:{type:_scalars.GraphQLString,description:"Explains why this element was deprecated, usually also including a suggestion for how to access supported similar data. Formatted in [Markdown](https://daringfireball.net/projects/markdown/).",defaultValue:DEFAULT_DEPRECATION_REASON}}});exports.specifiedDirectives=[GraphQLIncludeDirective,GraphQLSkipDirective,GraphQLDeprecatedDirective]},{"../jsutils/invariant":97,"../utilities/assertValidName":122,"./definition":115,"./scalars":119}],117:[function(require,module,exports){"use strict";Object.defineProperty(exports,"__esModule",{value:!0});var _schema=require("./schema");Object.defineProperty(exports,"GraphQLSchema",{enumerable:!0,get:function(){return _schema.GraphQLSchema}});var _definition=require("./definition");Object.defineProperty(exports,"isType",{enumerable:!0,get:function(){return _definition.isType}}),Object.defineProperty(exports,"isInputType",{enumerable:!0,get:function(){return _definition.isInputType}}),Object.defineProperty(exports,"isOutputType",{enumerable:!0,get:function(){return _definition.isOutputType}}),Object.defineProperty(exports,"isLeafType",{enumerable:!0,get:function(){return _definition.isLeafType}}),Object.defineProperty(exports,"isCompositeType",{enumerable:!0,get:function(){return _definition.isCompositeType}}),Object.defineProperty(exports,"isAbstractType",{enumerable:!0,get:function(){return _definition.isAbstractType}}),Object.defineProperty(exports,"isNamedType",{enumerable:!0,get:function(){return _definition.isNamedType}}),Object.defineProperty(exports,"assertType",{enumerable:!0,get:function(){return _definition.assertType}}),Object.defineProperty(exports,"assertInputType",{enumerable:!0,get:function(){return _definition.assertInputType}}),Object.defineProperty(exports,"assertOutputType",{enumerable:!0,get:function(){return _definition.assertOutputType}}),Object.defineProperty(exports,"assertLeafType",{enumerable:!0,get:function(){return _definition.assertLeafType}}),Object.defineProperty(exports,"assertCompositeType",{enumerable:!0,get:function(){return _definition.assertCompositeType}}),Object.defineProperty(exports,"assertAbstractType",{enumerable:!0,get:function(){return _definition.assertAbstractType}}),Object.defineProperty(exports,"assertNamedType",{enumerable:!0,get:function(){return _definition.assertNamedType}}),Object.defineProperty(exports,"getNullableType",{enumerable:!0,get:function(){return _definition.getNullableType}}),Object.defineProperty(exports,"getNamedType",{enumerable:!0,get:function(){return _definition.getNamedType}}),Object.defineProperty(exports,"GraphQLScalarType",{enumerable:!0,get:function(){return _definition.GraphQLScalarType}}),Object.defineProperty(exports,"GraphQLObjectType",{enumerable:!0,get:function(){return _definition.GraphQLObjectType}}),Object.defineProperty(exports,"GraphQLInterfaceType",{enumerable:!0,get:function(){return _definition.GraphQLInterfaceType}}),Object.defineProperty(exports,"GraphQLUnionType",{enumerable:!0,get:function(){return _definition.GraphQLUnionType}}),Object.defineProperty(exports,"GraphQLEnumType",{enumerable:!0,get:function(){return _definition.GraphQLEnumType}}),Object.defineProperty(exports,"GraphQLInputObjectType",{enumerable:!0,get:function(){return _definition.GraphQLInputObjectType}}),Object.defineProperty(exports,"GraphQLList",{enumerable:!0,get:function(){return _definition.GraphQLList}}),Object.defineProperty(exports,"GraphQLNonNull",{enumerable:!0,get:function(){return _definition.GraphQLNonNull}});var _directives=require("./directives");Object.defineProperty(exports,"DirectiveLocation",{enumerable:!0,get:function(){return _directives.DirectiveLocation}}),Object.defineProperty(exports,"GraphQLDirective",{enumerable:!0,get:function(){return _directives.GraphQLDirective}}),Object.defineProperty(exports,"specifiedDirectives",{enumerable:!0,get:function(){return _directives.specifiedDirectives}}),Object.defineProperty(exports,"GraphQLIncludeDirective",{enumerable:!0,get:function(){return _directives.GraphQLIncludeDirective}}),Object.defineProperty(exports,"GraphQLSkipDirective",{enumerable:!0,get:function(){return _directives.GraphQLSkipDirective}}),Object.defineProperty(exports,"GraphQLDeprecatedDirective",{enumerable:!0,get:function(){return _directives.GraphQLDeprecatedDirective}}),Object.defineProperty(exports,"DEFAULT_DEPRECATION_REASON",{enumerable:!0,get:function(){return _directives.DEFAULT_DEPRECATION_REASON}});var _scalars=require("./scalars");Object.defineProperty(exports,"GraphQLInt",{enumerable:!0,get:function(){return _scalars.GraphQLInt}}),Object.defineProperty(exports,"GraphQLFloat",{enumerable:!0,get:function(){return _scalars.GraphQLFloat}}),Object.defineProperty(exports,"GraphQLString",{enumerable:!0,get:function(){return _scalars.GraphQLString}}),Object.defineProperty(exports,"GraphQLBoolean",{enumerable:!0,get:function(){return _scalars.GraphQLBoolean}}),Object.defineProperty(exports,"GraphQLID",{enumerable:!0,get:function(){return _scalars.GraphQLID}});var _introspection=require("./introspection");Object.defineProperty(exports,"TypeKind",{enumerable:!0,get:function(){return _introspection.TypeKind}}),Object.defineProperty(exports,"__Schema",{enumerable:!0,get:function(){return _introspection.__Schema}}),Object.defineProperty(exports,"__Directive",{enumerable:!0,get:function(){return _introspection.__Directive}}),Object.defineProperty(exports,"__DirectiveLocation",{enumerable:!0,get:function(){return _introspection.__DirectiveLocation}}),Object.defineProperty(exports,"__Type",{enumerable:!0,get:function(){return _introspection.__Type}}),Object.defineProperty(exports,"__Field",{enumerable:!0,get:function(){return _introspection.__Field}}),Object.defineProperty(exports,"__InputValue",{enumerable:!0,get:function(){return _introspection.__InputValue}}),Object.defineProperty(exports,"__EnumValue",{enumerable:!0,get:function(){return _introspection.__EnumValue}}),Object.defineProperty(exports,"__TypeKind",{enumerable:!0,get:function(){return _introspection.__TypeKind}}),Object.defineProperty(exports,"SchemaMetaFieldDef",{enumerable:!0,get:function(){return _introspection.SchemaMetaFieldDef}}),Object.defineProperty(exports,"TypeMetaFieldDef",{enumerable:!0,get:function(){return _introspection.TypeMetaFieldDef}}),Object.defineProperty(exports,"TypeNameMetaFieldDef",{enumerable:!0,get:function(){return _introspection.TypeNameMetaFieldDef}})},{"./definition":115,"./directives":116,"./introspection":118,"./scalars":119,"./schema":120}],118:[function(require,module,exports){"use strict";Object.defineProperty(exports,"__esModule",{value:!0}),exports.TypeNameMetaFieldDef=exports.TypeMetaFieldDef=exports.SchemaMetaFieldDef=exports.__TypeKind=exports.TypeKind=exports.__EnumValue=exports.__InputValue=exports.__Field=exports.__Type=exports.__DirectiveLocation=exports.__Directive=exports.__Schema=void 0;var _isInvalid2=function(obj){return obj&&obj.__esModule?obj:{default:obj}}(require("../jsutils/isInvalid")),_astFromValue=require("../utilities/astFromValue"),_printer=require("../language/printer"),_definition=require("./definition"),_scalars=require("./scalars"),_directives=require("./directives"),__Schema=exports.__Schema=new _definition.GraphQLObjectType({name:"__Schema",isIntrospection:!0,description:"A GraphQL Schema defines the capabilities of a GraphQL server. It exposes all available types and directives on the server, as well as the entry points for query, mutation, and subscription operations.",fields:function(){return{types:{description:"A list of all types supported by this server.",type:new _definition.GraphQLNonNull(new _definition.GraphQLList(new _definition.GraphQLNonNull(__Type))),resolve:function(schema){var typeMap=schema.getTypeMap();return Object.keys(typeMap).map(function(key){return typeMap[key]})}},queryType:{description:"The type that query operations will be rooted at.",type:new _definition.GraphQLNonNull(__Type),resolve:function(schema){return schema.getQueryType()}},mutationType:{description:"If this server supports mutation, the type that mutation operations will be rooted at.",type:__Type,resolve:function(schema){return schema.getMutationType()}},subscriptionType:{description:"If this server support subscription, the type that subscription operations will be rooted at.",type:__Type,resolve:function(schema){return schema.getSubscriptionType()}},directives:{description:"A list of all directives supported by this server.",type:new _definition.GraphQLNonNull(new _definition.GraphQLList(new _definition.GraphQLNonNull(__Directive))),resolve:function(schema){return schema.getDirectives()}}}}}),__Directive=exports.__Directive=new _definition.GraphQLObjectType({name:"__Directive",isIntrospection:!0,description:"A Directive provides a way to describe alternate runtime execution and type validation behavior in a GraphQL document.\n\nIn some cases, you need to provide options to alter GraphQL's execution behavior in ways field arguments will not suffice, such as conditionally including or skipping a field. Directives provide this by describing additional information to the executor.",fields:function(){return{name:{type:new _definition.GraphQLNonNull(_scalars.GraphQLString)},description:{type:_scalars.GraphQLString},locations:{type:new _definition.GraphQLNonNull(new _definition.GraphQLList(new _definition.GraphQLNonNull(__DirectiveLocation)))},args:{type:new _definition.GraphQLNonNull(new _definition.GraphQLList(new _definition.GraphQLNonNull(__InputValue))),resolve:function(directive){return directive.args||[]}},onOperation:{deprecationReason:"Use `locations`.",type:new _definition.GraphQLNonNull(_scalars.GraphQLBoolean),resolve:function(d){return-1!==d.locations.indexOf(_directives.DirectiveLocation.QUERY)||-1!==d.locations.indexOf(_directives.DirectiveLocation.MUTATION)||-1!==d.locations.indexOf(_directives.DirectiveLocation.SUBSCRIPTION)}},onFragment:{deprecationReason:"Use `locations`.",type:new _definition.GraphQLNonNull(_scalars.GraphQLBoolean),resolve:function(d){return-1!==d.locations.indexOf(_directives.DirectiveLocation.FRAGMENT_SPREAD)||-1!==d.locations.indexOf(_directives.DirectiveLocation.INLINE_FRAGMENT)||-1!==d.locations.indexOf(_directives.DirectiveLocation.FRAGMENT_DEFINITION)}},onField:{deprecationReason:"Use `locations`.",type:new _definition.GraphQLNonNull(_scalars.GraphQLBoolean),resolve:function(d){return-1!==d.locations.indexOf(_directives.DirectiveLocation.FIELD)}}}}}),__DirectiveLocation=exports.__DirectiveLocation=new _definition.GraphQLEnumType({name:"__DirectiveLocation",isIntrospection:!0,description:"A Directive can be adjacent to many parts of the GraphQL language, a __DirectiveLocation describes one such possible adjacencies.",values:{QUERY:{value:_directives.DirectiveLocation.QUERY,description:"Location adjacent to a query operation."},MUTATION:{value:_directives.DirectiveLocation.MUTATION,description:"Location adjacent to a mutation operation."},SUBSCRIPTION:{value:_directives.DirectiveLocation.SUBSCRIPTION,description:"Location adjacent to a subscription operation."},FIELD:{value:_directives.DirectiveLocation.FIELD,description:"Location adjacent to a field."},FRAGMENT_DEFINITION:{value:_directives.DirectiveLocation.FRAGMENT_DEFINITION,description:"Location adjacent to a fragment definition."},FRAGMENT_SPREAD:{value:_directives.DirectiveLocation.FRAGMENT_SPREAD,description:"Location adjacent to a fragment spread."},INLINE_FRAGMENT:{value:_directives.DirectiveLocation.INLINE_FRAGMENT,description:"Location adjacent to an inline fragment."},SCHEMA:{value:_directives.DirectiveLocation.SCHEMA,description:"Location adjacent to a schema definition."},SCALAR:{value:_directives.DirectiveLocation.SCALAR,description:"Location adjacent to a scalar definition."},OBJECT:{value:_directives.DirectiveLocation.OBJECT,description:"Location adjacent to an object type definition."},FIELD_DEFINITION:{value:_directives.DirectiveLocation.FIELD_DEFINITION,description:"Location adjacent to a field definition."},ARGUMENT_DEFINITION:{value:_directives.DirectiveLocation.ARGUMENT_DEFINITION,description:"Location adjacent to an argument definition."},INTERFACE:{value:_directives.DirectiveLocation.INTERFACE,description:"Location adjacent to an interface definition."},UNION:{value:_directives.DirectiveLocation.UNION,description:"Location adjacent to a union definition."},ENUM:{value:_directives.DirectiveLocation.ENUM,description:"Location adjacent to an enum definition."},ENUM_VALUE:{value:_directives.DirectiveLocation.ENUM_VALUE,description:"Location adjacent to an enum value definition."},INPUT_OBJECT:{value:_directives.DirectiveLocation.INPUT_OBJECT,description:"Location adjacent to an input object type definition."},INPUT_FIELD_DEFINITION:{value:_directives.DirectiveLocation.INPUT_FIELD_DEFINITION,description:"Location adjacent to an input object field definition."}}}),__Type=exports.__Type=new _definition.GraphQLObjectType({name:"__Type",isIntrospection:!0,description:"The fundamental unit of any GraphQL Schema is the type. There are many kinds of types in GraphQL as represented by the `__TypeKind` enum.\n\nDepending on the kind of a type, certain fields describe information about that type. Scalar types provide no information beyond a name and description, while Enum types provide their values. Object and Interface types provide the fields they describe. Abstract types, Union and Interface, provide the Object types possible at runtime. List and NonNull types compose other types.",fields:function(){return{kind:{type:new _definition.GraphQLNonNull(__TypeKind),resolve:function(type){if(type instanceof _definition.GraphQLScalarType)return TypeKind.SCALAR;if(type instanceof _definition.GraphQLObjectType)return TypeKind.OBJECT;if(type instanceof _definition.GraphQLInterfaceType)return TypeKind.INTERFACE;if(type instanceof _definition.GraphQLUnionType)return TypeKind.UNION;if(type instanceof _definition.GraphQLEnumType)return TypeKind.ENUM;if(type instanceof _definition.GraphQLInputObjectType)return TypeKind.INPUT_OBJECT;if(type instanceof _definition.GraphQLList)return TypeKind.LIST;if(type instanceof _definition.GraphQLNonNull)return TypeKind.NON_NULL;throw new Error("Unknown kind of type: "+type)}},name:{type:_scalars.GraphQLString},description:{type:_scalars.GraphQLString},fields:{type:new _definition.GraphQLList(new _definition.GraphQLNonNull(__Field)),args:{includeDeprecated:{type:_scalars.GraphQLBoolean,defaultValue:!1}},resolve:function(type,_ref){var includeDeprecated=_ref.includeDeprecated;if(type instanceof _definition.GraphQLObjectType||type instanceof _definition.GraphQLInterfaceType){var fieldMap=type.getFields(),fields=Object.keys(fieldMap).map(function(fieldName){return fieldMap[fieldName]});return includeDeprecated||(fields=fields.filter(function(field){return!field.deprecationReason})),fields}return null}},interfaces:{type:new _definition.GraphQLList(new _definition.GraphQLNonNull(__Type)),resolve:function(type){if(type instanceof _definition.GraphQLObjectType)return type.getInterfaces()}},possibleTypes:{type:new _definition.GraphQLList(new _definition.GraphQLNonNull(__Type)),resolve:function(type,args,context,_ref2){var schema=_ref2.schema;if((0,_definition.isAbstractType)(type))return schema.getPossibleTypes(type)}},enumValues:{type:new _definition.GraphQLList(new _definition.GraphQLNonNull(__EnumValue)),args:{includeDeprecated:{type:_scalars.GraphQLBoolean,defaultValue:!1}},resolve:function(type,_ref3){var includeDeprecated=_ref3.includeDeprecated;if(type instanceof _definition.GraphQLEnumType){var values=type.getValues();return includeDeprecated||(values=values.filter(function(value){return!value.deprecationReason})),values}}},inputFields:{type:new _definition.GraphQLList(new _definition.GraphQLNonNull(__InputValue)),resolve:function(type){if(type instanceof _definition.GraphQLInputObjectType){var fieldMap=type.getFields();return Object.keys(fieldMap).map(function(fieldName){return fieldMap[fieldName]})}}},ofType:{type:__Type}}}}),__Field=exports.__Field=new _definition.GraphQLObjectType({name:"__Field",isIntrospection:!0,description:"Object and Interface types are described by a list of Fields, each of which has a name, potentially a list of arguments, and a return type.",fields:function(){return{name:{type:new _definition.GraphQLNonNull(_scalars.GraphQLString)},description:{type:_scalars.GraphQLString},args:{type:new _definition.GraphQLNonNull(new _definition.GraphQLList(new _definition.GraphQLNonNull(__InputValue))),resolve:function(field){return field.args||[]}},type:{type:new _definition.GraphQLNonNull(__Type)},isDeprecated:{type:new _definition.GraphQLNonNull(_scalars.GraphQLBoolean)},deprecationReason:{type:_scalars.GraphQLString}}}}),__InputValue=exports.__InputValue=new _definition.GraphQLObjectType({name:"__InputValue",isIntrospection:!0,description:"Arguments provided to Fields or Directives and the input fields of an InputObject are represented as Input Values which describe their type and optionally a default value.",fields:function(){return{name:{type:new _definition.GraphQLNonNull(_scalars.GraphQLString)},description:{type:_scalars.GraphQLString},type:{type:new _definition.GraphQLNonNull(__Type)},defaultValue:{type:_scalars.GraphQLString,description:"A GraphQL-formatted string representing the default value for this input value.",resolve:function(inputVal){return(0,_isInvalid2.default)(inputVal.defaultValue)?null:(0,_printer.print)((0,_astFromValue.astFromValue)(inputVal.defaultValue,inputVal.type))}}}}}),__EnumValue=exports.__EnumValue=new _definition.GraphQLObjectType({name:"__EnumValue",isIntrospection:!0,description:"One possible value for a given Enum. Enum values are unique values, not a placeholder for a string or numeric value. However an Enum value is returned in a JSON response as a string.",fields:function(){return{name:{type:new _definition.GraphQLNonNull(_scalars.GraphQLString)},description:{type:_scalars.GraphQLString},isDeprecated:{type:new _definition.GraphQLNonNull(_scalars.GraphQLBoolean)},deprecationReason:{type:_scalars.GraphQLString}}}}),TypeKind=exports.TypeKind={SCALAR:"SCALAR",OBJECT:"OBJECT",INTERFACE:"INTERFACE",UNION:"UNION",ENUM:"ENUM",INPUT_OBJECT:"INPUT_OBJECT",LIST:"LIST",NON_NULL:"NON_NULL"},__TypeKind=exports.__TypeKind=new _definition.GraphQLEnumType({name:"__TypeKind",isIntrospection:!0,description:"An enum describing what kind of type a given `__Type` is.",values:{SCALAR:{value:TypeKind.SCALAR,description:"Indicates this type is a scalar."},OBJECT:{value:TypeKind.OBJECT,description:"Indicates this type is an object. `fields` and `interfaces` are valid fields."},INTERFACE:{value:TypeKind.INTERFACE,description:"Indicates this type is an interface. `fields` and `possibleTypes` are valid fields."},UNION:{value:TypeKind.UNION,description:"Indicates this type is a union. `possibleTypes` is a valid field."},ENUM:{value:TypeKind.ENUM,description:"Indicates this type is an enum. `enumValues` is a valid field."},INPUT_OBJECT:{value:TypeKind.INPUT_OBJECT,description:"Indicates this type is an input object. `inputFields` is a valid field."},LIST:{value:TypeKind.LIST,description:"Indicates this type is a list. `ofType` is a valid field."},NON_NULL:{value:TypeKind.NON_NULL,description:"Indicates this type is a non-null. `ofType` is a valid field."}}});exports.SchemaMetaFieldDef={name:"__schema",type:new _definition.GraphQLNonNull(__Schema),description:"Access the current type schema of this server.",args:[],resolve:function(source,args,context,_ref4){return _ref4.schema}},exports.TypeMetaFieldDef={name:"__type",type:__Type,description:"Request the type information of a single type.",args:[{name:"name",type:new _definition.GraphQLNonNull(_scalars.GraphQLString)}],resolve:function(source,_ref5,context,_ref6){var name=_ref5.name;return _ref6.schema.getType(name)}},exports.TypeNameMetaFieldDef={name:"__typename",type:new _definition.GraphQLNonNull(_scalars.GraphQLString),description:"The name of the current Object type at runtime.",args:[],resolve:function(source,args,context,_ref7){return _ref7.parentType.name}}},{"../jsutils/isInvalid":98,"../language/printer":109,"../utilities/astFromValue":123,"./definition":115,"./directives":116,"./scalars":119}],119:[function(require,module,exports){"use strict";function coerceInt(value){if(""===value)throw new TypeError("Int cannot represent non 32-bit signed integer value: (empty string)");var num=Number(value);if(num!==num||num>MAX_INT||num<MIN_INT)throw new TypeError("Int cannot represent non 32-bit signed integer value: "+String(value));var int=Math.floor(num);if(int!==num)throw new TypeError("Int cannot represent non-integer value: "+String(value));return int}function coerceFloat(value){if(""===value)throw new TypeError("Float cannot represent non numeric value: (empty string)");var num=Number(value);if(num===num)return num;throw new TypeError("Float cannot represent non numeric value: "+String(value))}Object.defineProperty(exports,"__esModule",{value:!0}),exports.GraphQLID=exports.GraphQLBoolean=exports.GraphQLString=exports.GraphQLFloat=exports.GraphQLInt=void 0;var _definition=require("./definition"),Kind=function(obj){if(obj&&obj.__esModule)return obj;var newObj={};if(null!=obj)for(var key in obj)Object.prototype.hasOwnProperty.call(obj,key)&&(newObj[key]=obj[key]);return newObj.default=obj,newObj}(require("../language/kinds")),MAX_INT=2147483647,MIN_INT=-2147483648;exports.GraphQLInt=new _definition.GraphQLScalarType({name:"Int",description:"The `Int` scalar type represents non-fractional signed whole numeric values. Int can represent values between -(2^31) and 2^31 - 1. ",serialize:coerceInt,parseValue:coerceInt,parseLiteral:function(ast){if(ast.kind===Kind.INT){var num=parseInt(ast.value,10);if(num<=MAX_INT&&num>=MIN_INT)return num}return null}}),exports.GraphQLFloat=new _definition.GraphQLScalarType({name:"Float",description:"The `Float` scalar type represents signed double-precision fractional values as specified by [IEEE 754](http://en.wikipedia.org/wiki/IEEE_floating_point). ",serialize:coerceFloat,parseValue:coerceFloat,parseLiteral:function(ast){return ast.kind===Kind.FLOAT||ast.kind===Kind.INT?parseFloat(ast.value):null}}),exports.GraphQLString=new _definition.GraphQLScalarType({name:"String",description:"The `String` scalar type represents textual data, represented as UTF-8 character sequences. The String type is most often used by GraphQL to represent free-form human-readable text.",serialize:String,parseValue:String,parseLiteral:function(ast){return ast.kind===Kind.STRING?ast.value:null}}),exports.GraphQLBoolean=new _definition.GraphQLScalarType({name:"Boolean",description:"The `Boolean` scalar type represents `true` or `false`.",serialize:Boolean,parseValue:Boolean,parseLiteral:function(ast){return ast.kind===Kind.BOOLEAN?ast.value:null}}),exports.GraphQLID=new _definition.GraphQLScalarType({name:"ID",description:'The `ID` scalar type represents a unique identifier, often used to refetch an object or as key for a cache. The ID type appears in a JSON response as a String; however, it is not intended to be human-readable. When expected as an input type, any string (such as `"4"`) or integer (such as `4`) input value will be accepted as an ID.',serialize:String,parseValue:String,parseLiteral:function(ast){return ast.kind===Kind.STRING||ast.kind===Kind.INT?ast.value:null}})},{"../language/kinds":105,"./definition":115}],120:[function(require,module,exports){"use strict";function _interopRequireDefault(obj){return obj&&obj.__esModule?obj:{default:obj}}function _classCallCheck(instance,Constructor){if(!(instance instanceof Constructor))throw new TypeError("Cannot call a class as a function")}function typeMapReducer(map,type){if(!type)return map;if(type instanceof _definition.GraphQLList||type instanceof _definition.GraphQLNonNull)return typeMapReducer(map,type.ofType);if(map[type.name])return(0,_invariant2.default)(map[type.name]===type,'Schema must contain unique named types but contains multiple types named "'+type.name+'".'),map;map[type.name]=type;var reducedMap=map;if(type instanceof _definition.GraphQLUnionType&&(reducedMap=type.getTypes().reduce(typeMapReducer,reducedMap)),type instanceof _definition.GraphQLObjectType&&(reducedMap=type.getInterfaces().reduce(typeMapReducer,reducedMap)),type instanceof _definition.GraphQLObjectType||type instanceof _definition.GraphQLInterfaceType){var fieldMap=type.getFields();Object.keys(fieldMap).forEach(function(fieldName){var field=fieldMap[fieldName];if(field.args){var fieldArgTypes=field.args.map(function(arg){return arg.type});reducedMap=fieldArgTypes.reduce(typeMapReducer,reducedMap)}reducedMap=typeMapReducer(reducedMap,field.type)})}if(type instanceof _definition.GraphQLInputObjectType){var _fieldMap=type.getFields();Object.keys(_fieldMap).forEach(function(fieldName){var field=_fieldMap[fieldName];reducedMap=typeMapReducer(reducedMap,field.type)})}return reducedMap}function assertObjectImplementsInterface(schema,object,iface){var objectFieldMap=object.getFields(),ifaceFieldMap=iface.getFields();Object.keys(ifaceFieldMap).forEach(function(fieldName){var objectField=objectFieldMap[fieldName],ifaceField=ifaceFieldMap[fieldName];(0,_invariant2.default)(objectField,'"'+iface.name+'" expects field "'+fieldName+'" but "'+object.name+'" does not provide it.'),(0,_invariant2.default)((0,_typeComparators.isTypeSubTypeOf)(schema,objectField.type,ifaceField.type),iface.name+"."+fieldName+' expects type "'+String(ifaceField.type)+'" but '+object.name+"."+fieldName+' provides type "'+String(objectField.type)+'".'),ifaceField.args.forEach(function(ifaceArg){var argName=ifaceArg.name,objectArg=(0,_find2.default)(objectField.args,function(arg){return arg.name===argName});(0,_invariant2.default)(objectArg,iface.name+"."+fieldName+' expects argument "'+argName+'" but '+object.name+"."+fieldName+" does not provide it."),(0,_invariant2.default)((0,_typeComparators.isEqualType)(ifaceArg.type,objectArg.type),iface.name+"."+fieldName+"("+argName+':) expects type "'+String(ifaceArg.type)+'" but '+object.name+"."+fieldName+"("+argName+':) provides type "'+String(objectArg.type)+'".')}),objectField.args.forEach(function(objectArg){var argName=objectArg.name;(0,_find2.default)(ifaceField.args,function(arg){return arg.name===argName})||(0,_invariant2.default)(!(objectArg.type instanceof _definition.GraphQLNonNull),object.name+"."+fieldName+"("+argName+':) is of required type "'+String(objectArg.type)+'" but is not also provided by the interface '+iface.name+"."+fieldName+".")})})}Object.defineProperty(exports,"__esModule",{value:!0}),exports.GraphQLSchema=void 0;var _definition=require("./definition"),_directives=require("./directives"),_introspection=require("./introspection"),_find2=_interopRequireDefault(require("../jsutils/find")),_invariant2=_interopRequireDefault(require("../jsutils/invariant")),_typeComparators=require("../utilities/typeComparators");exports.GraphQLSchema=function(){function GraphQLSchema(config){var _this=this;_classCallCheck(this,GraphQLSchema),(0,_invariant2.default)("object"==typeof config,"Must provide configuration object."),(0,_invariant2.default)(config.query instanceof _definition.GraphQLObjectType,"Schema query must be Object Type but got: "+String(config.query)+"."),this._queryType=config.query,(0,_invariant2.default)(!config.mutation||config.mutation instanceof _definition.GraphQLObjectType,"Schema mutation must be Object Type if provided but got: "+String(config.mutation)+"."),this._mutationType=config.mutation,(0,_invariant2.default)(!config.subscription||config.subscription instanceof _definition.GraphQLObjectType,"Schema subscription must be Object Type if provided but got: "+String(config.subscription)+"."),this._subscriptionType=config.subscription,(0,_invariant2.default)(!config.types||Array.isArray(config.types),"Schema types must be Array if provided but got: "+String(config.types)+"."),(0,_invariant2.default)(!config.directives||Array.isArray(config.directives)&&config.directives.every(function(directive){return directive instanceof _directives.GraphQLDirective}),"Schema directives must be Array<GraphQLDirective> if provided but got: "+String(config.directives)+"."),this._directives=config.directives||_directives.specifiedDirectives;var initialTypes=[this.getQueryType(),this.getMutationType(),this.getSubscriptionType(),_introspection.__Schema],types=config.types;types&&(initialTypes=initialTypes.concat(types)),this._typeMap=initialTypes.reduce(typeMapReducer,Object.create(null)),this._implementations=Object.create(null),Object.keys(this._typeMap).forEach(function(typeName){var type=_this._typeMap[typeName];type instanceof _definition.GraphQLObjectType&&type.getInterfaces().forEach(function(iface){var impls=_this._implementations[iface.name];impls?impls.push(type):_this._implementations[iface.name]=[type]})}),Object.keys(this._typeMap).forEach(function(typeName){var type=_this._typeMap[typeName];type instanceof _definition.GraphQLObjectType&&type.getInterfaces().forEach(function(iface){return assertObjectImplementsInterface(_this,type,iface)})})}return GraphQLSchema.prototype.getQueryType=function(){return this._queryType},GraphQLSchema.prototype.getMutationType=function(){return this._mutationType},GraphQLSchema.prototype.getSubscriptionType=function(){return this._subscriptionType},GraphQLSchema.prototype.getTypeMap=function(){return this._typeMap},GraphQLSchema.prototype.getType=function(name){return this.getTypeMap()[name]},GraphQLSchema.prototype.getPossibleTypes=function(abstractType){return abstractType instanceof _definition.GraphQLUnionType?abstractType.getTypes():((0,_invariant2.default)(abstractType instanceof _definition.GraphQLInterfaceType),this._implementations[abstractType.name])},GraphQLSchema.prototype.isPossibleType=function(abstractType,possibleType){var possibleTypeMap=this._possibleTypeMap;if(possibleTypeMap||(this._possibleTypeMap=possibleTypeMap=Object.create(null)),!possibleTypeMap[abstractType.name]){var possibleTypes=this.getPossibleTypes(abstractType);(0,_invariant2.default)(Array.isArray(possibleTypes),"Could not find possible implementing types for "+abstractType.name+" in schema. Check that schema.types is defined and is an array of all possible types in the schema."),possibleTypeMap[abstractType.name]=possibleTypes.reduce(function(map,type){return map[type.name]=!0,map},Object.create(null))}return Boolean(possibleTypeMap[abstractType.name][possibleType.name])},GraphQLSchema.prototype.getDirectives=function(){return this._directives},GraphQLSchema.prototype.getDirective=function(name){return(0,_find2.default)(this.getDirectives(),function(directive){return directive.name===name})},GraphQLSchema}()},{"../jsutils/find":96,"../jsutils/invariant":97,"../utilities/typeComparators":137,"./definition":115,"./directives":116,"./introspection":118}],121:[function(require,module,exports){"use strict";function _classCallCheck(instance,Constructor){if(!(instance instanceof Constructor))throw new TypeError("Cannot call a class as a function")}function getFieldDef(schema,parentType,fieldNode){var name=fieldNode.name.value;return name===_introspection.SchemaMetaFieldDef.name&&schema.getQueryType()===parentType?_introspection.SchemaMetaFieldDef:name===_introspection.TypeMetaFieldDef.name&&schema.getQueryType()===parentType?_introspection.TypeMetaFieldDef:name===_introspection.TypeNameMetaFieldDef.name&&(0,_definition.isCompositeType)(parentType)?_introspection.TypeNameMetaFieldDef:parentType instanceof _definition.GraphQLObjectType||parentType instanceof _definition.GraphQLInterfaceType?parentType.getFields()[name]:void 0}Object.defineProperty(exports,"__esModule",{value:!0}),exports.TypeInfo=void 0;var Kind=function(obj){if(obj&&obj.__esModule)return obj;var newObj={};if(null!=obj)for(var key in obj)Object.prototype.hasOwnProperty.call(obj,key)&&(newObj[key]=obj[key]);return newObj.default=obj,newObj}(require("../language/kinds")),_definition=require("../type/definition"),_introspection=require("../type/introspection"),_typeFromAST=require("./typeFromAST"),_find2=function(obj){return obj&&obj.__esModule?obj:{default:obj}}(require("../jsutils/find"));exports.TypeInfo=function(){function TypeInfo(schema,getFieldDefFn){_classCallCheck(this,TypeInfo),this._schema=schema,this._typeStack=[],this._parentTypeStack=[],this._inputTypeStack=[],this._fieldDefStack=[],this._directive=null,this._argument=null,this._enumValue=null,this._getFieldDef=getFieldDefFn||getFieldDef}return TypeInfo.prototype.getType=function(){if(this._typeStack.length>0)return this._typeStack[this._typeStack.length-1]},TypeInfo.prototype.getParentType=function(){if(this._parentTypeStack.length>0)return this._parentTypeStack[this._parentTypeStack.length-1]},TypeInfo.prototype.getInputType=function(){if(this._inputTypeStack.length>0)return this._inputTypeStack[this._inputTypeStack.length-1]},TypeInfo.prototype.getFieldDef=function(){if(this._fieldDefStack.length>0)return this._fieldDefStack[this._fieldDefStack.length-1]},TypeInfo.prototype.getDirective=function(){return this._directive},TypeInfo.prototype.getArgument=function(){return this._argument},TypeInfo.prototype.getEnumValue=function(){return this._enumValue},TypeInfo.prototype.enter=function(node){var schema=this._schema;switch(node.kind){case Kind.SELECTION_SET:var namedType=(0,_definition.getNamedType)(this.getType());this._parentTypeStack.push((0,_definition.isCompositeType)(namedType)?namedType:void 0);break;case Kind.FIELD:var parentType=this.getParentType(),fieldDef=void 0;parentType&&(fieldDef=this._getFieldDef(schema,parentType,node)),this._fieldDefStack.push(fieldDef),this._typeStack.push(fieldDef&&fieldDef.type);break;case Kind.DIRECTIVE:this._directive=schema.getDirective(node.name.value);break;case Kind.OPERATION_DEFINITION:var type=void 0;"query"===node.operation?type=schema.getQueryType():"mutation"===node.operation?type=schema.getMutationType():"subscription"===node.operation&&(type=schema.getSubscriptionType()),this._typeStack.push(type);break;case Kind.INLINE_FRAGMENT:case Kind.FRAGMENT_DEFINITION:var typeConditionAST=node.typeCondition,outputType=typeConditionAST?(0,_typeFromAST.typeFromAST)(schema,typeConditionAST):this.getType();this._typeStack.push((0,_definition.isOutputType)(outputType)?outputType:void 0);break;case Kind.VARIABLE_DEFINITION:var inputType=(0,_typeFromAST.typeFromAST)(schema,node.type);this._inputTypeStack.push((0,_definition.isInputType)(inputType)?inputType:void 0);break;case Kind.ARGUMENT:var argDef=void 0,argType=void 0,fieldOrDirective=this.getDirective()||this.getFieldDef();fieldOrDirective&&(argDef=(0,_find2.default)(fieldOrDirective.args,function(arg){return arg.name===node.name.value}))&&(argType=argDef.type),this._argument=argDef,this._inputTypeStack.push(argType);break;case Kind.LIST:var listType=(0,_definition.getNullableType)(this.getInputType());this._inputTypeStack.push(listType instanceof _definition.GraphQLList?listType.ofType:void 0);break;case Kind.OBJECT_FIELD:var objectType=(0,_definition.getNamedType)(this.getInputType()),fieldType=void 0;if(objectType instanceof _definition.GraphQLInputObjectType){var inputField=objectType.getFields()[node.name.value];fieldType=inputField?inputField.type:void 0}this._inputTypeStack.push(fieldType);break;case Kind.ENUM:var enumType=(0,_definition.getNamedType)(this.getInputType()),enumValue=void 0;enumType instanceof _definition.GraphQLEnumType&&(enumValue=enumType.getValue(node.value)),this._enumValue=enumValue}},TypeInfo.prototype.leave=function(node){switch(node.kind){case Kind.SELECTION_SET:this._parentTypeStack.pop();break;case Kind.FIELD:this._fieldDefStack.pop(),this._typeStack.pop();break;case Kind.DIRECTIVE:this._directive=null;break;case Kind.OPERATION_DEFINITION:case Kind.INLINE_FRAGMENT:case Kind.FRAGMENT_DEFINITION:this._typeStack.pop();break;case Kind.VARIABLE_DEFINITION:this._inputTypeStack.pop();break;case Kind.ARGUMENT:this._argument=null,this._inputTypeStack.pop();break;case Kind.LIST:case Kind.OBJECT_FIELD:this._inputTypeStack.pop();break;case Kind.ENUM:this._enumValue=null}},TypeInfo}()},{"../jsutils/find":96,"../language/kinds":105,"../type/definition":115,"../type/introspection":118,"./typeFromAST":138}],122:[function(require,module,exports){(function(process){"use strict";function formatWarning(error){var formatted="",errorString=String(error).replace(ERROR_PREFIX_RX,""),stack=error.stack;return stack&&(formatted=stack.replace(ERROR_PREFIX_RX,"")),-1===formatted.indexOf(errorString)&&(formatted=errorString+"\n"+formatted),formatted.trim()}Object.defineProperty(exports,"__esModule",{value:!0}),exports.assertValidName=function(name,isIntrospection){if(!name||"string"!=typeof name)throw new Error("Must be named. Unexpected name: "+name+".");if(!isIntrospection&&!hasWarnedAboutDunder&&!noNameWarning&&"__"===name.slice(0,2)&&(hasWarnedAboutDunder=!0,console&&console.warn)){var error=new Error('Name "'+name+'" must not begin with "__", which is reserved by GraphQL introspection. In a future release of graphql this will become a hard error.');console.warn(formatWarning(error))}if(!NAME_RX.test(name))throw new Error('Names must match /^[_a-zA-Z][_a-zA-Z0-9]*$/ but "'+name+'" does not.')},exports.formatWarning=formatWarning;var NAME_RX=/^[_a-zA-Z][_a-zA-Z0-9]*$/,ERROR_PREFIX_RX=/^Error: /,noNameWarning=Boolean(process&&process.env&&process.env.GRAPHQL_NO_NAME_WARNING),hasWarnedAboutDunder=!1}).call(this,require("_process"))},{_process:229}],123:[function(require,module,exports){"use strict";function _interopRequireDefault(obj){return obj&&obj.__esModule?obj:{default:obj}}function astFromValue(value,type){var _value=value;if(type instanceof _definition.GraphQLNonNull){var astValue=astFromValue(_value,type.ofType);return astValue&&astValue.kind===Kind.NULL?null:astValue}if(null===_value)return{kind:Kind.NULL};if((0,_isInvalid2.default)(_value))return null;if(type instanceof _definition.GraphQLList){var itemType=type.ofType;if((0,_iterall.isCollection)(_value)){var valuesNodes=[];return(0,_iterall.forEach)(_value,function(item){var itemNode=astFromValue(item,itemType);itemNode&&valuesNodes.push(itemNode)}),{kind:Kind.LIST,values:valuesNodes}}return astFromValue(_value,itemType)}if(type instanceof _definition.GraphQLInputObjectType){if(null===_value||"object"!=typeof _value)return null;var fields=type.getFields(),fieldNodes=[];return Object.keys(fields).forEach(function(fieldName){var fieldType=fields[fieldName].type,fieldValue=astFromValue(_value[fieldName],fieldType);fieldValue&&fieldNodes.push({kind:Kind.OBJECT_FIELD,name:{kind:Kind.NAME,value:fieldName},value:fieldValue})}),{kind:Kind.OBJECT,fields:fieldNodes}}(0,_invariant2.default)(type instanceof _definition.GraphQLScalarType||type instanceof _definition.GraphQLEnumType,"Must provide Input Type, cannot use: "+String(type));var serialized=type.serialize(_value);if((0,_isNullish2.default)(serialized))return null;if("boolean"==typeof serialized)return{kind:Kind.BOOLEAN,value:serialized};if("number"==typeof serialized){var stringNum=String(serialized);return/^[0-9]+$/.test(stringNum)?{kind:Kind.INT,value:stringNum}:{kind:Kind.FLOAT,value:stringNum}}if("string"==typeof serialized)return type instanceof _definition.GraphQLEnumType?{kind:Kind.ENUM,value:serialized}:type===_scalars.GraphQLID&&/^[0-9]+$/.test(serialized)?{kind:Kind.INT,value:serialized}:{kind:Kind.STRING,value:JSON.stringify(serialized).slice(1,-1)};throw new TypeError("Cannot convert value to AST: "+String(serialized))}Object.defineProperty(exports,"__esModule",{value:!0}),exports.astFromValue=astFromValue;var _iterall=require("iterall"),_invariant2=_interopRequireDefault(require("../jsutils/invariant")),_isNullish2=_interopRequireDefault(require("../jsutils/isNullish")),_isInvalid2=_interopRequireDefault(require("../jsutils/isInvalid")),Kind=function(obj){if(obj&&obj.__esModule)return obj;var newObj={};if(null!=obj)for(var key in obj)Object.prototype.hasOwnProperty.call(obj,key)&&(newObj[key]=obj[key]);return newObj.default=obj,newObj}(require("../language/kinds")),_definition=require("../type/definition"),_scalars=require("../type/scalars")},{"../jsutils/invariant":97,"../jsutils/isInvalid":98,"../jsutils/isNullish":99,"../language/kinds":105,"../type/definition":115,"../type/scalars":119,iterall:169}],124:[function(require,module,exports){"use strict";function _interopRequireDefault(obj){return obj&&obj.__esModule?obj:{default:obj}}function buildWrappedType(innerType,inputTypeNode){if(inputTypeNode.kind===Kind.LIST_TYPE)return new _definition.GraphQLList(buildWrappedType(innerType,inputTypeNode.type));if(inputTypeNode.kind===Kind.NON_NULL_TYPE){var wrappedType=buildWrappedType(innerType,inputTypeNode.type);return(0,_invariant2.default)(!(wrappedType instanceof _definition.GraphQLNonNull),"No nesting nonnull."),new _definition.GraphQLNonNull(wrappedType)}return innerType}function getNamedTypeNode(typeNode){for(var namedType=typeNode;namedType.kind===Kind.LIST_TYPE||namedType.kind===Kind.NON_NULL_TYPE;)namedType=namedType.type;return namedType}function buildASTSchema(ast){function getObjectType(typeNode){var type=typeDefNamed(typeNode.name.value);return(0,_invariant2.default)(type instanceof _definition.GraphQLObjectType,"AST must provide object type."),type}function produceType(typeNode){return buildWrappedType(typeDefNamed(getNamedTypeNode(typeNode).name.value),typeNode)}function produceInputType(typeNode){return(0,_definition.assertInputType)(produceType(typeNode))}function produceOutputType(typeNode){return(0,_definition.assertOutputType)(produceType(typeNode))}function produceObjectType(typeNode){var type=produceType(typeNode);return(0,_invariant2.default)(type instanceof _definition.GraphQLObjectType,"Expected Object type."),type}function produceInterfaceType(typeNode){var type=produceType(typeNode);return(0,_invariant2.default)(type instanceof _definition.GraphQLInterfaceType,"Expected Interface type."),type}function typeDefNamed(typeName){if(innerTypeMap[typeName])return innerTypeMap[typeName];if(!nodeMap[typeName])throw new Error('Type "'+typeName+'" not found in document.');var innerTypeDef=makeSchemaDef(nodeMap[typeName]);if(!innerTypeDef)throw new Error('Nothing constructed for "'+typeName+'".');return innerTypeMap[typeName]=innerTypeDef,innerTypeDef}function makeSchemaDef(def){if(!def)throw new Error("def must be defined");switch(def.kind){case Kind.OBJECT_TYPE_DEFINITION:return makeTypeDef(def);case Kind.INTERFACE_TYPE_DEFINITION:return makeInterfaceDef(def);case Kind.ENUM_TYPE_DEFINITION:return makeEnumDef(def);case Kind.UNION_TYPE_DEFINITION:return makeUnionDef(def);case Kind.SCALAR_TYPE_DEFINITION:return makeScalarDef(def);case Kind.INPUT_OBJECT_TYPE_DEFINITION:return makeInputObjectDef(def);default:throw new Error('Type kind "'+def.kind+'" not supported.')}}function makeTypeDef(def){var typeName=def.name.value;return new _definition.GraphQLObjectType({name:typeName,description:getDescription(def),fields:function(){return makeFieldDefMap(def)},interfaces:function(){return makeImplementedInterfaces(def)}})}function makeFieldDefMap(def){return(0,_keyValMap2.default)(def.fields,function(field){return field.name.value},function(field){return{type:produceOutputType(field.type),description:getDescription(field),args:makeInputValues(field.arguments),deprecationReason:getDeprecationReason(field)}})}function makeImplementedInterfaces(def){return def.interfaces&&def.interfaces.map(function(iface){return produceInterfaceType(iface)})}function makeInputValues(values){return(0,_keyValMap2.default)(values,function(value){return value.name.value},function(value){var type=produceInputType(value.type);return{type:type,description:getDescription(value),defaultValue:(0,_valueFromAST.valueFromAST)(value.defaultValue,type)}})}function makeInterfaceDef(def){var typeName=def.name.value;return new _definition.GraphQLInterfaceType({name:typeName,description:getDescription(def),fields:function(){return makeFieldDefMap(def)},resolveType:cannotExecuteSchema})}function makeEnumDef(def){return new _definition.GraphQLEnumType({name:def.name.value,description:getDescription(def),values:(0,_keyValMap2.default)(def.values,function(enumValue){return enumValue.name.value},function(enumValue){return{description:getDescription(enumValue),deprecationReason:getDeprecationReason(enumValue)}})})}function makeUnionDef(def){return new _definition.GraphQLUnionType({name:def.name.value,description:getDescription(def),types:def.types.map(function(t){return produceObjectType(t)}),resolveType:cannotExecuteSchema})}function makeScalarDef(def){return new _definition.GraphQLScalarType({name:def.name.value,description:getDescription(def),serialize:function(){return null},parseValue:function(){return!1},parseLiteral:function(){return!1}})}function makeInputObjectDef(def){return new _definition.GraphQLInputObjectType({name:def.name.value,description:getDescription(def),fields:function(){return makeInputValues(def.fields)}})}if(!ast||ast.kind!==Kind.DOCUMENT)throw new Error("Must provide a document ast.");for(var schemaDef=void 0,typeDefs=[],nodeMap=Object.create(null),directiveDefs=[],i=0;i<ast.definitions.length;i++){var d=ast.definitions[i];switch(d.kind){case Kind.SCHEMA_DEFINITION:if(schemaDef)throw new Error("Must provide only one schema definition.");schemaDef=d;break;case Kind.SCALAR_TYPE_DEFINITION:case Kind.OBJECT_TYPE_DEFINITION:case Kind.INTERFACE_TYPE_DEFINITION:case Kind.ENUM_TYPE_DEFINITION:case Kind.UNION_TYPE_DEFINITION:case Kind.INPUT_OBJECT_TYPE_DEFINITION:var typeName=d.name.value;if(nodeMap[typeName])throw new Error('Type "'+typeName+'" was defined more than once.');typeDefs.push(d),nodeMap[typeName]=d;break;case Kind.DIRECTIVE_DEFINITION:directiveDefs.push(d)}}var queryTypeName=void 0,mutationTypeName=void 0,subscriptionTypeName=void 0;if(schemaDef?schemaDef.operationTypes.forEach(function(operationType){var typeName=operationType.type.name.value;if("query"===operationType.operation){if(queryTypeName)throw new Error("Must provide only one query type in schema.");if(!nodeMap[typeName])throw new Error('Specified query type "'+typeName+'" not found in document.');queryTypeName=typeName}else if("mutation"===operationType.operation){if(mutationTypeName)throw new Error("Must provide only one mutation type in schema.");if(!nodeMap[typeName])throw new Error('Specified mutation type "'+typeName+'" not found in document.');mutationTypeName=typeName}else if("subscription"===operationType.operation){if(subscriptionTypeName)throw new Error("Must provide only one subscription type in schema.");if(!nodeMap[typeName])throw new Error('Specified subscription type "'+typeName+'" not found in document.');subscriptionTypeName=typeName}}):(nodeMap.Query&&(queryTypeName="Query"),nodeMap.Mutation&&(mutationTypeName="Mutation"),nodeMap.Subscription&&(subscriptionTypeName="Subscription")),!queryTypeName)throw new Error("Must provide schema definition with query type or a type named Query.");var innerTypeMap={String:_scalars.GraphQLString,Int:_scalars.GraphQLInt,Float:_scalars.GraphQLFloat,Boolean:_scalars.GraphQLBoolean,ID:_scalars.GraphQLID,__Schema:_introspection.__Schema,__Directive:_introspection.__Directive,__DirectiveLocation:_introspection.__DirectiveLocation,__Type:_introspection.__Type,__Field:_introspection.__Field,__InputValue:_introspection.__InputValue,__EnumValue:_introspection.__EnumValue,__TypeKind:_introspection.__TypeKind},types=typeDefs.map(function(def){return typeDefNamed(def.name.value)}),directives=directiveDefs.map(function(directiveNode){return new _directives.GraphQLDirective({name:directiveNode.name.value,description:getDescription(directiveNode),locations:directiveNode.locations.map(function(node){return node.value}),args:directiveNode.arguments&&makeInputValues(directiveNode.arguments)})});return directives.some(function(directive){return"skip"===directive.name})||directives.push(_directives.GraphQLSkipDirective),directives.some(function(directive){return"include"===directive.name})||directives.push(_directives.GraphQLIncludeDirective),directives.some(function(directive){return"deprecated"===directive.name})||directives.push(_directives.GraphQLDeprecatedDirective),new _schema.GraphQLSchema({query:getObjectType(nodeMap[queryTypeName]),mutation:mutationTypeName?getObjectType(nodeMap[mutationTypeName]):null,subscription:subscriptionTypeName?getObjectType(nodeMap[subscriptionTypeName]):null,types:types,directives:directives})}function getDeprecationReason(node){var deprecated=(0,_values.getDirectiveValues)(_directives.GraphQLDeprecatedDirective,node);return deprecated&&deprecated.reason}function getDescription(node){var loc=node.loc;if(loc){for(var comments=[],minSpaces=void 0,token=loc.startToken.prev;token&&token.kind===_lexer.TokenKind.COMMENT&&token.next&&token.prev&&token.line+1===token.next.line&&token.line!==token.prev.line;){var value=String(token.value),spaces=leadingSpaces(value);(void 0===minSpaces||spaces<minSpaces)&&(minSpaces=spaces),comments.push(value),token=token.prev}return comments.reverse().map(function(comment){return comment.slice(minSpaces)}).join("\n")}}function leadingSpaces(str){for(var i=0;i<str.length&&" "===str[i];i++);return i}function cannotExecuteSchema(){throw new Error("Generated Schema cannot use Interface or Union types for execution.")}Object.defineProperty(exports,"__esModule",{value:!0}),exports.buildASTSchema=buildASTSchema,exports.getDeprecationReason=getDeprecationReason,exports.getDescription=getDescription,exports.buildSchema=function(source){return buildASTSchema((0,_parser.parse)(source))};var _invariant2=_interopRequireDefault(require("../jsutils/invariant")),_keyValMap2=_interopRequireDefault(require("../jsutils/keyValMap")),_valueFromAST=require("./valueFromAST"),_lexer=require("../language/lexer"),_parser=require("../language/parser"),_values=require("../execution/values"),Kind=function(obj){if(obj&&obj.__esModule)return obj;var newObj={};if(null!=obj)for(var key in obj)Object.prototype.hasOwnProperty.call(obj,key)&&(newObj[key]=obj[key]);return newObj.default=obj,newObj}(require("../language/kinds")),_schema=require("../type/schema"),_scalars=require("../type/scalars"),_definition=require("../type/definition"),_directives=require("../type/directives"),_introspection=require("../type/introspection")},{"../execution/values":93,"../jsutils/invariant":97,"../jsutils/keyValMap":101,"../language/kinds":105,"../language/lexer":106,"../language/parser":108,"../type/definition":115,"../type/directives":116,"../type/introspection":118,"../type/scalars":119,"../type/schema":120,"./valueFromAST":139}],125:[function(require,module,exports){"use strict";function _interopRequireDefault(obj){return obj&&obj.__esModule?obj:{default:obj}}function cannotExecuteClientSchema(){throw new Error("Client Schema cannot use Interface or Union types for execution.")}Object.defineProperty(exports,"__esModule",{value:!0}),exports.buildClientSchema=function(introspection){function getType(typeRef){if(typeRef.kind===_introspection.TypeKind.LIST){var itemRef=typeRef.ofType;if(!itemRef)throw new Error("Decorated type deeper than introspection query.");return new _definition.GraphQLList(getType(itemRef))}if(typeRef.kind===_introspection.TypeKind.NON_NULL){var nullableRef=typeRef.ofType;if(!nullableRef)throw new Error("Decorated type deeper than introspection query.");var nullableType=getType(nullableRef);return(0,_invariant2.default)(!(nullableType instanceof _definition.GraphQLNonNull),"No nesting nonnull."),new _definition.GraphQLNonNull(nullableType)}return getNamedType(typeRef.name)}function getNamedType(typeName){if(typeDefCache[typeName])return typeDefCache[typeName];var typeIntrospection=typeIntrospectionMap[typeName];if(!typeIntrospection)throw new Error("Invalid or incomplete schema, unknown type: "+typeName+". Ensure that a full introspection query is used in order to build a client schema.");var typeDef=buildType(typeIntrospection);return typeDefCache[typeName]=typeDef,typeDef}function getInputType(typeRef){var type=getType(typeRef);return(0,_invariant2.default)((0,_definition.isInputType)(type),"Introspection must provide input type for arguments."),type}function getOutputType(typeRef){var type=getType(typeRef);return(0,_invariant2.default)((0,_definition.isOutputType)(type),"Introspection must provide output type for fields."),type}function getObjectType(typeRef){var type=getType(typeRef);return(0,_invariant2.default)(type instanceof _definition.GraphQLObjectType,"Introspection must provide object type for possibleTypes."),type}function getInterfaceType(typeRef){var type=getType(typeRef);return(0,_invariant2.default)(type instanceof _definition.GraphQLInterfaceType,"Introspection must provide interface type for interfaces."),type}function buildType(type){switch(type.kind){case _introspection.TypeKind.SCALAR:return buildScalarDef(type);case _introspection.TypeKind.OBJECT:return buildObjectDef(type);case _introspection.TypeKind.INTERFACE:return buildInterfaceDef(type);case _introspection.TypeKind.UNION:return buildUnionDef(type);case _introspection.TypeKind.ENUM:return buildEnumDef(type);case _introspection.TypeKind.INPUT_OBJECT:return buildInputObjectDef(type);default:throw new Error("Invalid or incomplete schema, unknown kind: "+type.kind+". Ensure that a full introspection query is used in order to build a client schema.")}}function buildScalarDef(scalarIntrospection){return new _definition.GraphQLScalarType({name:scalarIntrospection.name,description:scalarIntrospection.description,serialize:function(id){return id},parseValue:function(){return!1},parseLiteral:function(){return!1}})}function buildObjectDef(objectIntrospection){return new _definition.GraphQLObjectType({name:objectIntrospection.name,description:objectIntrospection.description,interfaces:objectIntrospection.interfaces.map(getInterfaceType),fields:function(){return buildFieldDefMap(objectIntrospection)}})}function buildInterfaceDef(interfaceIntrospection){return new _definition.GraphQLInterfaceType({name:interfaceIntrospection.name,description:interfaceIntrospection.description,fields:function(){return buildFieldDefMap(interfaceIntrospection)},resolveType:cannotExecuteClientSchema})}function buildUnionDef(unionIntrospection){return new _definition.GraphQLUnionType({name:unionIntrospection.name,description:unionIntrospection.description,types:unionIntrospection.possibleTypes.map(getObjectType),resolveType:cannotExecuteClientSchema})}function buildEnumDef(enumIntrospection){return new _definition.GraphQLEnumType({name:enumIntrospection.name,description:enumIntrospection.description,values:(0,_keyValMap2.default)(enumIntrospection.enumValues,function(valueIntrospection){return valueIntrospection.name},function(valueIntrospection){return{description:valueIntrospection.description,deprecationReason:valueIntrospection.deprecationReason}})})}function buildInputObjectDef(inputObjectIntrospection){return new _definition.GraphQLInputObjectType({name:inputObjectIntrospection.name,description:inputObjectIntrospection.description,fields:function(){return buildInputValueDefMap(inputObjectIntrospection.inputFields)}})}function buildFieldDefMap(typeIntrospection){return(0,_keyValMap2.default)(typeIntrospection.fields,function(fieldIntrospection){return fieldIntrospection.name},function(fieldIntrospection){return{description:fieldIntrospection.description,deprecationReason:fieldIntrospection.deprecationReason,type:getOutputType(fieldIntrospection.type),args:buildInputValueDefMap(fieldIntrospection.args)}})}function buildInputValueDefMap(inputValueIntrospections){return(0,_keyValMap2.default)(inputValueIntrospections,function(inputValue){return inputValue.name},buildInputValue)}function buildInputValue(inputValueIntrospection){var type=getInputType(inputValueIntrospection.type),defaultValue=inputValueIntrospection.defaultValue?(0,_valueFromAST.valueFromAST)((0,_parser.parseValue)(inputValueIntrospection.defaultValue),type):void 0;return{name:inputValueIntrospection.name,description:inputValueIntrospection.description,type:type,defaultValue:defaultValue}}var schemaIntrospection=introspection.__schema,typeIntrospectionMap=(0,_keyMap2.default)(schemaIntrospection.types,function(type){return type.name}),typeDefCache={String:_scalars.GraphQLString,Int:_scalars.GraphQLInt,Float:_scalars.GraphQLFloat,Boolean:_scalars.GraphQLBoolean,ID:_scalars.GraphQLID,__Schema:_introspection.__Schema,__Directive:_introspection.__Directive,__DirectiveLocation:_introspection.__DirectiveLocation,__Type:_introspection.__Type,__Field:_introspection.__Field,__InputValue:_introspection.__InputValue,__EnumValue:_introspection.__EnumValue,__TypeKind:_introspection.__TypeKind},types=schemaIntrospection.types.map(function(typeIntrospection){return getNamedType(typeIntrospection.name)}),queryType=getObjectType(schemaIntrospection.queryType),mutationType=schemaIntrospection.mutationType?getObjectType(schemaIntrospection.mutationType):null,subscriptionType=schemaIntrospection.subscriptionType?getObjectType(schemaIntrospection.subscriptionType):null,directives=schemaIntrospection.directives?schemaIntrospection.directives.map(function(directiveIntrospection){var locations=directiveIntrospection.locations?directiveIntrospection.locations.slice():[].concat(directiveIntrospection.onField?[_directives.DirectiveLocation.FIELD]:[],directiveIntrospection.onOperation?[_directives.DirectiveLocation.QUERY,_directives.DirectiveLocation.MUTATION,_directives.DirectiveLocation.SUBSCRIPTION]:[],directiveIntrospection.onFragment?[_directives.DirectiveLocation.FRAGMENT_DEFINITION,_directives.DirectiveLocation.FRAGMENT_SPREAD,_directives.DirectiveLocation.INLINE_FRAGMENT]:[]);return new _directives.GraphQLDirective({name:directiveIntrospection.name,description:directiveIntrospection.description,locations:locations,args:buildInputValueDefMap(directiveIntrospection.args)})}):[];return new _schema.GraphQLSchema({query:queryType,mutation:mutationType,subscription:subscriptionType,types:types,directives:directives})};var _invariant2=_interopRequireDefault(require("../jsutils/invariant")),_keyMap2=_interopRequireDefault(require("../jsutils/keyMap")),_keyValMap2=_interopRequireDefault(require("../jsutils/keyValMap")),_valueFromAST=require("./valueFromAST"),_parser=require("../language/parser"),_schema=require("../type/schema"),_definition=require("../type/definition"),_introspection=require("../type/introspection"),_scalars=require("../type/scalars"),_directives=require("../type/directives")},{"../jsutils/invariant":97,"../jsutils/keyMap":100,"../jsutils/keyValMap":101,"../language/parser":108,"../type/definition":115,"../type/directives":116,"../type/introspection":118,"../type/scalars":119,"../type/schema":120,"./valueFromAST":139}],126:[function(require,module,exports){"use strict";Object.defineProperty(exports,"__esModule",{value:!0}),exports.concatAST=function(asts){for(var batchDefinitions=[],i=0;i<asts.length;i++)for(var definitions=asts[i].definitions,j=0;j<definitions.length;j++)batchDefinitions.push(definitions[j]);return{kind:"Document",definitions:batchDefinitions}}},{}],127:[function(require,module,exports){"use strict";function _interopRequireDefault(obj){return obj&&obj.__esModule?obj:{default:obj}}function cannotExecuteExtendedSchema(){throw new Error("Extended Schema cannot use Interface or Union types for execution.")}Object.defineProperty(exports,"__esModule",{value:!0}),exports.extendSchema=function(schema,documentAST){function getTypeFromDef(typeDef){var type=_getNamedType(typeDef.name);return(0,_invariant2.default)(type,"Missing type from schema"),type}function getTypeFromAST(node){var type=_getNamedType(node.name.value);if(!type)throw new _GraphQLError.GraphQLError('Unknown type: "'+node.name.value+'". Ensure that this type exists either in the original schema, or is added in a type definition.',[node]);return type}function getObjectTypeFromAST(node){var type=getTypeFromAST(node);return(0,_invariant2.default)(type instanceof _definition.GraphQLObjectType,"Must be Object type."),type}function getInterfaceTypeFromAST(node){var type=getTypeFromAST(node);return(0,_invariant2.default)(type instanceof _definition.GraphQLInterfaceType,"Must be Interface type."),type}function getInputTypeFromAST(node){return(0,_definition.assertInputType)(getTypeFromAST(node))}function getOutputTypeFromAST(node){return(0,_definition.assertOutputType)(getTypeFromAST(node))}function _getNamedType(typeName){var cachedTypeDef=typeDefCache[typeName];if(cachedTypeDef)return cachedTypeDef;var existingType=schema.getType(typeName);if(existingType){var typeDef=extendType(existingType);return typeDefCache[typeName]=typeDef,typeDef}var typeNode=typeDefinitionMap[typeName];if(typeNode){var _typeDef=buildType(typeNode);return typeDefCache[typeName]=_typeDef,_typeDef}}function extendType(type){return type instanceof _definition.GraphQLObjectType?extendObjectType(type):type instanceof _definition.GraphQLInterfaceType?extendInterfaceType(type):type instanceof _definition.GraphQLUnionType?extendUnionType(type):type}function extendObjectType(type){return new _definition.GraphQLObjectType({name:type.name,description:type.description,interfaces:function(){return extendImplementedInterfaces(type)},fields:function(){return extendFieldMap(type)},isTypeOf:type.isTypeOf})}function extendInterfaceType(type){return new _definition.GraphQLInterfaceType({name:type.name,description:type.description,fields:function(){return extendFieldMap(type)},resolveType:type.resolveType})}function extendUnionType(type){return new _definition.GraphQLUnionType({name:type.name,description:type.description,types:type.getTypes().map(getTypeFromDef),resolveType:type.resolveType})}function extendImplementedInterfaces(type){var interfaces=type.getInterfaces().map(getTypeFromDef),extensions=typeExtensionsMap[type.name];return extensions&&extensions.forEach(function(extension){extension.definition.interfaces.forEach(function(namedType){var interfaceName=namedType.name.value;if(interfaces.some(function(def){return def.name===interfaceName}))throw new _GraphQLError.GraphQLError('Type "'+type.name+'" already implements "'+interfaceName+'". It cannot also be implemented in this type extension.',[namedType]);interfaces.push(getInterfaceTypeFromAST(namedType))})}),interfaces}function extendFieldMap(type){var newFieldMap=Object.create(null),oldFieldMap=type.getFields();Object.keys(oldFieldMap).forEach(function(fieldName){var field=oldFieldMap[fieldName];newFieldMap[fieldName]={description:field.description,deprecationReason:field.deprecationReason,type:extendFieldType(field.type),args:(0,_keyMap2.default)(field.args,function(arg){return arg.name}),resolve:field.resolve}});var extensions=typeExtensionsMap[type.name];return extensions&&extensions.forEach(function(extension){extension.definition.fields.forEach(function(field){var fieldName=field.name.value;if(oldFieldMap[fieldName])throw new _GraphQLError.GraphQLError('Field "'+type.name+"."+fieldName+'" already exists in the schema. It cannot also be defined in this type extension.',[field]);newFieldMap[fieldName]={description:(0,_buildASTSchema.getDescription)(field),type:buildOutputFieldType(field.type),args:buildInputValues(field.arguments),deprecationReason:(0,_buildASTSchema.getDeprecationReason)(field)}})}),newFieldMap}function extendFieldType(typeDef){return typeDef instanceof _definition.GraphQLList?new _definition.GraphQLList(extendFieldType(typeDef.ofType)):typeDef instanceof _definition.GraphQLNonNull?new _definition.GraphQLNonNull(extendFieldType(typeDef.ofType)):getTypeFromDef(typeDef)}function buildType(typeNode){switch(typeNode.kind){case Kind.OBJECT_TYPE_DEFINITION:return buildObjectType(typeNode);case Kind.INTERFACE_TYPE_DEFINITION:return buildInterfaceType(typeNode);case Kind.UNION_TYPE_DEFINITION:return buildUnionType(typeNode);case Kind.SCALAR_TYPE_DEFINITION:return buildScalarType(typeNode);case Kind.ENUM_TYPE_DEFINITION:return buildEnumType(typeNode);case Kind.INPUT_OBJECT_TYPE_DEFINITION:return buildInputObjectType(typeNode)}throw new TypeError("Unknown type kind "+typeNode.kind)}function buildObjectType(typeNode){return new _definition.GraphQLObjectType({name:typeNode.name.value,description:(0,_buildASTSchema.getDescription)(typeNode),interfaces:function(){return buildImplementedInterfaces(typeNode)},fields:function(){return buildFieldMap(typeNode)}})}function buildInterfaceType(typeNode){return new _definition.GraphQLInterfaceType({name:typeNode.name.value,description:(0,_buildASTSchema.getDescription)(typeNode),fields:function(){return buildFieldMap(typeNode)},resolveType:cannotExecuteExtendedSchema})}function buildUnionType(typeNode){return new _definition.GraphQLUnionType({name:typeNode.name.value,description:(0,_buildASTSchema.getDescription)(typeNode),types:typeNode.types.map(getObjectTypeFromAST),resolveType:cannotExecuteExtendedSchema})}function buildScalarType(typeNode){return new _definition.GraphQLScalarType({name:typeNode.name.value,description:(0,_buildASTSchema.getDescription)(typeNode),serialize:function(id){return id},parseValue:function(){return!1},parseLiteral:function(){return!1}})}function buildEnumType(typeNode){return new _definition.GraphQLEnumType({name:typeNode.name.value,description:(0,_buildASTSchema.getDescription)(typeNode),values:(0,_keyValMap2.default)(typeNode.values,function(enumValue){return enumValue.name.value},function(enumValue){return{description:(0,_buildASTSchema.getDescription)(enumValue),deprecationReason:(0,_buildASTSchema.getDeprecationReason)(enumValue)}})})}function buildInputObjectType(typeNode){return new _definition.GraphQLInputObjectType({name:typeNode.name.value,description:(0,_buildASTSchema.getDescription)(typeNode),fields:function(){return buildInputValues(typeNode.fields)}})}function getDirective(directiveNode){return new _directives.GraphQLDirective({name:directiveNode.name.value,locations:directiveNode.locations.map(function(node){return node.value}),args:directiveNode.arguments&&buildInputValues(directiveNode.arguments)})}function buildImplementedInterfaces(typeNode){return typeNode.interfaces&&typeNode.interfaces.map(getInterfaceTypeFromAST)}function buildFieldMap(typeNode){return(0,_keyValMap2.default)(typeNode.fields,function(field){return field.name.value},function(field){return{type:buildOutputFieldType(field.type),description:(0,_buildASTSchema.getDescription)(field),args:buildInputValues(field.arguments),deprecationReason:(0,_buildASTSchema.getDeprecationReason)(field)}})}function buildInputValues(values){return(0,_keyValMap2.default)(values,function(value){return value.name.value},function(value){var type=buildInputFieldType(value.type);return{type:type,description:(0,_buildASTSchema.getDescription)(value),defaultValue:(0,_valueFromAST.valueFromAST)(value.defaultValue,type)}})}function buildInputFieldType(typeNode){if(typeNode.kind===Kind.LIST_TYPE)return new _definition.GraphQLList(buildInputFieldType(typeNode.type));if(typeNode.kind===Kind.NON_NULL_TYPE){var nullableType=buildInputFieldType(typeNode.type);return(0,_invariant2.default)(!(nullableType instanceof _definition.GraphQLNonNull),"Must be nullable"),new _definition.GraphQLNonNull(nullableType)}return getInputTypeFromAST(typeNode)}function buildOutputFieldType(typeNode){if(typeNode.kind===Kind.LIST_TYPE)return new _definition.GraphQLList(buildOutputFieldType(typeNode.type));if(typeNode.kind===Kind.NON_NULL_TYPE){var nullableType=buildOutputFieldType(typeNode.type);return(0,_invariant2.default)(!(nullableType instanceof _definition.GraphQLNonNull),"Must be nullable"),new _definition.GraphQLNonNull(nullableType)}return getOutputTypeFromAST(typeNode)}(0,_invariant2.default)(schema instanceof _schema.GraphQLSchema,"Must provide valid GraphQLSchema"),(0,_invariant2.default)(documentAST&&documentAST.kind===Kind.DOCUMENT,"Must provide valid Document AST");for(var typeDefinitionMap=Object.create(null),typeExtensionsMap=Object.create(null),directiveDefinitions=[],i=0;i<documentAST.definitions.length;i++){var def=documentAST.definitions[i];switch(def.kind){case Kind.OBJECT_TYPE_DEFINITION:case Kind.INTERFACE_TYPE_DEFINITION:case Kind.ENUM_TYPE_DEFINITION:case Kind.UNION_TYPE_DEFINITION:case Kind.SCALAR_TYPE_DEFINITION:case Kind.INPUT_OBJECT_TYPE_DEFINITION:var typeName=def.name.value;if(schema.getType(typeName))throw new _GraphQLError.GraphQLError('Type "'+typeName+'" already exists in the schema. It cannot also be defined in this type definition.',[def]);typeDefinitionMap[typeName]=def;break;case Kind.TYPE_EXTENSION_DEFINITION:var extendedTypeName=def.definition.name.value,existingType=schema.getType(extendedTypeName);if(!existingType)throw new _GraphQLError.GraphQLError('Cannot extend type "'+extendedTypeName+'" because it does not exist in the existing schema.',[def.definition]);if(!(existingType instanceof _definition.GraphQLObjectType))throw new _GraphQLError.GraphQLError('Cannot extend non-object type "'+extendedTypeName+'".',[def.definition]);var extensions=typeExtensionsMap[extendedTypeName];extensions?extensions.push(def):extensions=[def],typeExtensionsMap[extendedTypeName]=extensions;break;case Kind.DIRECTIVE_DEFINITION:var directiveName=def.name.value;if(schema.getDirective(directiveName))throw new _GraphQLError.GraphQLError('Directive "'+directiveName+'" already exists in the schema. It cannot be redefined.',[def]);directiveDefinitions.push(def)}}if(0===Object.keys(typeExtensionsMap).length&&0===Object.keys(typeDefinitionMap).length&&0===directiveDefinitions.length)return schema;var typeDefCache={String:_scalars.GraphQLString,Int:_scalars.GraphQLInt,Float:_scalars.GraphQLFloat,Boolean:_scalars.GraphQLBoolean,ID:_scalars.GraphQLID,__Schema:_introspection.__Schema,__Directive:_introspection.__Directive,__DirectiveLocation:_introspection.__DirectiveLocation,__Type:_introspection.__Type,__Field:_introspection.__Field,__InputValue:_introspection.__InputValue,__EnumValue:_introspection.__EnumValue,__TypeKind:_introspection.__TypeKind},queryType=getTypeFromDef(schema.getQueryType()),existingMutationType=schema.getMutationType(),mutationType=existingMutationType?getTypeFromDef(existingMutationType):null,existingSubscriptionType=schema.getSubscriptionType(),subscriptionType=existingSubscriptionType?getTypeFromDef(existingSubscriptionType):null,typeMap=schema.getTypeMap(),types=Object.keys(typeMap).map(function(typeName){return getTypeFromDef(typeMap[typeName])});return Object.keys(typeDefinitionMap).forEach(function(typeName){types.push(getTypeFromAST(typeDefinitionMap[typeName]))}),new _schema.GraphQLSchema({query:queryType,mutation:mutationType,subscription:subscriptionType,types:types,directives:function(){var existingDirectives=schema.getDirectives();(0,_invariant2.default)(existingDirectives,"schema must have default directives");var newDirectives=directiveDefinitions.map(function(directiveNode){return getDirective(directiveNode)});return existingDirectives.concat(newDirectives)}()})};var _invariant2=_interopRequireDefault(require("../jsutils/invariant")),_keyMap2=_interopRequireDefault(require("../jsutils/keyMap")),_keyValMap2=_interopRequireDefault(require("../jsutils/keyValMap")),_buildASTSchema=require("./buildASTSchema"),_valueFromAST=require("./valueFromAST"),_GraphQLError=require("../error/GraphQLError"),_schema=require("../type/schema"),_definition=require("../type/definition"),_directives=require("../type/directives"),_introspection=require("../type/introspection"),_scalars=require("../type/scalars"),Kind=function(obj){if(obj&&obj.__esModule)return obj;var newObj={};if(null!=obj)for(var key in obj)Object.prototype.hasOwnProperty.call(obj,key)&&(newObj[key]=obj[key]);return newObj.default=obj,newObj}(require("../language/kinds"))},{"../error/GraphQLError":86,"../jsutils/invariant":97,"../jsutils/keyMap":100,"../jsutils/keyValMap":101,"../language/kinds":105,"../type/definition":115,"../type/directives":116,"../type/introspection":118,"../type/scalars":119,"../type/schema":120,"./buildASTSchema":124,"./valueFromAST":139}],128:[function(require,module,exports){"use strict";function findRemovedTypes(oldSchema,newSchema){var oldTypeMap=oldSchema.getTypeMap(),newTypeMap=newSchema.getTypeMap(),breakingChanges=[];return Object.keys(oldTypeMap).forEach(function(typeName){newTypeMap[typeName]||breakingChanges.push({type:BreakingChangeType.TYPE_REMOVED,description:typeName+" was removed."})}),breakingChanges}function findTypesThatChangedKind(oldSchema,newSchema){var oldTypeMap=oldSchema.getTypeMap(),newTypeMap=newSchema.getTypeMap(),breakingChanges=[];return Object.keys(oldTypeMap).forEach(function(typeName){if(newTypeMap[typeName]){var oldType=oldTypeMap[typeName],newType=newTypeMap[typeName];oldType instanceof newType.constructor||breakingChanges.push({type:BreakingChangeType.TYPE_CHANGED_KIND,description:typeName+" changed from "+typeKindName(oldType)+" to "+typeKindName(newType)+"."})}}),breakingChanges}function findArgChanges(oldSchema,newSchema){var oldTypeMap=oldSchema.getTypeMap(),newTypeMap=newSchema.getTypeMap(),breakingChanges=[],dangerousChanges=[];return Object.keys(oldTypeMap).forEach(function(typeName){var oldType=oldTypeMap[typeName],newType=newTypeMap[typeName];if((oldType instanceof _definition.GraphQLObjectType||oldType instanceof _definition.GraphQLInterfaceType)&&newType instanceof oldType.constructor){var oldTypeFields=oldType.getFields(),newTypeFields=newType.getFields();Object.keys(oldTypeFields).forEach(function(fieldName){newTypeFields[fieldName]&&(oldTypeFields[fieldName].args.forEach(function(oldArgDef){var newArgDef=newTypeFields[fieldName].args.find(function(arg){return arg.name===oldArgDef.name});newArgDef?isChangeSafeForInputObjectFieldOrFieldArg(oldArgDef.type,newArgDef.type)?void 0!==oldArgDef.defaultValue&&oldArgDef.defaultValue!==newArgDef.defaultValue&&dangerousChanges.push({type:DangerousChangeType.ARG_DEFAULT_VALUE_CHANGE,description:oldType.name+"."+fieldName+" arg "+oldArgDef.name+" has changed defaultValue"}):breakingChanges.push({type:BreakingChangeType.ARG_CHANGED_KIND,description:oldType.name+"."+fieldName+" arg "+oldArgDef.name+" has changed type from "+oldArgDef.type.toString()+" to "+newArgDef.type.toString()}):breakingChanges.push({type:BreakingChangeType.ARG_REMOVED,description:oldType.name+"."+fieldName+" arg "+oldArgDef.name+" was removed"})}),newTypeFields[fieldName].args.forEach(function(newArgDef){!oldTypeFields[fieldName].args.find(function(arg){return arg.name===newArgDef.name})&&newArgDef.type instanceof _definition.GraphQLNonNull&&breakingChanges.push({type:BreakingChangeType.NON_NULL_ARG_ADDED,description:"A non-null arg "+newArgDef.name+" on "+newType.name+"."+fieldName+" was added"})}))})}}),{breakingChanges:breakingChanges,dangerousChanges:dangerousChanges}}function typeKindName(type){if(type instanceof _definition.GraphQLScalarType)return"a Scalar type";if(type instanceof _definition.GraphQLObjectType)return"an Object type";if(type instanceof _definition.GraphQLInterfaceType)return"an Interface type";if(type instanceof _definition.GraphQLUnionType)return"a Union type";if(type instanceof _definition.GraphQLEnumType)return"an Enum type";if(type instanceof _definition.GraphQLInputObjectType)return"an Input type";throw new TypeError("Unknown type "+type.constructor.name)}function findFieldsThatChangedType(oldSchema,newSchema){return[].concat(findFieldsThatChangedTypeOnObjectOrInterfaceTypes(oldSchema,newSchema),findFieldsThatChangedTypeOnInputObjectTypes(oldSchema,newSchema))}function findFieldsThatChangedTypeOnObjectOrInterfaceTypes(oldSchema,newSchema){var oldTypeMap=oldSchema.getTypeMap(),newTypeMap=newSchema.getTypeMap(),breakingFieldChanges=[];return Object.keys(oldTypeMap).forEach(function(typeName){var oldType=oldTypeMap[typeName],newType=newTypeMap[typeName];if((oldType instanceof _definition.GraphQLObjectType||oldType instanceof _definition.GraphQLInterfaceType)&&newType instanceof oldType.constructor){var oldTypeFieldsDef=oldType.getFields(),newTypeFieldsDef=newType.getFields();Object.keys(oldTypeFieldsDef).forEach(function(fieldName){if(fieldName in newTypeFieldsDef){var oldFieldType=oldTypeFieldsDef[fieldName].type,newFieldType=newTypeFieldsDef[fieldName].type;if(!isChangeSafeForObjectOrInterfaceField(oldFieldType,newFieldType)){var oldFieldTypeString=(0,_definition.isNamedType)(oldFieldType)?oldFieldType.name:oldFieldType.toString(),newFieldTypeString=(0,_definition.isNamedType)(newFieldType)?newFieldType.name:newFieldType.toString();breakingFieldChanges.push({type:BreakingChangeType.FIELD_CHANGED_KIND,description:typeName+"."+fieldName+" changed type from "+oldFieldTypeString+" to "+newFieldTypeString+"."})}}else breakingFieldChanges.push({type:BreakingChangeType.FIELD_REMOVED,description:typeName+"."+fieldName+" was removed."})})}}),breakingFieldChanges}function findFieldsThatChangedTypeOnInputObjectTypes(oldSchema,newSchema){var oldTypeMap=oldSchema.getTypeMap(),newTypeMap=newSchema.getTypeMap(),breakingFieldChanges=[];return Object.keys(oldTypeMap).forEach(function(typeName){var oldType=oldTypeMap[typeName],newType=newTypeMap[typeName];if(oldType instanceof _definition.GraphQLInputObjectType&&newType instanceof _definition.GraphQLInputObjectType){var oldTypeFieldsDef=oldType.getFields(),newTypeFieldsDef=newType.getFields();Object.keys(oldTypeFieldsDef).forEach(function(fieldName){if(fieldName in newTypeFieldsDef){var oldFieldType=oldTypeFieldsDef[fieldName].type,newFieldType=newTypeFieldsDef[fieldName].type;if(!isChangeSafeForInputObjectFieldOrFieldArg(oldFieldType,newFieldType)){var oldFieldTypeString=(0,_definition.isNamedType)(oldFieldType)?oldFieldType.name:oldFieldType.toString(),newFieldTypeString=(0,_definition.isNamedType)(newFieldType)?newFieldType.name:newFieldType.toString();breakingFieldChanges.push({type:BreakingChangeType.FIELD_CHANGED_KIND,description:typeName+"."+fieldName+" changed type from "+oldFieldTypeString+" to "+newFieldTypeString+"."})}}else breakingFieldChanges.push({type:BreakingChangeType.FIELD_REMOVED,description:typeName+"."+fieldName+" was removed."})}),Object.keys(newTypeFieldsDef).forEach(function(fieldName){!(fieldName in oldTypeFieldsDef)&&newTypeFieldsDef[fieldName].type instanceof _definition.GraphQLNonNull&&breakingFieldChanges.push({type:BreakingChangeType.NON_NULL_INPUT_FIELD_ADDED,description:"A non-null field "+fieldName+" on input type "+newType.name+" was added."})})}}),breakingFieldChanges}function isChangeSafeForObjectOrInterfaceField(oldType,newType){return(0,_definition.isNamedType)(oldType)?(0,_definition.isNamedType)(newType)&&oldType.name===newType.name||newType instanceof _definition.GraphQLNonNull&&isChangeSafeForObjectOrInterfaceField(oldType,newType.ofType):oldType instanceof _definition.GraphQLList?newType instanceof _definition.GraphQLList&&isChangeSafeForObjectOrInterfaceField(oldType.ofType,newType.ofType)||newType instanceof _definition.GraphQLNonNull&&isChangeSafeForObjectOrInterfaceField(oldType,newType.ofType):oldType instanceof _definition.GraphQLNonNull&&(newType instanceof _definition.GraphQLNonNull&&isChangeSafeForObjectOrInterfaceField(oldType.ofType,newType.ofType))}function isChangeSafeForInputObjectFieldOrFieldArg(oldType,newType){return(0,_definition.isNamedType)(oldType)?(0,_definition.isNamedType)(newType)&&oldType.name===newType.name:oldType instanceof _definition.GraphQLList?newType instanceof _definition.GraphQLList&&isChangeSafeForInputObjectFieldOrFieldArg(oldType.ofType,newType.ofType):oldType instanceof _definition.GraphQLNonNull&&(newType instanceof _definition.GraphQLNonNull&&isChangeSafeForInputObjectFieldOrFieldArg(oldType.ofType,newType.ofType)||!(newType instanceof _definition.GraphQLNonNull)&&isChangeSafeForInputObjectFieldOrFieldArg(oldType.ofType,newType))}function findTypesRemovedFromUnions(oldSchema,newSchema){var oldTypeMap=oldSchema.getTypeMap(),newTypeMap=newSchema.getTypeMap(),typesRemovedFromUnion=[];return Object.keys(oldTypeMap).forEach(function(typeName){var oldType=oldTypeMap[typeName],newType=newTypeMap[typeName];if(oldType instanceof _definition.GraphQLUnionType&&newType instanceof _definition.GraphQLUnionType){var typeNamesInNewUnion=Object.create(null);newType.getTypes().forEach(function(type){typeNamesInNewUnion[type.name]=!0}),oldType.getTypes().forEach(function(type){typeNamesInNewUnion[type.name]||typesRemovedFromUnion.push({type:BreakingChangeType.TYPE_REMOVED_FROM_UNION,description:type.name+" was removed from union type "+typeName+"."})})}}),typesRemovedFromUnion}function findValuesRemovedFromEnums(oldSchema,newSchema){var oldTypeMap=oldSchema.getTypeMap(),newTypeMap=newSchema.getTypeMap(),valuesRemovedFromEnums=[];return Object.keys(oldTypeMap).forEach(function(typeName){var oldType=oldTypeMap[typeName],newType=newTypeMap[typeName];if(oldType instanceof _definition.GraphQLEnumType&&newType instanceof _definition.GraphQLEnumType){var valuesInNewEnum=Object.create(null);newType.getValues().forEach(function(value){valuesInNewEnum[value.name]=!0}),oldType.getValues().forEach(function(value){valuesInNewEnum[value.name]||valuesRemovedFromEnums.push({type:BreakingChangeType.VALUE_REMOVED_FROM_ENUM,description:value.name+" was removed from enum type "+typeName+"."})})}}),valuesRemovedFromEnums}function findInterfacesRemovedFromObjectTypes(oldSchema,newSchema){var oldTypeMap=oldSchema.getTypeMap(),newTypeMap=newSchema.getTypeMap(),breakingChanges=[];return Object.keys(oldTypeMap).forEach(function(typeName){var oldType=oldTypeMap[typeName],newType=newTypeMap[typeName];if(oldType instanceof _definition.GraphQLObjectType&&newType instanceof _definition.GraphQLObjectType){var oldInterfaces=oldType.getInterfaces(),newInterfaces=newType.getInterfaces();oldInterfaces.forEach(function(oldInterface){newInterfaces.some(function(int){return int.name===oldInterface.name})||breakingChanges.push({type:BreakingChangeType.INTERFACE_REMOVED_FROM_OBJECT,description:typeName+" no longer implements interface "+oldInterface.name+"."})})}}),breakingChanges}Object.defineProperty(exports,"__esModule",{value:!0}),exports.DangerousChangeType=exports.BreakingChangeType=void 0,exports.findBreakingChanges=function(oldSchema,newSchema){return[].concat(findRemovedTypes(oldSchema,newSchema),findTypesThatChangedKind(oldSchema,newSchema),findFieldsThatChangedType(oldSchema,newSchema),findTypesRemovedFromUnions(oldSchema,newSchema),findValuesRemovedFromEnums(oldSchema,newSchema),findArgChanges(oldSchema,newSchema).breakingChanges,findInterfacesRemovedFromObjectTypes(oldSchema,newSchema))},exports.findDangerousChanges=function(oldSchema,newSchema){return[].concat(findArgChanges(oldSchema,newSchema).dangerousChanges)},exports.findRemovedTypes=findRemovedTypes,exports.findTypesThatChangedKind=findTypesThatChangedKind,exports.findArgChanges=findArgChanges,exports.findFieldsThatChangedType=findFieldsThatChangedType,exports.findFieldsThatChangedTypeOnInputObjectTypes=findFieldsThatChangedTypeOnInputObjectTypes,exports.findTypesRemovedFromUnions=findTypesRemovedFromUnions,exports.findValuesRemovedFromEnums=findValuesRemovedFromEnums,exports.findInterfacesRemovedFromObjectTypes=findInterfacesRemovedFromObjectTypes;var _definition=require("../type/definition"),BreakingChangeType=(require("../type/schema"),exports.BreakingChangeType={FIELD_CHANGED_KIND:"FIELD_CHANGED_KIND",FIELD_REMOVED:"FIELD_REMOVED",TYPE_CHANGED_KIND:"TYPE_CHANGED_KIND",TYPE_REMOVED:"TYPE_REMOVED",TYPE_REMOVED_FROM_UNION:"TYPE_REMOVED_FROM_UNION",VALUE_REMOVED_FROM_ENUM:"VALUE_REMOVED_FROM_ENUM",ARG_REMOVED:"ARG_REMOVED",ARG_CHANGED_KIND:"ARG_CHANGED_KIND",NON_NULL_ARG_ADDED:"NON_NULL_ARG_ADDED",NON_NULL_INPUT_FIELD_ADDED:"NON_NULL_INPUT_FIELD_ADDED",INTERFACE_REMOVED_FROM_OBJECT:"INTERFACE_REMOVED_FROM_OBJECT"}),DangerousChangeType=exports.DangerousChangeType={ARG_DEFAULT_VALUE_CHANGE:"ARG_DEFAULT_VALUE_CHANGE"}},{"../type/definition":115,"../type/schema":120}],129:[function(require,module,exports){"use strict";Object.defineProperty(exports,"__esModule",{value:!0}),exports.findDeprecatedUsages=function(schema,ast){var errors=[],typeInfo=new _TypeInfo.TypeInfo(schema);return(0,_visitor.visit)(ast,(0,_visitor.visitWithTypeInfo)(typeInfo,{Field:function(node){var fieldDef=typeInfo.getFieldDef();if(fieldDef&&fieldDef.isDeprecated){var parentType=typeInfo.getParentType();if(parentType){var reason=fieldDef.deprecationReason;errors.push(new _GraphQLError.GraphQLError("The field "+parentType.name+"."+fieldDef.name+" is deprecated."+(reason?" "+reason:""),[node]))}}},EnumValue:function(node){var enumVal=typeInfo.getEnumValue();if(enumVal&&enumVal.isDeprecated){var type=(0,_definition.getNamedType)(typeInfo.getInputType());if(type){var reason=enumVal.deprecationReason;errors.push(new _GraphQLError.GraphQLError("The enum value "+type.name+"."+enumVal.name+" is deprecated."+(reason?" "+reason:""),[node]))}}}})),errors};var _GraphQLError=require("../error/GraphQLError"),_visitor=require("../language/visitor"),_definition=require("../type/definition"),_TypeInfo=(require("../type/schema"),require("./TypeInfo"))},{"../error/GraphQLError":86,"../language/visitor":111,"../type/definition":115,"../type/schema":120,"./TypeInfo":121}],130:[function(require,module,exports){"use strict";Object.defineProperty(exports,"__esModule",{value:!0}),exports.getOperationAST=function(documentAST,operationName){for(var operation=null,i=0;i<documentAST.definitions.length;i++){var definition=documentAST.definitions[i];if(definition.kind===_kinds.OPERATION_DEFINITION)if(operationName){if(definition.name&&definition.name.value===operationName)return definition}else{if(operation)return null;operation=definition}}return operation};var _kinds=require("../language/kinds")},{"../language/kinds":105}],131:[function(require,module,exports){"use strict";Object.defineProperty(exports,"__esModule",{value:!0});var _introspectionQuery=require("./introspectionQuery");Object.defineProperty(exports,"introspectionQuery",{enumerable:!0,get:function(){return _introspectionQuery.introspectionQuery}});var _getOperationAST=require("./getOperationAST");Object.defineProperty(exports,"getOperationAST",{enumerable:!0,get:function(){return _getOperationAST.getOperationAST}});var _buildClientSchema=require("./buildClientSchema");Object.defineProperty(exports,"buildClientSchema",{enumerable:!0,get:function(){return _buildClientSchema.buildClientSchema}});var _buildASTSchema=require("./buildASTSchema");Object.defineProperty(exports,"buildASTSchema",{enumerable:!0,get:function(){return _buildASTSchema.buildASTSchema}}),Object.defineProperty(exports,"buildSchema",{enumerable:!0,get:function(){return _buildASTSchema.buildSchema}});var _extendSchema=require("./extendSchema");Object.defineProperty(exports,"extendSchema",{enumerable:!0,get:function(){return _extendSchema.extendSchema}});var _schemaPrinter=require("./schemaPrinter");Object.defineProperty(exports,"printSchema",{enumerable:!0,get:function(){return _schemaPrinter.printSchema}}),Object.defineProperty(exports,"printType",{enumerable:!0,get:function(){return _schemaPrinter.printType}}),Object.defineProperty(exports,"printIntrospectionSchema",{enumerable:!0,get:function(){return _schemaPrinter.printIntrospectionSchema}});var _typeFromAST=require("./typeFromAST");Object.defineProperty(exports,"typeFromAST",{enumerable:!0,get:function(){return _typeFromAST.typeFromAST}});var _valueFromAST=require("./valueFromAST");Object.defineProperty(exports,"valueFromAST",{enumerable:!0,get:function(){return _valueFromAST.valueFromAST}});var _astFromValue=require("./astFromValue");Object.defineProperty(exports,"astFromValue",{enumerable:!0,get:function(){return _astFromValue.astFromValue}});var _TypeInfo=require("./TypeInfo");Object.defineProperty(exports,"TypeInfo",{enumerable:!0,get:function(){return _TypeInfo.TypeInfo}});var _isValidJSValue=require("./isValidJSValue");Object.defineProperty(exports,"isValidJSValue",{enumerable:!0,get:function(){return _isValidJSValue.isValidJSValue}});var _isValidLiteralValue=require("./isValidLiteralValue");Object.defineProperty(exports,"isValidLiteralValue",{enumerable:!0,get:function(){return _isValidLiteralValue.isValidLiteralValue}});var _concatAST=require("./concatAST");Object.defineProperty(exports,"concatAST",{enumerable:!0,get:function(){return _concatAST.concatAST}});var _separateOperations=require("./separateOperations");Object.defineProperty(exports,"separateOperations",{enumerable:!0,get:function(){return _separateOperations.separateOperations}});var _typeComparators=require("./typeComparators");Object.defineProperty(exports,"isEqualType",{enumerable:!0,get:function(){return _typeComparators.isEqualType}}),Object.defineProperty(exports,"isTypeSubTypeOf",{enumerable:!0,get:function(){return _typeComparators.isTypeSubTypeOf}}),Object.defineProperty(exports,"doTypesOverlap",{enumerable:!0,get:function(){return _typeComparators.doTypesOverlap}});var _assertValidName=require("./assertValidName");Object.defineProperty(exports,"assertValidName",{enumerable:!0,get:function(){return _assertValidName.assertValidName}});var _findBreakingChanges=require("./findBreakingChanges");Object.defineProperty(exports,"BreakingChangeType",{enumerable:!0,get:function(){return _findBreakingChanges.BreakingChangeType}}),Object.defineProperty(exports,"DangerousChangeType",{enumerable:!0,get:function(){return _findBreakingChanges.DangerousChangeType}}),Object.defineProperty(exports,"findBreakingChanges",{enumerable:!0,get:function(){return _findBreakingChanges.findBreakingChanges}});var _findDeprecatedUsages=require("./findDeprecatedUsages");Object.defineProperty(exports,"findDeprecatedUsages",{enumerable:!0,get:function(){return _findDeprecatedUsages.findDeprecatedUsages}})},{"./TypeInfo":121,"./assertValidName":122,"./astFromValue":123,"./buildASTSchema":124,"./buildClientSchema":125,"./concatAST":126,"./extendSchema":127,"./findBreakingChanges":128,"./findDeprecatedUsages":129,"./getOperationAST":130,"./introspectionQuery":132,"./isValidJSValue":133,"./isValidLiteralValue":134,"./schemaPrinter":135,"./separateOperations":136,"./typeComparators":137,"./typeFromAST":138,"./valueFromAST":139}],132:[function(require,module,exports){"use strict";Object.defineProperty(exports,"__esModule",{value:!0});exports.introspectionQuery="\n  query IntrospectionQuery {\n    __schema {\n      queryType { name }\n      mutationType { name }\n      subscriptionType { name }\n      types {\n        ...FullType\n      }\n      directives {\n        name\n        description\n        locations\n        args {\n          ...InputValue\n        }\n      }\n    }\n  }\n\n  fragment FullType on __Type {\n    kind\n    name\n    description\n    fields(includeDeprecated: true) {\n      name\n      description\n      args {\n        ...InputValue\n      }\n      type {\n        ...TypeRef\n      }\n      isDeprecated\n      deprecationReason\n    }\n    inputFields {\n      ...InputValue\n    }\n    interfaces {\n      ...TypeRef\n    }\n    enumValues(includeDeprecated: true) {\n      name\n      description\n      isDeprecated\n      deprecationReason\n    }\n    possibleTypes {\n      ...TypeRef\n    }\n  }\n\n  fragment InputValue on __InputValue {\n    name\n    description\n    type { ...TypeRef }\n    defaultValue\n  }\n\n  fragment TypeRef on __Type {\n    kind\n    name\n    ofType {\n      kind\n      name\n      ofType {\n        kind\n        name\n        ofType {\n          kind\n          name\n          ofType {\n            kind\n            name\n            ofType {\n              kind\n              name\n              ofType {\n                kind\n                name\n                ofType {\n                  kind\n                  name\n                }\n              }\n            }\n          }\n        }\n      }\n    }\n  }\n"},{}],133:[function(require,module,exports){"use strict";function _interopRequireDefault(obj){return obj&&obj.__esModule?obj:{default:obj}}function isValidJSValue(value,type){if(type instanceof _definition.GraphQLNonNull)return(0,_isNullish2.default)(value)?['Expected "'+String(type)+'", found null.']:isValidJSValue(value,type.ofType);if((0,_isNullish2.default)(value))return[];if(type instanceof _definition.GraphQLList){var itemType=type.ofType;if((0,_iterall.isCollection)(value)){var errors=[];return(0,_iterall.forEach)(value,function(item,index){errors.push.apply(errors,isValidJSValue(item,itemType).map(function(error){return"In element #"+index+": "+error}))}),errors}return isValidJSValue(value,itemType)}if(type instanceof _definition.GraphQLInputObjectType){if("object"!=typeof value||null===value)return['Expected "'+type.name+'", found not an object.'];var fields=type.getFields(),_errors=[];return Object.keys(value).forEach(function(providedField){fields[providedField]||_errors.push('In field "'+providedField+'": Unknown field.')}),Object.keys(fields).forEach(function(fieldName){var newErrors=isValidJSValue(value[fieldName],fields[fieldName].type);_errors.push.apply(_errors,newErrors.map(function(error){return'In field "'+fieldName+'": '+error}))}),_errors}(0,_invariant2.default)(type instanceof _definition.GraphQLScalarType||type instanceof _definition.GraphQLEnumType,"Must be input type");try{var parseResult=type.parseValue(value);if((0,_isNullish2.default)(parseResult)&&!type.isValidValue(value))return['Expected type "'+type.name+'", found '+JSON.stringify(value)+"."]}catch(error){return['Expected type "'+type.name+'", found '+JSON.stringify(value)+": "+error.message]}return[]}Object.defineProperty(exports,"__esModule",{value:!0}),exports.isValidJSValue=isValidJSValue;var _iterall=require("iterall"),_invariant2=_interopRequireDefault(require("../jsutils/invariant")),_isNullish2=_interopRequireDefault(require("../jsutils/isNullish")),_definition=require("../type/definition")},{"../jsutils/invariant":97,"../jsutils/isNullish":99,"../type/definition":115,iterall:169}],134:[function(require,module,exports){"use strict";function _interopRequireDefault(obj){return obj&&obj.__esModule?obj:{default:obj}}function isValidLiteralValue(type,valueNode){if(type instanceof _definition.GraphQLNonNull)return valueNode&&valueNode.kind!==Kind.NULL?isValidLiteralValue(type.ofType,valueNode):['Expected "'+String(type)+'", found null.'];if(!valueNode||valueNode.kind===Kind.NULL)return[];if(valueNode.kind===Kind.VARIABLE)return[];if(type instanceof _definition.GraphQLList){var itemType=type.ofType;return valueNode.kind===Kind.LIST?valueNode.values.reduce(function(acc,item,index){var errors=isValidLiteralValue(itemType,item);return acc.concat(errors.map(function(error){return"In element #"+index+": "+error}))},[]):isValidLiteralValue(itemType,valueNode)}if(type instanceof _definition.GraphQLInputObjectType){if(valueNode.kind!==Kind.OBJECT)return['Expected "'+type.name+'", found not an object.'];var fields=type.getFields(),errors=[],fieldNodes=valueNode.fields;fieldNodes.forEach(function(providedFieldNode){fields[providedFieldNode.name.value]||errors.push('In field "'+providedFieldNode.name.value+'": Unknown field.')});var fieldNodeMap=(0,_keyMap2.default)(fieldNodes,function(fieldNode){return fieldNode.name.value});return Object.keys(fields).forEach(function(fieldName){var result=isValidLiteralValue(fields[fieldName].type,fieldNodeMap[fieldName]&&fieldNodeMap[fieldName].value);errors.push.apply(errors,result.map(function(error){return'In field "'+fieldName+'": '+error}))}),errors}return(0,_invariant2.default)(type instanceof _definition.GraphQLScalarType||type instanceof _definition.GraphQLEnumType,"Must be input type"),type.isValidLiteral(valueNode)?[]:['Expected type "'+type.name+'", found '+(0,_printer.print)(valueNode)+"."]}Object.defineProperty(exports,"__esModule",{value:!0}),exports.isValidLiteralValue=isValidLiteralValue;var _printer=require("../language/printer"),Kind=function(obj){if(obj&&obj.__esModule)return obj;var newObj={};if(null!=obj)for(var key in obj)Object.prototype.hasOwnProperty.call(obj,key)&&(newObj[key]=obj[key]);return newObj.default=obj,newObj}(require("../language/kinds")),_definition=require("../type/definition"),_invariant2=_interopRequireDefault(require("../jsutils/invariant")),_keyMap2=_interopRequireDefault(require("../jsutils/keyMap"))},{"../jsutils/invariant":97,"../jsutils/keyMap":100,"../language/kinds":105,"../language/printer":109,"../type/definition":115}],135:[function(require,module,exports){"use strict";function _interopRequireDefault(obj){return obj&&obj.__esModule?obj:{default:obj}}function isSpecDirective(directiveName){return"skip"===directiveName||"include"===directiveName||"deprecated"===directiveName}function isDefinedType(typename){return!isIntrospectionType(typename)&&!isBuiltInScalar(typename)}function isIntrospectionType(typename){return 0===typename.indexOf("__")}function isBuiltInScalar(typename){return"String"===typename||"Boolean"===typename||"Int"===typename||"Float"===typename||"ID"===typename}function printFilteredSchema(schema,directiveFilter,typeFilter){var directives=schema.getDirectives().filter(function(directive){return directiveFilter(directive.name)}),typeMap=schema.getTypeMap(),types=Object.keys(typeMap).filter(typeFilter).sort(function(name1,name2){return name1.localeCompare(name2)}).map(function(typeName){return typeMap[typeName]});return[printSchemaDefinition(schema)].concat(directives.map(printDirective),types.map(printType)).filter(Boolean).join("\n\n")+"\n"}function printSchemaDefinition(schema){if(!isSchemaOfCommonNames(schema)){var operationTypes=[],queryType=schema.getQueryType();queryType&&operationTypes.push("  query: "+queryType.name);var mutationType=schema.getMutationType();mutationType&&operationTypes.push("  mutation: "+mutationType.name);var subscriptionType=schema.getSubscriptionType();return subscriptionType&&operationTypes.push("  subscription: "+subscriptionType.name),"schema {\n"+operationTypes.join("\n")+"\n}"}}function isSchemaOfCommonNames(schema){var queryType=schema.getQueryType();if(queryType&&"Query"!==queryType.name)return!1;var mutationType=schema.getMutationType();if(mutationType&&"Mutation"!==mutationType.name)return!1;var subscriptionType=schema.getSubscriptionType();return!subscriptionType||"Subscription"===subscriptionType.name}function printType(type){return type instanceof _definition.GraphQLScalarType?printScalar(type):type instanceof _definition.GraphQLObjectType?printObject(type):type instanceof _definition.GraphQLInterfaceType?printInterface(type):type instanceof _definition.GraphQLUnionType?printUnion(type):type instanceof _definition.GraphQLEnumType?printEnum(type):((0,_invariant2.default)(type instanceof _definition.GraphQLInputObjectType),printInputObject(type))}function printScalar(type){return printDescription(type)+"scalar "+type.name}function printObject(type){var interfaces=type.getInterfaces(),implementedInterfaces=interfaces.length?" implements "+interfaces.map(function(i){return i.name}).join(", "):"";return printDescription(type)+"type "+type.name+implementedInterfaces+" {\n"+printFields(type)+"\n}"}function printInterface(type){return printDescription(type)+"interface "+type.name+" {\n"+printFields(type)+"\n}"}function printUnion(type){return printDescription(type)+"union "+type.name+" = "+type.getTypes().join(" | ")}function printEnum(type){return printDescription(type)+"enum "+type.name+" {\n"+printEnumValues(type.getValues())+"\n}"}function printEnumValues(values){return values.map(function(value,i){return printDescription(value,"  ",!i)+"  "+value.name+printDeprecated(value)}).join("\n")}function printInputObject(type){var fieldMap=type.getFields(),fields=Object.keys(fieldMap).map(function(fieldName){return fieldMap[fieldName]});return printDescription(type)+"input "+type.name+" {\n"+fields.map(function(f,i){return printDescription(f,"  ",!i)+"  "+printInputValue(f)}).join("\n")+"\n}"}function printFields(type){var fieldMap=type.getFields();return Object.keys(fieldMap).map(function(fieldName){return fieldMap[fieldName]}).map(function(f,i){return printDescription(f,"  ",!i)+"  "+f.name+printArgs(f.args,"  ")+": "+String(f.type)+printDeprecated(f)}).join("\n")}function printArgs(args){var indentation=arguments.length>1&&void 0!==arguments[1]?arguments[1]:"";return 0===args.length?"":args.every(function(arg){return!arg.description})?"("+args.map(printInputValue).join(", ")+")":"(\n"+args.map(function(arg,i){return printDescription(arg,"  "+indentation,!i)+"  "+indentation+printInputValue(arg)}).join("\n")+"\n"+indentation+")"}function printInputValue(arg){var argDecl=arg.name+": "+String(arg.type);return(0,_isInvalid2.default)(arg.defaultValue)||(argDecl+=" = "+(0,_printer.print)((0,_astFromValue.astFromValue)(arg.defaultValue,arg.type))),argDecl}function printDirective(directive){return printDescription(directive)+"directive @"+directive.name+printArgs(directive.args)+" on "+directive.locations.join(" | ")}function printDeprecated(fieldOrEnumVal){var reason=fieldOrEnumVal.deprecationReason;return(0,_isNullish2.default)(reason)?"":""===reason||reason===_directives.DEFAULT_DEPRECATION_REASON?" @deprecated":" @deprecated(reason: "+(0,_printer.print)((0,_astFromValue.astFromValue)(reason,_scalars.GraphQLString))+")"}function printDescription(def){var indentation=arguments.length>1&&void 0!==arguments[1]?arguments[1]:"",firstInBlock=!(arguments.length>2&&void 0!==arguments[2])||arguments[2];if(!def.description)return"";for(var lines=def.description.split("\n"),description=indentation&&!firstInBlock?"\n":"",i=0;i<lines.length;i++)if(""===lines[i])description+=indentation+"#\n";else for(var sublines=breakLine(lines[i],120-indentation.length),j=0;j<sublines.length;j++)description+=indentation+"# "+sublines[j]+"\n";return description}function breakLine(line,len){if(line.length<len+5)return[line];var parts=line.split(new RegExp("((?: |^).{15,"+(len-40)+"}(?= |$))"));if(parts.length<4)return[line];for(var sublines=[parts[0]+parts[1]+parts[2]],i=3;i<parts.length;i+=2)sublines.push(parts[i].slice(1)+parts[i+1]);return sublines}Object.defineProperty(exports,"__esModule",{value:!0}),exports.printSchema=function(schema){return printFilteredSchema(schema,function(n){return!isSpecDirective(n)},isDefinedType)},exports.printIntrospectionSchema=function(schema){return printFilteredSchema(schema,isSpecDirective,isIntrospectionType)},exports.printType=printType;var _invariant2=_interopRequireDefault(require("../jsutils/invariant")),_isNullish2=_interopRequireDefault(require("../jsutils/isNullish")),_isInvalid2=_interopRequireDefault(require("../jsutils/isInvalid")),_astFromValue=require("../utilities/astFromValue"),_printer=require("../language/printer"),_definition=require("../type/definition"),_scalars=require("../type/scalars"),_directives=require("../type/directives")},{"../jsutils/invariant":97,"../jsutils/isInvalid":98,"../jsutils/isNullish":99,"../language/printer":109,"../type/definition":115,"../type/directives":116,"../type/scalars":119,"../utilities/astFromValue":123}],136:[function(require,module,exports){"use strict";function opName(operation){return operation.name?operation.name.value:""}function collectTransitiveDependencies(collected,depGraph,fromName){var immediateDeps=depGraph[fromName];immediateDeps&&Object.keys(immediateDeps).forEach(function(toName){collected[toName]||(collected[toName]=!0,collectTransitiveDependencies(collected,depGraph,toName))})}Object.defineProperty(exports,"__esModule",{value:!0}),exports.separateOperations=function(documentAST){var operations=[],fragments=Object.create(null),positions=new Map,depGraph=Object.create(null),fromName=void 0,idx=0;(0,_visitor.visit)(documentAST,{OperationDefinition:function(node){fromName=opName(node),operations.push(node),positions.set(node,idx++)},FragmentDefinition:function(node){fromName=node.name.value,fragments[fromName]=node,positions.set(node,idx++)},FragmentSpread:function(node){var toName=node.name.value;(depGraph[fromName]||(depGraph[fromName]=Object.create(null)))[toName]=!0}});var separatedDocumentASTs=Object.create(null);return operations.forEach(function(operation){var operationName=opName(operation),dependencies=Object.create(null);collectTransitiveDependencies(dependencies,depGraph,operationName);var definitions=[operation];Object.keys(dependencies).forEach(function(name){definitions.push(fragments[name])}),definitions.sort(function(n1,n2){return(positions.get(n1)||0)-(positions.get(n2)||0)}),separatedDocumentASTs[operationName]={kind:"Document",definitions:definitions}}),separatedDocumentASTs};var _visitor=require("../language/visitor")},{"../language/visitor":111}],137:[function(require,module,exports){"use strict";function isEqualType(typeA,typeB){return typeA===typeB||(typeA instanceof _definition.GraphQLNonNull&&typeB instanceof _definition.GraphQLNonNull?isEqualType(typeA.ofType,typeB.ofType):typeA instanceof _definition.GraphQLList&&typeB instanceof _definition.GraphQLList&&isEqualType(typeA.ofType,typeB.ofType))}function isTypeSubTypeOf(schema,maybeSubType,superType){return maybeSubType===superType||(superType instanceof _definition.GraphQLNonNull?maybeSubType instanceof _definition.GraphQLNonNull&&isTypeSubTypeOf(schema,maybeSubType.ofType,superType.ofType):maybeSubType instanceof _definition.GraphQLNonNull?isTypeSubTypeOf(schema,maybeSubType.ofType,superType):superType instanceof _definition.GraphQLList?maybeSubType instanceof _definition.GraphQLList&&isTypeSubTypeOf(schema,maybeSubType.ofType,superType.ofType):!(maybeSubType instanceof _definition.GraphQLList)&&!!((0,_definition.isAbstractType)(superType)&&maybeSubType instanceof _definition.GraphQLObjectType&&schema.isPossibleType(superType,maybeSubType)))}Object.defineProperty(exports,"__esModule",{value:!0}),exports.isEqualType=isEqualType,exports.isTypeSubTypeOf=isTypeSubTypeOf,exports.doTypesOverlap=function(schema,typeA,typeB){var _typeB=typeB;return typeA===_typeB||((0,_definition.isAbstractType)(typeA)?(0,_definition.isAbstractType)(_typeB)?schema.getPossibleTypes(typeA).some(function(type){return schema.isPossibleType(_typeB,type)}):schema.isPossibleType(typeA,_typeB):!!(0,_definition.isAbstractType)(_typeB)&&schema.isPossibleType(_typeB,typeA))};var _definition=require("../type/definition")},{"../type/definition":115}],138:[function(require,module,exports){"use strict";Object.defineProperty(exports,"__esModule",{value:!0}),exports.typeFromAST=void 0;var _invariant2=function(obj){return obj&&obj.__esModule?obj:{default:obj}}(require("../jsutils/invariant")),Kind=function(obj){if(obj&&obj.__esModule)return obj;var newObj={};if(null!=obj)for(var key in obj)Object.prototype.hasOwnProperty.call(obj,key)&&(newObj[key]=obj[key]);return newObj.default=obj,newObj}(require("../language/kinds")),_definition=require("../type/definition"),typeFromAST=exports.typeFromAST=function(schema,typeNode){var innerType=void 0;return typeNode.kind===Kind.LIST_TYPE?(innerType=typeFromAST(schema,typeNode.type))&&new _definition.GraphQLList(innerType):typeNode.kind===Kind.NON_NULL_TYPE?(innerType=typeFromAST(schema,typeNode.type))&&new _definition.GraphQLNonNull(innerType):((0,_invariant2.default)(typeNode.kind===Kind.NAMED_TYPE,"Must be a named type."),schema.getType(typeNode.name.value))}},{"../jsutils/invariant":97,"../language/kinds":105,"../type/definition":115}],139:[function(require,module,exports){"use strict";function _interopRequireDefault(obj){return obj&&obj.__esModule?obj:{default:obj}}function valueFromAST(valueNode,type,variables){if(valueNode){if(type instanceof _definition.GraphQLNonNull){if(valueNode.kind===Kind.NULL)return;return valueFromAST(valueNode,type.ofType,variables)}if(valueNode.kind===Kind.NULL)return null;if(valueNode.kind===Kind.VARIABLE){var variableName=valueNode.name.value;if(!variables||(0,_isInvalid2.default)(variables[variableName]))return;return variables[variableName]}if(type instanceof _definition.GraphQLList){var itemType=type.ofType;if(valueNode.kind===Kind.LIST){for(var coercedValues=[],itemNodes=valueNode.values,i=0;i<itemNodes.length;i++)if(isMissingVariable(itemNodes[i],variables)){if(itemType instanceof _definition.GraphQLNonNull)return;coercedValues.push(null)}else{var itemValue=valueFromAST(itemNodes[i],itemType,variables);if((0,_isInvalid2.default)(itemValue))return;coercedValues.push(itemValue)}return coercedValues}var coercedValue=valueFromAST(valueNode,itemType,variables);if((0,_isInvalid2.default)(coercedValue))return;return[coercedValue]}if(type instanceof _definition.GraphQLInputObjectType){if(valueNode.kind!==Kind.OBJECT)return;for(var coercedObj=Object.create(null),fields=type.getFields(),fieldNodes=(0,_keyMap2.default)(valueNode.fields,function(field){return field.name.value}),fieldNames=Object.keys(fields),_i=0;_i<fieldNames.length;_i++){var fieldName=fieldNames[_i],field=fields[fieldName],fieldNode=fieldNodes[fieldName];if(fieldNode&&!isMissingVariable(fieldNode.value,variables)){var fieldValue=valueFromAST(fieldNode.value,field.type,variables);if((0,_isInvalid2.default)(fieldValue))return;coercedObj[fieldName]=fieldValue}else if((0,_isInvalid2.default)(field.defaultValue)){if(field.type instanceof _definition.GraphQLNonNull)return}else coercedObj[fieldName]=field.defaultValue}return coercedObj}(0,_invariant2.default)(type instanceof _definition.GraphQLScalarType||type instanceof _definition.GraphQLEnumType,"Must be input type");var parsed=type.parseLiteral(valueNode);if(!(0,_isNullish2.default)(parsed)||type.isValidLiteral(valueNode))return parsed}}function isMissingVariable(valueNode,variables){return valueNode.kind===Kind.VARIABLE&&(!variables||(0,_isInvalid2.default)(variables[valueNode.name.value]))}Object.defineProperty(exports,"__esModule",{value:!0}),exports.valueFromAST=valueFromAST;var _keyMap2=_interopRequireDefault(require("../jsutils/keyMap")),_invariant2=_interopRequireDefault(require("../jsutils/invariant")),_isNullish2=_interopRequireDefault(require("../jsutils/isNullish")),_isInvalid2=_interopRequireDefault(require("../jsutils/isInvalid")),Kind=function(obj){if(obj&&obj.__esModule)return obj;var newObj={};if(null!=obj)for(var key in obj)Object.prototype.hasOwnProperty.call(obj,key)&&(newObj[key]=obj[key]);return newObj.default=obj,newObj}(require("../language/kinds")),_definition=require("../type/definition")},{"../jsutils/invariant":97,"../jsutils/isInvalid":98,"../jsutils/isNullish":99,"../jsutils/keyMap":100,"../language/kinds":105,"../type/definition":115}],140:[function(require,module,exports){"use strict";Object.defineProperty(exports,"__esModule",{value:!0});var _validate=require("./validate");Object.defineProperty(exports,"validate",{enumerable:!0,get:function(){return _validate.validate}}),Object.defineProperty(exports,"ValidationContext",{enumerable:!0,get:function(){return _validate.ValidationContext}});var _specifiedRules=require("./specifiedRules");Object.defineProperty(exports,"specifiedRules",{enumerable:!0,get:function(){return _specifiedRules.specifiedRules}});var _ArgumentsOfCorrectType=require("./rules/ArgumentsOfCorrectType");Object.defineProperty(exports,"ArgumentsOfCorrectTypeRule",{enumerable:!0,get:function(){return _ArgumentsOfCorrectType.ArgumentsOfCorrectType}});var _DefaultValuesOfCorrectType=require("./rules/DefaultValuesOfCorrectType");Object.defineProperty(exports,"DefaultValuesOfCorrectTypeRule",{enumerable:!0,get:function(){return _DefaultValuesOfCorrectType.DefaultValuesOfCorrectType}});var _FieldsOnCorrectType=require("./rules/FieldsOnCorrectType");Object.defineProperty(exports,"FieldsOnCorrectTypeRule",{enumerable:!0,get:function(){return _FieldsOnCorrectType.FieldsOnCorrectType}});var _FragmentsOnCompositeTypes=require("./rules/FragmentsOnCompositeTypes");Object.defineProperty(exports,"FragmentsOnCompositeTypesRule",{enumerable:!0,get:function(){return _FragmentsOnCompositeTypes.FragmentsOnCompositeTypes}});var _KnownArgumentNames=require("./rules/KnownArgumentNames");Object.defineProperty(exports,"KnownArgumentNamesRule",{enumerable:!0,get:function(){return _KnownArgumentNames.KnownArgumentNames}});var _KnownDirectives=require("./rules/KnownDirectives");Object.defineProperty(exports,"KnownDirectivesRule",{enumerable:!0,get:function(){return _KnownDirectives.KnownDirectives}});var _KnownFragmentNames=require("./rules/KnownFragmentNames");Object.defineProperty(exports,"KnownFragmentNamesRule",{enumerable:!0,get:function(){return _KnownFragmentNames.KnownFragmentNames}});var _KnownTypeNames=require("./rules/KnownTypeNames");Object.defineProperty(exports,"KnownTypeNamesRule",{enumerable:!0,get:function(){return _KnownTypeNames.KnownTypeNames}});var _LoneAnonymousOperation=require("./rules/LoneAnonymousOperation");Object.defineProperty(exports,"LoneAnonymousOperationRule",{enumerable:!0,get:function(){return _LoneAnonymousOperation.LoneAnonymousOperation}});var _NoFragmentCycles=require("./rules/NoFragmentCycles");Object.defineProperty(exports,"NoFragmentCyclesRule",{enumerable:!0,get:function(){return _NoFragmentCycles.NoFragmentCycles}});var _NoUndefinedVariables=require("./rules/NoUndefinedVariables");Object.defineProperty(exports,"NoUndefinedVariablesRule",{enumerable:!0,get:function(){return _NoUndefinedVariables.NoUndefinedVariables}});var _NoUnusedFragments=require("./rules/NoUnusedFragments");Object.defineProperty(exports,"NoUnusedFragmentsRule",{enumerable:!0,get:function(){return _NoUnusedFragments.NoUnusedFragments}});var _NoUnusedVariables=require("./rules/NoUnusedVariables");Object.defineProperty(exports,"NoUnusedVariablesRule",{enumerable:!0,get:function(){return _NoUnusedVariables.NoUnusedVariables}});var _OverlappingFieldsCanBeMerged=require("./rules/OverlappingFieldsCanBeMerged");Object.defineProperty(exports,"OverlappingFieldsCanBeMergedRule",{enumerable:!0,get:function(){return _OverlappingFieldsCanBeMerged.OverlappingFieldsCanBeMerged}});var _PossibleFragmentSpreads=require("./rules/PossibleFragmentSpreads");Object.defineProperty(exports,"PossibleFragmentSpreadsRule",{enumerable:!0,get:function(){return _PossibleFragmentSpreads.PossibleFragmentSpreads}});var _ProvidedNonNullArguments=require("./rules/ProvidedNonNullArguments");Object.defineProperty(exports,"ProvidedNonNullArgumentsRule",{enumerable:!0,get:function(){return _ProvidedNonNullArguments.ProvidedNonNullArguments}});var _ScalarLeafs=require("./rules/ScalarLeafs");Object.defineProperty(exports,"ScalarLeafsRule",{enumerable:!0,get:function(){return _ScalarLeafs.ScalarLeafs}});var _SingleFieldSubscriptions=require("./rules/SingleFieldSubscriptions");Object.defineProperty(exports,"SingleFieldSubscriptionsRule",{enumerable:!0,get:function(){return _SingleFieldSubscriptions.SingleFieldSubscriptions}});var _UniqueArgumentNames=require("./rules/UniqueArgumentNames");Object.defineProperty(exports,"UniqueArgumentNamesRule",{enumerable:!0,get:function(){return _UniqueArgumentNames.UniqueArgumentNames}});var _UniqueDirectivesPerLocation=require("./rules/UniqueDirectivesPerLocation");Object.defineProperty(exports,"UniqueDirectivesPerLocationRule",{enumerable:!0,get:function(){return _UniqueDirectivesPerLocation.UniqueDirectivesPerLocation}});var _UniqueFragmentNames=require("./rules/UniqueFragmentNames");Object.defineProperty(exports,"UniqueFragmentNamesRule",{enumerable:!0,get:function(){return _UniqueFragmentNames.UniqueFragmentNames}});var _UniqueInputFieldNames=require("./rules/UniqueInputFieldNames");Object.defineProperty(exports,"UniqueInputFieldNamesRule",{enumerable:!0,get:function(){return _UniqueInputFieldNames.UniqueInputFieldNames}});var _UniqueOperationNames=require("./rules/UniqueOperationNames");Object.defineProperty(exports,"UniqueOperationNamesRule",{enumerable:!0,get:function(){return _UniqueOperationNames.UniqueOperationNames}});var _UniqueVariableNames=require("./rules/UniqueVariableNames");Object.defineProperty(exports,"UniqueVariableNamesRule",{enumerable:!0,get:function(){return _UniqueVariableNames.UniqueVariableNames}});var _VariablesAreInputTypes=require("./rules/VariablesAreInputTypes");Object.defineProperty(exports,"VariablesAreInputTypesRule",{enumerable:!0,get:function(){return _VariablesAreInputTypes.VariablesAreInputTypes}});var _VariablesInAllowedPosition=require("./rules/VariablesInAllowedPosition");Object.defineProperty(exports,"VariablesInAllowedPositionRule",{enumerable:!0,get:function(){return _VariablesInAllowedPosition.VariablesInAllowedPosition}})},{"./rules/ArgumentsOfCorrectType":141,"./rules/DefaultValuesOfCorrectType":142,"./rules/FieldsOnCorrectType":143,"./rules/FragmentsOnCompositeTypes":144,"./rules/KnownArgumentNames":145,"./rules/KnownDirectives":146,"./rules/KnownFragmentNames":147,"./rules/KnownTypeNames":148,"./rules/LoneAnonymousOperation":149,"./rules/NoFragmentCycles":150,"./rules/NoUndefinedVariables":151,"./rules/NoUnusedFragments":152,"./rules/NoUnusedVariables":153,"./rules/OverlappingFieldsCanBeMerged":154,"./rules/PossibleFragmentSpreads":155,"./rules/ProvidedNonNullArguments":156,"./rules/ScalarLeafs":157,"./rules/SingleFieldSubscriptions":158,"./rules/UniqueArgumentNames":159,"./rules/UniqueDirectivesPerLocation":160,"./rules/UniqueFragmentNames":161,"./rules/UniqueInputFieldNames":162,"./rules/UniqueOperationNames":163,"./rules/UniqueVariableNames":164,"./rules/VariablesAreInputTypes":165,"./rules/VariablesInAllowedPosition":166,"./specifiedRules":167,"./validate":168}],141:[function(require,module,exports){"use strict";function badValueMessage(argName,type,value,verboseErrors){return'Argument "'+argName+'" has invalid value '+value+"."+(verboseErrors?"\n"+verboseErrors.join("\n"):"")}Object.defineProperty(exports,"__esModule",{value:!0}),exports.badValueMessage=badValueMessage,exports.ArgumentsOfCorrectType=function(context){return{Argument:function(node){var argDef=context.getArgument();if(argDef){var errors=(0,_isValidLiteralValue.isValidLiteralValue)(argDef.type,node.value);errors&&errors.length>0&&context.reportError(new _error.GraphQLError(badValueMessage(node.name.value,argDef.type,(0,_printer.print)(node.value),errors),[node.value]))}return!1}}};var _error=require("../../error"),_printer=require("../../language/printer"),_isValidLiteralValue=require("../../utilities/isValidLiteralValue")},{"../../error":88,"../../language/printer":109,"../../utilities/isValidLiteralValue":134}],142:[function(require,module,exports){"use strict";function defaultForNonNullArgMessage(varName,type,guessType){return'Variable "$'+varName+'" of type "'+String(type)+'" is required and will not use the default value. Perhaps you meant to use type "'+String(guessType)+'".'}function badValueForDefaultArgMessage(varName,type,value,verboseErrors){var message=verboseErrors?"\n"+verboseErrors.join("\n"):"";return'Variable "$'+varName+'" of type "'+String(type)+'" has invalid default value '+value+"."+message}Object.defineProperty(exports,"__esModule",{value:!0}),exports.defaultForNonNullArgMessage=defaultForNonNullArgMessage,exports.badValueForDefaultArgMessage=badValueForDefaultArgMessage,exports.DefaultValuesOfCorrectType=function(context){return{VariableDefinition:function(node){var name=node.variable.name.value,defaultValue=node.defaultValue,type=context.getInputType();if(type instanceof _definition.GraphQLNonNull&&defaultValue&&context.reportError(new _error.GraphQLError(defaultForNonNullArgMessage(name,type,type.ofType),[defaultValue])),type&&defaultValue){var errors=(0,_isValidLiteralValue.isValidLiteralValue)(type,defaultValue);errors&&errors.length>0&&context.reportError(new _error.GraphQLError(badValueForDefaultArgMessage(name,type,(0,_printer.print)(defaultValue),errors),[defaultValue]))}return!1},SelectionSet:function(){return!1},FragmentDefinition:function(){return!1}}};var _error=require("../../error"),_printer=require("../../language/printer"),_definition=require("../../type/definition"),_isValidLiteralValue=require("../../utilities/isValidLiteralValue")},{"../../error":88,"../../language/printer":109,"../../type/definition":115,"../../utilities/isValidLiteralValue":134}],143:[function(require,module,exports){"use strict";function _interopRequireDefault(obj){return obj&&obj.__esModule?obj:{default:obj}}function undefinedFieldMessage(fieldName,type,suggestedTypeNames,suggestedFieldNames){var message='Cannot query field "'+fieldName+'" on type "'+type+'".';return 0!==suggestedTypeNames.length?message+=" Did you mean to use an inline fragment on "+(0,_quotedOrList2.default)(suggestedTypeNames)+"?":0!==suggestedFieldNames.length&&(message+=" Did you mean "+(0,_quotedOrList2.default)(suggestedFieldNames)+"?"),message}function getSuggestedTypeNames(schema,type,fieldName){if((0,_definition.isAbstractType)(type)){var suggestedObjectTypes=[],interfaceUsageCount=Object.create(null);return schema.getPossibleTypes(type).forEach(function(possibleType){possibleType.getFields()[fieldName]&&(suggestedObjectTypes.push(possibleType.name),possibleType.getInterfaces().forEach(function(possibleInterface){possibleInterface.getFields()[fieldName]&&(interfaceUsageCount[possibleInterface.name]=(interfaceUsageCount[possibleInterface.name]||0)+1)}))}),Object.keys(interfaceUsageCount).sort(function(a,b){return interfaceUsageCount[b]-interfaceUsageCount[a]}).concat(suggestedObjectTypes)}return[]}function getSuggestedFieldNames(schema,type,fieldName){if(type instanceof _definition.GraphQLObjectType||type instanceof _definition.GraphQLInterfaceType){var possibleFieldNames=Object.keys(type.getFields());return(0,_suggestionList2.default)(fieldName,possibleFieldNames)}return[]}Object.defineProperty(exports,"__esModule",{value:!0}),exports.undefinedFieldMessage=undefinedFieldMessage,exports.FieldsOnCorrectType=function(context){return{Field:function(node){var type=context.getParentType();if(type&&!context.getFieldDef()){var schema=context.getSchema(),fieldName=node.name.value,suggestedTypeNames=getSuggestedTypeNames(schema,type,fieldName),suggestedFieldNames=0!==suggestedTypeNames.length?[]:getSuggestedFieldNames(0,type,fieldName);context.reportError(new _error.GraphQLError(undefinedFieldMessage(fieldName,type.name,suggestedTypeNames,suggestedFieldNames),[node]))}}}};var _error=require("../../error"),_suggestionList2=_interopRequireDefault(require("../../jsutils/suggestionList")),_quotedOrList2=_interopRequireDefault(require("../../jsutils/quotedOrList")),_definition=require("../../type/definition")},{"../../error":88,"../../jsutils/quotedOrList":102,"../../jsutils/suggestionList":103,"../../type/definition":115}],144:[function(require,module,exports){"use strict";function inlineFragmentOnNonCompositeErrorMessage(type){return'Fragment cannot condition on non composite type "'+String(type)+'".'}function fragmentOnNonCompositeErrorMessage(fragName,type){return'Fragment "'+fragName+'" cannot condition on non composite type "'+String(type)+'".'}Object.defineProperty(exports,"__esModule",{value:!0}),exports.inlineFragmentOnNonCompositeErrorMessage=inlineFragmentOnNonCompositeErrorMessage,exports.fragmentOnNonCompositeErrorMessage=fragmentOnNonCompositeErrorMessage,exports.FragmentsOnCompositeTypes=function(context){return{InlineFragment:function(node){if(node.typeCondition){var type=(0,_typeFromAST.typeFromAST)(context.getSchema(),node.typeCondition);type&&!(0,_definition.isCompositeType)(type)&&context.reportError(new _error.GraphQLError(inlineFragmentOnNonCompositeErrorMessage((0,_printer.print)(node.typeCondition)),[node.typeCondition]))}},FragmentDefinition:function(node){var type=(0,_typeFromAST.typeFromAST)(context.getSchema(),node.typeCondition);type&&!(0,_definition.isCompositeType)(type)&&context.reportError(new _error.GraphQLError(fragmentOnNonCompositeErrorMessage(node.name.value,(0,_printer.print)(node.typeCondition)),[node.typeCondition]))}}};var _error=require("../../error"),_printer=require("../../language/printer"),_definition=require("../../type/definition"),_typeFromAST=require("../../utilities/typeFromAST")},{"../../error":88,"../../language/printer":109,"../../type/definition":115,"../../utilities/typeFromAST":138}],145:[function(require,module,exports){"use strict";function _interopRequireDefault(obj){return obj&&obj.__esModule?obj:{default:obj}}function unknownArgMessage(argName,fieldName,type,suggestedArgs){var message='Unknown argument "'+argName+'" on field "'+fieldName+'" of type "'+String(type)+'".';return suggestedArgs.length&&(message+=" Did you mean "+(0,_quotedOrList2.default)(suggestedArgs)+"?"),message}function unknownDirectiveArgMessage(argName,directiveName,suggestedArgs){var message='Unknown argument "'+argName+'" on directive "@'+directiveName+'".';return suggestedArgs.length&&(message+=" Did you mean "+(0,_quotedOrList2.default)(suggestedArgs)+"?"),message}Object.defineProperty(exports,"__esModule",{value:!0}),exports.unknownArgMessage=unknownArgMessage,exports.unknownDirectiveArgMessage=unknownDirectiveArgMessage,exports.KnownArgumentNames=function(context){return{Argument:function(node,key,parent,path,ancestors){var argumentOf=ancestors[ancestors.length-1];if(argumentOf.kind===Kind.FIELD){var fieldDef=context.getFieldDef();if(fieldDef&&!(0,_find2.default)(fieldDef.args,function(arg){return arg.name===node.name.value})){var parentType=context.getParentType();(0,_invariant2.default)(parentType),context.reportError(new _error.GraphQLError(unknownArgMessage(node.name.value,fieldDef.name,parentType.name,(0,_suggestionList2.default)(node.name.value,fieldDef.args.map(function(arg){return arg.name}))),[node]))}}else if(argumentOf.kind===Kind.DIRECTIVE){var directive=context.getDirective();directive&&((0,_find2.default)(directive.args,function(arg){return arg.name===node.name.value})||context.reportError(new _error.GraphQLError(unknownDirectiveArgMessage(node.name.value,directive.name,(0,_suggestionList2.default)(node.name.value,directive.args.map(function(arg){return arg.name}))),[node])))}}}};var _error=require("../../error"),_find2=_interopRequireDefault(require("../../jsutils/find")),_invariant2=_interopRequireDefault(require("../../jsutils/invariant")),_suggestionList2=_interopRequireDefault(require("../../jsutils/suggestionList")),_quotedOrList2=_interopRequireDefault(require("../../jsutils/quotedOrList")),Kind=function(obj){if(obj&&obj.__esModule)return obj;var newObj={};if(null!=obj)for(var key in obj)Object.prototype.hasOwnProperty.call(obj,key)&&(newObj[key]=obj[key]);return newObj.default=obj,newObj}(require("../../language/kinds"))},{"../../error":88,"../../jsutils/find":96,"../../jsutils/invariant":97,"../../jsutils/quotedOrList":102,"../../jsutils/suggestionList":103,"../../language/kinds":105}],146:[function(require,module,exports){"use strict";function unknownDirectiveMessage(directiveName){return'Unknown directive "'+directiveName+'".'}function misplacedDirectiveMessage(directiveName,location){return'Directive "'+directiveName+'" may not be used on '+location+"."}function getDirectiveLocationForASTPath(ancestors){var appliedTo=ancestors[ancestors.length-1];switch(appliedTo.kind){case Kind.OPERATION_DEFINITION:switch(appliedTo.operation){case"query":return _directives.DirectiveLocation.QUERY;case"mutation":return _directives.DirectiveLocation.MUTATION;case"subscription":return _directives.DirectiveLocation.SUBSCRIPTION}break;case Kind.FIELD:return _directives.DirectiveLocation.FIELD;case Kind.FRAGMENT_SPREAD:return _directives.DirectiveLocation.FRAGMENT_SPREAD;case Kind.INLINE_FRAGMENT:return _directives.DirectiveLocation.INLINE_FRAGMENT;case Kind.FRAGMENT_DEFINITION:return _directives.DirectiveLocation.FRAGMENT_DEFINITION;case Kind.SCHEMA_DEFINITION:return _directives.DirectiveLocation.SCHEMA;case Kind.SCALAR_TYPE_DEFINITION:return _directives.DirectiveLocation.SCALAR;case Kind.OBJECT_TYPE_DEFINITION:return _directives.DirectiveLocation.OBJECT;case Kind.FIELD_DEFINITION:return _directives.DirectiveLocation.FIELD_DEFINITION;case Kind.INTERFACE_TYPE_DEFINITION:return _directives.DirectiveLocation.INTERFACE;case Kind.UNION_TYPE_DEFINITION:return _directives.DirectiveLocation.UNION;case Kind.ENUM_TYPE_DEFINITION:return _directives.DirectiveLocation.ENUM;case Kind.ENUM_VALUE_DEFINITION:return _directives.DirectiveLocation.ENUM_VALUE;case Kind.INPUT_OBJECT_TYPE_DEFINITION:return _directives.DirectiveLocation.INPUT_OBJECT;case Kind.INPUT_VALUE_DEFINITION:return ancestors[ancestors.length-3].kind===Kind.INPUT_OBJECT_TYPE_DEFINITION?_directives.DirectiveLocation.INPUT_FIELD_DEFINITION:_directives.DirectiveLocation.ARGUMENT_DEFINITION}}Object.defineProperty(exports,"__esModule",{value:!0}),exports.unknownDirectiveMessage=unknownDirectiveMessage,exports.misplacedDirectiveMessage=misplacedDirectiveMessage,exports.KnownDirectives=function(context){return{Directive:function(node,key,parent,path,ancestors){var directiveDef=(0,_find2.default)(context.getSchema().getDirectives(),function(def){return def.name===node.name.value});if(directiveDef){var candidateLocation=getDirectiveLocationForASTPath(ancestors);candidateLocation?-1===directiveDef.locations.indexOf(candidateLocation)&&context.reportError(new _error.GraphQLError(misplacedDirectiveMessage(node.name.value,candidateLocation),[node])):context.reportError(new _error.GraphQLError(misplacedDirectiveMessage(node.name.value,node.type),[node]))}else context.reportError(new _error.GraphQLError(unknownDirectiveMessage(node.name.value),[node]))}}};var _error=require("../../error"),_find2=function(obj){return obj&&obj.__esModule?obj:{default:obj}}(require("../../jsutils/find")),Kind=function(obj){if(obj&&obj.__esModule)return obj;var newObj={};if(null!=obj)for(var key in obj)Object.prototype.hasOwnProperty.call(obj,key)&&(newObj[key]=obj[key]);return newObj.default=obj,newObj}(require("../../language/kinds")),_directives=require("../../type/directives")},{"../../error":88,"../../jsutils/find":96,"../../language/kinds":105,"../../type/directives":116}],147:[function(require,module,exports){"use strict";function unknownFragmentMessage(fragName){return'Unknown fragment "'+fragName+'".'}Object.defineProperty(exports,"__esModule",{value:!0}),exports.unknownFragmentMessage=unknownFragmentMessage,exports.KnownFragmentNames=function(context){return{FragmentSpread:function(node){var fragmentName=node.name.value;context.getFragment(fragmentName)||context.reportError(new _error.GraphQLError(unknownFragmentMessage(fragmentName),[node.name]))}}};var _error=require("../../error")},{"../../error":88}],148:[function(require,module,exports){"use strict";function _interopRequireDefault(obj){return obj&&obj.__esModule?obj:{default:obj}}function unknownTypeMessage(type,suggestedTypes){var message='Unknown type "'+String(type)+'".';return suggestedTypes.length&&(message+=" Did you mean "+(0,_quotedOrList2.default)(suggestedTypes)+"?"),message}Object.defineProperty(exports,"__esModule",{value:!0}),exports.unknownTypeMessage=unknownTypeMessage,exports.KnownTypeNames=function(context){return{ObjectTypeDefinition:function(){return!1},InterfaceTypeDefinition:function(){return!1},UnionTypeDefinition:function(){return!1},InputObjectTypeDefinition:function(){return!1},NamedType:function(node){var schema=context.getSchema(),typeName=node.name.value;schema.getType(typeName)||context.reportError(new _error.GraphQLError(unknownTypeMessage(typeName,(0,_suggestionList2.default)(typeName,Object.keys(schema.getTypeMap()))),[node]))}}};var _error=require("../../error"),_suggestionList2=_interopRequireDefault(require("../../jsutils/suggestionList")),_quotedOrList2=_interopRequireDefault(require("../../jsutils/quotedOrList"))},{"../../error":88,"../../jsutils/quotedOrList":102,"../../jsutils/suggestionList":103}],149:[function(require,module,exports){"use strict";function anonOperationNotAloneMessage(){return"This anonymous operation must be the only defined operation."}Object.defineProperty(exports,"__esModule",{value:!0}),exports.anonOperationNotAloneMessage=anonOperationNotAloneMessage,exports.LoneAnonymousOperation=function(context){var operationCount=0;return{Document:function(node){operationCount=node.definitions.filter(function(definition){return definition.kind===_kinds.OPERATION_DEFINITION}).length},OperationDefinition:function(node){!node.name&&operationCount>1&&context.reportError(new _error.GraphQLError(anonOperationNotAloneMessage(),[node]))}}};var _error=require("../../error"),_kinds=require("../../language/kinds")},{"../../error":88,"../../language/kinds":105}],150:[function(require,module,exports){"use strict";function cycleErrorMessage(fragName,spreadNames){return'Cannot spread fragment "'+fragName+'" within itself'+(spreadNames.length?" via "+spreadNames.join(", "):"")+"."}Object.defineProperty(exports,"__esModule",{value:!0}),exports.cycleErrorMessage=cycleErrorMessage,exports.NoFragmentCycles=function(context){function detectCycleRecursive(fragment){var fragmentName=fragment.name.value;visitedFrags[fragmentName]=!0;var spreadNodes=context.getFragmentSpreads(fragment.selectionSet);if(0!==spreadNodes.length){spreadPathIndexByName[fragmentName]=spreadPath.length;for(var i=0;i<spreadNodes.length;i++){var spreadNode=spreadNodes[i],spreadName=spreadNode.name.value,cycleIndex=spreadPathIndexByName[spreadName];if(void 0===cycleIndex){if(spreadPath.push(spreadNode),!visitedFrags[spreadName]){var spreadFragment=context.getFragment(spreadName);spreadFragment&&detectCycleRecursive(spreadFragment)}spreadPath.pop()}else{var cyclePath=spreadPath.slice(cycleIndex);context.reportError(new _error.GraphQLError(cycleErrorMessage(spreadName,cyclePath.map(function(s){return s.name.value})),cyclePath.concat(spreadNode)))}}spreadPathIndexByName[fragmentName]=void 0}}var visitedFrags=Object.create(null),spreadPath=[],spreadPathIndexByName=Object.create(null);return{OperationDefinition:function(){return!1},FragmentDefinition:function(node){return visitedFrags[node.name.value]||detectCycleRecursive(node),!1}}};var _error=require("../../error")},{"../../error":88}],151:[function(require,module,exports){"use strict";function undefinedVarMessage(varName,opName){return opName?'Variable "$'+varName+'" is not defined by operation "'+opName+'".':'Variable "$'+varName+'" is not defined.'}Object.defineProperty(exports,"__esModule",{value:!0}),exports.undefinedVarMessage=undefinedVarMessage,exports.NoUndefinedVariables=function(context){var variableNameDefined=Object.create(null);return{OperationDefinition:{enter:function(){variableNameDefined=Object.create(null)},leave:function(operation){context.getRecursiveVariableUsages(operation).forEach(function(_ref){var node=_ref.node,varName=node.name.value;!0!==variableNameDefined[varName]&&context.reportError(new _error.GraphQLError(undefinedVarMessage(varName,operation.name&&operation.name.value),[node,operation]))})}},VariableDefinition:function(node){variableNameDefined[node.variable.name.value]=!0}}};var _error=require("../../error")},{"../../error":88}],152:[function(require,module,exports){"use strict";function unusedFragMessage(fragName){return'Fragment "'+fragName+'" is never used.'}Object.defineProperty(exports,"__esModule",{value:!0}),exports.unusedFragMessage=unusedFragMessage,exports.NoUnusedFragments=function(context){var operationDefs=[],fragmentDefs=[];return{OperationDefinition:function(node){return operationDefs.push(node),!1},FragmentDefinition:function(node){return fragmentDefs.push(node),!1},Document:{leave:function(){var fragmentNameUsed=Object.create(null);operationDefs.forEach(function(operation){context.getRecursivelyReferencedFragments(operation).forEach(function(fragment){fragmentNameUsed[fragment.name.value]=!0})}),fragmentDefs.forEach(function(fragmentDef){var fragName=fragmentDef.name.value;!0!==fragmentNameUsed[fragName]&&context.reportError(new _error.GraphQLError(unusedFragMessage(fragName),[fragmentDef]))})}}}};var _error=require("../../error")},{"../../error":88}],153:[function(require,module,exports){"use strict";function unusedVariableMessage(varName,opName){return opName?'Variable "$'+varName+'" is never used in operation "'+opName+'".':'Variable "$'+varName+'" is never used.'}Object.defineProperty(exports,"__esModule",{value:!0}),exports.unusedVariableMessage=unusedVariableMessage,exports.NoUnusedVariables=function(context){var variableDefs=[];return{OperationDefinition:{enter:function(){variableDefs=[]},leave:function(operation){var variableNameUsed=Object.create(null),usages=context.getRecursiveVariableUsages(operation),opName=operation.name?operation.name.value:null;usages.forEach(function(_ref){var node=_ref.node;variableNameUsed[node.name.value]=!0}),variableDefs.forEach(function(variableDef){var variableName=variableDef.variable.name.value;!0!==variableNameUsed[variableName]&&context.reportError(new _error.GraphQLError(unusedVariableMessage(variableName,opName),[variableDef]))})}},VariableDefinition:function(def){variableDefs.push(def)}}};var _error=require("../../error")},{"../../error":88}],154:[function(require,module,exports){"use strict";function _classCallCheck(instance,Constructor){if(!(instance instanceof Constructor))throw new TypeError("Cannot call a class as a function")}function fieldsConflictMessage(responseName,reason){return'Fields "'+responseName+'" conflict because '+reasonMessage(reason)+". Use different aliases on the fields to fetch both if this was intentional."}function reasonMessage(reason){return Array.isArray(reason)?reason.map(function(_ref){return'subfields "'+_ref[0]+'" conflict because '+reasonMessage(_ref[1])}).join(" and "):reason}function findConflictsWithinSelectionSet(context,cachedFieldsAndFragmentNames,comparedFragments,parentType,selectionSet){var conflicts=[],_getFieldsAndFragment=getFieldsAndFragmentNames(context,cachedFieldsAndFragmentNames,parentType,selectionSet),fieldMap=_getFieldsAndFragment[0],fragmentNames=_getFieldsAndFragment[1];collectConflictsWithin(context,conflicts,cachedFieldsAndFragmentNames,comparedFragments,fieldMap);for(var i=0;i<fragmentNames.length;i++){collectConflictsBetweenFieldsAndFragment(context,conflicts,cachedFieldsAndFragmentNames,comparedFragments,!1,fieldMap,fragmentNames[i]);for(var j=i+1;j<fragmentNames.length;j++)collectConflictsBetweenFragments(context,conflicts,cachedFieldsAndFragmentNames,comparedFragments,!1,fragmentNames[i],fragmentNames[j])}return conflicts}function collectConflictsBetweenFieldsAndFragment(context,conflicts,cachedFieldsAndFragmentNames,comparedFragments,areMutuallyExclusive,fieldMap,fragmentName){var fragment=context.getFragment(fragmentName);if(fragment){var _getReferencedFieldsA=getReferencedFieldsAndFragmentNames(context,cachedFieldsAndFragmentNames,fragment),fieldMap2=_getReferencedFieldsA[0],fragmentNames2=_getReferencedFieldsA[1];collectConflictsBetween(context,conflicts,cachedFieldsAndFragmentNames,comparedFragments,areMutuallyExclusive,fieldMap,fieldMap2);for(var i=0;i<fragmentNames2.length;i++)collectConflictsBetweenFieldsAndFragment(context,conflicts,cachedFieldsAndFragmentNames,comparedFragments,areMutuallyExclusive,fieldMap,fragmentNames2[i])}}function collectConflictsBetweenFragments(context,conflicts,cachedFieldsAndFragmentNames,comparedFragments,areMutuallyExclusive,fragmentName1,fragmentName2){var fragment1=context.getFragment(fragmentName1),fragment2=context.getFragment(fragmentName2);if(fragment1&&fragment2&&fragment1!==fragment2&&!comparedFragments.has(fragmentName1,fragmentName2,areMutuallyExclusive)){comparedFragments.add(fragmentName1,fragmentName2,areMutuallyExclusive);var _getReferencedFieldsA2=getReferencedFieldsAndFragmentNames(context,cachedFieldsAndFragmentNames,fragment1),fieldMap1=_getReferencedFieldsA2[0],fragmentNames1=_getReferencedFieldsA2[1],_getReferencedFieldsA3=getReferencedFieldsAndFragmentNames(context,cachedFieldsAndFragmentNames,fragment2),fieldMap2=_getReferencedFieldsA3[0],fragmentNames2=_getReferencedFieldsA3[1];collectConflictsBetween(context,conflicts,cachedFieldsAndFragmentNames,comparedFragments,areMutuallyExclusive,fieldMap1,fieldMap2);for(var j=0;j<fragmentNames2.length;j++)collectConflictsBetweenFragments(context,conflicts,cachedFieldsAndFragmentNames,comparedFragments,areMutuallyExclusive,fragmentName1,fragmentNames2[j]);for(var i=0;i<fragmentNames1.length;i++)collectConflictsBetweenFragments(context,conflicts,cachedFieldsAndFragmentNames,comparedFragments,areMutuallyExclusive,fragmentNames1[i],fragmentName2)}}function findConflictsBetweenSubSelectionSets(context,cachedFieldsAndFragmentNames,comparedFragments,areMutuallyExclusive,parentType1,selectionSet1,parentType2,selectionSet2){var conflicts=[],_getFieldsAndFragment2=getFieldsAndFragmentNames(context,cachedFieldsAndFragmentNames,parentType1,selectionSet1),fieldMap1=_getFieldsAndFragment2[0],fragmentNames1=_getFieldsAndFragment2[1],_getFieldsAndFragment3=getFieldsAndFragmentNames(context,cachedFieldsAndFragmentNames,parentType2,selectionSet2),fieldMap2=_getFieldsAndFragment3[0],fragmentNames2=_getFieldsAndFragment3[1];collectConflictsBetween(context,conflicts,cachedFieldsAndFragmentNames,comparedFragments,areMutuallyExclusive,fieldMap1,fieldMap2);for(var j=0;j<fragmentNames2.length;j++)collectConflictsBetweenFieldsAndFragment(context,conflicts,cachedFieldsAndFragmentNames,comparedFragments,areMutuallyExclusive,fieldMap1,fragmentNames2[j]);for(var i=0;i<fragmentNames1.length;i++)collectConflictsBetweenFieldsAndFragment(context,conflicts,cachedFieldsAndFragmentNames,comparedFragments,areMutuallyExclusive,fieldMap2,fragmentNames1[i]);for(var _i=0;_i<fragmentNames1.length;_i++)for(var _j=0;_j<fragmentNames2.length;_j++)collectConflictsBetweenFragments(context,conflicts,cachedFieldsAndFragmentNames,comparedFragments,areMutuallyExclusive,fragmentNames1[_i],fragmentNames2[_j]);return conflicts}function collectConflictsWithin(context,conflicts,cachedFieldsAndFragmentNames,comparedFragments,fieldMap){Object.keys(fieldMap).forEach(function(responseName){var fields=fieldMap[responseName];if(fields.length>1)for(var i=0;i<fields.length;i++)for(var j=i+1;j<fields.length;j++){var conflict=findConflict(context,cachedFieldsAndFragmentNames,comparedFragments,!1,responseName,fields[i],fields[j]);conflict&&conflicts.push(conflict)}})}function collectConflictsBetween(context,conflicts,cachedFieldsAndFragmentNames,comparedFragments,parentFieldsAreMutuallyExclusive,fieldMap1,fieldMap2){Object.keys(fieldMap1).forEach(function(responseName){var fields2=fieldMap2[responseName];if(fields2)for(var fields1=fieldMap1[responseName],i=0;i<fields1.length;i++)for(var j=0;j<fields2.length;j++){var conflict=findConflict(context,cachedFieldsAndFragmentNames,comparedFragments,parentFieldsAreMutuallyExclusive,responseName,fields1[i],fields2[j]);conflict&&conflicts.push(conflict)}})}function findConflict(context,cachedFieldsAndFragmentNames,comparedFragments,parentFieldsAreMutuallyExclusive,responseName,field1,field2){var parentType1=field1[0],node1=field1[1],def1=field1[2],parentType2=field2[0],node2=field2[1],def2=field2[2],areMutuallyExclusive=parentFieldsAreMutuallyExclusive||parentType1!==parentType2&&parentType1 instanceof _definition.GraphQLObjectType&&parentType2 instanceof _definition.GraphQLObjectType,type1=def1&&def1.type,type2=def2&&def2.type;if(!areMutuallyExclusive){var name1=node1.name.value,name2=node2.name.value;if(name1!==name2)return[[responseName,name1+" and "+name2+" are different fields"],[node1],[node2]];if(!sameArguments(node1.arguments||[],node2.arguments||[]))return[[responseName,"they have differing arguments"],[node1],[node2]]}if(type1&&type2&&doTypesConflict(type1,type2))return[[responseName,"they return conflicting types "+String(type1)+" and "+String(type2)],[node1],[node2]];var selectionSet1=node1.selectionSet,selectionSet2=node2.selectionSet;return selectionSet1&&selectionSet2?subfieldConflicts(findConflictsBetweenSubSelectionSets(context,cachedFieldsAndFragmentNames,comparedFragments,areMutuallyExclusive,(0,_definition.getNamedType)(type1),selectionSet1,(0,_definition.getNamedType)(type2),selectionSet2),responseName,node1,node2):void 0}function sameArguments(arguments1,arguments2){return arguments1.length===arguments2.length&&arguments1.every(function(argument1){var argument2=(0,_find2.default)(arguments2,function(argument){return argument.name.value===argument1.name.value});return!!argument2&&sameValue(argument1.value,argument2.value)})}function sameValue(value1,value2){return!value1&&!value2||(0,_printer.print)(value1)===(0,_printer.print)(value2)}function doTypesConflict(type1,type2){return type1 instanceof _definition.GraphQLList?!(type2 instanceof _definition.GraphQLList)||doTypesConflict(type1.ofType,type2.ofType):type2 instanceof _definition.GraphQLList?!(type1 instanceof _definition.GraphQLList)||doTypesConflict(type1.ofType,type2.ofType):type1 instanceof _definition.GraphQLNonNull?!(type2 instanceof _definition.GraphQLNonNull)||doTypesConflict(type1.ofType,type2.ofType):type2 instanceof _definition.GraphQLNonNull?!(type1 instanceof _definition.GraphQLNonNull)||doTypesConflict(type1.ofType,type2.ofType):!(!(0,_definition.isLeafType)(type1)&&!(0,_definition.isLeafType)(type2))&&type1!==type2}function getFieldsAndFragmentNames(context,cachedFieldsAndFragmentNames,parentType,selectionSet){var cached=cachedFieldsAndFragmentNames.get(selectionSet);if(!cached){var nodeAndDefs=Object.create(null),fragmentNames=Object.create(null);_collectFieldsAndFragmentNames(context,parentType,selectionSet,nodeAndDefs,fragmentNames),cached=[nodeAndDefs,Object.keys(fragmentNames)],cachedFieldsAndFragmentNames.set(selectionSet,cached)}return cached}function getReferencedFieldsAndFragmentNames(context,cachedFieldsAndFragmentNames,fragment){var cached=cachedFieldsAndFragmentNames.get(fragment.selectionSet);return cached||getFieldsAndFragmentNames(context,cachedFieldsAndFragmentNames,(0,_typeFromAST.typeFromAST)(context.getSchema(),fragment.typeCondition),fragment.selectionSet)}function _collectFieldsAndFragmentNames(context,parentType,selectionSet,nodeAndDefs,fragmentNames){for(var i=0;i<selectionSet.selections.length;i++){var selection=selectionSet.selections[i];switch(selection.kind){case Kind.FIELD:var fieldName=selection.name.value,fieldDef=void 0;(parentType instanceof _definition.GraphQLObjectType||parentType instanceof _definition.GraphQLInterfaceType)&&(fieldDef=parentType.getFields()[fieldName]);var responseName=selection.alias?selection.alias.value:fieldName;nodeAndDefs[responseName]||(nodeAndDefs[responseName]=[]),nodeAndDefs[responseName].push([parentType,selection,fieldDef]);break;case Kind.FRAGMENT_SPREAD:fragmentNames[selection.name.value]=!0;break;case Kind.INLINE_FRAGMENT:var typeCondition=selection.typeCondition;_collectFieldsAndFragmentNames(context,typeCondition?(0,_typeFromAST.typeFromAST)(context.getSchema(),typeCondition):parentType,selection.selectionSet,nodeAndDefs,fragmentNames)}}}function subfieldConflicts(conflicts,responseName,node1,node2){if(conflicts.length>0)return[[responseName,conflicts.map(function(_ref3){return _ref3[0]})],conflicts.reduce(function(allFields,_ref4){var fields1=_ref4[1];return allFields.concat(fields1)},[node1]),conflicts.reduce(function(allFields,_ref5){var fields2=_ref5[2];return allFields.concat(fields2)},[node2])]}function _pairSetAdd(data,a,b,areMutuallyExclusive){var map=data[a];map||(map=Object.create(null),data[a]=map),map[b]=areMutuallyExclusive}Object.defineProperty(exports,"__esModule",{value:!0}),exports.fieldsConflictMessage=fieldsConflictMessage,exports.OverlappingFieldsCanBeMerged=function(context){var comparedFragments=new PairSet,cachedFieldsAndFragmentNames=new Map;return{SelectionSet:function(selectionSet){findConflictsWithinSelectionSet(context,cachedFieldsAndFragmentNames,comparedFragments,context.getParentType(),selectionSet).forEach(function(_ref2){var _ref2$=_ref2[0],responseName=_ref2$[0],reason=_ref2$[1],fields1=_ref2[1],fields2=_ref2[2];return context.reportError(new _error.GraphQLError(fieldsConflictMessage(responseName,reason),fields1.concat(fields2)))})}}};var _error=require("../../error"),_find2=function(obj){return obj&&obj.__esModule?obj:{default:obj}}(require("../../jsutils/find")),Kind=function(obj){if(obj&&obj.__esModule)return obj;var newObj={};if(null!=obj)for(var key in obj)Object.prototype.hasOwnProperty.call(obj,key)&&(newObj[key]=obj[key]);return newObj.default=obj,newObj}(require("../../language/kinds")),_printer=require("../../language/printer"),_definition=require("../../type/definition"),_typeFromAST=require("../../utilities/typeFromAST"),PairSet=function(){function PairSet(){_classCallCheck(this,PairSet),this._data=Object.create(null)}return PairSet.prototype.has=function(a,b,areMutuallyExclusive){var first=this._data[a],result=first&&first[b];return void 0!==result&&(!1!==areMutuallyExclusive||!1===result)},PairSet.prototype.add=function(a,b,areMutuallyExclusive){_pairSetAdd(this._data,a,b,areMutuallyExclusive),_pairSetAdd(this._data,b,a,areMutuallyExclusive)},PairSet}()},{"../../error":88,"../../jsutils/find":96,"../../language/kinds":105,"../../language/printer":109,"../../type/definition":115,"../../utilities/typeFromAST":138}],155:[function(require,module,exports){"use strict";function typeIncompatibleSpreadMessage(fragName,parentType,fragType){return'Fragment "'+fragName+'" cannot be spread here as objects of type "'+String(parentType)+'" can never be of type "'+String(fragType)+'".'}function typeIncompatibleAnonSpreadMessage(parentType,fragType){return'Fragment cannot be spread here as objects of type "'+String(parentType)+'" can never be of type "'+String(fragType)+'".'}function getFragmentType(context,name){var frag=context.getFragment(name);return frag&&(0,_typeFromAST.typeFromAST)(context.getSchema(),frag.typeCondition)}Object.defineProperty(exports,"__esModule",{value:!0}),exports.typeIncompatibleSpreadMessage=typeIncompatibleSpreadMessage,exports.typeIncompatibleAnonSpreadMessage=typeIncompatibleAnonSpreadMessage,exports.PossibleFragmentSpreads=function(context){return{InlineFragment:function(node){var fragType=context.getType(),parentType=context.getParentType();fragType&&parentType&&!(0,_typeComparators.doTypesOverlap)(context.getSchema(),fragType,parentType)&&context.reportError(new _error.GraphQLError(typeIncompatibleAnonSpreadMessage(parentType,fragType),[node]))},FragmentSpread:function(node){var fragName=node.name.value,fragType=getFragmentType(context,fragName),parentType=context.getParentType();fragType&&parentType&&!(0,_typeComparators.doTypesOverlap)(context.getSchema(),fragType,parentType)&&context.reportError(new _error.GraphQLError(typeIncompatibleSpreadMessage(fragName,parentType,fragType),[node]))}}};var _error=require("../../error"),_typeComparators=require("../../utilities/typeComparators"),_typeFromAST=require("../../utilities/typeFromAST")},{"../../error":88,"../../utilities/typeComparators":137,"../../utilities/typeFromAST":138}],156:[function(require,module,exports){"use strict";function missingFieldArgMessage(fieldName,argName,type){return'Field "'+fieldName+'" argument "'+argName+'" of type "'+String(type)+'" is required but not provided.'}function missingDirectiveArgMessage(directiveName,argName,type){return'Directive "@'+directiveName+'" argument "'+argName+'" of type "'+String(type)+'" is required but not provided.'}Object.defineProperty(exports,"__esModule",{value:!0}),exports.missingFieldArgMessage=missingFieldArgMessage,exports.missingDirectiveArgMessage=missingDirectiveArgMessage,exports.ProvidedNonNullArguments=function(context){return{Field:{leave:function(node){var fieldDef=context.getFieldDef();if(!fieldDef)return!1;var argNodes=node.arguments||[],argNodeMap=(0,_keyMap2.default)(argNodes,function(arg){return arg.name.value});fieldDef.args.forEach(function(argDef){!argNodeMap[argDef.name]&&argDef.type instanceof _definition.GraphQLNonNull&&context.reportError(new _error.GraphQLError(missingFieldArgMessage(node.name.value,argDef.name,argDef.type),[node]))})}},Directive:{leave:function(node){var directiveDef=context.getDirective();if(!directiveDef)return!1;var argNodes=node.arguments||[],argNodeMap=(0,_keyMap2.default)(argNodes,function(arg){return arg.name.value});directiveDef.args.forEach(function(argDef){!argNodeMap[argDef.name]&&argDef.type instanceof _definition.GraphQLNonNull&&context.reportError(new _error.GraphQLError(missingDirectiveArgMessage(node.name.value,argDef.name,argDef.type),[node]))})}}}};var _error=require("../../error"),_keyMap2=function(obj){return obj&&obj.__esModule?obj:{default:obj}}(require("../../jsutils/keyMap")),_definition=require("../../type/definition")},{"../../error":88,"../../jsutils/keyMap":100,"../../type/definition":115}],157:[function(require,module,exports){"use strict";function noSubselectionAllowedMessage(fieldName,type){return'Field "'+fieldName+'" must not have a selection since type "'+String(type)+'" has no subfields.'}function requiredSubselectionMessage(fieldName,type){return'Field "'+fieldName+'" of type "'+String(type)+'" must have a selection of subfields. Did you mean "'+fieldName+' { ... }"?'}Object.defineProperty(exports,"__esModule",{value:!0}),exports.noSubselectionAllowedMessage=noSubselectionAllowedMessage,exports.requiredSubselectionMessage=requiredSubselectionMessage,exports.ScalarLeafs=function(context){return{Field:function(node){var type=context.getType();type&&((0,_definition.isLeafType)((0,_definition.getNamedType)(type))?node.selectionSet&&context.reportError(new _error.GraphQLError(noSubselectionAllowedMessage(node.name.value,type),[node.selectionSet])):node.selectionSet||context.reportError(new _error.GraphQLError(requiredSubselectionMessage(node.name.value,type),[node])))}}};var _error=require("../../error"),_definition=require("../../type/definition")},{"../../error":88,"../../type/definition":115}],158:[function(require,module,exports){"use strict";function singleFieldOnlyMessage(name){return(name?'Subscription "'+name+'" ':"Anonymous Subscription ")+"must select only one top level field."}Object.defineProperty(exports,"__esModule",{value:!0}),exports.singleFieldOnlyMessage=singleFieldOnlyMessage,exports.SingleFieldSubscriptions=function(context){return{OperationDefinition:function(node){"subscription"===node.operation&&1!==node.selectionSet.selections.length&&context.reportError(new _error.GraphQLError(singleFieldOnlyMessage(node.name&&node.name.value),node.selectionSet.selections.slice(1)))}}};var _error=require("../../error")},{"../../error":88}],159:[function(require,module,exports){"use strict";function duplicateArgMessage(argName){return'There can be only one argument named "'+argName+'".'}Object.defineProperty(exports,"__esModule",{value:!0}),exports.duplicateArgMessage=duplicateArgMessage,exports.UniqueArgumentNames=function(context){var knownArgNames=Object.create(null);return{Field:function(){knownArgNames=Object.create(null)},Directive:function(){knownArgNames=Object.create(null)},Argument:function(node){var argName=node.name.value;return knownArgNames[argName]?context.reportError(new _error.GraphQLError(duplicateArgMessage(argName),[knownArgNames[argName],node.name])):knownArgNames[argName]=node.name,!1}}};var _error=require("../../error")},{"../../error":88}],160:[function(require,module,exports){"use strict";function duplicateDirectiveMessage(directiveName){return'The directive "'+directiveName+'" can only be used once at this location.'}Object.defineProperty(exports,"__esModule",{value:!0}),exports.duplicateDirectiveMessage=duplicateDirectiveMessage,exports.UniqueDirectivesPerLocation=function(context){return{enter:function(node){if(node.directives){var knownDirectives=Object.create(null);node.directives.forEach(function(directive){var directiveName=directive.name.value;knownDirectives[directiveName]?context.reportError(new _error.GraphQLError(duplicateDirectiveMessage(directiveName),[knownDirectives[directiveName],directive])):knownDirectives[directiveName]=directive})}}}};var _error=require("../../error")},{"../../error":88}],161:[function(require,module,exports){"use strict";function duplicateFragmentNameMessage(fragName){return'There can be only one fragment named "'+fragName+'".'}Object.defineProperty(exports,"__esModule",{value:!0}),exports.duplicateFragmentNameMessage=duplicateFragmentNameMessage,exports.UniqueFragmentNames=function(context){var knownFragmentNames=Object.create(null);return{OperationDefinition:function(){return!1},FragmentDefinition:function(node){var fragmentName=node.name.value;return knownFragmentNames[fragmentName]?context.reportError(new _error.GraphQLError(duplicateFragmentNameMessage(fragmentName),[knownFragmentNames[fragmentName],node.name])):knownFragmentNames[fragmentName]=node.name,!1}}};var _error=require("../../error")},{"../../error":88}],162:[function(require,module,exports){"use strict";function duplicateInputFieldMessage(fieldName){return'There can be only one input field named "'+fieldName+'".'}Object.defineProperty(exports,"__esModule",{value:!0}),exports.duplicateInputFieldMessage=duplicateInputFieldMessage,exports.UniqueInputFieldNames=function(context){var knownNameStack=[],knownNames=Object.create(null);return{ObjectValue:{enter:function(){knownNameStack.push(knownNames),knownNames=Object.create(null)},leave:function(){knownNames=knownNameStack.pop()}},ObjectField:function(node){var fieldName=node.name.value;return knownNames[fieldName]?context.reportError(new _error.GraphQLError(duplicateInputFieldMessage(fieldName),[knownNames[fieldName],node.name])):knownNames[fieldName]=node.name,!1}}};var _error=require("../../error")},{"../../error":88}],163:[function(require,module,exports){"use strict";function duplicateOperationNameMessage(operationName){return'There can be only one operation named "'+operationName+'".'}Object.defineProperty(exports,"__esModule",{value:!0}),exports.duplicateOperationNameMessage=duplicateOperationNameMessage,exports.UniqueOperationNames=function(context){var knownOperationNames=Object.create(null);return{OperationDefinition:function(node){var operationName=node.name;return operationName&&(knownOperationNames[operationName.value]?context.reportError(new _error.GraphQLError(duplicateOperationNameMessage(operationName.value),[knownOperationNames[operationName.value],operationName])):knownOperationNames[operationName.value]=operationName),!1},FragmentDefinition:function(){return!1}}};var _error=require("../../error")},{"../../error":88}],164:[function(require,module,exports){"use strict";function duplicateVariableMessage(variableName){return'There can be only one variable named "'+variableName+'".'}Object.defineProperty(exports,"__esModule",{value:!0}),exports.duplicateVariableMessage=duplicateVariableMessage,exports.UniqueVariableNames=function(context){var knownVariableNames=Object.create(null);return{OperationDefinition:function(){knownVariableNames=Object.create(null)},VariableDefinition:function(node){var variableName=node.variable.name.value;knownVariableNames[variableName]?context.reportError(new _error.GraphQLError(duplicateVariableMessage(variableName),[knownVariableNames[variableName],node.variable.name])):knownVariableNames[variableName]=node.variable.name}}};var _error=require("../../error")},{"../../error":88}],165:[function(require,module,exports){"use strict";function nonInputTypeOnVarMessage(variableName,typeName){return'Variable "$'+variableName+'" cannot be non-input type "'+typeName+'".'}Object.defineProperty(exports,"__esModule",{value:!0}),exports.nonInputTypeOnVarMessage=nonInputTypeOnVarMessage,exports.VariablesAreInputTypes=function(context){return{VariableDefinition:function(node){var type=(0,_typeFromAST.typeFromAST)(context.getSchema(),node.type);if(type&&!(0,_definition.isInputType)(type)){var variableName=node.variable.name.value;context.reportError(new _error.GraphQLError(nonInputTypeOnVarMessage(variableName,(0,_printer.print)(node.type)),[node.type]))}}}};var _error=require("../../error"),_printer=require("../../language/printer"),_definition=require("../../type/definition"),_typeFromAST=require("../../utilities/typeFromAST")},{"../../error":88,"../../language/printer":109,"../../type/definition":115,"../../utilities/typeFromAST":138}],166:[function(require,module,exports){"use strict";function badVarPosMessage(varName,varType,expectedType){return'Variable "$'+varName+'" of type "'+String(varType)+'" used in position expecting type "'+String(expectedType)+'".'}function effectiveType(varType,varDef){return!varDef.defaultValue||varType instanceof _definition.GraphQLNonNull?varType:new _definition.GraphQLNonNull(varType)}Object.defineProperty(exports,"__esModule",{value:!0}),exports.badVarPosMessage=badVarPosMessage,exports.VariablesInAllowedPosition=function(context){var varDefMap=Object.create(null);return{OperationDefinition:{enter:function(){varDefMap=Object.create(null)},leave:function(operation){context.getRecursiveVariableUsages(operation).forEach(function(_ref){var node=_ref.node,type=_ref.type,varName=node.name.value,varDef=varDefMap[varName];if(varDef&&type){var schema=context.getSchema(),varType=(0,_typeFromAST.typeFromAST)(schema,varDef.type);varType&&!(0,_typeComparators.isTypeSubTypeOf)(schema,effectiveType(varType,varDef),type)&&context.reportError(new _error.GraphQLError(badVarPosMessage(varName,varType,type),[varDef,node]))}})}},VariableDefinition:function(node){varDefMap[node.variable.name.value]=node}}};var _error=require("../../error"),_definition=require("../../type/definition"),_typeComparators=require("../../utilities/typeComparators"),_typeFromAST=require("../../utilities/typeFromAST")},{"../../error":88,"../../type/definition":115,"../../utilities/typeComparators":137,"../../utilities/typeFromAST":138}],167:[function(require,module,exports){"use strict";Object.defineProperty(exports,"__esModule",{value:!0}),exports.specifiedRules=void 0;var _UniqueOperationNames=require("./rules/UniqueOperationNames"),_LoneAnonymousOperation=require("./rules/LoneAnonymousOperation"),_SingleFieldSubscriptions=require("./rules/SingleFieldSubscriptions"),_KnownTypeNames=require("./rules/KnownTypeNames"),_FragmentsOnCompositeTypes=require("./rules/FragmentsOnCompositeTypes"),_VariablesAreInputTypes=require("./rules/VariablesAreInputTypes"),_ScalarLeafs=require("./rules/ScalarLeafs"),_FieldsOnCorrectType=require("./rules/FieldsOnCorrectType"),_UniqueFragmentNames=require("./rules/UniqueFragmentNames"),_KnownFragmentNames=require("./rules/KnownFragmentNames"),_NoUnusedFragments=require("./rules/NoUnusedFragments"),_PossibleFragmentSpreads=require("./rules/PossibleFragmentSpreads"),_NoFragmentCycles=require("./rules/NoFragmentCycles"),_UniqueVariableNames=require("./rules/UniqueVariableNames"),_NoUndefinedVariables=require("./rules/NoUndefinedVariables"),_NoUnusedVariables=require("./rules/NoUnusedVariables"),_KnownDirectives=require("./rules/KnownDirectives"),_UniqueDirectivesPerLocation=require("./rules/UniqueDirectivesPerLocation"),_KnownArgumentNames=require("./rules/KnownArgumentNames"),_UniqueArgumentNames=require("./rules/UniqueArgumentNames"),_ArgumentsOfCorrectType=require("./rules/ArgumentsOfCorrectType"),_ProvidedNonNullArguments=require("./rules/ProvidedNonNullArguments"),_DefaultValuesOfCorrectType=require("./rules/DefaultValuesOfCorrectType"),_VariablesInAllowedPosition=require("./rules/VariablesInAllowedPosition"),_OverlappingFieldsCanBeMerged=require("./rules/OverlappingFieldsCanBeMerged"),_UniqueInputFieldNames=require("./rules/UniqueInputFieldNames");exports.specifiedRules=[_UniqueOperationNames.UniqueOperationNames,_LoneAnonymousOperation.LoneAnonymousOperation,_SingleFieldSubscriptions.SingleFieldSubscriptions,_KnownTypeNames.KnownTypeNames,_FragmentsOnCompositeTypes.FragmentsOnCompositeTypes,_VariablesAreInputTypes.VariablesAreInputTypes,_ScalarLeafs.ScalarLeafs,_FieldsOnCorrectType.FieldsOnCorrectType,_UniqueFragmentNames.UniqueFragmentNames,_KnownFragmentNames.KnownFragmentNames,_NoUnusedFragments.NoUnusedFragments,_PossibleFragmentSpreads.PossibleFragmentSpreads,_NoFragmentCycles.NoFragmentCycles,_UniqueVariableNames.UniqueVariableNames,_NoUndefinedVariables.NoUndefinedVariables,_NoUnusedVariables.NoUnusedVariables,_KnownDirectives.KnownDirectives,_UniqueDirectivesPerLocation.UniqueDirectivesPerLocation,_KnownArgumentNames.KnownArgumentNames,_UniqueArgumentNames.UniqueArgumentNames,_ArgumentsOfCorrectType.ArgumentsOfCorrectType,_ProvidedNonNullArguments.ProvidedNonNullArguments,_DefaultValuesOfCorrectType.DefaultValuesOfCorrectType,_VariablesInAllowedPosition.VariablesInAllowedPosition,_OverlappingFieldsCanBeMerged.OverlappingFieldsCanBeMerged,_UniqueInputFieldNames.UniqueInputFieldNames]},{"./rules/ArgumentsOfCorrectType":141,"./rules/DefaultValuesOfCorrectType":142,"./rules/FieldsOnCorrectType":143,"./rules/FragmentsOnCompositeTypes":144,"./rules/KnownArgumentNames":145,"./rules/KnownDirectives":146,"./rules/KnownFragmentNames":147,"./rules/KnownTypeNames":148,"./rules/LoneAnonymousOperation":149,"./rules/NoFragmentCycles":150,"./rules/NoUndefinedVariables":151,"./rules/NoUnusedFragments":152,"./rules/NoUnusedVariables":153,"./rules/OverlappingFieldsCanBeMerged":154,"./rules/PossibleFragmentSpreads":155,"./rules/ProvidedNonNullArguments":156,"./rules/ScalarLeafs":157,"./rules/SingleFieldSubscriptions":158,"./rules/UniqueArgumentNames":159,"./rules/UniqueDirectivesPerLocation":160,"./rules/UniqueFragmentNames":161,"./rules/UniqueInputFieldNames":162,"./rules/UniqueOperationNames":163,"./rules/UniqueVariableNames":164,"./rules/VariablesAreInputTypes":165,"./rules/VariablesInAllowedPosition":166}],168:[function(require,module,exports){"use strict";function _classCallCheck(instance,Constructor){if(!(instance instanceof Constructor))throw new TypeError("Cannot call a class as a function")}function visitUsingRules(schema,typeInfo,documentAST,rules){var context=new ValidationContext(schema,documentAST,typeInfo),visitors=rules.map(function(rule){return rule(context)});return(0,_visitor.visit)(documentAST,(0,_visitor.visitWithTypeInfo)(typeInfo,(0,_visitor.visitInParallel)(visitors))),context.getErrors()}Object.defineProperty(exports,"__esModule",{value:!0}),exports.ValidationContext=void 0,exports.validate=function(schema,ast,rules,typeInfo){return(0,_invariant2.default)(schema,"Must provide schema"),(0,_invariant2.default)(ast,"Must provide document"),(0,_invariant2.default)(schema instanceof _schema.GraphQLSchema,"Schema must be an instance of GraphQLSchema. Also ensure that there are not multiple versions of GraphQL installed in your node_modules directory."),visitUsingRules(schema,typeInfo||new _TypeInfo.TypeInfo(schema),ast,rules||_specifiedRules.specifiedRules)};var _invariant2=function(obj){return obj&&obj.__esModule?obj:{default:obj}}(require("../jsutils/invariant")),_visitor=(require("../error"),require("../language/visitor")),Kind=function(obj){if(obj&&obj.__esModule)return obj;var newObj={};if(null!=obj)for(var key in obj)Object.prototype.hasOwnProperty.call(obj,key)&&(newObj[key]=obj[key]);return newObj.default=obj,newObj}(require("../language/kinds")),_schema=require("../type/schema"),_TypeInfo=require("../utilities/TypeInfo"),_specifiedRules=require("./specifiedRules"),ValidationContext=exports.ValidationContext=function(){function ValidationContext(schema,ast,typeInfo){_classCallCheck(this,ValidationContext),this._schema=schema,this._ast=ast,this._typeInfo=typeInfo,this._errors=[],this._fragmentSpreads=new Map,this._recursivelyReferencedFragments=new Map,this._variableUsages=new Map,this._recursiveVariableUsages=new Map}return ValidationContext.prototype.reportError=function(error){this._errors.push(error)},ValidationContext.prototype.getErrors=function(){return this._errors},ValidationContext.prototype.getSchema=function(){return this._schema},ValidationContext.prototype.getDocument=function(){return this._ast},ValidationContext.prototype.getFragment=function(name){var fragments=this._fragments;return fragments||(this._fragments=fragments=this.getDocument().definitions.reduce(function(frags,statement){return statement.kind===Kind.FRAGMENT_DEFINITION&&(frags[statement.name.value]=statement),frags},Object.create(null))),fragments[name]},ValidationContext.prototype.getFragmentSpreads=function(node){var spreads=this._fragmentSpreads.get(node);if(!spreads){spreads=[];for(var setsToVisit=[node];0!==setsToVisit.length;)for(var set=setsToVisit.pop(),i=0;i<set.selections.length;i++){var selection=set.selections[i];selection.kind===Kind.FRAGMENT_SPREAD?spreads.push(selection):selection.selectionSet&&setsToVisit.push(selection.selectionSet)}this._fragmentSpreads.set(node,spreads)}return spreads},ValidationContext.prototype.getRecursivelyReferencedFragments=function(operation){var fragments=this._recursivelyReferencedFragments.get(operation);if(!fragments){fragments=[];for(var collectedNames=Object.create(null),nodesToVisit=[operation.selectionSet];0!==nodesToVisit.length;)for(var _node=nodesToVisit.pop(),spreads=this.getFragmentSpreads(_node),i=0;i<spreads.length;i++){var fragName=spreads[i].name.value;if(!0!==collectedNames[fragName]){collectedNames[fragName]=!0;var fragment=this.getFragment(fragName);fragment&&(fragments.push(fragment),nodesToVisit.push(fragment.selectionSet))}}this._recursivelyReferencedFragments.set(operation,fragments)}return fragments},ValidationContext.prototype.getVariableUsages=function(node){var usages=this._variableUsages.get(node);if(!usages){var newUsages=[],typeInfo=new _TypeInfo.TypeInfo(this._schema);(0,_visitor.visit)(node,(0,_visitor.visitWithTypeInfo)(typeInfo,{VariableDefinition:function(){return!1},Variable:function(variable){newUsages.push({node:variable,type:typeInfo.getInputType()})}})),usages=newUsages,this._variableUsages.set(node,usages)}return usages},ValidationContext.prototype.getRecursiveVariableUsages=function(operation){var usages=this._recursiveVariableUsages.get(operation);if(!usages){usages=this.getVariableUsages(operation);for(var fragments=this.getRecursivelyReferencedFragments(operation),i=0;i<fragments.length;i++)Array.prototype.push.apply(usages,this.getVariableUsages(fragments[i]));this._recursiveVariableUsages.set(operation,usages)}return usages},ValidationContext.prototype.getType=function(){return this._typeInfo.getType()},ValidationContext.prototype.getParentType=function(){return this._typeInfo.getParentType()},ValidationContext.prototype.getInputType=function(){return this._typeInfo.getInputType()},ValidationContext.prototype.getFieldDef=function(){return this._typeInfo.getFieldDef()},ValidationContext.prototype.getDirective=function(){return this._typeInfo.getDirective()},ValidationContext.prototype.getArgument=function(){return this._typeInfo.getArgument()},ValidationContext}()},{"../error":88,"../jsutils/invariant":97,"../language/kinds":105,"../language/visitor":111,"../type/schema":120,"../utilities/TypeInfo":121,"./specifiedRules":167}],169:[function(require,module,exports){function isIterable(obj){return!!getIteratorMethod(obj)}function isArrayLike(obj){var length=null!=obj&&obj.length;return"number"==typeof length&&length>=0&&length%1==0}function getIterator(iterable){var method=getIteratorMethod(iterable);if(method)return method.call(iterable)}function getIteratorMethod(iterable){if(null!=iterable){var method=SYMBOL_ITERATOR&&iterable[SYMBOL_ITERATOR]||iterable["@@iterator"];if("function"==typeof method)return method}}function createIterator(collection){if(null!=collection){var iterator=getIterator(collection);if(iterator)return iterator;if(isArrayLike(collection))return new ArrayLikeIterator(collection)}}function ArrayLikeIterator(obj){this._o=obj,this._i=0}function getAsyncIterator(asyncIterable){var method=getAsyncIteratorMethod(asyncIterable);if(method)return method.call(asyncIterable)}function getAsyncIteratorMethod(asyncIterable){if(null!=asyncIterable){var method=SYMBOL_ASYNC_ITERATOR&&asyncIterable[SYMBOL_ASYNC_ITERATOR]||asyncIterable["@@asyncIterator"];if("function"==typeof method)return method}}function createAsyncIterator(source){if(null!=source){var asyncIterator=getAsyncIterator(source);if(asyncIterator)return asyncIterator;var iterator=createIterator(source);if(iterator)return new AsyncFromSyncIterator(iterator)}}function AsyncFromSyncIterator(iterator){this._i=iterator}var SYMBOL_ITERATOR="function"==typeof Symbol&&Symbol.iterator,$$iterator=SYMBOL_ITERATOR||"@@iterator";exports.$$iterator=$$iterator,exports.isIterable=isIterable,exports.isArrayLike=isArrayLike,exports.isCollection=function(obj){return Object(obj)===obj&&(isArrayLike(obj)||isIterable(obj))},exports.getIterator=getIterator,exports.getIteratorMethod=getIteratorMethod,exports.createIterator=createIterator,ArrayLikeIterator.prototype[$$iterator]=function(){return this},ArrayLikeIterator.prototype.next=function(){return void 0===this._o||this._i>=this._o.length?(this._o=void 0,{value:void 0,done:!0}):{value:this._o[this._i++],done:!1}},exports.forEach=function(collection,callback,thisArg){if(null!=collection){if("function"==typeof collection.forEach)return collection.forEach(callback,thisArg);var i=0,iterator=getIterator(collection);if(iterator){for(var step;!(step=iterator.next()).done;)if(callback.call(thisArg,step.value,i++,collection),i>9999999)throw new TypeError("Near-infinite iteration.")}else if(isArrayLike(collection))for(;i<collection.length;i++)collection.hasOwnProperty(i)&&callback.call(thisArg,collection[i],i,collection)}};var SYMBOL_ASYNC_ITERATOR="function"==typeof Symbol&&Symbol.asyncIterator,$$asyncIterator=SYMBOL_ASYNC_ITERATOR||"@@asyncIterator";exports.$$asyncIterator=$$asyncIterator,exports.isAsyncIterable=function(obj){return!!getAsyncIteratorMethod(obj)},exports.getAsyncIterator=getAsyncIterator,exports.getAsyncIteratorMethod=getAsyncIteratorMethod,exports.createAsyncIterator=createAsyncIterator,AsyncFromSyncIterator.prototype[$$asyncIterator]=function(){return this},AsyncFromSyncIterator.prototype.next=function(){var step=this._i.next();return Promise.resolve(step.value).then(function(value){return{value:value,done:step.done}})},exports.forAwaitEach=function(source,callback,thisArg){function next(){return asyncIterator.next().then(function(step){if(!step.done)return Promise.resolve(callback.call(thisArg,step.value,i++,source)).then(next)})}var asyncIterator=createAsyncIterator(source);if(asyncIterator){var i=0;return next()}}},{}],170:[function(require,module,exports){"use strict";function assign(obj){return Array.prototype.slice.call(arguments,1).forEach(function(source){source&&Object.keys(source).forEach(function(key){obj[key]=source[key]})}),obj}function _class(obj){return Object.prototype.toString.call(obj)}function isString(obj){return"[object String]"===_class(obj)}function isObject(obj){return"[object Object]"===_class(obj)}function isRegExp(obj){return"[object RegExp]"===_class(obj)}function isFunction(obj){return"[object Function]"===_class(obj)}function escapeRE(str){return str.replace(/[.?*+^$[\]\\(){}|-]/g,"\\$&")}function isOptionsObj(obj){return Object.keys(obj||{}).reduce(function(acc,k){return acc||defaultOptions.hasOwnProperty(k)},!1)}function resetScanCache(self){self.__index__=-1,self.__text_cache__=""}function createValidator(re){return function(text,pos){var tail=text.slice(pos);return re.test(tail)?tail.match(re)[0].length:0}}function createNormalizer(){return function(match,self){self.normalize(match)}}function compile(self){function untpl(tpl){return tpl.replace("%TLDS%",re.src_tlds)}function schemaError(name,val){throw new Error('(LinkifyIt) Invalid schema "'+name+'": '+val)}var re=self.re=require("./lib/re")(self.__opts__),tlds=self.__tlds__.slice();self.onCompile(),self.__tlds_replaced__||tlds.push(tlds_2ch_src_re),tlds.push(re.src_xn),re.src_tlds=tlds.join("|"),re.email_fuzzy=RegExp(untpl(re.tpl_email_fuzzy),"i"),re.link_fuzzy=RegExp(untpl(re.tpl_link_fuzzy),"i"),re.link_no_ip_fuzzy=RegExp(untpl(re.tpl_link_no_ip_fuzzy),"i"),re.host_fuzzy_test=RegExp(untpl(re.tpl_host_fuzzy_test),"i");var aliases=[];self.__compiled__={},Object.keys(self.__schemas__).forEach(function(name){var val=self.__schemas__[name];if(null!==val){var compiled={validate:null,link:null};if(self.__compiled__[name]=compiled,isObject(val))return isRegExp(val.validate)?compiled.validate=createValidator(val.validate):isFunction(val.validate)?compiled.validate=val.validate:schemaError(name,val),void(isFunction(val.normalize)?compiled.normalize=val.normalize:val.normalize?schemaError(name,val):compiled.normalize=createNormalizer());isString(val)?aliases.push(name):schemaError(name,val)}}),aliases.forEach(function(alias){self.__compiled__[self.__schemas__[alias]]&&(self.__compiled__[alias].validate=self.__compiled__[self.__schemas__[alias]].validate,self.__compiled__[alias].normalize=self.__compiled__[self.__schemas__[alias]].normalize)}),self.__compiled__[""]={validate:null,normalize:createNormalizer()};var slist=Object.keys(self.__compiled__).filter(function(name){return name.length>0&&self.__compiled__[name]}).map(escapeRE).join("|");self.re.schema_test=RegExp("(^|(?!_)(?:[><｜]|"+re.src_ZPCc+"))("+slist+")","i"),self.re.schema_search=RegExp("(^|(?!_)(?:[><｜]|"+re.src_ZPCc+"))("+slist+")","ig"),self.re.pretest=RegExp("("+self.re.schema_test.source+")|("+self.re.host_fuzzy_test.source+")|@","i"),resetScanCache(self)}function Match(self,shift){var start=self.__index__,end=self.__last_index__,text=self.__text_cache__.slice(start,end);this.schema=self.__schema__.toLowerCase(),this.index=start+shift,this.lastIndex=end+shift,this.raw=text,this.text=text,this.url=text}function createMatch(self,shift){var match=new Match(self,shift);return self.__compiled__[match.schema].normalize(match,self),match}function LinkifyIt(schemas,options){if(!(this instanceof LinkifyIt))return new LinkifyIt(schemas,options);options||isOptionsObj(schemas)&&(options=schemas,schemas={}),this.__opts__=assign({},defaultOptions,options),this.__index__=-1,this.__last_index__=-1,this.__schema__="",this.__text_cache__="",this.__schemas__=assign({},defaultSchemas,schemas),this.__compiled__={},this.__tlds__=tlds_default,this.__tlds_replaced__=!1,this.re={},compile(this)}var defaultOptions={fuzzyLink:!0,fuzzyEmail:!0,fuzzyIP:!1},defaultSchemas={"http:":{validate:function(text,pos,self){var tail=text.slice(pos);return self.re.http||(self.re.http=new RegExp("^\\/\\/"+self.re.src_auth+self.re.src_host_port_strict+self.re.src_path,"i")),self.re.http.test(tail)?tail.match(self.re.http)[0].length:0}},"https:":"http:","ftp:":"http:","//":{validate:function(text,pos,self){var tail=text.slice(pos);return self.re.no_http||(self.re.no_http=new RegExp("^"+self.re.src_auth+"(?:localhost|(?:(?:"+self.re.src_domain+")\\.)+"+self.re.src_domain_root+")"+self.re.src_port+self.re.src_host_terminator+self.re.src_path,"i")),self.re.no_http.test(tail)?pos>=3&&":"===text[pos-3]?0:pos>=3&&"/"===text[pos-3]?0:tail.match(self.re.no_http)[0].length:0}},"mailto:":{validate:function(text,pos,self){var tail=text.slice(pos);return self.re.mailto||(self.re.mailto=new RegExp("^"+self.re.src_email_name+"@"+self.re.src_host_strict,"i")),self.re.mailto.test(tail)?tail.match(self.re.mailto)[0].length:0}}},tlds_2ch_src_re="a[cdefgilmnoqrstuwxz]|b[abdefghijmnorstvwyz]|c[acdfghiklmnoruvwxyz]|d[ejkmoz]|e[cegrstu]|f[ijkmor]|g[abdefghilmnpqrstuwy]|h[kmnrtu]|i[delmnoqrst]|j[emop]|k[eghimnprwyz]|l[abcikrstuvy]|m[acdeghklmnopqrstuvwxyz]|n[acefgilopruz]|om|p[aefghklmnrstwy]|qa|r[eosuw]|s[abcdeghijklmnortuvxyz]|t[cdfghjklmnortvwz]|u[agksyz]|v[aceginu]|w[fs]|y[et]|z[amw]",tlds_default="biz|com|edu|gov|net|org|pro|web|xxx|aero|asia|coop|info|museum|name|shop|рф".split("|");LinkifyIt.prototype.add=function(schema,definition){return this.__schemas__[schema]=definition,compile(this),this},LinkifyIt.prototype.set=function(options){return this.__opts__=assign(this.__opts__,options),this},LinkifyIt.prototype.test=function(text){if(this.__text_cache__=text,this.__index__=-1,!text.length)return!1;var m,ml,me,len,shift,next,re,tld_pos;if(this.re.schema_test.test(text))for((re=this.re.schema_search).lastIndex=0;null!==(m=re.exec(text));)if(len=this.testSchemaAt(text,m[2],re.lastIndex)){this.__schema__=m[2],this.__index__=m.index+m[1].length,this.__last_index__=m.index+m[0].length+len;break}return this.__opts__.fuzzyLink&&this.__compiled__["http:"]&&(tld_pos=text.search(this.re.host_fuzzy_test))>=0&&(this.__index__<0||tld_pos<this.__index__)&&null!==(ml=text.match(this.__opts__.fuzzyIP?this.re.link_fuzzy:this.re.link_no_ip_fuzzy))&&(shift=ml.index+ml[1].length,(this.__index__<0||shift<this.__index__)&&(this.__schema__="",this.__index__=shift,this.__last_index__=ml.index+ml[0].length)),this.__opts__.fuzzyEmail&&this.__compiled__["mailto:"]&&text.indexOf("@")>=0&&null!==(me=text.match(this.re.email_fuzzy))&&(shift=me.index+me[1].length,next=me.index+me[0].length,(this.__index__<0||shift<this.__index__||shift===this.__index__&&next>this.__last_index__)&&(this.__schema__="mailto:",this.__index__=shift,this.__last_index__=next)),this.__index__>=0},LinkifyIt.prototype.pretest=function(text){return this.re.pretest.test(text)},LinkifyIt.prototype.testSchemaAt=function(text,schema,pos){return this.__compiled__[schema.toLowerCase()]?this.__compiled__[schema.toLowerCase()].validate(text,pos,this):0},LinkifyIt.prototype.match=function(text){var shift=0,result=[];this.__index__>=0&&this.__text_cache__===text&&(result.push(createMatch(this,shift)),shift=this.__last_index__);for(var tail=shift?text.slice(shift):text;this.test(tail);)result.push(createMatch(this,shift)),tail=tail.slice(this.__last_index__),shift+=this.__last_index__;return result.length?result:null},LinkifyIt.prototype.tlds=function(list,keepOld){return list=Array.isArray(list)?list:[list],keepOld?(this.__tlds__=this.__tlds__.concat(list).sort().filter(function(el,idx,arr){return el!==arr[idx-1]}).reverse(),compile(this),this):(this.__tlds__=list.slice(),this.__tlds_replaced__=!0,compile(this),this)},LinkifyIt.prototype.normalize=function(match){match.schema||(match.url="http://"+match.url),"mailto:"!==match.schema||/^mailto:/i.test(match.url)||(match.url="mailto:"+match.url)},LinkifyIt.prototype.onCompile=function(){},module.exports=LinkifyIt},{"./lib/re":171}],171:[function(require,module,exports){"use strict";module.exports=function(opts){var re={};re.src_Any=require("uc.micro/properties/Any/regex").source,re.src_Cc=require("uc.micro/categories/Cc/regex").source,re.src_Z=require("uc.micro/categories/Z/regex").source,re.src_P=require("uc.micro/categories/P/regex").source,re.src_ZPCc=[re.src_Z,re.src_P,re.src_Cc].join("|"),re.src_ZCc=[re.src_Z,re.src_Cc].join("|");return re.src_pseudo_letter="(?:(?![><｜]|"+re.src_ZPCc+")"+re.src_Any+")",re.src_ip4="(?:(25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)\\.){3}(25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)",re.src_auth="(?:(?:(?!"+re.src_ZCc+"|[@/\\[\\]()]).)+@)?",re.src_port="(?::(?:6(?:[0-4]\\d{3}|5(?:[0-4]\\d{2}|5(?:[0-2]\\d|3[0-5])))|[1-5]?\\d{1,4}))?",re.src_host_terminator="(?=$|[><｜]|"+re.src_ZPCc+")(?!-|_|:\\d|\\.-|\\.(?!$|"+re.src_ZPCc+"))",re.src_path="(?:[/?#](?:(?!"+re.src_ZCc+"|[><｜]|[()[\\]{}.,\"'?!\\-]).|\\[(?:(?!"+re.src_ZCc+"|\\]).)*\\]|\\((?:(?!"+re.src_ZCc+"|[)]).)*\\)|\\{(?:(?!"+re.src_ZCc+'|[}]).)*\\}|\\"(?:(?!'+re.src_ZCc+'|["]).)+\\"|\\\'(?:(?!'+re.src_ZCc+"|[']).)+\\'|\\'(?="+re.src_pseudo_letter+"|[-]).|\\.{2,3}[a-zA-Z0-9%/]|\\.(?!"+re.src_ZCc+"|[.]).|"+(opts&&opts["---"]?"\\-(?!--(?:[^-]|$))(?:-*)|":"\\-+|")+"\\,(?!"+re.src_ZCc+").|\\!(?!"+re.src_ZCc+"|[!]).|\\?(?!"+re.src_ZCc+"|[?]).)+|\\/)?",re.src_email_name='[\\-;:&=\\+\\$,\\"\\.a-zA-Z0-9_]+',re.src_xn="xn--[a-z0-9\\-]{1,59}",re.src_domain_root="(?:"+re.src_xn+"|"+re.src_pseudo_letter+"{1,63})",re.src_domain="(?:"+re.src_xn+"|(?:"+re.src_pseudo_letter+")|(?:"+re.src_pseudo_letter+"(?:-(?!-)|"+re.src_pseudo_letter+"){0,61}"+re.src_pseudo_letter+"))",re.src_host="(?:(?:(?:(?:"+re.src_domain+")\\.)*"+re.src_domain+"))",re.tpl_host_fuzzy="(?:"+re.src_ip4+"|(?:(?:(?:"+re.src_domain+")\\.)+(?:%TLDS%)))",re.tpl_host_no_ip_fuzzy="(?:(?:(?:"+re.src_domain+")\\.)+(?:%TLDS%))",re.src_host_strict=re.src_host+re.src_host_terminator,re.tpl_host_fuzzy_strict=re.tpl_host_fuzzy+re.src_host_terminator,re.src_host_port_strict=re.src_host+re.src_port+re.src_host_terminator,re.tpl_host_port_fuzzy_strict=re.tpl_host_fuzzy+re.src_port+re.src_host_terminator,re.tpl_host_port_no_ip_fuzzy_strict=re.tpl_host_no_ip_fuzzy+re.src_port+re.src_host_terminator,re.tpl_host_fuzzy_test="localhost|www\\.|\\.\\d{1,3}\\.|(?:\\.(?:%TLDS%)(?:"+re.src_ZPCc+"|>|$))",re.tpl_email_fuzzy="(^|[><｜]|\\(|"+re.src_ZCc+")("+re.src_email_name+"@"+re.tpl_host_fuzzy_strict+")",re.tpl_link_fuzzy="(^|(?![.:/\\-_@])(?:[$+<=>^`|｜]|"+re.src_ZPCc+"))((?![$+<=>^`|｜])"+re.tpl_host_port_fuzzy_strict+re.src_path+")",re.tpl_link_no_ip_fuzzy="(^|(?![.:/\\-_@])(?:[$+<=>^`|｜]|"+re.src_ZPCc+"))((?![$+<=>^`|｜])"+re.tpl_host_port_no_ip_fuzzy_strict+re.src_path+")",re}},{"uc.micro/categories/Cc/regex":236,"uc.micro/categories/P/regex":238,"uc.micro/categories/Z/regex":239,"uc.micro/properties/Any/regex":241}],172:[function(require,module,exports){"use strict";module.exports=require("./lib/")},{"./lib/":181}],173:[function(require,module,exports){"use strict";module.exports=require("entities/maps/entities.json")},{"entities/maps/entities.json":66}],174:[function(require,module,exports){"use strict";module.exports=["address","article","aside","base","basefont","blockquote","body","caption","center","col","colgroup","dd","details","dialog","dir","div","dl","dt","fieldset","figcaption","figure","footer","form","frame","frameset","h1","h2","h3","h4","h5","h6","head","header","hr","html","iframe","legend","li","link","main","menu","menuitem","meta","nav","noframes","ol","optgroup","option","p","param","section","source","summary","table","tbody","td","tfoot","th","thead","title","tr","track","ul"]},{}],175:[function(require,module,exports){"use strict";var open_tag="<[A-Za-z][A-Za-z0-9\\-]*(?:\\s+[a-zA-Z_:][a-zA-Z0-9:._-]*(?:\\s*=\\s*(?:[^\"'=<>`\\x00-\\x20]+|'[^']*'|\"[^\"]*\"))?)*\\s*\\/?>",close_tag="<\\/[A-Za-z][A-Za-z0-9\\-]*\\s*>",HTML_TAG_RE=new RegExp("^(?:"+open_tag+"|"+close_tag+"|\x3c!----\x3e|\x3c!--(?:-?[^>-])(?:-?[^-])*--\x3e|<[?].*?[?]>|<![A-Z]+\\s+[^>]*>|<!\\[CDATA\\[[\\s\\S]*?\\]\\]>)"),HTML_OPEN_CLOSE_TAG_RE=new RegExp("^(?:"+open_tag+"|"+close_tag+")");module.exports.HTML_TAG_RE=HTML_TAG_RE,module.exports.HTML_OPEN_CLOSE_TAG_RE=HTML_OPEN_CLOSE_TAG_RE},{}],176:[function(require,module,exports){"use strict";function _class(obj){return Object.prototype.toString.call(obj)}function has(object,key){return _hasOwnProperty.call(object,key)}function isValidEntityCode(c){return!(c>=55296&&c<=57343)&&(!(c>=64976&&c<=65007)&&(65535!=(65535&c)&&65534!=(65535&c)&&(!(c>=0&&c<=8)&&(11!==c&&(!(c>=14&&c<=31)&&(!(c>=127&&c<=159)&&!(c>1114111)))))))}function fromCodePoint(c){if(c>65535){var surrogate1=55296+((c-=65536)>>10),surrogate2=56320+(1023&c);return String.fromCharCode(surrogate1,surrogate2)}return String.fromCharCode(c)}function replaceEntityPattern(match,name){var code=0;return has(entities,name)?entities[name]:35===name.charCodeAt(0)&&DIGITAL_ENTITY_TEST_RE.test(name)&&(code="x"===name[1].toLowerCase()?parseInt(name.slice(2),16):parseInt(name.slice(1),10),isValidEntityCode(code))?fromCodePoint(code):match}function replaceUnsafeChar(ch){return HTML_REPLACEMENTS[ch]}var _hasOwnProperty=Object.prototype.hasOwnProperty,UNESCAPE_MD_RE=/\\([!"#$%&'()*+,\-.\/:;<=>?@[\\\]^_`{|}~])/g,ENTITY_RE=/&([a-z#][a-z0-9]{1,31});/gi,UNESCAPE_ALL_RE=new RegExp(UNESCAPE_MD_RE.source+"|"+ENTITY_RE.source,"gi"),DIGITAL_ENTITY_TEST_RE=/^#((?:x[a-f0-9]{1,8}|[0-9]{1,8}))/i,entities=require("./entities"),HTML_ESCAPE_TEST_RE=/[&<>"]/,HTML_ESCAPE_REPLACE_RE=/[&<>"]/g,HTML_REPLACEMENTS={"&":"&amp;","<":"&lt;",">":"&gt;",'"':"&quot;"},REGEXP_ESCAPE_RE=/[.?*+^$[\]\\(){}|-]/g,UNICODE_PUNCT_RE=require("uc.micro/categories/P/regex");exports.lib={},exports.lib.mdurl=require("mdurl"),exports.lib.ucmicro=require("uc.micro"),exports.assign=function(obj){return Array.prototype.slice.call(arguments,1).forEach(function(source){if(source){if("object"!=typeof source)throw new TypeError(source+"must be object");Object.keys(source).forEach(function(key){obj[key]=source[key]})}}),obj},exports.isString=function(obj){return"[object String]"===_class(obj)},exports.has=has,exports.unescapeMd=function(str){return str.indexOf("\\")<0?str:str.replace(UNESCAPE_MD_RE,"$1")},exports.unescapeAll=function(str){return str.indexOf("\\")<0&&str.indexOf("&")<0?str:str.replace(UNESCAPE_ALL_RE,function(match,escaped,entity){return escaped||replaceEntityPattern(match,entity)})},exports.isValidEntityCode=isValidEntityCode,exports.fromCodePoint=fromCodePoint,exports.escapeHtml=function(str){return HTML_ESCAPE_TEST_RE.test(str)?str.replace(HTML_ESCAPE_REPLACE_RE,replaceUnsafeChar):str},exports.arrayReplaceAt=function(src,pos,newElements){return[].concat(src.slice(0,pos),newElements,src.slice(pos+1))},exports.isSpace=function(code){switch(code){case 9:case 32:return!0}return!1},exports.isWhiteSpace=function(code){if(code>=8192&&code<=8202)return!0;switch(code){case 9:case 10:case 11:case 12:case 13:case 32:case 160:case 5760:case 8239:case 8287:case 12288:return!0}return!1},exports.isMdAsciiPunct=function(ch){switch(ch){case 33:case 34:case 35:case 36:case 37:case 38:case 39:case 40:case 41:case 42:case 43:case 44:case 45:case 46:case 47:case 58:case 59:case 60:case 61:case 62:case 63:case 64:case 91:case 92:case 93:case 94:case 95:case 96:case 123:case 124:case 125:case 126:return!0;default:return!1}},exports.isPunctChar=function(ch){return UNICODE_PUNCT_RE.test(ch)},exports.escapeRE=function(str){return str.replace(REGEXP_ESCAPE_RE,"\\$&")},exports.normalizeReference=function(str){return str.trim().replace(/\s+/g," ").toUpperCase()}},{"./entities":173,mdurl:227,"uc.micro":240,"uc.micro/categories/P/regex":238}],177:[function(require,module,exports){"use strict";exports.parseLinkLabel=require("./parse_link_label"),exports.parseLinkDestination=require("./parse_link_destination"),exports.parseLinkTitle=require("./parse_link_title")},{"./parse_link_destination":178,"./parse_link_label":179,"./parse_link_title":180}],178:[function(require,module,exports){"use strict";var isSpace=require("../common/utils").isSpace,unescapeAll=require("../common/utils").unescapeAll;module.exports=function(str,pos,max){var code,level,start=pos,result={ok:!1,pos:0,lines:0,str:""};if(60===str.charCodeAt(pos)){for(pos++;pos<max;){if(10===(code=str.charCodeAt(pos))||isSpace(code))return result;if(62===code)return result.pos=pos+1,result.str=unescapeAll(str.slice(start+1,pos)),result.ok=!0,result;92===code&&pos+1<max?pos+=2:pos++}return result}for(level=0;pos<max&&32!==(code=str.charCodeAt(pos))&&!(code<32||127===code);)if(92===code&&pos+1<max)pos+=2;else{if(40===code&&level++,41===code){if(0===level)break;level--}pos++}return start===pos?result:0!==level?result:(result.str=unescapeAll(str.slice(start,pos)),result.lines=0,result.pos=pos,result.ok=!0,result)}},{"../common/utils":176}],179:[function(require,module,exports){"use strict";module.exports=function(state,start,disableNested){var level,found,marker,prevPos,labelEnd=-1,max=state.posMax,oldPos=state.pos;for(state.pos=start+1,level=1;state.pos<max;){if(93===(marker=state.src.charCodeAt(state.pos))&&0==--level){found=!0;break}if(prevPos=state.pos,state.md.inline.skipToken(state),91===marker)if(prevPos===state.pos-1)level++;else if(disableNested)return state.pos=oldPos,-1}return found&&(labelEnd=state.pos),state.pos=oldPos,labelEnd}},{}],180:[function(require,module,exports){"use strict";var unescapeAll=require("../common/utils").unescapeAll;module.exports=function(str,pos,max){var code,marker,lines=0,start=pos,result={ok:!1,pos:0,lines:0,str:""};if(pos>=max)return result;if(34!==(marker=str.charCodeAt(pos))&&39!==marker&&40!==marker)return result;for(pos++,40===marker&&(marker=41);pos<max;){if((code=str.charCodeAt(pos))===marker)return result.pos=pos+1,result.lines=lines,result.str=unescapeAll(str.slice(start+1,pos)),result.ok=!0,result;10===code?lines++:92===code&&pos+1<max&&(pos++,10===str.charCodeAt(pos)&&lines++),pos++}return result}},{"../common/utils":176}],181:[function(require,module,exports){"use strict";function validateLink(url){var str=url.trim().toLowerCase();return!BAD_PROTO_RE.test(str)||!!GOOD_DATA_RE.test(str)}function normalizeLink(url){var parsed=mdurl.parse(url,!0);if(parsed.hostname&&(!parsed.protocol||RECODE_HOSTNAME_FOR.indexOf(parsed.protocol)>=0))try{parsed.hostname=punycode.toASCII(parsed.hostname)}catch(er){}return mdurl.encode(mdurl.format(parsed))}function normalizeLinkText(url){var parsed=mdurl.parse(url,!0);if(parsed.hostname&&(!parsed.protocol||RECODE_HOSTNAME_FOR.indexOf(parsed.protocol)>=0))try{parsed.hostname=punycode.toUnicode(parsed.hostname)}catch(er){}return mdurl.decode(mdurl.format(parsed))}function MarkdownIt(presetName,options){if(!(this instanceof MarkdownIt))return new MarkdownIt(presetName,options);options||utils.isString(presetName)||(options=presetName||{},presetName="default"),this.inline=new ParserInline,this.block=new ParserBlock,this.core=new ParserCore,this.renderer=new Renderer,this.linkify=new LinkifyIt,this.validateLink=validateLink,this.normalizeLink=normalizeLink,this.normalizeLinkText=normalizeLinkText,this.utils=utils,this.helpers=utils.assign({},helpers),this.options={},this.configure(presetName),options&&this.set(options)}var utils=require("./common/utils"),helpers=require("./helpers"),Renderer=require("./renderer"),ParserCore=require("./parser_core"),ParserBlock=require("./parser_block"),ParserInline=require("./parser_inline"),LinkifyIt=require("linkify-it"),mdurl=require("mdurl"),punycode=require("punycode"),config={default:require("./presets/default"),zero:require("./presets/zero"),commonmark:require("./presets/commonmark")},BAD_PROTO_RE=/^(vbscript|javascript|file|data):/,GOOD_DATA_RE=/^data:image\/(gif|png|jpeg|webp);/,RECODE_HOSTNAME_FOR=["http:","https:","mailto:"];MarkdownIt.prototype.set=function(options){return utils.assign(this.options,options),this},MarkdownIt.prototype.configure=function(presets){var presetName,self=this;if(utils.isString(presets)&&(presetName=presets,!(presets=config[presetName])))throw new Error('Wrong `markdown-it` preset "'+presetName+'", check name');if(!presets)throw new Error("Wrong `markdown-it` preset, can't be empty");return presets.options&&self.set(presets.options),presets.components&&Object.keys(presets.components).forEach(function(name){presets.components[name].rules&&self[name].ruler.enableOnly(presets.components[name].rules),presets.components[name].rules2&&self[name].ruler2.enableOnly(presets.components[name].rules2)}),this},MarkdownIt.prototype.enable=function(list,ignoreInvalid){var result=[];Array.isArray(list)||(list=[list]),["core","block","inline"].forEach(function(chain){result=result.concat(this[chain].ruler.enable(list,!0))},this),result=result.concat(this.inline.ruler2.enable(list,!0));var missed=list.filter(function(name){return result.indexOf(name)<0});if(missed.length&&!ignoreInvalid)throw new Error("MarkdownIt. Failed to enable unknown rule(s): "+missed);return this},MarkdownIt.prototype.disable=function(list,ignoreInvalid){var result=[];Array.isArray(list)||(list=[list]),["core","block","inline"].forEach(function(chain){result=result.concat(this[chain].ruler.disable(list,!0))},this),result=result.concat(this.inline.ruler2.disable(list,!0));var missed=list.filter(function(name){return result.indexOf(name)<0});if(missed.length&&!ignoreInvalid)throw new Error("MarkdownIt. Failed to disable unknown rule(s): "+missed);return this},MarkdownIt.prototype.use=function(plugin){var args=[this].concat(Array.prototype.slice.call(arguments,1));return plugin.apply(plugin,args),this},MarkdownIt.prototype.parse=function(src,env){if("string"!=typeof src)throw new Error("Input data should be a String");var state=new this.core.State(src,this,env);return this.core.process(state),state.tokens},MarkdownIt.prototype.render=function(src,env){return env=env||{},this.renderer.render(this.parse(src,env),this.options,env)},MarkdownIt.prototype.parseInline=function(src,env){var state=new this.core.State(src,this,env);return state.inlineMode=!0,this.core.process(state),state.tokens},MarkdownIt.prototype.renderInline=function(src,env){return env=env||{},this.renderer.render(this.parseInline(src,env),this.options,env)},module.exports=MarkdownIt},{"./common/utils":176,"./helpers":177,"./parser_block":182,"./parser_core":183,"./parser_inline":184,"./presets/commonmark":185,"./presets/default":186,"./presets/zero":187,"./renderer":188,"linkify-it":170,mdurl:227,punycode:235}],182:[function(require,module,exports){"use strict";function ParserBlock(){this.ruler=new Ruler;for(var i=0;i<_rules.length;i++)this.ruler.push(_rules[i][0],_rules[i][1],{alt:(_rules[i][2]||[]).slice()})}var Ruler=require("./ruler"),_rules=[["table",require("./rules_block/table"),["paragraph","reference"]],["code",require("./rules_block/code")],["fence",require("./rules_block/fence"),["paragraph","reference","blockquote","list"]],["blockquote",require("./rules_block/blockquote"),["paragraph","reference","blockquote","list"]],["hr",require("./rules_block/hr"),["paragraph","reference","blockquote","list"]],["list",require("./rules_block/list"),["paragraph","reference","blockquote"]],["reference",require("./rules_block/reference")],["heading",require("./rules_block/heading"),["paragraph","reference","blockquote"]],["lheading",require("./rules_block/lheading")],["html_block",require("./rules_block/html_block"),["paragraph","reference","blockquote"]],["paragraph",require("./rules_block/paragraph")]];ParserBlock.prototype.tokenize=function(state,startLine,endLine){for(var i,rules=this.ruler.getRules(""),len=rules.length,line=startLine,hasEmptyLines=!1,maxNesting=state.md.options.maxNesting;line<endLine&&(state.line=line=state.skipEmptyLines(line),!(line>=endLine))&&!(state.sCount[line]<state.blkIndent);){if(state.level>=maxNesting){state.line=endLine;break}for(i=0;i<len&&!rules[i](state,line,endLine,!1);i++);state.tight=!hasEmptyLines,state.isEmpty(state.line-1)&&(hasEmptyLines=!0),(line=state.line)<endLine&&state.isEmpty(line)&&(hasEmptyLines=!0,line++,state.line=line)}},ParserBlock.prototype.parse=function(src,md,env,outTokens){var state;src&&(state=new this.State(src,md,env,outTokens),this.tokenize(state,state.line,state.lineMax))},ParserBlock.prototype.State=require("./rules_block/state_block"),module.exports=ParserBlock},{"./ruler":189,"./rules_block/blockquote":190,"./rules_block/code":191,"./rules_block/fence":192,"./rules_block/heading":193,"./rules_block/hr":194,"./rules_block/html_block":195,"./rules_block/lheading":196,"./rules_block/list":197,"./rules_block/paragraph":198,"./rules_block/reference":199,"./rules_block/state_block":200,"./rules_block/table":201}],183:[function(require,module,exports){"use strict";function Core(){this.ruler=new Ruler;for(var i=0;i<_rules.length;i++)this.ruler.push(_rules[i][0],_rules[i][1])}var Ruler=require("./ruler"),_rules=[["normalize",require("./rules_core/normalize")],["block",require("./rules_core/block")],["inline",require("./rules_core/inline")],["linkify",require("./rules_core/linkify")],["replacements",require("./rules_core/replacements")],["smartquotes",require("./rules_core/smartquotes")]];Core.prototype.process=function(state){var i,l,rules;for(i=0,l=(rules=this.ruler.getRules("")).length;i<l;i++)rules[i](state)},Core.prototype.State=require("./rules_core/state_core"),module.exports=Core},{"./ruler":189,"./rules_core/block":202,"./rules_core/inline":203,"./rules_core/linkify":204,"./rules_core/normalize":205,"./rules_core/replacements":206,"./rules_core/smartquotes":207,"./rules_core/state_core":208}],184:[function(require,module,exports){"use strict";function ParserInline(){var i;for(this.ruler=new Ruler,i=0;i<_rules.length;i++)this.ruler.push(_rules[i][0],_rules[i][1]);for(this.ruler2=new Ruler,i=0;i<_rules2.length;i++)this.ruler2.push(_rules2[i][0],_rules2[i][1])}var Ruler=require("./ruler"),_rules=[["text",require("./rules_inline/text")],["newline",require("./rules_inline/newline")],["escape",require("./rules_inline/escape")],["backticks",require("./rules_inline/backticks")],["strikethrough",require("./rules_inline/strikethrough").tokenize],["emphasis",require("./rules_inline/emphasis").tokenize],["link",require("./rules_inline/link")],["image",require("./rules_inline/image")],["autolink",require("./rules_inline/autolink")],["html_inline",require("./rules_inline/html_inline")],["entity",require("./rules_inline/entity")]],_rules2=[["balance_pairs",require("./rules_inline/balance_pairs")],["strikethrough",require("./rules_inline/strikethrough").postProcess],["emphasis",require("./rules_inline/emphasis").postProcess],["text_collapse",require("./rules_inline/text_collapse")]];ParserInline.prototype.skipToken=function(state){var ok,i,pos=state.pos,rules=this.ruler.getRules(""),len=rules.length,maxNesting=state.md.options.maxNesting,cache=state.cache;if(void 0===cache[pos]){if(state.level<maxNesting)for(i=0;i<len&&(state.level++,ok=rules[i](state,!0),state.level--,!ok);i++);else state.pos=state.posMax;ok||state.pos++,cache[pos]=state.pos}else state.pos=cache[pos]},ParserInline.prototype.tokenize=function(state){for(var ok,i,rules=this.ruler.getRules(""),len=rules.length,end=state.posMax,maxNesting=state.md.options.maxNesting;state.pos<end;){if(state.level<maxNesting)for(i=0;i<len&&!(ok=rules[i](state,!1));i++);if(ok){if(state.pos>=end)break}else state.pending+=state.src[state.pos++]}state.pending&&state.pushPending()},ParserInline.prototype.parse=function(str,md,env,outTokens){var i,rules,len,state=new this.State(str,md,env,outTokens);for(this.tokenize(state),len=(rules=this.ruler2.getRules("")).length,i=0;i<len;i++)rules[i](state)},ParserInline.prototype.State=require("./rules_inline/state_inline"),module.exports=ParserInline},{"./ruler":189,"./rules_inline/autolink":209,"./rules_inline/backticks":210,"./rules_inline/balance_pairs":211,"./rules_inline/emphasis":212,"./rules_inline/entity":213,"./rules_inline/escape":214,"./rules_inline/html_inline":215,"./rules_inline/image":216,"./rules_inline/link":217,"./rules_inline/newline":218,"./rules_inline/state_inline":219,"./rules_inline/strikethrough":220,"./rules_inline/text":221,"./rules_inline/text_collapse":222}],185:[function(require,module,exports){"use strict";module.exports={options:{html:!0,xhtmlOut:!0,breaks:!1,langPrefix:"language-",linkify:!1,typographer:!1,quotes:"“”‘’",highlight:null,maxNesting:20},components:{core:{rules:["normalize","block","inline"]},block:{rules:["blockquote","code","fence","heading","hr","html_block","lheading","list","reference","paragraph"]},inline:{rules:["autolink","backticks","emphasis","entity","escape","html_inline","image","link","newline","text"],rules2:["balance_pairs","emphasis","text_collapse"]}}}},{}],186:[function(require,module,exports){"use strict";module.exports={options:{html:!1,xhtmlOut:!1,breaks:!1,langPrefix:"language-",linkify:!1,typographer:!1,quotes:"“”‘’",highlight:null,maxNesting:100},components:{core:{},block:{},inline:{}}}},{}],187:[function(require,module,exports){"use strict";module.exports={options:{html:!1,xhtmlOut:!1,breaks:!1,langPrefix:"language-",linkify:!1,typographer:!1,quotes:"“”‘’",highlight:null,maxNesting:20},components:{core:{rules:["normalize","block","inline"]},block:{rules:["paragraph"]},inline:{rules:["text"],rules2:["balance_pairs","text_collapse"]}}}},{}],188:[function(require,module,exports){"use strict";function Renderer(){this.rules=assign({},default_rules)}var assign=require("./common/utils").assign,unescapeAll=require("./common/utils").unescapeAll,escapeHtml=require("./common/utils").escapeHtml,default_rules={};default_rules.code_inline=function(tokens,idx,options,env,slf){var token=tokens[idx];return"<code"+slf.renderAttrs(token)+">"+escapeHtml(tokens[idx].content)+"</code>"},default_rules.code_block=function(tokens,idx,options,env,slf){var token=tokens[idx];return"<pre"+slf.renderAttrs(token)+"><code>"+escapeHtml(tokens[idx].content)+"</code></pre>\n"},default_rules.fence=function(tokens,idx,options,env,slf){var highlighted,i,tmpAttrs,tmpToken,token=tokens[idx],info=token.info?unescapeAll(token.info).trim():"",langName="";return info&&(langName=info.split(/\s+/g)[0]),0===(highlighted=options.highlight?options.highlight(token.content,langName)||escapeHtml(token.content):escapeHtml(token.content)).indexOf("<pre")?highlighted+"\n":info?(i=token.attrIndex("class"),tmpAttrs=token.attrs?token.attrs.slice():[],i<0?tmpAttrs.push(["class",options.langPrefix+langName]):tmpAttrs[i][1]+=" "+options.langPrefix+langName,tmpToken={attrs:tmpAttrs},"<pre><code"+slf.renderAttrs(tmpToken)+">"+highlighted+"</code></pre>\n"):"<pre><code"+slf.renderAttrs(token)+">"+highlighted+"</code></pre>\n"},default_rules.image=function(tokens,idx,options,env,slf){var token=tokens[idx];return token.attrs[token.attrIndex("alt")][1]=slf.renderInlineAsText(token.children,options,env),slf.renderToken(tokens,idx,options)},default_rules.hardbreak=function(tokens,idx,options){return options.xhtmlOut?"<br />\n":"<br>\n"},default_rules.softbreak=function(tokens,idx,options){return options.breaks?options.xhtmlOut?"<br />\n":"<br>\n":"\n"},default_rules.text=function(tokens,idx){return escapeHtml(tokens[idx].content)},default_rules.html_block=function(tokens,idx){return tokens[idx].content},default_rules.html_inline=function(tokens,idx){return tokens[idx].content},Renderer.prototype.renderAttrs=function(token){var i,l,result;if(!token.attrs)return"";for(result="",i=0,l=token.attrs.length;i<l;i++)result+=" "+escapeHtml(token.attrs[i][0])+'="'+escapeHtml(token.attrs[i][1])+'"';return result},Renderer.prototype.renderToken=function(tokens,idx,options){var nextToken,result="",needLf=!1,token=tokens[idx];return token.hidden?"":(token.block&&-1!==token.nesting&&idx&&tokens[idx-1].hidden&&(result+="\n"),result+=(-1===token.nesting?"</":"<")+token.tag,result+=this.renderAttrs(token),0===token.nesting&&options.xhtmlOut&&(result+=" /"),token.block&&(needLf=!0,1===token.nesting&&idx+1<tokens.length&&("inline"===(nextToken=tokens[idx+1]).type||nextToken.hidden?needLf=!1:-1===nextToken.nesting&&nextToken.tag===token.tag&&(needLf=!1))),result+=needLf?">\n":">")},Renderer.prototype.renderInline=function(tokens,options,env){for(var type,result="",rules=this.rules,i=0,len=tokens.length;i<len;i++)void 0!==rules[type=tokens[i].type]?result+=rules[type](tokens,i,options,env,this):result+=this.renderToken(tokens,i,options);return result},Renderer.prototype.renderInlineAsText=function(tokens,options,env){for(var result="",i=0,len=tokens.length;i<len;i++)"text"===tokens[i].type?result+=tokens[i].content:"image"===tokens[i].type&&(result+=this.renderInlineAsText(tokens[i].children,options,env));return result},Renderer.prototype.render=function(tokens,options,env){var i,len,type,result="",rules=this.rules;for(i=0,len=tokens.length;i<len;i++)"inline"===(type=tokens[i].type)?result+=this.renderInline(tokens[i].children,options,env):void 0!==rules[type]?result+=rules[tokens[i].type](tokens,i,options,env,this):result+=this.renderToken(tokens,i,options,env);return result},module.exports=Renderer},{"./common/utils":176}],189:[function(require,module,exports){"use strict";function Ruler(){this.__rules__=[],this.__cache__=null}Ruler.prototype.__find__=function(name){for(var i=0;i<this.__rules__.length;i++)if(this.__rules__[i].name===name)return i;return-1},Ruler.prototype.__compile__=function(){var self=this,chains=[""];self.__rules__.forEach(function(rule){rule.enabled&&rule.alt.forEach(function(altName){chains.indexOf(altName)<0&&chains.push(altName)})}),self.__cache__={},chains.forEach(function(chain){self.__cache__[chain]=[],self.__rules__.forEach(function(rule){rule.enabled&&(chain&&rule.alt.indexOf(chain)<0||self.__cache__[chain].push(rule.fn))})})},Ruler.prototype.at=function(name,fn,options){var index=this.__find__(name),opt=options||{};if(-1===index)throw new Error("Parser rule not found: "+name);this.__rules__[index].fn=fn,this.__rules__[index].alt=opt.alt||[],this.__cache__=null},Ruler.prototype.before=function(beforeName,ruleName,fn,options){var index=this.__find__(beforeName),opt=options||{};if(-1===index)throw new Error("Parser rule not found: "+beforeName);this.__rules__.splice(index,0,{name:ruleName,enabled:!0,fn:fn,alt:opt.alt||[]}),this.__cache__=null},Ruler.prototype.after=function(afterName,ruleName,fn,options){var index=this.__find__(afterName),opt=options||{};if(-1===index)throw new Error("Parser rule not found: "+afterName);this.__rules__.splice(index+1,0,{name:ruleName,enabled:!0,fn:fn,alt:opt.alt||[]}),this.__cache__=null},Ruler.prototype.push=function(ruleName,fn,options){var opt=options||{};this.__rules__.push({name:ruleName,enabled:!0,fn:fn,alt:opt.alt||[]}),this.__cache__=null},Ruler.prototype.enable=function(list,ignoreInvalid){Array.isArray(list)||(list=[list]);var result=[];return list.forEach(function(name){var idx=this.__find__(name);if(idx<0){if(ignoreInvalid)return;throw new Error("Rules manager: invalid rule name "+name)}this.__rules__[idx].enabled=!0,result.push(name)},this),this.__cache__=null,result},Ruler.prototype.enableOnly=function(list,ignoreInvalid){Array.isArray(list)||(list=[list]),this.__rules__.forEach(function(rule){rule.enabled=!1}),this.enable(list,ignoreInvalid)},Ruler.prototype.disable=function(list,ignoreInvalid){Array.isArray(list)||(list=[list]);var result=[];return list.forEach(function(name){var idx=this.__find__(name);if(idx<0){if(ignoreInvalid)return;throw new Error("Rules manager: invalid rule name "+name)}this.__rules__[idx].enabled=!1,result.push(name)},this),this.__cache__=null,result},Ruler.prototype.getRules=function(chainName){return null===this.__cache__&&this.__compile__(),this.__cache__[chainName]||[]},module.exports=Ruler},{}],190:[function(require,module,exports){"use strict";var isSpace=require("../common/utils").isSpace;module.exports=function(state,startLine,endLine,silent){var adjustTab,ch,i,initial,l,lastLineEmpty,lines,nextLine,offset,oldBMarks,oldBSCount,oldIndent,oldParentType,oldSCount,oldTShift,spaceAfterMarker,terminate,terminatorRules,token,wasOutdented,oldLineMax=state.lineMax,pos=state.bMarks[startLine]+state.tShift[startLine],max=state.eMarks[startLine];if(state.sCount[startLine]-state.blkIndent>=4)return!1;if(62!==state.src.charCodeAt(pos++))return!1;if(silent)return!0;for(initial=offset=state.sCount[startLine]+pos-(state.bMarks[startLine]+state.tShift[startLine]),32===state.src.charCodeAt(pos)?(pos++,initial++,offset++,adjustTab=!1,spaceAfterMarker=!0):9===state.src.charCodeAt(pos)?(spaceAfterMarker=!0,(state.bsCount[startLine]+offset)%4==3?(pos++,initial++,offset++,adjustTab=!1):adjustTab=!0):spaceAfterMarker=!1,oldBMarks=[state.bMarks[startLine]],state.bMarks[startLine]=pos;pos<max&&(ch=state.src.charCodeAt(pos),isSpace(ch));)9===ch?offset+=4-(offset+state.bsCount[startLine]+(adjustTab?1:0))%4:offset++,pos++;for(oldBSCount=[state.bsCount[startLine]],state.bsCount[startLine]=state.sCount[startLine]+1+(spaceAfterMarker?1:0),lastLineEmpty=pos>=max,oldSCount=[state.sCount[startLine]],state.sCount[startLine]=offset-initial,oldTShift=[state.tShift[startLine]],state.tShift[startLine]=pos-state.bMarks[startLine],terminatorRules=state.md.block.ruler.getRules("blockquote"),oldParentType=state.parentType,state.parentType="blockquote",wasOutdented=!1,nextLine=startLine+1;nextLine<endLine&&(state.sCount[nextLine]<state.blkIndent&&(wasOutdented=!0),pos=state.bMarks[nextLine]+state.tShift[nextLine],max=state.eMarks[nextLine],!(pos>=max));nextLine++)if(62!==state.src.charCodeAt(pos++)||wasOutdented){if(lastLineEmpty)break;for(terminate=!1,i=0,l=terminatorRules.length;i<l;i++)if(terminatorRules[i](state,nextLine,endLine,!0)){terminate=!0;break}if(terminate){state.lineMax=nextLine,0!==state.blkIndent&&(oldBMarks.push(state.bMarks[nextLine]),oldBSCount.push(state.bsCount[nextLine]),oldTShift.push(state.tShift[nextLine]),oldSCount.push(state.sCount[nextLine]),state.sCount[nextLine]-=state.blkIndent);break}oldBMarks.push(state.bMarks[nextLine]),oldBSCount.push(state.bsCount[nextLine]),oldTShift.push(state.tShift[nextLine]),oldSCount.push(state.sCount[nextLine]),state.sCount[nextLine]=-1}else{for(initial=offset=state.sCount[nextLine]+pos-(state.bMarks[nextLine]+state.tShift[nextLine]),32===state.src.charCodeAt(pos)?(pos++,initial++,offset++,adjustTab=!1,spaceAfterMarker=!0):9===state.src.charCodeAt(pos)?(spaceAfterMarker=!0,(state.bsCount[nextLine]+offset)%4==3?(pos++,initial++,offset++,adjustTab=!1):adjustTab=!0):spaceAfterMarker=!1,oldBMarks.push(state.bMarks[nextLine]),state.bMarks[nextLine]=pos;pos<max&&(ch=state.src.charCodeAt(pos),isSpace(ch));)9===ch?offset+=4-(offset+state.bsCount[nextLine]+(adjustTab?1:0))%4:offset++,pos++;lastLineEmpty=pos>=max,oldBSCount.push(state.bsCount[nextLine]),state.bsCount[nextLine]=state.sCount[nextLine]+1+(spaceAfterMarker?1:0),oldSCount.push(state.sCount[nextLine]),state.sCount[nextLine]=offset-initial,oldTShift.push(state.tShift[nextLine]),state.tShift[nextLine]=pos-state.bMarks[nextLine]}for(oldIndent=state.blkIndent,state.blkIndent=0,(token=state.push("blockquote_open","blockquote",1)).markup=">",token.map=lines=[startLine,0],state.md.block.tokenize(state,startLine,nextLine),(token=state.push("blockquote_close","blockquote",-1)).markup=">",state.lineMax=oldLineMax,state.parentType=oldParentType,lines[1]=state.line,i=0;i<oldTShift.length;i++)state.bMarks[i+startLine]=oldBMarks[i],state.tShift[i+startLine]=oldTShift[i],state.sCount[i+startLine]=oldSCount[i],state.bsCount[i+startLine]=oldBSCount[i];return state.blkIndent=oldIndent,!0}},{"../common/utils":176}],191:[function(require,module,exports){"use strict";module.exports=function(state,startLine,endLine){var nextLine,last,token;if(state.sCount[startLine]-state.blkIndent<4)return!1;for(last=nextLine=startLine+1;nextLine<endLine;)if(state.isEmpty(nextLine))nextLine++;else{if(!(state.sCount[nextLine]-state.blkIndent>=4))break;last=++nextLine}return state.line=last,token=state.push("code_block","code",0),token.content=state.getLines(startLine,last,4+state.blkIndent,!0),token.map=[startLine,state.line],!0}},{}],192:[function(require,module,exports){"use strict";module.exports=function(state,startLine,endLine,silent){var marker,len,params,nextLine,mem,token,markup,haveEndMarker=!1,pos=state.bMarks[startLine]+state.tShift[startLine],max=state.eMarks[startLine];if(state.sCount[startLine]-state.blkIndent>=4)return!1;if(pos+3>max)return!1;if(126!==(marker=state.src.charCodeAt(pos))&&96!==marker)return!1;if(mem=pos,pos=state.skipChars(pos,marker),(len=pos-mem)<3)return!1;if(markup=state.src.slice(mem,pos),(params=state.src.slice(pos,max)).indexOf(String.fromCharCode(marker))>=0)return!1;if(silent)return!0;for(nextLine=startLine;!(++nextLine>=endLine)&&(pos=mem=state.bMarks[nextLine]+state.tShift[nextLine],max=state.eMarks[nextLine],!(pos<max&&state.sCount[nextLine]<state.blkIndent));)if(state.src.charCodeAt(pos)===marker&&!(state.sCount[nextLine]-state.blkIndent>=4||(pos=state.skipChars(pos,marker))-mem<len||(pos=state.skipSpaces(pos))<max)){haveEndMarker=!0;break}return len=state.sCount[startLine],state.line=nextLine+(haveEndMarker?1:0),token=state.push("fence","code",0),token.info=params,token.content=state.getLines(startLine+1,nextLine,len,!0),token.markup=markup,token.map=[startLine,state.line],!0}},{}],193:[function(require,module,exports){"use strict";var isSpace=require("../common/utils").isSpace;module.exports=function(state,startLine,endLine,silent){var ch,level,tmp,token,pos=state.bMarks[startLine]+state.tShift[startLine],max=state.eMarks[startLine];if(state.sCount[startLine]-state.blkIndent>=4)return!1;if(35!==(ch=state.src.charCodeAt(pos))||pos>=max)return!1;for(level=1,ch=state.src.charCodeAt(++pos);35===ch&&pos<max&&level<=6;)level++,ch=state.src.charCodeAt(++pos);return!(level>6||pos<max&&!isSpace(ch))&&(!!silent||(max=state.skipSpacesBack(max,pos),(tmp=state.skipCharsBack(max,35,pos))>pos&&isSpace(state.src.charCodeAt(tmp-1))&&(max=tmp),state.line=startLine+1,token=state.push("heading_open","h"+String(level),1),token.markup="########".slice(0,level),token.map=[startLine,state.line],token=state.push("inline","",0),token.content=state.src.slice(pos,max).trim(),token.map=[startLine,state.line],token.children=[],token=state.push("heading_close","h"+String(level),-1),token.markup="########".slice(0,level),!0))}},{"../common/utils":176}],194:[function(require,module,exports){"use strict";var isSpace=require("../common/utils").isSpace;module.exports=function(state,startLine,endLine,silent){var marker,cnt,ch,token,pos=state.bMarks[startLine]+state.tShift[startLine],max=state.eMarks[startLine];if(state.sCount[startLine]-state.blkIndent>=4)return!1;if(42!==(marker=state.src.charCodeAt(pos++))&&45!==marker&&95!==marker)return!1;for(cnt=1;pos<max;){if((ch=state.src.charCodeAt(pos++))!==marker&&!isSpace(ch))return!1;ch===marker&&cnt++}return!(cnt<3)&&(!!silent||(state.line=startLine+1,token=state.push("hr","hr",0),token.map=[startLine,state.line],token.markup=Array(cnt+1).join(String.fromCharCode(marker)),!0))}},{"../common/utils":176}],195:[function(require,module,exports){"use strict";var block_names=require("../common/html_blocks"),HTML_OPEN_CLOSE_TAG_RE=require("../common/html_re").HTML_OPEN_CLOSE_TAG_RE,HTML_SEQUENCES=[[/^<(script|pre|style)(?=(\s|>|$))/i,/<\/(script|pre|style)>/i,!0],[/^<!--/,/-->/,!0],[/^<\?/,/\?>/,!0],[/^<![A-Z]/,/>/,!0],[/^<!\[CDATA\[/,/\]\]>/,!0],[new RegExp("^</?("+block_names.join("|")+")(?=(\\s|/?>|$))","i"),/^$/,!0],[new RegExp(HTML_OPEN_CLOSE_TAG_RE.source+"\\s*$"),/^$/,!1]];module.exports=function(state,startLine,endLine,silent){var i,nextLine,token,lineText,pos=state.bMarks[startLine]+state.tShift[startLine],max=state.eMarks[startLine];if(state.sCount[startLine]-state.blkIndent>=4)return!1;if(!state.md.options.html)return!1;if(60!==state.src.charCodeAt(pos))return!1;for(lineText=state.src.slice(pos,max),i=0;i<HTML_SEQUENCES.length&&!HTML_SEQUENCES[i][0].test(lineText);i++);if(i===HTML_SEQUENCES.length)return!1;if(silent)return HTML_SEQUENCES[i][2];if(nextLine=startLine+1,!HTML_SEQUENCES[i][1].test(lineText))for(;nextLine<endLine&&!(state.sCount[nextLine]<state.blkIndent);nextLine++)if(pos=state.bMarks[nextLine]+state.tShift[nextLine],max=state.eMarks[nextLine],lineText=state.src.slice(pos,max),HTML_SEQUENCES[i][1].test(lineText)){0!==lineText.length&&nextLine++;break}return state.line=nextLine,token=state.push("html_block","",0),token.map=[startLine,nextLine],token.content=state.getLines(startLine,nextLine,state.blkIndent,!0),!0}},{"../common/html_blocks":174,"../common/html_re":175}],196:[function(require,module,exports){"use strict";module.exports=function(state,startLine,endLine){var content,terminate,i,l,token,pos,max,level,marker,oldParentType,nextLine=startLine+1,terminatorRules=state.md.block.ruler.getRules("paragraph");if(state.sCount[startLine]-state.blkIndent>=4)return!1;for(oldParentType=state.parentType,state.parentType="paragraph";nextLine<endLine&&!state.isEmpty(nextLine);nextLine++)if(!(state.sCount[nextLine]-state.blkIndent>3)){if(state.sCount[nextLine]>=state.blkIndent&&(pos=state.bMarks[nextLine]+state.tShift[nextLine],max=state.eMarks[nextLine],pos<max&&(45===(marker=state.src.charCodeAt(pos))||61===marker)&&(pos=state.skipChars(pos,marker),(pos=state.skipSpaces(pos))>=max))){level=61===marker?1:2;break}if(!(state.sCount[nextLine]<0)){for(terminate=!1,i=0,l=terminatorRules.length;i<l;i++)if(terminatorRules[i](state,nextLine,endLine,!0)){terminate=!0;break}if(terminate)break}}return!!level&&(content=state.getLines(startLine,nextLine,state.blkIndent,!1).trim(),state.line=nextLine+1,token=state.push("heading_open","h"+String(level),1),token.markup=String.fromCharCode(marker),token.map=[startLine,state.line],token=state.push("inline","",0),token.content=content,token.map=[startLine,state.line-1],token.children=[],token=state.push("heading_close","h"+String(level),-1),token.markup=String.fromCharCode(marker),state.parentType=oldParentType,!0)}},{}],197:[function(require,module,exports){"use strict";function skipBulletListMarker(state,startLine){var marker,pos,max,ch;return pos=state.bMarks[startLine]+state.tShift[startLine],max=state.eMarks[startLine],42!==(marker=state.src.charCodeAt(pos++))&&45!==marker&&43!==marker?-1:pos<max&&(ch=state.src.charCodeAt(pos),!isSpace(ch))?-1:pos}function skipOrderedListMarker(state,startLine){var ch,start=state.bMarks[startLine]+state.tShift[startLine],pos=start,max=state.eMarks[startLine];if(pos+1>=max)return-1;if((ch=state.src.charCodeAt(pos++))<48||ch>57)return-1;for(;;){if(pos>=max)return-1;if(!((ch=state.src.charCodeAt(pos++))>=48&&ch<=57)){if(41===ch||46===ch)break;return-1}if(pos-start>=10)return-1}return pos<max&&(ch=state.src.charCodeAt(pos),!isSpace(ch))?-1:pos}function markTightParagraphs(state,idx){var i,l,level=state.level+2;for(i=idx+2,l=state.tokens.length-2;i<l;i++)state.tokens[i].level===level&&"paragraph_open"===state.tokens[i].type&&(state.tokens[i+2].hidden=!0,state.tokens[i].hidden=!0,i+=2)}var isSpace=require("../common/utils").isSpace;module.exports=function(state,startLine,endLine,silent){var ch,contentStart,i,indent,indentAfterMarker,initial,isOrdered,itemLines,l,listLines,listTokIdx,markerCharCode,markerValue,max,nextLine,offset,oldIndent,oldLIndent,oldParentType,oldTShift,oldTight,pos,posAfterMarker,prevEmptyEnd,start,terminate,terminatorRules,token,isTerminatingParagraph=!1,tight=!0;if(state.sCount[startLine]-state.blkIndent>=4)return!1;if(silent&&"paragraph"===state.parentType&&state.tShift[startLine]>=state.blkIndent&&(isTerminatingParagraph=!0),(posAfterMarker=skipOrderedListMarker(state,startLine))>=0){if(isOrdered=!0,start=state.bMarks[startLine]+state.tShift[startLine],markerValue=Number(state.src.substr(start,posAfterMarker-start-1)),isTerminatingParagraph&&1!==markerValue)return!1}else{if(!((posAfterMarker=skipBulletListMarker(state,startLine))>=0))return!1;isOrdered=!1}if(isTerminatingParagraph&&state.skipSpaces(posAfterMarker)>=state.eMarks[startLine])return!1;if(markerCharCode=state.src.charCodeAt(posAfterMarker-1),silent)return!0;for(listTokIdx=state.tokens.length,isOrdered?(token=state.push("ordered_list_open","ol",1),1!==markerValue&&(token.attrs=[["start",markerValue]])):token=state.push("bullet_list_open","ul",1),token.map=listLines=[startLine,0],token.markup=String.fromCharCode(markerCharCode),nextLine=startLine,prevEmptyEnd=!1,terminatorRules=state.md.block.ruler.getRules("list"),oldParentType=state.parentType,state.parentType="list";nextLine<endLine;){for(pos=posAfterMarker,max=state.eMarks[nextLine],initial=offset=state.sCount[nextLine]+posAfterMarker-(state.bMarks[startLine]+state.tShift[startLine]);pos<max;){if(9===(ch=state.src.charCodeAt(pos)))offset+=4-(offset+state.bsCount[nextLine])%4;else{if(32!==ch)break;offset++}pos++}if(contentStart=pos,(indentAfterMarker=contentStart>=max?1:offset-initial)>4&&(indentAfterMarker=1),indent=initial+indentAfterMarker,token=state.push("list_item_open","li",1),token.markup=String.fromCharCode(markerCharCode),token.map=itemLines=[startLine,0],oldIndent=state.blkIndent,oldTight=state.tight,oldTShift=state.tShift[startLine],oldLIndent=state.sCount[startLine],state.blkIndent=indent,state.tight=!0,state.tShift[startLine]=contentStart-state.bMarks[startLine],state.sCount[startLine]=offset,contentStart>=max&&state.isEmpty(startLine+1)?state.line=Math.min(state.line+2,endLine):state.md.block.tokenize(state,startLine,endLine,!0),state.tight&&!prevEmptyEnd||(tight=!1),prevEmptyEnd=state.line-startLine>1&&state.isEmpty(state.line-1),state.blkIndent=oldIndent,state.tShift[startLine]=oldTShift,state.sCount[startLine]=oldLIndent,state.tight=oldTight,token=state.push("list_item_close","li",-1),token.markup=String.fromCharCode(markerCharCode),nextLine=startLine=state.line,itemLines[1]=nextLine,contentStart=state.bMarks[startLine],nextLine>=endLine)break;if(state.sCount[nextLine]<state.blkIndent)break;for(terminate=!1,i=0,l=terminatorRules.length;i<l;i++)if(terminatorRules[i](state,nextLine,endLine,!0)){terminate=!0;break}if(terminate)break;if(isOrdered){if((posAfterMarker=skipOrderedListMarker(state,nextLine))<0)break}else if((posAfterMarker=skipBulletListMarker(state,nextLine))<0)break;if(markerCharCode!==state.src.charCodeAt(posAfterMarker-1))break}return token=isOrdered?state.push("ordered_list_close","ol",-1):state.push("bullet_list_close","ul",-1),token.markup=String.fromCharCode(markerCharCode),listLines[1]=nextLine,state.line=nextLine,state.parentType=oldParentType,tight&&markTightParagraphs(state,listTokIdx),!0}},{"../common/utils":176}],198:[function(require,module,exports){"use strict";module.exports=function(state,startLine){var content,terminate,i,l,token,oldParentType,nextLine=startLine+1,terminatorRules=state.md.block.ruler.getRules("paragraph"),endLine=state.lineMax;for(oldParentType=state.parentType,state.parentType="paragraph";nextLine<endLine&&!state.isEmpty(nextLine);nextLine++)if(!(state.sCount[nextLine]-state.blkIndent>3||state.sCount[nextLine]<0)){for(terminate=!1,i=0,l=terminatorRules.length;i<l;i++)if(terminatorRules[i](state,nextLine,endLine,!0)){terminate=!0;break}if(terminate)break}return content=state.getLines(startLine,nextLine,state.blkIndent,!1).trim(),state.line=nextLine,token=state.push("paragraph_open","p",1),token.map=[startLine,state.line],token=state.push("inline","",0),token.content=content,token.map=[startLine,state.line],token.children=[],token=state.push("paragraph_close","p",-1),state.parentType=oldParentType,!0}},{}],199:[function(require,module,exports){"use strict";var normalizeReference=require("../common/utils").normalizeReference,isSpace=require("../common/utils").isSpace;module.exports=function(state,startLine,_endLine,silent){var ch,destEndPos,destEndLineNo,endLine,href,i,l,label,labelEnd,oldParentType,res,start,str,terminate,terminatorRules,title,lines=0,pos=state.bMarks[startLine]+state.tShift[startLine],max=state.eMarks[startLine],nextLine=startLine+1;if(state.sCount[startLine]-state.blkIndent>=4)return!1;if(91!==state.src.charCodeAt(pos))return!1;for(;++pos<max;)if(93===state.src.charCodeAt(pos)&&92!==state.src.charCodeAt(pos-1)){if(pos+1===max)return!1;if(58!==state.src.charCodeAt(pos+1))return!1;break}for(endLine=state.lineMax,terminatorRules=state.md.block.ruler.getRules("reference"),oldParentType=state.parentType,state.parentType="reference";nextLine<endLine&&!state.isEmpty(nextLine);nextLine++)if(!(state.sCount[nextLine]-state.blkIndent>3||state.sCount[nextLine]<0)){for(terminate=!1,i=0,l=terminatorRules.length;i<l;i++)if(terminatorRules[i](state,nextLine,endLine,!0)){terminate=!0;break}if(terminate)break}for(max=(str=state.getLines(startLine,nextLine,state.blkIndent,!1).trim()).length,pos=1;pos<max;pos++){if(91===(ch=str.charCodeAt(pos)))return!1;if(93===ch){labelEnd=pos;break}10===ch?lines++:92===ch&&++pos<max&&10===str.charCodeAt(pos)&&lines++}if(labelEnd<0||58!==str.charCodeAt(labelEnd+1))return!1;for(pos=labelEnd+2;pos<max;pos++)if(10===(ch=str.charCodeAt(pos)))lines++;else if(!isSpace(ch))break;if(!(res=state.md.helpers.parseLinkDestination(str,pos,max)).ok)return!1;if(href=state.md.normalizeLink(res.str),!state.md.validateLink(href))return!1;for(destEndPos=pos=res.pos,destEndLineNo=lines+=res.lines,start=pos;pos<max;pos++)if(10===(ch=str.charCodeAt(pos)))lines++;else if(!isSpace(ch))break;for(res=state.md.helpers.parseLinkTitle(str,pos,max),pos<max&&start!==pos&&res.ok?(title=res.str,pos=res.pos,lines+=res.lines):(title="",pos=destEndPos,lines=destEndLineNo);pos<max&&(ch=str.charCodeAt(pos),isSpace(ch));)pos++;if(pos<max&&10!==str.charCodeAt(pos)&&title)for(title="",pos=destEndPos,lines=destEndLineNo;pos<max&&(ch=str.charCodeAt(pos),isSpace(ch));)pos++;return!(pos<max&&10!==str.charCodeAt(pos))&&(!!(label=normalizeReference(str.slice(1,labelEnd)))&&(!!silent||(void 0===state.env.references&&(state.env.references={}),void 0===state.env.references[label]&&(state.env.references[label]={title:title,href:href}),state.parentType=oldParentType,state.line=startLine+lines+1,!0)))}},{"../common/utils":176}],200:[function(require,module,exports){"use strict";function StateBlock(src,md,env,tokens){var ch,s,start,pos,len,indent,offset,indent_found;for(this.src=src,this.md=md,this.env=env,this.tokens=tokens,this.bMarks=[],this.eMarks=[],this.tShift=[],this.sCount=[],this.bsCount=[],this.blkIndent=0,this.line=0,this.lineMax=0,this.tight=!1,this.ddIndent=-1,this.parentType="root",this.level=0,this.result="",indent_found=!1,start=pos=indent=offset=0,len=(s=this.src).length;pos<len;pos++){if(ch=s.charCodeAt(pos),!indent_found){if(isSpace(ch)){indent++,9===ch?offset+=4-offset%4:offset++;continue}indent_found=!0}10!==ch&&pos!==len-1||(10!==ch&&pos++,this.bMarks.push(start),this.eMarks.push(pos),this.tShift.push(indent),this.sCount.push(offset),this.bsCount.push(0),indent_found=!1,indent=0,offset=0,start=pos+1)}this.bMarks.push(s.length),this.eMarks.push(s.length),this.tShift.push(0),this.sCount.push(0),this.bsCount.push(0),this.lineMax=this.bMarks.length-1}var Token=require("../token"),isSpace=require("../common/utils").isSpace;StateBlock.prototype.push=function(type,tag,nesting){var token=new Token(type,tag,nesting);return token.block=!0,nesting<0&&this.level--,token.level=this.level,nesting>0&&this.level++,this.tokens.push(token),token},StateBlock.prototype.isEmpty=function(line){return this.bMarks[line]+this.tShift[line]>=this.eMarks[line]},StateBlock.prototype.skipEmptyLines=function(from){for(var max=this.lineMax;from<max&&!(this.bMarks[from]+this.tShift[from]<this.eMarks[from]);from++);return from},StateBlock.prototype.skipSpaces=function(pos){for(var ch,max=this.src.length;pos<max&&(ch=this.src.charCodeAt(pos),isSpace(ch));pos++);return pos},StateBlock.prototype.skipSpacesBack=function(pos,min){if(pos<=min)return pos;for(;pos>min;)if(!isSpace(this.src.charCodeAt(--pos)))return pos+1;return pos},StateBlock.prototype.skipChars=function(pos,code){for(var max=this.src.length;pos<max&&this.src.charCodeAt(pos)===code;pos++);return pos},StateBlock.prototype.skipCharsBack=function(pos,code,min){if(pos<=min)return pos;for(;pos>min;)if(code!==this.src.charCodeAt(--pos))return pos+1;return pos},StateBlock.prototype.getLines=function(begin,end,indent,keepLastLF){var i,lineIndent,ch,first,last,queue,lineStart,line=begin;if(begin>=end)return"";for(queue=new Array(end-begin),i=0;line<end;line++,i++){for(lineIndent=0,lineStart=first=this.bMarks[line],last=line+1<end||keepLastLF?this.eMarks[line]+1:this.eMarks[line];first<last&&lineIndent<indent;){if(ch=this.src.charCodeAt(first),isSpace(ch))9===ch?lineIndent+=4-(lineIndent+this.bsCount[line])%4:lineIndent++;else{if(!(first-lineStart<this.tShift[line]))break;lineIndent++}first++}queue[i]=lineIndent>indent?new Array(lineIndent-indent+1).join(" ")+this.src.slice(first,last):this.src.slice(first,last)}return queue.join("")},StateBlock.prototype.Token=Token,module.exports=StateBlock},{"../common/utils":176,"../token":223}],201:[function(require,module,exports){"use strict";function getLine(state,line){var pos=state.bMarks[line]+state.blkIndent,max=state.eMarks[line];return state.src.substr(pos,max-pos)}function escapedSplit(str){var ch,result=[],pos=0,max=str.length,escapes=0,lastPos=0,backTicked=!1,lastBackTick=0;for(ch=str.charCodeAt(pos);pos<max;)96===ch?backTicked?(backTicked=!1,lastBackTick=pos):escapes%2==0&&(backTicked=!0,lastBackTick=pos):124!==ch||escapes%2!=0||backTicked||(result.push(str.substring(lastPos,pos)),lastPos=pos+1),92===ch?escapes++:escapes=0,++pos===max&&backTicked&&(backTicked=!1,pos=lastBackTick+1),ch=str.charCodeAt(pos);return result.push(str.substring(lastPos)),result}var isSpace=require("../common/utils").isSpace;module.exports=function(state,startLine,endLine,silent){var ch,lineText,pos,i,nextLine,columns,columnCount,token,aligns,t,tableLines,tbodyLines;if(startLine+2>endLine)return!1;if(nextLine=startLine+1,state.sCount[nextLine]<state.blkIndent)return!1;if(state.sCount[nextLine]-state.blkIndent>=4)return!1;if((pos=state.bMarks[nextLine]+state.tShift[nextLine])>=state.eMarks[nextLine])return!1;if(124!==(ch=state.src.charCodeAt(pos++))&&45!==ch&&58!==ch)return!1;for(;pos<state.eMarks[nextLine];){if(124!==(ch=state.src.charCodeAt(pos))&&45!==ch&&58!==ch&&!isSpace(ch))return!1;pos++}for(columns=(lineText=getLine(state,startLine+1)).split("|"),aligns=[],i=0;i<columns.length;i++){if(!(t=columns[i].trim())){if(0===i||i===columns.length-1)continue;return!1}if(!/^:?-+:?$/.test(t))return!1;58===t.charCodeAt(t.length-1)?aligns.push(58===t.charCodeAt(0)?"center":"right"):58===t.charCodeAt(0)?aligns.push("left"):aligns.push("")}if(-1===(lineText=getLine(state,startLine).trim()).indexOf("|"))return!1;if(state.sCount[startLine]-state.blkIndent>=4)return!1;if(columns=escapedSplit(lineText.replace(/^\||\|$/g,"")),(columnCount=columns.length)>aligns.length)return!1;if(silent)return!0;for((token=state.push("table_open","table",1)).map=tableLines=[startLine,0],(token=state.push("thead_open","thead",1)).map=[startLine,startLine+1],(token=state.push("tr_open","tr",1)).map=[startLine,startLine+1],i=0;i<columns.length;i++)(token=state.push("th_open","th",1)).map=[startLine,startLine+1],aligns[i]&&(token.attrs=[["style","text-align:"+aligns[i]]]),(token=state.push("inline","",0)).content=columns[i].trim(),token.map=[startLine,startLine+1],token.children=[],token=state.push("th_close","th",-1);for(token=state.push("tr_close","tr",-1),token=state.push("thead_close","thead",-1),(token=state.push("tbody_open","tbody",1)).map=tbodyLines=[startLine+2,0],nextLine=startLine+2;nextLine<endLine&&!(state.sCount[nextLine]<state.blkIndent)&&-1!==(lineText=getLine(state,nextLine).trim()).indexOf("|")&&!(state.sCount[nextLine]-state.blkIndent>=4);nextLine++){for(columns=escapedSplit(lineText.replace(/^\||\|$/g,"")),token=state.push("tr_open","tr",1),i=0;i<columnCount;i++)token=state.push("td_open","td",1),aligns[i]&&(token.attrs=[["style","text-align:"+aligns[i]]]),(token=state.push("inline","",0)).content=columns[i]?columns[i].trim():"",token.children=[],token=state.push("td_close","td",-1);token=state.push("tr_close","tr",-1)}return token=state.push("tbody_close","tbody",-1),token=state.push("table_close","table",-1),tableLines[1]=tbodyLines[1]=nextLine,state.line=nextLine,!0}},{"../common/utils":176}],202:[function(require,module,exports){"use strict";module.exports=function(state){var token;state.inlineMode?((token=new state.Token("inline","",0)).content=state.src,token.map=[0,1],token.children=[],state.tokens.push(token)):state.md.block.parse(state.src,state.md,state.env,state.tokens)}},{}],203:[function(require,module,exports){"use strict";module.exports=function(state){var tok,i,l,tokens=state.tokens;for(i=0,l=tokens.length;i<l;i++)"inline"===(tok=tokens[i]).type&&state.md.inline.parse(tok.content,state.md,state.env,tok.children)}},{}],204:[function(require,module,exports){"use strict";function isLinkOpen(str){return/^<a[>\s]/i.test(str)}function isLinkClose(str){return/^<\/a\s*>/i.test(str)}var arrayReplaceAt=require("../common/utils").arrayReplaceAt;module.exports=function(state){var i,j,l,tokens,token,currentToken,nodes,ln,text,pos,lastPos,level,htmlLinkLevel,url,fullUrl,urlText,links,blockTokens=state.tokens;if(state.md.options.linkify)for(j=0,l=blockTokens.length;j<l;j++)if("inline"===blockTokens[j].type&&state.md.linkify.pretest(blockTokens[j].content))for(htmlLinkLevel=0,i=(tokens=blockTokens[j].children).length-1;i>=0;i--)if("link_close"!==(currentToken=tokens[i]).type){if("html_inline"===currentToken.type&&(isLinkOpen(currentToken.content)&&htmlLinkLevel>0&&htmlLinkLevel--,isLinkClose(currentToken.content)&&htmlLinkLevel++),!(htmlLinkLevel>0)&&"text"===currentToken.type&&state.md.linkify.test(currentToken.content)){for(text=currentToken.content,links=state.md.linkify.match(text),nodes=[],level=currentToken.level,lastPos=0,ln=0;ln<links.length;ln++)url=links[ln].url,fullUrl=state.md.normalizeLink(url),state.md.validateLink(fullUrl)&&(urlText=links[ln].text,urlText=links[ln].schema?"mailto:"!==links[ln].schema||/^mailto:/i.test(urlText)?state.md.normalizeLinkText(urlText):state.md.normalizeLinkText("mailto:"+urlText).replace(/^mailto:/,""):state.md.normalizeLinkText("http://"+urlText).replace(/^http:\/\//,""),(pos=links[ln].index)>lastPos&&((token=new state.Token("text","",0)).content=text.slice(lastPos,pos),token.level=level,nodes.push(token)),(token=new state.Token("link_open","a",1)).attrs=[["href",fullUrl]],token.level=level++,token.markup="linkify",token.info="auto",nodes.push(token),(token=new state.Token("text","",0)).content=urlText,token.level=level,nodes.push(token),(token=new state.Token("link_close","a",-1)).level=--level,token.markup="linkify",token.info="auto",nodes.push(token),lastPos=links[ln].lastIndex);lastPos<text.length&&((token=new state.Token("text","",0)).content=text.slice(lastPos),token.level=level,nodes.push(token)),blockTokens[j].children=tokens=arrayReplaceAt(tokens,i,nodes)}}else for(i--;tokens[i].level!==currentToken.level&&"link_open"!==tokens[i].type;)i--}},{"../common/utils":176}],205:[function(require,module,exports){"use strict";var NEWLINES_RE=/\r[\n\u0085]?|[\u2424\u2028\u0085]/g,NULL_RE=/\u0000/g;module.exports=function(state){var str;str=(str=state.src.replace(NEWLINES_RE,"\n")).replace(NULL_RE,"�"),state.src=str}},{}],206:[function(require,module,exports){"use strict";function replaceFn(match,name){return SCOPED_ABBR[name.toLowerCase()]}function replace_scoped(inlineTokens){var i,token,inside_autolink=0;for(i=inlineTokens.length-1;i>=0;i--)"text"!==(token=inlineTokens[i]).type||inside_autolink||(token.content=token.content.replace(SCOPED_ABBR_RE,replaceFn)),"link_open"===token.type&&"auto"===token.info&&inside_autolink--,"link_close"===token.type&&"auto"===token.info&&inside_autolink++}function replace_rare(inlineTokens){var i,token,inside_autolink=0;for(i=inlineTokens.length-1;i>=0;i--)"text"!==(token=inlineTokens[i]).type||inside_autolink||RARE_RE.test(token.content)&&(token.content=token.content.replace(/\+-/g,"±").replace(/\.{2,}/g,"…").replace(/([?!])…/g,"$1..").replace(/([?!]){4,}/g,"$1$1$1").replace(/,{2,}/g,",").replace(/(^|[^-])---([^-]|$)/gm,"$1—$2").replace(/(^|\s)--(\s|$)/gm,"$1–$2").replace(/(^|[^-\s])--([^-\s]|$)/gm,"$1–$2")),"link_open"===token.type&&"auto"===token.info&&inside_autolink--,"link_close"===token.type&&"auto"===token.info&&inside_autolink++}var RARE_RE=/\+-|\.\.|\?\?\?\?|!!!!|,,|--/,SCOPED_ABBR_TEST_RE=/\((c|tm|r|p)\)/i,SCOPED_ABBR_RE=/\((c|tm|r|p)\)/gi,SCOPED_ABBR={c:"©",r:"®",p:"§",tm:"™"};module.exports=function(state){var blkIdx;if(state.md.options.typographer)for(blkIdx=state.tokens.length-1;blkIdx>=0;blkIdx--)"inline"===state.tokens[blkIdx].type&&(SCOPED_ABBR_TEST_RE.test(state.tokens[blkIdx].content)&&replace_scoped(state.tokens[blkIdx].children),RARE_RE.test(state.tokens[blkIdx].content)&&replace_rare(state.tokens[blkIdx].children))}},{}],207:[function(require,module,exports){"use strict";function replaceAt(str,index,ch){return str.substr(0,index)+ch+str.substr(index+1)}function process_inlines(tokens,state){var i,token,text,t,pos,max,thisLevel,item,lastChar,nextChar,isLastPunctChar,isNextPunctChar,isLastWhiteSpace,isNextWhiteSpace,canOpen,canClose,j,isSingle,stack,openQuote,closeQuote;for(stack=[],i=0;i<tokens.length;i++){for(token=tokens[i],thisLevel=tokens[i].level,j=stack.length-1;j>=0&&!(stack[j].level<=thisLevel);j--);if(stack.length=j+1,"text"===token.type){pos=0,max=(text=token.content).length;OUTER:for(;pos<max&&(QUOTE_RE.lastIndex=pos,t=QUOTE_RE.exec(text));){if(canOpen=canClose=!0,pos=t.index+1,isSingle="'"===t[0],lastChar=32,t.index-1>=0)lastChar=text.charCodeAt(t.index-1);else for(j=i-1;j>=0;j--)if("text"===tokens[j].type){lastChar=tokens[j].content.charCodeAt(tokens[j].content.length-1);break}if(nextChar=32,pos<max)nextChar=text.charCodeAt(pos);else for(j=i+1;j<tokens.length;j++)if("text"===tokens[j].type){nextChar=tokens[j].content.charCodeAt(0);break}if(isLastPunctChar=isMdAsciiPunct(lastChar)||isPunctChar(String.fromCharCode(lastChar)),isNextPunctChar=isMdAsciiPunct(nextChar)||isPunctChar(String.fromCharCode(nextChar)),isLastWhiteSpace=isWhiteSpace(lastChar),(isNextWhiteSpace=isWhiteSpace(nextChar))?canOpen=!1:isNextPunctChar&&(isLastWhiteSpace||isLastPunctChar||(canOpen=!1)),isLastWhiteSpace?canClose=!1:isLastPunctChar&&(isNextWhiteSpace||isNextPunctChar||(canClose=!1)),34===nextChar&&'"'===t[0]&&lastChar>=48&&lastChar<=57&&(canClose=canOpen=!1),canOpen&&canClose&&(canOpen=!1,canClose=isNextPunctChar),canOpen||canClose){if(canClose)for(j=stack.length-1;j>=0&&(item=stack[j],!(stack[j].level<thisLevel));j--)if(item.single===isSingle&&stack[j].level===thisLevel){item=stack[j],isSingle?(openQuote=state.md.options.quotes[2],closeQuote=state.md.options.quotes[3]):(openQuote=state.md.options.quotes[0],closeQuote=state.md.options.quotes[1]),token.content=replaceAt(token.content,t.index,closeQuote),tokens[item.token].content=replaceAt(tokens[item.token].content,item.pos,openQuote),pos+=closeQuote.length-1,item.token===i&&(pos+=openQuote.length-1),max=(text=token.content).length,stack.length=j;continue OUTER}canOpen?stack.push({token:i,pos:t.index,single:isSingle,level:thisLevel}):canClose&&isSingle&&(token.content=replaceAt(token.content,t.index,APOSTROPHE))}else isSingle&&(token.content=replaceAt(token.content,t.index,APOSTROPHE))}}}}var isWhiteSpace=require("../common/utils").isWhiteSpace,isPunctChar=require("../common/utils").isPunctChar,isMdAsciiPunct=require("../common/utils").isMdAsciiPunct,QUOTE_TEST_RE=/['"]/,QUOTE_RE=/['"]/g,APOSTROPHE="’";module.exports=function(state){var blkIdx;if(state.md.options.typographer)for(blkIdx=state.tokens.length-1;blkIdx>=0;blkIdx--)"inline"===state.tokens[blkIdx].type&&QUOTE_TEST_RE.test(state.tokens[blkIdx].content)&&process_inlines(state.tokens[blkIdx].children,state)}},{"../common/utils":176}],208:[function(require,module,exports){"use strict";function StateCore(src,md,env){this.src=src,this.env=env,this.tokens=[],this.inlineMode=!1,this.md=md}var Token=require("../token");StateCore.prototype.Token=Token,module.exports=StateCore},{"../token":223}],209:[function(require,module,exports){"use strict";var EMAIL_RE=/^<([a-zA-Z0-9.!#$%&'*+\/=?^_`{|}~-]+@[a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?(?:\.[a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?)*)>/,AUTOLINK_RE=/^<([a-zA-Z][a-zA-Z0-9+.\-]{1,31}):([^<>\x00-\x20]*)>/;module.exports=function(state,silent){var tail,linkMatch,emailMatch,url,fullUrl,token,pos=state.pos;return 60===state.src.charCodeAt(pos)&&!((tail=state.src.slice(pos)).indexOf(">")<0||(AUTOLINK_RE.test(tail)?(linkMatch=tail.match(AUTOLINK_RE),url=linkMatch[0].slice(1,-1),fullUrl=state.md.normalizeLink(url),!state.md.validateLink(fullUrl)||(silent||((token=state.push("link_open","a",1)).attrs=[["href",fullUrl]],token.markup="autolink",token.info="auto",(token=state.push("text","",0)).content=state.md.normalizeLinkText(url),(token=state.push("link_close","a",-1)).markup="autolink",token.info="auto"),state.pos+=linkMatch[0].length,0)):!EMAIL_RE.test(tail)||(emailMatch=tail.match(EMAIL_RE),url=emailMatch[0].slice(1,-1),fullUrl=state.md.normalizeLink("mailto:"+url),!state.md.validateLink(fullUrl)||(silent||((token=state.push("link_open","a",1)).attrs=[["href",fullUrl]],token.markup="autolink",token.info="auto",(token=state.push("text","",0)).content=state.md.normalizeLinkText(url),(token=state.push("link_close","a",-1)).markup="autolink",token.info="auto"),state.pos+=emailMatch[0].length,0))))}},{}],210:[function(require,module,exports){"use strict";module.exports=function(state,silent){var start,max,marker,matchStart,matchEnd,token,pos=state.pos;if(96!==state.src.charCodeAt(pos))return!1;for(start=pos,pos++,max=state.posMax;pos<max&&96===state.src.charCodeAt(pos);)pos++;for(marker=state.src.slice(start,pos),matchStart=matchEnd=pos;-1!==(matchStart=state.src.indexOf("`",matchEnd));){for(matchEnd=matchStart+1;matchEnd<max&&96===state.src.charCodeAt(matchEnd);)matchEnd++;if(matchEnd-matchStart===marker.length)return silent||((token=state.push("code_inline","code",0)).markup=marker,token.content=state.src.slice(pos,matchStart).replace(/[ \n]+/g," ").trim()),state.pos=matchEnd,!0}return silent||(state.pending+=marker),state.pos+=marker.length,!0}},{}],211:[function(require,module,exports){"use strict";module.exports=function(state){var i,j,lastDelim,currDelim,delimiters=state.delimiters,max=state.delimiters.length;for(i=0;i<max;i++)if((lastDelim=delimiters[i]).close)for(j=i-lastDelim.jump-1;j>=0;){if((currDelim=delimiters[j]).open&&currDelim.marker===lastDelim.marker&&currDelim.end<0&&currDelim.level===lastDelim.level&&!((currDelim.close||lastDelim.open)&&void 0!==currDelim.length&&void 0!==lastDelim.length&&(currDelim.length+lastDelim.length)%3==0)){lastDelim.jump=i-j,lastDelim.open=!1,currDelim.end=i,currDelim.jump=0;break}j-=currDelim.jump+1}}},{}],212:[function(require,module,exports){"use strict";module.exports.tokenize=function(state,silent){var i,scanned,start=state.pos,marker=state.src.charCodeAt(start);if(silent)return!1;if(95!==marker&&42!==marker)return!1;for(scanned=state.scanDelims(state.pos,42===marker),i=0;i<scanned.length;i++)state.push("text","",0).content=String.fromCharCode(marker),state.delimiters.push({marker:marker,length:scanned.length,jump:i,token:state.tokens.length-1,level:state.level,end:-1,open:scanned.can_open,close:scanned.can_close});return state.pos+=scanned.length,!0},module.exports.postProcess=function(state){var i,startDelim,endDelim,token,ch,isStrong,delimiters=state.delimiters;for(i=state.delimiters.length-1;i>=0;i--)95!==(startDelim=delimiters[i]).marker&&42!==startDelim.marker||-1!==startDelim.end&&(endDelim=delimiters[startDelim.end],isStrong=i>0&&delimiters[i-1].end===startDelim.end+1&&delimiters[i-1].token===startDelim.token-1&&delimiters[startDelim.end+1].token===endDelim.token+1&&delimiters[i-1].marker===startDelim.marker,ch=String.fromCharCode(startDelim.marker),(token=state.tokens[startDelim.token]).type=isStrong?"strong_open":"em_open",token.tag=isStrong?"strong":"em",token.nesting=1,token.markup=isStrong?ch+ch:ch,token.content="",(token=state.tokens[endDelim.token]).type=isStrong?"strong_close":"em_close",token.tag=isStrong?"strong":"em",token.nesting=-1,token.markup=isStrong?ch+ch:ch,token.content="",isStrong&&(state.tokens[delimiters[i-1].token].content="",state.tokens[delimiters[startDelim.end+1].token].content="",i--))}},{}],213:[function(require,module,exports){"use strict";var entities=require("../common/entities"),has=require("../common/utils").has,isValidEntityCode=require("../common/utils").isValidEntityCode,fromCodePoint=require("../common/utils").fromCodePoint,DIGITAL_RE=/^&#((?:x[a-f0-9]{1,8}|[0-9]{1,8}));/i,NAMED_RE=/^&([a-z][a-z0-9]{1,31});/i;module.exports=function(state,silent){var code,match,pos=state.pos,max=state.posMax;if(38!==state.src.charCodeAt(pos))return!1;if(pos+1<max)if(35===state.src.charCodeAt(pos+1)){if(match=state.src.slice(pos).match(DIGITAL_RE))return silent||(code="x"===match[1][0].toLowerCase()?parseInt(match[1].slice(1),16):parseInt(match[1],10),state.pending+=fromCodePoint(isValidEntityCode(code)?code:65533)),state.pos+=match[0].length,!0}else if((match=state.src.slice(pos).match(NAMED_RE))&&has(entities,match[1]))return silent||(state.pending+=entities[match[1]]),state.pos+=match[0].length,!0;return silent||(state.pending+="&"),state.pos++,!0}},{"../common/entities":173,"../common/utils":176}],214:[function(require,module,exports){"use strict";for(var isSpace=require("../common/utils").isSpace,ESCAPED=[],i=0;i<256;i++)ESCAPED.push(0);"\\!\"#$%&'()*+,./:;<=>?@[]^_`{|}~-".split("").forEach(function(ch){ESCAPED[ch.charCodeAt(0)]=1}),module.exports=function(state,silent){var ch,pos=state.pos,max=state.posMax;if(92!==state.src.charCodeAt(pos))return!1;if(++pos<max){if((ch=state.src.charCodeAt(pos))<256&&0!==ESCAPED[ch])return silent||(state.pending+=state.src[pos]),state.pos+=2,!0;if(10===ch){for(silent||state.push("hardbreak","br",0),pos++;pos<max&&(ch=state.src.charCodeAt(pos),isSpace(ch));)pos++;return state.pos=pos,!0}}return silent||(state.pending+="\\"),state.pos++,!0}},{"../common/utils":176}],215:[function(require,module,exports){"use strict";function isLetter(ch){var lc=32|ch;return lc>=97&&lc<=122}var HTML_TAG_RE=require("../common/html_re").HTML_TAG_RE;module.exports=function(state,silent){var ch,match,max,pos=state.pos;return!!state.md.options.html&&(max=state.posMax,!(60!==state.src.charCodeAt(pos)||pos+2>=max)&&(!(33!==(ch=state.src.charCodeAt(pos+1))&&63!==ch&&47!==ch&&!isLetter(ch))&&(!!(match=state.src.slice(pos).match(HTML_TAG_RE))&&(silent||(state.push("html_inline","",0).content=state.src.slice(pos,pos+match[0].length)),state.pos+=match[0].length,!0))))}},{"../common/html_re":175}],216:[function(require,module,exports){"use strict";var normalizeReference=require("../common/utils").normalizeReference,isSpace=require("../common/utils").isSpace;module.exports=function(state,silent){var attrs,code,content,label,labelEnd,labelStart,pos,ref,res,title,token,tokens,start,href="",oldPos=state.pos,max=state.posMax;if(33!==state.src.charCodeAt(state.pos))return!1;if(91!==state.src.charCodeAt(state.pos+1))return!1;if(labelStart=state.pos+2,(labelEnd=state.md.helpers.parseLinkLabel(state,state.pos+1,!1))<0)return!1;if((pos=labelEnd+1)<max&&40===state.src.charCodeAt(pos)){for(pos++;pos<max&&(code=state.src.charCodeAt(pos),isSpace(code)||10===code);pos++);if(pos>=max)return!1;for(start=pos,(res=state.md.helpers.parseLinkDestination(state.src,pos,state.posMax)).ok&&(href=state.md.normalizeLink(res.str),state.md.validateLink(href)?pos=res.pos:href=""),start=pos;pos<max&&(code=state.src.charCodeAt(pos),isSpace(code)||10===code);pos++);if(res=state.md.helpers.parseLinkTitle(state.src,pos,state.posMax),pos<max&&start!==pos&&res.ok)for(title=res.str,pos=res.pos;pos<max&&(code=state.src.charCodeAt(pos),isSpace(code)||10===code);pos++);else title="";if(pos>=max||41!==state.src.charCodeAt(pos))return state.pos=oldPos,!1;pos++}else{if(void 0===state.env.references)return!1;if(pos<max&&91===state.src.charCodeAt(pos)?(start=pos+1,(pos=state.md.helpers.parseLinkLabel(state,pos))>=0?label=state.src.slice(start,pos++):pos=labelEnd+1):pos=labelEnd+1,label||(label=state.src.slice(labelStart,labelEnd)),!(ref=state.env.references[normalizeReference(label)]))return state.pos=oldPos,!1;href=ref.href,title=ref.title}return silent||(content=state.src.slice(labelStart,labelEnd),state.md.inline.parse(content,state.md,state.env,tokens=[]),(token=state.push("image","img",0)).attrs=attrs=[["src",href],["alt",""]],token.children=tokens,token.content=content,title&&attrs.push(["title",title])),state.pos=pos,state.posMax=max,!0}},{"../common/utils":176}],217:[function(require,module,exports){"use strict";var normalizeReference=require("../common/utils").normalizeReference,isSpace=require("../common/utils").isSpace;module.exports=function(state,silent){var attrs,code,label,labelEnd,labelStart,pos,res,ref,title,href="",oldPos=state.pos,max=state.posMax,start=state.pos,parseReference=!0;if(91!==state.src.charCodeAt(state.pos))return!1;if(labelStart=state.pos+1,(labelEnd=state.md.helpers.parseLinkLabel(state,state.pos,!0))<0)return!1;if((pos=labelEnd+1)<max&&40===state.src.charCodeAt(pos)){for(parseReference=!1,pos++;pos<max&&(code=state.src.charCodeAt(pos),isSpace(code)||10===code);pos++);if(pos>=max)return!1;for(start=pos,(res=state.md.helpers.parseLinkDestination(state.src,pos,state.posMax)).ok&&(href=state.md.normalizeLink(res.str),state.md.validateLink(href)?pos=res.pos:href=""),start=pos;pos<max&&(code=state.src.charCodeAt(pos),isSpace(code)||10===code);pos++);if(res=state.md.helpers.parseLinkTitle(state.src,pos,state.posMax),pos<max&&start!==pos&&res.ok)for(title=res.str,pos=res.pos;pos<max&&(code=state.src.charCodeAt(pos),isSpace(code)||10===code);pos++);else title="";(pos>=max||41!==state.src.charCodeAt(pos))&&(parseReference=!0),pos++}if(parseReference){if(void 0===state.env.references)return!1;if(pos<max&&91===state.src.charCodeAt(pos)?(start=pos+1,(pos=state.md.helpers.parseLinkLabel(state,pos))>=0?label=state.src.slice(start,pos++):pos=labelEnd+1):pos=labelEnd+1,label||(label=state.src.slice(labelStart,labelEnd)),!(ref=state.env.references[normalizeReference(label)]))return state.pos=oldPos,!1;href=ref.href,title=ref.title}return silent||(state.pos=labelStart,state.posMax=labelEnd,state.push("link_open","a",1).attrs=attrs=[["href",href]],title&&attrs.push(["title",title]),state.md.inline.tokenize(state),state.push("link_close","a",-1)),state.pos=pos,state.posMax=max,!0}},{"../common/utils":176}],218:[function(require,module,exports){"use strict";var isSpace=require("../common/utils").isSpace;module.exports=function(state,silent){var pmax,max,pos=state.pos;if(10!==state.src.charCodeAt(pos))return!1;for(pmax=state.pending.length-1,max=state.posMax,silent||(pmax>=0&&32===state.pending.charCodeAt(pmax)?pmax>=1&&32===state.pending.charCodeAt(pmax-1)?(state.pending=state.pending.replace(/ +$/,""),state.push("hardbreak","br",0)):(state.pending=state.pending.slice(0,-1),state.push("softbreak","br",0)):state.push("softbreak","br",0)),pos++;pos<max&&isSpace(state.src.charCodeAt(pos));)pos++;return state.pos=pos,!0}},{"../common/utils":176}],219:[function(require,module,exports){"use strict";function StateInline(src,md,env,outTokens){this.src=src,this.env=env,this.md=md,this.tokens=outTokens,this.pos=0,this.posMax=this.src.length,this.level=0,this.pending="",this.pendingLevel=0,this.cache={},this.delimiters=[]}var Token=require("../token"),isWhiteSpace=require("../common/utils").isWhiteSpace,isPunctChar=require("../common/utils").isPunctChar,isMdAsciiPunct=require("../common/utils").isMdAsciiPunct;StateInline.prototype.pushPending=function(){var token=new Token("text","",0);return token.content=this.pending,token.level=this.pendingLevel,this.tokens.push(token),this.pending="",token},StateInline.prototype.push=function(type,tag,nesting){this.pending&&this.pushPending();var token=new Token(type,tag,nesting);return nesting<0&&this.level--,token.level=this.level,nesting>0&&this.level++,this.pendingLevel=this.level,this.tokens.push(token),token},StateInline.prototype.scanDelims=function(start,canSplitWord){var lastChar,nextChar,count,can_open,can_close,isLastWhiteSpace,isLastPunctChar,isNextWhiteSpace,isNextPunctChar,pos=start,left_flanking=!0,right_flanking=!0,max=this.posMax,marker=this.src.charCodeAt(start);for(lastChar=start>0?this.src.charCodeAt(start-1):32;pos<max&&this.src.charCodeAt(pos)===marker;)pos++;return count=pos-start,nextChar=pos<max?this.src.charCodeAt(pos):32,isLastPunctChar=isMdAsciiPunct(lastChar)||isPunctChar(String.fromCharCode(lastChar)),isNextPunctChar=isMdAsciiPunct(nextChar)||isPunctChar(String.fromCharCode(nextChar)),isLastWhiteSpace=isWhiteSpace(lastChar),(isNextWhiteSpace=isWhiteSpace(nextChar))?left_flanking=!1:isNextPunctChar&&(isLastWhiteSpace||isLastPunctChar||(left_flanking=!1)),isLastWhiteSpace?right_flanking=!1:isLastPunctChar&&(isNextWhiteSpace||isNextPunctChar||(right_flanking=!1)),canSplitWord?(can_open=left_flanking,can_close=right_flanking):(can_open=left_flanking&&(!right_flanking||isLastPunctChar),can_close=right_flanking&&(!left_flanking||isNextPunctChar)),{can_open:can_open,can_close:can_close,length:count}},StateInline.prototype.Token=Token,module.exports=StateInline},{"../common/utils":176,"../token":223}],220:[function(require,module,exports){"use strict";module.exports.tokenize=function(state,silent){var i,scanned,len,ch,start=state.pos,marker=state.src.charCodeAt(start);if(silent)return!1;if(126!==marker)return!1;if(scanned=state.scanDelims(state.pos,!0),len=scanned.length,ch=String.fromCharCode(marker),len<2)return!1;for(len%2&&(state.push("text","",0).content=ch,len--),i=0;i<len;i+=2)state.push("text","",0).content=ch+ch,state.delimiters.push({marker:marker,jump:i,token:state.tokens.length-1,level:state.level,end:-1,open:scanned.can_open,close:scanned.can_close});return state.pos+=scanned.length,!0},module.exports.postProcess=function(state){var i,j,startDelim,endDelim,token,loneMarkers=[],delimiters=state.delimiters,max=state.delimiters.length;for(i=0;i<max;i++)126===(startDelim=delimiters[i]).marker&&-1!==startDelim.end&&(endDelim=delimiters[startDelim.end],(token=state.tokens[startDelim.token]).type="s_open",token.tag="s",token.nesting=1,token.markup="~~",token.content="",(token=state.tokens[endDelim.token]).type="s_close",token.tag="s",token.nesting=-1,token.markup="~~",token.content="","text"===state.tokens[endDelim.token-1].type&&"~"===state.tokens[endDelim.token-1].content&&loneMarkers.push(endDelim.token-1));for(;loneMarkers.length;){for(j=(i=loneMarkers.pop())+1;j<state.tokens.length&&"s_close"===state.tokens[j].type;)j++;i!==--j&&(token=state.tokens[j],state.tokens[j]=state.tokens[i],state.tokens[i]=token)}}},{}],221:[function(require,module,exports){"use strict";function isTerminatorChar(ch){switch(ch){case 10:case 33:case 35:case 36:case 37:case 38:case 42:case 43:case 45:case 58:case 60:case 61:case 62:case 64:case 91:case 92:case 93:case 94:case 95:case 96:case 123:case 125:case 126:return!0;default:return!1}}module.exports=function(state,silent){for(var pos=state.pos;pos<state.posMax&&!isTerminatorChar(state.src.charCodeAt(pos));)pos++;return pos!==state.pos&&(silent||(state.pending+=state.src.slice(state.pos,pos)),state.pos=pos,!0)}},{}],222:[function(require,module,exports){"use strict";module.exports=function(state){var curr,last,level=0,tokens=state.tokens,max=state.tokens.length;for(curr=last=0;curr<max;curr++)level+=tokens[curr].nesting,tokens[curr].level=level,"text"===tokens[curr].type&&curr+1<max&&"text"===tokens[curr+1].type?tokens[curr+1].content=tokens[curr].content+tokens[curr+1].content:(curr!==last&&(tokens[last]=tokens[curr]),last++);curr!==last&&(tokens.length=last)}},{}],223:[function(require,module,exports){"use strict";function Token(type,tag,nesting){this.type=type,this.tag=tag,this.attrs=null,this.map=null,this.nesting=nesting,this.level=0,this.children=null,this.content="",this.markup="",this.info="",this.meta=null,this.block=!1,this.hidden=!1}Token.prototype.attrIndex=function(name){var attrs,i,len;if(!this.attrs)return-1;for(i=0,len=(attrs=this.attrs).length;i<len;i++)if(attrs[i][0]===name)return i;return-1},Token.prototype.attrPush=function(attrData){this.attrs?this.attrs.push(attrData):this.attrs=[attrData]},Token.prototype.attrSet=function(name,value){var idx=this.attrIndex(name),attrData=[name,value];idx<0?this.attrPush(attrData):this.attrs[idx]=attrData},Token.prototype.attrGet=function(name){var idx=this.attrIndex(name),value=null;return idx>=0&&(value=this.attrs[idx][1]),value},Token.prototype.attrJoin=function(name,value){var idx=this.attrIndex(name);idx<0?this.attrPush([name,value]):this.attrs[idx][1]=this.attrs[idx][1]+" "+value},module.exports=Token},{}],224:[function(require,module,exports){"use strict";function getDecodeCache(exclude){var i,ch,cache=decodeCache[exclude];if(cache)return cache;for(cache=decodeCache[exclude]=[],i=0;i<128;i++)ch=String.fromCharCode(i),cache.push(ch);for(i=0;i<exclude.length;i++)cache[ch=exclude.charCodeAt(i)]="%"+("0"+ch.toString(16).toUpperCase()).slice(-2);return cache}function decode(string,exclude){var cache;return"string"!=typeof exclude&&(exclude=decode.defaultChars),cache=getDecodeCache(exclude),string.replace(/(%[a-f0-9]{2})+/gi,function(seq){var i,l,b1,b2,b3,b4,chr,result="";for(i=0,l=seq.length;i<l;i+=3)(b1=parseInt(seq.slice(i+1,i+3),16))<128?result+=cache[b1]:192==(224&b1)&&i+3<l&&128==(192&(b2=parseInt(seq.slice(i+4,i+6),16)))?(result+=(chr=b1<<6&1984|63&b2)<128?"��":String.fromCharCode(chr),i+=3):224==(240&b1)&&i+6<l&&(b2=parseInt(seq.slice(i+4,i+6),16),b3=parseInt(seq.slice(i+7,i+9),16),128==(192&b2)&&128==(192&b3))?(result+=(chr=b1<<12&61440|b2<<6&4032|63&b3)<2048||chr>=55296&&chr<=57343?"���":String.fromCharCode(chr),i+=6):240==(248&b1)&&i+9<l&&(b2=parseInt(seq.slice(i+4,i+6),16),b3=parseInt(seq.slice(i+7,i+9),16),b4=parseInt(seq.slice(i+10,i+12),16),128==(192&b2)&&128==(192&b3)&&128==(192&b4))?((chr=b1<<18&1835008|b2<<12&258048|b3<<6&4032|63&b4)<65536||chr>1114111?result+="����":(chr-=65536,result+=String.fromCharCode(55296+(chr>>10),56320+(1023&chr))),i+=9):result+="�";return result})}var decodeCache={};decode.defaultChars=";/?:@&=+$,#",decode.componentChars="",module.exports=decode},{}],225:[function(require,module,exports){"use strict";function getEncodeCache(exclude){var i,ch,cache=encodeCache[exclude];if(cache)return cache;for(cache=encodeCache[exclude]=[],i=0;i<128;i++)ch=String.fromCharCode(i),/^[0-9a-z]$/i.test(ch)?cache.push(ch):cache.push("%"+("0"+i.toString(16).toUpperCase()).slice(-2));for(i=0;i<exclude.length;i++)cache[exclude.charCodeAt(i)]=exclude[i];return cache}function encode(string,exclude,keepEscaped){var i,l,code,nextCode,cache,result="";for("string"!=typeof exclude&&(keepEscaped=exclude,exclude=encode.defaultChars),void 0===keepEscaped&&(keepEscaped=!0),cache=getEncodeCache(exclude),i=0,l=string.length;i<l;i++)if(code=string.charCodeAt(i),keepEscaped&&37===code&&i+2<l&&/^[0-9a-f]{2}$/i.test(string.slice(i+1,i+3)))result+=string.slice(i,i+3),i+=2;else if(code<128)result+=cache[code];else if(code>=55296&&code<=57343){if(code>=55296&&code<=56319&&i+1<l&&(nextCode=string.charCodeAt(i+1))>=56320&&nextCode<=57343){result+=encodeURIComponent(string[i]+string[i+1]),i++;continue}result+="%EF%BF%BD"}else result+=encodeURIComponent(string[i]);return result}var encodeCache={};encode.defaultChars=";/?:@&=+$,-_.!~*'()#",encode.componentChars="-_.!~*'()",module.exports=encode},{}],226:[function(require,module,exports){"use strict";module.exports=function(url){var result="";return result+=url.protocol||"",result+=url.slashes?"//":"",result+=url.auth?url.auth+"@":"",url.hostname&&-1!==url.hostname.indexOf(":")?result+="["+url.hostname+"]":result+=url.hostname||"",result+=url.port?":"+url.port:"",result+=url.pathname||"",result+=url.search||"",result+=url.hash||""}},{}],227:[function(require,module,exports){"use strict";module.exports.encode=require("./encode"),module.exports.decode=require("./decode"),module.exports.format=require("./format"),module.exports.parse=require("./parse")},{"./decode":224,"./encode":225,"./format":226,"./parse":228}],228:[function(require,module,exports){"use strict";function Url(){this.protocol=null,this.slashes=null,this.auth=null,this.port=null,this.hostname=null,this.hash=null,this.search=null,this.pathname=null}var protocolPattern=/^([a-z0-9.+-]+:)/i,portPattern=/:[0-9]*$/,simplePathPattern=/^(\/\/?(?!\/)[^\?\s]*)(\?[^\s]*)?$/,delims=["<",">",'"',"`"," ","\r","\n","\t"],unwise=["{","}","|","\\","^","`"].concat(delims),autoEscape=["'"].concat(unwise),nonHostChars=["%","/","?",";","#"].concat(autoEscape),hostEndingChars=["/","?","#"],hostnamePartPattern=/^[+a-z0-9A-Z_-]{0,63}$/,hostnamePartStart=/^([+a-z0-9A-Z_-]{0,63})(.*)$/,hostlessProtocol={javascript:!0,"javascript:":!0},slashedProtocol={http:!0,https:!0,ftp:!0,gopher:!0,file:!0,"http:":!0,"https:":!0,"ftp:":!0,"gopher:":!0,"file:":!0};Url.prototype.parse=function(url,slashesDenoteHost){var i,l,lowerProto,hec,slashes,rest=url;if(rest=rest.trim(),!slashesDenoteHost&&1===url.split("#").length){var simplePath=simplePathPattern.exec(rest);if(simplePath)return this.pathname=simplePath[1],simplePath[2]&&(this.search=simplePath[2]),this}var proto=protocolPattern.exec(rest);if(proto&&(lowerProto=(proto=proto[0]).toLowerCase(),this.protocol=proto,rest=rest.substr(proto.length)),(slashesDenoteHost||proto||rest.match(/^\/\/[^@\/]+@[^@\/]+/))&&(!(slashes="//"===rest.substr(0,2))||proto&&hostlessProtocol[proto]||(rest=rest.substr(2),this.slashes=!0)),!hostlessProtocol[proto]&&(slashes||proto&&!slashedProtocol[proto])){var hostEnd=-1;for(i=0;i<hostEndingChars.length;i++)-1!==(hec=rest.indexOf(hostEndingChars[i]))&&(-1===hostEnd||hec<hostEnd)&&(hostEnd=hec);var auth,atSign;for(-1!==(atSign=-1===hostEnd?rest.lastIndexOf("@"):rest.lastIndexOf("@",hostEnd))&&(auth=rest.slice(0,atSign),rest=rest.slice(atSign+1),this.auth=auth),hostEnd=-1,i=0;i<nonHostChars.length;i++)-1!==(hec=rest.indexOf(nonHostChars[i]))&&(-1===hostEnd||hec<hostEnd)&&(hostEnd=hec);-1===hostEnd&&(hostEnd=rest.length),":"===rest[hostEnd-1]&&hostEnd--;var host=rest.slice(0,hostEnd);rest=rest.slice(hostEnd),this.parseHost(host),this.hostname=this.hostname||"";var ipv6Hostname="["===this.hostname[0]&&"]"===this.hostname[this.hostname.length-1];if(!ipv6Hostname){var hostparts=this.hostname.split(/\./);for(i=0,l=hostparts.length;i<l;i++){var part=hostparts[i];if(part&&!part.match(hostnamePartPattern)){for(var newpart="",j=0,k=part.length;j<k;j++)part.charCodeAt(j)>127?newpart+="x":newpart+=part[j];if(!newpart.match(hostnamePartPattern)){var validParts=hostparts.slice(0,i),notHost=hostparts.slice(i+1),bit=part.match(hostnamePartStart);bit&&(validParts.push(bit[1]),notHost.unshift(bit[2])),notHost.length&&(rest=notHost.join(".")+rest),this.hostname=validParts.join(".");break}}}}this.hostname.length>255&&(this.hostname=""),ipv6Hostname&&(this.hostname=this.hostname.substr(1,this.hostname.length-2))}var hash=rest.indexOf("#");-1!==hash&&(this.hash=rest.substr(hash),rest=rest.slice(0,hash));var qm=rest.indexOf("?");return-1!==qm&&(this.search=rest.substr(qm),rest=rest.slice(0,qm)),rest&&(this.pathname=rest),slashedProtocol[lowerProto]&&this.hostname&&!this.pathname&&(this.pathname=""),this},Url.prototype.parseHost=function(host){var port=portPattern.exec(host);port&&(":"!==(port=port[0])&&(this.port=port.substr(1)),host=host.substr(0,host.length-port.length)),host&&(this.hostname=host)},module.exports=function(url,slashesDenoteHost){if(url&&url instanceof Url)return url;var u=new Url;return u.parse(url,slashesDenoteHost),u}},{}],229:[function(require,module,exports){function defaultSetTimout(){throw new Error("setTimeout has not been defined")}function defaultClearTimeout(){throw new Error("clearTimeout has not been defined")}function runTimeout(fun){if(cachedSetTimeout===setTimeout)return setTimeout(fun,0);if((cachedSetTimeout===defaultSetTimout||!cachedSetTimeout)&&setTimeout)return cachedSetTimeout=setTimeout,setTimeout(fun,0);try{return cachedSetTimeout(fun,0)}catch(e){try{return cachedSetTimeout.call(null,fun,0)}catch(e){return cachedSetTimeout.call(this,fun,0)}}}function runClearTimeout(marker){if(cachedClearTimeout===clearTimeout)return clearTimeout(marker);if((cachedClearTimeout===defaultClearTimeout||!cachedClearTimeout)&&clearTimeout)return cachedClearTimeout=clearTimeout,clearTimeout(marker);try{return cachedClearTimeout(marker)}catch(e){try{return cachedClearTimeout.call(null,marker)}catch(e){return cachedClearTimeout.call(this,marker)}}}function cleanUpNextTick(){draining&&currentQueue&&(draining=!1,currentQueue.length?queue=currentQueue.concat(queue):queueIndex=-1,queue.length&&drainQueue())}function drainQueue(){if(!draining){var timeout=runTimeout(cleanUpNextTick);draining=!0;for(var len=queue.length;len;){for(currentQueue=queue,queue=[];++queueIndex<len;)currentQueue&&currentQueue[queueIndex].run();queueIndex=-1,len=queue.length}currentQueue=null,draining=!1,runClearTimeout(timeout)}}function Item(fun,array){this.fun=fun,this.array=array}function noop(){}var cachedSetTimeout,cachedClearTimeout,process=module.exports={};!function(){try{cachedSetTimeout="function"==typeof setTimeout?setTimeout:defaultSetTimout}catch(e){cachedSetTimeout=defaultSetTimout}try{cachedClearTimeout="function"==typeof clearTimeout?clearTimeout:defaultClearTimeout}catch(e){cachedClearTimeout=defaultClearTimeout}}();var currentQueue,queue=[],draining=!1,queueIndex=-1;process.nextTick=function(fun){var args=new Array(arguments.length-1);if(arguments.length>1)for(var i=1;i<arguments.length;i++)args[i-1]=arguments[i];queue.push(new Item(fun,args)),1!==queue.length||draining||runTimeout(drainQueue)},Item.prototype.run=function(){this.fun.apply(null,this.array)},process.title="browser",process.browser=!0,process.env={},process.argv=[],process.version="",process.versions={},process.on=noop,process.addListener=noop,process.once=noop,process.off=noop,process.removeListener=noop,process.removeAllListeners=noop,process.emit=noop,process.prependListener=noop,process.prependOnceListener=noop,process.listeners=function(name){return[]},process.binding=function(name){throw new Error("process.binding is not supported")},process.cwd=function(){return"/"},process.chdir=function(dir){throw new Error("process.chdir is not supported")},process.umask=function(){return 0}},{}],230:[function(require,module,exports){(function(process){"use strict";if("production"!==process.env.NODE_ENV)var invariant=require("fbjs/lib/invariant"),warning=require("fbjs/lib/warning"),ReactPropTypesSecret=require("./lib/ReactPropTypesSecret"),loggedTypeFailures={};module.exports=function(typeSpecs,values,location,componentName,getStack){if("production"!==process.env.NODE_ENV)for(var typeSpecName in typeSpecs)if(typeSpecs.hasOwnProperty(typeSpecName)){var error;try{invariant("function"==typeof typeSpecs[typeSpecName],"%s: %s type `%s` is invalid; it must be a function, usually from React.PropTypes.",componentName||"React class",location,typeSpecName),error=typeSpecs[typeSpecName](values,typeSpecName,componentName,location,null,ReactPropTypesSecret)}catch(ex){error=ex}if(warning(!error||error instanceof Error,"%s: type specification of %s `%s` is invalid; the type checker function must return `null` or an `Error` but returned a %s. You may have forgotten to pass an argument to the type checker creator (arrayOf, instanceOf, objectOf, oneOf, oneOfType, and shape all require an argument).",componentName||"React class",location,typeSpecName,typeof error),error instanceof Error&&!(error.message in loggedTypeFailures)){loggedTypeFailures[error.message]=!0;var stack=getStack?getStack():"";warning(!1,"Failed %s type: %s%s",location,error.message,null!=stack?stack:"")}}}}).call(this,require("_process"))},{"./lib/ReactPropTypesSecret":234,_process:229,"fbjs/lib/invariant":68,"fbjs/lib/warning":69}],231:[function(require,module,exports){"use strict";var emptyFunction=require("fbjs/lib/emptyFunction"),invariant=require("fbjs/lib/invariant");module.exports=function(){function shim(){invariant(!1,"Calling PropTypes validators directly is not supported by the `prop-types` package. Use PropTypes.checkPropTypes() to call them. Read more at http://fb.me/use-check-prop-types")}function getShim(){return shim}shim.isRequired=shim;var ReactPropTypes={array:shim,bool:shim,func:shim,number:shim,object:shim,string:shim,symbol:shim,any:shim,arrayOf:getShim,element:shim,instanceOf:getShim,node:shim,objectOf:getShim,oneOf:getShim,oneOfType:getShim,shape:getShim};return ReactPropTypes.checkPropTypes=emptyFunction,ReactPropTypes.PropTypes=ReactPropTypes,ReactPropTypes}},{"fbjs/lib/emptyFunction":67,"fbjs/lib/invariant":68}],232:[function(require,module,exports){(function(process){"use strict";var emptyFunction=require("fbjs/lib/emptyFunction"),invariant=require("fbjs/lib/invariant"),warning=require("fbjs/lib/warning"),ReactPropTypesSecret=require("./lib/ReactPropTypesSecret"),checkPropTypes=require("./checkPropTypes");module.exports=function(isValidElement,throwOnDirectAccess){function getIteratorFn(maybeIterable){var iteratorFn=maybeIterable&&(ITERATOR_SYMBOL&&maybeIterable[ITERATOR_SYMBOL]||maybeIterable[FAUX_ITERATOR_SYMBOL]);if("function"==typeof iteratorFn)return iteratorFn}function is(x,y){return x===y?0!==x||1/x==1/y:x!==x&&y!==y}function PropTypeError(message){this.message=message,this.stack=""}function createChainableTypeChecker(validate){function checkType(isRequired,props,propName,componentName,location,propFullName,secret){if(componentName=componentName||ANONYMOUS,propFullName=propFullName||propName,secret!==ReactPropTypesSecret)if(throwOnDirectAccess)invariant(!1,"Calling PropTypes validators directly is not supported by the `prop-types` package. Use `PropTypes.checkPropTypes()` to call them. Read more at http://fb.me/use-check-prop-types");else if("production"!==process.env.NODE_ENV&&"undefined"!=typeof console){var cacheKey=componentName+":"+propName;!manualPropTypeCallCache[cacheKey]&&manualPropTypeWarningCount<3&&(warning(!1,"You are manually calling a React.PropTypes validation function for the `%s` prop on `%s`. This is deprecated and will throw in the standalone `prop-types` package. You may be seeing this warning due to a third-party PropTypes library. See https://fb.me/react-warning-dont-call-proptypes for details.",propFullName,componentName),manualPropTypeCallCache[cacheKey]=!0,manualPropTypeWarningCount++)}return null==props[propName]?isRequired?new PropTypeError(null===props[propName]?"The "+location+" `"+propFullName+"` is marked as required in `"+componentName+"`, but its value is `null`.":"The "+location+" `"+propFullName+"` is marked as required in `"+componentName+"`, but its value is `undefined`."):null:validate(props,propName,componentName,location,propFullName)}if("production"!==process.env.NODE_ENV)var manualPropTypeCallCache={},manualPropTypeWarningCount=0;var chainedCheckType=checkType.bind(null,!1);return chainedCheckType.isRequired=checkType.bind(null,!0),chainedCheckType}function createPrimitiveTypeChecker(expectedType){return createChainableTypeChecker(function(props,propName,componentName,location,propFullName,secret){var propValue=props[propName];return getPropType(propValue)!==expectedType?new PropTypeError("Invalid "+location+" `"+propFullName+"` of type `"+getPreciseType(propValue)+"` supplied to `"+componentName+"`, expected `"+expectedType+"`."):null})}function isNode(propValue){switch(typeof propValue){case"number":case"string":case"undefined":return!0;case"boolean":return!propValue;case"object":if(Array.isArray(propValue))return propValue.every(isNode);if(null===propValue||isValidElement(propValue))return!0;var iteratorFn=getIteratorFn(propValue);if(!iteratorFn)return!1;var step,iterator=iteratorFn.call(propValue);if(iteratorFn!==propValue.entries){for(;!(step=iterator.next()).done;)if(!isNode(step.value))return!1}else for(;!(step=iterator.next()).done;){var entry=step.value;if(entry&&!isNode(entry[1]))return!1}return!0;default:return!1}}function isSymbol(propType,propValue){return"symbol"===propType||("Symbol"===propValue["@@toStringTag"]||"function"==typeof Symbol&&propValue instanceof Symbol)}function getPropType(propValue){var propType=typeof propValue;return Array.isArray(propValue)?"array":propValue instanceof RegExp?"object":isSymbol(propType,propValue)?"symbol":propType}function getPreciseType(propValue){var propType=getPropType(propValue);if("object"===propType){if(propValue instanceof Date)return"date";if(propValue instanceof RegExp)return"regexp"}return propType}function getClassName(propValue){return propValue.constructor&&propValue.constructor.name?propValue.constructor.name:ANONYMOUS}var ITERATOR_SYMBOL="function"==typeof Symbol&&Symbol.iterator,FAUX_ITERATOR_SYMBOL="@@iterator",ANONYMOUS="<<anonymous>>",ReactPropTypes={array:createPrimitiveTypeChecker("array"),bool:createPrimitiveTypeChecker("boolean"),func:createPrimitiveTypeChecker("function"),number:createPrimitiveTypeChecker("number"),object:createPrimitiveTypeChecker("object"),string:createPrimitiveTypeChecker("string"),symbol:createPrimitiveTypeChecker("symbol"),any:createChainableTypeChecker(emptyFunction.thatReturnsNull),arrayOf:function(typeChecker){return createChainableTypeChecker(function(props,propName,componentName,location,propFullName){if("function"!=typeof typeChecker)return new PropTypeError("Property `"+propFullName+"` of component `"+componentName+"` has invalid PropType notation inside arrayOf.");var propValue=props[propName];if(!Array.isArray(propValue))return new PropTypeError("Invalid "+location+" `"+propFullName+"` of type `"+getPropType(propValue)+"` supplied to `"+componentName+"`, expected an array.");for(var i=0;i<propValue.length;i++){var error=typeChecker(propValue,i,componentName,location,propFullName+"["+i+"]",ReactPropTypesSecret);if(error instanceof Error)return error}return null})},element:function(){return createChainableTypeChecker(function(props,propName,componentName,location,propFullName){var propValue=props[propName];return isValidElement(propValue)?null:new PropTypeError("Invalid "+location+" `"+propFullName+"` of type `"+getPropType(propValue)+"` supplied to `"+componentName+"`, expected a single ReactElement.")})}(),instanceOf:function(expectedClass){return createChainableTypeChecker(function(props,propName,componentName,location,propFullName){if(!(props[propName]instanceof expectedClass)){var expectedClassName=expectedClass.name||ANONYMOUS;return new PropTypeError("Invalid "+location+" `"+propFullName+"` of type `"+getClassName(props[propName])+"` supplied to `"+componentName+"`, expected instance of `"+expectedClassName+"`.")}return null})},node:function(){return createChainableTypeChecker(function(props,propName,componentName,location,propFullName){return isNode(props[propName])?null:new PropTypeError("Invalid "+location+" `"+propFullName+"` supplied to `"+componentName+"`, expected a ReactNode.")})}(),objectOf:function(typeChecker){return createChainableTypeChecker(function(props,propName,componentName,location,propFullName){if("function"!=typeof typeChecker)return new PropTypeError("Property `"+propFullName+"` of component `"+componentName+"` has invalid PropType notation inside objectOf.");var propValue=props[propName],propType=getPropType(propValue);if("object"!==propType)return new PropTypeError("Invalid "+location+" `"+propFullName+"` of type `"+propType+"` supplied to `"+componentName+"`, expected an object.");for(var key in propValue)if(propValue.hasOwnProperty(key)){var error=typeChecker(propValue,key,componentName,location,propFullName+"."+key,ReactPropTypesSecret);if(error instanceof Error)return error}return null})},oneOf:function(expectedValues){return Array.isArray(expectedValues)?createChainableTypeChecker(function(props,propName,componentName,location,propFullName){for(var propValue=props[propName],i=0;i<expectedValues.length;i++)if(is(propValue,expectedValues[i]))return null;return new PropTypeError("Invalid "+location+" `"+propFullName+"` of value `"+propValue+"` supplied to `"+componentName+"`, expected one of "+JSON.stringify(expectedValues)+".")}):("production"!==process.env.NODE_ENV&&warning(!1,"Invalid argument supplied to oneOf, expected an instance of array."),emptyFunction.thatReturnsNull)},oneOfType:function(arrayOfTypeCheckers){return Array.isArray(arrayOfTypeCheckers)?createChainableTypeChecker(function(props,propName,componentName,location,propFullName){for(var i=0;i<arrayOfTypeCheckers.length;i++)if(null==(0,arrayOfTypeCheckers[i])(props,propName,componentName,location,propFullName,ReactPropTypesSecret))return null;return new PropTypeError("Invalid "+location+" `"+propFullName+"` supplied to `"+componentName+"`.")}):("production"!==process.env.NODE_ENV&&warning(!1,"Invalid argument supplied to oneOfType, expected an instance of array."),emptyFunction.thatReturnsNull)},shape:function(shapeTypes){return createChainableTypeChecker(function(props,propName,componentName,location,propFullName){var propValue=props[propName],propType=getPropType(propValue);if("object"!==propType)return new PropTypeError("Invalid "+location+" `"+propFullName+"` of type `"+propType+"` supplied to `"+componentName+"`, expected `object`.");for(var key in shapeTypes){var checker=shapeTypes[key];if(checker){var error=checker(propValue,key,componentName,location,propFullName+"."+key,ReactPropTypesSecret);if(error)return error}}return null})}};return PropTypeError.prototype=Error.prototype,ReactPropTypes.checkPropTypes=checkPropTypes,ReactPropTypes.PropTypes=ReactPropTypes,ReactPropTypes}}).call(this,require("_process"))},{"./checkPropTypes":230,"./lib/ReactPropTypesSecret":234,_process:229,"fbjs/lib/emptyFunction":67,"fbjs/lib/invariant":68,"fbjs/lib/warning":69}],233:[function(require,module,exports){(function(process){if("production"!==process.env.NODE_ENV){var REACT_ELEMENT_TYPE="function"==typeof Symbol&&Symbol.for&&Symbol.for("react.element")||60103;module.exports=require("./factoryWithTypeCheckers")(function(object){return"object"==typeof object&&null!==object&&object.$$typeof===REACT_ELEMENT_TYPE},!0)}else module.exports=require("./factoryWithThrowingShims")()}).call(this,require("_process"))},{"./factoryWithThrowingShims":231,"./factoryWithTypeCheckers":232,_process:229}],234:[function(require,module,exports){"use strict";module.exports="SECRET_DO_NOT_PASS_THIS_OR_YOU_WILL_BE_FIRED"},{}],235:[function(require,module,exports){(function(global){!function(root){function error(type){throw new RangeError(errors[type])}function map(array,fn){for(var length=array.length,result=[];length--;)result[length]=fn(array[length]);return result}function mapDomain(string,fn){var parts=string.split("@"),result="";return parts.length>1&&(result=parts[0]+"@",string=parts[1]),result+map((string=string.replace(regexSeparators,".")).split("."),fn).join(".")}function ucs2decode(string){for(var value,extra,output=[],counter=0,length=string.length;counter<length;)(value=string.charCodeAt(counter++))>=55296&&value<=56319&&counter<length?56320==(64512&(extra=string.charCodeAt(counter++)))?output.push(((1023&value)<<10)+(1023&extra)+65536):(output.push(value),counter--):output.push(value);return output}function ucs2encode(array){return map(array,function(value){var output="";return value>65535&&(output+=stringFromCharCode((value-=65536)>>>10&1023|55296),value=56320|1023&value),output+=stringFromCharCode(value)}).join("")}function basicToDigit(codePoint){return codePoint-48<10?codePoint-22:codePoint-65<26?codePoint-65:codePoint-97<26?codePoint-97:base}function digitToBasic(digit,flag){return digit+22+75*(digit<26)-((0!=flag)<<5)}function adapt(delta,numPoints,firstTime){var k=0;for(delta=firstTime?floor(delta/damp):delta>>1,delta+=floor(delta/numPoints);delta>baseMinusTMin*tMax>>1;k+=base)delta=floor(delta/baseMinusTMin);return floor(k+(baseMinusTMin+1)*delta/(delta+skew))}function decode(input){var out,basic,j,index,oldi,w,k,digit,t,baseMinusT,output=[],inputLength=input.length,i=0,n=initialN,bias=initialBias;for((basic=input.lastIndexOf(delimiter))<0&&(basic=0),j=0;j<basic;++j)input.charCodeAt(j)>=128&&error("not-basic"),output.push(input.charCodeAt(j));for(index=basic>0?basic+1:0;index<inputLength;){for(oldi=i,w=1,k=base;index>=inputLength&&error("invalid-input"),((digit=basicToDigit(input.charCodeAt(index++)))>=base||digit>floor((maxInt-i)/w))&&error("overflow"),i+=digit*w,t=k<=bias?tMin:k>=bias+tMax?tMax:k-bias,!(digit<t);k+=base)w>floor(maxInt/(baseMinusT=base-t))&&error("overflow"),w*=baseMinusT;bias=adapt(i-oldi,out=output.length+1,0==oldi),floor(i/out)>maxInt-n&&error("overflow"),n+=floor(i/out),i%=out,output.splice(i++,0,n)}return ucs2encode(output)}function encode(input){var n,delta,handledCPCount,basicLength,bias,j,m,q,k,t,currentValue,inputLength,handledCPCountPlusOne,baseMinusT,qMinusT,output=[];for(inputLength=(input=ucs2decode(input)).length,n=initialN,delta=0,bias=initialBias,j=0;j<inputLength;++j)(currentValue=input[j])<128&&output.push(stringFromCharCode(currentValue));for(handledCPCount=basicLength=output.length,basicLength&&output.push(delimiter);handledCPCount<inputLength;){for(m=maxInt,j=0;j<inputLength;++j)(currentValue=input[j])>=n&&currentValue<m&&(m=currentValue);for(m-n>floor((maxInt-delta)/(handledCPCountPlusOne=handledCPCount+1))&&error("overflow"),delta+=(m-n)*handledCPCountPlusOne,n=m,j=0;j<inputLength;++j)if((currentValue=input[j])<n&&++delta>maxInt&&error("overflow"),currentValue==n){for(q=delta,k=base;t=k<=bias?tMin:k>=bias+tMax?tMax:k-bias,!(q<t);k+=base)qMinusT=q-t,baseMinusT=base-t,output.push(stringFromCharCode(digitToBasic(t+qMinusT%baseMinusT,0))),q=floor(qMinusT/baseMinusT);output.push(stringFromCharCode(digitToBasic(q,0))),bias=adapt(delta,handledCPCountPlusOne,handledCPCount==basicLength),delta=0,++handledCPCount}++delta,++n}return output.join("")}var freeExports="object"==typeof exports&&exports&&!exports.nodeType&&exports,freeModule="object"==typeof module&&module&&!module.nodeType&&module,freeGlobal="object"==typeof global&&global;freeGlobal.global!==freeGlobal&&freeGlobal.window!==freeGlobal&&freeGlobal.self!==freeGlobal||(root=freeGlobal);var punycode,key,maxInt=2147483647,base=36,tMin=1,tMax=26,skew=38,damp=700,initialBias=72,initialN=128,delimiter="-",regexPunycode=/^xn--/,regexNonASCII=/[^\x20-\x7E]/,regexSeparators=/[\x2E\u3002\uFF0E\uFF61]/g,errors={overflow:"Overflow: input needs wider integers to process","not-basic":"Illegal input >= 0x80 (not a basic code point)","invalid-input":"Invalid input"},baseMinusTMin=base-tMin,floor=Math.floor,stringFromCharCode=String.fromCharCode;if(punycode={version:"1.4.1",ucs2:{decode:ucs2decode,encode:ucs2encode},decode:decode,encode:encode,toASCII:function(input){return mapDomain(input,function(string){return regexNonASCII.test(string)?"xn--"+encode(string):string})},toUnicode:function(input){return mapDomain(input,function(string){return regexPunycode.test(string)?decode(string.slice(4).toLowerCase()):string})}},freeExports&&freeModule)if(module.exports==freeExports)freeModule.exports=punycode;else for(key in punycode)punycode.hasOwnProperty(key)&&(freeExports[key]=punycode[key]);else root.punycode=punycode}(this)}).call(this,"undefined"!=typeof global?global:"undefined"!=typeof self?self:"undefined"!=typeof window?window:{})},{}],236:[function(require,module,exports){module.exports=/[\0-\x1F\x7F-\x9F]/},{}],237:[function(require,module,exports){module.exports=/[\xAD\u0600-\u0605\u061C\u06DD\u070F\u08E2\u180E\u200B-\u200F\u202A-\u202E\u2060-\u2064\u2066-\u206F\uFEFF\uFFF9-\uFFFB]|\uD804\uDCBD|\uD82F[\uDCA0-\uDCA3]|\uD834[\uDD73-\uDD7A]|\uDB40[\uDC01\uDC20-\uDC7F]/},{}],238:[function(require,module,exports){module.exports=/[!-#%-\*,-/:;\?@\[-\]_\{\}\xA1\xA7\xAB\xB6\xB7\xBB\xBF\u037E\u0387\u055A-\u055F\u0589\u058A\u05BE\u05C0\u05C3\u05C6\u05F3\u05F4\u0609\u060A\u060C\u060D\u061B\u061E\u061F\u066A-\u066D\u06D4\u0700-\u070D\u07F7-\u07F9\u0830-\u083E\u085E\u0964\u0965\u0970\u0AF0\u0DF4\u0E4F\u0E5A\u0E5B\u0F04-\u0F12\u0F14\u0F3A-\u0F3D\u0F85\u0FD0-\u0FD4\u0FD9\u0FDA\u104A-\u104F\u10FB\u1360-\u1368\u1400\u166D\u166E\u169B\u169C\u16EB-\u16ED\u1735\u1736\u17D4-\u17D6\u17D8-\u17DA\u1800-\u180A\u1944\u1945\u1A1E\u1A1F\u1AA0-\u1AA6\u1AA8-\u1AAD\u1B5A-\u1B60\u1BFC-\u1BFF\u1C3B-\u1C3F\u1C7E\u1C7F\u1CC0-\u1CC7\u1CD3\u2010-\u2027\u2030-\u2043\u2045-\u2051\u2053-\u205E\u207D\u207E\u208D\u208E\u2308-\u230B\u2329\u232A\u2768-\u2775\u27C5\u27C6\u27E6-\u27EF\u2983-\u2998\u29D8-\u29DB\u29FC\u29FD\u2CF9-\u2CFC\u2CFE\u2CFF\u2D70\u2E00-\u2E2E\u2E30-\u2E44\u3001-\u3003\u3008-\u3011\u3014-\u301F\u3030\u303D\u30A0\u30FB\uA4FE\uA4FF\uA60D-\uA60F\uA673\uA67E\uA6F2-\uA6F7\uA874-\uA877\uA8CE\uA8CF\uA8F8-\uA8FA\uA8FC\uA92E\uA92F\uA95F\uA9C1-\uA9CD\uA9DE\uA9DF\uAA5C-\uAA5F\uAADE\uAADF\uAAF0\uAAF1\uABEB\uFD3E\uFD3F\uFE10-\uFE19\uFE30-\uFE52\uFE54-\uFE61\uFE63\uFE68\uFE6A\uFE6B\uFF01-\uFF03\uFF05-\uFF0A\uFF0C-\uFF0F\uFF1A\uFF1B\uFF1F\uFF20\uFF3B-\uFF3D\uFF3F\uFF5B\uFF5D\uFF5F-\uFF65]|\uD800[\uDD00-\uDD02\uDF9F\uDFD0]|\uD801\uDD6F|\uD802[\uDC57\uDD1F\uDD3F\uDE50-\uDE58\uDE7F\uDEF0-\uDEF6\uDF39-\uDF3F\uDF99-\uDF9C]|\uD804[\uDC47-\uDC4D\uDCBB\uDCBC\uDCBE-\uDCC1\uDD40-\uDD43\uDD74\uDD75\uDDC5-\uDDC9\uDDCD\uDDDB\uDDDD-\uDDDF\uDE38-\uDE3D\uDEA9]|\uD805[\uDC4B-\uDC4F\uDC5B\uDC5D\uDCC6\uDDC1-\uDDD7\uDE41-\uDE43\uDE60-\uDE6C\uDF3C-\uDF3E]|\uD807[\uDC41-\uDC45\uDC70\uDC71]|\uD809[\uDC70-\uDC74]|\uD81A[\uDE6E\uDE6F\uDEF5\uDF37-\uDF3B\uDF44]|\uD82F\uDC9F|\uD836[\uDE87-\uDE8B]|\uD83A[\uDD5E\uDD5F]/},{}],239:[function(require,module,exports){module.exports=/[ \xA0\u1680\u2000-\u200A\u202F\u205F\u3000]/},{}],240:[function(require,module,exports){"use strict";exports.Any=require("./properties/Any/regex"),exports.Cc=require("./categories/Cc/regex"),exports.Cf=require("./categories/Cf/regex"),exports.P=require("./categories/P/regex"),exports.Z=require("./categories/Z/regex")},{"./categories/Cc/regex":236,"./categories/Cf/regex":237,"./categories/P/regex":238,"./categories/Z/regex":239,"./properties/Any/regex":241}],241:[function(require,module,exports){module.exports=/[\0-\uD7FF\uE000-\uFFFF]|[\uD800-\uDBFF][\uDC00-\uDFFF]|[\uD800-\uDBFF](?![\uDC00-\uDFFF])|(?:[^\uD800-\uDBFF]|^)[\uDC00-\uDFFF]/},{}],242:[function(require,module,exports){"function"==typeof Object.create?module.exports=function(ctor,superCtor){ctor.super_=superCtor,ctor.prototype=Object.create(superCtor.prototype,{constructor:{value:ctor,enumerable:!1,writable:!0,configurable:!0}})}:module.exports=function(ctor,superCtor){ctor.super_=superCtor;var TempCtor=function(){};TempCtor.prototype=superCtor.prototype,ctor.prototype=new TempCtor,ctor.prototype.constructor=ctor}},{}],243:[function(require,module,exports){module.exports=function(arg){return arg&&"object"==typeof arg&&"function"==typeof arg.copy&&"function"==typeof arg.fill&&"function"==typeof arg.readUInt8}},{}],244:[function(require,module,exports){(function(process,global){function inspect(obj,opts){var ctx={seen:[],stylize:stylizeNoColor};return arguments.length>=3&&(ctx.depth=arguments[2]),arguments.length>=4&&(ctx.colors=arguments[3]),isBoolean(opts)?ctx.showHidden=opts:opts&&exports._extend(ctx,opts),isUndefined(ctx.showHidden)&&(ctx.showHidden=!1),isUndefined(ctx.depth)&&(ctx.depth=2),isUndefined(ctx.colors)&&(ctx.colors=!1),isUndefined(ctx.customInspect)&&(ctx.customInspect=!0),ctx.colors&&(ctx.stylize=stylizeWithColor),formatValue(ctx,obj,ctx.depth)}function stylizeWithColor(str,styleType){var style=inspect.styles[styleType];return style?"["+inspect.colors[style][0]+"m"+str+"["+inspect.colors[style][1]+"m":str}function stylizeNoColor(str,styleType){return str}function arrayToHash(array){var hash={};return array.forEach(function(val,idx){hash[val]=!0}),hash}function formatValue(ctx,value,recurseTimes){if(ctx.customInspect&&value&&isFunction(value.inspect)&&value.inspect!==exports.inspect&&(!value.constructor||value.constructor.prototype!==value)){var ret=value.inspect(recurseTimes,ctx);return isString(ret)||(ret=formatValue(ctx,ret,recurseTimes)),ret}var primitive=formatPrimitive(ctx,value);if(primitive)return primitive;var keys=Object.keys(value),visibleKeys=arrayToHash(keys);if(ctx.showHidden&&(keys=Object.getOwnPropertyNames(value)),isError(value)&&(keys.indexOf("message")>=0||keys.indexOf("description")>=0))return formatError(value);if(0===keys.length){if(isFunction(value)){var name=value.name?": "+value.name:"";return ctx.stylize("[Function"+name+"]","special")}if(isRegExp(value))return ctx.stylize(RegExp.prototype.toString.call(value),"regexp");if(isDate(value))return ctx.stylize(Date.prototype.toString.call(value),"date");if(isError(value))return formatError(value)}var base="",array=!1,braces=["{","}"];if(isArray(value)&&(array=!0,braces=["[","]"]),isFunction(value)&&(base=" [Function"+(value.name?": "+value.name:"")+"]"),isRegExp(value)&&(base=" "+RegExp.prototype.toString.call(value)),isDate(value)&&(base=" "+Date.prototype.toUTCString.call(value)),isError(value)&&(base=" "+formatError(value)),0===keys.length&&(!array||0==value.length))return braces[0]+base+braces[1];if(recurseTimes<0)return isRegExp(value)?ctx.stylize(RegExp.prototype.toString.call(value),"regexp"):ctx.stylize("[Object]","special");ctx.seen.push(value);var output;return output=array?formatArray(ctx,value,recurseTimes,visibleKeys,keys):keys.map(function(key){return formatProperty(ctx,value,recurseTimes,visibleKeys,key,array)}),ctx.seen.pop(),reduceToSingleString(output,base,braces)}function formatPrimitive(ctx,value){if(isUndefined(value))return ctx.stylize("undefined","undefined");if(isString(value)){var simple="'"+JSON.stringify(value).replace(/^"|"$/g,"").replace(/'/g,"\\'").replace(/\\"/g,'"')+"'";return ctx.stylize(simple,"string")}return isNumber(value)?ctx.stylize(""+value,"number"):isBoolean(value)?ctx.stylize(""+value,"boolean"):isNull(value)?ctx.stylize("null","null"):void 0}function formatError(value){return"["+Error.prototype.toString.call(value)+"]"}function formatArray(ctx,value,recurseTimes,visibleKeys,keys){for(var output=[],i=0,l=value.length;i<l;++i)hasOwnProperty(value,String(i))?output.push(formatProperty(ctx,value,recurseTimes,visibleKeys,String(i),!0)):output.push("");return keys.forEach(function(key){key.match(/^\d+$/)||output.push(formatProperty(ctx,value,recurseTimes,visibleKeys,key,!0))}),output}function formatProperty(ctx,value,recurseTimes,visibleKeys,key,array){var name,str,desc;if((desc=Object.getOwnPropertyDescriptor(value,key)||{value:value[key]}).get?str=desc.set?ctx.stylize("[Getter/Setter]","special"):ctx.stylize("[Getter]","special"):desc.set&&(str=ctx.stylize("[Setter]","special")),hasOwnProperty(visibleKeys,key)||(name="["+key+"]"),str||(ctx.seen.indexOf(desc.value)<0?(str=isNull(recurseTimes)?formatValue(ctx,desc.value,null):formatValue(ctx,desc.value,recurseTimes-1)).indexOf("\n")>-1&&(str=array?str.split("\n").map(function(line){return"  "+line}).join("\n").substr(2):"\n"+str.split("\n").map(function(line){return"   "+line}).join("\n")):str=ctx.stylize("[Circular]","special")),isUndefined(name)){if(array&&key.match(/^\d+$/))return str;(name=JSON.stringify(""+key)).match(/^"([a-zA-Z_][a-zA-Z_0-9]*)"$/)?(name=name.substr(1,name.length-2),name=ctx.stylize(name,"name")):(name=name.replace(/'/g,"\\'").replace(/\\"/g,'"').replace(/(^"|"$)/g,"'"),name=ctx.stylize(name,"string"))}return name+": "+str}function reduceToSingleString(output,base,braces){var numLinesEst=0;return output.reduce(function(prev,cur){return numLinesEst++,cur.indexOf("\n")>=0&&numLinesEst++,prev+cur.replace(/\u001b\[\d\d?m/g,"").length+1},0)>60?braces[0]+(""===base?"":base+"\n ")+" "+output.join(",\n  ")+" "+braces[1]:braces[0]+base+" "+output.join(", ")+" "+braces[1]}function isArray(ar){return Array.isArray(ar)}function isBoolean(arg){return"boolean"==typeof arg}function isNull(arg){return null===arg}function isNumber(arg){return"number"==typeof arg}function isString(arg){return"string"==typeof arg}function isUndefined(arg){return void 0===arg}function isRegExp(re){return isObject(re)&&"[object RegExp]"===objectToString(re)}function isObject(arg){return"object"==typeof arg&&null!==arg}function isDate(d){return isObject(d)&&"[object Date]"===objectToString(d)}function isError(e){return isObject(e)&&("[object Error]"===objectToString(e)||e instanceof Error)}function isFunction(arg){return"function"==typeof arg}function objectToString(o){return Object.prototype.toString.call(o)}function pad(n){return n<10?"0"+n.toString(10):n.toString(10)}function timestamp(){var d=new Date,time=[pad(d.getHours()),pad(d.getMinutes()),pad(d.getSeconds())].join(":");return[d.getDate(),months[d.getMonth()],time].join(" ")}function hasOwnProperty(obj,prop){return Object.prototype.hasOwnProperty.call(obj,prop)}var formatRegExp=/%[sdj%]/g;exports.format=function(f){if(!isString(f)){for(var objects=[],i=0;i<arguments.length;i++)objects.push(inspect(arguments[i]));return objects.join(" ")}for(var i=1,args=arguments,len=args.length,str=String(f).replace(formatRegExp,function(x){if("%%"===x)return"%";if(i>=len)return x;switch(x){case"%s":return String(args[i++]);case"%d":return Number(args[i++]);case"%j":try{return JSON.stringify(args[i++])}catch(_){return"[Circular]"}default:return x}}),x=args[i];i<len;x=args[++i])isNull(x)||!isObject(x)?str+=" "+x:str+=" "+inspect(x);return str},exports.deprecate=function(fn,msg){if(isUndefined(global.process))return function(){return exports.deprecate(fn,msg).apply(this,arguments)};if(!0===process.noDeprecation)return fn;var warned=!1;return function(){if(!warned){if(process.throwDeprecation)throw new Error(msg);process.traceDeprecation?console.trace(msg):console.error(msg),warned=!0}return fn.apply(this,arguments)}};var debugEnviron,debugs={};exports.debuglog=function(set){if(isUndefined(debugEnviron)&&(debugEnviron=process.env.NODE_DEBUG||""),set=set.toUpperCase(),!debugs[set])if(new RegExp("\\b"+set+"\\b","i").test(debugEnviron)){var pid=process.pid;debugs[set]=function(){var msg=exports.format.apply(exports,arguments);console.error("%s %d: %s",set,pid,msg)}}else debugs[set]=function(){};return debugs[set]},exports.inspect=inspect,inspect.colors={bold:[1,22],italic:[3,23],underline:[4,24],inverse:[7,27],white:[37,39],grey:[90,39],black:[30,39],blue:[34,39],cyan:[36,39],green:[32,39],magenta:[35,39],red:[31,39],yellow:[33,39]},inspect.styles={special:"cyan",number:"yellow",boolean:"yellow",undefined:"grey",null:"bold",string:"green",date:"magenta",regexp:"red"},exports.isArray=isArray,exports.isBoolean=isBoolean,exports.isNull=isNull,exports.isNullOrUndefined=function(arg){return null==arg},exports.isNumber=isNumber,exports.isString=isString,exports.isSymbol=function(arg){return"symbol"==typeof arg},exports.isUndefined=isUndefined,exports.isRegExp=isRegExp,exports.isObject=isObject,exports.isDate=isDate,exports.isError=isError,exports.isFunction=isFunction,exports.isPrimitive=function(arg){return null===arg||"boolean"==typeof arg||"number"==typeof arg||"string"==typeof arg||"symbol"==typeof arg||void 0===arg},exports.isBuffer=require("./support/isBuffer");var months=["Jan","Feb","Mar","Apr","May","Jun","Jul","Aug","Sep","Oct","Nov","Dec"];exports.log=function(){console.log("%s - %s",timestamp(),exports.format.apply(exports,arguments))},exports.inherits=require("inherits"),exports._extend=function(origin,add){if(!add||!isObject(add))return origin;for(var keys=Object.keys(add),i=keys.length;i--;)origin[keys[i]]=add[keys[i]];return origin}}).call(this,require("_process"),"undefined"!=typeof global?global:"undefined"!=typeof self?self:"undefined"!=typeof window?window:{})},{"./support/isBuffer":243,_process:229,inherits:242}]},{},[22])(22)});
diff --git a/server/index-node/assets/index.html b/server/index-node/assets/index.html
new file mode 100644
index 0000000..1fcd14b
--- /dev/null
+++ b/server/index-node/assets/index.html
@@ -0,0 +1,155 @@
+<!--
+ *  Copyright (c) Facebook, Inc.
+ *  All rights reserved.
+ *
+ *  This source code is licensed under the license found in the
+ *  LICENSE file in the root directory of this source tree.
+-->
+<!DOCTYPE html>
+<html>
+    <head>
+        <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
+        <style>
+         body {
+             height: 100%;
+             margin: 0;
+             width: 100%;
+             overflow: hidden;
+         }
+         #graphiql {
+             height: 100vh;
+         }
+        </style>
+
+        <!--
+             This GraphiQL example depends on Promise and fetch, which are available in
+             modern browsers, but can be "polyfilled" for older browsers.
+             GraphiQL itself depends on React DOM.
+             If you do not want to rely on a CDN, you can host these files locally or
+             include them directly in your favored resource bunder.
+           -->
+        <script src="//cdn.jsdelivr.net/es6-promise/4.0.5/es6-promise.auto.min.js"></script>
+        <script src="//cdn.jsdelivr.net/fetch/0.9.0/fetch.min.js"></script>
+        <script src="//cdn.jsdelivr.net/react/15.4.2/react.min.js"></script>
+        <script src="//cdn.jsdelivr.net/react/15.4.2/react-dom.min.js"></script>
+
+        <!-- Pull in the GraphiQL subscriptions fetcher -->
+        <script src="//unpkg.com/subscriptions-transport-ws@0.8.2/browser/client.js"></script>
+        <script src="//unpkg.com/graphiql-subscriptions-fetcher@0.0.2/browser/client.js"></script>
+
+        <!--
+             These two files can be found in the npm module, however you may wish to
+             copy them directly into your environment, or perhaps include them in your
+             favored resource bundler.
+           -->
+        <link rel="stylesheet" href="/graphiql.css" />
+        <script src="/graphiql.min.js"></script>
+
+    </head>
+    <body>
+        <div id="graphiql">Loading...</div>
+        <script>
+
+         /**
+          * This GraphiQL example illustrates how to use some of GraphiQL's props
+          * in order to enable reading and updating the URL parameters, making
+          * link sharing of queries a little bit easier.
+          *
+          * This is only one example of this kind of feature, GraphiQL exposes
+          * various React params to enable interesting integrations.
+          */
+
+         // Parse the search string to get url parameters.
+         var search = window.location.search;
+         var parameters = {};
+         search.substr(1).split('&').forEach(function (entry) {
+             var eq = entry.indexOf('=');
+             if (eq >= 0) {
+                 parameters[decodeURIComponent(entry.slice(0, eq))] =
+                     decodeURIComponent(entry.slice(eq + 1));
+             }
+         });
+
+         // if variables was provided, try to format it.
+         if (parameters.variables) {
+             try {
+                 parameters.variables =
+                     JSON.stringify(JSON.parse(parameters.variables), null, 2);
+             } catch (e) {
+                 // Do nothing, we want to display the invalid JSON as a string, rather
+                 // than present an error.
+             }
+         }
+
+         // When the query and variables string is edited, update the URL bar so
+         // that it can be easily shared
+         function onEditQuery(newQuery) {
+             parameters.query = newQuery;
+             updateURL();
+         }
+
+         function onEditVariables(newVariables) {
+             parameters.variables = newVariables;
+             updateURL();
+         }
+
+         function onEditOperationName(newOperationName) {
+             parameters.operationName = newOperationName;
+             updateURL();
+         }
+
+         function updateURL() {
+             var newSearch = '?' + Object.keys(parameters).filter(function (key) {
+                 return Boolean(parameters[key]);
+             }).map(function (key) {
+                 return encodeURIComponent(key) + '=' +
+                        encodeURIComponent(parameters[key]);
+             }).join('&');
+             history.replaceState(null, null, newSearch);
+         }
+
+         var graphQLEndpoint = window.location.pathname
+             .substring(0, window.location.pathname.length - "/playground".length);
+
+         // Defines a GraphQL fetcher using the fetch API. You're not required to
+         // use fetch, and could instead implement graphQLFetcher however you like,
+         // as long as it returns a Promise or Observable.
+         function graphQLFetcher(graphQLParams) {
+             return fetch(graphQLEndpoint, {
+                 method: 'post',
+                 headers: {
+                     'Accept': 'application/json',
+                     'Content-Type': 'application/json',
+                 },
+                 body: JSON.stringify(graphQLParams),
+                 credentials: 'include',
+             }).then(function (response) {
+                 return response.text();
+             }).then(function (responseBody) {
+                 try {
+                     return JSON.parse(responseBody);
+                 } catch (error) {
+                     return responseBody;
+                 }
+             });
+         }
+
+         // Render <GraphiQL /> into the body.
+         // See the README in the top level of this module to learn more about
+         // how you can customize GraphiQL by providing different values or
+         // additional child elements.
+         ReactDOM.render(
+             React.createElement(GraphiQL, {
+                 fetcher: graphQLFetcher,
+                 query: parameters.query,
+                 variables: parameters.variables,
+                 operationName: parameters.operationName,
+                 onEditQuery: onEditQuery,
+                 onEditVariables: onEditVariables,
+                 onEditOperationName: onEditOperationName
+             }),
+             document.getElementById('graphiql')
+         );
+        </script>
+    </body>
+</html>
diff --git a/server/index-node/src/auth.rs b/server/index-node/src/auth.rs
new file mode 100644
index 0000000..7f27a53
--- /dev/null
+++ b/server/index-node/src/auth.rs
@@ -0,0 +1,54 @@
+use hyper::header::AUTHORIZATION;
+
+use graph::env::EnvVars;
+
+/// Validation logic for access tokens required to access POI results.
+pub struct PoiProtection {
+    reqd_access_token: Option<String>,
+}
+
+impl PoiProtection {
+    /// Creates a new [`PoiProtection`] instance configured in accordance with
+    /// the `GRAPH_POI_ACCESS_TOKEN` environment variable.
+    pub fn from_env(env: &EnvVars) -> Self {
+        Self {
+            reqd_access_token: env.poi_access_token.clone(),
+        }
+    }
+
+    /// Returns `true` iff the given access token allows access to POI results.
+    /// When set to [`None`], access will only be permitted when
+    /// [`PoiProtection::is_active`] is `false`.
+    pub fn validate_access_token(&self, access_token: Option<&str>) -> bool {
+        match (self.reqd_access_token.as_ref(), access_token) {
+            // No active protection.
+            (None, _) => true,
+            // Protection is active, but no access token was provided.
+            (Some(_), None) => false,
+            (Some(a), Some(b)) => {
+                // When comparing secrets to untrusted user data, we have to be
+                // careful about timing attacks. Constant-time comparison is the
+                // standard choice in these situations, but it can be quite
+                // convoluted. Instead, we'll compare the BLAKE3 hashes of the
+                // two values: this way we don't have to worry about timing
+                // attacks nor vetting a constant-time comparison crate.
+                //
+                // We get 128 bits of security out of the box (256/2), which
+                // is plenty.
+                let hash_a = blake3::hash(a.as_bytes());
+                let hash_b = blake3::hash(b.as_bytes());
+                hash_a == hash_b
+            }
+        }
+    }
+
+    /// Returns `true` iff POI results protection is configured.
+    pub fn is_active(&self) -> bool {
+        self.reqd_access_token.is_some()
+    }
+}
+
+pub fn bearer_token(headers: &hyper::HeaderMap) -> Option<&[u8]> {
+    let header = headers.get(AUTHORIZATION)?.as_bytes();
+    header.strip_prefix(b"Bearer ")
+}
diff --git a/server/index-node/src/explorer.rs b/server/index-node/src/explorer.rs
new file mode 100644
index 0000000..59fc5db
--- /dev/null
+++ b/server/index-node/src/explorer.rs
@@ -0,0 +1,231 @@
+//! Functionality to support the explorer in the hosted service. Everything
+//! in this file is private API and experimental and subject to change at
+//! any time
+use graph::prelude::r;
+use http::{Response, StatusCode};
+use hyper::header::{
+    ACCESS_CONTROL_ALLOW_HEADERS, ACCESS_CONTROL_ALLOW_METHODS, ACCESS_CONTROL_ALLOW_ORIGIN,
+    CONTENT_TYPE,
+};
+use hyper::Body;
+use std::{sync::Arc, time::Instant};
+
+use graph::{
+    components::{
+        server::{index_node::VersionInfo, query::GraphQLServerError},
+        store::StatusStore,
+    },
+    data::subgraph::status,
+    object,
+    prelude::{serde_json, warn, Logger, ENV_VARS},
+    util::timed_cache::TimedCache,
+};
+
+// Do not implement `Clone` for this; the IndexNode service puts the `Explorer`
+// behind an `Arc` so we don't have to put each `Cache` into an `Arc`
+//
+// We cache responses for a fixed amount of time with the time given by
+// `GRAPH_EXPLORER_TTL`
+#[derive(Debug)]
+pub struct Explorer<S> {
+    store: Arc<S>,
+    versions: TimedCache<String, r::Value>,
+    version_infos: TimedCache<String, VersionInfo>,
+    entity_counts: TimedCache<String, r::Value>,
+}
+
+impl<S> Explorer<S>
+where
+    S: StatusStore,
+{
+    pub fn new(store: Arc<S>) -> Self {
+        Self {
+            store,
+            versions: TimedCache::new(ENV_VARS.explorer_ttl),
+            version_infos: TimedCache::new(ENV_VARS.explorer_ttl),
+            entity_counts: TimedCache::new(ENV_VARS.explorer_ttl),
+        }
+    }
+
+    pub fn handle(
+        &self,
+        logger: &Logger,
+        req: &[&str],
+    ) -> Result<Response<Body>, GraphQLServerError> {
+        match req {
+            ["subgraph-versions", subgraph_id] => self.handle_subgraph_versions(subgraph_id),
+            ["subgraph-version", version] => self.handle_subgraph_version(version),
+            ["subgraph-repo", version] => self.handle_subgraph_repo(version),
+            ["entity-count", deployment] => self.handle_entity_count(logger, deployment),
+            ["subgraphs-for-deployment", deployment_hash] => {
+                self.handle_subgraphs_for_deployment(deployment_hash)
+            }
+            _ => handle_not_found(),
+        }
+    }
+
+    fn handle_subgraph_versions(
+        &self,
+        subgraph_id: &str,
+    ) -> Result<Response<Body>, GraphQLServerError> {
+        if let Some(value) = self.versions.get(subgraph_id) {
+            return Ok(as_http_response(value.as_ref()));
+        }
+
+        let (current, pending) = self.store.versions_for_subgraph_id(subgraph_id)?;
+
+        let value = object! {
+            currentVersion: current,
+            pendingVersion: pending
+        };
+
+        let resp = as_http_response(&value);
+        self.versions.set(subgraph_id.to_string(), Arc::new(value));
+        Ok(resp)
+    }
+
+    fn handle_subgraph_version(&self, version: &str) -> Result<Response<Body>, GraphQLServerError> {
+        let vi = self.version_info(version)?;
+
+        let latest_ethereum_block_number = vi.latest_ethereum_block_number.map(|n| n as i32);
+        let total_ethereum_blocks_count = vi.total_ethereum_blocks_count.map(|n| n as i32);
+        let value = object! {
+            createdAt: vi.created_at.as_str(),
+            deploymentId: vi.deployment_id.as_str(),
+            latestEthereumBlockNumber: latest_ethereum_block_number,
+            totalEthereumBlocksCount: total_ethereum_blocks_count,
+            synced: vi.synced,
+            failed: vi.failed,
+            description: vi.description.as_ref().map(|s| s.as_str()),
+            repository: vi.repository.as_ref().map(|s| s.as_str()),
+            schema: vi.schema.document.to_string(),
+            network: vi.network.as_str()
+        };
+        Ok(as_http_response(&value))
+    }
+
+    fn handle_subgraph_repo(&self, version: &str) -> Result<Response<Body>, GraphQLServerError> {
+        let vi = self.version_info(version)?;
+
+        let value = object! {
+            createdAt: vi.created_at.as_str(),
+            deploymentId: vi.deployment_id.as_str(),
+            repository: vi.repository.as_ref().map(|s| s.as_str())
+        };
+        Ok(as_http_response(&value))
+    }
+
+    fn handle_entity_count(
+        &self,
+        logger: &Logger,
+        deployment: &str,
+    ) -> Result<Response<Body>, GraphQLServerError> {
+        let start = Instant::now();
+        let count = self.entity_counts.get(deployment);
+        if start.elapsed() > ENV_VARS.explorer_lock_threshold {
+            let action = match count {
+                Some(_) => "cache_hit",
+                None => "cache_miss",
+            };
+            warn!(logger, "Getting entity_count takes too long";
+                       "action" => action,
+                       "deployment" => deployment,
+                       "time_ms" => start.elapsed().as_millis());
+        }
+
+        if let Some(value) = count {
+            return Ok(as_http_response(value.as_ref()));
+        }
+
+        let start = Instant::now();
+        let infos = self
+            .store
+            .status(status::Filter::Deployments(vec![deployment.to_string()]))?;
+        if start.elapsed() > ENV_VARS.explorer_query_threshold {
+            warn!(logger, "Getting entity_count takes too long";
+            "action" => "query_status",
+            "deployment" => deployment,
+            "time_ms" => start.elapsed().as_millis());
+        }
+        let info = match infos.first() {
+            Some(info) => info,
+            None => {
+                return handle_not_found();
+            }
+        };
+
+        let value = object! {
+            entityCount: info.entity_count as i32
+        };
+        let start = Instant::now();
+        let resp = as_http_response(&value);
+        if start.elapsed() > ENV_VARS.explorer_lock_threshold {
+            warn!(logger, "Getting entity_count takes too long";
+            "action" => "as_http_response",
+            "deployment" => deployment,
+            "time_ms" => start.elapsed().as_millis());
+        }
+        let start = Instant::now();
+        self.entity_counts
+            .set(deployment.to_string(), Arc::new(value));
+        if start.elapsed() > ENV_VARS.explorer_lock_threshold {
+            warn!(logger, "Getting entity_count takes too long";
+                "action" => "cache_set",
+                "deployment" => deployment,
+                "time_ms" => start.elapsed().as_millis());
+        }
+        Ok(resp)
+    }
+
+    fn version_info(&self, version: &str) -> Result<Arc<VersionInfo>, GraphQLServerError> {
+        match self.version_infos.get(version) {
+            Some(vi) => Ok(vi),
+            None => {
+                let vi = Arc::new(self.store.version_info(version)?);
+                self.version_infos.set(version.to_string(), vi.clone());
+                Ok(vi)
+            }
+        }
+    }
+
+    fn handle_subgraphs_for_deployment(
+        &self,
+        deployment_hash: &str,
+    ) -> Result<Response<Body>, GraphQLServerError> {
+        let name_version_pairs: Vec<r::Value> = self
+            .store
+            .subgraphs_for_deployment_hash(deployment_hash)?
+            .into_iter()
+            .map(|(name, version)| {
+                object! {
+                    name: name,
+                    version: version
+                }
+            })
+            .collect();
+        let payload = r::Value::List(name_version_pairs);
+        Ok(as_http_response(&payload))
+    }
+}
+
+fn handle_not_found() -> Result<Response<Body>, GraphQLServerError> {
+    Ok(Response::builder()
+        .status(StatusCode::NOT_FOUND)
+        .header(CONTENT_TYPE, "text/plain")
+        .header(ACCESS_CONTROL_ALLOW_ORIGIN, "*")
+        .body(Body::from("Not found\n"))
+        .unwrap())
+}
+
+fn as_http_response(value: &r::Value) -> http::Response<Body> {
+    let status_code = http::StatusCode::OK;
+    let json = serde_json::to_string(&value).expect("Failed to serialize response to JSON");
+    http::Response::builder()
+        .status(status_code)
+        .header(ACCESS_CONTROL_ALLOW_ORIGIN, "*")
+        .header(ACCESS_CONTROL_ALLOW_HEADERS, "Content-Type, User-Agent")
+        .header(ACCESS_CONTROL_ALLOW_METHODS, "GET, OPTIONS, POST")
+        .header(CONTENT_TYPE, "application/json")
+        .body(Body::from(json))
+        .unwrap()
+}
diff --git a/server/index-node/src/lib.rs b/server/index-node/src/lib.rs
new file mode 100644
index 0000000..bbf1994
--- /dev/null
+++ b/server/index-node/src/lib.rs
@@ -0,0 +1,10 @@
+mod auth;
+mod explorer;
+mod resolver;
+mod schema;
+mod server;
+mod service;
+
+pub use self::auth::PoiProtection;
+pub use self::server::IndexNodeServer;
+pub use self::service::{IndexNodeService, IndexNodeServiceResponse};
diff --git a/server/index-node/src/resolver.rs b/server/index-node/src/resolver.rs
new file mode 100644
index 0000000..43aaf78
--- /dev/null
+++ b/server/index-node/src/resolver.rs
@@ -0,0 +1,885 @@
+use std::collections::BTreeMap;
+use std::convert::TryInto;
+
+use either::Either;
+use graph::data::query::Trace;
+use web3::types::Address;
+
+use graph::blockchain::{Blockchain, BlockchainKind, BlockchainMap};
+use graph::components::store::{BlockStore, EntityType, Store};
+use graph::components::versions::VERSIONS;
+use graph::data::graphql::{object, IntoValue, ObjectOrInterface, ValueMap};
+use graph::data::subgraph::features::detect_features;
+use graph::data::subgraph::status;
+use graph::data::value::{Object, Word};
+use graph::prelude::*;
+use graph_graphql::prelude::{a, ExecutionContext, Resolver};
+
+use crate::auth::PoiProtection;
+
+#[derive(Clone, Debug)]
+struct PublicProofOfIndexingRequest {
+    pub deployment: DeploymentHash,
+    pub block_number: BlockNumber,
+}
+
+impl TryFromValue for PublicProofOfIndexingRequest {
+    fn try_from_value(value: &r::Value) -> Result<Self, Error> {
+        match value {
+            r::Value::Object(o) => Ok(Self {
+                deployment: DeploymentHash::new(o.get_required::<String>("deployment")?).unwrap(),
+                block_number: o.get_required::<BlockNumber>("blockNumber")?,
+            }),
+            _ => Err(anyhow!(
+                "Cannot parse non-object value as PublicProofOfIndexingRequest: {:?}",
+                value
+            )),
+        }
+    }
+}
+
+#[derive(Debug)]
+struct PublicProofOfIndexingResult {
+    pub deployment: DeploymentHash,
+    pub block: PartialBlockPtr,
+    pub proof_of_indexing: Option<[u8; 32]>,
+}
+
+impl IntoValue for PublicProofOfIndexingResult {
+    fn into_value(self) -> r::Value {
+        object! {
+            __typename: "ProofOfIndexingResult",
+            deployment: self.deployment.to_string(),
+            block: object! {
+                number: self.block.number,
+                hash: self.block.hash.map(|hash| hash.hash_hex()),
+            },
+            proofOfIndexing: self.proof_of_indexing.map(|poi| format!("0x{}", hex::encode(&poi))),
+        }
+    }
+}
+
+/// Resolver for the index node GraphQL API.
+#[derive(Clone)]
+pub struct IndexNodeResolver<S: Store> {
+    logger: Logger,
+    blockchain_map: Arc<BlockchainMap>,
+    store: Arc<S>,
+    link_resolver: Arc<dyn LinkResolver>,
+    bearer_token: Option<String>,
+}
+
+impl<S: Store> IndexNodeResolver<S> {
+    pub fn new(
+        logger: &Logger,
+        store: Arc<S>,
+        link_resolver: Arc<dyn LinkResolver>,
+        bearer_token: Option<String>,
+        blockchain_map: Arc<BlockchainMap>,
+    ) -> Self {
+        let logger = logger.new(o!("component" => "IndexNodeResolver"));
+
+        Self {
+            logger,
+            blockchain_map,
+            store,
+            link_resolver,
+            bearer_token,
+        }
+    }
+
+    fn resolve_indexing_statuses(&self, field: &a::Field) -> Result<r::Value, QueryExecutionError> {
+        let deployments = field
+            .argument_value("subgraphs")
+            .map(|value| match value {
+                r::Value::List(ids) => ids
+                    .into_iter()
+                    .map(|id| match id {
+                        r::Value::String(s) => s.clone(),
+                        _ => unreachable!(),
+                    })
+                    .collect(),
+                _ => unreachable!(),
+            })
+            .unwrap_or_else(|| Vec::new());
+
+        let infos = self
+            .store
+            .status(status::Filter::Deployments(deployments))?;
+        Ok(infos.into_value())
+    }
+
+    fn resolve_indexing_statuses_for_subgraph_name(
+        &self,
+        field: &a::Field,
+    ) -> Result<r::Value, QueryExecutionError> {
+        // Get the subgraph name from the arguments; we can safely use `expect` here
+        // because the argument will already have been validated prior to the resolver
+        // being called
+        let subgraph_name = field
+            .get_required::<String>("subgraphName")
+            .expect("subgraphName not provided");
+
+        debug!(
+            self.logger,
+            "Resolve indexing statuses for subgraph name";
+            "name" => &subgraph_name
+        );
+
+        let infos = self
+            .store
+            .status(status::Filter::SubgraphName(subgraph_name))?;
+
+        Ok(infos.into_value())
+    }
+
+    fn resolve_entity_changes_in_block(
+        &self,
+        field: &a::Field,
+    ) -> Result<r::Value, QueryExecutionError> {
+        let subgraph_id = field
+            .get_required::<DeploymentHash>("subgraphId")
+            .expect("Valid subgraphId required");
+
+        let block_number = field
+            .get_required::<BlockNumber>("blockNumber")
+            .expect("Valid blockNumber required");
+
+        let entity_changes = self
+            .store
+            .subgraph_store()
+            .entity_changes_in_block(&subgraph_id, block_number)?;
+
+        Ok(entity_changes_to_graphql(entity_changes))
+    }
+
+    fn resolve_block_data(&self, field: &a::Field) -> Result<r::Value, QueryExecutionError> {
+        let network = field
+            .get_required::<String>("network")
+            .expect("Valid network required");
+
+        let block_hash = field
+            .get_required::<BlockHash>("blockHash")
+            .expect("Valid blockHash required");
+
+        let chain_store = if let Some(cs) = self.store.block_store().chain_store(&network) {
+            cs
+        } else {
+            error!(
+                self.logger,
+                "Failed to fetch block data; nonexistent network";
+                "network" => network,
+                "block_hash" => format!("{}", block_hash),
+            );
+            return Ok(r::Value::Null);
+        };
+
+        let blocks_res = chain_store.blocks(&[block_hash.cheap_clone()]);
+        Ok(match blocks_res {
+            Ok(blocks) if blocks.is_empty() => {
+                error!(
+                    self.logger,
+                    "Failed to fetch block data; block not found";
+                    "network" => network,
+                    "block_hash" => format!("{}", block_hash),
+                );
+                r::Value::Null
+            }
+            Ok(mut blocks) => {
+                assert!(blocks.len() == 1, "Multiple blocks with the same hash");
+                blocks.pop().unwrap().into()
+            }
+            Err(e) => {
+                error!(
+                    self.logger,
+                    "Failed to fetch block data; storage error";
+                    "network" => network.as_str(),
+                    "block_hash" => format!("{}", block_hash),
+                    "error" => e.to_string(),
+                );
+                r::Value::Null
+            }
+        })
+    }
+
+    async fn resolve_block_hash_from_number(
+        &self,
+        field: &a::Field,
+    ) -> Result<r::Value, QueryExecutionError> {
+        let network = field
+            .get_required::<String>("network")
+            .expect("Valid network required");
+        let block_number = field
+            .get_required::<BlockNumber>("blockNumber")
+            .expect("Valid blockNumber required");
+
+        macro_rules! try_resolve_for_chain {
+            ( $typ:path ) => {
+                let blockchain = self.blockchain_map.get::<$typ>(network.to_string()).ok();
+
+                if let Some(blockchain) = blockchain {
+                    debug!(
+                        self.logger,
+                        "Fetching block hash from number";
+                        "network" => &network,
+                        "block_number" => block_number,
+                    );
+
+                    let block_ptr_res = blockchain
+                        .block_pointer_from_number(&self.logger, block_number)
+                        .await;
+
+                        if let Err(e) = block_ptr_res {
+                            warn!(
+                                self.logger,
+                                "Failed to fetch block hash from number";
+                                "network" => &network,
+                                "chain" => <$typ as Blockchain>::KIND.to_string(),
+                                "block_number" => block_number,
+                                "error" => e.to_string(),
+                            );
+                            return Ok(r::Value::Null);
+                        }
+
+                    let block_ptr = block_ptr_res.unwrap();
+                    return Ok(r::Value::String(block_ptr.hash_hex()));
+                }
+            };
+        }
+
+        // Ugly, but we can't get back an object trait from the `BlockchainMap`,
+        // so this seems like the next best thing.
+        try_resolve_for_chain!(graph_chain_ethereum::Chain);
+        try_resolve_for_chain!(graph_chain_arweave::Chain);
+        try_resolve_for_chain!(graph_chain_cosmos::Chain);
+        try_resolve_for_chain!(graph_chain_near::Chain);
+
+        // If you're adding support for a new chain and this `match` clause just
+        // gave you a compiler error, then this message is for you! You need to
+        // add a new `try_resolve!` macro invocation above for your new chain
+        // type.
+        match BlockchainKind::Ethereum {
+            // Note: we don't actually care about substreams here.
+            BlockchainKind::Substreams
+            | BlockchainKind::Arweave
+            | BlockchainKind::Ethereum
+            | BlockchainKind::Cosmos
+            | BlockchainKind::Near => (),
+        }
+
+        // The given network does not exist.
+        Ok(r::Value::Null)
+    }
+
+    async fn resolve_cached_ethereum_calls(
+        &self,
+        field: &a::Field,
+    ) -> Result<r::Value, QueryExecutionError> {
+        let network = field
+            .get_required::<String>("network")
+            .expect("Valid network required");
+
+        let block_hash = field
+            .get_required::<BlockHash>("blockHash")
+            .expect("Valid blockHash required");
+
+        let chain = if let Ok(c) = self
+            .blockchain_map
+            .get::<graph_chain_ethereum::Chain>(network.clone())
+        {
+            c
+        } else {
+            error!(
+                self.logger,
+                "Failed to fetch cached Ethereum calls; nonexistent network";
+                "network" => network,
+                "block_hash" => format!("{}", block_hash),
+            );
+            return Ok(r::Value::Null);
+        };
+        let chain_store = chain.chain_store();
+        let call_cache = chain.call_cache();
+
+        let (block_number, timestamp) = match chain_store.block_number(&block_hash).await {
+            Ok(Some((_, n, timestamp))) => (n, timestamp),
+            Ok(None) => {
+                error!(
+                    self.logger,
+                    "Failed to fetch cached Ethereum calls; block not found";
+                    "network" => network,
+                    "block_hash" => format!("{}", block_hash),
+                );
+                return Ok(r::Value::Null);
+            }
+            Err(e) => {
+                error!(
+                    self.logger,
+                    "Failed to fetch cached Ethereum calls; storage error";
+                    "network" => network.as_str(),
+                    "block_hash" => format!("{}", block_hash),
+                    "error" => e.to_string(),
+                );
+                return Ok(r::Value::Null);
+            }
+        };
+        let block_ptr = BlockPtr::new(block_hash.cheap_clone(), block_number);
+
+        let calls = match call_cache.get_calls_in_block(block_ptr) {
+            Ok(c) => c,
+            Err(e) => {
+                error!(
+                    self.logger,
+                    "Failed to fetch cached Ethereum calls; storage error";
+                    "network" => network.as_str(),
+                    "block_hash" => format!("{}", block_hash),
+                    "error" => e.to_string(),
+                );
+                return Err(QueryExecutionError::StoreError(Error::from(e).into()));
+            }
+        };
+
+        Ok(r::Value::List(
+            calls
+                .into_iter()
+                .map(|cached_call| {
+                    object! {
+                        idHash: &cached_call.blake3_id[..],
+                        block: object! {
+                            hash: cached_call.block_ptr.hash.hash_hex(),
+                            number: cached_call.block_ptr.number,
+                            timestamp: timestamp.clone(),
+                        },
+                        contractAddress: &cached_call.contract_address[..],
+                        returnValue: &cached_call.return_value[..],
+                    }
+                })
+                .collect::<Vec<r::Value>>(),
+        ))
+    }
+
+    fn resolve_proof_of_indexing(&self, field: &a::Field) -> Result<r::Value, QueryExecutionError> {
+        let deployment_id = field
+            .get_required::<DeploymentHash>("subgraph")
+            .expect("Valid subgraphId required");
+
+        let block_number: i32 = field
+            .get_required::<i32>("blockNumber")
+            .expect("Valid blockNumber required")
+            .try_into()
+            .unwrap();
+
+        let block_hash = field
+            .get_required::<BlockHash>("blockHash")
+            .expect("Valid blockHash required");
+
+        let block = BlockPtr::new(block_hash, block_number);
+
+        let mut indexer = field
+            .get_optional::<Address>("indexer")
+            .expect("Invalid indexer");
+
+        let poi_protection = PoiProtection::from_env(&ENV_VARS);
+        if !poi_protection.validate_access_token(self.bearer_token.as_deref()) {
+            // Let's sign the POI with a zero'd address when the access token is
+            // invalid.
+            indexer = Some(Address::zero());
+        }
+
+        let poi_fut = self
+            .store
+            .get_proof_of_indexing(&deployment_id, &indexer, block.clone());
+        let poi = match futures::executor::block_on(poi_fut) {
+            Ok(Some(poi)) => r::Value::String(format!("0x{}", hex::encode(&poi))),
+            Ok(None) => r::Value::Null,
+            Err(e) => {
+                error!(
+                    self.logger,
+                    "Failed to query proof of indexing";
+                    "subgraph" => deployment_id,
+                    "block" => format!("{}", block),
+                    "error" => format!("{:?}", e)
+                );
+                r::Value::Null
+            }
+        };
+
+        Ok(poi)
+    }
+
+    fn resolve_public_proofs_of_indexing(
+        &self,
+        field: &a::Field,
+    ) -> Result<r::Value, QueryExecutionError> {
+        let requests = field
+            .get_required::<Vec<PublicProofOfIndexingRequest>>("requests")
+            .expect("valid requests required, validation should have caught this");
+
+        // Only 10 requests are allowed at a time to avoid generating too many SQL queries;
+        // NOTE: Indexers should rate limit the status API anyway, but this adds some soft
+        // extra protection
+        if requests.len() > 10 {
+            return Err(QueryExecutionError::TooExpensive);
+        }
+
+        Ok(r::Value::List(
+            requests
+                .into_iter()
+                .map(|request| {
+                    match futures::executor::block_on(
+                        self.store.get_public_proof_of_indexing(
+                            &request.deployment,
+                            request.block_number,
+                        ),
+                    ) {
+                        Ok(Some(poi)) => (Some(poi), request),
+                        Ok(None) => (None, request),
+                        Err(e) => {
+                            error!(
+                                self.logger,
+                                "Failed to query public proof of indexing";
+                                "subgraph" => &request.deployment,
+                                "block" => format!("{}", request.block_number),
+                                "error" => format!("{:?}", e)
+                            );
+                            (None, request)
+                        }
+                    }
+                })
+                .map(|(poi_result, request)| PublicProofOfIndexingResult {
+                    deployment: request.deployment,
+                    block: match poi_result {
+                        Some((ref block, _)) => block.clone(),
+                        None => PartialBlockPtr::from(request.block_number),
+                    },
+                    proof_of_indexing: match poi_result {
+                        Some((_, poi)) => Some(poi),
+                        None => None,
+                    },
+                })
+                .map(IntoValue::into_value)
+                .collect(),
+        ))
+    }
+
+    fn resolve_indexing_status_for_version(
+        &self,
+        field: &a::Field,
+
+        // If `true` return the current version, if `false` return the pending version.
+        current_version: bool,
+    ) -> Result<r::Value, QueryExecutionError> {
+        // We can safely unwrap because the argument is non-nullable and has been validated.
+        let subgraph_name = field.get_required::<String>("subgraphName").unwrap();
+
+        debug!(
+            self.logger,
+            "Resolve indexing status for subgraph name";
+            "name" => &subgraph_name,
+            "current_version" => current_version,
+        );
+
+        let infos = self.store.status(status::Filter::SubgraphVersion(
+            subgraph_name,
+            current_version,
+        ))?;
+
+        Ok(infos
+            .into_iter()
+            .next()
+            .map(|info| info.into_value())
+            .unwrap_or(r::Value::Null))
+    }
+
+    async fn resolve_subgraph_features(
+        &self,
+        field: &a::Field,
+    ) -> Result<r::Value, QueryExecutionError> {
+        // We can safely unwrap because the argument is non-nullable and has been validated.
+        let subgraph_id = field.get_required::<String>("subgraphId").unwrap();
+
+        // TODO:
+        //
+        // An interesting optimization would involve trying to get the subgraph manifest from the
+        // SubgraphStore before hitting IPFS, but we must fix a dependency cycle between the `graph`
+        // and `server` crates first.
+        //
+        // 1. implement a new method in subgraph store to retrieve the SubgraphManifest of a given deployment id
+        // 2. try to fetch this subgraph from our SubgraphStore before hitting IPFS
+
+        // Try to build a deployment hash with the input string
+        let deployment_hash = DeploymentHash::new(subgraph_id).map_err(|invalid_qm_hash| {
+            QueryExecutionError::SubgraphDeploymentIdError(invalid_qm_hash)
+        })?;
+
+        let ValidationPostProcessResult {
+            features,
+            errors,
+            network,
+        } = {
+            let raw: serde_yaml::Mapping = {
+                let file_bytes = self
+                    .link_resolver
+                    .cat(&self.logger, &deployment_hash.to_ipfs_link())
+                    .await
+                    .map_err(SubgraphManifestResolveError::ResolveError)?;
+
+                serde_yaml::from_slice(&file_bytes)
+                    .map_err(SubgraphManifestResolveError::ParseError)?
+            };
+
+            let kind = BlockchainKind::from_manifest(&raw)
+                .map_err(SubgraphManifestResolveError::ResolveError)?;
+            match kind {
+                BlockchainKind::Ethereum => {
+                    let unvalidated_subgraph_manifest =
+                        UnvalidatedSubgraphManifest::<graph_chain_ethereum::Chain>::resolve(
+                            deployment_hash,
+                            raw,
+                            &self.link_resolver,
+                            &self.logger,
+                            ENV_VARS.max_spec_version.clone(),
+                        )
+                        .await?;
+
+                    validate_and_extract_features(
+                        &self.store.subgraph_store(),
+                        unvalidated_subgraph_manifest,
+                    )
+                    .await?
+                }
+
+                BlockchainKind::Cosmos => {
+                    let unvalidated_subgraph_manifest =
+                        UnvalidatedSubgraphManifest::<graph_chain_cosmos::Chain>::resolve(
+                            deployment_hash,
+                            raw,
+                            &self.link_resolver,
+                            &self.logger,
+                            ENV_VARS.max_spec_version.clone(),
+                        )
+                        .await?;
+
+                    validate_and_extract_features(
+                        &self.store.subgraph_store(),
+                        unvalidated_subgraph_manifest,
+                    )
+                    .await?
+                }
+
+                BlockchainKind::Near => {
+                    let unvalidated_subgraph_manifest =
+                        UnvalidatedSubgraphManifest::<graph_chain_near::Chain>::resolve(
+                            deployment_hash,
+                            raw,
+                            &self.link_resolver,
+                            &self.logger,
+                            ENV_VARS.max_spec_version.clone(),
+                        )
+                        .await?;
+
+                    validate_and_extract_features(
+                        &self.store.subgraph_store(),
+                        unvalidated_subgraph_manifest,
+                    )
+                    .await?
+                }
+
+                BlockchainKind::Arweave => {
+                    let unvalidated_subgraph_manifest =
+                        UnvalidatedSubgraphManifest::<graph_chain_arweave::Chain>::resolve(
+                            deployment_hash,
+                            raw,
+                            &self.link_resolver,
+                            &self.logger,
+                            ENV_VARS.max_spec_version.clone(),
+                        )
+                        .await?;
+
+                    validate_and_extract_features(
+                        &self.store.subgraph_store(),
+                        unvalidated_subgraph_manifest,
+                    )
+                    .await?
+                }
+                // TODO(filipe): Kick this can down the road!
+                BlockchainKind::Substreams => unimplemented!(),
+            }
+        };
+
+        // We then bulid a GraphqQL `Object` value that contains the feature detection and
+        // validation results and send it back as a response.
+        let response = [
+            ("features".to_string(), features),
+            ("errors".to_string(), errors),
+            ("network".to_string(), network),
+        ];
+        let response = Object::from_iter(response);
+
+        Ok(r::Value::Object(response))
+    }
+
+    fn resolve_api_versions(&self, _field: &a::Field) -> Result<r::Value, QueryExecutionError> {
+        Ok(r::Value::List(
+            VERSIONS
+                .iter()
+                .map(|version| {
+                    r::Value::Object(Object::from_iter(vec![(
+                        "version".to_string(),
+                        r::Value::String(version.to_string()),
+                    )]))
+                })
+                .collect(),
+        ))
+    }
+}
+
+struct ValidationPostProcessResult {
+    features: r::Value,
+    errors: r::Value,
+    network: r::Value,
+}
+
+async fn validate_and_extract_features<C, SgStore>(
+    subgraph_store: &Arc<SgStore>,
+    unvalidated_subgraph_manifest: UnvalidatedSubgraphManifest<C>,
+) -> Result<ValidationPostProcessResult, QueryExecutionError>
+where
+    C: Blockchain,
+    SgStore: SubgraphStore,
+{
+    // Validate the subgraph we've just obtained.
+    //
+    // Note that feature valiadation errors will be inside the error variant vector (because
+    // `validate` also validates subgraph features), so we must filter them out to build our
+    // response.
+    let subgraph_validation: Either<_, _> = match unvalidated_subgraph_manifest
+        .validate(subgraph_store.clone(), false)
+        .await
+    {
+        Ok(subgraph_manifest) => Either::Left(subgraph_manifest),
+        Err(validation_errors) => {
+            // We must ensure that all the errors are of the `FeatureValidationError`
+            // variant and that there is at least one error of that kind.
+            let feature_validation_errors: Vec<_> = validation_errors
+                .into_iter()
+                .filter(|error| {
+                    matches!(
+                        error,
+                        SubgraphManifestValidationError::FeatureValidationError(_)
+                    )
+                })
+                .collect();
+
+            if !feature_validation_errors.is_empty() {
+                Either::Right(feature_validation_errors)
+            } else {
+                // If other error variants are present or there are no feature validation
+                // errors, we must return early with an error.
+                //
+                // It might be useful to return a more thoughtful error, but that is not the
+                // purpose of this endpoint.
+                return Err(QueryExecutionError::InvalidSubgraphManifest);
+            }
+        }
+    };
+
+    // At this point, we have either:
+    // 1. A valid subgraph manifest with no errors.
+    // 2. No subgraph manifest and a set of feature validation errors.
+    //
+    // For this step we must collect whichever results we have into GraphQL `Value` types.
+    match subgraph_validation {
+        Either::Left(subgraph_manifest) => {
+            let features = r::Value::List(
+                detect_features(&subgraph_manifest)
+                    .map_err(|_| QueryExecutionError::InvalidSubgraphManifest)?
+                    .iter()
+                    .map(ToString::to_string)
+                    .map(r::Value::String)
+                    .collect(),
+            );
+            let errors = r::Value::List(vec![]);
+            let network = r::Value::String(subgraph_manifest.network_name());
+
+            Ok(ValidationPostProcessResult {
+                features,
+                errors,
+                network,
+            })
+        }
+        Either::Right(errors) => {
+            let features = r::Value::List(vec![]);
+            let errors = r::Value::List(
+                errors
+                    .iter()
+                    .map(ToString::to_string)
+                    .map(r::Value::String)
+                    .collect(),
+            );
+            let network = r::Value::Null;
+            Ok(ValidationPostProcessResult {
+                features,
+                errors,
+                network,
+            })
+        }
+    }
+}
+
+fn entity_changes_to_graphql(entity_changes: Vec<EntityOperation>) -> r::Value {
+    // Results are sorted first alphabetically by entity type, then by entity
+    // ID, and then aphabetically by field name.
+
+    // First, we isolate updates and deletions with the same entity type.
+    let mut updates: BTreeMap<EntityType, Vec<Entity>> = BTreeMap::new();
+    let mut deletions: BTreeMap<EntityType, Vec<Word>> = BTreeMap::new();
+
+    for change in entity_changes {
+        match change {
+            EntityOperation::Remove { key } => {
+                deletions
+                    .entry(key.entity_type)
+                    .or_default()
+                    .push(key.entity_id);
+            }
+            EntityOperation::Set { key, data } => {
+                updates.entry(key.entity_type).or_default().push(data);
+            }
+        }
+    }
+
+    // Now we're ready for GraphQL type conversions.
+    let mut updates_graphql: Vec<r::Value> = Vec::with_capacity(updates.len());
+    let mut deletions_graphql: Vec<r::Value> = Vec::with_capacity(deletions.len());
+
+    for (entity_type, mut entities) in updates {
+        entities.sort_unstable_by_key(|e| e.id().unwrap_or("no-id".to_string()));
+        updates_graphql.push(object! {
+            type: entity_type.to_string(),
+            entities:
+                entities
+                    .into_iter()
+                    .map(|e| {
+                        r::Value::object(
+                            e.sorted()
+                                .into_iter()
+                                .map(|(name, value)| (name.into(), value.into()))
+                                .collect(),
+                        )
+                    })
+                    .collect::<Vec<r::Value>>(),
+        });
+    }
+
+    for (entity_type, mut ids) in deletions {
+        ids.sort_unstable();
+        deletions_graphql.push(object! {
+            type: entity_type.to_string(),
+            entities:
+                ids.into_iter().map(|s| s.to_string()).map(r::Value::String).collect::<Vec<r::Value>>(),
+        });
+    }
+
+    object! {
+        updates: updates_graphql,
+        deletions: deletions_graphql,
+    }
+}
+
+#[async_trait]
+impl<S: Store> Resolver for IndexNodeResolver<S> {
+    const CACHEABLE: bool = false;
+
+    async fn query_permit(&self) -> Result<tokio::sync::OwnedSemaphorePermit, QueryExecutionError> {
+        self.store.query_permit().await.map_err(Into::into)
+    }
+
+    fn prefetch(
+        &self,
+        _: &ExecutionContext<Self>,
+        _: &a::SelectionSet,
+    ) -> Result<(Option<r::Value>, Trace), Vec<QueryExecutionError>> {
+        Ok((None, Trace::None))
+    }
+
+    /// Resolves a scalar value for a given scalar type.
+    async fn resolve_scalar_value(
+        &self,
+        parent_object_type: &s::ObjectType,
+        field: &a::Field,
+        scalar_type: &s::ScalarType,
+        value: Option<r::Value>,
+    ) -> Result<r::Value, QueryExecutionError> {
+        match (
+            parent_object_type.name.as_str(),
+            field.name.as_str(),
+            scalar_type.name.as_str(),
+        ) {
+            ("Query", "proofOfIndexing", "Bytes") => self.resolve_proof_of_indexing(field),
+            ("Query", "blockData", "JSONObject") => self.resolve_block_data(field),
+            ("Query", "blockHashFromNumber", "Bytes") => {
+                self.resolve_block_hash_from_number(field).await
+            }
+
+            // Fallback to the same as is in the default trait implementation. There
+            // is no way to call back into the default implementation for the trait.
+            // So, note that this is duplicated.
+            // See also c2112309-44fd-4a84-92a0-5a651e6ed548
+            _ => Ok(value.unwrap_or(r::Value::Null)),
+        }
+    }
+
+    async fn resolve_objects(
+        &self,
+        prefetched_objects: Option<r::Value>,
+        field: &a::Field,
+        _field_definition: &s::Field,
+        object_type: ObjectOrInterface<'_>,
+    ) -> Result<r::Value, QueryExecutionError> {
+        // Resolves the `field.name` top-level field.
+        match (prefetched_objects, object_type.name(), field.name.as_str()) {
+            (None, "SubgraphIndexingStatus", "indexingStatuses") => {
+                self.resolve_indexing_statuses(field)
+            }
+            (None, "SubgraphIndexingStatus", "indexingStatusesForSubgraphName") => {
+                self.resolve_indexing_statuses_for_subgraph_name(field)
+            }
+            (None, "CachedEthereumCall", "cachedEthereumCalls") => {
+                self.resolve_cached_ethereum_calls(field).await
+            }
+
+            // The top-level `publicProofsOfIndexing` field
+            (None, "PublicProofOfIndexingResult", "publicProofsOfIndexing") => {
+                self.resolve_public_proofs_of_indexing(field)
+            }
+
+            // Resolve fields of `Object` values (e.g. the `chains` field of `ChainIndexingStatus`)
+            (value, _, _) => Ok(value.unwrap_or(r::Value::Null)),
+        }
+    }
+
+    async fn resolve_object(
+        &self,
+        prefetched_object: Option<r::Value>,
+        field: &a::Field,
+        _field_definition: &s::Field,
+        _object_type: ObjectOrInterface<'_>,
+    ) -> Result<r::Value, QueryExecutionError> {
+        // Resolves the `field.name` top-level field.
+        match (prefetched_object, field.name.as_str()) {
+            (None, "indexingStatusForCurrentVersion") => {
+                self.resolve_indexing_status_for_version(field, true)
+            }
+            (None, "indexingStatusForPendingVersion") => {
+                self.resolve_indexing_status_for_version(field, false)
+            }
+            (None, "subgraphFeatures") => self.resolve_subgraph_features(field).await,
+            (None, "entityChangesInBlock") => self.resolve_entity_changes_in_block(field),
+            // The top-level `subgraphVersions` field
+            (None, "apiVersions") => self.resolve_api_versions(field),
+
+            // Resolve fields of `Object` values (e.g. the `latestBlock` field of `EthereumBlock`)
+            (value, _) => Ok(value.unwrap_or(r::Value::Null)),
+        }
+    }
+}
diff --git a/server/index-node/src/schema.graphql b/server/index-node/src/schema.graphql
new file mode 100644
index 0000000..e521654
--- /dev/null
+++ b/server/index-node/src/schema.graphql
@@ -0,0 +1,189 @@
+scalar BigInt
+scalar Boolean
+scalar Bytes
+scalar ID
+scalar Int
+scalar String
+
+# An opaque object type. Note that this is equivalent to a JSON object, rather
+# than a generic JSON value; as such it cannot be e.g. a string or an integer.
+scalar JSONObject
+# A string in the format of `YYYY-MM-DD`. This is the standard adopted by
+# RFC3339, which is equivalent to the "ISO 8601 extended format".
+# See also:
+# - https://datatracker.ietf.org/doc/html/rfc3339#section-5.6
+# - https://en.wikipedia.org/wiki/ISO_8601#Calendar_dates
+scalar Date
+
+type Query {
+  indexingStatusForCurrentVersion(subgraphName: String!): SubgraphIndexingStatus
+  indexingStatusForPendingVersion(subgraphName: String!): SubgraphIndexingStatus
+  indexingStatusesForSubgraphName(
+    subgraphName: String!
+  ): [SubgraphIndexingStatus!]!
+  indexingStatuses(subgraphs: [String!]): [SubgraphIndexingStatus!]!
+  proofOfIndexing(
+    subgraph: String!
+    blockNumber: Int!
+    blockHash: Bytes!
+    indexer: Bytes
+  ): Bytes
+  """
+  Proofs of indexing for several deployments and blocks that can be shared and
+  compared in public without revealing the _actual_ proof of indexing that every
+  indexer has in their database
+  """
+  publicProofsOfIndexing(
+    requests: [PublicProofOfIndexingRequest!]!
+  ): [PublicProofOfIndexingResult!]!
+  subgraphFeatures(subgraphId: String!): SubgraphFeatures!
+  entityChangesInBlock(subgraphId: String!, blockNumber: Int!): EntityChanges!
+  blockData(network: String!, blockHash: Bytes!): JSONObject
+  blockHashFromNumber(network: String!, blockNumber: Int!): Bytes
+  cachedEthereumCalls(
+    network: String!
+    blockHash: Bytes!
+  ): [CachedEthereumCall!]
+  apiVersions(subgraphId: String!): [ApiVersion!]!
+}
+
+type SubgraphIndexingStatus {
+  subgraph: String!
+  synced: Boolean!
+
+  # Note that the health can be implied from fatalError and nonFatalErrors:
+  # - If fatalError is non-null, then health is 'failed'.
+  # - Else if nonFatalErrors is non-empty, then health is 'unhealthy'.
+  # - Else health is 'healthy'.
+  health: Health!
+
+  "If the subgraph has failed, this is the error caused it"
+  fatalError: SubgraphError
+
+  "Sorted from first to last, limited to first 1000"
+  nonFatalErrors: [SubgraphError!]!
+  chains: [ChainIndexingStatus!]!
+  entityCount: BigInt!
+  node: String
+}
+
+interface ChainIndexingStatus {
+  network: String!
+  chainHeadBlock: Block
+  earliestBlock: EarliestBlock
+  latestBlock: Block
+  lastHealthyBlock: Block
+}
+
+type EthereumIndexingStatus implements ChainIndexingStatus {
+  network: String!
+  chainHeadBlock: Block
+  earliestBlock: EarliestBlock
+  latestBlock: Block
+  lastHealthyBlock: Block
+}
+
+type EntityChanges {
+  updates: [EntityTypeUpdates!]!
+  deletions: [EntityTypeDeletions!]!
+}
+
+type EntityTypeUpdates {
+  type: String!
+  entities: [JSONObject!]!
+}
+
+type EntityTypeDeletions {
+  type: String!
+  entities: [ID!]!
+}
+
+type Block {
+  hash: Bytes!
+  number: BigInt!
+}
+
+type EarliestBlock {
+  hash: Bytes! @deprecated(reason: "hash will always be reported as 0x0.")
+  number: BigInt!
+}
+
+type SubgraphError {
+  message: String!
+
+  # Context for the error.
+  block: Block
+  handler: String
+
+  # `true` means we have certainty that the error is deterministic.
+  deterministic: Boolean!
+}
+
+enum Health {
+  "Subgraph syncing normally"
+  healthy
+  "Subgraph syncing but with errors"
+  unhealthy
+  "Subgraph halted due to errors"
+  failed
+}
+
+type CachedEthereumCall {
+  idHash: Bytes!
+  block: Block!
+  contractAddress: Bytes!
+  returnValue: Bytes!
+}
+
+type SubgraphFeatures {
+  features: [Feature!]!
+  errors: [String!]!
+  network: String
+}
+
+enum Feature {
+  nonFatalErrors
+  grafting
+  fullTextSearch
+  ipfsOnEthereumContracts
+}
+
+input BlockInput {
+  hash: Bytes!
+  number: BigInt!
+}
+
+input ProofOfIndexingRequest {
+  deployment: String!
+  block: BlockInput!
+}
+
+input PublicProofOfIndexingRequest {
+  deployment: String!
+  blockNumber: BigInt!
+}
+
+type PartialBlock {
+  hash: Bytes
+  number: BigInt!
+}
+
+type PublicProofOfIndexingResult {
+  deployment: String!
+  block: PartialBlock!
+  proofOfIndexing: Bytes!
+}
+
+type ProofOfIndexingResult {
+  deployment: String!
+  block: Block!
+  "There may not be a proof of indexing available for the deployment and block"
+  proofOfIndexing: Bytes
+}
+
+type ApiVersion {
+  """
+  Version number in SemVer format
+  """
+  version: String!
+}
diff --git a/server/index-node/src/schema.rs b/server/index-node/src/schema.rs
new file mode 100644
index 0000000..13dbc8a
--- /dev/null
+++ b/server/index-node/src/schema.rs
@@ -0,0 +1,19 @@
+use graph::prelude::*;
+
+lazy_static! {
+    pub static ref SCHEMA: Arc<ApiSchema> = {
+        let raw_schema = include_str!("./schema.graphql");
+        let document = graphql_parser::parse_schema(&raw_schema).unwrap();
+        Arc::new(
+            ApiSchema::from_api_schema(
+                Schema::new(DeploymentHash::new("indexnode").unwrap(), document).unwrap(),
+            )
+            .unwrap(),
+        )
+    };
+}
+
+#[test]
+fn schema_parses() {
+    let _ = &*SCHEMA;
+}
diff --git a/server/index-node/src/server.rs b/server/index-node/src/server.rs
new file mode 100644
index 0000000..ec65dee
--- /dev/null
+++ b/server/index-node/src/server.rs
@@ -0,0 +1,101 @@
+use hyper;
+use hyper::service::make_service_fn;
+use hyper::Server;
+use std::net::{Ipv4Addr, SocketAddrV4};
+
+use graph::{
+    blockchain::BlockchainMap,
+    components::store::Store,
+    prelude::{IndexNodeServer as IndexNodeServerTrait, *},
+};
+
+use crate::service::IndexNodeService;
+use thiserror::Error;
+
+/// Errors that may occur when starting the server.
+#[derive(Debug, Error)]
+pub enum IndexNodeServeError {
+    #[error("Bind error: {0}")]
+    BindError(#[from] hyper::Error),
+}
+
+/// A GraphQL server based on Hyper.
+pub struct IndexNodeServer<Q, S> {
+    logger: Logger,
+    blockchain_map: Arc<BlockchainMap>,
+    graphql_runner: Arc<Q>,
+    store: Arc<S>,
+    link_resolver: Arc<dyn LinkResolver>,
+}
+
+impl<Q, S> IndexNodeServer<Q, S> {
+    /// Creates a new GraphQL server.
+    pub fn new(
+        logger_factory: &LoggerFactory,
+        blockchain_map: Arc<BlockchainMap>,
+        graphql_runner: Arc<Q>,
+        store: Arc<S>,
+        link_resolver: Arc<dyn LinkResolver>,
+    ) -> Self {
+        let logger = logger_factory.component_logger(
+            "IndexNodeServer",
+            Some(ComponentLoggerConfig {
+                elastic: Some(ElasticComponentLoggerConfig {
+                    index: String::from("index-node-server-logs"),
+                }),
+            }),
+        );
+
+        IndexNodeServer {
+            logger,
+            blockchain_map,
+            graphql_runner,
+            store,
+            link_resolver,
+        }
+    }
+}
+
+impl<Q, S> IndexNodeServerTrait for IndexNodeServer<Q, S>
+where
+    Q: GraphQlRunner,
+    S: Store,
+{
+    type ServeError = IndexNodeServeError;
+
+    fn serve(
+        &mut self,
+        port: u16,
+    ) -> Result<Box<dyn Future<Item = (), Error = ()> + Send>, Self::ServeError> {
+        let logger = self.logger.clone();
+
+        info!(
+            logger,
+            "Starting index node server at: http://localhost:{}", port
+        );
+
+        let addr = SocketAddrV4::new(Ipv4Addr::new(0, 0, 0, 0), port);
+
+        // On every incoming request, launch a new GraphQL service that writes
+        // incoming queries to the query sink.
+        let logger_for_service = self.logger.clone();
+        let graphql_runner = self.graphql_runner.clone();
+        let store = self.store.clone();
+        let service = IndexNodeService::new(
+            logger_for_service.clone(),
+            self.blockchain_map.clone(),
+            graphql_runner.clone(),
+            store.clone(),
+            self.link_resolver.clone(),
+        );
+        let new_service =
+            make_service_fn(move |_| futures03::future::ok::<_, Error>(service.clone()));
+
+        // Create a task to run the server and handle HTTP requests
+        let task = Server::try_bind(&addr.into())?
+            .serve(new_service)
+            .map_err(move |e| error!(logger, "Server error"; "error" => format!("{}", e)));
+
+        Ok(Box::new(task.compat()))
+    }
+}
diff --git a/server/index-node/src/service.rs b/server/index-node/src/service.rs
new file mode 100644
index 0000000..81ae88d
--- /dev/null
+++ b/server/index-node/src/service.rs
@@ -0,0 +1,487 @@
+use graph::blockchain::BlockchainMap;
+use http::header::{
+    self, ACCESS_CONTROL_ALLOW_HEADERS, ACCESS_CONTROL_ALLOW_METHODS, ACCESS_CONTROL_ALLOW_ORIGIN,
+    CONTENT_TYPE, LOCATION,
+};
+use hyper::body::Bytes;
+use hyper::service::Service;
+use hyper::{Body, Method, Request, Response, StatusCode};
+use serde_json;
+use std::task::Context;
+use std::task::Poll;
+
+use graph::components::{server::query::GraphQLServerError, store::Store};
+use graph::data::query::QueryResults;
+use graph::prelude::*;
+use graph_graphql::prelude::{execute_query, Query as PreparedQuery, QueryExecutionOptions};
+use graphql_parser;
+
+use crate::auth::bearer_token;
+
+use crate::explorer::Explorer;
+use crate::resolver::IndexNodeResolver;
+use crate::schema::SCHEMA;
+
+struct NoopGraphQLMetrics;
+
+impl GraphQLMetrics for NoopGraphQLMetrics {
+    fn observe_query_execution(&self, _duration: Duration, _results: &QueryResults) {}
+    fn observe_query_parsing(&self, _duration: Duration, _results: &QueryResults) {}
+    fn observe_query_validation(&self, _duration: Duration, _id: &DeploymentHash) {}
+}
+
+/// An asynchronous response to a GraphQL request.
+pub type IndexNodeServiceResponse = DynTryFuture<'static, Response<Body>, GraphQLServerError>;
+
+/// A Hyper Service that serves GraphQL over a POST / endpoint.
+#[derive(Debug)]
+pub struct IndexNodeService<Q, S> {
+    logger: Logger,
+    blockchain_map: Arc<BlockchainMap>,
+    graphql_runner: Arc<Q>,
+    store: Arc<S>,
+    explorer: Arc<Explorer<S>>,
+    link_resolver: Arc<dyn LinkResolver>,
+}
+
+impl<Q, S> Clone for IndexNodeService<Q, S> {
+    fn clone(&self) -> Self {
+        Self {
+            logger: self.logger.clone(),
+            blockchain_map: self.blockchain_map.clone(),
+            graphql_runner: self.graphql_runner.clone(),
+            store: self.store.clone(),
+            explorer: self.explorer.clone(),
+            link_resolver: self.link_resolver.clone(),
+        }
+    }
+}
+
+impl<Q, S> CheapClone for IndexNodeService<Q, S> {}
+
+impl<Q, S> IndexNodeService<Q, S>
+where
+    Q: GraphQlRunner,
+    S: Store,
+{
+    /// Creates a new GraphQL service.
+    pub fn new(
+        logger: Logger,
+        blockchain_map: Arc<BlockchainMap>,
+        graphql_runner: Arc<Q>,
+        store: Arc<S>,
+        link_resolver: Arc<dyn LinkResolver>,
+    ) -> Self {
+        let explorer = Arc::new(Explorer::new(store.clone()));
+
+        IndexNodeService {
+            logger,
+            blockchain_map,
+            graphql_runner,
+            store,
+            explorer,
+            link_resolver,
+        }
+    }
+
+    fn graphiql_html() -> &'static str {
+        include_str!("../assets/index.html")
+    }
+
+    /// Serves a static file.
+    fn serve_file(contents: &'static str, content_type: &'static str) -> Response<Body> {
+        Response::builder()
+            .header(ACCESS_CONTROL_ALLOW_ORIGIN, "*")
+            .header(CONTENT_TYPE, content_type)
+            .status(200)
+            .body(Body::from(contents))
+            .unwrap()
+    }
+
+    fn index() -> Response<Body> {
+        Response::builder()
+            .status(200)
+            .header(ACCESS_CONTROL_ALLOW_ORIGIN, "*")
+            .header(CONTENT_TYPE, "text/html")
+            .body(Body::from("OK"))
+            .unwrap()
+    }
+
+    fn handle_graphiql() -> Response<Body> {
+        Self::serve_file(Self::graphiql_html(), "text/html")
+    }
+
+    async fn handle_graphql_query(
+        &self,
+        request: Request<Body>,
+    ) -> Result<Response<Body>, GraphQLServerError> {
+        let (req_parts, req_body) = request.into_parts();
+        let store = self.store.clone();
+
+        // Obtain the schema for the index node GraphQL API
+        let schema = SCHEMA.clone();
+
+        let body = hyper::body::to_bytes(req_body)
+            .map_err(|_| GraphQLServerError::InternalError("Failed to read request body".into()))
+            .await?;
+
+        let validated = ValidatedRequest::new(body, &req_parts.headers)?;
+        let query = validated.query;
+
+        let query = match PreparedQuery::new(
+            &self.logger,
+            schema,
+            None,
+            query,
+            None,
+            100,
+            Arc::new(NoopGraphQLMetrics),
+        ) {
+            Ok(query) => query,
+            Err(e) => return Ok(QueryResults::from(QueryResult::from(e)).as_http_response()),
+        };
+
+        let load_manager = self.graphql_runner.load_manager();
+
+        // Run the query using the index node resolver
+        let query_clone = query.cheap_clone();
+        let logger = self.logger.cheap_clone();
+        let result = {
+            let resolver = IndexNodeResolver::new(
+                &logger,
+                store,
+                self.link_resolver.clone(),
+                validated.bearer_token,
+                self.blockchain_map.clone(),
+            );
+            let options = QueryExecutionOptions {
+                resolver,
+                deadline: None,
+                max_first: std::u32::MAX,
+                max_skip: std::u32::MAX,
+                load_manager,
+            };
+            let result = execute_query(query_clone.cheap_clone(), None, None, options).await;
+            query_clone.log_execution(0);
+            QueryResult::from(
+                // Index status queries are not cacheable, so we may unwrap this.
+                Arc::try_unwrap(result).unwrap(),
+            )
+        };
+
+        Ok(QueryResults::from(result).as_http_response())
+    }
+
+    // Handles OPTIONS requests
+    fn handle_graphql_options(_request: Request<Body>) -> Response<Body> {
+        Response::builder()
+            .status(200)
+            .header(ACCESS_CONTROL_ALLOW_ORIGIN, "*")
+            .header(CONTENT_TYPE, "text/plain")
+            .header(ACCESS_CONTROL_ALLOW_HEADERS, "Content-Type, User-Agent")
+            .header(ACCESS_CONTROL_ALLOW_METHODS, "GET, OPTIONS, POST")
+            .body(Body::from(""))
+            .unwrap()
+    }
+
+    /// Handles 302 redirects
+    fn handle_temp_redirect(destination: &str) -> Result<Response<Body>, GraphQLServerError> {
+        header::HeaderValue::from_str(destination)
+            .map_err(|_| {
+                GraphQLServerError::ClientError("invalid characters in redirect URL".into())
+            })
+            .map(|loc_header_val| {
+                Response::builder()
+                    .status(StatusCode::FOUND)
+                    .header(ACCESS_CONTROL_ALLOW_ORIGIN, "*")
+                    .header(CONTENT_TYPE, "text/plain")
+                    .header(LOCATION, loc_header_val)
+                    .body(Body::from("Redirecting..."))
+                    .unwrap()
+            })
+    }
+
+    /// Handles 404s.
+    pub(crate) fn handle_not_found() -> Response<Body> {
+        Response::builder()
+            .status(StatusCode::NOT_FOUND)
+            .header(ACCESS_CONTROL_ALLOW_ORIGIN, "*")
+            .header(CONTENT_TYPE, "text/plain")
+            .body(Body::from("Not found\n"))
+            .unwrap()
+    }
+
+    async fn handle_call(self, req: Request<Body>) -> Result<Response<Body>, GraphQLServerError> {
+        let method = req.method().clone();
+
+        let path = req.uri().path().to_owned();
+        let path_segments = {
+            let mut segments = path.split('/');
+
+            // Remove leading '/'
+            assert_eq!(segments.next(), Some(""));
+
+            segments.collect::<Vec<_>>()
+        };
+
+        match (method, path_segments.as_slice()) {
+            (Method::GET, [""]) => Ok(Self::index()),
+            (Method::GET, ["graphiql.css"]) => Ok(Self::serve_file(
+                include_str!("../assets/graphiql.css"),
+                "text/css",
+            )),
+            (Method::GET, ["graphiql.min.js"]) => Ok(Self::serve_file(
+                include_str!("../assets/graphiql.min.js"),
+                "text/javascript",
+            )),
+
+            (Method::GET, path @ ["graphql"]) => {
+                let dest = format!("/{}/playground", path.join("/"));
+                Self::handle_temp_redirect(&dest)
+            }
+            (Method::GET, ["graphql", "playground"]) => Ok(Self::handle_graphiql()),
+
+            (Method::POST, ["graphql"]) => self.handle_graphql_query(req).await,
+            (Method::OPTIONS, ["graphql"]) => Ok(Self::handle_graphql_options(req)),
+
+            (Method::GET, ["explorer", rest @ ..]) => self.explorer.handle(&self.logger, rest),
+
+            _ => Ok(Self::handle_not_found()),
+        }
+    }
+}
+
+impl<Q, S> Service<Request<Body>> for IndexNodeService<Q, S>
+where
+    Q: GraphQlRunner,
+    S: Store,
+{
+    type Response = Response<Body>;
+    type Error = GraphQLServerError;
+    type Future = IndexNodeServiceResponse;
+
+    fn poll_ready(&mut self, _: &mut Context<'_>) -> Poll<Result<(), Self::Error>> {
+        Poll::Ready(Ok(()))
+    }
+
+    fn call(&mut self, req: Request<Body>) -> Self::Future {
+        let logger = self.logger.clone();
+
+        // Returning Err here will prevent the client from receiving any response.
+        // Instead, we generate a Response with an error code and return Ok
+        Box::pin(
+            self.cheap_clone()
+                .handle_call(req)
+                .map(move |result| match result {
+                    Ok(response) => Ok(response),
+                    Err(err @ GraphQLServerError::ClientError(_)) => {
+                        debug!(logger, "IndexNodeService call failed: {}", err);
+
+                        Ok(Response::builder()
+                            .status(400)
+                            .header(CONTENT_TYPE, "text/plain")
+                            .header(ACCESS_CONTROL_ALLOW_ORIGIN, "*")
+                            .body(Body::from(format!("Invalid request: {}", err)))
+                            .unwrap())
+                    }
+                    Err(err @ GraphQLServerError::QueryError(_)) => {
+                        error!(logger, "IndexNodeService call failed: {}", err);
+
+                        Ok(Response::builder()
+                            .status(400)
+                            .header(CONTENT_TYPE, "text/plain")
+                            .header(ACCESS_CONTROL_ALLOW_ORIGIN, "*")
+                            .body(Body::from(format!("Query error: {}", err)))
+                            .unwrap())
+                    }
+                    Err(err @ GraphQLServerError::InternalError(_)) => {
+                        error!(logger, "IndexNodeService call failed: {}", err);
+
+                        Ok(Response::builder()
+                            .status(500)
+                            .header(CONTENT_TYPE, "text/plain")
+                            .header(ACCESS_CONTROL_ALLOW_ORIGIN, "*")
+                            .body(Body::from(format!("Internal server error: {}", err)))
+                            .unwrap())
+                    }
+                }),
+        )
+    }
+}
+
+struct ValidatedRequest {
+    pub query: Query,
+    pub bearer_token: Option<String>,
+}
+
+impl ValidatedRequest {
+    pub fn new(req_body: Bytes, headers: &hyper::HeaderMap) -> Result<Self, GraphQLServerError> {
+        // Parse request body as JSON
+        let json: serde_json::Value = serde_json::from_slice(&req_body)
+            .map_err(|e| GraphQLServerError::ClientError(format!("{}", e)))?;
+
+        // Ensure the JSON data is an object
+        let obj = json.as_object().ok_or_else(|| {
+            GraphQLServerError::ClientError(String::from("ValidatedRequest data is not an object"))
+        })?;
+
+        // Ensure the JSON data has a "query" field
+        let query_value = obj.get("query").ok_or_else(|| {
+            GraphQLServerError::ClientError(String::from(
+                "The \"query\" field is missing in request data",
+            ))
+        })?;
+
+        // Ensure the "query" field is a string
+        let query_string = query_value.as_str().ok_or_else(|| {
+            GraphQLServerError::ClientError(String::from("The\"query\" field is not a string"))
+        })?;
+
+        // Parse the "query" field of the JSON body
+        let document = graphql_parser::parse_query(query_string)
+            .map_err(|e| GraphQLServerError::from(QueryError::ParseError(Arc::new(e.into()))))?
+            .into_static();
+
+        // Parse the "variables" field of the JSON body, if present
+        let variables = match obj.get("variables") {
+            None | Some(serde_json::Value::Null) => Ok(None),
+            Some(variables @ serde_json::Value::Object(_)) => {
+                serde_json::from_value(variables.clone())
+                    .map_err(|e| GraphQLServerError::ClientError(e.to_string()))
+                    .map(Some)
+            }
+            _ => Err(GraphQLServerError::ClientError(
+                "Invalid query variables provided".to_string(),
+            )),
+        }?;
+
+        let query = Query::new(document, variables);
+        let bearer_token = bearer_token(headers)
+            .map(<[u8]>::to_vec)
+            .map(String::from_utf8)
+            .transpose()
+            .map_err(|_| {
+                GraphQLServerError::ClientError("Bearer token is invalid UTF-8".to_string())
+            })?;
+
+        Ok(Self {
+            query,
+            bearer_token,
+        })
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    use graph::{data::value::Object, prelude::*};
+    use graphql_parser;
+    use hyper::body::Bytes;
+    use hyper::HeaderMap;
+    use std::collections::HashMap;
+
+    use super::{GraphQLServerError, ValidatedRequest};
+
+    fn validate_req(req_body: Bytes) -> Result<Query, GraphQLServerError> {
+        Ok(ValidatedRequest::new(req_body, &HeaderMap::new())?.query)
+    }
+
+    #[test]
+    fn rejects_invalid_json() {
+        let request = validate_req(Bytes::from("!@#)%"));
+        request.expect_err("Should reject invalid JSON");
+    }
+
+    #[test]
+    fn rejects_json_without_query_field() {
+        let request = validate_req(Bytes::from("{}"));
+        request.expect_err("Should reject JSON without query field");
+    }
+
+    #[test]
+    fn rejects_json_with_non_string_query_field() {
+        let request = validate_req(Bytes::from("{\"query\": 5}"));
+        request.expect_err("Should reject JSON with a non-string query field");
+    }
+
+    #[test]
+    fn rejects_broken_queries() {
+        let request = validate_req(Bytes::from("{\"query\": \"foo\"}"));
+        request.expect_err("Should reject broken queries");
+    }
+
+    #[test]
+    fn accepts_valid_queries() {
+        let request = validate_req(Bytes::from("{\"query\": \"{ user { name } }\"}"));
+        let query = request.expect("Should accept valid queries");
+        assert_eq!(
+            query.document,
+            graphql_parser::parse_query("{ user { name } }")
+                .unwrap()
+                .into_static()
+        );
+    }
+
+    #[test]
+    fn accepts_null_variables() {
+        let request = validate_req(Bytes::from(
+            "\
+                 {\
+                 \"query\": \"{ user { name } }\", \
+                 \"variables\": null \
+                 }",
+        ));
+        let query = request.expect("Should accept null variables");
+
+        let expected_query = graphql_parser::parse_query("{ user { name } }")
+            .unwrap()
+            .into_static();
+        assert_eq!(query.document, expected_query);
+        assert_eq!(query.variables, None);
+    }
+
+    #[test]
+    fn rejects_non_map_variables() {
+        let request = validate_req(Bytes::from(
+            "\
+                 {\
+                 \"query\": \"{ user { name } }\", \
+                 \"variables\": 5 \
+                 }",
+        ));
+        request.expect_err("Should reject non-map variables");
+    }
+
+    #[test]
+    fn parses_variables() {
+        let request = validate_req(Bytes::from(
+            "\
+                 {\
+                 \"query\": \"{ user { name } }\", \
+                 \"variables\": { \
+                 \"string\": \"s\", \"map\": {\"k\": \"v\"}, \"int\": 5 \
+                 } \
+                 }",
+        ));
+        let query = request.expect("Should accept valid queries");
+
+        let expected_query = graphql_parser::parse_query("{ user { name } }")
+            .unwrap()
+            .into_static();
+        let expected_variables = QueryVariables::new(HashMap::from_iter(
+            vec![
+                (String::from("string"), r::Value::String(String::from("s"))),
+                (
+                    String::from("map"),
+                    r::Value::Object(Object::from_iter(
+                        vec![(String::from("k"), r::Value::String(String::from("v")))].into_iter(),
+                    )),
+                ),
+                (String::from("int"), r::Value::Int(5)),
+            ]
+            .into_iter(),
+        ));
+
+        assert_eq!(query.document, expected_query);
+        assert_eq!(query.variables, Some(expected_variables));
+    }
+}
diff --git a/server/json-rpc/Cargo.toml b/server/json-rpc/Cargo.toml
new file mode 100644
index 0000000..7e7e4d9
--- /dev/null
+++ b/server/json-rpc/Cargo.toml
@@ -0,0 +1,9 @@
+[package]
+name = "graph-server-json-rpc"
+version = "0.27.0"
+edition = "2021"
+
+[dependencies]
+graph = { path = "../../graph" }
+jsonrpsee = { version = "0.15.1", features = ["http-server"] }
+serde = "1.0"
diff --git a/server/json-rpc/src/lib.rs b/server/json-rpc/src/lib.rs
new file mode 100644
index 0000000..c720905
--- /dev/null
+++ b/server/json-rpc/src/lib.rs
@@ -0,0 +1,250 @@
+use graph::prelude::{Value as GraphValue, *};
+use jsonrpsee::core::Error as JsonRpcError;
+use jsonrpsee::http_server::{HttpServerBuilder, HttpServerHandle};
+use jsonrpsee::types::error::CallError;
+use jsonrpsee::types::ErrorObject;
+use jsonrpsee::RpcModule;
+use serde_json::{self, Value as JsonValue};
+
+use std::collections::BTreeMap;
+use std::net::{Ipv4Addr, SocketAddr};
+
+type JsonRpcResult<T> = Result<T, jsonrpsee::core::Error>;
+
+pub struct JsonRpcServer {
+    // TODO: in the future we might want to have some sort of async drop to stop
+    // the server. For now, we're just letting it run it forever.
+    _handle: HttpServerHandle,
+}
+
+impl JsonRpcServer {
+    pub async fn serve<R>(
+        port: u16,
+        http_port: u16,
+        ws_port: u16,
+        registrar: Arc<R>,
+        node_id: NodeId,
+        logger: Logger,
+    ) -> JsonRpcResult<Self>
+    where
+        R: SubgraphRegistrar,
+    {
+        let logger = logger.new(o!("component" => "JsonRpcServer"));
+
+        info!(
+            logger,
+            "Starting JSON-RPC admin server at: http://localhost:{}", port
+        );
+
+        let state = ServerState {
+            registrar,
+            http_port,
+            ws_port,
+            node_id,
+            logger,
+        };
+
+        let socket_addr: SocketAddr = (Ipv4Addr::new(0, 0, 0, 0), port).into();
+        let http_server = HttpServerBuilder::default().build(socket_addr).await?;
+
+        let mut rpc_module = RpcModule::new(state);
+        rpc_module
+            .register_async_method("subgraph_create", |params, state| async move {
+                state.create_handler(params.parse()?).await
+            })
+            .unwrap();
+        rpc_module
+            .register_async_method("subgraph_deploy", |params, state| async move {
+                state.deploy_handler(params.parse()?).await
+            })
+            .unwrap();
+        rpc_module
+            .register_async_method("subgraph_remove", |params, state| async move {
+                state.remove_handler(params.parse()?).await
+            })
+            .unwrap();
+        rpc_module
+            .register_async_method("subgraph_reassign", |params, state| async move {
+                state.reassign_handler(params.parse()?).await
+            })
+            .unwrap();
+
+        let _handle = http_server.start(rpc_module)?;
+        Ok(Self { _handle })
+    }
+}
+
+struct ServerState<R> {
+    registrar: Arc<R>,
+    http_port: u16,
+    ws_port: u16,
+    node_id: NodeId,
+    logger: Logger,
+}
+
+impl<R: SubgraphRegistrar> ServerState<R> {
+    const DEPLOY_ERROR: i64 = 0;
+    const REMOVE_ERROR: i64 = 1;
+    const CREATE_ERROR: i64 = 2;
+    const REASSIGN_ERROR: i64 = 3;
+
+    /// Handler for the `subgraph_create` endpoint.
+    async fn create_handler(&self, params: SubgraphCreateParams) -> JsonRpcResult<JsonValue> {
+        info!(&self.logger, "Received subgraph_create request"; "params" => format!("{:?}", params));
+
+        match self.registrar.create_subgraph(params.name.clone()).await {
+            Ok(result) => {
+                Ok(serde_json::to_value(result).expect("invalid subgraph creation result"))
+            }
+            Err(e) => Err(json_rpc_error(
+                &self.logger,
+                "subgraph_create",
+                e,
+                Self::CREATE_ERROR,
+                params,
+            )),
+        }
+    }
+
+    /// Handler for the `subgraph_deploy` endpoint.
+    async fn deploy_handler(&self, params: SubgraphDeployParams) -> JsonRpcResult<JsonValue> {
+        info!(&self.logger, "Received subgraph_deploy request"; "params" => format!("{:?}", params));
+
+        let node_id = params.node_id.clone().unwrap_or(self.node_id.clone());
+        let routes = subgraph_routes(&params.name, self.http_port, self.ws_port);
+        match self
+            .registrar
+            .create_subgraph_version(
+                params.name.clone(),
+                params.ipfs_hash.clone(),
+                node_id,
+                params.debug_fork.clone(),
+                // Here it doesn't make sense to receive another
+                // startBlock, we'll use the one from the manifest.
+                None,
+                None,
+            )
+            .await
+        {
+            Ok(_) => Ok(routes),
+            Err(e) => Err(json_rpc_error(
+                &self.logger,
+                "subgraph_deploy",
+                e,
+                Self::DEPLOY_ERROR,
+                params,
+            )),
+        }
+    }
+
+    /// Handler for the `subgraph_remove` endpoint.
+    async fn remove_handler(&self, params: SubgraphRemoveParams) -> JsonRpcResult<GraphValue> {
+        info!(&self.logger, "Received subgraph_remove request"; "params" => format!("{:?}", params));
+
+        match self.registrar.remove_subgraph(params.name.clone()).await {
+            Ok(_) => Ok(Value::Null),
+            Err(e) => Err(json_rpc_error(
+                &self.logger,
+                "subgraph_remove",
+                e,
+                Self::REMOVE_ERROR,
+                params,
+            )),
+        }
+    }
+
+    /// Handler for the `subgraph_assign` endpoint.
+    async fn reassign_handler(&self, params: SubgraphReassignParams) -> JsonRpcResult<GraphValue> {
+        info!(&self.logger, "Received subgraph_reassignment request"; "params" => format!("{:?}", params));
+
+        match self
+            .registrar
+            .reassign_subgraph(&params.ipfs_hash, &params.node_id)
+            .await
+        {
+            Ok(_) => Ok(Value::Null),
+            Err(e) => Err(json_rpc_error(
+                &self.logger,
+                "subgraph_reassign",
+                e,
+                Self::REASSIGN_ERROR,
+                params,
+            )),
+        }
+    }
+}
+
+fn json_rpc_error(
+    logger: &Logger,
+    operation: &str,
+    e: SubgraphRegistrarError,
+    code: i64,
+    params: impl std::fmt::Debug,
+) -> JsonRpcError {
+    error!(logger, "{} failed", operation;
+        "error" => format!("{:?}", e),
+        "params" => format!("{:?}", params));
+
+    let message = if let SubgraphRegistrarError::Unknown(_) = e {
+        "internal error".to_owned()
+    } else {
+        e.to_string()
+    };
+
+    JsonRpcError::Call(CallError::Custom(ErrorObject::owned(
+        code as _,
+        message,
+        None::<String>,
+    )))
+}
+
+fn subgraph_routes(name: &SubgraphName, http_port: u16, ws_port: u16) -> JsonValue {
+    let http_base_url = ENV_VARS
+        .external_http_base_url
+        .clone()
+        .unwrap_or_else(|| format!(":{}", http_port));
+    let ws_base_url = ENV_VARS
+        .external_ws_base_url
+        .clone()
+        .unwrap_or_else(|| format!(":{}", ws_port));
+
+    let mut map = BTreeMap::new();
+    map.insert(
+        "playground",
+        format!("{}/subgraphs/name/{}/graphql", http_base_url, name),
+    );
+    map.insert(
+        "queries",
+        format!("{}/subgraphs/name/{}", http_base_url, name),
+    );
+    map.insert(
+        "subscriptions",
+        format!("{}/subgraphs/name/{}", ws_base_url, name),
+    );
+
+    serde_json::to_value(map).expect("invalid subgraph routes")
+}
+
+#[derive(Debug, Deserialize)]
+struct SubgraphCreateParams {
+    name: SubgraphName,
+}
+
+#[derive(Debug, Deserialize)]
+struct SubgraphDeployParams {
+    name: SubgraphName,
+    ipfs_hash: DeploymentHash,
+    node_id: Option<NodeId>,
+    debug_fork: Option<DeploymentHash>,
+}
+
+#[derive(Debug, Deserialize)]
+struct SubgraphRemoveParams {
+    name: SubgraphName,
+}
+
+#[derive(Debug, Deserialize)]
+struct SubgraphReassignParams {
+    ipfs_hash: DeploymentHash,
+    node_id: NodeId,
+}
diff --git a/server/metrics/Cargo.toml b/server/metrics/Cargo.toml
new file mode 100644
index 0000000..8f47abf
--- /dev/null
+++ b/server/metrics/Cargo.toml
@@ -0,0 +1,11 @@
+[package]
+name = "graph-server-metrics"
+version = "0.27.0"
+edition = "2021"
+
+[dependencies]
+graph = { path = "../../graph" }
+http = "0.2"
+hyper = { version = "0.14", features = ["server"] }
+lazy_static = "1.2.0"
+serde = "1.0"
diff --git a/server/metrics/src/lib.rs b/server/metrics/src/lib.rs
new file mode 100644
index 0000000..71d27b8
--- /dev/null
+++ b/server/metrics/src/lib.rs
@@ -0,0 +1,78 @@
+use std::net::{Ipv4Addr, SocketAddrV4};
+use std::sync::Arc;
+
+use anyhow::Error;
+use graph::prometheus::{Encoder, Registry, TextEncoder};
+use hyper::header::{ACCESS_CONTROL_ALLOW_ORIGIN, CONTENT_TYPE};
+use hyper::service::{make_service_fn, service_fn};
+use hyper::{Body, Response, Server};
+use thiserror::Error;
+
+use graph::prelude::{MetricsServer as MetricsServerTrait, *};
+
+/// Errors that may occur when starting the server.
+#[derive(Debug, Error)]
+pub enum PrometheusMetricsServeError {
+    #[error("Bind error: {0}")]
+    BindError(#[from] hyper::Error),
+}
+
+#[derive(Clone)]
+pub struct PrometheusMetricsServer {
+    logger: Logger,
+    registry: Arc<Registry>,
+}
+
+impl PrometheusMetricsServer {
+    pub fn new(logger_factory: &LoggerFactory, registry: Arc<Registry>) -> Self {
+        PrometheusMetricsServer {
+            logger: logger_factory.component_logger("MetricsServer", None),
+            registry,
+        }
+    }
+}
+
+impl MetricsServerTrait for PrometheusMetricsServer {
+    type ServeError = PrometheusMetricsServeError;
+
+    fn serve(
+        &mut self,
+        port: u16,
+    ) -> Result<Box<dyn Future<Item = (), Error = ()> + Send>, Self::ServeError> {
+        let logger = self.logger.clone();
+
+        info!(
+            logger,
+            "Starting metrics server at: http://localhost:{}", port,
+        );
+
+        let addr = SocketAddrV4::new(Ipv4Addr::new(0, 0, 0, 0), port);
+
+        let server = self.clone();
+        let new_service = make_service_fn(move |_req| {
+            let server = server.clone();
+            async move {
+                Ok::<_, Error>(service_fn(move |_| {
+                    let metric_families = server.registry.gather();
+                    let mut buffer = vec![];
+                    let encoder = TextEncoder::new();
+                    encoder.encode(&metric_families, &mut buffer).unwrap();
+                    futures03::future::ok::<_, Error>(
+                        Response::builder()
+                            .status(200)
+                            .header(CONTENT_TYPE, encoder.format_type())
+                            .header(ACCESS_CONTROL_ALLOW_ORIGIN, "*")
+                            .body(Body::from(buffer))
+                            .unwrap(),
+                    )
+                }))
+            }
+        });
+
+        let task = Server::try_bind(&addr.into())?
+            .serve(new_service)
+            .map_err(move |e| error!(logger, "Metrics server error"; "error" => format!("{}", e)));
+
+        Ok(Box::new(task.compat()))
+    }
+}
diff --git a/server/websocket/Cargo.toml b/server/websocket/Cargo.toml
new file mode 100644
index 0000000..cf1f8e8
--- /dev/null
+++ b/server/websocket/Cargo.toml
@@ -0,0 +1,16 @@
+[package]
+name = "graph-server-websocket"
+version = "0.27.0"
+edition = "2021"
+
+[dependencies]
+futures = "0.1.23"
+graph = { path = "../../graph" }
+graphql-parser = "0.4.0"
+http = "0.2"
+lazy_static = "1.2.0"
+serde = "1.0"
+serde_derive = "1.0"
+tokio-tungstenite = "0.14"
+uuid = { version = "0.8.1", features = ["v4"] }
+anyhow = "1.0"
diff --git a/server/websocket/src/connection.rs b/server/websocket/src/connection.rs
new file mode 100644
index 0000000..d3eae1c
--- /dev/null
+++ b/server/websocket/src/connection.rs
@@ -0,0 +1,433 @@
+use futures::sync::mpsc;
+use futures03::stream::SplitStream;
+use graphql_parser::parse_query;
+use http::StatusCode;
+use std::collections::HashMap;
+use tokio::io::{AsyncRead, AsyncWrite};
+use tokio_tungstenite::tungstenite::{Error as WsError, Message as WsMessage};
+use tokio_tungstenite::WebSocketStream;
+use uuid::Uuid;
+
+use graph::{data::query::QueryTarget, prelude::*};
+
+#[derive(Debug, Deserialize, Serialize)]
+#[serde(rename_all = "camelCase")]
+struct StartPayload {
+    query: String,
+    variables: Option<serde_json::Value>,
+    operation_name: Option<String>,
+}
+
+/// GraphQL/WebSocket message received from a client.
+#[derive(Debug, Deserialize)]
+#[serde(tag = "type", rename_all = "snake_case")]
+enum IncomingMessage {
+    ConnectionInit {
+        #[allow(dead_code)]
+        payload: Option<serde_json::Value>,
+    },
+    ConnectionTerminate,
+    Start {
+        id: String,
+        payload: StartPayload,
+    },
+    Stop {
+        id: String,
+    },
+}
+
+impl IncomingMessage {
+    pub fn from_ws_message(msg: WsMessage) -> Result<Self, WsError> {
+        let text = msg.into_text()?;
+        serde_json::from_str(text.as_str()).map_err(|e| {
+            WsError::Http(http::Response::new(Some(format!(
+                "Invalid GraphQL over WebSocket message: {}: {}",
+                text, e
+            ))))
+        })
+    }
+}
+
+/// GraphQL/WebSocket message to be sent to the client.
+#[derive(Debug, Serialize)]
+#[serde(tag = "type", rename_all = "snake_case")]
+enum OutgoingMessage {
+    ConnectionAck,
+    Error {
+        id: String,
+        payload: String,
+    },
+    Data {
+        id: String,
+        payload: Arc<QueryResult>,
+    },
+    Complete {
+        id: String,
+    },
+}
+
+impl OutgoingMessage {
+    pub fn from_query_result(id: String, result: Arc<QueryResult>) -> Self {
+        OutgoingMessage::Data {
+            id,
+            payload: result,
+        }
+    }
+
+    pub fn from_error_string(id: String, s: String) -> Self {
+        OutgoingMessage::Error { id, payload: s }
+    }
+}
+
+impl From<OutgoingMessage> for WsMessage {
+    fn from(msg: OutgoingMessage) -> Self {
+        WsMessage::text(serde_json::to_string(&msg).expect("invalid GraphQL/WebSocket message"))
+    }
+}
+
+/// Helper function to send outgoing messages.
+fn send_message(
+    sink: &mpsc::UnboundedSender<WsMessage>,
+    msg: OutgoingMessage,
+) -> Result<(), WsError> {
+    sink.unbounded_send(msg.into()).map_err(|_| {
+        let mut response = http::Response::new(None);
+        *response.status_mut() = StatusCode::INTERNAL_SERVER_ERROR;
+        WsError::Http(response)
+    })
+}
+
+/// Helper function to send error messages.
+fn send_error_string(
+    sink: &mpsc::UnboundedSender<WsMessage>,
+    operation_id: String,
+    error: String,
+) -> Result<(), WsError> {
+    sink.unbounded_send(OutgoingMessage::from_error_string(operation_id, error).into())
+        .map_err(|_| {
+            let mut response = http::Response::new(None);
+            *response.status_mut() = StatusCode::INTERNAL_SERVER_ERROR;
+            WsError::Http(response)
+        })
+}
+
+/// Responsible for recording operation ids and stopping them.
+/// On drop, cancels all operations.
+struct Operations {
+    operations: HashMap<String, CancelGuard>,
+    msg_sink: mpsc::UnboundedSender<WsMessage>,
+}
+
+impl Operations {
+    fn new(msg_sink: mpsc::UnboundedSender<WsMessage>) -> Self {
+        Self {
+            operations: HashMap::new(),
+            msg_sink,
+        }
+    }
+
+    fn contains(&self, id: &str) -> bool {
+        self.operations.contains_key(id)
+    }
+
+    fn insert(&mut self, id: String, guard: CancelGuard) {
+        self.operations.insert(id, guard);
+    }
+
+    fn stop(&mut self, operation_id: String) -> Result<(), WsError> {
+        // Remove the operation with this ID from the known operations.
+        match self.operations.remove(&operation_id) {
+            Some(stopper) => {
+                // Cancel the subscription result stream.
+                stopper.cancel();
+
+                // Send a GQL_COMPLETE to indicate the operation is been completed.
+                send_message(
+                    &self.msg_sink,
+                    OutgoingMessage::Complete {
+                        id: operation_id.clone(),
+                    },
+                )
+            }
+            None => send_error_string(
+                &self.msg_sink,
+                operation_id.clone(),
+                format!("Unknown operation ID: {}", operation_id),
+            ),
+        }
+    }
+}
+
+impl Drop for Operations {
+    fn drop(&mut self) {
+        let ids = Vec::from_iter(self.operations.keys().cloned());
+        for id in ids {
+            // Discard errors, the connection is being shutdown anyways.
+            let _ = self.stop(id);
+        }
+    }
+}
+
+/// A WebSocket connection implementing the GraphQL over WebSocket protocol.
+pub struct GraphQlConnection<Q, S> {
+    id: String,
+    logger: Logger,
+    graphql_runner: Arc<Q>,
+    stream: WebSocketStream<S>,
+    deployment: DeploymentHash,
+}
+
+impl<Q, S> GraphQlConnection<Q, S>
+where
+    Q: GraphQlRunner,
+    S: AsyncRead + AsyncWrite + Send + 'static + Unpin,
+{
+    /// Creates a new GraphQL subscription service.
+    pub(crate) fn new(
+        logger: &Logger,
+        deployment: DeploymentHash,
+        stream: WebSocketStream<S>,
+        graphql_runner: Arc<Q>,
+    ) -> Self {
+        GraphQlConnection {
+            id: Uuid::new_v4().to_string(),
+            logger: logger.new(o!("component" => "GraphQlConnection")),
+            graphql_runner,
+            stream,
+            deployment,
+        }
+    }
+
+    async fn handle_incoming_messages(
+        mut ws_stream: SplitStream<WebSocketStream<S>>,
+        mut msg_sink: mpsc::UnboundedSender<WsMessage>,
+        logger: Logger,
+        connection_id: String,
+        deployment: DeploymentHash,
+        graphql_runner: Arc<Q>,
+    ) -> Result<(), WsError> {
+        let mut operations = Operations::new(msg_sink.clone());
+
+        // Process incoming messages as long as the WebSocket is open
+        while let Some(ws_msg) = ws_stream.try_next().await? {
+            use self::IncomingMessage::*;
+            use self::OutgoingMessage::*;
+
+            debug!(logger, "Received message";
+                   "connection" => &connection_id,
+                   "msg" => format!("{}", ws_msg).as_str());
+
+            let msg = IncomingMessage::from_ws_message(ws_msg.clone())?;
+
+            debug!(logger, "GraphQL/WebSocket message";
+                   "connection" => &connection_id,
+                   "msg" => format!("{:?}", msg).as_str());
+
+            match msg {
+                // Always accept connection init requests
+                ConnectionInit { payload: _ } => send_message(&msg_sink, ConnectionAck),
+
+                // When receiving a connection termination request
+                ConnectionTerminate => {
+                    // Close the message sink
+                    msg_sink.close().unwrap();
+
+                    // Return an error here to terminate the connection
+                    Err(WsError::ConnectionClosed)
+                }
+
+                // When receiving a stop request
+                Stop { id } => operations.stop(id),
+
+                // When receiving a start request
+                Start { id, payload } => {
+                    // Respond with a GQL_ERROR if we already have an operation with this ID
+                    if operations.contains(&id) {
+                        return send_error_string(
+                            &msg_sink,
+                            id.clone(),
+                            format!("Operation with ID already started: {}", id),
+                        );
+                    }
+
+                    let max_ops = ENV_VARS.graphql.max_operations_per_connection;
+                    if operations.operations.len() >= max_ops {
+                        return send_error_string(
+                            &msg_sink,
+                            id,
+                            format!("Reached the limit of {} operations per connection", max_ops),
+                        );
+                    }
+
+                    // Parse the GraphQL query document; respond with a GQL_ERROR if
+                    // the query is invalid
+                    let query = match parse_query(&payload.query) {
+                        Ok(query) => query.into_static(),
+                        Err(e) => {
+                            return send_error_string(
+                                &msg_sink,
+                                id,
+                                format!("Invalid query: {}: {}", payload.query, e),
+                            );
+                        }
+                    };
+
+                    // Parse the query variables, if present
+                    let variables = match payload.variables {
+                        None | Some(serde_json::Value::Null) => None,
+                        Some(variables @ serde_json::Value::Object(_)) => {
+                            match serde_json::from_value(variables.clone()) {
+                                Ok(variables) => Some(variables),
+                                Err(e) => {
+                                    return send_error_string(
+                                        &msg_sink,
+                                        id,
+                                        format!("Invalid variables provided: {}", e),
+                                    );
+                                }
+                            }
+                        }
+                        _ => {
+                            return send_error_string(
+                                &msg_sink,
+                                id,
+                                format!("Invalid variables provided (must be an object)"),
+                            );
+                        }
+                    };
+
+                    // Construct a subscription
+                    let target = QueryTarget::Deployment(deployment.clone(), Default::default());
+                    let subscription = Subscription {
+                        // Subscriptions currently do not benefit from the generational cache
+                        // anyways, so don't bother passing a network.
+                        query: Query::new(query, variables),
+                    };
+
+                    debug!(logger, "Start operation";
+                           "connection" => &connection_id,
+                           "id" => &id);
+
+                    // Execute the GraphQL subscription
+                    let error_sink = msg_sink.clone();
+                    let result_sink = msg_sink.clone();
+                    let result_id = id.clone();
+                    let err_id = id.clone();
+                    let err_connection_id = connection_id.clone();
+                    let err_logger = logger.clone();
+                    let run_subscription = graphql_runner
+                        .cheap_clone()
+                        .run_subscription(subscription, target)
+                        .compat()
+                        .map_err(move |e| {
+                            debug!(err_logger, "Subscription error";
+                                               "connection" => &err_connection_id,
+                                               "id" => &err_id,
+                                               "error" => format!("{:?}", e));
+
+                            // Send errors back to the client as GQL_DATA
+                            match e {
+                                SubscriptionError::GraphQLError(e) => {
+                                    // Don't bug clients with transient `TooExpensive` errors,
+                                    // simply skip updating them
+                                    if !e
+                                        .iter()
+                                        .any(|err| matches!(err, QueryExecutionError::TooExpensive))
+                                    {
+                                        let result = Arc::new(QueryResult::from(e));
+                                        let msg = OutgoingMessage::from_query_result(
+                                            err_id.clone(),
+                                            result,
+                                        );
+
+                                        // An error means the client closed the websocket, ignore
+                                        // and let it be handled in the websocket loop above.
+                                        let _ = error_sink.unbounded_send(msg.into());
+                                    }
+                                }
+                            };
+                        })
+                        .and_then(move |result_stream| {
+                            // Send results back to the client as GQL_DATA
+                            result_stream
+                                .map(move |result| {
+                                    OutgoingMessage::from_query_result(result_id.clone(), result)
+                                })
+                                .map(WsMessage::from)
+                                .map(Ok)
+                                .compat()
+                                .forward(result_sink.sink_map_err(|_| ()))
+                                .map(|_| ())
+                        });
+
+                    // Setup cancelation.
+                    let guard = CancelGuard::new();
+                    let logger = logger.clone();
+                    let cancel_id = id.clone();
+                    let connection_id = connection_id.clone();
+                    let run_subscription =
+                        run_subscription.compat().cancelable(&guard, move || {
+                            debug!(logger, "Stopped operation";
+                                       "connection" => &connection_id,
+                                       "id" => &cancel_id);
+                            Ok(())
+                        });
+                    operations.insert(id, guard);
+
+                    graph::spawn_allow_panic(run_subscription);
+                    Ok(())
+                }
+            }?
+        }
+        Ok(())
+    }
+}
+
+impl<Q, S> IntoFuture for GraphQlConnection<Q, S>
+where
+    Q: GraphQlRunner,
+    S: AsyncRead + AsyncWrite + Send + 'static + Unpin,
+{
+    type Future = Box<dyn Future<Item = Self::Item, Error = Self::Error> + Send>;
+    type Item = ();
+    type Error = ();
+
+    fn into_future(self) -> Self::Future {
+        debug!(self.logger, "GraphQL over WebSocket connection opened"; "id" => &self.id);
+
+        // Obtain sink/stream pair to send and receive WebSocket messages
+        let (ws_sink, ws_stream) = self.stream.split();
+
+        // Allocate a channel for writing
+        let (msg_sink, msg_stream) = mpsc::unbounded();
+
+        // Handle incoming messages asynchronously
+        let ws_reader = Self::handle_incoming_messages(
+            ws_stream,
+            msg_sink,
+            self.logger.clone(),
+            self.id.clone(),
+            self.deployment.clone(),
+            self.graphql_runner.clone(),
+        );
+
+        // Send outgoing messages asynchronously
+        let ws_writer = msg_stream.forward(ws_sink.compat().sink_map_err(|_| ()));
+
+        // Silently swallow internal send results and errors. There is nothing
+        // we can do about these errors ourselves. Clients will be disconnected
+        // as a result of this but most will try to reconnect (GraphiQL for sure,
+        // Apollo maybe).
+        let ws_writer = ws_writer.map(|_| ());
+        let ws_reader = Box::pin(ws_reader.map_err(|_| ()));
+
+        // Return a future that is fulfilled when either we or the client close
+        // our/their end of the WebSocket stream
+        let logger = self.logger.clone();
+        let id = self.id.clone();
+        Box::new(ws_reader.compat().select(ws_writer).then(move |_| {
+            debug!(logger, "GraphQL over WebSocket connection closed"; "connection" => id);
+            Ok(())
+        }))
+    }
+}
diff --git a/server/websocket/src/lib.rs b/server/websocket/src/lib.rs
new file mode 100644
index 0000000..887fed5
--- /dev/null
+++ b/server/websocket/src/lib.rs
@@ -0,0 +1,4 @@
+mod connection;
+mod server;
+
+pub use self::server::SubscriptionServer;
diff --git a/server/websocket/src/server.rs b/server/websocket/src/server.rs
new file mode 100644
index 0000000..62684f3
--- /dev/null
+++ b/server/websocket/src/server.rs
@@ -0,0 +1,214 @@
+use graph::{
+    data::query::QueryTarget,
+    prelude::{SubscriptionServer as SubscriptionServerTrait, *},
+};
+use http::header::{ACCESS_CONTROL_ALLOW_ORIGIN, CONTENT_TYPE};
+use http::{HeaderValue, Response, StatusCode};
+use std::net::{IpAddr, Ipv4Addr, SocketAddr};
+use std::sync::Mutex;
+use tokio::net::TcpListener;
+use tokio_tungstenite::accept_hdr_async;
+use tokio_tungstenite::tungstenite::handshake::server::Request;
+
+use crate::connection::GraphQlConnection;
+
+/// A GraphQL subscription server based on Hyper / Websockets.
+pub struct SubscriptionServer<Q, S> {
+    logger: Logger,
+    graphql_runner: Arc<Q>,
+    store: Arc<S>,
+}
+
+impl<Q, S> SubscriptionServer<Q, S>
+where
+    Q: GraphQlRunner,
+    S: QueryStoreManager,
+{
+    pub fn new(logger: &Logger, graphql_runner: Arc<Q>, store: Arc<S>) -> Self {
+        SubscriptionServer {
+            logger: logger.new(o!("component" => "SubscriptionServer")),
+            graphql_runner,
+            store,
+        }
+    }
+
+    async fn subgraph_id_from_url_path(
+        store: Arc<S>,
+        path: &str,
+    ) -> Result<Option<DeploymentState>, Error> {
+        fn target_from_name(name: String, api_version: ApiVersion) -> Option<QueryTarget> {
+            SubgraphName::new(name)
+                .ok()
+                .map(|sub_name| QueryTarget::Name(sub_name, api_version))
+        }
+
+        fn target_from_id(id: &str, api_version: ApiVersion) -> Option<QueryTarget> {
+            DeploymentHash::new(id)
+                .ok()
+                .map(|hash| QueryTarget::Deployment(hash, api_version))
+        }
+
+        async fn state<S: QueryStoreManager>(
+            store: Arc<S>,
+            target: Option<QueryTarget>,
+        ) -> Option<DeploymentState> {
+            let target = match target {
+                Some(target) => target,
+                None => return None,
+            };
+            match store.query_store(target, false).await.ok() {
+                Some(query_store) => query_store.deployment_state().await.ok(),
+                None => None,
+            }
+        }
+
+        let path_segments = {
+            let mut segments = path.split('/');
+
+            // Remove leading '/'
+            let first_segment = segments.next();
+            if first_segment != Some("") {
+                return Ok(None);
+            }
+
+            segments.collect::<Vec<_>>()
+        };
+
+        match path_segments.as_slice() {
+            &["subgraphs", "id", subgraph_id] => {
+                Ok(state(store, target_from_id(subgraph_id, ApiVersion::default())).await)
+            }
+            &["subgraphs", "name", _] | &["subgraphs", "name", _, _] => Ok(state(
+                store,
+                target_from_name(path_segments[2..].join("/"), ApiVersion::default()), // TODO: version
+            )
+            .await),
+            &["subgraphs", "network", _, _] => Ok(state(
+                store,
+                target_from_name(path_segments[1..].join("/"), ApiVersion::default()), // TODO: version
+            )
+            .await),
+            _ => Ok(None),
+        }
+    }
+}
+
+#[async_trait]
+impl<Q, S> SubscriptionServerTrait for SubscriptionServer<Q, S>
+where
+    Q: GraphQlRunner,
+    S: QueryStoreManager,
+{
+    async fn serve(self, port: u16) {
+        info!(
+            self.logger,
+            "Starting GraphQL WebSocket server at: ws://localhost:{}", port
+        );
+
+        let addr = SocketAddr::new(IpAddr::V4(Ipv4Addr::new(0, 0, 0, 0)), port);
+        let socket = TcpListener::bind(&addr)
+            .await
+            .expect("Failed to bind WebSocket port");
+
+        loop {
+            let stream = match socket.accept().await {
+                Ok((stream, _)) => stream,
+                Err(e) => {
+                    trace!(self.logger, "Connection error: {}", e);
+                    continue;
+                }
+            };
+            let logger = self.logger.clone();
+            let logger2 = self.logger.clone();
+            let graphql_runner = self.graphql_runner.clone();
+            let store = self.store.clone();
+
+            // Subgraph that the request is resolved to (if any)
+            let subgraph_id = Arc::new(Mutex::new(None));
+            let accept_subgraph_id = subgraph_id.clone();
+
+            accept_hdr_async(stream, move |request: &Request, mut response: Response<()>| {
+                // Try to obtain the subgraph ID or name from the URL path.
+                // Return a 404 if the URL path contains no name/ID segment.
+                let path = request.uri().path();
+
+                // `block_in_place` is not recommended but in this case we have no alternative since
+                // we're in an async context but `tokio_tungstenite` doesn't allow this callback
+                // to be a future.
+                let state = tokio::task::block_in_place(|| {
+                    graph::block_on(Self::subgraph_id_from_url_path(
+                        store.clone(),
+                        path,
+                    ))
+                })
+                .map_err(|e| {
+                    error!(
+                        logger,
+                        "Error resolving subgraph ID from URL path";
+                        "error" => e.to_string()
+                    );
+
+                    Response::builder()
+                        .status(StatusCode::INTERNAL_SERVER_ERROR)
+                        .header(ACCESS_CONTROL_ALLOW_ORIGIN, "*")
+                        .header(CONTENT_TYPE, "text/plain")
+                        .body(None)
+                        .unwrap()
+                })
+                .and_then(|state| {
+                    state.ok_or_else(|| {
+                        Response::builder()
+                            .status(StatusCode::NOT_FOUND)
+                            .header(ACCESS_CONTROL_ALLOW_ORIGIN, "*")
+                            .header(CONTENT_TYPE, "text/plain")
+                            .body(None)
+                            .unwrap()
+                    })
+                })?;
+
+                // Check if the subgraph is deployed
+                if !state.is_deployed() {
+                        error!(logger, "Failed to establish WS connection, no data found for subgraph";
+                                        "subgraph_id" => state.id.to_string(),
+                        );
+                        return Err(Response::builder()
+                            .status(StatusCode::NOT_FOUND)
+                            .header(ACCESS_CONTROL_ALLOW_ORIGIN, "*")
+                            .header(CONTENT_TYPE, "text/plain")
+                            .body(None)
+                            .unwrap());
+                    }
+
+                *accept_subgraph_id.lock().unwrap() = Some(state.id);
+                response.headers_mut().insert(
+                    "Sec-WebSocket-Protocol",
+                    HeaderValue::from_static("graphql-ws"),
+                );
+                Ok(response)
+            })
+            .then(move |result| async move {
+                match result {
+                    Ok(ws_stream) => {
+                        // Obtain the subgraph ID or name that we resolved the request to
+                        let subgraph_id = subgraph_id.lock().unwrap().clone().unwrap();
+
+                        // Spawn a GraphQL over WebSocket connection
+                        let service = GraphQlConnection::new(
+                            &logger2,
+                            subgraph_id,
+                            ws_stream,
+                            graphql_runner.clone(),
+                        );
+
+                        graph::spawn_allow_panic(service.into_future().compat());
+                    }
+                    Err(e) => {
+                        // We gracefully skip over failed connection attempts rather
+                        // than tearing down the entire stream
+                        trace!(logger2, "Failed to establish WebSocket connection: {}", e);
+                    }
+                }
+            }).await
+        }
+    }
+}
diff --git a/store/postgres/Cargo.toml b/store/postgres/Cargo.toml
new file mode 100644
index 0000000..f93a2d0
--- /dev/null
+++ b/store/postgres/Cargo.toml
@@ -0,0 +1,44 @@
+[package]
+name = "graph-store-postgres"
+version = "0.27.0"
+edition = "2021"
+
+[dependencies]
+async-trait = "0.1.50"
+blake3 = "1.0"
+derive_more = { version = "0.99.17" }
+diesel = { version = "1.4.8", features = ["postgres", "serde_json", "numeric", "r2d2"] }
+# We use diesel-dynamic-schema straight from git as the project has not
+# made a release as a crate yet
+diesel-dynamic-schema = { git = "https://github.com/diesel-rs/diesel-dynamic-schema", rev="a8ec4fb1" }
+diesel-derive-enum = { version = "1.1", features = ["postgres"] }
+diesel_migrations = "1.3.0"
+fallible-iterator = "0.2.0"
+graph = { path = "../../graph" }
+graph-graphql = { path = "../../graphql" }
+Inflector = "0.11.3"
+lazy_static = "1.1"
+lru_time_cache = "0.11"
+maybe-owned = "0.3.4"
+postgres = "0.19.1"
+openssl = "0.10.41"
+postgres-openssl = "0.5.0"
+rand = "0.8.4"
+serde = "1.0"
+uuid = { version = "1.1.2", features = ["v4"] }
+stable-hash_legacy = { version = "0.3.3", package = "stable-hash" }
+diesel_derives = "1.4.1"
+anyhow = "1.0.65"
+git-testament = "0.2.0"
+itertools = "0.10.3"
+pin-utils = "0.1"
+hex = "0.4.3"
+
+[dev-dependencies]
+futures = "0.3"
+clap = "3.2.22"
+graphql-parser = "0.4.0"
+test-store = { path = "../test-store" }
+hex-literal = "0.3"
+graph-chain-ethereum = { path = "../../chain/ethereum" }
+graph-mock = { path = "../../mock" }
diff --git a/store/postgres/examples/layout.rs b/store/postgres/examples/layout.rs
new file mode 100644
index 0000000..1f73934
--- /dev/null
+++ b/store/postgres/examples/layout.rs
@@ -0,0 +1,164 @@
+extern crate clap;
+extern crate graph_store_postgres;
+
+use clap::{arg, Command};
+use std::process::exit;
+use std::{fs, sync::Arc};
+
+use graph::prelude::{DeploymentHash, Schema};
+use graph_store_postgres::{
+    command_support::{Catalog, Column, ColumnType, Layout, Namespace},
+    layout_for_tests::make_dummy_site,
+};
+
+pub fn usage(msg: &str) -> ! {
+    println!("layout: {}", msg);
+    println!("Try 'layout --help' for more information.");
+    std::process::exit(1);
+}
+
+pub fn ensure<T, E: std::fmt::Display>(res: Result<T, E>, msg: &str) -> T {
+    match res {
+        Ok(ok) => ok,
+        Err(err) => {
+            eprintln!("{}:\n    {}", msg, err);
+            exit(1)
+        }
+    }
+}
+
+fn print_drop(layout: &Layout) {
+    for table in layout.tables.values() {
+        println!("drop table {};", table.qualified_name);
+    }
+}
+
+fn print_delete_all(layout: &Layout) {
+    for table in layout.tables.values() {
+        println!("delete from {};", table.qualified_name);
+    }
+}
+
+fn print_ddl(layout: &Layout) {
+    let ddl = ensure(layout.as_ddl(), "Failed to generate DDL");
+    println!("{}", ddl);
+}
+
+fn print_diesel_tables(layout: &Layout) {
+    fn diesel_type(column: &Column) -> String {
+        let mut dsl_type = match column.column_type {
+            ColumnType::Boolean => "Bool",
+            ColumnType::BigDecimal | ColumnType::BigInt => "Numeric",
+            ColumnType::Bytes => "Binary",
+            ColumnType::Int => "Integer",
+            ColumnType::String | ColumnType::Enum(_) | ColumnType::TSVector(_) => "Text",
+        }
+        .to_owned();
+
+        if column.is_list() {
+            dsl_type = format!("Array<{}>", dsl_type);
+        }
+        if column.is_nullable() {
+            dsl_type = format!("Nullable<{}>", dsl_type);
+        }
+        dsl_type
+    }
+
+    fn rust_type(column: &Column) -> String {
+        let mut dsl_type = match column.column_type {
+            ColumnType::Boolean => "bool",
+            ColumnType::BigDecimal | ColumnType::BigInt => "BigDecimal",
+            ColumnType::Bytes => "Vec<u8>",
+            ColumnType::Int => "i32",
+            ColumnType::String | ColumnType::Enum(_) | ColumnType::TSVector(_) => "String",
+        }
+        .to_owned();
+
+        if column.is_list() {
+            dsl_type = format!("Vec<{}>", dsl_type);
+        }
+        if column.is_nullable() {
+            dsl_type = format!("Option<{}>", dsl_type);
+        }
+        dsl_type
+    }
+
+    let mut tables = layout.tables.values().collect::<Vec<_>>();
+    tables.sort_by_key(|table| table.name.as_str());
+
+    for table in &tables {
+        println!("    table! {{");
+        let name = table.qualified_name.as_str().replace("\"", "");
+        println!("        {} (vid) {{", name);
+        println!("            vid -> BigInt,");
+        for column in &table.as_ref().columns {
+            println!(
+                "            {} -> {},",
+                column.name.as_str(),
+                diesel_type(column)
+            );
+        }
+        println!("            block_range -> Range<Integer>,");
+        println!("        }}");
+        println!("    }}\n")
+    }
+
+    // Now generate Rust structs for all this
+    for table in &tables {
+        println!("    #[derive(Queryable, Clone, Debug)]");
+        println!("    pub struct {} {{", table.object);
+        println!("        pub vid: i64,");
+        for column in &table.as_ref().columns {
+            println!(
+                "        pub {}: {},",
+                column.name.as_str(),
+                rust_type(column)
+            );
+        }
+        println!("        pub block_range: (Bound<i32>, Bound<i32>),");
+        println!("    }}\n")
+    }
+}
+
+pub fn main() {
+    let args = Command::new("layout")
+    .version("1.0")
+    .about("Information about the database schema for a GraphQL schema")
+    .arg(arg!(-g --generate <KIND> "what kind of SQL to generate. Can be ddl (the default), migrate, delete, or drop"))
+    .arg(arg!(<schema>))
+    .arg(arg!(<db_schema>))
+    .get_matches();
+
+    let schema = args.get_one::<&str>("schema").unwrap();
+    let namespace = args.get_one::<&str>("db_schema").unwrap_or(&"subgraphs");
+    let kind = args.get_one::<&str>("generate").unwrap_or(&"ddl");
+
+    let subgraph = DeploymentHash::new("Qmasubgraph").unwrap();
+    let schema = ensure(fs::read_to_string(schema), "Can not read schema file");
+    let schema = ensure(
+        Schema::parse(&schema, subgraph.clone()),
+        "Failed to parse schema",
+    );
+    let namespace = ensure(
+        Namespace::new(namespace.to_string()),
+        "Invalid database schema",
+    );
+    let site = Arc::new(make_dummy_site(subgraph, namespace, "anet".to_string()));
+    let catalog = ensure(
+        Catalog::for_tests(site.clone()),
+        "Failed to construct catalog",
+    );
+    let layout = ensure(
+        Layout::new(site, &schema, catalog),
+        "Failed to construct Mapping",
+    );
+    match *kind {
+        "drop" => print_drop(&layout),
+        "delete" => print_delete_all(&layout),
+        "ddl" => print_ddl(&layout),
+        "diesel" => print_diesel_tables(&layout),
+        _ => {
+            usage(&format!("illegal value {} for --generate", kind));
+        }
+    }
+}
diff --git a/store/postgres/migrations/2018-07-10-061642_create_entities_table/down.sql b/store/postgres/migrations/2018-07-10-061642_create_entities_table/down.sql
new file mode 100644
index 0000000..257d967
--- /dev/null
+++ b/store/postgres/migrations/2018-07-10-061642_create_entities_table/down.sql
@@ -0,0 +1,4 @@
+/**************************************************************
+* DROP TABLE
+**************************************************************/
+DROP TABLE entities;
diff --git a/store/postgres/migrations/2018-07-10-061642_create_entities_table/up.sql b/store/postgres/migrations/2018-07-10-061642_create_entities_table/up.sql
new file mode 100644
index 0000000..253a46b
--- /dev/null
+++ b/store/postgres/migrations/2018-07-10-061642_create_entities_table/up.sql
@@ -0,0 +1,25 @@
+-- Track database version.
+-- This value is used to identify when the current database is in a format that
+-- is incompatible with and cannot be upgraded to a new version of graph-node.
+--
+-- See migration 2019-01-07-120000 for an example of how to check the version
+-- number.
+CREATE TABLE db_version (
+    db_version BIGINT PRIMARY KEY
+);
+
+-- Insert current version number
+INSERT INTO db_version VALUES (2);
+
+
+/**************************************************************
+* CREATE TABLE
+**************************************************************/
+CREATE TABLE IF NOT EXISTS entities (
+     id VARCHAR NOT NULL,
+     subgraph VARCHAR NOT NULL,
+     entity VARCHAR NOT NULL,
+     data jsonb NOT NULL,
+     event_source VARCHAR DEFAULT NULL,
+     PRIMARY KEY (id, subgraph, entity)
+ );
diff --git a/store/postgres/migrations/2018-07-10-061659_create_history_tables/down.sql b/store/postgres/migrations/2018-07-10-061659_create_history_tables/down.sql
new file mode 100644
index 0000000..7502349
--- /dev/null
+++ b/store/postgres/migrations/2018-07-10-061659_create_history_tables/down.sql
@@ -0,0 +1,5 @@
+/**************************************************************
+* DROP TABLES
+**************************************************************/
+DROP TABLE entity_history;
+DROP TABLE event_meta_data;
diff --git a/store/postgres/migrations/2018-07-10-061659_create_history_tables/up.sql b/store/postgres/migrations/2018-07-10-061659_create_history_tables/up.sql
new file mode 100644
index 0000000..db167f9
--- /dev/null
+++ b/store/postgres/migrations/2018-07-10-061659_create_history_tables/up.sql
@@ -0,0 +1,35 @@
+/**************************************************************
+* CREATE TABLES
+**************************************************************/
+-- Stores the metadata from each SQL transaction
+CREATE TABLE IF NOT EXISTS event_meta_data (
+    id SERIAL PRIMARY KEY,
+    db_transaction_id BIGINT NOT NULL UNIQUE,
+    db_transaction_time TIMESTAMP NOT NULL,
+    op_id SMALLINT NOT NULL,
+    source VARCHAR DEFAULT NULL
+);
+
+-- Stores the row level data and changes (1 or more per SQL transaction)
+CREATE TABLE IF NOT EXISTS entity_history (
+     id SERIAL PRIMARY KEY,
+     event_id BIGINT NOT NULL,
+     entity_id VARCHAR NOT NULL,
+     subgraph VARCHAR NOT NULL,
+     entity VARCHAR NOT NULL,
+     data_before JSONB,
+     data_after JSONB,
+     reversion BOOLEAN NOT NULL DEFAULT FALSE
+ );
+
+ /**************************************************************
+ * ADD FOREIGN KEYS
+ **************************************************************/
+ -- Define relationship between event_meta_data and entity_history
+ALTER TABLE entity_history
+    ADD CONSTRAINT entity_history_event_id_fkey
+    FOREIGN KEY (event_id)
+    REFERENCES event_meta_data(id)
+    MATCH FULL
+    ON DELETE CASCADE
+    ON UPDATE CASCADE;
diff --git a/store/postgres/migrations/2018-07-10-062717_create_history_triggers/down.sql b/store/postgres/migrations/2018-07-10-062717_create_history_triggers/down.sql
new file mode 100644
index 0000000..6c45efc
--- /dev/null
+++ b/store/postgres/migrations/2018-07-10-062717_create_history_triggers/down.sql
@@ -0,0 +1,15 @@
+/**************************************************************
+* DROP TRIGGERS
+**************************************************************/
+DROP TRIGGER before_transaction_trigger ON entities;
+DROP TRIGGER after_insert_trigger ON entities;
+DROP TRIGGER after_update_trigger ON entities;
+DROP TRIGGER after_delete_trigger ON entities;
+
+/**************************************************************
+* DROP FUNCTIONS
+**************************************************************/
+DROP FUNCTION log_transaction();
+DROP FUNCTION log_insert();
+DROP FUNCTION log_update();
+DROP FUNCTION log_delete();
diff --git a/store/postgres/migrations/2018-07-10-062717_create_history_triggers/up.sql b/store/postgres/migrations/2018-07-10-062717_create_history_triggers/up.sql
new file mode 100644
index 0000000..40fa72a
--- /dev/null
+++ b/store/postgres/migrations/2018-07-10-062717_create_history_triggers/up.sql
@@ -0,0 +1,170 @@
+/**************************************************************
+* CREATE TRIGGER FUNCTIONS
+**************************************************************/
+
+/**************************************************************
+* LOG UPDATE
+*
+* Writes row level metadata and before & after state of `data` to entity_history
+* Called when after_update_trigger is fired.
+* Logs information after all insert, update, delete events
+* Revert events are marked with the reversion boolean field
+**************************************************************/
+CREATE OR REPLACE FUNCTION log_update()
+    RETURNS trigger AS
+$$
+DECLARE
+    event_id INTEGER;
+    new_event_id INTEGER;
+    is_reversion BOOLEAN;
+BEGIN
+    -- Sets the is_reversion variable for differentiating between Ethereum events and block reorg events
+    IF NEW.event_source = 'REVERSION' THEN
+        is_reversion := TRUE;
+    ELSE
+        is_reversion := FALSE;
+    END IF;
+
+    SELECT id INTO event_id
+    FROM event_meta_data
+    WHERE db_transaction_id = txid_current();
+
+    new_event_id := null;
+
+    IF event_id IS NULL THEN
+        -- Log information on the postgres transaction for later use in revert operations
+        INSERT INTO event_meta_data
+            (db_transaction_id, db_transaction_time, op_id, source)
+        VALUES
+            (txid_current(), statement_timestamp(), 1, NEW.event_source)
+        RETURNING event_meta_data.id INTO new_event_id;
+    END IF;
+
+    -- Log row metadata and changes, specify whether event was an original ethereum event or a reversion
+    INSERT INTO entity_history
+        (event_id, entity_id, subgraph, entity, data_before, data_after, reversion)
+    VALUES
+        (COALESCE(new_event_id, event_id), OLD.id, OLD.subgraph, OLD.entity, OLD.data, NEW.data, is_reversion);
+
+    RETURN NULL;
+END;
+$$ LANGUAGE plpgsql;
+
+/**************************************************************
+* LOG INSERT
+*
+* Writes out newly inserted entity to entity_history
+* Called when after_insert_trigger is fired.
+**************************************************************/
+CREATE OR REPLACE FUNCTION log_insert()
+    RETURNS trigger AS
+$$
+DECLARE
+    temp_event_id INTEGER;
+    event_id INTEGER;
+    new_event_id INTEGER;
+    is_reversion BOOLEAN;
+BEGIN
+    -- Sets the is_reversion variable for differentiating between Ethereum events and block reorg events
+    IF NEW.event_source = 'REVERSION' THEN
+        is_reversion := TRUE;
+    ELSE
+        is_reversion := FALSE;
+    END IF;
+
+    SELECT id INTO event_id
+    FROM event_meta_data
+    WHERE db_transaction_id = txid_current();
+
+    new_event_id := null;
+
+    IF event_id IS NULL THEN
+        -- Log information on the postgres transaction for later use in revert operations
+        INSERT INTO event_meta_data
+            (db_transaction_id, db_transaction_time, op_id, source)
+        VALUES
+            (txid_current(), statement_timestamp(), 0, NEW.event_source)
+        RETURNING event_meta_data.id INTO new_event_id;
+    END IF;
+
+    -- Log inserted row
+    INSERT INTO entity_history
+        (event_id, entity_id, subgraph, entity, data_before, data_after, reversion)
+    VALUES
+        (COALESCE(new_event_id, event_id), NEW.id, NEW.subgraph, NEW.entity, NULL, NEW.data, is_reversion);
+    RETURN NULL;
+END;
+$$ LANGUAGE plpgsql;
+
+/**************************************************************
+* LOG DELETE
+*
+* Writes deleted entity to entity_history
+* Called when after_delete_trigger is fired.
+**************************************************************/
+CREATE OR REPLACE FUNCTION log_delete()
+    RETURNS trigger AS
+$$
+DECLARE
+    event_id INTEGER;
+    current_event_source  VARCHAR;
+    new_event_id INTEGER;
+    is_reversion BOOLEAN;
+BEGIN
+    -- Use session level setting to get the event_source for the current transaction
+    current_event_source := current_setting('vars.current_event_source', TRUE);
+
+    -- Sets the is_reversion variable for differentiating between Ethereum events and block reorg events
+    IF (
+      current_event_source = 'REVERSION'
+    )
+    THEN
+        is_reversion := TRUE;
+    ELSE
+        is_reversion := FALSE;
+    END IF;
+
+    SELECT id INTO event_id
+    FROM event_meta_data
+    WHERE db_transaction_id = txid_current();
+
+    new_event_id := null;
+
+    IF event_id IS NULL THEN
+        -- Log information on the postgres transaction for later use in revert operations
+        INSERT INTO event_meta_data
+            (db_transaction_id, db_transaction_time, op_id, source)
+        VALUES
+            (txid_current(), statement_timestamp(), 2, current_event_source)
+        RETURNING event_meta_data.id INTO new_event_id;
+    END IF;
+
+    -- Log content of deleted entity
+    INSERT INTO entity_history
+        (event_id, entity_id, subgraph, entity, data_before, data_after, reversion)
+    VALUES
+        (COALESCE(new_event_id, event_id), OLD.id, OLD.subgraph, OLD.entity, OlD.data, NULL, is_reversion);
+    RETURN NULL;
+END;
+$$ LANGUAGE plpgsql;
+
+/**************************************************************
+* CREATE TRIGGERS
+**************************************************************/
+CREATE TRIGGER after_insert_trigger
+    AFTER INSERT
+    ON entities
+    FOR EACH ROW
+    EXECUTE PROCEDURE log_insert();
+
+CREATE TRIGGER after_update_trigger
+    AFTER UPDATE
+    ON entities
+    FOR EACH ROW
+    EXECUTE PROCEDURE log_update();
+
+CREATE TRIGGER after_delete_trigger
+    AFTER DELETE
+    ON entities
+    FOR EACH ROW
+    EXECUTE PROCEDURE log_delete();
diff --git a/store/postgres/migrations/2018-07-10-062730_create_revert_procedures/down.sql b/store/postgres/migrations/2018-07-10-062730_create_revert_procedures/down.sql
new file mode 100644
index 0000000..360f5c3
--- /dev/null
+++ b/store/postgres/migrations/2018-07-10-062730_create_revert_procedures/down.sql
@@ -0,0 +1,8 @@
+/**************************************************************
+* DROP FUNCTIONS
+**************************************************************/
+DROP FUNCTION jsonb_diff_val(JSONB, JSONB);
+DROP FUNCTION revert_row_event(INTEGER, INTEGER);
+DROP FUNCTION revert_transaction(INTEGER);
+DROP FUNCTION revert_transaction_group(INTEGER[]);
+DROP FUNCTION revert_block(VARCHAR);
diff --git a/store/postgres/migrations/2018-07-10-062730_create_revert_procedures/up.sql b/store/postgres/migrations/2018-07-10-062730_create_revert_procedures/up.sql
new file mode 100644
index 0000000..341b03c
--- /dev/null
+++ b/store/postgres/migrations/2018-07-10-062730_create_revert_procedures/up.sql
@@ -0,0 +1,314 @@
+/**************************************************************
+* CREATE REVERT FUNCTIONS
+**************************************************************/
+
+/**************************************************************
+* REVERT ROW EVENT
+*
+* Revert a specific row level event
+* Parameters: entity_history.id (primary key)
+*             operation_id
+**************************************************************/
+CREATE OR REPLACE FUNCTION revert_entity_event(entity_history_id INTEGER, operation_id INTEGER)
+    RETURNS VOID AS
+$$
+DECLARE
+    target_entity_id VARCHAR;
+    target_subgraph VARCHAR;
+    target_entity VARCHAR;
+    target_data_before JSONB;
+    reversion_identifier VARCHAR;
+BEGIN
+    -- Get entity history event information and save into the declared variables
+    SELECT
+        entity_id,
+        subgraph,
+        entity,
+        data_before
+    INTO
+        target_entity_id,
+        target_subgraph,
+        target_entity,
+        target_data_before
+    FROM entity_history
+    WHERE entity_history.id = entity_history_id;
+
+    reversion_identifier := 'REVERSION';
+
+    CASE
+        -- INSERT case
+        WHEN operation_id = 0 THEN
+            -- Delete inserted row
+            BEGIN
+                PERFORM set_config('vars.current_event_source', 'REVERSION', FALSE);
+                EXECUTE
+                    'DELETE FROM entities WHERE (
+                        subgraph = $1 AND
+                        entity = $2 AND
+                        id = $3)'
+                USING target_subgraph, target_entity, target_entity_id;
+
+                -- Row was already updated
+                EXCEPTION
+                    WHEN no_data_found THEN
+                        NULL;
+            END;
+
+        -- UPDATE or DELETE case
+        WHEN operation_id IN (1,2) THEN
+            -- Insert deleted row if not exists
+            -- If row exists perform update
+            BEGIN
+                EXECUTE
+                    'INSERT INTO entities (id, subgraph, entity, data, event_source)
+                        VALUES ($1, $2, $3, $4, $5)
+                        ON CONFLICT (id, subgraph, entity) DO UPDATE
+                        SET data = $4, event_source = $5'
+                USING
+                    target_entity_id,
+                    target_subgraph,
+                    target_entity,
+                    target_data_before,
+                    reversion_identifier;
+            END;
+    END CASE;
+END;
+$$ LANGUAGE plpgsql;
+
+/**************************************************************
+* REVERT TRANSACTION
+*
+* Get all row level events associated with a SQL transaction
+* For each row level event call revert_entity_event()
+* Parameters: event_id
+**************************************************************/
+CREATE OR REPLACE FUNCTION revert_transaction(event_id_to_revert INTEGER)
+    RETURNS VOID AS
+$$
+DECLARE
+    entity_history_row RECORD;
+BEGIN
+    -- Loop through each record change event
+    FOR entity_history_row IN
+        -- Get all entity changes driven by given event
+        SELECT
+            entity_history.id as id,
+            event_meta_data.op_id as op_id
+        FROM entity_history
+        JOIN event_meta_data ON
+            event_meta_data.id=entity_history.event_id
+        WHERE event_meta_data.id = event_id_to_revert
+        ORDER BY entity_history.id DESC
+    -- Iterate over entity changes and revert each
+    LOOP
+        PERFORM revert_entity_event(entity_history_row.id, entity_history_row.op_id);
+    END LOOP;
+END;
+$$ LANGUAGE plpgsql;
+
+/**************************************************************
+* REVERT TRANSACTION GROUP
+*
+* Get all row level events associated with a set of SQL transactions
+* For each row level event call revert_entity_event()
+* Parameters: array of event_id's
+**************************************************************/
+CREATE OR REPLACE FUNCTION revert_transaction_group(event_ids_to_revert INTEGER[])
+    RETURNS VOID AS
+$$
+DECLARE
+    entity_history_row RECORD;
+BEGIN
+    FOR entity_history_row IN
+        SELECT
+            entity_history.id as id,
+            event_meta_data.op_id as op_id
+        FROM entity_history
+        JOIN event_meta_data ON
+            event_meta_data.id=entity_history.event_id
+        WHERE event_meta_data.id = ANY(event_id_to_revert)
+        ORDER BY entity_history.id DESC
+    LOOP
+        PERFORM revert_entity_event(row.id, row.op_id);
+    END LOOP;
+END;
+$$ LANGUAGE plpgsql;
+
+/**************************************************************
+* RERUN ROW EVENT
+*
+* Rerun a specific row level event
+* Parameters: entity_history pkey (id) and operation type
+**************************************************************/
+CREATE OR REPLACE FUNCTION rerun_entity_history_event(entity_history_id INTEGER, operation_id INTEGER)
+    RETURNS VOID AS
+$$
+DECLARE
+    target_entity_id VARCHAR;
+    target_subgraph VARCHAR;
+    target_entity VARCHAR;
+    target_data_after JSONB;
+BEGIN
+    SELECT
+        entity_id,
+        subgraph,
+        entity,
+        data_before,
+        data_after
+    INTO
+        target_entity_id,
+        target_subgraph,
+        target_entity,
+        target_data_after
+    FROM entity_history
+    WHERE entity_history.id = entity_history_id;
+
+    CASE
+        -- INSERT or UPDATE case
+        WHEN operation_id IN (0,1) THEN
+            -- Re insert row
+            -- If row exists perform update
+            BEGIN
+                EXECUTE
+                    'INSERT INTO entities (subgraph, entity, id, data, event_source)
+                        VALUES ($1, $2, $3, $4, "REVERSION")
+                        ON CONFLICT (subgraph, entity, id) DO UPDATE
+                        SET data = $4, event_source = NULL'
+                USING
+                    target_subgraph,
+                    target_entity,
+                    target_entity_id,
+                    target_data_after;
+            END;
+
+        -- DELETE case
+        WHEN operation_id = 2 THEN
+            -- Delete entity
+            BEGIN
+                -- Set event source as "REVERSION"
+                PERFORM set_config('vars.current_event_source', 'REVERSION', FALSE);
+                EXECUTE
+                    'DELETE FROM entities WHERE (
+                        subgraph = $1 AND
+                        entity = $2 AND
+                        id = $3)'
+                USING
+                    target_subgraph,
+                    target_entity,
+                    target_entity_id;
+            END;
+    END CASE;
+END;
+$$ LANGUAGE plpgsql;
+
+/**************************************************************
+* RERUN ENTITY
+*
+* Rerun all events for a specific entity
+* avoiding any revert or uncled events
+* Parameters: entity pkey -> (entity_id, subgraph, entity)
+              event_id of revert event
+**************************************************************/
+CREATE OR REPLACE FUNCTION rerun_entity(
+    event_id_to_rerun INTEGER, subgraph_to_rerun VARCHAR, entity_to_rerun VARCHAR, entity_id_to_rerun VARCHAR)
+    RETURNS VOID AS
+$$
+DECLARE
+    entity_history_event RECORD;
+BEGIN
+     FOR entity_history_event IN
+        -- Get all events that effect given entity and come after given event
+        SELECT
+            entity_history.id as id,
+            event_meta_data.op_id as op_id
+        FROM entity_history
+        JOIN event_meta_data ON
+            event_meta_data.id = entity_history.event_id
+        WHERE (
+            entity_history.entity = entity_to_rerun AND
+            entity_history.entity_id = entity_id_to_rerun AND
+            entity_history.subgraph = subgraph_to_rerun
+            AND
+            entity_history.event_id > event_i_to_rerund
+            AND
+            entity_history.reversion = FALSE )
+        ORDER BY entity_history.id ASC
+    LOOP
+        -- For each event rerun the operation
+        PERFORM rerun_entity_history_event(entity_history_event.id, entity_history_event.op_id);
+    END LOOP;
+END;
+$$ LANGUAGE plpgsql;
+
+/**************************************************************
+* REVERT BLOCK
+*
+* Revert the row store events related to a particular block
+* Rerun all of an entities changes that come after the row store events related to that block
+**************************************************************/
+CREATE OR REPLACE FUNCTION revert_block(block_to_revert_hash VARCHAR, block_to_revert_number BIGINT, target_block_hash VARCHAR, subgraph_id VARCHAR)
+    RETURNS VOID AS
+$$
+DECLARE
+    event_row RECORD;
+    entity_row RECORD;
+BEGIN
+    -- Revert all relevant events
+    FOR event_row IN
+        -- Get all events associated with the given block
+        SELECT
+            entity_history.event_id AS event_id
+        FROM entity_history
+        JOIN event_meta_data ON
+            entity_history.event_id = event_meta_data.id
+        WHERE event_meta_data.source = block_to_revert_hash AND
+            entity_history.subgraph = subgraph_id
+        GROUP BY
+            entity_history.event_id
+        ORDER BY entity_history.event_id DESC
+    LOOP
+        PERFORM revert_transaction(event_row.event_id::integer);
+    END LOOP;
+END;
+$$ LANGUAGE plpgsql;
+
+/**************************************************************
+* REVERT BLOCK GROUP
+*
+* Revert the row store events related to a set of blocks
+* for each block in the set run the revert block function
+* Parameters: array of block_hash's, subgraph
+**************************************************************/
+CREATE OR REPLACE FUNCTION revert_block_group(block_hash_group VARCHAR[], subgraph_id VARCHAR)
+    RETURNS VOID AS
+$$
+DECLARE
+    block_row RECORD;
+    event_row RECORD;
+    entity_row RECORD;
+BEGIN
+    FOR block_row IN
+        SELECT
+            source
+        FROM event_meta_data
+        WHERE source = ANY(block_hash_group)
+        GROUP BY source
+        ORDER BY id DESC
+    LOOP
+        FOR event_row IN
+            SELECT
+                entity_history.event_id as event_id
+            FROM entity_history
+            JOIN event_meta_data ON
+                entity_history.event_id = event_meta_data.id
+            WHERE event_meta_data.block_hash = block_row.block_hash AND
+                entity_history.subgraph = subgraph_id
+            GROUP BY
+                entity_history.event_id
+            ORDER BY entity_history.event_id DESC
+        LOOP
+            PERFORM revert_transaction(event_row.event_id::integer);
+        END LOOP;
+    END LOOP;
+END;
+$$ LANGUAGE plpgsql;
diff --git a/store/postgres/migrations/2018-08-16-143800_create_entity_change_triggers/down.sql b/store/postgres/migrations/2018-08-16-143800_create_entity_change_triggers/down.sql
new file mode 100644
index 0000000..c654ecf
--- /dev/null
+++ b/store/postgres/migrations/2018-08-16-143800_create_entity_change_triggers/down.sql
@@ -0,0 +1,15 @@
+/**************************************************************
+ * DROP TRIGGERS
+ **************************************************************/
+
+DROP TRIGGER IF EXISTS entity_added ON entities;
+DROP TRIGGER IF EXISTS entity_updated ON entities;
+DROP TRIGGER IF EXISTS entity_removed ON entities;
+
+/**************************************************************
+ * DROP FUNCTIONS
+ **************************************************************/
+
+DROP FUNCTION IF EXISTS notify_entity_added;
+DROP FUNCTION IF EXISTS notify_entity_updated;
+DROP FUNCTION IF EXISTS notify_entity_removed;
diff --git a/store/postgres/migrations/2018-08-16-143800_create_entity_change_triggers/up.sql b/store/postgres/migrations/2018-08-16-143800_create_entity_change_triggers/up.sql
new file mode 100644
index 0000000..155f205
--- /dev/null
+++ b/store/postgres/migrations/2018-08-16-143800_create_entity_change_triggers/up.sql
@@ -0,0 +1,87 @@
+/**************************************************************
+* NOTIFY ENTITY ADDED
+*
+* Emits an entity added notification over the "entity_changes"
+* notification channel.
+**************************************************************/
+
+CREATE OR REPLACE FUNCTION notify_entity_added()
+    RETURNS trigger AS
+$$
+DECLARE
+BEGIN
+    PERFORM pg_notify('entity_changes', json_build_object(
+      'subgraph_id', NEW.subgraph,
+      'entity_type', NEW.entity,
+      'entity_id', NEW.id,
+      'operation', 'added'
+    )::text);
+    RETURN NEW;
+END
+$$ LANGUAGE plpgsql;
+
+/**************************************************************
+ * NOTIFY ENTITY UPDATED
+ *
+ * Emits an entity updated notification over the "entity_changes"
+ * notification channel.
+ **************************************************************/
+
+CREATE OR REPLACE FUNCTION notify_entity_updated()
+    RETURNS trigger AS
+$$
+DECLARE
+BEGIN
+    PERFORM pg_notify('entity_changes', json_build_object(
+        'subgraph_id', NEW.subgraph,
+        'entity_type', NEW.entity,
+        'entity_id', NEW.id,
+        'operation', 'updated'
+    )::text);
+    RETURN NEW;
+END
+$$ LANGUAGE plpgsql;
+
+/**************************************************************
+ * NOTIFY ENTITY REMOVED
+ *
+ * Emits an entity removed notification over the "entity_changes"
+ * notification channel.
+ **************************************************************/
+
+CREATE OR REPLACE FUNCTION notify_entity_removed()
+    RETURNS trigger AS
+$$
+DECLARE
+BEGIN
+    PERFORM pg_notify('entity_changes', json_build_object(
+        'subgraph_id', OLD.subgraph,
+        'entity_type', OLD.entity,
+        'entity_id', OLD.id,
+        'operation', 'removed'
+    )::text);
+    RETURN NEW;
+END
+$$ LANGUAGE plpgsql;
+
+/**************************************************************
+ * CREATE TRIGGERS
+ **************************************************************/
+
+CREATE TRIGGER entity_added
+AFTER INSERT
+ON entities
+FOR EACH ROW
+EXECUTE PROCEDURE notify_entity_added();
+
+CREATE TRIGGER entity_updated
+AFTER UPDATE
+ON entities
+FOR EACH ROW
+EXECUTE PROCEDURE notify_entity_updated();
+
+CREATE TRIGGER entity_removed
+AFTER DELETE
+ON entities
+FOR EACH ROW
+EXECUTE PROCEDURE notify_entity_removed();
diff --git a/store/postgres/migrations/2018-08-22-130000_create_blockchain_tables/down.sql b/store/postgres/migrations/2018-08-22-130000_create_blockchain_tables/down.sql
new file mode 100644
index 0000000..454ee4e
--- /dev/null
+++ b/store/postgres/migrations/2018-08-22-130000_create_blockchain_tables/down.sql
@@ -0,0 +1,5 @@
+/**************************************************************
+* DROP TABLES
+**************************************************************/
+DROP TABLE ethereum_blocks;
+DROP TABLE ethereum_networks;
diff --git a/store/postgres/migrations/2018-08-22-130000_create_blockchain_tables/up.sql b/store/postgres/migrations/2018-08-22-130000_create_blockchain_tables/up.sql
new file mode 100644
index 0000000..1c861a2
--- /dev/null
+++ b/store/postgres/migrations/2018-08-22-130000_create_blockchain_tables/up.sql
@@ -0,0 +1,19 @@
+/**************************************************************
+* CREATE TABLES
+**************************************************************/
+-- Stores list of Ethereum networks (e.g. mainnet, ropsten) and optional pointer to head block
+CREATE TABLE IF NOT EXISTS ethereum_networks (
+    name VARCHAR PRIMARY KEY,
+    head_block_hash VARCHAR,
+    head_block_number BIGINT,
+    CHECK ((head_block_hash IS NULL) = (head_block_number IS NULL))
+);
+
+-- Stores block data from each Ethereum network
+CREATE TABLE IF NOT EXISTS ethereum_blocks (
+    hash VARCHAR PRIMARY KEY,
+    number BIGINT NOT NULL,
+    parent_hash VARCHAR NOT NULL,
+    network_name VARCHAR NOT NULL REFERENCES ethereum_networks (name),
+    data JSONB NOT NULL
+);
diff --git a/store/postgres/migrations/2018-08-22-140000_create_chain_head_update_procedure/down.sql b/store/postgres/migrations/2018-08-22-140000_create_chain_head_update_procedure/down.sql
new file mode 100644
index 0000000..21d1c1d
--- /dev/null
+++ b/store/postgres/migrations/2018-08-22-140000_create_chain_head_update_procedure/down.sql
@@ -0,0 +1,5 @@
+/**************************************************************
+* DROP BLOCK INGESTOR FUNCTIONS
+**************************************************************/
+
+DROP FUNCTION attempt_chain_head_update(VARCHAR, BIGINT);
diff --git a/store/postgres/migrations/2018-08-22-140000_create_chain_head_update_procedure/up.sql b/store/postgres/migrations/2018-08-22-140000_create_chain_head_update_procedure/up.sql
new file mode 100644
index 0000000..94b8ef3
--- /dev/null
+++ b/store/postgres/migrations/2018-08-22-140000_create_chain_head_update_procedure/up.sql
@@ -0,0 +1,87 @@
+/**************************************************************
+* CREATE BLOCK INGESTOR FUNCTIONS
+**************************************************************/
+
+/**************************************************************
+* Attempt to update the chain head block pointer.
+* Raises an exception if ethereum_blocks table is empty.
+**************************************************************/
+CREATE OR REPLACE FUNCTION attempt_chain_head_update(net_name VARCHAR, ancestor_count BIGINT)
+    RETURNS VARCHAR[] AS
+$$
+DECLARE
+    current_head_number BIGINT;
+    new_head_hash VARCHAR;
+    new_head_number BIGINT;
+    missing_parents VARCHAR[];
+BEGIN
+    -- Get block number of current chain head block
+    SELECT head_block_number
+    INTO STRICT current_head_number
+    FROM ethereum_networks
+    WHERE name = net_name;
+
+    -- Find candidate new chain head block
+    SELECT
+        hash,
+        number
+    INTO STRICT
+        new_head_hash,
+        new_head_number
+    FROM ethereum_blocks
+    WHERE network_name = net_name
+    ORDER BY
+        number DESC,
+        hash ASC
+    LIMIT 1;
+
+    -- Stop now if it's no better than the current chain head block
+    IF new_head_number <= current_head_number THEN
+        RETURN ARRAY[]::VARCHAR[];
+    END IF;
+
+    -- Aggregate a list of missing parent hashes into missing_parents,
+    -- selecting only parents of blocks within ancestor_count of new head.
+    --
+    -- In the common case during block ingestion, this will find only one or
+    -- zero missing parents, which causes the block ingestor to walk backwards
+    -- from the latest block, loading blocks one at a time.
+    -- A possible performance improvement in the block ingestor would be to
+    -- load blocks speculatively by number instead of by hash.
+    SELECT array_agg(block1.parent_hash)
+    INTO STRICT missing_parents
+    FROM ethereum_blocks AS block1
+    LEFT OUTER JOIN ethereum_blocks AS block2
+    ON block1.parent_hash = block2.hash
+    WHERE
+        block1.network_name = net_name
+        AND block2.hash IS NULL -- cases where no block2 was found
+        AND block1.number > (new_head_number - ancestor_count)
+        AND block1.number > 0;
+
+    -- Stop now if there are any recent blocks with missing parents
+    IF array_length(missing_parents, 1) > 0 THEN
+        RETURN missing_parents;
+    END IF;
+
+    -- No recent missing parent blocks, therefore candidate new chain head block has
+    -- the necessary minimum number of ancestors present in DB.
+
+    -- Set chain head block pointer to candidate chain head block
+    UPDATE ethereum_networks
+    SET
+        head_block_hash = new_head_hash,
+        head_block_number = new_head_number
+    WHERE name = net_name;
+
+    -- Fire chain head block update event
+    PERFORM pg_notify('chain_head_updates', json_build_object(
+        'network_name', net_name,
+        'head_block_hash', new_head_hash,
+        'head_block_number', new_head_number
+    )::text);
+
+    -- Done
+    RETURN ARRAY[]::VARCHAR[];
+END;
+$$ LANGUAGE plpgsql;
diff --git a/store/postgres/migrations/2018-08-29-120000_create_subgraphs_table/down.sql b/store/postgres/migrations/2018-08-29-120000_create_subgraphs_table/down.sql
new file mode 100644
index 0000000..790fb48
--- /dev/null
+++ b/store/postgres/migrations/2018-08-29-120000_create_subgraphs_table/down.sql
@@ -0,0 +1 @@
+DROP TABLE subgraphs;
diff --git a/store/postgres/migrations/2018-08-29-120000_create_subgraphs_table/up.sql b/store/postgres/migrations/2018-08-29-120000_create_subgraphs_table/up.sql
new file mode 100644
index 0000000..444c561
--- /dev/null
+++ b/store/postgres/migrations/2018-08-29-120000_create_subgraphs_table/up.sql
@@ -0,0 +1,10 @@
+/**************************************************************
+* CREATE TABLE
+**************************************************************/
+-- Stores list of immutable subgraphs
+CREATE TABLE IF NOT EXISTS subgraphs (
+    id VARCHAR PRIMARY KEY,
+    network_name VARCHAR NOT NULL,
+    latest_block_hash VARCHAR NOT NULL,
+    latest_block_number BIGINT NOT NULL
+);
diff --git a/store/postgres/migrations/2018-09-07-220000_create_ancestor_lookup_procedure/down.sql b/store/postgres/migrations/2018-09-07-220000_create_ancestor_lookup_procedure/down.sql
new file mode 100644
index 0000000..01a8048
--- /dev/null
+++ b/store/postgres/migrations/2018-09-07-220000_create_ancestor_lookup_procedure/down.sql
@@ -0,0 +1,4 @@
+/**************************************************************
+* DROP ANCESTOR LOOKUP FUNCTION
+**************************************************************/
+DROP FUNCTION lookup_ancestor_block(VARCHAR, BIGINT);
diff --git a/store/postgres/migrations/2018-09-07-220000_create_ancestor_lookup_procedure/up.sql b/store/postgres/migrations/2018-09-07-220000_create_ancestor_lookup_procedure/up.sql
new file mode 100644
index 0000000..c94c09a
--- /dev/null
+++ b/store/postgres/migrations/2018-09-07-220000_create_ancestor_lookup_procedure/up.sql
@@ -0,0 +1,43 @@
+/**************************************************************
+* CREATE BLOCK INGESTOR FUNCTIONS
+**************************************************************/
+/**************************************************************
+* Finds the ancestor of block_hash that is ancestor_count
+* blocks back in the blockchain.
+* Returns NULL if such a block does not exist in the database.
+**************************************************************/
+CREATE OR REPLACE FUNCTION lookup_ancestor_block(start_block_hash VARCHAR, ancestor_count BIGINT)
+    RETURNS JSONB AS
+$$
+DECLARE
+    target_block_hash VARCHAR;
+    json_blob JSONB;
+BEGIN
+    -- Follow parent hashes back the necessary number of steps to find the
+    -- target block's hash.
+    WITH RECURSIVE
+        ancestors(block_hash, block_offset)
+        AS (
+            VALUES
+                (start_block_hash, 0)
+            UNION ALL
+                SELECT ethereum_blocks.parent_hash, ancestors.block_offset+1
+                FROM ancestors, ethereum_blocks
+                WHERE
+                    ancestors.block_hash = ethereum_blocks.hash
+                    AND block_offset < ancestor_count
+        )
+        SELECT block_hash
+        INTO target_block_hash
+        FROM ancestors
+        WHERE block_offset = ancestor_count;
+
+    -- Load the JSON blob from the target block
+    SELECT data INTO json_blob
+    FROM ethereum_blocks
+    WHERE hash = target_block_hash;
+
+    -- Return
+    RETURN json_blob;
+END;
+$$ LANGUAGE plpgsql;
diff --git a/store/postgres/migrations/2018-09-18-180000_add_ethereum_network_identifiers/down.sql b/store/postgres/migrations/2018-09-18-180000_add_ethereum_network_identifiers/down.sql
new file mode 100644
index 0000000..3e2f2af
--- /dev/null
+++ b/store/postgres/migrations/2018-09-18-180000_add_ethereum_network_identifiers/down.sql
@@ -0,0 +1,7 @@
+/**************************************************************
+* REMOVE etherum_networks COLUMNS
+**************************************************************/
+
+ALTER TABLE ethereum_networks
+	DROP COLUMN net_version,
+	DROP COLUMN genesis_block_hash;
diff --git a/store/postgres/migrations/2018-09-18-180000_add_ethereum_network_identifiers/up.sql b/store/postgres/migrations/2018-09-18-180000_add_ethereum_network_identifiers/up.sql
new file mode 100644
index 0000000..8559c10
--- /dev/null
+++ b/store/postgres/migrations/2018-09-18-180000_add_ethereum_network_identifiers/up.sql
@@ -0,0 +1,8 @@
+/**************************************************************
+* ADD etherum_networks COLUMNS
+**************************************************************/
+
+ALTER TABLE ethereum_networks
+	ADD COLUMN net_version VARCHAR,
+	ADD COLUMN genesis_block_hash VARCHAR,
+	ADD CHECK ((net_version IS NULL) = (genesis_block_hash IS NULL));
diff --git a/store/postgres/migrations/2018-12-02-114100_create_subgraph_deployments_table/down.sql b/store/postgres/migrations/2018-12-02-114100_create_subgraph_deployments_table/down.sql
new file mode 100644
index 0000000..192d305
--- /dev/null
+++ b/store/postgres/migrations/2018-12-02-114100_create_subgraph_deployments_table/down.sql
@@ -0,0 +1,9 @@
+DROP TRIGGER after_deployment_insert ON subgraph_deployments;
+DROP TRIGGER after_deployment_update ON subgraph_deployments;
+DROP TRIGGER after_deployment_delete ON subgraph_deployments;
+
+DROP FUNCTION deployment_insert();
+DROP FUNCTION deployment_update();
+DROP FUNCTION deployment_delete();
+
+DROP TABLE subgraph_deployments;
diff --git a/store/postgres/migrations/2018-12-02-114100_create_subgraph_deployments_table/up.sql b/store/postgres/migrations/2018-12-02-114100_create_subgraph_deployments_table/up.sql
new file mode 100644
index 0000000..defb576
--- /dev/null
+++ b/store/postgres/migrations/2018-12-02-114100_create_subgraph_deployments_table/up.sql
@@ -0,0 +1,66 @@
+-- Maps names to immutable subgraph versions (IDs) and node IDs.
+CREATE TABLE IF NOT EXISTS subgraph_deployments (
+    deployment_name VARCHAR PRIMARY KEY,
+    subgraph_id VARCHAR UNIQUE NOT NULL,
+    node_id VARCHAR NOT NULL
+);
+
+CREATE OR REPLACE FUNCTION deployment_insert()
+    RETURNS trigger AS
+$$
+BEGIN
+    PERFORM pg_notify(CONCAT('subgraph_deployments_', NEW.node_id), json_build_object(
+        'type', 'Add',
+        'deployment_name', NEW.deployment_name,
+        'subgraph_id', NEW.subgraph_id,
+        'node_id', NEW.node_id
+    )::text);
+    RETURN NULL;
+END;
+$$ LANGUAGE plpgsql;
+
+CREATE OR REPLACE FUNCTION deployment_update()
+    RETURNS trigger AS
+$$
+BEGIN
+    PERFORM pg_notify(CONCAT('subgraph_deployments_', OLD.node_id), json_build_object(
+        'type', 'Remove',
+        'deployment_name', OLD.deployment_name,
+        'subgraph_id', OLD.subgraph_id,
+        'node_id', OLD.node_id
+    )::text);
+    PERFORM pg_notify(CONCAT('subgraph_deployments_', NEW.node_id), json_build_object(
+        'type', 'Add',
+        'deployment_name', NEW.deployment_name,
+        'subgraph_id', NEW.subgraph_id,
+        'node_id', NEW.node_id
+    )::text);
+    RETURN NULL;
+END;
+$$ LANGUAGE plpgsql;
+
+CREATE OR REPLACE FUNCTION deployment_delete()
+    RETURNS trigger AS
+$$
+BEGIN
+    PERFORM pg_notify(CONCAT('subgraph_deployments_', OLD.node_id), json_build_object(
+        'type', 'Remove',
+        'deployment_name', OLD.deployment_name,
+        'subgraph_id', OLD.subgraph_id,
+        'node_id', OLD.node_id
+    )::text);
+    RETURN NULL;
+END;
+$$ LANGUAGE plpgsql;
+
+CREATE TRIGGER after_deployment_insert
+    AFTER INSERT ON subgraph_deployments
+    FOR EACH ROW EXECUTE PROCEDURE deployment_insert();
+
+CREATE TRIGGER after_deployment_update
+    AFTER UPDATE ON subgraph_deployments
+    FOR EACH ROW EXECUTE PROCEDURE deployment_update();
+
+CREATE TRIGGER after_deployment_delete
+    AFTER DELETE ON subgraph_deployments
+    FOR EACH ROW EXECUTE PROCEDURE deployment_delete();
diff --git a/store/postgres/migrations/2018-12-03-150000_add_subgraph_cost/down.sql b/store/postgres/migrations/2018-12-03-150000_add_subgraph_cost/down.sql
new file mode 100644
index 0000000..ececcc5
--- /dev/null
+++ b/store/postgres/migrations/2018-12-03-150000_add_subgraph_cost/down.sql
@@ -0,0 +1 @@
+ALTER TABLE subgraph_deployments DROP COLUMN cost;
diff --git a/store/postgres/migrations/2018-12-03-150000_add_subgraph_cost/up.sql b/store/postgres/migrations/2018-12-03-150000_add_subgraph_cost/up.sql
new file mode 100644
index 0000000..889cecf
--- /dev/null
+++ b/store/postgres/migrations/2018-12-03-150000_add_subgraph_cost/up.sql
@@ -0,0 +1 @@
+ALTER TABLE subgraph_deployments ADD COLUMN cost DECIMAL(12, 4) NOT NULL CHECK (cost >= 0) DEFAULT 1;
diff --git a/store/postgres/migrations/2018-12-21-003727_create_attribute_indexing_procedure/down.sql b/store/postgres/migrations/2018-12-21-003727_create_attribute_indexing_procedure/down.sql
new file mode 100644
index 0000000..7f529dd
--- /dev/null
+++ b/store/postgres/migrations/2018-12-21-003727_create_attribute_indexing_procedure/down.sql
@@ -0,0 +1,9 @@
+--  DROP ATTRIBUTE INDEXING FUNCTION
+DROP FUNCTION build_attribute_index(
+  subgraph_id Text,
+  index_name Text,
+  index_type Text,
+  index_operator Text,
+  attribute_name Text,
+  entity_name Text
+);
\ No newline at end of file
diff --git a/store/postgres/migrations/2018-12-21-003727_create_attribute_indexing_procedure/up.sql b/store/postgres/migrations/2018-12-21-003727_create_attribute_indexing_procedure/up.sql
new file mode 100644
index 0000000..6f2dede
--- /dev/null
+++ b/store/postgres/migrations/2018-12-21-003727_create_attribute_indexing_procedure/up.sql
@@ -0,0 +1,33 @@
+-- Installs the pg_trgm extension for trigram indexing
+CREATE EXTENSION IF NOT EXISTS pg_trgm;
+
+-- Build a partial index for each entity-attribute
+CREATE OR REPLACE FUNCTION build_attribute_index(subgraph_id Text,index_name Text,index_type Text,index_operator Text,
+        jsonb_index Boolean, attribute_name Text,entity_name Text) RETURNS void
+LANGUAGE plpgsql
+AS $$
+DECLARE
+    jsonb_operator TEXT := '->>';
+BEGIN
+    IF jsonb_index THEN
+      jsonb_operator := '->';
+    END IF;
+    EXECUTE 'CREATE INDEX ' || index_name
+      || ' ON entities USING '
+      || index_type
+      || '((data -> '
+      || quote_literal(attribute_name)
+      || ' '
+      || jsonb_operator
+      || '''data'')'
+      || index_operator
+      || ') where subgraph='
+      || quote_literal(subgraph_id)
+      || ' and entity='
+      || quote_literal(entity_name);
+  RETURN ;
+EXCEPTION
+  WHEN duplicate_table THEN
+      -- do nothing if index already exists
+END;
+$$;
diff --git a/store/postgres/migrations/2019-01-07-120000_remove_subgraphs_deployments_tables/down.sql b/store/postgres/migrations/2019-01-07-120000_remove_subgraphs_deployments_tables/down.sql
new file mode 100644
index 0000000..2ad3a84
--- /dev/null
+++ b/store/postgres/migrations/2019-01-07-120000_remove_subgraphs_deployments_tables/down.sql
@@ -0,0 +1,79 @@
+CREATE TABLE IF NOT EXISTS subgraphs (
+    id VARCHAR PRIMARY KEY,
+    network_name VARCHAR NOT NULL,
+    latest_block_hash VARCHAR NOT NULL,
+    latest_block_number BIGINT NOT NULL
+);
+
+
+
+-- Maps names to immutable subgraph versions (IDs) and node IDs.
+CREATE TABLE IF NOT EXISTS subgraph_deployments (
+    deployment_name VARCHAR PRIMARY KEY,
+    subgraph_id VARCHAR UNIQUE NOT NULL,
+    node_id VARCHAR NOT NULL
+);
+
+CREATE OR REPLACE FUNCTION deployment_insert()
+    RETURNS trigger AS
+$$
+BEGIN
+    PERFORM pg_notify(CONCAT('subgraph_deployments_', NEW.node_id), json_build_object(
+        'type', 'Add',
+        'deployment_name', NEW.deployment_name,
+        'subgraph_id', NEW.subgraph_id,
+        'node_id', NEW.node_id
+    )::text);
+    RETURN NULL;
+END;
+$$ LANGUAGE plpgsql;
+
+CREATE OR REPLACE FUNCTION deployment_update()
+    RETURNS trigger AS
+$$
+BEGIN
+    PERFORM pg_notify(CONCAT('subgraph_deployments_', OLD.node_id), json_build_object(
+        'type', 'Remove',
+        'deployment_name', OLD.deployment_name,
+        'subgraph_id', OLD.subgraph_id,
+        'node_id', OLD.node_id
+    )::text);
+    PERFORM pg_notify(CONCAT('subgraph_deployments_', NEW.node_id), json_build_object(
+        'type', 'Add',
+        'deployment_name', NEW.deployment_name,
+        'subgraph_id', NEW.subgraph_id,
+        'node_id', NEW.node_id
+    )::text);
+    RETURN NULL;
+END;
+$$ LANGUAGE plpgsql;
+
+CREATE OR REPLACE FUNCTION deployment_delete()
+    RETURNS trigger AS
+$$
+BEGIN
+    PERFORM pg_notify(CONCAT('subgraph_deployments_', OLD.node_id), json_build_object(
+        'type', 'Remove',
+        'deployment_name', OLD.deployment_name,
+        'subgraph_id', OLD.subgraph_id,
+        'node_id', OLD.node_id
+    )::text);
+    RETURN NULL;
+END;
+$$ LANGUAGE plpgsql;
+
+CREATE TRIGGER after_deployment_insert
+    AFTER INSERT ON subgraph_deployments
+    FOR EACH ROW EXECUTE PROCEDURE deployment_insert();
+
+CREATE TRIGGER after_deployment_update
+    AFTER UPDATE ON subgraph_deployments
+    FOR EACH ROW EXECUTE PROCEDURE deployment_update();
+
+CREATE TRIGGER after_deployment_delete
+    AFTER DELETE ON subgraph_deployments
+    FOR EACH ROW EXECUTE PROCEDURE deployment_delete();
+
+
+
+ALTER TABLE subgraph_deployments ADD COLUMN cost DECIMAL(12, 4) NOT NULL CHECK (cost >= 0) DEFAULT 1;
diff --git a/store/postgres/migrations/2019-01-07-120000_remove_subgraphs_deployments_tables/up.sql b/store/postgres/migrations/2019-01-07-120000_remove_subgraphs_deployments_tables/up.sql
new file mode 100644
index 0000000..45ffadc
--- /dev/null
+++ b/store/postgres/migrations/2019-01-07-120000_remove_subgraphs_deployments_tables/up.sql
@@ -0,0 +1,22 @@
+-- Before proceeding and throwing away data, check that database version is
+-- high enough to guarantee that these tables were not in use.
+--
+-- Copy this code to a new migration and increment the db_version in the
+-- 2018-07-10-061642 migration if you need to make a non-backwards compatible
+-- change to the database schema.
+CREATE FUNCTION check_db_version() RETURNS VOID AS $$
+    DECLARE
+        version BIGINT;
+    BEGIN
+        SELECT db_version INTO STRICT version FROM db_version;
+        IF version < 2 THEN
+            RAISE EXCEPTION 'Database schemas are out of date and incompatible';
+        END IF;
+    END
+$$ LANGUAGE plpgsql;
+SELECT check_db_version();
+DROP FUNCTION check_db_version();
+
+-- Remove unused tables (this data is now stored in entities)
+DROP TABLE subgraphs;
+DROP TABLE subgraph_deployments;
diff --git a/store/postgres/migrations/2019-01-18-195346_update_history_triggers/down.sql b/store/postgres/migrations/2019-01-18-195346_update_history_triggers/down.sql
new file mode 100644
index 0000000..28ab1bd
--- /dev/null
+++ b/store/postgres/migrations/2019-01-18-195346_update_history_triggers/down.sql
@@ -0,0 +1,205 @@
+/**************************************************************
+* REVERT ENTITY_HISTORY STRUCTURE UPDATE
+*
+* Moves the op_id column back to the event_meta_data table.
+**************************************************************/
+ALTER TABLE event_meta_data
+ADD COLUMN IF NOT EXISTS op_id SMALLINT NOT NULL
+DEFAULT 3;
+
+UPDATE event_meta_data
+SET op_id = eh.op_id
+FROM entity_history eh
+JOIN event_meta_data emd
+  ON emd.id = eh.event_id;
+
+ALTER TABLE entity_history
+DROP COLUMN IF EXISTS op_id;
+
+ALTER TABLE event_meta_data
+ALTER COLUMN op_id
+DROP DEFAULT;
+
+DROP INDEX IF EXISTS entity_history_event_id_btree_idx;
+
+/**************************************************************
+* DROP TRIGGER ON INSERT, UPDATE, AND DELETE OPERATIONS
+**************************************************************/
+DROP TRIGGER after_entity_change_trigger ON entities;
+
+/**************************************************************
+* DROP ENTITY CHANGE TRIGGER FUNCTION
+**************************************************************/
+DROP FUNCTION log_entity_event();
+
+
+/**************************************************************
+* Return to earlier version of history triggers
+**************************************************************/
+
+/**************************************************************
+* LOG UPDATE
+*
+* Writes row level metadata and before & after state of `data` to entity_history
+* Called when after_update_trigger is fired.
+* Logs information after all insert, update, delete events
+* Revert events are marked with the reversion boolean field
+**************************************************************/
+CREATE OR REPLACE FUNCTION log_update()
+    RETURNS trigger AS
+$$
+DECLARE
+    event_id INTEGER;
+    new_event_id INTEGER;
+    is_reversion BOOLEAN;
+BEGIN
+    -- Sets the is_reversion variable for differentiating between Ethereum events and block reorg events
+    IF NEW.event_source = 'REVERSION' THEN
+        is_reversion := TRUE;
+    ELSE
+        is_reversion := FALSE;
+    END IF;
+
+    SELECT id INTO event_id
+    FROM event_meta_data
+    WHERE db_transaction_id = txid_current();
+
+    new_event_id := null;
+
+    IF event_id IS NULL THEN
+        -- Log information on the postgres transaction for later use in revert operations
+        INSERT INTO event_meta_data
+            (db_transaction_id, db_transaction_time, op_id, source)
+        VALUES
+            (txid_current(), statement_timestamp(), 1, NEW.event_source)
+        RETURNING event_meta_data.id INTO new_event_id;
+    END IF;
+
+    -- Log row metadata and changes, specify whether event was an original ethereum event or a reversion
+    INSERT INTO entity_history
+        (event_id, entity_id, subgraph, entity, data_before, data_after, reversion)
+    VALUES
+        (COALESCE(new_event_id, event_id), OLD.id, OLD.subgraph, OLD.entity, OLD.data, NEW.data, is_reversion);
+
+    RETURN NULL;
+END;
+$$ LANGUAGE plpgsql;
+
+/**************************************************************
+* LOG INSERT
+*
+* Writes out newly inserted entity to entity_history
+* Called when after_insert_trigger is fired.
+**************************************************************/
+CREATE OR REPLACE FUNCTION log_insert()
+    RETURNS trigger AS
+$$
+DECLARE
+    temp_event_id INTEGER;
+    event_id INTEGER;
+    new_event_id INTEGER;
+    is_reversion BOOLEAN;
+BEGIN
+    -- Sets the is_reversion variable for differentiating between Ethereum events and block reorg events
+    IF NEW.event_source = 'REVERSION' THEN
+        is_reversion := TRUE;
+    ELSE
+        is_reversion := FALSE;
+    END IF;
+
+    SELECT id INTO event_id
+    FROM event_meta_data
+    WHERE db_transaction_id = txid_current();
+
+    new_event_id := null;
+
+    IF event_id IS NULL THEN
+        -- Log information on the postgres transaction for later use in revert operations
+        INSERT INTO event_meta_data
+            (db_transaction_id, db_transaction_time, op_id, source)
+        VALUES
+            (txid_current(), statement_timestamp(), 0, NEW.event_source)
+        RETURNING event_meta_data.id INTO new_event_id;
+    END IF;
+
+    -- Log inserted row
+    INSERT INTO entity_history
+        (event_id, entity_id, subgraph, entity, data_before, data_after, reversion)
+    VALUES
+        (COALESCE(new_event_id, event_id), NEW.id, NEW.subgraph, NEW.entity, NULL, NEW.data, is_reversion);
+    RETURN NULL;
+END;
+$$ LANGUAGE plpgsql;
+
+/**************************************************************
+* LOG DELETE
+*
+* Writes deleted entity to entity_history
+* Called when after_delete_trigger is fired.
+**************************************************************/
+CREATE OR REPLACE FUNCTION log_delete()
+    RETURNS trigger AS
+$$
+DECLARE
+    event_id INTEGER;
+    current_event_source  VARCHAR;
+    new_event_id INTEGER;
+    is_reversion BOOLEAN;
+BEGIN
+    -- Use session level setting to get the event_source for the current transaction
+    current_event_source := current_setting('vars.current_event_source', TRUE);
+
+    -- Sets the is_reversion variable for differentiating between Ethereum events and block reorg events
+    IF (
+      current_event_source = 'REVERSION'
+    )
+    THEN
+        is_reversion := TRUE;
+    ELSE
+        is_reversion := FALSE;
+    END IF;
+
+    SELECT id INTO event_id
+    FROM event_meta_data
+    WHERE db_transaction_id = txid_current();
+
+    new_event_id := null;
+
+    IF event_id IS NULL THEN
+        -- Log information on the postgres transaction for later use in revert operations
+        INSERT INTO event_meta_data
+            (db_transaction_id, db_transaction_time, op_id, source)
+        VALUES
+            (txid_current(), statement_timestamp(), 2, current_event_source)
+        RETURNING event_meta_data.id INTO new_event_id;
+    END IF;
+
+    -- Log content of deleted entity
+    INSERT INTO entity_history
+        (event_id, entity_id, subgraph, entity, data_before, data_after, reversion)
+    VALUES
+        (COALESCE(new_event_id, event_id), OLD.id, OLD.subgraph, OLD.entity, OlD.data, NULL, is_reversion);
+    RETURN NULL;
+END;
+$$ LANGUAGE plpgsql;
+
+/**************************************************************
+* CREATE TRIGGERS
+**************************************************************/
+CREATE TRIGGER after_insert_trigger
+    AFTER INSERT
+    ON entities
+    FOR EACH ROW
+    EXECUTE PROCEDURE log_insert();
+
+CREATE TRIGGER after_update_trigger
+    AFTER UPDATE
+    ON entities
+    FOR EACH ROW
+    EXECUTE PROCEDURE log_update();
+
+CREATE TRIGGER after_delete_trigger
+    AFTER DELETE
+    ON entities
+    FOR EACH ROW
+    EXECUTE PROCEDURE log_delete();
diff --git a/store/postgres/migrations/2019-01-18-195346_update_history_triggers/up.sql b/store/postgres/migrations/2019-01-18-195346_update_history_triggers/up.sql
new file mode 100644
index 0000000..4ceaf86
--- /dev/null
+++ b/store/postgres/migrations/2019-01-18-195346_update_history_triggers/up.sql
@@ -0,0 +1,150 @@
+/**************************************************************
+* UPDATE HISTORY TRIGGER FUNCTIONS
+*
+* History trigger functions have been updated to store the row
+* level operation type (insert, update, or delete). Now the op_id
+* is stored in the the entity_history table (moved from event_meta_data).
+*
+* The history triggers and trigger functions have been consolidated
+* to a single function for all operations with logic to store the
+* database event differently based on which operation fired the trigger (TG_OP).
+**************************************************************/
+
+/**************************************************************
+* ALTER SCHEMA TO STORE ROW LEVEL OPERATION TYPE
+**************************************************************/
+ALTER TABLE entity_history
+ADD COLUMN IF NOT EXISTS op_id SMALLINT NOT NULL
+DEFAULT 3;
+
+ALTER TABLE event_meta_data
+DROP COLUMN IF EXISTS op_id;
+
+UPDATE entity_history
+SET op_id = 0
+WHERE data_before IS NULL;
+
+UPDATE entity_history
+SET op_id = 2
+WHERE data_after IS NULL;
+
+UPDATE entity_history
+SET op_id = 1
+WHERE data_before IS NOT NULL AND
+    data_after IS NOT NULL;
+
+ALTER TABLE entity_history
+ALTER COLUMN op_id
+DROP DEFAULT;
+
+CREATE INDEX IF NOT EXISTS entity_history_event_id_btree_idx
+ON entity_history
+USING BTREE (event_id);
+
+/**************************************************************
+* LOG ENTITY CHANGES
+*
+* Writes row level metadata and before & after state of `data` to entity_history
+* Called when after_update_trigger is fired.
+* Logs information after all insert, update, delete events
+* Revert events are marked with the reversion boolean field
+**************************************************************/
+CREATE OR REPLACE FUNCTION log_entity_event()
+    RETURNS trigger AS
+$$
+DECLARE
+    event_id INTEGER;
+    new_event_id INTEGER;
+    is_reversion BOOLEAN := FALSE;
+    operation_type INTEGER := 10;
+    event_source  VARCHAR;
+    subgraph VARCHAR;
+    entity VARCHAR;
+    entity_id VARCHAR;
+    data_before JSONB;
+    data_after JSONB;
+BEGIN
+    -- Get operation type and source
+    IF (TG_OP = 'INSERT') THEN
+        operation_type := 0;
+        event_source := NEW.event_source;
+        subgraph := NEW.subgraph;
+        entity := NEW.entity;
+        entity_id := NEW.id;
+        data_before := NULL;
+        data_after := NEW.data;
+    ELSIF (TG_OP = 'UPDATE') THEN
+        operation_type := 1;
+        event_source := NEW.event_source;
+        subgraph := OLD.subgraph;
+        entity := OLD.entity;
+        entity_id := OLD.id;
+        data_before := OLD.data;
+        data_after := NEW.data;
+    ELSIF (TG_OP = 'DELETE') THEN
+        operation_type := 2;
+        event_source := current_setting('vars.current_event_source', TRUE);
+        subgraph := OLD.subgraph;
+        entity := OLD.entity;
+        entity_id := OLD.id;
+        data_before := OLD.data;
+        data_after := NULL;
+    ELSE
+        RAISE EXCEPTION 'unexpected entity row operation type, %', TG_OP;
+    END IF;
+
+    IF event_source = 'REVERSION' THEN
+        is_reversion := TRUE;
+    END IF;
+
+    SELECT id INTO event_id
+    FROM event_meta_data
+    WHERE db_transaction_id = txid_current();
+
+    new_event_id := null;
+
+    IF event_id IS NULL THEN
+        -- Log information on the postgres transaction for later use in revert operations
+        INSERT INTO event_meta_data
+            (db_transaction_id, db_transaction_time, source)
+        VALUES
+            (txid_current(), statement_timestamp(), event_source)
+        RETURNING event_meta_data.id INTO new_event_id;
+    END IF;
+
+    -- Log row metadata and changes, specify whether event was an original ethereum event or a reversion
+    INSERT INTO entity_history
+        (event_id, entity_id, subgraph, entity, data_before, data_after, reversion, op_id)
+    VALUES
+        (COALESCE(new_event_id, event_id), entity_id, subgraph, entity, data_before, data_after, is_reversion, operation_type);
+    RETURN NULL;
+END;
+$$ LANGUAGE plpgsql;
+
+/**************************************************************
+* CREATE ENTITY CHANGE TRIGGER
+**************************************************************/
+CREATE TRIGGER after_entity_change_trigger
+    AFTER INSERT OR UPDATE OR DELETE
+    ON entities
+    FOR EACH ROW
+    EXECUTE PROCEDURE log_entity_event();
+
+
+/**************************************************************
+* DROP PREVIOUS VERSION OF HISTORY TRIGGERS
+**************************************************************/
+
+/**************************************************************
+* DROP EXISTING HISTORY TRIGGERS
+**************************************************************/
+DROP TRIGGER after_insert_trigger ON entities;
+DROP TRIGGER after_update_trigger ON entities;
+DROP TRIGGER after_delete_trigger ON entities;
+
+/**************************************************************
+* DROP EXISTING HISTORY FUNCTIONS
+**************************************************************/
+DROP FUNCTION log_insert();
+DROP FUNCTION log_update();
+DROP FUNCTION log_delete();
diff --git a/store/postgres/migrations/2019-01-18-195526_update_revert_procedures/down.sql b/store/postgres/migrations/2019-01-18-195526_update_revert_procedures/down.sql
new file mode 100644
index 0000000..857dd07
--- /dev/null
+++ b/store/postgres/migrations/2019-01-18-195526_update_revert_procedures/down.sql
@@ -0,0 +1,101 @@
+/**************************************************************
+* RETURN TO THE PREVIOUS VERSION OF REVERT PROCEDURES
+**************************************************************/
+
+/**************************************************************
+* REVERT TRANSACTION
+*
+* Get all row level events associated with a SQL transaction
+* For each row level event call revert_entity_event()
+* Parameters: event_id
+**************************************************************/
+CREATE OR REPLACE FUNCTION revert_transaction(event_id_to_revert INTEGER)
+    RETURNS VOID AS
+$$
+DECLARE
+    entity_history_row RECORD;
+BEGIN
+    -- Loop through each record change event
+    FOR entity_history_row IN
+        -- Get all entity changes driven by given event
+        SELECT
+            entity_history.id as id,
+            event_meta_data.op_id as op_id
+        FROM entity_history
+        JOIN event_meta_data ON
+            event_meta_data.id=entity_history.event_id
+        WHERE event_meta_data.id = event_id_to_revert
+        ORDER BY entity_history.id DESC
+    -- Iterate over entity changes and revert each
+    LOOP
+        PERFORM revert_entity_event(entity_history_row.id, entity_history_row.op_id);
+    END LOOP;
+END;
+$$ LANGUAGE plpgsql;
+
+/**************************************************************
+* REVERT TRANSACTION GROUP
+*
+* Get all row level events associated with a set of SQL transactions
+* For each row level event call revert_entity_event()
+* Parameters: array of event_id's
+**************************************************************/
+CREATE OR REPLACE FUNCTION revert_transaction_group(event_ids_to_revert INTEGER[])
+    RETURNS VOID AS
+$$
+DECLARE
+    entity_history_row RECORD;
+BEGIN
+    FOR entity_history_row IN
+        SELECT
+            entity_history.id as id,
+            event_meta_data.op_id as op_id
+        FROM entity_history
+        JOIN event_meta_data ON
+            event_meta_data.id=entity_history.event_id
+        WHERE event_meta_data.id = ANY(event_id_to_revert)
+        ORDER BY entity_history.id DESC
+    LOOP
+        PERFORM revert_entity_event(row.id, row.op_id);
+    END LOOP;
+END;
+$$ LANGUAGE plpgsql;
+
+/**************************************************************
+* RERUN ENTITY
+*
+* Rerun all events for a specific entity
+* avoiding any revert or uncled events
+* Parameters: entity pkey -> (entity_id, subgraph, entity)
+              event_id of revert event
+**************************************************************/
+CREATE OR REPLACE FUNCTION rerun_entity(
+    event_id_to_rerun INTEGER, subgraph_to_rerun VARCHAR, entity_to_rerun VARCHAR, entity_id_to_rerun VARCHAR)
+    RETURNS VOID AS
+$$
+DECLARE
+    entity_history_event RECORD;
+BEGIN
+     FOR entity_history_event IN
+        -- Get all events that effect given entity and come after given event
+        SELECT
+            entity_history.id as id,
+            event_meta_data.op_id as op_id
+        FROM entity_history
+        JOIN event_meta_data ON
+            event_meta_data.id = entity_history.event_id
+        WHERE (
+            entity_history.entity = entity_to_rerun AND
+            entity_history.entity_id = entity_id_to_rerun AND
+            entity_history.subgraph = subgraph_to_rerun
+            AND
+            entity_history.event_id > event_i_to_rerund
+            AND
+            entity_history.reversion = FALSE )
+        ORDER BY entity_history.id ASC
+    LOOP
+        -- For each event rerun the operation
+        PERFORM rerun_entity_history_event(entity_history_event.id, entity_history_event.op_id);
+    END LOOP;
+END;
+$$ LANGUAGE plpgsql;
diff --git a/store/postgres/migrations/2019-01-18-195526_update_revert_procedures/up.sql b/store/postgres/migrations/2019-01-18-195526_update_revert_procedures/up.sql
new file mode 100644
index 0000000..c7df30e
--- /dev/null
+++ b/store/postgres/migrations/2019-01-18-195526_update_revert_procedures/up.sql
@@ -0,0 +1,105 @@
+/**************************************************************
+* UPDATE REVERT BLOCKS PROCESS
+*
+* History trigger functions have been updated to store the row
+* level operation type (insert, update, or delete). Now it
+* is stored in the the entity_history table (moved from event_meta_data).
+*
+* Several of the revert functions have been updated to reflect the data
+* restructuring: revert transaction, revert_transaction_group, and rerun_entity.
+**************************************************************/
+
+/**************************************************************
+* REVERT TRANSACTION
+*
+* Get all row level events associated with a SQL transaction
+* For each row level event call revert_entity_event()
+* Parameters: event_id
+**************************************************************/
+CREATE OR REPLACE FUNCTION revert_transaction(event_id_to_revert INTEGER)
+    RETURNS VOID AS
+$$
+DECLARE
+    entity_history_row RECORD;
+BEGIN
+    -- Loop through each record change event
+    FOR entity_history_row IN
+        -- Get all entity changes driven by given event
+        SELECT
+            id,
+            op_id
+        FROM entity_history
+        WHERE (
+            subgraph <> 'subgraphs' AND
+            event_id = event_id_to_revert)
+        ORDER BY id DESC
+    -- Iterate over entity changes and revert each
+    LOOP
+        PERFORM revert_entity_event(entity_history_row.id, entity_history_row.op_id);
+    END LOOP;
+END;
+$$ LANGUAGE plpgsql;
+
+/**************************************************************
+* REVERT TRANSACTION GROUP
+*
+* Get all row level events associated with a set of SQL transactions
+* For each row level event call revert_entity_event()
+* Parameters: array of event_id's
+**************************************************************/
+CREATE OR REPLACE FUNCTION revert_transaction_group(event_ids_to_revert INTEGER[])
+    RETURNS VOID AS
+$$
+DECLARE
+    entity_history_row RECORD;
+BEGIN
+    FOR entity_history_row IN
+        SELECT
+            id,
+            op_id
+        FROM entity_history
+        WHERE (
+          subgraph <> 'subgraphs' AND
+          event_id = ANY(event_id_to_revert) )
+        ORDER BY id DESC
+    LOOP
+        PERFORM revert_entity_event(row.id, row.op_id);
+    END LOOP;
+END;
+$$ LANGUAGE plpgsql;
+
+
+/**************************************************************
+* RERUN ENTITY
+*
+* Rerun all events for a specific entity
+* avoiding any revert or uncled events
+* Parameters: entity pkey -> (entity_id, subgraph, entity)
+              event_id of revert event
+**************************************************************/
+CREATE OR REPLACE FUNCTION rerun_entity(
+    event_id_to_rerun INTEGER, subgraph_to_rerun VARCHAR, entity_to_rerun VARCHAR, entity_id_to_rerun VARCHAR)
+    RETURNS VOID AS
+$$
+DECLARE
+    entity_history_event RECORD;
+BEGIN
+     FOR entity_history_event IN
+        -- Get all events that effect given entity and come after given event
+        SELECT
+            id,
+            op_id
+        FROM entity_history
+        WHERE (
+            entity = entity_to_rerun AND
+            entity_id = entity_id_to_rerun AND
+            subgraph = subgraph_to_rerun AND
+            event_id > event_i_to_rerund AND
+            reversion = FALSE )
+        ORDER BY id ASC
+    LOOP
+        -- For each event rerun the operation
+        PERFORM rerun_entity_history_event(entity_history_event.id, entity_history_event.op_id);
+    END LOOP;
+END;
+$$ LANGUAGE plpgsql;
diff --git a/store/postgres/migrations/2019-02-01-045927_add_entities_indexes/down.sql b/store/postgres/migrations/2019-02-01-045927_add_entities_indexes/down.sql
new file mode 100644
index 0000000..f341b81
--- /dev/null
+++ b/store/postgres/migrations/2019-02-01-045927_add_entities_indexes/down.sql
@@ -0,0 +1,3 @@
+-- no work necessary on a down migration; we can live happily
+-- with either version of the pk index, but the up one provides
+-- better performance
diff --git a/store/postgres/migrations/2019-02-01-045927_add_entities_indexes/up.sql b/store/postgres/migrations/2019-02-01-045927_add_entities_indexes/up.sql
new file mode 100644
index 0000000..13e1fd7
--- /dev/null
+++ b/store/postgres/migrations/2019-02-01-045927_add_entities_indexes/up.sql
@@ -0,0 +1,4 @@
+-- Change the order of columns in the pk index for entities
+ALTER TABLE entities DROP CONSTRAINT entities_pkey;
+ALTER TABLE entities ADD CONSTRAINT
+  entities_pkey primary key (subgraph, entity, id);
diff --git a/store/postgres/migrations/2019-02-04-114900_remove_entity_change_triggers/down.sql b/store/postgres/migrations/2019-02-04-114900_remove_entity_change_triggers/down.sql
new file mode 100644
index 0000000..155f205
--- /dev/null
+++ b/store/postgres/migrations/2019-02-04-114900_remove_entity_change_triggers/down.sql
@@ -0,0 +1,87 @@
+/**************************************************************
+* NOTIFY ENTITY ADDED
+*
+* Emits an entity added notification over the "entity_changes"
+* notification channel.
+**************************************************************/
+
+CREATE OR REPLACE FUNCTION notify_entity_added()
+    RETURNS trigger AS
+$$
+DECLARE
+BEGIN
+    PERFORM pg_notify('entity_changes', json_build_object(
+      'subgraph_id', NEW.subgraph,
+      'entity_type', NEW.entity,
+      'entity_id', NEW.id,
+      'operation', 'added'
+    )::text);
+    RETURN NEW;
+END
+$$ LANGUAGE plpgsql;
+
+/**************************************************************
+ * NOTIFY ENTITY UPDATED
+ *
+ * Emits an entity updated notification over the "entity_changes"
+ * notification channel.
+ **************************************************************/
+
+CREATE OR REPLACE FUNCTION notify_entity_updated()
+    RETURNS trigger AS
+$$
+DECLARE
+BEGIN
+    PERFORM pg_notify('entity_changes', json_build_object(
+        'subgraph_id', NEW.subgraph,
+        'entity_type', NEW.entity,
+        'entity_id', NEW.id,
+        'operation', 'updated'
+    )::text);
+    RETURN NEW;
+END
+$$ LANGUAGE plpgsql;
+
+/**************************************************************
+ * NOTIFY ENTITY REMOVED
+ *
+ * Emits an entity removed notification over the "entity_changes"
+ * notification channel.
+ **************************************************************/
+
+CREATE OR REPLACE FUNCTION notify_entity_removed()
+    RETURNS trigger AS
+$$
+DECLARE
+BEGIN
+    PERFORM pg_notify('entity_changes', json_build_object(
+        'subgraph_id', OLD.subgraph,
+        'entity_type', OLD.entity,
+        'entity_id', OLD.id,
+        'operation', 'removed'
+    )::text);
+    RETURN NEW;
+END
+$$ LANGUAGE plpgsql;
+
+/**************************************************************
+ * CREATE TRIGGERS
+ **************************************************************/
+
+CREATE TRIGGER entity_added
+AFTER INSERT
+ON entities
+FOR EACH ROW
+EXECUTE PROCEDURE notify_entity_added();
+
+CREATE TRIGGER entity_updated
+AFTER UPDATE
+ON entities
+FOR EACH ROW
+EXECUTE PROCEDURE notify_entity_updated();
+
+CREATE TRIGGER entity_removed
+AFTER DELETE
+ON entities
+FOR EACH ROW
+EXECUTE PROCEDURE notify_entity_removed();
diff --git a/store/postgres/migrations/2019-02-04-114900_remove_entity_change_triggers/up.sql b/store/postgres/migrations/2019-02-04-114900_remove_entity_change_triggers/up.sql
new file mode 100644
index 0000000..bd4d281
--- /dev/null
+++ b/store/postgres/migrations/2019-02-04-114900_remove_entity_change_triggers/up.sql
@@ -0,0 +1,15 @@
+/**************************************************************
+ * DROP TRIGGERS
+ **************************************************************/
+
+DROP TRIGGER IF EXISTS entity_added ON entities;
+DROP TRIGGER IF EXISTS entity_updated ON entities;
+DROP TRIGGER IF EXISTS entity_removed ON entities;
+
+/**************************************************************
+ * DROP FUNCTIONS
+ **************************************************************/
+
+DROP FUNCTION IF EXISTS notify_entity_added();
+DROP FUNCTION IF EXISTS notify_entity_updated();
+DROP FUNCTION IF EXISTS notify_entity_removed();
diff --git a/store/postgres/migrations/2019-02-25-182843_add_pg_stat_statements/down.sql b/store/postgres/migrations/2019-02-25-182843_add_pg_stat_statements/down.sql
new file mode 100644
index 0000000..be80e5c
--- /dev/null
+++ b/store/postgres/migrations/2019-02-25-182843_add_pg_stat_statements/down.sql
@@ -0,0 +1 @@
+DROP EXTENSION IF EXISTS pg_stat_statements;
diff --git a/store/postgres/migrations/2019-02-25-182843_add_pg_stat_statements/up.sql b/store/postgres/migrations/2019-02-25-182843_add_pg_stat_statements/up.sql
new file mode 100644
index 0000000..ee84d62
--- /dev/null
+++ b/store/postgres/migrations/2019-02-25-182843_add_pg_stat_statements/up.sql
@@ -0,0 +1,5 @@
+-- The extension requires that the pg_stat_statements DSO is loaded
+-- via shared_preload_libraries. Luckily, this is only needed when
+-- trying to read from the pg_stat_statements view. Extension
+-- creation will succeed either way
+CREATE EXTENSION IF NOT EXISTS pg_stat_statements;
diff --git a/store/postgres/migrations/2019-02-26-182914_remove_unassigned_deployment_indexes_procedure/down.sql b/store/postgres/migrations/2019-02-26-182914_remove_unassigned_deployment_indexes_procedure/down.sql
new file mode 100644
index 0000000..4291b91
--- /dev/null
+++ b/store/postgres/migrations/2019-02-26-182914_remove_unassigned_deployment_indexes_procedure/down.sql
@@ -0,0 +1 @@
+DROP FUNCTION remove_unassigned_deployment_indexes();
diff --git a/store/postgres/migrations/2019-02-26-182914_remove_unassigned_deployment_indexes_procedure/up.sql b/store/postgres/migrations/2019-02-26-182914_remove_unassigned_deployment_indexes_procedure/up.sql
new file mode 100644
index 0000000..f041ce2
--- /dev/null
+++ b/store/postgres/migrations/2019-02-26-182914_remove_unassigned_deployment_indexes_procedure/up.sql
@@ -0,0 +1,43 @@
+-- Find all subgraphs without deployment assignments and remove their indexes
+CREATE OR REPLACE FUNCTION remove_unassigned_deployment_indexes()
+    RETURNS VOID AS
+$$
+DECLARE
+    index_to_drop RECORD;
+    counter INT := 0;
+BEGIN
+    -- Loop through each index
+    FOR index_to_drop IN
+        -- Get all indexes on subgraphs without deployment assignments
+        SELECT
+          indexname as name
+        from pg_indexes
+        where
+          -- Extract the subgraph hash from the index name (subgraph hashes are 46 characters long)
+          left(indexname,46) IN
+          (
+            -- Format the subgraph id for comparison with the index names
+            select left(lower(deployments.id),46)
+            from entities as deployments
+            left join
+              (
+                select
+                  id, entity
+                from entities
+                where
+                  subgraph='subgraphs' and
+                  entity='SubgraphDeploymentAssignment'
+              ) assigments
+            on deployments.id=assigments.id
+            where
+              deployments.subgraph='subgraphs' and
+              deployments.entity='SubgraphDeployment' and
+              assigments.id is null)
+    -- Iterate over indexes and drop each
+    LOOP
+        EXECUTE 'DROP INDEX ' || index_to_drop.name;
+        counter := counter + 1;
+    END LOOP;
+    RAISE NOTICE 'Successfully dropped % indexes', counter;
+END;
+$$ LANGUAGE plpgsql;
diff --git a/store/postgres/migrations/2019-02-26-183156_cleanup_unassigned_deployment_indexes/down.sql b/store/postgres/migrations/2019-02-26-183156_cleanup_unassigned_deployment_indexes/down.sql
new file mode 100644
index 0000000..bd43c97
--- /dev/null
+++ b/store/postgres/migrations/2019-02-26-183156_cleanup_unassigned_deployment_indexes/down.sql
@@ -0,0 +1 @@
+-- To rebuild a set of indexes simply redeploy the subgraph
diff --git a/store/postgres/migrations/2019-02-26-183156_cleanup_unassigned_deployment_indexes/up.sql b/store/postgres/migrations/2019-02-26-183156_cleanup_unassigned_deployment_indexes/up.sql
new file mode 100644
index 0000000..fa383cf
--- /dev/null
+++ b/store/postgres/migrations/2019-02-26-183156_cleanup_unassigned_deployment_indexes/up.sql
@@ -0,0 +1,2 @@
+-- Remove subgraph attribute indexes for subgraphs without a deployment assignment
+SELECT remove_unassigned_deployment_indexes();
diff --git a/store/postgres/migrations/2019-02-27-035443_create_large_notifications/down.sql b/store/postgres/migrations/2019-02-27-035443_create_large_notifications/down.sql
new file mode 100644
index 0000000..4782f0a
--- /dev/null
+++ b/store/postgres/migrations/2019-02-27-035443_create_large_notifications/down.sql
@@ -0,0 +1 @@
+drop table large_notifications;
diff --git a/store/postgres/migrations/2019-02-27-035443_create_large_notifications/up.sql b/store/postgres/migrations/2019-02-27-035443_create_large_notifications/up.sql
new file mode 100644
index 0000000..473951c
--- /dev/null
+++ b/store/postgres/migrations/2019-02-27-035443_create_large_notifications/up.sql
@@ -0,0 +1,8 @@
+create unlogged table large_notifications (
+  id serial  primary key,
+  payload    varchar not null,
+  created_at timestamp default current_timestamp not null
+);
+
+comment on table large_notifications is
+'Table for notifications whose payload is too big to send directly';
diff --git a/store/postgres/migrations/2019-02-28-190800_update_chain_head_update_procedure/down.sql b/store/postgres/migrations/2019-02-28-190800_update_chain_head_update_procedure/down.sql
new file mode 100644
index 0000000..8f6b0fd
--- /dev/null
+++ b/store/postgres/migrations/2019-02-28-190800_update_chain_head_update_procedure/down.sql
@@ -0,0 +1,85 @@
+DROP INDEX ethereum_blocks_name_number;
+
+/*
+ * Version of chain_head_update from
+ * migration 2018-08-22-140000_create_chain_head_update_procedure
+ */
+CREATE OR REPLACE FUNCTION attempt_chain_head_update(net_name VARCHAR, ancestor_count BIGINT)
+    RETURNS VARCHAR[] AS
+$$
+DECLARE
+    current_head_number BIGINT;
+    new_head_hash VARCHAR;
+    new_head_number BIGINT;
+    missing_parents VARCHAR[];
+BEGIN
+    -- Get block number of current chain head block
+    SELECT head_block_number
+    INTO STRICT current_head_number
+    FROM ethereum_networks
+    WHERE name = net_name;
+
+    -- Find candidate new chain head block
+    SELECT
+        hash,
+        number
+    INTO STRICT
+        new_head_hash,
+        new_head_number
+    FROM ethereum_blocks
+    WHERE network_name = net_name
+    ORDER BY
+        number DESC,
+        hash ASC
+    LIMIT 1;
+
+    -- Stop now if it's no better than the current chain head block
+    IF new_head_number <= current_head_number THEN
+        RETURN ARRAY[]::VARCHAR[];
+    END IF;
+
+    -- Aggregate a list of missing parent hashes into missing_parents,
+    -- selecting only parents of blocks within ancestor_count of new head.
+    --
+    -- In the common case during block ingestion, this will find only one or
+    -- zero missing parents, which causes the block ingestor to walk backwards
+    -- from the latest block, loading blocks one at a time.
+    -- A possible performance improvement in the block ingestor would be to
+    -- load blocks speculatively by number instead of by hash.
+    SELECT array_agg(block1.parent_hash)
+    INTO STRICT missing_parents
+    FROM ethereum_blocks AS block1
+    LEFT OUTER JOIN ethereum_blocks AS block2
+    ON block1.parent_hash = block2.hash
+    WHERE
+        block1.network_name = net_name
+        AND block2.hash IS NULL -- cases where no block2 was found
+        AND block1.number > (new_head_number - ancestor_count)
+        AND block1.number > 0;
+
+    -- Stop now if there are any recent blocks with missing parents
+    IF array_length(missing_parents, 1) > 0 THEN
+        RETURN missing_parents;
+    END IF;
+
+    -- No recent missing parent blocks, therefore candidate new chain head block has
+    -- the necessary minimum number of ancestors present in DB.
+
+    -- Set chain head block pointer to candidate chain head block
+    UPDATE ethereum_networks
+    SET
+        head_block_hash = new_head_hash,
+        head_block_number = new_head_number
+    WHERE name = net_name;
+
+    -- Fire chain head block update event
+    PERFORM pg_notify('chain_head_updates', json_build_object(
+        'network_name', net_name,
+        'head_block_hash', new_head_hash,
+        'head_block_number', new_head_number
+    )::text);
+
+    -- Done
+    RETURN ARRAY[]::VARCHAR[];
+END;
+$$ LANGUAGE plpgsql;
diff --git a/store/postgres/migrations/2019-02-28-190800_update_chain_head_update_procedure/up.sql b/store/postgres/migrations/2019-02-28-190800_update_chain_head_update_procedure/up.sql
new file mode 100644
index 0000000..7c12c52
--- /dev/null
+++ b/store/postgres/migrations/2019-02-28-190800_update_chain_head_update_procedure/up.sql
@@ -0,0 +1,83 @@
+CREATE INDEX ethereum_blocks_name_number ON ethereum_blocks(network_name, number);
+
+/**************************************************************
+* Replace this function with a version whose queries are
+* a lot faster.
+**************************************************************/
+CREATE OR REPLACE FUNCTION attempt_chain_head_update(net_name VARCHAR, ancestor_count BIGINT)
+    RETURNS VARCHAR[] AS
+$$
+DECLARE
+    current_head_number BIGINT;
+    new_head_hash VARCHAR;
+    new_head_number BIGINT;
+    missing_parents VARCHAR[];
+BEGIN
+    -- Find candidate new chain head block
+    SELECT
+       hash,
+       number
+    INTO
+       new_head_hash,
+       new_head_number
+    FROM ethereum_blocks b, ethereum_networks n
+    WHERE b.network_name = net_name
+      and n.name = net_name
+      and b.number > n.head_block_number
+    ORDER BY
+       number DESC,
+       hash ASC
+    LIMIT 1;
+
+    -- Stop now if it's no better than the current chain head block
+    IF new_head_hash IS NULL THEN
+        RETURN ARRAY[]::VARCHAR[];
+    END IF;
+
+    -- Aggregate a list of missing parent hashes into missing_parents,
+    -- selecting only parents of blocks within ancestor_count of new head.
+    --
+    -- In the common case during block ingestion, this will find only one or
+    -- zero missing parents, which causes the block ingestor to walk backwards
+    -- from the latest block, loading blocks one at a time.
+    -- A possible performance improvement in the block ingestor would be to
+    -- load blocks speculatively by number instead of by hash.
+    WITH head AS
+        (SELECT hash,
+                parent_hash,
+                (number = (new_head_number - ancestor_count)) as last
+           FROM ethereum_blocks
+          WHERE network_name = net_name
+            AND number >= GREATEST(new_head_number - ancestor_count, 0))
+    SELECT array_agg(h1.parent_hash)
+      INTO STRICT missing_parents
+      FROM head h1
+     WHERE not h1.last
+       AND NOT EXISTS (SELECT 1 FROM head h2 WHERE h1.parent_hash = h2.hash);
+
+    -- Stop now if there are any recent blocks with missing parents
+    IF array_length(missing_parents, 1) > 0 THEN
+        RETURN missing_parents;
+    END IF;
+
+    -- No recent missing parent blocks, therefore candidate new chain head block has
+    -- the necessary minimum number of ancestors present in DB.
+
+    -- Set chain head block pointer to candidate chain head block
+    UPDATE ethereum_networks
+    SET
+        head_block_hash = new_head_hash,
+        head_block_number = new_head_number
+    WHERE name = net_name;
+
+    -- Fire chain head block update event
+    PERFORM pg_notify('chain_head_updates', json_build_object(
+        'network_name', net_name,
+        'head_block_hash', new_head_hash,
+        'head_block_number', new_head_number
+    )::text);
+
+    -- Done
+    RETURN ARRAY[]::VARCHAR[];
+END;
+$$ LANGUAGE plpgsql;
diff --git a/store/postgres/migrations/2019-03-04-235349_empty-ethereum-network-chain-head-update-fix/down.sql b/store/postgres/migrations/2019-03-04-235349_empty-ethereum-network-chain-head-update-fix/down.sql
new file mode 100644
index 0000000..e06862d
--- /dev/null
+++ b/store/postgres/migrations/2019-03-04-235349_empty-ethereum-network-chain-head-update-fix/down.sql
@@ -0,0 +1,81 @@
+/*
+ * Version of chain_head_update from
+ * migration 2019-02-28-190800_update_chain_head_update_procedure
+ */
+CREATE OR REPLACE FUNCTION attempt_chain_head_update(net_name VARCHAR, ancestor_count BIGINT)
+    RETURNS VARCHAR[] AS
+$$
+DECLARE
+    current_head_number BIGINT;
+    new_head_hash VARCHAR;
+    new_head_number BIGINT;
+    missing_parents VARCHAR[];
+BEGIN
+    -- Find candidate new chain head block
+    SELECT
+       hash,
+       number
+    INTO
+       new_head_hash,
+       new_head_number
+    FROM ethereum_blocks b, ethereum_networks n
+    WHERE b.network_name = net_name
+      and n.name = net_name
+      and b.number > n.head_block_number
+    ORDER BY
+       number DESC,
+       hash ASC
+    LIMIT 1;
+
+    -- Stop now if it's no better than the current chain head block
+    IF new_head_hash IS NULL THEN
+        RETURN ARRAY[]::VARCHAR[];
+    END IF;
+
+    -- Aggregate a list of missing parent hashes into missing_parents,
+    -- selecting only parents of blocks within ancestor_count of new head.
+    --
+    -- In the common case during block ingestion, this will find only one or
+    -- zero missing parents, which causes the block ingestor to walk backwards
+    -- from the latest block, loading blocks one at a time.
+    -- A possible performance improvement in the block ingestor would be to
+    -- load blocks speculatively by number instead of by hash.
+    WITH head AS
+        (SELECT hash,
+                parent_hash,
+                (number = (new_head_number - ancestor_count)) as last
+           FROM ethereum_blocks
+          WHERE network_name = net_name
+            AND number >= GREATEST(new_head_number - ancestor_count, 0))
+    SELECT array_agg(h1.parent_hash)
+      INTO STRICT missing_parents
+      FROM head h1
+     WHERE not h1.last
+       AND NOT EXISTS (SELECT 1 FROM head h2 WHERE h1.parent_hash = h2.hash);
+
+    -- Stop now if there are any recent blocks with missing parents
+    IF array_length(missing_parents, 1) > 0 THEN
+        RETURN missing_parents;
+    END IF;
+
+    -- No recent missing parent blocks, therefore candidate new chain head block has
+    -- the necessary minimum number of ancestors present in DB.
+
+    -- Set chain head block pointer to candidate chain head block
+    UPDATE ethereum_networks
+    SET
+        head_block_hash = new_head_hash,
+        head_block_number = new_head_number
+    WHERE name = net_name;
+
+    -- Fire chain head block update event
+    PERFORM pg_notify('chain_head_updates', json_build_object(
+        'network_name', net_name,
+        'head_block_hash', new_head_hash,
+        'head_block_number', new_head_number
+    )::text);
+
+    -- Done
+    RETURN ARRAY[]::VARCHAR[];
+END;
+$$ LANGUAGE plpgsql;
diff --git a/store/postgres/migrations/2019-03-04-235349_empty-ethereum-network-chain-head-update-fix/up.sql b/store/postgres/migrations/2019-03-04-235349_empty-ethereum-network-chain-head-update-fix/up.sql
new file mode 100644
index 0000000..7456ea2
--- /dev/null
+++ b/store/postgres/migrations/2019-03-04-235349_empty-ethereum-network-chain-head-update-fix/up.sql
@@ -0,0 +1,78 @@
+CREATE OR REPLACE FUNCTION attempt_chain_head_update(net_name VARCHAR, ancestor_count BIGINT)
+    RETURNS VARCHAR[] AS
+$$
+DECLARE
+    current_head_number BIGINT;
+    new_head_hash VARCHAR;
+    new_head_number BIGINT;
+    missing_parents VARCHAR[];
+BEGIN
+    -- Find candidate new chain head block
+    SELECT
+       hash,
+       number
+    INTO
+       new_head_hash,
+       new_head_number
+    FROM ethereum_blocks b, ethereum_networks n
+    WHERE b.network_name = net_name
+      and n.name = net_name
+      --- Handle the case where ethereum_networks has a NULL head_block_number
+      and b.number > coalesce(n.head_block_number, -1)
+    ORDER BY
+       number DESC,
+       hash ASC
+    LIMIT 1;
+
+    -- Stop now if it's no better than the current chain head block
+    IF new_head_hash IS NULL THEN
+        RETURN ARRAY[]::VARCHAR[];
+    END IF;
+
+    -- Aggregate a list of missing parent hashes into missing_parents,
+    -- selecting only parents of blocks within ancestor_count of new head.
+    --
+    -- In the common case during block ingestion, this will find only one or
+    -- zero missing parents, which causes the block ingestor to walk backwards
+    -- from the latest block, loading blocks one at a time.
+    -- A possible performance improvement in the block ingestor would be to
+    -- load blocks speculatively by number instead of by hash.
+    WITH head AS
+        (SELECT hash,
+                parent_hash,
+                (number = (new_head_number - ancestor_count)) as last
+           FROM ethereum_blocks
+          WHERE network_name = net_name
+            AND number >= GREATEST(new_head_number - ancestor_count, 0))
+    SELECT array_agg(h1.parent_hash)
+      INTO STRICT missing_parents
+      FROM head h1
+     WHERE not h1.last
+       AND NOT EXISTS (SELECT 1 FROM head h2 WHERE h1.parent_hash = h2.hash);
+
+    -- Stop now if there are any recent blocks with missing parents
+    IF array_length(missing_parents, 1) > 0 THEN
+        RETURN missing_parents;
+    END IF;
+
+    -- No recent missing parent blocks, therefore candidate new chain head block has
+    -- the necessary minimum number of ancestors present in DB.
+
+    -- Set chain head block pointer to candidate chain head block
+    UPDATE ethereum_networks
+    SET
+        head_block_hash = new_head_hash,
+        head_block_number = new_head_number
+    WHERE name = net_name;
+
+    -- Fire chain head block update event
+    PERFORM pg_notify('chain_head_updates', json_build_object(
+        'network_name', net_name,
+        'head_block_hash', new_head_hash,
+        'head_block_number', new_head_number
+    )::text);
+
+    -- Done
+    RETURN ARRAY[]::VARCHAR[];
+END;
+$$ LANGUAGE plpgsql;
diff --git a/store/postgres/migrations/2019-03-07-171355_update_history_storage/down.sql b/store/postgres/migrations/2019-03-07-171355_update_history_storage/down.sql
new file mode 100644
index 0000000..a57075e
--- /dev/null
+++ b/store/postgres/migrations/2019-03-07-171355_update_history_storage/down.sql
@@ -0,0 +1,126 @@
+CREATE OR REPLACE FUNCTION revert_entity_event(entity_history_id INTEGER, operation_id INTEGER)
+    RETURNS VOID AS
+$$
+DECLARE
+    target_entity_id VARCHAR;
+    target_subgraph VARCHAR;
+    target_entity VARCHAR;
+    target_data_before JSONB;
+    reversion_identifier VARCHAR;
+BEGIN
+    -- Get entity history event information and save into the declared variables
+    SELECT
+        entity_id,
+        subgraph,
+        entity,
+        data_before
+    INTO
+        target_entity_id,
+        target_subgraph,
+        target_entity,
+        target_data_before
+    FROM entity_history
+    WHERE entity_history.id = entity_history_id;
+
+    reversion_identifier := 'REVERSION';
+
+    CASE
+        -- INSERT case
+        WHEN operation_id = 0 THEN
+            -- Delete inserted row
+            BEGIN
+                PERFORM set_config('vars.current_event_source', 'REVERSION', FALSE);
+                EXECUTE
+                    'DELETE FROM entities WHERE (
+                        subgraph = $1 AND
+                        entity = $2 AND
+                        id = $3)'
+                USING target_subgraph, target_entity, target_entity_id;
+
+                -- Row was already updated
+                EXCEPTION
+                    WHEN no_data_found THEN
+                        NULL;
+            END;
+
+        -- UPDATE or DELETE case
+        WHEN operation_id IN (1,2) THEN
+            -- Insert deleted row if not exists
+            -- If row exists perform update
+            BEGIN
+                EXECUTE
+                    'INSERT INTO entities (id, subgraph, entity, data, event_source)
+                        VALUES ($1, $2, $3, $4, $5)
+                        ON CONFLICT (id, subgraph, entity) DO UPDATE
+                        SET data = $4, event_source = $5'
+                USING
+                    target_entity_id,
+                    target_subgraph,
+                    target_entity,
+                    target_data_before,
+                    reversion_identifier;
+            END;
+    END CASE;
+END;
+$$ LANGUAGE plpgsql;
+
+CREATE OR REPLACE FUNCTION revert_transaction(event_id_to_revert INTEGER)
+    RETURNS VOID AS
+$$
+DECLARE
+    entity_history_row RECORD;
+BEGIN
+    -- Loop through each record change event
+    FOR entity_history_row IN
+        -- Get all entity changes driven by given event
+        SELECT
+            id,
+            op_id
+        FROM entity_history
+        WHERE (
+            subgraph <> 'subgraphs' AND
+            event_id = event_id_to_revert)
+        ORDER BY id DESC
+    -- Iterate over entity changes and revert each
+    LOOP
+        PERFORM revert_entity_event(entity_history_row.id, entity_history_row.op_id);
+    END LOOP;
+END;
+$$ LANGUAGE plpgsql;
+
+CREATE OR REPLACE FUNCTION revert_block(block_to_revert_hash VARCHAR, block_to_revert_number BIGINT, target_block_hash VARCHAR, subgraph_id VARCHAR)
+    RETURNS VOID AS
+$$
+DECLARE
+    event_row RECORD;
+    entity_row RECORD;
+BEGIN
+    -- Revert all relevant events
+    FOR event_row IN
+        -- Get all events associated with the given block
+        SELECT
+            entity_history.event_id AS event_id
+        FROM entity_history
+        JOIN event_meta_data ON
+            entity_history.event_id = event_meta_data.id
+        WHERE event_meta_data.source = block_to_revert_hash AND
+            entity_history.subgraph = subgraph_id
+        GROUP BY
+            entity_history.event_id
+        ORDER BY entity_history.event_id DESC
+    LOOP
+        PERFORM revert_transaction(event_row.event_id::integer);
+    END LOOP;
+END;
+$$ LANGUAGE plpgsql;
+
+DROP VIEW entity_history_with_source;
+
+DROP TRIGGER IF EXISTS entity_change_insert_trigger ON entities;
+DROP TRIGGER IF EXISTS entity_change_update_trigger ON entities;
+DROP TRIGGER IF EXISTS entity_change_delete_trigger ON entities;
+CREATE TRIGGER after_entity_change_trigger
+  AFTER INSERT OR UPDATE OR DELETE
+  ON entities
+  FOR EACH ROW
+  EXECUTE PROCEDURE log_entity_event();
diff --git a/store/postgres/migrations/2019-03-07-171355_update_history_storage/up.sql b/store/postgres/migrations/2019-03-07-171355_update_history_storage/up.sql
new file mode 100644
index 0000000..069c76c
--- /dev/null
+++ b/store/postgres/migrations/2019-03-07-171355_update_history_storage/up.sql
@@ -0,0 +1,107 @@
+-- Change log_entity_event such that we do not record history entries for
+-- the 'subgraphs' subgraph and for operations that don't actually change
+-- the data of an entity
+drop trigger if exists after_entity_change_trigger on entities;
+
+create trigger entity_change_insert_trigger
+  after insert on entities
+  for each row
+  when (new.subgraph != 'subgraphs')
+  execute procedure log_entity_event();
+
+create trigger entity_change_update_trigger
+  after update on entities
+  for each row
+  when (old.subgraph != 'subgraphs' and old.data != new.data)
+  execute procedure log_entity_event();
+
+create trigger entity_change_delete_trigger
+  after delete on entities
+  for each row
+  when (old.subgraph != 'subgraphs')
+  execute procedure log_entity_event();
+
+-- Create a view to get entity_history by source ordered by event_id desc
+-- We use this both in revert_block and in the Rust code in
+-- store_events.get_revert_event
+create or replace view entity_history_with_source as
+select
+  h.subgraph,
+  h.entity,
+  h.entity_id,
+  h.data_before,
+  h.op_id,
+  m.source
+from entity_history h, event_meta_data m
+where h.event_id = m.id
+order by h.event_id desc;
+
+-- Rewrite revert_block to be selfcontained and to get all the information
+-- needed for reversion in one query
+create or replace function
+  revert_block(block_to_revert_hash VARCHAR,
+               subgraph_id VARCHAR)
+    returns void as
+$$
+declare
+    history record;
+begin
+    -- Revert all relevant events
+    for history in
+        -- Get all history entries associated with the given block. Note
+        -- that the view imposes the correct order
+    select
+        h.entity,
+        h.entity_id,
+        h.data_before,
+        h.op_id
+    from entity_history_with_source h
+    where h.source = block_to_revert_hash
+      and h.subgraph = subgraph_id
+    loop
+        case
+            -- insert case
+            when history.op_id = 0 then
+                -- Delete inserted row
+            begin
+                perform set_config('vars.current_event_source',
+                                   'REVERSION', false);
+                delete from entities
+                 where subgraph = subgraph_id
+                   and entity = history.entity
+                   and id = history.entity_id;
+                -- Row was already updated
+            exception when no_data_found then
+              -- do nothing, the entity was gone already
+            end;
+            -- update or delete case
+            when history.op_id IN (1,2) then
+                -- Insert deleted row if not exists
+                -- If row exists perform update
+                begin
+                     insert into entities
+                                 (id, subgraph, entity, data, event_source)
+                     values (history.entity_id,
+                             subgraph_id,
+                             history.entity,
+                             history.data_before,
+                             'REVERSION')
+                     on conflict (id, subgraph, entity)
+                     do update
+                           set data = history.data_before,
+                               event_source = 'REVERSION';
+            end;
+        end case;
+    end loop;
+end;
+$$ language plpgsql;
+
+-- remove unused stored procs
+drop function if exists revert_transaction();
+drop function if exists revert_entity_event();
+
+-- remove some old, never used procs while we are at it
+drop function if exists revert_block_group();
+drop function if exists revert_transaction_group();
+drop function if exists rerun_entity();
+drop function if exists rerun_entity_history_event();
diff --git a/store/postgres/migrations/2019-03-28-004319_drop_entities_id_indexes/down.sql b/store/postgres/migrations/2019-03-28-004319_drop_entities_id_indexes/down.sql
new file mode 100644
index 0000000..291a97c
--- /dev/null
+++ b/store/postgres/migrations/2019-03-28-004319_drop_entities_id_indexes/down.sql
@@ -0,0 +1 @@
+-- This file should undo anything in `up.sql`
\ No newline at end of file
diff --git a/store/postgres/migrations/2019-03-28-004319_drop_entities_id_indexes/up.sql b/store/postgres/migrations/2019-03-28-004319_drop_entities_id_indexes/up.sql
new file mode 100644
index 0000000..5274790
--- /dev/null
+++ b/store/postgres/migrations/2019-03-28-004319_drop_entities_id_indexes/up.sql
@@ -0,0 +1,26 @@
+-- Remove indexes on entities for data->'id'->>'data'
+create or replace function remove_entities_id_indexes()
+    returns void as
+$$
+declare
+    index_to_drop record;
+    counter int := 0;
+begin
+    for index_to_drop in
+        select
+          indexname as name
+        from pg_indexes
+       where tablename = 'entities'
+         and indexname like 'qm%'
+         and indexdef like '%ON public.entities USING btree ((((data -> ''id''::text) ->> ''data''::text))) WHERE%'
+    loop
+        execute 'drop index ' || index_to_drop.name;
+        counter := counter + 1;
+    end loop;
+    raise notice 'Successfully dropped % indexes', counter;
+end;
+$$ language plpgsql;
+
+select remove_entities_id_indexes();
+
+drop function remove_entities_id_indexes();
diff --git a/store/postgres/migrations/2019-03-31-010824_short_chain_head_update/down.sql b/store/postgres/migrations/2019-03-31-010824_short_chain_head_update/down.sql
new file mode 100644
index 0000000..f07588d
--- /dev/null
+++ b/store/postgres/migrations/2019-03-31-010824_short_chain_head_update/down.sql
@@ -0,0 +1,81 @@
+-- Restore attempt_chain_head_update to the state it had with migration
+-- 2019-03-04-235349_empty-ethereum-network-chain-head-update-fix
+-- (commit c9dbb2b9)
+CREATE OR REPLACE FUNCTION attempt_chain_head_update(net_name VARCHAR, ancestor_count BIGINT)
+    RETURNS VARCHAR[] AS
+$$
+DECLARE
+    current_head_number BIGINT;
+    new_head_hash VARCHAR;
+    new_head_number BIGINT;
+    missing_parents VARCHAR[];
+BEGIN
+    -- Find candidate new chain head block
+    SELECT
+       hash,
+       number
+    INTO
+       new_head_hash,
+       new_head_number
+    FROM ethereum_blocks b, ethereum_networks n
+    WHERE b.network_name = net_name
+      and n.name = net_name
+      --- Handle the case where ethereum_networks has a NULL head_block_number
+      and b.number > coalesce(n.head_block_number, -1)
+    ORDER BY
+       number DESC,
+       hash ASC
+    LIMIT 1;
+
+    -- Stop now if it's no better than the current chain head block
+    IF new_head_hash IS NULL THEN
+        RETURN ARRAY[]::VARCHAR[];
+    END IF;
+
+    -- Aggregate a list of missing parent hashes into missing_parents,
+    -- selecting only parents of blocks within ancestor_count of new head.
+    --
+    -- In the common case during block ingestion, this will find only one or
+    -- zero missing parents, which causes the block ingestor to walk backwards
+    -- from the latest block, loading blocks one at a time.
+    -- A possible performance improvement in the block ingestor would be to
+    -- load blocks speculatively by number instead of by hash.
+    WITH head AS
+        (SELECT hash,
+                parent_hash,
+                (number = (new_head_number - ancestor_count)) as last
+           FROM ethereum_blocks
+          WHERE network_name = net_name
+            AND number >= GREATEST(new_head_number - ancestor_count, 0))
+    SELECT array_agg(h1.parent_hash)
+      INTO STRICT missing_parents
+      FROM head h1
+     WHERE not h1.last
+       AND NOT EXISTS (SELECT 1 FROM head h2 WHERE h1.parent_hash = h2.hash);
+
+    -- Stop now if there are any recent blocks with missing parents
+    IF array_length(missing_parents, 1) > 0 THEN
+        RETURN missing_parents;
+    END IF;
+
+    -- No recent missing parent blocks, therefore candidate new chain head block has
+    -- the necessary minimum number of ancestors present in DB.
+
+    -- Set chain head block pointer to candidate chain head block
+    UPDATE ethereum_networks
+    SET
+        head_block_hash = new_head_hash,
+        head_block_number = new_head_number
+    WHERE name = net_name;
+
+    -- Fire chain head block update event
+    PERFORM pg_notify('chain_head_updates', json_build_object(
+        'network_name', net_name,
+        'head_block_hash', new_head_hash,
+        'head_block_number', new_head_number
+    )::text);
+
+    -- Done
+    RETURN ARRAY[]::VARCHAR[];
+END;
+$$ LANGUAGE plpgsql;
diff --git a/store/postgres/migrations/2019-03-31-010824_short_chain_head_update/up.sql b/store/postgres/migrations/2019-03-31-010824_short_chain_head_update/up.sql
new file mode 100644
index 0000000..f08d6af
--- /dev/null
+++ b/store/postgres/migrations/2019-03-31-010824_short_chain_head_update/up.sql
@@ -0,0 +1,96 @@
+-- Fix attempt_chain_head_update for short chains (chains shorter than
+-- ancestor_count many blocks)
+CREATE OR REPLACE FUNCTION attempt_chain_head_update(net_name VARCHAR, ancestor_count BIGINT)
+    RETURNS VARCHAR[] AS
+$$
+DECLARE
+    current_head_number BIGINT;
+    new_head_hash VARCHAR;
+    new_head_number BIGINT;
+    genesis_hash VARCHAR;
+    missing_parents VARCHAR[];
+BEGIN
+    -- Find candidate new chain head block
+    SELECT
+       hash,
+       number,
+       genesis_block_hash
+    INTO
+       new_head_hash,
+       new_head_number,
+       genesis_hash
+    FROM ethereum_blocks b, ethereum_networks n
+    WHERE b.network_name = net_name
+      and n.name = net_name
+      --- Handle the case where ethereum_networks has a NULL head_block_number
+      and b.number > coalesce(n.head_block_number, -1)
+    ORDER BY
+       number DESC,
+       hash ASC
+    LIMIT 1;
+
+    -- Stop now if it's no better than the current chain head block
+    IF new_head_hash IS NULL THEN
+        RETURN ARRAY[]::VARCHAR[];
+    END IF;
+
+    -- Aggregate a list of missing parent hashes into missing_parents,
+    -- selecting only parents of blocks within ancestor_count of new head.
+    --
+    -- In the common case during block ingestion, this will find only one or
+    -- zero missing parents, which causes the block ingestor to walk backwards
+    -- from the latest block, loading blocks one at a time.
+    -- A possible performance improvement in the block ingestor would be to
+    -- load blocks speculatively by number instead of by hash.
+    --
+    -- We build a list of ancestor_count (hash, parent_hash) tuples and
+    -- check that for each mention of a parent_hash in a tuple (_, h1)
+    -- there is also a tuple that has that in the hash position, i.e. that
+    -- we have a tuple (h1, _) That can of course not work for the last
+    -- tuple in the chain. We therefore mark it with 'last = t' (all the
+    -- others will have 'last = f') and do not try to find its parent, or
+    -- report its parent as missing. We can tell this last tuple because it
+    -- is either the one with number 'new_head_number - ancestor_count',
+    -- or, if the chain has fewer than ancestor_count blocks, the genesis
+    -- block. The latter can happen for chains from ganache which are
+    -- generally very short (say 8 blocks or so)
+    WITH head AS
+        (SELECT hash,
+                parent_hash,
+                (number = (new_head_number - ancestor_count)
+                 or hash = genesis_hash) as last
+           FROM ethereum_blocks
+          WHERE network_name = net_name
+            AND number >= GREATEST(new_head_number - ancestor_count, 0))
+    SELECT array_agg(h1.parent_hash)
+      INTO STRICT missing_parents
+      FROM head h1
+     WHERE not h1.last
+       AND NOT EXISTS (SELECT 1 FROM head h2 WHERE h1.parent_hash = h2.hash);
+
+    -- Stop now if there are any recent blocks with missing parents
+    IF array_length(missing_parents, 1) > 0 THEN
+        RETURN missing_parents;
+    END IF;
+
+    -- No recent missing parent blocks, therefore candidate new chain head block has
+    -- the necessary minimum number of ancestors present in DB.
+
+    -- Set chain head block pointer to candidate chain head block
+    UPDATE ethereum_networks
+    SET
+        head_block_hash = new_head_hash,
+        head_block_number = new_head_number
+    WHERE name = net_name;
+
+    -- Fire chain head block update event
+    PERFORM pg_notify('chain_head_updates', json_build_object(
+        'network_name', net_name,
+        'head_block_hash', new_head_hash,
+        'head_block_number', new_head_number
+    )::text);
+
+    -- Done
+    RETURN ARRAY[]::VARCHAR[];
+END;
+$$ LANGUAGE plpgsql;
diff --git a/store/postgres/migrations/2019-04-19-171709_split_entities/down.sql b/store/postgres/migrations/2019-04-19-171709_split_entities/down.sql
new file mode 100644
index 0000000..af32f5e
--- /dev/null
+++ b/store/postgres/migrations/2019-04-19-171709_split_entities/down.sql
@@ -0,0 +1,27 @@
+insert into public.entities(subgraph, entity, id, data, event_source)
+select 'subgraphs', entity, id, data, event_source
+from subgraphs.entities;
+
+
+create or replace function drop_schemas() returns void
+language plpgsql
+as $function$
+declare
+  schema_name varchar;
+begin
+  for schema_name in
+  select name from deployment_schemas
+  loop
+    execute 'drop schema ' || schema_name || ' cascade';
+  end loop;
+end
+$function$;
+
+select drop_schemas();
+
+drop table deployment_schemas;
+
+drop function drop_schemas();
+
+drop function if exists subgraph_log_entity_event();
+drop function if exists subgraph_revert_block(varchar, varchar);
diff --git a/store/postgres/migrations/2019-04-19-171709_split_entities/up.sql b/store/postgres/migrations/2019-04-19-171709_split_entities/up.sql
new file mode 100644
index 0000000..a1ec6df
--- /dev/null
+++ b/store/postgres/migrations/2019-04-19-171709_split_entities/up.sql
@@ -0,0 +1,106 @@
+-- metadata to track the DB schemas we create for subgraph deployments
+
+-- The name of the DB schema corresponding to a deployment
+create table deployment_schemas(
+  id         serial primary key,
+  subgraph   varchar unique not null,
+  name       varchar not null default 'sgd' || currval('deployment_schemas_id_seq')
+);
+
+insert into deployment_schemas(id, subgraph, name)
+  values(0, 'subgraphs', 'subgraphs');
+
+-- Schema for the subgraph of subgraphs
+-- Note that this schema does not have a entity_history table
+-- because we do not collect history for the subgraph of subgraphs
+create schema subgraphs;
+
+create table subgraphs.entities (
+  entity       varchar not null,
+  id           varchar not null,
+  data         jsonb,
+  event_source varchar not null,
+  primary key(entity, id)
+);
+
+insert into subgraphs.entities
+  select entity, id, data, event_source
+  from public.entities
+  where subgraph='subgraphs';
+
+delete from public.entities
+  where subgraph='subgraphs';
+
+--
+-- Log entity history into sgdN.entities (without a subgraph field)
+--
+CREATE OR REPLACE FUNCTION public.subgraph_log_entity_event()
+ RETURNS trigger
+ LANGUAGE plpgsql
+AS $function$
+DECLARE
+    event_id INTEGER;
+    new_event_id INTEGER;
+    is_reversion BOOLEAN := FALSE;
+    operation_type INTEGER := 10;
+    event_source  VARCHAR;
+    entity VARCHAR;
+    entity_id VARCHAR;
+    data_before JSONB;
+BEGIN
+    -- Get operation type and source
+    IF (TG_OP = 'INSERT') THEN
+        operation_type := 0;
+        event_source := NEW.event_source;
+        entity := NEW.entity;
+        entity_id := NEW.id;
+        data_before := NULL;
+    ELSIF (TG_OP = 'UPDATE') THEN
+        operation_type := 1;
+        event_source := NEW.event_source;
+        entity := OLD.entity;
+        entity_id := OLD.id;
+        data_before := OLD.data;
+    ELSIF (TG_OP = 'DELETE') THEN
+        operation_type := 2;
+        event_source := current_setting('vars.current_event_source', TRUE);
+        entity := OLD.entity;
+        entity_id := OLD.id;
+        data_before := OLD.data;
+    ELSE
+        RAISE EXCEPTION 'unexpected entity row operation type, %', TG_OP;
+    END IF;
+
+    IF event_source = 'REVERSION' THEN
+        is_reversion := TRUE;
+    END IF;
+
+    SELECT id INTO event_id
+    FROM event_meta_data
+    WHERE db_transaction_id = txid_current();
+
+    new_event_id := null;
+
+    IF event_id IS NULL THEN
+        -- Log information on the postgres transaction for later use in
+        -- revert operations
+        INSERT INTO event_meta_data
+            (db_transaction_id, db_transaction_time, source)
+        VALUES
+            (txid_current(), statement_timestamp(), event_source)
+        RETURNING event_meta_data.id INTO new_event_id;
+    END IF;
+
+    -- Log row metadata and changes, specify whether event was an original
+    -- ethereum event or a reversion
+    EXECUTE format('INSERT INTO %I.entity_history
+        (event_id, entity_id, entity,
+         data_before, reversion, op_id)
+      VALUES
+        ($1, $2, $3, $4, $5, $6)', TG_TABLE_SCHEMA)
+    USING COALESCE(new_event_id, event_id), entity_id, entity,
+          data_before, is_reversion, operation_type;
+    RETURN NULL;
+END;
+$function$
+;
diff --git a/store/postgres/migrations/2019-04-22-190022_remove_unneeded_stored_procs/down.sql b/store/postgres/migrations/2019-04-22-190022_remove_unneeded_stored_procs/down.sql
new file mode 100644
index 0000000..e1c2a42
--- /dev/null
+++ b/store/postgres/migrations/2019-04-22-190022_remove_unneeded_stored_procs/down.sql
@@ -0,0 +1,88 @@
+CREATE OR REPLACE FUNCTION build_attribute_index(subgraph_id text, index_name text, index_type text, index_operator text, jsonb_index boolean, attribute_name text, entity_name text)
+ RETURNS void
+ LANGUAGE plpgsql
+AS $function$
+DECLARE
+    jsonb_operator TEXT := '->>';
+BEGIN
+    IF jsonb_index THEN
+      jsonb_operator := '->';
+    END IF;
+    EXECUTE 'CREATE INDEX ' || index_name
+      || ' ON entities USING '
+      || index_type
+      || '((data -> '
+      || quote_literal(attribute_name)
+      || ' '
+      || jsonb_operator
+      || '''data'')'
+      || index_operator
+      || ') where subgraph='
+      || quote_literal(subgraph_id)
+      || ' and entity='
+      || quote_literal(entity_name);
+  RETURN ;
+EXCEPTION
+  WHEN duplicate_table THEN
+      -- do nothing if index already exists
+END;
+$function$
+;
+
+CREATE OR REPLACE FUNCTION public.revert_block(block_to_revert_hash character varying, subgraph_id character varying)
+ RETURNS void
+ LANGUAGE plpgsql
+AS $function$
+declare
+    history record;
+begin
+    -- Revert all relevant events
+    for history in
+        -- Get all history entries associated with the given block. Note
+        -- that the view imposes the correct order
+    select
+        h.entity,
+        h.entity_id,
+        h.data_before,
+        h.op_id
+    from entity_history_with_source h
+    where h.source = block_to_revert_hash
+      and h.subgraph = subgraph_id
+    loop
+        case
+            -- insert case
+            when history.op_id = 0 then
+                -- Delete inserted row
+            begin
+                perform set_config('vars.current_event_source',
+                                   'REVERSION', false);
+                delete from entities
+                 where subgraph = subgraph_id
+                   and entity = history.entity
+                   and id = history.entity_id;
+                -- Row was already updated
+            exception when no_data_found then
+              -- do nothing, the entity was gone already
+            end;
+            -- update or delete case
+            when history.op_id IN (1,2) then
+                -- Insert deleted row if not exists
+                -- If row exists perform update
+                begin
+                     insert into entities
+                                 (id, subgraph, entity, data, event_source)
+                     values (history.entity_id,
+                             subgraph_id,
+                             history.entity,
+                             history.data_before,
+                             'REVERSION')
+                     on conflict (id, subgraph, entity)
+                     do update
+                           set data = history.data_before,
+                               event_source = 'REVERSION';
+            end;
+        end case;
+    end loop;
+end;
+$function$
+;
diff --git a/store/postgres/migrations/2019-04-22-190022_remove_unneeded_stored_procs/up.sql b/store/postgres/migrations/2019-04-22-190022_remove_unneeded_stored_procs/up.sql
new file mode 100644
index 0000000..f5ec8a8
--- /dev/null
+++ b/store/postgres/migrations/2019-04-22-190022_remove_unneeded_stored_procs/up.sql
@@ -0,0 +1,22 @@
+drop function if exists
+  build_attribute_index(text, text, text, text, boolean, text, text);
+
+drop function if exists
+  revert_block(varchar, varchar);
+
+-- Functions we meant to get rid of earlier, but used the wrong syntax for
+-- PostgreSQL 9.6
+drop function if exists
+  revert_block(varchar, int8, varchar, varchar);
+
+drop function if exists
+  revert_block(varchar[], varchar);
+
+drop function if exists
+  revert_entity_event(integer, integer);
+
+drop function if exists
+  revert_transaction(integer);
+
+drop function if exists
+  revert_transaction(integer[]);
diff --git a/store/postgres/migrations/2019-05-03-164052_store_entity_count/down.sql b/store/postgres/migrations/2019-05-03-164052_store_entity_count/down.sql
new file mode 100644
index 0000000..031066f
--- /dev/null
+++ b/store/postgres/migrations/2019-05-03-164052_store_entity_count/down.sql
@@ -0,0 +1,4 @@
+-- Remove entityCount from SubgraphDeployment
+update subgraphs.entities
+   set data = data - 'entityCount'
+ where entity='SubgraphDeployment';
diff --git a/store/postgres/migrations/2019-05-03-164052_store_entity_count/up.sql b/store/postgres/migrations/2019-05-03-164052_store_entity_count/up.sql
new file mode 100644
index 0000000..cfcf3ef
--- /dev/null
+++ b/store/postgres/migrations/2019-05-03-164052_store_entity_count/up.sql
@@ -0,0 +1,50 @@
+create function store_entity_count()
+returns void
+language plpgsql
+as $function$
+declare
+  deployment   record;
+  entity_count int8;
+begin
+  -- Initialize the entityCount for all subgraphs
+  update subgraphs.entities e
+  set data = data || '{"entityCount": {"data": "0", "type": "BigInt"}}'
+  where e.entity='SubgraphDeployment';
+
+  -- Handle public.entities
+  with entity_counts as (
+    select subgraph, count(*) as count
+      from public.entities
+    group by subgraph)
+  update subgraphs.entities e
+  set data = data ||
+             format('{"entityCount": {"data": "%s", "type": "BigInt"}}',
+                    (select count from entity_counts c
+                                 where c.subgraph=e.id))::jsonb
+  where e.entity='SubgraphDeployment'
+    and e.id in (select subgraph from entity_counts);
+
+  -- Handle split entities tables
+  for deployment in
+    -- Join with pg_namespace to make sure we do not, under any
+    -- circumstances, try to access a schema that was dropped for
+    -- whatever reason
+    select s.* from deployment_schemas s, pg_namespace n
+            where subgraph != 'subgraphs'
+              and s.name = n.nspname
+  loop
+    execute format('select count(*) from %I.entities', deployment.name)
+       into entity_count;
+    update subgraphs.entities e
+    set data = data ||
+             format('{"entityCount": {"data": "%s", "type": "BigInt"}}',
+                    entity_count)::jsonb
+    where e.entity='SubgraphDeployment'
+      and e.id = deployment.subgraph;
+  end loop;
+end;
+$function$;
+
+select store_entity_count();
+
+drop function store_entity_count();
diff --git a/store/postgres/migrations/2019-05-09-135900_create_subgraphs_entity_history_table/down.sql b/store/postgres/migrations/2019-05-09-135900_create_subgraphs_entity_history_table/down.sql
new file mode 100644
index 0000000..74d3875
--- /dev/null
+++ b/store/postgres/migrations/2019-05-09-135900_create_subgraphs_entity_history_table/down.sql
@@ -0,0 +1,2 @@
+-- Delete the entity_history table for the subgraph of subgraphs.
+drop table subgraphs.entity_history;
diff --git a/store/postgres/migrations/2019-05-09-135900_create_subgraphs_entity_history_table/up.sql b/store/postgres/migrations/2019-05-09-135900_create_subgraphs_entity_history_table/up.sql
new file mode 100644
index 0000000..cbcc3fe
--- /dev/null
+++ b/store/postgres/migrations/2019-05-09-135900_create_subgraphs_entity_history_table/up.sql
@@ -0,0 +1,13 @@
+-- Create an entity_history table for the subgraph of subgraphs.
+create table subgraphs.entity_history (
+  id          serial primary key,
+  event_id    integer references event_meta_data(id)
+                on update cascade
+                on delete cascade,
+  subgraph    varchar not null,
+  entity      varchar not null,
+  entity_id   varchar not null,
+  data_before jsonb,
+  reversion   bool not null default false,
+  op_id       int2 not null
+);
diff --git a/store/postgres/migrations/2019-05-09-232642_ens_names/down.sql b/store/postgres/migrations/2019-05-09-232642_ens_names/down.sql
new file mode 100644
index 0000000..aed5610
--- /dev/null
+++ b/store/postgres/migrations/2019-05-09-232642_ens_names/down.sql
@@ -0,0 +1 @@
+drop table public.ens_names;
diff --git a/store/postgres/migrations/2019-05-09-232642_ens_names/up.sql b/store/postgres/migrations/2019-05-09-232642_ens_names/up.sql
new file mode 100644
index 0000000..453a896
--- /dev/null
+++ b/store/postgres/migrations/2019-05-09-232642_ens_names/up.sql
@@ -0,0 +1,4 @@
+create table if not exists public.ens_names(
+  hash varchar primary key,
+  name varchar not null
+);
diff --git a/store/postgres/migrations/2019-05-14-200255_event_meta_data_source_index/down.sql b/store/postgres/migrations/2019-05-14-200255_event_meta_data_source_index/down.sql
new file mode 100644
index 0000000..014742e
--- /dev/null
+++ b/store/postgres/migrations/2019-05-14-200255_event_meta_data_source_index/down.sql
@@ -0,0 +1 @@
+drop index event_meta_data_source;
diff --git a/store/postgres/migrations/2019-05-14-200255_event_meta_data_source_index/up.sql b/store/postgres/migrations/2019-05-14-200255_event_meta_data_source_index/up.sql
new file mode 100644
index 0000000..f0f5562
--- /dev/null
+++ b/store/postgres/migrations/2019-05-14-200255_event_meta_data_source_index/up.sql
@@ -0,0 +1 @@
+create index if not exists event_meta_data_source on event_meta_data(source);
diff --git a/store/postgres/migrations/2019-05-15-215022_migrate_entities/down.sql b/store/postgres/migrations/2019-05-15-215022_migrate_entities/down.sql
new file mode 100644
index 0000000..c74f210
--- /dev/null
+++ b/store/postgres/migrations/2019-05-15-215022_migrate_entities/down.sql
@@ -0,0 +1,17 @@
+delete from deployment_schemas
+ where version='public';
+
+drop function migrate_entities_tables(varchar,
+                                      deployment_schema_version,
+                                      varchar);
+drop function migrate_entities_data(varchar,
+                                    deployment_schema_version,
+                                    varchar);
+
+alter table deployment_schemas
+  drop column version,
+  drop column migrating,
+  drop column state;
+
+drop type deployment_schema_version;
+drop type deployment_schema_state;
diff --git a/store/postgres/migrations/2019-05-15-215022_migrate_entities/up.sql b/store/postgres/migrations/2019-05-15-215022_migrate_entities/up.sql
new file mode 100644
index 0000000..c84a2c0
--- /dev/null
+++ b/store/postgres/migrations/2019-05-15-215022_migrate_entities/up.sql
@@ -0,0 +1,186 @@
+-- The different storage schemes/versions we support for subgraphs.
+-- Over time, we will add more as our storage scheme for individual
+-- subgraphs evolves
+create type deployment_schema_version as enum ('public', 'split');
+-- How far a currently running migration has gotten. See
+-- store/postgres/src/entities.rs for more details
+create type deployment_schema_state as enum ('ready', 'tables');
+
+-- Modify deployment_schemas to track the progress of any needed migrations
+alter table deployment_schemas
+  add column version   deployment_schema_version,
+  add column migrating bool not null default false,
+  add column state     deployment_schema_state not null default 'ready';
+
+-- Existing subgraphs (subgraph of subgraphs and subgraphs that have been
+-- deployed since commit d2248402) are stored in their own split-out
+-- database schema
+update deployment_schemas
+   set version='split';
+
+alter table deployment_schemas
+  alter column version set not null;
+
+-- Legacy subgraphs (those deployed before commit d2248402) are stored in
+-- the big public.entities table. With the migration machinery we are
+-- putting in place, we need an entry in deployment_schemas for every
+-- deployed subgraph
+insert into deployment_schemas(subgraph, version)
+select id, 'public'::deployment_schema_version
+  from subgraphs.entities e
+ where entity='SubgraphDeployment'
+   and not exists (select 1 from deployment_schemas d
+                           where d.subgraph=e.id);
+
+-- Migrate the entities for one subgraph into their own schema. The
+-- deployment_schemas table must already contain an entry for that
+-- subgraph
+create or replace function migrate_entities_tables(
+  schema_name varchar,
+  schema_version deployment_schema_version,
+  subgraph_id varchar
+) returns void
+language plpgsql
+as $function$
+declare
+  index_row  record;
+begin
+  if schema_version <> 'public' then
+    raise 'Schema for %(%) has version %, but should have version ''public''',
+          schema_name, subgraph_id, schema_version;
+  end if;
+
+  execute format('create schema %I', schema_name);
+
+  -- Dirty trick: modify the search path; unqualified table references
+  -- will be looked up in schema_name first
+  perform set_config('search_path', format('%I, public', schema_name), true);
+
+  -- Create the entities table and all its trimmings
+  create table entities(
+      entity       varchar not null,
+      id           varchar not null,
+      data         jsonb,
+      event_source varchar not null,
+      primary key(entity, id)
+  );
+
+  create table entity_history (
+      id           serial primary key,
+      event_id     integer references event_meta_data(id)
+                             on update cascade on delete cascade,
+      entity       varchar not null,
+      entity_id    varchar not null,
+      data_before  jsonb,
+      reversion    bool not null default false,
+      op_id        int2 NOT NULL
+  );
+
+  create index entity_history_event_id_btree_idx
+      on entity_history(event_id);
+
+  -- Set the search path back to the default so that we do not
+  -- influence other database work
+  perform set_config('search_path', '"$user", public', true);
+end;
+$function$;
+
+create or replace function migrate_entities_data(
+  schema_name varchar,
+  schema_version deployment_schema_version,
+  subgraph_id varchar
+) returns integer
+language plpgsql
+as $function$
+declare
+  entities_count integer;
+  index_row  record;
+  has_rows bool;
+begin
+  if schema_version <> 'public' then
+    raise 'Schema for %(%) has version %, but should have version ''public''',
+          subgraph_id, schema_name, schema_version;
+  end if;
+
+  execute format('select exists (select 1 from %I.entities)', schema_name)
+     into has_rows;
+  if has_rows then
+    raise 'Expected table %.entities to be empty', schema_name;
+  end if;
+
+  execute format('select exists (select 1 from %I.entity_history)', schema_name)
+     into has_rows;
+  if has_rows then
+    raise 'Expected table %.entity_history to be empty', schema_name;
+  end if;
+
+  -- It is possible that a previous attempt to do the migration copied a
+  -- lot of data and then was abandoned (for example, because the
+  -- graph-node instance running it crashed) That leaves the entities and
+  -- entity_history tables empty, but all the data that was copied before
+  -- still exists as dead tuples. Truncate the tables to get rid of those
+  -- dead tuples
+  execute format('truncate %I.entities', schema_name);
+  execute format('truncate %I.entity_history', schema_name);
+
+  -- Migrate data out of the public schema
+  execute format('
+      insert into %I.entities
+      select entity, id, data, event_source
+        from public.entities p
+        where p.subgraph=$1', schema_name)
+  using subgraph_id;
+  GET DIAGNOSTICS entities_count = ROW_COUNT;
+
+  delete from public.entities
+   where subgraph=subgraph_id;
+
+  execute format('
+      insert into
+        %I.entity_history(event_id, entity, entity_id,
+                          data_before, reversion, op_id)
+      select event_id, entity, entity_id,
+             data_before, reversion, op_id
+        from public.entity_history
+       where subgraph=$1', schema_name)
+  using subgraph_id;
+
+  delete from public.entity_history
+   where subgraph=subgraph_id;
+
+  -- Create change triggers after migrating the data
+  -- Otherwise we wind up with duplicate history
+
+  -- Need to set the search_path again so the trigges go on the right table
+  perform set_config('search_path', format('%I, public', schema_name), true);
+  create trigger entity_change_insert_trigger
+      after insert on entities
+      for each row
+      execute procedure subgraph_log_entity_event();
+
+  create trigger entity_change_update_trigger
+      after update on entities
+      for each row
+      when (old.data != new.data)
+      execute procedure subgraph_log_entity_event();
+
+  create trigger entity_change_delete_trigger
+      after delete on entities
+      for each row
+      execute procedure subgraph_log_entity_event();
+
+  perform set_config('search_path', '"$user", public', true);
+
+  -- We should drop attribute indexes for subgraph_id from public.entities
+  -- at this point, but that requires an access exclusive lock on that
+  -- table, which can lead to concurrently running migrations to deadlock.
+  -- We therefore leave the indexes in place, and they will need to be
+  -- cleaned up separately.
+
+  -- Update statistics for our new tables
+  execute format('analyze %I.entities', schema_name);
+  execute format('analyze %I.entity_history', schema_name);
+
+  return entities_count;
+end;
+$function$;
diff --git a/store/postgres/migrations/2019-06-05-214320_uncled_chain_head_update/down.sql b/store/postgres/migrations/2019-06-05-214320_uncled_chain_head_update/down.sql
new file mode 100644
index 0000000..d3e00bc
--- /dev/null
+++ b/store/postgres/migrations/2019-06-05-214320_uncled_chain_head_update/down.sql
@@ -0,0 +1,97 @@
+-- attempt_chain_head_update
+-- from migration 2019-03-31-010824_short_chain_head_update
+
+CREATE OR REPLACE FUNCTION attempt_chain_head_update(net_name VARCHAR, ancestor_count BIGINT)
+    RETURNS VARCHAR[] AS
+$$
+DECLARE
+    current_head_number BIGINT;
+    new_head_hash VARCHAR;
+    new_head_number BIGINT;
+    genesis_hash VARCHAR;
+    missing_parents VARCHAR[];
+BEGIN
+    -- Find candidate new chain head block
+    SELECT
+       hash,
+       number,
+       genesis_block_hash
+    INTO
+       new_head_hash,
+       new_head_number,
+       genesis_hash
+    FROM ethereum_blocks b, ethereum_networks n
+    WHERE b.network_name = net_name
+      and n.name = net_name
+      --- Handle the case where ethereum_networks has a NULL head_block_number
+      and b.number > coalesce(n.head_block_number, -1)
+    ORDER BY
+       number DESC,
+       hash ASC
+    LIMIT 1;
+
+    -- Stop now if it's no better than the current chain head block
+    IF new_head_hash IS NULL THEN
+        RETURN ARRAY[]::VARCHAR[];
+    END IF;
+
+    -- Aggregate a list of missing parent hashes into missing_parents,
+    -- selecting only parents of blocks within ancestor_count of new head.
+    --
+    -- In the common case during block ingestion, this will find only one or
+    -- zero missing parents, which causes the block ingestor to walk backwards
+    -- from the latest block, loading blocks one at a time.
+    -- A possible performance improvement in the block ingestor would be to
+    -- load blocks speculatively by number instead of by hash.
+    --
+    -- We build a list of ancestor_count (hash, parent_hash) tuples and
+    -- check that for each mention of a parent_hash in a tuple (_, h1)
+    -- there is also a tuple that has that in the hash position, i.e. that
+    -- we have a tuple (h1, _) That can of course not work for the last
+    -- tuple in the chain. We therefore mark it with 'last = t' (all the
+    -- others will have 'last = f') and do not try to find its parent, or
+    -- report its parent as missing. We can tell this last tuple because it
+    -- is either the one with number 'new_head_number - ancestor_count',
+    -- or, if the chain has fewer than ancestor_count blocks, the genesis
+    -- block. The latter can happen for chains from ganache which are
+    -- generally very short (say 8 blocks or so)
+    WITH head AS
+        (SELECT hash,
+                parent_hash,
+                (number = (new_head_number - ancestor_count)
+                 or hash = genesis_hash) as last
+           FROM ethereum_blocks
+          WHERE network_name = net_name
+            AND number >= GREATEST(new_head_number - ancestor_count, 0))
+    SELECT array_agg(h1.parent_hash)
+      INTO STRICT missing_parents
+      FROM head h1
+     WHERE not h1.last
+       AND NOT EXISTS (SELECT 1 FROM head h2 WHERE h1.parent_hash = h2.hash);
+
+    -- Stop now if there are any recent blocks with missing parents
+    IF array_length(missing_parents, 1) > 0 THEN
+        RETURN missing_parents;
+    END IF;
+
+    -- No recent missing parent blocks, therefore candidate new chain head block has
+    -- the necessary minimum number of ancestors present in DB.
+
+    -- Set chain head block pointer to candidate chain head block
+    UPDATE ethereum_networks
+    SET
+        head_block_hash = new_head_hash,
+        head_block_number = new_head_number
+    WHERE name = net_name;
+
+    -- Fire chain head block update event
+    PERFORM pg_notify('chain_head_updates', json_build_object(
+        'network_name', net_name,
+        'head_block_hash', new_head_hash,
+        'head_block_number', new_head_number
+    )::text);
+
+    -- Done
+    RETURN ARRAY[]::VARCHAR[];
+END;
+$$ LANGUAGE plpgsql;
diff --git a/store/postgres/migrations/2019-06-05-214320_uncled_chain_head_update/up.sql b/store/postgres/migrations/2019-06-05-214320_uncled_chain_head_update/up.sql
new file mode 100644
index 0000000..43b904a
--- /dev/null
+++ b/store/postgres/migrations/2019-06-05-214320_uncled_chain_head_update/up.sql
@@ -0,0 +1,109 @@
+-- Fix attempt_chain_head_update so that uncled blocks within ancestor_count
+-- do not cause us to report missing parents
+CREATE OR REPLACE FUNCTION attempt_chain_head_update(net_name VARCHAR, ancestor_count BIGINT)
+    RETURNS VARCHAR[] AS
+$$
+DECLARE
+    current_head_number BIGINT;
+    new_head_hash VARCHAR;
+    new_head_number BIGINT;
+    genesis_hash VARCHAR;
+    missing_parents VARCHAR[];
+    first_block_number BIGINT;
+BEGIN
+    --
+    -- Find candidate new chain head block
+    --
+    SELECT
+       hash,
+       number,
+       genesis_block_hash
+    INTO
+       new_head_hash,
+       new_head_number,
+       genesis_hash
+    FROM ethereum_blocks b, ethereum_networks n
+    WHERE b.network_name = net_name
+      and n.name = net_name
+      --- Handle the case where ethereum_networks has a NULL head_block_number
+      and b.number > coalesce(n.head_block_number, -1)
+    ORDER BY
+       number DESC,
+       hash ASC
+    LIMIT 1;
+
+    -- Stop now if it's no better than the current chain head block
+    IF new_head_hash IS NULL THEN
+        RETURN ARRAY[]::VARCHAR[];
+    END IF;
+
+    --
+    -- Verify that we have a complete (hash, parent_hash) chain at least
+    -- ancestor_count blocks long in the database, starting with the
+    -- candidate head we just found
+    --
+
+    -- The first (lowest) number of a block we have to check for a
+    -- continuous chain. If new_head_number is less than ancestor_count,
+    -- check all blocks
+    first_block_number = greatest(new_head_number - ancestor_count, 0);
+
+    -- Find the first block that is missing from the database needed to
+    -- complete the chain of ancestor_count blocks. We return it as an
+    -- array because the Rust code expects that, but the array will only
+    -- ever have one element.
+    -- We recursively build a temp table 'chain' containing the hash and
+    -- parent_hash of blocks to check. The 'last' value is used to stop
+    -- the recursion and is true if one of these conditions is true:
+    --   * we are missing a parent block
+    --   * we checked the required number of blocks
+    --   * we checked the genesis block
+    with recursive chain(hash, parent_hash, last) as (
+       -- base case: look at the head candidate block
+       select b.hash, b.parent_hash, false
+         from ethereum_blocks b
+        where b.network_name = net_name
+          and b.hash = new_head_hash
+       union all
+       -- recursion step: add a block whose hash is the latest parent_hash
+       -- on chain
+       select chain.parent_hash,
+              b.parent_hash,
+              coalesce(b.parent_hash is null
+                    or b.number <= first_block_number
+                    or b.hash = genesis_hash, true)
+         from chain left outer join ethereum_blocks b
+                     on chain.parent_hash = b.hash
+                    and b.network_name = net_name
+        where not chain.last)
+    select array_agg(hash)
+      into missing_parents
+      from chain
+     where chain.parent_hash is null;
+
+    -- Stop now if we found a missing parent
+    IF missing_parents is not null THEN
+        RETURN missing_parents;
+    END IF;
+
+    -- No missing parent blocks, therefore candidate new chain head block
+    -- has the necessary minimum number of ancestors present in DB.
+
+    -- Set chain head block pointer to candidate chain head block
+    UPDATE ethereum_networks
+    SET
+        head_block_hash = new_head_hash,
+        head_block_number = new_head_number
+    WHERE name = net_name;
+
+    -- Fire chain head block update event
+    PERFORM pg_notify('chain_head_updates', json_build_object(
+        'network_name', net_name,
+        'head_block_hash', new_head_hash,
+        'head_block_number', new_head_number
+    )::text);
+
+    -- Done
+    RETURN ARRAY[]::VARCHAR[];
+END;
+$$ LANGUAGE plpgsql;
diff --git a/store/postgres/migrations/2019-06-26-164405_index_dynamic_ethereum_contract_data_source_deployment/down.sql b/store/postgres/migrations/2019-06-26-164405_index_dynamic_ethereum_contract_data_source_deployment/down.sql
new file mode 100644
index 0000000..76879dd
--- /dev/null
+++ b/store/postgres/migrations/2019-06-26-164405_index_dynamic_ethereum_contract_data_source_deployment/down.sql
@@ -0,0 +1,2 @@
+drop index if exists
+  subgraphs.manual_dynamic_ethereum_contract_data_source_deployment;
diff --git a/store/postgres/migrations/2019-06-26-164405_index_dynamic_ethereum_contract_data_source_deployment/up.sql b/store/postgres/migrations/2019-06-26-164405_index_dynamic_ethereum_contract_data_source_deployment/up.sql
new file mode 100644
index 0000000..82ec3cc
--- /dev/null
+++ b/store/postgres/migrations/2019-06-26-164405_index_dynamic_ethereum_contract_data_source_deployment/up.sql
@@ -0,0 +1,4 @@
+create index if not exists
+  manual_dynamic_ethereum_contract_data_source_deployment
+    on subgraphs.entities(((data->'deployment'->>'data')))
+    where entity='DynamicEthereumContractDataSource';
diff --git a/store/postgres/migrations/2019-07-20-195916_remove_subgraph/down.sql b/store/postgres/migrations/2019-07-20-195916_remove_subgraph/down.sql
new file mode 100644
index 0000000..4e6eb2c
--- /dev/null
+++ b/store/postgres/migrations/2019-07-20-195916_remove_subgraph/down.sql
@@ -0,0 +1,3 @@
+drop function remove_public_deployments();
+drop function remove_deployment_metadata(ids varchar[]);
+drop function list_deployment_entities(ids varchar[]);
diff --git a/store/postgres/migrations/2019-07-20-195916_remove_subgraph/up.sql b/store/postgres/migrations/2019-07-20-195916_remove_subgraph/up.sql
new file mode 100644
index 0000000..ae18d76
--- /dev/null
+++ b/store/postgres/migrations/2019-07-20-195916_remove_subgraph/up.sql
@@ -0,0 +1,121 @@
+-- List all metadata entities for a set of subgraph deployments.
+-- The entities are returned as a table of (id, entity) pairs, in no particular
+-- order. The list contains all the entities that are reachable through
+-- associations from a SubgraphDeployment, and include the SubgraphDeployment
+-- itself.
+create or replace function
+  list_deployment_entities(ids varchar[])
+returns table(id varchar, entity varchar) as
+$$
+begin
+  create temp table tmp_ids
+      on commit drop as
+  select * from unnest(ids) as id;
+  create index tmp_ids_id on tmp_ids(id);
+
+  -- Put the ids of all dynamic data sources for the
+  -- subgraph deployments in ids into tmp_dds
+  create temp table tmp_dds
+      on commit drop as
+  select dds.id
+    from subgraphs.entities dds
+   where dds.entity = 'DynamicEthereumContractDataSource'
+     and dds.data->'deployment'->>'data' = any(ids);
+   create index tmp_dds_id on tmp_dds(id);
+
+   -- The metadata entities for a subgraph deployment consist of two
+   -- distinct groups of entities:
+   --   * static metadata, whose id starts with the id of the
+   --     subgraph deployment. Subgraph deployment ids are 46 chars long
+   --   * metadata for dynamic data sources, whose ids start with
+   --     the id of the dynamic data source. Dynamic data source ids are
+   --     40 chars long
+   return query
+   select e.id, e.entity
+     from subgraphs.entities e, tmp_ids
+    where substring(e.id, 1, 46) = tmp_ids.id
+   union all
+   select e.id, e.entity
+     from subgraphs.entities e, tmp_dds
+    where substring(e.id, 1, 40) = tmp_dds.id;
+end;
+$$ language plpgsql;
+
+-- Remove the metadata for the deployments with the given ids. None of the
+-- deployments must currently be assigned to a node for indexing.
+-- Returns the number of entities removed.
+-- Note that this function only removes the metadata from
+-- subgraphs.entities, but not the actual data for the subgraph
+create or replace function
+  remove_deployment_metadata(ids varchar[])
+returns int as
+$$
+declare
+  rows_deleted int;
+begin
+  if exists (select 1
+               from subgraphs.entities
+              where entity = 'SubgraphDeploymentAssignment'
+                and id = any(ids)) then
+     raise 'Can not remove assigned subgraph. One of % is currently assigned',
+           ids;
+  end if;
+
+  drop table if exists tmp_deployments;
+  create temp table tmp_deployments
+      on commit drop as
+  select * from list_deployment_entities(ids);
+
+  delete from subgraphs.entities as e
+  using tmp_deployments as md
+  where e.entity = md.entity and e.id = md.id;
+  GET DIAGNOSTICS rows_deleted = ROW_COUNT;
+  return rows_deleted;
+end;
+$$ language plpgsql;
+
+-- Remove all subgrah deployments that are stored in public.entitites.
+-- Both the subgraph data and its metadata will be deleted.
+create or replace function
+  remove_public_deployments()
+returns int as
+$$
+declare
+  subgraphs text[];
+  rows_deleted int;
+begin
+  select array_agg(subgraph)
+    into subgraphs
+    from deployment_schemas
+   where version = 'public';
+
+  select remove_deployment_metadata(subgraphs)
+    into rows_deleted;
+
+  delete from deployment_schemas
+   where subgraph = any(subgraphs);
+
+  -- We would really like to remove unneeded events from event_meta_data; but
+  -- doing this the obvious way with a 'delete' statement caused problems
+  -- on a test copy of the production database (the pg process errors trying
+  -- to write to the file containing the event_meta_data table, possibly
+  -- because CloudSQL can not allocate storage fast enough)
+  -- Since deleting this data is not crucial for the functioning of the
+  -- system, just remember which event_id's correspond to entries
+  -- in public.entity_history so we can clean them up if that ever becomes
+  -- necessary
+  create table unneeded_event_ids(
+    event_id bigint primary key
+  );
+  insert into unneeded_event_ids
+  select distinct event_id from public.entity_history;
+
+  drop view  if exists public.entity_history_with_source;
+  drop table if exists public.entities;
+  drop table if exists public.entity_history;
+
+  return rows_deleted;
+end;
+$$ language plpgsql;
+
+select remove_public_deployments();
diff --git a/store/postgres/migrations/2019-08-02-001120_short_chain_head_update/down.sql b/store/postgres/migrations/2019-08-02-001120_short_chain_head_update/down.sql
new file mode 100644
index 0000000..11e61a0
--- /dev/null
+++ b/store/postgres/migrations/2019-08-02-001120_short_chain_head_update/down.sql
@@ -0,0 +1,108 @@
+-- Version from 2019-06-05-214320_uncled_chain_head_update
+CREATE OR REPLACE FUNCTION attempt_chain_head_update(net_name VARCHAR, ancestor_count BIGINT)
+    RETURNS VARCHAR[] AS
+$$
+DECLARE
+    current_head_number BIGINT;
+    new_head_hash VARCHAR;
+    new_head_number BIGINT;
+    genesis_hash VARCHAR;
+    missing_parents VARCHAR[];
+    first_block_number BIGINT;
+BEGIN
+    --
+    -- Find candidate new chain head block
+    --
+    SELECT
+       hash,
+       number,
+       genesis_block_hash
+    INTO
+       new_head_hash,
+       new_head_number,
+       genesis_hash
+    FROM ethereum_blocks b, ethereum_networks n
+    WHERE b.network_name = net_name
+      and n.name = net_name
+      --- Handle the case where ethereum_networks has a NULL head_block_number
+      and b.number > coalesce(n.head_block_number, -1)
+    ORDER BY
+       number DESC,
+       hash ASC
+    LIMIT 1;
+
+    -- Stop now if it's no better than the current chain head block
+    IF new_head_hash IS NULL THEN
+        RETURN ARRAY[]::VARCHAR[];
+    END IF;
+
+    --
+    -- Verify that we have a complete (hash, parent_hash) chain at least
+    -- ancestor_count blocks long in the database, starting with the
+    -- candidate head we just found
+    --
+
+    -- The first (lowest) number of a block we have to check for a
+    -- continuous chain. If new_head_number is less than ancestor_count,
+    -- check all blocks
+    first_block_number = greatest(new_head_number - ancestor_count, 0);
+
+    -- Find the first block that is missing from the database needed to
+    -- complete the chain of ancestor_count blocks. We return it as an
+    -- array because the Rust code expects that, but the array will only
+    -- ever have one element.
+    -- We recursively build a temp table 'chain' containing the hash and
+    -- parent_hash of blocks to check. The 'last' value is used to stop
+    -- the recursion and is true if one of these conditions is true:
+    --   * we are missing a parent block
+    --   * we checked the required number of blocks
+    --   * we checked the genesis block
+    with recursive chain(hash, parent_hash, last) as (
+       -- base case: look at the head candidate block
+       select b.hash, b.parent_hash, false
+         from ethereum_blocks b
+        where b.network_name = net_name
+          and b.hash = new_head_hash
+       union all
+       -- recursion step: add a block whose hash is the latest parent_hash
+       -- on chain
+       select chain.parent_hash,
+              b.parent_hash,
+              coalesce(b.parent_hash is null
+                    or b.number <= first_block_number
+                    or b.hash = genesis_hash, true)
+         from chain left outer join ethereum_blocks b
+                     on chain.parent_hash = b.hash
+                    and b.network_name = net_name
+        where not chain.last)
+    select array_agg(hash)
+      into missing_parents
+      from chain
+     where chain.parent_hash is null;
+
+    -- Stop now if we found a missing parent
+    IF missing_parents is not null THEN
+        RETURN missing_parents;
+    END IF;
+
+    -- No missing parent blocks, therefore candidate new chain head block
+    -- has the necessary minimum number of ancestors present in DB.
+
+    -- Set chain head block pointer to candidate chain head block
+    UPDATE ethereum_networks
+    SET
+        head_block_hash = new_head_hash,
+        head_block_number = new_head_number
+    WHERE name = net_name;
+
+    -- Fire chain head block update event
+    PERFORM pg_notify('chain_head_updates', json_build_object(
+        'network_name', net_name,
+        'head_block_hash', new_head_hash,
+        'head_block_number', new_head_number
+    )::text);
+
+    -- Done
+    RETURN ARRAY[]::VARCHAR[];
+END;
+$$ LANGUAGE plpgsql;
diff --git a/store/postgres/migrations/2019-08-02-001120_short_chain_head_update/up.sql b/store/postgres/migrations/2019-08-02-001120_short_chain_head_update/up.sql
new file mode 100644
index 0000000..50d35dc
--- /dev/null
+++ b/store/postgres/migrations/2019-08-02-001120_short_chain_head_update/up.sql
@@ -0,0 +1,113 @@
+-- Fix attempt_chain_head_update so that having just the genesis block does not
+-- lead to reporting the genesis block's nonexistent parent as missing
+--
+-- The only change from the previous version is that in the base case of
+-- the recursive query we explicitly exclude the genesis block
+CREATE OR REPLACE FUNCTION attempt_chain_head_update(net_name VARCHAR, ancestor_count BIGINT)
+    RETURNS VARCHAR[] AS
+$$
+DECLARE
+    current_head_number BIGINT;
+    new_head_hash VARCHAR;
+    new_head_number BIGINT;
+    genesis_hash VARCHAR;
+    missing_parents VARCHAR[];
+    first_block_number BIGINT;
+BEGIN
+    --
+    -- Find candidate new chain head block
+    --
+    SELECT
+       hash,
+       number,
+       genesis_block_hash
+    INTO
+       new_head_hash,
+       new_head_number,
+       genesis_hash
+    FROM ethereum_blocks b, ethereum_networks n
+    WHERE b.network_name = net_name
+      and n.name = net_name
+      --- Handle the case where ethereum_networks has a NULL head_block_number
+      and b.number > coalesce(n.head_block_number, -1)
+    ORDER BY
+       number DESC,
+       hash ASC
+    LIMIT 1;
+
+    -- Stop now if it's no better than the current chain head block
+    IF new_head_hash IS NULL THEN
+        RETURN ARRAY[]::VARCHAR[];
+    END IF;
+
+    --
+    -- Verify that we have a complete (hash, parent_hash) chain at least
+    -- ancestor_count blocks long in the database, starting with the
+    -- candidate head we just found
+    --
+
+    -- The first (lowest) number of a block we have to check for a
+    -- continuous chain. If new_head_number is less than ancestor_count,
+    -- check all blocks
+    first_block_number = greatest(new_head_number - ancestor_count, 0);
+
+    -- Find the first block that is missing from the database needed to
+    -- complete the chain of ancestor_count blocks. We return it as an
+    -- array because the Rust code expects that, but the array will only
+    -- ever have one element.
+    -- We recursively build a temp table 'chain' containing the hash and
+    -- parent_hash of blocks to check. The 'last' value is used to stop
+    -- the recursion and is true if one of these conditions is true:
+    --   * we are missing a parent block
+    --   * we checked the required number of blocks
+    --   * we checked the genesis block
+    with recursive chain(hash, parent_hash, last) as (
+       -- base case: look at the head candidate block
+       select b.hash, b.parent_hash, false
+         from ethereum_blocks b
+        where b.network_name = net_name
+          and b.hash = new_head_hash
+          and b.hash != genesis_hash
+       union all
+       -- recursion step: add a block whose hash is the latest parent_hash
+       -- on chain
+       select chain.parent_hash,
+              b.parent_hash,
+              coalesce(b.parent_hash is null
+                    or b.number <= first_block_number
+                    or b.hash = genesis_hash, true)
+         from chain left outer join ethereum_blocks b
+                     on chain.parent_hash = b.hash
+                    and b.network_name = net_name
+        where not chain.last)
+    select array_agg(hash)
+      into missing_parents
+      from chain
+     where chain.parent_hash is null;
+
+    -- Stop now if we found a missing parent
+    IF missing_parents is not null THEN
+        RETURN missing_parents;
+    END IF;
+
+    -- No missing parent blocks, therefore candidate new chain head block
+    -- has the necessary minimum number of ancestors present in DB.
+
+    -- Set chain head block pointer to candidate chain head block
+    UPDATE ethereum_networks
+    SET
+        head_block_hash = new_head_hash,
+        head_block_number = new_head_number
+    WHERE name = net_name;
+
+    -- Fire chain head block update event
+    PERFORM pg_notify('chain_head_updates', json_build_object(
+        'network_name', net_name,
+        'head_block_hash', new_head_hash,
+        'head_block_number', new_head_number
+    )::text);
+
+    -- Done
+    RETURN ARRAY[]::VARCHAR[];
+END;
+$$ LANGUAGE plpgsql;
diff --git a/store/postgres/migrations/2019-09-01-135850_relational_schema/down.sql b/store/postgres/migrations/2019-09-01-135850_relational_schema/down.sql
new file mode 100644
index 0000000..7b6fb65
--- /dev/null
+++ b/store/postgres/migrations/2019-09-01-135850_relational_schema/down.sql
@@ -0,0 +1,167 @@
+-- This reversion of the migration will only work if there are no subgraphs
+-- with version 'relational'
+
+alter type deployment_schema_version
+  rename to deployment_schema_version_old;
+
+create type deployment_schema_version
+  as enum('public', 'split');
+
+alter table deployment_schemas
+  alter column version type deployment_schema_version
+  using version::text::deployment_schema_version;
+
+drop type deployment_schema_version_old;
+
+--
+-- Functions from migration 2019-05-15-215022_migrate_entities
+--
+create or replace function migrate_entities_tables(
+  schema_name varchar,
+  schema_version deployment_schema_version,
+  subgraph_id varchar
+) returns void
+language plpgsql
+as $function$
+declare
+  index_row  record;
+begin
+  if schema_version <> 'public' then
+    raise 'Schema for %(%) has version %, but should have version ''public''',
+          schema_name, subgraph_id, schema_version;
+  end if;
+
+  execute format('create schema %I', schema_name);
+
+  -- Dirty trick: modify the search path; unqualified table references
+  -- will be looked up in schema_name first
+  perform set_config('search_path', format('%I, public', schema_name), true);
+
+  -- Create the entities table and all its trimmings
+  create table entities(
+      entity       varchar not null,
+      id           varchar not null,
+      data         jsonb,
+      event_source varchar not null,
+      primary key(entity, id)
+  );
+
+  create table entity_history (
+      id           serial primary key,
+      event_id     integer references event_meta_data(id)
+                             on update cascade on delete cascade,
+      entity       varchar not null,
+      entity_id    varchar not null,
+      data_before  jsonb,
+      reversion    bool not null default false,
+      op_id        int2 NOT NULL
+  );
+
+  create index entity_history_event_id_btree_idx
+      on entity_history(event_id);
+
+  -- Set the search path back to the default so that we do not
+  -- influence other database work
+  perform set_config('search_path', '"$user", public', true);
+end;
+$function$;
+
+create or replace function migrate_entities_data(
+  schema_name varchar,
+  schema_version deployment_schema_version,
+  subgraph_id varchar
+) returns integer
+language plpgsql
+as $function$
+declare
+  entities_count integer;
+  index_row  record;
+  has_rows bool;
+begin
+  if schema_version <> 'public' then
+    raise 'Schema for %(%) has version %, but should have version ''public''',
+          subgraph_id, schema_name, schema_version;
+  end if;
+
+  execute format('select exists (select 1 from %I.entities)', schema_name)
+     into has_rows;
+  if has_rows then
+    raise 'Expected table %.entities to be empty', schema_name;
+  end if;
+
+  execute format('select exists (select 1 from %I.entity_history)', schema_name)
+     into has_rows;
+  if has_rows then
+    raise 'Expected table %.entity_history to be empty', schema_name;
+  end if;
+
+  -- It is possible that a previous attempt to do the migration copied a
+  -- lot of data and then was abandoned (for example, because the
+  -- graph-node instance running it crashed) That leaves the entities and
+  -- entity_history tables empty, but all the data that was copied before
+  -- still exists as dead tuples. Truncate the tables to get rid of those
+  -- dead tuples
+  execute format('truncate %I.entities', schema_name);
+  execute format('truncate %I.entity_history', schema_name);
+
+  -- Migrate data out of the public schema
+  execute format('
+      insert into %I.entities
+      select entity, id, data, event_source
+        from public.entities p
+        where p.subgraph=$1', schema_name)
+  using subgraph_id;
+  GET DIAGNOSTICS entities_count = ROW_COUNT;
+
+  delete from public.entities
+   where subgraph=subgraph_id;
+
+  execute format('
+      insert into
+        %I.entity_history(event_id, entity, entity_id,
+                          data_before, reversion, op_id)
+      select event_id, entity, entity_id,
+             data_before, reversion, op_id
+        from public.entity_history
+       where subgraph=$1', schema_name)
+  using subgraph_id;
+
+  delete from public.entity_history
+   where subgraph=subgraph_id;
+
+  -- Create change triggers after migrating the data
+  -- Otherwise we wind up with duplicate history
+
+  -- Need to set the search_path again so the trigges go on the right table
+  perform set_config('search_path', format('%I, public', schema_name), true);
+  create trigger entity_change_insert_trigger
+      after insert on entities
+      for each row
+      execute procedure subgraph_log_entity_event();
+
+  create trigger entity_change_update_trigger
+      after update on entities
+      for each row
+      when (old.data != new.data)
+      execute procedure subgraph_log_entity_event();
+
+  create trigger entity_change_delete_trigger
+      after delete on entities
+      for each row
+      execute procedure subgraph_log_entity_event();
+
+  perform set_config('search_path', '"$user", public', true);
+
+  -- We should drop attribute indexes for subgraph_id from public.entities
+  -- at this point, but that requires an access exclusive lock on that
+  -- table, which can lead to concurrently running migrations to deadlock.
+  -- We therefore leave the indexes in place, and they will need to be
+  -- cleaned up separately.
+
+  -- Update statistics for our new tables
+  execute format('analyze %I.entities', schema_name);
+  execute format('analyze %I.entity_history', schema_name);
+
+  return entities_count;
+end;
+$function$;
diff --git a/store/postgres/migrations/2019-09-01-135850_relational_schema/up.sql b/store/postgres/migrations/2019-09-01-135850_relational_schema/up.sql
new file mode 100644
index 0000000..142f009
--- /dev/null
+++ b/store/postgres/migrations/2019-09-01-135850_relational_schema/up.sql
@@ -0,0 +1,19 @@
+-- We can't add a value to an existing enum inside a transaction. Because
+-- of that, we rename the old one and create a brand new type.
+
+drop function
+  migrate_entities_tables(varchar, deployment_schema_version, varchar);
+drop function
+  migrate_entities_data(varchar, deployment_schema_version, varchar);
+
+alter type deployment_schema_version
+  rename to deployment_schema_version_old;
+
+create type deployment_schema_version
+  as enum('split', 'relational');
+
+alter table deployment_schemas
+  alter column version type deployment_schema_version
+  using version::text::deployment_schema_version;
+
+drop type deployment_schema_version_old;
diff --git a/store/postgres/migrations/2019-09-02-230613_create_btree_extension/down.sql b/store/postgres/migrations/2019-09-02-230613_create_btree_extension/down.sql
new file mode 100644
index 0000000..54f2cf6
--- /dev/null
+++ b/store/postgres/migrations/2019-09-02-230613_create_btree_extension/down.sql
@@ -0,0 +1 @@
+-- No good reason to drop the btree_gist extension again
diff --git a/store/postgres/migrations/2019-09-02-230613_create_btree_extension/up.sql b/store/postgres/migrations/2019-09-02-230613_create_btree_extension/up.sql
new file mode 100644
index 0000000..26dcd1e
--- /dev/null
+++ b/store/postgres/migrations/2019-09-02-230613_create_btree_extension/up.sql
@@ -0,0 +1,2 @@
+-- This requires superuser privileges
+create extension if not exists btree_gist;
diff --git a/store/postgres/migrations/2019-10-01-173616_create_eth_call_cache/down.sql b/store/postgres/migrations/2019-10-01-173616_create_eth_call_cache/down.sql
new file mode 100644
index 0000000..b29fc87
--- /dev/null
+++ b/store/postgres/migrations/2019-10-01-173616_create_eth_call_cache/down.sql
@@ -0,0 +1,2 @@
+drop table eth_call_cache;
+drop table eth_call_meta;
diff --git a/store/postgres/migrations/2019-10-01-173616_create_eth_call_cache/up.sql b/store/postgres/migrations/2019-10-01-173616_create_eth_call_cache/up.sql
new file mode 100644
index 0000000..f074b21
--- /dev/null
+++ b/store/postgres/migrations/2019-10-01-173616_create_eth_call_cache/up.sql
@@ -0,0 +1,11 @@
+create table eth_call_cache (
+  id bytea primary key,
+  return_value bytea not null,
+  contract_address bytea not null,
+  block_number integer not null
+);
+
+create table eth_call_meta (
+   contract_address bytea primary key,
+   accessed_at date not null
+);
diff --git a/store/postgres/migrations/2020-01-14-235608_relational_metadata_views/down.sql b/store/postgres/migrations/2020-01-14-235608_relational_metadata_views/down.sql
new file mode 100644
index 0000000..1ebd8ec
--- /dev/null
+++ b/store/postgres/migrations/2020-01-14-235608_relational_metadata_views/down.sql
@@ -0,0 +1,22 @@
+--
+-- Generated with
+--   cargo run --example layout -- -g drop-views \
+--     ./store/postgres/src/subgraphs.graphql subgraphs
+--
+
+drop view if exists "subgraphs"."ethereum_contract_data_source_template";
+drop view if exists "subgraphs"."ethereum_contract_data_source_template_source";
+drop view if exists "subgraphs"."ethereum_contract_source";
+drop view if exists "subgraphs"."subgraph_deployment_assignment";
+drop view if exists "subgraphs"."subgraph";
+drop view if exists "subgraphs"."dynamic_ethereum_contract_data_source";
+drop view if exists "subgraphs"."subgraph_deployment";
+drop view if exists "subgraphs"."subgraph_version";
+drop view if exists "subgraphs"."ethereum_block_handler_entity";
+drop view if exists "subgraphs"."ethereum_contract_abi";
+drop view if exists "subgraphs"."ethereum_call_handler_entity";
+drop view if exists "subgraphs"."ethereum_contract_data_source";
+drop view if exists "subgraphs"."ethereum_contract_mapping";
+drop view if exists "subgraphs"."subgraph_manifest";
+drop view if exists "subgraphs"."ethereum_block_handler_filter_entity";
+drop view if exists "subgraphs"."ethereum_contract_event_handler";
diff --git a/store/postgres/migrations/2020-01-14-235608_relational_metadata_views/up.sql b/store/postgres/migrations/2020-01-14-235608_relational_metadata_views/up.sql
new file mode 100644
index 0000000..8af61fb
--- /dev/null
+++ b/store/postgres/migrations/2020-01-14-235608_relational_metadata_views/up.sql
@@ -0,0 +1,154 @@
+--
+-- Generated with
+--   cargo run --example layout -- -g views \
+--     ./store/postgres/src/subgraphs.graphql subgraphs
+--
+
+create view "subgraphs"."ethereum_contract_data_source_template" as
+select id as id,
+       (data->'kind'->>'data')::text as kind,
+       (data->'name'->>'data')::text as name,
+       (data->'network'->>'data')::text as network,
+       (data->'source'->>'data')::text as source,
+       (data->'mapping'->>'data')::text as mapping
+  from subgraphs.entities
+ where entity = 'EthereumContractDataSourceTemplate';
+
+create view "subgraphs"."subgraph" as
+select id as id,
+       (data->'name'->>'data')::text as name,
+       (data->'currentVersion'->>'data')::text as current_version,
+       (data->'pendingVersion'->>'data')::text as pending_version,
+       (data->'createdAt'->>'data')::numeric as created_at
+  from subgraphs.entities
+ where entity = 'Subgraph';
+
+create view "subgraphs"."subgraph_version" as
+select id as id,
+       (data->'subgraph'->>'data')::text as subgraph,
+       (data->'deployment'->>'data')::text as deployment,
+       (data->'createdAt'->>'data')::numeric as created_at
+  from subgraphs.entities
+ where entity = 'SubgraphVersion';
+
+create view "subgraphs"."ethereum_contract_data_source" as
+select id as id,
+       (data->'kind'->>'data')::text as kind,
+       (data->'name'->>'data')::text as name,
+       (data->'network'->>'data')::text as network,
+       (data->'source'->>'data')::text as source,
+       (data->'mapping'->>'data')::text as mapping,
+       array(select (x->>'data')::text from jsonb_array_elements(data->'templates'->'data') x) as templates
+  from subgraphs.entities
+ where entity = 'EthereumContractDataSource';
+
+create view "subgraphs"."dynamic_ethereum_contract_data_source" as
+select id as id,
+       (data->'kind'->>'data')::text as kind,
+       (data->'name'->>'data')::text as name,
+       (data->'network'->>'data')::text as network,
+       (data->'source'->>'data')::text as source,
+       (data->'mapping'->>'data')::text as mapping,
+       array(select (x->>'data')::text from jsonb_array_elements(data->'templates'->'data') x) as templates,
+       (data->'ethereumBlockHash'->>'data')::bytea as ethereum_block_hash,
+       (data->'ethereumBlockNumber'->>'data')::numeric as ethereum_block_number,
+       (data->'deployment'->>'data')::text as deployment
+  from subgraphs.entities
+ where entity = 'DynamicEthereumContractDataSource';
+
+create view "subgraphs"."ethereum_call_handler_entity" as
+select id as id,
+       (data->'function'->>'data')::text as function,
+       (data->'handler'->>'data')::text as handler
+  from subgraphs.entities
+ where entity = 'EthereumCallHandlerEntity';
+
+create view "subgraphs"."ethereum_block_handler_filter_entity" as
+select id as id,
+       (data->'kind'->>'data')::text as kind
+  from subgraphs.entities
+ where entity = 'EthereumBlockHandlerFilterEntity';
+
+create view "subgraphs"."ethereum_contract_event_handler" as
+select id as id,
+       (data->'event'->>'data')::text as event,
+       (data->'topic0'->>'data')::bytea as topic_0,
+       (data->'handler'->>'data')::text as handler
+  from subgraphs.entities
+ where entity = 'EthereumContractEventHandler';
+
+create view "subgraphs"."subgraph_deployment_assignment" as
+select id as id,
+       (data->'nodeId'->>'data')::text as node_id,
+       (data->'cost'->>'data')::numeric as cost
+  from subgraphs.entities
+ where entity = 'SubgraphDeploymentAssignment';
+
+create view "subgraphs"."ethereum_block_handler_entity" as
+select id as id,
+       (data->'handler'->>'data')::text as handler,
+       (data->'filter'->>'data')::text as filter
+  from subgraphs.entities
+ where entity = 'EthereumBlockHandlerEntity';
+
+create view "subgraphs"."subgraph_deployment" as
+select id as id,
+       (data->'manifest'->>'data')::text as manifest,
+       (data->'failed'->>'data')::boolean as failed,
+       (data->'synced'->>'data')::boolean as synced,
+       (data->'earliestEthereumBlockHash'->>'data')::bytea as earliest_ethereum_block_hash,
+       (data->'earliestEthereumBlockNumber'->>'data')::numeric as earliest_ethereum_block_number,
+       (data->'latestEthereumBlockHash'->>'data')::bytea as latest_ethereum_block_hash,
+       (data->'latestEthereumBlockNumber'->>'data')::numeric as latest_ethereum_block_number,
+       (data->'ethereumHeadBlockNumber'->>'data')::numeric as ethereum_head_block_number,
+       (data->'ethereumHeadBlockHash'->>'data')::bytea as ethereum_head_block_hash,
+       (data->'totalEthereumBlocksCount'->>'data')::numeric as total_ethereum_blocks_count,
+       (data->'entityCount'->>'data')::numeric as entity_count
+  from subgraphs.entities
+ where entity = 'SubgraphDeployment';
+
+create view "subgraphs"."subgraph_manifest" as
+select id as id,
+       (data->'specVersion'->>'data')::text as spec_version,
+       (data->'description'->>'data')::text as description,
+       (data->'repository'->>'data')::text as repository,
+       (data->'schema'->>'data')::text as schema,
+       array(select (x->>'data')::text from jsonb_array_elements(data->'dataSources'->'data') x) as data_sources,
+       array(select (x->>'data')::text from jsonb_array_elements(data->'templates'->'data') x) as templates
+  from subgraphs.entities
+ where entity = 'SubgraphManifest';
+
+create view "subgraphs"."ethereum_contract_mapping" as
+select id as id,
+       (data->'kind'->>'data')::text as kind,
+       (data->'apiVersion'->>'data')::text as api_version,
+       (data->'language'->>'data')::text as language,
+       (data->'file'->>'data')::text as file,
+       array(select (x->>'data')::text from jsonb_array_elements(data->'entities'->'data') x) as entities,
+       array(select (x->>'data')::text from jsonb_array_elements(data->'abis'->'data') x) as abis,
+       array(select (x->>'data')::text from jsonb_array_elements(data->'blockHandlers'->'data') x) as block_handlers,
+       array(select (x->>'data')::text from jsonb_array_elements(data->'callHandlers'->'data') x) as call_handlers,
+       array(select (x->>'data')::text from jsonb_array_elements(data->'eventHandlers'->'data') x) as event_handlers
+  from subgraphs.entities
+ where entity = 'EthereumContractMapping';
+
+create view "subgraphs"."ethereum_contract_source" as
+select id as id,
+       (data->'address'->>'data')::text as address,
+       (data->'abi'->>'data')::text as abi,
+       (data->'startBlock'->>'data')::numeric as start_block
+  from subgraphs.entities
+ where entity = 'EthereumContractSource';
+
+create view "subgraphs"."ethereum_contract_abi" as
+select id as id,
+       (data->'name'->>'data')::text as name,
+       (data->'file'->>'data')::text as file
+  from subgraphs.entities
+ where entity = 'EthereumContractAbi';
+
+create view "subgraphs"."ethereum_contract_data_source_template_source" as
+select id as id,
+       (data->'abi'->>'data')::text as abi
+  from subgraphs.entities
+ where entity = 'EthereumContractDataSourceTemplateSource';
diff --git a/store/postgres/migrations/2020-01-17-013633_remove_unused_procs/down.sql b/store/postgres/migrations/2020-01-17-013633_remove_unused_procs/down.sql
new file mode 100644
index 0000000..291a97c
--- /dev/null
+++ b/store/postgres/migrations/2020-01-17-013633_remove_unused_procs/down.sql
@@ -0,0 +1 @@
+-- This file should undo anything in `up.sql`
\ No newline at end of file
diff --git a/store/postgres/migrations/2020-01-17-013633_remove_unused_procs/up.sql b/store/postgres/migrations/2020-01-17-013633_remove_unused_procs/up.sql
new file mode 100644
index 0000000..b5d371b
--- /dev/null
+++ b/store/postgres/migrations/2020-01-17-013633_remove_unused_procs/up.sql
@@ -0,0 +1,26 @@
+-- This was used to get rid of public.entities
+drop function if exists remove_public_deployments();
+-- Helper for maintenance of public.entities
+drop function if exists remove_unassigned_deployment_indexes();
+-- Was used to create entity_history entries for public.entities
+drop function if exists log_entity_event();
+
+-- We tried to drop these before, but did not include arguments which made
+-- PG 9.6 not do anything; was used a long time ago in block reversion, but
+-- not any more. That is all done by subgraph_log_entity_event()
+drop function if exists revert_block_group(varchar[], varchar);
+drop function if exists revert_transaction_group(integer[]);
+drop function if exists rerun_entity(integer, varchar, varchar, varchar);
+drop function if exists rerun_entity_history_event(integer, integer);
+
+-- These were triggers on the old subgraph_deployments table; since that
+-- table does not exist anymore, these procs are not needed
+drop function if exists deployment_delete();
+drop function if exists deployment_insert();
+drop function if exists deployment_update();
+
+-- Used by old migrations, but not needed anymore, and will not work once
+-- we store metadata in relational storage
+drop function if exists list_deployment_entities(varchar[]);
+drop function if exists remove_deployment(varchar);
+drop function if exists remove_deployment_metadata(varchar[]);
diff --git a/store/postgres/migrations/2020-01-24-065338_add_reduce_dim/down.sql b/store/postgres/migrations/2020-01-24-065338_add_reduce_dim/down.sql
new file mode 100644
index 0000000..69e51a2
--- /dev/null
+++ b/store/postgres/migrations/2020-01-24-065338_add_reduce_dim/down.sql
@@ -0,0 +1 @@
+drop function reduce_dim(anyarray);
diff --git a/store/postgres/migrations/2020-01-24-065338_add_reduce_dim/up.sql b/store/postgres/migrations/2020-01-24-065338_add_reduce_dim/up.sql
new file mode 100644
index 0000000..5f66d28
--- /dev/null
+++ b/store/postgres/migrations/2020-01-24-065338_add_reduce_dim/up.sql
@@ -0,0 +1,14 @@
+-- From https://wiki.postgresql.org/wiki/Unnest_multidimensional_array
+CREATE OR REPLACE FUNCTION public.reduce_dim(anyarray)
+RETURNS SETOF anyarray AS
+$function$
+DECLARE
+    s $1%TYPE;
+BEGIN
+    FOREACH s SLICE 1  IN ARRAY $1 LOOP
+        RETURN NEXT s;
+    END LOOP;
+    RETURN;
+END;
+$function$
+LANGUAGE plpgsql IMMUTABLE;
diff --git a/store/postgres/migrations/2020-03-06-020253_relational-metadata/down.sql b/store/postgres/migrations/2020-03-06-020253_relational-metadata/down.sql
new file mode 100644
index 0000000..ebbf0fc
--- /dev/null
+++ b/store/postgres/migrations/2020-03-06-020253_relational-metadata/down.sql
@@ -0,0 +1,28 @@
+-- Remove the tables used for relational storage of subgraph metadata
+-- Everything between the comments 'BEGIN LAYOUT' and 'END LAYOUT' was generated
+-- by running
+--   cargo run --example layout -- -g migrate \
+--     ./store/postgres/src/subgraphs.graphql subgraphs
+
+-- BEGIN LAYOUT
+drop table "subgraphs"."subgraph_manifest";
+drop table "subgraphs"."ethereum_contract_source";
+drop table "subgraphs"."ethereum_block_handler_entity";
+drop table "subgraphs"."subgraph_version";
+drop table "subgraphs"."ethereum_block_handler_filter_entity";
+drop table "subgraphs"."ethereum_contract_abi";
+drop table "subgraphs"."subgraph_deployment_assignment";
+drop table "subgraphs"."dynamic_ethereum_contract_data_source";
+drop table "subgraphs"."ethereum_contract_mapping";
+drop table "subgraphs"."subgraph_deployment";
+drop table "subgraphs"."subgraph";
+drop table "subgraphs"."ethereum_contract_data_source_template_source";
+drop table "subgraphs"."ethereum_call_handler_entity";
+drop table "subgraphs"."ethereum_contract_data_source";
+drop table "subgraphs"."ethereum_contract_event_handler";
+drop table "subgraphs"."ethereum_contract_data_source_template";
+-- END LAYOUT
+
+update deployment_schemas
+   set version = 'split'
+ where name = 'subgraphs';
diff --git a/store/postgres/migrations/2020-03-06-020253_relational-metadata/up.sql b/store/postgres/migrations/2020-03-06-020253_relational-metadata/up.sql
new file mode 100644
index 0000000..eca62b5
--- /dev/null
+++ b/store/postgres/migrations/2020-03-06-020253_relational-metadata/up.sql
@@ -0,0 +1,616 @@
+-- The relational schema for subgraph metadata
+-- Everything between the comments 'BEGIN LAYOUT' and 'END LAYOUT' was generated
+-- by running
+--   cargo run --example layout -- -g migrate \
+--     ./store/postgres/src/subgraphs.graphql subgraphs
+
+--
+-- Helpers to translate the entity data into the new form
+--
+create temporary table history_block_numbers as
+select eb.number, eh.entity, eh.entity_id, eh.op_id
+  from ethereum_blocks eb,
+       subgraphs.entity_history eh,
+       event_meta_data emd
+ where eh.event_id = emd.id
+   and emd.source = eb.hash;
+
+create index history_entity on history_block_numbers(entity, entity_id);
+
+-- We expect only op_id = 0 since these subgraph entities
+-- are immutable; to cause an error when that is not the
+-- case, we use a null id otherwise
+create or replace view history_data as
+select int4range(coalesce(h.number::int4, -1), null) as block_range,
+       e.entity,
+       case when coalesce(h.op_id,0) = 0 then e.id else null end as id,
+       e.data
+  from subgraphs.entities e
+       left outer join history_block_numbers h
+       on e.entity=h.entity and e.id = h.entity_id;
+
+--
+-- Generated DDL and data copying
+--
+
+-- BEGIN LAYOUT
+drop view if exists "subgraphs"."ethereum_contract_data_source";
+drop view if exists "subgraphs"."subgraph_deployment_assignment";
+drop view if exists "subgraphs"."ethereum_block_handler_entity";
+drop view if exists "subgraphs"."ethereum_contract_abi";
+drop view if exists "subgraphs"."ethereum_block_handler_filter_entity";
+drop view if exists "subgraphs"."subgraph_deployment";
+drop view if exists "subgraphs"."ethereum_contract_data_source_template_source";
+drop view if exists "subgraphs"."subgraph_version";
+drop view if exists "subgraphs"."subgraph";
+drop view if exists "subgraphs"."ethereum_call_handler_entity";
+drop view if exists "subgraphs"."subgraph_manifest";
+drop view if exists "subgraphs"."ethereum_contract_source";
+drop view if exists "subgraphs"."ethereum_contract_mapping";
+drop view if exists "subgraphs"."ethereum_contract_data_source_template";
+drop view if exists "subgraphs"."ethereum_contract_event_handler";
+drop view if exists "subgraphs"."dynamic_ethereum_contract_data_source";
+create table subgraphs."subgraph" (
+        "id"                 text not null,
+        "name"               text not null,
+        "current_version"    text,
+        "pending_version"    text,
+        "created_at"         numeric not null,
+
+        vid                  bigserial primary key,
+        block_range          int4range not null,
+        exclude using gist   (id with =, block_range with &&)
+);
+create index attr_0_0_subgraph_id
+    on subgraphs."subgraph" using btree("id");
+create index attr_0_1_subgraph_name
+    on subgraphs."subgraph" using btree(left("name", 256));
+create index attr_0_2_subgraph_current_version
+    on subgraphs."subgraph" using btree("current_version");
+create index attr_0_3_subgraph_pending_version
+    on subgraphs."subgraph" using btree("pending_version");
+create index attr_0_4_subgraph_created_at
+    on subgraphs."subgraph" using btree("created_at");
+
+create table subgraphs."subgraph_version" (
+        "id"                 text not null,
+        "subgraph"           text not null,
+        "deployment"         text not null,
+        "created_at"         numeric not null,
+
+        vid                  bigserial primary key,
+        block_range          int4range not null,
+        exclude using gist   (id with =, block_range with &&)
+);
+create index attr_1_0_subgraph_version_id
+    on subgraphs."subgraph_version" using btree("id");
+create index attr_1_1_subgraph_version_subgraph
+    on subgraphs."subgraph_version" using btree("subgraph");
+create index attr_1_2_subgraph_version_deployment
+    on subgraphs."subgraph_version" using btree("deployment");
+create index attr_1_3_subgraph_version_created_at
+    on subgraphs."subgraph_version" using btree("created_at");
+
+create table subgraphs."subgraph_deployment" (
+        "id"                 text not null,
+        "manifest"           text not null,
+        "failed"             boolean not null,
+        "synced"             boolean not null,
+        "earliest_ethereum_block_hash" bytea,
+        "earliest_ethereum_block_number" numeric,
+        "latest_ethereum_block_hash" bytea,
+        "latest_ethereum_block_number" numeric,
+        "ethereum_head_block_number" numeric,
+        "ethereum_head_block_hash" bytea,
+        "total_ethereum_blocks_count" numeric not null,
+        "entity_count"       numeric not null,
+
+        vid                  bigserial primary key,
+        block_range          int4range not null,
+        exclude using gist   (id with =, block_range with &&)
+);
+create index attr_2_0_subgraph_deployment_id
+    on subgraphs."subgraph_deployment" using btree("id");
+create index attr_2_1_subgraph_deployment_manifest
+    on subgraphs."subgraph_deployment" using btree("manifest");
+create index attr_2_2_subgraph_deployment_failed
+    on subgraphs."subgraph_deployment" using btree("failed");
+create index attr_2_3_subgraph_deployment_synced
+    on subgraphs."subgraph_deployment" using btree("synced");
+create index attr_2_4_subgraph_deployment_earliest_ethereum_block_hash
+    on subgraphs."subgraph_deployment" using btree("earliest_ethereum_block_hash");
+create index attr_2_5_subgraph_deployment_earliest_ethereum_block_number
+    on subgraphs."subgraph_deployment" using btree("earliest_ethereum_block_number");
+create index attr_2_6_subgraph_deployment_latest_ethereum_block_hash
+    on subgraphs."subgraph_deployment" using btree("latest_ethereum_block_hash");
+create index attr_2_7_subgraph_deployment_latest_ethereum_block_number
+    on subgraphs."subgraph_deployment" using btree("latest_ethereum_block_number");
+create index attr_2_8_subgraph_deployment_ethereum_head_block_number
+    on subgraphs."subgraph_deployment" using btree("ethereum_head_block_number");
+create index attr_2_9_subgraph_deployment_ethereum_head_block_hash
+    on subgraphs."subgraph_deployment" using btree("ethereum_head_block_hash");
+create index attr_2_10_subgraph_deployment_total_ethereum_blocks_count
+    on subgraphs."subgraph_deployment" using btree("total_ethereum_blocks_count");
+create index attr_2_11_subgraph_deployment_entity_count
+    on subgraphs."subgraph_deployment" using btree("entity_count");
+
+create table subgraphs."subgraph_deployment_assignment" (
+        "id"                 text not null,
+        "node_id"            text not null,
+        "cost"               numeric not null,
+
+        vid                  bigserial primary key,
+        block_range          int4range not null,
+        exclude using gist   (id with =, block_range with &&)
+);
+create index attr_3_0_subgraph_deployment_assignment_id
+    on subgraphs."subgraph_deployment_assignment" using btree("id");
+create index attr_3_1_subgraph_deployment_assignment_node_id
+    on subgraphs."subgraph_deployment_assignment" using btree(left("node_id", 256));
+create index attr_3_2_subgraph_deployment_assignment_cost
+    on subgraphs."subgraph_deployment_assignment" using btree("cost");
+
+create table subgraphs."subgraph_manifest" (
+        "id"                 text not null,
+        "spec_version"       text not null,
+        "description"        text,
+        "repository"         text,
+        "schema"             text not null,
+        "data_sources"       text[] not null,
+        "templates"          text[],
+
+        vid                  bigserial primary key,
+        block_range          int4range not null,
+        exclude using gist   (id with =, block_range with &&)
+);
+create index attr_4_0_subgraph_manifest_id
+    on subgraphs."subgraph_manifest" using btree("id");
+create index attr_4_1_subgraph_manifest_spec_version
+    on subgraphs."subgraph_manifest" using btree(left("spec_version", 256));
+create index attr_4_2_subgraph_manifest_description
+    on subgraphs."subgraph_manifest" using btree(left("description", 256));
+create index attr_4_3_subgraph_manifest_repository
+    on subgraphs."subgraph_manifest" using btree(left("repository", 256));
+create index attr_4_4_subgraph_manifest_schema
+    on subgraphs."subgraph_manifest" using btree(left("schema", 256));
+create index attr_4_5_subgraph_manifest_data_sources
+    on subgraphs."subgraph_manifest" using gin("data_sources");
+create index attr_4_6_subgraph_manifest_templates
+    on subgraphs."subgraph_manifest" using gin("templates");
+
+create table subgraphs."ethereum_contract_data_source" (
+        "id"                 text not null,
+        "kind"               text not null,
+        "name"               text not null,
+        "network"            text,
+        "source"             text not null,
+        "mapping"            text not null,
+        "templates"          text[],
+
+        vid                  bigserial primary key,
+        block_range          int4range not null,
+        exclude using gist   (id with =, block_range with &&)
+);
+create index attr_5_0_ethereum_contract_data_source_id
+    on subgraphs."ethereum_contract_data_source" using btree("id");
+create index attr_5_1_ethereum_contract_data_source_kind
+    on subgraphs."ethereum_contract_data_source" using btree(left("kind", 256));
+create index attr_5_2_ethereum_contract_data_source_name
+    on subgraphs."ethereum_contract_data_source" using btree(left("name", 256));
+create index attr_5_3_ethereum_contract_data_source_network
+    on subgraphs."ethereum_contract_data_source" using btree(left("network", 256));
+create index attr_5_4_ethereum_contract_data_source_source
+    on subgraphs."ethereum_contract_data_source" using btree("source");
+create index attr_5_5_ethereum_contract_data_source_mapping
+    on subgraphs."ethereum_contract_data_source" using btree("mapping");
+create index attr_5_6_ethereum_contract_data_source_templates
+    on subgraphs."ethereum_contract_data_source" using gin("templates");
+
+create table subgraphs."dynamic_ethereum_contract_data_source" (
+        "id"                 text not null,
+        "kind"               text not null,
+        "name"               text not null,
+        "network"            text,
+        "source"             text not null,
+        "mapping"            text not null,
+        "templates"          text[],
+        "ethereum_block_hash" bytea not null,
+        "ethereum_block_number" numeric not null,
+        "deployment"         text not null,
+
+        vid                  bigserial primary key,
+        block_range          int4range not null,
+        exclude using gist   (id with =, block_range with &&)
+);
+create index attr_6_0_dynamic_ethereum_contract_data_source_id
+    on subgraphs."dynamic_ethereum_contract_data_source" using btree("id");
+create index attr_6_1_dynamic_ethereum_contract_data_source_kind
+    on subgraphs."dynamic_ethereum_contract_data_source" using btree(left("kind", 256));
+create index attr_6_2_dynamic_ethereum_contract_data_source_name
+    on subgraphs."dynamic_ethereum_contract_data_source" using btree(left("name", 256));
+create index attr_6_3_dynamic_ethereum_contract_data_source_network
+    on subgraphs."dynamic_ethereum_contract_data_source" using btree(left("network", 256));
+create index attr_6_4_dynamic_ethereum_contract_data_source_source
+    on subgraphs."dynamic_ethereum_contract_data_source" using btree("source");
+create index attr_6_5_dynamic_ethereum_contract_data_source_mapping
+    on subgraphs."dynamic_ethereum_contract_data_source" using btree("mapping");
+create index attr_6_6_dynamic_ethereum_contract_data_source_templates
+    on subgraphs."dynamic_ethereum_contract_data_source" using gin("templates");
+create index attr_6_7_dynamic_ethereum_contract_data_source_ethereum_block_hash
+    on subgraphs."dynamic_ethereum_contract_data_source" using btree("ethereum_block_hash");
+create index attr_6_8_dynamic_ethereum_contract_data_source_ethereum_block_number
+    on subgraphs."dynamic_ethereum_contract_data_source" using btree("ethereum_block_number");
+create index attr_6_9_dynamic_ethereum_contract_data_source_deployment
+    on subgraphs."dynamic_ethereum_contract_data_source" using btree("deployment");
+
+create table subgraphs."ethereum_contract_source" (
+        "id"                 text not null,
+        "address"            bytea,
+        "abi"                text not null,
+        "start_block"        numeric,
+
+        vid                  bigserial primary key,
+        block_range          int4range not null,
+        exclude using gist   (id with =, block_range with &&)
+);
+create index attr_7_0_ethereum_contract_source_id
+    on subgraphs."ethereum_contract_source" using btree("id");
+create index attr_7_1_ethereum_contract_source_address
+    on subgraphs."ethereum_contract_source" using btree("address");
+create index attr_7_2_ethereum_contract_source_abi
+    on subgraphs."ethereum_contract_source" using btree(left("abi", 256));
+create index attr_7_3_ethereum_contract_source_start_block
+    on subgraphs."ethereum_contract_source" using btree("start_block");
+
+create table subgraphs."ethereum_contract_mapping" (
+        "id"                 text not null,
+        "kind"               text not null,
+        "api_version"        text not null,
+        "language"           text not null,
+        "file"               text not null,
+        "entities"           text[] not null,
+        "abis"               text[] not null,
+        "block_handlers"     text[],
+        "call_handlers"      text[],
+        "event_handlers"     text[],
+
+        vid                  bigserial primary key,
+        block_range          int4range not null,
+        exclude using gist   (id with =, block_range with &&)
+);
+create index attr_8_0_ethereum_contract_mapping_id
+    on subgraphs."ethereum_contract_mapping" using btree("id");
+create index attr_8_1_ethereum_contract_mapping_kind
+    on subgraphs."ethereum_contract_mapping" using btree(left("kind", 256));
+create index attr_8_2_ethereum_contract_mapping_api_version
+    on subgraphs."ethereum_contract_mapping" using btree(left("api_version", 256));
+create index attr_8_3_ethereum_contract_mapping_language
+    on subgraphs."ethereum_contract_mapping" using btree(left("language", 256));
+create index attr_8_4_ethereum_contract_mapping_file
+    on subgraphs."ethereum_contract_mapping" using btree(left("file", 256));
+create index attr_8_5_ethereum_contract_mapping_entities
+    on subgraphs."ethereum_contract_mapping" using gin("entities");
+create index attr_8_6_ethereum_contract_mapping_abis
+    on subgraphs."ethereum_contract_mapping" using gin("abis");
+create index attr_8_7_ethereum_contract_mapping_block_handlers
+    on subgraphs."ethereum_contract_mapping" using gin("block_handlers");
+create index attr_8_8_ethereum_contract_mapping_call_handlers
+    on subgraphs."ethereum_contract_mapping" using gin("call_handlers");
+create index attr_8_9_ethereum_contract_mapping_event_handlers
+    on subgraphs."ethereum_contract_mapping" using gin("event_handlers");
+
+create table subgraphs."ethereum_contract_abi" (
+        "id"                 text not null,
+        "name"               text not null,
+        "file"               text not null,
+
+        vid                  bigserial primary key,
+        block_range          int4range not null,
+        exclude using gist   (id with =, block_range with &&)
+);
+create index attr_9_0_ethereum_contract_abi_id
+    on subgraphs."ethereum_contract_abi" using btree("id");
+create index attr_9_1_ethereum_contract_abi_name
+    on subgraphs."ethereum_contract_abi" using btree(left("name", 256));
+create index attr_9_2_ethereum_contract_abi_file
+    on subgraphs."ethereum_contract_abi" using btree(left("file", 256));
+
+create table subgraphs."ethereum_block_handler_entity" (
+        "id"                 text not null,
+        "handler"            text not null,
+        "filter"             text,
+
+        vid                  bigserial primary key,
+        block_range          int4range not null,
+        exclude using gist   (id with =, block_range with &&)
+);
+create index attr_10_0_ethereum_block_handler_entity_id
+    on subgraphs."ethereum_block_handler_entity" using btree("id");
+create index attr_10_1_ethereum_block_handler_entity_handler
+    on subgraphs."ethereum_block_handler_entity" using btree(left("handler", 256));
+create index attr_10_2_ethereum_block_handler_entity_filter
+    on subgraphs."ethereum_block_handler_entity" using btree("filter");
+
+create table subgraphs."ethereum_block_handler_filter_entity" (
+        "id"                 text not null,
+        "kind"               text not null,
+
+        vid                  bigserial primary key,
+        block_range          int4range not null,
+        exclude using gist   (id with =, block_range with &&)
+);
+create index attr_11_0_ethereum_block_handler_filter_entity_id
+    on subgraphs."ethereum_block_handler_filter_entity" using btree("id");
+create index attr_11_1_ethereum_block_handler_filter_entity_kind
+    on subgraphs."ethereum_block_handler_filter_entity" using btree(left("kind", 256));
+
+create table subgraphs."ethereum_call_handler_entity" (
+        "id"                 text not null,
+        "function"           text not null,
+        "handler"            text not null,
+
+        vid                  bigserial primary key,
+        block_range          int4range not null,
+        exclude using gist   (id with =, block_range with &&)
+);
+create index attr_12_0_ethereum_call_handler_entity_id
+    on subgraphs."ethereum_call_handler_entity" using btree("id");
+create index attr_12_1_ethereum_call_handler_entity_function
+    on subgraphs."ethereum_call_handler_entity" using btree(left("function", 256));
+create index attr_12_2_ethereum_call_handler_entity_handler
+    on subgraphs."ethereum_call_handler_entity" using btree(left("handler", 256));
+
+create table subgraphs."ethereum_contract_event_handler" (
+        "id"                 text not null,
+        "event"              text not null,
+        "topic_0"            bytea,
+        "handler"            text not null,
+
+        vid                  bigserial primary key,
+        block_range          int4range not null,
+        exclude using gist   (id with =, block_range with &&)
+);
+create index attr_13_0_ethereum_contract_event_handler_id
+    on subgraphs."ethereum_contract_event_handler" using btree("id");
+create index attr_13_1_ethereum_contract_event_handler_event
+    on subgraphs."ethereum_contract_event_handler" using btree(left("event", 256));
+create index attr_13_2_ethereum_contract_event_handler_topic_0
+    on subgraphs."ethereum_contract_event_handler" using btree("topic_0");
+create index attr_13_3_ethereum_contract_event_handler_handler
+    on subgraphs."ethereum_contract_event_handler" using btree(left("handler", 256));
+
+create table subgraphs."ethereum_contract_data_source_template" (
+        "id"                 text not null,
+        "kind"               text not null,
+        "name"               text not null,
+        "network"            text,
+        "source"             text not null,
+        "mapping"            text not null,
+
+        vid                  bigserial primary key,
+        block_range          int4range not null,
+        exclude using gist   (id with =, block_range with &&)
+);
+create index attr_14_0_ethereum_contract_data_source_template_id
+    on subgraphs."ethereum_contract_data_source_template" using btree("id");
+create index attr_14_1_ethereum_contract_data_source_template_kind
+    on subgraphs."ethereum_contract_data_source_template" using btree(left("kind", 256));
+create index attr_14_2_ethereum_contract_data_source_template_name
+    on subgraphs."ethereum_contract_data_source_template" using btree(left("name", 256));
+create index attr_14_3_ethereum_contract_data_source_template_network
+    on subgraphs."ethereum_contract_data_source_template" using btree(left("network", 256));
+create index attr_14_4_ethereum_contract_data_source_template_source
+    on subgraphs."ethereum_contract_data_source_template" using btree("source");
+create index attr_14_5_ethereum_contract_data_source_template_mapping
+    on subgraphs."ethereum_contract_data_source_template" using btree("mapping");
+
+create table subgraphs."ethereum_contract_data_source_template_source" (
+        "id"                 text not null,
+        "abi"                text not null,
+
+        vid                  bigserial primary key,
+        block_range          int4range not null,
+        exclude using gist   (id with =, block_range with &&)
+);
+create index attr_15_0_ethereum_contract_data_source_template_source_id
+    on subgraphs."ethereum_contract_data_source_template_source" using btree("id");
+create index attr_15_1_ethereum_contract_data_source_template_source_abi
+    on subgraphs."ethereum_contract_data_source_template_source" using btree(left("abi", 256));
+
+
+insert into
+  "subgraphs"."ethereum_contract_data_source"(id, kind, name, network, source, mapping, templates, block_range)
+select id,
+       (data->'kind'->>'data')::text,
+       (data->'name'->>'data')::text,
+       (data->'network'->>'data')::text,
+       (data->'source'->>'data')::text,
+       (data->'mapping'->>'data')::text,
+       array(select (x->>'data')::text from jsonb_array_elements(data->'templates'->'data') x),
+      block_range
+  from history_data
+ where entity = 'EthereumContractDataSource';
+
+insert into
+  "subgraphs"."subgraph_deployment_assignment"(id, node_id, cost, block_range)
+select id,
+       (data->'nodeId'->>'data')::text,
+       (data->'cost'->>'data')::numeric,
+      block_range
+  from history_data
+ where entity = 'SubgraphDeploymentAssignment';
+
+insert into
+  "subgraphs"."ethereum_block_handler_entity"(id, handler, filter, block_range)
+select id,
+       (data->'handler'->>'data')::text,
+       (data->'filter'->>'data')::text,
+      block_range
+  from history_data
+ where entity = 'EthereumBlockHandlerEntity';
+
+insert into
+  "subgraphs"."ethereum_contract_abi"(id, name, file, block_range)
+select id,
+       (data->'name'->>'data')::text,
+       (data->'file'->>'data')::text,
+      block_range
+  from history_data
+ where entity = 'EthereumContractAbi';
+
+insert into
+  "subgraphs"."ethereum_block_handler_filter_entity"(id, kind, block_range)
+select id,
+       (data->'kind'->>'data')::text,
+      block_range
+  from history_data
+ where entity = 'EthereumBlockHandlerFilterEntity';
+
+insert into
+  "subgraphs"."subgraph_deployment"(id, manifest, failed, synced, earliest_ethereum_block_hash, earliest_ethereum_block_number, latest_ethereum_block_hash, latest_ethereum_block_number, ethereum_head_block_number, ethereum_head_block_hash, total_ethereum_blocks_count, entity_count, block_range)
+select id,
+       (data->'manifest'->>'data')::text,
+       (data->'failed'->>'data')::boolean,
+       (data->'synced'->>'data')::boolean,
+       decode(replace(data->'earliestEthereumBlockHash'->>'data','0x',''),'hex'),
+       (data->'earliestEthereumBlockNumber'->>'data')::numeric,
+       decode(replace(data->'latestEthereumBlockHash'->>'data','0x',''),'hex'),
+       (data->'latestEthereumBlockNumber'->>'data')::numeric,
+       (data->'ethereumHeadBlockNumber'->>'data')::numeric,
+       decode(replace(data->'ethereumHeadBlockHash'->>'data','0x',''),'hex'),
+       (data->'totalEthereumBlocksCount'->>'data')::numeric,
+       (data->'entityCount'->>'data')::numeric,
+      block_range
+  from history_data
+ where entity = 'SubgraphDeployment';
+
+insert into
+  "subgraphs"."ethereum_contract_data_source_template_source"(id, abi, block_range)
+select id,
+       (data->'abi'->>'data')::text,
+      block_range
+  from history_data
+ where entity = 'EthereumContractDataSourceTemplateSource';
+
+insert into
+  "subgraphs"."subgraph_version"(id, subgraph, deployment, created_at, block_range)
+select id,
+       (data->'subgraph'->>'data')::text,
+       (data->'deployment'->>'data')::text,
+       (data->'createdAt'->>'data')::numeric,
+      block_range
+  from history_data
+ where entity = 'SubgraphVersion';
+
+insert into
+  "subgraphs"."subgraph"(id, name, current_version, pending_version, created_at, block_range)
+select id,
+       (data->'name'->>'data')::text,
+       (data->'currentVersion'->>'data')::text,
+       (data->'pendingVersion'->>'data')::text,
+       (data->'createdAt'->>'data')::numeric,
+      block_range
+  from history_data
+ where entity = 'Subgraph';
+
+insert into
+  "subgraphs"."ethereum_call_handler_entity"(id, function, handler, block_range)
+select id,
+       (data->'function'->>'data')::text,
+       (data->'handler'->>'data')::text,
+      block_range
+  from history_data
+ where entity = 'EthereumCallHandlerEntity';
+
+insert into
+  "subgraphs"."subgraph_manifest"(id, spec_version, description, repository, schema, data_sources, templates, block_range)
+select id,
+       (data->'specVersion'->>'data')::text,
+       (data->'description'->>'data')::text,
+       (data->'repository'->>'data')::text,
+       (data->'schema'->>'data')::text,
+       array(select (x->>'data')::text from jsonb_array_elements(data->'dataSources'->'data') x),
+       array(select (x->>'data')::text from jsonb_array_elements(data->'templates'->'data') x),
+      block_range
+  from history_data
+ where entity = 'SubgraphManifest';
+
+insert into
+  "subgraphs"."ethereum_contract_source"(id, address, abi, start_block, block_range)
+select id,
+       decode(replace(data->'address'->>'data','0x',''),'hex'),
+       (data->'abi'->>'data')::text,
+       (data->'startBlock'->>'data')::numeric,
+      block_range
+  from history_data
+ where entity = 'EthereumContractSource';
+
+insert into
+  "subgraphs"."ethereum_contract_mapping"(id, kind, api_version, language, file, entities, abis, block_handlers, call_handlers, event_handlers, block_range)
+select id,
+       (data->'kind'->>'data')::text,
+       (data->'apiVersion'->>'data')::text,
+       (data->'language'->>'data')::text,
+       (data->'file'->>'data')::text,
+       array(select (x->>'data')::text from jsonb_array_elements(data->'entities'->'data') x),
+       array(select (x->>'data')::text from jsonb_array_elements(data->'abis'->'data') x),
+       array(select (x->>'data')::text from jsonb_array_elements(data->'blockHandlers'->'data') x),
+       array(select (x->>'data')::text from jsonb_array_elements(data->'callHandlers'->'data') x),
+       array(select (x->>'data')::text from jsonb_array_elements(data->'eventHandlers'->'data') x),
+      block_range
+  from history_data
+ where entity = 'EthereumContractMapping';
+
+insert into
+  "subgraphs"."ethereum_contract_data_source_template"(id, kind, name, network, source, mapping, block_range)
+select id,
+       (data->'kind'->>'data')::text,
+       (data->'name'->>'data')::text,
+       (data->'network'->>'data')::text,
+       (data->'source'->>'data')::text,
+       (data->'mapping'->>'data')::text,
+      block_range
+  from history_data
+ where entity = 'EthereumContractDataSourceTemplate';
+
+insert into
+  "subgraphs"."ethereum_contract_event_handler"(id, event, topic_0, handler, block_range)
+select id,
+       (data->'event'->>'data')::text,
+       decode(replace(data->'topic0'->>'data','0x',''),'hex'),
+       (data->'handler'->>'data')::text,
+      block_range
+  from history_data
+ where entity = 'EthereumContractEventHandler';
+
+insert into
+  "subgraphs"."dynamic_ethereum_contract_data_source"(id, kind, name, network, source, mapping, templates, ethereum_block_hash, ethereum_block_number, deployment, block_range)
+select id,
+       (data->'kind'->>'data')::text,
+       (data->'name'->>'data')::text,
+       (data->'network'->>'data')::text,
+       (data->'source'->>'data')::text,
+       (data->'mapping'->>'data')::text,
+       array(select (x->>'data')::text from jsonb_array_elements(data->'templates'->'data') x),
+       decode(replace(data->'ethereumBlockHash'->>'data','0x',''),'hex'),
+       (data->'ethereumBlockNumber'->>'data')::numeric,
+       (data->'deployment'->>'data')::text,
+      block_range
+  from history_data
+ where entity = 'DynamicEthereumContractDataSource';
+-- END LAYOUT
+
+--
+-- Final updates
+--
+
+update deployment_schemas
+   set version = 'relational'
+ where name = 'subgraphs';
+
+drop view history_data;
+drop table history_block_numbers;
+
+-- Get rid of the old data
+drop table subgraphs.entity_history;
+drop table subgraphs.entities;
diff --git a/store/postgres/migrations/2020-03-11-162100_add_data_source_context/down.sql b/store/postgres/migrations/2020-03-11-162100_add_data_source_context/down.sql
new file mode 100644
index 0000000..044e989
--- /dev/null
+++ b/store/postgres/migrations/2020-03-11-162100_add_data_source_context/down.sql
@@ -0,0 +1 @@
+ALTER TABLE subgraphs.dynamic_ethereum_contract_data_source DROP COLUMN context;
diff --git a/store/postgres/migrations/2020-03-11-162100_add_data_source_context/up.sql b/store/postgres/migrations/2020-03-11-162100_add_data_source_context/up.sql
new file mode 100644
index 0000000..ab6cb48
--- /dev/null
+++ b/store/postgres/migrations/2020-03-11-162100_add_data_source_context/up.sql
@@ -0,0 +1 @@
+ALTER TABLE subgraphs.dynamic_ethereum_contract_data_source ADD COLUMN context text;
diff --git a/store/postgres/migrations/2020-03-25-170527_deployment_graft_base/down.sql b/store/postgres/migrations/2020-03-25-170527_deployment_graft_base/down.sql
new file mode 100644
index 0000000..80a7abe
--- /dev/null
+++ b/store/postgres/migrations/2020-03-25-170527_deployment_graft_base/down.sql
@@ -0,0 +1,4 @@
+alter table subgraphs.subgraph_deployment
+  drop column graft_block_hash,
+  drop column graft_block_number,
+  drop column graft_base;
diff --git a/store/postgres/migrations/2020-03-25-170527_deployment_graft_base/up.sql b/store/postgres/migrations/2020-03-25-170527_deployment_graft_base/up.sql
new file mode 100644
index 0000000..60d5910
--- /dev/null
+++ b/store/postgres/migrations/2020-03-25-170527_deployment_graft_base/up.sql
@@ -0,0 +1,9 @@
+-- It would seem logical to add a foreign key constraint on graft_base to
+-- make sure the base subgraph sticks around. But once we have copied the base
+-- subgraph, the graft does not need the base subgraph anymore, and it is
+-- therefore perfectly fine if the base gets deleted; the graft_base is
+-- purely informational
+alter table subgraphs.subgraph_deployment
+  add column graft_base text,
+  add column graft_block_hash bytea,
+  add column graft_block_number numeric;
diff --git a/store/postgres/migrations/2020-04-04-002817_change_deployment_state/down.sql b/store/postgres/migrations/2020-04-04-002817_change_deployment_state/down.sql
new file mode 100644
index 0000000..c12e1fc
--- /dev/null
+++ b/store/postgres/migrations/2020-04-04-002817_change_deployment_state/down.sql
@@ -0,0 +1,2 @@
+-- Since we are adding a value to an existing enum, and since the 'up'
+-- migration is idempotent, we don't worry about reverting that change
diff --git a/store/postgres/migrations/2020-04-04-002817_change_deployment_state/up.sql b/store/postgres/migrations/2020-04-04-002817_change_deployment_state/up.sql
new file mode 100644
index 0000000..0bd877b
--- /dev/null
+++ b/store/postgres/migrations/2020-04-04-002817_change_deployment_state/up.sql
@@ -0,0 +1,17 @@
+alter type deployment_schema_state
+  rename to deployment_schema_state_old;
+
+create type deployment_schema_state
+  as enum('ready','tables','init');
+
+alter table deployment_schemas
+  alter column state drop default;
+
+alter table deployment_schemas
+  alter column state type deployment_schema_state
+  using state::text::deployment_schema_state;
+
+alter table deployment_schemas
+  alter column state set default 'init';
+
+drop type deployment_schema_state_old;
diff --git a/store/postgres/migrations/2020-04-10-111111_add_deployment_errors/down.sql b/store/postgres/migrations/2020-04-10-111111_add_deployment_errors/down.sql
new file mode 100644
index 0000000..70fdd07
--- /dev/null
+++ b/store/postgres/migrations/2020-04-10-111111_add_deployment_errors/down.sql
@@ -0,0 +1,5 @@
+alter table subgraphs.subgraph_deployment drop column health;
+alter table subgraphs.subgraph_deployment drop column fatal_error;
+alter table subgraphs.subgraph_deployment drop column non_fatal_errors;
+drop type subgraph_health;
+drop table subgraph_error;
diff --git a/store/postgres/migrations/2020-04-10-111111_add_deployment_errors/up.sql b/store/postgres/migrations/2020-04-10-111111_add_deployment_errors/up.sql
new file mode 100644
index 0000000..b15902b
--- /dev/null
+++ b/store/postgres/migrations/2020-04-10-111111_add_deployment_errors/up.sql
@@ -0,0 +1,62 @@
+alter table subgraphs.subgraph_deployment add unique (id);
+
+-- create subgraph_error
+create table subgraphs."subgraph_error" (
+        "id"                 text not null,
+        "subgraph_id"        text not null references subgraphs.subgraph_deployment(id) on delete cascade,
+        "message"            text not null,
+        "block_number"       numeric,
+        "block_hash"         bytea,
+        "handler"            text,
+
+        vid                  bigserial primary key,
+        block_range          int4range not null,
+        exclude using gist   (id with =, block_range with &&)
+);
+
+create index attr_16_0_subgraph_error_id
+    on subgraphs."subgraph_error" using btree("id");
+create index attr_16_1_subgraph_error_subgraph_id
+    on subgraphs."subgraph_error" using btree(left("subgraph_id", 256));
+create index attr_16_3_subgraph_error_block_number
+    on subgraphs."subgraph_error" using btree("block_number");
+    
+-- add fatal_error column to subgraph_deployment
+alter table
+    subgraphs.subgraph_deployment
+add
+    column fatal_error text;
+
+-- add non_fatal_errors column to subgraph_deployment
+alter table
+    subgraphs.subgraph_deployment
+add
+    column non_fatal_errors text[] default '{}';
+
+-- add health column to subgraph_deployment
+create type subgraphs."health"
+    as enum ('failed', 'healthy', 'unhealthy');
+
+alter table
+    subgraphs.subgraph_deployment
+add
+    column health subgraphs.health;
+
+create index attr_subgraph_deployment_health
+    on subgraphs."subgraph_deployment" using btree("health");
+
+update
+    subgraphs.subgraph_deployment
+set
+    health = case
+        failed
+        when false then 'healthy'::subgraphs.health
+        when true then 'failed'::subgraphs.health
+    end;
+
+alter table
+    subgraphs.subgraph_deployment
+alter column
+    health
+set
+    not null;
diff --git a/store/postgres/migrations/2020-05-16-225611_add_deployment_detail_view/down.sql b/store/postgres/migrations/2020-05-16-225611_add_deployment_detail_view/down.sql
new file mode 100644
index 0000000..d5b119f
--- /dev/null
+++ b/store/postgres/migrations/2020-05-16-225611_add_deployment_detail_view/down.sql
@@ -0,0 +1,15 @@
+alter table subgraphs.subgraph_deployment
+  add column ethereum_head_block_hash bytea;
+alter table subgraphs.subgraph_deployment
+  add column ethereum_head_block_number numeric;
+alter table subgraphs.subgraph_deployment
+  add column total_ethereum_blocks_count numeric;
+
+update subgraphs.subgraph_deployment sd
+   set ethereum_head_block_hash = sdd.ethereum_head_block_hash,
+       ethereum_head_block_number = sdd.ethereum_head_block_number,
+       total_ethereum_blocks_count = sdd.ethereum_head_block_number
+  from subgraphs.subgraph_deployment_detail sdd
+ where sd.id = sdd.id;
+
+drop view subgraphs.subgraph_deployment_detail;
diff --git a/store/postgres/migrations/2020-05-16-225611_add_deployment_detail_view/up.sql b/store/postgres/migrations/2020-05-16-225611_add_deployment_detail_view/up.sql
new file mode 100644
index 0000000..04d622a
--- /dev/null
+++ b/store/postgres/migrations/2020-05-16-225611_add_deployment_detail_view/up.sql
@@ -0,0 +1,47 @@
+alter table subgraphs.subgraph_deployment
+  drop column ethereum_head_block_hash;
+alter table subgraphs.subgraph_deployment
+  drop column ethereum_head_block_number;
+alter table subgraphs.subgraph_deployment
+  drop column total_ethereum_blocks_count;
+
+-- This view needs to handle 'normal' subgraphs and the fake subgraphs that
+-- the network indexer creates. Those don't have datasources, and we can
+-- therefore not determine the network through the data source.  Instead,
+-- we rely on the fact that their name is 'network_ethereum_${NETWORK}_v0'
+-- and use that as the network
+create or replace view subgraphs.subgraph_deployment_detail as
+select sd.*,
+       decode(en.head_block_hash,'hex') as ethereum_head_block_hash,
+       en.head_block_number as ethereum_head_block_number,
+       ecds.network,
+       sda.node_id
+  from subgraphs.subgraph_deployment sd
+    inner join
+       subgraphs.subgraph_manifest sm
+         on (sd.manifest = sm.id)
+    inner join
+       subgraphs.ethereum_contract_data_source ecds
+         on (ecds.id = sm.data_sources[1])
+    inner join
+       ethereum_networks en
+         on (en.name = ecds.network)
+    left outer join
+       subgraphs.subgraph_deployment_assignment sda
+         on (sd.id = sda.id)
+union all
+select sd.*,
+       decode(en.head_block_hash,'hex') as ethereum_head_block_hash,
+       en.head_block_number as ethereum_head_block_number,
+       split_part(sd.id, '_', 3) as network,
+       sda.node_id
+  from subgraphs.subgraph_deployment sd
+    inner join
+       subgraphs.subgraph_manifest sm
+         on (sd.manifest = sm.id and sm.data_sources[1] is null)
+    inner join
+       ethereum_networks en
+         on (en.name = split_part(sd.id, '_', 3))
+    left outer join
+       subgraphs.subgraph_deployment_assignment sda
+         on (sd.id = sda.id);
diff --git a/store/postgres/migrations/2020-07-07-002933_add_deployment_reorg_counts/down.sql b/store/postgres/migrations/2020-07-07-002933_add_deployment_reorg_counts/down.sql
new file mode 100644
index 0000000..e8f6963
--- /dev/null
+++ b/store/postgres/migrations/2020-07-07-002933_add_deployment_reorg_counts/down.sql
@@ -0,0 +1,4 @@
+alter table subgraphs.subgraph_deployment
+  drop column reorg_count,
+  drop column current_reorg_depth,
+  drop column max_reorg_depth;
diff --git a/store/postgres/migrations/2020-07-07-002933_add_deployment_reorg_counts/up.sql b/store/postgres/migrations/2020-07-07-002933_add_deployment_reorg_counts/up.sql
new file mode 100644
index 0000000..318280c
--- /dev/null
+++ b/store/postgres/migrations/2020-07-07-002933_add_deployment_reorg_counts/up.sql
@@ -0,0 +1,4 @@
+alter table subgraphs.subgraph_deployment
+  add column reorg_count int not null default 0,
+  add column current_reorg_depth int not null default 0,
+  add column max_reorg_depth int not null default 0;
diff --git a/store/postgres/migrations/2020-07-31-162138_meta-views/down.sql b/store/postgres/migrations/2020-07-31-162138_meta-views/down.sql
new file mode 100644
index 0000000..78db3eb
--- /dev/null
+++ b/store/postgres/migrations/2020-07-31-162138_meta-views/down.sql
@@ -0,0 +1 @@
+drop schema if exists meta cascade;
diff --git a/store/postgres/migrations/2020-07-31-162138_meta-views/up.sql b/store/postgres/migrations/2020-07-31-162138_meta-views/up.sql
new file mode 100644
index 0000000..489e9d6
--- /dev/null
+++ b/store/postgres/migrations/2020-07-31-162138_meta-views/up.sql
@@ -0,0 +1,115 @@
+--
+-- Views that are useful in understanding details about the data graph-node
+-- stores.
+--
+drop schema if exists info cascade;
+create schema info;
+
+create view info.subgraph_info as
+select
+    ds.id as schema_id,
+    ds.name as schema_name,
+    ds.subgraph as subgraph,
+    ds.version as version,
+    s.name,
+    (case
+        when s.pending_version = v.id then 'pending'
+        when s.current_version = v.id then 'current'
+        else 'unused' end) status,
+    d.failed,
+    d.synced
+from
+    deployment_schemas ds,
+    subgraphs.subgraph_deployment d,
+    subgraphs.subgraph_version v,
+    subgraphs.subgraph s
+where   d.id = ds.subgraph
+    and v.deployment = d.id
+    and v.subgraph = s.id;
+
+-- Size of tables
+-- from https://wiki.postgresql.org/wiki/Disk_Usage
+create materialized view info.table_sizes as
+select *,
+       pg_size_pretty(total_bytes) as total,
+       pg_size_pretty(index_bytes) as index,
+       pg_size_pretty(toast_bytes) as toast,
+       pg_size_pretty(table_bytes) as table
+  from (
+    select *,
+           total_bytes-index_bytes-coalesce(toast_bytes,0) AS table_bytes
+      from (
+        select nspname as table_schema, relname as table_name,
+               'shared'::text as version,
+               c.reltuples as row_estimate,
+               pg_total_relation_size(c.oid) as total_bytes,
+               pg_indexes_size(c.oid) as index_bytes,
+               pg_total_relation_size(reltoastrelid) as toast_bytes
+          from pg_class c
+               join pg_namespace n on n.oid = c.relnamespace
+          where relkind = 'r'
+            and (nspname in ('public', 'subgraphs'))
+  ) a
+) a with no data;
+
+create materialized view info.subgraph_sizes as
+select *,
+       pg_size_pretty(total_bytes) as total,
+       pg_size_pretty(index_bytes) as index,
+       pg_size_pretty(toast_bytes) as toast,
+       pg_size_pretty(table_bytes) as table
+  from (
+    select *,
+           total_bytes-index_bytes-coalesce(toast_bytes,0) AS table_bytes
+      from (
+        select nspname as name,
+               ds.subgraph as subgraph,
+               (ds."version")::text as version,
+               sum(c.reltuples) as row_estimate,
+               sum(pg_total_relation_size(c.oid)) as total_bytes,
+               sum(pg_indexes_size(c.oid)) as index_bytes,
+               sum(pg_total_relation_size(reltoastrelid)) as toast_bytes
+          from pg_class c
+               join pg_namespace n on n.oid = c.relnamespace
+               join deployment_schemas ds on ds."name" = n.nspname
+          where relkind = 'r'
+            and nspname like 'sgd%'
+          group by nspname, subgraph, version
+  ) a
+) a with no data;
+
+create view info.all_sizes as
+select * from info.subgraph_sizes
+union all
+select * from info.table_sizes;
+
+-- Currently active queries
+create view info.activity as
+select coalesce(nullif(application_name,''), 'unknown') as application_name,
+       pid,
+       extract(epoch from age(now(), query_start)) as query_age,
+       extract(epoch from age(now(), xact_start)) as txn_age,
+       query
+  from pg_stat_activity
+ where state='active'
+order by query_start desc;
+
+create view info.wraparound as
+select oid::regclass::text AS table,
+       least(
+         (select setting::int
+            from pg_settings
+            where name = 'autovacuum_freeze_max_age') - age(relfrozenxid),
+         (select setting::int
+            from pg_settings
+           where name = 'autovacuum_multixact_freeze_max_age')
+                - mxid_age(relminmxid)) as tx_before_wraparound_vacuum,
+       pg_size_pretty(pg_total_relation_size(oid)) AS size,
+       pg_stat_get_last_autovacuum_time(oid) AS last_autovacuum,
+       age(relfrozenxid) AS xid_age,
+       mxid_age(relminmxid) AS mxid_age
+  from pg_class
+ where relfrozenxid != 0
+   and oid > 16384
+   and relkind='r'
+ order by tx_before_wraparound_vacuum;
diff --git a/store/postgres/migrations/2020-10-31-150000_deterministic_errors/down.sql b/store/postgres/migrations/2020-10-31-150000_deterministic_errors/down.sql
new file mode 100644
index 0000000..ae7b783
--- /dev/null
+++ b/store/postgres/migrations/2020-10-31-150000_deterministic_errors/down.sql
@@ -0,0 +1 @@
+ALTER TABLE subgraphs.subgraph_error DROP COLUMN deterministic;
diff --git a/store/postgres/migrations/2020-10-31-150000_deterministic_errors/up.sql b/store/postgres/migrations/2020-10-31-150000_deterministic_errors/up.sql
new file mode 100644
index 0000000..809556b
--- /dev/null
+++ b/store/postgres/migrations/2020-10-31-150000_deterministic_errors/up.sql
@@ -0,0 +1,5 @@
+-- add `deterministic` column to subgraph_error
+alter table
+    subgraphs.subgraph_error
+add
+    column deterministic boolean not null default false;
diff --git a/store/postgres/migrations/2020-11-03-170839_subgraph_name_unique/down.sql b/store/postgres/migrations/2020-11-03-170839_subgraph_name_unique/down.sql
new file mode 100644
index 0000000..ea4ebb1
--- /dev/null
+++ b/store/postgres/migrations/2020-11-03-170839_subgraph_name_unique/down.sql
@@ -0,0 +1,2 @@
+alter table subgraphs.subgraph
+  drop constraint subgraph_name_uq;
diff --git a/store/postgres/migrations/2020-11-03-170839_subgraph_name_unique/up.sql b/store/postgres/migrations/2020-11-03-170839_subgraph_name_unique/up.sql
new file mode 100644
index 0000000..6c3b998
--- /dev/null
+++ b/store/postgres/migrations/2020-11-03-170839_subgraph_name_unique/up.sql
@@ -0,0 +1,11 @@
+-- Remove duplicate subgraphs; it should be impossible for
+-- subgraphs that have multiple entries to have any versions.
+-- The duplication happened because of a race condition in creating
+-- subgraphs, but the code checked that there was only one subgraph
+-- before deploying a version, and therefore failed
+delete from subgraphs.subgraph
+ where name in (select name from subgraphs.subgraph
+                group by name having count(*) > 1);
+
+alter table subgraphs.subgraph
+  add constraint subgraph_name_uq unique(name);
diff --git a/store/postgres/migrations/2020-11-10-100000_last_healthy_block/down.sql b/store/postgres/migrations/2020-11-10-100000_last_healthy_block/down.sql
new file mode 100644
index 0000000..00684cf
--- /dev/null
+++ b/store/postgres/migrations/2020-11-10-100000_last_healthy_block/down.sql
@@ -0,0 +1,2 @@
+ALTER TABLE subgraphs.subgraph_error DROP COLUMN last_healthy_ethereum_block_hash;
+ALTER TABLE subgraphs.subgraph_error DROP COLUMN last_healthy_ethereum_block_number;
diff --git a/store/postgres/migrations/2020-11-10-100000_last_healthy_block/up.sql b/store/postgres/migrations/2020-11-10-100000_last_healthy_block/up.sql
new file mode 100644
index 0000000..4572c99
--- /dev/null
+++ b/store/postgres/migrations/2020-11-10-100000_last_healthy_block/up.sql
@@ -0,0 +1,9 @@
+alter table
+    subgraphs.subgraph_deployment
+add
+    column last_healthy_ethereum_block_hash bytea;
+
+alter table
+    subgraphs.subgraph_deployment
+add
+    column last_healthy_ethereum_block_number numeric;
diff --git a/store/postgres/migrations/2020-12-11-142000_subgraph_manifest_features/down.sql b/store/postgres/migrations/2020-12-11-142000_subgraph_manifest_features/down.sql
new file mode 100644
index 0000000..eec3197
--- /dev/null
+++ b/store/postgres/migrations/2020-12-11-142000_subgraph_manifest_features/down.sql
@@ -0,0 +1,4 @@
+alter table
+    subgraphs.subgraph_manifest
+drop
+    column features;
diff --git a/store/postgres/migrations/2020-12-11-142000_subgraph_manifest_features/up.sql b/store/postgres/migrations/2020-12-11-142000_subgraph_manifest_features/up.sql
new file mode 100644
index 0000000..4ccfbed
--- /dev/null
+++ b/store/postgres/migrations/2020-12-11-142000_subgraph_manifest_features/up.sql
@@ -0,0 +1,4 @@
+alter table
+    subgraphs.subgraph_manifest
+add
+    column features text[] NOT NULL DEFAULT '{}';
diff --git a/store/postgres/migrations/2020-12-12-000001_remove_migrationg_flag/down.sql b/store/postgres/migrations/2020-12-12-000001_remove_migrationg_flag/down.sql
new file mode 100644
index 0000000..44a88ba
--- /dev/null
+++ b/store/postgres/migrations/2020-12-12-000001_remove_migrationg_flag/down.sql
@@ -0,0 +1,2 @@
+alter table deployment_schemas
+  add column migrating bool not null default false;
diff --git a/store/postgres/migrations/2020-12-12-000001_remove_migrationg_flag/up.sql b/store/postgres/migrations/2020-12-12-000001_remove_migrationg_flag/up.sql
new file mode 100644
index 0000000..d43ade9
--- /dev/null
+++ b/store/postgres/migrations/2020-12-12-000001_remove_migrationg_flag/up.sql
@@ -0,0 +1,2 @@
+alter table deployment_schemas
+  drop column migrating;
diff --git a/store/postgres/migrations/2020-12-12-000002_add_shard_to_deployment_schemas/down.sql b/store/postgres/migrations/2020-12-12-000002_add_shard_to_deployment_schemas/down.sql
new file mode 100644
index 0000000..67b7764
--- /dev/null
+++ b/store/postgres/migrations/2020-12-12-000002_add_shard_to_deployment_schemas/down.sql
@@ -0,0 +1,2 @@
+alter table deployment_schemas
+ drop column shard;
diff --git a/store/postgres/migrations/2020-12-12-000002_add_shard_to_deployment_schemas/up.sql b/store/postgres/migrations/2020-12-12-000002_add_shard_to_deployment_schemas/up.sql
new file mode 100644
index 0000000..c89b336
--- /dev/null
+++ b/store/postgres/migrations/2020-12-12-000002_add_shard_to_deployment_schemas/up.sql
@@ -0,0 +1,6 @@
+alter table deployment_schemas
+  add column shard text;
+update deployment_schemas
+   set shard = 'primary';
+alter table deployment_schemas
+  alter column shard set not null;
diff --git a/store/postgres/migrations/2020-12-12-000003_remove_deployment_schemas_state/down.sql b/store/postgres/migrations/2020-12-12-000003_remove_deployment_schemas_state/down.sql
new file mode 100644
index 0000000..cffb5dd
--- /dev/null
+++ b/store/postgres/migrations/2020-12-12-000003_remove_deployment_schemas_state/down.sql
@@ -0,0 +1,5 @@
+create type deployment_schema_state
+  as enum('ready','tables','init');
+
+alter table deployment_schemas
+  add column state deployment_schema_state not null default 'init';
diff --git a/store/postgres/migrations/2020-12-12-000003_remove_deployment_schemas_state/up.sql b/store/postgres/migrations/2020-12-12-000003_remove_deployment_schemas_state/up.sql
new file mode 100644
index 0000000..b0f6ce2
--- /dev/null
+++ b/store/postgres/migrations/2020-12-12-000003_remove_deployment_schemas_state/up.sql
@@ -0,0 +1,4 @@
+alter table deployment_schemas
+ drop column state;
+
+drop type deployment_schema_state;
diff --git a/store/postgres/migrations/2020-12-12-000004_sharded_deployment_detail/down.sql b/store/postgres/migrations/2020-12-12-000004_sharded_deployment_detail/down.sql
new file mode 100644
index 0000000..905a422
--- /dev/null
+++ b/store/postgres/migrations/2020-12-12-000004_sharded_deployment_detail/down.sql
@@ -0,0 +1,37 @@
+-- The view as created in 2020-05-16-225611_add_deployment_detail_view
+drop view subgraphs.subgraph_deployment_detail;
+create view subgraphs.subgraph_deployment_detail as
+select sd.*,
+       decode(en.head_block_hash,'hex') as ethereum_head_block_hash,
+       en.head_block_number as ethereum_head_block_number,
+       ecds.network,
+       sda.node_id
+  from subgraphs.subgraph_deployment sd
+    inner join
+       subgraphs.subgraph_manifest sm
+         on (sd.manifest = sm.id)
+    inner join
+       subgraphs.ethereum_contract_data_source ecds
+         on (ecds.id = sm.data_sources[1])
+    inner join
+       ethereum_networks en
+         on (en.name = ecds.network)
+    left outer join
+       subgraphs.subgraph_deployment_assignment sda
+         on (sd.id = sda.id)
+union all
+select sd.*,
+       decode(en.head_block_hash,'hex') as ethereum_head_block_hash,
+       en.head_block_number as ethereum_head_block_number,
+       split_part(sd.id, '_', 3) as network,
+       sda.node_id
+  from subgraphs.subgraph_deployment sd
+    inner join
+       subgraphs.subgraph_manifest sm
+         on (sd.manifest = sm.id and sm.data_sources[1] is null)
+    inner join
+       ethereum_networks en
+         on (en.name = split_part(sd.id, '_', 3))
+    left outer join
+       subgraphs.subgraph_deployment_assignment sda
+         on (sd.id = sda.id);
diff --git a/store/postgres/migrations/2020-12-12-000004_sharded_deployment_detail/up.sql b/store/postgres/migrations/2020-12-12-000004_sharded_deployment_detail/up.sql
new file mode 100644
index 0000000..e65d4f8
--- /dev/null
+++ b/store/postgres/migrations/2020-12-12-000004_sharded_deployment_detail/up.sql
@@ -0,0 +1,28 @@
+-- This view needs to handle 'normal' subgraphs and the fake subgraphs that
+-- the network indexer creates. Those don't have datasources, and we can
+-- therefore not determine the network through the data source.  Instead,
+-- we rely on the fact that their name is 'network_ethereum_${NETWORK}_v0'
+-- and use that as the network
+--
+-- This is a variation of the view created in
+-- 2020-05-16-225611_add_deployment_detail_view but does not join with
+-- ethereum_networks and subgraph_deployment_assignment since they live
+-- in different shards from the deployment metadata
+drop view subgraphs.subgraph_deployment_detail;
+create view subgraphs.subgraph_deployment_detail as
+select sd.*,
+       ecds.network
+  from subgraphs.subgraph_deployment sd
+    inner join
+       subgraphs.subgraph_manifest sm
+         on (sd.manifest = sm.id)
+    inner join
+       subgraphs.ethereum_contract_data_source ecds
+         on (ecds.id = sm.data_sources[1])
+union all
+select sd.*,
+       split_part(sd.id, '_', 3) as network
+  from subgraphs.subgraph_deployment sd
+    inner join
+       subgraphs.subgraph_manifest sm
+         on (sd.manifest = sm.id and sm.data_sources[1] is null);
diff --git a/store/postgres/migrations/2020-12-12-000005_remove_metadata_subgraph/down.sql b/store/postgres/migrations/2020-12-12-000005_remove_metadata_subgraph/down.sql
new file mode 100644
index 0000000..ad7c960
--- /dev/null
+++ b/store/postgres/migrations/2020-12-12-000005_remove_metadata_subgraph/down.sql
@@ -0,0 +1,2 @@
+insert into deployment_schemas(id, subgraph, name, version, shard)
+       values(0, 'subgraphs', 'subgraphs', 'relational', 'primary');
diff --git a/store/postgres/migrations/2020-12-12-000005_remove_metadata_subgraph/up.sql b/store/postgres/migrations/2020-12-12-000005_remove_metadata_subgraph/up.sql
new file mode 100644
index 0000000..75eb57e
--- /dev/null
+++ b/store/postgres/migrations/2020-12-12-000005_remove_metadata_subgraph/up.sql
@@ -0,0 +1,2 @@
+delete from deployment_schemas
+ where id = 0;
diff --git a/store/postgres/migrations/2020-12-15-000000_remove_nested_templates/down.sql b/store/postgres/migrations/2020-12-15-000000_remove_nested_templates/down.sql
new file mode 100644
index 0000000..bc0b077
--- /dev/null
+++ b/store/postgres/migrations/2020-12-15-000000_remove_nested_templates/down.sql
@@ -0,0 +1,9 @@
+alter table
+    subgraphs.dynamic_ethereum_contract_data_source
+add
+    column templates;
+
+alter table
+    subgraphs.ethereum_contract_data_source
+add
+    column templates;
diff --git a/store/postgres/migrations/2020-12-15-000000_remove_nested_templates/up.sql b/store/postgres/migrations/2020-12-15-000000_remove_nested_templates/up.sql
new file mode 100644
index 0000000..e5be478
--- /dev/null
+++ b/store/postgres/migrations/2020-12-15-000000_remove_nested_templates/up.sql
@@ -0,0 +1,9 @@
+alter table
+    subgraphs.dynamic_ethereum_contract_data_source
+drop
+    column templates;
+
+alter table
+    subgraphs.ethereum_contract_data_source
+drop
+    column templates;
diff --git a/store/postgres/migrations/2020-12-7-190800_subgraph_error_changes/down.sql b/store/postgres/migrations/2020-12-7-190800_subgraph_error_changes/down.sql
new file mode 100644
index 0000000..5cc4ce2
--- /dev/null
+++ b/store/postgres/migrations/2020-12-7-190800_subgraph_error_changes/down.sql
@@ -0,0 +1,4 @@
+alter table
+    subgraphs.subgraph_error
+drop
+    column created_at;
diff --git a/store/postgres/migrations/2020-12-7-190800_subgraph_error_changes/up.sql b/store/postgres/migrations/2020-12-7-190800_subgraph_error_changes/up.sql
new file mode 100644
index 0000000..4417556
--- /dev/null
+++ b/store/postgres/migrations/2020-12-7-190800_subgraph_error_changes/up.sql
@@ -0,0 +1,9 @@
+alter table
+    subgraphs.subgraph_error
+drop
+    column block_number;
+
+alter table
+    subgraphs.subgraph_error
+add
+    column created_at timestamptz NOT NULL DEFAULT now();
diff --git a/store/postgres/migrations/2021-01-07-004939_create_unused_deployments/down.sql b/store/postgres/migrations/2021-01-07-004939_create_unused_deployments/down.sql
new file mode 100644
index 0000000..256288e
--- /dev/null
+++ b/store/postgres/migrations/2021-01-07-004939_create_unused_deployments/down.sql
@@ -0,0 +1 @@
+drop table unused_deployments;
diff --git a/store/postgres/migrations/2021-01-07-004939_create_unused_deployments/up.sql b/store/postgres/migrations/2021-01-07-004939_create_unused_deployments/up.sql
new file mode 100644
index 0000000..6f2f0b6
--- /dev/null
+++ b/store/postgres/migrations/2021-01-07-004939_create_unused_deployments/up.sql
@@ -0,0 +1,15 @@
+create table unused_deployments (
+	id           text primary key,
+	unused_at    timestamptz not null default now(),
+	removed_at   timestamptz,
+
+    subgraphs    text[],
+	namespace    text not null,
+	shard        text not null,
+
+	entity_count int4 not null default 0,
+	latest_ethereum_block_hash bytea,
+	latest_ethereum_block_number int4,
+	failed       bool not null default false,
+	synced       bool not null default false
+);
diff --git a/store/postgres/migrations/2021-01-14-175654_add_network_to_deployment_schemas/down.sql b/store/postgres/migrations/2021-01-14-175654_add_network_to_deployment_schemas/down.sql
new file mode 100644
index 0000000..13c6398
--- /dev/null
+++ b/store/postgres/migrations/2021-01-14-175654_add_network_to_deployment_schemas/down.sql
@@ -0,0 +1,2 @@
+alter table deployment_schemas
+  drop column network;
diff --git a/store/postgres/migrations/2021-01-14-175654_add_network_to_deployment_schemas/up.sql b/store/postgres/migrations/2021-01-14-175654_add_network_to_deployment_schemas/up.sql
new file mode 100644
index 0000000..24f015c
--- /dev/null
+++ b/store/postgres/migrations/2021-01-14-175654_add_network_to_deployment_schemas/up.sql
@@ -0,0 +1,7 @@
+alter table deployment_schemas
+  add column network text references ethereum_networks(name);
+
+update deployment_schemas ds
+   set network = d.network
+  from subgraphs.subgraph_deployment_detail d
+ where d.id = ds.subgraph;
diff --git a/store/postgres/migrations/2021-01-14-193022_deployment_schemas_network_not_null/down.sql b/store/postgres/migrations/2021-01-14-193022_deployment_schemas_network_not_null/down.sql
new file mode 100644
index 0000000..6e0a5e9
--- /dev/null
+++ b/store/postgres/migrations/2021-01-14-193022_deployment_schemas_network_not_null/down.sql
@@ -0,0 +1,2 @@
+alter table deployment_schemas
+  alter column network drop not null;
diff --git a/store/postgres/migrations/2021-01-14-193022_deployment_schemas_network_not_null/up.sql b/store/postgres/migrations/2021-01-14-193022_deployment_schemas_network_not_null/up.sql
new file mode 100644
index 0000000..09a2da1
--- /dev/null
+++ b/store/postgres/migrations/2021-01-14-193022_deployment_schemas_network_not_null/up.sql
@@ -0,0 +1,2 @@
+alter table deployment_schemas
+  alter column network set not null;
diff --git a/store/postgres/migrations/2021-01-15-013524_drop_deployment_detail/down.sql b/store/postgres/migrations/2021-01-15-013524_drop_deployment_detail/down.sql
new file mode 100644
index 0000000..fc5c28b
--- /dev/null
+++ b/store/postgres/migrations/2021-01-15-013524_drop_deployment_detail/down.sql
@@ -0,0 +1,19 @@
+-- See migration 2020-12-12-000004_sharded_deployment_detail
+drop view subgraphs.subgraph_deployment_detail;
+create view subgraphs.subgraph_deployment_detail as
+select sd.*,
+       ecds.network
+  from subgraphs.subgraph_deployment sd
+    inner join
+       subgraphs.subgraph_manifest sm
+         on (sd.manifest = sm.id)
+    inner join
+       subgraphs.ethereum_contract_data_source ecds
+         on (ecds.id = sm.data_sources[1])
+union all
+select sd.*,
+       split_part(sd.id, '_', 3) as network
+  from subgraphs.subgraph_deployment sd
+    inner join
+       subgraphs.subgraph_manifest sm
+         on (sd.manifest = sm.id and sm.data_sources[1] is null);
diff --git a/store/postgres/migrations/2021-01-15-013524_drop_deployment_detail/up.sql b/store/postgres/migrations/2021-01-15-013524_drop_deployment_detail/up.sql
new file mode 100644
index 0000000..83d50e1
--- /dev/null
+++ b/store/postgres/migrations/2021-01-15-013524_drop_deployment_detail/up.sql
@@ -0,0 +1 @@
+drop view subgraphs.subgraph_deployment_detail;
diff --git a/store/postgres/migrations/2021-01-19-033749_add_chains/down.sql b/store/postgres/migrations/2021-01-19-033749_add_chains/down.sql
new file mode 100644
index 0000000..b4599b6
--- /dev/null
+++ b/store/postgres/migrations/2021-01-19-033749_add_chains/down.sql
@@ -0,0 +1,8 @@
+drop table chains;
+
+alter table deployment_schemas
+  drop constraint deployment_schemas_network_fkey;
+
+alter table deployment_schemas
+  add constraint deployment_schemas_network_fkey
+  foreign key (network) references ethereum_networks(name);
diff --git a/store/postgres/migrations/2021-01-19-033749_add_chains/up.sql b/store/postgres/migrations/2021-01-19-033749_add_chains/up.sql
new file mode 100644
index 0000000..885303f
--- /dev/null
+++ b/store/postgres/migrations/2021-01-19-033749_add_chains/up.sql
@@ -0,0 +1,21 @@
+create table chains (
+  id                 serial primary key,
+  name               text not null unique,
+  net_version        text,
+  genesis_block_hash text,
+  shard              text not null,
+
+  constraint chains_genesis_version_check
+    check (((net_version is null) = (genesis_block_hash is null)))
+);
+
+insert into chains(name, net_version, genesis_block_hash, shard)
+select name, net_version, genesis_block_hash, 'primary'
+  from ethereum_networks;
+
+alter table deployment_schemas
+  drop constraint deployment_schemas_network_fkey;
+
+alter table deployment_schemas
+  add constraint deployment_schemas_network_fkey
+  foreign key (network) references chains(name);
diff --git a/store/postgres/migrations/2021-01-26-044443_drop_attempt_chain_head_update/down.sql b/store/postgres/migrations/2021-01-26-044443_drop_attempt_chain_head_update/down.sql
new file mode 100644
index 0000000..33b508f
--- /dev/null
+++ b/store/postgres/migrations/2021-01-26-044443_drop_attempt_chain_head_update/down.sql
@@ -0,0 +1,110 @@
+-- Same as 2019-08-02-001120_short_chain_head_update/up.sql
+
+CREATE OR REPLACE FUNCTION attempt_chain_head_update(net_name VARCHAR, ancestor_count BIGINT)
+    RETURNS VARCHAR[] AS
+$$
+DECLARE
+    current_head_number BIGINT;
+    new_head_hash VARCHAR;
+    new_head_number BIGINT;
+    genesis_hash VARCHAR;
+    missing_parents VARCHAR[];
+    first_block_number BIGINT;
+BEGIN
+    --
+    -- Find candidate new chain head block
+    --
+    SELECT
+       hash,
+       number,
+       genesis_block_hash
+    INTO
+       new_head_hash,
+       new_head_number,
+       genesis_hash
+    FROM ethereum_blocks b, ethereum_networks n
+    WHERE b.network_name = net_name
+      and n.name = net_name
+      --- Handle the case where ethereum_networks has a NULL head_block_number
+      and b.number > coalesce(n.head_block_number, -1)
+    ORDER BY
+       number DESC,
+       hash ASC
+    LIMIT 1;
+
+    -- Stop now if it's no better than the current chain head block
+    IF new_head_hash IS NULL THEN
+        RETURN ARRAY[]::VARCHAR[];
+    END IF;
+
+    --
+    -- Verify that we have a complete (hash, parent_hash) chain at least
+    -- ancestor_count blocks long in the database, starting with the
+    -- candidate head we just found
+    --
+
+    -- The first (lowest) number of a block we have to check for a
+    -- continuous chain. If new_head_number is less than ancestor_count,
+    -- check all blocks
+    first_block_number = greatest(new_head_number - ancestor_count, 0);
+
+    -- Find the first block that is missing from the database needed to
+    -- complete the chain of ancestor_count blocks. We return it as an
+    -- array because the Rust code expects that, but the array will only
+    -- ever have one element.
+    -- We recursively build a temp table 'chain' containing the hash and
+    -- parent_hash of blocks to check. The 'last' value is used to stop
+    -- the recursion and is true if one of these conditions is true:
+    --   * we are missing a parent block
+    --   * we checked the required number of blocks
+    --   * we checked the genesis block
+    with recursive chain(hash, parent_hash, last) as (
+       -- base case: look at the head candidate block
+       select b.hash, b.parent_hash, false
+         from ethereum_blocks b
+        where b.network_name = net_name
+          and b.hash = new_head_hash
+          and b.hash != genesis_hash
+       union all
+       -- recursion step: add a block whose hash is the latest parent_hash
+       -- on chain
+       select chain.parent_hash,
+              b.parent_hash,
+              coalesce(b.parent_hash is null
+                    or b.number <= first_block_number
+                    or b.hash = genesis_hash, true)
+         from chain left outer join ethereum_blocks b
+                     on chain.parent_hash = b.hash
+                    and b.network_name = net_name
+        where not chain.last)
+    select array_agg(hash)
+      into missing_parents
+      from chain
+     where chain.parent_hash is null;
+
+    -- Stop now if we found a missing parent
+    IF missing_parents is not null THEN
+        RETURN missing_parents;
+    END IF;
+
+    -- No missing parent blocks, therefore candidate new chain head block
+    -- has the necessary minimum number of ancestors present in DB.
+
+    -- Set chain head block pointer to candidate chain head block
+    UPDATE ethereum_networks
+    SET
+        head_block_hash = new_head_hash,
+        head_block_number = new_head_number
+    WHERE name = net_name;
+
+    -- Fire chain head block update event
+    PERFORM pg_notify('chain_head_updates', json_build_object(
+        'network_name', net_name,
+        'head_block_hash', new_head_hash,
+        'head_block_number', new_head_number
+    )::text);
+
+    -- Done
+    RETURN ARRAY[]::VARCHAR[];
+END;
+$$ LANGUAGE plpgsql;
diff --git a/store/postgres/migrations/2021-01-26-044443_drop_attempt_chain_head_update/up.sql b/store/postgres/migrations/2021-01-26-044443_drop_attempt_chain_head_update/up.sql
new file mode 100644
index 0000000..8663667
--- /dev/null
+++ b/store/postgres/migrations/2021-01-26-044443_drop_attempt_chain_head_update/up.sql
@@ -0,0 +1 @@
+drop function attempt_chain_head_update(varchar, bigint);
diff --git a/store/postgres/migrations/2021-01-26-172953_drop_lookup_ancestor_block/down.sql b/store/postgres/migrations/2021-01-26-172953_drop_lookup_ancestor_block/down.sql
new file mode 100644
index 0000000..f527373
--- /dev/null
+++ b/store/postgres/migrations/2021-01-26-172953_drop_lookup_ancestor_block/down.sql
@@ -0,0 +1,37 @@
+-- Same as ../2018-09-07-220000_create_ancestor_lookup_procedure/up.sql
+
+CREATE OR REPLACE FUNCTION lookup_ancestor_block(start_block_hash VARCHAR, ancestor_count BIGINT)
+    RETURNS JSONB AS
+$$
+DECLARE
+    target_block_hash VARCHAR;
+    json_blob JSONB;
+BEGIN
+    -- Follow parent hashes back the necessary number of steps to find the
+    -- target block's hash.
+    WITH RECURSIVE
+        ancestors(block_hash, block_offset)
+        AS (
+            VALUES
+                (start_block_hash, 0)
+            UNION ALL
+                SELECT ethereum_blocks.parent_hash, ancestors.block_offset+1
+                FROM ancestors, ethereum_blocks
+                WHERE
+                    ancestors.block_hash = ethereum_blocks.hash
+                    AND block_offset < ancestor_count
+        )
+        SELECT block_hash
+        INTO target_block_hash
+        FROM ancestors
+        WHERE block_offset = ancestor_count;
+
+    -- Load the JSON blob from the target block
+    SELECT data INTO json_blob
+    FROM ethereum_blocks
+    WHERE hash = target_block_hash;
+
+    -- Return
+    RETURN json_blob;
+END;
+$$ LANGUAGE plpgsql;
diff --git a/store/postgres/migrations/2021-01-26-172953_drop_lookup_ancestor_block/up.sql b/store/postgres/migrations/2021-01-26-172953_drop_lookup_ancestor_block/up.sql
new file mode 100644
index 0000000..b96d32e
--- /dev/null
+++ b/store/postgres/migrations/2021-01-26-172953_drop_lookup_ancestor_block/up.sql
@@ -0,0 +1 @@
+drop function lookup_ancestor_block(varchar, bigint);
diff --git a/store/postgres/migrations/2021-01-26-173710_add_chains_namespace/down.sql b/store/postgres/migrations/2021-01-26-173710_add_chains_namespace/down.sql
new file mode 100644
index 0000000..3d2bac6
--- /dev/null
+++ b/store/postgres/migrations/2021-01-26-173710_add_chains_namespace/down.sql
@@ -0,0 +1,4 @@
+alter table chains
+  drop column namespace;
+alter table ethereum_networks
+  drop column namespace;
diff --git a/store/postgres/migrations/2021-01-26-173710_add_chains_namespace/up.sql b/store/postgres/migrations/2021-01-26-173710_add_chains_namespace/up.sql
new file mode 100644
index 0000000..08463eb
--- /dev/null
+++ b/store/postgres/migrations/2021-01-26-173710_add_chains_namespace/up.sql
@@ -0,0 +1,11 @@
+alter table chains
+  add column namespace text not null
+             default 'chain' || currval('chains_id_seq');
+-- all chain data so far lives in shared tables in 'public'
+update chains set namespace = 'public';
+
+alter table ethereum_networks
+  add column namespace text;
+update ethereum_networks set namespace = 'public';
+alter table ethereum_networks
+  alter column namespace set not null;
diff --git a/store/postgres/migrations/2021-01-26-204036_ethereum_networks_net_ident_not_null/down.sql b/store/postgres/migrations/2021-01-26-204036_ethereum_networks_net_ident_not_null/down.sql
new file mode 100644
index 0000000..126f90a
--- /dev/null
+++ b/store/postgres/migrations/2021-01-26-204036_ethereum_networks_net_ident_not_null/down.sql
@@ -0,0 +1,7 @@
+alter table chains
+  alter column net_version drop not null,
+  alter column genesis_block_hash drop not null;
+
+alter table ethereum_networks
+  alter column net_version drop not null,
+  alter column genesis_block_hash drop not null;
diff --git a/store/postgres/migrations/2021-01-26-204036_ethereum_networks_net_ident_not_null/up.sql b/store/postgres/migrations/2021-01-26-204036_ethereum_networks_net_ident_not_null/up.sql
new file mode 100644
index 0000000..fbc61f3
--- /dev/null
+++ b/store/postgres/migrations/2021-01-26-204036_ethereum_networks_net_ident_not_null/up.sql
@@ -0,0 +1,7 @@
+alter table chains
+  alter column net_version set not null,
+  alter column genesis_block_hash set not null;
+
+alter table ethereum_networks
+  alter column net_version set not null,
+  alter column genesis_block_hash set not null;
diff --git a/store/postgres/migrations/2021-02-17-205502_simplify_metadata/down.sql b/store/postgres/migrations/2021-02-17-205502_simplify_metadata/down.sql
new file mode 100644
index 0000000..2e467b4
--- /dev/null
+++ b/store/postgres/migrations/2021-02-17-205502_simplify_metadata/down.sql
@@ -0,0 +1,5 @@
+do $$
+begin
+  raise 'This migration is irreversible';
+end
+$$;
diff --git a/store/postgres/migrations/2021-02-17-205502_simplify_metadata/up.sql b/store/postgres/migrations/2021-02-17-205502_simplify_metadata/up.sql
new file mode 100644
index 0000000..b63a59f
--- /dev/null
+++ b/store/postgres/migrations/2021-02-17-205502_simplify_metadata/up.sql
@@ -0,0 +1,15 @@
+alter table subgraphs.subgraph_manifest
+      drop column data_sources,
+      drop column templates;
+drop table subgraphs.ethereum_contract_data_source;
+drop table subgraphs.ethereum_contract_data_source_template;
+drop table subgraphs.ethereum_contract_data_source_template_source;
+
+alter table subgraphs.dynamic_ethereum_contract_data_source
+      drop column mapping;
+drop table subgraphs.ethereum_contract_mapping;
+drop table subgraphs.ethereum_contract_abi;
+drop table subgraphs.ethereum_block_handler_entity;
+drop table subgraphs.ethereum_block_handler_filter_entity;
+drop table subgraphs.ethereum_call_handler_entity;
+drop table subgraphs.ethereum_contract_event_handler;
diff --git a/store/postgres/migrations/2021-02-18-000721_dds_embed_source/down.sql b/store/postgres/migrations/2021-02-18-000721_dds_embed_source/down.sql
new file mode 100644
index 0000000..d856566
--- /dev/null
+++ b/store/postgres/migrations/2021-02-18-000721_dds_embed_source/down.sql
@@ -0,0 +1,6 @@
+alter table subgraphs.dynamic_ethereum_contract_data_source
+      drop column address,
+      drop column abi,
+      drop column start_block;
+
+drop index subgraphs.dynamic_ethereum_contract_data_source_address;
diff --git a/store/postgres/migrations/2021-02-18-000721_dds_embed_source/up.sql b/store/postgres/migrations/2021-02-18-000721_dds_embed_source/up.sql
new file mode 100644
index 0000000..f4e680f
--- /dev/null
+++ b/store/postgres/migrations/2021-02-18-000721_dds_embed_source/up.sql
@@ -0,0 +1,10 @@
+alter table subgraphs.dynamic_ethereum_contract_data_source
+      add column address     bytea,
+      add column abi         text,
+      add column start_block int;
+
+-- We will use this index in a later migration to quickly identify
+-- dds whose ethereum_contract_source has not been copied into the table
+-- yet
+create index dynamic_ethereum_contract_data_source_address on
+  subgraphs.dynamic_ethereum_contract_data_source(address);
diff --git a/store/postgres/migrations/2021-02-18-171423_dds_remove_ethereum_contract_source/down.sql b/store/postgres/migrations/2021-02-18-171423_dds_remove_ethereum_contract_source/down.sql
new file mode 100644
index 0000000..2e467b4
--- /dev/null
+++ b/store/postgres/migrations/2021-02-18-171423_dds_remove_ethereum_contract_source/down.sql
@@ -0,0 +1,5 @@
+do $$
+begin
+  raise 'This migration is irreversible';
+end
+$$;
diff --git a/store/postgres/migrations/2021-02-18-171423_dds_remove_ethereum_contract_source/up.sql b/store/postgres/migrations/2021-02-18-171423_dds_remove_ethereum_contract_source/up.sql
new file mode 100644
index 0000000..dc49229
--- /dev/null
+++ b/store/postgres/migrations/2021-02-18-171423_dds_remove_ethereum_contract_source/up.sql
@@ -0,0 +1,23 @@
+drop index subgraphs.attr_6_1_dynamic_ethereum_contract_data_source_kind;
+drop index subgraphs.attr_6_2_dynamic_ethereum_contract_data_source_name;
+drop index subgraphs.attr_6_3_dynamic_ethereum_contract_data_source_network;
+drop index subgraphs.attr_6_7_dynamic_ethereum_contract_data_source_ethereum_block_h;
+drop index subgraphs.attr_6_8_dynamic_ethereum_contract_data_source_ethereum_block_n;
+
+update subgraphs.dynamic_ethereum_contract_data_source dds
+   set address = ecs.address,
+       abi = ecs.abi,
+       start_block = ecs.start_block::int
+  from subgraphs.ethereum_contract_source ecs
+ where dds.source = ecs.id
+   and dds.address is null;
+
+alter table subgraphs.dynamic_ethereum_contract_data_source
+      alter column address set not null,
+      alter column abi     set not null,
+      alter column start_block set not null;
+
+alter table subgraphs.dynamic_ethereum_contract_data_source
+      drop column source;
+drop table subgraphs.ethereum_contract_source;
+drop index subgraphs.dynamic_ethereum_contract_data_source_address;
diff --git a/store/postgres/migrations/2021-02-24-051050_dds_remove_unused_columns/down.sql b/store/postgres/migrations/2021-02-24-051050_dds_remove_unused_columns/down.sql
new file mode 100644
index 0000000..40cdc35
--- /dev/null
+++ b/store/postgres/migrations/2021-02-24-051050_dds_remove_unused_columns/down.sql
@@ -0,0 +1,4 @@
+begin
+  raise 'This migration is irreversible';
+end
+$$;
diff --git a/store/postgres/migrations/2021-02-24-051050_dds_remove_unused_columns/up.sql b/store/postgres/migrations/2021-02-24-051050_dds_remove_unused_columns/up.sql
new file mode 100644
index 0000000..e0a80e3
--- /dev/null
+++ b/store/postgres/migrations/2021-02-24-051050_dds_remove_unused_columns/up.sql
@@ -0,0 +1,3 @@
+alter table subgraphs.dynamic_ethereum_contract_data_source
+      drop column kind,
+      drop column network;
diff --git a/store/postgres/migrations/2021-02-25-233156_dds_remove_id_block_range/down.sql b/store/postgres/migrations/2021-02-25-233156_dds_remove_id_block_range/down.sql
new file mode 100644
index 0000000..2e467b4
--- /dev/null
+++ b/store/postgres/migrations/2021-02-25-233156_dds_remove_id_block_range/down.sql
@@ -0,0 +1,5 @@
+do $$
+begin
+  raise 'This migration is irreversible';
+end
+$$;
diff --git a/store/postgres/migrations/2021-02-25-233156_dds_remove_id_block_range/up.sql b/store/postgres/migrations/2021-02-25-233156_dds_remove_id_block_range/up.sql
new file mode 100644
index 0000000..82b4e31
--- /dev/null
+++ b/store/postgres/migrations/2021-02-25-233156_dds_remove_id_block_range/up.sql
@@ -0,0 +1,3 @@
+alter table subgraphs.dynamic_ethereum_contract_data_source
+      drop column id,
+      drop column block_range;
diff --git a/store/postgres/migrations/2021-03-11-010830_fdw/down.sql b/store/postgres/migrations/2021-03-11-010830_fdw/down.sql
new file mode 100644
index 0000000..4943136
--- /dev/null
+++ b/store/postgres/migrations/2021-03-11-010830_fdw/down.sql
@@ -0,0 +1 @@
+drop extension postgres_fdw;
diff --git a/store/postgres/migrations/2021-03-11-010830_fdw/up.sql b/store/postgres/migrations/2021-03-11-010830_fdw/up.sql
new file mode 100644
index 0000000..3b0097e
--- /dev/null
+++ b/store/postgres/migrations/2021-03-11-010830_fdw/up.sql
@@ -0,0 +1 @@
+create extension if not exists postgres_fdw;
diff --git a/store/postgres/migrations/2021-03-11-231340_subgraph_deployment_changes/down.sql b/store/postgres/migrations/2021-03-11-231340_subgraph_deployment_changes/down.sql
new file mode 100644
index 0000000..2e467b4
--- /dev/null
+++ b/store/postgres/migrations/2021-03-11-231340_subgraph_deployment_changes/down.sql
@@ -0,0 +1,5 @@
+do $$
+begin
+  raise 'This migration is irreversible';
+end
+$$;
diff --git a/store/postgres/migrations/2021-03-11-231340_subgraph_deployment_changes/up.sql b/store/postgres/migrations/2021-03-11-231340_subgraph_deployment_changes/up.sql
new file mode 100644
index 0000000..c303377
--- /dev/null
+++ b/store/postgres/migrations/2021-03-11-231340_subgraph_deployment_changes/up.sql
@@ -0,0 +1,6 @@
+alter table subgraphs.subgraph_deployment
+      drop column block_range;
+alter table subgraphs.subgraph_deployment
+      rename column id to deployment;
+alter table subgraphs.subgraph_deployment
+      add column id int;
diff --git a/store/postgres/migrations/2021-03-12-014815_subgraph_deployment_pkey/down.sql b/store/postgres/migrations/2021-03-12-014815_subgraph_deployment_pkey/down.sql
new file mode 100644
index 0000000..2e467b4
--- /dev/null
+++ b/store/postgres/migrations/2021-03-12-014815_subgraph_deployment_pkey/down.sql
@@ -0,0 +1,5 @@
+do $$
+begin
+  raise 'This migration is irreversible';
+end
+$$;
diff --git a/store/postgres/migrations/2021-03-12-014815_subgraph_deployment_pkey/up.sql b/store/postgres/migrations/2021-03-12-014815_subgraph_deployment_pkey/up.sql
new file mode 100644
index 0000000..035b518
--- /dev/null
+++ b/store/postgres/migrations/2021-03-12-014815_subgraph_deployment_pkey/up.sql
@@ -0,0 +1,14 @@
+update subgraphs.subgraph_deployment d
+   set id = ds.id
+  from deployment_schemas ds
+ where ds.subgraph = d.deployment
+   and d.id is null;
+
+alter table subgraphs.subgraph_deployment
+      drop constraint subgraph_deployment_pkey;
+
+alter table subgraphs.subgraph_deployment
+      add primary key(id);
+
+alter table subgraphs.subgraph_deployment
+      drop column vid;
diff --git a/store/postgres/migrations/2021-03-12-070453_add_copy_state/down.sql b/store/postgres/migrations/2021-03-12-070453_add_copy_state/down.sql
new file mode 100644
index 0000000..e8f5228
--- /dev/null
+++ b/store/postgres/migrations/2021-03-12-070453_add_copy_state/down.sql
@@ -0,0 +1,3 @@
+drop table subgraphs.copy_table_state;
+drop table subgraphs.copy_state;
+drop table active_copies;
diff --git a/store/postgres/migrations/2021-03-12-070453_add_copy_state/up.sql b/store/postgres/migrations/2021-03-12-070453_add_copy_state/up.sql
new file mode 100644
index 0000000..bccfbab
--- /dev/null
+++ b/store/postgres/migrations/2021-03-12-070453_add_copy_state/up.sql
@@ -0,0 +1,37 @@
+-- This is populated in the primary
+create table active_copies(
+   src          int not null references deployment_schemas(id),
+   dst          int primary key
+                    references deployment_schemas(id) on delete cascade,
+   queued_at    timestamptz not null,
+   cancelled_at timestamptz,
+   unique(src, dst)
+);
+
+-- These two tables live in each shard; entries are in the same
+-- shard as the subgraph_deployment we are copying to ('dst')
+create table subgraphs.copy_state(
+   src                 int not null,
+   dst                 int primary key
+                           references subgraphs.subgraph_deployment(id)
+                                  on delete cascade,
+   target_block_hash   bytea not null,
+   target_block_number int not null,
+   started_at          timestamptz not null default now(),
+   finished_at         timestamptz,
+   cancelled_at        timestamptz
+);
+
+create table subgraphs.copy_table_state(
+   id            serial primary key,
+   entity_type   text not null,
+   dst           int not null
+                     references subgraphs.copy_state(dst) on delete cascade,
+   next_vid      int8 not null,
+   target_vid    int8 not null,
+   batch_size    int8 not null,
+   started_at    timestamptz not null default now(),
+   finished_at   timestamptz,
+   duration_ms   int8 not null default 0,
+   unique(dst, entity_type)
+);
diff --git a/store/postgres/migrations/2021-03-16-001809_assignment_deployment/down.sql b/store/postgres/migrations/2021-03-16-001809_assignment_deployment/down.sql
new file mode 100644
index 0000000..2e467b4
--- /dev/null
+++ b/store/postgres/migrations/2021-03-16-001809_assignment_deployment/down.sql
@@ -0,0 +1,5 @@
+do $$
+begin
+  raise 'This migration is irreversible';
+end
+$$;
diff --git a/store/postgres/migrations/2021-03-16-001809_assignment_deployment/up.sql b/store/postgres/migrations/2021-03-16-001809_assignment_deployment/up.sql
new file mode 100644
index 0000000..f3fd262
--- /dev/null
+++ b/store/postgres/migrations/2021-03-16-001809_assignment_deployment/up.sql
@@ -0,0 +1,19 @@
+alter table subgraphs.subgraph_deployment_assignment
+      add column new_id int;
+
+update subgraphs.subgraph_deployment_assignment a
+   set new_id = ds.id
+  from deployment_schemas ds
+ where ds.subgraph = a.id;
+
+alter table subgraphs.subgraph_deployment_assignment
+      drop column id,
+      drop column vid,
+      drop column block_range,
+      drop column cost;
+
+alter table subgraphs.subgraph_deployment_assignment
+      rename column new_id to id;
+
+alter table subgraphs.subgraph_deployment_assignment
+      add primary key(id);
diff --git a/store/postgres/migrations/2021-03-16-165131_subgraph_manifest/down.sql b/store/postgres/migrations/2021-03-16-165131_subgraph_manifest/down.sql
new file mode 100644
index 0000000..2e467b4
--- /dev/null
+++ b/store/postgres/migrations/2021-03-16-165131_subgraph_manifest/down.sql
@@ -0,0 +1,5 @@
+do $$
+begin
+  raise 'This migration is irreversible';
+end
+$$;
diff --git a/store/postgres/migrations/2021-03-16-165131_subgraph_manifest/up.sql b/store/postgres/migrations/2021-03-16-165131_subgraph_manifest/up.sql
new file mode 100644
index 0000000..77143bb
--- /dev/null
+++ b/store/postgres/migrations/2021-03-16-165131_subgraph_manifest/up.sql
@@ -0,0 +1,27 @@
+alter table subgraphs.subgraph_manifest
+      add column new_id int
+          references subgraphs.subgraph_deployment(id) on delete cascade;
+
+update subgraphs.subgraph_manifest m
+   set new_id = d.id
+  from subgraphs.subgraph_deployment d
+ where d.manifest = m.id;
+
+alter table subgraphs.subgraph_manifest
+      drop column id,
+      drop column vid,
+      drop column block_range;
+
+alter table subgraphs.subgraph_manifest
+      rename column new_id to id;
+
+alter table subgraphs.subgraph_manifest
+      add primary key(id);
+
+alter table subgraphs.subgraph_deployment
+      drop column manifest;
+
+drop index subgraphs.attr_4_1_subgraph_manifest_spec_version;
+drop index subgraphs.attr_4_2_subgraph_manifest_description;
+drop index subgraphs.attr_4_3_subgraph_manifest_repository;
+drop index subgraphs.attr_4_4_subgraph_manifest_schema;
diff --git a/store/postgres/migrations/2021-03-19-161012_unused_deployments_pk/down.sql b/store/postgres/migrations/2021-03-19-161012_unused_deployments_pk/down.sql
new file mode 100644
index 0000000..2e467b4
--- /dev/null
+++ b/store/postgres/migrations/2021-03-19-161012_unused_deployments_pk/down.sql
@@ -0,0 +1,5 @@
+do $$
+begin
+  raise 'This migration is irreversible';
+end
+$$;
diff --git a/store/postgres/migrations/2021-03-19-161012_unused_deployments_pk/up.sql b/store/postgres/migrations/2021-03-19-161012_unused_deployments_pk/up.sql
new file mode 100644
index 0000000..74c1c45
--- /dev/null
+++ b/store/postgres/migrations/2021-03-19-161012_unused_deployments_pk/up.sql
@@ -0,0 +1,19 @@
+alter table unused_deployments
+      add column new_id int;
+
+-- Recover the deployment_schemas.id from existing unused_deployments
+-- entries
+update unused_deployments
+   set new_id = replace(namespace, 'sgd', '')::int;
+
+alter table unused_deployments
+      rename column id to deployment;
+
+alter table unused_deployments
+      rename column new_id to id;
+
+alter table unused_deployments
+      drop constraint unused_deployments_pkey;
+
+alter table unused_deployments
+      add primary key(id);
diff --git a/store/postgres/migrations/2021-03-20-001347_deployment_schemas_active/down.sql b/store/postgres/migrations/2021-03-20-001347_deployment_schemas_active/down.sql
new file mode 100644
index 0000000..291a97c
--- /dev/null
+++ b/store/postgres/migrations/2021-03-20-001347_deployment_schemas_active/down.sql
@@ -0,0 +1 @@
+-- This file should undo anything in `up.sql`
\ No newline at end of file
diff --git a/store/postgres/migrations/2021-03-20-001347_deployment_schemas_active/up.sql b/store/postgres/migrations/2021-03-20-001347_deployment_schemas_active/up.sql
new file mode 100644
index 0000000..43d6e96
--- /dev/null
+++ b/store/postgres/migrations/2021-03-20-001347_deployment_schemas_active/up.sql
@@ -0,0 +1,12 @@
+alter table deployment_schemas
+      add column active bool;
+
+update deployment_schemas
+   set active = true;
+
+alter table deployment_schemas
+      alter column active set not null;
+
+-- we only allow one active entry per IPFS hash
+create unique index deployment_schemas_deployment_active
+       on deployment_schemas(subgraph) where active;
diff --git a/store/postgres/migrations/2021-03-24-220541_deployment_schemas_deployment_shard/down.sql b/store/postgres/migrations/2021-03-24-220541_deployment_schemas_deployment_shard/down.sql
new file mode 100644
index 0000000..69d7ce7
--- /dev/null
+++ b/store/postgres/migrations/2021-03-24-220541_deployment_schemas_deployment_shard/down.sql
@@ -0,0 +1,4 @@
+drop constraint deployment_schemas_subgraph_shard_uq;
+
+create unique index deployment_schemas_subgraph_key
+       on deployment_schemas(subgraph);
diff --git a/store/postgres/migrations/2021-03-24-220541_deployment_schemas_deployment_shard/up.sql b/store/postgres/migrations/2021-03-24-220541_deployment_schemas_deployment_shard/up.sql
new file mode 100644
index 0000000..367c0bf
--- /dev/null
+++ b/store/postgres/migrations/2021-03-24-220541_deployment_schemas_deployment_shard/up.sql
@@ -0,0 +1,5 @@
+alter table deployment_schemas
+      drop constraint deployment_schemas_subgraph_key;
+
+create unique index deployment_schemas_subgraph_shard_uq
+       on deployment_schemas(subgraph, shard);
diff --git a/store/postgres/migrations/2021-05-20-130220_graph_node_version/down.sql b/store/postgres/migrations/2021-05-20-130220_graph_node_version/down.sql
new file mode 100644
index 0000000..1d88313
--- /dev/null
+++ b/store/postgres/migrations/2021-05-20-130220_graph_node_version/down.sql
@@ -0,0 +1,5 @@
+alter table subgraphs.subgraph_manifest
+    drop constraint graph_node_versions_fk,
+    drop column graph_node_version_id;
+
+drop table if exists subgraphs.graph_node_versions;
diff --git a/store/postgres/migrations/2021-05-20-130220_graph_node_version/up.sql b/store/postgres/migrations/2021-05-20-130220_graph_node_version/up.sql
new file mode 100644
index 0000000..ba303fe
--- /dev/null
+++ b/store/postgres/migrations/2021-05-20-130220_graph_node_version/up.sql
@@ -0,0 +1,14 @@
+create table if not exists subgraphs.graph_node_versions (
+    id serial primary key,
+    git_commit_hash text not null,
+    git_repository_dirty boolean not null,
+    crate_version text not null,
+    major integer not null,
+    minor integer not null,
+    patch integer not null,
+    constraint unique_graph_node_versions unique (git_commit_hash, git_repository_dirty, crate_version, major, minor, patch)
+);
+
+alter table subgraphs.subgraph_manifest
+    add column graph_node_version_id integer,
+    add constraint graph_node_versions_fk foreign key (graph_node_version_id) references subgraphs.graph_node_versions (id);
diff --git a/store/postgres/migrations/2021-05-21-165219_add_created_at_columns_for_deployment_schemas/down.sql b/store/postgres/migrations/2021-05-21-165219_add_created_at_columns_for_deployment_schemas/down.sql
new file mode 100644
index 0000000..5f6259f
--- /dev/null
+++ b/store/postgres/migrations/2021-05-21-165219_add_created_at_columns_for_deployment_schemas/down.sql
@@ -0,0 +1,5 @@
+alter table public.deployment_schemas
+    drop column created_at;
+
+alter table public.unused_deployments
+    drop column created_at;
diff --git a/store/postgres/migrations/2021-05-21-165219_add_created_at_columns_for_deployment_schemas/up.sql b/store/postgres/migrations/2021-05-21-165219_add_created_at_columns_for_deployment_schemas/up.sql
new file mode 100644
index 0000000..4fa5753
--- /dev/null
+++ b/store/postgres/migrations/2021-05-21-165219_add_created_at_columns_for_deployment_schemas/up.sql
@@ -0,0 +1,14 @@
+alter table public.deployment_schemas
+    add column created_at timestamptz not null default now();
+
+alter table public.unused_deployments
+    add column created_at timestamptz;
+
+-- use a predefined default date that doesn't have a meaning.
+update
+    public.unused_deployments
+set
+    created_at = '2000-01-01';
+
+alter table public.unused_deployments
+    alter column created_at set not null;
diff --git a/store/postgres/migrations/2021-06-01-222649_create_stats/down.sql b/store/postgres/migrations/2021-06-01-222649_create_stats/down.sql
new file mode 100644
index 0000000..d4f2f3d
--- /dev/null
+++ b/store/postgres/migrations/2021-06-01-222649_create_stats/down.sql
@@ -0,0 +1 @@
+drop table subgraphs.table_stats;
diff --git a/store/postgres/migrations/2021-06-01-222649_create_stats/up.sql b/store/postgres/migrations/2021-06-01-222649_create_stats/up.sql
new file mode 100644
index 0000000..9045858
--- /dev/null
+++ b/store/postgres/migrations/2021-06-01-222649_create_stats/up.sql
@@ -0,0 +1,9 @@
+create table subgraphs.table_stats(
+  id              serial primary key,
+  deployment      int not null
+                  references subgraphs.subgraph_deployment
+                  on delete cascade,
+  table_name      text not null,
+  is_account_like bool,
+  unique(deployment, table_name)
+);
diff --git a/store/postgres/migrations/2021-06-14-201635_add_ethereum_hex_to_bytea_function/down.sql b/store/postgres/migrations/2021-06-14-201635_add_ethereum_hex_to_bytea_function/down.sql
new file mode 100644
index 0000000..6f4151c
--- /dev/null
+++ b/store/postgres/migrations/2021-06-14-201635_add_ethereum_hex_to_bytea_function/down.sql
@@ -0,0 +1,2 @@
+drop function if exists ethereum_hex_to_bytea (text);
+drop function if exists raise_exception_bytea (text);
diff --git a/store/postgres/migrations/2021-06-14-201635_add_ethereum_hex_to_bytea_function/up.sql b/store/postgres/migrations/2021-06-14-201635_add_ethereum_hex_to_bytea_function/up.sql
new file mode 100644
index 0000000..6a4058f
--- /dev/null
+++ b/store/postgres/migrations/2021-06-14-201635_add_ethereum_hex_to_bytea_function/up.sql
@@ -0,0 +1,47 @@
+/*
+Since we deal with a lot of hex data encoded in a very specific string pattern [see link #1], we
+need a function to convert that data into byte arrays (the "bytea" PostgreSQL type). Using byte
+arrays is also useful because the former occupies double the space of the latter.
+
+The idea is to have a deliberately generic database function to send bytes over so we can re-encode
+them into concrete types, such as U64 and H256 and booleans.
+
+Examples:
+1. ethereum_hex_to_bytea(null)         -> null
+2. ethereum_hex_to_bytea("0x1")        -> \x01
+3. ethereum_hex_to_bytea("0x0")        -> \x00
+4. ethereum_hex_to_bytea("0xdeadbeef") -> \xdeadbeef
+5. ethereum_hex_to_bytea("0x")         -> ERROR: Can't decode an empty hexadecimal string.
+6. ethereum_hex_to_bytea("")           -> ERROR: Input must start with '0x'.
+
+
+[1: https://openethereum.github.io/JSONRPC#types-in-the-jsonrpc]
+ */
+create or replace function raise_exception_bytea (text)
+    returns bytea
+    as $$
+begin
+    raise exception '%', $1;
+end;
+$$
+language plpgsql
+volatile;
+
+create or replace function ethereum_hex_to_bytea (eth_hex text)
+    returns bytea
+    as $$
+    select
+        case when $1 is null then
+            null
+        when not substring(eth_hex from 1 for  2) = '0x' then
+            raise_exception_bytea('Input must start with ''0x''.')
+        when length(eth_hex) = 2 then
+            raise_exception_bytea('Can''t decode an empty hexadecimal string.')
+        when length($1) % 2 = 0 then
+            decode(right ($1, -2), 'hex')
+        else
+            decode(replace(eth_hex, 'x', ''), 'hex')
+        end as return
+$$
+language sql
+immutable strict;
diff --git a/store/postgres/migrations/2021-07-09-144144_firehose_cursor/down.sql b/store/postgres/migrations/2021-07-09-144144_firehose_cursor/down.sql
new file mode 100644
index 0000000..305e13e
--- /dev/null
+++ b/store/postgres/migrations/2021-07-09-144144_firehose_cursor/down.sql
@@ -0,0 +1,2 @@
+alter table subgraphs.subgraph_deployment
+    drop column firehose_cursor;
diff --git a/store/postgres/migrations/2021-07-09-144144_firehose_cursor/up.sql b/store/postgres/migrations/2021-07-09-144144_firehose_cursor/up.sql
new file mode 100644
index 0000000..6cac66e
--- /dev/null
+++ b/store/postgres/migrations/2021-07-09-144144_firehose_cursor/up.sql
@@ -0,0 +1,2 @@
+alter table subgraphs.subgraph_deployment
+    add column firehose_cursor text default null;
diff --git a/store/postgres/migrations/2021-12-02-212506_chain_store_firehose_cursor/down.sql b/store/postgres/migrations/2021-12-02-212506_chain_store_firehose_cursor/down.sql
new file mode 100644
index 0000000..81eb012
--- /dev/null
+++ b/store/postgres/migrations/2021-12-02-212506_chain_store_firehose_cursor/down.sql
@@ -0,0 +1,6 @@
+update public.ethereum_networks
+    set genesis_block_hash = '0000000000000000000000000000000000000000000000000000000000000000'
+    where name = 'near-mainnet';
+
+alter table public.ethereum_networks
+    drop column head_block_cursor;
diff --git a/store/postgres/migrations/2021-12-02-212506_chain_store_firehose_cursor/up.sql b/store/postgres/migrations/2021-12-02-212506_chain_store_firehose_cursor/up.sql
new file mode 100644
index 0000000..be5672e
--- /dev/null
+++ b/store/postgres/migrations/2021-12-02-212506_chain_store_firehose_cursor/up.sql
@@ -0,0 +1,6 @@
+alter table public.ethereum_networks
+    add column head_block_cursor text default null;
+
+update public.ethereum_networks
+    set genesis_block_hash = 'a7110b9052e1be68f7fa8bb4065bf54e731205801878e708db7464ec4b9b8014'
+    where name = 'near-mainnet';
\ No newline at end of file
diff --git a/store/postgres/migrations/2021-12-05-061157_add_debug_fork/down.sql b/store/postgres/migrations/2021-12-05-061157_add_debug_fork/down.sql
new file mode 100644
index 0000000..01168e6
--- /dev/null
+++ b/store/postgres/migrations/2021-12-05-061157_add_debug_fork/down.sql
@@ -0,0 +1,4 @@
+alter table
+    subgraphs.subgraph_deployment
+drop
+    column debug_fork;
diff --git a/store/postgres/migrations/2021-12-05-061157_add_debug_fork/up.sql b/store/postgres/migrations/2021-12-05-061157_add_debug_fork/up.sql
new file mode 100644
index 0000000..7d83056
--- /dev/null
+++ b/store/postgres/migrations/2021-12-05-061157_add_debug_fork/up.sql
@@ -0,0 +1,4 @@
+alter table
+    subgraphs.subgraph_deployment
+add
+    column debug_fork text;
diff --git a/store/postgres/migrations/2022-03-09-07000_call_cache_block_number_idx/down.sql b/store/postgres/migrations/2022-03-09-07000_call_cache_block_number_idx/down.sql
new file mode 100644
index 0000000..cb194e4
--- /dev/null
+++ b/store/postgres/migrations/2022-03-09-07000_call_cache_block_number_idx/down.sql
@@ -0,0 +1,17 @@
+drop index eth_call_cache_block_number_idx;
+
+do $$
+declare
+    tables cursor for select namespace
+                        from ethereum_networks
+                       where namespace != 'public';
+begin
+	for table_record in tables loop
+		execute
+			'drop index '
+			|| table_record.namespace
+			|| '.'
+			|| 'call_cache_block_number_idx';
+	end loop;
+end;
+$$;
diff --git a/store/postgres/migrations/2022-03-09-07000_call_cache_block_number_idx/up.sql b/store/postgres/migrations/2022-03-09-07000_call_cache_block_number_idx/up.sql
new file mode 100644
index 0000000..9b48fec
--- /dev/null
+++ b/store/postgres/migrations/2022-03-09-07000_call_cache_block_number_idx/up.sql
@@ -0,0 +1,20 @@
+create index if not exists
+	eth_call_cache_block_number_idx
+on
+	eth_call_cache(block_number);
+
+do $$
+declare
+    tables cursor for select namespace
+                        from ethereum_networks
+                       where namespace != 'public';
+begin
+	for table_record in tables loop
+		execute
+			'create index if not exists call_cache_block_number_idx on '
+			|| table_record.namespace
+			|| '.'
+			|| 'call_cache(block_number)';
+	end loop;
+end;
+$$;
diff --git a/store/postgres/migrations/2022-03-21-172028_add_use_bytea_prefix/down.sql b/store/postgres/migrations/2022-03-21-172028_add_use_bytea_prefix/down.sql
new file mode 100644
index 0000000..f51847f
--- /dev/null
+++ b/store/postgres/migrations/2022-03-21-172028_add_use_bytea_prefix/down.sql
@@ -0,0 +1,2 @@
+alter table subgraphs.subgraph_manifest
+      drop column use_bytea_prefix;
diff --git a/store/postgres/migrations/2022-03-21-172028_add_use_bytea_prefix/up.sql b/store/postgres/migrations/2022-03-21-172028_add_use_bytea_prefix/up.sql
new file mode 100644
index 0000000..1b5c88c
--- /dev/null
+++ b/store/postgres/migrations/2022-03-21-172028_add_use_bytea_prefix/up.sql
@@ -0,0 +1,2 @@
+alter table subgraphs.subgraph_manifest
+      add column use_bytea_prefix bool not null default 'f';
diff --git a/store/postgres/migrations/2022-03-23-010300_drop-metadata-indexes/down.sql b/store/postgres/migrations/2022-03-23-010300_drop-metadata-indexes/down.sql
new file mode 100644
index 0000000..cec3dcb
--- /dev/null
+++ b/store/postgres/migrations/2022-03-23-010300_drop-metadata-indexes/down.sql
@@ -0,0 +1 @@
+-- up only deletes indexes, no need to recreate them
diff --git a/store/postgres/migrations/2022-03-23-010300_drop-metadata-indexes/up.sql b/store/postgres/migrations/2022-03-23-010300_drop-metadata-indexes/up.sql
new file mode 100644
index 0000000..2183a26
--- /dev/null
+++ b/store/postgres/migrations/2022-03-23-010300_drop-metadata-indexes/up.sql
@@ -0,0 +1,20 @@
+-- none of these indexes are needed for queries we run on subgraph_deployment
+drop index if exists subgraphs.attr_2_0_subgraph_deployment_id;
+drop index if exists subgraphs.attr_2_2_subgraph_deployment_failed;
+drop index if exists subgraphs.attr_2_3_subgraph_deployment_synced;
+drop index if exists
+  subgraphs.attr_2_4_subgraph_deployment_earliest_ethereum_block_hash;
+drop index if exists
+  subgraphs.attr_2_5_subgraph_deployment_earliest_ethereum_block_number;
+drop index if exists
+  subgraphs.attr_2_6_subgraph_deployment_latest_ethereum_block_hash;
+drop index if exists
+  subgraphs.attr_2_7_subgraph_deployment_latest_ethereum_block_number;
+drop index if exists subgraphs.attr_2_11_subgraph_deployment_entity_count;
+drop index if exists subgraphs.attr_subgraph_deployment_health;
+
+-- these indexes use the 'left' prefix of an attr, which we don't use in queries
+drop index if exists
+  subgraphs.attr_3_1_subgraph_deployment_assignment_node_id;
+drop index if exists
+  subgraphs.attr_16_1_subgraph_error_subgraph_id;
diff --git a/store/postgres/migrations/2022-04-26-125552_alter_deployment_schemas_version/down.sql b/store/postgres/migrations/2022-04-26-125552_alter_deployment_schemas_version/down.sql
new file mode 100644
index 0000000..4121d43
--- /dev/null
+++ b/store/postgres/migrations/2022-04-26-125552_alter_deployment_schemas_version/down.sql
@@ -0,0 +1,61 @@
+-- This file should undo anything in `up.sql`
+
+-- This is dropped and left for the fdw logic which runs after migrations to recreate.
+drop schema if exists primary_public cascade;
+
+drop view if exists info.subgraph_info;
+drop view if exists info.all_sizes;
+drop materialized view if exists info.subgraph_sizes;
+
+create type deployment_schema_version as enum('split', 'relational');
+alter table if exists deployment_schemas alter version type deployment_schema_version using 'relational';
+
+create view info.subgraph_info as
+SELECT ds.id AS schema_id,
+    ds.name AS schema_name,
+    ds.subgraph,
+    ds.version,
+    s.name,
+        CASE
+            WHEN s.pending_version = v.id THEN 'pending'::text
+            WHEN s.current_version = v.id THEN 'current'::text
+            ELSE 'unused'::text
+        END AS status,
+    d.failed,
+    d.synced
+   FROM deployment_schemas ds,
+    subgraphs.subgraph_deployment d,
+    subgraphs.subgraph_version v,
+    subgraphs.subgraph s
+  WHERE d.deployment = ds.subgraph::text AND v.deployment = d.deployment AND v.subgraph = s.id;
+
+create materialized view info.subgraph_sizes as
+select *,
+       pg_size_pretty(total_bytes) as total,
+       pg_size_pretty(index_bytes) as index,
+       pg_size_pretty(toast_bytes) as toast,
+       pg_size_pretty(table_bytes) as table
+  from (
+    select *,
+           total_bytes-index_bytes-coalesce(toast_bytes,0) AS table_bytes
+      from (
+        select nspname as name,
+               ds.subgraph as subgraph,
+               ds.version::text as version,
+               sum(c.reltuples) as row_estimate,
+               sum(pg_total_relation_size(c.oid)) as total_bytes,
+               sum(pg_indexes_size(c.oid)) as index_bytes,
+               sum(pg_total_relation_size(reltoastrelid)) as toast_bytes
+          from pg_class c
+               join pg_namespace n on n.oid = c.relnamespace
+               join deployment_schemas ds on ds."name" = n.nspname
+          where relkind = 'r'
+            and nspname like 'sgd%'
+          group by nspname, subgraph, version
+  ) a
+) a with no data;
+
+create view info.all_sizes as
+select * from info.subgraph_sizes
+union all
+select * from info.table_sizes;
diff --git a/store/postgres/migrations/2022-04-26-125552_alter_deployment_schemas_version/up.sql b/store/postgres/migrations/2022-04-26-125552_alter_deployment_schemas_version/up.sql
new file mode 100644
index 0000000..c952c02
--- /dev/null
+++ b/store/postgres/migrations/2022-04-26-125552_alter_deployment_schemas_version/up.sql
@@ -0,0 +1,62 @@
+--  Alter `deployment_schemas.version` from enum to integer.
+--  Some views are recreated because they depend on the altered column.
+
+-- This is left for the fdw logic which runs after migrations to recreate.
+drop schema if exists primary_public cascade;
+
+drop view if exists info.subgraph_info;
+drop view if exists info.all_sizes;
+drop materialized view if exists info.subgraph_sizes;
+
+alter table deployment_schemas alter version type integer using 0;
+drop type if exists deployment_schema_version;
+
+create view info.subgraph_info as
+SELECT ds.id AS schema_id,
+    ds.name AS schema_name,
+    ds.subgraph,
+    ds.version,
+    s.name,
+        CASE
+            WHEN s.pending_version = v.id THEN 'pending'::text
+            WHEN s.current_version = v.id THEN 'current'::text
+            ELSE 'unused'::text
+        END AS status,
+    d.failed,
+    d.synced
+   FROM deployment_schemas ds,
+    subgraphs.subgraph_deployment d,
+    subgraphs.subgraph_version v,
+    subgraphs.subgraph s
+  WHERE d.deployment = ds.subgraph::text AND v.deployment = d.deployment AND v.subgraph = s.id;
+
+create materialized view info.subgraph_sizes as
+select *,
+       pg_size_pretty(total_bytes) as total,
+       pg_size_pretty(index_bytes) as index,
+       pg_size_pretty(toast_bytes) as toast,
+       pg_size_pretty(table_bytes) as table
+  from (
+    select *,
+           total_bytes-index_bytes-coalesce(toast_bytes,0) AS table_bytes
+      from (
+        select nspname as name,
+               ds.subgraph as subgraph,
+               ds.version::text as version,
+               sum(c.reltuples) as row_estimate,
+               sum(pg_total_relation_size(c.oid)) as total_bytes,
+               sum(pg_indexes_size(c.oid)) as index_bytes,
+               sum(pg_total_relation_size(reltoastrelid)) as toast_bytes
+          from pg_class c
+               join pg_namespace n on n.oid = c.relnamespace
+               join deployment_schemas ds on ds."name" = n.nspname
+          where relkind = 'r'
+            and nspname like 'sgd%'
+          group by nspname, subgraph, version
+  ) a
+) a with no data;
+
+create view info.all_sizes as
+select * from info.subgraph_sizes
+union all
+select * from info.table_sizes;
diff --git a/store/postgres/migrations/2022-06-12-003442_move_earliest_to_manifest/down.sql b/store/postgres/migrations/2022-06-12-003442_move_earliest_to_manifest/down.sql
new file mode 100644
index 0000000..49993bf
--- /dev/null
+++ b/store/postgres/migrations/2022-06-12-003442_move_earliest_to_manifest/down.sql
@@ -0,0 +1,6 @@
+alter table subgraphs.subgraph_deployment
+      drop column earliest_block_number;
+
+alter table subgraphs.subgraph_manifest
+      drop column start_block_number,
+      drop column start_block_hash;
diff --git a/store/postgres/migrations/2022-06-12-003442_move_earliest_to_manifest/up.sql b/store/postgres/migrations/2022-06-12-003442_move_earliest_to_manifest/up.sql
new file mode 100644
index 0000000..89043b2
--- /dev/null
+++ b/store/postgres/migrations/2022-06-12-003442_move_earliest_to_manifest/up.sql
@@ -0,0 +1,16 @@
+alter table subgraphs.subgraph_manifest
+      add column start_block_number int4,
+      add column start_block_hash   bytea;
+
+update subgraphs.subgraph_manifest m
+   set start_block_number = d.earliest_ethereum_block_number,
+       start_block_hash = d.earliest_ethereum_block_hash
+  from subgraphs.subgraph_deployment d
+ where m.id = d.id;
+
+alter table subgraphs.subgraph_deployment
+      add column earliest_block_number int4 not null default 0;
+
+update subgraphs.subgraph_deployment
+   set earliest_block_number = earliest_ethereum_block_number
+ where earliest_ethereum_block_number is not null;
diff --git a/store/postgres/src/advisory_lock.rs b/store/postgres/src/advisory_lock.rs
new file mode 100644
index 0000000..6b98d51
--- /dev/null
+++ b/store/postgres/src/advisory_lock.rs
@@ -0,0 +1,46 @@
+//! Helpers for using advisory locks. We centralize all use of these locks
+//! in this module to make it easier to see what they are used for.
+//!
+//! The [Postgres
+//! documentation](https://www.postgresql.org/docs/current/explicit-locking.html#ADVISORY-LOCKS)
+//! has more details on advisory locks.
+//!
+//! We use the following 64 bit locks:
+//!   * 1,2: to synchronize on migratons
+//!
+//! We use the following 2x 32-bit locks
+//!   * 1, n: to lock copying of the deployment with id n in the destination
+//!           shard
+
+use diesel::{sql_query, PgConnection, RunQueryDsl};
+use graph::prelude::StoreError;
+
+use crate::command_support::catalog::Site;
+
+/// Get a lock for running migrations. Blocks until we get
+/// the lock.
+pub(crate) fn lock_migration(conn: &PgConnection) -> Result<(), StoreError> {
+    sql_query("select pg_advisory_lock(1)").execute(conn)?;
+
+    Ok(())
+}
+
+/// Release the migration lock.
+pub(crate) fn unlock_migration(conn: &PgConnection) -> Result<(), StoreError> {
+    sql_query("select pg_advisory_unlock(1)").execute(conn)?;
+    Ok(())
+}
+
+pub(crate) fn lock_copying(conn: &PgConnection, dst: &Site) -> Result<(), StoreError> {
+    sql_query(&format!("select pg_advisory_lock(1, {})", dst.id))
+        .execute(conn)
+        .map(|_| ())
+        .map_err(StoreError::from)
+}
+
+pub(crate) fn unlock_copying(conn: &PgConnection, dst: &Site) -> Result<(), StoreError> {
+    sql_query(&format!("select pg_advisory_unlock(1, {})", dst.id))
+        .execute(conn)
+        .map(|_| ())
+        .map_err(StoreError::from)
+}
diff --git a/store/postgres/src/block_range.rs b/store/postgres/src/block_range.rs
new file mode 100644
index 0000000..64bb890
--- /dev/null
+++ b/store/postgres/src/block_range.rs
@@ -0,0 +1,306 @@
+use diesel::pg::Pg;
+use diesel::query_builder::{AstPass, QueryFragment};
+use diesel::result::QueryResult;
+///! Utilities to deal with block numbers and block ranges
+use diesel::serialize::{Output, ToSql};
+use diesel::sql_types::{Integer, Range};
+use std::io::Write;
+use std::ops::{Bound, RangeBounds, RangeFrom};
+
+use graph::prelude::{BlockNumber, BlockPtr, BLOCK_NUMBER_MAX};
+
+use crate::relational::Table;
+
+/// The name of the column in which we store the block range for mutable
+/// entities
+pub(crate) const BLOCK_RANGE_COLUMN: &str = "block_range";
+
+/// The SQL clause we use to check that an entity version is current;
+/// that version has an unbounded block range, but checking for
+/// `upper_inf(block_range)` is slow and can't use the exclusion
+/// index we have on entity tables; we therefore check if i32::MAX is
+/// in the range
+pub(crate) const BLOCK_RANGE_CURRENT: &str = "block_range @> 2147483647";
+
+/// Most subgraph metadata entities are not versioned. For such entities, we
+/// want two things:
+///   - any CRUD operation modifies such an entity in place
+///   - queries by a block number consider such an entity as present for
+///     any block number
+/// We therefore mark such entities with a block range `[-1,\infinity)`; we
+/// use `-1` as the lower bound to make it easier to identify such entities
+/// for troubleshooting/debugging
+pub(crate) const BLOCK_UNVERSIONED: i32 = -1;
+
+pub(crate) const UNVERSIONED_RANGE: (Bound<i32>, Bound<i32>) =
+    (Bound::Included(BLOCK_UNVERSIONED), Bound::Unbounded);
+
+/// The name of the column in which we store the block from which an
+/// immutable entity is visible
+pub(crate) const BLOCK_COLUMN: &str = "block$";
+
+/// The range of blocks for which an entity is valid. We need this struct
+/// to bind ranges into Diesel queries.
+#[derive(Clone, Debug)]
+pub struct BlockRange(Bound<BlockNumber>, Bound<BlockNumber>);
+
+// Doing this properly by implementing Clone for Bound is currently
+// a nightly-only feature, so we need to work around that
+fn clone_bound(bound: Bound<&BlockNumber>) -> Bound<BlockNumber> {
+    match bound {
+        Bound::Included(nr) => Bound::Included(*nr),
+        Bound::Excluded(nr) => Bound::Excluded(*nr),
+        Bound::Unbounded => Bound::Unbounded,
+    }
+}
+
+pub(crate) fn first_block_in_range(
+    bound: &(Bound<BlockNumber>, Bound<BlockNumber>),
+) -> Option<BlockNumber> {
+    if bound == &UNVERSIONED_RANGE {
+        return None;
+    }
+
+    match bound.0 {
+        Bound::Included(nr) => Some(nr),
+        Bound::Excluded(nr) => Some(nr + 1),
+        Bound::Unbounded => None,
+    }
+}
+
+/// Return the block number contained in the history event. If it is
+/// `None` panic because that indicates that we want to perform an
+/// operation that does not record history, which should not happen
+/// with how we currently use relational schemas
+pub(crate) fn block_number(block_ptr: &BlockPtr) -> BlockNumber {
+    block_ptr.number
+}
+
+impl From<RangeFrom<BlockNumber>> for BlockRange {
+    fn from(range: RangeFrom<BlockNumber>) -> BlockRange {
+        BlockRange(
+            clone_bound(range.start_bound()),
+            clone_bound(range.end_bound()),
+        )
+    }
+}
+
+impl ToSql<Range<Integer>, Pg> for BlockRange {
+    fn to_sql<W: Write>(&self, out: &mut Output<W, Pg>) -> diesel::serialize::Result {
+        let pair = (self.0, self.1);
+        ToSql::<Range<Integer>, Pg>::to_sql(&pair, out)
+    }
+}
+
+#[derive(Constructor)]
+pub struct BlockRangeLowerBoundClause<'a> {
+    _table_prefix: &'a str,
+    block: BlockNumber,
+}
+
+impl<'a> QueryFragment<Pg> for BlockRangeLowerBoundClause<'a> {
+    fn walk_ast(&self, mut out: AstPass<Pg>) -> QueryResult<()> {
+        out.unsafe_to_cache_prepared();
+
+        out.push_sql("lower(");
+        out.push_identifier(BLOCK_RANGE_COLUMN)?;
+        out.push_sql(") = ");
+        out.push_bind_param::<Integer, _>(&self.block)?;
+
+        Ok(())
+    }
+}
+
+#[derive(Constructor)]
+pub struct BlockRangeUpperBoundClause<'a> {
+    _table_prefix: &'a str,
+    block: BlockNumber,
+}
+
+impl<'a> QueryFragment<Pg> for BlockRangeUpperBoundClause<'a> {
+    fn walk_ast(&self, mut out: AstPass<Pg>) -> QueryResult<()> {
+        out.unsafe_to_cache_prepared();
+
+        out.push_sql("coalesce(upper(");
+        out.push_identifier(BLOCK_RANGE_COLUMN)?;
+        out.push_sql("), 2147483647) = ");
+        out.push_bind_param::<Integer, _>(&self.block)?;
+
+        Ok(())
+    }
+}
+
+/// Helper for generating various SQL fragments for handling the block range
+/// of entity versions
+#[derive(Debug, Clone, Copy)]
+pub enum BlockRangeColumn<'a> {
+    Mutable {
+        table: &'a Table,
+        table_prefix: &'a str,
+        block: BlockNumber,
+    },
+    Immutable {
+        table: &'a Table,
+        table_prefix: &'a str,
+        block: BlockNumber,
+    },
+}
+
+impl<'a> BlockRangeColumn<'a> {
+    pub fn new(table: &'a Table, table_prefix: &'a str, block: BlockNumber) -> Self {
+        if table.immutable {
+            Self::Immutable {
+                table,
+                table_prefix,
+                block,
+            }
+        } else {
+            Self::Mutable {
+                table,
+                table_prefix,
+                block,
+            }
+        }
+    }
+}
+
+impl<'a> BlockRangeColumn<'a> {
+    /// Output SQL that matches only rows whose block range contains `block`
+    pub fn contains(&self, out: &mut AstPass<Pg>) -> QueryResult<()> {
+        out.unsafe_to_cache_prepared();
+
+        match self {
+            BlockRangeColumn::Mutable { table, block, .. } => {
+                self.name(out);
+                out.push_sql(" @> ");
+                out.push_bind_param::<Integer, _>(block)?;
+                if table.is_account_like && *block < BLOCK_NUMBER_MAX {
+                    // When block is BLOCK_NUMBER_MAX, these checks would be wrong; we
+                    // don't worry about adding the equivalent in that case since
+                    // we generally only see BLOCK_NUMBER_MAX here for metadata
+                    // queries where block ranges don't matter anyway
+                    out.push_sql(" and coalesce(upper(");
+                    out.push_identifier(BLOCK_RANGE_COLUMN)?;
+                    out.push_sql("), 2147483647) > ");
+                    out.push_bind_param::<Integer, _>(block)?;
+                    out.push_sql(" and lower(");
+                    out.push_identifier(BLOCK_RANGE_COLUMN)?;
+                    out.push_sql(") <= ");
+                    out.push_bind_param::<Integer, _>(block)
+                } else {
+                    Ok(())
+                }
+            }
+            BlockRangeColumn::Immutable { block, .. } => {
+                if *block == BLOCK_NUMBER_MAX {
+                    // `self.block <= BLOCK_NUMBER_MAX` is always true
+                    out.push_sql("true");
+                    Ok(())
+                } else {
+                    self.name(out);
+                    out.push_sql(" <= ");
+                    out.push_bind_param::<Integer, _>(block)
+                }
+            }
+        }
+    }
+
+    pub fn column_name(&self) -> &str {
+        match self {
+            BlockRangeColumn::Mutable { .. } => BLOCK_RANGE_COLUMN,
+            BlockRangeColumn::Immutable { .. } => BLOCK_COLUMN,
+        }
+    }
+
+    /// Output the qualified name of the block range column
+    pub fn name(&self, out: &mut AstPass<Pg>) {
+        match self {
+            BlockRangeColumn::Mutable { table_prefix, .. } => {
+                out.push_sql(table_prefix);
+                out.push_sql(BLOCK_RANGE_COLUMN);
+            }
+            BlockRangeColumn::Immutable { table_prefix, .. } => {
+                out.push_sql(table_prefix);
+                out.push_sql(BLOCK_COLUMN);
+            }
+        }
+    }
+
+    /// Output the literal value of the block range `[block,..)`, mostly for
+    /// generating an insert statement containing the block range column
+    pub fn literal_range_current(&self, out: &mut AstPass<Pg>) -> QueryResult<()> {
+        match self {
+            BlockRangeColumn::Mutable { block, .. } => {
+                let block_range: BlockRange = (*block..).into();
+                out.push_bind_param::<Range<Integer>, _>(&block_range)
+            }
+            BlockRangeColumn::Immutable { block, .. } => out.push_bind_param::<Integer, _>(block),
+        }
+    }
+
+    /// Output an expression that matches rows that are the latest version
+    /// of their entity
+    pub fn latest(&self, out: &mut AstPass<Pg>) {
+        match self {
+            BlockRangeColumn::Mutable { .. } => out.push_sql(BLOCK_RANGE_CURRENT),
+            BlockRangeColumn::Immutable { .. } => out.push_sql("true"),
+        }
+    }
+
+    /// Output SQL that updates the block range column so that the row is
+    /// only valid up to `block` (exclusive)
+    ///
+    /// # Panics
+    ///
+    /// If the underlying table is immutable, this method will panic
+    pub fn clamp(&self, out: &mut AstPass<Pg>) -> QueryResult<()> {
+        match self {
+            BlockRangeColumn::Mutable { block, .. } => {
+                self.name(out);
+                out.push_sql(" = int4range(lower(");
+                out.push_identifier(BLOCK_RANGE_COLUMN)?;
+                out.push_sql("), ");
+                out.push_bind_param::<Integer, _>(block)?;
+                out.push_sql(")");
+                Ok(())
+            }
+            BlockRangeColumn::Immutable { .. } => {
+                unreachable!("immutable entities can not be updated or deleted")
+            }
+        }
+    }
+
+    /// Output the name of the block range column without the table prefix
+    pub(crate) fn bare_name(&self, out: &mut AstPass<Pg>) {
+        match self {
+            BlockRangeColumn::Mutable { .. } => out.push_sql(BLOCK_RANGE_COLUMN),
+            BlockRangeColumn::Immutable { .. } => out.push_sql(BLOCK_COLUMN),
+        }
+    }
+
+    /// Output an expression that matches all rows that have been changed
+    /// after `block` (inclusive)
+    pub(crate) fn changed_since(&self, out: &mut AstPass<Pg>) -> QueryResult<()> {
+        match self {
+            BlockRangeColumn::Mutable { block, .. } => {
+                out.push_sql("lower(");
+                out.push_identifier(BLOCK_RANGE_COLUMN)?;
+                out.push_sql(") >= ");
+                out.push_bind_param::<Integer, _>(block)
+            }
+            BlockRangeColumn::Immutable { block, .. } => {
+                out.push_identifier(BLOCK_COLUMN)?;
+                out.push_sql(" >= ");
+                out.push_bind_param::<Integer, _>(block)
+            }
+        }
+    }
+}
+
+#[test]
+fn block_number_max_is_i32_max() {
+    // The code in this file embeds i32::MAX aka BLOCK_NUMBER_MAX in strings
+    // for efficiency. This assertion makes sure that BLOCK_NUMBER_MAX still
+    // is what we think it is
+    assert_eq!(2147483647, BLOCK_NUMBER_MAX);
+}
diff --git a/store/postgres/src/block_store.rs b/store/postgres/src/block_store.rs
new file mode 100644
index 0000000..b31281a
--- /dev/null
+++ b/store/postgres/src/block_store.rs
@@ -0,0 +1,500 @@
+use std::{
+    collections::{HashMap, HashSet},
+    iter::FromIterator,
+    sync::{Arc, RwLock},
+    time::Duration,
+};
+
+use graph::{
+    blockchain::ChainIdentifier,
+    components::store::BlockStore as BlockStoreTrait,
+    prelude::{error, warn, BlockNumber, BlockPtr, Logger},
+};
+use graph::{
+    constraint_violation,
+    prelude::{anyhow, CheapClone},
+};
+use graph::{
+    prelude::{tokio, StoreError},
+    util::timed_cache::TimedCache,
+};
+
+use crate::{
+    chain_head_listener::ChainHeadUpdateSender, connection_pool::ConnectionPool,
+    primary::Mirror as PrimaryMirror, ChainStore, NotificationSender, Shard, PRIMARY_SHARD,
+};
+
+#[cfg(debug_assertions)]
+pub const FAKE_NETWORK_SHARED: &str = "fake_network_shared";
+
+/// The status of a chain: whether we can only read from the chain, or
+/// whether it is ok to ingest from it, too
+#[derive(Copy, Clone)]
+pub enum ChainStatus {
+    ReadOnly,
+    Ingestible,
+}
+
+pub mod primary {
+    use std::convert::TryFrom;
+
+    use diesel::{
+        delete, insert_into, ExpressionMethods, OptionalExtension, PgConnection, QueryDsl,
+        RunQueryDsl,
+    };
+    use graph::{
+        blockchain::{BlockHash, ChainIdentifier},
+        constraint_violation,
+        prelude::StoreError,
+    };
+
+    use crate::chain_store::Storage;
+    use crate::{connection_pool::ConnectionPool, Shard};
+
+    table! {
+            chains(id) {
+                id                 -> Integer,
+                name               -> Text,
+                net_version        -> Text,
+                genesis_block_hash -> Text,
+                shard              -> Text,
+                namespace          -> Text,
+        }
+    }
+
+    /// Information about the mapping of chains to storage shards. We persist
+    /// this information in the database to make it possible to detect a
+    /// change in the configuration file that doesn't match what is in the database
+    #[derive(Clone, Queryable)]
+    pub struct Chain {
+        pub id: i32,
+        pub name: String,
+        pub net_version: String,
+        pub genesis_block: String,
+        pub shard: Shard,
+        pub storage: Storage,
+    }
+
+    impl Chain {
+        pub fn network_identifier(&self) -> Result<ChainIdentifier, StoreError> {
+            Ok(ChainIdentifier {
+                net_version: self.net_version.clone(),
+                genesis_block_hash: BlockHash::try_from(self.genesis_block.as_str()).map_err(
+                    |e| {
+                        constraint_violation!(
+                            "the genesis block hash `{}` for chain `{}` is not a valid hash: {}",
+                            self.genesis_block,
+                            self.name,
+                            e
+                        )
+                    },
+                )?,
+            })
+        }
+    }
+
+    pub fn load_chains(conn: &PgConnection) -> Result<Vec<Chain>, StoreError> {
+        Ok(chains::table.load(conn)?)
+    }
+
+    pub fn find_chain(conn: &PgConnection, name: &str) -> Result<Option<Chain>, StoreError> {
+        Ok(chains::table
+            .filter(chains::name.eq(name))
+            .first(conn)
+            .optional()?)
+    }
+
+    pub fn add_chain(
+        pool: &ConnectionPool,
+        name: &str,
+        ident: &ChainIdentifier,
+        shard: &Shard,
+    ) -> Result<Chain, StoreError> {
+        let conn = pool.get()?;
+
+        // For tests, we want to have a chain that still uses the
+        // shared `ethereum_blocks` table
+        #[cfg(debug_assertions)]
+        if name == super::FAKE_NETWORK_SHARED {
+            insert_into(chains::table)
+                .values((
+                    chains::name.eq(name),
+                    chains::namespace.eq("public"),
+                    chains::net_version.eq(&ident.net_version),
+                    chains::genesis_block_hash.eq(ident.genesis_block_hash.hash_hex()),
+                    chains::shard.eq(shard.as_str()),
+                ))
+                .returning(chains::namespace)
+                .get_result::<Storage>(&conn)
+                .map_err(StoreError::from)?;
+            return Ok(chains::table.filter(chains::name.eq(name)).first(&conn)?);
+        }
+
+        insert_into(chains::table)
+            .values((
+                chains::name.eq(name),
+                chains::net_version.eq(&ident.net_version),
+                chains::genesis_block_hash.eq(ident.genesis_block_hash.hash_hex()),
+                chains::shard.eq(shard.as_str()),
+            ))
+            .returning(chains::namespace)
+            .get_result::<Storage>(&conn)
+            .map_err(StoreError::from)?;
+        Ok(chains::table.filter(chains::name.eq(name)).first(&conn)?)
+    }
+
+    pub(super) fn drop_chain(pool: &ConnectionPool, name: &str) -> Result<(), StoreError> {
+        let conn = pool.get()?;
+
+        delete(chains::table.filter(chains::name.eq(name))).execute(&conn)?;
+        Ok(())
+    }
+}
+
+/// The store that chains use to maintain their state and cache often used
+/// data from a chain. The `BlockStore` maintains information about all
+/// configured chains, and serves as a directory of chains, whereas the
+/// [ChainStore] manages chain-specific data. The `BlockStore` is sharded so
+/// that each chain can use, depending on configuration, a separate database.
+/// Regardless of configuration, the data for each chain is stored in its
+/// own database namespace, though for historical reasons, the code also deals
+/// with a shared table for the block and call cache for chains in the
+/// `public` namespace.
+///
+/// The `BlockStore` uses the table `public.chains` to keep immutable
+/// information about each chain, including a mapping from the chain name
+/// to the shard holding the chain specific data, and the database namespace
+/// for that chain.
+///
+/// Chains are identified by the name with which they are configured in the
+/// configuration file. Once a chain has been used with the system, it is
+/// not possible to change its configuration, in particular, the database
+/// shard and namespace, and the genesis block and net version must not
+/// change between runs of `graph-node`
+pub struct BlockStore {
+    logger: Logger,
+    /// Map chain names to the corresponding store. This map is updated
+    /// dynamically with new chains if an operation would require a chain
+    /// that is not yet in `stores`. It is initialized with all chains
+    /// known to the system at startup, either from configuration or from
+    /// previous state in the database.
+    stores: RwLock<HashMap<String, Arc<ChainStore>>>,
+    pools: HashMap<Shard, ConnectionPool>,
+    sender: Arc<NotificationSender>,
+    mirror: PrimaryMirror,
+    chain_head_cache: TimedCache<String, HashMap<String, BlockPtr>>,
+}
+
+impl BlockStore {
+    /// Create a new `BlockStore` by creating a `ChainStore` for each entry
+    /// in `networks`. The creation process checks that the configuration for
+    /// existing chains has not changed from the last time `graph-node` ran, and
+    /// creates new entries in its chain directory for chains we had not used
+    /// previously. It also creates a `ChainStore` for each chain that was used
+    /// in previous runs of the node, regardless of whether it is mentioned in
+    /// `chains` to ensure that queries against such chains will succeed.
+    ///
+    /// Each entry in `chains` gives the chain name, the network identifier,
+    /// and the name of the database shard for the chain. The `ChainStore` for
+    /// a chain uses the pool from `pools` for the given shard.
+    pub fn new(
+        logger: Logger,
+        // (network, ident, shard)
+        chains: Vec<(String, Vec<ChainIdentifier>, Shard)>,
+        // shard -> pool
+        pools: HashMap<Shard, ConnectionPool>,
+        sender: Arc<NotificationSender>,
+    ) -> Result<Self, StoreError> {
+        // Cache chain head pointers for this long when returning
+        // information from `chain_head_pointers`
+        const CHAIN_HEAD_CACHE_TTL: Duration = Duration::from_secs(2);
+
+        let mirror = PrimaryMirror::new(&pools);
+        let existing_chains = mirror.read(|conn| primary::load_chains(conn))?;
+        let chain_head_cache = TimedCache::new(CHAIN_HEAD_CACHE_TTL);
+
+        let block_store = Self {
+            logger,
+            stores: RwLock::new(HashMap::new()),
+            pools,
+            sender,
+            mirror,
+            chain_head_cache,
+        };
+
+        fn reduce_idents(
+            chain_name: &str,
+            idents: Vec<ChainIdentifier>,
+        ) -> Result<Option<ChainIdentifier>, StoreError> {
+            let mut idents: HashSet<ChainIdentifier> = HashSet::from_iter(idents.into_iter());
+            match idents.len() {
+                0 => Ok(None),
+                1 => Ok(idents.drain().next()),
+                _ => Err(anyhow!(
+                    "conflicting network identifiers for chain {}: {:?}",
+                    chain_name,
+                    idents
+                )
+                .into()),
+            }
+        }
+
+        /// Check that the configuration for `chain` hasn't changed so that
+        /// it is ok to ingest from it
+        fn chain_ingestible(
+            logger: &Logger,
+            chain: &primary::Chain,
+            shard: &Shard,
+            ident: &Option<ChainIdentifier>,
+        ) -> bool {
+            if &chain.shard != shard {
+                error!(
+                    logger,
+                    "the chain {} is stored in shard {} but is configured for shard {}",
+                    chain.name,
+                    chain.shard,
+                    shard
+                );
+                return false;
+            }
+            match ident {
+                Some(ident) => {
+                    if chain.net_version != ident.net_version {
+                        error!(logger,
+                        "the net version for chain {} has changed from {} to {} since the last time we ran",
+                        chain.name,
+                        chain.net_version,
+                        ident.net_version
+                    );
+                        return false;
+                    }
+                    if chain.genesis_block != ident.genesis_block_hash.hash_hex() {
+                        error!(logger,
+                        "the genesis block hash for chain {} has changed from {} to {} since the last time we ran",
+                        chain.name,
+                        chain.genesis_block,
+                        ident.genesis_block_hash
+                    );
+                        return false;
+                    }
+                    true
+                }
+                None => {
+                    warn!(logger, "Failed to get net version and genesis hash from provider. Assuming it has not changed");
+                    true
+                }
+            }
+        }
+
+        // For each configured chain, add a chain store
+        for (chain_name, idents, shard) in chains {
+            let ident = reduce_idents(&chain_name, idents)?;
+            match (
+                existing_chains
+                    .iter()
+                    .find(|chain| chain.name == chain_name),
+                ident,
+            ) {
+                (Some(chain), ident) => {
+                    let status = if chain_ingestible(&block_store.logger, chain, &shard, &ident) {
+                        ChainStatus::Ingestible
+                    } else {
+                        ChainStatus::ReadOnly
+                    };
+                    block_store.add_chain_store(chain, status, false)?;
+                }
+                (None, Some(ident)) => {
+                    let chain = primary::add_chain(
+                        block_store.mirror.primary(),
+                        &chain_name,
+                        &ident,
+                        &shard,
+                    )?;
+                    block_store.add_chain_store(&chain, ChainStatus::Ingestible, true)?;
+                }
+                (None, None) => {
+                    error!(
+                        &block_store.logger,
+                        " the chain {} is new but we could not get a network identifier for it",
+                        chain_name
+                    );
+                }
+            };
+        }
+
+        // There might be chains we have in the database that are not yet/
+        // no longer configured. Add a chain store for each of them, too
+        let configured_chains = block_store
+            .stores
+            .read()
+            .unwrap()
+            .keys()
+            .cloned()
+            .collect::<Vec<_>>();
+        for chain in existing_chains
+            .iter()
+            .filter(|chain| !configured_chains.contains(&chain.name))
+        {
+            block_store.add_chain_store(chain, ChainStatus::ReadOnly, false)?;
+        }
+        Ok(block_store)
+    }
+
+    pub(crate) async fn query_permit_primary(&self) -> tokio::sync::OwnedSemaphorePermit {
+        self.mirror
+            .primary()
+            .query_permit()
+            .await
+            .expect("the primary is never disabled")
+    }
+
+    fn add_chain_store(
+        &self,
+        chain: &primary::Chain,
+        status: ChainStatus,
+        create: bool,
+    ) -> Result<Arc<ChainStore>, StoreError> {
+        let pool = self
+            .pools
+            .get(&chain.shard)
+            .ok_or_else(|| constraint_violation!("there is no pool for shard {}", chain.shard))?
+            .clone();
+        let sender = ChainHeadUpdateSender::new(
+            self.mirror.primary().clone(),
+            chain.name.clone(),
+            self.sender.clone(),
+        );
+        let ident = chain.network_identifier()?;
+        let store = ChainStore::new(
+            chain.name.clone(),
+            chain.storage.clone(),
+            &ident,
+            status,
+            sender,
+            pool,
+        );
+        if create {
+            store.create(&ident)?;
+        }
+        let store = Arc::new(store);
+        self.stores
+            .write()
+            .unwrap()
+            .insert(chain.name.clone(), store.clone());
+        Ok(store)
+    }
+
+    /// Return a map from network name to the network's chain head pointer.
+    /// The information is cached briefly since this method is used heavily
+    /// by the indexing status API
+    pub fn chain_head_pointers(&self) -> Result<HashMap<String, BlockPtr>, StoreError> {
+        let mut map = HashMap::new();
+        for (shard, pool) in &self.pools {
+            let cached = match self.chain_head_cache.get(shard.as_str()) {
+                Some(cached) => cached,
+                None => {
+                    let conn = match pool.get() {
+                        Ok(conn) => conn,
+                        Err(StoreError::DatabaseUnavailable) => continue,
+                        Err(e) => return Err(e),
+                    };
+                    let heads = Arc::new(ChainStore::chain_head_pointers(&conn)?);
+                    self.chain_head_cache.set(shard.to_string(), heads.clone());
+                    heads
+                }
+            };
+            map.extend(
+                cached
+                    .iter()
+                    .map(|(chain, ptr)| (chain.clone(), ptr.clone())),
+            );
+        }
+        Ok(map)
+    }
+
+    pub fn chain_head_block(&self, chain: &str) -> Result<Option<BlockNumber>, StoreError> {
+        let store = self
+            .store(chain)
+            .ok_or_else(|| constraint_violation!("unknown network `{}`", chain))?;
+        store.chain_head_block(chain)
+    }
+
+    fn lookup_chain<'a>(&'a self, chain: &'a str) -> Result<Option<Arc<ChainStore>>, StoreError> {
+        // See if we have that chain in the database even if it wasn't one
+        // of the configured chains
+        self.mirror.read(|conn| {
+            primary::find_chain(conn, chain).and_then(|chain| {
+                chain
+                    .map(|chain| self.add_chain_store(&chain, ChainStatus::ReadOnly, false))
+                    .transpose()
+            })
+        })
+    }
+
+    fn store(&self, chain: &str) -> Option<Arc<ChainStore>> {
+        let store = self
+            .stores
+            .read()
+            .unwrap()
+            .get(chain)
+            .map(CheapClone::cheap_clone);
+        if store.is_some() {
+            return store;
+        }
+        // The chain is not in the cache yet, load it from the database; we
+        // suppress errors here since it will be very rare that we look up
+        // a chain from the database as most of them will be set up when
+        // the block store is created
+        self.lookup_chain(chain).unwrap_or_else(|e| {
+                error!(&self.logger, "Error getting chain from store"; "network" => chain, "error" => e.to_string());
+                None
+            })
+    }
+
+    pub fn drop_chain(&self, chain: &str) -> Result<(), StoreError> {
+        let chain_store = self
+            .store(chain)
+            .ok_or_else(|| constraint_violation!("unknown chain {}", chain))?;
+
+        // Delete from the primary first since that's where
+        // deployment_schemas has a fk constraint on chains
+        primary::drop_chain(self.mirror.primary(), chain)?;
+
+        chain_store.drop_chain()?;
+
+        self.stores.write().unwrap().remove(chain);
+
+        Ok(())
+    }
+
+    fn truncate_block_caches(&self) -> Result<(), StoreError> {
+        for store in self.stores.read().unwrap().values() {
+            store.truncate_block_cache()?
+        }
+        Ok(())
+    }
+
+    pub fn update_db_version(&self) -> Result<(), StoreError> {
+        use crate::primary::db_version as dbv;
+        use diesel::prelude::*;
+
+        let primary_pool = self.pools.get(&*PRIMARY_SHARD).unwrap();
+        let connection = primary_pool.get()?;
+        let version: i64 = dbv::table.select(dbv::version).get_result(&connection)?;
+        if version < 3 {
+            self.truncate_block_caches()?;
+            diesel::update(dbv::table)
+                .set(dbv::version.eq(3))
+                .execute(&connection)?;
+        };
+        Ok(())
+    }
+}
+
+impl BlockStoreTrait for BlockStore {
+    type ChainStore = ChainStore;
+
+    fn chain_store(&self, network: &str) -> Option<Arc<Self::ChainStore>> {
+        self.store(network)
+    }
+}
diff --git a/store/postgres/src/catalog.rs b/store/postgres/src/catalog.rs
new file mode 100644
index 0000000..4a0a8d0
--- /dev/null
+++ b/store/postgres/src/catalog.rs
@@ -0,0 +1,643 @@
+use diesel::sql_types::{Bool, Integer};
+use diesel::{connection::SimpleConnection, prelude::RunQueryDsl, select};
+use diesel::{insert_into, OptionalExtension};
+use diesel::{pg::PgConnection, sql_query};
+use diesel::{
+    sql_types::{Array, Double, Nullable, Text},
+    ExpressionMethods, QueryDsl,
+};
+use graph::components::store::VersionStats;
+use std::collections::{HashMap, HashSet};
+use std::fmt::Write;
+use std::iter::FromIterator;
+use std::sync::Arc;
+use std::time::Duration;
+
+use graph::prelude::anyhow::anyhow;
+use graph::{
+    data::subgraph::schema::POI_TABLE,
+    prelude::{lazy_static, StoreError},
+};
+
+use crate::connection_pool::ForeignServer;
+use crate::{
+    primary::{Namespace, Site},
+    relational::SqlName,
+};
+
+// This is a view not a table. We only read from it
+table! {
+    information_schema.foreign_tables(foreign_table_schema, foreign_table_name) {
+        foreign_table_catalog -> Text,
+        foreign_table_schema -> Text,
+        foreign_table_name -> Text,
+        foreign_server_catalog -> Text,
+        foreign_server_name -> Text,
+    }
+}
+
+// Readonly; we only access the name
+table! {
+    pg_namespace(nspname) {
+        nspname -> Text,
+    }
+}
+
+table! {
+    subgraphs.table_stats {
+        id -> Integer,
+        deployment -> Integer,
+        table_name -> Text,
+        is_account_like -> Nullable<Bool>,
+    }
+}
+
+// In debug builds (for testing etc.) create exclusion constraints, in
+// release builds for production, skip them
+#[cfg(debug_assertions)]
+const CREATE_EXCLUSION_CONSTRAINT: bool = true;
+#[cfg(not(debug_assertions))]
+const CREATE_EXCLUSION_CONSTRAINT: bool = false;
+
+/// Information about what tables and columns we have in the database
+#[derive(Debug, Clone)]
+pub struct Catalog {
+    pub site: Arc<Site>,
+    text_columns: HashMap<String, HashSet<String>>,
+    pub use_poi: bool,
+    /// Whether `bytea` columns are indexed with just a prefix (`true`) or
+    /// in their entirety. This influences both DDL generation and how
+    /// queries are generated
+    pub use_bytea_prefix: bool,
+}
+
+impl Catalog {
+    /// Load the catalog for an existing subgraph
+    pub fn load(
+        conn: &PgConnection,
+        site: Arc<Site>,
+        use_bytea_prefix: bool,
+    ) -> Result<Self, StoreError> {
+        let text_columns = get_text_columns(conn, &site.namespace)?;
+        let use_poi = supports_proof_of_indexing(conn, &site.namespace)?;
+        Ok(Catalog {
+            site,
+            text_columns,
+            use_poi,
+            use_bytea_prefix,
+        })
+    }
+
+    /// Return a new catalog suitable for creating a new subgraph
+    pub fn for_creation(site: Arc<Site>) -> Self {
+        Catalog {
+            site,
+            text_columns: HashMap::default(),
+            // DDL generation creates a POI table
+            use_poi: true,
+            // DDL generation creates indexes for prefixes of bytes columns
+            // see: attr-bytea-prefix
+            use_bytea_prefix: true,
+        }
+    }
+
+    /// Make a catalog as if the given `schema` did not exist in the database
+    /// yet. This function should only be used in situations where a database
+    /// connection is definitely not available, such as in unit tests
+    pub fn for_tests(site: Arc<Site>) -> Result<Self, StoreError> {
+        Ok(Catalog {
+            site,
+            text_columns: HashMap::default(),
+            use_poi: false,
+            use_bytea_prefix: true,
+        })
+    }
+
+    /// Return `true` if `table` exists and contains the given `column` and
+    /// if that column is of data type `text`
+    pub fn is_existing_text_column(&self, table: &SqlName, column: &SqlName) -> bool {
+        self.text_columns
+            .get(table.as_str())
+            .map(|cols| cols.contains(column.as_str()))
+            .unwrap_or(false)
+    }
+
+    /// Whether to create exclusion indexes; if false, create gist indexes
+    /// w/o an exclusion constraint
+    pub fn create_exclusion_constraint() -> bool {
+        CREATE_EXCLUSION_CONSTRAINT
+    }
+}
+
+fn get_text_columns(
+    conn: &PgConnection,
+    namespace: &Namespace,
+) -> Result<HashMap<String, HashSet<String>>, StoreError> {
+    const QUERY: &str = "
+        select table_name, column_name
+          from information_schema.columns
+         where table_schema = $1 and data_type = 'text'";
+
+    #[derive(Debug, QueryableByName)]
+    struct Column {
+        #[sql_type = "Text"]
+        pub table_name: String,
+        #[sql_type = "Text"]
+        pub column_name: String,
+    }
+
+    let map: HashMap<String, HashSet<String>> = diesel::sql_query(QUERY)
+        .bind::<Text, _>(namespace.as_str())
+        .load::<Column>(conn)?
+        .into_iter()
+        .fold(HashMap::new(), |mut map, col| {
+            map.entry(col.table_name)
+                .or_default()
+                .insert(col.column_name);
+            map
+        });
+    Ok(map)
+}
+
+pub fn table_exists(
+    conn: &PgConnection,
+    namespace: &Namespace,
+    table: &SqlName,
+) -> Result<bool, StoreError> {
+    #[derive(Debug, QueryableByName)]
+    struct Table {
+        #[sql_type = "Text"]
+        #[allow(dead_code)]
+        pub table_name: String,
+    }
+    let query =
+        "SELECT table_name FROM information_schema.tables WHERE table_schema=$1 AND table_name=$2";
+    let result: Vec<Table> = diesel::sql_query(query)
+        .bind::<Text, _>(namespace)
+        .bind::<Text, _>(table.as_str())
+        .load(conn)?;
+    Ok(result.len() > 0)
+}
+
+pub fn supports_proof_of_indexing(
+    conn: &diesel::pg::PgConnection,
+    namespace: &Namespace,
+) -> Result<bool, StoreError> {
+    lazy_static! {
+        static ref POI_TABLE_NAME: SqlName = SqlName::verbatim(POI_TABLE.to_owned());
+    }
+    table_exists(conn, namespace, &POI_TABLE_NAME)
+}
+
+/// Whether the given table has an exclusion constraint. When we create
+/// tables, they either have an exclusion constraint on `(id, block_range)`,
+/// or just a GIST index on those columns. If this returns `true`, there is
+/// an exclusion constraint on the table, if it returns `false` we only have
+/// an index.
+///
+/// This function only checks whether there is some exclusion constraint on
+/// the table since checking fully if that is exactly the constraint we
+/// think it is is a bit more complex. But if the table is part of a
+/// deployment that we created, the conclusions in hte previous paragraph
+/// are true.
+pub fn has_exclusion_constraint(
+    conn: &PgConnection,
+    namespace: &Namespace,
+    table: &SqlName,
+) -> Result<bool, StoreError> {
+    #[derive(Debug, QueryableByName)]
+    struct Row {
+        #[sql_type = "Bool"]
+        #[allow(dead_code)]
+        uses_excl: bool,
+    }
+
+    let query = "
+        select count(*) > 0 as uses_excl
+          from pg_catalog.pg_constraint con,
+               pg_catalog.pg_class rel,
+               pg_catalog.pg_namespace nsp
+         where rel.oid = con.conrelid
+           and nsp.oid = con.connamespace
+           and con.contype = 'x'
+           and nsp.nspname = $1
+           and rel.relname = $2;
+    ";
+
+    sql_query(query)
+        .bind::<Text, _>(namespace)
+        .bind::<Text, _>(table.as_str())
+        .get_result::<Row>(conn)
+        .map_err(StoreError::from)
+        .map(|row| row.uses_excl)
+}
+
+pub fn current_servers(conn: &PgConnection) -> Result<Vec<String>, StoreError> {
+    #[derive(QueryableByName)]
+    struct Srv {
+        #[sql_type = "Text"]
+        srvname: String,
+    }
+    Ok(sql_query("select srvname from pg_foreign_server")
+        .get_results::<Srv>(conn)?
+        .into_iter()
+        .map(|srv| srv.srvname)
+        .collect())
+}
+
+/// Return the options for the foreign server `name` as a map of option
+/// names to values
+pub fn server_options(
+    conn: &PgConnection,
+    name: &str,
+) -> Result<HashMap<String, Option<String>>, StoreError> {
+    #[derive(QueryableByName)]
+    struct Srv {
+        #[sql_type = "Array<Text>"]
+        srvoptions: Vec<String>,
+    }
+    let entries = sql_query("select srvoptions from pg_foreign_server where srvname = $1")
+        .bind::<Text, _>(name)
+        .get_result::<Srv>(conn)?
+        .srvoptions
+        .into_iter()
+        .filter_map(|opt| {
+            let mut parts = opt.splitn(2, '=');
+            let key = parts.next();
+            let value = parts.next().map(|value| value.to_string());
+
+            key.map(|key| (key.to_string(), value))
+        });
+    Ok(HashMap::from_iter(entries))
+}
+
+pub fn has_namespace(conn: &PgConnection, namespace: &Namespace) -> Result<bool, StoreError> {
+    use pg_namespace as nsp;
+
+    Ok(select(diesel::dsl::exists(
+        nsp::table.filter(nsp::nspname.eq(namespace.as_str())),
+    ))
+    .get_result::<bool>(conn)?)
+}
+
+/// Drop the schema for `src` if it is a foreign schema imported from
+/// another database. If the schema does not exist, or is not a foreign
+/// schema, do nothing. This crucially depends on the fact that we never mix
+/// foreign and local tables in the same schema.
+pub fn drop_foreign_schema(conn: &PgConnection, src: &Site) -> Result<(), StoreError> {
+    use foreign_tables as ft;
+
+    let is_foreign = select(diesel::dsl::exists(
+        ft::table.filter(ft::foreign_table_schema.eq(src.namespace.as_str())),
+    ))
+    .get_result::<bool>(conn)?;
+
+    if is_foreign {
+        let query = format!("drop schema if exists {} cascade", src.namespace);
+        conn.batch_execute(&query)?;
+    }
+    Ok(())
+}
+
+/// Drop the schema `nsp` and all its contents if it exists, and create it
+/// again so that `nsp` is an empty schema
+pub fn recreate_schema(conn: &PgConnection, nsp: &str) -> Result<(), StoreError> {
+    let query = format!(
+        "drop schema if exists {nsp} cascade;\
+         create schema {nsp};",
+        nsp = nsp
+    );
+    Ok(conn.batch_execute(&query)?)
+}
+
+pub fn account_like(conn: &PgConnection, site: &Site) -> Result<HashSet<String>, StoreError> {
+    use table_stats as ts;
+    let names = ts::table
+        .filter(ts::deployment.eq(site.id))
+        .select((ts::table_name, ts::is_account_like))
+        .get_results::<(String, Option<bool>)>(conn)
+        .optional()?
+        .unwrap_or(vec![])
+        .into_iter()
+        .filter_map(|(name, account_like)| {
+            if account_like == Some(true) {
+                Some(name)
+            } else {
+                None
+            }
+        })
+        .collect();
+    Ok(names)
+}
+
+pub fn set_account_like(
+    conn: &PgConnection,
+    site: &Site,
+    table_name: &SqlName,
+    is_account_like: bool,
+) -> Result<(), StoreError> {
+    use table_stats as ts;
+    insert_into(ts::table)
+        .values((
+            ts::deployment.eq(site.id),
+            ts::table_name.eq(table_name.as_str()),
+            ts::is_account_like.eq(is_account_like),
+        ))
+        .on_conflict((ts::deployment, ts::table_name))
+        .do_update()
+        .set(ts::is_account_like.eq(is_account_like))
+        .execute(conn)?;
+    Ok(())
+}
+
+pub fn copy_account_like(conn: &PgConnection, src: &Site, dst: &Site) -> Result<usize, StoreError> {
+    let src_nsp = if src.shard == dst.shard {
+        "subgraphs".to_string()
+    } else {
+        ForeignServer::metadata_schema(&src.shard)
+    };
+    let query = format!(
+        "insert into subgraphs.table_stats(deployment, table_name, is_account_like)
+         select $2 as deployment, ts.table_name, ts.is_account_like
+           from {src_nsp}.table_stats ts
+          where ts.deployment = $1",
+        src_nsp = src_nsp
+    );
+    Ok(sql_query(&query)
+        .bind::<Integer, _>(src.id)
+        .bind::<Integer, _>(dst.id)
+        .execute(conn)?)
+}
+
+pub(crate) mod table_schema {
+    use super::*;
+
+    /// The name and data type for the column in a table. The data type is
+    /// in a form that it can be used in a `create table` statement
+    pub struct Column {
+        pub column_name: String,
+        pub data_type: String,
+    }
+
+    #[derive(QueryableByName)]
+    struct ColumnInfo {
+        #[sql_type = "Text"]
+        column_name: String,
+        #[sql_type = "Text"]
+        data_type: String,
+        #[sql_type = "Text"]
+        udt_name: String,
+        #[sql_type = "Text"]
+        udt_schema: String,
+        #[sql_type = "Nullable<Text>"]
+        elem_type: Option<String>,
+    }
+
+    impl From<ColumnInfo> for Column {
+        fn from(ci: ColumnInfo) -> Self {
+            // See description of `data_type` in
+            // https://www.postgresql.org/docs/current/infoschema-columns.html
+            let data_type = match ci.data_type.as_str() {
+                "ARRAY" => format!(
+                    "{}[]",
+                    ci.elem_type.expect("array columns have an elem_type")
+                ),
+                "USER-DEFINED" => format!("{}.{}", ci.udt_schema, ci.udt_name),
+                _ => ci.data_type.clone(),
+            };
+            Self {
+                column_name: ci.column_name,
+                data_type,
+            }
+        }
+    }
+
+    pub fn columns(
+        conn: &PgConnection,
+        nsp: &str,
+        table_name: &str,
+    ) -> Result<Vec<Column>, StoreError> {
+        const QUERY: &str = " \
+    select c.column_name::text, c.data_type::text,
+           c.udt_name::text, c.udt_schema::text, e.data_type::text as elem_type
+      from information_schema.columns c
+      left join information_schema.element_types e
+           on ((c.table_catalog, c.table_schema, c.table_name, 'TABLE', c.dtd_identifier)
+            = (e.object_catalog, e.object_schema, e.object_name, e.object_type, e.collection_type_identifier))
+     where c.table_schema = $1
+       and c.table_name = $2
+     order by c.ordinal_position";
+
+        Ok(sql_query(QUERY)
+            .bind::<Text, _>(nsp)
+            .bind::<Text, _>(table_name)
+            .get_results::<ColumnInfo>(conn)?
+            .into_iter()
+            .map(|ci| ci.into())
+            .collect())
+    }
+}
+
+/// Return a SQL statement to create the foreign table
+/// `{dst_nsp}.{table_name}` for the server `server` which has the same
+/// schema as the (local) table `{src_nsp}.{table_name}`
+pub fn create_foreign_table(
+    conn: &PgConnection,
+    src_nsp: &str,
+    table_name: &str,
+    dst_nsp: &str,
+    server: &str,
+) -> Result<String, StoreError> {
+    fn build_query(
+        columns: Vec<table_schema::Column>,
+        src_nsp: &str,
+        table_name: &str,
+        dst_nsp: &str,
+        server: &str,
+    ) -> Result<String, std::fmt::Error> {
+        let mut query = String::new();
+        write!(
+            query,
+            "create foreign table \"{}\".\"{}\" (",
+            dst_nsp, table_name
+        )?;
+        for (idx, column) in columns.into_iter().enumerate() {
+            if idx > 0 {
+                write!(query, ", ")?;
+            }
+            write!(query, "\"{}\" {}", column.column_name, column.data_type)?;
+        }
+        writeln!(
+            query,
+            ") server \"{}\" options(schema_name '{}');",
+            server, src_nsp
+        )?;
+        Ok(query)
+    }
+
+    let columns = table_schema::columns(conn, src_nsp, table_name)?;
+    let query = build_query(columns, src_nsp, table_name, dst_nsp, server).map_err(|_| {
+        anyhow!(
+            "failed to generate 'create foreign table' query for {}.{}",
+            dst_nsp,
+            table_name
+        )
+    })?;
+    Ok(query)
+}
+
+/// Checks in the database if a given index is valid.
+pub(crate) fn check_index_is_valid(
+    conn: &PgConnection,
+    schema_name: &str,
+    index_name: &str,
+) -> Result<bool, StoreError> {
+    #[derive(Queryable, QueryableByName)]
+    struct ManualIndexCheck {
+        #[sql_type = "Bool"]
+        is_valid: bool,
+    }
+
+    let query = "
+        select
+            i.indisvalid as is_valid
+        from
+            pg_class c
+            join pg_index i on i.indexrelid = c.oid
+            join pg_namespace n on c.relnamespace = n.oid
+        where
+            n.nspname = $1
+            and c.relname = $2";
+    let result = sql_query(query)
+        .bind::<Text, _>(schema_name)
+        .bind::<Text, _>(index_name)
+        .get_result::<ManualIndexCheck>(conn)
+        .optional()
+        .map_err::<StoreError, _>(Into::into)?
+        .map(|check| check.is_valid);
+    Ok(matches!(result, Some(true)))
+}
+
+pub(crate) fn indexes_for_table(
+    conn: &PgConnection,
+    schema_name: &str,
+    table_name: &str,
+) -> Result<Vec<String>, StoreError> {
+    #[derive(Queryable, QueryableByName)]
+    struct IndexName {
+        #[sql_type = "Text"]
+        #[column_name = "indexdef"]
+        def: String,
+    }
+
+    let query = "
+        select
+            indexdef
+        from
+            pg_indexes
+        where
+            schemaname = $1
+            and tablename = $2
+        order by indexname";
+    let results = sql_query(query)
+        .bind::<Text, _>(schema_name)
+        .bind::<Text, _>(table_name)
+        .load::<IndexName>(conn)
+        .map_err::<StoreError, _>(Into::into)?;
+
+    Ok(results.into_iter().map(|i| i.def).collect())
+}
+pub(crate) fn drop_index(
+    conn: &PgConnection,
+    schema_name: &str,
+    index_name: &str,
+) -> Result<(), StoreError> {
+    let query = format!("drop index concurrently {schema_name}.{index_name}");
+    sql_query(&query)
+        .bind::<Text, _>(schema_name)
+        .bind::<Text, _>(index_name)
+        .execute(conn)
+        .map_err::<StoreError, _>(Into::into)?;
+    Ok(())
+}
+
+pub fn stats(conn: &PgConnection, namespace: &Namespace) -> Result<Vec<VersionStats>, StoreError> {
+    #[derive(Queryable, QueryableByName)]
+    pub struct DbStats {
+        #[sql_type = "Integer"]
+        pub entities: i32,
+        #[sql_type = "Integer"]
+        pub versions: i32,
+        #[sql_type = "Text"]
+        pub tablename: String,
+        /// The ratio `entities / versions`
+        #[sql_type = "Double"]
+        pub ratio: f64,
+    }
+
+    impl From<DbStats> for VersionStats {
+        fn from(s: DbStats) -> Self {
+            VersionStats {
+                entities: s.entities,
+                versions: s.versions,
+                tablename: s.tablename,
+                ratio: s.ratio,
+            }
+        }
+    }
+
+    // Get an estimate of number of rows (pg_class.reltuples) and number of
+    // distinct entities (based on the planners idea of how many distinct
+    // values there are in the `id` column) See the [Postgres
+    // docs](https://www.postgresql.org/docs/current/view-pg-stats.html) for
+    // the precise meaning of n_distinct
+    let query = format!(
+        "select case when s.n_distinct < 0 then (- s.n_distinct * c.reltuples)::int4
+                     else s.n_distinct::int4
+                 end as entities,
+                 c.reltuples::int4  as versions,
+                 c.relname as tablename,
+                case when c.reltuples = 0 then 0::float8
+                     when s.n_distinct < 0 then (-s.n_distinct)::float8
+                     else greatest(s.n_distinct, 1)::float8 / c.reltuples::float8
+                 end as ratio
+           from pg_namespace n, pg_class c, pg_stats s
+          where n.nspname = $1
+            and c.relnamespace = n.oid
+            and s.schemaname = n.nspname
+            and s.attname = 'id'
+            and c.relname = s.tablename
+          order by c.relname"
+    );
+
+    let stats = sql_query(query)
+        .bind::<Text, _>(namespace.as_str())
+        .load::<DbStats>(conn)
+        .map_err(StoreError::from)?;
+
+    Ok(stats.into_iter().map(|s| s.into()).collect())
+}
+
+/// Return by how much the slowest replica connected to the database `conn`
+/// is lagging. The returned value has millisecond precision. If the
+/// database has no replicas, return `0`
+pub(crate) fn replication_lag(conn: &PgConnection) -> Result<Duration, StoreError> {
+    #[derive(Queryable, QueryableByName)]
+    struct Lag {
+        #[sql_type = "Nullable<Integer>"]
+        ms: Option<i32>,
+    }
+
+    let lag = sql_query(
+        "select (extract(epoch from max(greatest(write_lag, flush_lag, replay_lag)))*1000)::int as ms \
+           from pg_stat_replication",
+    )
+    .get_result::<Lag>(conn)?;
+
+    let lag = lag
+        .ms
+        .map(|ms| if ms <= 0 { 0 } else { ms as u64 })
+        .unwrap_or(0);
+
+    Ok(Duration::from_millis(lag))
+}
diff --git a/store/postgres/src/chain_head_listener.rs b/store/postgres/src/chain_head_listener.rs
new file mode 100644
index 0000000..2087c2b
--- /dev/null
+++ b/store/postgres/src/chain_head_listener.rs
@@ -0,0 +1,279 @@
+use graph::{
+    blockchain::ChainHeadUpdateStream,
+    prelude::{
+        futures03::{self, FutureExt},
+        tokio, StoreError,
+    },
+    prometheus::{CounterVec, GaugeVec},
+    util::timed_rw_lock::TimedRwLock,
+};
+use std::collections::BTreeMap;
+use std::sync::atomic;
+use std::sync::{atomic::AtomicBool, Arc};
+
+use lazy_static::lazy_static;
+
+use crate::{
+    connection_pool::ConnectionPool,
+    notification_listener::{JsonNotification, NotificationListener, SafeChannelName},
+    NotificationSender,
+};
+use graph::blockchain::ChainHeadUpdateListener as ChainHeadUpdateListenerTrait;
+use graph::prelude::serde::{Deserialize, Serialize};
+use graph::prelude::serde_json::{self, json};
+use graph::prelude::tokio::sync::{mpsc::Receiver, watch};
+use graph::prelude::{crit, debug, o, CheapClone, Logger, MetricsRegistry, ENV_VARS};
+
+lazy_static! {
+    pub static ref CHANNEL_NAME: SafeChannelName =
+        SafeChannelName::i_promise_this_is_safe("chain_head_updates");
+}
+
+struct Watcher {
+    sender: Arc<watch::Sender<()>>,
+    receiver: watch::Receiver<()>,
+}
+
+impl Watcher {
+    fn new() -> Self {
+        let (sender, receiver) = watch::channel(());
+        Watcher {
+            sender: Arc::new(sender),
+            receiver,
+        }
+    }
+
+    #[allow(dead_code)]
+    fn send(&self) {
+        // Unwrap: `self` holds a receiver.
+        self.sender.send(()).unwrap()
+    }
+}
+
+pub struct BlockIngestorMetrics {
+    chain_head_number: Box<GaugeVec>,
+}
+
+impl BlockIngestorMetrics {
+    pub fn new(registry: Arc<dyn MetricsRegistry>) -> Self {
+        Self {
+            chain_head_number: registry
+                .new_gauge_vec(
+                    "ethereum_chain_head_number",
+                    "Block number of the most recent block synced from Ethereum",
+                    vec![String::from("network")],
+                )
+                .unwrap(),
+        }
+    }
+
+    pub fn set_chain_head_number(&self, network_name: &str, chain_head_number: i64) {
+        self.chain_head_number
+            .with_label_values(vec![network_name].as_slice())
+            .set(chain_head_number as f64);
+    }
+}
+
+#[derive(Clone, Debug, Serialize, Deserialize)]
+struct ChainHeadUpdate {
+    pub network_name: String,
+    pub head_block_hash: String,
+    pub head_block_number: u64,
+}
+
+pub struct ChainHeadUpdateListener {
+    /// Update watchers keyed by network.
+    watchers: Arc<TimedRwLock<BTreeMap<String, Watcher>>>,
+    _listener: NotificationListener,
+}
+
+/// Sender for messages that the `ChainHeadUpdateListener` on other nodes
+/// will receive. The sender is specific to a particular chain.
+pub(crate) struct ChainHeadUpdateSender {
+    pool: ConnectionPool,
+    chain_name: String,
+    sender: Arc<NotificationSender>,
+}
+
+impl ChainHeadUpdateListener {
+    pub fn new(logger: &Logger, registry: Arc<dyn MetricsRegistry>, postgres_url: String) -> Self {
+        let logger = logger.new(o!("component" => "ChainHeadUpdateListener"));
+        let ingestor_metrics = Arc::new(BlockIngestorMetrics::new(registry.clone()));
+        let counter = registry
+            .global_counter_vec(
+                "notification_queue_recvd",
+                "Number of messages received through Postgres LISTEN",
+                vec!["channel", "network"].as_slice(),
+            )
+            .unwrap();
+        // Create a Postgres notification listener for chain head updates
+        let (mut listener, receiver) =
+            NotificationListener::new(&logger, postgres_url, CHANNEL_NAME.clone());
+        let watchers = Arc::new(TimedRwLock::new(
+            BTreeMap::new(),
+            "chain_head_listener_watchers",
+        ));
+
+        Self::listen(
+            logger,
+            ingestor_metrics,
+            &mut listener,
+            receiver,
+            watchers.cheap_clone(),
+            counter,
+        );
+
+        ChainHeadUpdateListener {
+            watchers,
+
+            // We keep the listener around to tie its stream's lifetime to
+            // that of the chain head update listener and prevent it from
+            // terminating early
+            _listener: listener,
+        }
+    }
+
+    fn listen(
+        logger: Logger,
+        metrics: Arc<BlockIngestorMetrics>,
+        listener: &mut NotificationListener,
+        mut receiver: Receiver<JsonNotification>,
+        watchers: Arc<TimedRwLock<BTreeMap<String, Watcher>>>,
+        counter: CounterVec,
+    ) {
+        // Process chain head updates in a dedicated task
+        graph::spawn(async move {
+            let sending_to_watcher = Arc::new(AtomicBool::new(false));
+            while let Some(notification) = receiver.recv().await {
+                // Create ChainHeadUpdate from JSON
+                let update: ChainHeadUpdate =
+                    match serde_json::from_value::<ChainHeadUpdate>(notification.payload.clone()) {
+                        Ok(update) => {
+                            let labels = [CHANNEL_NAME.as_str(), &update.network_name];
+                            counter.with_label_values(&labels).inc();
+                            update
+                        }
+                        Err(e) => {
+                            crit!(
+                                logger,
+                                "invalid chain head update received from database";
+                                "payload" => format!("{:?}", notification.payload),
+                                "error" => e.to_string()
+                            );
+                            continue;
+                        }
+                    };
+
+                // Observe the latest chain head for each network to monitor block ingestion
+                metrics
+                    .set_chain_head_number(&update.network_name, *&update.head_block_number as i64);
+
+                // If there are subscriptions for this network, notify them.
+                if let Some(watcher) = watchers.read(&logger).get(&update.network_name) {
+                    // Due to a tokio bug, we must assume that the watcher can deadlock, see
+                    // https://github.com/tokio-rs/tokio/issues/4246.
+                    if !sending_to_watcher.load(atomic::Ordering::SeqCst) {
+                        let sending_to_watcher = sending_to_watcher.cheap_clone();
+                        let sender = watcher.sender.cheap_clone();
+                        tokio::task::spawn_blocking(move || {
+                            sending_to_watcher.store(true, atomic::Ordering::SeqCst);
+                            sender.send(()).unwrap();
+                            sending_to_watcher.store(false, atomic::Ordering::SeqCst);
+                        });
+                    } else {
+                        debug!(logger, "skipping chain head update, watcher is deadlocked"; "network" => &update.network_name);
+                    }
+                }
+            }
+        });
+
+        // We're ready, start listening to chain head updates
+        listener.start();
+    }
+}
+
+impl ChainHeadUpdateListenerTrait for ChainHeadUpdateListener {
+    fn subscribe(&self, network_name: String, logger: Logger) -> ChainHeadUpdateStream {
+        debug!(logger, "subscribing to chain head updates");
+
+        let update_receiver = {
+            let existing = {
+                let watchers = self.watchers.read(&logger);
+                watchers.get(&network_name).map(|w| w.receiver.clone())
+            };
+
+            if let Some(watcher) = existing {
+                // Common case, this is not the first subscription for this network.
+                watcher
+            } else {
+                // This is the first subscription for this network, a lock is required.
+                //
+                // Race condition: Another task could have simoultaneously entered this branch and
+                // inserted a writer, so we should check the entry again after acquiring the lock.
+                self.watchers
+                    .write(&logger)
+                    .entry(network_name)
+                    .or_insert_with(Watcher::new)
+                    .receiver
+                    .clone()
+            }
+        };
+
+        Box::new(futures03::stream::unfold(
+            update_receiver,
+            move |mut update_receiver| {
+                let logger = logger.clone();
+                async move {
+                    // To be robust against any problems with the listener for the DB channel, a
+                    // timeout is set so that subscribers are guaranteed to get periodic updates.
+                    match tokio::time::timeout(
+                        ENV_VARS.store.chain_head_watcher_timeout,
+                        update_receiver.changed(),
+                    )
+                    .await
+                    {
+                        // Received an update.
+                        Ok(Ok(())) => (),
+
+                        // The sender was dropped, this should never happen.
+                        Ok(Err(_)) => crit!(logger, "chain head watcher terminated"),
+
+                        Err(_) => debug!(
+                            logger,
+                            "no chain head update for {} seconds, polling for update",
+                            ENV_VARS.store.chain_head_watcher_timeout.as_secs()
+                        ),
+                    };
+                    Some(((), update_receiver))
+                }
+                .boxed()
+            },
+        ))
+    }
+}
+
+impl ChainHeadUpdateSender {
+    pub fn new(
+        pool: ConnectionPool,
+        network_name: String,
+        sender: Arc<NotificationSender>,
+    ) -> Self {
+        Self {
+            pool,
+            chain_name: network_name,
+            sender,
+        }
+    }
+
+    pub fn send(&self, hash: &str, number: i64) -> Result<(), StoreError> {
+        let msg = json! ({
+            "network_name": &self.chain_name,
+            "head_block_hash": hash,
+            "head_block_number": number
+        });
+
+        let conn = self.pool.get()?;
+        self.sender
+            .notify(&conn, CHANNEL_NAME.as_str(), Some(&self.chain_name), &msg)
+    }
+}
diff --git a/store/postgres/src/chain_store.rs b/store/postgres/src/chain_store.rs
new file mode 100644
index 0000000..74a9101
--- /dev/null
+++ b/store/postgres/src/chain_store.rs
@@ -0,0 +1,1823 @@
+use diesel::pg::PgConnection;
+use diesel::prelude::*;
+use diesel::r2d2::{ConnectionManager, PooledConnection};
+use diesel::sql_types::Text;
+use diesel::{insert_into, update};
+
+use std::{
+    collections::HashMap,
+    convert::{TryFrom, TryInto},
+    iter::FromIterator,
+    sync::Arc,
+    time::Duration,
+};
+
+use graph::blockchain::{Block, BlockHash, ChainIdentifier};
+use graph::cheap_clone::CheapClone;
+use graph::prelude::web3::types::H256;
+use graph::prelude::{
+    async_trait, ethabi, serde_json as json, transaction_receipt::LightTransactionReceipt,
+    BlockNumber, BlockPtr, CachedEthereumCall, CancelableError, ChainStore as ChainStoreTrait,
+    Error, EthereumCallCache, StoreError,
+};
+use graph::util::timed_cache::TimedCache;
+use graph::{constraint_violation, ensure};
+
+use crate::{
+    block_store::ChainStatus, chain_head_listener::ChainHeadUpdateSender,
+    connection_pool::ConnectionPool,
+};
+
+/// Tables in the 'public' database schema that store chain-specific data
+mod public {
+    table! {
+        ethereum_networks (name) {
+            name -> Varchar,
+            namespace -> Varchar,
+            head_block_hash -> Nullable<Varchar>,
+            head_block_number -> Nullable<BigInt>,
+            net_version -> Varchar,
+            genesis_block_hash -> Varchar,
+            head_block_cursor -> Nullable<Varchar>,
+        }
+    }
+}
+
+pub use data::Storage;
+
+/// Encapuslate access to the blocks table for a chain.
+mod data {
+    use diesel::sql_types::{Array, Binary};
+    use diesel::{connection::SimpleConnection, insert_into};
+    use diesel::{delete, prelude::*, sql_query};
+    use diesel::{dsl::sql, pg::PgConnection};
+    use diesel::{
+        pg::Pg,
+        serialize::Output,
+        sql_types::Text,
+        types::{FromSql, ToSql},
+    };
+    use diesel::{
+        sql_types::{BigInt, Bytea, Integer, Jsonb},
+        update,
+    };
+    use graph::blockchain::{Block, BlockHash};
+    use graph::constraint_violation;
+    use graph::prelude::ethabi::ethereum_types::H160;
+    use graph::prelude::transaction_receipt::LightTransactionReceipt;
+    use graph::prelude::web3::types::H256;
+    use graph::prelude::{
+        serde_json as json, BlockNumber, BlockPtr, CachedEthereumCall, Error, StoreError,
+    };
+    use std::fmt;
+    use std::iter::FromIterator;
+    use std::{convert::TryFrom, io::Write};
+
+    use crate::transaction_receipt::RawTransactionReceipt;
+
+    pub(crate) const ETHEREUM_BLOCKS_TABLE_NAME: &'static str = "public.ethereum_blocks";
+
+    mod public {
+        pub(super) use super::super::public::ethereum_networks;
+
+        table! {
+            ethereum_blocks (hash) {
+                hash -> Varchar,
+                number -> BigInt,
+                parent_hash -> Nullable<Varchar>,
+                network_name -> Varchar, // REFERENCES ethereum_networks (name),
+                data -> Jsonb,
+            }
+        }
+
+        allow_tables_to_appear_in_same_query!(ethereum_networks, ethereum_blocks);
+
+        table! {
+            /// `id` is the hash of contract address + encoded function call + block number.
+            eth_call_cache (id) {
+                id -> Bytea,
+                return_value -> Bytea,
+                contract_address -> Bytea,
+                block_number -> Integer,
+            }
+        }
+
+        table! {
+            /// When was a cached call on a contract last used? This is useful to clean old data.
+            eth_call_meta (contract_address) {
+                contract_address -> Bytea,
+                accessed_at -> Date,
+            }
+        }
+
+        joinable!(eth_call_cache -> eth_call_meta (contract_address));
+        allow_tables_to_appear_in_same_query!(eth_call_cache, eth_call_meta);
+    }
+
+    // Helper for literal SQL queries that look up a block hash
+    #[derive(QueryableByName)]
+    struct BlockHashText {
+        #[sql_type = "Text"]
+        hash: String,
+    }
+
+    #[derive(QueryableByName)]
+    struct BlockHashBytea {
+        #[sql_type = "Bytea"]
+        hash: Vec<u8>,
+    }
+
+    // Like H256::from_slice, but returns an error instead of panicking
+    // when `bytes` does not have the right length
+    fn h256_from_bytes(bytes: &[u8]) -> Result<H256, StoreError> {
+        if bytes.len() == H256::len_bytes() {
+            Ok(H256::from_slice(bytes))
+        } else {
+            Err(constraint_violation!(
+                "invalid H256 value `{}` has {} bytes instead of {}",
+                graph::prelude::hex::encode(bytes),
+                bytes.len(),
+                H256::len_bytes()
+            ))
+        }
+    }
+
+    type DynTable = diesel_dynamic_schema::Table<String>;
+    type DynColumn<ST> = diesel_dynamic_schema::Column<DynTable, &'static str, ST>;
+
+    /// The table that holds blocks when we store a chain in its own
+    /// dedicated database schema
+    #[derive(Clone, Debug)]
+    struct BlocksTable {
+        /// The fully qualified name of the blocks table, including the
+        /// schema
+        qname: String,
+        table: DynTable,
+    }
+
+    impl BlocksTable {
+        const TABLE_NAME: &'static str = "blocks";
+
+        fn new(namespace: &str) -> Self {
+            BlocksTable {
+                qname: format!("{}.{}", namespace, Self::TABLE_NAME),
+                table: diesel_dynamic_schema::schema(namespace.to_string())
+                    .table(Self::TABLE_NAME.to_string()),
+            }
+        }
+
+        fn table(&self) -> DynTable {
+            self.table.clone()
+        }
+
+        fn hash(&self) -> DynColumn<Bytea> {
+            self.table.column::<Bytea, _>("hash")
+        }
+
+        fn number(&self) -> DynColumn<BigInt> {
+            self.table.column::<BigInt, _>("number")
+        }
+
+        fn data(&self) -> DynColumn<Jsonb> {
+            self.table.column::<Jsonb, _>("data")
+        }
+    }
+
+    #[derive(Clone, Debug)]
+    struct CallMetaTable {
+        qname: String,
+        table: DynTable,
+    }
+
+    impl CallMetaTable {
+        const TABLE_NAME: &'static str = "call_meta";
+        const ACCESSED_AT: &'static str = "accessed_at";
+
+        fn new(namespace: &str) -> Self {
+            CallMetaTable {
+                qname: format!("{}.{}", namespace, Self::TABLE_NAME),
+                table: diesel_dynamic_schema::schema(namespace.to_string())
+                    .table(Self::TABLE_NAME.to_string()),
+            }
+        }
+
+        fn table(&self) -> DynTable {
+            self.table.clone()
+        }
+
+        fn contract_address(&self) -> DynColumn<Bytea> {
+            self.table.column::<Bytea, _>("contract_address")
+        }
+    }
+
+    #[derive(Clone, Debug)]
+    struct CallCacheTable {
+        qname: String,
+        table: DynTable,
+    }
+
+    impl CallCacheTable {
+        const TABLE_NAME: &'static str = "call_cache";
+
+        fn new(namespace: &str) -> Self {
+            CallCacheTable {
+                qname: format!("{}.{}", namespace, Self::TABLE_NAME),
+                table: diesel_dynamic_schema::schema(namespace.to_string())
+                    .table(Self::TABLE_NAME.to_string()),
+            }
+        }
+
+        fn table(&self) -> DynTable {
+            self.table.clone()
+        }
+
+        fn id(&self) -> DynColumn<Bytea> {
+            self.table.column::<Bytea, _>("id")
+        }
+
+        fn block_number(&self) -> DynColumn<BigInt> {
+            self.table.column::<BigInt, _>("block_number")
+        }
+
+        fn return_value(&self) -> DynColumn<Bytea> {
+            self.table.column::<Bytea, _>("return_value")
+        }
+
+        fn contract_address(&self) -> DynColumn<Bytea> {
+            self.table.column::<Bytea, _>("contract_address")
+        }
+    }
+
+    #[derive(Clone, Debug)]
+    pub struct Schema {
+        name: String,
+        blocks: BlocksTable,
+        call_meta: CallMetaTable,
+        call_cache: CallCacheTable,
+    }
+
+    impl Schema {
+        fn new(name: String) -> Self {
+            let blocks = BlocksTable::new(&name);
+            let call_meta = CallMetaTable::new(&name);
+            let call_cache = CallCacheTable::new(&name);
+            Self {
+                name,
+                blocks,
+                call_meta,
+                call_cache,
+            }
+        }
+    }
+
+    #[derive(Clone, Debug, AsExpression, FromSqlRow)]
+    #[sql_type = "diesel::sql_types::Text"]
+    /// Storage for a chain. The underlying namespace (database schema) is either
+    /// `public` or of the form `chain[0-9]+`.
+    pub enum Storage {
+        /// Chain data is stored in shared tables
+        Shared,
+        /// The chain has its own namespace in the database with dedicated
+        /// tables
+        Private(Schema),
+    }
+
+    impl fmt::Display for Storage {
+        fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
+            match self {
+                Self::Shared => Self::PUBLIC.fmt(f),
+                Self::Private(Schema { name, .. }) => name.fmt(f),
+            }
+        }
+    }
+
+    impl FromSql<Text, Pg> for Storage {
+        fn from_sql(bytes: Option<&[u8]>) -> diesel::deserialize::Result<Self> {
+            let s = <String as FromSql<Text, Pg>>::from_sql(bytes)?;
+            Self::new(s).map_err(Into::into)
+        }
+    }
+
+    impl ToSql<Text, Pg> for Storage {
+        fn to_sql<W: Write>(&self, out: &mut Output<W, Pg>) -> diesel::serialize::Result {
+            <String as ToSql<Text, Pg>>::to_sql(&self.to_string(), out)
+        }
+    }
+
+    impl Storage {
+        const PREFIX: &'static str = "chain";
+        const PUBLIC: &'static str = "public";
+
+        fn new(s: String) -> Result<Self, String> {
+            if s.as_str() == Self::PUBLIC {
+                return Ok(Self::Shared);
+            }
+
+            if !s.starts_with(Self::PREFIX) || s.len() <= Self::PREFIX.len() {
+                return Err(s);
+            }
+            for c in s.chars().skip(Self::PREFIX.len()) {
+                if !c.is_numeric() {
+                    return Err(s);
+                }
+            }
+
+            Ok(Self::Private(Schema::new(s)))
+        }
+
+        /// Create dedicated database tables for this chain if it uses
+        /// `Storage::Private`. If it uses `Storage::Shared`, do nothing since
+        /// a regular migration will already have created the `ethereum_blocks`
+        /// table
+        pub(super) fn create(&self, conn: &PgConnection) -> Result<(), Error> {
+            fn make_ddl(nsp: &str) -> String {
+                format!(
+                    "
+                create schema {nsp};
+                create table {nsp}.blocks (
+                  hash         bytea  not null primary key,
+                  number       int8  not null,
+                  parent_hash  bytea  not null,
+                  data         jsonb not null
+                );
+                create index blocks_number ON {nsp}.blocks using btree(number);
+
+                create table {nsp}.call_cache (
+	              id               bytea not null primary key,
+	              return_value     bytea not null,
+	              contract_address bytea not null,
+	              block_number     int4 not null
+                );
+                create index call_cache_block_number_idx ON {nsp}.call_cache(block_number);
+
+                create table {nsp}.call_meta (
+                    contract_address bytea not null primary key,
+                    accessed_at      date  not null
+                );
+            ",
+                    nsp = nsp
+                )
+            }
+
+            match self {
+                Storage::Shared => Ok(()),
+                Storage::Private(Schema { name, .. }) => {
+                    conn.batch_execute(&make_ddl(name))?;
+                    Ok(())
+                }
+            }
+        }
+
+        /// Returns a fully qualified table name to the blocks table
+        #[inline]
+        fn blocks_table(&self) -> &str {
+            match self {
+                Storage::Shared => ETHEREUM_BLOCKS_TABLE_NAME,
+                Storage::Private(Schema { blocks, .. }) => &blocks.qname,
+            }
+        }
+
+        pub(super) fn drop_storage(
+            &self,
+            conn: &PgConnection,
+            name: &str,
+        ) -> Result<(), StoreError> {
+            match &self {
+                Storage::Shared => {
+                    use public::ethereum_blocks as b;
+                    delete(b::table.filter(b::network_name.eq(name))).execute(conn)?;
+                    Ok(())
+                }
+                Storage::Private(Schema { name, .. }) => {
+                    conn.batch_execute(&format!("drop schema {} cascade", name))?;
+                    Ok(())
+                }
+            }
+        }
+
+        pub(super) fn truncate_block_cache(&self, conn: &PgConnection) -> Result<(), StoreError> {
+            let table_name = match &self {
+                Storage::Shared => ETHEREUM_BLOCKS_TABLE_NAME,
+                Storage::Private(Schema { blocks, .. }) => &blocks.qname,
+            };
+            conn.batch_execute(&format!("truncate table {} restart identity", table_name))?;
+            Ok(())
+        }
+
+        /// Insert a block. If the table already contains a block with the
+        /// same hash, then overwrite that block since it may be adding
+        /// transaction receipts. If `overwrite` is `true`, overwrite a
+        /// possibly existing entry. If it is `false`, keep the old entry.
+        pub(super) fn upsert_block(
+            &self,
+            conn: &PgConnection,
+            chain: &str,
+            block: &dyn Block,
+            overwrite: bool,
+        ) -> Result<(), StoreError> {
+            // Hash indicating 'no parent'. It seems to be customary at
+            // least on EVM-compatible chains to fill the parent hash of the
+            // genesis block with this value
+            const NO_PARENT: &str =
+                "0000000000000000000000000000000000000000000000000000000000000000";
+
+            let number = block.number() as i64;
+            let data = block.data().expect("Failed to serialize block");
+            let hash = block.hash();
+            let parent_hash = block.parent_hash().unwrap_or_else(|| {
+                BlockHash::try_from(NO_PARENT).expect("NO_PARENT is a valid hash")
+            });
+
+            match self {
+                Storage::Shared => {
+                    use public::ethereum_blocks as b;
+
+                    let values = (
+                        b::hash.eq(hash.hash_hex()),
+                        b::number.eq(number),
+                        b::parent_hash.eq(parent_hash.hash_hex()),
+                        b::network_name.eq(chain),
+                        b::data.eq(data),
+                    );
+
+                    if overwrite {
+                        insert_into(b::table)
+                            .values(values.clone())
+                            .on_conflict(b::hash)
+                            .do_update()
+                            .set(values)
+                            .execute(conn)?;
+                    } else {
+                        insert_into(b::table)
+                            .values(values.clone())
+                            .on_conflict(b::hash)
+                            .do_nothing()
+                            .execute(conn)?;
+                    }
+                }
+                Storage::Private(Schema { blocks, .. }) => {
+                    let query = if overwrite {
+                        format!(
+                            "insert into {}(hash, number, parent_hash, data) \
+                             values ($1, $2, $3, $4) \
+                                 on conflict(hash) \
+                                 do update set number = $2, parent_hash = $3, data = $4",
+                            blocks.qname,
+                        )
+                    } else {
+                        format!(
+                            "insert into {}(hash, number, parent_hash, data) \
+                             values ($1, $2, $3, $4) \
+                                 on conflict(hash) do nothing",
+                            blocks.qname
+                        )
+                    };
+                    sql_query(query)
+                        .bind::<Bytea, _>(hash.as_slice())
+                        .bind::<BigInt, _>(number)
+                        .bind::<Bytea, _>(parent_hash.as_slice())
+                        .bind::<Jsonb, _>(data)
+                        .execute(conn)?;
+                }
+            };
+            Ok(())
+        }
+
+        pub(super) fn blocks(
+            &self,
+            conn: &PgConnection,
+            chain: &str,
+            hashes: &[BlockHash],
+        ) -> Result<Vec<json::Value>, Error> {
+            use diesel::dsl::any;
+
+            // We need to deal with chain stores where some entries have a
+            // toplevel 'block' field and others directly contain what would
+            // be in the 'block' field. Make sure we return the contents of
+            // the 'block' field if it exists, otherwise assume the whole
+            // Json object is what should be in 'block'
+            //
+            // see also 7736e440-4c6b-11ec-8c4d-b42e99f52061
+            match self {
+                Storage::Shared => {
+                    use public::ethereum_blocks as b;
+
+                    b::table
+                        .select(sql::<Jsonb>("coalesce(data -> 'block', data)"))
+                        .filter(b::network_name.eq(chain))
+                        .filter(b::hash.eq(any(Vec::from_iter(
+                            hashes.into_iter().map(|h| format!("{:x}", h)),
+                        ))))
+                        .load::<json::Value>(conn)
+                }
+                Storage::Private(Schema { blocks, .. }) => blocks
+                    .table()
+                    .select(sql::<Jsonb>("coalesce(data -> 'block', data)"))
+                    .filter(
+                        blocks
+                            .hash()
+                            .eq(any(Vec::from_iter(hashes.iter().map(|h| h.as_slice())))),
+                    )
+                    .load::<json::Value>(conn),
+            }
+            .map_err(Into::into)
+        }
+
+        pub(super) fn block_hashes_by_block_number(
+            &self,
+            conn: &PgConnection,
+            chain: &str,
+            number: BlockNumber,
+        ) -> Result<Vec<BlockHash>, Error> {
+            match self {
+                Storage::Shared => {
+                    use public::ethereum_blocks as b;
+
+                    b::table
+                        .select(b::hash)
+                        .filter(b::network_name.eq(&chain))
+                        .filter(b::number.eq(number as i64))
+                        .get_results::<String>(conn)?
+                        .into_iter()
+                        .map(|h| h.parse())
+                        .collect::<Result<Vec<BlockHash>, _>>()
+                        .map_err(Error::from)
+                }
+                Storage::Private(Schema { blocks, .. }) => Ok(blocks
+                    .table()
+                    .select(blocks.hash())
+                    .filter(blocks.number().eq(number as i64))
+                    .get_results::<Vec<u8>>(conn)?
+                    .into_iter()
+                    .map(|hash| BlockHash::from(hash))
+                    .collect::<Vec<BlockHash>>()),
+            }
+        }
+
+        pub(super) fn confirm_block_hash(
+            &self,
+            conn: &PgConnection,
+            chain: &str,
+            number: BlockNumber,
+            hash: &BlockHash,
+        ) -> Result<usize, Error> {
+            let number = number as i64;
+
+            match self {
+                Storage::Shared => {
+                    use public::ethereum_blocks as b;
+
+                    let hash = format!("{:x}", hash);
+                    diesel::delete(b::table)
+                        .filter(b::network_name.eq(chain))
+                        .filter(b::number.eq(number))
+                        .filter(b::hash.ne(&hash))
+                        .execute(conn)
+                        .map_err(Error::from)
+                }
+                Storage::Private(Schema { blocks, .. }) => {
+                    let query = format!(
+                        "delete from {} where number = $1 and hash != $2",
+                        blocks.qname
+                    );
+                    sql_query(query)
+                        .bind::<BigInt, _>(number)
+                        .bind::<Bytea, _>(hash.as_slice())
+                        .execute(conn)
+                        .map_err(Error::from)
+                }
+            }
+        }
+
+        /// timestamp's representation depends the blockchain::Block implementation, on
+        /// ethereum this is a U256 but on different chains it will most likely be different.
+        pub(super) fn block_number(
+            &self,
+            conn: &PgConnection,
+            hash: &BlockHash,
+        ) -> Result<Option<(BlockNumber, Option<u64>)>, StoreError> {
+            const TIMESTAMP_QUERY: &str =
+                "coalesce(data->'block'->>'timestamp', data->>'timestamp')";
+
+            let number = match self {
+                Storage::Shared => {
+                    use public::ethereum_blocks as b;
+
+                    b::table
+                        .select((b::number, sql(TIMESTAMP_QUERY)))
+                        .filter(b::hash.eq(format!("{:x}", hash)))
+                        .first::<(i64, Option<String>)>(conn)
+                        .optional()?
+                }
+                Storage::Private(Schema { blocks, .. }) => blocks
+                    .table()
+                    .select((blocks.number(), sql(TIMESTAMP_QUERY)))
+                    .filter(blocks.hash().eq(hash.as_slice()))
+                    .first::<(i64, Option<String>)>(conn)
+                    .optional()?,
+            };
+
+            match number {
+                None => Ok(None),
+                Some((number, ts)) => {
+                    let number = BlockNumber::try_from(number)
+                        .map_err(|e| StoreError::QueryExecutionError(e.to_string()))?;
+                    Ok(Some((number, crate::chain_store::try_parse_timestamp(ts)?)))
+                }
+            }
+        }
+
+        /// Find the first block that is missing from the database needed to
+        /// complete the chain from block `hash` to the block with number
+        /// `first_block`.
+        pub(super) fn missing_parent(
+            &self,
+            conn: &PgConnection,
+            chain: &str,
+            first_block: i64,
+            hash: H256,
+            genesis: H256,
+        ) -> Result<Option<H256>, Error> {
+            match self {
+                Storage::Shared => {
+                    // We recursively build a temp table 'chain' containing the hash and
+                    // parent_hash of blocks to check. The 'last' value is used to stop
+                    // the recursion and is true if one of these conditions is true:
+                    //   * we are missing a parent block
+                    //   * we checked the required number of blocks
+                    //   * we checked the genesis block
+                    const MISSING_PARENT_SQL: &str = "
+            with recursive chain(hash, parent_hash, last) as (
+                -- base case: look at the head candidate block
+                select b.hash, b.parent_hash, false
+                  from ethereum_blocks b
+                 where b.network_name = $1
+                   and b.hash = $2
+                   and b.hash != $3
+                union all
+                -- recursion step: add a block whose hash is the latest parent_hash
+                -- on chain
+                select chain.parent_hash,
+                       b.parent_hash,
+                       coalesce(b.parent_hash is null
+                             or b.number <= $4
+                             or b.hash = $3, true)
+                  from chain left outer join ethereum_blocks b
+                              on chain.parent_hash = b.hash
+                             and b.network_name = $1
+                 where not chain.last)
+             select hash
+               from chain
+              where chain.parent_hash is null;
+            ";
+
+                    let hash = format!("{:x}", hash);
+                    let genesis = format!("{:x}", genesis);
+                    let missing = sql_query(MISSING_PARENT_SQL)
+                        .bind::<Text, _>(chain)
+                        .bind::<Text, _>(&hash)
+                        .bind::<Text, _>(&genesis)
+                        .bind::<BigInt, _>(first_block)
+                        .load::<BlockHashText>(conn)?;
+
+                    let missing = match missing.len() {
+                        0 => None,
+                        1 => Some(missing[0].hash.parse()?),
+                        _ => {
+                            unreachable!("the query can only return no or one row");
+                        }
+                    };
+                    Ok(missing)
+                }
+                Storage::Private(Schema { blocks, .. }) => {
+                    // This is the same as `MISSING_PARENT_SQL` above except that
+                    // the blocks table has a different name and that it does
+                    // not have a `network_name` column
+                    let query = format!(
+                        "
+            with recursive chain(hash, parent_hash, last) as (
+                -- base case: look at the head candidate block
+                select b.hash, b.parent_hash, false
+                  from {qname} b
+                 where b.hash = $1
+                   and b.hash != $2
+                union all
+                -- recursion step: add a block whose hash is the latest parent_hash
+                -- on chain
+                select chain.parent_hash,
+                       b.parent_hash,
+                       coalesce(b.parent_hash is null
+                             or b.number <= $3
+                             or b.hash = $2, true)
+                  from chain left outer join {qname} b
+                              on chain.parent_hash = b.hash
+                 where not chain.last)
+             select hash
+               from chain
+              where chain.parent_hash is null;
+            ",
+                        qname = blocks.qname
+                    );
+
+                    let missing = sql_query(query)
+                        .bind::<Bytea, _>(hash.as_bytes())
+                        .bind::<Bytea, _>(genesis.as_bytes())
+                        .bind::<BigInt, _>(first_block)
+                        .load::<BlockHashBytea>(conn)?;
+
+                    let missing = match missing.len() {
+                        0 => None,
+                        1 => Some(h256_from_bytes(&missing[0].hash)?),
+                        _ => {
+                            unreachable!("the query can only return no or one row")
+                        }
+                    };
+                    Ok(missing)
+                }
+            }
+        }
+
+        /// Return the best candidate for the new chain head if there is a block
+        /// with a higher block number than the current chain head. The returned
+        /// value if the hash and number of the candidate and the genesis block
+        /// hash for the chain
+        pub(super) fn chain_head_candidate(
+            &self,
+            conn: &PgConnection,
+            chain: &str,
+        ) -> Result<Option<BlockPtr>, Error> {
+            use public::ethereum_networks as n;
+
+            let head = n::table
+                .filter(n::name.eq(chain))
+                .select(n::head_block_number)
+                .first::<Option<i64>>(conn)?
+                .unwrap_or(-1);
+
+            match self {
+                Storage::Shared => {
+                    use public::ethereum_blocks as b;
+                    b::table
+                        .filter(b::network_name.eq(chain))
+                        .filter(b::number.gt(head))
+                        .order_by((b::number.desc(), b::hash))
+                        .select((b::hash, b::number))
+                        .first::<(String, i64)>(conn)
+                        .optional()?
+                        .map(|(hash, number)| BlockPtr::try_from((hash.as_str(), number)))
+                        .transpose()
+                }
+                Storage::Private(Schema { blocks, .. }) => blocks
+                    .table()
+                    .filter(blocks.number().gt(head))
+                    .order_by((blocks.number().desc(), blocks.hash()))
+                    .select((blocks.hash(), blocks.number()))
+                    .first::<(Vec<u8>, i64)>(conn)
+                    .optional()?
+                    .map(|(hash, number)| BlockPtr::try_from((hash.as_slice(), number)))
+                    .transpose(),
+            }
+        }
+
+        pub(super) fn ancestor_block(
+            &self,
+            conn: &PgConnection,
+            block_ptr: BlockPtr,
+            offset: BlockNumber,
+        ) -> Result<Option<json::Value>, Error> {
+            let data = match self {
+                Storage::Shared => {
+                    const ANCESTOR_SQL: &str = "
+        with recursive ancestors(block_hash, block_offset) as (
+            values ($1, 0)
+            union all
+            select b.parent_hash, a.block_offset+1
+              from ancestors a, ethereum_blocks b
+             where a.block_hash = b.hash
+               and a.block_offset < $2
+        )
+        select a.block_hash as hash
+          from ancestors a
+         where a.block_offset = $2;";
+
+                    let hash = sql_query(ANCESTOR_SQL)
+                        .bind::<Text, _>(block_ptr.hash_hex())
+                        .bind::<BigInt, _>(offset as i64)
+                        .get_result::<BlockHashText>(conn)
+                        .optional()?;
+
+                    use public::ethereum_blocks as b;
+
+                    match hash {
+                        None => None,
+                        Some(hash) => Some(
+                            b::table
+                                .filter(b::hash.eq(hash.hash))
+                                .select(b::data)
+                                .first::<json::Value>(conn)?,
+                        ),
+                    }
+                }
+                Storage::Private(Schema { blocks, .. }) => {
+                    // Same as ANCESTOR_SQL except for the table name
+                    let query = format!(
+                        "
+        with recursive ancestors(block_hash, block_offset) as (
+            values ($1, 0)
+            union all
+            select b.parent_hash, a.block_offset+1
+              from ancestors a, {} b
+             where a.block_hash = b.hash
+               and a.block_offset < $2
+        )
+        select a.block_hash as hash
+          from ancestors a
+         where a.block_offset = $2;",
+                        blocks.qname
+                    );
+
+                    let hash = sql_query(query)
+                        .bind::<Bytea, _>(block_ptr.hash_slice())
+                        .bind::<BigInt, _>(offset as i64)
+                        .get_result::<BlockHashBytea>(conn)
+                        .optional()?;
+                    match hash {
+                        None => None,
+                        Some(hash) => Some(
+                            blocks
+                                .table()
+                                .filter(blocks.hash().eq(hash.hash))
+                                .select(blocks.data())
+                                .first::<json::Value>(conn)?,
+                        ),
+                    }
+                }
+            };
+
+            // We need to deal with chain stores where some entries have a
+            // toplevel 'blocks' field and others directly contain what
+            // would be in the 'blocks' field. Make sure the value we return
+            // has a 'block' entry
+            //
+            // see also 7736e440-4c6b-11ec-8c4d-b42e99f52061
+            let data = {
+                use graph::prelude::serde_json::json;
+
+                data.map(|data| match data.get("block") {
+                    Some(_) => data,
+                    None => json!({ "block": data, "transaction_receipts": [] }),
+                })
+            };
+            Ok(data)
+        }
+
+        pub(super) fn delete_blocks_before(
+            &self,
+            conn: &PgConnection,
+            chain: &str,
+            block: i64,
+        ) -> Result<usize, Error> {
+            match self {
+                Storage::Shared => {
+                    use public::ethereum_blocks as b;
+
+                    diesel::delete(b::table)
+                        .filter(b::network_name.eq(chain))
+                        .filter(b::number.lt(block))
+                        .filter(b::number.gt(0))
+                        .execute(conn)
+                        .map_err(Error::from)
+                }
+                Storage::Private(Schema { blocks, .. }) => {
+                    let query = format!(
+                        "delete from {} where number < $1 and number > 0",
+                        blocks.qname
+                    );
+                    sql_query(query)
+                        .bind::<BigInt, _>(block)
+                        .execute(conn)
+                        .map_err(Error::from)
+                }
+            }
+        }
+
+        pub(super) fn delete_blocks_by_hash(
+            &self,
+            conn: &PgConnection,
+            chain: &str,
+            block_hashes: &[&H256],
+        ) -> Result<usize, Error> {
+            use diesel::dsl::any;
+            match self {
+                Storage::Shared => {
+                    use public::ethereum_blocks as b;
+
+                    let hashes: Vec<String> = block_hashes
+                        .iter()
+                        .map(|hash| format!("{hash:x}"))
+                        .collect();
+
+                    diesel::delete(b::table)
+                        .filter(b::network_name.eq(chain))
+                        .filter(b::hash.eq(any(hashes)))
+                        .filter(b::number.gt(0)) // keep genesis
+                        .execute(conn)
+                        .map_err(Error::from)
+                }
+                Storage::Private(Schema { blocks, .. }) => {
+                    let query = format!(
+                        "delete from {} where hash = any($1) and number > 0",
+                        blocks.qname
+                    );
+
+                    let hashes: Vec<&[u8]> =
+                        block_hashes.iter().map(|hash| hash.as_bytes()).collect();
+
+                    sql_query(query)
+                        .bind::<Array<Bytea>, _>(hashes)
+                        .execute(conn)
+                        .map_err(Error::from)
+                }
+            }
+        }
+
+        pub(super) fn get_call_and_access(
+            &self,
+            conn: &PgConnection,
+            id: &[u8],
+        ) -> Result<Option<(Vec<u8>, bool)>, Error> {
+            match self {
+                Storage::Shared => {
+                    use public::eth_call_cache as cache;
+                    use public::eth_call_meta as meta;
+
+                    cache::table
+                        .find(id.as_ref())
+                        .inner_join(meta::table)
+                        .select((
+                            cache::return_value,
+                            sql("CURRENT_DATE > eth_call_meta.accessed_at"),
+                        ))
+                        .get_result(conn)
+                        .optional()
+                        .map_err(Error::from)
+                }
+                Storage::Private(Schema {
+                    call_cache,
+                    call_meta,
+                    ..
+                }) => call_cache
+                    .table()
+                    .inner_join(
+                        call_meta.table().on(call_meta
+                            .contract_address()
+                            .eq(call_cache.contract_address())),
+                    )
+                    .filter(call_cache.id().eq(id))
+                    .select((
+                        call_cache.return_value(),
+                        sql(&format!(
+                            "CURRENT_DATE > {}.{}",
+                            CallMetaTable::TABLE_NAME,
+                            CallMetaTable::ACCESSED_AT
+                        )),
+                    ))
+                    .first(conn)
+                    .optional()
+                    .map_err(Error::from),
+            }
+        }
+
+        pub(super) fn get_calls_in_block(
+            &self,
+            conn: &PgConnection,
+            block_ptr: BlockPtr,
+        ) -> Result<Vec<CachedEthereumCall>, Error> {
+            let block_num = block_ptr.block_number();
+
+            let rows = match self {
+                Storage::Shared => {
+                    use public::eth_call_cache as cache;
+
+                    cache::table
+                        .select((cache::id, cache::return_value, cache::contract_address))
+                        .filter(cache::block_number.eq(block_num))
+                        .order(cache::contract_address)
+                        .get_results::<(Vec<u8>, Vec<u8>, Vec<u8>)>(conn)?
+                }
+                Storage::Private(Schema { call_cache, .. }) => call_cache
+                    .table()
+                    .select((
+                        call_cache.id(),
+                        call_cache.return_value(),
+                        call_cache.contract_address(),
+                    ))
+                    .filter(call_cache.block_number().eq(block_num as i64))
+                    .order(call_cache.contract_address())
+                    .get_results::<(Vec<u8>, Vec<u8>, Vec<u8>)>(conn)?,
+            };
+
+            Ok(rows
+                .into_iter()
+                .map(|row| CachedEthereumCall {
+                    blake3_id: row.0,
+                    block_ptr: block_ptr.clone(),
+                    contract_address: H160::from_slice(&row.2[..]),
+                    return_value: row.1,
+                })
+                .collect())
+        }
+
+        pub(super) fn update_accessed_at(
+            &self,
+            conn: &PgConnection,
+            contract_address: &[u8],
+        ) -> Result<(), Error> {
+            let result = match self {
+                Storage::Shared => {
+                    use public::eth_call_meta as meta;
+
+                    update(meta::table.find(contract_address.as_ref()))
+                        .set(meta::accessed_at.eq(sql("CURRENT_DATE")))
+                        .execute(conn)
+                }
+                Storage::Private(Schema { call_meta, .. }) => {
+                    let query = format!(
+                        "update {} set accessed_at = CURRENT_DATE where contract_address = $1",
+                        call_meta.qname
+                    );
+                    sql_query(query)
+                        .bind::<Bytea, _>(contract_address)
+                        .execute(conn)
+                }
+            };
+            result.map(|_| ()).map_err(Error::from)
+        }
+
+        pub(super) fn set_call(
+            &self,
+            conn: &PgConnection,
+            id: &[u8],
+            contract_address: &[u8],
+            block_number: i32,
+            return_value: &[u8],
+        ) -> Result<(), Error> {
+            let result = match self {
+                Storage::Shared => {
+                    use public::eth_call_cache as cache;
+                    use public::eth_call_meta as meta;
+
+                    insert_into(cache::table)
+                        .values((
+                            cache::id.eq(id),
+                            cache::contract_address.eq(contract_address),
+                            cache::block_number.eq(block_number),
+                            cache::return_value.eq(return_value),
+                        ))
+                        .on_conflict_do_nothing()
+                        .execute(conn)?;
+
+                    // See comment in the Private branch for why the
+                    // raciness of this check is ok
+                    let update_meta = meta::table
+                        .filter(meta::contract_address.eq(contract_address))
+                        .select(sql("accessed_at < current_date"))
+                        .first::<bool>(conn)
+                        .optional()?
+                        .unwrap_or(true);
+                    if update_meta {
+                        let accessed_at = meta::accessed_at.eq(sql("CURRENT_DATE"));
+                        insert_into(meta::table)
+                            .values((
+                                meta::contract_address.eq(contract_address),
+                                accessed_at.clone(),
+                            ))
+                            .on_conflict(meta::contract_address)
+                            .do_update()
+                            .set(accessed_at)
+                            // TODO: Add a where clause similar to the Private
+                            // branch to avoid unnecessary updates (not entirely
+                            // trivial with diesel)
+                            .execute(conn)
+                    } else {
+                        Ok(0)
+                    }
+                }
+                Storage::Private(Schema {
+                    call_cache,
+                    call_meta,
+                    ..
+                }) => {
+                    let query = format!(
+                        "insert into {}(id, contract_address, block_number, return_value) \
+                         values ($1, $2, $3, $4) on conflict do nothing",
+                        call_cache.qname
+                    );
+                    sql_query(query)
+                        .bind::<Bytea, _>(id)
+                        .bind::<Bytea, _>(contract_address)
+                        .bind::<Integer, _>(block_number)
+                        .bind::<Bytea, _>(return_value)
+                        .execute(conn)?;
+
+                    // Check whether we need to update `call_meta`. The
+                    // check is racy, since an update can happen between the
+                    // check and the insert below, but that's fine. We can
+                    // tolerate a small number of redundant updates, but
+                    // will still catch the majority of cases where an
+                    // update is not needed
+                    let update_meta = call_meta
+                        .table()
+                        .filter(call_meta.contract_address().eq(contract_address))
+                        .select(sql("accessed_at < current_date"))
+                        .first::<bool>(conn)
+                        .optional()?
+                        .unwrap_or(true);
+
+                    if update_meta {
+                        let query = format!(
+                            "insert into {}(contract_address, accessed_at) \
+                         values ($1, CURRENT_DATE) \
+                         on conflict(contract_address)
+                         do update set accessed_at = CURRENT_DATE \
+                                 where excluded.accessed_at < CURRENT_DATE",
+                            call_meta.qname
+                        );
+                        sql_query(query)
+                            .bind::<Bytea, _>(contract_address)
+                            .execute(conn)
+                    } else {
+                        Ok(0)
+                    }
+                }
+            };
+            result.map(|_| ()).map_err(Error::from)
+        }
+
+        #[cfg(debug_assertions)]
+        // used by `super::set_chain` for test support
+        pub(super) fn set_chain(
+            &self,
+            conn: &PgConnection,
+            chain_name: &str,
+            genesis_hash: &str,
+            chain: Vec<&dyn Block>,
+        ) {
+            use public::ethereum_networks as n;
+
+            match self {
+                Storage::Shared => {
+                    use public::eth_call_cache as c;
+                    use public::eth_call_meta as m;
+                    use public::ethereum_blocks as b;
+
+                    diesel::delete(b::table.filter(b::network_name.eq(chain_name)))
+                        .execute(conn)
+                        .expect("Failed to delete ethereum_blocks");
+                    // We don't have a good way to clean out the call cache
+                    // per chain; just nuke everything
+                    diesel::delete(c::table).execute(conn).unwrap();
+                    diesel::delete(m::table).execute(conn).unwrap();
+                }
+                Storage::Private(Schema {
+                    blocks,
+                    call_meta,
+                    call_cache,
+                    ..
+                }) => {
+                    for qname in &[&blocks.qname, &call_meta.qname, &call_cache.qname] {
+                        let query = format!("delete from {}", qname);
+                        sql_query(query)
+                            .execute(conn)
+                            .expect(&format!("Failed to delete {}", qname));
+                    }
+                }
+            }
+
+            for block in &chain {
+                self.upsert_block(conn, chain_name, *block, true).unwrap();
+            }
+
+            diesel::update(n::table.filter(n::name.eq(chain_name)))
+                .set((
+                    n::genesis_block_hash.eq(genesis_hash),
+                    n::head_block_hash.eq::<Option<&str>>(None),
+                    n::head_block_number.eq::<Option<i64>>(None),
+                ))
+                .execute(conn)
+                .unwrap();
+        }
+
+        /// Queries the database for all the transaction receipts in a given block.
+        pub(crate) fn find_transaction_receipts_in_block(
+            &self,
+            conn: &PgConnection,
+            block_hash: H256,
+        ) -> anyhow::Result<Vec<LightTransactionReceipt>> {
+            let query = sql_query(format!(
+                "
+select
+    ethereum_hex_to_bytea(receipt ->> 'transactionHash') as transaction_hash,
+    ethereum_hex_to_bytea(receipt ->> 'transactionIndex') as transaction_index,
+    ethereum_hex_to_bytea(receipt ->> 'blockHash') as block_hash,
+    ethereum_hex_to_bytea(receipt ->> 'blockNumber') as block_number,
+    ethereum_hex_to_bytea(receipt ->> 'gasUsed') as gas_used,
+    ethereum_hex_to_bytea(receipt ->> 'status') as status
+from (
+    select
+        jsonb_array_elements(data -> 'transaction_receipts') as receipt
+    from
+        {blocks_table_name}
+    where hash = $1) as temp;
+",
+                blocks_table_name = self.blocks_table()
+            ));
+
+            let query_results: Result<Vec<RawTransactionReceipt>, diesel::result::Error> = {
+                // The `hash` column has different types between the `public.ethereum_blocks` and the
+                // `chain*.blocks` tables, so we must check which one is being queried to bind the
+                // `block_hash` parameter to the correct type
+                match self {
+                    Storage::Shared => query
+                        .bind::<Text, _>(format!("{:x}", block_hash))
+                        .get_results(conn),
+                    Storage::Private(_) => query
+                        .bind::<Binary, _>(block_hash.as_bytes())
+                        .get_results(conn),
+                }
+            };
+            query_results
+                .map_err(|error| {
+                    anyhow::anyhow!(
+                        "Error fetching transaction receipt from database: {}",
+                        error
+                    )
+                })?
+                .into_iter()
+                .map(LightTransactionReceipt::try_from)
+                .collect()
+        }
+    }
+}
+
+pub struct ChainStore {
+    pool: ConnectionPool,
+    pub chain: String,
+    pub(crate) storage: data::Storage,
+    genesis_block_ptr: BlockPtr,
+    status: ChainStatus,
+    chain_head_update_sender: ChainHeadUpdateSender,
+    block_cache: TimedCache<&'static str, BlockPtr>,
+}
+
+impl ChainStore {
+    pub(crate) fn new(
+        chain: String,
+        storage: data::Storage,
+        net_identifier: &ChainIdentifier,
+        status: ChainStatus,
+        chain_head_update_sender: ChainHeadUpdateSender,
+        pool: ConnectionPool,
+    ) -> Self {
+        ChainStore {
+            pool,
+            chain,
+            storage,
+            genesis_block_ptr: BlockPtr::new(net_identifier.genesis_block_hash.clone(), 0),
+            status,
+            chain_head_update_sender,
+            block_cache: TimedCache::new(Duration::from_secs(5)),
+        }
+    }
+
+    pub fn is_ingestible(&self) -> bool {
+        matches!(self.status, ChainStatus::Ingestible)
+    }
+
+    fn get_conn(&self) -> Result<PooledConnection<ConnectionManager<PgConnection>>, Error> {
+        self.pool.get().map_err(Error::from)
+    }
+
+    pub(crate) fn create(&self, ident: &ChainIdentifier) -> Result<(), Error> {
+        use public::ethereum_networks::dsl::*;
+
+        let conn = self.get_conn()?;
+        conn.transaction(|| {
+            insert_into(ethereum_networks)
+                .values((
+                    name.eq(&self.chain),
+                    namespace.eq(&self.storage),
+                    head_block_hash.eq::<Option<String>>(None),
+                    head_block_number.eq::<Option<i64>>(None),
+                    net_version.eq(&ident.net_version),
+                    genesis_block_hash.eq(ident.genesis_block_hash.hash_hex()),
+                ))
+                .on_conflict(name)
+                .do_nothing()
+                .execute(&conn)?;
+            self.storage.create(&conn)
+        })?;
+
+        Ok(())
+    }
+
+    pub(crate) fn drop_chain(&self) -> Result<(), Error> {
+        use diesel::dsl::delete;
+        use public::ethereum_networks as n;
+
+        let conn = self.get_conn()?;
+        conn.transaction(|| {
+            self.storage.drop_storage(&conn, &self.chain)?;
+
+            delete(n::table.filter(n::name.eq(&self.chain))).execute(&conn)?;
+            Ok(())
+        })
+    }
+
+    pub fn chain_head_pointers(
+        conn: &PgConnection,
+    ) -> Result<HashMap<String, BlockPtr>, StoreError> {
+        use public::ethereum_networks as n;
+
+        let pointers: Vec<(String, BlockPtr)> = n::table
+            .select((n::name, n::head_block_hash, n::head_block_number))
+            .load::<(String, Option<String>, Option<i64>)>(conn)?
+            .into_iter()
+            .filter_map(|(name, hash, number)| match (hash, number) {
+                (Some(hash), Some(number)) => Some((name, hash, number)),
+                _ => None,
+            })
+            .map(|(name, hash, number)| {
+                BlockPtr::try_from((hash.as_str(), number)).map(|ptr| (name, ptr))
+            })
+            .collect::<Result<Vec<_>, _>>()?;
+        Ok(HashMap::from_iter(pointers))
+    }
+
+    pub fn chain_head_block(&self, chain: &str) -> Result<Option<BlockNumber>, StoreError> {
+        use public::ethereum_networks as n;
+
+        let number: Option<i64> = n::table
+            .filter(n::name.eq(chain))
+            .select(n::head_block_number)
+            .first::<Option<i64>>(&self.get_conn()?)
+            .optional()?
+            .flatten();
+
+        number.map(|number| number.try_into()).transpose().map_err(
+            |e: std::num::TryFromIntError| {
+                constraint_violation!(
+                    "head block number for {} is {:?} which does not fit into a u32: {}",
+                    chain,
+                    number,
+                    e.to_string()
+                )
+            },
+        )
+    }
+
+    /// Store the given chain as the blocks for the `network` set the
+    /// network's genesis block to `genesis_hash`, and head block to
+    /// `null`
+    #[cfg(debug_assertions)]
+    pub fn set_chain(&self, genesis_hash: &str, chain: Vec<&dyn Block>) {
+        let conn = self.pool.get().expect("can get a database connection");
+
+        self.storage
+            .set_chain(&conn, &self.chain, genesis_hash, chain);
+    }
+
+    pub fn delete_blocks(&self, block_hashes: &[&H256]) -> Result<usize, Error> {
+        let conn = self.get_conn()?;
+        self.storage
+            .delete_blocks_by_hash(&conn, &self.chain, block_hashes)
+    }
+
+    pub fn truncate_block_cache(&self) -> Result<(), StoreError> {
+        let conn = self.get_conn()?;
+        self.storage.truncate_block_cache(&conn)?;
+        Ok(())
+    }
+}
+
+#[async_trait]
+impl ChainStoreTrait for ChainStore {
+    fn genesis_block_ptr(&self) -> Result<BlockPtr, Error> {
+        Ok(self.genesis_block_ptr.clone())
+    }
+
+    async fn upsert_block(&self, block: Arc<dyn Block>) -> Result<(), Error> {
+        let pool = self.pool.clone();
+        let network = self.chain.clone();
+        let storage = self.storage.clone();
+        pool.with_conn(move |conn, _| {
+            conn.transaction(|| {
+                storage
+                    .upsert_block(conn, &network, block.as_ref(), true)
+                    .map_err(CancelableError::from)
+            })
+        })
+        .await
+        .map_err(Error::from)
+    }
+
+    fn upsert_light_blocks(&self, blocks: &[&dyn Block]) -> Result<(), Error> {
+        let conn = self.pool.get()?;
+        for block in blocks {
+            self.storage
+                .upsert_block(&conn, &self.chain, *block, false)?;
+        }
+        Ok(())
+    }
+
+    async fn attempt_chain_head_update(
+        self: Arc<Self>,
+        ancestor_count: BlockNumber,
+    ) -> Result<Option<H256>, Error> {
+        use public::ethereum_networks as n;
+
+        let (missing, ptr) = {
+            let chain_store = self.clone();
+            self.pool
+                .with_conn(move |conn, _| {
+                    let candidate = chain_store
+                        .storage
+                        .chain_head_candidate(conn, &chain_store.chain)
+                        .map_err(CancelableError::from)?;
+                    let (ptr, first_block) = match &candidate {
+                        None => return Ok((None, None)),
+                        Some(ptr) => (ptr, 0.max(ptr.number.saturating_sub(ancestor_count))),
+                    };
+
+                    match chain_store
+                        .storage
+                        .missing_parent(
+                            conn,
+                            &chain_store.chain,
+                            first_block as i64,
+                            ptr.hash_as_h256(),
+                            chain_store.genesis_block_ptr.hash_as_h256(),
+                        )
+                        .map_err(CancelableError::from)?
+                    {
+                        Some(missing) => {
+                            return Ok((Some(missing), None));
+                        }
+                        None => { /* we have a complete chain, no missing parents */ }
+                    }
+
+                    let hash = ptr.hash_hex();
+                    let number = ptr.number as i64;
+
+                    conn.transaction(
+                        || -> Result<(Option<H256>, Option<(String, i64)>), StoreError> {
+                            update(n::table.filter(n::name.eq(&chain_store.chain)))
+                                .set((
+                                    n::head_block_hash.eq(&hash),
+                                    n::head_block_number.eq(number),
+                                ))
+                                .execute(conn)?;
+                            Ok((None, Some((hash, number))))
+                        },
+                    )
+                    .map_err(CancelableError::from)
+                })
+                .await?
+        };
+        if let Some((hash, number)) = ptr {
+            self.chain_head_update_sender.send(&hash, number)?;
+        }
+
+        Ok(missing)
+    }
+
+    async fn chain_head_ptr(self: Arc<Self>) -> Result<Option<BlockPtr>, Error> {
+        use public::ethereum_networks::dsl::*;
+
+        Ok(self
+            .cheap_clone()
+            .pool
+            .with_conn(move |conn, _| {
+                ethereum_networks
+                    .select((head_block_hash, head_block_number))
+                    .filter(name.eq(&self.chain))
+                    .load::<(Option<String>, Option<i64>)>(conn)
+                    .map(|rows| {
+                        rows.first()
+                            .map(|(hash_opt, number_opt)| match (hash_opt, number_opt) {
+                                (Some(hash), Some(number)) => Some(
+                                    (
+                                        // FIXME:
+                                        //
+                                        // workaround for arweave
+                                        H256::from_slice(&hex::decode(hash).unwrap()[..32]),
+                                        *number,
+                                    )
+                                        .into(),
+                                ),
+                                (None, None) => None,
+                                _ => unreachable!(),
+                            })
+                            .and_then(|opt: Option<BlockPtr>| opt)
+                            .map(|head| {
+                                self.block_cache.set("head", Arc::new(head.clone()));
+                                head
+                            })
+                    })
+                    .map_err(|e| CancelableError::from(StoreError::from(e)))
+            })
+            .await?)
+    }
+
+    async fn cached_head_ptr(self: Arc<Self>) -> Result<Option<BlockPtr>, Error> {
+        match self.block_cache.get("head") {
+            Some(head) => Ok(Some(head.as_ref().clone())),
+            None => self.chain_head_ptr().await,
+        }
+    }
+
+    fn chain_head_cursor(&self) -> Result<Option<String>, Error> {
+        use public::ethereum_networks::dsl::*;
+
+        ethereum_networks
+            .select(head_block_cursor)
+            .filter(name.eq(&self.chain))
+            .load::<Option<String>>(&*self.get_conn()?)
+            .map(|rows| {
+                rows.first()
+                    .map(|cursor_opt| cursor_opt.as_ref().cloned())
+                    .and_then(|opt| opt)
+            })
+            .map_err(Error::from)
+    }
+
+    async fn set_chain_head(
+        self: Arc<Self>,
+        block: Arc<dyn Block>,
+        cursor: String,
+    ) -> Result<(), Error> {
+        use public::ethereum_networks as n;
+
+        let pool = self.pool.clone();
+        let network = self.chain.clone();
+        let storage = self.storage.clone();
+
+        let ptr = block.ptr();
+        let hash = ptr.hash_hex();
+        let number = ptr.number as i64; //block height
+
+        //this will send an update via postgres, channel: chain_head_updates
+        self.chain_head_update_sender.send(&hash, number)?;
+
+        pool.with_conn(move |conn, _| {
+            conn.transaction(|| -> Result<(), StoreError> {
+                storage
+                    .upsert_block(conn, &network, block.as_ref(), true)
+                    .map_err(CancelableError::from)?;
+
+                update(n::table.filter(n::name.eq(&self.chain)))
+                    .set((
+                        n::head_block_hash.eq(&hash),
+                        n::head_block_number.eq(number),
+                        n::head_block_cursor.eq(cursor),
+                    ))
+                    .execute(conn)?;
+
+                Ok(())
+            })
+            .map_err(CancelableError::from)
+        })
+        .await?;
+
+        Ok(())
+    }
+
+    fn blocks(&self, hashes: &[BlockHash]) -> Result<Vec<json::Value>, Error> {
+        let conn = self.get_conn()?;
+        self.storage.blocks(&conn, &self.chain, hashes)
+    }
+
+    async fn ancestor_block(
+        self: Arc<Self>,
+        block_ptr: BlockPtr,
+        offset: BlockNumber,
+    ) -> Result<Option<json::Value>, Error> {
+        ensure!(
+            block_ptr.number >= offset,
+            "block offset {} for block `{}` points to before genesis block",
+            offset,
+            block_ptr.hash_hex()
+        );
+
+        Ok(self
+            .cheap_clone()
+            .pool
+            .with_conn(move |conn, _| {
+                self.storage
+                    .ancestor_block(&conn, block_ptr, offset)
+                    .map_err(|e| CancelableError::from(StoreError::from(e)))
+            })
+            .await?)
+    }
+
+    fn cleanup_cached_blocks(
+        &self,
+        ancestor_count: BlockNumber,
+    ) -> Result<Option<(BlockNumber, usize)>, Error> {
+        use diesel::sql_types::Integer;
+
+        #[derive(QueryableByName)]
+        struct MinBlock {
+            #[sql_type = "Integer"]
+            block: i32,
+        }
+
+        // Remove all blocks from the cache that are behind the slowest
+        // subgraph's head block, but retain the genesis block. We stay
+        // behind the slowest subgraph so that we do not interfere with its
+        // syncing activity.
+        // We also stay `ancestor_count` many blocks behind the head of the
+        // chain since the block ingestor consults these blocks frequently
+        //
+        // Only consider active subgraphs that have not failed
+
+        // This assumes that subgraph metadata and blocks are stored in the
+        // same shard. We disallow setting GRAPH_ETHEREUM_CLEANUP_BLOCKS in
+        // graph_node::config so that we only run this query when we know
+        // it will work. Running this with a sharded store might remove
+        // blocks that are still needed by deployments in other shard
+        //
+        // See 8b6ad0c64e244023ac20ced7897fe666
+
+        let conn = self.get_conn()?;
+        let query = "
+            select coalesce(
+                   least(a.block,
+                        (select head_block_number::int - $1
+                           from ethereum_networks
+                          where name = $2)), -1)::int as block
+              from (
+                select min(d.latest_ethereum_block_number) as block
+                  from subgraphs.subgraph_deployment d,
+                       subgraphs.subgraph_deployment_assignment a,
+                       deployment_schemas ds
+                 where ds.subgraph = d.deployment
+                   and a.id = d.id
+                   and not d.failed
+                   and ds.network = $2) a;";
+        diesel::sql_query(query)
+            .bind::<Integer, _>(ancestor_count)
+            .bind::<Text, _>(&self.chain)
+            .load::<MinBlock>(&conn)?
+            .first()
+            .map(|MinBlock { block }| {
+                // If we could not determine a minimum block, the query
+                // returns -1, and we should not do anything. We also guard
+                // against removing the genesis block
+                if *block > 0 {
+                    self.storage
+                        .delete_blocks_before(&conn, &self.chain, *block as i64)
+                        .map(|rows| Some((*block, rows)))
+                } else {
+                    Ok(None)
+                }
+            })
+            .unwrap_or(Ok(None))
+            .map_err(Into::into)
+    }
+
+    fn block_hashes_by_block_number(&self, number: BlockNumber) -> Result<Vec<BlockHash>, Error> {
+        let conn = self.get_conn()?;
+        self.storage
+            .block_hashes_by_block_number(&conn, &self.chain, number)
+    }
+
+    fn confirm_block_hash(&self, number: BlockNumber, hash: &BlockHash) -> Result<usize, Error> {
+        let conn = self.get_conn()?;
+        self.storage
+            .confirm_block_hash(&conn, &self.chain, number, hash)
+    }
+
+    async fn block_number(
+        &self,
+        hash: &BlockHash,
+    ) -> Result<Option<(String, BlockNumber, Option<u64>)>, StoreError> {
+        let hash = hash.clone();
+        let storage = self.storage.clone();
+        let chain = self.chain.clone();
+        self.pool
+            .with_conn(move |conn, _| {
+                storage
+                    .block_number(&conn, &hash)
+                    .map(|opt| opt.map(|(number, timestamp)| (chain.clone(), number, timestamp)))
+                    .map_err(|e| StoreError::from(e).into())
+            })
+            .await
+    }
+
+    async fn transaction_receipts_in_block(
+        &self,
+        block_hash: &H256,
+    ) -> Result<Vec<LightTransactionReceipt>, StoreError> {
+        let pool = self.pool.clone();
+        let storage = self.storage.clone();
+        let block_hash = block_hash.to_owned();
+        pool.with_conn(move |conn, _| {
+            storage
+                .find_transaction_receipts_in_block(&conn, block_hash)
+                .map_err(|e| StoreError::from(e).into())
+        })
+        .await
+    }
+}
+
+fn try_parse_timestamp(ts: Option<String>) -> Result<Option<u64>, StoreError> {
+    let ts = match ts {
+        Some(str) => str,
+        None => return Ok(None),
+    };
+
+    let (radix, idx) = if ts.starts_with("0x") {
+        (16, 2)
+    } else {
+        (10, 0)
+    };
+
+    u64::from_str_radix(&ts[idx..], radix)
+        .map_err(|err| {
+            StoreError::QueryExecutionError(format!(
+                "unexpected timestamp format {}, err: {}",
+                ts, err
+            ))
+        })
+        .map(Some)
+}
+
+impl EthereumCallCache for ChainStore {
+    fn get_call(
+        &self,
+        contract_address: ethabi::Address,
+        encoded_call: &[u8],
+        block: BlockPtr,
+    ) -> Result<Option<Vec<u8>>, Error> {
+        let id = contract_call_id(&contract_address, encoded_call, &block);
+        let conn = &*self.get_conn()?;
+        if let Some(call_output) = conn.transaction::<_, Error, _>(|| {
+            if let Some((return_value, update_accessed_at)) =
+                self.storage.get_call_and_access(conn, id.as_ref())?
+            {
+                if update_accessed_at {
+                    self.storage
+                        .update_accessed_at(conn, contract_address.as_ref())?;
+                }
+                Ok(Some(return_value))
+            } else {
+                Ok(None)
+            }
+        })? {
+            Ok(Some(call_output))
+        } else {
+            Ok(None)
+        }
+    }
+
+    fn get_calls_in_block(&self, block: BlockPtr) -> Result<Vec<CachedEthereumCall>, Error> {
+        let conn = &*self.get_conn()?;
+        conn.transaction::<_, Error, _>(|| Ok(self.storage.get_calls_in_block(conn, block)?))
+    }
+
+    fn set_call(
+        &self,
+        contract_address: ethabi::Address,
+        encoded_call: &[u8],
+        block: BlockPtr,
+        return_value: &[u8],
+    ) -> Result<(), Error> {
+        let id = contract_call_id(&contract_address, encoded_call, &block);
+        let conn = &*self.get_conn()?;
+        conn.transaction(|| {
+            self.storage.set_call(
+                conn,
+                id.as_ref(),
+                contract_address.as_ref(),
+                block.number as i32,
+                return_value,
+            )
+        })
+    }
+}
+
+/// The id is the hashed encoded_call + contract_address + block hash to uniquely identify the call.
+/// 256 bits of output, and therefore 128 bits of security against collisions, are needed since this
+/// could be targeted by a birthday attack.
+fn contract_call_id(
+    contract_address: &ethabi::Address,
+    encoded_call: &[u8],
+    block: &BlockPtr,
+) -> [u8; 32] {
+    let mut hash = blake3::Hasher::new();
+    hash.update(encoded_call);
+    hash.update(contract_address.as_ref());
+    hash.update(block.hash_slice());
+    *hash.finalize().as_bytes()
+}
diff --git a/store/postgres/src/connection_pool.rs b/store/postgres/src/connection_pool.rs
new file mode 100644
index 0000000..3e665a1
--- /dev/null
+++ b/store/postgres/src/connection_pool.rs
@@ -0,0 +1,1102 @@
+use diesel::r2d2::Builder;
+use diesel::{connection::SimpleConnection, pg::PgConnection};
+use diesel::{
+    r2d2::{self, event as e, ConnectionManager, HandleEvent, Pool, PooledConnection},
+    Connection,
+};
+use diesel::{sql_query, RunQueryDsl};
+
+use graph::cheap_clone::CheapClone;
+use graph::constraint_violation;
+use graph::prelude::tokio;
+use graph::prelude::tokio::time::Instant;
+use graph::slog::warn;
+use graph::util::timed_rw_lock::TimedMutex;
+use graph::{
+    prelude::{
+        anyhow::{self, anyhow, bail},
+        crit, debug, error, info, o,
+        tokio::sync::Semaphore,
+        CancelGuard, CancelHandle, CancelToken as _, CancelableError, Counter, Gauge, Logger,
+        MetricsRegistry, MovingStats, PoolWaitStats, StoreError, ENV_VARS,
+    },
+    util::security::SafeDisplay,
+};
+
+use std::fmt::{self, Write};
+use std::sync::atomic::{AtomicBool, Ordering};
+use std::sync::Arc;
+use std::time::Duration;
+use std::{collections::HashMap, sync::RwLock};
+
+use postgres::config::{Config, Host};
+
+use crate::primary::{self, NAMESPACE_PUBLIC};
+use crate::{advisory_lock, catalog};
+use crate::{Shard, PRIMARY_SHARD};
+
+pub struct ForeignServer {
+    pub name: String,
+    pub shard: Shard,
+    pub user: String,
+    pub password: String,
+    pub host: String,
+    pub port: u16,
+    pub dbname: String,
+}
+
+impl ForeignServer {
+    pub(crate) const PRIMARY_PUBLIC: &'static str = "primary_public";
+
+    /// The name of the foreign server under which data for `shard` is
+    /// accessible
+    pub fn name(shard: &Shard) -> String {
+        format!("shard_{}", shard.as_str())
+    }
+
+    /// The name of the schema under which the `subgraphs` schema for `shard`
+    /// is accessible in shards that are not `shard`
+    pub fn metadata_schema(shard: &Shard) -> String {
+        format!("{}_subgraphs", Self::name(shard))
+    }
+
+    pub fn new_from_raw(shard: String, postgres_url: &str) -> Result<Self, anyhow::Error> {
+        Self::new(Shard::new(shard)?, postgres_url)
+    }
+
+    pub fn new(shard: Shard, postgres_url: &str) -> Result<Self, anyhow::Error> {
+        let config: Config = match postgres_url.parse() {
+            Ok(config) => config,
+            Err(e) => panic!(
+                "failed to parse Postgres connection string `{}`: {}",
+                SafeDisplay(postgres_url),
+                e
+            ),
+        };
+
+        let host = match config.get_hosts().get(0) {
+            Some(Host::Tcp(host)) => host.to_string(),
+            _ => bail!("can not find host name in `{}`", SafeDisplay(postgres_url)),
+        };
+
+        let user = config
+            .get_user()
+            .ok_or_else(|| anyhow!("could not find user in `{}`", SafeDisplay(postgres_url)))?
+            .to_string();
+        let password = String::from_utf8(
+            config
+                .get_password()
+                .ok_or_else(|| anyhow!("could not find user in `{}`", SafeDisplay(postgres_url)))?
+                .into(),
+        )?;
+        let port = config.get_ports().get(0).cloned().unwrap_or(5432u16);
+        let dbname = config
+            .get_dbname()
+            .map(|s| s.to_string())
+            .ok_or_else(|| anyhow!("could not find user in `{}`", SafeDisplay(postgres_url)))?;
+
+        Ok(Self {
+            name: Self::name(&shard),
+            shard,
+            user,
+            password,
+            host,
+            port,
+            dbname,
+        })
+    }
+
+    /// Create a new foreign server and user mapping on `conn` for this foreign
+    /// server
+    fn create(&self, conn: &PgConnection) -> Result<(), StoreError> {
+        let query = format!(
+            "\
+        create server \"{name}\"
+               foreign data wrapper postgres_fdw
+               options (host '{remote_host}', port '{remote_port}', dbname '{remote_db}', updatable 'false');
+        create user mapping
+               for current_user server \"{name}\"
+               options (user '{remote_user}', password '{remote_password}');",
+            name = self.name,
+            remote_host = self.host,
+            remote_port = self.port,
+            remote_db = self.dbname,
+            remote_user = self.user,
+            remote_password = self.password,
+        );
+        Ok(conn.batch_execute(&query)?)
+    }
+
+    /// Update an existing user mapping with possibly new details
+    fn update(&self, conn: &PgConnection) -> Result<(), StoreError> {
+        let options = catalog::server_options(conn, &self.name)?;
+        let set_or_add = |option: &str| -> &'static str {
+            if options.contains_key(option) {
+                "set"
+            } else {
+                "add"
+            }
+        };
+
+        let query = format!(
+            "\
+        alter server \"{name}\"
+              options (set host '{remote_host}', {set_port} port '{remote_port}', set dbname '{remote_db}');
+        alter user mapping
+              for current_user server \"{name}\"
+              options (set user '{remote_user}', set password '{remote_password}');",
+            name = self.name,
+            remote_host = self.host,
+            set_port = set_or_add("port"),
+            remote_port = self.port,
+            remote_db = self.dbname,
+            remote_user = self.user,
+            remote_password = self.password,
+        );
+        Ok(conn.batch_execute(&query)?)
+    }
+
+    /// Map key tables from the primary into our local schema. If we are the
+    /// primary, set them up as views.
+    ///
+    /// We recreate this mapping on every server start so that migrations that
+    /// change one of the mapped tables actually show up in the imported tables
+    fn map_primary(conn: &PgConnection, shard: &Shard) -> Result<(), StoreError> {
+        catalog::recreate_schema(conn, Self::PRIMARY_PUBLIC)?;
+
+        let mut query = String::new();
+        for table_name in ["deployment_schemas", "chains", "active_copies"] {
+            let create_stmt = if shard == &*PRIMARY_SHARD {
+                format!(
+                    "create view {nsp}.{table_name} as select * from public.{table_name};",
+                    nsp = Self::PRIMARY_PUBLIC,
+                    table_name = table_name
+                )
+            } else {
+                catalog::create_foreign_table(
+                    conn,
+                    NAMESPACE_PUBLIC,
+                    table_name,
+                    Self::PRIMARY_PUBLIC,
+                    Self::name(&*PRIMARY_SHARD).as_str(),
+                )?
+            };
+            write!(query, "{}", create_stmt)?;
+        }
+        conn.batch_execute(&query)?;
+        Ok(())
+    }
+
+    /// Map the `subgraphs` schema from the foreign server `self` into the
+    /// database accessible through `conn`
+    fn map_metadata(&self, conn: &PgConnection) -> Result<(), StoreError> {
+        let nsp = Self::metadata_schema(&self.shard);
+        catalog::recreate_schema(conn, &nsp)?;
+        let mut query = String::new();
+        for table_name in [
+            "subgraph_error",
+            "dynamic_ethereum_contract_data_source",
+            "table_stats",
+            "subgraph_deployment_assignment",
+            "subgraph",
+            "subgraph_version",
+        ] {
+            let create_stmt =
+                catalog::create_foreign_table(conn, "subgraphs", table_name, &nsp, &self.name)?;
+            write!(query, "{}", create_stmt)?;
+        }
+        Ok(conn.batch_execute(&query)?)
+    }
+}
+
+/// How long to keep connections in the `fdw_pool` around before closing
+/// them on idle. This is much shorter than the default of 10 minutes.
+const FDW_IDLE_TIMEOUT: Duration = Duration::from_secs(60);
+
+/// A pool goes through several states, and this enum tracks what state we
+/// are in, together with the `state_tracker` field on `ConnectionPool`.
+/// When first created, the pool is in state `Created`; once we successfully
+/// called `setup` on it, it moves to state `Ready`. During use, we use the
+/// r2d2 callbacks to determine if the database is available or not, and set
+/// the `available` field accordingly. Tracking that allows us to fail fast
+/// and avoids having to wait for a connection timeout every time we need a
+/// database connection. That avoids overall undesirable states like buildup
+/// of queries; instead of queueing them until the database is available,
+/// they return almost immediately with an error
+enum PoolState {
+    /// A connection pool, and all the servers for which we need to
+    /// establish fdw mappings when we call `setup` on the pool
+    Created(Arc<PoolInner>, Arc<Vec<ForeignServer>>),
+    /// The pool has been successfully set up
+    Ready(Arc<PoolInner>),
+    /// The pool has been disabled by setting its size to 0
+    Disabled,
+}
+
+#[derive(Clone)]
+pub struct ConnectionPool {
+    inner: Arc<TimedMutex<PoolState>>,
+    logger: Logger,
+    pub shard: Shard,
+    state_tracker: PoolStateTracker,
+}
+
+impl fmt::Debug for ConnectionPool {
+    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
+        f.debug_struct("ConnectionPool")
+            .field("shard", &self.shard)
+            .finish()
+    }
+}
+
+/// The name of the pool, mostly for logging, and what purpose it serves.
+/// The main pool will always be called `main`, and can be used for reading
+/// and writing. Replica pools can only be used for reading, and don't
+/// require any setup (migrations etc.)
+pub enum PoolName {
+    Main,
+    Replica(String),
+}
+
+impl PoolName {
+    fn as_str(&self) -> &str {
+        match self {
+            PoolName::Main => "main",
+            PoolName::Replica(name) => name,
+        }
+    }
+
+    fn is_replica(&self) -> bool {
+        match self {
+            PoolName::Main => false,
+            PoolName::Replica(_) => true,
+        }
+    }
+}
+
+#[derive(Clone)]
+struct PoolStateTracker {
+    available: Arc<AtomicBool>,
+}
+
+impl PoolStateTracker {
+    fn new() -> Self {
+        Self {
+            available: Arc::new(AtomicBool::new(true)),
+        }
+    }
+
+    fn mark_available(&self) {
+        self.available.store(true, Ordering::Relaxed);
+    }
+
+    fn mark_unavailable(&self) {
+        self.available.store(false, Ordering::Relaxed);
+    }
+
+    fn is_available(&self) -> bool {
+        self.available.load(Ordering::Relaxed)
+    }
+}
+
+impl ConnectionPool {
+    pub fn create(
+        shard_name: &str,
+        pool_name: PoolName,
+        postgres_url: String,
+        pool_size: u32,
+        fdw_pool_size: Option<u32>,
+        logger: &Logger,
+        registry: Arc<dyn MetricsRegistry>,
+        servers: Arc<Vec<ForeignServer>>,
+    ) -> ConnectionPool {
+        let state_tracker = PoolStateTracker::new();
+        let shard =
+            Shard::new(shard_name.to_string()).expect("shard_name is a valid name for a shard");
+        let pool_state = {
+            if pool_size == 0 {
+                PoolState::Disabled
+            } else {
+                let pool = PoolInner::create(
+                    shard.clone(),
+                    pool_name.as_str(),
+                    postgres_url,
+                    pool_size,
+                    fdw_pool_size,
+                    logger,
+                    registry,
+                    state_tracker.clone(),
+                );
+                if pool_name.is_replica() {
+                    PoolState::Ready(Arc::new(pool))
+                } else {
+                    PoolState::Created(Arc::new(pool), servers)
+                }
+            }
+        };
+        ConnectionPool {
+            inner: Arc::new(TimedMutex::new(pool_state, format!("pool-{}", shard_name))),
+            logger: logger.clone(),
+            shard,
+            state_tracker,
+        }
+    }
+
+    /// This is only used for `graphman` to ensure it doesn't run migrations
+    /// or other setup steps
+    pub fn skip_setup(&self) {
+        let mut guard = self.inner.lock(&self.logger);
+        match &*guard {
+            PoolState::Created(pool, _) => *guard = PoolState::Ready(pool.clone()),
+            PoolState::Ready(_) | PoolState::Disabled => { /* nothing to do */ }
+        }
+    }
+
+    /// Return a pool that is ready, i.e., connected to the database. If the
+    /// pool has not been set up yet, call `setup`. If there are any errors
+    /// or the pool is marked as unavailable, return
+    /// `StoreError::DatabaseUnavailable`
+    fn get_ready(&self) -> Result<Arc<PoolInner>, StoreError> {
+        let mut guard = self.inner.lock(&self.logger);
+        if !self.state_tracker.is_available() && !ENV_VARS.store.connection_try_always {
+            // We know that trying to use this pool is pointless since the
+            // database is not available, and will only lead to other
+            // operations having to wait until the connection timeout is
+            // reached. `TRY_ALWAYS` allows users to force us to try
+            // regardless.
+            return Err(StoreError::DatabaseUnavailable);
+        }
+
+        match &*guard {
+            PoolState::Created(pool, servers) => {
+                pool.setup(servers.clone())?;
+                let pool2 = pool.clone();
+                *guard = PoolState::Ready(pool.clone());
+                self.state_tracker.mark_available();
+                Ok(pool2)
+            }
+            PoolState::Ready(pool) => Ok(pool.clone()),
+            PoolState::Disabled => Err(StoreError::DatabaseDisabled),
+        }
+    }
+
+    /// Execute a closure with a connection to the database.
+    ///
+    /// # API
+    ///   The API of using a closure to bound the usage of the connection serves several
+    ///   purposes:
+    ///
+    ///   * Moves blocking database access out of the `Future::poll`. Within
+    ///     `Future::poll` (which includes all `async` methods) it is illegal to
+    ///     perform a blocking operation. This includes all accesses to the
+    ///     database, acquiring of locks, etc. Calling a blocking operation can
+    ///     cause problems with `Future` combinators (including but not limited
+    ///     to select, timeout, and FuturesUnordered) and problems with
+    ///     executors/runtimes. This method moves the database work onto another
+    ///     thread in a way which does not block `Future::poll`.
+    ///
+    ///   * Limit the total number of connections. Because the supplied closure
+    ///     takes a reference, we know the scope of the usage of all entity
+    ///     connections and can limit their use in a non-blocking way.
+    ///
+    /// # Cancellation
+    ///   The normal pattern for futures in Rust is drop to cancel. Once we
+    ///   spawn the database work in a thread though, this expectation no longer
+    ///   holds because the spawned task is the independent of this future. So,
+    ///   this method provides a cancel token which indicates that the `Future`
+    ///   has been dropped. This isn't *quite* as good as drop on cancel,
+    ///   because a drop on cancel can do things like cancel http requests that
+    ///   are in flight, but checking for cancel periodically is a significant
+    ///   improvement.
+    ///
+    ///   The implementation of the supplied closure should check for cancel
+    ///   between every operation that is potentially blocking. This includes
+    ///   any method which may interact with the database. The check can be
+    ///   conveniently written as `token.check_cancel()?;`. It is low overhead
+    ///   to check for cancel, so when in doubt it is better to have too many
+    ///   checks than too few.
+    ///
+    /// # Panics:
+    ///   * This task will panic if the supplied closure panics
+    ///   * This task will panic if the supplied closure returns Err(Cancelled)
+    ///     when the supplied cancel token is not cancelled.
+    pub(crate) async fn with_conn<T: Send + 'static>(
+        &self,
+        f: impl 'static
+            + Send
+            + FnOnce(
+                &PooledConnection<ConnectionManager<PgConnection>>,
+                &CancelHandle,
+            ) -> Result<T, CancelableError<StoreError>>,
+    ) -> Result<T, StoreError> {
+        let pool = self.get_ready()?;
+        pool.with_conn(f).await
+    }
+
+    pub fn get(&self) -> Result<PooledConnection<ConnectionManager<PgConnection>>, StoreError> {
+        self.get_ready()?.get()
+    }
+
+    /// Get a connection from the pool for foreign data wrapper access;
+    /// since that pool can be very contended, periodically log that we are
+    /// still waiting for a connection
+    ///
+    /// The `timeout` is called every time we time out waiting for a
+    /// connection. If `timeout` returns `true`, `get_fdw` returns with that
+    /// error, otherwise we try again to get a connection.
+    pub fn get_fdw<F>(
+        &self,
+        logger: &Logger,
+        timeout: F,
+    ) -> Result<PooledConnection<ConnectionManager<PgConnection>>, StoreError>
+    where
+        F: FnMut() -> bool,
+    {
+        self.get_ready()?.get_fdw(logger, timeout)
+    }
+
+    pub fn connection_detail(&self) -> Result<ForeignServer, StoreError> {
+        let pool = self.get_ready()?;
+        ForeignServer::new(pool.shard.clone(), &pool.postgres_url).map_err(|e| e.into())
+    }
+
+    /// Check that we can connect to the database
+    pub fn check(&self) -> bool {
+        true
+    }
+
+    /// Setup the database for this pool. This includes configuring foreign
+    /// data wrappers for cross-shard communication, and running any pending
+    /// schema migrations for this database.
+    ///
+    /// # Panics
+    ///
+    /// If any errors happen during the migration, the process panics
+    pub async fn setup(&self) {
+        let pool = self.clone();
+        graph::spawn_blocking_allow_panic(move || {
+            pool.get_ready().ok();
+        })
+        .await
+        // propagate panics
+        .unwrap();
+    }
+
+    pub(crate) async fn query_permit(
+        &self,
+    ) -> Result<tokio::sync::OwnedSemaphorePermit, StoreError> {
+        let pool = match &*self.inner.lock(&self.logger) {
+            PoolState::Created(pool, _) | PoolState::Ready(pool) => pool.clone(),
+            PoolState::Disabled => {
+                return Err(StoreError::DatabaseDisabled);
+            }
+        };
+        Ok(pool.query_permit().await)
+    }
+
+    pub(crate) fn wait_stats(&self) -> Result<PoolWaitStats, StoreError> {
+        match &*self.inner.lock(&self.logger) {
+            PoolState::Created(pool, _) | PoolState::Ready(pool) => Ok(pool.wait_stats.clone()),
+            PoolState::Disabled => Err(StoreError::DatabaseDisabled),
+        }
+    }
+
+    /// Mirror key tables from the primary into our own schema. We do this
+    /// by manually inserting or deleting rows through comparing it with the
+    /// table on the primary. Once we drop support for PG 9.6, we can
+    /// simplify all this and achieve the same result with logical
+    /// replication.
+    pub(crate) async fn mirror_primary_tables(&self) -> Result<(), StoreError> {
+        let pool = self.get_ready()?;
+        pool.mirror_primary_tables().await
+    }
+}
+
+fn brief_error_msg(error: &dyn std::error::Error) -> String {
+    // For 'Connection refused' errors, Postgres includes the IP and
+    // port number in the error message. We want to suppress that and
+    // only use the first line from the error message. For more detailed
+    // analysis, 'Connection refused' manifests as a
+    // `ConnectionError(BadConnection("could not connect to server:
+    // Connection refused.."))`
+    error
+        .to_string()
+        .split('\n')
+        .next()
+        .unwrap_or("no error details provided")
+        .to_string()
+}
+
+#[derive(Clone)]
+struct ErrorHandler {
+    logger: Logger,
+    counter: Counter,
+    state_tracker: PoolStateTracker,
+}
+
+impl ErrorHandler {
+    fn new(logger: Logger, counter: Counter, state_tracker: PoolStateTracker) -> Self {
+        Self {
+            logger,
+            counter,
+            state_tracker,
+        }
+    }
+}
+impl std::fmt::Debug for ErrorHandler {
+    fn fmt(&self, _f: &mut fmt::Formatter) -> fmt::Result {
+        fmt::Result::Ok(())
+    }
+}
+
+impl r2d2::HandleError<r2d2::Error> for ErrorHandler {
+    fn handle_error(&self, error: r2d2::Error) {
+        let msg = brief_error_msg(&error);
+
+        // Don't count canceling statements for timeouts etc. as a
+        // connection error. Unfortunately, we only have the textual error
+        // and need to infer whether the error indicates that the database
+        // is down or if something else happened. When querying a replica,
+        // these messages indicate that a query was canceled because it
+        // conflicted with replication, but does not indicate that there is
+        // a problem with the database itself.
+        //
+        // This check will break if users run Postgres (or even graph-node)
+        // in a locale other than English. In that case, their database will
+        // be marked as unavailable even though it is perfectly fine.
+        if msg.contains("canceling statement")
+            || msg.contains("no connection to the server")
+            || msg.contains("terminating connection due to conflict with recovery")
+        {
+            return;
+        }
+
+        self.counter.inc();
+        if self.state_tracker.is_available() {
+            error!(self.logger, "Postgres connection error"; "error" => msg);
+        }
+        self.state_tracker.mark_unavailable();
+    }
+}
+
+#[derive(Clone)]
+struct EventHandler {
+    logger: Logger,
+    count_gauge: Gauge,
+    wait_gauge: Gauge,
+    size_gauge: Gauge,
+    wait_stats: PoolWaitStats,
+    state_tracker: PoolStateTracker,
+}
+
+impl EventHandler {
+    fn new(
+        logger: Logger,
+        registry: Arc<dyn MetricsRegistry>,
+        wait_stats: PoolWaitStats,
+        const_labels: HashMap<String, String>,
+        state_tracker: PoolStateTracker,
+    ) -> Self {
+        let count_gauge = registry
+            .global_gauge(
+                "store_connection_checkout_count",
+                "The number of Postgres connections currently checked out",
+                const_labels.clone(),
+            )
+            .expect("failed to create `store_connection_checkout_count` counter");
+        let wait_gauge = registry
+            .global_gauge(
+                "store_connection_wait_time_ms",
+                "Average connection wait time",
+                const_labels.clone(),
+            )
+            .expect("failed to create `store_connection_wait_time_ms` counter");
+        let size_gauge = registry
+            .global_gauge(
+                "store_connection_pool_size_count",
+                "Overall size of the connection pool",
+                const_labels,
+            )
+            .expect("failed to create `store_connection_pool_size_count` counter");
+        EventHandler {
+            logger,
+            count_gauge,
+            wait_gauge,
+            wait_stats,
+            size_gauge,
+            state_tracker,
+        }
+    }
+
+    fn add_conn_wait_time(&self, duration: Duration) {
+        self.wait_stats
+            .write()
+            .unwrap()
+            .add_and_register(duration, &self.wait_gauge);
+    }
+}
+
+impl std::fmt::Debug for EventHandler {
+    fn fmt(&self, _f: &mut fmt::Formatter) -> fmt::Result {
+        fmt::Result::Ok(())
+    }
+}
+
+impl HandleEvent for EventHandler {
+    fn handle_acquire(&self, _: e::AcquireEvent) {
+        self.size_gauge.inc();
+        self.state_tracker.mark_available();
+    }
+
+    fn handle_release(&self, _: e::ReleaseEvent) {
+        self.size_gauge.dec();
+    }
+
+    fn handle_checkout(&self, event: e::CheckoutEvent) {
+        self.count_gauge.inc();
+        self.add_conn_wait_time(event.duration());
+        self.state_tracker.mark_available();
+    }
+
+    fn handle_timeout(&self, event: e::TimeoutEvent) {
+        self.add_conn_wait_time(event.timeout());
+        if self.state_tracker.is_available() {
+            error!(self.logger, "Connection checkout timed out";
+               "wait_ms" => event.timeout().as_millis()
+            )
+        }
+        self.state_tracker.mark_unavailable();
+    }
+
+    fn handle_checkin(&self, _: e::CheckinEvent) {
+        self.count_gauge.dec();
+    }
+}
+
+#[derive(Clone)]
+pub struct PoolInner {
+    logger: Logger,
+    shard: Shard,
+    pool: Pool<ConnectionManager<PgConnection>>,
+    // A separate pool for connections that will use foreign data wrappers.
+    // Once such a connection accesses a foreign table, Postgres keeps a
+    // connection to the foreign server until the connection is closed.
+    // Normal pooled connections live quite long (up to 10 minutes) and can
+    // therefore keep a lot of connections into foreign databases open. We
+    // mitigate this by using a separate small pool with a much shorter
+    // connection lifetime. Starting with postgres_fdw 1.1 in Postgres 14,
+    // this will no longer be needed since it will then be possible to
+    // explicitly close connections to foreign servers when a connection is
+    // returned to the pool.
+    fdw_pool: Option<Pool<ConnectionManager<PgConnection>>>,
+    limiter: Arc<Semaphore>,
+    postgres_url: String,
+    pub(crate) wait_stats: PoolWaitStats,
+
+    // Limits the number of graphql queries that may execute concurrently. Since one graphql query
+    // may require multiple DB queries, it is useful to organize the queue at the graphql level so
+    // that waiting queries consume few resources. Still this is placed here because the semaphore
+    // is sized acording to the DB connection pool size.
+    query_semaphore: Arc<tokio::sync::Semaphore>,
+    semaphore_wait_stats: Arc<RwLock<MovingStats>>,
+    semaphore_wait_gauge: Box<Gauge>,
+}
+
+impl PoolInner {
+    fn create(
+        shard: Shard,
+        pool_name: &str,
+        postgres_url: String,
+        pool_size: u32,
+        fdw_pool_size: Option<u32>,
+        logger: &Logger,
+        registry: Arc<dyn MetricsRegistry>,
+        state_tracker: PoolStateTracker,
+    ) -> PoolInner {
+        let logger_store = logger.new(o!("component" => "Store"));
+        let logger_pool = logger.new(o!("component" => "ConnectionPool"));
+        let const_labels = {
+            let mut map = HashMap::new();
+            map.insert("pool".to_owned(), pool_name.to_owned());
+            map.insert("shard".to_string(), shard.to_string());
+            map
+        };
+        let error_counter = registry
+            .global_counter(
+                "store_connection_error_count",
+                "The number of Postgres connections errors",
+                const_labels.clone(),
+            )
+            .expect("failed to create `store_connection_error_count` counter");
+        let error_handler = Box::new(ErrorHandler::new(
+            logger_pool.clone(),
+            error_counter,
+            state_tracker.clone(),
+        ));
+        let wait_stats = Arc::new(RwLock::new(MovingStats::default()));
+        let event_handler = Box::new(EventHandler::new(
+            logger_pool.clone(),
+            registry.cheap_clone(),
+            wait_stats.clone(),
+            const_labels.clone(),
+            state_tracker,
+        ));
+
+        // Connect to Postgres
+        let conn_manager = ConnectionManager::new(postgres_url.clone());
+        let min_idle = ENV_VARS.store.connection_min_idle.filter(|min_idle| {
+            if *min_idle <= pool_size {
+                true
+            } else {
+                warn!(
+                    logger_pool,
+                    "Configuration error: min idle {} exceeds pool size {}, ignoring min idle",
+                    min_idle,
+                    pool_size
+                );
+                false
+            }
+        });
+        let builder: Builder<ConnectionManager<PgConnection>> = Pool::builder()
+            .error_handler(error_handler.clone())
+            .event_handler(event_handler.clone())
+            .connection_timeout(ENV_VARS.store.connection_timeout)
+            .max_size(pool_size)
+            .min_idle(min_idle)
+            .idle_timeout(Some(ENV_VARS.store.connection_idle_timeout));
+        let pool = builder.build_unchecked(conn_manager);
+        let fdw_pool = fdw_pool_size.map(|pool_size| {
+            let conn_manager = ConnectionManager::new(postgres_url.clone());
+            let builder: Builder<ConnectionManager<PgConnection>> = Pool::builder()
+                .error_handler(error_handler)
+                .event_handler(event_handler)
+                .connection_timeout(ENV_VARS.store.connection_timeout)
+                .max_size(pool_size)
+                .min_idle(Some(1))
+                .idle_timeout(Some(FDW_IDLE_TIMEOUT));
+            builder.build_unchecked(conn_manager)
+        });
+
+        let limiter = Arc::new(Semaphore::new(pool_size as usize));
+        info!(logger_store, "Pool successfully connected to Postgres");
+
+        let semaphore_wait_gauge = registry
+            .new_gauge(
+                "query_semaphore_wait_ms",
+                "Moving average of time spent on waiting for postgres query semaphore",
+                const_labels,
+            )
+            .expect("failed to create `query_effort_ms` counter");
+        let max_concurrent_queries = pool_size as usize + ENV_VARS.store.extra_query_permits;
+        let query_semaphore = Arc::new(tokio::sync::Semaphore::new(max_concurrent_queries));
+        PoolInner {
+            logger: logger_pool,
+            shard,
+            postgres_url,
+            pool,
+            fdw_pool,
+            limiter,
+            wait_stats,
+            semaphore_wait_stats: Arc::new(RwLock::new(MovingStats::default())),
+            query_semaphore,
+            semaphore_wait_gauge,
+        }
+    }
+
+    /// Execute a closure with a connection to the database.
+    ///
+    /// # API
+    ///   The API of using a closure to bound the usage of the connection serves several
+    ///   purposes:
+    ///
+    ///   * Moves blocking database access out of the `Future::poll`. Within
+    ///     `Future::poll` (which includes all `async` methods) it is illegal to
+    ///     perform a blocking operation. This includes all accesses to the
+    ///     database, acquiring of locks, etc. Calling a blocking operation can
+    ///     cause problems with `Future` combinators (including but not limited
+    ///     to select, timeout, and FuturesUnordered) and problems with
+    ///     executors/runtimes. This method moves the database work onto another
+    ///     thread in a way which does not block `Future::poll`.
+    ///
+    ///   * Limit the total number of connections. Because the supplied closure
+    ///     takes a reference, we know the scope of the usage of all entity
+    ///     connections and can limit their use in a non-blocking way.
+    ///
+    /// # Cancellation
+    ///   The normal pattern for futures in Rust is drop to cancel. Once we
+    ///   spawn the database work in a thread though, this expectation no longer
+    ///   holds because the spawned task is the independent of this future. So,
+    ///   this method provides a cancel token which indicates that the `Future`
+    ///   has been dropped. This isn't *quite* as good as drop on cancel,
+    ///   because a drop on cancel can do things like cancel http requests that
+    ///   are in flight, but checking for cancel periodically is a significant
+    ///   improvement.
+    ///
+    ///   The implementation of the supplied closure should check for cancel
+    ///   between every operation that is potentially blocking. This includes
+    ///   any method which may interact with the database. The check can be
+    ///   conveniently written as `token.check_cancel()?;`. It is low overhead
+    ///   to check for cancel, so when in doubt it is better to have too many
+    ///   checks than too few.
+    ///
+    /// # Panics:
+    ///   * This task will panic if the supplied closure panics
+    ///   * This task will panic if the supplied closure returns Err(Cancelled)
+    ///     when the supplied cancel token is not cancelled.
+    pub(crate) async fn with_conn<T: Send + 'static>(
+        &self,
+        f: impl 'static
+            + Send
+            + FnOnce(
+                &PooledConnection<ConnectionManager<PgConnection>>,
+                &CancelHandle,
+            ) -> Result<T, CancelableError<StoreError>>,
+    ) -> Result<T, StoreError> {
+        let _permit = self.limiter.acquire().await;
+        let pool = self.clone();
+
+        let cancel_guard = CancelGuard::new();
+        let cancel_handle = cancel_guard.handle();
+
+        let result = graph::spawn_blocking_allow_panic(move || {
+            // It is possible time has passed between scheduling on the
+            // threadpool and being executed. Time to check for cancel.
+            cancel_handle.check_cancel()?;
+
+            // A failure to establish a connection is propagated as though the
+            // closure failed.
+            let conn = pool
+                .get()
+                .map_err(|_| CancelableError::Error(StoreError::DatabaseUnavailable))?;
+
+            // It is possible time has passed while establishing a connection.
+            // Time to check for cancel.
+            cancel_handle.check_cancel()?;
+
+            f(&conn, &cancel_handle)
+        })
+        .await
+        .unwrap(); // Propagate panics, though there shouldn't be any.
+
+        drop(cancel_guard);
+
+        // Finding cancel isn't technically unreachable, since there is nothing
+        // stopping the supplied closure from returning Canceled even if the
+        // supplied handle wasn't canceled. That would be very unexpected, the
+        // doc comment for this function says we will panic in this scenario.
+        match result {
+            Ok(t) => Ok(t),
+            Err(CancelableError::Error(e)) => Err(e),
+            Err(CancelableError::Cancel) => panic!("The closure supplied to with_entity_conn must not return Err(Canceled) unless the supplied token was canceled."),
+        }
+    }
+
+    pub fn get(&self) -> Result<PooledConnection<ConnectionManager<PgConnection>>, StoreError> {
+        self.pool.get().map_err(|_| StoreError::DatabaseUnavailable)
+    }
+
+    pub fn get_with_timeout_warning(
+        &self,
+        logger: &Logger,
+    ) -> Result<PooledConnection<ConnectionManager<PgConnection>>, StoreError> {
+        loop {
+            match self.pool.get_timeout(ENV_VARS.store.connection_timeout) {
+                Ok(conn) => return Ok(conn),
+                Err(e) => error!(logger, "Error checking out connection, retrying";
+                   "error" => brief_error_msg(&e),
+                ),
+            }
+        }
+    }
+
+    /// Get a connection from the pool for foreign data wrapper access;
+    /// since that pool can be very contended, periodically log that we are
+    /// still waiting for a connection
+    ///
+    /// The `timeout` is called every time we time out waiting for a
+    /// connection. If `timeout` returns `true`, `get_fdw` returns with that
+    /// error, otherwise we try again to get a connection.
+    pub fn get_fdw<F>(
+        &self,
+        logger: &Logger,
+        mut timeout: F,
+    ) -> Result<PooledConnection<ConnectionManager<PgConnection>>, StoreError>
+    where
+        F: FnMut() -> bool,
+    {
+        let pool = match &self.fdw_pool {
+            Some(pool) => pool,
+            None => {
+                const MSG: &str =
+                    "internal error: trying to get fdw connection on a pool that doesn't have any";
+                error!(logger, "{}", MSG);
+                return Err(constraint_violation!(MSG));
+            }
+        };
+        loop {
+            match pool.get() {
+                Ok(conn) => return Ok(conn),
+                Err(e) => {
+                    if timeout() {
+                        return Err(e.into());
+                    }
+                }
+            }
+        }
+    }
+
+    pub fn connection_detail(&self) -> Result<ForeignServer, StoreError> {
+        ForeignServer::new(self.shard.clone(), &self.postgres_url).map_err(|e| e.into())
+    }
+
+    /// Check that we can connect to the database
+    pub fn check(&self) -> bool {
+        self.pool
+            .get()
+            .ok()
+            .map(|conn| sql_query("select 1").execute(&conn).is_ok())
+            .unwrap_or(false)
+    }
+
+    /// Setup the database for this pool. This includes configuring foreign
+    /// data wrappers for cross-shard communication, and running any pending
+    /// schema migrations for this database.
+    ///
+    /// Returns `StoreError::DatabaseUnavailable` if we can't connect to the
+    /// database. Any other error causes a panic.
+    ///
+    /// # Panics
+    ///
+    /// If any errors happen during the migration, the process panics
+    pub fn setup(&self, servers: Arc<Vec<ForeignServer>>) -> Result<(), StoreError> {
+        fn die(logger: &Logger, msg: &'static str, err: &dyn std::fmt::Display) -> ! {
+            crit!(logger, "{}", msg; "error" => format!("{:#}", err));
+            panic!("{}: {}", msg, err);
+        }
+
+        let pool = self.clone();
+        let conn = self.get().map_err(|_| StoreError::DatabaseUnavailable)?;
+
+        let start = Instant::now();
+        advisory_lock::lock_migration(&conn)
+            .unwrap_or_else(|err| die(&pool.logger, "failed to get migration lock", &err));
+        let result = pool
+            .configure_fdw(servers.as_ref())
+            .and_then(|()| migrate_schema(&pool.logger, &conn))
+            .and_then(|()| pool.map_primary())
+            .and_then(|()| pool.map_metadata(servers.as_ref()));
+        debug!(&pool.logger, "Release migration lock");
+        advisory_lock::unlock_migration(&conn).unwrap_or_else(|err| {
+            die(&pool.logger, "failed to release migration lock", &err);
+        });
+        result.unwrap_or_else(|err| die(&pool.logger, "migrations failed", &err));
+        debug!(&pool.logger, "Setup finished"; "setup_time_s" => start.elapsed().as_secs());
+        Ok(())
+    }
+
+    pub(crate) async fn query_permit(&self) -> tokio::sync::OwnedSemaphorePermit {
+        let start = Instant::now();
+        let permit = self.query_semaphore.cheap_clone().acquire_owned().await;
+        self.semaphore_wait_stats
+            .write()
+            .unwrap()
+            .add_and_register(start.elapsed(), &self.semaphore_wait_gauge);
+        permit.unwrap()
+    }
+
+    fn configure_fdw(&self, servers: &[ForeignServer]) -> Result<(), StoreError> {
+        info!(&self.logger, "Setting up fdw");
+        let conn = self.get()?;
+        conn.batch_execute("create extension if not exists postgres_fdw")?;
+        conn.transaction(|| {
+            let current_servers: Vec<String> = crate::catalog::current_servers(&conn)?;
+            for server in servers.iter().filter(|server| server.shard != self.shard) {
+                if current_servers.contains(&server.name) {
+                    server.update(&conn)?;
+                } else {
+                    server.create(&conn)?;
+                }
+            }
+            Ok(())
+        })
+    }
+
+    /// Map key tables from the primary into our local schema. If we are the
+    /// primary, set them up as views.
+    ///
+    /// We recreate this mapping on every server start so that migrations that
+    /// change one of the mapped tables actually show up in the imported tables
+    fn map_primary(&self) -> Result<(), StoreError> {
+        info!(&self.logger, "Mapping primary");
+        let conn = self.get()?;
+        conn.transaction(|| ForeignServer::map_primary(&conn, &self.shard))
+    }
+
+    /// Copy the data from key tables in the primary into our local schema
+    /// so it can be used as a fallback when the primary goes down
+    pub async fn mirror_primary_tables(&self) -> Result<(), StoreError> {
+        if self.shard == *PRIMARY_SHARD {
+            return Ok(());
+        }
+        self.with_conn(|conn, handle| {
+            conn.transaction(|| {
+                primary::Mirror::refresh_tables(conn, handle).map_err(CancelableError::from)
+            })
+        })
+        .await
+    }
+
+    // Map some tables from the `subgraphs` metadata schema from foreign
+    // servers to ourselves. The mapping is recreated on every server start
+    // so that we pick up possible schema changes in the mappings
+    fn map_metadata(&self, servers: &[ForeignServer]) -> Result<(), StoreError> {
+        info!(&self.logger, "Mapping metadata");
+        let conn = self.get()?;
+        conn.transaction(|| {
+            for server in servers.iter().filter(|server| server.shard != self.shard) {
+                server.map_metadata(&conn)?;
+            }
+            Ok(())
+        })
+    }
+}
+
+embed_migrations!("./migrations");
+
+/// Run all schema migrations.
+///
+/// When multiple `graph-node` processes start up at the same time, we ensure
+/// that they do not run migrations in parallel by using `blocking_conn` to
+/// serialize them. The `conn` is used to run the actual migration.
+fn migrate_schema(logger: &Logger, conn: &PgConnection) -> Result<(), StoreError> {
+    // Collect migration logging output
+    let mut output = vec![];
+
+    info!(logger, "Running migrations");
+    let result = embedded_migrations::run_with_output(conn, &mut output);
+    info!(logger, "Migrations finished");
+
+    // If there was any migration output, log it now
+    let msg = String::from_utf8(output).unwrap_or_else(|_| String::from("<unreadable>"));
+    let msg = msg.trim();
+    let has_output = !msg.is_empty();
+    if has_output {
+        let msg = msg.replace('\n', " ");
+        if let Err(e) = result {
+            error!(logger, "Postgres migration error"; "output" => msg);
+            return Err(StoreError::Unknown(e.into()));
+        } else {
+            debug!(logger, "Postgres migration output"; "output" => msg);
+        }
+    }
+
+    if has_output {
+        // We take getting output as a signal that a migration was actually
+        // run, which is not easy to tell from the Diesel API, and reset the
+        // query statistics since a schema change makes them not all that
+        // useful. An error here is not serious and can be ignored.
+        conn.batch_execute("select pg_stat_statements_reset()").ok();
+    }
+
+    Ok(())
+}
diff --git a/store/postgres/src/copy.rs b/store/postgres/src/copy.rs
new file mode 100644
index 0000000..6454e8c
--- /dev/null
+++ b/store/postgres/src/copy.rs
@@ -0,0 +1,827 @@
+//! This module if repsonsible for copying the data of an existing subgraph
+//! `src` to a new subgraph `dst`. The copy is done in batches so that
+//! copying does not cause long-running transactions since they lead to
+//! table bloat in the rest of the system.
+//!
+//! The `TARGET_DURATION` defines how long any individual copy operation
+//! should take at most, and the code adapts the number of entities that are
+//! copied in each batch to be close to that time span.
+//!
+//! The progress of copy operations is recorded in the tables
+//! `subgraphs.copy_state` and `subgraphs.copy_table_state` so that a copy
+//! operation can resume after an interruption, for example, because
+//! `graph-node` was restarted while the copy was running.
+use std::{
+    convert::TryFrom,
+    io::Write,
+    sync::Arc,
+    time::{Duration, Instant},
+};
+
+use diesel::{
+    dsl::sql,
+    insert_into,
+    pg::Pg,
+    r2d2::{ConnectionManager, PooledConnection},
+    select,
+    serialize::Output,
+    sql_query,
+    sql_types::{BigInt, Integer},
+    types::{FromSql, ToSql},
+    update, Connection as _, ExpressionMethods, OptionalExtension, PgConnection, QueryDsl,
+    RunQueryDsl,
+};
+use graph::{
+    components::store::EntityType,
+    constraint_violation,
+    prelude::{info, o, warn, BlockNumber, BlockPtr, Logger, StoreError},
+};
+
+use crate::{
+    advisory_lock, catalog,
+    dynds::DataSourcesTable,
+    primary::{DeploymentId, Site},
+};
+use crate::{connection_pool::ConnectionPool, relational::Layout};
+use crate::{relational::Table, relational_queries as rq};
+
+/// The initial batch size for tables that do not have an array column
+const INITIAL_BATCH_SIZE: i64 = 10_000;
+/// The initial batch size for tables that do have an array column; those
+/// arrays can be large and large arrays will slow down copying a lot. We
+/// therefore tread lightly in that case
+const INITIAL_BATCH_SIZE_LIST: i64 = 100;
+const TARGET_DURATION: Duration = Duration::from_secs(5 * 60);
+const LOG_INTERVAL: Duration = Duration::from_secs(3 * 60);
+
+/// If replicas are lagging by more than this, the copying code will pause
+/// for a while to allow replicas to catch up
+const MAX_REPLICATION_LAG: Duration = Duration::from_secs(60);
+/// If replicas need to catch up, do not resume copying until the lag is
+/// less than this
+const ACCEPTABLE_REPLICATION_LAG: Duration = Duration::from_secs(30);
+/// When replicas are lagging too much, sleep for this long before checking
+/// the lag again
+const REPLICATION_SLEEP: Duration = Duration::from_secs(10);
+
+table! {
+    subgraphs.copy_state(dst) {
+        // deployment_schemas.id
+        src -> Integer,
+        // deployment_schemas.id
+        dst -> Integer,
+        target_block_hash -> Binary,
+        target_block_number -> Integer,
+        started_at -> Timestamptz,
+        finished_at -> Nullable<Timestamptz>,
+        cancelled_at -> Nullable<Timestamptz>,
+    }
+}
+
+table! {
+    subgraphs.copy_table_state {
+        id -> Integer,
+        entity_type -> Text,
+        // references copy_state.dst
+        dst -> Integer,
+        next_vid -> BigInt,
+        target_vid -> BigInt,
+        batch_size -> BigInt,
+        started_at -> Timestamptz,
+        finished_at -> Nullable<Timestamptz>,
+        // Measures just the time we spent working, not any wait time for
+        // connections or the like
+        duration_ms -> BigInt,
+    }
+}
+
+// This is the same as primary::active_copies, but mapped into each shard
+table! {
+    primary_public.active_copies(dst) {
+        src -> Integer,
+        dst -> Integer,
+        cancelled_at -> Nullable<Date>,
+    }
+}
+
+#[derive(Copy, Clone, PartialEq)]
+pub enum Status {
+    Finished,
+    Cancelled,
+}
+
+#[allow(dead_code)]
+struct CopyState {
+    src: Arc<Layout>,
+    dst: Arc<Layout>,
+    target_block: BlockPtr,
+    tables: Vec<TableState>,
+}
+
+impl CopyState {
+    fn new(
+        conn: &PgConnection,
+        src: Arc<Layout>,
+        dst: Arc<Layout>,
+        target_block: BlockPtr,
+    ) -> Result<CopyState, StoreError> {
+        use copy_state as cs;
+
+        let crosses_shards = dst.site.shard != src.site.shard;
+        if crosses_shards {
+            src.import_schema(conn)?;
+        }
+
+        let state = match cs::table
+            .filter(cs::dst.eq(dst.site.id))
+            .select((cs::src, cs::target_block_hash, cs::target_block_number))
+            .first::<(DeploymentId, Vec<u8>, BlockNumber)>(conn)
+            .optional()?
+        {
+            Some((src_id, hash, number)) => {
+                let stored_target_block = BlockPtr::from((hash, number));
+                if stored_target_block != target_block {
+                    return Err(constraint_violation!(
+                        "CopyState {} for copying {} to {} has incompatible block pointer {} instead of {}",
+                        dst.site.id,
+                        src.site.deployment,
+                        dst.site.deployment,
+                        stored_target_block,
+                        target_block));
+                }
+                if src_id != src.site.id {
+                    return Err(constraint_violation!(
+                        "CopyState {} for copying {} to {} has incompatible source {} instead of {}",
+                        dst.site.id,
+                        src.site.deployment,
+                        dst.site.deployment,
+                        src_id,
+                        src.site.id
+                    ));
+                }
+                Self::load(conn, src, dst, target_block)
+            }
+            None => Self::create(conn, src, dst, target_block),
+        }?;
+
+        Ok(state)
+    }
+
+    fn load(
+        conn: &PgConnection,
+        src: Arc<Layout>,
+        dst: Arc<Layout>,
+        target_block: BlockPtr,
+    ) -> Result<CopyState, StoreError> {
+        let tables = TableState::load(conn, src.as_ref(), dst.as_ref())?;
+        Ok(CopyState {
+            src,
+            dst,
+            target_block,
+            tables,
+        })
+    }
+
+    fn create(
+        conn: &PgConnection,
+        src: Arc<Layout>,
+        dst: Arc<Layout>,
+        target_block: BlockPtr,
+    ) -> Result<CopyState, StoreError> {
+        use copy_state as cs;
+        use copy_table_state as cts;
+
+        insert_into(cs::table)
+            .values((
+                cs::src.eq(src.site.id),
+                cs::dst.eq(dst.site.id),
+                cs::target_block_hash.eq(target_block.hash_slice()),
+                cs::target_block_number.eq(target_block.number),
+            ))
+            .execute(conn)?;
+
+        let mut tables: Vec<_> = dst
+            .tables
+            .values()
+            .filter_map(|dst_table| {
+                src.table_for_entity(&dst_table.object)
+                    .ok()
+                    .map(|src_table| {
+                        TableState::init(
+                            conn,
+                            dst.site.clone(),
+                            src_table.clone(),
+                            dst_table.clone(),
+                            &target_block,
+                        )
+                    })
+            })
+            .collect::<Result<_, _>>()?;
+        tables.sort_by_key(|table| table.batch.dst.object.to_string());
+
+        let values = tables
+            .iter()
+            .map(|table| {
+                (
+                    cts::entity_type.eq(table.batch.dst.object.as_str()),
+                    cts::dst.eq(dst.site.id),
+                    cts::next_vid.eq(table.batch.next_vid),
+                    cts::target_vid.eq(table.batch.target_vid),
+                    cts::batch_size.eq(table.batch.batch_size.size),
+                )
+            })
+            .collect::<Vec<_>>();
+        insert_into(cts::table).values(values).execute(conn)?;
+
+        Ok(CopyState {
+            src,
+            dst,
+            target_block,
+            tables,
+        })
+    }
+
+    fn crosses_shards(&self) -> bool {
+        self.dst.site.shard != self.src.site.shard
+    }
+
+    fn finished(&self, conn: &PgConnection) -> Result<(), StoreError> {
+        use copy_state as cs;
+
+        update(cs::table.filter(cs::dst.eq(self.dst.site.id)))
+            .set(cs::finished_at.eq(sql("now()")))
+            .execute(conn)?;
+
+        // If we imported the schema for `src`, and no other in-progress
+        // copy is using it, get rid of it again
+        if self.crosses_shards() {
+            let has_active_copies = select(diesel::dsl::exists(
+                cs::table
+                    .filter(cs::src.eq(self.src.site.id))
+                    .filter(cs::finished_at.is_null()),
+            ))
+            .get_result::<bool>(conn)?;
+            if !has_active_copies {
+                // This is a foreign schema that nobody is using anymore,
+                // get rid of it. As a safety check (on top of the one that
+                // drop_foreign_schema does), see that we do not have
+                // metadata for `src`
+                if crate::deployment::exists(conn, &self.src.site)? {
+                    return Err(constraint_violation!(
+                        "we think we are copying {}[{}] across shards from {} to {}, but the \
+                        source subgraph is actually in this shard",
+                        self.src.site.deployment,
+                        self.src.site.id,
+                        self.src.site.shard,
+                        self.dst.site.shard
+                    ));
+                }
+                crate::catalog::drop_foreign_schema(conn, self.src.site.as_ref())?;
+            }
+        }
+        Ok(())
+    }
+}
+
+/// Track the desired size of a batch in such a way that doing the next
+/// batch gets close to TARGET_DURATION for the time it takes to copy one
+/// batch, but don't step up the size by more than 2x at once
+#[derive(Debug, Queryable)]
+pub(crate) struct AdaptiveBatchSize {
+    size: i64,
+}
+
+impl AdaptiveBatchSize {
+    pub fn new(table: &Table) -> Self {
+        let size = if table.columns.iter().any(|col| col.is_list()) {
+            INITIAL_BATCH_SIZE_LIST
+        } else {
+            INITIAL_BATCH_SIZE
+        };
+
+        Self { size }
+    }
+
+    // adjust batch size by trying to extrapolate in such a way that we
+    // get close to TARGET_DURATION for the time it takes to copy one
+    // batch, but don't step up batch_size by more than 2x at once
+    pub fn adapt(&mut self, duration: Duration) {
+        // Avoid division by zero
+        let duration = duration.as_millis().max(1);
+        let new_batch_size =
+            self.size as f64 * TARGET_DURATION.as_millis() as f64 / duration as f64;
+        self.size = (2 * self.size).min(new_batch_size.round() as i64);
+    }
+}
+
+impl ToSql<BigInt, Pg> for AdaptiveBatchSize {
+    fn to_sql<W: Write>(&self, out: &mut Output<W, Pg>) -> diesel::serialize::Result {
+        <i64 as ToSql<BigInt, Pg>>::to_sql(&self.size, out)
+    }
+}
+
+impl FromSql<BigInt, Pg> for AdaptiveBatchSize {
+    fn from_sql(bytes: Option<&[u8]>) -> diesel::deserialize::Result<Self> {
+        let size = <i64 as FromSql<BigInt, Pg>>::from_sql(bytes)?;
+        Ok(AdaptiveBatchSize { size })
+    }
+}
+
+/// A helper to copy entities from one table to another in batches that are
+/// small enough to not interfere with the rest of the operations happening
+/// in the database. The `src` and `dst` table must have the same structure
+/// so that we can copy rows from one to the other with very little
+/// transformation. See `CopyEntityBatchQuery` for the details of what
+/// exactly that means
+pub(crate) struct BatchCopy {
+    src: Arc<Table>,
+    dst: Arc<Table>,
+    /// The `vid` of the next entity version that we will copy
+    next_vid: i64,
+    /// The last `vid` that should be copied
+    target_vid: i64,
+    batch_size: AdaptiveBatchSize,
+}
+
+impl BatchCopy {
+    pub fn new(src: Arc<Table>, dst: Arc<Table>, first_vid: i64, last_vid: i64) -> Self {
+        let batch_size = AdaptiveBatchSize::new(&dst);
+
+        Self {
+            src,
+            dst,
+            next_vid: first_vid,
+            target_vid: last_vid,
+            batch_size,
+        }
+    }
+
+    /// Copy one batch of entities and update internal state so that the
+    /// next call to `run` will copy the next batch
+    pub fn run(&mut self, conn: &PgConnection) -> Result<Duration, StoreError> {
+        let start = Instant::now();
+
+        // Copy all versions with next_vid <= vid <= next_vid + batch_size - 1,
+        // but do not go over target_vid
+        let last_vid = (self.next_vid + self.batch_size.size - 1).min(self.target_vid);
+        rq::CopyEntityBatchQuery::new(self.dst.as_ref(), &self.src, self.next_vid, last_vid)?
+            .execute(conn)?;
+
+        let duration = start.elapsed();
+
+        // remember how far we got
+        self.next_vid = last_vid + 1;
+
+        self.batch_size.adapt(duration);
+
+        Ok(duration)
+    }
+
+    pub fn finished(&self) -> bool {
+        self.next_vid > self.target_vid
+    }
+}
+
+struct TableState {
+    batch: BatchCopy,
+    dst_site: Arc<Site>,
+    duration_ms: i64,
+}
+
+impl TableState {
+    fn init(
+        conn: &PgConnection,
+        dst_site: Arc<Site>,
+        src: Arc<Table>,
+        dst: Arc<Table>,
+        target_block: &BlockPtr,
+    ) -> Result<Self, StoreError> {
+        #[derive(QueryableByName)]
+        struct MaxVid {
+            #[sql_type = "diesel::sql_types::BigInt"]
+            max_vid: i64,
+        }
+
+        let max_block_clause = if src.immutable {
+            "block$ <= $1"
+        } else {
+            "lower(block_range) <= $1"
+        };
+        let target_vid = sql_query(&format!(
+            "select coalesce(max(vid), -1) as max_vid from {} where {}",
+            src.qualified_name.as_str(),
+            max_block_clause
+        ))
+        .bind::<Integer, _>(&target_block.number)
+        .load::<MaxVid>(conn)?
+        .first()
+        .map(|v| v.max_vid)
+        .unwrap_or(-1);
+
+        Ok(Self {
+            batch: BatchCopy::new(src, dst, 0, target_vid),
+            dst_site,
+            duration_ms: 0,
+        })
+    }
+
+    fn finished(&self) -> bool {
+        self.batch.finished()
+    }
+
+    fn load(
+        conn: &PgConnection,
+        src_layout: &Layout,
+        dst_layout: &Layout,
+    ) -> Result<Vec<TableState>, StoreError> {
+        use copy_table_state as cts;
+
+        fn resolve_entity(
+            layout: &Layout,
+            kind: &str,
+            entity_type: &EntityType,
+            dst: DeploymentId,
+            id: i32,
+        ) -> Result<Arc<Table>, StoreError> {
+            layout
+                .table_for_entity(entity_type)
+                .map_err(|e| {
+                    constraint_violation!(
+                        "invalid {} table {} in CopyState {} (table {}): {}",
+                        kind,
+                        entity_type,
+                        dst,
+                        id,
+                        e
+                    )
+                })
+                .map(|table| table.clone())
+        }
+
+        cts::table
+            .filter(cts::dst.eq(dst_layout.site.id))
+            .select((
+                cts::id,
+                cts::entity_type,
+                cts::next_vid,
+                cts::target_vid,
+                cts::batch_size,
+                cts::duration_ms,
+            ))
+            .order_by(cts::entity_type)
+            .load::<(i32, String, i64, i64, i64, i64)>(conn)?
+            .into_iter()
+            .map(
+                |(id, entity_type, current_vid, target_vid, size, duration_ms)| {
+                    let entity_type = EntityType::new(entity_type);
+                    let src =
+                        resolve_entity(src_layout, "source", &entity_type, dst_layout.site.id, id);
+                    let dst = resolve_entity(
+                        dst_layout,
+                        "destination",
+                        &entity_type,
+                        dst_layout.site.id,
+                        id,
+                    );
+                    match (src, dst) {
+                        (Ok(src), Ok(dst)) => {
+                            let mut batch = BatchCopy::new(src, dst, current_vid, target_vid);
+                            let batch_size = AdaptiveBatchSize { size };
+
+                            batch.batch_size = batch_size;
+
+                            Ok(TableState {
+                                batch,
+                                dst_site: dst_layout.site.clone(),
+                                duration_ms,
+                            })
+                        }
+                        (Err(e), _) => Err(e),
+                        (_, Err(e)) => Err(e),
+                    }
+                },
+            )
+            .collect()
+    }
+
+    fn record_progress(
+        &mut self,
+        conn: &PgConnection,
+        elapsed: Duration,
+        first_batch: bool,
+    ) -> Result<(), StoreError> {
+        use copy_table_state as cts;
+
+        // This conversion will become a problem if a copy takes longer than
+        // 300B years
+        self.duration_ms += i64::try_from(elapsed.as_millis()).unwrap_or(0);
+
+        if first_batch {
+            // Reset started_at so that finished_at - started_at is an
+            // accurate indication of how long we worked on a table.
+            update(
+                cts::table
+                    .filter(cts::dst.eq(self.dst_site.id))
+                    .filter(cts::entity_type.eq(self.batch.dst.object.as_str())),
+            )
+            .set(cts::started_at.eq(sql("now()")))
+            .execute(conn)?;
+        }
+        let values = (
+            cts::next_vid.eq(self.batch.next_vid),
+            cts::batch_size.eq(self.batch.batch_size.size),
+            cts::duration_ms.eq(self.duration_ms),
+        );
+        update(
+            cts::table
+                .filter(cts::dst.eq(self.dst_site.id))
+                .filter(cts::entity_type.eq(self.batch.dst.object.as_str())),
+        )
+        .set(values)
+        .execute(conn)?;
+        Ok(())
+    }
+
+    fn record_finished(&self, conn: &PgConnection) -> Result<(), StoreError> {
+        use copy_table_state as cts;
+
+        update(
+            cts::table
+                .filter(cts::dst.eq(self.dst_site.id))
+                .filter(cts::entity_type.eq(self.batch.dst.object.as_str())),
+        )
+        .set(cts::finished_at.eq(sql("now()")))
+        .execute(conn)?;
+        Ok(())
+    }
+
+    fn is_cancelled(&self, conn: &PgConnection) -> Result<bool, StoreError> {
+        use active_copies as ac;
+
+        let dst = self.dst_site.as_ref();
+        let canceled = ac::table
+            .filter(ac::dst.eq(dst.id))
+            .select(ac::cancelled_at.is_not_null())
+            .get_result::<bool>(conn)?;
+        if canceled {
+            use copy_state as cs;
+
+            update(cs::table.filter(cs::dst.eq(dst.id)))
+                .set(cs::cancelled_at.eq(sql("now()")))
+                .execute(conn)?;
+        }
+        Ok(canceled)
+    }
+
+    fn copy_batch(&mut self, conn: &PgConnection) -> Result<Status, StoreError> {
+        let first_batch = self.batch.next_vid == 0;
+
+        let duration = self.batch.run(conn)?;
+
+        self.record_progress(conn, duration, first_batch)?;
+
+        if self.finished() {
+            self.record_finished(conn)?;
+        }
+
+        Ok(Status::Finished)
+    }
+}
+
+// A helper for logging progress while data is being copied
+struct CopyProgress<'a> {
+    logger: &'a Logger,
+    last_log: Instant,
+    src: Arc<Site>,
+    dst: Arc<Site>,
+    current_vid: i64,
+    target_vid: i64,
+}
+
+impl<'a> CopyProgress<'a> {
+    fn new(logger: &'a Logger, state: &CopyState) -> Self {
+        let target_vid: i64 = state
+            .tables
+            .iter()
+            .map(|table| table.batch.target_vid)
+            .sum();
+        Self {
+            logger,
+            last_log: Instant::now(),
+            src: state.src.site.clone(),
+            dst: state.dst.site.clone(),
+            current_vid: 0,
+            target_vid,
+        }
+    }
+
+    fn start(&self) {
+        info!(
+            self.logger,
+            "Initialize data copy from {}[{}] to {}[{}]",
+            self.src.deployment,
+            self.src.namespace,
+            self.dst.deployment,
+            self.dst.namespace
+        );
+    }
+
+    fn progress_pct(current_vid: i64, target_vid: i64) -> f64 {
+        // When a step is done, current_vid == target_vid + 1; don't report
+        // more than 100% completion
+        if target_vid == 0 || current_vid >= target_vid {
+            100.0
+        } else {
+            current_vid as f64 / target_vid as f64 * 100.0
+        }
+    }
+
+    fn update(&mut self, batch: &BatchCopy) {
+        if self.last_log.elapsed() > LOG_INTERVAL {
+            info!(
+                self.logger,
+                "Copied {:.2}% of `{}` entities ({}/{} entity versions), {:.2}% of overall data",
+                Self::progress_pct(batch.next_vid, batch.target_vid),
+                batch.dst.object,
+                batch.next_vid,
+                batch.target_vid,
+                Self::progress_pct(self.current_vid + batch.next_vid, self.target_vid)
+            );
+            self.last_log = Instant::now();
+        }
+    }
+
+    fn table_finished(&mut self, batch: &BatchCopy) {
+        self.current_vid += batch.next_vid;
+    }
+
+    fn finished(&self) {
+        info!(
+            self.logger,
+            "Finished copying data into {}[{}]", self.dst.deployment, self.dst.namespace
+        );
+    }
+}
+
+/// A helper for copying subgraphs
+pub struct Connection {
+    /// The connection pool for the shard that will contain the destination
+    /// of the copy
+    logger: Logger,
+    conn: PooledConnection<ConnectionManager<PgConnection>>,
+    src: Arc<Layout>,
+    dst: Arc<Layout>,
+    target_block: BlockPtr,
+}
+
+impl Connection {
+    /// Create a new copy connection. It takes a connection from the
+    /// dedicated fdw pool in `pool`, and releases it only after the entire
+    /// copy has finished, which might take hours or even days. This method
+    /// will block until it was able to get a fdw connection. The overall
+    /// effect is that new copy requests will not start until a connection
+    /// is available.
+    pub fn new(
+        logger: &Logger,
+        pool: ConnectionPool,
+        src: Arc<Layout>,
+        dst: Arc<Layout>,
+        target_block: BlockPtr,
+    ) -> Result<Self, StoreError> {
+        let logger = logger.new(o!("dst" => dst.site.namespace.to_string()));
+
+        if src.site.schema_version != dst.site.schema_version {
+            return Err(StoreError::ConstraintViolation(format!(
+                "attempted to copy between different schema versions, \
+                 source version is {} but destination version is {}",
+                src.site.schema_version, dst.site.schema_version
+            )));
+        }
+
+        let mut last_log = Instant::now();
+        let conn = pool.get_fdw(&logger, || {
+            if last_log.elapsed() > LOG_INTERVAL {
+                info!(&logger, "waiting for other copy operations to finish");
+                last_log = Instant::now();
+            }
+            false
+        })?;
+        Ok(Self {
+            logger,
+            conn,
+            src,
+            dst,
+            target_block,
+        })
+    }
+
+    fn transaction<T, F>(&self, f: F) -> Result<T, StoreError>
+    where
+        F: FnOnce(&PgConnection) -> Result<T, StoreError>,
+    {
+        self.conn.transaction(|| f(&self.conn))
+    }
+
+    fn copy_private_data_sources(&self, state: &CopyState) -> Result<(), StoreError> {
+        if state.src.site.schema_version.private_data_sources() {
+            DataSourcesTable::new(state.src.site.namespace.clone()).copy_to(
+                &self.conn,
+                &DataSourcesTable::new(state.dst.site.namespace.clone()),
+                state.target_block.number,
+            )?;
+        }
+        Ok(())
+    }
+
+    pub fn copy_data_internal(&self) -> Result<Status, StoreError> {
+        let mut state = self.transaction(|conn| {
+            CopyState::new(
+                conn,
+                self.src.clone(),
+                self.dst.clone(),
+                self.target_block.clone(),
+            )
+        })?;
+
+        let mut progress = CopyProgress::new(&self.logger, &state);
+        progress.start();
+
+        for table in state.tables.iter_mut().filter(|table| !table.finished()) {
+            while !table.finished() {
+                // It is important that this check happens outside the write
+                // transaction so that we do not hold on to locks acquired
+                // by the check
+                if table.is_cancelled(&self.conn)? {
+                    return Ok(Status::Cancelled);
+                }
+
+                // Pause copying if replication is lagging behind to avoid
+                // overloading replicas
+                let mut lag = catalog::replication_lag(&self.conn)?;
+                if lag > MAX_REPLICATION_LAG {
+                    loop {
+                        info!(&self.logger,
+                             "Replicas are lagging too much; pausing copying for {}s to allow them to catch up",
+                             REPLICATION_SLEEP.as_secs();
+                             "lag_s" => lag.as_secs());
+                        std::thread::sleep(REPLICATION_SLEEP);
+                        lag = catalog::replication_lag(&self.conn)?;
+                        if lag <= ACCEPTABLE_REPLICATION_LAG {
+                            break;
+                        }
+                    }
+                }
+
+                let status = self.transaction(|conn| table.copy_batch(conn))?;
+                if status == Status::Cancelled {
+                    return Ok(status);
+                }
+                progress.update(&table.batch);
+            }
+            progress.table_finished(&table.batch);
+        }
+
+        self.copy_private_data_sources(&state)?;
+
+        self.transaction(|conn| state.finished(conn))?;
+        progress.finished();
+
+        Ok(Status::Finished)
+    }
+
+    /// Copy the data for the subgraph `src` to the subgraph `dst`. The
+    /// schema for both subgraphs must have already been set up. The
+    /// `target_block` must be far enough behind the chain head so that the
+    /// block is guaranteed to not be subject to chain reorgs. All data up
+    /// to and including `target_block` will be copied.
+    ///
+    /// The copy logic makes heavy use of the fact that the `vid` and
+    /// `block_range` of entity versions are related since for two entity
+    /// versions `v1` and `v2` such that `v1.vid <= v2.vid`, we know that
+    /// `lower(v1.block_range) <= lower(v2.block_range)`. Conversely,
+    /// therefore, we have that `lower(v2.block_range) >
+    /// lower(v1.block_range) => v2.vid > v1.vid` and we can therefore stop
+    /// the copying of each table as soon as we hit `max_vid = max { v.vid |
+    /// lower(v.block_range) <= target_block.number }`.
+    pub fn copy_data(&self) -> Result<Status, StoreError> {
+        // We require sole access to the destination site, and that we get a
+        // consistent view of what has been copied so far. In general, that
+        // is always true. It can happen though that this function runs when
+        // a query for copying from a previous run of graph-node is still in
+        // progress. Since each transaction during copying takes a very long
+        // time, it might take several minutes for Postgres to notice that
+        // the old process has been terminated. The locking strategy here
+        // ensures that we wait until that has happened.
+        info!(
+            &self.logger,
+            "Obtaining copy lock (this might take a long time if another process is still copying)"
+        );
+        advisory_lock::lock_copying(&self.conn, self.dst.site.as_ref())?;
+        let res = self.copy_data_internal();
+        advisory_lock::unlock_copying(&self.conn, self.dst.site.as_ref())?;
+        if matches!(res, Ok(Status::Cancelled)) {
+            warn!(&self.logger, "Copying was cancelled and is incomplete");
+        }
+        res
+    }
+}
diff --git a/store/postgres/src/deployment.rs b/store/postgres/src/deployment.rs
new file mode 100644
index 0000000..1c8f31c
--- /dev/null
+++ b/store/postgres/src/deployment.rs
@@ -0,0 +1,1041 @@
+//! Utilities for dealing with deployment metadata. Any connection passed
+//! into these methods must be for the shard that holds the actual
+//! deployment data and metadata
+use crate::{detail::GraphNodeVersion, primary::DeploymentId};
+use diesel::{
+    connection::SimpleConnection,
+    dsl::{count, delete, insert_into, select, sql, update},
+    sql_types::Integer,
+};
+use diesel::{expression::SqlLiteral, pg::PgConnection, sql_types::Numeric};
+use diesel::{
+    prelude::{ExpressionMethods, OptionalExtension, QueryDsl, RunQueryDsl},
+    sql_query,
+    sql_types::{Nullable, Text},
+};
+use graph::data::subgraph::{
+    schema::{DeploymentCreate, SubgraphManifestEntity},
+    SubgraphFeature,
+};
+use graph::prelude::{
+    anyhow, bigdecimal::ToPrimitive, hex, web3::types::H256, BigDecimal, BlockNumber, BlockPtr,
+    DeploymentHash, DeploymentState, Schema, StoreError,
+};
+use graph::{blockchain::block_stream::FirehoseCursor, data::subgraph::schema::SubgraphError};
+use stable_hash_legacy::crypto::SetHasher;
+use std::{collections::BTreeSet, convert::TryFrom, ops::Bound};
+use std::{str::FromStr, sync::Arc};
+
+use crate::connection_pool::ForeignServer;
+use crate::{block_range::BLOCK_RANGE_COLUMN, primary::Site};
+use graph::constraint_violation;
+
+#[derive(DbEnum, Debug, Clone, Copy)]
+pub enum SubgraphHealth {
+    Failed,
+    Healthy,
+    Unhealthy,
+}
+
+impl SubgraphHealth {
+    fn is_failed(&self) -> bool {
+        use graph::data::subgraph::schema::SubgraphHealth as H;
+
+        H::from(*self).is_failed()
+    }
+}
+
+impl From<SubgraphHealth> for graph::data::subgraph::schema::SubgraphHealth {
+    fn from(health: SubgraphHealth) -> Self {
+        use graph::data::subgraph::schema::SubgraphHealth as H;
+        use SubgraphHealth as Db;
+
+        match health {
+            Db::Failed => H::Failed,
+            Db::Healthy => H::Healthy,
+            Db::Unhealthy => H::Unhealthy,
+        }
+    }
+}
+
+table! {
+    subgraphs.subgraph_deployment (id) {
+        id -> Integer,
+        deployment -> Text,
+        failed -> Bool,
+        health -> crate::deployment::SubgraphHealthMapping,
+        synced -> Bool,
+        fatal_error -> Nullable<Text>,
+        non_fatal_errors -> Array<Text>,
+        // Not used anymore; only written to keep backwards compatible
+        earliest_ethereum_block_hash -> Nullable<Binary>,
+        earliest_ethereum_block_number -> Nullable<Numeric>,
+        earliest_block_number -> Integer,
+        latest_ethereum_block_hash -> Nullable<Binary>,
+        latest_ethereum_block_number -> Nullable<Numeric>,
+        last_healthy_ethereum_block_hash -> Nullable<Binary>,
+        last_healthy_ethereum_block_number -> Nullable<Numeric>,
+        entity_count -> Numeric,
+        graft_base -> Nullable<Text>,
+        graft_block_hash -> Nullable<Binary>,
+        graft_block_number -> Nullable<Numeric>,
+        debug_fork -> Nullable<Text>,
+        reorg_count -> Integer,
+        current_reorg_depth -> Integer,
+        max_reorg_depth -> Integer,
+        firehose_cursor -> Nullable<Text>,
+    }
+}
+
+table! {
+    subgraphs.subgraph_error (vid) {
+        vid -> BigInt,
+        id -> Text,
+        subgraph_id -> Text,
+        message -> Text,
+        block_hash -> Nullable<Binary>,
+        handler -> Nullable<Text>,
+        deterministic -> Bool,
+        block_range -> Range<Integer>,
+    }
+}
+
+table! {
+    subgraphs.subgraph_manifest {
+        id -> Integer,
+        spec_version -> Text,
+        description -> Nullable<Text>,
+        repository -> Nullable<Text>,
+        features -> Array<Text>,
+        schema -> Text,
+        graph_node_version_id -> Nullable<Integer>,
+        use_bytea_prefix -> Bool,
+        /// Parent of the smallest start block from the manifest
+        start_block_number -> Nullable<Integer>,
+        start_block_hash -> Nullable<Binary>,
+    }
+}
+
+table! {
+    subgraphs.graph_node_versions {
+        id -> Integer,
+        git_commit_hash -> Text,
+        git_repository_dirty -> Bool,
+        crate_version -> Text,
+        major -> Integer,
+        minor -> Integer,
+        patch -> Integer,
+    }
+}
+
+allow_tables_to_appear_in_same_query!(subgraph_deployment, subgraph_error, subgraph_manifest);
+
+/// Look up the graft point for the given subgraph in the database and
+/// return it. If `pending_only` is `true`, only return `Some(_)` if the
+/// deployment has not progressed past the graft point, i.e., data has not
+/// been copied for the graft
+fn graft(
+    conn: &PgConnection,
+    id: &DeploymentHash,
+    pending_only: bool,
+) -> Result<Option<(DeploymentHash, BlockPtr)>, StoreError> {
+    use subgraph_deployment as sd;
+
+    let graft_query = sd::table
+        .select((sd::graft_base, sd::graft_block_hash, sd::graft_block_number))
+        .filter(sd::deployment.eq(id.as_str()));
+    // The name of the base subgraph, the hash, and block number
+    let graft: (Option<String>, Option<Vec<u8>>, Option<BigDecimal>) = if pending_only {
+        graft_query
+            .filter(sd::latest_ethereum_block_number.is_null())
+            .first(conn)
+            .optional()?
+            .unwrap_or((None, None, None))
+    } else {
+        graft_query
+            .first(conn)
+            .optional()?
+            .unwrap_or((None, None, None))
+    };
+    match graft {
+        (None, None, None) => Ok(None),
+        (Some(subgraph), Some(hash), Some(block)) => {
+            // FIXME:
+            //
+            // workaround for arweave
+            let hash = H256::from_slice(&hash.as_slice()[..32]);
+            let block = block.to_u64().expect("block numbers fit into a u64");
+            let subgraph = DeploymentHash::new(subgraph.clone()).map_err(|_| {
+                StoreError::Unknown(anyhow!(
+                    "the base subgraph for a graft must be a valid subgraph id but is `{}`",
+                    subgraph
+                ))
+            })?;
+            Ok(Some((subgraph, BlockPtr::from((hash, block)))))
+        }
+        _ => unreachable!(
+            "graftBlockHash and graftBlockNumber are either both set or neither is set"
+        ),
+    }
+}
+
+/// Look up the graft point for the given subgraph in the database and
+/// return it. Returns `None` if the deployment does not have
+/// a graft or if the subgraph has already progress past the graft point,
+/// indicating that the data copying for grafting has been performed
+pub fn graft_pending(
+    conn: &PgConnection,
+    id: &DeploymentHash,
+) -> Result<Option<(DeploymentHash, BlockPtr)>, StoreError> {
+    graft(conn, id, true)
+}
+
+/// Look up the graft point for the given subgraph in the database and
+/// return it. Returns `None` if the deployment does not have
+/// a graft.
+pub fn graft_point(
+    conn: &PgConnection,
+    id: &DeploymentHash,
+) -> Result<Option<(DeploymentHash, BlockPtr)>, StoreError> {
+    graft(conn, id, false)
+}
+
+/// Look up the debug fork for the given subgraph in the database and
+/// return it. Returns `None` if the deployment does not have
+/// a debug fork.
+pub fn debug_fork(
+    conn: &PgConnection,
+    id: &DeploymentHash,
+) -> Result<Option<DeploymentHash>, StoreError> {
+    use subgraph_deployment as sd;
+
+    let debug_fork: Option<String> = sd::table
+        .select(sd::debug_fork)
+        .filter(sd::deployment.eq(id.as_str()))
+        .first(conn)?;
+
+    match debug_fork {
+        Some(fork) => Ok(Some(DeploymentHash::new(fork.clone()).map_err(|_| {
+            StoreError::Unknown(anyhow!(
+                "the debug fork for a subgraph must be a valid subgraph id but is `{}`",
+                fork
+            ))
+        })?)),
+        None => Ok(None),
+    }
+}
+
+pub fn schema(conn: &PgConnection, site: &Site) -> Result<(Schema, bool), StoreError> {
+    use subgraph_manifest as sm;
+    let (s, use_bytea_prefix) = sm::table
+        .select((sm::schema, sm::use_bytea_prefix))
+        .filter(sm::id.eq(site.id))
+        .first::<(String, bool)>(conn)?;
+    Schema::parse(s.as_str(), site.deployment.clone())
+        .map_err(StoreError::Unknown)
+        .map(|schema| (schema, use_bytea_prefix))
+}
+
+pub fn manifest_info(
+    conn: &PgConnection,
+    site: &Site,
+) -> Result<(Schema, Option<String>, Option<String>, String), StoreError> {
+    use subgraph_manifest as sm;
+    let (s, description, repository, spec_version): (
+        String,
+        Option<String>,
+        Option<String>,
+        String,
+    ) = sm::table
+        .select((
+            sm::schema,
+            sm::description,
+            sm::repository,
+            sm::spec_version,
+        ))
+        .filter(sm::id.eq(site.id))
+        .first(conn)?;
+    Schema::parse(s.as_str(), site.deployment.clone())
+        .map_err(|e| StoreError::Unknown(e))
+        .map(|schema| (schema, description, repository, spec_version))
+}
+
+#[allow(dead_code)]
+pub fn features(conn: &PgConnection, site: &Site) -> Result<BTreeSet<SubgraphFeature>, StoreError> {
+    use subgraph_manifest as sm;
+
+    let features: Vec<String> = sm::table
+        .select(sm::features)
+        .filter(sm::id.eq(site.id))
+        .first(conn)
+        .unwrap();
+    features
+        .iter()
+        .map(|f| SubgraphFeature::from_str(f).map_err(StoreError::from))
+        .collect()
+}
+
+pub fn transact_block(
+    conn: &PgConnection,
+    site: &Site,
+    ptr: &BlockPtr,
+    firehose_cursor: &FirehoseCursor,
+    full_count_query: &str,
+    count: i32,
+) -> Result<(), StoreError> {
+    use crate::diesel::BoolExpressionMethods;
+    use subgraph_deployment as d;
+
+    // Work around a Diesel issue with serializing BigDecimals to numeric
+    let number = format!("{}::numeric", ptr.number);
+
+    let count_sql = if count == 0 {
+        // This amounts to a noop - the entity count does not change
+        "entity_count".to_string()
+    } else {
+        entity_count_sql(full_count_query, count)
+    };
+
+    let row_count = update(
+        d::table.filter(d::id.eq(site.id)).filter(
+            // Asserts that the processing direction is forward.
+            d::latest_ethereum_block_number
+                .lt(sql(&number))
+                .or(d::latest_ethereum_block_number.is_null()),
+        ),
+    )
+    .set((
+        d::latest_ethereum_block_number.eq(sql(&number)),
+        d::latest_ethereum_block_hash.eq(ptr.hash_slice()),
+        d::firehose_cursor.eq(firehose_cursor.as_ref()),
+        d::entity_count.eq(sql(&count_sql)),
+        d::current_reorg_depth.eq(0),
+    ))
+    .execute(conn)
+    .map_err(StoreError::from)?;
+
+    match row_count {
+        // Common case: A single row was updated.
+        1 => Ok(()),
+
+        // No matching rows were found. This is an error. By the filter conditions, this can only be
+        // due to a missing deployment (which `block_ptr` catches) or duplicate block processing.
+        0 => match block_ptr(&conn, &site.deployment)? {
+            Some(block_ptr_from) if block_ptr_from.number >= ptr.number => Err(
+                StoreError::DuplicateBlockProcessing(site.deployment.clone(), ptr.number),
+            ),
+            None | Some(_) => Err(StoreError::Unknown(anyhow!(
+                "unknown error forwarding block ptr"
+            ))),
+        },
+
+        // More than one matching row was found.
+        _ => Err(StoreError::ConstraintViolation(
+            "duplicate deployments in shard".to_owned(),
+        )),
+    }
+}
+
+pub fn forward_block_ptr(
+    conn: &PgConnection,
+    id: &DeploymentHash,
+    ptr: &BlockPtr,
+) -> Result<(), StoreError> {
+    use crate::diesel::BoolExpressionMethods;
+    use subgraph_deployment as d;
+
+    // Work around a Diesel issue with serializing BigDecimals to numeric
+    let number = format!("{}::numeric", ptr.number);
+
+    let row_count = update(
+        d::table.filter(d::deployment.eq(id.as_str())).filter(
+            // Asserts that the processing direction is forward.
+            d::latest_ethereum_block_number
+                .lt(sql(&number))
+                .or(d::latest_ethereum_block_number.is_null()),
+        ),
+    )
+    .set((
+        d::latest_ethereum_block_number.eq(sql(&number)),
+        d::latest_ethereum_block_hash.eq(ptr.hash_slice()),
+        d::current_reorg_depth.eq(0),
+    ))
+    .execute(conn)
+    .map_err(StoreError::from)?;
+
+    match row_count {
+        // Common case: A single row was updated.
+        1 => Ok(()),
+
+        // No matching rows were found. This is an error. By the filter conditions, this can only be
+        // due to a missing deployment (which `block_ptr` catches) or duplicate block processing.
+        0 => match block_ptr(conn, id)? {
+            Some(block_ptr_from) if block_ptr_from.number >= ptr.number => {
+                Err(StoreError::DuplicateBlockProcessing(id.clone(), ptr.number))
+            }
+            None | Some(_) => Err(StoreError::Unknown(anyhow!(
+                "unknown error forwarding block ptr"
+            ))),
+        },
+
+        // More than one matching row was found.
+        _ => Err(StoreError::ConstraintViolation(
+            "duplicate deployments in shard".to_owned(),
+        )),
+    }
+}
+
+pub fn get_subgraph_firehose_cursor(
+    conn: &PgConnection,
+    site: Arc<Site>,
+) -> Result<Option<String>, StoreError> {
+    use subgraph_deployment as d;
+
+    let res = d::table
+        .filter(d::deployment.eq(site.deployment.as_str()))
+        .select(d::firehose_cursor)
+        .first::<Option<String>>(conn)
+        .map_err(StoreError::from);
+    res
+}
+
+pub fn revert_block_ptr(
+    conn: &PgConnection,
+    id: &DeploymentHash,
+    ptr: BlockPtr,
+    firehose_cursor: &FirehoseCursor,
+) -> Result<(), StoreError> {
+    use subgraph_deployment as d;
+
+    // Work around a Diesel issue with serializing BigDecimals to numeric
+    let number = format!("{}::numeric", ptr.number);
+
+    update(d::table.filter(d::deployment.eq(id.as_str())))
+        .set((
+            d::latest_ethereum_block_number.eq(sql(&number)),
+            d::latest_ethereum_block_hash.eq(ptr.hash_slice()),
+            d::firehose_cursor.eq(firehose_cursor.as_ref()),
+            d::reorg_count.eq(d::reorg_count + 1),
+            d::current_reorg_depth.eq(d::current_reorg_depth + 1),
+            d::max_reorg_depth.eq(sql("greatest(current_reorg_depth + 1, max_reorg_depth)")),
+        ))
+        .execute(conn)
+        .map(|_| ())
+        .map_err(|e| e.into())
+}
+
+pub fn block_ptr(conn: &PgConnection, id: &DeploymentHash) -> Result<Option<BlockPtr>, StoreError> {
+    use subgraph_deployment as d;
+
+    let (number, hash) = d::table
+        .filter(d::deployment.eq(id.as_str()))
+        .select((
+            d::latest_ethereum_block_number,
+            d::latest_ethereum_block_hash,
+        ))
+        .first::<(Option<BigDecimal>, Option<Vec<u8>>)>(conn)
+        .map_err(|e| match e {
+            diesel::result::Error::NotFound => StoreError::DeploymentNotFound(id.to_string()),
+            e => e.into(),
+        })?;
+
+    let ptr = crate::detail::block(id.as_str(), "latest_ethereum_block", hash, number)?
+        .map(|block| block.to_ptr());
+    Ok(ptr)
+}
+
+/// Initialize the subgraph's block pointer. If the block pointer in
+/// `latest_ethereum_block` is set already, do nothing. If it is still
+/// `null`, set it to `start_ethereum_block` from `subgraph_manifest`
+pub fn initialize_block_ptr(conn: &PgConnection, site: &Site) -> Result<(), StoreError> {
+    use subgraph_deployment as d;
+    use subgraph_manifest as m;
+
+    let needs_init = d::table
+        .filter(d::id.eq(site.id))
+        .filter(d::latest_ethereum_block_hash.is_null())
+        .select(d::id)
+        .first::<i32>(conn)
+        .optional()?
+        .is_some();
+
+    if needs_init {
+        if let (Some(hash), Some(number)) = m::table
+            .filter(m::id.eq(site.id))
+            .select((m::start_block_hash, m::start_block_number))
+            .first::<(Option<Vec<u8>>, Option<BlockNumber>)>(conn)?
+        {
+            let number = format!("{}::numeric", number);
+
+            update(d::table.filter(d::id.eq(site.id)))
+                .set((
+                    d::latest_ethereum_block_hash.eq(&hash),
+                    d::latest_ethereum_block_number.eq(sql(&number)),
+                ))
+                .execute(conn)
+                .map(|_| ())
+                .map_err(|e| e.into())
+        } else {
+            Ok(())
+        }
+    } else {
+        Ok(())
+    }
+}
+
+fn convert_to_u32(number: Option<i32>, field: &str, subgraph: &str) -> Result<u32, StoreError> {
+    number
+        .ok_or_else(|| constraint_violation!("missing {} for subgraph `{}`", field, subgraph))
+        .and_then(|number| {
+            u32::try_from(number).map_err(|_| {
+                constraint_violation!(
+                    "invalid value {:?} for {} in subgraph {}",
+                    number,
+                    field,
+                    subgraph
+                )
+            })
+        })
+}
+
+pub fn state(conn: &PgConnection, id: DeploymentHash) -> Result<DeploymentState, StoreError> {
+    use subgraph_deployment as d;
+
+    match d::table
+        .filter(d::deployment.eq(id.as_str()))
+        .select((
+            d::deployment,
+            d::reorg_count,
+            d::max_reorg_depth,
+            d::latest_ethereum_block_number,
+            d::latest_ethereum_block_hash,
+            d::earliest_block_number,
+        ))
+        .first::<(
+            String,
+            i32,
+            i32,
+            Option<BigDecimal>,
+            Option<Vec<u8>>,
+            BlockNumber,
+        )>(conn)
+        .optional()?
+    {
+        None => Err(StoreError::QueryExecutionError(format!(
+            "No data found for subgraph {}",
+            id
+        ))),
+        Some((
+            _,
+            reorg_count,
+            max_reorg_depth,
+            latest_block_number,
+            latest_block_hash,
+            earliest_block_number,
+        )) => {
+            let reorg_count = convert_to_u32(Some(reorg_count), "reorg_count", id.as_str())?;
+            let max_reorg_depth =
+                convert_to_u32(Some(max_reorg_depth), "max_reorg_depth", id.as_str())?;
+            let latest_block = crate::detail::block(
+                id.as_str(),
+                "latest_block",
+                latest_block_hash,
+                latest_block_number,
+            )?
+            .ok_or_else(|| {
+                StoreError::QueryExecutionError(format!(
+                    "Subgraph `{}` has not started syncing yet. Wait for it to ingest \
+                 a few blocks before querying it",
+                    id
+                ))
+            })?
+            .to_ptr();
+            Ok(DeploymentState {
+                id,
+                reorg_count,
+                max_reorg_depth,
+                latest_block,
+                earliest_block_number,
+            })
+        }
+    }
+}
+
+/// Mark the deployment `id` as synced
+pub fn set_synced(conn: &PgConnection, id: &DeploymentHash) -> Result<(), StoreError> {
+    use subgraph_deployment as d;
+
+    update(
+        d::table
+            .filter(d::deployment.eq(id.as_str()))
+            .filter(d::synced.eq(false)),
+    )
+    .set(d::synced.eq(true))
+    .execute(conn)?;
+    Ok(())
+}
+
+/// Returns `true` if the deployment (as identified by `site.id`)
+pub fn exists(conn: &PgConnection, site: &Site) -> Result<bool, StoreError> {
+    use subgraph_deployment as d;
+
+    let exists = d::table
+        .filter(d::id.eq(site.id))
+        .count()
+        .get_result::<i64>(conn)?
+        > 0;
+    Ok(exists)
+}
+
+/// Returns `true` if the deployment `id` exists and is synced
+pub fn exists_and_synced(conn: &PgConnection, id: &str) -> Result<bool, StoreError> {
+    use subgraph_deployment as d;
+
+    let synced = d::table
+        .filter(d::deployment.eq(id))
+        .select(d::synced)
+        .first(conn)
+        .optional()?
+        .unwrap_or(false);
+    Ok(synced)
+}
+
+// Does nothing if the error already exists. Returns the error id.
+fn insert_subgraph_error(conn: &PgConnection, error: &SubgraphError) -> anyhow::Result<String> {
+    use subgraph_error as e;
+
+    let error_id = hex::encode(&stable_hash_legacy::utils::stable_hash::<SetHasher, _>(
+        &error,
+    ));
+    let SubgraphError {
+        subgraph_id,
+        message,
+        handler,
+        block_ptr,
+        deterministic,
+    } = error;
+
+    let block_num = match &block_ptr {
+        None => {
+            assert_eq!(*deterministic, false);
+            crate::block_range::BLOCK_UNVERSIONED
+        }
+        Some(block) => crate::block_range::block_number(block),
+    };
+
+    insert_into(e::table)
+        .values((
+            e::id.eq(&error_id),
+            e::subgraph_id.eq(subgraph_id.as_str()),
+            e::message.eq(message),
+            e::handler.eq(handler),
+            e::deterministic.eq(deterministic),
+            e::block_hash.eq(block_ptr.as_ref().map(|ptr| ptr.hash_slice())),
+            e::block_range.eq((Bound::Included(block_num), Bound::Unbounded)),
+        ))
+        .on_conflict_do_nothing()
+        .execute(conn)?;
+
+    Ok(error_id)
+}
+
+pub fn fail(
+    conn: &PgConnection,
+    id: &DeploymentHash,
+    error: &SubgraphError,
+) -> Result<(), StoreError> {
+    let error_id = insert_subgraph_error(conn, error)?;
+
+    update_deployment_status(conn, id, SubgraphHealth::Failed, Some(error_id))?;
+
+    Ok(())
+}
+
+/// If `block` is `None`, assumes the latest block.
+pub(crate) fn has_deterministic_errors(
+    conn: &PgConnection,
+    id: &DeploymentHash,
+    block: BlockNumber,
+) -> Result<bool, StoreError> {
+    use subgraph_error as e;
+    select(diesel::dsl::exists(
+        e::table
+            .filter(e::subgraph_id.eq(id.as_str()))
+            .filter(e::deterministic)
+            .filter(sql("block_range @> ").bind::<Integer, _>(block)),
+    ))
+    .get_result(conn)
+    .map_err(|e| e.into())
+}
+
+pub fn update_deployment_status(
+    conn: &PgConnection,
+    deployment_id: &DeploymentHash,
+    health: SubgraphHealth,
+    fatal_error: Option<String>,
+) -> Result<(), StoreError> {
+    use subgraph_deployment as d;
+
+    update(d::table.filter(d::deployment.eq(deployment_id.as_str())))
+        .set((
+            d::failed.eq(health.is_failed()),
+            d::health.eq(health),
+            d::fatal_error.eq::<Option<String>>(fatal_error),
+        ))
+        .execute(conn)
+        .map(|_| ())
+        .map_err(StoreError::from)
+}
+
+/// Insert the errors and check if the subgraph needs to be set as unhealthy.
+pub(crate) fn insert_subgraph_errors(
+    conn: &PgConnection,
+    id: &DeploymentHash,
+    deterministic_errors: &[SubgraphError],
+    block: BlockNumber,
+) -> Result<(), StoreError> {
+    for error in deterministic_errors {
+        insert_subgraph_error(conn, error)?;
+    }
+
+    check_health(conn, id, block)
+}
+
+#[cfg(debug_assertions)]
+pub(crate) fn error_count(conn: &PgConnection, id: &DeploymentHash) -> Result<usize, StoreError> {
+    use subgraph_error as e;
+
+    Ok(e::table
+        .filter(e::subgraph_id.eq(id.as_str()))
+        .count()
+        .get_result::<i64>(conn)? as usize)
+}
+
+/// Checks if the subgraph is healthy or unhealthy as of the given block, or the subgraph latest
+/// block if `None`, based on the presence of deterministic errors. Has no effect on failed subgraphs.
+fn check_health(
+    conn: &PgConnection,
+    id: &DeploymentHash,
+    block: BlockNumber,
+) -> Result<(), StoreError> {
+    use subgraph_deployment as d;
+
+    let has_errors = has_deterministic_errors(conn, id, block)?;
+
+    let (new, old) = match has_errors {
+        true => (SubgraphHealth::Unhealthy, SubgraphHealth::Healthy),
+        false => (SubgraphHealth::Healthy, SubgraphHealth::Unhealthy),
+    };
+
+    update(
+        d::table
+            .filter(d::deployment.eq(id.as_str()))
+            .filter(d::health.eq(old)),
+    )
+    .set(d::health.eq(new))
+    .execute(conn)
+    .map(|_| ())
+    .map_err(|e| e.into())
+}
+
+pub(crate) fn health(conn: &PgConnection, id: DeploymentId) -> Result<SubgraphHealth, StoreError> {
+    use subgraph_deployment as d;
+
+    d::table
+        .filter(d::id.eq(id))
+        .select(d::health)
+        .get_result(conn)
+        .map_err(|e| e.into())
+}
+
+/// Reverts the errors and updates the subgraph health if necessary.
+pub(crate) fn revert_subgraph_errors(
+    conn: &PgConnection,
+    id: &DeploymentHash,
+    reverted_block: BlockNumber,
+) -> Result<(), StoreError> {
+    use subgraph_error as e;
+
+    let lower_geq = format!("lower({}) >= ", BLOCK_RANGE_COLUMN);
+    delete(
+        e::table
+            .filter(e::subgraph_id.eq(id.as_str()))
+            .filter(sql(&lower_geq).bind::<Integer, _>(reverted_block)),
+    )
+    .execute(conn)?;
+
+    // The result will be the same at `reverted_block` or `reverted_block - 1` since the errors at
+    // `reverted_block` were just deleted, but semantically we care about `reverted_block - 1` which
+    // is the block being reverted to.
+    check_health(conn, id, reverted_block - 1)
+}
+
+pub(crate) fn delete_error(conn: &PgConnection, error_id: &str) -> Result<(), StoreError> {
+    use subgraph_error as e;
+    delete(e::table.filter(e::id.eq(error_id)))
+        .execute(conn)
+        .map(|_| ())
+        .map_err(StoreError::from)
+}
+
+/// Copy the dynamic data sources for `src` to `dst`. All data sources that
+/// were created up to and including `target_block` will be copied.
+pub(crate) fn copy_errors(
+    conn: &PgConnection,
+    src: &Site,
+    dst: &Site,
+    target_block: &BlockPtr,
+) -> Result<usize, StoreError> {
+    use subgraph_error as e;
+
+    let src_nsp = if src.shard == dst.shard {
+        "subgraphs".to_string()
+    } else {
+        ForeignServer::metadata_schema(&src.shard)
+    };
+
+    // Check whether there are any errors for dst which indicates we already
+    // did copy
+    let count = e::table
+        .filter(e::subgraph_id.eq(dst.deployment.as_str()))
+        .select(count(e::vid))
+        .get_result::<i64>(conn)?;
+    if count > 0 {
+        return Ok(count as usize);
+    }
+
+    // We calculate a new id since the subgraph_error table has an exclusion
+    // constraint on (id, block_range) and we need to make sure that newly
+    // inserted errors do not collide with existing ones. For new subgraph
+    // errors, we use a stable hash; for copied ones we just use an MD5.
+    //
+    // Longer term, we should get rid of the id column, since it is only
+    // needed to deduplicate error messages, which would be better achieved
+    // with a unique index
+    let query = format!(
+        "\
+      insert into subgraphs.subgraph_error(id,
+             subgraph_id, message, block_hash, handler, deterministic, block_range)
+      select md5($2 || e.message || coalesce(e.block_hash, 'nohash') || coalesce(e.handler, 'nohandler') || e.deterministic) as id,
+             $2 as subgraph_id, e.message, e.block_hash,
+             e.handler, e.deterministic, e.block_range
+        from {src_nsp}.subgraph_error e
+       where e.subgraph_id = $1
+         and lower(e.block_range) <= $3",
+        src_nsp = src_nsp
+    );
+
+    Ok(sql_query(&query)
+        .bind::<Text, _>(src.deployment.as_str())
+        .bind::<Text, _>(dst.deployment.as_str())
+        .bind::<Integer, _>(target_block.number)
+        .execute(conn)?)
+}
+
+/// Drop the schema `namespace`. This deletes all data for the subgraph, and
+/// can not be reversed. It does not remove any of the metadata in the
+/// `subgraphs` schema for the deployment.
+///
+/// Since long-running operations, like a vacuum on one of the tables in the
+/// schema, could block dropping the schema indefinitely, this operation
+/// will wait at most 2s to aquire all necessary locks, and fail if that is
+/// not possible.
+pub fn drop_schema(
+    conn: &diesel::pg::PgConnection,
+    namespace: &crate::primary::Namespace,
+) -> Result<(), StoreError> {
+    let query = format!(
+        "set local lock_timeout=2000; drop schema if exists {} cascade",
+        namespace
+    );
+    Ok(conn.batch_execute(&*query)?)
+}
+
+pub fn drop_metadata(conn: &PgConnection, site: &Site) -> Result<(), StoreError> {
+    use subgraph_deployment as d;
+
+    // We don't need to delete from subgraph_manifest or subgraph_error
+    // since that cascades from deleting the subgraph_deployment
+    delete(d::table.filter(d::id.eq(site.id))).execute(conn)?;
+    Ok(())
+}
+
+pub fn create_deployment(
+    conn: &PgConnection,
+    site: &Site,
+    deployment: DeploymentCreate,
+    exists: bool,
+    replace: bool,
+) -> Result<(), StoreError> {
+    use subgraph_deployment as d;
+    use subgraph_manifest as m;
+
+    fn b(ptr: &Option<BlockPtr>) -> Option<&[u8]> {
+        ptr.as_ref().map(|ptr| ptr.hash_slice())
+    }
+
+    fn n(ptr: &Option<BlockPtr>) -> SqlLiteral<Nullable<Numeric>> {
+        match ptr {
+            None => sql("null"),
+            Some(ptr) => sql(&format!("{}::numeric", ptr.number)),
+        }
+    }
+
+    let DeploymentCreate {
+        manifest:
+            SubgraphManifestEntity {
+                spec_version,
+                description,
+                repository,
+                features,
+                schema,
+            },
+        earliest_block,
+        graft_base,
+        graft_block,
+        debug_fork,
+    } = deployment;
+    let earliest_block_number = earliest_block.as_ref().map(|ptr| ptr.number).unwrap_or(0);
+
+    let deployment_values = (
+        d::id.eq(site.id),
+        d::deployment.eq(site.deployment.as_str()),
+        d::failed.eq(false),
+        d::synced.eq(false),
+        d::health.eq(SubgraphHealth::Healthy),
+        d::fatal_error.eq::<Option<String>>(None),
+        d::non_fatal_errors.eq::<Vec<String>>(vec![]),
+        d::earliest_ethereum_block_hash.eq(b(&earliest_block)),
+        d::earliest_ethereum_block_number.eq(n(&earliest_block)),
+        d::earliest_block_number.eq(earliest_block_number),
+        d::latest_ethereum_block_hash.eq(sql("null")),
+        d::latest_ethereum_block_number.eq(sql("null")),
+        d::entity_count.eq(sql("0")),
+        d::graft_base.eq(graft_base.as_ref().map(|s| s.as_str())),
+        d::graft_block_hash.eq(b(&graft_block)),
+        d::graft_block_number.eq(n(&graft_block)),
+        d::debug_fork.eq(debug_fork.as_ref().map(|s| s.as_str())),
+    );
+
+    let graph_node_version_id = GraphNodeVersion::create_or_get(conn)?;
+
+    let manifest_values = (
+        m::id.eq(site.id),
+        m::spec_version.eq(spec_version),
+        m::description.eq(description),
+        m::repository.eq(repository),
+        m::features.eq(features),
+        m::schema.eq(schema),
+        m::graph_node_version_id.eq(graph_node_version_id),
+        // New subgraphs index only a prefix of bytea columns
+        // see: attr-bytea-prefix
+        m::use_bytea_prefix.eq(true),
+        m::start_block_hash.eq(b(&earliest_block)),
+        m::start_block_number.eq(earliest_block_number),
+    );
+
+    if exists && replace {
+        update(d::table.filter(d::deployment.eq(site.deployment.as_str())))
+            .set(deployment_values)
+            .execute(conn)?;
+
+        update(m::table.filter(m::id.eq(site.id)))
+            .set(manifest_values)
+            .execute(conn)?;
+    } else {
+        insert_into(d::table)
+            .values(deployment_values)
+            .execute(conn)?;
+
+        insert_into(m::table)
+            .values(manifest_values)
+            .execute(conn)?;
+    }
+    Ok(())
+}
+
+fn entity_count_sql(full_count_query: &str, count: i32) -> String {
+    // The big complication in this query is how to determine what the
+    // new entityCount should be. We want to make sure that if the entityCount
+    // is NULL or the special value `-1`, it gets recomputed. Using `-1` here
+    // makes it possible to manually set the `entityCount` to that value
+    // to force a recount; setting it to `NULL` is not desirable since
+    // `entityCount` on the GraphQL level is not nullable, and so setting
+    // `entityCount` to `NULL` could cause errors at that layer; temporarily
+    // returning `-1` is more palatable. To be exact, recounts have to be
+    // done here, from the subgraph writer.
+    //
+    // The first argument of `coalesce` will be `NULL` if the entity count
+    // is `NULL` or `-1`, forcing `coalesce` to evaluate its second
+    // argument, the query to count entities. In all other cases,
+    // `coalesce` does not evaluate its second argument
+    format!(
+        "coalesce((nullif(entity_count, -1)) + ({count}),
+                  ({full_count_query}))",
+        full_count_query = full_count_query,
+        count = count
+    )
+}
+
+pub fn update_entity_count(
+    conn: &PgConnection,
+    site: &Site,
+    full_count_query: &str,
+    count: i32,
+) -> Result<(), StoreError> {
+    use subgraph_deployment as d;
+
+    if count == 0 {
+        return Ok(());
+    }
+
+    let count_sql = entity_count_sql(full_count_query, count);
+    update(d::table.filter(d::id.eq(site.id)))
+        .set(d::entity_count.eq(sql(&count_sql)))
+        .execute(conn)?;
+    Ok(())
+}
+
+/// Set the deployment's entity count to whatever `full_count_query` produces
+pub fn set_entity_count(
+    conn: &PgConnection,
+    site: &Site,
+    full_count_query: &str,
+) -> Result<(), StoreError> {
+    use subgraph_deployment as d;
+
+    let full_count_query = format!("({})", full_count_query);
+    update(d::table.filter(d::id.eq(site.id)))
+        .set(d::entity_count.eq(sql(&full_count_query)))
+        .execute(conn)?;
+    Ok(())
+}
+
+pub fn set_earliest_block(
+    conn: &PgConnection,
+    site: &Site,
+    earliest_block: BlockNumber,
+) -> Result<(), StoreError> {
+    use subgraph_deployment as d;
+
+    update(d::table.filter(d::id.eq(site.id)))
+        .set(d::earliest_block_number.eq(earliest_block))
+        .execute(conn)?;
+    Ok(())
+}
+
+/// Lock the row for `site` in `subgraph_deployment` for update for the
+/// remainder of the current transaction. This lock is used to coordinate
+/// the changes that the subgraph writer makes with changes that other parts
+/// of the system, in particular, pruning make
+//  see also: deployment-lock-for-update
+pub fn lock(conn: &PgConnection, site: &Site) -> Result<(), StoreError> {
+    use subgraph_deployment as d;
+
+    d::table
+        .select(d::id)
+        .filter(d::id.eq(site.id))
+        .for_update()
+        .get_result::<DeploymentId>(conn)?;
+    Ok(())
+}
diff --git a/store/postgres/src/deployment_store.rs b/store/postgres/src/deployment_store.rs
new file mode 100644
index 0000000..188b138
--- /dev/null
+++ b/store/postgres/src/deployment_store.rs
@@ -0,0 +1,1630 @@
+use detail::DeploymentDetail;
+use diesel::connection::SimpleConnection;
+use diesel::pg::PgConnection;
+use diesel::prelude::*;
+use diesel::r2d2::{ConnectionManager, PooledConnection};
+use graph::blockchain::block_stream::FirehoseCursor;
+use graph::components::store::{EntityKey, EntityType, PruneReporter, StoredDynamicDataSource};
+use graph::components::versions::VERSIONS;
+use graph::data::query::Trace;
+use graph::data::subgraph::{status, SPEC_VERSION_0_0_6};
+use graph::prelude::{
+    tokio, ApiVersion, CancelHandle, CancelToken, CancelableError, EntityOperation, PoolWaitStats,
+    SubgraphDeploymentEntity,
+};
+use graph::semver::Version;
+use lru_time_cache::LruCache;
+use rand::{seq::SliceRandom, thread_rng};
+use std::borrow::Cow;
+use std::collections::{BTreeMap, HashMap};
+use std::convert::Into;
+use std::iter::FromIterator;
+use std::ops::Bound;
+use std::ops::Deref;
+use std::str::FromStr;
+use std::sync::{atomic::AtomicUsize, Arc, Mutex};
+use std::time::Instant;
+
+use graph::components::store::EntityCollection;
+use graph::components::subgraph::{ProofOfIndexingFinisher, ProofOfIndexingVersion};
+use graph::constraint_violation;
+use graph::data::subgraph::schema::{DeploymentCreate, SubgraphError, POI_OBJECT};
+use graph::prelude::{
+    anyhow, debug, info, o, warn, web3, ApiSchema, AttributeNames, BlockNumber, BlockPtr,
+    CheapClone, DeploymentHash, DeploymentState, Entity, EntityModification, EntityQuery, Error,
+    Logger, QueryExecutionError, Schema, StopwatchMetrics, StoreError, StoreEvent, UnfailOutcome,
+    Value, ENV_VARS,
+};
+use graph_graphql::prelude::api_schema;
+use web3::types::Address;
+
+use crate::block_range::block_number;
+use crate::catalog;
+use crate::deployment;
+use crate::detail::ErrorDetail;
+use crate::dynds::DataSourcesTable;
+use crate::relational::{Layout, LayoutCache, SqlName, Table};
+use crate::relational_queries::FromEntityData;
+use crate::{connection_pool::ConnectionPool, detail};
+use crate::{dynds, primary::Site};
+
+/// When connected to read replicas, this allows choosing which DB server to use for an operation.
+#[derive(Copy, Clone, Debug, PartialEq, Eq)]
+pub enum ReplicaId {
+    /// The main server has write and read access.
+    Main,
+
+    /// A read replica identified by its index.
+    ReadOnly(usize),
+}
+
+/// Commonly needed information about a subgraph that we cache in
+/// `Store.subgraph_cache`. Only immutable subgraph data can be cached this
+/// way as the cache lives for the lifetime of the `Store` object
+#[derive(Clone)]
+pub(crate) struct SubgraphInfo {
+    /// The schema as supplied by the user
+    pub(crate) input: Arc<Schema>,
+    /// The schema we derive from `input` with `graphql::schema::api::api_schema`
+    pub(crate) api: HashMap<ApiVersion, Arc<ApiSchema>>,
+    /// The block number at which this subgraph was grafted onto
+    /// another one. We do not allow reverting past this block
+    pub(crate) graft_block: Option<BlockNumber>,
+    /// The deployment hash of the remote subgraph whose store
+    /// will be GraphQL queried, for debugging purposes.
+    pub(crate) debug_fork: Option<DeploymentHash>,
+    pub(crate) description: Option<String>,
+    pub(crate) repository: Option<String>,
+    pub(crate) poi_version: ProofOfIndexingVersion,
+}
+
+pub struct StoreInner {
+    logger: Logger,
+
+    pool: ConnectionPool,
+    read_only_pools: Vec<ConnectionPool>,
+
+    /// A list of the available replicas set up such that when we run
+    /// through the list once, we picked each replica according to its
+    /// desired weight. Each replica can appear multiple times in the list
+    replica_order: Vec<ReplicaId>,
+    /// The current position in `replica_order` so we know which one to
+    /// pick next
+    conn_round_robin_counter: AtomicUsize,
+
+    /// A cache of commonly needed data about a subgraph.
+    subgraph_cache: Mutex<LruCache<DeploymentHash, SubgraphInfo>>,
+
+    /// A cache for the layout metadata for subgraphs. The Store just
+    /// hosts this because it lives long enough, but it is managed from
+    /// the entities module
+    pub(crate) layout_cache: LayoutCache,
+}
+
+/// Storage of the data for individual deployments. Each `DeploymentStore`
+/// corresponds to one of the database shards that `SubgraphStore` manages.
+#[derive(Clone)]
+pub struct DeploymentStore(Arc<StoreInner>);
+
+impl CheapClone for DeploymentStore {}
+
+impl Deref for DeploymentStore {
+    type Target = StoreInner;
+    fn deref(&self) -> &Self::Target {
+        &self.0
+    }
+}
+
+impl DeploymentStore {
+    pub fn new(
+        logger: &Logger,
+        pool: ConnectionPool,
+        read_only_pools: Vec<ConnectionPool>,
+        mut pool_weights: Vec<usize>,
+    ) -> Self {
+        // Create a store-specific logger
+        let logger = logger.new(o!("component" => "Store"));
+
+        // Create a list of replicas with repetitions according to the weights
+        // and shuffle the resulting list. Any missing weights in the list
+        // default to 1
+        pool_weights.resize(read_only_pools.len() + 1, 1);
+        let mut replica_order: Vec<_> = pool_weights
+            .iter()
+            .enumerate()
+            .map(|(i, weight)| {
+                let replica = if i == 0 {
+                    ReplicaId::Main
+                } else {
+                    ReplicaId::ReadOnly(i - 1)
+                };
+                vec![replica; *weight]
+            })
+            .flatten()
+            .collect();
+        let mut rng = thread_rng();
+        replica_order.shuffle(&mut rng);
+        debug!(logger, "Using postgres host order {:?}", replica_order);
+
+        // Create the store
+        let store = StoreInner {
+            logger: logger.clone(),
+            pool,
+            read_only_pools,
+            replica_order,
+            conn_round_robin_counter: AtomicUsize::new(0),
+            subgraph_cache: Mutex::new(LruCache::with_capacity(100)),
+            layout_cache: LayoutCache::new(ENV_VARS.store.query_stats_refresh_interval),
+        };
+
+        DeploymentStore(Arc::new(store))
+    }
+
+    pub(crate) fn create_deployment(
+        &self,
+        schema: &Schema,
+        deployment: DeploymentCreate,
+        site: Arc<Site>,
+        graft_base: Option<Arc<Layout>>,
+        replace: bool,
+    ) -> Result<(), StoreError> {
+        let conn = self.get_conn()?;
+        conn.transaction(|| -> Result<_, StoreError> {
+            let exists = deployment::exists(&conn, &site)?;
+
+            // Create (or update) the metadata. Update only happens in tests
+            if replace || !exists {
+                deployment::create_deployment(&conn, &site, deployment, exists, replace)?;
+            };
+
+            // Create the schema for the subgraph data
+            if !exists {
+                let query = format!("create schema {}", &site.namespace);
+                conn.batch_execute(&query)?;
+
+                let layout = Layout::create_relational_schema(&conn, site.clone(), schema)?;
+                // See if we are grafting and check that the graft is permissible
+                if let Some(base) = graft_base {
+                    let errors = layout.can_copy_from(&base);
+                    if !errors.is_empty() {
+                        return Err(StoreError::Unknown(anyhow!(
+                            "The subgraph `{}` cannot be used as the graft base \
+                             for `{}` because the schemas are incompatible:\n    - {}",
+                            &base.catalog.site.namespace,
+                            &layout.catalog.site.namespace,
+                            errors.join("\n    - ")
+                        )));
+                    }
+                }
+
+                // Create data sources table
+                if site.schema_version.private_data_sources() {
+                    conn.batch_execute(&DataSourcesTable::new(site.namespace.clone()).as_ddl())?;
+                }
+            }
+            Ok(())
+        })
+    }
+
+    pub(crate) fn load_deployment(
+        &self,
+        site: &Site,
+    ) -> Result<SubgraphDeploymentEntity, StoreError> {
+        let conn = self.get_conn()?;
+        detail::deployment_entity(&conn, site)
+    }
+
+    // Remove the data and metadata for the deployment `site`. This operation
+    // is not reversible
+    pub(crate) fn drop_deployment(&self, site: &Site) -> Result<(), StoreError> {
+        let conn = self.get_conn()?;
+        conn.transaction(|| {
+            crate::deployment::drop_schema(&conn, &site.namespace)?;
+            if !site.schema_version.private_data_sources() {
+                crate::dynds::shared::drop(&conn, &site.deployment)?;
+            }
+            crate::deployment::drop_metadata(&conn, site)
+        })
+    }
+
+    pub(crate) fn execute_query<T: FromEntityData>(
+        &self,
+        conn: &PgConnection,
+        site: Arc<Site>,
+        query: EntityQuery,
+    ) -> Result<(Vec<T>, Trace), QueryExecutionError> {
+        let layout = self.layout(conn, site)?;
+
+        let logger = query.logger.unwrap_or_else(|| self.logger.clone());
+        layout.query(
+            &logger,
+            conn,
+            query.collection,
+            query.filter,
+            query.order,
+            query.range,
+            query.block,
+            query.query_id,
+        )
+    }
+
+    fn check_interface_entity_uniqueness(
+        &self,
+        conn: &PgConnection,
+        layout: &Layout,
+        key: &EntityKey,
+    ) -> Result<(), StoreError> {
+        // Collect all types that share an interface implementation with this
+        // entity type, and make sure there are no conflicting IDs.
+        //
+        // To understand why this is necessary, suppose that `Dog` and `Cat` are
+        // types and both implement an interface `Pet`, and both have instances
+        // with `id: "Fred"`. If a type `PetOwner` has a field `pets: [Pet]`
+        // then with the value `pets: ["Fred"]`, there's no way to disambiguate
+        // if that's Fred the Dog, Fred the Cat or both.
+        //
+        // This assumes that there are no concurrent writes to a subgraph.
+        let schema = self
+            .subgraph_info_with_conn(conn, &layout.site)?
+            .api
+            .get(&Default::default())
+            .expect("API schema should be present")
+            .clone();
+        let types_for_interface = schema.types_for_interface();
+        let entity_type = key.entity_type.to_string();
+        let types_with_shared_interface = Vec::from_iter(
+            schema
+                .interfaces_for_type(&key.entity_type)
+                .into_iter()
+                .flatten()
+                .map(|interface| &types_for_interface[&interface.into()])
+                .flatten()
+                .map(EntityType::from)
+                .filter(|type_name| type_name != &key.entity_type),
+        );
+
+        if !types_with_shared_interface.is_empty() {
+            if let Some(conflicting_entity) =
+                layout.conflicting_entity(conn, &key.entity_id, types_with_shared_interface)?
+            {
+                return Err(StoreError::ConflictingId(
+                    entity_type,
+                    key.entity_id.to_string(),
+                    conflicting_entity,
+                ));
+            }
+        }
+        Ok(())
+    }
+
+    fn apply_entity_modifications(
+        &self,
+        conn: &PgConnection,
+        layout: &Layout,
+        mods: &[EntityModification],
+        ptr: &BlockPtr,
+        stopwatch: &StopwatchMetrics,
+    ) -> Result<i32, StoreError> {
+        use EntityModification::*;
+        let mut count = 0;
+
+        // Group `Insert`s and `Overwrite`s by key, and accumulate `Remove`s.
+        let mut inserts = HashMap::new();
+        let mut overwrites = HashMap::new();
+        let mut removals = HashMap::new();
+        for modification in mods.into_iter() {
+            match modification {
+                Insert { key, data } => {
+                    inserts
+                        .entry(key.entity_type.clone())
+                        .or_insert_with(Vec::new)
+                        .push((key, Cow::from(data)));
+                }
+                Overwrite { key, data } => {
+                    overwrites
+                        .entry(key.entity_type.clone())
+                        .or_insert_with(Vec::new)
+                        .push((key, Cow::from(data)));
+                }
+                Remove { key } => {
+                    removals
+                        .entry(key.entity_type.clone())
+                        .or_insert_with(Vec::new)
+                        .push(key.entity_id.as_str());
+                }
+            }
+        }
+
+        // Apply modification groups.
+        // Inserts:
+        for (entity_type, mut entities) in inserts.into_iter() {
+            count +=
+                self.insert_entities(&entity_type, &mut entities, conn, layout, ptr, stopwatch)?
+                    as i32
+        }
+
+        // Overwrites:
+        for (entity_type, mut entities) in overwrites.into_iter() {
+            // we do not update the count since the number of entities remains the same
+            self.overwrite_entities(&entity_type, &mut entities, conn, layout, ptr, stopwatch)?;
+        }
+
+        // Removals
+        for (entity_type, entity_keys) in removals.into_iter() {
+            count -= self.remove_entities(
+                &entity_type,
+                entity_keys.as_slice(),
+                conn,
+                layout,
+                ptr,
+                stopwatch,
+            )? as i32;
+        }
+        Ok(count)
+    }
+
+    fn insert_entities<'a>(
+        &'a self,
+        entity_type: &'a EntityType,
+        data: &'a mut [(&'a EntityKey, Cow<'a, Entity>)],
+        conn: &PgConnection,
+        layout: &'a Layout,
+        ptr: &BlockPtr,
+        stopwatch: &StopwatchMetrics,
+    ) -> Result<usize, StoreError> {
+        let section = stopwatch.start_section("check_interface_entity_uniqueness");
+        for (key, _) in data.iter() {
+            // WARNING: This will potentially execute 2 queries for each entity key.
+            self.check_interface_entity_uniqueness(conn, layout, key)?;
+        }
+        section.end();
+
+        let _section = stopwatch.start_section("apply_entity_modifications_insert");
+        layout.insert(conn, entity_type, data, block_number(ptr), stopwatch)
+    }
+
+    fn overwrite_entities<'a>(
+        &'a self,
+        entity_type: &'a EntityType,
+        data: &'a mut [(&'a EntityKey, Cow<'a, Entity>)],
+        conn: &PgConnection,
+        layout: &'a Layout,
+        ptr: &BlockPtr,
+        stopwatch: &StopwatchMetrics,
+    ) -> Result<usize, StoreError> {
+        let section = stopwatch.start_section("check_interface_entity_uniqueness");
+        for (key, _) in data.iter() {
+            // WARNING: This will potentially execute 2 queries for each entity key.
+            self.check_interface_entity_uniqueness(conn, layout, key)?;
+        }
+        section.end();
+
+        let _section = stopwatch.start_section("apply_entity_modifications_update");
+        layout.update(conn, entity_type, data, block_number(ptr), stopwatch)
+    }
+
+    fn remove_entities(
+        &self,
+        entity_type: &EntityType,
+        entity_keys: &[&str],
+        conn: &PgConnection,
+        layout: &Layout,
+        ptr: &BlockPtr,
+        stopwatch: &StopwatchMetrics,
+    ) -> Result<usize, StoreError> {
+        let _section = stopwatch.start_section("apply_entity_modifications_delete");
+        layout
+            .delete(conn, entity_type, entity_keys, block_number(ptr), stopwatch)
+            .map_err(|_error| anyhow!("Failed to remove entities: {:?}", entity_keys).into())
+    }
+
+    /// Execute a closure with a connection to the database.
+    ///
+    /// # API
+    ///   The API of using a closure to bound the usage of the connection serves several
+    ///   purposes:
+    ///
+    ///   * Moves blocking database access out of the `Future::poll`. Within
+    ///     `Future::poll` (which includes all `async` methods) it is illegal to
+    ///     perform a blocking operation. This includes all accesses to the
+    ///     database, acquiring of locks, etc. Calling a blocking operation can
+    ///     cause problems with `Future` combinators (including but not limited
+    ///     to select, timeout, and FuturesUnordered) and problems with
+    ///     executors/runtimes. This method moves the database work onto another
+    ///     thread in a way which does not block `Future::poll`.
+    ///
+    ///   * Limit the total number of connections. Because the supplied closure
+    ///     takes a reference, we know the scope of the usage of all entity
+    ///     connections and can limit their use in a non-blocking way.
+    ///
+    /// # Cancellation
+    ///   The normal pattern for futures in Rust is drop to cancel. Once we
+    ///   spawn the database work in a thread though, this expectation no longer
+    ///   holds because the spawned task is the independent of this future. So,
+    ///   this method provides a cancel token which indicates that the `Future`
+    ///   has been dropped. This isn't *quite* as good as drop on cancel,
+    ///   because a drop on cancel can do things like cancel http requests that
+    ///   are in flight, but checking for cancel periodically is a significant
+    ///   improvement.
+    ///
+    ///   The implementation of the supplied closure should check for cancel
+    ///   between every operation that is potentially blocking. This includes
+    ///   any method which may interact with the database. The check can be
+    ///   conveniently written as `token.check_cancel()?;`. It is low overhead
+    ///   to check for cancel, so when in doubt it is better to have too many
+    ///   checks than too few.
+    ///
+    /// # Panics:
+    ///   * This task will panic if the supplied closure panics
+    ///   * This task will panic if the supplied closure returns Err(Cancelled)
+    ///     when the supplied cancel token is not cancelled.
+    pub(crate) async fn with_conn<T: Send + 'static>(
+        &self,
+        f: impl 'static
+            + Send
+            + FnOnce(
+                &PooledConnection<ConnectionManager<PgConnection>>,
+                &CancelHandle,
+            ) -> Result<T, CancelableError<StoreError>>,
+    ) -> Result<T, StoreError> {
+        self.pool.with_conn(f).await
+    }
+
+    /// Deprecated. Use `with_conn` instead.
+    fn get_conn(&self) -> Result<PooledConnection<ConnectionManager<PgConnection>>, StoreError> {
+        self.pool.get()
+    }
+
+    /// Panics if `idx` is not a valid index for a read only pool.
+    fn read_only_conn(
+        &self,
+        idx: usize,
+    ) -> Result<PooledConnection<ConnectionManager<PgConnection>>, Error> {
+        self.read_only_pools[idx].get().map_err(Error::from)
+    }
+
+    pub(crate) fn get_replica_conn(
+        &self,
+        replica: ReplicaId,
+    ) -> Result<PooledConnection<ConnectionManager<PgConnection>>, Error> {
+        let conn = match replica {
+            ReplicaId::Main => self.get_conn()?,
+            ReplicaId::ReadOnly(idx) => self.read_only_conn(idx)?,
+        };
+        Ok(conn)
+    }
+
+    pub(crate) async fn query_permit(
+        &self,
+        replica: ReplicaId,
+    ) -> Result<tokio::sync::OwnedSemaphorePermit, StoreError> {
+        let pool = match replica {
+            ReplicaId::Main => &self.pool,
+            ReplicaId::ReadOnly(idx) => &self.read_only_pools[idx],
+        };
+        pool.query_permit().await
+    }
+
+    pub(crate) fn wait_stats(&self, replica: ReplicaId) -> Result<PoolWaitStats, StoreError> {
+        match replica {
+            ReplicaId::Main => self.pool.wait_stats(),
+            ReplicaId::ReadOnly(idx) => self.read_only_pools[idx].wait_stats(),
+        }
+    }
+
+    /// Return the layout for a deployment. Since constructing a `Layout`
+    /// object takes a bit of computation, we cache layout objects that do
+    /// not have a pending migration in the Store, i.e., for the lifetime of
+    /// the Store. Layout objects with a pending migration can not be
+    /// cached for longer than a transaction since they might change
+    /// without us knowing
+    pub(crate) fn layout(
+        &self,
+        conn: &PgConnection,
+        site: Arc<Site>,
+    ) -> Result<Arc<Layout>, StoreError> {
+        self.layout_cache.get(&self.logger, conn, site)
+    }
+
+    /// Return the layout for a deployment. This might use a database
+    /// connection for the lookup and should only be called if the caller
+    /// does not have a connection currently. If it does, use `layout`
+    pub(crate) fn find_layout(&self, site: Arc<Site>) -> Result<Arc<Layout>, StoreError> {
+        if let Some(layout) = self.layout_cache.find(site.as_ref()) {
+            return Ok(layout);
+        }
+
+        let conn = self.get_conn()?;
+        self.layout(&conn, site)
+    }
+
+    fn subgraph_info_with_conn(
+        &self,
+        conn: &PgConnection,
+        site: &Site,
+    ) -> Result<SubgraphInfo, StoreError> {
+        if let Some(info) = self.subgraph_cache.lock().unwrap().get(&site.deployment) {
+            return Ok(info.clone());
+        }
+
+        let (input_schema, description, repository, spec_version) =
+            deployment::manifest_info(conn, site)?;
+
+        let graft_block =
+            deployment::graft_point(conn, &site.deployment)?.map(|(_, ptr)| ptr.number as i32);
+
+        let debug_fork = deployment::debug_fork(conn, &site.deployment)?;
+
+        // Generate an API schema for the subgraph and make sure all types in the
+        // API schema have a @subgraphId directive as well
+        let mut api: HashMap<ApiVersion, Arc<ApiSchema>> = HashMap::new();
+
+        for version in VERSIONS.iter() {
+            let api_version = ApiVersion::from_version(version).expect("Invalid API version");
+            let mut schema = input_schema.clone();
+            schema.document =
+                api_schema(&schema.document).map_err(|e| StoreError::Unknown(e.into()))?;
+            schema.add_subgraph_id_directives(site.deployment.clone());
+            api.insert(api_version, Arc::new(ApiSchema::from_api_schema(schema)?));
+        }
+
+        let spec_version = Version::from_str(&spec_version).map_err(anyhow::Error::from)?;
+        let poi_version = if spec_version.ge(&SPEC_VERSION_0_0_6) {
+            ProofOfIndexingVersion::Fast
+        } else {
+            ProofOfIndexingVersion::Legacy
+        };
+
+        let info = SubgraphInfo {
+            input: Arc::new(input_schema),
+            api,
+            graft_block,
+            debug_fork,
+            description,
+            repository,
+            poi_version,
+        };
+
+        // Insert the schema into the cache.
+        let mut cache = self.subgraph_cache.lock().unwrap();
+        cache.insert(site.deployment.clone(), info);
+
+        Ok(cache.get(&site.deployment).unwrap().clone())
+    }
+
+    pub(crate) fn subgraph_info(&self, site: &Site) -> Result<SubgraphInfo, StoreError> {
+        if let Some(info) = self.subgraph_cache.lock().unwrap().get(&site.deployment) {
+            return Ok(info.clone());
+        }
+
+        let conn = self.get_conn()?;
+        self.subgraph_info_with_conn(&conn, site)
+    }
+
+    fn block_ptr_with_conn(
+        conn: &PgConnection,
+        site: Arc<Site>,
+    ) -> Result<Option<BlockPtr>, StoreError> {
+        deployment::block_ptr(conn, &site.deployment)
+    }
+
+    pub(crate) fn deployment_details(
+        &self,
+        ids: Vec<String>,
+    ) -> Result<Vec<DeploymentDetail>, StoreError> {
+        let conn = self.get_conn()?;
+        conn.transaction(|| -> Result<_, StoreError> { detail::deployment_details(&conn, ids) })
+    }
+
+    pub(crate) fn deployment_statuses(
+        &self,
+        sites: &[Arc<Site>],
+    ) -> Result<Vec<status::Info>, StoreError> {
+        let conn = self.get_conn()?;
+        conn.transaction(|| -> Result<Vec<status::Info>, StoreError> {
+            detail::deployment_statuses(&conn, sites)
+        })
+    }
+
+    pub(crate) fn deployment_exists_and_synced(
+        &self,
+        id: &DeploymentHash,
+    ) -> Result<bool, StoreError> {
+        let conn = self.get_conn()?;
+        deployment::exists_and_synced(&conn, id.as_str())
+    }
+
+    pub(crate) fn deployment_synced(&self, id: &DeploymentHash) -> Result<(), StoreError> {
+        let conn = self.get_conn()?;
+        conn.transaction(|| deployment::set_synced(&conn, id))
+    }
+
+    // Only used for tests
+    #[cfg(debug_assertions)]
+    pub(crate) fn drop_deployment_schema(
+        &self,
+        namespace: &crate::primary::Namespace,
+    ) -> Result<(), StoreError> {
+        let conn = self.get_conn()?;
+        deployment::drop_schema(&conn, namespace)
+    }
+
+    // Only used for tests
+    #[cfg(debug_assertions)]
+    pub(crate) fn drop_all_metadata(&self) -> Result<(), StoreError> {
+        // Delete metadata entities in each shard
+
+        // This needs to touch all the tables in the subgraphs schema
+        const QUERY: &str = "
+        delete from subgraphs.dynamic_ethereum_contract_data_source;
+        delete from subgraphs.subgraph;
+        delete from subgraphs.subgraph_deployment;
+        delete from subgraphs.subgraph_deployment_assignment;
+        delete from subgraphs.subgraph_version;
+        delete from subgraphs.subgraph_manifest;
+        delete from subgraphs.copy_table_state;
+        delete from subgraphs.copy_state;
+        delete from active_copies;
+    ";
+
+        let conn = self.get_conn()?;
+        conn.batch_execute(QUERY)?;
+        conn.batch_execute("delete from deployment_schemas;")?;
+        Ok(())
+    }
+
+    pub(crate) async fn vacuum(&self) -> Result<(), StoreError> {
+        self.with_conn(|conn, _| {
+            conn.batch_execute("vacuum (analyze) subgraphs.subgraph_deployment")?;
+            Ok(())
+        })
+        .await
+    }
+
+    /// Runs the SQL `ANALYZE` command in a table.
+    pub(crate) fn analyze(&self, site: Arc<Site>, entity_name: &str) -> Result<(), StoreError> {
+        let conn = self.get_conn()?;
+        self.analyze_with_conn(site, entity_name, &conn)
+    }
+
+    /// Runs the SQL `ANALYZE` command in a table, with a shared connection.
+    pub(crate) fn analyze_with_conn(
+        &self,
+        site: Arc<Site>,
+        entity_name: &str,
+        conn: &PgConnection,
+    ) -> Result<(), StoreError> {
+        let store = self.clone();
+        let entity_name = entity_name.to_owned();
+        let layout = store.layout(&conn, site)?;
+        let table = resolve_table_name(&layout, &entity_name)?;
+        table.analyze(conn)
+    }
+
+    /// Creates a new index in the specified Entity table if it doesn't already exist.
+    ///
+    /// This is a potentially time-consuming operation.
+    pub(crate) async fn create_manual_index(
+        &self,
+        site: Arc<Site>,
+        entity_name: &str,
+        field_names: Vec<String>,
+        index_method: String,
+    ) -> Result<(), StoreError> {
+        let store = self.clone();
+        let entity_name = entity_name.to_owned();
+        self.with_conn(move |conn, _| {
+            let schema_name = site.namespace.clone();
+            let layout = store.layout(conn, site)?;
+            let table = resolve_table_name(&layout, &entity_name)?;
+            let column_names = resolve_column_names(table, &field_names)?;
+            let column_names_sep_by_underscores = column_names.join("_");
+            let column_names_sep_by_commas = column_names.join(", ");
+            let table_name = &table.name;
+            let index_name = format!("manual_{table_name}_{column_names_sep_by_underscores}");
+            let sql = format!(
+                "create index concurrently if not exists {index_name} \
+                 on {schema_name}.{table_name} using {index_method} \
+                 ({column_names_sep_by_commas})"
+            );
+            // This might take a long time.
+            conn.execute(&sql)?;
+            // check if the index creation was successfull
+            let index_is_valid =
+                catalog::check_index_is_valid(conn, schema_name.as_str(), &index_name)?;
+            if index_is_valid {
+                Ok(())
+            } else {
+                // Index creation falied. We should drop the index before returning.
+                let drop_index_sql =
+                    format!("drop index concurrently if exists {schema_name}.{index_name}");
+                conn.execute(&drop_index_sql)?;
+                Err(StoreError::Canceled)
+            }
+            .map_err(Into::into)
+        })
+        .await
+    }
+
+    /// Returns a list of all existing indexes for the specified Entity table.
+    pub(crate) async fn indexes_for_entity(
+        &self,
+        site: Arc<Site>,
+        entity_name: &str,
+    ) -> Result<Vec<String>, StoreError> {
+        let store = self.clone();
+        let entity_name = entity_name.to_owned();
+        self.with_conn(move |conn, _| {
+            let schema_name = site.namespace.clone();
+            let layout = store.layout(conn, site)?;
+            let table = resolve_table_name(&layout, &entity_name)?;
+            let table_name = &table.name;
+            catalog::indexes_for_table(conn, schema_name.as_str(), table_name.as_str())
+                .map_err(Into::into)
+        })
+        .await
+    }
+
+    /// Drops an index for a given deployment, concurrently.
+    pub(crate) async fn drop_index(
+        &self,
+        site: Arc<Site>,
+        index_name: &str,
+    ) -> Result<(), StoreError> {
+        let index_name = String::from(index_name);
+        self.with_conn(move |conn, _| {
+            let schema_name = site.namespace.clone();
+            catalog::drop_index(conn, schema_name.as_str(), &index_name).map_err(Into::into)
+        })
+        .await
+    }
+
+    pub(crate) async fn set_account_like(
+        &self,
+        site: Arc<Site>,
+        table: &str,
+        is_account_like: bool,
+    ) -> Result<(), StoreError> {
+        let store = self.clone();
+        let table = table.to_string();
+        self.with_conn(move |conn, _| {
+            let layout = store.layout(conn, site.clone())?;
+            let table = resolve_table_name(&layout, &table)?;
+            catalog::set_account_like(conn, &site, &table.name, is_account_like).map_err(Into::into)
+        })
+        .await
+    }
+
+    pub(crate) async fn prune(
+        self: &Arc<Self>,
+        mut reporter: Box<dyn PruneReporter>,
+        site: Arc<Site>,
+        earliest_block: BlockNumber,
+        reorg_threshold: BlockNumber,
+        prune_ratio: f64,
+    ) -> Result<Box<dyn PruneReporter>, StoreError> {
+        let store = self.clone();
+        self.with_conn(move |conn, cancel| {
+            let layout = store.layout(conn, site.clone())?;
+            cancel.check_cancel()?;
+            let state = deployment::state(&conn, site.deployment.clone())?;
+
+            if state.latest_block.number <= reorg_threshold {
+                return Ok(reporter);
+            }
+
+            if state.earliest_block_number > earliest_block {
+                return Err(constraint_violation!("earliest block can not move back from {} to {}", state.earliest_block_number, earliest_block).into());
+            }
+
+            let final_block = state.latest_block.number - reorg_threshold;
+            if final_block <= earliest_block {
+                return Err(constraint_violation!("the earliest block {} must be at least {} blocks before the current latest block {}", earliest_block, reorg_threshold, state.latest_block.number).into());
+            }
+
+            if let Some((_, graft)) = deployment::graft_point(conn, &site.deployment)? {
+                if graft.block_number() >= earliest_block {
+                    return Err(constraint_violation!("the earliest block {} must be after the graft point {}", earliest_block, graft.block_number()).into());
+                }
+            }
+
+            cancel.check_cancel()?;
+
+            conn.transaction(|| {
+                deployment::set_earliest_block(conn, site.as_ref(), earliest_block)
+            })?;
+
+            cancel.check_cancel()?;
+
+            layout.prune_by_copying(
+                &store.logger,
+                reporter.as_mut(),
+                conn,
+                earliest_block,
+                final_block,
+                prune_ratio,
+                cancel,
+            )?;
+            Ok(reporter)
+        })
+        .await
+    }
+}
+
+/// Methods that back the trait `graph::components::Store`, but have small
+/// variations in their signatures
+impl DeploymentStore {
+    pub(crate) async fn block_ptr(&self, site: Arc<Site>) -> Result<Option<BlockPtr>, StoreError> {
+        let site = site.cheap_clone();
+
+        self.with_conn(|conn, cancel| {
+            cancel.check_cancel()?;
+
+            Self::block_ptr_with_conn(&conn, site).map_err(Into::into)
+        })
+        .await
+    }
+
+    pub(crate) async fn block_cursor(&self, site: Arc<Site>) -> Result<FirehoseCursor, StoreError> {
+        let site = site.cheap_clone();
+
+        self.with_conn(|conn, cancel| {
+            cancel.check_cancel()?;
+
+            deployment::get_subgraph_firehose_cursor(&conn, site)
+                .map(FirehoseCursor::from)
+                .map_err(Into::into)
+        })
+        .await
+    }
+
+    pub(crate) async fn supports_proof_of_indexing<'a>(
+        &self,
+        site: Arc<Site>,
+    ) -> Result<bool, StoreError> {
+        let store = self.clone();
+        self.with_conn(move |conn, cancel| {
+            cancel.check_cancel()?;
+            let layout = store.layout(conn, site)?;
+            Ok(layout.supports_proof_of_indexing())
+        })
+        .await
+        .map_err(Into::into)
+    }
+
+    pub(crate) async fn get_proof_of_indexing(
+        &self,
+        site: Arc<Site>,
+        indexer: &Option<Address>,
+        block: BlockPtr,
+    ) -> Result<Option<[u8; 32]>, StoreError> {
+        let indexer = *indexer;
+        let site3 = site.cheap_clone();
+        let site4 = site.cheap_clone();
+        let site5 = site.cheap_clone();
+        let store = self.cheap_clone();
+        let block2 = block.cheap_clone();
+
+        let entities = self
+            .with_conn(move |conn, cancel| {
+                cancel.check_cancel()?;
+
+                let layout = store.layout(conn, site4.cheap_clone())?;
+
+                if !layout.supports_proof_of_indexing() {
+                    return Ok(None);
+                }
+
+                conn.transaction::<_, CancelableError<anyhow::Error>, _>(move || {
+                    let latest_block_ptr =
+                        match Self::block_ptr_with_conn(conn, site4.cheap_clone())? {
+                            Some(inner) => inner,
+                            None => return Ok(None),
+                        };
+
+                    cancel.check_cancel()?;
+
+                    // FIXME: (Determinism)
+                    //
+                    // It is vital to ensure that the block hash given in the query
+                    // is a parent of the latest block indexed for the subgraph.
+                    // Unfortunately the machinery needed to do this is not yet in place.
+                    // The best we can do right now is just to make sure that the block number
+                    // is high enough.
+                    if latest_block_ptr.number < block.number {
+                        return Ok(None);
+                    }
+
+                    let query = EntityQuery::new(
+                        site4.deployment.cheap_clone(),
+                        block.number,
+                        EntityCollection::All(vec![(
+                            POI_OBJECT.cheap_clone(),
+                            AttributeNames::All,
+                        )]),
+                    );
+                    let entities = store
+                        .execute_query::<Entity>(conn, site4, query)
+                        .map(|(entities, _)| entities)
+                        .map_err(anyhow::Error::from)?;
+
+                    Ok(Some(entities))
+                })
+                .map_err(Into::into)
+            })
+            .await?;
+
+        let entities = if let Some(entities) = entities {
+            entities
+        } else {
+            return Ok(None);
+        };
+
+        let mut by_causality_region = entities
+            .into_iter()
+            .map(|e| {
+                let causality_region = e.id()?;
+                let digest = match e.get("digest") {
+                    Some(Value::Bytes(b)) => Ok(b.to_owned()),
+                    other => Err(anyhow::anyhow!(
+                        "Entity has non-bytes digest attribute: {:?}",
+                        other
+                    )),
+                }?;
+
+                Ok((causality_region, digest))
+            })
+            .collect::<Result<HashMap<_, _>, anyhow::Error>>()?;
+
+        let info = self.subgraph_info(&site5).map_err(anyhow::Error::from)?;
+
+        let mut finisher = ProofOfIndexingFinisher::new(
+            &block2,
+            &site3.deployment,
+            &indexer,
+            info.poi_version.clone(),
+        );
+        for (name, region) in by_causality_region.drain() {
+            finisher.add_causality_region(&name, &region);
+        }
+
+        Ok(Some(finisher.finish()))
+    }
+
+    /// Get the entity matching `key` from the deployment `site`. Only
+    /// consider entities as of the given `block`
+    pub(crate) fn get(
+        &self,
+        site: Arc<Site>,
+        key: &EntityKey,
+        block: BlockNumber,
+    ) -> Result<Option<Entity>, StoreError> {
+        let conn = self.get_conn()?;
+        let layout = self.layout(&conn, site)?;
+        layout.find(&conn, &key.entity_type, &key.entity_id, block)
+    }
+
+    /// Retrieve all the entities matching `ids_for_type` from the
+    /// deployment `site`. Only consider entities as of the given `block`
+    pub(crate) fn get_many(
+        &self,
+        site: Arc<Site>,
+        ids_for_type: &BTreeMap<&EntityType, Vec<&str>>,
+        block: BlockNumber,
+    ) -> Result<BTreeMap<EntityType, Vec<Entity>>, StoreError> {
+        if ids_for_type.is_empty() {
+            return Ok(BTreeMap::new());
+        }
+        let conn = self.get_conn()?;
+        let layout = self.layout(&conn, site)?;
+
+        layout.find_many(&conn, ids_for_type, block)
+    }
+
+    pub(crate) fn get_changes(
+        &self,
+        site: Arc<Site>,
+        block: BlockNumber,
+    ) -> Result<Vec<EntityOperation>, StoreError> {
+        let conn = self.get_conn()?;
+        let layout = self.layout(&conn, site)?;
+        let changes = layout.find_changes(&conn, block)?;
+
+        Ok(changes)
+    }
+
+    // Only used by tests
+    #[cfg(debug_assertions)]
+    pub(crate) fn find(
+        &self,
+        site: Arc<Site>,
+        query: EntityQuery,
+    ) -> Result<Vec<Entity>, QueryExecutionError> {
+        let conn = self.get_conn()?;
+        self.execute_query(&conn, site, query)
+            .map(|(entities, _)| entities)
+    }
+
+    pub(crate) fn transact_block_operations(
+        &self,
+        site: Arc<Site>,
+        block_ptr_to: &BlockPtr,
+        firehose_cursor: &FirehoseCursor,
+        mods: &[EntityModification],
+        stopwatch: &StopwatchMetrics,
+        data_sources: &[StoredDynamicDataSource],
+        deterministic_errors: &[SubgraphError],
+        manifest_idx_and_name: &[(u32, String)],
+        offchain_to_remove: &[StoredDynamicDataSource],
+    ) -> Result<StoreEvent, StoreError> {
+        let conn = {
+            let _section = stopwatch.start_section("transact_blocks_get_conn");
+            self.get_conn()?
+        };
+
+        let event = conn.transaction(|| -> Result<_, StoreError> {
+            // Emit a store event for the changes we are about to make. We
+            // wait with sending it until we have done all our other work
+            // so that we do not hold a lock on the notification queue
+            // for longer than we have to
+            let event: StoreEvent = StoreEvent::from_mods(&site.deployment, mods);
+
+            // Make the changes
+            let layout = self.layout(&conn, site.clone())?;
+
+            //  see also: deployment-lock-for-update
+            deployment::lock(&conn, &site)?;
+
+            let section = stopwatch.start_section("apply_entity_modifications");
+            let count = self.apply_entity_modifications(
+                &conn,
+                layout.as_ref(),
+                mods,
+                block_ptr_to,
+                stopwatch,
+            )?;
+            section.end();
+
+            dynds::insert(
+                &conn,
+                &site,
+                data_sources,
+                block_ptr_to,
+                manifest_idx_and_name,
+            )?;
+
+            dynds::remove_offchain(&conn, &site, offchain_to_remove)?;
+
+            if !deterministic_errors.is_empty() {
+                deployment::insert_subgraph_errors(
+                    &conn,
+                    &site.deployment,
+                    deterministic_errors,
+                    block_ptr_to.block_number(),
+                )?;
+            }
+
+            deployment::transact_block(
+                &conn,
+                &site,
+                block_ptr_to,
+                firehose_cursor,
+                layout.count_query.as_str(),
+                count,
+            )?;
+
+            Ok(event)
+        })?;
+
+        Ok(event)
+    }
+
+    fn rewind_with_conn(
+        &self,
+        conn: &PgConnection,
+        site: Arc<Site>,
+        block_ptr_to: BlockPtr,
+        firehose_cursor: &FirehoseCursor,
+    ) -> Result<StoreEvent, StoreError> {
+        let event = conn.transaction(|| -> Result<_, StoreError> {
+            //  see also: deployment-lock-for-update
+            deployment::lock(conn, &site)?;
+
+            // Don't revert past a graft point
+            let info = self.subgraph_info_with_conn(conn, site.as_ref())?;
+            if let Some(graft_block) = info.graft_block {
+                if graft_block > block_ptr_to.number {
+                    return Err(anyhow!(
+                        "Can not revert subgraph `{}` to block {} as it was \
+                        grafted at block {} and reverting past a graft point \
+                        is not possible",
+                        site.deployment.clone(),
+                        block_ptr_to.number,
+                        graft_block
+                    )
+                    .into());
+                }
+            }
+
+            // The revert functions want the number of the first block that we need to get rid of
+            let block = block_ptr_to.number + 1;
+
+            deployment::revert_block_ptr(conn, &site.deployment, block_ptr_to, firehose_cursor)?;
+
+            // Revert the data
+            let layout = self.layout(conn, site.clone())?;
+
+            let (event, count) = layout.revert_block(conn, block)?;
+
+            // Revert the meta data changes that correspond to this subgraph.
+            // Only certain meta data changes need to be reverted, most
+            // importantly creation of dynamic data sources. We ensure in the
+            // rest of the code that we only record history for those meta data
+            // changes that might need to be reverted
+            Layout::revert_metadata(&conn, &site, block)?;
+
+            deployment::update_entity_count(
+                conn,
+                site.as_ref(),
+                layout.count_query.as_str(),
+                count,
+            )?;
+            Ok(event)
+        })?;
+
+        Ok(event)
+    }
+
+    pub(crate) fn rewind(
+        &self,
+        site: Arc<Site>,
+        block_ptr_to: BlockPtr,
+    ) -> Result<StoreEvent, StoreError> {
+        let conn = self.get_conn()?;
+
+        // Unwrap: If we are reverting then the block ptr is not `None`.
+        let block_ptr_from = Self::block_ptr_with_conn(&conn, site.cheap_clone())?.unwrap();
+
+        // Sanity check on block numbers
+        if block_ptr_from.number <= block_ptr_to.number {
+            constraint_violation!(
+                "rewind must go backwards, but would go from block {} to block {}",
+                block_ptr_from.number,
+                block_ptr_to.number
+            );
+        }
+
+        // When rewinding, we reset the firehose cursor. That way, on resume, Firehose will start
+        // from the block_ptr instead (with sanity check to ensure it's resume at the exact block).
+        self.rewind_with_conn(&conn, site, block_ptr_to, &FirehoseCursor::None)
+    }
+
+    pub(crate) fn revert_block_operations(
+        &self,
+        site: Arc<Site>,
+        block_ptr_to: BlockPtr,
+        firehose_cursor: &FirehoseCursor,
+    ) -> Result<StoreEvent, StoreError> {
+        let conn = self.get_conn()?;
+        // Unwrap: If we are reverting then the block ptr is not `None`.
+        let deployment_head = Self::block_ptr_with_conn(&conn, site.cheap_clone())?.unwrap();
+
+        // Confidence check on revert to ensure we go backward only
+        if block_ptr_to.number >= deployment_head.number {
+            panic!("revert_block_operations must revert only backward, you are trying to revert forward going from subgraph block {} to new block {}", deployment_head, block_ptr_to);
+        }
+
+        self.rewind_with_conn(&conn, site, block_ptr_to, firehose_cursor)
+    }
+
+    pub(crate) async fn deployment_state_from_id(
+        &self,
+        id: DeploymentHash,
+    ) -> Result<DeploymentState, StoreError> {
+        self.with_conn(|conn, _| deployment::state(conn, id).map_err(|e| e.into()))
+            .await
+    }
+
+    pub(crate) async fn fail_subgraph(
+        &self,
+        id: DeploymentHash,
+        error: SubgraphError,
+    ) -> Result<(), StoreError> {
+        self.with_conn(move |conn, _| {
+            conn.transaction(|| deployment::fail(&conn, &id, &error))
+                .map_err(Into::into)
+        })
+        .await?;
+        Ok(())
+    }
+
+    pub(crate) fn replica_for_query(
+        &self,
+        for_subscription: bool,
+    ) -> Result<ReplicaId, StoreError> {
+        use std::sync::atomic::Ordering;
+
+        let replica_id = match for_subscription {
+            // Pick a weighted ReplicaId. `replica_order` contains a list of
+            // replicas with repetitions according to their weight
+            false => {
+                let weights_count = self.replica_order.len();
+                let index =
+                    self.conn_round_robin_counter.fetch_add(1, Ordering::SeqCst) % weights_count;
+                *self.replica_order.get(index).unwrap()
+            }
+            // Subscriptions always go to the main replica.
+            true => ReplicaId::Main,
+        };
+
+        Ok(replica_id)
+    }
+
+    pub(crate) async fn load_dynamic_data_sources(
+        &self,
+        site: Arc<Site>,
+        block: BlockNumber,
+        manifest_idx_and_name: Vec<(u32, String)>,
+    ) -> Result<Vec<StoredDynamicDataSource>, StoreError> {
+        self.with_conn(move |conn, _| {
+            conn.transaction(|| crate::dynds::load(&conn, &site, block, manifest_idx_and_name))
+                .map_err(Into::into)
+        })
+        .await
+    }
+
+    pub(crate) async fn exists_and_synced(&self, id: DeploymentHash) -> Result<bool, StoreError> {
+        self.with_conn(move |conn, _| {
+            conn.transaction(|| deployment::exists_and_synced(conn, &id))
+                .map_err(Into::into)
+        })
+        .await
+    }
+
+    pub(crate) fn graft_pending(
+        &self,
+        id: &DeploymentHash,
+    ) -> Result<Option<(DeploymentHash, BlockPtr)>, StoreError> {
+        let conn = self.get_conn()?;
+        deployment::graft_pending(&conn, id)
+    }
+
+    /// Bring the subgraph into a state where we can start or resume
+    /// indexing.
+    ///
+    /// If `graft_src` is `Some(..)`, copy data from that subgraph. It
+    /// should only be `Some(..)` if we know we still need to copy data. The
+    /// code is idempotent so that a copy process that has been interrupted
+    /// can be resumed seamlessly, but the code sets the block pointer back
+    /// to the graph point, so that calling this needlessly with `Some(..)`
+    /// will remove any progress that might have been made since the last
+    /// time the deployment was started.
+    pub(crate) fn start_subgraph(
+        &self,
+        logger: &Logger,
+        site: Arc<Site>,
+        graft_src: Option<(Arc<Layout>, BlockPtr)>,
+    ) -> Result<(), StoreError> {
+        let dst = self.find_layout(site.cheap_clone())?;
+
+        // Do any cleanup to bring the subgraph into a known good state
+        if let Some((src, block)) = graft_src {
+            info!(
+                logger,
+                "Initializing graft by copying data from {} to {}",
+                src.catalog.site.namespace,
+                dst.catalog.site.namespace
+            );
+
+            // Copy subgraph data
+            // We allow both not copying tables at all from the source, as well
+            // as adding new tables in `self`; we only need to check that tables
+            // that actually need to be copied from the source are compatible
+            // with the corresponding tables in `self`
+            let copy_conn = crate::copy::Connection::new(
+                logger,
+                self.pool.clone(),
+                src.clone(),
+                dst.clone(),
+                block.clone(),
+            )?;
+            let status = copy_conn.copy_data()?;
+            if status == crate::copy::Status::Cancelled {
+                return Err(StoreError::Canceled);
+            }
+
+            let conn = self.get_conn()?;
+            conn.transaction(|| -> Result<(), StoreError> {
+                // Copy shared dynamic data sources and adjust their ID; if
+                // the subgraph uses private data sources, that is done by
+                // `copy::Connection::copy_data` since it requires access to
+                // the source schema which in sharded setups is only
+                // available while that function runs
+                let start = Instant::now();
+                let count = dynds::shared::copy(&conn, &src.site, &dst.site, block.number)?;
+                info!(logger, "Copied {} dynamic data sources", count;
+                      "time_ms" => start.elapsed().as_millis());
+
+                // Copy errors across
+                let start = Instant::now();
+                let count = deployment::copy_errors(&conn, &src.site, &dst.site, &block)?;
+                info!(logger, "Copied {} existing errors", count;
+                      "time_ms" => start.elapsed().as_millis());
+
+                catalog::copy_account_like(&conn, &src.site, &dst.site)?;
+
+                // Rewind the subgraph so that entity versions that are
+                // clamped in the future (beyond `block`) become valid for
+                // all blocks after `block`. `revert_block` gets rid of
+                // everything including the block passed to it. We want to
+                // preserve `block` and therefore revert `block+1`
+                let start = Instant::now();
+                let block_to_revert: BlockNumber = block
+                    .number
+                    .checked_add(1)
+                    .expect("block numbers fit into an i32");
+                dst.revert_block(&conn, block_to_revert)?;
+                info!(logger, "Rewound subgraph to block {}", block.number;
+                      "time_ms" => start.elapsed().as_millis());
+
+                let start = Instant::now();
+                deployment::set_entity_count(&conn, &dst.site, &dst.count_query)?;
+                info!(logger, "Counted the entities";
+                      "time_ms" => start.elapsed().as_millis());
+
+                // Analyze all tables for this deployment
+                for entity_name in dst.tables.keys() {
+                    self.analyze_with_conn(site.cheap_clone(), entity_name.as_str(), &conn)?;
+                }
+
+                // Set the block ptr to the graft point to signal that we successfully
+                // performed the graft
+                crate::deployment::forward_block_ptr(&conn, &dst.site.deployment, &block)?;
+                info!(logger, "Subgraph successfully initialized";
+                    "time_ms" => start.elapsed().as_millis());
+                Ok(())
+            })?;
+        }
+        // Make sure the block pointer is set. This is important for newly
+        // deployed subgraphs so that we respect the 'startBlock' setting
+        // the first time the subgraph is started
+        let conn = self.get_conn()?;
+        conn.transaction(|| crate::deployment::initialize_block_ptr(&conn, &dst.site))?;
+        Ok(())
+    }
+
+    // If the current block of the deployment is the same as the fatal error,
+    // we revert all block operations to it's parent/previous block.
+    //
+    // This should be called once per subgraph on `graph-node` initialization,
+    // before processing the first block on start.
+    //
+    // It will do nothing (early return) if:
+    //
+    // - There's no fatal error for the subgraph
+    // - The error is NOT deterministic
+    pub(crate) fn unfail_deterministic_error(
+        &self,
+        site: Arc<Site>,
+        current_ptr: &BlockPtr,
+        parent_ptr: &BlockPtr,
+    ) -> Result<UnfailOutcome, StoreError> {
+        let conn = &self.get_conn()?;
+        let deployment_id = &site.deployment;
+
+        conn.transaction(|| {
+            // We'll only unfail subgraphs that had fatal errors
+            let subgraph_error = match ErrorDetail::fatal(conn, deployment_id)? {
+                Some(fatal_error) => fatal_error,
+                // If the subgraph is not failed then there is nothing to do.
+                None => return Ok(UnfailOutcome::Noop),
+            };
+
+            // Confidence check
+            if !subgraph_error.deterministic {
+                return Ok(UnfailOutcome::Noop); // Nothing to do
+            }
+
+            use deployment::SubgraphHealth::*;
+            // Decide status based on if there are any errors for the previous/parent block
+            let prev_health =
+                if deployment::has_deterministic_errors(conn, deployment_id, parent_ptr.number)? {
+                    Unhealthy
+                } else {
+                    Healthy
+                };
+
+            match &subgraph_error.block_hash {
+                // The error happened for the current deployment head.
+                // We should revert everything (deployment head, subgraph errors, etc)
+                // to the previous/parent hash/block.
+                Some(bytes) if bytes == current_ptr.hash.as_slice() => {
+                    info!(
+                        self.logger,
+                        "Reverting errored block";
+                        "subgraph_id" => deployment_id,
+                        "from_block_number" => format!("{}", current_ptr.number),
+                        "from_block_hash" => format!("{}", current_ptr.hash),
+                        "to_block_number" => format!("{}", parent_ptr.number),
+                        "to_block_hash" => format!("{}", parent_ptr.hash),
+                    );
+
+                    // We ignore the StoreEvent that's being returned, we'll not use it.
+                    //
+                    // We reset the firehose cursor. That way, on resume, Firehose will start from
+                    // the block_ptr instead (with sanity checks to ensure it's resuming at the
+                    // correct block).
+                    let _ = self.revert_block_operations(site.clone(), parent_ptr.clone(), &FirehoseCursor::None)?;
+
+                    // Unfail the deployment.
+                    deployment::update_deployment_status(conn, deployment_id, prev_health, None)?;
+
+                    Ok(UnfailOutcome::Unfailed)
+                }
+                // Found error, but not for deployment head, we don't need to
+                // revert the block operations.
+                //
+                // If you find this warning in the logs, something is wrong, this
+                // shoudn't happen.
+                Some(hash_bytes) => {
+                    warn!(self.logger, "Subgraph error does not have same block hash as deployment head";
+                        "subgraph_id" => deployment_id,
+                        "error_id" => &subgraph_error.id,
+                        "error_block_hash" => format!("0x{}", hex::encode(&hash_bytes)),
+                        "deployment_head" => format!("{}", current_ptr.hash),
+                    );
+
+                    Ok(UnfailOutcome::Noop)
+                }
+                // Same as branch above, if you find this warning in the logs,
+                // something is wrong, this shouldn't happen.
+                None => {
+                    warn!(self.logger, "Subgraph error should have block hash";
+                        "subgraph_id" => deployment_id,
+                        "error_id" => &subgraph_error.id,
+                    );
+
+                    Ok(UnfailOutcome::Noop)
+                }
+            }
+        })
+    }
+
+    // If a non-deterministic error happens and the deployment head advances,
+    // we should unfail the subgraph (status: Healthy, failed: false) and delete
+    // the error itself.
+    //
+    // This should be called after successfully processing a block for a subgraph.
+    //
+    // It will do nothing (early return) if:
+    //
+    // - There's no fatal error for the subgraph
+    // - The error IS deterministic
+    pub(crate) fn unfail_non_deterministic_error(
+        &self,
+        site: Arc<Site>,
+        current_ptr: &BlockPtr,
+    ) -> Result<UnfailOutcome, StoreError> {
+        let conn = &self.get_conn()?;
+        let deployment_id = &site.deployment;
+
+        conn.transaction(|| {
+            // We'll only unfail subgraphs that had fatal errors
+            let subgraph_error = match ErrorDetail::fatal(conn, deployment_id)? {
+                Some(fatal_error) => fatal_error,
+                // If the subgraph is not failed then there is nothing to do.
+                None => return Ok(UnfailOutcome::Noop),
+            };
+
+            // Confidence check
+            if subgraph_error.deterministic {
+                return Ok(UnfailOutcome::Noop); // Nothing to do
+            }
+
+            match subgraph_error.block_range {
+                // Deployment head (current_ptr) advanced more than the error.
+                // That means it's healthy, and the non-deterministic error got
+                // solved (didn't happen on another try).
+                (Bound::Included(error_block_number), _)
+                    if current_ptr.number >= error_block_number =>
+                    {
+                        info!(
+                            self.logger,
+                            "Unfailing the deployment status";
+                            "subgraph_id" => deployment_id,
+                        );
+
+                        // Unfail the deployment.
+                        deployment::update_deployment_status(
+                            conn,
+                            deployment_id,
+                            deployment::SubgraphHealth::Healthy,
+                            None,
+                        )?;
+
+                        // Delete the fatal error.
+                        deployment::delete_error(conn, &subgraph_error.id)?;
+
+                        Ok(UnfailOutcome::Unfailed)
+                    }
+                // NOOP, the deployment head is still before where non-deterministic error happened.
+                block_range => {
+                    info!(
+                        self.logger,
+                        "Subgraph error is still ahead of deployment head, nothing to unfail";
+                        "subgraph_id" => deployment_id,
+                        "block_number" => format!("{}", current_ptr.number),
+                        "block_hash" => format!("{}", current_ptr.hash),
+                        "error_block_range" => format!("{:?}", block_range),
+                        "error_block_hash" => subgraph_error.block_hash.as_ref().map(|hash| format!("0x{}", hex::encode(hash))),
+                    );
+
+                    Ok(UnfailOutcome::Noop)
+                }
+            }
+        })
+    }
+
+    #[cfg(debug_assertions)]
+    pub fn error_count(&self, id: &DeploymentHash) -> Result<usize, StoreError> {
+        let conn = self.get_conn()?;
+        deployment::error_count(&conn, id)
+    }
+
+    pub(crate) async fn mirror_primary_tables(&self, logger: &Logger) {
+        self.pool.mirror_primary_tables().await.unwrap_or_else(|e| {
+            warn!(logger, "Mirroring primary tables failed. We will try again in a few minutes";
+                  "error" => e.to_string(),
+                  "shard" => self.pool.shard.as_str())
+        });
+    }
+
+    pub(crate) async fn health(
+        &self,
+        site: &Site,
+    ) -> Result<deployment::SubgraphHealth, StoreError> {
+        let id = site.id.clone();
+        self.with_conn(move |conn, _| deployment::health(conn, id).map_err(Into::into))
+            .await
+    }
+}
+
+/// Tries to fetch a [`Table`] either by its Entity name or its SQL name.
+///
+/// Since we allow our input to be either camel-case or snake-case, we must retry the
+/// search using the latter if the search for the former fails.
+fn resolve_table_name<'a>(layout: &'a Layout, name: &'_ str) -> Result<&'a Table, StoreError> {
+    layout
+        .table_for_entity(&EntityType::new(name.to_owned()))
+        .map(Deref::deref)
+        .or_else(|_error| {
+            let sql_name = SqlName::from(name);
+            layout
+                .table(&sql_name)
+                .ok_or_else(|| StoreError::UnknownTable(name.to_owned()))
+        })
+}
+
+// Resolves column names.
+//
+// Since we allow our input to be either camel-case or snake-case, we must retry the
+// search using the latter if the search for the former fails.
+fn resolve_column_names<'a, T: AsRef<str>>(
+    table: &'a Table,
+    field_names: &[T],
+) -> Result<Vec<&'a str>, StoreError> {
+    field_names
+        .iter()
+        .map(|f| {
+            table
+                .column_for_field(f.as_ref())
+                .or_else(|_error| {
+                    let sql_name = SqlName::from(f.as_ref());
+                    table
+                        .column(&sql_name)
+                        .ok_or_else(|| StoreError::UnknownField(f.as_ref().to_string()))
+                })
+                .map(|column| column.name.as_str())
+        })
+        .collect()
+}
diff --git a/store/postgres/src/detail.rs b/store/postgres/src/detail.rs
new file mode 100644
index 0000000..9f9b65c
--- /dev/null
+++ b/store/postgres/src/detail.rs
@@ -0,0 +1,494 @@
+//! Queries to support the index node API
+//!
+// For git_testament_macros
+#![allow(unused_macros)]
+use diesel::dsl;
+use diesel::prelude::{
+    ExpressionMethods, JoinOnDsl, NullableExpressionMethods, OptionalExtension, PgConnection,
+    QueryDsl, RunQueryDsl,
+};
+use diesel_derives::Associations;
+use git_testament::{git_testament, git_testament_macros};
+use graph::blockchain::BlockHash;
+use graph::data::subgraph::schema::{SubgraphError, SubgraphManifestEntity};
+use graph::prelude::{
+    bigdecimal::ToPrimitive, BigDecimal, BlockPtr, DeploymentHash, StoreError,
+    SubgraphDeploymentEntity,
+};
+use graph::{constraint_violation, data::subgraph::status, prelude::web3::types::H256};
+use itertools::Itertools;
+use std::convert::TryFrom;
+use std::{ops::Bound, sync::Arc};
+
+use crate::deployment::{
+    graph_node_versions, subgraph_deployment, subgraph_error, subgraph_manifest,
+    SubgraphHealth as HealthType,
+};
+use crate::primary::{DeploymentId, Site};
+
+git_testament_macros!(version);
+git_testament!(TESTAMENT);
+
+const CARGO_PKG_VERSION: &str = env!("CARGO_PKG_VERSION");
+const CARGO_PKG_VERSION_MAJOR: &str = env!("CARGO_PKG_VERSION_MAJOR");
+const CARGO_PKG_VERSION_MINOR: &str = env!("CARGO_PKG_VERSION_MINOR");
+const CARGO_PKG_VERSION_PATCH: &str = env!("CARGO_PKG_VERSION_PATCH");
+
+type Bytes = Vec<u8>;
+
+#[derive(Queryable, QueryableByName)]
+#[table_name = "subgraph_deployment"]
+// We map all fields to make loading `Detail` with diesel easier, but we
+// don't need all the fields
+#[allow(dead_code)]
+pub struct DeploymentDetail {
+    pub id: DeploymentId,
+    pub deployment: String,
+    pub failed: bool,
+    health: HealthType,
+    pub synced: bool,
+    fatal_error: Option<String>,
+    non_fatal_errors: Vec<String>,
+    // Not used anymore; only written to keep backwards compatible
+    earliest_ethereum_block_hash: Option<Bytes>,
+    earliest_ethereum_block_number: Option<BigDecimal>,
+    // New tracker for earliest block number
+    earliest_block_number: i32,
+    pub latest_ethereum_block_hash: Option<Bytes>,
+    pub latest_ethereum_block_number: Option<BigDecimal>,
+    last_healthy_ethereum_block_hash: Option<Bytes>,
+    last_healthy_ethereum_block_number: Option<BigDecimal>,
+    pub entity_count: BigDecimal,
+    graft_base: Option<String>,
+    graft_block_hash: Option<Bytes>,
+    graft_block_number: Option<BigDecimal>,
+    debug_fork: Option<String>,
+    reorg_count: i32,
+    current_reorg_depth: i32,
+    max_reorg_depth: i32,
+    firehose_cursor: Option<String>,
+}
+
+#[derive(Queryable, QueryableByName)]
+#[table_name = "subgraph_error"]
+// We map all fields to make loading `Detail` with diesel easier, but we
+// don't need all the fields
+#[allow(dead_code)]
+pub(crate) struct ErrorDetail {
+    vid: i64,
+    pub id: String,
+    subgraph_id: String,
+    message: String,
+    pub block_hash: Option<Bytes>,
+    handler: Option<String>,
+    pub deterministic: bool,
+    pub block_range: (Bound<i32>, Bound<i32>),
+}
+
+impl ErrorDetail {
+    /// Fetches the fatal error, if present, associated with the given
+    /// [`DeploymentHash`].
+    pub fn fatal(
+        conn: &PgConnection,
+        deployment_id: &DeploymentHash,
+    ) -> Result<Option<Self>, StoreError> {
+        use subgraph_deployment as d;
+        use subgraph_error as e;
+
+        d::table
+            .filter(d::deployment.eq(deployment_id.as_str()))
+            .inner_join(e::table.on(e::id.nullable().eq(d::fatal_error)))
+            .select(e::all_columns)
+            .get_result(conn)
+            .optional()
+            .map_err(StoreError::from)
+    }
+}
+
+impl TryFrom<ErrorDetail> for SubgraphError {
+    type Error = StoreError;
+
+    fn try_from(value: ErrorDetail) -> Result<Self, Self::Error> {
+        let ErrorDetail {
+            vid: _,
+            id: _,
+            subgraph_id,
+            message,
+            block_hash,
+            handler,
+            deterministic,
+            block_range,
+        } = value;
+        let block_number = crate::block_range::first_block_in_range(&block_range);
+        // FIXME:
+        //
+        // workaround for arweave
+        let block_hash = block_hash.map(|hash| H256::from_slice(&hash.as_slice()[..32]));
+        // In existing databases, we have errors that have a `block_range` of
+        // `UNVERSIONED_RANGE`, which leads to `None` as the block number, but
+        // has a hash. Conversely, it is also possible for an error to not have a
+        // hash. In both cases, use a block pointer of `None`
+        let block_ptr = match (block_number, block_hash) {
+            (Some(number), Some(hash)) => Some(BlockPtr::from((hash, number as u64))),
+            _ => None,
+        };
+        let subgraph_id = DeploymentHash::new(subgraph_id).map_err(|id| {
+            StoreError::ConstraintViolation(format!("invalid subgraph id `{}` in fatal error", id))
+        })?;
+        Ok(SubgraphError {
+            subgraph_id,
+            message,
+            block_ptr,
+            handler,
+            deterministic,
+        })
+    }
+}
+
+pub(crate) fn block(
+    id: &str,
+    name: &str,
+    hash: Option<Vec<u8>>,
+    number: Option<BigDecimal>,
+) -> Result<Option<status::EthereumBlock>, StoreError> {
+    match (hash, number) {
+        (Some(hash), Some(number)) => {
+            let number = number.to_i32().ok_or_else(|| {
+                constraint_violation!(
+                    "the block number {} for {} in {} is not representable as an i32",
+                    number,
+                    name,
+                    id
+                )
+            })?;
+            Ok(Some(status::EthereumBlock::new(
+                BlockHash(hash.into_boxed_slice()),
+                number,
+            )))
+        }
+        (None, None) => Ok(None),
+        (hash, number) => Err(constraint_violation!(
+            "the hash and number \
+        of a block pointer must either both be null or both have a \
+        value, but for `{}` the hash of {} is `{:?}` and the number is `{:?}`",
+            id,
+            name,
+            hash,
+            number
+        )),
+    }
+}
+
+pub(crate) fn info_from_details(
+    detail: DeploymentDetail,
+    fatal: Option<ErrorDetail>,
+    non_fatal: Vec<ErrorDetail>,
+    sites: &[Arc<Site>],
+) -> Result<status::Info, StoreError> {
+    let DeploymentDetail {
+        id,
+        deployment,
+        failed: _,
+        health,
+        synced,
+        fatal_error: _,
+        non_fatal_errors: _,
+        earliest_block_number,
+        latest_ethereum_block_hash,
+        latest_ethereum_block_number,
+        entity_count,
+        graft_base: _,
+        graft_block_hash: _,
+        graft_block_number: _,
+        ..
+    } = detail;
+
+    let site = sites
+        .iter()
+        .find(|site| site.deployment.as_str() == deployment)
+        .ok_or_else(|| constraint_violation!("missing site for subgraph `{}`", deployment))?;
+
+    // This needs to be filled in later since it lives in a
+    // different shard
+    let chain_head_block = None;
+    let latest_block = block(
+        &deployment,
+        "latest_ethereum_block",
+        latest_ethereum_block_hash,
+        latest_ethereum_block_number,
+    )?;
+    let health = health.into();
+    let chain = status::ChainInfo {
+        network: site.network.clone(),
+        chain_head_block,
+        earliest_block_number,
+        latest_block,
+    };
+    let entity_count = entity_count.to_u64().ok_or_else(|| {
+        constraint_violation!(
+            "the entityCount for {} is not representable as a u64",
+            deployment
+        )
+    })?;
+    let fatal_error = fatal.map(SubgraphError::try_from).transpose()?;
+    let non_fatal_errors = non_fatal
+        .into_iter()
+        .map(SubgraphError::try_from)
+        .collect::<Result<Vec<SubgraphError>, StoreError>>()?;
+
+    // 'node' needs to be filled in later from a different shard
+    Ok(status::Info {
+        id: id.into(),
+        subgraph: deployment,
+        synced,
+        health,
+        fatal_error,
+        non_fatal_errors,
+        chains: vec![chain],
+        entity_count,
+        node: None,
+    })
+}
+
+/// Return the details for `deployments`
+pub(crate) fn deployment_details(
+    conn: &PgConnection,
+    deployments: Vec<String>,
+) -> Result<Vec<DeploymentDetail>, StoreError> {
+    use subgraph_deployment as d;
+
+    // Empty deployments means 'all of them'
+    let details = if deployments.is_empty() {
+        d::table.load::<DeploymentDetail>(conn)?
+    } else {
+        d::table
+            .filter(d::deployment.eq_any(&deployments))
+            .load::<DeploymentDetail>(conn)?
+    };
+    Ok(details)
+}
+
+pub(crate) fn deployment_statuses(
+    conn: &PgConnection,
+    sites: &[Arc<Site>],
+) -> Result<Vec<status::Info>, StoreError> {
+    use subgraph_deployment as d;
+    use subgraph_error as e;
+
+    // First, we fetch all deployment information along with any fatal errors.
+    // Subsequently, we fetch non-fatal errors and we group them by deployment
+    // ID.
+
+    let details_with_fatal_error = {
+        let join = e::table.on(e::id.nullable().eq(d::fatal_error));
+
+        // Empty deployments means 'all of them'
+        if sites.is_empty() {
+            d::table
+                .left_outer_join(join)
+                .load::<(DeploymentDetail, Option<ErrorDetail>)>(conn)?
+        } else {
+            d::table
+                .left_outer_join(join)
+                .filter(d::id.eq_any(sites.iter().map(|site| site.id)))
+                .load::<(DeploymentDetail, Option<ErrorDetail>)>(conn)?
+        }
+    };
+
+    let mut non_fatal_errors = {
+        let join = e::table.on(e::id.eq(dsl::any(d::non_fatal_errors)));
+
+        if sites.is_empty() {
+            d::table
+                .inner_join(join)
+                .select((d::id, e::all_columns))
+                .load::<(DeploymentId, ErrorDetail)>(conn)?
+        } else {
+            d::table
+                .inner_join(join)
+                .filter(d::id.eq_any(sites.iter().map(|site| site.id)))
+                .select((d::id, e::all_columns))
+                .load::<(DeploymentId, ErrorDetail)>(conn)?
+        }
+        .into_iter()
+        .into_group_map()
+    };
+
+    details_with_fatal_error
+        .into_iter()
+        .map(|(detail, fatal)| {
+            let non_fatal = non_fatal_errors.remove(&detail.id).unwrap_or(vec![]);
+            info_from_details(detail, fatal, non_fatal, sites)
+        })
+        .collect()
+}
+
+#[derive(Queryable, QueryableByName, Identifiable, Associations)]
+#[table_name = "subgraph_manifest"]
+#[belongs_to(GraphNodeVersion)]
+// We never read the id field but map it to make the interaction with Diesel
+// simpler
+#[allow(dead_code)]
+struct StoredSubgraphManifest {
+    id: i32,
+    spec_version: String,
+    description: Option<String>,
+    repository: Option<String>,
+    features: Vec<String>,
+    schema: String,
+    graph_node_version_id: Option<i32>,
+    use_bytea_prefix: bool,
+    start_block_number: Option<i32>,
+    start_block_hash: Option<Bytes>,
+}
+
+impl From<StoredSubgraphManifest> for SubgraphManifestEntity {
+    fn from(value: StoredSubgraphManifest) -> Self {
+        SubgraphManifestEntity {
+            spec_version: value.spec_version,
+            description: value.description,
+            repository: value.repository,
+            features: value.features,
+            schema: value.schema,
+        }
+    }
+}
+
+struct StoredDeploymentEntity(crate::detail::DeploymentDetail, StoredSubgraphManifest);
+
+impl TryFrom<StoredDeploymentEntity> for SubgraphDeploymentEntity {
+    type Error = StoreError;
+
+    fn try_from(ent: StoredDeploymentEntity) -> Result<Self, Self::Error> {
+        let (detail, manifest) = (ent.0, ent.1.into());
+
+        let earliest_block = block(
+            &detail.deployment,
+            "earliest_block",
+            detail.earliest_ethereum_block_hash,
+            detail.earliest_ethereum_block_number,
+        )?
+        .map(|block| block.to_ptr());
+
+        let latest_block = block(
+            &detail.deployment,
+            "latest_block",
+            detail.latest_ethereum_block_hash,
+            detail.latest_ethereum_block_number,
+        )?
+        .map(|block| block.to_ptr());
+
+        let graft_block = block(
+            &detail.deployment,
+            "graft_block",
+            detail.graft_block_hash,
+            detail.graft_block_number,
+        )?
+        .map(|block| block.to_ptr());
+
+        let graft_base = detail
+            .graft_base
+            .map(DeploymentHash::new)
+            .transpose()
+            .map_err(|b| constraint_violation!("invalid graft base `{}`", b))?;
+
+        let debug_fork = detail
+            .debug_fork
+            .map(DeploymentHash::new)
+            .transpose()
+            .map_err(|b| constraint_violation!("invalid debug fork `{}`", b))?;
+
+        Ok(SubgraphDeploymentEntity {
+            manifest,
+            failed: detail.failed,
+            health: detail.health.into(),
+            synced: detail.synced,
+            fatal_error: None,
+            non_fatal_errors: vec![],
+            earliest_block,
+            latest_block,
+            graft_base,
+            graft_block,
+            debug_fork,
+            reorg_count: detail.reorg_count,
+            current_reorg_depth: detail.current_reorg_depth,
+            max_reorg_depth: detail.max_reorg_depth,
+        })
+    }
+}
+
+pub fn deployment_entity(
+    conn: &PgConnection,
+    site: &Site,
+) -> Result<SubgraphDeploymentEntity, StoreError> {
+    use subgraph_deployment as d;
+    use subgraph_manifest as m;
+
+    let manifest = m::table
+        .find(site.id)
+        .first::<StoredSubgraphManifest>(conn)?;
+
+    let detail = d::table
+        .find(site.id)
+        .first::<crate::detail::DeploymentDetail>(conn)?;
+
+    SubgraphDeploymentEntity::try_from(StoredDeploymentEntity(detail, manifest))
+}
+
+#[derive(Queryable, Identifiable, Insertable)]
+#[table_name = "graph_node_versions"]
+pub struct GraphNodeVersion {
+    pub id: i32,
+    pub git_commit_hash: String,
+    pub git_repository_dirty: bool,
+    pub crate_version: String,
+    pub major: i32,
+    pub minor: i32,
+    pub patch: i32,
+}
+
+impl GraphNodeVersion {
+    pub(crate) fn create_or_get(conn: &PgConnection) -> anyhow::Result<i32> {
+        let git_commit_hash = version_commit_hash!();
+        let git_repository_dirty = !&TESTAMENT.modifications.is_empty();
+        let crate_version = CARGO_PKG_VERSION;
+        let major: i32 = CARGO_PKG_VERSION_MAJOR
+            .parse()
+            .expect("failed to parse cargo major package version");
+        let minor: i32 = CARGO_PKG_VERSION_MINOR
+            .parse()
+            .expect("failed to parse cargo major package version");
+        let patch: i32 = CARGO_PKG_VERSION_PATCH
+            .parse()
+            .expect("failed to parse cargo major package version");
+
+        let graph_node_version_id = {
+            use graph_node_versions::dsl as g;
+
+            // try to insert our current values
+            diesel::insert_into(g::graph_node_versions)
+                .values((
+                    g::git_commit_hash.eq(&git_commit_hash),
+                    g::git_repository_dirty.eq(git_repository_dirty),
+                    g::crate_version.eq(&crate_version),
+                    g::major.eq(&major),
+                    g::minor.eq(&minor),
+                    g::patch.eq(&patch),
+                ))
+                .on_conflict_do_nothing()
+                .execute(conn)?;
+
+            // select the id for the row we just inserted
+            g::graph_node_versions
+                .select(g::id)
+                .filter(g::git_commit_hash.eq(&git_commit_hash))
+                .filter(g::git_repository_dirty.eq(git_repository_dirty))
+                .filter(g::crate_version.eq(&crate_version))
+                .filter(g::major.eq(&major))
+                .filter(g::minor.eq(&minor))
+                .filter(g::patch.eq(&patch))
+                .get_result(conn)?
+        };
+        Ok(graph_node_version_id)
+    }
+}
diff --git a/store/postgres/src/dynds/mod.rs b/store/postgres/src/dynds/mod.rs
new file mode 100644
index 0000000..9a35270
--- /dev/null
+++ b/store/postgres/src/dynds/mod.rs
@@ -0,0 +1,76 @@
+mod private;
+pub(crate) mod shared;
+
+pub(crate) use private::DataSourcesTable;
+
+use crate::primary::Site;
+use diesel::PgConnection;
+use graph::{
+    blockchain::BlockPtr,
+    components::store::StoredDynamicDataSource,
+    constraint_violation,
+    prelude::{BlockNumber, StoreError},
+};
+
+pub fn load(
+    conn: &PgConnection,
+    site: &Site,
+    block: BlockNumber,
+    manifest_idx_and_name: Vec<(u32, String)>,
+) -> Result<Vec<StoredDynamicDataSource>, StoreError> {
+    match site.schema_version.private_data_sources() {
+        true => DataSourcesTable::new(site.namespace.clone()).load(conn, block),
+        false => shared::load(conn, site.deployment.as_str(), block, manifest_idx_and_name),
+    }
+}
+
+pub(crate) fn insert(
+    conn: &PgConnection,
+    site: &Site,
+    data_sources: &[StoredDynamicDataSource],
+    block_ptr: &BlockPtr,
+    manifest_idx_and_name: &[(u32, String)],
+) -> Result<usize, StoreError> {
+    match site.schema_version.private_data_sources() {
+        true => DataSourcesTable::new(site.namespace.clone()).insert(
+            conn,
+            data_sources,
+            block_ptr.number,
+        ),
+        false => shared::insert(
+            conn,
+            &site.deployment,
+            data_sources,
+            block_ptr,
+            manifest_idx_and_name,
+        ),
+    }
+}
+
+pub(crate) fn revert(
+    conn: &PgConnection,
+    site: &Site,
+    block: BlockNumber,
+) -> Result<(), StoreError> {
+    match site.schema_version.private_data_sources() {
+        true => DataSourcesTable::new(site.namespace.clone()).revert(conn, block),
+        false => shared::revert(conn, &site.deployment, block),
+    }
+}
+
+pub(crate) fn remove_offchain(
+    conn: &PgConnection,
+    site: &Site,
+    data_sources: &[StoredDynamicDataSource],
+) -> Result<(), StoreError> {
+    if data_sources.len() == 0 {
+        return Ok(());
+    }
+
+    match site.schema_version.private_data_sources() {
+        true => DataSourcesTable::new(site.namespace.clone()).remove_offchain(conn, data_sources),
+        false => Err(constraint_violation!(
+            "shared schema does not support data source offchain_found",
+        )),
+    }
+}
diff --git a/store/postgres/src/dynds/private.rs b/store/postgres/src/dynds/private.rs
new file mode 100644
index 0000000..78710db
--- /dev/null
+++ b/store/postgres/src/dynds/private.rs
@@ -0,0 +1,294 @@
+use std::ops::Bound;
+
+use diesel::{
+    pg::types::sql_types,
+    sql_query,
+    sql_types::{Binary, Integer, Jsonb, Nullable},
+    PgConnection, QueryDsl, RunQueryDsl,
+};
+
+use graph::{
+    components::store::StoredDynamicDataSource,
+    constraint_violation,
+    prelude::{serde_json, BlockNumber, StoreError},
+};
+
+use crate::primary::Namespace;
+
+type DynTable = diesel_dynamic_schema::Table<String, Namespace>;
+type DynColumn<ST> = diesel_dynamic_schema::Column<DynTable, &'static str, ST>;
+
+#[derive(Debug)]
+pub(crate) struct DataSourcesTable {
+    namespace: Namespace,
+    qname: String,
+    table: DynTable,
+    vid: DynColumn<Integer>,
+    block_range: DynColumn<sql_types::Range<Integer>>,
+    causality_region: DynColumn<Integer>,
+    manifest_idx: DynColumn<Integer>,
+    param: DynColumn<Nullable<Binary>>,
+    context: DynColumn<Nullable<Jsonb>>,
+}
+
+impl DataSourcesTable {
+    const TABLE_NAME: &'static str = "data_sources$";
+
+    pub(crate) fn new(namespace: Namespace) -> Self {
+        let table =
+            diesel_dynamic_schema::schema(namespace.clone()).table(Self::TABLE_NAME.to_string());
+
+        DataSourcesTable {
+            qname: format!("{}.{}", namespace, Self::TABLE_NAME),
+            namespace,
+            vid: table.column("vid"),
+            block_range: table.column("block_range"),
+            causality_region: table.column("causality_region"),
+            manifest_idx: table.column("manifest_idx"),
+            param: table.column("param"),
+            context: table.column("context"),
+            table,
+        }
+    }
+
+    pub(crate) fn as_ddl(&self) -> String {
+        format!(
+            "
+            create table {nsp}.{table} (
+                vid integer generated by default as identity primary key,
+                block_range int4range not null,
+                causality_region integer generated by default as identity,
+                manifest_idx integer not null,
+                parent integer references {nsp}.{table},
+                id bytea,
+                param bytea,
+                context jsonb
+            );
+
+            create index gist_block_range_data_sources$ on {nsp}.data_sources$ using gist (block_range);
+            ",
+            nsp = self.namespace.to_string(),
+            table = Self::TABLE_NAME
+        )
+    }
+
+    // Query to load the data sources which are live at `block`. Ordering by the creation block and
+    // `vid` makes sure they are in insertion order which is important for the correctness of
+    // reverts and the execution order of triggers. See also 8f1bca33-d3b7-4035-affc-fd6161a12448.
+    pub(super) fn load(
+        &self,
+        conn: &PgConnection,
+        block: BlockNumber,
+    ) -> Result<Vec<StoredDynamicDataSource>, StoreError> {
+        type Tuple = (
+            (Bound<i32>, Bound<i32>),
+            i32,
+            Option<Vec<u8>>,
+            Option<serde_json::Value>,
+            i32,
+        );
+        let tuples = self
+            .table
+            .clone()
+            .filter(diesel::dsl::sql("block_range @> ").bind::<Integer, _>(block))
+            .select((
+                &self.block_range,
+                &self.manifest_idx,
+                &self.param,
+                &self.context,
+                &self.causality_region,
+            ))
+            .order_by(&self.vid)
+            .load::<Tuple>(conn)?;
+
+        let mut dses: Vec<_> = tuples
+            .into_iter()
+            .map(
+                |(block_range, manifest_idx, param, context, causality_region)| {
+                    let creation_block = match block_range.0 {
+                        Bound::Included(block) => Some(block),
+
+                        // Should never happen.
+                        Bound::Excluded(_) | Bound::Unbounded => {
+                            unreachable!("dds with open creation")
+                        }
+                    };
+
+                    let is_offchain = causality_region > 0;
+                    StoredDynamicDataSource {
+                        manifest_idx: manifest_idx as u32,
+                        param: param.map(|p| p.into()),
+                        context,
+                        creation_block,
+                        is_offchain,
+                    }
+                },
+            )
+            .collect();
+
+        // This sort is stable and `tuples` was ordered by vid, so `dses` will be ordered by `(creation_block, vid)`.
+        dses.sort_by_key(|v| v.creation_block);
+
+        Ok(dses)
+    }
+
+    pub(crate) fn insert(
+        &self,
+        conn: &PgConnection,
+        data_sources: &[StoredDynamicDataSource],
+        block: BlockNumber,
+    ) -> Result<usize, StoreError> {
+        let mut inserted_total = 0;
+
+        for ds in data_sources {
+            let StoredDynamicDataSource {
+                manifest_idx,
+                param,
+                context,
+                creation_block,
+                is_offchain,
+            } = ds;
+
+            if creation_block != &Some(block) {
+                return Err(constraint_violation!(
+                    "mismatching creation blocks `{:?}` and `{}`",
+                    creation_block,
+                    block
+                ));
+            }
+
+            // Offchain data sources have a unique causality region assigned from a sequence in the
+            // database, while onchain data sources always have causality region 0.
+            let query = match is_offchain {
+                false => format!(
+                    "insert into {}(block_range, manifest_idx, param, context, causality_region) \
+                            values (int4range($1, null), $2, $3, $4, $5)",
+                    self.qname
+                ),
+
+                true => format!(
+                    "insert into {}(block_range, manifest_idx, param, context) \
+                            values (int4range($1, null), $2, $3, $4)",
+                    self.qname
+                ),
+            };
+
+            let query = sql_query(query)
+                .bind::<Nullable<Integer>, _>(creation_block)
+                .bind::<Integer, _>(*manifest_idx as i32)
+                .bind::<Nullable<Binary>, _>(param.as_ref().map(|p| &**p))
+                .bind::<Nullable<Jsonb>, _>(context);
+
+            inserted_total += match is_offchain {
+                false => query.bind::<Integer, _>(0).execute(conn)?,
+                true => query.execute(conn)?,
+            };
+        }
+
+        Ok(inserted_total)
+    }
+
+    pub(crate) fn revert(&self, conn: &PgConnection, block: BlockNumber) -> Result<(), StoreError> {
+        // Use `@>` to leverage the gist index.
+        // This assumes all ranges are of the form [x, +inf).
+        let query = format!(
+            "delete from {} where block_range @> $1 and lower(block_range) = $1",
+            self.qname
+        );
+        sql_query(query).bind::<Integer, _>(block).execute(conn)?;
+        Ok(())
+    }
+
+    /// Copy the dynamic data sources from `self` to `dst`. All data sources that
+    /// were created up to and including `target_block` will be copied.
+    pub(crate) fn copy_to(
+        &self,
+        conn: &PgConnection,
+        dst: &DataSourcesTable,
+        target_block: BlockNumber,
+    ) -> Result<usize, StoreError> {
+        // Check if there are any data sources for dst which indicates we already copied
+        let count = dst.table.clone().count().get_result::<i64>(conn)?;
+        if count > 0 {
+            return Ok(count as usize);
+        }
+
+        let query = format!(
+            "\
+            insert into {dst}(block_range, causality_region, manifest_idx, parent, id, param, context)
+            select case
+                when upper(e.block_range) <= $1 then e.block_range
+                else int4range(lower(e.block_range), null)
+            end,
+            e.causality_region, e.manifest_idx, e.parent, e.id, e.param, e.context
+            from {src} e
+            where lower(e.block_range) <= $1
+            ",
+            src = self.qname,
+            dst = dst.qname
+        );
+
+        let count = sql_query(&query)
+            .bind::<Integer, _>(target_block)
+            .execute(conn)?;
+
+        // Test that both tables have the same contents.
+        debug_assert!(
+            self.load(conn, target_block).map_err(|e| e.to_string())
+                == dst.load(conn, target_block).map_err(|e| e.to_string())
+        );
+
+        Ok(count)
+    }
+
+    // Remove offchain data sources by checking for equality. Their range will be set to the empty range.
+    pub(super) fn remove_offchain(
+        &self,
+        conn: &PgConnection,
+        data_sources: &[StoredDynamicDataSource],
+    ) -> Result<(), StoreError> {
+        for ds in data_sources {
+            let StoredDynamicDataSource {
+                manifest_idx,
+                param,
+                context,
+                creation_block,
+                is_offchain,
+            } = ds;
+
+            if !is_offchain {
+                return Err(constraint_violation!(
+                    "called remove_offchain with onchain data sources"
+                ));
+            }
+
+            let query = format!(
+                "update {} set block_range = 'empty'::int4range \
+                 where manifest_idx = $1
+                    and param is not distinct from $2
+                    and context is not distinct from $3
+                    and lower(block_range) is not distinct from $4",
+                self.qname
+            );
+
+            let count = sql_query(query)
+                .bind::<Integer, _>(*manifest_idx as i32)
+                .bind::<Nullable<Binary>, _>(param.as_ref().map(|p| &**p))
+                .bind::<Nullable<Jsonb>, _>(context)
+                .bind::<Nullable<Integer>, _>(creation_block)
+                .execute(conn)?;
+
+            if count > 1 {
+                // Data source deduplication enforces this invariant.
+                // See also: data-source-is-duplicate-of
+                return Err(constraint_violation!(
+                    "expected to remove at most one offchain data source but would remove {}, ds: {:?}",
+                    count,
+                    ds
+                ));
+            }
+        }
+
+        Ok(())
+    }
+}
diff --git a/store/postgres/src/dynds/shared.rs b/store/postgres/src/dynds/shared.rs
new file mode 100644
index 0000000..a151a77
--- /dev/null
+++ b/store/postgres/src/dynds/shared.rs
@@ -0,0 +1,238 @@
+//! SQL queries to load dynamic data sources
+
+use diesel::{
+    delete,
+    dsl::{count, sql},
+    prelude::{ExpressionMethods, QueryDsl, RunQueryDsl},
+    sql_query,
+    sql_types::{Integer, Text},
+};
+use diesel::{insert_into, pg::PgConnection};
+
+use graph::{
+    components::store::StoredDynamicDataSource,
+    constraint_violation,
+    prelude::{
+        bigdecimal::ToPrimitive, serde_json, BigDecimal, BlockNumber, BlockPtr, DeploymentHash,
+        StoreError,
+    },
+};
+
+use crate::connection_pool::ForeignServer;
+use crate::primary::Site;
+
+table! {
+    subgraphs.dynamic_ethereum_contract_data_source (vid) {
+        vid -> BigInt,
+        name -> Text,
+        address -> Binary,
+        abi -> Text,
+        start_block -> Integer,
+        // Never read
+        ethereum_block_hash -> Binary,
+        ethereum_block_number -> Numeric,
+        deployment -> Text,
+        context -> Nullable<Text>,
+    }
+}
+
+pub(super) fn load(
+    conn: &PgConnection,
+    id: &str,
+    block: BlockNumber,
+    manifest_idx_and_name: Vec<(u32, String)>,
+) -> Result<Vec<StoredDynamicDataSource>, StoreError> {
+    use dynamic_ethereum_contract_data_source as decds;
+
+    // Query to load the data sources. Ordering by the creation block and `vid` makes sure they are
+    // in insertion order which is important for the correctness of reverts and the execution order
+    // of triggers. See also 8f1bca33-d3b7-4035-affc-fd6161a12448.
+    let dds: Vec<_> = decds::table
+        .filter(decds::deployment.eq(id))
+        .select((
+            decds::vid,
+            decds::name,
+            decds::context,
+            decds::address,
+            decds::ethereum_block_number,
+        ))
+        .filter(decds::ethereum_block_number.le(sql(&format!("{}::numeric", block))))
+        .order_by((decds::ethereum_block_number, decds::vid))
+        .load::<(i64, String, Option<String>, Vec<u8>, BigDecimal)>(conn)?;
+
+    let mut data_sources: Vec<StoredDynamicDataSource> = Vec::new();
+    for (vid, name, context, address, creation_block) in dds.into_iter() {
+        if address.len() != 20 {
+            return Err(constraint_violation!(
+                "Data source address `0x{:?}` for dynamic data source {} should be 20 bytes long but is {} bytes long",
+                address, vid,
+            address.len()
+        ));
+        }
+
+        let manifest_idx = manifest_idx_and_name
+            .iter()
+            .find(|(_, manifest_name)| manifest_name == &name)
+            .ok_or_else(|| constraint_violation!("data source name {} not found", name))?
+            .0;
+        let creation_block = creation_block.to_i32();
+        let data_source = StoredDynamicDataSource {
+            manifest_idx,
+            param: Some(address.into()),
+            context: context.map(|ctx| serde_json::from_str(&ctx)).transpose()?,
+            creation_block,
+
+            // The shared schema is only used for legacy deployments, and therefore not used for
+            // subgraphs that use file data sources.
+            is_offchain: false,
+        };
+
+        if data_sources.last().and_then(|d| d.creation_block) > data_source.creation_block {
+            return Err(StoreError::ConstraintViolation(
+                "data sources not ordered by creation block".to_string(),
+            ));
+        }
+
+        data_sources.push(data_source);
+    }
+    Ok(data_sources)
+}
+
+pub(super) fn insert(
+    conn: &PgConnection,
+    deployment: &DeploymentHash,
+    data_sources: &[StoredDynamicDataSource],
+    block_ptr: &BlockPtr,
+    manifest_idx_and_name: &[(u32, String)],
+) -> Result<usize, StoreError> {
+    use dynamic_ethereum_contract_data_source as decds;
+
+    if data_sources.is_empty() {
+        // Avoids a roundtrip to the DB.
+        return Ok(0);
+    }
+
+    let dds: Vec<_> = data_sources
+        .into_iter()
+        .map(|ds| {
+            let StoredDynamicDataSource {
+                manifest_idx: _,
+                param,
+                context,
+                creation_block: _,
+                is_offchain,
+            } = ds;
+
+            if *is_offchain {
+                return Err(constraint_violation!(
+                    "using shared data source schema with file data sources"
+                ));
+            }
+
+            let address = match param {
+                Some(param) => param,
+                None => {
+                    return Err(constraint_violation!(
+                        "dynamic data sources must have an addres",
+                    ));
+                }
+            };
+            let name = manifest_idx_and_name
+                .iter()
+                .find(|(idx, _)| *idx == ds.manifest_idx)
+                .ok_or_else(|| constraint_violation!("manifest idx {} not found", ds.manifest_idx))?
+                .1
+                .clone();
+            Ok((
+                decds::deployment.eq(deployment.as_str()),
+                decds::name.eq(name),
+                decds::context.eq(context
+                    .as_ref()
+                    .map(|ctx| serde_json::to_string(ctx).unwrap())),
+                decds::address.eq(&**address),
+                decds::abi.eq(""),
+                decds::start_block.eq(0),
+                decds::ethereum_block_number.eq(sql(&format!("{}::numeric", block_ptr.number))),
+                decds::ethereum_block_hash.eq(block_ptr.hash_slice()),
+            ))
+        })
+        .collect::<Result<_, _>>()?;
+
+    insert_into(decds::table)
+        .values(dds)
+        .execute(conn)
+        .map_err(|e| e.into())
+}
+
+/// Copy the dynamic data sources for `src` to `dst`. All data sources that
+/// were created up to and including `target_block` will be copied.
+pub(crate) fn copy(
+    conn: &PgConnection,
+    src: &Site,
+    dst: &Site,
+    target_block: BlockNumber,
+) -> Result<usize, StoreError> {
+    use dynamic_ethereum_contract_data_source as decds;
+
+    // Subgraphs that use private data sources have no data in the shared
+    // table
+    if src.schema_version.private_data_sources() {
+        return Ok(0);
+    }
+
+    let src_nsp = if src.shard == dst.shard {
+        "subgraphs".to_string()
+    } else {
+        ForeignServer::metadata_schema(&src.shard)
+    };
+
+    // Check whether there are any dynamic data sources for dst which
+    // indicates we already did copy
+    let count = decds::table
+        .filter(decds::deployment.eq(dst.deployment.as_str()))
+        .select(count(decds::vid))
+        .get_result::<i64>(conn)?;
+    if count > 0 {
+        return Ok(count as usize);
+    }
+
+    let query = format!(
+        "\
+      insert into subgraphs.dynamic_ethereum_contract_data_source(name,
+             address, abi, start_block, ethereum_block_hash,
+             ethereum_block_number, deployment, context)
+      select e.name, e.address, e.abi, e.start_block,
+             e.ethereum_block_hash, e.ethereum_block_number, $2 as deployment,
+             e.context
+        from {src_nsp}.dynamic_ethereum_contract_data_source e
+       where e.deployment = $1
+         and e.ethereum_block_number <= $3",
+        src_nsp = src_nsp
+    );
+
+    Ok(sql_query(&query)
+        .bind::<Text, _>(src.deployment.as_str())
+        .bind::<Text, _>(dst.deployment.as_str())
+        .bind::<Integer, _>(target_block)
+        .execute(conn)?)
+}
+
+pub(super) fn revert(
+    conn: &PgConnection,
+    id: &DeploymentHash,
+    block: BlockNumber,
+) -> Result<(), StoreError> {
+    use dynamic_ethereum_contract_data_source as decds;
+
+    let dds = decds::table.filter(decds::deployment.eq(id.as_str()));
+    delete(dds.filter(decds::ethereum_block_number.ge(sql(&block.to_string())))).execute(conn)?;
+    Ok(())
+}
+
+pub(crate) fn drop(conn: &PgConnection, id: &DeploymentHash) -> Result<usize, StoreError> {
+    use dynamic_ethereum_contract_data_source as decds;
+
+    delete(decds::table.filter(decds::deployment.eq(id.as_str())))
+        .execute(conn)
+        .map_err(|e| e.into())
+}
diff --git a/store/postgres/src/fork.rs b/store/postgres/src/fork.rs
new file mode 100644
index 0000000..d3a4559
--- /dev/null
+++ b/store/postgres/src/fork.rs
@@ -0,0 +1,396 @@
+use std::{
+    collections::{HashMap, HashSet},
+    str::FromStr,
+    sync::{Arc, Mutex},
+};
+
+use graph::{
+    block_on,
+    components::store::SubgraphFork as SubgraphForkTrait,
+    data::graphql::ext::DirectiveFinder,
+    prelude::{
+        info,
+        r::Value as RValue,
+        reqwest,
+        s::{Definition, Field, ObjectType, TypeDefinition},
+        serde_json, Attribute, DeploymentHash, Entity, Logger, Schema, Serialize, StoreError,
+        Value, ValueType,
+    },
+    url::Url,
+};
+use inflector::Inflector;
+
+#[derive(Serialize, Debug, PartialEq)]
+struct Query {
+    query: String,
+    variables: Variables,
+}
+
+#[derive(Serialize, Debug, PartialEq)]
+struct Variables {
+    id: String,
+}
+
+/// SubgraphFork represents a simple subgraph forking mechanism
+/// which lazily fetches entities from a remote subgraph's store
+/// associated with a GraphQL `endpoint`.
+///
+/// Since this mechanism is used for debug forks, entities are
+/// fetched only once per id in order to avoid fetching an entity
+/// that was deleted from the local store and thus causing inconsistencies.
+pub(crate) struct SubgraphFork {
+    client: reqwest::Client,
+    endpoint: Url,
+    schema: Arc<Schema>,
+    fetched_ids: Mutex<HashSet<String>>,
+    logger: Logger,
+}
+
+impl SubgraphForkTrait for SubgraphFork {
+    fn fetch(&self, entity_type: String, id: String) -> Result<Option<Entity>, StoreError> {
+        {
+            let mut fids = self.fetched_ids.lock().map_err(|e| {
+                StoreError::ForkFailure(format!(
+                    "attempt to acquire lock on `fetched_ids` failed with {}",
+                    e,
+                ))
+            })?;
+            if fids.contains(&id) {
+                info!(self.logger, "Already fetched entity! Abort!"; "entity_type" => entity_type, "id" => id);
+                return Ok(None);
+            }
+            fids.insert(id.clone());
+        }
+
+        info!(self.logger, "Fetching entity from {}", &self.endpoint; "entity_type" => &entity_type, "id" => &id);
+
+        // NOTE: Subgraph fork compatibility checking (similar to the grafting compatibility checks)
+        // will be added in the future (in a separate PR).
+        // Currently, forking incompatible subgraphs is allowed, but, for example, storing the
+        // incompatible fetched entities in the local store results in an error.
+
+        let fields = self.get_fields_of(&entity_type)?;
+        let query = Query {
+            query: self.query_string(&entity_type, fields)?,
+            variables: Variables { id },
+        };
+        let raw_json = block_on(self.send(&query))?;
+        if !raw_json.contains("data") {
+            return Err(StoreError::ForkFailure(format!(
+                "the GraphQL query \"{:?}\" to `{}` failed with \"{}\"",
+                query, self.endpoint, raw_json,
+            )));
+        }
+
+        let entity = SubgraphFork::extract_entity(&raw_json, &entity_type, fields)?;
+        Ok(entity)
+    }
+}
+
+impl SubgraphFork {
+    pub(crate) fn new(
+        base: Url,
+        id: DeploymentHash,
+        schema: Arc<Schema>,
+        logger: Logger,
+    ) -> Result<Self, StoreError> {
+        Ok(Self {
+            client: reqwest::Client::new(),
+            endpoint: base
+                .join(id.as_str())
+                .map_err(|e| StoreError::ForkFailure(format!("failed to join fork base: {}", e)))?,
+            schema,
+            fetched_ids: Mutex::new(HashSet::new()),
+            logger,
+        })
+    }
+
+    async fn send(&self, query: &Query) -> Result<String, StoreError> {
+        let res = self
+            .client
+            .post(self.endpoint.clone())
+            .json(query)
+            .send()
+            .await
+            .map_err(|e| {
+                StoreError::ForkFailure(format!(
+                    "sending a GraphQL query to `{}` failed with: \"{}\"",
+                    self.endpoint, e,
+                ))
+            })?
+            .text()
+            .await
+            .map_err(|e| {
+                StoreError::ForkFailure(format!(
+                    "receiving a response from `{}` failed with: \"{}\"",
+                    self.endpoint, e,
+                ))
+            })?;
+        Ok(res)
+    }
+
+    fn get_fields_of(&self, entity_type: &str) -> Result<&Vec<Field>, StoreError> {
+        let entity: Option<&ObjectType> =
+            self.schema
+                .document
+                .definitions
+                .iter()
+                .find_map(|def| match def {
+                    Definition::TypeDefinition(TypeDefinition::Object(o))
+                        if o.name == entity_type =>
+                    {
+                        Some(o)
+                    }
+                    _ => None,
+                });
+
+        if entity.is_none() {
+            return Err(StoreError::ForkFailure(format!(
+                "No object type definition with entity type `{}` found in the GraphQL schema supplied by the user.",
+                entity_type
+            )));
+        }
+
+        Ok(&entity.unwrap().fields)
+    }
+
+    fn query_string(&self, entity_type: &str, fields: &[Field]) -> Result<String, StoreError> {
+        let names = fields
+            .iter()
+            .map(|f| {
+                let fname = f.name.to_string();
+                let ftype = f.field_type.to_string().replace(&['!', '[', ']'], "");
+                match ValueType::from_str(&ftype) {
+                    Ok(_) => fname,
+                    Err(_) => {
+                        format!("{} {{ id }}", fname,)
+                    }
+                }
+            })
+            .collect::<Vec<String>>();
+
+        Ok(format!(
+            "\
+query Query ($id: String) {{
+    {}(id: $id, subgraphError: allow) {{
+        {}
+    }}
+}}",
+            entity_type.to_camel_case(),
+            names.join(" ").trim(),
+        ))
+    }
+
+    fn extract_entity(
+        raw_json: &str,
+        entity_type: &str,
+        fields: &[Field],
+    ) -> Result<Option<Entity>, StoreError> {
+        let json: serde_json::Value = serde_json::from_str(raw_json).unwrap();
+        let entity = &json["data"][entity_type.to_lowercase()];
+
+        if entity.is_null() {
+            return Ok(None);
+        }
+
+        let map: HashMap<Attribute, Value> = {
+            let mut map = HashMap::new();
+            for f in fields {
+                if f.is_derived() {
+                    // Derived fields are not resolved, so it's safe to ignore them.
+                    continue;
+                }
+
+                let value = entity.get(&f.name).unwrap().clone();
+                let value = if let Some(id) = value.get("id") {
+                    RValue::String(id.as_str().unwrap().to_string())
+                } else if let Some(list) = value.as_array() {
+                    RValue::List(
+                        list.iter()
+                            .map(|v| match v.get("id") {
+                                Some(id) => RValue::String(id.as_str().unwrap().to_string()),
+                                None => RValue::from(v.clone()),
+                            })
+                            .collect(),
+                    )
+                } else {
+                    RValue::from(value)
+                };
+
+                let value = Value::from_query_value(&value, &f.field_type).map_err(|e| {
+                    StoreError::ForkFailure(format!(
+                        "Unexpected error during entity extraction! Failed to convert JSON value `{}` to type `{}`: {}",
+                        value,
+                        f.field_type,
+                        e
+                    ))
+                })?;
+                map.insert(f.name.clone(), value);
+            }
+            map
+        };
+
+        Ok(Some(Entity::from(map)))
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    use std::{iter::FromIterator, str::FromStr};
+
+    use super::*;
+
+    use graph::{
+        data::store::scalar,
+        prelude::{s::Type, DeploymentHash},
+        slog::{self, o},
+    };
+    use graphql_parser::parse_schema;
+
+    fn test_base() -> Url {
+        Url::parse("https://api.thegraph.com/subgraph/id/").unwrap()
+    }
+
+    fn test_id() -> DeploymentHash {
+        DeploymentHash::new("test").unwrap()
+    }
+
+    fn test_schema() -> Arc<Schema> {
+        let schema = Schema::new(
+            DeploymentHash::new("test").unwrap(),
+            parse_schema::<String>(
+                r#"type Gravatar @entity {
+  id: ID!
+  owner: Bytes!
+  displayName: String!
+  imageUrl: String!
+}"#,
+            )
+            .unwrap(),
+        )
+        .unwrap();
+        Arc::new(schema)
+    }
+
+    fn test_logger() -> Logger {
+        Logger::root(slog::Discard, o!())
+    }
+
+    fn test_fields() -> Vec<Field> {
+        vec![
+            Field {
+                position: graphql_parser::Pos { line: 2, column: 3 },
+                description: None,
+                name: "id".to_string(),
+                arguments: vec![],
+                field_type: Type::NonNullType(Box::new(Type::NamedType("ID".to_string()))),
+                directives: vec![],
+            },
+            Field {
+                position: graphql_parser::Pos { line: 3, column: 3 },
+                description: None,
+                name: "owner".to_string(),
+                arguments: vec![],
+                field_type: Type::NonNullType(Box::new(Type::NamedType("Bytes".to_string()))),
+                directives: vec![],
+            },
+            Field {
+                position: graphql_parser::Pos { line: 4, column: 3 },
+                description: None,
+                name: "displayName".to_string(),
+                arguments: vec![],
+                field_type: Type::NonNullType(Box::new(Type::NamedType("String".to_string()))),
+                directives: vec![],
+            },
+            Field {
+                position: graphql_parser::Pos { line: 5, column: 3 },
+                description: None,
+                name: "imageUrl".to_string(),
+                arguments: vec![],
+                field_type: Type::NonNullType(Box::new(Type::NamedType("String".to_string()))),
+                directives: vec![],
+            },
+        ]
+    }
+
+    #[test]
+    fn test_get_fields_of() {
+        let base = test_base();
+        let id = test_id();
+        let schema = test_schema();
+        let logger = test_logger();
+
+        let fork = SubgraphFork::new(base, id, schema, logger).unwrap();
+
+        assert_eq!(fork.get_fields_of("Gravatar").unwrap(), &test_fields());
+    }
+
+    #[test]
+    fn test_query_string() {
+        let base = test_base();
+        let id = test_id();
+        let schema = test_schema();
+        let logger = test_logger();
+
+        let fork = SubgraphFork::new(base, id, schema, logger).unwrap();
+
+        let query = Query {
+            query: fork.query_string("Gravatar", &test_fields()).unwrap(),
+            variables: Variables {
+                id: "0x00".to_string(),
+            },
+        };
+        assert_eq!(
+            query,
+            Query {
+                query: r#"query Query ($id: String) {
+    gravatar(id: $id, subgraphError: allow) {
+        id owner displayName imageUrl
+    }
+}"#
+                .to_string(),
+                variables: Variables {
+                    id: "0x00".to_string()
+                },
+            }
+        );
+    }
+
+    #[test]
+    fn test_extract_entity() {
+        let entity = SubgraphFork::extract_entity(
+            r#"{
+    "data": {
+        "gravatar": {
+            "id": "0x00",
+            "owner": "0x01",
+            "displayName": "test",
+            "imageUrl": "http://example.com/image.png"
+        }
+    }
+}"#,
+            "Gravatar",
+            &test_fields(),
+        )
+        .unwrap();
+
+        assert_eq!(
+            entity.unwrap(),
+            Entity::from(HashMap::from_iter(
+                vec![
+                    ("id".to_string(), Value::String("0x00".to_string())),
+                    (
+                        "owner".to_string(),
+                        Value::Bytes(scalar::Bytes::from_str("0x01").unwrap())
+                    ),
+                    ("displayName".to_string(), Value::String("test".to_string())),
+                    (
+                        "imageUrl".to_string(),
+                        Value::String("http://example.com/image.png".to_string())
+                    ),
+                ]
+                .into_iter()
+            ))
+        );
+    }
+}
diff --git a/store/postgres/src/functions.rs b/store/postgres/src/functions.rs
new file mode 100644
index 0000000..13e4c7d
--- /dev/null
+++ b/store/postgres/src/functions.rs
@@ -0,0 +1,22 @@
+use diesel::sql_types::{Binary, Bool, Integer, Nullable, Numeric, Range, Text};
+
+// Create modules for hosting stored procedures
+sql_function! { fn current_setting(setting_name: Text, missing_ok: Bool) }
+
+sql_function! {
+    fn set_config(setting_name: Text, new_value: Text, is_local: Bool)
+}
+
+sql_function! {
+    fn lower(range: Range<Integer>) -> Integer
+}
+
+sql_function! {
+    #[sql_name="coalesce"]
+    fn coalesce_numeric(first: Nullable<Numeric>, second: Nullable<Numeric>) -> Nullable<Numeric>
+}
+
+sql_function! {
+    #[sql_name="coalesce"]
+    fn coalesce_binary(first: Nullable<Binary>, second: Nullable<Binary>) -> Nullable<Binary>
+}
diff --git a/store/postgres/src/jobs.rs b/store/postgres/src/jobs.rs
new file mode 100644
index 0000000..a0d89a2
--- /dev/null
+++ b/store/postgres/src/jobs.rs
@@ -0,0 +1,209 @@
+//! Jobs for database maintenance
+use std::collections::HashMap;
+use std::sync::Arc;
+use std::time::{Duration, Instant};
+
+use async_trait::async_trait;
+use diesel::{prelude::RunQueryDsl, sql_query, sql_types::Double};
+
+use graph::prelude::{error, Logger, MetricsRegistry, StoreError, ENV_VARS};
+use graph::prometheus::Gauge;
+use graph::util::jobs::{Job, Runner};
+
+use crate::connection_pool::ConnectionPool;
+use crate::{unused, Store, SubgraphStore};
+
+pub fn register(
+    runner: &mut Runner,
+    store: Arc<Store>,
+    primary_pool: ConnectionPool,
+    registry: Arc<dyn MetricsRegistry>,
+) {
+    runner.register(
+        Arc::new(VacuumDeploymentsJob::new(store.subgraph_store())),
+        Duration::from_secs(60),
+    );
+
+    runner.register(
+        Arc::new(NotificationQueueUsage::new(primary_pool, registry)),
+        Duration::from_secs(60),
+    );
+
+    runner.register(
+        Arc::new(MirrorPrimary::new(store.subgraph_store())),
+        Duration::from_secs(15 * 60),
+    );
+
+    // Remove unused deployments every 2 hours
+    runner.register(
+        Arc::new(UnusedJob::new(store.subgraph_store())),
+        Duration::from_secs(2 * 60 * 60),
+    )
+}
+
+/// A job that vacuums `subgraphs.subgraph_deployment`. With a large number
+/// of subgraphs, the autovacuum daemon might not run often enough to keep
+/// this table, which is _very_ write-heavy, from getting bloated. We
+/// therefore set up a separate job that vacuums the table once a minute
+struct VacuumDeploymentsJob {
+    store: Arc<SubgraphStore>,
+}
+
+impl VacuumDeploymentsJob {
+    fn new(store: Arc<SubgraphStore>) -> VacuumDeploymentsJob {
+        VacuumDeploymentsJob { store }
+    }
+}
+
+#[async_trait]
+impl Job for VacuumDeploymentsJob {
+    fn name(&self) -> &str {
+        "Vacuum subgraphs.subgraph_deployment"
+    }
+
+    async fn run(&self, logger: &Logger) {
+        for res in self.store.vacuum().await {
+            if let Err(e) = res {
+                error!(
+                    logger,
+                    "Vacuum of subgraphs.subgraph_deployment failed: {}", e
+                );
+            }
+        }
+    }
+}
+
+struct NotificationQueueUsage {
+    primary: ConnectionPool,
+    usage_gauge: Box<Gauge>,
+}
+
+impl NotificationQueueUsage {
+    fn new(primary: ConnectionPool, registry: Arc<dyn MetricsRegistry>) -> Self {
+        let usage_gauge = registry
+            .new_gauge(
+                "notification_queue_usage",
+                "Time series of pg_notification_queue_usage()",
+                HashMap::new(),
+            )
+            .expect("Can register the notification_queue_usage gauge");
+        NotificationQueueUsage {
+            primary,
+            usage_gauge,
+        }
+    }
+
+    async fn update(&self) -> Result<(), StoreError> {
+        #[derive(QueryableByName)]
+        struct Usage {
+            #[sql_type = "Double"]
+            usage: f64,
+        }
+        let usage_gauge = self.usage_gauge.clone();
+        self.primary
+            .with_conn(move |conn, _| {
+                let res = sql_query("select pg_notification_queue_usage() as usage")
+                    .get_result::<Usage>(conn)?;
+                usage_gauge.set(res.usage);
+                Ok(())
+            })
+            .await
+    }
+}
+
+#[async_trait]
+impl Job for NotificationQueueUsage {
+    fn name(&self) -> &str {
+        "Report pg_notification_queue_usage()"
+    }
+
+    async fn run(&self, logger: &Logger) {
+        if let Err(e) = self.update().await {
+            error!(
+                logger,
+                "Update of `notification_queue_usage` gauge failed: {}", e
+            );
+        }
+    }
+}
+
+struct MirrorPrimary {
+    store: Arc<SubgraphStore>,
+}
+
+impl MirrorPrimary {
+    fn new(store: Arc<SubgraphStore>) -> MirrorPrimary {
+        MirrorPrimary { store }
+    }
+}
+
+#[async_trait]
+impl Job for MirrorPrimary {
+    fn name(&self) -> &str {
+        "Reconcile important tables from the primary"
+    }
+
+    async fn run(&self, logger: &Logger) {
+        self.store.mirror_primary_tables(logger).await;
+    }
+}
+
+struct UnusedJob {
+    store: Arc<SubgraphStore>,
+}
+
+impl UnusedJob {
+    fn new(store: Arc<SubgraphStore>) -> UnusedJob {
+        UnusedJob { store }
+    }
+}
+
+#[async_trait]
+impl Job for UnusedJob {
+    fn name(&self) -> &str {
+        "Record and remove unused deployments"
+    }
+
+    /// Record unused deployments and remove ones that were recorded at
+    /// least `UNUSED_INTERVAL` ago
+    async fn run(&self, logger: &Logger) {
+        // Work on removing about 5 minutes
+        const REMOVAL_DEADLINE: Duration = Duration::from_secs(5 * 60);
+
+        let start = Instant::now();
+
+        if let Err(e) = self.store.record_unused_deployments() {
+            error!(logger, "failed to record unused deployments"; "error" => e.to_string());
+            return;
+        }
+
+        let remove = match self
+            .store
+            .list_unused_deployments(unused::Filter::UnusedLongerThan(
+                ENV_VARS.store.remove_unused_interval,
+            )) {
+            Ok(remove) => remove,
+            Err(e) => {
+                error!(logger, "failed to list removable deployments"; "error" => e.to_string());
+                return;
+            }
+        };
+
+        for deployment in remove {
+            match self.store.remove_deployment(deployment.id) {
+                Ok(()) => { /* ignore */ }
+                Err(e) => {
+                    error!(logger, "failed to remove unused deployment";
+                                   "sgd" => deployment.id.to_string(),
+                                   "deployment" => deployment.deployment,
+                                   "error" => e.to_string());
+                }
+            }
+            // Stop working on removing after a while to not block other
+            // jobs for too long
+            if start.elapsed() > REMOVAL_DEADLINE {
+                return;
+            }
+        }
+    }
+}
diff --git a/store/postgres/src/jsonb.rs b/store/postgres/src/jsonb.rs
new file mode 100644
index 0000000..b1657af
--- /dev/null
+++ b/store/postgres/src/jsonb.rs
@@ -0,0 +1,27 @@
+use diesel::expression::helper_types::AsExprOf;
+use diesel::expression::{AsExpression, Expression};
+use diesel::sql_types::Jsonb;
+
+mod operators {
+    use diesel::sql_types::Jsonb;
+
+    // restrict to backend: Pg
+    diesel_infix_operator!(JsonbMerge, " || ", Jsonb, backend: diesel::pg::Pg);
+}
+
+// This is currently unused, but allowing JSONB merging in the database
+// is generally useful. We'll leave it here until we can merge it upstream
+// See https://github.com/diesel-rs/diesel/issues/2036
+#[allow(dead_code)]
+pub type JsonbMerge<Lhs, Rhs> = operators::JsonbMerge<Lhs, AsExprOf<Rhs, Jsonb>>;
+
+pub trait PgJsonbExpressionMethods: Expression<SqlType = Jsonb> + Sized {
+    fn merge<T: AsExpression<Jsonb>>(self, other: T) -> JsonbMerge<Self, T::Expression> {
+        JsonbMerge::<Self, T::Expression>::new(self, other.as_expression())
+    }
+}
+
+impl<T: Expression<SqlType = Jsonb>> PgJsonbExpressionMethods for T where
+    T: Expression<SqlType = Jsonb>
+{
+}
diff --git a/store/postgres/src/lib.rs b/store/postgres/src/lib.rs
new file mode 100644
index 0000000..66211f9
--- /dev/null
+++ b/store/postgres/src/lib.rs
@@ -0,0 +1,82 @@
+//! This crate implements the store for all chain and subgraph data. See the
+//! [Store] for the details of how the store is organized across
+//! different databases/shards.
+
+#[macro_use]
+extern crate derive_more;
+#[macro_use]
+extern crate diesel;
+#[macro_use]
+extern crate diesel_migrations;
+#[macro_use]
+extern crate diesel_derive_enum;
+
+mod advisory_lock;
+mod block_range;
+mod block_store;
+mod catalog;
+mod chain_head_listener;
+mod chain_store;
+pub mod connection_pool;
+mod copy;
+mod deployment;
+mod deployment_store;
+mod detail;
+mod dynds;
+mod fork;
+mod functions;
+mod jobs;
+mod jsonb;
+mod notification_listener;
+mod primary;
+pub mod query_store;
+mod relational;
+mod relational_queries;
+mod sql_value;
+mod store;
+mod store_events;
+mod subgraph_store;
+pub mod transaction_receipt;
+mod writable;
+
+#[cfg(debug_assertions)]
+pub mod layout_for_tests {
+    pub use crate::block_range::*;
+    pub use crate::block_store::FAKE_NETWORK_SHARED;
+    pub use crate::catalog::set_account_like;
+    pub use crate::primary::{
+        make_dummy_site, Connection, Mirror, Namespace, EVENT_TAP, EVENT_TAP_ENABLED,
+    };
+    pub use crate::relational::*;
+    pub mod writable {
+        pub use crate::writable::test_support::allow_steps;
+    }
+}
+
+pub use self::block_store::BlockStore;
+pub use self::chain_head_listener::ChainHeadUpdateListener;
+pub use self::chain_store::ChainStore;
+pub use self::detail::DeploymentDetail;
+pub use self::jobs::register as register_jobs;
+pub use self::notification_listener::NotificationSender;
+pub use self::primary::{db_version, UnusedDeployment};
+pub use self::store::Store;
+pub use self::store_events::SubscriptionManager;
+pub use self::subgraph_store::{unused, DeploymentPlacer, Shard, SubgraphStore, PRIMARY_SHARD};
+
+/// This module is only meant to support command line tooling. It must not
+/// be used in 'normal' graph-node code
+pub mod command_support {
+    pub mod catalog {
+        pub use crate::block_store::primary as block_store;
+        pub use crate::catalog::{account_like, stats};
+        pub use crate::copy::{copy_state, copy_table_state};
+        pub use crate::primary::Connection;
+        pub use crate::primary::{
+            active_copies, deployment_schemas, ens_names, subgraph, subgraph_deployment_assignment,
+            subgraph_version, Site,
+        };
+    }
+    pub use crate::primary::Namespace;
+    pub use crate::relational::{Catalog, Column, ColumnType, Layout, SqlName};
+}
diff --git a/store/postgres/src/notification_listener.rs b/store/postgres/src/notification_listener.rs
new file mode 100644
index 0000000..79530c4
--- /dev/null
+++ b/store/postgres/src/notification_listener.rs
@@ -0,0 +1,476 @@
+use diesel::pg::PgConnection;
+use diesel::select;
+use diesel::sql_types::Text;
+use graph::prelude::tokio::sync::mpsc::error::SendTimeoutError;
+use graph::util::backoff::ExponentialBackoff;
+use lazy_static::lazy_static;
+use openssl::ssl::{SslConnector, SslMethod, SslVerifyMode};
+use postgres::Notification;
+use postgres::{fallible_iterator::FallibleIterator, Client};
+use postgres_openssl::MakeTlsConnector;
+use std::sync::atomic::{AtomicBool, Ordering};
+use std::sync::{Arc, Barrier, Mutex};
+use std::thread;
+use std::time::{Duration, Instant};
+use tokio::sync::mpsc::{channel, Receiver};
+
+use graph::prelude::serde_json;
+use graph::prelude::*;
+
+#[cfg(debug_assertions)]
+lazy_static::lazy_static! {
+    /// Tests set this to true so that `send_store_event` will store a copy
+    /// of each event sent in `EVENT_TAP`
+    pub static ref EVENT_TAP_ENABLED: Mutex<bool> = Mutex::new(false);
+    pub static ref EVENT_TAP: Mutex<Vec<StoreEvent>> = Mutex::new(Vec::new());
+}
+
+#[derive(Clone)]
+/// This newtype exists to make it hard to misuse the `NotificationListener` API in a way that
+/// could impact security.
+pub struct SafeChannelName(String);
+
+impl SafeChannelName {
+    /// Channel names must be valid Postgres SQL identifiers.
+    /// If a channel name is provided that is not a valid identifier,
+    /// then there is a security risk due to SQL injection.
+    /// Unfortunately, it is difficult to properly validate a channel name.
+    /// (A blacklist would have to include SQL keywords, for example)
+    ///
+    /// The caller of this method is promising that the supplied channel name
+    /// is a valid Postgres identifier and cannot be supplied (even partially)
+    /// by an attacker.
+    pub fn i_promise_this_is_safe(channel_name: impl Into<String>) -> Self {
+        SafeChannelName(channel_name.into())
+    }
+
+    pub fn as_str(&self) -> &str {
+        &self.0
+    }
+}
+
+pub struct NotificationListener {
+    worker_handle: Option<thread::JoinHandle<()>>,
+    terminate_worker: Arc<AtomicBool>,
+    worker_barrier: Arc<Barrier>,
+    started: bool,
+}
+
+impl NotificationListener {
+    /// Connect to the specified database and listen for Postgres notifications on the specified
+    /// channel.
+    ///
+    /// Must call `.start()` to begin receiving notifications on the returned receiver.
+    //
+    /// The listener will handle dropping the database connection by
+    /// indefinitely trying to reconnect to the database. Users of the
+    /// listener have no way to find out whether the connection had been
+    /// dropped and was reestablished.
+    pub fn new(
+        logger: &Logger,
+        postgres_url: String,
+        channel_name: SafeChannelName,
+    ) -> (Self, Receiver<JsonNotification>) {
+        // Listen to Postgres notifications in a worker thread
+        let (receiver, worker_handle, terminate_worker, worker_barrier) =
+            Self::listen(logger, postgres_url, channel_name);
+
+        (
+            NotificationListener {
+                worker_handle: Some(worker_handle),
+                terminate_worker,
+                worker_barrier,
+                started: false,
+            },
+            receiver,
+        )
+    }
+
+    /// Start accepting notifications.
+    /// Must be called for any notifications to be received.
+    pub fn start(&mut self) {
+        if !self.started {
+            self.worker_barrier.wait();
+            self.started = true;
+        }
+    }
+
+    fn listen(
+        logger: &Logger,
+        postgres_url: String,
+        channel_name: SafeChannelName,
+    ) -> (
+        Receiver<JsonNotification>,
+        thread::JoinHandle<()>,
+        Arc<AtomicBool>,
+        Arc<Barrier>,
+    ) {
+        /// Connect to the database at `postgres_url` and do a `LISTEN
+        /// {channel_name}`. If that fails, retry with exponential backoff
+        /// with a delay between 1s and 32s
+        ///
+        /// If `barrier` is given, call `barrier.wait()` after the first
+        /// attempt to connect. When the database is up, we make sure that
+        /// we listen before other work that depends on receiving all
+        /// notifications progresses, and when the database is down, that we
+        /// do not unduly block everything.
+        fn connect_and_listen(
+            logger: &Logger,
+            postgres_url: &str,
+            channel_name: &str,
+            barrier: Option<&Barrier>,
+        ) -> Client {
+            let mut backoff =
+                ExponentialBackoff::new(Duration::from_secs(1), Duration::from_secs(30));
+            loop {
+                let mut builder = SslConnector::builder(SslMethod::tls())
+                    .expect("unable to create SslConnector builder");
+                builder.set_verify(SslVerifyMode::NONE);
+                let connector = MakeTlsConnector::new(builder.build());
+
+                let res = Client::connect(postgres_url, connector).and_then(|mut conn| {
+                    conn.execute(format!("LISTEN {}", channel_name).as_str(), &[])?;
+                    Ok(conn)
+                });
+                barrier.map(|barrier| barrier.wait());
+                match res {
+                    Err(e) => {
+                        error!(logger, "Failed to connect notification listener: {}", e;
+                                       "attempt" => backoff.attempt,
+                                       "retry_delay_s" => backoff.delay().as_secs());
+                        backoff.sleep();
+                    }
+                    Ok(conn) => {
+                        return conn;
+                    }
+                }
+            }
+        }
+
+        let logger = logger.new(o!(
+            "component" => "NotificationListener",
+            "channel" => channel_name.0.clone()
+        ));
+
+        debug!(
+            logger,
+            "Cleaning up large notifications after about {}s",
+            ENV_VARS.store.large_notification_cleanup_interval.as_secs(),
+        );
+
+        // Create two ends of a boolean variable for signalling when the worker
+        // thread should be terminated
+        let terminate = Arc::new(AtomicBool::new(false));
+        let terminate_worker = terminate.clone();
+        let barrier = Arc::new(Barrier::new(2));
+        let worker_barrier = barrier.clone();
+
+        // Create a channel for notifications
+        let (sender, receiver) = channel(100);
+
+        let worker_handle = graph::spawn_thread("notification_listener", move || {
+            // We exit the process on panic so unwind safety is irrelevant.
+            std::panic::catch_unwind(std::panic::AssertUnwindSafe(move || {
+                let mut connected = true;
+                let mut conn = connect_and_listen(
+                    &logger,
+                    postgres_url.as_str(),
+                    &channel_name.0,
+                    Some(barrier.as_ref()),
+                );
+
+                let mut max_queue_size_seen = 0;
+
+                // Read notifications until the thread is to be terminated
+                while !terminate.load(Ordering::SeqCst) {
+                    if !connected {
+                        conn = connect_and_listen(
+                            &logger,
+                            postgres_url.as_str(),
+                            &channel_name.0,
+                            None,
+                        );
+                        debug!(logger, "Reconnected notification listener");
+                        connected = true;
+                    }
+
+                    let queue_size = conn.notifications().len();
+                    if queue_size > 1000 && queue_size > max_queue_size_seen {
+                        debug!(logger, "Large notification queue to process";
+                                    "queue_size" => queue_size,
+                                    "channel" => &channel_name.0,
+                        );
+                    }
+                    max_queue_size_seen = queue_size.max(max_queue_size_seen);
+
+                    // Obtain pending notifications from Postgres. We load
+                    // them all into memory, since for large notifications
+                    // we need to query the database again; avoiding this
+                    // load would require that we use a second database
+                    // connection to look up large notifications
+                    //
+                    // We batch notifications such that we do not wait for
+                    // longer than 500ms for new notifications to arrive,
+                    // but limit the size of each batch to 128 to guarantee
+                    // progress on a busy system
+                    let notifications: Vec<_> = conn
+                        .notifications()
+                        .timeout_iter(Duration::from_millis(500))
+                        .iterator()
+                        .take(128)
+                        .filter_map(|item| match item {
+                            Ok(msg) => Some(msg),
+                            Err(e) => {
+                                // When there's an error, process whatever
+                                // notifications we've picked up so far, and
+                                // cause the start of the loop to reconnect
+                                if connected {
+                                    let msg = format!("{}", e);
+                                    crit!(logger, "Error receiving message"; "error" => &msg);
+                                }
+                                connected = false;
+                                None
+                            }
+                        })
+                        .filter(|notification| notification.channel() == channel_name.0)
+                        .collect();
+
+                    // Read notifications until there hasn't been one for 500ms
+                    for notification in notifications {
+                        // Terminate the thread if desired
+                        if terminate.load(Ordering::SeqCst) {
+                            break;
+                        }
+
+                        match JsonNotification::parse(&notification, &mut conn) {
+                            Ok(json_notification) => {
+                                let timeout = ENV_VARS.store.notification_broadcast_timeout;
+                                match graph::block_on(
+                                    sender.send_timeout(json_notification, timeout),
+                                ) {
+                                    // on error or timeout, continue
+                                    Ok(()) => (),
+                                    Err(SendTimeoutError::Timeout(_)) => {
+                                        crit!(
+                                            logger,
+                                            "Timeout broadcasting DB notification, skipping it";
+                                            "timeout_secs" => timeout.as_secs().to_string(),
+                                            "channel" => &channel_name.0,
+                                            "notification" => format!("{:?}", notification),
+                                        );
+                                    }
+
+                                    // If sending fails, this means that the receiver has been
+                                    // dropped and we should terminate the listener loop.
+                                    Err(SendTimeoutError::Closed(_)) => {
+                                        debug!(
+                                            logger,
+                                            "DB notification listener closed";
+                                            "channel" => &channel_name.0,
+                                        );
+                                        break;
+                                    }
+                                }
+                            }
+                            Err(e) => {
+                                crit!(
+                                    logger,
+                                    "Failed to parse database notification";
+                                    "notification" => format!("{:?}", notification),
+                                    "error" => format!("{}", e),
+                                );
+                                continue;
+                            }
+                        }
+                    }
+                }
+            }))
+            .unwrap_or_else(|_| std::process::exit(1))
+        });
+
+        (receiver, worker_handle, terminate_worker, worker_barrier)
+    }
+}
+
+impl Drop for NotificationListener {
+    fn drop(&mut self) {
+        // When dropping the listener, also make sure we signal termination
+        // to the worker and wait for it to shut down
+        self.terminate_worker.store(true, Ordering::SeqCst);
+        self.worker_handle
+            .take()
+            .unwrap()
+            .join()
+            .expect("failed to terminate NotificationListener thread");
+    }
+}
+
+mod public {
+    table! {
+        large_notifications(id) {
+            id -> Integer,
+            payload -> Text,
+            created_at -> Timestamp,
+        }
+    }
+}
+
+// A utility to send JSON notifications that may be larger than the
+// 8000 bytes limit for Postgres NOTIFY payloads. Large notifications
+// are written to the `large_notifications` table and their ID is sent
+// via NOTIFY in place of the actual payload. Consumers of large
+// notifications are then responsible to fetch the actual payload from
+// the `large_notifications` table.
+#[derive(Debug)]
+pub struct JsonNotification {
+    pub process_id: i32,
+    pub channel: String,
+    pub payload: serde_json::Value,
+}
+
+// Any payload bigger than this is considered large. Any notification larger
+// than this will be put into the `large_notifications` table, and only
+// its id in the table will be sent via `notify`
+static LARGE_NOTIFICATION_THRESHOLD: usize = 7800;
+
+impl JsonNotification {
+    pub fn parse(
+        notification: &Notification,
+        conn: &mut Client,
+    ) -> Result<JsonNotification, StoreError> {
+        let value = serde_json::from_str(notification.payload())?;
+
+        match value {
+            serde_json::Value::Number(n) => {
+                let payload_id: i64 = n.as_i64().ok_or_else(|| {
+                    anyhow!("Invalid notification ID, not compatible with i64: {}", n)
+                })?;
+
+                if payload_id < (i32::min_value() as i64) || payload_id > (i32::max_value() as i64)
+                {
+                    Err(anyhow!(
+                        "Invalid notification ID, value exceeds i32: {}",
+                        payload_id
+                    ))?;
+                }
+
+                let payload_rows = conn
+                    .query(
+                        "SELECT payload FROM large_notifications WHERE id = $1",
+                        &[&(payload_id as i32)],
+                    )
+                    .map_err(|e| {
+                        anyhow!(
+                            "Error retrieving payload for notification {}: {}",
+                            payload_id,
+                            e
+                        )
+                    })?;
+
+                if payload_rows.is_empty() || payload_rows.get(0).is_none() {
+                    return Err(anyhow!("No payload found for notification {}", payload_id))?;
+                }
+                let payload: String = payload_rows.get(0).unwrap().get(0);
+
+                Ok(JsonNotification {
+                    process_id: notification.process_id(),
+                    channel: notification.channel().to_string(),
+                    payload: serde_json::from_str(&payload)?,
+                })
+            }
+            serde_json::Value::Object(_) => Ok(JsonNotification {
+                process_id: notification.process_id(),
+                channel: notification.channel().to_string(),
+                payload: value,
+            }),
+            _ => Err(anyhow!("JSON notifications must be numbers or objects"))?,
+        }
+    }
+}
+
+/// Send notifications via `pg_notify`. All sending of notifications through
+/// Postgres should go through this struct as it maintains a Prometheus
+/// metric to track the amount of messages sent
+pub struct NotificationSender {
+    sent_counter: CounterVec,
+}
+
+impl NotificationSender {
+    pub fn new(registry: Arc<dyn MetricsRegistry>) -> Self {
+        let sent_counter = registry
+            .global_counter_vec(
+                "notification_queue_sent",
+                "Number of messages sent through pg_notify()",
+                &["channel", "network"],
+            )
+            .expect("we can create the notification_queue_sent gauge");
+        NotificationSender { sent_counter }
+    }
+
+    /// Send `data` as a Postgres notification on the given `channel`. The
+    /// connection `conn` must be into the primary database as that's the
+    /// only place where listeners connect. The `network` is only used for
+    /// metrics gathering and does not affect how the notification is sent
+    pub fn notify(
+        &self,
+        conn: &PgConnection,
+        channel: &str,
+        network: Option<&str>,
+        data: &serde_json::Value,
+    ) -> Result<(), StoreError> {
+        use diesel::ExpressionMethods;
+        use diesel::RunQueryDsl;
+        use public::large_notifications::dsl::*;
+
+        sql_function! {
+            fn pg_notify(channel: Text, msg: Text)
+        }
+
+        let msg = data.to_string();
+
+        if msg.len() <= LARGE_NOTIFICATION_THRESHOLD {
+            select(pg_notify(channel, &msg)).execute(conn)?;
+        } else {
+            // Write the notification payload to the large_notifications table
+            let payload_id: i32 = diesel::insert_into(large_notifications)
+                .values(payload.eq(&msg))
+                .returning(id)
+                .get_result(conn)?;
+
+            // Use the large_notifications row ID as the payload for NOTIFY
+            select(pg_notify(channel, &payload_id.to_string())).execute(conn)?;
+
+            // Prune old large_notifications. We want to keep the size of the
+            // table manageable, but there's a lot of latitude in how often
+            // we need to clean up before old notifications slow down
+            // data access.
+            //
+            // To avoid checking whether cleanup is needed too often, we
+            // only check once every LARGE_NOTIFICATION_CLEANUP_INTERVAL
+            // (per graph-node process) It would be even better to do this
+            // cleanup only once for all graph-node processes accessing the
+            // same database, but that requires a lot more infrastructure
+            lazy_static! {
+                static ref LAST_CLEANUP_CHECK: Mutex<Instant> = Mutex::new(Instant::now());
+            }
+
+            // If we can't get the lock, another thread in this process is
+            // already checking, and we can just skip checking
+            if let Ok(mut last_check) = LAST_CLEANUP_CHECK.try_lock() {
+                if last_check.elapsed() > ENV_VARS.store.large_notification_cleanup_interval {
+                    diesel::sql_query(format!(
+                        "delete from large_notifications
+                         where created_at < current_timestamp - interval '{}s'",
+                        ENV_VARS.store.large_notification_cleanup_interval.as_secs(),
+                    ))
+                    .execute(conn)?;
+                    *last_check = Instant::now();
+                }
+            }
+        }
+        self.sent_counter
+            .with_label_values(&[channel, network.unwrap_or("none")])
+            .inc();
+        Ok(())
+    }
+}
diff --git a/store/postgres/src/primary.rs b/store/postgres/src/primary.rs
new file mode 100644
index 0000000..9071778
--- /dev/null
+++ b/store/postgres/src/primary.rs
@@ -0,0 +1,1735 @@
+//! Utilities for dealing with subgraph metadata that resides in the primary
+//! shard. Anything in this module can only be used with a database connection
+//! for the primary shard.
+use diesel::{
+    connection::SimpleConnection,
+    data_types::PgTimestamp,
+    dsl::{any, exists, not, select},
+    pg::Pg,
+    serialize::Output,
+    sql_types::{Array, Integer, Text},
+    types::{FromSql, ToSql},
+};
+use diesel::{
+    dsl::{delete, insert_into, sql, update},
+    r2d2::PooledConnection,
+};
+use diesel::{pg::PgConnection, r2d2::ConnectionManager};
+use diesel::{
+    prelude::{
+        BoolExpressionMethods, ExpressionMethods, GroupByDsl, JoinOnDsl, NullableExpressionMethods,
+        OptionalExtension, QueryDsl, RunQueryDsl,
+    },
+    Connection as _,
+};
+use graph::{
+    components::store::DeploymentLocator,
+    constraint_violation,
+    data::subgraph::status,
+    prelude::{
+        anyhow, bigdecimal::ToPrimitive, serde_json, DeploymentHash, EntityChange,
+        EntityChangeOperation, NodeId, StoreError, SubgraphName, SubgraphVersionSwitchingMode,
+    },
+};
+use graph::{
+    components::store::{DeploymentId as GraphDeploymentId, DeploymentSchemaVersion},
+    prelude::{chrono, CancelHandle, CancelToken},
+};
+use graph::{data::subgraph::schema::generate_entity_id, prelude::StoreEvent};
+use itertools::Itertools;
+use maybe_owned::MaybeOwned;
+use std::{
+    borrow::Borrow,
+    collections::HashMap,
+    convert::TryFrom,
+    convert::TryInto,
+    fmt,
+    io::Write,
+    time::{SystemTime, UNIX_EPOCH},
+};
+
+use crate::{
+    block_range::UNVERSIONED_RANGE,
+    connection_pool::{ConnectionPool, ForeignServer},
+    detail::DeploymentDetail,
+    subgraph_store::{unused, Shard, PRIMARY_SHARD},
+    NotificationSender,
+};
+
+#[cfg(debug_assertions)]
+use std::sync::Mutex;
+#[cfg(debug_assertions)]
+lazy_static::lazy_static! {
+    /// Tests set this to true so that `send_store_event` will store a copy
+    /// of each event sent in `EVENT_TAP`
+    pub static ref EVENT_TAP_ENABLED: Mutex<bool> = Mutex::new(false);
+    pub static ref EVENT_TAP: Mutex<Vec<StoreEvent>> = Mutex::new(Vec::new());
+}
+
+table! {
+    subgraphs.subgraph (vid) {
+        vid -> BigInt,
+        id -> Text,
+        name -> Text,
+        current_version -> Nullable<Text>,
+        pending_version -> Nullable<Text>,
+        created_at -> Numeric,
+        block_range -> Range<Integer>,
+    }
+}
+
+table! {
+    subgraphs.subgraph_version (vid) {
+        vid -> BigInt,
+        id -> Text,
+        subgraph -> Text,
+        deployment -> Text,
+        created_at -> Numeric,
+        block_range -> Range<Integer>,
+    }
+}
+
+table! {
+    subgraphs.subgraph_deployment_assignment {
+        id -> Integer,
+        node_id -> Text,
+    }
+}
+
+table! {
+    active_copies(dst) {
+        src -> Integer,
+        dst -> Integer,
+        queued_at -> Timestamptz,
+        // Setting this column to a value signals to a running copy process
+        // that a cancel has been requested. The copy process checks this
+        // periodically and stops as soon as this is not null anymore
+        cancelled_at -> Nullable<Timestamptz>,
+    }
+}
+
+table! {
+    public.ens_names(hash) {
+        hash -> Varchar,
+        name -> Varchar,
+    }
+}
+
+table! {
+    deployment_schemas(id) {
+        id -> Integer,
+        created_at -> Timestamptz,
+        subgraph -> Text,
+        name -> Text,
+        shard -> Text,
+        /// The subgraph layout scheme used for this subgraph
+        version -> Integer,
+        network -> Text,
+        /// If there are multiple entries for the same IPFS hash (`subgraph`)
+        /// only one of them will be active. That's the one we use for
+        /// querying
+        active -> Bool,
+    }
+}
+
+table! {
+    /// A table to track deployments that are no longer used. Once an unused
+    /// deployment has been removed, the entry in this table is the only
+    /// trace in the system that it ever existed
+    unused_deployments(id) {
+        // This is the same as what deployment_schemas.id was when the
+        // deployment was still around
+        id -> Integer,
+        // The IPFS hash of the deployment
+        deployment -> Text,
+        // When we first detected that the deployment was unused
+        unused_at -> Timestamptz,
+        // When we actually deleted the deployment
+        removed_at -> Nullable<Timestamptz>,
+        // When the deployment was created
+        created_at -> Timestamptz,
+        /// Data that we get from the primary
+        subgraphs -> Nullable<Array<Text>>,
+        namespace -> Text,
+        shard -> Text,
+
+        /// Data we fill in from the deployment's shard
+        entity_count -> Integer,
+        latest_ethereum_block_hash -> Nullable<Binary>,
+        latest_ethereum_block_number -> Nullable<Integer>,
+        failed -> Bool,
+        synced -> Bool,
+    }
+}
+
+table! {
+    public.db_version(version) {
+        #[sql_name = "db_version"]
+        version -> BigInt,
+    }
+}
+
+allow_tables_to_appear_in_same_query!(
+    subgraph,
+    subgraph_version,
+    subgraph_deployment_assignment,
+    deployment_schemas,
+    unused_deployments,
+    active_copies,
+);
+
+/// Information about the database schema that stores the entities for a
+/// subgraph.
+#[derive(Clone, Queryable, QueryableByName, Debug)]
+#[table_name = "deployment_schemas"]
+struct Schema {
+    id: DeploymentId,
+    #[allow(dead_code)]
+    pub created_at: PgTimestamp,
+    pub subgraph: String,
+    pub name: String,
+    pub shard: String,
+    version: i32,
+    pub network: String,
+    pub(crate) active: bool,
+}
+
+#[derive(Clone, Queryable, QueryableByName, Debug)]
+#[table_name = "unused_deployments"]
+pub struct UnusedDeployment {
+    pub id: DeploymentId,
+    pub deployment: String,
+    pub unused_at: PgTimestamp,
+    pub removed_at: Option<PgTimestamp>,
+    pub created_at: PgTimestamp,
+    pub subgraphs: Option<Vec<String>>,
+    pub namespace: String,
+    pub shard: String,
+
+    /// Data we fill in from the deployment's shard
+    pub entity_count: i32,
+    pub latest_ethereum_block_hash: Option<Vec<u8>>,
+    pub latest_ethereum_block_number: Option<i32>,
+    pub failed: bool,
+    pub synced: bool,
+}
+
+#[derive(Clone, Debug, PartialEq, Eq, Hash, AsExpression, FromSqlRow)]
+#[sql_type = "diesel::sql_types::Text"]
+/// A namespace (schema) in the database
+pub struct Namespace(String);
+
+/// The name of the `public` schema in Postgres
+pub const NAMESPACE_PUBLIC: &str = "public";
+/// The name of the `subgraphs` schema in Postgres
+pub const NAMESPACE_SUBGRAPHS: &str = "subgraphs";
+
+impl Namespace {
+    pub fn new(s: String) -> Result<Self, String> {
+        // Normal database namespaces must be of the form `sgd[0-9]+`
+        if !s.starts_with("sgd") || s.len() <= 3 {
+            return Err(s);
+        }
+        for c in s.chars().skip(3) {
+            if !c.is_numeric() {
+                return Err(s);
+            }
+        }
+
+        Ok(Namespace(s))
+    }
+
+    pub fn as_str(&self) -> &str {
+        &self.0
+    }
+}
+
+impl fmt::Display for Namespace {
+    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
+        self.0.fmt(f)
+    }
+}
+
+impl FromSql<Text, Pg> for Namespace {
+    fn from_sql(bytes: Option<&[u8]>) -> diesel::deserialize::Result<Self> {
+        let s = <String as FromSql<Text, Pg>>::from_sql(bytes)?;
+        Namespace::new(s).map_err(Into::into)
+    }
+}
+
+impl ToSql<Text, Pg> for Namespace {
+    fn to_sql<W: Write>(&self, out: &mut Output<W, Pg>) -> diesel::serialize::Result {
+        <String as ToSql<Text, Pg>>::to_sql(&self.0, out)
+    }
+}
+
+impl Borrow<str> for Namespace {
+    fn borrow(&self) -> &str {
+        &self.0
+    }
+}
+
+/// A marker that an `i32` references a deployment. Values of this type hold
+/// the primary key from the `deployment_schemas` table
+#[derive(Copy, Clone, Debug, PartialEq, Eq, Hash, AsExpression, FromSqlRow)]
+#[sql_type = "diesel::sql_types::Integer"]
+pub struct DeploymentId(i32);
+
+impl fmt::Display for DeploymentId {
+    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
+        self.0.fmt(f)
+    }
+}
+
+impl From<DeploymentId> for GraphDeploymentId {
+    fn from(id: DeploymentId) -> Self {
+        GraphDeploymentId::new(id.0)
+    }
+}
+
+impl From<GraphDeploymentId> for DeploymentId {
+    fn from(id: GraphDeploymentId) -> Self {
+        DeploymentId(id.0)
+    }
+}
+
+impl From<DeploymentLocator> for DeploymentId {
+    fn from(loc: DeploymentLocator) -> Self {
+        Self::from(loc.id)
+    }
+}
+
+impl FromSql<Integer, Pg> for DeploymentId {
+    fn from_sql(bytes: Option<&[u8]>) -> diesel::deserialize::Result<Self> {
+        let id = <i32 as FromSql<Integer, Pg>>::from_sql(bytes)?;
+        Ok(DeploymentId(id))
+    }
+}
+
+impl ToSql<Integer, Pg> for DeploymentId {
+    fn to_sql<W: Write>(&self, out: &mut Output<W, Pg>) -> diesel::serialize::Result {
+        <i32 as ToSql<Integer, Pg>>::to_sql(&self.0, out)
+    }
+}
+
+#[derive(Debug, PartialEq)]
+/// Details about a deployment and the shard in which it is stored. We need
+/// the database namespace for the deployment as that information is only
+/// stored in the primary database.
+///
+/// Any instance of this struct must originate in the database
+pub struct Site {
+    pub id: DeploymentId,
+    /// The subgraph deployment
+    pub deployment: DeploymentHash,
+    /// The name of the database shard
+    pub shard: Shard,
+    /// The database namespace (schema) that holds the data for the deployment
+    pub namespace: Namespace,
+    /// The name of the network to which this deployment belongs
+    pub network: String,
+    /// Whether this is the site that should be used for queries. There's
+    /// exactly one for each `deployment`, i.e., other entries for that
+    /// deployment have `active = false`
+    pub(crate) active: bool,
+
+    pub(crate) schema_version: DeploymentSchemaVersion,
+    /// Only the store and tests can create Sites
+    _creation_disallowed: (),
+}
+
+impl TryFrom<Schema> for Site {
+    type Error = StoreError;
+
+    fn try_from(schema: Schema) -> Result<Self, Self::Error> {
+        let deployment = DeploymentHash::new(&schema.subgraph)
+            .map_err(|s| constraint_violation!("Invalid deployment id {}", s))?;
+        let namespace = Namespace::new(schema.name.clone()).map_err(|nsp| {
+            constraint_violation!(
+                "Invalid schema name {} for deployment {}",
+                nsp,
+                &schema.subgraph
+            )
+        })?;
+        let shard = Shard::new(schema.shard)?;
+        let schema_version = DeploymentSchemaVersion::try_from(schema.version)?;
+        Ok(Self {
+            id: schema.id,
+            deployment,
+            namespace,
+            shard,
+            network: schema.network,
+            active: schema.active,
+            schema_version,
+            _creation_disallowed: (),
+        })
+    }
+}
+
+impl From<&Site> for DeploymentLocator {
+    fn from(site: &Site) -> Self {
+        DeploymentLocator::new(site.id.into(), site.deployment.clone())
+    }
+}
+
+/// This is only used for tests to allow them to create a `Site` that does
+/// not originate in the database
+#[cfg(debug_assertions)]
+pub fn make_dummy_site(deployment: DeploymentHash, namespace: Namespace, network: String) -> Site {
+    Site {
+        id: DeploymentId(-7),
+        deployment,
+        shard: PRIMARY_SHARD.clone(),
+        namespace,
+        network,
+        active: true,
+        schema_version: DeploymentSchemaVersion::V0,
+        _creation_disallowed: (),
+    }
+}
+
+/// Queries that we need for both the `Connection` and the `Mirror`. Since
+/// they will also be used by `Mirror`, they can only use tables that are
+/// mirrored through `Mirror::refresh_tables` and must be queries, i.e.,
+/// read-only
+mod queries {
+    use diesel::dsl::{any, exists, sql};
+    use diesel::pg::PgConnection;
+    use diesel::prelude::{
+        BoolExpressionMethods, ExpressionMethods, JoinOnDsl, NullableExpressionMethods,
+        OptionalExtension, QueryDsl, RunQueryDsl,
+    };
+    use diesel::sql_types::Text;
+    use graph::prelude::NodeId;
+    use graph::{
+        constraint_violation,
+        data::subgraph::status,
+        prelude::{DeploymentHash, StoreError, SubgraphName},
+    };
+    use std::{collections::HashMap, convert::TryFrom, convert::TryInto};
+
+    use crate::Shard;
+
+    use super::{DeploymentId, Schema, Site};
+
+    // These are the only tables that functions in this module may use. If
+    // additional tables are needed, they need to be set up for mirroring
+    // first
+    use super::deployment_schemas as ds;
+    use super::subgraph as s;
+    use super::subgraph_deployment_assignment as a;
+    use super::subgraph_version as v;
+
+    pub(super) fn find_active_site(
+        conn: &PgConnection,
+        subgraph: &DeploymentHash,
+    ) -> Result<Option<Site>, StoreError> {
+        let schema = ds::table
+            .filter(ds::subgraph.eq(subgraph.to_string()))
+            .filter(ds::active.eq(true))
+            .first::<Schema>(conn)
+            .optional()?;
+        schema.map(|schema| schema.try_into()).transpose()
+    }
+
+    pub(super) fn find_site_by_ref(
+        conn: &PgConnection,
+        id: DeploymentId,
+    ) -> Result<Option<Site>, StoreError> {
+        let schema = ds::table.find(id).first::<Schema>(conn).optional()?;
+        schema.map(|schema| schema.try_into()).transpose()
+    }
+
+    pub(super) fn subgraph_exists(
+        conn: &PgConnection,
+        name: &SubgraphName,
+    ) -> Result<bool, StoreError> {
+        Ok(
+            diesel::select(exists(s::table.filter(s::name.eq(name.as_str()))))
+                .get_result::<bool>(conn)?,
+        )
+    }
+
+    pub(super) fn current_deployment_for_subgraph(
+        conn: &PgConnection,
+        name: &SubgraphName,
+    ) -> Result<DeploymentHash, StoreError> {
+        let id = v::table
+            .inner_join(s::table.on(s::current_version.eq(v::id.nullable())))
+            .filter(s::name.eq(name.as_str()))
+            .select(v::deployment)
+            .first::<String>(conn)
+            .optional()?;
+        match id {
+            Some(id) => DeploymentHash::new(id)
+                .map_err(|id| constraint_violation!("illegal deployment id: {}", id)),
+            None => Err(StoreError::DeploymentNotFound(name.to_string())),
+        }
+    }
+
+    pub(super) fn deployments_for_subgraph(
+        conn: &PgConnection,
+        name: &str,
+    ) -> Result<Vec<Site>, StoreError> {
+        ds::table
+            .inner_join(v::table.on(ds::subgraph.eq(v::deployment)))
+            .inner_join(s::table.on(v::subgraph.eq(s::id)))
+            .filter(s::name.eq(name))
+            .filter(ds::active)
+            .order_by(v::created_at.asc())
+            .select(ds::all_columns)
+            .load::<Schema>(conn)?
+            .into_iter()
+            .map(Site::try_from)
+            .collect::<Result<Vec<Site>, _>>()
+    }
+
+    pub(super) fn subgraph_version(
+        conn: &PgConnection,
+        name: &str,
+        use_current: bool,
+    ) -> Result<Option<Site>, StoreError> {
+        let deployment = if use_current {
+            ds::table
+                .select(ds::all_columns)
+                .inner_join(v::table.on(ds::subgraph.eq(v::deployment)))
+                .inner_join(s::table.on(s::current_version.eq(v::id.nullable())))
+                .filter(s::name.eq(&name))
+                .filter(ds::active)
+                .first::<Schema>(conn)
+        } else {
+            ds::table
+                .select(ds::all_columns)
+                .inner_join(v::table.on(ds::subgraph.eq(v::deployment)))
+                .inner_join(s::table.on(s::pending_version.eq(v::id.nullable())))
+                .filter(s::name.eq(&name))
+                .filter(ds::active)
+                .first::<Schema>(conn)
+        };
+        deployment.optional()?.map(Site::try_from).transpose()
+    }
+
+    /// Find sites by their subgraph deployment hashes. If `ids` is empty,
+    /// return all sites
+    pub(super) fn find_sites(
+        conn: &PgConnection,
+        ids: &[String],
+        only_active: bool,
+    ) -> Result<Vec<Site>, StoreError> {
+        let schemas = if ids.is_empty() {
+            if only_active {
+                ds::table.filter(ds::active).load::<Schema>(conn)?
+            } else {
+                ds::table.load::<Schema>(conn)?
+            }
+        } else {
+            if only_active {
+                ds::table
+                    .filter(ds::active)
+                    .filter(ds::subgraph.eq_any(ids))
+                    .load::<Schema>(conn)?
+            } else {
+                ds::table
+                    .filter(ds::subgraph.eq_any(ids))
+                    .load::<Schema>(conn)?
+            }
+        };
+        schemas
+            .into_iter()
+            .map(|schema| schema.try_into())
+            .collect()
+    }
+
+    /// Find sites by their subgraph deployment ids. If `ids` is empty,
+    /// return no sites
+    pub(super) fn find_sites_by_id(
+        conn: &PgConnection,
+        ids: &[DeploymentId],
+    ) -> Result<Vec<Site>, StoreError> {
+        let schemas = ds::table.filter(ds::id.eq_any(ids)).load::<Schema>(conn)?;
+        schemas
+            .into_iter()
+            .map(|schema| schema.try_into())
+            .collect()
+    }
+
+    pub(super) fn find_site_in_shard(
+        conn: &PgConnection,
+        subgraph: &DeploymentHash,
+        shard: &Shard,
+    ) -> Result<Option<Site>, StoreError> {
+        let schema = ds::table
+            .filter(ds::subgraph.eq(subgraph.as_str()))
+            .filter(ds::shard.eq(shard.as_str()))
+            .first::<Schema>(conn)
+            .optional()?;
+        schema.map(|schema| schema.try_into()).transpose()
+    }
+
+    pub(super) fn assignments(conn: &PgConnection, node: &NodeId) -> Result<Vec<Site>, StoreError> {
+        ds::table
+            .inner_join(a::table.on(a::id.eq(ds::id)))
+            .filter(a::node_id.eq(node.as_str()))
+            .select(ds::all_columns)
+            .load::<Schema>(conn)?
+            .into_iter()
+            .map(Site::try_from)
+            .collect::<Result<Vec<Site>, _>>()
+    }
+
+    pub(super) fn fill_assignments(
+        conn: &PgConnection,
+        infos: &mut [status::Info],
+    ) -> Result<(), StoreError> {
+        let ids: Vec<_> = infos.iter().map(|info| &info.subgraph).collect();
+        let nodes: HashMap<_, _> = a::table
+            .inner_join(ds::table.on(ds::id.eq(a::id)))
+            .filter(ds::subgraph.eq(any(ids)))
+            .select((ds::subgraph, a::node_id))
+            .load::<(String, String)>(conn)?
+            .into_iter()
+            .collect();
+        for mut info in infos {
+            info.node = nodes.get(&info.subgraph).cloned()
+        }
+        Ok(())
+    }
+
+    pub(super) fn assigned_node(
+        conn: &PgConnection,
+        site: &Site,
+    ) -> Result<Option<NodeId>, StoreError> {
+        a::table
+            .filter(a::id.eq(site.id))
+            .select(a::node_id)
+            .first::<String>(conn)
+            .optional()?
+            .map(|node| {
+                NodeId::new(&node).map_err(|()| {
+                    constraint_violation!(
+                        "invalid node id `{}` in assignment for `{}`",
+                        node,
+                        site.deployment
+                    )
+                })
+            })
+            .transpose()
+    }
+
+    pub(super) fn version_info(
+        conn: &PgConnection,
+        version: &str,
+    ) -> Result<Option<(String, String)>, StoreError> {
+        Ok(v::table
+            .select((v::deployment, sql("created_at::text")))
+            .filter(v::id.eq(version))
+            .first::<(String, String)>(conn)
+            .optional()?)
+    }
+
+    pub(super) fn versions_for_subgraph_id(
+        conn: &PgConnection,
+        subgraph_id: &str,
+    ) -> Result<(Option<String>, Option<String>), StoreError> {
+        Ok(s::table
+            .select((s::current_version.nullable(), s::pending_version.nullable()))
+            .filter(s::id.eq(subgraph_id))
+            .first::<(Option<String>, Option<String>)>(conn)
+            .optional()?
+            .unwrap_or((None, None)))
+    }
+
+    /// Returns all (subgraph_name, version) pairs for a given deployment hash.
+    pub fn subgraphs_by_deployment_hash(
+        conn: &PgConnection,
+        deployment_hash: &str,
+    ) -> Result<Vec<(String, String)>, StoreError> {
+        v::table
+                .inner_join(
+                    s::table.on(v::id
+                        .nullable()
+                        .eq(s::current_version)
+                        .or(v::id.nullable().eq(s::pending_version))),
+                )
+                .filter(v::deployment.eq(&deployment_hash))
+                .select((
+                    s::name,
+                    sql::<Text>(
+                        "(case when subgraphs.subgraph.pending_version = subgraphs.subgraph_version.id then 'pending'
+                               when subgraphs.subgraph.current_version = subgraphs.subgraph_version.id then 'current'
+                               else 'unused'
+                         end) as version",
+                    ),
+                ))
+                .get_results(conn)
+                .map_err(Into::into)
+    }
+}
+
+/// A wrapper for a database connection that provides access to functionality
+/// that works only on the primary database
+pub struct Connection<'a> {
+    conn: MaybeOwned<'a, PooledConnection<ConnectionManager<PgConnection>>>,
+}
+
+impl<'a> Connection<'a> {
+    pub fn new(
+        conn: impl Into<MaybeOwned<'a, PooledConnection<ConnectionManager<PgConnection>>>>,
+    ) -> Self {
+        Self { conn: conn.into() }
+    }
+
+    pub(crate) fn transaction<T, E, F>(&self, f: F) -> Result<T, E>
+    where
+        F: FnOnce() -> Result<T, E>,
+        E: From<diesel::result::Error>,
+    {
+        self.conn.transaction(f)
+    }
+
+    /// Signal any copy process that might be copying into one of these
+    /// deployments that it should stop. Copying is cancelled whenever we
+    /// remove the assignment for a deployment
+    fn cancel_copies(&self, ids: Vec<DeploymentId>) -> Result<(), StoreError> {
+        use active_copies as ac;
+
+        update(ac::table.filter(ac::dst.eq_any(ids)))
+            .set(ac::cancelled_at.eq(sql("now()")))
+            .execute(self.conn.as_ref())?;
+        Ok(())
+    }
+
+    /// Delete all assignments for deployments that are neither the current nor the
+    /// pending version of a subgraph and return the deployment id's
+    fn remove_unused_assignments(&self) -> Result<Vec<EntityChange>, StoreError> {
+        use deployment_schemas as ds;
+        use subgraph as s;
+        use subgraph_deployment_assignment as a;
+        use subgraph_version as v;
+
+        let named = v::table
+            .inner_join(
+                s::table.on(v::id
+                    .nullable()
+                    .eq(s::current_version)
+                    .or(v::id.nullable().eq(s::pending_version))),
+            )
+            .inner_join(ds::table.on(v::deployment.eq(ds::subgraph)))
+            .filter(a::id.eq(ds::id))
+            .select(ds::id);
+
+        let removed = delete(a::table.filter(not(exists(named))))
+            .returning(a::id)
+            .load::<i32>(self.conn.as_ref())?;
+
+        let removed: Vec<_> = ds::table
+            .filter(ds::id.eq_any(removed))
+            .select((ds::id, ds::subgraph))
+            .load::<(DeploymentId, String)>(self.conn.as_ref())?
+            .into_iter()
+            .collect();
+
+        // Stop ongoing copies
+        let removed_ids: Vec<_> = removed.iter().map(|(id, _)| *id).collect();
+        self.cancel_copies(removed_ids)?;
+
+        let events = removed
+            .into_iter()
+            .map(|(id, hash)| {
+                DeploymentHash::new(hash)
+                    .map(|hash| {
+                        EntityChange::for_assignment(
+                            DeploymentLocator::new(id.into(), hash),
+                            EntityChangeOperation::Removed,
+                        )
+                    })
+                    .map_err(|id| {
+                        StoreError::ConstraintViolation(format!(
+                            "invalid id `{}` for deployment assignment",
+                            id
+                        ))
+                    })
+            })
+            .collect::<Result<Vec<_>, _>>()?;
+        Ok(events)
+    }
+
+    /// Promote the deployment `id` to the current version everywhere where it was
+    /// the pending version so far, and remove any assignments that are not needed
+    /// any longer as a result. Return the changes that were made to assignments
+    /// in the process
+    pub fn promote_deployment(&self, id: &DeploymentHash) -> Result<Vec<EntityChange>, StoreError> {
+        use subgraph as s;
+        use subgraph_version as v;
+
+        let conn = self.conn.as_ref();
+
+        // Subgraphs where we need to promote the version
+        let pending_subgraph_versions: Vec<(String, String)> = s::table
+            .inner_join(v::table.on(s::pending_version.eq(v::id.nullable())))
+            .filter(v::deployment.eq(id.as_str()))
+            .select((s::id, v::id))
+            .for_update()
+            .load(conn)?;
+
+        // Switch the pending version to the current version
+        for (subgraph, version) in &pending_subgraph_versions {
+            update(s::table.filter(s::id.eq(subgraph)))
+                .set((
+                    s::current_version.eq(version),
+                    s::pending_version.eq::<Option<&str>>(None),
+                ))
+                .execute(conn)?;
+        }
+
+        // Clean up assignments if we could possibly have changed any
+        // subgraph versions
+        let changes = if pending_subgraph_versions.is_empty() {
+            vec![]
+        } else {
+            self.remove_unused_assignments()?
+        };
+        Ok(changes)
+    }
+
+    /// Create a new subgraph with the given name. If one already exists, use
+    /// the existing one. Return the `id` of the newly created or existing
+    /// subgraph
+    pub fn create_subgraph(&self, name: &SubgraphName) -> Result<String, StoreError> {
+        use subgraph as s;
+
+        let conn = self.conn.as_ref();
+        let id = generate_entity_id();
+        let created_at = SystemTime::now()
+            .duration_since(UNIX_EPOCH)
+            .unwrap()
+            .as_secs();
+        let inserted = insert_into(s::table)
+            .values((
+                s::id.eq(&id),
+                s::name.eq(name.as_str()),
+                // using BigDecimal::from(created_at) produced a scale error
+                s::created_at.eq(sql(&format!("{}", created_at))),
+                s::block_range.eq(UNVERSIONED_RANGE),
+            ))
+            .on_conflict(s::name)
+            .do_nothing()
+            .execute(conn)?;
+        if inserted == 0 {
+            let existing_id = s::table
+                .filter(s::name.eq(name.as_str()))
+                .select(s::id)
+                .first::<String>(conn)?;
+            Ok(existing_id)
+        } else {
+            Ok(id)
+        }
+    }
+
+    pub fn create_subgraph_version<F>(
+        &self,
+        name: SubgraphName,
+        site: &Site,
+        node_id: NodeId,
+        mode: SubgraphVersionSwitchingMode,
+        exists_and_synced: F,
+    ) -> Result<Vec<EntityChange>, StoreError>
+    where
+        F: Fn(&DeploymentHash) -> Result<bool, StoreError>,
+    {
+        use subgraph as s;
+        use subgraph_deployment_assignment as a;
+        use subgraph_version as v;
+        use SubgraphVersionSwitchingMode::*;
+
+        let conn = self.conn.as_ref();
+
+        let created_at = SystemTime::now()
+            .duration_since(UNIX_EPOCH)
+            .unwrap()
+            .as_secs();
+
+        // Check the current state of the the subgraph. If no subgraph with the
+        // name exists, create one
+        let info = s::table
+            .left_outer_join(v::table.on(s::current_version.eq(v::id.nullable())))
+            .filter(s::name.eq(name.as_str()))
+            .select((s::id, v::deployment.nullable()))
+            .first::<(String, Option<String>)>(conn)
+            .optional()?;
+        let (subgraph_id, current_deployment) = match info {
+            Some((subgraph_id, current_deployment)) => (subgraph_id, current_deployment),
+            None => (self.create_subgraph(&name)?, None),
+        };
+        let pending_deployment = s::table
+            .left_outer_join(v::table.on(s::pending_version.eq(v::id.nullable())))
+            .filter(s::id.eq(&subgraph_id))
+            .select(v::deployment.nullable())
+            .first::<Option<String>>(conn)?;
+
+        // See if the current version of that subgraph is synced. If the subgraph
+        // has no current version, we treat it the same as if it were not synced
+        // The `optional` below only comes into play if data is corrupted/missing;
+        // ignoring that via `optional` makes it possible to fix a missing version
+        // or deployment by deploying over it.
+        let current_exists_and_synced = current_deployment
+            .as_deref()
+            .map(|id| {
+                DeploymentHash::new(id)
+                    .map_err(StoreError::DeploymentNotFound)
+                    .and_then(|id| exists_and_synced(&id))
+            })
+            .transpose()?
+            .unwrap_or(false);
+
+        // Check if we even need to make any changes
+        let change_needed = match (mode, current_exists_and_synced) {
+            (Instant, _) | (Synced, false) => {
+                current_deployment.as_deref() != Some(site.deployment.as_str())
+            }
+            (Synced, true) => pending_deployment.as_deref() != Some(site.deployment.as_str()),
+        };
+        if !change_needed {
+            return Ok(vec![]);
+        }
+
+        // Create the actual subgraph version
+        let version_id = generate_entity_id();
+        insert_into(v::table)
+            .values((
+                v::id.eq(&version_id),
+                v::subgraph.eq(&subgraph_id),
+                v::deployment.eq(site.deployment.as_str()),
+                // using BigDecimal::from(created_at) produced a scale error
+                v::created_at.eq(sql(&format!("{}", created_at))),
+                v::block_range.eq(UNVERSIONED_RANGE),
+            ))
+            .execute(conn)?;
+
+        // Create a subgraph assignment if there isn't one already
+        let new_assignment = a::table
+            .filter(a::id.eq(site.id))
+            .select(a::id)
+            .first::<i32>(conn)
+            .optional()?
+            .is_none();
+        if new_assignment {
+            insert_into(a::table)
+                .values((a::id.eq(site.id), a::node_id.eq(node_id.as_str())))
+                .execute(conn)?;
+        }
+
+        // See if we should make this the current or pending version
+        let subgraph_row = update(s::table.filter(s::id.eq(&subgraph_id)));
+        // When the new deployment is also synced already, we always want to
+        // overwrite the current version
+        let new_exists_and_synced = exists_and_synced(&site.deployment)?;
+        match (mode, current_exists_and_synced, new_exists_and_synced) {
+            (Instant, _, _) | (Synced, false, _) | (Synced, true, true) => {
+                subgraph_row
+                    .set((
+                        s::current_version.eq(&version_id),
+                        s::pending_version.eq::<Option<&str>>(None),
+                    ))
+                    .execute(conn)?;
+            }
+            (Synced, true, false) => {
+                subgraph_row
+                    .set(s::pending_version.eq(&version_id))
+                    .execute(conn)?;
+            }
+        }
+
+        // Clean up any assignments we might have displaced
+        let mut changes = self.remove_unused_assignments()?;
+        if new_assignment {
+            let change = EntityChange::for_assignment(site.into(), EntityChangeOperation::Set);
+            changes.push(change);
+        }
+        Ok(changes)
+    }
+
+    pub fn remove_subgraph(&self, name: SubgraphName) -> Result<Vec<EntityChange>, StoreError> {
+        use subgraph as s;
+        use subgraph_version as v;
+
+        let conn = self.conn.as_ref();
+
+        // Get the id of the given subgraph. If no subgraph with the
+        // name exists, there is nothing to do
+        let subgraph: Option<String> = s::table
+            .filter(s::name.eq(name.as_str()))
+            .select(s::id)
+            .first(conn)
+            .optional()?;
+        if let Some(subgraph) = subgraph {
+            delete(v::table.filter(v::subgraph.eq(&subgraph))).execute(conn)?;
+            delete(s::table.filter(s::id.eq(subgraph))).execute(conn)?;
+            self.remove_unused_assignments()
+        } else {
+            Ok(vec![])
+        }
+    }
+
+    pub fn reassign_subgraph(
+        &self,
+        site: &Site,
+        node: &NodeId,
+    ) -> Result<Vec<EntityChange>, StoreError> {
+        use subgraph_deployment_assignment as a;
+
+        let conn = self.conn.as_ref();
+        let updates = update(a::table.filter(a::id.eq(site.id)))
+            .set(a::node_id.eq(node.as_str()))
+            .execute(conn)?;
+        match updates {
+            0 => Err(StoreError::DeploymentNotFound(site.deployment.to_string())),
+            1 => {
+                let change = EntityChange::for_assignment(site.into(), EntityChangeOperation::Set);
+                Ok(vec![change])
+            }
+            _ => {
+                // `id` is the primary key of the subgraph_deployment_assignment table,
+                // and we can therefore only update no or one entry
+                unreachable!()
+            }
+        }
+    }
+
+    pub fn assign_subgraph(
+        &self,
+        site: &Site,
+        node: &NodeId,
+    ) -> Result<Vec<EntityChange>, StoreError> {
+        use subgraph_deployment_assignment as a;
+
+        let conn = self.conn.as_ref();
+        insert_into(a::table)
+            .values((a::id.eq(site.id), a::node_id.eq(node.as_str())))
+            .execute(conn)?;
+
+        let change = EntityChange::for_assignment(site.into(), EntityChangeOperation::Set);
+        Ok(vec![change])
+    }
+
+    pub fn unassign_subgraph(&self, site: &Site) -> Result<Vec<EntityChange>, StoreError> {
+        use subgraph_deployment_assignment as a;
+
+        let conn = self.conn.as_ref();
+        let delete_count = delete(a::table.filter(a::id.eq(site.id))).execute(conn)?;
+
+        self.cancel_copies(vec![site.id])?;
+
+        match delete_count {
+            0 => Ok(vec![]),
+            1 => {
+                let change =
+                    EntityChange::for_assignment(site.into(), EntityChangeOperation::Removed);
+                Ok(vec![change])
+            }
+            _ => {
+                // `id` is the unique in the subgraph_deployment_assignment table,
+                // and we can therefore only update no or one entry
+                unreachable!()
+            }
+        }
+    }
+
+    /// Create a new site and possibly set it to the active site. This
+    /// function only performs the basic operations for creation, and the
+    /// caller must check that other conditions (like whether there already
+    /// is an active site for the deployment) are met
+    fn create_site(
+        &self,
+        shard: Shard,
+        deployment: DeploymentHash,
+        network: String,
+        schema_version: DeploymentSchemaVersion,
+        active: bool,
+    ) -> Result<Site, StoreError> {
+        use deployment_schemas as ds;
+
+        let conn = self.conn.as_ref();
+
+        let schemas: Vec<(DeploymentId, String)> = diesel::insert_into(ds::table)
+            .values((
+                ds::subgraph.eq(deployment.as_str()),
+                ds::shard.eq(shard.as_str()),
+                ds::version.eq(schema_version as i32),
+                ds::network.eq(network.as_str()),
+                ds::active.eq(active),
+            ))
+            .returning((ds::id, ds::name))
+            .get_results(conn)?;
+        let (id, namespace) = schemas
+            .first()
+            .cloned()
+            .ok_or_else(|| anyhow!("failed to read schema name for {} back", deployment))?;
+        let namespace = Namespace::new(namespace).map_err(|name| {
+            constraint_violation!("Generated database schema name {} is invalid", name)
+        })?;
+
+        Ok(Site {
+            id,
+            deployment,
+            shard,
+            namespace,
+            network,
+            active: true,
+            schema_version,
+            _creation_disallowed: (),
+        })
+    }
+
+    /// Create a site for a brand new deployment.
+    pub fn allocate_site(
+        &self,
+        shard: Shard,
+        subgraph: &DeploymentHash,
+        network: String,
+        schema_version: DeploymentSchemaVersion,
+    ) -> Result<Site, StoreError> {
+        if let Some(site) = queries::find_active_site(self.conn.as_ref(), subgraph)? {
+            return Ok(site);
+        }
+
+        self.create_site(shard, subgraph.clone(), network, schema_version, true)
+    }
+
+    pub fn assigned_node(&self, site: &Site) -> Result<Option<NodeId>, StoreError> {
+        queries::assigned_node(self.conn.as_ref(), site)
+    }
+
+    /// Create a copy of the site `src` in the shard `shard`, but mark it as
+    /// not active. If there already is a site in `shard`, return that
+    /// instead.
+    pub fn copy_site(&self, src: &Site, shard: Shard) -> Result<Site, StoreError> {
+        if let Some(site) =
+            queries::find_site_in_shard(self.conn.as_ref(), &src.deployment, &shard)?
+        {
+            return Ok(site);
+        }
+
+        self.create_site(
+            shard,
+            src.deployment.clone(),
+            src.network.clone(),
+            src.schema_version,
+            false,
+        )
+    }
+
+    pub(crate) fn activate(&self, deployment: &DeploymentLocator) -> Result<(), StoreError> {
+        use deployment_schemas as ds;
+
+        // We need to tread lightly so we do not violate the unique constraint on
+        // `subgraph where active`
+        update(ds::table.filter(ds::subgraph.eq(deployment.hash.as_str())))
+            .set(ds::active.eq(false))
+            .execute(self.conn.as_ref())?;
+
+        update(ds::table.filter(ds::id.eq(DeploymentId::from(deployment.id))))
+            .set(ds::active.eq(true))
+            .execute(self.conn.as_ref())
+            .map_err(|e| e.into())
+            .map(|_| ())
+    }
+
+    /// Remove all subgraph versions and the entry in `deployment_schemas` for
+    /// subgraph `id` in a transaction
+    pub fn drop_site(&self, site: &Site) -> Result<(), StoreError> {
+        use deployment_schemas as ds;
+        use subgraph_version as v;
+        use unused_deployments as u;
+
+        self.transaction(|| {
+            let conn = self.conn.as_ref();
+
+            delete(ds::table.filter(ds::id.eq(site.id))).execute(conn)?;
+
+            // If there is no site for this deployment any more, we can get
+            // rid of versions pointing to it
+            let exists = select(exists(
+                ds::table.filter(ds::subgraph.eq(site.deployment.as_str())),
+            ))
+            .get_result::<bool>(conn)?;
+            if !exists {
+                delete(v::table.filter(v::deployment.eq(site.deployment.as_str())))
+                    .execute(conn)?;
+            }
+
+            update(u::table.filter(u::id.eq(site.id)))
+                .set(u::removed_at.eq(sql("now()")))
+                .execute(self.conn.as_ref())?;
+            Ok(())
+        })
+    }
+
+    pub fn locate_site(&self, locator: DeploymentLocator) -> Result<Option<Site>, StoreError> {
+        let schema = deployment_schemas::table
+            .filter(deployment_schemas::id.eq::<DeploymentId>(locator.into()))
+            .first::<Schema>(self.conn.as_ref())
+            .optional()?;
+        schema.map(|schema| schema.try_into()).transpose()
+    }
+
+    pub fn find_sites_for_network(&self, network: &str) -> Result<Vec<Site>, StoreError> {
+        use deployment_schemas as ds;
+
+        ds::table
+            .filter(ds::network.eq(network))
+            .load::<Schema>(self.conn.as_ref())?
+            .into_iter()
+            .map(|schema| schema.try_into())
+            .collect()
+    }
+
+    pub fn sites(&self) -> Result<Vec<Site>, StoreError> {
+        use deployment_schemas as ds;
+
+        ds::table
+            .filter(ds::name.ne("subgraphs"))
+            .load::<Schema>(self.conn.as_ref())?
+            .into_iter()
+            .map(|schema| schema.try_into())
+            .collect()
+    }
+
+    pub fn send_store_event(
+        &self,
+        sender: &NotificationSender,
+        event: &StoreEvent,
+    ) -> Result<(), StoreError> {
+        // Performance: Don't bog down the db with many empty changelists.
+        if event.changes.is_empty() {
+            return Ok(());
+        }
+        let v = serde_json::to_value(event)?;
+        #[cfg(debug_assertions)]
+        {
+            if *EVENT_TAP_ENABLED.lock().unwrap() {
+                EVENT_TAP.lock().unwrap().push(event.clone());
+            }
+        }
+        sender.notify(&self.conn, "store_events", None, &v)
+    }
+
+    /// Return the name of the node that has the fewest assignments out of the
+    /// given `nodes`. If `nodes` is empty, return `None`
+    pub fn least_assigned_node(&self, nodes: &[NodeId]) -> Result<Option<NodeId>, StoreError> {
+        use subgraph_deployment_assignment as a;
+
+        let nodes: Vec<_> = nodes.iter().map(|n| n.as_str()).collect();
+
+        let assigned = a::table
+            .filter(a::node_id.eq(any(&nodes)))
+            .select((a::node_id, sql("count(*)")))
+            .group_by(a::node_id)
+            .order_by(sql::<i64>("count(*)"))
+            .load::<(String, i64)>(self.conn.as_ref())?;
+
+        // Any nodes without assignments will be missing from `assigned`
+        let missing = nodes
+            .into_iter()
+            .filter(|node| !assigned.iter().any(|(a, _)| a == node))
+            .map(|node| (node, 0));
+
+        assigned
+            .iter()
+            .map(|(node, count)| (node.as_str(), *count))
+            .chain(missing)
+            .min_by_key(|(_, count)| *count)
+            .map(|(node, _)| NodeId::new(node).map_err(|()| node))
+            .transpose()
+            // This can't really happen since we filtered by valid NodeId's
+            .map_err(|node| {
+                constraint_violation!("database has assignment for illegal node name {:?}", node)
+            })
+    }
+
+    /// Return the shard that has the fewest deployments out of the given
+    /// `shards`. If `shards` is empty, return `None`
+    ///
+    /// Usage of a shard is taken to be the number of assigned deployments
+    /// that are stored in it. Unassigned deployments are ignored; in
+    /// particular, that ignores deployments that are going to be removed
+    /// soon.
+    pub fn least_used_shard(&self, shards: &[Shard]) -> Result<Option<Shard>, StoreError> {
+        use deployment_schemas as ds;
+        use subgraph_deployment_assignment as a;
+
+        let used = ds::table
+            .inner_join(a::table.on(a::id.eq(ds::id)))
+            .filter(ds::shard.eq(any(shards)))
+            .select((ds::shard, sql("count(*)")))
+            .group_by(ds::shard)
+            .order_by(sql::<i64>("count(*)"))
+            .load::<(String, i64)>(self.conn.as_ref())?;
+
+        // Any shards that have no deployments in them will not be in
+        // 'used'; add them in with a count of 0
+        let missing = shards
+            .into_iter()
+            .filter(|shard| !used.iter().any(|(s, _)| s == shard.as_str()))
+            .map(|shard| (shard.as_str(), 0));
+
+        used.iter()
+            .map(|(shard, count)| (shard.as_str(), *count))
+            .chain(missing)
+            .min_by_key(|(_, count)| *count)
+            .map(|(shard, _)| Shard::new(shard.to_string()))
+            .transpose()
+            // This can't really happen since we filtered by valid shards
+            .map_err(|e| constraint_violation!("database has illegal shard name: {}", e))
+    }
+
+    #[cfg(debug_assertions)]
+    pub fn versions_for_subgraph(
+        &self,
+        name: &str,
+    ) -> Result<(Option<String>, Option<String>), StoreError> {
+        use subgraph as s;
+
+        Ok(s::table
+            .select((s::current_version.nullable(), s::pending_version.nullable()))
+            .filter(s::name.eq(&name))
+            .first::<(Option<String>, Option<String>)>(self.conn.as_ref())
+            .optional()?
+            .unwrap_or((None, None)))
+    }
+
+    #[cfg(debug_assertions)]
+    pub fn deployment_for_version(&self, name: &str) -> Result<Option<String>, StoreError> {
+        use subgraph_version as v;
+
+        Ok(v::table
+            .select(v::deployment)
+            .filter(v::id.eq(name))
+            .first::<String>(self.conn.as_ref())
+            .optional()?)
+    }
+
+    /// Find all deployments that are not in use and add them to the
+    /// `unused_deployments` table. Only values that are available in the
+    /// primary will be filled in `unused_deployments`
+    pub fn detect_unused_deployments(&self) -> Result<Vec<Site>, StoreError> {
+        use active_copies as cp;
+        use deployment_schemas as ds;
+        use subgraph as s;
+        use subgraph_deployment_assignment as a;
+        use subgraph_version as v;
+        use unused_deployments as u;
+
+        // Deployment is assigned
+        let assigned = a::table.filter(a::id.eq(ds::id));
+        // Deployment is current or pending version
+        let current_or_pending = v::table
+            .inner_join(
+                s::table.on(v::id
+                    .nullable()
+                    .eq(s::current_version)
+                    .or(v::id.nullable().eq(s::pending_version))),
+            )
+            .filter(v::deployment.eq(ds::subgraph));
+        // Deployment is the source of an in-progress copy
+        let copy_src = cp::table.filter(cp::src.eq(ds::id));
+
+        // Subgraphs that used a deployment
+        let used_by = s::table
+            .inner_join(v::table.on(s::id.eq(v::subgraph)))
+            .filter(v::deployment.eq(ds::subgraph))
+            .select(sql::<Array<Text>>("array_agg(distinct name)"))
+            .single_value();
+
+        // A deployment is unused if it fulfills all of these criteria:
+        // 1. It is not assigned to a node
+        // 2. It is either not marked as active or is neither the current or
+        //    pending version of a subgraph. The rest of the system makes
+        //    sure that there is always one active copy of a deployment
+        // 3. It is not the source of a currently running copy operation
+        let unused = ds::table
+            .filter(not(exists(assigned)))
+            .filter(not(ds::active).or(not(exists(current_or_pending))))
+            .filter(not(exists(copy_src)))
+            .select((
+                ds::id,
+                ds::created_at,
+                ds::subgraph,
+                ds::name,
+                ds::shard,
+                used_by,
+            ));
+
+        let ids = insert_into(u::table)
+            .values(unused)
+            .into_columns((
+                u::id,
+                u::created_at,
+                u::deployment,
+                u::namespace,
+                u::shard,
+                u::subgraphs,
+            ))
+            .on_conflict(u::id)
+            .do_nothing()
+            .returning(u::id)
+            .get_results::<DeploymentId>(self.conn.as_ref())?;
+
+        // We need to load again since we do not record the network in
+        // unused_deployments
+        ds::table
+            .filter(ds::id.eq_any(ids))
+            .select(ds::all_columns)
+            .load::<Schema>(self.conn.as_ref())?
+            .into_iter()
+            .map(Site::try_from)
+            .collect()
+    }
+
+    /// Add details from the deployment shard to unused deployments
+    pub fn update_unused_deployments(
+        &self,
+        details: &[DeploymentDetail],
+    ) -> Result<(), StoreError> {
+        use crate::detail::block;
+        use unused_deployments as u;
+
+        for detail in details {
+            let (latest_hash, latest_number) = block(
+                &detail.deployment,
+                "latest_ethereum_block",
+                detail.latest_ethereum_block_hash.clone(),
+                detail.latest_ethereum_block_number.clone(),
+            )?
+            .map(|b| b.to_ptr())
+            .map(|ptr| (Some(Vec::from(ptr.hash_slice())), Some(ptr.number as i32)))
+            .unwrap_or((None, None));
+            let entity_count = detail.entity_count.to_u64().unwrap_or(0) as i32;
+
+            update(u::table.filter(u::id.eq(&detail.id)))
+                .set((
+                    u::entity_count.eq(entity_count),
+                    u::latest_ethereum_block_hash.eq(latest_hash),
+                    u::latest_ethereum_block_number.eq(latest_number),
+                    u::failed.eq(detail.failed),
+                    u::synced.eq(detail.synced),
+                ))
+                .execute(self.conn.as_ref())?;
+        }
+        Ok(())
+    }
+
+    /// The deployment `site` that we marked as unused previously is in fact
+    /// now used again, e.g., because it was redeployed in between recording
+    /// it as unused and now. Remove it from the `unused_deployments` table
+    pub fn unused_deployment_is_used(&self, site: &Site) -> Result<(), StoreError> {
+        use unused_deployments as u;
+        delete(u::table.filter(u::id.eq(site.id)))
+            .execute(self.conn.as_ref())
+            .map(|_| ())
+            .map_err(StoreError::from)
+    }
+
+    pub fn list_unused_deployments(
+        &self,
+        filter: unused::Filter,
+    ) -> Result<Vec<UnusedDeployment>, StoreError> {
+        use unused::Filter::*;
+        use unused_deployments as u;
+
+        match filter {
+            All => Ok(u::table
+                .order_by(u::unused_at.desc())
+                .load(self.conn.as_ref())?),
+            New => Ok(u::table
+                .filter(u::removed_at.is_null())
+                .order_by(u::entity_count)
+                .load(self.conn.as_ref())?),
+            UnusedLongerThan(duration) => {
+                let ts = chrono::offset::Local::now()
+                    .checked_sub_signed(duration)
+                    .ok_or_else(|| {
+                        StoreError::ConstraintViolation(format!(
+                            "duration {} is too large",
+                            duration
+                        ))
+                    })?;
+                Ok(u::table
+                    .filter(u::removed_at.is_null())
+                    .filter(u::unused_at.lt(ts))
+                    .order_by(u::entity_count)
+                    .load(self.conn.as_ref())?)
+            }
+        }
+    }
+
+    pub fn subgraphs_using_deployment(&self, site: &Site) -> Result<Vec<String>, StoreError> {
+        use subgraph as s;
+        use subgraph_version as v;
+
+        Ok(s::table
+            .inner_join(
+                v::table.on(v::subgraph
+                    .nullable()
+                    .eq(s::current_version)
+                    .or(v::subgraph.nullable().eq(s::pending_version))),
+            )
+            .filter(v::deployment.eq(site.deployment.as_str()))
+            .select(s::name)
+            .distinct()
+            .load(self.conn.as_ref())?)
+    }
+
+    pub fn find_ens_name(&self, hash: &str) -> Result<Option<String>, StoreError> {
+        use ens_names as dsl;
+
+        dsl::table
+            .select(dsl::name)
+            .find(hash)
+            .get_result::<String>(self.conn.as_ref())
+            .optional()
+            .map_err(|e| anyhow!("error looking up ens_name for hash {}: {}", hash, e).into())
+    }
+
+    pub fn record_active_copy(&self, src: &Site, dst: &Site) -> Result<(), StoreError> {
+        use active_copies as cp;
+
+        insert_into(cp::table)
+            .values((
+                cp::src.eq(src.id),
+                cp::dst.eq(dst.id),
+                cp::queued_at.eq(sql("now()")),
+            ))
+            .on_conflict_do_nothing()
+            .execute(self.conn.as_ref())?;
+
+        Ok(())
+    }
+
+    pub fn copy_finished(&self, dst: &Site) -> Result<(), StoreError> {
+        use active_copies as cp;
+
+        delete(cp::table.filter(cp::dst.eq(dst.id))).execute(self.conn.as_ref())?;
+
+        Ok(())
+    }
+}
+
+/// A struct that reads from pools in order, trying each pool in turn until
+/// a query returns either success or anything but a
+/// `Err(StoreError::DatabaseUnavailable)`. This only works for tables that
+/// are mirrored through `refresh_tables`
+pub struct Mirror {
+    pools: Vec<ConnectionPool>,
+}
+
+impl Mirror {
+    pub fn new(pools: &HashMap<Shard, ConnectionPool>) -> Mirror {
+        let primary = pools
+            .get(&PRIMARY_SHARD)
+            .expect("we always have a primary pool")
+            .clone();
+        let pools = pools
+            .into_iter()
+            .filter(|(shard, _)| *shard != &*PRIMARY_SHARD)
+            .fold(vec![primary], |mut pools, (_, pool)| {
+                pools.push(pool.clone());
+                pools
+            });
+        Mirror { pools }
+    }
+
+    /// Execute the function `f` with connections from each of our pools in
+    /// order until for one of them we get any result other than
+    /// `Err(StoreError::DatabaseUnavailable)`. In other words, we try to
+    /// execute `f` against our pools in order until we can be sure that we
+    /// talked to a database that is up. The function `f` must only access
+    /// tables that are mirrored through `refresh_tables`
+    pub(crate) fn read<'a, T>(
+        &self,
+        mut f: impl 'a
+            + FnMut(&PooledConnection<ConnectionManager<PgConnection>>) -> Result<T, StoreError>,
+    ) -> Result<T, StoreError> {
+        for pool in &self.pools {
+            let conn = match pool.get() {
+                Ok(conn) => conn,
+                Err(StoreError::DatabaseUnavailable) => continue,
+                Err(e) => return Err(e),
+            };
+            match f(&conn) {
+                Ok(v) => return Ok(v),
+                Err(StoreError::DatabaseUnavailable) => continue,
+                Err(e) => return Err(e),
+            }
+        }
+        Err(StoreError::DatabaseUnavailable)
+    }
+
+    /// Refresh the contents of mirrored tables from the primary (through
+    /// the fdw mapping that `ForeignServer` establishes)
+    pub(crate) fn refresh_tables(
+        conn: &PgConnection,
+        handle: &CancelHandle,
+    ) -> Result<(), StoreError> {
+        // `chains` needs to be mirrored before `deployment_schemas` because
+        // of the fk constraint on `deployment_schemas.network`. We don't
+        // care much about mirroring `active_copies` but it has a fk
+        // constraint on `deployment_schemas` and is tiny, therefore it's
+        // easiest to just mirror it
+        const PUBLIC_TABLES: [&str; 3] = ["chains", "deployment_schemas", "active_copies"];
+        const SUBGRAPHS_TABLES: [&str; 3] = [
+            "subgraph_deployment_assignment",
+            "subgraph",
+            "subgraph_version",
+        ];
+
+        fn copy_table(
+            conn: &PgConnection,
+            src_nsp: &str,
+            dst_nsp: &str,
+            table_name: &str,
+        ) -> Result<(), StoreError> {
+            let query = format!(
+                "insert into {dst_nsp}.{table_name} select * from {src_nsp}.{table_name};",
+                src_nsp = src_nsp,
+                dst_nsp = dst_nsp,
+                table_name = table_name
+            );
+            conn.batch_execute(&query).map_err(StoreError::from)
+        }
+
+        let check_cancel = || {
+            if handle.is_canceled() {
+                Err(StoreError::Canceled)
+            } else {
+                Ok(())
+            }
+        };
+
+        // Truncate all tables at once, otherwise truncation can fail
+        // because of foreign key constraints
+        let tables = PUBLIC_TABLES
+            .iter()
+            .map(|name| (NAMESPACE_PUBLIC, name))
+            .chain(
+                SUBGRAPHS_TABLES
+                    .iter()
+                    .map(|name| (NAMESPACE_SUBGRAPHS, name)),
+            )
+            .map(|(nsp, name)| format!("{}.{}", nsp, name))
+            .join(", ");
+        let query = format!("truncate table {};", tables);
+        conn.batch_execute(&query)?;
+        check_cancel()?;
+
+        for table_name in PUBLIC_TABLES {
+            copy_table(
+                conn,
+                &*ForeignServer::PRIMARY_PUBLIC,
+                NAMESPACE_PUBLIC,
+                table_name,
+            )?;
+            check_cancel()?;
+        }
+        for table_name in SUBGRAPHS_TABLES {
+            copy_table(
+                conn,
+                &ForeignServer::metadata_schema(&*PRIMARY_SHARD),
+                NAMESPACE_SUBGRAPHS,
+                table_name,
+            )?;
+            check_cancel()?;
+        }
+        Ok(())
+    }
+
+    /// Return the actual primary connection pool; all write access to the
+    /// primary should go through this pool
+    pub(crate) fn primary(&self) -> &ConnectionPool {
+        // Will not panic since the constructor ensures we always have a
+        // primary
+        &self.pools[0]
+    }
+
+    pub fn assignments(&self, node: &NodeId) -> Result<Vec<Site>, StoreError> {
+        self.read(|conn| queries::assignments(conn, node))
+    }
+
+    pub fn assigned_node(&self, site: &Site) -> Result<Option<NodeId>, StoreError> {
+        self.read(|conn| queries::assigned_node(conn, site))
+    }
+
+    pub fn find_active_site(&self, subgraph: &DeploymentHash) -> Result<Option<Site>, StoreError> {
+        self.read(|conn| queries::find_active_site(conn, subgraph))
+    }
+
+    pub fn find_site_by_ref(&self, id: DeploymentId) -> Result<Option<Site>, StoreError> {
+        self.read(|conn| queries::find_site_by_ref(conn, id))
+    }
+
+    pub fn current_deployment_for_subgraph(
+        &self,
+        name: &SubgraphName,
+    ) -> Result<DeploymentHash, StoreError> {
+        self.read(|conn| queries::current_deployment_for_subgraph(conn, name))
+    }
+
+    pub fn deployments_for_subgraph(&self, name: &str) -> Result<Vec<Site>, StoreError> {
+        self.read(|conn| queries::deployments_for_subgraph(conn, name))
+    }
+
+    pub fn subgraph_exists(&self, name: &SubgraphName) -> Result<bool, StoreError> {
+        self.read(|conn| queries::subgraph_exists(conn, name))
+    }
+
+    pub fn subgraph_version(
+        &self,
+        name: &str,
+        use_current: bool,
+    ) -> Result<Option<Site>, StoreError> {
+        self.read(|conn| queries::subgraph_version(conn, name, use_current))
+    }
+
+    /// Find sites by their subgraph deployment hashes. If `ids` is empty,
+    /// return all sites
+    pub fn find_sites(&self, ids: &[String], only_active: bool) -> Result<Vec<Site>, StoreError> {
+        self.read(|conn| queries::find_sites(conn, ids, only_active))
+    }
+
+    /// Find sites by their subgraph deployment ids. If `ids` is empty,
+    /// return no sites
+    pub fn find_sites_by_id(&self, ids: &[DeploymentId]) -> Result<Vec<Site>, StoreError> {
+        self.read(|conn| queries::find_sites_by_id(conn, ids))
+    }
+
+    pub fn fill_assignments(&self, infos: &mut [status::Info]) -> Result<(), StoreError> {
+        self.read(|conn| queries::fill_assignments(conn, infos))
+    }
+
+    pub fn version_info(&self, version: &str) -> Result<Option<(String, String)>, StoreError> {
+        self.read(|conn| queries::version_info(conn, version))
+    }
+
+    pub fn versions_for_subgraph_id(
+        &self,
+        subgraph_id: &str,
+    ) -> Result<(Option<String>, Option<String>), StoreError> {
+        self.read(|conn| queries::versions_for_subgraph_id(conn, subgraph_id))
+    }
+
+    /// Returns all (subgraph_name, version) pairs for a given deployment hash.
+    pub fn subgraphs_by_deployment_hash(
+        &self,
+        deployment_hash: &str,
+    ) -> Result<Vec<(String, String)>, StoreError> {
+        self.read(|conn| queries::subgraphs_by_deployment_hash(conn, deployment_hash))
+    }
+
+    pub fn find_site_in_shard(
+        &self,
+        subgraph: &DeploymentHash,
+        shard: &Shard,
+    ) -> Result<Option<Site>, StoreError> {
+        self.read(|conn| queries::find_site_in_shard(conn, subgraph, shard))
+    }
+}
diff --git a/store/postgres/src/query_store.rs b/store/postgres/src/query_store.rs
new file mode 100644
index 0000000..ccc5142
--- /dev/null
+++ b/store/postgres/src/query_store.rs
@@ -0,0 +1,131 @@
+use std::collections::BTreeMap;
+
+use crate::deployment_store::{DeploymentStore, ReplicaId};
+use graph::components::store::QueryStore as QueryStoreTrait;
+use graph::data::query::Trace;
+use graph::data::value::Word;
+use graph::prelude::*;
+
+use crate::primary::Site;
+
+pub(crate) struct QueryStore {
+    site: Arc<Site>,
+    replica_id: ReplicaId,
+    store: Arc<DeploymentStore>,
+    chain_store: Arc<crate::ChainStore>,
+    api_version: Arc<ApiVersion>,
+}
+
+impl QueryStore {
+    pub(crate) fn new(
+        store: Arc<DeploymentStore>,
+        chain_store: Arc<crate::ChainStore>,
+        site: Arc<Site>,
+        replica_id: ReplicaId,
+        api_version: Arc<ApiVersion>,
+    ) -> Self {
+        QueryStore {
+            site,
+            replica_id,
+            store,
+            chain_store,
+            api_version,
+        }
+    }
+}
+
+#[async_trait]
+impl QueryStoreTrait for QueryStore {
+    fn find_query_values(
+        &self,
+        query: EntityQuery,
+    ) -> Result<(Vec<BTreeMap<Word, r::Value>>, Trace), graph::prelude::QueryExecutionError> {
+        assert_eq!(&self.site.deployment, &query.subgraph_id);
+        let conn = self
+            .store
+            .get_replica_conn(self.replica_id)
+            .map_err(|e| QueryExecutionError::StoreError(e.into()))?;
+        self.store.execute_query(&conn, self.site.clone(), query)
+    }
+
+    /// Return true if the deployment with the given id is fully synced,
+    /// and return false otherwise. Errors from the store are passed back up
+    async fn is_deployment_synced(&self) -> Result<bool, Error> {
+        Ok(self
+            .store
+            .exists_and_synced(self.site.deployment.cheap_clone())
+            .await?)
+    }
+
+    async fn block_ptr(&self) -> Result<Option<BlockPtr>, StoreError> {
+        self.store.block_ptr(self.site.cheap_clone()).await
+    }
+    async fn block_number_with_timestamp(
+        &self,
+        block_hash: &BlockHash,
+    ) -> Result<Option<(BlockNumber, Option<u64>)>, StoreError> {
+        // We should also really check that the block with the given hash is
+        // on the chain starting at the subgraph's current head. That check is
+        // very expensive though with the data structures we have currently
+        // available. Ideally, we'd have the last REORG_THRESHOLD blocks in
+        // memory so that we can check against them, and then mark in the
+        // database the blocks on the main chain that we consider final
+        let subgraph_network = self.network_name();
+        self.chain_store
+            .block_number(block_hash)
+            .await?
+            .map(|(network_name, number, timestamp)| {
+                if network_name == subgraph_network {
+                    Ok((number, timestamp))
+                } else {
+                    Err(StoreError::QueryExecutionError(format!(
+                        "subgraph {} belongs to network {} but block {:x} belongs to network {}",
+                        &self.site.deployment, subgraph_network, block_hash, network_name
+                    )))
+                }
+            })
+            .transpose()
+    }
+
+    async fn block_number(
+        &self,
+        block_hash: &BlockHash,
+    ) -> Result<Option<BlockNumber>, StoreError> {
+        self.block_number_with_timestamp(block_hash)
+            .await
+            .map(|opt| opt.map(|(number, _)| number))
+    }
+
+    fn wait_stats(&self) -> Result<PoolWaitStats, StoreError> {
+        self.store.wait_stats(self.replica_id)
+    }
+
+    async fn has_deterministic_errors(&self, block: BlockNumber) -> Result<bool, StoreError> {
+        let id = self.site.deployment.clone();
+        self.store
+            .with_conn(move |conn, _| {
+                crate::deployment::has_deterministic_errors(conn, &id, block).map_err(|e| e.into())
+            })
+            .await
+    }
+
+    async fn deployment_state(&self) -> Result<DeploymentState, QueryExecutionError> {
+        Ok(self
+            .store
+            .deployment_state_from_id(self.site.deployment.clone())
+            .await?)
+    }
+
+    fn api_schema(&self) -> Result<Arc<ApiSchema>, QueryExecutionError> {
+        let info = self.store.subgraph_info(&self.site)?;
+        Ok(info.api.get(&self.api_version).unwrap().clone())
+    }
+
+    fn network_name(&self) -> &str {
+        &self.site.network
+    }
+
+    async fn query_permit(&self) -> Result<tokio::sync::OwnedSemaphorePermit, StoreError> {
+        self.store.query_permit(self.replica_id).await
+    }
+}
diff --git a/store/postgres/src/relational.rs b/store/postgres/src/relational.rs
new file mode 100644
index 0000000..95383d4
--- /dev/null
+++ b/store/postgres/src/relational.rs
@@ -0,0 +1,1452 @@
+//! Support for storing the entities of a subgraph in a relational schema,
+//! i.e., one where each entity type gets its own table, and the table
+//! structure follows the structure of the GraphQL type, using the
+//! native SQL types that most appropriately map to the corresponding
+//! GraphQL types
+//!
+//! The pivotal struct in this module is the `Layout` which handles all the
+//! information about mapping a GraphQL schema to database tables
+
+mod ddl;
+
+#[cfg(test)]
+mod ddl_tests;
+#[cfg(test)]
+mod query_tests;
+
+mod prune;
+
+use diesel::{connection::SimpleConnection, Connection};
+use diesel::{debug_query, OptionalExtension, PgConnection, RunQueryDsl};
+use graph::cheap_clone::CheapClone;
+use graph::constraint_violation;
+use graph::data::graphql::TypeExt as _;
+use graph::data::query::Trace;
+use graph::data::value::Word;
+use graph::prelude::{q, s, StopwatchMetrics, ENV_VARS};
+use graph::slog::warn;
+use inflector::Inflector;
+use lazy_static::lazy_static;
+use std::borrow::Cow;
+use std::collections::{BTreeMap, BTreeSet, HashMap, HashSet};
+use std::convert::{From, TryFrom};
+use std::fmt::{self, Write};
+use std::str::FromStr;
+use std::sync::{Arc, Mutex};
+use std::time::{Duration, Instant};
+
+use crate::relational_queries::{FindChangesQuery, FindPossibleDeletionsQuery};
+use crate::{
+    primary::{Namespace, Site},
+    relational_queries::{
+        ClampRangeQuery, ConflictingEntityQuery, EntityData, EntityDeletion, FilterCollection,
+        FilterQuery, FindManyQuery, FindQuery, InsertQuery, RevertClampQuery, RevertRemoveQuery,
+    },
+};
+use graph::components::store::{EntityKey, EntityType};
+use graph::data::graphql::ext::{DirectiveFinder, DocumentExt, ObjectTypeExt};
+use graph::data::schema::{FulltextConfig, FulltextDefinition, Schema, SCHEMA_TYPE_NAME};
+use graph::data::store::BYTES_SCALAR;
+use graph::data::subgraph::schema::{POI_OBJECT, POI_TABLE};
+use graph::prelude::{
+    anyhow, info, BlockNumber, DeploymentHash, Entity, EntityChange, EntityCollection,
+    EntityFilter, EntityOperation, EntityOrder, EntityRange, Logger, QueryExecutionError,
+    StoreError, StoreEvent, ValueType, BLOCK_NUMBER_MAX,
+};
+
+use crate::block_range::{BLOCK_COLUMN, BLOCK_RANGE_COLUMN};
+pub use crate::catalog::Catalog;
+use crate::connection_pool::ForeignServer;
+use crate::{catalog, deployment};
+
+const POSTGRES_MAX_PARAMETERS: usize = u16::MAX as usize; // 65535
+const DELETE_OPERATION_CHUNK_SIZE: usize = 1_000;
+
+/// The size of string prefixes that we index. This is chosen so that we
+/// will index strings that people will do string comparisons like
+/// `=` or `!=` on; if text longer than this is stored in a String attribute
+/// it is highly unlikely that they will be used for exact string operations.
+/// This also makes sure that we do not put strings into a BTree index that's
+/// bigger than Postgres' limit on such strings which is about 2k
+pub const STRING_PREFIX_SIZE: usize = 256;
+pub const BYTE_ARRAY_PREFIX_SIZE: usize = 64;
+
+lazy_static! {
+    static ref STATEMENT_TIMEOUT: Option<String> = ENV_VARS
+        .graphql
+        .sql_statement_timeout
+        .map(|duration| format!("set local statement_timeout={}", duration.as_millis()));
+}
+
+/// A string we use as a SQL name for a table or column. The important thing
+/// is that SQL names are snake cased. Using this type makes it easier to
+/// spot cases where we use a GraphQL name like 'bigThing' when we should
+/// really use the SQL version 'big_thing'
+///
+/// We use `SqlName` for example for table and column names, and feed these
+/// directly to Postgres. Postgres truncates names to 63 characters; if
+/// users have GraphQL type names that do not differ in the first
+/// 63 characters after snakecasing, schema creation will fail because, to
+/// Postgres, we would create the same table twice. We consider this case
+/// to be pathological and so unlikely in practice that we do not try to work
+/// around it in the application.
+#[derive(Clone, Debug, PartialEq, Eq, PartialOrd, Hash)]
+pub struct SqlName(String);
+
+impl SqlName {
+    pub fn as_str(&self) -> &str {
+        &self.0
+    }
+
+    pub fn quoted(&self) -> String {
+        format!("\"{}\"", self.0)
+    }
+
+    // Check that `name` matches the regular expression `/[A-Za-z][A-Za-z0-9_]*/`
+    // without pulling in a regex matcher
+    pub fn check_valid_identifier(name: &str, kind: &str) -> Result<(), StoreError> {
+        let mut chars = name.chars();
+        match chars.next() {
+            Some(c) => {
+                if !c.is_ascii_alphabetic() && c != '_' {
+                    let msg = format!(
+                        "the name `{}` can not be used for a {}; \
+                         it must start with an ASCII alphabetic character or `_`",
+                        name, kind
+                    );
+                    return Err(StoreError::InvalidIdentifier(msg));
+                }
+            }
+            None => {
+                let msg = format!("can not use an empty name for a {}", kind);
+                return Err(StoreError::InvalidIdentifier(msg));
+            }
+        }
+        for c in chars {
+            if !c.is_ascii_alphanumeric() && c != '_' {
+                let msg = format!(
+                    "the name `{}` can not be used for a {}; \
+                     it can only contain alphanumeric characters and `_`",
+                    name, kind
+                );
+                return Err(StoreError::InvalidIdentifier(msg));
+            }
+        }
+        Ok(())
+    }
+
+    pub fn verbatim(s: String) -> Self {
+        SqlName(s)
+    }
+
+    pub fn qualified_name(namespace: &Namespace, name: &SqlName) -> Self {
+        SqlName(format!("\"{}\".\"{}\"", namespace, name.as_str()))
+    }
+}
+
+impl From<&str> for SqlName {
+    fn from(name: &str) -> Self {
+        SqlName(name.to_snake_case())
+    }
+}
+
+impl From<String> for SqlName {
+    fn from(name: String) -> Self {
+        SqlName(name.to_snake_case())
+    }
+}
+
+impl fmt::Display for SqlName {
+    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
+        self.0.fmt(f)
+    }
+}
+
+/// The SQL type to use for GraphQL ID properties. We support
+/// strings and byte arrays
+#[derive(Copy, Clone, Debug, Eq, PartialEq, Hash)]
+pub(crate) enum IdType {
+    String,
+    Bytes,
+}
+
+impl IdType {
+    pub fn sql_type(&self) -> &str {
+        match self {
+            IdType::String => "text",
+            IdType::Bytes => "bytea",
+        }
+    }
+}
+
+impl TryFrom<&s::ObjectType> for IdType {
+    type Error = StoreError;
+
+    fn try_from(obj_type: &s::ObjectType) -> Result<Self, Self::Error> {
+        let pk = obj_type
+            .field(&PRIMARY_KEY_COLUMN.to_owned())
+            .expect("Each ObjectType has an `id` field");
+        Self::try_from(&pk.field_type)
+    }
+}
+
+impl TryFrom<&s::Type> for IdType {
+    type Error = StoreError;
+
+    fn try_from(field_type: &s::Type) -> Result<Self, Self::Error> {
+        let name = named_type(field_type);
+
+        match ValueType::from_str(name)? {
+            ValueType::String => Ok(IdType::String),
+            ValueType::Bytes => Ok(IdType::Bytes),
+            _ => Err(anyhow!(
+                "The `id` field has type `{}` but only `String`, `Bytes`, and `ID` are allowed",
+                &name
+            )
+            .into()),
+        }
+    }
+}
+
+type IdTypeMap = HashMap<EntityType, IdType>;
+
+type EnumMap = BTreeMap<String, Arc<BTreeSet<String>>>;
+
+#[derive(Debug, Clone)]
+pub struct Layout {
+    /// Details of where the subgraph is stored
+    pub site: Arc<Site>,
+    /// Maps the GraphQL name of a type to the relational table
+    pub tables: HashMap<EntityType, Arc<Table>>,
+    /// The database schema for this subgraph
+    pub catalog: Catalog,
+    /// Enums defined in the schema and their possible values. The names
+    /// are the original GraphQL names
+    pub enums: EnumMap,
+    /// The query to count all entities
+    pub count_query: String,
+}
+
+impl Layout {
+    /// Generate a layout for a relational schema for entities in the
+    /// GraphQL schema `schema`. The name of the database schema in which
+    /// the subgraph's tables live is in `site`.
+    pub fn new(site: Arc<Site>, schema: &Schema, catalog: Catalog) -> Result<Self, StoreError> {
+        // Extract enum types
+        let enums: EnumMap = schema
+            .document
+            .get_enum_definitions()
+            .iter()
+            .map(
+                |enum_type| -> Result<(String, Arc<BTreeSet<String>>), StoreError> {
+                    SqlName::check_valid_identifier(&enum_type.name, "enum")?;
+                    Ok((
+                        enum_type.name.clone(),
+                        Arc::new(
+                            enum_type
+                                .values
+                                .iter()
+                                .map(|value| value.name.to_owned())
+                                .collect::<BTreeSet<_>>(),
+                        ),
+                    ))
+                },
+            )
+            .collect::<Result<_, _>>()?;
+
+        // List of all object types that are not __SCHEMA__
+        let object_types = schema
+            .document
+            .get_object_type_definitions()
+            .into_iter()
+            .filter(|obj_type| obj_type.name != SCHEMA_TYPE_NAME)
+            .collect::<Vec<_>>();
+
+        // For interfaces, check that all implementors use the same IdType
+        // and build a list of name/IdType pairs
+        let id_types_for_interface = schema.types_for_interface.iter().map(|(interface, types)| {
+            types
+                .iter()
+                .map(IdType::try_from)
+                .collect::<Result<HashSet<_>, _>>()
+                .and_then(move |types| {
+                    if types.len() > 1 {
+                        Err(anyhow!(
+                            "The implementations of interface \
+                            `{}` use different types for the `id` field",
+                            interface
+                        )
+                        .into())
+                    } else {
+                        // For interfaces that are not implemented at all, pretend
+                        // they have a String `id` field
+                        // see also: id-type-for-unimplemented-interfaces
+                        let id_type = types.iter().next().cloned().unwrap_or(IdType::String);
+                        Ok((interface.to_owned(), id_type))
+                    }
+                })
+        });
+
+        // Map of type name to the type of the ID column for the object_types
+        // and interfaces in the schema
+        let id_types = object_types
+            .iter()
+            .map(|obj_type| IdType::try_from(*obj_type).map(|t| (EntityType::from(*obj_type), t)))
+            .chain(id_types_for_interface)
+            .collect::<Result<IdTypeMap, _>>()?;
+
+        // Construct a Table struct for each ObjectType
+        let mut tables = object_types
+            .iter()
+            .enumerate()
+            .map(|(i, obj_type)| {
+                Table::new(
+                    obj_type,
+                    &catalog,
+                    Schema::entity_fulltext_definitions(&obj_type.name, &schema.document)
+                        .map_err(|_| StoreError::FulltextSearchNonDeterministic)?,
+                    &enums,
+                    &id_types,
+                    i as u32,
+                )
+            })
+            .collect::<Result<Vec<_>, _>>()?;
+        if catalog.use_poi {
+            tables.push(Self::make_poi_table(&catalog, tables.len()))
+        }
+
+        let tables: Vec<_> = tables.into_iter().map(Arc::new).collect();
+
+        let count_query = tables
+            .iter()
+            .map(|table| {
+                if table.immutable {
+                    format!(
+                        "select count(*) from \"{}\".\"{}\"",
+                        &catalog.site.namespace, table.name
+                    )
+                } else {
+                    format!(
+                        "select count(*) from \"{}\".\"{}\" where block_range @> {}",
+                        &catalog.site.namespace, table.name, BLOCK_NUMBER_MAX
+                    )
+                }
+            })
+            .collect::<Vec<_>>()
+            .join("\nunion all\n");
+        let count_query = format!("select sum(e.count) from ({}) e", count_query);
+
+        let tables: HashMap<_, _> = tables
+            .into_iter()
+            .fold(HashMap::new(), |mut tables, table| {
+                tables.insert(table.object.clone(), table);
+                tables
+            });
+
+        Ok(Layout {
+            site,
+            catalog,
+            tables,
+            enums,
+            count_query,
+        })
+    }
+
+    fn make_poi_table(catalog: &Catalog, position: usize) -> Table {
+        let table_name = SqlName::verbatim(POI_TABLE.to_owned());
+        Table {
+            object: POI_OBJECT.to_owned(),
+            qualified_name: SqlName::qualified_name(&catalog.site.namespace, &table_name),
+            name: table_name,
+            columns: vec![
+                Column {
+                    name: SqlName::from("digest"),
+                    field: "digest".to_owned(),
+                    field_type: q::Type::NonNullType(Box::new(q::Type::NamedType(
+                        BYTES_SCALAR.to_owned(),
+                    ))),
+                    column_type: ColumnType::Bytes,
+                    fulltext_fields: None,
+                    is_reference: false,
+                    use_prefix_comparison: false,
+                },
+                Column {
+                    name: SqlName::from(PRIMARY_KEY_COLUMN),
+                    field: PRIMARY_KEY_COLUMN.to_owned(),
+                    field_type: q::Type::NonNullType(Box::new(q::Type::NamedType(
+                        "String".to_owned(),
+                    ))),
+                    column_type: ColumnType::String,
+                    fulltext_fields: None,
+                    is_reference: false,
+                    use_prefix_comparison: false,
+                },
+            ],
+            /// The position of this table in all the tables for this layout; this
+            /// is really only needed for the tests to make the names of indexes
+            /// predictable
+            position: position as u32,
+            is_account_like: false,
+            immutable: false,
+        }
+    }
+
+    pub fn supports_proof_of_indexing(&self) -> bool {
+        self.tables.contains_key(&*POI_OBJECT)
+    }
+
+    pub fn create_relational_schema(
+        conn: &PgConnection,
+        site: Arc<Site>,
+        schema: &Schema,
+    ) -> Result<Layout, StoreError> {
+        let catalog = Catalog::for_creation(site.cheap_clone());
+        let layout = Self::new(site, schema, catalog)?;
+        let sql = layout
+            .as_ddl()
+            .map_err(|_| StoreError::Unknown(anyhow!("failed to generate DDL for layout")))?;
+        conn.batch_execute(&sql)?;
+        Ok(layout)
+    }
+
+    /// Determine if it is possible to copy the data of `source` into `self`
+    /// by checking that our schema is compatible with `source`.
+    /// Returns a list of errors if copying is not possible. An empty
+    /// vector indicates that copying is possible
+    pub fn can_copy_from(&self, base: &Layout) -> Vec<String> {
+        // We allow both not copying tables at all from the source, as well
+        // as adding new tables in `self`; we only need to check that tables
+        // that actually need to be copied from the source are compatible
+        // with the corresponding tables in `self`
+        self.tables
+            .values()
+            .filter_map(|dst| base.table(&dst.name).map(|src| (dst, src)))
+            .map(|(dst, src)| dst.can_copy_from(src))
+            .flatten()
+            .collect()
+    }
+
+    /// Import the database schema for this layout from its own database
+    /// shard (in `self.site.shard`) into the database represented by `conn`
+    /// if the schema for this layout does not exist yet
+    pub fn import_schema(&self, conn: &PgConnection) -> Result<(), StoreError> {
+        let make_query = || -> Result<String, fmt::Error> {
+            let nsp = self.site.namespace.as_str();
+            let srvname = ForeignServer::name(&self.site.shard);
+
+            let mut query = String::new();
+            writeln!(query, "create schema {};", nsp)?;
+            // Postgres does not import enums. We recreate them in the target
+            // database, otherwise importing tables that use them fails
+            self.write_enum_ddl(&mut query)?;
+            writeln!(
+                query,
+                "import foreign schema {nsp} from server {srvname} into {nsp}",
+                nsp = nsp,
+                srvname = srvname
+            )?;
+            Ok(query)
+        };
+
+        if !catalog::has_namespace(conn, &self.site.namespace)? {
+            let query = make_query().map_err(|_| {
+                StoreError::Unknown(anyhow!(
+                    "failed to generate SQL to import foreign schema {}",
+                    self.site.namespace
+                ))
+            })?;
+
+            conn.batch_execute(&query)?;
+        }
+        Ok(())
+    }
+
+    /// Find the table with the provided `name`. The name must exactly match
+    /// the name of an existing table. No conversions of the name are done
+    pub fn table(&self, name: &SqlName) -> Option<&Table> {
+        self.tables
+            .values()
+            .find(|table| &table.name == name)
+            .map(|rc| rc.as_ref())
+    }
+
+    pub fn table_for_entity(&self, entity: &EntityType) -> Result<&Arc<Table>, StoreError> {
+        self.tables
+            .get(entity)
+            .ok_or_else(|| StoreError::UnknownTable(entity.to_string()))
+    }
+
+    pub fn find(
+        &self,
+        conn: &PgConnection,
+        entity: &EntityType,
+        id: &str,
+        block: BlockNumber,
+    ) -> Result<Option<Entity>, StoreError> {
+        let table = self.table_for_entity(entity)?;
+        FindQuery::new(table.as_ref(), id, block)
+            .get_result::<EntityData>(conn)
+            .optional()?
+            .map(|entity_data| entity_data.deserialize_with_layout(self, None, true))
+            .transpose()
+    }
+
+    pub fn find_many(
+        &self,
+        conn: &PgConnection,
+        ids_for_type: &BTreeMap<&EntityType, Vec<&str>>,
+        block: BlockNumber,
+    ) -> Result<BTreeMap<EntityType, Vec<Entity>>, StoreError> {
+        if ids_for_type.is_empty() {
+            return Ok(BTreeMap::new());
+        }
+
+        let mut tables = Vec::new();
+        for entity_type in ids_for_type.keys() {
+            tables.push(self.table_for_entity(entity_type)?.as_ref());
+        }
+        let query = FindManyQuery {
+            _namespace: &self.catalog.site.namespace,
+            ids_for_type,
+            tables,
+            block,
+        };
+        let mut entities_for_type: BTreeMap<EntityType, Vec<Entity>> = BTreeMap::new();
+        for data in query.load::<EntityData>(conn)? {
+            let entity_type = data.entity_type();
+            let entity_data: Entity = data.deserialize_with_layout(self, None, true)?;
+
+            entities_for_type
+                .entry(entity_type)
+                .or_default()
+                .push(entity_data);
+        }
+        Ok(entities_for_type)
+    }
+
+    pub fn find_changes(
+        &self,
+        conn: &PgConnection,
+        block: BlockNumber,
+    ) -> Result<Vec<EntityOperation>, StoreError> {
+        let mut tables = Vec::new();
+        for table in self.tables.values() {
+            if table.name.as_str() != POI_TABLE {
+                tables.push(&**table);
+            }
+        }
+
+        let inserts_or_updates =
+            FindChangesQuery::new(&self.catalog.site.namespace, &tables[..], block)
+                .load::<EntityData>(conn)?;
+        let deletions =
+            FindPossibleDeletionsQuery::new(&self.catalog.site.namespace, &tables[..], block)
+                .load::<EntityDeletion>(conn)?;
+
+        let mut processed_entities = HashSet::new();
+        let mut changes = Vec::new();
+
+        for entity_data in inserts_or_updates.into_iter() {
+            let entity_type = entity_data.entity_type();
+            let mut data: Entity = entity_data.deserialize_with_layout(self, None, false)?;
+            let entity_id = Word::from(data.id().expect("Invalid ID for entity."));
+            processed_entities.insert((entity_type.clone(), entity_id.clone()));
+
+            // `__typename` is not a real field.
+            data.remove("__typename")
+                .expect("__typename expected; this is a bug");
+
+            changes.push(EntityOperation::Set {
+                key: EntityKey {
+                    entity_type,
+                    entity_id,
+                },
+                data,
+            });
+        }
+
+        for del in &deletions {
+            let entity_type = del.entity_type();
+            let entity_id = Word::from(del.id());
+
+            // See the doc comment of `FindPossibleDeletionsQuery` for details
+            // about why this check is necessary.
+            if !processed_entities.contains(&(entity_type.clone(), entity_id.clone())) {
+                changes.push(EntityOperation::Remove {
+                    key: EntityKey {
+                        entity_type,
+                        entity_id,
+                    },
+                });
+            }
+        }
+
+        Ok(changes)
+    }
+
+    pub fn insert<'a>(
+        &'a self,
+        conn: &PgConnection,
+        entity_type: &'a EntityType,
+        entities: &'a mut [(&'a EntityKey, Cow<'a, Entity>)],
+        block: BlockNumber,
+        stopwatch: &StopwatchMetrics,
+    ) -> Result<usize, StoreError> {
+        let table = self.table_for_entity(entity_type)?;
+        let _section = stopwatch.start_section("insert_modification_insert_query");
+        let mut count = 0;
+        // Each operation must respect the maximum number of bindings allowed in PostgreSQL queries,
+        // so we need to act in chunks whose size is defined by the number of entities times the
+        // number of attributes each entity type has.
+        // We add 1 to account for the `block_range` bind parameter
+        let chunk_size = POSTGRES_MAX_PARAMETERS / (table.columns.len() + 1);
+        for chunk in entities.chunks_mut(chunk_size) {
+            count += InsertQuery::new(table, chunk, block)?
+                .get_results(conn)
+                .map(|ids| ids.len())?
+        }
+        Ok(count)
+    }
+
+    pub fn conflicting_entity(
+        &self,
+        conn: &PgConnection,
+        entity_id: &str,
+        entities: Vec<EntityType>,
+    ) -> Result<Option<String>, StoreError> {
+        Ok(ConflictingEntityQuery::new(self, entities, entity_id)?
+            .load(conn)?
+            .pop()
+            .map(|data| data.entity))
+    }
+
+    /// order is a tuple (attribute, value_type, direction)
+    pub fn query<T: crate::relational_queries::FromEntityData>(
+        &self,
+        logger: &Logger,
+        conn: &PgConnection,
+        collection: EntityCollection,
+        filter: Option<EntityFilter>,
+        order: EntityOrder,
+        range: EntityRange,
+        block: BlockNumber,
+        query_id: Option<String>,
+    ) -> Result<(Vec<T>, Trace), QueryExecutionError> {
+        fn log_query_timing(
+            logger: &Logger,
+            query: &FilterQuery,
+            elapsed: Duration,
+            entity_count: usize,
+        ) -> Trace {
+            // 20kB
+            const MAXLEN: usize = 20_480;
+
+            if !ENV_VARS.log_sql_timing() {
+                return Trace::None;
+            }
+
+            let mut text = debug_query(&query).to_string().replace("\n", "\t");
+            let trace = Trace::query(&text, elapsed, entity_count);
+
+            // If the query + bind variables is more than MAXLEN, truncate it;
+            // this will happen when queries have very large bind variables
+            // (e.g., long arrays of string ids)
+            if text.len() > MAXLEN {
+                text.truncate(MAXLEN);
+                text.push_str(" ...");
+            }
+            info!(
+                logger,
+                "Query timing (SQL)";
+                "query" => text,
+                "time_ms" => elapsed.as_millis(),
+                "entity_count" => entity_count
+            );
+            trace
+        }
+
+        let filter_collection = FilterCollection::new(self, collection, filter.as_ref(), block)?;
+        let query = FilterQuery::new(
+            &filter_collection,
+            filter.as_ref(),
+            order,
+            range,
+            block,
+            query_id,
+        )?;
+        let query_clone = query.clone();
+
+        let start = Instant::now();
+        let values = conn
+            .transaction(|| {
+                if let Some(ref timeout_sql) = *STATEMENT_TIMEOUT {
+                    conn.batch_execute(timeout_sql)?;
+                }
+                query.load::<EntityData>(conn)
+            })
+            .map_err(|e| {
+                use diesel::result::DatabaseErrorKind;
+                use diesel::result::Error::*;
+                // Sometimes `debug_query(..)` can't be turned into a
+                // string, e.g., because `walk_ast` for one of its fragments
+                // returns an error. When that happens, avoid a panic from
+                // simply calling `to_string()` on it, and output a string
+                // representation of the `FilterQuery` instead of the SQL
+                let mut query_text = String::new();
+                match write!(query_text, "{}", debug_query(&query_clone)) {
+                    Ok(()) => (),
+                    Err(_) => {
+                        write!(query_text, "{query_clone}").ok();
+                    }
+                };
+                match e {
+                    DatabaseError(DatabaseErrorKind::__Unknown, ref info)
+                        if info.message().starts_with("syntax error in tsquery") =>
+                    {
+                        QueryExecutionError::FulltextQueryInvalidSyntax(info.message().to_string())
+                    }
+                    _ => QueryExecutionError::ResolveEntitiesError(format!(
+                        "{e}, query = {query_text}",
+                    )),
+                }
+            })?;
+        let trace = log_query_timing(logger, &query_clone, start.elapsed(), values.len());
+
+        let parent_type = filter_collection.parent_type()?.map(ColumnType::from);
+        values
+            .into_iter()
+            .map(|entity_data| {
+                entity_data
+                    .deserialize_with_layout(self, parent_type.as_ref(), false)
+                    .map_err(|e| e.into())
+            })
+            .collect::<Result<Vec<T>, _>>()
+            .map(|values| (values, trace))
+    }
+
+    pub fn update<'a>(
+        &'a self,
+        conn: &PgConnection,
+        entity_type: &'a EntityType,
+        entities: &'a mut [(&'a EntityKey, Cow<'a, Entity>)],
+        block: BlockNumber,
+        stopwatch: &StopwatchMetrics,
+    ) -> Result<usize, StoreError> {
+        let table = self.table_for_entity(entity_type)?;
+        if table.immutable {
+            let ids = entities
+                .into_iter()
+                .map(|(key, _)| key.entity_id.as_str())
+                .collect::<Vec<_>>()
+                .join(", ");
+            return Err(constraint_violation!(
+                "entities of type `{}` can not be updated since they are immutable. Entity ids are [{}]",
+                entity_type,
+                ids
+            ));
+        }
+
+        let entity_keys: Vec<&str> = entities
+            .iter()
+            .map(|(key, _)| key.entity_id.as_str())
+            .collect();
+
+        let section = stopwatch.start_section("update_modification_clamp_range_query");
+        ClampRangeQuery::new(table, &entity_keys, block)?.execute(conn)?;
+        section.end();
+
+        let _section = stopwatch.start_section("update_modification_insert_query");
+        let mut count = 0;
+
+        // Each operation must respect the maximum number of bindings allowed in PostgreSQL queries,
+        // so we need to act in chunks whose size is defined by the number of entities times the
+        // number of attributes each entity type has.
+        // We add 1 to account for the `block_range` bind parameter
+        let chunk_size = POSTGRES_MAX_PARAMETERS / (table.columns.len() + 1);
+        for chunk in entities.chunks_mut(chunk_size) {
+            count += InsertQuery::new(table, chunk, block)?.execute(conn)?;
+        }
+        Ok(count)
+    }
+
+    pub fn delete(
+        &self,
+        conn: &PgConnection,
+        entity_type: &EntityType,
+        entity_ids: &[&str],
+        block: BlockNumber,
+        stopwatch: &StopwatchMetrics,
+    ) -> Result<usize, StoreError> {
+        let table = self.table_for_entity(entity_type)?;
+        if table.immutable {
+            return Err(constraint_violation!(
+                "entities of type `{}` can not be deleted since they are immutable. Entity ids are [{}]",
+                entity_type, entity_ids.join(", ")
+            ));
+        }
+
+        let _section = stopwatch.start_section("delete_modification_clamp_range_query");
+        let mut count = 0;
+        for chunk in entity_ids.chunks(DELETE_OPERATION_CHUNK_SIZE) {
+            count += ClampRangeQuery::new(table, chunk, block)?.execute(conn)?
+        }
+        Ok(count)
+    }
+
+    /// Revert the block with number `block` and all blocks with higher
+    /// numbers. After this operation, only entity versions inserted or
+    /// updated at blocks with numbers strictly lower than `block` will
+    /// remain
+    pub fn revert_block(
+        &self,
+        conn: &PgConnection,
+        block: BlockNumber,
+    ) -> Result<(StoreEvent, i32), StoreError> {
+        let mut changes: Vec<EntityChange> = Vec::new();
+        let mut count: i32 = 0;
+
+        for table in self.tables.values() {
+            // Remove all versions whose entire block range lies beyond
+            // `block`
+            let removed = RevertRemoveQuery::new(table, block)
+                .get_results(conn)?
+                .into_iter()
+                .map(|data| data.id)
+                .collect::<HashSet<_>>();
+            // Make the versions current that existed at `block - 1` but that
+            // are not current yet. Those are the ones that were updated or
+            // deleted at `block`
+            let unclamped = if table.immutable {
+                HashSet::new()
+            } else {
+                RevertClampQuery::new(table, block - 1)?
+                    .get_results(conn)?
+                    .into_iter()
+                    .map(|data| data.id)
+                    .collect::<HashSet<_>>()
+            };
+            // Adjust the entity count; we can tell which operation was
+            // initially performed by
+            //   id in (unset - unclamped)  => insert (we now deleted)
+            //   id in (unset && unclamped) => update (we reversed the update)
+            //   id in (unclamped - unset)  => delete (we now inserted)
+            let deleted = removed.difference(&unclamped).count() as i32;
+            let inserted = unclamped.difference(&removed).count() as i32;
+            count += inserted - deleted;
+            // EntityChange for versions we just deleted
+            let deleted = removed
+                .into_iter()
+                .filter(|id| !unclamped.contains(id))
+                .map(|_| EntityChange::Data {
+                    subgraph_id: self.site.deployment.clone(),
+                    entity_type: table.object.clone(),
+                });
+            changes.extend(deleted);
+            // EntityChange for versions that we just updated or inserted
+            let set = unclamped.into_iter().map(|_| EntityChange::Data {
+                subgraph_id: self.site.deployment.clone(),
+                entity_type: table.object.clone(),
+            });
+            changes.extend(set);
+        }
+        Ok((StoreEvent::new(changes), count))
+    }
+
+    /// Revert the metadata (dynamic data sources and related entities) for
+    /// the given `subgraph`.
+    ///
+    /// For metadata, reversion always means deletion since the metadata that
+    /// is subject to reversion is only ever created but never updated
+    pub fn revert_metadata(
+        conn: &PgConnection,
+        site: &Site,
+        block: BlockNumber,
+    ) -> Result<(), StoreError> {
+        crate::dynds::revert(conn, site, block)?;
+        crate::deployment::revert_subgraph_errors(conn, &site.deployment, block)?;
+
+        Ok(())
+    }
+
+    pub fn is_cacheable(&self) -> bool {
+        // This would be false if we still needed to migrate the Layout, but
+        // since there are no migrations in the code right now, it is always
+        // safe to cache a Layout
+        true
+    }
+
+    /// Update the layout with the latest information from the database; for
+    /// now, an update only changes the `is_account_like` flag for tables or
+    /// the layout's site. If no update is needed, just return `self`.
+    pub fn refresh(
+        self: Arc<Self>,
+        conn: &PgConnection,
+        site: Arc<Site>,
+    ) -> Result<Arc<Self>, StoreError> {
+        let account_like = crate::catalog::account_like(conn, &self.site)?;
+        let is_account_like = { |table: &Table| account_like.contains(table.name.as_str()) };
+
+        let changed_tables: Vec<_> = self
+            .tables
+            .values()
+            .filter(|table| table.is_account_like != is_account_like(table.as_ref()))
+            .collect();
+        if changed_tables.is_empty() && site == self.site {
+            return Ok(self);
+        }
+        let mut layout = (*self).clone();
+        for table in changed_tables.into_iter() {
+            let mut table = (*table.as_ref()).clone();
+            table.is_account_like = is_account_like(&table);
+            layout.tables.insert(table.object.clone(), Arc::new(table));
+        }
+        layout.site = site;
+        Ok(Arc::new(layout))
+    }
+}
+
+/// A user-defined enum
+#[derive(Clone, Debug, PartialEq)]
+pub struct EnumType {
+    /// The name of the Postgres enum we created, fully qualified with the schema
+    pub name: SqlName,
+    /// The possible values the enum can take
+    values: Arc<BTreeSet<String>>,
+}
+
+impl EnumType {
+    fn is_assignable_from(&self, source: &Self) -> Option<String> {
+        if source.values.is_subset(self.values.as_ref()) {
+            None
+        } else {
+            Some(format!(
+                "the enum type {} contains values not present in {}",
+                source.name, self.name
+            ))
+        }
+    }
+}
+
+/// This is almost the same as graph::data::store::ValueType, but without
+/// ID and List; with this type, we only care about scalar types that directly
+/// correspond to Postgres scalar types
+#[derive(Clone, Debug, PartialEq)]
+pub enum ColumnType {
+    Boolean,
+    BigDecimal,
+    BigInt,
+    Bytes,
+    Int,
+    String,
+    TSVector(FulltextConfig),
+    Enum(EnumType),
+}
+
+impl From<IdType> for ColumnType {
+    fn from(id_type: IdType) -> Self {
+        match id_type {
+            IdType::Bytes => ColumnType::Bytes,
+            IdType::String => ColumnType::String,
+        }
+    }
+}
+
+impl ColumnType {
+    fn from_field_type(
+        field_type: &q::Type,
+        catalog: &Catalog,
+        enums: &EnumMap,
+        id_types: &IdTypeMap,
+        is_existing_text_column: bool,
+    ) -> Result<ColumnType, StoreError> {
+        let name = named_type(field_type);
+
+        // See if its an object type defined in the schema
+        if let Some(id_type) = id_types.get(&EntityType::new(name.to_string())) {
+            return Ok((*id_type).into());
+        }
+
+        // Check if it's an enum, and if it is, return an appropriate
+        // ColumnType::Enum
+        if let Some(values) = enums.get(&*name) {
+            // We do things this convoluted way to make sure field_type gets
+            // snakecased, but the `.` must stay a `.`
+            let name = SqlName::qualified_name(&catalog.site.namespace, &SqlName::from(name));
+            if is_existing_text_column {
+                // We used to have a bug where columns that should have really
+                // been of an enum type were created as text columns. To make
+                // queries work against such misgenerated tables, we pretend
+                // that this GraphQL attribute is really of type `String`
+                return Ok(ColumnType::String);
+            } else {
+                return Ok(ColumnType::Enum(EnumType {
+                    name,
+                    values: values.clone(),
+                }));
+            }
+        }
+
+        // It is not an object type or an enum, and therefore one of our
+        // builtin primitive types
+        match ValueType::from_str(name)? {
+            ValueType::Boolean => Ok(ColumnType::Boolean),
+            ValueType::BigDecimal => Ok(ColumnType::BigDecimal),
+            ValueType::BigInt => Ok(ColumnType::BigInt),
+            ValueType::Bytes => Ok(ColumnType::Bytes),
+            ValueType::Int => Ok(ColumnType::Int),
+            ValueType::String => Ok(ColumnType::String),
+        }
+    }
+
+    pub fn sql_type(&self) -> &str {
+        match self {
+            ColumnType::Boolean => "boolean",
+            ColumnType::BigDecimal => "numeric",
+            ColumnType::BigInt => "numeric",
+            ColumnType::Bytes => "bytea",
+            ColumnType::Int => "integer",
+            ColumnType::String => "text",
+            ColumnType::TSVector(_) => "tsvector",
+            ColumnType::Enum(enum_type) => enum_type.name.as_str(),
+        }
+    }
+
+    /// Return the `IdType` corresponding to this column type. This can only
+    /// be called on a column that stores an `ID` and will panic otherwise
+    pub(crate) fn id_type(&self) -> IdType {
+        match self {
+            ColumnType::String => IdType::String,
+            ColumnType::Bytes => IdType::Bytes,
+            _ => unreachable!(
+                "only String and BytesId are allowed as primary keys but not {:?}",
+                self
+            ),
+        }
+    }
+}
+
+#[derive(Clone, Debug)]
+pub struct Column {
+    pub name: SqlName,
+    pub field: String,
+    pub field_type: q::Type,
+    pub column_type: ColumnType,
+    pub fulltext_fields: Option<HashSet<String>>,
+    is_reference: bool,
+    /// Whether to use a prefix of the column for comparisons and index
+    /// creation, or column values in their entirety
+    pub use_prefix_comparison: bool,
+}
+
+impl Column {
+    fn new(
+        table_name: &SqlName,
+        field: &s::Field,
+        catalog: &Catalog,
+        enums: &EnumMap,
+        id_types: &IdTypeMap,
+    ) -> Result<Column, StoreError> {
+        SqlName::check_valid_identifier(&*field.name, "attribute")?;
+
+        let sql_name = SqlName::from(&*field.name);
+        let is_reference =
+            sql_name.as_str() != PRIMARY_KEY_COLUMN && is_object_type(&field.field_type, enums);
+
+        let column_type = if sql_name.as_str() == PRIMARY_KEY_COLUMN {
+            IdType::try_from(&field.field_type)?.into()
+        } else {
+            let is_existing_text_column = catalog.is_existing_text_column(table_name, &sql_name);
+            ColumnType::from_field_type(
+                &field.field_type,
+                catalog,
+                enums,
+                id_types,
+                is_existing_text_column,
+            )?
+        };
+        let is_primary_key = sql_name.as_str() == PRIMARY_KEY_COLUMN;
+
+        // When a column has arbitrary size, we only index a prefix of the
+        // column to avoid errors caused by inserting values that are too
+        // large for the index.
+        //
+        // Since we already have installations where `Bytes` columns had
+        // been indexed in their entirety, we remember if a specific
+        // subgraph indexes that, or just a prefix of `Bytes` columns. Query
+        // generation needs to match how these columns are indexed, and we
+        // therefore use that remembered value from `catalog` to determine
+        // if we should use queries for prefixes or for the entire value.
+        // see: attr-bytea-prefix
+        let use_prefix_comparison = !is_primary_key
+            && !is_reference
+            && !field.field_type.is_list()
+            && (column_type == ColumnType::String
+                || (column_type == ColumnType::Bytes && catalog.use_bytea_prefix));
+
+        Ok(Column {
+            name: sql_name,
+            field: field.name.clone(),
+            column_type,
+            field_type: field.field_type.clone(),
+            fulltext_fields: None,
+            is_reference,
+            use_prefix_comparison,
+        })
+    }
+
+    fn new_fulltext(def: &FulltextDefinition) -> Result<Column, StoreError> {
+        SqlName::check_valid_identifier(&def.name, "attribute")?;
+        let sql_name = SqlName::from(def.name.as_str());
+
+        Ok(Column {
+            name: sql_name,
+            field: def.name.to_string(),
+            field_type: q::Type::NamedType("fulltext".to_string()),
+            column_type: ColumnType::TSVector(def.config.clone()),
+            fulltext_fields: Some(def.included_fields.clone()),
+            is_reference: false,
+            use_prefix_comparison: false,
+        })
+    }
+
+    fn sql_type(&self) -> &str {
+        self.column_type.sql_type()
+    }
+
+    pub fn is_nullable(&self) -> bool {
+        fn is_nullable(field_type: &q::Type) -> bool {
+            match field_type {
+                q::Type::NonNullType(_) => false,
+                _ => true,
+            }
+        }
+        is_nullable(&self.field_type)
+    }
+
+    pub fn is_list(&self) -> bool {
+        self.field_type.is_list()
+    }
+
+    pub fn is_enum(&self) -> bool {
+        matches!(self.column_type, ColumnType::Enum(_))
+    }
+
+    pub fn is_fulltext(&self) -> bool {
+        named_type(&self.field_type) == "fulltext"
+    }
+
+    pub fn is_reference(&self) -> bool {
+        self.is_reference
+    }
+
+    pub fn is_primary_key(&self) -> bool {
+        self.name.as_str() == PRIMARY_KEY_COLUMN
+    }
+
+    pub fn is_assignable_from(&self, source: &Self, object: &EntityType) -> Option<String> {
+        if !self.is_nullable() && source.is_nullable() {
+            Some(format!(
+                "The attribute {}.{} is non-nullable, \
+                             but the corresponding attribute in the source is nullable",
+                object, self.field
+            ))
+        } else if let ColumnType::Enum(self_enum_type) = &self.column_type {
+            if let ColumnType::Enum(source_enum_type) = &source.column_type {
+                self_enum_type.is_assignable_from(source_enum_type)
+            } else {
+                Some(format!(
+                    "The attribute {}.{} is an enum {}, \
+                                 but its type in the source is {}",
+                    object, self.field, self.field_type, source.field_type
+                ))
+            }
+        } else if self.column_type != source.column_type || self.is_list() != source.is_list() {
+            Some(format!(
+                "The attribute {}.{} has type {}, \
+                             but its type in the source is {}",
+                object, self.field, self.field_type, source.field_type
+            ))
+        } else {
+            None
+        }
+    }
+}
+
+/// The name for the primary key column of a table; hardcoded for now
+pub(crate) const PRIMARY_KEY_COLUMN: &str = "id";
+
+/// We give every version of every entity in our tables, i.e., every row, a
+/// synthetic primary key. This is the name of the column we use.
+pub(crate) const VID_COLUMN: &str = "vid";
+
+#[derive(Debug, Clone)]
+pub struct Table {
+    /// The name of the GraphQL object type ('Thing')
+    pub object: EntityType,
+    /// The name of the database table for this type ('thing'), snakecased
+    /// version of `object`
+    pub name: SqlName,
+
+    /// The table name qualified with the schema in which the table lives,
+    /// `schema.table`
+    pub qualified_name: SqlName,
+
+    pub columns: Vec<Column>,
+
+    /// This kind of entity behaves like an account in that it has a low
+    /// ratio of distinct entities to overall number of rows because
+    /// entities are updated frequently on average
+    pub is_account_like: bool,
+
+    /// The position of this table in all the tables for this layout; this
+    /// is really only needed for the tests to make the names of indexes
+    /// predictable
+    position: u32,
+
+    /// Entities in this table are immutable, i.e., will never be updated or
+    /// deleted
+    pub(crate) immutable: bool,
+}
+
+impl Table {
+    fn new(
+        defn: &s::ObjectType,
+        catalog: &Catalog,
+        fulltexts: Vec<FulltextDefinition>,
+        enums: &EnumMap,
+        id_types: &IdTypeMap,
+        position: u32,
+    ) -> Result<Table, StoreError> {
+        SqlName::check_valid_identifier(&*defn.name, "object")?;
+
+        let table_name = SqlName::from(&*defn.name);
+        let columns = defn
+            .fields
+            .iter()
+            .filter(|field| !field.is_derived())
+            .map(|field| Column::new(&table_name, field, catalog, enums, id_types))
+            .chain(fulltexts.iter().map(Column::new_fulltext))
+            .collect::<Result<Vec<Column>, StoreError>>()?;
+        let qualified_name = SqlName::qualified_name(&catalog.site.namespace, &table_name);
+        let immutable = defn.is_immutable();
+
+        let table = Table {
+            object: EntityType::from(defn),
+            name: table_name,
+            qualified_name,
+            // Default `is_account_like` to `false`; the caller should call
+            // `refresh` after constructing the layout, but that requires a
+            // db connection, which we don't have at this point.
+            is_account_like: false,
+            columns,
+            position,
+            immutable,
+        };
+        Ok(table)
+    }
+
+    /// Create a table that is like `self` except that its name in the
+    /// database is based on `namespace` and `name`
+    pub fn new_like(&self, namespace: &Namespace, name: &SqlName) -> Arc<Table> {
+        let other = Table {
+            object: self.object.clone(),
+            name: name.clone(),
+            qualified_name: SqlName::qualified_name(namespace, &name),
+            columns: self.columns.clone(),
+            is_account_like: self.is_account_like,
+            position: self.position,
+            immutable: self.immutable,
+        };
+
+        Arc::new(other)
+    }
+
+    /// Find the column `name` in this table. The name must be in snake case,
+    /// i.e., use SQL conventions
+    pub fn column(&self, name: &SqlName) -> Option<&Column> {
+        self.columns
+            .iter()
+            .filter(|column| match column.column_type {
+                ColumnType::TSVector(_) => false,
+                _ => true,
+            })
+            .find(|column| &column.name == name)
+    }
+
+    /// Find the column for `field` in this table. The name must be the
+    /// GraphQL name of an entity field
+    pub fn column_for_field(&self, field: &str) -> Result<&Column, StoreError> {
+        self.columns
+            .iter()
+            .find(|column| column.field == field)
+            .ok_or_else(|| StoreError::UnknownField(field.to_string()))
+    }
+
+    fn can_copy_from(&self, source: &Self) -> Vec<String> {
+        self.columns
+            .iter()
+            .filter_map(|dcol| match source.column(&dcol.name) {
+                Some(scol) => dcol.is_assignable_from(scol, &self.object),
+                None => {
+                    if !dcol.is_nullable() {
+                        Some(format!(
+                            "The attribute {}.{} is non-nullable, \
+                         but there is no such attribute in the source",
+                            self.object, dcol.field
+                        ))
+                    } else {
+                        None
+                    }
+                }
+            })
+            .collect()
+    }
+
+    pub fn primary_key(&self) -> &Column {
+        self.columns
+            .iter()
+            .find(|column| column.is_primary_key())
+            .expect("every table has a primary key")
+    }
+
+    pub(crate) fn analyze(&self, conn: &PgConnection) -> Result<(), StoreError> {
+        let table_name = &self.qualified_name;
+        let sql = format!("analyze {table_name}");
+        conn.execute(&sql)?;
+        Ok(())
+    }
+}
+
+/// Return the enclosed named type for a field type, i.e., the type after
+/// stripping List and NonNull.
+fn named_type(field_type: &q::Type) -> &str {
+    match field_type {
+        q::Type::NamedType(name) => name.as_str(),
+        q::Type::ListType(child) => named_type(child),
+        q::Type::NonNullType(child) => named_type(child),
+    }
+}
+
+fn is_object_type(field_type: &q::Type, enums: &EnumMap) -> bool {
+    let name = named_type(field_type);
+
+    !enums.contains_key(&*name) && !ValueType::is_scalar(name)
+}
+
+#[derive(Clone)]
+struct CacheEntry {
+    value: Arc<Layout>,
+    expires: Instant,
+}
+
+/// Cache layouts for some time and refresh them when they expire.
+/// Refreshing happens one at a time, and the cache makes sure we minimize
+/// blocking while a refresh happens, favoring using an expired layout over
+/// a refreshed one.
+pub struct LayoutCache {
+    entries: Mutex<HashMap<DeploymentHash, CacheEntry>>,
+    ttl: Duration,
+    /// Use this so that we only refresh one layout at any given time to
+    /// avoid refreshing the same layout multiple times
+    refresh: Mutex<()>,
+}
+
+impl LayoutCache {
+    pub fn new(ttl: Duration) -> Self {
+        Self {
+            entries: Mutex::new(HashMap::new()),
+            ttl,
+            refresh: Mutex::new(()),
+        }
+    }
+
+    fn load(conn: &PgConnection, site: Arc<Site>) -> Result<Arc<Layout>, StoreError> {
+        let (subgraph_schema, use_bytea_prefix) = deployment::schema(conn, site.as_ref())?;
+        let catalog = Catalog::load(conn, site.clone(), use_bytea_prefix)?;
+        let layout = Arc::new(Layout::new(site.clone(), &subgraph_schema, catalog)?);
+        layout.refresh(conn, site)
+    }
+
+    fn cache(&self, layout: Arc<Layout>) {
+        if layout.is_cacheable() {
+            let deployment = layout.site.deployment.clone();
+            let entry = CacheEntry {
+                expires: Instant::now() + self.ttl,
+                value: layout,
+            };
+            self.entries.lock().unwrap().insert(deployment, entry);
+        }
+    }
+
+    /// Return the corresponding layout if we have one in cache already, and
+    /// ignore expiration information
+    pub(crate) fn find(&self, site: &Site) -> Option<Arc<Layout>> {
+        self.entries
+            .lock()
+            .unwrap()
+            .get(&site.deployment)
+            .map(|CacheEntry { value, expires: _ }| value.clone())
+    }
+
+    /// Get the layout for `site`. If it's not in cache, load it. If it is
+    /// expired, try to refresh it if there isn't another refresh happening
+    /// already
+    pub fn get(
+        &self,
+        logger: &Logger,
+        conn: &PgConnection,
+        site: Arc<Site>,
+    ) -> Result<Arc<Layout>, StoreError> {
+        let now = Instant::now();
+        let entry = {
+            let lock = self.entries.lock().unwrap();
+            lock.get(&site.deployment).cloned()
+        };
+        match entry {
+            Some(CacheEntry { value, expires }) => {
+                if now <= expires {
+                    // Entry is not expired; use it
+                    Ok(value)
+                } else {
+                    // Only do a cache refresh once; we don't want to have
+                    // multiple threads refreshing the same layout
+                    // simultaneously. It's easiest to refresh at most one
+                    // layout globally
+                    let refresh = self.refresh.try_lock();
+                    if refresh.is_err() {
+                        return Ok(value);
+                    }
+                    match value.cheap_clone().refresh(conn, site) {
+                        Err(e) => {
+                            warn!(
+                                logger,
+                                "failed to refresh statistics. Continuing with old statistics";
+                                "deployment" => &value.site.deployment,
+                                "error" => e.to_string()
+                            );
+                            // Update the timestamp so we don't retry
+                            // refreshing too often
+                            self.cache(value.cheap_clone());
+                            Ok(value)
+                        }
+                        Ok(layout) => {
+                            self.cache(layout.cheap_clone());
+                            Ok(layout)
+                        }
+                    }
+                }
+            }
+            None => {
+                let layout = Self::load(conn, site)?;
+                self.cache(layout.cheap_clone());
+                Ok(layout)
+            }
+        }
+    }
+
+    // Only needed for tests
+    #[cfg(debug_assertions)]
+    pub(crate) fn clear(&self) {
+        self.entries.lock().unwrap().clear()
+    }
+}
diff --git a/store/postgres/src/relational/ddl.rs b/store/postgres/src/relational/ddl.rs
new file mode 100644
index 0000000..0a4a235
--- /dev/null
+++ b/store/postgres/src/relational/ddl.rs
@@ -0,0 +1,390 @@
+use std::{
+    fmt::{self, Write},
+    iter,
+};
+
+use graph::prelude::BLOCK_NUMBER_MAX;
+
+use crate::relational::{
+    Catalog, ColumnType, BLOCK_COLUMN, BLOCK_RANGE_COLUMN, BYTE_ARRAY_PREFIX_SIZE,
+    STRING_PREFIX_SIZE, VID_COLUMN,
+};
+
+use super::{Column, Layout, SqlName, Table};
+
+impl Layout {
+    /// Generate the DDL for the entire layout, i.e., all `create table`
+    /// and `create index` etc. statements needed in the database schema
+    ///
+    /// See the unit tests at the end of this file for the actual DDL that
+    /// gets generated
+    pub fn as_ddl(&self) -> Result<String, fmt::Error> {
+        let mut out = String::new();
+
+        // Output enums first so table definitions can reference them
+        self.write_enum_ddl(&mut out)?;
+
+        // We sort tables here solely because the unit tests rely on
+        // 'create table' statements appearing in a fixed order
+        let mut tables = self.tables.values().collect::<Vec<_>>();
+        tables.sort_by_key(|table| table.position);
+        // Output 'create table' statements for all tables
+        for table in tables {
+            table.as_ddl(&mut out, self)?;
+        }
+
+        Ok(out)
+    }
+
+    pub(crate) fn write_enum_ddl(&self, out: &mut dyn Write) -> Result<(), fmt::Error> {
+        for (name, values) in &self.enums {
+            let mut sep = "";
+            let name = SqlName::from(name.as_str());
+            write!(
+                out,
+                "create type {}.{}\n    as enum (",
+                self.catalog.site.namespace,
+                name.quoted()
+            )?;
+            for value in values.iter() {
+                write!(out, "{}'{}'", sep, value)?;
+                sep = ", "
+            }
+            writeln!(out, ");")?;
+        }
+        Ok(())
+    }
+}
+
+impl Table {
+    /// Return an iterator over all the column names of this table
+    ///
+    // This needs to stay in sync with `create_table`
+    pub(crate) fn column_names(&self) -> impl Iterator<Item = &str> {
+        let block_column = if self.immutable {
+            BLOCK_COLUMN
+        } else {
+            BLOCK_RANGE_COLUMN
+        };
+        let data_cols = self.columns.iter().map(|col| col.name.as_str());
+        iter::once(VID_COLUMN)
+            .chain(data_cols)
+            .chain(iter::once(block_column))
+    }
+
+    // Changes to this function require changing `column_names`, too
+    pub(crate) fn create_table(&self, out: &mut String, layout: &Layout) -> fmt::Result {
+        fn columns_ddl(table: &Table) -> Result<String, fmt::Error> {
+            let mut cols = String::new();
+            let mut first = true;
+            for column in &table.columns {
+                if !first {
+                    writeln!(cols, ",")?;
+                } else {
+                    writeln!(cols)?;
+                }
+                write!(cols, "    ")?;
+                column.as_ddl(&mut cols)?;
+                first = false;
+            }
+            Ok(cols)
+        }
+
+        if self.immutable {
+            writeln!(
+                out,
+                r#"
+            create table {nsp}.{name} (
+                {vid}                  bigserial primary key,
+                {block}                int not null,
+                {cols},
+                unique({id})
+            );
+            "#,
+                nsp = layout.catalog.site.namespace,
+                name = self.name.quoted(),
+                cols = columns_ddl(self)?,
+                vid = VID_COLUMN,
+                block = BLOCK_COLUMN,
+                id = self.primary_key().name
+            )
+        } else {
+            writeln!(
+                out,
+                r#"
+            create table {nsp}.{name} (
+                {vid}                  bigserial primary key,
+                {block_range}          int4range not null,
+                {cols}
+            );
+            "#,
+                nsp = layout.catalog.site.namespace,
+                name = self.name.quoted(),
+                cols = columns_ddl(self)?,
+                vid = VID_COLUMN,
+                block_range = BLOCK_RANGE_COLUMN
+            )?;
+
+            self.exclusion_ddl(
+                out,
+                layout.catalog.site.namespace.as_str(),
+                Catalog::create_exclusion_constraint(),
+            )
+        }
+    }
+
+    /// Generate SQL that renames the table `from` to `to`. The code assumes
+    /// that `from` has been created with `create_table`, but that no other
+    /// indexes have been created on it, and also renames any indexes and
+    /// constraints, so that the database, after running the generated SQL,
+    /// will have the exact same table as if `from.create_sql` had been run
+    /// initially.
+    ///
+    /// The code does not do anything about the sequence for `vid`; it is
+    /// assumed that both `from` and `to` already use the same sequence for
+    /// that
+    ///
+    /// For mutable tables, if `has_exclusion_constraint` is true, assume
+    /// there is an exclusion constraint on `(id, block_range)`; if it is
+    /// false, assume there is a GIST index on those columns. For immutbale
+    /// tables, this argument has no effect. It is assumed that the name of
+    /// the constraint or index is what `create_table` uses for these.
+    pub(crate) fn rename_sql(
+        out: &mut String,
+        layout: &Layout,
+        from: &Table,
+        to: &Table,
+        has_exclusion_constraint: bool,
+    ) -> fmt::Result {
+        let nsp = layout.site.namespace.as_str();
+        let from_name = &from.name;
+        let to_name = &to.name;
+        let id = &to.primary_key().name;
+
+        writeln!(
+            out,
+            r#"alter table "{nsp}"."{from_name}" rename to "{to_name}";"#
+        )?;
+
+        writeln!(
+            out,
+            r#"alter table "{nsp}"."{to_name}" rename constraint "{from_name}_pkey" to "{to_name}_pkey";"#
+        )?;
+
+        if to.immutable {
+            writeln!(
+                out,
+                r#"alter table "{nsp}"."{to_name}" rename constraint "{from_name}_{id}_key" to "{to_name}_{id}_key";"#
+            )?;
+        } else {
+            if has_exclusion_constraint {
+                writeln!(
+                    out,
+                    r#"alter table "{nsp}"."{to_name}" rename constraint "{from_name}_{id}_{BLOCK_RANGE_COLUMN}_excl" to "{to_name}_{id}_{BLOCK_RANGE_COLUMN}_excl";"#
+                )?;
+            } else {
+                writeln!(
+                    out,
+                    r#"alter index "{nsp}"."{from_name}_{id}_{BLOCK_RANGE_COLUMN}_excl" rename to "{to_name}_{id}_{BLOCK_RANGE_COLUMN}_excl";"#
+                )?;
+            }
+        }
+
+        Ok(())
+    }
+
+    pub(crate) fn create_time_travel_indexes(
+        &self,
+        out: &mut String,
+        layout: &Layout,
+    ) -> fmt::Result {
+        if self.immutable {
+            write!(
+                out,
+                "create index brin_{table_name}\n    \
+                on {schema_name}.{table_name}\n \
+                   using brin({block}, vid);\n",
+                table_name = self.name,
+                schema_name = layout.catalog.site.namespace,
+                block = BLOCK_COLUMN
+            )
+        } else {
+            // Add a BRIN index on the block_range bounds to exploit the fact
+            // that block ranges closely correlate with where in a table an
+            // entity appears physically. This index is incredibly efficient for
+            // reverts where we look for very recent blocks, so that this index
+            // is highly selective. See https://github.com/graphprotocol/graph-node/issues/1415#issuecomment-630520713
+            // for details on one experiment.
+            //
+            // We do not index the `block_range` as a whole, but rather the lower
+            // and upper bound separately, since experimentation has shown that
+            // Postgres will not use the index on `block_range` for clauses like
+            // `block_range @> $block` but rather falls back to a full table scan.
+            //
+            // We also make sure that we do not put `NULL` in the index for
+            // the upper bound since nulls can not be compared to anything and
+            // will make the index less effective.
+            //
+            // To make the index usable, queries need to have clauses using
+            // `lower(block_range)` and `coalesce(..)` verbatim.
+            //
+            // We also index `vid` as that correlates with the order in which
+            // entities are stored.
+            write!(out,"create index brin_{table_name}\n    \
+                on {schema_name}.{table_name}\n \
+                   using brin(lower(block_range), coalesce(upper(block_range), {block_max}), vid);\n",
+                table_name = self.name,
+                schema_name = layout.catalog.site.namespace,
+                block_max = BLOCK_NUMBER_MAX)?;
+
+            // Add a BTree index that helps with the `RevertClampQuery` by making
+            // it faster to find entity versions that have been modified
+            write!(
+                out,
+                "create index {table_name}_block_range_closed\n    \
+                 on {schema_name}.{table_name}(coalesce(upper(block_range), {block_max}))\n \
+                 where coalesce(upper(block_range), {block_max}) < {block_max};\n",
+                table_name = self.name,
+                schema_name = layout.catalog.site.namespace,
+                block_max = BLOCK_NUMBER_MAX
+            )
+        }
+    }
+
+    pub(crate) fn create_attribute_indexes(
+        &self,
+        out: &mut String,
+        layout: &Layout,
+    ) -> fmt::Result {
+        // Create indexes. Skip columns whose type is an array of enum,
+        // since there is no good way to index them with Postgres 9.6.
+        // Once we move to Postgres 11, we can enable that
+        // (tracked in graph-node issue #1330)
+        for (i, column) in self
+            .columns
+            .iter()
+            .filter(|col| !(col.is_list() && col.is_enum()))
+            .enumerate()
+        {
+            if self.immutable && column.is_primary_key() {
+                // We create a unique index on `id` in `create_table`
+                // and don't need an explicit attribute index
+                continue;
+            }
+
+            let (method, index_expr) = if column.is_reference() && !column.is_list() {
+                // For foreign keys, index the key together with the block range
+                // since we almost always also have a block_range clause in
+                // queries that look for specific foreign keys
+                if self.immutable {
+                    let index_expr = format!("{}, {}", column.name.quoted(), BLOCK_COLUMN);
+                    ("btree", index_expr)
+                } else {
+                    let index_expr = format!("{}, {}", column.name.quoted(), BLOCK_RANGE_COLUMN);
+                    ("gist", index_expr)
+                }
+            } else {
+                // Attributes that are plain strings or bytes are
+                // indexed with a BTree; but they can be too large for
+                // Postgres' limit on values that can go into a BTree.
+                // For those attributes, only index the first
+                // STRING_PREFIX_SIZE or BYTE_ARRAY_PREFIX_SIZE characters
+                // see: attr-bytea-prefix
+                let index_expr = if column.use_prefix_comparison {
+                    match column.column_type {
+                        ColumnType::String => {
+                            format!("left({}, {})", column.name.quoted(), STRING_PREFIX_SIZE)
+                        }
+                        ColumnType::Bytes => format!(
+                            "substring({}, 1, {})",
+                            column.name.quoted(),
+                            BYTE_ARRAY_PREFIX_SIZE
+                        ),
+                        _ => unreachable!("only String and Bytes can have arbitrary size"),
+                    }
+                } else {
+                    column.name.quoted()
+                };
+
+                let method = if column.is_list() || column.is_fulltext() {
+                    "gin"
+                } else {
+                    "btree"
+                };
+
+                (method, index_expr)
+            };
+            write!(
+            out,
+            "create index attr_{table_index}_{column_index}_{table_name}_{column_name}\n    on {schema_name}.\"{table_name}\" using {method}({index_expr});\n",
+            table_index = self.position,
+            table_name = self.name,
+            column_index = i,
+            column_name = column.name,
+            schema_name = layout.catalog.site.namespace,
+            method = method,
+            index_expr = index_expr,
+        )?;
+        }
+        writeln!(out)
+    }
+
+    /// Generate the DDL for one table, i.e. one `create table` statement
+    /// and all `create index` statements for the table's columns
+    ///
+    /// See the unit tests at the end of this file for the actual DDL that
+    /// gets generated
+    fn as_ddl(&self, out: &mut String, layout: &Layout) -> fmt::Result {
+        self.create_table(out, layout)?;
+        self.create_time_travel_indexes(out, layout)?;
+        self.create_attribute_indexes(out, layout)
+    }
+
+    pub fn exclusion_ddl(&self, out: &mut String, nsp: &str, as_constraint: bool) -> fmt::Result {
+        if as_constraint {
+            writeln!(
+                out,
+                r#"
+        alter table {nsp}.{name}
+          add constraint {bare_name}_{id}_{block_range}_excl exclude using gist ({id} with =, {block_range} with &&);
+               "#,
+                name = self.name.quoted(),
+                bare_name = self.name,
+                id = self.primary_key().name,
+                block_range = BLOCK_RANGE_COLUMN
+            )?;
+        } else {
+            writeln!(
+                out,
+                r#"
+        create index {bare_name}_{id}_{block_range}_excl on {nsp}.{name}
+         using gist ({id}, {block_range});
+               "#,
+                name = self.name.quoted(),
+                bare_name = self.name,
+                id = self.primary_key().name,
+                block_range = BLOCK_RANGE_COLUMN
+            )?;
+        }
+        Ok(())
+    }
+}
+
+impl Column {
+    /// Generate the DDL for one column, i.e. the part of a `create table`
+    /// statement for this column.
+    ///
+    /// See the unit tests at the end of this file for the actual DDL that
+    /// gets generated
+    fn as_ddl(&self, out: &mut String) -> fmt::Result {
+        write!(out, "    ")?;
+        write!(out, "{:20} {}", self.name.quoted(), self.sql_type())?;
+        if self.is_list() {
+            write!(out, "[]")?;
+        }
+        if self.is_primary_key() || !self.is_nullable() {
+            write!(out, " not null")?;
+        }
+        Ok(())
+    }
+}
diff --git a/store/postgres/src/relational/ddl_tests.rs b/store/postgres/src/relational/ddl_tests.rs
new file mode 100644
index 0000000..97bf271
--- /dev/null
+++ b/store/postgres/src/relational/ddl_tests.rs
@@ -0,0 +1,613 @@
+use itertools::Itertools;
+
+use super::*;
+
+use crate::layout_for_tests::make_dummy_site;
+
+const ID_TYPE: ColumnType = ColumnType::String;
+
+fn test_layout(gql: &str) -> Layout {
+    let subgraph = DeploymentHash::new("subgraph").unwrap();
+    let schema = Schema::parse(gql, subgraph.clone()).expect("Test schema invalid");
+    let namespace = Namespace::new("sgd0815".to_owned()).unwrap();
+    let site = Arc::new(make_dummy_site(subgraph, namespace, "anet".to_string()));
+    let catalog = Catalog::for_tests(site.clone()).expect("Can not create catalog");
+    Layout::new(site, &schema, catalog).expect("Failed to construct Layout")
+}
+
+#[test]
+fn table_is_sane() {
+    let layout = test_layout(THING_GQL);
+    let table = layout
+        .table(&"thing".into())
+        .expect("failed to get 'thing' table");
+    assert_eq!(SqlName::from("thing"), table.name);
+    assert_eq!("Thing", table.object.as_str());
+
+    let id = table
+        .column(&PRIMARY_KEY_COLUMN.into())
+        .expect("failed to get 'id' column for 'thing' table");
+    assert_eq!(ID_TYPE, id.column_type);
+    assert!(!id.is_nullable());
+    assert!(!id.is_list());
+
+    let big_thing = table
+        .column(&"big_thing".into())
+        .expect("failed to get 'big_thing' column for 'thing' table");
+    assert_eq!(ID_TYPE, big_thing.column_type);
+    assert!(!big_thing.is_nullable());
+    // Field lookup happens by the SQL name, not the GraphQL name
+    let bad_sql_name = SqlName("bigThing".to_owned());
+    assert!(table.column(&bad_sql_name).is_none());
+}
+
+#[test]
+fn generate_ddl() {
+    // Check that the two strings are the same after replacing runs of
+    // whitespace with a single space
+    #[track_caller]
+    fn check_eqv(left: &str, right: &str) {
+        let left_s = left.split_whitespace().join(" ");
+        let right_s = right.split_whitespace().join(" ");
+        if left_s != right_s {
+            // Make sure the original strings show up in the error message
+            assert_eq!(left, right);
+        }
+    }
+
+    let layout = test_layout(THING_GQL);
+    let sql = layout.as_ddl().expect("Failed to generate DDL");
+    check_eqv(THING_DDL, &sql);
+
+    let layout = test_layout(MUSIC_GQL);
+    let sql = layout.as_ddl().expect("Failed to generate DDL");
+    check_eqv(MUSIC_DDL, &sql);
+
+    let layout = test_layout(FOREST_GQL);
+    let sql = layout.as_ddl().expect("Failed to generate DDL");
+    check_eqv(FOREST_DDL, &sql);
+
+    let layout = test_layout(FULLTEXT_GQL);
+    let sql = layout.as_ddl().expect("Failed to generate DDL");
+    check_eqv(FULLTEXT_DDL, &sql);
+
+    let layout = test_layout(FORWARD_ENUM_GQL);
+    let sql = layout.as_ddl().expect("Failed to generate DDL");
+    check_eqv(FORWARD_ENUM_SQL, &sql);
+}
+
+#[test]
+fn exlusion_ddl() {
+    let layout = test_layout(THING_GQL);
+    let table = layout
+        .table_for_entity(&EntityType::new("Thing".to_string()))
+        .unwrap();
+
+    // When `as_constraint` is false, just create an index
+    let mut out = String::new();
+    table
+        .exclusion_ddl(&mut out, "sgd0815", false)
+        .expect("can write exclusion DDL");
+    assert_eq!("create index thing_id_block_range_excl on sgd0815.\"thing\"\n         using gist (id, block_range);", out.trim());
+
+    // When `as_constraint` is true, add an exclusion constraint
+    let mut out = String::new();
+    table
+        .exclusion_ddl(&mut out, "sgd0815", true)
+        .expect("can write exclusion DDL");
+    assert_eq!("alter table sgd0815.\"thing\"\n          add constraint thing_id_block_range_excl exclude using gist (id with =, block_range with &&);", out.trim());
+}
+
+#[test]
+fn forward_enum() {
+    let layout = test_layout(FORWARD_ENUM_GQL);
+    let table = layout
+        .table(&SqlName::from("thing"))
+        .expect("thing table exists");
+    let column = table
+        .column(&SqlName::from("orientation"))
+        .expect("orientation column exists");
+    assert!(column.is_enum());
+}
+
+#[test]
+fn can_copy_from() {
+    let source = test_layout(THING_GQL);
+    // We can always copy from an identical layout
+    assert!(source.can_copy_from(&source).is_empty());
+
+    // We allow leaving out and adding types, and leaving out attributes
+    // of existing types
+    let dest = test_layout("type Scalar { id: ID } type Other { id: ID, int: Int! }");
+    assert!(dest.can_copy_from(&source).is_empty());
+
+    // We allow making a non-nullable attribute nullable
+    let dest = test_layout("type Thing { id: ID! }");
+    assert!(dest.can_copy_from(&source).is_empty());
+
+    // We can not turn a non-nullable attribute into a nullable attribute
+    let dest = test_layout("type Scalar { id: ID! }");
+    assert_eq!(
+        vec![
+            "The attribute Scalar.id is non-nullable, but the \
+                 corresponding attribute in the source is nullable"
+        ],
+        dest.can_copy_from(&source)
+    );
+
+    // We can not change a scalar field to an array
+    let dest = test_layout("type Scalar { id: ID, string: [String] }");
+    assert_eq!(
+        vec![
+            "The attribute Scalar.string has type [String], \
+                 but its type in the source is String"
+        ],
+        dest.can_copy_from(&source)
+    );
+    // We can not change an array field to a scalar
+    assert_eq!(
+        vec![
+            "The attribute Scalar.string has type String, \
+                 but its type in the source is [String]"
+        ],
+        source.can_copy_from(&dest)
+    );
+    // We can not change the underlying type of a field
+    let dest = test_layout("type Scalar { id: ID, color: Int }");
+    assert_eq!(
+        vec![
+            "The attribute Scalar.color has type Int, but \
+                 its type in the source is Color"
+        ],
+        dest.can_copy_from(&source)
+    );
+    // We can not change the underlying type of a field in arrays
+    let source = test_layout("type Scalar { id: ID, color: [Int!]! }");
+    let dest = test_layout("type Scalar { id: ID, color: [String!]! }");
+    assert_eq!(
+        vec![
+            "The attribute Scalar.color has type [String!]!, but \
+                 its type in the source is [Int!]!"
+        ],
+        dest.can_copy_from(&source)
+    );
+}
+
+#[test]
+fn replace_sql() {
+    const REPLACE_BAND: &str = "\
+    alter table \"sgd0815\".\"band_r$\" rename to \"band\";\n\
+    alter table \"sgd0815\".\"band\" rename constraint \"band_r$_pkey\" to \"band_pkey\";\n\
+    alter table \"sgd0815\".\"band\" rename constraint \"band_r$_id_block_range_excl\" to \"band_id_block_range_excl\";";
+
+    const REPLACE_SONG: &str = "\
+    alter table \"sgd0815\".\"song_r$\" rename to \"song\";\n\
+    alter table \"sgd0815\".\"song\" rename constraint \"song_r$_pkey\" to \"song_pkey\";\n\
+    alter table \"sgd0815\".\"song\" rename constraint \"song_r$_id_key\" to \"song_id_key\";";
+
+    fn check(exp: &str, object: &str) {
+        let layout = test_layout(MUSIC_GQL);
+        let src = layout
+            .table_for_entity(&EntityType::new(object.to_string()))
+            .unwrap();
+        let dst = src.new_like(&layout.site.namespace, &SqlName(format!("{}_r$", src.name)));
+
+        let mut out = String::new();
+        Table::rename_sql(&mut out, &layout, &dst, &src, true)
+            .expect("generating rename_sql works");
+        assert_eq!(exp, out.trim());
+        src.create_table(&mut out, &layout).unwrap();
+        dst.create_table(&mut out, &layout).unwrap();
+    }
+
+    check(REPLACE_BAND, "Band");
+    check(REPLACE_SONG, "Song");
+}
+
+const THING_GQL: &str = "
+        type Thing @entity {
+            id: ID!
+            bigThing: Thing!
+        }
+
+        enum Color { yellow, red, BLUE }
+
+        enum Size { small, medium, large }
+
+        type Scalar {
+            id: ID,
+            bool: Boolean,
+            int: Int,
+            bigDecimal: BigDecimal,
+            string: String,
+            bytes: Bytes,
+            bigInt: BigInt,
+            color: Color,
+        }";
+
+const THING_DDL: &str = "create type sgd0815.\"color\"
+    as enum ('BLUE', 'red', 'yellow');
+create type sgd0815.\"size\"
+    as enum (\'large\', \'medium\', \'small\');
+create table sgd0815.\"thing\" (
+        vid                  bigserial primary key,
+        block_range          int4range not null,
+        \"id\"                 text not null,
+        \"big_thing\"          text not null
+);
+alter table sgd0815.\"thing\"
+  add constraint thing_id_block_range_excl exclude using gist (id with =, block_range with &&);
+create index brin_thing
+    on sgd0815.thing
+ using brin(lower(block_range), coalesce(upper(block_range), 2147483647), vid);
+create index thing_block_range_closed
+    on sgd0815.thing(coalesce(upper(block_range), 2147483647))
+ where coalesce(upper(block_range), 2147483647) < 2147483647;
+create index attr_0_0_thing_id
+    on sgd0815.\"thing\" using btree(\"id\");
+create index attr_0_1_thing_big_thing
+    on sgd0815.\"thing\" using gist(\"big_thing\", block_range);
+
+create table sgd0815.\"scalar\" (
+        vid                  bigserial primary key,
+        block_range          int4range not null,
+        \"id\"                 text not null,
+        \"bool\"               boolean,
+        \"int\"                integer,
+        \"big_decimal\"        numeric,
+        \"string\"             text,
+        \"bytes\"              bytea,
+        \"big_int\"            numeric,
+        \"color\"              \"sgd0815\".\"color\"
+);
+alter table sgd0815.\"scalar\"
+  add constraint scalar_id_block_range_excl exclude using gist (id with =, block_range with &&);
+create index brin_scalar
+    on sgd0815.scalar
+ using brin(lower(block_range), coalesce(upper(block_range), 2147483647), vid);
+create index scalar_block_range_closed
+    on sgd0815.scalar(coalesce(upper(block_range), 2147483647))
+ where coalesce(upper(block_range), 2147483647) < 2147483647;
+create index attr_1_0_scalar_id
+    on sgd0815.\"scalar\" using btree(\"id\");
+create index attr_1_1_scalar_bool
+    on sgd0815.\"scalar\" using btree(\"bool\");
+create index attr_1_2_scalar_int
+    on sgd0815.\"scalar\" using btree(\"int\");
+create index attr_1_3_scalar_big_decimal
+    on sgd0815.\"scalar\" using btree(\"big_decimal\");
+create index attr_1_4_scalar_string
+    on sgd0815.\"scalar\" using btree(left(\"string\", 256));
+create index attr_1_5_scalar_bytes
+    on sgd0815.\"scalar\" using btree(substring(\"bytes\", 1, 64));
+create index attr_1_6_scalar_big_int
+    on sgd0815.\"scalar\" using btree(\"big_int\");
+create index attr_1_7_scalar_color
+    on sgd0815.\"scalar\" using btree(\"color\");
+
+";
+
+const MUSIC_GQL: &str = "type Musician @entity {
+    id: ID!
+    name: String!
+    mainBand: Band
+    bands: [Band!]!
+    writtenSongs: [Song]! @derivedFrom(field: \"writtenBy\")
+}
+
+type Band @entity {
+    id: ID!
+    name: String!
+    members: [Musician!]! @derivedFrom(field: \"bands\")
+    originalSongs: [Song!]!
+}
+
+type Song @entity(immutable: true) {
+    id: ID!
+    title: String!
+    writtenBy: Musician!
+    band: Band @derivedFrom(field: \"originalSongs\")
+}
+
+type SongStat @entity {
+    id: ID!
+    song: Song @derivedFrom(field: \"id\")
+    played: Int!
+}";
+const MUSIC_DDL: &str = "create table sgd0815.\"musician\" (
+        vid                  bigserial primary key,
+        block_range          int4range not null,
+        \"id\"                 text not null,
+        \"name\"               text not null,
+        \"main_band\"          text,
+        \"bands\"              text[] not null
+);
+alter table sgd0815.\"musician\"
+  add constraint musician_id_block_range_excl exclude using gist (id with =, block_range with &&);
+create index brin_musician
+    on sgd0815.musician
+ using brin(lower(block_range), coalesce(upper(block_range), 2147483647), vid);
+create index musician_block_range_closed
+    on sgd0815.musician(coalesce(upper(block_range), 2147483647))
+ where coalesce(upper(block_range), 2147483647) < 2147483647;
+create index attr_0_0_musician_id
+    on sgd0815.\"musician\" using btree(\"id\");
+create index attr_0_1_musician_name
+    on sgd0815.\"musician\" using btree(left(\"name\", 256));
+create index attr_0_2_musician_main_band
+    on sgd0815.\"musician\" using gist(\"main_band\", block_range);
+create index attr_0_3_musician_bands
+    on sgd0815.\"musician\" using gin(\"bands\");
+
+create table sgd0815.\"band\" (
+        vid                  bigserial primary key,
+        block_range          int4range not null,
+        \"id\"                 text not null,
+        \"name\"               text not null,
+        \"original_songs\"     text[] not null
+);
+alter table sgd0815.\"band\"
+  add constraint band_id_block_range_excl exclude using gist (id with =, block_range with &&);
+create index brin_band
+    on sgd0815.band
+ using brin(lower(block_range), coalesce(upper(block_range), 2147483647), vid);
+create index band_block_range_closed
+    on sgd0815.band(coalesce(upper(block_range), 2147483647))
+ where coalesce(upper(block_range), 2147483647) < 2147483647;
+create index attr_1_0_band_id
+    on sgd0815.\"band\" using btree(\"id\");
+create index attr_1_1_band_name
+    on sgd0815.\"band\" using btree(left(\"name\", 256));
+create index attr_1_2_band_original_songs
+    on sgd0815.\"band\" using gin(\"original_songs\");
+
+create table sgd0815.\"song\" (
+        vid                    bigserial primary key,
+        block$                 int not null,
+        \"id\"                 text not null,
+        \"title\"              text not null,
+        \"written_by\"         text not null,
+
+        unique(id)
+);
+create index brin_song
+    on sgd0815.song
+ using brin(block$, vid);
+create index attr_2_1_song_title
+    on sgd0815.\"song\" using btree(left(\"title\", 256));
+create index attr_2_2_song_written_by
+    on sgd0815.\"song\" using btree(\"written_by\", block$);
+
+create table sgd0815.\"song_stat\" (
+        vid                  bigserial primary key,
+        block_range          int4range not null,
+        \"id\"                 text not null,
+        \"played\"             integer not null
+);
+alter table sgd0815.\"song_stat\"
+  add constraint song_stat_id_block_range_excl exclude using gist (id with =, block_range with &&);
+create index brin_song_stat
+    on sgd0815.song_stat
+ using brin(lower(block_range), coalesce(upper(block_range), 2147483647), vid);
+create index song_stat_block_range_closed
+    on sgd0815.song_stat(coalesce(upper(block_range), 2147483647))
+ where coalesce(upper(block_range), 2147483647) < 2147483647;
+create index attr_3_0_song_stat_id
+    on sgd0815.\"song_stat\" using btree(\"id\");
+create index attr_3_1_song_stat_played
+    on sgd0815.\"song_stat\" using btree(\"played\");
+
+";
+
+const FOREST_GQL: &str = "
+interface ForestDweller {
+    id: ID!,
+    forest: Forest
+}
+type Animal implements ForestDweller @entity {
+     id: ID!,
+     forest: Forest
+}
+type Forest @entity {
+    id: ID!,
+    # Array of interfaces as derived reference
+    dwellers: [ForestDweller!]! @derivedFrom(field: \"forest\")
+}
+type Habitat @entity {
+    id: ID!,
+    # Use interface as direct reference
+    most_common: ForestDweller!,
+    dwellers: [ForestDweller!]!
+}";
+
+const FOREST_DDL: &str = "create table sgd0815.\"animal\" (
+        vid                  bigserial primary key,
+        block_range          int4range not null,
+        \"id\"                 text not null,
+        \"forest\"             text
+);
+alter table sgd0815.\"animal\"
+  add constraint animal_id_block_range_excl exclude using gist (id with =, block_range with &&);
+create index brin_animal
+    on sgd0815.animal
+ using brin(lower(block_range), coalesce(upper(block_range), 2147483647), vid);
+create index animal_block_range_closed
+    on sgd0815.animal(coalesce(upper(block_range), 2147483647))
+ where coalesce(upper(block_range), 2147483647) < 2147483647;
+create index attr_0_0_animal_id
+    on sgd0815.\"animal\" using btree(\"id\");
+create index attr_0_1_animal_forest
+    on sgd0815.\"animal\" using gist(\"forest\", block_range);
+
+create table sgd0815.\"forest\" (
+        vid                  bigserial primary key,
+        block_range          int4range not null,
+        \"id\"               text not null
+);
+alter table sgd0815.\"forest\"
+  add constraint forest_id_block_range_excl exclude using gist (id with =, block_range with &&);
+create index brin_forest
+    on sgd0815.forest
+ using brin(lower(block_range), coalesce(upper(block_range), 2147483647), vid);
+create index forest_block_range_closed
+    on sgd0815.forest(coalesce(upper(block_range), 2147483647))
+ where coalesce(upper(block_range), 2147483647) < 2147483647;
+create index attr_1_0_forest_id
+    on sgd0815.\"forest\" using btree(\"id\");
+
+create table sgd0815.\"habitat\" (
+        vid                  bigserial primary key,
+        block_range          int4range not null,
+        \"id\"                 text not null,
+        \"most_common\"        text not null,
+        \"dwellers\"           text[] not null
+);
+alter table sgd0815.\"habitat\"
+  add constraint habitat_id_block_range_excl exclude using gist (id with =, block_range with &&);
+create index brin_habitat
+    on sgd0815.habitat
+ using brin(lower(block_range), coalesce(upper(block_range), 2147483647), vid);
+create index habitat_block_range_closed
+    on sgd0815.habitat(coalesce(upper(block_range), 2147483647))
+ where coalesce(upper(block_range), 2147483647) < 2147483647;
+create index attr_2_0_habitat_id
+    on sgd0815.\"habitat\" using btree(\"id\");
+create index attr_2_1_habitat_most_common
+    on sgd0815.\"habitat\" using gist(\"most_common\", block_range);
+create index attr_2_2_habitat_dwellers
+    on sgd0815.\"habitat\" using gin(\"dwellers\");
+
+";
+const FULLTEXT_GQL: &str = "
+type _Schema_ @fulltext(
+    name: \"search\"
+    language: en
+    algorithm: rank
+    include: [\
+        {
+            entity: \"Animal\",
+            fields: [
+                {name: \"name\"},
+                {name: \"species\"}
+            ]
+        }
+    ]
+)
+type Animal @entity  {
+    id: ID!,
+    name: String!
+    species: String!
+    forest: Forest
+}
+type Forest @entity {
+    id: ID!,
+    dwellers: [Animal!]! @derivedFrom(field: \"forest\")
+}
+type Habitat @entity {
+    id: ID!,
+    most_common: Animal!,
+    dwellers: [Animal!]!
+}";
+
+const FULLTEXT_DDL: &str = "create table sgd0815.\"animal\" (
+        vid                  bigserial primary key,
+        block_range          int4range not null,
+        \"id\"                 text not null,
+        \"name\"               text not null,
+        \"species\"            text not null,
+        \"forest\"             text,
+        \"search\"             tsvector
+);
+alter table sgd0815.\"animal\"
+  add constraint animal_id_block_range_excl exclude using gist (id with =, block_range with &&);
+create index brin_animal
+    on sgd0815.animal
+ using brin(lower(block_range), coalesce(upper(block_range), 2147483647), vid);
+create index animal_block_range_closed
+    on sgd0815.animal(coalesce(upper(block_range), 2147483647))
+ where coalesce(upper(block_range), 2147483647) < 2147483647;
+create index attr_0_0_animal_id
+    on sgd0815.\"animal\" using btree(\"id\");
+create index attr_0_1_animal_name
+    on sgd0815.\"animal\" using btree(left(\"name\", 256));
+create index attr_0_2_animal_species
+    on sgd0815.\"animal\" using btree(left(\"species\", 256));
+create index attr_0_3_animal_forest
+    on sgd0815.\"animal\" using gist(\"forest\", block_range);
+create index attr_0_4_animal_search
+    on sgd0815.\"animal\" using gin(\"search\");
+
+create table sgd0815.\"forest\" (
+        vid                  bigserial primary key,
+        block_range          int4range not null,
+        \"id\"                 text not null
+);
+alter table sgd0815.\"forest\"
+  add constraint forest_id_block_range_excl exclude using gist (id with =, block_range with &&);
+
+create index brin_forest
+    on sgd0815.forest
+ using brin(lower(block_range), coalesce(upper(block_range), 2147483647), vid);
+create index forest_block_range_closed
+    on sgd0815.forest(coalesce(upper(block_range), 2147483647))
+ where coalesce(upper(block_range), 2147483647) < 2147483647;
+create index attr_1_0_forest_id
+    on sgd0815.\"forest\" using btree(\"id\");
+
+create table sgd0815.\"habitat\" (
+        vid                  bigserial primary key,
+        block_range          int4range not null,
+        \"id\"                 text not null,
+        \"most_common\"        text not null,
+        \"dwellers\"           text[] not null
+);
+alter table sgd0815.\"habitat\"
+  add constraint habitat_id_block_range_excl exclude using gist (id with =, block_range with &&);
+create index brin_habitat
+    on sgd0815.habitat
+ using brin(lower(block_range), coalesce(upper(block_range), 2147483647), vid);
+create index habitat_block_range_closed
+    on sgd0815.habitat(coalesce(upper(block_range), 2147483647))
+ where coalesce(upper(block_range), 2147483647) < 2147483647;
+create index attr_2_0_habitat_id
+    on sgd0815.\"habitat\" using btree(\"id\");
+create index attr_2_1_habitat_most_common
+    on sgd0815.\"habitat\" using gist(\"most_common\", block_range);
+create index attr_2_2_habitat_dwellers
+    on sgd0815.\"habitat\" using gin(\"dwellers\");
+
+";
+
+const FORWARD_ENUM_GQL: &str = "
+type Thing @entity  {
+    id: ID!,
+    orientation: Orientation!
+}
+
+enum Orientation {
+    UP, DOWN
+}
+";
+
+const FORWARD_ENUM_SQL: &str = "create type sgd0815.\"orientation\"
+    as enum (\'DOWN\', \'UP\');
+create table sgd0815.\"thing\" (
+        vid                  bigserial primary key,
+        block_range          int4range not null,
+        \"id\"                 text not null,
+        \"orientation\"        \"sgd0815\".\"orientation\" not null
+);
+alter table sgd0815.\"thing\"
+  add constraint thing_id_block_range_excl exclude using gist (id with =, block_range with &&);
+create index brin_thing
+    on sgd0815.thing
+ using brin(lower(block_range), coalesce(upper(block_range), 2147483647), vid);
+create index thing_block_range_closed
+    on sgd0815.thing(coalesce(upper(block_range), 2147483647))
+ where coalesce(upper(block_range), 2147483647) < 2147483647;
+create index attr_0_0_thing_id
+    on sgd0815.\"thing\" using btree(\"id\");
+create index attr_0_1_thing_orientation
+    on sgd0815.\"thing\" using btree(\"orientation\");
+
+";
diff --git a/store/postgres/src/relational/prune.rs b/store/postgres/src/relational/prune.rs
new file mode 100644
index 0000000..fcc04b7
--- /dev/null
+++ b/store/postgres/src/relational/prune.rs
@@ -0,0 +1,357 @@
+use std::{fmt::Write, sync::Arc, time::Instant};
+
+use diesel::{
+    connection::SimpleConnection,
+    sql_query,
+    sql_types::{BigInt, Integer, Nullable},
+    Connection, PgConnection, RunQueryDsl,
+};
+use graph::{
+    components::store::PruneReporter,
+    prelude::{BlockNumber, CancelHandle, CancelToken, CancelableError, CheapClone, StoreError},
+    slog::Logger,
+};
+use itertools::Itertools;
+
+use crate::{
+    catalog,
+    copy::AdaptiveBatchSize,
+    deployment,
+    relational::{Table, VID_COLUMN},
+};
+
+use super::{Layout, SqlName};
+
+/// Utility to copy relevant data out of a source table and into a new
+/// destination table and replace the source table with the destination
+/// table
+struct TablePair {
+    src: Arc<Table>,
+    dst: Arc<Table>,
+}
+
+impl TablePair {
+    /// Create a `TablePair` for `src`. This creates a new table `dst` with
+    /// the same structure as the `src` table in the database, but without
+    /// various indexes. Those are created with `switch`
+    fn create(conn: &PgConnection, layout: &Layout, src: Arc<Table>) -> Result<Self, StoreError> {
+        let new_name = SqlName::verbatim(format!("{}_n$", src.name));
+        let nsp = &layout.site.namespace;
+
+        let dst = src.new_like(&layout.site.namespace, &new_name);
+
+        let mut query = String::new();
+        if catalog::table_exists(conn, &layout.site.namespace, &dst.name)? {
+            writeln!(query, "truncate table {nsp}.{new_name};")?;
+        } else {
+            dst.create_table(&mut query, layout)?;
+
+            // Have the new table use the same vid sequence as the source
+            // table
+            writeln!(
+                query,
+                "\
+      alter table {nsp}.{new_name} \
+        alter column {VID_COLUMN} \
+          set default nextval('{nsp}.{src_name}_vid_seq'::regclass);",
+                src_name = src.name
+            )?;
+            writeln!(query, "drop sequence {nsp}.{new_name}_vid_seq;")?;
+            writeln!(
+                query,
+                "alter sequence {nsp}.{src_name}_vid_seq owned by {nsp}.{new_name}.vid",
+                src_name = src.name
+            )?;
+        }
+        conn.batch_execute(&query)?;
+
+        Ok(TablePair { src, dst })
+    }
+
+    fn copy_final_entities(
+        &self,
+        conn: &PgConnection,
+        reporter: &mut dyn PruneReporter,
+        earliest_block: BlockNumber,
+        final_block: BlockNumber,
+        cancel: &CancelHandle,
+    ) -> Result<usize, CancelableError<StoreError>> {
+        #[derive(QueryableByName)]
+        struct VidRange {
+            #[sql_type = "Nullable<BigInt>"]
+            min_vid: Option<i64>,
+            #[sql_type = "Nullable<BigInt>"]
+            max_vid: Option<i64>,
+        }
+
+        #[derive(QueryableByName)]
+        struct LastVid {
+            #[sql_type = "BigInt"]
+            rows: i64,
+            #[sql_type = "BigInt"]
+            last_vid: i64,
+        }
+
+        let (min_vid, max_vid) = match sql_query(&format!(
+            "select min(vid) as min_vid, max(vid) as max_vid from {src} \
+              where coalesce(upper(block_range), 2147483647) > $1 \
+                and coalesce(upper(block_range), 2147483647) <= $2",
+            src = self.src.qualified_name
+        ))
+        .bind::<Integer, _>(earliest_block)
+        .bind::<Integer, _>(final_block)
+        .get_result::<VidRange>(conn)?
+        {
+            VidRange {
+                min_vid: None,
+                max_vid: None,
+            } => {
+                return Ok(0);
+            }
+            VidRange {
+                min_vid: Some(min),
+                max_vid: Some(max),
+            } => (min, max),
+            _ => unreachable!("min and max are Some or None at the same time"),
+        };
+        cancel.check_cancel()?;
+
+        let column_list = self.column_list();
+
+        let mut batch_size = AdaptiveBatchSize::new(&self.src);
+        let mut next_vid = min_vid;
+        let mut total_rows: usize = 0;
+        loop {
+            let start = Instant::now();
+            let LastVid { last_vid, rows } = conn.transaction(|| {
+                sql_query(&format!(
+                    "with cp as (insert into {dst}({column_list}) \
+                         select {column_list} from {src} \
+                          where lower(block_range) <= $2 \
+                            and coalesce(upper(block_range), 2147483647) > $1 \
+                            and coalesce(upper(block_range), 2147483647) <= $2 \
+                            and vid >= $3 \
+                            and vid <= $4 \
+                          order by vid \
+                          limit $5 \
+                          returning vid) \
+                         select max(cp.vid) as last_vid, count(*) as rows from cp",
+                    src = self.src.qualified_name,
+                    dst = self.dst.qualified_name
+                ))
+                .bind::<Integer, _>(earliest_block)
+                .bind::<Integer, _>(final_block)
+                .bind::<BigInt, _>(next_vid)
+                .bind::<BigInt, _>(max_vid)
+                .bind::<BigInt, _>(&batch_size)
+                .get_result::<LastVid>(conn)
+            })?;
+            cancel.check_cancel()?;
+
+            total_rows += rows as usize;
+            reporter.copy_final_batch(
+                self.src.name.as_str(),
+                rows as usize,
+                total_rows,
+                last_vid >= max_vid,
+            );
+
+            if last_vid >= max_vid {
+                break;
+            }
+
+            batch_size.adapt(start.elapsed());
+            next_vid = last_vid + 1;
+        }
+
+        Ok(total_rows)
+    }
+
+    fn copy_nonfinal_entities(
+        &self,
+        conn: &PgConnection,
+        final_block: BlockNumber,
+    ) -> Result<usize, StoreError> {
+        let column_list = self.column_list();
+
+        sql_query(&format!(
+            "insert into {dst}({column_list}) \
+             select {column_list} from {src} \
+              where coalesce(upper(block_range), 2147483647) > $1 \
+                and block_range && int4range($1, null) \
+              order by vid",
+            dst = self.dst.qualified_name,
+            src = self.src.qualified_name,
+        ))
+        .bind::<Integer, _>(final_block)
+        .execute(conn)
+        .map_err(StoreError::from)
+    }
+
+    /// Replace the `src` table with the `dst` table. This makes sure (as
+    /// does the rest of the code in `TablePair`) that the table and all
+    /// associated objects (indexes, constraints, etc.) have the same names
+    /// as they had initially so that pruning can be performed again in the
+    /// future without any name clashes in the database.
+    fn switch(self, conn: &PgConnection, layout: &Layout) -> Result<(), StoreError> {
+        sql_query(&format!("drop table {}", self.src.qualified_name)).execute(conn)?;
+
+        let uses_excl =
+            catalog::has_exclusion_constraint(conn, &layout.site.namespace, &self.dst.name)?;
+        let mut query = String::new();
+        Table::rename_sql(&mut query, &layout, &self.dst, &self.src, uses_excl)?;
+        self.src.create_time_travel_indexes(&mut query, layout)?;
+        self.src.create_attribute_indexes(&mut query, layout)?;
+
+        conn.batch_execute(&query)?;
+
+        Ok(())
+    }
+
+    fn column_list(&self) -> String {
+        self.src
+            .column_names()
+            .map(|name| format!("\"{name}\""))
+            .join(", ")
+    }
+}
+
+impl Layout {
+    /// Remove all data from the underlying deployment that is not needed to
+    /// respond to queries before block `earliest_block`. The strategy
+    /// implemented here works well for situations in which pruning will
+    /// remove a large amount of data from the subgraph (at least 50%)
+    ///
+    /// Blocks before `final_block` are considered final and it is assumed
+    /// that they will not be modified in any way while pruning is running.
+    /// Only tables where the ratio of entities to entity versions is below
+    /// `prune_ratio` will actually be pruned.
+    ///
+    /// The strategy for `prune_by_copying` is to copy all data that is
+    /// needed to respond to queries at block heights at or after
+    /// `earliest_block` to a new table and then to replace the existing
+    /// tables with these new tables atomically in a transaction. Copying
+    /// happens in two stages: we first copy data for final blocks without
+    /// blocking writes, and then copy data for nonfinal blocks. The latter
+    /// blocks writes by taking a lock on the row for the deployment in
+    /// `subgraph_deployment` (via `deployment::lock`) The process for
+    /// switching to the new tables needs to take the naming of various
+    /// database objects that Postgres creates automatically into account so
+    /// that they all have the same names as the original objects to ensure
+    /// that pruning can be done again without risking name clashes.
+    ///
+    /// The reason this strategy works well when a lot (or even the
+    /// majority) of the data needs to be removed is that in the more
+    /// straightforward strategy of simply deleting unneeded data, accessing
+    /// the remaining data becomes very inefficient since it is scattered
+    /// over a large number of pages, often with just one row per page. We
+    /// would therefore need to do a full vacuum of the tables after
+    /// deleting which effectively copies the remaining data into new
+    /// tables. But a full vacuum takes an `access exclusive` lock which
+    /// prevents both reads and writes to the table, which means it would
+    /// also block queries to the deployment, often for extended periods of
+    /// time. The `prune_by_copying` strategy never blocks reads, it only
+    /// ever blocks writes.
+    pub fn prune_by_copying(
+        &self,
+        _logger: &Logger,
+        reporter: &mut dyn PruneReporter,
+        conn: &PgConnection,
+        earliest_block: BlockNumber,
+        final_block: BlockNumber,
+        prune_ratio: f64,
+        cancel: &CancelHandle,
+    ) -> Result<(), CancelableError<StoreError>> {
+        // Analyze all tables and get statistics for them
+        let mut tables: Vec<_> = self.tables.values().collect();
+        reporter.start_analyze();
+        tables.sort_by_key(|table| table.name.as_str());
+        for table in tables {
+            reporter.start_analyze_table(table.name.as_str());
+            table.analyze(conn)?;
+            reporter.finish_analyze_table(table.name.as_str());
+            cancel.check_cancel()?;
+        }
+        let stats = catalog::stats(conn, &self.site.namespace)?;
+        reporter.finish_analyze(stats.as_slice());
+
+        // Determine which tables are prunable and create a shadow table for
+        // them via `TablePair::create`
+        let prunable_tables = {
+            let mut prunable_tables: Vec<TablePair> = self
+                .tables
+                .values()
+                .filter_map(|table| {
+                    stats
+                        .iter()
+                        .find(|s| s.tablename == table.name.as_str())
+                        .map(|s| (table, s))
+                })
+                .filter(|(_, stats)| stats.ratio <= prune_ratio)
+                .map(|(table, _)| TablePair::create(conn, self, table.cheap_clone()))
+                .collect::<Result<_, _>>()?;
+            prunable_tables.sort_by(|a, b| a.src.name.as_str().cmp(b.src.name.as_str()));
+            prunable_tables
+        };
+        cancel.check_cancel()?;
+
+        // Copy final entities. This can happen in parallel to indexing as
+        // that part of the table will not change
+        reporter.copy_final_start(earliest_block, final_block);
+        for table in &prunable_tables {
+            table.copy_final_entities(conn, reporter, earliest_block, final_block, cancel)?;
+        }
+        reporter.copy_final_finish();
+
+        let prunable_src: Vec<_> = prunable_tables
+            .iter()
+            .map(|table| table.src.clone())
+            .collect();
+
+        // Copy nonfinal entities, and replace the original `src` table with
+        // the smaller `dst` table
+        reporter.start_switch();
+        conn.transaction(|| -> Result<(), CancelableError<StoreError>> {
+            //  see also: deployment-lock-for-update
+            deployment::lock(conn, &self.site)?;
+
+            for table in &prunable_tables {
+                reporter.copy_nonfinal_start(table.src.name.as_str());
+                let rows = table.copy_nonfinal_entities(conn, final_block)?;
+                reporter.copy_nonfinal_finish(table.src.name.as_str(), rows);
+                cancel.check_cancel()?;
+            }
+
+            for table in prunable_tables {
+                table.switch(conn, self)?;
+                cancel.check_cancel()?;
+            }
+
+            Ok(())
+        })?;
+        reporter.finish_switch();
+
+        // Analyze the new tables
+        reporter.start_analyze();
+        for table in &prunable_src {
+            reporter.start_analyze_table(table.name.as_str());
+            table.analyze(conn)?;
+            reporter.finish_analyze_table(table.name.as_str());
+            cancel.check_cancel()?;
+        }
+        let stats: Vec<_> = catalog::stats(conn, &self.site.namespace)?
+            .into_iter()
+            .filter(|s| {
+                prunable_src
+                    .iter()
+                    .find(|table| table.name.as_str() == s.tablename)
+                    .is_some()
+            })
+            .collect();
+        reporter.finish_analyze(stats.as_slice());
+
+        reporter.finish_prune();
+
+        Ok(())
+    }
+}
diff --git a/store/postgres/src/relational/query_tests.rs b/store/postgres/src/relational/query_tests.rs
new file mode 100644
index 0000000..7e89a73
--- /dev/null
+++ b/store/postgres/src/relational/query_tests.rs
@@ -0,0 +1,86 @@
+use std::sync::Arc;
+
+use diesel::{debug_query, pg::Pg};
+use graph::{
+    components::store::EntityType,
+    prelude::{r, serde_json as json, DeploymentHash, EntityFilter, Schema},
+};
+
+use crate::{
+    layout_for_tests::{make_dummy_site, Namespace},
+    relational::{Catalog, ColumnType, Layout},
+    relational_queries::FromColumnValue,
+};
+
+use crate::relational_queries::QueryFilter;
+
+#[test]
+fn gql_value_from_bytes() {
+    const EXP: &str = "0xdeadbeef";
+
+    let exp = r::Value::String(EXP.to_string());
+    for s in ["deadbeef", "\\xdeadbeef", "0xdeadbeef"] {
+        let act =
+            r::Value::from_column_value(&ColumnType::Bytes, json::Value::String(s.to_string()))
+                .unwrap();
+
+        assert_eq!(exp, act);
+    }
+}
+
+fn test_layout(gql: &str) -> Layout {
+    let subgraph = DeploymentHash::new("subgraph").unwrap();
+    let schema = Schema::parse(gql, subgraph.clone()).expect("Test schema invalid");
+    let namespace = Namespace::new("sgd0815".to_owned()).unwrap();
+    let site = Arc::new(make_dummy_site(subgraph, namespace, "anet".to_string()));
+    let catalog = Catalog::for_tests(site.clone()).expect("Can not create catalog");
+    Layout::new(site, &schema, catalog).expect("Failed to construct Layout")
+}
+
+#[track_caller]
+fn filter_contains(filter: EntityFilter, sql: &str) {
+    const SCHEMA: &str = "
+    type Thing @entity { 
+        id: Bytes!,
+        address: Bytes!,
+        name: String
+    }";
+    let layout = test_layout(SCHEMA);
+    let table = layout
+        .table_for_entity(&EntityType::new("Thing".to_string()))
+        .unwrap();
+    let filter = QueryFilter::new(&filter, table.as_ref(), &layout, Default::default()).unwrap();
+    let query = debug_query::<Pg, _>(&filter);
+    assert!(
+        query.to_string().contains(sql),
+        "Expected query /{}/ to contain /{}/",
+        query.to_string(),
+        sql
+    );
+}
+
+#[test]
+fn prefix() {
+    // String prefixes
+    let filter = EntityFilter::Equal("name".to_string(), "Bibi".into());
+    filter_contains(
+        filter,
+        r#"left("name", 256) = left($1, 256) -- binds: ["Bibi"]"#,
+    );
+
+    let filter = EntityFilter::In("name".to_string(), vec!["Bibi".into(), "Julian".into()]);
+    filter_contains(
+        filter,
+        r#"left("name", 256) in ($1, $2) -- binds: ["Bibi", "Julian"]"#,
+    );
+
+    // Bytes prefixes
+    let filter = EntityFilter::Equal("address".to_string(), "0xbeef".into());
+    filter_contains(
+        filter,
+        r#"substring("address", 1, 64) = substring($1, 1, 64)"#,
+    );
+
+    let filter = EntityFilter::In("address".to_string(), vec!["0xbeef".into()]);
+    filter_contains(filter, r#"substring("address", 1, 64) in ($1)"#);
+}
diff --git a/store/postgres/src/relational_queries.rs b/store/postgres/src/relational_queries.rs
new file mode 100644
index 0000000..c3b435e
--- /dev/null
+++ b/store/postgres/src/relational_queries.rs
@@ -0,0 +1,3619 @@
+///! This module contains the gory details of using Diesel to query
+///! a database schema that is not known at compile time. The code in this
+///! module is mostly concerned with constructing SQL queries and some
+///! helpers for serializing and deserializing entities.
+///!
+///! Code in this module works very hard to minimize the number of allocations
+///! that it performs
+use diesel::pg::{Pg, PgConnection};
+use diesel::query_builder::{AstPass, QueryFragment, QueryId};
+use diesel::query_dsl::{LoadQuery, RunQueryDsl};
+use diesel::result::{Error as DieselError, QueryResult};
+use diesel::sql_types::{Array, BigInt, Binary, Bool, Integer, Jsonb, Text};
+use diesel::Connection;
+
+use graph::components::store::EntityKey;
+use graph::data::value::Word;
+use graph::prelude::{
+    anyhow, r, serde_json, Attribute, BlockNumber, ChildMultiplicity, Entity, EntityCollection,
+    EntityFilter, EntityLink, EntityOrder, EntityRange, EntityWindow, ParentLink,
+    QueryExecutionError, StoreError, Value, ENV_VARS,
+};
+use graph::{
+    components::store::{AttributeNames, EntityType},
+    data::{schema::FulltextAlgorithm, store::scalar},
+};
+use itertools::Itertools;
+use std::borrow::Cow;
+use std::collections::{BTreeMap, BTreeSet, HashMap, HashSet};
+use std::convert::TryFrom;
+use std::fmt::{self, Display};
+use std::iter::FromIterator;
+use std::str::FromStr;
+
+use crate::relational::{
+    Column, ColumnType, IdType, Layout, SqlName, Table, BYTE_ARRAY_PREFIX_SIZE, PRIMARY_KEY_COLUMN,
+    STRING_PREFIX_SIZE,
+};
+use crate::sql_value::SqlValue;
+use crate::{
+    block_range::{
+        BlockRangeColumn, BlockRangeLowerBoundClause, BlockRangeUpperBoundClause, BLOCK_COLUMN,
+        BLOCK_RANGE_COLUMN, BLOCK_RANGE_CURRENT,
+    },
+    primary::Namespace,
+};
+
+/// Those are columns that we always want to fetch from the database.
+const BASE_SQL_COLUMNS: [&'static str; 2] = ["id", "vid"];
+
+#[derive(Debug)]
+pub(crate) struct UnsupportedFilter {
+    pub filter: String,
+    pub value: Value,
+}
+
+impl Display for UnsupportedFilter {
+    fn fmt(&self, f: &mut fmt::Formatter) -> Result<(), fmt::Error> {
+        write!(
+            f,
+            "unsupported filter `{}` for value `{}`",
+            self.filter, self.value
+        )
+    }
+}
+
+impl std::error::Error for UnsupportedFilter {}
+
+impl From<UnsupportedFilter> for diesel::result::Error {
+    fn from(error: UnsupportedFilter) -> Self {
+        diesel::result::Error::QueryBuilderError(Box::new(error))
+    }
+}
+
+// Similar to graph::prelude::constraint_violation, but returns a Diesel
+// error for use in the guts of query generation
+macro_rules! constraint_violation {
+    ($msg:expr) => {{
+        diesel::result::Error::QueryBuilderError(anyhow!("{}", $msg).into())
+    }};
+    ($fmt:expr, $($arg:tt)*) => {{
+        diesel::result::Error::QueryBuilderError(anyhow!($fmt, $($arg)*).into())
+    }}
+}
+
+fn str_as_bytes(id: &str) -> QueryResult<scalar::Bytes> {
+    scalar::Bytes::from_str(id).map_err(|e| DieselError::SerializationError(Box::new(e)))
+}
+
+/// Convert Postgres string representation of bytes "\xdeadbeef"
+/// to ours of just "deadbeef".
+fn bytes_as_str(id: &str) -> String {
+    id.trim_start_matches("\\x").to_owned()
+}
+
+impl IdType {
+    /// Add `ids` as a bind variable to `out`, using the right SQL type
+    fn bind_ids<S>(&self, ids: &[S], out: &mut AstPass<Pg>) -> QueryResult<()>
+    where
+        S: AsRef<str> + diesel::serialize::ToSql<Text, Pg>,
+    {
+        match self {
+            IdType::String => out.push_bind_param::<Array<Text>, _>(&ids)?,
+            IdType::Bytes => {
+                let ids = ids
+                    .iter()
+                    .map(|id| str_as_bytes(id.as_ref()))
+                    .collect::<Result<Vec<scalar::Bytes>, _>>()?;
+                let id_slices = ids.iter().map(|id| id.as_slice()).collect::<Vec<_>>();
+                out.push_bind_param::<Array<Binary>, _>(&id_slices)?;
+            }
+        }
+        // Generate '::text[]' or '::bytea[]'
+        out.push_sql("::");
+        out.push_sql(self.sql_type());
+        out.push_sql("[]");
+        Ok(())
+    }
+}
+
+/// Conveniences for handling foreign keys depending on whether we are using
+/// `IdType::Bytes` or `IdType::String` as the primary key
+///
+/// This trait adds some capabilities to `Column` that are very specific to
+/// how we generate SQL queries. Using a method like `bind_ids` from this
+/// trait on a given column means "send these values to the database in a form
+/// that can later be used for comparisons with that column"
+trait ForeignKeyClauses {
+    /// The type of the column
+    fn column_type(&self) -> &ColumnType;
+
+    /// The name of the column
+    fn name(&self) -> &str;
+
+    /// Add `id` as a bind variable to `out`, using the right SQL type
+    fn bind_id(&self, id: &str, out: &mut AstPass<Pg>) -> QueryResult<()> {
+        match self.column_type().id_type() {
+            IdType::String => out.push_bind_param::<Text, _>(&id)?,
+            IdType::Bytes => out.push_bind_param::<Binary, _>(&str_as_bytes(id)?.as_slice())?,
+        }
+        // Generate '::text' or '::bytea'
+        out.push_sql("::");
+        out.push_sql(self.column_type().sql_type());
+        Ok(())
+    }
+
+    /// Add `ids`  as a bind variable to `out`, using the right SQL type
+    fn bind_ids<S>(&self, ids: &[S], out: &mut AstPass<Pg>) -> QueryResult<()>
+    where
+        S: AsRef<str> + diesel::serialize::ToSql<Text, Pg>,
+    {
+        self.column_type().id_type().bind_ids(ids, out)
+    }
+
+    /// Generate a clause `{name()} = $id` using the right types to bind `$id`
+    /// into `out`
+    fn eq(&self, id: &str, out: &mut AstPass<Pg>) -> QueryResult<()> {
+        out.push_sql(self.name());
+        out.push_sql(" = ");
+        self.bind_id(id, out)
+    }
+
+    /// Generate a clause
+    ///    `exists (select 1 from unnest($ids) as p(g$id) where id = p.g$id)`
+    /// using the right types to bind `$ids` into `out`
+    fn is_in<S>(&self, ids: &[S], out: &mut AstPass<Pg>) -> QueryResult<()>
+    where
+        S: AsRef<str> + diesel::serialize::ToSql<Text, Pg>,
+    {
+        out.push_sql("exists (select 1 from unnest(");
+        self.bind_ids(ids, out)?;
+        out.push_sql(") as p(g$id) where id = p.g$id)");
+        Ok(())
+    }
+
+    /// Generate an array of arrays as literal SQL. The `ids` must form a
+    /// valid matrix, i.e. the same numbe of entries in each row. This can
+    /// be achieved by padding them with `None` values. Diesel does not support
+    /// arrays of arrays as bind variables, nor arrays containing nulls, so
+    /// we have to manually serialize the `ids` as literal SQL.
+    fn push_matrix(
+        &self,
+        matrix: &[Vec<Option<SafeString>>],
+        out: &mut AstPass<Pg>,
+    ) -> QueryResult<()> {
+        out.push_sql("array[");
+        if matrix.is_empty() {
+            // If there are no ids, make sure we are producing an
+            // empty array of arrays
+            out.push_sql("array[null]");
+        } else {
+            for (i, ids) in matrix.iter().enumerate() {
+                if i > 0 {
+                    out.push_sql(", ");
+                }
+                out.push_sql("array[");
+                for (j, id) in ids.iter().enumerate() {
+                    if j > 0 {
+                        out.push_sql(", ");
+                    }
+                    match id {
+                        None => out.push_sql("null"),
+                        Some(id) => match self.column_type().id_type() {
+                            IdType::String => {
+                                out.push_sql("'");
+                                out.push_sql(&id.0);
+                                out.push_sql("'");
+                            }
+                            IdType::Bytes => {
+                                out.push_sql("'\\x");
+                                out.push_sql(id.0.trim_start_matches("0x"));
+                                out.push_sql("'");
+                            }
+                        },
+                    }
+                }
+                out.push_sql("]");
+            }
+        }
+        // Generate '::text[][]' or '::bytea[][]'
+        out.push_sql("]::");
+        out.push_sql(self.column_type().sql_type());
+        out.push_sql("[][]");
+        Ok(())
+    }
+}
+
+impl ForeignKeyClauses for Column {
+    fn column_type(&self) -> &ColumnType {
+        &self.column_type
+    }
+
+    fn name(&self) -> &str {
+        self.name.as_str()
+    }
+}
+
+pub trait FromEntityData: std::fmt::Debug + std::default::Default {
+    type Value: FromColumnValue;
+
+    fn new_entity(typename: String) -> Self;
+
+    fn insert_entity_data(&mut self, key: String, v: Self::Value);
+}
+
+impl FromEntityData for Entity {
+    type Value = graph::prelude::Value;
+
+    fn new_entity(typename: String) -> Self {
+        let mut entity = Entity::new();
+        entity.insert("__typename".to_string(), Self::Value::String(typename));
+        entity
+    }
+
+    fn insert_entity_data(&mut self, key: String, v: Self::Value) {
+        self.insert(key, v);
+    }
+}
+
+impl FromEntityData for BTreeMap<Word, r::Value> {
+    type Value = r::Value;
+
+    fn new_entity(typename: String) -> Self {
+        let mut map = BTreeMap::new();
+        map.insert("__typename".into(), Self::Value::from_string(typename));
+        map
+    }
+
+    fn insert_entity_data(&mut self, key: String, v: Self::Value) {
+        self.insert(Word::from(key), v);
+    }
+}
+
+pub trait FromColumnValue: Sized + std::fmt::Debug {
+    fn is_null(&self) -> bool;
+
+    fn null() -> Self;
+
+    fn from_string(s: String) -> Self;
+
+    fn from_bool(b: bool) -> Self;
+
+    fn from_i32(i: i32) -> Self;
+
+    fn from_big_decimal(d: scalar::BigDecimal) -> Self;
+
+    fn from_big_int(i: serde_json::Number) -> Result<Self, StoreError>;
+
+    // The string returned by the DB, without the leading '\x'
+    fn from_bytes(i: &str) -> Result<Self, StoreError>;
+
+    fn from_vec(v: Vec<Self>) -> Self;
+
+    fn from_column_value(
+        column_type: &ColumnType,
+        json: serde_json::Value,
+    ) -> Result<Self, StoreError> {
+        use serde_json::Value as j;
+        // Many possible conversion errors are already caught by how
+        // we define the schema; for example, we can only get a NULL for
+        // a column that is actually nullable
+        match (json, column_type) {
+            (j::Null, _) => Ok(Self::null()),
+            (j::Bool(b), _) => Ok(Self::from_bool(b)),
+            (j::Number(number), ColumnType::Int) => match number.as_i64() {
+                Some(i) => i32::try_from(i).map(Self::from_i32).map_err(|e| {
+                    StoreError::Unknown(anyhow!("failed to convert {} to Int: {}", number, e))
+                }),
+                None => Err(StoreError::Unknown(anyhow!(
+                    "failed to convert {} to Int",
+                    number
+                ))),
+            },
+            (j::Number(number), ColumnType::BigDecimal) => {
+                let s = number.to_string();
+                scalar::BigDecimal::from_str(s.as_str())
+                    .map(Self::from_big_decimal)
+                    .map_err(|e| {
+                        StoreError::Unknown(anyhow!(
+                            "failed to convert {} to BigDecimal: {}",
+                            number,
+                            e
+                        ))
+                    })
+            }
+            (j::Number(number), ColumnType::BigInt) => Self::from_big_int(number),
+            (j::Number(number), column_type) => Err(StoreError::Unknown(anyhow!(
+                "can not convert number {} to {:?}",
+                number,
+                column_type
+            ))),
+            (j::String(s), ColumnType::String) | (j::String(s), ColumnType::Enum(_)) => {
+                Ok(Self::from_string(s))
+            }
+            (j::String(s), ColumnType::Bytes) => Self::from_bytes(s.trim_start_matches("\\x")),
+            (j::String(s), column_type) => Err(StoreError::Unknown(anyhow!(
+                "can not convert string {} to {:?}",
+                s,
+                column_type
+            ))),
+            (j::Array(values), _) => Ok(Self::from_vec(
+                values
+                    .into_iter()
+                    .map(|v| Self::from_column_value(column_type, v))
+                    .collect::<Result<Vec<_>, _>>()?,
+            )),
+            (j::Object(_), _) => {
+                unimplemented!("objects as entity attributes are not needed/supported")
+            }
+        }
+    }
+}
+
+impl FromColumnValue for r::Value {
+    fn is_null(&self) -> bool {
+        matches!(self, r::Value::Null)
+    }
+
+    fn null() -> Self {
+        Self::Null
+    }
+
+    fn from_string(s: String) -> Self {
+        r::Value::String(s)
+    }
+
+    fn from_bool(b: bool) -> Self {
+        r::Value::Boolean(b)
+    }
+
+    fn from_i32(i: i32) -> Self {
+        r::Value::Int(i.into())
+    }
+
+    fn from_big_decimal(d: scalar::BigDecimal) -> Self {
+        r::Value::String(d.to_string())
+    }
+
+    fn from_big_int(i: serde_json::Number) -> Result<Self, StoreError> {
+        Ok(r::Value::String(i.to_string()))
+    }
+
+    fn from_bytes(b: &str) -> Result<Self, StoreError> {
+        // In some cases, we pass strings as parent_id's through the
+        // database; those are already prefixed with '0x' and we need to
+        // avoid double-prefixing
+        if b.starts_with("0x") {
+            Ok(r::Value::String(b.to_string()))
+        } else {
+            Ok(r::Value::String(format!("0x{}", b)))
+        }
+    }
+
+    fn from_vec(v: Vec<Self>) -> Self {
+        r::Value::List(v)
+    }
+}
+
+impl FromColumnValue for graph::prelude::Value {
+    fn is_null(&self) -> bool {
+        self == &Value::Null
+    }
+
+    fn null() -> Self {
+        Self::Null
+    }
+
+    fn from_string(s: String) -> Self {
+        graph::prelude::Value::String(s)
+    }
+
+    fn from_bool(b: bool) -> Self {
+        graph::prelude::Value::Bool(b)
+    }
+
+    fn from_i32(i: i32) -> Self {
+        graph::prelude::Value::Int(i)
+    }
+
+    fn from_big_decimal(d: scalar::BigDecimal) -> Self {
+        graph::prelude::Value::BigDecimal(d)
+    }
+
+    fn from_big_int(i: serde_json::Number) -> Result<Self, StoreError> {
+        scalar::BigInt::from_str(&i.to_string())
+            .map(graph::prelude::Value::BigInt)
+            .map_err(|e| StoreError::Unknown(anyhow!("failed to convert {} to BigInt: {}", i, e)))
+    }
+
+    fn from_bytes(b: &str) -> Result<Self, StoreError> {
+        scalar::Bytes::from_str(b)
+            .map(graph::prelude::Value::Bytes)
+            .map_err(|e| StoreError::Unknown(anyhow!("failed to convert {} to Bytes: {}", b, e)))
+    }
+
+    fn from_vec(v: Vec<Self>) -> Self {
+        graph::prelude::Value::List(v)
+    }
+}
+
+/// A [`diesel`] utility `struct` for fetching only [`EntityType`] and entity's
+/// ID. Unlike [`EntityData`], we don't really care about attributes here.
+#[derive(QueryableByName)]
+pub struct EntityDeletion {
+    #[sql_type = "Text"]
+    entity: String,
+    #[sql_type = "Text"]
+    id: String,
+}
+
+impl EntityDeletion {
+    pub fn entity_type(&self) -> EntityType {
+        EntityType::new(self.entity.clone())
+    }
+
+    pub fn id(&self) -> &str {
+        &self.id
+    }
+}
+
+/// Helper struct for retrieving entities from the database. With diesel, we
+/// can only run queries that return columns whose number and type are known
+/// at compile time. Because of that, we retrieve the actual data for an
+/// entity as Jsonb by converting the row containing the entity using the
+/// `to_jsonb` function.
+#[derive(QueryableByName, Debug)]
+pub struct EntityData {
+    #[sql_type = "Text"]
+    entity: String,
+    #[sql_type = "Jsonb"]
+    data: serde_json::Value,
+}
+
+impl EntityData {
+    pub fn entity_type(&self) -> EntityType {
+        EntityType::new(self.entity.clone())
+    }
+
+    /// Map the `EntityData` using the schema information in `Layout`
+    pub fn deserialize_with_layout<T: FromEntityData>(
+        self,
+        layout: &Layout,
+        parent_type: Option<&ColumnType>,
+        remove_typename: bool,
+    ) -> Result<T, StoreError> {
+        let entity_type = EntityType::new(self.entity);
+        let table = layout.table_for_entity(&entity_type)?;
+
+        use serde_json::Value as j;
+        match self.data {
+            j::Object(map) => {
+                let mut out = if !remove_typename {
+                    T::new_entity(entity_type.into_string())
+                } else {
+                    T::default()
+                };
+                for (key, json) in map {
+                    // Simply ignore keys that do not have an underlying table
+                    // column; those will be things like the block_range that
+                    // is used internally for versioning
+                    if key == "g$parent_id" {
+                        match &parent_type {
+                            None => {
+                                if ENV_VARS.store.disable_error_for_toplevel_parents {
+                                    // Only temporarily in case reporting an
+                                    // error causes unexpected trouble. Can
+                                    // be removed once it's been working for
+                                    // a few days
+                                    let value =
+                                        T::Value::from_column_value(&ColumnType::String, json)?;
+                                    out.insert_entity_data("g$parent_id".to_owned(), value);
+                                } else {
+                                    // A query that does not have parents
+                                    // somehow returned parent ids. We have no
+                                    // idea how to deserialize that
+                                    return Err(graph::constraint_violation!(
+                                        "query unexpectedly produces parent ids"
+                                    ));
+                                }
+                            }
+                            Some(parent_type) => {
+                                let value = T::Value::from_column_value(parent_type, json)?;
+                                out.insert_entity_data("g$parent_id".to_owned(), value);
+                            }
+                        }
+                    } else if let Some(column) = table.column(&SqlName::verbatim(key)) {
+                        let value = T::Value::from_column_value(&column.column_type, json)?;
+                        if !value.is_null() {
+                            out.insert_entity_data(column.field.clone(), value);
+                        }
+                    }
+                }
+                Ok(out)
+            }
+            _ => unreachable!(
+                "we use `to_json` in our queries, and will therefore always get an object back"
+            ),
+        }
+    }
+}
+
+/// A `QueryValue` makes it possible to bind a `Value` into a SQL query
+/// using the metadata from Column
+struct QueryValue<'a>(&'a Value, &'a ColumnType);
+
+impl<'a> QueryFragment<Pg> for QueryValue<'a> {
+    fn walk_ast(&self, mut out: AstPass<Pg>) -> QueryResult<()> {
+        out.unsafe_to_cache_prepared();
+        let column_type = self.1;
+
+        match self.0 {
+            Value::String(s) => match &column_type {
+                ColumnType::String => out.push_bind_param::<Text, _>(s),
+                ColumnType::Enum(enum_type) => {
+                    out.push_bind_param::<Text, _>(s)?;
+                    out.push_sql("::");
+                    out.push_sql(enum_type.name.as_str());
+                    Ok(())
+                }
+                ColumnType::TSVector(_) => {
+                    out.push_sql("to_tsquery(");
+                    out.push_bind_param::<Text, _>(s)?;
+                    out.push_sql(")");
+                    Ok(())
+                }
+                ColumnType::Bytes => {
+                    let bytes = scalar::Bytes::from_str(s)
+                        .map_err(|e| DieselError::SerializationError(Box::new(e)))?;
+                    out.push_bind_param::<Binary, _>(&bytes.as_slice())
+                }
+                _ => unreachable!(
+                    "only string, enum and tsvector columns have values of type string"
+                ),
+            },
+            Value::Int(i) => out.push_bind_param::<Integer, _>(i),
+            Value::BigDecimal(d) => {
+                out.push_bind_param::<Text, _>(&d.to_string())?;
+                out.push_sql("::numeric");
+                Ok(())
+            }
+            Value::Bool(b) => out.push_bind_param::<Bool, _>(b),
+            Value::List(values) => {
+                let sql_values = SqlValue::new_array(values.clone());
+                match &column_type {
+                    ColumnType::BigDecimal | ColumnType::BigInt => {
+                        let text_values: Vec<_> = values.iter().map(|v| v.to_string()).collect();
+                        out.push_bind_param::<Array<Text>, _>(&text_values)?;
+                        out.push_sql("::numeric[]");
+                        Ok(())
+                    }
+                    ColumnType::Boolean => out.push_bind_param::<Array<Bool>, _>(&sql_values),
+                    ColumnType::Bytes => out.push_bind_param::<Array<Binary>, _>(&sql_values),
+                    ColumnType::Int => out.push_bind_param::<Array<Integer>, _>(&sql_values),
+                    ColumnType::String => out.push_bind_param::<Array<Text>, _>(&sql_values),
+                    ColumnType::Enum(enum_type) => {
+                        out.push_bind_param::<Array<Text>, _>(&sql_values)?;
+                        out.push_sql("::");
+                        out.push_sql(enum_type.name.as_str());
+                        out.push_sql("[]");
+                        Ok(())
+                    }
+                    // TSVector will only be in a Value::List() for inserts so "to_tsvector" can always be used here
+                    ColumnType::TSVector(config) => {
+                        if sql_values.is_empty() {
+                            out.push_sql("''::tsvector");
+                        } else {
+                            out.push_sql("(");
+                            for (i, value) in sql_values.iter().enumerate() {
+                                if i > 0 {
+                                    out.push_sql(") || ");
+                                }
+                                out.push_sql("to_tsvector(");
+                                out.push_bind_param::<Text, _>(
+                                    &config.language.as_str().to_string(),
+                                )?;
+                                out.push_sql("::regconfig, ");
+                                out.push_bind_param::<Text, _>(&value)?;
+                            }
+                            out.push_sql("))");
+                        }
+
+                        Ok(())
+                    }
+                }
+            }
+            Value::Null => {
+                out.push_sql("null");
+                Ok(())
+            }
+            Value::Bytes(b) => out.push_bind_param::<Binary, _>(&b.as_slice()),
+            Value::BigInt(i) => {
+                out.push_bind_param::<Text, _>(&i.to_string())?;
+                out.push_sql("::numeric");
+                Ok(())
+            }
+        }
+    }
+}
+
+#[derive(Copy, Clone, PartialEq)]
+enum Comparison {
+    Less,
+    LessOrEqual,
+    Equal,
+    NotEqual,
+    GreaterOrEqual,
+    Greater,
+    Match,
+}
+
+impl Comparison {
+    fn as_str(&self) -> &str {
+        use Comparison::*;
+        match self {
+            Less => " < ",
+            LessOrEqual => " <= ",
+            Equal => " = ",
+            NotEqual => " != ",
+            GreaterOrEqual => " >= ",
+            Greater => " > ",
+            Match => " @@ ",
+        }
+    }
+}
+
+enum PrefixType<'a> {
+    String(&'a Column),
+    Bytes(&'a Column),
+}
+
+impl<'a> PrefixType<'a> {
+    fn new(column: &'a Column) -> QueryResult<Self> {
+        match column.column_type {
+            ColumnType::String => Ok(PrefixType::String(column)),
+            ColumnType::Bytes => Ok(PrefixType::Bytes(column)),
+            _ => Err(constraint_violation!(
+                "cannot setup prefix comparison for column {} of type {}",
+                column.name(),
+                column.column_type().sql_type()
+            )),
+        }
+    }
+
+    /// Push the SQL expression for a prefix of values in our column. That
+    /// should be the same expression that we used when creating an index
+    /// for the column
+    fn push_column_prefix(&self, out: &mut AstPass<Pg>) -> QueryResult<()> {
+        match self {
+            PrefixType::String(column) => {
+                out.push_sql("left(");
+                out.push_identifier(column.name.as_str())?;
+                out.push_sql(", ");
+                out.push_sql(&STRING_PREFIX_SIZE.to_string());
+                out.push_sql(")");
+            }
+            PrefixType::Bytes(column) => {
+                out.push_sql("substring(");
+                out.push_identifier(column.name.as_str())?;
+                out.push_sql(", 1, ");
+                out.push_sql(&BYTE_ARRAY_PREFIX_SIZE.to_string());
+                out.push_sql(")");
+            }
+        }
+        Ok(())
+    }
+
+    fn is_large(&self, value: &Value) -> Result<bool, ()> {
+        match (self, value) {
+            (PrefixType::String(_), Value::String(s)) => Ok(s.len() > STRING_PREFIX_SIZE - 1),
+            (PrefixType::Bytes(_), Value::Bytes(b)) => Ok(b.len() > BYTE_ARRAY_PREFIX_SIZE - 1),
+            (PrefixType::Bytes(_), Value::String(s)) => {
+                let len = if s.starts_with("0x") {
+                    (s.len() - 2) / 2
+                } else {
+                    s.len() / 2
+                };
+                Ok(len > BYTE_ARRAY_PREFIX_SIZE - 1)
+            }
+            _ => Err(()),
+        }
+    }
+}
+
+/// Produce a comparison between the string column `column` and the string
+/// value `text` that makes it obvious to Postgres' optimizer that it can
+/// first consult the partial index on `left(column, STRING_PREFIX_SIZE)`
+/// instead of going straight to a sequential scan of the underlying table.
+/// We do this by writing the comparison `column op text` in a way that
+/// involves `left(column, STRING_PREFIX_SIZE)`
+struct PrefixComparison<'a> {
+    op: Comparison,
+    kind: PrefixType<'a>,
+    column: &'a Column,
+    text: &'a Value,
+}
+
+impl<'a> PrefixComparison<'a> {
+    fn new(op: Comparison, column: &'a Column, text: &'a Value) -> QueryResult<Self> {
+        let kind = PrefixType::new(column)?;
+        Ok(Self {
+            op,
+            kind,
+            column,
+            text,
+        })
+    }
+
+    fn push_value_prefix(&self, mut out: AstPass<Pg>) -> QueryResult<()> {
+        match self.kind {
+            PrefixType::String(column) => {
+                out.push_sql("left(");
+                QueryValue(self.text, &column.column_type).walk_ast(out.reborrow())?;
+                out.push_sql(", ");
+                out.push_sql(&STRING_PREFIX_SIZE.to_string());
+                out.push_sql(")");
+            }
+            PrefixType::Bytes(column) => {
+                out.push_sql("substring(");
+                QueryValue(self.text, &column.column_type).walk_ast(out.reborrow())?;
+                out.push_sql(", 1, ");
+                out.push_sql(&BYTE_ARRAY_PREFIX_SIZE.to_string());
+                out.push_sql(")");
+            }
+        }
+        Ok(())
+    }
+
+    fn push_prefix_cmp(&self, op: Comparison, mut out: AstPass<Pg>) -> QueryResult<()> {
+        self.kind.push_column_prefix(&mut out)?;
+        out.push_sql(op.as_str());
+        self.push_value_prefix(out.reborrow())
+    }
+
+    fn push_full_cmp(&self, op: Comparison, mut out: AstPass<Pg>) -> QueryResult<()> {
+        out.push_identifier(self.column.name.as_str())?;
+        out.push_sql(op.as_str());
+        QueryValue(self.text, &self.column.column_type).walk_ast(out)
+    }
+}
+
+impl<'a> QueryFragment<Pg> for PrefixComparison<'a> {
+    fn walk_ast(&self, mut out: AstPass<Pg>) -> QueryResult<()> {
+        use Comparison::*;
+
+        // For the various comparison operators, we want to write the condition
+        // `column op text` in a way that lets Postgres use the index on
+        // `left(column, STRING_PREFIX_SIZE)`. If at all possible, we also want
+        // the condition in a form that only uses the index, or if that's not
+        // possible, in a form where Postgres can first reduce the number of
+        // rows where a full comparison between `column` and `text` is needed
+        // by consulting the index.
+        //
+        // To ease notation, let `N = STRING_PREFIX_SIZE` and write a string stored in
+        // `column` as `uv` where `len(u) <= N`; that means that `v` is only
+        // nonempty if `len(uv) > N`. We similarly split `text` into `st` where
+        // `len(s) <= N`. In other words, `u = left(column, N)` and
+        // `s = left(text, N)`
+        //
+        // In all these comparisons, if `len(st) <= N - 1`, we can reduce
+        // checking `uv op st` to `u op s`, since in that case `t` is the empty
+        // string, we have `uv op s`. If `len(uv) <= N - 1`, then `v` will
+        // also be the empty string. If `len(uv) >= N`, then `len(u) = N`,
+        // and since `u` will be one character longer than `s`, that character
+        // will decide the outcome of `u op s`, even if `u` and `s` agree on
+        // the first `N-1` characters.
+        //
+        // For equality, we can expand `uv = st` into `u = s && uv = st` which
+        // lets Postgres use the index for the first comparison, and `uv = st`
+        // only needs to be checked for rows that pass the check on the index.
+        //
+        // For inequality, we can write `uv != st` as `u != s || uv != st`,
+        // but that doesn't buy us much since Postgres always needs to check
+        // `uv != st`, for which the index is of little help.
+        //
+        // For `op` either `<` or `>`, we have
+        //   uv op st <=> u op s || u = s && uv op st
+        //
+        // For `op` either `<=` or `>=`, we can write (using '<=' as an example)
+        //   uv <= st <=> u < s || u = s && uv <= st
+        let large = self.kind.is_large(&self.text).map_err(|()| {
+            constraint_violation!(
+                "column {} has type {} and can't be compared with the value `{}` using {}",
+                self.column.name(),
+                self.column.column_type().sql_type(),
+                self.text,
+                self.op.as_str()
+            )
+        })?;
+
+        match self.op {
+            Equal => {
+                if large {
+                    out.push_sql("(");
+                    self.push_prefix_cmp(self.op, out.reborrow())?;
+                    out.push_sql(" and ");
+                    self.push_full_cmp(self.op, out.reborrow())?;
+                    out.push_sql(")");
+                } else {
+                    self.push_prefix_cmp(self.op, out.reborrow())?;
+                }
+            }
+            Match => {
+                self.push_full_cmp(self.op, out.reborrow())?;
+            }
+            NotEqual => {
+                if large {
+                    self.push_full_cmp(self.op, out.reborrow())?;
+                } else {
+                    self.push_prefix_cmp(self.op, out.reborrow())?;
+                }
+            }
+            LessOrEqual | Less | GreaterOrEqual | Greater => {
+                let prefix_op = match self.op {
+                    LessOrEqual => Less,
+                    GreaterOrEqual => Greater,
+                    op => op,
+                };
+                if large {
+                    out.push_sql("(");
+                    self.push_prefix_cmp(prefix_op, out.reborrow())?;
+                    out.push_sql(" or (");
+                    self.push_prefix_cmp(Equal, out.reborrow())?;
+                    out.push_sql(" and ");
+                    self.push_full_cmp(self.op, out.reborrow())?;
+                    out.push_sql("))");
+                } else {
+                    self.push_prefix_cmp(self.op, out.reborrow())?;
+                }
+            }
+        }
+        Ok(())
+    }
+}
+
+/// A `QueryFilter` adds the conditions represented by the `filter` to
+/// the `where` clause of a SQL query. The attributes mentioned in
+/// the `filter` must all come from the given `table`, which is used to
+/// map GraphQL names to column names, and to determine the type of the
+/// column an attribute refers to
+#[derive(Debug, Clone)]
+pub struct QueryFilter<'a> {
+    filter: &'a EntityFilter,
+    layout: &'a Layout,
+    table: &'a Table,
+    table_prefix: &'a str,
+    block: BlockNumber,
+}
+
+/// String representation that is useful for debugging when `walk_ast` fails
+impl<'a> fmt::Display for QueryFilter<'a> {
+    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
+        write!(f, "{}", self.filter)
+    }
+}
+
+impl<'a> QueryFilter<'a> {
+    pub fn new(
+        filter: &'a EntityFilter,
+        table: &'a Table,
+        layout: &'a Layout,
+        block: BlockNumber,
+    ) -> Result<Self, StoreError> {
+        Self::valid_attributes(filter, table, layout, false)?;
+
+        Ok(QueryFilter {
+            filter,
+            table,
+            layout,
+            block,
+            table_prefix: "c.",
+        })
+    }
+
+    fn valid_attributes(
+        filter: &'a EntityFilter,
+        table: &'a Table,
+        layout: &'a Layout,
+        child_filter_ancestor: bool,
+    ) -> Result<(), StoreError> {
+        use EntityFilter::*;
+        match filter {
+            And(filters) | Or(filters) => {
+                for filter in filters {
+                    Self::valid_attributes(filter, table, layout, child_filter_ancestor)?;
+                }
+            }
+            Child(child) => {
+                if child_filter_ancestor {
+                    return Err(StoreError::QueryExecutionError(
+                        "Child filters can not be nested".to_string(),
+                    ));
+                }
+
+                if child.derived {
+                    let derived_table = layout.table_for_entity(&child.entity_type)?;
+                    // Make sure that the attribute name is valid for the given table
+                    derived_table.column_for_field(child.attr.as_str())?;
+
+                    Self::valid_attributes(&child.filter, derived_table, layout, true)?;
+                } else {
+                    // Make sure that the attribute name is valid for the given table
+                    table.column_for_field(child.attr.as_str())?;
+
+                    Self::valid_attributes(
+                        &child.filter,
+                        layout.table_for_entity(&child.entity_type)?,
+                        layout,
+                        true,
+                    )?;
+                }
+            }
+            // This is a special case since we want to allow passing "block" column filter, but we dont
+            // want to fail/error when this is passed here, since this column is not really an entity column.
+            ChangeBlockGte(..) => {}
+            Contains(attr, _)
+            | ContainsNoCase(attr, _)
+            | NotContains(attr, _)
+            | NotContainsNoCase(attr, _)
+            | Equal(attr, _)
+            | Not(attr, _)
+            | GreaterThan(attr, _)
+            | LessThan(attr, _)
+            | GreaterOrEqual(attr, _)
+            | LessOrEqual(attr, _)
+            | In(attr, _)
+            | NotIn(attr, _)
+            | StartsWith(attr, _)
+            | StartsWithNoCase(attr, _)
+            | NotStartsWith(attr, _)
+            | NotStartsWithNoCase(attr, _)
+            | EndsWith(attr, _)
+            | EndsWithNoCase(attr, _)
+            | NotEndsWith(attr, _)
+            | NotEndsWithNoCase(attr, _) => {
+                table.column_for_field(attr)?;
+            }
+        }
+        Ok(())
+    }
+
+    fn with(&self, filter: &'a EntityFilter) -> Self {
+        QueryFilter {
+            filter,
+            table: self.table,
+            layout: self.layout,
+            block: self.block,
+            table_prefix: self.table_prefix.clone(),
+        }
+    }
+
+    fn child(
+        &self,
+        attribute: &Attribute,
+        entity_type: &'a EntityType,
+        filter: &'a EntityFilter,
+        derived: bool,
+        mut out: AstPass<Pg>,
+    ) -> QueryResult<()> {
+        let child_table = self
+            .layout
+            .table_for_entity(entity_type)
+            .expect("Table for child entity not found");
+
+        let child_prefix = "i.";
+        let parent_prefix = "c.";
+
+        out.push_sql("exists (select 1 from ");
+        out.push_sql(child_table.qualified_name.as_str());
+        out.push_sql(" as i");
+
+        out.push_sql(" where ");
+
+        // Join tables
+        if derived {
+            // If the parent is derived,
+            // the child column is picked based on the provided attribute
+            // and the parent column is the primary key of the parent table
+            let child_column = child_table
+                .column_for_field(attribute)
+                .expect("Column for an attribute not found");
+            let parent_column = self.table.primary_key();
+
+            if child_column.is_list() {
+                // Type A: c.id = any(i.{parent_field})
+                out.push_sql(parent_prefix);
+                out.push_identifier(parent_column.name.as_str())?;
+                out.push_sql(" = any(");
+                out.push_sql(child_prefix);
+                out.push_identifier(child_column.name.as_str())?;
+                out.push_sql(")");
+            } else {
+                // Type B: c.id = i.{parent_field}
+                out.push_sql(parent_prefix);
+                out.push_identifier(parent_column.name.as_str())?;
+                out.push_sql(" = ");
+                out.push_sql(child_prefix);
+                out.push_identifier(child_column.name.as_str())?;
+            }
+        } else {
+            // If the parent is not derived, we do the opposite.
+            // The parent column is picked based on the provided attribute
+            // and the child column is the primary key of the child table
+            let parent_column = self
+                .table
+                .column_for_field(attribute)
+                .expect("Column for an attribute not found");
+            let child_column = child_table.primary_key();
+
+            if parent_column.is_list() {
+                // Type C: i.id = any(c.child_ids)
+                out.push_sql(child_prefix);
+                out.push_identifier(child_column.name.as_str())?;
+                out.push_sql(" = any(");
+                out.push_sql(parent_prefix);
+                out.push_identifier(parent_column.name.as_str())?;
+                out.push_sql(")");
+            } else {
+                // Type D: i.id = c.child_id
+                out.push_sql(child_prefix);
+                out.push_identifier(child_column.name.as_str())?;
+                out.push_sql(" = ");
+                out.push_sql(parent_prefix);
+                out.push_identifier(parent_column.name.as_str())?;
+            }
+        }
+
+        out.push_sql(" and ");
+
+        // Match by block
+        BlockRangeColumn::new(&child_table, child_prefix, self.block).contains(&mut out)?;
+
+        out.push_sql(" and ");
+
+        // Child filters
+        let query_filter = QueryFilter {
+            filter,
+            table: child_table,
+            layout: self.layout,
+            block: self.block,
+            table_prefix: child_prefix,
+        };
+
+        query_filter.walk_ast(out.reborrow())?;
+
+        out.push_sql(")");
+
+        Ok(())
+    }
+
+    fn column(&self, attribute: &Attribute) -> &'a Column {
+        self.table
+            .column_for_field(attribute)
+            .expect("the constructor already checked that all attribute names are valid")
+    }
+
+    fn binary_op(
+        &self,
+        filters: &[EntityFilter],
+        op: &str,
+        on_empty: &str,
+        mut out: AstPass<Pg>,
+    ) -> QueryResult<()> {
+        if !filters.is_empty() {
+            out.push_sql("(");
+            for (i, filter) in filters.iter().enumerate() {
+                if i > 0 {
+                    out.push_sql(op);
+                }
+                self.with(filter).walk_ast(out.reborrow())?;
+            }
+            out.push_sql(")");
+        } else {
+            out.push_sql(on_empty);
+        }
+        Ok(())
+    }
+
+    fn contains(
+        &self,
+        attribute: &Attribute,
+        value: &Value,
+        negated: bool,
+        strict: bool,
+        mut out: AstPass<Pg>,
+    ) -> QueryResult<()> {
+        let column = self.column(attribute);
+        let operation = match (strict, negated) {
+            (true, true) => " not like ",
+            (true, false) => " like ",
+            (false, true) => " not ilike ",
+            (false, false) => " ilike ",
+        };
+        match value {
+            Value::String(s) => {
+                out.push_sql(self.table_prefix);
+                out.push_identifier(column.name.as_str())?;
+                out.push_sql(operation);
+                if s.starts_with('%') || s.ends_with('%') {
+                    out.push_bind_param::<Text, _>(s)?;
+                } else {
+                    let s = format!("%{}%", s);
+                    out.push_bind_param::<Text, _>(&s)?;
+                }
+            }
+            Value::Bytes(b) => {
+                out.push_sql("position(");
+                out.push_bind_param::<Binary, _>(&b.as_slice())?;
+                out.push_sql(" in ");
+                out.push_sql(&self.table_prefix);
+                out.push_identifier(column.name.as_str())?;
+                if negated {
+                    out.push_sql(") = 0")
+                } else {
+                    out.push_sql(") > 0");
+                }
+            }
+            Value::List(_) => {
+                if negated {
+                    out.push_sql(" not ");
+                    out.push_sql(&self.table_prefix);
+                    out.push_identifier(column.name.as_str())?;
+                    out.push_sql(" && ");
+                } else {
+                    out.push_sql(&self.table_prefix);
+                    out.push_identifier(column.name.as_str())?;
+                    out.push_sql(" @> ");
+                }
+                QueryValue(value, &column.column_type).walk_ast(out)?;
+            }
+            Value::Null
+            | Value::BigDecimal(_)
+            | Value::Int(_)
+            | Value::Bool(_)
+            | Value::BigInt(_) => {
+                let filter = match negated {
+                    false => "contains",
+                    true => "not_contains",
+                };
+                return Err(UnsupportedFilter {
+                    filter: filter.to_owned(),
+                    value: value.clone(),
+                }
+                .into());
+            }
+        }
+        Ok(())
+    }
+
+    fn equals(
+        &self,
+        attribute: &Attribute,
+        value: &Value,
+        op: Comparison,
+        mut out: AstPass<Pg>,
+    ) -> QueryResult<()> {
+        let column = self.column(attribute);
+
+        if matches!(value, Value::Null) {
+            // Deal with nulls first since they always need special
+            // treatment
+            out.push_identifier(column.name.as_str())?;
+            match op {
+                Comparison::Equal => out.push_sql(" is null"),
+                Comparison::NotEqual => out.push_sql(" is not null"),
+                _ => unreachable!("we only call equals with '=' or '!='"),
+            }
+        } else if column.use_prefix_comparison {
+            PrefixComparison::new(op, column, value)?.walk_ast(out.reborrow())?;
+        } else if column.is_fulltext() {
+            out.push_sql(&self.table_prefix);
+            out.push_identifier(column.name.as_str())?;
+            out.push_sql(Comparison::Match.as_str());
+            QueryValue(value, &column.column_type).walk_ast(out)?;
+        } else {
+            out.push_sql(&self.table_prefix);
+            out.push_identifier(column.name.as_str())?;
+            out.push_sql(op.as_str());
+            QueryValue(value, &column.column_type).walk_ast(out)?;
+        }
+        Ok(())
+    }
+
+    fn compare(
+        &self,
+        attribute: &Attribute,
+        value: &Value,
+        op: Comparison,
+        mut out: AstPass<Pg>,
+    ) -> QueryResult<()> {
+        let column = self.column(attribute);
+
+        if column.use_prefix_comparison {
+            PrefixComparison::new(op, column, value)?.walk_ast(out.reborrow())?;
+        } else {
+            out.push_sql(&self.table_prefix);
+            out.push_identifier(column.name.as_str())?;
+            out.push_sql(op.as_str());
+            match value {
+                Value::BigInt(_)
+                | Value::Bytes(_)
+                | Value::BigDecimal(_)
+                | Value::Int(_)
+                | Value::String(_) => QueryValue(value, &column.column_type).walk_ast(out)?,
+                Value::Bool(_) | Value::List(_) | Value::Null => {
+                    return Err(UnsupportedFilter {
+                        filter: op.as_str().to_owned(),
+                        value: value.clone(),
+                    }
+                    .into());
+                }
+            }
+        }
+        Ok(())
+    }
+
+    fn in_array(
+        &self,
+        attribute: &Attribute,
+        values: &[Value],
+        negated: bool,
+        mut out: AstPass<Pg>,
+    ) -> QueryResult<()> {
+        let column = self.column(attribute);
+
+        if values.is_empty() {
+            out.push_sql("false");
+            return Ok(());
+        }
+
+        // NULLs in SQL are very special creatures, and we need to treat
+        // them special. For non-NULL values, we generate
+        //   attribute {in|not in} (value1, value2, ...)
+        // and for NULL values we generate
+        //   attribute {is|is not} null
+        // If we have both NULL and non-NULL values we join these
+        // two clauses with OR.
+        //
+        // Note that when we have no non-NULL values at all, we must
+        // not generate `attribute {in|not in} ()` since the empty `()`
+        // is a syntax error
+        //
+        // Because we checked above, one of these two will be true
+        let have_nulls = values.iter().any(|value| value == &Value::Null);
+        let have_non_nulls = values.iter().any(|value| value != &Value::Null);
+
+        if have_nulls && have_non_nulls {
+            out.push_sql("(");
+        }
+
+        if have_nulls {
+            out.push_sql(&self.table_prefix);
+            out.push_identifier(column.name.as_str())?;
+            if negated {
+                out.push_sql(" is not null");
+            } else {
+                out.push_sql(" is null")
+            }
+        }
+
+        if have_nulls && have_non_nulls {
+            out.push_sql(" or ");
+        }
+
+        if have_non_nulls {
+            if column.use_prefix_comparison
+                && values.iter().all(|v| match v {
+                    Value::String(s) => s.len() <= STRING_PREFIX_SIZE - 1,
+                    Value::Bytes(b) => b.len() <= BYTE_ARRAY_PREFIX_SIZE - 1,
+                    _ => false,
+                })
+            {
+                // If all values are shorter than the prefix size only check
+                // the prefix of the column; that's a fairly common case and
+                // we present it in the best possible way for Postgres'
+                // query optimizer
+                // See PrefixComparison for a more detailed discussion of what
+                // is happening here
+                PrefixType::new(column)?.push_column_prefix(&mut out)?;
+            } else {
+                out.push_sql(&self.table_prefix);
+                out.push_identifier(column.name.as_str())?;
+            }
+            if negated {
+                out.push_sql(" not in (");
+            } else {
+                out.push_sql(" in (");
+            }
+            for (i, value) in values
+                .iter()
+                .filter(|value| value != &&Value::Null)
+                .enumerate()
+            {
+                if i > 0 {
+                    out.push_sql(", ");
+                }
+                QueryValue(value, &column.column_type).walk_ast(out.reborrow())?;
+            }
+            out.push_sql(")");
+        }
+
+        if have_nulls && have_non_nulls {
+            out.push_sql(")");
+        }
+        Ok(())
+    }
+
+    fn filter_block_gte(
+        &self,
+        block_number_gte: &BlockNumber,
+        mut out: AstPass<Pg>,
+    ) -> QueryResult<()> {
+        BlockRangeColumn::new(self.table, "c.", *block_number_gte).changed_since(&mut out)
+    }
+
+    fn starts_or_ends_with(
+        &self,
+        attribute: &Attribute,
+        value: &Value,
+        op: &str,
+        starts_with: bool,
+        mut out: AstPass<Pg>,
+    ) -> QueryResult<()> {
+        let column = self.column(attribute);
+
+        out.push_sql(&self.table_prefix);
+        out.push_identifier(column.name.as_str())?;
+        out.push_sql(op);
+        match value {
+            Value::String(s) => {
+                let s = if starts_with {
+                    format!("{}%", s)
+                } else {
+                    format!("%{}", s)
+                };
+                out.push_bind_param::<Text, _>(&s)?
+            }
+            Value::Bool(_)
+            | Value::BigInt(_)
+            | Value::Bytes(_)
+            | Value::BigDecimal(_)
+            | Value::Int(_)
+            | Value::List(_)
+            | Value::Null => {
+                return Err(UnsupportedFilter {
+                    filter: op.to_owned(),
+                    value: value.clone(),
+                }
+                .into());
+            }
+        }
+        Ok(())
+    }
+}
+
+impl<'a> QueryFragment<Pg> for QueryFilter<'a> {
+    fn walk_ast(&self, mut out: AstPass<Pg>) -> QueryResult<()> {
+        out.unsafe_to_cache_prepared();
+
+        use Comparison as c;
+        use EntityFilter::*;
+        match &self.filter {
+            And(filters) => self.binary_op(filters, " and ", " true ", out)?,
+            Or(filters) => self.binary_op(filters, " or ", " false ", out)?,
+
+            Contains(attr, value) => self.contains(attr, value, false, true, out)?,
+            ContainsNoCase(attr, value) => self.contains(attr, value, false, false, out)?,
+            NotContains(attr, value) => self.contains(attr, value, true, true, out)?,
+            NotContainsNoCase(attr, value) => self.contains(attr, value, true, false, out)?,
+
+            Equal(attr, value) => self.equals(attr, value, c::Equal, out)?,
+            Not(attr, value) => self.equals(attr, value, c::NotEqual, out)?,
+
+            GreaterThan(attr, value) => self.compare(attr, value, c::Greater, out)?,
+            LessThan(attr, value) => self.compare(attr, value, c::Less, out)?,
+            GreaterOrEqual(attr, value) => self.compare(attr, value, c::GreaterOrEqual, out)?,
+            LessOrEqual(attr, value) => self.compare(attr, value, c::LessOrEqual, out)?,
+
+            In(attr, values) => self.in_array(attr, values, false, out)?,
+            NotIn(attr, values) => self.in_array(attr, values, true, out)?,
+
+            StartsWith(attr, value) => {
+                self.starts_or_ends_with(attr, value, " like ", true, out)?
+            }
+            StartsWithNoCase(attr, value) => {
+                self.starts_or_ends_with(attr, value, " ilike ", true, out)?
+            }
+            NotStartsWith(attr, value) => {
+                self.starts_or_ends_with(attr, value, " not like ", true, out)?
+            }
+            NotStartsWithNoCase(attr, value) => {
+                self.starts_or_ends_with(attr, value, " not ilike ", true, out)?
+            }
+            EndsWith(attr, value) => self.starts_or_ends_with(attr, value, " like ", false, out)?,
+            EndsWithNoCase(attr, value) => {
+                self.starts_or_ends_with(attr, value, " ilike ", false, out)?
+            }
+            NotEndsWith(attr, value) => {
+                self.starts_or_ends_with(attr, value, " not like ", false, out)?
+            }
+            NotEndsWithNoCase(attr, value) => {
+                self.starts_or_ends_with(attr, value, " not ilike ", false, out)?
+            }
+            ChangeBlockGte(block_number) => self.filter_block_gte(block_number, out)?,
+            Child(child) => self.child(
+                &child.attr,
+                &child.entity_type,
+                &child.filter,
+                child.derived,
+                out,
+            )?,
+        }
+        Ok(())
+    }
+}
+
+#[derive(Debug, Clone, Constructor)]
+pub struct FindQuery<'a> {
+    table: &'a Table,
+    id: &'a str,
+    block: BlockNumber,
+}
+
+impl<'a> QueryFragment<Pg> for FindQuery<'a> {
+    fn walk_ast(&self, mut out: AstPass<Pg>) -> QueryResult<()> {
+        out.unsafe_to_cache_prepared();
+
+        // Generate
+        //    select '..' as entity, to_jsonb(e.*) as data
+        //      from schema.table e where id = $1
+        out.push_sql("select ");
+        out.push_bind_param::<Text, _>(&self.table.object.as_str())?;
+        out.push_sql(" as entity, to_jsonb(e.*) as data\n");
+        out.push_sql("  from ");
+        out.push_sql(self.table.qualified_name.as_str());
+        out.push_sql(" e\n where ");
+        self.table.primary_key().eq(self.id, &mut out)?;
+        out.push_sql(" and ");
+        BlockRangeColumn::new(self.table, "e.", self.block).contains(&mut out)
+    }
+}
+
+impl<'a> QueryId for FindQuery<'a> {
+    type QueryId = ();
+
+    const HAS_STATIC_QUERY_ID: bool = false;
+}
+
+impl<'a> LoadQuery<PgConnection, EntityData> for FindQuery<'a> {
+    fn internal_load(self, conn: &PgConnection) -> QueryResult<Vec<EntityData>> {
+        conn.query_by_name(&self)
+    }
+}
+
+impl<'a, Conn> RunQueryDsl<Conn> for FindQuery<'a> {}
+
+/// Builds a query over a given set of [`Table`]s in an attempt to find updated
+/// and/or newly inserted entities at a given block number; i.e. such that the
+/// block range's lower bound is equal to said block number.
+#[derive(Debug, Clone, Constructor)]
+pub struct FindChangesQuery<'a> {
+    pub(crate) _namespace: &'a Namespace,
+    pub(crate) tables: &'a [&'a Table],
+    pub(crate) block: BlockNumber,
+}
+
+impl<'a> QueryFragment<Pg> for FindChangesQuery<'a> {
+    fn walk_ast(&self, mut out: AstPass<Pg>) -> QueryResult<()> {
+        out.unsafe_to_cache_prepared();
+
+        for (i, table) in self.tables.iter().enumerate() {
+            if i > 0 {
+                out.push_sql("\nunion all\n");
+            }
+            out.push_sql("select ");
+            out.push_bind_param::<Text, _>(&table.object.as_str())?;
+            out.push_sql(" as entity, to_jsonb(e.*) as data\n");
+            out.push_sql("  from ");
+            out.push_sql(table.qualified_name.as_str());
+            out.push_sql(" e\n where ");
+            BlockRangeLowerBoundClause::new("e.", self.block).walk_ast(out.reborrow())?;
+        }
+
+        Ok(())
+    }
+}
+
+impl<'a> QueryId for FindChangesQuery<'a> {
+    type QueryId = ();
+
+    const HAS_STATIC_QUERY_ID: bool = false;
+}
+
+impl<'a> LoadQuery<PgConnection, EntityData> for FindChangesQuery<'a> {
+    fn internal_load(self, conn: &PgConnection) -> QueryResult<Vec<EntityData>> {
+        conn.query_by_name(&self)
+    }
+}
+
+impl<'a, Conn> RunQueryDsl<Conn> for FindChangesQuery<'a> {}
+
+/// Builds a query over a given set of [`Table`]s in an attempt to find deleted
+/// entities; i.e. such that the block range's lower bound is equal to said
+/// block number.
+///
+/// Please note that the result set from this query is *not* definitive. This
+/// query is intented to be used together with [`FindChangesQuery`]; by
+/// combining the results it's possible to see which entities were *actually*
+/// deleted and which ones were just updated.
+#[derive(Debug, Clone, Constructor)]
+pub struct FindPossibleDeletionsQuery<'a> {
+    pub(crate) _namespace: &'a Namespace,
+    pub(crate) tables: &'a [&'a Table],
+    pub(crate) block: BlockNumber,
+}
+
+impl<'a> QueryFragment<Pg> for FindPossibleDeletionsQuery<'a> {
+    fn walk_ast(&self, mut out: AstPass<Pg>) -> QueryResult<()> {
+        out.unsafe_to_cache_prepared();
+
+        for (i, table) in self.tables.iter().enumerate() {
+            if i > 0 {
+                out.push_sql("\nunion all\n");
+            }
+            out.push_sql("select ");
+            out.push_bind_param::<Text, _>(&table.object.as_str())?;
+            out.push_sql(" as entity, e.id\n");
+            out.push_sql("  from ");
+            out.push_sql(table.qualified_name.as_str());
+            out.push_sql(" e\n where ");
+            BlockRangeUpperBoundClause::new("e.", self.block).walk_ast(out.reborrow())?;
+        }
+
+        Ok(())
+    }
+}
+
+impl<'a> QueryId for FindPossibleDeletionsQuery<'a> {
+    type QueryId = ();
+
+    const HAS_STATIC_QUERY_ID: bool = false;
+}
+
+impl<'a> LoadQuery<PgConnection, EntityDeletion> for FindPossibleDeletionsQuery<'a> {
+    fn internal_load(self, conn: &PgConnection) -> QueryResult<Vec<EntityDeletion>> {
+        conn.query_by_name(&self)
+    }
+}
+
+impl<'a, Conn> RunQueryDsl<Conn> for FindPossibleDeletionsQuery<'a> {}
+
+#[derive(Debug, Clone, Constructor)]
+pub struct FindManyQuery<'a> {
+    pub(crate) _namespace: &'a Namespace,
+    pub(crate) tables: Vec<&'a Table>,
+
+    // Maps object name to ids.
+    pub(crate) ids_for_type: &'a BTreeMap<&'a EntityType, Vec<&'a str>>,
+    pub(crate) block: BlockNumber,
+}
+
+impl<'a> QueryFragment<Pg> for FindManyQuery<'a> {
+    fn walk_ast(&self, mut out: AstPass<Pg>) -> QueryResult<()> {
+        out.unsafe_to_cache_prepared();
+
+        // Generate
+        //    select $object0 as entity, to_jsonb(e.*) as data
+        //      from schema.<table0> e where {id.is_in($ids0)}
+        //    union all
+        //    select $object1 as entity, to_jsonb(e.*) as data
+        //      from schema.<table1> e where {id.is_in($ids1))
+        //    union all
+        //    ...
+        for (i, table) in self.tables.iter().enumerate() {
+            if i > 0 {
+                out.push_sql("\nunion all\n");
+            }
+            out.push_sql("select ");
+            out.push_bind_param::<Text, _>(&table.object.as_str())?;
+            out.push_sql(" as entity, to_jsonb(e.*) as data\n");
+            out.push_sql("  from ");
+            out.push_sql(table.qualified_name.as_str());
+            out.push_sql(" e\n where ");
+            table
+                .primary_key()
+                .is_in(&self.ids_for_type[&table.object], &mut out)?;
+            out.push_sql(" and ");
+            BlockRangeColumn::new(table, "e.", self.block).contains(&mut out)?;
+        }
+        Ok(())
+    }
+}
+
+impl<'a> QueryId for FindManyQuery<'a> {
+    type QueryId = ();
+
+    const HAS_STATIC_QUERY_ID: bool = false;
+}
+
+impl<'a> LoadQuery<PgConnection, EntityData> for FindManyQuery<'a> {
+    fn internal_load(self, conn: &PgConnection) -> QueryResult<Vec<EntityData>> {
+        conn.query_by_name(&self)
+    }
+}
+
+impl<'a, Conn> RunQueryDsl<Conn> for FindManyQuery<'a> {}
+
+#[derive(Debug)]
+pub struct InsertQuery<'a> {
+    table: &'a Table,
+    entities: &'a [(&'a EntityKey, Cow<'a, Entity>)],
+    unique_columns: Vec<&'a Column>,
+    br_column: BlockRangeColumn<'a>,
+}
+
+impl<'a> InsertQuery<'a> {
+    pub fn new(
+        table: &'a Table,
+        entities: &'a mut [(&'a EntityKey, Cow<Entity>)],
+        block: BlockNumber,
+    ) -> Result<InsertQuery<'a>, StoreError> {
+        for (entity_key, entity) in entities.iter_mut() {
+            for column in table.columns.iter() {
+                if let Some(fields) = column.fulltext_fields.as_ref() {
+                    let fulltext_field_values = fields
+                        .iter()
+                        .filter_map(|field| entity.get(field))
+                        .cloned()
+                        .collect::<Vec<Value>>();
+                    if !fulltext_field_values.is_empty() {
+                        entity
+                            .to_mut()
+                            .insert(column.field.to_string(), Value::List(fulltext_field_values));
+                    }
+                }
+                if !column.is_nullable() && !entity.contains_key(&column.field) {
+                    return Err(StoreError::QueryExecutionError(format!(
+                    "can not insert entity {}[{}] since value for non-nullable attribute {} is missing. \
+                     To fix this, mark the attribute as nullable in the GraphQL schema or change the \
+                     mapping code to always set this attribute.",
+                    entity_key.entity_type, entity_key.entity_id, column.field
+                )));
+                }
+            }
+        }
+        let unique_columns = InsertQuery::unique_columns(table, entities);
+        let br_column = BlockRangeColumn::new(table, "", block);
+
+        Ok(InsertQuery {
+            table,
+            entities,
+            unique_columns,
+            br_column,
+        })
+    }
+
+    /// Build the column name list using the subset of all keys among present entities.
+    fn unique_columns(
+        table: &'a Table,
+        entities: &'a [(&'a EntityKey, Cow<'a, Entity>)],
+    ) -> Vec<&'a Column> {
+        let mut hashmap = HashMap::new();
+        for (_key, entity) in entities.iter() {
+            for column in &table.columns {
+                if entity.get(&column.field).is_some() {
+                    hashmap.entry(column.name.as_str()).or_insert(column);
+                }
+            }
+        }
+        hashmap.into_iter().map(|(_key, value)| value).collect()
+    }
+}
+
+impl<'a> QueryFragment<Pg> for InsertQuery<'a> {
+    fn walk_ast(&self, mut out: AstPass<Pg>) -> QueryResult<()> {
+        out.unsafe_to_cache_prepared();
+
+        // Construct a query
+        //   insert into schema.table(column, ...)
+        //   values
+        //   (a, b, c),
+        //   (d, e, f)
+        //   [...]
+        //   (x, y, z)
+        //
+        // and convert and bind the entity's values into it
+        out.push_sql("insert into ");
+        out.push_sql(self.table.qualified_name.as_str());
+
+        out.push_sql("(");
+
+        for &column in &self.unique_columns {
+            out.push_identifier(column.name.as_str())?;
+            out.push_sql(", ");
+        }
+        self.br_column.name(&mut out);
+
+        out.push_sql(") values\n");
+
+        // Use a `Peekable` iterator to help us decide how to finalize each line.
+        let mut iter = self.entities.iter().map(|(_key, entity)| entity).peekable();
+        while let Some(entity) = iter.next() {
+            out.push_sql("(");
+            for column in &self.unique_columns {
+                // If the column name is not within this entity's fields, we will issue the
+                // null value in its place
+                if let Some(value) = entity.get(&column.field) {
+                    QueryValue(value, &column.column_type).walk_ast(out.reborrow())?;
+                } else {
+                    out.push_sql("null");
+                }
+                out.push_sql(", ");
+            }
+            self.br_column.literal_range_current(&mut out)?;
+            out.push_sql(")");
+
+            // finalize line according to remaining entities to insert
+            if iter.peek().is_some() {
+                out.push_sql(",\n");
+            }
+        }
+        out.push_sql("\nreturning ");
+        out.push_sql(PRIMARY_KEY_COLUMN);
+        out.push_sql("::text");
+
+        Ok(())
+    }
+}
+
+impl<'a> QueryId for InsertQuery<'a> {
+    type QueryId = ();
+
+    const HAS_STATIC_QUERY_ID: bool = false;
+}
+
+impl<'a> LoadQuery<PgConnection, ReturnedEntityData> for InsertQuery<'a> {
+    fn internal_load(self, conn: &PgConnection) -> QueryResult<Vec<ReturnedEntityData>> {
+        conn.query_by_name(&self)
+            .map(|data| ReturnedEntityData::bytes_as_str(self.table, data))
+    }
+}
+
+impl<'a, Conn> RunQueryDsl<Conn> for InsertQuery<'a> {}
+
+#[derive(Debug, Clone)]
+pub struct ConflictingEntityQuery<'a> {
+    _layout: &'a Layout,
+    tables: Vec<&'a Table>,
+    entity_id: &'a str,
+}
+impl<'a> ConflictingEntityQuery<'a> {
+    pub fn new(
+        layout: &'a Layout,
+        entities: Vec<EntityType>,
+        entity_id: &'a str,
+    ) -> Result<Self, StoreError> {
+        let tables = entities
+            .iter()
+            .map(|entity| layout.table_for_entity(entity).map(|table| table.as_ref()))
+            .collect::<Result<Vec<_>, _>>()?;
+        Ok(ConflictingEntityQuery {
+            _layout: layout,
+            tables,
+            entity_id,
+        })
+    }
+}
+
+impl<'a> QueryFragment<Pg> for ConflictingEntityQuery<'a> {
+    fn walk_ast(&self, mut out: AstPass<Pg>) -> QueryResult<()> {
+        out.unsafe_to_cache_prepared();
+
+        // Construct a query
+        //   select 'Type1' as entity from schema.table1 where id = $1
+        //   union all
+        //   select 'Type2' as entity from schema.table2 where id = $1
+        //   union all
+        //   ...
+        for (i, table) in self.tables.iter().enumerate() {
+            if i > 0 {
+                out.push_sql("\nunion all\n");
+            }
+            out.push_sql("select ");
+            out.push_bind_param::<Text, _>(&table.object.as_str())?;
+            out.push_sql(" as entity from ");
+            out.push_sql(table.qualified_name.as_str());
+            out.push_sql(" where id = ");
+            table.primary_key().bind_id(&self.entity_id, &mut out)?;
+        }
+        Ok(())
+    }
+}
+
+impl<'a> QueryId for ConflictingEntityQuery<'a> {
+    type QueryId = ();
+
+    const HAS_STATIC_QUERY_ID: bool = false;
+}
+
+#[derive(QueryableByName)]
+pub struct ConflictingEntityData {
+    #[sql_type = "Text"]
+    pub entity: String,
+}
+
+impl<'a> LoadQuery<PgConnection, ConflictingEntityData> for ConflictingEntityQuery<'a> {
+    fn internal_load(self, conn: &PgConnection) -> QueryResult<Vec<ConflictingEntityData>> {
+        conn.query_by_name(&self)
+    }
+}
+
+impl<'a, Conn> RunQueryDsl<Conn> for ConflictingEntityQuery<'a> {}
+
+/// A string where we have checked that it is safe to embed it literally
+/// in a string in a SQL query. In particular, we have escaped any use
+/// of the string delimiter `'`.
+///
+/// This is only needed for `ParentIds::List` since we can't send those to
+/// the database as a bind variable, and therefore need to embed them in
+/// the query literally
+#[derive(Debug, Clone)]
+struct SafeString(String);
+
+/// A `ParentLink` where we've made sure for the `List` variant that each
+/// `Vec<Option<String>>` has the same length
+/// Use the provided constructors to make sure this invariant holds
+#[derive(Debug, Clone)]
+enum ParentIds {
+    List(Vec<Vec<Option<SafeString>>>),
+    Scalar(Vec<String>),
+}
+
+impl ParentIds {
+    fn new(link: ParentLink) -> Self {
+        match link {
+            ParentLink::Scalar(child_ids) => ParentIds::Scalar(child_ids),
+            ParentLink::List(child_ids) => {
+                // Postgres will only accept child_ids, which is a Vec<Vec<String>>
+                // if all Vec<String> are the same length. We therefore pad
+                // shorter ones with None, which become nulls in the database
+                let maxlen = child_ids.iter().map(|ids| ids.len()).max().unwrap_or(0);
+                let child_ids = child_ids
+                    .into_iter()
+                    .map(|ids| {
+                        let mut ids: Vec<_> = ids
+                            .into_iter()
+                            .map(|s| {
+                                if s.contains('\'') {
+                                    SafeString(s.replace('\'', "''"))
+                                } else {
+                                    SafeString(s)
+                                }
+                            })
+                            .map(Some)
+                            .collect();
+                        ids.resize_with(maxlen, || None);
+                        ids
+                    })
+                    .collect();
+                ParentIds::List(child_ids)
+            }
+        }
+    }
+}
+
+/// An `EntityLink` where we've resolved the entity type and attribute to the
+/// corresponding table and column
+#[derive(Debug, Clone)]
+enum TableLink<'a> {
+    Direct(&'a Column, ChildMultiplicity),
+    /// The `Table` is the parent table
+    Parent(&'a Table, ParentIds),
+}
+
+impl<'a> TableLink<'a> {
+    fn new(
+        layout: &'a Layout,
+        child_table: &'a Table,
+        link: EntityLink,
+    ) -> Result<Self, QueryExecutionError> {
+        match link {
+            EntityLink::Direct(attribute, multiplicity) => {
+                let column = child_table.column_for_field(attribute.name())?;
+                Ok(TableLink::Direct(column, multiplicity))
+            }
+            EntityLink::Parent(parent_type, parent_link) => {
+                let parent_table = layout.table_for_entity(&parent_type)?;
+                Ok(TableLink::Parent(parent_table, ParentIds::new(parent_link)))
+            }
+        }
+    }
+}
+
+/// When we expand the parents for a specific query for children, we
+/// sometimes (aka interfaces) need to restrict them to a specific
+/// parent `q.id` that an outer query has already set up. In all other
+/// cases, we restrict the children to the top n by ordering by a specific
+/// sort key and limiting
+#[derive(Copy, Clone)]
+enum ParentLimit<'a> {
+    /// Limit children to a specific parent
+    Outer,
+    /// Limit children by sorting and picking top n
+    Ranked(&'a SortKey<'a>, &'a FilterRange),
+}
+
+impl<'a> ParentLimit<'a> {
+    fn filter(&self, out: &mut AstPass<Pg>) {
+        match self {
+            ParentLimit::Outer => out.push_sql(" and q.id = p.id"),
+            ParentLimit::Ranked(_, _) => (),
+        }
+    }
+
+    fn restrict(&self, out: &mut AstPass<Pg>) -> QueryResult<()> {
+        if let ParentLimit::Ranked(sort_key, range) = self {
+            out.push_sql(" ");
+            sort_key.order_by(out)?;
+            range.walk_ast(out.reborrow())?;
+        }
+        Ok(())
+    }
+
+    /// Include a 'limit {num_parents}+1' clause for single-object queries
+    /// if that is needed
+    fn single_limit(&self, num_parents: usize, out: &mut AstPass<Pg>) {
+        match self {
+            ParentLimit::Ranked(_, _) => {
+                out.push_sql(" limit ");
+                out.push_sql(&(num_parents + 1).to_string());
+            }
+            ParentLimit::Outer => {
+                // limiting is taken care of in a wrapper around
+                // the query we are currently building
+            }
+        }
+    }
+}
+
+/// This is the parallel to `EntityWindow`, with names translated to
+/// the relational layout, and checked against it
+#[derive(Debug, Clone)]
+pub struct FilterWindow<'a> {
+    /// The table from which we take entities
+    table: &'a Table,
+    /// The overall filter for the entire query
+    query_filter: Option<QueryFilter<'a>>,
+    /// The parent ids we are interested in. The type in the database
+    /// for these is determined by the `IdType` of the parent table. Since
+    /// we always compare these ids with a column in `table`, and that
+    /// column must have the same type as the primary key of the parent
+    /// table, we can deduce the correct `IdType` that way
+    ids: Vec<String>,
+    /// How to filter by a set of parents
+    link: TableLink<'a>,
+    column_names: AttributeNames,
+}
+
+impl<'a> FilterWindow<'a> {
+    fn new(
+        layout: &'a Layout,
+        window: EntityWindow,
+        entity_filter: Option<&'a EntityFilter>,
+        block: BlockNumber,
+    ) -> Result<Self, QueryExecutionError> {
+        let EntityWindow {
+            child_type,
+            ids,
+            link,
+            column_names,
+        } = window;
+        let table = layout.table_for_entity(&child_type).map(|rc| rc.as_ref())?;
+
+        // Confidence check: ensure that all selected column names exist in the table
+        if let AttributeNames::Select(ref selected_field_names) = column_names {
+            for field in selected_field_names {
+                let _ = table.column_for_field(field)?;
+            }
+        }
+
+        let query_filter = entity_filter
+            .map(|filter| QueryFilter::new(&filter, table, layout, block))
+            .transpose()?;
+        let link = TableLink::new(layout, table, link)?;
+        Ok(FilterWindow {
+            table,
+            query_filter,
+            ids,
+            link,
+            column_names,
+        })
+    }
+
+    fn parent_type(&self) -> IdType {
+        match &self.link {
+            TableLink::Direct(column, _) => column.column_type.id_type(),
+            TableLink::Parent(parent_table, _) => parent_table.primary_key().column_type.id_type(),
+        }
+    }
+
+    fn and_filter(&self, mut out: AstPass<Pg>) -> QueryResult<()> {
+        if let Some(filter) = &self.query_filter {
+            out.push_sql("\n   and ");
+            filter.walk_ast(out)?
+        }
+        Ok(())
+    }
+
+    fn children_type_a(
+        &self,
+        column: &Column,
+        limit: ParentLimit<'_>,
+        block: BlockNumber,
+        out: &mut AstPass<Pg>,
+    ) -> QueryResult<()> {
+        assert!(column.is_list());
+
+        // Generate
+        //      from unnest({parent_ids}) as p(id)
+        //           cross join lateral
+        //           (select {column names}
+        //              from children c
+        //             where p.id = any(c.{parent_field})
+        //               and .. other conditions on c ..
+        //             order by c.{sort_key}
+        //             limit {first} offset {skip}) c
+        //     order by c.{sort_key}
+
+        out.push_sql("\n/* children_type_a */  from unnest(");
+        column.bind_ids(&self.ids, out)?;
+        out.push_sql(") as p(id) cross join lateral (select ");
+        write_column_names(&self.column_names, self.table, out)?;
+        out.push_sql(" from ");
+        out.push_sql(self.table.qualified_name.as_str());
+        out.push_sql(" c where ");
+        BlockRangeColumn::new(self.table, "c.", block).contains(out)?;
+        limit.filter(out);
+        out.push_sql(" and p.id = any(c.");
+        out.push_identifier(column.name.as_str())?;
+        out.push_sql(")");
+        self.and_filter(out.reborrow())?;
+        limit.restrict(out)?;
+        out.push_sql(") c");
+        Ok(())
+    }
+
+    fn child_type_a(
+        &self,
+        column: &Column,
+        limit: ParentLimit<'_>,
+        block: BlockNumber,
+        out: &mut AstPass<Pg>,
+    ) -> QueryResult<()> {
+        assert!(column.is_list());
+
+        // Generate
+        //      from unnest({parent_ids}) as p(id),
+        //           children c
+        //     where c.{parent_field} @> array[p.id]
+        //       and c.{parent_field} && {parent_ids}
+        //       and .. other conditions on c ..
+        //     limit {parent_ids.len} + 1
+        //
+        // The redundant `&&` clause is only added when we have fewer than
+        // TYPEA_BATCH_SIZE children and helps Postgres to narrow down the
+        // rows it needs to pick from `children` to join with `p(id)`
+        out.push_sql("\n/* child_type_a */ from unnest(");
+        column.bind_ids(&self.ids, out)?;
+        out.push_sql(") as p(id), ");
+        out.push_sql(self.table.qualified_name.as_str());
+        out.push_sql(" c where ");
+        BlockRangeColumn::new(self.table, "c.", block).contains(out)?;
+        limit.filter(out);
+        out.push_sql(" and c.");
+        out.push_identifier(column.name.as_str())?;
+        out.push_sql(" @> array[p.id]");
+        if self.ids.len() < ENV_VARS.store.typea_batch_size {
+            out.push_sql(" and c.");
+            out.push_identifier(column.name.as_str())?;
+            out.push_sql(" && ");
+            column.bind_ids(&self.ids, out)?;
+        }
+        self.and_filter(out.reborrow())?;
+        limit.single_limit(self.ids.len(), out);
+        Ok(())
+    }
+
+    fn children_type_b(
+        &self,
+        column: &Column,
+        limit: ParentLimit<'_>,
+        block: BlockNumber,
+        out: &mut AstPass<Pg>,
+    ) -> QueryResult<()> {
+        assert!(!column.is_list());
+
+        // Generate
+        //      from unnest({parent_ids}) as p(id)
+        //           cross join lateral
+        //           (select {column names}
+        //              from children c
+        //             where p.id = c.{parent_field}
+        //               and .. other conditions on c ..
+        //             order by c.{sort_key}
+        //             limit {first} offset {skip}) c
+        //     order by c.{sort_key}
+
+        out.push_sql("\n/* children_type_b */  from unnest(");
+        column.bind_ids(&self.ids, out)?;
+        out.push_sql(") as p(id) cross join lateral (select ");
+        write_column_names(&self.column_names, self.table, out)?;
+        out.push_sql(" from ");
+        out.push_sql(self.table.qualified_name.as_str());
+        out.push_sql(" c where ");
+        BlockRangeColumn::new(self.table, "c.", block).contains(out)?;
+        limit.filter(out);
+        out.push_sql(" and p.id = c.");
+        out.push_identifier(column.name.as_str())?;
+        self.and_filter(out.reborrow())?;
+        limit.restrict(out)?;
+        out.push_sql(") c");
+        Ok(())
+    }
+
+    fn child_type_b(
+        &self,
+        column: &Column,
+        limit: ParentLimit<'_>,
+        block: BlockNumber,
+        out: &mut AstPass<Pg>,
+    ) -> QueryResult<()> {
+        assert!(!column.is_list());
+
+        // Generate
+        //      from unnest({parent_ids}) as p(id), children c
+        //     where c.{parent_field} = p.id
+        //       and .. other conditions on c ..
+        //     limit {parent_ids.len} + 1
+
+        out.push_sql("\n/* child_type_b */  from unnest(");
+        column.bind_ids(&self.ids, out)?;
+        out.push_sql(") as p(id), ");
+        out.push_sql(self.table.qualified_name.as_str());
+        out.push_sql(" c where ");
+        BlockRangeColumn::new(self.table, "c.", block).contains(out)?;
+        limit.filter(out);
+        out.push_sql(" and p.id = c.");
+        out.push_identifier(column.name.as_str())?;
+        self.and_filter(out.reborrow())?;
+        limit.single_limit(self.ids.len(), out);
+        Ok(())
+    }
+
+    fn children_type_c(
+        &self,
+        parent_primary_key: &Column,
+        child_ids: &[Vec<Option<SafeString>>],
+        limit: ParentLimit<'_>,
+        block: BlockNumber,
+        out: &mut AstPass<Pg>,
+    ) -> QueryResult<()> {
+        // Generate
+        //      from rows from (unnest({parent_ids}), reduce_dim({child_id_matrix}))
+        //                  as p(id, child_ids)
+        //           cross join lateral
+        //           (select {column names}
+        //              from children c
+        //             where c.id = any(p.child_ids)
+        //               and .. other conditions on c ..
+        //             order by c.{sort_key}
+        //             limit {first} offset {skip}) c
+        //     order by c.{sort_key}
+
+        out.push_sql("\n/* children_type_c */  from ");
+        out.push_sql("rows from (unnest(");
+        parent_primary_key.bind_ids(&self.ids, out)?;
+        out.push_sql("), reduce_dim(");
+        self.table.primary_key().push_matrix(child_ids, out)?;
+        out.push_sql(")) as p(id, child_ids)");
+        out.push_sql(" cross join lateral (select ");
+        write_column_names(&self.column_names, self.table, out)?;
+        out.push_sql(" from ");
+        out.push_sql(self.table.qualified_name.as_str());
+        out.push_sql(" c where ");
+        BlockRangeColumn::new(self.table, "c.", block).contains(out)?;
+        limit.filter(out);
+        out.push_sql(" and c.id = any(p.child_ids)");
+        self.and_filter(out.reborrow())?;
+        limit.restrict(out)?;
+        out.push_sql(") c");
+        Ok(())
+    }
+
+    fn child_type_d(
+        &self,
+        child_ids: &[String],
+        limit: ParentLimit<'_>,
+        block: BlockNumber,
+        out: &mut AstPass<Pg>,
+    ) -> QueryResult<()> {
+        // Generate
+        //      from rows from (unnest({parent_ids}), unnest({child_ids})) as p(id, child_id),
+        //           children c
+        //     where c.id = p.child_id
+        //       and .. other conditions on c ..
+
+        out.push_sql("\n/* child_type_d */ from rows from (unnest(");
+        out.push_bind_param::<Array<Text>, _>(&self.ids)?;
+        out.push_sql("), unnest(");
+        self.table.primary_key().bind_ids(child_ids, out)?;
+        out.push_sql(")) as p(id, child_id), ");
+        out.push_sql(self.table.qualified_name.as_str());
+        out.push_sql(" c where ");
+        BlockRangeColumn::new(self.table, "c.", block).contains(out)?;
+        limit.filter(out);
+
+        // Include a constraint on the child IDs as a set if the size of the set
+        // is below the threshold set by environment variable. Set it to
+        // 0 to turn off this optimization.
+        if ENV_VARS.store.typed_children_set_size > 0 {
+            let mut child_set: Vec<&str> = child_ids.iter().map(|id| id.as_str()).collect();
+            child_set.sort_unstable();
+            child_set.dedup();
+
+            if child_set.len() <= ENV_VARS.store.typed_children_set_size {
+                out.push_sql(" and c.id = any(");
+                self.table.primary_key().bind_ids(&child_set, out)?;
+                out.push_sql(")");
+            }
+        }
+        out.push_sql(" and ");
+        out.push_sql("c.id = p.child_id");
+        self.and_filter(out.reborrow())?;
+        limit.single_limit(self.ids.len(), out);
+        Ok(())
+    }
+
+    fn children(
+        &self,
+        limit: ParentLimit<'_>,
+        block: BlockNumber,
+        mut out: AstPass<Pg>,
+    ) -> QueryResult<()> {
+        match &self.link {
+            TableLink::Direct(column, multiplicity) => {
+                use ChildMultiplicity::*;
+                if column.is_list() {
+                    match multiplicity {
+                        Many => self.children_type_a(column, limit, block, &mut out),
+                        Single => self.child_type_a(column, limit, block, &mut out),
+                    }
+                } else {
+                    match multiplicity {
+                        Many => self.children_type_b(column, limit, block, &mut out),
+                        Single => self.child_type_b(column, limit, block, &mut out),
+                    }
+                }
+            }
+            TableLink::Parent(parent_table, ParentIds::List(child_ids)) => self.children_type_c(
+                parent_table.primary_key(),
+                child_ids,
+                limit,
+                block,
+                &mut out,
+            ),
+            TableLink::Parent(_, ParentIds::Scalar(child_ids)) => {
+                self.child_type_d(child_ids, limit, block, &mut out)
+            }
+        }
+    }
+
+    /// Select a basic subset of columns from the child table for use in
+    /// the `matches` CTE of queries that need to retrieve entities of
+    /// different types or entities that link differently to their parents
+    fn children_uniform(
+        &self,
+        sort_key: &SortKey,
+        block: BlockNumber,
+        mut out: AstPass<Pg>,
+    ) -> QueryResult<()> {
+        out.push_sql("select '");
+        out.push_sql(self.table.object.as_str());
+        out.push_sql("' as entity, c.id, c.vid, p.id::text as g$parent_id");
+        sort_key.select(&mut out)?;
+        self.children(ParentLimit::Outer, block, out)
+    }
+
+    /// Collect all the parent id's from all windows
+    fn collect_parents(windows: &[FilterWindow]) -> Vec<String> {
+        let parent_ids: HashSet<String> = HashSet::from_iter(
+            windows
+                .iter()
+                .map(|window| window.ids.iter().cloned())
+                .flatten(),
+        );
+        parent_ids.into_iter().collect()
+    }
+}
+
+/// This is a parallel to `EntityCollection`, but with entity type names
+/// and filters translated in a form ready for SQL generation
+#[derive(Debug, Clone)]
+pub enum FilterCollection<'a> {
+    /// Collection made from all entities in a table; each entry is the table
+    /// and the filter to apply to it, checked and bound to that table
+    All(Vec<(&'a Table, Option<QueryFilter<'a>>, AttributeNames)>),
+    /// Collection made from windows of the same or different entity types
+    SingleWindow(FilterWindow<'a>),
+    MultiWindow(Vec<FilterWindow<'a>>, Vec<String>),
+}
+
+/// String representation that is useful for debugging when `walk_ast` fails
+impl<'a> fmt::Display for FilterCollection<'a> {
+    fn fmt(&self, f: &mut fmt::Formatter) -> Result<(), std::fmt::Error> {
+        fn fmt_table(
+            f: &mut fmt::Formatter,
+            table: &Table,
+            attrs: &AttributeNames,
+            filter: &Option<QueryFilter>,
+        ) -> Result<(), std::fmt::Error> {
+            write!(f, "{}[", table.qualified_name.as_str().replace("\\\"", ""))?;
+            match attrs {
+                AttributeNames::All => write!(f, "*")?,
+                AttributeNames::Select(cols) => write!(f, "{}", cols.iter().join(","))?,
+            };
+            write!(f, "]")?;
+            if let Some(filter) = filter {
+                write!(f, "{{{}}}", filter)?;
+            }
+            Ok(())
+        }
+
+        fn fmt_window(f: &mut fmt::Formatter, w: &FilterWindow) -> Result<(), std::fmt::Error> {
+            let FilterWindow {
+                table,
+                query_filter,
+                ids,
+                link,
+                column_names,
+            } = w;
+            fmt_table(f, table, column_names, query_filter)?;
+            if !ids.is_empty() {
+                use ChildMultiplicity::*;
+
+                write!(f, "<")?;
+
+                match link {
+                    TableLink::Direct(col, Single) => {
+                        write!(f, "uniq:{}={}", col.name(), ids.join(","))?
+                    }
+                    TableLink::Direct(col, Many) => {
+                        write!(f, "many:{}={}", col.name(), ids.join(","))?
+                    }
+                    TableLink::Parent(_, ParentIds::List(css)) => {
+                        let css = css
+                            .into_iter()
+                            .map(|cs| {
+                                cs.into_iter()
+                                    .filter_map(|c| c.as_ref().map(|s| &s.0))
+                                    .join(",")
+                            })
+                            .join("],[");
+                        write!(f, "uniq:id=[{}]", css)?
+                    }
+                    TableLink::Parent(_, ParentIds::Scalar(cs)) => {
+                        write!(f, "uniq:id={}", cs.join(","))?
+                    }
+                };
+                write!(f, " for {}>", ids.join(","))?;
+            }
+            Ok(())
+        }
+
+        match self {
+            FilterCollection::All(tables) => {
+                for (table, filter, attrs) in tables {
+                    fmt_table(f, table, attrs, filter)?;
+                }
+            }
+            FilterCollection::SingleWindow(w) => {
+                fmt_window(f, w)?;
+            }
+            FilterCollection::MultiWindow(ws, _ps) => {
+                let mut first = true;
+                for w in ws {
+                    if !first {
+                        write!(f, ", ")?
+                    }
+                    fmt_window(f, w)?;
+                    first = false;
+                }
+            }
+        }
+        Ok(())
+    }
+}
+
+impl<'a> FilterCollection<'a> {
+    pub fn new(
+        layout: &'a Layout,
+        collection: EntityCollection,
+        filter: Option<&'a EntityFilter>,
+        block: BlockNumber,
+    ) -> Result<Self, QueryExecutionError> {
+        match collection {
+            EntityCollection::All(entities) => {
+                // This is a little ugly since we need to propagate errors
+                // from the inner closures. We turn each entity type name
+                // into the corresponding table, and check and bind the filter
+                // to it
+                let entities = entities
+                    .iter()
+                    .map(|(entity, column_names)| {
+                        layout
+                            .table_for_entity(entity)
+                            .map(|rc| rc.as_ref())
+                            .and_then(|table| {
+                                filter
+                                    .map(|filter| QueryFilter::new(filter, table, layout, block))
+                                    .transpose()
+                                    .map(|filter| (table, filter, column_names.clone()))
+                            })
+                    })
+                    .collect::<Result<Vec<_>, _>>()?;
+                Ok(FilterCollection::All(entities))
+            }
+            EntityCollection::Window(windows) => {
+                let windows = windows
+                    .into_iter()
+                    .map(|window| FilterWindow::new(layout, window, filter, block))
+                    .collect::<Result<Vec<_>, _>>()?;
+                let collection = if windows.len() == 1 {
+                    let mut windows = windows;
+                    FilterCollection::SingleWindow(
+                        windows.pop().expect("we just checked there is an element"),
+                    )
+                } else {
+                    let parent_ids = FilterWindow::collect_parents(&windows);
+                    FilterCollection::MultiWindow(windows, parent_ids)
+                };
+                Ok(collection)
+            }
+        }
+    }
+
+    fn first_table(&self) -> Option<&Table> {
+        match self {
+            FilterCollection::All(entities) => entities.first().map(|pair| pair.0),
+            FilterCollection::SingleWindow(window) => Some(window.table),
+            FilterCollection::MultiWindow(windows, _) => windows.first().map(|window| window.table),
+        }
+    }
+
+    fn is_empty(&self) -> bool {
+        match self {
+            FilterCollection::All(entities) => entities.is_empty(),
+            FilterCollection::SingleWindow(_) => false,
+            FilterCollection::MultiWindow(windows, _) => windows.is_empty(),
+        }
+    }
+
+    fn all_mutable(&self) -> bool {
+        match self {
+            FilterCollection::All(entities) => entities.iter().all(|(table, ..)| !table.immutable),
+            FilterCollection::SingleWindow(window) => !window.table.immutable,
+            FilterCollection::MultiWindow(windows, _) => {
+                windows.iter().all(|window| !window.table.immutable)
+            }
+        }
+    }
+
+    /// Return the id type of the fields in the parents for which the query
+    /// produces children. This is `None` if there are no parents, i.e., for
+    /// a toplevel query.
+    pub(crate) fn parent_type(&self) -> Result<Option<IdType>, StoreError> {
+        match self {
+            FilterCollection::All(_) => Ok(None),
+            FilterCollection::SingleWindow(window) => Ok(Some(window.parent_type())),
+            FilterCollection::MultiWindow(windows, _) => {
+                if windows.iter().map(FilterWindow::parent_type).all_equal() {
+                    Ok(Some(windows[0].parent_type().to_owned()))
+                } else {
+                    Err(graph::constraint_violation!(
+                        "all implementors of an interface must use the same type for their `id`"
+                    ))
+                }
+            }
+        }
+    }
+}
+
+/// Convenience to pass the name of the column to order by around. If `name`
+/// is `None`, the sort key should be ignored
+#[derive(Debug, Copy, Clone)]
+pub enum SortKey<'a> {
+    None,
+    /// Order by `id asc`
+    IdAsc(Option<BlockRangeColumn<'a>>),
+    /// Order by `id desc`
+    IdDesc(Option<BlockRangeColumn<'a>>),
+    /// Order by some other column; `column` will never be `id`
+    Key {
+        column: &'a Column,
+        value: Option<&'a str>,
+        direction: &'static str,
+    },
+}
+
+/// String representation that is useful for debugging when `walk_ast` fails
+impl<'a> fmt::Display for SortKey<'a> {
+    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
+        use SortKey::*;
+
+        match self {
+            None => write!(f, "none"),
+            IdAsc(Option::None) => write!(f, "{}", PRIMARY_KEY_COLUMN),
+            IdAsc(Some(br)) => write!(f, "{}, {}", PRIMARY_KEY_COLUMN, br.column_name()),
+            IdDesc(Option::None) => write!(f, "{} desc", PRIMARY_KEY_COLUMN),
+            IdDesc(Some(br)) => write!(f, "{} desc, {} desc", PRIMARY_KEY_COLUMN, br.column_name()),
+            Key {
+                column,
+                value: _,
+                direction,
+            } => write!(
+                f,
+                "{} {}, {} {}",
+                column.name.as_str(),
+                direction,
+                PRIMARY_KEY_COLUMN,
+                direction
+            ),
+        }
+    }
+}
+
+impl<'a> SortKey<'a> {
+    fn new(
+        order: EntityOrder,
+        collection: &'a FilterCollection,
+        filter: Option<&'a EntityFilter>,
+        block: BlockNumber,
+    ) -> Result<Self, QueryExecutionError> {
+        const ASC: &str = "asc";
+        const DESC: &str = "desc";
+
+        fn with_key<'a>(
+            table: &'a Table,
+            attribute: String,
+            filter: Option<&'a EntityFilter>,
+            direction: &'static str,
+            br_column: Option<BlockRangeColumn<'a>>,
+        ) -> Result<SortKey<'a>, QueryExecutionError> {
+            let column = table.column_for_field(&attribute)?;
+            if column.is_fulltext() {
+                match filter {
+                    Some(EntityFilter::Equal(_, value)) => {
+                        let sort_value = value.as_str();
+
+                        Ok(SortKey::Key {
+                            column,
+                            value: sort_value,
+                            direction,
+                        })
+                    }
+                    _ => unreachable!(),
+                }
+            } else if column.is_primary_key() {
+                match direction {
+                    ASC => Ok(SortKey::IdAsc(br_column)),
+                    DESC => Ok(SortKey::IdDesc(br_column)),
+                    _ => unreachable!("direction is 'asc' or 'desc'"),
+                }
+            } else {
+                Ok(SortKey::Key {
+                    column,
+                    value: None,
+                    direction,
+                })
+            }
+        }
+
+        // If there is more than one table, we are querying an interface,
+        // and the order is on an attribute in that interface so that all
+        // tables have a column for that. It is therefore enough to just
+        // look at the first table to get the name
+        let table = collection
+            .first_table()
+            .expect("an entity query always contains at least one entity type/table");
+
+        let br_column = if collection.all_mutable() && ENV_VARS.store.order_by_block_range {
+            Some(BlockRangeColumn::new(table, "c.", block))
+        } else {
+            None
+        };
+
+        match order {
+            EntityOrder::Ascending(attr, _) => with_key(table, attr, filter, ASC, br_column),
+            EntityOrder::Descending(attr, _) => with_key(table, attr, filter, DESC, br_column),
+            EntityOrder::Default => Ok(SortKey::IdAsc(br_column)),
+            EntityOrder::Unordered => Ok(SortKey::None),
+        }
+    }
+
+    /// Generate selecting the sort key if it is needed
+    fn select(&self, out: &mut AstPass<Pg>) -> QueryResult<()> {
+        match self {
+            SortKey::None => Ok(()),
+            SortKey::IdAsc(br_column) | SortKey::IdDesc(br_column) => {
+                if let Some(br_column) = br_column {
+                    out.push_sql(", ");
+                    br_column.name(out);
+                }
+                Ok(())
+            }
+            SortKey::Key {
+                column,
+                value: _,
+                direction: _,
+            } => {
+                if column.is_primary_key() {
+                    return Err(constraint_violation!("SortKey::Key never uses 'id'"));
+                }
+                out.push_sql(", c.");
+                out.push_identifier(column.name.as_str())?;
+                Ok(())
+            }
+        }
+    }
+
+    /// Generate
+    ///   order by [name direction], id
+    fn order_by(&self, out: &mut AstPass<Pg>) -> QueryResult<()> {
+        match self {
+            SortKey::None => Ok(()),
+            SortKey::IdAsc(br_column) => {
+                out.push_sql("order by ");
+                out.push_identifier(PRIMARY_KEY_COLUMN)?;
+                if let Some(br_column) = br_column {
+                    out.push_sql(", ");
+                    br_column.bare_name(out);
+                }
+                Ok(())
+            }
+            SortKey::IdDesc(br_column) => {
+                out.push_sql("order by ");
+                out.push_identifier(PRIMARY_KEY_COLUMN)?;
+                out.push_sql(" desc");
+                if let Some(br_column) = br_column {
+                    out.push_sql(", ");
+                    br_column.bare_name(out);
+                    out.push_sql(" desc");
+                }
+                Ok(())
+            }
+            SortKey::Key {
+                column,
+                value,
+                direction,
+            } => {
+                out.push_sql("order by ");
+                SortKey::sort_expr(column, value, direction, out)
+            }
+        }
+    }
+
+    /// Generate
+    ///   order by g$parent_id, [name direction], id
+    fn order_by_parent(&self, out: &mut AstPass<Pg>) -> QueryResult<()> {
+        match self {
+            SortKey::None => Ok(()),
+            SortKey::IdAsc(_) => {
+                out.push_sql("order by g$parent_id, ");
+                out.push_identifier(PRIMARY_KEY_COLUMN)
+            }
+            SortKey::IdDesc(_) => {
+                out.push_sql("order by g$parent_id, ");
+                out.push_identifier(PRIMARY_KEY_COLUMN)?;
+                out.push_sql(" desc");
+                Ok(())
+            }
+            SortKey::Key {
+                column,
+                value,
+                direction,
+            } => {
+                out.push_sql("order by g$parent_id, ");
+                SortKey::sort_expr(column, value, direction, out)
+            }
+        }
+    }
+
+    /// Generate
+    ///   [name direction,] id
+    fn sort_expr(
+        column: &Column,
+        value: &Option<&str>,
+        direction: &str,
+        out: &mut AstPass<Pg>,
+    ) -> QueryResult<()> {
+        if column.is_primary_key() {
+            // This shouldn't happen since we'd use SortKey::IdAsc/Desc
+            return Err(constraint_violation!(
+                "sort_expr called with primary key column"
+            ));
+        }
+
+        match &column.column_type {
+            ColumnType::TSVector(config) => {
+                let algorithm = match config.algorithm {
+                    FulltextAlgorithm::Rank => "ts_rank(",
+                    FulltextAlgorithm::ProximityRank => "ts_rank_cd(",
+                };
+                out.push_sql(algorithm);
+                let name = column.name.as_str();
+                out.push_identifier(name)?;
+                out.push_sql(", to_tsquery(");
+
+                out.push_bind_param::<Text, _>(&value.unwrap())?;
+                out.push_sql("))");
+            }
+            _ => {
+                let name = column.name.as_str();
+                out.push_identifier(name)?;
+            }
+        }
+        if ENV_VARS.store.reversible_order_by_off {
+            // Old behavior
+            out.push_sql(" ");
+            out.push_sql(direction);
+            out.push_sql(" nulls last");
+            out.push_sql(", ");
+            out.push_identifier(PRIMARY_KEY_COLUMN)?;
+        } else {
+            out.push_sql(" ");
+            out.push_sql(direction);
+            out.push_sql(", ");
+            out.push_identifier(PRIMARY_KEY_COLUMN)?;
+            out.push_sql(" ");
+            out.push_sql(direction);
+        }
+        Ok(())
+    }
+}
+
+/// Generate `[limit {first}] [offset {skip}]
+#[derive(Debug, Clone)]
+pub struct FilterRange(EntityRange);
+
+/// String representation that is useful for debugging when `walk_ast` fails
+impl fmt::Display for FilterRange {
+    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
+        if let Some(first) = self.0.first {
+            write!(f, "first {}", first)?;
+            if self.0.skip > 0 {
+                write!(f, " ")?;
+            }
+        }
+        if self.0.skip > 0 {
+            write!(f, "skip {}", self.0.skip)?;
+        }
+        Ok(())
+    }
+}
+
+impl QueryFragment<Pg> for FilterRange {
+    fn walk_ast(&self, mut out: AstPass<Pg>) -> QueryResult<()> {
+        let range = &self.0;
+        if let Some(first) = &range.first {
+            out.push_sql("\n limit ");
+            out.push_sql(&first.to_string());
+        }
+        if range.skip > 0 {
+            out.push_sql("\noffset ");
+            out.push_sql(&range.skip.to_string());
+        }
+        Ok(())
+    }
+}
+
+/// The parallel to `EntityQuery`.
+///
+/// Details of how query generation for `FilterQuery` works can be found
+/// `https://github.com/graphprotocol/rfcs/blob/master/engineering-plans/0001-graphql-query-prefetching.md`
+#[derive(Debug, Clone)]
+pub struct FilterQuery<'a> {
+    collection: &'a FilterCollection<'a>,
+    sort_key: SortKey<'a>,
+    range: FilterRange,
+    block: BlockNumber,
+    query_id: Option<String>,
+}
+
+/// String representation that is useful for debugging when `walk_ast` fails
+impl<'a> fmt::Display for FilterQuery<'a> {
+    fn fmt(&self, f: &mut fmt::Formatter) -> Result<(), std::fmt::Error> {
+        write!(
+            f,
+            "from {} order {} {} at {}",
+            &self.collection, &self.sort_key, &self.range, self.block
+        )?;
+        if let Some(query_id) = &self.query_id {
+            write!(f, " query_id {}", query_id)?;
+        }
+        Ok(())
+    }
+}
+
+impl<'a> FilterQuery<'a> {
+    pub fn new(
+        collection: &'a FilterCollection,
+        filter: Option<&'a EntityFilter>,
+        order: EntityOrder,
+        range: EntityRange,
+        block: BlockNumber,
+        query_id: Option<String>,
+    ) -> Result<Self, QueryExecutionError> {
+        let sort_key = SortKey::new(order, collection, filter, block)?;
+
+        Ok(FilterQuery {
+            collection,
+            sort_key,
+            range: FilterRange(range),
+            block,
+            query_id,
+        })
+    }
+
+    /// Generate
+    ///     from schema.table c
+    ///    where block_range @> $block
+    ///      and query_filter
+    /// Only used when the query is against a `FilterCollection::All`, i.e.
+    /// when we do not need to window
+    fn filtered_rows(
+        &self,
+        table: &Table,
+        table_filter: &Option<QueryFilter<'a>>,
+        mut out: AstPass<Pg>,
+    ) -> QueryResult<()> {
+        out.push_sql("\n  from ");
+        out.push_sql(table.qualified_name.as_str());
+        out.push_sql(" c");
+
+        out.push_sql("\n where ");
+        BlockRangeColumn::new(&table, "c.", self.block).contains(&mut out)?;
+        if let Some(filter) = table_filter {
+            out.push_sql(" and ");
+            filter.walk_ast(out.reborrow())?;
+        }
+        out.push_sql("\n");
+        Ok(())
+    }
+
+    fn select_entity_and_data(table: &Table, out: &mut AstPass<Pg>) {
+        out.push_sql("select '");
+        out.push_sql(table.object.as_str());
+        out.push_sql("' as entity, to_jsonb(c.*) as data");
+    }
+
+    /// Only one table/filter pair, and no window
+    ///
+    /// The generated query makes sure we only convert the rows we actually
+    /// want to retrieve to JSONB
+    ///
+    ///   select '..' as entity, to_jsonb(e.*) as data
+    ///     from
+    ///       (select {column names}
+    ///          from table c
+    ///         where block_range @> $block
+    ///           and filter
+    ///         order by .. limit .. skip ..) c
+    fn query_no_window_one_entity(
+        &self,
+        table: &Table,
+        filter: &Option<QueryFilter>,
+        mut out: AstPass<Pg>,
+        column_names: &AttributeNames,
+    ) -> QueryResult<()> {
+        Self::select_entity_and_data(table, &mut out);
+        out.push_sql(" from (select ");
+        write_column_names(column_names, table, &mut out)?;
+        self.filtered_rows(table, filter, out.reborrow())?;
+        out.push_sql("\n ");
+        self.sort_key.order_by(&mut out)?;
+        self.range.walk_ast(out.reborrow())?;
+        out.push_sql(") c");
+        Ok(())
+    }
+
+    /// Only one table/filter pair, and a window
+    ///
+    /// Generate a query
+    ///   select '..' as entity, to_jsonb(e.*) as data
+    ///     from (select c.*, p.id as g$parent_id from {window.children(...)}) c
+    ///     order by c.g$parent_id, {sort_key}
+    ///     limit {first} offset {skip}
+    fn query_window_one_entity(
+        &self,
+        window: &FilterWindow,
+        mut out: AstPass<Pg>,
+    ) -> QueryResult<()> {
+        Self::select_entity_and_data(&window.table, &mut out);
+        out.push_sql(" from (\n");
+        out.push_sql("select c.*, p.id::text as g$parent_id");
+        window.children(
+            ParentLimit::Ranked(&self.sort_key, &self.range),
+            self.block,
+            out.reborrow(),
+        )?;
+        out.push_sql(") c");
+        out.push_sql("\n ");
+        self.sort_key.order_by_parent(&mut out)
+    }
+
+    /// No windowing, but multiple entity types
+    fn query_no_window(
+        &self,
+        entities: &[(&Table, Option<QueryFilter>, AttributeNames)],
+        mut out: AstPass<Pg>,
+    ) -> QueryResult<()> {
+        // We have multiple tables which might have different schemas since
+        // the entity_types come from implementing the same interface. We
+        // need to do the query in two steps: first we build a CTE with the
+        // id's of entities matching the filter and order/limit. As a second
+        // step, we get matching rows from the underlying tables and convert
+        // them to JSONB.
+        //
+        // Overall, we generate a query
+        //
+        // with matches as (
+        //   select '...' as entity, id, vid, {sort_key}
+        //     from {table} c
+        //    where {query_filter}
+        //    union all
+        //    ...
+        //    order by {sort_key}
+        //    limit n offset m)
+        //
+        // select m.entity, to_jsonb({column names}) as data, c.id, c.{sort_key}
+        //   from {table} c, matches m
+        //  where c.vid = m.vid and m.entity = '...'
+        //  union all
+        //  ...
+        //  order by c.{sort_key}
+
+        // Step 1: build matches CTE
+        out.push_sql("with matches as (");
+        for (i, (table, filter, _column_names)) in entities.iter().enumerate() {
+            if i > 0 {
+                out.push_sql("\nunion all\n");
+            }
+            // select '..' as entity,
+            //        c.id,
+            //        c.vid,
+            //        c.${sort_key}
+            out.push_sql("select '");
+            out.push_sql(table.object.as_str());
+            out.push_sql("' as entity, c.id, c.vid");
+            self.sort_key.select(&mut out)?;
+            self.filtered_rows(table, filter, out.reborrow())?;
+        }
+        out.push_sql("\n ");
+        self.sort_key.order_by(&mut out)?;
+        self.range.walk_ast(out.reborrow())?;
+
+        out.push_sql(")\n");
+
+        // Step 2: convert to JSONB
+        for (i, (table, _, column_names)) in entities.iter().enumerate() {
+            if i > 0 {
+                out.push_sql("\nunion all\n");
+            }
+            out.push_sql("select m.entity, ");
+            jsonb_build_object(column_names, "c", table, &mut out)?;
+            out.push_sql(" as data, c.id");
+            self.sort_key.select(&mut out)?;
+            out.push_sql("\n  from ");
+            out.push_sql(table.qualified_name.as_str());
+            out.push_sql(" c,");
+            out.push_sql(" matches m");
+            out.push_sql("\n where c.vid = m.vid and m.entity = ");
+            out.push_bind_param::<Text, _>(&table.object.as_str())?;
+        }
+        out.push_sql("\n ");
+        self.sort_key.order_by(&mut out)?;
+        Ok(())
+    }
+
+    /// Multiple windows
+    fn query_window(
+        &self,
+        windows: &[FilterWindow],
+        parent_ids: &[String],
+        mut out: AstPass<Pg>,
+    ) -> QueryResult<()> {
+        // Note that a CTE is an optimization fence, and since we use
+        // `matches` multiple times, we actually want to materialize it first
+        // before we fill in JSON data in the main query. As a consequence, we
+        // restrict the matches results per window in the `matches` CTE to
+        // avoid a possibly gigantic materialized `matches` view rather than
+        // leave that to the main query
+        //
+        // Overall, we generate a query
+        //
+        // with matches as (
+        //     select c.*
+        //       from (select id from unnest({all_parent_ids}) as q(id)) q
+        //            cross join lateral
+        //            ({window.children_uniform("q")}
+        //             union all
+        //             ... range over all windows ...
+        //             order by c.{sort_key}
+        //             limit $first skip $skip) c)
+        //   select m.entity, to_jsonb(c.*) as data, m.parent_id
+        //     from matches m, {window.child_table} c
+        //    where c.vid = m.vid and m.entity = '{window.child_type}'
+        //    union all
+        //          ... range over all windows
+        //    order by parent_id, c.{sort_key}
+
+        // Step 1: build matches CTE
+        out.push_sql("with matches as (");
+        out.push_sql("select c.* from ");
+        out.push_sql("unnest(");
+        // windows always has at least 2 entries
+        windows[0].parent_type().bind_ids(&parent_ids, &mut out)?;
+        out.push_sql(") as q(id)\n");
+        out.push_sql(" cross join lateral (");
+        for (i, window) in windows.iter().enumerate() {
+            if i > 0 {
+                out.push_sql("\nunion all\n");
+            }
+            window.children_uniform(&self.sort_key, self.block, out.reborrow())?;
+        }
+        out.push_sql("\n");
+        self.sort_key.order_by(&mut out)?;
+        self.range.walk_ast(out.reborrow())?;
+        out.push_sql(") c)\n");
+
+        // Step 2: convert to JSONB
+        // If the parent is an interface, each implementation might store its
+        // relationship to the children in different ways, leading to multiple
+        // windows that use the same table for the children. We need to make
+        // sure each table only appears once in the 'union all' otherwise we'll
+        // duplicate entities in the result
+        // We only use a table's qualified name and object to save ourselves
+        // the hassle of making `Table` hashable
+        let unique_child_tables = windows
+            .iter()
+            .unique_by(|window| {
+                (
+                    &window.table.qualified_name,
+                    &window.table.object,
+                    &window.column_names,
+                )
+            })
+            .enumerate()
+            .into_iter();
+
+        for (i, window) in unique_child_tables {
+            if i > 0 {
+                out.push_sql("\nunion all\n");
+            }
+            out.push_sql("select m.*, ");
+            jsonb_build_object(&window.column_names, "c", window.table, &mut out)?;
+            out.push_sql("|| jsonb_build_object('g$parent_id', m.g$parent_id) as data");
+            out.push_sql("\n  from ");
+            out.push_sql(window.table.qualified_name.as_str());
+            out.push_sql(" c, matches m\n where c.vid = m.vid and m.entity = '");
+            out.push_sql(window.table.object.as_str());
+            out.push_sql("'");
+        }
+        out.push_sql("\n ");
+        self.sort_key.order_by_parent(&mut out)
+    }
+}
+
+impl<'a> QueryFragment<Pg> for FilterQuery<'a> {
+    fn walk_ast(&self, mut out: AstPass<Pg>) -> QueryResult<()> {
+        out.unsafe_to_cache_prepared();
+        if self.collection.is_empty() {
+            return Ok(());
+        }
+
+        if let Some(qid) = &self.query_id {
+            out.push_sql("/* qid: ");
+            out.push_sql(qid);
+            out.push_sql(" */\n");
+        }
+        // We generate four different kinds of queries, depending on whether
+        // we need to window and whether we query just one or multiple entity
+        // types/windows; the most complex situation is windowing with multiple
+        // entity types. The other cases let us simplify the generated SQL
+        // considerably and produces faster queries
+        //
+        // Details of how all this works can be found in
+        // `https://github.com/graphprotocol/rfcs/blob/master/engineering-plans/0001-graphql-query-prefetching.md`
+        match &self.collection {
+            FilterCollection::All(entities) => {
+                if entities.len() == 1 {
+                    let (table, filter, column_names) = entities
+                        .first()
+                        .expect("a query always uses at least one table");
+                    self.query_no_window_one_entity(table, filter, out, column_names)
+                } else {
+                    self.query_no_window(entities, out)
+                }
+            }
+            FilterCollection::SingleWindow(window) => self.query_window_one_entity(window, out),
+            FilterCollection::MultiWindow(windows, parent_ids) => {
+                self.query_window(windows, parent_ids, out)
+            }
+        }
+    }
+}
+
+impl<'a> QueryId for FilterQuery<'a> {
+    type QueryId = ();
+
+    const HAS_STATIC_QUERY_ID: bool = false;
+}
+
+impl<'a> LoadQuery<PgConnection, EntityData> for FilterQuery<'a> {
+    fn internal_load(self, conn: &PgConnection) -> QueryResult<Vec<EntityData>> {
+        conn.query_by_name(&self)
+    }
+}
+
+impl<'a, Conn> RunQueryDsl<Conn> for FilterQuery<'a> {}
+
+/// Reduce the upper bound of the current entry's block range to `block` as
+/// long as that does not result in an empty block range
+#[derive(Debug)]
+pub struct ClampRangeQuery<'a, S> {
+    table: &'a Table,
+    entity_ids: &'a [S],
+    br_column: BlockRangeColumn<'a>,
+}
+
+impl<'a, S> ClampRangeQuery<'a, S> {
+    pub fn new(
+        table: &'a Table,
+        entity_ids: &'a [S],
+        block: BlockNumber,
+    ) -> Result<Self, StoreError> {
+        if table.immutable {
+            Err(graph::constraint_violation!(
+                "immutable entities can not be deleted or updated (table `{}`)",
+                table.qualified_name
+            ))
+        } else {
+            let br_column = BlockRangeColumn::new(table, "", block);
+            Ok(Self {
+                table,
+                entity_ids,
+                br_column,
+            })
+        }
+    }
+}
+
+impl<'a, S> QueryFragment<Pg> for ClampRangeQuery<'a, S>
+where
+    S: AsRef<str> + diesel::serialize::ToSql<Text, Pg>,
+{
+    fn walk_ast(&self, mut out: AstPass<Pg>) -> QueryResult<()> {
+        // update table
+        //    set block_range = int4range(lower(block_range), $block)
+        //  where id in (id1, id2, ..., idN)
+        //    and block_range @> INTMAX
+        out.unsafe_to_cache_prepared();
+        out.push_sql("update ");
+        out.push_sql(self.table.qualified_name.as_str());
+        out.push_sql("\n   set ");
+        self.br_column.clamp(&mut out)?;
+        out.push_sql("\n where ");
+
+        self.table.primary_key().is_in(self.entity_ids, &mut out)?;
+        out.push_sql(" and (");
+        self.br_column.latest(&mut out);
+        out.push_sql(")");
+
+        Ok(())
+    }
+}
+
+impl<'a, S> QueryId for ClampRangeQuery<'a, S>
+where
+    S: AsRef<str> + diesel::serialize::ToSql<Text, Pg>,
+{
+    type QueryId = ();
+
+    const HAS_STATIC_QUERY_ID: bool = false;
+}
+
+impl<'a, S, Conn> RunQueryDsl<Conn> for ClampRangeQuery<'a, S> {}
+
+/// Helper struct for returning the id's touched by the RevertRemove and
+/// RevertExtend queries
+#[derive(QueryableByName, PartialEq, Eq, Hash)]
+pub struct ReturnedEntityData {
+    #[sql_type = "Text"]
+    pub id: String,
+}
+
+impl ReturnedEntityData {
+    /// Convert primary key ids from Postgres' internal form to the format we
+    /// use by stripping `\\x` off the front of bytes strings
+    fn bytes_as_str(table: &Table, mut data: Vec<ReturnedEntityData>) -> Vec<ReturnedEntityData> {
+        match table.primary_key().column_type.id_type() {
+            IdType::String => data,
+            IdType::Bytes => {
+                for entry in data.iter_mut() {
+                    entry.id = bytes_as_str(&entry.id);
+                }
+                data
+            }
+        }
+    }
+}
+
+/// A query that removes all versions whose block range lies entirely
+/// beyond `block`.
+#[derive(Debug, Clone)]
+pub struct RevertRemoveQuery<'a> {
+    table: &'a Table,
+    br_column: BlockRangeColumn<'a>,
+}
+
+impl<'a> RevertRemoveQuery<'a> {
+    pub fn new(table: &'a Table, block: BlockNumber) -> Self {
+        let br_column = BlockRangeColumn::new(table, "", block);
+        Self { table, br_column }
+    }
+}
+
+impl<'a> QueryFragment<Pg> for RevertRemoveQuery<'a> {
+    fn walk_ast(&self, mut out: AstPass<Pg>) -> QueryResult<()> {
+        out.unsafe_to_cache_prepared();
+
+        // Construct a query
+        //   delete from table
+        //    where lower(block_range) >= $block
+        //   returning id
+        out.push_sql("delete from ");
+        out.push_sql(self.table.qualified_name.as_str());
+        out.push_sql("\n where ");
+        self.br_column.changed_since(&mut out)?;
+        out.push_sql("\nreturning ");
+        out.push_sql(PRIMARY_KEY_COLUMN);
+        out.push_sql("::text");
+        Ok(())
+    }
+}
+
+impl<'a> QueryId for RevertRemoveQuery<'a> {
+    type QueryId = ();
+
+    const HAS_STATIC_QUERY_ID: bool = false;
+}
+
+impl<'a> LoadQuery<PgConnection, ReturnedEntityData> for RevertRemoveQuery<'a> {
+    fn internal_load(self, conn: &PgConnection) -> QueryResult<Vec<ReturnedEntityData>> {
+        conn.query_by_name(&self)
+            .map(|data| ReturnedEntityData::bytes_as_str(self.table, data))
+    }
+}
+
+impl<'a, Conn> RunQueryDsl<Conn> for RevertRemoveQuery<'a> {}
+
+/// A query that unclamps the block range of all versions that contain
+/// `block` by setting the upper bound of the block range to infinity.
+#[derive(Debug, Clone)]
+pub struct RevertClampQuery<'a> {
+    table: &'a Table,
+    block: BlockNumber,
+}
+impl<'a> RevertClampQuery<'a> {
+    pub(crate) fn new(table: &'a Table, block: BlockNumber) -> Result<Self, StoreError> {
+        if table.immutable {
+            Err(graph::constraint_violation!(
+                "can not revert clamping in immutable table `{}`",
+                table.qualified_name
+            ))
+        } else {
+            Ok(Self { table, block })
+        }
+    }
+}
+
+impl<'a> QueryFragment<Pg> for RevertClampQuery<'a> {
+    fn walk_ast(&self, mut out: AstPass<Pg>) -> QueryResult<()> {
+        out.unsafe_to_cache_prepared();
+
+        // Construct a query
+        //   update table
+        //     set block_range = int4range(lower(block_range), null)
+        //   where block_range @> $block
+        //     and not block_range @> INTMAX
+        //     and lower(block_range) <= $block
+        //     and coalesce(upper(block_range), INTMAX) > $block
+        //     and coalesce(upper(block_range), INTMAX) < INTMAX
+        //   returning id
+        //
+        // The query states the same thing twice, once in terms of ranges
+        // and once in terms of the range bounds. That makes it possible
+        // for Postgres to use either the exclusion index on the table
+        // or the BRIN index
+        out.push_sql("update ");
+        out.push_sql(self.table.qualified_name.as_str());
+        out.push_sql("\n   set ");
+        out.push_identifier(BLOCK_RANGE_COLUMN)?;
+        out.push_sql(" = int4range(lower(");
+        out.push_identifier(BLOCK_RANGE_COLUMN)?;
+        out.push_sql("), null)\n where ");
+        out.push_identifier(BLOCK_RANGE_COLUMN)?;
+        out.push_sql(" @> ");
+        out.push_bind_param::<Integer, _>(&self.block)?;
+        out.push_sql(" and not ");
+        out.push_sql(BLOCK_RANGE_CURRENT);
+        out.push_sql(" and lower(");
+        out.push_sql(BLOCK_RANGE_COLUMN);
+        out.push_sql(") <= ");
+        out.push_bind_param::<Integer, _>(&self.block)?;
+        out.push_sql(" and coalesce(upper(");
+        out.push_sql(BLOCK_RANGE_COLUMN);
+        out.push_sql("), 2147483647) > ");
+        out.push_bind_param::<Integer, _>(&self.block)?;
+        out.push_sql(" and coalesce(upper(");
+        out.push_sql(BLOCK_RANGE_COLUMN);
+        out.push_sql("), 2147483647) < 2147483647");
+        out.push_sql("\nreturning ");
+        out.push_sql(PRIMARY_KEY_COLUMN);
+        out.push_sql("::text");
+        Ok(())
+    }
+}
+
+impl<'a> QueryId for RevertClampQuery<'a> {
+    type QueryId = ();
+
+    const HAS_STATIC_QUERY_ID: bool = false;
+}
+
+impl<'a> LoadQuery<PgConnection, ReturnedEntityData> for RevertClampQuery<'a> {
+    fn internal_load(self, conn: &PgConnection) -> QueryResult<Vec<ReturnedEntityData>> {
+        conn.query_by_name(&self)
+            .map(|data| ReturnedEntityData::bytes_as_str(self.table, data))
+    }
+}
+
+impl<'a, Conn> RunQueryDsl<Conn> for RevertClampQuery<'a> {}
+
+#[test]
+fn block_number_max_is_i32_max() {
+    // The code in RevertClampQuery::walk_ast embeds i32::MAX
+    // aka BLOCK_NUMBER_MAX in strings for efficiency. This assertion
+    // makes sure that BLOCK_NUMBER_MAX still is what we think it is
+    assert_eq!(2147483647, graph::prelude::BLOCK_NUMBER_MAX);
+}
+
+/// Copy the data of one table to another table. All rows whose `vid` is in
+/// the range `[first_vid, last_vid]` will be copied
+#[derive(Debug, Clone)]
+pub struct CopyEntityBatchQuery<'a> {
+    src: &'a Table,
+    dst: &'a Table,
+    // A list of columns common between src and dst that
+    // need to be copied
+    columns: Vec<&'a Column>,
+    first_vid: i64,
+    last_vid: i64,
+}
+
+impl<'a> CopyEntityBatchQuery<'a> {
+    pub fn new(
+        dst: &'a Table,
+        src: &'a Table,
+        first_vid: i64,
+        last_vid: i64,
+    ) -> Result<Self, StoreError> {
+        let mut columns = Vec::new();
+        for dcol in &dst.columns {
+            if let Some(scol) = src.column(&dcol.name) {
+                if let Some(msg) = dcol.is_assignable_from(scol, &src.object) {
+                    return Err(anyhow!("{}", msg).into());
+                } else {
+                    columns.push(dcol);
+                }
+            } else if !dcol.is_nullable() {
+                return Err(anyhow!(
+                    "The attribute {}.{} is non-nullable, \
+                     but there is no such attribute in the source",
+                    dst.object,
+                    dcol.field
+                )
+                .into());
+            }
+        }
+
+        Ok(Self {
+            src,
+            dst,
+            columns,
+            first_vid,
+            last_vid,
+        })
+    }
+}
+
+impl<'a> QueryFragment<Pg> for CopyEntityBatchQuery<'a> {
+    fn walk_ast(&self, mut out: AstPass<Pg>) -> QueryResult<()> {
+        out.unsafe_to_cache_prepared();
+
+        // Construct a query
+        //   insert into {dst}({columns})
+        //   select {columns} from {src}
+        out.push_sql("insert into ");
+        out.push_sql(self.dst.qualified_name.as_str());
+        out.push_sql("(");
+        for column in &self.columns {
+            out.push_identifier(column.name.as_str())?;
+            out.push_sql(", ");
+        }
+        if self.dst.immutable {
+            out.push_sql(BLOCK_COLUMN);
+        } else {
+            out.push_sql(BLOCK_RANGE_COLUMN);
+        }
+        out.push_sql(")\nselect ");
+        for column in &self.columns {
+            out.push_identifier(column.name.as_str())?;
+            if let ColumnType::Enum(enum_type) = &column.column_type {
+                // Have Postgres convert to the right enum type
+                if column.is_list() {
+                    out.push_sql("::text[]::");
+                    out.push_sql(enum_type.name.as_str());
+                    out.push_sql("[]");
+                } else {
+                    out.push_sql("::text::");
+                    out.push_sql(enum_type.name.as_str());
+                }
+            }
+            out.push_sql(", ");
+        }
+        // Try to convert back and forth between mutable and immutable,
+        // though that can go wrong during the actual copying when going
+        // from mutable to immutable if any entity has ever been updated or
+        // deleted
+        match (self.src.immutable, self.dst.immutable) {
+            (true, true) => out.push_sql(BLOCK_COLUMN),
+            (true, false) => {
+                out.push_sql("int4range(");
+                out.push_sql(BLOCK_COLUMN);
+                out.push_sql(", null)");
+            }
+            (false, true) => {
+                // If this entity was mutated, we will find one version
+                // where the upper end of the block range will be finite.
+                // This check is necessary in case source entities were ony
+                // ever deleted, never updated. In that case we would
+                // erroneously undelete entities without this check
+                let checked_conversion = format!(
+                    r#"
+                case when upper_inf({BLOCK_RANGE_COLUMN})
+                     then lower({BLOCK_RANGE_COLUMN})
+                     else length(raise_exception_bytea('table {} for entity type {} can not be made immutable since it contains at least one mutated entity. vid = ' || vid)) end
+                "#,
+                    self.src.qualified_name,
+                    self.src.object.as_str()
+                );
+                out.push_sql(&checked_conversion);
+            }
+            (false, false) => out.push_sql(BLOCK_RANGE_COLUMN),
+        }
+        out.push_sql(" from ");
+        out.push_sql(self.src.qualified_name.as_str());
+        out.push_sql(" where vid >= ");
+        out.push_bind_param::<BigInt, _>(&self.first_vid)?;
+        out.push_sql(" and vid <= ");
+        out.push_bind_param::<BigInt, _>(&self.last_vid)?;
+        Ok(())
+    }
+}
+
+impl<'a> QueryId for CopyEntityBatchQuery<'a> {
+    type QueryId = ();
+
+    const HAS_STATIC_QUERY_ID: bool = false;
+}
+
+impl<'a, Conn> RunQueryDsl<Conn> for CopyEntityBatchQuery<'a> {}
+
+/// Helper struct for returning the id's touched by the RevertRemove and
+/// RevertExtend queries
+#[derive(QueryableByName, PartialEq, Eq, Hash)]
+pub struct CopyVid {
+    #[sql_type = "BigInt"]
+    pub vid: i64,
+}
+
+fn write_column_names(
+    column_names: &AttributeNames,
+    table: &Table,
+    out: &mut AstPass<Pg>,
+) -> QueryResult<()> {
+    match column_names {
+        AttributeNames::All => out.push_sql(" * "),
+        AttributeNames::Select(column_names) => {
+            let mut iterator = iter_column_names(column_names, table, true).peekable();
+            while let Some(column_name) = iterator.next() {
+                out.push_identifier(column_name)?;
+                if iterator.peek().is_some() {
+                    out.push_sql(", ");
+                }
+            }
+        }
+    }
+    Ok(())
+}
+
+fn jsonb_build_object(
+    column_names: &AttributeNames,
+    table_identifier: &str,
+    table: &Table,
+    out: &mut AstPass<Pg>,
+) -> QueryResult<()> {
+    match column_names {
+        AttributeNames::All => {
+            out.push_sql("to_jsonb(\"");
+            out.push_sql(table_identifier);
+            out.push_sql("\".*)");
+        }
+        AttributeNames::Select(column_names) => {
+            out.push_sql("jsonb_build_object(");
+            let mut iterator = iter_column_names(column_names, table, false).peekable();
+            while let Some(column_name) = iterator.next() {
+                // field name as json key
+                out.push_sql("'");
+                out.push_sql(column_name);
+                out.push_sql("', ");
+                // column identifier
+                out.push_sql(table_identifier);
+                out.push_sql(".");
+                out.push_identifier(column_name)?;
+                if iterator.peek().is_some() {
+                    out.push_sql(", ");
+                }
+            }
+            out.push_sql(")");
+        }
+    }
+    Ok(())
+}
+
+/// Helper function to iterate over the merged fields of BASE_SQL_COLUMNS and the provided attribute
+/// names, yielding valid SQL names for the given table.
+fn iter_column_names<'a, 'b>(
+    attribute_names: &'a BTreeSet<String>,
+    table: &'b Table,
+    include_block_range_column: bool,
+) -> impl Iterator<Item = &'b str> {
+    let extra = if include_block_range_column {
+        [BLOCK_RANGE_COLUMN].iter()
+    } else {
+        [].iter()
+    }
+    .copied();
+
+    attribute_names
+        .iter()
+        .map(|attribute_name| {
+            // Unwrapping: We have already checked that all attribute names exist in table
+            table.column_for_field(attribute_name).unwrap()
+        })
+        .map(|column| column.name.as_str())
+        .chain(BASE_SQL_COLUMNS.iter().copied())
+        .chain(extra)
+        .sorted()
+        .dedup()
+}
diff --git a/store/postgres/src/sql_value.rs b/store/postgres/src/sql_value.rs
new file mode 100644
index 0000000..bf20419
--- /dev/null
+++ b/store/postgres/src/sql_value.rs
@@ -0,0 +1,69 @@
+use diesel::pg::Pg;
+use diesel::serialize::{self, Output, ToSql};
+use diesel::sql_types::{Binary, Bool, Integer, Text};
+use graph::prelude::anyhow::anyhow;
+use std::io::Write;
+use std::str::FromStr;
+
+use graph::data::store::{scalar, Value};
+
+#[derive(Clone, Debug, PartialEq, AsExpression)]
+pub struct SqlValue(Value);
+
+impl SqlValue {
+    pub fn new_array(values: Vec<Value>) -> Vec<Self> {
+        values.into_iter().map(SqlValue).collect()
+    }
+}
+
+impl ToSql<Bool, Pg> for SqlValue {
+    fn to_sql<W: Write>(&self, out: &mut Output<W, Pg>) -> serialize::Result {
+        match &self.0 {
+            Value::Bool(b) => <bool as ToSql<Bool, Pg>>::to_sql(b, out),
+            v => Err(anyhow!(
+                "Failed to convert non-boolean attribute value to boolean in SQL: {}",
+                v
+            )
+            .into()),
+        }
+    }
+}
+
+impl ToSql<Integer, Pg> for SqlValue {
+    fn to_sql<W: Write>(&self, out: &mut Output<W, Pg>) -> serialize::Result {
+        match &self.0 {
+            Value::Int(i) => <i32 as ToSql<Integer, Pg>>::to_sql(i, out),
+            v => Err(anyhow!(
+                "Failed to convert non-int attribute value to int in SQL: {}",
+                v
+            )
+            .into()),
+        }
+    }
+}
+
+impl ToSql<Text, Pg> for SqlValue {
+    fn to_sql<W: Write>(&self, out: &mut Output<W, Pg>) -> serialize::Result {
+        match &self.0 {
+            Value::String(s) => <String as ToSql<Text, Pg>>::to_sql(s, out),
+            Value::Bytes(h) => <String as ToSql<Text, Pg>>::to_sql(&h.to_string(), out),
+            v => Err(anyhow!(
+                "Failed to convert attribute value to String or Bytes in SQL: {}",
+                v
+            )
+            .into()),
+        }
+    }
+}
+
+impl ToSql<Binary, Pg> for SqlValue {
+    fn to_sql<W: Write>(&self, out: &mut Output<W, Pg>) -> serialize::Result {
+        match &self.0 {
+            Value::Bytes(h) => <_ as ToSql<Binary, Pg>>::to_sql(&h.as_slice(), out),
+            Value::String(s) => {
+                <_ as ToSql<Binary, Pg>>::to_sql(scalar::Bytes::from_str(s)?.as_slice(), out)
+            }
+            v => Err(anyhow!("Failed to convert attribute value to Bytes in SQL: {}", v).into()),
+        }
+    }
+}
diff --git a/store/postgres/src/store.rs b/store/postgres/src/store.rs
new file mode 100644
index 0000000..5b3d5dd
--- /dev/null
+++ b/store/postgres/src/store.rs
@@ -0,0 +1,168 @@
+use async_trait::async_trait;
+use std::sync::Arc;
+
+use graph::{
+    components::{
+        server::index_node::VersionInfo,
+        store::{
+            BlockStore as BlockStoreTrait, QueryStoreManager, StatusStore, Store as StoreTrait,
+        },
+    },
+    constraint_violation,
+    data::subgraph::status,
+    prelude::{
+        tokio, web3::types::Address, BlockNumber, BlockPtr, CheapClone, DeploymentHash,
+        PartialBlockPtr, QueryExecutionError, StoreError,
+    },
+};
+
+use crate::{block_store::BlockStore, query_store::QueryStore, SubgraphStore};
+
+/// The overall store of the system, consisting of a [`SubgraphStore`] and a
+/// [`BlockStore`], each of which multiplex across multiple database shards.
+/// The `SubgraphStore` is responsible for storing all data and metadata related
+/// to individual subgraphs, and the `BlockStore` does the same for data belonging
+/// to the chains that are being processed.
+///
+/// This struct should only be used during configuration and setup of `graph-node`.
+/// Code that needs to access the store should use the traits from
+/// [`graph::components::store`] and only require the smallest traits that are
+/// suitable for their purpose.
+#[derive(Clone)]
+pub struct Store {
+    subgraph_store: Arc<SubgraphStore>,
+    block_store: Arc<BlockStore>,
+}
+
+impl Store {
+    pub fn new(subgraph_store: Arc<SubgraphStore>, block_store: Arc<BlockStore>) -> Self {
+        Self {
+            subgraph_store,
+            block_store,
+        }
+    }
+
+    pub fn subgraph_store(&self) -> Arc<SubgraphStore> {
+        self.subgraph_store.cheap_clone()
+    }
+
+    pub fn block_store(&self) -> Arc<BlockStore> {
+        self.block_store.cheap_clone()
+    }
+}
+
+impl StoreTrait for Store {
+    type BlockStore = BlockStore;
+    type SubgraphStore = SubgraphStore;
+
+    fn subgraph_store(&self) -> Arc<Self::SubgraphStore> {
+        self.subgraph_store.cheap_clone()
+    }
+
+    fn block_store(&self) -> Arc<Self::BlockStore> {
+        self.block_store.cheap_clone()
+    }
+}
+
+#[async_trait]
+impl QueryStoreManager for Store {
+    async fn query_store(
+        &self,
+        target: graph::data::query::QueryTarget,
+        for_subscription: bool,
+    ) -> Result<
+        Arc<dyn graph::prelude::QueryStore + Send + Sync>,
+        graph::prelude::QueryExecutionError,
+    > {
+        let store = self.subgraph_store.cheap_clone();
+        let api_version = target.get_version();
+        let target = target.clone();
+        let (store, site, replica) = graph::spawn_blocking_allow_panic(move || {
+            store
+                .replica_for_query(target.clone(), for_subscription)
+                .map_err(|e| e.into())
+        })
+        .await
+        .map_err(|e| QueryExecutionError::Panic(e.to_string()))
+        .and_then(|x| x)?;
+
+        let chain_store = self.block_store.chain_store(&site.network).ok_or_else(|| {
+            constraint_violation!(
+                "Subgraphs index a known network, but {} indexes `{}` which we do not know about. This is most likely a configuration error.",
+                site.deployment,
+                site.network
+            )
+        })?;
+
+        Ok(Arc::new(QueryStore::new(
+            store,
+            chain_store,
+            site,
+            replica,
+            Arc::new(api_version.clone()),
+        )))
+    }
+}
+
+#[async_trait]
+impl StatusStore for Store {
+    fn status(&self, filter: status::Filter) -> Result<Vec<status::Info>, StoreError> {
+        let mut infos = self.subgraph_store.status(filter)?;
+        let ptrs = self.block_store.chain_head_pointers()?;
+        for info in &mut infos {
+            for chain in &mut info.chains {
+                chain.chain_head_block = ptrs.get(&chain.network).map(|ptr| ptr.to_owned().into());
+            }
+        }
+        Ok(infos)
+    }
+
+    fn version_info(&self, version_id: &str) -> Result<VersionInfo, StoreError> {
+        let mut info = self.subgraph_store.version_info(version_id)?;
+
+        info.total_ethereum_blocks_count = self.block_store.chain_head_block(&info.network)?;
+
+        Ok(info)
+    }
+
+    fn versions_for_subgraph_id(
+        &self,
+        subgraph_id: &str,
+    ) -> Result<(Option<String>, Option<String>), StoreError> {
+        self.subgraph_store.versions_for_subgraph_id(subgraph_id)
+    }
+
+    fn subgraphs_for_deployment_hash(
+        &self,
+        deployment_hash: &str,
+    ) -> Result<Vec<(String, String)>, StoreError> {
+        self.subgraph_store
+            .subgraphs_for_deployment_hash(deployment_hash)
+    }
+
+    async fn get_proof_of_indexing(
+        &self,
+        subgraph_id: &DeploymentHash,
+        indexer: &Option<Address>,
+        block: BlockPtr,
+    ) -> Result<Option<[u8; 32]>, StoreError> {
+        self.subgraph_store
+            .get_proof_of_indexing(subgraph_id, indexer, block)
+            .await
+    }
+
+    async fn get_public_proof_of_indexing(
+        &self,
+        subgraph_id: &DeploymentHash,
+        block_number: BlockNumber,
+    ) -> Result<Option<(PartialBlockPtr, [u8; 32])>, StoreError> {
+        self.subgraph_store
+            .get_public_proof_of_indexing(subgraph_id, block_number, self.block_store().clone())
+            .await
+    }
+
+    async fn query_permit(&self) -> Result<tokio::sync::OwnedSemaphorePermit, StoreError> {
+        // Status queries go to the primary shard.
+        Ok(self.block_store.query_permit_primary().await)
+    }
+}
diff --git a/store/postgres/src/store_events.rs b/store/postgres/src/store_events.rs
new file mode 100644
index 0000000..d60474f
--- /dev/null
+++ b/store/postgres/src/store_events.rs
@@ -0,0 +1,278 @@
+use futures03::TryStreamExt;
+use graph::parking_lot::Mutex;
+use graph::tokio_stream::wrappers::ReceiverStream;
+use std::collections::BTreeSet;
+use std::sync::{atomic::Ordering, Arc, RwLock};
+use std::{collections::HashMap, sync::atomic::AtomicUsize};
+use tokio::sync::mpsc::{channel, Sender};
+use tokio::sync::watch;
+use uuid::Uuid;
+
+use crate::notification_listener::{NotificationListener, SafeChannelName};
+use graph::components::store::{SubscriptionManager as SubscriptionManagerTrait, UnitStream};
+use graph::prelude::serde_json;
+use graph::{prelude::*, tokio_stream};
+
+pub struct StoreEventListener {
+    notification_listener: NotificationListener,
+}
+
+impl StoreEventListener {
+    pub fn new(
+        logger: Logger,
+        postgres_url: String,
+        registry: Arc<dyn MetricsRegistry>,
+    ) -> (Self, Box<dyn Stream<Item = StoreEvent, Error = ()> + Send>) {
+        let channel = SafeChannelName::i_promise_this_is_safe("store_events");
+        let (notification_listener, receiver) =
+            NotificationListener::new(&logger, postgres_url, channel.clone());
+
+        let counter = registry
+            .global_counter_vec(
+                "notification_queue_recvd",
+                "Number of messages received through Postgres LISTEN",
+                vec!["channel", "network"].as_slice(),
+            )
+            .unwrap()
+            .with_label_values(&[channel.as_str(), "none"]);
+
+        let event_stream = Box::new(
+            ReceiverStream::new(receiver)
+                .map(Result::<_, ()>::Ok)
+                .compat()
+                .filter_map(move |notification| {
+                    // When graph-node is starting up, it is possible that
+                    // Postgres still has old messages queued up that we
+                    // can't decode anymore. It is safe to skip them; once
+                    // We've seen 10 valid messages, we can assume that
+                    // whatever old messages Postgres had queued have been
+                    // cleared. Seeing an invalid message after that
+                    // definitely indicates trouble.
+                    let num_valid = AtomicUsize::new(0);
+                    serde_json::from_value(notification.payload.clone()).map_or_else(
+                        |_err| {
+                            error!(
+                                &logger,
+                                "invalid store event received from database: {:?}",
+                                notification.payload
+                            );
+                            if num_valid.load(Ordering::SeqCst) > 10 {
+                                panic!(
+                                    "invalid store event received from database: {:?}",
+                                    notification.payload
+                                );
+                            }
+                            None
+                        },
+                        |change| {
+                            num_valid.fetch_add(1, Ordering::SeqCst);
+                            counter.inc();
+                            Some(change)
+                        },
+                    )
+                }),
+        );
+
+        (
+            StoreEventListener {
+                notification_listener,
+            },
+            event_stream,
+        )
+    }
+
+    pub fn start(&mut self) {
+        self.notification_listener.start()
+    }
+}
+
+struct Watcher<T> {
+    sender: Arc<watch::Sender<T>>,
+    receiver: watch::Receiver<T>,
+}
+
+impl<T: Clone + Debug + Send + Sync + 'static> Watcher<T> {
+    fn new(init: T) -> Self {
+        let (sender, receiver) = watch::channel(init);
+        Watcher {
+            sender: Arc::new(sender),
+            receiver,
+        }
+    }
+
+    fn send(&self, v: T) {
+        // Unwrap: `self` holds a receiver.
+        self.sender.send(v).unwrap()
+    }
+
+    fn stream(&self) -> Box<dyn futures03::Stream<Item = T> + Unpin + Send + Sync> {
+        Box::new(tokio_stream::wrappers::WatchStream::new(
+            self.receiver.clone(),
+        ))
+    }
+
+    /// Outstanding receivers returned from `Self::stream`.
+    fn receiver_count(&self) -> usize {
+        // Do not count the internal receiver.
+        self.sender.receiver_count() - 1
+    }
+}
+
+/// Manage subscriptions to the `StoreEvent` stream. Keep a list of
+/// currently active subscribers and forward new events to each of them
+pub struct SubscriptionManager {
+    // These are more efficient since only one entry is stored per filter.
+    subscriptions_no_payload: Arc<Mutex<HashMap<BTreeSet<SubscriptionFilter>, Watcher<()>>>>,
+
+    subscriptions:
+        Arc<RwLock<HashMap<String, (Arc<BTreeSet<SubscriptionFilter>>, Sender<Arc<StoreEvent>>)>>>,
+
+    /// Keep the notification listener alive
+    listener: StoreEventListener,
+}
+
+impl SubscriptionManager {
+    pub fn new(logger: Logger, postgres_url: String, registry: Arc<dyn MetricsRegistry>) -> Self {
+        let (listener, store_events) = StoreEventListener::new(logger, postgres_url, registry);
+
+        let mut manager = SubscriptionManager {
+            subscriptions_no_payload: Arc::new(Mutex::new(HashMap::new())),
+            subscriptions: Arc::new(RwLock::new(HashMap::new())),
+            listener,
+        };
+
+        // Deal with store subscriptions
+        manager.handle_store_events(store_events);
+        manager.periodically_clean_up_stale_subscriptions();
+
+        manager.listener.start();
+
+        manager
+    }
+
+    /// Receive store events from Postgres and send them to all active
+    /// subscriptions. Detect stale subscriptions in the process and
+    /// close them.
+    fn handle_store_events(
+        &self,
+        store_events: Box<dyn Stream<Item = StoreEvent, Error = ()> + Send>,
+    ) {
+        let subscriptions = self.subscriptions.cheap_clone();
+        let subscriptions_no_payload = self.subscriptions_no_payload.cheap_clone();
+        let mut store_events = store_events.compat();
+
+        // This channel is constantly receiving things and there are locks involved,
+        // so it's best to use a blocking task.
+        graph::spawn_blocking(async move {
+            while let Some(Ok(event)) = store_events.next().await {
+                let event = Arc::new(event);
+
+                // Send to `subscriptions`.
+                {
+                    let senders = subscriptions.read().unwrap().clone();
+
+                    // Write change to all matching subscription streams; remove subscriptions
+                    // whose receiving end has been dropped
+                    for (id, (_, sender)) in senders
+                        .iter()
+                        .filter(|(_, (filter, _))| event.matches(filter))
+                    {
+                        if sender.send(event.cheap_clone()).await.is_err() {
+                            // Receiver was dropped
+                            subscriptions.write().unwrap().remove(id);
+                        }
+                    }
+                }
+
+                // Send to `subscriptions_no_payload`.
+                {
+                    let watchers = subscriptions_no_payload.lock();
+
+                    // Write change to all matching subscription streams
+                    for (_, watcher) in watchers.iter().filter(|(filter, _)| event.matches(filter))
+                    {
+                        watcher.send(());
+                    }
+                }
+            }
+        });
+    }
+
+    fn periodically_clean_up_stale_subscriptions(&self) {
+        let subscriptions = self.subscriptions.cheap_clone();
+        let subscriptions_no_payload = self.subscriptions_no_payload.cheap_clone();
+
+        // Clean up stale subscriptions every 5s
+        graph::spawn(async move {
+            let mut interval = tokio::time::interval(Duration::from_secs(5));
+            loop {
+                interval.tick().await;
+
+                // Cleanup `subscriptions`.
+                {
+                    let mut subscriptions = subscriptions.write().unwrap();
+
+                    // Obtain IDs of subscriptions whose receiving end has gone
+                    let stale_ids = subscriptions
+                        .iter_mut()
+                        .filter_map(|(id, (_, sender))| match sender.is_closed() {
+                            true => Some(id.clone()),
+                            false => None,
+                        })
+                        .collect::<Vec<_>>();
+
+                    // Remove all stale subscriptions
+                    for id in stale_ids {
+                        subscriptions.remove(&id);
+                    }
+                }
+
+                // Cleanup `subscriptions_no_payload`.
+                {
+                    let mut subscriptions = subscriptions_no_payload.lock();
+
+                    // Obtain IDs of subscriptions whose receiving end has gone
+                    let stale_ids = subscriptions
+                        .iter_mut()
+                        .filter_map(|(id, watcher)| match watcher.receiver_count() == 0 {
+                            true => Some(id.clone()),
+                            false => None,
+                        })
+                        .collect::<Vec<_>>();
+
+                    // Remove all stale subscriptions
+                    for id in stale_ids {
+                        subscriptions.remove(&id);
+                    }
+                }
+            }
+        });
+    }
+}
+
+impl SubscriptionManagerTrait for SubscriptionManager {
+    fn subscribe(&self, entities: BTreeSet<SubscriptionFilter>) -> StoreEventStreamBox {
+        let id = Uuid::new_v4().to_string();
+
+        // Prepare the new subscription by creating a channel and a subscription object
+        let (sender, receiver) = channel(100);
+
+        // Add the new subscription
+        self.subscriptions
+            .write()
+            .unwrap()
+            .insert(id, (Arc::new(entities.clone()), sender));
+
+        // Return the subscription ID and entity change stream
+        StoreEventStream::new(Box::new(ReceiverStream::new(receiver).map(Ok).compat()))
+            .filter_by_entities(entities)
+    }
+
+    fn subscribe_no_payload(&self, entities: BTreeSet<SubscriptionFilter>) -> UnitStream {
+        self.subscriptions_no_payload
+            .lock()
+            .entry(entities)
+            .or_insert_with(|| Watcher::new(()))
+            .stream()
+    }
+}
diff --git a/store/postgres/src/subgraph_store.rs b/store/postgres/src/subgraph_store.rs
new file mode 100644
index 0000000..9e1c720
--- /dev/null
+++ b/store/postgres/src/subgraph_store.rs
@@ -0,0 +1,1289 @@
+use diesel::{
+    pg::Pg,
+    serialize::Output,
+    sql_types::Text,
+    types::{FromSql, ToSql},
+};
+use std::{
+    collections::HashMap,
+    sync::{Arc, Mutex},
+};
+use std::{fmt, io::Write};
+use std::{iter::FromIterator, time::Duration};
+
+use graph::{
+    cheap_clone::CheapClone,
+    components::{
+        server::index_node::VersionInfo,
+        store::{
+            self, BlockStore, DeploymentLocator, DeploymentSchemaVersion,
+            EnsLookup as EnsLookupTrait, PruneReporter, SubgraphFork,
+        },
+    },
+    constraint_violation,
+    data::query::QueryTarget,
+    data::subgraph::{schema::DeploymentCreate, status},
+    prelude::StoreEvent,
+    prelude::{
+        anyhow, futures03::future::join_all, lazy_static, o, web3::types::Address, ApiSchema,
+        ApiVersion, BlockHash, BlockNumber, BlockPtr, ChainStore, DeploymentHash, EntityOperation,
+        Logger, MetricsRegistry, NodeId, PartialBlockPtr, Schema, StoreError, SubgraphName,
+        SubgraphStore as SubgraphStoreTrait, SubgraphVersionSwitchingMode,
+    },
+    url::Url,
+    util::timed_cache::TimedCache,
+};
+
+use crate::fork;
+use crate::{
+    connection_pool::ConnectionPool,
+    deployment::SubgraphHealth,
+    primary,
+    primary::{DeploymentId, Mirror as PrimaryMirror, Site},
+    relational::Layout,
+    writable::WritableStore,
+    NotificationSender,
+};
+use crate::{
+    deployment_store::{DeploymentStore, ReplicaId},
+    detail::DeploymentDetail,
+    primary::UnusedDeployment,
+};
+
+/// The name of a database shard; valid names must match `[a-z0-9_]+`
+#[derive(Clone, Debug, Eq, PartialEq, Hash, AsExpression, FromSqlRow)]
+pub struct Shard(String);
+
+lazy_static! {
+    /// The name of the primary shard that contains all instance-wide data
+    pub static ref PRIMARY_SHARD: Shard = Shard("primary".to_string());
+}
+
+/// How long to cache information about a deployment site
+const SITES_CACHE_TTL: Duration = Duration::from_secs(120);
+
+impl Shard {
+    pub fn new(name: String) -> Result<Self, StoreError> {
+        if name.is_empty() {
+            return Err(StoreError::InvalidIdentifier(format!(
+                "shard names must not be empty"
+            )));
+        }
+        if name.len() > 30 {
+            return Err(StoreError::InvalidIdentifier(format!(
+                "shard names can be at most 30 characters, but `{}` has {} characters",
+                name,
+                name.len()
+            )));
+        }
+        if !name
+            .chars()
+            .all(|c| c.is_ascii_lowercase() || c.is_ascii_digit() || c == '_')
+        {
+            return Err(StoreError::InvalidIdentifier(format!(
+                "shard name `{}` is invalid: shard names must only contain lowercase alphanumeric characters or '_'", name
+            )));
+        }
+        Ok(Shard(name))
+    }
+
+    pub fn as_str(&self) -> &str {
+        &self.0
+    }
+}
+
+impl fmt::Display for Shard {
+    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
+        self.0.fmt(f)
+    }
+}
+
+impl FromSql<Text, Pg> for Shard {
+    fn from_sql(bytes: Option<&[u8]>) -> diesel::deserialize::Result<Self> {
+        let s = <String as FromSql<Text, Pg>>::from_sql(bytes)?;
+        Shard::new(s).map_err(Into::into)
+    }
+}
+
+impl ToSql<Text, Pg> for Shard {
+    fn to_sql<W: Write>(&self, out: &mut Output<W, Pg>) -> diesel::serialize::Result {
+        <String as ToSql<Text, Pg>>::to_sql(&self.0, out)
+    }
+}
+
+/// Decide where a new deployment should be placed based on the subgraph
+/// name and the network it is indexing. If the deployment can be placed,
+/// returns a list of eligible database shards for the deployment and the
+/// names of the indexers that should index it. The deployment should then
+/// be assigned to one of the returned indexers and placed into one of the
+/// shards.
+pub trait DeploymentPlacer {
+    fn place(&self, name: &str, network: &str)
+        -> Result<Option<(Vec<Shard>, Vec<NodeId>)>, String>;
+}
+
+/// Tools for managing unused deployments
+pub mod unused {
+    use graph::prelude::chrono::Duration;
+
+    pub enum Filter {
+        /// List all unused deployments
+        All,
+        /// List only deployments that are unused but have not been removed yet
+        New,
+        /// List only deployments that were recorded as unused at least this
+        /// long ago but have not been removed at
+        UnusedLongerThan(Duration),
+    }
+}
+
+/// Multiplex store operations on subgraphs and deployments between a
+/// primary and any number of additional storage shards. The primary
+/// contains information about named subgraphs, and how the underlying
+/// deployments are spread across shards, while the actual deployment data
+/// and metadata is stored in the shards.  Depending on the configuration,
+/// the database for the primary and for the shards can be the same
+/// database, in which case they are all backed by one connection pool, or
+/// separate databases in the same Postgres cluster, or entirely separate
+/// clusters. Details of how to configure shards can be found in [this
+/// document](https://github.com/graphprotocol/graph-node/blob/master/docs/config.md)
+///
+/// The primary uses the following database tables:
+/// - `public.deployment_schemas`: immutable data about deployments,
+///   including the shard that stores the deployment data and metadata, the
+///   namespace in the shard that contains the deployment data, and the
+///   network/chain that the  deployment is indexing
+/// - `subgraphs.subgraph` and `subgraphs.subgraph_version`: information
+///   about named subgraphs and how they map to deployments
+/// - `subgraphs.subgraph_deployment_assignment`: which index node is
+///   indexing what deployment
+///
+/// The primary is also the database that is used to send and receive
+/// notifications through Postgres' `LISTEN`/`NOTIFY` mechanism. That is
+/// used to send notifications about new blocks that a block ingestor has
+/// discovered, and to send `StoreEvents`, which are used to broadcast
+/// changes in deployment assignments and changes in subgraph data to
+/// trigger updates on GraphQL subscriptions.
+///
+/// For each deployment, the corresponding shard contains a namespace for
+/// the deployment data; the schema in that namespace is generated from the
+/// deployment's GraphQL schema by the [crate::relational::Layout], which is
+/// also responsible for modifying and querying subgraph data. Deployment
+/// metadata is stored in tables in the `subgraphs` namespace in the same
+/// shard as the deployment data. The most important of these tables are
+///
+/// - `subgraphs.subgraph_deployment`: the main table for deployment
+///   metadata; most importantly, it stores the pointer to the current
+///   subgraph head, i.e., the block up to which the subgraph has indexed
+///   the chain, together with other things like whether the subgraph has
+///   synced, whether it has failed and whether it encountered any errors
+/// - `subgraphs.subgraph_manifest`: immutable information derived from the
+///   YAML manifest for the deployment
+/// - `subgraphs.dynamic_ethereum_contract_data_source`: the data sources
+///   that the subgraph has created from templates in the manifest.
+/// - `subgraphs.subgraph_error`: details about errors that the deployment
+///   has encountered
+///
+/// The `SubgraphStore` mostly orchestrates access to the primary and the
+/// shards.  The actual work is done by code in the `primary` module for
+/// queries against the primary store, and by the `DeploymentStore` for
+/// access to deployment data and metadata.
+#[derive(Clone)]
+pub struct SubgraphStore {
+    inner: Arc<SubgraphStoreInner>,
+    /// Base URL for the GraphQL endpoint from which
+    /// subgraph forks will fetch entities.
+    /// Example: https://api.thegraph.com/subgraphs/
+    fork_base: Option<Url>,
+}
+
+impl SubgraphStore {
+    /// Create a new store for subgraphs that distributes deployments across
+    /// multiple databases
+    ///
+    /// `stores` is a list of the shards. The tuple contains the shard name, the main
+    /// connection pool for the database, a list of read-only connections
+    /// for the same database, and a list of weights determining how often
+    /// to use the main pool and the read replicas for queries. The list
+    /// of weights must be one longer than the list of read replicas, and
+    /// `weights[0]` is used for the main pool.
+    ///
+    /// All write operations for a shard are performed against the main
+    /// pool. One of the shards must be named `primary`
+    ///
+    /// The `placer` determines where `create_subgraph_deployment` puts a new deployment
+    pub fn new(
+        logger: &Logger,
+        stores: Vec<(Shard, ConnectionPool, Vec<ConnectionPool>, Vec<usize>)>,
+        placer: Arc<dyn DeploymentPlacer + Send + Sync + 'static>,
+        sender: Arc<NotificationSender>,
+        fork_base: Option<Url>,
+        registry: Arc<dyn MetricsRegistry>,
+    ) -> Self {
+        Self {
+            inner: Arc::new(SubgraphStoreInner::new(
+                logger, stores, placer, sender, registry,
+            )),
+            fork_base,
+        }
+    }
+
+    pub async fn get_proof_of_indexing(
+        &self,
+        id: &DeploymentHash,
+        indexer: &Option<Address>,
+        block: BlockPtr,
+    ) -> Result<Option<[u8; 32]>, StoreError> {
+        self.inner.get_proof_of_indexing(id, indexer, block).await
+    }
+
+    pub(crate) async fn get_public_proof_of_indexing(
+        &self,
+        id: &DeploymentHash,
+        block_number: BlockNumber,
+        block_store: Arc<impl BlockStore>,
+    ) -> Result<Option<(PartialBlockPtr, [u8; 32])>, StoreError> {
+        self.inner
+            .get_public_proof_of_indexing(id, block_number, block_store)
+            .await
+    }
+
+    pub fn notification_sender(&self) -> Arc<NotificationSender> {
+        self.sender.clone()
+    }
+}
+
+impl std::ops::Deref for SubgraphStore {
+    type Target = SubgraphStoreInner;
+
+    fn deref(&self) -> &Self::Target {
+        &self.inner
+    }
+}
+
+pub struct SubgraphStoreInner {
+    mirror: PrimaryMirror,
+    stores: HashMap<Shard, Arc<DeploymentStore>>,
+    /// Cache for the mapping from deployment id to shard/namespace/id. Only
+    /// active sites are cached here to ensure we have a unique mapping from
+    /// `SubgraphDeploymentId` to `Site`. The cache keeps entry only for
+    /// `SITES_CACHE_TTL` so that changes, in particular, activation of a
+    /// different deployment for the same hash propagate across different
+    /// graph-node processes over time.
+    sites: TimedCache<DeploymentHash, Site>,
+    placer: Arc<dyn DeploymentPlacer + Send + Sync + 'static>,
+    sender: Arc<NotificationSender>,
+    writables: Mutex<HashMap<DeploymentId, Arc<WritableStore>>>,
+    registry: Arc<dyn MetricsRegistry>,
+}
+
+impl SubgraphStoreInner {
+    /// Create a new store for subgraphs that distributes deployments across
+    /// multiple databases
+    ///
+    /// `stores` is a list of the shards. The tuple contains the shard name, the main
+    /// connection pool for the database, a list of read-only connections
+    /// for the same database, and a list of weights determining how often
+    /// to use the main pool and the read replicas for queries. The list
+    /// of weights must be one longer than the list of read replicas, and
+    /// `weights[0]` is used for the main pool.
+    ///
+    /// All write operations for a shard are performed against the main
+    /// pool. One of the shards must be named `primary`
+    ///
+    /// The `placer` determines where `create_subgraph_deployment` puts a new deployment
+    pub fn new(
+        logger: &Logger,
+        stores: Vec<(Shard, ConnectionPool, Vec<ConnectionPool>, Vec<usize>)>,
+        placer: Arc<dyn DeploymentPlacer + Send + Sync + 'static>,
+        sender: Arc<NotificationSender>,
+        registry: Arc<dyn MetricsRegistry>,
+    ) -> Self {
+        let mirror = {
+            let pools = HashMap::from_iter(
+                stores
+                    .iter()
+                    .map(|(name, pool, _, _)| (name.clone(), pool.clone())),
+            );
+            PrimaryMirror::new(&pools)
+        };
+        let stores = HashMap::from_iter(stores.into_iter().map(
+            |(name, main_pool, read_only_pools, weights)| {
+                let logger = logger.new(o!("shard" => name.to_string()));
+
+                (
+                    name,
+                    Arc::new(DeploymentStore::new(
+                        &logger,
+                        main_pool,
+                        read_only_pools,
+                        weights,
+                    )),
+                )
+            },
+        ));
+        let sites = TimedCache::new(SITES_CACHE_TTL);
+        SubgraphStoreInner {
+            mirror,
+            stores,
+            sites,
+            placer,
+            sender,
+            writables: Mutex::new(HashMap::new()),
+            registry,
+        }
+    }
+
+    // Only needed for tests
+    #[cfg(debug_assertions)]
+    pub(crate) fn clear_caches(&self) {
+        for store in self.stores.values() {
+            store.layout_cache.clear();
+        }
+        self.sites.clear();
+    }
+
+    // Only needed for tests
+    #[cfg(debug_assertions)]
+    pub fn shard(&self, deployment: &DeploymentLocator) -> Result<Shard, StoreError> {
+        self.find_site(deployment.id.into())
+            .map(|site| site.shard.clone())
+    }
+
+    fn cache_active(&self, site: &Arc<Site>) {
+        if site.active {
+            self.sites.set(site.deployment.clone(), site.clone());
+        }
+    }
+
+    /// Return the active `Site` for this deployment hash
+    fn site(&self, id: &DeploymentHash) -> Result<Arc<Site>, StoreError> {
+        if let Some(site) = self.sites.get(id) {
+            return Ok(site);
+        }
+
+        let site = self
+            .mirror
+            .find_active_site(id)?
+            .ok_or_else(|| StoreError::DeploymentNotFound(id.to_string()))?;
+        let site = Arc::new(site);
+
+        self.cache_active(&site);
+        Ok(site)
+    }
+
+    fn find_site(&self, id: DeploymentId) -> Result<Arc<Site>, StoreError> {
+        if let Some(site) = self.sites.find(|site| site.id == id) {
+            return Ok(site);
+        }
+
+        let site = self
+            .mirror
+            .find_site_by_ref(id)?
+            .ok_or_else(|| StoreError::DeploymentNotFound(id.to_string()))?;
+        let site = Arc::new(site);
+
+        self.cache_active(&site);
+        Ok(site)
+    }
+
+    /// Return the store and site for the active deployment of this
+    /// deployment hash
+    fn store(&self, id: &DeploymentHash) -> Result<(&Arc<DeploymentStore>, Arc<Site>), StoreError> {
+        let site = self.site(id)?;
+        let store = self
+            .stores
+            .get(&site.shard)
+            .ok_or_else(|| StoreError::UnknownShard(site.shard.to_string()))?;
+        Ok((store, site))
+    }
+
+    pub(crate) fn for_site(&self, site: &Site) -> Result<&Arc<DeploymentStore>, StoreError> {
+        self.stores
+            .get(&site.shard)
+            .ok_or_else(|| StoreError::UnknownShard(site.shard.to_string()))
+    }
+
+    pub(crate) fn layout(&self, id: &DeploymentHash) -> Result<Arc<Layout>, StoreError> {
+        let (store, site) = self.store(id)?;
+        store.find_layout(site)
+    }
+
+    fn place_on_node(
+        &self,
+        mut nodes: Vec<NodeId>,
+        default_node: NodeId,
+    ) -> Result<NodeId, StoreError> {
+        match nodes.len() {
+            0 => {
+                // This is really a configuration error
+                Ok(default_node)
+            }
+            1 => Ok(nodes.pop().unwrap()),
+            _ => {
+                let conn = self.primary_conn()?;
+
+                // unwrap is fine since nodes is not empty
+                let node = conn.least_assigned_node(&nodes)?.unwrap();
+                Ok(node)
+            }
+        }
+    }
+
+    fn place_in_shard(&self, mut shards: Vec<Shard>) -> Result<Shard, StoreError> {
+        match shards.len() {
+            0 => Ok(PRIMARY_SHARD.clone()),
+            1 => Ok(shards.pop().unwrap()),
+            _ => {
+                let conn = self.primary_conn()?;
+
+                // unwrap is fine since shards is not empty
+                let shard = conn.least_used_shard(&shards)?.unwrap();
+                Ok(shard)
+            }
+        }
+    }
+
+    fn place(
+        &self,
+        name: &SubgraphName,
+        network_name: &str,
+        default_node: NodeId,
+    ) -> Result<(Shard, NodeId), StoreError> {
+        // We try to place the deployment according to the configured rules.
+        // If they don't yield a match, place into the primary and have
+        // `default_node` index the deployment. The latter can only happen
+        // when `graph-node` is not using a configuration file, but
+        // uses the legacy command-line options as configuration
+        let placement = self
+            .placer
+            .place(name.as_str(), network_name)
+            .map_err(|msg| {
+                constraint_violation!("illegal indexer name in deployment rule: {}", msg)
+            })?;
+
+        match placement {
+            None => Ok((PRIMARY_SHARD.clone(), default_node)),
+            Some((shards, nodes)) => {
+                let node = self.place_on_node(nodes, default_node)?;
+                let shard = self.place_in_shard(shards)?;
+
+                Ok((shard, node))
+            }
+        }
+    }
+
+    /// Create a new deployment. This requires creating an entry in
+    /// `deployment_schemas` in the primary, the subgraph schema in another
+    /// shard, assigning the deployment to a node, and handling any changes
+    /// to current/pending versions of the subgraph `name`
+    ///
+    /// This process needs to modify two databases: the primary and the
+    /// shard for the subgraph and is therefore not transactional. The code
+    /// is careful to make sure this process is at least idempotent, so that
+    /// a failed deployment creation operation can be fixed by deploying
+    /// again.
+    fn create_deployment_internal(
+        &self,
+        name: SubgraphName,
+        schema: &Schema,
+        deployment: DeploymentCreate,
+        node_id: NodeId,
+        network_name: String,
+        mode: SubgraphVersionSwitchingMode,
+        // replace == true is only used in tests; for non-test code, it must
+        // be 'false'
+        replace: bool,
+    ) -> Result<DeploymentLocator, StoreError> {
+        #[cfg(not(debug_assertions))]
+        assert!(!replace);
+
+        let graft_base = deployment
+            .graft_base
+            .as_ref()
+            .map(|base| self.layout(base))
+            .transpose()?;
+
+        let (site, node_id) = {
+            // We need to deal with two situations:
+            //   (1) We are really creating a new subgraph; it therefore needs
+            //       to go in the shard and onto the node that the placement
+            //       rules dictate
+            //   (2) The deployment has previously been created, and either
+            //       failed partway through, or the deployment rules have
+            //       changed since the last time we created the deployment.
+            //       In that case, we need to use the shard and node
+            //       assignment that we used last time to avoid creating
+            //       the same deployment in another shard
+            let (shard, node_id) = self.place(&name, &network_name, node_id)?;
+            let schema_version = match &graft_base {
+                None => DeploymentSchemaVersion::LATEST,
+                Some(src_layout) => src_layout.site.schema_version,
+            };
+            let conn = self.primary_conn()?;
+            let site = conn.allocate_site(shard, &schema.id, network_name, schema_version)?;
+            let node_id = conn.assigned_node(&site)?.unwrap_or(node_id);
+            (site, node_id)
+        };
+        let site = Arc::new(site);
+
+        if let Some(graft_base) = &graft_base {
+            self.primary_conn()?
+                .record_active_copy(graft_base.site.as_ref(), site.as_ref())?;
+        }
+
+        // Create the actual databases schema and metadata entries
+        let deployment_store = self
+            .stores
+            .get(&site.shard)
+            .ok_or_else(|| StoreError::UnknownShard(site.shard.to_string()))?;
+        deployment_store.create_deployment(
+            schema,
+            deployment,
+            site.clone(),
+            graft_base,
+            replace,
+        )?;
+
+        let exists_and_synced = |id: &DeploymentHash| {
+            let (store, _) = self.store(id)?;
+            store.deployment_exists_and_synced(id)
+        };
+
+        // FIXME: This simultaneously holds a `primary_conn` and a shard connection, which can
+        // potentially deadlock.
+        let pconn = self.primary_conn()?;
+        pconn.transaction(|| -> Result<_, StoreError> {
+            // Create subgraph, subgraph version, and assignment
+            let changes =
+                pconn.create_subgraph_version(name, &site, node_id, mode, exists_and_synced)?;
+            let event = StoreEvent::new(changes);
+            pconn.send_store_event(&self.sender, &event)?;
+            Ok(())
+        })?;
+        Ok(site.as_ref().into())
+    }
+
+    pub fn copy_deployment(
+        &self,
+        src: &DeploymentLocator,
+        shard: Shard,
+        node: NodeId,
+        block: BlockPtr,
+    ) -> Result<DeploymentLocator, StoreError> {
+        let src = self.find_site(src.id.into())?;
+        let src_store = self.for_site(src.as_ref())?;
+        let src_info = src_store.subgraph_info(src.as_ref())?;
+        let src_loc = DeploymentLocator::from(src.as_ref());
+
+        let dst = Arc::new(self.primary_conn()?.copy_site(&src, shard.clone())?);
+        let dst_loc = DeploymentLocator::from(dst.as_ref());
+
+        if src.id == dst.id {
+            return Err(StoreError::Unknown(anyhow!(
+                "can not copy deployment {} onto itself",
+                src_loc
+            )));
+        }
+        // The very last thing we do when we set up a copy here is assign it
+        // to a node. Therefore, if `dst` is already assigned, this function
+        // should not have been called.
+        if let Some(node) = self.mirror.assigned_node(dst.as_ref())? {
+            return Err(StoreError::Unknown(anyhow!(
+                "can not copy into deployment {} since it is already assigned to node `{}`",
+                dst_loc,
+                node
+            )));
+        }
+        let deployment = src_store.load_deployment(src.as_ref())?;
+        if deployment.failed {
+            return Err(StoreError::Unknown(anyhow!(
+                "can not copy deployment {} because it has failed",
+                src_loc
+            )));
+        }
+
+        // Transmogrify the deployment into a new one
+        let deployment = DeploymentCreate {
+            manifest: deployment.manifest,
+            earliest_block: deployment.earliest_block.clone(),
+            graft_base: Some(src.deployment.clone()),
+            graft_block: Some(block),
+            debug_fork: deployment.debug_fork,
+        };
+
+        let graft_base = self.layout(&src.deployment)?;
+
+        self.primary_conn()?
+            .record_active_copy(src.as_ref(), dst.as_ref())?;
+
+        // Create the actual databases schema and metadata entries
+        let deployment_store = self
+            .stores
+            .get(&shard)
+            .ok_or_else(|| StoreError::UnknownShard(shard.to_string()))?;
+
+        deployment_store.create_deployment(
+            &src_info.input,
+            deployment,
+            dst.clone(),
+            Some(graft_base),
+            false,
+        )?;
+
+        let pconn = self.primary_conn()?;
+        pconn.transaction(|| -> Result<_, StoreError> {
+            // Create subgraph, subgraph version, and assignment. We use the
+            // existence of an assignment as a signal that we already set up
+            // the copy
+            let changes = pconn.assign_subgraph(dst.as_ref(), &node)?;
+            let event = StoreEvent::new(changes);
+            pconn.send_store_event(&self.sender, &event)?;
+            Ok(())
+        })?;
+        Ok(dst.as_ref().into())
+    }
+
+    /// Mark `deployment` as the only active deployment amongst all sites
+    /// with the same deployment hash. Activating this specific deployment
+    /// will make queries use that instead of whatever was active before
+    pub fn activate(&self, deployment: &DeploymentLocator) -> Result<(), StoreError> {
+        self.primary_conn()?.activate(deployment)?;
+        // As a side-effect, this will update the `self.sites` cache with
+        // the new active site
+        self.find_site(deployment.id.into())?;
+        Ok(())
+    }
+
+    // Only for tests to simplify their handling of test fixtures, so that
+    // tests can reset the block pointer of a subgraph by recreating it
+    #[cfg(debug_assertions)]
+    pub fn create_deployment_replace(
+        &self,
+        name: SubgraphName,
+        schema: &Schema,
+        deployment: DeploymentCreate,
+        node_id: NodeId,
+        network_name: String,
+        mode: SubgraphVersionSwitchingMode,
+    ) -> Result<DeploymentLocator, StoreError> {
+        self.create_deployment_internal(name, schema, deployment, node_id, network_name, mode, true)
+    }
+
+    pub(crate) fn send_store_event(&self, event: &StoreEvent) -> Result<(), StoreError> {
+        let conn = self.primary_conn()?;
+        conn.send_store_event(&self.sender, event)
+    }
+
+    /// Get a connection to the primary shard. Code must never hold one of these
+    /// connections while also accessing a `DeploymentStore`, since both
+    /// might draw connections from the same pool, and trying to get two
+    /// connections can deadlock the entire process if the pool runs out
+    /// of connections in between getting the first one and trying to get the
+    /// second one.
+    pub(crate) fn primary_conn(&self) -> Result<primary::Connection, StoreError> {
+        let conn = self.mirror.primary().get()?;
+        Ok(primary::Connection::new(conn))
+    }
+
+    pub(crate) fn replica_for_query(
+        &self,
+        target: QueryTarget,
+        for_subscription: bool,
+    ) -> Result<(Arc<DeploymentStore>, Arc<Site>, ReplicaId), StoreError> {
+        let id = match target {
+            QueryTarget::Name(name, _) => self.mirror.current_deployment_for_subgraph(&name)?,
+            QueryTarget::Deployment(id, _) => id,
+        };
+
+        let (store, site) = self.store(&id)?;
+        let replica = store.replica_for_query(for_subscription)?;
+
+        Ok((store.clone(), site, replica))
+    }
+
+    /// Delete all entities. This function exists solely for integration tests
+    /// and should never be called from any other code. Unfortunately, Rust makes
+    /// it very hard to export items just for testing
+    #[cfg(debug_assertions)]
+    pub fn delete_all_entities_for_test_use_only(&self) -> Result<(), StoreError> {
+        let pconn = self.primary_conn()?;
+        let schemas = pconn.sites()?;
+
+        // Delete all subgraph schemas
+        for schema in schemas {
+            let (store, _) = self.store(&schema.deployment)?;
+            store.drop_deployment_schema(&schema.namespace)?;
+        }
+
+        for store in self.stores.values() {
+            store.drop_all_metadata()?;
+        }
+        self.clear_caches();
+        Ok(())
+    }
+
+    /// Partition the list of deployments by the shard they belong to. As a
+    /// side-effect, add all `sites` to the cache
+    fn deployments_by_shard(
+        &self,
+        sites: Vec<Site>,
+    ) -> Result<HashMap<Shard, Vec<Arc<Site>>>, StoreError> {
+        let sites: Vec<_> = sites.into_iter().map(Arc::new).collect();
+        for site in &sites {
+            self.cache_active(site);
+        }
+
+        // Partition the list of deployments by shard
+        let by_shard: HashMap<Shard, Vec<Arc<Site>>> =
+            sites.into_iter().fold(HashMap::new(), |mut map, site| {
+                map.entry(site.shard.clone()).or_default().push(site);
+                map
+            });
+        Ok(by_shard)
+    }
+
+    /// Look for new unused deployments and add them to the `unused_deployments`
+    /// table
+    pub fn record_unused_deployments(&self) -> Result<Vec<DeploymentDetail>, StoreError> {
+        let deployments = self.primary_conn()?.detect_unused_deployments()?;
+
+        // deployments_by_shard takes an empty vec to mean 'give me everything',
+        // so we short-circuit that here
+        if deployments.is_empty() {
+            return Ok(vec![]);
+        }
+
+        let by_shard = self.deployments_by_shard(deployments)?;
+        // Go shard-by-shard to look up deployment statuses
+        let mut details = Vec::new();
+        for (shard, ids) in by_shard.into_iter() {
+            let store = self
+                .stores
+                .get(&shard)
+                .ok_or_else(|| StoreError::UnknownShard(shard.to_string()))?;
+            let ids = ids
+                .into_iter()
+                .map(|site| site.deployment.to_string())
+                .collect();
+            details.extend(store.deployment_details(ids)?);
+        }
+
+        self.primary_conn()?.update_unused_deployments(&details)?;
+        Ok(details)
+    }
+
+    pub fn list_unused_deployments(
+        &self,
+        filter: unused::Filter,
+    ) -> Result<Vec<UnusedDeployment>, StoreError> {
+        self.primary_conn()?.list_unused_deployments(filter)
+    }
+
+    /// Remove a deployment, i.e., all its data and metadata. This is only permissible
+    /// if the deployment is unused in the sense that it is neither the current nor
+    /// pending version of any subgraph, and is not currently assigned to any node
+    pub fn remove_deployment(&self, id: DeploymentId) -> Result<(), StoreError> {
+        let site = self.find_site(id)?;
+        let store = self.for_site(site.as_ref())?;
+
+        // Check that deployment is not assigned
+        let mut removable = self.mirror.assigned_node(site.as_ref())?.is_none();
+
+        // Check that it is not current/pending for any subgraph if it is
+        // the active deployment of that subgraph
+        if site.active {
+            if !self
+                .primary_conn()?
+                .subgraphs_using_deployment(site.as_ref())?
+                .is_empty()
+            {
+                removable = false;
+            }
+        }
+
+        if removable {
+            store.drop_deployment(&site)?;
+
+            self.primary_conn()?.drop_site(site.as_ref())?;
+        } else {
+            self.primary_conn()?
+                .unused_deployment_is_used(site.as_ref())?;
+        }
+
+        Ok(())
+    }
+
+    pub(crate) fn status(&self, filter: status::Filter) -> Result<Vec<status::Info>, StoreError> {
+        let sites = match filter {
+            status::Filter::SubgraphName(name) => {
+                let deployments = self.mirror.deployments_for_subgraph(&name)?;
+                if deployments.is_empty() {
+                    return Ok(Vec::new());
+                }
+                deployments
+            }
+            status::Filter::SubgraphVersion(name, use_current) => {
+                let deployment = self.mirror.subgraph_version(&name, use_current)?;
+                match deployment {
+                    Some(deployment) => vec![deployment],
+                    None => {
+                        return Ok(Vec::new());
+                    }
+                }
+            }
+            status::Filter::Deployments(deployments) => {
+                self.mirror.find_sites(&deployments, true)?
+            }
+            status::Filter::DeploymentIds(ids) => {
+                let ids: Vec<_> = ids.into_iter().map(|id| id.into()).collect();
+                self.mirror.find_sites_by_id(&ids)?
+            }
+        };
+
+        let by_shard: HashMap<Shard, Vec<Arc<Site>>> = self.deployments_by_shard(sites)?;
+
+        // Go shard-by-shard to look up deployment statuses
+        let mut infos = Vec::new();
+        for (shard, sites) in by_shard.into_iter() {
+            let store = self
+                .stores
+                .get(&shard)
+                .ok_or_else(|| StoreError::UnknownShard(shard.to_string()))?;
+            infos.extend(store.deployment_statuses(&sites)?);
+        }
+        self.mirror.fill_assignments(&mut infos)?;
+        Ok(infos)
+    }
+
+    pub(crate) fn version_info(&self, version: &str) -> Result<VersionInfo, StoreError> {
+        if let Some((deployment_id, created_at)) = self.mirror.version_info(version)? {
+            let id = DeploymentHash::new(deployment_id.clone())
+                .map_err(|id| constraint_violation!("illegal deployment id {}", id))?;
+            let (store, site) = self.store(&id)?;
+            let statuses = store.deployment_statuses(&vec![site.clone()])?;
+            let status = statuses
+                .first()
+                .ok_or_else(|| StoreError::DeploymentNotFound(deployment_id.clone()))?;
+            let chain = status
+                .chains
+                .first()
+                .ok_or_else(|| constraint_violation!("no chain info for {}", deployment_id))?;
+            let latest_ethereum_block_number =
+                chain.latest_block.as_ref().map(|block| block.number());
+            let subgraph_info = store.subgraph_info(site.as_ref())?;
+            let network = site.network.clone();
+
+            let info = VersionInfo {
+                created_at,
+                deployment_id,
+                latest_ethereum_block_number,
+                total_ethereum_blocks_count: None,
+                synced: status.synced,
+                failed: status.health.is_failed(),
+                description: subgraph_info.description,
+                repository: subgraph_info.repository,
+                schema: subgraph_info.input,
+                network,
+            };
+            Ok(info)
+        } else {
+            Err(StoreError::DeploymentNotFound(version.to_string()))
+        }
+    }
+
+    pub(crate) fn versions_for_subgraph_id(
+        &self,
+        subgraph_id: &str,
+    ) -> Result<(Option<String>, Option<String>), StoreError> {
+        self.mirror.versions_for_subgraph_id(subgraph_id)
+    }
+
+    pub(crate) fn subgraphs_for_deployment_hash(
+        &self,
+        deployment_hash: &str,
+    ) -> Result<Vec<(String, String)>, StoreError> {
+        self.mirror.subgraphs_by_deployment_hash(deployment_hash)
+    }
+
+    #[cfg(debug_assertions)]
+    pub fn error_count(&self, id: &DeploymentHash) -> Result<usize, StoreError> {
+        let (store, _) = self.store(id)?;
+        store.error_count(id)
+    }
+
+    /// Vacuum the `subgraph_deployment` table in each shard
+    pub(crate) async fn vacuum(&self) -> Vec<Result<(), StoreError>> {
+        join_all(self.stores.values().map(|store| store.vacuum())).await
+    }
+
+    pub fn rewind(&self, id: DeploymentHash, block_ptr_to: BlockPtr) -> Result<(), StoreError> {
+        let (store, site) = self.store(&id)?;
+        let event = store.rewind(site, block_ptr_to)?;
+        self.send_store_event(&event)
+    }
+
+    pub(crate) async fn get_proof_of_indexing(
+        &self,
+        id: &DeploymentHash,
+        indexer: &Option<Address>,
+        block: BlockPtr,
+    ) -> Result<Option<[u8; 32]>, StoreError> {
+        let (store, site) = self.store(id)?;
+        store.get_proof_of_indexing(site, indexer, block).await
+    }
+
+    pub(crate) async fn get_public_proof_of_indexing(
+        &self,
+        id: &DeploymentHash,
+        block_number: BlockNumber,
+        block_store: Arc<impl BlockStore>,
+    ) -> Result<Option<(PartialBlockPtr, [u8; 32])>, StoreError> {
+        let (store, site) = self.store(&id)?;
+
+        let chain_store = match block_store.chain_store(&site.network) {
+            Some(chain_store) => chain_store,
+            None => return Ok(None),
+        };
+        let mut hashes = chain_store.block_hashes_by_block_number(block_number)?;
+
+        // If we don't have this block or we have multiple versions of this block
+        // and using any of them could introduce non-deterministic because we don't
+        // know which one is the right one -> return no block hash
+        if hashes.is_empty() || hashes.len() > 1 {
+            return Ok(None);
+        }
+
+        // This `unwrap` is safe to do now
+        let block_hash = BlockHash::from(hashes.pop().unwrap());
+
+        let block_for_poi_query = BlockPtr::new(block_hash.clone(), block_number);
+        let indexer = Some(Address::zero());
+        let poi = store
+            .get_proof_of_indexing(site, &indexer, block_for_poi_query)
+            .await?;
+
+        Ok(poi.map(|poi| {
+            (
+                PartialBlockPtr {
+                    number: block_number,
+                    hash: Some(block_hash),
+                },
+                poi,
+            )
+        }))
+    }
+
+    // Only used by tests
+    #[cfg(debug_assertions)]
+    pub fn find(
+        &self,
+        query: graph::prelude::EntityQuery,
+    ) -> Result<Vec<graph::prelude::Entity>, graph::prelude::QueryExecutionError> {
+        let (store, site) = self.store(&query.subgraph_id)?;
+        store.find(site, query)
+    }
+
+    pub fn locate_in_shard(
+        &self,
+        hash: &DeploymentHash,
+        shard: Shard,
+    ) -> Result<Option<DeploymentLocator>, StoreError> {
+        Ok(self
+            .mirror
+            .find_site_in_shard(hash, &shard)?
+            .as_ref()
+            .map(|site| site.into()))
+    }
+
+    pub async fn mirror_primary_tables(&self, logger: &Logger) {
+        join_all(
+            self.stores
+                .values()
+                .map(|store| store.mirror_primary_tables(logger)),
+        )
+        .await;
+    }
+
+    pub fn analyze(
+        &self,
+        deployment: &DeploymentLocator,
+        entity_name: &str,
+    ) -> Result<(), StoreError> {
+        let (store, site) = self.store(&deployment.hash)?;
+        store.analyze(site, entity_name)
+    }
+
+    pub async fn create_manual_index(
+        &self,
+        deployment: &DeploymentLocator,
+        entity_name: &str,
+        field_names: Vec<String>,
+        index_method: String,
+    ) -> Result<(), StoreError> {
+        let (store, site) = self.store(&deployment.hash)?;
+        store
+            .create_manual_index(site, entity_name, field_names, index_method)
+            .await
+    }
+
+    pub async fn indexes_for_entity(
+        &self,
+        deployment: &DeploymentLocator,
+        entity_name: &str,
+    ) -> Result<Vec<String>, StoreError> {
+        let (store, site) = self.store(&deployment.hash)?;
+        store.indexes_for_entity(site, entity_name).await
+    }
+
+    pub async fn drop_index_for_deployment(
+        &self,
+        deployment: &DeploymentLocator,
+        index_name: &str,
+    ) -> Result<(), StoreError> {
+        let (store, site) = self.store(&deployment.hash)?;
+        store.drop_index(site, index_name).await
+    }
+
+    pub async fn set_account_like(
+        &self,
+        deployment: &DeploymentLocator,
+        table: &str,
+        is_account_like: bool,
+    ) -> Result<(), StoreError> {
+        let (store, site) = self.store(&deployment.hash)?;
+        store.set_account_like(site, table, is_account_like).await
+    }
+
+    /// Remove the history that is only needed to respond to queries before
+    /// block number `earliest_block` from the given deployment
+    ///
+    /// Only tables with a ratio of entities to entity versions below
+    /// `prune_ratio` will be pruned; that ratio is determined by looking at
+    /// Postgres planner stats to avoid lengthy counting queries. It is
+    /// assumed that if the ratio is higher than `prune_ratio` that pruning
+    /// won't make much of a difference and will just cause unnecessary
+    /// work.
+    ///
+    /// The `reorg_threshold` is used to determine which blocks will not be
+    /// modified any more by the subgraph writer that may be running
+    /// concurrently to reduce the amount of time that the writer needs to
+    /// be locked out while pruning is happening.
+    ///
+    /// Pruning can take a long time, and is structured into multiple
+    /// transactions such that none of them takes an excessively long time.
+    /// If pruning gets interrupted, it may leave some intermediate tables
+    /// in the database behind. Those will get cleaned up the next time an
+    /// attempt is made to prune the same deployment.
+    pub async fn prune(
+        &self,
+        reporter: Box<dyn PruneReporter>,
+        deployment: &DeploymentLocator,
+        earliest_block: BlockNumber,
+        reorg_threshold: BlockNumber,
+        prune_ratio: f64,
+    ) -> Result<Box<dyn PruneReporter>, StoreError> {
+        // Find the store by the deployment id; otherwise, we could only
+        // prune the active copy of the deployment with `deployment.hash`
+        let site = self.find_site(deployment.id.into())?;
+        let store = self.for_site(&site)?;
+
+        store
+            .prune(reporter, site, earliest_block, reorg_threshold, prune_ratio)
+            .await
+    }
+}
+
+struct EnsLookup {
+    primary: ConnectionPool,
+}
+
+impl EnsLookupTrait for EnsLookup {
+    fn find_name(&self, hash: &str) -> Result<Option<String>, StoreError> {
+        let conn = self.primary.get()?;
+        primary::Connection::new(conn).find_ens_name(hash)
+    }
+}
+
+#[async_trait::async_trait]
+impl SubgraphStoreTrait for SubgraphStore {
+    fn ens_lookup(&self) -> Arc<dyn EnsLookupTrait> {
+        Arc::new(EnsLookup {
+            primary: self.mirror.primary().clone(),
+        })
+    }
+
+    // FIXME: This method should not get a node_id
+    fn create_subgraph_deployment(
+        &self,
+        name: SubgraphName,
+        schema: &Schema,
+        deployment: DeploymentCreate,
+        node_id: NodeId,
+        network_name: String,
+        mode: SubgraphVersionSwitchingMode,
+    ) -> Result<DeploymentLocator, StoreError> {
+        self.create_deployment_internal(
+            name,
+            schema,
+            deployment,
+            node_id,
+            network_name,
+            mode,
+            false,
+        )
+    }
+
+    fn create_subgraph(&self, name: SubgraphName) -> Result<String, StoreError> {
+        let pconn = self.primary_conn()?;
+        pconn.transaction(|| pconn.create_subgraph(&name))
+    }
+
+    fn remove_subgraph(&self, name: SubgraphName) -> Result<(), StoreError> {
+        let pconn = self.primary_conn()?;
+        pconn.transaction(|| -> Result<_, StoreError> {
+            let changes = pconn.remove_subgraph(name)?;
+            pconn.send_store_event(&self.sender, &StoreEvent::new(changes))
+        })
+    }
+
+    fn reassign_subgraph(
+        &self,
+        deployment: &DeploymentLocator,
+        node_id: &NodeId,
+    ) -> Result<(), StoreError> {
+        let site = self.find_site(deployment.id.into())?;
+        let pconn = self.primary_conn()?;
+        pconn.transaction(|| -> Result<_, StoreError> {
+            let changes = pconn.reassign_subgraph(site.as_ref(), node_id)?;
+            pconn.send_store_event(&self.sender, &StoreEvent::new(changes))
+        })
+    }
+
+    fn assigned_node(&self, deployment: &DeploymentLocator) -> Result<Option<NodeId>, StoreError> {
+        let site = self.find_site(deployment.id.into())?;
+        self.mirror.assigned_node(site.as_ref())
+    }
+
+    fn assignments(&self, node: &NodeId) -> Result<Vec<DeploymentLocator>, StoreError> {
+        self.mirror
+            .assignments(node)
+            .map(|sites| sites.iter().map(|site| site.into()).collect())
+    }
+
+    fn subgraph_exists(&self, name: &SubgraphName) -> Result<bool, StoreError> {
+        self.mirror.subgraph_exists(name)
+    }
+
+    fn entity_changes_in_block(
+        &self,
+        subgraph_id: &DeploymentHash,
+        block: BlockNumber,
+    ) -> Result<Vec<EntityOperation>, StoreError> {
+        let (store, site) = self.store(subgraph_id)?;
+        let changes = store.get_changes(site, block)?;
+        Ok(changes)
+    }
+
+    fn input_schema(&self, id: &DeploymentHash) -> Result<Arc<Schema>, StoreError> {
+        let (store, site) = self.store(id)?;
+        let info = store.subgraph_info(&site)?;
+        Ok(info.input)
+    }
+
+    fn api_schema(
+        &self,
+        id: &DeploymentHash,
+        version: &ApiVersion,
+    ) -> Result<Arc<ApiSchema>, StoreError> {
+        let (store, site) = self.store(id)?;
+        let info = store.subgraph_info(&site)?;
+        Ok(info.api.get(version).unwrap().clone())
+    }
+
+    fn debug_fork(
+        &self,
+        id: &DeploymentHash,
+        logger: Logger,
+    ) -> Result<Option<Arc<dyn SubgraphFork>>, StoreError> {
+        let (store, site) = self.store(id)?;
+        let info = store.subgraph_info(&site)?;
+        let fork_id = info.debug_fork;
+        let schema = info.input;
+
+        match (self.fork_base.as_ref(), fork_id) {
+            (Some(base), Some(id)) => Ok(Some(Arc::new(fork::SubgraphFork::new(
+                base.clone(),
+                id,
+                schema,
+                logger,
+            )?))),
+            _ => Ok(None),
+        }
+    }
+
+    async fn writable(
+        self: Arc<Self>,
+        logger: Logger,
+        deployment: graph::components::store::DeploymentId,
+    ) -> Result<Arc<dyn store::WritableStore>, StoreError> {
+        let deployment = deployment.into();
+        // We cache writables to make sure calls to this method are
+        // idempotent and there is ever only one `WritableStore` for any
+        // deployment
+        if let Some(writable) = self.writables.lock().unwrap().get(&deployment) {
+            // A poisoned writable will not write anything anymore; we
+            // discard it and create a new one that is properly initialized
+            // according to the state in the database.
+            if !writable.poisoned() {
+                return Ok(writable.cheap_clone());
+            }
+        }
+
+        // Ideally the lower level functions would be asyncified.
+        let this = self.clone();
+        let site = graph::spawn_blocking_allow_panic(move || -> Result<_, StoreError> {
+            this.find_site(deployment)
+        })
+        .await
+        .unwrap()?; // Propagate panics, there shouldn't be any.
+
+        let writable = Arc::new(
+            WritableStore::new(self.as_ref().clone(), logger, site, self.registry.clone()).await?,
+        );
+        self.writables
+            .lock()
+            .unwrap()
+            .insert(deployment, writable.cheap_clone());
+        Ok(writable)
+    }
+
+    fn is_deployed(&self, id: &DeploymentHash) -> Result<bool, StoreError> {
+        match self.site(id) {
+            Ok(_) => Ok(true),
+            Err(StoreError::DeploymentNotFound(_)) => Ok(false),
+            Err(e) => Err(e),
+        }
+    }
+
+    async fn least_block_ptr(&self, id: &DeploymentHash) -> Result<Option<BlockPtr>, StoreError> {
+        let (store, site) = self.store(id)?;
+        store.block_ptr(site.cheap_clone()).await
+    }
+
+    async fn is_healthy(&self, id: &DeploymentHash) -> Result<bool, StoreError> {
+        let (store, site) = self.store(id)?;
+        let health = store.health(&site).await?;
+        Ok(matches!(health, SubgraphHealth::Healthy))
+    }
+
+    /// Find the deployment locators for the subgraph with the given hash
+    fn locators(&self, hash: &str) -> Result<Vec<DeploymentLocator>, StoreError> {
+        Ok(self
+            .mirror
+            .find_sites(&[hash.to_string()], false)?
+            .iter()
+            .map(|site| site.into())
+            .collect())
+    }
+}
diff --git a/store/postgres/src/transaction_receipt.rs b/store/postgres/src/transaction_receipt.rs
new file mode 100644
index 0000000..81da9fb
--- /dev/null
+++ b/store/postgres/src/transaction_receipt.rs
@@ -0,0 +1,71 @@
+use diesel::sql_types::{Binary, Nullable};
+use diesel_derives::QueryableByName;
+use graph::prelude::transaction_receipt::LightTransactionReceipt;
+use itertools::Itertools;
+use std::convert::TryFrom;
+
+/// Type that comes straight out of a SQL query
+#[derive(QueryableByName)]
+pub(crate) struct RawTransactionReceipt {
+    #[sql_type = "Binary"]
+    transaction_hash: Vec<u8>,
+    #[sql_type = "Binary"]
+    transaction_index: Vec<u8>,
+    #[sql_type = "Nullable<Binary>"]
+    block_hash: Option<Vec<u8>>,
+    #[sql_type = "Nullable<Binary>"]
+    block_number: Option<Vec<u8>>,
+    #[sql_type = "Nullable<Binary>"]
+    gas_used: Option<Vec<u8>>,
+    #[sql_type = "Nullable<Binary>"]
+    status: Option<Vec<u8>>,
+}
+
+impl TryFrom<RawTransactionReceipt> for LightTransactionReceipt {
+    type Error = anyhow::Error;
+
+    fn try_from(value: RawTransactionReceipt) -> Result<Self, Self::Error> {
+        let RawTransactionReceipt {
+            transaction_hash,
+            transaction_index,
+            block_hash,
+            block_number,
+            gas_used,
+            status,
+        } = value;
+
+        let transaction_hash = drain_vector(transaction_hash)?;
+        let transaction_index = drain_vector(transaction_index)?;
+        let block_hash = block_hash.map(drain_vector).transpose()?;
+        let block_number = block_number.map(drain_vector).transpose()?;
+        let gas_used = gas_used.map(drain_vector).transpose()?;
+        let status = status.map(drain_vector).transpose()?;
+
+        Ok(LightTransactionReceipt {
+            transaction_hash: transaction_hash.into(),
+            transaction_index: transaction_index.into(),
+            block_hash: block_hash.map(Into::into),
+            block_number: block_number.map(Into::into),
+            gas_used: gas_used.map(Into::into),
+            status: status.map(Into::into),
+        })
+    }
+}
+
+/// Converts Vec<u8> to [u8; N], where N is the vector's expected lenght.
+/// Fails if input size is larger than output size.
+pub(crate) fn drain_vector<const N: usize>(input: Vec<u8>) -> Result<[u8; N], anyhow::Error> {
+    anyhow::ensure!(input.len() <= N, "source is larger than output");
+    let mut output = [0u8; N];
+    let start = output.len() - input.len();
+    output[start..].iter_mut().set_from(input);
+    Ok(output)
+}
+
+#[test]
+fn test_drain_vector() {
+    let input = vec![191, 153, 17];
+    let expected_output = [0, 0, 0, 0, 0, 191, 153, 17];
+    let result = drain_vector(input).expect("failed to drain vector into array");
+    assert_eq!(result, expected_output);
+}
diff --git a/store/postgres/src/writable.rs b/store/postgres/src/writable.rs
new file mode 100644
index 0000000..417fe36
--- /dev/null
+++ b/store/postgres/src/writable.rs
@@ -0,0 +1,1110 @@
+use std::sync::atomic::{AtomicBool, Ordering};
+use std::sync::Mutex;
+use std::time::Duration;
+use std::{collections::BTreeMap, sync::Arc};
+
+use graph::blockchain::block_stream::FirehoseCursor;
+use graph::components::store::EntityKey;
+use graph::components::store::ReadStore;
+use graph::data::subgraph::schema;
+use graph::env::env_var;
+use graph::prelude::{
+    BlockNumber, Entity, MetricsRegistry, Schema, SubgraphStore as _, BLOCK_NUMBER_MAX,
+};
+use graph::slog::info;
+use graph::util::bounded_queue::BoundedQueue;
+use graph::{
+    cheap_clone::CheapClone,
+    components::store::{self, EntityType, WritableStore as WritableStoreTrait},
+    data::subgraph::schema::SubgraphError,
+    prelude::{
+        BlockPtr, DeploymentHash, EntityModification, Error, Logger, StopwatchMetrics, StoreError,
+        StoreEvent, UnfailOutcome, ENV_VARS,
+    },
+    slog::{error, warn},
+    util::backoff::ExponentialBackoff,
+};
+use store::StoredDynamicDataSource;
+
+use crate::deployment_store::DeploymentStore;
+use crate::{primary, primary::Site, relational::Layout, SubgraphStore};
+
+graph::prelude::lazy_static! {
+    /// The size of the write queue; this many blocks can be buffered for
+    /// writing before calls to transact block operations will block.
+    /// Setting this to `0` disables pipelined writes, and writes will be
+    /// done synchronously.
+    pub static ref WRITE_QUEUE_SIZE: usize = {
+        env_var("GRAPH_STORE_WRITE_QUEUE", 5)
+    };
+}
+
+/// A wrapper around `SubgraphStore` that only exposes functions that are
+/// safe to call from `WritableStore`, i.e., functions that either do not
+/// deal with anything that depends on a specific deployment
+/// location/instance, or where the result is independent of the deployment
+/// instance
+struct WritableSubgraphStore(SubgraphStore);
+
+impl WritableSubgraphStore {
+    fn primary_conn(&self) -> Result<primary::Connection, StoreError> {
+        self.0.primary_conn()
+    }
+
+    pub(crate) fn send_store_event(&self, event: &StoreEvent) -> Result<(), StoreError> {
+        self.0.send_store_event(event)
+    }
+
+    fn layout(&self, id: &DeploymentHash) -> Result<Arc<Layout>, StoreError> {
+        self.0.layout(id)
+    }
+}
+
+/// Write synchronously to the actual store, i.e., once a method returns,
+/// the changes have been committed to the store and are visible to anybody
+/// else connecting to that database
+struct SyncStore {
+    logger: Logger,
+    store: WritableSubgraphStore,
+    writable: Arc<DeploymentStore>,
+    site: Arc<Site>,
+    input_schema: Arc<Schema>,
+}
+
+impl SyncStore {
+    const BACKOFF_BASE: Duration = Duration::from_millis(100);
+    const BACKOFF_CEIL: Duration = Duration::from_secs(10);
+
+    fn new(
+        subgraph_store: SubgraphStore,
+        logger: Logger,
+        site: Arc<Site>,
+    ) -> Result<Self, StoreError> {
+        let store = WritableSubgraphStore(subgraph_store.clone());
+        let writable = subgraph_store.for_site(site.as_ref())?.clone();
+        let input_schema = subgraph_store.input_schema(&site.deployment)?;
+        Ok(Self {
+            logger,
+            store,
+            writable,
+            site,
+            input_schema,
+        })
+    }
+
+    fn log_backoff_warning(&self, op: &str, backoff: &ExponentialBackoff) {
+        warn!(self.logger,
+            "database unavailable, will retry";
+            "operation" => op,
+            "attempt" => backoff.attempt,
+            "delay_ms" => backoff.delay().as_millis());
+    }
+
+    fn retry<T, F>(&self, op: &str, f: F) -> Result<T, StoreError>
+    where
+        F: Fn() -> Result<T, StoreError>,
+    {
+        let mut backoff = ExponentialBackoff::new(Self::BACKOFF_BASE, Self::BACKOFF_CEIL);
+        loop {
+            match f() {
+                Ok(v) => return Ok(v),
+                Err(StoreError::DatabaseUnavailable) => {
+                    self.log_backoff_warning(op, &backoff);
+                }
+                Err(e) => return Err(e),
+            }
+            backoff.sleep();
+        }
+    }
+
+    async fn retry_async<T, F, Fut>(&self, op: &str, f: F) -> Result<T, StoreError>
+    where
+        F: Fn() -> Fut,
+        Fut: std::future::Future<Output = Result<T, StoreError>>,
+    {
+        let mut backoff = ExponentialBackoff::new(Self::BACKOFF_BASE, Self::BACKOFF_CEIL);
+        loop {
+            match f().await {
+                Ok(v) => return Ok(v),
+                Err(StoreError::DatabaseUnavailable) => {
+                    self.log_backoff_warning(op, &backoff);
+                }
+                Err(e) => return Err(e),
+            }
+            backoff.sleep_async().await;
+        }
+    }
+
+    /// Try to send a `StoreEvent`; if sending fails, log the error but
+    /// return `Ok(())`
+    fn try_send_store_event(&self, event: StoreEvent) -> Result<(), StoreError> {
+        if !ENV_VARS.store.disable_subscription_notifications {
+            let _ = self.store.send_store_event(&event).map_err(
+                |e| error!(self.logger, "Could not send store event"; "error" => e.to_string()),
+            );
+            Ok(())
+        } else {
+            Ok(())
+        }
+    }
+}
+
+// Methods that mirror `WritableStoreTrait`
+impl SyncStore {
+    async fn block_ptr(&self) -> Result<Option<BlockPtr>, StoreError> {
+        self.retry_async("block_ptr", || {
+            let site = self.site.clone();
+            async move { self.writable.block_ptr(site).await }
+        })
+        .await
+    }
+
+    async fn block_cursor(&self) -> Result<FirehoseCursor, StoreError> {
+        self.writable
+            .block_cursor(self.site.cheap_clone())
+            .await
+            .map(FirehoseCursor::from)
+    }
+
+    fn start_subgraph_deployment(&self, logger: &Logger) -> Result<(), StoreError> {
+        self.retry("start_subgraph_deployment", || {
+            let graft_base = match self.writable.graft_pending(&self.site.deployment)? {
+                Some((base_id, base_ptr)) => {
+                    let src = self.store.layout(&base_id)?;
+                    Some((src, base_ptr))
+                }
+                None => None,
+            };
+            self.writable
+                .start_subgraph(logger, self.site.clone(), graft_base)?;
+            self.store.primary_conn()?.copy_finished(self.site.as_ref())
+        })
+    }
+
+    fn revert_block_operations(
+        &self,
+        block_ptr_to: BlockPtr,
+        firehose_cursor: &FirehoseCursor,
+    ) -> Result<(), StoreError> {
+        self.retry("revert_block_operations", || {
+            let event = self.writable.revert_block_operations(
+                self.site.clone(),
+                block_ptr_to.clone(),
+                firehose_cursor,
+            )?;
+
+            self.try_send_store_event(event)
+        })
+    }
+
+    fn unfail_deterministic_error(
+        &self,
+        current_ptr: &BlockPtr,
+        parent_ptr: &BlockPtr,
+    ) -> Result<UnfailOutcome, StoreError> {
+        self.retry("unfail_deterministic_error", || {
+            self.writable
+                .unfail_deterministic_error(self.site.clone(), current_ptr, parent_ptr)
+        })
+    }
+
+    fn unfail_non_deterministic_error(
+        &self,
+        current_ptr: &BlockPtr,
+    ) -> Result<UnfailOutcome, StoreError> {
+        self.retry("unfail_non_deterministic_error", || {
+            self.writable
+                .unfail_non_deterministic_error(self.site.clone(), current_ptr)
+        })
+    }
+
+    async fn fail_subgraph(&self, error: SubgraphError) -> Result<(), StoreError> {
+        self.retry_async("fail_subgraph", || {
+            let error = error.clone();
+            async {
+                self.writable
+                    .clone()
+                    .fail_subgraph(self.site.deployment.clone(), error)
+                    .await
+            }
+        })
+        .await
+    }
+
+    async fn supports_proof_of_indexing(&self) -> Result<bool, StoreError> {
+        self.retry_async("supports_proof_of_indexing", || async {
+            self.writable
+                .supports_proof_of_indexing(self.site.clone())
+                .await
+        })
+        .await
+    }
+
+    fn get(&self, key: &EntityKey, block: BlockNumber) -> Result<Option<Entity>, StoreError> {
+        self.retry("get", || {
+            self.writable.get(self.site.cheap_clone(), key, block)
+        })
+    }
+
+    fn transact_block_operations(
+        &self,
+        block_ptr_to: &BlockPtr,
+        firehose_cursor: &FirehoseCursor,
+        mods: &[EntityModification],
+        stopwatch: &StopwatchMetrics,
+        data_sources: &[StoredDynamicDataSource],
+        deterministic_errors: &[SubgraphError],
+        manifest_idx_and_name: &[(u32, String)],
+        offchain_to_remove: &[StoredDynamicDataSource],
+    ) -> Result<(), StoreError> {
+        self.retry("transact_block_operations", move || {
+            let event = self.writable.transact_block_operations(
+                self.site.clone(),
+                block_ptr_to,
+                firehose_cursor,
+                mods,
+                stopwatch,
+                data_sources,
+                deterministic_errors,
+                manifest_idx_and_name,
+                offchain_to_remove,
+            )?;
+
+            let _section = stopwatch.start_section("send_store_event");
+            self.try_send_store_event(event)?;
+            Ok(())
+        })
+    }
+
+    fn get_many(
+        &self,
+        ids_for_type: BTreeMap<&EntityType, Vec<&str>>,
+        block: BlockNumber,
+    ) -> Result<BTreeMap<EntityType, Vec<Entity>>, StoreError> {
+        self.retry("get_many", || {
+            self.writable
+                .get_many(self.site.cheap_clone(), &ids_for_type, block)
+        })
+    }
+
+    async fn is_deployment_synced(&self) -> Result<bool, StoreError> {
+        self.retry_async("is_deployment_synced", || async {
+            self.writable
+                .exists_and_synced(self.site.deployment.cheap_clone())
+                .await
+        })
+        .await
+    }
+
+    fn unassign_subgraph(&self) -> Result<(), StoreError> {
+        self.retry("unassign_subgraph", || {
+            let pconn = self.store.primary_conn()?;
+            pconn.transaction(|| -> Result<_, StoreError> {
+                let changes = pconn.unassign_subgraph(self.site.as_ref())?;
+                self.store.send_store_event(&StoreEvent::new(changes))
+            })
+        })
+    }
+
+    async fn load_dynamic_data_sources(
+        &self,
+        block: BlockNumber,
+        manifest_idx_and_name: Vec<(u32, String)>,
+    ) -> Result<Vec<StoredDynamicDataSource>, StoreError> {
+        self.retry_async("load_dynamic_data_sources", || async {
+            self.writable
+                .load_dynamic_data_sources(
+                    self.site.cheap_clone(),
+                    block,
+                    manifest_idx_and_name.clone(),
+                )
+                .await
+        })
+        .await
+    }
+
+    fn deployment_synced(&self) -> Result<(), StoreError> {
+        self.retry("deployment_synced", || {
+            let event = {
+                // Make sure we drop `pconn` before we call into the deployment
+                // store so that we do not hold two database connections which
+                // might come from the same pool and could therefore deadlock
+                let pconn = self.store.primary_conn()?;
+                pconn.transaction(|| -> Result<_, Error> {
+                    let changes = pconn.promote_deployment(&self.site.deployment)?;
+                    Ok(StoreEvent::new(changes))
+                })?
+            };
+
+            self.writable.deployment_synced(&self.site.deployment)?;
+
+            self.store.send_store_event(&event)
+        })
+    }
+
+    fn shard(&self) -> &str {
+        self.site.shard.as_str()
+    }
+
+    async fn health(&self) -> Result<schema::SubgraphHealth, StoreError> {
+        self.retry_async("health", || async {
+            self.writable.health(&self.site).await.map(Into::into)
+        })
+        .await
+    }
+
+    fn input_schema(&self) -> Arc<Schema> {
+        self.input_schema.clone()
+    }
+}
+
+/// Track block numbers we see in a few methods that traverse the queue to
+/// help determine which changes in the queue will actually be visible in
+/// the database once the whole queue has been processed and the block
+/// number at which queries should run so that they only consider data that
+/// is not affected by any requests currently queued.
+///
+/// The tracker relies on `update` being called in the order newest request
+/// in the queue to oldest request so that reverts are seen before the
+/// writes that they revert.
+struct BlockTracker {
+    /// The smallest block number that has been reverted to
+    revert: BlockNumber,
+    /// The largest block number that is not affected by entries in the
+    /// queue
+    block: BlockNumber,
+}
+
+impl BlockTracker {
+    fn new() -> Self {
+        Self {
+            revert: BLOCK_NUMBER_MAX,
+            block: BLOCK_NUMBER_MAX,
+        }
+    }
+
+    fn update(&mut self, req: &Request) {
+        match req {
+            Request::Write { block_ptr, .. } => {
+                self.block = self.block.min(block_ptr.number - 1);
+            }
+            Request::RevertTo { block_ptr, .. } => {
+                // `block_ptr` is the block pointer we are reverting _to_,
+                // and is not affected by the revert
+                self.revert = self.revert.min(block_ptr.number);
+                self.block = self.block.min(block_ptr.number);
+            }
+        }
+    }
+
+    /// The block at which a query should run so it does not see the result
+    /// of any writes that might have happened concurrently but have already
+    /// been accounted for by inspecting the in-memory queue
+    fn query_block(&self) -> BlockNumber {
+        self.block
+    }
+
+    /// Return `true` if a write at this block will be visible, i.e., not
+    /// reverted by a previous queue entry
+    fn visible(&self, block_ptr: &BlockPtr) -> bool {
+        block_ptr.number <= self.revert
+    }
+}
+
+/// A write request received from the `WritableStore` frontend that gets
+/// queued
+enum Request {
+    Write {
+        store: Arc<SyncStore>,
+        stopwatch: StopwatchMetrics,
+        /// The block at which we are writing the changes
+        block_ptr: BlockPtr,
+        firehose_cursor: FirehoseCursor,
+        mods: Vec<EntityModification>,
+        data_sources: Vec<StoredDynamicDataSource>,
+        deterministic_errors: Vec<SubgraphError>,
+        manifest_idx_and_name: Vec<(u32, String)>,
+        offchain_to_remove: Vec<StoredDynamicDataSource>,
+    },
+    RevertTo {
+        store: Arc<SyncStore>,
+        /// The subgraph head will be at this block pointer after the revert
+        block_ptr: BlockPtr,
+        firehose_cursor: FirehoseCursor,
+    },
+}
+
+impl Request {
+    fn execute(&self) -> Result<(), StoreError> {
+        match self {
+            Request::Write {
+                store,
+                stopwatch,
+                block_ptr: block_ptr_to,
+                firehose_cursor,
+                mods,
+                data_sources,
+                deterministic_errors,
+                manifest_idx_and_name,
+                offchain_to_remove,
+            } => store.transact_block_operations(
+                block_ptr_to,
+                firehose_cursor,
+                mods,
+                stopwatch,
+                data_sources,
+                deterministic_errors,
+                manifest_idx_and_name,
+                offchain_to_remove,
+            ),
+            Request::RevertTo {
+                store,
+                block_ptr,
+                firehose_cursor,
+            } => store.revert_block_operations(block_ptr.clone(), firehose_cursor),
+        }
+    }
+}
+
+/// A queue that asynchronously writes requests queued with `push` to the
+/// underlying store and allows retrieving information that is a combination
+/// of queued changes and changes already committed to the store.
+struct Queue {
+    store: Arc<SyncStore>,
+    /// A queue of pending requests. New requests are appended at the back,
+    /// and popped off the front for processing. When the queue only
+    /// contains `Write` requests block numbers in the requests are
+    /// increasing going front-to-back. When `Revert` requests are queued,
+    /// that is not true anymore
+    queue: BoundedQueue<Arc<Request>>,
+
+    /// The write task puts errors from `transact_block_operations` here so
+    /// we can report them on the next call to transact block operations.
+    write_err: Mutex<Option<StoreError>>,
+
+    /// True if the background worker ever encountered an error. Once that
+    /// happens, no more changes will be written, and any attempt to write
+    /// or revert will result in an error
+    poisoned: AtomicBool,
+
+    stopwatch: StopwatchMetrics,
+}
+
+/// Support for controlling the background writer (pause/resume) only for
+/// use in tests. In release builds, the checks that pause the writer are
+/// compiled out. Before `allow_steps` is called, the background writer is
+/// allowed to process as many requests as it can
+#[cfg(debug_assertions)]
+pub(crate) mod test_support {
+    use std::sync::atomic::{AtomicBool, Ordering};
+
+    use graph::{prelude::lazy_static, util::bounded_queue::BoundedQueue};
+
+    lazy_static! {
+        static ref DO_STEP: AtomicBool = AtomicBool::new(false);
+        static ref ALLOWED_STEPS: BoundedQueue<()> = BoundedQueue::with_capacity(1_000);
+    }
+
+    pub(super) async fn take_step() {
+        if DO_STEP.load(Ordering::SeqCst) {
+            ALLOWED_STEPS.pop().await
+        }
+    }
+
+    /// Allow the writer to process `steps` requests. After calling this,
+    /// the writer will only process the number of requests it is allowed to
+    pub async fn allow_steps(steps: usize) {
+        for _ in 0..steps {
+            ALLOWED_STEPS.push(()).await
+        }
+        DO_STEP.store(true, Ordering::SeqCst);
+    }
+}
+
+impl Queue {
+    /// Create a new queue and spawn a task that processes write requests
+    fn start(
+        logger: Logger,
+        store: Arc<SyncStore>,
+        capacity: usize,
+        registry: Arc<dyn MetricsRegistry>,
+    ) -> Arc<Self> {
+        async fn start_writer(queue: Arc<Queue>, logger: Logger) {
+            loop {
+                #[cfg(debug_assertions)]
+                test_support::take_step().await;
+
+                // We peek at the front of the queue, rather than pop it
+                // right away, so that query methods like `get` have access
+                // to the data while it is being written. If we popped here,
+                // these methods would not be able to see that data until
+                // the write transaction commits, causing them to return
+                // incorrect results.
+                let req = {
+                    let _section = queue.stopwatch.start_section("queue_wait");
+                    queue.queue.peek().await
+                };
+                let res = {
+                    let _section = queue.stopwatch.start_section("queue_execute");
+                    graph::spawn_blocking_allow_panic(move || req.execute()).await
+                };
+
+                let _section = queue.stopwatch.start_section("queue_pop");
+                match res {
+                    Ok(Ok(())) => {
+                        // The request has been handled. It's now safe to remove it
+                        // from the queue
+                        queue.queue.pop().await;
+                    }
+                    Ok(Err(e)) => {
+                        error!(logger, "Subgraph writer failed"; "error" => e.to_string());
+                        queue.record_err(e);
+                        return;
+                    }
+                    Err(e) => {
+                        error!(logger, "Subgraph writer paniced"; "error" => e.to_string());
+                        queue.record_err(StoreError::WriterPanic(e));
+                        return;
+                    }
+                }
+            }
+        }
+
+        let queue = BoundedQueue::with_capacity(capacity);
+        let write_err = Mutex::new(None);
+
+        // Use a separate instance of the `StopwatchMetrics` for background
+        // work since that has its own call hierarchy, and using the
+        // foreground metrics will lead to incorrect nesting of sections
+        let stopwatch = StopwatchMetrics::new(
+            logger.clone(),
+            store.site.deployment.clone(),
+            "writer",
+            registry,
+        );
+
+        let queue = Self {
+            store,
+            queue,
+            write_err,
+            poisoned: AtomicBool::new(false),
+            stopwatch,
+        };
+        let queue = Arc::new(queue);
+
+        graph::spawn(start_writer(queue.cheap_clone(), logger));
+
+        queue
+    }
+
+    /// Add a write request to the queue
+    async fn push(&self, req: Request) -> Result<(), StoreError> {
+        self.check_err()?;
+        self.queue.push(Arc::new(req)).await;
+        Ok(())
+    }
+
+    /// Wait for the background writer to finish processing queued entries
+    async fn flush(&self) -> Result<(), StoreError> {
+        self.queue.wait_empty().await;
+        self.check_err()
+    }
+
+    fn check_err(&self) -> Result<(), StoreError> {
+        if let Some(err) = self.write_err.lock().unwrap().take() {
+            return Err(err);
+        }
+        match self.poisoned.load(Ordering::SeqCst) {
+            true => Err(StoreError::Poisoned),
+            false => Ok(()),
+        }
+    }
+
+    /// Record the error `e`, mark the queue as poisoned, and remove all
+    /// pending requests. The queue can not be used anymore
+    fn record_err(&self, e: StoreError) {
+        *self.write_err.lock().unwrap() = Some(e);
+        self.poisoned.store(true, Ordering::SeqCst);
+        self.queue.clear();
+    }
+
+    /// Get the entity for `key` if it exists by looking at both the queue
+    /// and the store
+    fn get(&self, key: &EntityKey) -> Result<Option<Entity>, StoreError> {
+        enum Op {
+            Write(Entity),
+            Remove,
+        }
+
+        // Going from newest to oldest entry in the queue as `find_map` does
+        // ensures that we see reverts before we see the corresponding write
+        // request. We ignore any write request that writes blocks that have
+        // a number strictly higher than the revert with the smallest block
+        // number, as all such writes will be undone once the revert is
+        // processed.
+        let mut tracker = BlockTracker::new();
+
+        let op = self.queue.find_map(|req| {
+            tracker.update(req.as_ref());
+            match req.as_ref() {
+                Request::Write {
+                    block_ptr, mods, ..
+                } => {
+                    if tracker.visible(block_ptr) {
+                        mods.iter()
+                            .find(|emod| emod.entity_ref() == key)
+                            .map(|emod| match emod {
+                                EntityModification::Insert { data, .. }
+                                | EntityModification::Overwrite { data, .. } => {
+                                    Op::Write(data.clone())
+                                }
+                                EntityModification::Remove { .. } => Op::Remove,
+                            })
+                    } else {
+                        None
+                    }
+                }
+                Request::RevertTo { .. } => None,
+            }
+        });
+
+        match op {
+            Some(Op::Write(entity)) => Ok(Some(entity)),
+            Some(Op::Remove) => Ok(None),
+            None => self.store.get(key, tracker.query_block()),
+        }
+    }
+
+    /// Get many entities at once by looking at both the queue and the store
+    fn get_many(
+        &self,
+        mut ids_for_type: BTreeMap<&EntityType, Vec<&str>>,
+    ) -> Result<BTreeMap<EntityType, Vec<Entity>>, StoreError> {
+        // See the implementation of `get` for how we handle reverts
+        let mut tracker = BlockTracker::new();
+
+        // Get entities from entries in the queue
+        let mut map = self.queue.fold(
+            BTreeMap::new(),
+            |mut map: BTreeMap<EntityType, Vec<Entity>>, req| {
+                tracker.update(req.as_ref());
+                match req.as_ref() {
+                    Request::Write {
+                        block_ptr, mods, ..
+                    } => {
+                        if tracker.visible(block_ptr) {
+                            for emod in mods {
+                                let key = emod.entity_ref();
+                                if let Some(ids) = ids_for_type.get_mut(&key.entity_type) {
+                                    if let Some(idx) =
+                                        ids.iter().position(|id| *id == key.entity_id.as_str())
+                                    {
+                                        // We are looking for the entity
+                                        // underlying this modification. Add
+                                        // it to the result map, but also
+                                        // remove it from `ids_for_type` so
+                                        // that we don't look for it any
+                                        // more
+                                        if let Some(entity) = emod.entity() {
+                                            map.entry(key.entity_type.clone())
+                                                .or_default()
+                                                .push(entity.clone());
+                                        }
+                                        ids.swap_remove(idx);
+                                        if ids.is_empty() {
+                                            ids_for_type.remove(&key.entity_type);
+                                        }
+                                    }
+                                }
+                            }
+                        }
+                    }
+                    Request::RevertTo { .. } => { /* nothing to do */ }
+                }
+                map
+            },
+        );
+
+        // Whatever remains in `ids_for_type` needs to be gotten from the
+        // store. Take extra care to not unnecessarily copy maps
+        if !ids_for_type.is_empty() {
+            let store_map = self.store.get_many(ids_for_type, tracker.query_block())?;
+            if !store_map.is_empty() {
+                if map.is_empty() {
+                    map = store_map
+                } else {
+                    for (entity_type, mut entities) in store_map {
+                        map.entry(entity_type).or_default().append(&mut entities);
+                    }
+                }
+            }
+        }
+        Ok(map)
+    }
+
+    /// Load dynamic data sources by looking at both the queue and the store
+    async fn load_dynamic_data_sources(
+        &self,
+        manifest_idx_and_name: Vec<(u32, String)>,
+    ) -> Result<Vec<StoredDynamicDataSource>, StoreError> {
+        // See the implementation of `get` for how we handle reverts
+        let mut tracker = BlockTracker::new();
+
+        // We need to produce a list of dynamic data sources that are
+        // ordered by their creation block. We first look through all the
+        // dds that are still in the queue, and then load dds from the store
+        // as long as they were written at a block before whatever is still
+        // in the queue. The overall list of dds is the list of dds from the
+        // store plus the ones still in memory sorted by their block number.
+        let mut queue_dds = self.queue.fold(Vec::new(), |mut dds, req| {
+            tracker.update(req.as_ref());
+            match req.as_ref() {
+                Request::Write {
+                    block_ptr,
+                    data_sources,
+                    offchain_to_remove,
+                    ..
+                } => {
+                    if tracker.visible(block_ptr) {
+                        dds.extend(data_sources.clone());
+                        dds = dds
+                            .into_iter()
+                            .filter(|dds| !offchain_to_remove.contains(dds))
+                            .collect();
+                    }
+                }
+                Request::RevertTo { .. } => { /* nothing to do */ }
+            }
+            dds
+        });
+        // Using a stable sort is important here so that dds created at the
+        // same block stay in the order in which they were added (and
+        // therefore will be loaded from the store in that order once the
+        // queue has been written)
+        queue_dds.sort_by_key(|dds| dds.creation_block);
+
+        let mut dds = self
+            .store
+            .load_dynamic_data_sources(tracker.query_block(), manifest_idx_and_name)
+            .await?;
+        dds.append(&mut queue_dds);
+
+        Ok(dds)
+    }
+
+    fn poisoned(&self) -> bool {
+        self.poisoned.load(Ordering::SeqCst)
+    }
+}
+
+/// A shim to allow bypassing any pipelined store handling if need be
+enum Writer {
+    Sync(Arc<SyncStore>),
+    Async(Arc<Queue>),
+}
+
+impl Writer {
+    fn new(
+        logger: Logger,
+        store: Arc<SyncStore>,
+        capacity: usize,
+        registry: Arc<dyn MetricsRegistry>,
+    ) -> Self {
+        info!(logger, "Starting subgraph writer"; "queue_size" => capacity);
+        if capacity == 0 {
+            Self::Sync(store)
+        } else {
+            Self::Async(Queue::start(logger, store, capacity, registry))
+        }
+    }
+
+    async fn write(
+        &self,
+        block_ptr_to: BlockPtr,
+        firehose_cursor: FirehoseCursor,
+        mods: Vec<EntityModification>,
+        stopwatch: &StopwatchMetrics,
+        data_sources: Vec<StoredDynamicDataSource>,
+        deterministic_errors: Vec<SubgraphError>,
+        manifest_idx_and_name: Vec<(u32, String)>,
+        offchain_to_remove: Vec<StoredDynamicDataSource>,
+    ) -> Result<(), StoreError> {
+        match self {
+            Writer::Sync(store) => store.transact_block_operations(
+                &block_ptr_to,
+                &firehose_cursor,
+                &mods,
+                &stopwatch,
+                &data_sources,
+                &deterministic_errors,
+                &manifest_idx_and_name,
+                &offchain_to_remove,
+            ),
+            Writer::Async(queue) => {
+                let req = Request::Write {
+                    store: queue.store.cheap_clone(),
+                    stopwatch: queue.stopwatch.cheap_clone(),
+                    block_ptr: block_ptr_to,
+                    firehose_cursor,
+                    mods,
+                    data_sources,
+                    deterministic_errors,
+                    manifest_idx_and_name,
+                    offchain_to_remove,
+                };
+                queue.push(req).await
+            }
+        }
+    }
+
+    async fn revert(
+        &self,
+        block_ptr_to: BlockPtr,
+        firehose_cursor: FirehoseCursor,
+    ) -> Result<(), StoreError> {
+        match self {
+            Writer::Sync(store) => store.revert_block_operations(block_ptr_to, &firehose_cursor),
+            Writer::Async(queue) => {
+                let req = Request::RevertTo {
+                    store: queue.store.cheap_clone(),
+                    block_ptr: block_ptr_to,
+                    firehose_cursor,
+                };
+                queue.push(req).await
+            }
+        }
+    }
+
+    async fn flush(&self) -> Result<(), StoreError> {
+        match self {
+            Writer::Sync { .. } => Ok(()),
+            Writer::Async(queue) => queue.flush().await,
+        }
+    }
+
+    fn get(&self, key: &EntityKey) -> Result<Option<Entity>, StoreError> {
+        match self {
+            Writer::Sync(store) => store.get(key, BLOCK_NUMBER_MAX),
+            Writer::Async(queue) => queue.get(key),
+        }
+    }
+
+    fn get_many(
+        &self,
+        ids_for_type: BTreeMap<&EntityType, Vec<&str>>,
+    ) -> Result<BTreeMap<EntityType, Vec<Entity>>, StoreError> {
+        match self {
+            Writer::Sync(store) => store.get_many(ids_for_type, BLOCK_NUMBER_MAX),
+            Writer::Async(queue) => queue.get_many(ids_for_type),
+        }
+    }
+
+    async fn load_dynamic_data_sources(
+        &self,
+        manifest_idx_and_name: Vec<(u32, String)>,
+    ) -> Result<Vec<StoredDynamicDataSource>, StoreError> {
+        match self {
+            Writer::Sync(store) => {
+                store
+                    .load_dynamic_data_sources(BLOCK_NUMBER_MAX, manifest_idx_and_name)
+                    .await
+            }
+            Writer::Async(queue) => queue.load_dynamic_data_sources(manifest_idx_and_name).await,
+        }
+    }
+
+    fn poisoned(&self) -> bool {
+        match self {
+            Writer::Sync(_) => false,
+            Writer::Async(queue) => queue.poisoned(),
+        }
+    }
+}
+
+pub struct WritableStore {
+    store: Arc<SyncStore>,
+    block_ptr: Mutex<Option<BlockPtr>>,
+    block_cursor: Mutex<FirehoseCursor>,
+    writer: Writer,
+}
+
+impl WritableStore {
+    pub(crate) async fn new(
+        subgraph_store: SubgraphStore,
+        logger: Logger,
+        site: Arc<Site>,
+        registry: Arc<dyn MetricsRegistry>,
+    ) -> Result<Self, StoreError> {
+        let store = Arc::new(SyncStore::new(subgraph_store, logger.clone(), site)?);
+        let block_ptr = Mutex::new(store.block_ptr().await?);
+        let block_cursor = Mutex::new(store.block_cursor().await?);
+        let writer = Writer::new(
+            logger,
+            store.clone(),
+            ENV_VARS.store.write_queue_size,
+            registry,
+        );
+
+        Ok(Self {
+            store,
+            block_ptr,
+            block_cursor,
+            writer,
+        })
+    }
+
+    pub(crate) fn poisoned(&self) -> bool {
+        self.writer.poisoned()
+    }
+}
+
+impl ReadStore for WritableStore {
+    fn get(&self, key: &EntityKey) -> Result<Option<Entity>, StoreError> {
+        self.writer.get(key)
+    }
+
+    fn get_many(
+        &self,
+        ids_for_type: BTreeMap<&EntityType, Vec<&str>>,
+    ) -> Result<BTreeMap<EntityType, Vec<Entity>>, StoreError> {
+        self.writer.get_many(ids_for_type)
+    }
+
+    fn input_schema(&self) -> Arc<Schema> {
+        self.store.input_schema()
+    }
+}
+
+#[async_trait::async_trait]
+impl WritableStoreTrait for WritableStore {
+    fn block_ptr(&self) -> Option<BlockPtr> {
+        self.block_ptr.lock().unwrap().clone()
+    }
+
+    fn block_cursor(&self) -> FirehoseCursor {
+        self.block_cursor.lock().unwrap().clone()
+    }
+
+    async fn start_subgraph_deployment(&self, logger: &Logger) -> Result<(), StoreError> {
+        let store = self.store.cheap_clone();
+        let logger = logger.cheap_clone();
+        graph::spawn_blocking_allow_panic(move || store.start_subgraph_deployment(&logger))
+            .await
+            .map_err(Error::from)??;
+
+        // Refresh all in memory state in case this instance was used before
+        *self.block_ptr.lock().unwrap() = self.store.block_ptr().await?;
+        *self.block_cursor.lock().unwrap() = self.store.block_cursor().await?;
+
+        Ok(())
+    }
+
+    async fn revert_block_operations(
+        &self,
+        block_ptr_to: BlockPtr,
+        firehose_cursor: FirehoseCursor,
+    ) -> Result<(), StoreError> {
+        *self.block_ptr.lock().unwrap() = Some(block_ptr_to.clone());
+        *self.block_cursor.lock().unwrap() = firehose_cursor.clone();
+
+        self.writer.revert(block_ptr_to, firehose_cursor).await
+    }
+
+    async fn unfail_deterministic_error(
+        &self,
+        current_ptr: &BlockPtr,
+        parent_ptr: &BlockPtr,
+    ) -> Result<UnfailOutcome, StoreError> {
+        let outcome = self
+            .store
+            .unfail_deterministic_error(current_ptr, parent_ptr)?;
+
+        if let UnfailOutcome::Unfailed = outcome {
+            *self.block_ptr.lock().unwrap() = self.store.block_ptr().await?;
+            *self.block_cursor.lock().unwrap() = self.store.block_cursor().await?;
+        }
+
+        Ok(outcome)
+    }
+
+    fn unfail_non_deterministic_error(
+        &self,
+        current_ptr: &BlockPtr,
+    ) -> Result<UnfailOutcome, StoreError> {
+        // We don't have to update in memory self.block_ptr
+        // because the method call below doesn't rewind/revert
+        // any block.
+        self.store.unfail_non_deterministic_error(current_ptr)
+    }
+
+    async fn fail_subgraph(&self, error: SubgraphError) -> Result<(), StoreError> {
+        self.store.fail_subgraph(error).await
+    }
+
+    async fn supports_proof_of_indexing(&self) -> Result<bool, StoreError> {
+        self.store.supports_proof_of_indexing().await
+    }
+
+    async fn transact_block_operations(
+        &self,
+        block_ptr_to: BlockPtr,
+        firehose_cursor: FirehoseCursor,
+        mods: Vec<EntityModification>,
+        stopwatch: &StopwatchMetrics,
+        data_sources: Vec<StoredDynamicDataSource>,
+        deterministic_errors: Vec<SubgraphError>,
+        manifest_idx_and_name: Vec<(u32, String)>,
+        offchain_to_remove: Vec<StoredDynamicDataSource>,
+    ) -> Result<(), StoreError> {
+        self.writer
+            .write(
+                block_ptr_to.clone(),
+                firehose_cursor.clone(),
+                mods,
+                stopwatch,
+                data_sources,
+                deterministic_errors,
+                manifest_idx_and_name,
+                offchain_to_remove,
+            )
+            .await?;
+
+        *self.block_ptr.lock().unwrap() = Some(block_ptr_to);
+        *self.block_cursor.lock().unwrap() = firehose_cursor;
+
+        Ok(())
+    }
+
+    fn deployment_synced(&self) -> Result<(), StoreError> {
+        self.store.deployment_synced()
+    }
+
+    async fn is_deployment_synced(&self) -> Result<bool, StoreError> {
+        self.store.is_deployment_synced().await
+    }
+
+    fn unassign_subgraph(&self) -> Result<(), StoreError> {
+        self.store.unassign_subgraph()
+    }
+
+    async fn load_dynamic_data_sources(
+        &self,
+        manifest_idx_and_name: Vec<(u32, String)>,
+    ) -> Result<Vec<StoredDynamicDataSource>, StoreError> {
+        self.writer
+            .load_dynamic_data_sources(manifest_idx_and_name)
+            .await
+    }
+
+    fn shard(&self) -> &str {
+        self.store.shard()
+    }
+
+    async fn health(&self) -> Result<schema::SubgraphHealth, StoreError> {
+        self.store.health().await
+    }
+
+    async fn flush(&self) -> Result<(), StoreError> {
+        self.writer.flush().await
+    }
+}
diff --git a/store/postgres/tests/chain_head.rs b/store/postgres/tests/chain_head.rs
new file mode 100644
index 0000000..a358991
--- /dev/null
+++ b/store/postgres/tests/chain_head.rs
@@ -0,0 +1,389 @@
+//! Test ChainStore implementation of Store, in particular, how
+//! the chain head pointer gets updated in various situations
+
+use futures::executor;
+use std::future::Future;
+use std::sync::Arc;
+
+use graph::prelude::web3::types::H256;
+use graph::prelude::{anyhow::anyhow, anyhow::Error};
+use graph::prelude::{serde_json as json, EthereumBlock};
+use graph::prelude::{BlockNumber, QueryStoreManager, QueryTarget};
+use graph::{cheap_clone::CheapClone, prelude::web3::types::H160};
+use graph::{components::store::BlockStore as _, prelude::DeploymentHash};
+use graph::{components::store::ChainStore as _, prelude::EthereumCallCache as _};
+use graph_store_postgres::Store as DieselStore;
+use graph_store_postgres::{layout_for_tests::FAKE_NETWORK_SHARED, ChainStore as DieselChainStore};
+
+use test_store::block_store::{
+    FakeBlock, FakeBlockList, BLOCK_FIVE, BLOCK_FOUR, BLOCK_ONE, BLOCK_ONE_NO_PARENT,
+    BLOCK_ONE_SIBLING, BLOCK_THREE, BLOCK_THREE_NO_PARENT, BLOCK_TWO, BLOCK_TWO_NO_PARENT,
+    GENESIS_BLOCK, NO_PARENT,
+};
+use test_store::*;
+
+// The ancestor count we use for chain head updates. We keep this very small
+// to make setting up the tests easier
+const ANCESTOR_COUNT: BlockNumber = 3;
+
+/// Test harness for running database integration tests.
+fn run_test<F>(chain: FakeBlockList, test: F)
+where
+    F: Fn(Arc<DieselChainStore>, Arc<DieselStore>) -> Result<(), Error> + Send + 'static,
+{
+    run_test_sequentially(|store| async move {
+        for name in vec![NETWORK_NAME, FAKE_NETWORK_SHARED] {
+            block_store::set_chain(chain.clone(), name);
+
+            let chain_store = store.block_store().chain_store(name).expect("chain store");
+
+            // Run test
+            test(chain_store.cheap_clone(), store.cheap_clone())
+                .expect(&format!("test finishes successfully on network {}", name));
+        }
+    });
+}
+
+fn run_test_async<R, F>(chain: FakeBlockList, test: F)
+where
+    F: Fn(Arc<DieselChainStore>, Arc<DieselStore>) -> R + Send + Sync + 'static,
+    R: Future<Output = ()> + Send + 'static,
+{
+    run_test_sequentially(|store| async move {
+        for name in vec![NETWORK_NAME, FAKE_NETWORK_SHARED] {
+            block_store::set_chain(chain.clone(), name);
+
+            let chain_store = store.block_store().chain_store(name).expect("chain store");
+
+            // Run test
+            test(chain_store.cheap_clone(), store.clone()).await;
+        }
+    });
+}
+
+/// Check that `attempt_chain_head_update` works as expected on the given
+/// chain. After writing the blocks in `chain` to the store, call
+/// `attempt_chain_head_update` and check its result. Check that the new head
+/// is the one indicated in `head_exp`. If `missing` is not `None`, check that
+/// `attempt_chain_head_update` reports that block as missing
+fn check_chain_head_update(
+    chain: FakeBlockList,
+    head_exp: Option<&'static FakeBlock>,
+    missing: Option<&'static str>,
+) {
+    run_test_async(chain, move |store, _| async move {
+        let missing_act: Vec<_> = store
+            .clone()
+            .attempt_chain_head_update(ANCESTOR_COUNT)
+            .await
+            .expect("attempt_chain_head_update failed")
+            .iter()
+            .map(|h| format!("{:x}", h))
+            .collect();
+        let missing_exp: Vec<_> = missing.into_iter().collect();
+        assert_eq!(missing_exp, missing_act);
+
+        let head_hash_exp = head_exp.map(|block| block.hash.clone());
+        let head_hash_act = store
+            .chain_head_ptr()
+            .await
+            .expect("chain_head_ptr failed")
+            .map(|ebp| ebp.hash_hex());
+        assert_eq!(head_hash_exp, head_hash_act);
+    })
+}
+
+#[test]
+fn genesis_only() {
+    check_chain_head_update(vec![&*GENESIS_BLOCK], Some(&GENESIS_BLOCK), None);
+}
+
+#[test]
+fn genesis_plus_one() {
+    check_chain_head_update(vec![&*GENESIS_BLOCK, &*BLOCK_ONE], Some(&BLOCK_ONE), None);
+}
+
+#[test]
+fn genesis_plus_two() {
+    check_chain_head_update(
+        vec![&*GENESIS_BLOCK, &*BLOCK_ONE, &*BLOCK_TWO],
+        Some(&*BLOCK_TWO),
+        None,
+    );
+}
+
+#[test]
+fn genesis_plus_one_with_sibling() {
+    // Two valid blocks at the same height should give an error, but
+    // we currently get one of them at random
+    let chain = vec![&*GENESIS_BLOCK, &*BLOCK_ONE, &*BLOCK_ONE_SIBLING];
+    check_chain_head_update(chain, Some(&*BLOCK_ONE), None);
+}
+
+#[test]
+fn short_chain_missing_parent() {
+    let chain = vec![&*BLOCK_ONE_NO_PARENT];
+    check_chain_head_update(chain, None, Some(&NO_PARENT));
+}
+
+#[test]
+fn long_chain() {
+    let chain = vec![
+        &*BLOCK_ONE,
+        &*BLOCK_TWO,
+        &*BLOCK_THREE,
+        &*BLOCK_FOUR,
+        &*BLOCK_FIVE,
+    ];
+    check_chain_head_update(chain, Some(&*BLOCK_FIVE), None);
+}
+
+#[test]
+fn long_chain_missing_blocks_within_ancestor_count() {
+    // BLOCK_THREE does not have a parent in the store
+    let chain = vec![&*BLOCK_THREE, &*BLOCK_FOUR, &*BLOCK_FIVE];
+    check_chain_head_update(chain, None, Some(&BLOCK_THREE.parent_hash));
+}
+
+#[test]
+fn long_chain_missing_blocks_beyond_ancestor_count() {
+    // We don't mind missing blocks ANCESTOR_COUNT many blocks out, in
+    // this case BLOCK_ONE
+    let chain = vec![&*BLOCK_TWO, &*BLOCK_THREE, &*BLOCK_FOUR, &*BLOCK_FIVE];
+    check_chain_head_update(chain, Some(&*BLOCK_FIVE), None);
+}
+
+#[test]
+fn long_chain_with_uncles() {
+    let chain = vec![
+        &*BLOCK_ONE,
+        &*BLOCK_TWO,
+        &*BLOCK_TWO_NO_PARENT,
+        &*BLOCK_THREE,
+        &*BLOCK_THREE_NO_PARENT,
+        &*BLOCK_FOUR,
+    ];
+    check_chain_head_update(chain, Some(&*BLOCK_FOUR), None);
+}
+
+#[test]
+fn test_get_block_number() {
+    let chain = vec![&*GENESIS_BLOCK, &*BLOCK_ONE, &*BLOCK_TWO];
+    let subgraph = DeploymentHash::new("nonExistentSubgraph").unwrap();
+
+    run_test_async(chain, move |_, subgraph_store| {
+        let subgraph = subgraph.cheap_clone();
+        async move {
+            create_test_subgraph(&subgraph, "type Dummy @entity { id: ID! }").await;
+
+            let query_store = subgraph_store
+                .query_store(
+                    QueryTarget::Deployment(subgraph.cheap_clone().into(), Default::default()),
+                    false,
+                )
+                .await
+                .unwrap();
+
+            let block = query_store
+                .block_number(&GENESIS_BLOCK.block_hash())
+                .await
+                .expect("Found genesis block");
+            assert_eq!(Some(0), block);
+
+            let block = query_store
+                .block_number(&BLOCK_ONE.block_hash())
+                .await
+                .expect("Found block 1");
+            assert_eq!(Some(1), block);
+
+            let block = query_store
+                .block_number(&BLOCK_THREE.block_hash())
+                .await
+                .expect("Looked for block 3");
+            assert!(block.is_none());
+        }
+    })
+}
+
+#[test]
+fn block_hashes_by_number() {
+    let chain = vec![
+        &*GENESIS_BLOCK,
+        &*BLOCK_ONE,
+        &*BLOCK_TWO,
+        &*BLOCK_TWO_NO_PARENT,
+    ];
+    run_test(chain, move |store, _| {
+        let hashes = store.block_hashes_by_block_number(1).unwrap();
+        assert_eq!(vec![BLOCK_ONE.block_hash()], hashes);
+
+        let hashes = store.block_hashes_by_block_number(2).unwrap();
+        assert_eq!(2, hashes.len());
+        assert!(hashes.contains(&BLOCK_TWO.block_hash()));
+        assert!(hashes.contains(&BLOCK_TWO_NO_PARENT.block_hash()));
+
+        let hashes = store.block_hashes_by_block_number(127).unwrap();
+        assert_eq!(0, hashes.len());
+
+        let deleted = store
+            .confirm_block_hash(1, &BLOCK_ONE.block_hash())
+            .unwrap();
+        assert_eq!(0, deleted);
+
+        let deleted = store
+            .confirm_block_hash(2, &BLOCK_TWO.block_hash())
+            .unwrap();
+        assert_eq!(1, deleted);
+
+        // Make sure that we do not delete anything for a nonexistent block
+        let deleted = store
+            .confirm_block_hash(127, &GENESIS_BLOCK.block_hash())
+            .unwrap();
+        assert_eq!(0, deleted);
+
+        let hashes = store.block_hashes_by_block_number(1).unwrap();
+        assert_eq!(vec![BLOCK_ONE.block_hash()], hashes);
+
+        let hashes = store.block_hashes_by_block_number(2).unwrap();
+        assert_eq!(vec![BLOCK_TWO.block_hash()], hashes);
+        Ok(())
+    })
+}
+
+#[track_caller]
+fn check_ancestor(
+    store: &Arc<DieselChainStore>,
+    child: &FakeBlock,
+    offset: BlockNumber,
+    exp: &FakeBlock,
+) -> Result<(), Error> {
+    let act = executor::block_on(
+        store
+            .cheap_clone()
+            .ancestor_block(child.block_ptr(), offset),
+    )?
+    .map(json::from_value::<EthereumBlock>)
+    .transpose()?
+    .ok_or_else(|| anyhow!("block {} has no ancestor at offset {}", child.hash, offset))?;
+    let act_hash = format!("{:x}", act.block.hash.unwrap());
+    let exp_hash = &exp.hash;
+
+    if &act_hash != exp_hash {
+        Err(anyhow!(
+            "expected hash `{}` but got `{}`",
+            exp_hash,
+            act_hash
+        ))
+    } else {
+        Ok(())
+    }
+}
+
+#[test]
+fn ancestor_block_simple() {
+    let chain = vec![
+        &*GENESIS_BLOCK,
+        &*BLOCK_ONE,
+        &*BLOCK_TWO,
+        &*BLOCK_THREE,
+        &*BLOCK_FOUR,
+        &*BLOCK_FIVE,
+    ];
+
+    run_test(chain, move |store, _| -> Result<(), Error> {
+        check_ancestor(&store, &*BLOCK_FIVE, 1, &*BLOCK_FOUR)?;
+        check_ancestor(&store, &*BLOCK_FIVE, 2, &*BLOCK_THREE)?;
+        check_ancestor(&store, &*BLOCK_FIVE, 3, &*BLOCK_TWO)?;
+        check_ancestor(&store, &*BLOCK_FIVE, 4, &*BLOCK_ONE)?;
+        check_ancestor(&store, &*BLOCK_FIVE, 5, &*GENESIS_BLOCK)?;
+        check_ancestor(&store, &*BLOCK_THREE, 2, &*BLOCK_ONE)?;
+
+        for offset in [6, 7, 8, 50].iter() {
+            let offset = *offset;
+            let res = executor::block_on(
+                store
+                    .cheap_clone()
+                    .ancestor_block(BLOCK_FIVE.block_ptr(), offset),
+            );
+            assert!(res.is_err());
+        }
+
+        let block = executor::block_on(store.ancestor_block(BLOCK_TWO_NO_PARENT.block_ptr(), 1))?;
+        assert!(block.is_none());
+        Ok(())
+    });
+}
+
+#[test]
+fn ancestor_block_ommers() {
+    let chain = vec![
+        &*GENESIS_BLOCK,
+        &*BLOCK_ONE,
+        &*BLOCK_ONE_SIBLING,
+        &*BLOCK_TWO,
+    ];
+
+    run_test(chain, move |store, _| -> Result<(), Error> {
+        check_ancestor(&store, &*BLOCK_ONE, 1, &*GENESIS_BLOCK)?;
+        check_ancestor(&store, &*BLOCK_ONE_SIBLING, 1, &*GENESIS_BLOCK)?;
+        check_ancestor(&store, &*BLOCK_TWO, 1, &*BLOCK_ONE)?;
+        check_ancestor(&store, &*BLOCK_TWO, 2, &*GENESIS_BLOCK)?;
+        Ok(())
+    });
+}
+
+#[test]
+fn eth_call_cache() {
+    let chain = vec![&*GENESIS_BLOCK, &*BLOCK_ONE, &*BLOCK_TWO];
+
+    run_test(chain, |store, _| {
+        let address = H160([1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1]);
+        let call: [u8; 6] = [1, 2, 3, 4, 5, 6];
+        let return_value: [u8; 3] = [7, 8, 9];
+
+        store
+            .set_call(address, &call, BLOCK_ONE.block_ptr(), &return_value)
+            .unwrap();
+
+        let ret = store
+            .get_call(address, &call, GENESIS_BLOCK.block_ptr())
+            .unwrap();
+        assert!(ret.is_none());
+
+        let ret = store
+            .get_call(address, &call, BLOCK_ONE.block_ptr())
+            .unwrap()
+            .unwrap();
+        assert_eq!(&return_value, ret.as_slice());
+
+        let ret = store
+            .get_call(address, &call, BLOCK_TWO.block_ptr())
+            .unwrap();
+        assert!(ret.is_none());
+
+        let new_return_value: [u8; 3] = [10, 11, 12];
+        store
+            .set_call(address, &call, BLOCK_TWO.block_ptr(), &new_return_value)
+            .unwrap();
+        let ret = store
+            .get_call(address, &call, BLOCK_TWO.block_ptr())
+            .unwrap()
+            .unwrap();
+        assert_eq!(&new_return_value, ret.as_slice());
+
+        Ok(())
+    })
+}
+
+#[test]
+/// Tests only query correctness. No data is involved.
+fn test_transaction_receipts_in_block_function() {
+    let chain = vec![];
+    run_test_async(chain, move |store, _| async move {
+        let receipts = store
+            .transaction_receipts_in_block(&H256::zero())
+            .await
+            .unwrap();
+        assert!(receipts.is_empty())
+    })
+}
diff --git a/store/postgres/tests/graft.rs b/store/postgres/tests/graft.rs
new file mode 100644
index 0000000..1ed2b25
--- /dev/null
+++ b/store/postgres/tests/graft.rs
@@ -0,0 +1,541 @@
+use graph::blockchain::block_stream::FirehoseCursor;
+use lazy_static::lazy_static;
+use std::{marker::PhantomData, str::FromStr};
+use test_store::*;
+
+use graph::components::store::{
+    DeploymentLocator, EntityKey, EntityOrder, EntityQuery, EntityType, PruneReporter,
+};
+use graph::data::store::scalar;
+use graph::data::subgraph::schema::*;
+use graph::data::subgraph::*;
+use graph::prelude::*;
+use graph::semver::Version;
+use graph_store_postgres::SubgraphStore as DieselSubgraphStore;
+
+const USER_GQL: &str = "
+enum Color { yellow, red, blue, green }
+
+interface ColorAndAge {
+    id: ID!,
+    age: Int,
+    favorite_color: Color
+}
+
+type User implements ColorAndAge @entity {
+    id: ID!,
+    name: String,
+    bin_name: Bytes,
+    email: String,
+    age: Int,
+    seconds_age: BigInt,
+    weight: BigDecimal,
+    coffee: Boolean,
+    favorite_color: Color
+}
+
+type Person implements ColorAndAge @entity {
+    id: ID!,
+    name: String,
+    age: Int,
+    favorite_color: Color
+}
+";
+
+const GRAFT_GQL: &str = "
+enum Color { yellow, red, blue, green }
+
+type User @entity {
+    id: ID!,
+    name: String,
+    email: String,
+    age: Int,
+    favorite_color: Color,
+    # A column in the dst schema that does not exist in the src schema
+    added: String,
+}
+";
+
+const GRAFT_IMMUTABLE_GQL: &str = "
+enum Color { yellow, red, blue, green }
+
+type User @entity(immutable: true) {
+    id: ID!,
+    name: String,
+    email: String,
+    age: Int,
+    favorite_color: Color,
+    # A column in the dst schema that does not exist in the src schema
+    added: String,
+}
+";
+
+const USER: &str = "User";
+
+lazy_static! {
+    static ref TEST_SUBGRAPH_ID: DeploymentHash = DeploymentHash::new("testsubgraph").unwrap();
+    static ref TEST_SUBGRAPH_SCHEMA: Schema =
+        Schema::parse(USER_GQL, TEST_SUBGRAPH_ID.clone()).expect("Failed to parse user schema");
+    static ref BLOCKS: Vec<BlockPtr> = vec![
+        "bd34884280958002c51d3f7b5f853e6febeba33de0f40d15b0363006533c924f",
+        "8511fa04b64657581e3f00e14543c1d522d5d7e771b54aa3060b662ade47da13",
+        "b98fb783b49de5652097a989414c767824dff7e7fd765a63b493772511db81c1",
+        "7347afe69254df06729e123610b00b8b11f15cfae3241f9366fb113aec07489c",
+        "f8ccbd3877eb98c958614f395dd351211afb9abba187bfc1fb4ac414b099c4a6",
+        "7b0ea919e258eb2b119eb32de56b85d12d50ac6a9f7c5909f843d6172c8ba196",
+        "6b834521bb753c132fdcf0e1034803ed9068e324112f8750ba93580b393a986b",
+        "7cce080f5a49c2997a6cc65fc1cee9910fd8fc3721b7010c0b5d0873e2ac785e"
+    ]
+    .iter()
+    .enumerate()
+    .map(|(idx, hash)| BlockPtr::try_from((*hash, idx as i64)).unwrap())
+    .collect();
+}
+
+/// Test harness for running database integration tests.
+fn run_test<R, F>(test: F)
+where
+    F: FnOnce(Arc<DieselSubgraphStore>, DeploymentLocator) -> R + Send + 'static,
+    R: std::future::Future<Output = Result<(), StoreError>> + Send + 'static,
+{
+    run_test_sequentially(|store| async move {
+        let store = store.subgraph_store();
+
+        // Reset state before starting
+        remove_test_data(store.clone());
+
+        // Seed database with test data
+        let deployment = insert_test_data(store.clone()).await;
+
+        flush(&deployment).await.unwrap();
+
+        // Run test
+        test(store.cheap_clone(), deployment.clone())
+            .await
+            .expect("graft test succeeds");
+
+        store
+            .cheap_clone()
+            .writable(LOGGER.clone(), deployment.id)
+            .await
+            .unwrap()
+            .flush()
+            .await
+            .unwrap();
+    })
+}
+
+/// Inserts test data into the store.
+///
+/// Inserts data in test blocks 1, 2, and 3, leaving test blocks 3A, 4, and 4A for the tests to
+/// use.
+async fn insert_test_data(store: Arc<DieselSubgraphStore>) -> DeploymentLocator {
+    let manifest = SubgraphManifest::<graph_chain_ethereum::Chain> {
+        id: TEST_SUBGRAPH_ID.clone(),
+        spec_version: Version::new(1, 0, 0),
+        features: Default::default(),
+        description: None,
+        repository: None,
+        schema: TEST_SUBGRAPH_SCHEMA.clone(),
+        data_sources: vec![],
+        graft: None,
+        templates: vec![],
+        chain: PhantomData,
+    };
+
+    // Create SubgraphDeploymentEntity
+    let deployment = DeploymentCreate::new(&manifest, None);
+    let name = SubgraphName::new("test/graft").unwrap();
+    let node_id = NodeId::new("test").unwrap();
+    let deployment = store
+        .create_subgraph_deployment(
+            name,
+            &TEST_SUBGRAPH_SCHEMA,
+            deployment,
+            node_id,
+            "fake_network".to_string(),
+            SubgraphVersionSwitchingMode::Instant,
+        )
+        .unwrap();
+
+    let test_entity_1 = create_test_entity(
+        "1",
+        USER,
+        "Johnton",
+        "tonofjohn@email.com",
+        67 as i32,
+        184.4,
+        false,
+        None,
+    );
+    transact_entity_operations(&store, &deployment, BLOCKS[0].clone(), vec![test_entity_1])
+        .await
+        .unwrap();
+
+    let test_entity_2 = create_test_entity(
+        "2",
+        USER,
+        "Cindini",
+        "dinici@email.com",
+        43 as i32,
+        159.1,
+        true,
+        Some("red"),
+    );
+    let test_entity_3_1 = create_test_entity(
+        "3",
+        USER,
+        "Shaqueeena",
+        "queensha@email.com",
+        28 as i32,
+        111.7,
+        false,
+        Some("blue"),
+    );
+    transact_entity_operations(
+        &store,
+        &deployment,
+        BLOCKS[1].clone(),
+        vec![test_entity_2, test_entity_3_1],
+    )
+    .await
+    .unwrap();
+
+    let test_entity_3_2 = create_test_entity(
+        "3",
+        USER,
+        "Shaqueeena",
+        "teeko@email.com",
+        28 as i32,
+        111.7,
+        false,
+        None,
+    );
+    transact_entity_operations(
+        &store,
+        &deployment,
+        BLOCKS[2].clone(),
+        vec![test_entity_3_2],
+    )
+    .await
+    .unwrap();
+
+    deployment
+}
+
+/// Creates a test entity.
+fn create_test_entity(
+    id: &str,
+    entity_type: &str,
+    name: &str,
+    email: &str,
+    age: i32,
+    weight: f64,
+    coffee: bool,
+    favorite_color: Option<&str>,
+) -> EntityOperation {
+    let mut test_entity = Entity::new();
+
+    test_entity.insert("id".to_owned(), Value::String(id.to_owned()));
+    test_entity.insert("name".to_owned(), Value::String(name.to_owned()));
+    let bin_name = scalar::Bytes::from_str(&hex::encode(name)).unwrap();
+    test_entity.insert("bin_name".to_owned(), Value::Bytes(bin_name));
+    test_entity.insert("email".to_owned(), Value::String(email.to_owned()));
+    test_entity.insert("age".to_owned(), Value::Int(age));
+    test_entity.insert(
+        "seconds_age".to_owned(),
+        Value::BigInt(BigInt::from(age) * 31557600.into()),
+    );
+    test_entity.insert("weight".to_owned(), Value::BigDecimal(weight.into()));
+    test_entity.insert("coffee".to_owned(), Value::Bool(coffee));
+    test_entity.insert(
+        "favorite_color".to_owned(),
+        favorite_color
+            .map(|s| Value::String(s.to_owned()))
+            .unwrap_or(Value::Null),
+    );
+
+    EntityOperation::Set {
+        key: EntityKey {
+            entity_type: EntityType::new(entity_type.to_string()),
+            entity_id: id.into(),
+        },
+        data: test_entity,
+    }
+}
+
+/// Removes test data from the database behind the store.
+fn remove_test_data(store: Arc<DieselSubgraphStore>) {
+    store
+        .delete_all_entities_for_test_use_only()
+        .expect("deleting test entities succeeds");
+}
+
+async fn create_grafted_subgraph(
+    subgraph_id: &DeploymentHash,
+    schema: &str,
+    base_id: &str,
+    base_block: BlockPtr,
+) -> Result<DeploymentLocator, StoreError> {
+    let base = Some((DeploymentHash::new(base_id).unwrap(), base_block));
+    test_store::create_subgraph(subgraph_id, schema, base).await
+}
+
+fn find_entities(
+    store: &DieselSubgraphStore,
+    deployment: &DeploymentLocator,
+) -> (Vec<Entity>, Vec<String>) {
+    let query = EntityQuery::new(
+        deployment.hash.clone(),
+        BLOCK_NUMBER_MAX,
+        EntityCollection::All(vec![(EntityType::from(USER), AttributeNames::All)]),
+    )
+    .order(EntityOrder::Descending(
+        "name".to_string(),
+        ValueType::String,
+    ));
+
+    let entities = store
+        .find(query)
+        .expect("store.find failed to execute query");
+
+    let ids = entities
+        .iter()
+        .map(|entity| entity.id().unwrap())
+        .collect::<Vec<_>>();
+    (entities, ids)
+}
+
+async fn check_graft(
+    store: Arc<DieselSubgraphStore>,
+    deployment: DeploymentLocator,
+) -> Result<(), StoreError> {
+    let (entities, ids) = find_entities(store.as_ref(), &deployment);
+
+    assert_eq!(vec!["3", "1", "2"], ids);
+
+    // Make sure we caught Shaqueeena at block 1, before the change in
+    // email address
+    let mut shaq = entities.first().unwrap().to_owned();
+    assert_eq!(Some(&Value::from("queensha@email.com")), shaq.get("email"));
+
+    // Make our own entries for block 2
+    shaq.set("email", "shaq@gmail.com");
+    let op = EntityOperation::Set {
+        key: EntityKey {
+            entity_type: EntityType::new(USER.to_owned()),
+            entity_id: "3".into(),
+        },
+        data: shaq,
+    };
+    transact_and_wait(&store, &deployment, BLOCKS[2].clone(), vec![op])
+        .await
+        .unwrap();
+
+    let writable = store.writable(LOGGER.clone(), deployment.id).await?;
+    writable
+        .revert_block_operations(BLOCKS[1].clone(), FirehoseCursor::None)
+        .await
+        .expect("We can revert a block we just created");
+    writable.flush().await.expect("we can revert to BLOCKS[1]");
+
+    let err = {
+        match writable
+            .revert_block_operations(BLOCKS[0].clone(), FirehoseCursor::None)
+            .await
+        {
+            Ok(()) => writable.flush().await,
+            Err(e) => Err(e),
+        }
+    }
+    .expect_err("Reverting past graft point is not allowed");
+
+    assert!(err.to_string().contains("Can not revert subgraph"));
+
+    Ok(())
+}
+
+#[test]
+fn graft() {
+    run_test(|store, _| async move {
+        const SUBGRAPH: &str = "grafted";
+        const SUBGRAPH_ERR: &str = "grafted_err";
+        const SUBGRAPH_OK: &str = "grafted_ok";
+
+        let subgraph_id = DeploymentHash::new(SUBGRAPH).unwrap();
+
+        let deployment = create_grafted_subgraph(
+            &subgraph_id,
+            GRAFT_GQL,
+            TEST_SUBGRAPH_ID.as_str(),
+            BLOCKS[1].clone(),
+        )
+        .await
+        .expect("can create grafted subgraph");
+
+        check_graft(store.clone(), deployment).await.unwrap();
+
+        // The test data has an update for the entity with id 3 at block 1.
+        // We can therefore graft immutably onto block 0, but grafting onto
+        // block 1 fails because we see the deletion of the old version of
+        // the entity
+        let subgraph_id = DeploymentHash::new(SUBGRAPH_ERR).unwrap();
+
+        let err = create_grafted_subgraph(
+            &subgraph_id,
+            GRAFT_IMMUTABLE_GQL,
+            TEST_SUBGRAPH_ID.as_str(),
+            BLOCKS[1].clone(),
+        )
+        .await
+        .expect_err("grafting onto block 1 fails");
+        assert!(err.to_string().contains("can not be made immutable"));
+
+        let subgraph_id = DeploymentHash::new(SUBGRAPH_OK).unwrap();
+        let deployment = create_grafted_subgraph(
+            &subgraph_id,
+            GRAFT_IMMUTABLE_GQL,
+            TEST_SUBGRAPH_ID.as_str(),
+            BLOCKS[0].clone(),
+        )
+        .await
+        .expect("grafting onto block 0 works");
+
+        let (entities, ids) = find_entities(store.as_ref(), &deployment);
+        assert_eq!(vec!["1"], ids);
+        let shaq = entities.first().unwrap().to_owned();
+        assert_eq!(Some(&Value::from("tonofjohn@email.com")), shaq.get("email"));
+        Ok(())
+    })
+}
+
+// This test will only do something if the test configuration uses at least
+// two shards
+#[test]
+fn copy() {
+    run_test(|store, src| async move {
+        let src_shard = store.shard(&src)?;
+
+        let dst_shard = match all_shards()
+            .into_iter()
+            .find(|shard| shard.as_str() != src_shard.as_str())
+        {
+            None => {
+                // The tests are configured with just one shard, copying is not possible
+                println!("skipping copy test since there is no shard to copy to");
+                return Ok(());
+            }
+            Some(shard) => shard,
+        };
+
+        let deployment =
+            store.copy_deployment(&src, dst_shard, NODE_ID.clone(), BLOCKS[1].clone())?;
+
+        store
+            .cheap_clone()
+            .writable(LOGGER.clone(), deployment.id)
+            .await?
+            .start_subgraph_deployment(&*LOGGER)
+            .await?;
+
+        store.activate(&deployment)?;
+
+        check_graft(store, deployment).await
+    })
+}
+
+#[test]
+fn prune() {
+    fn check_at_block(
+        store: &DieselSubgraphStore,
+        src: &DeploymentLocator,
+        block: BlockNumber,
+        exp: Vec<&str>,
+    ) {
+        let query = EntityQuery::new(
+            src.hash.clone(),
+            block,
+            EntityCollection::All(vec![(
+                EntityType::new("User".to_string()),
+                AttributeNames::All,
+            )]),
+        );
+
+        let act: Vec<_> = store
+            .find(query)
+            .unwrap()
+            .into_iter()
+            .map(|entity| entity.id().unwrap())
+            .collect();
+        assert_eq!(act, exp);
+    }
+
+    async fn prune(
+        store: &DieselSubgraphStore,
+        src: &DeploymentLocator,
+        earliest_block: BlockNumber,
+    ) -> Result<(), StoreError> {
+        struct Progress;
+        impl PruneReporter for Progress {}
+        let reporter = Box::new(Progress);
+
+        store
+            .prune(reporter, &src, earliest_block, 1, 1.1)
+            .await
+            .map(|_| ())
+    }
+
+    run_test(|store, src| async move {
+        // The setup sets the subgraph pointer to block 2, we try to set
+        // earliest block to 5
+        prune(&store, &src, 5)
+            .await
+            .expect_err("setting earliest block later than latest does not work");
+
+        // Latest block 2 minus reorg threshold 1 means we need to copy
+        // final blocks from block 1, but want earliest as block 2, i.e. no
+        // final blocks which won't work
+        prune(&store, &src, 2)
+            .await
+            .expect_err("setting earliest block after last final block fails");
+
+        // Add another version for user 2 at block 4
+        let user2 = create_test_entity(
+            "2",
+            USER,
+            "Cindini",
+            "dinici@email.com",
+            44 as i32,
+            157.1,
+            true,
+            Some("red"),
+        );
+        transact_and_wait(&store, &src, BLOCKS[5].clone(), vec![user2])
+            .await
+            .unwrap();
+
+        // Setup and the above addition create these user versions:
+        // id | versions
+        // ---+---------
+        //  1 | [0,)
+        //  2 | [1,5) [5,)
+        //  3 | [1,2) [2,)
+
+        // Forward block ptr to block 5
+        transact_and_wait(&store, &src, BLOCKS[6].clone(), vec![])
+            .await
+            .unwrap();
+        // Pruning only removes the [1,2) version of user 3
+        prune(&store, &src, 3).await.expect("pruning works");
+
+        // Check which versions exist at every block, even if they are
+        // before the new earliest block, since we don't have a convenient
+        // way to load all entity versions with their block range
+        check_at_block(&store, &src, 0, vec!["1"]);
+        check_at_block(&store, &src, 1, vec!["1", "2"]);
+        for block in 2..=5 {
+            check_at_block(&store, &src, block, vec!["1", "2", "3"]);
+        }
+        Ok(())
+    })
+}
diff --git a/store/postgres/tests/relational.rs b/store/postgres/tests/relational.rs
new file mode 100644
index 0000000..cca31b8
--- /dev/null
+++ b/store/postgres/tests/relational.rs
@@ -0,0 +1,1822 @@
+//! Test mapping of GraphQL schema to a relational schema
+use diesel::connection::SimpleConnection as _;
+use diesel::pg::PgConnection;
+use graph::components::store::EntityKey;
+use graph::data::store::scalar;
+use graph::entity;
+use graph::prelude::BlockNumber;
+use graph::prelude::{
+    o, slog, tokio, web3::types::H256, DeploymentHash, Entity, EntityCollection, EntityFilter,
+    EntityOrder, EntityQuery, EntityRange, Logger, Schema, StopwatchMetrics, Value, ValueType,
+    BLOCK_NUMBER_MAX,
+};
+use graph_mock::MockMetricsRegistry;
+use graph_store_postgres::layout_for_tests::set_account_like;
+use graph_store_postgres::layout_for_tests::LayoutCache;
+use graph_store_postgres::layout_for_tests::SqlName;
+use hex_literal::hex;
+use lazy_static::lazy_static;
+use std::borrow::Cow;
+use std::panic;
+use std::str::FromStr;
+use std::sync::Arc;
+use std::thread::sleep;
+use std::time::Duration;
+
+use graph::{
+    components::store::{AttributeNames, EntityType},
+    data::store::scalar::{BigDecimal, BigInt, Bytes},
+};
+use graph_store_postgres::{
+    layout_for_tests::make_dummy_site,
+    layout_for_tests::{Layout, Namespace, STRING_PREFIX_SIZE},
+};
+
+use test_store::*;
+
+const THINGS_GQL: &str = r#"
+    type _Schema_ @fulltext(
+        name: "userSearch"
+        language: en
+        algorithm: rank
+        include: [
+            {
+                entity: "User",
+                fields: [
+                    { name: "name"},
+                    { name: "email"},
+                ]
+            }
+        ]
+    ) @fulltext(
+        name: "nullableStringsSearch"
+        language: en
+        algorithm: rank
+        include: [
+            {
+                entity: "NullableStrings",
+                fields: [
+                    { name: "name"},
+                    { name: "description"},
+                    { name: "test"},
+                ]
+            }
+        ]
+    )
+
+    type Thing @entity {
+        id: ID!
+        bigThing: Thing!
+    }
+
+    enum Color { yellow, red, BLUE }
+
+    type Scalar @entity {
+        id: ID,
+        bool: Boolean,
+        int: Int,
+        bigDecimal: BigDecimal,
+        bigDecimalArray: [BigDecimal!]!
+        string: String,
+        strings: [String!],
+        bytes: Bytes,
+        byteArray: [Bytes!],
+        bigInt: BigInt,
+        bigIntArray: [BigInt!]!
+        color: Color,
+    }
+
+    interface Pet {
+        id: ID!,
+        name: String!
+    }
+
+    type Cat implements Pet @entity {
+        id: ID!,
+        name: String!
+    }
+
+    type Dog implements Pet @entity {
+        id: ID!,
+        name: String!
+    }
+
+    type Ferret implements Pet @entity {
+        id: ID!,
+        name: String!
+    }
+
+    type Mink @entity(immutable: true) {
+        id: ID!,
+        order: Int,
+    }
+
+    type User @entity {
+        id: ID!,
+        name: String!,
+        bin_name: Bytes!,
+        email: String!,
+        age: Int!,
+        seconds_age: BigInt!,
+        weight: BigDecimal!,
+        coffee: Boolean!,
+        favorite_color: Color,
+        drinks: [String!]
+    }
+
+    type NullableStrings @entity {
+        id: ID!,
+        name: String,
+        description: String,
+        test: String
+    }
+
+    interface BytePet {
+        id: Bytes!,
+        name: String!
+    }
+
+    type ByteCat implements BytePet @entity {
+        id: Bytes!,
+        name: String!
+    }
+
+    type ByteDog implements BytePet @entity {
+        id: Bytes!,
+        name: String!
+    }
+
+    type ByteFerret implements BytePet @entity {
+        id: Bytes!,
+        name: String!
+    }
+"#;
+
+lazy_static! {
+    static ref THINGS_SUBGRAPH_ID: DeploymentHash = DeploymentHash::new("things").unwrap();
+    static ref NAMESPACE: Namespace = Namespace::new("sgd0815".to_string()).unwrap();
+    static ref LARGE_INT: BigInt = BigInt::from(std::i64::MAX).pow(17);
+    static ref LARGE_DECIMAL: BigDecimal =
+        BigDecimal::from(1) / BigDecimal::new(LARGE_INT.clone(), 1);
+    static ref BYTES_VALUE: H256 = H256::from(hex!(
+        "e8b3b02b936c4a4a331ac691ac9a86e197fb7731f14e3108602c87d4dac55160"
+    ));
+    static ref BYTES_VALUE2: H256 = H256::from(hex!(
+        "b98fb783b49de5652097a989414c767824dff7e7fd765a63b493772511db81c1"
+    ));
+    static ref BYTES_VALUE3: H256 = H256::from(hex!(
+        "977c084229c72a0fa377cae304eda9099b6a2cb5d83b25cdf0f0969b69874255"
+    ));
+    static ref SCALAR_ENTITY: Entity = {
+        let decimal = (*LARGE_DECIMAL).clone();
+        let big_int = (*LARGE_INT).clone();
+        entity! {
+            id: "one",
+            bool: true,
+            int: std::i32::MAX,
+            bigDecimal: decimal.clone(),
+            bigDecimalArray: vec![decimal.clone(), (decimal + 1.into()).clone()],
+            string: "scalar",
+            strings: vec!["left", "right", "middle"],
+            bytes: *BYTES_VALUE,
+            byteArray: vec![*BYTES_VALUE, *BYTES_VALUE2, *BYTES_VALUE3],
+            bigInt: big_int.clone(),
+            bigIntArray: vec![big_int.clone(), (big_int + 1.into()).clone()],
+            color: "yellow",
+        }
+    };
+    static ref EMPTY_NULLABLESTRINGS_ENTITY: Entity = {
+        entity! {
+            id: "one",
+        }
+    };
+    static ref SCALAR: EntityType = EntityType::from("Scalar");
+    static ref NO_ENTITY: EntityType = EntityType::from("NoEntity");
+    static ref NULLABLE_STRINGS: EntityType = EntityType::from("NullableStrings");
+    static ref MOCK_STOPWATCH: StopwatchMetrics = StopwatchMetrics::new(
+        Logger::root(slog::Discard, o!()),
+        THINGS_SUBGRAPH_ID.clone(),
+        "test",
+        Arc::new(MockMetricsRegistry::new()),
+    );
+}
+
+/// Removes test data from the database behind the store.
+fn remove_schema(conn: &PgConnection) {
+    let query = format!("drop schema if exists {} cascade", NAMESPACE.as_str());
+    conn.batch_execute(&query)
+        .expect("Failed to drop test schema");
+}
+
+fn insert_entity_at(
+    conn: &PgConnection,
+    layout: &Layout,
+    entity_type: &str,
+    mut entities: Vec<Entity>,
+    block: BlockNumber,
+) {
+    let entities_with_keys_owned = entities
+        .drain(..)
+        .map(|entity| {
+            let key = EntityKey::data(entity_type.to_owned(), entity.id().unwrap());
+            (key, entity)
+        })
+        .collect::<Vec<(EntityKey, Entity)>>();
+    let mut entities_with_keys: Vec<_> = entities_with_keys_owned
+        .iter()
+        .map(|(key, entity)| (key, Cow::from(entity)))
+        .collect();
+    let entity_type = EntityType::from(entity_type);
+    let errmsg = format!(
+        "Failed to insert entities {}[{:?}]",
+        entity_type, entities_with_keys
+    );
+    let inserted = layout
+        .insert(
+            &conn,
+            &entity_type,
+            &mut entities_with_keys,
+            block,
+            &MOCK_STOPWATCH,
+        )
+        .expect(&errmsg);
+    assert_eq!(inserted, entities_with_keys_owned.len());
+}
+
+fn insert_entity(conn: &PgConnection, layout: &Layout, entity_type: &str, entities: Vec<Entity>) {
+    insert_entity_at(conn, layout, entity_type, entities, 0);
+}
+
+fn update_entity_at(
+    conn: &PgConnection,
+    layout: &Layout,
+    entity_type: &str,
+    mut entities: Vec<Entity>,
+    block: BlockNumber,
+) {
+    let entities_with_keys_owned: Vec<(EntityKey, Entity)> = entities
+        .drain(..)
+        .map(|entity| {
+            let key = EntityKey::data(entity_type.to_owned(), entity.id().unwrap());
+            (key, entity)
+        })
+        .collect();
+    let mut entities_with_keys: Vec<_> = entities_with_keys_owned
+        .iter()
+        .map(|(key, entity)| (key, Cow::from(entity)))
+        .collect();
+
+    let entity_type = EntityType::from(entity_type);
+    let errmsg = format!(
+        "Failed to insert entities {}[{:?}]",
+        entity_type, entities_with_keys
+    );
+
+    let updated = layout
+        .update(
+            &conn,
+            &entity_type,
+            &mut entities_with_keys,
+            block,
+            &MOCK_STOPWATCH,
+        )
+        .expect(&errmsg);
+    assert_eq!(updated, entities_with_keys_owned.len());
+}
+
+fn insert_user_entity(
+    conn: &PgConnection,
+    layout: &Layout,
+    id: &str,
+    entity_type: &str,
+    name: &str,
+    email: &str,
+    age: i32,
+    weight: f64,
+    coffee: bool,
+    favorite_color: Option<&str>,
+    drinks: Option<Vec<&str>>,
+    block: BlockNumber,
+) {
+    let user = make_user(id, name, email, age, weight, coffee, favorite_color, drinks);
+
+    insert_entity_at(conn, layout, entity_type, vec![user], block);
+}
+
+fn make_user(
+    id: &str,
+    name: &str,
+    email: &str,
+    age: i32,
+    weight: f64,
+    coffee: bool,
+    favorite_color: Option<&str>,
+    drinks: Option<Vec<&str>>,
+) -> Entity {
+    let favorite_color = favorite_color
+        .map(|s| Value::String(s.to_owned()))
+        .unwrap_or(Value::Null);
+    let bin_name = Bytes::from_str(&hex::encode(name)).unwrap();
+    let mut user = entity! {
+        id: id,
+        name: name,
+        bin_name: bin_name,
+        email: email,
+        age: age,
+        seconds_age: BigInt::from(age) * BigInt::from(31557600 as u64),
+        weight: BigDecimal::from(weight),
+        coffee: coffee,
+        favorite_color: favorite_color
+    };
+    if let Some(drinks) = drinks {
+        user.insert("drinks".to_owned(), drinks.into());
+    }
+    user
+}
+
+fn insert_users(conn: &PgConnection, layout: &Layout) {
+    insert_user_entity(
+        conn,
+        layout,
+        "1",
+        "User",
+        "Johnton",
+        "tonofjohn@email.com",
+        67 as i32,
+        184.4,
+        false,
+        Some("yellow"),
+        None,
+        0,
+    );
+    insert_user_entity(
+        conn,
+        layout,
+        "2",
+        "User",
+        "Cindini",
+        "dinici@email.com",
+        43 as i32,
+        159.1,
+        true,
+        Some("red"),
+        Some(vec!["beer", "wine"]),
+        0,
+    );
+    insert_user_entity(
+        conn,
+        layout,
+        "3",
+        "User",
+        "Shaqueeena",
+        "teeko@email.com",
+        28 as i32,
+        111.7,
+        false,
+        None,
+        Some(vec!["coffee", "tea"]),
+        0,
+    );
+}
+
+fn update_user_entity(
+    conn: &PgConnection,
+    layout: &Layout,
+    id: &str,
+    entity_type: &str,
+    name: &str,
+    email: &str,
+    age: i32,
+    weight: f64,
+    coffee: bool,
+    favorite_color: Option<&str>,
+    drinks: Option<Vec<&str>>,
+    block: BlockNumber,
+) {
+    let user = make_user(id, name, email, age, weight, coffee, favorite_color, drinks);
+    update_entity_at(conn, layout, entity_type, vec![user], block);
+}
+
+fn insert_pet(
+    conn: &PgConnection,
+    layout: &Layout,
+    entity_type: &str,
+    id: &str,
+    name: &str,
+    block: BlockNumber,
+) {
+    let pet = entity! {
+        id: id,
+        name: name
+    };
+    insert_entity_at(conn, layout, entity_type, vec![pet], block);
+}
+
+fn insert_pets(conn: &PgConnection, layout: &Layout) {
+    insert_pet(conn, layout, "Dog", "pluto", "Pluto", 0);
+    insert_pet(conn, layout, "Cat", "garfield", "Garfield", 0);
+}
+
+fn create_schema(conn: &PgConnection) -> Layout {
+    let schema = Schema::parse(THINGS_GQL, THINGS_SUBGRAPH_ID.clone()).unwrap();
+    let site = make_dummy_site(
+        THINGS_SUBGRAPH_ID.clone(),
+        NAMESPACE.clone(),
+        NETWORK_NAME.to_string(),
+    );
+    let query = format!("create schema {}", NAMESPACE.as_str());
+    conn.batch_execute(&*query).unwrap();
+
+    Layout::create_relational_schema(&conn, Arc::new(site), &schema)
+        .expect("Failed to create relational schema")
+}
+
+fn scrub(entity: &Entity) -> Entity {
+    let mut scrubbed = Entity::new();
+    // merge_remove_null_fields has the side-effect of removing any attribute
+    // that is Value::Null
+    scrubbed.merge_remove_null_fields(entity.clone());
+    scrubbed
+}
+
+macro_rules! assert_entity_eq {
+    ($left:expr, $right:expr) => {{
+        let (left, right) = (&($left), &($right));
+        let mut pass = true;
+
+        for (key, left_value) in left.clone().sorted() {
+            match right.get(&key) {
+                None => {
+                    pass = false;
+                    println!("key '{}' missing from right", key);
+                }
+                Some(right_value) => {
+                    if left_value != *right_value {
+                        pass = false;
+                        println!(
+                            "values for '{}' differ:\n     left: {:?}\n    right: {:?}",
+                            key, left_value, right_value
+                        );
+                    }
+                }
+            }
+        }
+        for (key, _) in right.clone().sorted() {
+            if left.get(&key).is_none() {
+                pass = false;
+                println!("key '{}' missing from left", key);
+            }
+        }
+        assert!(pass, "left and right entities are different");
+    }};
+}
+
+/// Test harness for running database integration tests.
+fn run_test<F>(test: F)
+where
+    F: FnOnce(&PgConnection, &Layout) -> (),
+{
+    run_test_with_conn(|conn| {
+        // Reset state before starting
+        remove_schema(conn);
+
+        // Create the database schema
+        let layout = create_schema(conn);
+
+        // Run test
+        test(conn, &layout);
+    });
+}
+
+#[test]
+fn find() {
+    run_test(|conn, layout| {
+        insert_entity(&conn, &layout, "Scalar", vec![SCALAR_ENTITY.clone()]);
+
+        // Happy path: find existing entity
+        let entity = layout
+            .find(conn, &*SCALAR, "one", BLOCK_NUMBER_MAX)
+            .expect("Failed to read Scalar[one]")
+            .unwrap();
+        assert_entity_eq!(scrub(&*SCALAR_ENTITY), entity);
+
+        // Find non-existing entity
+        let entity = layout
+            .find(conn, &*SCALAR, "noone", BLOCK_NUMBER_MAX)
+            .expect("Failed to read Scalar[noone]");
+        assert!(entity.is_none());
+
+        // Find for non-existing entity type
+        let err = layout.find(conn, &*NO_ENTITY, "one", BLOCK_NUMBER_MAX);
+        match err {
+            Err(e) => assert_eq!("unknown table 'NoEntity'", e.to_string()),
+            _ => {
+                println!("{:?}", err);
+                assert!(false)
+            }
+        }
+    });
+}
+
+#[test]
+fn insert_null_fulltext_fields() {
+    run_test(|conn, layout| {
+        insert_entity(
+            &conn,
+            &layout,
+            "NullableStrings",
+            vec![EMPTY_NULLABLESTRINGS_ENTITY.clone()],
+        );
+
+        // Find entity with null string values
+        let entity = layout
+            .find(conn, &*NULLABLE_STRINGS, "one", BLOCK_NUMBER_MAX)
+            .expect("Failed to read NullableStrings[one]")
+            .unwrap();
+        assert_entity_eq!(scrub(&*EMPTY_NULLABLESTRINGS_ENTITY), entity);
+    });
+}
+
+#[test]
+fn update() {
+    run_test(|conn, layout| {
+        insert_entity(&conn, &layout, "Scalar", vec![SCALAR_ENTITY.clone()]);
+
+        // Update with overwrite
+        let mut entity = SCALAR_ENTITY.clone();
+        entity.set("string", "updated");
+        entity.remove("strings");
+        entity.set("bool", Value::Null);
+        let key = EntityKey::data("Scalar".to_owned(), entity.id().unwrap().clone());
+
+        let entity_type = EntityType::from("Scalar");
+        let mut entities = vec![(&key, Cow::from(&entity))];
+        layout
+            .update(&conn, &entity_type, &mut entities, 0, &MOCK_STOPWATCH)
+            .expect("Failed to update");
+
+        let actual = layout
+            .find(conn, &*SCALAR, "one", BLOCK_NUMBER_MAX)
+            .expect("Failed to read Scalar[one]")
+            .unwrap();
+        assert_entity_eq!(scrub(&entity), actual);
+    });
+}
+
+#[test]
+fn update_many() {
+    run_test(|conn, layout| {
+        let mut one = SCALAR_ENTITY.clone();
+        let mut two = SCALAR_ENTITY.clone();
+        two.set("id", "two");
+        let mut three = SCALAR_ENTITY.clone();
+        three.set("id", "three");
+        insert_entity(
+            &conn,
+            &layout,
+            "Scalar",
+            vec![one.clone(), two.clone(), three.clone()],
+        );
+
+        // confidence test: there should be 3 scalar entities in store right now
+        assert_eq!(3, count_scalar_entities(conn, layout));
+
+        // update with overwrite
+        one.set("string", "updated");
+        one.remove("strings");
+
+        two.set("string", "updated too");
+        two.set("bool", false);
+
+        three.set("string", "updated in a different way");
+        three.remove("strings");
+        three.set("color", "red");
+
+        // generate keys
+        let entity_type = EntityType::from("Scalar");
+        let keys: Vec<EntityKey> = ["one", "two", "three"]
+            .iter()
+            .map(|id| EntityKey::data("Scalar".to_owned(), String::from(*id)))
+            .collect();
+
+        let entities_vec = vec![one, two, three];
+        let mut entities: Vec<(&EntityKey, Cow<'_, Entity>)> = keys
+            .iter()
+            .zip(entities_vec.iter().map(|e| Cow::Borrowed(e)))
+            .collect();
+
+        layout
+            .update(&conn, &entity_type, &mut entities, 0, &MOCK_STOPWATCH)
+            .expect("Failed to update");
+
+        // check updates took effect
+        let updated: Vec<Entity> = ["one", "two", "three"]
+            .iter()
+            .map(|id| {
+                layout
+                    .find(conn, &*SCALAR, id, BLOCK_NUMBER_MAX)
+                    .expect(&format!("Failed to read Scalar[{}]", id))
+                    .unwrap()
+            })
+            .collect();
+        let new_one = &updated[0];
+        let new_two = &updated[1];
+        let new_three = &updated[2];
+
+        // check they have the same id
+        assert_eq!(new_one.get("id"), Some(&Value::String("one".to_string())));
+        assert_eq!(new_two.get("id"), Some(&Value::String("two".to_string())));
+        assert_eq!(
+            new_three.get("id"),
+            Some(&Value::String("three".to_string()))
+        );
+
+        // check their fields got updated as expected
+        assert_eq!(
+            new_one.get("string"),
+            Some(&Value::String("updated".to_string()))
+        );
+        assert_eq!(new_one.get("strings"), None);
+        assert_eq!(
+            new_two.get("string"),
+            Some(&Value::String("updated too".to_string()))
+        );
+        assert_eq!(new_two.get("bool"), Some(&Value::Bool(false)));
+        assert_eq!(
+            new_three.get("string"),
+            Some(&Value::String("updated in a different way".to_string()))
+        );
+        assert_eq!(
+            new_three.get("color"),
+            Some(&Value::String("red".to_string()))
+        );
+    });
+}
+
+/// Test that we properly handle BigDecimal values with a negative scale.
+#[test]
+fn serialize_bigdecimal() {
+    run_test(|conn, layout| {
+        insert_entity(&conn, &layout, "Scalar", vec![SCALAR_ENTITY.clone()]);
+
+        // Update with overwrite
+        let mut entity = SCALAR_ENTITY.clone();
+
+        for d in &["50", "50.00", "5000", "0.5000", "0.050", "0.5", "0.05"] {
+            let d = BigDecimal::from_str(d).unwrap();
+            entity.set("bigDecimal", d);
+
+            let key = EntityKey::data("Scalar".to_owned(), entity.id().unwrap().clone());
+            let entity_type = EntityType::from("Scalar");
+            let mut entities = vec![(&key, Cow::Borrowed(&entity))];
+            layout
+                .update(
+                    &conn,
+                    &entity_type,
+                    entities.as_mut_slice(),
+                    0,
+                    &MOCK_STOPWATCH,
+                )
+                .expect("Failed to update");
+
+            let actual = layout
+                .find(conn, &*SCALAR, "one", BLOCK_NUMBER_MAX)
+                .expect("Failed to read Scalar[one]")
+                .unwrap();
+            assert_entity_eq!(entity, actual);
+        }
+    });
+}
+
+fn count_scalar_entities(conn: &PgConnection, layout: &Layout) -> usize {
+    let filter = EntityFilter::Or(vec![
+        EntityFilter::Equal("bool".into(), true.into()),
+        EntityFilter::Equal("bool".into(), false.into()),
+    ]);
+    let collection = EntityCollection::All(vec![(SCALAR.to_owned(), AttributeNames::All)]);
+    layout
+        .query::<Entity>(
+            &*LOGGER,
+            &conn,
+            collection,
+            Some(filter),
+            EntityOrder::Default,
+            EntityRange {
+                first: None,
+                skip: 0,
+            },
+            BLOCK_NUMBER_MAX,
+            None,
+        )
+        .map(|(entities, _)| entities)
+        .expect("Count query failed")
+        .len()
+}
+
+#[test]
+fn delete() {
+    run_test(|conn, layout| {
+        insert_entity(&conn, &layout, "Scalar", vec![SCALAR_ENTITY.clone()]);
+        let mut two = SCALAR_ENTITY.clone();
+        two.set("id", "two");
+        insert_entity(&conn, &layout, "Scalar", vec![two]);
+
+        // Delete where nothing is getting deleted
+        let key = EntityKey::data("Scalar".to_owned(), "no such entity".to_owned());
+        let entity_type = EntityType::from("Scalar");
+        let mut entity_keys = vec![key.entity_id.as_str()];
+        let count = layout
+            .delete(
+                &conn,
+                &entity_type.clone(),
+                &entity_keys,
+                1,
+                &MOCK_STOPWATCH,
+            )
+            .expect("Failed to delete");
+        assert_eq!(0, count);
+        assert_eq!(2, count_scalar_entities(conn, layout));
+
+        // Delete entity two
+        entity_keys
+            .get_mut(0)
+            .map(|key| *key = "two")
+            .expect("Failed to update key");
+
+        let count = layout
+            .delete(&conn, &entity_type, &entity_keys, 1, &MOCK_STOPWATCH)
+            .expect("Failed to delete");
+        assert_eq!(1, count);
+        assert_eq!(1, count_scalar_entities(conn, layout));
+    });
+}
+
+#[test]
+fn insert_many_and_delete_many() {
+    run_test(|conn, layout| {
+        let one = SCALAR_ENTITY.clone();
+        let mut two = SCALAR_ENTITY.clone();
+        two.set("id", "two");
+        let mut three = SCALAR_ENTITY.clone();
+        three.set("id", "three");
+        insert_entity(&conn, &layout, "Scalar", vec![one, two, three]);
+
+        // confidence test: there should be 3 scalar entities in store right now
+        assert_eq!(3, count_scalar_entities(conn, layout));
+
+        // Delete entities with ids equal to "two" and "three"
+        let entity_type = EntityType::from("Scalar");
+        let entity_keys = vec!["two", "three"];
+        let num_removed = layout
+            .delete(&conn, &entity_type, &entity_keys, 1, &MOCK_STOPWATCH)
+            .expect("Failed to delete");
+        assert_eq!(2, num_removed);
+        assert_eq!(1, count_scalar_entities(conn, layout));
+    });
+}
+
+#[tokio::test]
+async fn layout_cache() {
+    // We need to use `block_on` to call the `create_test_subgraph` function which must be called
+    // from a sync context, so we replicate what we do `spawn_module`.
+    let runtime = tokio::runtime::Handle::current();
+    std::thread::spawn(move || {
+        run_test_with_conn(|conn| {
+            let _runtime_guard = runtime.enter();
+
+            let id = DeploymentHash::new("primaryLayoutCache").unwrap();
+            let _loc = graph::block_on(create_test_subgraph(&id, THINGS_GQL));
+            let site = Arc::new(primary_mirror().find_active_site(&id).unwrap().unwrap());
+            let table_name = SqlName::verbatim("scalar".to_string());
+
+            let cache = LayoutCache::new(Duration::from_millis(10));
+
+            // Without an entry, account_like is false
+            let layout = cache
+                .get(&*LOGGER, &conn, site.clone())
+                .expect("we can get the layout");
+            let table = layout.table(&table_name).unwrap();
+            assert_eq!(false, table.is_account_like);
+
+            set_account_like(conn, site.as_ref(), &table_name, true)
+                .expect("we can set 'scalar' to account-like");
+            sleep(Duration::from_millis(50));
+
+            // Flip account_like to true
+            let layout = cache
+                .get(&*LOGGER, &conn, site.clone())
+                .expect("we can get the layout");
+            let table = layout.table(&table_name).unwrap();
+            assert_eq!(true, table.is_account_like);
+
+            // Set it back to false
+            set_account_like(conn, site.as_ref(), &table_name, false)
+                .expect("we can set 'scalar' to account-like");
+            sleep(Duration::from_millis(50));
+
+            let layout = cache
+                .get(&*LOGGER, &conn, site.clone())
+                .expect("we can get the layout");
+            let table = layout.table(&table_name).unwrap();
+            assert_eq!(false, table.is_account_like);
+        })
+    })
+    .join()
+    .unwrap();
+}
+
+#[test]
+fn conflicting_entity() {
+    // `id` is the id of an entity to create, `cat`, `dog`, and `ferret` are
+    // the names of the types for which to check entity uniqueness
+    fn check(conn: &PgConnection, layout: &Layout, id: Value, cat: &str, dog: &str, ferret: &str) {
+        let cat = EntityType::from(cat);
+        let dog = EntityType::from(dog);
+        let ferret = EntityType::from(ferret);
+
+        let mut fred = Entity::new();
+        fred.set("id", id.clone());
+        fred.set("name", Value::String(id.to_string()));
+        insert_entity(&conn, &layout, cat.as_str(), vec![fred]);
+
+        // If we wanted to create Fred the dog, which is forbidden, we'd run this:
+        let conflict = layout
+            .conflicting_entity(&conn, &id.to_string(), vec![cat.clone(), ferret.clone()])
+            .unwrap();
+        assert_eq!(Some(cat.to_string()), conflict);
+
+        // If we wanted to manipulate Fred the cat, which is ok, we'd run:
+        let conflict = layout
+            .conflicting_entity(&conn, &id.to_string(), vec![dog.clone(), ferret.clone()])
+            .unwrap();
+        assert_eq!(None, conflict);
+
+        // Chairs are not pets
+        let chair = EntityType::from("Chair");
+        let result = layout.conflicting_entity(
+            &conn,
+            &id.to_string(),
+            vec![dog.clone(), ferret.clone(), chair.clone()],
+        );
+        assert!(result.is_err());
+        assert_eq!("unknown table 'Chair'", result.err().unwrap().to_string());
+    }
+
+    run_test(|conn, layout| {
+        let id = Value::String("fred".to_string());
+        check(conn, layout, id, "Cat", "Dog", "Ferret");
+
+        let id = Value::Bytes(scalar::Bytes::from_str("0xf1ed").unwrap());
+        check(conn, layout, id, "ByteCat", "ByteDog", "ByteFerret");
+    })
+}
+
+#[test]
+fn revert_block() {
+    fn check_fred(conn: &PgConnection, layout: &Layout) {
+        let id = "fred";
+
+        let set_fred = |name, block| {
+            let fred = entity! {
+                id: id,
+                name: name
+            };
+            if block == 0 {
+                insert_entity_at(conn, layout, "Cat", vec![fred], block);
+            } else {
+                update_entity_at(conn, layout, "Cat", vec![fred], block);
+            }
+        };
+
+        let assert_fred = |name: &str| {
+            let fred = layout
+                .find(conn, &EntityType::from("Cat"), id, BLOCK_NUMBER_MAX)
+                .unwrap()
+                .expect("there's a fred");
+            assert_eq!(name, fred.get("name").unwrap().as_str().unwrap())
+        };
+
+        set_fred("zero", 0);
+        set_fred("one", 1);
+        set_fred("two", 2);
+        set_fred("three", 3);
+
+        layout.revert_block(conn, 3).unwrap();
+        assert_fred("two");
+        layout.revert_block(conn, 2).unwrap();
+        assert_fred("one");
+
+        set_fred("three", 3);
+        assert_fred("three");
+        layout.revert_block(conn, 3).unwrap();
+        assert_fred("one");
+    }
+
+    fn check_marty(conn: &PgConnection, layout: &Layout) {
+        let set_marties = |from, to| {
+            for block in from..=to {
+                let id = format!("marty-{}", block);
+                let marty = entity! {
+                    id: id,
+                    order: block,
+                };
+                insert_entity_at(conn, layout, "Mink", vec![marty], block);
+            }
+        };
+
+        let assert_marties = |max_block, except: Vec<BlockNumber>| {
+            let marties: Vec<Entity> = layout
+                .query(
+                    &*LOGGER,
+                    conn,
+                    EntityCollection::All(vec![(EntityType::from("Mink"), AttributeNames::All)]),
+                    Some(EntityFilter::StartsWith(
+                        "id".to_string(),
+                        Value::from("marty"),
+                    )),
+                    EntityOrder::Ascending("order".to_string(), ValueType::Int),
+                    EntityRange::first(100),
+                    BLOCK_NUMBER_MAX,
+                    None,
+                )
+                .map(|(entities, _)| entities)
+                .expect("loading all marties works");
+
+            let mut skipped = 0;
+            for block in 0..=max_block {
+                if except.contains(&block) {
+                    skipped += 1;
+                    continue;
+                }
+                let marty = &marties[block as usize - skipped];
+                let id = format!("marty-{}", block);
+                assert_eq!(id, marty.get("id").unwrap().as_str().unwrap());
+                assert_eq!(block, marty.get("order").unwrap().as_int().unwrap())
+            }
+        };
+
+        let assert_all_marties = |max_block| assert_marties(max_block, vec![]);
+
+        set_marties(0, 4);
+        assert_all_marties(4);
+
+        layout.revert_block(conn, 3).unwrap();
+        assert_all_marties(2);
+        layout.revert_block(conn, 2).unwrap();
+        assert_all_marties(1);
+
+        set_marties(4, 4);
+        // We don't have entries for 2 and 3 anymore
+        assert_marties(4, vec![2, 3]);
+
+        layout.revert_block(conn, 2).unwrap();
+        assert_all_marties(1);
+    }
+
+    run_test(|conn, layout| {
+        check_fred(conn, layout);
+        check_marty(conn, layout);
+    });
+}
+
+struct QueryChecker<'a> {
+    conn: &'a PgConnection,
+    layout: &'a Layout,
+}
+
+impl<'a> QueryChecker<'a> {
+    fn new(conn: &'a PgConnection, layout: &'a Layout) -> Self {
+        insert_users(conn, layout);
+        update_user_entity(
+            conn,
+            layout,
+            "1",
+            "User",
+            "Jono",
+            "achangedemail@email.com",
+            67 as i32,
+            184.4,
+            false,
+            Some("yellow"),
+            None,
+            0,
+        );
+        insert_pets(conn, layout);
+
+        Self { conn, layout }
+    }
+
+    fn check(self, expected_entity_ids: Vec<&'static str>, query: EntityQuery) -> Self {
+        let q = query.clone();
+        let unordered = matches!(query.order, EntityOrder::Unordered);
+        let entities = self
+            .layout
+            .query::<Entity>(
+                &*LOGGER,
+                self.conn,
+                query.collection,
+                query.filter,
+                query.order,
+                query.range,
+                BLOCK_NUMBER_MAX,
+                None,
+            )
+            .expect("layout.query failed to execute query")
+            .0;
+
+        let mut entity_ids: Vec<_> = entities
+            .into_iter()
+            .map(|entity| match entity.get("id") {
+                Some(Value::String(id)) => id.to_owned(),
+                Some(_) => panic!("layout.query returned entity with non-string ID attribute"),
+                None => panic!("layout.query returned entity with no ID attribute"),
+            })
+            .collect();
+
+        let mut expected_entity_ids: Vec<String> =
+            expected_entity_ids.into_iter().map(str::to_owned).collect();
+
+        if unordered {
+            entity_ids.sort();
+            expected_entity_ids.sort();
+        }
+
+        assert_eq!(entity_ids, expected_entity_ids, "{:?}", q);
+        self
+    }
+}
+
+fn query(entity_types: Vec<&str>) -> EntityQuery {
+    EntityQuery::new(
+        THINGS_SUBGRAPH_ID.clone(),
+        BLOCK_NUMBER_MAX,
+        EntityCollection::All(
+            entity_types
+                .into_iter()
+                .map(|entity_type| (EntityType::from(entity_type), AttributeNames::All))
+                .collect(),
+        ),
+    )
+}
+
+fn user_query() -> EntityQuery {
+    query(vec!["User"])
+}
+
+trait EasyOrder {
+    fn asc(self, attr: &str) -> Self;
+    fn desc(self, attr: &str) -> Self;
+    fn unordered(self) -> Self;
+}
+
+impl EasyOrder for EntityQuery {
+    fn asc(self, attr: &str) -> Self {
+        // The ValueType doesn't matter since relational layouts ignore it
+        self.order(EntityOrder::Ascending(attr.to_owned(), ValueType::String))
+    }
+
+    fn desc(self, attr: &str) -> Self {
+        // The ValueType doesn't matter since relational layouts ignore it
+        self.order(EntityOrder::Descending(attr.to_owned(), ValueType::String))
+    }
+
+    fn unordered(self) -> Self {
+        self.order(EntityOrder::Unordered)
+    }
+}
+
+#[test]
+#[should_panic(
+    expected = "layout.query failed to execute query: FulltextQueryInvalidSyntax(\"syntax error in tsquery: \\\"Jono 'a\\\"\")"
+)]
+fn check_fulltext_search_syntax_error() {
+    run_test(move |conn, layout| {
+        QueryChecker::new(conn, layout).check(
+            vec!["1"],
+            user_query().filter(EntityFilter::Equal("userSearch".into(), "Jono 'a".into())),
+        );
+    });
+}
+
+#[test]
+fn check_block_finds() {
+    run_test(move |conn, layout| {
+        let checker = QueryChecker::new(conn, layout);
+
+        update_user_entity(
+            conn,
+            layout,
+            "1",
+            "User",
+            "Johnton",
+            "tonofjohn@email.com",
+            67 as i32,
+            184.4,
+            false,
+            Some("yellow"),
+            None,
+            1,
+        );
+
+        checker
+            // Max block, we should get nothing
+            .check(
+                vec![],
+                user_query().filter(EntityFilter::ChangeBlockGte(BLOCK_NUMBER_MAX)),
+            )
+            // Initial block, we should get here all data
+            .check(
+                vec!["1", "2", "3"],
+                user_query().filter(EntityFilter::ChangeBlockGte(0)),
+            )
+            // Block with an update, we should have one only
+            .check(
+                vec!["1"],
+                user_query().filter(EntityFilter::ChangeBlockGte(1)),
+            );
+    });
+}
+
+#[test]
+fn check_find() {
+    run_test(move |conn, layout| {
+        // find with interfaces
+        let checker = QueryChecker::new(conn, layout)
+            .check(vec!["garfield", "pluto"], query(vec!["Cat", "Dog"]))
+            .check(
+                vec!["pluto", "garfield"],
+                query(vec!["Cat", "Dog"]).desc("name"),
+            )
+            .check(
+                vec!["garfield"],
+                query(vec!["Cat", "Dog"])
+                    .filter(EntityFilter::StartsWith("name".into(), Value::from("Gar")))
+                    .desc("name"),
+            )
+            .check(
+                vec!["pluto", "garfield"],
+                query(vec!["Cat", "Dog"]).desc("id"),
+            )
+            .check(
+                vec!["garfield", "pluto"],
+                query(vec!["Cat", "Dog"]).asc("id"),
+            )
+            .check(
+                vec!["garfield", "pluto"],
+                query(vec!["Cat", "Dog"]).unordered(),
+            );
+
+        // fulltext
+        let checker = checker
+            .check(
+                vec!["3"],
+                user_query().filter(EntityFilter::Equal("userSearch".into(), "Shaq:*".into())),
+            )
+            .check(
+                vec!["1"],
+                user_query().filter(EntityFilter::Equal(
+                    "userSearch".into(),
+                    "Jono & achangedemail@email.com".into(),
+                )),
+            );
+
+        // list contains
+        fn drinks_query(v: Vec<&str>) -> EntityQuery {
+            let drinks: Option<Value> = Some(v.into());
+            user_query().filter(EntityFilter::Contains("drinks".into(), drinks.into()))
+        }
+
+        let checker = checker
+            .check(vec!["2"], drinks_query(vec!["beer"]))
+            // Reverse of how we stored it
+            .check(vec!["3"], drinks_query(vec!["tea", "coffee"]))
+            .check(vec![], drinks_query(vec!["beer", "tea"]))
+            .check(vec![], drinks_query(vec!["beer", "water"]))
+            .check(vec![], drinks_query(vec!["beer", "wine", "water"]));
+
+        // list not contains
+        let checker = checker
+            // User 3 do not have "beer" on its drinks list.
+            .check(
+                vec!["3"],
+                user_query().filter(EntityFilter::NotContains(
+                    "drinks".into(),
+                    vec!["beer"].into(),
+                )),
+            )
+            // Users 2 do not have "tea" on its drinks list.
+            .check(
+                vec!["2"],
+                user_query().filter(EntityFilter::NotContains(
+                    "drinks".into(),
+                    vec!["tea"].into(),
+                )),
+            );
+
+        // string attributes
+        let checker = checker
+            .check(
+                vec!["2"],
+                user_query().filter(EntityFilter::Contains("name".into(), "ind".into())),
+            )
+            .check(
+                vec!["2"],
+                user_query().filter(EntityFilter::Equal("name".to_owned(), "Cindini".into())),
+            )
+            // Test that we can order by id
+            .check(
+                vec!["2"],
+                user_query()
+                    .filter(EntityFilter::Equal("name".to_owned(), "Cindini".into()))
+                    .desc("id"),
+            )
+            .check(
+                vec!["1", "3"],
+                user_query()
+                    .filter(EntityFilter::Not("name".to_owned(), "Cindini".into()))
+                    .asc("name"),
+            )
+            .check(
+                vec!["3"],
+                user_query().filter(EntityFilter::GreaterThan("name".to_owned(), "Kundi".into())),
+            )
+            .check(
+                vec!["2", "1"],
+                user_query()
+                    .filter(EntityFilter::LessThan("name".to_owned(), "Kundi".into()))
+                    .asc("name"),
+            )
+            .check(
+                vec!["1", "2"],
+                user_query()
+                    .filter(EntityFilter::LessThan("name".to_owned(), "Kundi".into()))
+                    .desc("name"),
+            )
+            .check(
+                vec!["1"],
+                user_query()
+                    .filter(EntityFilter::LessThan("name".to_owned(), "ZZZ".into()))
+                    .desc("name")
+                    .first(1)
+                    .skip(1),
+            )
+            .check(
+                vec!["2"],
+                user_query()
+                    .filter(EntityFilter::And(vec![
+                        EntityFilter::LessThan("name".to_owned(), "Cz".into()),
+                        EntityFilter::Equal("name".to_owned(), "Cindini".into()),
+                    ]))
+                    .desc("name"),
+            )
+            .check(
+                vec!["2"],
+                user_query()
+                    .filter(EntityFilter::EndsWith("name".to_owned(), "ini".into()))
+                    .desc("name"),
+            )
+            .check(
+                vec!["3", "1"],
+                user_query()
+                    .filter(EntityFilter::NotEndsWith("name".to_owned(), "ini".into()))
+                    .desc("name"),
+            )
+            .check(
+                vec!["1"],
+                user_query()
+                    .filter(EntityFilter::In(
+                        "name".to_owned(),
+                        vec!["Jono".into(), "Nobody".into(), "Still nobody".into()],
+                    ))
+                    .desc("name"),
+            )
+            .check(
+                vec![],
+                user_query().filter(EntityFilter::In("name".to_owned(), vec![])),
+            )
+            .check(
+                vec!["1", "2"],
+                user_query()
+                    .filter(EntityFilter::NotIn(
+                        "name".to_owned(),
+                        vec!["Shaqueeena".into()],
+                    ))
+                    .desc("name"),
+            );
+        // float attributes
+        let checker = checker
+            .check(
+                vec!["1"],
+                user_query().filter(EntityFilter::Equal(
+                    "weight".to_owned(),
+                    Value::BigDecimal(184.4.into()),
+                )),
+            )
+            .check(
+                vec!["3", "2"],
+                user_query()
+                    .filter(EntityFilter::Not(
+                        "weight".to_owned(),
+                        Value::BigDecimal(184.4.into()),
+                    ))
+                    .desc("name"),
+            )
+            .check(
+                vec!["1"],
+                user_query().filter(EntityFilter::GreaterThan(
+                    "weight".to_owned(),
+                    Value::BigDecimal(160.0.into()),
+                )),
+            )
+            .check(
+                vec!["2", "3"],
+                user_query()
+                    .filter(EntityFilter::LessThan(
+                        "weight".to_owned(),
+                        Value::BigDecimal(160.0.into()),
+                    ))
+                    .asc("name"),
+            )
+            .check(
+                vec!["3", "2"],
+                user_query()
+                    .filter(EntityFilter::LessThan(
+                        "weight".to_owned(),
+                        Value::BigDecimal(160.0.into()),
+                    ))
+                    .desc("name"),
+            )
+            .check(
+                vec!["2"],
+                user_query()
+                    .filter(EntityFilter::LessThan(
+                        "weight".to_owned(),
+                        Value::BigDecimal(161.0.into()),
+                    ))
+                    .desc("name")
+                    .first(1)
+                    .skip(1),
+            )
+            .check(
+                vec!["3", "1"],
+                user_query()
+                    .filter(EntityFilter::In(
+                        "weight".to_owned(),
+                        vec![
+                            Value::BigDecimal(184.4.into()),
+                            Value::BigDecimal(111.7.into()),
+                        ],
+                    ))
+                    .desc("name")
+                    .first(5),
+            )
+            .check(
+                vec!["2"],
+                user_query()
+                    .filter(EntityFilter::NotIn(
+                        "weight".to_owned(),
+                        vec![
+                            Value::BigDecimal(184.4.into()),
+                            Value::BigDecimal(111.7.into()),
+                        ],
+                    ))
+                    .desc("name")
+                    .first(5),
+            );
+
+        // int attributes
+        let checker = checker
+            .check(
+                vec!["1"],
+                user_query()
+                    .filter(EntityFilter::Equal("age".to_owned(), Value::Int(67 as i32)))
+                    .desc("name"),
+            )
+            .check(
+                vec!["3", "2"],
+                user_query()
+                    .filter(EntityFilter::Not("age".to_owned(), Value::Int(67 as i32)))
+                    .desc("name"),
+            )
+            .check(
+                vec!["1"],
+                user_query().filter(EntityFilter::GreaterThan(
+                    "age".to_owned(),
+                    Value::Int(43 as i32),
+                )),
+            )
+            .check(
+                vec!["2", "1"],
+                user_query()
+                    .filter(EntityFilter::GreaterOrEqual(
+                        "age".to_owned(),
+                        Value::Int(43 as i32),
+                    ))
+                    .asc("name"),
+            )
+            .check(
+                vec!["2", "3"],
+                user_query()
+                    .filter(EntityFilter::LessThan(
+                        "age".to_owned(),
+                        Value::Int(50 as i32),
+                    ))
+                    .asc("name"),
+            )
+            .check(
+                vec!["2", "3"],
+                user_query()
+                    .filter(EntityFilter::LessOrEqual(
+                        "age".to_owned(),
+                        Value::Int(43 as i32),
+                    ))
+                    .asc("name"),
+            )
+            .check(
+                vec!["3", "2"],
+                user_query()
+                    .filter(EntityFilter::LessThan(
+                        "age".to_owned(),
+                        Value::Int(50 as i32),
+                    ))
+                    .desc("name"),
+            )
+            .check(
+                vec!["2"],
+                user_query()
+                    .filter(EntityFilter::LessThan(
+                        "age".to_owned(),
+                        Value::Int(67 as i32),
+                    ))
+                    .desc("name")
+                    .first(1)
+                    .skip(1),
+            )
+            .check(
+                vec!["1", "2"],
+                user_query()
+                    .filter(EntityFilter::In(
+                        "age".to_owned(),
+                        vec![Value::Int(67 as i32), Value::Int(43 as i32)],
+                    ))
+                    .desc("name")
+                    .first(5),
+            )
+            .check(
+                vec!["3"],
+                user_query()
+                    .filter(EntityFilter::NotIn(
+                        "age".to_owned(),
+                        vec![Value::Int(67 as i32), Value::Int(43 as i32)],
+                    ))
+                    .desc("name")
+                    .first(5),
+            );
+
+        // bool attributes
+        let checker = checker
+            .check(
+                vec!["2"],
+                user_query()
+                    .filter(EntityFilter::Equal("coffee".to_owned(), Value::Bool(true)))
+                    .desc("name"),
+            )
+            .check(
+                vec!["1", "3"],
+                user_query()
+                    .filter(EntityFilter::Not("coffee".to_owned(), Value::Bool(true)))
+                    .asc("name"),
+            )
+            .check(
+                vec!["2"],
+                user_query()
+                    .filter(EntityFilter::In(
+                        "coffee".to_owned(),
+                        vec![Value::Bool(true)],
+                    ))
+                    .desc("name")
+                    .first(5),
+            )
+            .check(
+                vec!["3", "1"],
+                user_query()
+                    .filter(EntityFilter::NotIn(
+                        "coffee".to_owned(),
+                        vec![Value::Bool(true)],
+                    ))
+                    .desc("name")
+                    .first(5),
+            );
+        // misc tests
+        let checker = checker
+            .check(
+                vec!["1"],
+                user_query()
+                    .filter(EntityFilter::Equal(
+                        "bin_name".to_owned(),
+                        Value::Bytes("Jono".as_bytes().into()),
+                    ))
+                    .desc("name"),
+            )
+            .check(
+                vec!["3"],
+                user_query()
+                    .filter(EntityFilter::Equal(
+                        "favorite_color".to_owned(),
+                        Value::Null,
+                    ))
+                    .desc("name"),
+            )
+            .check(
+                vec!["1", "2"],
+                user_query()
+                    .filter(EntityFilter::Not("favorite_color".to_owned(), Value::Null))
+                    .desc("name"),
+            )
+            .check(
+                vec!["1", "2"],
+                user_query()
+                    .filter(EntityFilter::NotIn(
+                        "favorite_color".to_owned(),
+                        vec![Value::Null],
+                    ))
+                    .desc("name"),
+            )
+            .check(
+                vec!["1", "2"],
+                user_query()
+                    .filter(EntityFilter::NotIn(
+                        "favorite_color".to_owned(),
+                        vec!["red".into(), Value::Null],
+                    ))
+                    .desc("name"),
+            )
+            .check(vec!["3", "2", "1"], user_query().asc("weight"))
+            .check(vec!["1", "2", "3"], user_query().desc("weight"))
+            .check(vec!["1", "2", "3"], user_query().unordered())
+            .check(vec!["1", "2", "3"], user_query().asc("id"))
+            .check(vec!["3", "2", "1"], user_query().desc("id"))
+            .check(vec!["1", "2", "3"], user_query().unordered())
+            .check(vec!["3", "2", "1"], user_query().asc("age"))
+            .check(vec!["1", "2", "3"], user_query().desc("age"))
+            .check(vec!["2", "1", "3"], user_query().asc("name"))
+            .check(vec!["3", "1", "2"], user_query().desc("name"))
+            .check(
+                vec!["1", "2"],
+                user_query()
+                    .filter(EntityFilter::And(vec![EntityFilter::Or(vec![
+                        EntityFilter::Equal("id".to_owned(), Value::from("1")),
+                        EntityFilter::Equal("id".to_owned(), Value::from("2")),
+                    ])]))
+                    .asc("id"),
+            );
+
+        // enum attributes
+        let checker = checker
+            .check(
+                vec!["2"],
+                user_query()
+                    .filter(EntityFilter::Equal(
+                        "favorite_color".to_owned(),
+                        "red".into(),
+                    ))
+                    .desc("name"),
+            )
+            .check(
+                vec!["1"],
+                user_query()
+                    .filter(EntityFilter::Not("favorite_color".to_owned(), "red".into()))
+                    .asc("name"),
+            )
+            .check(
+                vec!["2"],
+                user_query()
+                    .filter(EntityFilter::In(
+                        "favorite_color".to_owned(),
+                        vec!["red".into()],
+                    ))
+                    .desc("name")
+                    .first(5),
+            )
+            .check(
+                vec!["1"],
+                user_query()
+                    .filter(EntityFilter::NotIn(
+                        "favorite_color".to_owned(),
+                        vec!["red".into()],
+                    ))
+                    .desc("name")
+                    .first(5),
+            );
+
+        // empty and / or
+
+        // It's somewhat arbitrary that we define empty 'or' and 'and' to
+        // be 'true' and 'false'; it's mostly this way since that's what the
+        // JSONB storage filters do
+
+        checker
+            // An empty 'or' is 'false'
+            .check(
+                vec![],
+                user_query().filter(EntityFilter::And(vec![EntityFilter::Or(vec![])])),
+            )
+            // An empty 'and' is 'true'
+            .check(
+                vec!["1", "2", "3"],
+                user_query().filter(EntityFilter::Or(vec![EntityFilter::And(vec![])])),
+            );
+    })
+}
+
+// We call our test strings aN so that
+//   aN = "a" * (STRING_PREFIX_SIZE - 2 + N)
+// chosen so that they straddle the boundary between strings that fit into
+// the index, and strings that have only a prefix in the index
+// Return (a1, a2, a2b, a3)
+// Note that that is the order for these ids, though the
+// underlying strings are in the order a1 < a2 < a3 < a2b
+fn ferrets() -> (String, String, String, String) {
+    (
+        "a".repeat(STRING_PREFIX_SIZE - 1),
+        "a".repeat(STRING_PREFIX_SIZE),
+        format!("{}b", "a".repeat(STRING_PREFIX_SIZE)),
+        "a".repeat(STRING_PREFIX_SIZE + 1),
+    )
+}
+
+struct FilterChecker<'a> {
+    conn: &'a PgConnection,
+    layout: &'a Layout,
+}
+
+impl<'a> FilterChecker<'a> {
+    fn new(conn: &'a PgConnection, layout: &'a Layout) -> Self {
+        let (a1, a2, a2b, a3) = ferrets();
+        insert_pet(conn, layout, "Ferret", "a1", &a1, 0);
+        insert_pet(conn, layout, "Ferret", "a2", &a2, 0);
+        insert_pet(conn, layout, "Ferret", "a2b", &a2b, 0);
+        insert_pet(conn, layout, "Ferret", "a3", &a3, 0);
+
+        Self { conn, layout }
+    }
+
+    fn check(&self, expected_entity_ids: Vec<&'static str>, filter: EntityFilter) -> &Self {
+        let expected_entity_ids: Vec<String> =
+            expected_entity_ids.into_iter().map(str::to_owned).collect();
+
+        let query = query(vec!["Ferret"]).filter(filter).asc("id");
+
+        let entities = self
+            .layout
+            .query::<Entity>(
+                &*LOGGER,
+                &self.conn,
+                query.collection,
+                query.filter,
+                query.order,
+                query.range,
+                BLOCK_NUMBER_MAX,
+                None,
+            )
+            .expect("layout.query failed to execute query")
+            .0;
+
+        let entity_ids: Vec<_> = entities
+            .into_iter()
+            .map(|entity| match entity.get("id") {
+                Some(Value::String(id)) => id.to_owned(),
+                Some(_) => panic!("layout.query returned entity with non-string ID attribute"),
+                None => panic!("layout.query returned entity with no ID attribute"),
+            })
+            .collect();
+
+        assert_eq!(expected_entity_ids, entity_ids);
+        self
+    }
+}
+
+#[test]
+fn check_filters() {
+    let (a1, a2, a2b, a3) = ferrets();
+
+    fn filter_eq(name: &str) -> EntityFilter {
+        EntityFilter::Equal("name".to_owned(), name.into())
+    }
+
+    fn filter_block_gte(block: BlockNumber) -> EntityFilter {
+        EntityFilter::ChangeBlockGte(block)
+    }
+
+    fn filter_not(name: &str) -> EntityFilter {
+        EntityFilter::Not("name".to_owned(), name.into())
+    }
+
+    fn filter_lt(name: &str) -> EntityFilter {
+        EntityFilter::LessThan("name".to_owned(), name.into())
+    }
+
+    fn filter_le(name: &str) -> EntityFilter {
+        EntityFilter::LessOrEqual("name".to_owned(), name.into())
+    }
+
+    fn filter_gt(name: &str) -> EntityFilter {
+        EntityFilter::GreaterThan("name".to_owned(), name.into())
+    }
+
+    fn filter_ge(name: &str) -> EntityFilter {
+        EntityFilter::GreaterOrEqual("name".to_owned(), name.into())
+    }
+
+    fn filter_in(names: Vec<&str>) -> EntityFilter {
+        EntityFilter::In(
+            "name".to_owned(),
+            names
+                .into_iter()
+                .map(|name| Value::from(name.to_owned()))
+                .collect(),
+        )
+    }
+
+    fn filter_not_in(names: Vec<&str>) -> EntityFilter {
+        EntityFilter::NotIn(
+            "name".to_owned(),
+            names
+                .into_iter()
+                .map(|name| Value::from(name.to_owned()))
+                .collect(),
+        )
+    }
+
+    run_test(move |conn, layout| {
+        let checker = FilterChecker::new(conn, layout);
+
+        checker
+            .check(vec!["a1"], filter_eq(&a1))
+            .check(vec!["a2"], filter_eq(&a2))
+            .check(vec!["a2b"], filter_eq(&a2b))
+            .check(vec!["a3"], filter_eq(&a3));
+
+        checker
+            .check(vec!["a2", "a2b", "a3"], filter_not(&a1))
+            .check(vec!["a1", "a2b", "a3"], filter_not(&a2))
+            .check(vec!["a1", "a2", "a3"], filter_not(&a2b))
+            .check(vec!["a1", "a2", "a2b"], filter_not(&a3));
+
+        checker
+            .check(vec![], filter_lt(&a1))
+            .check(vec!["a1"], filter_lt(&a2))
+            .check(vec!["a1", "a2", "a3"], filter_lt(&a2b))
+            .check(vec!["a1", "a2"], filter_lt(&a3));
+
+        checker
+            .check(vec!["a1"], filter_le(&a1))
+            .check(vec!["a1", "a2"], filter_le(&a2))
+            .check(vec!["a1", "a2", "a2b", "a3"], filter_le(&a2b))
+            .check(vec!["a1", "a2", "a3"], filter_le(&a3));
+
+        checker
+            .check(vec!["a2", "a2b", "a3"], filter_gt(&a1))
+            .check(vec!["a2b", "a3"], filter_gt(&a2))
+            .check(vec![], filter_gt(&a2b))
+            .check(vec!["a2b"], filter_gt(&a3));
+
+        checker
+            .check(vec!["a1", "a2", "a2b", "a3"], filter_ge(&a1))
+            .check(vec!["a2", "a2b", "a3"], filter_ge(&a2))
+            .check(vec!["a2b"], filter_ge(&a2b))
+            .check(vec!["a2b", "a3"], filter_ge(&a3));
+
+        checker
+            .check(vec!["a1"], filter_in(vec![&a1]))
+            .check(vec!["a2"], filter_in(vec![&a2]))
+            .check(vec!["a2b"], filter_in(vec![&a2b]))
+            .check(vec!["a3"], filter_in(vec![&a3]))
+            .check(vec!["a1", "a2"], filter_in(vec![&a1, &a2]))
+            .check(vec!["a1", "a3"], filter_in(vec![&a1, &a3]));
+
+        checker
+            .check(vec!["a2", "a2b", "a3"], filter_not_in(vec![&a1]))
+            .check(vec!["a1", "a2b", "a3"], filter_not_in(vec![&a2]))
+            .check(vec!["a1", "a2", "a3"], filter_not_in(vec![&a2b]))
+            .check(vec!["a1", "a2", "a2b"], filter_not_in(vec![&a3]))
+            .check(vec!["a2b", "a3"], filter_not_in(vec![&a1, &a2]))
+            .check(vec!["a2", "a2b"], filter_not_in(vec![&a1, &a3]));
+
+        update_entity_at(
+            conn,
+            layout,
+            "Ferret",
+            vec![entity! {
+              id: "a1",
+              name: "Test"
+            }],
+            1,
+        );
+
+        checker
+            .check(vec!["a1", "a2", "a2b", "a3"], filter_block_gte(0))
+            .check(vec!["a1"], filter_block_gte(1))
+            .check(vec![], filter_block_gte(BLOCK_NUMBER_MAX));
+    });
+}
diff --git a/store/postgres/tests/relational_bytes.rs b/store/postgres/tests/relational_bytes.rs
new file mode 100644
index 0000000..56fe6eb
--- /dev/null
+++ b/store/postgres/tests/relational_bytes.rs
@@ -0,0 +1,513 @@
+//! Test relational schemas that use `Bytes` to store ids
+use diesel::connection::SimpleConnection as _;
+use diesel::pg::PgConnection;
+use graph::components::store::EntityKey;
+use graph::data::store::scalar;
+use graph_mock::MockMetricsRegistry;
+use hex_literal::hex;
+use lazy_static::lazy_static;
+use std::borrow::Cow;
+use std::str::FromStr;
+use std::{collections::BTreeMap, sync::Arc};
+
+use graph::prelude::{
+    o, slog, web3::types::H256, AttributeNames, ChildMultiplicity, DeploymentHash, Entity,
+    EntityCollection, EntityLink, EntityOrder, EntityRange, EntityWindow, Logger, ParentLink,
+    Schema, StopwatchMetrics, Value, WindowAttribute, BLOCK_NUMBER_MAX,
+};
+use graph::{
+    components::store::EntityType,
+    data::store::scalar::{BigDecimal, BigInt},
+};
+use graph_store_postgres::{
+    layout_for_tests::make_dummy_site,
+    layout_for_tests::{Layout, Namespace},
+};
+
+use test_store::*;
+
+const THINGS_GQL: &str = "
+    type Thing @entity {
+        id: Bytes!
+        name: String!
+        # We use these only in the EntityQuery tests
+        parent: Thing
+        children: [Thing!]
+    }
+";
+
+macro_rules! entity {
+    ($($name:ident: $value:expr,)*) => {
+        {
+            let mut result = ::graph::prelude::Entity::new();
+            $(
+                result.insert(stringify!($name).to_string(), Value::from($value));
+            )*
+            result
+        }
+    };
+    ($($name:ident: $value:expr),*) => {
+        entity! {$($name: $value,)*}
+    };
+}
+
+lazy_static! {
+    static ref THINGS_SUBGRAPH_ID: DeploymentHash = DeploymentHash::new("things").unwrap();
+    static ref LARGE_INT: BigInt = BigInt::from(std::i64::MAX).pow(17);
+    static ref LARGE_DECIMAL: BigDecimal =
+        BigDecimal::from(1) / BigDecimal::new(LARGE_INT.clone(), 1);
+    static ref BYTES_VALUE: H256 = H256::from(hex!(
+        "e8b3b02b936c4a4a331ac691ac9a86e197fb7731f14e3108602c87d4dac55160"
+    ));
+    static ref BYTES_VALUE2: H256 = H256::from(hex!(
+        "b98fb783b49de5652097a989414c767824dff7e7fd765a63b493772511db81c1"
+    ));
+    static ref BYTES_VALUE3: H256 = H256::from(hex!(
+        "977c084229c72a0fa377cae304eda9099b6a2cb5d83b25cdf0f0969b69874255"
+    ));
+    static ref BEEF_ENTITY: Entity = entity! {
+        id: scalar::Bytes::from_str("deadbeef").unwrap(),
+        name: "Beef",
+    };
+    static ref NAMESPACE: Namespace = Namespace::new("sgd0815".to_string()).unwrap();
+    static ref THING: EntityType = EntityType::from("Thing");
+    static ref MOCK_STOPWATCH: StopwatchMetrics = StopwatchMetrics::new(
+        Logger::root(slog::Discard, o!()),
+        THINGS_SUBGRAPH_ID.clone(),
+        "test",
+        Arc::new(MockMetricsRegistry::new()),
+    );
+}
+
+/// Removes test data from the database behind the store.
+fn remove_test_data(conn: &PgConnection) {
+    let query = format!("drop schema if exists {} cascade", NAMESPACE.as_str());
+    conn.batch_execute(&query)
+        .expect("Failed to drop test schema");
+}
+
+fn insert_entity(conn: &PgConnection, layout: &Layout, entity_type: &str, entity: Entity) {
+    let key = EntityKey::data(entity_type.to_owned(), entity.id().unwrap());
+
+    let entity_type = EntityType::from(entity_type);
+    let mut entities = vec![(&key, Cow::from(&entity))];
+    let errmsg = format!("Failed to insert entity {}[{}]", entity_type, key.entity_id);
+    layout
+        .insert(
+            &conn,
+            &entity_type,
+            entities.as_mut_slice(),
+            0,
+            &MOCK_STOPWATCH,
+        )
+        .expect(&errmsg);
+}
+
+fn insert_thing(conn: &PgConnection, layout: &Layout, id: &str, name: &str) {
+    insert_entity(
+        conn,
+        layout,
+        "Thing",
+        entity! {
+            id: id,
+            name: name
+        },
+    );
+}
+
+fn create_schema(conn: &PgConnection) -> Layout {
+    let schema = Schema::parse(THINGS_GQL, THINGS_SUBGRAPH_ID.clone()).unwrap();
+
+    let query = format!("create schema {}", NAMESPACE.as_str());
+    conn.batch_execute(&*query).unwrap();
+
+    let site = make_dummy_site(
+        THINGS_SUBGRAPH_ID.clone(),
+        NAMESPACE.clone(),
+        NETWORK_NAME.to_string(),
+    );
+    Layout::create_relational_schema(&conn, Arc::new(site), &schema)
+        .expect("Failed to create relational schema")
+}
+
+fn scrub(entity: &Entity) -> Entity {
+    let mut scrubbed = Entity::new();
+    // merge has the sideffect of removing any attribute
+    // that is Value::Null
+    scrubbed.merge(entity.clone());
+    scrubbed
+}
+
+macro_rules! assert_entity_eq {
+    ($left:expr, $right:expr) => {{
+        let (left, right) = (&($left), &($right));
+        let mut pass = true;
+
+        for (key, left_value) in left.clone().sorted() {
+            match right.get(&key) {
+                None => {
+                    pass = false;
+                    println!("key '{}' missing from right", key);
+                }
+                Some(right_value) => {
+                    if left_value != *right_value {
+                        pass = false;
+                        println!(
+                            "values for '{}' differ:\n     left: {:?}\n    right: {:?}",
+                            key, left_value, right_value
+                        );
+                    }
+                }
+            }
+        }
+        for (key, _) in right.clone().sorted() {
+            if left.get(&key).is_none() {
+                pass = false;
+                println!("key '{}' missing from left", key);
+            }
+        }
+        assert!(pass, "left and right entities are different");
+    }};
+}
+
+fn run_test<F>(test: F)
+where
+    F: FnOnce(&PgConnection, &Layout) -> (),
+{
+    run_test_with_conn(|conn| {
+        // Reset state before starting
+        remove_test_data(conn);
+
+        // Seed database with test data
+        let layout = create_schema(conn);
+
+        // Run test
+        test(conn, &layout);
+    });
+}
+
+#[test]
+fn bad_id() {
+    run_test(|conn, layout| {
+        // We test that we get errors for various strings that are not
+        // valid 'Bytes' strings; we use `find` to force the conversion
+        // from String -> Bytes internally
+        let res = layout.find(conn, &*THING, "bad", BLOCK_NUMBER_MAX);
+        assert!(res.is_err());
+        assert_eq!(
+            "store error: Odd number of digits",
+            res.err().unwrap().to_string()
+        );
+
+        // We do not allow the `\x` prefix that Postgres uses
+        let res = layout.find(conn, &*THING, "\\xbadd", BLOCK_NUMBER_MAX);
+        assert!(res.is_err());
+        assert_eq!(
+            "store error: Invalid character \'\\\\\' at position 0",
+            res.err().unwrap().to_string()
+        );
+
+        // Having the '0x' prefix is ok
+        let res = layout.find(conn, &*THING, "0xbadd", BLOCK_NUMBER_MAX);
+        assert!(res.is_ok());
+
+        // Using non-hex characters is also bad
+        let res = layout.find(conn, &*THING, "nope", BLOCK_NUMBER_MAX);
+        assert!(res.is_err());
+        assert_eq!(
+            "store error: Invalid character \'n\' at position 0",
+            res.err().unwrap().to_string()
+        );
+    });
+}
+
+#[test]
+fn find() {
+    run_test(|conn, layout| {
+        const ID: &str = "deadbeef";
+        const NAME: &str = "Beef";
+        insert_thing(&conn, &layout, ID, NAME);
+
+        // Happy path: find existing entity
+        let entity = layout
+            .find(conn, &*THING, ID, BLOCK_NUMBER_MAX)
+            .expect("Failed to read Thing[deadbeef]")
+            .unwrap();
+        assert_entity_eq!(scrub(&*BEEF_ENTITY), entity);
+
+        // Find non-existing entity
+        let entity = layout
+            .find(conn, &*THING, "badd", BLOCK_NUMBER_MAX)
+            .expect("Failed to read Thing[badd]");
+        assert!(entity.is_none());
+    });
+}
+
+#[test]
+fn find_many() {
+    run_test(|conn, layout| {
+        const ID: &str = "0xdeadbeef";
+        const NAME: &str = "Beef";
+        const ID2: &str = "0xdeadbeef02";
+        const NAME2: &str = "Moo";
+        insert_thing(&conn, &layout, ID, NAME);
+        insert_thing(&conn, &layout, ID2, NAME2);
+
+        let mut id_map: BTreeMap<&EntityType, Vec<&str>> = BTreeMap::default();
+        id_map.insert(&*THING, vec![ID, ID2, "badd"]);
+
+        let entities = layout
+            .find_many(conn, &id_map, BLOCK_NUMBER_MAX)
+            .expect("Failed to read many things");
+        assert_eq!(1, entities.len());
+
+        let ids = entities
+            .get(&*THING)
+            .expect("We got some things")
+            .iter()
+            .map(|thing| thing.id().unwrap())
+            .collect::<Vec<_>>();
+
+        assert_eq!(2, ids.len());
+        assert!(ids.contains(&ID.to_owned()), "Missing ID");
+        assert!(ids.contains(&ID2.to_owned()), "Missing ID2");
+    });
+}
+
+#[test]
+fn update() {
+    run_test(|conn, layout| {
+        insert_entity(&conn, &layout, "Thing", BEEF_ENTITY.clone());
+
+        // Update the entity
+        let mut entity = BEEF_ENTITY.clone();
+        entity.set("name", "Moo");
+        let key = EntityKey::data("Thing".to_owned(), entity.id().unwrap().clone());
+
+        let entity_id = entity.id().unwrap().clone();
+        let entity_type = key.entity_type.clone();
+        let mut entities = vec![(&key, Cow::from(&entity))];
+        layout
+            .update(&conn, &entity_type, &mut entities, 1, &MOCK_STOPWATCH)
+            .expect("Failed to update");
+
+        let actual = layout
+            .find(conn, &*THING, &entity_id, BLOCK_NUMBER_MAX)
+            .expect("Failed to read Thing[deadbeef]")
+            .unwrap();
+
+        assert_entity_eq!(entity, actual);
+    });
+}
+
+#[test]
+fn delete() {
+    run_test(|conn, layout| {
+        const TWO_ID: &str = "deadbeef02";
+
+        insert_entity(&conn, &layout, "Thing", BEEF_ENTITY.clone());
+        let mut two = BEEF_ENTITY.clone();
+        two.set("id", TWO_ID);
+        insert_entity(&conn, &layout, "Thing", two);
+
+        // Delete where nothing is getting deleted
+        let key = EntityKey::data("Thing".to_owned(), "ffff".to_owned());
+        let entity_type = key.entity_type.clone();
+        let mut entity_keys = vec![key.entity_id.as_str()];
+        let count = layout
+            .delete(&conn, &entity_type, &entity_keys, 1, &MOCK_STOPWATCH)
+            .expect("Failed to delete");
+        assert_eq!(0, count);
+
+        // Delete entity two
+        entity_keys
+            .get_mut(0)
+            .map(|key| *key = TWO_ID)
+            .expect("Failed to update entity types");
+        let count = layout
+            .delete(&conn, &entity_type, &entity_keys, 1, &MOCK_STOPWATCH)
+            .expect("Failed to delete");
+        assert_eq!(1, count);
+    });
+}
+
+//
+// Test Layout::query to check that query generation is syntactically sound
+//
+const ROOT: &str = "0xdead00";
+const CHILD1: &str = "0xbabe01";
+const CHILD2: &str = "0xbabe02";
+const GRANDCHILD1: &str = "0xfafa01";
+const GRANDCHILD2: &str = "0xfafa02";
+
+/// Create a set of test data that forms a tree through the `parent` and `children` attributes.
+/// The tree has this form:
+///
+///   root
+///     +- child1
+///          +- grandchild1
+///     +- child2
+///          +- grandchild2
+///
+fn make_thing_tree(conn: &PgConnection, layout: &Layout) -> (Entity, Entity, Entity) {
+    let root = entity! {
+        id: ROOT,
+        name: "root",
+        children: vec!["babe01", "babe02"]
+    };
+    let child1 = entity! {
+        id: CHILD1,
+        name: "child1",
+        parent: "dead00",
+        children: vec![GRANDCHILD1]
+    };
+    let child2 = entity! {
+        id: CHILD2,
+        name: "child2",
+        parent: "dead00",
+        children: vec![GRANDCHILD1]
+    };
+    let grand_child1 = entity! {
+        id: GRANDCHILD1,
+        name: "grandchild1",
+        parent: CHILD1
+    };
+    let grand_child2 = entity! {
+        id: GRANDCHILD2,
+        name: "grandchild2",
+        parent: CHILD2
+    };
+
+    insert_entity(conn, layout, "Thing", root.clone());
+    insert_entity(conn, layout, "Thing", child1.clone());
+    insert_entity(conn, layout, "Thing", child2.clone());
+    insert_entity(conn, layout, "Thing", grand_child1.clone());
+    insert_entity(conn, layout, "Thing", grand_child2.clone());
+    (root, child1, child2)
+}
+
+#[test]
+fn query() {
+    fn fetch(conn: &PgConnection, layout: &Layout, coll: EntityCollection) -> Vec<String> {
+        layout
+            .query::<Entity>(
+                &*LOGGER,
+                conn,
+                coll,
+                None,
+                EntityOrder::Default,
+                EntityRange::first(10),
+                BLOCK_NUMBER_MAX,
+                None,
+            )
+            .map(|(entities, _)| entities)
+            .expect("the query succeeds")
+            .into_iter()
+            .map(|e| e.id().expect("entities have an id"))
+            .collect::<Vec<_>>()
+    }
+
+    run_test(|conn, layout| {
+        // This test exercises the different types of queries we generate;
+        // the type of query is based on knowledge of what the test data
+        // looks like, not on just an inference from the GraphQL model.
+        // Especially the multiplicity for type A and B queries is determined
+        // by knowing whether there are one or many entities per parent
+        // in the test data
+        make_thing_tree(conn, layout);
+
+        // See https://graphprotocol.github.io/rfcs/engineering-plans/0001-graphql-query-prefetching.html#handling-parentchild-relationships
+        // for a discussion of the various types of relationships and queries
+
+        // EntityCollection::All
+        let coll = EntityCollection::All(vec![(THING.clone(), AttributeNames::All)]);
+        let things = fetch(conn, layout, coll);
+        assert_eq!(vec![CHILD1, CHILD2, ROOT, GRANDCHILD1, GRANDCHILD2], things);
+
+        // EntityCollection::Window, type A, many
+        //   things(where: { children_contains: [CHILD1] }) { id }
+        let coll = EntityCollection::Window(vec![EntityWindow {
+            child_type: THING.clone(),
+            ids: vec![CHILD1.to_owned()],
+            link: EntityLink::Direct(
+                WindowAttribute::List("children".to_string()),
+                ChildMultiplicity::Many,
+            ),
+            column_names: AttributeNames::All,
+        }]);
+        let things = fetch(conn, layout, coll);
+        assert_eq!(vec![ROOT], things);
+
+        // EntityCollection::Window, type A, single
+        //   things(where: { children_contains: [GRANDCHILD1, GRANDCHILD2] }) { id }
+        let coll = EntityCollection::Window(vec![EntityWindow {
+            child_type: THING.clone(),
+            ids: vec![GRANDCHILD1.to_owned(), GRANDCHILD2.to_owned()],
+            link: EntityLink::Direct(
+                WindowAttribute::List("children".to_string()),
+                ChildMultiplicity::Single,
+            ),
+            column_names: AttributeNames::All,
+        }]);
+        let things = fetch(conn, layout, coll);
+        assert_eq!(vec![CHILD1, CHILD2], things);
+
+        // EntityCollection::Window, type B, many
+        //   things(where: { parent: [ROOT] }) { id }
+        let coll = EntityCollection::Window(vec![EntityWindow {
+            child_type: THING.clone(),
+            ids: vec![ROOT.to_owned()],
+            link: EntityLink::Direct(
+                WindowAttribute::Scalar("parent".to_string()),
+                ChildMultiplicity::Many,
+            ),
+            column_names: AttributeNames::All,
+        }]);
+        let things = fetch(conn, layout, coll);
+        assert_eq!(vec![CHILD1, CHILD2], things);
+
+        // EntityCollection::Window, type B, single
+        //   things(where: { parent: [CHILD1, CHILD2] }) { id }
+        let coll = EntityCollection::Window(vec![EntityWindow {
+            child_type: THING.clone(),
+            ids: vec![CHILD1.to_owned(), CHILD2.to_owned()],
+            link: EntityLink::Direct(
+                WindowAttribute::Scalar("parent".to_string()),
+                ChildMultiplicity::Single,
+            ),
+            column_names: AttributeNames::All,
+        }]);
+        let things = fetch(conn, layout, coll);
+        assert_eq!(vec![GRANDCHILD1, GRANDCHILD2], things);
+
+        // EntityCollection::Window, type C
+        //   things { children { id } }
+        // This is the inner 'children' query
+        let coll = EntityCollection::Window(vec![EntityWindow {
+            child_type: THING.clone(),
+            ids: vec![ROOT.to_owned()],
+            link: EntityLink::Parent(
+                THING.clone(),
+                ParentLink::List(vec![vec![CHILD1.to_owned(), CHILD2.to_owned()]]),
+            ),
+            column_names: AttributeNames::All,
+        }]);
+        let things = fetch(conn, layout, coll);
+        assert_eq!(vec![CHILD1, CHILD2], things);
+
+        // EntityCollection::Window, type D
+        //   things { parent { id } }
+        // This is the inner 'parent' query
+        let coll = EntityCollection::Window(vec![EntityWindow {
+            child_type: THING.clone(),
+            ids: vec![CHILD1.to_owned(), CHILD2.to_owned()],
+            link: EntityLink::Parent(
+                THING.clone(),
+                ParentLink::Scalar(vec![ROOT.to_owned(), ROOT.to_owned()]),
+            ),
+            column_names: AttributeNames::All,
+        }]);
+        let things = fetch(conn, layout, coll);
+        assert_eq!(vec![ROOT, ROOT], things);
+    });
+}
diff --git a/store/postgres/tests/store.rs b/store/postgres/tests/store.rs
new file mode 100644
index 0000000..156c826
--- /dev/null
+++ b/store/postgres/tests/store.rs
@@ -0,0 +1,2150 @@
+use graph::blockchain::block_stream::FirehoseCursor;
+use graph::data::graphql::ext::TypeDefinitionExt;
+use graph::data::query::QueryTarget;
+use graph::data::subgraph::schema::DeploymentCreate;
+use graph_chain_ethereum::{Mapping, MappingABI};
+use graph_mock::MockMetricsRegistry;
+use hex_literal::hex;
+use lazy_static::lazy_static;
+use std::time::Duration;
+use std::{collections::HashSet, sync::Mutex};
+use std::{marker::PhantomData, str::FromStr};
+use test_store::*;
+
+use graph::components::store::{DeploymentLocator, EntityKey, WritableStore};
+use graph::data::subgraph::*;
+use graph::prelude::*;
+use graph::{
+    blockchain::DataSource,
+    components::store::{
+        BlockStore as _, EntityFilter, EntityOrder, EntityQuery, EntityType, StatusStore,
+        SubscriptionManager as _,
+    },
+    prelude::ethabi::Contract,
+};
+use graph::{data::store::scalar, semver::Version};
+use graph_store_postgres::layout_for_tests::STRING_PREFIX_SIZE;
+use graph_store_postgres::{Store as DieselStore, SubgraphStore as DieselSubgraphStore};
+use web3::types::{Address, H256};
+
+const USER_GQL: &str = "
+    interface ColorAndAge {
+        id: ID!,
+        age: Int,
+        favorite_color: String
+    }
+
+    type User implements ColorAndAge @entity {
+        id: ID!,
+        name: String,
+        bin_name: Bytes,
+        email: String,
+        age: Int,
+        seconds_age: BigInt,
+        weight: BigDecimal,
+        coffee: Boolean,
+        favorite_color: String
+    }
+
+    type Person implements ColorAndAge @entity {
+        id: ID!,
+        name: String,
+        age: Int,
+        favorite_color: String
+    }
+
+    type Manual @entity {
+        id: ID!,
+        text: String
+    }
+";
+
+const USER: &str = "User";
+
+lazy_static! {
+    static ref TEST_SUBGRAPH_ID_STRING: String = String::from("testsubgraph");
+    static ref TEST_SUBGRAPH_ID: DeploymentHash =
+        DeploymentHash::new(TEST_SUBGRAPH_ID_STRING.as_str()).unwrap();
+    static ref TEST_SUBGRAPH_SCHEMA: Schema =
+        Schema::parse(USER_GQL, TEST_SUBGRAPH_ID.clone()).expect("Failed to parse user schema");
+    static ref TEST_BLOCK_0_PTR: BlockPtr = (
+        H256::from(hex!(
+            "bd34884280958002c51d3f7b5f853e6febeba33de0f40d15b0363006533c924f"
+        )),
+        0u64
+    )
+        .into();
+    static ref TEST_BLOCK_1_PTR: BlockPtr = (
+        H256::from(hex!(
+            "8511fa04b64657581e3f00e14543c1d522d5d7e771b54aa3060b662ade47da13"
+        )),
+        1u64
+    )
+        .into();
+    static ref TEST_BLOCK_2_PTR: BlockPtr = (
+        H256::from(hex!(
+            "b98fb783b49de5652097a989414c767824dff7e7fd765a63b493772511db81c1"
+        )),
+        2u64
+    )
+        .into();
+    static ref TEST_BLOCK_3_PTR: BlockPtr = (
+        H256::from(hex!(
+            "977c084229c72a0fa377cae304eda9099b6a2cb5d83b25cdf0f0969b69874255"
+        )),
+        3u64
+    )
+        .into();
+    static ref TEST_BLOCK_3A_PTR: BlockPtr = (
+        H256::from(hex!(
+            "d163aec0592c7cb00c2700ab65dcaac93289f5d250b3b889b39198b07e1fbe4a"
+        )),
+        3u64
+    )
+        .into();
+    static ref TEST_BLOCK_4_PTR: BlockPtr = (
+        H256::from(hex!(
+            "007a03cdf635ebb66f5e79ae66cc90ca23d98031665649db056ff9c6aac2d74d"
+        )),
+        4u64
+    )
+        .into();
+    static ref TEST_BLOCK_4A_PTR: BlockPtr = (
+        H256::from(hex!(
+            "8fab27e9e9285b0a39110f4d9877f05d0f43d2effa157e55f4dcc49c3cf8cbd7"
+        )),
+        4u64
+    )
+        .into();
+    static ref TEST_BLOCK_5_PTR: BlockPtr = (
+        H256::from(hex!(
+            "e8b3b02b936c4a4a331ac691ac9a86e197fb7731f14e3108602c87d4dac55160"
+        )),
+        5u64
+    )
+        .into();
+}
+
+/// Test harness for running database integration tests.
+fn run_test<R, F>(test: F)
+where
+    F: FnOnce(Arc<DieselStore>, Arc<dyn WritableStore>, DeploymentLocator) -> R + Send + 'static,
+    R: std::future::Future<Output = ()> + Send + 'static,
+{
+    run_test_sequentially(|store| async move {
+        let subgraph_store = store.subgraph_store();
+        // Reset state before starting
+        remove_test_data(subgraph_store.clone());
+
+        // Seed database with test data
+        let deployment = insert_test_data(subgraph_store.clone()).await;
+        let writable = store
+            .subgraph_store()
+            .writable(LOGGER.clone(), deployment.id)
+            .await
+            .expect("we can get a writable store");
+
+        // Run test and wait for the background writer to finish its work so
+        // it won't conflict with the next test
+        test(store, writable.clone(), deployment).await;
+        writable.flush().await.unwrap();
+    });
+}
+
+/// Inserts test data into the store.
+///
+/// Inserts data in test blocks `GENESIS_PTR`, `TEST_BLOCK_1_PTR`, and
+/// `TEST_BLOCK_2_PTR`
+async fn insert_test_data(store: Arc<DieselSubgraphStore>) -> DeploymentLocator {
+    let manifest = SubgraphManifest::<graph_chain_ethereum::Chain> {
+        id: TEST_SUBGRAPH_ID.clone(),
+        spec_version: Version::new(1, 0, 0),
+        features: Default::default(),
+        description: None,
+        repository: None,
+        schema: TEST_SUBGRAPH_SCHEMA.clone(),
+        data_sources: vec![],
+        graft: None,
+        templates: vec![],
+        chain: PhantomData,
+    };
+
+    // Create SubgraphDeploymentEntity
+    let deployment = DeploymentCreate::new(&manifest, None);
+    let name = SubgraphName::new("test/store").unwrap();
+    let node_id = NodeId::new("test").unwrap();
+    let deployment = store
+        .create_subgraph_deployment(
+            name,
+            &TEST_SUBGRAPH_SCHEMA,
+            deployment,
+            node_id,
+            NETWORK_NAME.to_string(),
+            SubgraphVersionSwitchingMode::Instant,
+        )
+        .unwrap();
+
+    let test_entity_1 = create_test_entity(
+        "1",
+        USER,
+        "Johnton",
+        "tonofjohn@email.com",
+        67 as i32,
+        184.4,
+        false,
+        None,
+    );
+    transact_entity_operations(
+        &store,
+        &deployment,
+        GENESIS_PTR.clone(),
+        vec![test_entity_1],
+    )
+    .await
+    .unwrap();
+
+    let test_entity_2 = create_test_entity(
+        "2",
+        USER,
+        "Cindini",
+        "dinici@email.com",
+        43 as i32,
+        159.1,
+        true,
+        Some("red"),
+    );
+    let test_entity_3_1 = create_test_entity(
+        "3",
+        USER,
+        "Shaqueeena",
+        "queensha@email.com",
+        28 as i32,
+        111.7,
+        false,
+        Some("blue"),
+    );
+    transact_entity_operations(
+        &store,
+        &deployment,
+        TEST_BLOCK_1_PTR.clone(),
+        vec![test_entity_2, test_entity_3_1],
+    )
+    .await
+    .unwrap();
+
+    let test_entity_3_2 = create_test_entity(
+        "3",
+        USER,
+        "Shaqueeena",
+        "teeko@email.com",
+        28 as i32,
+        111.7,
+        false,
+        None,
+    );
+    transact_and_wait(
+        &store,
+        &deployment,
+        TEST_BLOCK_2_PTR.clone(),
+        vec![test_entity_3_2],
+    )
+    .await
+    .unwrap();
+
+    deployment
+}
+
+/// Creates a test entity.
+fn create_test_entity(
+    id: &str,
+    entity_type: &str,
+    name: &str,
+    email: &str,
+    age: i32,
+    weight: f64,
+    coffee: bool,
+    favorite_color: Option<&str>,
+) -> EntityOperation {
+    let mut test_entity = Entity::new();
+
+    test_entity.insert("id".to_owned(), Value::String(id.to_owned()));
+    test_entity.insert("name".to_owned(), Value::String(name.to_owned()));
+    let bin_name = scalar::Bytes::from_str(&hex::encode(name)).unwrap();
+    test_entity.insert("bin_name".to_owned(), Value::Bytes(bin_name));
+    test_entity.insert("email".to_owned(), Value::String(email.to_owned()));
+    test_entity.insert("age".to_owned(), Value::Int(age));
+    test_entity.insert(
+        "seconds_age".to_owned(),
+        Value::BigInt(BigInt::from(age) * 31557600.into()),
+    );
+    test_entity.insert("weight".to_owned(), Value::BigDecimal(weight.into()));
+    test_entity.insert("coffee".to_owned(), Value::Bool(coffee));
+    test_entity.insert(
+        "favorite_color".to_owned(),
+        favorite_color
+            .map(|s| Value::String(s.to_owned()))
+            .unwrap_or(Value::Null),
+    );
+
+    EntityOperation::Set {
+        key: EntityKey::data(entity_type.to_owned(), id.to_owned()),
+        data: test_entity,
+    }
+}
+
+/// Removes test data from the database behind the store.
+fn remove_test_data(store: Arc<DieselSubgraphStore>) {
+    store
+        .delete_all_entities_for_test_use_only()
+        .expect("deleting test entities succeeds");
+}
+
+fn get_entity_count(store: Arc<DieselStore>, subgraph_id: &DeploymentHash) -> u64 {
+    let info = store
+        .status(status::Filter::Deployments(vec![subgraph_id.to_string()]))
+        .unwrap();
+    let info = info.first().unwrap();
+    info.entity_count
+}
+
+#[test]
+fn delete_entity() {
+    run_test(|store, writable, deployment| async move {
+        let entity_key = EntityKey::data(USER.to_owned(), "3".to_owned());
+
+        // Check that there is an entity to remove.
+        writable.get(&entity_key).unwrap().unwrap();
+
+        let count = get_entity_count(store.clone(), &&deployment.hash);
+        transact_and_wait(
+            &store.subgraph_store(),
+            &deployment,
+            TEST_BLOCK_3_PTR.clone(),
+            vec![EntityOperation::Remove {
+                key: entity_key.clone(),
+            }],
+        )
+        .await
+        .unwrap();
+        assert_eq!(
+            count,
+            get_entity_count(store.clone(), &&deployment.hash) + 1
+        );
+
+        // Check that that the deleted entity id is not present
+        assert!(writable.get(&entity_key).unwrap().is_none());
+    })
+}
+
+/// Check that user 1 was inserted correctly
+#[test]
+fn get_entity_1() {
+    run_test(|_, writable, _| async move {
+        let key = EntityKey::data(USER.to_owned(), "1".to_owned());
+        let result = writable.get(&key).unwrap();
+
+        let mut expected_entity = Entity::new();
+
+        expected_entity.insert("id".to_owned(), "1".into());
+        expected_entity.insert("name".to_owned(), "Johnton".into());
+        expected_entity.insert(
+            "bin_name".to_owned(),
+            Value::Bytes("Johnton".as_bytes().into()),
+        );
+        expected_entity.insert("email".to_owned(), "tonofjohn@email.com".into());
+        expected_entity.insert("age".to_owned(), Value::Int(67 as i32));
+        expected_entity.insert(
+            "seconds_age".to_owned(),
+            Value::BigInt(BigInt::from(2114359200)),
+        );
+        expected_entity.insert("weight".to_owned(), Value::BigDecimal(184.4.into()));
+        expected_entity.insert("coffee".to_owned(), Value::Bool(false));
+        // "favorite_color" was set to `Null` earlier and should be absent
+
+        // Check that the expected entity was returned
+        assert_eq!(result, Some(expected_entity));
+    })
+}
+
+/// Check that user 3 was updated correctly
+#[test]
+fn get_entity_3() {
+    run_test(|_, writable, _| async move {
+        let key = EntityKey::data(USER.to_owned(), "3".to_owned());
+        let result = writable.get(&key).unwrap();
+
+        let mut expected_entity = Entity::new();
+
+        expected_entity.insert("id".to_owned(), "3".into());
+        expected_entity.insert("name".to_owned(), "Shaqueeena".into());
+        expected_entity.insert(
+            "bin_name".to_owned(),
+            Value::Bytes("Shaqueeena".as_bytes().into()),
+        );
+        expected_entity.insert("email".to_owned(), "teeko@email.com".into());
+        expected_entity.insert("age".to_owned(), Value::Int(28 as i32));
+        expected_entity.insert(
+            "seconds_age".to_owned(),
+            Value::BigInt(BigInt::from(883612800)),
+        );
+        expected_entity.insert("weight".to_owned(), Value::BigDecimal(111.7.into()));
+        expected_entity.insert("coffee".to_owned(), Value::Bool(false));
+        // "favorite_color" was set to `Null` earlier and should be absent
+
+        // Check that the expected entity was returned
+        assert_eq!(result, Some(expected_entity));
+    })
+}
+
+#[test]
+fn insert_entity() {
+    run_test(|store, writable, deployment| async move {
+        let entity_key = EntityKey::data(USER.to_owned(), "7".to_owned());
+        let test_entity = create_test_entity(
+            "7",
+            USER,
+            "Wanjon",
+            "wanawana@email.com",
+            76 as i32,
+            111.7,
+            true,
+            Some("green"),
+        );
+        let count = get_entity_count(store.clone(), &&deployment.hash);
+        transact_and_wait(
+            &store.subgraph_store(),
+            &deployment,
+            TEST_BLOCK_3_PTR.clone(),
+            vec![test_entity],
+        )
+        .await
+        .unwrap();
+        assert_eq!(count + 1, get_entity_count(store.clone(), &deployment.hash));
+
+        // Check that new record is in the store
+        writable.get(&entity_key).unwrap().unwrap();
+    })
+}
+
+#[test]
+fn update_existing() {
+    run_test(|store, writable, deployment| async move {
+        let entity_key = EntityKey::data(USER.to_owned(), "1".to_owned());
+
+        let op = create_test_entity(
+            "1",
+            USER,
+            "Wanjon",
+            "wanawana@email.com",
+            76 as i32,
+            111.7,
+            true,
+            Some("green"),
+        );
+        let mut new_data = match op {
+            EntityOperation::Set { ref data, .. } => data.clone(),
+            _ => unreachable!(),
+        };
+
+        // Verify that the entity before updating is different from what we expect afterwards
+        assert_ne!(writable.get(&entity_key).unwrap().unwrap(), new_data);
+
+        // Set test entity; as the entity already exists an update should be performed
+        let count = get_entity_count(store.clone(), &deployment.hash);
+        transact_entity_operations(
+            &store.subgraph_store(),
+            &deployment,
+            TEST_BLOCK_3_PTR.clone(),
+            vec![op],
+        )
+        .await
+        .unwrap();
+        assert_eq!(count, get_entity_count(store.clone(), &deployment.hash));
+
+        // Verify that the entity in the store has changed to what we have set.
+        let bin_name = match new_data.get("bin_name") {
+            Some(Value::Bytes(bytes)) => bytes.clone(),
+            _ => unreachable!(),
+        };
+
+        new_data.insert("bin_name".to_owned(), Value::Bytes(bin_name));
+        assert_eq!(writable.get(&entity_key).unwrap(), Some(new_data));
+    })
+}
+
+#[test]
+fn partially_update_existing() {
+    run_test(|store, writable, deployment| async move {
+        let entity_key = EntityKey::data(USER.to_owned(), "1".to_owned());
+
+        let partial_entity = Entity::from(vec![
+            ("id", Value::from("1")),
+            ("name", Value::from("Johnny Boy")),
+            ("email", Value::Null),
+        ]);
+
+        let original_entity = writable
+            .get(&entity_key)
+            .unwrap()
+            .expect("entity not found");
+
+        // Set test entity; as the entity already exists an update should be performed
+        transact_entity_operations(
+            &store.subgraph_store(),
+            &deployment,
+            TEST_BLOCK_3_PTR.clone(),
+            vec![EntityOperation::Set {
+                key: entity_key.clone(),
+                data: partial_entity.clone(),
+            }],
+        )
+        .await
+        .unwrap();
+
+        // Obtain the updated entity from the store
+        let updated_entity = writable
+            .get(&entity_key)
+            .unwrap()
+            .expect("entity not found");
+
+        // Verify that the values of all attributes we have set were either unset
+        // (in the case of Value::Null) or updated to the new values
+        assert_eq!(updated_entity.get("id"), partial_entity.get("id"));
+        assert_eq!(updated_entity.get(USER), partial_entity.get(USER));
+        assert_eq!(updated_entity.get("email"), None);
+
+        // Verify that all attributes we have not set have remained at their old values
+        assert_eq!(updated_entity.get("age"), original_entity.get("age"));
+        assert_eq!(updated_entity.get("weight"), original_entity.get("weight"));
+        assert_eq!(updated_entity.get("coffee"), original_entity.get("coffee"));
+    })
+}
+
+struct QueryChecker {
+    store: Arc<DieselStore>,
+}
+
+impl QueryChecker {
+    fn new(store: Arc<DieselStore>) -> Self {
+        Self { store }
+    }
+
+    fn check(self, expected_entity_ids: Vec<&str>, query: EntityQuery) -> Self {
+        let expected_entity_ids: Vec<String> =
+            expected_entity_ids.into_iter().map(str::to_owned).collect();
+
+        let entities = self
+            .store
+            .subgraph_store()
+            .find(query)
+            .expect("store.find failed to execute query");
+
+        let entity_ids: Vec<_> = entities
+            .into_iter()
+            .map(|entity| match entity.get("id") {
+                Some(Value::String(id)) => id.to_owned(),
+                Some(_) => panic!("store.find returned entity with non-string ID attribute"),
+                None => panic!("store.find returned entity with no ID attribute"),
+            })
+            .collect();
+
+        assert_eq!(entity_ids, expected_entity_ids);
+        self
+    }
+}
+
+fn user_query() -> EntityQuery {
+    EntityQuery::new(
+        TEST_SUBGRAPH_ID.clone(),
+        BLOCK_NUMBER_MAX,
+        EntityCollection::All(vec![(EntityType::from(USER), AttributeNames::All)]),
+    )
+}
+
+trait EasyOrder {
+    fn asc(self, attr: &str) -> Self;
+    fn desc(self, attr: &str) -> Self;
+}
+
+impl EasyOrder for EntityQuery {
+    fn asc(self, attr: &str) -> Self {
+        // The ValueType doesn't matter since relational layouts ignore it
+        self.order(EntityOrder::Ascending(attr.to_owned(), ValueType::String))
+    }
+
+    fn desc(self, attr: &str) -> Self {
+        // The ValueType doesn't matter since relational layouts ignore it
+        self.order(EntityOrder::Descending(attr.to_owned(), ValueType::String))
+    }
+}
+
+#[test]
+fn find() {
+    run_test(|store, _, _| async move {
+        // Filter tests with string attributes
+        QueryChecker::new(store.clone())
+            .check(
+                vec!["2"],
+                user_query().filter(EntityFilter::Contains("name".into(), "ind".into())),
+            )
+            .check(
+                vec!["2"],
+                user_query().filter(EntityFilter::Equal("name".to_owned(), "Cindini".into())),
+            )
+            .check(
+                vec!["1", "3"],
+                user_query()
+                    .filter(EntityFilter::Not("name".to_owned(), "Cindini".into()))
+                    .asc("name"),
+            )
+            .check(
+                vec!["3"],
+                user_query().filter(EntityFilter::GreaterThan("name".to_owned(), "Kundi".into())),
+            )
+            .check(
+                vec!["2", "1"],
+                user_query()
+                    .filter(EntityFilter::LessThan("name".to_owned(), "Kundi".into()))
+                    .asc("name"),
+            )
+            .check(
+                vec!["1", "2"],
+                user_query()
+                    .filter(EntityFilter::LessThan("name".to_owned(), "Kundi".into()))
+                    .desc("name"),
+            )
+            .check(
+                vec!["1"],
+                user_query()
+                    .filter(EntityFilter::LessThan("name".to_owned(), "ZZZ".into()))
+                    .desc("name")
+                    .first(1)
+                    .skip(1),
+            )
+            .check(
+                vec!["2"],
+                user_query()
+                    .filter(EntityFilter::And(vec![
+                        EntityFilter::LessThan("name".to_owned(), "Cz".into()),
+                        EntityFilter::Equal("name".to_owned(), "Cindini".into()),
+                    ]))
+                    .desc("name"),
+            )
+            .check(
+                vec!["2"],
+                user_query()
+                    .filter(EntityFilter::EndsWith("name".to_owned(), "ini".into()))
+                    .desc("name"),
+            )
+            .check(
+                vec!["3", "1"],
+                user_query()
+                    .filter(EntityFilter::NotEndsWith("name".to_owned(), "ini".into()))
+                    .desc("name"),
+            )
+            .check(
+                vec!["1"],
+                user_query()
+                    .filter(EntityFilter::In("name".to_owned(), vec!["Johnton".into()]))
+                    .desc("name"),
+            )
+            .check(
+                vec!["1", "2"],
+                user_query()
+                    .filter(EntityFilter::NotIn(
+                        "name".to_owned(),
+                        vec!["Shaqueeena".into()],
+                    ))
+                    .desc("name"),
+            );
+
+        // Filter tests with float attributes
+        QueryChecker::new(store.clone())
+            .check(
+                vec!["1"],
+                user_query().filter(EntityFilter::Equal(
+                    "weight".to_owned(),
+                    Value::BigDecimal(184.4.into()),
+                )),
+            )
+            .check(
+                vec!["3", "2"],
+                user_query()
+                    .filter(EntityFilter::Not(
+                        "weight".to_owned(),
+                        Value::BigDecimal(184.4.into()),
+                    ))
+                    .desc("name"),
+            )
+            .check(
+                vec!["1"],
+                user_query().filter(EntityFilter::GreaterThan(
+                    "weight".to_owned(),
+                    Value::BigDecimal(160.0.into()),
+                )),
+            )
+            .check(
+                vec!["2", "3"],
+                user_query()
+                    .filter(EntityFilter::LessThan(
+                        "weight".to_owned(),
+                        Value::BigDecimal(160.0.into()),
+                    ))
+                    .asc("name"),
+            )
+            .check(
+                vec!["3", "2"],
+                user_query()
+                    .filter(EntityFilter::LessThan(
+                        "weight".to_owned(),
+                        Value::BigDecimal(160.0.into()),
+                    ))
+                    .desc("name"),
+            )
+            .check(
+                vec!["2"],
+                user_query()
+                    .filter(EntityFilter::LessThan(
+                        "weight".to_owned(),
+                        Value::BigDecimal(161.0.into()),
+                    ))
+                    .desc("name")
+                    .first(1)
+                    .skip(1),
+            )
+            .check(
+                vec!["3", "1"],
+                user_query()
+                    .filter(EntityFilter::In(
+                        "weight".to_owned(),
+                        vec![
+                            Value::BigDecimal(184.4.into()),
+                            Value::BigDecimal(111.7.into()),
+                        ],
+                    ))
+                    .desc("name")
+                    .first(5),
+            )
+            .check(
+                vec!["2"],
+                user_query()
+                    .filter(EntityFilter::NotIn(
+                        "weight".to_owned(),
+                        vec![
+                            Value::BigDecimal(184.4.into()),
+                            Value::BigDecimal(111.7.into()),
+                        ],
+                    ))
+                    .desc("name")
+                    .first(5),
+            );
+        // Filter tests with int attributes
+        QueryChecker::new(store.clone())
+            .check(
+                vec!["1"],
+                user_query()
+                    .filter(EntityFilter::Equal("age".to_owned(), Value::Int(67 as i32)))
+                    .desc("name"),
+            )
+            .check(
+                vec!["3", "2"],
+                user_query()
+                    .filter(EntityFilter::Not("age".to_owned(), Value::Int(67 as i32)))
+                    .desc("name"),
+            )
+            .check(
+                vec!["1"],
+                user_query().filter(EntityFilter::GreaterThan(
+                    "age".to_owned(),
+                    Value::Int(43 as i32),
+                )),
+            )
+            .check(
+                vec!["2", "1"],
+                user_query()
+                    .filter(EntityFilter::GreaterOrEqual(
+                        "age".to_owned(),
+                        Value::Int(43 as i32),
+                    ))
+                    .asc("name"),
+            )
+            .check(
+                vec!["2", "3"],
+                user_query()
+                    .filter(EntityFilter::LessThan(
+                        "age".to_owned(),
+                        Value::Int(50 as i32),
+                    ))
+                    .asc("name"),
+            )
+            .check(
+                vec!["2", "3"],
+                user_query()
+                    .filter(EntityFilter::LessOrEqual(
+                        "age".to_owned(),
+                        Value::Int(43 as i32),
+                    ))
+                    .asc("name"),
+            )
+            .check(
+                vec!["3", "2"],
+                user_query()
+                    .filter(EntityFilter::LessThan(
+                        "age".to_owned(),
+                        Value::Int(50 as i32),
+                    ))
+                    .desc("name"),
+            )
+            .check(
+                vec!["2"],
+                user_query()
+                    .filter(EntityFilter::LessThan(
+                        "age".to_owned(),
+                        Value::Int(67 as i32),
+                    ))
+                    .desc("name")
+                    .first(1)
+                    .skip(1),
+            )
+            .check(
+                vec!["1", "2"],
+                user_query()
+                    .filter(EntityFilter::In(
+                        "age".to_owned(),
+                        vec![Value::Int(67 as i32), Value::Int(43 as i32)],
+                    ))
+                    .desc("name")
+                    .first(5),
+            )
+            .check(
+                vec!["3"],
+                user_query()
+                    .filter(EntityFilter::NotIn(
+                        "age".to_owned(),
+                        vec![Value::Int(67 as i32), Value::Int(43 as i32)],
+                    ))
+                    .desc("name")
+                    .first(5),
+            );
+        // Filter tests with bool attributes
+        QueryChecker::new(store.clone())
+            .check(
+                vec!["2"],
+                user_query()
+                    .filter(EntityFilter::Equal("coffee".to_owned(), Value::Bool(true)))
+                    .desc("name"),
+            )
+            .check(
+                vec!["1", "3"],
+                user_query()
+                    .filter(EntityFilter::Not("coffee".to_owned(), Value::Bool(true)))
+                    .asc("name"),
+            )
+            .check(
+                vec!["2"],
+                user_query()
+                    .filter(EntityFilter::In(
+                        "coffee".to_owned(),
+                        vec![Value::Bool(true)],
+                    ))
+                    .desc("name")
+                    .first(5),
+            )
+            .check(
+                vec!["3", "1"],
+                user_query()
+                    .filter(EntityFilter::NotIn(
+                        "coffee".to_owned(),
+                        vec![Value::Bool(true)],
+                    ))
+                    .desc("name")
+                    .first(5),
+            );
+        // Misc filter tests
+        QueryChecker::new(store)
+            .check(
+                vec!["1"],
+                user_query()
+                    .filter(EntityFilter::Equal(
+                        "bin_name".to_owned(),
+                        Value::Bytes("Johnton".as_bytes().into()),
+                    ))
+                    .desc("name"),
+            )
+            .check(
+                vec!["3", "1"],
+                user_query()
+                    .filter(EntityFilter::Equal(
+                        "favorite_color".to_owned(),
+                        Value::Null,
+                    ))
+                    .desc("name"),
+            )
+            .check(
+                vec!["3", "1"],
+                user_query()
+                    .filter(EntityFilter::Equal(
+                        "favorite_color".to_owned(),
+                        Value::Null,
+                    ))
+                    .desc("name"),
+            )
+            .check(
+                vec!["2"],
+                user_query()
+                    .filter(EntityFilter::Not("favorite_color".to_owned(), Value::Null))
+                    .desc("name"),
+            )
+            .check(
+                vec!["2"],
+                user_query()
+                    .filter(EntityFilter::NotIn(
+                        "favorite_color".to_owned(),
+                        vec![Value::Null],
+                    ))
+                    .desc("name"),
+            )
+            .check(vec!["3", "2", "1"], user_query().asc("weight"))
+            .check(vec!["1", "2", "3"], user_query().desc("weight"))
+            .check(vec!["1", "2", "3"], user_query().asc("id"))
+            .check(vec!["3", "2", "1"], user_query().desc("id"))
+            .check(vec!["3", "2", "1"], user_query().asc("age"))
+            .check(vec!["1", "2", "3"], user_query().desc("age"))
+            .check(vec!["2", "1", "3"], user_query().asc("name"))
+            .check(vec!["3", "1", "2"], user_query().desc("name"))
+            .check(
+                vec!["1", "2"],
+                user_query()
+                    .filter(EntityFilter::And(vec![EntityFilter::Or(vec![
+                        EntityFilter::Equal("id".to_owned(), Value::from("1")),
+                        EntityFilter::Equal("id".to_owned(), Value::from("2")),
+                    ])]))
+                    .asc("id"),
+            );
+    });
+}
+
+fn make_entity_change(entity_type: &str) -> EntityChange {
+    EntityChange::Data {
+        subgraph_id: TEST_SUBGRAPH_ID.clone(),
+        entity_type: EntityType::new(entity_type.to_owned()),
+    }
+}
+
+// Get as events until we've seen all the expected events or we time out waiting
+async fn check_events(
+    stream: StoreEventStream<impl Stream<Item = Arc<StoreEvent>, Error = ()> + Send>,
+    expected: Vec<StoreEvent>,
+) {
+    fn as_set(events: Vec<Arc<StoreEvent>>) -> HashSet<EntityChange> {
+        events.into_iter().fold(HashSet::new(), |mut set, event| {
+            set.extend(event.changes.iter().map(|change| change.clone()));
+            set
+        })
+    }
+
+    let expected = Mutex::new(as_set(
+        expected.into_iter().map(|event| Arc::new(event)).collect(),
+    ));
+    // Capture extra changes here; this is only needed for debugging, really.
+    // It's permissible that we get more changes than we expected because of
+    // how store events group changes together
+    let extra: Mutex<HashSet<EntityChange>> = Mutex::new(HashSet::new());
+    // Get events from the store until we've either seen all the changes we
+    // expected or we timed out waiting for them
+    stream
+        .take_while(|event| {
+            let mut expected = expected.lock().unwrap();
+            for change in &event.changes {
+                if !expected.remove(&change) {
+                    extra.lock().unwrap().insert(change.clone());
+                }
+            }
+            future::ok(!expected.is_empty())
+        })
+        .collect()
+        .compat()
+        .timeout(Duration::from_secs(3))
+        .await
+        .expect(&format!(
+            "timed out waiting for events\n  still waiting for {:?}\n  got extra events {:?}",
+            expected.lock().unwrap().clone(),
+            extra.lock().unwrap().clone()
+        ))
+        .expect("something went wrong getting events");
+    // Check again that we really got everything
+    assert_eq!(HashSet::new(), expected.lock().unwrap().clone());
+}
+
+// Subscribe to store events
+fn subscribe(
+    subgraph: &DeploymentHash,
+    entity_type: &str,
+) -> StoreEventStream<impl Stream<Item = Arc<StoreEvent>, Error = ()> + Send> {
+    let subscription =
+        SUBSCRIPTION_MANAGER.subscribe(FromIterator::from_iter([SubscriptionFilter::Entities(
+            subgraph.clone(),
+            EntityType::new(entity_type.to_owned()),
+        )]));
+
+    StoreEventStream::new(subscription)
+}
+
+async fn check_basic_revert(
+    store: Arc<DieselStore>,
+    expected: StoreEvent,
+    deployment: &DeploymentLocator,
+    entity_type: &str,
+) {
+    let this_query = user_query()
+        .filter(EntityFilter::Equal(
+            "name".to_owned(),
+            Value::String("Shaqueeena".to_owned()),
+        ))
+        .desc("name");
+
+    let subscription = subscribe(&deployment.hash, entity_type);
+    let state = deployment_state(store.as_ref(), &deployment.hash).await;
+    assert_eq!(&deployment.hash, &state.id);
+
+    // Revert block 3
+    revert_block(&store, &deployment, &*TEST_BLOCK_1_PTR).await;
+
+    let returned_entities = store
+        .subgraph_store()
+        .find(this_query.clone())
+        .expect("store.find operation failed");
+
+    // There should be 1 user returned in results
+    assert_eq!(1, returned_entities.len());
+
+    // Check if the first user in the result vector has email "queensha@email.com"
+    let returned_name = returned_entities[0].get(&"email".to_owned());
+    let test_value = Value::String("queensha@email.com".to_owned());
+    assert!(returned_name.is_some());
+    assert_eq!(&test_value, returned_name.unwrap());
+
+    let state = deployment_state(store.as_ref(), &deployment.hash).await;
+    assert_eq!(&deployment.hash, &state.id);
+
+    check_events(subscription, vec![expected]).await
+}
+
+#[test]
+fn revert_block_basic_user() {
+    run_test(|store, _, deployment| async move {
+        let expected = StoreEvent::new(vec![make_entity_change(USER)]);
+
+        let count = get_entity_count(store.clone(), &deployment.hash);
+        check_basic_revert(store.clone(), expected, &deployment, USER).await;
+        assert_eq!(count, get_entity_count(store.clone(), &deployment.hash));
+    })
+}
+
+#[test]
+fn revert_block_with_delete() {
+    run_test(|store, _, deployment| async move {
+        let this_query = user_query()
+            .filter(EntityFilter::Equal(
+                "name".to_owned(),
+                Value::String("Cindini".to_owned()),
+            ))
+            .desc("name");
+
+        // Delete entity with id=2
+        let del_key = EntityKey::data(USER.to_owned(), "2".to_owned());
+
+        // Process deletion
+        transact_and_wait(
+            &store.subgraph_store(),
+            &deployment,
+            TEST_BLOCK_3_PTR.clone(),
+            vec![EntityOperation::Remove { key: del_key }],
+        )
+        .await
+        .unwrap();
+
+        let subscription = subscribe(&deployment.hash, USER);
+
+        // Revert deletion
+        let count = get_entity_count(store.clone(), &deployment.hash);
+        revert_block(&store, &deployment, &*TEST_BLOCK_2_PTR).await;
+        assert_eq!(count + 1, get_entity_count(store.clone(), &deployment.hash));
+
+        // Query after revert
+        let returned_entities = store
+            .subgraph_store()
+            .find(this_query.clone())
+            .expect("store.find operation failed");
+
+        // There should be 1 entity returned in results
+        assert_eq!(1, returned_entities.len());
+
+        // Check if "dinici@email.com" is in result set
+        let returned_name = returned_entities[0].get(&"email".to_owned());
+        let test_value = Value::String("dinici@email.com".to_owned());
+        assert!(returned_name.is_some());
+        assert_eq!(&test_value, returned_name.unwrap());
+
+        // Check that the subscription notified us of the changes
+        let expected = StoreEvent::new(vec![make_entity_change(USER)]);
+
+        // The last event is the one for the reversion
+        check_events(subscription, vec![expected]).await
+    })
+}
+
+#[test]
+fn revert_block_with_partial_update() {
+    run_test(|store, writable, deployment| async move {
+        let entity_key = EntityKey::data(USER.to_owned(), "1".to_owned());
+
+        let partial_entity = Entity::from(vec![
+            ("id", Value::from("1")),
+            ("name", Value::from("Johnny Boy")),
+            ("email", Value::Null),
+        ]);
+
+        let original_entity = writable.get(&entity_key).unwrap().expect("missing entity");
+
+        // Set test entity; as the entity already exists an update should be performed
+        transact_entity_operations(
+            &store.subgraph_store(),
+            &deployment,
+            TEST_BLOCK_3_PTR.clone(),
+            vec![EntityOperation::Set {
+                key: entity_key.clone(),
+                data: partial_entity.clone(),
+            }],
+        )
+        .await
+        .unwrap();
+
+        let subscription = subscribe(&deployment.hash, USER);
+
+        // Perform revert operation, reversing the partial update
+        let count = get_entity_count(store.clone(), &deployment.hash);
+        revert_block(&store, &deployment, &*TEST_BLOCK_2_PTR).await;
+        assert_eq!(count, get_entity_count(store.clone(), &deployment.hash));
+
+        // Obtain the reverted entity from the store
+        let reverted_entity = writable.get(&entity_key).unwrap().expect("missing entity");
+
+        // Verify that the entity has been returned to its original state
+        assert_eq!(reverted_entity, original_entity);
+
+        // Check that the subscription notified us of the changes
+        let expected = StoreEvent::new(vec![make_entity_change(USER)]);
+
+        check_events(subscription, vec![expected]).await
+    })
+}
+
+fn mock_data_source() -> graph_chain_ethereum::DataSource {
+    graph_chain_ethereum::DataSource {
+        kind: String::from("ethereum/contract"),
+        name: String::from("example data source"),
+        manifest_idx: 0,
+        network: Some(String::from("mainnet")),
+        address: Some(Address::from_str("0123123123012312312301231231230123123123").unwrap()),
+        start_block: 0,
+        mapping: Mapping {
+            kind: String::from("ethereum/events"),
+            api_version: Version::parse("0.1.0").unwrap(),
+            language: String::from("wasm/assemblyscript"),
+            entities: vec![],
+            abis: vec![],
+            event_handlers: vec![],
+            call_handlers: vec![],
+            block_handlers: vec![],
+            link: Link {
+                link: "link".to_owned(),
+            },
+            runtime: Arc::new(Vec::new()),
+        },
+        context: Default::default(),
+        creation_block: None,
+        contract_abi: Arc::new(mock_abi()),
+    }
+}
+
+fn mock_abi() -> MappingABI {
+    MappingABI {
+        name: "mock_abi".to_string(),
+        contract: Contract::load(
+            r#"[
+            {
+                "inputs": [
+                    {
+                        "name": "a",
+                        "type": "address"
+                    }
+                ],
+                "type": "constructor"
+            }
+        ]"#
+            .as_bytes(),
+        )
+        .unwrap(),
+    }
+}
+
+#[test]
+fn revert_block_with_dynamic_data_source_operations() {
+    run_test(|store, writable, deployment| async move {
+        let subgraph_store = store.subgraph_store();
+
+        // Create operations to add a user
+        let user_key = EntityKey::data(USER.to_owned(), "1".to_owned());
+        let partial_entity = Entity::from(vec![
+            ("id", Value::from("1")),
+            ("name", Value::from("Johnny Boy")),
+            ("email", Value::Null),
+        ]);
+
+        // Get the original user for comparisons
+        let original_user = writable.get(&user_key).unwrap().expect("missing entity");
+
+        // Create operations to add a dynamic data source
+        let mut data_source = mock_data_source();
+        let manifest_idx_and_name = vec![(0, "example data source".to_string())];
+
+        let ops = vec![EntityOperation::Set {
+            key: user_key.clone(),
+            data: partial_entity.clone(),
+        }];
+
+        // Add user and dynamic data source to the store
+        data_source.creation_block = Some(TEST_BLOCK_3_PTR.number);
+        transact_entities_and_dynamic_data_sources(
+            &subgraph_store,
+            deployment.clone(),
+            TEST_BLOCK_3_PTR.clone(),
+            vec![data_source.as_stored_dynamic_data_source()],
+            ops,
+            manifest_idx_and_name.clone(),
+        )
+        .await
+        .unwrap();
+
+        // Verify that the user is no longer the original
+        assert_ne!(
+            writable.get(&user_key).unwrap().expect("missing entity"),
+            original_user
+        );
+
+        // Verify that the dynamic data source exists afterwards
+        let loaded_dds = writable
+            .load_dynamic_data_sources(manifest_idx_and_name.clone())
+            .await
+            .unwrap();
+        assert_eq!(1, loaded_dds.len());
+        assert_eq!(
+            data_source.address.unwrap().0,
+            **loaded_dds[0].param.as_ref().unwrap()
+        );
+
+        let subscription = subscribe(&deployment.hash, USER);
+
+        // Revert block that added the user and the dynamic data source
+        revert_block(&store, &deployment, &*TEST_BLOCK_2_PTR).await;
+
+        // Verify that the user is the original again
+        assert_eq!(
+            writable.get(&user_key).unwrap().expect("missing entity"),
+            original_user
+        );
+
+        // Verify that the dynamic data source is gone after the reversion
+        let loaded_dds = writable
+            .load_dynamic_data_sources(manifest_idx_and_name)
+            .await
+            .unwrap();
+        assert_eq!(0, loaded_dds.len());
+
+        // Verify that the right change events were emitted for the reversion
+        let expected_events = vec![StoreEvent {
+            tag: 3,
+            changes: HashSet::from_iter(
+                vec![EntityChange::Data {
+                    subgraph_id: DeploymentHash::new("testsubgraph").unwrap(),
+                    entity_type: EntityType::new(USER.into()),
+                }]
+                .into_iter(),
+            ),
+        }];
+        check_events(subscription, expected_events).await
+    })
+}
+
+#[test]
+fn entity_changes_are_fired_and_forwarded_to_subscriptions() {
+    run_test(|store, _, _| async move {
+        let subgraph_id = DeploymentHash::new("EntityChangeTestSubgraph").unwrap();
+        let schema =
+            Schema::parse(USER_GQL, subgraph_id.clone()).expect("Failed to parse user schema");
+        let manifest = SubgraphManifest::<graph_chain_ethereum::Chain> {
+            id: subgraph_id.clone(),
+            spec_version: Version::new(1, 0, 0),
+            features: Default::default(),
+            description: None,
+            repository: None,
+            schema: schema.clone(),
+            data_sources: vec![],
+            graft: None,
+            templates: vec![],
+            chain: PhantomData,
+        };
+
+        let deployment = DeploymentCreate::new(&manifest, Some(TEST_BLOCK_0_PTR.clone()));
+        let name = SubgraphName::new("test/entity-changes-are-fired").unwrap();
+        let node_id = NodeId::new("test").unwrap();
+        let deployment = store
+            .subgraph_store()
+            .create_subgraph_deployment(
+                name,
+                &schema,
+                deployment,
+                node_id,
+                NETWORK_NAME.to_string(),
+                SubgraphVersionSwitchingMode::Instant,
+            )
+            .unwrap();
+
+        let subscription = subscribe(&subgraph_id, USER);
+
+        // Add two entities to the store
+        let added_entities = vec![
+            (
+                "1".to_owned(),
+                Entity::from(vec![
+                    ("id", Value::from("1")),
+                    ("name", Value::from("Johnny Boy")),
+                ]),
+            ),
+            (
+                "2".to_owned(),
+                Entity::from(vec![
+                    ("id", Value::from("2")),
+                    ("name", Value::from("Tessa")),
+                ]),
+            ),
+        ];
+        transact_entity_operations(
+            &store.subgraph_store(),
+            &deployment,
+            TEST_BLOCK_1_PTR.clone(),
+            added_entities
+                .iter()
+                .map(|(id, data)| EntityOperation::Set {
+                    key: EntityKey::data(USER.to_owned(), id.to_owned()),
+                    data: data.to_owned(),
+                })
+                .collect(),
+        )
+        .await
+        .unwrap();
+
+        // Update an entity in the store
+        let updated_entity = Entity::from(vec![
+            ("id", Value::from("1")),
+            ("name", Value::from("Johnny")),
+        ]);
+        let update_op = EntityOperation::Set {
+            key: EntityKey::data(USER.to_owned(), "1".to_owned()),
+            data: updated_entity.clone(),
+        };
+
+        // Delete an entity in the store
+        let delete_op = EntityOperation::Remove {
+            key: EntityKey::data(USER.to_owned(), "2".to_owned()),
+        };
+
+        // Commit update & delete ops
+        transact_entity_operations(
+            &store.subgraph_store(),
+            &deployment,
+            TEST_BLOCK_2_PTR.clone(),
+            vec![update_op, delete_op],
+        )
+        .await
+        .unwrap();
+
+        // We're expecting two events to be written to the subscription stream
+        let user_type = EntityType::new(USER.to_owned());
+        let expected = vec![
+            StoreEvent::new(vec![
+                EntityChange::Data {
+                    subgraph_id: subgraph_id.clone(),
+                    entity_type: user_type.clone(),
+                },
+                EntityChange::Data {
+                    subgraph_id: subgraph_id.clone(),
+                    entity_type: user_type.clone(),
+                },
+            ]),
+            StoreEvent::new(vec![
+                EntityChange::Data {
+                    subgraph_id: subgraph_id.clone(),
+                    entity_type: user_type.clone(),
+                },
+                EntityChange::Data {
+                    subgraph_id: subgraph_id.clone(),
+                    entity_type: user_type.clone(),
+                },
+            ]),
+        ];
+
+        check_events(subscription, expected).await
+    })
+}
+
+#[test]
+fn throttle_subscription_delivers() {
+    run_test(|store, _, deployment| async move {
+        let subscription = subscribe(&deployment.hash, USER)
+            .throttle_while_syncing(
+                &*LOGGER,
+                store
+                    .clone()
+                    .query_store(
+                        QueryTarget::Deployment(deployment.hash.clone().into(), Default::default()),
+                        true,
+                    )
+                    .await
+                    .unwrap(),
+                Duration::from_millis(500),
+            )
+            .await;
+
+        let user4 = create_test_entity(
+            "4",
+            USER,
+            "Steve",
+            "nieve@email.com",
+            72 as i32,
+            120.7,
+            false,
+            None,
+        );
+
+        transact_entity_operations(
+            &store.subgraph_store(),
+            &deployment,
+            TEST_BLOCK_3_PTR.clone(),
+            vec![user4],
+        )
+        .await
+        .unwrap();
+
+        let expected = StoreEvent::new(vec![make_entity_change(USER)]);
+
+        check_events(subscription, vec![expected]).await
+    })
+}
+
+#[test]
+fn throttle_subscription_throttles() {
+    run_test(|store, _, deployment| async move {
+        // Throttle for a very long time (30s)
+        let subscription = subscribe(&deployment.hash, USER)
+            .throttle_while_syncing(
+                &*LOGGER,
+                store
+                    .clone()
+                    .query_store(
+                        QueryTarget::Deployment(deployment.hash.clone(), Default::default()),
+                        true,
+                    )
+                    .await
+                    .unwrap(),
+                Duration::from_secs(30),
+            )
+            .await;
+
+        let user4 = create_test_entity(
+            "4",
+            USER,
+            "Steve",
+            "nieve@email.com",
+            72 as i32,
+            120.7,
+            false,
+            None,
+        );
+
+        transact_entity_operations(
+            &store.subgraph_store(),
+            &deployment,
+            TEST_BLOCK_3_PTR.clone(),
+            vec![user4],
+        )
+        .await
+        .unwrap();
+
+        // Make sure we time out waiting for the subscription
+        let res = subscription
+            .take(1)
+            .collect()
+            .compat()
+            .timeout(Duration::from_millis(500))
+            .await;
+        assert!(res.is_err());
+    })
+}
+
+#[test]
+fn subgraph_schema_types_have_subgraph_id_directive() {
+    run_test(|store, _, deployment| async move {
+        let schema = store
+            .subgraph_store()
+            .api_schema(&deployment.hash, &Default::default())
+            .expect("test subgraph should have a schema");
+        for typedef in schema
+            .definitions()
+            .filter_map(|def| match def {
+                s::Definition::TypeDefinition(typedef) => Some(typedef),
+                _ => None,
+            })
+            .filter(|typedef| !typedef.is_introspection())
+        {
+            // Verify that all types have a @subgraphId directive on them
+            let directive = match typedef {
+                s::TypeDefinition::Object(t) => &t.directives,
+                s::TypeDefinition::Interface(t) => &t.directives,
+                s::TypeDefinition::Enum(t) => &t.directives,
+                s::TypeDefinition::Scalar(t) => &t.directives,
+                s::TypeDefinition::Union(t) => &t.directives,
+                s::TypeDefinition::InputObject(t) => &t.directives,
+            }
+            .iter()
+            .find(|directive| directive.name == "subgraphId")
+            .expect("all subgraph schema types should have a @subgraphId directive");
+
+            // Verify that all @subgraphId directives match the subgraph
+            assert_eq!(
+                directive.arguments,
+                [(
+                    String::from("id"),
+                    s::Value::String(TEST_SUBGRAPH_ID_STRING.to_string())
+                )]
+            );
+        }
+    })
+}
+
+#[test]
+fn handle_large_string_with_index() {
+    const NAME: &str = "name";
+    const ONE: &str = "large_string_one";
+    const TWO: &str = "large_string_two";
+
+    fn make_insert_op(id: &str, name: &str) -> EntityModification {
+        let mut data = Entity::new();
+        data.set("id", id);
+        data.set(NAME, name);
+
+        let key = EntityKey::data(USER.to_owned(), id.to_owned());
+
+        EntityModification::Insert { key, data }
+    }
+
+    run_test(|store, writable, deployment| async move {
+        // We have to produce a massive string (1_000_000 chars) because
+        // the repeated text compresses so well. This leads to an error
+        // 'index row requires 11488 bytes, maximum size is 8191' if
+        // used with a btree index without size limitation
+        let long_text = std::iter::repeat("Quo usque tandem")
+            .take(62500)
+            .collect::<String>();
+        let other_text = long_text.clone() + "X";
+
+        let metrics_registry = Arc::new(MockMetricsRegistry::new());
+        let stopwatch_metrics = StopwatchMetrics::new(
+            Logger::root(slog::Discard, o!()),
+            deployment.hash.clone(),
+            "test",
+            metrics_registry.clone(),
+        );
+
+        writable
+            .transact_block_operations(
+                TEST_BLOCK_3_PTR.clone(),
+                FirehoseCursor::None,
+                vec![
+                    make_insert_op(ONE, &long_text),
+                    make_insert_op(TWO, &other_text),
+                ],
+                &stopwatch_metrics,
+                Vec::new(),
+                Vec::new(),
+                Vec::new(),
+                Vec::new(),
+            )
+            .await
+            .expect("Failed to insert large text");
+        writable.flush().await.unwrap();
+
+        let query = user_query()
+            .first(5)
+            .filter(EntityFilter::Equal(
+                NAME.to_owned(),
+                long_text.clone().into(),
+            ))
+            .asc(NAME);
+
+        let ids = store
+            .subgraph_store()
+            .find(query)
+            .expect("Could not find entity")
+            .iter()
+            .map(|e| e.id())
+            .collect::<Result<Vec<_>, _>>()
+            .expect("Found entities without an id");
+
+        assert_eq!(vec![ONE], ids);
+
+        // Make sure we check the full string and not just a prefix
+        let mut prefix = long_text.clone();
+        prefix.truncate(STRING_PREFIX_SIZE);
+        let query = user_query()
+            .first(5)
+            .filter(EntityFilter::LessOrEqual(NAME.to_owned(), prefix.into()))
+            .asc(NAME);
+
+        let ids = store
+            .subgraph_store()
+            .find(query)
+            .expect("Could not find entity")
+            .iter()
+            .map(|e| e.id())
+            .collect::<Result<Vec<_>, _>>()
+            .expect("Found entities without an id");
+
+        // Users with name 'Cindini' and 'Johnton'
+        assert_eq!(vec!["2", "1"], ids);
+    })
+}
+
+#[test]
+fn handle_large_bytea_with_index() {
+    const NAME: &str = "bin_name";
+    const ONE: &str = "large_string_one";
+    const TWO: &str = "large_string_two";
+
+    fn make_insert_op(id: &str, name: &[u8]) -> EntityModification {
+        let mut data = Entity::new();
+        data.set("id", id);
+        data.set(NAME, scalar::Bytes::from(name));
+
+        let key = EntityKey::data(USER.to_owned(), id.to_owned());
+
+        EntityModification::Insert { key, data }
+    }
+
+    run_test(|store, writable, deployment| async move {
+        // We have to produce a massive bytea (240_000 bytes) because the
+        // repeated text compresses so well. This leads to an error 'index
+        // row size 2784 exceeds btree version 4 maximum 2704' if used with
+        // a btree index without size limitation
+        let long_bytea = std::iter::repeat("Quo usque tandem")
+            .take(15000)
+            .collect::<String>()
+            .into_bytes();
+        let other_bytea = {
+            let mut other_bytea = long_bytea.clone();
+            other_bytea.push(b'X');
+            scalar::Bytes::from(other_bytea.as_slice())
+        };
+        let long_bytea = scalar::Bytes::from(long_bytea.as_slice());
+
+        let metrics_registry = Arc::new(MockMetricsRegistry::new());
+        let stopwatch_metrics = StopwatchMetrics::new(
+            Logger::root(slog::Discard, o!()),
+            deployment.hash.clone(),
+            "test",
+            metrics_registry.clone(),
+        );
+
+        writable
+            .transact_block_operations(
+                TEST_BLOCK_3_PTR.clone(),
+                FirehoseCursor::None,
+                vec![
+                    make_insert_op(ONE, &long_bytea),
+                    make_insert_op(TWO, &other_bytea),
+                ],
+                &stopwatch_metrics,
+                Vec::new(),
+                Vec::new(),
+                Vec::new(),
+                Vec::new(),
+            )
+            .await
+            .expect("Failed to insert large text");
+        writable.flush().await.unwrap();
+
+        let query = user_query()
+            .first(5)
+            .filter(EntityFilter::Equal(
+                NAME.to_owned(),
+                long_bytea.clone().into(),
+            ))
+            .asc(NAME);
+
+        let ids = store
+            .subgraph_store()
+            .find(query)
+            .expect("Could not find entity")
+            .iter()
+            .map(|e| e.id())
+            .collect::<Result<Vec<_>, _>>()
+            .expect("Found entities without an id");
+
+        assert_eq!(vec![ONE], ids);
+
+        // Make sure we check the full string and not just a prefix
+        let prefix = scalar::Bytes::from(&long_bytea.as_slice()[..64]);
+        let query = user_query()
+            .first(5)
+            .filter(EntityFilter::LessOrEqual(NAME.to_owned(), prefix.into()))
+            .asc(NAME);
+
+        let ids = store
+            .subgraph_store()
+            .find(query)
+            .expect("Could not find entity")
+            .iter()
+            .map(|e| e.id())
+            .collect::<Result<Vec<_>, _>>()
+            .expect("Found entities without an id");
+
+        // Users with name 'Cindini' and 'Johnton'
+        assert_eq!(vec!["2", "1"], ids);
+    })
+}
+
+#[derive(Clone)]
+struct WindowQuery(EntityQuery, Arc<DieselSubgraphStore>);
+
+impl WindowQuery {
+    fn new(store: &Arc<DieselStore>) -> Self {
+        WindowQuery(
+            user_query()
+                .filter(EntityFilter::GreaterThan("age".into(), Value::from(0)))
+                .first(10),
+            store.subgraph_store(),
+        )
+        .default_window()
+    }
+
+    fn default_window(mut self) -> Self {
+        let entity_types = match self.0.collection {
+            EntityCollection::All(entity_types) => entity_types,
+            EntityCollection::Window(_) => {
+                unreachable!("we do not use this method with a windowed collection")
+            }
+        };
+        let windows = entity_types
+            .into_iter()
+            .map(|(child_type, column_names)| {
+                let attribute = WindowAttribute::Scalar("favorite_color".to_owned());
+                let link = EntityLink::Direct(attribute, ChildMultiplicity::Many);
+                let ids = vec!["red", "green", "yellow", "blue"]
+                    .into_iter()
+                    .map(String::from)
+                    .collect();
+                EntityWindow {
+                    child_type,
+                    ids,
+                    link,
+                    column_names,
+                }
+            })
+            .collect();
+        self.0.collection = EntityCollection::Window(windows);
+        self
+    }
+
+    fn first(self, first: u32) -> Self {
+        WindowQuery(self.0.first(first), self.1)
+    }
+
+    fn skip(self, skip: u32) -> Self {
+        WindowQuery(self.0.skip(skip), self.1)
+    }
+
+    fn asc(self, attr: &str) -> Self {
+        WindowQuery(
+            self.0
+                .order(EntityOrder::Ascending(attr.to_owned(), ValueType::String)),
+            self.1,
+        )
+    }
+
+    fn desc(self, attr: &str) -> Self {
+        WindowQuery(
+            self.0
+                .order(EntityOrder::Descending(attr.to_owned(), ValueType::String)),
+            self.1,
+        )
+    }
+
+    fn unordered(self) -> Self {
+        WindowQuery(self.0.order(EntityOrder::Unordered), self.1)
+    }
+
+    fn above(self, age: i32) -> Self {
+        WindowQuery(
+            self.0
+                .filter(EntityFilter::GreaterThan("age".into(), Value::from(age))),
+            self.1,
+        )
+    }
+
+    fn against_color_and_age(self) -> Self {
+        let mut query = self.0;
+        query.collection = EntityCollection::All(vec![
+            (EntityType::from(USER), AttributeNames::All),
+            (EntityType::from("Person"), AttributeNames::All),
+        ]);
+        WindowQuery(query, self.1).default_window()
+    }
+
+    fn expect(&self, mut expected_ids: Vec<&str>, qid: &str) {
+        let query = self.0.clone();
+        let store = &self.1;
+        let unordered = matches!(query.order, EntityOrder::Unordered);
+        let mut entity_ids = store
+            .find(query)
+            .expect("store.find failed to execute query")
+            .into_iter()
+            .map(|entity| match entity.get("id") {
+                Some(Value::String(id)) => id.to_owned(),
+                Some(_) => panic!("store.find returned entity with non-string ID attribute"),
+                None => panic!("store.find returned entity with no ID attribute"),
+            })
+            .collect::<Vec<_>>();
+        if unordered {
+            entity_ids.sort();
+            expected_ids.sort();
+        }
+        assert_eq!(expected_ids, entity_ids, "Failed query: {}", qid);
+    }
+}
+
+#[test]
+fn window() {
+    fn make_color_end_age(entity_type: &str, id: &str, color: &str, age: i32) -> EntityOperation {
+        let mut entity = Entity::new();
+
+        entity.set("id", id.to_owned());
+        entity.set("age", age);
+        entity.set("favorite_color", color);
+        EntityOperation::Set {
+            key: EntityKey::data(entity_type.to_owned(), id.to_owned()),
+            data: entity,
+        }
+    }
+
+    fn make_user(id: &str, color: &str, age: i32) -> EntityOperation {
+        make_color_end_age(USER, id, color, age)
+    }
+
+    fn make_person(id: &str, color: &str, age: i32) -> EntityOperation {
+        make_color_end_age("Person", id, color, age)
+    }
+
+    let ops = vec![
+        make_user("4", "green", 34),
+        make_user("5", "green", 17),
+        make_user("6", "green", 41),
+        make_user("7", "red", 25),
+        make_user("8", "red", 45),
+        make_user("9", "yellow", 37),
+        make_user("10", "blue", 27),
+        make_user("11", "blue", 19),
+        make_person("p1", "green", 12),
+        make_person("p2", "red", 15),
+    ];
+
+    run_test(|store, _, deployment| async move {
+        transact_and_wait(
+            &store.subgraph_store(),
+            &deployment,
+            TEST_BLOCK_3_PTR.clone(),
+            ops,
+        )
+        .await
+        .expect("Failed to create test users");
+
+        // Get the first 2 entries in each 'color group'
+        WindowQuery::new(&store)
+            .first(2)
+            .expect(vec!["10", "11", "4", "5", "2", "7", "9"], "q1");
+
+        WindowQuery::new(&store)
+            .first(1)
+            .expect(vec!["10", "4", "2", "9"], "q2");
+
+        WindowQuery::new(&store)
+            .first(1)
+            .skip(1)
+            .expect(vec!["11", "5", "7"], "q3");
+
+        WindowQuery::new(&store)
+            .first(1)
+            .skip(1)
+            .desc("id")
+            .expect(vec!["10", "5", "7"], "q4");
+
+        WindowQuery::new(&store)
+            .first(1)
+            .skip(1)
+            .desc("favorite_color")
+            .expect(vec!["10", "5", "7"], "q5");
+
+        WindowQuery::new(&store)
+            .first(1)
+            .skip(1)
+            .desc("favorite_color")
+            .above(25)
+            .expect(vec!["4", "2"], "q6");
+
+        // Check queries for interfaces
+        WindowQuery::new(&store)
+            .first(1)
+            .skip(1)
+            .desc("favorite_color")
+            .above(12)
+            .against_color_and_age()
+            .expect(vec!["10", "5", "8"], "q7");
+
+        WindowQuery::new(&store)
+            .first(1)
+            .asc("age")
+            .above(12)
+            .against_color_and_age()
+            .expect(vec!["11", "5", "p2", "9"], "q8");
+
+        WindowQuery::new(&store)
+            .unordered()
+            .above(12)
+            .against_color_and_age()
+            .expect(
+                vec!["10", "11", "2", "4", "5", "6", "7", "8", "9", "p2"],
+                "q9",
+            );
+    });
+}
+
+#[test]
+fn find_at_block() {
+    fn shaqueeena_at_block(block: BlockNumber, email: &'static str) {
+        run_test(move |store, _, _| async move {
+            let mut query = user_query()
+                .filter(EntityFilter::Equal("name".to_owned(), "Shaqueeena".into()))
+                .desc("name");
+            query.block = block;
+
+            let entities = store
+                .subgraph_store()
+                .find(query)
+                .expect("store.find failed to execute query");
+
+            assert_eq!(1, entities.len());
+            let entity = entities.first().unwrap();
+            assert_eq!(Some(&Value::from(email)), entity.get("email"));
+        })
+    }
+
+    shaqueeena_at_block(1, "queensha@email.com");
+    shaqueeena_at_block(2, "teeko@email.com");
+    shaqueeena_at_block(7000, "teeko@email.com");
+}
+
+#[test]
+fn cleanup_cached_blocks() {
+    if store_is_sharded() {
+        // When the store is sharded, the setup in main.rs makes sure we
+        // don't ever try to clean up cached blocks
+        println!("store is sharded, skipping test");
+        return;
+    }
+
+    run_test(|store, _, _| async move {
+        use block_store::*;
+        // The test subgraph is at block 2. Since we don't ever delete
+        // the genesis block, the only block eligible for cleanup is BLOCK_ONE
+        // and the first retained block is block 2.
+        block_store::set_chain(
+            vec![&*GENESIS_BLOCK, &*BLOCK_ONE, &*BLOCK_TWO, &*BLOCK_THREE],
+            NETWORK_NAME,
+        );
+        let chain_store = store
+            .block_store()
+            .chain_store(NETWORK_NAME)
+            .expect("fake chain store");
+        let cleaned = chain_store
+            .cleanup_cached_blocks(10)
+            .expect("cleanup succeeds");
+        assert_eq!(Some((2, 1)), cleaned);
+    })
+}
+
+#[test]
+/// checks if retrieving the timestamp from the data blob works.
+/// on ethereum, the block has timestamp as U256 so it will always have a value
+fn parse_timestamp() {
+    const EXPECTED_TS: u64 = 1657712166;
+
+    run_test(|store, _, _| async move {
+        use block_store::*;
+        // The test subgraph is at block 2. Since we don't ever delete
+        // the genesis block, the only block eligible for cleanup is BLOCK_ONE
+        // and the first retained block is block 2.
+        block_store::set_chain(
+            vec![
+                &*GENESIS_BLOCK,
+                &*BLOCK_ONE,
+                &*BLOCK_TWO,
+                &*BLOCK_THREE_TIMESTAMP,
+            ],
+            NETWORK_NAME,
+        );
+        let chain_store = store
+            .block_store()
+            .chain_store(NETWORK_NAME)
+            .expect("fake chain store");
+
+        let (_network, number, timestamp) = chain_store
+            .block_number(&BLOCK_THREE_TIMESTAMP.block_hash())
+            .await
+            .expect("block_number to return correct number and timestamp")
+            .unwrap();
+        assert_eq!(number, 3);
+        assert_eq!(timestamp.unwrap(), EXPECTED_TS);
+    })
+}
+
+#[test]
+/// checks if retrieving the timestamp from the data blob works.
+/// on ethereum, the block has timestamp as U256 so it will always have a value
+fn parse_null_timestamp() {
+    run_test(|store, _, _| async move {
+        use block_store::*;
+        // The test subgraph is at block 2. Since we don't ever delete
+        // the genesis block, the only block eligible for cleanup is BLOCK_ONE
+        // and the first retained block is block 2.
+        block_store::set_chain(
+            vec![
+                &*GENESIS_BLOCK,
+                &*BLOCK_ONE,
+                &*BLOCK_TWO,
+                &*BLOCK_THREE_NO_TIMESTAMP,
+            ],
+            NETWORK_NAME,
+        );
+        let chain_store = store
+            .block_store()
+            .chain_store(NETWORK_NAME)
+            .expect("fake chain store");
+
+        let (_network, number, timestamp) = chain_store
+            .block_number(&BLOCK_THREE_NO_TIMESTAMP.block_hash())
+            .await
+            .expect("block_number to return correct number and timestamp")
+            .unwrap();
+        assert_eq!(number, 3);
+        assert_eq!(true, timestamp.is_none());
+    })
+}
+#[test]
+fn reorg_tracking() {
+    async fn update_john(
+        store: &Arc<DieselSubgraphStore>,
+        deployment: &DeploymentLocator,
+        age: i32,
+        block: &BlockPtr,
+    ) {
+        let test_entity_1 = create_test_entity(
+            "1",
+            USER,
+            "Johnton",
+            "tonofjohn@email.com",
+            age,
+            184.4,
+            false,
+            None,
+        );
+        transact_and_wait(store, deployment, block.clone(), vec![test_entity_1])
+            .await
+            .unwrap();
+    }
+
+    macro_rules! check_state {
+        ($store:expr,
+         $reorg_count: expr,
+         $max_reorg_depth:expr,
+         $latest_ethereum_block_number:expr) => {
+            let subgraph_id = TEST_SUBGRAPH_ID.to_owned();
+            let state = deployment_state($store.as_ref(), &subgraph_id).await;
+            assert_eq!(&subgraph_id, &state.id, "subgraph_id");
+            assert_eq!($reorg_count, state.reorg_count, "reorg_count");
+            assert_eq!($max_reorg_depth, state.max_reorg_depth, "max_reorg_depth");
+            assert_eq!(
+                $latest_ethereum_block_number, state.latest_block.number,
+                "latest_ethereum_block_number"
+            );
+        };
+    }
+
+    // Check that reorg_count, max_reorg_depth, and latest_ethereum_block_number
+    // are reported correctly in DeploymentState
+    run_test(|store, _, deployment| async move {
+        let subgraph_store = store.subgraph_store();
+
+        check_state!(store, 0, 0, 2);
+
+        // Jump to block 4
+        transact_and_wait(
+            &subgraph_store,
+            &deployment,
+            TEST_BLOCK_4_PTR.clone(),
+            vec![],
+        )
+        .await
+        .unwrap();
+        check_state!(store, 0, 0, 4);
+
+        // Back to block 3
+        revert_block(&store, &deployment, &*TEST_BLOCK_3_PTR).await;
+        check_state!(store, 1, 1, 3);
+
+        // Back to block 2
+        revert_block(&store, &deployment, &*TEST_BLOCK_2_PTR).await;
+        check_state!(store, 2, 2, 2);
+
+        // Forward to block 3
+        update_john(&subgraph_store, &deployment, 70, &TEST_BLOCK_3_PTR).await;
+        check_state!(store, 2, 2, 3);
+
+        // Forward to block 4
+        update_john(&subgraph_store, &deployment, 71, &TEST_BLOCK_4_PTR).await;
+        check_state!(store, 2, 2, 4);
+
+        // Forward to block 5
+        update_john(&subgraph_store, &deployment, 72, &TEST_BLOCK_5_PTR).await;
+        check_state!(store, 2, 2, 5);
+
+        // Revert all the way back to block 2
+        revert_block(&store, &deployment, &*TEST_BLOCK_4_PTR).await;
+        check_state!(store, 3, 2, 4);
+
+        revert_block(&store, &deployment, &*TEST_BLOCK_3_PTR).await;
+        check_state!(store, 4, 2, 3);
+
+        revert_block(&store, &deployment, &*TEST_BLOCK_2_PTR).await;
+        check_state!(store, 5, 3, 2);
+    })
+}
diff --git a/store/postgres/tests/subgraph.rs b/store/postgres/tests/subgraph.rs
new file mode 100644
index 0000000..12d6e2c
--- /dev/null
+++ b/store/postgres/tests/subgraph.rs
@@ -0,0 +1,1062 @@
+use graph::{
+    components::{
+        server::index_node::VersionInfo,
+        store::{DeploymentId, DeploymentLocator, StatusStore},
+    },
+    data::query::QueryTarget,
+    data::subgraph::schema::SubgraphHealth,
+    data::subgraph::schema::{DeploymentCreate, SubgraphError},
+    prelude::BlockPtr,
+    prelude::EntityChange,
+    prelude::EntityChangeOperation,
+    prelude::QueryStoreManager,
+    prelude::Schema,
+    prelude::SubgraphManifest,
+    prelude::SubgraphName,
+    prelude::SubgraphVersionSwitchingMode,
+    prelude::UnfailOutcome,
+    prelude::{futures03, StoreEvent},
+    prelude::{CheapClone, DeploymentHash, NodeId, SubgraphStore as _},
+    semver::Version,
+};
+use graph_store_postgres::layout_for_tests::Connection as Primary;
+use graph_store_postgres::SubgraphStore;
+
+use std::{collections::HashSet, marker::PhantomData, sync::Arc};
+use test_store::*;
+
+const SUBGRAPH_GQL: &str = "
+    type User @entity {
+        id: ID!,
+        name: String
+    }
+";
+
+fn assigned(deployment: &DeploymentLocator) -> EntityChange {
+    EntityChange::Assignment {
+        deployment: deployment.clone(),
+        operation: EntityChangeOperation::Set,
+    }
+}
+
+fn unassigned(deployment: &DeploymentLocator) -> EntityChange {
+    EntityChange::Assignment {
+        deployment: deployment.clone(),
+        operation: EntityChangeOperation::Removed,
+    }
+}
+
+fn get_version_info(store: &Store, subgraph_name: &str) -> VersionInfo {
+    let primary = primary_connection();
+    let (current, _) = primary.versions_for_subgraph(subgraph_name).unwrap();
+    let current = current.unwrap();
+    store.version_info(&current).unwrap()
+}
+
+async fn latest_block(store: &Store, deployment_id: DeploymentId) -> BlockPtr {
+    store
+        .subgraph_store()
+        .writable(LOGGER.clone(), deployment_id)
+        .await
+        .expect("can get writable")
+        .block_ptr()
+        .unwrap()
+}
+
+#[test]
+fn reassign_subgraph() {
+    async fn setup() -> DeploymentLocator {
+        let id = DeploymentHash::new("reassignSubgraph").unwrap();
+        remove_subgraphs();
+        create_test_subgraph(&id, SUBGRAPH_GQL).await
+    }
+
+    fn find_assignment(store: &SubgraphStore, deployment: &DeploymentLocator) -> Option<String> {
+        store
+            .assigned_node(deployment)
+            .unwrap()
+            .map(|node| node.to_string())
+    }
+
+    run_test_sequentially(|store| async move {
+        let id = setup().await;
+        let store = store.subgraph_store();
+
+        // Check our setup
+        let node = find_assignment(store.as_ref(), &id);
+        let placement = place("test").expect("the test config places deployments");
+        if let Some((_, nodes)) = placement {
+            // If the test config does not have deployment rules, we can't check
+            // anything here. This will happen when the tests do not use
+            // a configuration file
+            assert_eq!(1, nodes.len());
+            let placed_node = nodes.first().map(|node| node.to_string());
+            assert_eq!(placed_node, node);
+        }
+
+        // Assign to node 'left' twice, the first time we assign from 'test'
+        // to 'left', the second time from 'left' to 'left', with the same results
+        for _ in 0..2 {
+            let node = NodeId::new("left").unwrap();
+            let expected = vec![StoreEvent::new(vec![assigned(&id)])];
+
+            let (_, events) = tap_store_events(|| store.reassign_subgraph(&id, &node).unwrap());
+            let node = find_assignment(store.as_ref(), &id);
+            assert_eq!(Some("left"), node.as_deref());
+            assert_eq!(expected, events);
+        }
+    })
+}
+
+#[test]
+fn create_subgraph() {
+    const SUBGRAPH_NAME: &str = "create/subgraph";
+
+    // Return the versions (not deployments) for a subgraph
+    fn subgraph_versions(primary: &Primary) -> (Option<String>, Option<String>) {
+        primary.versions_for_subgraph(&*SUBGRAPH_NAME).unwrap()
+    }
+
+    /// Return the deployment for the current and the pending version of the
+    /// subgraph with the given `entity_id`
+    fn subgraph_deployments(primary: &Primary) -> (Option<String>, Option<String>) {
+        let (current, pending) = subgraph_versions(primary);
+        (
+            current.and_then(|v| primary.deployment_for_version(&v).unwrap()),
+            pending.and_then(|v| primary.deployment_for_version(&v).unwrap()),
+        )
+    }
+
+    fn deploy(
+        store: &SubgraphStore,
+        id: &str,
+        mode: SubgraphVersionSwitchingMode,
+    ) -> (DeploymentLocator, HashSet<EntityChange>) {
+        let name = SubgraphName::new(SUBGRAPH_NAME.to_string()).unwrap();
+        let id = DeploymentHash::new(id.to_string()).unwrap();
+        let schema = Schema::parse(SUBGRAPH_GQL, id.clone()).unwrap();
+
+        let manifest = SubgraphManifest::<graph_chain_ethereum::Chain> {
+            id: id.clone(),
+            spec_version: Version::new(1, 0, 0),
+            features: Default::default(),
+            description: None,
+            repository: None,
+            schema: schema.clone(),
+            data_sources: vec![],
+            graft: None,
+            templates: vec![],
+            chain: PhantomData,
+        };
+        let deployment = DeploymentCreate::new(&manifest, None);
+        let node_id = NodeId::new("left").unwrap();
+
+        let (deployment, events) = tap_store_events(|| {
+            store
+                .create_subgraph_deployment(
+                    name,
+                    &schema,
+                    deployment,
+                    node_id,
+                    NETWORK_NAME.to_string(),
+                    mode,
+                )
+                .unwrap()
+        });
+        let events = events
+            .into_iter()
+            .map(|event| event.changes.into_iter())
+            .flatten()
+            .collect();
+        (deployment, events)
+    }
+
+    fn deploy_event(deployment: &DeploymentLocator) -> HashSet<EntityChange> {
+        let mut changes = HashSet::new();
+        changes.insert(assigned(deployment));
+        changes
+    }
+
+    fn deployment_synced(store: &Arc<SubgraphStore>, deployment: &DeploymentLocator) {
+        futures03::executor::block_on(store.cheap_clone().writable(LOGGER.clone(), deployment.id))
+            .expect("can get writable")
+            .deployment_synced()
+            .unwrap();
+    }
+
+    // Test VersionSwitchingMode::Instant
+    run_test_sequentially(|store| async move {
+        remove_subgraphs();
+        let store = store.subgraph_store();
+
+        const MODE: SubgraphVersionSwitchingMode = SubgraphVersionSwitchingMode::Instant;
+        const ID1: &str = "instant";
+        const ID2: &str = "instant2";
+        const ID3: &str = "instant3";
+
+        let primary = primary_connection();
+
+        let name = SubgraphName::new(SUBGRAPH_NAME.to_string()).unwrap();
+        let (_, events) = tap_store_events(|| store.create_subgraph(name.clone()).unwrap());
+        let (current, pending) = subgraph_deployments(&primary);
+        assert!(events.is_empty());
+        assert!(current.is_none());
+        assert!(pending.is_none());
+
+        // Deploy
+        let (deployment1, events) = deploy(store.as_ref(), ID1, MODE);
+        let expected = deploy_event(&deployment1);
+        assert_eq!(expected, events);
+
+        let (current, pending) = subgraph_deployments(&primary);
+        assert_eq!(Some(ID1), current.as_deref());
+        assert!(pending.is_none());
+
+        // Deploying again overwrites current
+        let (deployment2, events) = deploy(store.as_ref(), ID2, MODE);
+        let mut expected = deploy_event(&deployment2);
+        expected.insert(unassigned(&deployment1));
+        assert_eq!(expected, events);
+
+        let (current, pending) = subgraph_deployments(&primary);
+        assert_eq!(Some(ID2), current.as_deref());
+        assert!(pending.is_none());
+
+        // Sync deployment
+        deployment_synced(&store, &deployment2);
+
+        // Deploying again still overwrites current
+        let (deployment3, events) = deploy(store.as_ref(), ID3, MODE);
+        let mut expected = deploy_event(&deployment3);
+        expected.insert(unassigned(&deployment2));
+        assert_eq!(expected, events);
+
+        let (current, pending) = subgraph_deployments(&primary);
+        assert_eq!(Some(ID3), current.as_deref());
+        assert!(pending.is_none());
+    });
+
+    // Test VersionSwitchingMode::Synced
+    run_test_sequentially(|store| async move {
+        remove_subgraphs();
+        let store = store.subgraph_store();
+
+        const MODE: SubgraphVersionSwitchingMode = SubgraphVersionSwitchingMode::Synced;
+        const ID1: &str = "synced";
+        const ID2: &str = "synced2";
+        const ID3: &str = "synced3";
+
+        let primary = primary_connection();
+
+        let name = SubgraphName::new(SUBGRAPH_NAME.to_string()).unwrap();
+        let (_, events) = tap_store_events(|| store.create_subgraph(name.clone()).unwrap());
+        let (current, pending) = subgraph_deployments(&primary);
+        assert!(events.is_empty());
+        assert!(current.is_none());
+        assert!(pending.is_none());
+
+        // Deploy
+        let (deployment1, events) = deploy(store.as_ref(), ID1, MODE);
+        let expected = deploy_event(&deployment1);
+        assert_eq!(expected, events);
+
+        let versions = subgraph_versions(&primary);
+        let (current, pending) = subgraph_deployments(&primary);
+        assert_eq!(Some(ID1), current.as_deref());
+        assert!(pending.is_none());
+
+        // Deploying the same thing again does nothing
+        let (deployment1_again, events) = deploy(store.as_ref(), ID1, MODE);
+        assert!(events.is_empty());
+        assert_eq!(&deployment1, &deployment1_again);
+        let versions2 = subgraph_versions(&primary);
+        assert_eq!(versions, versions2);
+
+        // Deploy again, current is not synced, so it gets replaced
+        let (deployment2, events) = deploy(store.as_ref(), ID2, MODE);
+        let mut expected = deploy_event(&deployment2);
+        expected.insert(unassigned(&deployment1));
+        assert_eq!(expected, events);
+
+        let (current, pending) = subgraph_deployments(&primary);
+        assert_eq!(Some(ID2), current.as_deref());
+        assert!(pending.is_none());
+
+        // Deploy when current is synced leaves current alone and adds pending
+        deployment_synced(&store, &deployment2);
+        let (deployment3, events) = deploy(store.as_ref(), ID3, MODE);
+        let expected = deploy_event(&deployment3);
+        assert_eq!(expected, events);
+
+        let versions = subgraph_versions(&primary);
+        let (current, pending) = subgraph_deployments(&primary);
+        assert_eq!(Some(ID2), current.as_deref());
+        assert_eq!(Some(ID3), pending.as_deref());
+
+        // Deploying that same thing again changes nothing
+        let (deployment3_again, events) = deploy(store.as_ref(), ID3, MODE);
+        assert!(events.is_empty());
+        assert_eq!(&deployment3, &deployment3_again);
+        let versions2 = subgraph_versions(&primary);
+        assert_eq!(versions, versions2);
+        let (current, pending) = subgraph_deployments(&primary);
+        assert_eq!(Some(ID2), current.as_deref());
+        assert_eq!(Some(ID3), pending.as_deref());
+
+        // Deploy the current version `ID2` once more; since it is synced,
+        // it will displace the non-synced version `ID3` and remain the
+        // current version
+        let mut expected = HashSet::new();
+        expected.insert(unassigned(&deployment3));
+
+        let (deployment2_again, events) = deploy(store.as_ref(), ID2, MODE);
+        assert_eq!(&deployment2, &deployment2_again);
+        assert_eq!(expected, events);
+
+        let (current, pending) = subgraph_deployments(&primary);
+        assert_eq!(Some(ID2), current.as_deref());
+        assert_eq!(None, pending.as_deref());
+
+        // Mark `ID3` as synced and deploy that again
+        deployment_synced(&store, &deployment3);
+        let expected = HashSet::from([unassigned(&deployment2), assigned(&deployment3)]);
+        let (deployment3_again, events) = deploy(store.as_ref(), ID3, MODE);
+        assert_eq!(&deployment3, &deployment3_again);
+        assert_eq!(expected, events);
+
+        let (current, pending) = subgraph_deployments(&primary);
+        assert_eq!(Some(ID3), current.as_deref());
+        assert_eq!(None, pending.as_deref());
+    })
+}
+
+#[test]
+fn status() {
+    const NAME: &str = "infoSubgraph";
+    const OTHER: &str = "otherInfoSubgraph";
+
+    async fn setup() -> DeploymentLocator {
+        let id = DeploymentHash::new(NAME).unwrap();
+        remove_subgraphs();
+        let deployment = create_test_subgraph(&id, SUBGRAPH_GQL).await;
+        create_test_subgraph(&DeploymentHash::new(OTHER).unwrap(), SUBGRAPH_GQL).await;
+        deployment
+    }
+
+    run_test_sequentially(|store| async move {
+        use graph::data::subgraph::status;
+
+        let deployment = setup().await;
+        let infos = store
+            .status(status::Filter::Deployments(vec![
+                deployment.hash.to_string(),
+                "notASubgraph".to_string(),
+                "not-even-a-valid-id".to_string(),
+            ]))
+            .unwrap();
+        assert_eq!(1, infos.len());
+        let info = infos.first().unwrap();
+        assert_eq!(NAME, info.subgraph);
+        assert!(!info.synced);
+
+        let infos = store.status(status::Filter::Deployments(vec![])).unwrap();
+        assert_eq!(2, infos.len());
+        let info = infos
+            .into_iter()
+            .find(|info| info.subgraph == NAME)
+            .expect("the NAME subgraph is in infos");
+        assert_eq!(NAME, info.subgraph);
+        assert!(!info.synced);
+
+        let infos = store
+            .status(status::Filter::SubgraphName(NAME.to_string()))
+            .unwrap();
+        assert_eq!(1, infos.len());
+        let info = infos.first().unwrap();
+        assert_eq!(NAME, info.subgraph);
+        assert!(!info.synced);
+
+        let infos = store
+            .status(status::Filter::SubgraphVersion(NAME.to_string(), true))
+            .unwrap();
+        assert_eq!(1, infos.len());
+        let info = infos.first().unwrap();
+        assert_eq!(NAME, info.subgraph);
+        assert!(!info.synced);
+
+        let infos = store
+            .status(status::Filter::SubgraphVersion(NAME.to_string(), false))
+            .unwrap();
+        assert!(infos.is_empty());
+
+        let infos = store
+            .status(status::Filter::SubgraphName("invalid name".to_string()))
+            .unwrap();
+        assert_eq!(0, infos.len());
+
+        let infos = store
+            .status(status::Filter::SubgraphName("notASubgraph".to_string()))
+            .unwrap();
+        assert_eq!(0, infos.len());
+
+        let infos = store
+            .status(status::Filter::SubgraphVersion(
+                "notASubgraph".to_string(),
+                true,
+            ))
+            .unwrap();
+        assert_eq!(0, infos.len());
+
+        const MSG: &str = "your father smells of elderberries";
+        let error = SubgraphError {
+            subgraph_id: deployment.hash.clone(),
+            message: MSG.to_string(),
+            block_ptr: Some(GENESIS_PTR.clone()),
+            handler: None,
+            deterministic: true,
+        };
+
+        store
+            .subgraph_store()
+            .writable(LOGGER.clone(), deployment.id)
+            .await
+            .expect("can get writable")
+            .fail_subgraph(error)
+            .await
+            .unwrap();
+        let infos = store
+            .status(status::Filter::Deployments(vec![deployment
+                .hash
+                .to_string()]))
+            .unwrap();
+        assert_eq!(1, infos.len());
+        let info = infos.first().unwrap();
+        assert_eq!(NAME, info.subgraph);
+        assert!(!info.synced);
+        assert_eq!(SubgraphHealth::Failed, info.health);
+        let error = info.fatal_error.as_ref().unwrap();
+        assert_eq!(MSG, error.message.as_str());
+        assert!(error.deterministic);
+    })
+}
+
+#[test]
+fn version_info() {
+    const NAME: &str = "versionInfoSubgraph";
+
+    async fn setup() -> DeploymentLocator {
+        let id = DeploymentHash::new(NAME).unwrap();
+        remove_subgraphs();
+        block_store::set_chain(vec![], NETWORK_NAME);
+        create_test_subgraph(&id, SUBGRAPH_GQL).await
+    }
+
+    run_test_sequentially(|store| async move {
+        let deployment = setup().await;
+        transact_and_wait(
+            &store.subgraph_store(),
+            &deployment,
+            BLOCK_ONE.clone(),
+            vec![],
+        )
+        .await
+        .unwrap();
+
+        let vi = get_version_info(&store, NAME);
+        assert_eq!(&*NAME, vi.deployment_id.as_str());
+        assert_eq!(false, vi.synced);
+        assert_eq!(false, vi.failed);
+        assert_eq!(
+            Some("manifest for versionInfoSubgraph"),
+            vi.description.as_deref()
+        );
+        assert_eq!(
+            Some("repo for versionInfoSubgraph"),
+            vi.repository.as_deref()
+        );
+        assert_eq!(&*NAME, vi.schema.id.as_str());
+        assert_eq!(Some(1), vi.latest_ethereum_block_number);
+        assert_eq!(&*NETWORK_NAME, vi.network.as_str());
+        // We set the head for the network to null in the test framework
+        assert_eq!(None, vi.total_ethereum_blocks_count);
+    })
+}
+
+#[test]
+fn subgraph_error() {
+    test_store::run_test_sequentially(|store| async move {
+        let subgraph_id = DeploymentHash::new("testSubgraph").unwrap();
+        let deployment =
+            test_store::create_test_subgraph(&subgraph_id, "type Foo { id: ID! }").await;
+
+        let count = || -> usize {
+            let store = store.subgraph_store();
+            store.error_count(&subgraph_id).unwrap()
+        };
+
+        let error = SubgraphError {
+            subgraph_id: subgraph_id.clone(),
+            message: "test".to_string(),
+            block_ptr: None,
+            handler: None,
+            deterministic: false,
+        };
+
+        assert!(count() == 0);
+
+        transact_errors(&store, &deployment, BLOCKS[1].clone(), vec![error])
+            .await
+            .unwrap();
+        assert!(count() == 1);
+
+        let error = SubgraphError {
+            subgraph_id: subgraph_id.clone(),
+            message: "test".to_string(),
+            block_ptr: None,
+            handler: None,
+            deterministic: false,
+        };
+
+        // Inserting the same error is allowed but ignored.
+        transact_errors(&store, &deployment, BLOCKS[2].clone(), vec![error])
+            .await
+            .unwrap();
+        assert!(count() == 1);
+
+        let error2 = SubgraphError {
+            subgraph_id: subgraph_id.clone(),
+            message: "test2".to_string(),
+            block_ptr: None,
+            handler: None,
+            deterministic: false,
+        };
+
+        transact_errors(&store, &deployment, BLOCKS[3].clone(), vec![error2])
+            .await
+            .unwrap();
+        assert!(count() == 2);
+
+        test_store::remove_subgraph(&subgraph_id);
+    })
+}
+
+#[test]
+fn fatal_vs_non_fatal() {
+    async fn setup() -> DeploymentLocator {
+        let id = DeploymentHash::new("failUnfail").unwrap();
+        remove_subgraphs();
+        create_test_subgraph(&id, SUBGRAPH_GQL).await
+    }
+
+    run_test_sequentially(|store| async move {
+        let deployment = setup().await;
+        let query_store = store
+            .query_store(
+                QueryTarget::Deployment(deployment.hash.clone(), Default::default()),
+                false,
+            )
+            .await
+            .unwrap();
+
+        // Just to make latest_ethereum_block_number be 0
+        transact_and_wait(
+            &store.subgraph_store(),
+            &deployment,
+            BLOCKS[0].clone(),
+            vec![],
+        )
+        .await
+        .unwrap();
+
+        let error = || SubgraphError {
+            subgraph_id: deployment.hash.clone(),
+            message: "test".to_string(),
+            block_ptr: Some(BLOCKS[1].clone()),
+            handler: None,
+            deterministic: true,
+        };
+
+        store
+            .subgraph_store()
+            .writable(LOGGER.clone(), deployment.id)
+            .await
+            .expect("can get writable")
+            .fail_subgraph(error())
+            .await
+            .unwrap();
+
+        assert!(!query_store
+            .has_deterministic_errors(latest_block(&store, deployment.id).await.number)
+            .await
+            .unwrap());
+
+        transact_errors(&store, &deployment, BLOCKS[1].clone(), vec![error()])
+            .await
+            .unwrap();
+
+        assert!(query_store
+            .has_deterministic_errors(latest_block(&store, deployment.id).await.number)
+            .await
+            .unwrap());
+    })
+}
+
+#[test]
+fn fail_unfail_deterministic_error() {
+    const NAME: &str = "failUnfailDeterministic";
+
+    async fn setup() -> DeploymentLocator {
+        let id = DeploymentHash::new(NAME).unwrap();
+        remove_subgraphs();
+        create_test_subgraph(&id, SUBGRAPH_GQL).await
+    }
+
+    run_test_sequentially(|store| async move {
+        let deployment = setup().await;
+
+        let query_store = store
+            .query_store(
+                QueryTarget::Deployment(deployment.hash.clone(), Default::default()),
+                false,
+            )
+            .await
+            .unwrap();
+
+        // Process the first block.
+        transact_and_wait(
+            &store.subgraph_store(),
+            &deployment,
+            BLOCKS[0].clone(),
+            vec![],
+        )
+        .await
+        .unwrap();
+
+        // We don't have any errors and the subgraph is healthy.
+        assert!(!query_store
+            .has_deterministic_errors(latest_block(&store, deployment.id).await.number)
+            .await
+            .unwrap());
+        let vi = get_version_info(&store, NAME);
+        assert_eq!(&*NAME, vi.deployment_id.as_str());
+        assert_eq!(false, vi.failed);
+        assert_eq!(Some(0), vi.latest_ethereum_block_number);
+
+        // Process the second block.
+        transact_and_wait(
+            &store.subgraph_store(),
+            &deployment,
+            BLOCKS[1].clone(),
+            vec![],
+        )
+        .await
+        .unwrap();
+
+        // Still no fatal errors.
+        assert!(!query_store
+            .has_deterministic_errors(latest_block(&store, deployment.id).await.number)
+            .await
+            .unwrap());
+        let vi = get_version_info(&store, NAME);
+        assert_eq!(&*NAME, vi.deployment_id.as_str());
+        assert_eq!(false, vi.failed);
+        assert_eq!(Some(1), vi.latest_ethereum_block_number);
+
+        let error = SubgraphError {
+            subgraph_id: deployment.hash.clone(),
+            message: "test".to_string(),
+            block_ptr: Some(BLOCKS[1].clone()),
+            handler: None,
+            deterministic: true,
+        };
+
+        let writable = store
+            .subgraph_store()
+            .writable(LOGGER.clone(), deployment.id)
+            .await
+            .expect("can get writable");
+
+        // Fail the subgraph with a deterministic error.
+        writable.fail_subgraph(error).await.unwrap();
+
+        // Now we have a fatal error because the subgraph failed.
+        assert!(query_store
+            .has_deterministic_errors(latest_block(&store, deployment.id).await.number)
+            .await
+            .unwrap());
+        let vi = get_version_info(&store, NAME);
+        assert_eq!(&*NAME, vi.deployment_id.as_str());
+        assert_eq!(true, vi.failed);
+        assert_eq!(Some(1), vi.latest_ethereum_block_number);
+
+        // Unfail the subgraph.
+        let outcome = writable
+            .unfail_deterministic_error(&BLOCKS[1], &BLOCKS[0])
+            .await
+            .unwrap();
+
+        // We don't have fatal errors anymore and the block got reverted.
+        assert_eq!(outcome, UnfailOutcome::Unfailed);
+        assert!(!query_store
+            .has_deterministic_errors(latest_block(&store, deployment.id).await.number)
+            .await
+            .unwrap());
+        let vi = get_version_info(&store, NAME);
+        assert_eq!(&*NAME, vi.deployment_id.as_str());
+        assert_eq!(false, vi.failed);
+        assert_eq!(Some(0), vi.latest_ethereum_block_number);
+
+        test_store::remove_subgraphs();
+    })
+}
+
+#[test]
+fn fail_unfail_deterministic_error_noop() {
+    const NAME: &str = "failUnfailDeterministicNoop";
+
+    async fn setup() -> DeploymentLocator {
+        let id = DeploymentHash::new(NAME).unwrap();
+        remove_subgraphs();
+        create_test_subgraph(&id, SUBGRAPH_GQL).await
+    }
+
+    run_test_sequentially(|store| async move {
+        let deployment = setup().await;
+
+        let count = || -> usize {
+            let store = store.subgraph_store();
+            store.error_count(&deployment.hash).unwrap()
+        };
+
+        // Process the first block.
+        transact_and_wait(
+            &store.subgraph_store(),
+            &deployment,
+            BLOCKS[0].clone(),
+            vec![],
+        )
+        .await
+        .unwrap();
+
+        // We don't have any errors and the subgraph is healthy.
+        assert_eq!(count(), 0);
+        let vi = get_version_info(&store, NAME);
+        assert_eq!(&*NAME, vi.deployment_id.as_str());
+        assert_eq!(false, vi.failed);
+        assert_eq!(Some(0), vi.latest_ethereum_block_number);
+
+        // Process the second block.
+        transact_and_wait(
+            &store.subgraph_store(),
+            &deployment,
+            BLOCKS[1].clone(),
+            vec![],
+        )
+        .await
+        .unwrap();
+
+        // Still no fatal errors.
+        assert_eq!(count(), 0);
+        let vi = get_version_info(&store, NAME);
+        assert_eq!(&*NAME, vi.deployment_id.as_str());
+        assert_eq!(false, vi.failed);
+        assert_eq!(Some(1), vi.latest_ethereum_block_number);
+
+        let writable = store
+            .subgraph_store()
+            .writable(LOGGER.clone(), deployment.id)
+            .await
+            .expect("can get writable");
+
+        // Run unfail with no errors results in NOOP.
+        let outcome = writable
+            .unfail_deterministic_error(&BLOCKS[1], &BLOCKS[0])
+            .await
+            .unwrap();
+
+        // Nothing to unfail, state continues the same.
+        assert_eq!(outcome, UnfailOutcome::Noop);
+        assert_eq!(count(), 0);
+        let vi = get_version_info(&store, NAME);
+        assert_eq!(&*NAME, vi.deployment_id.as_str());
+        assert_eq!(false, vi.failed);
+        assert_eq!(Some(1), vi.latest_ethereum_block_number);
+
+        let error = SubgraphError {
+            subgraph_id: deployment.hash.clone(),
+            message: "test".to_string(),
+            block_ptr: Some(BLOCKS[1].clone()),
+            handler: None,
+            deterministic: false, // wrong determinism
+        };
+
+        // Fail the subraph with a NON-deterministic error.
+        writable.fail_subgraph(error).await.unwrap();
+
+        // Now we have a fatal error because the subgraph failed.
+        assert_eq!(count(), 1);
+        let vi = get_version_info(&store, NAME);
+        assert_eq!(&*NAME, vi.deployment_id.as_str());
+        assert_eq!(true, vi.failed);
+        assert_eq!(Some(1), vi.latest_ethereum_block_number);
+
+        // Running unfail_deterministic_error against a NON-deterministic error will do nothing.
+        let outcome = writable
+            .unfail_deterministic_error(&BLOCKS[1], &BLOCKS[0])
+            .await
+            .unwrap();
+
+        // State continues the same, nothing happened.
+        // Neither the block got reverted or error deleted.
+        assert_eq!(outcome, UnfailOutcome::Noop);
+        assert_eq!(count(), 1);
+        let vi = get_version_info(&store, NAME);
+        assert_eq!(&*NAME, vi.deployment_id.as_str());
+        assert_eq!(true, vi.failed);
+        assert_eq!(Some(1), vi.latest_ethereum_block_number);
+
+        let error = SubgraphError {
+            subgraph_id: deployment.hash.clone(),
+            message: "test".to_string(),
+            block_ptr: Some(BLOCKS[2].clone()), // wrong block
+            handler: None,
+            deterministic: true, // right determinism
+        };
+
+        // Fail the subgraph with an advanced block.
+        writable.fail_subgraph(error).await.unwrap();
+
+        // Running unfail_deterministic_error won't do anything,
+        // the hashes won't match and there's nothing to revert.
+        let outcome = writable
+            .unfail_deterministic_error(&BLOCKS[1], &BLOCKS[0])
+            .await
+            .unwrap();
+
+        // State continues the same.
+        // Neither the block got reverted or error deleted.
+        assert_eq!(outcome, UnfailOutcome::Noop);
+        assert_eq!(count(), 2);
+        let vi = get_version_info(&store, NAME);
+        assert_eq!(&*NAME, vi.deployment_id.as_str());
+        assert_eq!(true, vi.failed);
+        assert_eq!(Some(1), vi.latest_ethereum_block_number);
+
+        test_store::remove_subgraphs();
+    })
+}
+
+#[test]
+fn fail_unfail_non_deterministic_error() {
+    const NAME: &str = "failUnfailNonDeterministic";
+
+    async fn setup() -> DeploymentLocator {
+        let id = DeploymentHash::new(NAME).unwrap();
+        remove_subgraphs();
+        create_test_subgraph(&id, SUBGRAPH_GQL).await
+    }
+
+    run_test_sequentially(|store| async move {
+        let deployment = setup().await;
+
+        let count = || -> usize {
+            let store = store.subgraph_store();
+            store.error_count(&deployment.hash).unwrap()
+        };
+
+        // Process the first block.
+        transact_and_wait(
+            &store.subgraph_store(),
+            &deployment,
+            BLOCKS[0].clone(),
+            vec![],
+        )
+        .await
+        .unwrap();
+
+        // We don't have any errors.
+        assert_eq!(count(), 0);
+        let vi = get_version_info(&store, NAME);
+        assert_eq!(&*NAME, vi.deployment_id.as_str());
+        assert_eq!(false, vi.failed);
+        assert_eq!(Some(0), vi.latest_ethereum_block_number);
+
+        let error = SubgraphError {
+            subgraph_id: deployment.hash.clone(),
+            message: "test".to_string(),
+            block_ptr: Some(BLOCKS[1].clone()),
+            handler: None,
+            deterministic: false,
+        };
+
+        let writable = store
+            .subgraph_store()
+            .writable(LOGGER.clone(), deployment.id)
+            .await
+            .expect("can get writable");
+
+        // Fail subgraph with a non-deterministic error.
+        writable.fail_subgraph(error).await.unwrap();
+
+        // Now we have a fatal error because the subgraph failed.
+        assert_eq!(count(), 1);
+        let vi = get_version_info(&store, NAME);
+        assert_eq!(&*NAME, vi.deployment_id.as_str());
+        assert_eq!(true, vi.failed);
+        assert_eq!(Some(0), vi.latest_ethereum_block_number);
+
+        // Process the second block.
+        transact_and_wait(
+            &store.subgraph_store(),
+            &deployment,
+            BLOCKS[1].clone(),
+            vec![],
+        )
+        .await
+        .unwrap();
+
+        // Subgraph failed but it's deployment head pointer advanced.
+        assert_eq!(count(), 1);
+        let vi = get_version_info(&store, NAME);
+        assert_eq!(&*NAME, vi.deployment_id.as_str());
+        assert_eq!(true, vi.failed);
+        assert_eq!(Some(1), vi.latest_ethereum_block_number);
+
+        // Unfail the subgraph and delete the fatal error.
+        let outcome = writable.unfail_non_deterministic_error(&BLOCKS[1]).unwrap();
+
+        // We don't have fatal errors anymore and the subgraph is healthy.
+        assert_eq!(outcome, UnfailOutcome::Unfailed);
+        assert_eq!(count(), 0);
+        let vi = get_version_info(&store, NAME);
+        assert_eq!(&*NAME, vi.deployment_id.as_str());
+        assert_eq!(false, vi.failed);
+        assert_eq!(Some(1), vi.latest_ethereum_block_number);
+
+        test_store::remove_subgraphs();
+    })
+}
+
+#[test]
+fn fail_unfail_non_deterministic_error_noop() {
+    const NAME: &str = "failUnfailNonDeterministicNoop";
+
+    async fn setup() -> DeploymentLocator {
+        let id = DeploymentHash::new(NAME).unwrap();
+        remove_subgraphs();
+        create_test_subgraph(&id, SUBGRAPH_GQL).await
+    }
+
+    run_test_sequentially(|store| async move {
+        let deployment = setup().await;
+
+        let count = || -> usize {
+            let store = store.subgraph_store();
+            store.error_count(&deployment.hash).unwrap()
+        };
+
+        // Process the first block.
+        transact_and_wait(
+            &store.subgraph_store(),
+            &deployment,
+            BLOCKS[0].clone(),
+            vec![],
+        )
+        .await
+        .unwrap();
+
+        // We don't have any errors and the subgraph is healthy.
+        assert_eq!(count(), 0);
+        let vi = get_version_info(&store, NAME);
+        assert_eq!(&*NAME, vi.deployment_id.as_str());
+        assert_eq!(false, vi.failed);
+        assert_eq!(Some(0), vi.latest_ethereum_block_number);
+
+        // Process the second block.
+        transact_and_wait(
+            &store.subgraph_store(),
+            &deployment,
+            BLOCKS[1].clone(),
+            vec![],
+        )
+        .await
+        .unwrap();
+
+        // Still no errors.
+        assert_eq!(count(), 0);
+        let vi = get_version_info(&store, NAME);
+        assert_eq!(&*NAME, vi.deployment_id.as_str());
+        assert_eq!(false, vi.failed);
+        assert_eq!(Some(1), vi.latest_ethereum_block_number);
+
+        let writable = store
+            .subgraph_store()
+            .writable(LOGGER.clone(), deployment.id)
+            .await
+            .expect("can get writable");
+
+        // Running unfail without any errors will do nothing.
+        let outcome = writable.unfail_non_deterministic_error(&BLOCKS[1]).unwrap();
+
+        // State continues the same, nothing happened.
+        assert_eq!(outcome, UnfailOutcome::Noop);
+        assert_eq!(count(), 0);
+        let vi = get_version_info(&store, NAME);
+        assert_eq!(&*NAME, vi.deployment_id.as_str());
+        assert_eq!(false, vi.failed);
+        assert_eq!(Some(1), vi.latest_ethereum_block_number);
+
+        let error = SubgraphError {
+            subgraph_id: deployment.hash.clone(),
+            message: "test".to_string(),
+            block_ptr: Some(BLOCKS[1].clone()),
+            handler: None,
+            deterministic: true, // wrong determinism
+        };
+
+        // Fail the subgraph with a DETERMININISTIC error.
+        writable.fail_subgraph(error).await.unwrap();
+
+        // We now have a fatal error because the subgraph failed.
+        assert_eq!(count(), 1);
+        let vi = get_version_info(&store, NAME);
+        assert_eq!(&*NAME, vi.deployment_id.as_str());
+        assert_eq!(true, vi.failed);
+        assert_eq!(Some(1), vi.latest_ethereum_block_number);
+
+        // Running unfail_non_deterministic_error will be NOOP, the error is deterministic.
+        let outcome = writable.unfail_non_deterministic_error(&BLOCKS[1]).unwrap();
+
+        // Nothing happeened, state continues the same.
+        assert_eq!(outcome, UnfailOutcome::Noop);
+        assert_eq!(count(), 1);
+        let vi = get_version_info(&store, NAME);
+        assert_eq!(&*NAME, vi.deployment_id.as_str());
+        assert_eq!(true, vi.failed);
+        assert_eq!(Some(1), vi.latest_ethereum_block_number);
+
+        let error = SubgraphError {
+            subgraph_id: deployment.hash.clone(),
+            message: "test".to_string(),
+            block_ptr: Some(BLOCKS[2].clone()), // wrong block
+            handler: None,
+            deterministic: false, // right determinism
+        };
+
+        // Fail the subgraph with a non-deterministic error, but with an advanced block.
+        writable.fail_subgraph(error).await.unwrap();
+
+        // Since the block range of the block won't match the deployment head, this will be NOOP.
+        let outcome = writable.unfail_non_deterministic_error(&BLOCKS[1]).unwrap();
+
+        // State continues the same besides a new error added to the database.
+        assert_eq!(outcome, UnfailOutcome::Noop);
+        assert_eq!(count(), 2);
+        let vi = get_version_info(&store, NAME);
+        assert_eq!(&*NAME, vi.deployment_id.as_str());
+        assert_eq!(true, vi.failed);
+        assert_eq!(Some(1), vi.latest_ethereum_block_number);
+
+        test_store::remove_subgraphs();
+    })
+}
diff --git a/store/postgres/tests/writable.rs b/store/postgres/tests/writable.rs
new file mode 100644
index 0000000..25e9711
--- /dev/null
+++ b/store/postgres/tests/writable.rs
@@ -0,0 +1,163 @@
+use graph::blockchain::block_stream::FirehoseCursor;
+use graph::data::subgraph::schema::DeploymentCreate;
+use lazy_static::lazy_static;
+use std::marker::PhantomData;
+use test_store::*;
+
+use graph::components::store::{DeploymentLocator, EntityKey, WritableStore};
+use graph::data::subgraph::*;
+use graph::prelude::*;
+use graph::semver::Version;
+use graph_store_postgres::layout_for_tests::writable;
+use graph_store_postgres::{Store as DieselStore, SubgraphStore as DieselSubgraphStore};
+use web3::types::H256;
+
+const SCHEMA_GQL: &str = "
+    type Counter @entity {
+        id: ID!,
+        count: Int,
+    }
+";
+
+const COUNTER: &str = "Counter";
+
+lazy_static! {
+    static ref TEST_SUBGRAPH_ID_STRING: String = String::from("writableSubgraph");
+    static ref TEST_SUBGRAPH_ID: DeploymentHash =
+        DeploymentHash::new(TEST_SUBGRAPH_ID_STRING.as_str()).unwrap();
+    static ref TEST_SUBGRAPH_SCHEMA: Schema =
+        Schema::parse(SCHEMA_GQL, TEST_SUBGRAPH_ID.clone()).expect("Failed to parse user schema");
+}
+
+/// Inserts test data into the store.
+///
+/// Create a new empty subgraph with schema `SCHEMA_GQL`
+async fn insert_test_data(store: Arc<DieselSubgraphStore>) -> DeploymentLocator {
+    let manifest = SubgraphManifest::<graph_chain_ethereum::Chain> {
+        id: TEST_SUBGRAPH_ID.clone(),
+        spec_version: Version::new(1, 0, 0),
+        features: Default::default(),
+        description: None,
+        repository: None,
+        schema: TEST_SUBGRAPH_SCHEMA.clone(),
+        data_sources: vec![],
+        graft: None,
+        templates: vec![],
+        chain: PhantomData,
+    };
+
+    // Create SubgraphDeploymentEntity
+    let deployment = DeploymentCreate::new(&manifest, None);
+    let name = SubgraphName::new("test/writable").unwrap();
+    let node_id = NodeId::new("test").unwrap();
+    let deployment = store
+        .create_subgraph_deployment(
+            name,
+            &TEST_SUBGRAPH_SCHEMA,
+            deployment,
+            node_id,
+            NETWORK_NAME.to_string(),
+            SubgraphVersionSwitchingMode::Instant,
+        )
+        .unwrap();
+    deployment
+}
+
+/// Removes test data from the database behind the store.
+fn remove_test_data(store: Arc<DieselSubgraphStore>) {
+    store
+        .delete_all_entities_for_test_use_only()
+        .expect("deleting test entities succeeds");
+}
+
+/// Test harness for running database integration tests.
+fn run_test<R, F>(test: F)
+where
+    F: FnOnce(Arc<DieselStore>, Arc<dyn WritableStore>, DeploymentLocator) -> R + Send + 'static,
+    R: std::future::Future<Output = ()> + Send + 'static,
+{
+    run_test_sequentially(|store| async move {
+        let subgraph_store = store.subgraph_store();
+        // Reset state before starting
+        remove_test_data(subgraph_store.clone());
+
+        // Seed database with test data
+        let deployment = insert_test_data(subgraph_store.clone()).await;
+        let writable = store
+            .subgraph_store()
+            .writable(LOGGER.clone(), deployment.id)
+            .await
+            .expect("we can get a writable store");
+
+        // Run test and wait for the background writer to finish its work so
+        // it won't conflict with the next test
+        test(store, writable.clone(), deployment).await;
+        writable.flush().await.unwrap();
+    });
+}
+
+fn block_pointer(number: u8) -> BlockPtr {
+    let hash = H256::from([number; 32]);
+    BlockPtr::from((hash, number as BlockNumber))
+}
+
+fn count_key(id: &str) -> EntityKey {
+    EntityKey::data(COUNTER.to_owned(), id.to_owned())
+}
+
+async fn insert_count(store: &Arc<DieselSubgraphStore>, deployment: &DeploymentLocator, count: u8) {
+    let data = entity! {
+        id: "1",
+        count: count as i32
+    };
+    let entity_op = EntityOperation::Set {
+        key: count_key(&data.get("id").unwrap().to_string()),
+        data,
+    };
+    transact_entity_operations(store, deployment, block_pointer(count), vec![entity_op])
+        .await
+        .unwrap();
+}
+
+async fn pause_writer(deployment: &DeploymentLocator) {
+    flush(&deployment).await.unwrap();
+    writable::allow_steps(0).await;
+}
+
+async fn resume_writer(deployment: &DeploymentLocator, steps: usize) {
+    writable::allow_steps(steps).await;
+    flush(&deployment).await.unwrap();
+}
+
+#[test]
+fn tracker() {
+    run_test(|store, writable, deployment| async move {
+        let subgraph_store = store.subgraph_store();
+
+        let read_count = || {
+            let counter = writable.get(&count_key("1")).unwrap().unwrap();
+            counter.get("count").unwrap().as_int().unwrap()
+        };
+        for count in 1..4 {
+            insert_count(&subgraph_store, &deployment, count).await;
+        }
+        pause_writer(&deployment).await;
+
+        // Test reading back with a pending write
+        insert_count(&subgraph_store, &deployment, 4).await;
+        assert_eq!(4, read_count());
+        resume_writer(&deployment, 1).await;
+        assert_eq!(4, read_count());
+
+        // Test reading back with a pending revert
+        writable
+            .revert_block_operations(block_pointer(2), FirehoseCursor::None)
+            .await
+            .unwrap();
+
+        assert_eq!(2, read_count());
+
+        resume_writer(&deployment, 1).await;
+        assert_eq!(2, read_count());
+    })
+}
diff --git a/store/test-store/Cargo.toml b/store/test-store/Cargo.toml
new file mode 100644
index 0000000..de9dbe6
--- /dev/null
+++ b/store/test-store/Cargo.toml
@@ -0,0 +1,18 @@
+[package]
+name = "test-store"
+version = "0.27.0"
+authors = ["Leonardo Yvens <leoyvens@gmail.com>"]
+edition = "2021"
+description = "Provides static store instance for tests."
+
+[dependencies]
+graph-graphql = { path = "../../graphql" }
+graphql-parser = "0.4.0"
+graph-mock = { path = "../../mock" }
+graph-node = { path = "../../node" }
+graph = { path = "../../graph" }
+graph-store-postgres = { path = "../postgres" }
+lazy_static = "1.1"
+hex-literal = "0.3"
+diesel = { version = "1.4.8", features = ["postgres", "serde_json", "numeric", "r2d2"] }
+serde = "1.0"
diff --git a/store/test-store/README.md b/store/test-store/README.md
new file mode 100644
index 0000000..d4ed005
--- /dev/null
+++ b/store/test-store/README.md
@@ -0,0 +1,87 @@
+# Setting up for running tests
+
+This document describes what needs to be done to run tests against a
+Postgres database.
+
+## Initial setup
+
+### Docker Compose
+
+We provide inside the [devel](./devel) directory a Docker Compose manifest that is preconfigured to
+launch the required test dependencies.
+
+To ease the required folder creation on disk, we provide a small script called [devel/up.sh](./devel/up.sh)
+that creates the necessary data folder(s) and launch `docker-compose up`.
+
+To launch Postgres and IPFS server, simply do
+
+```shell
+./store/test-store/devel/up.sh
+```
+
+- **Note** By default, `up.sh` re-uses existing data on disk if present, use `./store/test-store/devel/up.sh -c` to clean
+any previous data before starting the dependencies.
+
+Give a 1 minute for all dependencies to properly starts correctly, then jump to [Running tests](#running-tests).
+
+#### Resetting the test databases
+
+Simply tear down the docker compose process and run `./devel/up.sh` again, this will start back fresh.
+
+### Manual
+
+Before starting, you will need to set up a database user `graph` and give
+it the password `graph` by running `createuser -W graph`.
+
+You also need to arrange for `psql` and similar tools to connect to
+Postgres automatically as the `postgres` user.
+
+For that, add this line as the first non-comment line to
+`$PGDATA/pg_hba.conf`:
+```
+local   all             postgres                                peer map=admin
+```
+
+and add these lines to `data/pg_ident.conf`:
+```
+admin           postgres                postgres
+admin           <your username>         postgres
+```
+
+You might also want to set `log_statement = 'all'` to
+`$PGDATA/postgresql.conf`. That will cause Postgres to log all SQL
+statements that the tests send it which can sometimes be very helpful when
+tests fail.
+
+After making all these changes, restart Postgres to make sure it actually
+uses these settings, then jump to [Running tests](#running-tests).
+
+#### Resetting the test databases
+
+The script `db-reset` will (re)create databases in the test cluster. This
+script can be used to remove old databases and/or broken databases schemas
+and cause `cargo test` to create the schema from scratch on the next test
+run.
+
+Note that `db-reset` will completely delete the databases `graph-test` and
+`graph-sgd` in the databases cluster that a plain invocation of `psql`
+connects to.
+
+## Running tests
+
+Before running tests set the environment variable `GRAPH_NODE_TEST_CONFIG`
+to point either at `config.simple.toml` or `config.sharded.toml`.
+
+```shell
+GRAPH_NODE_TEST_CONFIG=`pwd`/store/test-store/config.simple.toml cargo test --workspace --exclude graph-tests
+```
+
+- **Note** You can use either `config.simple.toml` or `config.sharded.toml`.
+
+This will run all unit and integration tests. The `graph-tests` crate contains more
+extensive integration tests that depend on running docker containers; that
+setup is outside the scope of the document, and we therefore exclude them
+from running for basic usage.
+
+When you switch from one of the test configurations to another, you will
+need to clean out the test databases by running `db-reset`.
diff --git a/store/test-store/config.sharded.toml b/store/test-store/config.sharded.toml
new file mode 100644
index 0000000..e351d21
--- /dev/null
+++ b/store/test-store/config.sharded.toml
@@ -0,0 +1,35 @@
+# A sharded setup that uses two databases
+[store]
+[store.primary]
+connection = "postgresql://graph:graph@127.0.0.1:5432/graph-test"
+pool_size = [ { size = 10 } ]
+[store.sgd]
+connection = "postgresql://graph:graph@127.0.0.1:5432/graph-sgd"
+pool_size = [ { size = 10 } ]
+
+[deployment]
+[[deployment.rule]]
+match = { name = "abi.*|grafted" }
+shard="primary"
+indexers = [ "default" ]
+
+[[deployment.rule]]
+shard = "sgd"
+indexers = [ "default" ]
+
+[chains]
+ingestor = "default"
+
+# The tests do not talk to ethereum clients; we use valid free client
+# endpoints as an example
+[chains.fake_network]
+shard = "sgd"
+provider = [
+  { label = "penguin", url="https://main-light.eth.linkpool.io/", features = [] }
+]
+
+[chains.fake_network_shared]
+shard = "sgd"
+provider = [
+  { label = "owl", url="https://rinkeby-light.eth.linkpool.io/", features = [] }
+]
diff --git a/store/test-store/config.simple.toml b/store/test-store/config.simple.toml
new file mode 100644
index 0000000..ba65033
--- /dev/null
+++ b/store/test-store/config.simple.toml
@@ -0,0 +1,30 @@
+# A simple store configuration: we use one database for everything
+# This is equivalent to the old way of configuring the store for tests
+# by just setting the environment variable THEGRAPH_STORE_POSTGRES_DIESEL_URL
+
+[store]
+[store.primary]
+connection = "postgresql://graph:graph@127.0.0.1:5432/graph-test"
+pool_size = 10
+
+[deployment]
+[[deployment.rule]]
+store = "primary"
+indexers = [ "default" ]
+
+[chains]
+ingestor = "default"
+
+# The tests do not talk to ethereum clients; we use valid free client
+# endpoints as an example
+[chains.fake_network]
+shard = "primary"
+provider = [
+  { label = "penguin", url="https://main-light.eth.linkpool.io/", features = [] }
+]
+
+[chains.fake_network_shared]
+shard = "primary"
+provider = [
+  { label = "owl", url="https://rinkeby-light.eth.linkpool.io/", features = [] }
+]
diff --git a/store/test-store/db-reset b/store/test-store/db-reset
new file mode 100755
index 0000000..56cb1d5
--- /dev/null
+++ b/store/test-store/db-reset
@@ -0,0 +1,18 @@
+#! /bin/bash
+
+resetdb() {
+    host=$(hostname -s)
+    db=$1
+    echo "Reset $db"
+    dropdb $db && createdb -O graph $db
+    psql -q -X $db <<EOF
+create extension pg_trgm;
+create extension pg_stat_statements;
+create extension btree_gist;
+create extension postgres_fdw;
+grant usage on foreign data wrapper postgres_fdw to graph;
+EOF
+}
+
+resetdb graph-test
+resetdb graph-sgd
diff --git a/store/test-store/devel/.gitignore b/store/test-store/devel/.gitignore
new file mode 100644
index 0000000..249cda9
--- /dev/null
+++ b/store/test-store/devel/.gitignore
@@ -0,0 +1 @@
+/data
\ No newline at end of file
diff --git a/store/test-store/devel/docker-compose.yml b/store/test-store/devel/docker-compose.yml
new file mode 100644
index 0000000..5a7d12c
--- /dev/null
+++ b/store/test-store/devel/docker-compose.yml
@@ -0,0 +1,20 @@
+version: '3'
+services:
+  ipfs:
+    image: ipfs/go-ipfs:v0.10.0
+    ports:
+      - '5001:5001'
+    volumes:
+      - ./data/ipfs:/data/ipfs
+  postgres:
+    image: postgres
+    ports:
+      - '5432:5432'
+    command: ["postgres", "-cshared_preload_libraries=pg_stat_statements", "-clog_statement=all"]
+    environment:
+      POSTGRES_USER: graph-node
+      POSTGRES_PASSWORD: let-me-in
+      POSTGRES_DB: graph-node
+    volumes:
+      - ./data/postgres:/var/lib/postgresql/data
+      - ./initdb.d:/docker-entrypoint-initdb.d
diff --git a/store/test-store/devel/initdb.d/init-db.sh b/store/test-store/devel/initdb.d/init-db.sh
new file mode 100755
index 0000000..2f93e93
--- /dev/null
+++ b/store/test-store/devel/initdb.d/init-db.sh
@@ -0,0 +1,14 @@
+#!/bin/bash
+set -e
+
+psql -v ON_ERROR_STOP=1 --username "$POSTGRES_USER" --dbname "$POSTGRES_DB" <<-EOSQL
+    CREATE USER graph WITH ENCRYPTED PASSWORD 'graph';
+
+    CREATE DATABASE "graph-sgd";
+    CREATE DATABASE "graph-test";
+
+    GRANT ALL PRIVILEGES ON DATABASE "graph-sgd" TO graph;
+    GRANT ALL PRIVILEGES ON DATABASE "graph-test" TO graph;
+
+    ALTER ROLE graph SUPERUSER;
+EOSQL
\ No newline at end of file
diff --git a/store/test-store/devel/up.sh b/store/test-store/devel/up.sh
new file mode 100755
index 0000000..da39539
--- /dev/null
+++ b/store/test-store/devel/up.sh
@@ -0,0 +1,58 @@
+#!/usr/bin/env bash
+
+set -e
+
+ROOT="$( cd "$( dirname "${BASH_SOURCE[0]}" )" && pwd )"
+
+clean=
+
+main() {
+  pushd "$ROOT" &> /dev/null
+
+  while getopts "hc" opt; do
+    case $opt in
+      h) usage && exit 0;;
+      c) clean=true;;
+      \?) usage_error "Invalid option: -$OPTARG";;
+    esac
+  done
+  shift $((OPTIND-1))
+
+  if [[ -d "./data" && $clean == true ]]; then
+    echo "Cleaning data directory"
+    rm -rf ./data 1> /dev/null
+  fi
+
+  prepare
+
+  # Pass execution to docker compose
+  exec docker-compose up
+}
+
+prepare() {
+  mkdir -p ./data/ipfs 1> /dev/null
+  mkdir -p ./data/postgres 1> /dev/null
+}
+
+usage_error() {
+  message="$1"
+  exit_code="$2"
+
+  echo "ERROR: $message"
+  echo ""
+  usage
+  exit ${exit_code:-1}
+}
+
+usage() {
+  echo "usage: up [-c]"
+  echo ""
+  echo "Setup required files layout and launch 'docker compose up'"
+  echo "spinning up all required development dependencies."
+  echo ""
+  echo "Options"
+  echo "    -c          Clean 'data' directory before launching dependencies"
+  echo "    -h          Display help about this script"
+}
+
+main "$@"
\ No newline at end of file
diff --git a/store/test-store/src/block_store.rs b/store/test-store/src/block_store.rs
new file mode 100644
index 0000000..dafb2ae
--- /dev/null
+++ b/store/test-store/src/block_store.rs
@@ -0,0 +1,150 @@
+use std::{convert::TryFrom, str::FromStr, sync::Arc};
+
+use lazy_static::lazy_static;
+
+use graph::components::store::BlockStore;
+use graph::{
+    blockchain::Block,
+    prelude::{
+        serde_json, web3::types::H256, web3::types::U256, BlockHash, BlockNumber, BlockPtr,
+        EthereumBlock, LightEthereumBlock,
+    },
+};
+
+lazy_static! {
+    // Genesis block
+    pub static ref GENESIS_BLOCK: FakeBlock = FakeBlock {
+        number: super::GENESIS_PTR.number,
+        hash: super::GENESIS_PTR.hash_hex(),
+        timestamp: None,
+        parent_hash: NO_PARENT.to_string()
+    };
+    pub static ref BLOCK_ONE: FakeBlock = GENESIS_BLOCK
+        .make_child("8511fa04b64657581e3f00e14543c1d522d5d7e771b54aa3060b662ade47da13", None);
+    pub static ref BLOCK_ONE_SIBLING: FakeBlock =
+        GENESIS_BLOCK.make_child("b98fb783b49de5652097a989414c767824dff7e7fd765a63b493772511db81c1", None);
+    pub static ref BLOCK_ONE_NO_PARENT: FakeBlock = FakeBlock::make_no_parent(
+        1,
+        "7205bdfcf4521874cf38ce38c879ff967bf3a069941286bfe267109ad275a63d"
+    );
+
+    pub static ref BLOCK_TWO: FakeBlock = BLOCK_ONE.make_child("f8ccbd3877eb98c958614f395dd351211afb9abba187bfc1fb4ac414b099c4a6", None);
+    pub static ref BLOCK_TWO_NO_PARENT: FakeBlock = FakeBlock::make_no_parent(2, "3b652b00bff5e168b1218ff47593d516123261c4487629c4175f642ee56113fe");
+    pub static ref BLOCK_THREE: FakeBlock = BLOCK_TWO.make_child("7347afe69254df06729e123610b00b8b11f15cfae3241f9366fb113aec07489c", None);
+    pub static ref BLOCK_THREE_NO_PARENT: FakeBlock = FakeBlock::make_no_parent(3, "fa9ebe3f74de4c56908b49f5c4044e85825f7350f3fa08a19151de82a82a7313");
+    pub static ref BLOCK_THREE_TIMESTAMP: FakeBlock = BLOCK_TWO.make_child("6b834521bb753c132fdcf0e1034803ed9068e324112f8750ba93580b393a986b", Some(U256::from(1657712166)));
+    // This block is special and serializes in a slightly different way, this is needed to simulate non-ethereum behaviour at the store level. If you're not sure
+    // what you are doing, don't use this block for other tests.
+    pub static ref BLOCK_THREE_NO_TIMESTAMP: FakeBlock = BLOCK_TWO.make_child("6b834521bb753c132fdcf0e1034803ed9068e324112f8750ba93580b393a986b", None);
+    pub static ref BLOCK_FOUR: FakeBlock = BLOCK_THREE.make_child("7cce080f5a49c2997a6cc65fc1cee9910fd8fc3721b7010c0b5d0873e2ac785e", None);
+    pub static ref BLOCK_FIVE: FakeBlock = BLOCK_FOUR.make_child("7b0ea919e258eb2b119eb32de56b85d12d50ac6a9f7c5909f843d6172c8ba196", None);
+    pub static ref BLOCK_SIX_NO_PARENT: FakeBlock = FakeBlock::make_no_parent(6, "6b834521bb753c132fdcf0e1034803ed9068e324112f8750ba93580b393a986b");
+}
+
+// Hash indicating 'no parent'
+pub const NO_PARENT: &str = "0000000000000000000000000000000000000000000000000000000000000000";
+/// The parts of an Ethereum block that are interesting for these tests:
+/// the block number, hash, and the hash of the parent block
+#[derive(Clone, Debug, PartialEq)]
+pub struct FakeBlock {
+    pub number: BlockNumber,
+    pub hash: String,
+    pub parent_hash: String,
+    pub timestamp: Option<U256>,
+}
+
+impl FakeBlock {
+    pub fn make_child(&self, hash: &str, timestamp: Option<U256>) -> Self {
+        FakeBlock {
+            number: self.number + 1,
+            hash: hash.to_owned(),
+            parent_hash: self.hash.clone(),
+            timestamp,
+        }
+    }
+
+    pub fn make_no_parent(number: BlockNumber, hash: &str) -> Self {
+        FakeBlock {
+            number,
+            hash: hash.to_owned(),
+            parent_hash: NO_PARENT.to_string(),
+            timestamp: None,
+        }
+    }
+
+    pub fn block_hash(&self) -> BlockHash {
+        BlockHash::from_str(self.hash.as_str()).expect("invalid block hash")
+    }
+
+    pub fn block_ptr(&self) -> BlockPtr {
+        BlockPtr::new(self.block_hash(), self.number)
+    }
+
+    pub fn as_ethereum_block(&self) -> EthereumBlock {
+        let parent_hash = H256::from_str(self.parent_hash.as_str()).expect("invalid parent hash");
+
+        let mut block = LightEthereumBlock::default();
+        block.number = Some(self.number.into());
+        block.parent_hash = parent_hash;
+        block.hash = Some(H256(self.block_hash().as_slice().try_into().unwrap()));
+        if let Some(ts) = self.timestamp {
+            block.timestamp = ts;
+        }
+
+        EthereumBlock {
+            block: Arc::new(block),
+            transaction_receipts: Vec::new(),
+        }
+    }
+}
+
+impl Block for FakeBlock {
+    fn ptr(&self) -> BlockPtr {
+        self.block_ptr()
+    }
+
+    fn parent_ptr(&self) -> Option<BlockPtr> {
+        if self.number > 0 {
+            Some(
+                BlockPtr::try_from((self.parent_hash.as_str(), (self.number - 1) as i64))
+                    .expect("can construct parent ptr"),
+            )
+        } else {
+            None
+        }
+    }
+
+    fn data(&self) -> Result<serde_json::Value, serde_json::Error> {
+        let mut value: serde_json::Value = serde_json::to_value(self.as_ethereum_block())?;
+        if !self.eq(&BLOCK_THREE_NO_TIMESTAMP) {
+            return Ok(value);
+        };
+
+        // Remove the timestamp for block BLOCK_THREE_NO_TIMESTAMP in order to simulate the non EVM behaviour
+        // In these cases timestamp is not there at all but LightEthereumBlock uses U256 as timestamp so it
+        // can never be null and therefore impossible to test without manipulating the JSON blob directly.
+        if let serde_json::Value::Object(ref mut map) = value {
+            map.entry("block").and_modify(|ref mut block| {
+                if let serde_json::Value::Object(ref mut block) = block {
+                    block.remove_entry("timestamp");
+                }
+            });
+        };
+
+        Ok(value)
+    }
+}
+
+pub type FakeBlockList<'a> = Vec<&'static FakeBlock>;
+
+/// Store the given chain as the blocks for the `network` set the
+/// network's genesis block to `genesis_hash`, and head block to
+/// `null`
+pub fn set_chain(chain: FakeBlockList, network: &str) {
+    let store = crate::store::STORE
+        .block_store()
+        .chain_store(network)
+        .unwrap();
+    let chain: Vec<&dyn Block> = chain.iter().map(|block| *block as &dyn Block).collect();
+    store.set_chain(&GENESIS_BLOCK.hash, chain);
+}
diff --git a/store/test-store/src/lib.rs b/store/test-store/src/lib.rs
new file mode 100644
index 0000000..f1769a7
--- /dev/null
+++ b/store/test-store/src/lib.rs
@@ -0,0 +1,9 @@
+#[cfg(debug_assertions)]
+extern crate diesel;
+
+#[cfg(debug_assertions)]
+pub mod block_store;
+#[cfg(debug_assertions)]
+pub mod store;
+#[cfg(debug_assertions)]
+pub use crate::store::*;
diff --git a/store/test-store/src/store.rs b/store/test-store/src/store.rs
new file mode 100644
index 0000000..c1158da
--- /dev/null
+++ b/store/test-store/src/store.rs
@@ -0,0 +1,582 @@
+use diesel::{self, PgConnection};
+use graph::data::graphql::effort::LoadManager;
+use graph::data::query::QueryResults;
+use graph::data::query::QueryTarget;
+use graph::data::subgraph::schema::{DeploymentCreate, SubgraphError};
+use graph::log;
+use graph::prelude::{QueryStoreManager as _, SubgraphStore as _, *};
+use graph::semver::Version;
+use graph::{
+    blockchain::block_stream::FirehoseCursor, blockchain::ChainIdentifier,
+    components::store::DeploymentLocator, components::store::EntityKey,
+    components::store::EntityType, components::store::StatusStore,
+    components::store::StoredDynamicDataSource, data::subgraph::status, prelude::NodeId,
+};
+use graph_graphql::prelude::{
+    execute_query, Query as PreparedQuery, QueryExecutionOptions, StoreResolver,
+};
+use graph_graphql::test_support::GraphQLMetrics;
+use graph_mock::MockMetricsRegistry;
+use graph_node::config::{Config, Opt};
+use graph_node::store_builder::StoreBuilder;
+use graph_store_postgres::layout_for_tests::FAKE_NETWORK_SHARED;
+use graph_store_postgres::{connection_pool::ConnectionPool, Shard, SubscriptionManager};
+use graph_store_postgres::{
+    BlockStore as DieselBlockStore, DeploymentPlacer, SubgraphStore as DieselSubgraphStore,
+    PRIMARY_SHARD,
+};
+use hex_literal::hex;
+use lazy_static::lazy_static;
+use std::collections::BTreeSet;
+use std::collections::HashMap;
+use std::time::Instant;
+use std::{marker::PhantomData, sync::Mutex};
+use tokio::runtime::{Builder, Runtime};
+use web3::types::H256;
+
+pub const NETWORK_NAME: &str = "fake_network";
+pub const NETWORK_VERSION: &str = "graph test suite";
+
+pub use graph_store_postgres::Store;
+
+const CONN_POOL_SIZE: u32 = 20;
+
+lazy_static! {
+    pub static ref LOGGER: Logger = match ENV_VARS.log_levels {
+        Some(_) => log::logger(false),
+        None => Logger::root(slog::Discard, o!()),
+    };
+    static ref SEQ_LOCK: Mutex<()> = Mutex::new(());
+    pub static ref STORE_RUNTIME: Runtime =
+        Builder::new_multi_thread().enable_all().build().unwrap();
+    pub static ref METRICS_REGISTRY: Arc<MockMetricsRegistry> =
+        Arc::new(MockMetricsRegistry::new());
+    pub static ref LOAD_MANAGER: Arc<LoadManager> = Arc::new(LoadManager::new(
+        &*LOGGER,
+        Vec::new(),
+        METRICS_REGISTRY.clone(),
+    ));
+    static ref STORE_POOL_CONFIG: (Arc<Store>, ConnectionPool, Config, Arc<SubscriptionManager>) =
+        build_store();
+    pub(crate) static ref PRIMARY_POOL: ConnectionPool = STORE_POOL_CONFIG.1.clone();
+    pub static ref STORE: Arc<Store> = STORE_POOL_CONFIG.0.clone();
+    static ref CONFIG: Config = STORE_POOL_CONFIG.2.clone();
+    pub static ref SUBSCRIPTION_MANAGER: Arc<SubscriptionManager> = STORE_POOL_CONFIG.3.clone();
+    pub static ref NODE_ID: NodeId = NodeId::new("test").unwrap();
+    static ref SUBGRAPH_STORE: Arc<DieselSubgraphStore> = STORE.subgraph_store();
+    static ref BLOCK_STORE: Arc<DieselBlockStore> = STORE.block_store();
+    pub static ref GENESIS_PTR: BlockPtr = (
+        H256::from(hex!(
+            "bd34884280958002c51d3f7b5f853e6febeba33de0f40d15b0363006533c924f"
+        )),
+        0u64
+    )
+        .into();
+    pub static ref BLOCK_ONE: BlockPtr = (
+        H256::from(hex!(
+            "8511fa04b64657581e3f00e14543c1d522d5d7e771b54aa3060b662ade47da13"
+        )),
+        1u64
+    )
+        .into();
+    pub static ref BLOCKS: [BlockPtr; 4] = {
+        let two: BlockPtr = (
+            H256::from(hex!(
+                "b98fb783b49de5652097a989414c767824dff7e7fd765a63b493772511db81c1"
+            )),
+            2u64,
+        )
+            .into();
+        let three: BlockPtr = (
+            H256::from(hex!(
+                "977c084229c72a0fa377cae304eda9099b6a2cb5d83b25cdf0f0969b69874255"
+            )),
+            3u64,
+        )
+            .into();
+        [GENESIS_PTR.clone(), BLOCK_ONE.clone(), two, three]
+    };
+}
+
+/// Run the `test` after performing `setup`. The result of `setup` is passed
+/// into `test`. All tests using `run_test_sequentially` are run in sequence,
+/// never in parallel. The `test` is passed a `Store`, but it is permissible
+/// for tests to access the global `STORE` from this module, too.
+pub fn run_test_sequentially<R, F>(test: F)
+where
+    F: FnOnce(Arc<Store>) -> R + Send + 'static,
+    R: std::future::Future<Output = ()> + Send + 'static,
+{
+    // Lock regardless of poisoning. This also forces sequential test execution.
+    let _lock = match SEQ_LOCK.lock() {
+        Ok(guard) => guard,
+        Err(err) => err.into_inner(),
+    };
+
+    STORE_RUNTIME.handle().block_on(async {
+        let store = STORE.clone();
+        test(store).await
+    })
+}
+
+/// Run a test with a connection into the primary database, not a full store
+pub fn run_test_with_conn<F>(test: F)
+where
+    F: FnOnce(&PgConnection) -> (),
+{
+    // Lock regardless of poisoning. This also forces sequential test execution.
+    let _lock = match SEQ_LOCK.lock() {
+        Ok(guard) => guard,
+        Err(err) => err.into_inner(),
+    };
+
+    let conn = PRIMARY_POOL
+        .get()
+        .expect("failed to get connection for primary database");
+
+    test(&conn);
+}
+
+pub fn remove_subgraphs() {
+    SUBGRAPH_STORE
+        .delete_all_entities_for_test_use_only()
+        .expect("deleting test entities succeeds");
+}
+
+pub fn place(name: &str) -> Result<Option<(Vec<Shard>, Vec<NodeId>)>, String> {
+    CONFIG.deployment.place(name, NETWORK_NAME)
+}
+
+pub async fn create_subgraph(
+    subgraph_id: &DeploymentHash,
+    schema: &str,
+    base: Option<(DeploymentHash, BlockPtr)>,
+) -> Result<DeploymentLocator, StoreError> {
+    let schema = Schema::parse(schema, subgraph_id.clone()).unwrap();
+
+    let manifest = SubgraphManifest::<graph::blockchain::mock::MockBlockchain> {
+        id: subgraph_id.clone(),
+        spec_version: Version::new(1, 0, 0),
+        features: BTreeSet::new(),
+        description: Some(format!("manifest for {}", subgraph_id)),
+        repository: Some(format!("repo for {}", subgraph_id)),
+        schema: schema.clone(),
+        data_sources: vec![],
+        graft: None,
+        templates: vec![],
+        chain: PhantomData,
+    };
+
+    let deployment = DeploymentCreate::new(&manifest, None).graft(base);
+    let name = {
+        let mut name = subgraph_id.to_string();
+        name.truncate(32);
+        SubgraphName::new(name).unwrap()
+    };
+    let deployment = SUBGRAPH_STORE.create_deployment_replace(
+        name,
+        &schema,
+        deployment,
+        NODE_ID.clone(),
+        NETWORK_NAME.to_string(),
+        SubgraphVersionSwitchingMode::Instant,
+    )?;
+
+    SUBGRAPH_STORE
+        .cheap_clone()
+        .writable(LOGGER.clone(), deployment.id)
+        .await?
+        .start_subgraph_deployment(&*LOGGER)
+        .await?;
+    Ok(deployment)
+}
+
+pub async fn create_test_subgraph(subgraph_id: &DeploymentHash, schema: &str) -> DeploymentLocator {
+    create_subgraph(subgraph_id, schema, None).await.unwrap()
+}
+
+pub fn remove_subgraph(id: &DeploymentHash) {
+    let name = {
+        let mut name = id.to_string();
+        name.truncate(32);
+        SubgraphName::new(name).unwrap()
+    };
+    SUBGRAPH_STORE.remove_subgraph(name).unwrap();
+    for detail in SUBGRAPH_STORE.record_unused_deployments().unwrap() {
+        SUBGRAPH_STORE.remove_deployment(detail.id).unwrap();
+    }
+}
+
+/// Transact errors for this block and wait until changes have been written
+pub async fn transact_errors(
+    store: &Arc<Store>,
+    deployment: &DeploymentLocator,
+    block_ptr_to: BlockPtr,
+    errs: Vec<SubgraphError>,
+) -> Result<(), StoreError> {
+    let metrics_registry = Arc::new(MockMetricsRegistry::new());
+    let stopwatch_metrics = StopwatchMetrics::new(
+        Logger::root(slog::Discard, o!()),
+        deployment.hash.clone(),
+        "transact",
+        metrics_registry.clone(),
+    );
+    store
+        .subgraph_store()
+        .writable(LOGGER.clone(), deployment.id.clone())
+        .await?
+        .transact_block_operations(
+            block_ptr_to,
+            FirehoseCursor::None,
+            Vec::new(),
+            &stopwatch_metrics,
+            Vec::new(),
+            errs,
+            Vec::new(),
+            Vec::new(),
+        )
+        .await?;
+    flush(deployment).await
+}
+
+/// Convenience to transact EntityOperation instead of EntityModification
+pub async fn transact_entity_operations(
+    store: &Arc<DieselSubgraphStore>,
+    deployment: &DeploymentLocator,
+    block_ptr_to: BlockPtr,
+    ops: Vec<EntityOperation>,
+) -> Result<(), StoreError> {
+    transact_entities_and_dynamic_data_sources(
+        store,
+        deployment.clone(),
+        block_ptr_to,
+        vec![],
+        ops,
+        vec![],
+    )
+    .await
+}
+
+/// Convenience to transact EntityOperation instead of EntityModification and wait for the store to process the operations
+pub async fn transact_and_wait(
+    store: &Arc<DieselSubgraphStore>,
+    deployment: &DeploymentLocator,
+    block_ptr_to: BlockPtr,
+    ops: Vec<EntityOperation>,
+) -> Result<(), StoreError> {
+    transact_entities_and_dynamic_data_sources(
+        store,
+        deployment.clone(),
+        block_ptr_to,
+        vec![],
+        ops,
+        vec![],
+    )
+    .await?;
+    flush(deployment).await
+}
+
+pub async fn transact_entities_and_dynamic_data_sources(
+    store: &Arc<DieselSubgraphStore>,
+    deployment: DeploymentLocator,
+    block_ptr_to: BlockPtr,
+    data_sources: Vec<StoredDynamicDataSource>,
+    ops: Vec<EntityOperation>,
+    manifest_idx_and_name: Vec<(u32, String)>,
+) -> Result<(), StoreError> {
+    let store =
+        futures03::executor::block_on(store.cheap_clone().writable(LOGGER.clone(), deployment.id))?;
+    let mut entity_cache = EntityCache::new(Arc::new(store.clone()));
+    entity_cache.append(ops);
+    let mods = entity_cache
+        .as_modifications()
+        .expect("failed to convert to modifications")
+        .modifications;
+    let metrics_registry = Arc::new(MockMetricsRegistry::new());
+    let stopwatch_metrics = StopwatchMetrics::new(
+        Logger::root(slog::Discard, o!()),
+        deployment.hash.clone(),
+        "transact",
+        metrics_registry.clone(),
+    );
+    store
+        .transact_block_operations(
+            block_ptr_to,
+            FirehoseCursor::None,
+            mods,
+            &stopwatch_metrics,
+            data_sources,
+            Vec::new(),
+            manifest_idx_and_name,
+            Vec::new(),
+        )
+        .await
+}
+
+/// Revert to block `ptr` and wait for the store to process the changes
+pub async fn revert_block(store: &Arc<Store>, deployment: &DeploymentLocator, ptr: &BlockPtr) {
+    store
+        .subgraph_store()
+        .writable(LOGGER.clone(), deployment.id)
+        .await
+        .expect("can get writable")
+        .revert_block_operations(ptr.clone(), FirehoseCursor::None)
+        .await
+        .unwrap();
+    flush(deployment).await.unwrap();
+}
+
+pub fn insert_ens_name(hash: &str, name: &str) {
+    use diesel::insert_into;
+    use diesel::prelude::*;
+    use graph_store_postgres::command_support::catalog::ens_names;
+
+    let conn = PRIMARY_POOL.get().unwrap();
+
+    insert_into(ens_names::table)
+        .values((ens_names::hash.eq(hash), ens_names::name.eq(name)))
+        .on_conflict_do_nothing()
+        .execute(&conn)
+        .unwrap();
+}
+
+/// Insert the given entities and wait until all writes have been processed.
+/// The inserts all happen at `GENESIS_PTR`, i.e., block 0
+pub async fn insert_entities(
+    deployment: &DeploymentLocator,
+    entities: Vec<(EntityType, Entity)>,
+) -> Result<(), StoreError> {
+    let insert_ops = entities
+        .into_iter()
+        .map(|(entity_type, data)| EntityOperation::Set {
+            key: EntityKey {
+                entity_type: entity_type.to_owned(),
+                entity_id: data.get("id").unwrap().clone().as_string().unwrap().into(),
+            },
+            data,
+        });
+
+    transact_entity_operations(
+        &*SUBGRAPH_STORE,
+        deployment,
+        GENESIS_PTR.clone(),
+        insert_ops.collect::<Vec<_>>(),
+    )
+    .await?;
+
+    flush(deployment).await
+}
+
+/// Wait until all pending writes have been processed
+pub async fn flush(deployment: &DeploymentLocator) -> Result<(), StoreError> {
+    let writable = SUBGRAPH_STORE
+        .cheap_clone()
+        .writable(LOGGER.clone(), deployment.id)
+        .await
+        .expect("we can get a writable");
+    writable.flush().await
+}
+
+/// Tap into store events sent when running `f` and return those events. This
+/// intercepts `StoreEvent` when they are sent and therefore does not require
+/// the delicate timing that actually listening to events in the database
+/// requires. Of course, this does not test that events that are sent are
+/// actually received by anything, but makes ensuring that the right events
+/// get sent much more convenient than trying to receive them
+pub fn tap_store_events<F, R>(f: F) -> (R, Vec<StoreEvent>)
+where
+    F: FnOnce() -> R,
+{
+    use graph_store_postgres::layout_for_tests::{EVENT_TAP, EVENT_TAP_ENABLED};
+
+    EVENT_TAP.lock().unwrap().clear();
+    *EVENT_TAP_ENABLED.lock().unwrap() = true;
+    let res = f();
+    *EVENT_TAP_ENABLED.lock().unwrap() = false;
+    (res, EVENT_TAP.lock().unwrap().clone())
+}
+
+/// Run a GraphQL query against the `STORE`
+pub async fn execute_subgraph_query(query: Query, target: QueryTarget) -> QueryResults {
+    execute_subgraph_query_internal(query, target, None, None).await
+}
+
+pub async fn execute_subgraph_query_with_deadline(
+    query: Query,
+    target: QueryTarget,
+    deadline: Option<Instant>,
+) -> QueryResults {
+    execute_subgraph_query_internal(query, target, None, deadline).await
+}
+
+/// Like `try!`, but we return the contents of an `Err`, not the
+/// whole `Result`
+#[macro_export]
+macro_rules! return_err {
+    ( $ expr : expr ) => {
+        match $expr {
+            Ok(v) => v,
+            Err(e) => return e.into(),
+        }
+    };
+}
+
+pub fn graphql_metrics() -> Arc<GraphQLMetrics> {
+    Arc::new(GraphQLMetrics::make(METRICS_REGISTRY.clone()))
+}
+
+async fn execute_subgraph_query_internal(
+    query: Query,
+    target: QueryTarget,
+    max_complexity: Option<u64>,
+    deadline: Option<Instant>,
+) -> QueryResults {
+    let logger = Logger::root(slog::Discard, o!());
+    let (id, version) = match target {
+        QueryTarget::Deployment(id, version) => (id, version),
+        _ => unreachable!("tests do not use this"),
+    };
+    let schema = SUBGRAPH_STORE.api_schema(&id, &Default::default()).unwrap();
+    let status = StatusStore::status(
+        STORE.as_ref(),
+        status::Filter::Deployments(vec![id.to_string()]),
+    )
+    .unwrap();
+    let network = Some(status[0].chains[0].network.clone());
+    let query = return_err!(PreparedQuery::new(
+        &logger,
+        schema,
+        network,
+        query,
+        max_complexity,
+        100,
+        graphql_metrics(),
+    ));
+    let mut result = QueryResults::empty();
+    let deployment = query.schema.id().clone();
+    let store = STORE
+        .clone()
+        .query_store(
+            QueryTarget::Deployment(deployment.into(), version.clone()),
+            false,
+        )
+        .await
+        .unwrap();
+    let state = store.deployment_state().await.unwrap();
+    for (bc, (selection_set, error_policy)) in return_err!(query.block_constraint()) {
+        let logger = logger.clone();
+        let resolver = return_err!(
+            StoreResolver::at_block(
+                &logger,
+                store.clone(),
+                &state,
+                SUBSCRIPTION_MANAGER.clone(),
+                bc,
+                error_policy,
+                query.schema.id().clone(),
+                graphql_metrics()
+            )
+            .await
+        );
+        result.append(
+            execute_query(
+                query.clone(),
+                Some(selection_set),
+                None,
+                QueryExecutionOptions {
+                    resolver,
+                    deadline,
+                    load_manager: LOAD_MANAGER.clone(),
+                    max_first: std::u32::MAX,
+                    max_skip: std::u32::MAX,
+                },
+            )
+            .await,
+        )
+    }
+    result
+}
+
+pub async fn deployment_state(store: &Store, subgraph_id: &DeploymentHash) -> DeploymentState {
+    store
+        .query_store(
+            QueryTarget::Deployment(subgraph_id.to_owned(), Default::default()),
+            false,
+        )
+        .await
+        .expect("could get a query store")
+        .deployment_state()
+        .await
+        .expect("can get deployment state")
+}
+
+pub fn store_is_sharded() -> bool {
+    CONFIG.stores.len() > 1
+}
+
+pub fn all_shards() -> Vec<Shard> {
+    CONFIG
+        .stores
+        .keys()
+        .map(|shard| Shard::new(shard.clone()))
+        .collect::<Result<Vec<_>, _>>()
+        .expect("all configured shard names are valid")
+}
+
+fn build_store() -> (Arc<Store>, ConnectionPool, Config, Arc<SubscriptionManager>) {
+    let mut opt = Opt::default();
+    let url = std::env::var_os("THEGRAPH_STORE_POSTGRES_DIESEL_URL").filter(|s| s.len() > 0);
+    let file = std::env::var_os("GRAPH_NODE_TEST_CONFIG").filter(|s| s.len() > 0);
+    if let Some(file) = file {
+        let file = file.into_string().unwrap();
+        opt.config = Some(file);
+        if url.is_some() {
+            eprintln!("WARNING: ignoring THEGRAPH_STORE_POSTGRES_DIESEL_URL because GRAPH_NODE_TEST_CONFIG is set");
+        }
+    } else if let Some(url) = url {
+        let url = url.into_string().unwrap();
+        opt.postgres_url = Some(url);
+    } else {
+        panic!("You must set either THEGRAPH_STORE_POSTGRES_DIESEL_URL or GRAPH_NODE_TEST_CONFIG (see ./CONTRIBUTING.md).");
+    }
+    opt.store_connection_pool_size = CONN_POOL_SIZE;
+
+    let config = Config::load(&*LOGGER, &opt)
+        .expect(&format!("config is not valid (file={:?})", &opt.config));
+    let registry = Arc::new(MockMetricsRegistry::new());
+    std::thread::spawn(move || {
+        STORE_RUNTIME.handle().block_on(async {
+            let builder = StoreBuilder::new(&*LOGGER, &*NODE_ID, &config, None, registry).await;
+            let subscription_manager = builder.subscription_manager();
+            let primary_pool = builder.primary_pool();
+
+            let ident = ChainIdentifier {
+                net_version: NETWORK_VERSION.to_owned(),
+                genesis_block_hash: GENESIS_PTR.hash.clone(),
+            };
+
+            (
+                builder.network_store(vec![
+                    (NETWORK_NAME.to_string(), vec![ident.clone()]),
+                    (FAKE_NETWORK_SHARED.to_string(), vec![ident]),
+                ]),
+                primary_pool,
+                config,
+                subscription_manager,
+            )
+        })
+    })
+    .join()
+    .unwrap()
+}
+
+pub fn primary_connection() -> graph_store_postgres::layout_for_tests::Connection<'static> {
+    let conn = PRIMARY_POOL.get().unwrap();
+    graph_store_postgres::layout_for_tests::Connection::new(conn)
+}
+
+pub fn primary_mirror() -> graph_store_postgres::layout_for_tests::Mirror {
+    let pool = PRIMARY_POOL.clone();
+    let map = HashMap::from_iter(Some((PRIMARY_SHARD.clone(), pool)));
+    graph_store_postgres::layout_for_tests::Mirror::new(&map)
+}
diff --git a/tests/Cargo.toml b/tests/Cargo.toml
new file mode 100644
index 0000000..8c7bd04
--- /dev/null
+++ b/tests/Cargo.toml
@@ -0,0 +1,30 @@
+[package]
+name = "graph-tests"
+version = "0.27.0"
+edition = "2021"
+
+[dependencies]
+port_check = "0.1.5"
+anyhow = "1.0"
+futures = { version = "0.3", features = ["compat"] }
+graph = { path = "../graph" }
+tokio = { version = "1.16.1", features = ["rt", "macros", "process"] }
+graph-chain-ethereum = { path = "../chain/ethereum" }
+async-stream = "0.3.3"
+graph-node = { path = "../node" }
+graph-core = { path = "../core" }
+graph-mock = { path = "../mock" }
+graph-graphql = { path = "../graphql" }
+graph-store-postgres = { path = "../store/postgres" }
+slog = { version = "2.7.0", features = ["release_max_level_trace", "max_level_trace"] }
+graphql-parser = "0.4.0"
+hex = "0.4.3"
+
+[dev-dependencies]
+bollard = "0.10"
+anyhow = "1.0.65"
+lazy_static = "1.4.0"
+tokio-stream = "0.1"
+serde_yaml = "0.8"
+cid = "0.8.6"
+graph-chain-near = { path = "../chain/near" }
diff --git a/tests/integration-tests/api-version-v0-0-4/abis/Contract.abi b/tests/integration-tests/api-version-v0-0-4/abis/Contract.abi
new file mode 100644
index 0000000..02da1a9
--- /dev/null
+++ b/tests/integration-tests/api-version-v0-0-4/abis/Contract.abi
@@ -0,0 +1,33 @@
+[
+  {
+    "inputs": [],
+    "stateMutability": "nonpayable",
+    "type": "constructor"
+  },
+  {
+    "anonymous": false,
+    "inputs": [
+      {
+        "indexed": false,
+        "internalType": "uint16",
+        "name": "x",
+        "type": "uint16"
+      }
+    ],
+    "name": "Trigger",
+    "type": "event"
+  },
+  {
+    "inputs": [
+      {
+        "internalType": "uint16",
+        "name": "x",
+        "type": "uint16"
+      }
+    ],
+    "name": "emitTrigger",
+    "outputs": [],
+    "stateMutability": "nonpayable",
+    "type": "function"
+  }
+]
diff --git a/tests/integration-tests/api-version-v0-0-4/package.json b/tests/integration-tests/api-version-v0-0-4/package.json
new file mode 100644
index 0000000..8489e72
--- /dev/null
+++ b/tests/integration-tests/api-version-v0-0-4/package.json
@@ -0,0 +1,25 @@
+{
+  "name": "api-version-v0-0-4",
+  "version": "0.1.0",
+  "scripts": {
+    "build-contracts": "../common/build-contracts.sh",
+    "codegen": "graph codegen",
+    "test": "yarn build-contracts && truffle test --compile-none --network test",
+    "create:test": "graph create test/api-version-v0-0-4 --node $GRAPH_NODE_ADMIN_URI",
+    "deploy:test": "graph deploy test/api-version-v0-0-4 --version-label v0.0.1 --ipfs $IPFS_URI --node $GRAPH_NODE_ADMIN_URI"
+  },
+  "devDependencies": {
+    "@graphprotocol/graph-cli": "https://github.com/graphprotocol/graph-cli#v0.21.1",
+    "@graphprotocol/graph-ts": "https://github.com/graphprotocol/graph-ts#v0.21.1",
+    "solc": "^0.8.2"
+  },
+  "dependencies": {
+    "@truffle/contract": "^4.3",
+    "@truffle/hdwallet-provider": "^1.2",
+    "apollo-fetch": "^0.7.0",
+    "babel-polyfill": "^6.26.0",
+    "babel-register": "^6.26.0",
+    "gluegun": "^4.6.1",
+    "truffle": "^5.2"
+  }
+}
diff --git a/tests/integration-tests/api-version-v0-0-4/schema.graphql b/tests/integration-tests/api-version-v0-0-4/schema.graphql
new file mode 100644
index 0000000..6c007b3
--- /dev/null
+++ b/tests/integration-tests/api-version-v0-0-4/schema.graphql
@@ -0,0 +1,5 @@
+# The `id` is the block number and `count` the handler invocations at that block.
+type DataSourceCount @entity {
+  id: ID!
+  count: Int!
+}
diff --git a/tests/integration-tests/api-version-v0-0-4/src/mapping.ts b/tests/integration-tests/api-version-v0-0-4/src/mapping.ts
new file mode 100644
index 0000000..36b326f
--- /dev/null
+++ b/tests/integration-tests/api-version-v0-0-4/src/mapping.ts
@@ -0,0 +1,38 @@
+import {
+  ethereum,
+  DataSourceContext,
+  dataSource,
+  Address,
+  BigInt,
+} from "@graphprotocol/graph-ts";
+import { Template } from "../generated/templates";
+import { DataSourceCount } from "../generated/schema";
+
+export function handleBlock(block: ethereum.Block): void {
+  let context = new DataSourceContext();
+  context.setBigInt("number", block.number);
+
+  Template.createWithContext(
+    changetype<Address>(Address.fromHexString(
+      "0x2E645469f354BB4F5c8a05B3b30A929361cf77eC"
+    )),
+    context
+  );
+}
+
+export function handleBlockTemplate(block: ethereum.Block): void {
+  let count = DataSourceCount.load(block.number.toString());
+  if (count == null) {
+    count = new DataSourceCount(block.number.toString());
+    count.count = 0;
+  }
+
+  let ctx = dataSource.context();
+  let number = ctx.getBigInt("number");
+  assert(
+    count.count == number.toI32(),
+    "wrong count, found " + BigInt.fromI32(count.count).toString()
+  );
+  count.count += 1;
+  count.save();
+}
diff --git a/tests/integration-tests/api-version-v0-0-4/subgraph.yaml b/tests/integration-tests/api-version-v0-0-4/subgraph.yaml
new file mode 100644
index 0000000..cfb724e
--- /dev/null
+++ b/tests/integration-tests/api-version-v0-0-4/subgraph.yaml
@@ -0,0 +1,43 @@
+specVersion: 0.0.2
+repository: https://github.com/graphprotocol/example-subgraph
+schema:
+  file: ./schema.graphql
+features:
+  - nonFatalErrors
+dataSources:
+  - kind: ethereum/contract
+    name: Contract
+    network: test
+    source:
+      address: "0xCfEB869F69431e42cdB54A4F4f105C19C080A601"
+      abi: Contract
+    mapping:
+      kind: ethereum/events
+      apiVersion: 0.0.4
+      language: wasm/assemblyscript
+      entities:
+        - Gravatar
+      abis:
+        - name: Contract
+          file: ./abis/Contract.abi
+      blockHandlers:
+        - handler: handleBlock
+      file: ./src/mapping.ts
+templates:
+  - kind: ethereum/contract
+    name: Template
+    network: test
+    source:
+      abi: Contract
+    mapping:
+      kind: ethereum/events
+      apiVersion: 0.0.4
+      language: wasm/assemblyscript
+      entities:
+        - Gravatar
+      abis:
+        - name: Contract
+          file: ./abis/Contract.abi
+      blockHandlers:
+        - handler: handleBlockTemplate
+      file: ./src/mapping.ts
diff --git a/tests/integration-tests/api-version-v0-0-4/test/test.js b/tests/integration-tests/api-version-v0-0-4/test/test.js
new file mode 100644
index 0000000..fd0e2ee
--- /dev/null
+++ b/tests/integration-tests/api-version-v0-0-4/test/test.js
@@ -0,0 +1,79 @@
+const path = require("path");
+const execSync = require("child_process").execSync;
+const { system, patching } = require("gluegun");
+const { createApolloFetch } = require("apollo-fetch");
+
+const Contract = artifacts.require("./Contract.sol");
+
+const srcDir = path.join(__dirname, "..");
+
+const indexPort = process.env.GRAPH_NODE_INDEX_PORT || 18030;
+
+const fetchSubgraphs = createApolloFetch({
+  uri: `http://localhost:${indexPort}/graphql`,
+});
+
+const exec = (cmd) => {
+  try {
+    return execSync(cmd, { cwd: srcDir, stdio: "inherit" });
+  } catch (e) {
+    throw new Error(`Failed to run command \`${cmd}\``);
+  }
+};
+
+const waitForSubgraphToBeSynced = async () =>
+  new Promise((resolve, reject) => {
+    // Wait for 60s
+    let deadline = Date.now() + 60 * 1000;
+
+    // Function to check if the subgraph is synced
+    const checkSubgraphSynced = async () => {
+      try {
+        let result = await fetchSubgraphs({
+          query: `{ indexingStatuses { synced, health } }`,
+        });
+
+        if (result.data.indexingStatuses[0].synced) {
+          resolve();
+        } else if (result.data.indexingStatuses[0].health != "healthy") {
+          reject(new Error("Subgraph failed"));
+        } else {
+          throw new Error("reject or retry");
+        }
+      } catch (e) {
+        if (Date.now() > deadline) {
+          reject(new Error(`Timed out waiting for the subgraph to sync`));
+        } else {
+          setTimeout(checkSubgraphSynced, 500);
+        }
+      }
+    };
+
+    // Periodically check whether the subgraph has synced
+    setTimeout(checkSubgraphSynced, 0);
+  });
+
+contract("Contract", (accounts) => {
+  // Deploy the subgraph once before all tests
+  before(async () => {
+    // Deploy the contract
+    const contract = await Contract.deployed();
+
+    // Insert its address into subgraph manifest
+    await patching.replace(
+      path.join(srcDir, "subgraph.yaml"),
+      "0x0000000000000000000000000000000000000000",
+      contract.address
+    );
+
+    // Create and deploy the subgraph
+    exec(`yarn codegen`);
+    exec(`yarn create:test`);
+    exec(`yarn deploy:test`);
+  });
+
+  it("subgraph does not fail", async () => {
+    // Wait for the subgraph to be indexed, and not fail
+    await waitForSubgraphToBeSynced();
+  });
+});
diff --git a/tests/integration-tests/api-version-v0-0-4/truffle.js b/tests/integration-tests/api-version-v0-0-4/truffle.js
new file mode 100644
index 0000000..55e43cc
--- /dev/null
+++ b/tests/integration-tests/api-version-v0-0-4/truffle.js
@@ -0,0 +1,22 @@
+require("babel-register");
+require("babel-polyfill");
+
+module.exports = {
+  contracts_directory: "../common",
+  migrations_directory: "../common",
+  contracts_build_directory: "./truffle_output",
+  networks: {
+    test: {
+      host: "localhost",
+      port: process.env.GANACHE_TEST_PORT || 18545,
+      network_id: "*",
+      gas: "100000000000",
+      gasPrice: "1",
+    },
+  },
+  compilers: {
+    solc: {
+      version: "0.8.2"
+    },
+  },
+};
diff --git a/tests/integration-tests/common/1_initial_migration.js b/tests/integration-tests/common/1_initial_migration.js
new file mode 100644
index 0000000..1eb6f9d
--- /dev/null
+++ b/tests/integration-tests/common/1_initial_migration.js
@@ -0,0 +1,5 @@
+var Migrations = artifacts.require('./Migrations.sol')
+
+module.exports = function(deployer) {
+  deployer.deploy(Migrations)
+}
diff --git a/tests/integration-tests/common/2_deploy_contracts.js b/tests/integration-tests/common/2_deploy_contracts.js
new file mode 100644
index 0000000..ffe0359
--- /dev/null
+++ b/tests/integration-tests/common/2_deploy_contracts.js
@@ -0,0 +1,5 @@
+const Contract = artifacts.require('./Contract.sol')
+
+module.exports = async function(deployer) {
+  await deployer.deploy(Contract)
+}
diff --git a/tests/integration-tests/common/Migrations.sol b/tests/integration-tests/common/Migrations.sol
new file mode 100644
index 0000000..0b571c8
--- /dev/null
+++ b/tests/integration-tests/common/Migrations.sol
@@ -0,0 +1,23 @@
+pragma solidity ^0.8.0;
+
+contract Migrations {
+  address public owner;
+  uint public last_completed_migration;
+
+  constructor() public {
+    owner = msg.sender;
+  }
+
+  modifier restricted() {
+    if (msg.sender == owner) _;
+  }
+
+  function setCompleted(uint completed) public restricted {
+    last_completed_migration = completed;
+  }
+
+  function upgrade(address new_address) public restricted {
+    Migrations upgraded = Migrations(new_address);
+    upgraded.setCompleted(last_completed_migration);
+  }
+}
diff --git a/tests/integration-tests/common/SimpleContract.sol b/tests/integration-tests/common/SimpleContract.sol
new file mode 100644
index 0000000..c649e8b
--- /dev/null
+++ b/tests/integration-tests/common/SimpleContract.sol
@@ -0,0 +1,14 @@
+pragma solidity ^0.8.0;
+
+
+contract Contract {
+    event Trigger(uint16 x);
+
+    constructor() public {
+        emit Trigger(0);
+    }
+
+    function emitTrigger(uint16 x) public {
+        emit Trigger(x);
+    }
+}
diff --git a/tests/integration-tests/common/build-contracts.sh b/tests/integration-tests/common/build-contracts.sh
new file mode 100755
index 0000000..2f35aac
--- /dev/null
+++ b/tests/integration-tests/common/build-contracts.sh
@@ -0,0 +1,22 @@
+#!/usr/bin/env bash
+
+# Builds Solidity contracts for graph-node integration tests.
+#
+# This script is meant to be callde as a yarn "script", defined in each "package.json"
+# file, found on every test subdirectory.
+#
+# It ensures that all integration tests subdirectories have no pre-built artifacts
+# (abis, bin, generated and build directories), and will exctract ABIs and BINs for
+# the artifacts built by truffle.
+
+set -euo pipefail
+
+# Cleanup target directories
+rm -rf abis build generated
+
+# Compile contracts into a temporary directory
+yarn truffle compile
+
+# Move abi to a directory expected by graph-node
+mkdir -p abis bin
+jq -r '.abi' truffle_output/Contract.json > abis/Contract.abi
diff --git a/tests/integration-tests/config.simple.toml b/tests/integration-tests/config.simple.toml
new file mode 100644
index 0000000..bbe75d7
--- /dev/null
+++ b/tests/integration-tests/config.simple.toml
@@ -0,0 +1,23 @@
+# A simple store configuration: we use one database for everything
+# This is equivalent to the old way of configuring the store for tests
+# by just setting the environment variable THEGRAPH_STORE_POSTGRES_DIESEL_URL
+
+[store]
+[store.primary]
+connection = "$THEGRAPH_STORE_POSTGRES_DIESEL_URL"
+pool_size = 10
+
+[deployment]
+[[deployment.rule]]
+store = "primary"
+indexers = [ "default" ]
+
+[chains]
+ingestor = "default"
+
+# The tests do not talk to ethereum clients
+[chains.test]
+shard = "primary"
+provider = [
+  { label = "penguin", url="http://localhost:1/", features = [] }
+]
diff --git a/tests/integration-tests/data-source-revert/abis/Contract.abi b/tests/integration-tests/data-source-revert/abis/Contract.abi
new file mode 100644
index 0000000..02da1a9
--- /dev/null
+++ b/tests/integration-tests/data-source-revert/abis/Contract.abi
@@ -0,0 +1,33 @@
+[
+  {
+    "inputs": [],
+    "stateMutability": "nonpayable",
+    "type": "constructor"
+  },
+  {
+    "anonymous": false,
+    "inputs": [
+      {
+        "indexed": false,
+        "internalType": "uint16",
+        "name": "x",
+        "type": "uint16"
+      }
+    ],
+    "name": "Trigger",
+    "type": "event"
+  },
+  {
+    "inputs": [
+      {
+        "internalType": "uint16",
+        "name": "x",
+        "type": "uint16"
+      }
+    ],
+    "name": "emitTrigger",
+    "outputs": [],
+    "stateMutability": "nonpayable",
+    "type": "function"
+  }
+]
diff --git a/tests/integration-tests/data-source-revert/grafted.yaml b/tests/integration-tests/data-source-revert/grafted.yaml
new file mode 100644
index 0000000..64e9180
--- /dev/null
+++ b/tests/integration-tests/data-source-revert/grafted.yaml
@@ -0,0 +1,46 @@
+specVersion: 0.0.4
+features:
+  - grafting
+schema:
+  file: ./schema.graphql
+graft:
+  # Must match the id from building `subgraph.yaml`
+  base: QmW6kCVyaV3d37Pm9ZZKZAWU9G6oSooJiarjBKrqLE9FJy
+  block: 3
+dataSources:
+  - kind: ethereum/contract
+    name: Contract
+    network: test
+    source:
+      address: "0xCfEB869F69431e42cdB54A4F4f105C19C080A601"
+      abi: Contract
+    mapping:
+      kind: ethereum/events
+      apiVersion: 0.0.6
+      language: wasm/assemblyscript
+      entities:
+        - Gravatar
+      abis:
+        - name: Contract
+          file: ./abis/Contract.abi
+      blockHandlers:
+        - handler: handleBlock
+      file: ./src/mapping.ts
+templates:
+  - kind: ethereum/contract
+    name: Template
+    network: test
+    source:
+      abi: Contract
+    mapping:
+      kind: ethereum/events
+      apiVersion: 0.0.6
+      language: wasm/assemblyscript
+      entities:
+        - Gravatar
+      abis:
+        - name: Contract
+          file: ./abis/Contract.abi
+      blockHandlers:
+        - handler: handleBlockTemplate
+      file: ./src/mapping.ts
diff --git a/tests/integration-tests/data-source-revert/package.json b/tests/integration-tests/data-source-revert/package.json
new file mode 100644
index 0000000..7320895
--- /dev/null
+++ b/tests/integration-tests/data-source-revert/package.json
@@ -0,0 +1,13 @@
+{
+  "name": "data-source-revert",
+  "version": "0.1.0",
+  "scripts": {
+    "codegen": "graph codegen",
+    "deploy:test": "graph deploy test/data-source-revert --version-label v0.0.1 --ipfs $IPFS_URI --node $GRAPH_NODE_ADMIN_URI",
+    "deploy:test-grafted": "graph deploy test/data-source-revert-grafted grafted.yaml --version-label v0.0.1 --ipfs $IPFS_URI --node $GRAPH_NODE_ADMIN_URI"
+  },
+  "devDependencies": {
+    "@graphprotocol/graph-cli": "https://github.com/graphprotocol/graph-cli#main",
+    "@graphprotocol/graph-ts": "https://github.com/graphprotocol/graph-ts#main"
+  }
+}
\ No newline at end of file
diff --git a/tests/integration-tests/data-source-revert/schema.graphql b/tests/integration-tests/data-source-revert/schema.graphql
new file mode 100644
index 0000000..6c007b3
--- /dev/null
+++ b/tests/integration-tests/data-source-revert/schema.graphql
@@ -0,0 +1,5 @@
+# The `id` is the block number and `count` the handler invocations at that block.
+type DataSourceCount @entity {
+  id: ID!
+  count: Int!
+}
diff --git a/tests/integration-tests/data-source-revert/src/mapping.ts b/tests/integration-tests/data-source-revert/src/mapping.ts
new file mode 100644
index 0000000..36b326f
--- /dev/null
+++ b/tests/integration-tests/data-source-revert/src/mapping.ts
@@ -0,0 +1,38 @@
+import {
+  ethereum,
+  DataSourceContext,
+  dataSource,
+  Address,
+  BigInt,
+} from "@graphprotocol/graph-ts";
+import { Template } from "../generated/templates";
+import { DataSourceCount } from "../generated/schema";
+
+export function handleBlock(block: ethereum.Block): void {
+  let context = new DataSourceContext();
+  context.setBigInt("number", block.number);
+
+  Template.createWithContext(
+    changetype<Address>(Address.fromHexString(
+      "0x2E645469f354BB4F5c8a05B3b30A929361cf77eC"
+    )),
+    context
+  );
+}
+
+export function handleBlockTemplate(block: ethereum.Block): void {
+  let count = DataSourceCount.load(block.number.toString());
+  if (count == null) {
+    count = new DataSourceCount(block.number.toString());
+    count.count = 0;
+  }
+
+  let ctx = dataSource.context();
+  let number = ctx.getBigInt("number");
+  assert(
+    count.count == number.toI32(),
+    "wrong count, found " + BigInt.fromI32(count.count).toString()
+  );
+  count.count += 1;
+  count.save();
+}
diff --git a/tests/integration-tests/data-source-revert/subgraph.yaml b/tests/integration-tests/data-source-revert/subgraph.yaml
new file mode 100644
index 0000000..1c6d339
--- /dev/null
+++ b/tests/integration-tests/data-source-revert/subgraph.yaml
@@ -0,0 +1,40 @@
+specVersion: 0.0.4
+schema:
+  file: ./schema.graphql
+dataSources:
+  - kind: ethereum/contract
+    name: Contract
+    network: test
+    source:
+      address: "0xCfEB869F69431e42cdB54A4F4f105C19C080A601"
+      abi: Contract
+    mapping:
+      kind: ethereum/events
+      apiVersion: 0.0.6
+      language: wasm/assemblyscript
+      entities:
+        - Gravatar
+      abis:
+        - name: Contract
+          file: ./abis/Contract.abi
+      blockHandlers:
+        - handler: handleBlock
+      file: ./src/mapping.ts
+templates:
+  - kind: ethereum/contract
+    name: Template
+    network: test
+    source:
+      abi: Contract
+    mapping:
+      kind: ethereum/events
+      apiVersion: 0.0.6
+      language: wasm/assemblyscript
+      entities:
+        - Gravatar
+      abis:
+        - name: Contract
+          file: ./abis/Contract.abi
+      blockHandlers:
+        - handler: handleBlockTemplate
+      file: ./src/mapping.ts
diff --git a/tests/integration-tests/dynamic-data-source/abis/Contract.abi b/tests/integration-tests/dynamic-data-source/abis/Contract.abi
new file mode 100644
index 0000000..02da1a9
--- /dev/null
+++ b/tests/integration-tests/dynamic-data-source/abis/Contract.abi
@@ -0,0 +1,33 @@
+[
+  {
+    "inputs": [],
+    "stateMutability": "nonpayable",
+    "type": "constructor"
+  },
+  {
+    "anonymous": false,
+    "inputs": [
+      {
+        "indexed": false,
+        "internalType": "uint16",
+        "name": "x",
+        "type": "uint16"
+      }
+    ],
+    "name": "Trigger",
+    "type": "event"
+  },
+  {
+    "inputs": [
+      {
+        "internalType": "uint16",
+        "name": "x",
+        "type": "uint16"
+      }
+    ],
+    "name": "emitTrigger",
+    "outputs": [],
+    "stateMutability": "nonpayable",
+    "type": "function"
+  }
+]
diff --git a/tests/integration-tests/dynamic-data-source/package.json b/tests/integration-tests/dynamic-data-source/package.json
new file mode 100644
index 0000000..7d9cead
--- /dev/null
+++ b/tests/integration-tests/dynamic-data-source/package.json
@@ -0,0 +1,25 @@
+{
+  "name": "dynamic-data-source",
+  "version": "0.1.0",
+  "scripts": {
+    "build-contracts": "../common/build-contracts.sh",
+    "codegen": "graph codegen",
+    "test": "yarn build-contracts && truffle test --compile-none --network test",
+    "create:test": "graph create test/dynamic-data-source --node $GRAPH_NODE_ADMIN_URI",
+    "deploy:test": "graph deploy test/dynamic-data-source --version-label v0.0.1 --ipfs $IPFS_URI --node $GRAPH_NODE_ADMIN_URI"
+  },
+  "devDependencies": {
+    "@graphprotocol/graph-cli": "https://github.com/graphprotocol/graph-cli#main",
+    "@graphprotocol/graph-ts": "https://github.com/graphprotocol/graph-ts#main",
+    "solc": "^0.8.2"
+  },
+  "dependencies": {
+    "@truffle/contract": "^4.3",
+    "@truffle/hdwallet-provider": "^1.2",
+    "apollo-fetch": "^0.7.0",
+    "babel-polyfill": "^6.26.0",
+    "babel-register": "^6.26.0",
+    "gluegun": "^4.6.1",
+    "truffle": "^5.2"
+  }
+}
diff --git a/tests/integration-tests/dynamic-data-source/schema.graphql b/tests/integration-tests/dynamic-data-source/schema.graphql
new file mode 100644
index 0000000..e535647
--- /dev/null
+++ b/tests/integration-tests/dynamic-data-source/schema.graphql
@@ -0,0 +1,4 @@
+type Foo @entity {
+  id: ID!
+  value: String!
+}
diff --git a/tests/integration-tests/dynamic-data-source/src/mapping.ts b/tests/integration-tests/dynamic-data-source/src/mapping.ts
new file mode 100644
index 0000000..ec69d21
--- /dev/null
+++ b/tests/integration-tests/dynamic-data-source/src/mapping.ts
@@ -0,0 +1,16 @@
+import { Trigger } from "../generated/Contract/Contract";
+import {Foo} from "../generated/schema";
+
+
+export function handleTrigger(event: Trigger): void {
+  let id = `${event.block.hash.toHexString()}${event.address.toHexString()}`;
+  let foo = new Foo(id);
+  foo.save();
+}
+
+
+
+
+
+
+
diff --git a/tests/integration-tests/dynamic-data-source/subgraph.yaml b/tests/integration-tests/dynamic-data-source/subgraph.yaml
new file mode 100644
index 0000000..3f7efba
--- /dev/null
+++ b/tests/integration-tests/dynamic-data-source/subgraph.yaml
@@ -0,0 +1,42 @@
+specVersion: 0.0.4
+schema:
+  file: ./schema.graphql
+dataSources:
+  - kind: ethereum/contract
+    name: Contract
+    network: test
+    source:
+      address: "0xCfEB869F69431e42cdB54A4F4f105C19C080A601"
+      abi: Contract
+    mapping:
+      kind: ethereum/events
+      apiVersion: 0.0.6
+      language: wasm/assemblyscript
+      abis:
+        - name: Contract
+          file: ./abis/Contract.abi
+      entities:
+        - Call
+      eventHandlers:
+        - event: Trigger(uint16)
+          handler: handleTrigger
+      file: ./src/mapping.ts
+templates:
+  - kind: ethereum/contract
+    name: Dynamic
+    network: test
+    source:
+      abi: Contract
+    mapping:
+      kind: ethereum/events
+      apiVersion: 0.0.6
+      language: wasm/assemblyscript
+      abis:
+        - name: Contract
+          file: ./abis/Contract.abi
+      entities:
+        - Call
+      eventHandlers:
+        - event: Trigger(uint16)
+          handler: handleTrigger
+      file: ./src/mapping.ts
diff --git a/tests/integration-tests/fatal-error/abis/Contract.abi b/tests/integration-tests/fatal-error/abis/Contract.abi
new file mode 100644
index 0000000..02da1a9
--- /dev/null
+++ b/tests/integration-tests/fatal-error/abis/Contract.abi
@@ -0,0 +1,33 @@
+[
+  {
+    "inputs": [],
+    "stateMutability": "nonpayable",
+    "type": "constructor"
+  },
+  {
+    "anonymous": false,
+    "inputs": [
+      {
+        "indexed": false,
+        "internalType": "uint16",
+        "name": "x",
+        "type": "uint16"
+      }
+    ],
+    "name": "Trigger",
+    "type": "event"
+  },
+  {
+    "inputs": [
+      {
+        "internalType": "uint16",
+        "name": "x",
+        "type": "uint16"
+      }
+    ],
+    "name": "emitTrigger",
+    "outputs": [],
+    "stateMutability": "nonpayable",
+    "type": "function"
+  }
+]
diff --git a/tests/integration-tests/fatal-error/package.json b/tests/integration-tests/fatal-error/package.json
new file mode 100644
index 0000000..17d5eb2
--- /dev/null
+++ b/tests/integration-tests/fatal-error/package.json
@@ -0,0 +1,25 @@
+{
+  "name": "fatal-error",
+  "version": "0.1.0",
+  "scripts": {
+    "build-contracts": "../common/build-contracts.sh",
+    "codegen": "graph codegen",
+    "test": "yarn build-contracts && truffle test --compile-none --network test",
+    "create:test": "graph create test/fatal-error --node $GRAPH_NODE_ADMIN_URI",
+    "deploy:test": "graph deploy test/fatal-error --version-label v0.0.1 --ipfs $IPFS_URI --node $GRAPH_NODE_ADMIN_URI"
+  },
+  "devDependencies": {
+    "@graphprotocol/graph-cli": "https://github.com/graphprotocol/graph-cli#main",
+    "@graphprotocol/graph-ts": "https://github.com/graphprotocol/graph-ts#main",
+    "solc": "^0.8.2"
+  },
+  "dependencies": {
+    "@truffle/contract": "^4.3",
+    "@truffle/hdwallet-provider": "^1.2",
+    "apollo-fetch": "^0.7.0",
+    "babel-polyfill": "^6.26.0",
+    "babel-register": "^6.26.0",
+    "gluegun": "^4.6.1",
+    "truffle": "^5.2"
+  }
+}
diff --git a/tests/integration-tests/fatal-error/schema.graphql b/tests/integration-tests/fatal-error/schema.graphql
new file mode 100644
index 0000000..c4f76dc
--- /dev/null
+++ b/tests/integration-tests/fatal-error/schema.graphql
@@ -0,0 +1,4 @@
+type Call @entity {
+  id: ID!
+  value: String!
+}
diff --git a/tests/integration-tests/fatal-error/src/mapping.ts b/tests/integration-tests/fatal-error/src/mapping.ts
new file mode 100644
index 0000000..0c78604
--- /dev/null
+++ b/tests/integration-tests/fatal-error/src/mapping.ts
@@ -0,0 +1,5 @@
+import { Trigger } from "../generated/Contract/Contract";
+
+export function handleTrigger(event: Trigger): void {
+  assert(false)
+}
diff --git a/tests/integration-tests/fatal-error/subgraph.yaml b/tests/integration-tests/fatal-error/subgraph.yaml
new file mode 100644
index 0000000..09e3122
--- /dev/null
+++ b/tests/integration-tests/fatal-error/subgraph.yaml
@@ -0,0 +1,23 @@
+specVersion: 0.0.2
+schema:
+  file: ./schema.graphql
+dataSources:
+  - kind: ethereum/contract
+    name: Contract
+    network: test
+    source:
+      address: "0xCfEB869F69431e42cdB54A4F4f105C19C080A601"
+      abi: Contract
+    mapping:
+      kind: ethereum/events
+      apiVersion: 0.0.5
+      language: wasm/assemblyscript
+      abis:
+        - name: Contract
+          file: ./abis/Contract.abi
+      entities:
+        - Call
+      eventHandlers:
+        - event: Trigger(uint16)
+          handler: handleTrigger
+      file: ./src/mapping.ts
diff --git a/tests/integration-tests/fatal-error/test/test.js b/tests/integration-tests/fatal-error/test/test.js
new file mode 100644
index 0000000..8b561b3
--- /dev/null
+++ b/tests/integration-tests/fatal-error/test/test.js
@@ -0,0 +1,111 @@
+const path = require("path");
+const execSync = require("child_process").execSync;
+const { patching } = require("gluegun");
+const { createApolloFetch } = require("apollo-fetch");
+
+const Contract = artifacts.require("./Contract.sol");
+
+const srcDir = path.join(__dirname, "..");
+
+const indexPort = process.env.GRAPH_NODE_INDEX_PORT || 18030;
+const fetchSubgraphs = createApolloFetch({
+  uri: `http://localhost:${indexPort}/graphql`,
+});
+
+const exec = (cmd) => {
+  try {
+    return execSync(cmd, { cwd: srcDir, stdio: "inherit" });
+  } catch (e) {
+    throw new Error(`Failed to run command \`${cmd}\``);
+  }
+};
+
+const waitForSubgraphToFailWithError = async (blockNumber) =>
+  new Promise((resolve, reject) => {
+    let deadline = Date.now() + 60 * 1000;
+
+    const checkSubgraphFailed = async () => {
+      try {
+        let result = await fetchSubgraphs({
+          query: `{
+            indexingStatusForCurrentVersion(subgraphName: "test/fatal-error") {
+              health
+              entityCount
+              fatalError {
+                block {
+                  number
+                }
+                deterministic
+              }
+
+              # Test that non-fatal errors can be queried
+              nonFatalErrors {
+                handler
+              }
+
+              # Test that the last healthy block can be queried
+              chains {
+                lastHealthyBlock {
+                  number
+                }
+              }
+            }
+          }`,
+        });
+
+        if (result.errors != null) {
+          reject("query contains errors: " + JSON.stringify(result.errors));
+        }
+
+        let status = result.data.indexingStatusForCurrentVersion;
+        if (status.health == "failed") {
+          if (status.fatalError.block.number != blockNumber || status.fatalError.deterministic != true) {
+            reject(
+              new Error(
+                "Subgraph failed with unexpected block number: " +
+                  status.fatalError.block.number
+              )
+            );
+          } else if (status.entityCount != 1) {
+            return reject(new Error("There should be only one entity saved in the database, the Proof of Indexing"));
+          } else {
+            resolve();
+          }
+        } else {
+          throw new Error("reject or retry");
+        }
+      } catch (e) {
+        if (Date.now() > deadline) {
+          reject(new Error(`Timed out waiting for the subgraph to fail`));
+        } else {
+          setTimeout(checkSubgraphFailed, 500);
+        }
+      }
+    };
+
+    setTimeout(checkSubgraphFailed, 0);
+  });
+
+contract("Contract", (accounts) => {
+  // Deploy the subgraph once before all tests
+  before(async () => {
+    // Deploy the contract
+    const contract = await Contract.deployed();
+
+    // Insert its address into subgraph manifest
+    await patching.replace(
+      path.join(srcDir, "subgraph.yaml"),
+      "0x0000000000000000000000000000000000000000",
+      contract.address
+    );
+
+    // Create and deploy the subgraph
+    exec("yarn codegen");
+    exec(`yarn create:test`);
+    exec(`yarn deploy:test`);
+  });
+
+  it("subgraph fails with expected error", async () => {
+    await waitForSubgraphToFailWithError(3);
+  });
+});
diff --git a/tests/integration-tests/fatal-error/truffle.js b/tests/integration-tests/fatal-error/truffle.js
new file mode 100644
index 0000000..55e43cc
--- /dev/null
+++ b/tests/integration-tests/fatal-error/truffle.js
@@ -0,0 +1,22 @@
+require("babel-register");
+require("babel-polyfill");
+
+module.exports = {
+  contracts_directory: "../common",
+  migrations_directory: "../common",
+  contracts_build_directory: "./truffle_output",
+  networks: {
+    test: {
+      host: "localhost",
+      port: process.env.GANACHE_TEST_PORT || 18545,
+      network_id: "*",
+      gas: "100000000000",
+      gasPrice: "1",
+    },
+  },
+  compilers: {
+    solc: {
+      version: "0.8.2"
+    },
+  },
+};
diff --git a/tests/integration-tests/file-data-sources/abis/Contract.abi b/tests/integration-tests/file-data-sources/abis/Contract.abi
new file mode 100644
index 0000000..1e3ec72
--- /dev/null
+++ b/tests/integration-tests/file-data-sources/abis/Contract.abi
@@ -0,0 +1 @@
+[ ]
diff --git a/tests/integration-tests/file-data-sources/package.json b/tests/integration-tests/file-data-sources/package.json
new file mode 100644
index 0000000..7c68f04
--- /dev/null
+++ b/tests/integration-tests/file-data-sources/package.json
@@ -0,0 +1,13 @@
+{
+  "name": "file-data-sources",
+  "version": "0.1.0",
+  "scripts": {
+    "codegen": "graph codegen",
+    "create:test": "graph create test/file-data-sources --node $GRAPH_NODE_ADMIN_URI",
+    "deploy:test": "graph deploy test/file-data-sources --version-label v0.0.1 --ipfs $IPFS_URI --node $GRAPH_NODE_ADMIN_URI"
+  },
+  "devDependencies": {
+    "@graphprotocol/graph-cli": "https://github.com/graphprotocol/graph-cli#main",
+    "@graphprotocol/graph-ts": "https://github.com/graphprotocol/graph-ts#main"
+  }
+}
\ No newline at end of file
diff --git a/tests/integration-tests/file-data-sources/schema.graphql b/tests/integration-tests/file-data-sources/schema.graphql
new file mode 100644
index 0000000..476bce7
--- /dev/null
+++ b/tests/integration-tests/file-data-sources/schema.graphql
@@ -0,0 +1,4 @@
+type IpfsFile @entity {
+  id: ID!
+  content: String!
+}
diff --git a/tests/integration-tests/file-data-sources/src/mapping.ts b/tests/integration-tests/file-data-sources/src/mapping.ts
new file mode 100644
index 0000000..3431f17
--- /dev/null
+++ b/tests/integration-tests/file-data-sources/src/mapping.ts
@@ -0,0 +1,16 @@
+import { ethereum, dataSource, BigInt, Bytes } from '@graphprotocol/graph-ts'
+import { IpfsFile } from '../generated/schema'
+
+export function handleBlock(block: ethereum.Block): void {
+  if (block.number == BigInt.fromI32(0)) {
+    // CID QmVkvoPGi9jvvuxsHDVJDgzPEzagBaWSZRYoRDzU244HjZ is the file
+    // `file-data-sources/abis/Contract.abi` after being processed by graph-cli.
+    dataSource.create("File", ["QmVkvoPGi9jvvuxsHDVJDgzPEzagBaWSZRYoRDzU244HjZ"])
+  }
+}
+
+export function handleFile(data: Bytes): void {
+  let entity = new IpfsFile(dataSource.address().toHexString())
+  entity.content = data.toString()
+  entity.save()
+}
diff --git a/tests/integration-tests/file-data-sources/subgraph.yaml b/tests/integration-tests/file-data-sources/subgraph.yaml
new file mode 100644
index 0000000..d13fefe
--- /dev/null
+++ b/tests/integration-tests/file-data-sources/subgraph.yaml
@@ -0,0 +1,36 @@
+specVersion: 0.0.7
+schema:
+  file: ./schema.graphql
+dataSources:
+  - kind: ethereum/contract
+    name: Contract
+    network: test
+    source:
+      address: "0xCfEB869F69431e42cdB54A4F4f105C19C080A601"
+      abi: Contract
+    mapping:
+      kind: ethereum/events
+      apiVersion: 0.0.7
+      language: wasm/assemblyscript
+      entities:
+        - Gravatar
+      abis:
+        - name: Contract
+          file: ./abis/Contract.abi
+      blockHandlers:
+        - handler: handleBlock
+      file: ./src/mapping.ts
+templates:
+  - kind: file/ipfs
+    name: File
+    mapping:
+      kind: ethereum/events
+      apiVersion: 0.0.7
+      language: wasm/assemblyscript
+      entities:
+        - Gravatar
+      abis:
+        - name: Contract
+          file: ./abis/Contract.abi
+      handler: handleFile
+      file: ./src/mapping.ts
diff --git a/tests/integration-tests/ganache-reverts/abis/Contract.abi b/tests/integration-tests/ganache-reverts/abis/Contract.abi
new file mode 100644
index 0000000..2e766ce
--- /dev/null
+++ b/tests/integration-tests/ganache-reverts/abis/Contract.abi
@@ -0,0 +1,32 @@
+[
+  {
+    "inputs": [],
+    "stateMutability": "nonpayable",
+    "type": "constructor"
+  },
+  {
+    "anonymous": false,
+    "inputs": [],
+    "name": "Trigger",
+    "type": "event"
+  },
+  {
+    "inputs": [
+      {
+        "internalType": "uint256",
+        "name": "value",
+        "type": "uint256"
+      }
+    ],
+    "name": "inc",
+    "outputs": [
+      {
+        "internalType": "uint256",
+        "name": "",
+        "type": "uint256"
+      }
+    ],
+    "stateMutability": "pure",
+    "type": "function"
+  }
+]
diff --git a/tests/integration-tests/ganache-reverts/contracts/Contract.sol b/tests/integration-tests/ganache-reverts/contracts/Contract.sol
new file mode 100644
index 0000000..9fd9c53
--- /dev/null
+++ b/tests/integration-tests/ganache-reverts/contracts/Contract.sol
@@ -0,0 +1,15 @@
+pragma solidity ^0.8.0;
+
+
+contract Contract {
+    event Trigger();
+
+    constructor() public {
+        emit Trigger();
+    }
+
+    function inc(uint256 value) public pure returns (uint256) {
+        require(value < 10, "can only handle values < 10");
+        return value + 1;
+    }
+}
diff --git a/tests/integration-tests/ganache-reverts/contracts/Migrations.sol b/tests/integration-tests/ganache-reverts/contracts/Migrations.sol
new file mode 100644
index 0000000..71f0def
--- /dev/null
+++ b/tests/integration-tests/ganache-reverts/contracts/Migrations.sol
@@ -0,0 +1,24 @@
+pragma solidity ^0.8.0;
+
+
+contract Migrations {
+    address public owner;
+    uint256 public last_completed_migration;
+
+    constructor() public {
+        owner = msg.sender;
+    }
+
+    modifier restricted() {
+        if (msg.sender == owner) _;
+    }
+
+    function setCompleted(uint256 completed) public restricted {
+        last_completed_migration = completed;
+    }
+
+    function upgrade(address new_address) public restricted {
+        Migrations upgraded = Migrations(new_address);
+        upgraded.setCompleted(last_completed_migration);
+    }
+}
diff --git a/tests/integration-tests/ganache-reverts/migrations/1_initial_migration.js b/tests/integration-tests/ganache-reverts/migrations/1_initial_migration.js
new file mode 100644
index 0000000..1eb6f9d
--- /dev/null
+++ b/tests/integration-tests/ganache-reverts/migrations/1_initial_migration.js
@@ -0,0 +1,5 @@
+var Migrations = artifacts.require('./Migrations.sol')
+
+module.exports = function(deployer) {
+  deployer.deploy(Migrations)
+}
diff --git a/tests/integration-tests/ganache-reverts/migrations/2_deploy_contracts.js b/tests/integration-tests/ganache-reverts/migrations/2_deploy_contracts.js
new file mode 100644
index 0000000..ffe0359
--- /dev/null
+++ b/tests/integration-tests/ganache-reverts/migrations/2_deploy_contracts.js
@@ -0,0 +1,5 @@
+const Contract = artifacts.require('./Contract.sol')
+
+module.exports = async function(deployer) {
+  await deployer.deploy(Contract)
+}
diff --git a/tests/integration-tests/ganache-reverts/package.json b/tests/integration-tests/ganache-reverts/package.json
new file mode 100644
index 0000000..dc07d7f
--- /dev/null
+++ b/tests/integration-tests/ganache-reverts/package.json
@@ -0,0 +1,25 @@
+{
+  "name": "ganache-reverts",
+  "version": "0.1.0",
+  "scripts": {
+    "build-contracts": "../common/build-contracts.sh",
+    "codegen": "graph codegen",
+    "test": "yarn build-contracts && truffle test --compile-none --network test",
+    "create:test": "graph create test/ganache-reverts --node $GRAPH_NODE_ADMIN_URI",
+    "deploy:test": "graph deploy test/ganache-reverts --version-label v0.0.1 --ipfs $IPFS_URI --node $GRAPH_NODE_ADMIN_URI"
+  },
+  "devDependencies": {
+    "@graphprotocol/graph-cli": "https://github.com/graphprotocol/graph-cli#main",
+    "@graphprotocol/graph-ts": "https://github.com/graphprotocol/graph-ts#main",
+    "solc": "^0.8.2"
+  },
+  "dependencies": {
+    "@truffle/contract": "^4.3",
+    "@truffle/hdwallet-provider": "^1.2",
+    "apollo-fetch": "^0.7.0",
+    "babel-polyfill": "^6.26.0",
+    "babel-register": "^6.26.0",
+    "gluegun": "^4.6.1",
+    "truffle": "^5.2"
+  }
+}
diff --git a/tests/integration-tests/ganache-reverts/schema.graphql b/tests/integration-tests/ganache-reverts/schema.graphql
new file mode 100644
index 0000000..0599779
--- /dev/null
+++ b/tests/integration-tests/ganache-reverts/schema.graphql
@@ -0,0 +1,5 @@
+type Call @entity {
+  id: ID!
+  reverted: Boolean!
+  returnValue: BigInt
+}
diff --git a/tests/integration-tests/ganache-reverts/src/mapping.ts b/tests/integration-tests/ganache-reverts/src/mapping.ts
new file mode 100644
index 0000000..90c4ed5
--- /dev/null
+++ b/tests/integration-tests/ganache-reverts/src/mapping.ts
@@ -0,0 +1,30 @@
+import { BigInt, Bytes } from '@graphprotocol/graph-ts'
+import { Trigger, Contract } from '../generated/Contract/Contract'
+import { Call } from '../generated/schema'
+
+export function handleTrigger(event: Trigger): void {
+  let contract = Contract.bind(event.address)
+
+  // The contract can only handle numbers < 10, so this call
+  // should revert
+  let call1 = new Call('100')
+  let result1 = contract.try_inc(BigInt.fromI32(100))
+  if (result1.reverted) {
+    call1.reverted = true
+  } else {
+    call1.reverted = false
+    call1.returnValue = result1.value
+  }
+  call1.save()
+
+  // This call should no revert, as the value is < 10
+  let call2 = new Call('9')
+  let result2 = contract.try_inc(BigInt.fromI32(9))
+  if (result2.reverted) {
+    call2.reverted = true
+  } else {
+    call2.reverted = false
+    call2.returnValue = result2.value
+  }
+  call2.save()
+}
diff --git a/tests/integration-tests/ganache-reverts/subgraph.yaml b/tests/integration-tests/ganache-reverts/subgraph.yaml
new file mode 100644
index 0000000..2b3cbfa
--- /dev/null
+++ b/tests/integration-tests/ganache-reverts/subgraph.yaml
@@ -0,0 +1,23 @@
+specVersion: 0.0.2
+schema:
+  file: ./schema.graphql
+dataSources:
+  - kind: ethereum/contract
+    name: Contract
+    network: test
+    source:
+      address: "0xCfEB869F69431e42cdB54A4F4f105C19C080A601"
+      abi: Contract
+    mapping:
+      kind: ethereum/events
+      apiVersion: 0.0.5
+      language: wasm/assemblyscript
+      abis:
+        - name: Contract
+          file: ./abis/Contract.abi
+      entities:
+        - Call
+      eventHandlers:
+        - event: Trigger()
+          handler: handleTrigger
+      file: ./src/mapping.ts
diff --git a/tests/integration-tests/ganache-reverts/test/test.js b/tests/integration-tests/ganache-reverts/test/test.js
new file mode 100644
index 0000000..2f3ad68
--- /dev/null
+++ b/tests/integration-tests/ganache-reverts/test/test.js
@@ -0,0 +1,104 @@
+const path = require('path')
+const execSync = require('child_process').execSync
+const { system, patching } = require('gluegun')
+const { createApolloFetch } = require('apollo-fetch')
+
+const Contract = artifacts.require('./Contract.sol')
+
+const srcDir = path.join(__dirname, '..')
+
+const httpPort = process.env.GRAPH_NODE_HTTP_PORT || 18000;
+const indexPort = process.env.GRAPH_NODE_INDEX_PORT || 18030;
+
+const fetchSubgraphs = createApolloFetch({
+  uri: `http://localhost:${indexPort}/graphql`
+})
+const fetchSubgraph = createApolloFetch({
+  uri: `http://localhost:${httpPort}/subgraphs/name/test/ganache-reverts`
+})
+
+const exec = cmd => {
+  try {
+    return execSync(cmd, { cwd: srcDir, stdio: 'inherit' })
+  } catch (e) {
+    throw new Error(`Failed to run command \`${cmd}\``)
+  }
+}
+
+const waitForSubgraphToBeSynced = async () =>
+  new Promise((resolve, reject) => {
+    // Wait for 60s
+    let deadline = Date.now() + 60 * 1000
+
+    // Function to check if the subgraph is synced
+    const checkSubgraphSynced = async () => {
+      try {
+        let result = await fetchSubgraphs({
+          query: `{ indexingStatuses { synced } }`
+        })
+
+        if (
+          JSON.stringify(result) ===
+          JSON.stringify({ data: { indexingStatuses: [{ synced: true }] } })
+        ) {
+          resolve()
+        } else {
+          throw new Error('reject or retry')
+        }
+      } catch (e) {
+        if (Date.now() > deadline) {
+          reject(new Error(`Timed out waiting for the subgraph to sync`))
+        } else {
+          setTimeout(checkSubgraphSynced, 500)
+        }
+      }
+    }
+
+    // Periodically check whether the subgraph has synced
+    setTimeout(checkSubgraphSynced, 0)
+  })
+
+contract('Contract', accounts => {
+  // Deploy the subgraph once before all tests
+  before(async () => {
+    // Deploy the contract
+    const contract = await Contract.deployed()
+
+    // Insert its address into subgraph manifest
+    await patching.replace(
+      path.join(srcDir, 'subgraph.yaml'),
+      '0x0000000000000000000000000000000000000000',
+      contract.address
+    )
+
+    // Create and deploy the subgraph
+    exec(`yarn codegen`)
+    exec(`yarn create:test`)
+    exec(`yarn deploy:test`)
+
+    // Wait for the subgraph to be indexed
+    await waitForSubgraphToBeSynced()
+  })
+
+  it('all overloads of the contract function are called', async () => {
+    let result = await fetchSubgraph({
+      query: `{ calls(orderBy: id) { id reverted returnValue } }`
+    })
+
+    expect(result.errors).to.be.undefined
+    expect(result.data).to.deep.equal({
+      calls: [
+        {
+          id: '100',
+          reverted: true,
+          returnValue: null
+        },
+        {
+          id: '9',
+          reverted: false,
+          returnValue: '10'
+        }
+      ]
+    })
+  })
+})
diff --git a/tests/integration-tests/ganache-reverts/truffle.js b/tests/integration-tests/ganache-reverts/truffle.js
new file mode 100644
index 0000000..b9e17f8
--- /dev/null
+++ b/tests/integration-tests/ganache-reverts/truffle.js
@@ -0,0 +1,20 @@
+require("babel-register");
+require("babel-polyfill");
+
+module.exports = {
+  contracts_build_directory: "./truffle_output",
+  networks: {
+    test: {
+      host: "localhost",
+      port: process.env.GANACHE_TEST_PORT || 18545,
+      network_id: "*",
+      gas: "100000000000",
+      gasPrice: "1"
+    }
+  },
+  compilers: {
+    solc: {
+      version: "0.8.2"
+    }
+  }
+};
diff --git a/tests/integration-tests/host-exports/abis/Contract.abi b/tests/integration-tests/host-exports/abis/Contract.abi
new file mode 100644
index 0000000..02da1a9
--- /dev/null
+++ b/tests/integration-tests/host-exports/abis/Contract.abi
@@ -0,0 +1,33 @@
+[
+  {
+    "inputs": [],
+    "stateMutability": "nonpayable",
+    "type": "constructor"
+  },
+  {
+    "anonymous": false,
+    "inputs": [
+      {
+        "indexed": false,
+        "internalType": "uint16",
+        "name": "x",
+        "type": "uint16"
+      }
+    ],
+    "name": "Trigger",
+    "type": "event"
+  },
+  {
+    "inputs": [
+      {
+        "internalType": "uint16",
+        "name": "x",
+        "type": "uint16"
+      }
+    ],
+    "name": "emitTrigger",
+    "outputs": [],
+    "stateMutability": "nonpayable",
+    "type": "function"
+  }
+]
diff --git a/tests/integration-tests/host-exports/package.json b/tests/integration-tests/host-exports/package.json
new file mode 100644
index 0000000..082ebe0
--- /dev/null
+++ b/tests/integration-tests/host-exports/package.json
@@ -0,0 +1,25 @@
+{
+  "name": "host-exports",
+  "version": "0.1.0",
+  "scripts": {
+    "build-contracts": "../common/build-contracts.sh",
+    "codegen": "graph codegen",
+    "test": "yarn build-contracts && truffle test --compile-none --network test",
+    "create:test": "graph create test/host-exports --node $GRAPH_NODE_ADMIN_URI",
+    "deploy:test": "graph deploy test/host-exports --version-label v0.0.1 --ipfs $IPFS_URI --node $GRAPH_NODE_ADMIN_URI"
+  },
+  "devDependencies": {
+    "@graphprotocol/graph-cli": "https://github.com/graphprotocol/graph-cli#main",
+    "@graphprotocol/graph-ts": "https://github.com/graphprotocol/graph-ts#main",
+    "solc": "^0.8.2"
+  },
+  "dependencies": {
+    "@truffle/contract": "^4.3",
+    "@truffle/hdwallet-provider": "^1.2",
+    "apollo-fetch": "^0.7.0",
+    "babel-polyfill": "^6.26.0",
+    "babel-register": "^6.26.0",
+    "gluegun": "^4.6.1",
+    "truffle": "^5.2"
+  }
+}
diff --git a/tests/integration-tests/host-exports/schema.graphql b/tests/integration-tests/host-exports/schema.graphql
new file mode 100644
index 0000000..e535647
--- /dev/null
+++ b/tests/integration-tests/host-exports/schema.graphql
@@ -0,0 +1,4 @@
+type Foo @entity {
+  id: ID!
+  value: String!
+}
diff --git a/tests/integration-tests/host-exports/src/mapping.ts b/tests/integration-tests/host-exports/src/mapping.ts
new file mode 100644
index 0000000..1e02d84
--- /dev/null
+++ b/tests/integration-tests/host-exports/src/mapping.ts
@@ -0,0 +1,124 @@
+import { Trigger } from "../generated/Contract/Contract";
+import { Address, BigDecimal, BigInt, ethereum } from "@graphprotocol/graph-ts";
+
+let one = BigDecimal.fromString("1");
+
+export function handleTrigger(event: Trigger): void {
+  testBigDecimal();
+  testEthereumAbi();
+}
+
+function testBigDecimal(): void {
+  // There are 35 digits after the dot.
+  // big_decimal exponent will be: -35 - 6109 = -6144.
+  // Minimum exponent is: -6143.
+  // So 1 digit will be removed, the 8, and the 6 will be rounded to 7.
+  let small = BigDecimal.fromString("0.99999999999999999999999999999999968");
+
+  small.exp -= BigInt.fromI32(6109);
+
+  // Round-trip through the node so it truncates.
+  small = small * new BigDecimal(BigInt.fromI32(1));
+
+  assert(small.exp == BigInt.fromI32(-6143), "wrong exp");
+
+  // This has 33 nines and the 7 which was rounded from 6.
+  assert(
+    small.digits ==
+      BigDecimal.fromString("9999999999999999999999999999999997").digits,
+    "wrong digits " + small.digits.toString()
+  );
+
+  // This has 35 nines, but we round to 34 decimal digits.
+  let big = BigDecimal.fromString("99999999999999999999999999999999999");
+
+  // This has 35 zeros.
+  let rounded = BigDecimal.fromString("100000000000000000000000000000000000");
+
+  assert(big == rounded, "big not equal to rounded");
+
+  // This has 35 eights, but we round to 34 decimal digits.
+  let big2 = BigDecimal.fromString("88888888888888888888888888888888888");
+
+  // This has 33 eights.
+  let rounded2 = BigDecimal.fromString("88888888888888888888888888888888890");
+
+  assert(big2 == rounded2, "big2 not equal to rounded2 " + big2.toString());
+
+  // Test big decimal division.
+  assert(one / BigDecimal.fromString("10") == BigDecimal.fromString("0.1"));
+
+  // Test big int fromString
+  assert(BigInt.fromString("8888") == BigInt.fromI32(8888));
+
+  let bigInt = BigInt.fromString("8888888888888888");
+
+  // Test big int bit or
+  assert(
+    (bigInt | BigInt.fromI32(42)) == BigInt.fromString("8888888888888890")
+  );
+
+  // Test big int bit and
+  assert((bigInt & BigInt.fromI32(42)) == BigInt.fromI32(40));
+
+  // Test big int left shift
+  assert(bigInt << 6 == BigInt.fromString("568888888888888832"));
+
+  // Test big int right shift
+  assert(bigInt >> 6 == BigInt.fromString("138888888888888"));
+}
+
+function testEthereumAbi(): void {
+  ethereumAbiSimpleCase();
+  ethereumAbiComplexCase();
+}
+
+function ethereumAbiSimpleCase(): void {
+  let address = ethereum.Value.fromAddress(Address.fromString("0x0000000000000000000000000000000000000420"));
+
+  let encoded = ethereum.encode(address)!;
+
+  let decoded = ethereum.decode("address", encoded)!;
+
+  assert(address.toAddress() == decoded.toAddress(), "address ethereum encoded does not equal the decoded value");
+}
+
+function ethereumAbiComplexCase(): void {
+  let address = ethereum.Value.fromAddress(Address.fromString("0x0000000000000000000000000000000000000420"));
+  let bigInt1 = ethereum.Value.fromUnsignedBigInt(BigInt.fromI32(62));
+  let bigInt2 = ethereum.Value.fromUnsignedBigInt(BigInt.fromI32(63));
+  let bool = ethereum.Value.fromBoolean(true);
+
+  let fixedSizedArray = ethereum.Value.fromFixedSizedArray([
+    bigInt1,
+    bigInt2
+  ]);
+
+  let tupleArray: Array<ethereum.Value> = [
+    fixedSizedArray,
+    bool
+  ];
+
+  let tuple = ethereum.Value.fromTuple(changetype<ethereum.Tuple>(tupleArray));
+
+  let token: Array<ethereum.Value> = [
+    address,
+    tuple
+  ];
+
+  let encoded = ethereum.encode(ethereum.Value.fromTuple(changetype<ethereum.Tuple>(token)))!;
+
+  let decoded = ethereum.decode("(address,(uint256[2],bool))", encoded)!.toTuple();
+
+  let decodedAddress = decoded[0].toAddress();
+  let decodedTuple = decoded[1].toTuple();
+  let decodedFixedSizedArray = decodedTuple[0].toArray();
+  let decodedBigInt1 = decodedFixedSizedArray[0].toBigInt();
+  let decodedBigInt2 = decodedFixedSizedArray[1].toBigInt();
+  let decodedBool = decodedTuple[1].toBoolean();
+
+  assert(address.toAddress() == decodedAddress, "address ethereum encoded does not equal the decoded value");
+  assert(bigInt1.toBigInt() == decodedBigInt1, "uint256[0] ethereum encoded does not equal the decoded value");
+  assert(bigInt2.toBigInt() == decodedBigInt2, "uint256[1] ethereum encoded does not equal the decoded value");
+  assert(bool.toBoolean() == decodedBool, "boolean ethereum encoded does not equal the decoded value");
+}
diff --git a/tests/integration-tests/host-exports/subgraph.yaml b/tests/integration-tests/host-exports/subgraph.yaml
new file mode 100644
index 0000000..09e3122
--- /dev/null
+++ b/tests/integration-tests/host-exports/subgraph.yaml
@@ -0,0 +1,23 @@
+specVersion: 0.0.2
+schema:
+  file: ./schema.graphql
+dataSources:
+  - kind: ethereum/contract
+    name: Contract
+    network: test
+    source:
+      address: "0xCfEB869F69431e42cdB54A4F4f105C19C080A601"
+      abi: Contract
+    mapping:
+      kind: ethereum/events
+      apiVersion: 0.0.5
+      language: wasm/assemblyscript
+      abis:
+        - name: Contract
+          file: ./abis/Contract.abi
+      entities:
+        - Call
+      eventHandlers:
+        - event: Trigger(uint16)
+          handler: handleTrigger
+      file: ./src/mapping.ts
diff --git a/tests/integration-tests/host-exports/test/test.js b/tests/integration-tests/host-exports/test/test.js
new file mode 100644
index 0000000..fd0e2ee
--- /dev/null
+++ b/tests/integration-tests/host-exports/test/test.js
@@ -0,0 +1,79 @@
+const path = require("path");
+const execSync = require("child_process").execSync;
+const { system, patching } = require("gluegun");
+const { createApolloFetch } = require("apollo-fetch");
+
+const Contract = artifacts.require("./Contract.sol");
+
+const srcDir = path.join(__dirname, "..");
+
+const indexPort = process.env.GRAPH_NODE_INDEX_PORT || 18030;
+
+const fetchSubgraphs = createApolloFetch({
+  uri: `http://localhost:${indexPort}/graphql`,
+});
+
+const exec = (cmd) => {
+  try {
+    return execSync(cmd, { cwd: srcDir, stdio: "inherit" });
+  } catch (e) {
+    throw new Error(`Failed to run command \`${cmd}\``);
+  }
+};
+
+const waitForSubgraphToBeSynced = async () =>
+  new Promise((resolve, reject) => {
+    // Wait for 60s
+    let deadline = Date.now() + 60 * 1000;
+
+    // Function to check if the subgraph is synced
+    const checkSubgraphSynced = async () => {
+      try {
+        let result = await fetchSubgraphs({
+          query: `{ indexingStatuses { synced, health } }`,
+        });
+
+        if (result.data.indexingStatuses[0].synced) {
+          resolve();
+        } else if (result.data.indexingStatuses[0].health != "healthy") {
+          reject(new Error("Subgraph failed"));
+        } else {
+          throw new Error("reject or retry");
+        }
+      } catch (e) {
+        if (Date.now() > deadline) {
+          reject(new Error(`Timed out waiting for the subgraph to sync`));
+        } else {
+          setTimeout(checkSubgraphSynced, 500);
+        }
+      }
+    };
+
+    // Periodically check whether the subgraph has synced
+    setTimeout(checkSubgraphSynced, 0);
+  });
+
+contract("Contract", (accounts) => {
+  // Deploy the subgraph once before all tests
+  before(async () => {
+    // Deploy the contract
+    const contract = await Contract.deployed();
+
+    // Insert its address into subgraph manifest
+    await patching.replace(
+      path.join(srcDir, "subgraph.yaml"),
+      "0x0000000000000000000000000000000000000000",
+      contract.address
+    );
+
+    // Create and deploy the subgraph
+    exec(`yarn codegen`);
+    exec(`yarn create:test`);
+    exec(`yarn deploy:test`);
+  });
+
+  it("subgraph does not fail", async () => {
+    // Wait for the subgraph to be indexed, and not fail
+    await waitForSubgraphToBeSynced();
+  });
+});
diff --git a/tests/integration-tests/host-exports/truffle.js b/tests/integration-tests/host-exports/truffle.js
new file mode 100644
index 0000000..f859622
--- /dev/null
+++ b/tests/integration-tests/host-exports/truffle.js
@@ -0,0 +1,22 @@
+require("babel-register");
+require("babel-polyfill");
+
+module.exports = {
+  contracts_directory: "../common",
+  migrations_directory: "../common",
+  contracts_build_directory: "./truffle_output",
+  networks: {
+    test: {
+      host: "localhost",
+      port: process.env.GANACHE_TEST_PORT || 18545,
+      network_id: "*",
+      gas: "100000000000",
+      gasPrice: "1",
+    },
+  },
+  compilers: {
+    solc: {
+      version: "0.8.2",
+    },
+  },
+};
diff --git a/tests/integration-tests/non-fatal-errors/abis/Contract.abi b/tests/integration-tests/non-fatal-errors/abis/Contract.abi
new file mode 100644
index 0000000..02da1a9
--- /dev/null
+++ b/tests/integration-tests/non-fatal-errors/abis/Contract.abi
@@ -0,0 +1,33 @@
+[
+  {
+    "inputs": [],
+    "stateMutability": "nonpayable",
+    "type": "constructor"
+  },
+  {
+    "anonymous": false,
+    "inputs": [
+      {
+        "indexed": false,
+        "internalType": "uint16",
+        "name": "x",
+        "type": "uint16"
+      }
+    ],
+    "name": "Trigger",
+    "type": "event"
+  },
+  {
+    "inputs": [
+      {
+        "internalType": "uint16",
+        "name": "x",
+        "type": "uint16"
+      }
+    ],
+    "name": "emitTrigger",
+    "outputs": [],
+    "stateMutability": "nonpayable",
+    "type": "function"
+  }
+]
diff --git a/tests/integration-tests/non-fatal-errors/package.json b/tests/integration-tests/non-fatal-errors/package.json
new file mode 100644
index 0000000..0227847
--- /dev/null
+++ b/tests/integration-tests/non-fatal-errors/package.json
@@ -0,0 +1,25 @@
+{
+  "name": "non-fatal-errors",
+  "version": "0.1.0",
+  "scripts": {
+    "build-contracts": "../common/build-contracts.sh",
+    "codegen": "graph codegen",
+    "test": "yarn build-contracts && truffle test --compile-none --network test",
+    "create:test": "graph create test/non-fatal-errors --node $GRAPH_NODE_ADMIN_URI",
+    "deploy:test": "graph deploy test/non-fatal-errors --version-label v0.0.1 --ipfs $IPFS_URI --node $GRAPH_NODE_ADMIN_URI"
+  },
+  "devDependencies": {
+    "@graphprotocol/graph-cli": "https://github.com/graphprotocol/graph-cli#main",
+    "@graphprotocol/graph-ts": "https://github.com/graphprotocol/graph-ts#main",
+    "solc": "^0.8.2"
+  },
+  "dependencies": {
+    "@truffle/contract": "^4.3",
+    "@truffle/hdwallet-provider": "^1.2",
+    "apollo-fetch": "^0.7.0",
+    "babel-polyfill": "^6.26.0",
+    "babel-register": "^6.26.0",
+    "gluegun": "^4.6.1",
+    "truffle": "^5.2"
+  }
+}
diff --git a/tests/integration-tests/non-fatal-errors/schema.graphql b/tests/integration-tests/non-fatal-errors/schema.graphql
new file mode 100644
index 0000000..c77bc05
--- /dev/null
+++ b/tests/integration-tests/non-fatal-errors/schema.graphql
@@ -0,0 +1,3 @@
+type Foo @entity {
+  id: ID!
+}
diff --git a/tests/integration-tests/non-fatal-errors/src/mapping.ts b/tests/integration-tests/non-fatal-errors/src/mapping.ts
new file mode 100644
index 0000000..4812e3f
--- /dev/null
+++ b/tests/integration-tests/non-fatal-errors/src/mapping.ts
@@ -0,0 +1,41 @@
+import {
+  DataSourceContext,
+  Address,
+  dataSource,
+} from "@graphprotocol/graph-ts";
+import { Foo } from "../generated/schema";
+import { ethereum } from "@graphprotocol/graph-ts/chain/ethereum";
+import { Dynamic } from "../generated/templates";
+
+export function handleBlockSuccess(block: ethereum.Block): void {
+  let obj = new Foo("0");
+  obj.save();
+  let context = new DataSourceContext();
+  context.setString("id", "00");
+  Dynamic.createWithContext(
+    changetype<Address>(Address.fromHexString(
+      "0x2E645469f354BB4F5c8a05B3b30A929361cf77eC"
+    )),
+    context
+  );
+}
+
+export function handleBlockError(block: ethereum.Block): void {
+  let obj = new Foo("1");
+  obj.save();
+  let context = new DataSourceContext();
+  context.setString("id", "11");
+  Dynamic.createWithContext(
+    changetype<Address>(Address.fromHexString(
+      "0x3E645469f354BB4F5c8a05B3b30A929361cf77eD"
+    )),
+    context
+  );
+  assert(false);
+}
+
+export function handleBlockTemplate(block: ethereum.Block): void {
+  let id = dataSource.context().getString("id");
+  let obj = new Foo(id);
+  obj.save();
+}
diff --git a/tests/integration-tests/non-fatal-errors/subgraph.yaml b/tests/integration-tests/non-fatal-errors/subgraph.yaml
new file mode 100644
index 0000000..1039ea7
--- /dev/null
+++ b/tests/integration-tests/non-fatal-errors/subgraph.yaml
@@ -0,0 +1,60 @@
+specVersion: 0.0.2
+schema:
+  file: ./schema.graphql
+features:
+  - nonFatalErrors
+dataSources:
+  - kind: ethereum/contract
+    name: Success
+    network: test
+    source:
+      address: "0xCfEB869F69431e42cdB54A4F4f105C19C080A601"
+      abi: Contract
+    mapping:
+      kind: ethereum/events
+      apiVersion: 0.0.5
+      language: wasm/assemblyscript
+      abis:
+        - name: Contract
+          file: ./abis/Contract.abi
+      entities:
+        - Call
+      blockHandlers:
+        - handler: handleBlockSuccess
+      file: ./src/mapping.ts
+  - kind: ethereum/contract
+    name: Error
+    network: test
+    source:
+      address: "0xCfEB869F69431e42cdB54A4F4f105C19C080A601"
+      abi: Contract
+    mapping:
+      kind: ethereum/events
+      apiVersion: 0.0.5
+      language: wasm/assemblyscript
+      abis:
+        - name: Contract
+          file: ./abis/Contract.abi
+      entities:
+        - Call
+      blockHandlers:
+        - handler: handleBlockError
+      file: ./src/mapping.ts
+templates:
+  - kind: ethereum/contract
+    name: Dynamic
+    network: test
+    source:
+      abi: Contract
+    mapping:
+      kind: ethereum/events
+      apiVersion: 0.0.5
+      language: wasm/assemblyscript
+      abis:
+        - name: Contract
+          file: ./abis/Contract.abi
+      entities:
+        - Call
+      blockHandlers:
+        - handler: handleBlockTemplate
+      file: ./src/mapping.ts
diff --git a/tests/integration-tests/non-fatal-errors/test/test.js b/tests/integration-tests/non-fatal-errors/test/test.js
new file mode 100644
index 0000000..1d7a0e4
--- /dev/null
+++ b/tests/integration-tests/non-fatal-errors/test/test.js
@@ -0,0 +1,105 @@
+const path = require("path");
+const execSync = require("child_process").execSync;
+const { system, patching } = require("gluegun");
+const { createApolloFetch } = require("apollo-fetch");
+
+const Contract = artifacts.require("./Contract.sol");
+
+const srcDir = path.join(__dirname, "..");
+
+const httpPort = process.env.GRAPH_NODE_HTTP_PORT || 18000;
+const indexPort = process.env.GRAPH_NODE_INDEX_PORT || 18030;
+
+const fetchSubgraphs = createApolloFetch({
+  uri: `http://localhost:${indexPort}/graphql`,
+});
+const fetchSubgraph = createApolloFetch({
+  uri: `http://localhost:${httpPort}/subgraphs/name/test/non-fatal-errors`,
+});
+
+const exec = (cmd) => {
+  try {
+    return execSync(cmd, { cwd: srcDir, stdio: "inherit" });
+  } catch (e) {
+    throw new Error(`Failed to run command \`${cmd}\``);
+  }
+};
+
+const waitForSubgraphToBeUnhealthy = async () =>
+  new Promise((resolve, reject) => {
+    // Wait for 60s
+    let deadline = Date.now() + 60 * 1000;
+
+    // Function to check if the subgraph is synced
+    const checkSubgraphSynced = async () => {
+      try {
+        let result = await fetchSubgraphs({
+          query: `{ indexingStatuses { synced, health } }`,
+        });
+
+        let health = result.data.indexingStatuses[0].health
+        if (health == "unhealthy") {
+          resolve();
+        } else if (health == "failed") {
+          reject(new Error("Subgraph failed"));
+        } else {
+          throw new Error("reject or retry");
+        }
+      } catch (e) {
+        if (Date.now() > deadline) {
+          reject(new Error(`Timed out waiting for the subgraph to be uhealthy`));
+        } else {
+          setTimeout(checkSubgraphSynced, 500);
+        }
+      }
+    };
+
+    // Periodically check whether the subgraph has synced
+    setTimeout(checkSubgraphSynced, 0);
+  });
+
+contract("Contract", (accounts) => {
+  // Deploy the subgraph once before all tests
+  before(async () => {
+    // Deploy the contract
+    const contract = await Contract.deployed();
+    await contract.emitTrigger(1);
+
+    // Insert its address into subgraph manifest
+    await patching.replace(
+      path.join(srcDir, "subgraph.yaml"),
+      "0x0000000000000000000000000000000000000000",
+      contract.address
+    );
+
+    // Create and deploy the subgraph
+    exec(`yarn codegen`);
+    exec(`yarn create:test`);
+    exec(`yarn deploy:test`);
+
+    // Wait for the subgraph to be indexed
+    await waitForSubgraphToBeUnhealthy();
+  });
+
+  it("only sucessful handler register changes", async () => {
+    let result = await fetchSubgraph({
+      query: `{ foos(orderBy: id, subgraphError: allow) { id } }`,
+    });
+
+    expect(result.errors).to.deep.equal([{
+      "message": "indexing_error"
+    }]);
+
+    // Importantly, "1" and "11" are not present because their handlers erroed.
+    expect(result.data).to.deep.equal({
+      foos: [
+        {
+          id: "0"
+        },
+        {
+          id: "00"
+        },
+      ],
+    });
+  });
+});
diff --git a/tests/integration-tests/non-fatal-errors/truffle.js b/tests/integration-tests/non-fatal-errors/truffle.js
new file mode 100644
index 0000000..f859622
--- /dev/null
+++ b/tests/integration-tests/non-fatal-errors/truffle.js
@@ -0,0 +1,22 @@
+require("babel-register");
+require("babel-polyfill");
+
+module.exports = {
+  contracts_directory: "../common",
+  migrations_directory: "../common",
+  contracts_build_directory: "./truffle_output",
+  networks: {
+    test: {
+      host: "localhost",
+      port: process.env.GANACHE_TEST_PORT || 18545,
+      network_id: "*",
+      gas: "100000000000",
+      gasPrice: "1",
+    },
+  },
+  compilers: {
+    solc: {
+      version: "0.8.2",
+    },
+  },
+};
diff --git a/tests/integration-tests/overloaded-contract-functions/abis/Contract.abi b/tests/integration-tests/overloaded-contract-functions/abis/Contract.abi
new file mode 100644
index 0000000..d3ac09e
--- /dev/null
+++ b/tests/integration-tests/overloaded-contract-functions/abis/Contract.abi
@@ -0,0 +1,70 @@
+[
+  {
+    "inputs": [],
+    "stateMutability": "nonpayable",
+    "type": "constructor"
+  },
+  {
+    "anonymous": false,
+    "inputs": [],
+    "name": "Trigger",
+    "type": "event"
+  },
+  {
+    "inputs": [
+      {
+        "internalType": "bytes32",
+        "name": "",
+        "type": "bytes32"
+      }
+    ],
+    "name": "exampleFunction",
+    "outputs": [
+      {
+        "internalType": "uint256",
+        "name": "",
+        "type": "uint256"
+      }
+    ],
+    "stateMutability": "pure",
+    "type": "function"
+  },
+  {
+    "inputs": [
+      {
+        "internalType": "uint256",
+        "name": "",
+        "type": "uint256"
+      }
+    ],
+    "name": "exampleFunction",
+    "outputs": [
+      {
+        "internalType": "string",
+        "name": "",
+        "type": "string"
+      }
+    ],
+    "stateMutability": "pure",
+    "type": "function"
+  },
+  {
+    "inputs": [
+      {
+        "internalType": "string",
+        "name": "",
+        "type": "string"
+      }
+    ],
+    "name": "exampleFunction",
+    "outputs": [
+      {
+        "internalType": "string",
+        "name": "",
+        "type": "string"
+      }
+    ],
+    "stateMutability": "pure",
+    "type": "function"
+  }
+]
diff --git a/tests/integration-tests/overloaded-contract-functions/contracts/Contract.sol b/tests/integration-tests/overloaded-contract-functions/contracts/Contract.sol
new file mode 100644
index 0000000..770db4b
--- /dev/null
+++ b/tests/integration-tests/overloaded-contract-functions/contracts/Contract.sol
@@ -0,0 +1,21 @@
+pragma solidity ^0.8.0;
+
+contract Contract {
+  event Trigger();
+
+  constructor() public {
+    emit Trigger();
+  }
+
+  function exampleFunction(string memory) public pure returns (string memory) {
+    return "string -> string";
+  }
+
+  function exampleFunction(uint256) public pure returns (string memory) {
+    return "uint256 -> string";
+  }
+
+  function exampleFunction(bytes32) public pure returns (uint256) {
+    return 256;
+  }
+}
diff --git a/tests/integration-tests/overloaded-contract-functions/contracts/Migrations.sol b/tests/integration-tests/overloaded-contract-functions/contracts/Migrations.sol
new file mode 100644
index 0000000..0b571c8
--- /dev/null
+++ b/tests/integration-tests/overloaded-contract-functions/contracts/Migrations.sol
@@ -0,0 +1,23 @@
+pragma solidity ^0.8.0;
+
+contract Migrations {
+  address public owner;
+  uint public last_completed_migration;
+
+  constructor() public {
+    owner = msg.sender;
+  }
+
+  modifier restricted() {
+    if (msg.sender == owner) _;
+  }
+
+  function setCompleted(uint completed) public restricted {
+    last_completed_migration = completed;
+  }
+
+  function upgrade(address new_address) public restricted {
+    Migrations upgraded = Migrations(new_address);
+    upgraded.setCompleted(last_completed_migration);
+  }
+}
diff --git a/tests/integration-tests/overloaded-contract-functions/migrations/1_initial_migration.js b/tests/integration-tests/overloaded-contract-functions/migrations/1_initial_migration.js
new file mode 100644
index 0000000..1eb6f9d
--- /dev/null
+++ b/tests/integration-tests/overloaded-contract-functions/migrations/1_initial_migration.js
@@ -0,0 +1,5 @@
+var Migrations = artifacts.require('./Migrations.sol')
+
+module.exports = function(deployer) {
+  deployer.deploy(Migrations)
+}
diff --git a/tests/integration-tests/overloaded-contract-functions/migrations/2_deploy_contracts.js b/tests/integration-tests/overloaded-contract-functions/migrations/2_deploy_contracts.js
new file mode 100644
index 0000000..ffe0359
--- /dev/null
+++ b/tests/integration-tests/overloaded-contract-functions/migrations/2_deploy_contracts.js
@@ -0,0 +1,5 @@
+const Contract = artifacts.require('./Contract.sol')
+
+module.exports = async function(deployer) {
+  await deployer.deploy(Contract)
+}
diff --git a/tests/integration-tests/overloaded-contract-functions/package.json b/tests/integration-tests/overloaded-contract-functions/package.json
new file mode 100644
index 0000000..e43c3f2
--- /dev/null
+++ b/tests/integration-tests/overloaded-contract-functions/package.json
@@ -0,0 +1,25 @@
+{
+  "name": "overloaded-contract-functions",
+  "version": "0.1.0",
+  "scripts": {
+    "build-contracts": "../common/build-contracts.sh",
+    "codegen": "graph codegen",
+    "test": "yarn build-contracts && truffle test --compile-none --network test",
+    "create:test": "graph create test/overloaded-contract-functions --node $GRAPH_NODE_ADMIN_URI",
+    "deploy:test": "graph deploy test/overloaded-contract-functions --version-label v0.0.1 --ipfs $IPFS_URI --node $GRAPH_NODE_ADMIN_URI"
+  },
+  "devDependencies": {
+    "@graphprotocol/graph-cli": "https://github.com/graphprotocol/graph-cli#main",
+    "@graphprotocol/graph-ts": "https://github.com/graphprotocol/graph-ts#main",
+    "solc": "^0.8.2"
+  },
+  "dependencies": {
+    "@truffle/contract": "^4.3",
+    "@truffle/hdwallet-provider": "^1.2",
+    "apollo-fetch": "^0.7.0",
+    "babel-polyfill": "^6.26.0",
+    "babel-register": "^6.26.0",
+    "gluegun": "^4.6.1",
+    "truffle": "^5.2"
+  }
+}
diff --git a/tests/integration-tests/overloaded-contract-functions/schema.graphql b/tests/integration-tests/overloaded-contract-functions/schema.graphql
new file mode 100644
index 0000000..c4f76dc
--- /dev/null
+++ b/tests/integration-tests/overloaded-contract-functions/schema.graphql
@@ -0,0 +1,4 @@
+type Call @entity {
+  id: ID!
+  value: String!
+}
diff --git a/tests/integration-tests/overloaded-contract-functions/src/mapping.ts b/tests/integration-tests/overloaded-contract-functions/src/mapping.ts
new file mode 100644
index 0000000..191b205
--- /dev/null
+++ b/tests/integration-tests/overloaded-contract-functions/src/mapping.ts
@@ -0,0 +1,21 @@
+import { BigInt, Bytes } from "@graphprotocol/graph-ts";
+import { Trigger, Contract } from "../generated/Contract/Contract";
+import { Call } from "../generated/schema";
+
+export function handleTrigger(event: Trigger): void {
+  let contract = Contract.bind(event.address);
+
+  let call = new Call("bytes32 -> uint256");
+  call.value = contract
+    .exampleFunction(changetype<Bytes>(Bytes.fromHexString("0x1234")))
+    .toString();
+  call.save();
+
+  call = new Call("string -> string");
+  call.value = contract.exampleFunction2("xyz");
+  call.save();
+
+  call = new Call("uint256 -> string");
+  call.value = contract.exampleFunction1(BigInt.fromI32(1));
+  call.save();
+}
diff --git a/tests/integration-tests/overloaded-contract-functions/subgraph.yaml b/tests/integration-tests/overloaded-contract-functions/subgraph.yaml
new file mode 100644
index 0000000..2b3cbfa
--- /dev/null
+++ b/tests/integration-tests/overloaded-contract-functions/subgraph.yaml
@@ -0,0 +1,23 @@
+specVersion: 0.0.2
+schema:
+  file: ./schema.graphql
+dataSources:
+  - kind: ethereum/contract
+    name: Contract
+    network: test
+    source:
+      address: "0xCfEB869F69431e42cdB54A4F4f105C19C080A601"
+      abi: Contract
+    mapping:
+      kind: ethereum/events
+      apiVersion: 0.0.5
+      language: wasm/assemblyscript
+      abis:
+        - name: Contract
+          file: ./abis/Contract.abi
+      entities:
+        - Call
+      eventHandlers:
+        - event: Trigger()
+          handler: handleTrigger
+      file: ./src/mapping.ts
diff --git a/tests/integration-tests/overloaded-contract-functions/test/test.js b/tests/integration-tests/overloaded-contract-functions/test/test.js
new file mode 100644
index 0000000..0b183c0
--- /dev/null
+++ b/tests/integration-tests/overloaded-contract-functions/test/test.js
@@ -0,0 +1,107 @@
+const path = require("path");
+const execSync = require("child_process").execSync;
+const { system, patching } = require("gluegun");
+const { createApolloFetch } = require("apollo-fetch");
+
+const Contract = artifacts.require("./Contract.sol");
+
+const srcDir = path.join(__dirname, "..");
+
+const httpPort = process.env.GRAPH_NODE_HTTP_PORT || 18000;
+const indexPort = process.env.GRAPH_NODE_INDEX_PORT || 18030;
+
+const fetchSubgraphs = createApolloFetch({
+  uri: `http://localhost:${indexPort}/graphql`
+});
+const fetchSubgraph = createApolloFetch({
+  uri:
+    `http://localhost:${httpPort}/subgraphs/name/test/overloaded-contract-functions`
+});
+
+const exec = cmd => {
+  try {
+    return execSync(cmd, { cwd: srcDir, stdio: "inherit" });
+  } catch (e) {
+    throw new Error(`Failed to run command \`${cmd}\``);
+  }
+};
+
+const waitForSubgraphToBeSynced = async () =>
+  new Promise((resolve, reject) => {
+    // Wait for 60s
+    let deadline = Date.now() + 60 * 1000;
+
+    // Function to check if the subgraph is synced
+    const checkSubgraphSynced = async () => {
+      try {
+        let result = await fetchSubgraphs({
+          query: `{ indexingStatuses { synced } }`
+        });
+
+        if (
+          JSON.stringify(result) ===
+          JSON.stringify({ data: { indexingStatuses: [{ synced: true }] } })
+        ) {
+          resolve();
+        } else {
+          throw new Error("reject or retry");
+        }
+      } catch (e) {
+        if (Date.now() > deadline) {
+          reject(new Error(`Timed out waiting for the subgraph to sync`));
+        } else {
+          setTimeout(checkSubgraphSynced, 500);
+        }
+      }
+    };
+
+    // Periodically check whether the subgraph has synced
+    setTimeout(checkSubgraphSynced, 0);
+  });
+
+contract("Contract", accounts => {
+  // Deploy the subgraph once before all tests
+  before(async () => {
+    // Deploy the contract
+    const contract = await Contract.deployed();
+
+    // Insert its address into subgraph manifest
+    await patching.replace(
+      path.join(srcDir, "subgraph.yaml"),
+      "0x0000000000000000000000000000000000000000",
+      contract.address
+    );
+
+    // Create and deploy the subgraph
+    exec(`yarn codegen`);
+    exec(`yarn create:test`);
+    exec(`yarn deploy:test`);
+
+    // Wait for the subgraph to be indexed
+    await waitForSubgraphToBeSynced();
+  });
+
+  it("all overloads of the contract function are called", async () => {
+    let result = await fetchSubgraph({
+      query: `{ calls(orderBy: id) { id value } }`
+    });
+
+    expect(result.errors).to.be.undefined;
+    expect(result.data).to.deep.equal({
+      calls: [
+        {
+          id: "bytes32 -> uint256",
+          value: "256"
+        },
+        {
+          id: "string -> string",
+          value: "string -> string"
+        },
+        {
+          id: "uint256 -> string",
+          value: "uint256 -> string"
+        }
+      ]
+    });
+  });
+});
diff --git a/tests/integration-tests/overloaded-contract-functions/truffle.js b/tests/integration-tests/overloaded-contract-functions/truffle.js
new file mode 100644
index 0000000..b9e17f8
--- /dev/null
+++ b/tests/integration-tests/overloaded-contract-functions/truffle.js
@@ -0,0 +1,20 @@
+require("babel-register");
+require("babel-polyfill");
+
+module.exports = {
+  contracts_build_directory: "./truffle_output",
+  networks: {
+    test: {
+      host: "localhost",
+      port: process.env.GANACHE_TEST_PORT || 18545,
+      network_id: "*",
+      gas: "100000000000",
+      gasPrice: "1"
+    }
+  },
+  compilers: {
+    solc: {
+      version: "0.8.2"
+    }
+  }
+};
diff --git a/tests/integration-tests/package.json b/tests/integration-tests/package.json
new file mode 100644
index 0000000..0932630
--- /dev/null
+++ b/tests/integration-tests/package.json
@@ -0,0 +1,18 @@
+{
+  "private": true,
+  "workspaces": [
+    "api-version-v0-0-4",
+    "data-source-revert",
+    "fatal-error",
+    "ganache-reverts",
+    "host-exports",
+    "non-fatal-errors",
+    "overloaded-contract-functions",
+    "poi-for-failed-subgraph",
+    "remove-then-update",
+    "typename",
+    "value-roundtrip",
+    "dynamic-data-source",
+    "file-data-sources"
+  ]
+}
\ No newline at end of file
diff --git a/tests/integration-tests/poi-for-failed-subgraph/abis/Contract.abi b/tests/integration-tests/poi-for-failed-subgraph/abis/Contract.abi
new file mode 100644
index 0000000..02da1a9
--- /dev/null
+++ b/tests/integration-tests/poi-for-failed-subgraph/abis/Contract.abi
@@ -0,0 +1,33 @@
+[
+  {
+    "inputs": [],
+    "stateMutability": "nonpayable",
+    "type": "constructor"
+  },
+  {
+    "anonymous": false,
+    "inputs": [
+      {
+        "indexed": false,
+        "internalType": "uint16",
+        "name": "x",
+        "type": "uint16"
+      }
+    ],
+    "name": "Trigger",
+    "type": "event"
+  },
+  {
+    "inputs": [
+      {
+        "internalType": "uint16",
+        "name": "x",
+        "type": "uint16"
+      }
+    ],
+    "name": "emitTrigger",
+    "outputs": [],
+    "stateMutability": "nonpayable",
+    "type": "function"
+  }
+]
diff --git a/tests/integration-tests/poi-for-failed-subgraph/package.json b/tests/integration-tests/poi-for-failed-subgraph/package.json
new file mode 100644
index 0000000..70c4ddb
--- /dev/null
+++ b/tests/integration-tests/poi-for-failed-subgraph/package.json
@@ -0,0 +1,25 @@
+{
+  "name": "poi-for-failed-subgraph",
+  "version": "0.1.0",
+  "scripts": {
+    "build-contracts": "../common/build-contracts.sh",
+    "codegen": "graph codegen",
+    "test": "yarn build-contracts && truffle test --compile-none --network test",
+    "create:test": "graph create test/poi-for-failed-subgraph --node $GRAPH_NODE_ADMIN_URI",
+    "deploy:test": "graph deploy test/poi-for-failed-subgraph --version-label v0.0.1 --ipfs $IPFS_URI --node $GRAPH_NODE_ADMIN_URI"
+  },
+  "devDependencies": {
+    "@graphprotocol/graph-cli": "https://github.com/graphprotocol/graph-cli#main",
+    "@graphprotocol/graph-ts": "https://github.com/graphprotocol/graph-ts#main",
+    "solc": "^0.8.2"
+  },
+  "dependencies": {
+    "@truffle/contract": "^4.3",
+    "@truffle/hdwallet-provider": "^1.2",
+    "apollo-fetch": "^0.7.0",
+    "babel-polyfill": "^6.26.0",
+    "babel-register": "^6.26.0",
+    "gluegun": "^4.6.1",
+    "truffle": "^5.2"
+  }
+}
diff --git a/tests/integration-tests/poi-for-failed-subgraph/schema.graphql b/tests/integration-tests/poi-for-failed-subgraph/schema.graphql
new file mode 100644
index 0000000..c4f76dc
--- /dev/null
+++ b/tests/integration-tests/poi-for-failed-subgraph/schema.graphql
@@ -0,0 +1,4 @@
+type Call @entity {
+  id: ID!
+  value: String!
+}
diff --git a/tests/integration-tests/poi-for-failed-subgraph/src/mapping.ts b/tests/integration-tests/poi-for-failed-subgraph/src/mapping.ts
new file mode 100644
index 0000000..64bf535
--- /dev/null
+++ b/tests/integration-tests/poi-for-failed-subgraph/src/mapping.ts
@@ -0,0 +1,14 @@
+import { Trigger } from "../generated/Contract/Contract";
+import { Call } from "../generated/schema"
+
+export function handleTrigger(event: Trigger): void {
+  let call1 = new Call("one")
+  call1.value = "some value"
+  call1.save()
+
+  let call2 = new Call("two")
+  call2.value = "another value"
+  call2.save()
+
+  assert(false)
+}
diff --git a/tests/integration-tests/poi-for-failed-subgraph/subgraph.yaml b/tests/integration-tests/poi-for-failed-subgraph/subgraph.yaml
new file mode 100644
index 0000000..09e3122
--- /dev/null
+++ b/tests/integration-tests/poi-for-failed-subgraph/subgraph.yaml
@@ -0,0 +1,23 @@
+specVersion: 0.0.2
+schema:
+  file: ./schema.graphql
+dataSources:
+  - kind: ethereum/contract
+    name: Contract
+    network: test
+    source:
+      address: "0xCfEB869F69431e42cdB54A4F4f105C19C080A601"
+      abi: Contract
+    mapping:
+      kind: ethereum/events
+      apiVersion: 0.0.5
+      language: wasm/assemblyscript
+      abis:
+        - name: Contract
+          file: ./abis/Contract.abi
+      entities:
+        - Call
+      eventHandlers:
+        - event: Trigger(uint16)
+          handler: handleTrigger
+      file: ./src/mapping.ts
diff --git a/tests/integration-tests/poi-for-failed-subgraph/test/test.js b/tests/integration-tests/poi-for-failed-subgraph/test/test.js
new file mode 100644
index 0000000..42c511e
--- /dev/null
+++ b/tests/integration-tests/poi-for-failed-subgraph/test/test.js
@@ -0,0 +1,156 @@
+const assert = require("assert")
+const path = require("path");
+const execSync = require("child_process").execSync;
+const { patching } = require("gluegun");
+const { createApolloFetch } = require("apollo-fetch");
+
+const Contract = artifacts.require("./Contract.sol");
+
+const srcDir = path.join(__dirname, "..");
+
+const httpPort = process.env.GRAPH_NODE_HTTP_PORT || 18000;
+const indexPort = process.env.GRAPH_NODE_INDEX_PORT || 18030;
+
+const fetchSubgraphs = createApolloFetch({
+  uri: `http://localhost:${indexPort}/graphql`,
+});
+const fetchSubgraph = createApolloFetch({
+  uri: `http://localhost:${httpPort}/subgraphs/name/test/poi-for-failed-subgraph`,
+});
+
+const fetchIndexingStatuses = subgraphName => fetchSubgraphs({
+  query: `{
+    indexingStatusesForSubgraphName(subgraphName: "${subgraphName}") {
+      subgraph
+      health
+      entityCount
+      chains {
+        network
+        latestBlock { number hash }
+      }
+    }
+  }`,
+})
+
+const fetchProofOfIndexing = ({ deploymentId, latestBlock }) => fetchSubgraphs({
+  query: `{
+    proofOfIndexing(
+      subgraph: "${deploymentId}",
+      blockNumber: ${latestBlock.number},
+      blockHash: "${latestBlock.hash}"
+    )
+  }`,
+})
+
+const fetchEntityCalls = () => fetchSubgraph({
+  query: `{
+    calls {
+      id
+      value
+    }
+  }`,
+})
+
+const exec = (cmd) => {
+  try {
+    return execSync(cmd, { cwd: srcDir, stdio: "inherit" });
+  } catch (e) {
+    throw new Error(`Failed to run command \`${cmd}\``);
+  }
+};
+
+const waitForSubgraphToFailWithError = async (blockNumber) =>
+  new Promise((resolve, reject) => {
+    let deadline = Date.now() + 60 * 1000;
+
+    const checkSubgraphFailedWithPoI = async () => {
+      try {
+        // Step necessary to get:
+        // - last block hash
+        // - last block number
+        // - subgraph deployment id
+        // So we can query the PoI later.
+        let statusesResult = await fetchIndexingStatuses("test/poi-for-failed-subgraph");
+
+        if (statusesResult.errors != null) {
+          reject("query contains errors: " + JSON.stringify(statusesResult.errors));
+        }
+
+        let statuses = statusesResult.data.indexingStatusesForSubgraphName;
+
+        assert(
+          statuses.length === 1,
+          `There should be only one subgraph with the provided name, found ${statuses.length} instead`
+        )
+
+        let status = statuses[0]
+
+        // Get Calls that the mappings tried to save before the DeterministicError happened.
+        let callsResult = await fetchEntityCalls()
+
+        let callsCount = (callsResult.data && callsResult.data.calls && callsResult.data.calls.length) || 0
+
+        if (callsCount !== 0) {
+          return reject(new Error("No entity besides the Proof of Indexing should be able to be stored"));
+        }
+
+        // Need to have failed since mappings have an `assert(false)`.
+        if (status.health === "failed") {
+          // Find latest block for the correct chain (we only use one)
+          let { latestBlock } = status.chains.find(({ network }) => network === "test")
+
+          let poiResult = await fetchProofOfIndexing({
+            deploymentId: status.subgraph,
+            latestBlock,
+          })
+
+          let hasPoI = poiResult.data && poiResult.data.proofOfIndexing != null
+          let hasOnlyOneEntityInTheDatabase = status.entityCount == 1
+
+          if (!hasPoI) {
+            return reject(new Error("Failed subgraph should have Proof of Indexing for block"));
+          } else if (!hasOnlyOneEntityInTheDatabase) {
+            // 1 instead of 3, which would happen if both 'Call' entities were saved in the database (look at src/mapping.ts)
+            return reject(new Error("Proof of Indexing returned, but it's not saved into the database"));
+          } else {
+            return resolve();
+          }
+        } else {
+          throw new Error("reject or retry");
+        }
+      } catch (e) {
+        if (Date.now() > deadline) {
+          return reject(new Error(`Timed out waiting for the subgraph to fail`));
+        } else {
+          setTimeout(checkSubgraphFailedWithPoI, 500);
+        }
+      }
+    };
+
+    setTimeout(checkSubgraphFailedWithPoI, 0);
+  });
+
+contract("Contract", (accounts) => {
+  // Deploy the subgraph once before all tests
+  before(async () => {
+    // Deploy the contract
+    const contract = await Contract.deployed();
+    await contract.emitTrigger(1);
+
+    // Insert its address into subgraph manifest
+    await patching.replace(
+      path.join(srcDir, "subgraph.yaml"),
+      "0x0000000000000000000000000000000000000000",
+      contract.address
+    );
+
+    // Create and deploy the subgraph
+    exec("yarn codegen");
+    exec(`yarn create:test`);
+    exec(`yarn deploy:test`);
+  });
+
+  it("subgraph fails with expected error", async () => {
+    await waitForSubgraphToFailWithError(3);
+  });
+});
diff --git a/tests/integration-tests/poi-for-failed-subgraph/truffle.js b/tests/integration-tests/poi-for-failed-subgraph/truffle.js
new file mode 100644
index 0000000..55e43cc
--- /dev/null
+++ b/tests/integration-tests/poi-for-failed-subgraph/truffle.js
@@ -0,0 +1,22 @@
+require("babel-register");
+require("babel-polyfill");
+
+module.exports = {
+  contracts_directory: "../common",
+  migrations_directory: "../common",
+  contracts_build_directory: "./truffle_output",
+  networks: {
+    test: {
+      host: "localhost",
+      port: process.env.GANACHE_TEST_PORT || 18545,
+      network_id: "*",
+      gas: "100000000000",
+      gasPrice: "1",
+    },
+  },
+  compilers: {
+    solc: {
+      version: "0.8.2"
+    },
+  },
+};
diff --git a/tests/integration-tests/remove-then-update/abis/Contract.abi b/tests/integration-tests/remove-then-update/abis/Contract.abi
new file mode 100644
index 0000000..02da1a9
--- /dev/null
+++ b/tests/integration-tests/remove-then-update/abis/Contract.abi
@@ -0,0 +1,33 @@
+[
+  {
+    "inputs": [],
+    "stateMutability": "nonpayable",
+    "type": "constructor"
+  },
+  {
+    "anonymous": false,
+    "inputs": [
+      {
+        "indexed": false,
+        "internalType": "uint16",
+        "name": "x",
+        "type": "uint16"
+      }
+    ],
+    "name": "Trigger",
+    "type": "event"
+  },
+  {
+    "inputs": [
+      {
+        "internalType": "uint16",
+        "name": "x",
+        "type": "uint16"
+      }
+    ],
+    "name": "emitTrigger",
+    "outputs": [],
+    "stateMutability": "nonpayable",
+    "type": "function"
+  }
+]
diff --git a/tests/integration-tests/remove-then-update/package.json b/tests/integration-tests/remove-then-update/package.json
new file mode 100644
index 0000000..2547745
--- /dev/null
+++ b/tests/integration-tests/remove-then-update/package.json
@@ -0,0 +1,25 @@
+{
+  "name": "remove-then-update",
+  "version": "0.1.0",
+  "scripts": {
+    "build-contracts": "../common/build-contracts.sh",
+    "codegen": "graph codegen",
+    "test": "yarn build-contracts && truffle test --compile-none --network test",
+    "create:test": "graph create test/remove-then-update --node $GRAPH_NODE_ADMIN_URI",
+    "deploy:test": "graph deploy test/remove-then-update --version-label v0.0.1 --ipfs $IPFS_URI --node $GRAPH_NODE_ADMIN_URI"
+  },
+  "devDependencies": {
+    "@graphprotocol/graph-cli": "https://github.com/graphprotocol/graph-cli#main",
+    "@graphprotocol/graph-ts": "https://github.com/graphprotocol/graph-ts#main",
+    "solc": "^0.8.2"
+  },
+  "dependencies": {
+    "@truffle/contract": "^4.3",
+    "@truffle/hdwallet-provider": "^1.2",
+    "apollo-fetch": "^0.7.0",
+    "babel-polyfill": "^6.26.0",
+    "babel-register": "^6.26.0",
+    "gluegun": "^4.6.1",
+    "truffle": "^5.2"
+  }
+}
diff --git a/tests/integration-tests/remove-then-update/schema.graphql b/tests/integration-tests/remove-then-update/schema.graphql
new file mode 100644
index 0000000..3e3de31
--- /dev/null
+++ b/tests/integration-tests/remove-then-update/schema.graphql
@@ -0,0 +1,5 @@
+type Foo @entity {
+  id: ID!
+  value: String
+  removed: Boolean!
+}
diff --git a/tests/integration-tests/remove-then-update/src/mapping.ts b/tests/integration-tests/remove-then-update/src/mapping.ts
new file mode 100644
index 0000000..9c1e7a6
--- /dev/null
+++ b/tests/integration-tests/remove-then-update/src/mapping.ts
@@ -0,0 +1,25 @@
+import { BigInt, Bytes, store } from "@graphprotocol/graph-ts";
+import { Trigger } from "../generated/Contract/Contract";
+import { Foo } from "../generated/schema";
+
+export function handleTrigger(event: Trigger): void {
+  if (event.params.x == 0) {
+    create();
+  } else if (event.params.x == 1) {
+    store.remove("Foo", "0");
+
+    let obj = new Foo("0");
+    obj.removed = true;
+    obj.save();
+
+    obj = <Foo>Foo.load("0");
+    assert(obj.value == null);
+  }
+}
+
+function create(): void {
+  let obj = new Foo("0");
+  obj.value = "bla";
+  obj.removed = false;
+  obj.save();
+}
diff --git a/tests/integration-tests/remove-then-update/subgraph.yaml b/tests/integration-tests/remove-then-update/subgraph.yaml
new file mode 100644
index 0000000..09e3122
--- /dev/null
+++ b/tests/integration-tests/remove-then-update/subgraph.yaml
@@ -0,0 +1,23 @@
+specVersion: 0.0.2
+schema:
+  file: ./schema.graphql
+dataSources:
+  - kind: ethereum/contract
+    name: Contract
+    network: test
+    source:
+      address: "0xCfEB869F69431e42cdB54A4F4f105C19C080A601"
+      abi: Contract
+    mapping:
+      kind: ethereum/events
+      apiVersion: 0.0.5
+      language: wasm/assemblyscript
+      abis:
+        - name: Contract
+          file: ./abis/Contract.abi
+      entities:
+        - Call
+      eventHandlers:
+        - event: Trigger(uint16)
+          handler: handleTrigger
+      file: ./src/mapping.ts
diff --git a/tests/integration-tests/remove-then-update/test/test.js b/tests/integration-tests/remove-then-update/test/test.js
new file mode 100644
index 0000000..ea1c4e7
--- /dev/null
+++ b/tests/integration-tests/remove-then-update/test/test.js
@@ -0,0 +1,99 @@
+const path = require("path");
+const execSync = require("child_process").execSync;
+const { system, patching } = require("gluegun");
+const { createApolloFetch } = require("apollo-fetch");
+
+const Contract = artifacts.require("./Contract.sol");
+
+const srcDir = path.join(__dirname, "..");
+
+const httpPort = process.env.GRAPH_NODE_HTTP_PORT || 18000;
+const indexPort = process.env.GRAPH_NODE_INDEX_PORT || 18030;
+
+const fetchSubgraphs = createApolloFetch({
+  uri: `http://localhost:${indexPort}/graphql`,
+});
+const fetchSubgraph = createApolloFetch({
+  uri: `http://localhost:${httpPort}/subgraphs/name/test/remove-then-update`,
+});
+
+const exec = (cmd) => {
+  try {
+    return execSync(cmd, { cwd: srcDir, stdio: "inherit" });
+  } catch (e) {
+    throw new Error(`Failed to run command \`${cmd}\``);
+  }
+};
+
+const waitForSubgraphToBeSynced = async () =>
+  new Promise((resolve, reject) => {
+    // Wait for 60s
+    let deadline = Date.now() + 60 * 1000;
+
+    // Function to check if the subgraph is synced
+    const checkSubgraphSynced = async () => {
+      try {
+        let result = await fetchSubgraphs({
+          query: `{ indexingStatuses { synced, health } }`,
+        });
+
+        if (result.data.indexingStatuses[0].synced) {
+          resolve();
+        } else if (result.data.indexingStatuses[0].health != "healthy") {
+          reject(new Error("Subgraph failed"));
+        } else {
+          throw new Error("reject or retry");
+        }
+      } catch (e) {
+        if (Date.now() > deadline) {
+          reject(new Error(`Timed out waiting for the subgraph to sync`));
+        } else {
+          setTimeout(checkSubgraphSynced, 500);
+        }
+      }
+    };
+
+    // Periodically check whether the subgraph has synced
+    setTimeout(checkSubgraphSynced, 0);
+  });
+
+contract("Contract", (accounts) => {
+  // Deploy the subgraph once before all tests
+  before(async () => {
+    // Deploy the contract
+    const contract = await Contract.deployed();
+    await contract.emitTrigger(1);
+
+    // Insert its address into subgraph manifest
+    await patching.replace(
+      path.join(srcDir, "subgraph.yaml"),
+      "0x0000000000000000000000000000000000000000",
+      contract.address
+    );
+
+    // Create and deploy the subgraph
+    exec(`yarn codegen`);
+    exec(`yarn create:test`);
+    exec(`yarn deploy:test`);
+
+    // Wait for the subgraph to be indexed
+    await waitForSubgraphToBeSynced();
+  });
+
+  it("all overloads of the contract function are called", async () => {
+    let result = await fetchSubgraph({
+      query: `{ foos(orderBy: id) { id value removed } }`,
+    });
+
+    expect(result.errors).to.be.undefined;
+    expect(result.data).to.deep.equal({
+      foos: [
+        {
+          id: "0",
+          removed: true,
+          value: null,
+        },
+      ],
+    });
+  });
+});
diff --git a/tests/integration-tests/remove-then-update/truffle.js b/tests/integration-tests/remove-then-update/truffle.js
new file mode 100644
index 0000000..f859622
--- /dev/null
+++ b/tests/integration-tests/remove-then-update/truffle.js
@@ -0,0 +1,22 @@
+require("babel-register");
+require("babel-polyfill");
+
+module.exports = {
+  contracts_directory: "../common",
+  migrations_directory: "../common",
+  contracts_build_directory: "./truffle_output",
+  networks: {
+    test: {
+      host: "localhost",
+      port: process.env.GANACHE_TEST_PORT || 18545,
+      network_id: "*",
+      gas: "100000000000",
+      gasPrice: "1",
+    },
+  },
+  compilers: {
+    solc: {
+      version: "0.8.2",
+    },
+  },
+};
diff --git a/tests/integration-tests/typename/abis/Contract.abi b/tests/integration-tests/typename/abis/Contract.abi
new file mode 100644
index 0000000..02da1a9
--- /dev/null
+++ b/tests/integration-tests/typename/abis/Contract.abi
@@ -0,0 +1,33 @@
+[
+  {
+    "inputs": [],
+    "stateMutability": "nonpayable",
+    "type": "constructor"
+  },
+  {
+    "anonymous": false,
+    "inputs": [
+      {
+        "indexed": false,
+        "internalType": "uint16",
+        "name": "x",
+        "type": "uint16"
+      }
+    ],
+    "name": "Trigger",
+    "type": "event"
+  },
+  {
+    "inputs": [
+      {
+        "internalType": "uint16",
+        "name": "x",
+        "type": "uint16"
+      }
+    ],
+    "name": "emitTrigger",
+    "outputs": [],
+    "stateMutability": "nonpayable",
+    "type": "function"
+  }
+]
diff --git a/tests/integration-tests/typename/package.json b/tests/integration-tests/typename/package.json
new file mode 100644
index 0000000..ee6d5e7
--- /dev/null
+++ b/tests/integration-tests/typename/package.json
@@ -0,0 +1,13 @@
+{
+  "name": "typename",
+  "version": "0.1.0",
+  "scripts": {
+    "codegen": "graph codegen",
+    "create:test": "graph create test/typename --node $GRAPH_NODE_ADMIN_URI",
+    "deploy:test": "graph deploy test/typename --version-label v0.0.1 --ipfs $IPFS_URI --node $GRAPH_NODE_ADMIN_URI"
+  },
+  "devDependencies": {
+    "@graphprotocol/graph-cli": "https://github.com/graphprotocol/graph-cli#main",
+    "@graphprotocol/graph-ts": "https://github.com/graphprotocol/graph-ts#main"
+  }
+}
diff --git a/tests/integration-tests/typename/schema.graphql b/tests/integration-tests/typename/schema.graphql
new file mode 100644
index 0000000..caa2191
--- /dev/null
+++ b/tests/integration-tests/typename/schema.graphql
@@ -0,0 +1,3 @@
+type ExampleEntity @entity {
+  id: ID!
+}
diff --git a/tests/integration-tests/typename/src/mapping.ts b/tests/integration-tests/typename/src/mapping.ts
new file mode 100644
index 0000000..2e2b525
--- /dev/null
+++ b/tests/integration-tests/typename/src/mapping.ts
@@ -0,0 +1,22 @@
+import { ethereum, BigInt } from "@graphprotocol/graph-ts";
+import { ExampleEntity } from "../generated/schema";
+
+export function handleBlock(block: ethereum.Block): void {
+  // At Block 0, we create the Entity.
+  if (block.number == BigInt.fromI32(0)) {
+    let example = new ExampleEntity("1234");
+    example.save();
+    assert(example.get("__typename") == null, "__typename should be null");
+  // At Block 2, we merge the previously created Entity.
+  // Obs: Block 1 there was a reorg, we do nothing and wait the Entity cache to clear.
+  } else if (block.number == BigInt.fromI32(2)) {
+    let example = new ExampleEntity("1234");
+    example.save();
+    assert(example.get("__typename") == null, "__typename should still be null");
+  // At Block 3, we load the merged Entity, which should NOT bring
+  // the __typename field.
+  } else if (block.number == BigInt.fromI32(3)) {
+    let example = ExampleEntity.load("1234")!;
+    assert(example.get("__typename") == null, "__typename should still be null");
+  }
+}
diff --git a/tests/integration-tests/typename/subgraph.yaml b/tests/integration-tests/typename/subgraph.yaml
new file mode 100644
index 0000000..cc95116
--- /dev/null
+++ b/tests/integration-tests/typename/subgraph.yaml
@@ -0,0 +1,25 @@
+specVersion: 0.0.4
+repository: https://github.com/graphprotocol/example-subgraph
+schema:
+  file: ./schema.graphql
+features:
+  - nonFatalErrors
+dataSources:
+  - kind: ethereum/contract
+    name: Contract
+    network: test
+    source:
+      address: "0xCfEB869F69431e42cdB54A4F4f105C19C080A601"
+      abi: Contract
+    mapping:
+      kind: ethereum/events
+      apiVersion: 0.0.5
+      language: wasm/assemblyscript
+      entities:
+        - ExampleEntity
+      abis:
+        - name: Contract
+          file: ./abis/Contract.abi
+      blockHandlers:
+        - handler: handleBlock
+      file: ./src/mapping.ts
diff --git a/tests/integration-tests/value-roundtrip/abis/Contract.abi b/tests/integration-tests/value-roundtrip/abis/Contract.abi
new file mode 100644
index 0000000..02da1a9
--- /dev/null
+++ b/tests/integration-tests/value-roundtrip/abis/Contract.abi
@@ -0,0 +1,33 @@
+[
+  {
+    "inputs": [],
+    "stateMutability": "nonpayable",
+    "type": "constructor"
+  },
+  {
+    "anonymous": false,
+    "inputs": [
+      {
+        "indexed": false,
+        "internalType": "uint16",
+        "name": "x",
+        "type": "uint16"
+      }
+    ],
+    "name": "Trigger",
+    "type": "event"
+  },
+  {
+    "inputs": [
+      {
+        "internalType": "uint16",
+        "name": "x",
+        "type": "uint16"
+      }
+    ],
+    "name": "emitTrigger",
+    "outputs": [],
+    "stateMutability": "nonpayable",
+    "type": "function"
+  }
+]
diff --git a/tests/integration-tests/value-roundtrip/package.json b/tests/integration-tests/value-roundtrip/package.json
new file mode 100644
index 0000000..b8d2f4b
--- /dev/null
+++ b/tests/integration-tests/value-roundtrip/package.json
@@ -0,0 +1,25 @@
+{
+  "name": "value-roundtrip",
+  "version": "0.1.0",
+  "scripts": {
+    "build-contracts": "../common/build-contracts.sh",
+    "codegen": "graph codegen",
+    "test": "yarn build-contracts && truffle test --compile-none --network test",
+    "create:test": "graph create test/value-roundtrip --node $GRAPH_NODE_ADMIN_URI",
+    "deploy:test": "graph deploy test/value-roundtrip --version-label v0.0.1 --ipfs $IPFS_URI --node $GRAPH_NODE_ADMIN_URI"
+  },
+  "devDependencies": {
+    "@graphprotocol/graph-cli": "https://github.com/graphprotocol/graph-cli#main",
+    "@graphprotocol/graph-ts": "https://github.com/graphprotocol/graph-ts#main",
+    "solc": "^0.8.2"
+  },
+  "dependencies": {
+    "@truffle/contract": "^4.3",
+    "@truffle/hdwallet-provider": "^1.2",
+    "apollo-fetch": "^0.7.0",
+    "babel-polyfill": "^6.26.0",
+    "babel-register": "^6.26.0",
+    "gluegun": "^4.6.1",
+    "truffle": "^5.2"
+  }
+}
diff --git a/tests/integration-tests/value-roundtrip/schema.graphql b/tests/integration-tests/value-roundtrip/schema.graphql
new file mode 100644
index 0000000..e535647
--- /dev/null
+++ b/tests/integration-tests/value-roundtrip/schema.graphql
@@ -0,0 +1,4 @@
+type Foo @entity {
+  id: ID!
+  value: String!
+}
diff --git a/tests/integration-tests/value-roundtrip/src/mapping.ts b/tests/integration-tests/value-roundtrip/src/mapping.ts
new file mode 100644
index 0000000..dc227e4
--- /dev/null
+++ b/tests/integration-tests/value-roundtrip/src/mapping.ts
@@ -0,0 +1,12 @@
+import { Trigger } from "../generated/Contract/Contract";
+import { Foo } from "../generated/schema";
+
+export function handleTrigger(event: Trigger): void {
+  let obj = new Foo("0");
+  obj.value = "b\u0000la\u0000";
+  obj.save();
+
+  // Null characters are stripped.
+  obj = <Foo>Foo.load("0");
+  assert(obj.value == "bla", "nulls not stripped");
+}
diff --git a/tests/integration-tests/value-roundtrip/subgraph.yaml b/tests/integration-tests/value-roundtrip/subgraph.yaml
new file mode 100644
index 0000000..09e3122
--- /dev/null
+++ b/tests/integration-tests/value-roundtrip/subgraph.yaml
@@ -0,0 +1,23 @@
+specVersion: 0.0.2
+schema:
+  file: ./schema.graphql
+dataSources:
+  - kind: ethereum/contract
+    name: Contract
+    network: test
+    source:
+      address: "0xCfEB869F69431e42cdB54A4F4f105C19C080A601"
+      abi: Contract
+    mapping:
+      kind: ethereum/events
+      apiVersion: 0.0.5
+      language: wasm/assemblyscript
+      abis:
+        - name: Contract
+          file: ./abis/Contract.abi
+      entities:
+        - Call
+      eventHandlers:
+        - event: Trigger(uint16)
+          handler: handleTrigger
+      file: ./src/mapping.ts
diff --git a/tests/integration-tests/value-roundtrip/test/test.js b/tests/integration-tests/value-roundtrip/test/test.js
new file mode 100644
index 0000000..d8247d9
--- /dev/null
+++ b/tests/integration-tests/value-roundtrip/test/test.js
@@ -0,0 +1,102 @@
+const path = require("path");
+const execSync = require("child_process").execSync;
+const { system, patching } = require("gluegun");
+const { createApolloFetch } = require("apollo-fetch");
+
+const Contract = artifacts.require("./Contract.sol");
+
+const srcDir = path.join(__dirname, "..");
+
+const httpPort = process.env.GRAPH_NODE_HTTP_PORT || 18000;
+const indexPort = process.env.GRAPH_NODE_INDEX_PORT || 18030;
+
+const fetchSubgraphs = createApolloFetch({
+  uri: `http://localhost:${indexPort}/graphql`,
+});
+const fetchSubgraph = createApolloFetch({
+  uri: `http://localhost:${httpPort}/subgraphs/name/test/value-roundtrip`,
+});
+
+const exec = (cmd) => {
+  try {
+    return execSync(cmd, { cwd: srcDir, stdio: "inherit" });
+  } catch (e) {
+    throw new Error(`Failed to run command \`${cmd}\``);
+  }
+};
+
+const waitForSubgraphToBeSynced = async () =>
+  new Promise((resolve, reject) => {
+    // Wait for 60s
+    let deadline = Date.now() + 60 * 1000;
+
+    // Function to check if the subgraph is synced
+    const checkSubgraphSynced = async () => {
+      try {
+        let result = await fetchSubgraphs({
+          query: `{ indexingStatuses { synced, health } }`,
+        });
+
+        if (result.data.indexingStatuses[0].synced) {
+          resolve();
+        } else if (result.data.indexingStatuses[0].health != "healthy") {
+          reject(new Error("Subgraph failed"));
+        } else {
+          throw new Error("reject or retry");
+        }
+      } catch (e) {
+        if (Date.now() > deadline) {
+          reject(new Error(`Timed out waiting for the subgraph to sync`));
+        } else {
+          setTimeout(checkSubgraphSynced, 500);
+        }
+      }
+    };
+
+    // Periodically check whether the subgraph has synced
+    setTimeout(checkSubgraphSynced, 0);
+  });
+
+contract("Contract", (accounts) => {
+  // Deploy the subgraph once before all tests
+  before(async () => {
+    // Deploy the contract
+    const contract = await Contract.deployed();
+
+    // Insert its address into subgraph manifest
+    await patching.replace(
+      path.join(srcDir, "subgraph.yaml"),
+      "0x0000000000000000000000000000000000000000",
+      contract.address
+    );
+
+    // Create and deploy the subgraph
+    exec(`yarn codegen`);
+    exec(`yarn create:test`);
+    exec(`yarn deploy:test`);
+
+    // Wait for the subgraph to be indexed
+    await waitForSubgraphToBeSynced();
+  });
+
+  it("test query", async () => {
+    // Also test that multiple block constraints do not result in a graphql error.
+    let result = await fetchSubgraph({
+      query: `{
+        foos_0: foos(orderBy: id, block: { number: 0 }) { id }
+        foos(orderBy: id) { id value }
+      }`,
+    });
+
+    expect(result.errors).to.be.undefined;
+    expect(result.data).to.deep.equal({
+      foos_0: [],
+      foos: [
+        {
+          id: "0",
+          value: "bla",
+        },
+      ],
+    });
+  });
+});
diff --git a/tests/integration-tests/value-roundtrip/truffle.js b/tests/integration-tests/value-roundtrip/truffle.js
new file mode 100644
index 0000000..83606ff
--- /dev/null
+++ b/tests/integration-tests/value-roundtrip/truffle.js
@@ -0,0 +1,22 @@
+require("babel-register");
+require("babel-polyfill");
+
+module.exports = {
+  contracts_directory: "../common",
+  migrations_directory: "../common",
+  contracts_build_directory: "./truffle_output",
+  networks: {
+    test: {
+      host: "localhost",
+      port: process.env.GANACHE_TEST_PORT || 18545,
+      network_id: "*",
+      gas: "100000000000",
+      gasPrice: "1"
+    }
+  },
+  compilers: {
+    solc: {
+      version: "0.8.2"
+    }
+  }
+};
diff --git a/tests/src/fixture.rs b/tests/src/fixture.rs
new file mode 100644
index 0000000..949b3f5
--- /dev/null
+++ b/tests/src/fixture.rs
@@ -0,0 +1,536 @@
+pub mod ethereum;
+
+use std::marker::PhantomData;
+use std::process::Command;
+use std::sync::Mutex;
+use std::time::Duration;
+
+use crate::helpers::run_cmd;
+use anyhow::Error;
+use async_stream::stream;
+use futures::{Stream, StreamExt};
+use graph::blockchain::block_stream::{
+    BlockStream, BlockStreamBuilder, BlockStreamEvent, BlockWithTriggers, FirehoseCursor,
+};
+use graph::blockchain::{
+    Block, BlockHash, BlockPtr, Blockchain, BlockchainMap, ChainIdentifier, RuntimeAdapter,
+    TriggersAdapter, TriggersAdapterSelector,
+};
+use graph::cheap_clone::CheapClone;
+use graph::components::store::{BlockStore, DeploymentLocator};
+use graph::data::graphql::effort::LoadManager;
+use graph::data::query::{Query, QueryTarget};
+use graph::env::EnvVars;
+use graph::ipfs_client::IpfsClient;
+use graph::prelude::ethabi::ethereum_types::H256;
+use graph::prelude::{
+    async_trait, r, ApiVersion, BlockNumber, DeploymentHash, GraphQlRunner as _, LoggerFactory,
+    MetricsRegistry, NodeId, QueryError, SubgraphAssignmentProvider, SubgraphName,
+    SubgraphRegistrar, SubgraphStore as _, SubgraphVersionSwitchingMode,
+};
+use graph::slog::crit;
+use graph_core::polling_monitor::ipfs_service::IpfsService;
+use graph_core::{
+    LinkResolver, SubgraphAssignmentProvider as IpfsSubgraphAssignmentProvider,
+    SubgraphInstanceManager, SubgraphRegistrar as IpfsSubgraphRegistrar,
+};
+use graph_graphql::prelude::GraphQlRunner;
+use graph_mock::MockMetricsRegistry;
+use graph_node::manager::PanicSubscriptionManager;
+use graph_node::{config::Config, store_builder::StoreBuilder};
+use graph_store_postgres::{ChainHeadUpdateListener, ChainStore, Store, SubgraphStore};
+use slog::{info, Logger};
+use std::env::VarError;
+use std::pin::Pin;
+use std::sync::Arc;
+use std::task::{Context, Poll};
+use tokio::fs::read_to_string;
+
+const NODE_ID: &str = "default";
+
+pub async fn build_subgraph(dir: &str) -> DeploymentHash {
+    build_subgraph_with_yarn_cmd(dir, "deploy:test").await
+}
+
+pub async fn build_subgraph_with_yarn_cmd(dir: &str, yarn_cmd: &str) -> DeploymentHash {
+    // Test that IPFS is up.
+    IpfsClient::localhost()
+        .test()
+        .await
+        .expect("Could not connect to IPFS, make sure it's running at port 5001");
+
+    // Make sure dependencies are present.
+    run_cmd(
+        Command::new("yarn")
+            .arg("install")
+            .arg("--mutex")
+            .arg("file:.yarn-mutex")
+            .current_dir("./integration-tests"),
+    );
+
+    // Run codegen.
+    run_cmd(Command::new("yarn").arg("codegen").current_dir(&dir));
+
+    // Run `deploy` for the side effect of uploading to IPFS, the graph node url
+    // is fake and the actual deploy call is meant to fail.
+    let deploy_output = run_cmd(
+        Command::new("yarn")
+            .arg(yarn_cmd)
+            .env("IPFS_URI", "http://127.0.0.1:5001")
+            .env("GRAPH_NODE_ADMIN_URI", "http://localhost:0")
+            .current_dir(dir),
+    );
+
+    // Hack to extract deployment id from `graph deploy` output.
+    const ID_PREFIX: &str = "Build completed: ";
+    let mut line = deploy_output
+        .lines()
+        .find(|line| line.contains(ID_PREFIX))
+        .expect("found no matching line");
+    if !line.starts_with(ID_PREFIX) {
+        line = &line[5..line.len() - 5]; // workaround for colored output
+    }
+    DeploymentHash::new(line.trim_start_matches(ID_PREFIX)).unwrap()
+}
+
+pub fn test_ptr(n: BlockNumber) -> BlockPtr {
+    BlockPtr {
+        hash: H256::from_low_u64_be(n as u64).into(),
+        number: n,
+    }
+}
+pub struct TestContext {
+    pub logger: Logger,
+    pub provider: Arc<
+        IpfsSubgraphAssignmentProvider<
+            SubgraphInstanceManager<graph_store_postgres::SubgraphStore>,
+        >,
+    >,
+    pub store: Arc<SubgraphStore>,
+    pub deployment: DeploymentLocator,
+    pub subgraph_name: SubgraphName,
+    graphql_runner: Arc<GraphQlRunner<Store, PanicSubscriptionManager>>,
+}
+
+impl TestContext {
+    pub async fn start_and_sync_to(&self, stop_block: BlockPtr) {
+        self.provider
+            .start(self.deployment.clone(), Some(stop_block.number))
+            .await
+            .expect("unable to start subgraph");
+
+        wait_for_sync(&self.logger, &self.store, &self.deployment.hash, stop_block)
+            .await
+            .unwrap();
+    }
+
+    pub async fn query(&self, query: &str) -> Result<Option<r::Value>, Vec<QueryError>> {
+        let target = QueryTarget::Deployment(self.deployment.hash.clone(), ApiVersion::default());
+
+        self.graphql_runner
+            .clone()
+            .run_query(
+                Query::new(
+                    graphql_parser::parse_query(query).unwrap().into_static(),
+                    None,
+                ),
+                target,
+            )
+            .await
+            .first()
+            .unwrap()
+            .duplicate()
+            .to_result()
+    }
+}
+
+impl Drop for TestContext {
+    fn drop(&mut self) {
+        if let Err(e) = cleanup(&self.store, &self.subgraph_name, &self.deployment.hash) {
+            crit!(self.logger, "error cleaning up test subgraph"; "error" => e.to_string());
+        }
+    }
+}
+
+pub struct Stores {
+    network_name: String,
+    chain_head_listener: Arc<ChainHeadUpdateListener>,
+    network_store: Arc<Store>,
+    chain_store: Arc<ChainStore>,
+}
+
+graph::prelude::lazy_static! {
+    /// Mutex for assuring there's only one test at a time
+    /// running the `stores` function.
+    pub static ref STORE_MUTEX: Mutex<()> = Mutex::new(());
+}
+
+pub async fn stores(store_config_path: &str) -> Stores {
+    let _mutex_guard = STORE_MUTEX.lock().unwrap();
+
+    let config = {
+        let config = read_to_string(store_config_path).await.unwrap();
+        let db_url = match std::env::var("THEGRAPH_STORE_POSTGRES_DIESEL_URL") {
+            Ok(url) => url,
+            Err(VarError::NotPresent) => panic!(
+                "to run end-to-end tests it is required to set \
+                                            $THEGRAPH_STORE_POSTGRES_DIESEL_URL to the test db url"
+            ),
+            Err(e) => panic!("{}", e.to_string()),
+        };
+        let config = config.replace("$THEGRAPH_STORE_POSTGRES_DIESEL_URL", &db_url);
+        Config::from_str(&config, "default").expect("failed to create configuration")
+    };
+
+    let logger = graph::log::logger(true);
+    let mock_registry: Arc<dyn MetricsRegistry> = Arc::new(MockMetricsRegistry::new());
+    let node_id = NodeId::new(NODE_ID).unwrap();
+    let store_builder =
+        StoreBuilder::new(&logger, &node_id, &config, None, mock_registry.clone()).await;
+
+    let network_name: String = config.chains.chains.iter().next().unwrap().0.to_string();
+    let chain_head_listener = store_builder.chain_head_update_listener();
+    let network_identifiers = vec![(
+        network_name.clone(),
+        (vec![ChainIdentifier {
+            net_version: "".into(),
+            genesis_block_hash: test_ptr(0).hash,
+        }]),
+    )];
+    let network_store = store_builder.network_store(network_identifiers);
+    let chain_store = network_store
+        .block_store()
+        .chain_store(network_name.as_ref())
+        .expect(format!("No chain store for {}", &network_name).as_ref());
+
+    Stores {
+        network_name,
+        chain_head_listener,
+        network_store,
+        chain_store,
+    }
+}
+
+pub async fn setup<C: Blockchain>(
+    subgraph_name: SubgraphName,
+    hash: &DeploymentHash,
+    stores: &Stores,
+    chain: Arc<C>,
+    graft_block: Option<BlockPtr>,
+    env_vars: Option<EnvVars>,
+) -> TestContext {
+    let env_vars = match env_vars {
+        Some(ev) => ev,
+        None => EnvVars::from_env().unwrap(),
+    };
+
+    let logger = graph::log::logger(true);
+    let logger_factory = LoggerFactory::new(logger.clone(), None);
+    let mock_registry: Arc<dyn MetricsRegistry> = Arc::new(MockMetricsRegistry::new());
+    let node_id = NodeId::new(NODE_ID).unwrap();
+
+    // Make sure we're starting from a clean state.
+    let subgraph_store = stores.network_store.subgraph_store();
+    cleanup(&subgraph_store, &subgraph_name, hash).unwrap();
+
+    let mut blockchain_map = BlockchainMap::new();
+    blockchain_map.insert(stores.network_name.clone(), chain);
+
+    let static_filters = env_vars.experimental_static_filters;
+
+    let ipfs = IpfsClient::localhost();
+    let link_resolver = Arc::new(LinkResolver::new(
+        vec![ipfs.cheap_clone()],
+        Default::default(),
+    ));
+    let ipfs_service = IpfsService::new(
+        ipfs,
+        env_vars.mappings.max_ipfs_file_bytes as u64,
+        env_vars.mappings.ipfs_timeout,
+        env_vars.mappings.max_ipfs_concurrent_requests,
+    );
+
+    let blockchain_map = Arc::new(blockchain_map);
+    let subgraph_instance_manager = SubgraphInstanceManager::new(
+        &logger_factory,
+        subgraph_store.clone(),
+        blockchain_map.clone(),
+        mock_registry.clone(),
+        link_resolver.cheap_clone(),
+        ipfs_service,
+        static_filters,
+    );
+
+    // Graphql runner
+    let subscription_manager = Arc::new(PanicSubscriptionManager {});
+    let load_manager = LoadManager::new(&logger, Vec::new(), mock_registry.clone());
+    let graphql_runner = Arc::new(GraphQlRunner::new(
+        &logger,
+        stores.network_store.clone(),
+        subscription_manager.clone(),
+        Arc::new(load_manager),
+        mock_registry.clone(),
+    ));
+
+    // Create IPFS-based subgraph provider
+    let subgraph_provider = Arc::new(IpfsSubgraphAssignmentProvider::new(
+        &logger_factory,
+        link_resolver.cheap_clone(),
+        subgraph_instance_manager,
+    ));
+
+    let panicking_subscription_manager = Arc::new(PanicSubscriptionManager {});
+
+    let subgraph_registrar = Arc::new(IpfsSubgraphRegistrar::new(
+        &logger_factory,
+        link_resolver.cheap_clone(),
+        subgraph_provider.clone(),
+        subgraph_store.clone(),
+        panicking_subscription_manager,
+        blockchain_map.clone(),
+        node_id.clone(),
+        SubgraphVersionSwitchingMode::Instant,
+    ));
+
+    SubgraphRegistrar::create_subgraph(subgraph_registrar.as_ref(), subgraph_name.clone())
+        .await
+        .expect("unable to create subgraph");
+
+    let deployment = SubgraphRegistrar::create_subgraph_version(
+        subgraph_registrar.as_ref(),
+        subgraph_name.clone(),
+        hash.clone(),
+        node_id.clone(),
+        None,
+        None,
+        graft_block,
+    )
+    .await
+    .expect("failed to create subgraph version");
+
+    TestContext {
+        logger: logger_factory.subgraph_logger(&deployment),
+        provider: subgraph_provider,
+        store: subgraph_store,
+        deployment,
+        subgraph_name,
+        graphql_runner,
+    }
+}
+
+pub fn cleanup(
+    subgraph_store: &SubgraphStore,
+    name: &SubgraphName,
+    hash: &DeploymentHash,
+) -> Result<(), Error> {
+    let locators = subgraph_store.locators(hash)?;
+    subgraph_store.remove_subgraph(name.clone())?;
+    for locator in locators {
+        subgraph_store.remove_deployment(locator.id.into())?;
+    }
+    Ok(())
+}
+
+pub async fn wait_for_sync(
+    logger: &Logger,
+    store: &SubgraphStore,
+    hash: &DeploymentHash,
+    stop_block: BlockPtr,
+) -> Result<(), Error> {
+    let mut err_count = 0;
+    while err_count < 10 {
+        tokio::time::sleep(Duration::from_millis(1000)).await;
+
+        let block_ptr = match store.least_block_ptr(&hash).await {
+            Ok(Some(ptr)) => ptr,
+            res => {
+                info!(&logger, "{:?}", res);
+                err_count += 1;
+                continue;
+            }
+        };
+
+        if block_ptr == stop_block {
+            break;
+        }
+
+        if !store.is_healthy(&hash).await.unwrap() {
+            return Err(anyhow::anyhow!("subgraph failed unexpectedly"));
+        }
+    }
+
+    Ok(())
+}
+
+/// `chain` is the sequence of chain heads to be processed. If the next block to be processed in the
+/// chain is not a descendant of the previous one, reorgs will be emitted until it is.
+/// See also: static-stream-builder
+struct StaticStreamBuilder<C: Blockchain> {
+    chain: Vec<BlockWithTriggers<C>>,
+}
+
+#[async_trait]
+impl<C: Blockchain> BlockStreamBuilder<C> for StaticStreamBuilder<C>
+where
+    C::TriggerData: Clone,
+{
+    async fn build_firehose(
+        &self,
+        _chain: &C,
+        _deployment: DeploymentLocator,
+        _block_cursor: FirehoseCursor,
+        _start_blocks: Vec<graph::prelude::BlockNumber>,
+        current_block: Option<graph::blockchain::BlockPtr>,
+        _filter: Arc<C::TriggerFilter>,
+        _unified_api_version: graph::data::subgraph::UnifiedMappingApiVersion,
+    ) -> anyhow::Result<Box<dyn BlockStream<C>>> {
+        let current_idx = current_block.map(|current_block| {
+            self.chain
+                .iter()
+                .enumerate()
+                .find(|(_, b)| b.ptr() == current_block)
+                .unwrap()
+                .0 as usize
+        });
+        Ok(Box::new(StaticStream {
+            stream: Box::pin(stream_events(self.chain.clone(), current_idx)),
+        }))
+    }
+
+    async fn build_polling(
+        &self,
+        _chain: Arc<C>,
+        _deployment: DeploymentLocator,
+        _start_blocks: Vec<graph::prelude::BlockNumber>,
+        _subgraph_current_block: Option<graph::blockchain::BlockPtr>,
+        _filter: Arc<C::TriggerFilter>,
+        _unified_api_version: graph::data::subgraph::UnifiedMappingApiVersion,
+    ) -> anyhow::Result<Box<dyn BlockStream<C>>> {
+        unimplemented!("only firehose mode should be used for tests")
+    }
+}
+
+struct StaticStream<C: Blockchain> {
+    stream: Pin<Box<dyn Stream<Item = Result<BlockStreamEvent<C>, Error>> + Send>>,
+}
+
+impl<C: Blockchain> BlockStream<C> for StaticStream<C> {}
+
+impl<C: Blockchain> Stream for StaticStream<C> {
+    type Item = Result<BlockStreamEvent<C>, Error>;
+
+    fn poll_next(mut self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<Option<Self::Item>> {
+        self.stream.poll_next_unpin(cx)
+    }
+}
+
+fn stream_events<C: Blockchain>(
+    blocks: Vec<BlockWithTriggers<C>>,
+    current_idx: Option<usize>,
+) -> impl Stream<Item = Result<BlockStreamEvent<C>, Error>>
+where
+    C::TriggerData: Clone,
+{
+    // See also: static-stream-builder
+    stream! {
+        let current_block = current_idx.map(|idx| &blocks[idx]);
+        let mut current_ptr = current_block.map(|b| b.ptr());
+        let mut current_parent_ptr = current_block.and_then(|b| b.parent_ptr());
+        let skip = current_idx.map(|idx| idx + 1).unwrap_or(0);
+        let mut blocks_iter = blocks.iter().skip(skip).peekable();
+        while let Some(&block) = blocks_iter.peek() {
+            if block.parent_ptr() == current_ptr {
+                current_ptr = Some(block.ptr());
+                current_parent_ptr = block.parent_ptr();
+                blocks_iter.next(); // Block consumed, advance the iterator.
+                yield Ok(BlockStreamEvent::ProcessBlock(block.clone(), FirehoseCursor::None));
+            } else {
+                let revert_to = current_parent_ptr.unwrap();
+                current_ptr = Some(revert_to.clone());
+                current_parent_ptr = blocks
+                    .iter()
+                    .find(|b| b.ptr() == revert_to)
+                    .unwrap()
+                    .block
+                    .parent_ptr();
+                yield Ok(BlockStreamEvent::Revert(revert_to, FirehoseCursor::None));
+            }
+        }
+    }
+}
+
+struct NoopRuntimeAdapter<C> {
+    x: PhantomData<C>,
+}
+
+impl<C: Blockchain> RuntimeAdapter<C> for NoopRuntimeAdapter<C> {
+    fn host_fns(
+        &self,
+        _ds: &<C as Blockchain>::DataSource,
+    ) -> Result<Vec<graph::blockchain::HostFn>, Error> {
+        Ok(vec![])
+    }
+}
+
+struct NoopAdapterSelector<C> {
+    x: PhantomData<C>,
+}
+
+impl<C: Blockchain> TriggersAdapterSelector<C> for NoopAdapterSelector<C> {
+    fn triggers_adapter(
+        &self,
+        _loc: &DeploymentLocator,
+        _capabilities: &<C as Blockchain>::NodeCapabilities,
+        _unified_api_version: graph::data::subgraph::UnifiedMappingApiVersion,
+    ) -> Result<Arc<dyn graph::blockchain::TriggersAdapter<C>>, Error> {
+        Ok(Arc::new(NoopTriggersAdapter { x: PhantomData }))
+    }
+}
+
+struct NoopTriggersAdapter<C> {
+    x: PhantomData<C>,
+}
+
+#[async_trait]
+impl<C: Blockchain> TriggersAdapter<C> for NoopTriggersAdapter<C> {
+    async fn ancestor_block(
+        &self,
+        _ptr: BlockPtr,
+        _offset: BlockNumber,
+    ) -> Result<Option<<C as Blockchain>::Block>, Error> {
+        todo!()
+    }
+
+    async fn scan_triggers(
+        &self,
+        _from: BlockNumber,
+        _to: BlockNumber,
+        _filter: &<C as Blockchain>::TriggerFilter,
+    ) -> Result<Vec<BlockWithTriggers<C>>, Error> {
+        todo!()
+    }
+
+    async fn triggers_in_block(
+        &self,
+        _logger: &Logger,
+        block: <C as Blockchain>::Block,
+        _filter: &<C as Blockchain>::TriggerFilter,
+    ) -> Result<BlockWithTriggers<C>, Error> {
+        // Return no triggers on data source reprocessing.
+        Ok(BlockWithTriggers::new(block, Vec::new()))
+    }
+
+    async fn is_on_main_chain(&self, _ptr: BlockPtr) -> Result<bool, Error> {
+        todo!()
+    }
+
+    async fn parent_ptr(&self, block: &BlockPtr) -> Result<Option<BlockPtr>, Error> {
+        match block.number {
+            0 => Ok(None),
+            n => Ok(Some(BlockPtr {
+                hash: BlockHash::default(),
+                number: n - 1,
+            })),
+        }
+    }
+}
diff --git a/tests/src/fixture/ethereum.rs b/tests/src/fixture/ethereum.rs
new file mode 100644
index 0000000..c44922a
--- /dev/null
+++ b/tests/src/fixture/ethereum.rs
@@ -0,0 +1,88 @@
+use std::marker::PhantomData;
+use std::sync::Arc;
+
+use super::{
+    test_ptr, NoopAdapterSelector, NoopRuntimeAdapter, StaticStreamBuilder, Stores, NODE_ID,
+};
+use graph::blockchain::BlockPtr;
+use graph::cheap_clone::CheapClone;
+use graph::firehose::{FirehoseEndpoint, FirehoseEndpoints};
+use graph::prelude::ethabi::ethereum_types::H256;
+use graph::prelude::{LightEthereumBlock, LoggerFactory, NodeId};
+use graph::{blockchain::block_stream::BlockWithTriggers, prelude::ethabi::ethereum_types::U64};
+use graph_chain_ethereum::network::EthereumNetworkAdapters;
+use graph_chain_ethereum::{
+    chain::BlockFinality,
+    trigger::{EthereumBlockTriggerType, EthereumTrigger},
+};
+use graph_chain_ethereum::{Chain, ENV_VARS};
+use graph_mock::MockMetricsRegistry;
+
+pub async fn chain(blocks: Vec<BlockWithTriggers<Chain>>, stores: &Stores) -> Chain {
+    let logger = graph::log::logger(true);
+    let logger_factory = LoggerFactory::new(logger.cheap_clone(), None);
+    let node_id = NodeId::new(NODE_ID).unwrap();
+    let mock_registry = Arc::new(MockMetricsRegistry::new());
+
+    let chain_store = stores.chain_store.cheap_clone();
+
+    // This is needed bacause the stream builder only works for firehose and this will only be called if there
+    // are > 1 firehose endpoints. The endpoint itself is never used because it's mocked.
+    let firehose_endpoints: FirehoseEndpoints = vec![Arc::new(FirehoseEndpoint::new(
+        "",
+        "https://example.com",
+        None,
+        true,
+        false,
+        0,
+    ))]
+    .into();
+
+    Chain::new(
+        logger_factory.clone(),
+        stores.network_name.clone(),
+        node_id,
+        mock_registry.clone(),
+        chain_store.cheap_clone(),
+        chain_store,
+        firehose_endpoints,
+        EthereumNetworkAdapters { adapters: vec![] },
+        stores.chain_head_listener.cheap_clone(),
+        Arc::new(StaticStreamBuilder { chain: blocks }),
+        Arc::new(NoopAdapterSelector { x: PhantomData }),
+        Arc::new(NoopRuntimeAdapter { x: PhantomData }),
+        ENV_VARS.reorg_threshold,
+        // We assume the tested chain is always ingestible for now
+        true,
+    )
+}
+
+pub fn genesis() -> BlockWithTriggers<graph_chain_ethereum::Chain> {
+    let ptr = test_ptr(0);
+    BlockWithTriggers::<graph_chain_ethereum::Chain> {
+        block: BlockFinality::Final(Arc::new(LightEthereumBlock {
+            hash: Some(H256::from_slice(ptr.hash.as_slice())),
+            number: Some(U64::from(ptr.number)),
+            ..Default::default()
+        })),
+        trigger_data: vec![EthereumTrigger::Block(ptr, EthereumBlockTriggerType::Every)],
+    }
+}
+
+pub fn empty_block(
+    parent_ptr: BlockPtr,
+    ptr: BlockPtr,
+) -> BlockWithTriggers<graph_chain_ethereum::Chain> {
+    assert!(ptr != parent_ptr);
+    assert!(ptr.number > parent_ptr.number);
+
+    BlockWithTriggers::<graph_chain_ethereum::Chain> {
+        block: BlockFinality::Final(Arc::new(LightEthereumBlock {
+            hash: Some(H256::from_slice(ptr.hash.as_slice())),
+            number: Some(U64::from(ptr.number)),
+            parent_hash: H256::from_slice(parent_ptr.hash.as_slice()),
+            ..Default::default()
+        })),
+        trigger_data: vec![EthereumTrigger::Block(ptr, EthereumBlockTriggerType::Every)],
+    }
+}
diff --git a/tests/src/helpers.rs b/tests/src/helpers.rs
new file mode 100644
index 0000000..02597b1
--- /dev/null
+++ b/tests/src/helpers.rs
@@ -0,0 +1,160 @@
+use std::collections::HashMap;
+use std::ffi::OsStr;
+use std::io::{self, BufRead};
+use std::path::Path;
+use std::process::Command;
+use std::sync::atomic::{AtomicU16, Ordering};
+
+use anyhow::Context;
+
+/// A counter for uniquely naming Ganache containers
+static GANACHE_CONTAINER_COUNT: AtomicU16 = AtomicU16::new(0);
+/// A counter for uniquely naming Postgres databases
+static POSTGRES_DATABASE_COUNT: AtomicU16 = AtomicU16::new(0);
+/// A counter for uniquely assigning ports.
+static PORT_NUMBER_COUNTER: AtomicU16 = AtomicU16::new(10_000);
+
+const POSTGRESQL_DEFAULT_PORT: u16 = 5432;
+const GANACHE_DEFAULT_PORT: u16 = 8545;
+const IPFS_DEFAULT_PORT: u16 = 5001;
+
+/// Maps `Service => Host` exposed ports.
+#[derive(Debug)]
+pub struct MappedPorts(pub HashMap<u16, u16>);
+
+/// Strip parent directories from filenames
+pub fn basename(path: &impl AsRef<Path>) -> String {
+    path.as_ref()
+        .file_name()
+        .map(OsStr::to_string_lossy)
+        .map(String::from)
+        .expect("failed to infer basename for path.")
+}
+
+/// Fetches a unique number for naming Ganache containers
+pub fn get_unique_ganache_counter() -> u16 {
+    increase_atomic_counter(&GANACHE_CONTAINER_COUNT)
+}
+/// Fetches a unique number for naming Postgres databases
+pub fn get_unique_postgres_counter() -> u16 {
+    increase_atomic_counter(&POSTGRES_DATABASE_COUNT)
+}
+/// Fetches a unique port number
+pub fn get_unique_port_number() -> u16 {
+    increase_atomic_counter(&PORT_NUMBER_COUNTER)
+}
+
+fn increase_atomic_counter(counter: &'static AtomicU16) -> u16 {
+    let old_count = counter.fetch_add(1, Ordering::SeqCst);
+    old_count + 1
+}
+
+/// Parses stdio bytes into a prefixed String
+pub fn pretty_output(stdio: &[u8], prefix: &str) -> String {
+    let mut cursor = io::Cursor::new(stdio);
+    let mut buf = vec![];
+    let mut string = String::new();
+    loop {
+        buf.clear();
+        let bytes_read = cursor
+            .read_until(b'\n', &mut buf)
+            .expect("failed to read from stdio.");
+        if bytes_read == 0 {
+            break;
+        }
+        let as_string = String::from_utf8_lossy(&buf);
+        string.push_str(&prefix);
+        string.push_str(&as_string); // will contain a newline
+    }
+    string
+}
+
+#[derive(Debug)]
+pub struct GraphNodePorts {
+    pub http: u16,
+    pub index: u16,
+    pub ws: u16,
+    pub admin: u16,
+    pub metrics: u16,
+}
+impl GraphNodePorts {
+    /// Returns five available port numbers, using dynamic port ranges
+    pub fn get_ports() -> GraphNodePorts {
+        let mut ports = [0u16; 5];
+        for port in ports.iter_mut() {
+            let min = get_unique_port_number();
+            let max = min + 1_000;
+            let free_port_in_range = port_check::free_local_port_in_range(min, max)
+                .expect("failed to obtain a free port in range");
+            *port = free_port_in_range;
+        }
+        GraphNodePorts {
+            http: ports[0],
+            index: ports[1],
+            ws: ports[2],
+            admin: ports[3],
+            metrics: ports[4],
+        }
+    }
+}
+
+// Build a postgres connection string
+pub fn make_postgres_uri(unique_id: &u16, postgres_ports: &MappedPorts) -> String {
+    let port = postgres_ports
+        .0
+        .get(&POSTGRESQL_DEFAULT_PORT)
+        .expect("failed to fetch Postgres port from mapped ports");
+    format!(
+        "postgresql://{user}:{password}@{host}:{port}/{database_name}",
+        user = "postgres",
+        password = "password",
+        host = "localhost",
+        port = port,
+        database_name = postgres_test_database_name(unique_id),
+    )
+}
+
+pub fn make_ipfs_uri(ipfs_ports: &MappedPorts) -> String {
+    let port = ipfs_ports
+        .0
+        .get(&IPFS_DEFAULT_PORT)
+        .expect("failed to fetch IPFS port from mapped ports");
+    format!("http://{host}:{port}", host = "localhost", port = port)
+}
+
+// Build a Ganache connection string. Returns the port number and the URI.
+pub fn make_ganache_uri(ganache_ports: &MappedPorts) -> (u16, String) {
+    let port = ganache_ports
+        .0
+        .get(&GANACHE_DEFAULT_PORT)
+        .expect("failed to fetch Ganache port from mapped ports");
+    let uri = format!("test:http://{host}:{port}", host = "localhost", port = port);
+    (*port, uri)
+}
+
+pub fn contains_subslice<T: PartialEq>(data: &[T], needle: &[T]) -> bool {
+    data.windows(needle.len()).any(|w| w == needle)
+}
+
+pub fn postgres_test_database_name(unique_id: &u16) -> String {
+    format!("test_database_{}", unique_id)
+}
+
+/// Returns captured stdout
+pub fn run_cmd(command: &mut Command) -> String {
+    let program = command.get_program().to_str().unwrap().to_owned();
+    let output = command
+        .output()
+        .context(format!("failed to run {}", program))
+        .unwrap();
+    println!(
+        "stdout {}",
+        pretty_output(&output.stdout, &format!("[{}:stdout] ", program))
+    );
+    println!(
+        "stderr {}",
+        pretty_output(&output.stderr, &format!("[{}:stderr] ", program))
+    );
+
+    String::from_utf8(output.stdout).unwrap()
+}
diff --git a/tests/src/lib.rs b/tests/src/lib.rs
new file mode 100644
index 0000000..bdb39ee
--- /dev/null
+++ b/tests/src/lib.rs
@@ -0,0 +1,2 @@
+pub mod fixture;
+pub mod helpers;
diff --git a/tests/tests/common/docker.rs b/tests/tests/common/docker.rs
new file mode 100644
index 0000000..e2231a4
--- /dev/null
+++ b/tests/tests/common/docker.rs
@@ -0,0 +1,285 @@
+use bollard::image::CreateImageOptions;
+use bollard::models::HostConfig;
+use bollard::{container, Docker};
+use graph_tests::helpers::{contains_subslice, postgres_test_database_name, MappedPorts};
+use std::collections::HashMap;
+use tokio::time::{sleep, Duration};
+use tokio_stream::StreamExt;
+
+const POSTGRES_IMAGE: &'static str = "postgres:latest";
+const IPFS_IMAGE: &'static str = "ipfs/go-ipfs:v0.10.0";
+const GANACHE_IMAGE: &'static str = "trufflesuite/ganache-cli:latest";
+type DockerError = bollard::errors::Error;
+
+pub async fn pull_images() {
+    use tokio_stream::StreamMap;
+
+    let client =
+        Docker::connect_with_local_defaults().expect("Failed to connect to docker daemon.");
+
+    let images = [POSTGRES_IMAGE, IPFS_IMAGE, GANACHE_IMAGE];
+    let mut map = StreamMap::new();
+
+    for image_name in &images {
+        let options = Some(CreateImageOptions {
+            from_image: *image_name,
+            ..Default::default()
+        });
+        let stream = client.create_image(options, None, None);
+        map.insert(*image_name, stream);
+    }
+
+    while let Some(message) = map.next().await {
+        if let (key, Err(msg)) = message {
+            panic!("Error when pulling docker image for {}: {}", key, msg)
+        }
+    }
+}
+
+pub async fn stop_and_remove(client: &Docker, service_name: &str) -> Result<(), DockerError> {
+    client.kill_container::<&str>(service_name, None).await?;
+    client.remove_container(service_name, None).await
+}
+
+/// Represents all possible service containers to be spawned
+#[derive(Debug)]
+pub enum TestContainerService {
+    Postgres,
+    Ipfs,
+    Ganache(u16),
+}
+
+impl TestContainerService {
+    fn config(&self) -> container::Config<&'static str> {
+        use TestContainerService::*;
+        match self {
+            Postgres => Self::build_postgres_container_config(),
+            Ipfs => Self::build_ipfs_container_config(),
+            Ganache(_u32) => Self::build_ganache_container_config(),
+        }
+    }
+
+    fn options(&self) -> container::CreateContainerOptions<String> {
+        container::CreateContainerOptions { name: self.name() }
+    }
+
+    fn name(&self) -> String {
+        use TestContainerService::*;
+        match self {
+            Postgres => "graph_node_integration_test_postgres".into(),
+            Ipfs => "graph_node_integration_test_ipfs".into(),
+            Ganache(container_count) => {
+                format!("graph_node_integration_test_ganache_{}", container_count)
+            }
+        }
+    }
+
+    fn build_postgres_container_config() -> container::Config<&'static str> {
+        let host_config = HostConfig {
+            publish_all_ports: Some(true),
+            ..Default::default()
+        };
+
+        container::Config {
+            image: Some(POSTGRES_IMAGE),
+            env: Some(vec!["POSTGRES_PASSWORD=password", "POSTGRES_USER=postgres"]),
+            host_config: Some(host_config),
+            cmd: Some(vec![
+                "postgres",
+                "-N",
+                "1000",
+                "-cshared_preload_libraries=pg_stat_statements",
+            ]),
+            ..Default::default()
+        }
+    }
+
+    fn build_ipfs_container_config() -> container::Config<&'static str> {
+        let host_config = HostConfig {
+            publish_all_ports: Some(true),
+            ..Default::default()
+        };
+
+        container::Config {
+            image: Some(IPFS_IMAGE),
+            host_config: Some(host_config),
+            ..Default::default()
+        }
+    }
+
+    fn build_ganache_container_config() -> container::Config<&'static str> {
+        let host_config = HostConfig {
+            publish_all_ports: Some(true),
+            ..Default::default()
+        };
+
+        container::Config {
+            image: Some(GANACHE_IMAGE),
+            cmd: Some(vec!["-d", "-l", "100000000000", "-g", "1"]),
+            host_config: Some(host_config),
+            ..Default::default()
+        }
+    }
+}
+
+/// Handles the connection to the docker daemon and keeps track the service running inside it.
+pub struct DockerTestClient {
+    service: TestContainerService,
+    client: Docker,
+}
+
+impl DockerTestClient {
+    pub async fn start(service: TestContainerService) -> Result<Self, DockerError> {
+        let client =
+            Docker::connect_with_local_defaults().expect("Failed to connect to docker daemon.");
+
+        let docker_test_client = Self { service, client };
+
+        // try to remove the container if it already exists
+        let _ = stop_and_remove(
+            &docker_test_client.client,
+            &docker_test_client.service.name(),
+        )
+        .await;
+
+        // create docker container
+        docker_test_client
+            .client
+            .create_container(
+                Some(docker_test_client.service.options()),
+                docker_test_client.service.config(),
+            )
+            .await?;
+
+        // start docker container
+        docker_test_client
+            .client
+            .start_container::<&'static str>(&docker_test_client.service.name(), None)
+            .await?;
+
+        Ok(docker_test_client)
+    }
+
+    pub async fn stop(&self) -> Result<(), DockerError> {
+        stop_and_remove(&self.client, &self.service.name()).await
+    }
+
+    pub async fn exposed_ports(&self) -> Result<MappedPorts, DockerError> {
+        use bollard::models::ContainerSummaryInner;
+        let mut filters = HashMap::new();
+        filters.insert("name".to_string(), vec![self.service.name()]);
+        let options = Some(container::ListContainersOptions {
+            filters,
+            limit: Some(1),
+            ..Default::default()
+        });
+        let results = self.client.list_containers(options).await?;
+        let ports = match &results.as_slice() {
+            &[ContainerSummaryInner {
+                ports: Some(ports), ..
+            }] => ports,
+            unexpected_response => panic!(
+                "Received a unexpected_response from docker API: {:#?}",
+                unexpected_response
+            ),
+        };
+        let mapped_ports: MappedPorts = to_mapped_ports(ports.to_vec());
+        Ok(mapped_ports)
+    }
+
+    /// halts execution until a trigger message is detected on stdout or, optionally,
+    /// waits for a specified amount of time after the message appears.
+    pub async fn wait_for_message(
+        &self,
+        trigger_message: &[u8],
+        hard_wait: &Option<u64>,
+    ) -> Result<&Self, DockerError> {
+        // listen to container logs
+        let mut stream = self.client.logs::<String>(
+            &self.service.name(),
+            Some(container::LogsOptions {
+                follow: true,
+                stdout: true,
+                stderr: true,
+                ..Default::default()
+            }),
+        );
+
+        // halt execution until a message is received
+        loop {
+            match stream.next().await {
+                Some(Ok(container::LogOutput::StdOut { message })) => {
+                    if contains_subslice(&message, &trigger_message) {
+                        break;
+                    } else {
+                        sleep(Duration::from_millis(100)).await;
+                    }
+                }
+                Some(Err(error)) => return Err(error),
+                None => {
+                    panic!("stream ended before expected message could be detected")
+                }
+                _ => {}
+            }
+        }
+
+        if let Some(seconds) = hard_wait {
+            sleep(Duration::from_secs(*seconds)).await;
+        }
+        Ok(self)
+    }
+
+    /// Calls `docker exec` on the container to create a test database.
+    pub async fn create_postgres_database(
+        docker: &DockerTestClient,
+        unique_id: &u16,
+    ) -> Result<(), DockerError> {
+        use bollard::exec;
+
+        let database_name = postgres_test_database_name(unique_id);
+
+        // 1. Create Exec
+        let config = exec::CreateExecOptions {
+            cmd: Some(vec!["createdb", &database_name]),
+            user: Some("postgres"),
+            attach_stdout: Some(true),
+            ..Default::default()
+        };
+
+        let message = docker
+            .client
+            .create_exec(&docker.service.name(), config)
+            .await?;
+
+        // 2. Start Exec
+        let mut stream = docker.client.start_exec(&message.id, None);
+        while let Some(_) = stream.next().await { /* consume stream */ }
+
+        // 3. Inspecet exec
+        let inspect = docker.client.inspect_exec(&message.id).await?;
+        if let Some(0) = inspect.exit_code {
+            Ok(())
+        } else {
+            panic!("failed to run 'createdb' command using docker exec");
+        }
+    }
+}
+
+fn to_mapped_ports(input: Vec<bollard::models::Port>) -> MappedPorts {
+    let mut hashmap = HashMap::new();
+
+    for port in &input {
+        if let bollard::models::Port {
+            private_port,
+            public_port: Some(public_port),
+            ..
+        } = port
+        {
+            hashmap.insert(*private_port as u16, *public_port as u16);
+        }
+    }
+    if hashmap.is_empty() {
+        panic!("Container exposed no ports. Input={:?}", input)
+    }
+    MappedPorts(hashmap)
+}
diff --git a/tests/tests/common/mod.rs b/tests/tests/common/mod.rs
new file mode 100644
index 0000000..18c5028
--- /dev/null
+++ b/tests/tests/common/mod.rs
@@ -0,0 +1 @@
+pub mod docker;
diff --git a/tests/tests/parallel_tests.rs b/tests/tests/parallel_tests.rs
new file mode 100644
index 0000000..976a502
--- /dev/null
+++ b/tests/tests/parallel_tests.rs
@@ -0,0 +1,434 @@
+mod common;
+use anyhow::Context;
+use common::docker::{pull_images, DockerTestClient, TestContainerService};
+use futures::StreamExt;
+use graph_tests::helpers::{
+    basename, get_unique_ganache_counter, get_unique_postgres_counter, make_ganache_uri,
+    make_ipfs_uri, make_postgres_uri, pretty_output, GraphNodePorts, MappedPorts,
+};
+use std::fs;
+use std::path::{Path, PathBuf};
+use std::sync::Arc;
+use tokio::io::AsyncReadExt;
+use tokio::process::{Child, Command};
+
+const DEFAULT_N_CONCURRENT_TESTS: usize = 15;
+
+lazy_static::lazy_static! {
+    static ref GANACHE_HARD_WAIT_SECONDS: Option<u64> =
+        parse_numeric_environment_variable("TESTS_GANACHE_HARD_WAIT_SECONDS");
+    static ref IPFS_HARD_WAIT_SECONDS: Option<u64> =
+        parse_numeric_environment_variable("TESTS_IPFS_HARD_WAIT_SECONDS");
+    static ref POSTGRES_HARD_WAIT_SECONDS: Option<u64> =
+        parse_numeric_environment_variable("TESTS_POSTGRES_HARD_WAIT_SECONDS");
+}
+
+/// All integration tests subdirectories to run
+pub const INTEGRATION_TESTS_DIRECTORIES: [&str; 9] = [
+    "api-version-v0-0-4",
+    "fatal-error",
+    "ganache-reverts",
+    "host-exports",
+    "non-fatal-errors",
+    "overloaded-contract-functions",
+    "poi-for-failed-subgraph",
+    "remove-then-update",
+    "value-roundtrip",
+];
+
+/// Contains all information a test command needs
+#[derive(Debug)]
+struct IntegrationTestSetup {
+    postgres_uri: String,
+    ipfs_uri: String,
+    ganache_port: u16,
+    ganache_uri: String,
+    graph_node_ports: GraphNodePorts,
+    graph_node_bin: Arc<PathBuf>,
+    test_directory: PathBuf,
+}
+
+impl IntegrationTestSetup {
+    fn test_name(&self) -> String {
+        basename(&self.test_directory)
+    }
+
+    fn graph_node_admin_uri(&self) -> String {
+        let ws_port = self.graph_node_ports.admin;
+        format!("http://localhost:{}/", ws_port)
+    }
+}
+
+/// Info about a finished test command
+#[derive(Debug)]
+struct TestCommandResults {
+    success: bool,
+    _exit_code: Option<i32>,
+    stdout: String,
+    stderr: String,
+}
+
+#[derive(Debug)]
+struct StdIO {
+    stdout: Option<String>,
+    stderr: Option<String>,
+}
+impl std::fmt::Display for StdIO {
+    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
+        if let Some(ref stdout) = self.stdout {
+            write!(f, "{}", stdout)?;
+        }
+        if let Some(ref stderr) = self.stderr {
+            write!(f, "{}", stderr)?
+        }
+        Ok(())
+    }
+}
+
+// The results of a finished integration test
+#[derive(Debug)]
+struct IntegrationTestResult {
+    test_setup: IntegrationTestSetup,
+    test_command_results: TestCommandResults,
+    graph_node_stdio: StdIO,
+}
+
+impl IntegrationTestResult {
+    fn print_outcome(&self) {
+        let status = match self.test_command_results.success {
+            true => "SUCCESS",
+            false => "FAILURE",
+        };
+        println!("- Test: {}: {}", status, self.test_setup.test_name())
+    }
+
+    fn print_failure(&self) {
+        if self.test_command_results.success {
+            return;
+        }
+        let test_name = self.test_setup.test_name();
+        println!("=============");
+        println!("\nFailed test: {}", test_name);
+        println!("-------------");
+        println!("{:#?}", self.test_setup);
+        println!("-------------");
+        println!("\nFailed test command output:");
+        println!("---------------------------");
+        println!("{}", self.test_command_results.stdout);
+        println!("{}", self.test_command_results.stderr);
+        println!("--------------------------");
+        println!("graph-node command output:");
+        println!("--------------------------");
+        println!("{}", self.graph_node_stdio);
+    }
+}
+
+/// The main test entrypoint
+#[tokio::test]
+async fn parallel_integration_tests() -> anyhow::Result<()> {
+    // use a environment variable for limiting the number of concurrent tests
+    let n_parallel_tests: usize = std::env::var("N_CONCURRENT_TESTS")
+        .ok()
+        .and_then(|x| x.parse().ok())
+        .unwrap_or(DEFAULT_N_CONCURRENT_TESTS);
+
+    let current_working_directory =
+        std::env::current_dir().context("failed to identify working directory")?;
+    let integration_tests_root_directory = current_working_directory.join("integration-tests");
+
+    // pull required docker images
+    pull_images().await;
+
+    let test_directories = INTEGRATION_TESTS_DIRECTORIES
+        .iter()
+        .map(|ref p| integration_tests_root_directory.join(PathBuf::from(p)))
+        .collect::<Vec<PathBuf>>();
+
+    // Show discovered tests
+    println!("Found {} integration tests:", test_directories.len());
+    for dir in &test_directories {
+        println!("  - {}", basename(dir));
+    }
+
+    // run `yarn` command to build workspace
+    run_yarn_command(&integration_tests_root_directory).await;
+
+    // start docker containers for Postgres and IPFS and wait for them to be ready
+    let postgres = Arc::new(
+        DockerTestClient::start(TestContainerService::Postgres)
+            .await
+            .context("failed to start container service for Postgres.")?,
+    );
+    postgres
+        .wait_for_message(
+            b"database system is ready to accept connections",
+            &*POSTGRES_HARD_WAIT_SECONDS,
+        )
+        .await
+        .context("failed to wait for Postgres container to be ready to accept connections")?;
+
+    let ipfs = DockerTestClient::start(TestContainerService::Ipfs)
+        .await
+        .context("failed to start container service for IPFS.")?;
+    ipfs.wait_for_message(b"Daemon is ready", &*IPFS_HARD_WAIT_SECONDS)
+        .await
+        .context("failed to wait for Ipfs container to be ready to accept connections")?;
+
+    let postgres_ports = Arc::new(
+        postgres
+            .exposed_ports()
+            .await
+            .context("failed to obtain exposed ports for the Postgres container")?,
+    );
+    let ipfs_ports = Arc::new(
+        ipfs.exposed_ports()
+            .await
+            .context("failed to obtain exposed ports for the IPFS container")?,
+    );
+
+    let graph_node = Arc::new(
+        fs::canonicalize("../target/debug/graph-node")
+            .context("failed to infer `graph-node` program location. (Was it built already?)")?,
+    );
+
+    // run tests
+    let mut test_results = Vec::new();
+
+    let mut stream = tokio_stream::iter(test_directories)
+        .map(|dir| {
+            run_integration_test(
+                dir.clone(),
+                postgres.clone(),
+                postgres_ports.clone(),
+                ipfs_ports.clone(),
+                graph_node.clone(),
+            )
+        })
+        .buffered(n_parallel_tests);
+
+    let mut failed = false;
+    while let Some(test_result) = stream.next().await {
+        let test_result = test_result?;
+        if !test_result.test_command_results.success {
+            failed = true;
+        }
+        test_results.push(test_result);
+    }
+
+    // Stop containers.
+    postgres
+        .stop()
+        .await
+        .context("failed to stop container service for Postgres")?;
+    ipfs.stop()
+        .await
+        .context("failed to stop container service for IPFS")?;
+
+    // print failures
+    for failed_test in test_results
+        .iter()
+        .filter(|t| !t.test_command_results.success)
+    {
+        failed_test.print_failure()
+    }
+
+    // print test result summary
+    println!("\nTest results:");
+    for test_result in &test_results {
+        test_result.print_outcome()
+    }
+
+    if failed {
+        Err(anyhow::anyhow!("Some tests have failed"))
+    } else {
+        Ok(())
+    }
+}
+
+/// Prepare and run the integration test
+async fn run_integration_test(
+    test_directory: PathBuf,
+    postgres_docker: Arc<DockerTestClient>,
+    postgres_ports: Arc<MappedPorts>,
+    ipfs_ports: Arc<MappedPorts>,
+    graph_node_bin: Arc<PathBuf>,
+) -> anyhow::Result<IntegrationTestResult> {
+    // start a dedicated ganache container for this test
+    let unique_ganache_counter = get_unique_ganache_counter();
+    let ganache = DockerTestClient::start(TestContainerService::Ganache(unique_ganache_counter))
+        .await
+        .context("failed to start container service for Ganache.")?;
+    ganache
+        .wait_for_message(b"Listening on ", &*GANACHE_HARD_WAIT_SECONDS)
+        .await
+        .context("failed to wait for Ganache container to be ready to accept connections")?;
+
+    let ganache_ports: MappedPorts = ganache
+        .exposed_ports()
+        .await
+        .context("failed to obtain exposed ports for Ganache container")?;
+
+    // build URIs
+    let postgres_unique_id = get_unique_postgres_counter();
+
+    let postgres_uri = make_postgres_uri(&postgres_unique_id, &postgres_ports);
+    let ipfs_uri = make_ipfs_uri(&ipfs_ports);
+    let (ganache_port, ganache_uri) = make_ganache_uri(&ganache_ports);
+
+    // create test database
+    DockerTestClient::create_postgres_database(&postgres_docker, &postgres_unique_id)
+        .await
+        .context("failed to create the test database.")?;
+
+    // prepare to run test comand
+    let test_setup = IntegrationTestSetup {
+        postgres_uri,
+        ipfs_uri,
+        ganache_uri,
+        ganache_port,
+        graph_node_bin,
+        graph_node_ports: GraphNodePorts::get_ports(),
+        test_directory,
+    };
+
+    // spawn graph-node
+    let mut graph_node_child_command = run_graph_node(&test_setup).await?;
+
+    println!("Test started: {}", basename(&test_setup.test_directory));
+    let test_command_results = run_test_command(&test_setup).await?;
+
+    // stop graph-node
+
+    let graph_node_stdio = stop_graph_node(&mut graph_node_child_command).await?;
+    // stop ganache container
+    ganache
+        .stop()
+        .await
+        .context("failed to stop container service for Ganache")?;
+
+    Ok(IntegrationTestResult {
+        test_setup,
+        test_command_results,
+        graph_node_stdio,
+    })
+}
+
+/// Runs a command for a integration test
+async fn run_test_command(test_setup: &IntegrationTestSetup) -> anyhow::Result<TestCommandResults> {
+    let output = Command::new("yarn")
+        .arg("test")
+        .env("GANACHE_TEST_PORT", test_setup.ganache_port.to_string())
+        .env("GRAPH_NODE_ADMIN_URI", test_setup.graph_node_admin_uri())
+        .env(
+            "GRAPH_NODE_HTTP_PORT",
+            test_setup.graph_node_ports.http.to_string(),
+        )
+        .env(
+            "GRAPH_NODE_INDEX_PORT",
+            test_setup.graph_node_ports.index.to_string(),
+        )
+        .env("IPFS_URI", &test_setup.ipfs_uri)
+        .current_dir(&test_setup.test_directory)
+        .output()
+        .await
+        .context("failed to run test command")?;
+
+    let test_name = test_setup.test_name();
+    let stdout_tag = format!("[{}:stdout] ", test_name);
+    let stderr_tag = format!("[{}:stderr] ", test_name);
+
+    Ok(TestCommandResults {
+        success: output.status.success(),
+        _exit_code: output.status.code(),
+        stdout: pretty_output(&output.stdout, &stdout_tag),
+        stderr: pretty_output(&output.stderr, &stderr_tag),
+    })
+}
+async fn run_graph_node(test_setup: &IntegrationTestSetup) -> anyhow::Result<Child> {
+    use std::process::Stdio;
+
+    let mut command = Command::new(test_setup.graph_node_bin.as_os_str());
+    command
+        .stdout(Stdio::piped())
+        .stderr(Stdio::piped())
+        // postgres
+        .arg("--postgres-url")
+        .arg(&test_setup.postgres_uri)
+        // ethereum
+        .arg("--ethereum-rpc")
+        .arg(&test_setup.ganache_uri)
+        // ipfs
+        .arg("--ipfs")
+        .arg(&test_setup.ipfs_uri)
+        // http port
+        .arg("--http-port")
+        .arg(test_setup.graph_node_ports.http.to_string())
+        // index node port
+        .arg("--index-node-port")
+        .arg(test_setup.graph_node_ports.index.to_string())
+        // ws  port
+        .arg("--ws-port")
+        .arg(test_setup.graph_node_ports.ws.to_string())
+        // admin  port
+        .arg("--admin-port")
+        .arg(test_setup.graph_node_ports.admin.to_string())
+        // metrics  port
+        .arg("--metrics-port")
+        .arg(test_setup.graph_node_ports.metrics.to_string());
+
+    command
+        .spawn()
+        .context("failed to start graph-node command.")
+}
+
+async fn stop_graph_node(child: &mut Child) -> anyhow::Result<StdIO> {
+    child.kill().await.context("Failed to kill graph-node")?;
+
+    // capture stdio
+    let stdout = match child.stdout.take() {
+        Some(mut data) => Some(process_stdio(&mut data, "[graph-node:stdout] ").await?),
+        None => None,
+    };
+    let stderr = match child.stderr.take() {
+        Some(mut data) => Some(process_stdio(&mut data, "[graph-node:stderr] ").await?),
+        None => None,
+    };
+
+    Ok(StdIO { stdout, stderr })
+}
+
+async fn process_stdio<T: AsyncReadExt + Unpin>(
+    stdio: &mut T,
+    prefix: &str,
+) -> anyhow::Result<String> {
+    let mut buffer: Vec<u8> = Vec::new();
+    stdio
+        .read_to_end(&mut buffer)
+        .await
+        .context("failed to read stdio")?;
+    Ok(pretty_output(&buffer, prefix))
+}
+
+/// run yarn to build everything
+async fn run_yarn_command(base_directory: &impl AsRef<Path>) {
+    println!("Running `yarn` command in integration tests root directory.");
+    let output = Command::new("yarn")
+        .current_dir(base_directory)
+        .output()
+        .await
+        .expect("failed to run yarn command");
+
+    if output.status.success() {
+        return;
+    }
+    println!("Yarn command failed.");
+    println!("{}", pretty_output(&output.stdout, "[yarn:stdout]"));
+    println!("{}", pretty_output(&output.stderr, "[yarn:stderr]"));
+    panic!("Yarn command failed.")
+}
+
+fn parse_numeric_environment_variable(environment_variable_name: &str) -> Option<u64> {
+    std::env::var(environment_variable_name)
+        .ok()
+        .and_then(|x| x.parse().ok())
+}
diff --git a/tests/tests/runner.rs b/tests/tests/runner.rs
new file mode 100644
index 0000000..8339c8a
--- /dev/null
+++ b/tests/tests/runner.rs
@@ -0,0 +1,223 @@
+use std::sync::Arc;
+
+use cid::Cid;
+use graph::blockchain::{Block, BlockPtr};
+use graph::env::EnvVars;
+use graph::object;
+use graph::prelude::ethabi::ethereum_types::H256;
+use graph::prelude::{SubgraphAssignmentProvider, SubgraphName};
+use graph_tests::fixture::ethereum::{chain, empty_block, genesis};
+use graph_tests::fixture::{self, stores, test_ptr};
+
+#[tokio::test]
+async fn data_source_revert() -> anyhow::Result<()> {
+    let stores = stores("./integration-tests/config.simple.toml").await;
+
+    let subgraph_name = SubgraphName::new("data-source-revert").unwrap();
+    let hash = {
+        let test_dir = format!("./integration-tests/{}", subgraph_name);
+        fixture::build_subgraph(&test_dir).await
+    };
+
+    let blocks = {
+        let block0 = genesis();
+        let block1 = empty_block(block0.ptr(), test_ptr(1));
+        let block1_reorged_ptr = BlockPtr {
+            number: 1,
+            hash: H256::from_low_u64_be(12).into(),
+        };
+        let block1_reorged = empty_block(block0.ptr(), block1_reorged_ptr.clone());
+        let block2 = empty_block(block1_reorged_ptr, test_ptr(2));
+        let block3 = empty_block(block2.ptr(), test_ptr(3));
+        let block4 = empty_block(block3.ptr(), test_ptr(4));
+        vec![block0, block1, block1_reorged, block2, block3, block4]
+    };
+
+    let chain = Arc::new(chain(blocks.clone(), &stores).await);
+    let ctx = fixture::setup(
+        subgraph_name.clone(),
+        &hash,
+        &stores,
+        chain.clone(),
+        None,
+        None,
+    )
+    .await;
+
+    let stop_block = test_ptr(2);
+    ctx.start_and_sync_to(stop_block).await;
+    ctx.provider.stop(ctx.deployment.clone()).await.unwrap();
+
+    // Test loading data sources from DB.
+    let stop_block = test_ptr(3);
+    ctx.start_and_sync_to(stop_block).await;
+
+    // Test grafted version
+    let subgraph_name = SubgraphName::new("data-source-revert-grafted").unwrap();
+    let hash = fixture::build_subgraph_with_yarn_cmd(
+        "./integration-tests/data-source-revert",
+        "deploy:test-grafted",
+    )
+    .await;
+    let graft_block = Some(test_ptr(3));
+    let ctx = fixture::setup(
+        subgraph_name.clone(),
+        &hash,
+        &stores,
+        chain,
+        graft_block,
+        None,
+    )
+    .await;
+    let stop_block = test_ptr(4);
+    ctx.start_and_sync_to(stop_block).await;
+
+    let query_res = ctx
+        .query(r#"{ dataSourceCount(id: "4") { id, count } }"#)
+        .await
+        .unwrap();
+
+    // TODO: The semantically correct value for `count` would be 5. But because the test fixture
+    // uses a `NoopTriggersAdapter` the data sources are not reprocessed in the block in which they
+    // are created.
+    assert_eq!(
+        query_res,
+        Some(object! { dataSourceCount: object!{ id: "4", count: 4 } })
+    );
+
+    Ok(())
+}
+
+#[tokio::test]
+async fn typename() -> anyhow::Result<()> {
+    let subgraph_name = SubgraphName::new("typename").unwrap();
+
+    let hash = {
+        let test_dir = format!("./integration-tests/{}", subgraph_name);
+        fixture::build_subgraph(&test_dir).await
+    };
+
+    let blocks = {
+        let block_0 = genesis();
+        let block_1 = empty_block(block_0.ptr(), test_ptr(1));
+        let block_1_reorged_ptr = BlockPtr {
+            number: 1,
+            hash: H256::from_low_u64_be(12).into(),
+        };
+        let block_1_reorged = empty_block(block_0.ptr(), block_1_reorged_ptr);
+        let block_2 = empty_block(block_1_reorged.ptr(), test_ptr(2));
+        let block_3 = empty_block(block_2.ptr(), test_ptr(3));
+        vec![block_0, block_1, block_1_reorged, block_2, block_3]
+    };
+
+    let stop_block = blocks.last().unwrap().block.ptr();
+
+    let stores = stores("./integration-tests/config.simple.toml").await;
+    let chain = Arc::new(chain(blocks, &stores).await);
+    let ctx = fixture::setup(subgraph_name.clone(), &hash, &stores, chain, None, None).await;
+
+    ctx.start_and_sync_to(stop_block).await;
+
+    Ok(())
+}
+
+#[tokio::test]
+async fn file_data_sources() {
+    let stores = stores("./integration-tests/config.simple.toml").await;
+
+    let subgraph_name = SubgraphName::new("file-data-sources").unwrap();
+    let hash = {
+        let test_dir = format!("./integration-tests/{}", subgraph_name);
+        fixture::build_subgraph(&test_dir).await
+    };
+
+    let blocks = {
+        let block_0 = genesis();
+        let block_1 = empty_block(block_0.ptr(), test_ptr(1));
+        let block_2 = empty_block(block_1.ptr(), test_ptr(2));
+        vec![block_0, block_1, block_2]
+    };
+    let stop_block = test_ptr(1);
+    let chain = Arc::new(chain(blocks, &stores).await);
+    let ctx = fixture::setup(subgraph_name.clone(), &hash, &stores, chain, None, None).await;
+    ctx.start_and_sync_to(stop_block).await;
+
+    // CID QmVkvoPGi9jvvuxsHDVJDgzPEzagBaWSZRYoRDzU244HjZ is the file
+    // `file-data-sources/abis/Contract.abi` after being processed by graph-cli.
+    let id = format!(
+        "0x{}",
+        hex::encode(
+            Cid::try_from("QmVkvoPGi9jvvuxsHDVJDgzPEzagBaWSZRYoRDzU244HjZ")
+                .unwrap()
+                .to_bytes(),
+        )
+    );
+
+    let query_res = ctx
+        .query(&format!(r#"{{ ipfsFile(id: "{id}") {{ id, content }} }}"#,))
+        .await
+        .unwrap();
+
+    assert_eq!(
+        query_res,
+        Some(object! { ipfsFile: object!{ id: id , content: "[]" } })
+    );
+
+    // Test loading offchain data sources from DB.
+    ctx.provider.stop(ctx.deployment.clone()).await.unwrap();
+    let stop_block = test_ptr(2);
+    ctx.start_and_sync_to(stop_block).await;
+}
+
+#[tokio::test]
+async fn template_static_filters_false_positives() {
+    let stores = stores("./integration-tests/config.simple.toml").await;
+
+    let subgraph_name = SubgraphName::new("dynamic-data-source").unwrap();
+    let hash = {
+        let test_dir = format!("./integration-tests/{}", subgraph_name);
+        fixture::build_subgraph(&test_dir).await
+    };
+
+    let blocks = {
+        let block_0 = genesis();
+        let block_1 = empty_block(block_0.ptr(), test_ptr(1));
+        let block_2 = empty_block(block_1.ptr(), test_ptr(2));
+        vec![block_0, block_1, block_2]
+    };
+    let stop_block = test_ptr(1);
+    let chain = Arc::new(chain(blocks, &stores).await);
+
+    let mut env_vars = EnvVars::default();
+    env_vars.experimental_static_filters = true;
+
+    let ctx = fixture::setup(
+        subgraph_name.clone(),
+        &hash,
+        &stores,
+        chain,
+        None,
+        Some(env_vars),
+    )
+    .await;
+    ctx.start_and_sync_to(stop_block).await;
+
+    let poi = ctx
+        .store
+        .get_proof_of_indexing(&ctx.deployment.hash, &None, test_ptr(1))
+        .await
+        .unwrap();
+
+    // This check exists to prevent regression of https://github.com/graphprotocol/graph-node/issues/3963
+    // when false positives go through the block stream, they should be discarded by
+    // `DataSource::match_and_decode`. The POI below is generated consistently from the empty
+    // POI table. If this fails it's likely that either the bug was re-introduced or there is
+    // a change in the POI infrastructure.
+    assert_eq!(
+        poi.unwrap(),
+        [
+            196, 173, 167, 52, 226, 19, 154, 61, 189, 94, 19, 229, 18, 7, 0, 252, 234, 49, 110,
+            179, 105, 64, 16, 46, 25, 194, 83, 94, 195, 225, 56, 252
+        ],
+    );
+}